palindrome-partitioning-ii

java

python

python3

mysql

mssql

oraclesql

csharp

javascript

typescript

bash

swift

kotlin

dart

golang

ruby

scala

rust

racket

erlang

elixir

pythondata

postgresql

cangjie

Algorithms

Given a string <code>s</code>, partition <code>s</code> such that every substring of the partition is a palindrome.

Return the minimum cuts needed for a palindrome partitioning of <code>s</code>.

&nbsp;
Example 1:

<pre>
Input: s = &quot;aab&quot;
Output: 1
Explanation: The palindrome partitioning [&quot;aa&quot;,&quot;b&quot;] could be produced using 1 cut.
</pre>

Example 2:

<pre>
Input: s = &quot;a&quot;
Output: 0
</pre>

Example 3:

<pre>
Input: s = &quot;ab&quot;
Output: 1
</pre>

&nbsp;
Constraints:

<ul>
	<li><code>1 &lt;= s.length &lt;= 2000</code></li>
	<li><code>s</code> consists of lowercase English letters only.</li>
</ul>

minCut

Palindrome Partitioning II

Palindrome Partitioning

palindrome-partitioning

分割回文串

Palindrome Partitioning IV

palindrome-partitioning-iv

分割回文串 IV

Maximum Number of Non-overlapping Palindrome Substrings

maximum-number-of-non-overlapping-palindrome-substrings

不重叠回文子字符串的最大数目

Number of Great Partitions

number-of-great-partitions

好分区的数目

String

Dynamic Programming

给你一个字符串 <code>s</code>，请你将 <code>s</code> 分割成一些子串，使每个子串都是回文串。

返回符合要求的 最少分割次数 。

<div class="original__bRMd">
<div>
&nbsp;

示例 1：

<pre>
输入：s = "aab"
输出：1
解释：只需一次分割就可将&nbsp;s 分割成 ["aa","b"] 这样两个回文子串。
</pre>

示例 2：

<pre>
输入：s = "a"
输出：0
</pre>

示例 3：

<pre>
输入：s = "ab"
输出：1
</pre>

&nbsp;

提示：

<ul>
	<li><code>1 &lt;= s.length &lt;= 2000</code></li>
	<li><code>s</code> 仅由小写英文字母组成</li>
</ul>
</div>
</div>