LeetCode 16. 最接近的三数之和

class Solution
{
public:
    int threeSumClosest(vector<int> &nums, int target)
    {
        int closest = nums[0] + nums[1] + nums[2], len = nums.size();
        for (int i = 0; i < len - 2; i++)
        {
            for (int j = i + 1; j < len - 1; j++)
            {
                for (int k = j + 1; k < len; k++)
                {
                    if (abs(nums[i] + nums[j] + nums[k] - target) < abs(closest - target))
                    {
                        closest = nums[i] + nums[j] + nums[k];
                    }
                }
            }
        }
        return closest;
    }
};