Leetcode 131. Palindrome Partitioning

最新推荐文章于 2023-11-29 22:59:41 发布

zhangwj0101

最新推荐文章于 2023-11-29 22:59:41 发布

阅读量411

点赞数

分类专栏： Leetcode

本文链接：https://blog.csdn.net/zhangwj0101/article/details/50966440

版权

Leetcode 专栏收录该内容

51 篇文章 0 订阅

订阅专栏

Question

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

Code

直接DFS的解法

 /*
    直接DFS
     */
 public List<List<String>> partition(String s) {

        List<List<String>> results = new ArrayList<>();

        dfs(s, 0, results, new ArrayList<String>());
        return results;
    }

    public void dfs(String s, int i, List<List<String>> results, List<String> tempResult) {
        if (i >= s.length()) {
            results.add(new ArrayList<>(tempResult));
            return;
        }
        for (int j = i; j < s.length(); j++) {
            String temp = s.substring(i, j + 1);
            if (new StringBuilder(temp).reverse().toString().equals(temp)) {
                tempResult.add(temp);
                dfs(s, j + 1, results, tempResult);
                tempResult.remove(tempResult.size() - 1);
            }
        }
    }

记忆法+DFS

 /**
     * DFS+记忆法解决问题
     *
     * @param s
     * @return
     */
    public boolean[][] buildPalindromDP(String s) {
        boolean[][] result = new boolean[s.length()][s.length()];

        for (int j = 0; j < s.length(); j++) {
            result[j][j] = true;
            for (int i = j - 1; i >= 0; i--) {
                result[i][j] = s.charAt(j) == s.charAt(i) && (j - i <= 2 || result[i + 1][j - 1]);
            }
        }
        return result;
    }

    public void get(String s, int i, List<List<String>> results, List<String> tempResult, boolean[][] tag) {

        if (i >= s.length()) {
            results.add(new ArrayList<String>(tempResult));
            return;
        }
        for (int j = i; j < s.length(); j++) {
            if (tag[i][j]) {
                String te = s.substring(i, j + 1);
                tempResult.add(te);
                get(s, j + 1, results, tempResult, tag);
                tempResult.remove(tempResult.size() - 1);
            }
        }
    }

动态规划解决

/*
    DP方法
     */
      public boolean[][] buildPalindromDP(String s) {
        boolean[][] result = new boolean[s.length()][s.length()];

        for (int j = 0; j < s.length(); j++) {
            result[j][j] = true;
            for (int i = j - 1; i >= 0; i--) {
                result[i][j] = s.charAt(j) == s.charAt(i) && (j - i <= 2 || result[i + 1][j - 1]);
            }
        }
        return result;
    }
    public List<List<String>> partitionDP(String s) {

        List<List<String>>[] results = new ArrayList[s.length()];
        boolean[][] res = buildPalindromDP(s);
        for (int i = s.length() - 1; i >= 0; i--) {
            results[i] = new ArrayList<>();
            for (int j = i; j < s.length(); j++) {
                if (res[i][j]) {
                    String temp = s.substring(i, j + 1);
                    if (j + 1 < s.length()) {
                        List<List<String>> result = results[j + 1];
                        for (List<String> ts : result) {
                            List sa = new ArrayList<String>(ts);
                            sa.add(0, temp);
                            results[i].add(sa);
                        }
                    } else {
                        results[i].add(Arrays.asList(temp));
                    }
                }
            }
        }
        return results[0];
    }