8000 更新目录 · DontFearAlgorithms/LeetCode-Go@18d02ad · GitHub
[go: up one dir, main page]
Skip to content

Commit 18d02ad

Browse files
halfrosthalfrost
committed
更新目录
1 parent a74d2d0 commit 18d02ad

File tree

1 file changed

+22
-4
lines changed

‎README.md

Lines changed: 22 additions & 4 deletions
Original file line numberDiff line numberDiff line change
@@ -33,6 +33,7 @@
3333
* [Stack](#stack-已全部做完)
3434
* [Tree](#tree)
3535
* [Dynamic programming](#dynamic-programming)
36+
* [Backtracking](#backtracking-已全部做完)
3637
* [Depth-first search](#depth-first-search)
3738
* [Breadth-first Search](#breadth-first-search)
3839
* [Binary Search](#binary-search)
@@ -1286,6 +1287,8 @@
12861287

12871288
## Two Pointers (已全部做完)
12881289

1290+
![](./Topics/Two_pointers.png)
1291+
12891292
| Title | Solution | Difficulty | Time | Space |收藏|
12901293
| ----- | :--------: | :----------: | :----: | :-----: | :-----: |
12911294
|[3. Longest Substring Without Repeating Characters](https://leetcode.com/problems/longest-substring-without-repeating-characters)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0003.%20Longest%20Substring%20Without%20Repeating%20Characters)| Medium | O(n)| O(1)||
@@ -1336,15 +1339,15 @@
13361339
|[986. Interval List Intersections](https://leetcode.com/problems/interval-list-intersections)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0986.%20Interval%20List%20Intersections)| Medium | O(n)| O(1)||
13371340
|[992. Subarrays with K Different Integers](https://leetcode.com/problems/subarrays-with-k-different-integers)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0992.%20Subarrays%20with%20K%20Different%20Integers)| Hard | O(n)| O(n)
13381341
|[1004. Max Consecutive Ones III](https://leetcode.com/problems/max-consecutive-ones-iii)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/1004.%20Max%20Consecutive%20Ones%20III)| Medium | O(n)| O(1)
1339-
1340-
1341-
1342-
1342+
|[1093. Statistics from a Large Sample](https://leetcode.com/problems/statistics-from-a-large-sample)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/1093.%20Statistics%20from%20a%20Large%20Sample)| Medium | O(n)| O(1)
13431343
|-----------------------------------------------------------------|-------------|-------------| --------------------------| --------------------------|-------------|
13441344

13451345

13461346
## Linked List (已全部做完)
13471347

1348+
![](./Topics/Linked_List.png)
1349+
1350+
13481351
- 巧妙的构造虚拟头结点。可以使遍历处理逻辑更加统一。
13491352
- 灵活使用递归。构造递归条件，使用递归可以巧妙的解题。不过需要注意有些题目不能使用递归，因为递归深度太深会导致超时和栈溢出。
13501353
- 链表区间逆序。第 92 题。
@@ -1393,6 +1396,9 @@
13931396

13941397
## Stack (已全部做完)
13951398

1399+
![](./Topics/Stack.png)
1400+
1401+
13961402
| Title | Solution | Difficulty | Time | Space |收藏|
13971403
| ----- | :--------: | :----------: | :----: | :-----: | :-----: |
13981404
|[20. Valid Parentheses](https://leetcode.com/problems/valid-parentheses)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0020.%20Valid-Parentheses)| Easy | O(log n)| O(1)||
@@ -1513,7 +1519,17 @@
15131519
|-----------------------------------------------------------------|-------------|-------------| --------------------------| --------------------------|-------------|
15141520

15151521

1522+
## Backtracking (已全部做完)
15161523

1524+
![](./Topics/Backtracking.png)
1525+
1526+
1527+
| Title | Solution | Difficulty | Time | Space |收藏|
1528+
| ----- | :--------: | :----------: | :----: | :-----: | :-----: |
1529+
1530+
1531+
1532+
|-----------------------------------------------------------------|-------------|-------------| --------------------------| --------------------------|-------------|
15171533

15181534

15191535
## Depth-first Search
@@ -1679,6 +1695,8 @@
16791695

16801696
## Sort (已全部做完)
16811697

1698+
![](./Topics/Sort.png)
1699+
16821700
- 深刻的理解多路快排。第 75 题。
16831701
- 链表的排序，插入排序(第 147 题)和归并排序(第 148 题)
16841702
- 桶排序和基数排序。第 164 题。

0 commit comments

Comments
 (0)
0