Package g0001_0100.s0016_3sum_closest

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    16 - 3Sum Closest\.

    Medium

    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

    Output: 2

    Explanation: The sum that is closest to the target is 2. (-1 + 2 + 1 = 2).

    Example 2:

    Input: nums = 0,0,0, target = 1

    Output: 0

    Constraints:

    • 3 <= nums.length <= 1000

    • -1000 <= nums[i] <= 1000

    • <code>-10<sup>4</sup><= target <= 10<sup>4</sup></code>

    • Nested Class Summary

      Nested Classes 
      Modifier and Type Class Description

    • Field Summary

      Fields 
      Modifier and Type Field Description

    • Constructor Summary

      Constructors 
      Constructor Description
      Solution()

    • Enum Constant Summary

      Enum Constants 
      Enum Constant Description

    • Method Summary

      Modifier and Type Method Description
      final Integer threeSumClosest(IntArray nums, Integer target)

      • Methods inherited from class java.lang.Object

        clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait