LeetCode 1. 兩數之和
題目連接:https://leetcode-cn.com/problems/two-sum/
Java解法:
public int[] twoSum(int[] nums, int target) {
Map<Integer, Integer> used = new HashMap<>();
for (int i = 0; i < nums.length; i++) {
int com = target - nums[i];
if (used.containsKey(com) && used.get(com) != i) {
return new int[]{used.get(com), i};
}
used.put(nums[i], i);
}
return new int[0];
}

不在代碼中爆發,就在代碼滅亡!
========================================================================

浙公網安備 33010602011771號