0015-3sum.adoc

15. 3Sum

LeetCode - 3Sum

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]
]

解题分析

为什么参考资料中，JS 的代码可以通过，但是转成 Java 之后就不能通过呢？

link:{sourcedir}/_0015_3Sum.java[role=include]

参考资料

1. 三数之和题解 - 三数之和 - 力扣（LeetCode）