Package g0101_0200.s0132_palindrome_partitioning_ii

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    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 lowercase English letters only.

    • Nested Class Summary

      Nested Classes 
      Modifier and Type Class Description

    • Field Summary

      Fields 
      Modifier and Type Field Description

    • Constructor Summary

      Constructors 
      Constructor Description
      Solution()

    • Enum Constant Summary

      Enum Constants 
      Enum Constant Description

    • Method Summary

      Modifier and Type Method Description
      final Integer minCut(String s)

      • Methods inherited from class java.lang.Object

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