JS基础算法04 -- 三数之和

   const nums = [1, 2, 3, 4, 5, 6, 7, 8]
        const target = 6

        function find(nums, target) {
            let result = []
            let sortArr = nums.sort((a, b) => a - b)
            let len = sortArr.length
            for (let i = 0; i < len; i++) {
                let left = i + 1
                let right = len - 1
           
                    while (left < right) {
                        let sum = sortArr[i] + sortArr[left] + sortArr[right]
                        if (sum === target) {
                            result.push(sortArr[i], sortArr[left], sortArr[right])
                            left ++
                            while(left < right){
                                if(letf[i] ===left[i + 1]){
                                    left++
                                }
                                if(right[i] ===right[i - 1]){
                                    right--
                                }
                            }

                             
                        } else if (sum < target) {
                            left++
                        } else {
                            right--
                        }
                    
                    }
            }
            return result

        }


        console.log(find(nums, target))