minimum-number-of-steps-to-make-two-strings-anagram-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

You are given two strings <code>s</code> and <code>t</code>. In one step, you can append any character to either <code>s</code> or <code>t</code>.

Return the minimum number of steps to make <code>s</code> and <code>t</code> anagrams of each other.

An anagram of a string is a string that contains the same characters with a different (or the same) ordering.

&nbsp;
Example 1:

<pre>
Input: s = &quot;leetcode&quot;, t = &quot;coats&quot;
Output: 7
Explanation: 
- In 2 steps, we can append the letters in &quot;as&quot; onto s = &quot;leetcode&quot;, forming s = &quot;leetcodeas&quot;.
- In 5 steps, we can append the letters in &quot;leede&quot; onto t = &quot;coats&quot;, forming t = &quot;coatsleede&quot;.
&quot;leetcodeas&quot; and &quot;coatsleede&quot; are now anagrams of each other.
We used a total of 2 + 5 = 7 steps.
It can be shown that there is no way to make them anagrams of each other with less than 7 steps.
</pre>

Example 2:

<pre>
Input: s = &quot;night&quot;, t = &quot;thing&quot;
Output: 0
Explanation: The given strings are already anagrams of each other. Thus, we do not need any further steps.
</pre>

&nbsp;
Constraints:

<ul>
	<li><code>1 &lt;= s.length, t.length &lt;= 2 * 105</code></li>
	<li><code>s</code> and <code>t</code> consist of lowercase English letters.</li>
</ul>

minSteps

Minimum Number of Steps to Make Two Strings Anagram II

Minimum Number of Steps to Make Two Strings Anagram

minimum-number-of-steps-to-make-two-strings-anagram

制造字母异位词的最小步骤数

Hash Table

String

Counting

给你两个字符串 <code>s</code> 和 <code>t</code> 。在一步操作中，你可以给 <code>s</code> 或者 <code>t</code> 追加 任一字符 。

返回使 <code>s</code> 和 <code>t</code> 互为 字母异位词 所需的最少步骤数。

字母异位词 指字母相同但是顺序不同（或者相同）的字符串。

&nbsp;

示例 1：

<pre>输入：s = "leetcode", t = "coats"
输出：7
解释：
- 执行 2 步操作，将 "as" 追加到 s = "leetcode" 中，得到 s = "leetcodeas" 。
- 执行 5 步操作，将 "leede" 追加到 t = "coats" 中，得到 t = "coatsleede" 。
"leetcodeas" 和 "coatsleede" 互为字母异位词。
总共用去 2 + 5 = 7 步。
可以证明，无法用少于 7 步操作使这两个字符串互为字母异位词。</pre>

示例 2：

<pre>输入：s = "night", t = "thing"
输出：0
解释：给出的字符串已经互为字母异位词。因此，不需要任何进一步操作。
</pre>

&nbsp;

提示：

<ul>
	<li><code>1 &lt;= s.length, t.length &lt;= 2 * 105</code></li>
	<li><code>s</code> 和 <code>t</code> 由小写英文字符组成</li>
</ul>