文档链接:https://programmercarl.com/
LeetCode1143.最长公共子序列
题目链接:https://leetcode.cn/problems/longest-common-subsequence/
思路:跟上一题最长重复子数组好像,不过这题不要求连续。主要的还是dp数组的定义以及递推公式。
动规:
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()];
}
};
LeetCode1035.不相交的线
题目链接:https://leetcode.cn/problems/uncrossed-lines/
思路:就是求两数组的最长公共子序列。
动规:
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()];
}
};
LeetCode53.最大子数和
题目链接:https://leetcode.cn/problems/maximum-subarray/
思路:dp[i]:以nums[i]为尾的连续子数组的最大和。
动规:
class Solution {
public:
int maxSubArray(vector<int>& nums) {
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(dp[i] > result) result = dp[i];
}
return result;
}
};
总结:有难又不难的感觉。