[LeetCode] 3Sum Closest

class Solution {
public:
    int threeSumClosest(vector<int> &num, int target) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        if (num.size() < 3) return 0;
        
        sort(num.begin(), num.end());
        
        int ret = num[0] + num[1] + num[2];
        
        for (int i = 0; i < num.size(); i++) {
            int j = i + 1;
            int k = num.size() - 1;
            
            while (j < k) {
                int sum = num[i] + num[j] + num[k];
                
                if (abs(sum - target) < abs(ret - target)) {
                    ret = sum;
                }
                
                if (sum == target)
                    return target;
                else if (sum < target) {
                    j++;
                } else {
                    k--;
                }
            }
        }
        
        return ret;
    }
};

Small Case: 4ms

Large Case: 52ms

Time: O(n^2)

Space: O(n)