2013年8月1日
[LeetCode]切割字符串，使各个子串都是回文
摘要： 题目：Given a strings, partitionssuch that every substring of the partition is a palindrome.Return the minimum cuts needed for a palindrome partitioning ofs.For example, givens="aab",Return1since the palindrome partitioning["aa","b"]could be produced using 1 cut.思路：用数组dp[i 阅读全文
posted @ 2013-08-01 16:05 hust_枫 阅读(745) 评论(0) 推荐(0)