classSolution{public:intlengthOfLIS(vector<int>& nums){if(nums.size()==1)return1;
vector<int>dp(nums.size(),1);int result =0;for(int i =1; i < nums.size();++i){for(int j =0; j < i;++j){if(nums[i]> nums[j]) dp[i]=max(dp[i], dp[j]+1);}if(dp[i]> result) result = dp[i];}return result;}};
674. 最长连续递增序列
classSolution{public:intfindLengthOfLCIS(vector<int>& nums){if(nums.size()==1)return1;
vector<int>dp(nums.size(),1);int result =1;for(int i =1; i < nums.size();++i){if(nums[i]> nums[i -1]) dp[i]= dp[i -1]+1;if(dp[i]> result) result = dp[i];}return result;}};
718. 最长重复子数组
classSolution{public:intfindLength(vector<int>& nums1, vector<int>& nums2){
vector<vector<int>>dp(nums1.size()+1,vector<int>(nums2.size()+1,0));int result =0;for(int i =1; i <= nums1.size();++i){for(int j =1; j <= nums2.size();++j){if(nums1[i -1]== nums2[j -1]) dp[i][j]= dp[i -1][j -1]+1;if(result < dp[i][j]) result = dp[i][j];}}return result;}};