algorithm/LeetCode-Go
1
0
Fork 0
mirror of https://github.com/halfrost/LeetCode-Go.git synced 2025-07-12 14:41:34 +08:00
Code Issues Packages Projects Releases Wiki Activity

Update ctl

Browse Source
This commit is contained in:
YDZ
2021-01-27 13:48:45 +08:00
parent 2110901fa0
commit 8bef91a948
616 changed files with 1473 additions and 1989 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
website/content/ChapterFour/0001~0099/0001.Two-Sum.md
View File

@ -53,5 +53,5 @@ func twoSum(nums []int, target int) []int {
----------------------------------------------
<div style="display: flex;justify-content: space-between;align-items: center;">
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/">⬅️上一页</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0002.Add-Two-Numbers/">下一页➡️</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0001~0099/0002.Add-Two-Numbers/">下一页➡️</a></p>
</div>

4
website/content/ChapterFour/0001~0099/0002.Add-Two-Numbers.md
View File

@ -80,6 +80,6 @@ func addTwoNumbers(l1 *ListNode, l2 *ListNode) *ListNode {
----------------------------------------------
<div style="display: flex;justify-content: space-between;align-items: center;">
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0001.Two-Sum/">⬅️上一页</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0003.Longest-Substring-Without-Repeating-Characters/">下一页➡️</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0001~0099/0001.Two-Sum/">⬅️上一页</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0001~0099/0003.Longest-Substring-Without-Repeating-Characters/">下一页➡️</a></p>
</div>

4
website/content/ChapterFour/0001~0099/0003.Longest-Substring-Without-Repeating-Characters.md
View File

@ -126,6 +126,6 @@ func max(a int, b int) int {
----------------------------------------------
<div style="display: flex;justify-content: space-between;align-items: center;">
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0002.Add-Two-Numbers/">⬅️上一页</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0004.Median-of-Two-Sorted-Arrays/">下一页➡️</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0001~0099/0002.Add-Two-Numbers/">⬅️上一页</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0001~0099/0004.Median-of-Two-Sorted-Arrays/">下一页➡️</a></p>
</div>

4
website/content/ChapterFour/0001~0099/0004.Median-of-Two-Sorted-Arrays.md
View File

@ -100,6 +100,6 @@ func findMedianSortedArrays(nums1 []int, nums2 []int) float64 {
----------------------------------------------
<div style="display: flex;justify-content: space-between;align-items: center;">
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0003.Longest-Substring-Without-Repeating-Characters/">⬅️上一页</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0007.Reverse-Integer/">下一页➡️</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0001~0099/0003.Longest-Substring-Without-Repeating-Characters/">⬅️上一页</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0001~0099/0007.Reverse-Integer/">下一页➡️</a></p>
</div>

4
website/content/ChapterFour/0001~0099/0007.Reverse-Integer.md
View File

@ -57,6 +57,6 @@ func reverse7(x int) int {
----------------------------------------------
<div style="display: flex;justify-content: space-between;align-items: center;">
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0004.Median-of-Two-Sorted-Arrays/">⬅️上一页</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0009.Palindrome-Number/">下一页➡️</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0001~0099/0004.Median-of-Two-Sorted-Arrays/">⬅️上一页</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0001~0099/0009.Palindrome-Number/">下一页➡️</a></p>
</div>

4
website/content/ChapterFour/0001~0099/0009.Palindrome-Number.md
View File

@ -71,6 +71,6 @@ func isPalindrome(x int) bool {
----------------------------------------------
<div style="display: flex;justify-content: space-between;align-items: center;">
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0007.Reverse-Integer/">⬅️上一页</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0011.Container-With-Most-Water/">下一页➡️</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0001~0099/0007.Reverse-Integer/">⬅️上一页</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0001~0099/0011.Container-With-Most-Water/">下一页➡️</a></p>
</div>

4
website/content/ChapterFour/0001~0099/0011.Container-With-Most-Water.md
View File

@ -61,6 +61,6 @@ func maxArea(height []int) int {
----------------------------------------------
<div style="display: flex;justify-content: space-between;align-items: center;">
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0009.Palindrome-Number/">⬅️上一页</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0013.Roman-to-Integer/">下一页➡️</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0001~0099/0009.Palindrome-Number/">⬅️上一页</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0001~0099/0013.Roman-to-Integer/">下一页➡️</a></p>
</div>

4
website/content/ChapterFour/0001~0099/0013.Roman-to-Integer.md
View File

@ -134,6 +134,6 @@ func romanToInt(s string) int {
----------------------------------------------
<div style="display: flex;justify-content: space-between;align-items: center;">
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0011.Container-With-Most-Water/">⬅️上一页</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0015.3Sum/">下一页➡️</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0001~0099/0011.Container-With-Most-Water/">⬅️上一页</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0001~0099/0015.3Sum/">下一页➡️</a></p>
</div>

4
website/content/ChapterFour/0001~0099/0015.3Sum.md
View File

@ -120,6 +120,6 @@ func threeSum1(nums []int) [][]int {
----------------------------------------------
<div style="display: flex;justify-content: space-between;align-items: center;">
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0013.Roman-to-Integer/">⬅️上一页</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0016.3Sum-Closest/">下一页➡️</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0001~0099/0013.Roman-to-Integer/">⬅️上一页</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0001~0099/0016.3Sum-Closest/">下一页➡️</a></p>
</div>

4
website/content/ChapterFour/0001~0099/0016.3Sum-Closest.md
View File

@ -91,6 +91,6 @@ func abs(a int) int {
----------------------------------------------
<div style="display: flex;justify-content: space-between;align-items: center;">
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0015.3Sum/">⬅️上一页</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0017.Letter-Combinations-of-a-Phone-Number/">下一页➡️</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0001~0099/0015.3Sum/">⬅️上一页</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0001~0099/0017.Letter-Combinations-of-a-Phone-Number/">下一页➡️</a></p>
</div>

4
website/content/ChapterFour/0001~0099/0017.Letter-Combinations-of-a-Phone-Number.md
View File

@ -146,6 +146,6 @@ func letterFunc(res string, digits string) {
----------------------------------------------
<div style="display: flex;justify-content: space-between;align-items: center;">
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0016.3Sum-Closest/">⬅️上一页</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0018.4Sum/">下一页➡️</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0001~0099/0016.3Sum-Closest/">⬅️上一页</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0001~0099/0018.4Sum/">下一页➡️</a></p>
</div>

4
website/content/ChapterFour/0001~0099/0018.4Sum.md
View File

@ -99,6 +99,6 @@ func fourSum(nums []int, target int) [][]int {
----------------------------------------------
<div style="display: flex;justify-content: space-between;align-items: center;">
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0017.Letter-Combinations-of-a-Phone-Number/">⬅️上一页</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0019.Remove-Nth-Node-From-End-of-List/">下一页➡️</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0001~0099/0017.Letter-Combinations-of-a-Phone-Number/">⬅️上一页</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0001~0099/0019.Remove-Nth-Node-From-End-of-List/">下一页➡️</a></p>
</div>

4
website/content/ChapterFour/0001~0099/0019.Remove-Nth-Node-From-End-of-List.md
View File

@ -102,6 +102,6 @@ func removeNthFromEnd1(head *ListNode, n int) *ListNode {
----------------------------------------------
<div style="display: flex;justify-content: space-between;align-items: center;">
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0018.4Sum/">⬅️上一页</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0020.Valid-Parentheses/">下一页➡️</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0001~0099/0018.4Sum/">⬅️上一页</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0001~0099/0020.Valid-Parentheses/">下一页➡️</a></p>
</div>

4
website/content/ChapterFour/0001~0099/0020.Valid-Parentheses.md
View File

@ -98,6 +98,6 @@ func isValid(s string) bool {
----------------------------------------------
<div style="display: flex;justify-content: space-between;align-items: center;">
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0019.Remove-Nth-Node-From-End-of-List/">⬅️上一页</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0021.Merge-Two-Sorted-Lists/">下一页➡️</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0001~0099/0019.Remove-Nth-Node-From-End-of-List/">⬅️上一页</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0001~0099/0021.Merge-Two-Sorted-Lists/">下一页➡️</a></p>
</div>

4
website/content/ChapterFour/0001~0099/0021.Merge-Two-Sorted-Lists.md
View File

@ -55,6 +55,6 @@ func mergeTwoLists(l1 *ListNode, l2 *ListNode) *ListNode {
----------------------------------------------
<div style="display: flex;justify-content: space-between;align-items: center;">
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0020.Valid-Parentheses/">⬅️上一页</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0022.Generate-Parentheses/">下一页➡️</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0001~0099/0020.Valid-Parentheses/">⬅️上一页</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0001~0099/0022.Generate-Parentheses/">下一页➡️</a></p>
</div>

4
website/content/ChapterFour/0001~0099/0022.Generate-Parentheses.md
View File

@ -62,6 +62,6 @@ func findGenerateParenthesis(lindex, rindex int, str string, res *[]string) {
----------------------------------------------
<div style="display: flex;justify-content: space-between;align-items: center;">
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0021.Merge-Two-Sorted-Lists/">⬅️上一页</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0023.Merge-k-Sorted-Lists/">下一页➡️</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0001~0099/0021.Merge-Two-Sorted-Lists/">⬅️上一页</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0001~0099/0023.Merge-k-Sorted-Lists/">下一页➡️</a></p>
</div>

4
website/content/ChapterFour/0001~0099/0023.Merge-k-Sorted-Lists.md
View File

@ -76,6 +76,6 @@ func mergeTwoLists1(l1 *ListNode, l2 *ListNode) *ListNode {
----------------------------------------------
<div style="display: flex;justify-content: space-between;align-items: center;">
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0022.Generate-Parentheses/">⬅️上一页</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0024.Swap-Nodes-in-Pairs/">下一页➡️</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0001~0099/0022.Generate-Parentheses/">⬅️上一页</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0001~0099/0024.Swap-Nodes-in-Pairs/">下一页➡️</a></p>
</div>

4
website/content/ChapterFour/0001~0099/0024.Swap-Nodes-in-Pairs.md
View File

@ -73,6 +73,6 @@ func swapPairs(head *ListNode) *ListNode {
----------------------------------------------
<div style="display: flex;justify-content: space-between;align-items: center;">
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0023.Merge-k-Sorted-Lists/">⬅️上一页</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0025.Reverse-Nodes-in-k-Group/">下一页➡️</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0001~0099/0023.Merge-k-Sorted-Lists/">⬅️上一页</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0001~0099/0025.Reverse-Nodes-in-k-Group/">下一页➡️</a></p>
</div>

4
website/content/ChapterFour/0001~0099/0025.Reverse-Nodes-in-k-Group.md
View File

@ -76,6 +76,6 @@ func reverse(first *ListNode, last *ListNode) *ListNode {
----------------------------------------------
<div style="display: flex;justify-content: space-between;align-items: center;">
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0024.Swap-Nodes-in-Pairs/">⬅️上一页</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0026.Remove-Duplicates-from-Sorted-Array/">下一页➡️</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0001~0099/0024.Swap-Nodes-in-Pairs/">⬅️上一页</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0001~0099/0026.Remove-Duplicates-from-Sorted-Array/">下一页➡️</a></p>
</div>

4
website/content/ChapterFour/0001~0099/0026.Remove-Duplicates-from-Sorted-Array.md
View File

@ -130,6 +130,6 @@ func removeElement1(nums []int, start, val int) int {
----------------------------------------------
<div style="display: flex;justify-content: space-between;align-items: center;">
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0025.Reverse-Nodes-in-k-Group/">⬅️上一页</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0027.Remove-Element/">下一页➡️</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0001~0099/0025.Reverse-Nodes-in-k-Group/">⬅️上一页</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0001~0099/0027.Remove-Element/">下一页➡️</a></p>
</div>

4
website/content/ChapterFour/0001~0099/0027.Remove-Element.md
View File

@ -93,6 +93,6 @@ func removeElement(nums []int, val int) int {
----------------------------------------------
<div style="display: flex;justify-content: space-between;align-items: center;">
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0026.Remove-Duplicates-from-Sorted-Array/">⬅️上一页</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0028.Implement-strStr/">下一页➡️</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0001~0099/0026.Remove-Duplicates-from-Sorted-Array/">⬅️上一页</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0001~0099/0028.Implement-strStr/">下一页➡️</a></p>
</div>

4
website/content/ChapterFour/0001~0099/0028.Implement-strStr.md
View File

@ -88,6 +88,6 @@ func strStr1(haystack string, needle string) int {
----------------------------------------------
<div style="display: flex;justify-content: space-between;align-items: center;">
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0027.Remove-Element/">⬅️上一页</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0029.Divide-Two-Integers/">下一页➡️</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0001~0099/0027.Remove-Element/">⬅️上一页</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0001~0099/0029.Divide-Two-Integers/">下一页➡️</a></p>
</div>

4
website/content/ChapterFour/0001~0099/0029.Divide-Two-Integers.md
View File

@ -150,6 +150,6 @@ func divide1(divided int, divisor int) int {
----------------------------------------------
<div style="display: flex;justify-content: space-between;align-items: center;">
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0028.Implement-strStr/">⬅️上一页</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0030.Substring-with-Concatenation-of-All-Words/">下一页➡️</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0001~0099/0028.Implement-strStr/">⬅️上一页</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0001~0099/0030.Substring-with-Concatenation-of-All-Words/">下一页➡️</a></p>
</div>

4
website/content/ChapterFour/0001~0099/0030.Substring-with-Concatenation-of-All-Words.md
View File

@ -100,6 +100,6 @@ func copyMap(s map[string]int) map[string]int {
----------------------------------------------
<div style="display: flex;justify-content: space-between;align-items: center;">
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0029.Divide-Two-Integers/">⬅️上一页</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0033.Search-in-Rotated-Sorted-Array/">下一页➡️</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0001~0099/0029.Divide-Two-Integers/">⬅️上一页</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0001~0099/0033.Search-in-Rotated-Sorted-Array/">下一页➡️</a></p>
</div>

4
website/content/ChapterFour/0001~0099/0033.Search-in-Rotated-Sorted-Array.md
View File

@ -80,6 +80,6 @@ func search33(nums []int, target int) int {
----------------------------------------------
<div style="display: flex;justify-content: space-between;align-items: center;">
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0030.Substring-with-Concatenation-of-All-Words/">⬅️上一页</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0034.Find-First-and-Last-Position-of-Element-in-Sorted-Array/">下一页➡️</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0001~0099/0030.Substring-with-Concatenation-of-All-Words/">⬅️上一页</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0001~0099/0034.Find-First-and-Last-Position-of-Element-in-Sorted-Array/">下一页➡️</a></p>
</div>

4
website/content/ChapterFour/0001~0099/0034.Find-First-and-Last-Position-of-Element-in-Sorted-Array.md
View File

@ -123,6 +123,6 @@ func searchLastLessElement(nums []int, target int) int {
----------------------------------------------
<div style="display: flex;justify-content: space-between;align-items: center;">
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0033.Search-in-Rotated-Sorted-Array/">⬅️上一页</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0035.Search-Insert-Position/">下一页➡️</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0001~0099/0033.Search-in-Rotated-Sorted-Array/">⬅️上一页</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0001~0099/0035.Search-Insert-Position/">下一页➡️</a></p>
</div>

4
website/content/ChapterFour/0001~0099/0035.Search-Insert-Position.md
View File

@ -67,6 +67,6 @@ func searchInsert(nums []int, target int) int {
----------------------------------------------
<div style="display: flex;justify-content: space-between;align-items: center;">
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0034.Find-First-and-Last-Position-of-Element-in-Sorted-Array/">⬅️上一页</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0036.Valid-Sudoku/">下一页➡️</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0001~0099/0034.Find-First-and-Last-Position-of-Element-in-Sorted-Array/">⬅️上一页</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0001~0099/0036.Valid-Sudoku/">下一页➡️</a></p>
</div>

4
website/content/ChapterFour/0001~0099/0036.Valid-Sudoku.md
View File

@ -170,6 +170,6 @@ func isValidSudoku1(board [][]byte) bool {
----------------------------------------------
<div style="display: flex;justify-content: space-between;align-items: center;">
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0035.Search-Insert-Position/">⬅️上一页</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0037.Sudoku-Solver/">下一页➡️</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0001~0099/0035.Search-Insert-Position/">⬅️上一页</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0001~0099/0037.Sudoku-Solver/">下一页➡️</a></p>
</div>

4
website/content/ChapterFour/0001~0099/0037.Sudoku-Solver.md
View File

@ -120,6 +120,6 @@ func checkSudoku(board *[][]byte, pos position, val int) bool {
----------------------------------------------
<div style="display: flex;justify-content: space-between;align-items: center;">
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0036.Valid-Sudoku/">⬅️上一页</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0039.Combination-Sum/">下一页➡️</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0001~0099/0036.Valid-Sudoku/">⬅️上一页</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0001~0099/0039.Combination-Sum/">下一页➡️</a></p>
</div>

4
website/content/ChapterFour/0001~0099/0039.Combination-Sum.md
View File

@ -89,6 +89,6 @@ func findcombinationSum(nums []int, target, index int, c []int, res *[][]int) {
----------------------------------------------
<div style="display: flex;justify-content: space-between;align-items: center;">
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0037.Sudoku-Solver/">⬅️上一页</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0040.Combination-Sum-II/">下一页➡️</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0001~0099/0037.Sudoku-Solver/">⬅️上一页</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0001~0099/0040.Combination-Sum-II/">下一页➡️</a></p>
</div>

4
website/content/ChapterFour/0001~0099/0040.Combination-Sum-II.md
View File

@ -91,6 +91,6 @@ func findcombinationSum2(nums []int, target, index int, c []int, res *[][]int) {
----------------------------------------------
<div style="display: flex;justify-content: space-between;align-items: center;">
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0039.Combination-Sum/">⬅️上一页</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0041.First-Missing-Positive/">下一页➡️</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0001~0099/0039.Combination-Sum/">⬅️上一页</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0001~0099/0041.First-Missing-Positive/">下一页➡️</a></p>
</div>

4
website/content/ChapterFour/0001~0099/0041.First-Missing-Positive.md
View File

@ -68,6 +68,6 @@ func firstMissingPositive(nums []int) int {
----------------------------------------------
<div style="display: flex;justify-content: space-between;align-items: center;">
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0040.Combination-Sum-II/">⬅️上一页</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0042.Trapping-Rain-Water/">下一页➡️</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0001~0099/0040.Combination-Sum-II/">⬅️上一页</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0001~0099/0042.Trapping-Rain-Water/">下一页➡️</a></p>
</div>

4
website/content/ChapterFour/0001~0099/0042.Trapping-Rain-Water.md
View File

@ -63,6 +63,6 @@ func trap(height []int) int {
----------------------------------------------
<div style="display: flex;justify-content: space-between;align-items: center;">
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0041.First-Missing-Positive/">⬅️上一页</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0046.Permutations/">下一页➡️</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0001~0099/0041.First-Missing-Positive/">⬅️上一页</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0001~0099/0046.Permutations/">下一页➡️</a></p>
</div>

4
website/content/ChapterFour/0001~0099/0046.Permutations.md
View File

@ -68,6 +68,6 @@ func generatePermutation(nums []int, index int, p []int, res *[][]int, used *[]b
----------------------------------------------
<div style="display: flex;justify-content: space-between;align-items: center;">
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0042.Trapping-Rain-Water/">⬅️上一页</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0047.Permutations-II/">下一页➡️</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0001~0099/0042.Trapping-Rain-Water/">⬅️上一页</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0001~0099/0047.Permutations-II/">下一页➡️</a></p>
</div>

4
website/content/ChapterFour/0001~0099/0047.Permutations-II.md
View File

@ -72,6 +72,6 @@ func generatePermutation47(nums []int, index int, p []int, res *[][]int, used *[
----------------------------------------------
<div style="display: flex;justify-content: space-between;align-items: center;">
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0046.Permutations/">⬅️上一页</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0048.Rotate-Image/">下一页➡️</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0001~0099/0046.Permutations/">⬅️上一页</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0001~0099/0048.Rotate-Image/">下一页➡️</a></p>
</div>

4
website/content/ChapterFour/0001~0099/0048.Rotate-Image.md
View File

@ -129,6 +129,6 @@ func rotate(matrix [][]int) {
----------------------------------------------
<div style="display: flex;justify-content: space-between;align-items: center;">
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0047.Permutations-II/">⬅️上一页</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0049.Group-Anagrams/">下一页➡️</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0001~0099/0047.Permutations-II/">⬅️上一页</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0001~0099/0049.Group-Anagrams/">下一页➡️</a></p>
</div>

4
website/content/ChapterFour/0001~0099/0049.Group-Anagrams.md
View File

@ -74,6 +74,6 @@ func groupAnagrams(strs []string) [][]string {
----------------------------------------------
<div style="display: flex;justify-content: space-between;align-items: center;">
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0048.Rotate-Image/">⬅️上一页</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0050.Powx-n/">下一页➡️</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0001~0099/0048.Rotate-Image/">⬅️上一页</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0001~0099/0050.Powx-n/">下一页➡️</a></p>
</div>

4
website/content/ChapterFour/0001~0099/0050.Powx-n.md
View File

@ -71,6 +71,6 @@ func myPow(x float64, n int) float64 {
----------------------------------------------
<div style="display: flex;justify-content: space-between;align-items: center;">
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0049.Group-Anagrams/">⬅️上一页</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0051.N-Queens/">下一页➡️</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0001~0099/0049.Group-Anagrams/">⬅️上一页</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0001~0099/0051.N-Queens/">下一页➡️</a></p>
</div>

4
website/content/ChapterFour/0001~0099/0051.N-Queens.md
View File

@ -136,6 +136,6 @@ func generateBoard(n int, row *[]int) []string {
----------------------------------------------
<div style="display: flex;justify-content: space-between;align-items: center;">
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0050.Powx-n/">⬅️上一页</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0052.N-Queens-II/">下一页➡️</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0001~0099/0050.Powx-n/">⬅️上一页</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0001~0099/0052.N-Queens-II/">下一页➡️</a></p>
</div>

4
website/content/ChapterFour/0001~0099/0052.N-Queens-II.md
View File

@ -109,6 +109,6 @@ func putQueen52(n, index int, col, dia1, dia2 *[]bool, row *[]int, res *int) {
----------------------------------------------
<div style="display: flex;justify-content: space-between;align-items: center;">
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0051.N-Queens/">⬅️上一页</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0053.Maximum-Subarray/">下一页➡️</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0001~0099/0051.N-Queens/">⬅️上一页</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0001~0099/0053.Maximum-Subarray/">下一页➡️</a></p>
</div>

4
website/content/ChapterFour/0001~0099/0053.Maximum-Subarray.md
View File

@ -77,6 +77,6 @@ func maxSubArray1(nums []int) int {
----------------------------------------------
<div style="display: flex;justify-content: space-between;align-items: center;">
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0052.N-Queens-II/">⬅️上一页</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0054.Spiral-Matrix/">下一页➡️</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0001~0099/0052.N-Queens-II/">⬅️上一页</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0001~0099/0054.Spiral-Matrix/">下一页➡️</a></p>
</div>

4
website/content/ChapterFour/0001~0099/0054.Spiral-Matrix.md
View File

@ -167,6 +167,6 @@ func spiralOrder2(matrix [][]int) []int {
----------------------------------------------
<div style="display: flex;justify-content: space-between;align-items: center;">
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0053.Maximum-Subarray/">⬅️上一页</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0055.Jump-Game/">下一页➡️</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0001~0099/0053.Maximum-Subarray/">⬅️上一页</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0001~0099/0055.Jump-Game/">下一页➡️</a></p>
</div>

4
website/content/ChapterFour/0001~0099/0055.Jump-Game.md
View File

@ -60,6 +60,6 @@ func canJump(nums []int) bool {
----------------------------------------------
<div style="display: flex;justify-content: space-between;align-items: center;">
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0054.Spiral-Matrix/">⬅️上一页</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0056.Merge-Intervals/">下一页➡️</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0001~0099/0054.Spiral-Matrix/">⬅️上一页</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0001~0099/0056.Merge-Intervals/">下一页➡️</a></p>
</div>

4
website/content/ChapterFour/0001~0099/0056.Merge-Intervals.md
View File

@ -111,6 +111,6 @@ func quickSort(a []Interval, lo, hi int) {
----------------------------------------------
<div style="display: flex;justify-content: space-between;align-items: center;">
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0055.Jump-Game/">⬅️上一页</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0057.Insert-Interval/">下一页➡️</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0001~0099/0055.Jump-Game/">⬅️上一页</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0001~0099/0057.Insert-Interval/">下一页➡️</a></p>
</div>

4
website/content/ChapterFour/0001~0099/0057.Insert-Interval.md
View File

@ -77,6 +77,6 @@ func insert(intervals []Interval, newInterval Interval) []Interval {
----------------------------------------------
<div style="display: flex;justify-content: space-between;align-items: center;">
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0056.Merge-Intervals/">⬅️上一页</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0059.Spiral-Matrix-II/">下一页➡️</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0001~0099/0056.Merge-Intervals/">⬅️上一页</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0001~0099/0059.Spiral-Matrix-II/">下一页➡️</a></p>
</div>

4
website/content/ChapterFour/0001~0099/0059.Spiral-Matrix-II.md
View File

@ -96,6 +96,6 @@ func generateMatrix(n int) [][]int {
----------------------------------------------
<div style="display: flex;justify-content: space-between;align-items: center;">
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0057.Insert-Interval/">⬅️上一页</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0060.Permutation-Sequence/">下一页➡️</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0001~0099/0057.Insert-Interval/">⬅️上一页</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0001~0099/0060.Permutation-Sequence/">下一页➡️</a></p>
</div>

4
website/content/ChapterFour/0001~0099/0060.Permutation-Sequence.md
View File

@ -98,6 +98,6 @@ func findPermutation(n, index int, k *int, p []int, res *string, used *[]bool) {
----------------------------------------------
<div style="display: flex;justify-content: space-between;align-items: center;">
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0059.Spiral-Matrix-II/">⬅️上一页</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0061.Rotate-List/">下一页➡️</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0001~0099/0059.Spiral-Matrix-II/">⬅️上一页</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0001~0099/0061.Rotate-List/">下一页➡️</a></p>
</div>

4
website/content/ChapterFour/0001~0099/0061.Rotate-List.md
View File

@ -83,6 +83,6 @@ func rotateRight(head *ListNode, k int) *ListNode {
----------------------------------------------
<div style="display: flex;justify-content: space-between;align-items: center;">
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0060.Permutation-Sequence/">⬅️上一页</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0062.Unique-Paths/">下一页➡️</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0001~0099/0060.Permutation-Sequence/">⬅️上一页</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0001~0099/0062.Unique-Paths/">下一页➡️</a></p>
</div>

4
website/content/ChapterFour/0001~0099/0062.Unique-Paths.md
View File

@ -71,6 +71,6 @@ func uniquePaths(m int, n int) int {
----------------------------------------------
<div style="display: flex;justify-content: space-between;align-items: center;">
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0061.Rotate-List/">⬅️上一页</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0063.Unique-Paths-II/">下一页➡️</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0001~0099/0061.Rotate-List/">⬅️上一页</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0001~0099/0063.Unique-Paths-II/">下一页➡️</a></p>
</div>

4
website/content/ChapterFour/0001~0099/0063.Unique-Paths-II.md
View File

@ -82,6 +82,6 @@ func uniquePathsWithObstacles(obstacleGrid [][]int) int {
----------------------------------------------
<div style="display: flex;justify-content: space-between;align-items: center;">
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0062.Unique-Paths/">⬅️上一页</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0064.Minimum-Path-Sum/">下一页➡️</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0001~0099/0062.Unique-Paths/">⬅️上一页</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0001~0099/0064.Minimum-Path-Sum/">下一页➡️</a></p>
</div>

4
website/content/ChapterFour/0001~0099/0064.Minimum-Path-Sum.md
View File

@ -95,6 +95,6 @@ func minPathSum1(grid [][]int) int {
----------------------------------------------
<div style="display: flex;justify-content: space-between;align-items: center;">
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0063.Unique-Paths-II/">⬅️上一页</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0066.Plus-One/">下一页➡️</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0001~0099/0063.Unique-Paths-II/">⬅️上一页</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0001~0099/0066.Plus-One/">下一页➡️</a></p>
</div>

4
website/content/ChapterFour/0001~0099/0066.Plus-One.md
View File

@ -65,6 +65,6 @@ func plusOne(digits []int) []int {
----------------------------------------------
<div style="display: flex;justify-content: space-between;align-items: center;">
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0064.Minimum-Path-Sum/">⬅️上一页</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0067.Add-Binary/">下一页➡️</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0001~0099/0064.Minimum-Path-Sum/">⬅️上一页</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0001~0099/0067.Add-Binary/">下一页➡️</a></p>
</div>

4
website/content/ChapterFour/0001~0099/0067.Add-Binary.md
View File

@ -78,6 +78,6 @@ func addBinary(a string, b string) string {
----------------------------------------------
<div style="display: flex;justify-content: space-between;align-items: center;">
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0066.Plus-One/">⬅️上一页</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0069.Sqrtx/">下一页➡️</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0001~0099/0066.Plus-One/">⬅️上一页</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0001~0099/0069.Sqrtx/">下一页➡️</a></p>
</div>

4
website/content/ChapterFour/0001~0099/0069.Sqrtx.md
View File

@ -93,6 +93,6 @@ func mySqrt1(x int) int {
----------------------------------------------
<div style="display: flex;justify-content: space-between;align-items: center;">
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0067.Add-Binary/">⬅️上一页</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0070.Climbing-Stairs/">下一页➡️</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0001~0099/0067.Add-Binary/">⬅️上一页</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0001~0099/0070.Climbing-Stairs/">下一页➡️</a></p>
</div>

4
website/content/ChapterFour/0001~0099/0070.Climbing-Stairs.md
View File

@ -57,6 +57,6 @@ func climbStairs(n int) int {
----------------------------------------------
<div style="display: flex;justify-content: space-between;align-items: center;">
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0069.Sqrtx/">⬅️上一页</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0071.Simplify-Path/">下一页➡️</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0001~0099/0069.Sqrtx/">⬅️上一页</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0001~0099/0071.Simplify-Path/">下一页➡️</a></p>
</div>

4
website/content/ChapterFour/0001~0099/0071.Simplify-Path.md
View File

@ -119,6 +119,6 @@ func simplifyPath1(path string) string {
----------------------------------------------
<div style="display: flex;justify-content: space-between;align-items: center;">
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0070.Climbing-Stairs/">⬅️上一页</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0074.Search-a-2D-Matrix/">下一页➡️</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0001~0099/0070.Climbing-Stairs/">⬅️上一页</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0001~0099/0074.Search-a-2D-Matrix/">下一页➡️</a></p>
</div>

4
website/content/ChapterFour/0001~0099/0074.Search-a-2D-Matrix.md
View File

@ -74,6 +74,6 @@ func searchMatrix(matrix [][]int, target int) bool {
----------------------------------------------
<div style="display: flex;justify-content: space-between;align-items: center;">
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0071.Simplify-Path/">⬅️上一页</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0075.Sort-Colors/">下一页➡️</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0001~0099/0071.Simplify-Path/">⬅️上一页</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0001~0099/0075.Sort-Colors/">下一页➡️</a></p>
</div>

4
website/content/ChapterFour/0001~0099/0075.Sort-Colors.md
View File

@ -74,6 +74,6 @@ func sortColors(nums []int) {
----------------------------------------------
<div style="display: flex;justify-content: space-between;align-items: center;">
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0074.Search-a-2D-Matrix/">⬅️上一页</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0076.Minimum-Window-Substring/">下一页➡️</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0001~0099/0074.Search-a-2D-Matrix/">⬅️上一页</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0001~0099/0076.Minimum-Window-Substring/">下一页➡️</a></p>
</div>

4
website/content/ChapterFour/0001~0099/0076.Minimum-Window-Substring.md
View File

@ -78,6 +78,6 @@ func minWindow(s string, t string) string {
----------------------------------------------
<div style="display: flex;justify-content: space-between;align-items: center;">
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0075.Sort-Colors/">⬅️上一页</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0077.Combinations/">下一页➡️</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0001~0099/0075.Sort-Colors/">⬅️上一页</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0001~0099/0077.Combinations/">下一页➡️</a></p>
</div>

4
website/content/ChapterFour/0001~0099/0077.Combinations.md
View File

@ -62,6 +62,6 @@ func generateCombinations(n, k, start int, c []int, res *[][]int) {
----------------------------------------------
<div style="display: flex;justify-content: space-between;align-items: center;">
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0076.Minimum-Window-Substring/">⬅️上一页</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0078.Subsets/">下一页➡️</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0001~0099/0076.Minimum-Window-Substring/">⬅️上一页</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0001~0099/0078.Subsets/">下一页➡️</a></p>
</div>

4
website/content/ChapterFour/0001~0099/0078.Subsets.md
View File

@ -107,6 +107,6 @@ func subsets2(nums []int) [][]int {
----------------------------------------------
<div style="display: flex;justify-content: space-between;align-items: center;">
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0077.Combinations/">⬅️上一页</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0079.Word-Search/">下一页➡️</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0001~0099/0077.Combinations/">⬅️上一页</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0001~0099/0079.Word-Search/">下一页➡️</a></p>
</div>

4
website/content/ChapterFour/0001~0099/0079.Word-Search.md
View File

@ -85,6 +85,6 @@ func searchWord(board [][]byte, visited [][]bool, word string, index, x, y int)
----------------------------------------------
<div style="display: flex;justify-content: space-between;align-items: center;">
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0078.Subsets/">⬅️上一页</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0080.Remove-Duplicates-from-Sorted-Array-II/">下一页➡️</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0001~0099/0078.Subsets/">⬅️上一页</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0001~0099/0080.Remove-Duplicates-from-Sorted-Array-II/">下一页➡️</a></p>
</div>

4
website/content/ChapterFour/0001~0099/0080.Remove-Duplicates-from-Sorted-Array-II.md
View File

@ -107,6 +107,6 @@ func removeDuplicates80(nums []int) int {
----------------------------------------------
<div style="display: flex;justify-content: space-between;align-items: center;">
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0079.Word-Search/">⬅️上一页</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0081.Search-in-Rotated-Sorted-Array-II/">下一页➡️</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0001~0099/0079.Word-Search/">⬅️上一页</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0001~0099/0081.Search-in-Rotated-Sorted-Array-II/">下一页➡️</a></p>
</div>

4
website/content/ChapterFour/0001~0099/0081.Search-in-Rotated-Sorted-Array-II.md
View File

@ -87,6 +87,6 @@ func search(nums []int, target int) bool {
----------------------------------------------
<div style="display: flex;justify-content: space-between;align-items: center;">
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0080.Remove-Duplicates-from-Sorted-Array-II/">⬅️上一页</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0082.Remove-Duplicates-from-Sorted-List-II/">下一页➡️</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0001~0099/0080.Remove-Duplicates-from-Sorted-Array-II/">⬅️上一页</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0001~0099/0082.Remove-Duplicates-from-Sorted-List-II/">下一页➡️</a></p>
</div>

4
website/content/ChapterFour/0001~0099/0082.Remove-Duplicates-from-Sorted-List-II.md
View File

@ -193,6 +193,6 @@ func deleteDuplicates4(head *ListNode) *ListNode {
----------------------------------------------
<div style="display: flex;justify-content: space-between;align-items: center;">
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0081.Search-in-Rotated-Sorted-Array-II/">⬅️上一页</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0083.Remove-Duplicates-from-Sorted-List/">下一页➡️</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0001~0099/0081.Search-in-Rotated-Sorted-Array-II/">⬅️上一页</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0001~0099/0083.Remove-Duplicates-from-Sorted-List/">下一页➡️</a></p>
</div>

4
website/content/ChapterFour/0001~0099/0083.Remove-Duplicates-from-Sorted-List.md
View File

@ -68,6 +68,6 @@ func deleteDuplicates(head *ListNode) *ListNode {
----------------------------------------------
<div style="display: flex;justify-content: space-between;align-items: center;">
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0082.Remove-Duplicates-from-Sorted-List-II/">⬅️上一页</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0084.Largest-Rectangle-in-Histogram/">下一页➡️</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0001~0099/0082.Remove-Duplicates-from-Sorted-List-II/">⬅️上一页</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0001~0099/0084.Largest-Rectangle-in-Histogram/">下一页➡️</a></p>
</div>

4
website/content/ChapterFour/0001~0099/0084.Largest-Rectangle-in-Histogram.md
View File

@ -77,6 +77,6 @@ func largestRectangleArea(heights []int) int {
----------------------------------------------
<div style="display: flex;justify-content: space-between;align-items: center;">
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0083.Remove-Duplicates-from-Sorted-List/">⬅️上一页</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0086.Partition-List/">下一页➡️</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0001~0099/0083.Remove-Duplicates-from-Sorted-List/">⬅️上一页</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0001~0099/0086.Partition-List/">下一页➡️</a></p>
</div>

4
website/content/ChapterFour/0001~0099/0086.Partition-List.md
View File

@ -150,6 +150,6 @@ func genListNode(head *DoublyListNode) *ListNode {
----------------------------------------------
<div style="display: flex;justify-content: space-between;align-items: center;">
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0084.Largest-Rectangle-in-Histogram/">⬅️上一页</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0088.Merge-Sorted-Array/">下一页➡️</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0001~0099/0084.Largest-Rectangle-in-Histogram/">⬅️上一页</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0001~0099/0088.Merge-Sorted-Array/">下一页➡️</a></p>
</div>

4
website/content/ChapterFour/0001~0099/0088.Merge-Sorted-Array.md
View File

@ -71,6 +71,6 @@ func merge(nums1 []int, m int, nums2 []int, n int) {
----------------------------------------------
<div style="display: flex;justify-content: space-between;align-items: center;">
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0086.Partition-List/">⬅️上一页</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0089.Gray-Code/">下一页➡️</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0001~0099/0086.Partition-List/">⬅️上一页</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0001~0099/0089.Gray-Code/">下一页➡️</a></p>
</div>

4
website/content/ChapterFour/0001~0099/0089.Gray-Code.md
View File

@ -119,6 +119,6 @@ func grayCode1(n int) []int {
----------------------------------------------
<div style="display: flex;justify-content: space-between;align-items: center;">
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0088.Merge-Sorted-Array/">⬅️上一页</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0090.Subsets-II/">下一页➡️</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0001~0099/0088.Merge-Sorted-Array/">⬅️上一页</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0001~0099/0090.Subsets-II/">下一页➡️</a></p>
</div>

4
website/content/ChapterFour/0001~0099/0090.Subsets-II.md
View File

@ -78,6 +78,6 @@ func generateSubsetsWithDup(nums []int, k, start int, c []int, res *[][]int) {
----------------------------------------------
<div style="display: flex;justify-content: space-between;align-items: center;">
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0089.Gray-Code/">⬅️上一页</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0091.Decode-Ways/">下一页➡️</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0001~0099/0089.Gray-Code/">⬅️上一页</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0001~0099/0091.Decode-Ways/">下一页➡️</a></p>
</div>

4
website/content/ChapterFour/0001~0099/0091.Decode-Ways.md
View File

@ -84,6 +84,6 @@ func numDecodings(s string) int {
----------------------------------------------
<div style="display: flex;justify-content: space-between;align-items: center;">
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0090.Subsets-II/">⬅️上一页</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0092.Reverse-Linked-List-II/">下一页➡️</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0001~0099/0090.Subsets-II/">⬅️上一页</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0001~0099/0092.Reverse-Linked-List-II/">下一页➡️</a></p>
</div>

4
website/content/ChapterFour/0001~0099/0092.Reverse-Linked-List-II.md
View File

@ -67,6 +67,6 @@ func reverseBetween(head *ListNode, m int, n int) *ListNode {
----------------------------------------------
<div style="display: flex;justify-content: space-between;align-items: center;">
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0091.Decode-Ways/">⬅️上一页</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0093.Restore-IP-Addresses/">下一页➡️</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0001~0099/0091.Decode-Ways/">⬅️上一页</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0001~0099/0093.Restore-IP-Addresses/">下一页➡️</a></p>
</div>

4
website/content/ChapterFour/0001~0099/0093.Restore-IP-Addresses.md
View File

@ -80,6 +80,6 @@ func getString(ip []int) string {
----------------------------------------------
<div style="display: flex;justify-content: space-between;align-items: center;">
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0092.Reverse-Linked-List-II/">⬅️上一页</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0094.Binary-Tree-Inorder-Traversal/">下一页➡️</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0001~0099/0092.Reverse-Linked-List-II/">⬅️上一页</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0001~0099/0094.Binary-Tree-Inorder-Traversal/">下一页➡️</a></p>
</div>

4
website/content/ChapterFour/0001~0099/0094.Binary-Tree-Inorder-Traversal.md
View File

@ -75,6 +75,6 @@ func inorder(root *TreeNode, output *[]int) {
----------------------------------------------
<div style="display: flex;justify-content: space-between;align-items: center;">
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0093.Restore-IP-Addresses/">⬅️上一页</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0095.Unique-Binary-Search-Trees-II/">下一页➡️</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0001~0099/0093.Restore-IP-Addresses/">⬅️上一页</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0001~0099/0095.Unique-Binary-Search-Trees-II/">下一页➡️</a></p>
</div>

4
website/content/ChapterFour/0001~0099/0095.Unique-Binary-Search-Trees-II.md
View File

@ -80,6 +80,6 @@ func generateBSTree(start, end int) []*TreeNode {
----------------------------------------------
<div style="display: flex;justify-content: space-between;align-items: center;">
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0094.Binary-Tree-Inorder-Traversal/">⬅️上一页</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0096.Unique-Binary-Search-Trees/">下一页➡️</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0001~0099/0094.Binary-Tree-Inorder-Traversal/">⬅️上一页</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0001~0099/0096.Unique-Binary-Search-Trees/">下一页➡️</a></p>
</div>

4
website/content/ChapterFour/0001~0099/0096.Unique-Binary-Search-Trees.md
View File

@ -55,6 +55,6 @@ func numTrees(n int) int {
----------------------------------------------
<div style="display: flex;justify-content: space-between;align-items: center;">
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0095.Unique-Binary-Search-Trees-II/">⬅️上一页</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0098.Validate-Binary-Search-Tree/">下一页➡️</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0001~0099/0095.Unique-Binary-Search-Trees-II/">⬅️上一页</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0001~0099/0098.Validate-Binary-Search-Tree/">下一页➡️</a></p>
</div>

4
website/content/ChapterFour/0001~0099/0098.Validate-Binary-Search-Tree.md
View File

@ -101,6 +101,6 @@ func inOrder(root *TreeNode, arr *[]int) {
----------------------------------------------
<div style="display: flex;justify-content: space-between;align-items: center;">
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0096.Unique-Binary-Search-Trees/">⬅️上一页</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0099.Recover-Binary-Search-Tree/">下一页➡️</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0001~0099/0096.Unique-Binary-Search-Trees/">⬅️上一页</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0001~0099/0099.Recover-Binary-Search-Tree/">下一页➡️</a></p>
</div>

4
website/content/ChapterFour/0001~0099/0099.Recover-Binary-Search-Tree.md
View File

@ -103,6 +103,6 @@ func inOrderTraverse(root, prev, target1, target2 *TreeNode) (*TreeNode, *TreeNo
----------------------------------------------
<div style="display: flex;justify-content: space-between;align-items: center;">
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0098.Validate-Binary-Search-Tree/">⬅️上一页</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0100.Same-Tree/">下一页➡️</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0001~0099/0098.Validate-Binary-Search-Tree/">⬅️上一页</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0100~0199/0100.Same-Tree/">下一页➡️</a></p>
</div>

4
website/content/ChapterFour/0001~0099/0100.Same-Tree.md → website/content/ChapterFour/0100~0199/0100.Same-Tree.md
View File

@ -94,6 +94,6 @@ func isSameTree(p *TreeNode, q *TreeNode) bool {
----------------------------------------------
<div style="display: flex;justify-content: space-between;align-items: center;">
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0099.Recover-Binary-Search-Tree/">⬅️上一页</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0101.Symmetric-Tree/">下一页➡️</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0001~0099/0099.Recover-Binary-Search-Tree/">⬅️上一页</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0100~0199/0101.Symmetric-Tree/">下一页➡️</a></p>
</div>

4
website/content/ChapterFour/0100~0199/0101.Symmetric-Tree.md
View File

@ -73,6 +73,6 @@ func isSymmetric(root *TreeNode) bool {
----------------------------------------------
<div style="display: flex;justify-content: space-between;align-items: center;">
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0100.Same-Tree/">⬅️上一页</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0102.Binary-Tree-Level-Order-Traversal/">下一页➡️</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0100~0199/0100.Same-Tree/">⬅️上一页</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0100~0199/0102.Binary-Tree-Level-Order-Traversal/">下一页➡️</a></p>
</div>

4
website/content/ChapterFour/0100~0199/0102.Binary-Tree-Level-Order-Traversal.md
View File

@ -117,6 +117,6 @@ func dfsLevel(node *TreeNode, level int, res *[][]int) {
----------------------------------------------
<div style="display: flex;justify-content: space-between;align-items: center;">
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0101.Symmetric-Tree/">⬅️上一页</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0103.Binary-Tree-Zigzag-Level-Order-Traversal/">下一页➡️</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0100~0199/0101.Symmetric-Tree/">⬅️上一页</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0100~0199/0103.Binary-Tree-Zigzag-Level-Order-Traversal/">下一页➡️</a></p>
</div>

4
website/content/ChapterFour/0100~0199/0103.Binary-Tree-Zigzag-Level-Order-Traversal.md
View File

@ -128,6 +128,6 @@ func search(root *TreeNode, depth int, res *[][]int) {
----------------------------------------------
<div style="display: flex;justify-content: space-between;align-items: center;">
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0102.Binary-Tree-Level-Order-Traversal/">⬅️上一页</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0104.Maximum-Depth-of-Binary-Tree/">下一页➡️</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0100~0199/0102.Binary-Tree-Level-Order-Traversal/">⬅️上一页</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0100~0199/0104.Maximum-Depth-of-Binary-Tree/">下一页➡️</a></p>
</div>

4
website/content/ChapterFour/0100~0199/0104.Maximum-Depth-of-Binary-Tree.md
View File

@ -62,6 +62,6 @@ func maxDepth(root *TreeNode) int {
----------------------------------------------
<div style="display: flex;justify-content: space-between;align-items: center;">
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0103.Binary-Tree-Zigzag-Level-Order-Traversal/">⬅️上一页</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0105.Construct-Binary-Tree-from-Preorder-and-Inorder-Traversal/">下一页➡️</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0100~0199/0103.Binary-Tree-Zigzag-Level-Order-Traversal/">⬅️上一页</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0100~0199/0105.Construct-Binary-Tree-from-Preorder-and-Inorder-Traversal/">下一页➡️</a></p>
</div>

4
website/content/ChapterFour/0100~0199/0105.Construct-Binary-Tree-from-Preorder-and-Inorder-Traversal.md
View File

@ -75,6 +75,6 @@ func buildPreIn2TreeDFS(pre []int, preStart int, preEnd int, inStart int, inPos
----------------------------------------------
<div style="display: flex;justify-content: space-between;align-items: center;">
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0104.Maximum-Depth-of-Binary-Tree/">⬅️上一页</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0106.Construct-Binary-Tree-from-Inorder-and-Postorder-Traversal/">下一页➡️</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0100~0199/0104.Maximum-Depth-of-Binary-Tree/">⬅️上一页</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0100~0199/0106.Construct-Binary-Tree-from-Inorder-and-Postorder-Traversal/">下一页➡️</a></p>
</div>

4
website/content/ChapterFour/0100~0199/0106.Construct-Binary-Tree-from-Inorder-and-Postorder-Traversal.md
View File

@ -73,6 +73,6 @@ func buildInPos2TreeDFS(post []int, postStart int, postEnd int, inStart int, inP
----------------------------------------------
<div style="display: flex;justify-content: space-between;align-items: center;">
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0105.Construct-Binary-Tree-from-Preorder-and-Inorder-Traversal/">⬅️上一页</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0107.Binary-Tree-Level-Order-Traversal-II/">下一页➡️</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0100~0199/0105.Construct-Binary-Tree-from-Preorder-and-Inorder-Traversal/">⬅️上一页</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0100~0199/0107.Binary-Tree-Level-Order-Traversal-II/">下一页➡️</a></p>
</div>

4
website/content/ChapterFour/0100~0199/0107.Binary-Tree-Level-Order-Traversal-II.md
View File

@ -72,6 +72,6 @@ func levelOrderBottom(root *TreeNode) [][]int {
----------------------------------------------
<div style="display: flex;justify-content: space-between;align-items: center;">
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0106.Construct-Binary-Tree-from-Inorder-and-Postorder-Traversal/">⬅️上一页</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0108.Convert-Sorted-Array-to-Binary-Search-Tree/">下一页➡️</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0100~0199/0106.Construct-Binary-Tree-from-Inorder-and-Postorder-Traversal/">⬅️上一页</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0100~0199/0108.Convert-Sorted-Array-to-Binary-Search-Tree/">下一页➡️</a></p>
</div>

4
website/content/ChapterFour/0100~0199/0108.Convert-Sorted-Array-to-Binary-Search-Tree.md
View File

@ -54,6 +54,6 @@ func sortedArrayToBST(nums []int) *TreeNode {
----------------------------------------------
<div style="display: flex;justify-content: space-between;align-items: center;">
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0107.Binary-Tree-Level-Order-Traversal-II/">⬅️上一页</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0109.Convert-Sorted-List-to-Binary-Search-Tree/">下一页➡️</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0100~0199/0107.Binary-Tree-Level-Order-Traversal-II/">⬅️上一页</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0100~0199/0109.Convert-Sorted-List-to-Binary-Search-Tree/">下一页➡️</a></p>
</div>

4
website/content/ChapterFour/0100~0199/0109.Convert-Sorted-List-to-Binary-Search-Tree.md
View File

@ -99,6 +99,6 @@ func middleNodeAndPreNode(head *ListNode) (middle *ListNode, pre *ListNode) {
----------------------------------------------
<div style="display: flex;justify-content: space-between;align-items: center;">
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0108.Convert-Sorted-Array-to-Binary-Search-Tree/">⬅️上一页</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0110.Balanced-Binary-Tree/">下一页➡️</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0100~0199/0108.Convert-Sorted-Array-to-Binary-Search-Tree/">⬅️上一页</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0100~0199/0110.Balanced-Binary-Tree/">下一页➡️</a></p>
</div>

4
website/content/ChapterFour/0100~0199/0110.Balanced-Binary-Tree.md
View File

@ -92,6 +92,6 @@ func depth(root *TreeNode) int {
----------------------------------------------
<div style="display: flex;justify-content: space-between;align-items: center;">
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0109.Convert-Sorted-List-to-Binary-Search-Tree/">⬅️上一页</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0111.Minimum-Depth-of-Binary-Tree/">下一页➡️</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0100~0199/0109.Convert-Sorted-List-to-Binary-Search-Tree/">⬅️上一页</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0100~0199/0111.Minimum-Depth-of-Binary-Tree/">下一页➡️</a></p>
</div>

4
website/content/ChapterFour/0100~0199/0111.Minimum-Depth-of-Binary-Tree.md
View File

@ -64,6 +64,6 @@ func minDepth(root *TreeNode) int {
----------------------------------------------
<div style="display: flex;justify-content: space-between;align-items: center;">
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0110.Balanced-Binary-Tree/">⬅️上一页</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0112.Path-Sum/">下一页➡️</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0100~0199/0110.Balanced-Binary-Tree/">⬅️上一页</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0100~0199/0112.Path-Sum/">下一页➡️</a></p>
</div>

4
website/content/ChapterFour/0100~0199/0112.Path-Sum.md
View File

@ -61,6 +61,6 @@ func hasPathSum(root *TreeNode, sum int) bool {
----------------------------------------------
<div style="display: flex;justify-content: space-between;align-items: center;">
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0111.Minimum-Depth-of-Binary-Tree/">⬅️上一页</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0113.Path-Sum-II/">下一页➡️</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0100~0199/0111.Minimum-Depth-of-Binary-Tree/">⬅️上一页</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0100~0199/0113.Path-Sum-II/">下一页➡️</a></p>
</div>

4
website/content/ChapterFour/0100~0199/0113.Path-Sum-II.md
View File

@ -110,6 +110,6 @@ func pathSum1(root *TreeNode, sum int) [][]int {
----------------------------------------------
<div style="display: flex;justify-content: space-between;align-items: center;">
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0112.Path-Sum/">⬅️上一页</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0114.Flatten-Binary-Tree-to-Linked-List/">下一页➡️</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0100~0199/0112.Path-Sum/">⬅️上一页</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0100~0199/0114.Flatten-Binary-Tree-to-Linked-List/">下一页➡️</a></p>
</div>

4
website/content/ChapterFour/0100~0199/0114.Flatten-Binary-Tree-to-Linked-List.md
View File

@ -193,6 +193,6 @@ func flatten2(root *TreeNode) {
----------------------------------------------
<div style="display: flex;justify-content: space-between;align-items: center;">
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0113.Path-Sum-II/">⬅️上一页</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0118.Pascals-Triangle/">下一页➡️</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0100~0199/0113.Path-Sum-II/">⬅️上一页</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0100~0199/0118.Pascals-Triangle/">下一页➡️</a></p>
</div>

4
website/content/ChapterFour/0100~0199/0118.Pascals-Triangle.md
View File

@ -62,6 +62,6 @@ func generate(numRows int) [][]int {
----------------------------------------------
<div style="display: flex;justify-content: space-between;align-items: center;">
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0114.Flatten-Binary-Tree-to-Linked-List/">⬅️上一页</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0120.Triangle/">下一页➡️</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0100~0199/0114.Flatten-Binary-Tree-to-Linked-List/">⬅️上一页</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0100~0199/0120.Triangle/">下一页➡️</a></p>
</div>

4
website/content/ChapterFour/0100~0199/0120.Triangle.md
View File

@ -91,6 +91,6 @@ func minimumTotal1(triangle [][]int) int {
----------------------------------------------
<div style="display: flex;justify-content: space-between;align-items: center;">
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0118.Pascals-Triangle/">⬅️上一页</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0121.Best-Time-to-Buy-and-Sell-Stock/">下一页➡️</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0100~0199/0118.Pascals-Triangle/">⬅️上一页</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0100~0199/0121.Best-Time-to-Buy-and-Sell-Stock/">下一页➡️</a></p>
</div>

4
website/content/ChapterFour/0100~0199/0121.Best-Time-to-Buy-and-Sell-Stock.md
View File

@ -84,6 +84,6 @@ func maxProfit1(prices []int) int {
----------------------------------------------
<div style="display: flex;justify-content: space-between;align-items: center;">
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0120.Triangle/">⬅️上一页</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0122.Best-Time-to-Buy-and-Sell-Stock-II/">下一页➡️</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0100~0199/0120.Triangle/">⬅️上一页</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0100~0199/0122.Best-Time-to-Buy-and-Sell-Stock-II/">下一页➡️</a></p>
</div>

4
website/content/ChapterFour/0100~0199/0122.Best-Time-to-Buy-and-Sell-Stock-II.md
View File

@ -62,6 +62,6 @@ func maxProfit122(prices []int) int {
----------------------------------------------
<div style="display: flex;justify-content: space-between;align-items: center;">
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0121.Best-Time-to-Buy-and-Sell-Stock/">⬅️上一页</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0124.Binary-Tree-Maximum-Path-Sum/">下一页➡️</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0100~0199/0121.Best-Time-to-Buy-and-Sell-Stock/">⬅️上一页</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0100~0199/0124.Binary-Tree-Maximum-Path-Sum/">下一页➡️</a></p>
</div>

4
website/content/ChapterFour/0100~0199/0124.Binary-Tree-Maximum-Path-Sum.md
View File

@ -82,6 +82,6 @@ func getPathSum(root *TreeNode, maxSum *int) int {
----------------------------------------------
<div style="display: flex;justify-content: space-between;align-items: center;">
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0122.Best-Time-to-Buy-and-Sell-Stock-II/">⬅️上一页</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0125.Valid-Palindrome/">下一页➡️</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0100~0199/0122.Best-Time-to-Buy-and-Sell-Stock-II/">⬅️上一页</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0100~0199/0125.Valid-Palindrome/">下一页➡️</a></p>
</div>

4
website/content/ChapterFour/0100~0199/0125.Valid-Palindrome.md
View File

@ -69,6 +69,6 @@ func isChar(c byte) bool {
----------------------------------------------
<div style="display: flex;justify-content: space-between;align-items: center;">
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0124.Binary-Tree-Maximum-Path-Sum/">⬅️上一页</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0126.Word-Ladder-II/">下一页➡️</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0100~0199/0124.Binary-Tree-Maximum-Path-Sum/">⬅️上一页</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0100~0199/0126.Word-Ladder-II/">下一页➡️</a></p>
</div>

Some files were not shown because too many files have changed in this diff Show More