Problem Palindrome Partitioning

Problem Description:

Given a string s, partition s such that every substring of the partition is a palindrome.

Return all possible palindrome partitioning of s.

 

Solution:

    public List<List<String>> partition(String s) {
List<List<String>> l = new LinkedList<List<String>>();
        List<String> ll = new LinkedList<String>();

        if (s.length() == 1) {
            ll.add(s);
            l.add(ll);
            return l;
        }
        for (int i = 0; i < s.length(); i++)  {
            String str = s.substring(0, i+1);
            if (! isPalindrome(str)) {
                continue;
            } else {
                List<List<String>> others = partition(s.substring(i+1)); 
                if (others.size() > 0) {
                    for (List<String> other : others) {
                        other.add(0, s.substring(0, i+1));
                        l.add(other);                    
                    }
                } else {
                    ll.add(str);
                    l.add(ll);
                    return l;
                }
                
            }
        }

        return l;
    }
    public boolean isPalindrome(String s) {
        return s.equals(new StringBuilder(s).reverse().toString());
    }