15. 3Sum

Given an array S of n integers, are there elements abc in S 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.

For example, given array S = [-1, 0, 1, 2, -1, -4],

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

老办法,首先排序,然后使用two pointers的方法,注意可以用set集合来去重。
LeetCode汇总
posted @ 2017-06-07 22:13  NaiveCoder  阅读(96)  评论(0)    收藏  举报