LeetCode-Q15 3Sum

发表于 | 更新于 | 分类于
本文字数： 334 | 阅读时长 ≈ 1 分钟

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.

$2+1=3$

Note:

The solution set must not contain duplicate triplets.

Example:
1
2
3
4
5
6
7
Given array nums = [-1, 0, 1, 2, -1, -4],

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