活跃农民
- 积分
- 461
- 大米
- 颗
- 鳄梨
- 个
- 水井
- 尺
- 蓝莓
- 颗
- 萝卜
- 根
- 小米
- 粒
- 学分
- 个
- 注册时间
- 2015-6-30
- 最后登录
- 1970-1-1
|
Hope this helps
Collections by topic:
1. - strStr & Coding Style
2. - Binary Search
- Closest Number in Sorted Array
- Last Position of Target
- Search a 2D Matrix
- Maximum Number in Mountain Sequence
- Search in a Big Sorted Array
- Find Minimum is Rotated Sorted Array
- Find Peak Element
- First Bad Version
- Search in Rotated Sorted Array
3. - Binary Tree & Divide Conquer
- Subtree with Maximum Average
- Minimum Subtree
- Binary Tree Paths
- Flatten Binary Tree to LinkedList
- Maximum Depth of Binary Tree
- Balanced Binary Tree
- Binary Tree In-order Traversal
- Binary Tree Preorder Traversal
- Lowest Common Ancestor3
- Validate Binary Search Tree
4. - Breadth-First Search
- Number of Islands
- Binary Tree Level Order Traversal
- Course Schedule2
- Search Graph Nodes
- Knight Shortest Path
- Zombie in Matrix
- Graph Valid Tree
- Clone Graph
- Binary Tree Serialization
- Build Post Office2
5. - Depth First Search
- Palindrome Partitioning
- Combination Sum2
- Combination Sum
- Subsets2
- Permutations
- Permutations2
- Word Ladder2
6. - Linked List & Array
- Insert into Cyclic Sorted List
- Merge Two Sorted Lists
- Subarray Sum
- Maximum Subarray
- Subarray Sum Closest
- Copy List with Random Pointer
- Linked List Cycle
- Sort List
- Reverse Nodes in k-Group
- Median of two Sorted Arrays
7. - Two Pointer
- Two Sum - Data Structure Design
- Remove Duplicate Numbers in Array
- Two Sum - Input array is sorted
- Two Sum - Less than or equal to target
- Two Sum - Unique pairs
- Two Sum - Closest to target
- Sort Colors2
- 3Sum
- Partition Array
8. - Data Structure
- Hash Function
- High Five
- K Closest Points
- Kth Largest Element 2
- Top k Largest Numbers
- Rehashing
- Merge k Sorted Lists
- Ugly Number2
- strStr2
- LRU Cache
9. - DP
- Unique Paths2
- Unique Paths
- Climbing Stairs
- Minimum Path sum
- Triangle
- Largest Divisible Subset
- Knight Shortest Path
- Perfect Squares
- Jump Game
- Longest Increasing Subsequence
|
|