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

Solution:

 public class Solution {
     public List<List<String>> partition(String s) {
         List<List<String>> result=new ArrayList<List<String>>();
         List<String> temp=new ArrayList<String>();
         dfs(result,temp,s);
         return result;
     }

     private void dfs(List<List<String>> result, List<String> temp, String s) {
         // TODO Auto-generated method stub
         if(s.length()==0){
             result.add(new ArrayList<String>(temp));
             return;
         }
         for(int i=1;i<=s.length();++i){
             String str=s.substring(0, i);
             if(isPalindrome(str)){
                 temp.add(str);
                 dfs(result, temp, s.substring(i));
                 temp.remove(temp.size()-1);
             }
         }
     }

     private boolean isPalindrome(String str) {
         // TODO Auto-generated method stub
         int end=str.length()-1;
         int start=0;
         while(start<end){
             if(str.charAt(start)!=str.charAt(end))
                 return false;
             start++;
             end--;
         }
         return true;
     }
 }