16.threeSumClosest

最新推荐文章于 2021-10-30 23:52:37 发布

weixin_44398018

最新推荐文章于 2021-10-30 23:52:37 发布

阅读量89

点赞数

分类专栏： leetcode

本文链接：https://blog.csdn.net/weixin_44398018/article/details/111825005

版权

leetcode 专栏收录该内容

53 篇文章 0 订阅

订阅专栏

16.最接近的三数之和在这里插入图片描述

class Solution {
    public int threeSumClosest(int[] nums, int target) {
        int n=nums.length;
        Arrays.sort(nums);
        int best=10000000;
        for(int first=0;first<n-2;first++){
            if(first>0&&nums[first]==nums[first-1]){
                continue;
            }
            int second=first+1;
            int third=n-1;
            while(second<third){
                int sum=nums[first]+nums[second]+nums[third];
                if(sum==target){
                    return target;
                }
                if(Math.abs(sum-target)<Math.abs(best-target)){
                    best=sum;
                }
                int temp;
                if(sum>target){
                    temp=third;
                    while(second<temp&&nums[temp]==nums[third]){
                        temp--;
                    }
                    third=temp;
                }else{
                    temp=second;
                    while(temp<third&&nums[temp]==nums[second]){
                        temp++;
                    }
                    second=temp;
                }
            }
        }
        return best;
    }
}