LeetCode#647 Palindromic Substrings

最新推荐文章于 2024-11-05 21:58:11 发布

eleven_mie11

最新推荐文章于 2024-11-05 21:58:11 发布

阅读量151

点赞数

分类专栏： LeetCode 文章标签： leetcode 算法动态规划

本文链接：https://blog.csdn.net/eleven_mie11/article/details/78962620

版权

LeetCode 专栏收录该内容

14 篇文章 0 订阅

订阅专栏

[Description]:

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".

Note:

The input string length won't exceed 1000.

[题解]:

找到字符串中的回文子序列的个数。这道题是动态规划问题，若一个字符串是回文的，那么如果这个字符串前一个字符和后一个字符相等的话，那这个新的字符串也是回文的。因此dp[i][j](j>=i)表示从第i个字符到第j个字符的字符串是否为回文的。

[Solution]:

class Solution {
public:
    int countSubstrings(string s) {
        int l = s.length();
        int res = 0;
        bool dp[l][l];
        for (int i = 0; i < l; i++) {
        	for (int j = 0; j < l; j++) {
        		dp[i][j] = false;
        	}
        }
        for (int i = 0; i < l; i++) {
        	for (int j = 0; j <= i; j++) {
        		if (i-j < 2) {
        			dp[j][i] = (s[i]==s[j]);
        		} else {
        			dp[j][i] = (s[i]==s[j]) && dp[j+1][i-1];
        		}
        		if (dp[j][i]) {
        			res++;
        		}
        	}
        }
        return res;
    }
};