# Leetcode 16 - 3Sum closest

`Note:`

- Just like the other
`3sum`

questions, just use`double pointers`

. - Fix an
`i`

, then set`left = i + 1, right = len - 1`

and move either one by`sum`

is bigger than`target`

or`not`

. - Keep compare with
`res`

while moving pointers.

`Question:`

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.

`Example:`

1 | Input: nums = [-1,2,1,-4], target = 1 |

`Code:`

1 | /** |