LeetCode solution to a problem Summary (continuously updated and migrated to this blog list gradually )
Offer to prove safety
data structure
List
No. | topic | Difficulty |
---|---|---|
06 | List print head from the tail | simple |
18 | Delete the list of nodes | simple |
22 | The list penultimate k nodes | simple |
Binary Tree
No. | topic | Difficulty |
---|---|---|
07 | Reconstruction of a binary tree | medium |
Stacks and queues
No. | topic | Difficulty |
---|---|---|
09 | Two stacks queue | simple |
Map
No. | topic | Difficulty |
---|---|---|
12 | Matrix path | medium |
13 | Range of motion of the robot | medium |
algorithm
Dynamic Programming
No. | topic | Difficulty |
---|---|---|
10- I | Fibonacci number | simple |
10- II | Frog jump step problems | simple |
Seek
No. | topic | Difficulty |
---|---|---|
04 | Two-dimensional array lookup | simple |
other
No. | topic | Difficulty |
---|---|---|
03 | Array duplicate numbers | simple |
05 | Replace spaces | simple |
11 | Minimum number of rotation of the array | simple |
Golden programmer interview
data structure
String
No. | topic | Difficulty |
---|---|---|
01.01 | Determine whether the unique character | simple |
01.02 | Mutually determine whether the character rearrangement | simple |
01.03 | URL of | simple |
01.04 | Palindromic arrangement | simple |
01.06 | String compression | simple |
algorithm
LeetCode
data structure
Binary Tree
No. | topic | Difficulty |
---|---|---|
105 | Previous order and sequence preorder binary tree structure | medium |
algorithm
Dynamic Programming
No. | topic | Difficulty |
---|---|---|
509 | Fibonacci | simple |
other
No. | topic | Difficulty |
---|---|---|
79 | Word Search | medium |
240 | Search two-dimensional matrix II | medium |