1:大整数加法:
public int[] twoSum(int[] nums, int target) {
Map<Integer,Integer> map = new HashMap<>();
int[] result = new int[2];
for (int i = 0; i < nums.length; i++) {
if(map.containsKey(target - nums[i])){ //需要看有没有在map中。
result[0] = i;
result[1] = map.get(target - nums[i]);
break;
}else{
map.put(nums[i],i);
}
}
return result;
}