leetcode之Palindrome Partitioning

class Solution {
public:
    bool isPal(string s) {
        if (s.size()<=1) {
            return true;
        }
        int beg=0;
        int end=s.size()-1;
        while (beg<end) {
            if(s[beg]!=s[end]) {
                return false;
            }
            beg++;
            end--;
        }
        return true;
    }
    vector<vector<string>> partition(string s) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        vector<vector<string> > res;
        if (s.size()<1) {
            return res;
        }
        for (int i=1; i<s.size(); i++) {
            string temp = s.substr(0,i);
            if (!isPal(temp)) {
                continue;
            }
            vector<vector<string> > part = partition(s.substr(i, s.size()-i));
            for (int j=0; j<part.size(); j++) {
                part[j].insert(part[j].begin(), temp);
                res.push_back(part[j]);
            }
        }
        if (isPal(s)) {
            vector<string> v;
            v.push_back(s);
            res.push_back(v);
        }
    }
};