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:
    def countSubstrings(self, s):
        """
        :type s: str
        :rtype: int
        """
        if s is None or s==[]:
            return 0
        if len(set(s))==1:
            return (1+len(s))*len(s)//2
        count = 0
        for i in range(len(s)):
            for j in range(i+1,len(s)+1):
                if self.ispal(s[i:j]):
                    count+=1
        return count
    
    def ispal(self,s):
        j = len(s)-1
        i=0
        while i<j:
            if s[i]!=s[j]:
                return False
            i+=1
            j-=1
        return True
        

代码思想来自其他人，学习了，从中间开始往两边寻找判断对应的元素是否相等

class Solution:
    def countSubstrings(self, s):
        """
        :type s: str
        :rtype: int
        """
        n = len(s)
        count=0
        for i in range(n):
            count += 1
            begin = i-1
            end = i+1
            while begin>=0 and end<n and s[begin]==s[end]:
                count+=1
                begin-=1
                end+=1
            begin=i
            end=i+1
            while begin>=0 and end<n and s[begin]==s[end]:
                count+=1
                begin-=1
                end+=1
        return count