3Sum Closest

最新推荐文章于 2020-09-08 11:56:16 发布

CodeAsWind

最新推荐文章于 2020-09-08 11:56:16 发布

阅读量359

点赞数

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

本文链接：https://blog.youkuaiyun.com/CodeAsWind/article/details/38061281

版权

LeetCode 专栏收录该内容

36 篇文章

订阅专栏

3Sum Closest

Given an array S of n integers, find three integers in S such that the sum is closest to a given number, target. Return the sum of the three integers. You may assume that each input would have exactly one solution.

    For example, given array S = {-1 2 1 -4}, and target = 1.

    The sum that is closest to the target is 2. (-1 + 2 + 1 = 2).

Code:

class Solution {
public:
    int threeSumClosest(vector<int> &num, int target)
{
	sort(num.begin(),num.end());
	int ret=0;
	int flags=false;
	for(int i=0;i<num.size();i++)
	{
		int j=i+1;
		int k=num.size()-1;
		while(j<k)
		{
			int sum=num[i]+num[j]+num[k];
			if(!flags)
			{
				ret=sum;
				flags=true;
			}
			else
			{
				if(abs(sum-target)<abs(ret-target))
				{
					ret=sum;
				}
			}
			if(target==ret)
				return ret;
			else if(target<sum)
				k--;
			else
				j++;
		}	
	}
	return ret;
}
};