Package g0001_0100.s0018_4sum

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    18 - 4Sum\.

    Medium

    Given an array nums of n integers, return an array of all the unique quadruplets [nums[a], nums[b], nums[c], nums[d]] such that:

    • 0 <= a, b, c, d < n

    • a, b, c, and d are distinct.

    • nums[a] + nums[b] + nums[c] + nums[d] == target

    You may return the answer in any order.

    Example 1:

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

    Output: [-2,-1,1,2,-2,0,0,2,-1,0,0,1]

    Example 2:

    Input: nums = 2,2,2,2,2, target = 8

    Output: [2,2,2,2]

    Constraints:

    • 1 <= nums.length <= 200

    • <code>-10<sup>9</sup><= numsi<= 10<sup>9</sup></code>

    • <code>-10<sup>9</sup><= target <= 10<sup>9</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 List<List<Integer>> fourSum(IntArray nums, Integer target)

      • Methods inherited from class java.lang.Object

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