[Leetcode] Palindrome Partitioning (Java)

最新推荐文章于 2024-09-22 04:59:47 发布

草鞋大脚

最新推荐文章于 2024-09-22 04:59:47 发布

阅读量558

点赞数

分类专栏： Leetcode 文章标签： leetcode

本文链接：https://blog.csdn.net/StarCXDJ/article/details/19190901

版权

Leetcode 专栏收录该内容

150 篇文章 0 订阅

订阅专栏

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

找所有的回文拆分组合

这种题一看就想到DFS

public class Solution {
    public ArrayList<ArrayList<String>> partition(String s) {
		ArrayList<ArrayList<String>> ret = new ArrayList<ArrayList<String>>();
		ArrayList<String> list = new ArrayList<String>();
		dfs(ret,list,s);
		return ret;
	}
	private void dfs(ArrayList<ArrayList<String>> ret, ArrayList<String> list,String s) {
		if(s.length()==0){
			ret.add(new ArrayList<String>(list));
			return;
		}
		for(int i=1;i<=s.length();i++){
			if(isPanlidrome(s.substring(0,i))){
				list.add(s.substring(0, i));
				dfs(ret, list, s.substring(i));
				list.remove(list.size()-1);
			}
		}
	}
	private boolean isPanlidrome(String string) {
		int pre=0;
		int post=string.length()-1;
		while(pre<post){
			if(string.charAt(pre)!=string.charAt(post))
				return false;
			pre++;
			post--;
		}
		return true;
	}
}