LeetCode——3Sum Closest
来源:互联网 发布:收单数据保密协议 编辑:程序博客网 时间:2024/06/05 02:38
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).原题链接:https://oj.leetcode.com/problems/3sum-closest/
题目:给定一个数组S,找出S中的三个数,使其和与目标值最为接近。并返回其和。
public int threeSumClosest(int[] num, int target) {int min = Integer.MAX_VALUE;int result = 0;Arrays.sort(num);for (int i = 0; i < num.length; i++) {int j = i + 1;int k = num.length - 1;while (j < k) {int sum = num[i] + num[j] + num[k];int minus = Math.abs(sum - target);if (minus == 0)return sum;if (minus < min) {min = minus;result = sum;}if (sum <= target)j++;elsek--;}}return result;}
0 0
- LeetCode——3Sum Closest
- LeetCode——3Sum Closest
- leetcode 016 —— 3Sum Closest
- LeetCode题解——3Sum Closest
- LeetCode——16. 3Sum Closest
- Leetcode——16. 3Sum Closest
- LeetCode——3Sum & 3Sum Closest
- 【LeetCode】LeetCode——第16题:3Sum Closest
- LeetCode: 3 Sum Closest
- leetcode - 3 sum closest
- leetcode 3Sum Closest
- LeetCode: 3Sum Closest
- [Leetcode]3Sum Closest
- Leetcode: 3SUM Closest
- LeetCode 3Sum Closest
- [Leetcode] 3Sum Closest
- LeetCode : 3Sum Closest
- LeetCode 3Sum Closest
- UML画图
- android gridview 出现重复选择 解决
- 匿名内部类总结
- android jni Android.mk文件详解
- 读《Boost程序库完全开发指南》
- LeetCode——3Sum Closest
- GIT 开始一次旅行 四 (git 远程基本 操作)
- 系统调用的解释
- 申请苹果开发者帐号
- VC6.0使用SOAP调用公共服务
- Mongodb使用和部署ppt
- 组合模式 Jave与C++实现及比较
- Django国际化原理及具体实例
- Spring+CXF开发WebService