167.Two Sum ii-input Array is sorted

     /** 167.Two Sum ii-input array is sorted * 2016-6-4 by Mingyang * Given An array of integers the is ALR      Eady sorted in ascending order, * Find-numbers such that they add-to-a specific target number. *the function Twosum should return indices of the numbers such that they add up to the target, *where index1 mus       T is less than INDEX2.      *please Note that your returned answers (both Index1 and INDEX2) is not zero-based. */       Public int[] Twosum (int[] numbers,inttarget) {              if(numbers==NULL|| Numbers.length < 1)return NULL; intI=0, J=numbers.length-1;  while(i<j) {intx = Numbers[i] +Numbers[j]; if(x<target) {                      ++i; } Else if(x>target) {                      --J; } Else {                      return New int[]{i+1, J+1}; }              }              return NULL; }  

167.Two Sum ii-input array is sorted