Skip to content

Latest commit

 

History

History
53 lines (23 loc) · 782 Bytes

File metadata and controls

53 lines (23 loc) · 782 Bytes

中文文档

Description

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.

Solutions

Python3

Java

...