04 2013 档案

leetcode]Palindrome Partitioning IIMar
摘要：Palindrome Partitioning IIMarGiven 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"] c 阅读全文
posted @ 2013-04-29 12:52 wlu 阅读(431) 评论(0) 推荐(0) 编辑

点击右上角即可分享
微信分享提示