# [LeetCode 16] 3Sum Closest

[LeetCode 16] 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.