Dynamic Programing -- Leetcode problem 647. Palindromic Substrings

• 描述：Given a string, your task is to count how many palindromic substrings in this string.

The substrings with different start indexes or end indexes are counted as different substrings even they consist of same characters.

Example 1:

Input: “abc”
Output: 3
Explanation: Three palindromic strings: “a”, “b”, “c”.

Example 2:

Input: “aaa”
Output: 6
Explanation: Six palindromic strings: “a”, “a”, “a”, “aa”, “aa”, “aaa”.

• 分析：这道题实要求寻找一个字符串中的所有回文串，并输出个数。

• 思路一：直接按顺序寻找

class Solution {
public:
    int countSubstrings(string s) {
    string str1 = "";
    string str2 = "";
    int count = 0;
    for (int i = 0; i < s.size(); i++) {
        for (int j = 1; j <= s.size() - i; j++) {
            str1 = s.substr(i, j);
            str2 = str1;
            reverse(str2.begin(), str2.end());
            if (str2 == str1) {
                count++;
               // cout << count << endl;
            }
            str1 = "";
            str2 = "";
        }
    }
    return count;
}
};

• 使用动态规划思想解决，利用一个二维数组dp[i][j]来存储从i到j的字符串是否为回文串，如果是则dp为1，否则dp为0。

class Solution {
public:
    int countSubstrings(string s) {
        int n = s.size();
        int count = 0;
        int dp[n][n] = {0};
        for (int i = 0; i < n; i++) {
            dp[i][i] = 1;
            count++;
            for (int j = 0; j < i; j++) {
                if (s[i] == s[j] && (j + 1 >= i - 1 || dp[j + 1][i - 1])) {
                    dp[j][i] = 1;
                    count++;
                }
            }
        }
    return count;
    }
};

这道题在用dp解的时候，可以分为以下几种情况：
1.每个单个字符是它自己的回文串
2.从中心向两边扩展的方式来对回文串进行判断（j+1，i-1）