Package g0101_0200.s0131_palindrome_partitioning

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    131 - Palindrome Partitioning\.

    Medium

    Given a string s, partition s such that every substring of the partition is a palindrome. Return all possible palindrome partitioning of s.

    A palindrome string is a string that reads the same backward as forward.

    Example 1:

    Input: s = "aab"

    Output: ["a","a","b","aa","b"]

    Example 2:

    Input: s = "a"

    Output: ["a"]

    Constraints:

    • 1 <= s.length <= 16

    • s contains only lowercase English letters.

    • 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 List<List<String>> partition(String s)

      • Methods inherited from class java.lang.Object

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