← 返回 snapchat 的题目列表4Sum (Find all unique quadruplets)
类型：online_judge
Given an integer array nums and an integer target, return all unique quadruplets [nums[a], nums[b], nums[c], nums[d]] (with distinct indices a,b,c,d) such that their sum equals target.
Requirements:
Each quadruplet should be in non-decreasing order.
The result must not contain duplicate quadruplets.
Constraints:
0 <= len(nums) <= 200
-10^9 <= nums[i] <= 10^9
-10^9 <= target <= 10^9
I/O format (ACM style):
Input: line1 n, line2 n integers for nums, line3 integer target
Output: one quadruplet per line (4 integers separated by spaces) in lexicographic order; print nothing if no solution
Example:
Input:
6
1 0 -1 0 -2 2
0
Output:
-2 -1 1 2
-2 0 0 2
-1 0 0 1
Example
Input
6
1 0 -1 0 -2 2
0
Output
-2 -1 1 2
-2 0 0 2
-1 0 0 1