Package g0001_0100.s0001_two_sum

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    1 - Two Sum.

    Easy

    Given an array of integers nums and an integer target, return indices of the two numbers such that they add up to target.

    You may assume that each input would have exactly one solution , and you may not use the same element twice.

    You can return the answer in any order.

    Example 1:

    Input: nums = 2,7,11,15, target = 9

    Output: 0,1

    Output: Because nums0 + nums1 == 9, we return 0, 1.

    Example 2:

    Input: nums = 3,2,4, target = 6

    Output: 1,2

    Example 3:

    Input: nums = 3,3, target = 6

    Output: 0,1

    Constraints:

    • <code>2 <= nums.length <= 10<sup>4</sup></code>

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

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

    • Only one valid answer exists.

    Follow-up: Can you come up with an algorithm that is less than <code>O(n<sup>2</sup>) </code>time complexity?

    • 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 IntArray twoSum(IntArray numbers, Integer target)

      • Methods inherited from class java.lang.Object

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