题目描述:
Given a string s, partition s such that every substring of the partition is a palindrome.Return all possible palindrome partitioning of s.
(给定一个字符串S,将s划分为每个子串是回文。返回所有可能的回文划分S.)
For example, given s = "aab",
Return
[
["aa","b"],
["a","a","b"]
]
思路:递归枚举各种情况,判断是否为回文数,加入结果集就可以了。
public class exercise {
public static boolean palindrome(String s)
{
for(int i=0;i<s.length();i++)
{
if(s.charAt(i)!=s.charAt(s.length()-1-i))
{
return false;
}
}
return true;
}
public static List<List<String>> partition(String s)
{
//结果集
List<List<String>> result = new ArrayList();
if(s.length()==0)
return result;
List<String> mid = new ArrayList();
Solve(s,mid,result,0);
return result;
}
public static void Solve(String s,List<String> mid,List<List<String>> result,int index)
{
if(index == s.length())
{
List<String> al = new ArrayList(mid);
result.add(al);
}
else
{
for(int i=index;i<s.length();i++)
{
if(palindrome(s.substring(index, i+1)))
{
mid.add(s.substring(index, i+1));
Solve(s,mid,result,i+1);
mid.remove(mid.size()-1);
}
}
}
}
public static void main(String[] args) {
String s="aab";
List<List<String>> result= partition(s);
for(int i=0;i<result.size();i++)
{
for(int j=0;j<result.get(i).size();j++)
{
System.out.print(result.get(i).get(j)+" ");
}
System.out.println("\n");
}
}
}
还有一种用动态规划来判断回文的的解法,但运行速率和上面相差无几,而且这种DP处理和Word Break。
public class exercise{
public static boolean[][] Palindrome(String s)
{
int len = s.length();
boolean[][] Dp = new boolean[len][len];
for(int i=0;i<s.length();i++)
{
for(int j=0;j<=i;j++)
{
if(i==0)
{
//Dp[j][i]就是j到i是否为回文数
Dp[j][i] = true;
continue;
}
//一段字符开头和结尾一样
//如果说该字符串长度大于2,那么被开头结尾字符包围的中间字符串也为回文子串才可
Dp[j][i] = s.charAt(i)==s.charAt(j)&&(i-j<=2||Dp[j+1][i-1]);
}
}
return Dp;
}
public static List<List<String>> partition(String s)
{
List<List<String>> result = new ArrayList();
List<String> mid = new ArrayList();
if(s.length()==0)
return result;
Solve(s,mid,result,Palindrome(s),0);
return result;
}
public static void Solve(String s,List<String> mid,List<List<String>> result,boolean[][] Palindrome,int index)
{
if(index == s.length())
{
List<String> al = new ArrayList(mid);
result.add(al);
}
else
{
for(int i=index;i<s.length();i++)
{
if(Palindrome[index][i])
{
mid.add(s.substring(index, i+1));
Solve(s,mid,result,Palindrome,i+1);
mid.remove(mid.size()-1);
}
}
}
}
public static void main(String[] args) {
String s="aabcbaac";
List<List<String>> result= partition(s);
for(int i=0;i<result.size();i++)
{
for(int j=0;j<result.get(i).size();j++)
{
System.out.print(result.get(i).get(j)+" ");
}
System.out.println("\n");
}
}
}