g0101_0200.s0132_palindrome_partitioning_ii.Solution Maven / Gradle / Ivy
Go to download
Show more of this group Show more artifacts with this name
Show all versions of leetcode-in-java11 Show documentation
Show all versions of leetcode-in-java11 Show documentation
Java Solution for LeetCode algorithm problems, continually updating
The newest version!
package g0101_0200.s0132_palindrome_partitioning_ii;
// #Hard #String #Dynamic_Programming #2022_06_24_Time_2_ms_(99.89%)_Space_42.1_MB_(81.48%)
import java.util.Arrays;
public class Solution {
public int minCut(String s) {
int n = s.length();
char[] t = s.toCharArray();
int[] dp = new int[n + 1];
Arrays.fill(dp, Integer.MAX_VALUE);
dp[0] = -1;
int i = 0;
while (i < n) {
expandAround(t, i, i, dp);
expandAround(t, i, i + 1, dp);
i++;
}
return dp[n];
}
private void expandAround(char[] t, int i, int j, int[] dp) {
while (i >= 0 && j < t.length && t[i] == t[j]) {
dp[j + 1] = Math.min(dp[j + 1], dp[i] + 1);
i--;
j++;
}
}
}