LeetCode Hot 100：三数之和

JavaScript 解法

function threeSum(nums) {
  nums.sort((a, b) => a - b);
  const res = [];

for (let i = 0; i < nums.length - 2; i++) {
    if (nums[i] > 0) break;
    if (i > 0 && nums[i] === nums[i - 1]) continue;

let left = i + 1;
    let right = nums.length - 1;

while (left < right) {
      const sum = nums[i] + nums[left] + nums[right];

if (sum < 0) {
        left++;
      } else if (sum > 0) {
        right--;
      } else {
        res.push([nums[i], nums[left], nums[right]]);
        left++;
        right--;

while (left < right && nums[left] === nums[left - 1]) left++;
        while (left < right && nums[right] === nums[right + 1]) right--;
      }
    }
  }

return res;
}

来源

• LeetCode 15. 三数之和