[LeetCode]300. Longest Increasing Subsequence最长递增子序列

艾恩凝

个人博客  https://aeneag.xyz/ 

每日一题，坚持下来 

https://leetcode-cn.com/problems/longest-increasing-subsequence/

这道题用动态规划解决，复杂度有点高，动态规划规则总是自己想不到

class Solution {
public:
    int lengthOfLIS(vector& nums) {
        int len = nums.size();
        if(!len)return 0;
        vector dp(len,1);
        for(int i = 0 ; i