标签：style blog color io ar for sp div art
[问题描述]
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.
[解题思路]
ans[i]表示s[i]至最后需要的划分数
注意：line6 "<="
1 int Solution::minCut(string s){ 2 const int len = s.length(); 3 bool pali[len][len]; 4 int ans[len]; 5 fill_n(&pali[0][0], len*len, false); 6 for (int i = 0; i <= len; i++) 7 ans[i] = len - i - 1; 8 for (int i = len - 1; i >= 0; i --){ 9 for (int j = i; j < len; j ++){ 10 pali[i][j] = s[i]==s[j]&&(j-i<2||pali[i+1][j-1]); 11 pali[i][j] == true?(ans[i] = min(ans[i], ans[j + 1] + 1)):(true); 12 } 13 } 14 return ans[0]; 15 }
leetcode -- Palindrome Partitioning II
标签：style blog color io ar for sp div art
原文地址：http://www.cnblogs.com/taizy/p/4008836.html
