[LeetCode]第二十八题 ：两数之和II - 输入排序数组

题目描述：

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.

Note:

• 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.

Example:

Input: numbers = [2,7,11,15], target = 9
Output: [1,2]
Explanation: The sum of 2 and 7 is 9. Therefore index1 = 1, index2 = 2.

题目解释：

给出一组已经排好序的数组，找出两个数相加等于特定数字的下标。

这个数组返回的下标1必须要小于下标2

注意：

1.你返回的结果必须不等于0.

2.你可以假设每个数组都有一个解并且同一元素不能使用两次。

题目解法：

1.我的解法。这个和之前的题没什么区别，代码就不重复放了，没意义。要注意的就是下标1必须小于下标2，所以之前解法中使用HashMap的方法在此就不适用了，但是循环遍历的方法完全满足这个要求。