+
+
+
+
+
+
+
+
+
+
+
+
+
-
+
-
-
-
-
-
-
+
+
-
-
-
+
-支持 Progressive Web Apps 的题解电子书《LeetCode Cookbook》 Online Reading
+
+
-离线版本的电子书《LeetCode Cookbook》PDF Download here
+
-
+
+
+
+
+
+
+
+
+
+# 说明
+
+此版本是 https://books.halfrost.com/leetcode 网页的离线版，由于网页版实时会更新，所以此 PDF 版难免会有一些排版或者错别字。如果读者遇到了，可以到网页版相应页面，点击页面 edit 按钮，提交 pr 进行更改。此 PDF 版本号是 V1.5.20。PDF 永久更新地址是 https://github.com/halfrost/leetcode-go/releases/，以版本号区分不同版本。笔者还是强烈推荐看在线版，有任何错误都会立即更新。如果觉得此书对刷题有一点点帮助，可以给此书点一个 star，鼓励一下笔者早点更新更多题解。
+
+> 版本号说明，V1.5.20，1 是大版本号，5 代表当前题解中有几百题，目前是 520 题，所以第二个版本号是 5，20 代表当前题解中有几十题，目前是 520 题，所以第三个版本号是 20 。
+
+# 目录
+
+[toc]
\ No newline at end of file
diff --git a/ctl/meta/Segment_Tree b/ctl/meta/Segment_Tree
new file mode 100644
index 000000000..0e7f9c743
--- /dev/null
+++ b/ctl/meta/Segment_Tree
@@ -0,0 +1,10 @@
+|218. The Skyline Problem | [Go]({{< relref "/ChapterFour/0218.The-Skyline-Problem.md" >}})| Hard | O(n log n)| O(n)|❤️|
+|307. Range Sum Query - Mutable | [Go]({{< relref "/ChapterFour/0307.Range-Sum-Query---Mutable.md" >}})| Hard | O(1)| O(n)||
+|315. Count of Smaller Numbers After Self | [Go]({{< relref "/ChapterFour/0315.Count-of-Smaller-Numbers-After-Self.md" >}})| Hard | O(n log n)| O(n)||
+|327. Count of Range Sum | [Go]({{< relref "/ChapterFour/0327.Count-of-Range-Sum.md" >}})| Hard | O(n log n)| O(n)|❤️|
+|493. Reverse Pairs | [Go]({{< relref "/ChapterFour/0493.Reverse-Pairs.md" >}})| Hard | O(n log n)| O(n)||
+|699. Falling Squares | [Go]({{< relref "/ChapterFour/0699.Falling-Squares.md" >}})| Hard | O(n log n)| O(n)|❤️|
+|715. Range Module | [Go]({{< relref "/ChapterFour/0715.Range-Module.md" >}})| Hard | O(log n)| O(n)|❤️|
+|732. My Calendar III | [Go]({{< relref "/ChapterFour/0732.My-Calendar-III.md" >}})| Hard | O(log n)| O(n)|❤️|
+|850. Rectangle Area II | [Go]({{< relref "/ChapterFour/0850.Rectangle-Area-II.md" >}})| Hard | O(n log n)| O(n)|❤️|
+|1157. Online Majority Element In Subarray | [Go]({{< relref "/ChapterFour/1157.Online-Majority-Element-In-Subarray.md" >}})| Hard | O(log n)| O(n)|❤️|
\ No newline at end of file
diff --git a/ctl/meta/Sliding_Window b/ctl/meta/Sliding_Window
new file mode 100644
index 000000000..e3ec8c4a2
--- /dev/null
+++ b/ctl/meta/Sliding_Window
@@ -0,0 +1,13 @@
+|3. Longest Substring Without Repeating Characters | [Go]({{< relref "/ChapterFour/0003.Longest-Substring-Without-Repeating-Characters.md" >}})| Medium | O(n)| O(1)|❤️|
+|76. Minimum Window Substring | [Go]({{< relref "/ChapterFour/0076.Minimum-Window-Substring.md" >}})| Hard | O(n)| O(n)|❤️|
+|239. Sliding Window Maximum | [Go]({{< relref "/ChapterFour/0239.Sliding-Window-Maximum.md" >}})| Hard | O(n * k)| O(n)|❤️|
+|424. Longest Repeating Character Replacement | [Go]({{< relref "/ChapterFour/0424.Longest-Repeating-Character-Replacement.md" >}})| Medium | O(n)| O(1) ||
+|480. Sliding Window Median | [Go]({{< relref "/ChapterFour/0480.Sliding-Window-Median.md" >}})| Hard | O(n * log k)| O(k)|❤️|
+|567. Permutation in String | [Go]({{< relref "/ChapterFour/0567.Permutation-in-String.md" >}})| Medium | O(n)| O(1)|❤️|
+|978. Longest Turbulent Subarray | [Go]({{< relref "/ChapterFour/0978.Longest-Turbulent-Subarray.md" >}})| Medium | O(n)| O(1)|❤️|
+|992. Subarrays with K Different Integers | [Go]({{< relref "/ChapterFour/0992.Subarrays-with-K-Different-Integers.md" >}})| Hard | O(n)| O(n)|❤️|
+|995. Minimum Number of K Consecutive Bit Flips | [Go]({{< relref "/ChapterFour/0995.Minimum-Number-of-K-Consecutive-Bit-Flips.md" >}})| Hard | O(n)| O(1)|❤️|
+|1004. Max Consecutive Ones III | [Go]({{< relref "/ChapterFour/1004.Max-Consecutive-Ones-III.md" >}})| Medium | O(n)| O(1) ||
+|1040. Moving Stones Until Consecutive II | [Go]({{< relref "/ChapterFour/1040.Moving-Stones-Until-Consecutive-II.md" >}})| Medium | O(n log n)| O(1) |❤️|
+|1052. Grumpy Bookstore Owner | [Go]({{< relref "/ChapterFour/1052.Grumpy-Bookstore-Owner.md" >}})| Medium | O(n log n)| O(1) ||
+|1074. Number of Submatrices That Sum to Target | [Go]({{< relref "/ChapterFour/1074.Number-of-Submatrices-That-Sum-to-Target.md" >}})| Hard | O(n^3)| O(n) |❤️|
\ No newline at end of file
diff --git a/ctl/meta/Sorting b/ctl/meta/Sorting
new file mode 100644
index 000000000..abe19d2ad
--- /dev/null
+++ b/ctl/meta/Sorting
@@ -0,0 +1,23 @@
+|56. Merge Intervals | [Go]({{< relref "/ChapterFour/0056.Merge-Intervals.md" >}})| Medium | O(n log n)| O(log n)||
+|57. Insert Interval | [Go]({{< relref "/ChapterFour/0057.Insert-Interval.md" >}})| Hard | O(n)| O(1)||
+|75. Sort Colors | [Go]({{< relref "/ChapterFour/0075.Sort-Colors.md" >}})| Medium| O(n)| O(1)|❤️|
+|147. Insertion Sort List | [Go]({{< relref "/ChapterFour/0147.Insertion-Sort-List.md" >}})| Medium | O(n^2)| O(1) |❤️|
+|148. Sort List | [Go]({{< relref "/ChapterFour/0148.Sort-List.md" >}})| Medium |O(n log n)| O(log n)|❤️|
+|164. Maximum Gap | [Go]({{< relref "/ChapterFour/0164.Maximum-Gap.md" >}})| Hard | O(n log n)| O(log n) |❤️|
+|179. Largest Number | [Go]({{< relref "/ChapterFour/0179.Largest-Number.md" >}})| Medium | O(n log n)| O(log n) |❤️|
+|220. Contains Duplicate III | [Go]({{< relref "/ChapterFour/0220.Contains-Duplicate-III.md" >}})| Medium | O(n log n)| O(1) |❤️|
+|242. Valid Anagram | [Go]({{< relref "/ChapterFour/0242.Valid-Anagram.md" >}})| Easy | O(n)| O(n) ||
+|274. H-Index | [Go]({{< relref "/ChapterFour/0274.H-Index.md" >}})| Medium | O(n)| O(n) ||
+|324. Wiggle Sort II | [Go]({{< relref "/ChapterFour/0324.Wiggle-Sort-II.md" >}})| Medium| O(n)| O(n)|❤️|
+|349. Intersection of Two Arrays | [Go]({{< relref "/ChapterFour/0349.Intersection-of-Two-Arrays.md" >}})| Easy | O(n)| O(n) ||
+|350. Intersection of Two Arrays II | [Go]({{< relref "/ChapterFour/0350.Intersection-of-Two-Arrays-II.md" >}})| Easy | O(n)| O(n) ||
+|524. Longest Word in Dictionary through Deleting | [Go]({{< relref "/ChapterFour/0524.Longest-Word-in-Dictionary-through-Deleting.md" >}})| Medium | O(n)| O(1) ||
+|767. Reorganize String | [Go]({{< relref "/ChapterFour/0767.Reorganize-String.md" >}})| Medium | O(n log n)| O(log n) |❤️|
+|853. Car Fleet | [Go]({{< relref "/ChapterFour/0853.Car-Fleet.md" >}})| Medium | O(n log n)| O(log n) ||
+|710. Random Pick with Blacklist | [Go]({{< relref "/ChapterFour/0710.Random-Pick-with-Blacklist.md" >}})| Hard | O(n)| O(n) ||
+|922. Sort Array By Parity II | [Go]({{< relref "/ChapterFour/0922.Sort-Array-By-Parity-II.md" >}})| Easy | O(n)| O(1) ||
+|969. Pancake Sorting | [Go]({{< relref "/ChapterFour/0969.Pancake-Sorting.md" >}})| Medium | O(n log n)| O(log n) |❤️|
+|973. K Closest Points to Origin | [Go]({{< relref "/ChapterFour/0973.K-Closest-Points-to-Origin.md" >}})| Medium | O(n log n)| O(log n) ||
+|976. Largest Perimeter Triangle | [Go]({{< relref "/ChapterFour/0976.Largest-Perimeter-Triangle.md" >}})| Easy | O(n log n)| O(log n) ||
+|1030. Matrix Cells in Distance Order | [Go]({{< relref "/ChapterFour/1030.Matrix-Cells-in-Distance-Order.md" >}})| Easy | O(n^2)| O(1) ||
+|1054. Distant Barcodes | [Go]({{< relref "/ChapterFour/1054.Distant-Barcodes.md" >}})| Medium | O(n log n)| O(log n) |❤️|
\ No newline at end of file
diff --git a/ctl/meta/Stack b/ctl/meta/Stack
new file mode 100644
index 000000000..a145368c2
--- /dev/null
+++ b/ctl/meta/Stack
@@ -0,0 +1,37 @@
+|20. Valid Parentheses | [Go]({{< relref "/ChapterFour/0020.Valid-Parentheses.md" >}})| Easy | O(log n)| O(1)||
+|42. Trapping Rain Water | [Go]({{< relref "/ChapterFour/0042.Trapping-Rain-Water.md" >}})| Hard | O(n)| O(1)|❤️|
+|71. Simplify Path | [Go]({{< relref "/ChapterFour/0071.Simplify-Path.md" >}})| Medium | O(n)| O(n)|❤️|
+|84. Largest Rectangle in Histogram | [Go]({{< relref "/ChapterFour/0084.Largest-Rectangle-in-Histogram.md" >}})| Medium | O(n)| O(n)|❤️|
+|94. Binary Tree Inorder Traversal | [Go]({{< relref "/ChapterFour/0094.Binary-Tree-Inorder-Traversal.md" >}})| Medium | O(n)| O(1)||
+|103. Binary Tree Zigzag Level Order Traversal | [Go]({{< relref "/ChapterFour/0103.Binary-Tree-Zigzag-Level-Order-Traversal.md" >}})| Medium | O(n)| O(n)||
+|144. Binary Tree Preorder Traversal | [Go]({{< relref "/ChapterFour/0144.Binary-Tree-Preorder-Traversal.md" >}})| Medium | O(n)| O(1)||
+|145. Binary Tree Postorder Traversal | [Go]({{< relref "/ChapterFour/0145.Binary-Tree-Postorder-Traversal.md" >}})| Hard | O(n)| O(1)||
+|150. Evaluate Reverse Polish Notation | [Go]({{< relref "/ChapterFour/0150.Evaluate-Reverse-Polish-Notation.md" >}})| Medium | O(n)| O(1)||
+|155. Min Stack | [Go]({{< relref "/ChapterFour/0155.Min-Stack.md" >}})| Easy | O(n)| O(n)||
+|173. Binary Search Tree Iterator | [Go]({{< relref "/ChapterFour/0173.Binary-Search-Tree-Iterator.md" >}})| Medium | O(n)| O(1)||
+|224. Basic Calculator | [Go]({{< relref "/ChapterFour/0224.Basic-Calculator.md" >}})| Hard | O(n)| O(n)||
+|225. Implement Stack using Queues | [Go]({{< relref "/ChapterFour/0225.Implement-Stack-using-Queues.md" >}})| Easy | O(n)| O(n)||
+|232. Implement Queue using Stacks | [Go]({{< relref "/ChapterFour/0232.Implement-Queue-using-Stacks.md" >}})| Easy | O(n)| O(n)||
+|331. Verify Preorder Serialization of a Binary Tree | [Go]({{< relref "/ChapterFour/0331.Verify-Preorder-Serialization-of-a-Binary-Tree.md" >}})| Medium | O(n)| O(1)||
+|394. Decode String | [Go]({{< relref "/ChapterFour/0394.Decode-String.md" >}})| Medium | O(n)| O(n)||
+|402. Remove K Digits | [Go]({{< relref "/ChapterFour/0402.Remove-K-Digits.md" >}})| Medium | O(n)| O(1)||
+|456. 132 Pattern | [Go]({{< relref "/ChapterFour/0456.132-Pattern.md" >}})| Medium | O(n)| O(n)||
+|496. Next Greater Element I | [Go]({{< relref "/ChapterFour/0496.Next-Greater-Element-I.md" >}})| Easy | O(n)| O(n)||
+|503. Next Greater Element II | [Go]({{< relref "/ChapterFour/0503.Next-Greater-Element-II.md" >}})| Medium | O(n)| O(n)||
+|636. Exclusive Time of Functions | [Go]({{< relref "/ChapterFour/0636.Exclusive-Time-of-Functions.md" >}})| Medium | O(n)| O(n)||
+|682. Baseball Game | [Go]({{< relref "/ChapterFour/0682.Baseball-Game.md" >}})| Easy | O(n)| O(n)||
+|726. Number of Atoms | [Go]({{< relref "/ChapterFour/0726.Number-of-Atoms.md" >}})| Hard | O(n)| O(n) |❤️|
+|735. Asteroid Collision | [Go]({{< relref "/ChapterFour/0735.Asteroid-Collision.md" >}})| Medium | O(n)| O(n) ||
+|739. Daily Temperatures | [Go]({{< relref "/ChapterFour/0739.Daily-Temperatures.md" >}})| Medium | O(n)| O(n) ||
+|844. Backspace String Compare | [Go]({{< relref "/ChapterFour/0844.Backspace-String-Compare.md" >}})| Easy | O(n)| O(n) ||
+|856. Score of Parentheses | [Go]({{< relref "/ChapterFour/0856.Score-of-Parentheses.md" >}})| Medium | O(n)| O(n)||
+|880. Decoded String at Index | [Go]({{< relref "/ChapterFour/0880.Decoded-String-at-Index.md" >}})| Medium | O(n)| O(n)||
+|895. Maximum Frequency Stack | [Go]({{< relref "/ChapterFour/0895.Maximum-Frequency-Stack.md" >}})| Hard | O(n)| O(n) ||
+|901. Online Stock Span | [Go]({{< relref "/ChapterFour/0901.Online-Stock-Span.md" >}})| Medium | O(n)| O(n) ||
+|907. Sum of Subarray Minimums | [Go]({{< relref "/ChapterFour/0907.Sum-of-Subarray-Minimums.md" >}})| Medium | O(n)| O(n)|❤️|
+|921. Minimum Add to Make Parentheses Valid | [Go]({{< relref "/ChapterFour/0921.Minimum-Add-to-Make-Parentheses-Valid.md" >}})| Medium | O(n)| O(n)||
+|946. Validate Stack Sequences | [Go]({{< relref "/ChapterFour/0946.Validate-Stack-Sequences.md" >}})| Medium | O(n)| O(n)||
+|1003. Check If Word Is Valid After Substitutions | [Go]({{< relref "/ChapterFour/1003.Check-If-Word-Is-Valid-After-Substitutions.md" >}})| Medium | O(n)| O(1)||
+|1019. Next Greater Node In Linked List | [Go]({{< relref "/ChapterFour/1019.Next-Greater-Node-In-Linked-List.md" >}})| Medium | O(n)| O(1)||
+|1021. Remove Outermost Parentheses | [Go]({{< relref "/ChapterFour/1021.Remove-Outermost-Parentheses.md" >}})| Medium | O(n)| O(1)||
+|1047. Remove All Adjacent Duplicates In String | [Go]({{< relref "/ChapterFour/1047.Remove-All-Adjacent-Duplicates-In-String.md" >}})| Medium | O(n)| O(1)||
\ No newline at end of file
diff --git a/ctl/meta/String b/ctl/meta/String
new file mode 100644
index 000000000..e2d905f71
--- /dev/null
+++ b/ctl/meta/String
@@ -0,0 +1,20 @@
+|3. Longest Substring Without Repeating Characters | [Go]({{< relref "/ChapterFour/0003.Longest-Substring-Without-Repeating-Characters.md" >}})| Medium | O(n)| O(1)|❤️|
+|17. Letter Combinations of a Phone Number | [Go]({{< relref "/ChapterFour/0017.Letter-Combinations-of-a-Phone-Number.md" >}})| Medium | O(log n)| O(1)||
+|20. Valid Parentheses | [Go]({{< relref "/ChapterFour/0020.Valid-Parentheses.md" >}})| Easy | O(log n)| O(1)||
+|22. Generate Parentheses | [Go]({{< relref "/ChapterFour/0022.Generate-Parentheses.md" >}})| Medium | O(log n)| O(1)||
+|28. Implement strStr() | [Go]({{< relref "/ChapterFour/0028.Implement-strStr.md" >}})| Easy | O(n)| O(1)||
+|30. Substring with Concatenation of All Words | [Go]({{< relref "/ChapterFour/0030.Substring-with-Concatenation-of-All-Words.md" >}})| Hard | O(n)| O(n)|❤️|
+|49. Group Anagrams | [Go]({{< relref "/ChapterFour/0049.Group-Anagrams.md" >}})| Medium | O(n log n)| O(n)||
+|71. Simplify Path | [Go]({{< relref "/ChapterFour/0071.Simplify-Path.md" >}})| Medium | O(n)| O(n)||
+|76. Minimum Window Substring | [Go]({{< relref "/ChapterFour/0076.Minimum-Window-Substring.md" >}})| Hard | O(n)| O(n)|❤️|
+|91. Decode Ways | [Go]({{< relref "/ChapterFour/0091.Decode-Ways.md" >}})| Medium | O(n)| O(n)||
+|93. Restore IP Addresses | [Go]({{< relref "/ChapterFour/0093.Restore-IP-Addresses.md" >}})| Medium | O(n)| O(n)|❤️|
+|125. Valid Palindrome | [Go]({{< relref "/ChapterFour/0125.Valid-Palindrome.md" >}})| Easy | O(n)| O(1)||
+|126. Word Ladder II | [Go]({{< relref "/ChapterFour/0126.Word-Ladder-II.md" >}})| Hard | O(n)| O(n^2)|❤️|
+|344. Reverse String | [Go]({{< relref "/ChapterFour/0344.Reverse-String.md" >}})| Easy | O(n)| O(1)||
+|345. Reverse Vowels of a String | [Go]({{< relref "/ChapterFour/0345.Reverse-Vowels-of-a-String.md" >}})| Easy | O(n)| O(1)||
+|767. Reorganize String | [Go]({{< relref "/ChapterFour/0767.Reorganize-String.md" >}})| Medium | O(n log n)| O(log n) |❤️|
+|842. Split Array into Fibonacci Sequence | [Go]({{< relref "/ChapterFour/0842.Split-Array-into-Fibonacci-Sequence.md" >}})| Medium | O(n^2)| O(1)|❤️|
+|856. Score of Parentheses | [Go]({{< relref "/ChapterFour/0856.Score-of-Parentheses.md" >}})| Medium | O(n)| O(n)||
+|925. Long Pressed Name | [Go]({{< relref "/ChapterFour/0925.Long-Pressed-Name.md" >}})| Easy | O(n)| O(1)||
+|1003. Check If Word Is Valid After Substitutions | [Go]({{< relref "/ChapterFour/1003.Check-If-Word-Is-Valid-After-Substitutions.md" >}})| Medium | O(n)| O(1)||
\ No newline at end of file
diff --git a/ctl/meta/Tree b/ctl/meta/Tree
new file mode 100644
index 000000000..ce2a837bb
--- /dev/null
+++ b/ctl/meta/Tree
@@ -0,0 +1,33 @@
+|94. Binary Tree Inorder Traversal | [Go]({{< relref "/ChapterFour/0094.Binary-Tree-Inorder-Traversal.md" >}})| Medium | O(n)| O(1)||
+|96. Unique Binary Search Trees | [Go]({{< relref "/ChapterFour/0096.Unique-Binary-Search-Trees.md" >}})| Medium | O(n^2)| O(n)||
+|98. Validate Binary Search Tree | [Go]({{< relref "/ChapterFour/0098.Validate-Binary-Search-Tree.md" >}})| Medium | O(n)| O(1)||
+|99. Recover Binary Search Tree | [Go]({{< relref "/ChapterFour/0099.Recover-Binary-Search-Tree.md" >}})| Hard | O(n)| O(1)||
+|100. Same Tree | [Go]({{< relref "/ChapterFour/0100.Same-Tree.md" >}})| Easy | O(n)| O(1)||
+|101. Symmetric Tree | [Go]({{< relref "/ChapterFour/0101.Symmetric-Tree.md" >}})| Easy | O(n)| O(1)||
+|102. Binary Tree Level Order Traversal | [Go]({{< relref "/ChapterFour/0102.Binary-Tree-Level-Order-Traversal.md" >}})| Medium | O(n)| O(1)||
+|103. Binary Tree Zigzag Level Order Traversal | [Go]({{< relref "/ChapterFour/0103.Binary-Tree-Zigzag-Level-Order-Traversal.md" >}})| Medium | O(n)| O(n)||
+|104. Maximum Depth of Binary Tree | [Go]({{< relref "/ChapterFour/0104.Maximum-Depth-of-Binary-Tree.md" >}})| Easy | O(n)| O(1)||
+|107. Binary Tree Level Order Traversal II | [Go]({{< relref "/ChapterFour/0107.Binary-Tree-Level-Order-Traversal-II.md" >}})| Easy | O(n)| O(1)||
+|108. Convert Sorted Array to Binary Search Tree | [Go]({{< relref "/ChapterFour/0108.Convert-Sorted-Array-to-Binary-Search-Tree.md" >}})| Easy | O(n)| O(1)||
+|110. Balanced Binary Tree | [Go]({{< relref "/ChapterFour/0110.Balanced-Binary-Tree.md" >}})| Easy | O(n)| O(1)||
+|111. Minimum Depth of Binary Tree | [Go]({{< relref "/ChapterFour/0111.Minimum-Depth-of-Binary-Tree.md" >}})| Easy | O(n)| O(1)||
+|112. Path Sum | [Go]({{< relref "/ChapterFour/0112.Path-Sum.md" >}})| Easy | O(n)| O(1)||
+|113. Path Sum II | [Go]({{< relref "/ChapterFour/0113.Path-Sum-II.md" >}})| Medium | O(n)| O(1)||
+|114. Flatten Binary Tree to Linked List | [Go]({{< relref "/ChapterFour/0114.Flatten-Binary-Tree-to-Linked-List.md" >}})| Medium | O(n)| O(1)||
+|124. Binary Tree Maximum Path Sum | [Go]({{< relref "/ChapterFour/0124.Binary-Tree-Maximum-Path-Sum.md" >}})| Hard | O(n)| O(1)||
+|129. Sum Root to Leaf Numbers | [Go]({{< relref "/ChapterFour/0129.Sum-Root-to-Leaf-Numbers.md" >}})| Medium | O(n)| O(1)||
+|144. Binary Tree Preorder Traversal | [Go]({{< relref "/ChapterFour/0144.Binary-Tree-Preorder-Traversal.md" >}})| Medium | O(n)| O(1)||
+|145. Binary Tree Postorder Traversal | [Go]({{< relref "/ChapterFour/0145.Binary-Tree-Postorder-Traversal.md" >}})| Hard | O(n)| O(1)||
+|173. Binary Search Tree Iterator | [Go]({{< relref "/ChapterFour/0173.Binary-Search-Tree-Iterator.md" >}})| Medium | O(n)| O(1)||
+|199. Binary Tree Right Side View | [Go]({{< relref "/ChapterFour/0199.Binary-Tree-Right-Side-View.md" >}})| Medium | O(n)| O(1)||
+|222. Count Complete Tree Nodes | [Go]({{< relref "/ChapterFour/0222.Count-Complete-Tree-Nodes.md" >}})| Medium | O(n)| O(1)||
+|226. Invert Binary Tree | [Go]({{< relref "/ChapterFour/0226.Invert-Binary-Tree.md" >}})| Easy | O(n)| O(1)||
+|230. Kth Smallest Element in a BST | [Go]({{< relref "/ChapterFour/0230.Kth-Smallest-Element-in-a-BST.md" >}})| Medium | O(n)| O(1)||
+|235. Lowest Common Ancestor of a Binary Search Tree | [Go]({{< relref "/ChapterFour/0235.Lowest-Common-Ancestor-of-a-Binary-Search-Tree.md" >}})| Easy | O(n)| O(1)||
+|236. Lowest Common Ancestor of a Binary Tree | [Go]({{< relref "/ChapterFour/0236.Lowest-Common-Ancestor-of-a-Binary-Tree.md" >}})| Medium | O(n)| O(1)||
+|257. Binary Tree Paths | [Go]({{< relref "/ChapterFour/0257.Binary-Tree-Paths.md" >}})| Easy | O(n)| O(1)||
+|404. Sum of Left Leaves | [Go]({{< relref "/ChapterFour/0404.Sum-of-Left-Leaves.md" >}})| Easy | O(n)| O(1)||
+|437. Path Sum III | [Go]({{< relref "/ChapterFour/0437.Path-Sum-III.md" >}})| Easy | O(n)| O(1)||
+|515. Find Largest Value in Each Tree Row | [Go]({{< relref "/ChapterFour/0515.Find-Largest-Value-in-Each-Tree-Row.md" >}})| Medium | O(n)| O(n)||
+|637. Average of Levels in Binary Tree | [Go]({{< relref "/ChapterFour/0637.Average-of-Levels-in-Binary-Tree.md" >}})| Easy | O(n)| O(n)||
+|993. Cousins in Binary Tree | [Go]({{< relref "/ChapterFour/0993.Cousins-in-Binary-Tree.md" >}})| Easy | O(n)| O(1)||
\ No newline at end of file
diff --git a/ctl/meta/Two_Pointers b/ctl/meta/Two_Pointers
new file mode 100644
index 000000000..2c238556f
--- /dev/null
+++ b/ctl/meta/Two_Pointers
@@ -0,0 +1,50 @@
+|3. Longest Substring Without Repeating Characters | [Go]({{< relref "/ChapterFour/0003.Longest-Substring-Without-Repeating-Characters.md" >}})| Medium | O(n)| O(1)|❤️|
+|11. Container With Most Water | [Go]({{< relref "/ChapterFour/0011.Container-With-Most-Water.md" >}})| Medium | O(n)| O(1)||
+|15. 3Sum | [Go]({{< relref "/ChapterFour/0015.3Sum.md" >}})| Medium | O(n^2)| O(n)|❤️|
+|16. 3Sum Closest | [Go]({{< relref "/ChapterFour/0016.3Sum-Closest.md" >}})| Medium | O(n^2)| O(1)|❤️|
+|18. 4Sum | [Go]({{< relref "/ChapterFour/0018.4Sum.md" >}})| Medium | O(n^3)| O(n^2)|❤️|
+|19. Remove Nth Node From End of List | [Go]({{< relref "/ChapterFour/0019.Remove-Nth-Node-From-End-of-List.md" >}})| Medium | O(n)| O(1)||
+|26. Remove Duplicates from Sorted Array | [Go]({{< relref "/ChapterFour/0026.Remove-Duplicates-from-Sorted-Array.md" >}})| Easy | O(n)| O(1)||
+|27. Remove Element | [Go]({{< relref "/ChapterFour/0027.Remove-Element.md" >}})| Easy | O(n)| O(1)||
+|28. Implement strStr() | [Go]({{< relref "/ChapterFour/0028.Implement-strStr.md" >}})| Easy | O(n)| O(1)||
+|30. Substring with Concatenation of All Words | [Go]({{< relref "/ChapterFour/0030.Substring-with-Concatenation-of-All-Words.md" >}})| Hard | O(n)| O(n)|❤️|
+|42. Trapping Rain Water | [Go]({{< relref "/ChapterFour/0042.Trapping-Rain-Water.md" >}})| Hard | O(n)| O(1)|❤️|
+|61. Rotate List | [Go]({{< relref "/ChapterFour/0061.Rotate-List.md" >}})| Medium | O(n)| O(1)||
+|75. Sort Colors | [Go]({{< relref "/ChapterFour/0075.Sort-Colors.md" >}})| Medium| O(n)| O(1)|❤️|
+|76. Minimum Window Substring | [Go]({{< relref "/ChapterFour/0076.Minimum-Window-Substring.md" >}})| Hard | O(n)| O(n)|❤️|
+|80. Remove Duplicates from Sorted Array II | [Go]({{< relref "/ChapterFour/0080.Remove-Duplicates-from-Sorted-Array-II.md" >}})| Medium | O(n)| O(1||
+|86. Partition List | [Go]({{< relref "/ChapterFour/0086.Partition-List.md" >}})| Medium | O(n)| O(1)|❤️|
+|88. Merge Sorted Array | [Go]({{< relref "/ChapterFour/0088.Merge-Sorted-Array.md" >}})| Easy | O(n)| O(1)|❤️|
+|125. Valid Palindrome | [Go]({{< relref "/ChapterFour/0125.Valid-Palindrome.md" >}})| Easy | O(n)| O(1)||
+|141. Linked List Cycle | [Go]({{< relref "/ChapterFour/0141.Linked-List-Cycle.md" >}})| Easy | O(n)| O(1)|❤️|
+|142. Linked List Cycle II | [Go]({{< relref "/ChapterFour/0142.Linked-List-Cycle-II.md" >}})| Medium | O(n)| O(1)|❤️|
+|167. Two Sum II - Input array is sorted | [Go]({{< relref "/ChapterFour/0167.Two-Sum-II---Input-array-is-sorted.md" >}})| Easy | O(n)| O(1)||
+|209. Minimum Size Subarray Sum | [Go]({{< relref "/ChapterFour/0209.Minimum-Size-Subarray-Sum.md" >}})| Medium | O(n)| O(1)||
+|234. Palindrome Linked List | [Go]({{< relref "/ChapterFour/0234.Palindrome-Linked-List.md" >}})| Easy | O(n)| O(1)||
+|283. Move Zeroes | [Go]({{< relref "/ChapterFour/0283.Move-Zeroes.md" >}})| Easy | O(n)| O(1)||
+|287. Find the Duplicate Number | [Go]({{< relref "/ChapterFour/0287.Find-the-Duplicate-Number.md" >}})| Easy | O(n)| O(1)|❤️|
+|344. Reverse String | [Go]({{< relref "/ChapterFour/0344.Reverse-String.md" >}})| Easy | O(n)| O(1)||
+|345. Reverse Vowels of a String | [Go]({{< relref "/ChapterFour/0345.Reverse-Vowels-of-a-String.md" >}})| Easy | O(n)| O(1)||
+|349. Intersection of Two Arrays | [Go]({{< relref "/ChapterFour/0349.Intersection-of-Two-Arrays.md" >}})| Easy | O(n)| O(n) ||
+|350. Intersection of Two Arrays II | [Go]({{< relref "/ChapterFour/0350.Intersection-of-Two-Arrays-II.md" >}})| Easy | O(n)| O(n) ||
+|424. Longest Repeating Character Replacement | [Go]({{< relref "/ChapterFour/0424.Longest-Repeating-Character-Replacement.md" >}})| Medium | O(n)| O(1) ||
+|524. Longest Word in Dictionary through Deleting | [Go]({{< relref "/ChapterFour/0524.Longest-Word-in-Dictionary-through-Deleting.md" >}})| Medium | O(n)| O(1) ||
+|532. K-diff Pairs in an Array | [Go]({{< relref "/ChapterFour/0532.K-diff-Pairs-in-an-Array.md" >}})| Easy | O(n)| O(n)||
+|567. Permutation in String | [Go]({{< relref "/ChapterFour/0567.Permutation-in-String.md" >}})| Medium | O(n)| O(1)|❤️|
+|713. Subarray Product Less Than K | [Go]({{< relref "/ChapterFour/0713.Subarray-Product-Less-Than-K.md" >}})| Medium | O(n)| O(1)||
+|763. Partition Labels | [Go]({{< relref "/ChapterFour/0763.Partition-Labels.md" >}})| Medium | O(n)| O(1)|❤️|
+|826. Most Profit Assigning Work | [Go]({{< relref "/ChapterFour/0826.Most-Profit-Assigning-Work.md" >}})| Medium | O(n log n)| O(n)||
+|828. Count Unique Characters of All Substrings of a Given String | [Go]({{< relref "/ChapterFour/0828.Count-Unique-Characters-of-All-Substrings-of-a-Given-String.md" >}})| Hard | O(n)| O(1)|❤️|
+|838. Push Dominoes | [Go]({{< relref "/ChapterFour/0838.Push-Dominoes.md" >}})| Medium | O(n)| O(n)||
+|844. Backspace String Compare | [Go]({{< relref "/ChapterFour/0844.Backspace-String-Compare.md" >}})| Easy | O(n)| O(n) ||
+|845. Longest Mountain in Array | [Go]({{< relref "/ChapterFour/0845.Longest-Mountain-in-Array.md" >}})| Medium | O(n)| O(1) ||
+|881. Boats to Save People | [Go]({{< relref "/ChapterFour/0881.Boats-to-Save-People.md" >}})| Medium | O(n log n)| O(1) ||
+|904. Fruit Into Baskets | [Go]({{< relref "/ChapterFour/0904.Fruit-Into-Baskets.md" >}})| Medium | O(n log n)| O(1) ||
+|923. 3Sum With Multiplicity | [Go]({{< relref "/ChapterFour/0923.3Sum-With-Multiplicity.md" >}})| Medium | O(n^2)| O(n) ||
+|925. Long Pressed Name | [Go]({{< relref "/ChapterFour/0925.Long-Pressed-Name.md" >}})| Easy | O(n)| O(1)||
+|930. Binary Subarrays With Sum | [Go]({{< relref "/ChapterFour/0930.Binary-Subarrays-With-Sum.md" >}})| Medium | O(n)| O(n) |❤️|
+|977. Squares of a Sorted Array | [Go]({{< relref "/ChapterFour/0977.Squares-of-a-Sorted-Array.md" >}})| Easy | O(n)| O(1)||
+|986. Interval List Intersections | [Go]({{< relref "/ChapterFour/0986.Interval-List-Intersections.md" >}})| Medium | O(n)| O(1)||
+|992. Subarrays with K Different Integers | [Go]({{< relref "/ChapterFour/0992.Subarrays-with-K-Different-Integers.md" >}})| Hard | O(n)| O(n)|❤️|
+|1004. Max Consecutive Ones III | [Go]({{< relref "/ChapterFour/1004.Max-Consecutive-Ones-III.md" >}})| Medium | O(n)| O(1) ||
+|1093. Statistics from a Large Sample | [Go]({{< relref "/ChapterFour/1093.Statistics-from-a-Large-Sample.md" >}})| Medium | O(n)| O(1) ||
\ No newline at end of file
diff --git a/ctl/meta/Union_Find b/ctl/meta/Union_Find
new file mode 100644
index 000000000..66424cf4a
--- /dev/null
+++ b/ctl/meta/Union_Find
@@ -0,0 +1,18 @@
+|128. Longest Consecutive Sequence | [Go]({{< relref "/ChapterFour/0128.Longest-Consecutive-Sequence.md" >}})| Hard | O(n)| O(n)|❤️|
+|130. Surrounded Regions | [Go]({{< relref "/ChapterFour/0130.Surrounded-Regions.md" >}})| Medium | O(m\*n)| O(m\*n)||
+|200. Number of Islands | [Go]({{< relref "/ChapterFour/0200.Number-of-Islands.md" >}})| Medium | O(m\*n)| O(m\*n)||
+|399. Evaluate Division | [Go]({{< relref "/ChapterFour/0399.Evaluate-Division.md" >}})| Medium | O(n)| O(n)||
+|547. Number of Provinces | [Go]({{< relref "/ChapterFour/0547.Number-of-Provinces.md" >}})| Medium | O(n^2)| O(n)||
+|684. Redundant Connection | [Go]({{< relref "/ChapterFour/0684.Redundant-Connection.md" >}})| Medium | O(n)| O(n)||
+|685. Redundant Connection II | [Go]({{< relref "/ChapterFour/0685.Redundant-Connection-II.md" >}})| Hard | O(n)| O(n)||
+|721. Accounts Merge | [Go]({{< relref "/ChapterFour/0721.Accounts-Merge.md" >}})| Medium | O(n)| O(n)|❤️|
+|765. Couples Holding Hands | [Go]({{< relref "/ChapterFour/0765.Couples-Holding-Hands.md" >}})| Hard | O(n)| O(n)|❤️|
+|778. Swim in Rising Water | [Go]({{< relref "/ChapterFour/0778.Swim-in-Rising-Water.md" >}})| Hard | O(n^2)| O(n)|❤️|
+|803. Bricks Falling When Hit | [Go]({{< relref "/ChapterFour/0803.Bricks-Falling-When-Hit.md" >}})| Hard | O(n^2)| O(n)|❤️|
+|839. Similar String Groups | [Go]({{< relref "/ChapterFour/0839.Similar-String-Groups.md" >}})| Hard | O(n^2)| O(n)||
+|924. Minimize Malware Spread | [Go]({{< relref "/ChapterFour/0924.Minimize-Malware-Spread.md" >}})| Hard | O(m\*n)| O(n)||
+|928. Minimize Malware Spread II | [Go]({{< relref "/ChapterFour/0928.Minimize-Malware-Spread-II.md" >}})| Hard | O(m\*n)| O(n)|❤️|
+|947. Most Stones Removed with Same Row or Column | [Go]({{< relref "/ChapterFour/0947.Most-Stones-Removed-with-Same-Row-or-Column.md" >}})| Medium | O(n)| O(n)||
+|952. Largest Component Size by Common Factor | [Go]({{< relref "/ChapterFour/0952.Largest-Component-Size-by-Common-Factor.md" >}})| Hard | O(n)| O(n)|❤️|
+|959. Regions Cut By Slashes | [Go]({{< relref "/ChapterFour/0959.Regions-Cut-By-Slashes.md" >}})| Medium | O(n^2)| O(n^2)|❤️|
+|990. Satisfiability of Equality Equations | [Go]({{< relref "/ChapterFour/0990.Satisfiability-of-Equality-Equations.md" >}})| Medium | O(n)| O(n)||
\ No newline at end of file
diff --git a/ctl/meta/meta b/ctl/meta/meta
new file mode 100644
index 000000000..a28e1a67e
--- /dev/null
+++ b/ctl/meta/meta
@@ -0,0 +1,2 @@
+| Title | Solution | Difficulty | Time | Space |收藏|
+| ----- | :--------: | :----------: | :----: | :-----: | :-----: |
\ No newline at end of file
diff --git a/ctl/models/go.mod b/ctl/models/go.mod
new file mode 100644
index 000000000..2b1389a7f
--- /dev/null
+++ b/ctl/models/go.mod
@@ -0,0 +1,7 @@
+module github.com/halfrost/LeetCode-Go/ctl/models
+
+go 1.19
+
+replace github.com/halfrost/LeetCode-Go/ctl/models => ../util
+
+require github.com/halfrost/LeetCode-Go/ctl/util v0.0.0-20220910225043-e3bb5aff34d0
diff --git a/ctl/models/go.sum b/ctl/models/go.sum
new file mode 100644
index 000000000..2c3eec0c9
--- /dev/null
+++ b/ctl/models/go.sum
@@ -0,0 +1,2 @@
+github.com/halfrost/LeetCode-Go/ctl/util v0.0.0-20220910225043-e3bb5aff34d0 h1:WAOAj59szR52uAnEQljAt7ucpbGGOsy0xgR/NeP4Xbc=
+github.com/halfrost/LeetCode-Go/ctl/util v0.0.0-20220910225043-e3bb5aff34d0/go.mod h1:+cA8KYcbGxP2Itd3NG+QJVGL/MEZISKlei0tvgDeEag=
diff --git a/ctl/models/lcproblems.go b/ctl/models/lcproblems.go
new file mode 100644
index 000000000..e73537d64
--- /dev/null
+++ b/ctl/models/lcproblems.go
@@ -0,0 +1,104 @@
+package models
+
+import (
+ "fmt"
+ "strings"
+)
+
+// LeetCodeProblemAll define
+type LeetCodeProblemAll struct {
+ UserName string `json:"user_name"`
+ NumSolved int32 `json:"num_solved"`
+ NumTotal int32 `json:"num_total"`
+ AcEasy int32 `json:"ac_easy"`
+ AcMedium int32 `json:"ac_medium"`
+ AcHard int32 `json:"ac_hard"`
+ StatStatusPairs []StatStatusPairs `json:"stat_status_pairs"`
+ FrequencyHigh float64 `json:"frequency_high"`
+ FrequencyMid float64 `json:"frequency_mid"`
+ CategorySlug string `json:"category_slug"`
+ AcEasyTotal int32
+ AcMediumTotal int32
+ AcHardTotal int32
+}
+
+// ConvertUserInfoModel define
+func ConvertUserInfoModel(lpa LeetCodeProblemAll) UserInfo {
+ info := UserInfo{}
+ info.UserName = lpa.UserName
+ info.NumSolved = lpa.NumSolved
+ info.NumTotal = lpa.NumTotal
+ info.AcEasy = lpa.AcEasy
+ info.AcMedium = lpa.AcMedium
+ info.AcHard = lpa.AcHard
+ info.FrequencyHigh = lpa.FrequencyHigh
+ info.FrequencyMid = lpa.FrequencyMid
+ info.CategorySlug = lpa.CategorySlug
+ return info
+}
+
+// StatStatusPairs define
+type StatStatusPairs struct {
+ Stat Stat `json:"stat"`
+ Status string `json:"status"`
+ Difficulty Difficulty `json:"difficulty"`
+ PaidOnly bool `json:"paid_only"`
+ IsFavor bool `json:"is_favor"`
+ Frequency float64 `json:"frequency"`
+ Progress float64 `json:"progress"`
+}
+
+// ConvertMdModelFromSsp define
+func ConvertMdModelFromSsp(problems []StatStatusPairs) []Mdrow {
+ mdrows := []Mdrow{}
+ for _, problem := range problems {
+ res := Mdrow{}
+ res.FrontendQuestionID = problem.Stat.FrontendQuestionID
+ res.QuestionTitle = strings.TrimSpace(problem.Stat.QuestionTitle)
+ res.QuestionTitleSlug = strings.TrimSpace(problem.Stat.QuestionTitleSlug)
+ res.Acceptance = fmt.Sprintf("%.1f%%", (problem.Stat.TotalAcs/problem.Stat.TotalSubmitted)*100)
+ res.Difficulty = DifficultyMap[problem.Difficulty.Level]
+ res.Frequency = fmt.Sprintf("%f", problem.Frequency)
+ mdrows = append(mdrows, res)
+ }
+ return mdrows
+}
+
+// ConvertMdModelFromIds define
+func ConvertMdModelFromIds(problemsMap map[int]StatStatusPairs, ids []int) []Mdrow {
+ mdrows := []Mdrow{}
+ for _, v := range ids {
+ res, problem := Mdrow{}, problemsMap[v]
+ res.FrontendQuestionID = problem.Stat.FrontendQuestionID
+ res.QuestionTitle = strings.TrimSpace(problem.Stat.QuestionTitle)
+ res.QuestionTitleSlug = strings.TrimSpace(problem.Stat.QuestionTitleSlug)
+ res.Acceptance = fmt.Sprintf("%.1f%%", (problem.Stat.TotalAcs/problem.Stat.TotalSubmitted)*100)
+ res.Difficulty = DifficultyMap[problem.Difficulty.Level]
+ res.Frequency = fmt.Sprintf("%f", problem.Frequency)
+ mdrows = append(mdrows, res)
+ }
+ return mdrows
+}
+
+// Stat define
+type Stat struct {
+ QuestionTitle string `json:"question__title"`
+ QuestionTitleSlug string `json:"question__title_slug"`
+ TotalAcs float64 `json:"total_acs"`
+ TotalSubmitted float64 `json:"total_submitted"`
+ Acceptance string
+ Difficulty string
+ FrontendQuestionID int32 `json:"frontend_question_id"`
+}
+
+// Difficulty define
+type Difficulty struct {
+ Level int32 `json:"level"`
+}
+
+// DifficultyMap define
+var DifficultyMap = map[int32]string{
+ 1: "Easy",
+ 2: "Medium",
+ 3: "Hard",
+}
diff --git a/ctl/models/mdrow.go b/ctl/models/mdrow.go
new file mode 100644
index 000000000..5ad90ec0e
--- /dev/null
+++ b/ctl/models/mdrow.go
@@ -0,0 +1,90 @@
+package models
+
+import (
+ "fmt"
+ "strings"
+)
+
+// Mdrow define
+type Mdrow struct {
+ FrontendQuestionID int32 `json:"question_id"`
+ QuestionTitle string `json:"question__title"`
+ QuestionTitleSlug string `json:"question__title_slug"`
+ SolutionPath string `json:"solution_path"`
+ Acceptance string `json:"acceptance"`
+ Difficulty string `json:"difficulty"`
+ Frequency string `json:"frequency"`
+}
+
+// GenerateMdRows define
+func GenerateMdRows(solutionIds []int, mdrows []Mdrow) {
+ mdMap := map[int]Mdrow{}
+ for _, row := range mdrows {
+ mdMap[int(row.FrontendQuestionID)] = row
+ }
+ for i := 0; i < len(solutionIds); i++ {
+ if row, ok := mdMap[solutionIds[i]]; ok {
+ s7 := standardizedTitle(row.QuestionTitle, row.FrontendQuestionID)
+ mdMap[solutionIds[i]] = Mdrow{
+ FrontendQuestionID: row.FrontendQuestionID,
+ QuestionTitle: strings.TrimSpace(row.QuestionTitle),
+ QuestionTitleSlug: row.QuestionTitleSlug,
+ SolutionPath: fmt.Sprintf("[Go](https://github.com/halfrost/leetcode-go/tree/master/leetcode/%v)", fmt.Sprintf("%04d.%v", solutionIds[i], s7)),
+ Acceptance: row.Acceptance,
+ Difficulty: row.Difficulty,
+ Frequency: row.Frequency,
+ }
+ } else {
+ fmt.Printf("序号不存在 len(solutionIds) = %v len(mdrows) = %v len(solutionIds) = %v solutionIds[i] = %v QuestionTitle = %v\n", len(solutionIds), len(mdrows), len(solutionIds), solutionIds[i], mdrows[solutionIds[i]-1].QuestionTitle)
+ }
+ }
+ for i := range mdrows {
+ mdrows[i] = Mdrow{
+ FrontendQuestionID: mdrows[i].FrontendQuestionID,
+ QuestionTitle: strings.TrimSpace(mdrows[i].QuestionTitle),
+ QuestionTitleSlug: mdrows[i].QuestionTitleSlug,
+ SolutionPath: mdMap[int(mdrows[i].FrontendQuestionID)].SolutionPath,
+ Acceptance: mdrows[i].Acceptance,
+ Difficulty: mdrows[i].Difficulty,
+ Frequency: mdrows[i].Frequency,
+ }
+ }
+ // fmt.Printf("mdrows = %v\n\n", mdrows)
+}
+
+// | 0001 | Two Sum | [Go](https://github.com/halfrost/leetcode-go/tree/master/leetcode/0001.Two-Sum)| 45.6% | Easy | |
+func (m Mdrow) tableLine() string {
+ return fmt.Sprintf("|%04d|%v|%v|%v|%v||\n", m.FrontendQuestionID, m.QuestionTitle, m.SolutionPath, m.Acceptance, m.Difficulty)
+}
+
+// SortByQuestionID define
+type SortByQuestionID []Mdrow
+
+func (a SortByQuestionID) Len() int { return len(a) }
+func (a SortByQuestionID) Swap(i, j int) { a[i], a[j] = a[j], a[i] }
+func (a SortByQuestionID) Less(i, j int) bool {
+ return a[i].FrontendQuestionID < a[j].FrontendQuestionID
+}
+
+// Mdrows define
+type Mdrows struct {
+ Mdrows []Mdrow
+}
+
+// | No. | Title | Solution | Acceptance | Difficulty | Frequency |
+// |:--------:|:--------------------------------------------------------------|:--------:|:--------:|:--------:|:--------:|
+func (mds Mdrows) table() string {
+ res := "| No. | Title | Solution | Acceptance | Difficulty | Frequency |\n"
+ res += "|:--------:|:--------------------------------------------------------------|:--------:|:--------:|:--------:|:--------:|\n"
+ for _, p := range mds.Mdrows {
+ res += p.tableLine()
+ }
+ // 加这一行是为了撑开整个表格
+ res += "|------------|-------------------------------------------------------|-------| ----------------| ---------------|-------------|"
+ return res
+}
+
+// AvailableTable define
+func (mds Mdrows) AvailableTable() string {
+ return mds.table()
+}
diff --git a/ctl/models/tagproblem.go b/ctl/models/tagproblem.go
new file mode 100644
index 000000000..5bc04ab8c
--- /dev/null
+++ b/ctl/models/tagproblem.go
@@ -0,0 +1,284 @@
+package models
+
+import (
+ "encoding/json"
+ "fmt"
+ "strconv"
+ "strings"
+
+ "github.com/halfrost/LeetCode-Go/ctl/util"
+)
+
+// Graphql define
+type Graphql struct {
+ OperationName string `json:"operationName"`
+ Variables struct {
+ TitleSlug string `json:"titleSlug"`
+ } `json:"variables"`
+ Query string `json:"query"`
+}
+
+// GraphQLResp define
+type GraphQLResp struct {
+ Data struct {
+ TopicTag TopicTag `json:"topicTag"`
+ FavoritesLists FavoritesLists `json:"favoritesLists"`
+ } `json:"data"`
+}
+
+// TopicTag define
+type TopicTag struct {
+ Name string `json:"name"`
+ TranslatedName string `json:"translatedName"`
+ Slug string `json:"slug"`
+ Questions []Question `json:"questions"`
+ Frequencies string `json:"frequencies"`
+ Typename string `json:"__typename"`
+}
+
+// Question define
+type Question struct {
+ Status string `json:"status"`
+ QuestionID string `json:"questionId"`
+ QuestionFrontendID string `json:"questionFrontendId"`
+ Title string `json:"title"`
+ TitleSlug string `json:"titleSlug"`
+ TranslatedTitle string `json:"translatedTitle"`
+ Stats string `json:"stats"`
+ Difficulty string `json:"difficulty"`
+ TopicTags []TopicTags `json:"topicTags"`
+ CompanyTags interface{} `json:"companyTags"`
+ Typename string `json:"__typename"`
+}
+
+// TopicTags define
+type TopicTags struct {
+ Name string `json:"name"`
+ TranslatedName string `json:"translatedName"`
+ Slug string `json:"slug"`
+ Typename string `json:"__typename"`
+}
+
+func (q Question) generateTagStatus() (TagStatus, error) {
+ var ts TagStatus
+ err := json.Unmarshal([]byte(q.Stats), &ts)
+ if err != nil {
+ fmt.Println(err)
+ return ts, err
+ }
+ return ts, nil
+}
+
+// TagStatus define
+type TagStatus struct {
+ TotalAccepted string `json:"totalAccepted"`
+ TotalSubmission string `json:"totalSubmission"`
+ TotalAcceptedRaw int32 `json:"totalAcceptedRaw"`
+ TotalSubmissionRaw int32 `json:"totalSubmissionRaw"`
+ AcRate string `json:"acRate"`
+}
+
+// ConvertMdModelFromQuestions define
+func ConvertMdModelFromQuestions(questions []Question) []Mdrow {
+ mdrows := []Mdrow{}
+ for _, question := range questions {
+ res := Mdrow{}
+ v, _ := strconv.Atoi(question.QuestionFrontendID)
+ res.FrontendQuestionID = int32(v)
+ res.QuestionTitle = strings.TrimSpace(question.Title)
+ res.QuestionTitleSlug = strings.TrimSpace(question.TitleSlug)
+ q, err := question.generateTagStatus()
+ if err != nil {
+ fmt.Println(err)
+ }
+ res.Acceptance = q.AcRate
+ res.Difficulty = question.Difficulty
+ mdrows = append(mdrows, res)
+ }
+ return mdrows
+}
+
+// TagList define
+type TagList struct {
+ FrontendQuestionID int32 `json:"question_id"`
+ QuestionTitle string `json:"question__title"`
+ SolutionPath string `json:"solution_path"`
+ Acceptance string `json:"acceptance"`
+ Difficulty string `json:"difficulty"`
+ TimeComplexity string `json:"time_complexity"`
+ SpaceComplexity string `json:"space_complexity"`
+ Favorite string `json:"favorite"`
+}
+
+// | 0001 | Two Sum | [Go]({{< relref "/ChapterFour/0001.Two-Sum.md" >}})| Easy | O(n)| O(n)|❤️|50%|
+func (t TagList) tableLine() string {
+ return fmt.Sprintf("|%04d|%v|%v|%v|%v|%v|%v|%v|\n", t.FrontendQuestionID, t.QuestionTitle, t.SolutionPath, t.Difficulty, t.TimeComplexity, t.SpaceComplexity, t.Favorite, t.Acceptance)
+}
+
+func standardizedTitle(orig string, frontendQuestionID int32) string {
+ s0 := strings.TrimSpace(orig)
+ s1 := strings.Replace(s0, " ", "-", -1)
+ s2 := strings.Replace(s1, "'", "", -1)
+ s3 := strings.Replace(s2, "%", "", -1)
+ s4 := strings.Replace(s3, "(", "", -1)
+ s5 := strings.Replace(s4, ")", "", -1)
+ s6 := strings.Replace(s5, ",", "", -1)
+ s7 := strings.Replace(s6, "?", "", -1)
+ count := 0
+ // 去掉 --- 这种情况，这种情况是由于题目标题中包含 - ，左右有空格，左右一填充，造成了 ---，3 个 -
+ for i := 0; i < len(s7)-2; i++ {
+ if s7[i] == '-' && s7[i+1] == '-' && s7[i+2] == '-' {
+ fmt.Printf("【需要修正 --- 的标题是 %v】\n", fmt.Sprintf("%04d.%v", int(frontendQuestionID), s7))
+ s7 = s7[:i+1] + s7[i+3:]
+ count++
+ }
+ }
+ if count > 0 {
+ fmt.Printf("总共修正了 %v 个标题\n", count)
+ }
+ // 去掉 -- 这种情况，这种情况是由于题目标题中包含负号 -
+ for i := 0; i < len(s7)-2; i++ {
+ if s7[i] == '-' && s7[i+1] == '-' {
+ fmt.Printf("【需要修正 -- 的标题是 %v】\n", fmt.Sprintf("%04d.%v", int(frontendQuestionID), s7))
+ s7 = s7[:i+1] + s7[i+2:]
+ count++
+ }
+ }
+ if count > 0 {
+ fmt.Printf("总共修正了 %v 个标题\n", count)
+ }
+ return s7
+}
+
+// GenerateTagMdRows define
+func GenerateTagMdRows(solutionIds []int, metaMap map[int]TagList, mdrows []Mdrow, internal bool) []TagList {
+ tl := []TagList{}
+ for _, row := range mdrows {
+ if util.BinarySearch(solutionIds, int(row.FrontendQuestionID)) != -1 {
+ tmp := TagList{}
+ tmp.FrontendQuestionID = row.FrontendQuestionID
+ tmp.QuestionTitle = strings.TrimSpace(row.QuestionTitle)
+ s7 := standardizedTitle(row.QuestionTitle, row.FrontendQuestionID)
+ if internal {
+ tmp.SolutionPath = fmt.Sprintf("[Go]({{< relref \"/ChapterFour/%v/%v.md\" >}})", util.GetChpaterFourFileNum(int(row.FrontendQuestionID)), fmt.Sprintf("%04d.%v", int(row.FrontendQuestionID), s7))
+ } else {
+ tmp.SolutionPath = fmt.Sprintf("[Go](https://books.halfrost.com/leetcode/ChapterFour/%v/%v)", util.GetChpaterFourFileNum(int(row.FrontendQuestionID)), fmt.Sprintf("%04d.%v", int(row.FrontendQuestionID), s7))
+ }
+ tmp.Acceptance = row.Acceptance
+ tmp.Difficulty = row.Difficulty
+ tmp.TimeComplexity = metaMap[int(row.FrontendQuestionID)].TimeComplexity
+ tmp.SpaceComplexity = metaMap[int(row.FrontendQuestionID)].SpaceComplexity
+ tmp.Favorite = metaMap[int(row.FrontendQuestionID)].Favorite
+ tl = append(tl, tmp)
+ }
+ }
+ return tl
+}
+
+// TagLists define
+type TagLists struct {
+ TagLists []TagList
+}
+
+// | No. | Title | Solution | Difficulty | TimeComplexity | SpaceComplexity |Favorite| Acceptance |
+// |:--------:|:------- | :--------: | :----------: | :----: | :-----: | :-----: |:-----: |
+func (tls TagLists) table() string {
+ res := "| No. | Title | Solution | Difficulty | TimeComplexity | SpaceComplexity |Favorite| Acceptance |\n"
+ res += "|:--------:|:------- | :--------: | :----------: | :----: | :-----: | :-----: |:-----: |\n"
+ for _, p := range tls.TagLists {
+ res += p.tableLine()
+ }
+ // 加这一行是为了撑开整个表格
+ res += "|------------|-------------------------------------------------------|-------| ----------------| ---------------|-------------|-------------|-------------|"
+ return res
+}
+
+// AvailableTagTable define
+func (tls TagLists) AvailableTagTable() string {
+ return tls.table()
+}
+
+// FavoritesLists define
+type FavoritesLists struct {
+ PublicFavorites []int `json:"publicFavorites"`
+ PrivateFavorites []struct {
+ IDHash string `json:"idHash"`
+ ID string `json:"id"`
+ Name string `json:"name"`
+ IsPublicFavorite bool `json:"isPublicFavorite"`
+ ViewCount int `json:"viewCount"`
+ Creator string `json:"creator"`
+ IsWatched bool `json:"isWatched"`
+ Questions []struct {
+ QuestionID string `json:"questionId"`
+ Title string `json:"title"`
+ TitleSlug string `json:"titleSlug"`
+ Typename string `json:"__typename"`
+ } `json:"questions"`
+ Typename string `json:"__typename"`
+ } `json:"privateFavorites"`
+ Typename string `json:"__typename"`
+}
+
+// Gproblem define
+type Gproblem struct {
+ QuestionID string `json:"questionId"`
+ QuestionFrontendID string `json:"questionFrontendId"`
+ BoundTopicID int `json:"boundTopicId"`
+ Title string `json:"title"`
+ TitleSlug string `json:"titleSlug"`
+ Content string `json:"content"`
+ TranslatedTitle string `json:"translatedTitle"`
+ TranslatedContent string `json:"translatedContent"`
+ IsPaidOnly bool `json:"isPaidOnly"`
+ Difficulty string `json:"difficulty"`
+ Likes int `json:"likes"`
+ Dislikes int `json:"dislikes"`
+ IsLiked interface{} `json:"isLiked"`
+ SimilarQuestions string `json:"similarQuestions"`
+ Contributors []interface{} `json:"contributors"`
+ LangToValidPlayground string `json:"langToValidPlayground"`
+ TopicTags []struct {
+ Name string `json:"name"`
+ Slug string `json:"slug"`
+ TranslatedName string `json:"translatedName"`
+ Typename string `json:"__typename"`
+ } `json:"topicTags"`
+ CompanyTagStats interface{} `json:"companyTagStats"`
+ CodeSnippets []GcodeSnippet `json:"codeSnippets"`
+ Stats string `json:"stats"`
+ Hints []interface{} `json:"hints"`
+ Solution interface{} `json:"solution"`
+ Status interface{} `json:"status"`
+ SampleTestCase string `json:"sampleTestCase"`
+ MetaData string `json:"metaData"`
+ JudgerAvailable bool `json:"judgerAvailable"`
+ JudgeType string `json:"judgeType"`
+ MysqlSchemas []interface{} `json:"mysqlSchemas"`
+ EnableRunCode bool `json:"enableRunCode"`
+ EnableTestMode bool `json:"enableTestMode"`
+ EnvInfo string `json:"envInfo"`
+ Typename string `json:"__typename"`
+}
+
+// Gstat define
+type Gstat struct {
+ TotalAcs int `json:"total_acs"`
+ QuestionTitle string `json:"question__title"`
+ IsNewQuestion bool `json:"is_new_question"`
+ QuestionArticleSlug string `json:"question__article__slug"`
+ TotalSubmitted int `json:"total_submitted"`
+ FrontendQuestionID int `json:"frontend_question_id"`
+ QuestionTitleSlug string `json:"question__title_slug"`
+ QuestionArticleLive bool `json:"question__article__live"`
+ QuestionHide bool `json:"question__hide"`
+ QuestionID int `json:"question_id"`
+}
+
+// GcodeSnippet define
+type GcodeSnippet struct {
+ Lang string `json:"lang"`
+ LangSlug string `json:"langSlug"`
+ Code string `json:"code"`
+ Typename string `json:"__typename"`
+}
diff --git a/ctl/models/user.go b/ctl/models/user.go
new file mode 100644
index 000000000..d79dc6d5f
--- /dev/null
+++ b/ctl/models/user.go
@@ -0,0 +1,44 @@
+package models
+
+import (
+ "fmt"
+)
+
+// UserInfo define
+type UserInfo struct {
+ UserName string `json:"user_name"`
+ NumSolved int32 `json:"num_solved"`
+ NumTotal int32 `json:"num_total"`
+ AcEasy int32 `json:"ac_easy"`
+ AcMedium int32 `json:"ac_medium"`
+ AcHard int32 `json:"ac_hard"`
+ EasyTotal int32
+ MediumTotal int32
+ HardTotal int32
+ OptimizingEasy int32
+ OptimizingMedium int32
+ OptimizingHard int32
+ FrequencyHigh float64 `json:"frequency_high"`
+ FrequencyMid float64 `json:"frequency_mid"`
+ CategorySlug string `json:"category_slug"`
+}
+
+// | | Easy | Medium | Hard | Total | optimizing |
+// |:--------:|:--------------------------------------------------------------|:--------:|:--------:|:--------:|:--------:|
+func (ui UserInfo) table() string {
+ res := "| | Easy | Medium | Hard | Total |\n"
+ res += "|:--------:|:--------:|:--------:|:--------:|:--------:|\n"
+ res += fmt.Sprintf("|Optimizing|%v|%v|%v|%v|\n", ui.OptimizingEasy, ui.OptimizingMedium, ui.OptimizingHard, ui.OptimizingEasy+ui.OptimizingMedium+ui.OptimizingHard)
+ res += fmt.Sprintf("|Accepted|**%v**|**%v**|**%v**|**%v**|\n", ui.AcEasy, ui.AcMedium, ui.AcHard, ui.AcEasy+ui.AcMedium+ui.AcHard)
+ res += fmt.Sprintf("|Total|%v|%v|%v|%v|\n", ui.EasyTotal, ui.MediumTotal, ui.HardTotal, ui.EasyTotal+ui.MediumTotal+ui.HardTotal)
+ res += fmt.Sprintf("|Perfection Rate|%.1f%%|%.1f%%|%.1f%%|%.1f%%|\n", (1-float64(ui.OptimizingEasy)/float64(ui.AcEasy))*100, (1-float64(ui.OptimizingMedium)/float64(ui.AcMedium))*100, (1-float64(ui.OptimizingHard)/float64(ui.AcHard))*100, (1-float64(ui.OptimizingEasy+ui.OptimizingMedium+ui.OptimizingHard)/float64(ui.AcEasy+ui.AcMedium+ui.AcHard))*100)
+ res += fmt.Sprintf("|Completion Rate|%.1f%%|%.1f%%|%.1f%%|%.1f%%|\n", float64(ui.AcEasy)/float64(ui.EasyTotal)*100, float64(ui.AcMedium)/float64(ui.MediumTotal)*100, float64(ui.AcHard)/float64(ui.HardTotal)*100, float64(ui.AcEasy+ui.AcMedium+ui.AcHard)/float64(ui.EasyTotal+ui.MediumTotal+ui.HardTotal)*100)
+ // 加这一行是为了撑开整个表格
+ res += "|------------|----------------------------|----------------------------|----------------------------|----------------------------|"
+ return res
+}
+
+// PersonalData define
+func (ui UserInfo) PersonalData() string {
+ return ui.table()
+}
diff --git a/ctl/pdf.go b/ctl/pdf.go
new file mode 100644
index 000000000..d481df4c5
--- /dev/null
+++ b/ctl/pdf.go
@@ -0,0 +1,224 @@
+package main
+
+import (
+ "bufio"
+ "fmt"
+ "io"
+ "io/ioutil"
+ "os"
+ "regexp"
+ "strconv"
+ "strings"
+
+ "github.com/halfrost/LeetCode-Go/ctl/util"
+ "github.com/spf13/cobra"
+)
+
+var (
+ cleanString1 = "{{< columns >}}"
+ cleanString2 = "<--->"
+ cleanString3 = "{{< /columns >}}"
+ cleanString4 = "![\"logo\"](\"https://books.halfrost.com/leetcode/logo.png\"){kind=logo}
"
+ pdfPreface = `
+
+
+# 说明
+
+此版本是 https://books.halfrost.com/leetcode 网页的离线版，由于网页版实时会更新，所以此 PDF 版难免会有一些排版或者错别字。如果读者遇到了，可以到网页版相应页面，点击页面 edit 按钮，提交 pr 进行更改。此 PDF 版本号是 V%v.%v.%v。PDF 永久更新地址是 https://github.com/halfrost/leetcode-go/releases/，以版本号区分不同版本。笔者还是强烈推荐看在线版，有任何错误都会立即更新。如果觉得此书对刷题有一点点帮助，可以给此书点一个 star，鼓励一下笔者早点更新更多题解。
+
+> 版本号说明，V%v.%v.%v，%v 是大版本号，%v 代表当前题解中有几百题，目前是 %v 题，所以第二个版本号是 %v，%v 代表当前题解中有几十题，目前是 %v 题，所以第三个版本号是 %v 。
+
+# 目录
+
+[toc]
+
+`
+
+ majorVersion = 1
+ midVersion = 0
+ lastVersion = 0
+ totalSolutions = 0
+)
+
+func newPDFCommand() *cobra.Command {
+ cmd := &cobra.Command{
+ Use: "pdf",
+ Short: "PDF related commands",
+ Run: func(cmd *cobra.Command, args []string) {
+ generatePDF()
+ },
+ }
+ // cmd.Flags().StringVar(&alias, "alias", "", "alias")
+ // cmd.Flags().StringVar(&appId, "appid", "", "appid")
+ return cmd
+}
+
+func generatePDF() {
+ var (
+ pdf, tmp []byte
+ err error
+ )
+ // 先删除 pre-next
+ delPreNext()
+
+ chapterFourFileOrder, _ := util.LoadChapterFourDir()
+ totalSolutions = len(chapterFourFileOrder)
+ midVersion = totalSolutions / 100
+ lastVersion = totalSolutions % 100
+ fmt.Printf("[当前的版本号是 V%v.%v.%v]\n", majorVersion, midVersion, lastVersion)
+ // 删除原始文档中的头部，并创建临时文件夹
+ prepare(fmt.Sprintf("../PDF v%v.%v.%v.md", majorVersion, midVersion, lastVersion))
+ // PDF 前言
+ pdf = append(pdf, []byte(fmt.Sprintf(pdfPreface, majorVersion, midVersion, lastVersion, majorVersion, midVersion, lastVersion, majorVersion, midVersion, totalSolutions, midVersion, lastVersion, totalSolutions, lastVersion))...)
+ // PDF 第一章
+ tmp, err = loadChapter(chapterOneFileOrder, "./pdftemp", "ChapterOne")
+ pdf = append(pdf, tmp...)
+ // PDF 第二章
+ tmp, err = loadChapter(chapterTwoFileOrder, "./pdftemp", "ChapterTwo")
+ pdf = append(pdf, tmp...)
+ // PDF 第三章
+ tmp, err = loadChapter(chapterThreeFileOrder, "./pdftemp", "ChapterThree")
+ pdf = append(pdf, tmp...)
+ // PDF 第四章
+ tmp, err = util.LoadFile("./pdftemp/ChapterFour/_index.md")
+ pdf = append(pdf, tmp...)
+ tmp, err = loadChapter(chapterFourFileOrder, "../website/content", "ChapterFour")
+ pdf = append(pdf, tmp...)
+ if err != nil {
+ fmt.Println(err)
+ }
+ // 生成 PDF
+ util.WriteFile(fmt.Sprintf("../PDF v%v.%v.%v.md", majorVersion, midVersion, lastVersion), pdf)
+ // 还原现场
+ addPreNext()
+ util.DestoryDir("./pdftemp")
+}
+
+func loadChapter(order []string, path, chapter string) ([]byte, error) {
+ var (
+ res, tmp []byte
+ err error
+ )
+ for index, v := range order {
+ if chapter == "ChapterOne" && index == 0 {
+ // 清理不支持的特殊 MarkDown 语法
+ tmp, err = clean(fmt.Sprintf("%v/%v/%v.md", path, chapter, v))
+ } else {
+ if chapter == "ChapterFour" {
+ if v[4] == '.' {
+ num, err := strconv.Atoi(v[:4])
+ if err != nil {
+ fmt.Println(err)
+ }
+ tmp, err = util.LoadFile(fmt.Sprintf("%v/%v/%v/%v.md", path, chapter, util.GetChpaterFourFileNum(num), v))
+ }
+ } else {
+ tmp, err = util.LoadFile(fmt.Sprintf("%v/%v/%v.md", path, chapter, v))
+ }
+ }
+ if err != nil {
+ fmt.Println(err)
+ return []byte{}, err
+ }
+ res = append(res, tmp...)
+ }
+ return res, err
+}
+
+func prepare(path string) {
+ err := os.Remove(path)
+ if err != nil {
+ fmt.Println("pdf 还没有创建")
+ fmt.Println(err)
+ }
+ fmt.Println("pdf 删除成功，开始构建全新版本")
+
+ err = os.MkdirAll("./pdftemp/ChapterOne", os.ModePerm)
+ if err != nil {
+ fmt.Println(err)
+ }
+ for _, v := range chapterOneFileOrder {
+ removeHeader(fmt.Sprintf("../website/content/ChapterOne/%v.md", v), fmt.Sprintf("./pdftemp/ChapterOne/%v.md", v), 5)
+ }
+
+ err = os.MkdirAll("./pdftemp/ChapterTwo", os.ModePerm)
+ if err != nil {
+ fmt.Println(err)
+ }
+ // 生成外部链接的 ChapterTwo
+ buildChapterTwo(false)
+ util.CopyFile("./pdftemp/ChapterTwo/_index.md", "../website/content/ChapterTwo/_index.md")
+
+ for _, v := range chapterTwoFileOrder {
+ removeHeader(fmt.Sprintf("./pdftemp/ChapterTwo/%v.md", v), fmt.Sprintf("./pdftemp/ChapterTwo/%v.md", v), 5)
+ }
+
+ err = os.MkdirAll("./pdftemp/ChapterThree", os.ModePerm)
+ if err != nil {
+ fmt.Println(err)
+ }
+ for _, v := range chapterThreeFileOrder {
+ removeHeader(fmt.Sprintf("../website/content/ChapterThree/%v.md", v), fmt.Sprintf("./pdftemp/ChapterThree/%v.md", v), 5)
+ }
+
+ err = os.MkdirAll("./pdftemp/ChapterFour", os.ModePerm)
+ if err != nil {
+ fmt.Println(err)
+ }
+ removeHeader(fmt.Sprintf("../website/content/ChapterFour/_index.md"), fmt.Sprintf("./pdftemp/ChapterFour/_index.md"), 5)
+}
+
+func clean(filePath string) ([]byte, error) {
+ f, err := os.OpenFile(filePath, os.O_RDONLY, 0644)
+ if err != nil {
+ return nil, err
+ }
+ defer f.Close()
+ reader, output := bufio.NewReader(f), []byte{}
+ for {
+ line, _, err := reader.ReadLine()
+ if err != nil {
+ if err == io.EOF {
+ return output, nil
+ }
+ return nil, err
+ }
+ if ok, _ := regexp.Match(cleanString1, line); ok {
+ reg := regexp.MustCompile(cleanString1)
+ newByte := reg.ReplaceAll(line, []byte(""))
+ output = append(output, newByte...)
+ output = append(output, []byte("\n")...)
+ } else if ok, _ := regexp.Match(cleanString2, line); ok {
+ reg := regexp.MustCompile(cleanString2)
+ newByte := reg.ReplaceAll(line, []byte(""))
+ output = append(output, newByte...)
+ output = append(output, []byte("\n")...)
+ } else if ok, _ := regexp.Match(cleanString3, line); ok {
+ reg := regexp.MustCompile(cleanString3)
+ newByte := reg.ReplaceAll(line, []byte(""))
+ output = append(output, newByte...)
+ output = append(output, []byte("\n")...)
+ } else if ok, _ := regexp.Match(cleanString4, line); ok {
+ reg := regexp.MustCompile(cleanString4)
+ newByte := reg.ReplaceAll(line, []byte(""))
+ output = append(output, newByte...)
+ output = append(output, []byte("\n")...)
+ } else {
+ output = append(output, line...)
+ output = append(output, []byte("\n")...)
+ }
+ }
+}
+
+func removeHeader(path, newPath string, lineNumber int) {
+ file, err := ioutil.ReadFile(path)
+ if err != nil {
+ panic(err)
+ }
+ info, _ := os.Stat(path)
+ mode := info.Mode()
+ array := strings.Split(string(file), "\n")
+ array = array[lineNumber:]
+ ioutil.WriteFile(newPath, []byte(strings.Join(array, "\n")), mode)
+ //fmt.Println("remove line successful")
+}
diff --git a/ctl/rangking.go b/ctl/rangking.go
new file mode 100644
index 000000000..3e8196913
--- /dev/null
+++ b/ctl/rangking.go
@@ -0,0 +1,36 @@
+package main
+
+import (
+ "fmt"
+ "strconv"
+ "strings"
+)
+
+// getRanking 让这个方法优雅一点
+func getRanking() int {
+ // 获取网页数据
+ URL := fmt.Sprintf("https://leetcode.com/%s/", getConfig().Username)
+ data := getRaw(URL)
+ str := string(data)
+ // 通过不断裁剪 str 获取排名信息
+ fmt.Println(str)
+ i := strings.Index(str, "ng-init")
+ j := i + strings.Index(str[i:], "ng-cloak")
+ str = str[i:j]
+ i = strings.Index(str, "(")
+ j = strings.Index(str, ")")
+ str = str[i:j]
+ // fmt.Println("2\n", str)
+ strs := strings.Split(str, ",")
+ str = strs[6]
+ // fmt.Println("1\n", str)
+ i = strings.Index(str, "'")
+ j = 2 + strings.Index(str[2:], "'")
+ // fmt.Println("0\n", str)
+ str = str[i+1 : j]
+ r, err := strconv.Atoi(str)
+ if err != nil {
+ fmt.Printf("无法把 %s 转换成数字Ranking", str)
+ }
+ return r
+}
diff --git a/ctl/refresh.go b/ctl/refresh.go
new file mode 100644
index 000000000..501031a6a
--- /dev/null
+++ b/ctl/refresh.go
@@ -0,0 +1,27 @@
+package main
+
+import (
+ "github.com/spf13/cobra"
+)
+
+func newRefresh() *cobra.Command {
+ cmd := &cobra.Command{
+ Use: "refresh",
+ Short: "Refresh all document",
+ Run: func(cmd *cobra.Command, args []string) {
+ refresh()
+ },
+ }
+ // cmd.Flags().StringVar(&alias, "alias", "", "alias")
+ // cmd.Flags().StringVar(&appId, "appid", "", "appid")
+ return cmd
+}
+
+func refresh() {
+ //buildBookMenu()
+ copyLackFile()
+ delPreNext()
+ buildREADME()
+ buildChapterTwo(true)
+ addPreNext()
+}
diff --git a/ctl/render.go b/ctl/render.go
new file mode 100644
index 000000000..3e62a36eb
--- /dev/null
+++ b/ctl/render.go
@@ -0,0 +1,367 @@
+package main
+
+import (
+ "bufio"
+ "encoding/json"
+ "fmt"
+ "io"
+ "os"
+ "regexp"
+ "sort"
+ "strconv"
+ "strings"
+
+ m "github.com/halfrost/LeetCode-Go/ctl/models"
+ "github.com/halfrost/LeetCode-Go/ctl/util"
+ "github.com/spf13/cobra"
+)
+
+var (
+ chapterTwoList = []string{"Array", "String", "Two Pointers", "Linked List", "Stack", "Tree", "Dynamic Programming", "Backtracking", "Depth First Search", "Breadth First Search",
+ "Binary Search", "Math", "Hash Table", "Sorting", "Bit Manipulation", "Union Find", "Sliding Window", "Segment Tree", "Binary Indexed Tree"}
+ chapterTwoFileName = []string{"Array", "String", "Two_Pointers", "Linked_List", "Stack", "Tree", "Dynamic_Programming", "Backtracking", "Depth_First_Search", "Breadth_First_Search",
+ "Binary_Search", "Math", "Hash_Table", "Sorting", "Bit_Manipulation", "Union_Find", "Sliding_Window", "Segment_Tree", "Binary_Indexed_Tree"}
+ chapterTwoSlug = []string{"array", "string", "two-pointers", "linked-list", "stack", "tree", "dynamic-programming", "backtracking", "depth-first-search", "breadth-first-search",
+ "binary-search", "math", "hash-table", "sorting", "bit-manipulation", "union-find", "sliding-window", "segment-tree", "binary-indexed-tree"}
+)
+
+func newBuildCommand() *cobra.Command {
+ mc := &cobra.Command{
+ Use: "build
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+* [Array](#array)
+* [String](#string)
+* [✅ Two Pointers](#two-pointers)
+* [✅ Linked List](#linked-list)
+* [✅ Stack](#stack)
+* [Tree](#tree)
+* [Dynamic programming](#dynamic-programming)
+* [✅ Backtracking](#backtracking)
+* [Depth First Search](#depth-first-search)
+* [Breadth First Search](#breadth-first-search)
+* [Binary Search](#binary-search)
+* [Math](#math)
+* [Hash Table](#hash-table)
+* [✅ Sort](#sort)
+* [✅ Bit Manipulation](#bit-manipulation)
+* [✅ Union Find](#union-find)
+* [✅ Sliding Window](#sliding-window)
+* [✅ Segment Tree](#segment-tree)
+* [✅ Binary Indexed Tree](#binary-indexed-tree)
+
+
+
+
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
@@ -14,4 +15,11 @@ type: docs
题解慢慢更新中，欢迎大家提出更好的解法。点击页面下方的 edit，会跳转到 github 对应的页面 markdown 中，可以提交你的最优解 PR。
-让我们在题解的太空遨游吧~
\ No newline at end of file
+让我们在题解的太空遨游吧~
+
+
+----------------------------------------------
+
Hugo uses the excellent Go html/template library for its template engine. It is an extremely lightweight engine that provides a very small amount of logic. In our experience that it is just the right amount of logic to be able to create a good static website. If you have used other template systems from different languages or frameworks you will find a lot of similarities in Go templates. -This document is a brief primer on using Go templates. -...
Step 1. Install Hugo # Go to Hugo releases and download the appropriate version for your OS and architecture. -Save it somewhere specific as we will be using it in the next step. -More complete instructions are available at Install Hugo -Step 2. Build the Docs # Hugo has its own example site which happens to also be the documentation site you are reading right now. -Follow the following steps: -...
Hugo uses the excellent Go html/template library for its template engine. It is an extremely lightweight engine that provides a very small amount of logic. In our experience that it is just the right amount of logic to be able to create a good static website. If you have used other template systems from different languages or frameworks you will find a lot of similarities in Go templates. -This document is a brief primer on using Go templates. -...
Step 1. Install Hugo # Go to Hugo releases and download the appropriate version for your OS and architecture. -Save it somewhere specific as we will be using it in the next step. -More complete instructions are available at Install Hugo -Step 2. Build the Docs # Hugo has its own example site which happens to also be the documentation site you are reading right now. -Follow the following steps: -...
Inde aderam facti; Theseus vis de tauri illa peream. Oculos uberaque non -regisque vobis cursuque, opus venit quam vulnera. Et maiora necemque, lege modo; -gestanda nitidi, vero? Dum ne pectoraque testantur.
Venasque repulsa Samos qui, exspectatum eram animosque hinc, -aut -manes, Assyrii. Cupiens auctoribus -pariter rubet, profana magni super nocens. Vos ius sibilat inpar turba visae -iusto! Sedes ante dum superest extrema.
Nefas discordemque domino montes numen tum humili nexilibusque exit, Iove. Quae -miror esse, scelerisque Melaneus viribus. Miseri laurus. Hoc est proposita me -ante aliquid, aura inponere candidioribus quidque accendit bella, sumpta. -Intravit quam erat figentem hunc, motus de fontes parvo tempestate.
iscsi_virus = pitch(json_in_on(eupViral),
- northbridge_services_troubleshooting, personal(
- firmware_rw.trash_rw_crm.device(interactive_gopher_personal,
- software, -1), megabit, ergonomicsSoftware(cmyk_usb_panel,
- mips_whitelist_duplex, cpa)));
-if (5) {
- managementNetwork += dma - boolean;
- kilohertz_token = 2;
- honeypot_affiliate_ergonomics = fiber;
-}
-mouseNorthbridge = byte(nybble_xmp_modem.horse_subnet(
- analogThroughputService * graphicPoint, drop(daw_bit, dnsIntranet),
- gateway_ospf), repository.domain_key.mouse(serverData(fileNetwork,
- trim_duplex_file), cellTapeDirect, token_tooltip_mashup(
- ripcordingMashup)));
-module_it = honeypot_driver(client_cold_dvr(593902, ripping_frequency) +
- coreLog.joystick(componentUdpLink), windows_expansion_touchscreen);
-bashGigabit.external.reality(2, server_hardware_codec.flops.ebookSampling(
- ciscNavigationBacklink, table + cleanDriver), indexProtocolIsp);
-Lorem markdownum pavent auras, surgit nunc cingentibus libet Laomedonque que -est. Pastor -An arbor filia foedat, ne -fugit -aliter, per. Helicona illas et -callida neptem est Oresitrophos caput, dentibus est venit. Tenet reddite -famuli praesentem fortibus, quaeque vis foret si -frondes gelidos gravidae circumtulit -inpulit armenta -nativum.
Lorem markdownum arma ignoscas vocavit quoque ille texit mandata mentis ultimus, -frementes, qui in vel. Hippotades Peleus -pennas -conscia cuiquam Caeneus quas.
O fallor -in sustinui -iussorum equidem. -Nymphae operi oris alii fronde parens dumque, in auro ait mox ingenti proxima -iamdudum maius?
reality(burnDocking(apache_nanometer),
- pad.property_data_programming.sectorBrowserPpga(dataMask, 37,
- recycleRup));
-intellectualVaporwareUser += -5 * 4;
-traceroute_key_upnp /= lag_optical(android.smb(thyristorTftp));
-surge_host_golden = mca_compact_device(dual_dpi_opengl, 33,
- commerce_add_ppc);
-if (lun_ipv) {
- verticalExtranet(1, thumbnail_ttl, 3);
- bar_graphics_jpeg(chipset - sector_xmp_beta);
-}
-Acta cretus diem restet utque; move integer, oscula non inspirat, noctisque -scelus! Nantemque in suas vobis quamvis, et labori!
var runtimeDiskCompiler = home - array_ad_software;
-if (internic > disk) {
- emoticonLockCron += 37 + bps - 4;
- wan_ansi_honeypot.cardGigaflops = artificialStorageCgi;
- simplex -= downloadAccess;
-}
-var volumeHardeningAndroid = pixel + tftp + onProcessorUnmount;
-sector(memory(firewire + interlaced, wired));Lorem markdownum, a quoque nutu est quodcumque mandasset veluti. Passim -inportuna totidemque nympha fert; repetens pendent, poenarum guttura sed vacet -non, mortali undas. Omnis pharetramque gramen portentificisque membris servatum -novabis fallit de nubibus atque silvas mihi. Dixit repetitaque Quid; verrit -longa; sententia -mandat quascumque nescio -solebat -litore; noctes. Hostem haerentem circuit -plenaque tamen.
Locum nullus nisi vomentes. Ab Persea sermone vela, miratur aratro; eandem -Argolicas gener.
Nec dis certa fuit socer, Nonacria dies manet tacitaque sibi? Sucis est -iactata Castrumque iudex, et iactato quoque terraeque es tandem et maternos -vittis. Lumina litus bene poenamque animos callem ne tuas in leones illam dea -cadunt genus, et pleno nunc in quod. Anumque crescentesque sanguinis -progenies nuribus rustica tinguet. Pater -omnes liquido creditis noctem.
if (mirrored(icmp_dvd_pim, 3, smbMirroredHard) != lion(clickImportQueue,
- viralItunesBalancing, bankruptcy_file_pptp)) {
- file += ip_cybercrime_suffix;
-}
-if (runtimeSmartRom == netMarketingWord) {
- virusBalancingWin *= scriptPromptBespoke + raster(post_drive,
- windowsSli);
- cd = address_hertz_trojan;
- soap_ccd.pcbServerGigahertz(asp_hardware_isa, offlinePeopleware, nui);
-} else {
- megabyte.api = modem_flowchart - web + syntaxHalftoneAddress;
-}
-if (3 < mebibyteNetworkAnimated) {
- pharming_regular_error *= jsp_ribbon + algorithm * recycleMediaKindle(
- dvrSyntax, cdma);
- adf_sla *= hoverCropDrive;
- templateNtfs = -1 - vertical;
-} else {
- expressionCompressionVariable.bootMulti = white_eup_javascript(
- table_suffix);
- guidPpiPram.tracerouteLinux += rtfTerabyteQuicktime(1,
- managementRosetta(webcamActivex), 740874);
-}
-var virusTweetSsl = nullGigo;
-Sentiet et ferali errorem fessam, coercet superbus, Ascaniumque in pennis -mediis; dolor? Vidit imi Aeacon perfida propositos adde, tua Somni Fluctibus -errante lustrat non.
Tamen inde, vos videt e flammis Scythica parantem rupisque pectora umbras. Haec -ficta canistris repercusso simul ego aris Dixit! Esse Fama trepidare hunc -crescendo vigor ululasse vertice exspatiantur celer tepidique petita aversata -oculis iussa est me ferro.
Lorem markdownum partu paterno Achillem. Habent amne generosi aderant ad pellem -nec erat sustinet merces columque haec et, dixit minus nutrit accipiam subibis -subdidit. Temeraria servatum agros qui sed fulva facta. Primum ultima, dedit, -suo quisque linguae medentes fixo: tum petis.
Ora precari Patraeque Neptunia, dixit Danae -Cithaeron -armaque maxima in nati Coniugis templis -fluidove. Effugit usus nec ingreditur agmen ac manus conlato. Nullis vagis -nequiquam vultibus aliquos altera suum venis teneas fretum. Armos -remotis -hoc sine ferrea iuncta quam!
Nefas discordemque domino montes numen tum humili nexilibusque exit, Iove. Quae -miror esse, scelerisque Melaneus viribus. Miseri laurus. Hoc est proposita me -ante aliquid, aura inponere candidioribus quidque accendit bella, sumpta. -Intravit quam erat figentem hunc, motus de fontes parvo tempestate.
iscsi_virus = pitch(json_in_on(eupViral),
- northbridge_services_troubleshooting, personal(
- firmware_rw.trash_rw_crm.device(interactive_gopher_personal,
- software, -1), megabit, ergonomicsSoftware(cmyk_usb_panel,
- mips_whitelist_duplex, cpa)));
-if (5) {
- managementNetwork += dma - boolean;
- kilohertz_token = 2;
- honeypot_affiliate_ergonomics = fiber;
-}
-mouseNorthbridge = byte(nybble_xmp_modem.horse_subnet(
- analogThroughputService * graphicPoint, drop(daw_bit, dnsIntranet),
- gateway_ospf), repository.domain_key.mouse(serverData(fileNetwork,
- trim_duplex_file), cellTapeDirect, token_tooltip_mashup(
- ripcordingMashup)));
-module_it = honeypot_driver(client_cold_dvr(593902, ripping_frequency) +
- coreLog.joystick(componentUdpLink), windows_expansion_touchscreen);
-bashGigabit.external.reality(2, server_hardware_codec.flops.ebookSampling(
- ciscNavigationBacklink, table + cleanDriver), indexProtocolIsp);
-Frontis turba. Oculi gravis est Delphice; inque praedaque sanguine manu non.
if (ad_api) {
- zif += usb.tiffAvatarRate(subnet, digital_rt) + exploitDrive;
- gigaflops(2 - bluetooth, edi_asp_memory.gopher(queryCursor, laptop),
- panel_point_firmware);
- spyware_bash.statePopApplet = express_netbios_digital(
- insertion_troubleshooting.brouter(recordFolderUs), 65);
-}
-recursionCoreRay = -5;
-if (hub == non) {
- portBoxVirus = soundWeb(recursive_card(rwTechnologyLeopard),
- font_radcab, guidCmsScalable + reciprocalMatrixPim);
- left.bug = screenshot;
-} else {
- tooltipOpacity = raw_process_permalink(webcamFontUser, -1);
- executable_router += tape;
-}
-if (tft) {
- bandwidthWeb *= social_page;
-} else {
- regular += 611883;
- thumbnail /= system_lag_keyboard;
-}
-Inde aderam facti; Theseus vis de tauri illa peream. Oculos uberaque non -regisque vobis cursuque, opus venit quam vulnera. Et maiora necemque, lege modo; -gestanda nitidi, vero? Dum ne pectoraque testantur.
Venasque repulsa Samos qui, exspectatum eram animosque hinc, -aut -manes, Assyrii. Cupiens auctoribus -pariter rubet, profana magni super nocens. Vos ius sibilat inpar turba visae -iusto! Sedes ante dum superest extrema.
Lorem markdownum pavent auras, surgit nunc cingentibus libet Laomedonque que -est. Pastor -An arbor filia foedat, ne -fugit -aliter, per. Helicona illas et -callida neptem est Oresitrophos caput, dentibus est venit. Tenet reddite -famuli praesentem fortibus, quaeque vis foret si -frondes gelidos gravidae circumtulit -inpulit armenta -nativum.
Pectora et sine mulcere, coniuge dum tincta incurvae. Quis iam; est dextra -Peneosque, metuis a verba, primo. Illa sed colloque suis: magno: gramen, aera -excutiunt concipit.
Phrygiae petendo suisque extimuit, super, pars quod audet! Turba negarem. -Fuerat attonitus; et dextra retinet sidera ulnas undas instimulat vacuae -generis? Agnus dabat et ignotis dextera, sic tibi pacis feriente at mora -euhoeque comites hostem vestras Phineus. Vultuque sanguine dominoque -metuit -risi fama vergit summaque meus clarissimus -artesque tinguebat successor nominis cervice caelicolae.
Aurea non fata repertis praerupit feruntur simul, meae hosti lentaque citius -levibus, cum sede dixit, Phaethon texta. Albentibus summos multifidasque -iungitur loquendi an pectore, mihi ursaque omnia adfata, aeno parvumque in animi -perlucentes. Epytus agis ait vixque clamat ornum adversam spondet, quid sceptra -ipsum est. Reseret nec; saeva suo passu debentia linguam terga et aures et -cervix -de ubera. Coercet gelidumque manus, -doluit volvitur induta?
Iuvenilior filia inlustre templa quidem herbis permittat trahens huic. In -cruribus proceres sole crescitque fata, quos quos; merui maris se non tamen -in, mea.
Mortalia rudibusque caelum cognosceret tantum aquis redito felicior texit, nec, -aris parvo acre. Me parum contulerant multi tenentem, gratissime suis; vultum tu -occupat deficeret corpora, sonum. E Actaea inplevit Phinea concepit nomenque -potest sanguine captam nulla et, in duxisses campis non; mercede. Dicere cur -Leucothoen obitum?
Postibus mittam est nubibus principium pluma, exsecratur facta et. Iunge -Mnemonidas pallamque pars; vere restitit alis flumina quae quoque, est -ignara infestus Pyrrha. Di ducis terris maculatum At sede praemia manes -nullaque!
Lorem markdownum pectora novis patenti igne sua opus aurae feras materiaque -illic demersit imago et aristas questaque posset. Vomit quoque suo inhaesuro -clara. Esse cumque, per referri triste. Ut exponit solisque communis in tendens -vincetis agisque iamque huic bene ante vetat omina Thebae rates. Aeacus servat -admonitu concidit, ad resimas vultus et rugas vultu dignamque Siphnon.
Quam iugulum regia simulacra, plus meruit humo pecorumque haesit, ab discedunt -dixit: ritu pharetramque. Exul Laurenti orantem modo, per densum missisque labor -manibus non colla unum, obiectat. Tu pervia collo, fessus quae Cretenque Myconon -crate! Tegumenque quae invisi sudore per vocari quaque plus ventis fluidos. Nodo -perque, fugisse pectora sorores.
Quibus largis latebris aethera versato est, ait sentiat faciemque. Aequata alis -nec Caeneus exululat inclite corpus est, ire tibi ostendens et tibi. Rigent -et vires dique possent lumina; eadem dixit poma funeribus paret et felix -reddebant ventis utile lignum.
Vertitur mos ortu ramosam contudit dumque; placabat ac lumen. Coniunx Amoris -spatium poenamque cavernis Thebae Pleiadasque ponunt, rapiare cum quae parum -nimium rima.
Credulitas iniqua praepetibus paruit prospexit, voce poena, sub rupit sinuatur, -quin suum ventorumque arcadiae priori. Soporiferam erat formamque, fecit, -invergens, nymphae mutat fessas ait finge.
Ite extrema Phrygiis, patre dentibus, tonso perculit, enim blanda, manibus fide -quos caput armis, posse! Nocendo fas Alcyonae lacertis structa ferarum manus -fulmen dubius, saxa caelum effuge extremis fixum tumor adfecit bella, -potentes? Dum nec insidiosa tempora tegit -spirarunt. Per lupi pars foliis, -porreximus humum negant sunt subposuere Sidone steterant auro. Memoraverit sine: -ferrum idem Orion caelum heres gerebat fixis?
Columns help organize shorter pieces of content horizontally for readability.
{{< columns >}} <!-- begin columns block -->
-# Left Content
-Lorem markdownum insigne...
-
-<---> <!-- magic sparator, between columns -->
-
-# Mid Content
-Lorem markdownum insigne...
-
-<---> <!-- magic sparator, between columns -->
-
-# Right Content
-Lorem markdownum insigne...
-{{< /columns >}}
-Lorem markdownum insigne. Olympo signis Delphis! Retexi Nereius nova develat -stringit, frustra Saturnius uteroque inter! Oculis non ritibus Telethusa -protulit, sed sed aere valvis inhaesuro Pallas animam: qui quid, ignes. -Miseratus fonte Ditis conubia.
Lorem markdownum insigne. Olympo signis Delphis! Retexi Nereius nova develat -stringit, frustra Saturnius uteroque inter!
Lorem markdownum insigne. Olympo signis Delphis! Retexi Nereius nova develat -stringit, frustra Saturnius uteroque inter! Oculis non ritibus Telethusa -protulit, sed sed aere valvis inhaesuro Pallas animam: qui quid, ignes. -Miseratus fonte Ditis conubia.
Details shortcode is a helper for details html5 element. It is going to replace expand shortcode.
{{< details "Title" [open] >}}
-## Markdown content
-Lorem markdownum insigne...
-{{< /details >}}
-{{< details title="Title" open=true >}}
-## Markdown content
-Lorem markdownum insigne...
-{{< /details >}}
-Lorem markdownum insigne…
Expand shortcode can help to decrease clutter on screen by hiding part of text. Expand content by clicking on it.
{{< expand >}}
-## Markdown content
-Lorem markdownum insigne...
-{{< /expand >}}
-{{< expand "Custom Label" "..." >}}
-## Markdown content
-Lorem markdownum insigne...
-{{< /expand >}}
-Hint shortcode can be used as hint/alerts/notification block.
There are 3 colors to choose: info, warning and danger.
{{< hint [info|warning|danger] >}}
-**Markdown content**
-Lorem markdownum insigne. Olympo signis Delphis! Retexi Nereius nova develat
-stringit, frustra Saturnius uteroque inter! Oculis non ritibus Telethusa
-{{< /hint >}}
-Markdown content
Lorem markdownum insigne. Olympo signis Delphis! Retexi Nereius nova develat -stringit, frustra Saturnius uteroque inter! Oculis non ritibus Telethusa
Markdown content
Lorem markdownum insigne. Olympo signis Delphis! Retexi Nereius nova develat -stringit, frustra Saturnius uteroque inter! Oculis non ritibus Telethusa
Markdown content
Lorem markdownum insigne. Olympo signis Delphis! Retexi Nereius nova develat -stringit, frustra Saturnius uteroque inter! Oculis non ritibus Telethusa
KaTeX shortcode let you render math typesetting in markdown document. See -KaTeX
{{< katex [display] [class="text-center"] >}}
-f(x) = \int_{-\infty}^\infty\hat f(\xi)\,e^{2 \pi i \xi x}\,d\xi
-{{< /katex >}}
-Here is some inline example: \(\pi(x)\)
-, rendered in the same line. And below is display example, having display: block
-\[f(x) = \int_{-\infty}^\infty\hat f(\xi)\,e^{2 \pi i \xi x}\,d\xi\]
-Text continues here.
Mermaid is library for generating svg charts and diagrams from text.
{{< mermaid [class="text-center"]>}}
-sequenceDiagram
- Alice->>Bob: Hello Bob, how are you?
- alt is sick
- Bob->>Alice: Not so good :(
- else is well
- Bob->>Alice: Feeling fresh like a daisy
- end
- opt Extra response
- Bob->>Alice: Thanks for asking
- end
-{{< /mermaid >}}
-sequenceDiagram -Alice->>Bob: Hello Bob, how are you? -alt is sick -Bob->>Alice: Not so good :( -else is well -Bob->>Alice: Feeling fresh like a daisy -end -opt Extra response -Bob->>Alice: Thanks for asking -end
Tabs let you organize content by context, for example installation instructions for each supported platform.
{{< tabs "uniqueid" >}}
-{{< tab "MacOS" >}} # MacOS Content {{< /tab >}}
-{{< tab "Linux" >}} # Linux Content {{< /tab >}}
-{{< tab "Windows" >}} # Windows Content {{< /tab >}}
-{{< /tabs >}}
-This is tab MacOS content.
Lorem markdownum insigne. Olympo signis Delphis! Retexi Nereius nova develat -stringit, frustra Saturnius uteroque inter! Oculis non ritibus Telethusa -protulit, sed sed aere valvis inhaesuro Pallas animam: qui quid, ignes. -Miseratus fonte Ditis conubia.
This is tab Linux content.
Lorem markdownum insigne. Olympo signis Delphis! Retexi Nereius nova develat -stringit, frustra Saturnius uteroque inter! Oculis non ritibus Telethusa -protulit, sed sed aere valvis inhaesuro Pallas animam: qui quid, ignes. -Miseratus fonte Ditis conubia.
This is tab Windows content.
Lorem markdownum insigne. Olympo signis Delphis! Retexi Nereius nova develat -stringit, frustra Saturnius uteroque inter! Oculis non ritibus Telethusa -protulit, sed sed aere valvis inhaesuro Pallas animam: qui quid, ignes. -Miseratus fonte Ditis conubia.
Est in vagis et Pittheus tu arge accipiter regia iram vocatur nurus. Omnes ut -olivae sensit arma sorori deducit, inesset crudus, ego vetuere aliis, -modo arsit? Utinam rapta fiducia valuere litora adicit cursu, ad facies
Ea furtique risere fratres edidit terrae magis. Colla tam mihi tenebat: -miseram excita suadent es pecudes iam. Concilio quam velatus posset ait quod -nunc! Fragosis suae dextra geruntur functus vulgata.
Lorem markdownum emicat gestu. Cannis sol pressit ducta. Est Idaei, -tremens ausim se tutaeque, illi ulnis hausit, sed, lumina cutem. Quae avis -sequens!
var panel = ram_design;
-if (backup + system) {
- file.readPoint = network_native;
- sidebar_engine_device(cell_tftp_raster,
- dual_login_paper.adf_vci.application_reader_design(
- graphicsNvramCdma, lpi_footer_snmp, integer_model));
-}
-Idmoniae ripis, at aves, ali missa adest, ut et autem, et ab?