论坛元老
- 威望
- 2504
- 贡献
- 2519
- 热心值
- 0
- 金币
- 1180
- 注册时间
- 2021-3-27
|
public int[] twoSum(int[] nums, int target) {
Map<Integer, Integer> hashtable = new HashMap<Integer, Integer>();
for (int i = 0; i < nums.length; ++i) {
if (hashtable.containsKey(target - nums[i])) {
return new int[]{hashtable.get(target - nums[i]), i};
}
hashtable.put(nums[i], i);
}
return new int[0];
} |
|
楼主: zerg
发表于 2021-8-9 18:32
