16. 3Sum Closest

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).
求三个数字的和最接近目标值target
复制代码
 1     public int threeSumClosest(int[] nums, int target) {
 2         Arrays.sort(nums);
 3         int minCount = nums[0] + nums[1] + nums[nums.length-1];
 4         for (int i = 0; i < nums.length; i++) {
 5             int low = i + 1, high = nums.length - 1;
 6             while (low < high) {
 7                 int count =  nums[i] + nums[low] + nums[high];
 8                 if(count > target)
 9                 {
10                     high--;
11                 }else
12                 {
13                     low++;
14                 }
15                 if (Math.abs(count - target) < Math.abs(minCount - target))
16                     minCount = count;
17             }
18         }
19         return minCount;     
20     }
复制代码

 

posted @   daniel456  阅读(92)  评论(0编辑  收藏  举报
编辑推荐:
· AI与.NET技术实操系列:基于图像分类模型对图像进行分类
· go语言实现终端里的倒计时
· 如何编写易于单元测试的代码
· 10年+ .NET Coder 心语,封装的思维:从隐藏、稳定开始理解其本质意义
· .NET Core 中如何实现缓存的预热?
阅读排行:
· 25岁的心里话
· 闲置电脑爆改个人服务器(超详细) #公网映射 #Vmware虚拟网络编辑器
· 基于 Docker 搭建 FRP 内网穿透开源项目(很简单哒)
· 零经验选手,Compose 一天开发一款小游戏!
· 一起来玩mcp_server_sqlite,让AI帮你做增删改查!!
点击右上角即可分享
微信分享提示