<p>Given an integer array <code>nums</code> of length <code>n</code> and an integer <code>target</code>, find three integers in <code>nums</code> such that the sum is closest to <code>target</code>.</p> <p>Return <em>the sum of the three integers</em>.</p> <p>You may assume that each input would have exactly one solution.</p> <p> </p> <p><strong class="example">Example 1:</strong></p> <pre> <strong>Input:</strong> nums = [-1,2,1,-4], target = 1 <strong>Output:</strong> 2 <strong>Explanation:</strong> The sum that is closest to the target is 2. (-1 + 2 + 1 = 2). </pre> <p><strong class="example">Example 2:</strong></p> <pre> <strong>Input:</strong> nums = [0,0,0], target = 1 <strong>Output:</strong> 0 <strong>Explanation:</strong> The sum that is closest to the target is 0. (0 + 0 + 0 = 0). </pre> <p> </p> <p><strong>Constraints:</strong></p> <ul> <li><code>3 <= nums.length <= 500</code></li> <li><code>-1000 <= nums[i] <= 1000</code></li> <li><code>-10<sup>4</sup> <= target <= 10<sup>4</sup></code></li> </ul>