Package g0001_0100.s0001_two_sum

Class Solution

java.lang.Object

g0001_0100.s0001_two_sum.Solution

public class Solution
extends Object

1 - Two Sum.<p>Easy</p> <p>Given an array of integers <code>nums</code> and an integer <code>target</code>, return <em>indices of the two numbers such that they add up to <code>target</code></em>.</p> <p>You may assume that each input would have <strong><em>exactly</em> one solution</strong> , and you may not use the <em>same</em> element twice.</p> <p>You can return the answer in any order.</p> <p><strong>Example 1:</strong></p> <p><strong>Input:</strong> nums = [2,7,11,15], target = 9</p> <p><strong>Output:</strong> [0,1]</p> <p><strong>Explanation:</strong> Because nums[0] + nums[1] == 9, we return [0, 1].</p> <p><strong>Example 2:</strong></p> <p><strong>Input:</strong> nums = [3,2,4], target = 6</p> <p><strong>Output:</strong> [1,2]</p> <p><strong>Example 3:</strong></p> <p><strong>Input:</strong> nums = [3,3], target = 6</p> <p><strong>Output:</strong> [0,1]</p> <p><strong>Constraints:</strong></p> <ul> <li><code>2 <= nums.length <= 10⁴</code></li> <li><code>-10⁹ <= nums[i] <= 10⁹</code></li> <li><code>-10⁹ <= target <= 10⁹</code></li> <li><strong>Only one valid answer exists.</strong></li> </ul> <p><strong>Follow-up:</strong> Can you come up with an algorithm that is less than <code>O(n²)</code> time complexity?</p>

Constructor Summary

Constructors

Constructor	Description
Solution()

Method Summary

Modifier and Type	Method	Description
int[]	twoSum(int[] numbers, int target)

Methods inherited from class java.lang.Object

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

Constructor Details

Solution

public Solution()

Method Details

twoSum

public int[] twoSum(int[] numbers,
 int target)