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

回文子串的个数

java:

 class Solution {
     private int cnt = 0 ;

     public int countSubstrings(String s) {
         for(int i = 0 ; i < s.length() ; i++){
             extendSubstrings(s,i,i) ;
             extendSubstrings(s,i,i+1) ;
         }
         return cnt ;
     }

     private void extendSubstrings(String s , int left , int right){
         while(left >= 0 && right < s.length() && s.charAt(left) == s.charAt(right)){
             left-- ;
             right++ ;
             cnt++ ;
         }
     }
 }