Package g0101_0200.s0132_palindrome_partitioning_ii

Class Solution

java.lang.Object

g0101_0200.s0132_palindrome_partitioning_ii.Solution

public class Solution
extends Object

132 - Palindrome Partitioning II\. Hard 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 1:** **Input:** s = "aab" **Output:** 1 **Explanation:** The palindrome partitioning ["aa","b"] could be produced using 1 cut. **Example 2:** **Input:** s = "a" **Output:** 0 **Example 3:** **Input:** s = "ab" **Output:** 1 **Constraints:** * `1 <= s.length <= 2000` * `s` consists of lower-case English letters only.

Constructor Summary

Constructors

Constructor	Description
Solution()

Method Summary

Modifier and Type	Method	Description
int	minCut(String s)

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Details

Solution

public Solution()

Method Details

minCut

public int minCut(String s)