1143.最长公共子序列
这道题的难点在于递推条件的设置
主要分为两种情况
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 - 1][j], dp[i][j - 1]);
}
}
}
return dp[text1.size()][text2.size()];
}
};
1035.不相交的线
这道题难以抽象为常见题目
本质上是在求两个序列的最长子串的长度,如下图所示
所以代码和上一题一样,直接复制粘贴就好
class Solution {
public:
int maxUncrossedLines(vector<int>& A, vector<int>& B) {
vector<vector<int>> dp(A.size() + 1, vector<int>(B.size() + 1, 0));
for (int i = 1; i <= A.size(); i++) {
for (int j = 1; j <= B.size(); j++) {
if (A[i - 1] == B[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[A.size()][B.size()];
}
};
53. 最大子序和 动态规划
每一位的dp[i]有两个来源,分别是dp[i-1]+nums[i]和nums[i]的最大值,因此代码就好写很多
class Solution {
public:
int maxSubArray(vector<int>& nums) {
vector<int> dp(nums.size());
dp[0] = nums[0];
int result = nums[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;
}
};