leetcode - Palindrome Partitioning II

 

class Solution {
public:
    bool isPal(const char * p, const char * q){
        while (p<q){
            if (*p != *q)
                return false;
            p++; q--;
        }
        return true;
    }
    int minCut(string s) {
        int n = s.length();
        if (n<=0)
            return 0;
        const char * head = s.c_str();
        const char * end = head + n-1;
        const char * p = head;
        vector<int> ePos(n+1, -1);
        while ((*p) != '\0'){
            const char * q = head;
            int curMax = 1000000000;
            while (q<=p){
                if (curMax<=1+ePos[q-head] || !isPal(q,p)){
                    q++;
                    continue;
                }
                curMax = 1 + ePos[q-head];
                q++;
            }
            ePos[p-head+1] = curMax;
            p++;
        }
        int rlt = ePos[n];
        return rlt;
    }
};