20170604_分割成回文串

20170604_分割成回文串

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

#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
using namespace std;

class Solution
{
public:
	//判断给定的一个字符串是不是回文字符串。
	bool isPalindrome(string str, int first, int last)
	{
		while(first<last)
		{
			if(str[first]!=str[last])
				return false;
			else
			{
				++first;
				--last;
			}
		}
		return true;
	}
	//深度优先搜索：递归调用.
	void partitionDFS(string &str, int start, vector<string> &out, vector<vector<string>> &res)
	{
		if(start==str.size())	//临界条件
		{
			res.push_back(out);
			return;
		}
		else
		{
 			for(int i=start; i < static_cast<int>(str.size()); ++i)
			{
				bool r=isPalindrome(str,start,i);
				if(r)
				{
					out.push_back(str.substr(start,i-start+1));
					//cout<<str.substr(start,i-start+1)<<endl;
					partitionDFS(str,i+1,out,res);
					out.pop_back();
				}
			}
		}
	}

    vector<vector<string>> partition(string s) 
	{
		vector<vector<string>> res;
        vector<string> out;
		string::size_type sz=s.size();
		if(sz==0)
		{
			res.push_back(out);
			return res;
		}
		else
		{
			partitionDFS(s,0,out,res);
			return res;
		}
    }
};

int main(void)
{
	//string str="aab";
	string str="aaa";
	vector<vector<string>> res;
	Solution object;
	res=object.partition(str);
	cout<<endl;
	for(auto row:res)
	{
		cout<<"[";
		for(auto mem:row)
			cout<<mem<<",";
		cout<<"]";
		cout<<",";
	}
	system("pause");
	return 0;
}