Leetcode Two Sum II – Input array is sorted (Java)

最新推荐文章于 2021-03-13 00:29:10 发布

伊萨卡钢琴家

最新推荐文章于 2021-03-13 00:29:10 发布

阅读量339

点赞数

分类专栏： Leetcode array

本文链接：https://blog.csdn.net/Hanwenwangad/article/details/50599726

版权

Leetcode 同时被 2 个专栏收录

104 篇文章 0 订阅

订阅专栏

array

29 篇文章 0 订阅

订阅专栏

When the array is sorted, when we want to do the sum to the target. we can scan from both sides.

public int[] twoSum(int[] numbers, int target) {
	if (numbers == null || numbers.length == 0)
		return null;

	int i = 0;
	int j = numbers.length - 1;

	while (i < j) {
		int x = numbers[i] + numbers[j];
		if (x < target) {
			++i;
		} else if (x > target) {
			j--;
		} else {
			return new int[] { i + 1, j + 1 };
		}
	}

	return null;
}