[LeetCode] 131. Palindrome Partitioning

Given a string s, partition s such that every substring of the partition is a palindrome.

Return all possible palindrome partitioning of s.

For example, given s = “aab”,
Return

[  ["aa","b"],  ["a","a","b"]]

class Solution {public:    vector<vector<string>> partition(string s) {        vector<vector<string>> res;        vector<string> comb;        partition(res, comb, s, 0);        return res;    }private:    void partition(vector<vector<string>>& res, vector<string>& comb, string& s, int base) {        if (base == s.length()) {            res.push_back(comb);            return;        }        for (int i = base; i < s.length(); i++) {            if (IsPalindrome(s, base, i)) {                comb.push_back(s.substr(base, i - base + 1));                partition(res, comb, s, i + 1);                comb.pop_back();            }        }    }    bool IsPalindrome(string& s, int i, int j) {        for (; i <= j && s[i] == s[j]; i++, j--)            ;        return i > j;    }};