rearrange-k-substrings-to-form-target-string

java

python

python3

mysql

mssql

oraclesql

csharp

javascript

typescript

bash

swift

kotlin

dart

golang

ruby

scala

rust

racket

erlang

elixir

pythondata

postgresql

cangjie

Algorithms

You are given two strings <code>s</code> and <code>t</code>, both of which are anagrams of each other, and an integer <code>k</code>.

Your task is to determine whether it is possible to split the string <code>s</code> into <code>k</code> equal-sized substrings, rearrange the substrings, and concatenate them in any order to create a new string that matches the given string <code>t</code>.

Return <code>true</code> if this is possible, otherwise, return <code>false</code>.

An anagram is a word or phrase formed by rearranging the letters of a different word or phrase, using all the original letters exactly once.

A substring is a contiguous non-empty sequence of characters within a string.

&nbsp;
Example 1:

<div class="example-block">
Input: s = &quot;abcd&quot;, t = &quot;cdab&quot;, k = 2

Output: true

Explanation:

<ul>
	<li>Split <code>s</code> into 2 substrings of length 2: <code>[&quot;ab&quot;, &quot;cd&quot;]</code>.</li>
	<li>Rearranging these substrings as <code>[&quot;cd&quot;, &quot;ab&quot;]</code>, and then concatenating them results in <code>&quot;cdab&quot;</code>, which matches <code>t</code>.</li>
</ul>
</div>

Example 2:

<div class="example-block">
Input: s = &quot;aabbcc&quot;, t = &quot;bbaacc&quot;, k = 3

Output: true

Explanation:

<ul>
	<li>Split <code>s</code> into 3 substrings of length 2: <code>[&quot;aa&quot;, &quot;bb&quot;, &quot;cc&quot;]</code>.</li>
	<li>Rearranging these substrings as <code>[&quot;bb&quot;, &quot;aa&quot;, &quot;cc&quot;]</code>, and then concatenating them results in <code>&quot;bbaacc&quot;</code>, which matches <code>t</code>.</li>
</ul>
</div>

Example 3:

<div class="example-block">
Input: s = &quot;aabbcc&quot;, t = &quot;bbaacc&quot;, k = 2

Output: false

Explanation:

<ul>
	<li>Split <code>s</code> into 2 substrings of length 3: <code>[&quot;aab&quot;, &quot;bcc&quot;]</code>.</li>
	<li>These substrings cannot be rearranged to form <code>t = &quot;bbaacc&quot;</code>, so the output is <code>false</code>.</li>
</ul>
</div>

&nbsp;
Constraints:

<ul>
	<li><code>1 &lt;= s.length == t.length &lt;= 2 * 105</code></li>
	<li><code>1 &lt;= k &lt;= s.length</code></li>
	<li><code>s.length</code> is divisible by <code>k</code>.</li>
	<li><code>s</code> and <code>t</code> consist only of lowercase English letters.</li>
	<li>The input is generated such that <code>s</code> and <code>t</code> are anagrams of each other.</li>
</ul>

isPossibleToRearrange

Rearrange K Substrings to Form Target String

Hash Table

String

Sorting

给你两个字符串 <code>s</code> 和 <code>t</code>（它们互为字母异位词），以及一个整数 <code>k</code>。

你的任务是判断是否可以将字符串 <code>s</code> 分割成 <code>k</code> 个等长的子字符串，然后重新排列这些子字符串，并以任意顺序连接它们，使得最终得到的新字符串与给定的字符串 <code>t</code> 相匹配。

如果可以做到，返回 <code>true</code>；否则，返回 <code>false</code>。

字母异位词&nbsp;是指由另一个单词或短语的所有字母重新排列形成的单词或短语，使用所有原始字母恰好一次。

子字符串&nbsp;是字符串中的一个连续&nbsp;非空&nbsp;字符序列。

&nbsp;

示例 1：

<div class="example-block">
输入： s = "abcd", t = "cdab", k = 2

输出： true

解释：

<ul>
	<li>将 <code>s</code> 分割成 2 个长度为 2 的子字符串：<code>["ab", "cd"]</code>。</li>
	<li>重新排列这些子字符串为 <code>["cd", "ab"]</code>，然后连接它们得到 <code>"cdab"</code>，与 <code>t</code> 相匹配。</li>
</ul>
</div>

示例 2：

<div class="example-block">
输入： s = "aabbcc", t = "bbaacc", k = 3

输出： true

解释：

<ul>
	<li>将 <code>s</code> 分割成 3 个长度为 2 的子字符串：<code>["aa", "bb", "cc"]</code>。</li>
	<li>重新排列这些子字符串为 <code>["bb", "aa", "cc"]</code>，然后连接它们得到 <code>"bbaacc"</code>，与 <code>t</code> 相匹配。</li>
</ul>
</div>

示例 3：

<div class="example-block">
输入： s = "aabbcc", t = "bbaacc", k = 2

输出： false

解释：

<ul>
	<li>将 <code>s</code> 分割成 2 个长度为 3 的子字符串：<code>["aab", "bcc"]</code>。</li>
	<li>这些子字符串无法重新排列形成 <code>t = "bbaacc"</code>，所以输出 <code>false</code>。</li>
</ul>
</div>

&nbsp;

提示：

<ul>
	<li><code>1 &lt;= s.length == t.length &lt;= 2 * 105</code></li>
	<li><code>1 &lt;= k &lt;= s.length</code></li>
	<li><code>s.length</code> 能被 <code>k</code> 整除。</li>
	<li><code>s</code> 和 <code>t</code> 仅由小写英文字母组成。</li>
	<li>输入保证 <code>s</code> 和 <code>t</code> 互为字母异位词。</li>
</ul>