feat: add solutions to lc problem: No.1748

No.1748.Sum of Unique Elements

Author: YangFong

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

@@ -120,6 +120,74 @@ func sumOfUnique(nums []int) int {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function sumOfUnique(nums: number[]): number {
+    let res = 0;
+    const map = new Map();
+    for (const num of nums) {
+        if (map.has(num)) {
+            if (map.get(num)) {
+                map.set(num, false);
+                res -= num;
+            }
+        } else {
+            map.set(num, true);
+            res += num;
+        }
+    }
+    return res;
+}
+```
+
+### **Rust**
+
+- 计数
+
+```rust
+impl Solution {
+    pub fn sum_of_unique(nums: Vec<i32>) -> i32 {
+        let mut arr = [0; 101];
+        for num in nums {
+            arr[num as usize] += 1;
+        }
+        let mut res = 0;
+        for i in 1..101 {
+            if arr[i] == 1 {
+                res += i;
+            }
+        }
+        res as i32
+    }
+}
+```
+
+- 哈希表
+
+```rust
+use std::collections::HashMap;
+
+impl Solution {
+    pub fn sum_of_unique(nums: Vec<i32>) -> i32 {
+        let mut res = 0;
+        let mut map = HashMap::new();
+        for num in nums {
+            if map.contains_key(&num) {
+                if *map.get(&num).unwrap() {
+                    map.insert(num, false);
+                    res -= num;
+                }
+            } else {
+                map.insert(num, true);
+                res += num;
+            }
+        }
+        res
+    }
+}
+```
+
 ### **...**
 
 ```

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

@@ -109,6 +109,74 @@ func sumOfUnique(nums []int) int {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function sumOfUnique(nums: number[]): number {
+    let res = 0;
+    const map = new Map();
+    for (const num of nums) {
+        if (map.has(num)) {
+            if (map.get(num)) {
+                map.set(num, false);
+                res -= num;
+            }
+        } else {
+            map.set(num, true);
+            res += num;
+        }
+    }
+    return res;
+}
+```
+
+### **Rust**
+
+- Count
+
+```rust
+impl Solution {
+    pub fn sum_of_unique(nums: Vec<i32>) -> i32 {
+        let mut arr = [0; 101];
+        for num in nums {
+            arr[num as usize] += 1;
+        }
+        let mut res = 0;
+        for i in 1..101 {
+            if arr[i] == 1 {
+                res += i;
+            }
+        }
+        res as i32
+    }
+}
+```
+
+- HashMap
+
+```rust
+use std::collections::HashMap;
+
+impl Solution {
+    pub fn sum_of_unique(nums: Vec<i32>) -> i32 {
+        let mut res = 0;
+        let mut map = HashMap::new();
+        for num in nums {
+            if map.contains_key(&num) {
+                if *map.get(&num).unwrap() {
+                    map.insert(num, false);
+                    res -= num;
+                }
+            } else {
+                map.insert(num, true);
+                res += num;
+            }
+        }
+        res
+    }
+}
+```
+
 ### **...**
 
 ```

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

@@ -0,0 +1,20 @@
+use std::collections::HashMap;
+
+impl Solution {
+    pub fn sum_of_unique(nums: Vec<i32>) -> i32 {
+        let mut res = 0;
+        let mut map = HashMap::new();
+        for num in nums {
+            if map.contains_key(&num) {
+                if *map.get(&num).unwrap() {
+                    map.insert(num, false);
+                    res -= num;
+                }
+            } else {
+                map.insert(num, true);
+                res += num;
+            }
+        }
+        res
+    }
+}

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

@@ -0,0 +1,16 @@
+function sumOfUnique(nums: number[]): number {
+    let res = 0;
+    const map = new Map();
+    for (const num of nums) {
+        if (map.has(num)) {
+            if (map.get(num)) {
+                map.set(num, false);
+                res -= num;
+            }
+        } else {
+            map.set(num, true);
+            res += num;
+        }
+    }
+    return res;
+}