Given a string 

s, partition 

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

Return all possible palindrome partitioning of s.

Example:Input: "aab"Output:[  ["aa","b"],  ["a","a","b"]]

code

class Solution{public:    vector
      
       
        > partition(string s)    {        if(s.empty())            return {};        vector
        
         
          > res;        vector
          
            tmp;        partitionCore(s,0,tmp,res);        return res;    }private:    void partitionCore(const string &s,int start,vector
           
             &tmp,vector
            
             
              > &res) { if(start==s.size()) { res.emplace_back(tmp); return ; } for(int i=start;i