LeetCode题解 第十四周

1.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: The solution set must not contain duplicate triplets.

Example：

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

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

Difficulty：Medium

code：

class Solution {
public:
    		vector<vector<int>> threeSum(vector<int>& nums) {
		vector<vector<int>> res;
		sort(nums.begin(), nums.end());
		for (int i = 0; i < nums.size();i++)
		{
			int target = -nums[i];
			int front = i + 1;
			int back = nums.size() - 1;

			while (front < back)
			{
				if (nums[front] + nums[back] < target)
				{
					front++;
				}
				else if (nums[front] + nums[back] > target)
				{
					back--;
				}
				else
				{
					vector<int> triplets(3, 0);
					triplets[0] = nums[i];
					triplets[1] = nums[front];
					triplets[2] = nums[back];
					res.push_back(triplets);

					while (front < back && nums[front] == triplets[1])
					{
						front++;
					}

					while (front < back&&nums[back] == triplets[2])
					{
						back--;
					}
				}
			}

			while (i+1 < nums.size() && nums[i] == nums[i + 1])
			{
				i++;
			}
		}
		return res;
	}
};