LeetCode 16. 3Sum Closest
来源:互联网 发布:德力西 知乎 编辑:程序博客网 时间:2024/04/18 14:28
描述
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).
分析
先排序,然后左右夹逼,复杂度 O(n2)。
代码
class Solution {public: int threeSumClosest(vector<int>& nums, int target) { int min_gap = INT_MAX; int result = 0; sort(nums.begin(), nums.end()); for (auto a = nums.begin(); a != prev(nums.end(), 2); ++a) { auto b = next(a); auto c = prev(nums.end()); while (b < c) { int sum = *a + *b + *c; int gap = abs(sum - target); if (gap < min_gap) { min_gap = gap; result = sum; } if (sum < target) ++b; else --c; } } return result; }};
0 0
- LeetCode 16. 3Sum Closest
- LeetCode --- 16. 3Sum Closest
- [Leetcode] 16. 3Sum Closest
- 【leetcode】16. 3Sum Closest
- [leetcode] 16. 3Sum Closest
- leetcode 16. 3Sum Closest
- leetcode 16. 3Sum Closest
- leetcode 16. 3Sum Closest
- LeetCode - 16. 3Sum Closest
- [LeetCode]16. 3Sum Closest
- LeetCode 16. 3Sum Closest
- LeetCode *** 16. 3Sum Closest
- Leetcode 16. 3Sum Closest
- leetcode 16. 3Sum Closest
- 【LeetCode】16. 3Sum Closest
- leetcode 16. 3Sum Closest
- 【leetcode】16. 3Sum Closest
- leetcode 16. 3Sum Closest
- cocos2dx-lua 对lua项目中class(sub,super)的理解
- 《C++ Primer》读书笔记-第一章 Hello World
- getSystemService与getService区别
- 【C++】浅析C++中的对象模型
- struts2 无法获取action属性的问题解决
- LeetCode 16. 3Sum Closest
- CSS基础{精灵图、梅兰商贸}
- 第五周练习计划
- 三维几何,四面体(压纸器,LA 4795)
- JavaScript 实现面向对象(入门)
- Kafka之sync、async以及oneway
- eclipse的代码不全功能
- CentOS下使用yum安装Mysql,以及Mysql主从复制的配置
- 两字符串比较函数