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”.
Note:
The input string length won’t exceed 1000.
题目:
给定一个字符串,统计该字符串的回文子字符串数。
例1:
输入:“abc”
输出:3
说明:三个回文字符串:“a”,“b”,“c”。
例2:
输入:“aaa”
输出:6
说明:六个回文字符串:“a”,“a”,“a”,“aa”,“aa”,“aaa”。
注意:输入字符串长度不会超过1000。
解法一:
public class Solution {
int count = 0;
public int countSubstrings(String s) {
for(int i = 0;i<s.length();i++){
counts(s,i,i);
counts(s,i,i+1);
}
return count;
}
public void counts(String s, int left, int right){
while(left >=0 && right < s.length() && s.charAt(left) == s.charAt(right)){
count++;
left--;
right++;
}
}
}
Runtime: 6 ms