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

class Solution
{
public:
	int threeSumClosest(vector<int>& nums, int target) {
		int sum = 0;
		if (nums.size() <= 3) {
			for (int j = 0; j < nums.size(); ++j)
				sum += nums[j];
			return sum;
		}
		int i, len = nums.size();
		int closest = 10000;
		sort(nums.begin(), nums.end());
		for (i = 0; i < len-2; i++) {
			int m = nums.size() - 1;
			int n = i + 1;
			while (n < m) {
				sum = nums[i] + nums[n] + nums[m];
				if (abs(target - closest)>abs(target - sum)) {
					closest = sum;
					if (sum > target)
						m--;
					else if (sum < target)
						n++;
					else if (sum == target)
						return sum;
				}
				else if (sum > target)
					m--;
				else if (sum < target)
					n++;
				else if (sum == target)
					return sum;
			}
		}
		return closest;
	}
};