leetcode刷题笔记(Golang)--18. 4Sum

原题链接[18. 4Sum]
Given an array nums of n integers and an integer target, are there elements a, b, c, and d in nums such that a + b + c + d = target? Find all unique quadruplets in the array which gives the sum of target.

Note:

The solution set must not contain duplicate quadruplets.

Example:

Given array nums = [1, 0, -1, 0, -2, 2], and target = 0.

A solution set is:
[
[-1, 0, 0, 1],
[-2, -1, 1, 2],
[-2, 0, 0, 2]
]
解题思路：基本没有思路，按着花花酱大神的路子用Go重写了一边
sorting + binary search, 有一个问题就是需要处理数组中的重复元素

func fourSum(nums []int, target int) [][]int {
	var res [][]int
	ans := make(map[string]bool)
	lg := len(nums)
	sort.Ints(nums)
	for i := 0; i < lg; i++ {
		for j := i + 1; j < lg; j++ {
			for k := j + 1; k < lg; k++ {
				t := target - nums[i] - nums[j] - nums[k]
				l := lg - k - 1
				begin := sort.Search(l, func(posi int) bool {
					return nums[k+1:][posi] >= t
				})
				if (begin+k+1) >= lg || nums[k+1:][begin] != t {
					continue
				}
				key := strconv.Itoa(nums[i]) + strconv.Itoa(nums[j]) + strconv.Itoa(nums[k]) + strconv.Itoa(nums[begin+k+1])
				if _, ok := ans[key]; ok {
					continue
				} else {
					ans[key] = true
				}
				res = append(res, []int{nums[i], nums[j], nums[k], nums[begin+k+1]})
			}
		}
	}
	return res
}

不得不说，golang的标准包太少了