Three Sum [LC#15]
Given an integer array nums, return all the triplets
[nums[i], nums[j], nums[k]]such thati != j, i != k, and j != k, andnums[i] + nums[j] + nums[k] == 0. Notice that the solution set must not contain duplicate triplets.
Given an integer array nums, return all the triplets
[nums[i], nums[j], nums[k]]such thati != j, i != k, and j != k, andnums[i] + nums[j] + nums[k] == 0. Notice that the solution set must not contain duplicate triplets.