Leetcode:167. Two Sum II - Input array is sorted 求数组中的两个数的和等于给定值,求这两个数的下标
2017-11-11 15:06
531 查看
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
解析:这个题啊 那是非常的简单,题目已经给出了已经排序的条件,所以我们直接类似二分搜索即可,但是我在拿到题的时候,就两个循环在那遍历求解,可以说这是非常不合理的解决方案,并且这个题非常的简单,因为,返回的数组就两个数字,不像可能有多个值的情况。
代码如下:
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 static int[] twoSum(int[] numbers, int target) { int[] rev = new int[2]; int lo=0, hi=numbers.length-1; while (numbers[lo]+numbers[hi]!=target){ if (numbers[lo]+numbers[hi]<target){ lo++; } else { hi--; } } rev[0] = 1+lo; rev[1] = 1+hi; return rev; }
相关文章推荐
- 167. Two Sum II - Input array is sorted (在有序数组中确定和为给定值的两个元素的下标)
- LeetCode 167. Two Sum II - Input array is sorted,有序数组中的两个元素之和为某个数值,输出这两个元素的索引,且index1<index2
- 【leetcode】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(输入两数和 II - 输出排序数组这两数位置)
- 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-Easy部分中标签为 Binary Search 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
- 【leetcode】167. Two Sum II - Input array is sorted【M】【100%】
- 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