Description
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.
Solution
- 动态规划
- chars数组表示输入字符串,flags[j][i]=true表示chars[i~j]为回文串,arr[i]表示chars[0~i]的minCut。
- 当chars[i] == chars[j]时,flags[j][i]=true,具体情况分析:
- 对于i==j情况,则arr[i] = arr[i-1]+1;
- 对于i==j+1(即相邻),arr[i] = arr[j-1]+1;
- 对于i > j+1,则判断chars[j+1 ~ i-1]是否回文串,即当flags[j+1][i-1] == true时,arr[i] = arr[j-1]+1
- 特别注意情况:
- 当j==0时,arr[i]的值不再arr[j-1]推导,此时arr[i] = 0;
- 以上三种情况,arr[i]应该为Math.min(arr[i], arr[x-1]+1),就是说选择最优方案
Code
public class Solution {
public int minCut(String s) {
// chars方便后面迭代时的索引定位char
char[] chars = s.toCharArray();
// arr[i]存放chars[0~i]的minCut
int[] arr = new int[s.length()];
// flags[j][i]表示chars[j~i]是否回文串
boolean[][] flags = new boolean[s.length()][s.length()];
// 初始化值
arr[0] = 0;
flags[0][0] = true;
for (int i = 1; i < arr.length; i++) {
arr[i] = Integer.MAX_VALUE;
for (int j = 0; j <= i; j++) {
if (chars[i] == chars[j]) {
// 判断是否相邻或者相等或者中间元素恰好为回文串
if (i <= j + 1 || flags[j + 1][i - 1]) {
// 设置回文串标志
flags[j][i] = true;
if(j == 0){
// 特殊情况1
arr[i] = 0;
} else if(i != j){
// 从arr[j-1]+1、arr[i-1]+1、arr[i]中取最优值
arr[i] = Math.min(arr[j-1]+1, Math.min(arr[i-1]+1, arr[i]));
}
}
}
}
// 如果从未进入回文判断区域,说明是一个独立的累赘
if (arr[i] == Integer.MAX_VALUE)
arr[i] = arr[i - 1] + 1;
}
return arr[arr.length-1];
}
}