mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-11-04 19:53:12 +08:00
36 lines
1.1 KiB
HTML
36 lines
1.1 KiB
HTML
<p>Given an integer array <code>nums</code>, in which exactly two elements appear only once and all the other elements appear exactly twice. Find the two elements that appear only once. You can return the answer in <strong>any order</strong>.</p>
|
|
|
|
<p>You must write an algorithm that runs in linear runtime complexity and uses only constant extra space.</p>
|
|
|
|
<p> </p>
|
|
<p><strong>Example 1:</strong></p>
|
|
|
|
<pre>
|
|
<strong>Input:</strong> nums = [1,2,1,3,2,5]
|
|
<strong>Output:</strong> [3,5]
|
|
<strong>Explanation: </strong> [5, 3] is also a valid answer.
|
|
</pre>
|
|
|
|
<p><strong>Example 2:</strong></p>
|
|
|
|
<pre>
|
|
<strong>Input:</strong> nums = [-1,0]
|
|
<strong>Output:</strong> [-1,0]
|
|
</pre>
|
|
|
|
<p><strong>Example 3:</strong></p>
|
|
|
|
<pre>
|
|
<strong>Input:</strong> nums = [0,1]
|
|
<strong>Output:</strong> [1,0]
|
|
</pre>
|
|
|
|
<p> </p>
|
|
<p><strong>Constraints:</strong></p>
|
|
|
|
<ul>
|
|
<li><code>2 <= nums.length <= 3 * 10<sup>4</sup></code></li>
|
|
<li><code>-2<sup>31</sup> <= nums[i] <= 2<sup>31</sup> - 1</code></li>
|
|
<li>Each integer in <code>nums</code> will appear twice, only two integers will appear once.</li>
|
|
</ul>
|