451. Find Pair with Given Sum in Sorted Array

Given a sorted array nums and an integer target, find indices [i, j] (i < j) such that nums[i] + nums[j] == target. Return [-1, -1] if no such pair exists. Return the first valid pair found (smallest i, then smallest j).

Input: A sorted integer array nums and integer target.

Output: [i, j] (0-indexed) where nums[i]+nums[j]==target, or [-1,-1].

Examples

Input: [2,7,11,15], 9
Output: [0,1]
Explanation: nums[0]+nums[1]=2+7=9.

Input: [1,2,3,4,5], 10
Output: [-1,-1]
Explanation: No pair sums to 10 (max is 4+5=9).

Input: [-5,-3,0,3,5], 0
Output: [1,3]
Explanation: nums[1]+nums[3]=-3+3=0.

Constraints

• 2 <= nums.length <= 10^4
• -10^9 <= nums[i] <= 10^9
• Sorted ascending
• All distinct

Asked by