Java for LeetCode 015 3Sum

标签：

Given an array S of n integers, are there elements a, b, c in S such that a + b + c = 0? Find all unique triplets in the array which gives the sum of zero.

Note:

• Elements in a triplet (a,b,c) must be in non-descending order. (ie, a ≤ b ≤ c)
• The solution set must not contain duplicate triplets.

    For example, given array S = {-1 0 1 2 -1 -4},

    A solution set is:
    (-1, 0, 1)
    (-1, -1, 2)

解题思路：

3Sum对初学者估计是丈二和尚摸不着头脑，其实NSum都有固定的解法。参考链接：

http://tech-wonderland.net/blog/summary-of-ksum-problems.html

Java for LeetCode 015 3Sum

标签：

原文地址：http://www.cnblogs.com/tonyluis/p/4465366.html