LeetCode 131 Palindrome Partitioning

问题描述：

解答：DFS

class Solution {
    public List<List<String>> partition(String s) {
        List<List<String>> result = new ArrayList<>();
        List<String> list = new ArrayList<>();
        if (s == null || s.length() == 0) {
            return result;
        }
        util(s, 0, result, list);
        return result;
    }
    private void util(String s, 
                      int start,
                      List<List<String>> result,
                      List<String> list) {
        if (start == s.length()) {
            result.add(new ArrayList<String>(list));//一定要新建
            return;
        }
        for (int i = start; i < s.length(); i++) {
            String str = s.substring(start, i + 1);//上一轮切分剩下的子串
            if (isPartition(str)) {
                list.add(str);
                util(s, i + 1, result, list);//前面满足回文，剩下子串扔进去完成下一轮比较
                list.remove(list.size() - 1);
            }
        }
    }
    private boolean isPartition(String s) {
        if (s.length() == 1) {
            return true;
        }
        for (int i = 0, j = s.length() - 1; i < j; i++, j--) {
            if (s.charAt(i) != s.charAt(j)) {
                return false;
            }
        }
        return true;
    }    
}