647. Palindromic Substrings（LeetCode）

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:

1. The input string length won‘t exceed 1000.

    1 class Solution {
    2 public:
    3     int countSubstrings(string s) {
    4        string str1="";
    5         string str2 = "";
    6         int len = s.size();
    7         int count = 0;
    8         for (int i = 0; i < len; i++)
    9         {
   10             for (int j = 1; j+i <= len; j++)
   11             {
   12                 str1 = s.substr(i, j);
   13                 //cout << i << " " << j << " " << str1 << endl;
   14                 str2 = str1;
   15                 reverse(str1.begin(), str1.end());
   16                 if (str2 == str1)
   17                     count++;
   18                 str2 = "";
   19                 str1 = "";
   20             }
   21         }
   22         return count;
   23     }
   24 };

    

647. Palindromic Substrings（LeetCode）

原文：http://www.cnblogs.com/wujufengyun/p/7237731.html