Leetcode#16 3Sum Closest

原创 2015年07月06日 22:23:58

Difficulty: Medium

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的思路一毛一样,做些小调整就好了。

int threeSumClosest(vector<int>& nums, int target) {
    int ans = 9999999,ans1;
    int len =  nums.size();
    sort(nums.begin(),nums.end());
    for(int i = 0;i<len-2;i++){
            int beg = i+1, en = len-1;
            int expect;
            while(en>beg){
                expect = target - nums[beg] - nums[en] - nums[i];

                if(nums[beg]==nums[beg-1]&&beg>i+1)
                {   beg++;
                    continue;}
                if(nums[en]==nums[en+1]&&en<len-1){
                    en--;
                    continue;}

                if(expect>0){
                    //cout<<nums[i]<<nums[beg]<<nums[en]<<endl;
                       // cout<<"expect is "<<expect<<endl;
                    if(expect<ans)
                {
                        ans1  = target-expect;
                        ans = expect;
                }
                    beg++;
                    //cout<<ans1<<endl;
                }
                else if(expect<0){
                   // cout<<nums[i]<<nums[beg]<<nums[en]<<endl;
                    //cout<<"expect is "<<expect<<endl;
                    if(0-expect<ans)
                {
                        ans1  = target-expect;
                        ans = 0-expect;
                }
                    en--;
                   // cout<<ans1<<endl;
                }
                else{
                    return target;
                }
            }

    }

        return ans1;
    }


版权声明:本文为博主原创文章,未经博主允许不得转载。

相关文章推荐

leetcode.16----------3Sum Closest

Given an array S of n integers, find three integers in S such that the sum is closest to a given num...

16. 3Sum Closest LeetCode题解

Given an array S of n integers, find three integers in S such that the sum is closest to a given num...

[LeetCode16]3Sum Closest

3Sum Closest Given an array S of n integers, find three integers in S such that the sum is closest t...
  • sbitswc
  • sbitswc
  • 2014年06月05日 04:51
  • 555

[leetcode: Python]16. 3Sum Closest

Given an array S of n integers, find three integers in S such that the sum is closest to a given num...
  • NXHYD
  • NXHYD
  • 2017年05月18日 16:39
  • 98

leetcode 16 3Sum Closest

问题https://leetcode.com/problems/3sum-closest/解法class Solution { public: int threeSumClosest(vect...

【leetcode】Array——3Sum Closest(16)

题目: Given an array S of n integers, find three integers in S such that the sum is closest to a gi...

LeetCode 16_3Sum Closest

今天抽了点儿时间,来刷一道。 这是第16题了,这连续几道题的题型都比较类似,都是要求对数组排列组合,然后从中找出符合特定条件的一些组合,这种题算是一种比较大的题型吧,很多题目最终都转化成了这种题目,...
  • cyfcsd
  • cyfcsd
  • 2015年09月24日 21:09
  • 255

[leetcode 16] 3Sum Closest

题目: Given an array S of n integers, find three integers in S such that the sum is closest to a ...

《LeetBook》leetcode题解(16):3Sum Closest [M]

16. 3Sum Closest [M]Given an array S of n integers, find three integers in S such that the sum is cl...

LeetCode | 16. 3Sum Closest

Given an array S of n integers, find three integers in S such that the sum is closest to a given num...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:Leetcode#16 3Sum Closest
举报原因:
原因补充:

(最多只允许输入30个字)