给定一个整数数组 nums 和一个目标值 target,请你在该数组中找出和为目标值的那 两个 整数,并返回他们的数组下标。
你可以假设每种输入只会对应一个答案。但是,数组中同一个元素不能使用两遍。
示例:
给定 nums = [2, 7, 11, 15], target = 9
因为 nums[0] + nums[1] = 2 + 7 = 9
所以返回 [0, 1]
题目参考链接:https://leetcode-cn.com/problems/two-sum
Python实现(优化:字典)
def twoSum(self, nums: List[int], target: int) -> List[int]:
n = len(nums)
dic = {}
for i in range(n):
if target - nums[i] in dic:
return [i, dic.get(target - nums[i])]
else:
dic[nums[i]] = i
return [-1]
Java实现(暴力解法)
public int[] twoSum1(int[] nums, int target) {
int n = nums.length;
int[] result = new int[2];
for (int i = 0; i < n; i++) {
for (int j = i + 1; j < n; j++) {
if (nums[i] + nums[j] == target) {
result[0] = i;
result[1] = j;
return result;
}
}
}
throw new IllegalArgumentException("No two sum solution");
}
Java实现(优化:哈希表)
public int[] twoSum2(int[] nums, int target) {
int n = nums.length;
Map<Integer, Integer> hs = new HashMap<>();
for (int i = 0; i < n; i++) {
if (hs.containsKey(target - nums[i])) {
return new int[]{i, hs.get(target - nums[i])};
}
hs.put(nums[i], i);
}
throw new IllegalArgumentException("No two sum solution");
}