Keep Learning

永远年轻,永远热泪盈眶

LeetCode 16. 3Sum Closest

问题描述

  • Given an array nums of n integers and an integer target, find three integers in nums such that the sum is closest to target. Return the sum of the three integers. You may assume that each input would have exactly one solution.
  • Example:

Given array nums = [-1, 2, 1, -4], and target = 1.
The sum that is closest to the target is 2. (-1 + 2 + 1 = 2).

问题分析

  • 该题是 LeetCode 15. 3Sum 的变形。
  • 同样是先对数组进行排序,然后固定一个数,然后用双指针来确定另外两个数。 根据三个数之和与 target 的比较来决定相应的操作。具体见实现

代码实现

class Solution {
    public int threeSumClosest(int[] nums, int target) {
        if (nums == null) {
            return 0;
        }
        int length = nums.length;
        int res = 0;
        //数组长度 <= 3时
        if (length <= 3) {
            for (int i = 0; i < length; i++) {
                res += nums[i];
            }
            return res;
        }
        //排序
        Arrays.sort(nums);
        //初始化res
        res = nums[0] + nums[1] + nums[2];
        for (int i = 0; i < length - 2; i++) {
            //固定一个元素,利用双指针找另外两个元素
            int left = i + 1;
            int right = length - 1;
            while (left < right) {
                //计算当前三个数的和
                int curSum = nums[i] + nums[left] + nums[right];
                if (target == curSum) {//等于target直接返回
                    return curSum;
                }else if (curSum < target) {//小于,则左指针右移
                    ++left;
                }else {//大于,右指针左移
                    --right;
                }
                if (Math.abs(target - curSum) < Math.abs(target - res)) {//将res更新为最接近target的那个值
                    res = curSum;
                }
            }
        }
        return res;

    }
}
阅读更多
版权声明:本文为博主原创文章,未经博主允许不得转载。 https://blog.csdn.net/zjxxyz123/article/details/79953269
文章标签: LeetCode 3Sum 双指针
个人分类: LeetCode
上一篇LeetCode 18. 4Sum
下一篇LeetCode 454. 4Sum II
想对作者说点什么? 我来说一句

没有更多推荐了,返回首页

关闭
关闭