update: 220

hijiangtao · hijiangtao · commit 94990406051a · 2022-07-05T11:28:28.000+08:00
diff --git a/README.md b/README.md
@@ -134,7 +134,7 @@ This is the solutions collection of my LeetCode submissions, most of them are pr
 | 215 | [Kth Largest Element in an Array](https://leetcode.com/problems/kth-largest-element-in-an-array/)                                               | [JavaScript](./src/kth-largest-element-in-an-array/res.js)                                                              | Medium     |
 | 217 | [Contains Duplicate](https://leetcode.com/problems/contains-duplicate/)                                                                         | [JavaScript](./src/contains-duplicate/res.js) · [TypeScript](./src/contains-duplicate/res.ts)                           | Easy       |
 | 219 | [Contains Duplicate II](https://leetcode.com/problems/contains-duplicate-ii/)                                                                   | [JavaScript](./src/contains-duplicate-ii/res.js)                                                                        | Easy       |
-| 220 | [Contains Duplicate III](https://leetcode.com/problems/contains-duplicate-iii/)                                                                 | [JavaScript](./src/contains-duplicate-iii/res.js)                                                                       | Medium     |
+| 220 | [Contains Duplicate III](https://leetcode.com/problems/contains-duplicate-iii/)                                                                 | [JavaScript](./src/contains-duplicate-iii/res.js) · [TypeScript](./src/contains-duplicate-iii/res.ts)                   | Medium     |
 | 228 | [Summary Ranges](https://leetcode.com/problems/summary-ranges/solution/)                                                                        | [JavaScript](./src/summary-ranges/res.js)                                                                               | Medium     |
 | 230 | [kth-smallest-element-in-a-bst](https://leetcode.com/problems/kth-smallest-element-in-a-bst/solution/)                                          | [TypeScript](./src/kth-smallest-element-in-a-bst/res.ts)                                                                | Medium     |
 | 238 | [Product of Array Except Self](https://leetcode.com/problems/product-of-array-except-self/solution/)                                            | [JavaScript](./src/product-of-array-except-self/res.js)                                                                 | Medium     |
diff --git a/src/contains-duplicate-iii/res.ts b/src/contains-duplicate-iii/res.ts
@@ -0,0 +1,23 @@
+function containsNearbyAlmostDuplicate(nums: number[], k: number, t: number): boolean {
+    if (nums.length < 2) {
+        return false;
+    }
+
+    const numsList = nums.map((num, index) => ({
+        val: num,
+        index,
+    }));
+    numsList.sort((a, b) => a.val - b.val);
+
+    for (let i = 0; i < numsList.length-1; i++) {
+        for (let j = i+1; j < numsList.length; j++) {
+            if (Math.abs(numsList[j].val - numsList[i].val) > t) {
+                break;
+            } else if (Math.abs(numsList[j].val - numsList[i].val) <= t && Math.abs(numsList[j].index - numsList[i].index) <= k) {
+                return true;
+            }
+        }
+    }
+
+    return false;
+};
