/
githubmirror
/
interviews
Обзор
Документация
Войти
/
githubmirror
/
interviews
Код
Запросы
0
Пакеты
0
Релизы
0
Аналитика
Безопасность
master
leetcode/string/PalindromicSubstrings.java
38 строк
1 KB
Kevin Naughton Jr
add PalindromicSubstrings and PaintHouse
29 май 2018, 20:20
29 май 2018, 20:20
daf5e85
Код
Авторство
О чём код?
//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. class PalindromicSubstrings { int result = 0; public int countSubstrings(String s) { if(s == null || s.length() == 0) { return 0; } for(int i = 0; i < s.length(); i++) { extendPalindrome(s, i, i); extendPalindrome(s, i, i + 1); } return result; } public void extendPalindrome(String s, int left, int right) { while(left >= 0 && right < s.length() && s.charAt(left) == s.charAt(right)) { result++; left--; right++; } } }