300. 最长递增子序列

        

class Solution {
public:int lengthOfLIS(vector<int>& nums) {if (nums.size() <= 1) return nums.size();vector<int> f(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]) f[i] = max(f[i], f[j] + 1);}result = max(f[i],result);}return result;}
};

674. 最长连续递增序列

        

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

718. 最长重复子数组

        

class Solution {
public:int findLength(vector<int>& nums1, vector<int>& nums2) {vector<vector<int>> f (nums1.size() + 1, vector<int>(nums2.size() + 1, 0));int res = 0;for (int i = 1; i <= nums1.size(); i++) {for (int j = 1; j <= nums2.size(); j++) {if (nums1[i - 1] == nums2[j - 1]) {f[i][j] = f[i - 1][j - 1] + 1;}res = max(f[i][j],res);}}return res;}
};