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:
class Solution(object):def countSubstrings(self, s):""":type s: str:rtype: int"""num = 0for i in range(0, len(s) + 1):for j in range(i + 1, len(s) + 1):sub = s[i:j]if(sub == sub[::-1]):num = num + 1return num
647. Palindromic Substrings 回文子串的数量
原文：http://www.cnblogs.com/xiejunzhao/p/7354950.html