Leetcode-5175 Can Make Palindrome from Substring(构建回文串检测)

#define _for(i,a,b) for(int i = (a);i < b;i ++)
#define _rep(i,a,b) for(int i = (a);i > b;i --)

class Solution
{
    public:
        vector<bool> canMakePaliQueries(string s, vector<vector<int>>& queries)
        {
            vector<bool> v;
            long long sum[100003][27];
            memset(sum,0,sizeof(sum));
            sum[1][s[0]-'a'] ++;
            _for(i,2,s.size()+1)
            {
                memcpy(sum[i],sum[i-1],sizeof(sum[i]));
                sum[i][s[i-1]-'a'] ++;
            }
            
            _for(i,0,queries.size())
            {
                int rnt = 0;
                _for(j,0,27)
                {
                    int tmp = sum[queries[i][1]+1][j]-sum[queries[i][0]][j];
                    if(tmp&0x1)
                        rnt ++;
                }
                if(rnt/2<=queries[i][2])
                    v.push_back(true);
                else
                    v.push_back(false);
            }
            return v;
        }
};