LeetCode #1 Two Sum

题目描述

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

C++

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

            numIdxMap[nums[i]] = i;
        }
        return {};
    }
};

执行用时	内存消耗
24 ms	10.2 MB

Python

class Solution:
    def twoSum(self, nums, target):
        dict = {}
        for i, num1 in enumerate(nums):
            num2 = target - num1
            if num2 in dict:
                return[dict[num2], i]
            dict[num1] = i
        return None

执行用时	内存消耗
56 ms	14.3 MB