Three Sum
MediumArrays & Strings
Given an array of integers nums, find all unique triplets [nums[i], nums[j], nums[k]] such that i != j, i != k, j != k, and nums[i] + nums[j] + nums[k] == 0. The solution must not contain duplicate triplets.
Example:
Input: nums = [-1,0,1,2,-1,-4]
Output: [[-1,-1,2],[-1,0,1]]
Explanation: nums[0] + nums[1] + nums[2] = (-1) + 0 + 1 = 0
nums[1] + nums[2] + nums[4] = 0 + 1 + (-1) = 0
nums[0] + nums[3] + nums[4] = (-1) + 2 + (-1) = 0
The distinct triplets are [-1,-1,2] and [-1,0,1].
Constraints:
- •
3 <= nums.length <= 3000 - •
-10^5 <= nums[i] <= 10^5 - •
The answer must not contain duplicate triplets
Three Sum
MediumArrays & Strings
Given an array of integers nums, find all unique triplets [nums[i], nums[j], nums[k]] such that i != j, i != k, j != k, and nums[i] + nums[j] + nums[k] == 0. The solution must not contain duplicate triplets.
Example:
Input: nums = [-1,0,1,2,-1,-4]
Output: [[-1,-1,2],[-1,0,1]]
Explanation: nums[0] + nums[1] + nums[2] = (-1) + 0 + 1 = 0
nums[1] + nums[2] + nums[4] = 0 + 1 + (-1) = 0
nums[0] + nums[3] + nums[4] = (-1) + 2 + (-1) = 0
The distinct triplets are [-1,-1,2] and [-1,0,1].
Constraints:
- •
3 <= nums.length <= 3000 - •
-10^5 <= nums[i] <= 10^5 - •
The answer must not contain duplicate triplets
Press Run or Ctrl+Enter to execute