[leetcode-1] Two Sum

1. 哈希表法：

【C++实现】

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

【python实现】

class Solution:
    def twoSum(self, nums: List[int], target: int) -> List[int]:
        has = {}
        for i in range(len(nums)):
            if has.get(target - nums[i]) != None:
                return [i, has[target - nums[i]]]
            has[nums[i]] = i