[LeetCode] Palindrome Partitioning && Palindrome Partitioning II

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

LeetCode:  https://oj.leetcode.com/problems/palindrome-partitioning/

题解：本题可以通过DFS的方式来求解，对于字符串S，我们找出其回文前缀，然后再递归判断其后缀

代码如下：

public class Solution {
    public List<List<String>> partition(String s) {
        List<List<String>> result = new ArrayList<List<String>>();
        List<String> p = new ArrayList<String>();
        dfs(result, p, s, 0);
        return result;
    }
    private void dfs(List<List<String>> result, List<String> p, String s, int i){
        if(i == s.length()){
            List<String> list = new ArrayList<String>(p);
            result.add(list);
            return;
        }
        for(int j = i+1; j <= s.length(); j++){
            String str = s.substring(i, j);
            if(isPalindrome(str)){
                p.add(str);
                dfs(result, p, s, j);
                p.remove(p.size()-1);
            }
        }
    }
    private boolean isPalindrome(String str){
        StringBuilder sb = new StringBuilder(str);
        sb.reverse();
        String rStr = sb.toString();
        return str.equals(rStr);
    }
}

Palindrome Partitioning II

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

Return the minimum cuts needed for a palindrome partitioning of s.

For example, given s = "aab",
Return 1 since the palindrome partitioning ["aa","b"] could be produced using 1 cut. 

LeetCode:  https://oj.leetcode.com/problems/palindrome-partitioning-ii/

题解：本题可以通过动态规划来求解，通过一个辅助数组cuts来记录最小的cut数，其中cuts[i]表示s[0] ~ s[i-1]的最小cut数；另外创建一个二维数组matrix， matrix[i][j] == true表示s[i] ~ s[j]为回文；代码如下：

public class Solution {
    public int minCut(String s) {
        if(s == null || s.length() == 0)
            return 0;
        int len = s.length();
        int[] cuts = new int[len+1];
        boolean[][] matrix = new boolean[len][len];
        
       for(int i = 0;i <= len; i++){
           cuts[i] = i;
       }
       for(int j = 0; j < len; j++){
           for(int i = 0; i <= j; i++){
               if((j-i < 2 || matrix[i+1][j-1]) && s.charAt(i) == s.charAt(j)){
                   matrix[i][j] = true;
                   cuts[j+1] = Math.min(cuts[j+1], cuts[i]+1);
               }
           }
       }
       return cuts[len]-1;
    }
}