Palindrome Partitioning

最新推荐文章于 2020-11-21 09:13:39 发布

cgdong2014

最新推荐文章于 2020-11-21 09:13:39 发布

阅读量222

点赞数

分类专栏： DFS LeetCode

本文链接：https://blog.csdn.net/cgdong2014/article/details/39474355

版权

LeetCode 同时被 2 个专栏收录

139 篇文章 0 订阅

订阅专栏

DFS

15 篇文章 0 订阅

订阅专栏

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

思路： Using DFS to detect whether this sub string is a palindrome, if it is move to next step.

易错点：添加ArrayList 时候一定要创建个新的copy 。否则里面的 string 会被删掉。

public class Solution {
    public List<List<String>> partition(String s) {
        List<List<String>>  ret = new ArrayList<List<String>>();
        List<String> sol = new ArrayList<String>();
        dfs(s, 0, sol, ret);
        return ret;
    }
    
    private void dfs(String s, int start, List<String> sol, List<List<String>>  ret){
        if(start == s.length()){
            ret.add(new ArrayList(sol));
            return;
        }
        for(int i = start + 1; i <= s.length(); i++){
            String cur = s.substring(start, i);
            if(isPal(cur)){
                sol.add(cur);
                dfs(s, i, sol, ret);
                sol.remove(sol.size() - 1);
            }
        }
    }
    
    private boolean isPal(String s){
        int len = s.length();
        for(int i = 0; i < len / 2; i++){
            if(s.charAt(i) != s.charAt(len - 1 - i))
                return false;
        }
        return true;
    }
}