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 {
     public int countSubstrings(String s) {
         int n = s.length();
         int res = ;
         boolean[][] dp = new boolean[n][n];
         for (int i = n - ; i >= ; i--) {
             for (int j = i; j < n; j++) {
                 dp[i][j] = s.charAt(i) == s.charAt(j) && (j - i <  || dp[i + ][j - ]);
                 if(dp[i][j]) ++res;
             }
         }
         return res;
     }
 }

 public class Solution {
     int count = ;

     public int countSubstrings(String s) {
         if (s == null || s.length() == ) return ;

         for (int i = ; i < s.length(); i++) { // i is the mid point
             extendPalindrome(s, i, i); // odd length;
             extendPalindrome(s, i, i + ); // even length
         }
         return count;
     }

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