Two Sum II - Input array is sorted

167. Two Sum II - Input array is sorted

题目的原意是从已经按升序排列的数组中找到两个数的和等于给定的数值。

Given: an array of integers that is already sorted in ascending order, find two numbers such that they add up to a specific target number.
output: the function twoSum should return indices of the two numbers such that 

they add up to the target, where index1 must be less than index2. both index1 and index2 are not zero-based.
e.g.
    input: numbers={2,7,11,15}, target=9
    output: index1=1, index2=2

解题思路：可以和two sum一样用hash table的方法来解题。但我们也可以利用sorted 数组这个附加条件来用新的方法解决这要问题。

比如可以想到使用binary search的方法。用每次遍历计算目标数值和当前数值的差，并判断这个数在search数组index的位置。这个判断是采用binary search的取中间值的方法来实现的。如果相等，返回两个数的index， 如果没找到返回-1。runtime是O(nlogn)，space 是 O(1)

我们也可以用双指针的方法来做这道题。被指的两个数的和与目标数值比较有一下三种情况。（1）大于目标数值，这样需要减少较大数的index。（2）小于目标数值，这样需要增加较小数的index。（3)等于目标数值，返回两个数的index。runtime是O(n), space 是 O(1).

Java code

1. binary search 的方法

public class Solution {
    public int[] twoSum(int[] numbers, int target) {
        for (int i=0; i<numbers.length; i++) {
              int j = bsearch(numbers, target-numbers[i], i+1);
              if (j != -1）{
                  return new int[] {i+1, j+1};
              }
        }
        throw new IllegalArgumentException("No two sum solution");
    }
    private int bsearch(int[] A, int key, int start) {
         int L = start;
         int R = A.length-1;
         while (L < R) {
             int M = (L+R)/2;
             if (A[M] < key) {
                 L = M + 1;
             } else {
                 R = M;
             }
             return (L == R && A[L] == key)? L : -1;
         }
    }
}

2. two pointers 的方法

public class Solution {
    public int[] twoSum(int[] numbers, int target) {
        int i = 0;
        int j = numbers.length - 1;
        while (i < j) {
             int sum = numbers[i] + numbers[j];
              if (sum < target) {
                   i++;
              } else if (sum > target){
                   j--;
              } else {
                   return int[] {i+1, j+1};
              }
        }
        throw new IllegalArgumentException("No two sum solution");
    }
}