2017-09-09 LeetCode_016 3Sum Closest

最新推荐文章于 2020-07-17 17:21:34 发布

SYSU_LiuBY

最新推荐文章于 2020-07-17 17:21:34 发布

阅读量174

点赞数

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

本文链接：https://blog.csdn.net/qq_33575106/article/details/77916618

版权

作业专栏收录该内容

49 篇文章 0 订阅

订阅专栏

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

solution:

 
          class Solution { 
         
public:
    int threeSumClosest(vector<int>& nums, int target) {
        if (nums.size() == 0) return 0;
        int d = INT_MAX, ans;
        for (int i = 0; i < nums.size()-1; i++)
            for (int j = 0; j < nums.size()-i-1; j++)
                if (nums[j] > nums[j+1]) {
                    int t = nums[j]; nums[j] = nums[j+1]; nums[j+1] = t;
                }
        for (int b = 1; b < nums.size()-1; b++) {
            int a = 0, c = nums.size()-1;
            while (a < b && b < c) {
                if (nums[a]+nums[b]+nums[c] == target) return target;
                else if (nums[a]+nums[b]+nums[c] > target) {
                    if (nums[a]+nums[b]+nums[c]-target < d) {
                        d = nums[a]+nums[b]+nums[c]-target;
                        ans = nums[a]+nums[b]+nums[c];
                    }
                    c--;
                } else {
                    if (target-nums[a]-nums[b]-nums[c] < d) {
                        d = target-nums[a]-nums[b]-nums[c];
                        ans = nums[a]+nums[b]+nums[c];
                    }
                    a++;
                }
            }
        }
        return ans;
    }
 
          
};
 
    