【python】leetcode 1. 两数之和

# 法一：暴力枚举
class Solution:
    def twoSum(self, nums: List[int], target: int) -> List[int]:
        n = len(nums)
        for i in range(n):
            for j in range(i + 1, n):
                if nums[i] + nums[j] == target:
                    return [i, j]
        
        return []

# 法二：哈希表
class Solution:
    def twoSum(self, nums: List[int], target: int) -> List[int]:
        hashtable = dict()
        for i, num in enumerate(nums):   # enumerate(X,start)讲解在下面
            if target - num in hashtable:
                return [hashtable[target - num], i]
            hashtable[nums[i]] = i  #将遍历过的nums中的值和对应的索引存入哈希
        return []