3sum-closest

java

python

python3

mysql

mssql

oraclesql

csharp

javascript

typescript

bash

swift

kotlin

dart

golang

ruby

scala

rust

racket

erlang

elixir

pythondata

postgresql

cangjie

Algorithms

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>.

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>

threeSumClosest

3Sum Closest

3Sum

3sum

三数之和

3Sum Smaller

3sum-smaller

较小的三数之和

Array

Two Pointers

Sorting

给你一个长度为 <code>n</code> 的整数数组&nbsp;<code>nums</code>&nbsp;和 一个目标值&nbsp;<code>target</code>。请你从 <code>nums</code> 中选出三个整数，使它们的和与&nbsp;<code>target</code>&nbsp;最接近。

返回这三个数的和。

假定每组输入只存在恰好一个解。

&nbsp;

示例 1：

<pre>
输入：nums = [-1,2,1,-4], target = 1
输出：2
解释：与 target 最接近的和是 2 (-1 + 2 + 1 = 2)。
</pre>

示例 2：

<pre>
输入：nums = [0,0,0], target = 1
输出：0
解释：与 target 最接近的和是 0（0 + 0 + 0 = 0）。</pre>

&nbsp;

提示：

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