LeetCode – Refresh – Palindrome Partitioning I

class Solution {
public:
    bool isP(string s) {
        int start = 0, end = s.size()-1;
        while (start < end) {
            if (s[start++] != s[end--]) return false;
        }
        return true;
    }
    void getP(vector<vector<string> > &result, vector<string> current, string s, int index) {
        if (index == s.size()) {
            result.push_back(current);
            return;
        }
        for (int i = index; i < s.size(); i++) {
            if (isP(s.substr(index, i-index+1))) {
                current.push_back(s.substr(index, i-index+1));
                getP(result, current, s, i+1);
                current.pop_back();
            }
        }
    }
    vector<vector<string>> partition(string s) {
        vector<vector<string> > result;
        getP(result, vector<string> (), s, 0);
        return result;
    }
};