czzonet / leetcode-crasher

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

15. 3Sum #32

Open czzonet opened 4 years ago

czzonet commented 4 years ago

15. 3Sum

Medium

7589

860

Add to List

Share

Given an array nums of n integers, are there elements a, b, c in nums such that a + b + c = 0? Find all unique triplets in the array which gives the sum of zero.

Note:

The solution set must not contain duplicate triplets.

Example:

Given array nums = [-1, 0, 1, 2, -1, -4],

A solution set is:
[
  [-1, 0, 1],
  [-1, -1, 2]
]

Accepted

991,625

Submissions

3,687,925

czzonet commented 4 years ago

Failed: Time Limit Exceeded