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"]
  ]

思路：

深搜

代码：

    bool isPalindrome(string s){
        int l = s.length();
        if(l == 1)
            return true;
        int i = 0;
        while(i < l/2){
            if(s[i] != s[l-i-1])
                return false;
            i++;
        }
        return true;
    }
    void search(vector<vector<string> > &result, vector<string> &tmp, string s, int index){
        if(index == s.length()){ 
            result.push_back(tmp);
            return;
        }
        for(int i = index+1; i <= s.length(); i++){
            string t = s.substr(index, i-index);
            if(isPalindrome(t)){
                tmp.push_back(t);
                search(result, tmp, s, i);
                tmp.erase(tmp.end()-1);
            }
        }
    }
    vector<vector<string> > partition(string s) {
        // IMPORTANT: Please reset any member data you declared, as
        // the same Solution instance will be reused for each test case.
        vector<vector<string> > result;
        vector<string> tmp;
        search(result, tmp, s, 0);
        return result;
    }