LeetCode 3Sum

最新推荐文章于 2022-02-25 21:57:21 发布

maqingli87

最新推荐文章于 2022-02-25 21:57:21 发布

阅读量495

点赞数

分类专栏： leetcode 文章标签： c ie

本文链接：https://blog.csdn.net/maqingli87/article/details/7971946

版权

leetcode 专栏收录该内容

100 篇文章 0 订阅

订阅专栏

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)

Attention!

0 == num.size()

sort()

(int)num.size() - 2

how to avoid duplicates

class Solution {
public:
    vector<vector<int> > threeSum(vector<int> &num) {
        vector<vector<int> > ret;
		if(0 == num.size()) return ret;
		sort(num.begin(), num.end());
		int numi = num[0] - 1;
		for(int idx = 0; idx < (int)num.size() - 2; ++idx)
		{
			if(numi == num[idx])
				continue;
			else
			{
				numi = num[idx];
				int left = idx + 1;
				int right = num.size() - 1;
				int sum = 0;
				while(left < right)
				{
					sum = numi + num[left] + num[right];
					if(0 == sum)
					{
						ret.push_back(vector<int>());
						vector<int>& item = ret.back();
						item.push_back(numi);
						item.push_back(num[left]);
						item.push_back(num[right]);
						
						int temp = num[left];
						while(++left <= right && temp == num[left]);
						temp = num[right];
						while(--right >= left && temp == num[right]);
					}
					else if(sum > 0)
					{
						--right;
					}
					else
					{
						++left;
					}
				}
			}
		}
        
		return ret;
    }
};