四十四天补打卡,今天是二维动态规划的应用
1143.最长公共子序列
解题过程
- 定义
dp[i][j]
为text1[i - 1]
和text2[j - 1]
部分元素的最长公共子序列 text1[i - 1]
若等于text2[j - 1]
则dp[i][j] = dp[i - 1][j - 1] + 1
- 两者不等于则
dp[i][j] = max(dp[i][j - 1], dp[i - 1][j])
动态规划
class Solution {
public:
int longestCommonSubsequence(string text1, string text2) {
vector<vector<int>>dp(text1.size() + 1, vector<int>(text2.size() + 1));
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] = max(dp[i - 1][j], dp[i][j - 1]);
} else {
dp[i][j] = dp[i - 1][j - 1] + 1;
}
}
}
return dp.back().back();
}
};
1035.不相交的线
解题思路
- 是求最长公共子序列的思路
动态规划
class Solution {
public:
int maxUncrossedLines(vector<int>& nums1, vector<int>& nums2) {
vector<vector<int>>dp(nums1.size() + 1, vector<int>(nums2.size() + 1));
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][j - 1], dp[i - 1][j]);
}
}
}
return dp.back().back();
}
};
53.最大子数组和
- 采用动态规划的思路,dp数组代表当前数组的最大子数组和,它的值由上一个dp和0比较大小后加当前的数组值得来
动态规划
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], 0) + nums[i];
result = max(result, dp[i]);
}
return result;
}
};
392.判断子序列
解题思路
- 求s和t的最大子序列长度,判断其长度是否和s的长度一致
动态规划
class Solution {
public:
bool isSubsequence(string s, string t) {
if (s.size() > t.size()) return false;
vector<vector<int>>dp(s.size() + 1, vector<int>(t.size() + 1));
for (int i = 1; i <= s.size(); i++) {
for (int j = 1; j <= t.size(); j++) {
if (s[i - 1] == t[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.back().back() == s.size();
}
};