Class Solution
java.lang.Object
g1701_1800.s1748_sum_of_unique_elements.Solution
1748 - Sum of Unique Elements.<p>Easy</p>
<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><strong>Example 1:</strong></p>
<p><strong>Input:</strong> nums = [1,2,3,2]</p>
<p><strong>Output:</strong> 4</p>
<p><strong>Explanation:</strong> The unique elements are [1,3], and the sum is 4.</p>
<p><strong>Example 2:</strong></p>
<p><strong>Input:</strong> nums = [1,1,1,1,1]</p>
<p><strong>Output:</strong> 0</p>
<p><strong>Explanation:</strong> There are no unique elements, and the sum is 0.</p>
<p><strong>Example 3:</strong></p>
<p><strong>Input:</strong> nums = [1,2,3,4,5]</p>
<p><strong>Output:</strong> 15</p>
<p><strong>Explanation:</strong> The unique elements are [1,2,3,4,5], and the sum is 15.</p>
<p><strong>Constraints:</strong></p>
<ul>
<li><code>1 <= nums.length <= 100</code></li>
<li><code>1 <= nums[i] <= 100</code></li>
</ul>
-
Constructor Summary
Constructors -
Method Summary
-
Constructor Details
-
Solution
public Solution()
-
-
Method Details
-
sumOfUnique
public int sumOfUnique(int[] nums)
-