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

宝宝终于第一次自己写出并且一次通过辣！！虽然这道题和以前的类似。

class Solution {    public int[] twoSum(int[] numbers, int target) {if(numbers==null)return new int[]{0,0};int[] res = new int[2];        HashMap<Integer,Integer> map = new HashMap<>();        for(int i=0;i<numbers.length;i++){        if(map.get(target-numbers[i])!=null){        res[0] = map.get(target-numbers[i]);        res[1] = i+1;        break;        }        map.put(numbers[i],i+1);        if(numbers[i]>target)        return new int[]{0,0};        }        return res;    }}