【LeetCode】Palindrome Partitioning I && II

最新推荐文章于 2019-06-01 11:25:07 发布

Snowwolf_Yang

最新推荐文章于 2019-06-01 11:25:07 发布

阅读量484

点赞数

分类专栏： LeetCode 动态规划 DFS

本文链接：https://blog.csdn.net/snowwolf_yang/article/details/26584093

版权

LeetCode 同时被 3 个专栏收录

86 篇文章 0 订阅

订阅专栏

动态规划

17 篇文章 0 订阅

订阅专栏

DFS

5 篇文章 0 订阅

订阅专栏

参考链接

http://blog.csdn.net/u011095253/article/details/9177451

http://blog.csdn.net/doc_sgl/article/details/13418125

题目描述

Palindrome Partitioning

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

Palindrome Partitioning II

Given a string s, partition s such that every substring of the partition is a palindrome.

Return the minimum cuts needed for a palindrome partitioning of s.

For example, given s = "aab",
Return 1 since the palindrome partitioning ["aa","b"] could be produced using 1 cut.

题目分析

DFS和DP两种方法

DP：i<=j if( DP[i+1][j-1] ==true&& s[i]==s[j]) DP[i][j] = true;

class Solution {
public:
    vector<vector<string> > partition(string s) {
    	vector<vector<string> > ret;
        int size = s.size();
        if(size == 0)	return ret;
		vector<vector<bool> > dp(size,vector<bool>(size,false));
		//vector<vector<bool> > dp(size,vector<bool>(false)); 这里第一遍竟写错了。 
		
		for(int i = 0;i<size;i++)
		{
			dp[i][i] = true;
			if(i<(size-1) && s[i]==s[i+1])
				dp[i][i+1] = true;
		} 
		//长度逐渐增加 
		for(int len = 3;len<=size;len++)
		{
			for(int i = 0;i+len<=size;i++)
			{
				int j = i+len-1;
				if(dp[i+1][j-1] && s[i]==s[j])
					dp[i][j] = true;
			}		
		} 
		//递归
		vector<string> tmp;
		BFS(ret,s,dp,0,tmp);
		return ret;
    }
    void BFS(vector<vector<string> > &ret,string s,vector<vector<bool> > &dp,int index,vector<string> &tmp)
    {
    	if(index == s.size())
    	{
    		ret.push_back(tmp);    		
    		return;
		}
		for(int i = index;i<s.size();i++)
		{
			if(dp[index][i])
			{
				string str = s.substr(index,i-index+1);
				//cout<<index<<","<<i<<":"<<str<<endl;
				tmp.push_back(str);
				BFS(ret,s,dp,i+1,tmp);
				tmp.pop_back();
			}
		}
	}
};