【代码随想录Day53】动态规划

1143 最长公共子序列

https://leetcode.cn/problems/longest-common-subsequence/

结尾不等则砍一边，结尾相等则两边都砍。

class Solution {
    public int longestCommonSubsequence(String text1, String text2) {
        int[][] dp = new int[text1.length() + 1][text2.length() + 1];
        for (int i = 1; i <= text1.length(); i++) {
            for (int j = 1; j <= text2.length(); j++) {
                if (text1.charAt(i - 1) == text2.charAt(j - 1)) {
                    dp[i][j] = dp[i - 1][j - 1] + 1;
                } else {
                    dp[i][j] = Math.max(dp[i - 1][j], dp[i][j - 1]);
                }
            }
        }
        return dp[text1.length()][text2.length()];
    }
}

class Solution {         //滚动数组空间 O（n)
    public int longestCommonSubsequence(String text1, String text2) {
        int[] pre = new int[text2.length() + 1];
        int[] dp = new int[text2.length() + 1];
        for (int i = 1; i <= text1.length(); i++) {
            for (int j = 1; j <= text2.length(); j++) {
                if (text1.charAt(i - 1) == text2.charAt(j - 1)) {
                    dp[j] = pre[j - 1] + 1;            //没更新过的用pre
                } else {
                    dp[j] = Math.max(pre[j], dp[j - 1]);        //没更新过的用pre, 更新过的用dp
                }
            }
            int[] temp = pre;
            pre = dp;
            Arrays.fill(temp, 0);
            dp = temp;
        }
        return pre[text2.length()];
    }
}

1035 不相交的线

https://leetcode.cn/problems/uncrossed-lines/

关键是转化为最长公共子序列问题，和上题一模一样，马甲难。

class Solution {     
    public int maxUncrossedLines(int[] nums1, int[] nums2) {
        int[] pre = new int[nums2.length + 1];
        for (int i = 1; i <= nums1.length; i++) {
            int[] dp = new int[nums2.length + 1];
            for (int j = 1; j <= nums2.length; j++) {
                if (nums1[i - 1] == nums2[j - 1]) {
                    dp[j] = pre[j - 1] + 1;
                } else {
                    dp[j] = Math.max(pre[j], dp[j - 1]);
                }
            }
            pre = dp;
        }
        return pre[nums2.length];
    }
}

53 最大子序和

https://leetcode.cn/problems/maximum-subarray/

class Solution {
    public int maxSubArray(int[] nums) {
        int sum = 0;
        int globalMax = Integer.MIN_VALUE;
        for (int num : nums) {
            sum = (sum < 0 ? 0 : sum) + num; //三目运算符优先级低要加括号
            globalMax = Math.max(globalMax, sum);
        }
        return globalMax;
    }
}

class Solution {   //方法二，prefix里找前值最小
    public int maxSubArray(int[] nums) {
        int minPrefixSum = 0;
        int result = Integer.MIN_VALUE;
        int prefixSum = 0;
        for (int i = 0; i < nums.length; i++) {
            prefixSum += nums[i];
            result = Math.max(result, prefixSum - minPrefixSum);
            minPrefixSum = Math.min(prefixSum, minPrefixSum);
        }
        return result;
    }
}