No695.java

packageAlgorithm.leetcode.Array;

/**
 * 
 * Created by tujietg on Nov 6, 2019
 */
publicclassNo695 {
publicint[] twoSum(int[] numbers, inttarget) {
int[] end = newint[2];
if (numbers.length < 2) {
returnend;
 }
intleft = 0;
intright = numbers.length - 1;
while (left < right) {
intnum = numbers[left] + numbers[right];
if (num == target) {
end[0] = left + 1;
end[1] = right + 1;
returnend;
 } elseif (num > target) {
right--;
 } else {
left++;
 }
 }
returnend;
 }
}