feat: update ts solution to lc problem: No.0015 (#1175)

Author: thinkasany

solution/0000-0099/0015.3Sum/README.md

@@ -228,7 +228,7 @@ function threeSum(nums: number[]): number[][] {
     const ans: number[][] = [];
     const n = nums.length;
     for (let i = 0; i < n - 2 && nums[i] <= 0; i++) {
-        if (i > 0 && nums[i] == nums[i - 1]) {
+        if (i > 0 && nums[i] === nums[i - 1]) {
             continue;
         }
         let j = i + 1;
@@ -241,10 +241,10 @@ function threeSum(nums: number[]): number[][] {
                 --k;
             } else {
                 ans.push([nums[i], nums[j++], nums[k--]]);
-                while (j < k && nums[j] == nums[j - 1]) {
+                while (j < k && nums[j] === nums[j - 1]) {
                     ++j;
                 }
-                while (j < k && nums[k] == nums[k + 1]) {
+                while (j < k && nums[k] === nums[k + 1]) {
                     --k;
                 }
             }

solution/0000-0099/0015.3Sum/README_EN.md

@@ -214,7 +214,7 @@ function threeSum(nums: number[]): number[][] {
     const ans: number[][] = [];
     const n = nums.length;
     for (let i = 0; i < n - 2 && nums[i] <= 0; i++) {
-        if (i > 0 && nums[i] == nums[i - 1]) {
+        if (i > 0 && nums[i] === nums[i - 1]) {
             continue;
         }
         let j = i + 1;
@@ -227,10 +227,10 @@ function threeSum(nums: number[]): number[][] {
                 --k;
             } else {
                 ans.push([nums[i], nums[j++], nums[k--]]);
-                while (j < k && nums[j] == nums[j - 1]) {
+                while (j < k && nums[j] === nums[j - 1]) {
                     ++j;
                 }
-                while (j < k && nums[k] == nums[k + 1]) {
+                while (j < k && nums[k] === nums[k + 1]) {
                     --k;
                 }
             }

solution/0000-0099/0015.3Sum/Solution.ts

@@ -3,7 +3,7 @@ function threeSum(nums: number[]): number[][] {
     const ans: number[][] = [];
     const n = nums.length;
     for (let i = 0; i < n - 2 && nums[i] <= 0; i++) {
-        if (i > 0 && nums[i] == nums[i - 1]) {
+        if (i > 0 && nums[i] === nums[i - 1]) {
             continue;
         }
         let j = i + 1;
@@ -16,10 +16,10 @@ function threeSum(nums: number[]): number[][] {
                 --k;
             } else {
                 ans.push([nums[i], nums[j++], nums[k--]]);
-                while (j < k && nums[j] == nums[j - 1]) {
+                while (j < k && nums[j] === nums[j - 1]) {
                     ++j;
                 }
-                while (j < k && nums[k] == nums[k + 1]) {
+                while (j < k && nums[k] === nums[k + 1]) {
                     --k;
                 }
             }