3Sum Closest Java
来源:互联网 发布:如何系统地自学python 编辑:程序博客网 时间:2024/05/18 23:26
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).
Solution: Time O(n^2)
same idea as 3 Sum
find minimum difference: abs(sum-target)
public int threeSumClosest(int[] num, int target) { Arrays.sort(num); int min=Integer.MAX_VALUE; int result=0; int len=num.length; for(int i=0;i<len-2;i++){ int start=i+1; int end=len-1; while(start<end){ int sum=num[i]+num[start]+num[end]; int diff=Math.abs(sum-target); if(diff<min){ min=diff; result=sum; System.out.println(min); //start++; //end--; }else if(target>sum){ start++; }else{ end--; } } } return result; }
0 0
- 3Sum Closest Java
- 3Sum Closest (Java)
- [LeetCode][Java] 3Sum Closest
- LeetCode : 3Sum Closest [java]
- 3Sum Closest(java实现)
- leetcode 3Sum Closest(Java)
- 3Sum Closest leetcode java
- LeetCode – 3Sum Closest (Java)
- 【leetcode-16】3Sum Closest(java)
- (Java)LeetCode-16. 3Sum Closest
- leetcode-java-16. 3Sum Closest
- 3Sum Closest Leetcode Python Java
- Leetcode 16. 3Sum Closest (Medium) (java)
- [LeetCode-Java]16. 3Sum Closest
- leetcode16 3Sum Closest(java实现)
- [LeetCode] 16. 3Sum Closest java
- 3 Sum & 3 Sum Closest
- 【Leetcode】3Sum Closest (Sum)
- C#中的线程(一)入门
- php版本的cron定时任务执行器使用实例
- HoneyDrive 到底是个什么玩意
- C++回调函数调用Java接口抽象函数
- ios播放音乐(短音乐,长音乐)
- 3Sum Closest Java
- hdu 2054
- Android手势监听类GestureDetector的使用
- Hive安装好之后创建表时报错MySQLSyntaxErrorException: Specified key was too long; max key length is 767 bytes
- struts2的execAndWait拦截器使用
- 用指针玩字符串--字符串长度
- 防撞扶手做出的巨大贡献
- 防撞扶手的安装调试
- 链表排序