leetcode167两数之和II-输入有序数组(JAVA版)

给定一个已按照升序排列 的有序数组，找到两个数使得它们相加之和等于目标数。

函数应该返回这两个下标值 index1 和 index2，其中 index1 必须小于 index2。

暴力循环法解题

class Solution {
    public int[] twoSum(int[] numbers, int target) {
       	int[] result = {0,0};
		if (numbers[0] + numbers[1] == target) {
			result[0] = 1;
			result[1] = 2;
			return result;
		}
    	int num = numbers.length;
    	for (int i = 0; i < numbers.length; i++) {
			if(target < numbers[i]) {
				num = i;
				break;
			}
		}
    	for (int i = 0; i < num; i++) {
			for (int j = i+1; j < num; j++) {
				if (numbers[i] + numbers[j] == target) {
					result[0] = i+1;
					result[1] = j+1;
					return result;
				}
			}
		}
    	return result;
    }
}

双指针的解法更为优秀

class Solution {
    public int[] twoSum(int[] numbers, int target) {
		int left = 0;
		int right = numbers.length-1;
		int sum = numbers[left] + numbers[right];
		while (left <= right) {
			if (sum > target) right--;
			if(sum < target) left++;	
			if (sum == target) return new int[]{left + 1, right + 1};
			sum = numbers[left] + numbers[right];
		}
		return null;
    }
}