leetcode 016 —— 3Sum Closest
来源:互联网 发布:淘宝号怎么绑支付宝 编辑:程序博客网 时间:2024/06/05 08:24
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).思路:设定closest,closest与target差值最小,类似贪心算法
class Solution {public:int threeSumClosest(vector<int>& nums, int target) {int n = nums.size();if (n < 3) return 0;int closest = nums[0]+nums[1]+nums[2];sort(nums.begin(), nums.end());for (int i = 0; i < n-2; i++){if (i>0 && nums[i] == nums[i - 1])continue;int l = i + 1;int r = n - 1;while (l < r){int sum = nums[i] + nums[l] + nums[r];if (sum == target)return sum;else if(sum>target){closest = (abs(closest - target) < abs(sum - target) ? closest : sum);r--;}else{closest = (abs(closest - target) < abs(sum - target) ? closest : sum);l++;}}}return closest;}};
0 0
- leetcode 016 —— 3Sum Closest
- LeetCode——3Sum Closest
- LeetCode——3Sum Closest
- LeetCode题解——3Sum Closest
- LeetCode——16. 3Sum Closest
- Leetcode——16. 3Sum Closest
- LeetCode 016 3Sum Closest
- LeetCode 016 3Sum Closest
- LeetCode 016 3Sum Closest
- [LeetCode]016-3Sum-Closest
- LeetCode 016 3Sum Closest
- LeetCode 016 3Sum Closest
- LeetCode-016 3Sum Closest
- LeetCode——3Sum & 3Sum Closest
- 【LeetCode】LeetCode——第16题:3Sum Closest
- LeetCode: 3 Sum Closest
- leetcode - 3 sum closest
- leetcode 3Sum Closest
- stemapp7月9日版测试dojo的click、onmouseover事件成功
- HOG介绍2
- 关于MVC结构中的action,service,dao,domain的解释
- sequence DEMO(tuple or string)
- 制作Android手机开机动画的详细过程
- leetcode 016 —— 3Sum Closest
- SylixOS 热插拔系统
- WPF: 把引用的dll移动到自定义路径
- openwrt 利用 nodogsplash 打造广告路由器
- Android开发 通过httpURL获取图片
- 【Java】对两个用链表表示的整数求和
- Restore IP Addresses : 0ms
- [刷题]Combination Sum
- spring支持跨域