mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-01-11 02:58:13 +08:00
26 lines
602 B
HTML
26 lines
602 B
HTML
|
<p>在一个数组 <code>nums</code> 中除一个数字只出现一次之外,其他数字都出现了三次。请找出那个只出现一次的数字。</p>
|
|||
|
|
|||
|
<p> </p>
|
|||
|
|
|||
|
<p><strong>示例 1:</strong></p>
|
|||
|
|
|||
|
<pre><strong>输入:</strong>nums = [3,4,3,3]
|
|||
|
<strong>输出:</strong>4
|
|||
|
</pre>
|
|||
|
|
|||
|
<p><strong>示例 2:</strong></p>
|
|||
|
|
|||
|
<pre><strong>输入:</strong>nums = [9,1,7,9,7,9,7]
|
|||
|
<strong>输出:</strong>1</pre>
|
|||
|
|
|||
|
<p> </p>
|
|||
|
|
|||
|
<p><strong>限制:</strong></p>
|
|||
|
|
|||
|
<ul>
|
|||
|
<li><code>1 <= nums.length <= 10000</code></li>
|
|||
|
<li><code>1 <= nums[i] < 2^31</code></li>
|
|||
|
</ul>
|
|||
|
|
|||
|
<p> </p>
|