Leetcode-5150 Longest Chunked Palindrome Decomposition(段式回文)

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

bool judge(string s,int i,int j,int len)
{
    _for(k,0,len)
        if(s[i]!=s[j])
            return false;
        else
            i ++,j ++;
    return true;
}
class Solution
{
    public:
        int longestDecomposition(string text)
        {
            int i = 0;
            int j = text.size()-1;
            int lastj = j;
            int rnt = 0;
            while(i<j)
            {
                if(text[i]==text[j] && judge(text,i,j,lastj-j+1))
                {
                    rnt ++;
                    i += lastj-j+1;
                    lastj = j-1;
                }
                j --;    
            }
            rnt *= 2;
            if(i<=j)
                rnt ++;
            return rnt;
        }
};