我个人的力扣答案, 公众号:GeekPal
这是一个持续更新的开源项目
My personal leetcode answers
This is a continually updated open source project
pip install -r requirements.txt
python problem.py <leetcode/lintcode> [-l java|cpp|python(default)] [-t]
# 例如(e.g.):
python problem.py https://leetcode.com/problems/online-stock-span/
python problem.py https://www.lintcode.com/problem/92 -l cpp- 《算法技术手册》/ Algorithms in a Nutshell
- 《STL源码剖析》/ The Annotated STL Sources
- 《算法心得：高效算法的奥秘》/ Hacker's Delight, 2nd Edition
- 《数学之美》(A chinese version book by Doctor Wujun)
- 《编程之美 : 微软技术面试心得》(A chinese version book by Mircosoft Developers)
- Bit Manipulation
- Simulation
- Design
- Binary Search
- Two Pointers
- Greedy
- Dynamic Programming
- Backtracking
- Divide and Conquer
- Breadth-First Search
- Depth-First Search
- Hash Table
- Binary Search Tree
- Union Find
- Trie
- Linked List
- String
- Array
- Other
| Problem | Solution | Time | Space | Note | Ref |
|---|---|---|---|---|---|
| Lintcode-39. Recover Rotated Sorted Array | c++, python | O(N) | O(1) | Rotated | - |
| Problem | Solution | Time | Space | Note | Ref |
|---|---|---|---|---|---|
| Leetcode-173. Binary Search Tree Iterator | c++, python | O(1) | O(Height) | InOrder | - |
| Leetcode-297. Serialize And Deserialize Binary Tree | c++, python | O(N) | O(N) | Serialization | - |
| Problem | Solution | Time | Space | Note | Ref |
|---|---|---|---|---|---|
| Leetcode-375. Guess Number Higher Or Lower II | c++, python | O(N^3) | O(N^2) | DP(Index) | - |
| Leetcode-322. Coin Change | c++, python | O(K * N) | O(N) | Index | Video |
| Problem | Solution | Time | Space | Note | Ref |
|---|---|---|---|---|---|
| Leetcode-257. Binary Tree Paths | c++, python | O(N) | O(Height) | - | - |
| Problem | Solution | Time | Space | Note | Ref |
|---|---|---|---|---|---|
| Lintcode-1534. Convert Binary Search Tree To Sorted Doubly Linked List | c++, python | O(N) | O(Height) | BST | Leetcode-426 | - |
| Lintcode-11. Search Range In Binary Search Tree | c++, python | O(N) | O(Height) | InOrder | - |
| Problem | Solution | Time | Space | Note | Ref |
|---|---|---|---|---|---|
| Leetcode-102. Binary Tree Level Order Traversal | c++, python | O(N) | O(Width) | Level | - |
| Leetcode-104. Maximum Depth Of Binary Tree | c++, python | O(N) | O(Height) | Recursion | - |
| Problem | Solution | Time | Space | Note | Ref |
|---|---|---|---|---|---|
| Leetcode-98. Validate Binary Search Tree | c++, python | O(N) | O(Height) | BST | - |
| Leetcode-94. Binary Tree Inorder Traversal | c++, python | O(N) | O(Height) | InOrder | - |
| Leetcode-145. Binary Tree Postorder Traversal | c++, python | O(N) | O(Height) | PostOrder | - |
| Leetcode-114. Flatten Binary Tree To Linked List | c++, python | O(N) | O(Height) | PreOrder | - |
| Leetcode-144. Binary Tree Preorder Traversal | c++, python | O(N) | O(Height) | PreOrder | - |
| Leetcode-110. Balanced Binary Tree | c++, python | O(N) | O(Height) | Recursion | - |
| Leetcode-236. Lowest Common Ancestor Of A Binary Tree | c++, python | O(N) | O(Height) | Recursion | - |
| Problem | Solution | Time | Space | Note | Ref |
|---|---|---|---|---|---|
| Leetcode-450. Delete Node In A Bst | c++, python | O(Height) | O(Height) | Delete | - |
| Leetcode-701. Insert Into A Binary Search Tree | c++, python | O(Height) | O(Height) | Insert | - |
| Lintcode-448. Inorder Successor In Bst | c++, python | O(Height) | O(1) | Successor | Leetcode-285 | - |
| Problem | Solution | Time | Space | Note | Ref |
|---|---|---|---|---|---|
| Leetcode-1249. Minimum Remove To Make Valid Parentheses | c++, python | O(N) | O(N) | - | - |
| Lintcode-1790. Rotate String II | c++, python | O(N) | O(N) | Simulation | - |
| Problem | Solution | Time | Space | Note | Ref |
|---|---|---|---|---|---|
| Leetcode-2210. Count Hills And Valleys In An Array | c++, python | O(N) | O(1) | - | - |
Total sovled: 318
PS: semicolon(;) after each note means related questions are checked
Auto updated at: 2024-02-27 18:52:49