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