Leetcode 第一题 Two Sum java代码

import java.util.*;
public  class Solution1 {
        public static int[] twoSum(int[] numbers, int target) {
        // IMPORTANT: Please reset any member data you declared, as
        // the same Solution instance will be reused for each test case.
        int len = numbers.length;
   int[] index = new int[2];


HashMap<Integer, Integer> map = new HashMap<Integer, Integer>();


for (int i = 0; i < len; i++) {
if (!map.containsKey(numbers[i])) {
map.put(target - numbers[i], i);
} else {
index[0] = map.get(numbers[i]) + 1;
index[1] = i + 1;
}
}


return index;
}
public static void main(String[]args)
{
int[] a={2,3,5,7,9,10,};
int target=13;
int[] b=new int[2];
b=twoSum(a,target);
for (int i = 0;i < 2; i++)

System.out.println(b[i]);
}
}