Palindrome Partitioning II

最新推荐文章于 2019-08-16 19:22:14 发布

转载最新推荐文章于 2019-08-16 19:22:14 发布 · 587 阅读

Dynamic Programming 专栏收录该内容

19 篇文章

订阅专栏

本文介绍如何使用Java算法解决最小回文切割问题，即给出一个字符串，找到将其分割成回文子串所需的最少切分次数。通过构建回文矩阵和动态规划，实现高效的求解过程。

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.

public class Solution {
    public int minCut(String s) {
		// Start typing your Java solution below
		// DO NOT write main() function
		int len = s.length();
		int[] res = new int[len + 1];
		// res[i] 是区间[i，n]之间的最小cut数
		// res[i] = min(1 + res[j + 1], res[i]), i <= j < len
		boolean[][] isPal = new boolean[len][len];
		// isPal[i][j] = true, if [i,j] is a palindrome
		// isPal[i][j] = (s[i] == s[j] && isPal[i+1][j-1])
		for(int i = 0; i <= len; i++)
			res[i] = len - i;
		for(int i = len - 1; i >= 0; i--){
			for(int j = i; j < len; j++){
				if(s.charAt(i) == s.charAt(j) && (j - i < 2 || isPal[i + 1][j - 1])){
					isPal[i][j] = true;
					res[i] = Math.min(res[i], res[j + 1] + 1);
				}
			}
		}
		return res[0] - 1;
	}
}