3Sum
Given an integer array nums, return all the triplets [nums[i], nums[j], nums[k]] such that i != j, i != k, and j != k, and nums[i] + nums[j] + nums[k] == 0.
Notice that the solution set must not contain duplicate triplets.
Example 1:
Input: nums = [-1,0,1,2,-1,-4]
Output: [[-1,-1,2],[-1,0,1]]
Example 2:
Input: nums = []
Output: []
Example 3:
Input: nums = [0]
Output: []
Constraints:
0 <= nums.length <= 3000
-105 <= nums[i] <= 105
给你一个整数数组,返回所有符合i != j, i != k, j != k, 和 nums[i] + nums[j] + nums[k] == 0的数列[nums[i], nums[j], nums[k]]。
注意这答案中不能有相同的数组
例子 1:
输入: nums = [-1,0,1,2,-1,-4]
输出: [[-1,-1,2],[-1,0,1]]
例子 2:
输入: nums = []
输出: []
例子 3:
输入t: nums = [0]
输出: []
Constraints:
0 <= nums.长度 <= 3000
10e-5 <= nums[i] <= 10e5