Given an integer array nums of length n 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 that each input would have exactly one solution.
请问这题怎么解==
想好久 只想得出n^3的白痴答案
好苦