Given a sorted array of integers and a target, return the indices [i, j] (i < j) of two numbers that sum to the target. Solve in O(n) with constant extra space.