LeetCode 16. 3Sum Closest

风雪夜不眠人

于 2019-07-06 17:25:28 发布

阅读量197

点赞数

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

本文链接：https://blog.csdn.net/qq_33519317/article/details/94874704

版权

LeetCode 专栏收录该内容

31 篇文章 0 订阅

订阅专栏

int threeSumClosest(vector<int>& nums, int target) 
{
	int result = target; int sum = 0;
	int	diff = abs(nums[0] + nums[1] + nums[2] - target);
	for (int i = 0; i < nums.size(); i++)
	{
		for (int j = i + 1; j < nums.size(); j++)
		{
			for (int k = j + 1; k < nums.size(); k++)
			{
				sum = nums[i] + nums[j] + nums[k];
				if (diff == 0)
					return target;
				if (diff >= abs(sum - target))
				{
					diff = abs(sum - target);
					result = sum;
				}

			}
		}
	}
	return result;
}