Leetcode刷题笔记(c++)

充分利用回文数子串的对称性

class Solution {
public:
    int countSubstrings(string s) {
        int n=s.size();
        int out=0;
        for(int i=0;i
            // cout<<"da"<-1&&k
                j--;
                k++;
                out++;
                // cout<<"zhong1"<-1&&s[j]==s[k]){
                j--;
                k++;
                out++;
                // cout<<"zhong2"<