[LeetCode][1091. Shortest Path in Binary Matrix] Why Use BFS? Search Every Possible Path vs Search A Possible Path

太棒了! 目前共计 283 篇日志。 继续努力。

2022

05-16

[LeetCode][1091. Shortest Path in Binary Matrix] Why Use BFS? Search Every Possible Path vs Search A Possible Path

05-13

[LeetCode][117. Populating Next Right Pointers in Each Node II] 3 Approaches: BFS, BFS + LinkedList, Recursion

05-10

[LeetCode][216. Combination Sum III] 2 Approaches: Backtracking and Bit Mask

05-09

[LeetCode][17. Letter Combinations of a Phone Number] 4 Approaches: BF 4 Loops, Backtracking, BFS, Queue with Image Explaination

05-08

[LeetCode][341. Flatten Nested List Iterator] 2 Approaches: DFS, Iteration(Using Stack)

05-07

[LeetCode][456. 132 Pattern] 6 Approaches: BF O(n^3), BF O(n^2), TreeMap, Monotonic Stack