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 i=0; i<nums.size(); i++)
                sum += nums[i];
            return sum;
        }
        sort(nums.begin(), nums.end());
        int  min = 1000000;
        int ans;
        int n = nums.size();
        for(int i=0; i<n-2; i++)
        {
            int l = i + 1;
            int r = n - 1;
            while(l < r)
            {
                int s = nums[i] + nums[l] + nums[r];
                if(abs(s - target) < min)
                {
                    min = abs(s - target);
                    ans = s;
                    if(s - target < 0)
                        l++;
                    else
                        r--;
                }
                else if(s - target < 0)
                    l++;
                else
                    r--;
            }
        }
        return ans;
    }
};