当前位置：网站首页>Code Capriccio: question skimming record (under update)

Code Capriccio: question skimming record (under update)

2022-07-19 09:02:00 【Lao Yan is working hard】

I'm so angry , I deleted all the ideas recorded before , Although I remember , But all the typed words are gone ...

Let it be , Just record whether you can recall , It's also more efficient .

At first glance, I have ideas, and I can directly pass the code in my mind , I didn't recall thinking about painting ×, Go back and learn again ε=( o｀ω′)ノ

in addition , Kago nb！(●'◡'●)

Topic type

A brush （2022.7.10~）

 Two brushes Three brushes
Array Two points search
Remove elements
The square of an ordered array
Subarray with the smallest length ×
Spiral matrix II
Linked list Remove linked list elements
Design the list
Reverse a linked list
Two or two exchange nodes in a linked list
Delete the last of the linked list N Nodes
The list intersects
Circular list II
Hashtable Effective alphabetic words
Intersection of two arrays
Happy number
Sum of two numbers
Add four numbers II
Ransom letter
Sum of three numbers
Sum of four numbers
character string Reverse string
Reverse string II
The finger of the sword Offer 05. Replace blank space
Flip the words in the string ×
The finger of the sword Offer58-II. Left rotation string
Realization strStr()×
Repeated substrings ×
Double pointer All appear in the previous topic

Stack and

queue

Using stack to realize queue
Using queue to implement stack
Valid parenthesis
Delete all adjacent duplicates in the string
Evaluate the inverse Polish expression
Maximum sliding window ×
front K High frequency elements
Binary tree Flip binary tree
Symmetric binary tree
The maximum depth of a binary tree
Minimum depth of binary tree ×
The number of nodes in a complete binary tree
Balanced binary trees
All paths of binary tree
Sum of left leaves
Find the value in the lower left corner of the tree
The sum of the paths
Construct binary tree from middle order and post order traversal sequence ×
The largest binary tree ×
Merge binary tree
Search in binary search tree
Verify binary search tree ×
The minimum absolute difference of binary search tree ×
The mode in the binary search tree ×
The nearest common ancestor of a binary tree
The nearest common ancestor of a binary search tree
Insert operation in binary search tree
Delete nodes in binary search tree ×
Prune the binary search tree ×
Convert an ordered array to a binary search tree
Convert binary search tree to accumulation tree
to flash back Combine
Combinatorial summation III
Letter combination of telephone number
Combinatorial summation
Combinatorial summation II×
Split palindrome string ×
Restore IP Address ×
A subset of
A subset of II
Increasing subsequence ×
Full Permutation
Full Permutation II
Rescheduling
N Queen
Solving Sudoku
greedy Distribute cookies
Swing sequence ×
The largest subsequence and
The best time to buy and sell stocks II
Jumping game
Jumping game II×
K The maximum array and... After negation
Gas station ×
Distribute candy
Change for lemonade
Rebuild the queue according to height
Detonate the balloon with a minimum number of arrows
No overlap
Division of alphabet
Merge range
Monotonically increasing numbers
The best time to buy and sell stocks includes handling fees ×
Monitoring binary trees ×

原网站

版权声明
本文为[Lao Yan is working hard]所创，转载请带上原文链接，感谢
https://yzsam.com/2022/200/202207170910252405.html

边栏推荐

猜你喜欢

随机推荐