LeetCode OJ：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"]
  ]

典型的dfs，代码如下：

 class Solution {
 public:
     vector<vector<string>> partition(string s) {
         vector<string> path;
         dfs(s, path);
         return ret;
     }

     void dfs(string s, vector<string> & path)
     {
         if(s.size() < )
             ret.push_back(path);
         for(int i = ; i < s.size(); ++i){
             int start = ;
             int end = i;
             while(start < end){
                 if(s[start] == s[end])
                     start++, end--;
                 else
                     break;
             }
             if(start >= end){
                 path.push_back(s.substr(,i+));
                 dfs(s.substr(i+), path);
                 path.pop_back();
             }
         }
     }

 private:
     vector<vector<string>> ret;

 };