leetcode（1）Two Sum

最新推荐文章于 2020-12-07 23:02:05 发布

李困困

最新推荐文章于 2020-12-07 23:02:05 发布

阅读量274

点赞数

分类专栏： C++

本文链接：https://blog.csdn.net/zhili8866/article/details/65638393

版权

C++ 专栏收录该内容

2 篇文章 0 订阅

订阅专栏

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].

题意：给定一个整数数组和一个target，返回和等于target的数组中的位置

解题思路：采用hash结构，通过值索引到下标。

AC代码：

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

    }
};