300. 最长递增子序列(c++)

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