当前位置：网站首页>Leetcode 300. longest increasing subsequence

Leetcode 300. longest increasing subsequence

2022-07-22 20:12:00 【henujolly】

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