From 3be6a9dd2bb44a54721460f503a6606644902d98 Mon Sep 17 00:00:00 2001
From: "qingyi.liu" <qingyival@163.com>
Date: Sat, 22 May 2021 13:38:18 +0800
Subject: [PATCH] =?UTF-8?q?=E6=B7=BB=E5=8A=A0=E7=AC=AC15=E9=A2=98.=20?=
 =?UTF-8?q?=E4=B8=89=E6=95=B0=E4=B9=8B=E5=92=8CJavaScript=E7=89=88?=
 =?UTF-8?q?=E6=9C=AC?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 problems/0015.三数之和.md | 53 +++++++++++++++++++++++++++++++++++
 1 file changed, 53 insertions(+)

diff --git a/problems/0015.三数之和.md b/problems/0015.三数之和.md
index 96dc1ac3..8ee1d07b 100644
--- a/problems/0015.三数之和.md
+++ b/problems/0015.三数之和.md
@@ -256,6 +256,59 @@ func threeSum(nums []int)[][]int{
 }
 ```
 
+javaScript: 
+
+```js
+/**
+ * @param {number[]} nums
+ * @return {number[][]}
+ */
+
+// 循环内不考虑去重 
+var threeSum = function(nums) {
+    const len = nums.length;
+    if(len < 3) return [];
+    nums.sort((a, b) => a - b);
+    const resSet = new Set();
+    for(let i = 0; i < len - 2; i++) {
+        if(nums[i] > 0) break;
+        let l = i + 1, r = len - 1;
+        while(l < r) {
+            const sum = nums[i] + nums[l] + nums[r];
+            if(sum < 0) { l++; continue };
+            if(sum > 0) { r--; continue };
+            resSet.add(`${nums[i]},${nums[l]},${nums[r]}`);
+            l++;
+            r--;
+        }
+    }
+    return Array.from(resSet).map(i => i.split(","));
+};
+
+// 去重优化
+var threeSum = function(nums) {
+    const len = nums.length;
+    if(len < 3) return [];
+    nums.sort((a, b) => a - b);
+    const res = [];
+    for(let i = 0; i < len - 2; i++) {
+        if(nums[i] > 0) break;
+        // a去重
+        if(i > 0 && nums[i] === nums[i - 1]) continue;
+        let l = i + 1, r = len - 1;
+        while(l < r) {
+            const sum = nums[i] + nums[l] + nums[r];
+            if(sum < 0) { l++; continue };
+            if(sum > 0) { r--; continue };
+            res.push([nums[i], nums[l], nums[r]])
+            // b c 去重 
+            while(l < r && nums[l] === nums[++l]);
+            while(l < r && nums[r] === nums[--r]);
+        }
+    }
+    return res;
+};
+```