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 < rig...