coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-12 19:01:47 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

更新国内版力扣题目描述变更

Browse Source
This commit is contained in:
小墨
2022-05-02 23:42:43 +08:00
parent 74598d1cf8
commit 7ea03594b3
198 changed files with 11378 additions and 11118 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

@@ -1,22 +1,22 @@
<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>
<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>