Sum—LeetCode-167 Two Sum II Input array is sorted
2017-05-11 18:14
447 查看
题目描述:
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 and you may not use the
same element twice.
Input: numbers={2, 7, 11, 15}, target=9
Output: index1=1, index2=2
public int[] twoSum(int[] numbers, int target) {
int res[] = new int[2];
int start = 0;
int end = numbers.length-1;
while(start < end) {
if(numbers[start] + numbers[end] < target){
++start;
} else if(numbers[start] + numbers[end] > target) {
--end;
} else {
res[0] = ++start;
res[1] = ++end;
break;
}
}
return res;
}
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 and you may not use the
same element twice.
Input: numbers={2, 7, 11, 15}, target=9
Output: index1=1, index2=2
public int[] twoSum(int[] numbers, int target) {
int res[] = new int[2];
int start = 0;
int end = numbers.length-1;
while(start < end) {
if(numbers[start] + numbers[end] < target){
++start;
} else if(numbers[start] + numbers[end] > target) {
--end;
} else {
res[0] = ++start;
res[1] = ++end;
break;
}
}
return res;
}
相关文章推荐
- LeetCode[167]Two Sum II - Input array is sorted
- leetcode 167[easy]---Two Sum II - Input array is sorted
- 【python】【leetcode】【算法题目167—Two Sum II - Input array is sorted】
- leetcode 167: Two Sum II - Input array is sorted
- leetcode 167--- Two Sum II - Input array is sorted
- leetcode note--leetcode 167 Two Sum II - Input array is sorted
- Leetcode #167 Two Sum II - Input array is sorted
- leetcode 167: Two Sum II - Input array is sorted
- Leetcode 167 Two Sum II - Input array is sorted
- leetcode解题方案--167--Two Sum II - Input array is sorted
- [C语言][LeetCode][167]Two Sum II - Input array is sorted
- LeetCode 167: Two Sum II - Input array is sorted
- leetcode_167 Two Sum II - Input array is sorted
- [LeetCode167]Two Sum II - Input array is sorted
- LeetCode[167] Two Sum II - Input array is sorted
- leetcode[167] Two Sum II - Input array is sorted
- leetcode[167]Two Sum II - Input array is sorted
- Leetcode 167 Two Sum II - Input array is sorted
- leetcode 167 Two Sum II - Input array is sorted
- LeetCode 167 Two Sum II - Input array is sorted