mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-01-10 18:48:13 +08:00
24 lines
600 B
HTML
24 lines
600 B
HTML
<p>某套连招动作记作仅由小写字母组成的序列 <code>arr</code>,其中 <code>arr[i]</code> 第 <code>i</code> 个招式的名字。请返回第一个只出现一次的招式名称,如不存在请返回空格。</p>
|
||
|
||
<p> </p>
|
||
|
||
<p><strong>示例 1:</strong></p>
|
||
|
||
<pre>
|
||
<strong>输入:</strong>arr = "abbccdeff"
|
||
<strong>输出:</strong>'a'
|
||
</pre>
|
||
|
||
<p><strong>示例 2:</strong></p>
|
||
|
||
<pre>
|
||
<strong>输入:</strong>arr = "ccdd"
|
||
<strong>输出:</strong>' '
|
||
</pre>
|
||
|
||
<p> </p>
|
||
|
||
<p><strong>限制:</strong></p>
|
||
|
||
<p><code>0 <= arr.length <= 50000</code></p>
|