search

czzonet / leetcode-crasher

leetcode-crasher || leetcode自己解题历程 每天一题
Apache License 2.0
0 stars 0 forks source link

18. 4Sum #38

Open czzonet opened 4 years ago

czzonet commented 4 years ago

18. 4Sum

Medium

2178

346

Add to List

Share

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

Accepted

344,894

Submissions

1,021,455

czzonet commented 4 years ago

No way,I do not like such "x sum" problems.