【代码随想录】day53

提示：文章写完后，目录可以自动生成，如何生成可参考右边的帮助文档

---

一、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 = 0; i < text1.size(); i ++) {
            for (int j = 0; j < text2.size(); j ++) {
                if (text1[i] == text2[j]) {
                    dp[i+1][j+1] = dp[i][j] + 1;
                }
                else {
                    dp[i+1][j+1] = max(dp[i][j+1], dp[i+1][j]);
                }
            }
        }
        return dp[text1.size()][text2.size()];
    }
};

状态压缩：用了一个prev保存前一次的dp数组。

class Solution {
public:
    int longestCommonSubsequence(string text1, string text2) {
        vector<int> dp(text2.size() + 1, 0);
        int res = 0;
        vector<int> prev(text2.size() + 1, 0);
        for (int i = 0; i < text1.size(); i ++) {
            prev = dp;
            for (int j = 0; j < text2.size(); j ++) {
                if (text1[i] == text2[j]) {
                    dp[j+1] = prev[j] + 1;
                }
                else {
                    dp[j+1] = max(prev[j+1], dp[j]);
                }
                res = max(res, dp[j+1]);
            }
        }
        return res;
    }
};

二、1035不相交的线

实际上这道题就是找两个数组的最长公共子序列（可以不连续的）

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 = 0; i < nums1.size(); i ++) {
            for (int j = 0; j < nums2.size(); j ++) {
                if (nums1[i] == nums2[j]) {
                    dp[i+1][j+1] = dp[i][j] + 1;
                }
                else {
                    dp[i+1][j+1] = max(dp[i][j+1], dp[i+1][j]);
                }
            }
        }
        return dp[nums1.size()][nums2.size()];
    }
};

状态压缩：（int prev还没搞懂，不过用数组也能减少内存占用）

class Solution {
public:
    int maxUncrossedLines(vector<int>& nums1, vector<int>& nums2) {
        vector<int> dp(nums2.size() + 1, 0);
        vector<int> prev(nums2.size() + 1, 0);
        for (int i = 0; i < nums1.size(); i ++) {
            prev = dp;
            for (int j = 0; j < nums2.size(); j ++) {
                if (nums1[i] == nums2[j]) {
                    dp[j+1] = prev[j] + 1;
                }
                else {
                    dp[j+1] = max(prev[j+1], dp[j]);
                }
            }
        }
        return dp[nums2.size()];
    }
};

三、53最大子序和

class Solution {
public:
    int maxSubArray(vector<int>& nums) {
        vector<int> dp(nums.size(), 0);
        dp[0] = nums[0];
        int res = dp[0];
        for (int i = 1; i < nums.size(); i ++) {
            dp[i] = max(dp[i-1] + nums[i], nums[i]);
            res = max(res, dp[i]);
        }
        return res;
    }
};