Commit 2acbaeb

committed

🐱(hash): 1. 两数之和

1. 补充暴力解法 2. 复盘

1 parent f892af4 commit 2acbaebCopy full SHA for 2acbaeb

File tree

+29

-9

lines changed

+29

-9

lines changed

Lines changed: 29 additions & 9 deletions

Original file line number	Diff line number	Diff line change
`@@ -2,7 +2,22 @@`
`2`	`2`
`3`	`3`	`[原题链接](https://leetcode-cn.com/problems/two-sum/submissions/)`
`4`	`4`
`5`		`-### 解法一`
	`5`	`+### 解法一:暴力`
	`6`	`+`
	`7`	+```python
	`8`	`+class Solution:`
	`9`	`+ def twoSum(self, nums: List[int], target: int) -> List[int]:`
	`10`	`+ length = len(nums)`
	`11`	`+ for i in range(length):`
	`12`	`+ for j in range(i + 1, length):`
	`13`	`+ if nums[i] + nums[j] == target:`
	`14`	`+ return [i, j]`
	`15`	+```
	`16`	`+`
	`17`	`+- 时间复杂度:$O(n^2)$`
	`18`	`+- 空间复杂度:$O(1)$`
	`19`	`+`
	`20`	`+### 解法二:一遍哈希`
`6`	`21`
`7`	`22`	`利用哈希表,时间复杂度 O(n),空间复杂度 O(n)。`
`8`	`23`
`@@ -34,15 +49,20 @@ class Solution(object):`
`34`	`49`	`return res_list`
`35`	`50`	```
`36`	`51`
`37`		`-### 解法二`
`38`		`-`
`39`		`-时间复杂度 O(nlogn),空间复杂度 O(1)。`
`40`		`-`
`41`		`-- 排序`
`42`		`-- 二分查找`
`43`		`-`
`44`		`-`
	`52`	`+2020年06月02日复盘:`
`45`	`53`
	`54`	+```python
	`55`	`+class Solution:`
	`56`	`+ def twoSum(self, nums: List[int], target: int) -> List[int]:`
	`57`	`+ table = dict()`
	`58`	`+ for i in range(len(nums)):`
	`59`	`+ n = nums[i]`
	`60`	`+ tmp = target - n`
	`61`	`+ if tmp in table:`
	`62`	`+ return [i, table[tmp]]`
	`63`	`+ else:`
	`64`	`+ table[n] = i`
	`65`	+```
`46`	`66`
`47`	`67`	`## 128. 最长连续序列`
`48`	`68`

Comments

(0)