3sum-closest

java

python3

python

javascript

typescript

csharp

golang

kotlin

swift

rust

ruby

dart

scala

elixir

erlang

racket

bash

mysql

mssql

postgresql

oraclesql

pythondata

Algorithms

Given an integer array <code>nums</code> of length <code>n</code> and an integer <code>target</code>, find three integers at distinct indices in <code>nums</code> such that the sum is closest to <code>target</code>.

Return the sum of the three integers.

You may assume that each input would have exactly one solution.

&nbsp;
Example 1:

<pre>
Input: nums = [-1,2,1,-4], target = 1
Output: 2
Explanation: The sum that is closest to the target is 2. (-1 + 2 + 1 = 2).
</pre>

Example 2:

<pre>
Input: nums = [0,0,0], target = 1
Output: 0
Explanation: The sum that is closest to the target is 0. (0 + 0 + 0 = 0).
</pre>

&nbsp;
Constraints:

<ul>
	<li><code>3 &lt;= nums.length &lt;= 500</code></li>
	<li><code>-1000 &lt;= nums[i] &lt;= 1000</code></li>
	<li><code>-104 &lt;= target &lt;= 104</code></li>
</ul>