import java.util.*;
public class Solution {
public int[] twoSum(int[] nums, int target) {
Integer left,right;
int[] result=new int[2];
Map<Integer,Integer> myMap=new HashMap<Integer,Integer>();
for(int i=0;i<nums.length;i++){
right=i;
left=myMap.get(target-nums[i]);
if(left!=null){
result[0]=left;
result[1]=right;
break;
}
else
myMap.put(nums[right], right);
}
return result;
}
}
时间复杂度O(n),beat56%