Leetcode 647 "Palindromic Substrings"

January 3, 2020

647. Palindromic Substrings

Result

Runtime: 1 ms, faster than 100.00% of Java online submissions for Palindromic Substrings.

Memory Usage: 34.2 MB, less than 100.00% of Java online submissions for Palindromic Substrings.

class Solution {

    public int countSubstrings(String s) {
        if (s.length() == 0) {
            return 0;
        }
        if (s.length() == 1) {
            return 1;
        }
        int count=0;
        for(int i = 0; i<s.length(); i++) {
            count = count + getPalindroms(s, i, i);
            count = count + getPalindroms(s, i, i+1);
        }
        return count;
    }

    private int getPalindroms(String s, int from, int to) {
        int count=0;
        while(from>=0 && to<s.length() && s.charAt(from) == s.charAt(to)) {
            count++;
            from--;
            to++;
        }
        return count;
    }
}