Leetcode_Array --1. Two Sum [easy]

Given an array of integers, return indices of the two numbers such that they add up to a specific target.
给定一个整数数组，和一个特定的target数字，返回数组中两个数的索引，这两个数相加正好等于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].

Solution:

Python

class Solution:
    def twoSum(self, nums, target):
        """
        :type nums: List[int]
        :type target: int
        :rtype: List[int]
        """
        hashtable = {}   #hashtable中的kye是target与元素的差值，value是该元素的index
        for i in range(len(nums)):   #遍历数组
            left = target - nums[i]
            if nums[i] in hashtable:   #如果元素是某元素的差值，则返回差值的index和该元素的index，否则就将差值和元素index变成键值对存储
                return [hashtable[nums[i]],i]
            else:
                hashtable[left] = i

C++
class Solution {
public:
    vector<int> twoSum(vector<int>& nums, int target) {
        unordered_map<int,int> Map;
        for(int i = 0;i<nums.size();i++){
            int left = target - nums[i];
            if (Map.count(nums[i]) != 0){
                return {Map[nums[i]],i};
            }
            else{
                Map[left] = i;
            }
        }
    }
};