/*****************************************************问题描述*************************************************
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开始    
/*****************************************************我的解答*************************************************
/**
 * @param {number[]} numbers
 * @param {number} target
 * @return {number[]}
 */
var twoSum = function(numbers, target) {
    for(var index1 = 0; index1 < numbers.length - 1; index1++)
    {
        for(var index2 = index1 + 1; index2 < numbers.length; index2++)
        {
            if(numbers[index1] + numbers[index2] == target)
            {
                var retArray = [];
                retArray.push(index1 + 1);
                retArray.push(index2 + 1);
                return retArray;
            }
        }
    }
};