Commit c2a2a53

committed

feat: update solutions to lc problems

* No.0001.Two Sum * No.0085.Maximal Rectangle * No.0310.Minimum Height Trees

1 parent fa95b24 commit c2a2a53Copy full SHA for c2a2a53

File tree

-20

lines changed

-20

lines changed

Lines changed: 1 addition & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -57,7 +57,7 @@`
`57`	`57`
`58`	`58`	`方法一:哈希表`
`59`	`59`
`60`		`-我们可以用哈希表(字典) $d$ 存放数组值以及对应的下标。`
	`60`	`+我们可以用哈希表(字典) $m$ 存放数组值以及对应的下标。`
`61`	`61`
`62`	`62`	遍历数组 `nums`,当发现 `target - nums[i]` 在哈希表中,说明找到了目标值,返回 `target - nums[i]` 的下标和 `i` 即可。
`63`	`63`

Lines changed: 1 addition & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -65,7 +65,7 @@`
`65`	`65`
`66`	`66`	`把每一行视为柱状图的底部,对每一行求柱状图的最大面积即可。`
`67`	`67`
`68`		`-时间复杂度 $O(mn),ドル其中 $m$ 表示 $matrix$ 的行数,$n$ 表示 $matrix$ 的列数。`
	`68`	`+时间复杂度 $O(m \times n),ドル其中 $m$ 表示 $matrix$ 的行数,$n$ 表示 $matrix$ 的列数。`
`69`	`69`
`70`	`70`	`<!-- tabs:start -->`
`71`	`71`

Lines changed: 2 additions & 6 deletions

Original file line number	Diff line number	Diff line change
`@@ -73,15 +73,11 @@ class Solution:`
`73`	`73`	`g[b].append(a)`
`74`	`74`	`degree[a] += 1`
`75`	`75`	`degree[b] += 1`
`76`		`- q = deque()`
`77`		`- for i in range(n):`
`78`		`- if degree[i] == 1:`
`79`		`- q.append(i)`
	`76`	`+ q = deque(i for i in range(n) if degree[i] == 1)`
`80`	`77`	`ans = []`
`81`	`78`	`while q:`
`82`		`- n = len(q)`
`83`	`79`	`ans.clear()`
`84`		`- for _ in range(n):`
	`80`	`+ for _ in range(len(q)):`
`85`	`81`	`a = q.popleft()`
`86`	`82`	`ans.append(a)`
`87`	`83`	`for b in g[a]:`

Lines changed: 2 additions & 6 deletions

Original file line number	Diff line number	Diff line change
`@@ -58,15 +58,11 @@ class Solution:`
`58`	`58`	`g[b].append(a)`
`59`	`59`	`degree[a] += 1`
`60`	`60`	`degree[b] += 1`
`61`		`- q = deque()`
`62`		`- for i in range(n):`
`63`		`- if degree[i] == 1:`
`64`		`- q.append(i)`
	`61`	`+ q = deque(i for i in range(n) if degree[i] == 1)`
`65`	`62`	`ans = []`
`66`	`63`	`while q:`
`67`		`- n = len(q)`
`68`	`64`	`ans.clear()`
`69`		`- for _ in range(n):`
	`65`	`+ for _ in range(len(q)):`
`70`	`66`	`a = q.popleft()`
`71`	`67`	`ans.append(a)`
`72`	`68`	`for b in g[a]:`

Lines changed: 2 additions & 6 deletions

Original file line number	Diff line number	Diff line change
`@@ -9,15 +9,11 @@ def findMinHeightTrees(self, n: int, edges: List[List[int]]) -> List[int]:`
`9`	`9`	`g[b].append(a)`
`10`	`10`	`degree[a] += 1`
`11`	`11`	`degree[b] += 1`
`12`		`- q = deque()`
`13`		`- for i in range(n):`
`14`		`- if degree[i] == 1:`
`15`		`- q.append(i)`
	`12`	`+ q = deque(i for i in range(n) if degree[i] == 1)`
`16`	`13`	`ans = []`
`17`	`14`	`while q:`
`18`		`- n = len(q)`
`19`	`15`	`ans.clear()`
`20`		`- for _ in range(n):`
	`16`	`+ for _ in range(len(q)):`
`21`	`17`	`a = q.popleft()`
`22`	`18`	`ans.append(a)`
`23`	`19`	`for b in g[a]:`

Comments

(0)