16. 3Sum Closest
来源:互联网 发布:有哪些软件管家 编辑:程序博客网 时间:2024/05/16 00:53
题目:
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最接近。返回最接近的三个数之和。
思路:
与3Sum题目类似,先排序,之后再夹逼。
代码:
C++版:
class Solution {public: int threeSumClosest(vector<int>& nums, int target) { int result = 0; int curMin = INT_MAX; sort(nums.begin(), nums.end()); for(int i=0; i<nums.size()-2; i++){ int j = i+1; int k = nums.size()-1; while(j<k){ const int sum = nums[i]+nums[j]+nums[k]; const int gap = abs(sum - target); if(gap < curMin){ result = sum; curMin = gap; } if(sum < target){ j++; }else{ k--; } } } return result; }};
0 0
- 16. 3Sum Closest
- 16. 3Sum Closest
- 16. 3Sum Closest
- 16. 3Sum Closest
- 16. 3Sum Closest
- 16. 3Sum Closest
- 16. 3Sum Closest
- 16. 3Sum Closest
- 16. 3Sum Closest
- 16. 3Sum Closest
- 16. 3Sum Closest
- 16. 3Sum Closest
- 16. 3Sum Closest
- 16. 3Sum Closest
- 16. 3Sum Closest
- 16. 3Sum Closest
- 16. 3Sum Closest
- 16. 3Sum Closest
- &和&&的区别,逻辑运算符和位运算符
- Banana Pro GPS模块连接教程
- slab_--2 创建 销毁 cache
- Android Studio解决导入开源项目出现的相关问题
- ssm的使用技巧
- 16. 3Sum Closest
- jupyter notebook嵌入到博客
- Jamie's Contact Groups(二分图多重匹配+二分)(网络流)
- 简述Python中"_"的使用常识
- OpenGL: 你不知道的左右手坐标系
- iOS开发中常用的几个插件
- bzoj 3832: [Poi2014]Rally(线段树+拓扑排序)
- 54. Spiral Matrix
- Matlab新手学习笔记