Leetcode NO.16 3Sum Closest

最新推荐文章于 2024-09-25 10:36:42 发布

lym1108csu

最新推荐文章于 2024-09-25 10:36:42 发布

阅读量507

点赞数

分类专栏： Leetcode 文章标签：算法 leetcode two pointer

本文链接：https://blog.csdn.net/u012290414/article/details/42869151

版权

Leetcode 专栏收录该内容

140 篇文章 0 订阅

订阅专栏

本题要求如下：

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).

本题跟上一题3sum算法基本一样，唯一的区别就是单独再定义一个Int型变量来储存最接近值，并且不断更新，如果得到跟target相等的值，则立刻return该值，

代码如下：

class Solution {
public:
    int threeSumClosest(vector<int> &num, int target) {
        int n = num.size();
        sort(num.begin(), num.end());
        int retVal = num[0] + num[1] + num[2];
        for (int i = 0; i < n; ++i) {
        	int low = i + 1;
        	int high = n - 1;
        	while (low < high) {
        		int res = num[i] + num[low] + num[high];
        		if (res == target)
        			return target;
        		else if (res > target) {
        			if (abs(retVal - target) > abs(res - target))
        				retVal = res;
        			--high;
        		}
        		else {
        			if (abs(retVal - target) > abs(res - target))
        				retVal = res;
        			++low;
        		}
        	}
        }
        return retVal;
    }
};