这里是用来记录大家每天各自讲题的代码的。请用"n</题目号码>_</题目名字>_by_</讲题人名字>"的格式来命名。
Number | Name | Host | Date | Genre |
---|---|---|---|---|
200 | Number of Islands | Jun | 01/10/22 | BFS |
752 | Open the Lock | Jun | 01/11/22 | BFS |
490 | The Maze I | Jun | 01/12/22 | BFS |
499 | The Maze II | Jun | 01/12/22 | BFS |
505 | The Maze III | Jun | 01/12/22 | BFS |
1685 | The Maze IV | Jun | 01/12/22 | BFS |
127 | Word Ladder | Jun | 01/13/22 | BFS |
545 | Boundary of Binary Tree | Bingjun | 01/10/22 | Tree |
112 | Path Sum | Bingjun | 01/11/22 | Tree |
113 | Path Sum II | Bingjun | 01/11/22 | Tree |
437 | Path Sum III | Bingjun | 01/11/22 | Tree |
1026 | Maximum Difference Between Node and Ancestor | Bingjun | 01/12/22 | Tree |
114 | Flatten Binary Tree to Linked List | Bingjun | 01/13/22 | Tree |
426 | Convert Binary Search Tree to Sorted Doubly Linked List | Bingjun | 01/20/22 | Tree |
72 | Edit Distance | Anonymous | 01/13/22 | Dynamic Programming |
233 | Number of Digit One | Anonymous | 01/13/22 | Dynamic Programming |
Unknown | The tower of Hanoi | Anonymous | 01/13/22 | Dynamic Programming |
456 | 132 Pattern | Jun | 01/20/22 | Monotonic Stack |
- 200
- 752
- 490
- 499
- 505
- 1685
- 127
- 545
- 112
- 113
- 437
- 1026
- Edit Distance
- Number of Digit One
- The tower of Hanoi
- 456