LeetCode 167: Two Sum II - Input array is sorted {Binary Search O(log n}

preview_player
Показать описание
In this episode, we solve Leetcode and Hacker Rank problem 1 to figure out the indices of two numbers within an array that sum up to a given target number.

Top Software/ Coding Channels:

Top Python Coding Channels:

Snapchat: @christopheribe

Given an 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.

Return the indices of the two numbers (1-indexed) as an integer array answer of size 2.

The tests are generated such that there is exactly one solution. You may not use the same element twice.

Input: numbers = [2,7,11,15], target = 9
Output: [1,2]
Explanation: The sum of 2 and 7 is 9. Therefore index1 = 1, index2 = 2.

Input: numbers = [2,3,4], target = 6
Output: [1,3]

Input: numbers = [-1,0], target = -1
Output: [1,2]
Рекомендации по теме
visit shbcf.ru