132. Palindrome Partitioning II.md

title	toc	date	tags	top
132. Palindrome Partitioning II	false	2017-10-10	Leetcode Dynamic Programming	132

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$.

Example:

Input: "aab"
Output: 1
Explanation: The palindrome partitioning ["aa","b"] could be produced using 1 cut.

分析