LeetCode 的 Go 解答
统计规则:1.免费题,2.算法题,3.能提交 Go 解答
Easy | Medium | Hard | Total | |
---|---|---|---|---|
Accepted | 242 | 413 | 175 | 830 |
Total | 251 | 427 | 180 | 858 |
以下免费的算法题,暂时不能提交 Go 解答
- 116.Populating Next Right Pointers in Each Node
- 117.Populating Next Right Pointers in Each Node II
- 133.Clone Graph
- 138.Copy List with Random Pointer
- 151.Reverse Words in a String
- 278.First Bad Version
- 284.Peeking Iterator
- 297.Serialize and Deserialize Binary Tree
- 341.Flatten Nested List Iterator
- 374.Guess Number Higher or Lower
- 426.Convert Binary Search Tree to Sorted Doubly Linked List
- 427.Construct Quad Tree
- 429.N-ary Tree Level Order Traversal
- 430.Flatten a Multilevel Doubly Linked List
- 449.Serialize and Deserialize BST
- 535.Encode and Decode TinyURL
- 558.Quad Tree Intersection
- 559.Maximum Depth of N-ary Tree
- 589.N-ary Tree Preorder Traversal
- 590.N-ary Tree Postorder Traversal
- 690.Employee Importance
- 708.Insert into a Cyclic Sorted List
helper 会处理大部分琐碎的工作。
notes 记录了我答题过程中,对知识点的总结。
针对 LeetCode 中经常出现的以下数据结构,在 kit 中进行了定义,并添加了与 []int 相互转换的函数。利用 Go 1.9 添加的 type alias 功能,易于添加单元测试。