3144-minimum-substring-partition-of-equal-character-frequency.adoc

3144. Minimum Substring Partition of Equal Character Frequency

{leetcode}/problems/minimum-substring-partition-of-equal-character-frequency/[LeetCode - 3144. Minimum Substring Partition of Equal Character Frequency ^]

Given a string s, you need to partition it into one or more balanced <span data-keyword="substring">substrings. For example, if s == "ababcc" then ("abab", "c", "c"), ("ab", "abc", "c"), and ("ababcc") are all valid partitions, but ("a", "bab", "cc"), ("aba", "bc", "c"), and ("ab", "abcc") are not. The unbalanced substrings are bolded.

Return the minimum number of substrings that you can partition s into.

Note: A balanced string is a string where each character in the string occurs the same number of times.

Example 1:

<div class="example-block"> Input: <span class="example-io">s = "fabccddg"

Output: <span class="example-io">3

Explanation:

We can partition the string s into 3 substrings in one of the following ways: ("fab, "ccdd", "g"), or ("fabc", "cd", "dg").

Example 2:

<div class="example-block"> Input: <span class="example-io">s = "abababaccddb"

Output: <span class="example-io">2

Explanation:

We can partition the string s into 2 substrings like so: ("abab", "abaccddb").

Constraints:

• 1 ⇐ s.length ⇐ 1000

• s consists only of English lowercase letters.

思路分析

一刷

link:{sourcedir}/_3144_MinimumSubstringPartitionOfEqualCharacterFrequency.java[role=include]

参考资料