Two Sum

最新推荐文章于 2022-12-17 04:12:13 发布

原创最新推荐文章于 2022-12-17 04:12:13 发布 · 476 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#java

小程序练习专栏收录该内容

1 篇文章

订阅专栏

本文介绍了一种经典的算法问题——寻找数组中两个数相加等于特定目标值的索引。提供了两种Java实现方法，利用哈希表进行高效查找，避免了传统双重循环的低效。适用于初学者理解哈希表的应用。

Given an array of integers, return indices of the two numbers such that they add up to a specific target.

You may assume that each input would have exactly one solution, and you may not use the same element twice.

Example:

Given nums = [2, 7, 11, 15], target = 9,

Because nums[0] + nums[1] = 2 + 7 = 9,
return [0, 1].

解法1：
public int[] twoSum(int[] nums, int target) {
    Map<Integer, Integer> map = new HashMap<>();
    for (int i = 0; i < nums.length; i++) {
        map.put(nums[i], i);
    }
    for (int i = 0; i < nums.length; i++) {
        int complement = target - nums[i];
        if (map.containsKey(complement) && map.get(complement) != i) {
            return new int[] { i, map.get(complement) };
        }
    }
    throw new IllegalArgumentException("No two sum solution");
}
解法2：
public int[] twoSum(int[] nums, int target) {
    Map<Integer, Integer> map = new HashMap<>();
    for (int i = 0; i < nums.length; i++) {
        int complement = target - nums[i];
        if (map.containsKey(complement)) {
            return new int[] { map.get(complement), i };
        }
        map.put(nums[i], i);
    }
    throw new IllegalArgumentException("No two sum solution");
}