mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-01-11 02:58:13 +08:00
24 lines
943 B
HTML
24 lines
943 B
HTML
|
<p>Given a <strong>non-empty</strong> array of integers <code>nums</code>, every element appears <em>twice</em> except for one. Find that single one.</p>
|
||
|
|
|
||
|
|
<p>You must implement a solution with a linear runtime complexity and use only constant extra space.</p>
|
||
|
|
|
||
|
|
<p> </p>
|
||
|
|
<p><strong>Example 1:</strong></p>
|
||
|
|
<pre><strong>Input:</strong> nums = [2,2,1]
|
||
|
|
<strong>Output:</strong> 1
|
||
|
|
</pre><p><strong>Example 2:</strong></p>
|
||
|
|
<pre><strong>Input:</strong> nums = [4,1,2,1,2]
|
||
|
|
<strong>Output:</strong> 4
|
||
|
|
</pre><p><strong>Example 3:</strong></p>
|
||
|
|
<pre><strong>Input:</strong> nums = [1]
|
||
|
|
<strong>Output:</strong> 1
|
||
|
|
</pre>
|
||
|
|
<p> </p>
|
||
|
|
<p><strong>Constraints:</strong></p>
|
||
|
|
|
||
|
|
<ul>
|
||
|
|
<li><code>1 <= nums.length <= 3 * 10<sup>4</sup></code></li>
|
||
|
|
<li><code>-3 * 10<sup>4</sup> <= nums[i] <= 3 * 10<sup>4</sup></code></li>
|
||
|
|
<li>Each element in the array appears twice except for one element which appears only once.</li>
|
||
|
|
</ul>
|