package main

import (
	"fmt"
	"sort"
)

func threeSum(nums []int) (res [][]int) {
	sort.Ints(nums)
	left, mid, right, n := 1, 0, len(nums)-1, len(nums)
	for mid < n {
		midValue := nums[mid]
		left, right = mid+1, n-1
		for left < right {
			v := nums[left] + nums[mid] + nums[right]
			if v == 0 {
				res = append(res, []int{nums[left], nums[mid], nums[right]})
				// 避免出现重复的三元组
				for right > mid && nums[right-1] == nums[right] {
					right--
				}
			}
			if v < 0 {
				left++
			} else {
				right--
			}
		}
		// 避免出现重复的三元组
		for mid < n && midValue == nums[mid] {
			mid++
		}
	}
	return res
}

func main() {
	fmt.Println(threeSum([]int{0, 0, 0, 0, 0, 0}))
}