leetcode------Palindrome Partitioning

标题:	Palindrome Partitioning
通过率：	26.3%
难度：	中等

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

本题还是一个递归的过程，只是再递归的时候要判断是否为回文函数，然后就是字符串的截取，具体看代码

public class Solution {
    public ArrayList<ArrayList<String>> partition(String s) {
        ArrayList<ArrayList<String>> res=new ArrayList<ArrayList<String>>();
        ArrayList<String> tmp=new ArrayList<String>();
        getpa(res,tmp,s);
        return res;
    }
    public void getpa(ArrayList<ArrayList<String>> res,ArrayList<String> tmp,String s){
        if(s.length()==0||s==null){
            res.add(new ArrayList<String>(tmp));
        }
        else{
            for(int i=1;i<=s.length();i++){
                if(ispa(s.substring(0,i))){
                    tmp.add(s.substring(0,i));
                    getpa(res,tmp,s.substring(i));
                    tmp.remove(tmp.size()-1);
                }
            }
        }
    }
    public boolean ispa(String s){
        for(int i=0,j=s.length()-1;i<j;i++,j--){
            if(s.charAt(i)!=s.charAt(j))
                return false;
        }
        return true;
    }
}