LeetCode 300最长递增子序列
题目链接:300.最长递增子序列
class Solution {
public:
int lengthOfLIS(vector<int>& nums) {
int ans = 1;
vector<int> dp(nums.size(), 1);
for (int i = 1; i < nums.size(); ++i) {
for (int j = 0; j < i; ++j) {
if (nums[j] < nums[i]) dp[i] = max(dp[i], dp[j] + 1);
}
ans = max(ans, dp[i]);
}
return ans;
}
};
LeetCode 674最长连续递增序列
题目链接:674.最长连续递增序列
//动规
class Solution {
public:
int findLengthOfLCIS(vector<int>& nums) {
int ans = 1;
vector<int> dp(nums.size(), 1);
for (int i = 1; i < nums.size(); ++i) {
if (nums[i - 1] < nums[i]) dp[i] = dp[i - 1] + 1;
ans = max(ans, dp[i]);
}
return ans;
}
};
//贪心
class Solution {
public:
int findLengthOfLCIS(vector<int>& nums) {
int ans = 1, count = 1;
for (int i = 1; i < nums.size(); ++i) {
if (nums[i - 1] < nums[i]) count++;
else count = 1;
ans = max(ans, count);
}
return ans;
}
};
LeetCode 718最长重复子数组
题目链接:718.最长重复子数组
//二维数组
class Solution {
public:
int findLength(vector<int>& nums1, vector<int>& nums2) {
int ans = 0;
vector<vector<int>> dp(nums1.size() + 1, vector<int>(nums2.size() + 1, 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;
ans = max(ans, dp[i][j]);
}
}
return ans;
}
};
//空间优化版本
class Solution {
public:
int findLength(vector<int>& nums1, vector<int>& nums2) {
int ans = 0;
vector<int> dp(nums2.size() + 1, 0);
for (int i = 1; i <= nums1.size(); ++i) {
for (int j = nums2.size(); j >= 1; --j) {
if (nums1[i - 1] == nums2[j - 1]) dp[j] = dp[j - 1] + 1;
else dp[j] = 0;
ans = max(ans, dp[j]);
}
}
return ans;
}
};