【LeetCode力扣】python两数之和完整代码-暴力枚举法、哈希表法

# 暴力枚举法
nums = [11, 2, 7, 15]
target = 9
result = [0,0]
for i in range(len(nums)):
  for j in range(i+1,len(nums)):
    sum = nums[i] + nums[j]
    if sum == target:
      result[0] = i
      result[1] = j
      break
result

# 哈希表
nums = [11, 2, 7, 15]
target = 9
result = [0,0]
class HashTable(object):
  def __init__(self):
    self.items = []
  def add(self,k,v):
    self.items.append((k,v))
  
  def get(self,k):
    for key, index in self.items:
      if key == k:
        return index
  def contains_key(self,judge):
    judging = False
    for key, index in self.items:
      if key == judge:
        judging = True
        return judging
    

map = HashTable()
for i in range(len(nums)):
  map.add(nums[i],i)
for j in range(len(nums)):
  dff = target - nums[j]
  if(map.contains_key(dff) and map.get(dff)!= j):
    result[0] = j
    result[1] = map.get(dff)
result