LeetCode300. 最长递增子序列

 1 class Solution {
 2 public:
 3     int lengthOfLIS(vector<int>& nums) {
 4         if(nums.size() <= 1) return nums.size();
 5         vector<int>dp(nums.size()+1,1);
 6         int res = 0;
 7         for(int i = 1;i < nums.size();i++){
 8             for(int j = 0;j < i;j++){
 9                 if(nums[i] > nums[j]) dp[i] = max(dp[i],dp[j]+1);
10             }
11             res = max(res,dp[i]);
12         }    
13         return res;
14     }
15 };