[LeetCode]16. 3Sum Closest

来源：互联网发布：今日头条大数据编辑：程序博客网时间：2024/05/18 01:54

https://leetcode.com/problems/3sum-closest/#/description

求最接近target的三个数的和

一直往target上面靠，初始ans直接选前三个的和即可，这样不用MAX_VALUE则不会越界。如果sum > target则end--，否则beg++

public class Solution {    public int threeSumClosest(int[] nums, int target) {        Arrays.sort(nums);        int ans = nums[0] + nums[1] + nums[2];        for (int i = 0; i < nums.length - 2; i++) {            int j = i + 1;            int k = nums.length - 1;            while (j < k) {                int sum = nums[i] + nums[j] + nums[k];                if (Math.abs(target - sum) < Math.abs(target - ans)) {                    ans = sum;                    if (ans == target) {                        return ans;                    }                }                if (sum > target) {                    k--;                } else {                    j++;                }            }        }        return ans;    }}

0 0