LeetCode|647. Palindromic Substrings

最新推荐文章于 2025-02-04 17:09:38 发布

原创最新推荐文章于 2025-02-04 17:09:38 发布 · 268 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

LeetCode 专栏收录该内容

59 篇文章

订阅专栏

本文介绍了一种算法，用于计算给定字符串中所有回文子串的数量。通过实例演示了如何判断一个字符串是否为回文，并详细解释了算法实现过程，包括如何逐个检查每个字符作为结尾的子串是否构成回文。

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.

class Solution {
    //依次往后，只需判断当前增加这个字母之后又增加了多少个回文串
    
    //判断这一段是不是回文串
        boolean isPalindromic(String s,int start,int end){
            if(start>end)
                return false;
            while(start<=end){
                if(s.charAt(start)!=s.charAt(end))
                    return false;
                else{
                    start++;
                    end--;
                }
            }
            return true;
        }
    
    //就算以此位置为结尾的字符串一共有多少个字符串
    int count(String s,int pos){
        int ans=0;
        for(int i=0;i<=pos;i++){
            if(isPalindromic(s,i,pos)){
                ans++;
            }
        }
        return ans;
    }
    
    public int countSubstrings(String s) {
        if(s.length()<1)
            return 0;
        else if(s.length()==1)
            return 1;
        int[] ans=new int[s.length()];
        ans[0]=1;
        for(int i=1;i<s.length();i++){
            ans[i]=ans[i-1]+count(s,i);
        }
        return ans[s.length()-1];
        
    }
}