Two Sum II (Sorted Array)

Given a sorted array and a target, print the 1-based indices of the two numbers that add up to target. Exactly one solution exists. Use O(1) extra space.

2 <= n <= 3 * 10^4 -1000 <= nums[i] <= 1000