Leetcode之Two Sum 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. 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 thesame element twice.

示例：

Input: numbers={2, 7, 11, 15}, target=9
Output: index1=1, index2=2

问题来源：Two Sum II - Input array is sorted (详细地址：https://leetcode.com/problems/two-sum-ii-input-array-is-sorted/description/)

思路分析：这道题是由Two Sum 演变过来的，这道题假设了数组中的元素是按照顺序排好序的，所以我们自然而然就应该想到二分查找，记得结果都加上1才对，其他的我在这就不多说了，详见代码。

代码：