1.Two Sum

最新推荐文章于 2025-08-20 09:37:41 发布

转载最新推荐文章于 2025-08-20 09:37:41 发布 · 433 阅读

文章标签：

#leetcode #two-sum #java面试 #java面试题目 #两数之和

LeetCode 专栏收录该内容

20 篇文章

订阅专栏

本文介绍了一种高效求解数组中两数之和等于特定目标值的问题的方法。利用HashMap来辅助查找，避免了双重循环的低效，显著提高了算法性能。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

题目：
Given an array of integers, find two numbers such that they add up to a specific target number.

The function twoSum should return indices of the two numbers such that they add up to the target, where index1 must be less than index2. Please note that your returned answers (both index1 and index2) are not zero-based.

You may assume that each input would have exactly one solution.

Input: numbers={2, 7, 11, 15}, target=9
Output: index1=1, index2=2

个人理解：找出和等于目标整数的两个数的位置，位置不是从0开始（那就是从1开始咯）。双重for循环效率很低，所以使用HashMap辅助解决快很多。

public class Solution {
    public int[] twoSum(int[] numbers, int target) {
    HashMap<Integer, Integer> map = new HashMap<Integer, Integer>();
    int[] result = new int[2];

    for (int i = 0; i < numbers.length; i++) {
        if (map.containsKey(numbers[i])) {
            int index = map.get(numbers[i]);
            result[0] = index+1 ;
            result[1] = i+1;
            break;
        } else {
            map.put(target - numbers[i], i);
        }
    }

    return result;
    }
}