3Sum Closest
来源:互联网 发布:steam数据统计 编辑:程序博客网 时间:2024/03/29 03:45
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.
class Solution {public: int threeSumClosest(vector<int>& nums, int target) { int L = nums.size(); if(L == 3) { return nums[0]+nums[1]+nums[2]; } sort(nums.begin(),nums.end()); int j,k,min = abs(target - (nums[0]+nums[1]+nums[L-1])),res = nums[0]+nums[1]+nums[2]; for(int i = 0;i < L-1; i++ ) { //初始化下标 j = i+1; k = L-1; while(j < k) { int tmp = abs(target - (nums[i]+nums[j]+nums[k])); if(tmp < min) { min = tmp; res = nums[i]+nums[j]+nums[k]; } if(nums[i]+nums[j]+nums[k] > target) { --k; continue; } else if(nums[i]+nums[j]+nums[k] < target) { ++j; continue; } else return target; } } return res; }};
0 0
- 3 Sum & 3 Sum Closest
- 【Leetcode】3Sum Closest (Sum)
- LeetCode: 3 Sum Closest
- 3Sum Closest
- leetcode - 3 sum closest
- leetcode 3Sum Closest
- LeetCode: 3Sum Closest
- [Leetcode]3Sum Closest
- Leetcode: 3SUM Closest
- LeetCode 3Sum Closest
- [Leetcode] 3Sum Closest
- leetcode002:3sum closest
- LeetCode : 3Sum Closest
- LeetCode 3Sum Closest
- 3Sum Closest
- 3Sum Closest
- 3Sum Closest
- [LeetCode] 3Sum Closest
- NOJ 1004 0-1背包问题
- 构造方法与this关键字
- 有关send(),recv()函数的理解
- c++ #include是怎么样工作的?
- 投影矩阵的推导(OpenGl)
- 3Sum Closest
- 欢迎使用CSDN-markdown编辑器
- JAVA开发9--获取当前时间--SimpleDateFormat
- xcode上传app成功后,在itune看不到的问题
- R语言在线地图神器:Leaflet for R包(六,完结篇)栅格、颜色和图例设置
- 动态链接库的两种调用方法
- HDU3555 常规数位dp入门....
- jmeter学习随笔2
- leetcode_206. Reverse Linked List 反转单链表