LeetCode 300. 最长递增子序列
链接
class Solution {
public:
int lengthOfLIS(vector<int>& nums) {
if(nums.size() <= 1) {
return nums.size();
}
vector<int> dp(nums.size(), 1);
int res = 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);
}
}
res = max(res, dp[i]);
}
return res;
}
};
LeetCode 674. 最长连续递增序列
链接
class Solution {
public:
int findLengthOfLCIS(vector<int>& nums) {
if(nums.size() <= 1) {
return nums.size();
}
int res = 1, count = 1;
for(int i = 1; i < nums.size(); i++) {
if(nums[i] > nums[i - 1]) {
count++;
} else {
count = 1;
}
res = max(res, count);
}
return res;
}
};
class Solution {
public:
int findLengthOfLCIS(vector<int>& nums) {
if(nums.size() <= 1) {
return nums.size();
}
vector<int> dp(nums.size(), 1);
int max_len = 1;
for(int i = 1; i < nums.size(); i++) {
if(nums[i] > nums[i - 1]) {
dp[i] = dp[i - 1] + 1;
}
max_len = max(max_len, dp[i]);
}
return max_len;
}
};
LeetCode 718. 最长重复子数组
链接
class Solution {
public:
int findLength(vector<int>& nums1, vector<int>& nums2) {
vector<vector<int>> dp(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]) {
dp[i][j] = dp[i - 1][j - 1] + 1;
}
res = max(res, dp[i][j]);
}
}
return res;
}
};