题目1： 300. 最长递增子序列
代码：
class Solution {
public:
int lengthOfLIS(vector<int>& nums) {
int n = nums.size();
vector<int> dp(n, 1);
int result = 1;
for(int i = 1; i < n; i++) {
for(int j = 0; j < i; j++) {
if(nums[j] < nums[i]) {
dp[i] = max(dp[i], dp[j] + 1);
}
}
result = max(result, dp[i]);
}
return result;
}
};
题目2: 674. 最长连续递增序列
代码:
class Solution {
public:
int findLengthOfLCIS(vector<int>& nums) {
int n = nums.size();
vector<int> dp(n, 1);
int result = 1;
for(int i = 1; i < n; i++) {
if(nums[i] > nums[i - 1]) {
dp[i] = dp[i - 1] + 1;
}
result = max(result, dp[i]);
}
return result;
}
};
题目3： 718. 最长重复子数组
代码：
class Solution {
public:
int findLength(vector<int>& nums1, vector<int>& nums2) {
int m = nums1.size(), n = nums2.size();
vector<vector<int>> dp(m + 1, vector<int>(n + 1, 0));
int maxLen = 0;
for(int i = 1; i <= m; i++) {
for(int j = 1; j <= n; j++) {
if(nums1[i - 1] == nums2[j - 1]) {
dp[i][j] = dp[i - 1][j - 1] + 1;
}
else dp[i][j] = 0;
maxLen = max(maxLen, dp[i][j]);
}
}
return maxLen;
}
};
