647. Palindromic Substrings

class Solution {
   public int countSubstrings(String s) {
        boolean[][] dp = new boolean[s.length()][s.length()];
        int result = 0;
        for (int i = 0; i < s.length(); i++) {
            dp[i][i] = true;
            result++;
        }
        for (int i = 0; i < s.length() - 1; i++) {
            if (s.charAt(i) == s.charAt(i + 1)) {
                dp[i][i + 1] = true;
                result++;
            }
        }

        for (int i = 2; i < s.length() ; i++) {//len
            for (int j = 0; (j < s.length() )&&(i+j<s.length()); j++) {//position
                if (s.charAt(j) == s.charAt(i + j) && dp[j + 1][i + j - 1]){
                    dp[j][i + j] = true;
                    result++;
                }

            }
        }

        return result;
    }
}