代码随想录：最长递增子序列

class Solution {
public:
    int lengthOfLIS(vector<int>& nums) {
        vector<int> dp = vector<int>(nums.size(),1);
        int res = 1;
        for(int i = 0;i<nums.size();i++){
            for(int j = 0;j<i;j++){
                if(nums[i]>nums[j])dp[i] = max(dp[i],dp[j]+1);
                
            }
            res = max(res,dp[i]);
        }
        return res;
    }
};