3Sum Closest

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

pkufergus

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

阅读量490

点赞数

CC 4.0 BY-SA版权

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

本文链接：https://blog.youkuaiyun.com/pkufergus/article/details/18357539

leetcode 专栏收录该内容

26 篇文章

订阅专栏

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