首页 > 代码库 > Leetcode-Palindrome Partitioning II
Leetcode-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.
Analysis:
DP
Solution:
1 public class Solution { 2 public int minCut(String s) { 3 if (s.length()==0) return 0; 4 5 int[] minCut = new int[s.length()+1]; 6 minCut[0] = -1; 7 boolean[][] valid = new boolean[s.length()][s.length()]; 8 for (int i=0;i<s.length();i++){ 9 valid[i][i]=true;10 } 11 12 for (int i=1;i<=s.length();i++){13 minCut[i] = minCut[i-1]+1;14 for (int j=i-2;j>=0;j--)15 if (s.charAt(j)==s.charAt(i-1) && (j==i-2 || valid[j+1][i-2])){16 valid[j][i-1]=true;17 minCut[i] = Math.min(minCut[i],minCut[j]+1);18 }19 20 }21 22 return minCut[s.length()];23 }24 25 }
Leetcode-Palindrome Partitioning II
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。