mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-01-11 11:08:15 +08:00
20 lines
546 B
HTML
20 lines
546 B
HTML
|
<p>实现一个算法，确定一个字符串 <code>s</code> 的所有字符是否全都不同。</p>
|
|||
|
|
|
|||
|
|
<p><strong>示例 1：</strong></p>
|
|||
|
|
|
|||
|
|
<pre><strong>输入:</strong> <code>s</code> = "leetcode"
|
|||
|
|
<strong>输出:</strong> false
|
|||
|
|
</pre>
|
|||
|
|
|
|||
|
|
<p><strong>示例 2：</strong></p>
|
|||
|
|
|
|||
|
|
<pre><strong>输入:</strong> <code>s</code> = "abc"
|
|||
|
|
<strong>输出:</strong> true
|
|||
|
|
</pre>
|
|||
|
|
|
|||
|
|
<p><strong>限制：</strong></p>
|
|||
|
|
<ul>
|
|||
|
|
<li><code>0 <= len(s) <= 100 </code></li>
|
|||
|
|
<li>如果你不使用额外的数据结构，会很加分。</li>
|
|||
|
|
</ul>
|
|||
|
|
|