Leetcode 167 Two Sum II - Input array is sorted

思路一： brute force，时间复杂度为O(n^2)

class Solution {
    public int[] twoSum(int[] numbers, int target) {
        int[] res = new int[2];
        for(int i = 0; i < numbers.length - 1; i++){
            int v1 = numbers[i];
            for(int j = i + 1; j < numbers.length; j++){
                int v2 = numbers[j];
                if(v1 + v2 == target){
                    res[0] = i + 1;
                    res[1] = j + 1;
                    return res;
                }
            }
        }
        return res;
    }
}

思路二： 思路一的优化，在寻找第二个下标的时候不再傻傻的再写个for loop，而是采用binary search。时间复杂度为O(NlogN)

class Solution {
    public int[] twoSum(int[] numbers, int target) {
        int[] res = new int[2];
        for(int i = 0; i < numbers.length; i++){
            int left = i + 1, right = numbers.length - 1, remain = target - numbers[i];
            while(left <= right){
                int mid = left + (right - left)/2;
                if(numbers[mid] == remain){
                    res[0] = i + 1;
                    res[1] = mid + 1;
                    return res;
                }else if(numbers[mid] > remain){
                    right = mid - 1;
                }else{
                    left = mid + 1;
                }
            }  
        }
        return res;
    }
}

思路三： two pointer。这个方法充分利用了sorted array这个条件，很巧妙。时间复杂度为O(n)

class Solution {
    public int[] twoSum(int[] numbers, int target) {
        int[] res = new int[2];
        int low = 0;
        int high = numbers.length - 1;
        while(low < high){
            int sum = numbers[low] + numbers[high];
            if(sum == target){
                res[0] = low + 1;
                res[1] = high + 1;
                break;
            }else if(sum > target){
                high--;
            }else{
                low++;
            }
        }
        return res;
    }
}

总结：

1. Arrays.toString(array)，不止会把array里面的元素写进一个string中，它还会把array的"[]"两个括号写进string中。

2. string.contains(charSequence c)参数必须是string类型，不能是char类型。

3. charsequence VS string:

   	String = concrete implementation
   	CharSequence = interface
   	
   	CharSequence is an interface.
   	Several classes implement this interface.
   	String is one such class, a concrete implementation of CharSequence.