Function threeSum0

three_sum_15/solution.go:50–88

(nums []int)

}

func threeSum0(nums []int) [][]int {
	triplets := make([][]int, 0)
	if len(nums) < 3 {
		return triplets
	}

	sort.Ints(nums)
	for i := 0; i < len(nums)-2; i++ {
		j := i + 1
		k := len(nums) - 1
		if i != 0 && nums[i] == nums[i-1] {
			continue
		}

		for j < k {
			tripletSum := nums[i] + nums[j] + nums[k]
			if tripletSum == 0 {
				triplets = append(triplets, []int{nums[i], nums[j], nums[k]})
				j++

				// We found the sum we wanted, and moved j forward one index.
				// If the value at j is equal to the value at j-1, a duplicate
				// will be produced. Continue to move j forward until a new value
				// is seen or j >= k.
				for j < k && nums[j] == nums[j-1] {
					j++
				}
			} else if tripletSum < 0 {
				// If tripletSum is less than 0, we must increase the sum
				j++
			} else {
				// If tripletSum is less than 0, we must decrease the sum
				k--
			}
		}
	}

	return triplets
}