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.

示例：

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

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

Note:

1. The input string length won't exceed 1000.

问题分析：

设i到j是否存在回文串的标志为dp[i][j],根据状态转移可知dp[i][j] = s[i] == s[j] && (j - i < 3 || dp[i + 1][j - 1])，若dp[i][j] == true,证明i到j存在回文串。

过程详见代码：

class Solution {
public:
    int countSubstrings(string s) {
        int n = s.length();
		int res = 0;
		vector<vector<bool>> dp(n, vector<bool>(n, false));
		for (int i = n - 1; i >= 0; i--) {
			for (int j = i; j < n; j++) {
				dp[i][j] = s[i] == s[j] && (j - i < 3 || dp[i + 1][j - 1]);
				if (dp[i][j]) ++res;
			}
		}
		return res;
    }
};