LeetCode哈希表两数之和

最新推荐文章于 2023-12-01 12:00:00 发布

江南路漫

最新推荐文章于 2023-12-01 12:00:00 发布

阅读量165

点赞数

分类专栏： LeetCode

本文链接：https://blog.csdn.net/ucler/article/details/119300599

版权

LeetCode 专栏收录该内容

34 篇文章 0 订阅

订阅专栏

Given an array of integers nums and an integer target, return indices of the two numbers such that they add up to target.
You may assume that each input would have exactly one solution, and you may not use the same element twice.
You can return the answer in any order.

思路
O(n^2)的时间复杂度就嫑说了…
这道题用哈希表能将时间复杂度降低到O(n)。
顺便了解一下return {}的用法，在返回时自动根据函数返回类型初始化数据，C++11的新特性哦~

代码

class Solution {
public:
    vector<int> twoSum(vector<int>& nums, int target) {
        int len = nums.size();
        unordered_map<int, int> hash_map;
        for(int i = 0; i < len; i++)
        hash_map[nums[i]] = i;

        for(int i = 0; i < len-1; i++)
        {
            auto it = hash_map.find(target - nums[i]);
            if(it != hash_map.end() && i != it -> second)
            return {i, it -> second};
        }
        return {};
    }
};