3Sum

最新推荐文章于 2018-10-17 20:00:26 发布

Thomas_YiSaYa

最新推荐文章于 2018-10-17 20:00:26 发布

阅读量477

点赞数

分类专栏： LeetCode 文章标签： leetcode

本文链接：https://blog.csdn.net/q286989429/article/details/47660339

版权

LeetCode 专栏收录该内容

37 篇文章 0 订阅

订阅专栏

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)

class Solution {
public:
	vector<vector<int>> threeSum(vector<int>& nums) 
	{
		vector<vector<int>> result;
		vector<int> okarray;
		if (nums.size()<3)
		{
			return result;
		}
		sort(nums.begin(),nums.end());
		int lengthNums=nums.size();
		int PostiveTag=0;
		for (int i=0;i<lengthNums;i++)
		{
			if (nums[i]>=0)
			{
				PostiveTag=i;//>=0
				break;	
			}
		}
		if (PostiveTag==0)//all >=0
		{
			if (nums[0]==0&&nums[0]==nums[1]&&nums[1]==nums[2])
			{
				okarray.push_back(nums[0]);
				okarray.push_back(nums[0]);
				okarray.push_back(nums[0]);
				//guardge?
				result.push_back(okarray);
				return result;
			}
			else
				 	return result;

		}
		int start=0;
		if (PostiveTag+2<=lengthNums-1)
		{
			if (nums[PostiveTag]==0&&nums[PostiveTag]==nums[PostiveTag+1]&&nums[PostiveTag]==nums[PostiveTag+2])
			{
				okarray.push_back(nums[PostiveTag]);
				okarray.push_back(nums[PostiveTag]);
				okarray.push_back(nums[PostiveTag]);
				//guardge?
				result.push_back(okarray);
				okarray.clear();
			}
		}
		for (int i=start;i<PostiveTag;i++)
		{
			if (i!=0&&nums[i]==nums[i-1])//no limit, i+1<3
			{
				continue;
			}
			for(int j=lengthNums-1;j>=PostiveTag;j--)//adjust?
			{
				if (j!=(lengthNums-1)&&nums[j]==nums[j+1])//no limit
				{
					continue;
				}
				if (nums[i]+nums[j]>0)
				{
					int Tag=findnums(nums,i,-(nums[i]+nums[j]),PostiveTag);
					if(Tag!=0)
					{
						//ok push_back.smaller 0 number.
						okarray.push_back(nums[i]);
						okarray.push_back(nums[Tag]);
						okarray.push_back(nums[j]);
						//guardge?
						result.push_back(okarray);
						okarray.clear();
						
					}
				}
				else
				{
			          //>0
				 int Tag=findnumsAfter(nums,j,-(nums[i]+nums[j]),PostiveTag);
				 if(Tag!=0)
				 {
					 //ok push_back.smaller 0 number.
					 okarray.push_back(nums[i]);
					 okarray.push_back(nums[Tag]);
					 okarray.push_back(nums[j]);
					result.push_back(okarray);
					 okarray.clear();
				 }
				}

			}
		}
		return result;
	}

    int findnums(vector<int> nums,int iFront,int SuitNumber,int PostiveTag )
	{

		//  <0
		  for (int i=iFront+1;i<PostiveTag;i++)
			{
				if (nums[i]==SuitNumber)
				{
					return i;
				}
			}
		  return 0;
	}

	int findnumsAfter(vector<int> nums,int iFront,int SuitNumber,int PostiveTag )
	{

		for (int i=iFront-1;i>=PostiveTag;i--)
		{
			if (nums[i]==SuitNumber)
			{
				return i;
			}
		}
		return 0;
	}
};

最开始先排序

把数组分成小于0 的一堆，大于等于零的一堆，

从最小的一堆最小的数nums[i],与最大一堆最大的数nums[j]里面结合，看如果大于0，则在最小的一堆找，如果小等于0在最大的一堆里面找。

技巧的有重复的，在后面的忽略前面的 nums[i]=nums[i-1]，如-1-,1,0,2,

再有如果有都等于0的数，把其单独插入