LeetCode 3Sum Closest

3Sum Closest

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).

Write a simple version first, it can only pass small data.

class Solution {
public:
    int threeSumClosest(vector<int> &num, int target) {
        //assume the smallest size is 3

		//ret = (num1 + num2 + num3); delta = abs(ret - target)

		int ret = num[0] + num[1] + num[2];
		int delta = abs(ret - target);

		//iterate all
		for(int i = 0; i < num.size(); ++i)
		{
			for(int j = i + 1; j < num.size(); ++j)
			{
				for(int k = j + 1; k < num.size(); ++k)
				{
					int temp = num[i] + num[j] + num[k];
					if(abs(temp - target) < delta)
					{
						delta = abs(temp - target);
						ret = temp;
					}
				}
			}
		}
        
		//return

		return ret;
    }
};

Optimize it!

class Solution {
public:
    int threeSumClosest(vector<int> &num, int target) {
        //assume the smallest size is 3

		//ret = (num1 + num2 + num3); delta = abs(ret - target)

		int ret = num[0] + num[1] + num[2];
		int delta = abs(ret - target);

		//sort
		sort(num.begin(), num.end());
		//for each idx
		for(int idx = 0; idx < (int)num.size() - 2; ++idx)
		{
			int left = idx + 1;
			int right = (int)num.size() - 1;
			int sum = 0;
			while(left < right)
			{
				//>, <, =
				sum = num[idx] + num[left] + num[right];
				if(target == sum)
				{
					return target;
				}
				else if(abs(sum - target) < delta)
				{
					delta = abs(sum - target);
					ret = sum;
				}

				if(sum > target)
				{
					--right;
				}
				else
				{
					++left;
				}
			}
		}
			
        
		//return

		return ret;
    }
};