Skip to content

Commit 49ac05f

Browse files
Terence-ChengTerence-Cheng
committed
docs: change readme
1 parent 7125ce0 commit 49ac05f

File tree

2 files changed

+193
-193
lines changed

2 files changed

+193
-193
lines changed

‎Readme.md

+1-193
Original file line numberDiff line numberDiff line change
@@ -13,201 +13,9 @@ https://frontendtricksblog.blogspot.com/
1313
[2. 浏览器渲染流程(2) — JS、CSS 对渲染流程的影响](https://github.com/Terence-Cheng/Frontend_Blog/issues/3)
1414

1515

16-
1716
## React
1817
### React 原理
1918
[1. React原理之首次渲染——JSX, React.createElement, ReactDom.render](https://github.com/Terence-Cheng/Frontend_Blog/issues/4)
2019

2120
## Leetcode
22-
23-
### Find Set Map
24-
[leetcode 451.Sort Characters By Frequency](https://github.com/Terence-Cheng/Frontend_Blog/issues/5)
25-
26-
[leetcode 1.Two Sum](https://github.com/Terence-Cheng/Frontend_Blog/issues/6)
27-
28-
[leetcode 146.LRU Cache](https://github.com/Terence-Cheng/Frontend_Blog/issues/7)
29-
30-
[leetcode 454.Four Sum ii](https://github.com/Terence-Cheng/Frontend_Blog/blob/main/leetcode/454.4-sum-ii.ts)
31-
32-
[leetcode 49.Group Anagrams](https://github.com/Terence-Cheng/Frontend_Blog/blob/main/leetcode/49.group-anagrams.ts)
33-
34-
[leetcode 447.Number Of Boomeranges](https://github.com/Terence-Cheng/Frontend_Blog/issues/10)
35-
36-
[** leetcode 49.Max Points On A Line **](https://github.com/Terence-Cheng/Frontend_Blog/blob/main/leetcode/149.max-points-on-a-line.ts)
37-
38-
### Two points
39-
[leetcode 167.Two Sum 2](https://github.com/Terence-Cheng/Frontend_Blog/blob/main/leetcode/167.two-sum-ii-input-array-is-sorted.ts)
40-
41-
[leetcode 15.Three Sum](https://github.com/Terence-Cheng/Frontend_Blog/blob/main/leetcode/15.3-sum.ts)
42-
43-
[leetcode 18.Four Sum](https://github.com/Terence-Cheng/Frontend_Blog/blob/main/leetcode/18.4-sum.ts)
44-
45-
[leetcode 16.Three Sum Closest](https://github.com/Terence-Cheng/Frontend_Blog/blob/main/leetcode/16.3-sum-closest.ts)
46-
47-
### Sliding window
48-
209
49-
50-
3
51-
52-
438
53-
54-
76
55-
56-
[leetcode 220.Contains Duplicate iii](https://github.com/Terence-Cheng/Frontend_Blog/blob/main/leetcode/220.contains-duplicate-iii.ts)
57-
58-
#### Set
59-
[leetcode 217.Contains Duplicate](https://github.com/Terence-Cheng/Frontend_Blog/blob/main/leetcode/217.contains-duplicate.ts)
60-
[leetcode 219.Contains Duplicate ii](https://github.com/Terence-Cheng/Frontend_Blog/blob/main/leetcode/219.contains-duplicate-ii.ts)
61-
62-
### Linked List
63-
prev = null, cur, next
64-
65-
[leetcode 206.Reverse Linked List](https://github.com/Terence-Cheng/Frontend_Blog/blob/main/leetcode/206.reverse-linked-list.ts)
66-
67-
[leetcode 92.Reverse Linked List ii](https://github.com/Terence-Cheng/Frontend_Blog/blob/main/leetcode/92.reverse-linked-list-ii.ts)
68-
69-
[leetcode 83.Remove Duplicates From Sorted List](https://github.com/Terence-Cheng/Frontend_Blog/blob/main/leetcode/83.remove-duplicates-from-sorted-list.ts)
70-
71-
[leetcode 86.Partition List](https://github.com/Terence-Cheng/Frontend_Blog/blob/main/leetcode/86.partition-list.ts)
72-
73-
[leetcode 328.Odd Even Linked List](https://github.com/Terence-Cheng/Frontend_Blog/blob/main/leetcode/328.odd-even-linked-list.ts)
74-
75-
[leetcode 2.Add Two Numbers](https://github.com/Terence-Cheng/Frontend_Blog/blob/main/leetcode/2.add-two-numbers.ts)
76-
77-
[leetcode 445.Add Two Numbers II](https://github.com/Terence-Cheng/Frontend_Blog/blob/main/leetcode/445.add-two-numbers-ii.ts)
78-
79-
[leetcode 203.Remove Linked List Elements](https://github.com/Terence-Cheng/Frontend_Blog/blob/main/leetcode/203.remove-linked-list-elements.ts)
80-
81-
[leetcode 82.Remove Linked List Elements ii](https://github.com/Terence-Cheng/Frontend_Blog/blob/main/leetcode/82.remove-duplicates-from-sorted-list-ii.ts)
82-
83-
[leetcode 21.Merge Two Sorted List](https://github.com/Terence-Cheng/Frontend_Blog/blob/main/leetcode/21.merge-two-sorted-lists.ts)
84-
85-
[leetcode 24.Swap Nodes In Pairs](https://github.com/Terence-Cheng/Frontend_Blog/blob/main/leetcode/24.swap-nodes-in-pairs.ts)
86-
87-
[leetcode 25.Reverse Nodes In K Groups ** HARD **](https://github.com/Terence-Cheng/Frontend_Blog/blob/main/leetcode/25.reverse-nodes-in-k-group.ts)
88-
89-
[leetcode 147.Insertion Sort List](https://github.com/Terence-Cheng/Frontend_Blog/blob/main/leetcode/147.insertion-sort-list.ts)
90-
91-
148 TODO
92-
93-
#### Linked List - Modify value
94-
95-
[leetcode 237.Delete Node In a Linked List](https://github.com/Terence-Cheng/Frontend_Blog/blob/main/leetcode/237.delete-node-in-a-linked-list.ts)
96-
97-
#### Linked List - Two Pointers
98-
[leetcode 19.Remove nth node from end of list](https://github.com/Terence-Cheng/Frontend_Blog/blob/main/leetcode/19.remove-nth-node-from-end-of-list.ts)
99-
100-
[leetcode 61.Rotate List](https://github.com/Terence-Cheng/Frontend_Blog/blob/main/leetcode/61.rotate-list.ts)
101-
102-
[leetcode 143.Reorder List](https://github.com/Terence-Cheng/Frontend_Blog/blob/main/leetcode/143.reorder-list.ts)
103-
104-
[leetcode 234.Palindrome Linked List](https://github.com/Terence-Cheng/Frontend_Blog/blob/main/leetcode/234.palindrome-linked-list.ts)
105-
106-
### Stack and Queue
107-
108-
#### Stack
109-
20
110-
111-
[leetcode 150.Evaluate Reverse Polish Notation](leetcode/150.evaluate-reverse-polish-notation.ts)
112-
113-
[leetcode 71.Simplify Path](leetcode/71.simplify-path.ts)
114-
115-
116-
#### Recur and Stack
117-
118-
[leetcode 144.Binary Tree Preorder Traversal](leetcode/144.binary-tree-preorder-traversal.ts)
119-
120-
[leetcode 144.Iterator - Binary Tree Preorder Traversal](leetcode/144.iterator.binary-tree-preorder-traversal.ts)
121-
122-
[leetcode 94.Binary Tree Inorder Traversal](leetcode/94.binary-tree-inorder-traversal.ts)
123-
124-
[leetcode 94.Iterator - Bianry Tree Inorder Travesal](leetcode/94.iterator.binary-tree-inorder-traversal.ts)
125-
126-
[leetcode 145.Binary Tree Postorder Traversal](leetcode/145.binary-tree-postorder-traversal.ts)
127-
128-
[leetcode 145.Iterator - Binary Tree Postorder Travesal](leetcode/145.Iterator.binary-tree-postorder-traversal.ts)
129-
130-
[leetcode 341.Flatten Nested List Iterator](leetcode/341.flatten-nested-list-iterator.ts)
131-
132-
133-
134-
#### Queue - Binary Tree Level Order
135-
136-
[leetcode 102.Binary Tree Level Order Travesal](leetcode/102.binary-tree-level-order-traversal.ts)
137-
138-
[leetcode 107.Binary Tree Level Order Travesal II](leetcode/107.binary-tree-level-order-traversal-ii.ts)
139-
140-
[leetcode 103.Binary Tree Zigzan Level Order Travesal](leetcode/103.binary-tree-zigzag-level-order-traversal.ts)
141-
142-
[leetcode 199.Binary Tree Right Side View](leetcode/199.binary-tree-right-side-view.ts)
143-
144-
#### BFS - Graph
145-
146-
[leetcode 279.Perfect Squares](leetcode/279.perfect-squares.ts)
147-
148-
[leetocd 127.Word Ladder](leetcode/127.word-ladder.ts)
149-
150-
todo 126
151-
152-
153-
#### Priority Queue
154-
todo
155-
Max Heap
156-
157-
347
158-
159-
23
160-
161-
O(nlog(k))
162-
O(nlog(n-k))
163-
164-
### Binary Tree and Recur
165-
166-
[leetcode 104.Maximun Depth Of Binary Tree](leetcode/104.maximum-depth-of-binary-tree.ts)
167-
168-
[leetcode 111.Minimun Depth Of Binary Tree](leetcode/111.minimum-depth-of-binary-tree.ts)
169-
170-
[leetcode 226.Invert Binary Tree](leetcode/226.invert-binary-tree.ts)
171-
172-
[leetcode 100.Same Tree](leetcode/100.same-tree.ts)
173-
174-
[leetcode 101.Symmetric Tree](leetcode/101.symmetric-tree.ts)
175-
176-
[leetcode 101.Symmetric Tree - Iteratively](leetcode/101.symmetric-tree.iteratively.ts)
177-
178-
[leetcode 222.Count Complete Tree Nodes](leetcode/222.count-complete-tree-nodes.ts)
179-
180-
TODO: 222 - complete tree
181-
182-
[leetcode 110.Balanced Binary Tree](leetcode/110.balanced-binary-tree.ts)
183-
184-
TODO: 110 - Another solution
185-
186-
### Binary Tree Leaf Node
187-
[leetcode 112.Path Sum](leetcode/112.path-sum.ts)
188-
189-
[leetcode 111.Minimun Depth Of Binary Tree](leetcode/111.minimum-depth-of-binary-tree.ts)
190-
191-
[leetcode 404.Sum of Left Leaves](leetcode/404.sum-of-left-leaves.ts)
192-
193-
[leetcode 257.Binary Tree Paths](leetcode/257.binary-tree-paths.ts)
194-
195-
[leetcode 113.Path Sum ii](leetcode/113.path-sum-ii.ts)
196-
197-
[leetcode 129.Sum Root To Leaf Numbers](leetcode/129.sum-root-to-leaf-numbers.ts)
198-
199-
[leetcode 437.Path Sum III](leetcode/437.path-sum-iii.ts)
200-
### Binary Search Tree
201-
202-
[leetcode 235.Lowest Common Ancestor Of A Binary Search Tree](leetcode/235.lowest-common-ancestor-of-a-binary-search-tree.ts)
203-
204-
236
205-
206-
[leetcode 98.Validate Binary Search Tree](leetcode/98.validate-binary-search-tree.ts)
207-
208-
[leetcode 450.Delete Node In a BST](leetcode/450.delete-node-in-a-bst.ts)
209-
210-
[leetcode 108.Convert Sorted Array To Binary Search Tree](leetcode/108.convert-sorted-array-to-binary-search-tree.ts)
211-
212-
[leetcode 230.Kth Smallest Element in a BST](leetcode/230.kth-smallest-element-in-a-bst.ts)
213-
21+
[Leetcode: List](leetcode/readme.md)

‎leetcode/readme.md

+192
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,192 @@
1+
2+
### Find Set Map
3+
[leetcode 451.Sort Characters By Frequency](https://github.com/Terence-Cheng/Frontend_Blog/issues/5)
4+
5+
[leetcode 1.Two Sum](https://github.com/Terence-Cheng/Frontend_Blog/issues/6)
6+
7+
[leetcode 146.LRU Cache](https://github.com/Terence-Cheng/Frontend_Blog/issues/7)
8+
9+
[leetcode 454.Four Sum ii](https://github.com/Terence-Cheng/Frontend_Blog/blob/main/leetcode/454.4-sum-ii.ts)
10+
11+
[leetcode 49.Group Anagrams](https://github.com/Terence-Cheng/Frontend_Blog/blob/main/leetcode/49.group-anagrams.ts)
12+
13+
[leetcode 447.Number Of Boomeranges](https://github.com/Terence-Cheng/Frontend_Blog/issues/10)
14+
15+
[** leetcode 49.Max Points On A Line **](https://github.com/Terence-Cheng/Frontend_Blog/blob/main/leetcode/149.max-points-on-a-line.ts)
16+
17+
### Two points
18+
[leetcode 167.Two Sum 2](https://github.com/Terence-Cheng/Frontend_Blog/blob/main/leetcode/167.two-sum-ii-input-array-is-sorted.ts)
19+
20+
[leetcode 15.Three Sum](https://github.com/Terence-Cheng/Frontend_Blog/blob/main/leetcode/15.3-sum.ts)
21+
22+
[leetcode 18.Four Sum](https://github.com/Terence-Cheng/Frontend_Blog/blob/main/leetcode/18.4-sum.ts)
23+
24+
[leetcode 16.Three Sum Closest](https://github.com/Terence-Cheng/Frontend_Blog/blob/main/leetcode/16.3-sum-closest.ts)
25+
26+
### Sliding window
27+
209
28+
29+
3
30+
31+
438
32+
33+
76
34+
35+
[leetcode 220.Contains Duplicate iii](https://github.com/Terence-Cheng/Frontend_Blog/blob/main/leetcode/220.contains-duplicate-iii.ts)
36+
37+
#### Set
38+
[leetcode 217.Contains Duplicate](https://github.com/Terence-Cheng/Frontend_Blog/blob/main/leetcode/217.contains-duplicate.ts)
39+
[leetcode 219.Contains Duplicate ii](https://github.com/Terence-Cheng/Frontend_Blog/blob/main/leetcode/219.contains-duplicate-ii.ts)
40+
41+
### Linked List
42+
prev = null, cur, next
43+
44+
[leetcode 206.Reverse Linked List](https://github.com/Terence-Cheng/Frontend_Blog/blob/main/leetcode/206.reverse-linked-list.ts)
45+
46+
[leetcode 92.Reverse Linked List ii](https://github.com/Terence-Cheng/Frontend_Blog/blob/main/leetcode/92.reverse-linked-list-ii.ts)
47+
48+
[leetcode 83.Remove Duplicates From Sorted List](https://github.com/Terence-Cheng/Frontend_Blog/blob/main/leetcode/83.remove-duplicates-from-sorted-list.ts)
49+
50+
[leetcode 86.Partition List](https://github.com/Terence-Cheng/Frontend_Blog/blob/main/leetcode/86.partition-list.ts)
51+
52+
[leetcode 328.Odd Even Linked List](https://github.com/Terence-Cheng/Frontend_Blog/blob/main/leetcode/328.odd-even-linked-list.ts)
53+
54+
[leetcode 2.Add Two Numbers](https://github.com/Terence-Cheng/Frontend_Blog/blob/main/leetcode/2.add-two-numbers.ts)
55+
56+
[leetcode 445.Add Two Numbers II](https://github.com/Terence-Cheng/Frontend_Blog/blob/main/leetcode/445.add-two-numbers-ii.ts)
57+
58+
[leetcode 203.Remove Linked List Elements](https://github.com/Terence-Cheng/Frontend_Blog/blob/main/leetcode/203.remove-linked-list-elements.ts)
59+
60+
[leetcode 82.Remove Linked List Elements ii](https://github.com/Terence-Cheng/Frontend_Blog/blob/main/leetcode/82.remove-duplicates-from-sorted-list-ii.ts)
61+
62+
[leetcode 21.Merge Two Sorted List](https://github.com/Terence-Cheng/Frontend_Blog/blob/main/leetcode/21.merge-two-sorted-lists.ts)
63+
64+
[leetcode 24.Swap Nodes In Pairs](https://github.com/Terence-Cheng/Frontend_Blog/blob/main/leetcode/24.swap-nodes-in-pairs.ts)
65+
66+
[leetcode 25.Reverse Nodes In K Groups ** HARD **](https://github.com/Terence-Cheng/Frontend_Blog/blob/main/leetcode/25.reverse-nodes-in-k-group.ts)
67+
68+
[leetcode 147.Insertion Sort List](https://github.com/Terence-Cheng/Frontend_Blog/blob/main/leetcode/147.insertion-sort-list.ts)
69+
70+
148 TODO
71+
72+
#### Linked List - Modify value
73+
74+
[leetcode 237.Delete Node In a Linked List](https://github.com/Terence-Cheng/Frontend_Blog/blob/main/leetcode/237.delete-node-in-a-linked-list.ts)
75+
76+
#### Linked List - Two Pointers
77+
[leetcode 19.Remove nth node from end of list](https://github.com/Terence-Cheng/Frontend_Blog/blob/main/leetcode/19.remove-nth-node-from-end-of-list.ts)
78+
79+
[leetcode 61.Rotate List](https://github.com/Terence-Cheng/Frontend_Blog/blob/main/leetcode/61.rotate-list.ts)
80+
81+
[leetcode 143.Reorder List](https://github.com/Terence-Cheng/Frontend_Blog/blob/main/leetcode/143.reorder-list.ts)
82+
83+
[leetcode 234.Palindrome Linked List](https://github.com/Terence-Cheng/Frontend_Blog/blob/main/leetcode/234.palindrome-linked-list.ts)
84+
85+
### Stack and Queue
86+
87+
#### Stack
88+
20
89+
90+
[leetcode 150.Evaluate Reverse Polish Notation](leetcode/150.evaluate-reverse-polish-notation.ts)
91+
92+
[leetcode 71.Simplify Path](leetcode/71.simplify-path.ts)
93+
94+
95+
#### Recur and Stack
96+
97+
[leetcode 144.Binary Tree Preorder Traversal](leetcode/144.binary-tree-preorder-traversal.ts)
98+
99+
[leetcode 144.Iterator - Binary Tree Preorder Traversal](leetcode/144.iterator.binary-tree-preorder-traversal.ts)
100+
101+
[leetcode 94.Binary Tree Inorder Traversal](leetcode/94.binary-tree-inorder-traversal.ts)
102+
103+
[leetcode 94.Iterator - Bianry Tree Inorder Travesal](leetcode/94.iterator.binary-tree-inorder-traversal.ts)
104+
105+
[leetcode 145.Binary Tree Postorder Traversal](leetcode/145.binary-tree-postorder-traversal.ts)
106+
107+
[leetcode 145.Iterator - Binary Tree Postorder Travesal](leetcode/145.Iterator.binary-tree-postorder-traversal.ts)
108+
109+
[leetcode 341.Flatten Nested List Iterator](leetcode/341.flatten-nested-list-iterator.ts)
110+
111+
112+
113+
#### Queue - Binary Tree Level Order
114+
115+
[leetcode 102.Binary Tree Level Order Travesal](leetcode/102.binary-tree-level-order-traversal.ts)
116+
117+
[leetcode 107.Binary Tree Level Order Travesal II](leetcode/107.binary-tree-level-order-traversal-ii.ts)
118+
119+
[leetcode 103.Binary Tree Zigzan Level Order Travesal](leetcode/103.binary-tree-zigzag-level-order-traversal.ts)
120+
121+
[leetcode 199.Binary Tree Right Side View](leetcode/199.binary-tree-right-side-view.ts)
122+
123+
#### BFS - Graph
124+
125+
[leetcode 279.Perfect Squares](leetcode/279.perfect-squares.ts)
126+
127+
[leetocd 127.Word Ladder](leetcode/127.word-ladder.ts)
128+
129+
todo 126
130+
131+
132+
#### Priority Queue
133+
todo
134+
Max Heap
135+
136+
347
137+
138+
23
139+
140+
O(nlog(k))
141+
O(nlog(n-k))
142+
143+
### Binary Tree and Recur
144+
145+
[leetcode 104.Maximun Depth Of Binary Tree](leetcode/104.maximum-depth-of-binary-tree.ts)
146+
147+
[leetcode 111.Minimun Depth Of Binary Tree](leetcode/111.minimum-depth-of-binary-tree.ts)
148+
149+
[leetcode 226.Invert Binary Tree](leetcode/226.invert-binary-tree.ts)
150+
151+
[leetcode 100.Same Tree](leetcode/100.same-tree.ts)
152+
153+
[leetcode 101.Symmetric Tree](leetcode/101.symmetric-tree.ts)
154+
155+
[leetcode 101.Symmetric Tree - Iteratively](leetcode/101.symmetric-tree.iteratively.ts)
156+
157+
[leetcode 222.Count Complete Tree Nodes](leetcode/222.count-complete-tree-nodes.ts)
158+
159+
TODO: 222 - complete tree
160+
161+
[leetcode 110.Balanced Binary Tree](leetcode/110.balanced-binary-tree.ts)
162+
163+
TODO: 110 - Another solution
164+
165+
### Binary Tree Leaf Node
166+
[leetcode 112.Path Sum](leetcode/112.path-sum.ts)
167+
168+
[leetcode 111.Minimun Depth Of Binary Tree](leetcode/111.minimum-depth-of-binary-tree.ts)
169+
170+
[leetcode 404.Sum of Left Leaves](leetcode/404.sum-of-left-leaves.ts)
171+
172+
[leetcode 257.Binary Tree Paths](leetcode/257.binary-tree-paths.ts)
173+
174+
[leetcode 113.Path Sum ii](leetcode/113.path-sum-ii.ts)
175+
176+
[leetcode 129.Sum Root To Leaf Numbers](leetcode/129.sum-root-to-leaf-numbers.ts)
177+
178+
[leetcode 437.Path Sum III](leetcode/437.path-sum-iii.ts)
179+
### Binary Search Tree
180+
181+
[leetcode 235.Lowest Common Ancestor Of A Binary Search Tree](leetcode/235.lowest-common-ancestor-of-a-binary-search-tree.ts)
182+
183+
236
184+
185+
[leetcode 98.Validate Binary Search Tree](leetcode/98.validate-binary-search-tree.ts)
186+
187+
[leetcode 450.Delete Node In a BST](leetcode/450.delete-node-in-a-bst.ts)
188+
189+
[leetcode 108.Convert Sorted Array To Binary Search Tree](leetcode/108.convert-sorted-array-to-binary-search-tree.ts)
190+
191+
[leetcode 230.Kth Smallest Element in a BST](leetcode/230.kth-smallest-element-in-a-bst.ts)
192+

0 commit comments

Comments
 (0)