leetcode(M) three sum

3Sum QuestionEditorial Solution My Submissions
Total Accepted: 159017
Total Submissions: 778216
Difficulty: Medium
Contributors: Admin
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: 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 sum
代码：

class Solution {
public:
//two sum
vector<int> twoSum(vector<