forked from terrytong0876/LintCode-1
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy path2 Sum II - Input array is sorted.java
More file actions
executable file
·57 lines (45 loc) · 1.5 KB
/
Copy path2 Sum II - Input array is sorted.java
File metadata and controls
executable file
·57 lines (45 loc) · 1.5 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
M
排序好的array. Binary Search移动start和end，核查sum。
```
/*
Given an array of integers that is already sorted in ascending order,
find two numbers such that they add up to a specific target number.
The function twoSum should return indices of the two numbers such that they add up to the target,
where index1 must be less than index2.
Please note that your returned answers (both index1 and index2) are not zero-based.
You may assume that each input would have exactly one solution.
Input: numbers={2, 7, 11, 15}, target=9
Output: index1=1, index2=2
Tags: Array Two Pointers, Binary Search
Similar Problems: (M) Two Sum
*/
/*
Thoughts:
Do a binary search, but do not over-complicate it:
Start, end. Check if nums[start] + nums[end] == target.
binary move it: in fact, moving the two border, 1 position at a time
*/
public class Solution {
public int[] twoSum(int[] nums, int target) {
int[] rst = new int[2];
if (nums == null || nums.length <= 1) {
return rst;
}
int start = 0;
int end = nums.length - 1;
while(start < end) {
long sum = (long)(nums[start] + nums[end]);
if (target == sum) {
rst[0] = start + 1;
rst[1] = end + 1;
break;
} else if (target > sum) {
start++;
} else {
end--;
}
}//END while
return rst;
}
}
```