代码随想录Day57

Day 57

今日任务

• 647. 回文子串
• 516.最长回文子序列
• 动态规划总结篇

代码实现

647. 回文子串

class Solution {
    public int countSubstrings(String s) {
        //dp[i][j]表示[i, j]是否是回文子串
        int result = 0;
        boolean[][] dp = new boolean[s.length()][s.length()];
        char[] chars = s.toCharArray();
        for (int i = s.length() - 1; i >= 0; i--) {
            for (int j = i; j < s.length(); j++) {
                if (chars[i] == chars[j]) {
                    if (j - i <= 1 || dp[i + 1][j - 1]) {
                        result++;
                        dp[i][j] = true;
                    }
                }
            }
        }
        return result;
    }
}

516.最长回文子序列

class Solution {
    public int longestPalindromeSubseq(String s) {
        int[][] dp = new int[s.length() + 1][s.length() + 1];
        for (int i = 0; i < s.length(); i++) {
            dp[i][i] = 1;
        }
        char[] chars = s.toCharArray();
        for (int i = s.length() - 1; i >= 0; i--) {
            for (int j = i + 1; j < s.length(); j++) {
                if (chars[i] == chars[j]) {
                    dp[i][j] = dp[i + 1][j - 1] + 2;
                } else {
                    dp[i][j] = Math.max(dp[i + 1][j], Math.max(dp[i][j], dp[i][j - 1]));
                }
            }
        }
        return dp[0][s.length() - 1];
    }
}

今日总结

1. 难难难，面试也有答案就好了
2. 动态规划完结，不知道啥时候刷第二遍
3. 股票也难难难，不知道是对还是错