深度优先搜索(DFS)进行回文串划分

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

void CalcSubPalindrome(const string &str,int size,vector<vector<bool>>&p)
{
	for (int i=0;i<size;i++)
	{
		p[i][i]=true;
	}
	for (int i=size-2;i>=0;i--)
	{
		p[i][i+1]=(str[i]==str[i+1]);
		for (int j=i+2;j<size;j++)
		{
			if ((str[i]==str[j])&&p[i+1][j-1]==true)
			{
				p[i][j]=true;
			}
		}
	}
}/*DP 在(i+1,j-1)为回文串的前提下 str[i]==str[j] ->(i,j)为回文串 */

void MinPalindrome(const string str,int size,int nStart,const vector<vector<bool>>&p,
				   vector<vector<string>>&all,vector<string>&solution)
{
	if (nStart>=size)
	{
		all.push_back(solution);
	}
	for (int i=nStart;i<size;i++)
	{
		if (p[nStart][i]) //[nstart i]构成了回文子串
		{
			solution.push_back(str.substr(nStart,i+1-nStart));
			MinPalindrome(str,size,i+1,p,all,solution);
			solution.pop_back();
		}
	}
}

void Print_Bool(const vector<vector<bool>>p,int size)
{
	for (int i=0;i<size;i++)
	{
		for (int j=0;j<size;j++)
		{
			if(p[i][j])
				cout<<"1"<<" ";
			else
				cout<<"0"<<" ";
		}
		cout<<endl;
	}
}

void Print_solution(vector<string>solution)
{
	for (int i=0;i<solution.size();i++)
	{
		cout<<solution[i]<<"|";
	}
}

void Print_all(const vector<vector<string>>all)
{
	for (int i=0;i<all.size();i++)
	{
		Print_solution(all[i]);
		cout<<endl;
	}
}



int main()
{
	string str="abacdccdaa";
	int len=str.length();
	vector<vector<bool>>p;
	p.resize(len);
	for (int i=0;i<len;i++)
	{
		p[i].resize(len);
	}
	CalcSubPalindrome(str,len,p);
	Print_Bool(p,len);

	vector<vector<string>>all;//所有结果
	vector<string> solution;//
	MinPalindrome(str,len,0,p,all,solution);
	cout<<"Count:"<<all.size()<<endl;
	Print_all(all);
	//Print_Bool(p,len);
	return 0;
}

1 0 1 0 0 0 0 0 0 0
0 1 0 0 0 0 0 0 0 0
0 0 1 0 0 0 0 0 0 0
0 0 0 1 0 1 0 0 0 0
0 0 0 0 1 0 0 1 0 0
0 0 0 0 0 1 1 0 0 0
0 0 0 0 0 0 1 0 0 0
0 0 0 0 0 0 0 1 0 0
0 0 0 0 0 0 0 0 1 1
0 0 0 0 0 0 0 0 0 1
Count:16
a|b|a|c|d|c|c|d|a|a|
a|b|a|c|d|c|c|d|aa|
a|b|a|c|d|cc|d|a|a|
a|b|a|c|d|cc|d|aa|
a|b|a|c|dccd|a|a|
a|b|a|c|dccd|aa|
a|b|a|cdc|c|d|a|a|
a|b|a|cdc|c|d|aa|
aba|c|d|c|c|d|a|a|
aba|c|d|c|c|d|aa|
aba|c|d|cc|d|a|a|
aba|c|d|cc|d|aa|
aba|c|dccd|a|a|
aba|c|dccd|aa|
aba|cdc|c|d|a|a|
aba|cdc|c|d|aa|