Leetcode 16最接近的三个数字之和

方法一：暴力遍历 //cpp class Solution { public: int threeSumClosest(vector<int>& nums, int target) { sort(nums.begin(),nums.end()); if(nums.size() < 3 ) return 0; int gap=INT_MAX;

>>阅读原文<<