mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-01-11 02:58:13 +08:00
37 lines
1.0 KiB
HTML
37 lines
1.0 KiB
HTML
|
<p>You are given an integer array <code>nums</code>. The unique elements of an array are the elements that appear <strong>exactly once</strong> in the array.</p>
|
||
|
|
|
||
|
|
<p>Return <em>the <strong>sum</strong> of all the unique elements of </em><code>nums</code>.</p>
|
||
|
|
|
||
|
|
<p> </p>
|
||
|
|
<p><strong>Example 1:</strong></p>
|
||
|
|
|
||
|
|
<pre>
|
||
|
|
<strong>Input:</strong> nums = [1,2,3,2]
|
||
|
|
<strong>Output:</strong> 4
|
||
|
|
<strong>Explanation:</strong> The unique elements are [1,3], and the sum is 4.
|
||
|
|
</pre>
|
||
|
|
|
||
|
|
<p><strong>Example 2:</strong></p>
|
||
|
|
|
||
|
|
<pre>
|
||
|
|
<strong>Input:</strong> nums = [1,1,1,1,1]
|
||
|
|
<strong>Output:</strong> 0
|
||
|
|
<strong>Explanation:</strong> There are no unique elements, and the sum is 0.
|
||
|
|
</pre>
|
||
|
|
|
||
|
|
<p><strong>Example 3:</strong></p>
|
||
|
|
|
||
|
|
<pre>
|
||
|
|
<strong>Input:</strong> nums = [1,2,3,4,5]
|
||
|
|
<strong>Output:</strong> 15
|
||
|
|
<strong>Explanation:</strong> The unique elements are [1,2,3,4,5], and the sum is 15.
|
||
|
|
</pre>
|
||
|
|
|
||
|
|
<p> </p>
|
||
|
|
<p><strong>Constraints:</strong></p>
|
||
|
|
|
||
|
|
<ul>
|
||
|
|
<li><code>1 <= nums.length <= 100</code></li>
|
||
|
|
<li><code>1 <= nums[i] <= 100</code></li>
|
||
|
|
</ul>
|