题解 | #牛牛的三元组问题#

js解法

function findTriplets(nums) {
  let triples = [];
  const n = nums.length;
  //排序
  nums.sort((a, b) => a - b);
  console.log(nums);
  //遍历数组
  for (let i = 0; i < n - 2; i++) {
    //跳过重复数字
    if (i > 0 && nums[i] === nums[i - 1]) continue;
    let left = i + 1;
    let right = n - 1;
    while (left < right) {
      const sum = nums[i] + nums[left] + nums[right];
      if (sum === 0) {
        triples.push([nums[left], nums[i], nums[right]]);
        //跳过重复数字
        while (left < right && nums[left] === nums[left + 1]) left++;
        while (left < right && nums[right] === nums[right - 1]) right--;
        left++;
        right--;
      } else if (sum < 0) {
        left++;
      } else {
        right--;
      }
    }
  }
  return triples;
}