feat: add solutions to leetcode problem: No.1748. Sum of Unique Elements

Author: yanglbme

solution/1700-1799/1748.Sum of Unique Elements/README.md

@@ -42,27 +42,49 @@
 	<li><code>1 &lt;= nums[i] &lt;= 100</code></li>
 </ul>
 
-
 ## 解法
 
 <!-- 这里可写通用的实现逻辑 -->
 
+定义一个计数器 counter，存放数组每个元素出现的次数。
+
+然后遍历 counter 中每个元素，累加次数为 1 的所有下标即可。
+
 <!-- tabs:start -->
 
 ### **Python3**
 
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```python
-
+class Solution:
+    def sumOfUnique(self, nums: List[int]) -> int:
+        counter = [0] * 101
+        for num in nums:
+            counter[num] += 1
+        return sum([i for i in range(1, 101) if counter[i] == 1])
 ```
 
 ### **Java**
 
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```java
-
+class Solution {
+    public int sumOfUnique(int[] nums) {
+        int[] counter = new int[101];
+        for (int num : nums) {
+            ++counter[num];
+        }
+        int res = 0;
+        for (int i = 1; i < 101; ++i) {
+            if (counter[i] == 1) {
+                res += i;
+            }
+        }
+        return res;
+    }
+}
 ```
 
 ### **...**

solution/1700-1799/1748.Sum of Unique Elements/README_EN.md

@@ -41,21 +41,39 @@
 	<li><code>1 &lt;= nums[i] &lt;= 100</code></li>
 </ul>
 
-
 ## Solutions
 
 <!-- tabs:start -->
 
 ### **Python3**
 
 ```python
-
+class Solution:
+    def sumOfUnique(self, nums: List[int]) -> int:
+        counter = [0] * 101
+        for num in nums:
+            counter[num] += 1
+        return sum([i for i in range(1, 101) if counter[i] == 1])
 ```
 
 ### **Java**
 
 ```java
-
+class Solution {
+    public int sumOfUnique(int[] nums) {
+        int[] counter = new int[101];
+        for (int num : nums) {
+            ++counter[num];
+        }
+        int res = 0;
+        for (int i = 1; i < 101; ++i) {
+            if (counter[i] == 1) {
+                res += i;
+            }
+        }
+        return res;
+    }
+}
 ```
 
 ### **...**

solution/1700-1799/1748.Sum of Unique Elements/Solution.java

@@ -0,0 +1,15 @@
+class Solution {
+    public int sumOfUnique(int[] nums) {
+        int[] counter = new int[101];
+        for (int num : nums) {
+            ++counter[num];
+        }
+        int res = 0;
+        for (int i = 1; i < 101; ++i) {
+            if (counter[i] == 1) {
+                res += i;
+            }
+        }
+        return res;
+    }
+}

solution/1700-1799/1748.Sum of Unique Elements/Solution.py

@@ -0,0 +1,6 @@
+class Solution:
+    def sumOfUnique(self, nums: List[int]) -> int:
+        counter = [0] * 101
+        for num in nums:
+            counter[num] += 1
+        return sum([i for i in range(1, 101) if counter[i] == 1])