zoukankan      html  css  js  c++  java
  • LeetCode

    题目:

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

    思路:

    和3sum一样,排序之后,先确定第一个元素,然后对余下元素进行两边夹。

    package sum;
    
    import java.util.Arrays;
    
    public class ThreeSumClosest {
    
        public int threeSumClosest(int[] nums, int target) {
            int len = nums.length;
            Arrays.sort(nums);
            
            int delta = nums[0] + nums[1] + nums[2] - target;
            for (int i = 0; i < len - 2;) {
                int l = i + 1;
                int r = len - 1;
                while (l < r) {
                    int tmp = nums[i] + nums[l] + nums[r] - target;
                    if (Math.abs(tmp) < Math.abs(delta))
                        delta = tmp;
                    if (tmp == 0)
                        return target;
                    if (tmp < 0)
                        ++l;
                    else
                        --r;
                }
                
                do { ++i; } while (i < len && nums[i] == nums[i - 1]);
            }
            
            return target + delta;
        }
        
        public static void main(String[] args) {
            // TODO Auto-generated method stub
            int[] nums = { -1, 2, 1, -4 };
            int target = 1;
            ThreeSumClosest t = new ThreeSumClosest();
            System.out.println(t.threeSumClosest(nums, target));
        }
    
    }
  • 相关阅读:
    微博深度学习平台架构和实践
    2020暑期学习
    2020春季学期个人课程总结
    人月神话阅读笔记03
    人月深化阅读笔记02
    第十六周学习总结
    人月神话阅读笔记01
    三分算法
    [SDOI2010]魔法猪学院
    【洛谷】NOIP2018原创模拟赛DAY1解题报告
  • 原文地址:https://www.cnblogs.com/null00/p/5025899.html
Copyright © 2011-2022 走看看