# 167. Two Sum II - Input array is sorted

## 刷题内容

• https://leetcode.com/problems/two-sum-ii-input-array-is-sorted

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:

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.


## 解题方案

/**
* @param {number[]} numbers
* @param {number} target
* @return {number[]}
*/
var twoSum = function(nums, target) {
var number=[];
var left = 0;
var right = nums.length - 1 ;
while(left < right ) {
if(nums[left] + nums[right] === target) {
return [left+1, right+1]
} else if(nums[left] + nums[right] > target ) {
right--;
} else {
left++;
}
}
};