1
int n = s.length();
2
        int count = 0;
3
        for(int i = 0;i<n;i++){
4
            int l = i;
5
            int r = l;
6
            while(l>=0 && r<n && s[l]==s[r]){
7
                count++;
8
                l--;
9
                r++;
10
            }
11
        }
12
        for(int i = 0;i<n-1;i++){
13
            int l =  i;
14
            int r = l+1;
15
            while(l>=0 && r<n && s[l]==s[r]){
16
                count++;
17
                l--;
18
                r++;
19
            }
20
        }
21
        return count;