leetcode解题方案--167--Two Sum II - Input array is sorted
2018-01-01 00:33
513 查看
题目
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
分析
双指针法class Solution { public static int[] twoSum(int[] numbers, int target) { int low = 0; int high = numbers.length-1; while (low<high) { int sum = numbers[low]+numbers[high]; if (sum > target) { high--; } else if (sum< target) { low++; } else { return new int[]{low+1, high+1}; } } return null; } }
相关文章推荐
- 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
- leetcode167: 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 note--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 (固定和的元素的索引 II)
- 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
- Sum—LeetCode-167 Two Sum II Input array is sorted
- LeetCode 167 Two Sum II - Input array is sorted