leetcode Palindrome Partitioning

仔细分析题目，就知道这题与word break || 大同小异，都可以抽象为在n个数之间插入空格以达到要求。属于动态规划问题，且使用的方法基本一致。

代码

class Solution
{
public:
	vector<vector<string>> partition(string s)
	{
		int size = s.length();
		vector<bool> flag(size, false);
		bool **partitionLoc = new bool *[size];
		for(int i = 0; i < size; ++i)
		{
			partitionLoc[i] = new bool[size];
			for(int j = 0; j < size; ++j)
				partitionLoc[i][j] = false;
		}		

		for(int i = 1; i <= size; ++i)
		{
			string substr = s.substr(0,i);
			if(judgePalindrome(substr))
			{
				flag[i-1] = true;
				partitionLoc[i-1][0] = true;
			}

			if(flag[i-1])
			{

				for(int j = 1; j <= size - i; ++j)
				{
					if(judgePalindrome(s.substr(i,j)))
					{
						flag[i+j-1] = true;
						partitionLoc[i+j-1][i] = true;
					}
				}

			}		
		
		}
                //使用DFS得到结果
		vector<int> insertBlankLoc;
		vector<vector<string>> result;
		partitionHelper(s, size, size-1, flag, partitionLoc, insertBlankLoc, result);

		return result;
	
	}

	void partitionHelper(string s, int size, int currentPos, vector<bool> flag, bool **partitionLoc, vector<int> insertBlankLoc, vector<vector<string> > &result)
	{
		if(currentPos==-1)
		{
			result.push_back(insertBlank(s, insertBlankLoc));
			return ;
		
		}

		for(int i = 0; i < size; ++i)
		{
			if(partitionLoc[currentPos][i])
			{
				insertBlankLoc.push_back(i);
				partitionHelper(s, size, i-1, flag, partitionLoc, insertBlankLoc, result);
				insertBlankLoc.pop_back();
			}
		}
	
	}


	vector<string> insertBlank(string s, vector<int> insertBlankLoc)
	{
		vector<string> tempResult;
		int base = 0;

		for(int i = insertBlankLoc.size()-1; i >= 0; --i)
		{
			if(insertBlankLoc[i]==0) continue;
			tempResult.push_back(s.substr(base, insertBlankLoc[i]-base));
			base = insertBlankLoc[i];
		
		}

		tempResult.push_back(s.substr(base, s.length()-base));
		return tempResult;	
	
	}


	//判断是否为回文数
	bool judgePalindrome(string s)
	{
		for(int i = 0 ;i < s.length()/2; ++i)
		{
			if(s[i]!=s[s.length()-i-1])
				return false;
		}

		return true;
	
	}



};