字符串分割为回文串（palindrome-partitioning-ii）

题目描述

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

Solution 1(DFS方法搜索所有结果)

//DFS方法
class Solution {
public:
    vector<vector<string>> partition(string s) {
        vector<vector<string> >res;
        if(s.size()<=0) return res;
        vector<string>temp;
        int len=s.size();
        for(int i=1;i<=len;++i)
        {
            string word=s.substr(0,i);//先看str[0-i)是不是回文串
            if(!judge(word)) continue;//如果不是返回i+1
            temp.push_back(word);//如果是，递归调用返回后半字符串的所有可能回文串
            vector<