[LeetCode-Algorithms-647] "Palindromic Substrings" (2017.11.7-WEEK10)

题目链接：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”.

Note:
The input string length won’t exceed 1000.

---

(1)思路：设i为回文串最中间的字母，判断i左右两个字母是否一样，如果一样，j++向两边扩展，计数加一，直至两边不同时跳出内层循环，内部循环对应奇数个字母字符串和偶数个字母字符串。

(2)代码：

class Solution {
public:
    int countSubstrings(string s) {
        int res = 0;
        for(int i = 0; i < s.length(); i++){
            for(int j = 0; i - j >= 0 && i + j < s.length() && s[i - j] == s[i + j]; j++)
                res++;
            for(int j = 0; i - j - 1 >= 0 && i + j < s.length() && s[i - j - 1] == s[i + j]; j++)
                res++;
        }
        return res;
    }
};

(3)提交结果：