16. 3Sum Closest
2017-06-14 10:29
218 查看
原题
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).
代码实现
public int ThreeSumClosest(int[] nums, int target) { //assert nums.Length>3 //assert have exactly one solution Array.Sort(nums); int closet = nums[0] + nums[1] + nums[2] - target; for (int i = 0; i < nums.Length - 2; i++){ while (i > 0 && i < nums.Length - 2 && nums[i] == nums[i - 1]) i++; int lo = i + 1, hi = nums.Length - 1; while (lo < hi){ int tmpcloset = nums[i] + nums[lo] + nums[hi] - target; if (tmpcloset == 0) return target; if (tmpcloset < 0) { if (-tmpcloset < Math.Abs(closet)) closet = tmpcloset; lo++; } else{//tmpcloset>0 if (tmpcloset < Math.Abs(closet)) closet = tmpcloset; hi--; } } } return closet + target; }
题库
Leetcode算法题目解决方案每天更新在github库中,欢迎感兴趣的朋友加入进来,也欢迎star,或pull request。https://github.com/jackzhenguo/leetcode-csharp完成题目索引
http://blog.csdn.net/daigualu/article/details/73008186相关文章推荐
- 【LeetCode】16. 3Sum Closest
- [leetcode]16. 3Sum Closest
- 16. 3Sum Closest
- LeetCode 16. 3Sum Closest
- leetcode 16. 3Sum Closest
- 16. 3Sum Closest
- leetCode#16. 3Sum Closest
- LeetCode 16. 3Sum Closest
- Middle-题目67:16. 3Sum Closest
- 16. 3Sum Closest
- LeetCode 16. 3Sum Closest
- leetcode 16. 3Sum Closest
- [leetcode]16. 3Sum Closest
- 16. 3Sum Closest
- 16. 3Sum Closest
- Leetcode 1. Two Sum & 15. 3Sum & 16. 3Sum Closest & 18. 4Sum
- 16. 3Sum Closest
- LeetCode 16. 3Sum Closest
- 16. 3Sum Closest
- LeetCode-16. 3Sum Closest