LeetCode/16.cpp at master · nitin-maharana/LeetCode · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
/*
 * Written by Nitin Kumar Maharana
 * nitin.maharana@gmail.com
 */

class Solution {
public:
    int threeSumClosest(vector<int>& nums, int target) {
        sort(nums.begin(), nums.end());

        int resultDiff, resultSum, currSum, currDiff;
        int len, l, r;

        len = nums.size();
        resultDiff = INT_MAX;
        resultSum = nums[0]+nums[1]+nums[2];

        for(int i = 0; i < len-2; i++)
        {
            l = i+1;
            r = len-1;

            while(l < r)
            {
                currSum = nums[i] + nums[l] + nums[r];
                currDiff = abs(currSum - target);

                if(currDiff < resultDiff)
                {
                    resultDiff = currDiff;
                    resultSum = currSum;
                }

                if(l+1 < r && abs(currSum-nums[l]+nums[l+1]-target) < currDiff)
                {
                    l++;

                    while(l+1 < r && nums[l] == nums[l+1])
                        l++;
                }
                else
                {
                    r--;

                    while(r-1 > l && nums[r] == nums[r-1])
                        r--;
                }
            }
        }

        return resultSum;
    }
};