力扣（LeetCode）試題--最接近的三數之和 c++實現

3Sum Closest（最接近的三數之和） Given an array nums of n integers and an integer target, find three integers in nums such that the sum is closest to target. Return the sum of the three integers. You may assume

>>阅读原文<<