[LeetCode] Two Sum

最新推荐文章于 2024-09-14 15:41:03 发布

xiaoli727

最新推荐文章于 2024-09-14 15:41:03 发布

阅读量48

点赞数 1

分类专栏： LeetCode 文章标签： c++ hashmap

本文链接：https://blog.csdn.net/sinat_24796205/article/details/119386979

版权

LeetCode 专栏收录该内容

20 篇文章 0 订阅

订阅专栏

Description

Two Sum: Given an array of integers nums and an integer target, return indices of the two numbers such that they add up to target.

Example:

Input: nums = [2,7,11,15], target = 9
Output: [0,1]
Output: Because nums[0] + nums[1] == 9, we return [0, 1].

Solution

if z = x + y, we can get y = z - x.

So, the basic idea is to use a Hash Table to maintain each element and its index (0-indexed). For each element, we search if it is already in the hash table. If NO, we add target - num as a key and its index as a value into the hash map. Otherwise, we get the answer, because the index of target - num is already stored in the hash.

Code

class Solution {
public:
    vector<int> twoSum(vector<int>& nums, int target) {
        unordered_map<int, int> cache;
        for(int i = 0; i < nums.size(); i++) {
            if(cache.find(nums[i]) != cache.end()) 
                return {cache[nums[i]], i};
            cache[target - nums[i]] = i;
        }
        return {-1, -1};
    }
};