Pair in a sorted list
Easyarraytwo pointersbinary search
nums is sorted ascending and exactly one pair sums to target. Return their indexes (smaller first) using O(1) extra memory.
Example 1
Input: nums = [2,7,11,15], target = 9 Output: [0,1]
Example 2
Input: nums = [-1,0], target = -1 Output: [0,1]
Constraints
- 2 ≤ nums.length ≤ 3·10⁴
- nums is sorted
- Exactly one answer exists
Submit checks your solution against 7 tests, including hidden ones.
/**
* @param {int[]} nums
* @param {int} target
* @return {int[]}
*/
function pairInSorted(nums, target) {
}