LeetCode
来源:互联网 发布:电信会屏蔽哪些端口 编辑:程序博客网 时间:2024/06/03 18:08
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).
同3sum做法,套路啊套路
class Solution {public: int threeSumClosest(vector<int>& nums, int target) { sort(nums.begin(), nums.end()); int ans = nums[0] + nums[1] + nums[2]; for (int i = 0; i < nums.size(); ++i) { if (i == 0 || nums[i] != nums[i-1]) { int le = i + 1, ri = nums.size() - 1; while (le < ri) { int sum3 = nums[le] + nums[ri] + nums[i]; if (abs(ans - target) > abs(sum3 - target)) ans = sum3; if (sum3 < target) { le++; while (le < ri && nums[le] == nums[le-1]) le++; } else { ri--; while (le < ri && nums[ri] == nums[ri+1]) ri--; } } } } return ans; }};
阅读全文
0 0
- leetcode
- [leetcode]
- LeetCode
- leetcode
- leetcode
- leetcode:
- leetcode:
- LeetCode
- leetcode
- LEETCODE
- leetcode
- leetCode
- leetcode
- [leetcode]
- LeetCode
- leetcode
- leetcode:
- leetcode
- python __new__和__init__的区别
- ubuntu16.04安装Anaconda
- 大数据量下高并发同步的讲解
- 关于ssm框架搭建注意事项
- BZOJ1012_Maxnumber_KEY
- LeetCode
- python 连接vs调试
- IM即时通讯项目讲解(一)--实现类似qq微信表情面板无缝切换
- 微信小程序开发必备 hellow word
- TCP定时器
- Vuforia for IOS
- Nginx 详细之反向代理、负载均衡、页面缓存、URL重写及读写分离详解
- 用python实现的简易计算器
- 0711编程之美找符合条件的整数