[leetcode]Two Sum

最新推荐文章于 2025-08-22 19:21:44 发布

原创最新推荐文章于 2025-08-22 19:21:44 发布 · 695 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#leetcode #算法

算法专栏收录该内容

146 篇文章

订阅专栏

本文探讨了在整数数组中寻找两个数使它们相加等于特定目标值的问题。介绍了两种解决方案：暴力破解法（时间复杂度O(n²)，空间复杂度O(1)）和哈希表法（时间复杂度O(n)，空间复杂度O(n)）。通过示例展示了如何使用哈希表优化查找过程。

摘要生成于 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

基本思路：

O(n²) runtime, O(1) space – Brute force:

The brute force approach is simple. Loop through each element x and find if there is another value that equals to target – x. As finding another value requires looping through the rest of array, its runtime complexity is O(n²).

O(n) runtime, O(n) space – Hash table:

We could reduce the runtime complexity of looking up a value to O(1) using a hash map that maps a value to its index.

代码：

vector<int> twoSum(vector<int> &numbers, int target) {
        
        //consider the same num;
        vector<int> result; 
        map<int,int> num_pos;
        map<int,int>::iterator iter;
        for(int i = 0; i < numbers.size(); i++){
            int diff = target - numbers[i];
            iter = num_pos.find(diff);
            if(iter != num_pos.end()){
                result.push_back(iter->second);
                result.push_back(i+1);
                break;
            }
            num_pos.insert(make_pair(numbers[i],i+1));
        }
        return result;
        
    }