167. 两数之和 II - 输入有序数组

  1. class Solution {
  2.     public int[] twoSum(int[] numbers, int target) {
  3.         int[] ans = new int[2];
  4.         if (numbers == null || numbers.length <= 1)
  5.             return ans;
  7.         int left = 0, right = numbers.length - 1;
  8.         while (left <= right) {
  9.             if (numbers[left] + numbers[right] == target) {
  10.                 ans[0] = left + 1;
  11.                 ans[1] = right + 1;
  12.                 break;
  13.             } else if (numbers[left] + numbers[right] < target) {
  14.                 ++left;
  15.             } else {
  16.                 --right;
  17.             }
  18.         }
  19.         return ans;
  20.     }
  21. }