https://leetcode.cn/problems/two-sum-iii-data-structure-design/

Author: masx200

README.md

@@ -45,6 +45,8 @@ Step 2. Add the dependency
 
 <summary>展开查看</summary>
 
+https://leetcode.cn/problems/two-sum-iii-data-structure-design/
+
 https://leetcode.cn/problems/minimum-adjacent-swaps-for-k-consecutive-ones
 
 https://leetcode.cn/problems/form-array-by-concatenating-subarrays-of-another-array/

two-sum-iii-data-structure-design/index.ts

@@ -0,0 +1,17 @@
+export default class TwoSum {
+    #m = new Map<number, number>();
+
+    add(n: number) {
+        this.#m.set(n, (this.#m.get(n) ?? 0) + 1);
+    }
+    find(n: number) {
+        for (const [a, cnt] of this.#m) {
+            const b = n - a;
+            if (a > b) return false;
+            if (a === b) return cnt > 1;
+
+            if (this.#m.has(b)) return true;
+        }
+        return false;
+    }
+}