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]
]

和三数之和的思想类似nums[i]+nums[j]+nums[k]=target;在nums中寻找-target就可以。

注意点和三数之和类似，就是要注意数组中相等的数。

标签：set,target,nums,三数,sum,solution,array,18.4
来源： https://www.cnblogs.com/clarencezzh/p/10959578.html