Palindrome Partitioning

1.问题描述

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

2.解答

class Solution {
public:
    vector<vector<string>> partition(string s) 
    {
        vector<string> temp;
        partition_(s,temp,0);
        return res;
    }
    void partition_(string s,vector<string> temp,int begin) 
    {
        if(begin>=s.size())
        {
            res.push_back(temp);
            return ;
        }
        vector<int> index;
        index=part(s,begin);
        for(int i=0;i<index.size();i++)
        {
            string temp1=s.substr(begin,index[i]-begin+1);
            temp.push_back(temp1);
            partition_(s,temp,index[i]+1);
            temp.pop_back();
        }
        
    }
    vector<int> part(string s,int begin)
    {
        vector<int> res;
        if(begin<s.size())
        {
            int end=begin;
            while(end<s.size())
            {
                int i=begin,j=end;
                 while(i<=j)
                 {
                    
                    if(s[i]!=s[j])
                        break;
                    i++;
                    j--;
                 }
                 if(i>j) res.push_back(end);
                 end++;
            }
        }
        return res;
    }
private:
    vector<vector<string>> res;
};


阅读更多
版权声明:本文为博主原创文章,未经博主允许不得转载。 https://blog.csdn.net/u012201343/article/details/49947439
文章标签: c++
个人分类: LeetCode
上一篇C语言笔试面试总结(网上搜集)
下一篇Factorial Trailing Zeroes
想对作者说点什么? 我来说一句

没有更多推荐了,返回首页

关闭
关闭