Split string to palindrome

最新推荐文章于 2023-03-21 11:04:31 发布

beiyeqingteng

最新推荐文章于 2023-03-21 11:04:31 发布

阅读量2.1k

点赞数

CC 4.0 BY-SA版权

分类专栏：算法 (Algorithm)

本文链接：https://blog.youkuaiyun.com/beiyeqingteng/article/details/8606736

算法 (Algorithm) 专栏收录该内容

113 篇文章

订阅专栏

本文介绍了一种算法，用于将给定的字符串分割成最少数量的回文子串。通过遍历字符串并检查子串是否为回文，算法能够有效计算所需的最小分割次数。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Question:

Give a string, use minimum number of splits to divide the string into multiple parts in which each part a palindrome. For example, if the string is "abbad", we can split it into "abba" and "d", then the total splits is 1.

public class NumberOfSplits {
	
	public static void main(String[] args) {
		String str = "abbadd";
		System.out.println(new NumberOfSplits().numberOfSplits(str));
	}

	public int numberOfSplits(String str) {
		assert (str != null);
		int[] cuts = new int[str.length()];
		for (int i = 0; i < str.length(); i++) {
			cuts[i] = i;
		}
		
		for (int i = 0; i < str.length(); i++) {
			if (isPalindrome(str, 0, i)) {
				cuts[i] = 0;
				continue;
			}
			for (int j = 1; j <= i; j++) {
				if (isPalindrome(str, j, i) && cuts[i] > cuts[j - 1] + 1) {
					cuts[i] = cuts[j - 1] + 1;
				}
			}
		}
		return cuts[str.length() - 1];
	}
	
	public boolean isPalindrome(String str, int i, int j) {
		while (i <= j) {
			if (str.charAt(i) != str.charAt(j)) {
				return false;
			}
			i++;
			j--;
		}
		return true;
	}
}