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
原创
2014-07-01 21:37:14 ·
335 阅读 ·
0 评论