LeetCode-3Sum Closest

最新推荐文章于 2024-09-24 08:39:28 发布

所难

最新推荐文章于 2024-09-24 08:39:28 发布

阅读量290

点赞数

分类专栏： Cracking LeetCode Sum 文章标签： leetcode 3Sum Closest

本文链接：https://blog.csdn.net/HolyDominat/article/details/38659617

版权

Cracking LeetCode 同时被 2 个专栏收录

152 篇文章 0 订阅

订阅专栏

Sum

3 篇文章 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).

Solution:

Code:

<span style="font-size:14px;">class Solution {
public:
    int threeSumClosest(vector<int> &num, int target) {
        const int length = num.size();
        int result = num[0]+num[1]+num[2];
        sort(num.begin(), num.end());
        for (int i = 0; i < length-2; ++i) {
            int m = i+1, n = length-1;
            while (m < n) {
                if (num[i]+num[m]+num[n] == target) return target;
                if (abs(num[i]+num[m]+num[n]-target) < abs(result-target)) result = num[i]+num[m]+num[n];
                if (num[i]+num[m]+num[n] < target) {
                    while (m+1 < n && num[m+1] == num[m]) ++m;
                    ++m;
                } else if (num[i]+num[m]+num[n] > target) {
                    while (n-1 > m && num[n-1] == num[n]) --n;
                    --n;
                }
            }
            while (i < length-2 && num[i+1] == num[i]) ++i;
        }
        return result;
    }
};</span>