Package g0001_0100.s0015_3sum

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    15 - 3Sum.

    Medium

    Given an integer array nums, return all the triplets [nums[i], nums[j], nums[k]] such that i != j, i != k, and j != k, and nums[i] + nums[j] + nums[k] == 0.

    Notice that the solution set must not contain duplicate triplets.

    Example 1:

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

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

    Example 2:

    Input: nums = []

    Output: []

    Example 3:

    Input: nums = 0

    Output: []

    Constraints:

    • 0 <= nums.length <= 3000

    • <code>-10<sup>5</sup><= numsi<= 10<sup>5</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>> threeSum(IntArray nums)

      • Methods inherited from class java.lang.Object

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