├── README.md
└── python
    └── 1_twosums.py


/README.md:
--------------------------------------------------------------------------------
1 | 本项目包含leetcode的题解及解析，不定期更新。
2 | 


--------------------------------------------------------------------------------
/python/1_twosums.py:
--------------------------------------------------------------------------------
 1 | from typing import List
 2 | #方法一：暴力枚举
 3 | class Soultion:
 4 |     def twoSum(self,nums:List[int],target:int)->List[int]:
 5 |         n=len(nums)
 6 |         for i in range(n):
 7 |             for j in range(i+1,n):
 8 |                 if nums[i]+nums[j]==target:
 9 |                     retrun [i,j]
10 |         return[]
11 | ##方法二：哈希表
12 | class Solution:
13 |     def twoSum(self, nums: List[int], target: int) -> List[int]:
14 |         hashtable = dict()
15 |         for i, num in enumerate(nums):
16 |             if target - num in hashtable:
17 |                 return [hashtable[target - num], i]
18 |             hashtable[nums[i]] = i
19 |         return []


--------------------------------------------------------------------------------