Because the array is sorted, use two pointers from both ends.
Start l at 0 and r at n-1. If numbers[l] + numbers[r] is too small, increment l; if too large, decrement r. When equal, return 1-indexed indices.
Moving the left pointer increases the sum; moving the right pointer decreases it. Sorted order makes these moves correct.
Because the array is sorted, use two pointers from both ends.
Start l at 0 and r at n-1. If numbers[l] + numbers[r] is too small, increment l; if too large, decrement r. When equal, return 1-indexed indices.
Moving the left pointer increases the sum; moving the right pointer decreases it. Sorted order makes these moves correct.