字符串系列---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”]
]

实现

public ArrayList<ArrayList<String>> partition(String s){
        ArrayList<ArrayList<String>> res=new ArrayList<ArrayList<String>>();
        if(s==null || s.length()==0){
            return res;
        }
        ArrayList<String> parition=new ArrayList<String>();
        partition(s,res,parition);
        return res;
    }

    private void partition(String s, ArrayList<ArrayList<String>> res,
            ArrayList<String> partition) {

        for(int i=1;i<=s.length();i++){
           String str=s.substring(0,i); 
           if(isPalindrome(str)){
               partition.add(str);
               if(i==s.length()){
                   res.add(new ArrayList<String>(partition));//分解完成，加入到res中
               }else{
                   partition(s.substring(i),res,partition);//递归计算后半部分
               }       
               partition.remove(partition.size()-1);//返回之前，移除
           }
        }       
    }

    private boolean isPalindrome(String str) {
        int i=0,j=str.length()-1;
        while(i<j){
            if(str.charAt(i)!=str.charAt(j)){
                return false;
            }
            i++;
            j--;
        }
        return true;
    }