leetcode-problemset/leetcode-cn/problem (English)/判定是否互为字符重排(English) [check-permutation-lcci].html

<p>Given two strings,write a method to decide if one is a permutation of the other.</p>



<p><strong>Example 1:</strong></p>



<pre>

<strong>Input: </strong><code>s1</code> = &quot;abc&quot;, <code>s2</code> = &quot;bca&quot;

<strong>Output: </strong>true

</pre>



<p><strong>Example 2:</strong></p>



<pre>

<strong>Input: </strong><code>s1</code> = &quot;abc&quot;, <code>s2</code> = &quot;bad&quot;

<strong>Output: </strong>false

</pre>



<p><strong>Note:</strong></p>



<ol>

	<li><code>0 &lt;= len(s1) &lt;= 100 </code></li>

	<li><code>0 &lt;= len(s2) &lt;= 100</code></li>

</ol>