leetcode #16 in cpp

最新推荐文章于 2024-09-18 11:04:20 发布

xiaolienahu

最新推荐文章于 2024-09-18 11:04:20 发布

阅读量157

点赞数

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

本文链接：https://blog.csdn.net/xiaolienahu/article/details/51468811

版权

interview 专栏收录该内容

135 篇文章 0 订阅

订阅专栏

This question is almost the same as #15. Just keep track of the current minimum distance during iterations.

class Solution {
public:
    int threeSumClosest(vector<int>& nums, int target) {
        sort(nums.begin(), nums.end());
        int min_dist = INT_MAX;//record the mini dist between sum and target
        int res = 0;
        int cur_sum;//temp current sum
        int cur_dist;//temp current mini dist;
        for(int i = 0; i < nums.size() - 2; i ++){
            if(i-1>=0 && nums[i] == nums[i-1]) continue;
            int left = i + 1;
            int right = nums.size() - 1;
            while(left < right){
                cur_sum = nums[i] + nums[left] + nums[right];
                cur_dist = abs(target - cur_sum);
                if(cur_dist < min_dist){
                    min_dist = cur_dist;
                    res = cur_sum;
                    
                }
                if(cur_sum < target){
                    left++;
                }else if(cur_sum > target){
                    right --;
                }else{
                    return target;
                }
            }
        }
        return res;
    }
};