Package g0101_0200.s0167_two_sum_ii_input_array_is_sorted

Class Solution

java.lang.Object

g0101_0200.s0167_two_sum_ii_input_array_is_sorted.Solution

public class Solution
extends Object

167 - Two Sum II - Input Array Is Sorted\. Easy Given a **1-indexed** array of integers `numbers` that is already **_sorted in non-decreasing order_** , find two numbers such that they add up to a specific `target` number. Let these two numbers be numbers[index1] and numbers[index2] where 1 <= index1 < index2 <= numbers.length. Return _the indices of the two numbers,_ index1 _and_ index2_, **added by one** as an integer array_ [index1, index2] _of length 2._ The tests are generated such that there is **exactly one solution**. You **may not** use the same element twice. **Example 1:** **Input:** numbers = [2,7,11,15], target = 9 **Output:** [1,2] **Explanation:** The sum of 2 and 7 is 9. Therefore, index₁ = 1, index₂ = 2. We return [1, 2]. **Example 2:** **Input:** numbers = [2,3,4], target = 6 **Output:** [1,3] **Explanation:** The sum of 2 and 4 is 6. Therefore index₁ = 1, index₂ = 3. We return [1, 3]. **Example 3:** **Input:** numbers = [\-1,0], target = -1 **Output:** [1,2] **Explanation:** The sum of -1 and 0 is -1. Therefore index₁ = 1, index₂ = 2. We return [1, 2]. **Constraints:** * 2 <= numbers.length <= 3 * 104 * `-1000 <= numbers[i] <= 1000` * `numbers` is sorted in **non-decreasing order**. * `-1000 <= target <= 1000` * The tests are generated such that there is **exactly one solution**.

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)