1143.最长公共子序列
题目链接:1143.最长公共子序列
文档链接:1143.最长公共子序列
视频链接:动态规划子序列问题经典题目 | LeetCode:1143.最长公共子序列
C++实现
class Solution {
public:
int longestCommonSubsequence(string text1, string text2) {
vector<vector<int>> dp(text1.size() + 1,
vector<int>(text2.size() + 1, 0));
for (int i = 1; i <= text1.size(); i++) {
for (int j = 1; j <= text2.size(); j++) {
if (text1[i - 1] == text2[j - 1]) {
dp[i][j] = dp[i - 1][j - 1] + 1;
} else {
dp[i][j] = max(dp[i][j - 1], dp[i - 1][j]);
}
}
}
return dp[text1.size()][text2.size()];
}
};
1035.不相交的线
题目链接:1035.不相交的线
文档链接:1035.不相交的线
视频链接:动态规划之子序列问题,换汤不换药 | LeetCode:1035.不相交的线
C++实现
class Solution {
public:
int maxUncrossedLines(vector<int>& nums1, vector<int>& nums2) {
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;
}
else{
dp[i][j] = max(dp[i -1][j], dp[i][j-1]);
}
}
}
return dp[nums1.size()][nums2.size()];
}
};
53. 最大子序和
题目链接:53. 最大子序和
文档链接:53. 最大子序和
视频链接:看起来复杂,其实是简单动态规划 | LeetCode:53.最大子序和
C++实现
class Solution {
public:
int maxSubArray(vector<int>& nums) {
/*
int sum = 0;
int maxsum = INT32_MIN;
for(int i = 0; i < nums.size(); i++){
sum += nums[i];
if(sum > maxsum) {
maxsum = sum;
}
if(sum <= 0){
sum = 0;
}
}
return maxsum;
*/
if(nums.size() == 0) return 0;
vector<int> dp(nums.size(), 0);
dp[0] = nums[0];
int result = dp[0];
for(int i = 1; i<nums.size(); i++){
dp[i] = max(dp[i - 1] + nums[i] , nums[i]);
if(result < dp[i]){
result = dp[i];
}
}
return result;
}
};