LeetCode 132 分割回文串 Palindrome Partitioning II C++動態規劃解法

1.題目：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.   class Solution { public:

>>阅读原文<<