filmov
tv
Leetcode 167 : Two Sum II - Input Array Is Sorted (Medium)

Показать описание
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].
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.
#leetcode #coding #array #two_pointers #twopointers #leetcode_medium #codemodecode #programming #codinginterview #placement
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.
#leetcode #coding #array #two_pointers #twopointers #leetcode_medium #codemodecode #programming #codinginterview #placement