Palindromic Substrings
Page 1 of 1
Palindromic Substrings
static int count = 0;
public static int countSubstrings(String s) {
if (s == null || s.length() == 0) return 0;
for (int i = 0; i < s.length(); i++) { // i is the mid point
extendPalindrome(s, i, i); // odd length;
extendPalindrome(s, i, i + 1); // even length
}
return count;
}
private static void extendPalindrome(String s, int left, int right) {
while (left >=0 && right < s.length() && s.charAt(left) == s.charAt(right)) {
count++; left--; right++;
}
}
public static void main(String[] args) {
// TODO Auto-generated method stub
int res=countSubstrings("aaa");
System.out.println(res);
}
public static int countSubstrings(String s) {
if (s == null || s.length() == 0) return 0;
for (int i = 0; i < s.length(); i++) { // i is the mid point
extendPalindrome(s, i, i); // odd length;
extendPalindrome(s, i, i + 1); // even length
}
return count;
}
private static void extendPalindrome(String s, int left, int right) {
while (left >=0 && right < s.length() && s.charAt(left) == s.charAt(right)) {
count++; left--; right++;
}
}
public static void main(String[] args) {
// TODO Auto-generated method stub
int res=countSubstrings("aaa");
System.out.println(res);
}
Similar topics
» Distinct Palindrome Substrings
» Palindromic Subsequences 只返回个数难度不大
» Longest Palindromic Subsequence 高频题其它公司也喜欢考需bug free同时讲原理
» Palindromic Subsequences 只返回个数难度不大
» Longest Palindromic Subsequence 高频题其它公司也喜欢考需bug free同时讲原理
Page 1 of 1
Permissions in this forum:
You cannot reply to topics in this forum