diff --git a/.github/FUNDING.yml b/.github/FUNDING.yml
new file mode 100644
index 000000000..2f943cf35
--- /dev/null
+++ b/.github/FUNDING.yml
@@ -0,0 +1,13 @@
+# These are supported funding model platforms
+
+github: [halfrost]
+patreon: # Replace with a single Patreon username
+open_collective: # Replace with a single Open Collective username
+ko_fi: # Replace with a single Ko-fi username
+tidelift: # Replace with a single Tidelift platform-name/package-name e.g., npm/babel
+community_bridge: # Replace with a single Community Bridge project-name e.g., cloud-foundry
+liberapay: # Replace with a single Liberapay username
+issuehunt: # Replace with a single IssueHunt username
+otechie: # Replace with a single Otechie username
+lfx_crowdfunding: # Replace with a single LFX Crowdfunding project-name e.g., cloud-foundry
+custom: # Replace with up to 4 custom sponsorship URLs e.g., ['link1', 'link2']
diff --git a/.github/workflows/deploy.yml b/.github/workflows/deploy.yml
index bea6ae885..42d1586b1 100644
--- a/.github/workflows/deploy.yml
+++ b/.github/workflows/deploy.yml
@@ -28,12 +28,11 @@ jobs:
hugo -D --minify
- name: Deploy to Server # 第四步，rsync推文件
- uses: AEnterprise/rsync-deploy@v1.0 # 使用别人包装好的步骤镜像
- env:
- DEPLOY_KEY: ${{ secrets.DEPLOY_KEY }} # 引用配置，SSH私钥
- ARGS: -avz --delete --exclude='*.pyc' # rsync参数，排除.pyc文件
- SERVER_PORT: '22' # SSH端口
- FOLDER: ./website/public/* #推送的文件夹，路径相对于代码仓库的根目录
- SERVER_IP: ${{ secrets.SSH_HOST }} # 引用配置，服务器的host名（IP或者域名domain.com）
- USERNAME: ${{ secrets.SSH_USERNAME }} # 引用配置，服务器登录名
- SERVER_DESTINATION: /var/www/books/leetcode/ # 部署到目标文件夹
+ uses: appleboy/ssh-action@v0.1.3 # 使用别人包装好的步骤镜像
+ with:
+ host: ${{ secrets.SSH_HOST }}
+ username: ${{ secrets.SSH_USERNAME }}
+ key: ${{ secrets.DEPLOY_KEY }}
+ port: ${{ secrets.SERVER_PORT }}
+ script: |
+ rsync -avz --delete --exclude='*.pyc' ./website/public/ ${{ secrets.SSH_USERNAME }}@${{ secrets.SSH_HOST }}:${{ secrets.SERVER_DESTINATION }}
diff --git a/.gitignore b/.gitignore
new file mode 100644
index 000000000..e1e2e99aa
--- /dev/null
+++ b/.gitignore
@@ -0,0 +1,2 @@
+*.toml
+.idea
diff --git a/.vscode/settings.json b/.vscode/settings.json
index 931396477..eb946948d 100644
--- a/.vscode/settings.json
+++ b/.vscode/settings.json
@@ -3,6 +3,7 @@
"go.formatFlags": [
"-s"
],
+ "go.autocompleteUnimportedPackages": true,
"[go]": {
"editor.insertSpaces": false,
"editor.formatOnSave": true,
diff --git a/README.md b/README.md
old mode 100644
new mode 100755
index 233969f62..ebb30e7d1
--- a/README.md
+++ b/README.md
@@ -1,26 +1,29 @@
# LeetCode in Go
-[LeetCode Online Judge](https://leetcode.com/) is a website containing many **algorithm questions**. Most of them are real interview questions of **Google, Facebook, LinkedIn, Apple**, etc. This repo shows my solutions in Go with the code style strictly follows the [Google Golang Style Guide](https://github.com/golang/go/wiki/CodeReviewComments). Please feel free to reference and **STAR** to support this repo, thank you!
+[LeetCode Online Judge](https://leetcode.com/) is a website containing many **algorithm questions**. Most of them are real interview questions of **Google, Facebook, LinkedIn, Apple**, etc. and it always help to sharp our algorithm Skills. Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. This repo shows my solutions in Go with the code style strictly follows the [Google Golang Style Guide](https://github.com/golang/go/wiki/CodeReviewComments). Please feel free to reference and **STAR** to support this repo, thank you!
<p align='center'>
<img src='./logo.png'>
</p>
+
+
<p align='center'>
-<a href="https://github.com/halfrost/LeetCode-Go/releases/" rel="nofollow"><img alt="GitHub All Releases" src="https://img.shields.io/github/downloads/halfrost/LeetCode-Go/total?label=PDF%20downloads"></a>
+<a href="https://github.com/halfrost/leetcode-go/releases/" rel="nofollow"><img alt="GitHub All Releases" src="https://img.shields.io/github/downloads/halfrost/LeetCode-Go/total?label=PDF%20downloads"></a>
<img src="https://img.shields.io/badge/Total%20Word%20Count-738884-success">
-<a href="https://github.com/halfrost/LeetCode-Go/actions" rel="nofollow"><img src="https://github.com/halfrost/LeetCode-Go/workflows/Deploy%20leetcode-cookbook/badge.svg?branch=master"></a>
+<a href="https://github.com/halfrost/leetcode-go/actions" rel="nofollow"><img src="https://github.com/halfrost/leetcode-go/workflows/Deploy%20leetcode-cookbook/badge.svg?branch=master"></a>
<a href="https://travis-ci.org/github/halfrost/LeetCode-Go" rel="nofollow"><img src="https://travis-ci.org/halfrost/LeetCode-Go.svg?branch=master"></a>
<a href="https://goreportcard.com/report/github.com/halfrost/LeetCode-Go" rel="nofollow"><img src="https://goreportcard.com/badge/github.com/halfrost/LeetCode-Go"></a>
<img src="https://img.shields.io/badge/runtime%20beats-100%25-success">
+<a href="https://codecov.io/gh/halfrost/LeetCode-Go"><img src="https://codecov.io/gh/halfrost/LeetCode-Go/branch/master/graph/badge.svg" /></a>
<!--<img alt="GitHub go.mod Go version" src="https://img.shields.io/github/go-mod/go-version/halfrost/LeetCode-Go?color=26C2F0">-->
<img alt="Support Go version" src="https://img.shields.io/badge/Go-v1.15-26C2F0">
<img src="https://visitor-badge.laobi.icu/badge?page_id=halfrost.LeetCode-Go">
</p>
<p align='center'>
-<a href="https://github.com/halfrost/LeetCode-Go/blob/master/LICENSE"><img alt="GitHub" src="https://img.shields.io/github/license/halfrost/LeetCode-Go?label=License"></a>
+<a href="https://github.com/halfrost/leetcode-go/blob/master/LICENSE"><img alt="GitHub" src="https://img.shields.io/github/license/halfrost/LeetCode-Go?label=License"></a>
<img src="https://img.shields.io/badge/License-CC-000000.svg">
<a href="https://leetcode.com/halfrost/"><img src="https://img.shields.io/badge/@halfrost-8751-yellow.svg">
<img src="https://img.shields.io/badge/language-Golang-26C2F0.svg">
@@ -80,6 +83,9 @@
* [✅ Segment Tree](#segment-tree)
* [✅ Binary Indexed Tree](#binary-indexed-tree)
+<br>
+<br>
+
| 数据结构 | 变种 | 相关题目 | 讲解文章 |
|:-------:|:-------|:------|:------|
|顺序线性表：向量||||
@@ -116,1551 +122,2469 @@
## LeetCode Problems
-## 一. 目录
+## 一. 个人数据
+
+| | Easy | Medium | Hard | Total |
+|:--------:|:--------:|:--------:|:--------:|:--------:|
+|Optimizing|31|78|43|152|
+|Accepted|**287**|**484**|**142**|**913**|
+|Total|600|1305|539|2444|
+|Perfection Rate|89.2%|83.9%|69.7%|83.4%|
+|Completion Rate|47.8%|37.1%|26.3%|37.4%|
+|------------|----------------------------|----------------------------|----------------------------|----------------------------|
-| # | Title | Solution | Acceptance | Difficulty | Frequency |
+## 二. 目录
+
+以下已经收录了 787 道题的题解，还有 11 道题在尝试优化到 beats 100%
+
+| No. | Title | Solution | Acceptance | Difficulty | Frequency |
|:--------:|:--------------------------------------------------------------|:--------:|:--------:|:--------:|:--------:|
-| 0001 | Two Sum | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0001.Two-Sum) | 45.6% | Easy | |
-| 0002 | Add Two Numbers | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0002.Add-Two-Numbers) | 33.9% | Medium | |
-| 0003 | Longest Substring Without Repeating Characters | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0003.Longest-Substring-Without-Repeating-Characters) | 30.4% | Medium | |
-| 0004 | Median of Two Sorted Arrays | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0004.Median-of-Two-Sorted-Arrays) | 29.6% | Hard | |
-| 0005 | Longest Palindromic Substring | | 29.4% | Medium | |
-| 0006 | ZigZag Conversion | | 36.3% | Medium | |
-| 0007 | Reverse Integer | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0007.Reverse-Integer) | 25.8% | Easy | |
-| 0008 | String to Integer (atoi) | | 15.4% | Medium | |
-| 0009 | Palindrome Number | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0009.Palindrome-Number) | 48.4% | Easy | |
-| 0010 | Regular Expression Matching | | 26.8% | Hard | |
-| 0011 | Container With Most Water | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0011.Container-With-Most-Water) | 50.8% | Medium | |
-| 0012 | Integer to Roman | | 55.0% | Medium | |
-| 0013 | Roman to Integer | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0013.Roman-to-Integer) | 55.7% | Easy | |
-| 0014 | Longest Common Prefix | | 35.4% | Easy | |
-| 0015 | 3Sum | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0015.3Sum) | 26.8% | Medium | |
-| 0016 | 3Sum Closest | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0016.3Sum-Closest) | 46.0% | Medium | |
-| 0017 | Letter Combinations of a Phone Number | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0017.Letter-Combinations-of-a-Phone-Number) | 46.8% | Medium | |
-| 0018 | 4Sum | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0018.4Sum) | 33.6% | Medium | |
-| 0019 | Remove Nth Node From End of List | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0019.Remove-Nth-Node-From-End-of-List) | 35.2% | Medium | |
-| 0020 | Valid Parentheses | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0020.Valid-Parentheses) | 38.9% | Easy | |
-| 0021 | Merge Two Sorted Lists | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0021.Merge-Two-Sorted-Lists) | 53.5% | Easy | |
-| 0022 | Generate Parentheses | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0022.Generate-Parentheses) | 62.6% | Medium | |
-| 0023 | Merge k Sorted Lists | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0023.Merge-k-Sorted-Lists) | 40.2% | Hard | |
-| 0024 | Swap Nodes in Pairs | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0024.Swap-Nodes-in-Pairs) | 50.3% | Medium | |
-| 0025 | Reverse Nodes in k-Group | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0025.Reverse-Nodes-in-k-Group) | 42.0% | Hard | |
-| 0026 | Remove Duplicates from Sorted Array | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0026.Remove-Duplicates-from-Sorted-Array) | 45.1% | Easy | |
-| 0027 | Remove Element | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0027.Remove-Element) | 48.2% | Easy | |
-| 0028 | Implement strStr() | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0028.Implement-strStr) | 34.5% | Easy | |
-| 0029 | Divide Two Integers | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0029.Divide-Two-Integers) | 16.4% | Medium | |
-| 0030 | Substring with Concatenation of All Words | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0030.Substring-with-Concatenation-of-All-Words)(是否还有更优解) | 25.4% | Hard | |
-| 0031 | Next Permutation | | 32.6% | Medium | |
-| 0032 | Longest Valid Parentheses | | 28.4% | Hard | |
-| 0033 | Search in Rotated Sorted Array | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0033.Search-in-Rotated-Sorted-Array) | 34.5% | Medium | |
-| 0034 | Find First and Last Position of Element in Sorted Array | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0034.Find-First-and-Last-Position-of-Element-in-Sorted-Array) | 36.1% | Medium | |
-| 0035 | Search Insert Position | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0035.Search-Insert-Position) | 42.6% | Easy | |
-| 0036 | Valid Sudoku | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0036.Valid-Sudoku) | 48.7% | Medium | |
-| 0037 | Sudoku Solver | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0037.Sudoku-Solver) | 43.5% | Hard | |
-| 0038 | Count and Say | | 44.6% | Easy | |
-| 0039 | Combination Sum | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0039.Combination-Sum) | 56.0% | Medium | |
-| 0040 | Combination Sum II | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0040.Combination-Sum-II) | 48.1% | Medium | |
-| 0041 | First Missing Positive | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0041.First-Missing-Positive) | 32.0% | Hard | |
-| 0042 | Trapping Rain Water | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0042.Trapping-Rain-Water) | 48.8% | Hard | |
-| 0043 | Multiply Strings | | 33.9% | Medium | |
-| 0044 | Wildcard Matching | | 24.7% | Hard | |
-| 0045 | Jump Game II | | 30.5% | Hard | |
-| 0046 | Permutations | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0046.Permutations) | 63.5% | Medium | |
-| 0047 | Permutations II | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0047.Permutations-II) | 46.4% | Medium | |
-| 0048 | Rotate Image | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0048.Rotate-Image) | 56.6% | Medium | |
-| 0049 | Group Anagrams | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0049.Group-Anagrams) | 56.8% | Medium | |
-| 0050 | Pow(x, n) | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0050.Powx-n) | 30.3% | Medium | |
-| 0051 | N-Queens | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0051.N-Queens) | 46.6% | Hard | |
-| 0052 | N-Queens II | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0052.N-Queens-II) | 57.8% | Hard | |
-| 0053 | Maximum Subarray | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0053.Maximum-Subarray) | 46.5% | Easy | |
-| 0054 | Spiral Matrix | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0054.Spiral-Matrix) | 34.1% | Medium | |
-| 0055 | Jump Game | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0055.Jump-Game) | 34.6% | Medium | |
-| 0056 | Merge Intervals | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0056.Merge-Intervals) | 39.3% | Medium | |
-| 0057 | Insert Interval | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0057.Insert-Interval) | 33.5% | Hard | |
-| 0058 | Length of Last Word | | 32.6% | Easy | |
-| 0059 | Spiral Matrix II | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0059.Spiral-Matrix-II) | 53.8% | Medium | |
-| 0060 | Permutation Sequence | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0060.Permutation-Sequence) | 38.4% | Hard | |
-| 0061 | Rotate List | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0061.Rotate-List) | 30.0% | Medium | |
-| 0062 | Unique Paths | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0062.Unique-Paths) | 54.1% | Medium | |
-| 0063 | Unique Paths II | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0063.Unique-Paths-II) | 34.5% | Medium | |
-| 0064 | Minimum Path Sum | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0064.Minimum-Path-Sum) | 54.4% | Medium | |
-| 0065 | Valid Number | | 15.3% | Hard | |
-| 0066 | Plus One | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0066.Plus-One) | 43.0% | Easy | |
-| 0067 | Add Binary | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0067.Add-Binary) | 45.2% | Easy | |
-| 0068 | Text Justification | | 27.7% | Hard | |
-| 0069 | Sqrt(x) | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0069.Sqrtx) | 33.9% | Easy | |
-| 0070 | Climbing Stairs | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0070.Climbing-Stairs) | 47.8% | Easy | |
-| 0071 | Simplify Path | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0071.Simplify-Path) | 32.6% | Medium | |
-| 0072 | Edit Distance | | 44.8% | Hard | |
-| 0073 | Set Matrix Zeroes | | 43.1% | Medium | |
-| 0074 | Search a 2D Matrix | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0074.Search-a-2D-Matrix) | 36.5% | Medium | |
-| 0075 | Sort Colors | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0075.Sort-Colors) | 47.3% | Medium | |
-| 0076 | Minimum Window Substring | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0076.Minimum-Window-Substring) | 34.6% | Hard | |
-| 0077 | Combinations | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0077.Combinations) | 54.7% | Medium | |
-| 0078 | Subsets | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0078.Subsets) | 61.9% | Medium | |
-| 0079 | Word Search | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0079.Word-Search) | 35.6% | Medium | |
-| 0080 | Remove Duplicates from Sorted Array II | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0080.Remove-Duplicates-from-Sorted-Array-II) | 43.9% | Medium | |
-| 0081 | Search in Rotated Sorted Array II | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0081.Search-in-Rotated-Sorted-Array-II) | 33.0% | Medium | |
-| 0082 | Remove Duplicates from Sorted List II | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0082.Remove-Duplicates-from-Sorted-List-II) | 36.8% | Medium | |
-| 0083 | Remove Duplicates from Sorted List | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0083.Remove-Duplicates-from-Sorted-List) | 45.4% | Easy | |
-| 0084 | Largest Rectangle in Histogram | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0084.Largest-Rectangle-in-Histogram) | 35.1% | Hard | |
-| 0085 | Maximal Rectangle | | 37.7% | Hard | |
-| 0086 | Partition List | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0086.Partition-List) | 41.4% | Medium | |
-| 0087 | Scramble String | | 33.7% | Hard | |
-| 0088 | Merge Sorted Array | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0088.Merge-Sorted-Array) | 39.4% | Easy | |
-| 0089 | Gray Code | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0089.Gray-Code) | 49.1% | Medium | |
-| 0090 | Subsets II | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0090.Subsets-II) | 47.1% | Medium | |
-| 0091 | Decode Ways | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0091.Decode-Ways) | 24.6% | Medium | |
-| 0092 | Reverse Linked List II | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0092.Reverse-Linked-List-II) | 38.8% | Medium | |
-| 0093 | Restore IP Addresses | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0093.Restore-IP-Addresses) | 35.6% | Medium | |
-| 0094 | Binary Tree Inorder Traversal | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0094.Binary-Tree-Inorder-Traversal) | 63.3% | Medium | |
-| 0095 | Unique Binary Search Trees II | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0095.Unique-Binary-Search-Trees-II) | 40.6% | Medium | |
-| 0096 | Unique Binary Search Trees | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0096.Unique-Binary-Search-Trees) | 52.9% | Medium | |
-| 0097 | Interleaving String | | 31.5% | Hard | |
-| 0098 | Validate Binary Search Tree | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0098.Validate-Binary-Search-Tree) | 27.8% | Medium | |
-| 0099 | Recover Binary Search Tree | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0099.Recover-Binary-Search-Tree) | 39.6% | Hard | |
-| 0100 | Same Tree | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0100.Same-Tree) | 53.4% | Easy | |
-| 0101 | Symmetric Tree | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0101.Symmetric-Tree) | 46.8% | Easy | |
-| 0102 | Binary Tree Level Order Traversal | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0102.Binary-Tree-Level-Order-Traversal) | 54.5% | Medium | |
-| 0103 | Binary Tree Zigzag Level Order Traversal | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0103.Binary-Tree-Zigzag-Level-Order-Traversal) | 48.3% | Medium | |
-| 0104 | Maximum Depth of Binary Tree | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0104.Maximum-Depth-of-Binary-Tree) | 66.0% | Easy | |
-| 0105 | Construct Binary Tree from Preorder and Inorder Traversal | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0105.Construct-Binary-Tree-from-Preorder-and-Inorder-Traversal) | 48.8% | Medium | |
-| 0106 | Construct Binary Tree from Inorder and Postorder Traversal | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0106.Construct-Binary-Tree-from-Inorder-and-Postorder-Traversal) | 47.1% | Medium | |
-| 0107 | Binary Tree Level Order Traversal II | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0107.Binary-Tree-Level-Order-Traversal-II) | 53.5% | Easy | |
-| 0108 | Convert Sorted Array to Binary Search Tree | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0108.Convert-Sorted-Array-to-Binary-Search-Tree) | 57.9% | Easy | |
-| 0109 | Convert Sorted List to Binary Search Tree | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0109.Convert-Sorted-List-to-Binary-Search-Tree) | 47.6% | Medium | |
-| 0110 | Balanced Binary Tree | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0110.Balanced-Binary-Tree) | 43.5% | Easy | |
-| 0111 | Minimum Depth of Binary Tree | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0111.Minimum-Depth-of-Binary-Tree) | 37.4% | Easy | |
-| 0112 | Path Sum | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0112.Path-Sum) | 41.1% | Easy | |
-| 0113 | Path Sum II | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0113.Path-Sum-II) | 46.6% | Medium | |
-| 0114 | Flatten Binary Tree to Linked List | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0114.Flatten-Binary-Tree-to-Linked-List) | 49.2% | Medium | |
-| 0115 | Distinct Subsequences | | 38.2% | Hard | |
-| 0116 | Populating Next Right Pointers in Each Node | | 45.2% | Medium | |
-| 0117 | Populating Next Right Pointers in Each Node II | | 39.1% | Medium | |
-| 0118 | Pascal's Triangle | | 52.4% | Easy | |
-| 0119 | Pascal's Triangle II | | 49.0% | Easy | |
-| 0120 | Triangle | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0120.Triangle) | 44.1% | Medium | |
-| 0121 | Best Time to Buy and Sell Stock | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0121.Best-Time-to-Buy-and-Sell-Stock) | 50.4% | Easy | |
-| 0122 | Best Time to Buy and Sell Stock II | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0122.Best-Time-to-Buy-and-Sell-Stock-II) | 56.9% | Easy | |
-| 0123 | Best Time to Buy and Sell Stock III | | 37.4% | Hard | |
-| 0124 | Binary Tree Maximum Path Sum | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0124.Binary-Tree-Maximum-Path-Sum) | 34.3% | Hard | |
-| 0125 | Valid Palindrome | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0125.Valid-Palindrome) | 36.7% | Easy | |
-| 0126 | Word Ladder II | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0126.Word-Ladder-II) | 22.1% | Hard | |
-| 0127 | Word Ladder | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0127.Word-Ladder) | 29.5% | Medium | |
-| 0128 | Longest Consecutive Sequence | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0128.Longest-Consecutive-Sequence) | 45.1% | Hard | |
-| 0129 | Sum Root to Leaf Numbers | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0129.Sum-Root-to-Leaf-Numbers) | 49.0% | Medium | |
-| 0130 | Surrounded Regions | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0130.Surrounded-Regions) | 28.1% | Medium | |
-| 0131 | Palindrome Partitioning | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0131.Palindrome-Partitioning) | 47.5% | Medium | |
-| 0132 | Palindrome Partitioning II | | 30.2% | Hard | |
-| 0133 | Clone Graph | | 34.7% | Medium | |
-| 0134 | Gas Station | | 38.5% | Medium | |
-| 0135 | Candy | | 31.6% | Hard | |
-| 0136 | Single Number | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0136.Single-Number) | 65.5% | Easy | |
-| 0137 | Single Number II | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0137.Single-Number-II) | 52.4% | Medium | |
-| 0138 | Copy List with Random Pointer | | 36.3% | Medium | |
-| 0139 | Word Break | | 40.0% | Medium | |
-| 0140 | Word Break II | | 32.6% | Hard | |
-| 0141 | Linked List Cycle | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0141.Linked-List-Cycle) | 41.1% | Easy | |
-| 0142 | Linked List Cycle II | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0142.Linked-List-Cycle-II) | 37.3% | Medium | |
-| 0143 | Reorder List | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0143.Reorder-List) | 37.0% | Medium | |
-| 0144 | Binary Tree Preorder Traversal | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0144.Binary-Tree-Preorder-Traversal) | 55.6% | Medium | |
-| 0145 | Binary Tree Postorder Traversal | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0145.Binary-Tree-Postorder-Traversal) | 54.9% | Hard | |
-| 0146 | LRU Cache | | 33.1% | Medium | |
-| 0147 | Insertion Sort List | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0147.Insertion-Sort-List) | 41.1% | Medium | |
-| 0148 | Sort List | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0148.Sort-List) | 42.3% | Medium | |
-| 0149 | Max Points on a Line | | 16.9% | Hard | |
-| 0150 | Evaluate Reverse Polish Notation | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0150.Evaluate-Reverse-Polish-Notation) | 36.3% | Medium | |
-| 0151 | Reverse Words in a String | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0151.Reverse-Words-in-a-String) | 21.9% | Medium | |
-| 0152 | Maximum Product Subarray | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0152.Maximum-Product-Subarray) | 31.7% | Medium | |
-| 0153 | Find Minimum in Rotated Sorted Array | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0153.Find-Minimum-in-Rotated-Sorted-Array) | 45.1% | Medium | |
-| 0154 | Find Minimum in Rotated Sorted Array II | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0154.Find-Minimum-in-Rotated-Sorted-Array-II) | 41.6% | Hard | |
-| 0155 | Min Stack | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0155.Min-Stack) | 44.4% | Easy | |
-| 0156 | Binary Tree Upside Down | | 55.0% | Medium | |
-| 0157 | Read N Characters Given Read4 | | 34.2% | Easy | |
-| 0158 | Read N Characters Given Read4 II - Call multiple times | | 33.7% | Hard | |
-| 0159 | Longest Substring with At Most Two Distinct Characters | | 49.4% | Medium | |
-| 0160 | Intersection of Two Linked Lists | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0160.Intersection-of-Two-Linked-Lists) | 40.5% | Easy | |
-| 0161 | One Edit Distance | | 32.3% | Medium | |
-| 0162 | Find Peak Element | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0162.Find-Peak-Element) | 43.3% | Medium | |
-| 0163 | Missing Ranges | | 24.3% | Medium | |
-| 0164 | Maximum Gap | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0164.Maximum-Gap) | 35.4% | Hard | |
-| 0165 | Compare Version Numbers | | 27.4% | Medium | |
-| 0166 | Fraction to Recurring Decimal | | 21.6% | Medium | |
-| 0167 | Two Sum II - Input array is sorted | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0167.Two-Sum-II---Input-array-is-sorted) | 54.0% | Easy | |
-| 0168 | Excel Sheet Column Title | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0168.Excel-Sheet-Column-Title) | 31.0% | Easy | |
-| 0169 | Majority Element | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0169.Majority-Element) | 58.7% | Easy | |
-| 0170 | Two Sum III - Data structure design | | 33.5% | Easy | |
-| 0171 | Excel Sheet Column Number | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0171.Excel-Sheet-Column-Number) | 54.6% | Easy | |
-| 0172 | Factorial Trailing Zeroes | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0172.Factorial-Trailing-Zeroes) | 37.8% | Easy | |
-| 0173 | Binary Search Tree Iterator | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0173.Binary-Search-Tree-Iterator) | 56.5% | Medium | |
-| 0174 | Dungeon Game | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0174.Dungeon-Game) | 32.3% | Hard | |
-| 0175 | Combine Two Tables | | 60.7% | Easy | |
-| 0176 | Second Highest Salary | | 31.6% | Easy | |
-| 0177 | Nth Highest Salary | | 31.3% | Medium | |
-| 0178 | Rank Scores | | 45.8% | Medium | |
-| 0179 | Largest Number | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0179.Largest-Number) | 28.7% | Medium | |
-| 0180 | Consecutive Numbers | | 39.7% | Medium | |
-| 0181 | Employees Earning More Than Their Managers | | 56.8% | Easy | |
-| 0182 | Duplicate Emails | | 62.0% | Easy | |
-| 0183 | Customers Who Never Order | | 53.4% | Easy | |
-| 0184 | Department Highest Salary | | 36.6% | Medium | |
-| 0185 | Department Top Three Salaries | | 34.5% | Hard | |
-| 0186 | Reverse Words in a String II | | 43.3% | Medium | |
-| 0187 | Repeated DNA Sequences | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0187.Repeated-DNA-Sequences) | 38.9% | Medium | |
-| 0188 | Best Time to Buy and Sell Stock IV | | 28.0% | Hard | |
-| 0189 | Rotate Array | | 34.7% | Easy | |
-| 0190 | Reverse Bits | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0190.Reverse-Bits) | 39.7% | Easy | |
-| 0191 | Number of 1 Bits | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0191.Number-of-1-Bits) | 49.8% | Easy | |
-| 0192 | Word Frequency | | 25.8% | Medium | |
-| 0193 | Valid Phone Numbers | | 25.3% | Easy | |
-| 0194 | Transpose File | | 24.1% | Medium | |
-| 0195 | Tenth Line | | 33.0% | Easy | |
-| 0196 | Delete Duplicate Emails | | 41.0% | Easy | |
-| 0197 | Rising Temperature | | 38.4% | Easy | |
-| 0198 | House Robber | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0198.House-Robber) | 42.0% | Easy | |
-| 0199 | Binary Tree Right Side View | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0199.Binary-Tree-Right-Side-View) | 54.0% | Medium | |
-| 0200 | Number of Islands | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0200.Number-of-Islands) | 46.8% | Medium | |
-| 0201 | Bitwise AND of Numbers Range | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0201.Bitwise-AND-of-Numbers-Range) | 39.3% | Medium | |
-| 0202 | Happy Number | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0202.Happy-Number) | 50.4% | Easy | |
-| 0203 | Remove Linked List Elements | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0203.Remove-Linked-List-Elements) | 38.6% | Easy | |
-| 0204 | Count Primes | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0204.Count-Primes) | 31.5% | Easy | |
-| 0205 | Isomorphic Strings | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0205.Isomorphic-Strings) | 39.8% | Easy | |
-| 0206 | Reverse Linked List | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0206.Reverse-Linked-List) | 62.5% | Easy | |
-| 0207 | Course Schedule | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0207.Course-Schedule) | 43.1% | Medium | |
-| 0208 | Implement Trie (Prefix Tree) | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0208.Implement-Trie-Prefix-Tree) | 49.3% | Medium | |
-| 0209 | Minimum Size Subarray Sum | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0209.Minimum-Size-Subarray-Sum) | 38.1% | Medium | |
-| 0210 | Course Schedule II | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0210.Course-Schedule-II) | 40.7% | Medium | |
-| 0211 | Add and Search Word - Data structure design | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0211.Add-and-Search-Word---Data-structure-design) | 38.1% | Medium | |
-| 0212 | Word Search II | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0212.Word-Search-II) | 34.8% | Hard | |
-| 0213 | House Robber II | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0213.House-Robber-II) | 36.5% | Medium | |
-| 0214 | Shortest Palindrome | | 29.8% | Hard | |
-| 0215 | Kth Largest Element in an Array | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0215.Kth-Largest-Element-in-an-Array) | 55.3% | Medium | |
-| 0216 | Combination Sum III | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0216.Combination-Sum-III) | 56.5% | Medium | |
-| 0217 | Contains Duplicate | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0217.Contains-Duplicate) | 56.0% | Easy | |
-| 0218 | The Skyline Problem | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0218.The-Skyline-Problem) | 34.5% | Hard | |
-| 0219 | Contains Duplicate II | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0219.Contains-Duplicate-II) | 37.7% | Easy | |
-| 0220 | Contains Duplicate III | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0220.Contains-Duplicate-III) | 20.9% | Medium | |
-| 0221 | Maximal Square | | 37.7% | Medium | |
-| 0222 | Count Complete Tree Nodes | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0222.Count-Complete-Tree-Nodes) | 46.7% | Medium | |
-| 0223 | Rectangle Area | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0223.Rectangle-Area) | 37.8% | Medium | |
-| 0224 | Basic Calculator | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0224.Basic-Calculator) | 36.8% | Hard | |
-| 0225 | Implement Stack using Queues | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0225.Implement-Stack-using-Queues) | 45.1% | Easy | |
-| 0226 | Invert Binary Tree | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0226.Invert-Binary-Tree) | 64.9% | Easy | |
-| 0227 | Basic Calculator II | | 36.9% | Medium | |
-| 0228 | Summary Ranges | | 39.5% | Medium | |
-| 0229 | Majority Element II | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0229.Majority-Element-II) | 35.6% | Medium | |
-| 0230 | Kth Smallest Element in a BST | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0230.Kth-Smallest-Element-in-a-BST) | 60.2% | Medium | |
-| 0231 | Power of Two | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0231.Power-of-Two) | 43.7% | Easy | |
-| 0232 | Implement Queue using Stacks | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0232.Implement-Queue-using-Stacks) | 49.5% | Easy | |
-| 0233 | Number of Digit One | | 31.3% | Hard | |
-| 0234 | Palindrome Linked List | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0234.Palindrome-Linked-List) | 39.2% | Easy | |
-| 0235 | Lowest Common Ancestor of a Binary Search Tree | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0235.Lowest-Common-Ancestor-of-a-Binary-Search-Tree) | 49.9% | Easy | |
-| 0236 | Lowest Common Ancestor of a Binary Tree | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0236.Lowest-Common-Ancestor-of-a-Binary-Tree) | 45.6% | Medium | |
-| 0237 | Delete Node in a Linked List | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0237.Delete-Node-in-a-Linked-List) | 63.7% | Easy | |
-| 0238 | Product of Array Except Self | | 60.1% | Medium | |
-| 0239 | Sliding Window Maximum | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0239.Sliding-Window-Maximum) | 43.0% | Hard | |
-| 0240 | Search a 2D Matrix II | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0240.Search-a-2D-Matrix-II) | 43.1% | Medium | |
-| 0241 | Different Ways to Add Parentheses | | 55.2% | Medium | |
-| 0242 | Valid Anagram | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0242.Valid-Anagram) | 56.8% | Easy | |
-| 0243 | Shortest Word Distance | | 61.0% | Easy | |
-| 0244 | Shortest Word Distance II | | 52.3% | Medium | |
-| 0245 | Shortest Word Distance III | | 55.3% | Medium | |
-| 0246 | Strobogrammatic Number | | 45.0% | Easy | |
-| 0247 | Strobogrammatic Number II | | 47.6% | Medium | |
-| 0248 | Strobogrammatic Number III | | 39.6% | Hard | |
-| 0249 | Group Shifted Strings | | 55.0% | Medium | |
-| 0250 | Count Univalue Subtrees | | 51.9% | Medium | |
-| 0251 | Flatten 2D Vector | | 45.7% | Medium | |
-| 0252 | Meeting Rooms | | 54.6% | Easy | |
-| 0253 | Meeting Rooms II | | 45.7% | Medium | |
-| 0254 | Factor Combinations | | 46.7% | Medium | |
-| 0255 | Verify Preorder Sequence in Binary Search Tree | | 45.7% | Medium | |
-| 0256 | Paint House | | 52.1% | Easy | |
-| 0257 | Binary Tree Paths | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0257.Binary-Tree-Paths) | 51.4% | Easy | |
-| 0258 | Add Digits | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0258.Add-Digits) | 57.6% | Easy | |
-| 0259 | 3Sum Smaller | | 47.6% | Medium | |
-| 0260 | Single Number III | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0260.Single-Number-III) | 64.3% | Medium | |
-| 0261 | Graph Valid Tree | | 42.2% | Medium | |
-| 0262 | Trips and Users | | 32.6% | Hard | |
-| 0263 | Ugly Number | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0263.Ugly-Number) | 41.6% | Easy | |
-| 0264 | Ugly Number II | | 42.0% | Medium | |
-| 0265 | Paint House II | | 44.6% | Hard | |
-| 0266 | Palindrome Permutation | | 61.9% | Easy | |
-| 0267 | Palindrome Permutation II | | 36.4% | Medium | |
-| 0268 | Missing Number | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0268.Missing-Number) | 51.7% | Easy | |
-| 0269 | Alien Dictionary | | 33.3% | Hard | |
-| 0270 | Closest Binary Search Tree Value | | 48.1% | Easy | |
-| 0271 | Encode and Decode Strings | | 31.5% | Medium | |
-| 0272 | Closest Binary Search Tree Value II | | 50.5% | Hard | |
-| 0273 | Integer to English Words | | 27.0% | Hard | |
-| 0274 | H-Index | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0274.H-Index) | 35.9% | Medium | |
-| 0275 | H-Index II | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0275.H-Index-II) | 35.9% | Medium | |
-| 0276 | Paint Fence | | 38.3% | Easy | |
-| 0277 | Find the Celebrity | | 41.8% | Medium | |
-| 0278 | First Bad Version | | 35.7% | Easy | |
-| 0279 | Perfect Squares | | 47.3% | Medium | |
-| 0280 | Wiggle Sort | | 63.8% | Medium | |
-| 0281 | Zigzag Iterator | | 58.4% | Medium | |
-| 0282 | Expression Add Operators | | 35.5% | Hard | |
-| 0283 | Move Zeroes | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0283.Move-Zeroes) | 57.8% | Easy | |
-| 0284 | Peeking Iterator | | 45.6% | Medium | |
-| 0285 | Inorder Successor in BST | | 40.3% | Medium | |
-| 0286 | Walls and Gates | | 54.5% | Medium | |
-| 0287 | Find the Duplicate Number | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0287.Find-the-Duplicate-Number) | 55.5% | Medium | |
-| 0288 | Unique Word Abbreviation | | 21.9% | Medium | |
-| 0289 | Game of Life | | 54.4% | Medium | |
-| 0290 | Word Pattern | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0290.Word-Pattern) | 37.0% | Easy | |
-| 0291 | Word Pattern II | | 43.4% | Hard | |
-| 0292 | Nim Game | | 54.9% | Easy | |
-| 0293 | Flip Game | | 60.6% | Easy | |
-| 0294 | Flip Game II | | 50.0% | Medium | |
-| 0295 | Find Median from Data Stream | | 44.3% | Hard | |
-| 0296 | Best Meeting Point | | 57.5% | Hard | |
-| 0297 | Serialize and Deserialize Binary Tree | | 47.4% | Hard | |
-| 0298 | Binary Tree Longest Consecutive Sequence | | 47.1% | Medium | |
-| 0299 | Bulls and Cows | | 42.4% | Easy | |
-| 0300 | Longest Increasing Subsequence | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0300.Longest-Increasing-Subsequence) | 42.6% | Medium | |
-| 0301 | Remove Invalid Parentheses | | 43.3% | Hard | |
-| 0302 | Smallest Rectangle Enclosing Black Pixels | | 51.6% | Hard | |
-| 0303 | Range Sum Query - Immutable | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0303.Range-Sum-Query---Immutable) | 44.7% | Easy | |
-| 0304 | Range Sum Query 2D - Immutable | | 38.5% | Medium | |
-| 0305 | Number of Islands II | | 40.1% | Hard | |
-| 0306 | Additive Number | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0306.Additive-Number) | 29.3% | Medium | |
-| 0307 | Range Sum Query - Mutable | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0307.Range-Sum-Query---Mutable) | 34.6% | Medium | |
-| 0308 | Range Sum Query 2D - Mutable | | 35.6% | Hard | |
-| 0309 | Best Time to Buy and Sell Stock with Cooldown | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0309.Best-Time-to-Buy-and-Sell-Stock-with-Cooldown) | 47.4% | Medium | |
-| 0310 | Minimum Height Trees | | 32.3% | Medium | |
-| 0311 | Sparse Matrix Multiplication | | 61.8% | Medium | |
-| 0312 | Burst Balloons | | 51.7% | Hard | |
-| 0313 | Super Ugly Number | | 45.0% | Medium | |
-| 0314 | Binary Tree Vertical Order Traversal | | 45.2% | Medium | |
-| 0315 | Count of Smaller Numbers After Self | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0315.Count-of-Smaller-Numbers-After-Self) | 41.5% | Hard | |
-| 0316 | Remove Duplicate Letters | | 35.8% | Hard | |
-| 0317 | Shortest Distance from All Buildings | | 41.4% | Hard | |
-| 0318 | Maximum Product of Word Lengths | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0318.Maximum-Product-of-Word-Lengths) | 51.2% | Medium | |
-| 0319 | Bulb Switcher | | 45.4% | Medium | |
-| 0320 | Generalized Abbreviation | | 52.0% | Medium | |
-| 0321 | Create Maximum Number | | 27.0% | Hard | |
-| 0322 | Coin Change | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0322.Coin-Change) | 35.4% | Medium | |
-| 0323 | Number of Connected Components in an Undirected Graph | | 56.0% | Medium | |
-| 0324 | Wiggle Sort II | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0324.Wiggle-Sort-II) | 29.9% | Medium | |
-| 0325 | Maximum Size Subarray Sum Equals k | | 46.8% | Medium | |
-| 0326 | Power of Three | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0326.Power-of-Three) | 42.1% | Easy | |
-| 0327 | Count of Range Sum | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0327.Count-of-Range-Sum) | 35.1% | Hard | |
-| 0328 | Odd Even Linked List | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0328.Odd-Even-Linked-List) | 55.7% | Medium | |
-| 0329 | Longest Increasing Path in a Matrix | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0329.Longest-Increasing-Path-in-a-Matrix) | 43.4% | Hard | |
-| 0330 | Patching Array | | 34.5% | Hard | |
-| 0331 | Verify Preorder Serialization of a Binary Tree | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0331.Verify-Preorder-Serialization-of-a-Binary-Tree) | 40.4% | Medium | |
-| 0332 | Reconstruct Itinerary | | 36.7% | Medium | |
-| 0333 | Largest BST Subtree | | 35.8% | Medium | |
-| 0334 | Increasing Triplet Subsequence | | 40.0% | Medium | |
-| 0335 | Self Crossing | | 28.0% | Hard | |
-| 0336 | Palindrome Pairs | | 33.7% | Hard | |
-| 0337 | House Robber III | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0337.House-Robber-III) | 50.6% | Medium | |
-| 0338 | Counting Bits | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0338.Counting-Bits) | 69.5% | Medium | |
-| 0339 | Nested List Weight Sum | | 73.9% | Easy | |
-| 0340 | Longest Substring with At Most K Distinct Characters | | 44.0% | Hard | |
-| 0341 | Flatten Nested List Iterator | | 52.9% | Medium | |
-| 0342 | Power of Four | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0342.Power-of-Four) | 41.7% | Easy | |
-| 0343 | Integer Break | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0343.Integer-Break) | 50.4% | Medium | |
-| 0344 | Reverse String | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0344.Reverse-String) | 68.5% | Easy | |
-| 0345 | Reverse Vowels of a String | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0345.Reverse-Vowels-of-a-String) | 44.2% | Easy | |
-| 0346 | Moving Average from Data Stream | | 70.9% | Easy | |
-| 0347 | Top K Frequent Elements | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0347.Top-K-Frequent-Elements) | 61.2% | Medium | |
-| 0348 | Design Tic-Tac-Toe | | 54.3% | Medium | |
-| 0349 | Intersection of Two Arrays | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0349.Intersection-of-Two-Arrays) | 62.5% | Easy | |
-| 0350 | Intersection of Two Arrays II | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0350.Intersection-of-Two-Arrays-II) | 51.3% | Easy | |
-| 0351 | Android Unlock Patterns | | 48.4% | Medium | |
-| 0352 | Data Stream as Disjoint Intervals | | 47.3% | Hard | |
-| 0353 | Design Snake Game | | 34.1% | Medium | |
-| 0354 | Russian Doll Envelopes | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0354.Russian-Doll-Envelopes) | 35.6% | Hard | |
-| 0355 | Design Twitter | | 30.3% | Medium | |
-| 0356 | Line Reflection | | 31.8% | Medium | |
-| 0357 | Count Numbers with Unique Digits | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0357.Count-Numbers-with-Unique-Digits) | 48.4% | Medium | |
-| 0358 | Rearrange String k Distance Apart | | 34.9% | Hard | |
-| 0359 | Logger Rate Limiter | | 70.8% | Easy | |
-| 0360 | Sort Transformed Array | | 48.8% | Medium | |
-| 0361 | Bomb Enemy | | 46.0% | Medium | |
-| 0362 | Design Hit Counter | | 63.6% | Medium | |
-| 0363 | Max Sum of Rectangle No Larger Than K | | 37.3% | Hard | |
-| 0364 | Nested List Weight Sum II | | 62.7% | Medium | |
-| 0365 | Water and Jug Problem | | 30.6% | Medium | |
-| 0366 | Find Leaves of Binary Tree | | 70.6% | Medium | |
-| 0367 | Valid Perfect Square | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0367.Valid-Perfect-Square) | 41.7% | Easy | |
-| 0368 | Largest Divisible Subset | | 38.1% | Medium | |
-| 0369 | Plus One Linked List | | 58.2% | Medium | |
-| 0370 | Range Addition | | 62.8% | Medium | |
-| 0371 | Sum of Two Integers | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0371.Sum-of-Two-Integers) | 50.7% | Medium | |
-| 0372 | Super Pow | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0372.Super-Pow) | 36.4% | Medium | |
-| 0373 | Find K Pairs with Smallest Sums | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0373.Find-K-Pairs-with-Smallest-Sums) | 36.7% | Medium | |
-| 0374 | Guess Number Higher or Lower | | 43.0% | Easy | |
-| 0375 | Guess Number Higher or Lower II | | 40.3% | Medium | |
-| 0376 | Wiggle Subsequence | | 39.6% | Medium | |
-| 0377 | Combination Sum IV | | 45.3% | Medium | |
-| 0378 | Kth Smallest Element in a Sorted Matrix | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0378.Kth-Smallest-Element-in-a-Sorted-Matrix) | 54.3% | Medium | |
-| 0379 | Design Phone Directory | | 46.8% | Medium | |
-| 0380 | Insert Delete GetRandom O(1) | | 47.5% | Medium | |
-| 0381 | Insert Delete GetRandom O(1) - Duplicates allowed | | 34.1% | Hard | |
-| 0382 | Linked List Random Node | | 52.1% | Medium | |
-| 0383 | Ransom Note | | 53.1% | Easy | |
-| 0384 | Shuffle an Array | | 52.8% | Medium | |
-| 0385 | Mini Parser | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0385.Mini-Parser) | 33.8% | Medium | |
-| 0386 | Lexicographical Numbers | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0386.Lexicographical-Numbers) | 51.6% | Medium | |
-| 0387 | First Unique Character in a String | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0387.First-Unique-Character-in-a-String) | 53.3% | Easy | |
-| 0388 | Longest Absolute File Path | | 41.7% | Medium | |
-| 0389 | Find the Difference | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0389.Find-the-Difference) | 55.3% | Easy | |
-| 0390 | Elimination Game | | 44.5% | Medium | |
-| 0391 | Perfect Rectangle | | 30.4% | Hard | |
-| 0392 | Is Subsequence | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0392.Is-Subsequence) | 49.2% | Easy | |
-| 0393 | UTF-8 Validation | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0393.UTF-8-Validation) | 37.5% | Medium | |
-| 0394 | Decode String | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0394.Decode-String) | 49.9% | Medium | |
-| 0395 | Longest Substring with At Least K Repeating Characters | | 41.4% | Medium | |
-| 0396 | Rotate Function | | 36.3% | Medium | |
-| 0397 | Integer Replacement | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0397.Integer-Replacement) | 32.9% | Medium | |
-| 0398 | Random Pick Index | | 55.9% | Medium | |
-| 0399 | Evaluate Division | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0399.Evaluate-Division) | 51.6% | Medium | |
-| 0400 | Nth Digit | | 31.7% | Medium | |
-| 0401 | Binary Watch | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0401.Binary-Watch) | 47.5% | Easy | |
-| 0402 | Remove K Digits | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0402.Remove-K-Digits) | 28.4% | Medium | |
-| 0403 | Frog Jump | | 39.7% | Hard | |
-| 0404 | Sum of Left Leaves | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0404.Sum-of-Left-Leaves) | 50.9% | Easy | |
-| 0405 | Convert a Number to Hexadecimal | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0405.Convert-a-Number-to-Hexadecimal) | 43.9% | Easy | |
-| 0406 | Queue Reconstruction by Height | | 66.8% | Medium | |
-| 0407 | Trapping Rain Water II | | 42.4% | Hard | |
-| 0408 | Valid Word Abbreviation | | 30.6% | Easy | |
-| 0409 | Longest Palindrome | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0409.Longest-Palindrome) | 50.3% | Easy | |
-| 0410 | Split Array Largest Sum | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0410.Split-Array-Largest-Sum) | 44.5% | Hard | |
-| 0411 | Minimum Unique Word Abbreviation | | 36.3% | Hard | |
-| 0412 | Fizz Buzz | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0412.Fizz-Buzz) | 62.3% | Easy | |
-| 0413 | Arithmetic Slices | | 57.9% | Medium | |
-| 0414 | Third Maximum Number | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0414.Third-Maximum-Number) | 30.5% | Easy | |
-| 0415 | Add Strings | | 47.5% | Easy | |
-| 0416 | Partition Equal Subset Sum | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0416.Partition-Equal-Subset-Sum) | 43.7% | Medium | |
-| 0417 | Pacific Atlantic Water Flow | | 41.1% | Medium | |
-| 0418 | Sentence Screen Fitting | | 32.6% | Medium | |
-| 0419 | Battleships in a Board | | 70.0% | Medium | |
-| 0420 | Strong Password Checker | | 14.1% | Hard | |
-| 0421 | Maximum XOR of Two Numbers in an Array | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0421.Maximum-XOR-of-Two-Numbers-in-an-Array) | 53.5% | Medium | |
-| 0422 | Valid Word Square | | 37.7% | Easy | |
-| 0423 | Reconstruct Original Digits from English | | 46.9% | Medium | |
-| 0424 | Longest Repeating Character Replacement | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0424.Longest-Repeating-Character-Replacement) | 47.0% | Medium | |
-| 0425 | Word Squares | | 47.6% | Hard | |
-| 0426 | Convert Binary Search Tree to Sorted Doubly Linked List | | 59.1% | Medium | |
-| 0427 | Construct Quad Tree | | 61.4% | Medium | |
-| 0428 | Serialize and Deserialize N-ary Tree | | 59.4% | Hard | |
-| 0429 | N-ary Tree Level Order Traversal | | 65.0% | Medium | |
-| 0430 | Flatten a Multilevel Doubly Linked List | | 55.1% | Medium | |
-| 0431 | Encode N-ary Tree to Binary Tree | | 70.8% | Hard | |
-| 0432 | All O`one Data Structure | | 32.4% | Hard | |
-| 0433 | Minimum Genetic Mutation | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0433.Minimum-Genetic-Mutation) | 41.8% | Medium | |
-| 0434 | Number of Segments in a String | | 37.7% | Easy | |
-| 0435 | Non-overlapping Intervals | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0435.Non-overlapping-Intervals) | 42.9% | Medium | |
-| 0436 | Find Right Interval | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0436.Find-Right-Interval) | 45.4% | Medium | |
-| 0437 | Path Sum III | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0437.Path-Sum-III) | 46.5% | Medium | |
-| 0438 | Find All Anagrams in a String | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0438.Find-All-Anagrams-in-a-String) | 43.3% | Medium | |
-| 0439 | Ternary Expression Parser | | 55.9% | Medium | |
-| 0440 | K-th Smallest in Lexicographical Order | | 29.1% | Hard | |
-| 0441 | Arranging Coins | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0441.Arranging-Coins) | 41.8% | Easy | |
-| 0442 | Find All Duplicates in an Array | | 67.7% | Medium | |
-| 0443 | String Compression | | 41.3% | Easy | |
-| 0444 | Sequence Reconstruction | | 22.2% | Medium | |
-| 0445 | Add Two Numbers II | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0445.Add-Two-Numbers-II) | 54.5% | Medium | |
-| 0446 | Arithmetic Slices II - Subsequence | | 32.7% | Hard | |
-| 0447 | Number of Boomerangs | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0447.Number-of-Boomerangs) | 51.8% | Easy | |
-| 0448 | Find All Numbers Disappeared in an Array | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0448.Find-All-Numbers-Disappeared-in-an-Array) | 55.9% | Easy | |
-| 0449 | Serialize and Deserialize BST | | 52.0% | Medium | |
-| 0450 | Delete Node in a BST | | 43.1% | Medium | |
-| 0451 | Sort Characters By Frequency | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0451.Sort-Characters-By-Frequency) | 63.0% | Medium | |
-| 0452 | Minimum Number of Arrows to Burst Balloons | | 49.6% | Medium | |
-| 0453 | Minimum Moves to Equal Array Elements | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0453.Minimum-Moves-to-Equal-Array-Elements) | 50.2% | Easy | |
-| 0454 | 4Sum II | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0454.4Sum-II) | 53.1% | Medium | |
-| 0455 | Assign Cookies | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0455.Assign-Cookies) | 49.9% | Easy | |
-| 0456 | 132 Pattern | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0456.132-Pattern) | 28.9% | Medium | |
-| 0457 | Circular Array Loop | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0457.Circular-Array-Loop) | 29.4% | Medium | |
-| 0458 | Poor Pigs | | 47.4% | Hard | |
-| 0459 | Repeated Substring Pattern | | 42.2% | Easy | |
-| 0460 | LFU Cache | | 34.2% | Hard | |
-| 0461 | Hamming Distance | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0461.Hamming-Distance) | 72.8% | Easy | |
-| 0462 | Minimum Moves to Equal Array Elements II | | 53.8% | Medium | |
-| 0463 | Island Perimeter | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0463.Island-Perimeter) | 65.7% | Easy | |
-| 0464 | Can I Win | | 28.8% | Medium | |
-| 0465 | Optimal Account Balancing | | 46.8% | Hard | |
-| 0466 | Count The Repetitions | | 28.2% | Hard | |
-| 0467 | Unique Substrings in Wraparound String | | 35.6% | Medium | |
-| 0468 | Validate IP Address | | 24.0% | Medium | |
-| 0469 | Convex Polygon | | 37.0% | Medium | |
-| 0470 | Implement Rand10() Using Rand7() | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0470.Implement-Rand10-Using-Rand7) | 46.3% | Medium | |
-| 0471 | Encode String with Shortest Length | | 47.1% | Hard | |
-| 0472 | Concatenated Words | | 43.6% | Hard | |
-| 0473 | Matchsticks to Square | | 37.7% | Medium | |
-| 0474 | Ones and Zeroes | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0474.Ones-and-Zeroes) | 42.8% | Medium | |
-| 0475 | Heaters | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0475.Heaters) | 33.1% | Easy | |
-| 0476 | Number Complement | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0476.Number-Complement) | 64.8% | Easy | |
-| 0477 | Total Hamming Distance | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0477.Total-Hamming-Distance) | 50.5% | Medium | |
-| 0478 | Generate Random Point in a Circle | | 38.5% | Medium | |
-| 0479 | Largest Palindrome Product | | 29.0% | Hard | |
-| 0480 | Sliding Window Median | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0480.Sliding-Window-Median) | 37.2% | Hard | |
-| 0481 | Magical String | | 47.5% | Medium | |
-| 0482 | License Key Formatting | | 43.1% | Easy | |
-| 0483 | Smallest Good Base | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0483.Smallest-Good-Base) | 35.7% | Hard | |
-| 0484 | Find Permutation | | 60.5% | Medium | |
-| 0485 | Max Consecutive Ones | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0485.Max-Consecutive-Ones) | 54.7% | Easy | |
-| 0486 | Predict the Winner | | 47.9% | Medium | |
-| 0487 | Max Consecutive Ones II | | 48.5% | Medium | |
-| 0488 | Zuma Game | | 39.8% | Hard | |
-| 0489 | Robot Room Cleaner | | 69.7% | Hard | |
-| 0490 | The Maze | | 51.4% | Medium | |
-| 0491 | Increasing Subsequences | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0491.Increasing-Subsequences) | 46.1% | Medium | |
-| 0492 | Construct the Rectangle | | 49.6% | Easy | |
-| 0493 | Reverse Pairs | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0493.Reverse-Pairs) | 25.2% | Hard | |
-| 0494 | Target Sum | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0494.Target-Sum) | 46.3% | Medium | |
-| 0495 | Teemo Attacking | | 53.6% | Medium | |
-| 0496 | Next Greater Element I | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0496.Next-Greater-Element-I) | 63.8% | Easy | |
-| 0497 | Random Point in Non-overlapping Rectangles | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0497.Random-Point-in-Non-overlapping-Rectangles) | 37.8% | Medium | |
-| 0498 | Diagonal Traverse | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0498.Diagonal-Traverse) | 48.2% | Medium | |
-| 0499 | The Maze III | | 41.0% | Hard | |
-| 0500 | Keyboard Row | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0500.Keyboard-Row) | 64.7% | Easy | |
-| 0501 | Find Mode in Binary Search Tree | | 42.3% | Easy | |
-| 0502 | IPO | | 40.4% | Hard | |
-| 0503 | Next Greater Element II | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0503.Next-Greater-Element-II) | 56.5% | Medium | |
-| 0504 | Base 7 | | 46.2% | Easy | |
-| 0505 | The Maze II | | 47.7% | Medium | |
-| 0506 | Relative Ranks | | 50.5% | Easy | |
-| 0507 | Perfect Number | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0507.Perfect-Number) | 35.5% | Easy | |
-| 0508 | Most Frequent Subtree Sum | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0508.Most-Frequent-Subtree-Sum) | 57.9% | Medium | |
-| 0509 | Fibonacci Number | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0509.Fibonacci-Number) | 67.2% | Easy | |
-| 0510 | Inorder Successor in BST II | | 58.0% | Medium | |
-| 0511 | Game Play Analysis I | | 80.8% | Easy | |
-| 0512 | Game Play Analysis II | | 55.5% | Easy | |
-| 0513 | Find Bottom Left Tree Value | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0513.Find-Bottom-Left-Tree-Value) | 61.5% | Medium | |
-| 0514 | Freedom Trail | | 43.0% | Hard | |
-| 0515 | Find Largest Value in Each Tree Row | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0515.Find-Largest-Value-in-Each-Tree-Row) | 61.1% | Medium | |
-| 0516 | Longest Palindromic Subsequence | | 53.2% | Medium | |
-| 0517 | Super Washing Machines | | 38.3% | Hard | |
-| 0518 | Coin Change 2 | | 50.2% | Medium | |
-| 0519 | Random Flip Matrix | | 36.7% | Medium | |
-| 0520 | Detect Capital | | 54.4% | Easy | |
-| 0521 | Longest Uncommon Subsequence I | | 57.6% | Easy | |
-| 0522 | Longest Uncommon Subsequence II | | 34.0% | Medium | |
-| 0523 | Continuous Subarray Sum | | 24.6% | Medium | |
-| 0524 | Longest Word in Dictionary through Deleting | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0524.Longest-Word-in-Dictionary-through-Deleting) | 48.4% | Medium | |
-| 0525 | Contiguous Array | | 42.8% | Medium | |
-| 0526 | Beautiful Arrangement | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0526.Beautiful-Arrangement) | 57.8% | Medium | |
-| 0527 | Word Abbreviation | | 54.2% | Hard | |
-| 0528 | Random Pick with Weight | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0528.Random-Pick-with-Weight) | 43.9% | Medium | |
-| 0529 | Minesweeper | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0529.Minesweeper) | 59.1% | Medium | |
-| 0530 | Minimum Absolute Difference in BST | | 53.7% | Easy | |
-| 0531 | Lonely Pixel I | | 59.0% | Medium | |
-| 0532 | K-diff Pairs in an Array | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0532.K-diff-Pairs-in-an-Array) | 31.5% | Easy | |
-| 0533 | Lonely Pixel II | | 47.9% | Medium | |
-| 0534 | Game Play Analysis III | | 75.9% | Medium | |
-| 0535 | Encode and Decode TinyURL | | 79.9% | Medium | |
-| 0536 | Construct Binary Tree from String | | 48.3% | Medium | |
-| 0537 | Complex Number Multiplication | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0537.Complex-Number-Multiplication) | 67.4% | Medium | |
-| 0538 | Convert BST to Greater Tree | | 55.3% | Easy | |
-| 0539 | Minimum Time Difference | | 51.5% | Medium | |
-| 0540 | Single Element in a Sorted Array | | 57.9% | Medium | |
-| 0541 | Reverse String II | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0541.Reverse-String-II) | 48.4% | Easy | |
-| 0542 | 01 Matrix | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0542.01-Matrix) | 39.8% | Medium | |
-| 0543 | Diameter of Binary Tree | | 48.4% | Easy | |
-| 0544 | Output Contest Matches | | 75.2% | Medium | |
-| 0545 | Boundary of Binary Tree | | 38.9% | Medium | |
-| 0546 | Remove Boxes | | 42.7% | Hard | |
-| 0547 | Friend Circles | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0547.Friend-Circles) | 58.5% | Medium | |
-| 0548 | Split Array with Equal Sum | | 46.4% | Medium | |
-| 0549 | Binary Tree Longest Consecutive Sequence II | | 47.0% | Medium | |
-| 0550 | Game Play Analysis IV | | 45.2% | Medium | |
-| 0551 | Student Attendance Record I | | 46.0% | Easy | |
-| 0552 | Student Attendance Record II | | 36.7% | Hard | |
-| 0553 | Optimal Division | | 56.7% | Medium | |
-| 0554 | Brick Wall | | 50.0% | Medium | |
-| 0555 | Split Concatenated Strings | | 42.2% | Medium | |
-| 0556 | Next Greater Element III | | 31.7% | Medium | |
-| 0557 | Reverse Words in a String III | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0557.Reverse-Words-in-a-String-III) | 69.8% | Easy | |
-| 0558 | Logical OR of Two Binary Grids Represented as Quad-Trees | | 44.6% | Medium | |
-| 0559 | Maximum Depth of N-ary Tree | | 68.6% | Easy | |
-| 0560 | Subarray Sum Equals K | | 43.8% | Medium | |
-| 0561 | Array Partition I | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0561.Array-Partition-I) | 72.0% | Easy | |
-| 0562 | Longest Line of Consecutive One in Matrix | | 45.8% | Medium | |
-| 0563 | Binary Tree Tilt | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0563.Binary-Tree-Tilt) | 48.7% | Easy | |
-| 0564 | Find the Closest Palindrome | | 19.7% | Hard | |
-| 0565 | Array Nesting | | 55.5% | Medium | |
-| 0566 | Reshape the Matrix | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0566.Reshape-the-Matrix) | 60.5% | Easy | |
-| 0567 | Permutation in String | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0567.Permutation-in-String) | 44.4% | Medium | |
-| 0568 | Maximum Vacation Days | | 40.8% | Hard | |
-| 0569 | Median Employee Salary | | 57.6% | Hard | |
-| 0570 | Managers with at Least 5 Direct Reports | | 66.0% | Medium | |
-| 0571 | Find Median Given Frequency of Numbers | | 44.7% | Hard | |
-| 0572 | Subtree of Another Tree | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0572.Subtree-of-Another-Tree) | 44.1% | Easy | |
-| 0573 | Squirrel Simulation | | 55.6% | Medium | |
-| 0574 | Winning Candidate | | 47.5% | Medium | |
-| 0575 | Distribute Candies | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0575.Distribute-Candies) | 61.4% | Easy | |
-| 0576 | Out of Boundary Paths | | 35.1% | Medium | |
-| 0577 | Employee Bonus | | 68.1% | Easy | |
-| 0578 | Get Highest Answer Rate Question | | 39.3% | Medium | |
-| 0579 | Find Cumulative Salary of an Employee | | 37.0% | Hard | |
-| 0580 | Count Student Number in Departments | | 48.7% | Medium | |
-| 0581 | Shortest Unsorted Continuous Subarray | | 31.1% | Easy | |
-| 0582 | Kill Process | | 60.8% | Medium | |
-| 0583 | Delete Operation for Two Strings | | 48.6% | Medium | |
-| 0584 | Find Customer Referee | | 72.2% | Easy | |
-| 0585 | Investments in 2016 | | 54.7% | Medium | |
-| 0586 | Customer Placing the Largest Number of Orders | | 72.9% | Easy | |
-| 0587 | Erect the Fence | | 35.9% | Hard | |
-| 0588 | Design In-Memory File System | | 45.9% | Hard | |
-| 0589 | N-ary Tree Preorder Traversal | | 72.0% | Easy | |
-| 0590 | N-ary Tree Postorder Traversal | | 72.1% | Easy | |
-| 0591 | Tag Validator | | 34.3% | Hard | |
-| 0592 | Fraction Addition and Subtraction | | 49.0% | Medium | |
-| 0593 | Valid Square | | 43.1% | Medium | |
-| 0594 | Longest Harmonious Subsequence | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0594.Longest-Harmonious-Subsequence) | 46.6% | Easy | |
-| 0595 | Big Countries | | 77.3% | Easy | |
-| 0596 | Classes More Than 5 Students | | 38.0% | Easy | |
-| 0597 | Friend Requests I: Overall Acceptance Rate | | 40.9% | Easy | |
-| 0598 | Range Addition II | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0598.Range-Addition-II) | 49.6% | Easy | |
-| 0599 | Minimum Index Sum of Two Lists | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0599.Minimum-Index-Sum-of-Two-Lists) | 50.7% | Easy | |
-| 0600 | Non-negative Integers without Consecutive Ones | | 34.1% | Hard | |
-| 0601 | Human Traffic of Stadium | | 41.6% | Hard | |
-| 0602 | Friend Requests II: Who Has the Most Friends | | 53.3% | Medium | |
-| 0603 | Consecutive Available Seats | | 63.9% | Easy | |
-| 0604 | Design Compressed String Iterator | | 37.5% | Easy | |
-| 0605 | Can Place Flowers | | 31.6% | Easy | |
-| 0606 | Construct String from Binary Tree | | 54.1% | Easy | |
-| 0607 | Sales Person | | 62.9% | Easy | |
-| 0608 | Tree Node | | 67.0% | Medium | |
-| 0609 | Find Duplicate File in System | | 59.5% | Medium | |
-| 0610 | Triangle Judgement | | 65.9% | Easy | |
-| 0611 | Valid Triangle Number | | 48.4% | Medium | |
-| 0612 | Shortest Distance in a Plane | | 59.5% | Medium | |
-| 0613 | Shortest Distance in a Line | | 77.5% | Easy | |
-| 0614 | Second Degree Follower | | 30.2% | Medium | |
-| 0615 | Average Salary: Departments VS Company | | 46.8% | Hard | |
-| 0616 | Add Bold Tag in String | | 43.0% | Medium | |
-| 0617 | Merge Two Binary Trees | | 74.1% | Easy | |
-| 0618 | Students Report By Geography | | 54.8% | Hard | |
-| 0619 | Biggest Single Number | | 43.1% | Easy | |
-| 0620 | Not Boring Movies | | 67.5% | Easy | |
-| 0621 | Task Scheduler | | 50.0% | Medium | |
-| 0622 | Design Circular Queue | | 43.7% | Medium | |
-| 0623 | Add One Row to Tree | | 49.7% | Medium | |
-| 0624 | Maximum Distance in Arrays | | 38.9% | Easy | |
-| 0625 | Minimum Factorization | | 32.8% | Medium | |
-| 0626 | Exchange Seats | | 62.2% | Medium | |
-| 0627 | Swap Salary | | 75.2% | Easy | |
-| 0628 | Maximum Product of Three Numbers | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0628.Maximum-Product-of-Three-Numbers) | 47.1% | Easy | |
-| 0629 | K Inverse Pairs Array | | 31.1% | Hard | |
-| 0630 | Course Schedule III | | 33.5% | Hard | |
-| 0631 | Design Excel Sum Formula | | 31.5% | Hard | |
-| 0632 | Smallest Range Covering Elements from K Lists | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0632.Smallest-Range-Covering-Elements-from-K-Lists) | 52.4% | Hard | |
-| 0633 | Sum of Square Numbers | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0633.Sum-of-Square-Numbers) | 32.2% | Easy | |
-| 0634 | Find the Derangement of An Array | | 40.1% | Medium | |
-| 0635 | Design Log Storage System | | 58.6% | Medium | |
-| 0636 | Exclusive Time of Functions | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0636.Exclusive-Time-of-Functions) | 52.0% | Medium | |
-| 0637 | Average of Levels in Binary Tree | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0637.Average-of-Levels-in-Binary-Tree) | 63.0% | Easy | |
-| 0638 | Shopping Offers | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0638.Shopping-Offers) | 51.5% | Medium | |
-| 0639 | Decode Ways II | | 26.6% | Hard | |
-| 0640 | Solve the Equation | | 42.0% | Medium | |
-| 0641 | Design Circular Deque | | 52.7% | Medium | |
-| 0642 | Design Search Autocomplete System | | 44.6% | Hard | |
-| 0643 | Maximum Average Subarray I | | 41.5% | Easy | |
-| 0644 | Maximum Average Subarray II | | 32.0% | Hard | |
-| 0645 | Set Mismatch | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0645.Set-Mismatch) | 42.1% | Easy | |
-| 0646 | Maximum Length of Pair Chain | | 51.8% | Medium | |
-| 0647 | Palindromic Substrings | | 60.6% | Medium | |
-| 0648 | Replace Words | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0648.Replace-Words) | 56.5% | Medium | |
-| 0649 | Dota2 Senate | | 39.2% | Medium | |
-| 0650 | 2 Keys Keyboard | | 49.2% | Medium | |
-| 0651 | 4 Keys Keyboard | | 52.4% | Medium | |
-| 0652 | Find Duplicate Subtrees | | 50.1% | Medium | |
-| 0653 | Two Sum IV - Input is a BST | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0653.Two-Sum-IV---Input-is-a-BST) | 55.5% | Easy | |
-| 0654 | Maximum Binary Tree | | 79.9% | Medium | |
-| 0655 | Print Binary Tree | | 55.0% | Medium | |
-| 0656 | Coin Path | | 29.0% | Hard | |
-| 0657 | Robot Return to Origin | | 73.5% | Easy | |
-| 0658 | Find K Closest Elements | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0658.Find-K-Closest-Elements) | 40.9% | Medium | |
-| 0659 | Split Array into Consecutive Subsequences | | 43.7% | Medium | |
-| 0660 | Remove 9 | | 53.3% | Hard | |
-| 0661 | Image Smoother | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0661.Image-Smoother) | 51.5% | Easy | |
-| 0662 | Maximum Width of Binary Tree | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0662.Maximum-Width-of-Binary-Tree) | 41.1% | Medium | |
-| 0663 | Equal Tree Partition | | 39.5% | Medium | |
-| 0664 | Strange Printer | | 40.2% | Hard | |
-| 0665 | Non-decreasing Array | | 19.5% | Easy | |
-| 0666 | Path Sum IV | | 54.7% | Medium | |
-| 0667 | Beautiful Arrangement II | | 54.2% | Medium | |
-| 0668 | Kth Smallest Number in Multiplication Table | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0668.Kth-Smallest-Number-in-Multiplication-Table) | 45.6% | Hard | |
-| 0669 | Trim a Binary Search Tree | | 63.0% | Easy | |
-| 0670 | Maximum Swap | | 43.6% | Medium | |
-| 0671 | Second Minimum Node In a Binary Tree | | 42.7% | Easy | |
-| 0672 | Bulb Switcher II | | 50.9% | Medium | |
-| 0673 | Number of Longest Increasing Subsequence | | 35.7% | Medium | |
-| 0674 | Longest Continuous Increasing Subsequence | | 45.9% | Easy | |
-| 0675 | Cut Off Trees for Golf Event | | 34.6% | Hard | |
-| 0676 | Implement Magic Dictionary | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0676.Implement-Magic-Dictionary) | 54.5% | Medium | |
-| 0677 | Map Sum Pairs | | 53.5% | Medium | |
-| 0678 | Valid Parenthesis String | | 31.0% | Medium | |
-| 0679 | 24 Game | | 46.4% | Hard | |
-| 0680 | Valid Palindrome II | | 36.6% | Easy | |
-| 0681 | Next Closest Time | | 45.0% | Medium | |
-| 0682 | Baseball Game | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0682.Baseball-Game) | 63.7% | Easy | |
-| 0683 | K Empty Slots | | 35.7% | Hard | |
-| 0684 | Redundant Connection | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0684.Redundant-Connection) | 57.3% | Medium | |
-| 0685 | Redundant Connection II | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0685.Redundant-Connection-II) | 32.4% | Hard | |
-| 0686 | Repeated String Match | | 32.3% | Easy | |
-| 0687 | Longest Univalue Path | | 36.2% | Easy | |
-| 0688 | Knight Probability in Chessboard | | 48.9% | Medium | |
-| 0689 | Maximum Sum of 3 Non-Overlapping Subarrays | | 46.3% | Hard | |
-| 0690 | Employee Importance | | 57.3% | Easy | |
-| 0691 | Stickers to Spell Word | | 43.0% | Hard | |
-| 0692 | Top K Frequent Words | | 51.8% | Medium | |
-| 0693 | Binary Number with Alternating Bits | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0693.Binary-Number-with-Alternating-Bits) | 59.4% | Easy | |
-| 0694 | Number of Distinct Islands | | 56.0% | Medium | |
-| 0695 | Max Area of Island | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0695.Max-Area-of-Island) | 62.7% | Medium | |
-| 0696 | Count Binary Substrings | | 56.0% | Easy | |
-| 0697 | Degree of an Array | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0697.Degree-of-an-Array) | 53.8% | Easy | |
-| 0698 | Partition to K Equal Sum Subsets | | 44.9% | Medium | |
-| 0699 | Falling Squares | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0699.Falling-Squares) | 41.8% | Hard | |
-| 0700 | Search in a Binary Search Tree | | 73.1% | Easy | |
-| 0701 | Insert into a Binary Search Tree | | 77.8% | Medium | |
-| 0702 | Search in a Sorted Array of Unknown Size | | 66.7% | Medium | |
-| 0703 | Kth Largest Element in a Stream | | 49.7% | Easy | |
-| 0704 | Binary Search | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0704.Binary-Search) | 52.1% | Easy | |
-| 0705 | Design HashSet | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0705.Design-HashSet) | 64.3% | Easy | |
-| 0706 | Design HashMap | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0706.Design-HashMap) | 61.3% | Easy | |
-| 0707 | Design Linked List | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0707.Design-Linked-List) | 24.5% | Medium | |
-| 0708 | Insert into a Sorted Circular Linked List | | 31.6% | Medium | |
-| 0709 | To Lower Case | | 79.3% | Easy | |
-| 0710 | Random Pick with Blacklist | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0710.Random-Pick-with-Blacklist) | 32.4% | Hard | |
-| 0711 | Number of Distinct Islands II | | 47.3% | Hard | |
-| 0712 | Minimum ASCII Delete Sum for Two Strings | | 58.5% | Medium | |
-| 0713 | Subarray Product Less Than K | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0713.Subarray-Product-Less-Than-K) | 39.1% | Medium | |
-| 0714 | Best Time to Buy and Sell Stock with Transaction Fee | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0714.Best-Time-to-Buy-and-Sell-Stock-with-Transaction-Fee) | 54.7% | Medium | |
-| 0715 | Range Module | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0715.Range-Module) | 38.5% | Hard | |
-| 0716 | Max Stack | | 42.6% | Easy | |
-| 0717 | 1-bit and 2-bit Characters | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0717.1-bit-and-2-bit-Characters) | 48.8% | Easy | |
-| 0718 | Maximum Length of Repeated Subarray | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0718.Maximum-Length-of-Repeated-Subarray) | 49.3% | Medium | |
-| 0719 | Find K-th Smallest Pair Distance | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0719.Find-K-th-Smallest-Pair-Distance) | 31.5% | Hard | |
-| 0720 | Longest Word in Dictionary | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0720.Longest-Word-in-Dictionary) | 48.2% | Easy | |
-| 0721 | Accounts Merge | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0721.Accounts-Merge) | 48.7% | Medium | |
-| 0722 | Remove Comments | | 34.6% | Medium | |
-| 0723 | Candy Crush | | 69.3% | Medium | |
-| 0724 | Find Pivot Index | | 44.0% | Easy | |
-| 0725 | Split Linked List in Parts | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0725.Split-Linked-List-in-Parts) | 52.1% | Medium | |
-| 0726 | Number of Atoms | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0726.Number-of-Atoms) | 48.9% | Hard | |
-| 0727 | Minimum Window Subsequence | | 41.8% | Hard | |
-| 0728 | Self Dividing Numbers | | 74.3% | Easy | |
-| 0729 | My Calendar I | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0729.My-Calendar-I) | 51.8% | Medium | |
-| 0730 | Count Different Palindromic Subsequences | | 41.7% | Hard | |
-| 0731 | My Calendar II | | 49.1% | Medium | |
-| 0732 | My Calendar III | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0732.My-Calendar-III) | 59.9% | Hard | |
-| 0733 | Flood Fill | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0733.Flood-Fill) | 55.3% | Easy | |
-| 0734 | Sentence Similarity | | 42.1% | Easy | |
-| 0735 | Asteroid Collision | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0735.Asteroid-Collision) | 41.1% | Medium | |
-| 0736 | Parse Lisp Expression | | 47.5% | Hard | |
-| 0737 | Sentence Similarity II | | 45.8% | Medium | |
-| 0738 | Monotone Increasing Digits | | 44.3% | Medium | |
-| 0739 | Daily Temperatures | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0739.Daily-Temperatures) | 63.3% | Medium | |
-| 0740 | Delete and Earn | | 48.6% | Medium | |
-| 0741 | Cherry Pickup | | 33.9% | Hard | |
-| 0742 | Closest Leaf in a Binary Tree | | 43.5% | Medium | |
-| 0743 | Network Delay Time | | 44.9% | Medium | |
-| 0744 | Find Smallest Letter Greater Than Target | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0744.Find-Smallest-Letter-Greater-Than-Target) | 45.4% | Easy | |
-| 0745 | Prefix and Suffix Search | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0745.Prefix-and-Suffix-Search) | 34.1% | Hard | |
-| 0746 | Min Cost Climbing Stairs | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0746.Min-Cost-Climbing-Stairs) | 50.3% | Easy | |
-| 0747 | Largest Number At Least Twice of Others | | 42.0% | Easy | |
-| 0748 | Shortest Completing Word | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0748.Shortest-Completing-Word) | 56.7% | Easy | |
-| 0749 | Contain Virus | | 44.5% | Hard | |
-| 0750 | Number Of Corner Rectangles | | 66.4% | Medium | |
-| 0751 | IP to CIDR | | 61.8% | Medium | |
-| 0752 | Open the Lock | | 51.8% | Medium | |
-| 0753 | Cracking the Safe | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0753.Cracking-the-Safe) | 50.5% | Hard | |
-| 0754 | Reach a Number | | 34.7% | Medium | |
-| 0755 | Pour Water | | 43.3% | Medium | |
-| 0756 | Pyramid Transition Matrix | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0756.Pyramid-Transition-Matrix) | 54.6% | Medium | |
-| 0757 | Set Intersection Size At Least Two | | 40.1% | Hard | |
-| 0758 | Bold Words in String | | 45.9% | Easy | |
-| 0759 | Employee Free Time | | 66.2% | Hard | |
-| 0760 | Find Anagram Mappings | | 81.1% | Easy | |
-| 0761 | Special Binary String | | 54.7% | Hard | |
-| 0762 | Prime Number of Set Bits in Binary Representation | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0762.Prime-Number-of-Set-Bits-in-Binary-Representation) | 63.2% | Easy | |
-| 0763 | Partition Labels | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0763.Partition-Labels) | 76.0% | Medium | |
-| 0764 | Largest Plus Sign | | 46.0% | Medium | |
-| 0765 | Couples Holding Hands | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0765.Couples-Holding-Hands) | 54.3% | Hard | |
-| 0766 | Toeplitz Matrix | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0766.Toeplitz-Matrix) | 65.0% | Easy | |
-| 0767 | Reorganize String | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0767.Reorganize-String) | 48.7% | Medium | |
-| 0768 | Max Chunks To Make Sorted II | | 48.7% | Hard | |
-| 0769 | Max Chunks To Make Sorted | | 54.7% | Medium | |
-| 0770 | Basic Calculator IV | | 47.9% | Hard | |
-| 0771 | Jewels and Stones | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0771.Jewels-and-Stones) | 86.3% | Easy | |
-| 0772 | Basic Calculator III | | 41.2% | Hard | |
-| 0773 | Sliding Puzzle | | 59.3% | Hard | |
-| 0774 | Minimize Max Distance to Gas Station | | 46.9% | Hard | |
-| 0775 | Global and Local Inversions | | 42.1% | Medium | |
-| 0776 | Split BST | | 55.8% | Medium | |
-| 0777 | Swap Adjacent in LR String | | 34.8% | Medium | |
-| 0778 | Swim in Rising Water | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0778.Swim-in-Rising-Water) | 53.0% | Hard | |
-| 0779 | K-th Symbol in Grammar | | 37.2% | Medium | |
-| 0780 | Reaching Points | | 29.3% | Hard | |
-| 0781 | Rabbits in Forest | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0781.Rabbits-in-Forest) | 54.5% | Medium | |
-| 0782 | Transform to Chessboard | | 42.8% | Hard | |
-| 0783 | Minimum Distance Between BST Nodes | | 52.6% | Easy | |
-| 0784 | Letter Case Permutation | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0784.Letter-Case-Permutation) | 64.6% | Medium | |
-| 0785 | Is Graph Bipartite? | | 47.5% | Medium | |
-| 0786 | K-th Smallest Prime Fraction | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0786.K-th-Smallest-Prime-Fraction) | 41.0% | Hard | |
-| 0787 | Cheapest Flights Within K Stops | | 39.3% | Medium | |
-| 0788 | Rotated Digits | | 57.1% | Easy | |
-| 0789 | Escape The Ghosts | | 57.4% | Medium | |
-| 0790 | Domino and Tromino Tiling | | 39.2% | Medium | |
-| 0791 | Custom Sort String | | 65.7% | Medium | |
-| 0792 | Number of Matching Subsequences | | 47.4% | Medium | |
-| 0793 | Preimage Size of Factorial Zeroes Function | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0793.Preimage-Size-of-Factorial-Zeroes-Function) | 40.2% | Hard | |
-| 0794 | Valid Tic-Tac-Toe State | | 32.6% | Medium | |
-| 0795 | Number of Subarrays with Bounded Maximum | | 46.3% | Medium | |
-| 0796 | Rotate String | | 49.6% | Easy | |
-| 0797 | All Paths From Source to Target | | 77.9% | Medium | |
-| 0798 | Smallest Rotation with Highest Score | | 44.1% | Hard | |
-| 0799 | Champagne Tower | | 35.7% | Medium | |
-| 0800 | Similar RGB Color | | 61.4% | Easy | |
-| 0801 | Minimum Swaps To Make Sequences Increasing | | 38.9% | Medium | |
-| 0802 | Find Eventual Safe States | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0802.Find-Eventual-Safe-States) | 48.9% | Medium | |
-| 0803 | Bricks Falling When Hit | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0803.Bricks-Falling-When-Hit) | 30.8% | Hard | |
-| 0804 | Unique Morse Code Words | | 77.0% | Easy | |
-| 0805 | Split Array With Same Average | | 26.3% | Hard | |
-| 0806 | Number of Lines To Write String | | 64.9% | Easy | |
-| 0807 | Max Increase to Keep City Skyline | | 83.7% | Medium | |
-| 0808 | Soup Servings | | 39.9% | Medium | |
-| 0809 | Expressive Words | | 47.0% | Medium | |
-| 0810 | Chalkboard XOR Game | | 48.2% | Hard | |
-| 0811 | Subdomain Visit Count | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0811.Subdomain-Visit-Count) | 69.8% | Easy | |
-| 0812 | Largest Triangle Area | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0812.Largest-Triangle-Area) | 58.3% | Easy | |
-| 0813 | Largest Sum of Averages | | 49.9% | Medium | |
-| 0814 | Binary Tree Pruning | | 74.5% | Medium | |
-| 0815 | Bus Routes | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0815.Bus-Routes) | 42.6% | Hard | |
-| 0816 | Ambiguous Coordinates | | 47.2% | Medium | |
-| 0817 | Linked List Components | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0817.Linked-List-Components) | 57.3% | Medium | |
-| 0818 | Race Car | | 39.0% | Hard | |
-| 0819 | Most Common Word | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0819.Most-Common-Word) | 44.8% | Easy | |
-| 0820 | Short Encoding of Words | | 50.7% | Medium | |
-| 0821 | Shortest Distance to a Character | | 66.9% | Easy | |
-| 0822 | Card Flipping Game | | 42.9% | Medium | |
-| 0823 | Binary Trees With Factors | | 35.8% | Medium | |
-| 0824 | Goat Latin | | 63.3% | Easy | |
-| 0825 | Friends Of Appropriate Ages | | 42.6% | Medium | |
-| 0826 | Most Profit Assigning Work | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0826.Most-Profit-Assigning-Work) | 38.5% | Medium | |
-| 0827 | Making A Large Island | | 45.6% | Hard | |
-| 0828 | Count Unique Characters of All Substrings of a Given String | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0828.COPYRIGHT-PROBLEM-XXX) | 45.1% | Hard | |
-| 0829 | Consecutive Numbers Sum | | 37.4% | Hard | |
-| 0830 | Positions of Large Groups | | 49.6% | Easy | |
-| 0831 | Masking Personal Information | | 44.1% | Medium | |
-| 0832 | Flipping an Image | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0832.Flipping-an-Image) | 76.2% | Easy | |
-| 0833 | Find And Replace in String | | 50.4% | Medium | |
-| 0834 | Sum of Distances in Tree | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0834.Sum-of-Distances-in-Tree) | 43.7% | Hard | |
-| 0835 | Image Overlap | | 58.5% | Medium | |
-| 0836 | Rectangle Overlap | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0836.Rectangle-Overlap) | 48.6% | Easy | |
-| 0837 | New 21 Game | | 34.6% | Medium | |
-| 0838 | Push Dominoes | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0838.Push-Dominoes) | 48.4% | Medium | |
-| 0839 | Similar String Groups | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0839.Similar-String-Groups) | 38.6% | Hard | |
-| 0840 | Magic Squares In Grid | | 37.3% | Easy | |
-| 0841 | Keys and Rooms | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0841.Keys-and-Rooms) | 64.3% | Medium | |
-| 0842 | Split Array into Fibonacci Sequence | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0842.Split-Array-into-Fibonacci-Sequence) | 36.3% | Medium | |
-| 0843 | Guess the Word | | 46.1% | Hard | |
-| 0844 | Backspace String Compare | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0844.Backspace-String-Compare) | 46.4% | Easy | |
-| 0845 | Longest Mountain in Array | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0845.Longest-Mountain-in-Array) | 37.2% | Medium | |
-| 0846 | Hand of Straights | | 54.2% | Medium | |
-| 0847 | Shortest Path Visiting All Nodes | | 52.0% | Hard | |
-| 0848 | Shifting Letters | | 44.6% | Medium | |
-| 0849 | Maximize Distance to Closest Person | | 42.6% | Easy | |
-| 0850 | Rectangle Area II | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0850.Rectangle-Area-II) | 47.5% | Hard | |
-| 0851 | Loud and Rich | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0851.Loud-and-Rich) | 51.6% | Medium | |
-| 0852 | Peak Index in a Mountain Array | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0852.Peak-Index-in-a-Mountain-Array) | 71.6% | Easy | |
-| 0853 | Car Fleet | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0853.Car-Fleet) | 42.4% | Medium | |
-| 0854 | K-Similar Strings | | 38.2% | Hard | |
-| 0855 | Exam Room | | 43.1% | Medium | |
-| 0856 | Score of Parentheses | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0856.Score-of-Parentheses) | 60.5% | Medium | |
-| 0857 | Minimum Cost to Hire K Workers | | 49.6% | Hard | |
-| 0858 | Mirror Reflection | | 53.7% | Medium | |
-| 0859 | Buddy Strings | | 27.4% | Easy | |
-| 0860 | Lemonade Change | | 51.6% | Easy | |
-| 0861 | Score After Flipping Matrix | | 72.8% | Medium | |
-| 0862 | Shortest Subarray with Sum at Least K | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0862.Shortest-Subarray-with-Sum-at-Least-K) | 24.6% | Hard | |
-| 0863 | All Nodes Distance K in Binary Tree | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0863.All-Nodes-Distance-K-in-Binary-Tree) | 55.3% | Medium | |
-| 0864 | Shortest Path to Get All Keys | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0864.Shortest-Path-to-Get-All-Keys) | 40.1% | Hard | |
-| 0865 | Smallest Subtree with all the Deepest Nodes | | 60.8% | Medium | |
-| 0866 | Prime Palindrome | | 24.9% | Medium | |
-| 0867 | Transpose Matrix | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0867.Transpose-Matrix) | 62.8% | Easy | |
-| 0868 | Binary Gap | | 60.6% | Easy | |
-| 0869 | Reordered Power of 2 | | 53.3% | Medium | |
-| 0870 | Advantage Shuffle | | 45.6% | Medium | |
-| 0871 | Minimum Number of Refueling Stops | | 31.4% | Hard | |
-| 0872 | Leaf-Similar Trees | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0872.Leaf-Similar-Trees) | 64.5% | Easy | |
-| 0873 | Length of Longest Fibonacci Subsequence | | 48.0% | Medium | |
-| 0874 | Walking Robot Simulation | | 35.3% | Easy | |
-| 0875 | Koko Eating Bananas | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0875.Koko-Eating-Bananas) | 52.1% | Medium | |
-| 0876 | Middle of the Linked List | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0876.Middle-of-the-Linked-List) | 68.4% | Easy | |
-| 0877 | Stone Game | | 64.8% | Medium | |
-| 0878 | Nth Magical Number | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0878.Nth-Magical-Number) | 28.4% | Hard | |
-| 0879 | Profitable Schemes | | 39.7% | Hard | |
-| 0880 | Decoded String at Index | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0880.Decoded-String-at-Index) | 24.3% | Medium | |
-| 0881 | Boats to Save People | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0881.Boats-to-Save-People) | 46.8% | Medium | |
-| 0882 | Reachable Nodes In Subdivided Graph | | 41.3% | Hard | |
-| 0883 | Projection Area of 3D Shapes | | 67.7% | Easy | |
-| 0884 | Uncommon Words from Two Sentences | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0884.Uncommon-Words-from-Two-Sentences) | 63.3% | Easy | |
-| 0885 | Spiral Matrix III | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0885.Spiral-Matrix-III) | 69.3% | Medium | |
-| 0886 | Possible Bipartition | | 44.1% | Medium | |
-| 0887 | Super Egg Drop | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0887.Super-Egg-Drop) | 27.0% | Hard | |
-| 0888 | Fair Candy Swap | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0888.Fair-Candy-Swap) | 58.3% | Easy | |
-| 0889 | Construct Binary Tree from Preorder and Postorder Traversal | | 66.1% | Medium | |
-| 0890 | Find and Replace Pattern | | 73.4% | Medium | |
-| 0891 | Sum of Subsequence Widths | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0891.Sum-of-Subsequence-Widths) | 31.9% | Hard | |
-| 0892 | Surface Area of 3D Shapes | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0892.Surface-Area-of-3D-Shapes) | 58.9% | Easy | |
-| 0893 | Groups of Special-Equivalent Strings | | 66.5% | Easy | |
-| 0894 | All Possible Full Binary Trees | | 75.2% | Medium | |
-| 0895 | Maximum Frequency Stack | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0895.Maximum-Frequency-Stack) | 60.6% | Hard | |
-| 0896 | Monotonic Array | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0896.Monotonic-Array) | 57.9% | Easy | |
-| 0897 | Increasing Order Search Tree | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0897.Increasing-Order-Search-Tree) | 70.7% | Easy | |
-| 0898 | Bitwise ORs of Subarrays | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0898.Bitwise-ORs-of-Subarrays) | 34.8% | Medium | |
-| 0899 | Orderly Queue | | 52.2% | Hard | |
-| 0900 | RLE Iterator | | 53.5% | Medium | |
-| 0901 | Online Stock Span | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0901.Online-Stock-Span) | 60.1% | Medium | |
-| 0902 | Numbers At Most N Given Digit Set | | 31.5% | Hard | |
-| 0903 | Valid Permutations for DI Sequence | | 49.6% | Hard | |
-| 0904 | Fruit Into Baskets | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0904.Fruit-Into-Baskets) | 42.5% | Medium | |
-| 0905 | Sort Array By Parity | | 74.0% | Easy | |
-| 0906 | Super Palindromes | | 32.7% | Hard | |
-| 0907 | Sum of Subarray Minimums | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0907.Sum-of-Subarray-Minimums) | 32.3% | Medium | |
-| 0908 | Smallest Range I | | 65.8% | Easy | |
-| 0909 | Snakes and Ladders | | 38.4% | Medium | |
-| 0910 | Smallest Range II | | 26.6% | Medium | |
-| 0911 | Online Election | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0911.Online-Election) | 50.4% | Medium | |
-| 0912 | Sort an Array | | 63.8% | Medium | |
-| 0913 | Cat and Mouse | | 31.3% | Hard | |
-| 0914 | X of a Kind in a Deck of Cards | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0914.X-of-a-Kind-in-a-Deck-of-Cards) | 34.9% | Easy | |
-| 0915 | Partition Array into Disjoint Intervals | | 45.3% | Medium | |
-| 0916 | Word Subsets | | 47.8% | Medium | |
-| 0917 | Reverse Only Letters | | 57.9% | Easy | |
-| 0918 | Maximum Sum Circular Subarray | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0918.Maximum-Sum-Circular-Subarray) | 33.6% | Medium | |
-| 0919 | Complete Binary Tree Inserter | | 57.3% | Medium | |
-| 0920 | Number of Music Playlists | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0920.Number-of-Music-Playlists) | 46.5% | Hard | |
-| 0921 | Minimum Add to Make Parentheses Valid | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0921.Minimum-Add-to-Make-Parentheses-Valid) | 73.6% | Medium | |
-| 0922 | Sort Array By Parity II | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0922.Sort-Array-By-Parity-II) | 69.2% | Easy | |
-| 0923 | 3Sum With Multiplicity | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0923.3Sum-With-Multiplicity) | 35.7% | Medium | |
-| 0924 | Minimize Malware Spread | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0924.Minimize-Malware-Spread) | 42.0% | Hard | |
-| 0925 | Long Pressed Name | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0925.Long-Pressed-Name) | 40.6% | Easy | |
-| 0926 | Flip String to Monotone Increasing | | 52.3% | Medium | |
-| 0927 | Three Equal Parts | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0927.Three-Equal-Parts) | 33.6% | Hard | |
-| 0928 | Minimize Malware Spread II | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0928.Minimize-Malware-Spread-II) | 40.5% | Hard | |
-| 0929 | Unique Email Addresses | | 67.4% | Easy | |
-| 0930 | Binary Subarrays With Sum | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0930.Binary-Subarrays-With-Sum) | 43.0% | Medium | |
-| 0931 | Minimum Falling Path Sum | | 62.4% | Medium | |
-| 0932 | Beautiful Array | | 58.3% | Medium | |
-| 0933 | Number of Recent Calls | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0933.Number-of-Recent-Calls) | 71.9% | Easy | |
-| 0934 | Shortest Bridge | | 48.1% | Medium | |
-| 0935 | Knight Dialer | | 45.1% | Medium | |
-| 0936 | Stamping The Sequence | | 42.8% | Hard | |
-| 0937 | Reorder Data in Log Files | | 54.4% | Easy | |
-| 0938 | Range Sum of BST | | 81.3% | Easy | |
-| 0939 | Minimum Area Rectangle | | 51.8% | Medium | |
-| 0940 | Distinct Subsequences II | | 41.4% | Hard | |
-| 0941 | Valid Mountain Array | | 33.3% | Easy | |
-| 0942 | DI String Match | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0942.DI-String-Match) | 72.6% | Easy | |
-| 0943 | Find the Shortest Superstring | | 42.8% | Hard | |
-| 0944 | Delete Columns to Make Sorted | | 70.3% | Easy | |
-| 0945 | Minimum Increment to Make Array Unique | | 46.3% | Medium | |
-| 0946 | Validate Stack Sequences | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0946.Validate-Stack-Sequences) | 61.8% | Medium | |
-| 0947 | Most Stones Removed with Same Row or Column | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0947.Most-Stones-Removed-with-Same-Row-or-Column) | 55.3% | Medium | |
-| 0948 | Bag of Tokens | | 40.8% | Medium | |
-| 0949 | Largest Time for Given Digits | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0949.Largest-Time-for-Given-Digits) | 35.9% | Easy | |
-| 0950 | Reveal Cards In Increasing Order | | 74.6% | Medium | |
-| 0951 | Flip Equivalent Binary Trees | | 65.7% | Medium | |
-| 0952 | Largest Component Size by Common Factor | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0952.Largest-Component-Size-by-Common-Factor) | 30.3% | Hard | |
-| 0953 | Verifying an Alien Dictionary | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0953.Verifying-an-Alien-Dictionary) | 54.1% | Easy | |
-| 0954 | Array of Doubled Pairs | | 35.6% | Medium | |
-| 0955 | Delete Columns to Make Sorted II | | 33.2% | Medium | |
-| 0956 | Tallest Billboard | | 39.7% | Hard | |
-| 0957 | Prison Cells After N Days | | 40.7% | Medium | |
-| 0958 | Check Completeness of a Binary Tree | | 52.0% | Medium | |
-| 0959 | Regions Cut By Slashes | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0959.Regions-Cut-By-Slashes) | 66.1% | Medium | |
-| 0960 | Delete Columns to Make Sorted III | | 53.6% | Hard | |
-| 0961 | N-Repeated Element in Size 2N Array | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0961.N-Repeated-Element-in-Size-2N-Array) | 73.7% | Easy | |
-| 0962 | Maximum Width Ramp | | 45.3% | Medium | |
-| 0963 | Minimum Area Rectangle II | | 50.8% | Medium | |
-| 0964 | Least Operators to Express Number | | 43.7% | Hard | |
-| 0965 | Univalued Binary Tree | | 67.7% | Easy | |
-| 0966 | Vowel Spellchecker | | 47.2% | Medium | |
-| 0967 | Numbers With Same Consecutive Differences | | 39.4% | Medium | |
-| 0968 | Binary Tree Cameras | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0968.Binary-Tree-Cameras) | 37.5% | Hard | |
-| 0969 | Pancake Sorting | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0969.Pancake-Sorting) | 67.5% | Medium | |
-| 0970 | Powerful Integers | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0970.Powerful-Integers) | 39.8% | Easy | |
-| 0971 | Flip Binary Tree To Match Preorder Traversal | | 45.6% | Medium | |
-| 0972 | Equal Rational Numbers | | 41.6% | Hard | |
-| 0973 | K Closest Points to Origin | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0973.K-Closest-Points-to-Origin) | 63.8% | Medium | |
-| 0974 | Subarray Sums Divisible by K | | 48.9% | Medium | |
-| 0975 | Odd Even Jump | | 42.3% | Hard | |
-| 0976 | Largest Perimeter Triangle | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0976.Largest-Perimeter-Triangle) | 57.6% | Easy | |
-| 0977 | Squares of a Sorted Array | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0977.Squares-of-a-Sorted-Array) | 72.2% | Easy | |
-| 0978 | Longest Turbulent Subarray | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0978.Longest-Turbulent-Subarray) | 46.6% | Medium | |
-| 0979 | Distribute Coins in Binary Tree | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0979.Distribute-Coins-in-Binary-Tree) | 68.8% | Medium | |
-| 0980 | Unique Paths III | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0980.Unique-Paths-III) | 73.3% | Hard | |
-| 0981 | Time Based Key-Value Store | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0981.Time-Based-Key-Value-Store) | 53.1% | Medium | |
-| 0982 | Triples with Bitwise AND Equal To Zero | | 55.5% | Hard | |
-| 0983 | Minimum Cost For Tickets | | 60.5% | Medium | |
-| 0984 | String Without AAA or BBB | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0984.String-Without-AAA-or-BBB) | 37.7% | Medium | |
-| 0985 | Sum of Even Numbers After Queries | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0985.Sum-of-Even-Numbers-After-Queries) | 61.3% | Easy | |
-| 0986 | Interval List Intersections | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0986.Interval-List-Intersections) | 67.3% | Medium | |
-| 0987 | Vertical Order Traversal of a Binary Tree | | 36.6% | Medium | |
-| 0988 | Smallest String Starting From Leaf | | 46.0% | Medium | |
-| 0989 | Add to Array-Form of Integer | | 44.2% | Easy | |
-| 0990 | Satisfiability of Equality Equations | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0990.Satisfiability-of-Equality-Equations) | 44.9% | Medium | |
-| 0991 | Broken Calculator | | 45.5% | Medium | |
-| 0992 | Subarrays with K Different Integers | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0992.Subarrays-with-K-Different-Integers) | 48.6% | Hard | |
-| 0993 | Cousins in Binary Tree | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0993.Cousins-in-Binary-Tree) | 52.0% | Easy | |
-| 0994 | Rotting Oranges | | 47.8% | Medium | |
-| 0995 | Minimum Number of K Consecutive Bit Flips | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0995.Minimum-Number-of-K-Consecutive-Bit-Flips) | 46.8% | Hard | |
-| 0996 | Number of Squareful Arrays | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0996.Number-of-Squareful-Arrays) | 47.9% | Hard | |
-| 0997 | Find the Town Judge | | 50.1% | Easy | |
-| 0998 | Maximum Binary Tree II | | 62.9% | Medium | |
-| 0999 | Available Captures for Rook | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0999.Available-Captures-for-Rook) | 66.7% | Easy | |
-| 1000 | Minimum Cost to Merge Stones | | 39.6% | Hard | |
-| 1001 | Grid Illumination | | 35.9% | Hard | |
-| 1002 | Find Common Characters | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1002.Find-Common-Characters) | 67.7% | Easy | |
-| 1003 | Check If Word Is Valid After Substitutions | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1003.Check-If-Word-Is-Valid-After-Substitutions) | 55.3% | Medium | |
-| 1004 | Max Consecutive Ones III | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1004.Max-Consecutive-Ones-III) | 59.1% | Medium | |
-| 1005 | Maximize Sum Of Array After K Negations | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1005.Maximize-Sum-Of-Array-After-K-Negations) | 51.3% | Easy | |
-| 1006 | Clumsy Factorial | | 53.3% | Medium | |
-| 1007 | Minimum Domino Rotations For Equal Row | | 50.0% | Medium | |
-| 1008 | Construct Binary Search Tree from Preorder Traversal | | 78.4% | Medium | |
-| 1009 | Complement of Base 10 Integer | | 59.6% | Easy | |
-| 1010 | Pairs of Songs With Total Durations Divisible by 60 | | 47.4% | Easy | |
-| 1011 | Capacity To Ship Packages Within D Days | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1011.Capacity-To-Ship-Packages-Within-D-Days) | 58.1% | Medium | |
-| 1012 | Numbers With Repeated Digits | | 37.5% | Hard | |
-| 1013 | Partition Array Into Three Parts With Equal Sum | | 51.8% | Easy | |
-| 1014 | Best Sightseeing Pair | | 52.5% | Medium | |
-| 1015 | Smallest Integer Divisible by K | | 32.1% | Medium | |
-| 1016 | Binary String With Substrings Representing 1 To N | | 58.9% | Medium | |
-| 1017 | Convert to Base -2 | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1017.Convert-to-Base--2) | 59.0% | Medium | |
-| 1018 | Binary Prefix Divisible By 5 | | 47.7% | Easy | |
-| 1019 | Next Greater Node In Linked List | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1019.Next-Greater-Node-In-Linked-List) | 57.4% | Medium | |
-| 1020 | Number of Enclaves | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1020.Number-of-Enclaves) | 57.7% | Medium | |
-| 1021 | Remove Outermost Parentheses | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1021.Remove-Outermost-Parentheses) | 77.9% | Easy | |
-| 1022 | Sum of Root To Leaf Binary Numbers | | 67.2% | Easy | |
-| 1023 | Camelcase Matching | | 57.0% | Medium | |
-| 1024 | Video Stitching | | 49.2% | Medium | |
-| 1025 | Divisor Game | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1025.Divisor-Game) | 66.3% | Easy | |
-| 1026 | Maximum Difference Between Node and Ancestor | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1026.Maximum-Difference-Between-Node-and-Ancestor) | 65.9% | Medium | |
-| 1027 | Longest Arithmetic Sequence | | 53.5% | Medium | |
-| 1028 | Recover a Tree From Preorder Traversal | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1028.Recover-a-Tree-From-Preorder-Traversal) | 69.9% | Hard | |
-| 1029 | Two City Scheduling | | 56.1% | Easy | |
-| 1030 | Matrix Cells in Distance Order | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1030.Matrix-Cells-in-Distance-Order) | 65.7% | Easy | |
-| 1031 | Maximum Sum of Two Non-Overlapping Subarrays | | 57.8% | Medium | |
-| 1032 | Stream of Characters | | 48.3% | Hard | |
-| 1033 | Moving Stones Until Consecutive | | 41.7% | Easy | |
-| 1034 | Coloring A Border | | 44.7% | Medium | |
-| 1035 | Uncrossed Lines | | 56.1% | Medium | |
-| 1036 | Escape a Large Maze | | 35.4% | Hard | |
-| 1037 | Valid Boomerang | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1037.Valid-Boomerang) | 37.9% | Easy | |
-| 1038 | Binary Search Tree to Greater Sum Tree | | 80.8% | Medium | |
-| 1039 | Minimum Score Triangulation of Polygon | | 49.1% | Medium | |
-| 1040 | Moving Stones Until Consecutive II | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1040.Moving-Stones-Until-Consecutive-II) | 52.9% | Medium | |
-| 1041 | Robot Bounded In Circle | | 49.5% | Medium | |
-| 1042 | Flower Planting With No Adjacent | | 48.5% | Easy | |
-| 1043 | Partition Array for Maximum Sum | | 65.1% | Medium | |
-| 1044 | Longest Duplicate Substring | | 32.0% | Hard | |
-| 1045 | Customers Who Bought All Products | | 67.8% | Medium | |
-| 1046 | Last Stone Weight | | 62.2% | Easy | |
-| 1047 | Remove All Adjacent Duplicates In String | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1047.Remove-All-Adjacent-Duplicates-In-String) | 68.5% | Easy | |
-| 1048 | Longest String Chain | | 54.7% | Medium | |
-| 1049 | Last Stone Weight II | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1049.Last-Stone-Weight-II) | 44.1% | Medium | |
-| 1050 | Actors and Directors Who Cooperated At Least Three Times | | 71.7% | Easy | |
-| 1051 | Height Checker | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1051.Height-Checker) | 71.1% | Easy | |
-| 1052 | Grumpy Bookstore Owner | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1052.Grumpy-Bookstore-Owner) | 55.4% | Medium | |
-| 1053 | Previous Permutation With One Swap | | 48.5% | Medium | |
-| 1054 | Distant Barcodes | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1054.Distant-Barcodes) | 43.2% | Medium | |
-| 1055 | Shortest Way to Form String | | 56.9% | Medium | |
-| 1056 | Confusing Number | | 48.7% | Easy | |
-| 1057 | Campus Bikes | | 57.7% | Medium | |
-| 1058 | Minimize Rounding Error to Meet Target | | 41.7% | Medium | |
-| 1059 | All Paths from Source Lead to Destination | | 44.7% | Medium | |
-| 1060 | Missing Element in Sorted Array | | 54.5% | Medium | |
-| 1061 | Lexicographically Smallest Equivalent String | | 65.2% | Medium | |
-| 1062 | Longest Repeating Substring | | 57.2% | Medium | |
-| 1063 | Number of Valid Subarrays | | 71.1% | Hard | |
-| 1064 | Fixed Point | | 66.5% | Easy | |
-| 1065 | Index Pairs of a String | | 60.6% | Easy | |
-| 1066 | Campus Bikes II | | 54.2% | Medium | |
-| 1067 | Digit Count in Range | | 40.0% | Hard | |
-| 1068 | Product Sales Analysis I | | 83.1% | Easy | |
-| 1069 | Product Sales Analysis II | | 82.9% | Easy | |
-| 1070 | Product Sales Analysis III | | 48.9% | Medium | |
-| 1071 | Greatest Common Divisor of Strings | | 53.0% | Easy | |
-| 1072 | Flip Columns For Maximum Number of Equal Rows | | 60.8% | Medium | |
-| 1073 | Adding Two Negabinary Numbers | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1073.Adding-Two-Negabinary-Numbers) | 34.0% | Medium | |
-| 1074 | Number of Submatrices That Sum to Target | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1074.Number-of-Submatrices-That-Sum-to-Target) | 59.3% | Hard | |
-| 1075 | Project Employees I | | 64.9% | Easy | |
-| 1076 | Project Employees II | | 53.7% | Easy | |
-| 1077 | Project Employees III | | 75.4% | Medium | |
-| 1078 | Occurrences After Bigram | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1078.Occurrences-After-Bigram) | 64.7% | Easy | |
-| 1079 | Letter Tile Possibilities | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1079.Letter-Tile-Possibilities) | 75.4% | Medium | |
-| 1080 | Insufficient Nodes in Root to Leaf Paths | | 49.3% | Medium | |
-| 1081 | Smallest Subsequence of Distinct Characters | | 50.4% | Medium | |
-| 1082 | Sales Analysis I | | 71.7% | Easy | |
-| 1083 | Sales Analysis II | | 50.6% | Easy | |
-| 1084 | Sales Analysis III | | 54.2% | Easy | |
-| 1085 | Sum of Digits in the Minimum Number | | 74.6% | Easy | |
-| 1086 | High Five | | 79.6% | Easy | |
-| 1087 | Brace Expansion | | 62.7% | Medium | |
-| 1088 | Confusing Number II | | 43.9% | Hard | |
-| 1089 | Duplicate Zeros | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1089.Duplicate-Zeros) | 53.0% | Easy | |
-| 1090 | Largest Values From Labels | | 58.9% | Medium | |
-| 1091 | Shortest Path in Binary Matrix | | 38.2% | Medium | |
-| 1092 | Shortest Common Supersequence | | 51.6% | Hard | |
-| 1093 | Statistics from a Large Sample | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1093.Statistics-from-a-Large-Sample) | 48.2% | Medium | |
-| 1094 | Car Pooling | | 56.7% | Medium | |
-| 1095 | Find in Mountain Array | | 35.7% | Hard | |
-| 1096 | Brace Expansion II | | 62.1% | Hard | |
-| 1097 | Game Play Analysis V | | 54.4% | Hard | |
-| 1098 | Unpopular Books | | 44.4% | Medium | |
-| 1099 | Two Sum Less Than K | | 60.6% | Easy | |
-| 1100 | Find K-Length Substrings With No Repeated Characters | | 72.7% | Medium | |
-| 1101 | The Earliest Moment When Everyone Become Friends | | 66.2% | Medium | |
-| 1102 | Path With Maximum Minimum Value | | 49.2% | Medium | |
-| 1103 | Distribute Candies to People | | 60.5% | Easy | |
-| 1104 | Path In Zigzag Labelled Binary Tree | | 72.0% | Medium | |
-| 1105 | Filling Bookcase Shelves | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1105.Filling-Bookcase-Shelves) | 58.1% | Medium | |
-| 1106 | Parsing A Boolean Expression | | 58.5% | Hard | |
-| 1107 | New Users Daily Count | | 45.1% | Medium | |
-| 1108 | Defanging an IP Address | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1108.Defanging-an-IP-Address) | 87.5% | Easy | |
-| 1109 | Corporate Flight Bookings | | 52.8% | Medium | |
-| 1110 | Delete Nodes And Return Forest | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1110.Delete-Nodes-And-Return-Forest) | 67.0% | Medium | |
-| 1111 | Maximum Nesting Depth of Two Valid Parentheses Strings | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1111.Maximum-Nesting-Depth-of-Two-Valid-Parentheses-Strings) | 70.4% | Medium | |
-| 1112 | Highest Grade For Each Student | | 69.4% | Medium | |
-| 1113 | Reported Posts | | 64.1% | Easy | |
-| 1114 | Print in Order | | 65.7% | Easy | |
-| 1115 | Print FooBar Alternately | | 58.5% | Medium | |
-| 1116 | Print Zero Even Odd | | 56.0% | Medium | |
-| 1117 | Building H2O | | 52.6% | Medium | |
-| 1118 | Number of Days in a Month | | 57.4% | Easy | |
-| 1119 | Remove Vowels from a String | | 89.9% | Easy | |
-| 1120 | Maximum Average Subtree | | 62.0% | Medium | |
-| 1121 | Divide Array Into Increasing Sequences | | 56.8% | Hard | |
-| 1122 | Relative Sort Array | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1122.Relative-Sort-Array) | 67.7% | Easy | |
-| 1123 | Lowest Common Ancestor of Deepest Leaves | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1123.Lowest-Common-Ancestor-of-Deepest-Leaves) | 66.8% | Medium | |
-| 1124 | Longest Well-Performing Interval | | 32.7% | Medium | |
-| 1125 | Smallest Sufficient Team | | 46.5% | Hard | |
-| 1126 | Active Businesses | | 68.5% | Medium | |
-| 1127 | User Purchase Platform | | 48.9% | Hard | |
-| 1128 | Number of Equivalent Domino Pairs | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1128.Number-of-Equivalent-Domino-Pairs) | 47.3% | Easy | |
-| 1129 | Shortest Path with Alternating Colors | | 38.9% | Medium | |
-| 1130 | Minimum Cost Tree From Leaf Values | | 66.1% | Medium | |
-| 1131 | Maximum of Absolute Value Expression | | 53.1% | Medium | |
-| 1132 | Reported Posts II | | 34.4% | Medium | |
-| 1133 | Largest Unique Number | | 66.9% | Easy | |
-| 1134 | Armstrong Number | | 78.3% | Easy | |
-| 1135 | Connecting Cities With Minimum Cost | | 57.5% | Medium | |
-| 1136 | Parallel Courses | | 61.1% | Hard | |
-| 1137 | N-th Tribonacci Number | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1137.N-th-Tribonacci-Number) | 55.9% | Easy | |
-| 1138 | Alphabet Board Path | | 48.4% | Medium | |
-| 1139 | Largest 1-Bordered Square | | 47.5% | Medium | |
-| 1140 | Stone Game II | | 63.3% | Medium | |
-| 1141 | User Activity for the Past 30 Days I | | 54.1% | Easy | |
-| 1142 | User Activity for the Past 30 Days II | | 34.5% | Easy | |
-| 1143 | Longest Common Subsequence | | 58.4% | Medium | |
-| 1144 | Decrease Elements To Make Array Zigzag | | 45.4% | Medium | |
-| 1145 | Binary Tree Coloring Game | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1145.Binary-Tree-Coloring-Game) | 51.3% | Medium | |
-| 1146 | Snapshot Array | | 37.1% | Medium | |
-| 1147 | Longest Chunked Palindrome Decomposition | | 58.6% | Hard | |
-| 1148 | Article Views I | | 75.8% | Easy | |
-| 1149 | Article Views II | | 48.1% | Medium | |
-| 1150 | Check If a Number Is Majority Element in a Sorted Array | | 59.2% | Easy | |
-| 1151 | Minimum Swaps to Group All 1's Together | | 59.3% | Medium | |
-| 1152 | Analyze User Website Visit Pattern | | 43.5% | Medium | |
-| 1153 | String Transforms Into Another String | | 35.8% | Hard | |
-| 1154 | Day of the Year | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1154.Day-of-the-Year) | 49.3% | Easy | |
-| 1155 | Number of Dice Rolls With Target Sum | | 49.1% | Medium | |
-| 1156 | Swap For Longest Repeated Character Substring | | 48.9% | Medium | |
-| 1157 | Online Majority Element In Subarray | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1157.Online-Majority-Element-In-Subarray) | 38.9% | Hard | |
-| 1158 | Market Analysis I | | 61.7% | Medium | |
-| 1159 | Market Analysis II | | 52.9% | Hard | |
-| 1160 | Find Words That Can Be Formed by Characters | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1160.Find-Words-That-Can-Be-Formed-by-Characters) | 67.4% | Easy | |
-| 1161 | Maximum Level Sum of a Binary Tree | | 72.2% | Medium | |
-| 1162 | As Far from Land as Possible | | 43.4% | Medium | |
-| 1163 | Last Substring in Lexicographical Order | | 33.8% | Hard | |
-| 1164 | Product Price at a Given Date | | 65.8% | Medium | |
-| 1165 | Single-Row Keyboard | | 84.8% | Easy | |
-| 1166 | Design File System | | 56.8% | Medium | |
-| 1167 | Minimum Cost to Connect Sticks | | 62.7% | Medium | |
-| 1168 | Optimize Water Distribution in a Village | | 60.9% | Hard | |
-| 1169 | Invalid Transactions | | 31.2% | Medium | |
-| 1170 | Compare Strings by Frequency of the Smallest Character | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1170.Compare-Strings-by-Frequency-of-the-Smallest-Character) | 58.6% | Easy | |
-| 1171 | Remove Zero Sum Consecutive Nodes from Linked List | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1171.Remove-Zero-Sum-Consecutive-Nodes-from-Linked-List) | 41.4% | Medium | |
-| 1172 | Dinner Plate Stacks | | 38.2% | Hard | |
-| 1173 | Immediate Food Delivery I | | 80.4% | Easy | |
-| 1174 | Immediate Food Delivery II | | 58.4% | Medium | |
-| 1175 | Prime Arrangements | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1175.Prime-Arrangements) | 51.0% | Easy | |
-| 1176 | Diet Plan Performance | | 53.9% | Easy | |
-| 1177 | Can Make Palindrome from Substring | | 34.6% | Medium | |
-| 1178 | Number of Valid Words for Each Puzzle | | 37.9% | Hard | |
-| 1179 | Reformat Department Table | | 80.5% | Easy | |
-| 1180 | Count Substrings with Only One Distinct Letter | | 77.0% | Easy | |
-| 1181 | Before and After Puzzle | | 44.4% | Medium | |
-| 1182 | Shortest Distance to Target Color | | 52.8% | Medium | |
-| 1183 | Maximum Number of Ones | | 54.4% | Hard | |
-| 1184 | Distance Between Bus Stops | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1184.Distance-Between-Bus-Stops) | 54.4% | Easy | |
-| 1185 | Day of the Week | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1185.Day-of-the-Week) | 64.0% | Easy | |
-| 1186 | Maximum Subarray Sum with One Deletion | | 37.4% | Medium | |
-| 1187 | Make Array Strictly Increasing | | 41.8% | Hard | |
-| 1188 | Design Bounded Blocking Queue | | 70.5% | Medium | |
-| 1189 | Maximum Number of Balloons | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1189.Maximum-Number-of-Balloons) | 61.2% | Easy | |
-| 1190 | Reverse Substrings Between Each Pair of Parentheses | | 61.5% | Medium | |
-| 1191 | K-Concatenation Maximum Sum | | 25.9% | Medium | |
-| 1192 | Critical Connections in a Network | | 48.6% | Hard | |
-| 1193 | Monthly Transactions I | | 68.2% | Medium | |
-| 1194 | Tournament Winners | | 52.8% | Hard | |
-| 1195 | Fizz Buzz Multithreaded | | 68.3% | Medium | |
-| 1196 | How Many Apples Can You Put into the Basket | | 68.1% | Easy | |
-| 1197 | Minimum Knight Moves | | 36.1% | Medium | |
-| 1198 | Find Smallest Common Element in All Rows | | 74.9% | Medium | |
-| 1199 | Minimum Time to Build Blocks | | 37.3% | Hard | |
-| 1200 | Minimum Absolute Difference | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1200.Minimum-Absolute-Difference) | 66.6% | Easy | |
-| 1201 | Ugly Number III | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1201.Ugly-Number-III) | 25.9% | Medium | |
-| 1202 | Smallest String With Swaps | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1202.Smallest-String-With-Swaps) | 46.5% | Medium | |
-| 1203 | Sort Items by Groups Respecting Dependencies | | 47.6% | Hard | |
-| 1204 | Last Person to Fit in the Elevator | | 69.7% | Medium | |
-| 1205 | Monthly Transactions II | | 45.1% | Medium | |
-| 1206 | Design Skiplist | | 57.4% | Hard | |
-| 1207 | Unique Number of Occurrences | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1207.Unique-Number-of-Occurrences) | 71.6% | Easy | |
-| 1208 | Get Equal Substrings Within Budget | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1208.Get-Equal-Substrings-Within-Budget) | 41.9% | Medium | |
-| 1209 | Remove All Adjacent Duplicates in String II | | 56.8% | Medium | |
-| 1210 | Minimum Moves to Reach Target with Rotations | | 45.2% | Hard | |
-| 1211 | Queries Quality and Percentage | | 68.3% | Easy | |
-| 1212 | Team Scores in Football Tournament | | 55.7% | Medium | |
-| 1213 | Intersection of Three Sorted Arrays | | 78.9% | Easy | |
-| 1214 | Two Sum BSTs | | 67.6% | Medium | |
-| 1215 | Stepping Numbers | | 41.6% | Medium | |
-| 1216 | Valid Palindrome III | | 47.7% | Hard | |
-| 1217 | Play with Chips | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1217.Play-with-Chips) | 64.3% | Easy | |
-| 1218 | Longest Arithmetic Subsequence of Given Difference | | 44.5% | Medium | |
-| 1219 | Path with Maximum Gold | | 65.1% | Medium | |
-| 1220 | Count Vowels Permutation | | 53.9% | Hard | |
-| 1221 | Split a String in Balanced Strings | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1221.Split-a-String-in-Balanced-Strings) | 83.2% | Easy | |
-| 1222 | Queens That Can Attack the King | | 68.7% | Medium | |
-| 1223 | Dice Roll Simulation | | 45.6% | Medium | |
-| 1224 | Maximum Equal Frequency | | 33.5% | Hard | |
-| 1225 | Report Contiguous Dates | | 61.2% | Hard | |
-| 1226 | The Dining Philosophers | | 55.7% | Medium | |
-| 1227 | Airplane Seat Assignment Probability | | 61.0% | Medium | |
-| 1228 | Missing Number In Arithmetic Progression | | 52.6% | Easy | |
-| 1229 | Meeting Scheduler | | 52.6% | Medium | |
-| 1230 | Toss Strange Coins | | 48.7% | Medium | |
-| 1231 | Divide Chocolate | | 52.3% | Hard | |
-| 1232 | Check If It Is a Straight Line | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1232.Check-If-It-Is-a-Straight-Line) | 45.3% | Easy | |
-| 1233 | Remove Sub-Folders from the Filesystem | | 59.5% | Medium | |
-| 1234 | Replace the Substring for Balanced String | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1234.Replace-the-Substring-for-Balanced-String) | 33.3% | Medium | |
-| 1235 | Maximum Profit in Job Scheduling | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1235.Maximum-Profit-in-Job-Scheduling) | 44.1% | Hard | |
-| 1236 | Web Crawler | | 64.3% | Medium | |
-| 1237 | Find Positive Integer Solution for a Given Equation | | 69.6% | Easy | |
-| 1238 | Circular Permutation in Binary Representation | | 64.9% | Medium | |
-| 1239 | Maximum Length of a Concatenated String with Unique Characters | | 47.8% | Medium | |
-| 1240 | Tiling a Rectangle with the Fewest Squares | | 50.1% | Hard | |
-| 1241 | Number of Comments per Post | | 67.0% | Easy | |
-| 1242 | Web Crawler Multithreaded | | 45.9% | Medium | |
-| 1243 | Array Transformation | | 51.0% | Easy | |
-| 1244 | Design A Leaderboard | | 60.7% | Medium | |
-| 1245 | Tree Diameter | | 60.0% | Medium | |
-| 1246 | Palindrome Removal | | 46.0% | Hard | |
-| 1247 | Minimum Swaps to Make Strings Equal | | 60.0% | Medium | |
-| 1248 | Count Number of Nice Subarrays | | 56.4% | Medium | |
-| 1249 | Minimum Remove to Make Valid Parentheses | | 62.5% | Medium | |
-| 1250 | Check If It Is a Good Array | | 55.7% | Hard | |
-| 1251 | Average Selling Price | | 81.4% | Easy | |
-| 1252 | Cells with Odd Values in a Matrix | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1252.Cells-with-Odd-Values-in-a-Matrix) | 78.1% | Easy | |
-| 1253 | Reconstruct a 2-Row Binary Matrix | | 40.4% | Medium | |
-| 1254 | Number of Closed Islands | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1254.Number-of-Closed-Islands) | 60.3% | Medium | |
-| 1255 | Maximum Score Words Formed by Letters | | 69.3% | Hard | |
-| 1256 | Encode Number | | 66.0% | Medium | |
-| 1257 | Smallest Common Region | | 58.8% | Medium | |
-| 1258 | Synonymous Sentences | | 64.4% | Medium | |
-| 1259 | Handshakes That Don't Cross | | 53.5% | Hard | |
-| 1260 | Shift 2D Grid | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1260.Shift-2D-Grid) | 61.3% | Easy | |
-| 1261 | Find Elements in a Contaminated Binary Tree | | 74.3% | Medium | |
-| 1262 | Greatest Sum Divisible by Three | | 47.6% | Medium | |
-| 1263 | Minimum Moves to Move a Box to Their Target Location | | 41.4% | Hard | |
-| 1264 | Page Recommendations | | 67.5% | Medium | |
-| 1265 | Print Immutable Linked List in Reverse | | 94.6% | Medium | |
-| 1266 | Minimum Time Visiting All Points | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1266.Minimum-Time-Visiting-All-Points) | 79.6% | Easy | |
-| 1267 | Count Servers that Communicate | | 57.9% | Medium | |
-| 1268 | Search Suggestions System | | 63.3% | Medium | |
-| 1269 | Number of Ways to Stay in the Same Place After Some Steps | | 43.2% | Hard | |
-| 1270 | All People Report to the Given Manager | | 87.0% | Medium | |
-| 1271 | Hexspeak | | 54.2% | Easy | |
-| 1272 | Remove Interval | | 58.6% | Medium | |
-| 1273 | Delete Tree Nodes | | 63.5% | Medium | |
-| 1274 | Number of Ships in a Rectangle | | 66.5% | Hard | |
-| 1275 | Find Winner on a Tic Tac Toe Game | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1275.Find-Winner-on-a-Tic-Tac-Toe-Game) | 52.9% | Easy | |
-| 1276 | Number of Burgers with No Waste of Ingredients | | 49.6% | Medium | |
-| 1277 | Count Square Submatrices with All Ones | | 73.2% | Medium | |
-| 1278 | Palindrome Partitioning III | | 59.9% | Hard | |
-| 1279 | Traffic Light Controlled Intersection | | 74.3% | Easy | |
-| 1280 | Students and Examinations | | 72.1% | Easy | |
-| 1281 | Subtract the Product and Sum of Digits of an Integer | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1281.Subtract-the-Product-and-Sum-of-Digits-of-an-Integer) | 85.2% | Easy | |
-| 1282 | Group the People Given the Group Size They Belong To | | 83.9% | Medium | |
-| 1283 | Find the Smallest Divisor Given a Threshold | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1283.Find-the-Smallest-Divisor-Given-a-Threshold) | 47.6% | Medium | |
-| 1284 | Minimum Number of Flips to Convert Binary Matrix to Zero Matrix | | 69.5% | Hard | |
-| 1285 | Find the Start and End Number of Continuous Ranges | | 83.7% | Medium | |
-| 1286 | Iterator for Combination | | 68.1% | Medium | |
-| 1287 | Element Appearing More Than 25% In Sorted Array | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1287.Element-Appearing-More-Than-In-Sorted-Array) | 60.2% | Easy | |
-| 1288 | Remove Covered Intervals | | 58.0% | Medium | |
-| 1289 | Minimum Falling Path Sum II | | 61.0% | Hard | |
-| 1290 | Convert Binary Number in a Linked List to Integer | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1290.Convert-Binary-Number-in-a-Linked-List-to-Integer) | 80.2% | Easy | |
-| 1291 | Sequential Digits | | 53.4% | Medium | |
-| 1292 | Maximum Side Length of a Square with Sum Less than or Equal to Threshold | | 48.5% | Medium | |
-| 1293 | Shortest Path in a Grid with Obstacles Elimination | | 42.7% | Hard | |
-| 1294 | Weather Type in Each Country | | 63.1% | Easy | |
-| 1295 | Find Numbers with Even Number of Digits | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1295.Find-Numbers-with-Even-Number-of-Digits) | 81.6% | Easy | |
-| 1296 | Divide Array in Sets of K Consecutive Numbers | | 53.7% | Medium | |
-| 1297 | Maximum Number of Occurrences of a Substring | | 47.3% | Medium | |
-| 1298 | Maximum Candies You Can Get from Boxes | | 58.9% | Hard | |
-| 1299 | Replace Elements with Greatest Element on Right Side | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1299.Replace-Elements-with-Greatest-Element-on-Right-Side) | 75.4% | Easy | |
-| 1300 | Sum of Mutated Array Closest to Target | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1300.Sum-of-Mutated-Array-Closest-to-Target) | 44.2% | Medium | |
-| 1301 | Number of Paths with Max Score | | 37.2% | Hard | |
-| 1302 | Deepest Leaves Sum | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1302.Deepest-Leaves-Sum) | 83.6% | Medium | |
-| 1303 | Find the Team Size | | 87.8% | Easy | |
-| 1304 | Find N Unique Integers Sum up to Zero | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1304.Find-N-Unique-Integers-Sum-up-to-Zero) | 76.3% | Easy | |
-| 1305 | All Elements in Two Binary Search Trees | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1305.All-Elements-in-Two-Binary-Search-Trees) | 76.1% | Medium | |
-| 1306 | Jump Game III | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1306.Jump-Game-III) | 60.5% | Medium | |
-| 1307 | Verbal Arithmetic Puzzle | | 37.6% | Hard | |
-| 1308 | Running Total for Different Genders | | 84.0% | Medium | |
-| 1309 | Decrypt String from Alphabet to Integer Mapping | | 76.7% | Easy | |
-| 1310 | XOR Queries of a Subarray | | 68.6% | Medium | |
-| 1311 | Get Watched Videos by Your Friends | | 43.1% | Medium | |
-| 1312 | Minimum Insertion Steps to Make a String Palindrome | | 58.1% | Hard | |
-| 1313 | Decompress Run-Length Encoded List | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1313.Decompress-Run-Length-Encoded-List) | 85.1% | Easy | |
-| 1314 | Matrix Block Sum | | 73.7% | Medium | |
-| 1315 | Sum of Nodes with Even-Valued Grandparent | | 83.5% | Medium | |
-| 1316 | Distinct Echo Substrings | | 46.4% | Hard | |
-| 1317 | Convert Integer to the Sum of Two No-Zero Integers | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1317.Convert-Integer-to-the-Sum-of-Two-No-Zero-Integers) | 56.7% | Easy | |
-| 1318 | Minimum Flips to Make a OR b Equal to c | | 62.8% | Medium | |
-| 1319 | Number of Operations to Make Network Connected | | 53.1% | Medium | |
-| 1320 | Minimum Distance to Type a Word Using Two Fingers | | 62.3% | Hard | |
-| 1321 | Restaurant Growth | | 67.7% | Medium | |
-| 1322 | Ads Performance | | 57.8% | Easy | |
-| 1323 | Maximum 69 Number | | 77.9% | Easy | |
-| 1324 | Print Words Vertically | | 58.0% | Medium | |
-| 1325 | Delete Leaves With a Given Value | | 72.9% | Medium | |
-| 1326 | Minimum Number of Taps to Open to Water a Garden | | 43.5% | Hard | |
-| 1327 | List the Products Ordered in a Period | | 76.3% | Easy | |
-| 1328 | Break a Palindrome | | 43.3% | Medium | |
-| 1329 | Sort the Matrix Diagonally | | 78.4% | Medium | |
-| 1330 | Reverse Subarray To Maximize Array Value | | 35.1% | Hard | |
-| 1331 | Rank Transform of an Array | | 58.1% | Easy | |
-| 1332 | Remove Palindromic Subsequences | | 60.0% | Easy | |
-| 1333 | Filter Restaurants by Vegan-Friendly, Price and Distance | | 54.6% | Medium | |
-| 1334 | Find the City With the Smallest Number of Neighbors at a Threshold Distance | | 44.5% | Medium | |
-| 1335 | Minimum Difficulty of a Job Schedule | | 57.5% | Hard | |
-| 1336 | Number of Transactions per Visit | | 43.5% | Hard | |
-| 1337 | The K Weakest Rows in a Matrix | | 68.7% | Easy | |
-| 1338 | Reduce Array Size to The Half | | 66.6% | Medium | |
-| 1339 | Maximum Product of Splitted Binary Tree | | 37.2% | Medium | |
-| 1340 | Jump Game V | | 57.5% | Hard | |
-| 1341 | Movie Rating | | 56.6% | Medium | |
-| 1342 | Number of Steps to Reduce a Number to Zero | | 86.3% | Easy | |
-| 1343 | Number of Sub-arrays of Size K and Average Greater than or Equal to Threshold | | 64.2% | Medium | |
-| 1344 | Angle Between Hands of a Clock | | 61.4% | Medium | |
-| 1345 | Jump Game IV | | 38.1% | Hard | |
-| 1346 | Check If N and Its Double Exist | | 38.0% | Easy | |
-| 1347 | Minimum Number of Steps to Make Two Strings Anagram | | 74.6% | Medium | |
-| 1348 | Tweet Counts Per Frequency | | 29.0% | Medium | |
-| 1349 | Maximum Students Taking Exam | | 41.9% | Hard | |
-| 1350 | Students With Invalid Departments | | 89.4% | Easy | |
-| 1351 | Count Negative Numbers in a Sorted Matrix | | 76.6% | Easy | |
-| 1352 | Product of the Last K Numbers | | 43.6% | Medium | |
-| 1353 | Maximum Number of Events That Can Be Attended | | 30.5% | Medium | |
-| 1354 | Construct Target Array With Multiple Sums | | 31.9% | Hard | |
-| 1355 | Activity Participants | | 69.2% | Medium | |
-| 1356 | Sort Integers by The Number of 1 Bits | | 68.6% | Easy | |
-| 1357 | Apply Discount Every n Orders | | 66.0% | Medium | |
-| 1358 | Number of Substrings Containing All Three Characters | | 58.0% | Medium | |
-| 1359 | Count All Valid Pickup and Delivery Options | | 57.9% | Hard | |
-| 1360 | Number of Days Between Two Dates | | 48.8% | Easy | |
-| 1361 | Validate Binary Tree Nodes | | 48.6% | Medium | |
-| 1362 | Closest Divisors | | 56.7% | Medium | |
-| 1363 | Largest Multiple of Three | | 33.5% | Hard | |
-| 1364 | Number of Trusted Contacts of a Customer | | 75.3% | Medium | |
-| 1365 | How Many Numbers Are Smaller Than the Current Number | | 85.6% | Easy | |
-| 1366 | Rank Teams by Votes | | 52.4% | Medium | |
-| 1367 | Linked List in Binary Tree | | 39.7% | Medium | |
-| 1368 | Minimum Cost to Make at Least One Valid Path in a Grid | | 54.4% | Hard | |
-| 1369 | Get the Second Most Recent Activity | | 64.7% | Hard | |
-| 1370 | Increasing Decreasing String | | 75.6% | Easy | |
-| 1371 | Find the Longest Substring Containing Vowels in Even Counts | | 57.3% | Medium | |
-| 1372 | Longest ZigZag Path in a Binary Tree | | 54.0% | Medium | |
-| 1373 | Maximum Sum BST in Binary Tree | | 40.2% | Hard | |
-| 1374 | Generate a String With Characters That Have Odd Counts | | 75.4% | Easy | |
-| 1375 | Bulb Switcher III | | 62.5% | Medium | |
-| 1376 | Time Needed to Inform All Employees | | 55.5% | Medium | |
-| 1377 | Frog Position After T Seconds | | 33.6% | Hard | |
-| 1378 | Replace Employee ID With The Unique Identifier | | 87.4% | Easy | |
-| 1379 | Find a Corresponding Node of a Binary Tree in a Clone of That Tree | | 83.8% | Medium | |
-| 1380 | Lucky Numbers in a Matrix | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1380.Lucky-Numbers-in-a-Matrix) | 71.4% | Easy | |
-| 1381 | Design a Stack With Increment Operation | | 74.7% | Medium | |
-| 1382 | Balance a Binary Search Tree | | 74.8% | Medium | |
-| 1383 | Maximum Performance of a Team | | 31.8% | Hard | |
-| 1384 | Total Sales Amount by Year | | 62.8% | Hard | |
-| 1385 | Find the Distance Value Between Two Arrays | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1385.Find-the-Distance-Value-Between-Two-Arrays) | 67.1% | Easy | |
-| 1386 | Cinema Seat Allocation | | 34.8% | Medium | |
-| 1387 | Sort Integers by The Power Value | | 70.1% | Medium | |
-| 1388 | Pizza With 3n Slices | | 44.7% | Hard | |
-| 1389 | Create Target Array in the Given Order | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1389.Create-Target-Array-in-the-Given-Order) | 84.1% | Easy | |
-| 1390 | Four Divisors | | 38.1% | Medium | |
-| 1391 | Check if There is a Valid Path in a Grid | | 44.5% | Medium | |
-| 1392 | Longest Happy Prefix | | 40.0% | Hard | |
-| 1393 | Capital Gain/Loss | | 89.2% | Medium | |
-| 1394 | Find Lucky Integer in an Array | | 64.5% | Easy | |
-| 1395 | Count Number of Teams | | 81.9% | Medium | |
-| 1396 | Design Underground System | | 64.7% | Medium | |
-| 1397 | Find All Good Strings | | 37.2% | Hard | |
-| 1398 | Customers Who Bought Products A and B but Not C | | 80.6% | Medium | |
-| 1399 | Count Largest Group | | 65.0% | Easy | |
-| 1400 | Construct K Palindrome Strings | | 60.4% | Medium | |
-| 1401 | Circle and Rectangle Overlapping | | 41.8% | Medium | |
-| 1402 | Reducing Dishes | | 72.8% | Hard | |
-| 1403 | Minimum Subsequence in Non-Increasing Order | | 70.8% | Easy | |
-| 1404 | Number of Steps to Reduce a Number in Binary Representation to One | | 50.3% | Medium | |
-| 1405 | Longest Happy String | | 49.0% | Medium | |
-| 1406 | Stone Game III | | 56.0% | Hard | |
-| 1407 | Top Travellers | | 82.1% | Easy | |
-| 1408 | String Matching in an Array | | 61.4% | Easy | |
-| 1409 | Queries on a Permutation With Key | | 81.6% | Medium | |
-| 1410 | HTML Entity Parser | | 53.9% | Medium | |
-| 1411 | Number of Ways to Paint N × 3 Grid | | 61.2% | Hard | |
-| 1412 | Find the Quiet Students in All Exams | | 66.6% | Hard | |
-| 1413 | Minimum Value to Get Positive Step by Step Sum | | 65.2% | Easy | |
-| 1414 | Find the Minimum Number of Fibonacci Numbers Whose Sum Is K | | 62.4% | Medium | |
-| 1415 | The k-th Lexicographical String of All Happy Strings of Length n | | 70.4% | Medium | |
-| 1416 | Restore The Array | | 36.7% | Hard | |
-| 1417 | Reformat The String | | 55.0% | Easy | |
-| 1418 | Display Table of Food Orders in a Restaurant | | 65.6% | Medium | |
-| 1419 | Minimum Number of Frogs Croaking | | 46.3% | Medium | |
-| 1420 | Build Array Where You Can Find The Maximum Exactly K Comparisons | | 65.2% | Hard | |
-| 1421 | NPV Queries | | 80.5% | Medium | |
-| 1422 | Maximum Score After Splitting a String | | 54.7% | Easy | |
-| 1423 | Maximum Points You Can Obtain from Cards | | 42.5% | Medium | |
-| 1424 | Diagonal Traverse II | | 42.3% | Medium | |
-| 1425 | Constrained Subsequence Sum | | 44.1% | Hard | |
-| 1426 | Counting Elements | | 58.7% | Easy | |
-| 1427 | Perform String Shifts | | 53.0% | Easy | |
-| 1428 | Leftmost Column with at Least a One | | 46.8% | Medium | |
-| 1429 | First Unique Number | | 47.0% | Medium | |
-| 1430 | Check If a String Is a Valid Sequence from Root to Leaves Path in a Binary Tree | | 44.8% | Medium | |
-| 1431 | Kids With the Greatest Number of Candies | | 88.9% | Easy | |
-| 1432 | Max Difference You Can Get From Changing an Integer | | 42.8% | Medium | |
-| 1433 | Check If a String Can Break Another String | | 65.7% | Medium | |
-| 1434 | Number of Ways to Wear Different Hats to Each Other | | 38.0% | Hard | |
-| 1435 | Create a Session Bar Chart | | 76.7% | Easy | |
-| 1436 | Destination City | | 77.3% | Easy | |
-| 1437 | Check If All 1's Are at Least Length K Places Away | | 63.3% | Medium | |
-| 1438 | Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit | | 41.9% | Medium | |
-| 1439 | Find the Kth Smallest Sum of a Matrix With Sorted Rows | | 59.4% | Hard | |
-| 1440 | Evaluate Boolean Expression | | 70.1% | Medium | |
-| 1441 | Build an Array With Stack Operations | | 68.8% | Easy | |
-| 1442 | Count Triplets That Can Form Two Arrays of Equal XOR | | 69.4% | Medium | |
-| 1443 | Minimum Time to Collect All Apples in a Tree | | 55.5% | Medium | |
-| 1444 | Number of Ways of Cutting a Pizza | | 52.7% | Hard | |
-| 1445 | Apples & Oranges | | 87.2% | Medium | |
-| 1446 | Consecutive Characters | | 60.4% | Easy | |
-| 1447 | Simplified Fractions | | 61.0% | Medium | |
-| 1448 | Count Good Nodes in Binary Tree | | 70.6% | Medium | |
-| 1449 | Form Largest Integer With Digits That Add up to Target | | 41.8% | Hard | |
-| 1450 | Number of Students Doing Homework at a Given Time | | 78.1% | Easy | |
-| 1451 | Rearrange Words in a Sentence | | 54.8% | Medium | |
-| 1452 | People Whose List of Favorite Companies Is Not a Subset of Another List | | 53.3% | Medium | |
-| 1453 | Maximum Number of Darts Inside of a Circular Dartboard | | 33.7% | Hard | |
-| 1454 | Active Users | | 37.5% | Medium | |
-| 1455 | Check If a Word Occurs As a Prefix of Any Word in a Sentence | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1455.Check-If-a-Word-Occurs-As-a-Prefix-of-Any-Word-in-a-Sentence) | 64.7% | Easy | |
-| 1456 | Maximum Number of Vowels in a Substring of Given Length | | 52.4% | Medium | |
-| 1457 | Pseudo-Palindromic Paths in a Binary Tree | | 67.2% | Medium | |
-| 1458 | Max Dot Product of Two Subsequences | | 41.7% | Hard | |
-| 1459 | Rectangles Area | | 61.5% | Medium | |
-| 1460 | Make Two Arrays Equal by Reversing Sub-arrays | | 74.0% | Easy | |
-| 1461 | Check If a String Contains All Binary Codes of Size K | | 44.6% | Medium | |
-| 1462 | Course Schedule IV | | 41.7% | Medium | |
-| 1463 | Cherry Pickup II | | 65.5% | Hard | |
-| 1464 | Maximum Product of Two Elements in an Array | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1464.Maximum-Product-of-Two-Elements-in-an-Array) | 78.1% | Easy | |
-| 1465 | Maximum Area of a Piece of Cake After Horizontal and Vertical Cuts | | 30.8% | Medium | |
-| 1466 | Reorder Routes to Make All Paths Lead to the City Zero | | 63.6% | Medium | |
-| 1467 | Probability of a Two Boxes Having The Same Number of Distinct Balls | | 61.1% | Hard | |
-| 1468 | Calculate Salaries | | 78.0% | Medium | |
-| 1469 | Find All The Lonely Nodes | | 81.5% | Easy | |
-| 1470 | Shuffle the Array | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1470.Shuffle-the-Array) | 89.0% | Easy | |
-| 1471 | The k Strongest Values in an Array | | 57.0% | Medium | |
-| 1472 | Design Browser History | | 64.5% | Medium | |
-| 1473 | Paint House III | | 48.1% | Hard | |
-| 1474 | Delete N Nodes After M Nodes of a Linked List | | 74.2% | Easy | |
-| 1475 | Final Prices With a Special Discount in a Shop | | 75.7% | Easy | |
-| 1476 | Subrectangle Queries | | 90.5% | Medium | |
-| 1477 | Find Two Non-overlapping Sub-arrays Each With Target Sum | | 29.8% | Medium | |
-| 1478 | Allocate Mailboxes | | 55.0% | Hard | |
-| 1479 | Sales by Day of the Week | | 83.4% | Hard | |
-| 1480 | Running Sum of 1d Array | | 90.6% | Easy | |
-| 1481 | Least Number of Unique Integers after K Removals | | 53.7% | Medium | |
-| 1482 | Minimum Number of Days to Make m Bouquets | | 45.7% | Medium | |
-| 1483 | Kth Ancestor of a Tree Node | | 27.6% | Hard | |
-| 1484 | Group Sold Products By The Date | | 86.0% | Easy | |
-| 1485 | Clone Binary Tree With Random Pointer | | 81.4% | Medium | |
-| 1486 | XOR Operation in an Array | | 85.1% | Easy | |
-| 1487 | Making File Names Unique | | 29.2% | Medium | |
-| 1488 | Avoid Flood in The City | | 25.3% | Medium | |
-| 1489 | Find Critical and Pseudo-Critical Edges in Minimum Spanning Tree | | 50.5% | Hard | |
-| 1490 | Clone N-ary Tree | | 84.7% | Medium | |
-| 1491 | Average Salary Excluding the Minimum and Maximum Salary | | 70.2% | Easy | |
-| 1492 | The kth Factor of n | | 68.0% | Medium | |
-| 1493 | Longest Subarray of 1's After Deleting One Element | | 58.4% | Medium | |
-| 1494 | Parallel Courses II | | 32.2% | Hard | |
-| 1495 | Friendly Movies Streamed Last Month | | 52.9% | Easy | |
-| 1496 | Path Crossing | | 55.9% | Easy | |
-| 1497 | Check If Array Pairs Are Divisible by k | | 41.2% | Medium | |
-| 1498 | Number of Subsequences That Satisfy the Given Sum Condition | | 36.7% | Medium | |
-| 1499 | Max Value of Equation | | 44.6% | Hard | |
-| 1500 | Design a File Sharing System | | 46.4% | Medium | |
-| 1501 | Countries You Can Safely Invest In | | 63.8% | Medium | |
-| 1502 | Can Make Arithmetic Progression From Sequence | | 73.4% | Easy | |
-| 1503 | Last Moment Before All Ants Fall Out of a Plank | | 51.5% | Medium | |
-| 1504 | Count Submatrices With All Ones | | 61.6% | Medium | |
-| 1505 | Minimum Possible Integer After at Most K Adjacent Swaps On Digits | | 36.1% | Hard | |
-| 1506 | Find Root of N-Ary Tree | | 79.8% | Medium | |
-| 1507 | Reformat Date | | 60.5% | Easy | |
-| 1508 | Range Sum of Sorted Subarray Sums | | 68.6% | Medium | |
-| 1509 | Minimum Difference Between Largest and Smallest Value in Three Moves | | 50.9% | Medium | |
-| 1510 | Stone Game IV | | 50.2% | Hard | |
-| 1511 | Customer Order Frequency | | 77.0% | Easy | |
-| 1512 | Number of Good Pairs | | 88.7% | Easy | |
-| 1513 | Number of Substrings With Only 1s | | 40.4% | Medium | |
-| 1514 | Path with Maximum Probability | | 36.5% | Medium | |
-| 1515 | Best Position for a Service Centre | | 35.8% | Hard | |
-| 1516 | Move Sub-Tree of N-Ary Tree | | 60.2% | Hard | |
-| 1517 | Find Users With Valid E-Mails | | 71.2% | Easy | |
-| 1518 | Water Bottles | | 63.1% | Easy | |
-| 1519 | Number of Nodes in the Sub-Tree With the Same Label | | 35.1% | Medium | |
-| 1520 | Maximum Number of Non-Overlapping Substrings | | 32.7% | Hard | |
-| 1521 | Find a Value of a Mysterious Function Closest to Target | | 43.3% | Hard | |
-| 1522 | Diameter of N-Ary Tree | | 70.0% | Medium | |
-| 1523 | Count Odd Numbers in an Interval Range | | 55.7% | Easy | |
-| 1524 | Number of Sub-arrays With Odd Sum | | 36.3% | Medium | |
-| 1525 | Number of Good Ways to Split a String | | 70.0% | Medium | |
-| 1526 | Minimum Number of Increments on Subarrays to Form a Target Array | | 57.5% | Hard | |
-| 1527 | Patients With a Condition | | 88.4% | Easy | |
-| 1528 | Shuffle String | | 86.1% | Easy | |
-| 1529 | Bulb Switcher IV | | 70.4% | Medium | |
-| 1530 | Number of Good Leaf Nodes Pairs | | 53.4% | Medium | |
-| 1531 | String Compression II | | 28.6% | Hard | |
-| 1532 | The Most Recent Three Orders | | 75.1% | Medium | |
-| 1533 | Find the Index of the Large Integer | | 57.7% | Medium | |
-| 1534 | Count Good Triplets | | 79.4% | Easy | |
-| 1535 | Find the Winner of an Array Game | | 45.5% | Medium | |
-| 1536 | Minimum Swaps to Arrange a Binary Grid | | 41.5% | Medium | |
-| 1537 | Get the Maximum Score | | 35.7% | Hard | |
-| 1538 | Guess the Majority in a Hidden Array | | 56.9% | Medium | |
+|0001|Two Sum|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0001.Two-Sum)|49.1%|Easy||
+|0002|Add Two Numbers|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0002.Add-Two-Numbers)|39.7%|Medium||
+|0003|Longest Substring Without Repeating Characters|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0003.Longest-Substring-Without-Repeating-Characters)|33.8%|Medium||
+|0004|Median of Two Sorted Arrays|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0004.Median-of-Two-Sorted-Arrays)|35.1%|Hard||
+|0005|Longest Palindromic Substring|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0005.Longest-Palindromic-Substring)|32.4%|Medium||
+|0006|Zigzag Conversion|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0006.Zigzag-Conversion)|43.0%|Medium||
+|0007|Reverse Integer|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0007.Reverse-Integer)|27.2%|Medium||
+|0008|String to Integer (atoi)|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0008.String-to-Integer-atoi)|16.6%|Medium||
+|0009|Palindrome Number|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0009.Palindrome-Number)|52.8%|Easy||
+|0010|Regular Expression Matching||28.3%|Hard||
+|0011|Container With Most Water|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0011.Container-With-Most-Water)|54.3%|Medium||
+|0012|Integer to Roman|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0012.Integer-to-Roman)|60.5%|Medium||
+|0013|Roman to Integer|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0013.Roman-to-Integer)|58.2%|Easy||
+|0014|Longest Common Prefix|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0014.Longest-Common-Prefix)|40.7%|Easy||
+|0015|3Sum|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0015.3Sum)|32.2%|Medium||
+|0016|3Sum Closest|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0016.3Sum-Closest)|46.2%|Medium||
+|0017|Letter Combinations of a Phone Number|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0017.Letter-Combinations-of-a-Phone-Number)|55.5%|Medium||
+|0018|4Sum|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0018.4Sum)|36.5%|Medium||
+|0019|Remove Nth Node From End of List|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0019.Remove-Nth-Node-From-End-of-List)|39.9%|Medium||
+|0020|Valid Parentheses|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0020.Valid-Parentheses)|40.7%|Easy||
+|0021|Merge Two Sorted Lists|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0021.Merge-Two-Sorted-Lists)|61.8%|Easy||
+|0022|Generate Parentheses|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0022.Generate-Parentheses)|71.7%|Medium||
+|0023|Merge k Sorted Lists|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0023.Merge-k-Sorted-Lists)|48.3%|Hard||
+|0024|Swap Nodes in Pairs|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0024.Swap-Nodes-in-Pairs)|60.3%|Medium||
+|0025|Reverse Nodes in k-Group|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0025.Reverse-Nodes-in-k-Group)|53.4%|Hard||
+|0026|Remove Duplicates from Sorted Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0026.Remove-Duplicates-from-Sorted-Array)|50.3%|Easy||
+|0027|Remove Element|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0027.Remove-Element)|52.0%|Easy||
+|0028|Find the Index of the First Occurrence in a String|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0028.Find-the-Index-of-the-First-Occurrence-in-a-String)|37.4%|Medium||
+|0029|Divide Two Integers|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0029.Divide-Two-Integers)|17.4%|Medium||
+|0030|Substring with Concatenation of All Words|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0030.Substring-with-Concatenation-of-All-Words)|30.9%|Hard||
+|0031|Next Permutation|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0031.Next-Permutation)|37.1%|Medium||
+|0032|Longest Valid Parentheses|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0032.Longest-Valid-Parentheses)|32.7%|Hard||
+|0033|Search in Rotated Sorted Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0033.Search-in-Rotated-Sorted-Array)|38.6%|Medium||
+|0034|Find First and Last Position of Element in Sorted Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0034.Find-First-and-Last-Position-of-Element-in-Sorted-Array)|41.5%|Medium||
+|0035|Search Insert Position|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0035.Search-Insert-Position)|42.0%|Easy||
+|0036|Valid Sudoku|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0036.Valid-Sudoku)|56.7%|Medium||
+|0037|Sudoku Solver|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0037.Sudoku-Solver)|56.6%|Hard||
+|0038|Count and Say||51.1%|Medium||
+|0039|Combination Sum|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0039.Combination-Sum)|67.5%|Medium||
+|0040|Combination Sum II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0040.Combination-Sum-II)|53.3%|Medium||
+|0041|First Missing Positive|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0041.First-Missing-Positive)|36.5%|Hard||
+|0042|Trapping Rain Water|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0042.Trapping-Rain-Water)|58.7%|Hard||
+|0043|Multiply Strings|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0043.Multiply-Strings)|38.7%|Medium||
+|0044|Wildcard Matching||26.8%|Hard||
+|0045|Jump Game II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0045.Jump-Game-II)|38.5%|Medium||
+|0046|Permutations|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0046.Permutations)|74.6%|Medium||
+|0047|Permutations II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0047.Permutations-II)|56.6%|Medium||
+|0048|Rotate Image|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0048.Rotate-Image)|69.8%|Medium||
+|0049|Group Anagrams|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0049.Group-Anagrams)|65.9%|Medium||
+|0050|Pow(x, n)|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0050.Powx-n)|32.8%|Medium||
+|0051|N-Queens|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0051.N-Queens)|62.8%|Hard||
+|0052|N-Queens II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0052.N-Queens-II)|70.8%|Hard||
+|0053|Maximum Subarray|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0053.Maximum-Subarray)|50.0%|Medium||
+|0054|Spiral Matrix|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0054.Spiral-Matrix)|43.6%|Medium||
+|0055|Jump Game|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0055.Jump-Game)|38.4%|Medium||
+|0056|Merge Intervals|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0056.Merge-Intervals)|45.9%|Medium||
+|0057|Insert Interval|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0057.Insert-Interval)|37.9%|Medium||
+|0058|Length of Last Word|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0058.Length-of-Last-Word)|40.3%|Easy||
+|0059|Spiral Matrix II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0059.Spiral-Matrix-II)|66.5%|Medium||
+|0060|Permutation Sequence|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0060.Permutation-Sequence)|43.7%|Hard||
+|0061|Rotate List|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0061.Rotate-List)|35.7%|Medium||
+|0062|Unique Paths|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0062.Unique-Paths)|62.2%|Medium||
+|0063|Unique Paths II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0063.Unique-Paths-II)|39.1%|Medium||
+|0064|Minimum Path Sum|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0064.Minimum-Path-Sum)|60.6%|Medium||
+|0065|Valid Number|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0065.Valid-Number)|18.6%|Hard||
+|0066|Plus One|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0066.Plus-One)|43.3%|Easy||
+|0067|Add Binary|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0067.Add-Binary)|51.3%|Easy||
+|0068|Text Justification||36.6%|Hard||
+|0069|Sqrt(x)|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0069.Sqrtx)|37.0%|Easy||
+|0070|Climbing Stairs|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0070.Climbing-Stairs)|51.7%|Easy||
+|0071|Simplify Path|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0071.Simplify-Path)|39.2%|Medium||
+|0072|Edit Distance||52.6%|Hard||
+|0073|Set Matrix Zeroes|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0073.Set-Matrix-Zeroes)|49.9%|Medium||
+|0074|Search a 2D Matrix|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0074.Search-a-2D-Matrix)|46.7%|Medium||
+|0075|Sort Colors|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0075.Sort-Colors)|57.1%|Medium||
+|0076|Minimum Window Substring|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0076.Minimum-Window-Substring)|40.0%|Hard||
+|0077|Combinations|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0077.Combinations)|66.0%|Medium||
+|0078|Subsets|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0078.Subsets)|73.7%|Medium||
+|0079|Word Search|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0079.Word-Search)|39.8%|Medium||
+|0080|Remove Duplicates from Sorted Array II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0080.Remove-Duplicates-from-Sorted-Array-II)|51.5%|Medium||
+|0081|Search in Rotated Sorted Array II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0081.Search-in-Rotated-Sorted-Array-II)|35.7%|Medium||
+|0082|Remove Duplicates from Sorted List II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0082.Remove-Duplicates-from-Sorted-List-II)|45.4%|Medium||
+|0083|Remove Duplicates from Sorted List|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0083.Remove-Duplicates-from-Sorted-List)|49.8%|Easy||
+|0084|Largest Rectangle in Histogram|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0084.Largest-Rectangle-in-Histogram)|42.1%|Hard||
+|0085|Maximal Rectangle||44.1%|Hard||
+|0086|Partition List|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0086.Partition-List)|51.3%|Medium||
+|0087|Scramble String||36.1%|Hard||
+|0088|Merge Sorted Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0088.Merge-Sorted-Array)|45.7%|Easy||
+|0089|Gray Code|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0089.Gray-Code)|56.4%|Medium||
+|0090|Subsets II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0090.Subsets-II)|55.2%|Medium||
+|0091|Decode Ways|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0091.Decode-Ways)|32.2%|Medium||
+|0092|Reverse Linked List II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0092.Reverse-Linked-List-II)|45.3%|Medium||
+|0093|Restore IP Addresses|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0093.Restore-IP-Addresses)|43.3%|Medium||
+|0094|Binary Tree Inorder Traversal|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0094.Binary-Tree-Inorder-Traversal)|72.9%|Easy||
+|0095|Unique Binary Search Trees II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0095.Unique-Binary-Search-Trees-II)|51.4%|Medium||
+|0096|Unique Binary Search Trees|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0096.Unique-Binary-Search-Trees)|59.2%|Medium||
+|0097|Interleaving String|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0097.Interleaving-String)|37.1%|Medium||
+|0098|Validate Binary Search Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0098.Validate-Binary-Search-Tree)|31.7%|Medium||
+|0099|Recover Binary Search Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0099.Recover-Binary-Search-Tree)|50.2%|Medium||
+|0100|Same Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0100.Same-Tree)|56.3%|Easy||
+|0101|Symmetric Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0101.Symmetric-Tree)|52.8%|Easy||
+|0102|Binary Tree Level Order Traversal|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0102.Binary-Tree-Level-Order-Traversal)|63.2%|Medium||
+|0103|Binary Tree Zigzag Level Order Traversal|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0103.Binary-Tree-Zigzag-Level-Order-Traversal)|55.0%|Medium||
+|0104|Maximum Depth of Binary Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0104.Maximum-Depth-of-Binary-Tree)|73.0%|Easy||
+|0105|Construct Binary Tree from Preorder and Inorder Traversal|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0105.Construct-Binary-Tree-from-Preorder-and-Inorder-Traversal)|60.6%|Medium||
+|0106|Construct Binary Tree from Inorder and Postorder Traversal|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0106.Construct-Binary-Tree-from-Inorder-and-Postorder-Traversal)|57.3%|Medium||
+|0107|Binary Tree Level Order Traversal II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0107.Binary-Tree-Level-Order-Traversal-II)|60.2%|Medium||
+|0108|Convert Sorted Array to Binary Search Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0108.Convert-Sorted-Array-to-Binary-Search-Tree)|68.9%|Easy||
+|0109|Convert Sorted List to Binary Search Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0109.Convert-Sorted-List-to-Binary-Search-Tree)|57.2%|Medium||
+|0110|Balanced Binary Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0110.Balanced-Binary-Tree)|48.1%|Easy||
+|0111|Minimum Depth of Binary Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0111.Minimum-Depth-of-Binary-Tree)|43.5%|Easy||
+|0112|Path Sum|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0112.Path-Sum)|47.6%|Easy||
+|0113|Path Sum II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0113.Path-Sum-II)|56.5%|Medium||
+|0114|Flatten Binary Tree to Linked List|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0114.Flatten-Binary-Tree-to-Linked-List)|61.0%|Medium||
+|0115|Distinct Subsequences|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0115.Distinct-Subsequences)|43.7%|Hard||
+|0116|Populating Next Right Pointers in Each Node|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0116.Populating-Next-Right-Pointers-in-Each-Node)|59.3%|Medium||
+|0117|Populating Next Right Pointers in Each Node II||49.6%|Medium||
+|0118|Pascal's Triangle|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0118.Pascals-Triangle)|68.9%|Easy||
+|0119|Pascal's Triangle II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0119.Pascals-Triangle-II)|59.5%|Easy||
+|0120|Triangle|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0120.Triangle)|53.8%|Medium||
+|0121|Best Time to Buy and Sell Stock|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0121.Best-Time-to-Buy-and-Sell-Stock)|54.5%|Easy||
+|0122|Best Time to Buy and Sell Stock II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0122.Best-Time-to-Buy-and-Sell-Stock-II)|63.2%|Medium||
+|0123|Best Time to Buy and Sell Stock III||44.8%|Hard||
+|0124|Binary Tree Maximum Path Sum|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0124.Binary-Tree-Maximum-Path-Sum)|38.4%|Hard||
+|0125|Valid Palindrome|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0125.Valid-Palindrome)|43.5%|Easy||
+|0126|Word Ladder II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0126.Word-Ladder-II)|27.6%|Hard||
+|0127|Word Ladder|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0127.Word-Ladder)|36.6%|Hard||
+|0128|Longest Consecutive Sequence|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0128.Longest-Consecutive-Sequence)|49.0%|Medium||
+|0129|Sum Root to Leaf Numbers|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0129.Sum-Root-to-Leaf-Numbers)|58.6%|Medium||
+|0130|Surrounded Regions|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0130.Surrounded-Regions)|35.8%|Medium||
+|0131|Palindrome Partitioning|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0131.Palindrome-Partitioning)|62.3%|Medium||
+|0132|Palindrome Partitioning II||33.6%|Hard||
+|0133|Clone Graph||50.5%|Medium||
+|0134|Gas Station||45.0%|Medium||
+|0135|Candy|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0135.Candy)|40.7%|Hard||
+|0136|Single Number|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0136.Single-Number)|70.0%|Easy||
+|0137|Single Number II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0137.Single-Number-II)|57.7%|Medium||
+|0138|Copy List with Random Pointer|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0138.Copy-List-with-Random-Pointer)|50.4%|Medium||
+|0139|Word Break||45.4%|Medium||
+|0140|Word Break II||44.3%|Hard||
+|0141|Linked List Cycle|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0141.Linked-List-Cycle)|46.8%|Easy||
+|0142|Linked List Cycle II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0142.Linked-List-Cycle-II)|46.2%|Medium||
+|0143|Reorder List|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0143.Reorder-List)|50.9%|Medium||
+|0144|Binary Tree Preorder Traversal|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0144.Binary-Tree-Preorder-Traversal)|64.5%|Easy||
+|0145|Binary Tree Postorder Traversal|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0145.Binary-Tree-Postorder-Traversal)|66.5%|Easy||
+|0146|LRU Cache|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0146.LRU-Cache)|40.5%|Medium||
+|0147|Insertion Sort List|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0147.Insertion-Sort-List)|50.1%|Medium||
+|0148|Sort List|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0148.Sort-List)|54.0%|Medium||
+|0149|Max Points on a Line||21.7%|Hard||
+|0150|Evaluate Reverse Polish Notation|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0150.Evaluate-Reverse-Polish-Notation)|44.1%|Medium||
+|0151|Reverse Words in a String|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0151.Reverse-Words-in-a-String)|30.2%|Medium||
+|0152|Maximum Product Subarray|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0152.Maximum-Product-Subarray)|34.9%|Medium||
+|0153|Find Minimum in Rotated Sorted Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0153.Find-Minimum-in-Rotated-Sorted-Array)|48.4%|Medium||
+|0154|Find Minimum in Rotated Sorted Array II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0154.Find-Minimum-in-Rotated-Sorted-Array-II)|43.4%|Hard||
+|0155|Min Stack|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0155.Min-Stack)|51.7%|Medium||
+|0156|Binary Tree Upside Down||61.5%|Medium||
+|0157|Read N Characters Given Read4||40.7%|Easy||
+|0158|Read N Characters Given read4 II - Call Multiple Times||41.4%|Hard||
+|0159|Longest Substring with At Most Two Distinct Characters||53.5%|Medium||
+|0160|Intersection of Two Linked Lists|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0160.Intersection-of-Two-Linked-Lists)|53.1%|Easy||
+|0161|One Edit Distance||34.1%|Medium||
+|0162|Find Peak Element|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0162.Find-Peak-Element)|46.2%|Medium||
+|0163|Missing Ranges||31.9%|Easy||
+|0164|Maximum Gap|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0164.Maximum-Gap)|42.6%|Hard||
+|0165|Compare Version Numbers||35.3%|Medium||
+|0166|Fraction to Recurring Decimal||24.0%|Medium||
+|0167|Two Sum II - Input Array Is Sorted|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0167.Two-Sum-II-Input-Array-Is-Sorted)|60.0%|Medium||
+|0168|Excel Sheet Column Title|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0168.Excel-Sheet-Column-Title)|34.7%|Easy||
+|0169|Majority Element|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0169.Majority-Element)|63.8%|Easy||
+|0170|Two Sum III - Data structure design||37.3%|Easy||
+|0171|Excel Sheet Column Number|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0171.Excel-Sheet-Column-Number)|61.3%|Easy||
+|0172|Factorial Trailing Zeroes|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0172.Factorial-Trailing-Zeroes)|41.6%|Medium||
+|0173|Binary Search Tree Iterator|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0173.Binary-Search-Tree-Iterator)|69.0%|Medium||
+|0174|Dungeon Game|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0174.Dungeon-Game)|37.2%|Hard||
+|0175|Combine Two Tables||72.8%|Easy||
+|0176|Second Highest Salary||36.4%|Medium||
+|0177|Nth Highest Salary||37.3%|Medium||
+|0178|Rank Scores||59.7%|Medium||
+|0179|Largest Number|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0179.Largest-Number)|33.9%|Medium||
+|0180|Consecutive Numbers||46.7%|Medium||
+|0181|Employees Earning More Than Their Managers||68.4%|Easy||
+|0182|Duplicate Emails||70.5%|Easy||
+|0183|Customers Who Never Order||67.6%|Easy||
+|0184|Department Highest Salary||49.5%|Medium||
+|0185|Department Top Three Salaries||49.9%|Hard||
+|0186|Reverse Words in a String II||52.3%|Medium||
+|0187|Repeated DNA Sequences|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0187.Repeated-DNA-Sequences)|46.1%|Medium||
+|0188|Best Time to Buy and Sell Stock IV||37.8%|Hard||
+|0189|Rotate Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0189.Rotate-Array)|39.2%|Medium||
+|0190|Reverse Bits|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0190.Reverse-Bits)|51.9%|Easy||
+|0191|Number of 1 Bits|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0191.Number-of-1-Bits)|64.5%|Easy||
+|0192|Word Frequency||25.6%|Medium||
+|0193|Valid Phone Numbers||26.0%|Easy||
+|0194|Transpose File||25.3%|Medium||
+|0195|Tenth Line||32.9%|Easy||
+|0196|Delete Duplicate Emails||58.3%|Easy||
+|0197|Rising Temperature||44.4%|Easy||
+|0198|House Robber|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0198.House-Robber)|48.6%|Medium||
+|0199|Binary Tree Right Side View|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0199.Binary-Tree-Right-Side-View)|61.1%|Medium||
+|0200|Number of Islands|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0200.Number-of-Islands)|56.1%|Medium||
+|0201|Bitwise AND of Numbers Range|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0201.Bitwise-AND-of-Numbers-Range)|42.2%|Medium||
+|0202|Happy Number|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0202.Happy-Number)|54.3%|Easy||
+|0203|Remove Linked List Elements|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0203.Remove-Linked-List-Elements)|44.7%|Easy||
+|0204|Count Primes|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0204.Count-Primes)|33.1%|Medium||
+|0205|Isomorphic Strings|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0205.Isomorphic-Strings)|42.5%|Easy||
+|0206|Reverse Linked List|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0206.Reverse-Linked-List)|72.3%|Easy||
+|0207|Course Schedule|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0207.Course-Schedule)|45.3%|Medium||
+|0208|Implement Trie (Prefix Tree)|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0208.Implement-Trie-Prefix-Tree)|60.7%|Medium||
+|0209|Minimum Size Subarray Sum|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0209.Minimum-Size-Subarray-Sum)|44.4%|Medium||
+|0210|Course Schedule II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0210.Course-Schedule-II)|47.9%|Medium||
+|0211|Design Add and Search Words Data Structure|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0211.Design-Add-and-Search-Words-Data-Structure)|43.2%|Medium||
+|0212|Word Search II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0212.Word-Search-II)|37.0%|Hard||
+|0213|House Robber II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0213.House-Robber-II)|40.6%|Medium||
+|0214|Shortest Palindrome||32.2%|Hard||
+|0215|Kth Largest Element in an Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0215.Kth-Largest-Element-in-an-Array)|65.7%|Medium||
+|0216|Combination Sum III|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0216.Combination-Sum-III)|67.0%|Medium||
+|0217|Contains Duplicate|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0217.Contains-Duplicate)|61.2%|Easy||
+|0218|The Skyline Problem|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0218.The-Skyline-Problem)|41.5%|Hard||
+|0219|Contains Duplicate II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0219.Contains-Duplicate-II)|40.9%|Easy||
+|0220|Contains Duplicate III|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0220.Contains-Duplicate-III)|21.8%|Hard||
+|0221|Maximal Square||44.4%|Medium||
+|0222|Count Complete Tree Nodes|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0222.Count-Complete-Tree-Nodes)|57.4%|Medium||
+|0223|Rectangle Area|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0223.Rectangle-Area)|40.8%|Medium||
+|0224|Basic Calculator|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0224.Basic-Calculator)|41.1%|Hard||
+|0225|Implement Stack using Queues|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0225.Implement-Stack-using-Queues)|57.4%|Easy||
+|0226|Invert Binary Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0226.Invert-Binary-Tree)|73.1%|Easy||
+|0227|Basic Calculator II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0227.Basic-Calculator-II)|42.2%|Medium||
+|0228|Summary Ranges|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0228.Summary-Ranges)|46.8%|Easy||
+|0229|Majority Element II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0229.Majority-Element-II)|44.0%|Medium||
+|0230|Kth Smallest Element in a BST|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0230.Kth-Smallest-Element-in-a-BST)|69.2%|Medium||
+|0231|Power of Two|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0231.Power-of-Two)|45.6%|Easy||
+|0232|Implement Queue using Stacks|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0232.Implement-Queue-using-Stacks)|61.0%|Easy||
+|0233|Number of Digit One||34.2%|Hard||
+|0234|Palindrome Linked List|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0234.Palindrome-Linked-List)|49.4%|Easy||
+|0235|Lowest Common Ancestor of a Binary Search Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0235.Lowest-Common-Ancestor-of-a-Binary-Search-Tree)|60.1%|Medium||
+|0236|Lowest Common Ancestor of a Binary Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0236.Lowest-Common-Ancestor-of-a-Binary-Tree)|57.9%|Medium||
+|0237|Delete Node in a Linked List|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0237.Delete-Node-in-a-Linked-List)|75.1%|Medium||
+|0238|Product of Array Except Self||64.7%|Medium||
+|0239|Sliding Window Maximum|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0239.Sliding-Window-Maximum)|46.6%|Hard||
+|0240|Search a 2D Matrix II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0240.Search-a-2D-Matrix-II)|50.5%|Medium||
+|0241|Different Ways to Add Parentheses||63.1%|Medium||
+|0242|Valid Anagram|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0242.Valid-Anagram)|62.7%|Easy||
+|0243|Shortest Word Distance||64.9%|Easy||
+|0244|Shortest Word Distance II||60.7%|Medium||
+|0245|Shortest Word Distance III||57.5%|Medium||
+|0246|Strobogrammatic Number||47.6%|Easy||
+|0247|Strobogrammatic Number II||51.4%|Medium||
+|0248|Strobogrammatic Number III||41.7%|Hard||
+|0249|Group Shifted Strings||64.2%|Medium||
+|0250|Count Univalue Subtrees||55.2%|Medium||
+|0251|Flatten 2D Vector||48.9%|Medium||
+|0252|Meeting Rooms||57.0%|Easy||
+|0253|Meeting Rooms II||50.4%|Medium||
+|0254|Factor Combinations||48.8%|Medium||
+|0255|Verify Preorder Sequence in Binary Search Tree||48.0%|Medium||
+|0256|Paint House||60.5%|Medium||
+|0257|Binary Tree Paths|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0257.Binary-Tree-Paths)|60.5%|Easy||
+|0258|Add Digits|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0258.Add-Digits)|63.3%|Easy||
+|0259|3Sum Smaller||50.7%|Medium||
+|0260|Single Number III|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0260.Single-Number-III)|67.4%|Medium||
+|0261|Graph Valid Tree||46.8%|Medium||
+|0262|Trips and Users||38.4%|Hard||
+|0263|Ugly Number|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0263.Ugly-Number)|41.7%|Easy||
+|0264|Ugly Number II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0264.Ugly-Number-II)|46.1%|Medium||
+|0265|Paint House II||52.2%|Hard||
+|0266|Palindrome Permutation||65.8%|Easy||
+|0267|Palindrome Permutation II||40.4%|Medium||
+|0268|Missing Number|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0268.Missing-Number)|61.5%|Easy||
+|0269|Alien Dictionary||35.2%|Hard||
+|0270|Closest Binary Search Tree Value||54.5%|Easy||
+|0271|Encode and Decode Strings||41.3%|Medium||
+|0272|Closest Binary Search Tree Value II||58.2%|Hard||
+|0273|Integer to English Words||29.9%|Hard||
+|0274|H-Index|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0274.H-Index)|38.1%|Medium||
+|0275|H-Index II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0275.H-Index-II)|37.4%|Medium||
+|0276|Paint Fence||44.0%|Medium||
+|0277|Find the Celebrity||46.7%|Medium||
+|0278|First Bad Version|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0278.First-Bad-Version)|42.9%|Easy||
+|0279|Perfect Squares|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0279.Perfect-Squares)|52.2%|Medium||
+|0280|Wiggle Sort||66.3%|Medium||
+|0281|Zigzag Iterator||62.3%|Medium||
+|0282|Expression Add Operators||39.2%|Hard||
+|0283|Move Zeroes|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0283.Move-Zeroes)|61.3%|Easy||
+|0284|Peeking Iterator|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0284.Peeking-Iterator)|58.2%|Medium||
+|0285|Inorder Successor in BST||48.3%|Medium||
+|0286|Walls and Gates||60.2%|Medium||
+|0287|Find the Duplicate Number|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0287.Find-the-Duplicate-Number)|59.1%|Medium||
+|0288|Unique Word Abbreviation||25.2%|Medium||
+|0289|Game of Life||66.6%|Medium||
+|0290|Word Pattern|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0290.Word-Pattern)|40.4%|Easy||
+|0291|Word Pattern II||46.9%|Medium||
+|0292|Nim Game||55.8%|Easy||
+|0293|Flip Game||63.0%|Easy||
+|0294|Flip Game II||51.7%|Medium||
+|0295|Find Median from Data Stream||51.1%|Hard||
+|0296|Best Meeting Point||59.6%|Hard||
+|0297|Serialize and Deserialize Binary Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0297.Serialize-and-Deserialize-Binary-Tree)|54.9%|Hard||
+|0298|Binary Tree Longest Consecutive Sequence||52.5%|Medium||
+|0299|Bulls and Cows|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0299.Bulls-and-Cows)|48.5%|Medium||
+|0300|Longest Increasing Subsequence|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0300.Longest-Increasing-Subsequence)|51.5%|Medium||
+|0301|Remove Invalid Parentheses|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0301.Remove-Invalid-Parentheses)|47.1%|Hard||
+|0302|Smallest Rectangle Enclosing Black Pixels||58.2%|Hard||
+|0303|Range Sum Query - Immutable|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0303.Range-Sum-Query-Immutable)|57.9%|Easy||
+|0304|Range Sum Query 2D - Immutable|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0304.Range-Sum-Query-2D-Immutable)|52.1%|Medium||
+|0305|Number of Islands II||39.5%|Hard||
+|0306|Additive Number|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0306.Additive-Number)|30.9%|Medium||
+|0307|Range Sum Query - Mutable|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0307.Range-Sum-Query-Mutable)|40.7%|Medium||
+|0308|Range Sum Query 2D - Mutable||42.2%|Hard||
+|0309|Best Time to Buy and Sell Stock with Cooldown|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0309.Best-Time-to-Buy-and-Sell-Stock-with-Cooldown)|54.4%|Medium||
+|0310|Minimum Height Trees||38.5%|Medium||
+|0311|Sparse Matrix Multiplication||67.1%|Medium||
+|0312|Burst Balloons||56.9%|Hard||
+|0313|Super Ugly Number||45.8%|Medium||
+|0314|Binary Tree Vertical Order Traversal||52.0%|Medium||
+|0315|Count of Smaller Numbers After Self|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0315.Count-of-Smaller-Numbers-After-Self)|42.8%|Hard||
+|0316|Remove Duplicate Letters||44.5%|Medium||
+|0317|Shortest Distance from All Buildings||43.0%|Hard||
+|0318|Maximum Product of Word Lengths|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0318.Maximum-Product-of-Word-Lengths)|60.1%|Medium||
+|0319|Bulb Switcher|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0319.Bulb-Switcher)|48.0%|Medium||
+|0320|Generalized Abbreviation||57.3%|Medium||
+|0321|Create Maximum Number||28.8%|Hard||
+|0322|Coin Change|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0322.Coin-Change)|41.5%|Medium||
+|0323|Number of Connected Components in an Undirected Graph||62.0%|Medium||
+|0324|Wiggle Sort II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0324.Wiggle-Sort-II)|32.9%|Medium||
+|0325|Maximum Size Subarray Sum Equals k||49.3%|Medium||
+|0326|Power of Three|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0326.Power-of-Three)|45.2%|Easy||
+|0327|Count of Range Sum|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0327.Count-of-Range-Sum)|36.0%|Hard||
+|0328|Odd Even Linked List|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0328.Odd-Even-Linked-List)|60.2%|Medium||
+|0329|Longest Increasing Path in a Matrix|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0329.Longest-Increasing-Path-in-a-Matrix)|52.1%|Hard||
+|0330|Patching Array||40.0%|Hard||
+|0331|Verify Preorder Serialization of a Binary Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0331.Verify-Preorder-Serialization-of-a-Binary-Tree)|44.2%|Medium||
+|0332|Reconstruct Itinerary||40.9%|Hard||
+|0333|Largest BST Subtree||42.3%|Medium||
+|0334|Increasing Triplet Subsequence||42.7%|Medium||
+|0335|Self Crossing||29.3%|Hard||
+|0336|Palindrome Pairs||35.2%|Hard||
+|0337|House Robber III|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0337.House-Robber-III)|53.8%|Medium||
+|0338|Counting Bits|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0338.Counting-Bits)|75.2%|Easy||
+|0339|Nested List Weight Sum||82.0%|Medium||
+|0340|Longest Substring with At Most K Distinct Characters||47.8%|Medium||
+|0341|Flatten Nested List Iterator|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0341.Flatten-Nested-List-Iterator)|61.5%|Medium||
+|0342|Power of Four|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0342.Power-of-Four)|45.6%|Easy||
+|0343|Integer Break|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0343.Integer-Break)|55.3%|Medium||
+|0344|Reverse String|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0344.Reverse-String)|76.1%|Easy||
+|0345|Reverse Vowels of a String|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0345.Reverse-Vowels-of-a-String)|47.7%|Easy||
+|0346|Moving Average from Data Stream||77.0%|Easy||
+|0347|Top K Frequent Elements|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0347.Top-K-Frequent-Elements)|64.8%|Medium||
+|0348|Design Tic-Tac-Toe||57.6%|Medium||
+|0349|Intersection of Two Arrays|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0349.Intersection-of-Two-Arrays)|70.2%|Easy||
+|0350|Intersection of Two Arrays II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0350.Intersection-of-Two-Arrays-II)|55.5%|Easy||
+|0351|Android Unlock Patterns||51.3%|Medium||
+|0352|Data Stream as Disjoint Intervals|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0352.Data-Stream-as-Disjoint-Intervals)|51.5%|Hard||
+|0353|Design Snake Game||39.0%|Medium||
+|0354|Russian Doll Envelopes|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0354.Russian-Doll-Envelopes)|38.3%|Hard||
+|0355|Design Twitter||36.5%|Medium||
+|0356|Line Reflection||34.6%|Medium||
+|0357|Count Numbers with Unique Digits|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0357.Count-Numbers-with-Unique-Digits)|51.5%|Medium||
+|0358|Rearrange String k Distance Apart||37.5%|Hard||
+|0359|Logger Rate Limiter||75.5%|Easy||
+|0360|Sort Transformed Array||54.6%|Medium||
+|0361|Bomb Enemy||50.9%|Medium||
+|0362|Design Hit Counter||68.3%|Medium||
+|0363|Max Sum of Rectangle No Larger Than K||44.1%|Hard||
+|0364|Nested List Weight Sum II||67.3%|Medium||
+|0365|Water and Jug Problem||36.5%|Medium||
+|0366|Find Leaves of Binary Tree||80.1%|Medium||
+|0367|Valid Perfect Square|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0367.Valid-Perfect-Square)|43.3%|Easy||
+|0368|Largest Divisible Subset|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0368.Largest-Divisible-Subset)|41.2%|Medium||
+|0369|Plus One Linked List||60.9%|Medium||
+|0370|Range Addition||70.8%|Medium||
+|0371|Sum of Two Integers|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0371.Sum-of-Two-Integers)|50.7%|Medium||
+|0372|Super Pow|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0372.Super-Pow)|37.2%|Medium||
+|0373|Find K Pairs with Smallest Sums|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0373.Find-K-Pairs-with-Smallest-Sums)|38.4%|Medium||
+|0374|Guess Number Higher or Lower|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0374.Guess-Number-Higher-or-Lower)|50.4%|Easy||
+|0375|Guess Number Higher or Lower II||46.3%|Medium||
+|0376|Wiggle Subsequence|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0376.Wiggle-Subsequence)|48.2%|Medium||
+|0377|Combination Sum IV|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0377.Combination-Sum-IV)|52.1%|Medium||
+|0378|Kth Smallest Element in a Sorted Matrix|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0378.Kth-Smallest-Element-in-a-Sorted-Matrix)|61.6%|Medium||
+|0379|Design Phone Directory||50.9%|Medium||
+|0380|Insert Delete GetRandom O(1)||52.0%|Medium||
+|0381|Insert Delete GetRandom O(1) - Duplicates allowed||35.7%|Hard||
+|0382|Linked List Random Node|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0382.Linked-List-Random-Node)|59.5%|Medium||
+|0383|Ransom Note|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0383.Ransom-Note)|57.6%|Easy||
+|0384|Shuffle an Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0384.Shuffle-an-Array)|57.6%|Medium||
+|0385|Mini Parser|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0385.Mini-Parser)|36.5%|Medium||
+|0386|Lexicographical Numbers|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0386.Lexicographical-Numbers)|60.5%|Medium||
+|0387|First Unique Character in a String|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0387.First-Unique-Character-in-a-String)|58.8%|Easy||
+|0388|Longest Absolute File Path||46.5%|Medium||
+|0389|Find the Difference|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0389.Find-the-Difference)|60.4%|Easy||
+|0390|Elimination Game|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0390.Elimination-Game)|46.6%|Medium||
+|0391|Perfect Rectangle|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0391.Perfect-Rectangle)|32.5%|Hard||
+|0392|Is Subsequence|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0392.Is-Subsequence)|49.3%|Easy||
+|0393|UTF-8 Validation|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0393.UTF-8-Validation)|45.2%|Medium||
+|0394|Decode String|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0394.Decode-String)|57.5%|Medium||
+|0395|Longest Substring with At Least K Repeating Characters|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0395.Longest-Substring-with-At-Least-K-Repeating-Characters)|44.8%|Medium||
+|0396|Rotate Function|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0396.Rotate-Function)|40.3%|Medium||
+|0397|Integer Replacement|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0397.Integer-Replacement)|35.1%|Medium||
+|0398|Random Pick Index||62.9%|Medium||
+|0399|Evaluate Division|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0399.Evaluate-Division)|59.5%|Medium||
+|0400|Nth Digit|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0400.Nth-Digit)|34.0%|Medium||
+|0401|Binary Watch|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0401.Binary-Watch)|51.4%|Easy||
+|0402|Remove K Digits|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0402.Remove-K-Digits)|30.5%|Medium||
+|0403|Frog Jump||43.1%|Hard||
+|0404|Sum of Left Leaves|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0404.Sum-of-Left-Leaves)|56.2%|Easy||
+|0405|Convert a Number to Hexadecimal|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0405.Convert-a-Number-to-Hexadecimal)|46.1%|Easy||
+|0406|Queue Reconstruction by Height||72.8%|Medium||
+|0407|Trapping Rain Water II||47.4%|Hard||
+|0408|Valid Word Abbreviation||34.8%|Easy||
+|0409|Longest Palindrome|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0409.Longest-Palindrome)|54.6%|Easy||
+|0410|Split Array Largest Sum|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0410.Split-Array-Largest-Sum)|53.2%|Hard||
+|0411|Minimum Unique Word Abbreviation||39.2%|Hard||
+|0412|Fizz Buzz|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0412.Fizz-Buzz)|68.6%|Easy||
+|0413|Arithmetic Slices|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0413.Arithmetic-Slices)|65.0%|Medium||
+|0414|Third Maximum Number|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0414.Third-Maximum-Number)|32.5%|Easy||
+|0415|Add Strings||52.6%|Easy||
+|0416|Partition Equal Subset Sum|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0416.Partition-Equal-Subset-Sum)|46.7%|Medium||
+|0417|Pacific Atlantic Water Flow|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0417.Pacific-Atlantic-Water-Flow)|53.9%|Medium||
+|0418|Sentence Screen Fitting||35.6%|Medium||
+|0419|Battleships in a Board|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0419.Battleships-in-a-Board)|74.6%|Medium||
+|0420|Strong Password Checker||14.3%|Hard||
+|0421|Maximum XOR of Two Numbers in an Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0421.Maximum-XOR-of-Two-Numbers-in-an-Array)|54.6%|Medium||
+|0422|Valid Word Square||38.8%|Easy||
+|0423|Reconstruct Original Digits from English|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0423.Reconstruct-Original-Digits-from-English)|51.3%|Medium||
+|0424|Longest Repeating Character Replacement|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0424.Longest-Repeating-Character-Replacement)|51.4%|Medium||
+|0425|Word Squares||52.6%|Hard||
+|0426|Convert Binary Search Tree to Sorted Doubly Linked List||64.6%|Medium||
+|0427|Construct Quad Tree||66.3%|Medium||
+|0428|Serialize and Deserialize N-ary Tree||65.3%|Hard||
+|0429|N-ary Tree Level Order Traversal|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0429.N-ary-Tree-Level-Order-Traversal)|70.6%|Medium||
+|0430|Flatten a Multilevel Doubly Linked List||59.4%|Medium||
+|0431|Encode N-ary Tree to Binary Tree||78.6%|Hard||
+|0432|All O`one Data Structure||36.6%|Hard||
+|0433|Minimum Genetic Mutation|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0433.Minimum-Genetic-Mutation)|48.1%|Medium||
+|0434|Number of Segments in a String|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0434.Number-of-Segments-in-a-String)|37.7%|Easy||
+|0435|Non-overlapping Intervals|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0435.Non-overlapping-Intervals)|49.8%|Medium||
+|0436|Find Right Interval|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0436.Find-Right-Interval)|50.3%|Medium||
+|0437|Path Sum III|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0437.Path-Sum-III)|48.8%|Medium||
+|0438|Find All Anagrams in a String|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0438.Find-All-Anagrams-in-a-String)|48.9%|Medium||
+|0439|Ternary Expression Parser||58.2%|Medium||
+|0440|K-th Smallest in Lexicographical Order||30.7%|Hard||
+|0441|Arranging Coins|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0441.Arranging-Coins)|46.0%|Easy||
+|0442|Find All Duplicates in an Array||73.3%|Medium||
+|0443|String Compression||48.7%|Medium||
+|0444|Sequence Reconstruction||26.3%|Medium||
+|0445|Add Two Numbers II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0445.Add-Two-Numbers-II)|59.4%|Medium||
+|0446|Arithmetic Slices II - Subsequence||39.8%|Hard||
+|0447|Number of Boomerangs|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0447.Number-of-Boomerangs)|54.6%|Medium||
+|0448|Find All Numbers Disappeared in an Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0448.Find-All-Numbers-Disappeared-in-an-Array)|59.6%|Easy||
+|0449|Serialize and Deserialize BST||56.7%|Medium||
+|0450|Delete Node in a BST||49.9%|Medium||
+|0451|Sort Characters By Frequency|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0451.Sort-Characters-By-Frequency)|68.5%|Medium||
+|0452|Minimum Number of Arrows to Burst Balloons||53.2%|Medium||
+|0453|Minimum Moves to Equal Array Elements|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0453.Minimum-Moves-to-Equal-Array-Elements)|55.6%|Medium||
+|0454|4Sum II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0454.4Sum-II)|57.3%|Medium||
+|0455|Assign Cookies|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0455.Assign-Cookies)|50.6%|Easy||
+|0456|132 Pattern|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0456.132-Pattern)|32.4%|Medium||
+|0457|Circular Array Loop|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0457.Circular-Array-Loop)|32.1%|Medium||
+|0458|Poor Pigs|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0458.Poor-Pigs)|65.0%|Hard||
+|0459|Repeated Substring Pattern||43.7%|Easy||
+|0460|LFU Cache|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0460.LFU-Cache)|40.3%|Hard||
+|0461|Hamming Distance|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0461.Hamming-Distance)|74.8%|Easy||
+|0462|Minimum Moves to Equal Array Elements II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0462.Minimum-Moves-to-Equal-Array-Elements-II)|60.1%|Medium||
+|0463|Island Perimeter|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0463.Island-Perimeter)|69.4%|Easy||
+|0464|Can I Win||29.8%|Medium||
+|0465|Optimal Account Balancing||49.3%|Hard||
+|0466|Count The Repetitions||29.2%|Hard||
+|0467|Unique Substrings in Wraparound String||38.2%|Medium||
+|0468|Validate IP Address||26.5%|Medium||
+|0469|Convex Polygon||38.5%|Medium||
+|0470|Implement Rand10() Using Rand7()|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0470.Implement-Rand10-Using-Rand7)|46.7%|Medium||
+|0471|Encode String with Shortest Length||50.7%|Hard||
+|0472|Concatenated Words||45.5%|Hard||
+|0473|Matchsticks to Square|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0473.Matchsticks-to-Square)|40.5%|Medium||
+|0474|Ones and Zeroes|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0474.Ones-and-Zeroes)|46.7%|Medium||
+|0475|Heaters|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0475.Heaters)|36.0%|Medium||
+|0476|Number Complement|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0476.Number-Complement)|67.1%|Easy||
+|0477|Total Hamming Distance|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0477.Total-Hamming-Distance)|52.2%|Medium||
+|0478|Generate Random Point in a Circle|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0478.Generate-Random-Point-in-a-Circle)|39.6%|Medium||
+|0479|Largest Palindrome Product||31.6%|Hard||
+|0480|Sliding Window Median|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0480.Sliding-Window-Median)|41.4%|Hard||
+|0481|Magical String||50.4%|Medium||
+|0482|License Key Formatting||43.2%|Easy||
+|0483|Smallest Good Base|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0483.Smallest-Good-Base)|38.4%|Hard||
+|0484|Find Permutation||67.0%|Medium||
+|0485|Max Consecutive Ones|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0485.Max-Consecutive-Ones)|56.0%|Easy||
+|0486|Predict the Winner||50.8%|Medium||
+|0487|Max Consecutive Ones II||49.2%|Medium||
+|0488|Zuma Game|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0488.Zuma-Game)|34.9%|Hard||
+|0489|Robot Room Cleaner||76.5%|Hard||
+|0490|The Maze||55.4%|Medium||
+|0491|Increasing Subsequences|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0491.Increasing-Subsequences)|52.0%|Medium||
+|0492|Construct the Rectangle|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0492.Construct-the-Rectangle)|53.6%|Easy||
+|0493|Reverse Pairs|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0493.Reverse-Pairs)|30.8%|Hard||
+|0494|Target Sum|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0494.Target-Sum)|45.6%|Medium||
+|0495|Teemo Attacking|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0495.Teemo-Attacking)|57.0%|Easy||
+|0496|Next Greater Element I|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0496.Next-Greater-Element-I)|71.3%|Easy||
+|0497|Random Point in Non-overlapping Rectangles|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0497.Random-Point-in-Non-overlapping-Rectangles)|39.3%|Medium||
+|0498|Diagonal Traverse|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0498.Diagonal-Traverse)|58.0%|Medium||
+|0499|The Maze III||46.9%|Hard||
+|0500|Keyboard Row|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0500.Keyboard-Row)|69.0%|Easy||
+|0501|Find Mode in Binary Search Tree||48.5%|Easy||
+|0502|IPO||44.9%|Hard||
+|0503|Next Greater Element II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0503.Next-Greater-Element-II)|63.0%|Medium||
+|0504|Base 7|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0504.Base-7)|47.9%|Easy||
+|0505|The Maze II||52.4%|Medium||
+|0506|Relative Ranks|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0506.Relative-Ranks)|58.8%|Easy||
+|0507|Perfect Number|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0507.Perfect-Number)|37.7%|Easy||
+|0508|Most Frequent Subtree Sum|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0508.Most-Frequent-Subtree-Sum)|64.2%|Medium||
+|0509|Fibonacci Number|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0509.Fibonacci-Number)|69.2%|Easy||
+|0510|Inorder Successor in BST II||61.1%|Medium||
+|0511|Game Play Analysis I||78.8%|Easy||
+|0512|Game Play Analysis II||54.1%|Easy||
+|0513|Find Bottom Left Tree Value|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0513.Find-Bottom-Left-Tree-Value)|66.3%|Medium||
+|0514|Freedom Trail||46.8%|Hard||
+|0515|Find Largest Value in Each Tree Row|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0515.Find-Largest-Value-in-Each-Tree-Row)|64.6%|Medium||
+|0516|Longest Palindromic Subsequence||60.6%|Medium||
+|0517|Super Washing Machines||39.7%|Hard||
+|0518|Coin Change II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0518.Coin-Change-II)|59.7%|Medium||
+|0519|Random Flip Matrix|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0519.Random-Flip-Matrix)|39.6%|Medium||
+|0520|Detect Capital|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0520.Detect-Capital)|55.6%|Easy||
+|0521|Longest Uncommon Subsequence I||60.3%|Easy||
+|0522|Longest Uncommon Subsequence II||40.4%|Medium||
+|0523|Continuous Subarray Sum|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0523.Continuous-Subarray-Sum)|27.7%|Medium||
+|0524|Longest Word in Dictionary through Deleting|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0524.Longest-Word-in-Dictionary-through-Deleting)|51.2%|Medium||
+|0525|Contiguous Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0525.Contiguous-Array)|46.8%|Medium||
+|0526|Beautiful Arrangement|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0526.Beautiful-Arrangement)|64.6%|Medium||
+|0527|Word Abbreviation||60.3%|Hard||
+|0528|Random Pick with Weight|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0528.Random-Pick-with-Weight)|46.1%|Medium||
+|0529|Minesweeper|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0529.Minesweeper)|65.5%|Medium||
+|0530|Minimum Absolute Difference in BST|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0530.Minimum-Absolute-Difference-in-BST)|56.7%|Easy||
+|0531|Lonely Pixel I||62.0%|Medium||
+|0532|K-diff Pairs in an Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0532.K-diff-Pairs-in-an-Array)|40.7%|Medium||
+|0533|Lonely Pixel II||48.4%|Medium||
+|0534|Game Play Analysis III||82.5%|Medium||
+|0535|Encode and Decode TinyURL|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0535.Encode-and-Decode-TinyURL)|85.7%|Medium||
+|0536|Construct Binary Tree from String||56.1%|Medium||
+|0537|Complex Number Multiplication|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0537.Complex-Number-Multiplication)|71.3%|Medium||
+|0538|Convert BST to Greater Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0538.Convert-BST-to-Greater-Tree)|67.3%|Medium||
+|0539|Minimum Time Difference||56.3%|Medium||
+|0540|Single Element in a Sorted Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0540.Single-Element-in-a-Sorted-Array)|58.5%|Medium||
+|0541|Reverse String II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0541.Reverse-String-II)|50.5%|Easy||
+|0542|01 Matrix|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0542.01-Matrix)|44.1%|Medium||
+|0543|Diameter of Binary Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0543.Diameter-of-Binary-Tree)|55.9%|Easy||
+|0544|Output Contest Matches||76.7%|Medium||
+|0545|Boundary of Binary Tree||44.2%|Medium||
+|0546|Remove Boxes||47.6%|Hard||
+|0547|Number of Provinces|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0547.Number-of-Provinces)|63.2%|Medium||
+|0548|Split Array with Equal Sum||50.1%|Hard||
+|0549|Binary Tree Longest Consecutive Sequence II||49.5%|Medium||
+|0550|Game Play Analysis IV||44.1%|Medium||
+|0551|Student Attendance Record I|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0551.Student-Attendance-Record-I)|48.0%|Easy||
+|0552|Student Attendance Record II||41.1%|Hard||
+|0553|Optimal Division||59.7%|Medium||
+|0554|Brick Wall|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0554.Brick-Wall)|53.1%|Medium||
+|0555|Split Concatenated Strings||43.5%|Medium||
+|0556|Next Greater Element III||34.1%|Medium||
+|0557|Reverse Words in a String III|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0557.Reverse-Words-in-a-String-III)|81.5%|Easy||
+|0558|Logical OR of Two Binary Grids Represented as Quad-Trees||48.2%|Medium||
+|0559|Maximum Depth of N-ary Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0559.Maximum-Depth-of-N-ary-Tree)|71.6%|Easy||
+|0560|Subarray Sum Equals K|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0560.Subarray-Sum-Equals-K)|44.0%|Medium||
+|0561|Array Partition|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0561.Array-Partition)|76.5%|Easy||
+|0562|Longest Line of Consecutive One in Matrix||50.0%|Medium||
+|0563|Binary Tree Tilt|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0563.Binary-Tree-Tilt)|59.3%|Easy||
+|0564|Find the Closest Palindrome||21.9%|Hard||
+|0565|Array Nesting||56.5%|Medium||
+|0566|Reshape the Matrix|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0566.Reshape-the-Matrix)|62.7%|Easy||
+|0567|Permutation in String|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0567.Permutation-in-String)|43.8%|Medium||
+|0568|Maximum Vacation Days||44.8%|Hard||
+|0569|Median Employee Salary||68.3%|Hard||
+|0570|Managers with at Least 5 Direct Reports||67.1%|Medium||
+|0571|Find Median Given Frequency of Numbers||44.7%|Hard||
+|0572|Subtree of Another Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0572.Subtree-of-Another-Tree)|45.9%|Easy||
+|0573|Squirrel Simulation||55.0%|Medium||
+|0574|Winning Candidate||59.7%|Medium||
+|0575|Distribute Candies|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0575.Distribute-Candies)|66.1%|Easy||
+|0576|Out of Boundary Paths|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0576.Out-of-Boundary-Paths)|44.3%|Medium||
+|0577|Employee Bonus||75.3%|Easy||
+|0578|Get Highest Answer Rate Question||41.7%|Medium||
+|0579|Find Cumulative Salary of an Employee||45.0%|Hard||
+|0580|Count Student Number in Departments||58.2%|Medium||
+|0581|Shortest Unsorted Continuous Subarray|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0581.Shortest-Unsorted-Continuous-Subarray)|36.2%|Medium||
+|0582|Kill Process||68.4%|Medium||
+|0583|Delete Operation for Two Strings|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0583.Delete-Operation-for-Two-Strings)|59.2%|Medium||
+|0584|Find Customer Referee||76.0%|Easy||
+|0585|Investments in 2016||53.5%|Medium||
+|0586|Customer Placing the Largest Number of Orders||72.5%|Easy||
+|0587|Erect the Fence||43.2%|Hard||
+|0588|Design In-Memory File System||48.8%|Hard||
+|0589|N-ary Tree Preorder Traversal|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0589.N-ary-Tree-Preorder-Traversal)|76.3%|Easy||
+|0590|N-ary Tree Postorder Traversal||77.1%|Easy||
+|0591|Tag Validator||37.0%|Hard||
+|0592|Fraction Addition and Subtraction||52.1%|Medium||
+|0593|Valid Square||44.1%|Medium||
+|0594|Longest Harmonious Subsequence|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0594.Longest-Harmonious-Subsequence)|53.1%|Easy||
+|0595|Big Countries||73.8%|Easy||
+|0596|Classes More Than 5 Students||46.5%|Easy||
+|0597|Friend Requests I: Overall Acceptance Rate||42.9%|Easy||
+|0598|Range Addition II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0598.Range-Addition-II)|55.0%|Easy||
+|0599|Minimum Index Sum of Two Lists|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0599.Minimum-Index-Sum-of-Two-Lists)|52.7%|Easy||
+|0600|Non-negative Integers without Consecutive Ones||39.0%|Hard||
+|0601|Human Traffic of Stadium||50.6%|Hard||
+|0602|Friend Requests II: Who Has the Most Friends||61.3%|Medium||
+|0603|Consecutive Available Seats||68.2%|Easy||
+|0604|Design Compressed String Iterator||39.4%|Easy||
+|0605|Can Place Flowers|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0605.Can-Place-Flowers)|33.0%|Easy||
+|0606|Construct String from Binary Tree||63.5%|Easy||
+|0607|Sales Person||72.1%|Easy||
+|0608|Tree Node||74.9%|Medium||
+|0609|Find Duplicate File in System|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0609.Find-Duplicate-File-in-System)|67.8%|Medium||
+|0610|Triangle Judgement||71.1%|Easy||
+|0611|Valid Triangle Number|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0611.Valid-Triangle-Number)|50.3%|Medium||
+|0612|Shortest Distance in a Plane||63.5%|Medium||
+|0613|Shortest Distance in a Line||81.5%|Easy||
+|0614|Second Degree Follower||36.9%|Medium||
+|0615|Average Salary: Departments VS Company||57.3%|Hard||
+|0616|Add Bold Tag in String||48.6%|Medium||
+|0617|Merge Two Binary Trees|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0617.Merge-Two-Binary-Trees)|78.5%|Easy||
+|0618|Students Report By Geography||64.2%|Hard||
+|0619|Biggest Single Number||48.7%|Easy||
+|0620|Not Boring Movies||73.3%|Easy||
+|0621|Task Scheduler||55.6%|Medium||
+|0622|Design Circular Queue|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0622.Design-Circular-Queue)|51.8%|Medium||
+|0623|Add One Row to Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0623.Add-One-Row-to-Tree)|59.4%|Medium||
+|0624|Maximum Distance in Arrays||41.7%|Medium||
+|0625|Minimum Factorization||33.4%|Medium||
+|0626|Exchange Seats||70.6%|Medium||
+|0627|Swap Salary||82.8%|Easy||
+|0628|Maximum Product of Three Numbers|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0628.Maximum-Product-of-Three-Numbers)|46.4%|Easy||
+|0629|K Inverse Pairs Array||43.0%|Hard||
+|0630|Course Schedule III|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0630.Course-Schedule-III)|40.2%|Hard||
+|0631|Design Excel Sum Formula||43.3%|Hard||
+|0632|Smallest Range Covering Elements from K Lists|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0632.Smallest-Range-Covering-Elements-from-K-Lists)|60.4%|Hard||
+|0633|Sum of Square Numbers|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0633.Sum-of-Square-Numbers)|34.7%|Medium||
+|0634|Find the Derangement of An Array||41.8%|Medium||
+|0635|Design Log Storage System||62.7%|Medium||
+|0636|Exclusive Time of Functions|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0636.Exclusive-Time-of-Functions)|61.0%|Medium||
+|0637|Average of Levels in Binary Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0637.Average-of-Levels-in-Binary-Tree)|71.6%|Easy||
+|0638|Shopping Offers|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0638.Shopping-Offers)|54.3%|Medium||
+|0639|Decode Ways II||30.4%|Hard||
+|0640|Solve the Equation||43.3%|Medium||
+|0641|Design Circular Deque||57.6%|Medium||
+|0642|Design Search Autocomplete System||48.7%|Hard||
+|0643|Maximum Average Subarray I|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0643.Maximum-Average-Subarray-I)|43.8%|Easy||
+|0644|Maximum Average Subarray II||35.7%|Hard||
+|0645|Set Mismatch|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0645.Set-Mismatch)|41.4%|Easy||
+|0646|Maximum Length of Pair Chain||56.4%|Medium||
+|0647|Palindromic Substrings|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0647.Palindromic-Substrings)|66.3%|Medium||
+|0648|Replace Words|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0648.Replace-Words)|62.7%|Medium||
+|0649|Dota2 Senate||40.4%|Medium||
+|0650|2 Keys Keyboard||53.1%|Medium||
+|0651|4 Keys Keyboard||54.5%|Medium||
+|0652|Find Duplicate Subtrees||56.5%|Medium||
+|0653|Two Sum IV - Input is a BST|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0653.Two-Sum-IV-Input-is-a-BST)|60.9%|Easy||
+|0654|Maximum Binary Tree||84.4%|Medium||
+|0655|Print Binary Tree||61.3%|Medium||
+|0656|Coin Path||31.6%|Hard||
+|0657|Robot Return to Origin||75.3%|Easy||
+|0658|Find K Closest Elements|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0658.Find-K-Closest-Elements)|46.7%|Medium||
+|0659|Split Array into Consecutive Subsequences||50.6%|Medium||
+|0660|Remove 9||56.8%|Hard||
+|0661|Image Smoother|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0661.Image-Smoother)|55.0%|Easy||
+|0662|Maximum Width of Binary Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0662.Maximum-Width-of-Binary-Tree)|40.6%|Medium||
+|0663|Equal Tree Partition||41.4%|Medium||
+|0664|Strange Printer||46.8%|Hard||
+|0665|Non-decreasing Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0665.Non-decreasing-Array)|24.1%|Medium||
+|0666|Path Sum IV||59.1%|Medium||
+|0667|Beautiful Arrangement II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0667.Beautiful-Arrangement-II)|59.7%|Medium||
+|0668|Kth Smallest Number in Multiplication Table|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0668.Kth-Smallest-Number-in-Multiplication-Table)|51.5%|Hard||
+|0669|Trim a Binary Search Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0669.Trim-a-Binary-Search-Tree)|66.3%|Medium||
+|0670|Maximum Swap||47.8%|Medium||
+|0671|Second Minimum Node In a Binary Tree||44.0%|Easy||
+|0672|Bulb Switcher II||50.9%|Medium||
+|0673|Number of Longest Increasing Subsequence||42.1%|Medium||
+|0674|Longest Continuous Increasing Subsequence|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0674.Longest-Continuous-Increasing-Subsequence)|49.0%|Easy||
+|0675|Cut Off Trees for Golf Event||34.3%|Hard||
+|0676|Implement Magic Dictionary|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0676.Implement-Magic-Dictionary)|56.9%|Medium||
+|0677|Map Sum Pairs|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0677.Map-Sum-Pairs)|57.0%|Medium||
+|0678|Valid Parenthesis String||33.9%|Medium||
+|0679|24 Game||49.1%|Hard||
+|0680|Valid Palindrome II||39.3%|Easy||
+|0681|Next Closest Time||46.4%|Medium||
+|0682|Baseball Game|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0682.Baseball-Game)|73.6%|Easy||
+|0683|K Empty Slots||36.9%|Hard||
+|0684|Redundant Connection|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0684.Redundant-Connection)|62.0%|Medium||
+|0685|Redundant Connection II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0685.Redundant-Connection-II)|34.1%|Hard||
+|0686|Repeated String Match||34.0%|Medium||
+|0687|Longest Univalue Path||40.1%|Medium||
+|0688|Knight Probability in Chessboard||52.0%|Medium||
+|0689|Maximum Sum of 3 Non-Overlapping Subarrays||48.8%|Hard||
+|0690|Employee Importance|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0690.Employee-Importance)|65.1%|Medium||
+|0691|Stickers to Spell Word||46.3%|Hard||
+|0692|Top K Frequent Words|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0692.Top-K-Frequent-Words)|55.2%|Medium||
+|0693|Binary Number with Alternating Bits|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0693.Binary-Number-with-Alternating-Bits)|61.2%|Easy||
+|0694|Number of Distinct Islands||60.6%|Medium||
+|0695|Max Area of Island|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0695.Max-Area-of-Island)|71.6%|Medium||
+|0696|Count Binary Substrings|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0696.Count-Binary-Substrings)|65.5%|Easy||
+|0697|Degree of an Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0697.Degree-of-an-Array)|55.8%|Easy||
+|0698|Partition to K Equal Sum Subsets||41.1%|Medium||
+|0699|Falling Squares|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0699.Falling-Squares)|44.4%|Hard||
+|0700|Search in a Binary Search Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0700.Search-in-a-Binary-Search-Tree)|77.1%|Easy||
+|0701|Insert into a Binary Search Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0701.Insert-into-a-Binary-Search-Tree)|74.6%|Medium||
+|0702|Search in a Sorted Array of Unknown Size||71.4%|Medium||
+|0703|Kth Largest Element in a Stream|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0703.Kth-Largest-Element-in-a-Stream)|55.5%|Easy||
+|0704|Binary Search|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0704.Binary-Search)|55.1%|Easy||
+|0705|Design HashSet|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0705.Design-HashSet)|66.0%|Easy||
+|0706|Design HashMap|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0706.Design-HashMap)|65.1%|Easy||
+|0707|Design Linked List|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0707.Design-Linked-List)|27.5%|Medium||
+|0708|Insert into a Sorted Circular Linked List||34.5%|Medium||
+|0709|To Lower Case|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0709.To-Lower-Case)|81.9%|Easy||
+|0710|Random Pick with Blacklist|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0710.Random-Pick-with-Blacklist)|33.6%|Hard||
+|0711|Number of Distinct Islands II||51.8%|Hard||
+|0712|Minimum ASCII Delete Sum for Two Strings||62.2%|Medium||
+|0713|Subarray Product Less Than K|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0713.Subarray-Product-Less-Than-K)|45.0%|Medium||
+|0714|Best Time to Buy and Sell Stock with Transaction Fee|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0714.Best-Time-to-Buy-and-Sell-Stock-with-Transaction-Fee)|64.2%|Medium||
+|0715|Range Module|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0715.Range-Module)|44.6%|Hard||
+|0716|Max Stack||45.3%|Hard||
+|0717|1-bit and 2-bit Characters|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0717.1-bit-and-2-bit-Characters)|46.0%|Easy||
+|0718|Maximum Length of Repeated Subarray|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0718.Maximum-Length-of-Repeated-Subarray)|51.6%|Medium||
+|0719|Find K-th Smallest Pair Distance|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0719.Find-K-th-Smallest-Pair-Distance)|36.3%|Hard||
+|0720|Longest Word in Dictionary|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0720.Longest-Word-in-Dictionary)|51.8%|Medium||
+|0721|Accounts Merge|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0721.Accounts-Merge)|56.3%|Medium||
+|0722|Remove Comments||38.0%|Medium||
+|0723|Candy Crush||76.3%|Medium||
+|0724|Find Pivot Index|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0724.Find-Pivot-Index)|53.3%|Easy||
+|0725|Split Linked List in Parts|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0725.Split-Linked-List-in-Parts)|57.2%|Medium||
+|0726|Number of Atoms|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0726.Number-of-Atoms)|52.2%|Hard||
+|0727|Minimum Window Subsequence||42.8%|Hard||
+|0728|Self Dividing Numbers|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0728.Self-Dividing-Numbers)|77.5%|Easy||
+|0729|My Calendar I|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0729.My-Calendar-I)|57.2%|Medium||
+|0730|Count Different Palindromic Subsequences||44.4%|Hard||
+|0731|My Calendar II||54.7%|Medium||
+|0732|My Calendar III|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0732.My-Calendar-III)|71.6%|Hard||
+|0733|Flood Fill|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0733.Flood-Fill)|60.3%|Easy||
+|0734|Sentence Similarity||43.1%|Easy||
+|0735|Asteroid Collision|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0735.Asteroid-Collision)|44.4%|Medium||
+|0736|Parse Lisp Expression||51.6%|Hard||
+|0737|Sentence Similarity II||48.7%|Medium||
+|0738|Monotone Increasing Digits||47.0%|Medium||
+|0739|Daily Temperatures|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0739.Daily-Temperatures)|66.5%|Medium||
+|0740|Delete and Earn||57.4%|Medium||
+|0741|Cherry Pickup||36.3%|Hard||
+|0742|Closest Leaf in a Binary Tree||45.8%|Medium||
+|0743|Network Delay Time||51.4%|Medium||
+|0744|Find Smallest Letter Greater Than Target|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0744.Find-Smallest-Letter-Greater-Than-Target)|44.6%|Easy||
+|0745|Prefix and Suffix Search|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0745.Prefix-and-Suffix-Search)|41.3%|Hard||
+|0746|Min Cost Climbing Stairs|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0746.Min-Cost-Climbing-Stairs)|62.3%|Easy||
+|0747|Largest Number At Least Twice of Others|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0747.Largest-Number-At-Least-Twice-of-Others)|46.3%|Easy||
+|0748|Shortest Completing Word|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0748.Shortest-Completing-Word)|59.1%|Easy||
+|0749|Contain Virus||50.8%|Hard||
+|0750|Number Of Corner Rectangles||67.5%|Medium||
+|0751|IP to CIDR||54.7%|Medium||
+|0752|Open the Lock|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0752.Open-the-Lock)|55.5%|Medium||
+|0753|Cracking the Safe|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0753.Cracking-the-Safe)|55.4%|Hard||
+|0754|Reach a Number||42.5%|Medium||
+|0755|Pour Water||46.1%|Medium||
+|0756|Pyramid Transition Matrix|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0756.Pyramid-Transition-Matrix)|53.3%|Medium||
+|0757|Set Intersection Size At Least Two||43.8%|Hard||
+|0758|Bold Words in String||50.6%|Medium||
+|0759|Employee Free Time||71.7%|Hard||
+|0760|Find Anagram Mappings||82.8%|Easy||
+|0761|Special Binary String||60.3%|Hard||
+|0762|Prime Number of Set Bits in Binary Representation|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0762.Prime-Number-of-Set-Bits-in-Binary-Representation)|67.6%|Easy||
+|0763|Partition Labels|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0763.Partition-Labels)|79.8%|Medium||
+|0764|Largest Plus Sign||48.4%|Medium||
+|0765|Couples Holding Hands|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0765.Couples-Holding-Hands)|56.9%|Hard||
+|0766|Toeplitz Matrix|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0766.Toeplitz-Matrix)|68.1%|Easy||
+|0767|Reorganize String|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0767.Reorganize-String)|52.7%|Medium||
+|0768|Max Chunks To Make Sorted II||52.7%|Hard||
+|0769|Max Chunks To Make Sorted||58.2%|Medium||
+|0770|Basic Calculator IV||56.0%|Hard||
+|0771|Jewels and Stones|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0771.Jewels-and-Stones)|88.0%|Easy||
+|0772|Basic Calculator III||48.4%|Hard||
+|0773|Sliding Puzzle||63.7%|Hard||
+|0774|Minimize Max Distance to Gas Station||51.4%|Hard||
+|0775|Global and Local Inversions|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0775.Global-and-Local-Inversions)|43.8%|Medium||
+|0776|Split BST||58.7%|Medium||
+|0777|Swap Adjacent in LR String||37.1%|Medium||
+|0778|Swim in Rising Water|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0778.Swim-in-Rising-Water)|59.6%|Hard||
+|0779|K-th Symbol in Grammar||40.7%|Medium||
+|0780|Reaching Points||32.3%|Hard||
+|0781|Rabbits in Forest|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0781.Rabbits-in-Forest)|55.3%|Medium||
+|0782|Transform to Chessboard||51.9%|Hard||
+|0783|Minimum Distance Between BST Nodes|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0783.Minimum-Distance-Between-BST-Nodes)|56.8%|Easy||
+|0784|Letter Case Permutation|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0784.Letter-Case-Permutation)|73.4%|Medium||
+|0785|Is Graph Bipartite?|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0785.Is-Graph-Bipartite)|52.6%|Medium||
+|0786|K-th Smallest Prime Fraction|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0786.K-th-Smallest-Prime-Fraction)|50.6%|Medium||
+|0787|Cheapest Flights Within K Stops||35.9%|Medium||
+|0788|Rotated Digits||56.9%|Medium||
+|0789|Escape The Ghosts||60.6%|Medium||
+|0790|Domino and Tromino Tiling||48.4%|Medium||
+|0791|Custom Sort String|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0791.Custom-Sort-String)|69.4%|Medium||
+|0792|Number of Matching Subsequences|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0792.Number-of-Matching-Subsequences)|51.9%|Medium||
+|0793|Preimage Size of Factorial Zeroes Function|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0793.Preimage-Size-of-Factorial-Zeroes-Function)|42.7%|Hard||
+|0794|Valid Tic-Tac-Toe State|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0794.Valid-Tic-Tac-Toe-State)|35.2%|Medium||
+|0795|Number of Subarrays with Bounded Maximum|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0795.Number-of-Subarrays-with-Bounded-Maximum)|52.7%|Medium||
+|0796|Rotate String||54.0%|Easy||
+|0797|All Paths From Source to Target||81.4%|Medium||
+|0798|Smallest Rotation with Highest Score||49.6%|Hard||
+|0799|Champagne Tower||51.2%|Medium||
+|0800|Similar RGB Color||66.4%|Easy||
+|0801|Minimum Swaps To Make Sequences Increasing||39.2%|Hard||
+|0802|Find Eventual Safe States|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0802.Find-Eventual-Safe-States)|54.9%|Medium||
+|0803|Bricks Falling When Hit|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0803.Bricks-Falling-When-Hit)|34.3%|Hard||
+|0804|Unique Morse Code Words||82.6%|Easy||
+|0805|Split Array With Same Average||25.9%|Hard||
+|0806|Number of Lines To Write String||66.1%|Easy||
+|0807|Max Increase to Keep City Skyline|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0807.Max-Increase-to-Keep-City-Skyline)|85.9%|Medium||
+|0808|Soup Servings||43.1%|Medium||
+|0809|Expressive Words||46.3%|Medium||
+|0810|Chalkboard XOR Game|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0810.Chalkboard-XOR-Game)|55.1%|Hard||
+|0811|Subdomain Visit Count|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0811.Subdomain-Visit-Count)|75.1%|Medium||
+|0812|Largest Triangle Area|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0812.Largest-Triangle-Area)|60.1%|Easy||
+|0813|Largest Sum of Averages||52.9%|Medium||
+|0814|Binary Tree Pruning||72.6%|Medium||
+|0815|Bus Routes|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0815.Bus-Routes)|45.7%|Hard||
+|0816|Ambiguous Coordinates|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0816.Ambiguous-Coordinates)|56.0%|Medium||
+|0817|Linked List Components|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0817.Linked-List-Components)|58.1%|Medium||
+|0818|Race Car||43.6%|Hard||
+|0819|Most Common Word|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0819.Most-Common-Word)|45.0%|Easy||
+|0820|Short Encoding of Words|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0820.Short-Encoding-of-Words)|60.7%|Medium||
+|0821|Shortest Distance to a Character|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0821.Shortest-Distance-to-a-Character)|71.3%|Easy||
+|0822|Card Flipping Game||45.4%|Medium||
+|0823|Binary Trees With Factors|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0823.Binary-Trees-With-Factors)|50.0%|Medium||
+|0824|Goat Latin||67.8%|Easy||
+|0825|Friends Of Appropriate Ages|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0825.Friends-Of-Appropriate-Ages)|46.3%|Medium||
+|0826|Most Profit Assigning Work|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0826.Most-Profit-Assigning-Work)|44.3%|Medium||
+|0827|Making A Large Island||44.7%|Hard||
+|0828|Count Unique Characters of All Substrings of a Given String|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0828.Count-Unique-Characters-of-All-Substrings-of-a-Given-String)|51.5%|Hard||
+|0829|Consecutive Numbers Sum||41.5%|Hard||
+|0830|Positions of Large Groups|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0830.Positions-of-Large-Groups)|51.7%|Easy||
+|0831|Masking Personal Information||46.8%|Medium||
+|0832|Flipping an Image|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0832.Flipping-an-Image)|80.3%|Easy||
+|0833|Find And Replace in String||54.1%|Medium||
+|0834|Sum of Distances in Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0834.Sum-of-Distances-in-Tree)|54.1%|Hard||
+|0835|Image Overlap||61.0%|Medium||
+|0836|Rectangle Overlap|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0836.Rectangle-Overlap)|43.3%|Easy||
+|0837|New 21 Game||36.2%|Medium||
+|0838|Push Dominoes|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0838.Push-Dominoes)|57.0%|Medium||
+|0839|Similar String Groups|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0839.Similar-String-Groups)|47.5%|Hard||
+|0840|Magic Squares In Grid||38.5%|Medium||
+|0841|Keys and Rooms|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0841.Keys-and-Rooms)|70.1%|Medium||
+|0842|Split Array into Fibonacci Sequence|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0842.Split-Array-into-Fibonacci-Sequence)|38.2%|Medium||
+|0843|Guess the Word||42.0%|Hard||
+|0844|Backspace String Compare|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0844.Backspace-String-Compare)|48.0%|Easy||
+|0845|Longest Mountain in Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0845.Longest-Mountain-in-Array)|40.1%|Medium||
+|0846|Hand of Straights|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0846.Hand-of-Straights)|56.5%|Medium||
+|0847|Shortest Path Visiting All Nodes||61.3%|Hard||
+|0848|Shifting Letters||45.4%|Medium||
+|0849|Maximize Distance to Closest Person||47.6%|Medium||
+|0850|Rectangle Area II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0850.Rectangle-Area-II)|53.7%|Hard||
+|0851|Loud and Rich|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0851.Loud-and-Rich)|58.1%|Medium||
+|0852|Peak Index in a Mountain Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0852.Peak-Index-in-a-Mountain-Array)|69.5%|Medium||
+|0853|Car Fleet|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0853.Car-Fleet)|50.0%|Medium||
+|0854|K-Similar Strings||40.0%|Hard||
+|0855|Exam Room||43.5%|Medium||
+|0856|Score of Parentheses|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0856.Score-of-Parentheses)|65.1%|Medium||
+|0857|Minimum Cost to Hire K Workers||52.0%|Hard||
+|0858|Mirror Reflection||63.3%|Medium||
+|0859|Buddy Strings|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0859.Buddy-Strings)|29.0%|Easy||
+|0860|Lemonade Change||52.8%|Easy||
+|0861|Score After Flipping Matrix||75.1%|Medium||
+|0862|Shortest Subarray with Sum at Least K|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0862.Shortest-Subarray-with-Sum-at-Least-K)|26.1%|Hard||
+|0863|All Nodes Distance K in Binary Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0863.All-Nodes-Distance-K-in-Binary-Tree)|62.1%|Medium||
+|0864|Shortest Path to Get All Keys|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0864.Shortest-Path-to-Get-All-Keys)|45.3%|Hard||
+|0865|Smallest Subtree with all the Deepest Nodes||68.5%|Medium||
+|0866|Prime Palindrome||25.8%|Medium||
+|0867|Transpose Matrix|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0867.Transpose-Matrix)|63.4%|Easy||
+|0868|Binary Gap||61.9%|Easy||
+|0869|Reordered Power of 2|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0869.Reordered-Power-of-2)|64.1%|Medium||
+|0870|Advantage Shuffle|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0870.Advantage-Shuffle)|51.6%|Medium||
+|0871|Minimum Number of Refueling Stops||39.9%|Hard||
+|0872|Leaf-Similar Trees|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0872.Leaf-Similar-Trees)|65.2%|Easy||
+|0873|Length of Longest Fibonacci Subsequence||48.6%|Medium||
+|0874|Walking Robot Simulation|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0874.Walking-Robot-Simulation)|38.3%|Medium||
+|0875|Koko Eating Bananas|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0875.Koko-Eating-Bananas)|52.4%|Medium||
+|0876|Middle of the Linked List|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0876.Middle-of-the-Linked-List)|73.7%|Easy||
+|0877|Stone Game|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0877.Stone-Game)|69.7%|Medium||
+|0878|Nth Magical Number|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0878.Nth-Magical-Number)|35.7%|Hard||
+|0879|Profitable Schemes||40.5%|Hard||
+|0880|Decoded String at Index|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0880.Decoded-String-at-Index)|28.3%|Medium||
+|0881|Boats to Save People|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0881.Boats-to-Save-People)|52.7%|Medium||
+|0882|Reachable Nodes In Subdivided Graph||50.3%|Hard||
+|0883|Projection Area of 3D Shapes||70.7%|Easy||
+|0884|Uncommon Words from Two Sentences|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0884.Uncommon-Words-from-Two-Sentences)|65.9%|Easy||
+|0885|Spiral Matrix III|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0885.Spiral-Matrix-III)|73.0%|Medium||
+|0886|Possible Bipartition||48.4%|Medium||
+|0887|Super Egg Drop|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0887.Super-Egg-Drop)|27.2%|Hard||
+|0888|Fair Candy Swap|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0888.Fair-Candy-Swap)|60.5%|Easy||
+|0889|Construct Binary Tree from Preorder and Postorder Traversal||70.8%|Medium||
+|0890|Find and Replace Pattern|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0890.Find-and-Replace-Pattern)|77.9%|Medium||
+|0891|Sum of Subsequence Widths|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0891.Sum-of-Subsequence-Widths)|36.4%|Hard||
+|0892|Surface Area of 3D Shapes|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0892.Surface-Area-of-3D-Shapes)|63.0%|Easy||
+|0893|Groups of Special-Equivalent Strings||70.8%|Medium||
+|0894|All Possible Full Binary Trees||80.0%|Medium||
+|0895|Maximum Frequency Stack|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0895.Maximum-Frequency-Stack)|66.8%|Hard||
+|0896|Monotonic Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0896.Monotonic-Array)|58.2%|Easy||
+|0897|Increasing Order Search Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0897.Increasing-Order-Search-Tree)|78.4%|Easy||
+|0898|Bitwise ORs of Subarrays|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0898.Bitwise-ORs-of-Subarrays)|36.8%|Medium||
+|0899|Orderly Queue||59.0%|Hard||
+|0900|RLE Iterator||59.5%|Medium||
+|0901|Online Stock Span|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0901.Online-Stock-Span)|63.9%|Medium||
+|0902|Numbers At Most N Given Digit Set||41.4%|Hard||
+|0903|Valid Permutations for DI Sequence||57.7%|Hard||
+|0904|Fruit Into Baskets|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0904.Fruit-Into-Baskets)|42.6%|Medium||
+|0905|Sort Array By Parity||75.7%|Easy||
+|0906|Super Palindromes||39.2%|Hard||
+|0907|Sum of Subarray Minimums|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0907.Sum-of-Subarray-Minimums)|34.3%|Medium||
+|0908|Smallest Range I||67.6%|Easy||
+|0909|Snakes and Ladders|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0909.Snakes-and-Ladders)|40.8%|Medium||
+|0910|Smallest Range II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0910.Smallest-Range-II)|34.4%|Medium||
+|0911|Online Election|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0911.Online-Election)|52.1%|Medium||
+|0912|Sort an Array||60.0%|Medium||
+|0913|Cat and Mouse||35.3%|Hard||
+|0914|X of a Kind in a Deck of Cards|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0914.X-of-a-Kind-in-a-Deck-of-Cards)|32.2%|Easy||
+|0915|Partition Array into Disjoint Intervals||48.6%|Medium||
+|0916|Word Subsets|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0916.Word-Subsets)|54.1%|Medium||
+|0917|Reverse Only Letters||61.4%|Easy||
+|0918|Maximum Sum Circular Subarray|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0918.Maximum-Sum-Circular-Subarray)|38.1%|Medium||
+|0919|Complete Binary Tree Inserter||64.9%|Medium||
+|0920|Number of Music Playlists|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0920.Number-of-Music-Playlists)|50.6%|Hard||
+|0921|Minimum Add to Make Parentheses Valid|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0921.Minimum-Add-to-Make-Parentheses-Valid)|76.4%|Medium||
+|0922|Sort Array By Parity II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0922.Sort-Array-By-Parity-II)|70.7%|Easy||
+|0923|3Sum With Multiplicity|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0923.3Sum-With-Multiplicity)|45.4%|Medium||
+|0924|Minimize Malware Spread|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0924.Minimize-Malware-Spread)|42.1%|Hard||
+|0925|Long Pressed Name|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0925.Long-Pressed-Name)|33.8%|Easy||
+|0926|Flip String to Monotone Increasing||59.6%|Medium||
+|0927|Three Equal Parts|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0927.Three-Equal-Parts)|39.6%|Hard||
+|0928|Minimize Malware Spread II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0928.Minimize-Malware-Spread-II)|42.6%|Hard||
+|0929|Unique Email Addresses||67.2%|Easy||
+|0930|Binary Subarrays With Sum|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0930.Binary-Subarrays-With-Sum)|50.9%|Medium||
+|0931|Minimum Falling Path Sum||68.4%|Medium||
+|0932|Beautiful Array||65.1%|Medium||
+|0933|Number of Recent Calls|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0933.Number-of-Recent-Calls)|73.2%|Easy||
+|0934|Shortest Bridge||53.9%|Medium||
+|0935|Knight Dialer||49.9%|Medium||
+|0936|Stamping The Sequence||63.3%|Hard||
+|0937|Reorder Data in Log Files||56.4%|Medium||
+|0938|Range Sum of BST|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0938.Range-Sum-of-BST)|85.3%|Easy||
+|0939|Minimum Area Rectangle||53.2%|Medium||
+|0940|Distinct Subsequences II||44.4%|Hard||
+|0941|Valid Mountain Array||33.5%|Easy||
+|0942|DI String Match|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0942.DI-String-Match)|76.6%|Easy||
+|0943|Find the Shortest Superstring||45.0%|Hard||
+|0944|Delete Columns to Make Sorted||69.7%|Easy||
+|0945|Minimum Increment to Make Array Unique||49.8%|Medium||
+|0946|Validate Stack Sequences|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0946.Validate-Stack-Sequences)|67.6%|Medium||
+|0947|Most Stones Removed with Same Row or Column|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0947.Most-Stones-Removed-with-Same-Row-or-Column)|57.0%|Medium||
+|0948|Bag of Tokens||52.0%|Medium||
+|0949|Largest Time for Given Digits|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0949.Largest-Time-for-Given-Digits)|35.2%|Medium||
+|0950|Reveal Cards In Increasing Order||77.6%|Medium||
+|0951|Flip Equivalent Binary Trees||66.8%|Medium||
+|0952|Largest Component Size by Common Factor|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0952.Largest-Component-Size-by-Common-Factor)|40.3%|Hard||
+|0953|Verifying an Alien Dictionary|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0953.Verifying-an-Alien-Dictionary)|52.7%|Easy||
+|0954|Array of Doubled Pairs||39.1%|Medium||
+|0955|Delete Columns to Make Sorted II||34.6%|Medium||
+|0956|Tallest Billboard||40.0%|Hard||
+|0957|Prison Cells After N Days||39.2%|Medium||
+|0958|Check Completeness of a Binary Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0958.Check-Completeness-of-a-Binary-Tree)|53.8%|Medium||
+|0959|Regions Cut By Slashes|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0959.Regions-Cut-By-Slashes)|69.1%|Medium||
+|0960|Delete Columns to Make Sorted III||57.1%|Hard||
+|0961|N-Repeated Element in Size 2N Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0961.N-Repeated-Element-in-Size-2N-Array)|75.8%|Easy||
+|0962|Maximum Width Ramp||48.9%|Medium||
+|0963|Minimum Area Rectangle II||54.7%|Medium||
+|0964|Least Operators to Express Number||47.8%|Hard||
+|0965|Univalued Binary Tree||69.2%|Easy||
+|0966|Vowel Spellchecker|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0966.Vowel-Spellchecker)|51.5%|Medium||
+|0967|Numbers With Same Consecutive Differences||57.0%|Medium||
+|0968|Binary Tree Cameras|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0968.Binary-Tree-Cameras)|46.8%|Hard||
+|0969|Pancake Sorting|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0969.Pancake-Sorting)|70.0%|Medium||
+|0970|Powerful Integers|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0970.Powerful-Integers)|43.6%|Medium||
+|0971|Flip Binary Tree To Match Preorder Traversal|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0971.Flip-Binary-Tree-To-Match-Preorder-Traversal)|49.9%|Medium||
+|0972|Equal Rational Numbers||43.0%|Hard||
+|0973|K Closest Points to Origin|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0973.K-Closest-Points-to-Origin)|65.9%|Medium||
+|0974|Subarray Sums Divisible by K||53.6%|Medium||
+|0975|Odd Even Jump||38.9%|Hard||
+|0976|Largest Perimeter Triangle|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0976.Largest-Perimeter-Triangle)|54.8%|Easy||
+|0977|Squares of a Sorted Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0977.Squares-of-a-Sorted-Array)|71.9%|Easy||
+|0978|Longest Turbulent Subarray|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0978.Longest-Turbulent-Subarray)|47.4%|Medium||
+|0979|Distribute Coins in Binary Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0979.Distribute-Coins-in-Binary-Tree)|72.0%|Medium||
+|0980|Unique Paths III|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0980.Unique-Paths-III)|79.6%|Hard||
+|0981|Time Based Key-Value Store|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0981.Time-Based-Key-Value-Store)|53.6%|Medium||
+|0982|Triples with Bitwise AND Equal To Zero||57.6%|Hard||
+|0983|Minimum Cost For Tickets||64.4%|Medium||
+|0984|String Without AAA or BBB|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0984.String-Without-AAA-or-BBB)|42.9%|Medium||
+|0985|Sum of Even Numbers After Queries|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0985.Sum-of-Even-Numbers-After-Queries)|68.3%|Medium||
+|0986|Interval List Intersections|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0986.Interval-List-Intersections)|71.4%|Medium||
+|0987|Vertical Order Traversal of a Binary Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0987.Vertical-Order-Traversal-of-a-Binary-Tree)|44.6%|Hard||
+|0988|Smallest String Starting From Leaf||49.6%|Medium||
+|0989|Add to Array-Form of Integer|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0989.Add-to-Array-Form-of-Integer)|45.5%|Easy||
+|0990|Satisfiability of Equality Equations|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0990.Satisfiability-of-Equality-Equations)|50.7%|Medium||
+|0991|Broken Calculator|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0991.Broken-Calculator)|54.1%|Medium||
+|0992|Subarrays with K Different Integers|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0992.Subarrays-with-K-Different-Integers)|54.3%|Hard||
+|0993|Cousins in Binary Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0993.Cousins-in-Binary-Tree)|54.1%|Easy||
+|0994|Rotting Oranges||52.4%|Medium||
+|0995|Minimum Number of K Consecutive Bit Flips|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0995.Minimum-Number-of-K-Consecutive-Bit-Flips)|51.1%|Hard||
+|0996|Number of Squareful Arrays|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0996.Number-of-Squareful-Arrays)|49.2%|Hard||
+|0997|Find the Town Judge|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0997.Find-the-Town-Judge)|49.4%|Easy||
+|0998|Maximum Binary Tree II||66.3%|Medium||
+|0999|Available Captures for Rook|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0999.Available-Captures-for-Rook)|67.8%|Easy||
+|1000|Minimum Cost to Merge Stones||42.3%|Hard||
+|1001|Grid Illumination||36.2%|Hard||
+|1002|Find Common Characters|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1002.Find-Common-Characters)|68.3%|Easy||
+|1003|Check If Word Is Valid After Substitutions|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1003.Check-If-Word-Is-Valid-After-Substitutions)|58.2%|Medium||
+|1004|Max Consecutive Ones III|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1004.Max-Consecutive-Ones-III)|63.5%|Medium||
+|1005|Maximize Sum Of Array After K Negations|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1005.Maximize-Sum-Of-Array-After-K-Negations)|51.1%|Easy||
+|1006|Clumsy Factorial|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1006.Clumsy-Factorial)|54.7%|Medium||
+|1007|Minimum Domino Rotations For Equal Row||52.4%|Medium||
+|1008|Construct Binary Search Tree from Preorder Traversal||80.9%|Medium||
+|1009|Complement of Base 10 Integer|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1009.Complement-of-Base-10-Integer)|62.0%|Easy||
+|1010|Pairs of Songs With Total Durations Divisible by 60|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1010.Pairs-of-Songs-With-Total-Durations-Divisible-by-60)|53.0%|Medium||
+|1011|Capacity To Ship Packages Within D Days|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1011.Capacity-To-Ship-Packages-Within-D-Days)|64.4%|Medium||
+|1012|Numbers With Repeated Digits||40.4%|Hard||
+|1013|Partition Array Into Three Parts With Equal Sum||43.5%|Easy||
+|1014|Best Sightseeing Pair||59.5%|Medium||
+|1015|Smallest Integer Divisible by K||47.1%|Medium||
+|1016|Binary String With Substrings Representing 1 To N||57.6%|Medium||
+|1017|Convert to Base -2|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1017.Convert-to-Base-2)|60.9%|Medium||
+|1018|Binary Prefix Divisible By 5|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1018.Binary-Prefix-Divisible-By-5)|47.4%|Easy||
+|1019|Next Greater Node In Linked List|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1019.Next-Greater-Node-In-Linked-List)|59.8%|Medium||
+|1020|Number of Enclaves|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1020.Number-of-Enclaves)|64.8%|Medium||
+|1021|Remove Outermost Parentheses|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1021.Remove-Outermost-Parentheses)|80.1%|Easy||
+|1022|Sum of Root To Leaf Binary Numbers|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1022.Sum-of-Root-To-Leaf-Binary-Numbers)|73.8%|Easy||
+|1023|Camelcase Matching||60.1%|Medium||
+|1024|Video Stitching||50.5%|Medium||
+|1025|Divisor Game|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1025.Divisor-Game)|67.1%|Easy||
+|1026|Maximum Difference Between Node and Ancestor|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1026.Maximum-Difference-Between-Node-and-Ancestor)|73.4%|Medium||
+|1027|Longest Arithmetic Subsequence||47.2%|Medium||
+|1028|Recover a Tree From Preorder Traversal|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1028.Recover-a-Tree-From-Preorder-Traversal)|72.8%|Hard||
+|1029|Two City Scheduling||64.5%|Medium||
+|1030|Matrix Cells in Distance Order|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1030.Matrix-Cells-in-Distance-Order)|69.3%|Easy||
+|1031|Maximum Sum of Two Non-Overlapping Subarrays||59.4%|Medium||
+|1032|Stream of Characters||51.5%|Hard||
+|1033|Moving Stones Until Consecutive||45.6%|Medium||
+|1034|Coloring A Border|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1034.Coloring-A-Border)|48.9%|Medium||
+|1035|Uncrossed Lines||58.7%|Medium||
+|1036|Escape a Large Maze||34.2%|Hard||
+|1037|Valid Boomerang|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1037.Valid-Boomerang)|37.5%|Easy||
+|1038|Binary Search Tree to Greater Sum Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1038.Binary-Search-Tree-to-Greater-Sum-Tree)|85.3%|Medium||
+|1039|Minimum Score Triangulation of Polygon||54.5%|Medium||
+|1040|Moving Stones Until Consecutive II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1040.Moving-Stones-Until-Consecutive-II)|55.6%|Medium||
+|1041|Robot Bounded In Circle||55.3%|Medium||
+|1042|Flower Planting With No Adjacent||50.4%|Medium||
+|1043|Partition Array for Maximum Sum||71.2%|Medium||
+|1044|Longest Duplicate Substring||30.7%|Hard||
+|1045|Customers Who Bought All Products||67.6%|Medium||
+|1046|Last Stone Weight||64.7%|Easy||
+|1047|Remove All Adjacent Duplicates In String|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1047.Remove-All-Adjacent-Duplicates-In-String)|70.5%|Easy||
+|1048|Longest String Chain|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1048.Longest-String-Chain)|59.2%|Medium||
+|1049|Last Stone Weight II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1049.Last-Stone-Weight-II)|52.4%|Medium||
+|1050|Actors and Directors Who Cooperated At Least Three Times||72.4%|Easy||
+|1051|Height Checker|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1051.Height-Checker)|75.0%|Easy||
+|1052|Grumpy Bookstore Owner|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1052.Grumpy-Bookstore-Owner)|57.0%|Medium||
+|1053|Previous Permutation With One Swap||50.8%|Medium||
+|1054|Distant Barcodes|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1054.Distant-Barcodes)|45.7%|Medium||
+|1055|Shortest Way to Form String||59.1%|Medium||
+|1056|Confusing Number||46.1%|Easy||
+|1057|Campus Bikes||57.7%|Medium||
+|1058|Minimize Rounding Error to Meet Target||44.9%|Medium||
+|1059|All Paths from Source Lead to Destination||40.5%|Medium||
+|1060|Missing Element in Sorted Array||54.6%|Medium||
+|1061|Lexicographically Smallest Equivalent String||70.4%|Medium||
+|1062|Longest Repeating Substring||59.1%|Medium||
+|1063|Number of Valid Subarrays||74.1%|Hard||
+|1064|Fixed Point||63.6%|Easy||
+|1065|Index Pairs of a String||63.0%|Easy||
+|1066|Campus Bikes II||54.5%|Medium||
+|1067|Digit Count in Range||44.6%|Hard||
+|1068|Product Sales Analysis I||80.4%|Easy||
+|1069|Product Sales Analysis II||82.0%|Easy||
+|1070|Product Sales Analysis III||49.2%|Medium||
+|1071|Greatest Common Divisor of Strings||51.0%|Easy||
+|1072|Flip Columns For Maximum Number of Equal Rows||63.1%|Medium||
+|1073|Adding Two Negabinary Numbers|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1073.Adding-Two-Negabinary-Numbers)|36.4%|Medium||
+|1074|Number of Submatrices That Sum to Target|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1074.Number-of-Submatrices-That-Sum-to-Target)|69.8%|Hard||
+|1075|Project Employees I||67.2%|Easy||
+|1076|Project Employees II||51.0%|Easy||
+|1077|Project Employees III||78.7%|Medium||
+|1078|Occurrences After Bigram|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1078.Occurrences-After-Bigram)|63.9%|Easy||
+|1079|Letter Tile Possibilities|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1079.Letter-Tile-Possibilities)|76.1%|Medium||
+|1080|Insufficient Nodes in Root to Leaf Paths||52.8%|Medium||
+|1081|Smallest Subsequence of Distinct Characters||57.6%|Medium||
+|1082|Sales Analysis I||75.4%|Easy||
+|1083|Sales Analysis II||50.5%|Easy||
+|1084|Sales Analysis III||52.2%|Easy||
+|1085|Sum of Digits in the Minimum Number||75.9%|Easy||
+|1086|High Five||75.2%|Easy||
+|1087|Brace Expansion||66.1%|Medium||
+|1088|Confusing Number II||46.5%|Hard||
+|1089|Duplicate Zeros|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1089.Duplicate-Zeros)|51.5%|Easy||
+|1090|Largest Values From Labels||60.9%|Medium||
+|1091|Shortest Path in Binary Matrix|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1091.Shortest-Path-in-Binary-Matrix)|44.5%|Medium||
+|1092|Shortest Common Supersequence||57.8%|Hard||
+|1093|Statistics from a Large Sample|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1093.Statistics-from-a-Large-Sample)|44.7%|Medium||
+|1094|Car Pooling||57.4%|Medium||
+|1095|Find in Mountain Array||35.8%|Hard||
+|1096|Brace Expansion II||63.5%|Hard||
+|1097|Game Play Analysis V||55.2%|Hard||
+|1098|Unpopular Books||45.2%|Medium||
+|1099|Two Sum Less Than K||60.4%|Easy||
+|1100|Find K-Length Substrings With No Repeated Characters||74.7%|Medium||
+|1101|The Earliest Moment When Everyone Become Friends||65.0%|Medium||
+|1102|Path With Maximum Minimum Value||53.3%|Medium||
+|1103|Distribute Candies to People||63.9%|Easy||
+|1104|Path In Zigzag Labelled Binary Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1104.Path-In-Zigzag-Labelled-Binary-Tree)|74.9%|Medium||
+|1105|Filling Bookcase Shelves|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1105.Filling-Bookcase-Shelves)|58.9%|Medium||
+|1106|Parsing A Boolean Expression||58.5%|Hard||
+|1107|New Users Daily Count||45.9%|Medium||
+|1108|Defanging an IP Address|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1108.Defanging-an-IP-Address)|89.3%|Easy||
+|1109|Corporate Flight Bookings||60.3%|Medium||
+|1110|Delete Nodes And Return Forest|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1110.Delete-Nodes-And-Return-Forest)|69.4%|Medium||
+|1111|Maximum Nesting Depth of Two Valid Parentheses Strings|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1111.Maximum-Nesting-Depth-of-Two-Valid-Parentheses-Strings)|73.3%|Medium||
+|1112|Highest Grade For Each Student||73.8%|Medium||
+|1113|Reported Posts||66.1%|Easy||
+|1114|Print in Order||68.1%|Easy||
+|1115|Print FooBar Alternately||61.7%|Medium||
+|1116|Print Zero Even Odd||60.1%|Medium||
+|1117|Building H2O||55.7%|Medium||
+|1118|Number of Days in a Month||56.7%|Easy||
+|1119|Remove Vowels from a String||90.7%|Easy||
+|1120|Maximum Average Subtree||65.5%|Medium||
+|1121|Divide Array Into Increasing Sequences||60.0%|Hard||
+|1122|Relative Sort Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1122.Relative-Sort-Array)|68.4%|Easy||
+|1123|Lowest Common Ancestor of Deepest Leaves|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1123.Lowest-Common-Ancestor-of-Deepest-Leaves)|70.6%|Medium||
+|1124|Longest Well-Performing Interval||34.6%|Medium||
+|1125|Smallest Sufficient Team||47.1%|Hard||
+|1126|Active Businesses||67.9%|Medium||
+|1127|User Purchase Platform||51.2%|Hard||
+|1128|Number of Equivalent Domino Pairs|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1128.Number-of-Equivalent-Domino-Pairs)|46.9%|Easy||
+|1129|Shortest Path with Alternating Colors||42.9%|Medium||
+|1130|Minimum Cost Tree From Leaf Values||68.5%|Medium||
+|1131|Maximum of Absolute Value Expression||49.5%|Medium||
+|1132|Reported Posts II||33.6%|Medium||
+|1133|Largest Unique Number||67.5%|Easy||
+|1134|Armstrong Number||78.1%|Easy||
+|1135|Connecting Cities With Minimum Cost||61.1%|Medium||
+|1136|Parallel Courses||62.0%|Medium||
+|1137|N-th Tribonacci Number|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1137.N-th-Tribonacci-Number)|63.3%|Easy||
+|1138|Alphabet Board Path||52.3%|Medium||
+|1139|Largest 1-Bordered Square||50.0%|Medium||
+|1140|Stone Game II||64.9%|Medium||
+|1141|User Activity for the Past 30 Days I||50.2%|Easy||
+|1142|User Activity for the Past 30 Days II||36.0%|Easy||
+|1143|Longest Common Subsequence|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1143.Longest-Common-Subsequence)|58.8%|Medium||
+|1144|Decrease Elements To Make Array Zigzag||47.0%|Medium||
+|1145|Binary Tree Coloring Game|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1145.Binary-Tree-Coloring-Game)|51.4%|Medium||
+|1146|Snapshot Array||37.3%|Medium||
+|1147|Longest Chunked Palindrome Decomposition||60.0%|Hard||
+|1148|Article Views I||77.0%|Easy||
+|1149|Article Views II||47.6%|Medium||
+|1150|Check If a Number Is Majority Element in a Sorted Array||56.8%|Easy||
+|1151|Minimum Swaps to Group All 1's Together||60.9%|Medium||
+|1152|Analyze User Website Visit Pattern||43.4%|Medium||
+|1153|String Transforms Into Another String||35.3%|Hard||
+|1154|Day of the Year|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1154.Day-of-the-Year)|50.3%|Easy||
+|1155|Number of Dice Rolls With Target Sum||53.6%|Medium||
+|1156|Swap For Longest Repeated Character Substring||45.5%|Medium||
+|1157|Online Majority Element In Subarray|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1157.Online-Majority-Element-In-Subarray)|42.0%|Hard||
+|1158|Market Analysis I||63.9%|Medium||
+|1159|Market Analysis II||58.7%|Hard||
+|1160|Find Words That Can Be Formed by Characters|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1160.Find-Words-That-Can-Be-Formed-by-Characters)|67.8%|Easy||
+|1161|Maximum Level Sum of a Binary Tree||66.2%|Medium||
+|1162|As Far from Land as Possible||48.5%|Medium||
+|1163|Last Substring in Lexicographical Order||35.1%|Hard||
+|1164|Product Price at a Given Date||68.4%|Medium||
+|1165|Single-Row Keyboard||85.7%|Easy||
+|1166|Design File System||61.8%|Medium||
+|1167|Minimum Cost to Connect Sticks||67.7%|Medium||
+|1168|Optimize Water Distribution in a Village||64.4%|Hard||
+|1169|Invalid Transactions||31.0%|Medium||
+|1170|Compare Strings by Frequency of the Smallest Character|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1170.Compare-Strings-by-Frequency-of-the-Smallest-Character)|61.3%|Medium||
+|1171|Remove Zero Sum Consecutive Nodes from Linked List|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1171.Remove-Zero-Sum-Consecutive-Nodes-from-Linked-List)|42.9%|Medium||
+|1172|Dinner Plate Stacks||33.7%|Hard||
+|1173|Immediate Food Delivery I||83.4%|Easy||
+|1174|Immediate Food Delivery II||63.9%|Medium||
+|1175|Prime Arrangements|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1175.Prime-Arrangements)|53.5%|Easy||
+|1176|Diet Plan Performance||52.4%|Easy||
+|1177|Can Make Palindrome from Substring||37.8%|Medium||
+|1178|Number of Valid Words for Each Puzzle|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1178.Number-of-Valid-Words-for-Each-Puzzle)|46.6%|Hard||
+|1179|Reformat Department Table||82.7%|Easy||
+|1180|Count Substrings with Only One Distinct Letter||78.9%|Easy||
+|1181|Before and After Puzzle||45.1%|Medium||
+|1182|Shortest Distance to Target Color||55.5%|Medium||
+|1183|Maximum Number of Ones||60.9%|Hard||
+|1184|Distance Between Bus Stops|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1184.Distance-Between-Bus-Stops)|54.1%|Easy||
+|1185|Day of the Week|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1185.Day-of-the-Week)|57.8%|Easy||
+|1186|Maximum Subarray Sum with One Deletion||41.2%|Medium||
+|1187|Make Array Strictly Increasing||45.3%|Hard||
+|1188|Design Bounded Blocking Queue||72.9%|Medium||
+|1189|Maximum Number of Balloons|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1189.Maximum-Number-of-Balloons)|62.2%|Easy||
+|1190|Reverse Substrings Between Each Pair of Parentheses|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1190.Reverse-Substrings-Between-Each-Pair-of-Parentheses)|65.9%|Medium||
+|1191|K-Concatenation Maximum Sum||24.0%|Medium||
+|1192|Critical Connections in a Network||54.5%|Hard||
+|1193|Monthly Transactions I||67.2%|Medium||
+|1194|Tournament Winners||51.7%|Hard||
+|1195|Fizz Buzz Multithreaded||72.5%|Medium||
+|1196|How Many Apples Can You Put into the Basket||67.0%|Easy||
+|1197|Minimum Knight Moves||39.8%|Medium||
+|1198|Find Smallest Common Element in All Rows||76.0%|Medium||
+|1199|Minimum Time to Build Blocks||40.7%|Hard||
+|1200|Minimum Absolute Difference|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1200.Minimum-Absolute-Difference)|69.8%|Easy||
+|1201|Ugly Number III|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1201.Ugly-Number-III)|28.5%|Medium||
+|1202|Smallest String With Swaps|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1202.Smallest-String-With-Swaps)|57.5%|Medium||
+|1203|Sort Items by Groups Respecting Dependencies|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1203.Sort-Items-by-Groups-Respecting-Dependencies)|50.6%|Hard||
+|1204|Last Person to Fit in the Bus||74.1%|Medium||
+|1205|Monthly Transactions II||43.8%|Medium||
+|1206|Design Skiplist||60.5%|Hard||
+|1207|Unique Number of Occurrences|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1207.Unique-Number-of-Occurrences)|70.9%|Easy||
+|1208|Get Equal Substrings Within Budget|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1208.Get-Equal-Substrings-Within-Budget)|47.6%|Medium||
+|1209|Remove All Adjacent Duplicates in String II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1209.Remove-All-Adjacent-Duplicates-in-String-II)|56.0%|Medium||
+|1210|Minimum Moves to Reach Target with Rotations||48.9%|Hard||
+|1211|Queries Quality and Percentage||71.9%|Easy||
+|1212|Team Scores in Football Tournament||57.6%|Medium||
+|1213|Intersection of Three Sorted Arrays||80.0%|Easy||
+|1214|Two Sum BSTs||66.2%|Medium||
+|1215|Stepping Numbers||45.8%|Medium||
+|1216|Valid Palindrome III||50.1%|Hard||
+|1217|Minimum Cost to Move Chips to The Same Position|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1217.Minimum-Cost-to-Move-Chips-to-The-Same-Position)|72.2%|Easy||
+|1218|Longest Arithmetic Subsequence of Given Difference||51.8%|Medium||
+|1219|Path with Maximum Gold||64.4%|Medium||
+|1220|Count Vowels Permutation||60.7%|Hard||
+|1221|Split a String in Balanced Strings|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1221.Split-a-String-in-Balanced-Strings)|84.7%|Easy||
+|1222|Queens That Can Attack the King||71.7%|Medium||
+|1223|Dice Roll Simulation||48.4%|Hard||
+|1224|Maximum Equal Frequency||36.8%|Hard||
+|1225|Report Contiguous Dates||63.4%|Hard||
+|1226|The Dining Philosophers||56.6%|Medium||
+|1227|Airplane Seat Assignment Probability||64.9%|Medium||
+|1228|Missing Number In Arithmetic Progression||51.4%|Easy||
+|1229|Meeting Scheduler||55.4%|Medium||
+|1230|Toss Strange Coins||53.4%|Medium||
+|1231|Divide Chocolate||56.9%|Hard||
+|1232|Check If It Is a Straight Line|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1232.Check-If-It-Is-a-Straight-Line)|41.2%|Easy||
+|1233|Remove Sub-Folders from the Filesystem||65.4%|Medium||
+|1234|Replace the Substring for Balanced String|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1234.Replace-the-Substring-for-Balanced-String)|36.8%|Medium||
+|1235|Maximum Profit in Job Scheduling|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1235.Maximum-Profit-in-Job-Scheduling)|51.1%|Hard||
+|1236|Web Crawler||66.3%|Medium||
+|1237|Find Positive Integer Solution for a Given Equation||69.3%|Medium||
+|1238|Circular Permutation in Binary Representation||68.8%|Medium||
+|1239|Maximum Length of a Concatenated String with Unique Characters|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1239.Maximum-Length-of-a-Concatenated-String-with-Unique-Characters)|50.6%|Medium||
+|1240|Tiling a Rectangle with the Fewest Squares||54.0%|Hard||
+|1241|Number of Comments per Post||68.0%|Easy||
+|1242|Web Crawler Multithreaded||49.0%|Medium||
+|1243|Array Transformation||50.7%|Easy||
+|1244|Design A Leaderboard||68.8%|Medium||
+|1245|Tree Diameter||61.7%|Medium||
+|1246|Palindrome Removal||45.9%|Hard||
+|1247|Minimum Swaps to Make Strings Equal||63.7%|Medium||
+|1248|Count Number of Nice Subarrays||59.5%|Medium||
+|1249|Minimum Remove to Make Valid Parentheses|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1249.Minimum-Remove-to-Make-Valid-Parentheses)|65.6%|Medium||
+|1250|Check If It Is a Good Array||58.7%|Hard||
+|1251|Average Selling Price||83.2%|Easy||
+|1252|Cells with Odd Values in a Matrix|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1252.Cells-with-Odd-Values-in-a-Matrix)|78.6%|Easy||
+|1253|Reconstruct a 2-Row Binary Matrix||43.8%|Medium||
+|1254|Number of Closed Islands|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1254.Number-of-Closed-Islands)|64.2%|Medium||
+|1255|Maximum Score Words Formed by Letters||72.8%|Hard||
+|1256|Encode Number||69.9%|Medium||
+|1257|Smallest Common Region||64.1%|Medium||
+|1258|Synonymous Sentences||56.4%|Medium||
+|1259|Handshakes That Don't Cross||56.2%|Hard||
+|1260|Shift 2D Grid|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1260.Shift-2D-Grid)|68.0%|Easy||
+|1261|Find Elements in a Contaminated Binary Tree||76.1%|Medium||
+|1262|Greatest Sum Divisible by Three||50.9%|Medium||
+|1263|Minimum Moves to Move a Box to Their Target Location||49.0%|Hard||
+|1264|Page Recommendations||67.8%|Medium||
+|1265|Print Immutable Linked List in Reverse||94.3%|Medium||
+|1266|Minimum Time Visiting All Points|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1266.Minimum-Time-Visiting-All-Points)|79.1%|Easy||
+|1267|Count Servers that Communicate||59.1%|Medium||
+|1268|Search Suggestions System|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1268.Search-Suggestions-System)|66.7%|Medium||
+|1269|Number of Ways to Stay in the Same Place After Some Steps||43.6%|Hard||
+|1270|All People Report to the Given Manager||88.0%|Medium||
+|1271|Hexspeak||57.0%|Easy||
+|1272|Remove Interval||63.3%|Medium||
+|1273|Delete Tree Nodes||61.2%|Medium||
+|1274|Number of Ships in a Rectangle||69.3%|Hard||
+|1275|Find Winner on a Tic Tac Toe Game|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1275.Find-Winner-on-a-Tic-Tac-Toe-Game)|54.3%|Easy||
+|1276|Number of Burgers with No Waste of Ingredients||50.6%|Medium||
+|1277|Count Square Submatrices with All Ones||74.4%|Medium||
+|1278|Palindrome Partitioning III||60.8%|Hard||
+|1279|Traffic Light Controlled Intersection||74.5%|Easy||
+|1280|Students and Examinations||74.5%|Easy||
+|1281|Subtract the Product and Sum of Digits of an Integer|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1281.Subtract-the-Product-and-Sum-of-Digits-of-an-Integer)|86.7%|Easy||
+|1282|Group the People Given the Group Size They Belong To||85.7%|Medium||
+|1283|Find the Smallest Divisor Given a Threshold|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1283.Find-the-Smallest-Divisor-Given-a-Threshold)|55.3%|Medium||
+|1284|Minimum Number of Flips to Convert Binary Matrix to Zero Matrix||72.1%|Hard||
+|1285|Find the Start and End Number of Continuous Ranges||88.2%|Medium||
+|1286|Iterator for Combination||73.5%|Medium||
+|1287|Element Appearing More Than 25% In Sorted Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1287.Element-Appearing-More-Than-25-In-Sorted-Array)|59.5%|Easy||
+|1288|Remove Covered Intervals||57.3%|Medium||
+|1289|Minimum Falling Path Sum II||59.6%|Hard||
+|1290|Convert Binary Number in a Linked List to Integer|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1290.Convert-Binary-Number-in-a-Linked-List-to-Integer)|82.6%|Easy||
+|1291|Sequential Digits||61.2%|Medium||
+|1292|Maximum Side Length of a Square with Sum Less than or Equal to Threshold||53.1%|Medium||
+|1293|Shortest Path in a Grid with Obstacles Elimination|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1293.Shortest-Path-in-a-Grid-with-Obstacles-Elimination)|43.6%|Hard||
+|1294|Weather Type in Each Country||67.9%|Easy||
+|1295|Find Numbers with Even Number of Digits|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1295.Find-Numbers-with-Even-Number-of-Digits)|76.9%|Easy||
+|1296|Divide Array in Sets of K Consecutive Numbers|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1296.Divide-Array-in-Sets-of-K-Consecutive-Numbers)|56.6%|Medium||
+|1297|Maximum Number of Occurrences of a Substring||52.1%|Medium||
+|1298|Maximum Candies You Can Get from Boxes||61.1%|Hard||
+|1299|Replace Elements with Greatest Element on Right Side|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1299.Replace-Elements-with-Greatest-Element-on-Right-Side)|74.7%|Easy||
+|1300|Sum of Mutated Array Closest to Target|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1300.Sum-of-Mutated-Array-Closest-to-Target)|43.1%|Medium||
+|1301|Number of Paths with Max Score||38.7%|Hard||
+|1302|Deepest Leaves Sum|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1302.Deepest-Leaves-Sum)|87.0%|Medium||
+|1303|Find the Team Size||90.8%|Easy||
+|1304|Find N Unique Integers Sum up to Zero|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1304.Find-N-Unique-Integers-Sum-up-to-Zero)|77.1%|Easy||
+|1305|All Elements in Two Binary Search Trees|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1305.All-Elements-in-Two-Binary-Search-Trees)|79.8%|Medium||
+|1306|Jump Game III|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1306.Jump-Game-III)|63.0%|Medium||
+|1307|Verbal Arithmetic Puzzle||34.5%|Hard||
+|1308|Running Total for Different Genders||88.3%|Medium||
+|1309|Decrypt String from Alphabet to Integer Mapping||79.4%|Easy||
+|1310|XOR Queries of a Subarray|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1310.XOR-Queries-of-a-Subarray)|72.1%|Medium||
+|1311|Get Watched Videos by Your Friends||45.9%|Medium||
+|1312|Minimum Insertion Steps to Make a String Palindrome||65.5%|Hard||
+|1313|Decompress Run-Length Encoded List|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1313.Decompress-Run-Length-Encoded-List)|85.9%|Easy||
+|1314|Matrix Block Sum||75.4%|Medium||
+|1315|Sum of Nodes with Even-Valued Grandparent||85.6%|Medium||
+|1316|Distinct Echo Substrings||49.8%|Hard||
+|1317|Convert Integer to the Sum of Two No-Zero Integers|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1317.Convert-Integer-to-the-Sum-of-Two-No-Zero-Integers)|56.2%|Easy||
+|1318|Minimum Flips to Make a OR b Equal to c||66.0%|Medium||
+|1319|Number of Operations to Make Network Connected|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1319.Number-of-Operations-to-Make-Network-Connected)|58.3%|Medium||
+|1320|Minimum Distance to Type a Word Using Two Fingers||59.8%|Hard||
+|1321|Restaurant Growth||72.2%|Medium||
+|1322|Ads Performance||60.9%|Easy||
+|1323|Maximum 69 Number||79.1%|Easy||
+|1324|Print Words Vertically||60.0%|Medium||
+|1325|Delete Leaves With a Given Value||74.8%|Medium||
+|1326|Minimum Number of Taps to Open to Water a Garden||47.8%|Hard||
+|1327|List the Products Ordered in a Period||77.1%|Easy||
+|1328|Break a Palindrome||53.4%|Medium||
+|1329|Sort the Matrix Diagonally|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1329.Sort-the-Matrix-Diagonally)|83.6%|Medium||
+|1330|Reverse Subarray To Maximize Array Value||39.9%|Hard||
+|1331|Rank Transform of an Array||59.0%|Easy||
+|1332|Remove Palindromic Subsequences|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1332.Remove-Palindromic-Subsequences)|76.1%|Easy||
+|1333|Filter Restaurants by Vegan-Friendly, Price and Distance||59.4%|Medium||
+|1334|Find the City With the Smallest Number of Neighbors at a Threshold Distance||52.9%|Medium||
+|1335|Minimum Difficulty of a Job Schedule||58.8%|Hard||
+|1336|Number of Transactions per Visit||51.4%|Hard||
+|1337|The K Weakest Rows in a Matrix|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1337.The-K-Weakest-Rows-in-a-Matrix)|73.1%|Easy||
+|1338|Reduce Array Size to The Half||69.8%|Medium||
+|1339|Maximum Product of Splitted Binary Tree||43.3%|Medium||
+|1340|Jump Game V||62.6%|Hard||
+|1341|Movie Rating||58.6%|Medium||
+|1342|Number of Steps to Reduce a Number to Zero||85.6%|Easy||
+|1343|Number of Sub-arrays of Size K and Average Greater than or Equal to Threshold||67.7%|Medium||
+|1344|Angle Between Hands of a Clock||63.4%|Medium||
+|1345|Jump Game IV||44.1%|Hard||
+|1346|Check If N and Its Double Exist||36.1%|Easy||
+|1347|Minimum Number of Steps to Make Two Strings Anagram||77.2%|Medium||
+|1348|Tweet Counts Per Frequency||43.5%|Medium||
+|1349|Maximum Students Taking Exam||48.0%|Hard||
+|1350|Students With Invalid Departments||90.5%|Easy||
+|1351|Count Negative Numbers in a Sorted Matrix||75.3%|Easy||
+|1352|Product of the Last K Numbers||49.4%|Medium||
+|1353|Maximum Number of Events That Can Be Attended|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1353.Maximum-Number-of-Events-That-Can-Be-Attended)|32.9%|Medium||
+|1354|Construct Target Array With Multiple Sums||36.3%|Hard||
+|1355|Activity Participants||74.4%|Medium||
+|1356|Sort Integers by The Number of 1 Bits||72.0%|Easy||
+|1357|Apply Discount Every n Orders||69.9%|Medium||
+|1358|Number of Substrings Containing All Three Characters||62.9%|Medium||
+|1359|Count All Valid Pickup and Delivery Options||63.0%|Hard||
+|1360|Number of Days Between Two Dates||47.5%|Easy||
+|1361|Validate Binary Tree Nodes||40.4%|Medium||
+|1362|Closest Divisors||59.8%|Medium||
+|1363|Largest Multiple of Three||33.5%|Hard||
+|1364|Number of Trusted Contacts of a Customer||79.0%|Medium||
+|1365|How Many Numbers Are Smaller Than the Current Number||86.6%|Easy||
+|1366|Rank Teams by Votes||58.6%|Medium||
+|1367|Linked List in Binary Tree||43.4%|Medium||
+|1368|Minimum Cost to Make at Least One Valid Path in a Grid||61.3%|Hard||
+|1369|Get the Second Most Recent Activity||69.6%|Hard||
+|1370|Increasing Decreasing String||77.5%|Easy||
+|1371|Find the Longest Substring Containing Vowels in Even Counts||63.0%|Medium||
+|1372|Longest ZigZag Path in a Binary Tree||59.6%|Medium||
+|1373|Maximum Sum BST in Binary Tree||39.2%|Hard||
+|1374|Generate a String With Characters That Have Odd Counts||77.5%|Easy||
+|1375|Number of Times Binary String Is Prefix-Aligned||65.9%|Medium||
+|1376|Time Needed to Inform All Employees||58.4%|Medium||
+|1377|Frog Position After T Seconds||36.1%|Hard||
+|1378|Replace Employee ID With The Unique Identifier||91.4%|Easy||
+|1379|Find a Corresponding Node of a Binary Tree in a Clone of That Tree||87.1%|Easy||
+|1380|Lucky Numbers in a Matrix|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1380.Lucky-Numbers-in-a-Matrix)|70.5%|Easy||
+|1381|Design a Stack With Increment Operation||77.4%|Medium||
+|1382|Balance a Binary Search Tree||80.7%|Medium||
+|1383|Maximum Performance of a Team|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1383.Maximum-Performance-of-a-Team)|49.0%|Hard||
+|1384|Total Sales Amount by Year||67.6%|Hard||
+|1385|Find the Distance Value Between Two Arrays|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1385.Find-the-Distance-Value-Between-Two-Arrays)|65.3%|Easy||
+|1386|Cinema Seat Allocation||40.9%|Medium||
+|1387|Sort Integers by The Power Value||69.9%|Medium||
+|1388|Pizza With 3n Slices||50.1%|Hard||
+|1389|Create Target Array in the Given Order|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1389.Create-Target-Array-in-the-Given-Order)|85.8%|Easy||
+|1390|Four Divisors||41.2%|Medium||
+|1391|Check if There is a Valid Path in a Grid||47.0%|Medium||
+|1392|Longest Happy Prefix||45.0%|Hard||
+|1393|Capital Gain/Loss||91.1%|Medium||
+|1394|Find Lucky Integer in an Array||63.5%|Easy||
+|1395|Count Number of Teams||68.3%|Medium||
+|1396|Design Underground System|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1396.Design-Underground-System)|73.7%|Medium||
+|1397|Find All Good Strings||42.1%|Hard||
+|1398|Customers Who Bought Products A and B but Not C||77.7%|Medium||
+|1399|Count Largest Group||67.2%|Easy||
+|1400|Construct K Palindrome Strings||63.3%|Medium||
+|1401|Circle and Rectangle Overlapping||44.2%|Medium||
+|1402|Reducing Dishes||72.0%|Hard||
+|1403|Minimum Subsequence in Non-Increasing Order||72.2%|Easy||
+|1404|Number of Steps to Reduce a Number in Binary Representation to One||52.0%|Medium||
+|1405|Longest Happy String||57.4%|Medium||
+|1406|Stone Game III||59.7%|Hard||
+|1407|Top Travellers||68.7%|Easy||
+|1408|String Matching in an Array||63.9%|Easy||
+|1409|Queries on a Permutation With Key||83.3%|Medium||
+|1410|HTML Entity Parser||52.1%|Medium||
+|1411|Number of Ways to Paint N × 3 Grid||62.3%|Hard||
+|1412|Find the Quiet Students in All Exams||63.0%|Hard||
+|1413|Minimum Value to Get Positive Step by Step Sum||68.4%|Easy||
+|1414|Find the Minimum Number of Fibonacci Numbers Whose Sum Is K||65.4%|Medium||
+|1415|The k-th Lexicographical String of All Happy Strings of Length n||72.0%|Medium||
+|1416|Restore The Array||38.4%|Hard||
+|1417|Reformat The String||55.8%|Easy||
+|1418|Display Table of Food Orders in a Restaurant||73.7%|Medium||
+|1419|Minimum Number of Frogs Croaking||49.9%|Medium||
+|1420|Build Array Where You Can Find The Maximum Exactly K Comparisons||63.6%|Hard||
+|1421|NPV Queries||84.1%|Easy||
+|1422|Maximum Score After Splitting a String||57.8%|Easy||
+|1423|Maximum Points You Can Obtain from Cards|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1423.Maximum-Points-You-Can-Obtain-from-Cards)|52.3%|Medium||
+|1424|Diagonal Traverse II||50.3%|Medium||
+|1425|Constrained Subsequence Sum||47.4%|Hard||
+|1426|Counting Elements||59.5%|Easy||
+|1427|Perform String Shifts||54.2%|Easy||
+|1428|Leftmost Column with at Least a One||53.0%|Medium||
+|1429|First Unique Number||52.7%|Medium||
+|1430|Check If a String Is a Valid Sequence from Root to Leaves Path in a Binary Tree||46.1%|Medium||
+|1431|Kids With the Greatest Number of Candies||87.5%|Easy||
+|1432|Max Difference You Can Get From Changing an Integer||43.0%|Medium||
+|1433|Check If a String Can Break Another String||68.8%|Medium||
+|1434|Number of Ways to Wear Different Hats to Each Other||42.8%|Hard||
+|1435|Create a Session Bar Chart||78.3%|Easy||
+|1436|Destination City||77.6%|Easy||
+|1437|Check If All 1's Are at Least Length K Places Away|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1437.Check-If-All-1s-Are-at-Least-Length-K-Places-Away)|59.2%|Easy||
+|1438|Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1438.Longest-Continuous-Subarray-With-Absolute-Diff-Less-Than-or-Equal-to-Limit)|48.0%|Medium||
+|1439|Find the Kth Smallest Sum of a Matrix With Sorted Rows|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1439.Find-the-Kth-Smallest-Sum-of-a-Matrix-With-Sorted-Rows)|61.4%|Hard||
+|1440|Evaluate Boolean Expression||76.5%|Medium||
+|1441|Build an Array With Stack Operations||71.3%|Medium||
+|1442|Count Triplets That Can Form Two Arrays of Equal XOR|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1442.Count-Triplets-That-Can-Form-Two-Arrays-of-Equal-XOR)|75.6%|Medium||
+|1443|Minimum Time to Collect All Apples in a Tree||56.0%|Medium||
+|1444|Number of Ways of Cutting a Pizza||58.6%|Hard||
+|1445|Apples & Oranges||91.3%|Medium||
+|1446|Consecutive Characters|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1446.Consecutive-Characters)|61.7%|Easy||
+|1447|Simplified Fractions||64.6%|Medium||
+|1448|Count Good Nodes in Binary Tree||74.6%|Medium||
+|1449|Form Largest Integer With Digits That Add up to Target||47.1%|Hard||
+|1450|Number of Students Doing Homework at a Given Time||75.9%|Easy||
+|1451|Rearrange Words in a Sentence||62.5%|Medium||
+|1452|People Whose List of Favorite Companies Is Not a Subset of Another List||56.8%|Medium||
+|1453|Maximum Number of Darts Inside of a Circular Dartboard||36.8%|Hard||
+|1454|Active Users||38.4%|Medium||
+|1455|Check If a Word Occurs As a Prefix of Any Word in a Sentence|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1455.Check-If-a-Word-Occurs-As-a-Prefix-of-Any-Word-in-a-Sentence)|64.2%|Easy||
+|1456|Maximum Number of Vowels in a Substring of Given Length||57.9%|Medium||
+|1457|Pseudo-Palindromic Paths in a Binary Tree||68.1%|Medium||
+|1458|Max Dot Product of Two Subsequences||46.2%|Hard||
+|1459|Rectangles Area||70.0%|Medium||
+|1460|Make Two Arrays Equal by Reversing Subarrays||72.2%|Easy||
+|1461|Check If a String Contains All Binary Codes of Size K|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1461.Check-If-a-String-Contains-All-Binary-Codes-of-Size-K)|56.8%|Medium||
+|1462|Course Schedule IV||48.9%|Medium||
+|1463|Cherry Pickup II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1463.Cherry-Pickup-II)|70.2%|Hard||
+|1464|Maximum Product of Two Elements in an Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1464.Maximum-Product-of-Two-Elements-in-an-Array)|79.2%|Easy||
+|1465|Maximum Area of a Piece of Cake After Horizontal and Vertical Cuts|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1465.Maximum-Area-of-a-Piece-of-Cake-After-Horizontal-and-Vertical-Cuts)|40.8%|Medium||
+|1466|Reorder Routes to Make All Paths Lead to the City Zero||61.8%|Medium||
+|1467|Probability of a Two Boxes Having The Same Number of Distinct Balls||60.8%|Hard||
+|1468|Calculate Salaries||81.9%|Medium||
+|1469|Find All The Lonely Nodes||81.7%|Easy||
+|1470|Shuffle the Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1470.Shuffle-the-Array)|88.5%|Easy||
+|1471|The k Strongest Values in an Array||60.1%|Medium||
+|1472|Design Browser History||76.1%|Medium||
+|1473|Paint House III||62.0%|Hard||
+|1474|Delete N Nodes After M Nodes of a Linked List||73.8%|Easy||
+|1475|Final Prices With a Special Discount in a Shop||75.4%|Easy||
+|1476|Subrectangle Queries||88.5%|Medium||
+|1477|Find Two Non-overlapping Sub-arrays Each With Target Sum||37.0%|Medium||
+|1478|Allocate Mailboxes||55.3%|Hard||
+|1479|Sales by Day of the Week||82.4%|Hard||
+|1480|Running Sum of 1d Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1480.Running-Sum-of-1d-Array)|89.8%|Easy||
+|1481|Least Number of Unique Integers after K Removals||57.2%|Medium||
+|1482|Minimum Number of Days to Make m Bouquets|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1482.Minimum-Number-of-Days-to-Make-m-Bouquets)|56.7%|Medium||
+|1483|Kth Ancestor of a Tree Node||33.8%|Hard||
+|1484|Group Sold Products By The Date||84.1%|Easy||
+|1485|Clone Binary Tree With Random Pointer||79.5%|Medium||
+|1486|XOR Operation in an Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1486.XOR-Operation-in-an-Array)|84.2%|Easy||
+|1487|Making File Names Unique||35.6%|Medium||
+|1488|Avoid Flood in The City||26.1%|Medium||
+|1489|Find Critical and Pseudo-Critical Edges in Minimum Spanning Tree||53.4%|Hard||
+|1490|Clone N-ary Tree||83.6%|Medium||
+|1491|Average Salary Excluding the Minimum and Maximum Salary||63.1%|Easy||
+|1492|The kth Factor of n||62.3%|Medium||
+|1493|Longest Subarray of 1's After Deleting One Element||60.1%|Medium||
+|1494|Parallel Courses II||31.1%|Hard||
+|1495|Friendly Movies Streamed Last Month||49.8%|Easy||
+|1496|Path Crossing||55.8%|Easy||
+|1497|Check If Array Pairs Are Divisible by k||39.8%|Medium||
+|1498|Number of Subsequences That Satisfy the Given Sum Condition||38.4%|Medium||
+|1499|Max Value of Equation||46.5%|Hard||
+|1500|Design a File Sharing System||44.9%|Medium||
+|1501|Countries You Can Safely Invest In||58.3%|Medium||
+|1502|Can Make Arithmetic Progression From Sequence||68.3%|Easy||
+|1503|Last Moment Before All Ants Fall Out of a Plank||55.2%|Medium||
+|1504|Count Submatrices With All Ones||57.9%|Medium||
+|1505|Minimum Possible Integer After at Most K Adjacent Swaps On Digits||38.1%|Hard||
+|1506|Find Root of N-Ary Tree||78.1%|Medium||
+|1507|Reformat Date||62.4%|Easy||
+|1508|Range Sum of Sorted Subarray Sums||59.4%|Medium||
+|1509|Minimum Difference Between Largest and Smallest Value in Three Moves||54.6%|Medium||
+|1510|Stone Game IV||60.6%|Hard||
+|1511|Customer Order Frequency||73.1%|Easy||
+|1512|Number of Good Pairs|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1512.Number-of-Good-Pairs)|88.2%|Easy||
+|1513|Number of Substrings With Only 1s||45.2%|Medium||
+|1514|Path with Maximum Probability||48.3%|Medium||
+|1515|Best Position for a Service Centre||38.4%|Hard||
+|1516|Move Sub-Tree of N-Ary Tree||63.9%|Hard||
+|1517|Find Users With Valid E-Mails||57.1%|Easy||
+|1518|Water Bottles|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1518.Water-Bottles)|60.3%|Easy||
+|1519|Number of Nodes in the Sub-Tree With the Same Label||40.9%|Medium||
+|1520|Maximum Number of Non-Overlapping Substrings||37.9%|Hard||
+|1521|Find a Value of a Mysterious Function Closest to Target||43.6%|Hard||
+|1522|Diameter of N-Ary Tree||73.4%|Medium||
+|1523|Count Odd Numbers in an Interval Range||46.4%|Easy||
+|1524|Number of Sub-arrays With Odd Sum||43.6%|Medium||
+|1525|Number of Good Ways to Split a String||69.5%|Medium||
+|1526|Minimum Number of Increments on Subarrays to Form a Target Array||68.6%|Hard||
+|1527|Patients With a Condition||42.9%|Easy||
+|1528|Shuffle String||85.7%|Easy||
+|1529|Minimum Suffix Flips||72.5%|Medium||
+|1530|Number of Good Leaf Nodes Pairs||60.5%|Medium||
+|1531|String Compression II||50.2%|Hard||
+|1532|The Most Recent Three Orders||71.1%|Medium||
+|1533|Find the Index of the Large Integer||50.7%|Medium||
+|1534|Count Good Triplets||80.8%|Easy||
+|1535|Find the Winner of an Array Game||48.8%|Medium||
+|1536|Minimum Swaps to Arrange a Binary Grid||46.4%|Medium||
+|1537|Get the Maximum Score||39.3%|Hard||
+|1538|Guess the Majority in a Hidden Array||63.0%|Medium||
+|1539|Kth Missing Positive Number|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1539.Kth-Missing-Positive-Number)|55.9%|Easy||
+|1540|Can Convert String in K Moves||33.1%|Medium||
+|1541|Minimum Insertions to Balance a Parentheses String||49.9%|Medium||
+|1542|Find Longest Awesome Substring||41.6%|Hard||
+|1543|Fix Product Name Format||62.4%|Easy||
+|1544|Make The String Great||57.0%|Easy||
+|1545|Find Kth Bit in Nth Binary String||58.2%|Medium||
+|1546|Maximum Number of Non-Overlapping Subarrays With Sum Equals Target||47.2%|Medium||
+|1547|Minimum Cost to Cut a Stick||56.8%|Hard||
+|1548|The Most Similar Path in a Graph||56.9%|Hard||
+|1549|The Most Recent Orders for Each Product||67.9%|Medium||
+|1550|Three Consecutive Odds||63.7%|Easy||
+|1551|Minimum Operations to Make Array Equal|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1551.Minimum-Operations-to-Make-Array-Equal)|81.1%|Medium||
+|1552|Magnetic Force Between Two Balls||56.8%|Medium||
+|1553|Minimum Number of Days to Eat N Oranges||34.4%|Hard||
+|1554|Strings Differ by One Character||43.6%|Medium||
+|1555|Bank Account Summary||53.0%|Medium||
+|1556|Thousand Separator||55.1%|Easy||
+|1557|Minimum Number of Vertices to Reach All Nodes||79.6%|Medium||
+|1558|Minimum Numbers of Function Calls to Make Target Array||64.3%|Medium||
+|1559|Detect Cycles in 2D Grid||48.1%|Medium||
+|1560|Most Visited Sector in a Circular Track||58.4%|Easy||
+|1561|Maximum Number of Coins You Can Get||78.6%|Medium||
+|1562|Find Latest Group of Size M||42.4%|Medium||
+|1563|Stone Game V||40.6%|Hard||
+|1564|Put Boxes Into the Warehouse I||67.1%|Medium||
+|1565|Unique Orders and Customers Per Month||83.6%|Easy||
+|1566|Detect Pattern of Length M Repeated K or More Times||43.6%|Easy||
+|1567|Maximum Length of Subarray With Positive Product||43.7%|Medium||
+|1568|Minimum Number of Days to Disconnect Island||47.1%|Hard||
+|1569|Number of Ways to Reorder Array to Get Same BST||48.2%|Hard||
+|1570|Dot Product of Two Sparse Vectors||90.4%|Medium||
+|1571|Warehouse Manager||90.1%|Easy||
+|1572|Matrix Diagonal Sum|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1572.Matrix-Diagonal-Sum)|79.7%|Easy||
+|1573|Number of Ways to Split a String|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1573.Number-of-Ways-to-Split-a-String)|32.4%|Medium||
+|1574|Shortest Subarray to be Removed to Make Array Sorted||36.5%|Medium||
+|1575|Count All Possible Routes||56.9%|Hard||
+|1576|Replace All ?'s to Avoid Consecutive Repeating Characters|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1576.Replace-All-s-to-Avoid-Consecutive-Repeating-Characters)|49.2%|Easy||
+|1577|Number of Ways Where Square of Number Is Equal to Product of Two Numbers||39.9%|Medium||
+|1578|Minimum Time to Make Rope Colorful||63.7%|Medium||
+|1579|Remove Max Number of Edges to Keep Graph Fully Traversable|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1579.Remove-Max-Number-of-Edges-to-Keep-Graph-Fully-Traversable)|52.7%|Hard||
+|1580|Put Boxes Into the Warehouse II||63.5%|Medium||
+|1581|Customer Who Visited but Did Not Make Any Transactions||89.0%|Easy||
+|1582|Special Positions in a Binary Matrix||65.3%|Easy||
+|1583|Count Unhappy Friends||59.8%|Medium||
+|1584|Min Cost to Connect All Points||64.3%|Medium||
+|1585|Check If String Is Transformable With Substring Sort Operations||48.4%|Hard||
+|1586|Binary Search Tree Iterator II||70.8%|Medium||
+|1587|Bank Account Summary II||90.2%|Easy||
+|1588|Sum of All Odd Length Subarrays||83.6%|Easy||
+|1589|Maximum Sum Obtained of Any Permutation||37.0%|Medium||
+|1590|Make Sum Divisible by P||28.1%|Medium||
+|1591|Strange Printer II||58.4%|Hard||
+|1592|Rearrange Spaces Between Words||43.8%|Easy||
+|1593|Split a String Into the Max Number of Unique Substrings||55.1%|Medium||
+|1594|Maximum Non Negative Product in a Matrix||33.1%|Medium||
+|1595|Minimum Cost to Connect Two Groups of Points||46.3%|Hard||
+|1596|The Most Frequently Ordered Products for Each Customer||85.1%|Medium||
+|1597|Build Binary Expression Tree From Infix Expression||62.2%|Hard||
+|1598|Crawler Log Folder||64.3%|Easy||
+|1599|Maximum Profit of Operating a Centennial Wheel||43.7%|Medium||
+|1600|Throne Inheritance|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1600.Throne-Inheritance)|63.6%|Medium||
+|1601|Maximum Number of Achievable Transfer Requests||51.3%|Hard||
+|1602|Find Nearest Right Node in Binary Tree||75.3%|Medium||
+|1603|Design Parking System|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1603.Design-Parking-System)|88.1%|Easy||
+|1604|Alert Using Same Key-Card Three or More Times in a One Hour Period||47.4%|Medium||
+|1605|Find Valid Matrix Given Row and Column Sums||78.1%|Medium||
+|1606|Find Servers That Handled Most Number of Requests||42.8%|Hard||
+|1607|Sellers With No Sales||55.3%|Easy||
+|1608|Special Array With X Elements Greater Than or Equal X|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1608.Special-Array-With-X-Elements-Greater-Than-or-Equal-X)|60.0%|Easy||
+|1609|Even Odd Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1609.Even-Odd-Tree)|53.6%|Medium||
+|1610|Maximum Number of Visible Points||37.4%|Hard||
+|1611|Minimum One Bit Operations to Make Integers Zero||63.2%|Hard||
+|1612|Check If Two Expression Trees are Equivalent||69.9%|Medium||
+|1613|Find the Missing IDs||75.9%|Medium||
+|1614|Maximum Nesting Depth of the Parentheses|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1614.Maximum-Nesting-Depth-of-the-Parentheses)|82.7%|Easy||
+|1615|Maximal Network Rank||58.1%|Medium||
+|1616|Split Two Strings to Make Palindrome||31.3%|Medium||
+|1617|Count Subtrees With Max Distance Between Cities||65.9%|Hard||
+|1618|Maximum Font to Fit a Sentence in a Screen||59.1%|Medium||
+|1619|Mean of Array After Removing Some Elements|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1619.Mean-of-Array-After-Removing-Some-Elements)|64.6%|Easy||
+|1620|Coordinate With Maximum Network Quality||37.3%|Medium||
+|1621|Number of Sets of K Non-Overlapping Line Segments||42.3%|Medium||
+|1622|Fancy Sequence||16.1%|Hard||
+|1623|All Valid Triplets That Can Represent a Country||88.0%|Easy||
+|1624|Largest Substring Between Two Equal Characters|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1624.Largest-Substring-Between-Two-Equal-Characters)|59.0%|Easy||
+|1625|Lexicographically Smallest String After Applying Operations||66.0%|Medium||
+|1626|Best Team With No Conflicts||41.1%|Medium||
+|1627|Graph Connectivity With Threshold||45.5%|Hard||
+|1628|Design an Expression Tree With Evaluate Function||82.7%|Medium||
+|1629|Slowest Key|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1629.Slowest-Key)|59.4%|Easy||
+|1630|Arithmetic Subarrays||79.9%|Medium||
+|1631|Path With Minimum Effort|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1631.Path-With-Minimum-Effort)|55.3%|Medium||
+|1632|Rank Transform of a Matrix||41.0%|Hard||
+|1633|Percentage of Users Attended a Contest||68.8%|Easy||
+|1634|Add Two Polynomials Represented as Linked Lists||53.4%|Medium||
+|1635|Hopper Company Queries I||53.0%|Hard||
+|1636|Sort Array by Increasing Frequency|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1636.Sort-Array-by-Increasing-Frequency)|68.6%|Easy||
+|1637|Widest Vertical Area Between Two Points Containing No Points||84.2%|Medium||
+|1638|Count Substrings That Differ by One Character||71.5%|Medium||
+|1639|Number of Ways to Form a Target String Given a Dictionary||42.9%|Hard||
+|1640|Check Array Formation Through Concatenation|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1640.Check-Array-Formation-Through-Concatenation)|56.1%|Easy||
+|1641|Count Sorted Vowel Strings|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1641.Count-Sorted-Vowel-Strings)|77.3%|Medium||
+|1642|Furthest Building You Can Reach|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1642.Furthest-Building-You-Can-Reach)|48.3%|Medium||
+|1643|Kth Smallest Instructions||46.3%|Hard||
+|1644|Lowest Common Ancestor of a Binary Tree II||59.3%|Medium||
+|1645|Hopper Company Queries II||38.8%|Hard||
+|1646|Get Maximum in Generated Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1646.Get-Maximum-in-Generated-Array)|50.2%|Easy||
+|1647|Minimum Deletions to Make Character Frequencies Unique|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1647.Minimum-Deletions-to-Make-Character-Frequencies-Unique)|59.2%|Medium||
+|1648|Sell Diminishing-Valued Colored Balls|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1648.Sell-Diminishing-Valued-Colored-Balls)|30.6%|Medium||
+|1649|Create Sorted Array through Instructions|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1649.Create-Sorted-Array-through-Instructions)|37.2%|Hard||
+|1650|Lowest Common Ancestor of a Binary Tree III||77.3%|Medium||
+|1651|Hopper Company Queries III||68.0%|Hard||
+|1652|Defuse the Bomb|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1652.Defuse-the-Bomb)|61.1%|Easy||
+|1653|Minimum Deletions to Make String Balanced|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1653.Minimum-Deletions-to-Make-String-Balanced)|58.7%|Medium||
+|1654|Minimum Jumps to Reach Home|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1654.Minimum-Jumps-to-Reach-Home)|28.6%|Medium||
+|1655|Distribute Repeating Integers|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1655.Distribute-Repeating-Integers)|39.7%|Hard||
+|1656|Design an Ordered Stream|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1656.Design-an-Ordered-Stream)|85.3%|Easy||
+|1657|Determine if Two Strings Are Close|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1657.Determine-if-Two-Strings-Are-Close)|54.2%|Medium||
+|1658|Minimum Operations to Reduce X to Zero|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1658.Minimum-Operations-to-Reduce-X-to-Zero)|37.6%|Medium||
+|1659|Maximize Grid Happiness|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1659.Maximize-Grid-Happiness)|38.4%|Hard||
+|1660|Correct a Binary Tree||72.5%|Medium||
+|1661|Average Time of Process per Machine||79.4%|Easy||
+|1662|Check If Two String Arrays are Equivalent|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1662.Check-If-Two-String-Arrays-are-Equivalent)|81.8%|Easy||
+|1663|Smallest String With A Given Numeric Value|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1663.Smallest-String-With-A-Given-Numeric-Value)|67.0%|Medium||
+|1664|Ways to Make a Fair Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1664.Ways-to-Make-a-Fair-Array)|63.6%|Medium||
+|1665|Minimum Initial Energy to Finish Tasks|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1665.Minimum-Initial-Energy-to-Finish-Tasks)|56.2%|Hard||
+|1666|Change the Root of a Binary Tree||69.4%|Medium||
+|1667|Fix Names in a Table||66.8%|Easy||
+|1668|Maximum Repeating Substring|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1668.Maximum-Repeating-Substring)|39.6%|Easy||
+|1669|Merge In Between Linked Lists|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1669.Merge-In-Between-Linked-Lists)|74.5%|Medium||
+|1670|Design Front Middle Back Queue|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1670.Design-Front-Middle-Back-Queue)|56.4%|Medium||
+|1671|Minimum Number of Removals to Make Mountain Array||42.6%|Hard||
+|1672|Richest Customer Wealth|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1672.Richest-Customer-Wealth)|88.4%|Easy||
+|1673|Find the Most Competitive Subsequence|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1673.Find-the-Most-Competitive-Subsequence)|49.3%|Medium||
+|1674|Minimum Moves to Make Array Complementary|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1674.Minimum-Moves-to-Make-Array-Complementary)|38.5%|Medium||
+|1675|Minimize Deviation in Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1675.Minimize-Deviation-in-Array)|52.1%|Hard||
+|1676|Lowest Common Ancestor of a Binary Tree IV||79.3%|Medium||
+|1677|Product's Worth Over Invoices||39.4%|Easy||
+|1678|Goal Parser Interpretation|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1678.Goal-Parser-Interpretation)|86.0%|Easy||
+|1679|Max Number of K-Sum Pairs|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1679.Max-Number-of-K-Sum-Pairs)|57.4%|Medium||
+|1680|Concatenation of Consecutive Binary Numbers|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1680.Concatenation-of-Consecutive-Binary-Numbers)|57.0%|Medium||
+|1681|Minimum Incompatibility|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1681.Minimum-Incompatibility)|37.3%|Hard||
+|1682|Longest Palindromic Subsequence II||49.7%|Medium||
+|1683|Invalid Tweets||91.0%|Easy||
+|1684|Count the Number of Consistent Strings|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1684.Count-the-Number-of-Consistent-Strings)|81.8%|Easy||
+|1685|Sum of Absolute Differences in a Sorted Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1685.Sum-of-Absolute-Differences-in-a-Sorted-Array)|65.3%|Medium||
+|1686|Stone Game VI||54.3%|Medium||
+|1687|Delivering Boxes from Storage to Ports||38.2%|Hard||
+|1688|Count of Matches in Tournament|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1688.Count-of-Matches-in-Tournament)|83.1%|Easy||
+|1689|Partitioning Into Minimum Number Of Deci-Binary Numbers|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1689.Partitioning-Into-Minimum-Number-Of-Deci-Binary-Numbers)|89.7%|Medium||
+|1690|Stone Game VII|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1690.Stone-Game-VII)|58.7%|Medium||
+|1691|Maximum Height by Stacking Cuboids|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1691.Maximum-Height-by-Stacking-Cuboids)|54.2%|Hard||
+|1692|Count Ways to Distribute Candies||62.0%|Hard||
+|1693|Daily Leads and Partners||90.4%|Easy||
+|1694|Reformat Phone Number|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1694.Reformat-Phone-Number)|64.7%|Easy||
+|1695|Maximum Erasure Value|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1695.Maximum-Erasure-Value)|57.7%|Medium||
+|1696|Jump Game VI|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1696.Jump-Game-VI)|46.3%|Medium||
+|1697|Checking Existence of Edge Length Limited Paths||50.5%|Hard||
+|1698|Number of Distinct Substrings in a String||63.1%|Medium||
+|1699|Number of Calls Between Two Persons||85.8%|Medium||
+|1700|Number of Students Unable to Eat Lunch|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1700.Number-of-Students-Unable-to-Eat-Lunch)|67.7%|Easy||
+|1701|Average Waiting Time||62.3%|Medium||
+|1702|Maximum Binary String After Change||46.1%|Medium||
+|1703|Minimum Adjacent Swaps for K Consecutive Ones||41.3%|Hard||
+|1704|Determine if String Halves Are Alike|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1704.Determine-if-String-Halves-Are-Alike)|77.4%|Easy||
+|1705|Maximum Number of Eaten Apples|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1705.Maximum-Number-of-Eaten-Apples)|37.9%|Medium||
+|1706|Where Will the Ball Fall||65.8%|Medium||
+|1707|Maximum XOR With an Element From Array||44.3%|Hard||
+|1708|Largest Subarray Length K||63.5%|Easy||
+|1709|Biggest Window Between Visits||77.8%|Medium||
+|1710|Maximum Units on a Truck|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1710.Maximum-Units-on-a-Truck)|74.0%|Easy||
+|1711|Count Good Meals||29.0%|Medium||
+|1712|Ways to Split Array Into Three Subarrays||32.4%|Medium||
+|1713|Minimum Operations to Make a Subsequence||49.2%|Hard||
+|1714|Sum Of Special Evenly-Spaced Elements In Array||49.8%|Hard||
+|1715|Count Apples and Oranges||77.8%|Medium||
+|1716|Calculate Money in Leetcode Bank|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1716.Calculate-Money-in-Leetcode-Bank)|65.0%|Easy||
+|1717|Maximum Score From Removing Substrings||46.0%|Medium||
+|1718|Construct the Lexicographically Largest Valid Sequence||51.7%|Medium||
+|1719|Number Of Ways To Reconstruct A Tree||42.5%|Hard||
+|1720|Decode XORed Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1720.Decode-XORed-Array)|86.0%|Easy||
+|1721|Swapping Nodes in a Linked List|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1721.Swapping-Nodes-in-a-Linked-List)|67.8%|Medium||
+|1722|Minimize Hamming Distance After Swap Operations||48.6%|Medium||
+|1723|Find Minimum Time to Finish All Jobs||42.7%|Hard||
+|1724|Checking Existence of Edge Length Limited Paths II||51.3%|Hard||
+|1725|Number Of Rectangles That Can Form The Largest Square|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1725.Number-Of-Rectangles-That-Can-Form-The-Largest-Square)|78.7%|Easy||
+|1726|Tuple with Same Product||60.7%|Medium||
+|1727|Largest Submatrix With Rearrangements||60.8%|Medium||
+|1728|Cat and Mouse II||40.5%|Hard||
+|1729|Find Followers Count||71.6%|Easy||
+|1730|Shortest Path to Get Food||54.0%|Medium||
+|1731|The Number of Employees Which Report to Each Employee||51.1%|Easy||
+|1732|Find the Highest Altitude|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1732.Find-the-Highest-Altitude)|78.7%|Easy||
+|1733|Minimum Number of People to Teach||41.6%|Medium||
+|1734|Decode XORed Permutation|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1734.Decode-XORed-Permutation)|62.2%|Medium||
+|1735|Count Ways to Make Array With Product||49.2%|Hard||
+|1736|Latest Time by Replacing Hidden Digits|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1736.Latest-Time-by-Replacing-Hidden-Digits)|42.2%|Easy||
+|1737|Change Minimum Characters to Satisfy One of Three Conditions||35.2%|Medium||
+|1738|Find Kth Largest XOR Coordinate Value|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1738.Find-Kth-Largest-XOR-Coordinate-Value)|61.6%|Medium||
+|1739|Building Boxes||51.7%|Hard||
+|1740|Find Distance in a Binary Tree||68.7%|Medium||
+|1741|Find Total Time Spent by Each Employee||92.0%|Easy||
+|1742|Maximum Number of Balls in a Box|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1742.Maximum-Number-of-Balls-in-a-Box)|73.9%|Easy||
+|1743|Restore the Array From Adjacent Pairs||68.7%|Medium||
+|1744|Can You Eat Your Favorite Candy on Your Favorite Day?|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1744.Can-You-Eat-Your-Favorite-Candy-on-Your-Favorite-Day)|32.8%|Medium||
+|1745|Palindrome Partitioning IV||46.3%|Hard||
+|1746|Maximum Subarray Sum After One Operation||62.2%|Medium||
+|1747|Leetflex Banned Accounts||68.2%|Medium||
+|1748|Sum of Unique Elements|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1748.Sum-of-Unique-Elements)|75.6%|Easy||
+|1749|Maximum Absolute Sum of Any Subarray||58.2%|Medium||
+|1750|Minimum Length of String After Deleting Similar Ends||43.6%|Medium||
+|1751|Maximum Number of Events That Can Be Attended II||55.8%|Hard||
+|1752|Check if Array Is Sorted and Rotated|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1752.Check-if-Array-Is-Sorted-and-Rotated)|49.2%|Easy||
+|1753|Maximum Score From Removing Stones||66.1%|Medium||
+|1754|Largest Merge Of Two Strings||45.0%|Medium||
+|1755|Closest Subsequence Sum||36.6%|Hard||
+|1756|Design Most Recently Used Queue||79.0%|Medium||
+|1757|Recyclable and Low Fat Products||93.9%|Easy||
+|1758|Minimum Changes To Make Alternating Binary String|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1758.Minimum-Changes-To-Make-Alternating-Binary-String)|58.3%|Easy||
+|1759|Count Number of Homogenous Substrings||47.8%|Medium||
+|1760|Minimum Limit of Balls in a Bag||60.3%|Medium||
+|1761|Minimum Degree of a Connected Trio in a Graph||41.7%|Hard||
+|1762|Buildings With an Ocean View||79.2%|Medium||
+|1763|Longest Nice Substring|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1763.Longest-Nice-Substring)|61.7%|Easy||
+|1764|Form Array by Concatenating Subarrays of Another Array||52.7%|Medium||
+|1765|Map of Highest Peak||60.3%|Medium||
+|1766|Tree of Coprimes||38.5%|Hard||
+|1767|Find the Subtasks That Did Not Execute||84.7%|Hard||
+|1768|Merge Strings Alternately||75.9%|Easy||
+|1769|Minimum Number of Operations to Move All Balls to Each Box||85.4%|Medium||
+|1770|Maximum Score from Performing Multiplication Operations||36.3%|Hard||
+|1771|Maximize Palindrome Length From Subsequences||35.2%|Hard||
+|1772|Sort Features by Popularity||65.1%|Medium||
+|1773|Count Items Matching a Rule||84.3%|Easy||
+|1774|Closest Dessert Cost||46.7%|Medium||
+|1775|Equal Sum Arrays With Minimum Number of Operations||52.6%|Medium||
+|1776|Car Fleet II||53.3%|Hard||
+|1777|Product's Price for Each Store||85.4%|Easy||
+|1778|Shortest Path in a Hidden Grid||39.7%|Medium||
+|1779|Find Nearest Point That Has the Same X or Y Coordinate||67.2%|Easy||
+|1780|Check if Number is a Sum of Powers of Three||65.3%|Medium||
+|1781|Sum of Beauty of All Substrings||60.4%|Medium||
+|1782|Count Pairs Of Nodes||37.9%|Hard||
+|1783|Grand Slam Titles||88.9%|Medium||
+|1784|Check if Binary String Has at Most One Segment of Ones||40.5%|Easy||
+|1785|Minimum Elements to Add to Form a Given Sum||42.4%|Medium||
+|1786|Number of Restricted Paths From First to Last Node||39.2%|Medium||
+|1787|Make the XOR of All Segments Equal to Zero||39.5%|Hard||
+|1788|Maximize the Beauty of the Garden||66.4%|Hard||
+|1789|Primary Department for Each Employee||80.0%|Easy||
+|1790|Check if One String Swap Can Make Strings Equal||45.6%|Easy||
+|1791|Find Center of Star Graph|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1791.Find-Center-of-Star-Graph)|83.6%|Easy||
+|1792|Maximum Average Pass Ratio||51.9%|Medium||
+|1793|Maximum Score of a Good Subarray||53.2%|Hard||
+|1794|Count Pairs of Equal Substrings With Minimum Difference||65.2%|Medium||
+|1795|Rearrange Products Table||90.4%|Easy||
+|1796|Second Largest Digit in a String||49.0%|Easy||
+|1797|Design Authentication Manager||56.1%|Medium||
+|1798|Maximum Number of Consecutive Values You Can Make||54.1%|Medium||
+|1799|Maximize Score After N Operations||45.7%|Hard||
+|1800|Maximum Ascending Subarray Sum||63.8%|Easy||
+|1801|Number of Orders in the Backlog||47.2%|Medium||
+|1802|Maximum Value at a Given Index in a Bounded Array||31.8%|Medium||
+|1803|Count Pairs With XOR in a Range||46.8%|Hard||
+|1804|Implement Trie II (Prefix Tree)||59.8%|Medium||
+|1805|Number of Different Integers in a String||36.1%|Easy||
+|1806|Minimum Number of Operations to Reinitialize a Permutation||71.3%|Medium||
+|1807|Evaluate the Bracket Pairs of a String||66.7%|Medium||
+|1808|Maximize Number of Nice Divisors||31.2%|Hard||
+|1809|Ad-Free Sessions||60.0%|Easy||
+|1810|Minimum Path Cost in a Hidden Grid||53.8%|Medium||
+|1811|Find Interview Candidates||65.3%|Medium||
+|1812|Determine Color of a Chessboard Square||77.4%|Easy||
+|1813|Sentence Similarity III||33.0%|Medium||
+|1814|Count Nice Pairs in an Array||41.9%|Medium||
+|1815|Maximum Number of Groups Getting Fresh Donuts||40.1%|Hard||
+|1816|Truncate Sentence|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1816.Truncate-Sentence)|81.9%|Easy||
+|1817|Finding the Users Active Minutes||80.7%|Medium||
+|1818|Minimum Absolute Sum Difference|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1818.Minimum-Absolute-Sum-Difference)|30.1%|Medium||
+|1819|Number of Different Subsequences GCDs||37.9%|Hard||
+|1820|Maximum Number of Accepted Invitations||49.7%|Medium||
+|1821|Find Customers With Positive Revenue this Year||89.4%|Easy||
+|1822|Sign of the Product of an Array||66.3%|Easy||
+|1823|Find the Winner of the Circular Game||77.7%|Medium||
+|1824|Minimum Sideway Jumps||49.8%|Medium||
+|1825|Finding MK Average||35.1%|Hard||
+|1826|Faulty Sensor||49.5%|Easy||
+|1827|Minimum Operations to Make the Array Increasing||78.2%|Easy||
+|1828|Queries on Number of Points Inside a Circle||86.5%|Medium||
+|1829|Maximum XOR for Each Query||77.0%|Medium||
+|1830|Minimum Number of Operations to Make String Sorted||49.2%|Hard||
+|1831|Maximum Transaction Each Day||84.3%|Medium||
+|1832|Check if the Sentence Is Pangram||83.9%|Easy||
+|1833|Maximum Ice Cream Bars||65.5%|Medium||
+|1834|Single-Threaded CPU||41.9%|Medium||
+|1835|Find XOR Sum of All Pairs Bitwise AND||60.0%|Hard||
+|1836|Remove Duplicates From an Unsorted Linked List||69.3%|Medium||
+|1837|Sum of Digits in Base K||76.8%|Easy||
+|1838|Frequency of the Most Frequent Element||38.3%|Medium||
+|1839|Longest Substring Of All Vowels in Order||48.5%|Medium||
+|1840|Maximum Building Height||35.3%|Hard||
+|1841|League Statistics||57.4%|Medium||
+|1842|Next Palindrome Using Same Digits||53.6%|Hard||
+|1843|Suspicious Bank Accounts||48.0%|Medium||
+|1844|Replace All Digits with Characters||79.7%|Easy||
+|1845|Seat Reservation Manager||64.2%|Medium||
+|1846|Maximum Element After Decreasing and Rearranging|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1846.Maximum-Element-After-Decreasing-and-Rearranging)|59.1%|Medium||
+|1847|Closest Room||35.1%|Hard||
+|1848|Minimum Distance to the Target Element||58.6%|Easy||
+|1849|Splitting a String Into Descending Consecutive Values||32.1%|Medium||
+|1850|Minimum Adjacent Swaps to Reach the Kth Smallest Number||72.0%|Medium||
+|1851|Minimum Interval to Include Each Query||47.7%|Hard||
+|1852|Distinct Numbers in Each Subarray||71.5%|Medium||
+|1853|Convert Date Format||88.0%|Easy||
+|1854|Maximum Population Year||59.8%|Easy||
+|1855|Maximum Distance Between a Pair of Values||52.6%|Medium||
+|1856|Maximum Subarray Min-Product||37.7%|Medium||
+|1857|Largest Color Value in a Directed Graph||40.6%|Hard||
+|1858|Longest Word With All Prefixes||66.3%|Medium||
+|1859|Sorting the Sentence||84.4%|Easy||
+|1860|Incremental Memory Leak||71.6%|Medium||
+|1861|Rotating the Box||64.7%|Medium||
+|1862|Sum of Floored Pairs||28.3%|Hard||
+|1863|Sum of All Subset XOR Totals||79.0%|Easy||
+|1864|Minimum Number of Swaps to Make the Binary String Alternating||42.0%|Medium||
+|1865|Finding Pairs With a Certain Sum||50.3%|Medium||
+|1866|Number of Ways to Rearrange Sticks With K Sticks Visible||55.4%|Hard||
+|1867|Orders With Maximum Quantity Above Average||75.9%|Medium||
+|1868|Product of Two Run-Length Encoded Arrays||57.8%|Medium||
+|1869|Longer Contiguous Segments of Ones than Zeros||60.2%|Easy||
+|1870|Minimum Speed to Arrive on Time||37.3%|Medium||
+|1871|Jump Game VII||25.1%|Medium||
+|1872|Stone Game VIII||52.4%|Hard||
+|1873|Calculate Special Bonus||64.7%|Easy||
+|1874|Minimize Product Sum of Two Arrays||90.4%|Medium||
+|1875|Group Employees of the Same Salary||75.6%|Medium||
+|1876|Substrings of Size Three with Distinct Characters||70.2%|Easy||
+|1877|Minimize Maximum Pair Sum in Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1877.Minimize-Maximum-Pair-Sum-in-Array)|80.4%|Medium||
+|1878|Get Biggest Three Rhombus Sums in a Grid||46.4%|Medium||
+|1879|Minimum XOR Sum of Two Arrays||44.6%|Hard||
+|1880|Check if Word Equals Summation of Two Words||73.6%|Easy||
+|1881|Maximum Value after Insertion||36.5%|Medium||
+|1882|Process Tasks Using Servers||39.5%|Medium||
+|1883|Minimum Skips to Arrive at Meeting On Time||38.5%|Hard||
+|1884|Egg Drop With 2 Eggs and N Floors||70.3%|Medium||
+|1885|Count Pairs in Two Arrays||59.2%|Medium||
+|1886|Determine Whether Matrix Can Be Obtained By Rotation||55.3%|Easy||
+|1887|Reduction Operations to Make the Array Elements Equal||62.3%|Medium||
+|1888|Minimum Number of Flips to Make the Binary String Alternating||37.8%|Medium||
+|1889|Minimum Space Wasted From Packaging||30.6%|Hard||
+|1890|The Latest Login in 2020||81.8%|Easy||
+|1891|Cutting Ribbons||48.1%|Medium||
+|1892|Page Recommendations II||44.8%|Hard||
+|1893|Check if All the Integers in a Range Are Covered||50.8%|Easy||
+|1894|Find the Student that Will Replace the Chalk||43.6%|Medium||
+|1895|Largest Magic Square||51.9%|Medium||
+|1896|Minimum Cost to Change the Final Value of Expression||54.9%|Hard||
+|1897|Redistribute Characters to Make All Strings Equal||60.0%|Easy||
+|1898|Maximum Number of Removable Characters||39.2%|Medium||
+|1899|Merge Triplets to Form Target Triplet||64.3%|Medium||
+|1900|The Earliest and Latest Rounds Where Players Compete||51.8%|Hard||
+|1901|Find a Peak Element II||53.3%|Medium||
+|1902|Depth of BST Given Insertion Order||45.0%|Medium||
+|1903|Largest Odd Number in String||55.7%|Easy||
+|1904|The Number of Full Rounds You Have Played||45.7%|Medium||
+|1905|Count Sub Islands||67.9%|Medium||
+|1906|Minimum Absolute Difference Queries||43.9%|Medium||
+|1907|Count Salary Categories||64.6%|Medium||
+|1908|Game of Nim||57.3%|Medium||
+|1909|Remove One Element to Make the Array Strictly Increasing||26.0%|Easy||
+|1910|Remove All Occurrences of a Substring||74.0%|Medium||
+|1911|Maximum Alternating Subsequence Sum||59.2%|Medium||
+|1912|Design Movie Rental System||41.2%|Hard||
+|1913|Maximum Product Difference Between Two Pairs||81.4%|Easy||
+|1914|Cyclically Rotating a Grid||48.0%|Medium||
+|1915|Number of Wonderful Substrings||44.8%|Medium||
+|1916|Count Ways to Build Rooms in an Ant Colony||48.7%|Hard||
+|1917|Leetcodify Friends Recommendations||28.9%|Hard||
+|1918|Kth Smallest Subarray Sum||52.9%|Medium||
+|1919|Leetcodify Similar Friends||43.2%|Hard||
+|1920|Build Array from Permutation||91.5%|Easy||
+|1921|Eliminate Maximum Number of Monsters||37.8%|Medium||
+|1922|Count Good Numbers||38.5%|Medium||
+|1923|Longest Common Subpath||27.6%|Hard||
+|1924|Erect the Fence II||53.9%|Hard||
+|1925|Count Square Sum Triples||67.9%|Easy||
+|1926|Nearest Exit from Entrance in Maze||43.1%|Medium||
+|1927|Sum Game||47.0%|Medium||
+|1928|Minimum Cost to Reach Destination in Time||37.6%|Hard||
+|1929|Concatenation of Array||91.5%|Easy||
+|1930|Unique Length-3 Palindromic Subsequences||51.8%|Medium||
+|1931|Painting a Grid With Three Different Colors||57.3%|Hard||
+|1932|Merge BSTs to Create Single BST||35.3%|Hard||
+|1933|Check if String Is Decomposable Into Value-Equal Substrings||50.4%|Easy||
+|1934|Confirmation Rate||77.8%|Medium||
+|1935|Maximum Number of Words You Can Type||71.0%|Easy||
+|1936|Add Minimum Number of Rungs||42.8%|Medium||
+|1937|Maximum Number of Points with Cost||36.2%|Medium||
+|1938|Maximum Genetic Difference Query||39.5%|Hard||
+|1939|Users That Actively Request Confirmation Messages||61.7%|Easy||
+|1940|Longest Common Subsequence Between Sorted Arrays||79.4%|Medium||
+|1941|Check if All Characters Have Equal Number of Occurrences||76.9%|Easy||
+|1942|The Number of the Smallest Unoccupied Chair||40.4%|Medium||
+|1943|Describe the Painting||47.8%|Medium||
+|1944|Number of Visible People in a Queue||69.9%|Hard||
+|1945|Sum of Digits of String After Convert||61.1%|Easy||
+|1946|Largest Number After Mutating Substring||34.5%|Medium||
+|1947|Maximum Compatibility Score Sum||60.9%|Medium||
+|1948|Delete Duplicate Folders in System||58.0%|Hard||
+|1949|Strong Friendship||58.7%|Medium||
+|1950|Maximum of Minimum Values in All Subarrays||50.0%|Medium||
+|1951|All the Pairs With the Maximum Number of Common Followers||72.9%|Medium||
+|1952|Three Divisors||57.0%|Easy||
+|1953|Maximum Number of Weeks for Which You Can Work||39.0%|Medium||
+|1954|Minimum Garden Perimeter to Collect Enough Apples||53.0%|Medium||
+|1955|Count Number of Special Subsequences||51.3%|Hard||
+|1956|Minimum Time For K Virus Variants to Spread||46.5%|Hard||
+|1957|Delete Characters to Make Fancy String||56.6%|Easy||
+|1958|Check if Move is Legal||44.2%|Medium||
+|1959|Minimum Total Space Wasted With K Resizing Operations||41.9%|Medium||
+|1960|Maximum Product of the Length of Two Palindromic Substrings||29.6%|Hard||
+|1961|Check If String Is a Prefix of Array||54.2%|Easy||
+|1962|Remove Stones to Minimize the Total||58.8%|Medium||
+|1963|Minimum Number of Swaps to Make the String Balanced||68.3%|Medium||
+|1964|Find the Longest Valid Obstacle Course at Each Position||46.9%|Hard||
+|1965|Employees With Missing Information||81.1%|Easy||
+|1966|Binary Searchable Numbers in an Unsorted Array||65.5%|Medium||
+|1967|Number of Strings That Appear as Substrings in Word||79.9%|Easy||
+|1968|Array With Elements Not Equal to Average of Neighbors||49.4%|Medium||
+|1969|Minimum Non-Zero Product of the Array Elements||33.7%|Medium||
+|1970|Last Day Where You Can Still Cross||49.5%|Hard||
+|1971|Find if Path Exists in Graph||50.5%|Easy||
+|1972|First and Last Call On the Same Day||54.4%|Hard||
+|1973|Count Nodes Equal to Sum of Descendants||75.3%|Medium||
+|1974|Minimum Time to Type Word Using Special Typewriter||71.5%|Easy||
+|1975|Maximum Matrix Sum||45.6%|Medium||
+|1976|Number of Ways to Arrive at Destination||32.4%|Medium||
+|1977|Number of Ways to Separate Numbers||21.2%|Hard||
+|1978|Employees Whose Manager Left the Company||50.5%|Easy||
+|1979|Find Greatest Common Divisor of Array||76.8%|Easy||
+|1980|Find Unique Binary String||64.2%|Medium||
+|1981|Minimize the Difference Between Target and Chosen Elements||32.4%|Medium||
+|1982|Find Array Given Subset Sums||48.7%|Hard||
+|1983|Widest Pair of Indices With Equal Range Sum||53.1%|Medium||
+|1984|Minimum Difference Between Highest and Lowest of K Scores|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1984.Minimum-Difference-Between-Highest-and-Lowest-of-K-Scores)|53.5%|Easy||
+|1985|Find the Kth Largest Integer in the Array||44.6%|Medium||
+|1986|Minimum Number of Work Sessions to Finish the Tasks||33.1%|Medium||
+|1987|Number of Unique Good Subsequences||52.2%|Hard||
+|1988|Find Cutoff Score for Each School||70.5%|Medium||
+|1989|Maximum Number of People That Can Be Caught in Tag||53.8%|Medium||
+|1990|Count the Number of Experiments||51.7%|Medium||
+|1991|Find the Middle Index in Array||67.3%|Easy||
+|1992|Find All Groups of Farmland||68.5%|Medium||
+|1993|Operations on Tree||43.5%|Medium||
+|1994|The Number of Good Subsets||34.1%|Hard||
+|1995|Count Special Quadruplets||59.0%|Easy||
+|1996|The Number of Weak Characters in the Game||44.0%|Medium||
+|1997|First Day Where You Have Been in All the Rooms||36.0%|Medium||
+|1998|GCD Sort of an Array||45.5%|Hard||
+|1999|Smallest Greater Multiple Made of Two Digits||50.0%|Medium||
+|2000|Reverse Prefix of Word||77.7%|Easy||
+|2001|Number of Pairs of Interchangeable Rectangles||44.6%|Medium||
+|2002|Maximum Product of the Length of Two Palindromic Subsequences||53.4%|Medium||
+|2003|Smallest Missing Genetic Value in Each Subtree||44.1%|Hard||
+|2004|The Number of Seniors and Juniors to Join the Company||38.8%|Hard||
+|2005|Subtree Removal Game with Fibonacci Tree||62.8%|Hard||
+|2006|Count Number of Pairs With Absolute Difference K||82.2%|Easy||
+|2007|Find Original Array From Doubled Array||41.0%|Medium||
+|2008|Maximum Earnings From Taxi||43.0%|Medium||
+|2009|Minimum Number of Operations to Make Array Continuous||45.5%|Hard||
+|2010|The Number of Seniors and Juniors to Join the Company II||57.8%|Hard||
+|2011|Final Value of Variable After Performing Operations||88.8%|Easy||
+|2012|Sum of Beauty in the Array||46.7%|Medium||
+|2013|Detect Squares||50.1%|Medium||
+|2014|Longest Subsequence Repeated k Times||55.7%|Hard||
+|2015|Average Height of Buildings in Each Segment||58.6%|Medium||
+|2016|Maximum Difference Between Increasing Elements||53.4%|Easy||
+|2017|Grid Game||42.7%|Medium||
+|2018|Check if Word Can Be Placed In Crossword||49.3%|Medium||
+|2019|The Score of Students Solving Math Expression||33.2%|Hard||
+|2020|Number of Accounts That Did Not Stream||73.2%|Medium||
+|2021|Brightest Position on Street|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/2021.Brightest-Position-on-Street)|62.9%|Medium||
+|2022|Convert 1D Array Into 2D Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/2022.Convert-1D-Array-Into-2D-Array)|58.3%|Easy||
+|2023|Number of Pairs of Strings With Concatenation Equal to Target||72.8%|Medium||
+|2024|Maximize the Confusion of an Exam||59.4%|Medium||
+|2025|Maximum Number of Ways to Partition an Array||32.0%|Hard||
+|2026|Low-Quality Problems||85.5%|Easy||
+|2027|Minimum Moves to Convert String||53.8%|Easy||
+|2028|Find Missing Observations||43.5%|Medium||
+|2029|Stone Game IX||26.1%|Medium||
+|2030|Smallest K-Length Subsequence With Occurrences of a Letter||38.9%|Hard||
+|2031|Count Subarrays With More Ones Than Zeros||53.2%|Medium||
+|2032|Two Out of Three||72.6%|Easy||
+|2033|Minimum Operations to Make a Uni-Value Grid||52.3%|Medium||
+|2034|Stock Price Fluctuation||49.3%|Medium||
+|2035|Partition Array Into Two Arrays to Minimize Sum Difference||17.9%|Hard||
+|2036|Maximum Alternating Subarray Sum||41.2%|Medium||
+|2037|Minimum Number of Moves to Seat Everyone|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/2037.Minimum-Number-of-Moves-to-Seat-Everyone)|82.2%|Easy||
+|2038|Remove Colored Pieces if Both Neighbors are the Same Color|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/2038.Remove-Colored-Pieces-if-Both-Neighbors-are-the-Same-Color)|58.1%|Medium||
+|2039|The Time When the Network Becomes Idle||50.6%|Medium||
+|2040|Kth Smallest Product of Two Sorted Arrays||29.1%|Hard||
+|2041|Accepted Candidates From the Interviews||79.4%|Medium||
+|2042|Check if Numbers Are Ascending in a Sentence||65.9%|Easy||
+|2043|Simple Bank System|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/2043.Simple-Bank-System)|65.9%|Medium||
+|2044|Count Number of Maximum Bitwise-OR Subsets||74.8%|Medium||
+|2045|Second Minimum Time to Reach Destination||38.5%|Hard||
+|2046|Sort Linked List Already Sorted Using Absolute Values||68.6%|Medium||
+|2047|Number of Valid Words in a Sentence||29.5%|Easy||
+|2048|Next Greater Numerically Balanced Number||47.1%|Medium||
+|2049|Count Nodes With the Highest Score||47.1%|Medium||
+|2050|Parallel Courses III||59.4%|Hard||
+|2051|The Category of Each Member in the Store||73.5%|Medium||
+|2052|Minimum Cost to Separate Sentence Into Rows||51.0%|Medium||
+|2053|Kth Distinct String in an Array||71.9%|Easy||
+|2054|Two Best Non-Overlapping Events||44.8%|Medium||
+|2055|Plates Between Candles||44.7%|Medium||
+|2056|Number of Valid Move Combinations On Chessboard||59.1%|Hard||
+|2057|Smallest Index With Equal Value||71.2%|Easy||
+|2058|Find the Minimum and Maximum Number of Nodes Between Critical Points||57.1%|Medium||
+|2059|Minimum Operations to Convert Number||47.2%|Medium||
+|2060|Check if an Original String Exists Given Two Encoded Strings||41.0%|Hard||
+|2061|Number of Spaces Cleaning Robot Cleaned||54.9%|Medium||
+|2062|Count Vowel Substrings of a String||65.9%|Easy||
+|2063|Vowels of All Substrings||55.0%|Medium||
+|2064|Minimized Maximum of Products Distributed to Any Store||50.0%|Medium||
+|2065|Maximum Path Quality of a Graph||57.7%|Hard||
+|2066|Account Balance||85.5%|Medium||
+|2067|Number of Equal Count Substrings||49.6%|Medium||
+|2068|Check Whether Two Strings are Almost Equivalent||64.7%|Easy||
+|2069|Walking Robot Simulation II||23.0%|Medium||
+|2070|Most Beautiful Item for Each Query||49.5%|Medium||
+|2071|Maximum Number of Tasks You Can Assign||34.8%|Hard||
+|2072|The Winner University||72.4%|Easy||
+|2073|Time Needed to Buy Tickets||62.0%|Easy||
+|2074|Reverse Nodes in Even Length Groups||51.5%|Medium||
+|2075|Decode the Slanted Ciphertext||50.2%|Medium||
+|2076|Process Restricted Friend Requests||53.4%|Hard||
+|2077|Paths in Maze That Lead to Same Room||56.8%|Medium||
+|2078|Two Furthest Houses With Different Colors||67.3%|Easy||
+|2079|Watering Plants||80.2%|Medium||
+|2080|Range Frequency Queries||38.1%|Medium||
+|2081|Sum of k-Mirror Numbers||42.1%|Hard||
+|2082|The Number of Rich Customers||80.7%|Easy||
+|2083|Substrings That Begin and End With the Same Letter||68.0%|Medium||
+|2084|Drop Type 1 Orders for Customers With Type 0 Orders||91.2%|Medium||
+|2085|Count Common Words With One Occurrence||69.6%|Easy||
+|2086|Minimum Number of Buckets Required to Collect Rainwater from Houses||45.0%|Medium||
+|2087|Minimum Cost Homecoming of a Robot in a Grid||51.4%|Medium||
+|2088|Count Fertile Pyramids in a Land||63.3%|Hard||
+|2089|Find Target Indices After Sorting Array||76.9%|Easy||
+|2090|K Radius Subarray Averages||42.4%|Medium||
+|2091|Removing Minimum and Maximum From Array||56.8%|Medium||
+|2092|Find All People With Secret||34.2%|Hard||
+|2093|Minimum Cost to Reach City With Discounts||56.3%|Medium||
+|2094|Finding 3-Digit Even Numbers||57.4%|Easy||
+|2095|Delete the Middle Node of a Linked List||60.7%|Medium||
+|2096|Step-By-Step Directions From a Binary Tree Node to Another|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/2096.Step-By-Step-Directions-From-a-Binary-Tree-Node-to-Another)|48.8%|Medium||
+|2097|Valid Arrangement of Pairs||40.9%|Hard||
+|2098|Subsequence of Size K With the Largest Even Sum||38.7%|Medium||
+|2099|Find Subsequence of Length K With the Largest Sum||42.5%|Easy||
+|2100|Find Good Days to Rob the Bank||49.1%|Medium||
+|2101|Detonate the Maximum Bombs||40.9%|Medium||
+|2102|Sequentially Ordinal Rank Tracker||66.1%|Hard||
+|2103|Rings and Rods||81.5%|Easy||
+|2104|Sum of Subarray Ranges||60.2%|Medium||
+|2105|Watering Plants II||50.2%|Medium||
+|2106|Maximum Fruits Harvested After at Most K Steps||35.1%|Hard||
+|2107|Number of Unique Flavors After Sharing K Candies||57.2%|Medium||
+|2108|Find First Palindromic String in the Array||78.6%|Easy||
+|2109|Adding Spaces to a String||56.2%|Medium||
+|2110|Number of Smooth Descent Periods of a Stock||57.4%|Medium||
+|2111|Minimum Operations to Make the Array K-Increasing||37.7%|Hard||
+|2112|The Airport With the Most Traffic||71.2%|Medium||
+|2113|Elements in Array After Removing and Replacing Elements||73.4%|Medium||
+|2114|Maximum Number of Words Found in Sentences||88.2%|Easy||
+|2115|Find All Possible Recipes from Given Supplies||48.2%|Medium||
+|2116|Check if a Parentheses String Can Be Valid||31.4%|Medium||
+|2117|Abbreviating the Product of a Range||28.1%|Hard||
+|2118|Build the Equation||57.8%|Hard||
+|2119|A Number After a Double Reversal||75.7%|Easy||
+|2120|Execution of All Suffix Instructions Staying in a Grid||83.5%|Medium||
+|2121|Intervals Between Identical Elements||43.0%|Medium||
+|2122|Recover the Original Array||38.1%|Hard||
+|2123|Minimum Operations to Remove Adjacent Ones in Matrix||41.1%|Hard||
+|2124|Check if All A's Appears Before All B's||71.5%|Easy||
+|2125|Number of Laser Beams in a Bank||82.7%|Medium||
+|2126|Destroying Asteroids||49.4%|Medium||
+|2127|Maximum Employees to Be Invited to a Meeting||32.9%|Hard||
+|2128|Remove All Ones With Row and Column Flips||76.4%|Medium||
+|2129|Capitalize the Title||60.1%|Easy||
+|2130|Maximum Twin Sum of a Linked List||81.6%|Medium||
+|2131|Longest Palindrome by Concatenating Two Letter Words||41.3%|Medium||
+|2132|Stamping the Grid||30.6%|Hard||
+|2133|Check if Every Row and Column Contains All Numbers||52.8%|Easy||
+|2134|Minimum Swaps to Group All 1's Together II||50.3%|Medium||
+|2135|Count Words Obtained After Adding a Letter||42.8%|Medium||
+|2136|Earliest Possible Day of Full Bloom||68.4%|Hard||
+|2137|Pour Water Between Buckets to Make Water Levels Equal||67.1%|Medium||
+|2138|Divide a String Into Groups of Size k||65.1%|Easy||
+|2139|Minimum Moves to Reach Target Score||48.4%|Medium||
+|2140|Solving Questions With Brainpower||45.8%|Medium||
+|2141|Maximum Running Time of N Computers||38.7%|Hard||
+|2142|The Number of Passengers in Each Bus I||51.1%|Medium||
+|2143|Choose Numbers From Two Arrays in Range||51.8%|Hard||
+|2144|Minimum Cost of Buying Candies With Discount||60.8%|Easy||
+|2145|Count the Hidden Sequences||36.3%|Medium||
+|2146|K Highest Ranked Items Within a Price Range||41.2%|Medium||
+|2147|Number of Ways to Divide a Long Corridor||39.9%|Hard||
+|2148|Count Elements With Strictly Smaller and Greater Elements||60.0%|Easy||
+|2149|Rearrange Array Elements by Sign||81.0%|Medium||
+|2150|Find All Lonely Numbers in the Array||60.7%|Medium||
+|2151|Maximum Good People Based on Statements||48.4%|Hard||
+|2152|Minimum Number of Lines to Cover Points||46.7%|Medium||
+|2153|The Number of Passengers in Each Bus II||50.4%|Hard||
+|2154|Keep Multiplying Found Values by Two||73.3%|Easy||
+|2155|All Divisions With the Highest Score of a Binary Array||63.3%|Medium||
+|2156|Find Substring With Given Hash Value||21.9%|Hard||
+|2157|Groups of Strings||25.2%|Hard||
+|2158|Amount of New Area Painted Each Day||55.7%|Hard||
+|2159|Order Two Columns Independently||63.5%|Medium||
+|2160|Minimum Sum of Four Digit Number After Splitting Digits||88.2%|Easy||
+|2161|Partition Array According to Given Pivot||84.3%|Medium||
+|2162|Minimum Cost to Set Cooking Time||39.2%|Medium||
+|2163|Minimum Difference in Sums After Removal of Elements||46.5%|Hard||
+|2164|Sort Even and Odd Indices Independently|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/2164.Sort-Even-and-Odd-Indices-Independently)|66.6%|Easy||
+|2165|Smallest Value of the Rearranged Number|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/2165.Smallest-Value-of-the-Rearranged-Number)|51.1%|Medium||
+|2166|Design Bitset|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/2166.Design-Bitset)|31.3%|Medium||
+|2167|Minimum Time to Remove All Cars Containing Illegal Goods|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/2167.Minimum-Time-to-Remove-All-Cars-Containing-Illegal-Goods)|40.1%|Hard||
+|2168|Unique Substrings With Equal Digit Frequency||60.2%|Medium||
+|2169|Count Operations to Obtain Zero|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/2169.Count-Operations-to-Obtain-Zero)|75.6%|Easy||
+|2170|Minimum Operations to Make the Array Alternating|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/2170.Minimum-Operations-to-Make-the-Array-Alternating)|33.2%|Medium||
+|2171|Removing Minimum Number of Magic Beans|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/2171.Removing-Minimum-Number-of-Magic-Beans)|42.0%|Medium||
+|2172|Maximum AND Sum of Array||46.8%|Hard||
+|2173|Longest Winning Streak||59.7%|Hard||
+|2174|Remove All Ones With Row and Column Flips II||68.8%|Medium||
+|2175|The Change in Global Rankings||68.5%|Medium||
+|2176|Count Equal and Divisible Pairs in an Array||80.3%|Easy||
+|2177|Find Three Consecutive Integers That Sum to a Given Number||63.5%|Medium||
+|2178|Maximum Split of Positive Even Integers||59.1%|Medium||
+|2179|Count Good Triplets in an Array||36.7%|Hard||
+|2180|Count Integers With Even Digit Sum|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/2180.Count-Integers-With-Even-Digit-Sum)|64.5%|Easy||
+|2181|Merge Nodes in Between Zeros|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/2181.Merge-Nodes-in-Between-Zeros)|86.9%|Medium||
+|2182|Construct String With Repeat Limit|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/2182.Construct-String-With-Repeat-Limit)|51.8%|Medium||
+|2183|Count Array Pairs Divisible by K|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/2183.Count-Array-Pairs-Divisible-by-K)|28.3%|Hard||
+|2184|Number of Ways to Build Sturdy Brick Wall||52.1%|Medium||
+|2185|Counting Words With a Given Prefix||77.1%|Easy||
+|2186|Minimum Number of Steps to Make Two Strings Anagram II||71.9%|Medium||
+|2187|Minimum Time to Complete Trips||31.8%|Medium||
+|2188|Minimum Time to Finish the Race||41.9%|Hard||
+|2189|Number of Ways to Build House of Cards||63.2%|Medium||
+|2190|Most Frequent Number Following Key In an Array||60.4%|Easy||
+|2191|Sort the Jumbled Numbers||45.1%|Medium||
+|2192|All Ancestors of a Node in a Directed Acyclic Graph||50.5%|Medium||
+|2193|Minimum Number of Moves to Make Palindrome||50.8%|Hard||
+|2194|Cells in a Range on an Excel Sheet||85.7%|Easy||
+|2195|Append K Integers With Minimal Sum||24.9%|Medium||
+|2196|Create Binary Tree From Descriptions||72.0%|Medium||
+|2197|Replace Non-Coprime Numbers in Array||38.3%|Hard||
+|2198|Number of Single Divisor Triplets||56.2%|Medium||
+|2199|Finding the Topic of Each Post||49.8%|Hard||
+|2200|Find All K-Distant Indices in an Array||64.4%|Easy||
+|2201|Count Artifacts That Can Be Extracted||54.9%|Medium||
+|2202|Maximize the Topmost Element After K Moves||22.7%|Medium||
+|2203|Minimum Weighted Subgraph With the Required Paths||35.6%|Hard||
+|2204|Distance to a Cycle in Undirected Graph||71.4%|Hard||
+|2205|The Number of Users That Are Eligible for Discount||50.4%|Easy||
+|2206|Divide Array Into Equal Pairs||74.8%|Easy||
+|2207|Maximize Number of Subsequences in a String||32.7%|Medium||
+|2208|Minimum Operations to Halve Array Sum||45.1%|Medium||
+|2209|Minimum White Tiles After Covering With Carpets||33.7%|Hard||
+|2210|Count Hills and Valleys in an Array||57.7%|Easy||
+|2211|Count Collisions on a Road||41.7%|Medium||
+|2212|Maximum Points in an Archery Competition||48.7%|Medium||
+|2213|Longest Substring of One Repeating Character||31.1%|Hard||
+|2214|Minimum Health to Beat Game||57.6%|Medium||
+|2215|Find the Difference of Two Arrays||69.1%|Easy||
+|2216|Minimum Deletions to Make Array Beautiful||46.1%|Medium||
+|2217|Find Palindrome With Fixed Length||34.4%|Medium||
+|2218|Maximum Value of K Coins From Piles||48.5%|Hard||
+|2219|Maximum Sum Score of Array||60.6%|Medium||
+|2220|Minimum Bit Flips to Convert Number||82.3%|Easy||
+|2221|Find Triangular Sum of an Array||79.1%|Medium||
+|2222|Number of Ways to Select Buildings||50.7%|Medium||
+|2223|Sum of Scores of Built Strings||36.5%|Hard||
+|2224|Minimum Number of Operations to Convert Time||65.2%|Easy||
+|2225|Find Players With Zero or One Losses||69.3%|Medium||
+|2226|Maximum Candies Allocated to K Children||35.9%|Medium||
+|2227|Encrypt and Decrypt Strings||39.0%|Hard||
+|2228|Users With Two Purchases Within Seven Days||44.8%|Medium||
+|2229|Check if an Array Is Consecutive||61.7%|Easy||
+|2230|The Users That Are Eligible for Discount||51.1%|Easy||
+|2231|Largest Number After Digit Swaps by Parity||60.2%|Easy||
+|2232|Minimize Result by Adding Parentheses to Expression||64.7%|Medium||
+|2233|Maximum Product After K Increments||41.3%|Medium||
+|2234|Maximum Total Beauty of the Gardens||28.1%|Hard||
+|2235|Add Two Integers||90.0%|Easy||
+|2236|Root Equals Sum of Children||87.6%|Easy||
+|2237|Count Positions on Street With Required Brightness||68.6%|Medium||
+|2238|Number of Times a Driver Was a Passenger||75.3%|Medium||
+|2239|Find Closest Number to Zero||45.8%|Easy||
+|2240|Number of Ways to Buy Pens and Pencils||56.8%|Medium||
+|2241|Design an ATM Machine||38.6%|Medium||
+|2242|Maximum Score of a Node Sequence||37.4%|Hard||
+|2243|Calculate Digit Sum of a String||66.9%|Easy||
+|2244|Minimum Rounds to Complete All Tasks||57.0%|Medium||
+|2245|Maximum Trailing Zeros in a Cornered Path||35.2%|Medium||
+|2246|Longest Path With Different Adjacent Characters||44.9%|Hard||
+|2247|Maximum Cost of Trip With K Highways||50.5%|Hard||
+|2248|Intersection of Multiple Arrays||69.5%|Easy||
+|2249|Count Lattice Points Inside a Circle||50.4%|Medium||
+|2250|Count Number of Rectangles Containing Each Point||33.9%|Medium||
+|2251|Number of Flowers in Full Bloom||51.9%|Hard||
+|2252|Dynamic Pivoting of a Table||55.5%|Hard||
+|2253|Dynamic Unpivoting of a Table||67.4%|Hard||
+|2254|Design Video Sharing Platform||65.8%|Hard||
+|2255|Count Prefixes of a Given String||73.3%|Easy||
+|2256|Minimum Average Difference||35.7%|Medium||
+|2257|Count Unguarded Cells in the Grid||52.2%|Medium||
+|2258|Escape the Spreading Fire||34.7%|Hard||
+|2259|Remove Digit From Number to Maximize Result||47.0%|Easy||
+|2260|Minimum Consecutive Cards to Pick Up||51.9%|Medium||
+|2261|K Divisible Elements Subarrays||47.4%|Medium||
+|2262|Total Appeal of A String||58.1%|Hard||
+|2263|Make Array Non-decreasing or Non-increasing||68.0%|Hard||
+|2264|Largest 3-Same-Digit Number in String||58.9%|Easy||
+|2265|Count Nodes Equal to Average of Subtree||85.6%|Medium||
+|2266|Count Number of Texts||47.3%|Medium||
+|2267|Check if There Is a Valid Parentheses String Path||37.9%|Hard||
+|2268|Minimum Number of Keypresses||74.4%|Medium||
+|2269|Find the K-Beauty of a Number||57.2%|Easy||
+|2270|Number of Ways to Split Array||44.2%|Medium||
+|2271|Maximum White Tiles Covered by a Carpet||32.4%|Medium||
+|2272|Substring With Largest Variance||37.1%|Hard||
+|2273|Find Resultant Array After Removing Anagrams||58.0%|Easy||
+|2274|Maximum Consecutive Floors Without Special Floors||52.2%|Medium||
+|2275|Largest Combination With Bitwise AND Greater Than Zero||72.3%|Medium||
+|2276|Count Integers in Intervals||33.9%|Hard||
+|2277|Closest Node to Path in Tree||64.1%|Hard||
+|2278|Percentage of Letter in String||74.0%|Easy||
+|2279|Maximum Bags With Full Capacity of Rocks||62.6%|Medium||
+|2280|Minimum Lines to Represent a Line Chart||23.7%|Medium||
+|2281|Sum of Total Strength of Wizards||27.9%|Hard||
+|2282|Number of People That Can Be Seen in a Grid||50.4%|Medium||
+|2283|Check if Number Has Equal Digit Count and Digit Value||73.6%|Easy||
+|2284|Sender With Largest Word Count||55.8%|Medium||
+|2285|Maximum Total Importance of Roads||60.7%|Medium||
+|2286|Booking Concert Tickets in Groups||15.7%|Hard||
+|2287|Rearrange Characters to Make Target String||57.7%|Easy||
+|2288|Apply Discount to Prices||27.3%|Medium||
+|2289|Steps to Make Array Non-decreasing||21.4%|Medium||
+|2290|Minimum Obstacle Removal to Reach Corner||49.2%|Hard||
+|2291|Maximum Profit From Trading Stocks||46.4%|Medium||
+|2292|Products With Three or More Orders in Two Consecutive Years||39.9%|Medium||
+|2293|Min Max Game||64.2%|Easy||
+|2294|Partition Array Such That Maximum Difference Is K||72.4%|Medium||
+|2295|Replace Elements in an Array||57.6%|Medium||
+|2296|Design a Text Editor||39.5%|Hard||
+|2297|Jump Game VIII||57.0%|Medium||
+|2298|Tasks Count in the Weekend||87.7%|Medium||
+|2299|Strong Password Checker II||56.8%|Easy||
+|2300|Successful Pairs of Spells and Potions||31.5%|Medium||
+|2301|Match Substring After Replacement||39.2%|Hard||
+|2302|Count Subarrays With Score Less Than K||51.9%|Hard||
+|2303|Calculate Amount Paid in Taxes||63.0%|Easy||
+|2304|Minimum Path Cost in a Grid||65.4%|Medium||
+|2305|Fair Distribution of Cookies||62.9%|Medium||
+|2306|Naming a Company||34.4%|Hard||
+|2307|Check for Contradictions in Equations||40.9%|Hard||
+|2308|Arrange Table by Gender||79.5%|Medium||
+|2309|Greatest English Letter in Upper and Lower Case||68.5%|Easy||
+|2310|Sum of Numbers With Units Digit K||25.4%|Medium||
+|2311|Longest Binary Subsequence Less Than or Equal to K||36.1%|Medium||
+|2312|Selling Pieces of Wood||48.0%|Hard||
+|2313|Minimum Flips in Binary Tree to Get Result||67.5%|Hard||
+|2314|The First Day of the Maximum Recorded Degree in Each City||76.9%|Medium||
+|2315|Count Asterisks||82.2%|Easy||
+|2316|Count Unreachable Pairs of Nodes in an Undirected Graph||38.6%|Medium||
+|2317|Maximum XOR After Operations||78.2%|Medium||
+|2318|Number of Distinct Roll Sequences||56.3%|Hard||
+|2319|Check if Matrix Is X-Matrix||67.3%|Easy||
+|2320|Count Number of Ways to Place Houses||39.9%|Medium||
+|2321|Maximum Score Of Spliced Array||55.1%|Hard||
+|2322|Minimum Score After Removals on a Tree||50.3%|Hard||
+|2323|Find Minimum Time to Finish All Jobs II||75.4%|Medium||
+|2324|Product Sales Analysis IV||84.5%|Medium||
+|2325|Decode the Message||84.7%|Easy||
+|2326|Spiral Matrix IV||74.6%|Medium||
+|2327|Number of People Aware of a Secret||44.4%|Medium||
+|2328|Number of Increasing Paths in a Grid||47.7%|Hard||
+|2329|Product Sales Analysis V||70.2%|Easy||
+|2330|Valid Palindrome IV||76.2%|Medium||
+|2331|Evaluate Boolean Binary Tree||79.5%|Easy||
+|2332|The Latest Time to Catch a Bus||22.7%|Medium||
+|2333|Minimum Sum of Squared Difference||24.9%|Medium||
+|2334|Subarray With Elements Greater Than Varying Threshold||40.1%|Hard||
+|2335|Minimum Amount of Time to Fill Cups||55.3%|Easy||
+|2336|Smallest Number in Infinite Set||71.8%|Medium||
+|2337|Move Pieces to Obtain a String||48.0%|Medium||
+|2338|Count the Number of Ideal Arrays||25.3%|Hard||
+|2339|All the Matches of the League||88.8%|Easy||
+|2340|Minimum Adjacent Swaps to Make a Valid Array||76.6%|Medium||
+|2341|Maximum Number of Pairs in Array||76.6%|Easy||
+|2342|Max Sum of a Pair With Equal Sum of Digits||52.9%|Medium||
+|2343|Query Kth Smallest Trimmed Number||40.7%|Medium||
+|2344|Minimum Deletions to Make Array Divisible||56.9%|Hard||
+|2345|Finding the Number of Visible Mountains||44.5%|Medium||
+|2346|Compute the Rank as a Percentage||32.9%|Medium||
+|2347|Best Poker Hand||60.7%|Easy||
+|2348|Number of Zero-Filled Subarrays||56.8%|Medium||
+|2349|Design a Number Container System||46.8%|Medium||
+|2350|Shortest Impossible Sequence of Rolls||68.2%|Hard||
+|2351|First Letter to Appear Twice||76.6%|Easy||
+|2352|Equal Row and Column Pairs||71.1%|Medium||
+|2353|Design a Food Rating System||34.4%|Medium||
+|2354|Number of Excellent Pairs||45.8%|Hard||
+|2355|Maximum Number of Books You Can Take||47.0%|Hard||
+|2356|Number of Unique Subjects Taught by Each Teacher||91.5%|Easy||
+|2357|Make Array Zero by Subtracting Equal Amounts||72.5%|Easy||
+|2358|Maximum Number of Groups Entering a Competition||67.3%|Medium||
+|2359|Find Closest Node to Given Two Nodes||33.8%|Medium||
+|2360|Longest Cycle in a Graph||38.5%|Hard||
+|2361|Minimum Costs Using the Train Line||77.1%|Hard||
+|2362|Generate the Invoice||89.1%|Hard||
+|2363|Merge Similar Items||75.1%|Easy||
+|2364|Count Number of Bad Pairs||40.5%|Medium||
+|2365|Task Scheduler II||46.0%|Medium||
+|2366|Minimum Replacements to Sort the Array||39.5%|Hard||
+|2367|Number of Arithmetic Triplets||83.7%|Easy||
+|2368|Reachable Nodes With Restrictions||57.2%|Medium||
+|2369|Check if There is a Valid Partition For The Array||40.0%|Medium||
+|2370|Longest Ideal Subsequence||37.8%|Medium||
+|2371|Minimize Maximum Value in a Grid||69.5%|Hard||
+|2372|Calculate the Influence of Each Salesperson||88.6%|Medium||
+|2373|Largest Local Values in a Matrix||84.1%|Easy||
+|2374|Node With Highest Edge Score||45.9%|Medium||
+|2375|Construct Smallest Number From DI String||73.7%|Medium||
+|2376|Count Special Integers||36.0%|Hard||
+|2377|Sort the Olympic Table||80.2%|Easy||
+|2378|Choose Edges to Maximize Score in a Tree||61.9%|Medium||
+|2379|Minimum Recolors to Get K Consecutive Black Blocks||56.6%|Easy||
+|2380|Time Needed to Rearrange a Binary String||47.7%|Medium||
+|2381|Shifting Letters II||33.9%|Medium||
+|2382|Maximum Segment Sum After Removals||47.7%|Hard||
+|2383|Minimum Hours of Training to Win a Competition||40.8%|Easy||
+|2384|Largest Palindromic Number||30.1%|Medium||
+|2385|Amount of Time for Binary Tree to Be Infected||56.0%|Medium||
+|2386|Find the K-Sum of an Array||36.2%|Hard||
+|2387|Median of a Row Wise Sorted Matrix||67.7%|Medium||
+|2388|Change Null Values in a Table to the Previous Value||79.7%|Medium||
+|2389|Longest Subsequence With Limited Sum||64.4%|Easy||
+|2390|Removing Stars From a String||62.9%|Medium||
+|2391|Minimum Amount of Time to Collect Garbage||85.4%|Medium||
+|2392|Build a Matrix With Conditions||59.1%|Hard||
+|2393|Count Strictly Increasing Subarrays||76.4%|Medium||
+|2394|Employees With Deductions||50.9%|Medium||
+|2395|Find Subarrays With Equal Sum||63.6%|Easy||
+|2396|Strictly Palindromic Number||87.7%|Medium||
+|2397|Maximum Rows Covered by Columns||52.2%|Medium||
+|2398|Maximum Number of Robots Within Budget||31.6%|Hard||
+|2399|Check Distances Between Same Letters||70.5%|Easy||
+|2400|Number of Ways to Reach a Position After Exactly k Steps||31.8%|Medium||
+|2401|Longest Nice Subarray||47.7%|Medium||
+|2402|Meeting Rooms III||32.7%|Hard||
+|2403|Minimum Time to Kill All Monsters||52.3%|Hard||
+|2404|Most Frequent Even Element||51.7%|Easy||
+|2405|Optimal Partition of String||74.1%|Medium||
+|2406|Divide Intervals Into Minimum Number of Groups||45.0%|Medium||
+|2407|Longest Increasing Subsequence II||20.6%|Hard||
+|2408|Design SQL||87.3%|Medium||
+|2409|Count Days Spent Together||42.3%|Easy||
+|2410|Maximum Matching of Players With Trainers||59.3%|Medium||
+|2411|Smallest Subarrays With Maximum Bitwise OR||40.0%|Medium||
+|2412|Minimum Money Required Before Transactions||38.8%|Hard||
+|2413|Smallest Even Multiple||88.2%|Easy||
+|2414|Length of the Longest Alphabetical Continuous Substring||55.5%|Medium||
+|2415|Reverse Odd Levels of Binary Tree||75.6%|Medium||
+|2416|Sum of Prefix Scores of Strings||42.3%|Hard||
+|2417|Closest Fair Integer||48.5%|Medium||
+|2418|Sort the People||82.7%|Easy||
+|2419|Longest Subarray With Maximum Bitwise AND||47.3%|Medium||
+|2420|Find All Good Indices||36.8%|Medium||
+|2421|Number of Good Paths||37.5%|Hard||
+|2422|Merge Operations to Turn Array Into a Palindrome||74.8%|Medium||
+|2423|Remove Letter To Equalize Frequency||19.4%|Easy||
+|2424|Longest Uploaded Prefix||53.2%|Medium||
+|2425|Bitwise XOR of All Pairings||58.3%|Medium||
+|2426|Number of Pairs Satisfying Inequality||41.1%|Hard||
+|2427|Number of Common Factors||80.3%|Easy||
+|2428|Maximum Sum of an Hourglass||73.6%|Medium||
+|2429|Minimize XOR||41.4%|Medium||
+|2430|Maximum Deletions on a String||32.8%|Hard||
+|2431|Maximize Total Tastiness of Purchased Fruits||76.6%|Medium||
+|2432|The Employee That Worked on the Longest Task||48.5%|Easy||
+|2433|Find The Original Array of Prefix Xor||85.1%|Medium||
+|2434|Using a Robot to Print the Lexicographically Smallest String||37.5%|Medium||
+|2435|Paths in Matrix Whose Sum Is Divisible by K||40.8%|Hard||
+|2436|Minimum Split Into Subarrays With GCD Greater Than One||85.0%|Medium||
+|2437|Number of Valid Clock Times||40.3%|Easy||
+|2438|Range Product Queries of Powers||36.6%|Medium||
+|2439|Minimize Maximum of Array||30.1%|Medium||
+|2440|Create Components With Same Value||53.4%|Hard||
+|2441|Largest Positive Integer That Exists With Its Negative||68.7%|Easy||
+|2442|Count Number of Distinct Integers After Reverse Operations||78.8%|Medium||
+|2443|Sum of Number and Its Reverse||40.6%|Medium||
+|2444|Count Subarrays With Fixed Bounds||38.4%|Hard||
|------------|-------------------------------------------------------|-------| ----------------| ---------------|-------------|
-
------------------------------------------------------------------
下面这些是免费的算法题，但是暂时还不能使用 Go 解答的：
@@ -1670,7 +2594,7 @@
------------------------------------------------------------------
-## 二.分类
+## 三.分类
## Array
diff --git a/README_old.md b/README_old.md
new file mode 100644
index 000000000..bc1892c44
--- /dev/null
+++ b/README_old.md
@@ -0,0 +1,1173 @@
+
+# LeetCode by Go
+[LeetCode Online Judge] (https://leetcode.com/) is a website containing many **algorithm questions**. Most of them are real interview questions of **Google, Facebook, LinkedIn, Apple**, etc. This repo shows my solutions by Go with the code style strictly follows the [Google Golang Style Guide](https://github.com/golang/go/wiki/CodeReviewComments). Please feel free to reference and **STAR** to support this repo, thank you!
+
+
+<p align='center'>
+<img src='./logo.png'>
+</p>
+
+
+
+
+## 数据结构
+
+| 数据结构 | 变种 | 相关题目 |
+|:-------:|:-------|:------|
+|顺序线性表：向量|||
+|单链表|1.双链表<br>2.静态链表<br>3.对称矩阵<br>4.稀疏矩阵||
+|栈|广义栈||
+|队列|1.链表实现<br>2.循环数组实现<br>3.双端队列||
+|字符串|1.KMP算法<br>2.有限状态自动机<br>3.模式匹配有限状态自动机<br>4.BM模式匹配算法<br>5.BM-KMP算法||
+|树|1.二叉树<br>2.并查集<br>3.Huffman数||
+|数组实现的堆|1.极大堆和极小堆<br>2.极大极小堆<br>3.双端堆<br>4.d叉堆||
+|树实现的堆|1.左堆<br>2.扁堆<br>3.二项式堆<br>4.斐波那契堆<br>5.配对堆||
+|查找|1.哈希表<br>2.跳跃表<br>3.排序二叉树<br>4.AVL树<br>5.B树<br>6.AA树<br>7.红黑树<br>8.排序二叉堆<br>9.Splay树<br>10.双链树<br>11.Trie树||
+
+
+## Data Structures
+
+> 标识了 (已全部做完) 的专题是全部完成了的，没有标识的是还没有做完的
+
+* [Array](#array)
+* [String](#string)
+* [Linked List](#linked-list)
+* [Stack](#stack)
+* [Tree](#tree)
+* [Dynamic programming](#dynamic-programming)
+* [Depth-first search](#depth-first-search)
+* [Math](#math)
+* [Search](#search)
+* [Sort](#sort)
+* [Union Find](#union-find)
+
+## Companies
+* [Google](#google)
+* [Facebook](#facebook)
+* [Snapchat](#snapchat)
+* [Uber](#uber)
+* [Airbnb](#airbnb)
+* [LinkedIn](#linkedin)
+* [Amazon](#amazon)
+* [Microsoft](#microsoft)
+
+
+## 算法
+
+
+## 一. 目录
+
+|题号|题目|通过率|难度|收藏|
+|:--:|:--|:--: | :--: | :--: |
+|1|[Two Sum](./Algorithms/1.two-sum)|38%|Easy||
+|2|[Add Two Numbers](./Algorithms/2.add-two-numbers)|28%|Medium||
+|3|[Longest Substring Without Repeating Characters](./Algorithms/3.longest-substring-without-repeating-characters)|24%|Medium||
+|4|[Median of Two Sorted Arrays](./Algorithms/4.median-of-two-sorted-arrays)|23%|Hard||
+|5|[Longest Palindromic Substring](./Algorithms/5.longest-palindromic-substring)|25%|Medium||
+|6|[ZigZag Conversion](./Algorithms/6.zigzag-conversion)|27%|Medium||
+|7|[Reverse Integer](./Algorithms/7.reverse-integer)|24%|Easy||
+|8|[String to Integer (atoi)](./Algorithms/8.string-to-integer-atoi)|14%|Medium||
+|9|[Palindrome Number](./Algorithms/9.palindrome-number)|35%|Easy||
+|10|[Regular Expression Matching](./Algorithms/10.regular-expression-matching)|24%|Hard|❤️|
+|11|[Container With Most Water](./Algorithms/11.container-with-most-water)|37%|Medium||
+|12|[Integer to Roman](./Algorithms/12.integer-to-roman)|46%|Medium||
+|13|[Roman to Integer](./Algorithms/13.roman-to-integer)|48%|Easy||
+|14|[Longest Common Prefix](./Algorithms/14.longest-common-prefix)|31%|Easy||
+|15|[3Sum](./Algorithms/15.3sum)|21%|Medium||
+|16|[3Sum Closest](./Algorithms/16.3sum-closest)|31%|Medium||
+|17|[Letter Combinations of a Phone Number](./Algorithms/17.letter-combinations-of-a-phone-number)|36%|Medium||
+|18|[4Sum](./Algorithms/18.4sum)|27%|Medium||
+|19|[Remove Nth Node From End of List](./Algorithms/19.remove-nth-node-from-end-of-list)|33%|Medium||
+|20|[Valid Parentheses](./Algorithms/20.Valid-Parentheses)|33%|Easy||
+|21|[Merge Two Sorted Lists](./Algorithms/21.merge-two-sorted-lists)|41%|Easy||
+|22|[Generate Parentheses](./Algorithms/22.generate-parentheses)|48%|Medium|❤️|
+|23|[Merge k Sorted Lists](./Algorithms/23.merge-k-sorted-lists)|28%|Hard||
+|24|[Swap Nodes in Pairs](./Algorithms/24.Swap-Nodes-In-Pairs)|39%|Medium|❤️|
+|25|[Reverse Nodes in k-Group](./Algorithms/25.Reverse-Nodes-In-k-Group)|31%|Hard|❤️|
+|26|[Remove Duplicates from Sorted Array](./Algorithms/26.remove-duplicates-from-sorted-array)|36%|Easy|❤️|
+|27|[Remove Element](./Algorithms/27.remove-element)|40%|Easy||
+|28|[Implement strStr()](./Algorithms/28.implement-strstr)|28%|Easy||
+|29|[Divide Two Integers](./Algorithms/29.divide-two-integers)|15%|Medium||
+|30|[Substring with Concatenation of All Words](./Algorithms/30.substring-with-concatenation-of-all-words)|22%|Hard|❤️|
+|31|[Next Permutation](./Algorithms/31.next-permutation)|29%|Medium|❤️|
+|32|[Longest Valid Parentheses](./Algorithms/32.longest-valid-parentheses)|23%|Hard||
+|33|[Search in Rotated Sorted Array](./Algorithms/33.search-in-rotated-sorted-array)|31%|Medium|❤️|
+|34|[Search for a Range](./Algorithms/34.search-for-a-range)|31%|Medium||
+|35|[Search Insert Position](./Algorithms/35.search-insert-position)|40%|Easy||
+|36|[Valid Sudoku](./Algorithms/36.valid-sudoku)|37%|Medium|❤️|
+|37|[Sudoku Solver](./Algorithms/37.sudoku-solver)|32%|Hard|❤️|
+|38|[Count and Say](./Algorithms/38.count-and-say)|36%|Easy||
+|39|[Combination Sum](./Algorithms/39.combination-sum)|41%|Medium||
+|40|[Combination Sum II](./Algorithms/40.combination-sum-ii)|35%|Medium||
+|41|[First Missing Positive](./Algorithms/41.First-Missing-Positive)|25%|Hard||
+|42|[Trapping Rain Water](./Algorithms/42.trapping-rain-water)|37%|Hard||
+|43|[Multiply Strings](./Algorithms/43.multiply-strings)|28%|Medium||
+|44|[Wildcard Matching](./Algorithms/44.wildcard-matching)|21%|Hard|❤️|
+|45|[Jump Game II](./Algorithms/45.jump-game-ii)|26%|Hard||
+|46|[Permutations](./Algorithms/46.permutations)|47%|Medium||
+|47|[Permutations II](./Algorithms/47.permutations-ii)|35%|Medium||
+|48|[Rotate Image](./Algorithms/48.rotate-image)|41%|Medium||
+|49|[Group Anagrams](./Algorithms/49.group-anagrams)|38%|Medium|❤️|
+|50|[Pow(x, n)](./Algorithms/50.powx-n)|26%|Medium||
+|51|[N-Queens](./Algorithms/51.n-queens)|33%|Hard||
+|52|[N-Queens II](./Algorithms/52.n-queens-ii)|46%|Hard||
+|53|[Maximum Subarray](./Algorithms/53.maximum-subarray)|40%|Easy|❤️|
+|54|[Spiral Matrix](./Algorithms/54.spiral-matrix)|27%|Medium|❤️|
+|55|[Jump Game](./Algorithms/55.jump-game)|29%|Medium||
+|56|[Merge Intervals](./Algorithms/56.merge-intervals)|31%|Medium|❤️|
+|57|[Insert Interval](./Algorithms/57.insert-interval)|28%|Hard||
+|58|[Length of Last Word](./Algorithms/58.length-of-last-word)|32%|Easy||
+|59|[Spiral Matrix II](./Algorithms/59.spiral-matrix-ii)|41%|Medium|❤️|
+|60|[Permutation Sequence](./Algorithms/60.permutation-sequence)|29%|Medium||
+|61|[Rotate List](./Algorithms/61.rotate-list)|24%|Medium|❤️|
+|62|[Unique Paths](./Algorithms/62.unique-paths)|42%|Medium|❤️|
+|63|[Unique Paths II](./Algorithms/63.unique-paths-ii)|32%|Medium||
+|64|[Minimum Path Sum](./Algorithms/64.minimum-path-sum)|40%|Medium||
+|65|[Valid Number](./Algorithms/65.valid-number)|12%|Hard||
+|66|[Plus One](./Algorithms/66.plus-one)|39%|Easy||
+|67|[Add Binary](./Algorithms/67.add-binary)|34%|Easy||
+|68|[Text Justification](./Algorithms/68.text-justification)|20%|Hard||
+|69|[Sqrt(x)](./Algorithms/69.sqrtx)|28%|Easy||
+|70|[Climbing Stairs](./Algorithms/70.climbing-stairs)|41%|Easy||
+|71|[Simplify Path](./Algorithms/71.simplify-path)|26%|Medium||
+|72|[Edit Distance](./Algorithms/72.edit-distance)|32%|Hard|❤️|
+|73|[Set Matrix Zeroes](./Algorithms/73.set-matrix-zeroes)|36%|Medium|❤️|
+|74|[Search a 2D Matrix](./Algorithms/74.search-a-2d-matrix)|34%|Medium||
+|75|[Sort Colors](./Algorithms/75.sort-colors)|38%|Medium|❤️|
+|76|[Minimum Window Substring](./Algorithms/76.minimum-window-substring)|26%|Hard|❤️|
+|77|[Combinations](./Algorithms/77.combinations)|41%|Medium||
+|78|[Subsets](./Algorithms/78.subsets)|44%|Medium|❤️|
+|79|[Word Search](./Algorithms/79.word-search)|28%|Medium||
+|80|[Remove Duplicates from Sorted Array II](./Algorithms/80.remove-duplicates-from-sorted-array-ii)|36%|Medium|❤️|
+|81|[Search in Rotated Sorted Array II](./Algorithms/81.search-in-rotated-sorted-array-ii)|32%|Medium||
+|82|[Remove Duplicates from Sorted List II](./Algorithms/82.remove-duplicates-from-sorted-list-ii)|29%|Medium|❤️|
+|83|[Remove Duplicates from Sorted List](./Algorithms/83.remove-duplicates-from-sorted-list)|40%|Easy||
+|84|[Largest Rectangle in Histogram](./Algorithms/84.largest-rectangle-in-histogram)|27%|Hard|❤️|
+|85|[Maximal Rectangle](./Algorithms/85.maximal-rectangle)|29%|Hard|❤️|
+|86|[Partition List](./Algorithms/86.partition-list)|33%|Medium||
+|87|[Scramble String](./Algorithms/87.scramble-string)|29%|Hard|❤️|
+|88|[Merge Sorted Array](./Algorithms/88.Merge-Sorted-Array)|32%|Easy||
+|89|[Gray Code](./Algorithms/89.gray-code)|42%|Medium||
+|90|[Subsets II](./Algorithms/90.subsets-ii)|38%|Medium|❤️|
+|91|[Decode Ways](./Algorithms/91.decode-ways)|20%|Medium|❤️|
+|92|[Reverse Linked List II](./Algorithms/92.reverse-linked-list-ii)|31%|Medium||
+|93|[Restore IP Addresses](./Algorithms/93.restore-ip-addresses)|28%|Medium|❤️|
+|94|[Binary Tree Inorder Traversal](./Algorithms/94.binary-tree-inorder-traversal)|49%|Medium||
+|95|[Unique Binary Search Trees II](./Algorithms/95.unique-binary-search-trees-ii)|32%|Medium|❤️|
+|96|[Unique Binary Search Trees](./Algorithms/96.unique-binary-search-trees)|41%|Medium||
+|97|[Interleaving String](./Algorithms/97.interleaving-string)|25%|Hard|❤️|
+|98|[Validate Binary Search Tree](./Algorithms/98.validate-binary-search-tree)|24%|Medium|❤️|
+|99|[Recover Binary Search Tree](./Algorithms/99.recover-binary-search-tree)|31%|Hard|❤️|
+|100|[Same Tree](./Algorithms/100.same-tree)|47%|Easy||
+|101|[Symmetric Tree](./Algorithms/101.symmetric-tree)|40%|Easy|❤️|
+|102|[Binary Tree Level Order Traversal](./Algorithms/102.binary-tree-level-order-traversal)|42%|Medium||
+|103|[Binary Tree Zigzag Level Order Traversal](./Algorithms/103.binary-tree-zigzag-level-order-traversal)|36%|Medium||
+|104|[Maximum Depth of Binary Tree](./Algorithms/104.maximum-depth-of-binary-tree)|54%|Easy||
+|105|[Construct Binary Tree from Preorder and Inorder Traversal](./Algorithms/105.construct-binary-tree-from-preorder-and-inorder-traversal)|34%|Medium|❤️|
+|106|[Construct Binary Tree from Inorder and Postorder Traversal](./Algorithms/106.construct-binary-tree-from-inorder-and-postorder-traversal)|33%|Medium|❤️|
+|107|[Binary Tree Level Order Traversal II](./Algorithms/107.binary-tree-level-order-traversal-ii)|42%|Easy||
+|108|[Convert Sorted Array to Binary Search Tree](./Algorithms/108.convert-sorted-array-to-binary-search-tree)|44%|Easy||
+|109|[Convert Sorted List to Binary Search Tree](./Algorithms/109.convert-sorted-list-to-binary-search-tree)|35%|Medium||
+|110|[Balanced Binary Tree](./Algorithms/110.balanced-binary-tree)|38%|Easy||
+|111|[Minimum Depth of Binary Tree](./Algorithms/111.minimum-depth-of-binary-tree)|33%|Easy||
+|112|[Path Sum](./Algorithms/112.path-sum)|34%|Easy||
+|113|[Path Sum II](./Algorithms/113.path-sum-ii)|35%|Medium||
+|114|[Flatten Binary Tree to Linked List](./Algorithms/114.flatten-binary-tree-to-linked-list)|36%|Medium|❤️|
+|115|[Distinct Subsequences](./Algorithms/115.distinct-subsequences)|32%|Hard|❤️|
+|118|[Pascal's Triangle](./Algorithms/118.pascals-triangle)|40%|Easy||
+|119|[Pascal's Triangle II](./Algorithms/119.pascals-triangle-ii)|38%|Easy||
+|120|[Triangle](./Algorithms/120.triangle)|34%|Medium|❤️|
+|121|[Best Time to Buy and Sell Stock](./Algorithms/121.best-time-to-buy-and-sell-stock)|42%|Easy||
+|122|[Best Time to Buy and Sell Stock II](./Algorithms/122.best-time-to-buy-and-sell-stock-ii)|47%|Easy||
+|123|[Best Time to Buy and Sell Stock III](./Algorithms/123.best-time-to-buy-and-sell-stock-iii)|30%|Hard||
+|124|[Binary Tree Maximum Path Sum](./Algorithms/124.binary-tree-maximum-path-sum)|27%|Hard|❤️|
+|125|[Valid Palindrome](./Algorithms/125.Valid-Palindrome)|27.0%|Easy||
+|126|[Word Ladder II](./Algorithms/126.word-ladder-ii)|14%|Hard|❤️|
+|127|[Word Ladder](./Algorithms/127.word-ladder)|20%|Medium|❤️|
+|128|[Longest Consecutive Sequence](./Algorithms/128.longest-consecutive-sequence)|38%|Hard||
+|129|[Sum Root to Leaf Numbers](./Algorithms/129.sum-root-to-leaf-numbers)|37%|Medium||
+|130|[Surrounded Regions](./Algorithms/130.surrounded-regions)|19%|Medium|❤️|
+|131|[Palindrome Partitioning](./Algorithms/131.palindrome-partitioning)|35%|Medium|❤️|
+|132|[Palindrome Partitioning II](./Algorithms/132.palindrome-partitioning-ii)|24%|Hard|❤️|
+|134|[Gas Station](./Algorithms/134.gas-station)|29%|Medium|❤️|
+|135|[Candy](./Algorithms/135.candy)|25%|Hard||
+|136|[Single Number](./Algorithms/136.single-number)|55%|Easy||
+|137|[Single Number II](./Algorithms/137.single-number-ii)|42%|Medium|❤️|
+|139|[Word Break](./Algorithms/139.word-break)|31%|Medium|❤️|
+|140|[Word Break II](./Algorithms/140.word-break-ii)|24%|Hard|❤️|
+|141|[Linked List Cycle](./Algorithms/140.Linked-List-Cycle)|24%|Hard|❤️|
+|142|[Linked List Cycle II](./Algorithms/140.Linked-List-Cycle-II)|24%|Hard|❤️|
+|143|[Reorder List](./Algorithms/143.reorder-list)|26%|Medium|❤️|
+|144|[Binary Tree Preorder Traversal](./Algorithms/144.binary-tree-preorder-traversal)|46%|Medium|❤️|
+|145|[Binary Tree Postorder Traversal](./Algorithms/145.binary-tree-postorder-traversal)|42%|Hard||
+|146|[LRU Cache](./Algorithms/146.lru-cache)|19%|Hard|❤️|
+|147|[Insertion Sort List](./Algorithms/147.insertion-sort-list)|33%|Medium|❤️|
+|148|[Sort List](./Algorithms/148.sort-list)|29%|Medium|❤️|
+|149|[Max Points on a Line](./Algorithms/149.max-points-on-a-line)|15%|Hard|❤️|
+|150|[Evaluate Reverse Polish Notation](./Algorithms/150.evaluate-reverse-polish-notation)|28%|Medium||
+|152|[Maximum Product Subarray](./Algorithms/152.maximum-product-subarray)|26%|Medium|❤️|
+|153|[Find Minimum in Rotated Sorted Array](./Algorithms/153.find-minimum-in-rotated-sorted-array)|40%|Medium||
+|154|[Find Minimum in Rotated Sorted Array II](./Algorithms/154.find-minimum-in-rotated-sorted-array-ii)|37%|Hard||
+|155|[Min Stack](./Algorithms/155.min-stack)|31%|Easy||
+|162|[Find Peak Element](./Algorithms/162.find-peak-element)|38%|Medium||
+|164|[Maximum Gap](./Algorithms/164.maximum-gap)|30%|Hard||
+|165|[Compare Version Numbers](./Algorithms/165.compare-version-numbers)|20%|Medium||
+|166|[Fraction to Recurring Decimal](./Algorithms/166.fraction-to-recurring-decimal)|18%|Medium|❤️|
+|167|[Two Sum II - Input array is sorted](./Algorithms/167.two-sum-ii-input-array-is-sorted)|47%|Easy||
+|168|[Excel Sheet Column Title](./Algorithms/168.excel-sheet-column-title)|27%|Easy|❤️|
+|169|[Majority Element](./Algorithms/169.majority-element)|48%|Easy|❤️|
+|171|[Excel Sheet Column Number](./Algorithms/171.excel-sheet-column-number)|48%|Easy||
+|172|[Factorial Trailing Zeroes](./Algorithms/172.factorial-trailing-zeroes)|36%|Easy||
+|174|[Dungeon Game](./Algorithms/174.dungeon-game)|24%|Hard|❤️|
+|179|[Largest Number](./Algorithms/179.largest-number)|23%|Medium|❤️|
+|187|[Repeated DNA Sequences](./Algorithms/187.repeated-dna-sequences)|33%|Medium||
+|188|[Best Time to Buy and Sell Stock IV](./Algorithms/188.best-time-to-buy-and-sell-stock-iv)|24%|Hard|❤️|
+|189|[Rotate Array](./Algorithms/189.rotate-array)|25%|Easy||
+|198|[House Robber](./Algorithms/198.house-robber)|39%|Easy|❤️|
+|199|[Binary Tree Right Side View](./Algorithms/199.binary-tree-right-side-view)|42%|Medium||
+|200|[Number of Islands](./Algorithms/200.number-of-islands)|36%|Medium||
+|201|[Bitwise AND of Numbers Range](./Algorithms/201.bitwise-and-of-numbers-range)|34%|Medium|❤️|
+|202|[Happy Number](./Algorithms/202.happy-number)|41%|Easy||
+|203|[Remove Linked List Elements](./Algorithms/203.remove-linked-list-elements)|33%|Easy||
+|204|[Count Primes](./Algorithms/204.count-primes)|26%|Easy|❤️|
+|205|[Isomorphic Strings](./Algorithms/205.isomorphic-strings)|34%|Easy|❤️|
+|206|[Reverse Linked List](./Algorithms/206.Reverse-Linked-List)|46%|Easy||
+|207|[Course Schedule](./Algorithms/207.course-schedule)|33%|Medium|❤️|
+|208|[Implement Trie (Prefix Tree)](./Algorithms/208.implement-trie-prefix-tree)|30%|Medium|❤️|
+|209|[Minimum Size Subarray Sum](./Algorithms/209.minimum-size-subarray-sum)|32%|Medium||
+|210|[Course Schedule II](./Algorithms/210.course-schedule-ii)|30%|Medium||
+|211|[Add and Search Word - Data structure design](./Algorithms/211.add-and-search-word-data-structure-design)|25%|Medium|❤️|
+|212|[Word Search II](./Algorithms/212.word-search-ii)|24%|Hard|❤️|
+|213|[House Robber II](./Algorithms/213.house-robber-ii)|34%|Medium||
+|214|[Shortest Palindrome](./Algorithms/214.shortest-palindrome)|25%|Hard|❤️|
+|215|[Kth Largest Element in an Array](./Algorithms/215.kth-largest-element-in-an-array)|40%|Medium|❤️|
+|216|[Combination Sum III](./Algorithms/216.combination-sum-iii)|47%|Medium||
+|217|[Contains Duplicate](./Algorithms/217.contains-duplicate)|47%|Easy||
+|218|[The Skyline Problem](./Algorithms/218.the-skyline-problem)|29%|Hard|❤️|
+|219|[Contains Duplicate II](./Algorithms/219.contains-duplicate-ii)|32%|Easy||
+|220|[Contains Duplicate III](./Algorithms/220.contains-duplicate-iii)|18%|Medium|❤️|
+|221|[Maximal Square](./Algorithms/221.maximal-square)|30%|Medium|❤️|
+|223|[Rectangle Area](./Algorithms/223.rectangle-area)|33%|Medium||
+|224|[Basic Calculator](./Algorithms/224.basic-calculator)|28%|Hard||
+|225|[Implement Stack using Queues](./Algorithms/225.implement-stack-using-queues)|34%|Easy||
+|226|[Invert Binary Tree](./Algorithms/226.invert-binary-tree)|53%|Easy||
+|227|[Basic Calculator II](./Algorithms/227.basic-calculator-ii)|30%|Medium||
+|228|[Summary Ranges](./Algorithms/228.summary-ranges)|32%|Medium||
+|229|[Majority Element II](./Algorithms/229.majority-element-ii)|29%|Medium|❤️|
+|230|[Kth Smallest Element in a BST](./Algorithms/230.kth-smallest-element-in-a-bst)|45%|Medium||
+|231|[Power of Two](./Algorithms/231.power-of-two)|40%|Easy||
+|232|[Implement Queue using Stacks](./Algorithms/232.implement-queue-using-stacks)|38%|Easy||
+|233|[Number of Digit One](./Algorithms/233.number-of-digit-one)|29%|Hard|❤️|
+|234|[Palindrome Linked List](./Algorithms/234.palindrome-linked-list)|33%|Easy||
+|238|[Product of Array Except Self](./Algorithms/238.product-of-array-except-self)|50%|Medium||
+|239|[Sliding Window Maximum](./Algorithms/239.sliding-window-maximum)|34%|Hard|❤️|
+|240|[Search a 2D Matrix II](./Algorithms/240.search-a-2d-matrix-ii)|39%|Medium|❤️|
+|241|[Different Ways to Add Parentheses](./Algorithms/241.different-ways-to-add-parentheses)|46%|Medium||
+|242|[Valid Anagram](./Algorithms/242.valid-anagram)|47%|Easy||
+|257|[Binary Tree Paths](./Algorithms/257.binary-tree-paths)|41%|Easy||
+|258|[Add Digits](./Algorithms/258.add-digits)|51%|Easy||
+|260|[Single Number III](./Algorithms/260.single-number-iii)|53%|Medium|❤️|
+|263|[Ugly Number](./Algorithms/263.ugly-number)|39%|Easy||
+|264|[Ugly Number II](./Algorithms/264.ugly-number-ii)|33%|Medium|❤️|
+|268|[Missing Number](./Algorithms/268.missing-number)|45%|Easy||
+|273|[Integer to English Words](./Algorithms/273.integer-to-english-words)|22%|Hard|❤️|
+|274|[H-Index](./Algorithms/274.h-index)|33%|Medium||
+|275|[H-Index II](./Algorithms/275.h-index-ii)|34%|Medium|❤️|
+|279|[Perfect Squares](./Algorithms/279.perfect-squares)|37%|Medium|❤️|
+|282|[Expression Add Operators](./Algorithms/282.expression-add-operators)|30%|Hard|❤️|
+|283|[Move Zeroes](./Algorithms/283.move-zeroes)|51%|Easy||
+|287|[Find the Duplicate Number](./Algorithms/287.find-the-duplicate-number)|44%|Medium|❤️|
+|289|[Game of Life](./Algorithms/289.game-of-life)|37%|Medium|❤️|
+|290|[Word Pattern](./Algorithms/290.word-pattern)|33%|Easy||
+|292|[Nim Game](./Algorithms/292.nim-game)|55%|Easy|❤️|
+|295|[Find Median from Data Stream](./Algorithms/295.find-median-from-data-stream)|29%|Hard|❤️|
+|299|[Bulls and Cows](./Algorithms/299.bulls-and-cows)|35%|Medium||
+|300|[Longest Increasing Subsequence](./Algorithms/300.longest-increasing-subsequence)|38%|Medium|❤️|
+|301|[Remove Invalid Parentheses](./Algorithms/301.remove-invalid-parentheses)|35%|Hard|❤️|
+|303|[Range Sum Query - Immutable](./Algorithms/303.range-sum-query-immutable)|32%|Easy||
+|304|[Range Sum Query 2D - Immutable](./Algorithms/304.range-sum-query-2d-immutable)|27%|Medium||
+|306|[Additive Number](./Algorithms/306.additive-number)|27%|Medium||
+|307|[Range Sum Query - Mutable](./Algorithms/307.range-sum-query-mutable)|22%|Medium||
+|309|[Best Time to Buy and Sell Stock with Cooldown](./Algorithms/309.best-time-to-buy-and-sell-stock-with-cooldown)|41%|Medium|❤️|
+|310|[Minimum Height Trees](./Algorithms/310.minimum-height-trees)|28%|Medium||
+|312|[Burst Balloons](./Algorithms/312.burst-balloons)|43%|Hard|❤️|
+|313|[Super Ugly Number](./Algorithms/313.super-ugly-number)|38%|Medium|❤️|
+|315|[Count of Smaller Numbers After Self](./Algorithms/315.count-of-smaller-numbers-after-self)|34%|Hard|❤️|
+|316|[Remove Duplicate Letters](./Algorithms/316.remove-duplicate-letters)|30%|Hard|❤️|
+|318|[Maximum Product of Word Lengths](./Algorithms/318.maximum-product-of-word-lengths)|45%|Medium|❤️|
+|319|[Bulb Switcher](./Algorithms/319.bulb-switcher)|42%|Medium|❤️|
+|321|[Create Maximum Number](./Algorithms/321.create-maximum-number)|24%|Hard|❤️|
+|322|[Coin Change](./Algorithms/322.coin-change)|26%|Medium|❤️|
+|324|[Wiggle Sort II](./Algorithms/324.wiggle-sort-ii)|26%|Medium||
+|326|[Power of Three](./Algorithms/326.power-of-three)|40%|Easy|❤️|
+|327|[Count of Range Sum](./Algorithms/327.count-of-range-sum)|30%|Hard|❤️|
+|328|[Odd Even Linked List](./Algorithms/328.odd-even-linked-list)|44%|Medium|❤️|
+|329|[Longest Increasing Path in a Matrix](./Algorithms/329.longest-increasing-path-in-a-matrix)|37%|Hard|❤️|
+|330|[Patching Array](./Algorithms/330.patching-array)|32%|Hard||
+|331|[Verify Preorder Serialization of a Binary Tree](./Algorithms/331.verify-preorder-serialization-of-a-binary-tree)|37%|Medium|❤️|
+|332|[Reconstruct Itinerary](./Algorithms/332.reconstruct-itinerary)|29%|Medium|❤️|
+|334|[Increasing Triplet Subsequence](./Algorithms/334.increasing-triplet-subsequence)|39%|Medium|❤️|
+|335|[Self Crossing](./Algorithms/335.self-crossing)|26%|Hard||
+|336|[Palindrome Pairs](./Algorithms/336.palindrome-pairs)|27%|Hard|❤️|
+|337|[House Robber III](./Algorithms/337.house-robber-iii)|44%|Medium|❤️|
+|338|[Counting Bits](./Algorithms/338.counting-bits)|62%|Medium||
+|342|[Power of Four](./Algorithms/342.power-of-four)|39%|Easy||
+|343|[Integer Break](./Algorithms/343.integer-break)|46%|Medium||
+|344|[Reverse String](./Algorithms/344.reverse-string)|60%|Easy||
+|345|[Reverse Vowels of a String](./Algorithms/345.reverse-vowels-of-a-string)|39%|Easy||
+|347|[Top K Frequent Elements](./Algorithms/347.top-k-frequent-elements)|49%|Medium||
+|349|[Intersection of Two Arrays](./Algorithms/349.intersection-of-two-arrays)|48%|Easy||
+|350|[Intersection of Two Arrays II](./Algorithms/350.intersection-of-two-arrays-ii)|44%|Easy|❤️|
+|352|[Data Stream as Disjoint Intervals](./Algorithms/352.data-stream-as-disjoint-intervals)|41%|Hard||
+|354|[Russian Doll Envelopes](./Algorithms/354.russian-doll-envelopes)|32%|Hard|❤️|
+|355|[Design Twitter](./Algorithms/355.design-twitter)|25%|Medium|❤️|
+|357|[Count Numbers with Unique Digits](./Algorithms/357.count-numbers-with-unique-digits)|46%|Medium|❤️|
+|363|[Max Sum of Rectangle No Larger Than K](./Algorithms/363.max-sum-of-rectangle-no-larger-than-k)|33%|Hard|❤️|
+|365|[Water and Jug Problem](./Algorithms/365.water-and-jug-problem)|28%|Medium|❤️|
+|367|[Valid Perfect Square](./Algorithms/367.valid-perfect-square)|38%|Easy||
+|368|[Largest Divisible Subset](./Algorithms/368.largest-divisible-subset)|33%|Medium|❤️|
+|371|[Sum of Two Integers](./Algorithms/371.sum-of-two-integers)|50%|Easy|❤️|
+|372|[Super Pow](./Algorithms/372.super-pow)|34%|Medium||
+|373|[Find K Pairs with Smallest Sums](./Algorithms/373.find-k-pairs-with-smallest-sums)|31%|Medium|❤️|
+|375|[Guess Number Higher or Lower II](./Algorithms/375.guess-number-higher-or-lower-ii)|36%|Medium||
+|376|[Wiggle Subsequence](./Algorithms/376.wiggle-subsequence)|36%|Medium|❤️|
+|377|[Combination Sum IV](./Algorithms/377.combination-sum-iv)|42%|Medium||
+|378|[Kth Smallest Element in a Sorted Matrix](./Algorithms/378.kth-smallest-element-in-a-sorted-matrix)|45%|Medium|❤️|
+|380|[Insert Delete GetRandom O(1)](./Algorithms/380.insert-delete-getrandom-o1)|39%|Medium|❤️|
+|381|[Insert Delete GetRandom O(1) - Duplicates allowed](./Algorithms/381.insert-delete-getrandom-o1-duplicates-allowed)|29%|Hard|❤️|
+|382|[Linked List Random Node](./Algorithms/382.linked-list-random-node)|47%|Medium||
+|383|[Ransom Note](./Algorithms/383.ransom-note)|47%|Easy||
+|384|[Shuffle an Array](./Algorithms/384.shuffle-an-array)|47%|Medium|❤️|
+|385|[Mini Parser](./Algorithms/385.mini-parser)|30%|Medium|❤️|
+|387|[First Unique Character in a String](./Algorithms/387.first-unique-character-in-a-string)|47%|Easy||
+|388|[Longest Absolute File Path](./Algorithms/388.longest-absolute-file-path)|37%|Medium||
+|389|[Find the Difference](./Algorithms/389.find-the-difference)|51%|Easy||
+|390|[Elimination Game](./Algorithms/390.elimination-game)|42%|Medium|❤️|
+|391|[Perfect Rectangle](./Algorithms/391.perfect-rectangle)|27%|Hard||
+|392|[Is Subsequence](./Algorithms/392.is-subsequence)|44%|Medium|❤️|
+|393|[UTF-8 Validation](./Algorithms/393.utf-8-validation)|34%|Medium|❤️|
+|394|[Decode String](./Algorithms/394.decode-string)|42%|Medium||
+|395|[Longest Substring with At Least K Repeating Characters](./Algorithms/395.longest-substring-with-at-least-k-repeating-characters)|35%|Medium||
+|396|[Rotate Function](./Algorithms/396.rotate-function)|33%|Medium|❤️|
+|397|[Integer Replacement](./Algorithms/397.integer-replacement)|30%|Medium|❤️|
+|398|[Random Pick Index](./Algorithms/398.random-pick-index)|44%|Medium||
+|399|[Evaluate Division](./Algorithms/399.evaluate-division)|42%|Medium|❤️|
+|400|[Nth Digit](./Algorithms/400.nth-digit)|30%|Easy|❤️|
+|401|[Binary Watch](./Algorithms/401.binary-watch)|44%|Easy||
+|402|[Remove K Digits](./Algorithms/402.remove-k-digits)|25%|Medium|❤️|
+|403|[Frog Jump](./Algorithms/403.frog-jump)|32%|Hard|❤️|
+|404|[Sum of Left Leaves](./Algorithms/404.sum-of-left-leaves)|47%|Easy||
+|405|[Convert a Number to Hexadecimal](./Algorithms/405.convert-a-number-to-hexadecimal)|41%|Easy||
+|406|[Queue Reconstruction by Height](./Algorithms/406.queue-reconstruction-by-height)|56%|Medium|❤️|
+|407|[Trapping Rain Water II](./Algorithms/407.trapping-rain-water-ii)|37%|Hard||
+|409|[Longest Palindrome](./Algorithms/409.longest-palindrome)|45%|Easy||
+|410|[Split Array Largest Sum](./Algorithms/410.split-array-largest-sum)|39%|Hard||
+|412|[Fizz Buzz](./Algorithms/412.Fizz-Buzz)|58%|Easy||
+|413|[Arithmetic Slices](./Algorithms/413.arithmetic-slices)|54%|Medium||
+|414|[Third Maximum Number](./Algorithms/414.third-maximum-number)|28%|Easy||
+|415|[Add Strings](./Algorithms/415.add-strings)|41%|Easy||
+|416|[Partition Equal Subset Sum](./Algorithms/416.partition-equal-subset-sum)|38%|Medium|❤️|
+|417|[Pacific Atlantic Water Flow](./Algorithms/417.pacific-atlantic-water-flow)|34%|Medium||
+|419|[Battleships in a Board](./Algorithms/419.battleships-in-a-board)|63%|Medium||
+|420|[Strong Password Checker](./Algorithms/420.strong-password-checker)|19%|Hard|❤️|
+|421|[Maximum XOR of Two Numbers in an Array](./Algorithms/421.maximum-xor-of-two-numbers-in-an-array)|47%|Medium|❤️|
+|423|[Reconstruct Original Digits from English](./Algorithms/423.reconstruct-original-digits-from-english)|44%|Medium||
+|424|[Longest Repeating Character Replacement](./Algorithms/424.longest-repeating-character-replacement)|42%|Medium|❤️|
+|432|[All O`one Data Structure](./Algorithms/432.all-oone-data-structure)|27%|Hard|❤️|
+|434|[Number of Segments in a String](./Algorithms/434.number-of-segments-in-a-string)|36%|Easy||
+|435|[Non-overlapping Intervals](./Algorithms/435.non-overlapping-intervals)|41%|Medium|❤️|
+|436|[Find Right Interval](./Algorithms/436.find-right-interval)|41%|Medium||
+|437|[Path Sum III](./Algorithms/437.path-sum-iii)|40%|Easy|❤️|
+|438|[Find All Anagrams in a String](./Algorithms/438.find-all-anagrams-in-a-string)|33%|Easy||
+|440|[K-th Smallest in Lexicographical Order](./Algorithms/440.k-th-smallest-in-lexicographical-order)|25%|Hard|❤️|
+|441|[Arranging Coins](./Algorithms/441.arranging-coins)|36%|Easy||
+|442|[Find All Duplicates in an Array](./Algorithms/442.find-all-duplicates-in-an-array)|56%|Medium||
+|443|[String Compression](./Algorithms/443.string-compression)|35%|Easy|❤️|
+|445|[Add Two Numbers II](./Algorithms/445.add-two-numbers-ii)|46%|Medium|❤️|
+|446|[Arithmetic Slices II - Subsequence](./Algorithms/446.arithmetic-slices-ii-subsequence)|28%|Hard|❤️|
+|447|[Number of Boomerangs](./Algorithms/447.number-of-boomerangs)|46%|Easy||
+|448|[Find All Numbers Disappeared in an Array](./Algorithms/448.find-all-numbers-disappeared-in-an-array)|51%|Easy||
+|450|[Delete Node in a BST](./Algorithms/450.delete-node-in-a-bst)|37%|Medium|❤️|
+|451|[Sort Characters By Frequency](./Algorithms/451.sort-characters-by-frequency)|51%|Medium||
+|452|[Minimum Number of Arrows to Burst Balloons](./Algorithms/452.minimum-number-of-arrows-to-burst-balloons)|44%|Medium||
+|453|[Minimum Moves to Equal Array Elements](./Algorithms/453.minimum-moves-to-equal-array-elements)|48%|Easy||
+|454|[4Sum II](./Algorithms/454.4sum-ii)|47%|Medium||
+|455|[Assign Cookies](./Algorithms/455.assign-cookies)|47%|Easy||
+|456|[132 Pattern](./Algorithms/456.132-pattern)|27%|Medium|❤️|
+|459|[Repeated Substring Pattern](./Algorithms/459.repeated-substring-pattern)|38%|Easy|❤️|
+|460|[LFU Cache](./Algorithms/460.lfu-cache)|25%|Hard||
+|461|[Hamming Distance](./Algorithms/461.hamming-distance)|69%|Easy||
+|462|[Minimum Moves to Equal Array Elements II](./Algorithms/462.minimum-moves-to-equal-array-elements-ii)|51%|Medium||
+|463|[Island Perimeter](./Algorithms/463.island-perimeter)|57%|Easy||
+|464|[Can I Win](./Algorithms/464.can-i-win)|25%|Medium|❤️|
+|466|[Count The Repetitions](./Algorithms/466.count-the-repetitions)|27%|Hard|❤️|
+|467|[Unique Substrings in Wraparound String](./Algorithms/467.unique-substrings-in-wraparound-string)|33%|Medium|❤️|
+|468|[Validate IP Address](./Algorithms/468.validate-ip-address)|20%|Medium||
+|472|[Concatenated Words](./Algorithms/472.concatenated-words)|30%|Hard||
+|473|[Matchsticks to Square](./Algorithms/473.matchsticks-to-square)|35%|Medium|❤️|
+|474|[Ones and Zeroes](./Algorithms/474.ones-and-zeroes)|38%|Medium||
+|475|[Heaters](./Algorithms/475.heaters)|29%|Easy||
+|476|[Number Complement](./Algorithms/476.number-complement)|61%|Easy||
+|477|[Total Hamming Distance](./Algorithms/477.total-hamming-distance)|47%|Medium|❤️|
+|479|[Largest Palindrome Product](./Algorithms/479.largest-palindrome-product)|25%|Easy||
+|480|[Sliding Window Median](./Algorithms/480.sliding-window-median)|30%|Hard|❤️|
+|481|[Magical String](./Algorithms/481.magical-string)|45%|Medium||
+|482|[License Key Formatting](./Algorithms/482.license-key-formatting)|39%|Easy||
+|483|[Smallest Good Base](./Algorithms/483.smallest-good-base)|33%|Hard|❤️|
+|485|[Max Consecutive Ones](./Algorithms/485.max-consecutive-ones)|53%|Easy||
+|486|[Predict the Winner](./Algorithms/486.predict-the-winner)|45%|Medium||
+|488|[Zuma Game](./Algorithms/488.zuma-game)|37%|Hard|❤️|
+|491|[Increasing Subsequences](./Algorithms/491.increasing-subsequences)|38%|Medium|❤️|
+|492|[Construct the Rectangle](./Algorithms/492.construct-the-rectangle)|48%|Easy|❤️|
+|493|[Reverse Pairs](./Algorithms/493.reverse-pairs)|20%|Hard||
+|494|[Target Sum](./Algorithms/494.target-sum)|43%|Medium|❤️|
+|495|[Teemo Attacking](./Algorithms/495.teemo-attacking)|51%|Medium||
+|496|[Next Greater Element I](./Algorithms/496.next-greater-element-i)|56%|Easy||
+|498|[Diagonal Traverse](./Algorithms/498.diagonal-traverse)|46%|Medium||
+|500|[Keyboard Row](./Algorithms/500.keyboard-row)|59%|Easy||
+|501|[Find Mode in Binary Search Tree](./Algorithms/501.find-mode-in-binary-search-tree)|37%|Easy|❤️|
+|502|[IPO](./Algorithms/502.ipo)|36%|Hard||
+|503|[Next Greater Element II](./Algorithms/503.next-greater-element-ii)|48%|Medium|❤️|
+|504|[Base 7](./Algorithms/504.base-7)|43%|Easy||
+|506|[Relative Ranks](./Algorithms/506.relative-ranks)|46%|Easy||
+|507|[Perfect Number](./Algorithms/507.perfect-number)|32%|Easy||
+|508|[Most Frequent Subtree Sum](./Algorithms/508.most-frequent-subtree-sum)|52%|Medium||
+|513|[Find Bottom Left Tree Value](./Algorithms/513.find-bottom-left-tree-value)|56%|Medium||
+|514|[Freedom Trail](./Algorithms/514.freedom-trail)|39%|Hard||
+|515|[Find Largest Value in Each Tree Row](./Algorithms/515.find-largest-value-in-each-tree-row)|55%|Medium||
+|516|[Longest Palindromic Subsequence](./Algorithms/516.longest-palindromic-subsequence)|42%|Medium|❤️|
+|517|[Super Washing Machines](./Algorithms/517.super-washing-machines)|36%|Hard|❤️|
+|520|[Detect Capital](./Algorithms/520.detect-capital)|51%|Easy||
+|521|[Longest Uncommon Subsequence I](./Algorithms/521.longest-uncommon-subsequence-i)|55%|Easy||
+|522|[Longest Uncommon Subsequence II](./Algorithms/522.longest-uncommon-subsequence-ii)|31%|Medium||
+|523|[Continuous Subarray Sum](./Algorithms/523.continuous-subarray-sum)|23%|Medium|❤️|
+|524|[Longest Word in Dictionary through Deleting](./Algorithms/524.longest-word-in-dictionary-through-deleting)|43%|Medium||
+|525|[Contiguous Array](./Algorithms/525.contiguous-array)|41%|Medium|❤️|
+|526|[Beautiful Arrangement](./Algorithms/526.beautiful-arrangement)|53%|Medium|❤️|
+|529|[Minesweeper](./Algorithms/529.minesweeper)|49%|Medium||
+|530|[Minimum Absolute Difference in BST](./Algorithms/530.minimum-absolute-difference-in-bst)|47%|Easy|❤️|
+|532|[K-diff Pairs in an Array](./Algorithms/532.k-diff-pairs-in-an-array)|28%|Easy||
+|537|[Complex Number Multiplication](./Algorithms/537.complex-number-multiplication)|63%|Medium||
+|538|[Convert BST to Greater Tree](./Algorithms/538.convert-bst-to-greater-tree)|48%|Easy||
+|539|[Minimum Time Difference](./Algorithms/539.minimum-time-difference)|46%|Medium||
+|540|[Single Element in a Sorted Array](./Algorithms/540.single-element-in-a-sorted-array)|55%|Medium||
+|541|[Reverse String II](./Algorithms/541.reverse-string-ii)|43%|Easy||
+|542|[01 Matrix](./Algorithms/542.01-matrix)|33%|Medium|❤️|
+|543|[Diameter of Binary Tree](./Algorithms/543.diameter-of-binary-tree)|44%|Easy||
+|546|[Remove Boxes](./Algorithms/546.remove-boxes)|35%|Hard|❤️|
+|547|[Friend Circles](./Algorithms/547.friend-circles)|49%|Medium|❤️|
+|551|[Student Attendance Record I](./Algorithms/551.student-attendance-record-i)|44%|Easy||
+|552|[Student Attendance Record II](./Algorithms/552.student-attendance-record-ii)|31%|Hard|❤️|
+|553|[Optimal Division](./Algorithms/553.optimal-division)|55%|Medium||
+|554|[Brick Wall](./Algorithms/554.brick-wall)|46%|Medium||
+|556|[Next Greater Element III](./Algorithms/556.next-greater-element-iii)|28%|Medium||
+|557|[Reverse Words in a String III](./Algorithms/557.reverse-words-in-a-string-iii)|60%|Easy||
+|560|[Subarray Sum Equals K](./Algorithms/560.subarray-sum-equals-k)|39%|Medium|❤️|
+|561|[Array Partition I](./Algorithms/561.array-partition-i)|66%|Easy||
+|563|[Binary Tree Tilt](./Algorithms/563.binary-tree-tilt)|47%|Easy||
+|564|[Find the Closest Palindrome](./Algorithms/564.find-the-closest-palindrome)|17%|Hard||
+|565|[Array Nesting](./Algorithms/565.array-nesting)|49%|Medium||
+|566|[Reshape the Matrix](./Algorithms/566.reshape-the-matrix)|57%|Easy||
+|567|[Permutation in String](./Algorithms/567.permutation-in-string)|36%|Medium||
+|572|[Subtree of Another Tree](./Algorithms/572.subtree-of-another-tree)|40%|Easy|❤️|
+|575|[Distribute Candies](./Algorithms/575.distribute-candies)|57%|Easy||
+|576|[Out of Boundary Paths](./Algorithms/576.out-of-boundary-paths)|30%|Medium|❤️|
+|581|[Shortest Unsorted Continuous Subarray](./Algorithms/581.shortest-unsorted-continuous-subarray)|29%|Easy|❤️|
+|583|[Delete Operation for Two Strings](./Algorithms/583.delete-operation-for-two-strings)|44%|Medium|❤️|
+|587|[Erect the Fence](./Algorithms/587.erect-the-fence)|33%|Hard|❤️|
+|591|[Tag Validator](./Algorithms/591.tag-validator)|31%|Hard|❤️|
+|592|[Fraction Addition and Subtraction](./Algorithms/592.fraction-addition-and-subtraction)|46%|Medium||
+|593|[Valid Square](./Algorithms/593.valid-square)|39%|Medium||
+|594|[Longest Harmonious Subsequence](./Algorithms/594.longest-harmonious-subsequence)|40%|Easy||
+|598|[Range Addition II](./Algorithms/598.range-addition-ii)|48%|Easy||
+|599|[Minimum Index Sum of Two Lists](./Algorithms/599.minimum-index-sum-of-two-lists)|46%|Easy||
+|600|[Non-negative Integers without Consecutive Ones](./Algorithms/600.non-negative-integers-without-consecutive-ones)|31%|Hard|❤️|
+|605|[Can Place Flowers](./Algorithms/605.can-place-flowers)|30%|Easy|❤️|
+|606|[Construct String from Binary Tree](./Algorithms/606.construct-string-from-binary-tree)|49%|Easy||
+|609|[Find Duplicate File in System](./Algorithms/609.find-duplicate-file-in-system)|52%|Medium||
+|611|[Valid Triangle Number](./Algorithms/611.valid-triangle-number)|42%|Medium|❤️|
+|617|[Merge Two Binary Trees](./Algorithms/617.merge-two-binary-trees)|67%|Easy||
+|621|[Task Scheduler](./Algorithms/621.task-scheduler)|42%|Medium|❤️|
+|623|[Add One Row to Tree](./Algorithms/623.add-one-row-to-tree)|46%|Medium||
+|628|[Maximum Product of Three Numbers](./Algorithms/628.maximum-product-of-three-numbers)|44%|Easy|❤️|
+|629|[K Inverse Pairs Array](./Algorithms/629.k-inverse-pairs-array)|27%|Hard||
+|630|[Course Schedule III](./Algorithms/630.course-schedule-iii)|29%|Hard|❤️|
+|632|[Smallest Range](./Algorithms/632.smallest-range)|41%|Hard||
+|633|[Sum of Square Numbers](./Algorithms/633.sum-of-square-numbers)|32%|Easy||
+|636|[Exclusive Time of Functions](./Algorithms/636.exclusive-time-of-functions)|44%|Medium|❤️|
+|637|[Average of Levels in Binary Tree](./Algorithms/637.average-of-levels-in-binary-tree)|55%|Easy||
+|638|[Shopping Offers](./Algorithms/638.shopping-offers)|45%|Medium|❤️|
+|639|[Decode Ways II](./Algorithms/639.decode-ways-ii)|24%|Hard||
+|640|[Solve the Equation](./Algorithms/640.solve-the-equation)|38%|Medium||
+|643|[Maximum Average Subarray I](./Algorithms/643.maximum-average-subarray-i)|37%|Easy||
+|645|[Set Mismatch](./Algorithms/645.set-mismatch)|39%|Easy|❤️|
+|646|[Maximum Length of Pair Chain](./Algorithms/646.maximum-length-of-pair-chain)|47%|Medium||
+|647|[Palindromic Substrings](./Algorithms/647.palindromic-substrings)|54%|Medium|❤️|
+|648|[Replace Words](./Algorithms/648.replace-words)|47%|Medium||
+|649|[Dota2 Senate](./Algorithms/649.dota2-senate)|36%|Medium|❤️|
+|650|[2 Keys Keyboard](./Algorithms/650.2-keys-keyboard)|44%|Medium||
+|652|[Find Duplicate Subtrees](./Algorithms/652.find-duplicate-subtrees)|36%|Medium||
+|653|[Two Sum IV - Input is a BST](./Algorithms/653.two-sum-iv-input-is-a-bst)|49%|Easy||
+|654|[Maximum Binary Tree](./Algorithms/654.maximum-binary-tree)|69%|Medium|❤️|
+|655|[Print Binary Tree](./Algorithms/655.print-binary-tree)|49%|Medium||
+|657|[Judge Route Circle](./Algorithms/657.judge-route-circle)|68%|Easy||
+|658|[Find K Closest Elements](./Algorithms/658.find-k-closest-elements)|34%|Medium|❤️|
+|659|[Split Array into Consecutive Subsequences](./Algorithms/659.split-array-into-consecutive-subsequences)|36%|Medium|❤️|
+|661|[Image Smoother](./Algorithms/661.image-smoother)|46%|Easy||
+|662|[Maximum Width of Binary Tree](./Algorithms/662.maximum-width-of-binary-tree)|37%|Medium||
+|664|[Strange Printer](./Algorithms/664.strange-printer)|34%|Hard|❤️|
+|665|[Non-decreasing Array](./Algorithms/665.non-decreasing-array)|20%|Easy||
+|667|[Beautiful Arrangement II](./Algorithms/667.beautiful-arrangement-ii)|51%|Medium||
+|668|[Kth Smallest Number in Multiplication Table](./Algorithms/668.kth-smallest-number-in-multiplication-table)|40%|Hard||
+|669|[Trim a Binary Search Tree](./Algorithms/669.trim-a-binary-search-tree)|58%|Easy||
+|670|[Maximum Swap](./Algorithms/670.maximum-swap)|38%|Medium|❤️|
+|671|[Second Minimum Node In a Binary Tree](./Algorithms/671.second-minimum-node-in-a-binary-tree)|41%|Easy||
+|672|[Bulb Switcher II](./Algorithms/672.bulb-switcher-ii)|49%|Medium||
+|673|[Number of Longest Increasing Subsequence](./Algorithms/673.number-of-longest-increasing-subsequence)|31%|Medium|❤️|
+|674|[Longest Continuous Increasing Subsequence](./Algorithms/674.longest-continuous-increasing-subsequence)|42%|Easy||
+|675|[Cut Off Trees for Golf Event](./Algorithms/675.cut-off-trees-for-golf-event)|27%|Hard|❤️|
+|676|[Implement Magic Dictionary](./Algorithms/676.implement-magic-dictionary)|49%|Medium||
+|677|[Map Sum Pairs](./Algorithms/677.map-sum-pairs)|51%|Medium|❤️|
+|678|[Valid Parenthesis String](./Algorithms/678.valid-parenthesis-string)|29%|Medium|❤️|
+|679|[24 Game](./Algorithms/679.24-game)|38%|Hard|❤️|
+|680|[Valid Palindrome II](./Algorithms/680.valid-palindrome-ii)|32%|Easy||
+|682|[Baseball Game](./Algorithms/682.baseball-game)|58%|Easy||
+|684|[Redundant Connection](./Algorithms/684.redundant-connection)|43%|Medium||
+|685|[Redundant Connection II](./Algorithms/685.redundant-connection-ii)|27%|Hard|❤️|
+|686|[Repeated String Match](./Algorithms/686.repeated-string-match)|32%|Easy|❤️|
+|687|[Longest Univalue Path](./Algorithms/687.longest-univalue-path)|32%|Easy||
+|688|[Knight Probability in Chessboard](./Algorithms/688.knight-probability-in-chessboard)|39%|Medium||
+|689|[Maximum Sum of 3 Non-Overlapping Subarrays](./Algorithms/689.maximum-sum-of-3-non-overlapping-subarrays)|41%|Hard||
+|691|[Stickers to Spell Word](./Algorithms/691.stickers-to-spell-word)|34%|Hard|❤️|
+|692|[Top K Frequent Words](./Algorithms/692.top-k-frequent-words)|41%|Medium||
+|693|[Binary Number with Alternating Bits](./Algorithms/693.binary-number-with-alternating-bits)|55%|Easy||
+|695|[Max Area of Island](./Algorithms/695.max-area-of-island)|51%|Easy|❤️|
+|696|[Count Binary Substrings](./Algorithms/696.count-binary-substrings)|50%|Easy||
+|697|[Degree of an Array](./Algorithms/697.degree-of-an-array)|46%|Easy||
+|698|[Partition to K Equal Sum Subsets](./Algorithms/698.partition-to-k-equal-sum-subsets)|37%|Medium|❤️|
+|699|[Falling Squares](./Algorithms/699.falling-squares)|37%|Hard||
+|712|[Minimum ASCII Delete Sum for Two Strings](./Algorithms/712.minimum-ascii-delete-sum-for-two-strings)|51%|Medium|❤️|
+|713|[Subarray Product Less Than K](./Algorithms/713.subarray-product-less-than-k)|33%|Medium|❤️|
+|714|[Best Time to Buy and Sell Stock with Transaction Fee](./Algorithms/714.best-time-to-buy-and-sell-stock-with-transaction-fee)|45%|Medium|❤️|
+|715|[Range Module](./Algorithms/715.range-module)|31%|Hard||
+|717|[1-bit and 2-bit Characters](./Algorithms/717.1-bit-and-2-bit-characters)|49%|Easy||
+|718|[Maximum Length of Repeated Subarray](./Algorithms/718.maximum-length-of-repeated-subarray)|41%|Medium|❤️|
+|719|[Find K-th Smallest Pair Distance](./Algorithms/719.find-k-th-smallest-pair-distance)|27%|Hard|❤️|
+|720|[Longest Word in Dictionary](./Algorithms/720.longest-word-in-dictionary)|41%|Easy||
+|721|[Accounts Merge](./Algorithms/721.accounts-merge)|32%|Medium|❤️|
+|722|[Remove Comments](./Algorithms/722.remove-comments)|27%|Medium|❤️|
+|724|[Find Pivot Index](./Algorithms/724.find-pivot-index)|39%|Easy||
+|725|[Split Linked List in Parts](./Algorithms/725.split-linked-list-in-parts)|47%|Medium||
+|726|[Number of Atoms](./Algorithms/726.number-of-atoms)|43%|Hard|❤️|
+|728|[Self Dividing Numbers](./Algorithms/728.self-dividing-numbers)|66%|Easy||
+|729|[My Calendar I](./Algorithms/729.my-calendar-i)|42%|Medium||
+|730|[Count Different Palindromic Subsequences](./Algorithms/730.count-different-palindromic-subsequences)|34%|Hard|❤️|
+|731|[My Calendar II](./Algorithms/731.my-calendar-ii)|37%|Medium|❤️|
+|732|[My Calendar III](./Algorithms/732.my-calendar-iii)|50%|Hard||
+|733|[Flood Fill](./Algorithms/733.flood-fill)|47%|Easy||
+|735|[Asteroid Collision](./Algorithms/735.asteroid-collision)|37%|Medium||
+|736|[Parse Lisp Expression](./Algorithms/736.parse-lisp-expression)|42%|Hard|❤️|
+|738|[Monotone Increasing Digits](./Algorithms/738.monotone-increasing-digits)|40%|Medium||
+|739|[Daily Temperatures](./Algorithms/739.daily-temperatures)|52%|Medium|❤️|
+|740|[Delete and Earn](./Algorithms/740.delete-and-earn)|43%|Medium|❤️|
+|741|[Cherry Pickup](./Algorithms/741.cherry-pickup)|23%|Hard||
+|743|[Network Delay Time](./Algorithms/743.network-delay-time)|34%|Medium||
+|744|[Find Smallest Letter Greater Than Target](./Algorithms/744.find-smallest-letter-greater-than-target)|44%|Easy||
+|745|[Prefix and Suffix Search](./Algorithms/745.prefix-and-suffix-search)|25%|Hard||
+|746|[Min Cost Climbing Stairs](./Algorithms/746.min-cost-climbing-stairs)|43%|Easy||
+|747|[Largest Number At Least Twice of Others](./Algorithms/747.largest-number-at-least-twice-of-others)|41%|Easy||
+|748|[Shortest Completing Word](./Algorithms/748.shortest-completing-word)|51%|Medium||
+|749|[Contain Virus](./Algorithms/749.contain-virus)|39%|Hard||
+|752|[Open the Lock](./Algorithms/752.open-the-lock)|38%|Medium|❤️|
+|753|[Cracking the Safe](./Algorithms/753.cracking-the-safe)|39%|Hard|❤️|
+|754|[Reach a Number](./Algorithms/754.reach-a-number)|26%|Medium|❤️|
+|756|[Pyramid Transition Matrix](./Algorithms/756.pyramid-transition-matrix)|45%|Medium|❤️|
+|757|[Set Intersection Size At Least Two](./Algorithms/757.set-intersection-size-at-least-two)|34%|Hard||
+|761|[Special Binary String](./Algorithms/761.special-binary-string)|41%|Hard||
+|762|[Prime Number of Set Bits in Binary Representation](./Algorithms/762.prime-number-of-set-bits-in-binary-representation)|55%|Easy||
+|763|[Partition Labels](./Algorithms/763.partition-labels)|64%|Medium||
+|764|[Largest Plus Sign](./Algorithms/764.largest-plus-sign)|37%|Medium||
+|765|[Couples Holding Hands](./Algorithms/765.couples-holding-hands)|48%|Hard||
+|766|[Toeplitz Matrix](./Algorithms/766.toeplitz-matrix)|57%|Easy||
+|767|[Reorganize String](./Algorithms/767.reorganize-string)|35%|Medium||
+|768|[Max Chunks To Make Sorted II](./Algorithms/768.max-chunks-to-make-sorted-ii)|42%|Hard||
+|769|[Max Chunks To Make Sorted](./Algorithms/769.max-chunks-to-make-sorted)|47%|Medium||
+|770|[Basic Calculator IV](./Algorithms/770.basic-calculator-iv)|43%|Hard|❤️|
+|771|[Jewels and Stones](./Algorithms/771.jewels-and-stones)|82%|Easy||
+|773|[Sliding Puzzle](./Algorithms/773.sliding-puzzle)|47%|Hard||
+|775|[Global and Local Inversions](./Algorithms/775.global-and-local-inversions)|31%|Medium||
+|777|[Swap Adjacent in LR String](./Algorithms/777.swap-adjacent-in-lr-string)|27%|Medium||
+|778|[Swim in Rising Water](./Algorithms/778.swim-in-rising-water)|44%|Hard||
+|779|[K-th Symbol in Grammar](./Algorithms/779.k-th-symbol-in-grammar)|35%|Medium||
+|780|[Reaching Points](./Algorithms/780.reaching-points)|21%|Hard||
+|781|[Rabbits in Forest](./Algorithms/781.rabbits-in-forest)|49%|Medium||
+|782|[Transform to Chessboard](./Algorithms/782.transform-to-chessboard)|35%|Hard||
+|783|[Minimum Distance Between BST Nodes](./Algorithms/783.minimum-distance-between-bst-nodes)|47%|Easy||
+|784|[Letter Case Permutation](./Algorithms/784.letter-case-permutation)|52%|Easy|❤️|
+|785|[Is Graph Bipartite?](./Algorithms/785.is-graph-bipartite)|38%|Medium|❤️|
+|786|[K-th Smallest Prime Fraction](./Algorithms/786.k-th-smallest-prime-fraction)|29%|Hard|❤️|
+|787|[Cheapest Flights Within K Stops](./Algorithms/787.cheapest-flights-within-k-stops)|30%|Medium|❤️|
+|788|[Rotated Digits](./Algorithms/788.rotated-digits)|50%|Easy||
+|789|[Escape The Ghosts](./Algorithms/789.escape-the-ghosts)|47%|Medium||
+|790|[Domino and Tromino Tiling](./Algorithms/790.domino-and-tromino-tiling)|32%|Medium|❤️|
+|791|[Custom Sort String](./Algorithms/791.custom-sort-string)|60%|Medium||
+|792|[Number of Matching Subsequences](./Algorithms/792.number-of-matching-subsequences)|35%|Medium|❤️|
+|793| * Preimage Size of Factorial Zeroes Function|45%|Hard||
+|794| * Valid Tic-Tac-Toe State|27%|Medium||
+|795| * Number of Subarrays with Bounded Maximum|40%|Medium||
+|796| * Rotate String|54%|Easy||
+|797| * All Paths From Source to Target|69%|Medium||
+|798| * Smallest Rotation with Highest Score|31%|Hard||
+|799| * Champagne Tower|28%|Medium||
+|801| * Minimum Swaps To Make Sequences Increasing|23%|Medium||
+|802| * Find Eventual Safe States|35%|Medium||
+|803| * Bricks Falling When Hit|20%|Hard||
+|804| * Unique Morse Code Words|76%|Easy||
+|805| * Split Array With Same Average|19%|Hard||
+|806| * Number of Lines To Write String|64%|Easy||
+|807| * Max Increase to Keep City Skyline|82%|Medium||
+|808| * Soup Servings|30%|Medium||
+|809| * Expressive Words|34%|Medium||
+|810| * Chalkboard XOR Game|35%|Hard||
+|811| * Subdomain Visit Count|65%|Easy||
+|812| * Largest Triangle Area :new: |51%|Easy||
+|813| * Largest Sum of Averages :new: |37%|Medium||
+|814| * Binary Tree Pruning :new: |73%|Medium||
+|815| * Bus Routes :new: |30%|Hard||
+
+
+------------------------------------------------------------------
+
+以下免费的算法题，暂时不能使用 Go 解答
+
+- [116.Populating Next Right Pointers in Each Node](https://leetcode.com/problems/populating-next-right-pointers-in-each-node/)
+- [117.Populating Next Right Pointers in Each Node II](https://leetcode.com/problems/populating-next-right-pointers-in-each-node-ii/)
+- [133.Clone Graph](https://leetcode.com/problems/clone-graph/)
+- [138.Copy List with Random Pointer](https://leetcode.com/problems/copy-list-with-random-pointer/)
+- [141.Linked List Cycle](https://leetcode.com/problems/linked-list-cycle/)
+- [142.Linked List Cycle II](https://leetcode.com/problems/linked-list-cycle-ii/)
+- [151.Reverse Words in a String](https://leetcode.com/problems/reverse-words-in-a-string/)
+- [160.Intersection of Two Linked Lists](https://leetcode.com/problems/intersection-of-two-linked-lists/)
+- [173.Binary Search Tree Iterator](https://leetcode.com/problems/binary-search-tree-iterator/)
+- [190.Reverse Bits](https://leetcode.com/problems/reverse-bits/)
+- [191.Number of 1 Bits](https://leetcode.com/problems/number-of-1-bits/)
+- [222.Count Complete Tree Nodes](https://leetcode.com/problems/count-complete-tree-nodes/)
+- [235.Lowest Common Ancestor of a Binary Search Tree](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-search-tree/)
+- [236.Lowest Common Ancestor of a Binary Tree](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree/)
+- [237.Delete Node in a Linked List](https://leetcode.com/problems/delete-node-in-a-linked-list/)
+- [278.First Bad Version](https://leetcode.com/problems/first-bad-version/)
+- [284.Peeking Iterator](https://leetcode.com/problems/peeking-iterator/)
+- [297.Serialize and Deserialize Binary Tree](https://leetcode.com/problems/serialize-and-deserialize-binary-tree/)
+- [341.Flatten Nested List Iterator](https://leetcode.com/problems/flatten-nested-list-iterator/)
+- [374.Guess Number Higher or Lower](https://leetcode.com/problems/guess-number-higher-or-lower/)
+- [386.Lexicographical Numbers](https://leetcode.com/problems/lexicographical-numbers/)
+- [449.Serialize and Deserialize BST](https://leetcode.com/problems/serialize-and-deserialize-bst/)
+- [535.Encode and Decode TinyURL](https://leetcode.com/problems/encode-and-decode-tinyurl/)
+- [690.Employee Importance](https://leetcode.com/problems/employee-importance/)
+
+------------------------------------------------------------------
+
+## 二.分类
+
+## Array
+
+| Title | Solution | Difficulty | Time | Space |收藏|
+| ----- | :--------: | :----------: | :----: | :-----: | :-----: |
+|[1. Two Sum](https://leetcode.com/problems/two-sum/)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0001.%20Two%20Sum)| Easy | O(n)| O(n)||
+|[11. Container With Most Water](https://leetcode.com/problems/container-with-most-water/)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0011.%20Container%20With%20Most%20Water)| Medium | O(n)| O(1)||
+|[15. 3Sum](https://leetcode.com/problems/3sum)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0015.%203Sum)| Medium | O(n^2)| O(n)||
+|[16. 3Sum Closest](https://leetcode.com/problems/3sum-closest)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0016.%203Sum%20Closest)| Medium | O(n^2)| O(1)||
+|[18. 4Sum](https://leetcode.com/problems/4sum)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0018.%204Sum)| Medium | O(n^3)| O(n^2)||
+|[26. Remove Duplicates from Sorted Array](https://leetcode.com/problems/remove-duplicates-from-sorted-array)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0026.%20Remove%20Duplicates%20from%20Sorted%20Array)| Easy | O(n)| O(1)||
+|[27. Remove Element](https://leetcode.com/problems/remove-element)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0027.%20Remove%20Element)| Easy | O(n)| O(1)||
+|[39. Combination Sum](https://leetcode.com/problems/combination-sum)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0039.%20Combination%20Sum)| Medium | O(n log n)| O(n)||
+|[40. Combination Sum II](https://leetcode.com/problems/combination-sum-ii)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0040.%20Combination%20Sum%20II)| Medium | O(n log n)| O(n)||
+|[41. First Missing Positive](https://leetcode.com/problems/first-missing-positive)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0041.%20First-Missing-Positive)| Hard | O(n)| O(n)||
+|[42. Trapping Rain Water](https://leetcode.com/problems/trapping-rain-water)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0042.%20Trapping%20Rain%20Water)| Hard | O(n)| O(1)||
+|[48. Rotate Image](https://leetcode.com/problems/rotate-image)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0048.%20Rotate%20Image)| Medium | O(n)| O(1)||
+|[53. Maximum Subarray](https://leetcode.com/problems/maximum-subarray)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0053.%20Maximum%20Subarray)| Easy | O(n)| O(n)||
+|[54. Spiral Matrix](https://leetcode.com/problems/spiral-matrix)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0054.%20Spiral%20Matrix)| Medium | O(n)| O(n^2)||
+|[56. Merge Intervals](https://leetcode.com/problems/merge-intervals)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0056.%20Merge%20Intervals)| Medium | O(n log n)| O(1)||
+|[57. Insert Interval](https://leetcode.com/problems/insert-interval)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0057.%20Insert%20Interval)| Hard | O(n)| O(1)||
+|[59. Spiral Matrix II](https://leetcode.com/problems/spiral-matrix-ii)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0059.%20Spiral%20Matrix%20II)| Medium | O(n)| O(n^2)||
+|[62. Unique Paths](https://leetcode.com/problems/unique-paths)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0062.%20Unique%20Paths)| Medium | O(n^2)| O(n^2)||
+|[63. Unique Paths II](https://leetcode.com/problems/unique-paths-ii)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0063.%20Unique%20Paths%20II)| Medium | O(n^2)| O(n^2)||
+|[64. Minimum Path Sum](https://leetcode.com/problems/minimum-path-sum)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0064.%20Minimum%20Path%20Sum)| Medium | O(n^2)| O(n^2)||
+|[75. Sort Colors](https://leetcode.com/problems/sort-colors)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0075.%20Sort%20Colors)| Medium | O(n)| O(1)||
+|[78. Subsets](https://leetcode.com/problems/subsets)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0078.%20Subsets)| Medium | O(n^2)| O(n)||
+|[79. Word Search](https://leetcode.com/problems/word-search)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0079.%20Word%20Search)| Medium | O(n^2)| O(n^2)||
+|[80. Remove Duplicates from Sorted Array II](https://leetcode.com/problems/remove-duplicates-from-sorted-array-ii)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0080.%20Remove%20Duplicates%20from%20Sorted%20Array%20II)| Medium | O(n^2)| O(n^2)||
+|[84. Largest Rectangle in Histogram](https://leetcode.com/problems/largest-rectangle-in-histogram)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0084.%20Largest%20Rectangle%20in%20Histogram)| Medium | O(n)| O(n)||
+|[88. Merge Sorted Array](https://leetcode.com/problems/merge-sorted-array)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0088.%20Merge-Sorted-Array)| Easy | O(n)| O(1)||
+|[90. Subsets II](https://leetcode.com/problems/subsets-ii)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0090.%20Subsets%20II)| Medium | O(n^2)| O(n)||
+|[120. Triangle](https://leetcode.com/problems/triangle)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0120.%20Triangle)| Medium | O(n^2)| O(n)||
+|[121. Best Time to Buy and Sell Stock](https://leetcode.com/problems/best-time-to-buy-and-sell-stock)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0121.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock)| Easy | O(n)| O(1)||
+|[122. Best Time to Buy and Sell Stock II](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-ii)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0122.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock%20II)| Easy | O(n)| O(1)||
+|[126. Word Ladder II](https://leetcode.com/problems/word-ladder-ii)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0126.%20Word%20Ladder%20II)| Hard | O(n)| O(n^2)||
+|[152. Maximum Product Subarray](https://leetcode.com/problems/maximum-product-subarray)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0152.%20Maximum%20Product%20Subarray)| Medium | O(n)| O(1)||
+|[167. Two Sum II - Input array is sorted](https://leetcode.com/problems/two-sum-ii-input-array-is-sorted)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0167.%20Two%20Sum%20II%20-%20Input%20array%20is%20sorted)| Easy | O(n)| O(1)||
+|[209. Minimum Size Subarray Sum](https://leetcode.com/problems/minimum-size-subarray-sum)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0209.%20Minimum%20Size%20Subarray%20Sum)| Medium | O(n)| O(1)||
+|[216. Combination Sum III](https://leetcode.com/problems/combination-sum-iii)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0216.%20Combination%20Sum%20III)| Medium | O(n)| O(1)||
+|[217. Contains Duplicate](https://leetcode.com/problems/contains-duplicate)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0217.%20Contains%20Duplicate)| Easy | O(n)| O(n)||
+|[219. Contains Duplicate II](https://leetcode.com/problems/contains-duplicate-ii)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0219.%20Contains%20Duplicate%20II)| Easy | O(n)| O(n)||
+|[283. Move Zeroes](https://leetcode.com/problems/move-zeroes)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0283.%20Move%20Zeroes)| Easy | O(n)| O(1)||
+|[287. Find the Duplicate Number](https://leetcode.com/problems/find-the-duplicate-number)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0287.%20Find%20the%20Duplicate%20Number)| Easy | O(n)| O(1)||
+|[532. K-diff Pairs in an Array](https://leetcode.com/problems/k-diff-pairs-in-an-array)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0532.%20K-diff%20Pairs%20in%20an%20Array)| Easy | O(n)| O(n)||
+|[566. Reshape the Matrix](https://leetcode.com/problems/reshape-the-matrix)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0566.%20Reshape%20the%20Matrix)| Easy | O(n^2)| O(n^2)||
+|[628. Maximum Product of Three Numbers](https://leetcode.com/problems/maximum-product-of-three-numbers)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0628.%20Maximum%20Product%20of%20Three%20Numbers)| Easy | O(n)| O(1)||
+|[713. Subarray Product Less Than K](https://leetcode.com/problems/subarray-product-less-than-k)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0713.%20Subarray%20Product%20Less%20Than%20K)| Medium | O(n)| O(1)||
+|[714. Best Time to Buy and Sell Stock with Transaction Fee](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-with-transaction-fee)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0714.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock%20with%20Transaction%20Fee)| Medium | O(n)| O(1)||
+|[746. Min Cost Climbing Stairs](https://leetcode.com/problems/min-cost-climbing-stairs)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0746.%20Min%20Cost%20Climbing%20Stairs)| Easy | O(n)| O(1)||
+|[766. Toeplitz Matrix](https://leetcode.com/problems/toeplitz-matrix)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0766.%20Toeplitz%20Matrix)| Easy | O(n)| O(1)||
+|[867. Transpose Matrix](https://leetcode.com/problems/transpose-matrix)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0867.%20Transpose%20Matrix)| Easy | O(n)| O(1)||
+|[891. Sum of Subsequence Widths](https://leetcode.com/problems/sum-of-subsequence-widths)| [Go]()| Hard | O(n)| O(1)||
+|[907. Sum of Subarray Minimums](https://leetcode.com/problems/sum-of-subarray-minimums)| [Go]()| Medium | O(n)| O(1)||
+|[922. Sort Array By Parity II](https://leetcode.com/problems/sum-of-subarray-minimums)| [Go]()| Medium | O(n)| O(1)||
+|[969. Pancake Sorting](https://leetcode.com/problems/pancake-sorting)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0969.%20Pancake%20Sorting)| Medium | O(n)| O(1)||
+|[977. Squares of a Sorted Array](https://leetcode.com/problems/squares-of-a-sorted-array)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0977.%20Squares%20of%20a%20Sorted%20Array)| Easy | O(n)| O(1)||
+
+
+
+
+| Title | Solution | Difficulty | Time | Space |
+| ----- | -------- | ---------- | ---- | ----- |
+[Max Consecutive Ones](https://leetcode.com/problems/max-consecutive-ones/)| [Go](./Array/MaxConsecutiveOnes.Go)| Easy| O(n)| O(1)|
+[Heaters](https://leetcode.com/problems/heaters/)| [Go](./Array/Heaters.Go)| Easy| O(nlogn)| O(1)|
+[Number of Boomerangs](https://leetcode.com/problems/number-of-boomerangs/)| [Go](./Array/NumberBoomerangs.Go)| Easy| O(n ^ 2)| O(n)|
+[Island Perimeter](https://leetcode.com/problems/island-perimeter/)| [Go](./Array/IslandPerimeter.Go)| Easy| O(nm)| O(1)|
+[Majority Element](https://leetcode.com/problems/majority-element/)| [Go](./Array/MajorityElement.Go)| Easy| O(n)| O(1)|
+[Majority Element II](https://leetcode.com/problems/majority-element-ii/)| [Go](./Array/MajorityElementII.Go)| Medium| O(n)| O(1)|
+[Intersection of Two Arrays](https://leetcode.com/problems/intersection-of-two-arrays/)| [Go](./Array/IntersectionTwoArrays.Go)| Easy| O(n)| O(n)|
+[Intersection of Two Arrays II](https://leetcode.com/problems/intersection-of-two-arrays-ii/)| [Go](./Array/IntersectionTwoArraysII.Go)| Easy| O(n)| O(n)|
+[Contains Duplicate](https://leetcode.com/problems/contains-duplicate/)| [Go](./Array/ContainsDuplicate.Go)| Easy| O(n)| O(n)|
+[Contains Duplicate II](https://leetcode.com/problems/contains-duplicate-ii/)| [Go](./Array/ContainsDuplicateII.Go)| Easy| O(n)| O(n)|
+[Remove Duplicates from Sorted Array](https://leetcode.com/problems/remove-duplicates-from-sorted-array/)| [Go](./Array/RemoveDuplicatesFromSortedArray.Go)| Easy| O(n)| O(1)|
+[Remove Duplicates from Sorted Array II](https://leetcode.com/problems/remove-duplicates-from-sorted-array-ii/)| [Go](./Array/RemoveDuplicatesFromSortedArrayII.Go)| Medium| O(n)| O(1)|
+[Move Zeroes](https://leetcode.com/problems/move-zeroes/)| [Go](./Array/MoveZeroes.Go)| Easy| O(n)| O(1)|
+[Remove Element](https://leetcode.com/problems/remove-element/)| [Go](./Array/RemoveElement.Go)| Easy| O(n)| O(1)|
+[Two Sum](https://leetcode.com/problems/two-sum/)| [Go](./Array/TwoSum.Go)| Easy| O(n)| O(n)|
+[3Sum](https://leetcode.com/problems/3sum/)| [Go](./Array/ThreeSum.Go)| Medium| O(n^2)| O(nC3)|
+[3Sum Closest](https://leetcode.com/problems/3sum-closest/)| [Go](./Array/ThreeSum.Go)| Medium| O(n^2)| O(nC3)|
+[4Sum](https://leetcode.com/problems/4sum/)| [Go](./Array/FourSum.Go)| Medium| O(n^3)| O(nC4)|
+[Summary Ranges](https://leetcode.com/problems/summary-ranges/)| [Go](./Array/SummaryRanges.Go)| Medium| O(n)| O(n)|
+[Shortest Word Distance](https://leetcode.com/problems/shortest-word-distance/)| [Go](./Array/ShortestWordDistance.Go)| Easy| O(n)| O(1)|
+[Shortest Word Distance III](https://leetcode.com/problems/shortest-word-distance-iii/)| [Go](./Array/ShortestWordDistanceIII.Go)| Medium| O(n)| O(1)|
+[Minimum Size Subarray Sum](https://leetcode.com/problems/minimum-size-subarray-sum/)| [Go](./Array/MinimumSizeSubarraySum.Go)| Medium| O(n)| O(1)|
+[Maximum Size Subarray Sum Equals k](https://leetcode.com/problems/maximum-size-subarray-sum-equals-k/)| [Go](./Array/MaximumSizeSubarraySumEqualsK.Go)| Medium| O(n)| O(n)|
+[Smallest Range](https://leetcode.com/problems/smallest-range/)| [Go](./Array/SmallestRange.Go)| Hard | O(nm)| O(nm)|
+[Product of Array Except Self](https://leetcode.com/problems/product-of-array-except-self/)| [Go](./Array/ProductExceptSelf.Go)| Medium| O(n)| O(n)|
+[Rotate Array](https://leetcode.com/problems/rotate-array/)| [Go](./Array/RotateArray.Go)| Easy| O(n)| O(1)|
+[Rotate Image](https://leetcode.com/problems/rotate-image/)| [Go](./Array/RotateImage.Go)| Medium| O(n^2)| O(1)|
+[Spiral Matrix](https://leetcode.com/problems/spiral-matrix/)| [Go](./Array/SpiralMatrix.Go)| Medium| O(n^2)| O(1)|
+[Spiral Matrix II](https://leetcode.com/problems/spiral-matrix/)| [Go](./Array/SpiralMatrixII.Go)| Medium| O(n^2)| O(1)|
+[Valid Sudoku](https://leetcode.com/problems/valid-sudoku/)| [Go](./Array/ValidSudoku.Go)| Easy| O(n^2)| O(n)|
+[Set Matrix Zero](https://leetcode.com/problems/set-matrix-zeroes/)| [Go](./Array/SetMatrixZero.Go)| Medium| O(n^2)| O(1)|
+[Next Permutation](https://leetcode.com/problems/next-permutation/)| [Go](./Array/NextPermutation.Go)| Medium| O(n)| O(1)|
+[Gas Station](https://leetcode.com/problems/gas-station/)| [Go](./Array/GasStation.Go)| Medium| O(n)| O(1)|
+[Game of Life](https://leetcode.com/problems/game-of-life/)| [Go](./Array/GameLife.Go)| Medium| O(n)| O(1)|
+[Task Scheduler](https://leetcode.com/problems/task-scheduler/)| [Go](./Array/TaskScheduler.Go)| Medium| O(nlogn)| O(n)|
+[Sliding Window Maximum ](https://leetcode.com/problems/sliding-window-maximum/)| [Go](./Array/SlidingWindowMaximum.Go)| Hard| O(n)| O(n)|
+[Longest Consecutive Sequence](https://leetcode.com/problems/longest-consecutive-sequence/)| [Go](./Array/LongestConsecutiveSequence.Go)| Hard| O(n)| O(n)|
+
+
+## String
+| Title | Solution | Difficulty | Time | Space |
+| ----- | -------- | ---------- | ---- | ----- |
+[Fizz Buzz](https://leetcode.com/problems/fizz-buzz/)| [Go](./String/FizzBuzz.Go)| Easy| O(n)| O(1)|
+[First Unique Character in a String](https://leetcode.com/problems/first-unique-character-in-a-string/)| [Go](./String/FirstUniqueCharacterInString.Go)| Easy| O(n)| O(1)|
+[Keyboard Row](https://leetcode.com/problems/keyboard-row/)| [Go](./String/KeyboardRow.Go)| Easy| O(nm)| O(n)|
+[Valid Palindrome](https://leetcode.com/problems/valid-palindrome/)| [Go](./String/ValidPalindrome.Go)| Easy| O(n)| O(n)|
+[Valid Palindrome II](https://leetcode.com/problems/valid-palindrome-ii/)| [Go](./String/ValidPalindromeII.Go)| Easy| O(n)| O(n)|
+[Detect Capital](https://leetcode.com/problems/detect-capital/)| [Go](./String/DetectCapital.Go)| Easy| O(n)| O(1)|
+[Count and Say](https://leetcode.com/problems/count-and-say/)| [Go](./String/CountAndSay.Go)| Easy| O(n^2)| O(n)|
+[Flip Game](https://leetcode.com/problems/flip-game/)| [Go](./String/FlipGame.Go)| Easy| O(n)| O(n)|
+[Implement strStr()](https://leetcode.com/problems/implement-strstr/)| [Go](./String/StrStr.Go)| Easy| O(nm)| O(n)|
+[Isomorphic Strings](https://leetcode.com/problems/isomorphic-strings/)| [Go](./String/IsomorphicStrings.Go)| Easy| O(n)| O(n)|
+[Reverse String](https://leetcode.com/problems/reverse-string/)| [Go](./String/ReverseString.Go)| Easy| O(n)| O(n)|
+[Reverse String II](https://leetcode.com/problems/reverse-string-ii/)| [Go](./String/ReverseStringII.Go)| Easy| O(n)| O(n)|
+[Reverse Vowels of a String](https://leetcode.com/problems/reverse-vowels-of-a-string/)| [Go](./String/ReverseVowelsOfAString.Go)| Easy| O(n)| O(n)|
+[Length of Last Word](https://leetcode.com/problems/length-of-last-word/)| [Go](./String/AddStrings.Go)| Easy| O(n)| O(n)|
+[Add Strings](https://leetcode.com/problems/add-strings/)| [Go](./String/LengthLastWord.Go)| Easy| O(n)| O(1)|
+[Multiply Strings](https://leetcode.com/problems/multiply-strings/)| [Go](./String/MultiplyStrings.Go)| Medium| O(n)| O(1)|
+[Palindrome Permutation](https://leetcode.com/problems/palindrome-permutation/)| [Go](./String/PalindromePermutation.Go)| Easy| O(n)| O(n)|
+[Valid Anagram](https://leetcode.com/problems/valid-anagram/)| [Go](./String/ValidAnagram.Go)| Easy| O(nlogn)| O(1)|
+[Ransom Note](https://leetcode.com/problems/ransom-note/)| [Go](./String/RansomNote.Go)| Easy| O(n)| O(n)|
+[Group Anagrams](https://leetcode.com/problems/anagrams/)| [Go](./String/GroupAnagrams.Go)| Medium| O(nmlogm + nlogn)| O(n)
+[Longest Common Prefix](https://leetcode.com/problems/longest-common-prefix/)| [Go](./String/LongestCommonPrefix.Go)| Easy| O(nm)| O(m)|
+[Longest Substring Without Repeating Characters](https://leetcode.com/problems/longest-substring-without-repeating-characters/)| [Go](./String/LongestSubstringWithoutRepeatingCharacters.Go)| Medium| O(n)| O(n)|
+[One Edit Distance](https://leetcode.com/problems/one-edit-distance/)| [Go](./String/OneEditDistance.Go)| Medium| O(n)| O(n)|
+[Word Pattern](https://leetcode.com/problems/word-pattern/)| [Go](./String/WordPattern.Go)| Easy| O(n)| O(n)|
+[Minimum Window Substring](https://leetcode.com/problems/minimum-window-substring/)| [Go](./Array/MinimumWindowSubstring.Go)| Hard| O(n^2)| O(n)|
+[Text Justification](https://leetcode.com/problems/text-justification/)| [Go](./String/TextJustification.Go)| Hard| O(n)| O(n)|
+
+## Linked List (已全部做完)
+
+- 巧妙的构造虚拟头结点。可以使遍历处理逻辑更加统一。
+- 灵活使用递归。构造递归条件，使用递归可以巧妙的解题。不过需要注意有些题目不能使用递归，因为递归深度太深会导致超时和栈溢出。
+- 链表区间逆序。第 92 题。
+- 链表寻找中间节点。第 876 题。链表寻找倒数第 n 个节点。第 19 题。只需要一次遍历就可以得到答案。
+- 合并 K 个有序链表。第 21 题，第 23 题。
+- 链表归类。第 86 题，第 328 题。
+- 链表排序，时间复杂度要求 O(n * log n)，空间复杂度 O(1)。只有一种做法，归并排序，至顶向下归并。第 148 题。
+- 判断链表是否存在环，如果有环，输出环的交叉点的下标；判断 2 个链表是否有交叉点，如果有交叉点，输出交叉点。第 141 题，第 142 题，第 160 题。
+
+
+
+| Title | Solution | Difficulty | Time | Space |收藏|
+| ----- | :--------: | :----------: | :----: | :-----: | :-----: |
+|[2. Add Two Numbers](https://leetcode.com/problems/add-two-numbers)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0002.%20Add-Two-Number)| Medium | O(n)| O(1)||
+|[19. Remove Nth Node From End of List](https://leetcode.com/problems/remove-nth-node-from-end-of-list/)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0019.%20Remove%20Nth%20Node%20From%20End%20of%20List)| Medium | O(n)| O(1)||
+|[21. Merge Two Sorted Lists](https://leetcode.com/problems/merge-two-sorted-lists)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0021.%20Merge%20Two%20Sorted%20Lists)| Easy | O(log n)| O(1)||
+|[23. Merge k Sorted Lists](https://leetcode.com/problems/merge-k-sorted-lists/)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0023.%20Merge%20k%20Sorted%20Lists)| Hard | O(log n)| O(1)|❤️|
+|[24. Swap Nodes in Pairs](https://leetcode.com/problems/swap-nodes-in-pairs/)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0024.%20Swap%20Nodes%20in%20Pairs)| Medium | O(n)| O(1)||
+|[25. Reverse Nodes in k-Group](https://leetcode.com/problems/reverse-nodes-in-k-group/)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0025.%20Reverse%20Nodes%20in%20k%20Group)| Hard | O(log n)| O(1)|❤️|
+|[61. Rotate List](https://leetcode.com/problems/rotate-list/)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0061.%20Rotate%20List)| Medium | O(n)| O(1)||
+|[82. Remove Duplicates from Sorted List II](https://leetcode.com/problems/remove-duplicates-from-sorted-list-ii/)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0082.%20Remove%20Duplicates%20from%20Sorted%20List%20II)| Medium | O(n)| O(1)||
+|[83. Remove Duplicates from Sorted List](https://leetcode.com/problems/remove-duplicates-from-sorted-list/)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0083.%20Remove%20Duplicates%20from%20Sorted%20List)| Easy | O(n)| O(1)||
+|[86. Partition List](https://leetcode.com/problems/partition-list/)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0086.%20Partition%20List)| Medium | O(n)| O(1)|❤️|
+|[92. Reverse Linked List II](https://leetcode.com/problems/reverse-linked-list-ii/)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0092.%20Reverse%20Linked%20List%20II)| Medium | O(n)| O(1)|❤️|
+|[109. Convert Sorted List to Binary Search Tree](https://leetcode.com/problems/convert-sorted-list-to-binary-search-tree/)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0109.%20Convert%20Sorted%20List%20to%20Binary%20Search%20Tree)| Medium | O(log n)| O(n)||
+|[141. Linked List Cycle](https://leetcode.com/problems/linked-list-cycle/)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0141.%20Linked%20List%20Cycle)| Easy | O(n)| O(1)|❤️|
+|[142. Linked List Cycle II](https://leetcode.com/problems/linked-list-cycle-ii/)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0142.%20Linked%20List%20Cycle%20II)| Medium | O(n)| O(1)|❤️|
+|[143. Reorder List](https://leetcode.com/problems/reorder-list/)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0143.%20Reorder%20List)| Medium | O(n)| O(1)|❤️|
+|[147. Insertion Sort List](https://leetcode.com/problems/insertion-sort-list/)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0147.%20Insertion%20Sort%20List)| Medium | O(n)| O(1)||
+|[148. Sort List](https://leetcode.com/problems/sort-list/)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0148.%20Sort%20List)| Medium | O(log n)| O(n)|❤️|
+|[160. Intersection of Two Linked Lists](https://leetcode.com/problems/intersection-of-two-linked-lists/)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0160.%20Intersection%20of%20Two%20Linked%20Lists)| Easy | O(n)| O(1)|❤️|
+|[203. Remove Linked List Elements](https://leetcode.com/problems/remove-linked-list-elements/)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0203.%20Remove%20Linked%20List%20Elements)| Easy | O(n)| O(1)||
+|[206. Reverse Linked List](https://leetcode.com/problems/reverse-linked-list/)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0206.%20Reverse-Linked-List)| Easy | O(n)| O(1)||
+|[234. Palindrome Linked List](https://leetcode.com/problems/palindrome-linked-list/)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0234.%20Palindrome%20Linked%20List)| Easy | O(n)| O(1)||
+|[237. Delete Node in a Linked List](https://leetcode.com/problems/delete-node-in-a-linked-list/)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0237.%20Delete%20Node%20in%20a%20Linked%20List)| Easy | O(n)| O(1)||
+|[328. Odd Even Linked List](https://leetcode.com/problems/odd-even-linked-list/)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0328.%20Odd%20Even%20Linked%20List)| Medium | O(n)| O(1)||
+|[445. Add Two Numbers II](https://leetcode.com/problems/add-two-numbers-ii/)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0445.%20Add%20Two%20Numbers%20II)| Medium | O(n)| O(n)||
+|[725. Split Linked List in Parts](https://leetcode.com/problems/split-linked-list-in-parts/)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0725.%20Split%20Linked%20List%20in%20Parts)| Medium | O(n)| O(1)||
+|[817. Linked List Components](https://leetcode.com/problems/linked-list-components/)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0817.%20Linked%20List%20Components)| Medium | O(n)| O(1)||
+|[707. Design Linked List](https://leetcode.com/problems/design-linked-list/)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0707.%20Design%20Linked%20List)| Easy | O(n)| O(1)||
+|[876. Middle of the Linked List](https://leetcode.com/problems/middle-of-the-linked-list/)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0876.%20Middle%20of%20the%20Linked%20List)| Easy | O(n)| O(1)|❤️|
+|[1019. Next Greater Node In Linked List](https://leetcode.com/problems/next-greater-node-in-linked-list/)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/1019.%20Next%20Greater%20Node%20In%20Linked%20List)| Medium | O(n)| O(1)||
+|----------------------------------------------------------------------------|-------------|-------------| -------------| -------------|-------------|
+
+## Stack (已全部做完)
+
+| Title | Solution | Difficulty | Time | Space |
+| ----- | -------- | ---------- | ---- | ----- |
+[Valid Parentheses](https://leetcode.com/problems/valid-parentheses/)| [Go](./Stack/ValidParentheses.Go)| Easy| O(n)| O(n)|
+[Longest Valid Parentheses](https://leetcode.com/problems/longest-valid-parentheses/)| [Go](./Stack/LongestValidParentheses.Go)| Hard| O(n)| O(n)|
+[Evaluate Reverse Polish Notation](https://leetcode.com/problems/evaluate-reverse-polish-notation/)| [Go](./Stack/EvaluateReversePolishNotation.Go)| Medium| O(n)| O(n)|
+[Simplify Path](https://leetcode.com/problems/simplify-path/)| [Go](./Stack/SimplifyPath.Go)| Medium| O(n)| O(n)|
+[Remove K Digits](https://leetcode.com/problems/remove-k-digits/)| [Go](./Stack/RemoveKDigits.Go)| Medium| O(n)| O(n)|
+[Ternary Expression Parser](https://leetcode.com/problems/ternary-expression-parser/)| [Go](./Stack/TernaryExpressionParser.Go)| Medium| O(n)| O(n)|
+[Binary Tree Preorder Traversal](https://leetcode.com/problems/binary-tree-preorder-traversal/)| [Go](./Stack/PreorderTraversal.Go)| Medium| O(n)| O(n)|
+[Binary Tree Inorder Traversal](https://leetcode.com/problems/binary-tree-inorder-traversal/)| [Go](./Stack/InorderTraversal.Go)| Medium| O(n)| O(n)|
+[Binary Tree Postorder Traversal](https://leetcode.com/problems/binary-tree-postorder-traversal/)| [Go](./Stack/PostorderTraversal.Go)| Hard| O(n)| O(n)|
+
+
+## Tree
+| Title | Solution | Difficulty | Time | Space |
+| ----- | -------- | ---------- | ---- | ----- |
+[Same Tree](https://oj.leetcode.com/problems/same-tree/)| [Go](./Tree/SameTree.Go)| Easy| O(n)| O(n)|
+[Symmetric Tree](https://leetcode.com/problems/symmetric-tree/)| [Go](./Tree/SymmetricTree.Go)| Easy| O(n)| O(n)|
+[Invert Binary Tree](https://leetcode.com/problems/invert-binary-tree/)| [Go](./Tree/InvertBinaryTree)| Easy| O(n)| O(n)|
+[Binary Tree Upside Down](https://leetcode.com/problems/binary-tree-upside-down/)| [Go](./Tree/BinaryTreeUpsideDown)| Medium| O(n)| O(1)|
+[Minimum Depth of Binary Tree](https://leetcode.com/problems/minimum-depth-of-binary-tree/)| [Go](./Tree/MinimumDepthOfBinaryTree.Go)| Easy| O(n)| O(1)|
+[Maximum Depth of Binary Tree](https://leetcode.com/problems/maximum-depth-of-binary-tree/)| [Go](./Tree/MaximumDepthOfBinaryTree.Go)| Easy| O(n)| O(1)|
+[Diameter of Binary Tree](https://leetcode.com/problems/diameter-of-binary-tree/)| [Go](./Tree/DiameterBinaryTree.Go)| Easy| O(n)| O(1)|
+[Balanced Binary Tree](https://leetcode.com/problems/balanced-binary-tree/)| [Go](./Tree/BalancedBinaryTree.Go)| Easy| O(n)| O(n)|
+[Sum of Left Leaves](https://leetcode.com/problems/sum-of-left-leaves/)| [Go](./Tree/SumLeftLeaves.Go)| Easy| O(n)| O(1)|
+[Flatten Binary Tree to Linked List](https://leetcode.com/problems/flatten-binary-tree-to-linked-list/)| [Go](./Tree/FlattenBinaryTreeLinkedList.Go)| Medium| O(n)| O(1)|
+[Validate Binary Search Tree](https://leetcode.com/problems/validate-binary-search-tree/)| [Go](./Tree/ValidateBinarySearchTree.Go)| Medium| O(n)| O(n)|
+[Binary Tree Level Order Traversal](https://leetcode.com/problems/binary-tree-level-order-traversal/)| [Go](./Tree/BinaryTreeLevelOrderTraversal.Go)| Easy| O(n)| O(n)|
+[Binary Tree Level Order Traversal II](https://leetcode.com/problems/binary-tree-level-order-traversal-ii/)| [Go](./Tree/BinaryTreeLevelOrderTraversalII.Go)| Easy| O(n)| O(n)|
+[Binary Tree Zigzag Level Order Traversal](https://leetcode.com/problems/binary-tree-zigzag-level-order-traversal/)| [Go](./Tree/BinaryTreeZigzagLevelOrderTraversal.Go)| Medium| O(n)| O(n)|
+[Binary Tree Vertical Order Traversal](https://leetcode.com/problems/binary-tree-vertical-order-traversal/)| [Go](./Tree/BinaryTreeVerticalOrderTraversal.Go)| Medium| O(n)| O(n)|
+[Binary Tree Right Side View](https://leetcode.com/problems/binary-tree-right-side-view/)| [Go](./Tree/BinaryTreeRightSideView.Go)| Medium| O(n)| O(n)|
+[Construct Binary Tree from Preorder and Inorder Traversal](https://leetcode.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal/)| [Go](./Tree/ConstructBinaryTreePreorderInorder.Go)| Medium| O(n)| O(n)|
+[Construct Binary Tree from Inorder and Postorder Traversal](https://leetcode.com/problems/construct-binary-tree-from-inorder-and-postorder-traversal/)| [Go](./Tree/ConstructBinaryTreeInorderPostorder.Go)| Medium| O(n)| O(n)|
+[Path Sum](https://leetcode.com/problems/path-sum/)| [Go](./Tree/PathSum.Go)| Easy| O(n)| O(n)|
+[Path Sum II](https://leetcode.com/problems/path-sum-ii/)| [Go](./Tree/PathSumII.Go)| Medium| O(n)| O(n)|
+[Path Sum III](https://leetcode.com/problems/path-sum-iiI/)| [Go](./Tree/PathSumIII.Go)| Easy| O(n^2)| O(1)|
+[Bnary Tree Paths](https://leetcode.com/problems/binary-tree-paths/)| [Go](./Tree/BnaryTreePaths.Go)| Easy| O(n)| O(n)|
+[Unique Binary Search Trees](https://leetcode.com/problems/unique-binary-search-trees/)| [Go](./Tree/UniqueBinarySearchTrees.Go)| Medium| O(n^2)| O(n)|
+[Recover Binary Search Tree](https://leetcode.com/problems/recover-binary-search-tree/)| [Go](./Tree/RecoverBinarySearchTree.Go)| Hard| O(n)| O(1)|
+[Merge Two Binary Trees](https://leetcode.com/problems/merge-two-binary-trees/description/) | [Go](./Tree/MergeTwoBinaryTrees.Go) | Easy | O(n) | O(n) |
+
+## Dynamic programming
+| Title | Solution | Difficulty | Time | Space |
+| ----- | -------- | ---------- | ---- | ----- |
+[Nested List Weight Sum](https://leetcode.com/problems/nested-list-weight-sum/)| [Go](./DP/NestedListWeightSum.Go)| Easy| O(n)| O(1)|
+[Climbing Stairs](https://leetcode.com/problems/climbing-stairs/)| [Go](./DP/ClimbingStairs.Go)| Easy| O(n)| O(1)|
+[Min Cost Climbing Stairs](https://leetcode.com/problems/min-cost-climbing-stairs/)| [Go](./DP/MinCostClimbingStairs.Go)| Easy| O(n)| O(n)|
+[Unique Paths](https://leetcode.com/problems/unique-paths/)| [Go](./DP/UniquePaths.Go)| Medium| O(mn)| O(mn)|
+[Unique Paths II](https://leetcode.com/problems/unique-paths-ii/)| [Go](./DP/UniquePathsII.Go)| Medium| O(mn)| O(mn)|
+[Decode Ways](https://leetcode.com/problems/decode-ways/)| [Go](./DP/DecodeWays.Go) | O(n)|O(n)|
+[Minimum Path Sum](https://leetcode.com/problems/minimum-path-sum/)| [Go](./DP/MinimumPathSum.Go)| Medium| O(mn)| O(mn)|
+[Generate Parentheses](https://leetcode.com/problems/generate-parentheses/)| [Go](./DP/GenerateParentheses.Go)| Medium| O(2^n)| O(n)|
+[Different Ways to Add Parentheses](https://leetcode.com/problems/different-ways-to-add-parentheses/)| [Go](./DP/DifferentWaysAddParentheses.Go)| Medium| O(n^n)| O(n)|
+[Best Time to Buy and Sell Stock](https://leetcode.com/problems/best-time-to-buy-and-sell-stock/)| [Go](./DP/BestTimeBuySellStock.Go)| Easy| O(n)| O(1)|
+[Best Time to Buy and Sell Stock II](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-ii/)| [Go](./DP/BestTimeBuySellStockII.Go)| Medium| O(n)| O(1)|
+[Best Time to Buy and Sell Stock III](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-iii/)| [Go](./DP/BestTimeBuySellStockIII.Go)| Hard| O(n)| O(n)|
+[Best Time to Buy and Sell Stock IV](https://leetcode.com/problems/https://leetcode.com/problems/best-time-to-buy-and-sell-stock-iv/)| [Go](./DP/BestTimeBuySellStockIV.Go)| Hard| O(n^2)| O(n)|
+[Best Time to Buy and Sell Stock with Cooldown](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-with-cooldown/)| [Go](./DP/BestTimeBuySellStockCooldown.Go)| Medium| O(n^2)| O(n)|
+[Coin Change](https://leetcode.com/problems/coin-change/)| [Go](./DP/CoinChange.Go)| Medium| O(n^2)| O(n)|
+[Coin Change II](https://leetcode.com/problems/coin-change-ii/)| [Go](./DP/CoinChangeII.Go)| Medium| O(n^2)| O(n)|
+[Longest Increasing Subsequence](https://leetcode.com/problems/longest-increasing-subsequence/)| [Go](./DP/LongestIncreasingSubsequence.Go)| Medium| O(n^2)| O(n)|
+[Longest Palindromic Substring](https://leetcode.com/problems/longest-palindromic-substring/)| [Go](./DP/LongestPalindromicSubstring.Go)| Medium| O(n^2)| O(n^2)|
+[Perfect Squares](https://leetcode.com/problems/perfect-squares/)| [Go](./DP/PerfectSquares.Go)| Medium| O(n^2)| O(n)|
+[House Robber](https://leetcode.com/problems/house-robber/)| [Go](./DP/HouseRobber.Go)| Easy| O(n)| O(1)|
+[House Robber II](https://leetcode.com/problems/house-robber-ii/)| [Go](./DP/HouseRobberII.Go)| Medium| O(n)| O(1)|
+[Paint Fence](https://leetcode.com/problems/paint-fence/)| [Go](./DP/PaintFence.Go)| Easy| O(n)| O(n)|
+[Maximum Subarray](https://leetcode.com/problems/maximum-subarray/)| [Go](./DP/MaximumSubarray.Go)| Medium| O(n)| O(1)|
+[Maximum Product Subarray](https://leetcode.com/problems/maximum-product-subarray/)| [Go](./DP/MaximumProductSubarray.Go)| Medium| O(n)| O(1)|
+[Maximal Square](https://leetcode.com/problems/maximal-square/)| [Go](./DP/MaximalSquare.Go)| Medium| O(mn)| O(mn)|
+[Edit Distance](https://leetcode.com/problems/edit-distance/)| [Go](./DP/EditDistance.Go)| Hard| O(mn)| O(mn)|
+[Combination Sum IV](https://leetcode.com/problems/combination-sum-iv/)| [Go](./DP/CombinationSumIV.Go)| Medium| O(2^n)| O(n)|
+[Triangle](https://leetcode.com/problems/triangle/)| [Go](./DP/Triangle.Go)| Medium| O(2^n - 1)| O(m)|
+[Guess Number Higher or Lower II](https://leetcode.com/problems/guess-number-higher-or-lower-ii/)| [Go](./DP/GuessNumberHigherOrLowerII.Go)| Medium| O(nlogn)| O(n^2)|
+[Burst Ballons](https://leetcode.com/problems/burst-balloons/)| [Go](./DP/BurstBalloons.Go)| Hard| O(n^3)| O(n)|
+[Frog Jump](https://leetcode.com/problems/frog-jump/)| [Go](./DP/FrogJump.Go)| Hard| O(n^2)| O(n)|
+
+## Depth-first search
+| Title | Solution | Difficulty | Time | Space |
+| ----- | -------- | ---------- | ---- | ----- |
+[Permutations](https://leetcode.com/problems/permutations/)| [Go](./DFS/Permutations.Go)| Medium| O(n!)| O(n)|
+[Permutations II](https://leetcode.com/problems/permutations-ii/)| [Go](./DFS/PermutationsII.Go)| Medium| O(n!)| O(n)|
+[Subsets](https://leetcode.com/problems/subsets/)| [Go](./DFS/Subsets.Go)| Medium| O(n!)| O(n)|
+[Subsets II](https://leetcode.com/problems/subsets-ii/)| [Go](./DFS/SubsetsII.Go)| Medium| O(n!)| O(n)|
+[Combinations](https://leetcode.com/problems/combinations/)| [Go](./DFS/Combinations.Go)| Medium| O(n!)| O(n)|
+[Combination Sum](https://leetcode.com/problems/combination-sum/)| [Go](./DFS/CombinationSum.Go)| Medium| O(n^n)| O(2^n - 1)|
+[Combination Sum II](https://leetcode.com/problems/combination-sum-ii/)| [Go](./DFS/CombinationSumII.Go)| Medium| O(n!)| O(2^n - 2)|
+[Combination Sum III](https://leetcode.com/problems/combination-sum-iii/)| [Go](./DFS/CombinationSumIII.Go)| Medium| O(n!)| O(nCk)|
+[Letter Combinations of a Phone Number](https://leetcode.com/problems/letter-combinations-of-a-phone-number/)| [Go](./DFS/LetterCombinationsPhoneNumber.Go)| Medium| O(mn)| O(n)|
+[Factor Combinations](https://leetcode.com/problems/factor-combinations/)| [Go](./DFS/FactorCombinations.Go)| Medium| O(n^n))| O(2^n - 1)|
+[Generalized Abbreviation](https://leetcode.com/problems/generalized-abbreviation/)| [Go](./DFS/GeneralizedAbbreviation.Go)| Medium| O(n!)| O(2^n)|
+[Palindrome Partitioning](https://leetcode.com/problems/palindrome-partitioning/)| [Go](./DFS/PalindromePartitioning.Go)| Medium| O(n!)| O(n)|
+[Number of Islands](https://leetcode.com/problems/number-of-islands/)| [Go](./DFS/NumberofIslands.Go)| Medium| O((mn)^2)| O(1)|
+[Walls and Gates](https://leetcode.com/problems/walls-and-gates/)| [Go](./DFS/WallsGates.Go)| Medium| O(n!)| O(2^n)|
+[Word Search](https://leetcode.com/problems/word-search/)| [Go](./DFS/WordSearch.Go)| Medium| O((n^2)!)| O(n^2)|
+[Word Search II](https://leetcode.com/problems/word-search-ii/)| [Go](./DFS/WordSearchII.Go)| Hard| O(((mn)^2))| O(n^2)|
+[Add and Search Word - Data structure design](https://leetcode.com/problems/add-and-search-word-data-structure-design/)| [Go](./DFS/WordDictionary.Go)| Medium| O(n)| O(n)|
+[N-Queens](https://leetcode.com/problems/n-queens/)| [Go](./DFS/NQueens.Go)| Hard| O((n^4))| O(n^2)|
+[N-Queens II](https://leetcode.com/problems/n-queens-ii/)| [Go](./DFS/NQueensII.Go)| Hard| O((n^3))| O(n)|
+[Sudoku Solver](https://leetcode.com/problems/sudoku-solver/)| [Go](./DFS/SudokuSolver.Go)| Hard| O(n^4)| O(1)|
+[Remove Invalid Parentheses](https://leetcode.com/problems/remove-invalid-parentheses/)| [Go](./DFS/RemoveInvalidParentheses.Go)| Hard| O(n!)| O(n)|
+[Expression Add Operators](https://leetcode.com/problems/expression-add-operators/)| [Go](./DFS/ExpressionAddOperators.Go)| Hard| O(n!)| O(n)|
+
+## Math
+
+| Title | Solution | Difficulty | Time | Space |
+| ----- | -------- | ---------- | ---- | ----- |
+[Add Binary](https://leetcode.com/problems/add-binary/)| [Go](./Math/AddBinary.Go)| Easy| O(n)| O(n)|
+[Add Two Numbers](https://leetcode.com/problems/add-two-numbers/)| [Go](./Math/AddTwoNumbers.Go)| Medium| O(n)| O(1)|
+[Add Digits](https://leetcode.com/problems/add-digits/)| [Go](./Math/AddDigits.Go)| Easy| O(1)| O(1)|
+[Plus One](https://leetcode.com/problems/plus-one/)| [Go](./Math/PlusOne.Go)| Easy| O(n)| O(1)|
+[Divide Two Integers](https://leetcode.com/problems/divide-two-integers/)| [Go](./Math/DivideTwoIntegers.Go)| Medium| O(logn)| O(1)|
+[Number Complement](https://leetcode.com/problems/number-complement/)| [Go](./Math/NumberComplement.Go)| Easy| O(n)| O(1)|
+[Hamming Distance](https://leetcode.com/problems/hamming-distance/)| [Go](./Math/HammingDistance.Go)| Easy| O(n)| O(1)|
+[Integer Break](https://leetcode.com/problems/integer-break/)| [Go](./Math/IntegerBreak.Go)| Medium| O(logn)| O(1)|
+[Happy Number](https://leetcode.com/problems/happy-number/)| [Go](./Math/HappyNumber.Go)| Easy| O(n)| O(n)|
+[Single Number](https://leetcode.com/problems/single-number/)| [Go](./Math/SingleNumber.Go)| Medium| O(n)| O(1)|
+[Ugly Number](https://leetcode.com/problems/ugly-number/)| [Go](./Math/UglyNumber.Go)| Easy| O(logn)| O(1)|
+[Ugly Number II](https://leetcode.com/problems/ugly-number-ii/)| [Go](./Math/UglyNumberII.Go)| Medium| O(n)| O(n)|
+[Super Ugly Number](https://leetcode.com/problems/super-ugly-number/)| [Go](./Math/SuperUglyNumber.Go)| Medium| O(n^2)| O(n)|
+[Count Primes](https://leetcode.com/problems/count-primes/)| [Go](./Math/CountPrimes.Go)| Easy| O(n)| O(n)|
+[String to Integer (atoi)](https://leetcode.com/problems/string-to-integer-atoi/)| [Go](./Math/Atoi.Go)| Easy| O(n)| O(1)|
+[Pow(x, n)](https://leetcode.com/problems/isomorphic-strings/)| [Go](./Math/Pow.Go)| Medium| O(logn)| O(1)|
+[Power of Two](https://leetcode.com/problems/power-of-two/)| [Go](./Math/PowerTwo.Go)| Easy| O(1)| O(1)|
+[Power of Three](https://leetcode.com/problems/power-of-three/)| [Go](./Math/PowerThree.Go)| Easy| O(1)| O(1)|
+[Super Power](https://leetcode.com/problems/super-pow/)| [Go](./Math/SuperPow.Go)| Medium| O(n)| O(1)|
+[Sum of Two Integers](https://leetcode.com/problems/sum-of-two-integers/)| [Go](./Math/SumTwoIntegers.Go)| Easy| O(n)| O(1)|
+[Reverse Integer](https://leetcode.com/problems/reverse-integer/)| [Go](./Math/ReverseInteger.Go)| Easy| O(n)| O(1)|
+[Excel Sheet Column Number](https://leetcode.com/problems/excel-sheet-column-number/)| [Go](./Math/ExcelSheetColumnNumber.Go)| Easy| O(n)| O(1)|
+[Integer to Roman](https://leetcode.com/problems/integer-to-roman/)| [Go](./Math/IntegerToRoman.Go)| Medium| O(n)| O(1)|
+[Roman to Integer](https://leetcode.com/problems/roman-to-integer/)| [Go](./Math/RomanToInteger.Go)| Easy| O(n)| O(n)|
+[Integer to English Words](https://leetcode.com/problems/integer-to-english-words/)| [Go](./Math/IntegerEnglishWords.Go)| Hard| O(n)| O(1)|
+[Rectangle Area](https://leetcode.com/problems/rectangle-area/)| [Go](./Math/RectangleArea.Go)| Easy| O(1)| O(1)|
+[Trapping Rain Water](https://leetcode.com/problems/trapping-rain-water/)| [Go](./Math/TrappingRainWater.Go)| Hard| O(n)| O(n)|
+[Container With Most Water](https://leetcode.com/problems/container-with-most-water/)| [Go](./Math/ContainerMostWater.Go)| Medium| O(n)| O(1)|
+[Counting Bits](https://leetcode.com/problems/counting-bits/)| [Go](./Math/CountingBits.Go)| Medium| O(n)| O(n)|
+[K-th Smallest in Lexicographical Order](https://leetcode.com/problems/k-th-smallest-in-lexicographical-order/)| [Go](./Math/KthSmallestLexicographicalOrder.Go)| Hard| O(n)| O(1)|
+
+## Search
+
+| Title | Solution | Difficulty | Time | Space |
+| ----- | -------- | ---------- | ---- | ----- |
+[Closest Binary Search Tree Value](https://leetcode.com/problems/closest-binary-search-tree-value/)| [Go](./Search/ClosestBinarySearchTreeValue.Go)| Easy| O(logn)| O(1)|
+[Closest Binary Search Tree Value II](https://leetcode.com/problems/closest-binary-search-tree-value-ii/)| [Go](./Search/ClosestBinarySearchTreeValueII.Go)| Hard| O(n)| O(n)|
+[Search in Rotated Sorted Array](https://leetcode.com/problems/search-in-rotated-sorted-array/)| [Go](./Search/SearchInRotatedSortedArray.Go)| Hard| O(logn)| O(1)|
+[Search in Rotated Sorted Array II](https://leetcode.com/problems/search-in-rotated-sorted-array-ii/)| [Go](./Search/SearchInRotatedSortedArrayII.Go)| Medium| O(logn)| O(1)|
+[Find Minimum in Rotated Sorted Array](https://leetcode.com/problems/find-minimum-in-rotated-sorted-array/)| [Go](./Search/FindMinimumRotatedSortedArray.Go)| Medium| O(logn)| O(1)|
+[Find Minimum in Rotated Sorted Array II](https://leetcode.com/problems/find-minimum-in-rotated-sorted-array-ii/)| [Go](./Search/FindMinimumRotatedSortedArrayII.Go)| Hard| O(logn)| O(1)|
+[Search a 2D Matrix](https://leetcode.com/problems/search-a-2d-matrix/)| [Go](./Search/Search2DMatrix.Go)| Medium| O(log(m + n))| O(1)|
+[Search a 2D Matrix II](https://leetcode.com/problems/search-a-2d-matrix-ii/)| [Go](./Search/Search2DMatrixII.Go)| Medium| O(m + n)| O(1)|
+[Search for a Range](https://leetcode.com/problems/search-for-a-range/)| [Go](./Search/SearchForARange.Go)| Medium| O(logn)| O(1)|
+[Search Insert Position](https://leetcode.com/problems/search-insert-position/)| [Go](./Search/SearchForARange.Go)| Medium| O(logn)| O(1)|
+[Find Peak Element](https://leetcode.com/problems/find-peak-element/)| [Go](./Search/FindPeakElement.Go)| Medium| O(logn)| O(1)|
+[Sqrt(x)](https://leetcode.com/problems/sqrtx/)| [Go](./Search/Sqrtx.Go)| Medium| O(logn)| O(1)|
+[Median of Two Sorted Arrays](https://leetcode.com/problems/median-of-two-sorted-arrays/)| [Go](./Search/MedianTwoSortedArrays.Go)| Hard| O(log(m + n))| O(1)|
+
+
+## Sort (已全部做完)
+
+- 深刻的理解多路快排。第 75 题。
+- 链表的排序，插入排序(第 147 题)和归并排序(第 148 题)
+- 桶排序和基数排序。第 164 题。
+- "摆动排序"。第 324 题。
+- 两两不相邻的排序。第 767 题，第 1054 题。
+- "饼子排序"。第 969 题。
+
+| Title | Solution | Difficulty | Time | Space | 收藏 |
+| ----- | :--------: | :----------: | :----: | :-----: |:-----: |
+|[56. Merge Intervals](https://leetcode.com/problems/merge-intervals/)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0056.%20Merge%20Intervals)| Medium | O(n log n)| O(log n)||
+|[57. Insert Interval](https://leetcode.com/problems/insert-interval/)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0057.%20Insert%20Interval)| Hard | O(n)| O(1)||
+|[75. Sort Colors](https://leetcode.com/problems/sort-colors/)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0075.%20Sort%20Colors)| Medium| O(n)| O(1)|❤️|
+|[147. Insertion Sort List](https://leetcode.com/problems/insertion-sort-list/)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0147.%20Insertion%20Sort%20List)| Medium | O(n)| O(1) |❤️|
+|[148. Sort List](https://leetcode.com/problems/sort-list/)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0148.%20Sort%20List)| Medium |O(n log n)| O(log n)|❤️|
+|[164. Maximum Gap](https://leetcode.com/problems/maximum-gap/)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0164.%20Maximum%20Gap)| Hard | O(n log n)| O(log n) |❤️|
+|[179. Largest Number](https://leetcode.com/problems/largest-number/)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0179.%20Largest%20Number)| Medium | O(n log n)| O(log n) |❤️|
+|[220. Contains Duplicate III](https://leetcode.com/problems/contains-duplicate-iii/)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0220.%20Contains%20Duplicate%20III)| Medium | O(n^2)| O(1) ||
+|[242. Valid Anagram](https://leetcode.com/problems/valid-anagram/)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0242.%20Valid%20Anagram)| Easy | O(n)| O(n) ||
+|[274. H-Index](https://leetcode.com/problems/h-index/)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0274.%20H-Index)| Medium | O(n)| O(n) ||
+|[324. Wiggle Sort II](https://leetcode.com/problems/wiggle-sort-ii/)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0324.%20Wiggle%20Sort%20II)| Medium| O(n)| O(n)|❤️|
+|[349. Intersection of Two Arrays](https://leetcode.com/problems/intersection-of-two-arrays/)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0349.%20Intersection%20of%20Two%20Arrays)| Easy | O(n)| O(n) ||
+|[350. Intersection of Two Arrays II](https://leetcode.com/problems/intersection-of-two-arrays-ii/)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0350.%20Intersection%20of%20Two%20Arrays%20II)| Easy | O(n)| O(n) ||
+|[524. Longest Word in Dictionary through Deleting](https://leetcode.com/problems/longest-word-in-dictionary-through-deleting/)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0524.%20Longest%20Word%20in%20Dictionary%20through%20Deleting)| Medium | O(n)| O(1) ||
+|[767. Reorganize String](https://leetcode.com/problems/reorganize-string/)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0767.%20Reorganize%20String)| Medium | O(n log n)| O(log n) |❤️|
+|[853. Car Fleet](https://leetcode.com/problems/car-fleet/)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0853.%20Car%20Fleet)| Medium | O(n log n)| O(log n) ||
+|[710. Random Pick with Blacklist](https://leetcode.com/problems/random-pick-with-blacklist/)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0710.%20Random%20Pick%20with%20Blacklist)| Hard | O(n)| O(n) ||
+|[922. Sort Array By Parity II](https://leetcode.com/problems/sort-array-by-parity-ii/)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0922.%20Sort%20Array%20By%20Parity%20II)| Easy | O(n)| O(1) ||
+|[969. Pancake Sorting](https://leetcode.com/problems/pancake-sorting/)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0969.%20Pancake%20Sorting)| Medium | O(n log n)| O(log n) |❤️|
+|[973. K Closest Points to Origin](https://leetcode.com/problems/k-closest-points-to-origin/)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0973.%20K%20Closest%20Points%20to%20Origin)| Medium | O(n log n)| O(log n) ||
+|[976. Largest Perimeter Triangle](https://leetcode.com/problems/largest-perimeter-triangle/)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0976.%20Largest%20Perimeter%20Triangle)| Easy | O(n log n)| O(log n) ||
+|[1030. Matrix Cells in Distance Order](https://leetcode.com/problems/matrix-cells-in-distance-order/)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/1030.%20Matrix%20Cells%20in%20Distance%20Order)| Easy | O(n^2)| O(1) ||
+|[1054. Distant Barcodes](https://leetcode.com/problems/distant-barcodes/)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/1054.%20Distant%20Barcodes)| Medium | O(n log n)| O(log n) ||
+|-----------------------------------------------------------------|-------------|-------------| --------------------------| --------------------------|-------------|
+
+
+## Union Find
+| Title | Solution | Difficulty | Time | Space |
+| ----- | -------- | ---------- | ---- | ----- |
+[Number of Connected Components in an Undirected Graph](https://leetcode.com/problems/number-of-connected-components-in-an-undirected-graph/)| [Go](./UnionFind/NumberConnectedComponentsUndirectedGraph.Go)| Medium| O(nlogn)| O(n)|
+[Graph Valid Tree](https://leetcode.com/problems/graph-valid-tree/)| [Go](./UnionFind/GraphValidTree.Go)| Medium| O(nlogn)| O(n)|
+
+## Google
+| Title | Solution | Difficulty | Frequency |
+| ----- | -------- | ---------- | --------- |
+[Plus One](https://leetcode.com/problems/plus-one/)| [Go](./Math/PlusOne.Go)| Easy| ★★★★★★|
+[Number of Islands](https://leetcode.com/problems/number-of-islands/)| [Go](./DFS/NumberofIslands.Go)| Medium| ★★★★|
+[Summary Ranges](https://leetcode.com/problems/summary-ranges/)| [Go](./Array/SummaryRanges.Go)| Medium| ★★★★|
+[Perfect Squares](https://leetcode.com/problems/perfect-squares/)| [Go](./DP/PerfectSquares.Go)| Medium| ★★★★|
+[Merge Intervals](https://leetcode.com/problems/merge-intervals/)| [Go](./Sort/MergeIntervals.Go)| Hard| ★★★|
+[Valid Parentheses](https://leetcode.com/problems/valid-parentheses/)| [Go](./Stack/ValidParentheses.Go)| Easy| ★★★|
+[Trapping Rain Water](https://leetcode.com/problems/trapping-rain-water/)| [Go](./Math/TrappingRainWater.Go)| Hard| ★★|
+[Merge k Sorted Lists](https://leetcode.com/problems/merge-k-sorted-lists/)| [Go](./LinkedList/MergeKSortedLists.Go)| Hard| ★★|
+[Longest Consecutive Sequence](https://leetcode.com/problems/longest-consecutive-sequence/)| [Go](./Array/LongestConsecutiveSequence.Go)| Hard| ★★|
+[Find Peak Element](https://leetcode.com/problems/find-peak-element/)| [Go](./Search/FindPeakElement.Go)| Medium| ★★|
+[Power of Two](https://leetcode.com/problems/power-of-two/)| [Go](./Math/PowerTwo.Go)| Easy| ★★|
+[Spiral Matrix](https://leetcode.com/problems/spiral-matrix/)| [Go](./Array/SpiralMatrix.Go)| Medium| ★★|
+[Sliding Window Maximum ](https://leetcode.com/problems/sliding-window-maximum/)| [Go](./Array/SlidingWindowMaximum.Go)| Hard| ★★|
+[Pow(x, n)](https://leetcode.com/problems/isomorphic-strings/)| [Go](./Math/Pow.Go)| Medium| ★★|
+[Letter Combinations of a Phone Number](https://leetcode.com/problems/letter-combinations-of-a-phone-number/)| [Go](./DFS/LetterCombinationsPhoneNumber.Go)| Medium| ★★|
+[Heaters](https://leetcode.com/problems/heaters/)| [Go](./Array/Heaters.Go)| Easy| ★|
+
+## Facebook
+| Title | Solution | Difficulty | Frequency |
+| ----- | -------- | ---------- | --------- |
+[3Sum](https://leetcode.com/problems/3sum/)| [Go](./Array/ThreeSum.Go)| Medium| ★★★★★★|
+[Valid Palindrome](https://leetcode.com/problems/valid-palindrome/)| [Go](./String/ValidPalindrome.Go)| Easy| ★★★★★★|
+[Valid Palindrome II](https://leetcode.com/problems/valid-palindrome-ii/)| [Go](./String/ValidPalindromeII.Go)| Easy| ★★★★★★|
+[Move Zeroes](https://leetcode.com/problems/move-zeroes/)| [Go](./Array/MoveZeroes.Go)| Easy| ★★★★★★|
+[Remove Invalid Parentheses](https://leetcode.com/problems/remove-invalid-parentheses/)| [Go](./DFS/RemoveInvalidParentheses.Go)| Hard| ★★★★★★|
+[Add Binary](https://leetcode.com/problems/add-binary/)| [Go](./Math/AddBinary.Go)| Easy| ★★★★★|
+[Two Sum](https://leetcode.com/problems/two-sum/)| [Go](./Array/TwoSum.Go)| Easy| ★★★★★|
+[Bnary Tree Paths](https://leetcode.com/problems/binary-tree-paths/)| [Go](./Tree/BnaryTreePaths.Go)| Easy| ★★★★|
+[Letter Combinations of a Phone Number](https://leetcode.com/problems/letter-combinations-of-a-phone-number/)| [Go](./DFS/LetterCombinationsPhoneNumber.Go)| Medium| ★★★★|
+[Merge k Sorted Lists](https://leetcode.com/problems/merge-k-sorted-lists/)| [Go](./LinkedList/MergeKSortedLists.Go)| Hard| ★★★★|
+[Reverse Linked List](https://leetcode.com/problems/reverse-linked-list/)| [Go](./LinkedList/ReverseLinkedList.Go)| Easy| ★★★|
+[Merge Intervals](https://leetcode.com/problems/merge-intervals/)| [Go](./Sort/MergeIntervals.Go)| Hard| ★★★|
+[Number of Islands](https://leetcode.com/problems/number-of-islands/)| [Go](./DFS/NumberofIslands.Go)| Medium| ★★★|
+[Reverse Linked List](https://leetcode.com/problems/reverse-linked-list/)| [Go](./LinkedList/ReverseLinkedList.Go)| Easy| ★★★|
+[Expression Add Operators](https://leetcode.com/problems/expression-add-operators/)| [Go](./DFS/ExpressionAddOperators.Go)| Hard| ★★★|
+[Subsets](https://leetcode.com/problems/subsets/)| [Go](./DFS/Subsets.Go)| Medium| ★★★|
+[Sort Colors](https://leetcode.com/problems/sort-colors/)| [Go](./Sort/SortColors.Go)| Medium| ★★|
+
+## Snapchat
+| Title | Solution | Difficulty | Frequency |
+| ----- | -------- | ---------- | --------- |
+[Game of Life](https://leetcode.com/problems/game-of-life/) | [Go](./Array/GameLife.Go)| Medium| ★★★★★★|
+[Meeting Rooms II](https://leetcode.com/problems/meeting-rooms-ii/)| [Go](./Sort/MeetingRoomsII.Go)| Medium| ★★★★★★|
+[Valid Sudoku](https://leetcode.com/problems/valid-sudoku/)| [Go](./Array/ValidSudoku.Go)| Easy| ★★★★★|
+[Binary Tree Vertical Order Traversal](https://leetcode.com/problems/binary-tree-vertical-order-traversal/)| [Go](./Tree/BinaryTreeVerticalOrderTraversal.Go)| Medium| ★★★★|
+[Alien Dictionary](https://leetcode.com/problems/alien-dictionary/)| [Go](./Sort/AlienDictionary.Go)| Hard| ★★★★|
+[One Edit Distance](https://leetcode.com/problems/one-edit-distance/)| [Go](./String/OneEditDistance.Go)| Medium| ★★★|
+[Sudoku Solver](https://leetcode.com/problems/sudoku-solver/)| [Go](./Math/SudokuSolver.Go)| Hard| ★★★|
+[Reverse Linked List](https://leetcode.com/problems/reverse-linked-list/)| [Go](./LinkedList/ReverseLinkedList.Go)| Easy| ★★|
+[Unique Binary Search Trees](https://leetcode.com/problems/unique-binary-search-trees/)| [Go](./Tree/UniqueBinarySearchTrees.Go)| Medium| ★★|
+[Minimum Window Substring](https://leetcode.com/problems/minimum-window-substring/)| [Go](./Array/MinimumWindowSubstring.Go)| Hard| ★★|
+[Remove K Digits](https://leetcode.com/problems/remove-k-digits/)| [Go](./Stack/RemoveKDigits.Go)| Medium| ★|
+[Ternary Expression Parser](https://leetcode.com/problems/ternary-expression-parser/)| [Go](./Stack/TernaryExpressionParser.Go)| Medium| ★|
+
+## Uber
+| Title | Solution | Difficulty | Frequency |
+| ----- | -------- | ---------- | --------- |
+[Valid Sudoku](https://leetcode.com/problems/valid-sudoku/)| [Go](./Array/ValidSudoku.Go)| Easy| ★★★★|
+[Spiral Matrix](https://leetcode.com/problems/spiral-matrix/)| [Go](./Array/SpiralMatrix.Go)| Medium| ★★★★|
+[Letter Combinations of a Phone Number](https://leetcode.com/problems/letter-combinations-of-a-phone-number/)| [Go](./DFS/LetterCombinationsPhoneNumber.Go)| Medium| ★★★★|
+[Group Anagrams](https://leetcode.com/problems/anagrams/)| [Go](./String/GroupAnagrams.Go)| Medium| ★★★★|
+[Word Pattern](https://leetcode.com/problems/word-pattern/)| [Go](./String/WordPattern.Go)| Easy| ★★★|
+[Roman to Integer](https://leetcode.com/problems/roman-to-integer/)| [Go](./Math/RomanToInteger.Go)| Easy| ★★★|
+[Combination Sum](https://leetcode.com/problems/combination-sum/)| [Go](./DFS/CombinationSum.Go)| Medium| ★★|
+
+## Airbnb
+| Title | Solution | Difficulty | Frequency |
+| ----- | -------- | ---------- | --------- |
+[Two Sum](https://leetcode.com/problems/two-sum/)| [Go](./Array/TwoSum.Go)| Easy| ★★★★★|
+[Text Justification](https://leetcode.com/problems/text-justification/)| [Go](./String/TextJustification.Go)| Hard| ★★★★|
+[House Robber](https://leetcode.com/problems/house-robber/)| [Go](./DP/HouseRobber.Go)| Easy| ★★|
+[Single Number](https://leetcode.com/problems/single-number/)| [Go](./Math/SingleNumber.Go)| Medium| ★★|
+[Word Search II](https://leetcode.com/problems/word-search-ii/)| [Go](./DFS/WordSearchII.Go)| Hard| ★★|
+[Add Two Numbers](https://leetcode.com/problems/add-two-numbers/)| [Go](./Math/AddTwoNumbers.Go)| Medium| ★★|
+
+## LinkedIn
+| Title | Solution | Difficulty | Frequency |
+| ----- | -------- | ---------- | --------- |
+[Maximum Subarray](https://leetcode.com/problems/maximum-subarray/)| [Go](./DP/MaximumSubarray.Go)| Medium| ★★★★★★|
+[Pow(x, n)](https://leetcode.com/problems/isomorphic-strings/)| [Go](./Math/Pow.Go)| Medium| ★★★★★★|
+[Merge Intervals](https://leetcode.com/problems/merge-intervals/)| [Go](./Sort/MergeIntervals.Go)| Hard| ★★★★★★|
+[Isomorphic Strings](https://leetcode.com/problems/isomorphic-strings/)| [Go](./String/IsomorphicStrings.Go)| Easy| ★★★★★★|
+[Search in Rotated Sorted Array](https://leetcode.com/problems/search-in-rotated-sorted-array/)| [Go](./Search/SearchInRotatedSortedArray.Go)| Hard| ★★★★★|
+[Search for a Range](https://leetcode.com/problems/search-for-a-range/)| [Go](./Search/SearchForARange.Go)| Medium| ★★★★★|
+[Two Sum](https://leetcode.com/problems/two-sum/)| [Go](./Array/TwoSum.Go)| Easy| ★★★★|
+[Binary Tree Level Order Traversal](https://leetcode.com/problems/binary-tree-level-order-traversal/)| [Go](./Tree/BinaryTreeLevelOrderTraversal.Go)| Easy| ★★★★|
+[Evaluate Reverse Polish Notation](https://leetcode.com/problems/evaluate-reverse-polish-notation/)| [Go](./Stack/EvaluateReversePolishNotation.Go)| Medium| ★★★|
+[Maximum Product Subarray](https://leetcode.com/problems/maximum-product-subarray/)| [Go](./DP/MaximumProductSubarray.Go)| Medium| ★★★|
+[Product of Array Except Self](https://leetcode.com/problems/product-of-array-except-self/)| [Go](./Array/ProductExceptSelf.Go)| Medium| ★★★|
+[Symmetric Tree](https://leetcode.com/problems/symmetric-tree/)| [Go](./Tree/SymmetricTree.Go)| Easy| ★★|
+
+## Amazon
+| Title | Solution | Difficulty | Frequency |
+| ----- | -------- | ---------- | --------- |
+[Two Sum](https://leetcode.com/problems/two-sum/)| [Go](./Array/TwoSum.Go)| Easy| ★★★★★★|
+[Min Cost Climbing Stairs](https://leetcode.com/problems/min-cost-climbing-stairs/)| [Go](./DP/MinCostClimbingStairs.Go)| Easy| ★★★★|
+[Number of Islands](https://leetcode.com/problems/number-of-islands/)| [Go](./DFS/NumberofIslands.Go)| Medium| ★★|
+[Add Two Numbers](https://leetcode.com/problems/add-two-numbers/)| [Go](./Math/AddTwoNumbers.Go)| Medium| ★★|
+[Reverse Linked List](https://leetcode.com/problems/reverse-linked-list/)| [Go](./LinkedList/ReverseLinkedList.Go)| Easy| ★★|
+[Valid Parentheses](https://leetcode.com/problems/valid-parentheses/)| [Go](./Stack/ValidParentheses.Go)| Easy| ★★|
+[Longest Palindromic Substring](https://leetcode.com/problems/longest-palindromic-substring/)| [Go](./DP/LongestPalindromicSubstring.Go)| Medium| ★★|
+[Trapping Rain Water](https://leetcode.com/problems/trapping-rain-water/)| [Go](./Math/TrappingRainWater.Go)| Hard| ★★|
+[Longest Substring Without Repeating Characters](https://leetcode.com/problems/longest-substring-without-repeating-characters/)| [Go](./String/LongestSubstringWithoutRepeatingCharacters.Go)| Medium| ★★|
+[Letter Combinations of a Phone Number](https://leetcode.com/problems/letter-combinations-of-a-phone-number/)| [Go](./DFS/LetterCombinationsPhoneNumber.Go)| Medium| ★★|
+[Valid Anagram](https://leetcode.com/problems/valid-anagram/)| [Go](./String/ValidAnagram.Go)| Easy| ★★|
+[Rotate Image](https://leetcode.com/problems/rotate-image/)| [Go](./Array/RotateImage.Go)| Medium| ★★|
+[Best Time to Buy and Sell Stock](https://leetcode.com/problems/best-time-to-buy-and-sell-stock/)| [Go](./DP/BestTimeBuySellStock.Go)| Easy| ★★|
+[3Sum](https://leetcode.com/problems/3sum/)| [Go](./Array/ThreeSum.Go)| Medium| ★★|
+[Sliding Window Maximum ](https://leetcode.com/problems/sliding-window-maximum/)| [Go](./Array/SlidingWindowMaximum.Go)| Hard| ★★|
+
+## Microsoft
+| Title | Solution | Difficulty | Frequency |
+| ----- | -------- | ---------- | --------- |
+[Reverse Linked List](https://leetcode.com/problems/reverse-linked-list/)| [Go](./LinkedList/ReverseLinkedList.Go)| Easy| ★★★★★★|
+[Two Sum](https://leetcode.com/problems/two-sum/)| [Go](./Array/TwoSum.Go)| Easy| ★★★★★|
+[String to Integer (atoi)](https://leetcode.com/problems/string-to-integer-atoi/)| [Go](./Math/Atoi.Go)| Easy| ★★★★|
+[Add Two Numbers](https://leetcode.com/problems/add-two-numbers/)| [Go](./Math/AddTwoNumbers.Go)| Medium| ★★★★|
+[Excel Sheet Column Number](https://leetcode.com/problems/excel-sheet-column-number/)| [Go](./Math/ExcelSheetColumnNumber.Go)| Easy| ★★★★|
+[Validate Binary Search Tree](https://leetcode.com/problems/validate-binary-search-tree/)| [Go](./Tree/ValidateBinarySearchTree.Go)| Medium| ★★★|
+[Merge Two Sorted Lists](https://leetcode.com/problems/merge-two-sorted-lists/)| [Go](./LinkedList/MergeTwoSortedLists.Go)| Easy| ★★★|
\ No newline at end of file
diff --git a/ctl/README.md b/ctl/README.md
new file mode 100644
index 000000000..cbbc8327f
--- /dev/null
+++ b/ctl/README.md
@@ -0,0 +1,20 @@
+# LeetCode-Go ctl
+
+## 配置方法
+
+1. 在`.gitignore`中，添加一行`*.toml`
+2. 在`LeetCode-Go`目录下，添加文本文件`config.toml`。
+3. 把以下内容复制到`config.toml`中。
+4. 把`config.toml`中的`test`分别修改为你的 leetcode `用户名`和`密码`。
+5. 去 leetcode 登录后，把网站 cookie 复制 (需要复制 csrftoken 和 LEETCODE_SESSION) 并替换 `config.toml`中的`Cookie`。
+
+```toml
+Username="test"
+Password="test"
+Cookie="csrftoken=XXXXXXXXX; LEETCODE_SESSION=YYYYYYYY;"
+CSRFtoken="ZZZZZZZZ"
+```
+
+## PDF 生成
+
+用 `leetcode-go pdf` 命令先生成书籍内容的合并版本 pdf.md，再用 vscode 或者其他支持 toc 目录生成的工具，生成 toc。最后用 Typora 把 md 文件转换成 pdf。就可以发布 release 新版本了。
\ No newline at end of file
diff --git a/ctl/command.go b/ctl/command.go
new file mode 100644
index 000000000..a440a5710
--- /dev/null
+++ b/ctl/command.go
@@ -0,0 +1,30 @@
+package main
+
+import (
+ "fmt"
+ "os"
+
+ "github.com/spf13/cobra"
+)
+
+var rootCmd = &cobra.Command{
+ Use: "leetcode-go",
+ Short: "A simple command line client for leetcode-go.",
+}
+
+func execute() {
+ if err := rootCmd.Execute(); err != nil {
+ fmt.Println(err)
+ os.Exit(-1)
+ }
+}
+
+func init() {
+ rootCmd.AddCommand(
+ versionCmd,
+ newBuildCommand(),
+ newLabelCommand(),
+ newPDFCommand(),
+ newRefresh(),
+ )
+}
diff --git a/ctl/config.go b/ctl/config.go
new file mode 100644
index 000000000..4288c3d25
--- /dev/null
+++ b/ctl/config.go
@@ -0,0 +1,32 @@
+package main
+
+import (
+ "fmt"
+ "log"
+
+ "github.com/BurntSushi/toml"
+)
+
+const (
+ configTOML = "config.toml"
+)
+
+type config struct {
+ Username string
+ Password string
+ Cookie string
+ CSRFtoken string
+}
+
+func (c config) String() string {
+ return fmt.Sprintf("Username: %s, Password: %s", c.Username, c.Password)
+}
+
+func getConfig() *config {
+ cfg := new(config)
+ if _, err := toml.DecodeFile(configTOML, &cfg); err != nil {
+ log.Panicf(err.Error())
+ }
+ // log.Printf("get config: %s", cfg)
+ return cfg
+}
diff --git a/ctl/error.go b/ctl/error.go
new file mode 100644
index 000000000..903460a83
--- /dev/null
+++ b/ctl/error.go
@@ -0,0 +1,21 @@
+package main
+
+import (
+ "fmt"
+ "os"
+)
+
+const (
+ // ExitSuccess define
+ ExitSuccess = iota
+ // ExitError define
+ ExitError
+ // ExitBadArgs define
+ ExitBadArgs
+)
+
+// ExitWithError define
+func ExitWithError(code int, err error) {
+ fmt.Fprintln(os.Stderr, "Error: ", err)
+ os.Exit(code)
+}
diff --git a/ctl/label.go b/ctl/label.go
new file mode 100644
index 000000000..db94bf720
--- /dev/null
+++ b/ctl/label.go
@@ -0,0 +1,348 @@
+package main
+
+import (
+ "bufio"
+ "errors"
+ "fmt"
+ "io"
+ "io/ioutil"
+ "os"
+ "regexp"
+ "strings"
+
+ "github.com/halfrost/LeetCode-Go/ctl/util"
+ "github.com/spf13/cobra"
+)
+
+var (
+ chapterOneFileOrder = []string{"_index", "Data_Structure", "Algorithm", "Time_Complexity"}
+ chapterOneMenuOrder = []string{"_index", "#关于作者", "Data_Structure", "Algorithm", "Time_Complexity"}
+ chapterTwoFileOrder = []string{"_index", "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"}
+ chapterThreeFileOrder = []string{"_index", "Segment_Tree", "UnionFind", "LRUCache", "LFUCache"}
+ preNextHeader = "----------------------------------------------\n<div style=\"display: flex;justify-content: space-between;align-items: center;\">\n"
+ preNextFotter = "</div>"
+ delLine = "----------------------------------------------\n"
+ delHeader = "<div style=\"display: flex;justify-content: space-between;align-items: center;\">"
+ delLabel = "<[a-zA-Z]+.*?>([\\s\\S]*?)</[a-zA-Z]*?>"
+ delFooter = "</div>"
+
+ //ErrNoFilename is thrown when the path the the file to tail was not given
+ ErrNoFilename = errors.New("You must provide the path to a file in the \"-file\" flag.")
+
+ //ErrInvalidLineCount is thrown when the user provided 0 (zero) as the value for number of lines to tail
+ ErrInvalidLineCount = errors.New("You cannot tail zero lines.")
+
+ chapterMap = map[string]map[string]string{
+ "ChapterOne": {
+ "_index": "第一章 序章",
+ "Data_Structure": "1.1 数据结构知识",
+ "Algorithm": "1.2 算法知识",
+ "Time_Complexity": "1.3 时间复杂度",
+ },
+ "ChapterTwo": {
+ "_index": "第二章 算法专题",
+ "Array": "2.01 Array",
+ "String": "2.02 String",
+ "Two_Pointers": "2.03 ✅ Two Pointers",
+ "Linked_List": "2.04 ✅ Linked List",
+ "Stack": "2.05 ✅ Stack",
+ "Tree": "2.06 Tree",
+ "Dynamic_Programming": "2.07 Dynamic Programming",
+ "Backtracking": "2.08 ✅ Backtracking",
+ "Depth_First_Search": "2.09 Depth First Search",
+ "Breadth_First_Search": "2.10 Breadth First Search",
+ "Binary_Search": "2.11 Binary Search",
+ "Math": "2.12 Math",
+ "Hash_Table": "2.13 Hash Table",
+ "Sorting": "2.14 ✅ Sorting",
+ "Bit_Manipulation": "2.15 ✅ Bit Manipulation",
+ "Union_Find": "2.16 ✅ Union Find",
+ "Sliding_Window": "2.17 ✅ Sliding Window",
+ "Segment_Tree": "2.18 ✅ Segment Tree",
+ "Binary_Indexed_Tree": "2.19 ✅ Binary Indexed Tree",
+ },
+ "ChapterThree": {
+ "_index": "第三章 一些模板",
+ "Segment_Tree": "3.1 Segment Tree",
+ "UnionFind": "3.2 UnionFind",
+ "LRUCache": "3.3 LRUCache",
+ "LFUCache": "3.4 LFUCache",
+ },
+ "ChapterFour": {
+ "_index": "第四章 Leetcode 题解",
+ },
+ }
+)
+
+func getChapterFourFileOrder() ([]string, []int) {
+ solutions, solutionIds := util.LoadChapterFourDir()
+ chapterFourFileOrder := []string{"_index"}
+ chapterFourFileOrder = append(chapterFourFileOrder, solutions...)
+ fmt.Printf("ChapterFour 中包括 _index 有 %v 个文件, len(id) = %v\n", len(chapterFourFileOrder), len(solutionIds))
+ return chapterFourFileOrder, solutionIds
+}
+
+func newLabelCommand() *cobra.Command {
+ mc := &cobra.Command{
+ Use: "label <subcommand>",
+ Short: "Label related commands",
+ }
+ //mc.PersistentFlags().StringVar(&logicEndpoint, "endpoint", "localhost:5880", "endpoint of logic service")
+ mc.AddCommand(
+ newAddPreNext(),
+ newDeletePreNext(),
+ )
+ return mc
+}
+
+func newAddPreNext() *cobra.Command {
+ cmd := &cobra.Command{
+ Use: "add-pre-next",
+ Short: "Add pre-next label",
+ Run: func(cmd *cobra.Command, args []string) {
+ addPreNext()
+ },
+ }
+ // cmd.Flags().StringVar(&alias, "alias", "", "alias")
+ // cmd.Flags().StringVar(&appId, "appid", "", "appid")
+ return cmd
+}
+
+func newDeletePreNext() *cobra.Command {
+ cmd := &cobra.Command{
+ Use: "del-pre-next",
+ Short: "Delete pre-next label",
+ Run: func(cmd *cobra.Command, args []string) {
+ delPreNext()
+ },
+ }
+ // cmd.Flags().StringVar(&alias, "alias", "", "alias")
+ // cmd.Flags().StringVar(&appId, "appid", "", "appid")
+ return cmd
+}
+
+func addPreNext() {
+ // Chpater one add pre-next
+ addPreNextLabel(chapterOneFileOrder, []string{}, []int{}, "", "ChapterOne", "ChapterTwo")
+ // Chpater two add pre-next
+ addPreNextLabel(chapterTwoFileOrder, chapterOneFileOrder, []int{}, "ChapterOne", "ChapterTwo", "ChapterThree")
+ // Chpater three add pre-next
+ addPreNextLabel(chapterThreeFileOrder, chapterTwoFileOrder, []int{}, "ChapterTwo", "ChapterThree", "ChapterFour")
+ // Chpater four add pre-next
+ //fmt.Printf("%v\n", getChapterFourFileOrder())
+ chapterFourFileOrder, solutionIds := getChapterFourFileOrder()
+ addPreNextLabel(chapterFourFileOrder, chapterThreeFileOrder, solutionIds, "ChapterThree", "ChapterFour", "")
+}
+
+func addPreNextLabel(order, preOrder []string, chapterFourIds []int, preChapter, chapter, nextChapter string) {
+ var (
+ exist bool
+ err error
+ res []byte
+ count int
+ )
+ for index, path := range order {
+ tmp := ""
+ if index == 0 {
+ if chapter == "ChapterOne" {
+ // 第一页不需要“上一章”
+ tmp = "\n\n" + delLine + fmt.Sprintf("<p align = \"right\"><a href=\"https://books.halfrost.com/leetcode/%v/%v/\">下一页➡️</a></p>\n", chapter, order[index+1])
+ } else {
+ if chapter == "ChapterFour" {
+ tmp = "\n\n" + preNextHeader + fmt.Sprintf("<p><a href=\"https://books.halfrost.com/leetcode/%v/%v/\">⬅️上一章</a></p>\n", preChapter, preOrder[len(preOrder)-1]) + fmt.Sprintf("<p><a href=\"https://books.halfrost.com/leetcode/%v/%v/%v/\">下一页➡️</a></p>\n", chapter, util.GetChpaterFourFileNum(chapterFourIds[(index-1)+1]), order[index+1]) + preNextFotter
+ } else {
+ tmp = "\n\n" + preNextHeader + fmt.Sprintf("<p><a href=\"https://books.halfrost.com/leetcode/%v/%v/\">⬅️上一章</a></p>\n", preChapter, preOrder[len(preOrder)-1]) + fmt.Sprintf("<p><a href=\"https://books.halfrost.com/leetcode/%v/%v/\">下一页➡️</a></p>\n", chapter, order[index+1]) + preNextFotter
+ }
+ }
+ } else if index == len(order)-1 {
+ if chapter == "ChapterFour" {
+ // 最后一页不需要“下一页”
+ tmp = "\n\n" + delLine + fmt.Sprintf("<p><a href=\"https://books.halfrost.com/leetcode/%v/%v/%v/\">⬅️上一页</a></p>\n", chapter, util.GetChpaterFourFileNum(chapterFourIds[(index-1)-1]), order[index-1])
+ } else {
+ tmp = "\n\n" + preNextHeader + fmt.Sprintf("<p><a href=\"https://books.halfrost.com/leetcode/%v/%v/\">⬅️上一页</a></p>\n", chapter, order[index-1]) + fmt.Sprintf("<p><a href=\"https://books.halfrost.com/leetcode/%v/\">下一章➡️</a></p>\n", nextChapter) + preNextFotter
+ }
+ } else if index == 1 {
+ if chapter == "ChapterFour" {
+ tmp = "\n\n" + preNextHeader + fmt.Sprintf("<p><a href=\"https://books.halfrost.com/leetcode/%v/\">⬅️上一页</a></p>\n", chapter) + fmt.Sprintf("<p><a href=\"https://books.halfrost.com/leetcode/%v/%v/%v/\">下一页➡️</a></p>\n", chapter, util.GetChpaterFourFileNum(chapterFourIds[(index-1)+1]), order[index+1]) + preNextFotter
+ } else {
+ tmp = "\n\n" + preNextHeader + fmt.Sprintf("<p><a href=\"https://books.halfrost.com/leetcode/%v/\">⬅️上一页</a></p>\n", chapter) + fmt.Sprintf("<p><a href=\"https://books.halfrost.com/leetcode/%v/%v/\">下一页➡️</a></p>\n", chapter, order[index+1]) + preNextFotter
+ }
+ } else {
+ if chapter == "ChapterFour" {
+ tmp = "\n\n" + preNextHeader + fmt.Sprintf("<p><a href=\"https://books.halfrost.com/leetcode/%v/%v/%v/\">⬅️上一页</a></p>\n", chapter, util.GetChpaterFourFileNum(chapterFourIds[(index-1)-1]), order[index-1]) + fmt.Sprintf("<p><a href=\"https://books.halfrost.com/leetcode/%v/%v/%v/\">下一页➡️</a></p>\n", chapter, util.GetChpaterFourFileNum(chapterFourIds[(index-1)+1]), order[index+1]) + preNextFotter
+ } else {
+ tmp = "\n\n" + preNextHeader + fmt.Sprintf("<p><a href=\"https://books.halfrost.com/leetcode/%v/%v/\">⬅️上一页</a></p>\n", chapter, order[index-1]) + fmt.Sprintf("<p><a href=\"https://books.halfrost.com/leetcode/%v/%v/\">下一页➡️</a></p>\n", chapter, order[index+1]) + preNextFotter
+ }
+ }
+
+ if chapter == "ChapterFour" && index > 0 {
+ path = fmt.Sprintf("%v/%v", util.GetChpaterFourFileNum(chapterFourIds[(index-1)]), path)
+ }
+
+ exist, err = needAdd(fmt.Sprintf("../website/content/%v/%v.md", chapter, path))
+ if err != nil {
+ fmt.Println(err)
+ return
+ }
+ // 当前没有上一页和下一页，才添加
+ if !exist && err == nil {
+ res, err = eofAdd(fmt.Sprintf("../website/content/%v/%v.md", chapter, path), tmp)
+ if err != nil {
+ fmt.Println(err)
+ return
+ }
+ util.WriteFile(fmt.Sprintf("../website/content/%v/%v.md", chapter, path), res)
+ count++
+ }
+ }
+ fmt.Printf("添加了 %v 个文件的 pre-next\n", count)
+}
+
+func eofAdd(filePath string, labelString 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 {
+ output = append(output, []byte(labelString)...)
+ output = append(output, []byte("\n")...)
+ return output, nil
+ }
+ return nil, err
+ }
+ output = append(output, line...)
+ output = append(output, []byte("\n")...)
+ }
+}
+
+func delPreNext() {
+ // Chpater one del pre-next
+ delPreNextLabel(chapterOneFileOrder, []int{}, "ChapterOne")
+ // Chpater two del pre-next
+ delPreNextLabel(chapterTwoFileOrder, []int{}, "ChapterTwo")
+ // Chpater three del pre-next
+ delPreNextLabel(chapterThreeFileOrder, []int{}, "ChapterThree")
+ // Chpater four del pre-next
+ chapterFourFileOrder, solutionIds := getChapterFourFileOrder()
+ delPreNextLabel(chapterFourFileOrder, solutionIds, "ChapterFour")
+}
+
+func delPreNextLabel(order []string, chapterFourIds []int, chapter string) {
+ count := 0
+ for index, path := range order {
+ lineNum := 5
+ if index == 0 && chapter == "ChapterOne" || index == len(order)-1 && chapter == "ChapterFour" {
+ lineNum = 3
+ }
+ if chapter == "ChapterFour" && index > 0 {
+ path = fmt.Sprintf("%v/%v", util.GetChpaterFourFileNum(chapterFourIds[(index-1)]), path)
+ }
+
+ exist, err := needAdd(fmt.Sprintf("../website/content/%v/%v.md", chapter, path))
+ if err != nil {
+ fmt.Println(err)
+ return
+ }
+ // 存在才删除
+ if exist && err == nil {
+ removeLine(fmt.Sprintf("../website/content/%v/%v.md", chapter, path), lineNum+1)
+ count++
+ }
+ }
+ fmt.Printf("删除了 %v 个文件的 pre-next\n", count)
+ // 另外一种删除方法
+ // res, err := eofDel(fmt.Sprintf("../website/content/ChapterOne/%v.md", v))
+ // if err != nil {
+ // fmt.Println(err)
+ // return
+ // }
+ // util.WriteFile(fmt.Sprintf("../website/content/ChapterOne/%v.md", v), res)
+}
+
+func needAdd(filePath string) (bool, error) {
+ f, err := os.OpenFile(filePath, os.O_RDONLY, 0644)
+ if err != nil {
+ return false, err
+ }
+ defer f.Close()
+ reader, output := bufio.NewReader(f), []byte{}
+ for {
+ line, _, err := reader.ReadLine()
+ if err != nil {
+ if err == io.EOF {
+ return false, nil
+ }
+ return false, err
+ }
+ if ok, _ := regexp.Match(delHeader, line); ok {
+ return true, nil
+ } else if ok, _ := regexp.Match(delLabel, line); ok {
+ return true, nil
+ } else {
+ output = append(output, line...)
+ output = append(output, []byte("\n")...)
+ }
+ }
+}
+
+func eofDel(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(delLine, line); ok {
+ reg := regexp.MustCompile(delLine)
+ newByte := reg.ReplaceAll(line, []byte(""))
+ output = append(output, newByte...)
+ output = append(output, []byte("\n")...)
+ } else if ok, _ := regexp.Match(delHeader, line); ok {
+ reg := regexp.MustCompile(delHeader)
+ newByte := reg.ReplaceAll(line, []byte(""))
+ output = append(output, newByte...)
+ output = append(output, []byte("\n")...)
+ } else if ok, _ := regexp.Match(delLabel, line); ok {
+ reg := regexp.MustCompile(delLabel)
+ newByte := reg.ReplaceAll(line, []byte(""))
+ output = append(output, newByte...)
+ output = append(output, []byte("\n")...)
+ } else if ok, _ := regexp.Match(delFooter, line); ok {
+ reg := regexp.MustCompile(delFooter)
+ 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 removeLine(path 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[:len(array)-lineNumber-1]
+ ioutil.WriteFile(path, []byte(strings.Join(array, "\n")), mode)
+ //fmt.Println("remove line successful")
+}
diff --git a/ctl/main.go b/ctl/main.go
new file mode 100644
index 000000000..f7d07b015
--- /dev/null
+++ b/ctl/main.go
@@ -0,0 +1,5 @@
+package main
+
+func main() {
+ execute()
+}
diff --git a/ctl/meta/Array b/ctl/meta/Array
new file mode 100644
index 000000000..6611e480c
--- /dev/null
+++ b/ctl/meta/Array
@@ -0,0 +1,52 @@
+|1. Two Sum| [Go]({{< relref "/ChapterFour/0001.Two-Sum.md" >}})| Easy | O(n)| O(n)||
+|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)|❤️|
+|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)||
+|39. Combination Sum | [Go]({{< relref "/ChapterFour/0039.Combination-Sum.md" >}})| Medium | O(n log n)| O(n)||
+|40. Combination Sum II | [Go]({{< relref "/ChapterFour/0040.Combination-Sum-II.md" >}})| Medium | O(n log n)| O(n)||
+|41. First Missing Positive | [Go]({{< relref "/ChapterFour/0041.First-Missing-Positive.md" >}})| Hard | O(n)| O(n)||
+|42. Trapping Rain Water | [Go]({{< relref "/ChapterFour/0042.Trapping-Rain-Water.md" >}})| Hard | O(n)| O(1)|❤️|
+|48. Rotate Image | [Go]({{< relref "/ChapterFour/0048.Rotate-Image.md" >}})| Medium | O(n)| O(1)||
+|53. Maximum Subarray| [Go]({{< relref "/ChapterFour/0053.Maximum-Subarray.md" >}})| Easy | O(n)| O(n)||
+|54. Spiral Matrix| [Go]({{< relref "/ChapterFour/0054.Spiral-Matrix.md" >}})| Medium | O(n)| O(n^2)||
+|56. Merge Intervals | [Go]({{< relref "/ChapterFour/0056.Merge-Intervals.md" >}})| Medium | O(n log n)| O(1)||
+|57. Insert Interval | [Go]({{< relref "/ChapterFour/0057.Insert-Interval.md" >}})| Hard | O(n)| O(1)||
+|59. Spiral Matrix II | [Go]({{< relref "/ChapterFour/0059.Spiral-Matrix-II.md" >}})| Medium | O(n)| O(n^2)||
+|62. Unique Paths | [Go]({{< relref "/ChapterFour/0062.Unique-Paths.md" >}})| Medium | O(n^2)| O(n^2)||
+|63. Unique Paths II | [Go]({{< relref "/ChapterFour/0063.Unique-Paths-II.md" >}})| Medium | O(n^2)| O(n^2)||
+|64. Minimum Path Sum | [Go]({{< relref "/ChapterFour/0064.Minimum-Path-Sum.md" >}})| Medium | O(n^2)| O(n^2)||
+|75. Sort Colors | [Go]({{< relref "/ChapterFour/0075.Sort-Colors.md" >}})| Medium| O(n)| O(1)|❤️|
+|78. Subsets| [Go]({{< relref "/ChapterFour/0078.Subsets.md" >}})| Medium | O(n^2)| O(n)|❤️|
+|79. Word Search | [Go]({{< relref "/ChapterFour/0079.Word-Search.md" >}})| Medium | O(n^2)| O(n^2)|❤️|
+|80. Remove Duplicates from Sorted Array II| [Go]({{< relref "/ChapterFour/0080.Remove-Duplicates-from-Sorted-Array-II.md" >}})| Medium | O(n)| O(1||
+|84. Largest Rectangle in Histogram | [Go]({{< relref "/ChapterFour/0084.Largest-Rectangle-in-Histogram.md" >}})| Medium | O(n)| O(n)|❤️|
+|88. Merge Sorted Array | [Go]({{< relref "/ChapterFour/0088.Merge-Sorted-Array.md" >}})| Easy | O(n)| O(1)|❤️|
+|90. Subsets II | [Go]({{< relref "/ChapterFour/0090.Subsets-II.md" >}})| Medium | O(n^2)| O(n)|❤️|
+|120. Triangle | [Go]({{< relref "/ChapterFour/0120.Triangle.md" >}})| Medium | O(n^2)| O(n)||
+|121. Best Time to Buy and Sell Stock | [Go]({{< relref "/ChapterFour/0121.Best-Time-to-Buy-and-Sell-Stock.md" >}})| Easy | O(n)| O(1)||
+|122. Best Time to Buy and Sell Stock II | [Go]({{< relref "/ChapterFour/0122.Best-Time-to-Buy-and-Sell-Stock-II.md" >}})| Easy | O(n)| O(1)||
+|126. Word Ladder II | [Go]({{< relref "/ChapterFour/0126.Word-Ladder-II.md" >}})| Hard | O(n)| O(n^2)|❤️|
+|152. Maximum Product Subarray | [Go]({{< relref "/ChapterFour/0152.Maximum-Product-Subarray.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)||
+|216. Combination Sum III | [Go]({{< relref "/ChapterFour/0216.Combination-Sum-III.md" >}})| Medium | O(n)| O(1)|❤️|
+|217. Contains Duplicate | [Go]({{< relref "/ChapterFour/0217.Contains-Duplicate.md" >}})| Easy | O(n)| O(n)||
+|219. Contains Duplicate II | [Go]({{< relref "/ChapterFour/0219.Contains-Duplicate-II.md" >}})| Easy | O(n)| O(n)||
+|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)|❤️|
+|532. K-diff Pairs in an Array | [Go]({{< relref "/ChapterFour/0532.K-diff-Pairs-in-an-Array.md" >}})| Easy | O(n)| O(n)||
+|566. Reshape the Matrix | [Go]({{< relref "/ChapterFour/0566.Reshape-the-Matrix.md" >}})| Easy | O(n^2)| O(n^2)||
+|628. Maximum Product of Three Numbers | [Go]({{< relref "/ChapterFour/0628.Maximum-Product-of-Three-Numbers.md" >}})| Easy | 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)||
+|714. Best Time to Buy and Sell Stock with Transaction Fee| [Go]({{< relref "/ChapterFour/0714.Best-Time-to-Buy-and-Sell-Stock-with-Transaction-Fee.md" >}})| Medium | O(n)| O(1)||
+|746. Min Cost Climbing Stairs | [Go]({{< relref "/ChapterFour/0746.Min-Cost-Climbing-Stairs.md" >}})| Easy | O(n)| O(1)||
+|766. Toeplitz Matrix | [Go]({{< relref "/ChapterFour/0766.Toeplitz-Matrix.md" >}})| Easy | O(n)| O(1)||
+|867. Transpose Matrix | [Go]({{< relref "/ChapterFour/0867.Transpose-Matrix.md" >}})| Easy | O(n)| O(1)||
+|891. Sum of Subsequence Widths | [Go]({{< relref "/ChapterFour/0891.Sum-of-Subsequence-Widths.md" >}})| Hard | O(n log n)| O(1)||
+|907. Sum of Subarray Minimums | [Go]({{< relref "/ChapterFour/0907.Sum-of-Subarray-Minimums.md" >}})| Medium | O(n)| O(n)|❤️|
+|922. Sort Array By Parity II | [Go]({{< relref "/ChapterFour/0922.Sort-Array-By-Parity-II.md" >}})| Medium | O(n)| O(1)||
+|969. Pancake Sorting | [Go]({{< relref "/ChapterFour/0969.Pancake-Sorting.md" >}})| Medium | O(n)| O(1)|❤️|
+|977. Squares of a Sorted Array | [Go]({{< relref "/ChapterFour/0977.Squares-of-a-Sorted-Array.md" >}})| Easy | O(n)| O(1)||
\ No newline at end of file
diff --git a/ctl/meta/Backtracking b/ctl/meta/Backtracking
new file mode 100644
index 000000000..9c140d2dd
--- /dev/null
+++ b/ctl/meta/Backtracking
@@ -0,0 +1,30 @@
+|17. Letter Combinations of a Phone Number | [Go]({{< relref "/ChapterFour/0017.Letter-Combinations-of-a-Phone-Number.md" >}})| Medium | O(log n)| O(1)||
+|22. Generate Parentheses| [Go]({{< relref "/ChapterFour/0022.Generate-Parentheses.md" >}})| Medium | O(log n)| O(1)||
+|37. Sudoku Solver | [Go]({{< relref "/ChapterFour/0037.Sudoku-Solver.md" >}})| Hard | O(n^2)| O(n^2)|❤️|
+|39. Combination Sum | [Go]({{< relref "/ChapterFour/0039.Combination-Sum.md" >}})| Medium | O(n log n)| O(n)||
+|40. Combination Sum II | [Go]({{< relref "/ChapterFour/0040.Combination-Sum-II.md" >}})| Medium | O(n log n)| O(n)||
+|46. Permutations | [Go]({{< relref "/ChapterFour/0046.Permutations.md" >}})| Medium | O(n)| O(n)|❤️|
+|47. Permutations II | [Go]({{< relref "/ChapterFour/0047.Permutations-II.md" >}})| Medium | O(n^2)| O(n)|❤️|
+|51. N-Queens | [Go]({{< relref "/ChapterFour/0051.N-Queens.md" >}})| Hard | O(n!)| O(n)|❤️|
+|52. N-Queens II | [Go]({{< relref "/ChapterFour/0052.N-Queens-II.md" >}})| Hard | O(n!)| O(n)|❤️|
+|60. Permutation Sequence | [Go]({{< relref "/ChapterFour/0060.Permutation-Sequence.md" >}})| Medium | O(n log n)| O(1)||
+|77. Combinations | [Go]({{< relref "/ChapterFour/0077.Combinations.md" >}})| Medium | O(n)| O(n)|❤️|
+|78. Subsets | [Go]({{< relref "/ChapterFour/0078.Subsets.md" >}})| Medium | O(n^2)| O(n)|❤️|
+|79. Word Search | [Go]({{< relref "/ChapterFour/0079.Word-Search.md" >}})| Medium | O(n^2)| O(n^2)|❤️|
+|89. Gray Codes | [Go]({{< relref "/ChapterFour/0089.Gray-Code.md" >}})| Medium | O(n)| O(1)||
+|90. Subsets II | [Go]({{< relref "/ChapterFour/0090.Subsets-II.md" >}})| Medium | O(n^2)| O(n)|❤️|
+|93. Restore IP Addresses | [Go]({{< relref "/ChapterFour/0093.Restore-IP-Addresses.md" >}})| Medium | O(n)| O(n)|❤️|
+|126. Word Ladder II | [Go]({{< relref "/ChapterFour/0126.Word-Ladder-II.md" >}})| Hard | O(n)| O(n^2)|❤️|
+|131. Palindrome Partitioning | [Go]({{< relref "/ChapterFour/0131.Palindrome-Partitioning.md" >}})| Medium | O(n)| O(n^2)|❤️|
+|211. Add and Search Word - Data structure design | [Go]({{< relref "/ChapterFour/0211.Add-and-Search-Word---Data-structure-design.md" >}})| Medium | O(n)| O(n)|❤️|
+|212. Word Search II | [Go]({{< relref "/ChapterFour/0212.Word-Search-II.md" >}})| Hard | O(n^2)| O(n^2)|❤️|
+|216. Combination Sum III | [Go]({{< relref "/ChapterFour/0216.Combination-Sum-III.md" >}})| Medium | O(n)| O(1)|❤️|
+|306. Additive Number | [Go]({{< relref "/ChapterFour/0306.Additive-Number.md" >}})| Medium | O(n^2)| O(1)|❤️|
+|357. Count Numbers with Unique Digits | [Go]({{< relref "/ChapterFour/0357.Count-Numbers-with-Unique-Digits.md" >}})| Medium | O(1)| O(1)||
+|401. Binary Watch | [Go]({{< relref "/ChapterFour/0401.Binary-Watch.md" >}})| Easy | O(1)| O(1)||
+|526. Beautiful Arrangement | [Go]({{< relref "/ChapterFour/0526.Beautiful-Arrangement.md" >}})| Medium | O(n^2)| O(1)|❤️|
+|784. Letter Case Permutation | [Go]({{< relref "/ChapterFour/0784.Letter-Case-Permutation.md" >}})| Easy | O(n)| O(n)||
+|842. Split Array into Fibonacci Sequence | [Go]({{< relref "/ChapterFour/0842.Split-Array-into-Fibonacci-Sequence.md" >}})| Medium | O(n^2)| O(1)|❤️|
+|980. Unique Paths III | [Go]({{< relref "/ChapterFour/0980.Unique-Paths-III.md" >}})| Hard | O(n log n)| O(n)||
+|996. Number of Squareful Arrays | [Go]({{< relref "/ChapterFour/0996.Number-of-Squareful-Arrays.md" >}})| Hard | O(n log n)| O(n) ||
+|1079. Letter Tile Possibilities | [Go]({{< relref "/ChapterFour/1079.Letter-Tile-Possibilities.md" >}})| Medium | O(n^2)| O(1)|❤️|
\ No newline at end of file
diff --git a/ctl/meta/Binary_Indexed_Tree b/ctl/meta/Binary_Indexed_Tree
new file mode 100644
index 000000000..e69de29bb
diff --git a/ctl/meta/Binary_Search b/ctl/meta/Binary_Search
new file mode 100644
index 000000000..427924180
--- /dev/null
+++ b/ctl/meta/Binary_Search
@@ -0,0 +1,13 @@
+|50. Pow(x, n) | [Go]({{< relref "/ChapterFour/0050.Powx-n.md" >}})| Medium | O(log n)| O(1)||
+|69. Sqrt(x) | [Go]({{< relref "/ChapterFour/0069.Sqrtx.md" >}})| Easy | O(log 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)||
+|222. Count Complete Tree Nodes | [Go]({{< relref "/ChapterFour/0222.Count-Complete-Tree-Nodes.md" >}})| Medium | 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)||
+|287. Find the Duplicate Number | [Go]({{< relref "/ChapterFour/0287.Find-the-Duplicate-Number.md" >}})| Easy | O(n)| O(1)|❤️|
+|300. Longest Increasing Subsequence | [Go]({{< relref "/ChapterFour/0300.Longest-Increasing-Subsequence.md" >}})| Medium | O(n log 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) ||
+|392. Is Subsequence | [Go]({{< relref "/ChapterFour/0392.Is-Subsequence.md" >}})| Medium | O(n)| O(1)||
+|454. 4Sum II | [Go]({{< relref "/ChapterFour/0454.4Sum-II.md" >}})| Medium | O(n^2)| O(n) ||
+|710. Random Pick with Blacklist | [Go]({{< relref "/ChapterFour/0710.Random-Pick-with-Blacklist.md" >}})| Hard | O(n)| O(n) ||
\ No newline at end of file
diff --git a/ctl/meta/Bit_Manipulation b/ctl/meta/Bit_Manipulation
new file mode 100644
index 000000000..5043dbf04
--- /dev/null
+++ b/ctl/meta/Bit_Manipulation
@@ -0,0 +1,29 @@
+|78. Subsets | [Go]({{< relref "/ChapterFour/0078.Subsets.md" >}})| Medium | O(n^2)| O(n)|❤️|
+|136. Single Number | [Go]({{< relref "/ChapterFour/0136.Single-Number.md" >}})| Easy | O(n)| O(1)||
+|137. Single Number II | [Go]({{< relref "/ChapterFour/0137.Single-Number-II.md" >}})| Medium | O(n)| O(1)|❤️|
+|169. Majority Element | [Go]({{< relref "/ChapterFour/0169.Majority-Element.md" >}})| Easy | O(n)| O(1)|❤️|
+|187. Repeated DNA Sequences | [Go]({{< relref "/ChapterFour/0187.Repeated-DNA-Sequences.md" >}})| Medium | O(n)| O(1)||
+|190. Reverse Bits | [Go]({{< relref "/ChapterFour/0190.Reverse-Bits.md" >}})| Easy | O(n)| O(1)|❤️|
+|191. Number of 1 Bits | [Go]({{< relref "/ChapterFour/0191.Number-of-1-Bits.md" >}})| Easy | O(n)| O(1)||
+|201. Bitwise AND of Numbers Range | [Go]({{< relref "/ChapterFour/0201.Bitwise-AND-of-Numbers-Range.md" >}})| Medium | O(n)| O(1)|❤️|
+|231. Power of Two | [Go]({{< relref "/ChapterFour/0231.Power-of-Two.md" >}})| Easy | O(1)| O(1)||
+|260. Single Number III | [Go]({{< relref "/ChapterFour/0260.Single-Number-III.md" >}})| Medium | O(n)| O(1)|❤️|
+|268. Missing Number | [Go]({{< relref "/ChapterFour/0268.Missing-Number.md" >}})| Easy | O(n)| O(1)||
+|318. Maximum Product of Word Lengths | [Go]({{< relref "/ChapterFour/0318.Maximum-Product-of-Word-Lengths.md" >}})| Medium | O(n)| O(1)||
+|338. Counting Bits | [Go]({{< relref "/ChapterFour/0338.Counting-Bits.md" >}})| Medium | O(n)| O(n)||
+|342. Power of Four | [Go]({{< relref "/ChapterFour/0342.Power-of-Four.md" >}})| Easy | O(n)| O(1)||
+|371. Sum of Two Integers | [Go]({{< relref "/ChapterFour/0371.Sum-of-Two-Integers.md" >}})| Easy | O(n)| O(1)||
+|389. Find the Difference | [Go]({{< relref "/ChapterFour/0389.Find-the-Difference.md" >}})| Easy | O(n)| O(1)||
+|393. UTF-8 Validation | [Go]({{< relref "/ChapterFour/0393.UTF-8-Validation.md" >}})| Medium | O(n)| O(1)||
+|397. Integer Replacement | [Go]({{< relref "/ChapterFour/0397.Integer-Replacement.md" >}})| Medium | O(n)| O(1)||
+|401. Binary Watch | [Go]({{< relref "/ChapterFour/0401.Binary-Watch.md" >}})| Easy | O(1)| O(1)||
+|405. Convert a Number to Hexadecimal | [Go]({{< relref "/ChapterFour/0405.Convert-a-Number-to-Hexadecimal.md" >}})| Easy | O(n)| O(1)||
+|421. Maximum XOR of Two Numbers in an Array | [Go]({{< relref "/ChapterFour/0421.Maximum-XOR-of-Two-Numbers-in-an-Array.md" >}})| Medium | O(n)| O(1)|❤️|
+|461. Hamming Distance | [Go]({{< relref "/ChapterFour/0461.Hamming-Distance.md" >}})| Easy | O(n)| O(1)||
+|476. Number Complement | [Go]({{< relref "/ChapterFour/0476.Number-Complement.md" >}})| Easy | O(n)| O(1)||
+|477. Total Hamming Distance | [Go]({{< relref "/ChapterFour/0477.Total-Hamming-Distance.md" >}})| Medium | O(n)| O(1)||
+|693. Binary Number with Alternating Bits | [Go]({{< relref "/ChapterFour/0693.Binary-Number-with-Alternating-Bits.md" >}})| Easy | O(n)| O(1)|❤️|
+|756. Pyramid Transition Matrix | [Go]({{< relref "/ChapterFour/0756.Pyramid-Transition-Matrix.md" >}})| Medium | O(n log n)| O(n)||
+|762. Prime Number of Set Bits in Binary Representation | [Go]({{< relref "/ChapterFour/0762.Prime-Number-of-Set-Bits-in-Binary-Representation.md" >}})| Easy | O(n)| O(1)||
+|784. Letter Case Permutation | [Go]({{< relref "/ChapterFour/0784.Letter-Case-Permutation.md" >}})| Easy | O(n)| O(1)||
+|898. Bitwise ORs of Subarrays | [Go]({{< relref "/ChapterFour/0898.Bitwise-ORs-of-Subarrays.md" >}})| Medium | O(n)| O(1)||
\ No newline at end of file
diff --git a/ctl/meta/Breadth_First_Search b/ctl/meta/Breadth_First_Search
new file mode 100644
index 000000000..4eb99cfe7
--- /dev/null
+++ b/ctl/meta/Breadth_First_Search
@@ -0,0 +1,14 @@
+|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)||
+|107. Binary Tree Level Order Traversal II | [Go]({{< relref "/ChapterFour/0107.Binary-Tree-Level-Order-Traversal-II.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)||
+|126. Word Ladder II | [Go]({{< relref "/ChapterFour/0126.Word-Ladder-II.md" >}})| Hard | O(n)| O(n^2)|❤️|
+|127. Word Ladder | [Go]({{< relref "/ChapterFour/0127.Word-Ladder.md" >}})| Medium | O(n)| O(n)||
+|199. Binary Tree Right Side View | [Go]({{< relref "/ChapterFour/0199.Binary-Tree-Right-Side-View.md" >}})| Medium | O(n)| O(1)||
+|200. Number of Islands | [Go]({{< relref "/ChapterFour/0200.Number-of-Islands.md" >}})| Medium | O(n^2)| O(n^2)||
+|207. Course Schedule | [Go]({{< relref "/ChapterFour/0207.Course-Schedule.md" >}})| Medium | O(n^2)| O(n^2)||
+|210. Course Schedule II | [Go]({{< relref "/ChapterFour/0210.Course-Schedule-II.md" >}})| Medium | O(n^2)| O(n^2)||
+|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)||
+|542. 01 Matrix | [Go]({{< relref "/ChapterFour/0542.01-Matrix.md" >}})| Medium | O(n)| O(1)||
+|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/Depth_First_Search b/ctl/meta/Depth_First_Search
new file mode 100644
index 000000000..9bf247b18
--- /dev/null
+++ b/ctl/meta/Depth_First_Search
@@ -0,0 +1,23 @@
+|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)||
+|104. Maximum Depth of Binary Tree | [Go]({{< relref "/ChapterFour/0104.Maximum-Depth-of-Binary-Tree.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)||
+|109. Convert Sorted List to Binary Search Tree | [Go]({{< relref "/ChapterFour/0109.Convert-Sorted-List-to-Binary-Search-Tree.md" >}})| Medium | O(log n)| O(n)||
+|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)||
+|199. Binary Tree Right Side View | [Go]({{< relref "/ChapterFour/0199.Binary-Tree-Right-Side-View.md" >}})| Medium | O(n)| O(1)||
+|200. Number of Islands | [Go]({{< relref "/ChapterFour/0200.Number-of-Islands.md" >}})| Medium | O(n^2)| O(n^2)||
+|207. Course Schedule | [Go]({{< relref "/ChapterFour/0207.Course-Schedule.md" >}})| Medium | O(n^2)| O(n^2)||
+|210. Course Schedule II | [Go]({{< relref "/ChapterFour/0210.Course-Schedule-II.md" >}})| Medium | O(n^2)| O(n^2)||
+|257. Binary Tree Paths | [Go]({{< relref "/ChapterFour/0257.Binary-Tree-Paths.md" >}})| Easy | O(n)| O(1)||
+|394. Decode String | [Go]({{< relref "/ChapterFour/0394.Decode-String.md" >}})| Medium | O(n)| O(n)||
+|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)||
+|542. 01 Matrix | [Go]({{< relref "/ChapterFour/0542.01-Matrix.md" >}})| Medium | O(n)| O(1)||
+|980. Unique Paths III | [Go]({{< relref "/ChapterFour/0980.Unique-Paths-III.md" >}})| Hard | O(n log n)| O(n)||
\ No newline at end of file
diff --git a/ctl/meta/Dynamic_Programming b/ctl/meta/Dynamic_Programming
new file mode 100644
index 000000000..0f937f916
--- /dev/null
+++ b/ctl/meta/Dynamic_Programming
@@ -0,0 +1,26 @@
+|53. Maximum Subarray| [Go]({{< relref "/ChapterFour/0053.Maximum-Subarray.md" >}})| Easy | O(n)| O(n)||
+|62. Unique Paths | [Go]({{< relref "/ChapterFour/0062.Unique-Paths.md" >}})| Medium | O(n^2)| O(n^2)||
+|63. Unique Paths II | [Go]({{< relref "/ChapterFour/0063.Unique-Paths-II.md" >}})| Medium | O(n^2)| O(n^2)||
+|64. Minimum Path Sum | [Go]({{< relref "/ChapterFour/0064.Minimum-Path-Sum.md" >}})| Medium | O(n^2)| O(n^2)||
+|70. Climbing Stairs | [Go]({{< relref "/ChapterFour/0070.Climbing-Stairs.md" >}})| Easy | O(n)| O(n)||
+|91. Decode Ways | [Go]({{< relref "/ChapterFour/0091.Decode-Ways.md" >}})| Medium | O(n)| O(n)||
+|96. Unique Binary Search Trees | [Go]({{< relref "/ChapterFour/0096.Unique-Binary-Search-Trees.md" >}})| Medium | O(n)| O(n)||
+|120. Triangle | [Go]({{< relref "/ChapterFour/0120.Triangle.md" >}})| Medium | O(n^2)| O(n)||
+|121. Best Time to Buy and Sell Stock | [Go]({{< relref "/ChapterFour/0121.Best-Time-to-Buy-and-Sell-Stock.md" >}})| Easy | O(n)| O(1)||
+|152. Maximum Product Subarray | [Go]({{< relref "/ChapterFour/0152.Maximum-Product-Subarray.md" >}})| Medium | O(n)| O(1)||
+|198. House Robber | [Go]({{< relref "/ChapterFour/0198.House-Robber.md" >}})| Easy | O(n)| O(n)||
+|213. House Robber II | [Go]({{< relref "/ChapterFour/0213.House-Robber-II.md" >}})| Medium | O(n)| O(n)||
+|300. Longest Increasing Subsequence | [Go]({{< relref "/ChapterFour/0300.Longest-Increasing-Subsequence.md" >}})| Medium | O(n log n)| O(n)||
+|309. Best Time to Buy and Sell Stock with Cooldown | [Go]({{< relref "/ChapterFour/0309.Best-Time-to-Buy-and-Sell-Stock-with-Cooldown.md" >}})| Medium | O(n)| O(n)||
+|322. Coin Change | [Go]({{< relref "/ChapterFour/0322.Coin-Change.md" >}})| Medium | O(n)| O(n)||
+|338. Counting Bits | [Go]({{< relref "/ChapterFour/0338.Counting-Bits.md" >}})| Medium | O(n)| O(n)||
+|343. Integer Break | [Go]({{< relref "/ChapterFour/0343.Integer-Break.md" >}})| Medium | O(n^2)| O(n)||
+|357. Count Numbers with Unique Digits | [Go]({{< relref "/ChapterFour/0357.Count-Numbers-with-Unique-Digits.md" >}})| Medium | O(1)| O(1)||
+|392. Is Subsequence | [Go]({{< relref "/ChapterFour/0392.Is-Subsequence.md" >}})| Medium | O(n)| O(1)||
+|416. Partition Equal Subset Sum | [Go]({{< relref "/ChapterFour/0416.Partition-Equal-Subset-Sum.md" >}})| Medium | O(n^2)| O(n)||
+|714. Best Time to Buy and Sell Stock with Transaction Fee | [Go]({{< relref "/ChapterFour/0714.Best-Time-to-Buy-and-Sell-Stock-with-Transaction-Fee.md" >}})| Medium | O(n)| O(1)||
+|746. Min Cost Climbing Stairs | [Go]({{< relref "/ChapterFour/0746.Min-Cost-Climbing-Stairs.md" >}})| Easy | O(n)| O(1)||
+|838. Push Dominoes | [Go]({{< relref "/ChapterFour/0838.Push-Dominoes.md" >}})| Medium | O(n)| O(n)||
+|1025. Divisor Game | [Go]({{< relref "/ChapterFour/1025.Divisor-Game.md" >}})| Easy | O(1)| O(1)||
+|891. Sum of Subsequence Widths | [Go]({{< relref "/ChapterFour/0891.Sum-of-Subsequence-Widths.md" >}})| Hard | O(n log n)| O(1)||
+|942. DI String Match | [Go]({{< relref "/ChapterFour/0942.DI-String-Match.md" >}})| Easy | O(n)| O(1)||
\ No newline at end of file
diff --git a/ctl/meta/Hash_Table b/ctl/meta/Hash_Table
new file mode 100644
index 000000000..56a6bde09
--- /dev/null
+++ b/ctl/meta/Hash_Table
@@ -0,0 +1,33 @@
+|1. Two Sum | [Go]({{< relref "/ChapterFour/0001.Two-Sum.md" >}})| Easy | O(n)| O(n)||
+|3. Longest Substring Without Repeating Characters | [Go]({{< relref "/ChapterFour/0003.Longest-Substring-Without-Repeating-Characters.md" >}})| Medium | O(n)| O(1)|❤️|
+|18. 4Sum | [Go]({{< relref "/ChapterFour/0018.4Sum.md" >}})| Medium | O(n^3)| O(n^2)|❤️|
+|30. Substring with Concatenation of All Words | [Go]({{< relref "/ChapterFour/0030.Substring-with-Concatenation-of-All-Words.md" >}})| Hard | O(n)| O(n)|❤️|
+|36. Valid Sudoku | [Go]({{< relref "/ChapterFour/0036.Valid-Sudoku.md" >}})| Medium | O(n^2)| O(n^2)||
+|37. Sudoku Solver | [Go]({{< relref "/ChapterFour/0037.Sudoku-Solver.md" >}})| Hard | O(n^2)| O(n^2)|❤️|
+|49. Group Anagrams | [Go]({{< relref "/ChapterFour/0049.Group-Anagrams.md" >}})| Medium | O(n log n)| O(n)||
+|76. Minimum Window Substring | [Go]({{< relref "/ChapterFour/0076.Minimum-Window-Substring.md" >}})| Hard | O(n)| O(n)|❤️|
+|94. Binary Tree Inorder Traversal | [Go]({{< relref "/ChapterFour/0094.Binary-Tree-Inorder-Traversal.md" >}})| Medium | O(n)| O(1)||
+|138. Copy List with Random Pointer | [Go]()| Medium | O(n)| O(1)||
+|202. Happy Number | [Go]({{< relref "/ChapterFour/0202.Happy-Number.md" >}})| Easy | O(log n)| O(1)||
+|205. Isomorphic Strings | [Go]({{< relref "/ChapterFour/0205.Isomorphic-Strings.md" >}})| Easy | O(log n)| O(n)||
+|217. Contains Duplicate | [Go]({{< relref "/ChapterFour/0217.Contains-Duplicate.md" >}})| Easy | O(n)| O(n)||
+|219. Contains Duplicate II | [Go]({{< relref "/ChapterFour/0219.Contains-Duplicate-II.md" >}})| Easy | O(n)| O(n)||
+|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) ||
+|290. Word Pattern | [Go]({{< relref "/ChapterFour/0290.Word-Pattern.md" >}})| Easy | O(n)| O(n) ||
+|347. Top K Frequent Elements | [Go]({{< relref "/ChapterFour/0347.Top-K-Frequent-Elements.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) ||
+|438. Find All Anagrams in a String | [Go]({{< relref "/ChapterFour/0438.Find-All-Anagrams-in-a-String.md" >}})| Easy | O(n)| O(1) ||
+|447. Number of Boomerangs | [Go]({{< relref "/ChapterFour/0447.Number-of-Boomerangs.md" >}})| Easy | O(n)| O(1) ||
+|451. Sort Characters By Frequency | [Go]({{< relref "/ChapterFour/0451.Sort-Characters-By-Frequency.md" >}})| Medium | O(n log n)| O(1) ||
+|454. 4Sum II | [Go]({{< relref "/ChapterFour/0454.4Sum-II.md" >}})| Medium | O(n^2)| O(n) ||
+|648. Replace Words | [Go]({{< relref "/ChapterFour/0648.Replace-Words.md" >}})| Medium | O(n)| O(n) ||
+|676. Implement Magic Dictionary | [Go]({{< relref "/ChapterFour/0676.Implement-Magic-Dictionary.md" >}})| Medium | O(n)| O(n) ||
+|720. Longest Word in Dictionary | [Go]({{< relref "/ChapterFour/0720.Longest-Word-in-Dictionary.md" >}})| Easy | O(n)| O(n) ||
+|726. Number of Atoms | [Go]({{< relref "/ChapterFour/0726.Number-of-Atoms.md" >}})| Hard | O(n)| O(n) |❤️|
+|739. Daily Temperatures | [Go]({{< relref "/ChapterFour/0739.Daily-Temperatures.md" >}})| Medium | O(n)| O(n) ||
+|710. Random Pick with Blacklist | [Go]({{< relref "/ChapterFour/0710.Random-Pick-with-Blacklist.md" >}})| Hard | O(n)| O(n) ||
+|895. Maximum Frequency Stack | [Go]({{< relref "/ChapterFour/0895.Maximum-Frequency-Stack.md" >}})| Hard | O(n)| O(n) ||
+|930. Binary Subarrays With Sum | [Go]({{< relref "/ChapterFour/0930.Binary-Subarrays-With-Sum.md" >}})| Medium | O(n)| O(n) |❤️|
+|992. Subarrays with K Different Integers | [Go]({{< relref "/ChapterFour/0992.Subarrays-with-K-Different-Integers.md" >}})| Hard | O(n)| O(n) |❤️|
\ No newline at end of file
diff --git a/ctl/meta/Linked_List b/ctl/meta/Linked_List
new file mode 100644
index 000000000..326edc579
--- /dev/null
+++ b/ctl/meta/Linked_List
@@ -0,0 +1,29 @@
+|2. Add Two Numbers | [Go]({{< relref "/ChapterFour/0002.Add-Two-Numbers.md" >}})| Medium | O(n)| O(1)||
+|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)||
+|21. Merge Two Sorted Lists | [Go]({{< relref "/ChapterFour/0021.Merge-Two-Sorted-Lists.md" >}})| Easy | O(log n)| O(1)||
+|23. Merge k Sorted Lists| [Go]({{< relref "/ChapterFour/0023.Merge-k-Sorted-Lists.md" >}})| Hard | O(log n)| O(1)|❤️|
+|24. Swap Nodes in Pairs | [Go]({{< relref "/ChapterFour/0024.Swap-Nodes-in-Pairs.md" >}})| Medium | O(n)| O(1)||
+|25. Reverse Nodes in k-Group | [Go]({{< relref "/ChapterFour/0025.Reverse-Nodes-in-k-Group.md" >}})| Hard | O(log n)| O(1)|❤️|
+|61. Rotate List | [Go]({{< relref "/ChapterFour/0061.Rotate-List.md" >}})| Medium | O(n)| O(1)||
+|82. Remove Duplicates from Sorted List II | [Go]({{< relref "/ChapterFour/0082.Remove-Duplicates-from-Sorted-List-II.md" >}})| Medium | O(n)| O(1)||
+|83. Remove Duplicates from Sorted List | [Go]({{< relref "/ChapterFour/0083.Remove-Duplicates-from-Sorted-List.md" >}})| Easy | O(n)| O(1)||
+|86. Partition List | [Go]({{< relref "/ChapterFour/0086.Partition-List.md" >}})| Medium | O(n)| O(1)|❤️|
+|92. Reverse Linked List II | [Go]({{< relref "/ChapterFour/0092.Reverse-Linked-List-II.md" >}})| Medium | O(n)| O(1)|❤️|
+|109. Convert Sorted List to Binary Search Tree | [Go]({{< relref "/ChapterFour/0109.Convert-Sorted-List-to-Binary-Search-Tree.md" >}})| Medium | O(log n)| O(n)||
+|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)|❤️|
+|143. Reorder List | [Go]({{< relref "/ChapterFour/0143.Reorder-List.md" >}})| Medium | O(n)| O(1)|❤️|
+|147. Insertion Sort List | [Go]({{< relref "/ChapterFour/0147.Insertion-Sort-List.md" >}})| Medium | O(n)| O(1)|❤️|
+|148. Sort List | [Go]({{< relref "/ChapterFour/0148.Sort-List.md" >}})| Medium | O(n log n)| O(n)|❤️|
+|160. Intersection of Two Linked Lists | [Go]({{< relref "/ChapterFour/0160.Intersection-of-Two-Linked-Lists.md" >}})| Easy | O(n)| O(1)|❤️|
+|203. Remove Linked List Elements | [Go]({{< relref "/ChapterFour/0203.Remove-Linked-List-Elements.md" >}})| Easy | O(n)| O(1)||
+|206. Reverse Linked List | [Go]({{< relref "/ChapterFour/0206.Reverse-Linked-List.md" >}})| Easy | O(n)| O(1)||
+|234. Palindrome Linked List | [Go]({{< relref "/ChapterFour/0234.Palindrome-Linked-List.md" >}})| Easy | O(n)| O(1)||
+|237. Delete Node in a Linked List | [Go]({{< relref "/ChapterFour/0237.Delete-Node-in-a-Linked-List.md" >}})| Easy | O(n)| O(1)||
+|328. Odd Even Linked List | [Go]({{< relref "/ChapterFour/0328.Odd-Even-Linked-List.md" >}})| Medium | O(n)| O(1)||
+|445. Add Two Numbers II | [Go]({{< relref "/ChapterFour/0445.Add-Two-Numbers-II.md" >}})| Medium | O(n)| O(n)||
+|725. Split Linked List in Parts | [Go]({{< relref "/ChapterFour/0725.Split-Linked-List-in-Parts.md" >}})| Medium | O(n)| O(1)||
+|817. Linked List Components | [Go]({{< relref "/ChapterFour/0817.Linked-List-Components.md" >}})| Medium | O(n)| O(1)||
+|707. Design Linked List | [Go]({{< relref "/ChapterFour/0707.Design-Linked-List.md" >}})| Easy | O(n)| O(1)||
+|876. Middle of the Linked List | [Go]({{< relref "/ChapterFour/0876.Middle-of-the-Linked-List.md" >}})| Easy | 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)||
\ No newline at end of file
diff --git a/ctl/meta/Math b/ctl/meta/Math
new file mode 100644
index 000000000..e78509551
--- /dev/null
+++ b/ctl/meta/Math
@@ -0,0 +1,18 @@
+|2. Add Two Numbers | [Go]({{< relref "/ChapterFour/0002.Add-Two-Numbers.md" >}})| Medium | O(n)| O(1)||
+|50. Pow(x, n) | [Go]({{< relref "/ChapterFour/0050.Powx-n.md" >}})| Medium | O(log n)| O(1)||
+|60. Permutation Sequence | [Go]({{< relref "/ChapterFour/0060.Permutation-Sequence.md" >}})| Medium | O(n log n)| O(1)||
+|69. Sqrt(x) | [Go]({{< relref "/ChapterFour/0069.Sqrtx.md" >}})| Easy | O(log n)| O(1)||
+|202. Happy Number | [Go]({{< relref "/ChapterFour/0202.Happy-Number.md" >}})| Easy | O(log n)| O(1)||
+|224. Basic Calculator | [Go]({{< relref "/ChapterFour/0224.Basic-Calculator.md" >}})| Hard | O(n)| O(n)||
+|231. Power of Two | [Go]({{< relref "/ChapterFour/0231.Power-of-Two.md" >}})| Easy | O(1)| O(1)||
+|263. Ugly Number | [Go]({{< relref "/ChapterFour/0263.Ugly-Number.md" >}})| Easy | O(log n)| O(1)||
+|326. Power of Three | [Go]({{< relref "/ChapterFour/0326.Power-of-Three.md" >}})| Easy | O(1)| O(1)||
+|343. Integer Break | [Go]({{< relref "/ChapterFour/0343.Integer-Break.md" >}})| Medium | O(n^2)| O(n)||
+|357. Count Numbers with Unique Digits | [Go]({{< relref "/ChapterFour/0357.Count-Numbers-with-Unique-Digits.md" >}})| Medium | O(1)| O(1)||
+|628. Maximum Product of Three Numbers | [Go]({{< relref "/ChapterFour/0628.Maximum-Product-of-Three-Numbers.md" >}})| Easy | O(n)| O(1)||
+|885. Spiral Matrix III | [Go]({{< relref "/ChapterFour/0885.Spiral-Matrix-III.md" >}})| Medium | O(n^2)| O(1)||
+|891. Sum of Subsequence Widths | [Go]({{< relref "/ChapterFour/0891.Sum-of-Subsequence-Widths.md" >}})| Hard | O(n log n)| O(1)||
+|942. DI String Match | [Go]({{< relref "/ChapterFour/0942.DI-String-Match.md" >}})| Easy | O(n)| O(1)||
+|976. Largest Perimeter Triangle | [Go]({{< relref "/ChapterFour/0976.Largest-Perimeter-Triangle.md" >}})| Easy | O(n log n)| O(log n) ||
+|996. Number of Squareful Arrays | [Go]({{< relref "/ChapterFour/0996.Number-of-Squareful-Arrays.md" >}})| Hard | O(n log n)| O(n) ||
+|1025. Divisor Game | [Go]({{< relref "/ChapterFour/1025.Divisor-Game.md" >}})| Easy | O(1)| O(1)||
\ No newline at end of file
diff --git a/ctl/meta/PDFPreface b/ctl/meta/PDFPreface
new file mode 100644
index 000000000..465400d8a
--- /dev/null
+++ b/ctl/meta/PDFPreface
@@ -0,0 +1,12 @@
+<img src="https://books.halfrost.com/leetcode/logo.png" alt="logo" heigth="1300px" align="center"/>
+
+
+# 说明
+
+此版本是 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 = "<img src=\"https://books.halfrost.com/leetcode/logo.png\" alt=\"logo\" height=\"600\" align=\"right\" style=\"padding-left: 30px;\"/>"
+ pdfPreface = `<img src="https://books.halfrost.com/leetcode/logo.png" alt="logo" heigth="1300px" align="center"/>
+
+
+# 说明
+
+此版本是 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 <subcommand>",
+ Short: "Build doc related commands",
+ }
+ //mc.PersistentFlags().StringVar(&logicEndpoint, "endpoint", "localhost:5880", "endpoint of logic service")
+ mc.AddCommand(
+ newBuildREADME(),
+ newBuildChapterTwo(),
+ // newBuildMenu(),
+ )
+ return mc
+}
+
+func newBuildREADME() *cobra.Command {
+ cmd := &cobra.Command{
+ Use: "readme",
+ Short: "Build readme.md commands",
+ Run: func(cmd *cobra.Command, args []string) {
+ buildREADME()
+ },
+ }
+ // cmd.Flags().StringVar(&alias, "alias", "", "alias")
+ // cmd.Flags().StringVar(&appId, "appid", "", "appid")
+ return cmd
+}
+
+func newBuildChapterTwo() *cobra.Command {
+ cmd := &cobra.Command{
+ Use: "chapter-two",
+ Short: "Build Chapter Two commands",
+ Run: func(cmd *cobra.Command, args []string) {
+ buildChapterTwo(true)
+ },
+ }
+ // cmd.Flags().StringVar(&alias, "alias", "", "alias")
+ // cmd.Flags().StringVar(&appId, "appid", "", "appid")
+ return cmd
+}
+
+func newBuildMenu() *cobra.Command {
+ cmd := &cobra.Command{
+ Use: "menu",
+ Short: "Build Menu commands",
+ Run: func(cmd *cobra.Command, args []string) {
+ buildBookMenu()
+ },
+ }
+ // cmd.Flags().StringVar(&alias, "alias", "", "alias")
+ // cmd.Flags().StringVar(&appId, "appid", "", "appid")
+ return cmd
+}
+
+func buildREADME() {
+ var (
+ problems []m.StatStatusPairs
+ lpa m.LeetCodeProblemAll
+ info m.UserInfo
+ )
+ // 请求所有题目信息
+ body := getProblemAllList()
+ problemsMap, optimizingIds := map[int]m.StatStatusPairs{}, []int{}
+ err := json.Unmarshal(body, &lpa)
+ if err != nil {
+ fmt.Println(err)
+ return
+ }
+ //writeFile("leetcode_problem.json", body)
+
+ // 拼凑 README 需要渲染的数据
+ problems = lpa.StatStatusPairs
+ info = m.ConvertUserInfoModel(lpa)
+ for _, v := range problems {
+ problemsMap[int(v.Stat.FrontendQuestionID)] = v
+ }
+ mdrows := m.ConvertMdModelFromSsp(problems)
+ sort.Sort(m.SortByQuestionID(mdrows))
+ solutionIds, _, try := util.LoadSolutionsDir()
+ m.GenerateMdRows(solutionIds, mdrows)
+ info.EasyTotal, info.MediumTotal, info.HardTotal, info.OptimizingEasy, info.OptimizingMedium, info.OptimizingHard, optimizingIds = statisticalData(problemsMap, solutionIds)
+ omdrows := m.ConvertMdModelFromIds(problemsMap, optimizingIds)
+ sort.Sort(m.SortByQuestionID(omdrows))
+
+ // 按照模板渲染 README
+ res, err := renderReadme("./template/template.markdown", len(solutionIds), try, m.Mdrows{Mdrows: mdrows}, m.Mdrows{Mdrows: omdrows}, info)
+ if err != nil {
+ fmt.Println(err)
+ return
+ }
+ util.WriteFile("../README.md", res)
+ fmt.Println("write file successful")
+ //makeReadmeFile(mds)
+}
+
+func renderReadme(filePath string, total, try int, mdrows, omdrows m.Mdrows, user m.UserInfo) ([]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("{{.AvailableTable}}", line); ok {
+ reg := regexp.MustCompile("{{.AvailableTable}}")
+ newByte := reg.ReplaceAll(line, []byte(mdrows.AvailableTable()))
+ output = append(output, newByte...)
+ output = append(output, []byte("\n")...)
+ } else if ok, _ := regexp.Match("{{.TotalNum}}", line); ok {
+ reg := regexp.MustCompile("{{.TotalNum}}")
+ newByte := reg.ReplaceAll(line, []byte(fmt.Sprintf("以下已经收录了 %v 道题的题解，还有 %v 道题在尝试优化到 beats 100%%", total, try)))
+ output = append(output, newByte...)
+ output = append(output, []byte("\n")...)
+ } else if ok, _ := regexp.Match("{{.PersonalData}}", line); ok {
+ reg := regexp.MustCompile("{{.PersonalData}}")
+ newByte := reg.ReplaceAll(line, []byte(user.PersonalData()))
+ output = append(output, newByte...)
+ output = append(output, []byte("\n")...)
+ } else if ok, _ := regexp.Match("{{.OptimizingTable}}", line); ok {
+ reg := regexp.MustCompile("{{.OptimizingTable}}")
+ newByte := reg.ReplaceAll(line, []byte(fmt.Sprintf("以下 %v 道题还需要优化到 100%% 的题目列表\n\n%v", (user.OptimizingEasy+user.OptimizingMedium+user.OptimizingHard), omdrows.AvailableTable())))
+ output = append(output, newByte...)
+ output = append(output, []byte("\n")...)
+ } else {
+ output = append(output, line...)
+ output = append(output, []byte("\n")...)
+ }
+ }
+}
+
+// internal: true 渲染的链接都是 hugo 内部链接，用户生成 hugo web
+//
+// false 渲染的链接是外部 HTTPS 链接，用于生成 PDF
+func buildChapterTwo(internal bool) {
+ var (
+ gr m.GraphQLResp
+ questions []m.Question
+ count int
+ )
+ for index, tag := range chapterTwoSlug {
+ body := getTagProblemList(tag)
+ // fmt.Printf("%v\n", string(body))
+ err := json.Unmarshal(body, &gr)
+ if err != nil {
+ fmt.Println(err)
+ return
+ }
+ questions = gr.Data.TopicTag.Questions
+ mdrows := m.ConvertMdModelFromQuestions(questions)
+ sort.Sort(m.SortByQuestionID(mdrows))
+ solutionIds, _, _ := util.LoadSolutionsDir()
+ tl, err := loadMetaData(fmt.Sprintf("./meta/%v", chapterTwoFileName[index]))
+ if err != nil {
+ fmt.Printf("err = %v\n", err)
+ }
+ tls := m.GenerateTagMdRows(solutionIds, tl, mdrows, internal)
+ //fmt.Printf("tls = %v\n", tls)
+ // 按照模板渲染 README
+ res, err := renderChapterTwo(fmt.Sprintf("./template/%v.md", chapterTwoFileName[index]), m.TagLists{TagLists: tls})
+ if err != nil {
+ fmt.Println(err)
+ return
+ }
+ if internal {
+ util.WriteFile(fmt.Sprintf("../website/content/ChapterTwo/%v.md", chapterTwoFileName[index]), res)
+ } else {
+ util.WriteFile(fmt.Sprintf("./pdftemp/ChapterTwo/%v.md", chapterTwoFileName[index]), res)
+ }
+
+ count++
+ }
+ fmt.Printf("write %v files successful", count)
+}
+
+func loadMetaData(filePath string) (map[int]m.TagList, error) {
+ f, err := os.OpenFile(filePath, os.O_RDONLY, 0644)
+ if err != nil {
+ return nil, err
+ }
+ defer f.Close()
+ reader, metaMap := bufio.NewReader(f), map[int]m.TagList{}
+
+ for {
+ line, _, err := reader.ReadLine()
+ if err != nil {
+ if err == io.EOF {
+ return metaMap, nil
+ }
+ return nil, err
+ }
+ s := strings.Split(string(line), "|")
+ v, _ := strconv.Atoi(strings.Split(s[1], ".")[0])
+ // v[0] 是题号，s[4] time, s[5] space, s[6] favorite
+ metaMap[v] = m.TagList{
+ FrontendQuestionID: int32(v),
+ Acceptance: "",
+ Difficulty: "",
+ TimeComplexity: s[4],
+ SpaceComplexity: s[5],
+ Favorite: s[6],
+ }
+ }
+}
+
+func renderChapterTwo(filePath string, tls m.TagLists) ([]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("{{.AvailableTagTable}}", line); ok {
+ reg := regexp.MustCompile("{{.AvailableTagTable}}")
+ newByte := reg.ReplaceAll(line, []byte(tls.AvailableTagTable()))
+ output = append(output, newByte...)
+ output = append(output, []byte("\n")...)
+ } else {
+ output = append(output, line...)
+ output = append(output, []byte("\n")...)
+ }
+ }
+}
+
+func buildBookMenu() {
+ copyLackFile()
+ // 按照模板重新渲染 Menu
+ res, err := renderBookMenu("./template/menu.md")
+ if err != nil {
+ fmt.Println(err)
+ return
+ }
+ util.WriteFile("../website/content/menu/index.md", res)
+ fmt.Println("generate Menu successful")
+}
+
+// 拷贝 leetcode 目录下的题解 README 文件至第四章对应文件夹中
+func copyLackFile() {
+ solutionIds, soName, _ := util.LoadSolutionsDir()
+ _, ch4Ids := util.LoadChapterFourDir()
+
+ needCopy := []string{}
+ for i := 0; i < len(solutionIds); i++ {
+ if util.BinarySearch(ch4Ids, solutionIds[i]) == -1 {
+ needCopy = append(needCopy, soName[i])
+ }
+ }
+ if len(needCopy) > 0 {
+ fmt.Printf("有 %v 道题需要拷贝到第四章中\n", len(needCopy))
+ for i := 0; i < len(needCopy); i++ {
+ if needCopy[i][4] == '.' {
+ tmp, err := strconv.Atoi(needCopy[i][:4])
+ if err != nil {
+ fmt.Println(err)
+ }
+ err = os.MkdirAll(fmt.Sprintf("../website/content/ChapterFour/%v", util.GetChpaterFourFileNum(tmp)), os.ModePerm)
+ if err != nil {
+ fmt.Println(err)
+ }
+ util.CopyFile(fmt.Sprintf("../website/content/ChapterFour/%v/%v.md", util.GetChpaterFourFileNum(tmp), needCopy[i]), fmt.Sprintf("../leetcode/%v/README.md", needCopy[i]))
+ util.CopyFile(fmt.Sprintf("../website/content/ChapterFour/%v/_index.md", util.GetChpaterFourFileNum(tmp)), "./template/collapseSection.md")
+ }
+ }
+ } else {
+ fmt.Printf("【第四章没有需要添加的题解，已经完整了】\n")
+ }
+}
+
+func generateMenu() string {
+ res := ""
+ res += menuLine(chapterOneMenuOrder, "ChapterOne")
+ res += menuLine(chapterTwoFileOrder, "ChapterTwo")
+ res += menuLine(chapterThreeFileOrder, "ChapterThree")
+ chapterFourFileOrder, _ := getChapterFourFileOrder()
+ res += menuLine(chapterFourFileOrder, "ChapterFour")
+ return res
+}
+
+func menuLine(order []string, chapter string) string {
+ res := ""
+ for i := 0; i < len(order); i++ {
+ if i == 1 && chapter == "ChapterOne" {
+ res += fmt.Sprintf(" - [%v]({{< relref \"/%v/%v\" >}})\n", chapterMap[chapter][order[i]], chapter, order[i])
+ continue
+ }
+ if i == 0 {
+ res += fmt.Sprintf("- [%v]({{< relref \"/%v/%v.md\" >}})\n", chapterMap[chapter][order[i]], chapter, order[i])
+ } else {
+ if chapter == "ChapterFour" {
+ res += fmt.Sprintf(" - [%v]({{< relref \"/%v/%v.md\" >}})\n", order[i], chapter, order[i])
+ } else {
+ res += fmt.Sprintf(" - [%v]({{< relref \"/%v/%v.md\" >}})\n", chapterMap[chapter][order[i]], chapter, order[i])
+ }
+ }
+ }
+ return res
+}
+
+func renderBookMenu(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("{{.BookMenu}}", line); ok {
+ reg := regexp.MustCompile("{{.BookMenu}}")
+ newByte := reg.ReplaceAll(line, []byte(generateMenu()))
+ output = append(output, newByte...)
+ output = append(output, []byte("\n")...)
+ } else {
+ output = append(output, line...)
+ output = append(output, []byte("\n")...)
+ }
+ }
+}
diff --git a/ctl/request.go b/ctl/request.go
new file mode 100644
index 000000000..8222a1fc0
--- /dev/null
+++ b/ctl/request.go
@@ -0,0 +1,110 @@
+package main
+
+import (
+ "bytes"
+ "fmt"
+ "io/ioutil"
+ "net/http"
+
+ "github.com/mozillazg/request"
+)
+
+const (
+ // AllProblemURL define
+ AllProblemURL = "https://leetcode.com/api/problems/all/"
+ // QraphqlURL define
+ QraphqlURL = "https://leetcode.com/graphql"
+ // LoginPageURL define
+ LoginPageURL = "https://leetcode.com/accounts/login/"
+ // AlgorithmsURL define
+ AlgorithmsURL = "https://leetcode.com/api/problems/Algorithms/"
+
+ // ArrayProblemURL define
+ ArrayProblemURL = "https://leetcode.com/tag/array/"
+)
+
+var req *request.Request
+
+func newReq() *request.Request {
+ if req == nil {
+ req = signin()
+ }
+ return req
+}
+
+func signin() *request.Request {
+ cfg := getConfig()
+ req := request.NewRequest(new(http.Client))
+ req.Headers = map[string]string{
+ "Content-Type": "application/json",
+ "Accept-Encoding": "",
+ "cookie": cfg.Cookie,
+ "x-csrftoken": cfg.CSRFtoken,
+ "Referer": "https://leetcode.com/accounts/login/",
+ "origin": "https://leetcode.com",
+ }
+ return req
+}
+
+func getRaw(URL string) []byte {
+ req := newReq()
+ resp, err := req.Get(URL)
+ if err != nil {
+ fmt.Printf("getRaw: Get Error: " + err.Error())
+ return []byte{}
+ }
+ defer resp.Body.Close()
+
+ body, err := ioutil.ReadAll(resp.Body)
+ if err != nil {
+ fmt.Printf("getRaw: Read Error: " + err.Error())
+ return []byte{}
+ }
+ if resp.StatusCode == 200 {
+ fmt.Println("Get problem Success!")
+ }
+ return body
+}
+
+func getProblemAllList() []byte {
+ return getRaw(AllProblemURL)
+}
+
+// Variables define
+type Variables struct {
+ slug string
+}
+
+func getQraphql(payload string) []byte {
+ req := newReq()
+ resp, err := req.PostForm(QraphqlURL, bytes.NewBuffer([]byte(payload)))
+ if err != nil {
+ fmt.Printf("getRaw: Get Error: " + err.Error())
+ return []byte{}
+ }
+ defer resp.Body.Close()
+
+ body, err := ioutil.ReadAll(resp.Body)
+ if err != nil {
+ fmt.Printf("getRaw: Read Error: " + err.Error())
+ return []byte{}
+ }
+ if resp.StatusCode == 200 {
+ fmt.Println("Get problem Success!")
+ }
+ return body
+}
+
+func getTopicTag(variable string) string {
+ return fmt.Sprintf(`{
+ "operationName": "getTopicTag",
+ "variables": {
+ "slug": "%s"
+ },
+ "query": "query getTopicTag($slug: String!) { topicTag(slug: $slug) { name translatedName slug questions { status questionId questionFrontendId title titleSlug translatedTitle stats difficulty isPaidOnly topicTags { name translatedName slug __typename } companyTags { name translatedName slug __typename } __typename } frequencies __typename } favoritesLists { publicFavorites { ...favoriteFields __typename } privateFavorites { ...favoriteFields __typename } __typename }}fragment favoriteFields on FavoriteNode { idHash id name isPublicFavorite viewCount creator isWatched questions { questionId title titleSlug __typename } __typename}"
+ }`, variable)
+}
+
+func getTagProblemList(tag string) []byte {
+ return getQraphql(getTopicTag(tag))
+}
diff --git a/ctl/statistic.go b/ctl/statistic.go
new file mode 100644
index 000000000..20b84ccb9
--- /dev/null
+++ b/ctl/statistic.go
@@ -0,0 +1,42 @@
+package main
+
+import (
+ "sort"
+
+ m "github.com/halfrost/LeetCode-Go/ctl/models"
+ "github.com/halfrost/LeetCode-Go/ctl/util"
+)
+
+func statisticalData(problemsMap map[int]m.StatStatusPairs, solutionIds []int) (easyTotal, mediumTotal, hardTotal, optimizingEasy, optimizingMedium, optimizingHard int32, optimizingIds []int) {
+ easyTotal, mediumTotal, hardTotal, optimizingEasy, optimizingMedium, optimizingHard, optimizingIds = 0, 0, 0, 0, 0, 0, []int{}
+ for _, v := range problemsMap {
+ switch m.DifficultyMap[v.Difficulty.Level] {
+ case "Easy":
+ {
+ easyTotal++
+ if v.Status == "ac" && util.BinarySearch(solutionIds, int(v.Stat.FrontendQuestionID)) == -1 {
+ optimizingEasy++
+ optimizingIds = append(optimizingIds, int(v.Stat.FrontendQuestionID))
+ }
+ }
+ case "Medium":
+ {
+ mediumTotal++
+ if v.Status == "ac" && util.BinarySearch(solutionIds, int(v.Stat.FrontendQuestionID)) == -1 {
+ optimizingMedium++
+ optimizingIds = append(optimizingIds, int(v.Stat.FrontendQuestionID))
+ }
+ }
+ case "Hard":
+ {
+ hardTotal++
+ if v.Status == "ac" && util.BinarySearch(solutionIds, int(v.Stat.FrontendQuestionID)) == -1 {
+ optimizingHard++
+ optimizingIds = append(optimizingIds, int(v.Stat.FrontendQuestionID))
+ }
+ }
+ }
+ }
+ sort.Ints(optimizingIds)
+ return easyTotal, mediumTotal, hardTotal, optimizingEasy, optimizingMedium, optimizingHard, optimizingIds
+}
diff --git a/ctl/template/Array.md b/ctl/template/Array.md
new file mode 100644
index 000000000..257fd3625
--- /dev/null
+++ b/ctl/template/Array.md
@@ -0,0 +1,9 @@
+---
+title: 2.01 Array
+type: docs
+weight: 1
+---
+
+# Array
+
+{{.AvailableTagTable}}
\ No newline at end of file
diff --git a/ctl/template/Backtracking.md b/ctl/template/Backtracking.md
new file mode 100644
index 000000000..fe1a54e6b
--- /dev/null
+++ b/ctl/template/Backtracking.md
@@ -0,0 +1,101 @@
+---
+title: 2.08 ✅ Backtracking
+type: docs
+weight: 8
+---
+
+# Backtracking
+
+
+
+- 排列问题 Permutations。第 46 题，第 47 题。第 60 题，第 526 题，第 996 题。
+- 组合问题 Combination。第 39 题，第 40 题，第 77 题，第 216 题。
+- 排列和组合杂交问题。第 1079 题。
+- N 皇后终极解法(二进制解法)。第 51 题，第 52 题。
+- 数独问题。第 37 题。
+- 四个方向搜索。第 79 题，第 212 题，第 980 题。
+- 子集合问题。第 78 题，第 90 题。
+- Trie。第 208 题，第 211 题。
+- BFS 优化。第 126 题，第 127 题。
+- DFS 模板。(只是一个例子，不对应任何题)
+
+```go
+func combinationSum2(candidates []int, target int) [][]int {
+ if len(candidates) == 0 {
+ return [][]int{}
+ }
+ c, res := []int{}, [][]int{}
+ sort.Ints(candidates)
+ findcombinationSum2(candidates, target, 0, c, &res)
+ return res
+}
+
+func findcombinationSum2(nums []int, target, index int, c []int, res *[][]int) {
+ if target == 0 {
+ b := make([]int, len(c))
+ copy(b, c)
+ *res = append(*res, b)
+ return
+ }
+ for i := index; i < len(nums); i++ {
+ if i > index && nums[i] == nums[i-1] { // 这里是去重的关键逻辑
+ continue
+ }
+ if target >= nums[i] {
+ c = append(c, nums[i])
+ findcombinationSum2(nums, target-nums[i], i+1, c, res)
+ c = c[:len(c)-1]
+ }
+ }
+}
+```
+- BFS 模板。(只是一个例子，不对应任何题)
+
+```go
+func updateMatrix_BFS(matrix [][]int) [][]int {
+ res := make([][]int, len(matrix))
+ if len(matrix) == 0 || len(matrix[0]) == 0 {
+ return res
+ }
+ queue := make([][]int, 0)
+ for i, _ := range matrix {
+ res[i] = make([]int, len(matrix[0]))
+ for j, _ := range res[i] {
+ if matrix[i][j] == 0 {
+ res[i][j] = -1
+ queue = append(queue, []int{i, j})
+ }
+ }
+ }
+ level := 1
+ for len(queue) > 0 {
+ size := len(queue)
+ for size > 0 {
+ size -= 1
+ node := queue[0]
+ queue = queue[1:]
+ i, j := node[0], node[1]
+ for _, direction := range [][]int{{-1, 0}, {1, 0}, {0, 1}, {0, -1}} {
+ x := i + direction[0]
+ y := j + direction[1]
+ if x < 0 || x >= len(matrix) || y < 0 || y >= len(matrix[0]) || res[x][y] < 0 || res[x][y] > 0 {
+ continue
+ }
+ res[x][y] = level
+ queue = append(queue, []int{x, y})
+ }
+ }
+ level++
+ }
+ for i, row := range res {
+ for j, cell := range row {
+ if cell == -1 {
+ res[i][j] = 0
+ }
+ }
+ }
+ return res
+}
+```
+
+{{.AvailableTagTable}}
\ No newline at end of file
diff --git a/ctl/template/Binary_Indexed_Tree.md b/ctl/template/Binary_Indexed_Tree.md
new file mode 100644
index 000000000..039b49ccb
--- /dev/null
+++ b/ctl/template/Binary_Indexed_Tree.md
@@ -0,0 +1,11 @@
+---
+title: 2.19 ✅ Binary Indexed Tree
+type: docs
+weight: 19
+---
+
+# Binary Indexed Tree
+
+
+
+{{.AvailableTagTable}}
\ No newline at end of file
diff --git a/ctl/template/Binary_Search.md b/ctl/template/Binary_Search.md
new file mode 100644
index 000000000..e7a5de3de
--- /dev/null
+++ b/ctl/template/Binary_Search.md
@@ -0,0 +1,132 @@
+---
+title: 2.11 Binary Search
+type: docs
+weight: 11
+---
+
+# Binary Search
+
+- 二分搜索的经典写法。需要注意的三点：
+ 1. 循环退出条件，注意是 low <= high，而不是 low < high。
+ 2. mid 的取值，mid := low + (high-low)>>1
+ 3. low 和 high 的更新。low = mid + 1，high = mid - 1。
+
+```go
+func binarySearchMatrix(nums []int, target int) int {
+ low, high := 0, len(nums)-1
+ for low <= high {
+ mid := low + (high-low)>>1
+ if nums[mid] == target {
+ return mid
+ } else if nums[mid] > target {
+ high = mid - 1
+ } else {
+ low = mid + 1
+ }
+ }
+ return -1
+}
+```
+
+- 二分搜索的变种写法。有 4 个基本变种:
+ 1. 查找第一个与 target 相等的元素，时间复杂度 O(logn)
+ 2. 查找最后一个与 target 相等的元素，时间复杂度 O(logn)
+ 3. 查找第一个大于等于 target 的元素，时间复杂度 O(logn)
+ 4. 查找最后一个小于等于 target 的元素，时间复杂度 O(logn)
+
+```go
+// 二分查找第一个与 target 相等的元素，时间复杂度 O(logn)
+func searchFirstEqualElement(nums []int, target int) int {
+ low, high := 0, len(nums)-1
+ for low <= high {
+ mid := low + ((high - low) >> 1)
+ if nums[mid] > target {
+ high = mid - 1
+ } else if nums[mid] < target {
+ low = mid + 1
+ } else {
+ if (mid == 0) || (nums[mid-1] != target) { // 找到第一个与 target 相等的元素
+ return mid
+ }
+ high = mid - 1
+ }
+ }
+ return -1
+}
+
+// 二分查找最后一个与 target 相等的元素，时间复杂度 O(logn)
+func searchLastEqualElement(nums []int, target int) int {
+ low, high := 0, len(nums)-1
+ for low <= high {
+ mid := low + ((high - low) >> 1)
+ if nums[mid] > target {
+ high = mid - 1
+ } else if nums[mid] < target {
+ low = mid + 1
+ } else {
+ if (mid == len(nums)-1) || (nums[mid+1] != target) { // 找到最后一个与 target 相等的元素
+ return mid
+ }
+ low = mid + 1
+ }
+ }
+ return -1
+}
+
+// 二分查找第一个大于等于 target 的元素，时间复杂度 O(logn)
+func searchFirstGreaterElement(nums []int, target int) int {
+ low, high := 0, len(nums)-1
+ for low <= high {
+ mid := low + ((high - low) >> 1)
+ if nums[mid] >= target {
+ if (mid == 0) || (nums[mid-1] < target) { // 找到第一个大于等于 target 的元素
+ return mid
+ }
+ high = mid - 1
+ } else {
+ low = mid + 1
+ }
+ }
+ return -1
+}
+
+// 二分查找最后一个小于等于 target 的元素，时间复杂度 O(logn)
+func searchLastLessElement(nums []int, target int) int {
+ low, high := 0, len(nums)-1
+ for low <= high {
+ mid := low + ((high - low) >> 1)
+ if nums[mid] <= target {
+ if (mid == len(nums)-1) || (nums[mid+1] > target) { // 找到最后一个小于等于 target 的元素
+ return mid
+ }
+ low = mid + 1
+ } else {
+ high = mid - 1
+ }
+ }
+ return -1
+}
+```
+
+- 在基本有序的数组中用二分搜索。经典解法可以解，变种写法也可以写，常见的题型，在山峰数组中找山峰，在旋转有序数组中找分界点。第 33 题，第 81 题，第 153 题，第 154 题，第 162 题，第 852 题
+
+```go
+func peakIndexInMountainArray(A []int) int {
+ low, high := 0, len(A)-1
+ for low < high {
+ mid := low + (high-low)>>1
+ // 如果 mid 较大，则左侧存在峰值，high = m，如果 mid + 1 较大，则右侧存在峰值，low = mid + 1
+ if A[mid] > A[mid+1] {
+ high = mid
+ } else {
+ low = mid + 1
+ }
+ }
+ return low
+}
+```
+
+- max-min 最大值最小化问题。求在最小满足条件的情况下的最大值。第 410 题，第 875 题，第 1011 题，第 1283 题。
+
+
+{{.AvailableTagTable}}
\ No newline at end of file
diff --git a/ctl/template/Bit_Manipulation.md b/ctl/template/Bit_Manipulation.md
new file mode 100644
index 000000000..6c643994a
--- /dev/null
+++ b/ctl/template/Bit_Manipulation.md
@@ -0,0 +1,45 @@
+---
+title: 2.15 ✅ Bit Manipulation
+type: docs
+weight: 15
+---
+
+# Bit Manipulation
+
+
+
+- 异或的特性。第 136 题，第 268 题，第 389 题，第 421 题，
+
+```go
+x ^ 0 = x
+x ^ 11111……1111 = ~x
+x ^ (~x) = 11111……1111
+x ^ x = 0
+a ^ b = c => a ^ c = b => b ^ c = a (交换律)
+a ^ b ^ c = a ^ (b ^ c) = (a ^ b）^ c (结合律)
+```
+
+- 构造特殊 Mask，将特殊位置放 0 或 1。
+
+```go
+将 x 最右边的 n 位清零， x & ( ~0 << n )
+获取 x 的第 n 位值(0 或者 1)，(x >> n) & 1
+获取 x 的第 n 位的幂值，x & (1 << (n - 1))
+仅将第 n 位置为 1，x | (1 << n)
+仅将第 n 位置为 0，x & (~(1 << n))
+将 x 最高位至第 n 位(含)清零，x & ((1 << n) - 1)
+将第 n 位至第 0 位(含)清零，x & (~((1 << (n + 1)) - 1)）
+```
+
+- 有特殊意义的 & 位操作运算。第 260 题，第 201 题，第 318 题，第 371 题，第 397 题，第 461 题，第 693 题，
+
+```go
+X & 1 == 1 判断是否是奇数(偶数)
+X & = (X - 1) 将最低位(LSB)的 1 清零
+X & -X 得到最低位(LSB)的 1
+X & ~X = 0
+```
+
+
+
+{{.AvailableTagTable}}
\ No newline at end of file
diff --git a/ctl/template/Breadth_First_Search.md b/ctl/template/Breadth_First_Search.md
new file mode 100644
index 000000000..64e56acba
--- /dev/null
+++ b/ctl/template/Breadth_First_Search.md
@@ -0,0 +1,10 @@
+---
+title: 2.10 Breadth First Search
+type: docs
+weight: 10
+---
+
+# Breadth First Search
+
+
+{{.AvailableTagTable}}
\ No newline at end of file
diff --git a/ctl/template/Depth_First_Search.md b/ctl/template/Depth_First_Search.md
new file mode 100644
index 000000000..e8fb44153
--- /dev/null
+++ b/ctl/template/Depth_First_Search.md
@@ -0,0 +1,10 @@
+---
+title: 2.09 Depth First Search
+type: docs
+weight: 9
+---
+
+# Depth First Search
+
+
+{{.AvailableTagTable}}
\ No newline at end of file
diff --git a/ctl/template/Dynamic_Programming.md b/ctl/template/Dynamic_Programming.md
new file mode 100644
index 000000000..f18015f77
--- /dev/null
+++ b/ctl/template/Dynamic_Programming.md
@@ -0,0 +1,10 @@
+---
+title: 2.07 Dynamic Programming
+type: docs
+weight: 7
+---
+
+# Dynamic Programming
+
+
+{{.AvailableTagTable}}
\ No newline at end of file
diff --git a/ctl/template/Hash_Table.md b/ctl/template/Hash_Table.md
new file mode 100644
index 000000000..03fb07d62
--- /dev/null
+++ b/ctl/template/Hash_Table.md
@@ -0,0 +1,10 @@
+---
+title: 2.13 Hash Table
+type: docs
+weight: 13
+---
+
+# Hash Table
+
+
+{{.AvailableTagTable}}
\ No newline at end of file
diff --git a/ctl/template/Linked_List.md b/ctl/template/Linked_List.md
new file mode 100644
index 000000000..b8673cc39
--- /dev/null
+++ b/ctl/template/Linked_List.md
@@ -0,0 +1,24 @@
+---
+title: 2.04 ✅ Linked List
+type: docs
+weight: 4
+---
+
+# Linked List
+
+
+
+
+- 巧妙的构造虚拟头结点。可以使遍历处理逻辑更加统一。
+- 灵活使用递归。构造递归条件，使用递归可以巧妙的解题。不过需要注意有些题目不能使用递归，因为递归深度太深会导致超时和栈溢出。
+- 链表区间逆序。第 92 题。
+- 链表寻找中间节点。第 876 题。链表寻找倒数第 n 个节点。第 19 题。只需要一次遍历就可以得到答案。
+- 合并 K 个有序链表。第 21 题，第 23 题。
+- 链表归类。第 86 题，第 328 题。
+- 链表排序，时间复杂度要求 O(n * log n)，空间复杂度 O(1)。只有一种做法，归并排序，至顶向下归并。第 148 题。
+- 判断链表是否存在环，如果有环，输出环的交叉点的下标；判断 2 个链表是否有交叉点，如果有交叉点，输出交叉点。第 141 题，第 142 题，第 160 题。
+
+
+
+
+{{.AvailableTagTable}}
\ No newline at end of file
diff --git a/ctl/template/Math.md b/ctl/template/Math.md
new file mode 100644
index 000000000..dacbb1ff7
--- /dev/null
+++ b/ctl/template/Math.md
@@ -0,0 +1,10 @@
+---
+title: 2.12 Math
+type: docs
+weight: 12
+---
+
+# Math
+
+
+{{.AvailableTagTable}}
\ No newline at end of file
diff --git a/ctl/template/Segment_Tree.md b/ctl/template/Segment_Tree.md
new file mode 100644
index 000000000..220ac679e
--- /dev/null
+++ b/ctl/template/Segment_Tree.md
@@ -0,0 +1,38 @@
+---
+title: 2.18 ✅ Segment Tree
+type: docs
+weight: 18
+---
+
+# Segment Tree
+
+
+
+- 线段树的经典数组实现写法。将合并两个节点 pushUp 逻辑抽象出来了，可以实现任意操作(常见的操作有：加法，取 max，min 等等)。第 218 题，第 303 题，第 307 题，第 699 题。
+- 计数线段树的经典写法。第 315 题，第 327 题，第 493 题。
+- 线段树的树的实现写法。第 715 题，第 732 题。
+- 区间懒惰更新。第 218 题，第 699 题。
+- 离散化。离散化需要注意一个特殊情况：假如三个区间为 [1,10] [1,4] [6,10]，离散化后 x[1]=1,x[2]=4,x[3]=6,x[4]=10。第一个区间为 [1,4]，第二个区间为 [1,2]，第三个区间为 [3,4]，这样一来，区间一 = 区间二 + 区间三，这和离散前的模型不符，离散前，很明显，区间一 > 区间二 + 区间三。正确的做法是：在相差大于 1 的数间加一个数，例如在上面 1 4 6 10 中间加 5，即可 x[1]=1,x[2]=4,x[3]=5,x[4]=6,x[5]=10。这样处理之后，区间一是 1-5 ，区间二是 1-2 ，区间三是 4-5 。
+- 灵活构建线段树。线段树节点可以存储多条信息，合并两个节点的 pushUp 操作也可以是多样的。第 850 题，第 1157 题。
+
+
+线段树[题型](https://blog.csdn.net/xuechelingxiao/article/details/38313105)从简单到困难:
+
+1. 单点更新:
+ [HDU 1166 敌兵布阵](http://acm.hdu.edu.cn/showproblem.php?pid=1166) update:单点增减 query:区间求和
+ [HDU 1754 I Hate It](http://acm.hdu.edu.cn/showproblem.php?pid=1754) update:单点替换 query:区间最值
+ [HDU 1394 Minimum Inversion Number](http://acm.hdu.edu.cn/showproblem.php?pid=1394) update:单点增减 query:区间求和
+ [HDU 2795 Billboard](http://acm.hdu.edu.cn/showproblem.php?pid=2795) query:区间求最大值的位子(直接把update的操作在query里做了)
+2. 区间更新:
+ [HDU 1698 Just a Hook](http://acm.hdu.edu.cn/showproblem.php?pid=1698) update:成段替换 (由于只query一次总区间,所以可以直接输出 1 结点的信息)
+ [POJ 3468 A Simple Problem with Integers](http://poj.org/problem?id=3468) update:成段增减 query:区间求和
+ [POJ 2528 Mayor’s posters](http://poj.org/problem?id=2528) 离散化 + update:成段替换 query:简单hash
+ [POJ 3225 Help with Intervals](http://poj.org/problem?id=3225) update:成段替换,区间异或 query:简单hash
+3. 区间合并(这类题目会询问区间中满足条件的连续最长区间,所以PushUp的时候需要对左右儿子的区间进行合并):
+ [POJ 3667 Hotel](http://poj.org/problem?id=3667) update:区间替换 query:询问满足条件的最左端点
+4. 扫描线(这类题目需要将一些操作排序,然后从左到右用一根扫描线扫过去最典型的就是矩形面积并,周长并等题):
+ [HDU 1542 Atlantis](http://acm.hdu.edu.cn/showproblem.php?pid=1542) update:区间增减 query:直接取根节点的值
+ [HDU 1828 Picture](http://acm.hdu.edu.cn/showproblem.php?pid=1828) update:区间增减 query:直接取根节点的值
+
+
+{{.AvailableTagTable}}
\ No newline at end of file
diff --git a/ctl/template/Sliding_Window.md b/ctl/template/Sliding_Window.md
new file mode 100644
index 000000000..117e50223
--- /dev/null
+++ b/ctl/template/Sliding_Window.md
@@ -0,0 +1,30 @@
+---
+title: 2.17 ✅ Sliding Window
+type: docs
+weight: 17
+---
+
+# Sliding Window
+
+
+
+- 双指针滑动窗口的经典写法。右指针不断往右移，移动到不能往右移动为止(具体条件根据题目而定)。当右指针到最右边以后，开始挪动左指针，释放窗口左边界。第 3 题，第 76 题，第 209 题，第 424 题，第 438 题，第 567 题，第 713 题，第 763 题，第 845 题，第 881 题，第 904 题，第 978 题，第 992 题，第 1004 题，第 1040 题，第 1052 题。
+
+```c
+ left, right := 0, -1
+
+ for left < len(s) {
+ if right+1 < len(s) && freq[s[right+1]-'a'] == 0 {
+ freq[s[right+1]-'a']++
+ right++
+ } else {
+ freq[s[left]-'a']--
+ left++
+ }
+ result = max(result, right-left+1)
+ }
+```
+- 滑动窗口经典题。第 239 题，第 480 题。
+
+
+{{.AvailableTagTable}}
\ No newline at end of file
diff --git a/ctl/template/Sorting.md b/ctl/template/Sorting.md
new file mode 100644
index 000000000..5038c03cf
--- /dev/null
+++ b/ctl/template/Sorting.md
@@ -0,0 +1,19 @@
+---
+title: 2.14 ✅ Sorting
+type: docs
+weight: 14
+---
+
+# Sorting
+
+
+
+- 深刻的理解多路快排。第 75 题。
+- 链表的排序，插入排序(第 147 题)和归并排序(第 148 题)
+- 桶排序和基数排序。第 164 题。
+- "摆动排序"。第 324 题。
+- 两两不相邻的排序。第 767 题，第 1054 题。
+- "饼子排序"。第 969 题。
+
+
+{{.AvailableTagTable}}
\ No newline at end of file
diff --git a/ctl/template/Stack.md b/ctl/template/Stack.md
new file mode 100644
index 000000000..0cc1f39b6
--- /dev/null
+++ b/ctl/template/Stack.md
@@ -0,0 +1,18 @@
+---
+title: 2.05 ✅ Stack
+type: docs
+weight: 5
+---
+
+# Stack
+
+
+
+- 括号匹配问题及类似问题。第 20 题，第 921 题，第 1021 题。
+- 栈的基本 pop 和 push 操作。第 71 题，第 150 题，第 155 题，第 224 题，第 225 题，第 232 题，第 946 题，第 1047 题。
+- 利用栈进行编码问题。第 394 题，第 682 题，第 856 题，第 880 题。
+- **单调栈**。**利用栈维护一个单调递增或者递减的下标数组**。第 84 题，第 456 题，第 496 题，第 503 题，第 739 题，第 901 题，第 907 题，第 1019 题。
+
+
+
+{{.AvailableTagTable}}
\ No newline at end of file
diff --git a/ctl/template/String.md b/ctl/template/String.md
new file mode 100644
index 000000000..e0505e337
--- /dev/null
+++ b/ctl/template/String.md
@@ -0,0 +1,10 @@
+---
+title: 2.02 String
+type: docs
+weight: 2
+---
+
+# String
+
+
+{{.AvailableTagTable}}
\ No newline at end of file
diff --git a/ctl/template/Tree.md b/ctl/template/Tree.md
new file mode 100644
index 000000000..19bdee6ba
--- /dev/null
+++ b/ctl/template/Tree.md
@@ -0,0 +1,10 @@
+---
+title: 2.06 Tree
+type: docs
+weight: 6
+---
+
+# Tree
+
+
+{{.AvailableTagTable}}
\ No newline at end of file
diff --git a/ctl/template/Two_Pointers.md b/ctl/template/Two_Pointers.md
new file mode 100644
index 000000000..e25406e0c
--- /dev/null
+++ b/ctl/template/Two_Pointers.md
@@ -0,0 +1,33 @@
+---
+title: 2.03 ✅ Two Pointers
+type: docs
+weight: 3
+---
+
+# Two Pointers
+
+
+
+- 双指针滑动窗口的经典写法。右指针不断往右移，移动到不能往右移动为止(具体条件根据题目而定)。当右指针到最右边以后，开始挪动左指针，释放窗口左边界。第 3 题，第 76 题，第 209 题，第 424 题，第 438 题，第 567 题，第 713 题，第 763 题，第 845 题，第 881 题，第 904 题，第 978 题，第 992 题，第 1004 题，第 1040 题，第 1052 题。
+
+```c
+ left, right := 0, -1
+
+ for left < len(s) {
+ if right+1 < len(s) && freq[s[right+1]-'a'] == 0 {
+ freq[s[right+1]-'a']++
+ right++
+ } else {
+ freq[s[left]-'a']--
+ left++
+ }
+ result = max(result, right-left+1)
+ }
+```
+
+- 快慢指针可以查找重复数字，时间复杂度 O(n)，第 287 题。
+- 替换字母以后，相同字母能出现连续最长的长度。第 424 题。
+- SUM 问题集。第 1 题，第 15 题，第 16 题，第 18 题，第 167 题，第 923 题，第 1074 题。
+
+
+{{.AvailableTagTable}}
\ No newline at end of file
diff --git a/ctl/template/Union_Find.md b/ctl/template/Union_Find.md
new file mode 100644
index 000000000..0b23116ff
--- /dev/null
+++ b/ctl/template/Union_Find.md
@@ -0,0 +1,20 @@
+---
+title: 2.16 ✅ Union Find
+type: docs
+weight: 16
+---
+
+# Union Find
+
+
+
+- 灵活使用并查集的思想，熟练掌握并查集的[模板]({{< relref "/ChapterThree/UnionFind.md" >}})，模板中有两种并查集的实现方式，一种是路径压缩 + 秩优化的版本，另外一种是计算每个集合中元素的个数 + 最大集合元素个数的版本，这两种版本都有各自使用的地方。能使用第一类并查集模板的题目有：第 128 题，第 130 题，第 547 题，第 684 题，第 721 题，第 765 题，第 778 题，第 839 题，第 924 题，第 928 题，第 947 题，第 952 题，第 959 题，第 990 题。能使用第二类并查集模板的题目有：第 803 题，第 952 题。第 803 题秩优化和统计集合个数这些地方会卡时间，如果不优化，会 TLE。
+- 并查集是一种思想，有些题需要灵活使用这种思想，而不是死套模板，如第 399 题，这一题是 stringUnionFind，利用并查集思想实现的。这里每个节点是基于字符串和 map 的，而不是单纯的用 int 节点编号实现的。
+- 有些题死套模板反而做不出来，比如第 685 题，这一题不能路径压缩和秩优化，因为题目中涉及到有向图，需要知道节点的前驱节点，如果路径压缩了，这一题就没法做了。这一题不需要路径压缩和秩优化。
+- 灵活的抽象题目给的信息，将给定的信息合理的编号，使用并查集解题，并用 map 降低时间复杂度，如第 721 题，第 959 题。
+- 关于地图，砖块，网格的题目，可以新建一个特殊节点，将四周边缘的砖块或者网格都 union() 到这个特殊节点上。第 130 题，第 803 题。
+- 能用并查集的题目，一般也可以用 DFS 和 BFS 解答，只不过时间复杂度会高一点。
+
+
+
+{{.AvailableTagTable}}
\ No newline at end of file
diff --git a/ctl/template/collapseSection.md b/ctl/template/collapseSection.md
new file mode 100644
index 000000000..e954f0877
--- /dev/null
+++ b/ctl/template/collapseSection.md
@@ -0,0 +1,4 @@
+---
+bookCollapseSection: true
+weight: 20
+---
diff --git a/ctl/template/menu.md b/ctl/template/menu.md
new file mode 100644
index 000000000..ed8c51805
--- /dev/null
+++ b/ctl/template/menu.md
@@ -0,0 +1,9 @@
+---
+headless: true
+---
+
+<hr>
+
+{{.BookMenu}}
+
+<br />
diff --git a/ctl/template/template.markdown b/ctl/template/template.markdown
new file mode 100644
index 000000000..c0b24343e
--- /dev/null
+++ b/ctl/template/template.markdown
@@ -0,0 +1,645 @@
+
+# LeetCode in Go
+[LeetCode Online Judge](https://leetcode.com/) is a website containing many **algorithm questions**. Most of them are real interview questions of **Google, Facebook, LinkedIn, Apple**, etc. and it always help to sharp our algorithm Skills. Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. This repo shows my solutions in Go with the code style strictly follows the [Google Golang Style Guide](https://github.com/golang/go/wiki/CodeReviewComments). Please feel free to reference and **STAR** to support this repo, thank you!
+
+
+<p align='center'>
+<img src='./logo.png'>
+</p>
+
+
+
+<p align='center'>
+<a href="https://github.com/halfrost/leetcode-go/releases/" rel="nofollow"><img alt="GitHub All Releases" src="https://img.shields.io/github/downloads/halfrost/LeetCode-Go/total?label=PDF%20downloads"></a>
+<img src="https://img.shields.io/badge/Total%20Word%20Count-738884-success">
+<a href="https://github.com/halfrost/leetcode-go/actions" rel="nofollow"><img src="https://github.com/halfrost/leetcode-go/workflows/Deploy%20leetcode-cookbook/badge.svg?branch=master"></a>
+<a href="https://travis-ci.org/github/halfrost/LeetCode-Go" rel="nofollow"><img src="https://travis-ci.org/halfrost/LeetCode-Go.svg?branch=master"></a>
+<a href="https://goreportcard.com/report/github.com/halfrost/LeetCode-Go" rel="nofollow"><img src="https://goreportcard.com/badge/github.com/halfrost/LeetCode-Go"></a>
+<img src="https://img.shields.io/badge/runtime%20beats-100%25-success">
+<a href="https://codecov.io/gh/halfrost/LeetCode-Go"><img src="https://codecov.io/gh/halfrost/LeetCode-Go/branch/master/graph/badge.svg" /></a>
+<!--<img alt="GitHub go.mod Go version" src="https://img.shields.io/github/go-mod/go-version/halfrost/LeetCode-Go?color=26C2F0">-->
+<img alt="Support Go version" src="https://img.shields.io/badge/Go-v1.15-26C2F0">
+<img src="https://visitor-badge.laobi.icu/badge?page_id=halfrost.LeetCode-Go">
+</p>
+
+<p align='center'>
+<a href="https://github.com/halfrost/leetcode-go/blob/master/LICENSE"><img alt="GitHub" src="https://img.shields.io/github/license/halfrost/LeetCode-Go?label=License"></a>
+<img src="https://img.shields.io/badge/License-CC-000000.svg">
+<a href="https://leetcode.com/halfrost/"><img src="https://img.shields.io/badge/@halfrost-8751-yellow.svg">
+<img src="https://img.shields.io/badge/language-Golang-26C2F0.svg">
+<a href="https://halfrost.com"><img src="https://img.shields.io/badge/Blog-Halfrost--Field-80d4f9.svg?style=flat"></a>
+<a href="http://weibo.com/halfrost"><img src="https://img.shields.io/badge/weibo-@halfrost-f974ce.svg?style=flat&colorA=f4292e"></a>
+<a href="https://twitter.com/halffrost"><img src="https://img.shields.io/badge/twitter-@halffrost-F8E81C.svg?style=flat&colorA=009df2"></a>
+<a href="https://www.zhihu.com/people/halfrost/activities"><img src="https://img.shields.io/badge/%E7%9F%A5%E4%B9%8E-@halfrost-fd6f32.svg?style=flat&colorA=0083ea"></a>
+<img src="https://img.shields.io/badge/made%20with-=1-blue.svg">
+<a href="https://github.com/halfrost/leetcode-go/pulls"><img src="https://img.shields.io/badge/PR-Welcome-brightgreen.svg"></a>
+</p>
+
+支持 Progressive Web Apps 和 Dark Mode 的题解电子书《LeetCode Cookbook》 <a href="https://books.halfrost.com/leetcode/" rel="nofollow">Online Reading</a>
+
+<p align='center'>
+<a href="https://books.halfrost.com/leetcode/"><img src="https://img.halfrost.com/Leetcode/Cookbook_Safari_0.png"></a>
+<a href="https://books.halfrost.com/leetcode/"><img src="https://img.halfrost.com/Leetcode/Cookbook_Chrome_PWA.png"></a>
+</p>
+
+离线版本的电子书《LeetCode Cookbook》PDF <a href="https://github.com/halfrost/leetcode-go/releases/" rel="nofollow">Download here</a>
+
+<p align='center'>
+<a href="https://github.com/halfrost/leetcode-go/releases/"><img src="https://img.halfrost.com/Leetcode/Cookbook.png"></a>
+</p>
+
+通过 iOS / Android 浏览器安装 PWA 版《LeetCode Cookbook》至设备桌面随时学习
+
+<p align='center'>
+<a href="https://books.halfrost.com/leetcode/"><img src="https://img.halfrost.com/Leetcode/Cookbook_PWA_iPad.png"></a>
+<a href="https://books.halfrost.com/leetcode/"><img src="https://img.halfrost.com/Leetcode/Cookbook_PWA_iPad_example1__.png"></a>
+<a href="https://books.halfrost.com/leetcode/"><img src="https://img.halfrost.com/Leetcode/Cookbook_PWA_iPad_example2__.png"></a>
+</p>
+
+
+## Data Structures
+
+> 标识了 ✅ 的专题是完成所有题目了的，没有标识的是还没有做完所有题目的
+
+<a href="https://books.halfrost.com/leetcode/"><img src="./website/static/logo.png" alt="logo" height="550" align="right" /></a>
+
+* [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)
+
+<br>
+<br>
+
+| 数据结构 | 变种 | 相关题目 | 讲解文章 |
+|:-------:|:-------|:------|:------|
+|顺序线性表：向量||||
+|单链表|1. 双向链表<br>2. 静态链表<br>3. 对称矩阵<br>4. 稀疏矩阵|||
+|哈希表|1. 散列函数<br>2. 解决碰撞/填充因子<br>|||
+|栈和队列|1. 广义栈<br>2. 双端队列<br>|||
+|队列|1. 链表实现<br>2. 循环数组实现<br>3. 双端队列|||
+|字符串|1. KMP算法<br>2. 有限状态自动机<br>3. 模式匹配有限状态自动机<br>4. BM 模式匹配算法<br>5. BM-KMP 算法<br>6. BF 算法|||
+|树|1. 二叉树<br>2. 并查集<br>3. Huffman 树|||
+|数组实现的堆|1. 极大堆和极小堆<br>2. 极大极小堆<br>3. 双端堆<br>4. d 叉堆|||
+|树实现的堆|1. 左堆<br>2. 扁堆<br>3. 二项式堆<br>4. 斐波那契堆<br>5. 配对堆|||
+|查找|1. 哈希表<br>2. 跳跃表<br>3. 排序二叉树<br>4. AVL 树<br>5. B 树 / B+ 树 / B* 树<br>6. AA 树<br>7. 红黑树<br>8. 排序二叉堆<br>9. Splay 树<br>10. 双链树<br>11. Trie 树<br>12. R 树|||
+|--------------------------------------------|--------------------------------------------------------------------------------------------|---------------------------|-----------------------------------|
+
+
+## Algorithm
+
+
+| 算法 | 具体类型 | 相关题目 | 讲解文章 |
+|:-------:|:-------|:------|:------|
+|排序算法|1. 冒泡排序<br>2. 插入排序<br>3. 选择排序<br>4. 希尔 Shell 排序<br>5. 快速排序<br>6. 归并排序<br>7. 堆排序<br>8. 线性排序算法<br>9. 自省排序<br>10. 间接排序<br>11. 计数排序<br>12. 基数排序<br>13. 桶排序<br>14. 外部排序 - k 路归并败者树<br>15. 外部排序 - 最佳归并树|||
+|递归与分治||1. 二分搜索/查找<br>2. 大整数的乘法<br>3. Strassen 矩阵乘法<br>4. 棋盘覆盖<br>5. 合并排序<br>6. 快速排序<br>7. 线性时间选择<br>8. 最接近点对问题<br>9. 循环赛日程表<br>||
+|动态规划||1. 矩阵连乘问题<br>2. 最长公共子序列<br>3. 最大子段和<br>4. 凸多边形最优三角剖分<br>5. 多边形游戏<br>6. 图像压缩<br>7. 电路布线<br>8. 流水作业调度<br>9. 0-1 背包问题/背包九讲<br>10. 最优二叉搜索树<br>11. 动态规划加速原理<br>12. 树型 DP<br>||
+|贪心||1. 活动安排问题<br>2. 最优装载<br>3. 哈夫曼编码<br>4. 单源最短路径<br>5. 最小生成树<br>6. 多机调度问题<br>||
+|回溯法||1. 装载问题<br>2. 批处理作业调度<br>3. 符号三角形问题<br>4. n 后问题<br>5. 0-1 背包问题<br>6. 最大团问题<br>7. 图的 m 着色问题<br>8. 旅行售货员问题<br>9. 圆排列问题<br>10. 电路板排列问题<br>11. 连续邮资问题<br>||
+|搜索|1. 枚举<br>2. DFS<br>3. BFS<br>4. 启发式搜索<br>|||
+|随机化|1. 随机数<br>2. 数值随机化算法<br>3. Sherwood 舍伍德算法<br>4. Las Vegas 拉斯维加斯算法<br>5. Monte Carlo 蒙特卡罗算法<br>|1. 计算 π 值<br>2. 计算定积分<br>3. 解非线性方程组<br>4. 线性时间选择算法<br>5. 跳跃表<br>6. n 后问题<br>7. 整数因子分解<br>8. 主元素问题<br>9. 素数测试<br>||
+|图论|1. 遍历 DFS / BFS<br>2. AOV / AOE 网络<br>3. Kruskal 算法(最小生成树)<br>4. Prim 算法(最小生成树)<br>5. Boruvka 算法(最小生成树)<br>6. Dijkstra 算法(单源最短路径)<br>7. Bellman-Ford 算法(单源最短路径)<br>8. SPFA 算法(单源最短路径)<br>9. Floyd 算法(多源最短路径)<br>10. Johnson 算法(多源最短路径)<br>11. Fleury 算法(欧拉回路)<br>12. Ford-Fulkerson 算法(最大网络流增广路)<br>13. Edmonds-Karp 算法(最大网络流)<br>14. Dinic 算法(最大网络流)<br>15. 一般预流推进算法<br>16. 最高标号预流推进 HLPP 算法<br>17. Primal-Dual 原始对偶算法(最小费用流)18. Kosaraju 算法(有向图强连通分量)<br>19. Tarjan 算法(有向图强连通分量)<br>20. Gabow 算法(有向图强连通分量)<br>21. 匈牙利算法(二分图匹配)<br>22. Hopcroft－Karp 算法(二分图匹配)<br>23. kuhn munkras 算法(二分图最佳匹配)<br>24. Edmonds’ Blossom-Contraction 算法(一般图匹配)<br>|1. 图遍历<br>2. 有向图和无向图的强弱连通性<br>3. 割点/割边<br>3. AOV 网络和拓扑排序<br>4. AOE 网络和关键路径<br>5. 最小代价生成树/次小生成树<br>6. 最短路径问题/第 K 短路问题<br>7. 最大网络流问题<br>8. 最小费用流问题<br>9. 图着色问题<br>10. 差分约束系统<br>11. 欧拉回路<br>12. 中国邮递员问题<br>13. 汉密尔顿回路<br>14. 最佳边割集/最佳点割集/最小边割集/最小点割集/最小路径覆盖/最小点集覆盖 <br>15. 边覆盖集<br>16. 二分图完美匹配和最大匹配问题<br>17. 仙人掌图<br>18. 弦图<br>19. 稳定婚姻问题<br>20. 最大团问题<br>||
+|数论||1. 最大公约数<br> 2. 最小公倍数<br>3. 分解质因数<br>4. 素数判定<br>5. 进制转换<br>6. 高精度计算<br>7. 整除问题<br>8. 同余问题<br>9. 欧拉函数<br>10. 扩展欧几里得<br>11. 置换群<br>12. 母函数<br>13. 离散变换<br>14. 康托展开<br>15. 矩阵<br>16. 向量<br>17. 线性方程组<br>18. 线性规划<br> ||
+|几何||1. 凸包 - Gift wrapping<br>2. 凸包 - Graham scan<br>3. 线段问题<br> 4. 多边形和多面体相关问题<br>||
+|NP 完全|1. 计算模型<br>2. P 类与 NP 类问题<br>3. NP 完全问题<br>4. NP 完全问题的近似算法<br>|1. 随机存取机 RAM<br>2. 随机存取存储程序机 RASP<br>3. 图灵机<br>4. 非确定性图灵机<br>5. P 类与 NP 类语言<br>6. 多项式时间验证<br>7. 多项式时间变换<br>8. Cook定理<br>9. 合取范式的可满足性问题 CNF-SAT<br>10. 3 元合取范式的可满足性问题 3-SAT<br>11. 团问题 CLIQUE<br>12. 顶点覆盖问题 VERTEX-COVER<br>13. 子集和问题 SUBSET-SUM<br>14. 哈密顿回路问题 HAM-CYCLE<br>15. 旅行售货员问题 TSP<br>16. 顶点覆盖问题的近似算法<br>17. 旅行售货员问题近似算法<br>18. 具有三角不等式性质的旅行售货员问题<br>19. 一般的旅行售货员问题<br>20. 集合覆盖问题的近似算法<br>21. 子集和问题的近似算法<br>22. 子集和问题的指数时间算法<br>23. 子集和问题的多项式时间近似格式<br>||
+|------------|------------------------------------------------------------------|-----------------------------------------------------------------|--------------------|
+
+
+## LeetCode Problems
+
+## 一. 个人数据
+
+{{.PersonalData}}
+
+## 二. 目录
+
+{{.TotalNum}}
+
+{{.AvailableTable}}
+
+------------------------------------------------------------------
+
+下面这些是免费的算法题，但是暂时还不能使用 Go 解答的：
+
+暂无
+
+------------------------------------------------------------------
+
+
+## 三.分类
+
+## Array
+
+
+Problems List in [there](https://books.halfrost.com/leetcode/ChapterTwo/Array/)
+
+
+
+## String
+
+Problems List in [there](https://books.halfrost.com/leetcode/ChapterTwo/String/)
+
+
+## Two Pointers
+
+
+
+- 双指针滑动窗口的经典写法。右指针不断往右移，移动到不能往右移动为止(具体条件根据题目而定)。当右指针到最右边以后，开始挪动左指针，释放窗口左边界。第 3 题，第 76 题，第 209 题，第 424 题，第 438 题，第 567 题，第 713 题，第 763 题，第 845 题，第 881 题，第 904 题，第 978 题，第 992 题，第 1004 题，第 1040 题，第 1052 题。
+
+```c
+ left, right := 0, -1
+
+ for left < len(s) {
+ if right+1 < len(s) && freq[s[right+1]-'a'] == 0 {
+ freq[s[right+1]-'a']++
+ right++
+ } else {
+ freq[s[left]-'a']--
+ left++
+ }
+ result = max(result, right-left+1)
+ }
+```
+
+- 快慢指针可以查找重复数字，时间复杂度 O(n)，第 287 题。
+- 替换字母以后，相同字母能出现连续最长的长度。第 424 题。
+- SUM 问题集。第 1 题，第 15 题，第 16 题，第 18 题，第 167 题，第 923 题，第 1074 题。
+
+
+Problems List in [there](https://books.halfrost.com/leetcode/ChapterTwo/Two_Pointers/)
+
+
+## Linked List
+
+
+
+
+- 巧妙的构造虚拟头结点。可以使遍历处理逻辑更加统一。
+- 灵活使用递归。构造递归条件，使用递归可以巧妙的解题。不过需要注意有些题目不能使用递归，因为递归深度太深会导致超时和栈溢出。
+- 链表区间逆序。第 92 题。
+- 链表寻找中间节点。第 876 题。链表寻找倒数第 n 个节点。第 19 题。只需要一次遍历就可以得到答案。
+- 合并 K 个有序链表。第 21 题，第 23 题。
+- 链表归类。第 86 题，第 328 题。
+- 链表排序，时间复杂度要求 O(n * log n)，空间复杂度 O(1)。只有一种做法，归并排序，至顶向下归并。第 148 题。
+- 判断链表是否存在环，如果有环，输出环的交叉点的下标；判断 2 个链表是否有交叉点，如果有交叉点，输出交叉点。第 141 题，第 142 题，第 160 题。
+
+
+Problems List in [there](https://books.halfrost.com/leetcode/ChapterTwo/Linked_List/)
+
+
+
+
+## Stack
+
+
+
+- 括号匹配问题及类似问题。第 20 题，第 921 题，第 1021 题。
+- 栈的基本 pop 和 push 操作。第 71 题，第 150 题，第 155 题，第 224 题，第 225 题，第 232 题，第 946 题，第 1047 题。
+- 利用栈进行编码问题。第 394 题，第 682 题，第 856 题，第 880 题。
+- **单调栈**。**利用栈维护一个单调递增或者递减的下标数组**。第 84 题，第 456 题，第 496 题，第 503 题，第 739 题，第 901 题，第 907 题，第 1019 题。
+
+Problems List in [there](https://books.halfrost.com/leetcode/ChapterTwo/Stack/)
+
+
+
+## Tree
+
+
+Problems List in [there](https://books.halfrost.com/leetcode/ChapterTwo/Tree/)
+
+
+
+
+
+## Dynamic Programming
+
+Problems List in [there](https://books.halfrost.com/leetcode/ChapterTwo/Dynamic_Programming/)
+
+
+
+## Backtracking
+
+
+
+- 排列问题 Permutations。第 46 题，第 47 题。第 60 题，第 526 题，第 996 题。
+- 组合问题 Combination。第 39 题，第 40 题，第 77 题，第 216 题。
+- 排列和组合杂交问题。第 1079 题。
+- N 皇后终极解法(二进制解法)。第 51 题，第 52 题。
+- 数独问题。第 37 题。
+- 四个方向搜索。第 79 题，第 212 题，第 980 题。
+- 子集合问题。第 78 题，第 90 题。
+- Trie。第 208 题，第 211 题。
+- BFS 优化。第 126 题，第 127 题。
+- DFS 模板。(只是一个例子，不对应任何题)
+
+```go
+func combinationSum2(candidates []int, target int) [][]int {
+ if len(candidates) == 0 {
+ return [][]int{}
+ }
+ c, res := []int{}, [][]int{}
+ sort.Ints(candidates)
+ findcombinationSum2(candidates, target, 0, c, &res)
+ return res
+}
+
+func findcombinationSum2(nums []int, target, index int, c []int, res *[][]int) {
+ if target == 0 {
+ b := make([]int, len(c))
+ copy(b, c)
+ *res = append(*res, b)
+ return
+ }
+ for i := index; i < len(nums); i++ {
+ if i > index && nums[i] == nums[i-1] { // 这里是去重的关键逻辑
+ continue
+ }
+ if target >= nums[i] {
+ c = append(c, nums[i])
+ findcombinationSum2(nums, target-nums[i], i+1, c, res)
+ c = c[:len(c)-1]
+ }
+ }
+}
+```
+- BFS 模板。(只是一个例子，不对应任何题)
+
+```go
+func updateMatrix_BFS(matrix [][]int) [][]int {
+ res := make([][]int, len(matrix))
+ if len(matrix) == 0 || len(matrix[0]) == 0 {
+ return res
+ }
+ queue := make([][]int, 0)
+ for i, _ := range matrix {
+ res[i] = make([]int, len(matrix[0]))
+ for j, _ := range res[i] {
+ if matrix[i][j] == 0 {
+ res[i][j] = -1
+ queue = append(queue, []int{i, j})
+ }
+ }
+ }
+ level := 1
+ for len(queue) > 0 {
+ size := len(queue)
+ for size > 0 {
+ size -= 1
+ node := queue[0]
+ queue = queue[1:]
+ i, j := node[0], node[1]
+ for _, direction := range [][]int{{-1, 0}, {1, 0}, {0, 1}, {0, -1}} {
+ x := i + direction[0]
+ y := j + direction[1]
+ if x < 0 || x >= len(matrix) || y < 0 || y >= len(matrix[0]) || res[x][y] < 0 || res[x][y] > 0 {
+ continue
+ }
+ res[x][y] = level
+ queue = append(queue, []int{x, y})
+ }
+ }
+ level++
+ }
+ for i, row := range res {
+ for j, cell := range row {
+ if cell == -1 {
+ res[i][j] = 0
+ }
+ }
+ }
+ return res
+}
+```
+
+
+Problems List in [there](https://books.halfrost.com/leetcode/ChapterTwo/Backtracking/)
+
+
+## Depth First Search
+
+
+Problems List in [there](https://books.halfrost.com/leetcode/ChapterTwo/Depth_First_Search/)
+
+
+
+
+## Breadth First Search
+
+
+
+Problems List in [there](https://books.halfrost.com/leetcode/ChapterTwo/Breadth_First_Search/)
+
+
+
+
+
+## Binary Search
+
+![]()
+
+- 二分搜索的经典写法。需要注意的三点：
+ 1. 循环退出条件，注意是 low <= high，而不是 low < high。
+ 2. mid 的取值，mid := low + (high-low)>>1
+ 3. low 和 high 的更新。low = mid + 1，high = mid - 1。
+
+```go
+func binarySearchMatrix(nums []int, target int) int {
+ low, high := 0, len(nums)-1
+ for low <= high {
+ mid := low + (high-low)>>1
+ if nums[mid] == target {
+ return mid
+ } else if nums[mid] > target {
+ high = mid - 1
+ } else {
+ low = mid + 1
+ }
+ }
+ return -1
+}
+```
+
+- 二分搜索的变种写法。有 4 个基本变种:
+ 1. 查找第一个与 target 相等的元素，时间复杂度 O(logn)
+ 2. 查找最后一个与 target 相等的元素，时间复杂度 O(logn)
+ 3. 查找第一个大于等于 target 的元素，时间复杂度 O(logn)
+ 4. 查找最后一个小于等于 target 的元素，时间复杂度 O(logn)
+
+```go
+// 二分查找第一个与 target 相等的元素，时间复杂度 O(logn)
+func searchFirstEqualElement(nums []int, target int) int {
+ low, high := 0, len(nums)-1
+ for low <= high {
+ mid := low + ((high - low) >> 1)
+ if nums[mid] > target {
+ high = mid - 1
+ } else if nums[mid] < target {
+ low = mid + 1
+ } else {
+ if (mid == 0) || (nums[mid-1] != target) { // 找到第一个与 target 相等的元素
+ return mid
+ }
+ high = mid - 1
+ }
+ }
+ return -1
+}
+
+// 二分查找最后一个与 target 相等的元素，时间复杂度 O(logn)
+func searchLastEqualElement(nums []int, target int) int {
+ low, high := 0, len(nums)-1
+ for low <= high {
+ mid := low + ((high - low) >> 1)
+ if nums[mid] > target {
+ high = mid - 1
+ } else if nums[mid] < target {
+ low = mid + 1
+ } else {
+ if (mid == len(nums)-1) || (nums[mid+1] != target) { // 找到最后一个与 target 相等的元素
+ return mid
+ }
+ low = mid + 1
+ }
+ }
+ return -1
+}
+
+// 二分查找第一个大于等于 target 的元素，时间复杂度 O(logn)
+func searchFirstGreaterElement(nums []int, target int) int {
+ low, high := 0, len(nums)-1
+ for low <= high {
+ mid := low + ((high - low) >> 1)
+ if nums[mid] >= target {
+ if (mid == 0) || (nums[mid-1] < target) { // 找到第一个大于等于 target 的元素
+ return mid
+ }
+ high = mid - 1
+ } else {
+ low = mid + 1
+ }
+ }
+ return -1
+}
+
+// 二分查找最后一个小于等于 target 的元素，时间复杂度 O(logn)
+func searchLastLessElement(nums []int, target int) int {
+ low, high := 0, len(nums)-1
+ for low <= high {
+ mid := low + ((high - low) >> 1)
+ if nums[mid] <= target {
+ if (mid == len(nums)-1) || (nums[mid+1] > target) { // 找到最后一个小于等于 target 的元素
+ return mid
+ }
+ low = mid + 1
+ } else {
+ high = mid - 1
+ }
+ }
+ return -1
+}
+```
+
+- 在基本有序的数组中用二分搜索。经典解法可以解，变种写法也可以写，常见的题型，在山峰数组中找山峰，在旋转有序数组中找分界点。第 33 题，第 81 题，第 153 题，第 154 题，第 162 题，第 852 题
+
+```go
+func peakIndexInMountainArray(A []int) int {
+ low, high := 0, len(A)-1
+ for low < high {
+ mid := low + (high-low)>>1
+ // 如果 mid 较大，则左侧存在峰值，high = m，如果 mid + 1 较大，则右侧存在峰值，low = mid + 1
+ if A[mid] > A[mid+1] {
+ high = mid
+ } else {
+ low = mid + 1
+ }
+ }
+ return low
+}
+```
+
+- max-min 最大值最小化问题。求在最小满足条件的情况下的最大值。第 410 题，第 875 题，第 1011 题，第 1283 题。
+
+Problems List in [there](https://books.halfrost.com/leetcode/ChapterTwo/Binary_Search/)
+
+
+
+## Math
+
+
+Problems List in [there](https://books.halfrost.com/leetcode/ChapterTwo/Math/)
+
+
+
+
+## Hash Table
+
+
+Problems List in [there](https://books.halfrost.com/leetcode/ChapterTwo/Hash_Table/)
+
+
+
+## Sort
+
+
+
+- 深刻的理解多路快排。第 75 题。
+- 链表的排序，插入排序(第 147 题)和归并排序(第 148 题)
+- 桶排序和基数排序。第 164 题。
+- "摆动排序"。第 324 题。
+- 两两不相邻的排序。第 767 题，第 1054 题。
+- "饼子排序"。第 969 题。
+
+Problems List in [there](https://books.halfrost.com/leetcode/ChapterTwo/Sort/)
+
+
+## Bit Manipulation
+
+
+
+- 异或的特性。第 136 题，第 268 题，第 389 题，第 421 题，
+
+```go
+x ^ 0 = x
+x ^ 11111……1111 = ~x
+x ^ (~x) = 11111……1111
+x ^ x = 0
+a ^ b = c => a ^ c = b => b ^ c = a (交换律)
+a ^ b ^ c = a ^ (b ^ c) = (a ^ b）^ c (结合律)
+```
+
+- 构造特殊 Mask，将特殊位置放 0 或 1。
+
+```go
+将 x 最右边的 n 位清零， x & ( ~0 << n )
+获取 x 的第 n 位值(0 或者 1)，(x >> n) & 1
+获取 x 的第 n 位的幂值，x & (1 << (n - 1))
+仅将第 n 位置为 1，x | (1 << n)
+仅将第 n 位置为 0，x & (~(1 << n))
+将 x 最高位至第 n 位(含)清零，x & ((1 << n) - 1)
+将第 n 位至第 0 位(含)清零，x & (~((1 << (n + 1)) - 1)）
+```
+
+- 有特殊意义的 & 位操作运算。第 260 题，第 201 题，第 318 题，第 371 题，第 397 题，第 461 题，第 693 题，
+
+```go
+X & 1 == 1 判断是否是奇数(偶数)
+X & = (X - 1) 将最低位(LSB)的 1 清零
+X & -X 得到最低位(LSB)的 1
+X & ~X = 0
+```
+
+Problems List in [there](https://books.halfrost.com/leetcode/ChapterTwo/Bit_Manipulation/)
+
+
+## Union Find
+
+
+
+- 灵活使用并查集的思想，熟练掌握并查集的[模板](https://github.com/halfrost/leetcode-go/blob/master/template/UnionFind.go)，模板中有两种并查集的实现方式，一种是路径压缩 + 秩优化的版本，另外一种是计算每个集合中元素的个数 + 最大集合元素个数的版本，这两种版本都有各自使用的地方。能使用第一类并查集模板的题目有：第 128 题，第 130 题，第 547 题，第 684 题，第 721 题，第 765 题，第 778 题，第 839 题，第 924 题，第 928 题，第 947 题，第 952 题，第 959 题，第 990 题。能使用第二类并查集模板的题目有：第 803 题，第 952 题。第 803 题秩优化和统计集合个数这些地方会卡时间，如果不优化，会 TLE。
+- 并查集是一种思想，有些题需要灵活使用这种思想，而不是死套模板，如第 399 题，这一题是 stringUnionFind，利用并查集思想实现的。这里每个节点是基于字符串和 map 的，而不是单纯的用 int 节点编号实现的。
+- 有些题死套模板反而做不出来，比如第 685 题，这一题不能路径压缩和秩优化，因为题目中涉及到有向图，需要知道节点的前驱节点，如果路径压缩了，这一题就没法做了。这一题不需要路径压缩和秩优化。
+- 灵活的抽象题目给的信息，将给定的信息合理的编号，使用并查集解题，并用 map 降低时间复杂度，如第 721 题，第 959 题。
+- 关于地图，砖块，网格的题目，可以新建一个特殊节点，将四周边缘的砖块或者网格都 union() 到这个特殊节点上。第 130 题，第 803 题。
+- 能用并查集的题目，一般也可以用 DFS 和 BFS 解答，只不过时间复杂度会高一点。
+
+
+Problems List in [there](https://books.halfrost.com/leetcode/ChapterTwo/Union_Find/)
+
+
+
+## Sliding Window
+
+
+
+- 双指针滑动窗口的经典写法。右指针不断往右移，移动到不能往右移动为止(具体条件根据题目而定)。当右指针到最右边以后，开始挪动左指针，释放窗口左边界。第 3 题，第 76 题，第 209 题，第 424 题，第 438 题，第 567 题，第 713 题，第 763 题，第 845 题，第 881 题，第 904 题，第 978 题，第 992 题，第 1004 题，第 1040 题，第 1052 题。
+
+```c
+ left, right := 0, -1
+
+ for left < len(s) {
+ if right+1 < len(s) && freq[s[right+1]-'a'] == 0 {
+ freq[s[right+1]-'a']++
+ right++
+ } else {
+ freq[s[left]-'a']--
+ left++
+ }
+ result = max(result, right-left+1)
+ }
+```
+- 滑动窗口经典题。第 239 题，第 480 题。
+
+Problems List in [there](https://books.halfrost.com/leetcode/ChapterTwo/Sliding_Window/)
+
+
+## Segment Tree
+
+
+
+- 线段树的经典数组实现写法。将合并两个节点 pushUp 逻辑抽象出来了，可以实现任意操作(常见的操作有：加法，取 max，min 等等)。第 218 题，第 303 题，第 307 题，第 699 题。
+- 计数线段树的经典写法。第 315 题，第 327 题，第 493 题。
+- 线段树的树的实现写法。第 715 题，第 732 题。
+- 区间懒惰更新。第 218 题，第 699 题。
+- 离散化。离散化需要注意一个特殊情况：假如三个区间为 [1,10] [1,4] [6,10]，离散化后 x[1]=1,x[2]=4,x[3]=6,x[4]=10。第一个区间为 [1,4]，第二个区间为 [1,2]，第三个区间为 [3,4]，这样一来，区间一 = 区间二 + 区间三，这和离散前的模型不符，离散前，很明显，区间一 > 区间二 + 区间三。正确的做法是：在相差大于 1 的数间加一个数，例如在上面 1 4 6 10 中间加 5，即可 x[1]=1,x[2]=4,x[3]=5,x[4]=6,x[5]=10。这样处理之后，区间一是 1-5 ，区间二是 1-2 ，区间三是 4-5 。
+- 灵活构建线段树。线段树节点可以存储多条信息，合并两个节点的 pushUp 操作也可以是多样的。第 850 题，第 1157 题。
+
+
+线段树[题型](https://blog.csdn.net/xuechelingxiao/article/details/38313105)从简单到困难:
+
+1. 单点更新:
+ [HDU 1166 敌兵布阵](http://acm.hdu.edu.cn/showproblem.php?pid=1166) update:单点增减 query:区间求和
+ [HDU 1754 I Hate It](http://acm.hdu.edu.cn/showproblem.php?pid=1754) update:单点替换 query:区间最值
+ [HDU 1394 Minimum Inversion Number](http://acm.hdu.edu.cn/showproblem.php?pid=1394) update:单点增减 query:区间求和
+ [HDU 2795 Billboard](http://acm.hdu.edu.cn/showproblem.php?pid=2795) query:区间求最大值的位子(直接把update的操作在query里做了)
+2. 区间更新:
+ [HDU 1698 Just a Hook](http://acm.hdu.edu.cn/showproblem.php?pid=1698) update:成段替换 (由于只query一次总区间,所以可以直接输出 1 结点的信息)
+ [POJ 3468 A Simple Problem with Integers](http://poj.org/problem?id=3468) update:成段增减 query:区间求和
+ [POJ 2528 Mayor’s posters](http://poj.org/problem?id=2528) 离散化 + update:成段替换 query:简单hash
+ [POJ 3225 Help with Intervals](http://poj.org/problem?id=3225) update:成段替换,区间异或 query:简单hash
+3. 区间合并(这类题目会询问区间中满足条件的连续最长区间,所以PushUp的时候需要对左右儿子的区间进行合并):
+ [POJ 3667 Hotel](http://poj.org/problem?id=3667) update:区间替换 query:询问满足条件的最左端点
+4. 扫描线(这类题目需要将一些操作排序,然后从左到右用一根扫描线扫过去最典型的就是矩形面积并,周长并等题):
+ [HDU 1542 Atlantis](http://acm.hdu.edu.cn/showproblem.php?pid=1542) update:区间增减 query:直接取根节点的值
+ [HDU 1828 Picture](http://acm.hdu.edu.cn/showproblem.php?pid=1828) update:区间增减 query:直接取根节点的值
+
+Problems List in [there](https://books.halfrost.com/leetcode/ChapterTwo/Segment_Tree/)
+
+
+## Binary Indexed Tree
+
+
+
+Problems List in [there](https://books.halfrost.com/leetcode/ChapterTwo/Binary_Indexed_Tree/)
+
+
+----------------------------------------------------------------------------------------
+
+<p align='center'>
+<a href="https://github.com/halfrost/leetcode-go/releases/tag/Special"><img src="https://img.halfrost.com/Leetcode/ACM-ICPC_Algorithm_Template.png"></a>
+</p>
+
+Thank you for reading here. This is bonus. You can download my [《ACM-ICPC Algorithm Template》](https://github.com/halfrost/leetcode-go/releases/tag/Special/)
+
+
+
+## ♥️ Thanks
+
+Thanks for your Star！
+
+[](https://starchart.cc/halfrost/LeetCode-Go)
+
diff --git a/ctl/template_render.go b/ctl/template_render.go
new file mode 100644
index 000000000..01c65f28f
--- /dev/null
+++ b/ctl/template_render.go
@@ -0,0 +1,39 @@
+package main
+
+import (
+ "bytes"
+ "fmt"
+ "html/template"
+ "io/ioutil"
+ "os"
+
+ m "github.com/halfrost/LeetCode-Go/ctl/models"
+ "github.com/halfrost/LeetCode-Go/ctl/util"
+)
+
+func makeReadmeFile(mdrows m.Mdrows) {
+ file := "./README.md"
+ os.Remove(file)
+ var b bytes.Buffer
+ tmpl := template.Must(template.New("readme").Parse(readTMPL("template.markdown")))
+ err := tmpl.Execute(&b, mdrows)
+ if err != nil {
+ fmt.Println(err)
+ }
+ // 保存 README.md 文件
+ util.WriteFile(file, b.Bytes())
+}
+
+func readTMPL(path string) string {
+ file, err := os.Open(path)
+ if err != nil {
+ fmt.Println(err)
+ }
+ defer file.Close()
+
+ data, err := ioutil.ReadAll(file)
+ if err != nil {
+ fmt.Println(err)
+ }
+ return string(data)
+}
diff --git a/ctl/util/go.mod b/ctl/util/go.mod
new file mode 100644
index 000000000..6127aeea8
--- /dev/null
+++ b/ctl/util/go.mod
@@ -0,0 +1,3 @@
+module github.com/halfrost/LeetCode-Go/ctl/util
+
+go 1.19
diff --git a/ctl/util/util.go b/ctl/util/util.go
new file mode 100644
index 000000000..4fcf5b025
--- /dev/null
+++ b/ctl/util/util.go
@@ -0,0 +1,185 @@
+package util
+
+import (
+ "bufio"
+ "fmt"
+ "io"
+ "io/ioutil"
+ "os"
+ "path/filepath"
+ "sort"
+ "strconv"
+ "strings"
+)
+
+// LoadSolutionsDir define
+func LoadSolutionsDir() ([]int, []string, int) {
+ solutionIds, soNames, total := loadFile("../leetcode/")
+ fmt.Printf("读取了 %v 道题的题解，当前目录下有 %v 个文件(可能包含 .DS_Store)，目录中有 %v 道题在尝试中\n", len(solutionIds), total, total-len(solutionIds))
+ return solutionIds, soNames, total - len(solutionIds)
+}
+
+func loadFile(path string) ([]int, []string, int) {
+ files, err := ioutil.ReadDir(path)
+ if err != nil {
+ fmt.Println(err)
+ }
+ solutionIds, soNames, solutionsMap := []int{}, []string{}, map[int]string{}
+ for _, f := range files {
+ if f.Name()[4] == '.' {
+ tmp, err := strconv.Atoi(f.Name()[:4])
+ if err != nil {
+ fmt.Println(err)
+ }
+ solutionIds = append(solutionIds, tmp)
+ solutionsMap[tmp] = f.Name()
+ }
+ }
+ sort.Ints(solutionIds)
+ for _, v := range solutionIds {
+ if name, ok := solutionsMap[v]; ok {
+ soNames = append(soNames, name)
+ }
+ }
+ return solutionIds, soNames, len(files)
+}
+
+// GetAllFile define
+func GetAllFile(pathname string, fileList *[]string) ([]string, error) {
+ rd, err := ioutil.ReadDir(pathname)
+ for _, fi := range rd {
+ if fi.IsDir() {
+ //fmt.Printf("[%s]\n", pathname+"\\"+fi.Name())
+ GetAllFile(pathname+fi.Name()+"/", fileList)
+ } else {
+ //fmt.Println(fi.Name())
+ *fileList = append(*fileList, fi.Name())
+ }
+ }
+ return *fileList, err
+}
+
+// LoadChapterFourDir define
+func LoadChapterFourDir() ([]string, []int) {
+ files, err := GetAllFile("../website/content/ChapterFour/", &[]string{})
+ // files, err := ioutil.ReadDir("../website/content/ChapterFour/")
+ if err != nil {
+ fmt.Println(err)
+ }
+ solutions, solutionIds, solutionsMap := []string{}, []int{}, map[int]string{}
+ for _, f := range files {
+ if f[4] == '.' {
+ tmp, err := strconv.Atoi(f[:4])
+ if err != nil {
+ fmt.Println(err)
+ }
+ solutionIds = append(solutionIds, tmp)
+ // len(f.Name())-3 = 文件名去掉 .md 后缀
+ solutionsMap[tmp] = f[:len(f)-3]
+ }
+ }
+ sort.Ints(solutionIds)
+ fmt.Printf("读取了第四章的 %v 道题的题解\n", len(solutionIds))
+ for _, v := range solutionIds {
+ if name, ok := solutionsMap[v]; ok {
+ solutions = append(solutions, name)
+ }
+ }
+ return solutions, solutionIds
+}
+
+// WriteFile define
+func WriteFile(fileName string, content []byte) {
+ file, err := os.OpenFile(fileName, os.O_RDWR|os.O_CREATE, 0777)
+ if err != nil {
+ fmt.Println(err)
+ }
+ defer file.Close()
+
+ _, err = file.Write(content)
+ if err != nil {
+ fmt.Println(err)
+ }
+ //fmt.Println("write file successful")
+}
+
+// LoadFile define
+func LoadFile(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
+ }
+ output = append(output, line...)
+ output = append(output, []byte("\n")...)
+ }
+}
+
+// DestoryDir define
+func DestoryDir(path string) {
+ filepath.Walk(path, func(path string, fi os.FileInfo, err error) error {
+ if nil == fi {
+ return err
+ }
+ if !fi.IsDir() {
+ return nil
+ }
+ name := fi.Name()
+ if strings.Contains(name, "temp") {
+ fmt.Println("temp file name:", path)
+ err := os.RemoveAll(path)
+ if err != nil {
+ fmt.Println("delet dir error:", err)
+ }
+ }
+ return nil
+ })
+}
+
+// CopyFile define
+func CopyFile(dstName, srcName string) (written int64, err error) {
+ src, err := os.Open(srcName)
+ if err != nil {
+ return
+ }
+ defer src.Close()
+ dst, err := os.OpenFile(dstName, os.O_WRONLY|os.O_CREATE, 0644)
+ if err != nil {
+ return
+ }
+ defer dst.Close()
+ return io.Copy(dst, src)
+}
+
+// BinarySearch define
+func BinarySearch(nums []int, target int) int {
+ low, high := 0, len(nums)-1
+ for low <= high {
+ mid := low + (high-low)>>1
+ if nums[mid] == target {
+ return mid
+ } else if nums[mid] > target {
+ high = mid - 1
+ } else {
+ low = mid + 1
+ }
+ }
+ return -1
+}
+
+// GetChpaterFourFileNum define
+func GetChpaterFourFileNum(num int) string {
+ if num < 100 {
+ return fmt.Sprintf("%04d~%04d", (num/100)*100+1, (num/100)*100+99)
+ }
+ return fmt.Sprintf("%04d~%04d", (num/100)*100, (num/100)*100+99)
+}
diff --git a/ctl/version.go b/ctl/version.go
new file mode 100644
index 000000000..c996a651a
--- /dev/null
+++ b/ctl/version.go
@@ -0,0 +1,18 @@
+package main
+
+import (
+ "fmt"
+
+ "github.com/spf13/cobra"
+)
+
+var (
+ version = "v1.0"
+ versionCmd = &cobra.Command{
+ Use: "version",
+ Short: "Prints the version of tacoctl",
+ Run: func(cmd *cobra.Command, args []string) {
+ fmt.Println("tacoctl version:", version)
+ },
+ }
+)
diff --git a/go.mod b/go.mod
new file mode 100644
index 000000000..3b163f0e1
--- /dev/null
+++ b/go.mod
@@ -0,0 +1,30 @@
+module github.com/halfrost/LeetCode-Go
+
+go 1.19
+
+replace github.com/halfrost/LeetCode-Go/structures => ./structures
+
+replace github.com/halfrost/LeetCode-Go/template => ./template
+
+replace github.com/halfrost/LeetCode-Go/ctl/util => ./ctl/util
+
+replace github.com/halfrost/LeetCode-Go/ctl/models => ./ctl/models
+
+require (
+ github.com/BurntSushi/toml v1.2.0
+ github.com/halfrost/LeetCode-Go/ctl/models v0.0.0-20220910225043-e3bb5aff34d0
+ github.com/halfrost/LeetCode-Go/ctl/util v0.0.0-20220910225043-e3bb5aff34d0
+ github.com/halfrost/LeetCode-Go/structures v0.0.0-20220910233101-aa0e2c897b18
+ github.com/halfrost/LeetCode-Go/template v0.0.0-20220910233504-e2a72e6212ce
+ github.com/mozillazg/request v0.8.0
+ github.com/spf13/cobra v1.5.0
+)
+
+require (
+ github.com/bitly/go-simplejson v0.5.0 // indirect
+ github.com/bmizerany/assert v0.0.0-20160611221934-b7ed37b82869 // indirect
+ github.com/inconshreveable/mousetrap v1.0.0 // indirect
+ github.com/kr/pretty v0.3.0 // indirect
+ github.com/spf13/pflag v1.0.5 // indirect
+ golang.org/x/net v0.7.0 // indirect
+)
diff --git a/go.sum b/go.sum
new file mode 100644
index 000000000..d1e5e64b1
--- /dev/null
+++ b/go.sum
@@ -0,0 +1,36 @@
+github.com/BurntSushi/toml v1.2.0 h1:Rt8g24XnyGTyglgET/PRUNlrUeu9F5L+7FilkXfZgs0=
+github.com/BurntSushi/toml v1.2.0/go.mod h1:CxXYINrC8qIiEnFrOxCa7Jy5BFHlXnUU2pbicEuybxQ=
+github.com/bitly/go-simplejson v0.5.0 h1:6IH+V8/tVMab511d5bn4M7EwGXZf9Hj6i2xSwkNEM+Y=
+github.com/bitly/go-simplejson v0.5.0/go.mod h1:cXHtHw4XUPsvGaxgjIAn8PhEWG9NfngEKAMDJEczWVA=
+github.com/bmizerany/assert v0.0.0-20160611221934-b7ed37b82869 h1:DDGfHa7BWjL4YnC6+E63dPcxHo2sUxDIu8g3QgEJdRY=
+github.com/bmizerany/assert v0.0.0-20160611221934-b7ed37b82869/go.mod h1:Ekp36dRnpXw/yCqJaO+ZrUyxD+3VXMFFr56k5XYrpB4=
+github.com/cpuguy83/go-md2man/v2 v2.0.2/go.mod h1:tgQtvFlXSQOSOSIRvRPT7W67SCa46tRHOmNcaadrF8o=
+github.com/creack/pty v1.1.9/go.mod h1:oKZEueFk5CKHvIhNR5MUki03XCEU+Q6VDXinZuGJ33E=
+github.com/davecgh/go-spew v1.1.1 h1:vj9j/u1bqnvCEfJOwUhtlOARqs3+rkHYY13jYWTU97c=
+github.com/inconshreveable/mousetrap v1.0.0 h1:Z8tu5sraLXCXIcARxBp/8cbvlwVa7Z1NHg9XEKhtSvM=
+github.com/inconshreveable/mousetrap v1.0.0/go.mod h1:PxqpIevigyE2G7u3NXJIT2ANytuPF1OarO4DADm73n8=
+github.com/kr/pretty v0.1.0/go.mod h1:dAy3ld7l9f0ibDNOQOHHMYYIIbhfbHSm3C4ZsoJORNo=
+github.com/kr/pretty v0.3.0 h1:WgNl7dwNpEZ6jJ9k1snq4pZsg7DOEN8hP9Xw0Tsjwk0=
+github.com/kr/pretty v0.3.0/go.mod h1:640gp4NfQd8pI5XOwp5fnNeVWj67G7CFk/SaSQn7NBk=
+github.com/kr/pty v1.1.1/go.mod h1:pFQYn66WHrOpPYNljwOMqo10TkYh1fy3cYio2l3bCsQ=
+github.com/kr/text v0.1.0/go.mod h1:4Jbv+DJW3UT/LiOwJeYQe1efqtUx/iVham/4vfdArNI=
+github.com/kr/text v0.2.0 h1:5Nx0Ya0ZqY2ygV366QzturHI13Jq95ApcVaJBhpS+AY=
+github.com/kr/text v0.2.0/go.mod h1:eLer722TekiGuMkidMxC/pM04lWEeraHUUmBw8l2grE=
+github.com/mozillazg/request v0.8.0 h1:TbXeQUdBWr1J1df5Z+lQczDFzX9JD71kTCl7Zu/9rNM=
+github.com/mozillazg/request v0.8.0/go.mod h1:weoQ/mVFNbWgRBtivCGF1tUT9lwneFesues+CleXMWc=
+github.com/pmezard/go-difflib v1.0.0 h1:4DBwDE0NGyQoBHbLQYPwSUPoCMWR5BEzIk/f1lZbAQM=
+github.com/rogpeppe/go-internal v1.6.1 h1:/FiVV8dS/e+YqF2JvO3yXRFbBLTIuSDkuC7aBOAvL+k=
+github.com/rogpeppe/go-internal v1.6.1/go.mod h1:xXDCJY+GAPziupqXw64V24skbSoqbTEfhy4qGm1nDQc=
+github.com/russross/blackfriday/v2 v2.1.0/go.mod h1:+Rmxgy9KzJVeS9/2gXHxylqXiyQDYRxCVz55jmeOWTM=
+github.com/spf13/cobra v1.5.0 h1:X+jTBEBqF0bHN+9cSMgmfuvv2VHJ9ezmFNf9Y/XstYU=
+github.com/spf13/cobra v1.5.0/go.mod h1:dWXEIy2H428czQCjInthrTRUg7yKbok+2Qi/yBIJoUM=
+github.com/spf13/pflag v1.0.5 h1:iy+VFUOCP1a+8yFto/drg2CJ5u0yRoB7fZw3DKv/JXA=
+github.com/spf13/pflag v1.0.5/go.mod h1:McXfInJRrz4CZXVZOBLb0bTZqETkiAhM9Iw0y3An2Bg=
+github.com/stretchr/testify v1.8.0 h1:pSgiaMZlXftHpm5L7V1+rVB+AZJydKsMxsQBIJw4PKk=
+golang.org/x/net v0.7.0 h1:rJrUqqhjsgNp7KqAIc25s9pZnjU7TUcSY7HcVZjdn1g=
+golang.org/x/net v0.7.0/go.mod h1:2Tu9+aMcznHK/AK1HMvgo6xiTLG5rD5rZLDS+rp2Bjs=
+gopkg.in/check.v1 v0.0.0-20161208181325-20d25e280405/go.mod h1:Co6ibVJAznAaIkqp8huTwlJQCZ016jof/cbN4VW5Yz0=
+gopkg.in/check.v1 v1.0.0-20180628173108-788fd7840127/go.mod h1:Co6ibVJAznAaIkqp8huTwlJQCZ016jof/cbN4VW5Yz0=
+gopkg.in/errgo.v2 v2.1.0/go.mod h1:hNsd1EY+bozCKY1Ytp96fpM3vjJbqLJn88ws8XvfDNI=
+gopkg.in/yaml.v2 v2.4.0/go.mod h1:RDklbk79AGWmwhnvt/jBztapEOGDOx6ZbXqjP6csGnQ=
+gopkg.in/yaml.v3 v3.0.1 h1:fxVm/GzAzEWqLHuvctI91KS9hhNmmWOoWu0XTYJS7CA=
diff --git a/leetcode/0003.Longest-Substring-Without-Repeating-Characters/3. Longest Substring Without Repeating Characters.go b/leetcode/0003.Longest-Substring-Without-Repeating-Characters/3. Longest Substring Without Repeating Characters.go
index 672dbdb54..541f868de 100644
--- a/leetcode/0003.Longest-Substring-Without-Repeating-Characters/3. Longest Substring Without Repeating Characters.go
+++ b/leetcode/0003.Longest-Substring-Without-Repeating-Characters/3. Longest Substring Without Repeating Characters.go
@@ -8,7 +8,7 @@ func lengthOfLongestSubstring(s string) int {
var bitSet [256]bool
result, left, right := 0, 0, 0
for left < len(s) {
- // 右侧字符对应的bitSet被标记true，说明此字符在X位置重复，需要左侧向前移动，直到将X标记为false
+ // 右侧字符对应的 bitSet 被标记 true，说明此字符在 X 位置重复，需要左侧向前移动，直到将 X 标记为 false
if bitSet[s[right]] {
bitSet[s[left]] = false
left++
@@ -27,19 +27,20 @@ func lengthOfLongestSubstring(s string) int {
}
// 解法二 滑动窗口
-func lengthOfLongestSubstring_(s string) int {
+func lengthOfLongestSubstring1(s string) int {
if len(s) == 0 {
return 0
}
- var freq [256]int
+ var freq [127]int
result, left, right := 0, 0, -1
for left < len(s) {
- if right+1 < len(s) && freq[s[right+1]-'a'] == 0 {
- freq[s[right+1]-'a']++
+ if right+1 < len(s) && freq[s[right+1]] == 0 {
+ freq[s[right+1]]++
right++
+
} else {
- freq[s[left]-'a']--
+ freq[s[left]]--
left++
}
result = max(result, right-left+1)
@@ -47,6 +48,21 @@ func lengthOfLongestSubstring_(s string) int {
return result
}
+// 解法三 滑动窗口-哈希桶
+func lengthOfLongestSubstring2(s string) int {
+ right, left, res := 0, 0, 0
+ indexes := make(map[byte]int, len(s))
+ for left < len(s) {
+ if idx, ok := indexes[s[left]]; ok && idx >= right {
+ right = idx + 1
+ }
+ indexes[s[left]] = left
+ left++
+ res = max(res, left-right)
+ }
+ return res
+}
+
func max(a int, b int) int {
if a > b {
return a
diff --git a/leetcode/0003.Longest-Substring-Without-Repeating-Characters/3. Longest Substring Without Repeating Characters_test.go b/leetcode/0003.Longest-Substring-Without-Repeating-Characters/3. Longest Substring Without Repeating Characters_test.go
index 5dc9bcd2a..7eebdbfa8 100644
--- a/leetcode/0003.Longest-Substring-Without-Repeating-Characters/3. Longest Substring Without Repeating Characters_test.go
+++ b/leetcode/0003.Longest-Substring-Without-Repeating-Characters/3. Longest Substring Without Repeating Characters_test.go
@@ -51,7 +51,7 @@ func Test_Problem3(t *testing.T) {
for _, q := range qs {
_, p := q.ans3, q.para3
- fmt.Printf("【input】:%v 【output】:%v\n", p, lengthOfLongestSubstring_(p.s))
+ fmt.Printf("【input】:%v 【output】:%v\n", p, lengthOfLongestSubstring(p.s))
}
fmt.Printf("\n\n\n")
}
diff --git a/leetcode/0003.Longest-Substring-Without-Repeating-Characters/README.md b/leetcode/0003.Longest-Substring-Without-Repeating-Characters/README.md
index 15ecc0ebe..9f80ab4a5 100644
--- a/leetcode/0003.Longest-Substring-Without-Repeating-Characters/README.md
+++ b/leetcode/0003.Longest-Substring-Without-Repeating-Characters/README.md
@@ -34,7 +34,7 @@ Explanation: The answer is "wke", with the length of 3.
## 题目大意
-在一个字符串重寻找没有重复字母的最长子串。
+在一个字符串中寻找没有重复字母的最长子串。
## 解题思路
diff --git a/leetcode/0004.Median-of-Two-Sorted-Arrays/README.md b/leetcode/0004.Median-of-Two-Sorted-Arrays/README.md
index c6537dbcd..1840f2833 100755
--- a/leetcode/0004.Median-of-Two-Sorted-Arrays/README.md
+++ b/leetcode/0004.Median-of-Two-Sorted-Arrays/README.md
@@ -39,7 +39,7 @@ You may assume **nums1** and **nums2** cannot be both empty.
- 给出两个有序数组，要求找出这两个数组合并以后的有序数组中的中位数。要求时间复杂度为 O(log (m+n))。
-- 这一题最容易想到的办法是把两个数组合并，然后取出中位数。但是合并有序数组的操作是 `O(max(n,m))` 的，不符合题意。看到题目给的 `log` 的时间复杂度，很容易联想到二分搜索。
+- 这一题最容易想到的办法是把两个数组合并，然后取出中位数。但是合并有序数组的操作是 `O(m+n)` 的，不符合题意。看到题目给的 `log` 的时间复杂度，很容易联想到二分搜索。
- 由于要找到最终合并以后数组的中位数，两个数组的总大小也知道，所以中间这个位置也是知道的。只需要二分搜索一个数组中切分的位置，另一个数组中切分的位置也能得到。为了使得时间复杂度最小，所以二分搜索两个数组中长度较小的那个数组。
- 关键的问题是如何切分数组 1 和数组 2 。其实就是如何切分数组 1 。先随便二分产生一个 `midA`，切分的线何时算满足了中位数的条件呢？即，线左边的数都小于右边的数，即，`nums1[midA-1] ≤ nums2[midB] && nums2[midB-1] ≤ nums1[midA]` 。如果这些条件都不满足，切分线就需要调整。如果 `nums1[midA] < nums2[midB-1]`，说明 `midA` 这条线划分出来左边的数小了，切分线应该右移；如果 `nums1[midA-1] > nums2[midB]`，说明 midA 这条线划分出来左边的数大了，切分线应该左移。经过多次调整以后，切分线总能找到满足条件的解。
- 假设现在找到了切分的两条线了，`数组 1` 在切分线两边的下标分别是 `midA - 1` 和 `midA`。`数组 2` 在切分线两边的下标分别是 `midB - 1` 和 `midB`。最终合并成最终数组，如果数组长度是奇数，那么中位数就是 `max(nums1[midA-1], nums2[midB-1])`。如果数组长度是偶数，那么中间位置的两个数依次是：`max(nums1[midA-1], nums2[midB-1])` 和 `min(nums1[midA], nums2[midB])`，那么中位数就是 `(max(nums1[midA-1], nums2[midB-1]) + min(nums1[midA], nums2[midB])) / 2`。图示见下图：
diff --git a/leetcode/0005.Longest-Palindromic-Substring/5. Longest Palindromic Substring.go b/leetcode/0005.Longest-Palindromic-Substring/5. Longest Palindromic Substring.go
new file mode 100644
index 000000000..4ede2f1a5
--- /dev/null
+++ b/leetcode/0005.Longest-Palindromic-Substring/5. Longest Palindromic Substring.go
@@ -0,0 +1,117 @@
+package leetcode
+
+// 解法一 Manacher's algorithm，时间复杂度 O(n)，空间复杂度 O(n)
+func longestPalindrome(s string) string {
+ if len(s) < 2 {
+ return s
+ }
+ newS := make([]rune, 0)
+ newS = append(newS, '#')
+ for _, c := range s {
+ newS = append(newS, c)
+ newS = append(newS, '#')
+ }
+ // dp[i]: 以预处理字符串下标 i 为中心的回文半径(奇数长度时不包括中心)
+ // maxRight: 通过中心扩散的方式能够扩散的最右边的下标
+ // center: 与 maxRight 对应的中心字符的下标
+ // maxLen: 记录最长回文串的半径
+ // begin: 记录最长回文串在起始串 s 中的起始下标
+ dp, maxRight, center, maxLen, begin := make([]int, len(newS)), 0, 0, 1, 0
+ for i := 0; i < len(newS); i++ {
+ if i < maxRight {
+ // 这一行代码是 Manacher 算法的关键所在
+ dp[i] = min(maxRight-i, dp[2*center-i])
+ }
+ // 中心扩散法更新 dp[i]
+ left, right := i-(1+dp[i]), i+(1+dp[i])
+ for left >= 0 && right < len(newS) && newS[left] == newS[right] {
+ dp[i]++
+ left--
+ right++
+ }
+ // 更新 maxRight，它是遍历过的 i 的 i + dp[i] 的最大者
+ if i+dp[i] > maxRight {
+ maxRight = i + dp[i]
+ center = i
+ }
+ // 记录最长回文子串的长度和相应它在原始字符串中的起点
+ if dp[i] > maxLen {
+ maxLen = dp[i]
+ begin = (i - maxLen) / 2 // 这里要除以 2 因为有我们插入的辅助字符 #
+ }
+ }
+ return s[begin : begin+maxLen]
+}
+
+func min(x, y int) int {
+ if x < y {
+ return x
+ }
+ return y
+}
+
+// 解法二 滑动窗口，时间复杂度 O(n^2)，空间复杂度 O(1)
+func longestPalindrome1(s string) string {
+ if len(s) == 0 {
+ return ""
+ }
+ left, right, pl, pr := 0, -1, 0, 0
+ for left < len(s) {
+ // 移动到相同字母的最右边（如果有相同字母）
+ for right+1 < len(s) && s[left] == s[right+1] {
+ right++
+ }
+ // 找到回文的边界
+ for left-1 >= 0 && right+1 < len(s) && s[left-1] == s[right+1] {
+ left--
+ right++
+ }
+ if right-left > pr-pl {
+ pl, pr = left, right
+ }
+ // 重置到下一次寻找回文的中心
+ left = (left+right)/2 + 1
+ right = left
+ }
+ return s[pl : pr+1]
+}
+
+// 解法三 中心扩散法，时间复杂度 O(n^2)，空间复杂度 O(1)
+func longestPalindrome2(s string) string {
+ res := ""
+ for i := 0; i < len(s); i++ {
+ res = maxPalindrome(s, i, i, res)
+ res = maxPalindrome(s, i, i+1, res)
+ }
+ return res
+}
+
+func maxPalindrome(s string, i, j int, res string) string {
+ sub := ""
+ for i >= 0 && j < len(s) && s[i] == s[j] {
+ sub = s[i : j+1]
+ i--
+ j++
+ }
+ if len(res) < len(sub) {
+ return sub
+ }
+ return res
+}
+
+// 解法四 DP，时间复杂度 O(n^2)，空间复杂度 O(n^2)
+func longestPalindrome3(s string) string {
+ res, dp := "", make([][]bool, len(s))
+ for i := 0; i < len(s); i++ {
+ dp[i] = make([]bool, len(s))
+ }
+ for i := len(s) - 1; i >= 0; i-- {
+ for j := i; j < len(s); j++ {
+ dp[i][j] = (s[i] == s[j]) && ((j-i < 3) || dp[i+1][j-1])
+ if dp[i][j] && (res == "" || j-i+1 > len(res)) {
+ res = s[i : j+1]
+ }
+ }
+ }
+ return res
+}
diff --git a/leetcode/0005.Longest-Palindromic-Substring/5. Longest Palindromic Substring_test.go b/leetcode/0005.Longest-Palindromic-Substring/5. Longest Palindromic Substring_test.go
new file mode 100644
index 000000000..de64571bd
--- /dev/null
+++ b/leetcode/0005.Longest-Palindromic-Substring/5. Longest Palindromic Substring_test.go
@@ -0,0 +1,67 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question5 struct {
+ para5
+ ans5
+}
+
+// para 是参数
+// one 代表第一个参数
+type para5 struct {
+ s string
+}
+
+// ans 是答案
+// one 代表第一个答案
+type ans5 struct {
+ one string
+}
+
+func Test_Problem5(t *testing.T) {
+
+ qs := []question5{
+
+ {
+ para5{"babad"},
+ ans5{"bab"},
+ },
+
+ {
+ para5{"cbbd"},
+ ans5{"bb"},
+ },
+
+ {
+ para5{"a"},
+ ans5{"a"},
+ },
+
+ {
+ para5{"ac"},
+ ans5{"a"},
+ },
+
+ {
+ para5{"aa"},
+ ans5{"aa"},
+ },
+
+ {
+ para5{"ajgiljtperkvubjmdsefcylksrxtftqrehoitdgdtttswwttmfuvwgwrruuqmxttzsbmuhgfaoueumvbhajqsaxkkihjwevzzedizmrsmpxqavyryklbotwzngxscvyuqjkkaotitddlhhnutmotupwuwyltebtsdfssbwayuxrbgihmtphshdslktvsjadaykyjivbzhwujcdvzdxxfiixnzrmusqvwujjmxhbqbdpauacnzojnzxxgrkmupadfcsujkcwajsgintahwgbjnvjqubcxajdyyapposrkpqtpqfjcvbhlmwfutgognqxgaukpmdyaxghgoqkqnigcllachmwzrazwhpppmsodvxilrccfqgpkmdqhoorxpyjsrtbeeidsinpeyxxpsjnymxkouskyhenzgieybwkgzrhhrzgkwbyeigznehyksuokxmynjspxxyepnisdieebtrsjypxroohqdmkpgqfccrlixvdosmppphwzarzwmhcallcginqkqoghgxaydmpkuagxqngogtufwmlhbvcjfqptqpkrsoppayydjaxcbuqjvnjbgwhatnigsjawckjuscfdapumkrgxxznjozncauapdbqbhxmjjuwvqsumrznxiifxxdzvdcjuwhzbvijykyadajsvtklsdhshptmhigbrxuyawbssfdstbetlywuwputomtunhhlddtitoakkjquyvcsxgnzwtoblkyryvaqxpmsrmzidezzvewjhikkxasqjahbvmueuoafghumbszttxmquurrwgwvufmttwwstttdgdtioherqtftxrsklycfesdmjbuvkreptjligja"},
+ ans5{"ajgiljtperkvubjmdsefcylksrxtftqrehoitdgdtttswwttmfuvwgwrruuqmxttzsbmuhgfaoueumvbhajqsaxkkihjwevzzedizmrsmpxqavyryklbotwzngxscvyuqjkkaotitddlhhnutmotupwuwyltebtsdfssbwayuxrbgihmtphshdslktvsjadaykyjivbzhwujcdvzdxxfiixnzrmusqvwujjmxhbqbdpauacnzojnzxxgrkmupadfcsujkcwajsgintahwgbjnvjqubcxajdyyapposrkpqtpqfjcvbhlmwfutgognqxgaukpmdyaxghgoqkqnigcllachmwzrazwhpppmsodvxilrccfqgpkmdqhoorxpyjsrtbeeidsinpeyxxpsjnymxkouskyhenzgieybwkgzrhhrzgkwbyeigznehyksuokxmynjspxxyepnisdieebtrsjypxroohqdmkpgqfccrlixvdosmppphwzarzwmhcallcginqkqoghgxaydmpkuagxqngogtufwmlhbvcjfqptqpkrsoppayydjaxcbuqjvnjbgwhatnigsjawckjuscfdapumkrgxxznjozncauapdbqbhxmjjuwvqsumrznxiifxxdzvdcjuwhzbvijykyadajsvtklsdhshptmhigbrxuyawbssfdstbetlywuwputomtunhhlddtitoakkjquyvcsxgnzwtoblkyryvaqxpmsrmzidezzvewjhikkxasqjahbvmueuoafghumbszttxmquurrwgwvufmttwwstttdgdtioherqtftxrsklycfesdmjbuvkreptjligja"},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 5------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans5, q.para5
+ fmt.Printf("【input】:%v 【output】:%v\n", p, longestPalindrome(p.s))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/0005.Longest-Palindromic-Substring/README.md b/leetcode/0005.Longest-Palindromic-Substring/README.md
new file mode 100644
index 000000000..e02c14561
--- /dev/null
+++ b/leetcode/0005.Longest-Palindromic-Substring/README.md
@@ -0,0 +1,186 @@
+# [5. Longest Palindromic Substring](https://leetcode.com/problems/longest-palindromic-substring/)
+
+
+## 题目
+
+Given a string `s`, return *the longest palindromic substring* in `s`.
+
+**Example 1:**
+
+```
+Input: s = "babad"
+Output: "bab"
+Note: "aba" is also a valid answer.
+
+```
+
+**Example 2:**
+
+```
+Input: s = "cbbd"
+Output: "bb"
+
+```
+
+**Example 3:**
+
+```
+Input: s = "a"
+Output: "a"
+
+```
+
+**Example 4:**
+
+```
+Input: s = "ac"
+Output: "a"
+
+```
+
+**Constraints:**
+
+- `1 <= s.length <= 1000`
+- `s` consist of only digits and English letters (lower-case and/or upper-case),
+
+## 题目大意
+
+给你一个字符串 `s`，找到 `s` 中最长的回文子串。
+
+## 解题思路
+
+- 此题非常经典，并且有多种解法。
+- 解法一，动态规划。定义 `dp[i][j]` 表示从字符串第 `i` 个字符到第 `j` 个字符这一段子串是否是回文串。由回文串的性质可以得知，回文串去掉一头一尾相同的字符以后，剩下的还是回文串。所以状态转移方程是 `dp[i][j] = (s[i] == s[j]) && ((j-i < 3) || dp[i+1][j-1])`，注意特殊的情况，`j - i == 1` 的时候，即只有 2 个字符的情况，只需要判断这 2 个字符是否相同即可。`j - i == 2` 的时候，即只有 3 个字符的情况，只需要判断除去中心以外对称的 2 个字符是否相等。每次循环动态维护保存最长回文串即可。时间复杂度 O(n^2)，空间复杂度 O(n^2)。
+- 解法二，中心扩散法。动态规划的方法中，我们将任意起始，终止范围内的字符串都判断了一遍。其实没有这个必要，如果不是最长回文串，无需判断并保存结果。所以动态规划的方法在空间复杂度上还有优化空间。判断回文有一个核心问题是找到“轴心”。如果长度是偶数，那么轴心是中心虚拟的，如果长度是奇数，那么轴心正好是正中心的那个字母。中心扩散法的思想是枚举每个轴心的位置。然后做两次假设，假设最长回文串是偶数，那么以虚拟中心往 2 边扩散；假设最长回文串是奇数，那么以正中心的字符往 2 边扩散。扩散的过程就是对称判断两边字符是否相等的过程。这个方法时间复杂度和动态规划是一样的，但是空间复杂度降低了。时间复杂度 O(n^2)，空间复杂度 O(1)。
+- 解法三，滑动窗口。这个写法其实就是中心扩散法变了一个写法。中心扩散是依次枚举每一个轴心。滑动窗口的方法稍微优化了一点，有些轴心两边字符不相等，下次就不会枚举这些不可能形成回文子串的轴心了。不过这点优化并没有优化时间复杂度，时间复杂度 O(n^2)，空间复杂度 O(1)。
+- 解法四，马拉车算法。这个算法是本题的最优解，也是最复杂的解法。时间复杂度 O(n)，空间复杂度 O(n)。中心扩散法有 2 处有重复判断，第一处是每次都往两边扩散，不同中心扩散多次，实际上有很多重复判断的字符，能否不重复判断？第二处，中心能否跳跃选择，不是每次都枚举，是否可以利用前一次的信息，跳跃选择下一次的中心？马拉车算法针对重复判断的问题做了优化，增加了一个辅助数组，将时间复杂度从 O(n^2) 优化到了 O(n)，空间换了时间，空间复杂度增加到 O(n)。
+
+ 
+
+- 首先是预处理，向字符串的头尾以及每两个字符中间添加一个特殊字符 `#`，比如字符串 `aaba` 处理后会变成 `#a#a#b#a#`。那么原先长度为偶数的回文字符串 `aa` 会变成长度为奇数的回文字符串 `#a#a#`，而长度为奇数的回文字符串 `aba` 会变成长度仍然为奇数的回文字符串 `#a#b#a#`，经过预处理以后，都会变成长度为奇数的字符串。**注意这里的特殊字符不需要是没有出现过的字母，也可以使用任何一个字符来作为这个特殊字符。**这是因为，当我们只考虑长度为奇数的回文字符串时，每次我们比较的两个字符奇偶性一定是相同的，所以原来字符串中的字符不会与插入的特殊字符互相比较，不会因此产生问题。**预处理以后，以某个中心扩散的步数和实际字符串长度是相等的。**因为半径里面包含了插入的特殊字符，又由于左右对称的性质，所以扩散半径就等于原来回文子串的长度。
+
+ 
+
+- 核心部分是如何通过左边已经扫描过的数据推出右边下一次要扩散的中心。这里定义下一次要扩散的中心下标是 `i`。如果 `i` 比 `maxRight` 要小，只能继续中心扩散。如果 `i` 比 `maxRight` 大，这是又分为 3 种情况。三种情况见上图。将上述 3 种情况总结起来，就是 ：`dp[i] = min(maxRight-i, dp[2*center-i])`，其中，`mirror` 相对于 `center` 是和 `i` 中心对称的，所以它的下标可以计算出来是 `2*center-i`。更新完 `dp[i]` 以后，就要进行中心扩散了。中心扩散以后动态维护最长回文串并相应的更新 `center`，`maxRight`，并且记录下原始字符串的起始位置 `begin` 和 `maxLen`。
+
+## 代码
+
+```go
+package leetcode
+
+// 解法一 Manacher's algorithm，时间复杂度 O(n)，空间复杂度 O(n)
+func longestPalindrome(s string) string {
+ if len(s) < 2 {
+ return s
+ }
+ newS := make([]rune, 0)
+ newS = append(newS, '#')
+ for _, c := range s {
+ newS = append(newS, c)
+ newS = append(newS, '#')
+ }
+ // dp[i]: 以预处理字符串下标 i 为中心的回文半径(奇数长度时不包括中心)
+ // maxRight: 通过中心扩散的方式能够扩散的最右边的下标
+ // center: 与 maxRight 对应的中心字符的下标
+ // maxLen: 记录最长回文串的半径
+ // begin: 记录最长回文串在起始串 s 中的起始下标
+ dp, maxRight, center, maxLen, begin := make([]int, len(newS)), 0, 0, 1, 0
+ for i := 0; i < len(newS); i++ {
+ if i < maxRight {
+ // 这一行代码是 Manacher 算法的关键所在
+ dp[i] = min(maxRight-i, dp[2*center-i])
+ }
+ // 中心扩散法更新 dp[i]
+ left, right := i-(1+dp[i]), i+(1+dp[i])
+ for left >= 0 && right < len(newS) && newS[left] == newS[right] {
+ dp[i]++
+ left--
+ right++
+ }
+ // 更新 maxRight，它是遍历过的 i 的 i + dp[i] 的最大者
+ if i+dp[i] > maxRight {
+ maxRight = i + dp[i]
+ center = i
+ }
+ // 记录最长回文子串的长度和相应它在原始字符串中的起点
+ if dp[i] > maxLen {
+ maxLen = dp[i]
+ begin = (i - maxLen) / 2 // 这里要除以 2 因为有我们插入的辅助字符 #
+ }
+ }
+ return s[begin : begin+maxLen]
+}
+
+func min(x, y int) int {
+ if x < y {
+ return x
+ }
+ return y
+}
+
+// 解法二 滑动窗口，时间复杂度 O(n^2)，空间复杂度 O(1)
+func longestPalindrome1(s string) string {
+ if len(s) == 0 {
+ return ""
+ }
+ left, right, pl, pr := 0, -1, 0, 0
+ for left < len(s) {
+ // 移动到相同字母的最右边（如果有相同字母）
+ for right+1 < len(s) && s[left] == s[right+1] {
+ right++
+ }
+ // 找到回文的边界
+ for left-1 >= 0 && right+1 < len(s) && s[left-1] == s[right+1] {
+ left--
+ right++
+ }
+ if right-left > pr-pl {
+ pl, pr = left, right
+ }
+ // 重置到下一次寻找回文的中心
+ left = (left+right)/2 + 1
+ right = left
+ }
+ return s[pl : pr+1]
+}
+
+// 解法三 中心扩散法，时间复杂度 O(n^2)，空间复杂度 O(1)
+func longestPalindrome2(s string) string {
+ res := ""
+ for i := 0; i < len(s); i++ {
+ res = maxPalindrome(s, i, i, res)
+ res = maxPalindrome(s, i, i+1, res)
+ }
+ return res
+}
+
+func maxPalindrome(s string, i, j int, res string) string {
+ sub := ""
+ for i >= 0 && j < len(s) && s[i] == s[j] {
+ sub = s[i : j+1]
+ i--
+ j++
+ }
+ if len(res) < len(sub) {
+ return sub
+ }
+ return res
+}
+
+// 解法四 DP，时间复杂度 O(n^2)，空间复杂度 O(n^2)
+func longestPalindrome3(s string) string {
+ res, dp := "", make([][]bool, len(s))
+ for i := 0; i < len(s); i++ {
+ dp[i] = make([]bool, len(s))
+ }
+ for i := len(s) - 1; i >= 0; i-- {
+ for j := i; j < len(s); j++ {
+ dp[i][j] = (s[i] == s[j]) && ((j-i < 3) || dp[i+1][j-1])
+ if dp[i][j] && (res == "" || j-i+1 > len(res)) {
+ res = s[i : j+1]
+ }
+ }
+ }
+ return res
+}
+```
\ No newline at end of file
diff --git a/leetcode/0006.ZigZag-Conversion/6. ZigZag Conversion.go b/leetcode/0006.ZigZag-Conversion/6. ZigZag Conversion.go
new file mode 100644
index 000000000..e35454ab2
--- /dev/null
+++ b/leetcode/0006.ZigZag-Conversion/6. ZigZag Conversion.go
@@ -0,0 +1,26 @@
+package leetcode
+
+func convert(s string, numRows int) string {
+ matrix, down, up := make([][]byte, numRows, numRows), 0, numRows-2
+ for i := 0; i != len(s); {
+ if down != numRows {
+ matrix[down] = append(matrix[down], byte(s[i]))
+ down++
+ i++
+ } else if up > 0 {
+ matrix[up] = append(matrix[up], byte(s[i]))
+ up--
+ i++
+ } else {
+ up = numRows - 2
+ down = 0
+ }
+ }
+ solution := make([]byte, 0, len(s))
+ for _, row := range matrix {
+ for _, item := range row {
+ solution = append(solution, item)
+ }
+ }
+ return string(solution)
+}
diff --git a/leetcode/0006.ZigZag-Conversion/6. ZigZag Conversion_test.go b/leetcode/0006.ZigZag-Conversion/6. ZigZag Conversion_test.go
new file mode 100644
index 000000000..c6bbd8242
--- /dev/null
+++ b/leetcode/0006.ZigZag-Conversion/6. ZigZag Conversion_test.go
@@ -0,0 +1,53 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question6 struct {
+ para6
+ ans6
+}
+
+// para 是参数
+// one 代表第一个参数
+type para6 struct {
+ s string
+ numRows int
+}
+
+// ans 是答案
+// one 代表第一个答案
+type ans6 struct {
+ one string
+}
+
+func Test_Problem6(t *testing.T) {
+
+ qs := []question6{
+
+ {
+ para6{"PAYPALISHIRING", 3},
+ ans6{"PAHNAPLSIIGYIR"},
+ },
+
+ {
+ para6{"PAYPALISHIRING", 4},
+ ans6{"PINALSIGYAHRPI"},
+ },
+
+ {
+ para6{"A", 1},
+ ans6{"A"},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 6------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans6, q.para6
+ fmt.Printf("【input】:%v 【output】:%v\n", p, convert(p.s, p.numRows))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/0006.ZigZag-Conversion/README.md b/leetcode/0006.ZigZag-Conversion/README.md
new file mode 100644
index 000000000..b281e084c
--- /dev/null
+++ b/leetcode/0006.ZigZag-Conversion/README.md
@@ -0,0 +1,107 @@
+# [6. ZigZag Conversion](https://leetcode.com/problems/zigzag-conversion/)
+
+
+## 题目
+
+The string `"PAYPALISHIRING"` is written in a zigzag pattern on a given number of rows like this: (you may want to display this pattern in a fixed font for better legibility)
+
+```
+P A H N
+A P L S I I G
+Y I R
+```
+
+And then read line by line: `"PAHNAPLSIIGYIR"`
+
+Write the code that will take a string and make this conversion given a number of rows:
+
+```
+string convert(string s, int numRows);
+```
+
+**Example 1:**
+
+```
+Input: s = "PAYPALISHIRING", numRows = 3
+Output: "PAHNAPLSIIGYIR"
+```
+
+**Example 2:**
+
+```
+Input: s = "PAYPALISHIRING", numRows = 4
+Output: "PINALSIGYAHRPI"
+Explanation:
+P I N
+A L S I G
+Y A H R
+P I
+```
+
+**Example 3:**
+
+```
+Input: s = "A", numRows = 1
+Output: "A"
+```
+
+**Constraints:**
+
+- `1 <= s.length <= 1000`
+- `s` consists of English letters (lower-case and upper-case), `','` and `'.'`.
+- `1 <= numRows <= 1000`
+
+## 题目大意
+
+将一个给定字符串 `s` 根据给定的行数 `numRows` ，以从上往下、从左到右进行 Z 字形排列。
+
+比如输入字符串为 `"PAYPALISHIRING"` 行数为 3 时，排列如下：
+
+```go
+P A H N
+A P L S I I G
+Y I R
+```
+
+之后，你的输出需要从左往右逐行读取，产生出一个新的字符串，比如：`"PAHNAPLSIIGYIR"`。
+
+请你实现这个将字符串进行指定行数变换的函数：
+
+```go
+string convert(string s, int numRows);
+```
+
+## 解题思路
+
+- 这一题没有什么算法思想，考察的是对程序控制的能力。用 2 个变量保存方向，当垂直输出的行数达到了规定的目标行数以后，需要从下往上转折到第一行，循环中控制好方向ji
+
+## 代码
+
+```go
+package leetcode
+
+func convert(s string, numRows int) string {
+ matrix, down, up := make([][]byte, numRows, numRows), 0, numRows-2
+ for i := 0; i != len(s); {
+ if down != numRows {
+ matrix[down] = append(matrix[down], byte(s[i]))
+ down++
+ i++
+ } else if up > 0 {
+ matrix[up] = append(matrix[up], byte(s[i]))
+ up--
+ i++
+ } else {
+ up = numRows - 2
+ down = 0
+ }
+ }
+ solution := make([]byte, 0, len(s))
+ for _, row := range matrix {
+ for _, item := range row {
+ solution = append(solution, item)
+ }
+ }
+ return string(solution)
+}
+```
\ No newline at end of file
diff --git a/leetcode/0008.String-to-Integer-atoi/8. String to Integer atoi.go b/leetcode/0008.String-to-Integer-atoi/8. String to Integer atoi.go
new file mode 100644
index 000000000..24a04676d
--- /dev/null
+++ b/leetcode/0008.String-to-Integer-atoi/8. String to Integer atoi.go
@@ -0,0 +1,56 @@
+package leetcode
+
+func myAtoi(s string) int {
+ maxInt, signAllowed, whitespaceAllowed, sign, digits := int64(2<<30), true, true, 1, []int{}
+ for _, c := range s {
+ if c == ' ' && whitespaceAllowed {
+ continue
+ }
+ if signAllowed {
+ if c == '+' {
+ signAllowed = false
+ whitespaceAllowed = false
+ continue
+ } else if c == '-' {
+ sign = -1
+ signAllowed = false
+ whitespaceAllowed = false
+ continue
+ }
+ }
+ if c < '0' || c > '9' {
+ break
+ }
+ whitespaceAllowed, signAllowed = false, false
+ digits = append(digits, int(c-48))
+ }
+ var num, place int64
+ place, num = 1, 0
+ lastLeading0Index := -1
+ for i, d := range digits {
+ if d == 0 {
+ lastLeading0Index = i
+ } else {
+ break
+ }
+ }
+ if lastLeading0Index > -1 {
+ digits = digits[lastLeading0Index+1:]
+ }
+ var rtnMax int64
+ if sign > 0 {
+ rtnMax = maxInt - 1
+ } else {
+ rtnMax = maxInt
+ }
+ digitsCount := len(digits)
+ for i := digitsCount - 1; i >= 0; i-- {
+ num += int64(digits[i]) * place
+ place *= 10
+ if digitsCount-i > 10 || num > rtnMax {
+ return int(int64(sign) * rtnMax)
+ }
+ }
+ num *= int64(sign)
+ return int(num)
+}
diff --git a/leetcode/0008.String-to-Integer-atoi/8. String to Integer atoi_test.go b/leetcode/0008.String-to-Integer-atoi/8. String to Integer atoi_test.go
new file mode 100644
index 000000000..92b769ed4
--- /dev/null
+++ b/leetcode/0008.String-to-Integer-atoi/8. String to Integer atoi_test.go
@@ -0,0 +1,62 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question8 struct {
+ para8
+ ans8
+}
+
+// para 是参数
+// one 代表第一个参数
+type para8 struct {
+ one string
+}
+
+// ans 是答案
+// one 代表第一个答案
+type ans8 struct {
+ one int
+}
+
+func Test_Problem8(t *testing.T) {
+
+ qs := []question8{
+
+ {
+ para8{"42"},
+ ans8{42},
+ },
+
+ {
+ para8{" -42"},
+ ans8{-42},
+ },
+
+ {
+ para8{"4193 with words"},
+ ans8{4193},
+ },
+
+ {
+ para8{"words and 987"},
+ ans8{0},
+ },
+
+ {
+ para8{"-91283472332"},
+ ans8{-2147483648},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 8------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans8, q.para8
+ fmt.Printf("【input】:%v 【output】:%v\n", p.one, myAtoi(p.one))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/0008.String-to-Integer-atoi/README.md b/leetcode/0008.String-to-Integer-atoi/README.md
new file mode 100644
index 000000000..677ed3340
--- /dev/null
+++ b/leetcode/0008.String-to-Integer-atoi/README.md
@@ -0,0 +1,192 @@
+# [8. String to Integer (atoi)](https://leetcode.com/problems/string-to-integer-atoi/)
+
+
+## 题目
+
+Implement the `myAtoi(string s)` function, which converts a string to a 32-bit signed integer (similar to C/C++'s `atoi` function).
+
+The algorithm for `myAtoi(string s)` is as follows:
+
+1. Read in and ignore any leading whitespace.
+2. Check if the next character (if not already at the end of the string) is `'-'` or `'+'`. Read this character in if it is either. This determines if the final result is negative or positive respectively. Assume the result is positive if neither is present.
+3. Read in next the characters until the next non-digit charcter or the end of the input is reached. The rest of the string is ignored.
+4. Convert these digits into an integer (i.e. `"123" -> 123`, `"0032" -> 32`). If no digits were read, then the integer is `0`. Change the sign as necessary (from step 2).
+5. If the integer is out of the 32-bit signed integer range `[-231, 231 - 1]`, then clamp the integer so that it remains in the range. Specifically, integers less than `231` should be clamped to `231`, and integers greater than `231 - 1` should be clamped to `231 - 1`.
+6. Return the integer as the final result.
+
+**Note:**
+
+- Only the space character `' '` is considered a whitespace character.
+- **Do not ignore** any characters other than the leading whitespace or the rest of the string after the digits.
+
+**Example 1:**
+
+```
+Input: s = "42"
+Output: 42
+Explanation: The underlined characters are what is read in, the caret is the current reader position.
+Step 1: "42" (no characters read because there is no leading whitespace)
+ ^
+Step 2: "42" (no characters read because there is neither a '-' nor '+')
+ ^
+Step 3: "42" ("42" is read in)
+ ^
+The parsed integer is 42.
+Since 42 is in the range [-231, 231 - 1], the final result is 42.
+
+```
+
+**Example 2:**
+
+```
+Input: s = " -42"
+Output: -42
+Explanation:
+Step 1: " -42" (leading whitespace is read and ignored)
+ ^
+Step 2: " -42" ('-' is read, so the result should be negative)
+ ^
+Step 3: " -42" ("42" is read in)
+ ^
+The parsed integer is -42.
+Since -42 is in the range [-231, 231 - 1], the final result is -42.
+
+```
+
+**Example 3:**
+
+```
+Input: s = "4193 with words"
+Output: 4193
+Explanation:
+Step 1: "4193 with words" (no characters read because there is no leading whitespace)
+ ^
+Step 2: "4193 with words" (no characters read because there is neither a '-' nor '+')
+ ^
+Step 3: "4193 with words" ("4193" is read in; reading stops because the next character is a non-digit)
+ ^
+The parsed integer is 4193.
+Since 4193 is in the range [-231, 231 - 1], the final result is 4193.
+
+```
+
+**Example 4:**
+
+```
+Input: s = "words and 987"
+Output: 0
+Explanation:
+Step 1: "words and 987" (no characters read because there is no leading whitespace)
+ ^
+Step 2: "words and 987" (no characters read because there is neither a '-' nor '+')
+ ^
+Step 3: "words and 987" (reading stops immediately because there is a non-digit 'w')
+ ^
+The parsed integer is 0 because no digits were read.
+Since 0 is in the range [-231, 231 - 1], the final result is 0.
+
+```
+
+**Example 5:**
+
+```
+Input: s = "-91283472332"
+Output: -2147483648
+Explanation:
+Step 1: "-91283472332" (no characters read because there is no leading whitespace)
+ ^
+Step 2: "-91283472332" ('-' is read, so the result should be negative)
+ ^
+Step 3: "-91283472332" ("91283472332" is read in)
+ ^
+The parsed integer is -91283472332.
+Since -91283472332 is less than the lower bound of the range [-231, 231 - 1], the final result is clamped to -231 = -2147483648.
+```
+
+**Constraints:**
+
+- `0 <= s.length <= 200`
+- `s` consists of English letters (lower-case and upper-case), digits (`0-9`), `' '`, `'+'`
+
+## 题目大意
+
+请你来实现一个 myAtoi(string s) 函数，使其能将字符串转换成一个 32 位有符号整数（类似 C/C++ 中的 atoi 函数）。
+
+函数 myAtoi(string s) 的算法如下：
+
+- 读入字符串并丢弃无用的前导空格
+- 检查下一个字符（假设还未到字符末尾）为正还是负号，读取该字符（如果有）。 确定最终结果是负数还是正数。 如果两者都不存在，则假定结果为正。
+- 读入下一个字符，直到到达下一个非数字字符或到达输入的结尾。字符串的其余部分将被忽略。
+- 将前面步骤读入的这些数字转换为整数（即，"123" -> 123， "0032" -> 32）。如果没有读入数字，则整数为 0 。必要时更改符号（从步骤 2 开始）。
+- 如果整数数超过 32 位有符号整数范围 [−231, 231 − 1] ，需要截断这个整数，使其保持在这个范围内。具体来说，小于 −231 的整数应该被固定为 −231 ，大于 231 − 1 的整数应该被固定为 231 − 1 。
+- 返回整数作为最终结果。
+
+注意：
+
+- 本题中的空白字符只包括空格字符 ' ' 。
+- 除前导空格或数字后的其余字符串外，请勿忽略 任何其他字符。
+
+## 解题思路
+
+- 这题是简单题。题目要求实现类似 `C++` 中 `atoi` 函数的功能。这个函数功能是将字符串类型的数字转成 `int` 类型数字。先去除字符串中的前导空格，并判断记录数字的符号。数字需要去掉前导 `0` 。最后将数字转换成数字类型，判断是否超过 `int` 类型的上限 `[-2^31, 2^31 - 1]`，如果超过上限，需要输出边界，即 `-2^31`，或者 `2^31 - 1`。
+
+## 代码
+
+```go
+package leetcode
+
+func myAtoi(s string) int {
+ maxInt, signAllowed, whitespaceAllowed, sign, digits := int64(2<<30), true, true, 1, []int{}
+ for _, c := range s {
+ if c == ' ' && whitespaceAllowed {
+ continue
+ }
+ if signAllowed {
+ if c == '+' {
+ signAllowed = false
+ whitespaceAllowed = false
+ continue
+ } else if c == '-' {
+ sign = -1
+ signAllowed = false
+ whitespaceAllowed = false
+ continue
+ }
+ }
+ if c < '0' || c > '9' {
+ break
+ }
+ whitespaceAllowed, signAllowed = false, false
+ digits = append(digits, int(c-48))
+ }
+ var num, place int64
+ place, num = 1, 0
+ lastLeading0Index := -1
+ for i, d := range digits {
+ if d == 0 {
+ lastLeading0Index = i
+ } else {
+ break
+ }
+ }
+ if lastLeading0Index > -1 {
+ digits = digits[lastLeading0Index+1:]
+ }
+ var rtnMax int64
+ if sign > 0 {
+ rtnMax = maxInt - 1
+ } else {
+ rtnMax = maxInt
+ }
+ digitsCount := len(digits)
+ for i := digitsCount - 1; i >= 0; i-- {
+ num += int64(digits[i]) * place
+ place *= 10
+ if digitsCount-i > 10 || num > rtnMax {
+ return int(int64(sign) * rtnMax)
+ }
+ }
+ num *= int64(sign)
+ return int(num)
+}
+```
\ No newline at end of file
diff --git a/leetcode/0009.Palindrome-Number/9. Palindrome Number.go b/leetcode/0009.Palindrome-Number/9. Palindrome Number.go
index dfc0935b3..f5c284eea 100644
--- a/leetcode/0009.Palindrome-Number/9. Palindrome Number.go
+++ b/leetcode/0009.Palindrome-Number/9. Palindrome Number.go
@@ -2,7 +2,33 @@ package leetcode
import "strconv"
+// 解法一
func isPalindrome(x int) bool {
+ if x < 0 {
+ return false
+ }
+ if x == 0 {
+ return true
+ }
+ if x%10 == 0 {
+ return false
+ }
+ arr := make([]int, 0, 32)
+ for x > 0 {
+ arr = append(arr, x%10)
+ x = x / 10
+ }
+ sz := len(arr)
+ for i, j := 0, sz-1; i <= j; i, j = i+1, j-1 {
+ if arr[i] != arr[j] {
+ return false
+ }
+ }
+ return true
+}
+
+// 解法二 数字转字符串
+func isPalindrome1(x int) bool {
if x < 0 {
return false
}
diff --git a/leetcode/0009.Palindrome-Number/README.md b/leetcode/0009.Palindrome-Number/README.md
index d01fc716d..168404fd2 100644
--- a/leetcode/0009.Palindrome-Number/README.md
+++ b/leetcode/0009.Palindrome-Number/README.md
@@ -49,7 +49,33 @@ package leetcode
import "strconv"
+// 解法一
func isPalindrome(x int) bool {
+ if x < 0 {
+ return false
+ }
+ if x == 0 {
+ return true
+ }
+ if x%10 == 0 {
+ return false
+ }
+ arr := make([]int, 0, 32)
+ for x > 0 {
+ arr = append(arr, x%10)
+ x = x / 10
+ }
+ sz := len(arr)
+ for i, j := 0, sz-1; i <= j; i, j = i+1, j-1 {
+ if arr[i] != arr[j] {
+ return false
+ }
+ }
+ return true
+}
+
+// 解法二 数字转字符串
+func isPalindrome1(x int) bool {
if x < 0 {
return false
}
@@ -66,4 +92,5 @@ func isPalindrome(x int) bool {
return true
}
+
```
\ No newline at end of file
diff --git a/leetcode/0012.Integer-to-Roman/12. Integer to Roman.go b/leetcode/0012.Integer-to-Roman/12. Integer to Roman.go
new file mode 100644
index 000000000..525e8aef1
--- /dev/null
+++ b/leetcode/0012.Integer-to-Roman/12. Integer to Roman.go
@@ -0,0 +1,15 @@
+package leetcode
+
+func intToRoman(num int) string {
+ values := []int{1000, 900, 500, 400, 100, 90, 50, 40, 10, 9, 5, 4, 1}
+ symbols := []string{"M", "CM", "D", "CD", "C", "XC", "L", "XL", "X", "IX", "V", "IV", "I"}
+ res, i := "", 0
+ for num != 0 {
+ for values[i] > num {
+ i++
+ }
+ num -= values[i]
+ res += symbols[i]
+ }
+ return res
+}
diff --git a/leetcode/0012.Integer-to-Roman/12. Integer to Roman_test.go b/leetcode/0012.Integer-to-Roman/12. Integer to Roman_test.go
new file mode 100644
index 000000000..c5fff602a
--- /dev/null
+++ b/leetcode/0012.Integer-to-Roman/12. Integer to Roman_test.go
@@ -0,0 +1,71 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question12 struct {
+ para12
+ ans12
+}
+
+// para 是参数
+// one 代表第一个参数
+type para12 struct {
+ one int
+}
+
+// ans 是答案
+// one 代表第一个答案
+type ans12 struct {
+ one string
+}
+
+func Test_Problem12(t *testing.T) {
+
+ qs := []question12{
+
+ {
+ para12{3},
+ ans12{"III"},
+ },
+
+ {
+ para12{4},
+ ans12{"IV"},
+ },
+
+ {
+ para12{9},
+ ans12{"IX"},
+ },
+
+ {
+ para12{58},
+ ans12{"LVIII"},
+ },
+
+ {
+ para12{1994},
+ ans12{"MCMXCIV"},
+ },
+ {
+ para12{123},
+ ans12{"CXXIII"},
+ },
+
+ {
+ para12{120},
+ ans12{"CXX"},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 12------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans12, q.para12
+ fmt.Printf("【input】:%v 【output】:%v\n", p.one, intToRoman(p.one))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/0012.Integer-to-Roman/README.md b/leetcode/0012.Integer-to-Roman/README.md
new file mode 100644
index 000000000..5a2882d6a
--- /dev/null
+++ b/leetcode/0012.Integer-to-Roman/README.md
@@ -0,0 +1,102 @@
+# [12. Integer to Roman](https://leetcode.com/problems/integer-to-roman/)
+
+
+## 题目
+
+Roman numerals are represented by seven different symbols: `I`, `V`, `X`, `L`, `C`, `D` and `M`.
+
+```
+Symbol Value
+I 1
+V 5
+X 10
+L 50
+C 100
+D 500
+M 1000
+```
+
+For example, `2` is written as `II` in Roman numeral, just two one's added together. `12` is written as `XII`, which is simply `X + II`. The number `27` is written as `XXVII`, which is `XX + V + II`.
+
+Roman numerals are usually written largest to smallest from left to right. However, the numeral for four is not `IIII`. Instead, the number four is written as `IV`. Because the one is before the five we subtract it making four. The same principle applies to the number nine, which is written as `IX`. There are six instances where subtraction is used:
+
+- `I` can be placed before `V` (5) and `X` (10) to make 4 and 9.
+- `X` can be placed before `L` (50) and `C` (100) to make 40 and 90.
+- `C` can be placed before `D` (500) and `M` (1000) to make 400 and 900.
+
+Given an integer, convert it to a roman numeral.
+
+**Example 1:**
+
+```
+Input: num = 3
+Output: "III"
+```
+
+**Example 2:**
+
+```
+Input: num = 4
+Output: "IV"
+```
+
+**Example 3:**
+
+```
+Input: num = 9
+Output: "IX"
+```
+
+**Example 4:**
+
+```
+Input: num = 58
+Output: "LVIII"
+Explanation: L = 50, V = 5, III = 3.
+```
+
+**Example 5:**
+
+```
+Input: num = 1994
+Output: "MCMXCIV"
+Explanation: M = 1000, CM = 900, XC = 90 and IV = 4.
+```
+
+**Constraints:**
+
+- `1 <= num <= 3999`
+
+## 题目大意
+
+通常情况下，罗马数字中小的数字在大的数字的右边。但也存在特例，例如 4 不写做 IIII，而是 IV。数字 1 在数字 5 的左边，所表示的数等于大数 5 减小数 1 得到的数值 4 。同样地，数字 9 表示为 IX。这个特殊的规则只适用于以下六种情况：
+
+- I 可以放在 V (5) 和 X (10) 的左边，来表示 4 和 9。
+- X 可以放在 L (50) 和 C (100) 的左边，来表示 40 和 90。
+- C 可以放在 D (500) 和 M (1000) 的左边，来表示 400 和 900。
+
+给定一个整数，将其转为罗马数字。输入确保在 1 到 3999 的范围内。
+
+## 解题思路
+
+- 依照题意，优先选择大的数字，解题思路采用贪心算法。将 1-3999 范围内的罗马数字从大到小放在数组中，从头选择到尾，即可把整数转成罗马数字。
+
+## 代码
+
+```go
+package leetcode
+
+func intToRoman(num int) string {
+ values := []int{1000, 900, 500, 400, 100, 90, 50, 40, 10, 9, 5, 4, 1}
+ symbols := []string{"M", "CM", "D", "CD", "C", "XC", "L", "XL", "X", "IX", "V", "IV", "I"}
+ res, i := "", 0
+ for num != 0 {
+ for values[i] > num {
+ i++
+ }
+ num -= values[i]
+ res += symbols[i]
+ }
+ return res
+}
+```
\ No newline at end of file
diff --git a/leetcode/0014.Longest-Common-Prefix/14.Longest Common Prefix.go b/leetcode/0014.Longest-Common-Prefix/14.Longest Common Prefix.go
new file mode 100644
index 000000000..259c5c835
--- /dev/null
+++ b/leetcode/0014.Longest-Common-Prefix/14.Longest Common Prefix.go
@@ -0,0 +1,16 @@
+package leetcode
+
+func longestCommonPrefix(strs []string) string {
+ prefix := strs[0]
+
+ for i := 1; i < len(strs); i++ {
+ for j := 0; j < len(prefix); j++ {
+ if len(strs[i]) <= j || strs[i][j] != prefix[j] {
+ prefix = prefix[0:j]
+ break
+ }
+ }
+ }
+
+ return prefix
+}
diff --git a/leetcode/0014.Longest-Common-Prefix/14.Longest Common Prefix_test.go b/leetcode/0014.Longest-Common-Prefix/14.Longest Common Prefix_test.go
new file mode 100644
index 000000000..e7635d52f
--- /dev/null
+++ b/leetcode/0014.Longest-Common-Prefix/14.Longest Common Prefix_test.go
@@ -0,0 +1,50 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question14 struct {
+ para14
+ ans14
+}
+
+// para 是参数
+type para14 struct {
+ strs []string
+}
+
+// ans 是答案
+type ans14 struct {
+ ans string
+}
+
+func Test_Problem14(t *testing.T) {
+
+ qs := []question14{
+
+ {
+ para14{[]string{"flower", "flow", "flight"}},
+ ans14{"fl"},
+ },
+
+ {
+ para14{[]string{"dog", "racecar", "car"}},
+ ans14{""},
+ },
+
+ {
+ para14{[]string{"ab", "a"}},
+ ans14{"a"},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 14------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans14, q.para14
+ fmt.Printf("【input】:%v 【output】:%v\n", p.strs, longestCommonPrefix(p.strs))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/0014.Longest-Common-Prefix/README.md b/leetcode/0014.Longest-Common-Prefix/README.md
new file mode 100644
index 000000000..26b9e03bf
--- /dev/null
+++ b/leetcode/0014.Longest-Common-Prefix/README.md
@@ -0,0 +1,57 @@
+# [14. Longest Common Prefix](https://leetcode.com/problems/longest-common-prefix/)
+
+## 题目
+
+Write a function to find the longest common prefix string amongst an array of strings.
+
+If there is no common prefix, return an empty string "".
+
+**Example 1**:
+
+ Input: strs = ["flower","flow","flight"]
+ Output: "fl"
+
+**Example 2**:
+
+ Input: strs = ["dog","racecar","car"]
+ Output: ""
+ Explanation: There is no common prefix among the input strings.
+
+**Constraints:**
+
+- 1 <= strs.length <= 200
+- 0 <= strs[i].length <= 200
+- strs[i] consists of only lower-case English letters.
+
+## 题目大意
+
+编写一个函数来查找字符串数组中的最长公共前缀。
+
+如果不存在公共前缀，返回空字符串 ""。
+
+## 解题思路
+
+- 对 strs 按照字符串长度进行升序排序，求出 strs 中长度最小字符串的长度 minLen
+- 逐个比较长度最小字符串与其它字符串中的字符，如果不相等就返回 commonPrefix,否则就把该字符加入 commonPrefix
+
+## 代码
+
+```go
+
+package leetcode
+
+func longestCommonPrefix(strs []string) string {
+ prefix := strs[0]
+
+ for i := 1; i < len(strs); i++ {
+ for j := 0; j < len(prefix); j++ {
+ if len(strs[i]) <= j || strs[i][j] != prefix[j] {
+ prefix = prefix[0:j]
+ break
+ }
+ }
+ }
+
+ return prefix
+}
+```
diff --git a/leetcode/0015.3Sum/15. 3Sum.go b/leetcode/0015.3Sum/15. 3Sum.go
index ea643c8c6..a8be09e8e 100644
--- a/leetcode/0015.3Sum/15. 3Sum.go
+++ b/leetcode/0015.3Sum/15. 3Sum.go
@@ -4,7 +4,41 @@ import (
"sort"
)
+// 解法一 最优解，双指针 + 排序
func threeSum(nums []int) [][]int {
+ sort.Ints(nums)
+ result, start, end, index, addNum, length := make([][]int, 0), 0, 0, 0, 0, len(nums)
+ for index = 1; index < length-1; index++ {
+ start, end = 0, length-1
+ if index > 1 && nums[index] == nums[index-1] {
+ start = index - 1
+ }
+ for start < index && end > index {
+ if start > 0 && nums[start] == nums[start-1] {
+ start++
+ continue
+ }
+ if end < length-1 && nums[end] == nums[end+1] {
+ end--
+ continue
+ }
+ addNum = nums[start] + nums[end] + nums[index]
+ if addNum == 0 {
+ result = append(result, []int{nums[start], nums[index], nums[end]})
+ start++
+ end--
+ } else if addNum > 0 {
+ end--
+ } else {
+ start++
+ }
+ }
+ }
+ return result
+}
+
+// 解法二
+func threeSum1(nums []int) [][]int {
res := [][]int{}
counter := map[int]int{}
for _, value := range nums {
diff --git a/leetcode/0016.3Sum-Closest/16. 3Sum Closest.go b/leetcode/0016.3Sum-Closest/16. 3Sum Closest.go
index 0beaac707..ed4465d17 100644
--- a/leetcode/0016.3Sum-Closest/16. 3Sum Closest.go
+++ b/leetcode/0016.3Sum-Closest/16. 3Sum Closest.go
@@ -11,6 +11,9 @@ func threeSumClosest(nums []int, target int) int {
if n > 2 {
sort.Ints(nums)
for i := 0; i < n-2; i++ {
+ if i > 0 && nums[i] == nums[i-1] {
+ continue
+ }
for j, k := i+1, n-1; j < k; {
sum := nums[i] + nums[j] + nums[k]
if abs(sum-target) < diff {
diff --git a/leetcode/0018.4Sum/18. 4Sum.go b/leetcode/0018.4Sum/18. 4Sum.go
index 38f8da3d5..be44e5c7f 100644
--- a/leetcode/0018.4Sum/18. 4Sum.go
+++ b/leetcode/0018.4Sum/18. 4Sum.go
@@ -2,7 +2,92 @@ package leetcode
import "sort"
-func fourSum(nums []int, target int) [][]int {
+// 解法一 双指针
+func fourSum(nums []int, target int) (quadruplets [][]int) {
+ sort.Ints(nums)
+ n := len(nums)
+ for i := 0; i < n-3 && nums[i]+nums[i+1]+nums[i+2]+nums[i+3] <= target; i++ {
+ if i > 0 && nums[i] == nums[i-1] || nums[i]+nums[n-3]+nums[n-2]+nums[n-1] < target {
+ continue
+ }
+ for j := i + 1; j < n-2 && nums[i]+nums[j]+nums[j+1]+nums[j+2] <= target; j++ {
+ if j > i+1 && nums[j] == nums[j-1] || nums[i]+nums[j]+nums[n-2]+nums[n-1] < target {
+ continue
+ }
+ for left, right := j+1, n-1; left < right; {
+ if sum := nums[i] + nums[j] + nums[left] + nums[right]; sum == target {
+ quadruplets = append(quadruplets, []int{nums[i], nums[j], nums[left], nums[right]})
+ for left++; left < right && nums[left] == nums[left-1]; left++ {
+ }
+ for right--; left < right && nums[right] == nums[right+1]; right-- {
+ }
+ } else if sum < target {
+ left++
+ } else {
+ right--
+ }
+ }
+ }
+ }
+ return
+}
+
+// 解法二 kSum
+func fourSum1(nums []int, target int) [][]int {
+ res, cur := make([][]int, 0), make([]int, 0)
+ sort.Ints(nums)
+ kSum(nums, 0, len(nums)-1, target, 4, cur, &res)
+ return res
+}
+
+func kSum(nums []int, left, right int, target int, k int, cur []int, res *[][]int) {
+ if right-left+1 < k || k < 2 || target < nums[left]*k || target > nums[right]*k {
+ return
+ }
+ if k == 2 {
+ // 2 sum
+ twoSum(nums, left, right, target, cur, res)
+ } else {
+ for i := left; i < len(nums); i++ {
+ if i == left || (i > left && nums[i-1] != nums[i]) {
+ next := make([]int, len(cur))
+ copy(next, cur)
+ next = append(next, nums[i])
+ kSum(nums, i+1, len(nums)-1, target-nums[i], k-1, next, res)
+ }
+ }
+ }
+
+}
+
+func twoSum(nums []int, left, right int, target int, cur []int, res *[][]int) {
+ for left < right {
+ sum := nums[left] + nums[right]
+ if sum == target {
+ cur = append(cur, nums[left], nums[right])
+ temp := make([]int, len(cur))
+ copy(temp, cur)
+ *res = append(*res, temp)
+ // reset cur to previous state
+ cur = cur[:len(cur)-2]
+ left++
+ right--
+ for left < right && nums[left] == nums[left-1] {
+ left++
+ }
+ for left < right && nums[right] == nums[right+1] {
+ right--
+ }
+ } else if sum < target {
+ left++
+ } else {
+ right--
+ }
+ }
+}
+
+// 解法三
+func fourSum2(nums []int, target int) [][]int {
res := [][]int{}
counter := map[int]int{}
for _, value := range nums {
diff --git a/leetcode/0019.Remove-Nth-Node-From-End-of-List/19. Remove Nth Node From End of List.go b/leetcode/0019.Remove-Nth-Node-From-End-of-List/19. Remove Nth Node From End of List.go
index a4d4d18f9..7c2855bbb 100644
--- a/leetcode/0019.Remove-Nth-Node-From-End-of-List/19. Remove Nth Node From End of List.go
+++ b/leetcode/0019.Remove-Nth-Node-From-End-of-List/19. Remove Nth Node From End of List.go
@@ -17,22 +17,18 @@ type ListNode = structures.ListNode
// 解法一
func removeNthFromEnd(head *ListNode, n int) *ListNode {
- var fast, slow *ListNode
- fast = head
- slow = head
- for i := 0; i < n; i++ {
- fast = fast.Next
- }
- if fast == nil {
- head = head.Next
- return head
- }
- for fast.Next != nil {
+ dummyHead := &ListNode{Next: head}
+ preSlow, slow, fast := dummyHead, head, head
+ for fast != nil {
+ if n <= 0 {
+ preSlow = slow
+ slow = slow.Next
+ }
+ n--
fast = fast.Next
- slow = slow.Next
}
- slow.Next = slow.Next.Next
- return head
+ preSlow.Next = slow.Next
+ return dummyHead.Next
}
// 解法二
diff --git a/leetcode/0019.Remove-Nth-Node-From-End-of-List/19. Remove Nth Node From End of List_test.go b/leetcode/0019.Remove-Nth-Node-From-End-of-List/19. Remove Nth Node From End of List_test.go
index e7be4810f..f112b55d3 100644
--- a/leetcode/0019.Remove-Nth-Node-From-End-of-List/19. Remove Nth Node From End of List_test.go
+++ b/leetcode/0019.Remove-Nth-Node-From-End-of-List/19. Remove Nth Node From End of List_test.go
@@ -29,6 +29,26 @@ func Test_Problem19(t *testing.T) {
qs := []question19{
+ {
+ para19{[]int{1}, 3},
+ ans19{[]int{1}},
+ },
+
+ {
+ para19{[]int{1, 2}, 2},
+ ans19{[]int{2}},
+ },
+
+ {
+ para19{[]int{1}, 1},
+ ans19{[]int{}},
+ },
+
+ {
+ para19{[]int{1, 2, 3, 4, 5}, 10},
+ ans19{[]int{1, 2, 3, 4, 5}},
+ },
+
{
para19{[]int{1, 2, 3, 4, 5}, 1},
ans19{[]int{1, 2, 3, 4}},
diff --git a/leetcode/0019.Remove-Nth-Node-From-End-of-List/README.md b/leetcode/0019.Remove-Nth-Node-From-End-of-List/README.md
index 807a6cbc1..090e74efd 100644
--- a/leetcode/0019.Remove-Nth-Node-From-End-of-List/README.md
+++ b/leetcode/0019.Remove-Nth-Node-From-End-of-List/README.md
@@ -2,16 +2,44 @@
## 题目
-Given a linked list, remove the n-th node from the end of list and return its head.
+Given the `head` of a linked list, remove the `nth` node from the end of the list and return its head.
-Example:
+**Follow up:** Could you do this in one pass?
+
+**Example 1:**
+
+
+
+```
+Input: head = [1,2,3,4,5], n = 2
+Output: [1,2,3,5]
```
-Given linked list: 1->2->3->4->5, and n = 2.
-After removing the second node from the end, the linked list becomes 1->2->3->5.
+**Example 2:**
+
+```
+Input: head = [1], n = 1
+Output: []
+
```
+**Example 3:**
+
+```
+Input: head = [1,2], n = 1
+Output: [1]
+
+```
+
+**Constraints:**
+
+- The number of nodes in the list is `sz`.
+- `1 <= sz <= 30`
+- `0 <= Node.val <= 100`
+- `1 <= n <= sz`
+
+
## 题目大意
删除链表中倒数第 n 个结点。
diff --git a/leetcode/0024.Swap-Nodes-in-Pairs/24. Swap Nodes in Pairs.go b/leetcode/0024.Swap-Nodes-in-Pairs/24. Swap Nodes in Pairs.go
index 1dc9e41de..ac1e7e09f 100644
--- a/leetcode/0024.Swap-Nodes-in-Pairs/24. Swap Nodes in Pairs.go
+++ b/leetcode/0024.Swap-Nodes-in-Pairs/24. Swap Nodes in Pairs.go
@@ -16,30 +16,9 @@ type ListNode = structures.ListNode
*/
func swapPairs(head *ListNode) *ListNode {
- if head == nil || head.Next == nil {
- return head
+ dummy := &ListNode{Next: head}
+ for pt := dummy; pt != nil && pt.Next != nil && pt.Next.Next != nil; {
+ pt, pt.Next, pt.Next.Next, pt.Next.Next.Next = pt.Next, pt.Next.Next, pt.Next.Next.Next, pt.Next
}
- s := head.Next
- var behind *ListNode
- for head.Next != nil {
- headNext := head.Next
- if behind != nil && behind.Next != nil {
- behind.Next = headNext
- }
- var next *ListNode
- if head.Next.Next != nil {
- next = head.Next.Next
- }
- if head.Next.Next != nil {
- head.Next = next
- } else {
- head.Next = nil
- }
- headNext.Next = head
- behind = head
- if head.Next != nil {
- head = next
- }
- }
- return s
+ return dummy.Next
}
diff --git a/leetcode/0027.Remove-Element/27. Remove Element.go b/leetcode/0027.Remove-Element/27. Remove Element.go
index f0233b6ad..1395d1086 100644
--- a/leetcode/0027.Remove-Element/27. Remove Element.go
+++ b/leetcode/0027.Remove-Element/27. Remove Element.go
@@ -9,10 +9,8 @@ func removeElement(nums []int, val int) int {
if nums[i] != val {
if i != j {
nums[i], nums[j] = nums[j], nums[i]
- j++
- } else {
- j++
}
+ j++
}
}
return j
diff --git a/leetcode/0028.Implement-strStr/28. Implement strStr().go b/leetcode/0028.Find-the-Index-of-the-First-Occurrence-in-a-String/28. Find the Index of the First Occurrence in a String.go
similarity index 100%
rename from leetcode/0028.Implement-strStr/28. Implement strStr().go
rename to leetcode/0028.Find-the-Index-of-the-First-Occurrence-in-a-String/28. Find the Index of the First Occurrence in a String.go
diff --git a/leetcode/0028.Implement-strStr/28. Implement strStr()_test.go b/leetcode/0028.Find-the-Index-of-the-First-Occurrence-in-a-String/28. Find the Index of the First Occurrence in a String_test.go
similarity index 100%
rename from leetcode/0028.Implement-strStr/28. Implement strStr()_test.go
rename to leetcode/0028.Find-the-Index-of-the-First-Occurrence-in-a-String/28. Find the Index of the First Occurrence in a String_test.go
diff --git a/leetcode/0028.Find-the-Index-of-the-First-Occurrence-in-a-String/README.md b/leetcode/0028.Find-the-Index-of-the-First-Occurrence-in-a-String/README.md
new file mode 100644
index 000000000..d1e643bd9
--- /dev/null
+++ b/leetcode/0028.Find-the-Index-of-the-First-Occurrence-in-a-String/README.md
@@ -0,0 +1,50 @@
+# [28. Find the Index of the First Occurrence in a String](https://leetcode.com/problems/find-the-index-of-the-first-occurrence-in-a-string/)
+
+## 题目
+
+Implement strStr().
+
+Return the index of the first occurrence of needle in haystack, or -1 if needle is not part of haystack.
+
+
+Example 1:
+
+```c
+Input: haystack = "hello", needle = "ll"
+Output: 2
+```
+
+Example 2:
+
+```c
+Input: haystack = "aaaaa", needle = "bba"
+Output: -1
+```
+
+Clarification:
+
+What should we return when needle is an empty string? This is a great question to ask during an interview.
+
+For the purpose of this problem, we will return 0 when needle is an empty string. This is consistent to C's strstr() and Java's indexOf().
+
+## 题目大意
+
+
+实现一个查找 substring 的函数。如果在母串中找到了子串，返回子串在母串中出现的下标，如果没有找到，返回 -1，如果子串是空串，则返回 0 。
+
+## 解题思路
+
+这一题比较简单，直接写即可。
+
+
+
+
+
+
+
+
+
+
+
+
+
diff --git a/leetcode/0028.Implement-strStr/README.md b/leetcode/0028.Implement-strStr/README.md
deleted file mode 100644
index 5fb575296..000000000
--- a/leetcode/0028.Implement-strStr/README.md
+++ /dev/null
@@ -1,50 +0,0 @@
-# [28. Implement strStr()](https://leetcode.com/problems/implement-strstr/)
-
-## 题目
-
-Implement strStr().
-
-Return the index of the first occurrence of needle in haystack, or -1 if needle is not part of haystack.
-
-
-Example 1:
-
-```c
-Input: haystack = "hello", needle = "ll"
-Output: 2
-```
-
-Example 2:
-
-```c
-Input: haystack = "aaaaa", needle = "bba"
-Output: -1
-```
-
-Clarification:
-
-What should we return when needle is an empty string? This is a great question to ask during an interview.
-
-For the purpose of this problem, we will return 0 when needle is an empty string. This is consistent to C's strstr() and Java's indexOf().
-
-## 题目大意
-
-
-实现一个查找 substring 的函数。如果在母串中找到了子串，返回子串在母串中出现的下标，如果没有找到，返回 -1，如果子串是空串，则返回 0 。
-
-## 解题思路
-
-这一题比较简单，直接写即可。
-
-
-
-
-
-
-
-
-
-
-
-
-
diff --git a/leetcode/0031.Next-Permutation/31. Next Permutation.go b/leetcode/0031.Next-Permutation/31. Next Permutation.go
new file mode 100644
index 000000000..04e07485e
--- /dev/null
+++ b/leetcode/0031.Next-Permutation/31. Next Permutation.go
@@ -0,0 +1,72 @@
+package leetcode
+
+// 解法一
+func nextPermutation(nums []int) {
+ i, j := 0, 0
+ for i = len(nums) - 2; i >= 0; i-- {
+ if nums[i] < nums[i+1] {
+ break
+ }
+ }
+ if i >= 0 {
+ for j = len(nums) - 1; j > i; j-- {
+ if nums[j] > nums[i] {
+ break
+ }
+ }
+ swap(&nums, i, j)
+ }
+ reverse(&nums, i+1, len(nums)-1)
+}
+
+func reverse(nums *[]int, i, j int) {
+ for i < j {
+ swap(nums, i, j)
+ i++
+ j--
+ }
+}
+
+func swap(nums *[]int, i, j int) {
+ (*nums)[i], (*nums)[j] = (*nums)[j], (*nums)[i]
+}
+
+// 解法二
+// [2,(3),6,5,4,1] -> 2,(4),6,5,(3),1 -> 2,4, 1,3,5,6
+func nextPermutation1(nums []int) {
+ var n = len(nums)
+ var pIdx = checkPermutationPossibility(nums)
+ if pIdx == -1 {
+ reverse(&nums, 0, n-1)
+ return
+ }
+
+ var rp = len(nums) - 1
+ // start from right most to leftward,find the first number which is larger than PIVOT
+ for rp > 0 {
+ if nums[rp] > nums[pIdx] {
+ swap(&nums, pIdx, rp)
+ break
+ } else {
+ rp--
+ }
+ }
+ // Finally, Reverse all elements which are right from pivot
+ reverse(&nums, pIdx+1, n-1)
+}
+
+// checkPermutationPossibility returns 1st occurrence Index where
+// value is in decreasing order(from right to left)
+// returns -1 if not found(it's already in its last permutation)
+func checkPermutationPossibility(nums []int) (idx int) {
+ // search right to left for 1st number(from right) that is not in increasing order
+ var rp = len(nums) - 1
+ for rp > 0 {
+ if nums[rp-1] < nums[rp] {
+ idx = rp - 1
+ return idx
+ }
+ rp--
+ }
+ return -1
+}
diff --git a/leetcode/0031.Next-Permutation/31. Next Permutation_test.go b/leetcode/0031.Next-Permutation/31. Next Permutation_test.go
new file mode 100644
index 000000000..f42ffab45
--- /dev/null
+++ b/leetcode/0031.Next-Permutation/31. Next Permutation_test.go
@@ -0,0 +1,58 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question31 struct {
+ para31
+ ans31
+}
+
+// para 是参数
+// one 代表第一个参数
+type para31 struct {
+ nums []int
+}
+
+// ans 是答案
+// one 代表第一个答案
+type ans31 struct {
+ one []int
+}
+
+func Test_Problem31(t *testing.T) {
+
+ qs := []question31{
+
+ {
+ para31{[]int{1, 2, 3}},
+ ans31{[]int{1, 3, 2}},
+ },
+
+ {
+ para31{[]int{3, 2, 1}},
+ ans31{[]int{1, 2, 3}},
+ },
+
+ {
+ para31{[]int{1, 1, 5}},
+ ans31{[]int{1, 5, 1}},
+ },
+
+ {
+ para31{[]int{1}},
+ ans31{[]int{1}},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 31------------------------\n")
+ for _, q := range qs {
+ _, p := q.ans31, q.para31
+ fmt.Printf("【input】:%v ", p)
+ nextPermutation(p.nums)
+ fmt.Printf("【output】:%v\n", p.nums)
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/0031.Next-Permutation/README.md b/leetcode/0031.Next-Permutation/README.md
new file mode 100644
index 000000000..6ae4169a2
--- /dev/null
+++ b/leetcode/0031.Next-Permutation/README.md
@@ -0,0 +1,89 @@
+# [31. Next Permutation](https://leetcode.com/problems/next-permutation/)
+
+
+## 题目
+
+Implement **next permutation**, which rearranges numbers into the lexicographically next greater permutation of numbers.
+
+If such an arrangement is not possible, it must rearrange it as the lowest possible order (i.e., sorted in ascending order).
+
+The replacement must be **[in place](http://en.wikipedia.org/wiki/In-place_algorithm)** and use only constant extra memory.
+
+**Example 1:**
+
+```
+Input: nums = [1,2,3]
+Output: [1,3,2]
+```
+
+**Example 2:**
+
+```
+Input: nums = [3,2,1]
+Output: [1,2,3]
+```
+
+**Example 3:**
+
+```
+Input: nums = [1,1,5]
+Output: [1,5,1]
+```
+
+**Example 4:**
+
+```
+Input: nums = [1]
+Output: [1]
+```
+
+**Constraints:**
+
+- `1 <= nums.length <= 100`
+- `0 <= nums[i] <= 100`
+
+## 题目大意
+
+实现获取 下一个排列 的函数，算法需要将给定数字序列重新排列成字典序中下一个更大的排列。如果不存在下一个更大的排列，则将数字重新排列成最小的排列（即升序排列）。必须 原地 修改，只允许使用额外常数空间。
+
+## 解题思路
+
+- 题目有 3 个问题需要解决。如何找到下一个排列。不存在下一个排列的时候如何生成最小的排列。如何原地修改。先解决第一个问题，如何找到下一个排列。下一个排列是找到一个大于当前排序的字典序，且变大的幅度最小。那么只能将较小的数与较大数做一次原地交换。并且较小数的下标要尽量靠右，较大数也要尽可能小。原地交换以后，还需要将较大数右边的数按照升序重新排列。这样交换以后，才能生成下一个排列。以排列 [8,9,6,10,7,2] 为例：能找到的符合条件的一对「较小数」与「较大数」的组合为 6 与 7，满足「较小数」尽量靠右，而「较大数」尽可能小。当完成交换后排列变为 [8,9,7,10,6,2]，此时我们可以重排「较小数」右边的序列，序列变为 [8,9,7,2,6,10]。
+- 第一步：在 `nums[i]` 中找到 `i` 使得 `nums[i] < nums[i+1]`，此时较小数为 `nums[i]`，并且 `[i+1, n)` 一定为下降区间。第二步：如果找到了这样的 `i` ，则在下降区间 `[i+1, n)` 中从后往前找到第一个 `j` ，使得 `nums[i] < nums[j]` ，此时较大数为 `nums[j]`。第三步，交换 `nums[i]` 和 `nums[j]`，此时区间 `[i+1, n)` 一定为降序区间。最后原地交换 `[i+1, n)` 区间内的元素，使其变为升序，无需对该区间进行排序。
+- 如果第一步找不到符合条件的下标 `i`，说明当前序列已经是一个最大的排列。那么应该直接执行第三步，生成最小的排列。
+
+## 代码
+
+```go
+package leetcode
+
+func nextPermutation(nums []int) {
+ i, j := 0, 0
+ for i = len(nums) - 2; i >= 0; i-- {
+ if nums[i] < nums[i+1] {
+ break
+ }
+ }
+ if i >= 0 {
+ for j = len(nums) - 1; j > i; j-- {
+ if nums[j] > nums[i] {
+ break
+ }
+ }
+ swap(&nums, i, j)
+ }
+ reverse(&nums, i+1, len(nums)-1)
+}
+
+func reverse(nums *[]int, i, j int) {
+ for i < j {
+ swap(nums, i, j)
+ i++
+ j--
+ }
+}
+
+func swap(nums *[]int, i, j int) {
+ (*nums)[i], (*nums)[j] = (*nums)[j], (*nums)[i]
+}
+```
\ No newline at end of file
diff --git a/leetcode/0032.Longest-Valid-Parentheses/32. Longest Valid Parentheses.go b/leetcode/0032.Longest-Valid-Parentheses/32. Longest Valid Parentheses.go
new file mode 100644
index 000000000..ae59da5ed
--- /dev/null
+++ b/leetcode/0032.Longest-Valid-Parentheses/32. Longest Valid Parentheses.go
@@ -0,0 +1,58 @@
+package leetcode
+
+// 解法一 栈
+func longestValidParentheses(s string) int {
+ stack, res := []int{}, 0
+ stack = append(stack, -1)
+ for i := 0; i < len(s); i++ {
+ if s[i] == '(' {
+ stack = append(stack, i)
+ } else {
+ stack = stack[:len(stack)-1]
+ if len(stack) == 0 {
+ stack = append(stack, i)
+ } else {
+ res = max(res, i-stack[len(stack)-1])
+ }
+ }
+ }
+ return res
+}
+
+func max(a, b int) int {
+ if a > b {
+ return a
+ }
+ return b
+}
+
+// 解法二 双指针
+func longestValidParentheses1(s string) int {
+ left, right, maxLength := 0, 0, 0
+ for i := 0; i < len(s); i++ {
+ if s[i] == '(' {
+ left++
+ } else {
+ right++
+ }
+ if left == right {
+ maxLength = max(maxLength, 2*right)
+ } else if right > left {
+ left, right = 0, 0
+ }
+ }
+ left, right = 0, 0
+ for i := len(s) - 1; i >= 0; i-- {
+ if s[i] == '(' {
+ left++
+ } else {
+ right++
+ }
+ if left == right {
+ maxLength = max(maxLength, 2*left)
+ } else if left > right {
+ left, right = 0, 0
+ }
+ }
+ return maxLength
+}
diff --git a/leetcode/0032.Longest-Valid-Parentheses/32. Longest Valid Parentheses_test.go b/leetcode/0032.Longest-Valid-Parentheses/32. Longest Valid Parentheses_test.go
new file mode 100644
index 000000000..4bdf8de2b
--- /dev/null
+++ b/leetcode/0032.Longest-Valid-Parentheses/32. Longest Valid Parentheses_test.go
@@ -0,0 +1,61 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question32 struct {
+ para32
+ ans32
+}
+
+// para 是参数
+// one 代表第一个参数
+type para32 struct {
+ s string
+}
+
+// ans 是答案
+// one 代表第一个答案
+type ans32 struct {
+ one int
+}
+
+func Test_Problem32(t *testing.T) {
+
+ qs := []question32{
+
+ {
+ para32{"(()"},
+ ans32{2},
+ },
+
+ {
+ para32{")()())"},
+ ans32{4},
+ },
+
+ {
+ para32{"()(())"},
+ ans32{6},
+ },
+
+ {
+ para32{"()(())))"},
+ ans32{6},
+ },
+
+ {
+ para32{"()(()"},
+ ans32{2},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 32------------------------\n")
+ for _, q := range qs {
+ _, p := q.ans32, q.para32
+ fmt.Printf("【input】:%v 【output】:%v\n", p, longestValidParentheses(p.s))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/0032.Longest-Valid-Parentheses/README.md b/leetcode/0032.Longest-Valid-Parentheses/README.md
new file mode 100644
index 000000000..50f6ec116
--- /dev/null
+++ b/leetcode/0032.Longest-Valid-Parentheses/README.md
@@ -0,0 +1,108 @@
+# [32. Longest Valid Parentheses](https://leetcode.com/problems/longest-valid-parentheses/)
+
+
+## 题目
+
+Given a string containing just the characters `'('` and `')'`, find the length of the longest valid (well-formed) parentheses substring.
+
+**Example 1:**
+
+```
+Input: s = "(()"
+Output: 2
+Explanation: The longest valid parentheses substring is "()".
+```
+
+**Example 2:**
+
+```
+Input: s = ")()())"
+Output: 4
+Explanation: The longest valid parentheses substring is "()()".
+```
+
+**Example 3:**
+
+```
+Input: s = ""
+Output: 0
+```
+
+**Constraints:**
+
+- `0 <= s.length <= 3 * 104`
+- `s[i]` is `'('`, or `')'`.
+
+## 题目大意
+
+给你一个只包含 '(' 和 ')' 的字符串，找出最长有效（格式正确且连续）括号子串的长度。
+
+## 解题思路
+
+- 提到括号匹配，第一时间能让人想到的就是利用栈。这里需要计算嵌套括号的总长度，所以栈里面不能单纯的存左括号，而应该存左括号在原字符串的下标，这样通过下标相减可以获取长度。那么栈如果是非空，栈底永远存的是当前遍历过的字符串中**上一个没有被匹配的右括号的下标**。**上一个没有被匹配的右括号的下标**可以理解为每段括号匹配之间的“隔板”。例如，`())((()))`，第三个右括号，即为左右 2 段正确的括号匹配中间的“隔板”。“隔板”的存在影响计算最长括号长度。如果不存在“隔板”，前后 2 段正确的括号匹配应该“融合”在一起，最长长度为 `2 + 6 = 8`，但是这里存在了“隔板”，所以最长长度仅为 `6`。
+- 具体算法实现，遇到每个 `'('` ，将它的下标压入栈中。对于遇到的每个 `')'`，先弹出栈顶元素表示匹配了当前右括号。如果栈为空，说明当前的右括号为没有被匹配的右括号，于是将其下标放入栈中来更新**上一个没有被匹配的右括号的下标**。如果栈不为空，当前右括号的下标减去栈顶元素即为以该右括号为结尾的最长有效括号的长度。需要注意初始化时，不存在**上一个没有被匹配的右括号的下标**，那么将 `-1` 放入栈中，充当下标为 `0` 的“隔板”。时间复杂度 O(n)，空间复杂度 O(n)。
+- 在栈的方法中，实际用到的元素仅仅是栈底的**上一个没有被匹配的右括号的下标**。那么考虑能否把这个值存在一个变量中，这样可以省去栈 O(n) 的时间复杂度。利用两个计数器 left 和 right 。首先，从左到右遍历字符串，每当遇到 `'('`，增加 left 计数器，每当遇到 `')'` ，增加 right 计数器。每当 left 计数器与 right 计数器相等时，计算当前有效字符串的长度，并且记录目前为止找到的最长子字符串。当 right 计数器比 left 计数器大时，说明括号不匹配，于是将 left 和 right 计数器同时变回 0。这样的做法利用了贪心的思想，考虑了以当前字符下标结尾的有效括号长度，每次当右括号数量多于左括号数量的时候之前的字符就扔掉不再考虑，重新从下一个字符开始计算。
+- 但上面的做法会漏掉一种情况，就是遍历的时候左括号的数量始终大于右括号的数量，即 `(()` ，这种时候最长有效括号是求不出来的。解决办法是反向再计算一遍，如果从右往左计算，`(()` 先计算匹配的括号，最后只剩下 `'('`，这样依旧可以算出最长匹配的括号长度。反过来计算的方法和上述从左往右计算的方法一致：当 left 计数器比 right 计数器大时，将 left 和 right 计数器同时变回 0；当 left 计数器与 right 计数器相等时，计算当前有效字符串的长度，并且记录目前为止找到的最长子字符串。这种方法的时间复杂度是 O(n)，空间复杂度 O(1)。
+
+## 代码
+
+```go
+package leetcode
+
+// 解法一 栈
+func longestValidParentheses(s string) int {
+ stack, res := []int{}, 0
+ stack = append(stack, -1)
+ for i := 0; i < len(s); i++ {
+ if s[i] == '(' {
+ stack = append(stack, i)
+ } else {
+ stack = stack[:len(stack)-1]
+ if len(stack) == 0 {
+ stack = append(stack, i)
+ } else {
+ res = max(res, i-stack[len(stack)-1])
+ }
+ }
+ }
+ return res
+}
+
+func max(a, b int) int {
+ if a > b {
+ return a
+ }
+ return b
+}
+
+// 解法二 双指针
+func longestValidParentheses1(s string) int {
+ left, right, maxLength := 0, 0, 0
+ for i := 0; i < len(s); i++ {
+ if s[i] == '(' {
+ left++
+ } else {
+ right++
+ }
+ if left == right {
+ maxLength = max(maxLength, 2*right)
+ } else if right > left {
+ left, right = 0, 0
+ }
+ }
+ left, right = 0, 0
+ for i := len(s) - 1; i >= 0; i-- {
+ if s[i] == '(' {
+ left++
+ } else {
+ right++
+ }
+ if left == right {
+ maxLength = max(maxLength, 2*left)
+ } else if left > right {
+ left, right = 0, 0
+ }
+ }
+ return maxLength
+}
+```
\ No newline at end of file
diff --git a/leetcode/0040.Combination-Sum-II/README.md b/leetcode/0040.Combination-Sum-II/README.md
index 5375739bb..b53f67dcd 100755
--- a/leetcode/0040.Combination-Sum-II/README.md
+++ b/leetcode/0040.Combination-Sum-II/README.md
@@ -45,4 +45,4 @@ candidates 中的每个数字在每个组合中只能使用一次。
## 解题思路
- 题目要求出总和为 sum 的所有组合，组合需要去重。这一题是第 39 题的加强版，第 39 题中元素可以重复利用(重复元素可无限次使用)，这一题中元素只能有限次数的利用，因为存在重复元素，并且每个元素只能用一次(重复元素只能使用有限次)
-- 这一题和第 47 题类似，只不过元素可以反复使用。
+- 这一题和第 47 题类似。
diff --git a/leetcode/0042.Trapping-Rain-Water/README.md b/leetcode/0042.Trapping-Rain-Water/README.md
index 4b8fbf871..9bafaa2d2 100644
--- a/leetcode/0042.Trapping-Rain-Water/README.md
+++ b/leetcode/0042.Trapping-Rain-Water/README.md
@@ -10,9 +10,9 @@ Given n non-negative integers representing an elevation map where the width of e
The above elevation map is represented by array [0,1,0,2,1,0,1,3,2,1,2,1]. In this case, 6 units of rain water (blue section) are being trapped. Thanks Marcos for contributing this image!
-Example:
+**Example**:
-```c
+```go
Input: [0,1,0,2,1,0,1,3,2,1,2,1]
Output: 6
```
@@ -23,7 +23,9 @@ Output: 6
## 解题思路
-
-
-
-每个数组里面的元素值可以想象成一个左右都有壁的圆柱筒。例如上图中左边的第二个元素 1，当前左边最大的元素是 2 ，所以 2 高度的水会装到 1 的上面(因为想象成了左右都有筒壁)。这道题的思路就是左指针从 0 开始往右扫，右指针从最右边开始往左扫。额外还需要 2 个变量分别记住左边最大的高度和右边最大高度。遍历扫数组元素的过程中，如果左指针的高度比右指针的高度小，就不断的移动左指针，否则移动右指针。循环的终止条件就是左右指针碰上以后就结束。只要数组中元素的高度比保存的局部最大高度小，就累加 res 的值，否则更新局部最大高度。最终解就是 res 的值。
\ No newline at end of file
+- 每个数组里面的元素值可以想象成一个左右都有壁的圆柱筒。例如下图中左边的第二个元素 1，当前左边最大的元素是 2 ，所以 2 高度的水会装到 1 的上面(因为想象成了左右都有筒壁)。这道题的思路就是左指针从 0 开始往右扫，右指针从最右边开始往左扫。额外还需要 2 个变量分别记住左边最大的高度和右边最大高度。遍历扫数组元素的过程中，如果左指针的高度比右指针的高度小，就不断的移动左指针，否则移动右指针。循环的终止条件就是左右指针碰上以后就结束。只要数组中元素的高度比保存的局部最大高度小，就累加 res 的值，否则更新局部最大高度。最终解就是 res 的值。
+ 
+- 抽象一下，本题是想求针对每个 i，找到它左边最大值 leftMax，右边的最大值 rightMax，然后 min(leftMax，rightMax) 为能够接到水的高度。left 和 right 指针是两边往中间移动的游标指针。最傻的解题思路是针对每个下标 i，往左循环找到第一个最大值，往右循环找到第一个最大值，然后把这两个最大值取出最小者，即为当前雨水的高度。这样做时间复杂度高，浪费了很多循环。i 在从左往右的过程中，是可以动态维护最大值的。右边的最大值用右边的游标指针来维护。从左往右扫一遍下标，和，从两边往中间遍历一遍下标，是相同的结果，每个下标都遍历了一次。
+ 
+- 每个 i 的宽度固定为 1，所以每个“坑”只需要求出高度，即当前这个“坑”能积攒的雨水。最后依次将每个“坑”中的雨水相加即是能接到的雨水数。
+ 
\ No newline at end of file
diff --git a/leetcode/0043.Multiply-Strings/43. Multiply Strings.go b/leetcode/0043.Multiply-Strings/43. Multiply Strings.go
new file mode 100644
index 000000000..88ab4b4c7
--- /dev/null
+++ b/leetcode/0043.Multiply-Strings/43. Multiply Strings.go
@@ -0,0 +1,25 @@
+package leetcode
+
+func multiply(num1 string, num2 string) string {
+ if num1 == "0" || num2 == "0" {
+ return "0"
+ }
+ b1, b2, tmp := []byte(num1), []byte(num2), make([]int, len(num1)+len(num2))
+ for i := 0; i < len(b1); i++ {
+ for j := 0; j < len(b2); j++ {
+ tmp[i+j+1] += int(b1[i]-'0') * int(b2[j]-'0')
+ }
+ }
+ for i := len(tmp) - 1; i > 0; i-- {
+ tmp[i-1] += tmp[i] / 10
+ tmp[i] = tmp[i] % 10
+ }
+ if tmp[0] == 0 {
+ tmp = tmp[1:]
+ }
+ res := make([]byte, len(tmp))
+ for i := 0; i < len(tmp); i++ {
+ res[i] = '0' + byte(tmp[i])
+ }
+ return string(res)
+}
diff --git a/leetcode/0043.Multiply-Strings/43. Multiply Strings_test.go b/leetcode/0043.Multiply-Strings/43. Multiply Strings_test.go
new file mode 100644
index 000000000..6017786e0
--- /dev/null
+++ b/leetcode/0043.Multiply-Strings/43. Multiply Strings_test.go
@@ -0,0 +1,48 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question43 struct {
+ para43
+ ans43
+}
+
+// para 是参数
+// one 代表第一个参数
+type para43 struct {
+ num1 string
+ num2 string
+}
+
+// ans 是答案
+// one 代表第一个答案
+type ans43 struct {
+ one string
+}
+
+func Test_Problem43(t *testing.T) {
+
+ qs := []question43{
+
+ {
+ para43{"2", "3"},
+ ans43{"6"},
+ },
+
+ {
+ para43{"123", "456"},
+ ans43{"56088"},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 43------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans43, q.para43
+ fmt.Printf("【input】:%v 【output】:%v\n", p, multiply(p.num1, p.num2))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/0043.Multiply-Strings/README.md b/leetcode/0043.Multiply-Strings/README.md
new file mode 100644
index 000000000..46410bd38
--- /dev/null
+++ b/leetcode/0043.Multiply-Strings/README.md
@@ -0,0 +1,66 @@
+# [43. Multiply Strings](https://leetcode.com/problems/multiply-strings/)
+
+
+## 题目
+
+Given two non-negative integers `num1` and `num2` represented as strings, return the product of `num1` and `num2`, also represented as a string.
+
+**Note:** You must not use any built-in BigInteger library or convert the inputs to integer directly.
+
+**Example 1:**
+
+```
+Input: num1 = "2", num2 = "3"
+Output: "6"
+```
+
+**Example 2:**
+
+```
+Input: num1 = "123", num2 = "456"
+Output: "56088"
+```
+
+**Constraints:**
+
+- `1 <= num1.length, num2.length <= 200`
+- `num1` and `num2` consist of digits only.
+- Both `num1` and `num2` do not contain any leading zero, except the number `0` itself.
+
+## 题目大意
+
+给定两个以字符串形式表示的非负整数 num1 和 num2，返回 num1 和 num2 的乘积，它们的乘积也表示为字符串形式。
+
+## 解题思路
+
+- 用数组模拟乘法。创建一个数组长度为 `len(num1) + len(num2)` 的数组用于存储乘积。对于任意 `0 ≤ i < len(num1)`，`0 ≤ j < len(num2)`，`num1[i] * num2[j]` 的结果位于 `tmp[i+j+1]`，如果 `tmp[i+j+1]≥10`，则将进位部分加到 `tmp[i+j]`。最后，将数组 `tmp` 转成字符串，如果最高位是 0 则舍弃最高位。
+
+## 代码
+
+```go
+package leetcode
+
+func multiply(num1 string, num2 string) string {
+ if num1 == "0" || num2 == "0" {
+ return "0"
+ }
+ b1, b2, tmp := []byte(num1), []byte(num2), make([]int, len(num1)+len(num2))
+ for i := 0; i < len(b1); i++ {
+ for j := 0; j < len(b2); j++ {
+ tmp[i+j+1] += int(b1[i]-'0') * int(b2[j]-'0')
+ }
+ }
+ for i := len(tmp) - 1; i > 0; i-- {
+ tmp[i-1] += tmp[i] / 10
+ tmp[i] = tmp[i] % 10
+ }
+ if tmp[0] == 0 {
+ tmp = tmp[1:]
+ }
+ res := make([]byte, len(tmp))
+ for i := 0; i < len(tmp); i++ {
+ res[i] = '0' + byte(tmp[i])
+ }
+ return string(res)
+}
+```
\ No newline at end of file
diff --git a/leetcode/0045.Jump-Game-II/45. Jump Game II.go b/leetcode/0045.Jump-Game-II/45. Jump Game II.go
new file mode 100644
index 000000000..2707e5dbd
--- /dev/null
+++ b/leetcode/0045.Jump-Game-II/45. Jump Game II.go
@@ -0,0 +1,21 @@
+package leetcode
+
+func jump(nums []int) int {
+ if len(nums) == 1 {
+ return 0
+ }
+ needChoose, canReach, step := 0, 0, 0
+ for i, x := range nums {
+ if i+x > canReach {
+ canReach = i + x
+ if canReach >= len(nums)-1 {
+ return step + 1
+ }
+ }
+ if i == needChoose {
+ needChoose = canReach
+ step++
+ }
+ }
+ return step
+}
diff --git a/leetcode/0045.Jump-Game-II/45. Jump Game II_test.go b/leetcode/0045.Jump-Game-II/45. Jump Game II_test.go
new file mode 100644
index 000000000..0e58e91ae
--- /dev/null
+++ b/leetcode/0045.Jump-Game-II/45. Jump Game II_test.go
@@ -0,0 +1,47 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question45 struct {
+ para45
+ ans45
+}
+
+// para 是参数
+// one 代表第一个参数
+type para45 struct {
+ nums []int
+}
+
+// ans 是答案
+// one 代表第一个答案
+type ans45 struct {
+ one int
+}
+
+func Test_Problem45(t *testing.T) {
+
+ qs := []question45{
+
+ {
+ para45{[]int{2, 3, 1, 1, 4}},
+ ans45{2},
+ },
+
+ {
+ para45{[]int{2, 3, 0, 1, 4}},
+ ans45{2},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 45------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans45, q.para45
+ fmt.Printf("【input】:%v 【output】:%v\n", p, jump(p.nums))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/0045.Jump-Game-II/README.md b/leetcode/0045.Jump-Game-II/README.md
new file mode 100644
index 000000000..e5394aa22
--- /dev/null
+++ b/leetcode/0045.Jump-Game-II/README.md
@@ -0,0 +1,67 @@
+# [45. Jump Game II](https://leetcode.com/problems/jump-game-ii/)
+
+
+## 题目
+
+Given an array of non-negative integers `nums`, you are initially positioned at the first index of the array.
+
+Each element in the array represents your maximum jump length at that position.
+
+Your goal is to reach the last index in the minimum number of jumps.
+
+You can assume that you can always reach the last index.
+
+**Example 1:**
+
+```
+Input: nums = [2,3,1,1,4]
+Output: 2
+Explanation: The minimum number of jumps to reach the last index is 2. Jump 1 step from index 0 to 1, then 3 steps to the last index.
+```
+
+**Example 2:**
+
+```
+Input: nums = [2,3,0,1,4]
+Output: 2
+```
+
+**Constraints:**
+
+- `1 <= nums.length <= 1000`
+- `0 <= nums[i] <= 10^5`
+
+## 题目大意
+
+给定一个非负整数数组，你最初位于数组的第一个位置。数组中的每个元素代表你在该位置可以跳跃的最大长度。你的目标是使用最少的跳跃次数到达数组的最后一个位置。
+
+## 解题思路
+
+- 要求找到最少跳跃次数，顺理成章的会想到用贪心算法解题。扫描步数数组，维护当前能够到达最大下标的位置，记为能到达的最远边界，如果扫描过程中到达了最远边界，更新边界并将跳跃次数 + 1。
+- 扫描数组的时候，其实不需要扫描最后一个元素，因为在跳到最后一个元素之前，能到达的最远边界一定大于等于最后一个元素的位置，不然就跳不到最后一个元素，到达不了终点了；如果遍历到最后一个元素，说明边界正好为最后一个位置，最终跳跃次数直接 + 1 即可，也不需要访问最后一个元素。
+
+## 代码
+
+```go
+package leetcode
+
+func jump(nums []int) int {
+ if len(nums) == 1 {
+ return 0
+ }
+ needChoose, canReach, step := 0, 0, 0
+ for i, x := range nums {
+ if i+x > canReach {
+ canReach = i + x
+ if canReach >= len(nums)-1 {
+ return step + 1
+ }
+ }
+ if i == needChoose {
+ needChoose = canReach
+ step++
+ }
+ }
+ return step
+}
+```
\ No newline at end of file
diff --git a/leetcode/0048.Rotate-Image/48. Rotate Image.go b/leetcode/0048.Rotate-Image/48. Rotate Image.go
index a21d5fa80..f27e91e35 100644
--- a/leetcode/0048.Rotate-Image/48. Rotate Image.go
+++ b/leetcode/0048.Rotate-Image/48. Rotate Image.go
@@ -1,26 +1,61 @@
package leetcode
+// 解法一
func rotate(matrix [][]int) {
- row := len(matrix)
- if row <= 0 {
- return
- }
- column := len(matrix[0])
+ length := len(matrix)
// rotate by diagonal 对角线变换
- for i := 0; i < row; i++ {
- for j := i + 1; j < column; j++ {
- tmp := matrix[i][j]
- matrix[i][j] = matrix[j][i]
- matrix[j][i] = tmp
+ for i := 0; i < length; i++ {
+ for j := i + 1; j < length; j++ {
+ matrix[i][j], matrix[j][i] = matrix[j][i], matrix[i][j]
}
}
// rotate by vertical centerline 竖直轴对称翻转
- halfColumn := column / 2
- for i := 0; i < row; i++ {
- for j := 0; j < halfColumn; j++ {
- tmp := matrix[i][j]
- matrix[i][j] = matrix[i][column-j-1]
- matrix[i][column-j-1] = tmp
+ for i := 0; i < length; i++ {
+ for j := 0; j < length/2; j++ {
+ matrix[i][j], matrix[i][length-j-1] = matrix[i][length-j-1], matrix[i][j]
}
}
}
+
+// 解法二
+func rotate1(matrix [][]int) {
+ n := len(matrix)
+ if n == 1 {
+ return
+ }
+ /* rotate clock-wise = 1. transpose matrix => 2. reverse(matrix[i])
+
+ 1 2 3 4 1 5 9 13 13 9 5 1
+ 5 6 7 8 => 2 6 10 14 => 14 10 6 2
+ 9 10 11 12 3 7 11 15 15 11 7 3
+ 13 14 15 16 4 8 12 16 16 12 8 4
+
+ */
+
+ for i := 0; i < n; i++ {
+ // transpose, i=rows, j=columns
+ // j = i+1, coz diagonal elements didn't change in a square matrix
+ for j := i + 1; j < n; j++ {
+ swap(matrix, i, j)
+ }
+ // reverse each row of the image
+ matrix[i] = reverse(matrix[i])
+ }
+}
+
+// swap changes original slice's i,j position
+func swap(nums [][]int, i, j int) {
+ nums[i][j], nums[j][i] = nums[j][i], nums[i][j]
+}
+
+// reverses a row of image, matrix[i]
+func reverse(nums []int) []int {
+ var lp, rp = 0, len(nums) - 1
+
+ for lp < rp {
+ nums[lp], nums[rp] = nums[rp], nums[lp]
+ lp++
+ rp--
+ }
+ return nums
+}
diff --git a/leetcode/0048.Rotate-Image/README.md b/leetcode/0048.Rotate-Image/README.md
index d05ee7d3e..1a07a97d9 100755
--- a/leetcode/0048.Rotate-Image/README.md
+++ b/leetcode/0048.Rotate-Image/README.md
@@ -10,8 +10,9 @@ Rotate the image by 90 degrees (clockwise).
You have to rotate the image **[in-place](https://en.wikipedia.org/wiki/In-place_algorithm)**, which means you have to modify the input 2D matrix directly. **DO NOT** allocate another 2D matrix and do the rotation.
-**Example 1:**
+**Example 1**:
+
Given input matrix =
[
@@ -28,8 +29,9 @@ You have to rotate the image **[in-place](https://en.wikipedia.org/wiki/In-plac
]
-**Example 2:**
+**Example 2**:
+
Given input matrix =
[
diff --git a/leetcode/0051.N-Queens/51. N-Queens.go b/leetcode/0051.N-Queens/51. N-Queens.go
index de68f47bd..ba63a9100 100644
--- a/leetcode/0051.N-Queens/51. N-Queens.go
+++ b/leetcode/0051.N-Queens/51. N-Queens.go
@@ -47,39 +47,45 @@ func generateBoard(n int, row *[]int) []string {
return board
}
-// 解法二 二进制操作法
-// class Solution
-// {
-// int n;
-// string getNq(int p)
-// {
-// string s(n, '.');
-// s[p] = 'Q';
-// return s;
-// }
-// void nQueens(int p, int l, int m, int r, vector<vector<string>> &res)
-// {
-// static vector<string> ans;
-// if (p >= n)
-// {
-// res.push_back(ans);
-// return ;
-// }
-// int mask = l | m | r;
-// for (int i = 0, b = 1; i < n; ++ i, b <<= 1)
-// if (!(mask & b))
-// {
-// ans.push_back(getNq(i));
-// nQueens(p + 1, (l | b) >> 1, m | b, (r | b) << 1, res);
-// ans.pop_back();
-// }
-// }
-// public:
-// vector<vector<string> > solveNQueens(int n)
-// {
-// this->n = n;
-// vector<vector<string>> res;
-// nQueens(0, 0, 0, 0, res);
-// return res;
-// }
-// };
+// 解法二 二进制操作法 Signed-off-by: Hanlin Shi shihanlin9@gmail.com
+func solveNQueens2(n int) (res [][]string) {
+ placements := make([]string, n)
+ for i := range placements {
+ buf := make([]byte, n)
+ for j := range placements {
+ if i == j {
+ buf[j] = 'Q'
+ } else {
+ buf[j] = '.'
+ }
+ }
+ placements[i] = string(buf)
+ }
+ var construct func(prev []int)
+ construct = func(prev []int) {
+ if len(prev) == n {
+ plan := make([]string, n)
+ for i := 0; i < n; i++ {
+ plan[i] = placements[prev[i]]
+ }
+ res = append(res, plan)
+ return
+ }
+ occupied := 0
+ for i := range prev {
+ dist := len(prev) - i
+ bit := 1 << prev[i]
+ occupied |= bit | bit<<dist | bit>>dist
+ }
+ prev = append(prev, -1)
+ for i := 0; i < n; i++ {
+ if (occupied>>i)&1 != 0 {
+ continue
+ }
+ prev[len(prev)-1] = i
+ construct(prev)
+ }
+ }
+ construct(make([]int, 0, n))
+ return
+}
diff --git a/leetcode/0051.N-Queens/README.md b/leetcode/0051.N-Queens/README.md
index c2be733ec..6fcabdee5 100755
--- a/leetcode/0051.N-Queens/README.md
+++ b/leetcode/0051.N-Queens/README.md
@@ -40,4 +40,5 @@ Each solution contains a distinct board configuration of the *n*-queens' placem
- 利用 col 数组记录列信息，col 有 `n` 列。用 dia1，dia2 记录从左下到右上的对角线，从左上到右下的对角线的信息，dia1 和 dia2 分别都有 `2*n-1` 个。
- dia1 对角线的规律是 `i + j 是定值`，例如[0,0]，为 0；[1,0]、[0,1] 为 1；[2,0]、[1,1]、[0,2] 为 2；
- dia2 对角线的规律是 `i - j 是定值`，例如[0,7]，为 -7；[0,6]、[1,7] 为 -6；[0,5]、[1,6]、[2,7] 为 -5；为了使他们从 0 开始，i - j + n - 1 偏移到 0 开始，所以 dia2 的规律是 `i - j + n - 1 为定值`。
+- 还有一个位运算的方法，每行只能选一个位置放皇后，那么对每行遍历可能放皇后的位置。如何高效判断哪些点不能放皇后呢？这里的做法毕竟巧妙，把所有之前选过的点按照顺序存下来，然后根据之前选的点到当前行的距离，就可以快速判断是不是会有冲突。举个例子: 假如在 4 皇后问题中，如果第一二行已经选择了位置 [1, 3]，那么在第三行选择时，首先不能再选 1, 3 列了，而对于第三行， 1 距离长度为2，所以它会影响到 -1, 3 两个列。同理，3 在第二行，距离第三行为 1，所以 3 会影响到列 2, 4。由上面的结果，我们知道 -1, 4 超出边界了不用去管，别的不能选的点是 1, 2, 3，所以第三行就只能选 0。在代码实现中，可以在每次遍历前根据之前选择的情况生成一个 occupied 用来记录当前这一行，已经被选了的和由于之前皇后攻击范围所以不能选的位置，然后只选择合法的位置进入到下一层递归。另外就是预处理了一个皇后放不同位置的字符串，这样这些字符串在返回结果的时候是可以在内存中复用的，省一点内存。
diff --git a/leetcode/0058.Length-of-Last-Word/58.Length of Last Word.go b/leetcode/0058.Length-of-Last-Word/58.Length of Last Word.go
new file mode 100644
index 000000000..5fccdb64a
--- /dev/null
+++ b/leetcode/0058.Length-of-Last-Word/58.Length of Last Word.go
@@ -0,0 +1,16 @@
+package leetcode
+
+func lengthOfLastWord(s string) int {
+ last := len(s) - 1
+ for last >= 0 && s[last] == ' ' {
+ last--
+ }
+ if last < 0 {
+ return 0
+ }
+ first := last
+ for first >= 0 && s[first] != ' ' {
+ first--
+ }
+ return last - first
+}
diff --git a/leetcode/0058.Length-of-Last-Word/58.Length of Last Word_test.go b/leetcode/0058.Length-of-Last-Word/58.Length of Last Word_test.go
new file mode 100644
index 000000000..b47de4b7a
--- /dev/null
+++ b/leetcode/0058.Length-of-Last-Word/58.Length of Last Word_test.go
@@ -0,0 +1,50 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question58 struct {
+ para58
+ ans58
+}
+
+// para 是参数
+type para58 struct {
+ s string
+}
+
+// ans 是答案
+type ans58 struct {
+ ans int
+}
+
+func Test_Problem58(t *testing.T) {
+
+ qs := []question58{
+
+ {
+ para58{"Hello World"},
+ ans58{5},
+ },
+
+ {
+ para58{" fly me to the moon "},
+ ans58{4},
+ },
+
+ {
+ para58{"luffy is still joyboy"},
+ ans58{6},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 58------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans58, q.para58
+ fmt.Printf("【input】:%v 【output】:%v\n", p, lengthOfLastWord(p.s))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/0058.Length-of-Last-Word/README.md b/leetcode/0058.Length-of-Last-Word/README.md
new file mode 100644
index 000000000..39df720a6
--- /dev/null
+++ b/leetcode/0058.Length-of-Last-Word/README.md
@@ -0,0 +1,70 @@
+# [58. Length of Last Word](https://leetcode.com/problems/length-of-last-word/)
+
+
+## 题目
+
+Given a string `s` consisting of some words separated by some number of spaces, return *the length of the **last** word in the string.*
+
+A **word** is a maximal substring consisting of non-space characters only.
+
+**Example 1:**
+
+```
+Input: s = "Hello World"
+Output: 5
+Explanation: The last word is "World" with length 5.
+
+```
+
+**Example 2:**
+
+```
+Input: s = " fly me to the moon "
+Output: 4
+Explanation: The last word is "moon" with length 4.
+
+```
+
+**Example 3:**
+
+```
+Input: s = "luffy is still joyboy"
+Output: 6
+Explanation: The last word is "joyboy" with length 6.
+
+```
+
+**Constraints:**
+
+- `1 <= s.length <= 104`
+- `s` consists of only English letters and spaces `' '`.
+- There will be at least one word in `s`.
+
+## 题目大意
+
+给你一个字符串 `s`，由若干单词组成，单词前后用一些空格字符隔开。返回字符串中最后一个单词的长度。**单词** 是指仅由字母组成、不包含任何空格字符的最大子字符串。
+
+## 解题思路
+
+- 先从后过滤掉空格找到单词尾部，再从尾部向前遍历，找到单词头部，最后两者相减，即为单词的长度。
+
+## 代码
+
+```go
+package leetcode
+
+func lengthOfLastWord(s string) int {
+ last := len(s) - 1
+ for last >= 0 && s[last] == ' ' {
+ last--
+ }
+ if last < 0 {
+ return 0
+ }
+ first := last
+ for first >= 0 && s[first] != ' ' {
+ first--
+ }
+ return last - first
+}
+```
\ No newline at end of file
diff --git a/leetcode/0062.Unique-Paths/62. Unique Paths.go b/leetcode/0062.Unique-Paths/62. Unique Paths.go
index f4d6b2859..aeb84056a 100644
--- a/leetcode/0062.Unique-Paths/62. Unique Paths.go
+++ b/leetcode/0062.Unique-Paths/62. Unique Paths.go
@@ -5,14 +5,12 @@ func uniquePaths(m int, n int) int {
for i := 0; i < n; i++ {
dp[i] = make([]int, m)
}
- for i := 0; i < m; i++ {
- dp[0][i] = 1
- }
for i := 0; i < n; i++ {
- dp[i][0] = 1
- }
- for i := 1; i < n; i++ {
- for j := 1; j < m; j++ {
+ for j := 0; j < m; j++ {
+ if i == 0 || j == 0 {
+ dp[i][j] = 1
+ continue
+ }
dp[i][j] = dp[i-1][j] + dp[i][j-1]
}
}
diff --git a/leetcode/0065.Valid-Number/65. Valid Number.go b/leetcode/0065.Valid-Number/65. Valid Number.go
new file mode 100644
index 000000000..c1cd1fe7c
--- /dev/null
+++ b/leetcode/0065.Valid-Number/65. Valid Number.go
@@ -0,0 +1,22 @@
+package leetcode
+
+func isNumber(s string) bool {
+ numFlag, dotFlag, eFlag := false, false, false
+ for i := 0; i < len(s); i++ {
+ if '0' <= s[i] && s[i] <= '9' {
+ numFlag = true
+ } else if s[i] == '.' && !dotFlag && !eFlag {
+ dotFlag = true
+ } else if (s[i] == 'e' || s[i] == 'E') && !eFlag && numFlag {
+ eFlag = true
+ numFlag = false // reJudge integer after 'e' or 'E'
+ } else if (s[i] == '+' || s[i] == '-') && (i == 0 || s[i-1] == 'e' || s[i-1] == 'E') {
+ continue
+ } else {
+ return false
+ }
+ }
+ // avoid case: s == '.' or 'e/E' or '+/-' and etc...
+ // string s must have num
+ return numFlag
+}
diff --git a/leetcode/0065.Valid-Number/65. Valid Number_test.go b/leetcode/0065.Valid-Number/65. Valid Number_test.go
new file mode 100644
index 000000000..184e1d4ab
--- /dev/null
+++ b/leetcode/0065.Valid-Number/65. Valid Number_test.go
@@ -0,0 +1,41 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+func Test_Problem65(t *testing.T) {
+
+ tcs := []struct {
+ s string
+ ans bool
+ }{
+
+ {
+ "0",
+ true,
+ },
+
+ {
+ "e",
+ false,
+ },
+
+ {
+ ".",
+ false,
+ },
+
+ {
+ ".1",
+ true,
+ },
+ }
+ fmt.Printf("------------------------Leetcode Problem 65------------------------\n")
+
+ for _, tc := range tcs {
+ fmt.Printf("【input】:%v 【output】:%v\n", tc, isNumber(tc.s))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/0065.Valid-Number/README.md b/leetcode/0065.Valid-Number/README.md
new file mode 100644
index 000000000..f64df4566
--- /dev/null
+++ b/leetcode/0065.Valid-Number/README.md
@@ -0,0 +1,78 @@
+# [65. Valid Number](https://leetcode.com/problems/valid-number/)
+
+
+## 题目
+
+A **valid number** can be split up into these components (in order):
+
+ 1. A **decimal number** or an integer.
+ 2. (Optional) An 'e' or 'E', followed by an **integer.**
+
+A **decimal number** can be split up into these components (in order):
+
+ 1. (Optional) A sign character (either '+' or '-').
+ 2. One of the following formats:
+ 1. One or more digits, followed by a dot '.'.
+ 2. One or more digits, followed by a dot '.', followed by one or more digits.
+ 3. A dot '.', followed by one or more digits.
+
+An **integer** can be split up into these components (in order):
+
+ 1. (Optional) A sign character (either '+' or '-').
+ 2. One or more digits.
+
+For example, all the following are valid numbers: `["2", "0089", "-0.1", "+3.14", "4.", "-.9", "2e10", "-90E3", "3e+7", "+6e-1", "53.5e93", "-123.456e789"]`, while the following are not valid numbers: `["abc", "1a", "1e", "e3", "99e2.5", "--6", "-+3", "95a54e53"].`
+
+Given a string s, return true if s is a **valid number.**
+
+**Example:**
+
+ Input: s = "0"
+ Output: true
+
+ Input: s = "e"
+ Output: false
+
+## 题目大意
+
+给定一个字符串S，请根据以上的规则判断该字符串是否是一个有效的数字字符串。
+
+
+## 解题思路
+
+- 用三个变量分别标记是否出现过数字、是否出现过'.'和 是否出现过 'e/E'
+- 从左到右依次遍历字符串中的每一个元素
+ - 如果是数字，则标记数字出现过
+ - 如果是 '.', 则需要 '.'没有出现过，并且 'e/E' 没有出现过，才会进行标记
+ - 如果是 'e/E', 则需要 'e/E'没有出现过，并且前面出现过数字，才会进行标记
+ - 如果是 '+/-', 则需要是第一个字符，或者前一个字符是 'e/E'，才会进行标记，并重置数字出现的标识
+ - 最后返回时，需要字符串中至少出现过数字，避免下列case: s == '.' or 'e/E' or '+/e' and etc...
+
+## 代码
+
+```go
+
+package leetcode
+
+func isNumber(s string) bool {
+ numFlag, dotFlag, eFlag := false, false, false
+ for i := 0; i < len(s); i++ {
+ if '0' <= s[i] && s[i] <= '9' {
+ numFlag = true
+ } else if s[i] == '.' && !dotFlag && !eFlag {
+ dotFlag = true
+ } else if (s[i] == 'e' || s[i] == 'E') && !eFlag && numFlag {
+ eFlag = true
+ numFlag = false // reJudge integer after 'e' or 'E'
+ } else if (s[i] == '+' || s[i] == '-') && (i == 0 || s[i-1] == 'e' || s[i-1] == 'E') {
+ continue
+ } else {
+ return false
+ }
+ }
+ // avoid case: s == '.' or 'e/E' or '+/-' and etc...
+ // string s must have num
+ return numFlag
+}
+
+```
\ No newline at end of file
diff --git a/leetcode/0066.Plus-One/66. Plus One.go b/leetcode/0066.Plus-One/66. Plus One.go
index 1e6572e8d..9a58ea973 100644
--- a/leetcode/0066.Plus-One/66. Plus One.go
+++ b/leetcode/0066.Plus-One/66. Plus One.go
@@ -1,21 +1,12 @@
package leetcode
func plusOne(digits []int) []int {
- if len(digits) == 0 {
- return []int{}
- }
- carry := 1
for i := len(digits) - 1; i >= 0; i-- {
- if digits[i]+carry > 9 {
- digits[i] = 0
- carry = 1
- } else {
- digits[i] += carry
- carry = 0
+ if digits[i] != 9 {
+ digits[i]++
+ return digits
}
+ digits[i] = 0
}
- if digits[0] == 0 && carry == 1 {
- digits = append([]int{1}, digits...)
- }
- return digits
+ return append([]int{1}, digits...)
}
diff --git a/leetcode/0069.Sqrtx/69. Sqrt(x).go b/leetcode/0069.Sqrtx/69. Sqrt(x).go
index c228c82d0..33d21aee2 100644
--- a/leetcode/0069.Sqrtx/69. Sqrt(x).go
+++ b/leetcode/0069.Sqrtx/69. Sqrt(x).go
@@ -1,23 +1,17 @@
package leetcode
-// 解法一 二分
+// 解法一 二分, 找到最后一个满足 n^2 <= x 的整数n
func mySqrt(x int) int {
- if x == 0 {
- return 0
- }
- left, right, res := 1, x, 0
- for left <= right {
- mid := left + ((right - left) >> 1)
- if mid < x/mid {
- left = mid + 1
- res = mid
- } else if mid == x/mid {
- return mid
+ l, r := 0, x
+ for l < r {
+ mid := (l + r + 1) / 2
+ if mid*mid > x {
+ r = mid - 1
} else {
- right = mid - 1
+ l = mid
}
}
- return res
+ return l
}
// 解法二 牛顿迭代法 https://en.wikipedia.org/wiki/Integer_square_root
diff --git a/leetcode/0073.Set-Matrix-Zeroes/73. Set Matrix Zeroes.go b/leetcode/0073.Set-Matrix-Zeroes/73. Set Matrix Zeroes.go
new file mode 100644
index 000000000..09882130f
--- /dev/null
+++ b/leetcode/0073.Set-Matrix-Zeroes/73. Set Matrix Zeroes.go
@@ -0,0 +1,54 @@
+package leetcode
+
+func setZeroes(matrix [][]int) {
+ if len(matrix) == 0 || len(matrix[0]) == 0 {
+ return
+ }
+ isFirstRowExistZero, isFirstColExistZero := false, false
+ for i := 0; i < len(matrix); i++ {
+ if matrix[i][0] == 0 {
+ isFirstColExistZero = true
+ break
+ }
+ }
+ for j := 0; j < len(matrix[0]); j++ {
+ if matrix[0][j] == 0 {
+ isFirstRowExistZero = true
+ break
+ }
+ }
+ for i := 1; i < len(matrix); i++ {
+ for j := 1; j < len(matrix[0]); j++ {
+ if matrix[i][j] == 0 {
+ matrix[i][0] = 0
+ matrix[0][j] = 0
+ }
+ }
+ }
+ // 处理[1:]行全部置 0
+ for i := 1; i < len(matrix); i++ {
+ if matrix[i][0] == 0 {
+ for j := 1; j < len(matrix[0]); j++ {
+ matrix[i][j] = 0
+ }
+ }
+ }
+ // 处理[1:]列全部置 0
+ for j := 1; j < len(matrix[0]); j++ {
+ if matrix[0][j] == 0 {
+ for i := 1; i < len(matrix); i++ {
+ matrix[i][j] = 0
+ }
+ }
+ }
+ if isFirstRowExistZero {
+ for j := 0; j < len(matrix[0]); j++ {
+ matrix[0][j] = 0
+ }
+ }
+ if isFirstColExistZero {
+ for i := 0; i < len(matrix); i++ {
+ matrix[i][0] = 0
+ }
+ }
+}
diff --git a/leetcode/0073.Set-Matrix-Zeroes/73. Set Matrix Zeroes_test.go b/leetcode/0073.Set-Matrix-Zeroes/73. Set Matrix Zeroes_test.go
new file mode 100644
index 000000000..e4b23425d
--- /dev/null
+++ b/leetcode/0073.Set-Matrix-Zeroes/73. Set Matrix Zeroes_test.go
@@ -0,0 +1,47 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question73 struct {
+ para73
+ ans73
+}
+
+// para 是参数
+// one 代表第一个参数
+type para73 struct {
+ matrix [][]int
+}
+
+// ans 是答案
+// one 代表第一个答案
+type ans73 struct {
+}
+
+func Test_Problem73(t *testing.T) {
+
+ qs := []question73{
+
+ {
+ para73{[][]int{
+ {0, 1, 2, 0},
+ {3, 4, 5, 2},
+ {1, 3, 1, 5},
+ }},
+ ans73{},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 73------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans73, q.para73
+ fmt.Printf("【input】:%v ", p)
+ setZeroes(p.matrix)
+ fmt.Printf("【output】:%v\n", p)
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/0073.Set-Matrix-Zeroes/README.md b/leetcode/0073.Set-Matrix-Zeroes/README.md
new file mode 100644
index 000000000..e3f7a2b83
--- /dev/null
+++ b/leetcode/0073.Set-Matrix-Zeroes/README.md
@@ -0,0 +1,104 @@
+# [73. Set Matrix Zeroes](https://leetcode.com/problems/set-matrix-zeroes/)
+
+
+## 题目
+
+Given an *`m* x *n*` matrix. If an element is **0**, set its entire row and column to **0**. Do it **[in-place](https://en.wikipedia.org/wiki/In-place_algorithm)**.
+
+**Follow up:**
+
+- A straight forward solution using O(*mn*) space is probably a bad idea.
+- A simple improvement uses O(*m* + *n*) space, but still not the best solution.
+- Could you devise a constant space solution?
+
+**Example 1:**
+
+
+
+```
+Input: matrix = [[1,1,1],[1,0,1],[1,1,1]]
+Output: [[1,0,1],[0,0,0],[1,0,1]]
+```
+
+**Example 2:**
+
+
+
+```
+Input: matrix = [[0,1,2,0],[3,4,5,2],[1,3,1,5]]
+Output: [[0,0,0,0],[0,4,5,0],[0,3,1,0]]
+```
+
+**Constraints:**
+
+- `m == matrix.length`
+- `n == matrix[0].length`
+- `1 <= m, n <= 200`
+- `2^31 <= matrix[i][j] <= 2^31 - 1`
+
+## 题目大意
+
+给定一个 `m x n` 的矩阵，如果一个元素为 0，则将其所在行和列的所有元素都设为 0。请使用原地算法。
+
+## 解题思路
+
+- 此题考查对程序的控制能力，无算法思想。题目要求采用原地的算法，所有修改即在原二维数组上进行。在二维数组中有 2 个特殊位置，一个是第一行，一个是第一列。它们的特殊性在于，它们之间只要有一个 0，它们都会变为全 0 。先用 2 个变量记录这一行和这一列中是否有 0，防止之后的修改覆盖了这 2 个地方。然后除去这一行和这一列以外的部分判断是否有 0，如果有 0，将它们所在的行第一个元素标记为 0，所在列的第一个元素标记为 0 。最后通过标记，将对应的行列置 0 即可。
+
+## 代码
+
+```go
+package leetcode
+
+func setZeroes(matrix [][]int) {
+ if len(matrix) == 0 || len(matrix[0]) == 0 {
+ return
+ }
+ isFirstRowExistZero, isFirstColExistZero := false, false
+ for i := 0; i < len(matrix); i++ {
+ if matrix[i][0] == 0 {
+ isFirstColExistZero = true
+ break
+ }
+ }
+ for j := 0; j < len(matrix[0]); j++ {
+ if matrix[0][j] == 0 {
+ isFirstRowExistZero = true
+ break
+ }
+ }
+ for i := 1; i < len(matrix); i++ {
+ for j := 1; j < len(matrix[0]); j++ {
+ if matrix[i][j] == 0 {
+ matrix[i][0] = 0
+ matrix[0][j] = 0
+ }
+ }
+ }
+ // 处理[1:]行全部置 0
+ for i := 1; i < len(matrix); i++ {
+ if matrix[i][0] == 0 {
+ for j := 1; j < len(matrix[0]); j++ {
+ matrix[i][j] = 0
+ }
+ }
+ }
+ // 处理[1:]列全部置 0
+ for j := 1; j < len(matrix[0]); j++ {
+ if matrix[0][j] == 0 {
+ for i := 1; i < len(matrix); i++ {
+ matrix[i][j] = 0
+ }
+ }
+ }
+ if isFirstRowExistZero {
+ for j := 0; j < len(matrix[0]); j++ {
+ matrix[0][j] = 0
+ }
+ }
+ if isFirstColExistZero {
+ for i := 0; i < len(matrix); i++ {
+ matrix[i][0] = 0
+ }
+ }
+}
+```
\ No newline at end of file
diff --git a/leetcode/0075.Sort-Colors/75. Sort Colors.go b/leetcode/0075.Sort-Colors/75. Sort Colors.go
index 6440d550c..573ef53fe 100644
--- a/leetcode/0075.Sort-Colors/75. Sort Colors.go
+++ b/leetcode/0075.Sort-Colors/75. Sort Colors.go
@@ -1,28 +1,16 @@
package leetcode
func sortColors(nums []int) {
- if len(nums) == 0 {
- return
- }
-
- r := 0
- w := 0
- b := 0 // label the end of different colors;
- for _, num := range nums {
- if num == 0 {
- nums[b] = 2
- b++
- nums[w] = 1
- w++
- nums[r] = 0
- r++
- } else if num == 1 {
- nums[b] = 2
- b++
- nums[w] = 1
- w++
- } else if num == 2 {
- b++
+ zero, one := 0, 0
+ for i, n := range nums {
+ nums[i] = 2
+ if n <= 1 {
+ nums[one] = 1
+ one++
+ }
+ if n == 0 {
+ nums[zero] = 0
+ zero++
}
}
}
diff --git a/leetcode/0076.Minimum-Window-Substring/76. Minimum Window Substring.go b/leetcode/0076.Minimum-Window-Substring/76. Minimum Window Substring.go
index ece9380ca..8d8808f1d 100644
--- a/leetcode/0076.Minimum-Window-Substring/76. Minimum Window Substring.go
+++ b/leetcode/0076.Minimum-Window-Substring/76. Minimum Window Substring.go
@@ -32,9 +32,7 @@ func minWindow(s string, t string) string {
}
}
if finalLeft != -1 {
- for i := finalLeft; i < finalRight+1; i++ {
- result += string(s[i])
- }
+ result = string(s[finalLeft : finalRight+1])
}
return result
}
diff --git a/leetcode/0080.Remove-Duplicates-from-Sorted-Array-II/80. Remove Duplicates from Sorted Array II.go b/leetcode/0080.Remove-Duplicates-from-Sorted-Array-II/80. Remove Duplicates from Sorted Array II.go
index ae6e64c5b..dfb67fd53 100644
--- a/leetcode/0080.Remove-Duplicates-from-Sorted-Array-II/80. Remove Duplicates from Sorted Array II.go
+++ b/leetcode/0080.Remove-Duplicates-from-Sorted-Array-II/80. Remove Duplicates from Sorted Array II.go
@@ -1,35 +1,12 @@
package leetcode
-func removeDuplicates80(nums []int) int {
- if len(nums) == 0 {
- return 0
- }
- last, finder := 0, 0
- for last < len(nums)-1 {
- startFinder := -1
- for nums[finder] == nums[last] {
- if startFinder == -1 || startFinder > finder {
- startFinder = finder
- }
- if finder == len(nums)-1 {
- break
- }
- finder++
- }
- if finder-startFinder >= 2 && nums[finder-1] == nums[last] && nums[finder] != nums[last] {
- nums[last+1] = nums[finder-1]
- nums[last+2] = nums[finder]
- last += 2
- } else {
- nums[last+1] = nums[finder]
- last++
- }
- if finder == len(nums)-1 {
- if nums[finder] != nums[last-1] {
- nums[last] = nums[finder]
- }
- return last + 1
+func removeDuplicates(nums []int) int {
+ slow := 0
+ for fast, v := range nums {
+ if fast < 2 || nums[slow-2] != v {
+ nums[slow] = v
+ slow++
}
}
- return last + 1
+ return slow
}
diff --git a/leetcode/0080.Remove-Duplicates-from-Sorted-Array-II/80. Remove Duplicates from Sorted Array II_test.go b/leetcode/0080.Remove-Duplicates-from-Sorted-Array-II/80. Remove Duplicates from Sorted Array II_test.go
index f64d4c86f..76939aab3 100644
--- a/leetcode/0080.Remove-Duplicates-from-Sorted-Array-II/80. Remove Duplicates from Sorted Array II_test.go
+++ b/leetcode/0080.Remove-Duplicates-from-Sorted-Array-II/80. Remove Duplicates from Sorted Array II_test.go
@@ -61,7 +61,7 @@ func Test_Problem80(t *testing.T) {
for _, q := range qs {
_, p := q.ans80, q.para80
- fmt.Printf("【input】:%v 【output】:%v\n", p.one, removeDuplicates80(p.one))
+ fmt.Printf("【input】:%v 【output】:%v\n", p.one, removeDuplicates(p.one))
}
fmt.Printf("\n\n\n")
}
diff --git a/leetcode/0080.Remove-Duplicates-from-Sorted-Array-II/README.md b/leetcode/0080.Remove-Duplicates-from-Sorted-Array-II/README.md
index e6cbed428..1c1b25e39 100644
--- a/leetcode/0080.Remove-Duplicates-from-Sorted-Array-II/README.md
+++ b/leetcode/0080.Remove-Duplicates-from-Sorted-Array-II/README.md
@@ -51,6 +51,6 @@ for (int i = 0; i < len; i++) {
## 解题思路
-这道题和第 26 题很像。是第 26 题的加强版。这道题和第 283 题，第 27 题基本一致，283 题是删除 0，27 题是删除指定元素，这一题是删除重复元素，实质是一样的。
-
-这里数组的删除并不是真的删除，只是将删除的元素移动到数组后面的空间内，然后返回数组实际剩余的元素个数，OJ 最终判断题目的时候会读取数组剩余个数的元素进行输出。
+- 问题提示有序数组，一般最容易想到使用双指针的解法，双指针的关键点：移动两个指针的条件。
+- 在该题中移动的条件：快指针从头遍历数组，慢指针指向修改后的数组的末端，当慢指针指向倒数第二个数与快指针指向的数不相等时，才移动慢指针，同时赋值慢指针。
+- 处理边界条件：当数组小于两个元素时，不做处理。
diff --git a/leetcode/0082.Remove-Duplicates-from-Sorted-List-II/82. Remove Duplicates from Sorted List II.go b/leetcode/0082.Remove-Duplicates-from-Sorted-List-II/82. Remove Duplicates from Sorted List II.go
index 2a2353328..aa08a6ce2 100644
--- a/leetcode/0082.Remove-Duplicates-from-Sorted-List-II/82. Remove Duplicates from Sorted List II.go
+++ b/leetcode/0082.Remove-Duplicates-from-Sorted-List-II/82. Remove Duplicates from Sorted List II.go
@@ -94,63 +94,63 @@ func deleteDuplicates(head *ListNode) *ListNode {
// 双循环简单解法 O(n*m)
func deleteDuplicates3(head *ListNode) *ListNode {
- if head == nil {
- return head
- }
+ if head == nil {
+ return head
+ }
- nilNode := &ListNode{Val: 0, Next: head}
- head = nilNode
+ nilNode := &ListNode{Val: 0, Next: head}
+ head = nilNode
- lastVal := 0
- for head.Next != nil && head.Next.Next != nil {
- if head.Next.Val == head.Next.Next.Val {
- lastVal = head.Next.Val
- for head.Next != nil && lastVal == head.Next.Val {
- head.Next = head.Next.Next
- }
- } else {
- head = head.Next
- }
- }
- return nilNode.Next
+ lastVal := 0
+ for head.Next != nil && head.Next.Next != nil {
+ if head.Next.Val == head.Next.Next.Val {
+ lastVal = head.Next.Val
+ for head.Next != nil && lastVal == head.Next.Val {
+ head.Next = head.Next.Next
+ }
+ } else {
+ head = head.Next
+ }
+ }
+ return nilNode.Next
}
// 双指针+删除标志位，单循环解法 O(n)
func deleteDuplicates4(head *ListNode) *ListNode {
- if head == nil || head.Next == nil {
- return head
- }
+ if head == nil || head.Next == nil {
+ return head
+ }
- nilNode := &ListNode{Val: 0, Next: head}
- // 上次遍历有删除操作的标志位
- lastIsDel := false
- // 虚拟空结点
- head = nilNode
- // 前后指针用于判断
- pre, back := head.Next, head.Next.Next
- // 每次只删除前面的一个重复的元素，留一个用于下次遍历判重
- // pre, back 指针的更新位置和值比较重要和巧妙
- for head.Next != nil && head.Next.Next != nil {
- if pre.Val != back.Val && lastIsDel {
- head.Next = head.Next.Next
- pre, back = head.Next, head.Next.Next
- lastIsDel = false
- continue
- }
+ nilNode := &ListNode{Val: 0, Next: head}
+ // 上次遍历有删除操作的标志位
+ lastIsDel := false
+ // 虚拟空结点
+ head = nilNode
+ // 前后指针用于判断
+ pre, back := head.Next, head.Next.Next
+ // 每次只删除前面的一个重复的元素，留一个用于下次遍历判重
+ // pre, back 指针的更新位置和值比较重要和巧妙
+ for head.Next != nil && head.Next.Next != nil {
+ if pre.Val != back.Val && lastIsDel {
+ head.Next = head.Next.Next
+ pre, back = head.Next, head.Next.Next
+ lastIsDel = false
+ continue
+ }
- if pre.Val == back.Val {
- head.Next = head.Next.Next
- pre, back = head.Next, head.Next.Next
- lastIsDel = true
- } else {
- head = head.Next
- pre, back = head.Next, head.Next.Next
- lastIsDel = false
- }
- }
- // 处理 [1,1] 这种删除还剩一个的情况
- if lastIsDel && head.Next != nil {
- head.Next = nil
- }
- return nilNode.Next
+ if pre.Val == back.Val {
+ head.Next = head.Next.Next
+ pre, back = head.Next, head.Next.Next
+ lastIsDel = true
+ } else {
+ head = head.Next
+ pre, back = head.Next, head.Next.Next
+ lastIsDel = false
+ }
+ }
+ // 处理 [1,1] 这种删除还剩一个的情况
+ if lastIsDel && head.Next != nil {
+ head.Next = nil
+ }
+ return nilNode.Next
}
diff --git a/leetcode/0084.Largest-Rectangle-in-Histogram/84. Largest Rectangle in Histogram.go b/leetcode/0084.Largest-Rectangle-in-Histogram/84. Largest Rectangle in Histogram.go
index 6b782978a..d01401b05 100644
--- a/leetcode/0084.Largest-Rectangle-in-Histogram/84. Largest Rectangle in Histogram.go
+++ b/leetcode/0084.Largest-Rectangle-in-Histogram/84. Largest Rectangle in Histogram.go
@@ -1,32 +1,25 @@
package leetcode
-import "fmt"
-
func largestRectangleArea(heights []int) int {
- maxArea, stack, height := 0, []int{}, 0
- for i := 0; i <= len(heights); i++ {
- if i == len(heights) {
- height = 0
- } else {
- height = heights[i]
+ maxArea := 0
+ n := len(heights) + 2
+ // Add a sentry at the beginning and the end
+ getHeight := func(i int) int {
+ if i == 0 || n-1 == i {
+ return 0
}
- if len(stack) == 0 || height >= heights[stack[len(stack)-1]] {
- stack = append(stack, i)
- } else {
- tmp := stack[len(stack)-1]
- fmt.Printf("1. tmp = %v stack = %v\n", tmp, stack)
- stack = stack[:len(stack)-1]
- length := 0
- if len(stack) == 0 {
- length = i
- } else {
- length = i - 1 - stack[len(stack)-1]
- fmt.Printf("2. length = %v stack = %v i = %v\n", length, stack, i)
- }
- maxArea = max(maxArea, heights[tmp]*length)
- fmt.Printf("3. maxArea = %v heights[tmp]*length = %v\n", maxArea, heights[tmp]*length)
- i--
+ return heights[i-1]
+ }
+ st := make([]int, 0, n/2)
+ for i := 0; i < n; i++ {
+ for len(st) > 0 && getHeight(st[len(st)-1]) > getHeight(i) {
+ // pop stack
+ idx := st[len(st)-1]
+ st = st[:len(st)-1]
+ maxArea = max(maxArea, getHeight(idx)*(i-st[len(st)-1]-1))
}
+ // push stack
+ st = append(st, i)
}
return maxArea
}
diff --git a/leetcode/0084.Largest-Rectangle-in-Histogram/84. Largest Rectangle in Histogram_test.go b/leetcode/0084.Largest-Rectangle-in-Histogram/84. Largest Rectangle in Histogram_test.go
index 7226916aa..0465a1eb6 100644
--- a/leetcode/0084.Largest-Rectangle-in-Histogram/84. Largest Rectangle in Histogram_test.go
+++ b/leetcode/0084.Largest-Rectangle-in-Histogram/84. Largest Rectangle in Histogram_test.go
@@ -40,6 +40,10 @@ func Test_Problem84(t *testing.T) {
para84{[]int{1, 1}},
ans84{2},
},
+ {
+ para84{[]int{2, 1, 2}},
+ ans84{3},
+ },
}
fmt.Printf("------------------------Leetcode Problem 84------------------------\n")
diff --git a/leetcode/0088.Merge-Sorted-Array/88. Merge Sorted Array.go b/leetcode/0088.Merge-Sorted-Array/88. Merge Sorted Array.go
index ec275970c..6b30f8e76 100644
--- a/leetcode/0088.Merge-Sorted-Array/88. Merge Sorted Array.go
+++ b/leetcode/0088.Merge-Sorted-Array/88. Merge Sorted Array.go
@@ -1,29 +1,16 @@
package leetcode
func merge(nums1 []int, m int, nums2 []int, n int) {
- if m == 0 {
- copy(nums1, nums2)
- return
- }
- // 这里不需要，因为测试数据考虑到了第一个数组的空间问题
- // for index := 0; index < n; index++ {
- // nums1 = append(nums1, nums2[index])
- // }
- i := m - 1
- j := n - 1
- k := m + n - 1
- // 从后面往前放，只需要循环一次即可
- for ; i >= 0 && j >= 0; k-- {
- if nums1[i] > nums2[j] {
- nums1[k] = nums1[i]
- i--
+ for p := m + n; m > 0 && n > 0; p-- {
+ if nums1[m-1] <= nums2[n-1] {
+ nums1[p-1] = nums2[n-1]
+ n--
} else {
- nums1[k] = nums2[j]
- j--
+ nums1[p-1] = nums1[m-1]
+ m--
}
}
- for ; j >= 0; k-- {
- nums1[k] = nums2[j]
- j--
+ for ; n > 0; n-- {
+ nums1[n-1] = nums2[n-1]
}
}
diff --git a/leetcode/0088.Merge-Sorted-Array/88. Merge Sorted Array_test.go b/leetcode/0088.Merge-Sorted-Array/88. Merge Sorted Array_test.go
index c27ca41ee..3c4ebb1da 100644
--- a/leetcode/0088.Merge-Sorted-Array/88. Merge Sorted Array_test.go
+++ b/leetcode/0088.Merge-Sorted-Array/88. Merge Sorted Array_test.go
@@ -29,20 +29,10 @@ func Test_Problem88(t *testing.T) {
qs := []question88{
- // question{
- // para{[]int{0}, 0, []int{1}, 1},
- // ans{[]int{1}},
- // },
- //
- // question{
- // para{[]int{1, 3, 5, 7}, 4, []int{2, 4}, 2},
- // ans{[]int{1, 2, 3, 4}},
- // },
- //
- // question{
- // para{[]int{1, 3, 5, 7}, 4, []int{2, 2}, 2},
- // ans{[]int{1, 2, 2, 3}},
- // },
+ {
+ para88{[]int{0}, 0, []int{1}, 1},
+ ans88{[]int{1}},
+ },
{
para88{[]int{1, 2, 3, 0, 0, 0}, 3, []int{2, 5, 6}, 3},
diff --git a/leetcode/0091.Decode-Ways/91. Decode Ways.go b/leetcode/0091.Decode-Ways/91. Decode Ways.go
index 35a97845b..6746cdc47 100644
--- a/leetcode/0091.Decode-Ways/91. Decode Ways.go
+++ b/leetcode/0091.Decode-Ways/91. Decode Ways.go
@@ -1,29 +1,16 @@
package leetcode
-import (
- "strconv"
-)
-
func numDecodings(s string) int {
- if len(s) == 0 {
- return 0
- }
- dp := make([]int, len(s)+1)
+ n := len(s)
+ dp := make([]int, n+1)
dp[0] = 1
- if s[:1] == "0" {
- dp[1] = 0
- } else {
- dp[1] = 1
- }
- for i := 2; i <= len(s); i++ {
- lastNum, _ := strconv.Atoi(s[i-1 : i])
- if lastNum >= 1 && lastNum <= 9 {
+ for i := 1; i <= n; i++ {
+ if s[i-1] != '0' {
dp[i] += dp[i-1]
}
- lastNum, _ = strconv.Atoi(s[i-2 : i])
- if lastNum >= 10 && lastNum <= 26 {
+ if i > 1 && s[i-2] != '0' && (s[i-2]-'0')*10+(s[i-1]-'0') <= 26 {
dp[i] += dp[i-2]
}
}
- return dp[len(s)]
+ return dp[n]
}
diff --git a/leetcode/0097.Interleaving-String/97. Interleaving String.go b/leetcode/0097.Interleaving-String/97. Interleaving String.go
new file mode 100644
index 000000000..20d62f152
--- /dev/null
+++ b/leetcode/0097.Interleaving-String/97. Interleaving String.go
@@ -0,0 +1,35 @@
+package leetcode
+
+func isInterleave(s1 string, s2 string, s3 string) bool {
+ if len(s1)+len(s2) != len(s3) {
+ return false
+ }
+ visited := make(map[int]bool)
+ return dfs(s1, s2, s3, 0, 0, visited)
+}
+
+func dfs(s1, s2, s3 string, p1, p2 int, visited map[int]bool) bool {
+ if p1+p2 == len(s3) {
+ return true
+ }
+ if _, ok := visited[(p1*len(s3))+p2]; ok {
+ return false
+ }
+ visited[(p1*len(s3))+p2] = true
+ var match1, match2 bool
+ if p1 < len(s1) && s3[p1+p2] == s1[p1] {
+ match1 = true
+ }
+ if p2 < len(s2) && s3[p1+p2] == s2[p2] {
+ match2 = true
+ }
+ if match1 && match2 {
+ return dfs(s1, s2, s3, p1+1, p2, visited) || dfs(s1, s2, s3, p1, p2+1, visited)
+ } else if match1 {
+ return dfs(s1, s2, s3, p1+1, p2, visited)
+ } else if match2 {
+ return dfs(s1, s2, s3, p1, p2+1, visited)
+ } else {
+ return false
+ }
+}
diff --git a/leetcode/0097.Interleaving-String/97. Interleaving String_test.go b/leetcode/0097.Interleaving-String/97. Interleaving String_test.go
new file mode 100644
index 000000000..20ee4e78d
--- /dev/null
+++ b/leetcode/0097.Interleaving-String/97. Interleaving String_test.go
@@ -0,0 +1,54 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question97 struct {
+ para97
+ ans97
+}
+
+// para 是参数
+// one 代表第一个参数
+type para97 struct {
+ s1 string
+ s2 string
+ s3 string
+}
+
+// ans 是答案
+// one 代表第一个答案
+type ans97 struct {
+ one bool
+}
+
+func Test_Problem97(t *testing.T) {
+
+ qs := []question97{
+
+ {
+ para97{"aabcc", "dbbca", "aadbbcbcac"},
+ ans97{true},
+ },
+
+ {
+ para97{"aabcc", "dbbca", "aadbbbaccc"},
+ ans97{false},
+ },
+
+ {
+ para97{"", "", ""},
+ ans97{true},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 97------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans97, q.para97
+ fmt.Printf("【input】:%v 【output】:%v\n", p, isInterleave(p.s1, p.s2, p.s3))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/0097.Interleaving-String/README.md b/leetcode/0097.Interleaving-String/README.md
new file mode 100644
index 000000000..2a720371a
--- /dev/null
+++ b/leetcode/0097.Interleaving-String/README.md
@@ -0,0 +1,104 @@
+# [97. Interleaving String](https://leetcode.com/problems/interleaving-string/)
+
+
+## 题目
+
+Given strings `s1`, `s2`, and `s3`, find whether `s3` is formed by an **interleaving** of `s1` and `s2`.
+
+An **interleaving** of two strings `s` and `t` is a configuration where they are divided into **non-empty** substrings such that:
+
+- `s = s1 + s2 + ... + sn`
+- `t = t1 + t2 + ... + tm`
+- `|n - m| <= 1`
+- The **interleaving** is `s1 + t1 + s2 + t2 + s3 + t3 + ...` or `t1 + s1 + t2 + s2 + t3 + s3 + ...`
+
+**Note:** `a + b` is the concatenation of strings `a` and `b`.
+
+**Example 1:**
+
+
+
+```
+Input: s1 = "aabcc", s2 = "dbbca", s3 = "aadbbcbcac"
+Output: true
+
+```
+
+**Example 2:**
+
+```
+Input: s1 = "aabcc", s2 = "dbbca", s3 = "aadbbbaccc"
+Output: false
+
+```
+
+**Example 3:**
+
+```
+Input: s1 = "", s2 = "", s3 = ""
+Output: true
+
+```
+
+**Constraints:**
+
+- `0 <= s1.length, s2.length <= 100`
+- `0 <= s3.length <= 200`
+- `s1`, `s2`, and `s3` consist of lowercase English letters.
+
+**Follow up:** Could you solve it using only `O(s2.length)` additional memory space?
+
+## 题目大意
+
+给定三个字符串 s1、s2、s3，请你帮忙验证 s3 是否是由 s1 和 s2 交错 组成的。两个字符串 s 和 t 交错 的定义与过程如下，其中每个字符串都会被分割成若干 非空 子字符串：
+
+- s = s1 + s2 + ... + sn
+- t = t1 + t2 + ... + tm
+- |n - m| <= 1
+- 交错 是 s1 + t1 + s2 + t2 + s3 + t3 + ... 或者 t1 + s1 + t2 + s2 + t3 + s3 + ...
+
+提示：a + b 意味着字符串 a 和 b 连接。
+
+## 解题思路
+
+- 深搜或者广搜暴力解题。笔者用深搜实现的。记录 s1 和 s2 串当前比较的位置 p1 和 p2。如果 s3[p1+p2] 的位置上等于 s1[p1] 或者 s2[p2] 代表能匹配上，那么继续往后移动 p1 和 p2 相应的位置。因为是交错字符串，所以判断匹配的位置是 s3[p1+p2] 的位置。如果仅仅这么写，会超时，s1 和 s2 两个字符串重复交叉判断的位置太多了。需要加上记忆化搜索。可以用 visited[i][j] 这样的二维数组来记录是否搜索过了。笔者为了压缩空间，将 i 和 j 编码压缩到一维数组了。i * len(s3) + j 是唯一下标，所以可以用这种方式存储是否搜索过。具体代码见下面的实现。
+
+## 代码
+
+```go
+package leetcode
+
+func isInterleave(s1 string, s2 string, s3 string) bool {
+ if len(s1)+len(s2) != len(s3) {
+ return false
+ }
+ visited := make(map[int]bool)
+ return dfs(s1, s2, s3, 0, 0, visited)
+}
+
+func dfs(s1, s2, s3 string, p1, p2 int, visited map[int]bool) bool {
+ if p1+p2 == len(s3) {
+ return true
+ }
+ if _, ok := visited[(p1*len(s3))+p2]; ok {
+ return false
+ }
+ visited[(p1*len(s3))+p2] = true
+ var match1, match2 bool
+ if p1 < len(s1) && s3[p1+p2] == s1[p1] {
+ match1 = true
+ }
+ if p2 < len(s2) && s3[p1+p2] == s2[p2] {
+ match2 = true
+ }
+ if match1 && match2 {
+ return dfs(s1, s2, s3, p1+1, p2, visited) || dfs(s1, s2, s3, p1, p2+1, visited)
+ } else if match1 {
+ return dfs(s1, s2, s3, p1+1, p2, visited)
+ } else if match2 {
+ return dfs(s1, s2, s3, p1, p2+1, visited)
+ } else {
+ return false
+ }
+}
+```
\ No newline at end of file
diff --git a/leetcode/0098.Validate-Binary-Search-Tree/98. Validate Binary Search Tree.go b/leetcode/0098.Validate-Binary-Search-Tree/98. Validate Binary Search Tree.go
index 801e8ff53..1a4d530b9 100644
--- a/leetcode/0098.Validate-Binary-Search-Tree/98. Validate Binary Search Tree.go
+++ b/leetcode/0098.Validate-Binary-Search-Tree/98. Validate Binary Search Tree.go
@@ -1,8 +1,8 @@
package leetcode
-import "math"
-
import (
+ "math"
+
"github.com/halfrost/LeetCode-Go/structures"
)
diff --git a/leetcode/0101.Symmetric-Tree/101. Symmetric Tree.go b/leetcode/0101.Symmetric-Tree/101. Symmetric Tree.go
index cc95bf6ad..b8c26b9a1 100644
--- a/leetcode/0101.Symmetric-Tree/101. Symmetric Tree.go
+++ b/leetcode/0101.Symmetric-Tree/101. Symmetric Tree.go
@@ -16,7 +16,26 @@ type TreeNode = structures.TreeNode
* }
*/
+// 解法一 dfs
func isSymmetric(root *TreeNode) bool {
+ if root == nil {
+ return true
+ }
+ return isMirror(root.Left, root.Right)
+}
+
+func isMirror(left *TreeNode, right *TreeNode) bool {
+ if left == nil && right == nil {
+ return true
+ }
+ if left == nil || right == nil {
+ return false
+ }
+ return (left.Val == right.Val) && isMirror(left.Left, right.Right) && isMirror(left.Right, right.Left)
+}
+
+// 解法二
+func isSymmetric1(root *TreeNode) bool {
if root == nil {
return true
}
diff --git a/leetcode/0102.Binary-Tree-Level-Order-Traversal/102. Binary Tree Level Order Traversal.go b/leetcode/0102.Binary-Tree-Level-Order-Traversal/102. Binary Tree Level Order Traversal.go
index 914108c1a..5df975c47 100644
--- a/leetcode/0102.Binary-Tree-Level-Order-Traversal/102. Binary Tree Level Order Traversal.go
+++ b/leetcode/0102.Binary-Tree-Level-Order-Traversal/102. Binary Tree Level Order Traversal.go
@@ -21,50 +21,42 @@ func levelOrder(root *TreeNode) [][]int {
if root == nil {
return [][]int{}
}
- queue := []*TreeNode{}
- queue = append(queue, root)
- curNum, nextLevelNum, res, tmp := 1, 0, [][]int{}, []int{}
- for len(queue) != 0 {
- if curNum > 0 {
- node := queue[0]
- if node.Left != nil {
- queue = append(queue, node.Left)
- nextLevelNum++
+ queue := []*TreeNode{root}
+ res := make([][]int, 0)
+ for len(queue) > 0 {
+ l := len(queue)
+ tmp := make([]int, 0, l)
+ for i := 0; i < l; i++ {
+ if queue[i].Left != nil {
+ queue = append(queue, queue[i].Left)
}
- if node.Right != nil {
- queue = append(queue, node.Right)
- nextLevelNum++
+ if queue[i].Right != nil {
+ queue = append(queue, queue[i].Right)
}
- curNum--
- tmp = append(tmp, node.Val)
- queue = queue[1:]
- }
- if curNum == 0 {
- res = append(res, tmp)
- curNum = nextLevelNum
- nextLevelNum = 0
- tmp = []int{}
+ tmp = append(tmp, queue[i].Val)
}
+ queue = queue[l:]
+ res = append(res, tmp)
}
return res
}
// 解法二 DFS
func levelOrder1(root *TreeNode) [][]int {
- levels := [][]int{}
- dfsLevel(root, -1, &levels)
- return levels
-}
-
-func dfsLevel(node *TreeNode, level int, res *[][]int) {
- if node == nil {
- return
- }
- currLevel := level + 1
- for len(*res) <= currLevel {
- *res = append(*res, []int{})
+ var res [][]int
+ var dfsLevel func(node *TreeNode, level int)
+ dfsLevel = func(node *TreeNode, level int) {
+ if node == nil {
+ return
+ }
+ if len(res) == level {
+ res = append(res, []int{node.Val})
+ } else {
+ res[level] = append(res[level], node.Val)
+ }
+ dfsLevel(node.Left, level+1)
+ dfsLevel(node.Right, level+1)
}
- (*res)[currLevel] = append((*res)[currLevel], node.Val)
- dfsLevel(node.Left, currLevel, res)
- dfsLevel(node.Right, currLevel, res)
+ dfsLevel(root, 0)
+ return res
}
diff --git a/leetcode/0103.Binary-Tree-Zigzag-Level-Order-Traversal/103. Binary Tree Zigzag Level Order Traversal.go b/leetcode/0103.Binary-Tree-Zigzag-Level-Order-Traversal/103. Binary Tree Zigzag Level Order Traversal.go
index dc8f398d2..587ad0f43 100644
--- a/leetcode/0103.Binary-Tree-Zigzag-Level-Order-Traversal/103. Binary Tree Zigzag Level Order Traversal.go
+++ b/leetcode/0103.Binary-Tree-Zigzag-Level-Order-Traversal/103. Binary Tree Zigzag Level Order Traversal.go
@@ -81,3 +81,40 @@ func search(root *TreeNode, depth int, res *[][]int) {
search(root.Left, depth+1, res)
search(root.Right, depth+1, res)
}
+
+// 解法三 BFS
+func zigzagLevelOrder1(root *TreeNode) [][]int {
+ res := [][]int{}
+ if root == nil {
+ return res
+ }
+ q := []*TreeNode{root}
+ size, i, j, lay, tmp, flag := 0, 0, 0, []int{}, []*TreeNode{}, false
+ for len(q) > 0 {
+ size = len(q)
+ tmp = []*TreeNode{}
+ lay = make([]int, size)
+ j = size - 1
+ for i = 0; i < size; i++ {
+ root = q[0]
+ q = q[1:]
+ if !flag {
+ lay[i] = root.Val
+ } else {
+ lay[j] = root.Val
+ j--
+ }
+ if root.Left != nil {
+ tmp = append(tmp, root.Left)
+ }
+ if root.Right != nil {
+ tmp = append(tmp, root.Right)
+ }
+
+ }
+ res = append(res, lay)
+ flag = !flag
+ q = tmp
+ }
+ return res
+}
diff --git a/leetcode/0105.Construct-Binary-Tree-from-Preorder-and-Inorder-Traversal/105. Construct Binary Tree from Preorder and Inorder Traversal.go b/leetcode/0105.Construct-Binary-Tree-from-Preorder-and-Inorder-Traversal/105. Construct Binary Tree from Preorder and Inorder Traversal.go
index b1d2b05fa..2654e7381 100644
--- a/leetcode/0105.Construct-Binary-Tree-from-Preorder-and-Inorder-Traversal/105. Construct Binary Tree from Preorder and Inorder Traversal.go
+++ b/leetcode/0105.Construct-Binary-Tree-from-Preorder-and-Inorder-Traversal/105. Construct Binary Tree from Preorder and Inorder Traversal.go
@@ -16,7 +16,23 @@ type TreeNode = structures.TreeNode
* }
*/
+// 解法一, 直接传入需要的 slice 范围作为输入, 可以避免申请对应 inorder 索引的内存, 内存使用(leetcode test case) 4.7MB -> 4.3MB.
func buildTree(preorder []int, inorder []int) *TreeNode {
+ if len(preorder) == 0 {
+ return nil
+ }
+ root := &TreeNode{Val: preorder[0]}
+ for pos, node := range inorder {
+ if node == root.Val {
+ root.Left = buildTree(preorder[1:pos+1], inorder[:pos])
+ root.Right = buildTree(preorder[pos+1:], inorder[pos+1:])
+ }
+ }
+ return root
+}
+
+// 解法二
+func buildTree1(preorder []int, inorder []int) *TreeNode {
inPos := make(map[int]int)
for i := 0; i < len(inorder); i++ {
inPos[inorder[i]] = i
diff --git a/leetcode/0106.Construct-Binary-Tree-from-Inorder-and-Postorder-Traversal/106. Construct Binary Tree from Inorder and Postorder Traversal.go b/leetcode/0106.Construct-Binary-Tree-from-Inorder-and-Postorder-Traversal/106. Construct Binary Tree from Inorder and Postorder Traversal.go
index b98a0ec4f..1c7a86b66 100644
--- a/leetcode/0106.Construct-Binary-Tree-from-Inorder-and-Postorder-Traversal/106. Construct Binary Tree from Inorder and Postorder Traversal.go
+++ b/leetcode/0106.Construct-Binary-Tree-from-Inorder-and-Postorder-Traversal/106. Construct Binary Tree from Inorder and Postorder Traversal.go
@@ -16,7 +16,25 @@ type TreeNode = structures.TreeNode
* }
*/
+// 解法一, 直接传入需要的 slice 范围作为输入, 可以避免申请对应 inorder 索引的内存, 内存使用(leetcode test case) 4.7MB -> 4.3MB.
func buildTree(inorder []int, postorder []int) *TreeNode {
+ postorderLen := len(postorder)
+ if len(inorder) == 0 {
+ return nil
+ }
+ root := &TreeNode{Val: postorder[postorderLen-1]}
+ postorder = postorder[:postorderLen-1]
+ for pos, node := range inorder {
+ if node == root.Val {
+ root.Left = buildTree(inorder[:pos], postorder[:len(inorder[:pos])])
+ root.Right = buildTree(inorder[pos+1:], postorder[len(inorder[:pos]):])
+ }
+ }
+ return root
+}
+
+// 解法二
+func buildTree1(inorder []int, postorder []int) *TreeNode {
inPos := make(map[int]int)
for i := 0; i < len(inorder); i++ {
inPos[inorder[i]] = i
diff --git a/leetcode/0109.Convert-Sorted-List-to-Binary-Search-Tree/README.md b/leetcode/0109.Convert-Sorted-List-to-Binary-Search-Tree/README.md
index 0c0c91aef..692a49ca3 100644
--- a/leetcode/0109.Convert-Sorted-List-to-Binary-Search-Tree/README.md
+++ b/leetcode/0109.Convert-Sorted-List-to-Binary-Search-Tree/README.md
@@ -27,4 +27,5 @@ One possible answer is: [0,-3,9,-10,null,5], which represents the following heig
## 解题思路
-思路比较简单，依次把链表的中间点作为根结点，类似二分的思想，递归排列所有结点即可。
\ No newline at end of file
+思路比较简单，依次把链表的中间点作为根结点，类似二分的思想，递归排列所有结点即可。
+
diff --git a/leetcode/0114.Flatten-Binary-Tree-to-Linked-List/114. Flatten Binary Tree to Linked List.go b/leetcode/0114.Flatten-Binary-Tree-to-Linked-List/114. Flatten Binary Tree to Linked List.go
index 5fe89309d..74860eae8 100644
--- a/leetcode/0114.Flatten-Binary-Tree-to-Linked-List/114. Flatten Binary Tree to Linked List.go
+++ b/leetcode/0114.Flatten-Binary-Tree-to-Linked-List/114. Flatten Binary Tree to Linked List.go
@@ -18,23 +18,21 @@ type TreeNode = structures.TreeNode
// 解法一 非递归
func flatten(root *TreeNode) {
- list, cur := []int{}, &TreeNode{}
- preorder(root, &list)
- cur = root
+ list := preorder(root)
for i := 1; i < len(list); i++ {
- cur.Left = nil
- cur.Right = &TreeNode{Val: list[i], Left: nil, Right: nil}
- cur = cur.Right
+ prev, cur := list[i-1], list[i]
+ prev.Left, prev.Right = nil, cur
}
return
}
-func preorder(root *TreeNode, output *[]int) {
+func preorder(root *TreeNode) (ans []*TreeNode) {
if root != nil {
- *output = append(*output, root.Val)
- preorder(root.Left, output)
- preorder(root.Right, output)
+ ans = append(ans, root)
+ ans = append(ans, preorder(root.Left)...)
+ ans = append(ans, preorder(root.Right)...)
}
+ return
}
// 解法二 递归
diff --git a/leetcode/0114.Flatten-Binary-Tree-to-Linked-List/114. Flatten Binary Tree to Linked List_test.go b/leetcode/0114.Flatten-Binary-Tree-to-Linked-List/114. Flatten Binary Tree to Linked List_test.go
index 299093969..aa20ab605 100644
--- a/leetcode/0114.Flatten-Binary-Tree-to-Linked-List/114. Flatten Binary Tree to Linked List_test.go
+++ b/leetcode/0114.Flatten-Binary-Tree-to-Linked-List/114. Flatten Binary Tree to Linked List_test.go
@@ -15,13 +15,13 @@ type question114 struct {
// para 是参数
// one 代表第一个参数
type para114 struct {
- one []int
+ one []string
}
// ans 是答案
// one 代表第一个答案
type ans114 struct {
- one []int
+ one []string
}
func Test_Problem114(t *testing.T) {
@@ -29,8 +29,18 @@ func Test_Problem114(t *testing.T) {
qs := []question114{
{
- para114{[]int{1, 2, 3, 4, 5, 6}},
- ans114{[]int{1, 2, 3, 4, 5, 6}},
+ para114{[]string{"1", "2", "5", "3", "4", "null", "6"}},
+ ans114{[]string{"1", "null", "2", "null", "3", "null", "4", "null", "5", "null", "6"}},
+ },
+
+ {
+ para114{[]string{"0"}},
+ ans114{[]string{"0"}},
+ },
+
+ {
+ para114{[]string{"1", "2", "3", "4", "5", "6"}},
+ ans114{[]string{"1", "2", "4", "5", "3", "6", "null"}},
},
}
@@ -39,9 +49,10 @@ func Test_Problem114(t *testing.T) {
for _, q := range qs {
_, p := q.ans114, q.para114
fmt.Printf("【input】:%v \n", p)
- rootOne := structures.Ints2TreeNode(p.one)
+ rootOne := structures.Strings2TreeNode(p.one)
flatten(rootOne)
- fmt.Printf("【output】:%v \n", structures.Tree2Preorder(rootOne))
+ fmt.Printf("【levelorder output】:%v \n", structures.Tree2LevelOrderStrings(rootOne))
+ fmt.Printf("【preorder output】:%v \n", structures.Tree2PreOrderStrings(rootOne))
}
fmt.Printf("\n\n\n")
}
diff --git a/leetcode/0115.Distinct-Subsequences/115. Distinct Subsequences.go b/leetcode/0115.Distinct-Subsequences/115. Distinct Subsequences.go
new file mode 100644
index 000000000..f8f1f2339
--- /dev/null
+++ b/leetcode/0115.Distinct-Subsequences/115. Distinct Subsequences.go
@@ -0,0 +1,45 @@
+package leetcode
+
+// 解法一 压缩版 DP
+func numDistinct(s string, t string) int {
+ dp := make([]int, len(s)+1)
+ for i, curT := range t {
+ pre := 0
+ for j, curS := range s {
+ if i == 0 {
+ pre = 1
+ }
+ newDP := dp[j+1]
+ if curT == curS {
+ dp[j+1] = dp[j] + pre
+ } else {
+ dp[j+1] = dp[j]
+ }
+ pre = newDP
+ }
+ }
+ return dp[len(s)]
+}
+
+// 解法二 普通 DP
+func numDistinct1(s, t string) int {
+ m, n := len(s), len(t)
+ if m < n {
+ return 0
+ }
+ dp := make([][]int, m+1)
+ for i := range dp {
+ dp[i] = make([]int, n+1)
+ dp[i][n] = 1
+ }
+ for i := m - 1; i >= 0; i-- {
+ for j := n - 1; j >= 0; j-- {
+ if s[i] == t[j] {
+ dp[i][j] = dp[i+1][j+1] + dp[i+1][j]
+ } else {
+ dp[i][j] = dp[i+1][j]
+ }
+ }
+ }
+ return dp[0][0]
+}
diff --git a/leetcode/0115.Distinct-Subsequences/115. Distinct Subsequences_test.go b/leetcode/0115.Distinct-Subsequences/115. Distinct Subsequences_test.go
new file mode 100644
index 000000000..d192137e2
--- /dev/null
+++ b/leetcode/0115.Distinct-Subsequences/115. Distinct Subsequences_test.go
@@ -0,0 +1,48 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question115 struct {
+ para115
+ ans115
+}
+
+// para 是参数
+// one 代表第一个参数
+type para115 struct {
+ s string
+ t string
+}
+
+// ans 是答案
+// one 代表第一个答案
+type ans115 struct {
+ one int
+}
+
+func Test_Problem115(t *testing.T) {
+
+ qs := []question115{
+
+ {
+ para115{"rabbbit", "rabbit"},
+ ans115{3},
+ },
+
+ {
+ para115{"babgbag", "bag"},
+ ans115{5},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 115------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans115, q.para115
+ fmt.Printf("【input】:%v 【output】:%v\n", p, numDistinct(p.s, p.t))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/0115.Distinct-Subsequences/README.md b/leetcode/0115.Distinct-Subsequences/README.md
new file mode 100644
index 000000000..244152a68
--- /dev/null
+++ b/leetcode/0115.Distinct-Subsequences/README.md
@@ -0,0 +1,99 @@
+# [115. Distinct Subsequences](https://leetcode.com/problems/distinct-subsequences/)
+
+
+## 题目
+
+Given two strings `s` and `t`, return *the number of distinct subsequences of `s` which equals `t`*.
+
+A string's **subsequence** is a new string formed from the original string by deleting some (can be none) of the characters without disturbing the remaining characters' relative positions. (i.e., `"ACE"` is a subsequence of `"ABCDE"` while `"AEC"` is not).
+
+It is guaranteed the answer fits on a 32-bit signed integer.
+
+**Example 1:**
+
+```
+Input: s = "rabbbit", t = "rabbit"
+Output: 3
+Explanation:
+As shown below, there are 3 ways you can generate "rabbit" from S.
+rabbbitrabbbitrabbbit
+```
+
+**Example 2:**
+
+```
+Input: s = "babgbag", t = "bag"
+Output: 5
+Explanation:
+As shown below, there are 5 ways you can generate "bag" from S.
+babgbagbabgbagbabgbagbabgbagbabgbag
+```
+
+**Constraints:**
+
+- `0 <= s.length, t.length <= 1000`
+- `s` and `t` consist of English letters.
+
+## 题目大意
+
+给定一个字符串 s 和一个字符串 t ，计算在 s 的子序列中 t 出现的个数。字符串的一个 子序列 是指，通过删除一些（也可以不删除）字符且不干扰剩余字符相对位置所组成的新字符串。（例如，"ACE" 是 "ABCDE" 的一个子序列，而 "AEC" 不是）题目数据保证答案符合 32 位带符号整数范围。
+
+## 解题思路
+
+- 在字符串 `s` 中最多包含多少个字符串 `t`。这里面包含很多重叠子问题，所以尝试用动态规划解决这个问题。定义 `dp[i][j]` 代表 `s[i:]` 的子序列中 `t[j:]` 出现的个数。初始化先判断边界条件。当 `i = len(s)` 且 `0≤ j < len(t)` 的时候，`s[i:]` 为空字符串，`t[j:]` 不为空，所以 `dp[len(s)][j] = 0`。当 `j = len(t)` 且 `0 ≤ i < len(s)` 的时候，`t[j:]` 不为空字符串，空字符串是任何字符串的子序列。所以 `dp[i][n] = 1`。
+- 当 `i < len(s)` 且 `j < len(t)` 的时候，如果 `s[i] == t[j]`，有 2 种匹配方式，第一种将 `s[i]` 与 `t[j]` 匹配，那么 `t[j+1:]` 匹配 `s[i+1:]` 的子序列，子序列数为 `dp[i+1][j+1]`；第二种将 `s[i]` 不与 `t[j]` 匹配，`t[j:]` 作为 `s[i+1:]` 的子序列，子序列数为 `dp[i+1][j]`。综合 2 种情况，当 `s[i] == t[j]` 时，`dp[i][j] = dp[i+1][j+1] + dp[i+1][j]`。
+- 如果 `s[i] != t[j]`，此时 `t[j:]` 只能作为 `s[i+1:]` 的子序列，子序列数为 `dp[i+1][j]`。所以当 `s[i] != t[j]` 时，`dp[i][j] = dp[i+1][j]`。综上分析得：
+
+ $$dp[i][j] = \left\{\begin{matrix}dp[i+1][j+1]+dp[i+1][j]&,s[i]=t[j]\\ dp[i+1][j]&,s[i]!=t[j]\end{matrix}\right.$$
+
+- 最后是优化版本。写出上述代码以后，可以发现填表的过程是从右下角一直填到左上角。填表顺序是 从下往上一行一行的填。行内从右往左填。于是可以将这个二维数据压缩到一维。因为填充当前行只需要用到它的下一行信息即可，更进一步，用到的是下一行中右边元素的信息。于是可以每次更新该行时，先将旧的值存起来，计算更新该行的时候从右往左更新。这样做即可减少一维空间，将原来的二维数组压缩到一维数组。
+
+## 代码
+
+```go
+package leetcode
+
+// 解法一 压缩版 DP
+func numDistinct(s string, t string) int {
+ dp := make([]int, len(s)+1)
+ for i, curT := range t {
+ pre := 0
+ for j, curS := range s {
+ if i == 0 {
+ pre = 1
+ }
+ newDP := dp[j+1]
+ if curT == curS {
+ dp[j+1] = dp[j] + pre
+ } else {
+ dp[j+1] = dp[j]
+ }
+ pre = newDP
+ }
+ }
+ return dp[len(s)]
+}
+
+// 解法二 普通 DP
+func numDistinct1(s, t string) int {
+ m, n := len(s), len(t)
+ if m < n {
+ return 0
+ }
+ dp := make([][]int, m+1)
+ for i := range dp {
+ dp[i] = make([]int, n+1)
+ dp[i][n] = 1
+ }
+ for i := m - 1; i >= 0; i-- {
+ for j := n - 1; j >= 0; j-- {
+ if s[i] == t[j] {
+ dp[i][j] = dp[i+1][j+1] + dp[i+1][j]
+ } else {
+ dp[i][j] = dp[i+1][j]
+ }
+ }
+ }
+ return dp[0][0]
+}
+```
\ No newline at end of file
diff --git a/leetcode/0116.Populating-Next-Right-Pointers-in-Each-Node/116.Populating Next Right Pointers in Each Node.go b/leetcode/0116.Populating-Next-Right-Pointers-in-Each-Node/116.Populating Next Right Pointers in Each Node.go
new file mode 100644
index 000000000..4587c39d5
--- /dev/null
+++ b/leetcode/0116.Populating-Next-Right-Pointers-in-Each-Node/116.Populating Next Right Pointers in Each Node.go
@@ -0,0 +1,52 @@
+package leetcode
+
+type Node struct {
+ Val int
+ Left *Node
+ Right *Node
+ Next *Node
+}
+
+// 解法一：迭代
+func connect(root *Node) *Node {
+ if root == nil {
+ return root
+ }
+ q := []*Node{root}
+ for len(q) > 0 {
+ var p []*Node
+ // 遍历这一层的所有节点
+ for i, node := range q {
+ if i+1 < len(q) {
+ node.Next = q[i+1]
+ }
+ if node.Left != nil {
+ p = append(p, node.Left)
+ }
+ if node.Right != nil {
+ p = append(p, node.Right)
+ }
+ }
+ q = p
+ }
+ return root
+}
+
+// 解法二 递归
+func connect2(root *Node) *Node {
+ if root == nil {
+ return nil
+ }
+ connectTwoNode(root.Left, root.Right)
+ return root
+}
+
+func connectTwoNode(node1, node2 *Node) {
+ if node1 == nil || node2 == nil {
+ return
+ }
+ node1.Next = node2
+ connectTwoNode(node1.Left, node1.Right)
+ connectTwoNode(node2.Left, node2.Right)
+ connectTwoNode(node1.Right, node2.Left)
+}
diff --git a/leetcode/0116.Populating-Next-Right-Pointers-in-Each-Node/116.Populating Next Right Pointers in Each Node_test.go b/leetcode/0116.Populating-Next-Right-Pointers-in-Each-Node/116.Populating Next Right Pointers in Each Node_test.go
new file mode 100644
index 000000000..6146f1579
--- /dev/null
+++ b/leetcode/0116.Populating-Next-Right-Pointers-in-Each-Node/116.Populating Next Right Pointers in Each Node_test.go
@@ -0,0 +1,117 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question116 struct {
+ para116
+ ans116
+}
+
+// para 是参数
+// one 代表第一个参数
+type para116 struct {
+ one *Node
+}
+
+// ans 是答案
+// one 代表第一个答案
+type ans116 struct {
+ one *Node
+}
+
+func newQuestionNode() *Node {
+ node7 := &Node{}
+ node7.Val = 7
+
+ node6 := &Node{}
+ node6.Val = 6
+
+ node5 := &Node{}
+ node5.Val = 5
+
+ node4 := &Node{}
+ node4.Val = 4
+
+ node3 := &Node{}
+ node3.Val = 3
+
+ node2 := &Node{}
+ node2.Val = 2
+
+ node1 := &Node{}
+ node1.Val = 1
+
+ node1.Left = node2
+ node1.Right = node3
+
+ node2.Left = node4
+ node2.Right = node5
+
+ node3.Left = node6
+ node3.Right = node7
+ return node1
+}
+
+func newResultNode() *Node {
+ node7 := &Node{}
+ node7.Val = 7
+
+ node6 := &Node{}
+ node6.Val = 6
+
+ node5 := &Node{}
+ node5.Val = 5
+
+ node4 := &Node{}
+ node4.Val = 4
+
+ node3 := &Node{}
+ node3.Val = 3
+
+ node2 := &Node{}
+ node2.Val = 2
+
+ node1 := &Node{}
+ node1.Val = 1
+
+ node1.Left = node2
+ node1.Right = node3
+
+ node2.Left = node4
+ node2.Right = node5
+
+ node3.Left = node6
+ node3.Right = node7
+
+ node1.Next = nil
+ node2.Next = node3
+ node3.Next = nil
+ node4.Next = node5
+ node5.Next = node6
+ node6.Next = node7
+ node7.Next = nil
+
+ return node1
+}
+
+func Test_Problem116(t *testing.T) {
+
+ qs := []question116{
+ {
+ para116{newQuestionNode()},
+ ans116{newResultNode()},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 116------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans116, q.para116
+ fmt.Printf("【input】:%v ", p.one)
+ fmt.Printf("【output】:%v \n", connect(p.one))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/0116.Populating-Next-Right-Pointers-in-Each-Node/README.md b/leetcode/0116.Populating-Next-Right-Pointers-in-Each-Node/README.md
new file mode 100644
index 000000000..f25539f42
--- /dev/null
+++ b/leetcode/0116.Populating-Next-Right-Pointers-in-Each-Node/README.md
@@ -0,0 +1,118 @@
+# [116. Populating Next Right Pointers in Each Node](https://leetcode.com/problems/populating-next-right-pointers-in-each-node/)
+
+
+## 题目
+
+You are given a **perfect binary tree** where all leaves are on the same level, and every parent has two children. The binary tree has the following definition:
+
+```
+struct Node {
+ int val;
+ Node *left;
+ Node *right;
+ Node *next;
+}
+
+```
+
+Populate each next pointer to point to its next right node. If there is no next right node, the next pointer should be set to `NULL`.
+
+Initially, all next pointers are set to `NULL`.
+
+**Follow up:**
+
+- You may only use constant extra space.
+- Recursive approach is fine, you may assume implicit stack space does not count as extra space for this problem.
+
+**Example 1:**
+
+
+
+```
+Input: root = [1,2,3,4,5,6,7]
+Output: [1,#,2,3,#,4,5,6,7,#]
+Explanation:Given the above perfect binary tree (Figure A), your function should populate each next pointer to point to its next right node, just like in Figure B. The serialized output is in level order as connected by the next pointers, with '#' signifying the end of each level.
+
+```
+
+**Constraints:**
+
+- The number of nodes in the given tree is less than `4096`.
+- `1000 <= node.val <= 1000`
+
+## 题目大意
+
+给定一个 完美二叉树 ，其所有叶子节点都在同一层，每个父节点都有两个子节点。二叉树定义如下：
+
+```jsx
+struct Node {
+ int val;
+ Node *left;
+ Node *right;
+ Node *next;
+}
+
+```
+
+填充它的每个 next 指针，让这个指针指向其下一个右侧节点。如果找不到下一个右侧节点，则将 next 指针设置为 NULL。初始状态下，所有 next 指针都被设置为 NULL。
+
+## 解题思路
+
+- 本质上是二叉树的层序遍历，基于广度优先搜索，将每层的节点放入队列，并遍历队列进行连接。
+
+## 代码
+
+```go
+package leetcode
+
+type Node struct {
+ Val int
+ Left *Node
+ Right *Node
+ Next *Node
+}
+
+//解法一：迭代
+func connect(root *Node) *Node {
+ if root == nil {
+ return root
+ }
+ q := []*Node{root}
+ for len(q) > 0 {
+ var p []*Node
+ // 遍历这一层的所有节点
+ for i, node := range q {
+ if i+1 < len(q) {
+ node.Next = q[i+1]
+ }
+ if node.Left != nil {
+ p = append(p, node.Left)
+ }
+ if node.Right != nil {
+ p = append(p, node.Right)
+ }
+ }
+ q = p
+ }
+ return root
+}
+
+// 解法二 递归
+func connect2(root *Node) *Node {
+ if root == nil {
+ return nil
+ }
+ connectTwoNode(root.Left, root.Right)
+ return root
+}
+
+func connectTwoNode(node1, node2 *Node) {
+ if node1 == nil || node2 == nil {
+ return
+ }
+ node1.Next = node2
+ connectTwoNode(node1.Left, node1.Right)
+ connectTwoNode(node2.Left, node2.Right)
+ connectTwoNode(node1.Right, node2.Left)
+}
+```
\ No newline at end of file
diff --git a/leetcode/0118.Pascals-Triangle/118. Pascal's Triangle.go b/leetcode/0118.Pascals-Triangle/118. Pascals Triangle.go
similarity index 100%
rename from leetcode/0118.Pascals-Triangle/118. Pascal's Triangle.go
rename to leetcode/0118.Pascals-Triangle/118. Pascals Triangle.go
diff --git a/leetcode/0118.Pascals-Triangle/118. Pascal's Triangle_test.go b/leetcode/0118.Pascals-Triangle/118. Pascals Triangle_test.go
similarity index 100%
rename from leetcode/0118.Pascals-Triangle/118. Pascal's Triangle_test.go
rename to leetcode/0118.Pascals-Triangle/118. Pascals Triangle_test.go
diff --git a/leetcode/0119.Pascals-Triangle-II/119. Pascals Triangle II.go b/leetcode/0119.Pascals-Triangle-II/119. Pascals Triangle II.go
new file mode 100644
index 000000000..34e4401ea
--- /dev/null
+++ b/leetcode/0119.Pascals-Triangle-II/119. Pascals Triangle II.go
@@ -0,0 +1,10 @@
+package leetcode
+
+func getRow(rowIndex int) []int {
+ row := make([]int, rowIndex+1)
+ row[0] = 1
+ for i := 1; i <= rowIndex; i++ {
+ row[i] = row[i-1] * (rowIndex - i + 1) / i
+ }
+ return row
+}
diff --git a/leetcode/0119.Pascals-Triangle-II/119. Pascals Triangle II_test.go b/leetcode/0119.Pascals-Triangle-II/119. Pascals Triangle II_test.go
new file mode 100644
index 000000000..85771cba4
--- /dev/null
+++ b/leetcode/0119.Pascals-Triangle-II/119. Pascals Triangle II_test.go
@@ -0,0 +1,47 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question119 struct {
+ para119
+ ans119
+}
+
+// para 是参数
+// one 代表第一个参数
+type para119 struct {
+ rowIndex int
+}
+
+// ans 是答案
+// one 代表第一个答案
+type ans119 struct {
+ one []int
+}
+
+func Test_Problem119(t *testing.T) {
+
+ qs := []question119{
+
+ {
+ para119{3},
+ ans119{[]int{1, 3, 3, 1}},
+ },
+
+ {
+ para119{0},
+ ans119{[]int{1}},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 119------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans119, q.para119
+ fmt.Printf("【input】:%v 【output】:%v\n", p, getRow(p.rowIndex))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/0119.Pascals-Triangle-II/README.md b/leetcode/0119.Pascals-Triangle-II/README.md
new file mode 100644
index 000000000..c233fe4ee
--- /dev/null
+++ b/leetcode/0119.Pascals-Triangle-II/README.md
@@ -0,0 +1,72 @@
+# [119. Pascal's Triangle II](https://leetcode.com/problems/pascals-triangle-ii/)
+
+
+## 题目
+
+Given an integer `rowIndex`, return the `rowIndexth` row of the Pascal's triangle.
+
+Notice that the row index starts from **0**.
+
+
+
+In Pascal's triangle, each number is the sum of the two numbers directly above it.
+
+**Follow up:**
+
+Could you optimize your algorithm to use only *O*(*k*) extra space?
+
+**Example 1:**
+
+```
+Input: rowIndex = 3
+Output: [1,3,3,1]
+```
+
+**Example 2:**
+
+```
+Input: rowIndex = 0
+Output: [1]
+```
+
+**Example 3:**
+
+```
+Input: rowIndex = 1
+Output: [1,1]
+```
+
+**Constraints:**
+
+- `0 <= rowIndex <= 33`
+
+## 题目大意
+
+给定一个非负索引 k，其中 k ≤ 33，返回杨辉三角的第 k 行。
+
+## 解题思路
+
+- 题目中的三角是杨辉三角，每个数字是 `(a+b)^n` 二项式展开的系数。题目要求我们只能使用 O(k) 的空间。那么需要找到两两项直接的递推关系。由组合知识得知：
+
+ $$\begin{aligned}C_{n}^{m} &= \frac{n!}{m!(n-m)!} \\C_{n}^{m-1} &= \frac{n!}{(m-1)!(n-m+1)!}\end{aligned}$$
+
+ 于是得到递推公式：
+
+ $$C_{n}^{m} = C_{n}^{m-1} \times \frac{n-m+1}{m}$$
+
+ 利用这个递推公式即可以把空间复杂度优化到 O(k)
+
+## 代码
+
+```go
+package leetcode
+
+func getRow(rowIndex int) []int {
+ row := make([]int, rowIndex+1)
+ row[0] = 1
+ for i := 1; i <= rowIndex; i++ {
+ row[i] = row[i-1] * (rowIndex - i + 1) / i
+ }
+ return row
+}
+```
\ No newline at end of file
diff --git a/leetcode/0124.Binary-Tree-Maximum-Path-Sum/124. Binary Tree Maximum Path Sum.go b/leetcode/0124.Binary-Tree-Maximum-Path-Sum/124. Binary Tree Maximum Path Sum.go
index dc7a75e4b..058193b7b 100644
--- a/leetcode/0124.Binary-Tree-Maximum-Path-Sum/124. Binary Tree Maximum Path Sum.go
+++ b/leetcode/0124.Binary-Tree-Maximum-Path-Sum/124. Binary Tree Maximum Path Sum.go
@@ -1,8 +1,8 @@
package leetcode
-import "math"
-
import (
+ "math"
+
"github.com/halfrost/LeetCode-Go/structures"
)
diff --git a/leetcode/0125.Valid-Palindrome/125. Valid Palindrome.go b/leetcode/0125.Valid-Palindrome/125. Valid Palindrome.go
index ce998bd58..6ccd92002 100644
--- a/leetcode/0125.Valid-Palindrome/125. Valid Palindrome.go
+++ b/leetcode/0125.Valid-Palindrome/125. Valid Palindrome.go
@@ -5,9 +5,7 @@ import (
)
func isPalindrome(s string) bool {
-
s = strings.ToLower(s)
-
i, j := 0, len(s)-1
for i < j {
for i < j && !isChar(s[i]) {
@@ -22,7 +20,6 @@ func isPalindrome(s string) bool {
i++
j--
}
-
return true
}
diff --git a/leetcode/0129.Sum-Root-to-Leaf-Numbers/129. Sum Root to Leaf Numbers.go b/leetcode/0129.Sum-Root-to-Leaf-Numbers/129. Sum Root to Leaf Numbers.go
index 62fd39bde..fefdd64b9 100644
--- a/leetcode/0129.Sum-Root-to-Leaf-Numbers/129. Sum Root to Leaf Numbers.go
+++ b/leetcode/0129.Sum-Root-to-Leaf-Numbers/129. Sum Root to Leaf Numbers.go
@@ -1,9 +1,5 @@
package leetcode
-import (
- "strconv"
-)
-
import (
"github.com/halfrost/LeetCode-Go/structures"
)
@@ -21,29 +17,20 @@ type TreeNode = structures.TreeNode
*/
func sumNumbers(root *TreeNode) int {
- res, nums := 0, binaryTreeNums(root)
- for _, n := range nums {
- num, _ := strconv.Atoi(n)
- res += num
- }
+ res := 0
+ dfs(root, 0, &res)
return res
}
-func binaryTreeNums(root *TreeNode) []string {
+func dfs(root *TreeNode, sum int, res *int) {
if root == nil {
- return []string{}
+ return
}
- res := []string{}
+ sum = sum*10 + root.Val
if root.Left == nil && root.Right == nil {
- return []string{strconv.Itoa(root.Val)}
+ *res += sum
+ return
}
- tmpLeft := binaryTreeNums(root.Left)
- for i := 0; i < len(tmpLeft); i++ {
- res = append(res, strconv.Itoa(root.Val)+tmpLeft[i])
- }
- tmpRight := binaryTreeNums(root.Right)
- for i := 0; i < len(tmpRight); i++ {
- res = append(res, strconv.Itoa(root.Val)+tmpRight[i])
- }
- return res
+ dfs(root.Left, sum, res)
+ dfs(root.Right, sum, res)
}
diff --git a/leetcode/0129.Sum-Root-to-Leaf-Numbers/README.md b/leetcode/0129.Sum-Root-to-Leaf-Numbers/README.md
index 3bb303520..7e7dababa 100755
--- a/leetcode/0129.Sum-Root-to-Leaf-Numbers/README.md
+++ b/leetcode/0129.Sum-Root-to-Leaf-Numbers/README.md
@@ -45,4 +45,4 @@ Find the total sum of all root-to-leaf numbers.
## 解题思路
-- 这一题是第 257 题的变形题，第 257 题要求输出每条从根节点到叶子节点的路径，这一题变成了把每一个从根节点到叶子节点的数字都串联起来，再累加每条路径，求出最后的总和。实际做题思路基本没变
+- 运用前序遍历的思想，当从根节点出发一直加到叶子节点，每个叶子节点汇总一次。
\ No newline at end of file
diff --git a/leetcode/0134.Gas-Station/Gas.go b/leetcode/0134.Gas-Station/Gas.go
new file mode 100644
index 000000000..4277a791c
--- /dev/null
+++ b/leetcode/0134.Gas-Station/Gas.go
@@ -0,0 +1,26 @@
+package leetcode
+
+func canCompleteCircuit(gas []int, cost []int) int {
+ totalGas := 0
+ totalCost := 0
+ currGas := 0
+ start := 0
+
+ for i := 0; i < len(gas); i++ {
+ totalGas += gas[i]
+ totalCost += cost[i]
+ currGas += gas[i] - cost[i]
+
+ if currGas < 0 {
+ start = i + 1
+ currGas = 0
+ }
+ }
+
+ if totalGas < totalCost {
+ return -1
+ }
+
+ return start
+
+}
diff --git a/leetcode/0134.Gas-Station/Gas_test.go b/leetcode/0134.Gas-Station/Gas_test.go
new file mode 100644
index 000000000..f6c2a7893
--- /dev/null
+++ b/leetcode/0134.Gas-Station/Gas_test.go
@@ -0,0 +1,47 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question134 struct {
+ para134
+ ans134
+}
+
+// para 是参数
+// one 代表第一个参数
+type para134 struct {
+ one []int
+ two []int
+}
+
+// ans 是答案
+// one 代表第一个答案
+type ans134 struct {
+ one int
+}
+
+func Test_Problem134(t *testing.T) {
+ qs := []question134{
+
+ {
+ para134{[]int{1, 2, 3, 4, 5}, []int{3, 4, 5, 1, 2}},
+ ans134{3},
+ },
+
+ {
+ para134{[]int{2, 3, 4}, []int{3, 4, 3}},
+ ans134{-1},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 134------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans134, q.para134
+ fmt.Printf("【input】:%v， %v 【output】:%v\n", p.one, p.two, canCompleteCircuit(p.one, p.two))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/0134.Gas-Station/README.md b/leetcode/0134.Gas-Station/README.md
new file mode 100644
index 000000000..e4cb07821
--- /dev/null
+++ b/leetcode/0134.Gas-Station/README.md
@@ -0,0 +1,88 @@
+# [134. Gas Stations](https://leetcode.com/problems/gas-station/)
+
+
+## 题目
+
+You are given a list of gas stations on a circular route, where the amount of gas at station i is gas[i], and the cost to travel from station i to its next station (i+1) is cost[i]. You have a car with an unlimited gas tank and it costs cost[i] of gas to travel from station i to its next station (i+1). You begin the journey with an empty tank at one of the gas stations.
+
+Write a function that returns the starting gas station's index if you can travel around the circuit once in the clockwise direction, otherwise return -1. If there exists a solution, it is guaranteed to be unique.
+
+**Example 1:**
+
+```
+Input: gas = [1,2,3,4,5], cost = [3,4,5,1,2]
+Output: 3
+Explanation: Start at station 3 (index 3), you have 4 liters of gas. Now you have a total of =0+4=4 liters of gas.
+Travel to station 4. Now you have 4 - 1 + 5 = 8 liters of gas.
+Travel to station 0. Now you have 8 - 2 + 1 = 7 liters of gas.
+Travel to station 1. Now you have 7 - 3 + 2 = 6 liters of gas.
+Travel to station 2. Now you have 6 - 4 + 3 = 5 liters of gas.
+Travel to station 3 again. This time you will have consumed 5 liters of gas, which is exactly enough for you to return to station 3.
+Therefore, 3 can be the starting index.
+```
+
+**Example 2:**
+
+```
+Input: gas = [2,3,4], cost = [3,4,3]
+Output: -1
+Explanation: You cannot start at station 0 or 1 because there is not enough gas to get you to the next station.
+We start at station 2, we get 4 liters of gas. Now you have a total of =0+4=4 liters of gas.
+Travel to station 0. Now you have 4 - 3 + 2 = 3 liters of gas.
+Travel to station 1. Now you have 3 - 3 + 3 = 3 liters of gas.
+You cannot return to station 2 because it requires 4 liters of gas but you only have 3 liters in your tank.
+Therefore, no matter what, you cannot travel around the ring.
+```
+
+**Constraints:**
+
+- `gas.length == n`
+- `cost.length == n`
+- `1 <= n <= 10^5`
+- `0 <= gas[i], cost[i] <= 10^4`
+
+## 题目大意
+
+在一条环路上有 n 个加油站，其中第 i 个加油站有汽油 gas[i] 升。
+
+你有一辆油箱容量无限的的汽车，从第 i 个加油站开往第 i+1 个加油站需要消耗汽油 cost[i] 升。你从其中的一个加油站出发，开始时油箱为空。
+
+给定两个整数数组 gas 和 cost ，如果你可以按顺序绕环路行驶一周，则返回出发时加油站的编号，否则返回 -1 。如果存在解，则 保证 它是 唯一 的。
+
+## 解题思路
+
+- 初始化总油量（totalGas）和总消耗（totalCost）为0，起始点（start）为0，当前油量（currGas）为0。
+ 遍历每个加油站，累加油量和消耗，计算当前油量。
+ 如果当前油量小于0，说明从上一个加油站到当前加油站的油量不足以到达下一个加油站，因此将起始点设置为当前加油站的下一个位置，并将当前油量重置为0。
+ 遍历结束后，如果总油量小于总消耗，说明无法完成整个旅程，返回-1；否则返回起始点。
+
+## 代码
+
+```go
+package leetcode
+
+func canCompleteCircuit(gas []int, cost []int) int {
+ totalGas := 0
+ totalCost := 0
+ currGas := 0
+ start := 0
+
+ for i := 0; i < len(gas); i++ {
+ totalGas += gas[i]
+ totalCost += cost[i]
+ currGas += gas[i] - cost[i]
+
+ if currGas < 0 {
+ start = i + 1
+ currGas = 0
+ }
+ }
+
+ if totalGas < totalCost {
+ return -1
+ }
+
+ return start
+}
+
+```
\ No newline at end of file
diff --git a/leetcode/0135.Candy/135. Candy.go b/leetcode/0135.Candy/135. Candy.go
new file mode 100644
index 000000000..0cf961e0b
--- /dev/null
+++ b/leetcode/0135.Candy/135. Candy.go
@@ -0,0 +1,20 @@
+package leetcode
+
+func candy(ratings []int) int {
+ candies := make([]int, len(ratings))
+ for i := 1; i < len(ratings); i++ {
+ if ratings[i] > ratings[i-1] {
+ candies[i] += candies[i-1] + 1
+ }
+ }
+ for i := len(ratings) - 2; i >= 0; i-- {
+ if ratings[i] > ratings[i+1] && candies[i] <= candies[i+1] {
+ candies[i] = candies[i+1] + 1
+ }
+ }
+ total := 0
+ for _, candy := range candies {
+ total += candy + 1
+ }
+ return total
+}
diff --git a/leetcode/0135.Candy/135. Candy_test.go b/leetcode/0135.Candy/135. Candy_test.go
new file mode 100644
index 000000000..edb15ad35
--- /dev/null
+++ b/leetcode/0135.Candy/135. Candy_test.go
@@ -0,0 +1,47 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question135 struct {
+ para135
+ ans135
+}
+
+// para 是参数
+// one 代表第一个参数
+type para135 struct {
+ ratings []int
+}
+
+// ans 是答案
+// one 代表第一个答案
+type ans135 struct {
+ one int
+}
+
+func Test_Problem135(t *testing.T) {
+
+ qs := []question135{
+
+ {
+ para135{[]int{1, 0, 2}},
+ ans135{5},
+ },
+
+ {
+ para135{[]int{1, 2, 2}},
+ ans135{4},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 135------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans135, q.para135
+ fmt.Printf("【input】:%v 【output】:%v\n", p, candy(p.ratings))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/0135.Candy/README.md b/leetcode/0135.Candy/README.md
new file mode 100644
index 000000000..9f6dc16ad
--- /dev/null
+++ b/leetcode/0135.Candy/README.md
@@ -0,0 +1,74 @@
+# [135. Candy](https://leetcode.com/problems/candy/)
+
+
+## 题目
+
+There are `n` children standing in a line. Each child is assigned a rating value given in the integer array `ratings`.
+
+You are giving candies to these children subjected to the following requirements:
+
+- Each child must have at least one candy.
+- Children with a higher rating get more candies than their neighbors.
+
+Return *the minimum number of candies you need to have to distribute the candies to the children*.
+
+**Example 1:**
+
+```
+Input: ratings = [1,0,2]
+Output: 5
+Explanation: You can allocate to the first, second and third child with 2, 1, 2 candies respectively.
+```
+
+**Example 2:**
+
+```
+Input: ratings = [1,2,2]
+Output: 4
+Explanation: You can allocate to the first, second and third child with 1, 2, 1 candies respectively.
+The third child gets 1 candy because it satisfies the above two conditions.
+```
+
+**Constraints:**
+
+- `n == ratings.length`
+- `1 <= n <= 2 * 10^4`
+- `0 <= ratings[i] <= 2 * 10^4`
+
+## 题目大意
+
+老师想给孩子们分发糖果，有 N 个孩子站成了一条直线，老师会根据每个孩子的表现，预先给他们评分。你需要按照以下要求，帮助老师给这些孩子分发糖果：
+
+- 每个孩子至少分配到 1 个糖果。
+- 评分更高的孩子必须比他两侧的邻位孩子获得更多的糖果。
+
+那么这样下来，老师至少需要准备多少颗糖果呢？
+
+## 解题思路
+
+- 本题的突破口在于，评分更高的孩子必须比他两侧的邻位孩子获得更多的糖果，这句话。这个规则可以理解为 2 条规则，想象成按身高排队，站在下标为 0 的地方往后“看”，评分高即为个子高的，应该比前面个子矮(评分低)的分到糖果多；站在下标为 n - 1 的地方往后“看”，评分高即为个子高的，同样应该比前面个子矮(评分低)的分到糖果多。你可能会有疑问，规则都是一样的，为什么会出现至少需要多少糖果呢？因为可能出现评分一样高的同学。扫描数组两次，处理出每一个学生分别满足左规则或右规则时，最少需要被分得的糖果数量。每个人最终分得的糖果数量即为这两个数量的最大值。两次遍历结束，将所有糖果累加起来即为至少需要准备的糖果数。由于每个人至少分配到 1 个糖果，所以每个人糖果数再加一。
+
+## 代码
+
+```go
+package leetcode
+
+func candy(ratings []int) int {
+ candies := make([]int, len(ratings))
+ for i := 1; i < len(ratings); i++ {
+ if ratings[i] > ratings[i-1] {
+ candies[i] += candies[i-1] + 1
+ }
+ }
+ for i := len(ratings) - 2; i >= 0; i-- {
+ if ratings[i] > ratings[i+1] && candies[i] <= candies[i+1] {
+ candies[i] = candies[i+1] + 1
+ }
+ }
+ total := 0
+ for _, candy := range candies {
+ total += candy + 1
+ }
+ return total
+}
+```
\ No newline at end of file
diff --git a/leetcode/0136.Single-Number/README.md b/leetcode/0136.Single-Number/README.md
index e36ce6b29..fdf307eac 100755
--- a/leetcode/0136.Single-Number/README.md
+++ b/leetcode/0136.Single-Number/README.md
@@ -26,4 +26,4 @@ Your algorithm should have a linear runtime complexity. Could you implement it w
## 解题思路
- 题目要求不能使用辅助空间，并且时间复杂度只能是线性的。
-- 题目为什么要强调有一个数字出现一次，其他的出现两次？我们想到了异或运算的性质：任何一个数字异或它自己都等于0。也就是说，如果我们从头到尾依次异或数组中的每一个数字，那么最终的结果刚好是那个只出现依次的数字，因为那些出现两次的数字全部在异或中抵消掉了。于是最终做法是从头到尾依次异或数组中的每一个数字，那么最终得到的结果就是两个只出现一次的数字的异或结果。因为其他数字都出现了两次，在异或中全部抵消掉了。**利用的性质是 x^x = 0**。
+- 题目为什么要强调有一个数字出现一次，其他的出现两次？我们想到了异或运算的性质：任何一个数字异或它自己都等于0。也就是说，如果我们从头到尾依次异或数组中的每一个数字，那么最终的结果刚好是那个只出现一次的数字，因为那些出现两次的数字全部在异或中抵消掉了。于是最终做法是从头到尾依次异或数组中的每一个数字，那么最终得到的结果就是两个只出现一次的数字的异或结果。因为其他数字都出现了两次，在异或中全部抵消掉了。**利用的性质是 x^x = 0**。
diff --git a/leetcode/0137.Single-Number-II/README.md b/leetcode/0137.Single-Number-II/README.md
index 2bd634144..9733ff3c3 100755
--- a/leetcode/0137.Single-Number-II/README.md
+++ b/leetcode/0137.Single-Number-II/README.md
@@ -30,9 +30,9 @@ Your algorithm should have a linear runtime complexity. Could you implement it w
## 解题思路
- 这一题是第 136 题的加强版。这类题也可以扩展，在数组中每个元素都出现 5 次，找出只出现 1 次的数。
-- 本题中要求找出只出现 1 次的数，出现 3 次的数都要被消除。第 136 题是消除出现 2 次的数。这一题也会相当相同的解法，出现 3 次的数也要被消除。定义状态，00、10、01，这 3 个状态。当一个数出现 3 次，那么它每个位置上的 1 出现的次数肯定是 3 的倍数，所以当 1 出现 3 次以后，就归零清除。如何能做到这点呢？仿造`三进制(00，10，01)` 就可以做到。
+- 本题中要求找出只出现 1 次的数，出现 3 次的数都要被消除。第 136 题是消除出现 2 次的数。这一题也会相当相同的解法，出现 3 次的数也要被消除。定义状态，00、10、01，这 3 个状态。当一个数出现 3 次，那么它每个位置上的 1 出现的次数肯定是 3 的倍数，所以当 1 出现 3 次以后，就归零清除。如何能做到这点呢？仿造`三进制(00，01，10)` 就可以做到。
- 变量 ones 中记录遍历中每个位上出现 1 的个数。将它与 A[i] 进行异或，目的是：
- - 每位上两者都是 1 的，表示历史统计结果 ones 出现1次、A[i]中又出现1次，则是出现 2 次，需要进位到 twos 变量中。
+ - 每位上两者都是 1 的，表示历史统计结果 ones 出现1次、A[i]中又出现 1 次，则是出现 2 次，需要进位到 twos 变量中。
- 每位上两者分别为 0、1 的，加入到 ones 统计结果中。
- 最后还要 & ^twos ，是为了能做到三进制，出现 3 次就清零。例如 ones = x，那么 twos = 0，当 twos = x，那么 ones = 0；
- 变量 twos 中记录遍历中每个位上出现 1 ，2次 的个数。与 A[i] 进行异或的目的和上述描述相同，不再赘述。
@@ -41,6 +41,31 @@ Your algorithm should have a linear runtime complexity. Could you implement it w
> 在 golang 中没有 Java 中的 ~ 位操作运算符，Java 中的 ~ 运算符代表按位取反。这个操作就想当于 golang 中的 ^ 运算符当做一元运算符使用的效果。
+|(twos,ones)|xi|(twos'',ones')|ones'|
+|:----:|:----:|:----:|:----:|
+|00|0|00|0|
+|00|1|01|1|
+|01|0|01|1|
+|01|1|10|0|
+|10|0|10|0|
+|10|1|00|0|
+
+- 第一步，先将 ones -> ones'。通过观察可以看出 ones = (ones ^ nums[i]) & ^twos
+
+|(twos,ones')|xi|twos'|
+|:----:|:----:|:----:|
+|00|0|0|
+|01|1|0|
+|01|0|0|
+|00|1|1|
+|10|0|1|
+|10|1|0|
+
+
+- 第二步，再将 twos -> twos'。这一步需要用到前一步的 ones。通过观察可以看出 twos = (twos ^ nums[i]) & ^ones。
+
+--------------------------
+
这一题还可以继续扩展，在数组中每个元素都出现 5 次，找出只出现 1 次的数。那该怎么做呢？思路还是一样的，模拟一个五进制，5 次就会消除。代码如下：
// 解法一
diff --git a/leetcode/0138.Copy-List-With-Random-Pointer/138. Copy List With Random Pointer.go b/leetcode/0138.Copy-List-With-Random-Pointer/138. Copy List With Random Pointer.go
new file mode 100644
index 000000000..357740638
--- /dev/null
+++ b/leetcode/0138.Copy-List-With-Random-Pointer/138. Copy List With Random Pointer.go
@@ -0,0 +1,44 @@
+package leetcode
+
+// Node define
+type Node struct {
+ Val int
+ Next *Node
+ Random *Node
+}
+
+func copyRandomList(head *Node) *Node {
+ if head == nil {
+ return nil
+ }
+ tempHead := copyNodeToLinkedList(head)
+ return splitLinkedList(tempHead)
+}
+
+func splitLinkedList(head *Node) *Node {
+ cur := head
+ head = head.Next
+ for cur != nil && cur.Next != nil {
+ cur.Next, cur = cur.Next.Next, cur.Next
+ }
+ return head
+}
+
+func copyNodeToLinkedList(head *Node) *Node {
+ cur := head
+ for cur != nil {
+ node := &Node{
+ Val: cur.Val,
+ Next: cur.Next,
+ }
+ cur.Next, cur = node, cur.Next
+ }
+ cur = head
+ for cur != nil {
+ if cur.Random != nil {
+ cur.Next.Random = cur.Random.Next
+ }
+ cur = cur.Next.Next
+ }
+ return head
+}
diff --git a/leetcode/0138.Copy-List-With-Random-Pointer/138. Copy List With Random Pointer_test.go b/leetcode/0138.Copy-List-With-Random-Pointer/138. Copy List With Random Pointer_test.go
new file mode 100644
index 000000000..2bd540920
--- /dev/null
+++ b/leetcode/0138.Copy-List-With-Random-Pointer/138. Copy List With Random Pointer_test.go
@@ -0,0 +1,115 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+
+ "github.com/halfrost/LeetCode-Go/structures"
+)
+
+type question138 struct {
+ para138
+ ans138
+}
+
+// para 是参数
+// one 代表第一个参数
+type para138 struct {
+ head [][]int
+}
+
+// ans 是答案
+// one 代表第一个答案
+type ans138 struct {
+ one [][]int
+}
+
+func Test_Problem138(t *testing.T) {
+
+ qs := []question138{
+
+ {
+ para138{[][]int{{7, structures.NULL}, {13, 0}, {11, 4}, {10, 2}, {1, 0}}},
+ ans138{[][]int{{7, structures.NULL}, {13, 0}, {11, 4}, {10, 2}, {1, 0}}},
+ },
+
+ {
+ para138{[][]int{{1, 1}, {2, 1}}},
+ ans138{[][]int{{1, 1}, {2, 1}}},
+ },
+
+ {
+ para138{[][]int{{3, structures.NULL}, {3, 0}, {3, structures.NULL}}},
+ ans138{[][]int{{3, structures.NULL}, {3, 0}, {3, structures.NULL}}},
+ },
+
+ {
+ para138{[][]int{}},
+ ans138{[][]int{}},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 138------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans138, q.para138
+ fmt.Printf("【input】:%v 【output】:%v\n", p, node2Ints(copyRandomList(ints2Node(p.head))))
+ }
+ fmt.Printf("\n\n\n")
+}
+
+func ints2Node(one [][]int) *Node {
+ nodesMap := map[int]*Node{}
+ for index, nodes := range one {
+ tmp := &Node{Val: nodes[0]}
+ nodesMap[index] = tmp
+ }
+ for index, node := range nodesMap {
+ if index != len(one)-1 {
+ node.Next = nodesMap[index+1]
+ } else {
+ node.Next = nil
+ }
+ }
+ for index, nodes := range one {
+ if nodes[1] == structures.NULL {
+ nodesMap[index].Random = nil
+ } else {
+ nodesMap[index].Random = nodesMap[nodes[1]]
+ }
+ }
+ return nodesMap[0]
+}
+
+func node2Ints(head *Node) (res [][]int) {
+ nodesMap, count, cur := map[*Node]int{}, 0, head
+ if head == nil {
+ return [][]int{}
+ }
+ for cur.Next != nil {
+ nodesMap[cur] = count
+ count++
+ cur = cur.Next
+ }
+ nodesMap[cur] = count
+ tmp := []int{}
+ cur = head
+ for cur.Next != nil {
+ tmp := append(tmp, cur.Val)
+ if cur.Random == nil {
+ tmp = append(tmp, structures.NULL)
+ } else {
+ tmp = append(tmp, nodesMap[cur.Random])
+ }
+ res = append(res, tmp)
+ cur = cur.Next
+ }
+ tmp = append(tmp, cur.Val)
+ if cur.Random == nil {
+ tmp = append(tmp, structures.NULL)
+ } else {
+ tmp = append(tmp, nodesMap[cur.Random])
+ }
+ res = append(res, tmp)
+ return res
+}
diff --git a/leetcode/0138.Copy-List-With-Random-Pointer/README.md b/leetcode/0138.Copy-List-With-Random-Pointer/README.md
new file mode 100644
index 000000000..a4062ec39
--- /dev/null
+++ b/leetcode/0138.Copy-List-With-Random-Pointer/README.md
@@ -0,0 +1,130 @@
+# [138. Copy List with Random Pointer](https://leetcode.com/problems/copy-list-with-random-pointer/)
+
+## 题目
+
+A linked list is given such that each node contains an additional random pointer which could point to any node in the list or null.
+
+Return a **[deep copy](https://en.wikipedia.org/wiki/Object_copying#Deep_copy)** of the list.
+
+The Linked List is represented in the input/output as a list of `n` nodes. Each node is represented as a pair of `[val, random_index]` where:
+
+- `val`: an integer representing `Node.val`
+- `random_index`: the index of the node (range from `0` to `n-1`) where random pointer points to, or `null` if it does not point to any node.
+
+**Example 1:**
+
+
+
+```
+Input: head = [[7,null],[13,0],[11,4],[10,2],[1,0]]
+Output: [[7,null],[13,0],[11,4],[10,2],[1,0]]
+
+```
+
+**Example 2:**
+
+
+
+```
+Input: head = [[1,1],[2,1]]
+Output: [[1,1],[2,1]]
+
+```
+
+**Example 3:**
+
+
+
+```
+Input: head = [[3,null],[3,0],[3,null]]
+Output: [[3,null],[3,0],[3,null]]
+
+```
+
+**Example 4:**
+
+```
+Input: head = []
+Output: []
+Explanation: Given linked list is empty (null pointer), so return null.
+
+```
+
+**Constraints:**
+
+- `10000 <= Node.val <= 10000`
+- `Node.random` is null or pointing to a node in the linked list.
+- The number of nodes will not exceed 1000.
+
+## 题目大意
+
+给定一个链表，每个节点包含一个额外增加的随机指针，该指针可以指向链表中的任何节点或空节点。要求返回这个链表的 深拷贝。
+
+我们用一个由 n 个节点组成的链表来表示输入/输出中的链表。每个节点用一个 [val, random_index] 表示：
+
+- val：一个表示 Node.val 的整数。
+- random_index：随机指针指向的节点索引（范围从 0 到 n-1）；如果不指向任何节点，则为 null 。
+
+## 解题思路
+
+- 这道题严格意义上是数据结构题，根据给定的数据结构，对它进行深拷贝。
+- 先将每个节点都复制一份，放在它的 next 节点中。如此穿插的复制一份链表。
+
+ 
+
+ 再将穿插版的链表的 random 指针指向正确的位置。
+
+ 
+
+ 再将穿插版的链表的 next 指针指向正确的位置。最后分开这交织在一起的两个链表的头节点，即可分开 2 个链表。
+
+ 
+
+## 代码
+
+```go
+package leetcode
+
+// Node define
+type Node struct {
+ Val int
+ Next *Node
+ Random *Node
+}
+
+func copyRandomList(head *Node) *Node {
+ if head == nil {
+ return nil
+ }
+ tempHead := copyNodeToLinkedList(head)
+ return splitLinkedList(tempHead)
+}
+
+func splitLinkedList(head *Node) *Node {
+ cur := head
+ head = head.Next
+ for cur != nil && cur.Next != nil {
+ cur.Next, cur = cur.Next.Next, cur.Next
+ }
+ return head
+}
+
+func copyNodeToLinkedList(head *Node) *Node {
+ cur := head
+ for cur != nil {
+ node := &Node{
+ Val: cur.Val,
+ Next: cur.Next,
+ }
+ cur.Next, cur = node, cur.Next
+ }
+ cur = head
+ for cur != nil {
+ if cur.Random != nil {
+ cur.Next.Random = cur.Random.Next
+ }
+ cur = cur.Next.Next
+ }
+ return head
+}
+```
\ No newline at end of file
diff --git a/leetcode/0141.Linked-List-Cycle/141. Linked List Cycle.go b/leetcode/0141.Linked-List-Cycle/141. Linked List Cycle.go
index 10eebf0b2..947c10ce9 100644
--- a/leetcode/0141.Linked-List-Cycle/141. Linked List Cycle.go
+++ b/leetcode/0141.Linked-List-Cycle/141. Linked List Cycle.go
@@ -9,17 +9,16 @@ type ListNode = structures.ListNode
/**
* Definition for singly-linked list.
- * struct ListNode {
- * int val;
- * ListNode *next;
- * ListNode(int x) : val(x), next(NULL) {}
- * };
+ * type ListNode struct {
+ * Val int
+ * Next *ListNode
+ * }
*/
func hasCycle(head *ListNode) bool {
fast := head
slow := head
- for slow != nil && fast != nil && fast.Next != nil {
+ for fast != nil && fast.Next != nil {
fast = fast.Next.Next
slow = slow.Next
if fast == slow {
diff --git a/leetcode/0141.Linked-List-Cycle/141. Linked List Cycle_test.go b/leetcode/0141.Linked-List-Cycle/141. Linked List Cycle_test.go
index 06d9b570a..06bf230fd 100644
--- a/leetcode/0141.Linked-List-Cycle/141. Linked List Cycle_test.go
+++ b/leetcode/0141.Linked-List-Cycle/141. Linked List Cycle_test.go
@@ -1,6 +1,54 @@
package leetcode
-import "testing"
+import (
+ "fmt"
+ "testing"
+
+ "github.com/halfrost/LeetCode-Go/structures"
+)
+
+type question141 struct {
+ para141
+ ans141
+}
+
+// para 是参数
+// one 代表第一个参数
+type para141 struct {
+ one []int
+}
+
+// ans 是答案
+// one 代表第一个答案
+type ans141 struct {
+ one bool
+}
func Test_Problem141(t *testing.T) {
+
+ qs := []question141{
+
+ {
+ para141{[]int{3, 2, 0, -4}},
+ ans141{false},
+ },
+
+ {
+ para141{[]int{1, 2}},
+ ans141{false},
+ },
+
+ {
+ para141{[]int{1}},
+ ans141{false},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 141------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans141, q.para141
+ fmt.Printf("【input】:%v 【output】:%v\n", p, hasCycle(structures.Ints2List(p.one)))
+ }
+ fmt.Printf("\n\n\n")
}
diff --git a/leetcode/0143.Reorder-List/README.md b/leetcode/0143.Reorder-List/README.md
index 4df8c7ff4..0e0915d02 100644
--- a/leetcode/0143.Reorder-List/README.md
+++ b/leetcode/0143.Reorder-List/README.md
@@ -31,4 +31,4 @@ Given 1->2->3->4->5, reorder it to 1->5->2->4->3.
更好的做法是结合之前几道题的操作：链表逆序，找中间结点。
-先找到链表的中间结点，然后利用逆序区间的操作，如 [第 92 题](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0092.Reverse-Linked-List-II) 里的 reverseBetween() 操作，只不过这里的反转区间是从中点一直到末尾。最后利用 2 个指针，一个指向头结点，一个指向中间结点，开始拼接最终的结果。这种做法的时间复杂度是 O(n)，空间复杂度是 O(1)。
\ No newline at end of file
+先找到链表的中间结点，然后利用逆序区间的操作，如 [第 92 题](https://github.com/halfrost/leetcode-go/tree/master/leetcode/0092.Reverse-Linked-List-II) 里的 reverseBetween() 操作，只不过这里的反转区间是从中点一直到末尾。最后利用 2 个指针，一个指向头结点，一个指向中间结点，开始拼接最终的结果。这种做法的时间复杂度是 O(n)，空间复杂度是 O(1)。
\ No newline at end of file
diff --git a/leetcode/0146.LRU-Cache/146. LRU Cache.go b/leetcode/0146.LRU-Cache/146. LRU Cache.go
new file mode 100644
index 000000000..f7a1ae051
--- /dev/null
+++ b/leetcode/0146.LRU-Cache/146. LRU Cache.go
@@ -0,0 +1,71 @@
+package leetcode
+
+type LRUCache struct {
+ head, tail *Node
+ Keys map[int]*Node
+ Cap int
+}
+
+type Node struct {
+ Key, Val int
+ Prev, Next *Node
+}
+
+func Constructor(capacity int) LRUCache {
+ return LRUCache{Keys: make(map[int]*Node), Cap: capacity}
+}
+
+func (this *LRUCache) Get(key int) int {
+ if node, ok := this.Keys[key]; ok {
+ this.Remove(node)
+ this.Add(node)
+ return node.Val
+ }
+ return -1
+}
+
+func (this *LRUCache) Put(key int, value int) {
+ if node, ok := this.Keys[key]; ok {
+ node.Val = value
+ this.Remove(node)
+ this.Add(node)
+ return
+ } else {
+ node = &Node{Key: key, Val: value}
+ this.Keys[key] = node
+ this.Add(node)
+ }
+ if len(this.Keys) > this.Cap {
+ delete(this.Keys, this.tail.Key)
+ this.Remove(this.tail)
+ }
+}
+
+func (this *LRUCache) Add(node *Node) {
+ node.Prev = nil
+ node.Next = this.head
+ if this.head != nil {
+ this.head.Prev = node
+ }
+ this.head = node
+ if this.tail == nil {
+ this.tail = node
+ this.tail.Next = nil
+ }
+}
+
+func (this *LRUCache) Remove(node *Node) {
+ if node == this.head {
+ this.head = node.Next
+ node.Next = nil
+ return
+ }
+ if node == this.tail {
+ this.tail = node.Prev
+ node.Prev.Next = nil
+ node.Prev = nil
+ return
+ }
+ node.Prev.Next = node.Next
+ node.Next.Prev = node.Prev
+}
diff --git a/leetcode/0146.LRU-Cache/146. LRU Cache_test.go b/leetcode/0146.LRU-Cache/146. LRU Cache_test.go
new file mode 100644
index 000000000..9d8d16047
--- /dev/null
+++ b/leetcode/0146.LRU-Cache/146. LRU Cache_test.go
@@ -0,0 +1,40 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+func Test_Problem146(t *testing.T) {
+ obj := Constructor(2)
+ fmt.Printf("obj = %v\n", MList2Ints(&obj))
+ obj.Put(1, 1)
+ fmt.Printf("obj = %v\n", MList2Ints(&obj))
+ obj.Put(2, 2)
+ fmt.Printf("obj = %v\n", MList2Ints(&obj))
+ param1 := obj.Get(1)
+ fmt.Printf("param_1 = %v obj = %v\n", param1, MList2Ints(&obj))
+ obj.Put(3, 3)
+ fmt.Printf("obj = %v\n", MList2Ints(&obj))
+ param1 = obj.Get(2)
+ fmt.Printf("param_1 = %v obj = %v\n", param1, MList2Ints(&obj))
+ obj.Put(4, 4)
+ fmt.Printf("obj = %v\n", MList2Ints(&obj))
+ param1 = obj.Get(1)
+ fmt.Printf("param_1 = %v obj = %v\n", param1, MList2Ints(&obj))
+ param1 = obj.Get(3)
+ fmt.Printf("param_1 = %v obj = %v\n", param1, MList2Ints(&obj))
+ param1 = obj.Get(4)
+ fmt.Printf("param_1 = %v obj = %v\n", param1, MList2Ints(&obj))
+}
+
+func MList2Ints(lru *LRUCache) [][]int {
+ res := [][]int{}
+ head := lru.head
+ for head != nil {
+ tmp := []int{head.Key, head.Val}
+ res = append(res, tmp)
+ head = head.Next
+ }
+ return res
+}
diff --git a/leetcode/0146.LRU-Cache/README.md b/leetcode/0146.LRU-Cache/README.md
new file mode 100644
index 000000000..3e5ac858a
--- /dev/null
+++ b/leetcode/0146.LRU-Cache/README.md
@@ -0,0 +1,134 @@
+# [146. LRU Cache](https://leetcode.com/problems/lru-cache/)
+
+## 题目
+
+Design a data structure that follows the constraints of a **[Least Recently Used (LRU) cache](https://en.wikipedia.org/wiki/Cache_replacement_policies#LRU)**.
+
+Implement the `LRUCache` class:
+
+- `LRUCache(int capacity)` Initialize the LRU cache with **positive** size `capacity`.
+- `int get(int key)` Return the value of the `key` if the key exists, otherwise return `1`.
+- `void put(int key, int value)` Update the value of the `key` if the `key` exists. Otherwise, add the `key-value` pair to the cache. If the number of keys exceeds the `capacity` from this operation, **evict** the least recently used key.
+
+**Follow up:**Could you do `get` and `put` in `O(1)` time complexity?
+
+**Example 1:**
+
+```
+Input
+["LRUCache", "put", "put", "get", "put", "get", "put", "get", "get", "get"]
+[[2], [1, 1], [2, 2], [1], [3, 3], [2], [4, 4], [1], [3], [4]]
+Output
+[null, null, null, 1, null, -1, null, -1, 3, 4]
+
+Explanation
+LRUCache lRUCache = new LRUCache(2);
+lRUCache.put(1, 1); // cache is {1=1}
+lRUCache.put(2, 2); // cache is {1=1, 2=2}
+lRUCache.get(1); // return 1
+lRUCache.put(3, 3); // LRU key was 2, evicts key 2, cache is {1=1, 3=3}
+lRUCache.get(2); // returns -1 (not found)
+lRUCache.put(4, 4); // LRU key was 1, evicts key 1, cache is {4=4, 3=3}
+lRUCache.get(1); // return -1 (not found)
+lRUCache.get(3); // return 3
+lRUCache.get(4); // return 4
+
+```
+
+**Constraints:**
+
+- `1 <= capacity <= 3000`
+- `0 <= key <= 3000`
+- `0 <= value <= 104`
+- At most `3 * 104` calls will be made to `get` and `put`.
+
+## 题目大意
+
+运用你所掌握的数据结构，设计和实现一个 LRU (最近最少使用) 缓存机制 。
+实现 LRUCache 类：
+
+- LRUCache(int capacity) 以正整数作为容量 capacity 初始化 LRU 缓存
+- int get(int key) 如果关键字 key 存在于缓存中，则返回关键字的值，否则返回 -1 。
+- void put(int key, int value) 如果关键字已经存在，则变更其数据值；如果关键字不存在，则插入该组「关键字-值」。当缓存容量达到上限时，它应该在写入新数据之前删除最久未使用的数据值，从而为新的数据值留出空间。
+
+进阶：你是否可以在 O(1) 时间复杂度内完成这两种操作？
+
+## 解题思路
+
+- 这一题是 LRU 经典面试题，详细解释见[第三章 LRUCache 模板](https://books.halfrost.com/leetcode/ChapterThree/LRUCache/)。
+
+## 代码
+
+```go
+package leetcode
+
+type LRUCache struct {
+ head, tail *Node
+ Keys map[int]*Node
+ Cap int
+}
+
+type Node struct {
+ Key, Val int
+ Prev, Next *Node
+}
+
+func Constructor(capacity int) LRUCache {
+ return LRUCache{Keys: make(map[int]*Node), Cap: capacity}
+}
+
+func (this *LRUCache) Get(key int) int {
+ if node, ok := this.Keys[key]; ok {
+ this.Remove(node)
+ this.Add(node)
+ return node.Val
+ }
+ return -1
+}
+
+func (this *LRUCache) Put(key int, value int) {
+ if node, ok := this.Keys[key]; ok {
+ node.Val = value
+ this.Remove(node)
+ this.Add(node)
+ return
+ } else {
+ node = &Node{Key: key, Val: value}
+ this.Keys[key] = node
+ this.Add(node)
+ }
+ if len(this.Keys) > this.Cap {
+ delete(this.Keys, this.tail.Key)
+ this.Remove(this.tail)
+ }
+}
+
+func (this *LRUCache) Add(node *Node) {
+ node.Prev = nil
+ node.Next = this.head
+ if this.head != nil {
+ this.head.Prev = node
+ }
+ this.head = node
+ if this.tail == nil {
+ this.tail = node
+ this.tail.Next = nil
+ }
+}
+
+func (this *LRUCache) Remove(node *Node) {
+ if node == this.head {
+ this.head = node.Next
+ node.Next = nil
+ return
+ }
+ if node == this.tail {
+ this.tail = node.Prev
+ node.Prev.Next = nil
+ node.Prev = nil
+ return
+ }
+ node.Prev.Next = node.Next
+ node.Next.Prev = node.Prev
+}
+```
\ No newline at end of file
diff --git a/leetcode/0148.Sort-List/148. Sort List.go b/leetcode/0148.Sort-List/148. Sort List.go
index c5132dbb3..2461013f4 100644
--- a/leetcode/0148.Sort-List/148. Sort List.go
+++ b/leetcode/0148.Sort-List/148. Sort List.go
@@ -25,17 +25,17 @@ func sortList(head *ListNode) *ListNode {
return head
}
- middleNode := middleNode1(head)
+ middleNode := middleNode(head)
cur = middleNode.Next
middleNode.Next = nil
middleNode = cur
left := sortList(head)
right := sortList(middleNode)
- return mergeTwoLists148(left, right)
+ return mergeTwoLists(left, right)
}
-func middleNode1(head *ListNode) *ListNode {
+func middleNode(head *ListNode) *ListNode {
if head == nil || head.Next == nil {
return head
}
@@ -48,21 +48,6 @@ func middleNode1(head *ListNode) *ListNode {
return p1
}
-func mergeTwoLists148(l1 *ListNode, l2 *ListNode) *ListNode {
- if l1 == nil {
- return l2
- }
- if l2 == nil {
- return l1
- }
- if l1.Val < l2.Val {
- l1.Next = mergeTwoLists(l1.Next, l2)
- return l1
- }
- l2.Next = mergeTwoLists(l1, l2.Next)
- return l2
-}
-
func mergeTwoLists(l1 *ListNode, l2 *ListNode) *ListNode {
if l1 == nil {
return l2
diff --git a/leetcode/0150.Evaluate-Reverse-Polish-Notation/150. Evaluate Reverse Polish Notation.go b/leetcode/0150.Evaluate-Reverse-Polish-Notation/150. Evaluate Reverse Polish Notation.go
index eac594102..e91375491 100644
--- a/leetcode/0150.Evaluate-Reverse-Polish-Notation/150. Evaluate Reverse Polish Notation.go
+++ b/leetcode/0150.Evaluate-Reverse-Polish-Notation/150. Evaluate Reverse Polish Notation.go
@@ -5,46 +5,23 @@ import (
)
func evalRPN(tokens []string) int {
- if len(tokens) == 1 {
- i, _ := strconv.Atoi(tokens[0])
- return i
- }
- stack, top := []int{}, 0
- for _, v := range tokens {
- switch v {
- case "+":
- {
- sum := stack[top-2] + stack[top-1]
- stack = stack[:top-2]
- stack = append(stack, sum)
- top--
- }
- case "-":
- {
- sub := stack[top-2] - stack[top-1]
- stack = stack[:top-2]
- stack = append(stack, sub)
- top--
- }
- case "*":
- {
- mul := stack[top-2] * stack[top-1]
- stack = stack[:top-2]
- stack = append(stack, mul)
- top--
- }
- case "/":
- {
- div := stack[top-2] / stack[top-1]
- stack = stack[:top-2]
- stack = append(stack, div)
- top--
- }
- default:
- {
- i, _ := strconv.Atoi(v)
- stack = append(stack, i)
- top++
+ stack := make([]int, 0, len(tokens))
+ for _, token := range tokens {
+ v, err := strconv.Atoi(token)
+ if err == nil {
+ stack = append(stack, v)
+ } else {
+ num1, num2 := stack[len(stack)-2], stack[len(stack)-1]
+ stack = stack[:len(stack)-2]
+ switch token {
+ case "+":
+ stack = append(stack, num1+num2)
+ case "-":
+ stack = append(stack, num1-num2)
+ case "*":
+ stack = append(stack, num1*num2)
+ case "/":
+ stack = append(stack, num1/num2)
}
}
}
diff --git a/leetcode/0160.Intersection-of-Two-Linked-Lists/160. Intersection of Two Linked Lists.go b/leetcode/0160.Intersection-of-Two-Linked-Lists/160. Intersection of Two Linked Lists.go
index 93d68a224..b7b2ee342 100644
--- a/leetcode/0160.Intersection-of-Two-Linked-Lists/160. Intersection of Two Linked Lists.go
+++ b/leetcode/0160.Intersection-of-Two-Linked-Lists/160. Intersection of Two Linked Lists.go
@@ -1,8 +1,8 @@
package leetcode
-import "fmt"
-
import (
+ "fmt"
+
"github.com/halfrost/LeetCode-Go/structures"
)
diff --git a/leetcode/0164.Maximum-Gap/164. Maximum Gap.go b/leetcode/0164.Maximum-Gap/164. Maximum Gap.go
index bfe40b51a..120334ffd 100644
--- a/leetcode/0164.Maximum-Gap/164. Maximum Gap.go
+++ b/leetcode/0164.Maximum-Gap/164. Maximum Gap.go
@@ -1,12 +1,11 @@
package leetcode
-// 解法一
+// 解法一 快排
func maximumGap(nums []int) int {
if len(nums) < 2 {
return 0
}
quickSort164(nums, 0, len(nums)-1)
-
res := 0
for i := 0; i < len(nums)-1; i++ {
if (nums[i+1] - nums[i]) > res {
@@ -37,52 +36,42 @@ func quickSort164(a []int, lo, hi int) {
quickSort164(a, p+1, hi)
}
-// 解法二
+// 解法二 基数排序
func maximumGap1(nums []int) int {
-
if nums == nil || len(nums) < 2 {
return 0
}
-
// m is the maximal number in nums
m := nums[0]
for i := 1; i < len(nums); i++ {
m = max(m, nums[i])
}
-
exp := 1 // 1, 10, 100, 1000 ...
R := 10 // 10 digits
-
aux := make([]int, len(nums))
-
for (m / exp) > 0 { // Go through all digits from LSB to MSB
count := make([]int, R)
-
for i := 0; i < len(nums); i++ {
count[(nums[i]/exp)%10]++
}
-
for i := 1; i < len(count); i++ {
count[i] += count[i-1]
}
-
for i := len(nums) - 1; i >= 0; i-- {
tmp := count[(nums[i]/exp)%10]
tmp--
aux[tmp] = nums[i]
+ count[(nums[i]/exp)%10] = tmp
}
-
for i := 0; i < len(nums); i++ {
nums[i] = aux[i]
}
exp *= 10
}
-
maxValue := 0
for i := 1; i < len(aux); i++ {
maxValue = max(maxValue, aux[i]-aux[i-1])
}
-
return maxValue
}
diff --git a/leetcode/0164.Maximum-Gap/164. Maximum Gap_test.go b/leetcode/0164.Maximum-Gap/164. Maximum Gap_test.go
index 6030dfe29..db38fb388 100644
--- a/leetcode/0164.Maximum-Gap/164. Maximum Gap_test.go
+++ b/leetcode/0164.Maximum-Gap/164. Maximum Gap_test.go
@@ -49,6 +49,11 @@ func Test_Problem164(t *testing.T) {
para164{[]int{2, 435, 214, 64321, 643, 7234, 7, 436523, 7856, 8}},
ans164{372202},
},
+
+ {
+ para164{[]int{1, 10000000}},
+ ans164{9999999},
+ },
}
fmt.Printf("------------------------Leetcode Problem 164------------------------\n")
diff --git a/leetcode/0167.Two-Sum-II---Input-array-is-sorted/167. Two Sum II - Input array is sorted.go b/leetcode/0167.Two-Sum-II-Input-array-is-sorted/167. Two Sum II - Input array is sorted.go
similarity index 79%
rename from leetcode/0167.Two-Sum-II---Input-array-is-sorted/167. Two Sum II - Input array is sorted.go
rename to leetcode/0167.Two-Sum-II-Input-array-is-sorted/167. Two Sum II - Input array is sorted.go
index b73a32e10..e77da7c0d 100644
--- a/leetcode/0167.Two-Sum-II---Input-array-is-sorted/167. Two Sum II - Input array is sorted.go
+++ b/leetcode/0167.Two-Sum-II-Input-array-is-sorted/167. Two Sum II - Input array is sorted.go
@@ -6,13 +6,14 @@ func twoSum167(numbers []int, target int) []int {
for i < j {
if numbers[i]+numbers[j] == target {
return []int{i + 1, j + 1}
- } else if numbers[i]+numbers[j] < target {
+ }
+ if numbers[i]+numbers[j] < target {
i++
} else {
j--
}
}
- return []int{-1, -1}
+ return nil
}
// 解法二 不管数组是否有序，空间复杂度比上一种解法要多 O(n)
@@ -20,8 +21,8 @@ func twoSum167_1(numbers []int, target int) []int {
m := make(map[int]int)
for i := 0; i < len(numbers); i++ {
another := target - numbers[i]
- if _, ok := m[another]; ok {
- return []int{m[another] + 1, i + 1}
+ if idx, ok := m[another]; ok {
+ return []int{idx + 1, i + 1}
}
m[numbers[i]] = i
}
diff --git a/leetcode/0167.Two-Sum-II---Input-array-is-sorted/167. Two Sum II - Input array is sorted_test.go b/leetcode/0167.Two-Sum-II-Input-array-is-sorted/167. Two Sum II - Input array is sorted_test.go
similarity index 100%
rename from leetcode/0167.Two-Sum-II---Input-array-is-sorted/167. Two Sum II - Input array is sorted_test.go
rename to leetcode/0167.Two-Sum-II-Input-array-is-sorted/167. Two Sum II - Input array is sorted_test.go
diff --git a/leetcode/0167.Two-Sum-II---Input-array-is-sorted/README.md b/leetcode/0167.Two-Sum-II-Input-array-is-sorted/README.md
similarity index 100%
rename from leetcode/0167.Two-Sum-II---Input-array-is-sorted/README.md
rename to leetcode/0167.Two-Sum-II-Input-array-is-sorted/README.md
diff --git a/leetcode/0168.Excel-Sheet-Column-Title/README.md b/leetcode/0168.Excel-Sheet-Column-Title/README.md
index c1ecdd583..4602e86b2 100644
--- a/leetcode/0168.Excel-Sheet-Column-Title/README.md
+++ b/leetcode/0168.Excel-Sheet-Column-Title/README.md
@@ -7,7 +7,7 @@ Given a positive integer, return its corresponding column title as appear in an
For example:
```
- 1 -> A
+ 1 -> A
2 -> B
3 -> C
...
diff --git a/leetcode/0173.Binary-Search-Tree-Iterator/173. Binary Search Tree Iterator.go b/leetcode/0173.Binary-Search-Tree-Iterator/173. Binary Search Tree Iterator.go
index 35f1a69b3..c7e8f2b2f 100644
--- a/leetcode/0173.Binary-Search-Tree-Iterator/173. Binary Search Tree Iterator.go
+++ b/leetcode/0173.Binary-Search-Tree-Iterator/173. Binary Search Tree Iterator.go
@@ -1,8 +1,8 @@
package leetcode
-import "container/heap"
-
import (
+ "container/heap"
+
"github.com/halfrost/LeetCode-Go/structures"
)
diff --git a/leetcode/0189.Rotate-Array/189. Rotate Array.go b/leetcode/0189.Rotate-Array/189. Rotate Array.go
new file mode 100644
index 000000000..004b55e6f
--- /dev/null
+++ b/leetcode/0189.Rotate-Array/189. Rotate Array.go
@@ -0,0 +1,24 @@
+package leetcode
+
+// 解法一 时间复杂度 O(n)，空间复杂度 O(1)
+func rotate(nums []int, k int) {
+ k %= len(nums)
+ reverse(nums)
+ reverse(nums[:k])
+ reverse(nums[k:])
+}
+
+func reverse(a []int) {
+ for i, n := 0, len(a); i < n/2; i++ {
+ a[i], a[n-1-i] = a[n-1-i], a[i]
+ }
+}
+
+// 解法二 时间复杂度 O(n)，空间复杂度 O(n)
+func rotate1(nums []int, k int) {
+ newNums := make([]int, len(nums))
+ for i, v := range nums {
+ newNums[(i+k)%len(nums)] = v
+ }
+ copy(nums, newNums)
+}
diff --git a/leetcode/0189.Rotate-Array/189. Rotate Array_test.go b/leetcode/0189.Rotate-Array/189. Rotate Array_test.go
new file mode 100644
index 000000000..a3267c9a4
--- /dev/null
+++ b/leetcode/0189.Rotate-Array/189. Rotate Array_test.go
@@ -0,0 +1,50 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question189 struct {
+ para189
+ ans189
+}
+
+// para 是参数
+// one 代表第一个参数
+type para189 struct {
+ nums []int
+ k int
+}
+
+// ans 是答案
+// one 代表第一个答案
+type ans189 struct {
+ one []int
+}
+
+func Test_Problem189(t *testing.T) {
+
+ qs := []question189{
+
+ {
+ para189{[]int{1, 2, 3, 4, 5, 6, 7}, 3},
+ ans189{[]int{5, 6, 7, 1, 2, 3, 4}},
+ },
+
+ {
+ para189{[]int{-1, -100, 3, 99}, 2},
+ ans189{[]int{3, 99, -1, -100}},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 189------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans189, q.para189
+ fmt.Printf("【input】:%v ", p)
+ rotate(p.nums, p.k)
+ fmt.Printf("【output】:%v\n", p.nums)
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/0189.Rotate-Array/README.md b/leetcode/0189.Rotate-Array/README.md
new file mode 100644
index 000000000..a83b4ab60
--- /dev/null
+++ b/leetcode/0189.Rotate-Array/README.md
@@ -0,0 +1,75 @@
+# [189. Rotate Array](https://leetcode.com/problems/rotate-array/)
+
+## 题目
+
+Given an array, rotate the array to the right by *k* steps, where *k* is non-negative.
+
+**Follow up:**
+
+- Try to come up as many solutions as you can, there are at least 3 different ways to solve this problem.
+- Could you do it in-place with O(1) extra space?
+
+**Example 1:**
+
+```
+Input: nums = [1,2,3,4,5,6,7], k = 3
+Output: [5,6,7,1,2,3,4]
+Explanation:
+rotate 1 steps to the right: [7,1,2,3,4,5,6]
+rotate 2 steps to the right: [6,7,1,2,3,4,5]
+rotate 3 steps to the right: [5,6,7,1,2,3,4]
+```
+
+**Example 2:**
+
+```
+Input: nums = [-1,-100,3,99], k = 2
+Output: [3,99,-1,-100]
+Explanation:
+rotate 1 steps to the right: [99,-1,-100,3]
+rotate 2 steps to the right: [3,99,-1,-100]
+```
+
+**Constraints:**
+
+- `1 <= nums.length <= 2 * 10^4`
+- `-2^31 <= nums[i] <= 2^31 - 1`
+- `0 <= k <= 10^5`
+
+## 题目大意
+
+给定一个数组，将数组中的元素向右移动 k 个位置，其中 k 是非负数。
+
+## 解题思路
+
+- 解法二，使用一个额外的数组，先将原数组下标为 i 的元素移动到 `(i+k) mod n` 的位置，再将剩下的元素拷贝回来即可。
+- 解法一，由于题目要求不能使用额外的空间，所以本题最佳解法不是解法二。翻转最终态是，末尾 `k mod n` 个元素移动至了数组头部，剩下的元素右移 `k mod n` 个位置至最尾部。确定了最终态以后再变换就很容易。先将数组中所有元素从头到尾翻转一次，尾部的所有元素都到了头部，然后再将 `[0,(k mod n) − 1]` 区间内的元素翻转一次，最后再将 `[k mod n, n − 1]` 区间内的元素翻转一次，即可满足题目要求。
+
+## 代码
+
+```go
+package leetcode
+
+// 解法一 时间复杂度 O(n)，空间复杂度 O(1)
+func rotate(nums []int, k int) {
+ k %= len(nums)
+ reverse(nums)
+ reverse(nums[:k])
+ reverse(nums[k:])
+}
+
+func reverse(a []int) {
+ for i, n := 0, len(a); i < n/2; i++ {
+ a[i], a[n-1-i] = a[n-1-i], a[i]
+ }
+}
+
+// 解法二 时间复杂度 O(n)，空间复杂度 O(n)
+func rotate1(nums []int, k int) {
+ newNums := make([]int, len(nums))
+ for i, v := range nums {
+ newNums[(i+k)%len(nums)] = v
+ }
+ copy(nums, newNums)
+}
+```
\ No newline at end of file
diff --git a/leetcode/0190.Reverse-Bits/190. Reverse Bits_test.go b/leetcode/0190.Reverse-Bits/190. Reverse Bits_test.go
index 20c677d65..12c5c23d5 100644
--- a/leetcode/0190.Reverse-Bits/190. Reverse Bits_test.go
+++ b/leetcode/0190.Reverse-Bits/190. Reverse Bits_test.go
@@ -2,6 +2,7 @@ package leetcode
import (
"fmt"
+ "strconv"
"testing"
)
@@ -23,7 +24,6 @@ type ans190 struct {
}
func Test_Problem190(t *testing.T) {
-
qs := []question190{
{
@@ -41,7 +41,12 @@ func Test_Problem190(t *testing.T) {
for _, q := range qs {
_, p := q.ans190, q.para190
- fmt.Printf("【input】:%v 【output】:%v\n", p, reverseBits(p.one))
+ input := strconv.FormatUint(uint64(p.one), 2) // 32位无符号整数转换为二进制字符串
+ input = fmt.Sprintf("%0*v", 32, input) // 格式化输出32位,保留前置0
+ output := reverseBits(p.one)
+ outputBin := strconv.FormatUint(uint64(output), 2) // 32位无符号整数转换为二进制字符串
+ outputBin = fmt.Sprintf("%0*v", 32, outputBin) // 格式化输出32位,保留前置0
+ fmt.Printf("【input】:%v 【output】:%v (%v)\n", input, output, outputBin)
}
fmt.Printf("\n\n\n")
}
diff --git a/leetcode/0191.Number-of-1-Bits/191. Number of 1 Bits_test.go b/leetcode/0191.Number-of-1-Bits/191. Number of 1 Bits_test.go
index f327977c6..ac789e86e 100644
--- a/leetcode/0191.Number-of-1-Bits/191. Number of 1 Bits_test.go
+++ b/leetcode/0191.Number-of-1-Bits/191. Number of 1 Bits_test.go
@@ -2,6 +2,7 @@ package leetcode
import (
"fmt"
+ "strconv"
"testing"
)
@@ -40,7 +41,9 @@ func Test_Problem191(t *testing.T) {
for _, q := range qs {
_, p := q.ans191, q.para191
- fmt.Printf("【input】:%v 【output】:%v\n", p, hammingWeight(p.one))
+ input := strconv.FormatUint(uint64(p.one), 2) // 32位无符号整数转换为二进制字符串
+ input = fmt.Sprintf("%0*v", 32, input) // 格式化输出32位,保留前置0
+ fmt.Printf("【input】:%v 【output】:%v\n", input, hammingWeight(p.one))
}
fmt.Printf("\n\n\n")
}
diff --git a/leetcode/0199.Binary-Tree-Right-Side-View/199. Binary Tree Right Side View.go b/leetcode/0199.Binary-Tree-Right-Side-View/199. Binary Tree Right Side View.go
index e30aec0dd..de53951bb 100644
--- a/leetcode/0199.Binary-Tree-Right-Side-View/199. Binary Tree Right Side View.go
+++ b/leetcode/0199.Binary-Tree-Right-Side-View/199. Binary Tree Right Side View.go
@@ -17,33 +17,23 @@ type TreeNode = structures.TreeNode
*/
func rightSideView(root *TreeNode) []int {
+ res := []int{}
if root == nil {
- return []int{}
+ return res
}
- queue := []*TreeNode{}
- queue = append(queue, root)
- curNum, nextLevelNum, res, tmp := 1, 0, []int{}, []int{}
- for len(queue) != 0 {
- if curNum > 0 {
- node := queue[0]
- if node.Left != nil {
- queue = append(queue, node.Left)
- nextLevelNum++
+ queue := []*TreeNode{root}
+ for len(queue) > 0 {
+ n := len(queue)
+ for i := 0; i < n; i++ {
+ if queue[i].Left != nil {
+ queue = append(queue, queue[i].Left)
}
- if node.Right != nil {
- queue = append(queue, node.Right)
- nextLevelNum++
+ if queue[i].Right != nil {
+ queue = append(queue, queue[i].Right)
}
- curNum--
- tmp = append(tmp, node.Val)
- queue = queue[1:]
- }
- if curNum == 0 {
- res = append(res, tmp[len(tmp)-1])
- curNum = nextLevelNum
- nextLevelNum = 0
- tmp = []int{}
}
+ res = append(res, queue[n-1].Val)
+ queue = queue[n:]
}
return res
}
diff --git a/leetcode/0202.Happy-Number/202. Happy Number.go b/leetcode/0202.Happy-Number/202. Happy Number.go
index 3764600ef..bd2b1b2ce 100644
--- a/leetcode/0202.Happy-Number/202. Happy Number.go
+++ b/leetcode/0202.Happy-Number/202. Happy Number.go
@@ -1,27 +1,26 @@
package leetcode
func isHappy(n int) bool {
- if n == 0 {
- return false
- }
- res := 0
- num := n
record := map[int]int{}
- for {
- for num != 0 {
- res += (num % 10) * (num % 10)
- num = num / 10
- }
- if _, ok := record[res]; !ok {
- if res == 1 {
- return true
+ for n != 1 {
+ record[n] = n
+ n = getSquareOfDigits(n)
+ for _, previous := range record {
+ if n == previous {
+ return false
}
- record[res] = res
- num = res
- res = 0
- continue
- } else {
- return false
}
}
+ return true
+}
+
+func getSquareOfDigits(n int) int {
+ squareOfDigits := 0
+ temporary := n
+ for temporary != 0 {
+ remainder := temporary % 10
+ squareOfDigits += remainder * remainder
+ temporary /= 10
+ }
+ return squareOfDigits
}
diff --git a/leetcode/0202.Happy-Number/202. Happy Number_test.go b/leetcode/0202.Happy-Number/202. Happy Number_test.go
index d8e4e7f9c..a80ff83cf 100644
--- a/leetcode/0202.Happy-Number/202. Happy Number_test.go
+++ b/leetcode/0202.Happy-Number/202. Happy Number_test.go
@@ -35,6 +35,16 @@ func Test_Problem202(t *testing.T) {
para202{19},
ans202{true},
},
+
+ {
+ para202{2},
+ ans202{false},
+ },
+
+ {
+ para202{3},
+ ans202{false},
+ },
}
fmt.Printf("------------------------Leetcode Problem 202------------------------\n")
diff --git a/leetcode/0209.Minimum-Size-Subarray-Sum/209. Minimum Size Subarray Sum.go b/leetcode/0209.Minimum-Size-Subarray-Sum/209. Minimum Size Subarray Sum.go
index 3c7a14365..acedf56c6 100644
--- a/leetcode/0209.Minimum-Size-Subarray-Sum/209. Minimum Size Subarray Sum.go
+++ b/leetcode/0209.Minimum-Size-Subarray-Sum/209. Minimum Size Subarray Sum.go
@@ -1,24 +1,16 @@
package leetcode
-func minSubArrayLen(s int, nums []int) int {
- n := len(nums)
- if n == 0 {
- return 0
- }
- left, right, res, sum := 0, -1, n+1, 0
- for left < n {
- if (right+1) < n && sum < s {
- right++
- sum += nums[right]
- } else {
+func minSubArrayLen(target int, nums []int) int {
+ left, sum, res := 0, 0, len(nums)+1
+ for right, v := range nums {
+ sum += v
+ for sum >= target {
+ res = min(res, right-left+1)
sum -= nums[left]
left++
}
- if sum >= s {
- res = min(res, right-left+1)
- }
}
- if res == n+1 {
+ if res == len(nums)+1 {
return 0
}
return res
diff --git a/leetcode/0211.Add-and-Search-Word---Data-structure-design/README.md b/leetcode/0211.Add-and-Search-Word---Data-structure-design/README.md
deleted file mode 100755
index 57f8c3358..000000000
--- a/leetcode/0211.Add-and-Search-Word---Data-structure-design/README.md
+++ /dev/null
@@ -1,34 +0,0 @@
-# [211. Add and Search Word - Data structure design](https://leetcode.com/problems/add-and-search-word-data-structure-design/)
-
-
-## 题目
-
-Design a data structure that supports the following two operations:
-
- void addWord(word)
- bool search(word)
-
-search(word) can search a literal word or a regular expression string containing only letters `a-z` or `.`. A `.` means it can represent any one letter.
-
-**Example:**
-
- addWord("bad")
- addWord("dad")
- addWord("mad")
- search("pad") -> false
- search("bad") -> true
- search(".ad") -> true
- search("b..") -> true
-
-**Note:**You may assume that all words are consist of lowercase letters `a-z`.
-
-## 题目大意
-
-设计一个支持以下两种操作的数据结构：`void addWord(word)`、`bool search(word)`。`search(word)` 可以搜索文字或正则表达式字符串，字符串只包含字母 . 或 a-z 。 "." 可以表示任何一个字母。
-
-
-
-## 解题思路
-
-- 设计一个 `WordDictionary` 的数据结构，要求具有 `addWord(word)` 和 `search(word)` 的操作，并且具有模糊查找的功能。
-- 这一题是第 208 题的加强版，在第 208 题经典的 Trie 上加上了模糊查找的功能。其他实现一模一样。
diff --git a/leetcode/0211.Add-and-Search-Word---Data-structure-design/211. Add and Search Word - Data structure design.go b/leetcode/0211.Design-Add-and-Search-Words-Data-Structure/211. Design Add and Search Words Data Structure.go
similarity index 100%
rename from leetcode/0211.Add-and-Search-Word---Data-structure-design/211. Add and Search Word - Data structure design.go
rename to leetcode/0211.Design-Add-and-Search-Words-Data-Structure/211. Design Add and Search Words Data Structure.go
diff --git a/leetcode/0211.Add-and-Search-Word---Data-structure-design/211. Add and Search Word - Data structure design_test.go b/leetcode/0211.Design-Add-and-Search-Words-Data-Structure/211. Design Add and Search Words Data Structure_test.go
similarity index 100%
rename from leetcode/0211.Add-and-Search-Word---Data-structure-design/211. Add and Search Word - Data structure design_test.go
rename to leetcode/0211.Design-Add-and-Search-Words-Data-Structure/211. Design Add and Search Words Data Structure_test.go
diff --git a/leetcode/0211.Design-Add-and-Search-Words-Data-Structure/README.md b/leetcode/0211.Design-Add-and-Search-Words-Data-Structure/README.md
new file mode 100755
index 000000000..cc646b06d
--- /dev/null
+++ b/leetcode/0211.Design-Add-and-Search-Words-Data-Structure/README.md
@@ -0,0 +1,34 @@
+# [211. Design Add and Search Words Data Structure](https://leetcode.com/problems/design-add-and-search-words-data-structure/)
+
+
+## 题目
+
+Design a data structure that supports the following two operations:
+
+ void addWord(word)
+ bool search(word)
+
+search(word) can search a literal word or a regular expression string containing only letters `a-z` or `.`. A `.` means it can represent any one letter.
+
+**Example:**
+
+ addWord("bad")
+ addWord("dad")
+ addWord("mad")
+ search("pad") -> false
+ search("bad") -> true
+ search(".ad") -> true
+ search("b..") -> true
+
+**Note:**You may assume that all words are consist of lowercase letters `a-z`.
+
+## 题目大意
+
+设计一个支持以下两种操作的数据结构：`void addWord(word)`、`bool search(word)`。`search(word)` 可以搜索文字或正则表达式字符串，字符串只包含字母 . 或 a-z 。 "." 可以表示任何一个字母。
+
+
+
+## 解题思路
+
+- 设计一个 `WordDictionary` 的数据结构，要求具有 `addWord(word)` 和 `search(word)` 的操作，并且具有模糊查找的功能。
+- 这一题是第 208 题的加强版，在第 208 题经典的 Trie 上加上了模糊查找的功能。其他实现一模一样。
diff --git a/leetcode/0215.Kth-Largest-Element-in-an-Array/215. Kth Largest Element in an Array.go b/leetcode/0215.Kth-Largest-Element-in-an-Array/215. Kth Largest Element in an Array.go
index 20a5672e2..c8e3a553b 100644
--- a/leetcode/0215.Kth-Largest-Element-in-an-Array/215. Kth Largest Element in an Array.go
+++ b/leetcode/0215.Kth-Largest-Element-in-an-Array/215. Kth Largest Element in an Array.go
@@ -1,6 +1,9 @@
package leetcode
-import "sort"
+import (
+ "math/rand"
+ "sort"
+)
// 解法一 排序，排序的方法反而速度是最快的
func findKthLargest1(nums []int, k int) int {
@@ -9,36 +12,62 @@ func findKthLargest1(nums []int, k int) int {
}
// 解法二 这个方法的理论依据是 partition 得到的点的下标就是最终排序之后的下标，根据这个下标，我们可以判断第 K 大的数在哪里
+// 时间复杂度 O(n)，空间复杂度 O(log n)，最坏时间复杂度为 O(n^2)，空间复杂度 O(n)
func findKthLargest(nums []int, k int) int {
- if len(nums) == 0 {
- return 0
- }
- return selection(nums, 0, len(nums)-1, len(nums)-k)
+ m := len(nums) - k + 1 // mth smallest, from 1..len(nums)
+ return selectSmallest(nums, 0, len(nums)-1, m)
}
-func selection(arr []int, l, r, k int) int {
- if l == r {
- return arr[l]
+func selectSmallest(nums []int, l, r, i int) int {
+ if l >= r {
+ return nums[l]
+ }
+ q := partition(nums, l, r)
+ k := q - l + 1
+ if k == i {
+ return nums[q]
}
- p := partition164(arr, l, r)
- if k == p {
- return arr[p]
- } else if k < p {
- return selection(arr, l, p-1, k)
+ if i < k {
+ return selectSmallest(nums, l, q-1, i)
} else {
- return selection(arr, p+1, r, k)
+ return selectSmallest(nums, q+1, r, i-k)
}
}
-func partition164(a []int, lo, hi int) int {
- pivot := a[hi]
- i := lo - 1
- for j := lo; j < hi; j++ {
- if a[j] < pivot {
+func partition(nums []int, l, r int) int {
+ k := l + rand.Intn(r-l+1) // 此处为优化，使得时间复杂度期望降为 O(n)，最坏时间复杂度为 O(n^2)
+ nums[k], nums[r] = nums[r], nums[k]
+ i := l - 1
+ // nums[l..i] <= nums[r]
+ // nums[i+1..j-1] > nums[r]
+ for j := l; j < r; j++ {
+ if nums[j] <= nums[r] {
i++
- a[j], a[i] = a[i], a[j]
+ nums[i], nums[j] = nums[j], nums[i]
}
}
- a[i+1], a[hi] = a[hi], a[i+1]
+ nums[i+1], nums[r] = nums[r], nums[i+1]
return i + 1
}
+
+// 扩展题 剑指 Offer 40. 最小的 k 个数
+func getLeastNumbers(arr []int, k int) []int {
+ return selectSmallest1(arr, 0, len(arr)-1, k)[:k]
+}
+
+// 和 selectSmallest 实现完全一致，只是返回值不用再截取了，直接返回 nums 即可
+func selectSmallest1(nums []int, l, r, i int) []int {
+ if l >= r {
+ return nums
+ }
+ q := partition(nums, l, r)
+ k := q - l + 1
+ if k == i {
+ return nums
+ }
+ if i < k {
+ return selectSmallest1(nums, l, q-1, i)
+ } else {
+ return selectSmallest1(nums, q+1, r, i-k)
+ }
+}
diff --git a/leetcode/0215.Kth-Largest-Element-in-an-Array/215. Kth Largest Element in an Array_test.go b/leetcode/0215.Kth-Largest-Element-in-an-Array/215. Kth Largest Element in an Array_test.go
index 0eef94c40..54a070a43 100644
--- a/leetcode/0215.Kth-Largest-Element-in-an-Array/215. Kth Largest Element in an Array_test.go
+++ b/leetcode/0215.Kth-Largest-Element-in-an-Array/215. Kth Largest Element in an Array_test.go
@@ -27,6 +27,11 @@ func Test_Problem215(t *testing.T) {
qs := []question215{
+ {
+ para215{[]int{3, 2, 1}, 2},
+ ans215{2},
+ },
+
{
para215{[]int{3, 2, 1, 5, 6, 4}, 2},
ans215{5},
diff --git a/leetcode/0215.Kth-Largest-Element-in-an-Array/README.md b/leetcode/0215.Kth-Largest-Element-in-an-Array/README.md
index 63506d275..b3a2d21f3 100644
--- a/leetcode/0215.Kth-Largest-Element-in-an-Array/README.md
+++ b/leetcode/0215.Kth-Largest-Element-in-an-Array/README.md
@@ -29,5 +29,5 @@ You may assume k is always valid, 1 ≤ k ≤ array's length.
## 解题思路
-在快排的 partition 操作中，每次 partition 操作结束都会返回一个点，这个标定点的下标和最终排序之后有序数组中这个元素所在的下标是一致的。利用这个特性，我们可以不断的划分数组区间，最终找到第 K 大的元素。执行一次 partition 操作以后，如果这个元素的下标比 K 小，那么接着就在后边的区间继续执行 partition 操作；如果这个元素的下标比 K 大，那么就在左边的区间继续执行 partition 操作；如果相等就直接输出这个下标对应的数组元素即可。
+在快速选择 quickselect 的 partition 操作中，每次 partition 操作结束都会返回一个点，这个标定点的下标和最终排序之后有序数组中这个元素所在的下标是一致的。利用这个特性，我们可以不断的划分数组区间，最终找到第 K 大的元素。执行一次 partition 操作以后，如果这个元素的下标比 K 小，那么接着就在后边的区间继续执行 partition 操作；如果这个元素的下标比 K 大，那么就在左边的区间继续执行 partition 操作；如果相等就直接输出这个下标对应的数组元素即可。
diff --git a/leetcode/0218.The-Skyline-Problem/218. The Skyline Problem.go b/leetcode/0218.The-Skyline-Problem/218. The Skyline Problem.go
index b93fa3544..ad13dc245 100644
--- a/leetcode/0218.The-Skyline-Problem/218. The Skyline Problem.go
+++ b/leetcode/0218.The-Skyline-Problem/218. The Skyline Problem.go
@@ -6,8 +6,83 @@ import (
"github.com/halfrost/LeetCode-Go/template"
)
-// 解法一 线段树 Segment Tree，时间复杂度 O(n log n)
+// 解法一 树状数组，时间复杂度 O(n log n)
+const LEFTSIDE = 1
+const RIGHTSIDE = 2
+
+type Point struct {
+ xAxis int
+ side int
+ index int
+}
+
func getSkyline(buildings [][]int) [][]int {
+ res := [][]int{}
+ if len(buildings) == 0 {
+ return res
+ }
+ allPoints, bit := make([]Point, 0), BinaryIndexedTree{}
+ // [x-axis (value), [1 (left) | 2 (right)], index (building number)]
+ for i, b := range buildings {
+ allPoints = append(allPoints, Point{xAxis: b[0], side: LEFTSIDE, index: i})
+ allPoints = append(allPoints, Point{xAxis: b[1], side: RIGHTSIDE, index: i})
+ }
+ sort.Slice(allPoints, func(i, j int) bool {
+ if allPoints[i].xAxis == allPoints[j].xAxis {
+ return allPoints[i].side < allPoints[j].side
+ }
+ return allPoints[i].xAxis < allPoints[j].xAxis
+ })
+ bit.Init(len(allPoints))
+ kth := make(map[Point]int)
+ for i := 0; i < len(allPoints); i++ {
+ kth[allPoints[i]] = i
+ }
+ for i := 0; i < len(allPoints); i++ {
+ pt := allPoints[i]
+ if pt.side == LEFTSIDE {
+ bit.Add(kth[Point{xAxis: buildings[pt.index][1], side: RIGHTSIDE, index: pt.index}], buildings[pt.index][2])
+ }
+ currHeight := bit.Query(kth[pt] + 1)
+ if len(res) == 0 || res[len(res)-1][1] != currHeight {
+ if len(res) > 0 && res[len(res)-1][0] == pt.xAxis {
+ res[len(res)-1][1] = currHeight
+ } else {
+ res = append(res, []int{pt.xAxis, currHeight})
+ }
+ }
+ }
+ return res
+}
+
+type BinaryIndexedTree struct {
+ tree []int
+ capacity int
+}
+
+// Init define
+func (bit *BinaryIndexedTree) Init(capacity int) {
+ bit.tree, bit.capacity = make([]int, capacity+1), capacity
+}
+
+// Add define
+func (bit *BinaryIndexedTree) Add(index int, val int) {
+ for ; index > 0; index -= index & -index {
+ bit.tree[index] = max(bit.tree[index], val)
+ }
+}
+
+// Query define
+func (bit *BinaryIndexedTree) Query(index int) int {
+ sum := 0
+ for ; index <= bit.capacity; index += index & -index {
+ sum = max(sum, bit.tree[index])
+ }
+ return sum
+}
+
+// 解法二 线段树 Segment Tree，时间复杂度 O(n log n)
+func getSkyline1(buildings [][]int) [][]int {
st, ans, lastHeight, check := template.SegmentTree{}, [][]int{}, 0, false
posMap, pos := discretization218(buildings)
tmp := make([]int, len(posMap))
@@ -54,8 +129,8 @@ func max(a int, b int) int {
return b
}
-// 解法二 扫描线 Sweep Line，时间复杂度 O(n log n)
-func getSkyline1(buildings [][]int) [][]int {
+// 解法三 扫描线 Sweep Line，时间复杂度 O(n log n)
+func getSkyline2(buildings [][]int) [][]int {
size := len(buildings)
es := make([]E, 0)
for i, b := range buildings {
diff --git a/leetcode/0218.The-Skyline-Problem/218. The Skyline Problem_test.go b/leetcode/0218.The-Skyline-Problem/218. The Skyline Problem_test.go
index 3c8612873..62e09dfab 100644
--- a/leetcode/0218.The-Skyline-Problem/218. The Skyline Problem_test.go
+++ b/leetcode/0218.The-Skyline-Problem/218. The Skyline Problem_test.go
@@ -30,6 +30,16 @@ func Test_Problem218(t *testing.T) {
para218{[][]int{{2, 9, 10}, {3, 7, 15}, {5, 12, 12}, {15, 20, 10}, {19, 24, 8}}},
ans218{[][]int{{2, 10}, {3, 15}, {7, 12}, {12, 0}, {15, 10}, {20, 8}, {24, 0}}},
},
+
+ {
+ para218{[][]int{{1, 2, 1}, {1, 2, 2}, {1, 2, 3}, {2, 3, 1}, {2, 3, 2}, {2, 3, 3}}},
+ ans218{[][]int{{1, 3}, {3, 0}}},
+ },
+
+ {
+ para218{[][]int{{4, 9, 10}, {4, 9, 15}, {4, 9, 12}, {10, 12, 10}, {10, 12, 8}}},
+ ans218{[][]int{{4, 15}, {9, 0}, {10, 10}, {12, 0}}},
+ },
}
fmt.Printf("------------------------Leetcode Problem 218------------------------\n")
diff --git a/leetcode/0220.Contains-Duplicate-III/220. Contains Duplicate III.go b/leetcode/0220.Contains-Duplicate-III/220. Contains Duplicate III.go
index 2ebd68125..3f635fafa 100644
--- a/leetcode/0220.Contains-Duplicate-III/220. Contains Duplicate III.go
+++ b/leetcode/0220.Contains-Duplicate-III/220. Contains Duplicate III.go
@@ -1,51 +1,38 @@
package leetcode
-import "sort"
-
-// 解法一 排序 + 滑动窗口
+// 解法一 桶排序
func containsNearbyAlmostDuplicate(nums []int, k int, t int) bool {
- if len(nums) < 2 {
+ if k <= 0 || t < 0 || len(nums) < 2 {
return false
}
- elemList := make([]*elem, len(nums))
- for i, num := range nums {
- elemList[i] = &elem{num, i}
- }
- sort.SliceStable(elemList, func(i, j int) bool {
- if elemList[i].val != elemList[j].val {
- return elemList[i].val < elemList[j].val
+ buckets := map[int]int{}
+ for i := 0; i < len(nums); i++ {
+ // Get the ID of the bucket from element value nums[i] and bucket width t + 1
+ key := nums[i] / (t + 1)
+ // -7/9 = 0, but need -7/9 = -1
+ if nums[i] < 0 {
+ key--
}
- return elemList[i].idx < elemList[j].idx
- })
- i, j := 0, 1
- for j < len(elemList) {
- if elemList[j].val-elemList[i].val <= t {
- if abs(elemList[j].idx-elemList[i].idx) <= k {
- return true
- }
- j++
- } else {
- i++
- if j <= i {
- j++
- }
+ if _, ok := buckets[key]; ok {
+ return true
+ }
+ // check the lower bucket, and have to check the value too
+ if v, ok := buckets[key-1]; ok && nums[i]-v <= t {
+ return true
}
+ // check the upper bucket, and have to check the value too
+ if v, ok := buckets[key+1]; ok && v-nums[i] <= t {
+ return true
+ }
+ // maintain k size of window
+ if len(buckets) >= k {
+ delete(buckets, nums[i-k]/(t+1))
+ }
+ buckets[key] = nums[i]
}
return false
}
-func abs(a int) int {
- if a > 0 {
- return a
- }
- return -a
-}
-
-type elem struct {
- val int
- idx int
-}
-
// 解法二 滑动窗口 + 剪枝
func containsNearbyAlmostDuplicate1(nums []int, k int, t int) bool {
if len(nums) <= 1 {
@@ -66,3 +53,10 @@ func containsNearbyAlmostDuplicate1(nums []int, k int, t int) bool {
}
return false
}
+
+func abs(a int) int {
+ if a > 0 {
+ return a
+ }
+ return -a
+}
diff --git a/leetcode/0220.Contains-Duplicate-III/220. Contains Duplicate III_test.go b/leetcode/0220.Contains-Duplicate-III/220. Contains Duplicate III_test.go
index c5ef79066..3f0aedd0a 100644
--- a/leetcode/0220.Contains-Duplicate-III/220. Contains Duplicate III_test.go
+++ b/leetcode/0220.Contains-Duplicate-III/220. Contains Duplicate III_test.go
@@ -52,6 +52,11 @@ func Test_Problem220(t *testing.T) {
para220{[]int{1, 5, 9, 1, 5, 9}, 2, 3},
ans220{false},
},
+
+ {
+ para220{[]int{1, 2, 1, 1}, 1, 0},
+ ans220{true},
+ },
}
fmt.Printf("------------------------Leetcode Problem 220------------------------\n")
diff --git a/leetcode/0220.Contains-Duplicate-III/README.md b/leetcode/0220.Contains-Duplicate-III/README.md
index 4087683e6..591330e91 100644
--- a/leetcode/0220.Contains-Duplicate-III/README.md
+++ b/leetcode/0220.Contains-Duplicate-III/README.md
@@ -32,3 +32,4 @@ Given an array of integers, find out whether there are two distinct indices i
- 给出一个数组，要求在数组里面找到 2 个索引，`i` 和 `j`，使得 `| nums[i] - nums[j] | ≤ t` ，并且 `| i - j | ≤ k` 。
- 这是一道滑动窗口的题目。第一想法就是用 `i` 和 `j` 两个指针，针对每个 `i` ，都从 `i + 1` 往后扫完整个数组，判断每个 `i` 和 `j` ，判断是否满足题意。`j` 在循环的过程中注意判断剪枝条件 `| i - j | ≤ k`。这个做法的时间复杂度是 O(n^2)。这个做法慢的原因在于滑动窗口的左边界和右边界在滑动过程中不是联动滑动的。
- 于是考虑，如果数组是有序的呢？把数组按照元素值从小到大进行排序，如果元素值相等，就按照 index 从小到大进行排序。在这样有序的数组中找满足题意的 `i` 和 `j`，滑动窗口左边界和右边界就是联动的了。窗口的右边界滑到与左边界元素值的差值 ≤ t 的地方，满足了这个条件再判断 `| i - j | ≤ k`，如果右边界与左边界元素值的差值 > t 了，说明该把左边界往右移动了(能这样移动的原因就是因为我们将数组元素大小排序了，右移是增大元素的方向)。移动左边界的时候需要注意左边界不能超过右边界。这样滑动窗口一次滑过整个排序后的数组，就可以判断是否存在满足题意的 `i` 和 `j` 。这个做法的时间主要花在排序上了，时间复杂度是 O(n log n)。
+- 本题最优解是利用桶排序的思想。`| i - j | ≤ k` 这个条件利用一个窗口大小为 k 来维护。重点在 `| nums[i] - nums[j] | ≤ t` 这个条件如何满足。利用桶排序的思想，将 `nums[i]` 所有元素分为 ...,`[0,t]`,`[t+1,2t+1]`,...。每个区间的大小为 `t + 1`。每个元素现在都对应一个桶编号。进行 3 次查找即可确定能否找到满足这个 `| nums[i] - nums[j] | ≤ t` 条件的数对。如果在相同的桶中找到了元素，那么说明能找到这样的 i 和 j。还有 2 种可能对应桶边界的情况。如果存在前一个桶中的元素能使得相差的值也 `≤ t`，这样的数对同样满足题意。最后一种情况是，如果存在后一个桶中的元素能使得相差的值也 `≤ t`，这样的数对同样满足题意。查询 3 次，如果都不存在，说明当前的 i 找不到满足题意的 j。继续循环寻找。循环一遍都找不到满足题意的数对，输出 false。
\ No newline at end of file
diff --git a/leetcode/0226.Invert-Binary-Tree/226. Invert Binary Tree_test.go b/leetcode/0226.Invert-Binary-Tree/226. Invert Binary Tree_test.go
index 9fde95dde..fecd35364 100644
--- a/leetcode/0226.Invert-Binary-Tree/226. Invert Binary Tree_test.go
+++ b/leetcode/0226.Invert-Binary-Tree/226. Invert Binary Tree_test.go
@@ -50,7 +50,7 @@ func Test_Problem226(t *testing.T) {
_, p := q.ans226, q.para226
fmt.Printf("【input】:%v ", p)
root := structures.Ints2TreeNode(p.one)
- fmt.Printf("【output】:%v \n", structures.Tree2Preorder(invertTree(root)))
+ fmt.Printf("【output】:%v \n", structures.Tree2ints(invertTree(root)))
}
fmt.Printf("\n\n\n")
}
diff --git a/leetcode/0227.Basic-Calculator-II/227. Basic Calculator II.go b/leetcode/0227.Basic-Calculator-II/227. Basic Calculator II.go
new file mode 100644
index 000000000..a20168b9d
--- /dev/null
+++ b/leetcode/0227.Basic-Calculator-II/227. Basic Calculator II.go
@@ -0,0 +1,29 @@
+package leetcode
+
+func calculate(s string) int {
+ stack, preSign, num, res := []int{}, '+', 0, 0
+ for i, ch := range s {
+ isDigit := '0' <= ch && ch <= '9'
+ if isDigit {
+ num = num*10 + int(ch-'0')
+ }
+ if !isDigit && ch != ' ' || i == len(s)-1 {
+ switch preSign {
+ case '+':
+ stack = append(stack, num)
+ case '-':
+ stack = append(stack, -num)
+ case '*':
+ stack[len(stack)-1] *= num
+ default:
+ stack[len(stack)-1] /= num
+ }
+ preSign = ch
+ num = 0
+ }
+ }
+ for _, v := range stack {
+ res += v
+ }
+ return res
+}
diff --git a/leetcode/0227.Basic-Calculator-II/227. Basic Calculator II_test.go b/leetcode/0227.Basic-Calculator-II/227. Basic Calculator II_test.go
new file mode 100644
index 000000000..131d97baf
--- /dev/null
+++ b/leetcode/0227.Basic-Calculator-II/227. Basic Calculator II_test.go
@@ -0,0 +1,66 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question227 struct {
+ para227
+ ans227
+}
+
+// para 是参数
+// one 代表第一个参数
+type para227 struct {
+ one string
+}
+
+// ans 是答案
+// one 代表第一个答案
+type ans227 struct {
+ one int
+}
+
+func Test_Problem227(t *testing.T) {
+
+ qs := []question227{
+
+ {
+ para227{"3+2*2"},
+ ans227{7},
+ },
+
+ {
+ para227{"3/2"},
+ ans227{1},
+ },
+
+ {
+ para227{" 3+5 / 2 "},
+ ans227{5},
+ },
+
+ {
+ para227{"1 + 1"},
+ ans227{2},
+ },
+ {
+ para227{" 2-1 + 2 "},
+ ans227{3},
+ },
+
+ {
+ para227{"2-5/6"},
+ ans227{2},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 227------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans227, q.para227
+ fmt.Printf("【input】:%v 【output】:%v\n", p, calculate(p.one))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/0227.Basic-Calculator-II/README.md b/leetcode/0227.Basic-Calculator-II/README.md
new file mode 100644
index 000000000..470a58af5
--- /dev/null
+++ b/leetcode/0227.Basic-Calculator-II/README.md
@@ -0,0 +1,80 @@
+# [227. Basic Calculator II](https://leetcode.com/problems/basic-calculator-ii/)
+
+
+## 题目
+
+Given a string `s` which represents an expression, *evaluate this expression and return its value*.
+
+The integer division should truncate toward zero.
+
+**Example 1:**
+
+```
+Input: s = "3+2*2"
+Output: 7
+```
+
+**Example 2:**
+
+```
+Input: s = " 3/2 "
+Output: 1
+```
+
+**Example 3:**
+
+```
+Input: s = " 3+5 / 2 "
+Output: 5
+```
+
+**Constraints:**
+
+- `1 <= s.length <= 3 * 10^5`
+- `s` consists of integers and operators `('+', '-', '*', '/')` separated by some number of spaces.
+- `s` represents **a valid expression**.
+- All the integers in the expression are non-negative integers in the range `[0, 2^31 - 1]`.
+- The answer is **guaranteed** to fit in a **32-bit integer**.
+
+## 题目大意
+
+给你一个字符串表达式 `s` ，请你实现一个基本计算器来计算并返回它的值。整数除法仅保留整数部分。
+
+## 解题思路
+
+- 这道题是第 224 题的加强版。第 224 题中只有加减运算和括号，这一题增加了乘除运算。由于乘除运算的优先级高于加减。所以先计算乘除运算，将算出来的结果再替换回原来的算式中。最后只剩下加减运算，于是题目降级成了第 224 题。
+- 把加减运算符号后面的数字压入栈中，遇到乘除运算，直接将它与栈顶的元素计算，并将计算后的结果放入栈顶。若读到一个运算符，或者遍历到字符串末尾，即认为是遍历到了数字末尾。处理完该数字后，更新 `preSign` 为当前遍历的字符。遍历完字符串 `s` 后，将栈中元素累加，即为该字符串表达式的值。时间复杂度 O(n)，空间复杂度 O(n)。
+
+## 代码
+
+```go
+package leetcode
+
+func calculate(s string) int {
+ stack, preSign, num, res := []int{}, '+', 0, 0
+ for i, ch := range s {
+ isDigit := '0' <= ch && ch <= '9'
+ if isDigit {
+ num = num*10 + int(ch-'0')
+ }
+ if !isDigit && ch != ' ' || i == len(s)-1 {
+ switch preSign {
+ case '+':
+ stack = append(stack, num)
+ case '-':
+ stack = append(stack, -num)
+ case '*':
+ stack[len(stack)-1] *= num
+ default:
+ stack[len(stack)-1] /= num
+ }
+ preSign = ch
+ num = 0
+ }
+ }
+ for _, v := range stack {
+ res += v
+ }
+ return res
+}
+```
\ No newline at end of file
diff --git a/leetcode/0228.Summary-Ranges/228. Summary Ranges.go b/leetcode/0228.Summary-Ranges/228. Summary Ranges.go
new file mode 100644
index 000000000..b19c0e862
--- /dev/null
+++ b/leetcode/0228.Summary-Ranges/228. Summary Ranges.go
@@ -0,0 +1,19 @@
+package leetcode
+
+import (
+ "strconv"
+)
+
+func summaryRanges(nums []int) (ans []string) {
+ for i, n := 0, len(nums); i < n; {
+ left := i
+ for i++; i < n && nums[i-1]+1 == nums[i]; i++ {
+ }
+ s := strconv.Itoa(nums[left])
+ if left != i-1 {
+ s += "->" + strconv.Itoa(nums[i-1])
+ }
+ ans = append(ans, s)
+ }
+ return
+}
diff --git a/leetcode/0228.Summary-Ranges/228. Summary Ranges_test.go b/leetcode/0228.Summary-Ranges/228. Summary Ranges_test.go
new file mode 100644
index 000000000..dd18d007e
--- /dev/null
+++ b/leetcode/0228.Summary-Ranges/228. Summary Ranges_test.go
@@ -0,0 +1,62 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question228 struct {
+ para228
+ ans228
+}
+
+// para 是参数
+// one 代表第一个参数
+type para228 struct {
+ nums []int
+}
+
+// ans 是答案
+// one 代表第一个答案
+type ans228 struct {
+ ans []string
+}
+
+func Test_Problem228(t *testing.T) {
+
+ qs := []question228{
+
+ {
+ para228{[]int{0, 1, 2, 4, 5, 7}},
+ ans228{[]string{"0->2", "4->5", "7"}},
+ },
+
+ {
+ para228{[]int{0, 2, 3, 4, 6, 8, 9}},
+ ans228{[]string{"0", "2->4", "6", "8->9"}},
+ },
+
+ {
+ para228{[]int{}},
+ ans228{[]string{}},
+ },
+
+ {
+ para228{[]int{-1}},
+ ans228{[]string{"-1"}},
+ },
+
+ {
+ para228{[]int{0}},
+ ans228{[]string{"0"}},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 228------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans228, q.para228
+ fmt.Printf("【input】:%v 【output】:%v\n", p, summaryRanges(p.nums))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/0228.Summary-Ranges/README.md b/leetcode/0228.Summary-Ranges/README.md
new file mode 100644
index 000000000..85530b5aa
--- /dev/null
+++ b/leetcode/0228.Summary-Ranges/README.md
@@ -0,0 +1,107 @@
+# [228. Summary Ranges](https://leetcode.com/problems/summary-ranges/)
+
+## 题目
+
+You are given a **sorted unique** integer array `nums`.
+
+Return *the **smallest sorted** list of ranges that **cover all the numbers in the array exactly***. That is, each element of `nums` is covered by exactly one of the ranges, and there is no integer `x` such that `x` is in one of the ranges but not in `nums`.
+
+Each range `[a,b]` in the list should be output as:
+
+- `"a->b"` if `a != b`
+- `"a"` if `a == b`
+
+**Example 1:**
+
+```
+Input: nums = [0,1,2,4,5,7]
+Output: ["0->2","4->5","7"]
+Explanation: The ranges are:
+[0,2] --> "0->2"
+[4,5] --> "4->5"
+[7,7] --> "7"
+
+```
+
+**Example 2:**
+
+```
+Input: nums = [0,2,3,4,6,8,9]
+Output: ["0","2->4","6","8->9"]
+Explanation: The ranges are:
+[0,0] --> "0"
+[2,4] --> "2->4"
+[6,6] --> "6"
+[8,9] --> "8->9"
+
+```
+
+**Example 3:**
+
+```
+Input: nums = []
+Output: []
+
+```
+
+**Example 4:**
+
+```
+Input: nums = [-1]
+Output: ["-1"]
+
+```
+
+**Example 5:**
+
+```
+Input: nums = [0]
+Output: ["0"]
+
+```
+
+**Constraints:**
+
+- `0 <= nums.length <= 20`
+- `231 <= nums[i] <= 231 - 1`
+- All the values of `nums` are **unique**.
+- `nums` is sorted in ascending order.
+
+## 题目大意
+
+给定一个无重复元素的有序整数数组 nums 。
+
+返回 恰好覆盖数组中所有数字 的 最小有序 区间范围列表。也就是说，nums 的每个元素都恰好被某个区间范围所覆盖，并且不存在属于某个范围但不属于 nums 的数字 x 。
+
+列表中的每个区间范围 [a,b] 应该按如下格式输出：
+
+- "a->b" ，如果 a != b
+- "a" ，如果 a == b
+
+## 解题思路
+
+- 简单题。按照题意，用一个游标变量累加寻找连续的区间。一旦出现了中断，就按照题意格式输出。输出的规则有多种，带箭头的区间，单个元素区间，空区间。
+
+## 代码
+
+```go
+package leetcode
+
+import (
+ "strconv"
+)
+
+func summaryRanges(nums []int) (ans []string) {
+ for i, n := 0, len(nums); i < n; {
+ left := i
+ for i++; i < n && nums[i-1]+1 == nums[i]; i++ {
+ }
+ s := strconv.Itoa(nums[left])
+ if left != i-1 {
+ s += "->" + strconv.Itoa(nums[i-1])
+ }
+ ans = append(ans, s)
+ }
+ return
+}
+```
\ No newline at end of file
diff --git a/leetcode/0234.Palindrome-Linked-List/234. Palindrome Linked List.go b/leetcode/0234.Palindrome-Linked-List/234. Palindrome Linked List.go
index 12cf5e1f9..4a7f05c66 100644
--- a/leetcode/0234.Palindrome-Linked-List/234. Palindrome Linked List.go
+++ b/leetcode/0234.Palindrome-Linked-List/234. Palindrome Linked List.go
@@ -15,8 +15,26 @@ type ListNode = structures.ListNode
* }
*/
+// 解法一
+func isPalindrome(head *ListNode) bool {
+ slice := []int{}
+ for head != nil {
+ slice = append(slice, head.Val)
+ head = head.Next
+ }
+ for i, j := 0, len(slice)-1; i < j; {
+ if slice[i] != slice[j] {
+ return false
+ }
+ i++
+ j--
+ }
+ return true
+}
+
+// 解法二
// 此题和 143 题 Reorder List 思路基本一致
-func isPalindrome234(head *ListNode) bool {
+func isPalindrome1(head *ListNode) bool {
if head == nil || head.Next == nil {
return true
}
@@ -28,7 +46,6 @@ func isPalindrome234(head *ListNode) bool {
p1 = p1.Next
p2 = p2.Next.Next
}
-
// 反转链表后半部分 1->2->3->4->5->6 to 1->2->3->6->5->4
preMiddle := p1
preCurrent := p1.Next
@@ -38,7 +55,6 @@ func isPalindrome234(head *ListNode) bool {
current.Next = preMiddle.Next
preMiddle.Next = current
}
-
// 扫描表，判断是否是回文
p1 = head
p2 = preMiddle.Next
@@ -59,18 +75,15 @@ func isPalindrome234(head *ListNode) bool {
return false
}
}
-
return res
}
// L2ss define
func L2ss(head *ListNode) []int {
res := []int{}
-
for head != nil {
res = append(res, head.Val)
head = head.Next
}
-
return res
}
diff --git a/leetcode/0234.Palindrome-Linked-List/234. Palindrome Linked List_test.go b/leetcode/0234.Palindrome-Linked-List/234. Palindrome Linked List_test.go
index 8fd7a31a1..57cdb5dc5 100644
--- a/leetcode/0234.Palindrome-Linked-List/234. Palindrome Linked List_test.go
+++ b/leetcode/0234.Palindrome-Linked-List/234. Palindrome Linked List_test.go
@@ -83,7 +83,7 @@ func Test_Problem234(t *testing.T) {
for _, q := range qs {
_, p := q.ans234, q.para234
- fmt.Printf("【input】:%v 【output】:%v\n", p, isPalindrome234(structures.Ints2List(p.one)))
+ fmt.Printf("【input】:%v 【output】:%v\n", p, isPalindrome(structures.Ints2List(p.one)))
}
fmt.Printf("\n\n\n")
}
diff --git a/leetcode/0237.Delete-Node-in-a-Linked-List/237. Delete Node in a Linked List.go b/leetcode/0237.Delete-Node-in-a-Linked-List/237. Delete Node in a Linked List.go
index 78186ba93..bb33b98ad 100644
--- a/leetcode/0237.Delete-Node-in-a-Linked-List/237. Delete Node in a Linked List.go
+++ b/leetcode/0237.Delete-Node-in-a-Linked-List/237. Delete Node in a Linked List.go
@@ -15,14 +15,6 @@ type ListNode = structures.ListNode
* }
*/
func deleteNode(node *ListNode) {
- if node == nil {
- return
- }
- cur := node
- for cur.Next.Next != nil {
- cur.Val = cur.Next.Val
- cur = cur.Next
- }
- cur.Val = cur.Next.Val
- cur.Next = nil
+ node.Val = node.Next.Val
+ node.Next = node.Next.Next
}
diff --git a/leetcode/0237.Delete-Node-in-a-Linked-List/README.md b/leetcode/0237.Delete-Node-in-a-Linked-List/README.md
index 7c6e4954a..fa135fa7d 100644
--- a/leetcode/0237.Delete-Node-in-a-Linked-List/README.md
+++ b/leetcode/0237.Delete-Node-in-a-Linked-List/README.md
@@ -1,35 +1,64 @@
# [237. Delete Node in a Linked List](https://leetcode.com/problems/delete-node-in-a-linked-list/)
+
## 题目
-Write a function to delete a node (except the tail) in a singly linked list, given only access to that node.
+Write a function to **delete a node** in a singly-linked list. You will **not** be given access to the `head` of the list, instead you will be given access to **the node to be deleted** directly.
-Given linked list -- head = [4,5,1,9], which looks like following:
+It is **guaranteed** that the node to be deleted is **not a tail node** in the list.
-
+**Example 1:**
-Example 1:
+
-```c
+```
Input: head = [4,5,1,9], node = 5
Output: [4,1,9]
-Explanation: You are given the second node with value 5, the linked list should become 4 -> 1 -> 9 after calling your function.
+Explanation:You are given the second node with value 5, the linked list should become 4 -> 1 -> 9 after calling your function.
+
```
-Example 2:
+**Example 2:**
+
+
-```c
+```
Input: head = [4,5,1,9], node = 1
Output: [4,5,9]
-Explanation: You are given the third node with value 1, the linked list should become 4 -> 5 -> 9 after calling your function.
+Explanation:You are given the third node with value 1, the linked list should become 4 -> 5 -> 9 after calling your function.
+
+```
+
+**Example 3:**
+
+```
+Input: head = [1,2,3,4], node = 3
+Output: [1,2,4]
+
+```
+
+**Example 4:**
+
+```
+Input: head = [0,1], node = 0
+Output: [1]
+
```
-Note:
+**Example 5:**
+
+```
+Input: head = [-3,5,-99], node = -3
+Output: [5,-99]
+
+```
-- The linked list will have at least two elements.
-- All of the nodes' values will be unique.
-- The given node will not be the tail and it will always be a valid node of the linked list.
-- Do not return anything from your function.
+**Constraints:**
+
+- The number of the nodes in the given list is in the range `[2, 1000]`.
+- `1000 <= Node.val <= 1000`
+- The value of each node in the list is **unique**.
+- The `node` to be deleted is **in the list** and is **not a tail** node
## 题目大意
@@ -37,4 +66,29 @@ Note:
## 解题思路
-其实就是把后面的结点都覆盖上来即可。或者直接当前结点的值等于下一个结点，Next 指针指向下下个结点，这样做也可以，只不过中间有一个结点不被释放，内存消耗多一些。
\ No newline at end of file
+其实就是把后面的结点都覆盖上来即可。或者直接当前结点的值等于下一个结点，Next 指针指向下下个结点，这样做也可以，只不过中间有一个结点不被释放，内存消耗多一些。
+
+## 代码
+
+```go
+package leetcode
+
+import (
+ "github.com/halfrost/LeetCode-Go/structures"
+)
+
+// ListNode define
+type ListNode = structures.ListNode
+
+/**
+ * Definition for singly-linked list.
+ * type ListNode struct {
+ * Val int
+ * Next *ListNode
+ * }
+ */
+func deleteNode(node *ListNode) {
+ node.Val = node.Next.Val
+ node.Next = node.Next.Next
+}
+```
\ No newline at end of file
diff --git a/leetcode/0242.Valid-Anagram/242. Valid Anagram.go b/leetcode/0242.Valid-Anagram/242. Valid Anagram.go
index 81920dd7f..ae3a7287c 100644
--- a/leetcode/0242.Valid-Anagram/242. Valid Anagram.go
+++ b/leetcode/0242.Valid-Anagram/242. Valid Anagram.go
@@ -24,44 +24,17 @@ func isAnagram(s string, t string) bool {
// 解法二
func isAnagram1(s string, t string) bool {
- if s == "" && t == "" {
- return true
+ hash := map[rune]int{}
+ for _, value := range s {
+ hash[value]++
}
- if s == "" || t == "" {
- return false
+ for _, value := range t {
+ hash[value]--
}
- sBytes := []byte(s)
- tBytes := []byte(t)
- if len(sBytes) != len(tBytes) {
- return false
- }
- quickSortByte(sBytes, 0, len(sBytes)-1)
- quickSortByte(tBytes, 0, len(tBytes)-1)
-
- for i := 0; i < len(sBytes); i++ {
- if sBytes[i] != tBytes[i] {
+ for _, value := range hash {
+ if value != 0 {
return false
}
}
return true
}
-func partitionByte(a []byte, lo, hi int) int {
- pivot := a[hi]
- i := lo - 1
- for j := lo; j < hi; j++ {
- if a[j] > pivot {
- i++
- a[j], a[i] = a[i], a[j]
- }
- }
- a[i+1], a[hi] = a[hi], a[i+1]
- return i + 1
-}
-func quickSortByte(a []byte, lo, hi int) {
- if lo >= hi {
- return
- }
- p := partitionByte(a, lo, hi)
- quickSortByte(a, lo, p-1)
- quickSortByte(a, p+1, hi)
-}
diff --git a/leetcode/0242.Valid-Anagram/242. Valid Anagram_test.go b/leetcode/0242.Valid-Anagram/242. Valid Anagram_test.go
index 15a108ca0..8ece1c25a 100644
--- a/leetcode/0242.Valid-Anagram/242. Valid Anagram_test.go
+++ b/leetcode/0242.Valid-Anagram/242. Valid Anagram_test.go
@@ -45,6 +45,21 @@ func Test_Problem242(t *testing.T) {
para242{"rat", "car"},
ans242{false},
},
+
+ {
+ para242{"a", "ab"},
+ ans242{false},
+ },
+
+ {
+ para242{"ab", "a"},
+ ans242{false},
+ },
+
+ {
+ para242{"aa", "bb"},
+ ans242{false},
+ },
}
fmt.Printf("------------------------Leetcode Problem 242------------------------\n")
diff --git a/leetcode/0257.Binary-Tree-Paths/257. Binary Tree Paths.go b/leetcode/0257.Binary-Tree-Paths/257. Binary Tree Paths.go
index 4640cf7f6..0759ad1cc 100644
--- a/leetcode/0257.Binary-Tree-Paths/257. Binary Tree Paths.go
+++ b/leetcode/0257.Binary-Tree-Paths/257. Binary Tree Paths.go
@@ -2,9 +2,7 @@ package leetcode
import (
"strconv"
-)
-import (
"github.com/halfrost/LeetCode-Go/structures"
)
diff --git a/leetcode/0263.Ugly-Number/263. Ugly Number.go b/leetcode/0263.Ugly-Number/263. Ugly Number.go
index f155ab422..42e66c217 100644
--- a/leetcode/0263.Ugly-Number/263. Ugly Number.go
+++ b/leetcode/0263.Ugly-Number/263. Ugly Number.go
@@ -1,9 +1,11 @@
package leetcode
func isUgly(num int) bool {
- for i := 2; i < 6 && num > 0; i++ {
- for num%i == 0 {
- num /= i
+ if num > 0 {
+ for _, i := range []int{2, 3, 5} {
+ for num%i == 0 {
+ num /= i
+ }
}
}
return num == 1
diff --git a/leetcode/0264.Ugly-Number-II/264. Ugly Number II.go b/leetcode/0264.Ugly-Number-II/264. Ugly Number II.go
new file mode 100644
index 000000000..a34eb0b91
--- /dev/null
+++ b/leetcode/0264.Ugly-Number-II/264. Ugly Number II.go
@@ -0,0 +1,27 @@
+package leetcode
+
+func nthUglyNumber(n int) int {
+ dp, p2, p3, p5 := make([]int, n+1), 1, 1, 1
+ dp[0], dp[1] = 0, 1
+ for i := 2; i <= n; i++ {
+ x2, x3, x5 := dp[p2]*2, dp[p3]*3, dp[p5]*5
+ dp[i] = min(min(x2, x3), x5)
+ if dp[i] == x2 {
+ p2++
+ }
+ if dp[i] == x3 {
+ p3++
+ }
+ if dp[i] == x5 {
+ p5++
+ }
+ }
+ return dp[n]
+}
+
+func min(a, b int) int {
+ if a < b {
+ return a
+ }
+ return b
+}
diff --git a/leetcode/0264.Ugly-Number-II/264. Ugly Number II_test.go b/leetcode/0264.Ugly-Number-II/264. Ugly Number II_test.go
new file mode 100644
index 000000000..b5c732140
--- /dev/null
+++ b/leetcode/0264.Ugly-Number-II/264. Ugly Number II_test.go
@@ -0,0 +1,62 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question264 struct {
+ para264
+ ans264
+}
+
+// para 是参数
+// one 代表第一个参数
+type para264 struct {
+ one int
+}
+
+// ans 是答案
+// one 代表第一个答案
+type ans264 struct {
+ one int
+}
+
+func Test_Problem264(t *testing.T) {
+
+ qs := []question264{
+
+ {
+ para264{10},
+ ans264{12},
+ },
+
+ {
+ para264{1},
+ ans264{1},
+ },
+
+ {
+ para264{6},
+ ans264{6},
+ },
+
+ {
+ para264{8},
+ ans264{9},
+ },
+
+ {
+ para264{14},
+ ans264{20},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 264------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans264, q.para264
+ fmt.Printf("【input】:%v 【output】:%v\n", p, nthUglyNumber(p.one))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/0264.Ugly-Number-II/README.md b/leetcode/0264.Ugly-Number-II/README.md
new file mode 100644
index 000000000..431eadfa3
--- /dev/null
+++ b/leetcode/0264.Ugly-Number-II/README.md
@@ -0,0 +1,69 @@
+# [264. Ugly Number II](https://leetcode.com/problems/ugly-number-ii/)
+
+
+## 题目
+
+Given an integer `n`, return *the* `nth` ***ugly number***.
+
+**Ugly number** is a positive number whose prime factors only include `2`, `3`, and/or `5`.
+
+**Example 1:**
+
+```
+Input: n = 10
+Output: 12
+Explanation: [1, 2, 3, 4, 5, 6, 8, 9, 10, 12] is the sequence of the first 10 ugly numbers.
+```
+
+**Example 2:**
+
+```
+Input: n = 1
+Output: 1
+Explanation: 1 is typically treated as an ugly number.
+```
+
+**Constraints:**
+
+- `1 <= n <= 1690`
+
+## 题目大意
+
+给你一个整数 `n` ，请你找出并返回第 `n` 个 **丑数** 。**丑数** 就是只包含质因数 `2`、`3` 和/或 `5` 的正整数。
+
+## 解题思路
+
+- 解法一，生成丑数的方法：先用最小质因数 1，分别和 2，3，5 相乘，得到的数是丑数，不断的将这些数分别和 2，3，5 相乘，得到的数去重以后，从小到大排列，第 n 个数即为所求。排序可用最小堆实现，去重用 map 去重。时间复杂度 O(n log n)，空间复杂度 O(n)
+- 上面的解法耗时在排序中，需要排序的根源是小的丑数乘以 5 大于了大的丑数乘以 2 。如何保证每次乘积以后，找出有序的丑数，是去掉排序，提升时间复杂度的关键。举个例子很容易想通：初始状态丑数只有 {1}，乘以 2，3，5 以后，将最小的结果存入集合中 {1,2}。下一轮再相乘，由于上一轮 1 已经和 2 相乘过了，1 不要再和 2 相乘了，所以这一轮 1 和 3，5 相乘。2 和 2，3，5 相乘。将最小的结果存入集合中 {1,2,3}，按照这样的策略往下比较，每轮选出的丑数是有序且不重复的。具体实现利用 3 个指针和一个数组即可实现。时间复杂度 O(n)，空间复杂度 O(n)。
+
+## 代码
+
+```go
+package leetcode
+
+func nthUglyNumber(n int) int {
+ dp, p2, p3, p5 := make([]int, n+1), 1, 1, 1
+ dp[0], dp[1] = 0, 1
+ for i := 2; i <= n; i++ {
+ x2, x3, x5 := dp[p2]*2, dp[p3]*3, dp[p5]*5
+ dp[i] = min(min(x2, x3), x5)
+ if dp[i] == x2 {
+ p2++
+ }
+ if dp[i] == x3 {
+ p3++
+ }
+ if dp[i] == x5 {
+ p5++
+ }
+ }
+ return dp[n]
+}
+
+func min(a, b int) int {
+ if a < b {
+ return a
+ }
+ return b
+}
+```
\ No newline at end of file
diff --git a/leetcode/0278.First-Bad-Version/278. First Bad Version.go b/leetcode/0278.First-Bad-Version/278. First Bad Version.go
new file mode 100644
index 000000000..d4517c087
--- /dev/null
+++ b/leetcode/0278.First-Bad-Version/278. First Bad Version.go
@@ -0,0 +1,19 @@
+package leetcode
+
+import "sort"
+
+/**
+ * Forward declaration of isBadVersion API.
+ * @param version your guess about first bad version
+ * @return true if current version is bad
+ * false if current version is good
+ * func isBadVersion(version int) bool;
+ */
+
+func firstBadVersion(n int) int {
+ return sort.Search(n, func(version int) bool { return isBadVersion(version) })
+}
+
+func isBadVersion(version int) bool {
+ return true
+}
diff --git a/leetcode/0278.First-Bad-Version/278. First Bad Version_test.go b/leetcode/0278.First-Bad-Version/278. First Bad Version_test.go
new file mode 100644
index 000000000..5792af66c
--- /dev/null
+++ b/leetcode/0278.First-Bad-Version/278. First Bad Version_test.go
@@ -0,0 +1,46 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question278 struct {
+ para278
+ ans278
+}
+
+// para 是参数
+// one 代表第一个参数
+type para278 struct {
+ n int
+}
+
+// ans 是答案
+// one 代表第一个答案
+type ans278 struct {
+ one int
+}
+
+func Test_Problem278(t *testing.T) {
+
+ qs := []question278{
+
+ {
+ para278{5},
+ ans278{4},
+ },
+ {
+ para278{1},
+ ans278{1},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 278------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans278, q.para278
+ fmt.Printf("【input】:%v 【output】:%v\n", p, firstBadVersion(p.n))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/0278.First-Bad-Version/README.md b/leetcode/0278.First-Bad-Version/README.md
new file mode 100644
index 000000000..cb9bfe5ab
--- /dev/null
+++ b/leetcode/0278.First-Bad-Version/README.md
@@ -0,0 +1,62 @@
+# [278. First Bad Version](https://leetcode.com/problems/first-bad-version/)
+
+## 题目
+
+You are a product manager and currently leading a team to develop a new product. Unfortunately, the latest version of your product fails the quality check. Since each version is developed based on the previous version, all the versions after a bad version are also bad.
+
+Suppose you have `n` versions `[1, 2, ..., n]` and you want to find out the first bad one, which causes all the following ones to be bad.
+
+You are given an API `bool isBadVersion(version)` which returns whether `version` is bad. Implement a function to find the first bad version. You should minimize the number of calls to the API.
+
+**Example 1:**
+
+```
+Input: n = 5, bad = 4
+Output: 4
+Explanation:
+call isBadVersion(3) -> false
+call isBadVersion(5) -> true
+call isBadVersion(4) -> true
+Then 4 is the first bad version.
+
+```
+
+**Example 2:**
+
+```
+Input: n = 1, bad = 1
+Output: 1
+
+```
+
+**Constraints:**
+
+- `1 <= bad <= n <= 231 - 1`
+
+## 题目大意
+
+你是产品经理，目前正在带领一个团队开发新的产品。不幸的是，你的产品的最新版本没有通过质量检测。由于每个版本都是基于之前的版本开发的，所以错误的版本之后的所有版本都是错的。假设你有 n 个版本 [1, 2, ..., n]，你想找出导致之后所有版本出错的第一个错误的版本。你可以通过调用 bool isBadVersion(version) 接口来判断版本号 version 是否在单元测试中出错。实现一个函数来查找第一个错误的版本。你应该尽量减少对调用 API 的次数。
+
+## 解题思路
+
+- 我们知道开发产品迭代的版本，如果当一个版本为正确版本，则该版本之前的所有版本均为正确版本；当一个版本为错误版本，则该版本之后的所有版本均为错误版本。利用这个性质就可以进行二分查找。利用二分搜索，也可以满足减少对调用 API 的次数的要求。时间复杂度：O(logn)，其中 n 是给定版本的数量。空间复杂度：O(1)。
+
+## 代码
+
+```go
+package leetcode
+
+import "sort"
+
+/**
+ * Forward declaration of isBadVersion API.
+ * @param version your guess about first bad version
+ * @return true if current version is bad
+ * false if current version is good
+ * func isBadVersion(version int) bool;
+ */
+
+func firstBadVersion(n int) int {
+ return sort.Search(n, func(version int) bool { return isBadVersion(version) })
+}
+```
\ No newline at end of file
diff --git a/leetcode/0279.Perfect-Squares/279. Perfect Squares.go b/leetcode/0279.Perfect-Squares/279. Perfect Squares.go
new file mode 100644
index 000000000..99771598c
--- /dev/null
+++ b/leetcode/0279.Perfect-Squares/279. Perfect Squares.go
@@ -0,0 +1,33 @@
+package leetcode
+
+import "math"
+
+func numSquares(n int) int {
+ if isPerfectSquare(n) {
+ return 1
+ }
+ if checkAnswer4(n) {
+ return 4
+ }
+ for i := 1; i*i <= n; i++ {
+ j := n - i*i
+ if isPerfectSquare(j) {
+ return 2
+ }
+ }
+ return 3
+}
+
+// 判断是否为完全平方数
+func isPerfectSquare(n int) bool {
+ sq := int(math.Floor(math.Sqrt(float64(n))))
+ return sq*sq == n
+}
+
+// 判断是否能表示为 4^k*(8m+7)
+func checkAnswer4(x int) bool {
+ for x%4 == 0 {
+ x /= 4
+ }
+ return x%8 == 7
+}
diff --git a/leetcode/0279.Perfect-Squares/279. Perfect Squares_test.go b/leetcode/0279.Perfect-Squares/279. Perfect Squares_test.go
new file mode 100644
index 000000000..6c8a13ae1
--- /dev/null
+++ b/leetcode/0279.Perfect-Squares/279. Perfect Squares_test.go
@@ -0,0 +1,46 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question279 struct {
+ para279
+ ans279
+}
+
+// para 是参数
+// one 代表第一个参数
+type para279 struct {
+ n int
+}
+
+// ans 是答案
+// one 代表第一个答案
+type ans279 struct {
+ one int
+}
+
+func Test_Problem279(t *testing.T) {
+
+ qs := []question279{
+
+ {
+ para279{13},
+ ans279{2},
+ },
+ {
+ para279{12},
+ ans279{3},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 279------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans279, q.para279
+ fmt.Printf("【input】:%v 【output】:%v\n", p, numSquares(p.n))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/0279.Perfect-Squares/README.md b/leetcode/0279.Perfect-Squares/README.md
new file mode 100644
index 000000000..5e8e466df
--- /dev/null
+++ b/leetcode/0279.Perfect-Squares/README.md
@@ -0,0 +1,78 @@
+# [279. Perfect Squares](https://leetcode.com/problems/perfect-squares/)
+
+
+## 题目
+
+Given an integer `n`, return *the least number of perfect square numbers that sum to* `n`.
+
+A **perfect square** is an integer that is the square of an integer; in other words, it is the product of some integer with itself. For example, `1`, `4`, `9`, and `16` are perfect squares while `3` and `11` are not.
+
+**Example 1:**
+
+```
+Input: n = 12
+Output: 3
+Explanation: 12 = 4 + 4 + 4.
+```
+
+**Example 2:**
+
+```
+Input: n = 13
+Output: 2
+Explanation: 13 = 4 + 9.
+```
+
+**Constraints:**
+
+- `1 <= n <= 104`
+
+## 题目大意
+
+给定正整数 n，找到若干个完全平方数（比如 1, 4, 9, 16, ...）使得它们的和等于 n。你需要让组成和的完全平方数的个数最少。给你一个整数 n ，返回和为 n 的完全平方数的 最少数量 。
+
+完全平方数 是一个整数，其值等于另一个整数的平方；换句话说，其值等于一个整数自乘的积。例如，1、4、9 和 16 都是完全平方数，而 3 和 11 不是。
+
+## 解题思路
+
+- 由拉格朗日的四平方定理可得，每个自然数都可以表示为四个整数平方之和。 其中四个数字是整数。四平方和定理证明了任意一个正整数都可以被表示为至多四个正整数的平方和。这给出了本题的答案的上界。
+- 四平方和定理可以推出三平方和推论：当且仅当 {{< katex >}} n \neq 4^{k} \times (8*m + 7){{< /katex >}} 时，n 可以被表示为至多三个正整数的平方和。所以当 {{< katex >}} n = 4^{k} * (8*m + 7){{< /katex >}} 时，n 只能被表示为四个正整数的平方和。此时我们可以直接返回 4。
+- 当 {{< katex >}} n \neq 4^{k} \times (8*m + 7){{< /katex >}} 时，需要判断 n 到底可以分解成几个完全平方数之和。答案肯定是 1，2，3 中的一个。题目要求我们求最小的，所以从 1 开始一个个判断是否满足。如果答案为 1，代表 n 为完全平方数，这很好判断。如果答案为 2，代表 {{< katex >}} n = a^{2} + b^{2} {{< /katex >}}，枚举 {{< katex >}} 1 \leqslant a \leqslant \sqrt{n} {{< /katex >}}，判断 {{< katex >}} n - a^{2} {{< /katex >}} 是否为完全平方数。当 1 和 2 都排除了，剩下的答案只能为 3 了。
+
+## 代码
+
+```go
+package leetcode
+
+import "math"
+
+func numSquares(n int) int {
+ if isPerfectSquare(n) {
+ return 1
+ }
+ if checkAnswer4(n) {
+ return 4
+ }
+ for i := 1; i*i <= n; i++ {
+ j := n - i*i
+ if isPerfectSquare(j) {
+ return 2
+ }
+ }
+ return 3
+}
+
+// 判断是否为完全平方数
+func isPerfectSquare(n int) bool {
+ sq := int(math.Floor(math.Sqrt(float64(n))))
+ return sq*sq == n
+}
+
+// 判断是否能表示为 4^k*(8m+7)
+func checkAnswer4(x int) bool {
+ for x%4 == 0 {
+ x /= 4
+ }
+ return x%8 == 7
+}
+```
\ No newline at end of file
diff --git a/leetcode/0284.Peeking-Iterator/284. Peeking Iterator.go b/leetcode/0284.Peeking-Iterator/284. Peeking Iterator.go
new file mode 100644
index 000000000..4b5b578be
--- /dev/null
+++ b/leetcode/0284.Peeking-Iterator/284. Peeking Iterator.go
@@ -0,0 +1,53 @@
+package leetcode
+
+//Below is the interface for Iterator, which is already defined for you.
+
+type Iterator struct {
+}
+
+func (this *Iterator) hasNext() bool {
+ // Returns true if the iteration has more elements.
+ return true
+}
+
+func (this *Iterator) next() int {
+ // Returns the next element in the iteration.
+ return 0
+}
+
+type PeekingIterator struct {
+ nextEl int
+ hasEl bool
+ iter *Iterator
+}
+
+func Constructor(iter *Iterator) *PeekingIterator {
+ return &PeekingIterator{
+ iter: iter,
+ }
+}
+
+func (this *PeekingIterator) hasNext() bool {
+ if this.hasEl {
+ return true
+ }
+ return this.iter.hasNext()
+}
+
+func (this *PeekingIterator) next() int {
+ if this.hasEl {
+ this.hasEl = false
+ return this.nextEl
+ } else {
+ return this.iter.next()
+ }
+}
+
+func (this *PeekingIterator) peek() int {
+ if this.hasEl {
+ return this.nextEl
+ }
+ this.hasEl = true
+ this.nextEl = this.iter.next()
+ return this.nextEl
+}
diff --git a/leetcode/0284.Peeking-Iterator/284. Peeking Iterator_test.go b/leetcode/0284.Peeking-Iterator/284. Peeking Iterator_test.go
new file mode 100644
index 000000000..5d0d958fd
--- /dev/null
+++ b/leetcode/0284.Peeking-Iterator/284. Peeking Iterator_test.go
@@ -0,0 +1,9 @@
+package leetcode
+
+import (
+ "testing"
+)
+
+func Test_Problem284(t *testing.T) {
+
+}
diff --git a/leetcode/0284.Peeking-Iterator/README.md b/leetcode/0284.Peeking-Iterator/README.md
new file mode 100644
index 000000000..f2562d3fa
--- /dev/null
+++ b/leetcode/0284.Peeking-Iterator/README.md
@@ -0,0 +1,87 @@
+# [284. Peeking Iterator](https://leetcode.com/problems/peeking-iterator/)
+
+## 题目
+
+Given an Iterator class interface with methods: `next()` and `hasNext()`, design and implement a PeekingIterator that support the `peek()` operation -- it essentially peek() at the element that will be returned by the next call to next().
+
+**Example:**
+
+```
+Assume that the iterator is initialized to the beginning of the list: [1,2,3].
+
+Call next() gets you 1, the first element in the list.
+Now you call peek() and it returns 2, the next element. Calling next() after that still return 2.
+You call next() the final time and it returns 3, the last element.
+Calling hasNext() after that should return false.
+```
+
+**Follow up**: How would you extend your design to be generic and work with all types, not just integer?
+
+## 题目大意
+
+给定一个迭代器类的接口，接口包含两个方法： next() 和 hasNext()。设计并实现一个支持 peek() 操作的顶端迭代器 -- 其本质就是把原本应由 next() 方法返回的元素 peek() 出来。
+
+> peek() 是偷看的意思。偷偷看一看下一个元素是什么，但是并不是 next() 访问。
+
+## 解题思路
+
+- 简单题。在 PeekingIterator 内部保存 2 个变量，一个是下一个元素值，另一个是是否有下一个元素。在 next() 操作和 hasNext() 操作时，访问保存的这 2 个变量。peek() 操作也比较简单，判断是否有下一个元素，如果有，即返回该元素值。这里实现了迭代指针不移动的功能。如果没有保存下一个元素值，即没有 peek() 偷看，next() 操作继续往后移动指针，读取后一位元素。
+- 这里复用了是否有下一个元素值，来判断 hasNext() 和 peek() 操作中不移动指针的逻辑。
+
+## 代码
+
+```go
+package leetcode
+
+//Below is the interface for Iterator, which is already defined for you.
+
+type Iterator struct {
+}
+
+func (this *Iterator) hasNext() bool {
+ // Returns true if the iteration has more elements.
+ return true
+}
+
+func (this *Iterator) next() int {
+ // Returns the next element in the iteration.
+ return 0
+}
+
+type PeekingIterator struct {
+ nextEl int
+ hasEl bool
+ iter *Iterator
+}
+
+func Constructor(iter *Iterator) *PeekingIterator {
+ return &PeekingIterator{
+ iter: iter,
+ }
+}
+
+func (this *PeekingIterator) hasNext() bool {
+ if this.hasEl {
+ return true
+ }
+ return this.iter.hasNext()
+}
+
+func (this *PeekingIterator) next() int {
+ if this.hasEl {
+ this.hasEl = false
+ return this.nextEl
+ } else {
+ return this.iter.next()
+ }
+}
+
+func (this *PeekingIterator) peek() int {
+ if this.hasEl {
+ return this.nextEl
+ }
+ this.hasEl = true
+ this.nextEl = this.iter.next()
+ return this.nextEl
+}
+```
\ No newline at end of file
diff --git a/leetcode/0297.Serialize-and-Deserialize-Binary-Tree/297.Serialize and Deserialize Binary Tree.go b/leetcode/0297.Serialize-and-Deserialize-Binary-Tree/297.Serialize and Deserialize Binary Tree.go
new file mode 100644
index 000000000..33a631370
--- /dev/null
+++ b/leetcode/0297.Serialize-and-Deserialize-Binary-Tree/297.Serialize and Deserialize Binary Tree.go
@@ -0,0 +1,54 @@
+package leetcode
+
+import (
+ "strconv"
+ "strings"
+
+ "github.com/halfrost/LeetCode-Go/structures"
+)
+
+type TreeNode = structures.TreeNode
+
+type Codec struct {
+ builder strings.Builder
+ input []string
+}
+
+func Constructor() Codec {
+ return Codec{}
+}
+
+// Serializes a tree to a single string.
+func (this *Codec) serialize(root *TreeNode) string {
+ if root == nil {
+ this.builder.WriteString("#,")
+ return ""
+ }
+ this.builder.WriteString(strconv.Itoa(root.Val) + ",")
+ this.serialize(root.Left)
+ this.serialize(root.Right)
+ return this.builder.String()
+}
+
+// Deserializes your encoded data to tree.
+func (this *Codec) deserialize(data string) *TreeNode {
+ if len(data) == 0 {
+ return nil
+ }
+ this.input = strings.Split(data, ",")
+ return this.deserializeHelper()
+}
+
+func (this *Codec) deserializeHelper() *TreeNode {
+ if this.input[0] == "#" {
+ this.input = this.input[1:]
+ return nil
+ }
+ val, _ := strconv.Atoi(this.input[0])
+ this.input = this.input[1:]
+ return &TreeNode{
+ Val: val,
+ Left: this.deserializeHelper(),
+ Right: this.deserializeHelper(),
+ }
+}
diff --git a/leetcode/0297.Serialize-and-Deserialize-Binary-Tree/297.Serialize and Deserialize Binary Tree_test.go b/leetcode/0297.Serialize-and-Deserialize-Binary-Tree/297.Serialize and Deserialize Binary Tree_test.go
new file mode 100644
index 000000000..cf7031c4a
--- /dev/null
+++ b/leetcode/0297.Serialize-and-Deserialize-Binary-Tree/297.Serialize and Deserialize Binary Tree_test.go
@@ -0,0 +1,55 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+
+ "github.com/halfrost/LeetCode-Go/structures"
+)
+
+type question297 struct {
+ para297
+ ans297
+}
+
+// para 是参数
+// one 代表第一个参数
+type para297 struct {
+ one []int
+}
+
+// ans 是答案
+// one 代表第一个答案
+type ans297 struct {
+ one []int
+}
+
+func Test_Problem297(t *testing.T) {
+ qs := []question297{
+ {
+ para297{[]int{}},
+ ans297{[]int{}},
+ },
+ {
+ para297{[]int{1, 2, 3, -1, -1, 4, 5}},
+ ans297{[]int{1, 2, 3, -1, -1, 4, 5}},
+ },
+ {
+ para297{[]int{1, 2}},
+ ans297{[]int{1, 2}},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 297------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans297, q.para297
+ fmt.Printf("【input】:%v ", p)
+ root := structures.Ints2TreeNode(p.one)
+
+ tree297 := Constructor()
+ serialized := tree297.serialize(root)
+ fmt.Printf("【output】:%v \n", structures.Tree2Preorder(tree297.deserialize(serialized)))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/0297.Serialize-and-Deserialize-Binary-Tree/README.md b/leetcode/0297.Serialize-and-Deserialize-Binary-Tree/README.md
new file mode 100644
index 000000000..15f4afa5f
--- /dev/null
+++ b/leetcode/0297.Serialize-and-Deserialize-Binary-Tree/README.md
@@ -0,0 +1,113 @@
+# [297. Serialize and Deserialize Binary Tree](https://leetcode.com/problems/serialize-and-deserialize-binary-tree/)
+
+
+## 题目
+
+Serialization is the process of converting a data structure or object into a sequence of bits so that it can be stored in a file or memory buffer, or transmitted across a network connection link to be reconstructed later in the same or another computer environment.
+
+Design an algorithm to serialize and deserialize a binary tree. There is no restriction on how your serialization/deserialization algorithm should work. You just need to ensure that a binary tree can be serialized to a string and this string can be deserialized to the original tree structure.
+
+**Clarification:** The input/output format is the same as [how LeetCode serializes a binary tree](https://leetcode.com/faq/#binary-tree). You do not necessarily need to follow this format, so please be creative and come up with different approaches yourself.
+
+**Example 1:**
+
+
+
+```
+Input: root = [1,2,3,null,null,4,5]
+Output: [1,2,3,null,null,4,5]
+```
+
+**Example 2:**
+
+```
+Input: root = []
+Output: []
+```
+
+**Example 3:**
+
+```
+Input: root = [1]
+Output: [1]
+```
+
+**Example 4:**
+
+```
+Input: root = [1,2]
+Output: [1,2]
+```
+
+**Constraints:**
+
+- The number of nodes in the tree is in the range `[0, 104]`.
+- `1000 <= Node.val <= 1000`
+
+## 题目大意
+
+设计一个算法，来序列化和反序列化二叉树。并不限制如何进行序列化和反序列化，但是你需要保证二叉树可以序列化为字符串，并且这个字符串可以被反序列化成原有的二叉树。
+
+## 解题思路
+
+- 1. 将给定的二叉树想象成一颗满二叉树(不存在的结点用 null 填充)。
+- 2. 通过前序遍历，可以得到一个第一个结点为根的序列，然后递归进行序列化/反序列化即可。
+
+## 代码
+
+```go
+package leetcode
+
+import (
+ "strconv"
+ "strings"
+
+ "github.com/halfrost/LeetCode-Go/structures"
+)
+
+type TreeNode = structures.TreeNode
+
+type Codec struct {
+ builder strings.Builder
+ input []string
+}
+
+func Constructor() Codec {
+ return Codec{}
+}
+
+// Serializes a tree to a single string.
+func (this *Codec) serialize(root *TreeNode) string {
+ if root == nil {
+ this.builder.WriteString("#,")
+ return ""
+ }
+ this.builder.WriteString(strconv.Itoa(root.Val) + ",")
+ this.serialize(root.Left)
+ this.serialize(root.Right)
+ return this.builder.String()
+}
+
+// Deserializes your encoded data to tree.
+func (this *Codec) deserialize(data string) *TreeNode {
+ if len(data) == 0 {
+ return nil
+ }
+ this.input = strings.Split(data, ",")
+ return this.deserializeHelper()
+}
+
+func (this *Codec) deserializeHelper() *TreeNode {
+ if this.input[0] == "#" {
+ this.input = this.input[1:]
+ return nil
+ }
+ val, _ := strconv.Atoi(this.input[0])
+ this.input = this.input[1:]
+ return &TreeNode{
+ Val: val,
+ Left: this.deserializeHelper(),
+ Right: this.deserializeHelper(),
+ }
+}
+```
\ No newline at end of file
diff --git a/leetcode/0299.Bulls-and-Cows/299.Bulls and Cows.go b/leetcode/0299.Bulls-and-Cows/299.Bulls and Cows.go
new file mode 100644
index 000000000..920827f07
--- /dev/null
+++ b/leetcode/0299.Bulls-and-Cows/299.Bulls and Cows.go
@@ -0,0 +1,31 @@
+package leetcode
+
+import "strconv"
+
+func getHint(secret string, guess string) string {
+ cntA, cntB := 0, 0
+ mpS := make(map[byte]int)
+ var strG []byte
+ n := len(secret)
+ var ans string
+ for i := 0; i < n; i++ {
+ if secret[i] == guess[i] {
+ cntA++
+ } else {
+ mpS[secret[i]] += 1
+ strG = append(strG, guess[i])
+ }
+ }
+ for _, v := range strG {
+ if _, ok := mpS[v]; ok {
+ if mpS[v] > 1 {
+ mpS[v] -= 1
+ } else {
+ delete(mpS, v)
+ }
+ cntB++
+ }
+ }
+ ans += strconv.Itoa(cntA) + "A" + strconv.Itoa(cntB) + "B"
+ return ans
+}
diff --git a/leetcode/0299.Bulls-and-Cows/299.Bulls and Cows_test.go b/leetcode/0299.Bulls-and-Cows/299.Bulls and Cows_test.go
new file mode 100644
index 000000000..72028efb6
--- /dev/null
+++ b/leetcode/0299.Bulls-and-Cows/299.Bulls and Cows_test.go
@@ -0,0 +1,56 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question299 struct {
+ para299
+ ans299
+}
+
+// para 是参数
+type para299 struct {
+ secret string
+ guess string
+}
+
+// ans 是答案
+type ans299 struct {
+ ans string
+}
+
+func Test_Problem299(t *testing.T) {
+
+ qs := []question299{
+
+ {
+ para299{"1807", "7810"},
+ ans299{"1A3B"},
+ },
+
+ {
+ para299{"1123", "0111"},
+ ans299{"1A1B"},
+ },
+
+ {
+ para299{"1", "0"},
+ ans299{"0A0B"},
+ },
+
+ {
+ para299{"1", "1"},
+ ans299{"1A0B"},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 299------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans299, q.para299
+ fmt.Printf("【input】:%v 【output】:%v\n", p, getHint(p.secret, p.guess))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/0299.Bulls-and-Cows/README.md b/leetcode/0299.Bulls-and-Cows/README.md
new file mode 100644
index 000000000..61f7b164b
--- /dev/null
+++ b/leetcode/0299.Bulls-and-Cows/README.md
@@ -0,0 +1,114 @@
+# [299. Bulls and Cows](https://leetcode.com/problems/bulls-and-cows/)
+
+
+## 题目
+
+You are playing the Bulls and Cows game with your friend.
+
+You write down a secret number and ask your friend to guess what the number is. When your friend makes a guess, you provide a hint with the following info:
+
+The number of "bulls", which are digits in the guess that are in the correct position.
+The number of "cows", which are digits in the guess that are in your secret number but are located in the wrong position. Specifically, the non-bull digits in the guess that could be rearranged such that they become bulls.
+Given the secret number secret and your friend's guess guess, return the hint for your friend's guess.
+
+The hint should be formatted as "xAyB", where x is the number of bulls and y is the number of cows. Note that both secret and guess may contain duplicate digits.
+
+**Example 1:**
+
+```
+Input: secret = "1807", guess = "7810"
+Output: "1A3B"
+Explanation: Bulls are connected with a '|' and cows are underlined:
+"1807"
+ |
+"7810"
+```
+
+**Example 2:**
+
+```
+Input: secret = "1123", guess = "0111"
+Output: "1A1B"
+Explanation: Bulls are connected with a '|' and cows are underlined:
+"1123" "1123"
+ | or |
+"0111" "0111"
+Note that only one of the two unmatched 1s is counted as a cow since the non-bull digits can only be rearranged to allow one 1 to be a bull.
+```
+
+**Example 3:**
+
+```
+Input: secret = "1", guess = "0"
+Output: "0A0B"
+```
+
+**Example 4:**
+
+```
+Input: secret = "1", guess = "1"
+Output: "1A0B"
+```
+
+**Constraints:**
+
+- 1 <= secret.length, guess.length <= 1000
+- secret.length == guess.length
+- secret and guess consist of digits only.
+
+## 题目大意
+
+你在和朋友一起玩 猜数字（Bulls and Cows）游戏，该游戏规则如下：
+
+写出一个秘密数字，并请朋友猜这个数字是多少。朋友每猜测一次，你就会给他一个包含下述信息的提示：
+
+猜测数字中有多少位属于数字和确切位置都猜对了（称为 "Bulls", 公牛），
+有多少位属于数字猜对了但是位置不对（称为 "Cows", 奶牛）。也就是说，这次猜测中有多少位非公牛数字可以通过重新排列转换成公牛数字。
+给你一个秘密数字secret 和朋友猜测的数字guess ，请你返回对朋友这次猜测的提示。
+
+提示的格式为 "xAyB" ，x 是公牛个数， y 是奶牛个数，A 表示公牛，B表示奶牛。
+
+请注意秘密数字和朋友猜测的数字都可能含有重复数字。
+
+## 解题思路
+
+- 计算下标一致并且对应下标的元素一致的个数，即 x
+- secret 和 guess 分别去除 x 个公牛的元素,剩下 secret 和 guess 求共同的元素个数就是 y
+- 把 x， y 转换成字符串，分别与 "A" 和 "B" 进行拼接返回结果
+
+## 代码
+
+```go
+
+package leetcode
+
+import "strconv"
+
+func getHint(secret string, guess string) string {
+ cntA, cntB := 0, 0
+ mpS := make(map[byte]int)
+ var strG []byte
+ n := len(secret)
+ var ans string
+ for i := 0; i < n; i++ {
+ if secret[i] == guess[i] {
+ cntA++
+ } else {
+ mpS[secret[i]] += 1
+ strG = append(strG, guess[i])
+ }
+ }
+ for _, v := range strG {
+ if _, ok := mpS[v]; ok {
+ if mpS[v] > 1 {
+ mpS[v] -= 1
+ } else {
+ delete(mpS, v)
+ }
+ cntB++
+ }
+ }
+ ans += strconv.Itoa(cntA) + "A" + strconv.Itoa(cntB) + "B"
+ return ans
+}
+```
\ No newline at end of file
diff --git a/leetcode/0301.Remove-Invalid-Parentheses/301.Remove Invalid Parentheses.go b/leetcode/0301.Remove-Invalid-Parentheses/301.Remove Invalid Parentheses.go
new file mode 100644
index 000000000..0e53f6bdd
--- /dev/null
+++ b/leetcode/0301.Remove-Invalid-Parentheses/301.Remove Invalid Parentheses.go
@@ -0,0 +1,69 @@
+package leetcode
+
+var (
+ res []string
+ mp map[string]int
+ n int
+ length int
+ maxScore int
+ str string
+)
+
+func removeInvalidParentheses(s string) []string {
+ lmoves, rmoves, lcnt, rcnt := 0, 0, 0, 0
+ for _, v := range s {
+ if v == '(' {
+ lmoves++
+ lcnt++
+ } else if v == ')' {
+ if lmoves != 0 {
+ lmoves--
+ } else {
+ rmoves++
+ }
+ rcnt++
+ }
+ }
+ n = len(s)
+ length = n - lmoves - rmoves
+ res = []string{}
+ mp = make(map[string]int)
+ maxScore = min(lcnt, rcnt)
+ str = s
+ backtrace(0, "", lmoves, rmoves, 0)
+ return res
+}
+
+func backtrace(i int, cur string, lmoves int, rmoves int, score int) {
+ if lmoves < 0 || rmoves < 0 || score < 0 || score > maxScore {
+ return
+ }
+ if lmoves == 0 && rmoves == 0 {
+ if len(cur) == length {
+ if _, ok := mp[cur]; !ok {
+ res = append(res, cur)
+ mp[cur] = 1
+ }
+ return
+ }
+ }
+ if i == n {
+ return
+ }
+ if str[i] == '(' {
+ backtrace(i+1, cur+string('('), lmoves, rmoves, score+1)
+ backtrace(i+1, cur, lmoves-1, rmoves, score)
+ } else if str[i] == ')' {
+ backtrace(i+1, cur+string(')'), lmoves, rmoves, score-1)
+ backtrace(i+1, cur, lmoves, rmoves-1, score)
+ } else {
+ backtrace(i+1, cur+string(str[i]), lmoves, rmoves, score)
+ }
+}
+
+func min(a, b int) int {
+ if a < b {
+ return a
+ }
+ return b
+}
diff --git a/leetcode/0301.Remove-Invalid-Parentheses/301.Remove Invalid Parentheses_test.go b/leetcode/0301.Remove-Invalid-Parentheses/301.Remove Invalid Parentheses_test.go
new file mode 100644
index 000000000..c49d72df7
--- /dev/null
+++ b/leetcode/0301.Remove-Invalid-Parentheses/301.Remove Invalid Parentheses_test.go
@@ -0,0 +1,50 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question301 struct {
+ para301
+ ans301
+}
+
+// s 是参数
+type para301 struct {
+ s string
+}
+
+// ans 是答案
+type ans301 struct {
+ ans []string
+}
+
+func Test_Problem301(t *testing.T) {
+
+ qs := []question301{
+
+ {
+ para301{"()())()"},
+ ans301{[]string{"(())()", "()()()"}},
+ },
+
+ {
+ para301{"(a)())()"},
+ ans301{[]string{"(a())()", "(a)()()"}},
+ },
+
+ {
+ para301{")("},
+ ans301{[]string{""}},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 301------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans301, q.para301
+ fmt.Printf("【input】:%v 【output】:%v\n", p, removeInvalidParentheses(p.s))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/0301.Remove-Invalid-Parentheses/README.md b/leetcode/0301.Remove-Invalid-Parentheses/README.md
new file mode 100644
index 000000000..cd1d80b81
--- /dev/null
+++ b/leetcode/0301.Remove-Invalid-Parentheses/README.md
@@ -0,0 +1,131 @@
+# [301. Remove Invalid Parentheses](https://leetcode.com/problems/remove-invalid-parentheses/)
+
+
+## 题目
+
+Given a string s that contains parentheses and letters, remove the minimum number of invalid parentheses to make the input string valid.
+
+Return all the possible results. You may return the answer in any order.
+
+**Example 1:**
+
+ Input: s = "()())()"
+ Output: ["(())()","()()()"]
+
+**Example 2:**
+
+ Input: s = "(a)())()"
+ Output: ["(a())()","(a)()()"]
+
+**Example 3:**
+
+ Input: s = ")("
+ Output: [""]
+
+**Constraints:**
+
+- 1 <= s.length <= 25
+- s consists of lowercase English letters and parentheses '(' and ')'.
+- There will be at most 20 parentheses in s.
+
+## 题目大意
+
+给你一个由若干括号和字母组成的字符串 s ，删除最小数量的无效括号，使得输入的字符串有效。
+
+返回所有可能的结果。答案可以按 任意顺序 返回。
+
+说明:
+
+- 1 <= s.length <= 25
+- s 由小写英文字母以及括号 '(' 和 ')' 组成
+- s 中至多含 20 个括号
+
+
+## 解题思路
+
+回溯和剪枝
+- 计算最大得分数maxScore，合法字符串的长度length，左括号和右括号的移除次数lmoves,rmoves
+- 加一个左括号的得分加1；加一个右括号的得分减1
+- 对于一个合法的字符串，左括号等于右括号，得分最终为0；
+- 搜索过程中出现以下任何一种情况都直接返回
+ - 得分值为负数
+ - 得分大于最大得分数
+ - 得分小于0
+ - lmoves小于0
+ - rmoves小于0
+
+## 代码
+
+```go
+
+package leetcode
+
+var (
+ res []string
+ mp map[string]int
+ n int
+ length int
+ maxScore int
+ str string
+)
+
+func removeInvalidParentheses(s string) []string {
+ lmoves, rmoves, lcnt, rcnt := 0, 0, 0, 0
+ for _, v := range s {
+ if v == '(' {
+ lmoves++
+ lcnt++
+ } else if v == ')' {
+ if lmoves != 0 {
+ lmoves--
+ } else {
+ rmoves++
+ }
+ rcnt++
+ }
+ }
+ n = len(s)
+ length = n - lmoves - rmoves
+ res = []string{}
+ mp = make(map[string]int)
+ maxScore = min(lcnt, rcnt)
+ str = s
+ backtrace(0, "", lmoves, rmoves, 0)
+ return res
+}
+
+func backtrace(i int, cur string, lmoves int, rmoves int, score int) {
+ if lmoves < 0 || rmoves < 0 || score < 0 || score > maxScore {
+ return
+ }
+ if lmoves == 0 && rmoves == 0 {
+ if len(cur) == length {
+ if _, ok := mp[cur]; !ok {
+ res = append(res, cur)
+ mp[cur] = 1
+ }
+ return
+ }
+ }
+ if i == n {
+ return
+ }
+ if str[i] == '(' {
+ backtrace(i+1, cur+string('('), lmoves, rmoves, score+1)
+ backtrace(i+1, cur, lmoves-1, rmoves, score)
+ } else if str[i] == ')' {
+ backtrace(i+1, cur+string(')'), lmoves, rmoves, score-1)
+ backtrace(i+1, cur, lmoves, rmoves-1, score)
+ } else {
+ backtrace(i+1, cur+string(str[i]), lmoves, rmoves, score)
+ }
+}
+
+func min(a, b int) int {
+ if a < b {
+ return a
+ }
+ return b
+}
+
+```
\ No newline at end of file
diff --git a/leetcode/0303.Range-Sum-Query---Immutable/303. Range Sum Query - Immutable.go b/leetcode/0303.Range-Sum-Query-Immutable/303. Range Sum Query - Immutable.go
similarity index 100%
rename from leetcode/0303.Range-Sum-Query---Immutable/303. Range Sum Query - Immutable.go
rename to leetcode/0303.Range-Sum-Query-Immutable/303. Range Sum Query - Immutable.go
diff --git a/leetcode/0303.Range-Sum-Query---Immutable/303. Range Sum Query - Immutable_test.go b/leetcode/0303.Range-Sum-Query-Immutable/303. Range Sum Query - Immutable_test.go
similarity index 100%
rename from leetcode/0303.Range-Sum-Query---Immutable/303. Range Sum Query - Immutable_test.go
rename to leetcode/0303.Range-Sum-Query-Immutable/303. Range Sum Query - Immutable_test.go
diff --git a/leetcode/0303.Range-Sum-Query---Immutable/README.md b/leetcode/0303.Range-Sum-Query-Immutable/README.md
similarity index 100%
rename from leetcode/0303.Range-Sum-Query---Immutable/README.md
rename to leetcode/0303.Range-Sum-Query-Immutable/README.md
diff --git a/leetcode/0304.Range-Sum-Query-2D-Immutable/304. Range Sum Query 2D - Immutable.go b/leetcode/0304.Range-Sum-Query-2D-Immutable/304. Range Sum Query 2D - Immutable.go
new file mode 100644
index 000000000..ab28dd0f8
--- /dev/null
+++ b/leetcode/0304.Range-Sum-Query-2D-Immutable/304. Range Sum Query 2D - Immutable.go
@@ -0,0 +1,31 @@
+package leetcode
+
+type NumMatrix struct {
+ cumsum [][]int
+}
+
+func Constructor(matrix [][]int) NumMatrix {
+ if len(matrix) == 0 {
+ return NumMatrix{nil}
+ }
+ cumsum := make([][]int, len(matrix)+1)
+ cumsum[0] = make([]int, len(matrix[0])+1)
+ for i := range matrix {
+ cumsum[i+1] = make([]int, len(matrix[i])+1)
+ for j := range matrix[i] {
+ cumsum[i+1][j+1] = matrix[i][j] + cumsum[i][j+1] + cumsum[i+1][j] - cumsum[i][j]
+ }
+ }
+ return NumMatrix{cumsum}
+}
+
+func (this *NumMatrix) SumRegion(row1 int, col1 int, row2 int, col2 int) int {
+ cumsum := this.cumsum
+ return cumsum[row2+1][col2+1] - cumsum[row1][col2+1] - cumsum[row2+1][col1] + cumsum[row1][col1]
+}
+
+/**
+ * Your NumMatrix object will be instantiated and called as such:
+ * obj := Constructor(matrix);
+ * param_1 := obj.SumRegion(row1,col1,row2,col2);
+ */
diff --git a/leetcode/0304.Range-Sum-Query-2D-Immutable/304. Range Sum Query 2D - Immutable_test.go b/leetcode/0304.Range-Sum-Query-2D-Immutable/304. Range Sum Query 2D - Immutable_test.go
new file mode 100644
index 000000000..10e56d406
--- /dev/null
+++ b/leetcode/0304.Range-Sum-Query-2D-Immutable/304. Range Sum Query 2D - Immutable_test.go
@@ -0,0 +1,21 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+func Test_Problem304(t *testing.T) {
+ obj := Constructor(
+ [][]int{
+ {3, 0, 1, 4, 2},
+ {5, 6, 3, 2, 1},
+ {1, 2, 0, 1, 5},
+ {4, 1, 0, 1, 7},
+ {1, 0, 3, 0, 5},
+ },
+ )
+ fmt.Printf("obj = %v\n", obj.SumRegion(2, 1, 4, 3))
+ fmt.Printf("obj = %v\n", obj.SumRegion(1, 1, 2, 2))
+ fmt.Printf("obj = %v\n", obj.SumRegion(1, 2, 2, 4))
+}
diff --git a/leetcode/0304.Range-Sum-Query-2D-Immutable/README.md b/leetcode/0304.Range-Sum-Query-2D-Immutable/README.md
new file mode 100644
index 000000000..3ed2a65d2
--- /dev/null
+++ b/leetcode/0304.Range-Sum-Query-2D-Immutable/README.md
@@ -0,0 +1,89 @@
+# [304. Range Sum Query 2D - Immutable](https://leetcode.com/problems/range-sum-query-2d-immutable/)
+
+
+## 题目
+
+Given a 2D matrix matrix, find the sum of the elements inside the rectangle defined by its upper left corner (row1, col1) and lower right corner (row2, col2).
+
+
+
+The above rectangle (with the red border) is defined by (row1, col1) = **(2, 1)** and (row2, col2) = **(4, 3)**, which contains sum = **8**.
+
+**Example:**
+
+```
+Given matrix = [
+ [3, 0, 1, 4, 2],
+ [5, 6, 3, 2, 1],
+ [1, 2, 0, 1, 5],
+ [4, 1, 0, 1, 7],
+ [1, 0, 3, 0, 5]
+]
+
+sumRegion(2, 1, 4, 3) -> 8
+sumRegion(1, 1, 2, 2) -> 11
+sumRegion(1, 2, 2, 4) -> 12
+
+```
+
+**Note:**
+
+1. You may assume that the matrix does not change.
+2. There are many calls to sumRegion function.
+3. You may assume that row1 ≤ row2 and col1 ≤ col2.
+
+## 题目大意
+
+给定一个二维矩阵，计算其子矩形范围内元素的总和，该子矩阵的左上角为 (row1, col1) ，右下角为 (row2, col2) 。
+
+## 解题思路
+
+- 这一题是一维数组前缀和的进阶版本。定义 f(x,y) 代表矩形左上角 (0,0)，右下角 (x,y) 内的元素和。{{< katex display >}} f(i,j) = \sum_{x=0}^{i}\sum_{y=0}^{j} Matrix[x][y]{{< /katex >}}
+
+ {{< katex display >}}
+ \begin{aligned}f(i,j) &= \sum_{x=0}^{i-1}\sum_{y=0}^{j-1} Matrix[x][y] + \sum_{x=0}^{i-1} Matrix[x][j] + \sum_{y=0}^{j-1} Matrix[i][y] + Matrix[i][j]\\&= (\sum_{x=0}^{i-1}\sum_{y=0}^{j-1} Matrix[x][y] + \sum_{x=0}^{i-1} Matrix[x][j]) + (\sum_{x=0}^{i-1}\sum_{y=0}^{j-1} Matrix[x][y] + \sum_{y=0}^{j-1} Matrix[i][y]) - \sum_{x=0}^{i-1}\sum_{y=0}^{j-1} Matrix[x][y] + Matrix[i][j]\\&= \sum_{x=0}^{i-1}\sum_{y=0}^{j} Matrix[x][y] + \sum_{x=0}^{i}\sum_{y=0}^{j-1} Matrix[x][y] - \sum_{x=0}^{i-1}\sum_{y=0}^{j-1} Matrix[x][y] + Matrix[i][j]\\&= f(i-1,j) + f(i,j-1) - f(i-1,j-1) + Matrix[i][j]\end{aligned}
+ {{< /katex >}}
+
+- 于是得到递推的关系式：`f(i, j) = f(i-1, j) + f(i, j-1) - f(i-1, j-1) + matrix[i][j]`，写代码为了方便，新建一个 `m+1 * n+1` 的矩阵，这样就不需要对 `row = 0` 和 `col = 0` 做单独处理了。上述推导公式如果画成图也很好理解：
+
+ 
+
+ 左图中大的矩形由粉红色的矩形 + 绿色矩形 - 粉红色和绿色重叠部分 + 黄色部分。这就对应的是上面推导出来的递推公式。左图是矩形左上角为 (0，0) 的情况，更加一般的情况是右图，左上角是任意的坐标，公式不变。
+
+- 时间复杂度：初始化 O(mn)，查询 O(1)。空间复杂度 O(mn)
+
+## 代码
+
+```go
+package leetcode
+
+type NumMatrix struct {
+ cumsum [][]int
+}
+
+func Constructor(matrix [][]int) NumMatrix {
+ if len(matrix) == 0 {
+ return NumMatrix{nil}
+ }
+ cumsum := make([][]int, len(matrix)+1)
+ cumsum[0] = make([]int, len(matrix[0])+1)
+ for i := range matrix {
+ cumsum[i+1] = make([]int, len(matrix[i])+1)
+ for j := range matrix[i] {
+ cumsum[i+1][j+1] = matrix[i][j] + cumsum[i][j+1] + cumsum[i+1][j] - cumsum[i][j]
+ }
+ }
+ return NumMatrix{cumsum}
+}
+
+func (this *NumMatrix) SumRegion(row1 int, col1 int, row2 int, col2 int) int {
+ cumsum := this.cumsum
+ return cumsum[row2+1][col2+1] - cumsum[row1][col2+1] - cumsum[row2+1][col1] + cumsum[row1][col1]
+}
+
+/**
+ * Your NumMatrix object will be instantiated and called as such:
+ * obj := Constructor(matrix);
+ * param_1 := obj.SumRegion(row1,col1,row2,col2);
+ */
+```
\ No newline at end of file
diff --git a/leetcode/0306.Additive-Number/306. Additive Number.go b/leetcode/0306.Additive-Number/306. Additive Number.go
index 1489b05c8..bd0429a16 100644
--- a/leetcode/0306.Additive-Number/306. Additive Number.go
+++ b/leetcode/0306.Additive-Number/306. Additive Number.go
@@ -35,7 +35,7 @@ func max(a int, b int) int {
return b
}
-//Propagate for rest of the string
+// Propagate for rest of the string
func recursiveCheck(num string, x1 int, x2 int, left int) bool {
if left == len(num) {
return true
diff --git a/leetcode/0307.Range-Sum-Query---Mutable/307. Range Sum Query - Mutable.go b/leetcode/0307.Range-Sum-Query---Mutable/307. Range Sum Query - Mutable.go
deleted file mode 100644
index 884b0c8bb..000000000
--- a/leetcode/0307.Range-Sum-Query---Mutable/307. Range Sum Query - Mutable.go
+++ /dev/null
@@ -1,68 +0,0 @@
-package leetcode
-
-import (
- "github.com/halfrost/LeetCode-Go/template"
-)
-
-// NumArray define
-type NumArray struct {
- st *template.SegmentTree
-}
-
-// Constructor307 define
-func Constructor307(nums []int) NumArray {
- st := template.SegmentTree{}
- st.Init(nums, func(i, j int) int {
- return i + j
- })
- return NumArray{st: &st}
-}
-
-// Update define
-func (this *NumArray) Update(i int, val int) {
- this.st.Update(i, val)
-}
-
-//解法二 prefixSum，sumRange 时间复杂度 O(1)
-
-// // NumArray define
-// type NumArray307 struct {
-// prefixSum []int
-// data []int
-// }
-
-// // Constructor307 define
-// func Constructor307(nums []int) NumArray307 {
-// data := make([]int, len(nums))
-// for i := 0; i < len(nums); i++ {
-// data[i] = nums[i]
-// }
-// for i := 1; i < len(nums); i++ {
-// nums[i] += nums[i-1]
-// }
-// return NumArray307{prefixSum: nums, data: data}
-// }
-
-// // Update define
-// func (this *NumArray307) Update(i int, val int) {
-// this.data[i] = val
-// this.prefixSum[0] = this.data[0]
-// for i := 1; i < len(this.data); i++ {
-// this.prefixSum[i] = this.prefixSum[i-1] + this.data[i]
-// }
-// }
-
-// // SumRange define
-// func (this *NumArray307) SumRange(i int, j int) int {
-// if i > 0 {
-// return this.prefixSum[j] - this.prefixSum[i-1]
-// }
-// return this.prefixSum[j]
-// }
-
-/**
- * Your NumArray object will be instantiated and called as such:
- * obj := Constructor(nums);
- * obj.Update(i,val);
- * param_2 := obj.SumRange(i,j);
- */
diff --git a/leetcode/0307.Range-Sum-Query---Mutable/307. Range Sum Query - Mutable_test.go b/leetcode/0307.Range-Sum-Query---Mutable/307. Range Sum Query - Mutable_test.go
deleted file mode 100644
index 1f8d8f88e..000000000
--- a/leetcode/0307.Range-Sum-Query---Mutable/307. Range Sum Query - Mutable_test.go
+++ /dev/null
@@ -1,20 +0,0 @@
-package leetcode
-
-import (
- "fmt"
- "testing"
-)
-
-func Test_Problem307(t *testing.T) {
- obj := Constructor307([]int{1, 3, 5})
- fmt.Printf("obj = %v\n", obj)
- fmt.Printf("SumRange(0,2) = %v\n", obj.SumRange(0, 2))
- obj.Update(1, 2)
- fmt.Printf("obj = %v\n", obj)
- fmt.Printf("SumRange(0,2) = %v\n", obj.SumRange(0, 2))
-}
-
-// SumRange define
-func (ma *NumArray) SumRange(i int, j int) int {
- return ma.st.Query(i, j)
-}
diff --git a/leetcode/0307.Range-Sum-Query---Mutable/README.md b/leetcode/0307.Range-Sum-Query---Mutable/README.md
deleted file mode 100755
index 85da48397..000000000
--- a/leetcode/0307.Range-Sum-Query---Mutable/README.md
+++ /dev/null
@@ -1,50 +0,0 @@
-# [307. Range Sum Query - Mutable](https://leetcode.com/problems/range-sum-query-mutable/)
-
-
-## 题目
-
-Given an integer array nums, find the sum of the elements between indices i and j (i ≤ j), inclusive.
-
-The update(i, val) function modifies nums by updating the element at index i to val.
-
-**Example:**
-
- Given nums = [1, 3, 5]
-
- sumRange(0, 2) -> 9
- update(1, 2)
- sumRange(0, 2) -> 8
-
-**Note:**
-
-1. The array is only modifiable by the update function.
-2. You may assume the number of calls to update and sumRange function is distributed evenly.
-
-
-## 题目大意
-
-给定一个整数数组 nums，求出数组从索引 i 到 j (i ≤ j) 范围内元素的总和，包含 i, j 两点。
-
-update(i, val) 函数可以通过将下标为 i 的数值更新为 val，从而对数列进行修改。
-
-示例:
-
-```
-Given nums = [1, 3, 5]
-
-sumRange(0, 2) -> 9
-update(1, 2)
-sumRange(0, 2) -> 8
-```
-
-说明:
-
-- 数组仅可以在 update 函数下进行修改。
-- 你可以假设 update 函数与 sumRange 函数的调用次数是均匀分布的。
-
-## 解题思路
-
-
-- 给出一个数组，数组里面的数都是`**可变**`的，设计一个数据结构能够满足查询数组任意区间内元素的和。
-- 对比第 303 题，这一题由于数组里面的元素都是**`可变`**的，所以第一个想到的解法就是线段树，构建一颗线段树，父结点内存的是两个子结点的和，初始化建树的时间复杂度是 O(log n)，查询区间元素和的时间复杂度是 O(log n)，更新元素值的时间复杂度是 O(log n)。
-- 如果此题还用 prefixSum 的思路解答呢？那每次 update 操作的时间复杂度都是 O(n)，因为每次更改一个值，最坏情况就是所有的 prefixSum 都要更新一次。prefixSum 的方法在这道题上面也可以 AC，只不过时间排名在 5%，非常差。
diff --git a/leetcode/0307.Range-Sum-Query-Mutable/307. Range Sum Query - Mutable.go b/leetcode/0307.Range-Sum-Query-Mutable/307. Range Sum Query - Mutable.go
new file mode 100644
index 000000000..e16c7c3f6
--- /dev/null
+++ b/leetcode/0307.Range-Sum-Query-Mutable/307. Range Sum Query - Mutable.go
@@ -0,0 +1,95 @@
+package leetcode
+
+import "github.com/halfrost/LeetCode-Go/template"
+
+// NumArray define
+type NumArray struct {
+ st *template.SegmentTree
+}
+
+// Constructor307 define
+func Constructor307(nums []int) NumArray {
+ st := template.SegmentTree{}
+ st.Init(nums, func(i, j int) int {
+ return i + j
+ })
+ return NumArray{st: &st}
+}
+
+// Update define
+func (this *NumArray) Update(i int, val int) {
+ this.st.Update(i, val)
+}
+
+// SumRange define
+func (this *NumArray) SumRange(i int, j int) int {
+ return this.st.Query(i, j)
+}
+
+//解法二 prefixSum，sumRange 时间复杂度 O(1)
+
+// // NumArray define
+// type NumArray307 struct {
+// prefixSum []int
+// data []int
+// }
+
+// // Constructor307 define
+// func Constructor307(nums []int) NumArray307 {
+// data := make([]int, len(nums))
+// for i := 0; i < len(nums); i++ {
+// data[i] = nums[i]
+// }
+// for i := 1; i < len(nums); i++ {
+// nums[i] += nums[i-1]
+// }
+// return NumArray307{prefixSum: nums, data: data}
+// }
+
+// // Update define
+// func (this *NumArray307) Update(i int, val int) {
+// this.data[i] = val
+// this.prefixSum[0] = this.data[0]
+// for i := 1; i < len(this.data); i++ {
+// this.prefixSum[i] = this.prefixSum[i-1] + this.data[i]
+// }
+// }
+
+// // SumRange define
+// func (this *NumArray307) SumRange(i int, j int) int {
+// if i > 0 {
+// return this.prefixSum[j] - this.prefixSum[i-1]
+// }
+// return this.prefixSum[j]
+// }
+
+// 解法三 树状数组
+// type NumArray struct {
+// bit template.BinaryIndexedTree
+// data []int
+// }
+
+// // Constructor define
+// func Constructor307(nums []int) NumArray {
+// bit := template.BinaryIndexedTree{}
+// bit.InitWithNums(nums)
+// return NumArray{bit: bit, data: nums}
+// }
+
+// // Update define
+// func (this *NumArray) Update(i int, val int) {
+// this.bit.Add(i+1, val-this.data[i])
+// this.data[i] = val
+// }
+
+// // SumRange define
+// func (this *NumArray) SumRange(i int, j int) int {
+// return this.bit.Query(j+1) - this.bit.Query(i)
+// }
+
+/**
+ * Your NumArray object will be instantiated and called as such:
+ * obj := Constructor(nums);
+ * obj.Update(i,val);
+ * param_2 := obj.SumRange(i,j);
+ */
diff --git a/leetcode/0307.Range-Sum-Query-Mutable/307. Range Sum Query - Mutable_test.go b/leetcode/0307.Range-Sum-Query-Mutable/307. Range Sum Query - Mutable_test.go
new file mode 100644
index 000000000..49a548142
--- /dev/null
+++ b/leetcode/0307.Range-Sum-Query-Mutable/307. Range Sum Query - Mutable_test.go
@@ -0,0 +1,36 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+func Test_Problem307(t *testing.T) {
+ obj := Constructor307([]int{1, 3, 5})
+ fmt.Printf("obj = %v\n", obj)
+ fmt.Printf("SumRange(0,2) = %v\n", obj.SumRange(0, 2))
+ obj.Update(1, 2)
+ fmt.Printf("obj = %v\n", obj)
+ fmt.Printf("SumRange(0,2) = %v\n", obj.SumRange(0, 2))
+
+ obj = Constructor307([]int{-1})
+ fmt.Printf("obj = %v\n", obj)
+ fmt.Printf("SumRange(0,2) = %v\n", obj.SumRange(0, 0))
+ obj.Update(0, 1)
+ fmt.Printf("obj = %v\n", obj)
+ fmt.Printf("SumRange(0,2) = %v\n", obj.SumRange(0, 0))
+
+ obj = Constructor307([]int{7, 2, 7, 2, 0})
+ fmt.Printf("obj = %v\n", obj)
+ obj.Update(4, 6)
+ obj.Update(0, 2)
+ obj.Update(0, 9)
+ fmt.Printf("SumRange(0,2) = %v\n", obj.SumRange(4, 4))
+ obj.Update(3, 8)
+ fmt.Printf("obj = %v\n", obj)
+ fmt.Printf("SumRange(0,2) = %v\n", obj.SumRange(0, 4))
+ obj.Update(4, 1)
+ fmt.Printf("SumRange(0,2) = %v\n", obj.SumRange(0, 3))
+ fmt.Printf("SumRange(0,2) = %v\n", obj.SumRange(0, 4))
+ obj.Update(0, 4)
+}
diff --git a/leetcode/0307.Range-Sum-Query-Mutable/README.md b/leetcode/0307.Range-Sum-Query-Mutable/README.md
new file mode 100755
index 000000000..854501e0d
--- /dev/null
+++ b/leetcode/0307.Range-Sum-Query-Mutable/README.md
@@ -0,0 +1,51 @@
+# [307. Range Sum Query - Mutable](https://leetcode.com/problems/range-sum-query-mutable/)
+
+
+## 题目
+
+Given an integer array nums, find the sum of the elements between indices i and j (i ≤ j), inclusive.
+
+The update(i, val) function modifies nums by updating the element at index i to val.
+
+**Example:**
+
+ Given nums = [1, 3, 5]
+
+ sumRange(0, 2) -> 9
+ update(1, 2)
+ sumRange(0, 2) -> 8
+
+**Note:**
+
+1. The array is only modifiable by the update function.
+2. You may assume the number of calls to update and sumRange function is distributed evenly.
+
+
+## 题目大意
+
+给定一个整数数组 nums，求出数组从索引 i 到 j (i ≤ j) 范围内元素的总和，包含 i, j 两点。
+
+update(i, val) 函数可以通过将下标为 i 的数值更新为 val，从而对数列进行修改。
+
+示例:
+
+```
+Given nums = [1, 3, 5]
+
+sumRange(0, 2) -> 9
+update(1, 2)
+sumRange(0, 2) -> 8
+```
+
+说明:
+
+- 数组仅可以在 update 函数下进行修改。
+- 你可以假设 update 函数与 sumRange 函数的调用次数是均匀分布的。
+
+## 解题思路
+
+
+- 给出一个数组，数组里面的数都是`**可变**`的，设计一个数据结构能够满足查询数组任意区间内元素的和。
+- 对比第 303 题，这一题由于数组里面的元素都是**`可变`**的，所以第一个想到的解法就是线段树，构建一颗线段树，父结点内存的是两个子结点的和，初始化建树的时间复杂度是 O(log n)，查询区间元素和的时间复杂度是 O(log n)，更新元素值的时间复杂度是 O(log n)。
+- 如果此题还用 prefixSum 的思路解答呢？那每次 update 操作的时间复杂度都是 O(n)，因为每次更改一个值，最坏情况就是所有的 prefixSum 都要更新一次。prefixSum 的方法在这道题上面也可以 AC，只不过时间排名在 5%，非常差。
+- 此题也可以用树状数组解决。代码很直白，区间查询即是两个区间前缀和相减。最简单的树状数组应用。
diff --git a/leetcode/0315.Count-of-Smaller-Numbers-After-Self/315. Count of Smaller Numbers After Self.go b/leetcode/0315.Count-of-Smaller-Numbers-After-Self/315. Count of Smaller Numbers After Self.go
index c6ab601b7..d5908ce7a 100644
--- a/leetcode/0315.Count-of-Smaller-Numbers-After-Self/315. Count of Smaller Numbers After Self.go
+++ b/leetcode/0315.Count-of-Smaller-Numbers-After-Self/315. Count of Smaller Numbers After Self.go
@@ -6,6 +6,7 @@ import (
"github.com/halfrost/LeetCode-Go/template"
)
+// 解法一 线段树
func countSmaller(nums []int) []int {
if len(nums) == 0 {
return []int{}
@@ -35,3 +36,31 @@ func countSmaller(nums []int) []int {
}
return res
}
+
+// 解法二 树状数组
+func countSmaller1(nums []int) []int {
+ // copy 一份原数组至所有数字 allNums 数组中
+ allNums, res := make([]int, len(nums)), []int{}
+ copy(allNums, nums)
+ // 将 allNums 离散化
+ sort.Ints(allNums)
+ k := 1
+ kth := map[int]int{allNums[0]: k}
+ for i := 1; i < len(allNums); i++ {
+ if allNums[i] != allNums[i-1] {
+ k++
+ kth[allNums[i]] = k
+ }
+ }
+ // 树状数组 Query
+ bit := template.BinaryIndexedTree{}
+ bit.Init(k)
+ for i := len(nums) - 1; i >= 0; i-- {
+ res = append(res, bit.Query(kth[nums[i]]-1))
+ bit.Add(kth[nums[i]], 1)
+ }
+ for i := 0; i < len(res)/2; i++ {
+ res[i], res[len(res)-1-i] = res[len(res)-1-i], res[i]
+ }
+ return res
+}
diff --git a/leetcode/0315.Count-of-Smaller-Numbers-After-Self/README.md b/leetcode/0315.Count-of-Smaller-Numbers-After-Self/README.md
index d024ec998..680fef3be 100755
--- a/leetcode/0315.Count-of-Smaller-Numbers-After-Self/README.md
+++ b/leetcode/0315.Count-of-Smaller-Numbers-After-Self/README.md
@@ -39,3 +39,4 @@ You are given an integer array nums and you have to return a new counts arra
- 给出一个数组，要求输出数组中每个元素相对于数组中的位置右边比它小的元素。
- 这一题是第 327 题的缩水版。由于需要找数组位置右边比当前位置元素小的元素，所以从数组右边开始往左边扫。构造一颗线段树，线段树里面父节点存的是子节点出现的次数和。有可能给的数据会很大，所以构造线段树的时候先离散化。还需要注意的是数组里面可能有重复元素，所以构造线段树要先去重并排序。从右往左扫的过程中，依次添加数组中的元素，添加了一次就立即 query 一次。query 的区间是 [minNum, nums[i]-1]。如果是 minNum 则输出 0，并且也要记得插入这个最小值。这一题的思路和第 327 题大体类似，详解可见第 327 题。
+- 这一题同样可以用树状数组来解答。相比 327 题简单很多。第一步还是把所有用到的元素放入 allNums 数组中，第二步排序 + 离散化。由于题目要求输出右侧更小的元素，所以第三步倒序插入构造树状数组，Query 查询 `[1,i-1]` 区间内元素总数即为右侧更小元素个数。注意最终输出是顺序输出，计算是逆序计算的，最终数组里面的答案还需要逆序一遍。相同的套路题有，第 327 题，第 493 题。
\ No newline at end of file
diff --git a/leetcode/0319.Bulb-Switcher/319.Bulb Switcher.go b/leetcode/0319.Bulb-Switcher/319.Bulb Switcher.go
new file mode 100644
index 000000000..fba8ea41e
--- /dev/null
+++ b/leetcode/0319.Bulb-Switcher/319.Bulb Switcher.go
@@ -0,0 +1,7 @@
+package leetcode
+
+import "math"
+
+func bulbSwitch(n int) int {
+ return int(math.Sqrt(float64(n)))
+}
diff --git a/leetcode/0319.Bulb-Switcher/319.Bulb Switcher_test.go b/leetcode/0319.Bulb-Switcher/319.Bulb Switcher_test.go
new file mode 100644
index 000000000..81f40a62e
--- /dev/null
+++ b/leetcode/0319.Bulb-Switcher/319.Bulb Switcher_test.go
@@ -0,0 +1,50 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question319 struct {
+ para319
+ ans319
+}
+
+// para 是参数
+type para319 struct {
+ n int
+}
+
+// ans 是答案
+type ans319 struct {
+ ans int
+}
+
+func Test_Problem319(t *testing.T) {
+
+ qs := []question319{
+
+ {
+ para319{3},
+ ans319{1},
+ },
+
+ {
+ para319{0},
+ ans319{0},
+ },
+
+ {
+ para319{1},
+ ans319{1},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 319------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans319, q.para319
+ fmt.Printf("【input】:%v 【output】:%v\n", p, bulbSwitch(p.n))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/0319.Bulb-Switcher/README.md b/leetcode/0319.Bulb-Switcher/README.md
new file mode 100644
index 000000000..830228df8
--- /dev/null
+++ b/leetcode/0319.Bulb-Switcher/README.md
@@ -0,0 +1,58 @@
+# [319. Bulb Switcher](https://leetcode.com/problems/bulb-switcher/)
+
+
+## 题目
+
+There are n bulbs that are initially off. You first turn on all the bulbs, then you turn off every second bulb.
+
+On the third round, you toggle every third bulb (turning on if it's off or turning off if it's on). For the ith round, you toggle every i bulb. For the nth round, you only toggle the last bulb.
+
+Return the number of bulbs that are on after n rounds.
+
+**Example 1:**
+
+ Input: n = 3
+ Output: 1
+ Explanation: At first, the three bulbs are [off, off, off].
+ After the first round, the three bulbs are [on, on, on].
+ After the second round, the three bulbs are [on, off, on].
+ After the third round, the three bulbs are [on, off, off].
+ So you should return 1 because there is only one bulb is on.
+
+**Example 2:**
+
+ Input: n = 0
+ Output: 0
+
+**Example 3:**
+
+ Input: n = 1
+ Output: 1
+
+## 题目大意
+
+初始时有 n 个灯泡处于关闭状态。第一轮，你将会打开所有灯泡。接下来的第二轮，你将会每两个灯泡关闭一个。
+
+第三轮，你每三个灯泡就切换一个灯泡的开关（即，打开变关闭，关闭变打开）。第 i 轮，你每 i 个灯泡就切换一个灯泡的开关。直到第 n 轮，你只需要切换最后一个灯泡的开关。
+
+找出并返回 n 轮后有多少个亮着的灯泡。
+
+## 解题思路
+
+- 计算 1 到 n 中有奇数个约数的个数
+- 1 到 n 中的某个数 x 有奇数个约数,也即 x 是完全平方数
+- 计算 1 到 n 中完全平方数的个数 sqrt(n)
+
+## 代码
+
+```go
+
+package leetcode
+
+import "math"
+
+func bulbSwitch(n int) int {
+ return int(math.Sqrt(float64(n)))
+}
+
+```
\ No newline at end of file
diff --git a/leetcode/0327.Count-of-Range-Sum/327. Count of Range Sum.go b/leetcode/0327.Count-of-Range-Sum/327. Count of Range Sum.go
index 281594d3c..68c7b4665 100644
--- a/leetcode/0327.Count-of-Range-Sum/327. Count of Range Sum.go
+++ b/leetcode/0327.Count-of-Range-Sum/327. Count of Range Sum.go
@@ -40,8 +40,39 @@ func countRangeSum(nums []int, lower int, upper int) int {
return res
}
-// 解法二 暴力，时间复杂度 O(n^2)
+// 解法二 树状数组，时间复杂度 O(n log n)
func countRangeSum1(nums []int, lower int, upper int) int {
+ n := len(nums)
+ // 计算前缀和 preSum，以及后面统计时会用到的所有数字 allNums
+ allNums, preSum, res := make([]int, 1, 3*n+1), make([]int, n+1), 0
+ for i, v := range nums {
+ preSum[i+1] = preSum[i] + v
+ allNums = append(allNums, preSum[i+1], preSum[i+1]-lower, preSum[i+1]-upper)
+ }
+ // 将 allNums 离散化
+ sort.Ints(allNums)
+ k := 1
+ kth := map[int]int{allNums[0]: k}
+ for i := 1; i <= 3*n; i++ {
+ if allNums[i] != allNums[i-1] {
+ k++
+ kth[allNums[i]] = k
+ }
+ }
+ // 遍历 preSum，利用树状数组计算每个前缀和对应的合法区间数
+ bit := template.BinaryIndexedTree{}
+ bit.Init(k)
+ bit.Add(kth[0], 1)
+ for _, sum := range preSum[1:] {
+ left, right := kth[sum-upper], kth[sum-lower]
+ res += bit.Query(right) - bit.Query(left-1)
+ bit.Add(kth[sum], 1)
+ }
+ return res
+}
+
+// 解法三 暴力，时间复杂度 O(n^2)
+func countRangeSum2(nums []int, lower int, upper int) int {
res, n := 0, len(nums)
for i := 0; i < n; i++ {
tmp := 0
diff --git a/leetcode/0327.Count-of-Range-Sum/README.md b/leetcode/0327.Count-of-Range-Sum/README.md
index e764348c7..be08237ff 100755
--- a/leetcode/0327.Count-of-Range-Sum/README.md
+++ b/leetcode/0327.Count-of-Range-Sum/README.md
@@ -17,11 +17,10 @@ Given an integer array `nums`, return the number of range sums that lie in `[l
## 题目大意
-给定一个整数数组 nums，返回区间和在 [lower, upper] 之间的个数，包含 lower 和 upper。区间和 S(i, j) 表示在 nums 中，位置从 i 到 j 的元素之和，包含 i 和 j (i ≤ j)。
-
-说明:
-最直观的算法复杂度是 O(n^2) ，请在此基础上优化你的算法。
+给定一个整数数组 nums 。区间和 S(i, j) 表示在 nums 中，位置从 i 到 j 的元素之和，包含 i 和 j (i ≤ j)。请你以下标 i （0 <= i <= nums.length ）为起点，元素个数逐次递增，计算子数组内的元素和。当元素和落在范围 [lower, upper] （包含 lower 和 upper）之内时，记录子数组当前最末元素下标 j ，记作 有效 区间和 S(i, j) 。求数组中，值位于范围 [lower, upper] （包含 lower 和 upper）之内的 有效 区间和的个数。
+注意：
+最直观的算法复杂度是 O(n2) ，请在此基础上优化你的算法。
## 解题思路
@@ -75,3 +74,5 @@ Given an integer array `nums`, return the number of range sums that lie in `[l
这时候查找区间变为了 `[-3 + prefixSum[0-1], -1 + prefixSum[0-1]] = [-3,-1]`，注意 `prefixSum[-1] = 0`，即判断 `-3 ≤ sum(0, 0,1,2,3,4,5) ≤ -1`，满足等式的有几种情况，这里有六种情况，即 `j = 0`、`j = 1`、`j = 2`、 `j = 3` 、`j = 4` 或者 `j = 5`，满足等式的有 `j = 0`、`j = 1`、 `j = 3` 和 `j = 5`，即 `-3 ≤ sum(0, 0) ≤ -1` 、 `-3 ≤ sum(0, 1) ≤ -1`、`-3 ≤ sum(0, 3) ≤ -1` 和 `-3 ≤ sum(0, 5) ≤ -1`。所以这一步 `res = 4`。最后的答案就是把每一步的结果都累加，`res = 1 + 0 + 2 + 0 + 0 + 4 = 7`。
+
+- 此题同样可以用树状数组来解答。同样把问题先转化成区间 Query 的模型，`lower ≤ prefixSum(j) - prefixSum(i-1) ≤ upper` 等价于 `prefixSum(j) - upper ≤ prefixSum(i-1) ≤ prefixSum(j) - lower`，`i` 的取值在 `[0,j-1]` 区间内。所以题目可以转化为 `i` 在 `[0,j-1]` 区间内取值，问数组 `prefixSum[0...j-1]` 中的所有取值，位于区间 `[prefixSum(j) - upper, prefixSum(j) - lower]` 内的次数。在树状数组中，区间内的前缀和可以转化为 2 个区间的前缀和相减，即 `Query([i,j]) = Query(j) - Query(i-1)`。所以这道题枚举数组 `prefixSum[0...j-1]` 中每个值是否出现在指定区间内出现次数即可。第一步先将所有的前缀和 `prefixSum(j)` 以及 `[prefixSum(j) - upper, prefixSum(j) - lower]` 计算出来。第二步排序和离散化，离散化以后的点区间为 `[1,n]`。最后根据数组 `prefixSum(j)` 的值在指定区间内查询出现次数即可。相同的套路题有，第 315 题，第 493 题。
\ No newline at end of file
diff --git a/leetcode/0328.Odd-Even-Linked-List/README.md b/leetcode/0328.Odd-Even-Linked-List/README.md
index 760a9e596..4caa26c68 100644
--- a/leetcode/0328.Odd-Even-Linked-List/README.md
+++ b/leetcode/0328.Odd-Even-Linked-List/README.md
@@ -31,4 +31,4 @@ Note:
## 解题思路
-这道题思路也是一样的，分别把奇数和偶数都放在 2 个链表中，最后首尾拼接就是答案。
\ No newline at end of file
+这道题思路也是一样的，分别把奇数节点和偶数节点都放在 2 个链表中，最后首尾拼接就是答案。
diff --git a/leetcode/0341.Flatten-Nested-List-Iterator/341. Flatten Nested List Iterator.go b/leetcode/0341.Flatten-Nested-List-Iterator/341. Flatten Nested List Iterator.go
new file mode 100644
index 000000000..02a1d3e31
--- /dev/null
+++ b/leetcode/0341.Flatten-Nested-List-Iterator/341. Flatten Nested List Iterator.go
@@ -0,0 +1,72 @@
+package leetcode
+
+import "container/list"
+
+// This is the interface that allows for creating nested lists.
+// You should not implement it, or speculate about its implementation
+type NestedInteger struct {
+}
+
+// Return true if this NestedInteger holds a single integer, rather than a nested list.
+func (this NestedInteger) IsInteger() bool { return true }
+
+// Return the single integer that this NestedInteger holds, if it holds a single integer
+// The result is undefined if this NestedInteger holds a nested list
+// So before calling this method, you should have a check
+func (this NestedInteger) GetInteger() int { return 0 }
+
+// Set this NestedInteger to hold a single integer.
+func (n *NestedInteger) SetInteger(value int) {}
+
+// Set this NestedInteger to hold a nested list and adds a nested integer to it.
+func (this *NestedInteger) Add(elem NestedInteger) {}
+
+// Return the nested list that this NestedInteger holds, if it holds a nested list
+// The list length is zero if this NestedInteger holds a single integer
+// You can access NestedInteger's List element directly if you want to modify it
+func (this NestedInteger) GetList() []*NestedInteger { return nil }
+
+type NestedIterator struct {
+ stack *list.List
+}
+
+type listIndex struct {
+ nestedList []*NestedInteger
+ index int
+}
+
+func Constructor(nestedList []*NestedInteger) *NestedIterator {
+ stack := list.New()
+ stack.PushBack(&listIndex{nestedList, 0})
+ return &NestedIterator{stack}
+}
+
+func (this *NestedIterator) Next() int {
+ if !this.HasNext() {
+ return -1
+ }
+ last := this.stack.Back().Value.(*listIndex)
+ nestedList, i := last.nestedList, last.index
+ val := nestedList[i].GetInteger()
+ last.index++
+ return val
+}
+
+func (this *NestedIterator) HasNext() bool {
+ stack := this.stack
+ for stack.Len() > 0 {
+ last := stack.Back().Value.(*listIndex)
+ nestedList, i := last.nestedList, last.index
+ if i >= len(nestedList) {
+ stack.Remove(stack.Back())
+ } else {
+ val := nestedList[i]
+ if val.IsInteger() {
+ return true
+ }
+ last.index++
+ stack.PushBack(&listIndex{val.GetList(), 0})
+ }
+ }
+ return false
+}
diff --git a/leetcode/0341.Flatten-Nested-List-Iterator/341. Flatten Nested List Iterator_test.go b/leetcode/0341.Flatten-Nested-List-Iterator/341. Flatten Nested List Iterator_test.go
new file mode 100644
index 000000000..b81c22c4a
--- /dev/null
+++ b/leetcode/0341.Flatten-Nested-List-Iterator/341. Flatten Nested List Iterator_test.go
@@ -0,0 +1,13 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+func Test_Problem338(t *testing.T) {
+ obj := Constructor([]*NestedInteger{})
+ fmt.Printf("obj = %v\n", obj)
+ fmt.Printf("obj = %v\n", obj.Next())
+ fmt.Printf("obj = %v\n", obj.HasNext())
+}
diff --git a/leetcode/0341.Flatten-Nested-List-Iterator/README.md b/leetcode/0341.Flatten-Nested-List-Iterator/README.md
new file mode 100644
index 000000000..5d04e5e02
--- /dev/null
+++ b/leetcode/0341.Flatten-Nested-List-Iterator/README.md
@@ -0,0 +1,110 @@
+# [341. Flatten Nested List Iterator](https://leetcode.com/problems/flatten-nested-list-iterator/)
+
+
+## 题目
+
+Given a nested list of integers, implement an iterator to flatten it.
+
+Each element is either an integer, or a list -- whose elements may also be integers or other lists.
+
+**Example 1:**
+
+```
+Input:[[1,1],2,[1,1]]
+Output:[1,1,2,1,1]
+Explanation:By callingnext repeatedly untilhasNext returns false,
+ the order of elements returned bynext should be:[1,1,2,1,1].
+```
+
+**Example 2:**
+
+```
+Input:[1,[4,[6]]]
+Output:[1,4,6]
+Explanation:By callingnext repeatedly untilhasNext returns false,
+ the order of elements returned bynext should be:[1,4,6].
+
+```
+
+## 题目大意
+
+给你一个嵌套的整型列表。请你设计一个迭代器，使其能够遍历这个整型列表中的所有整数。列表中的每一项或者为一个整数，或者是另一个列表。其中列表的元素也可能是整数或是其他列表。
+
+## 解题思路
+
+- 题目要求实现一个嵌套版的数组。可以用 `[]int` 实现，也可以用链表实现。笔者此处用链表实现。外层构造一个一维数组，一维数组内部每个元素是一个链表。额外还需要记录这个嵌套链表在原数组中的 `index` 索引。`Next()` 实现比较简单，取出对应的嵌套节点。`HasNext()` 方法则感觉嵌套节点里面的 `index` 信息判断是否还有 `next` 元素。
+
+## 代码
+
+```go
+/**
+ * // This is the interface that allows for creating nested lists.
+ * // You should not implement it, or speculate about its implementation
+ * type NestedInteger struct {
+ * }
+ *
+ * // Return true if this NestedInteger holds a single integer, rather than a nested list.
+ * func (this NestedInteger) IsInteger() bool {}
+ *
+ * // Return the single integer that this NestedInteger holds, if it holds a single integer
+ * // The result is undefined if this NestedInteger holds a nested list
+ * // So before calling this method, you should have a check
+ * func (this NestedInteger) GetInteger() int {}
+ *
+ * // Set this NestedInteger to hold a single integer.
+ * func (n *NestedInteger) SetInteger(value int) {}
+ *
+ * // Set this NestedInteger to hold a nested list and adds a nested integer to it.
+ * func (this *NestedInteger) Add(elem NestedInteger) {}
+ *
+ * // Return the nested list that this NestedInteger holds, if it holds a nested list
+ * // The list length is zero if this NestedInteger holds a single integer
+ * // You can access NestedInteger's List element directly if you want to modify it
+ * func (this NestedInteger) GetList() []*NestedInteger {}
+ */
+
+type NestedIterator struct {
+ stack *list.List
+}
+
+type listIndex struct {
+ nestedList []*NestedInteger
+ index int
+}
+
+func Constructor(nestedList []*NestedInteger) *NestedIterator {
+ stack := list.New()
+ stack.PushBack(&listIndex{nestedList, 0})
+ return &NestedIterator{stack}
+}
+
+func (this *NestedIterator) Next() int {
+ if !this.HasNext() {
+ return -1
+ }
+ last := this.stack.Back().Value.(*listIndex)
+ nestedList, i := last.nestedList, last.index
+ val := nestedList[i].GetInteger()
+ last.index++
+ return val
+}
+
+func (this *NestedIterator) HasNext() bool {
+ stack := this.stack
+ for stack.Len() > 0 {
+ last := stack.Back().Value.(*listIndex)
+ nestedList, i := last.nestedList, last.index
+ if i >= len(nestedList) {
+ stack.Remove(stack.Back())
+ } else {
+ val := nestedList[i]
+ if val.IsInteger() {
+ return true
+ }
+ last.index++
+ stack.PushBack(&listIndex{val.GetList(), 0})
+ }
+ }
+ return false
+}
+```
\ No newline at end of file
diff --git a/leetcode/0345.Reverse-Vowels-of-a-String/345. Reverse Vowels of a String.go b/leetcode/0345.Reverse-Vowels-of-a-String/345. Reverse Vowels of a String.go
index 3bd3fbee3..ff1e1be04 100644
--- a/leetcode/0345.Reverse-Vowels-of-a-String/345. Reverse Vowels of a String.go
+++ b/leetcode/0345.Reverse-Vowels-of-a-String/345. Reverse Vowels of a String.go
@@ -3,25 +3,22 @@ package leetcode
func reverseVowels(s string) string {
b := []byte(s)
for i, j := 0, len(b)-1; i < j; {
- if isVowels(b[i]) && isVowels(b[j]) {
- b[i], b[j] = b[j], b[i]
- i++
- j--
- } else if isVowels(b[i]) && !isVowels(b[j]) {
- j--
- } else if !isVowels(b[i]) && isVowels(b[j]) {
- i++
- } else {
+ if !isVowel(b[i]) {
i++
+ continue
+ }
+ if !isVowel(b[j]) {
j--
+ continue
}
+ b[i], b[j] = b[j], b[i]
+ i++
+ j--
}
return string(b)
}
-func isVowels(s byte) bool {
- if s == 'a' || s == 'e' || s == 'i' || s == 'o' || s == 'u' || s == 'A' || s == 'E' || s == 'I' || s == 'O' || s == 'U' {
- return true
- }
- return false
+func isVowel(s byte) bool {
+ return s == 'a' || s == 'e' || s == 'i' || s == 'o' || s == 'u' || s == 'A' ||
+ s == 'E' || s == 'I' || s == 'O' || s == 'U'
}
diff --git a/leetcode/0352.Data-Stream-as-Disjoint-Intervals/352.Data Stream as Disjoint Intervals.go b/leetcode/0352.Data-Stream-as-Disjoint-Intervals/352.Data Stream as Disjoint Intervals.go
new file mode 100644
index 000000000..84d382d12
--- /dev/null
+++ b/leetcode/0352.Data-Stream-as-Disjoint-Intervals/352.Data Stream as Disjoint Intervals.go
@@ -0,0 +1,49 @@
+package leetcode
+
+import "sort"
+
+type SummaryRanges struct {
+ nums []int
+ mp map[int]int
+}
+
+func Constructor() SummaryRanges {
+ return SummaryRanges{
+ nums: []int{},
+ mp: map[int]int{},
+ }
+}
+
+func (this *SummaryRanges) AddNum(val int) {
+ if _, ok := this.mp[val]; !ok {
+ this.mp[val] = 1
+ this.nums = append(this.nums, val)
+ }
+ sort.Ints(this.nums)
+}
+
+func (this *SummaryRanges) GetIntervals() [][]int {
+ n := len(this.nums)
+ var ans [][]int
+ if n == 0 {
+ return ans
+ }
+ if n == 1 {
+ ans = append(ans, []int{this.nums[0], this.nums[0]})
+ return ans
+ }
+ start, end := this.nums[0], this.nums[0]
+ ans = append(ans, []int{start, end})
+ index := 0
+ for i := 1; i < n; i++ {
+ if this.nums[i] == end+1 {
+ end = this.nums[i]
+ ans[index][1] = end
+ } else {
+ start, end = this.nums[i], this.nums[i]
+ ans = append(ans, []int{start, end})
+ index++
+ }
+ }
+ return ans
+}
diff --git a/leetcode/0352.Data-Stream-as-Disjoint-Intervals/352.Data Stream as Disjoint Intervals_test.go b/leetcode/0352.Data-Stream-as-Disjoint-Intervals/352.Data Stream as Disjoint Intervals_test.go
new file mode 100644
index 000000000..b19897391
--- /dev/null
+++ b/leetcode/0352.Data-Stream-as-Disjoint-Intervals/352.Data Stream as Disjoint Intervals_test.go
@@ -0,0 +1,63 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question352 struct {
+ para352
+ ans352
+}
+
+// para 是参数
+type para352 struct {
+ para string
+ num int
+}
+
+// ans 是答案
+type ans352 struct {
+ ans [][]int
+}
+
+func Test_Problem352(t *testing.T) {
+
+ qs := []question352{
+
+ {
+ para352{"addNum", 1},
+ ans352{[][]int{{1, 1}}},
+ },
+
+ {
+ para352{"addNum", 3},
+ ans352{[][]int{{1, 1}, {3, 3}}},
+ },
+
+ {
+ para352{"addNum", 7},
+ ans352{[][]int{{1, 1}, {3, 3}, {7, 7}}},
+ },
+
+ {
+ para352{"addNum", 2},
+ ans352{[][]int{{1, 3}, {7, 7}}},
+ },
+
+ {
+ para352{"addNum", 6},
+ ans352{[][]int{{1, 3}, {6, 7}}},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 352------------------------\n")
+
+ obj := Constructor()
+ for _, q := range qs {
+ _, p := q.ans352, q.para352
+ obj.AddNum(p.num)
+ fmt.Printf("【input】:%v 【output】:%v\n", p, obj.GetIntervals())
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/0352.Data-Stream-as-Disjoint-Intervals/README.md b/leetcode/0352.Data-Stream-as-Disjoint-Intervals/README.md
new file mode 100644
index 000000000..a3f7abd75
--- /dev/null
+++ b/leetcode/0352.Data-Stream-as-Disjoint-Intervals/README.md
@@ -0,0 +1,108 @@
+# [352. Data Stream as Disjoint Intervals](https://leetcode.com/problems/data-stream-as-disjoint-intervals/)
+
+
+## 题目
+
+Given a data stream input of non-negative integers a1, a2, ..., an, summarize the numbers seen so far as a list of disjoint intervals.
+
+Implement the SummaryRanges class:
+
+ - SummaryRanges() Initializes the object with an empty stream.
+ - void addNum(int val) Adds the integer val to the stream.
+ - int[][] getIntervals() Returns a summary of the integers in the stream currently as a list of disjoint intervals [starti, endi].
+
+**Example 1:**
+
+ Input
+ ["SummaryRanges", "addNum", "getIntervals", "addNum", "getIntervals", "addNum", "getIntervals", "addNum", "getIntervals", "addNum", "getIntervals"]
+ [[], [1], [], [3], [], [7], [], [2], [], [6], []]
+ Output
+ [null, null, [[1, 1]], null, [[1, 1], [3, 3]], null, [[1, 1], [3, 3], [7, 7]], null, [[1, 3], [7, 7]], null, [[1, 3], [6, 7]]]
+
+ Explanation
+ SummaryRanges summaryRanges = new SummaryRanges();
+ summaryRanges.addNum(1); // arr = [1]
+ summaryRanges.getIntervals(); // return [[1, 1]]
+ summaryRanges.addNum(3); // arr = [1, 3]
+ summaryRanges.getIntervals(); // return [[1, 1], [3, 3]]
+ summaryRanges.addNum(7); // arr = [1, 3, 7]
+ summaryRanges.getIntervals(); // return [[1, 1], [3, 3], [7, 7]]
+ summaryRanges.addNum(2); // arr = [1, 2, 3, 7]
+ summaryRanges.getIntervals(); // return [[1, 3], [7, 7]]
+ summaryRanges.addNum(6); // arr = [1, 2, 3, 6, 7]
+ summaryRanges.getIntervals(); // return [[1, 3], [6, 7]]
+
+**Constraints**
+
+ - 0 <= val <= 10000
+ - At most 3 * 10000 calls will be made to addNum and getIntervals.
+
+## 题目大意
+
+给你一个由非负整数a1, a2, ..., an 组成的数据流输入，请你将到目前为止看到的数字总结为不相交的区间列表。
+
+实现 SummaryRanges 类：
+
+ - SummaryRanges() 使用一个空数据流初始化对象。
+ - void addNum(int val) 向数据流中加入整数 val 。
+ - int[][] getIntervals() 以不相交区间[starti, endi] 的列表形式返回对数据流中整数的总结
+
+## 解题思路
+
+- 使用字典过滤掉重复的数字
+- 把过滤后的数字放到nums中,并进行排序
+- 使用nums构建不重复的区间
+
+## 代码
+
+```go
+package leetcode
+
+import "sort"
+
+type SummaryRanges struct {
+ nums []int
+ mp map[int]int
+}
+
+func Constructor() SummaryRanges {
+ return SummaryRanges{
+ nums: []int{},
+ mp : map[int]int{},
+ }
+}
+
+func (this *SummaryRanges) AddNum(val int) {
+ if _, ok := this.mp[val]; !ok {
+ this.mp[val] = 1
+ this.nums = append(this.nums, val)
+ }
+ sort.Ints(this.nums)
+}
+
+func (this *SummaryRanges) GetIntervals() [][]int {
+ n := len(this.nums)
+ var ans [][]int
+ if n == 0 {
+ return ans
+ }
+ if n == 1 {
+ ans = append(ans, []int{this.nums[0], this.nums[0]})
+ return ans
+ }
+ start, end := this.nums[0], this.nums[0]
+ ans = append(ans, []int{start, end})
+ index := 0
+ for i := 1; i < n; i++ {
+ if this.nums[i] == end + 1 {
+ end = this.nums[i]
+ ans[index][1] = end
+ } else {
+ start, end = this.nums[i], this.nums[i]
+ ans = append(ans, []int{start, end})
+ index++
+ }
+ }
+ return ans
+}
+```
\ No newline at end of file
diff --git a/leetcode/0368.Largest-Divisible-Subset/368. Largest Divisible Subset.go b/leetcode/0368.Largest-Divisible-Subset/368. Largest Divisible Subset.go
new file mode 100644
index 000000000..3888ff768
--- /dev/null
+++ b/leetcode/0368.Largest-Divisible-Subset/368. Largest Divisible Subset.go
@@ -0,0 +1,33 @@
+package leetcode
+
+import "sort"
+
+func largestDivisibleSubset(nums []int) []int {
+ sort.Ints(nums)
+ dp, res := make([]int, len(nums)), []int{}
+ for i := range dp {
+ dp[i] = 1
+ }
+ maxSize, maxVal := 1, 1
+ for i := 1; i < len(nums); i++ {
+ for j, v := range nums[:i] {
+ if nums[i]%v == 0 && dp[j]+1 > dp[i] {
+ dp[i] = dp[j] + 1
+ }
+ }
+ if dp[i] > maxSize {
+ maxSize, maxVal = dp[i], nums[i]
+ }
+ }
+ if maxSize == 1 {
+ return []int{nums[0]}
+ }
+ for i := len(nums) - 1; i >= 0 && maxSize > 0; i-- {
+ if dp[i] == maxSize && maxVal%nums[i] == 0 {
+ res = append(res, nums[i])
+ maxVal = nums[i]
+ maxSize--
+ }
+ }
+ return res
+}
diff --git a/leetcode/0368.Largest-Divisible-Subset/368. Largest Divisible Subset_test.go b/leetcode/0368.Largest-Divisible-Subset/368. Largest Divisible Subset_test.go
new file mode 100644
index 000000000..558e75a04
--- /dev/null
+++ b/leetcode/0368.Largest-Divisible-Subset/368. Largest Divisible Subset_test.go
@@ -0,0 +1,47 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question368 struct {
+ para368
+ ans368
+}
+
+// para 是参数
+// one 代表第一个参数
+type para368 struct {
+ one []int
+}
+
+// ans 是答案
+// one 代表第一个答案
+type ans368 struct {
+ one []int
+}
+
+func Test_Problem368(t *testing.T) {
+
+ qs := []question368{
+
+ {
+ para368{[]int{1, 2, 3}},
+ ans368{[]int{1, 2}},
+ },
+
+ {
+ para368{[]int{1, 2, 4, 8}},
+ ans368{[]int{1, 2, 4, 8}},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 368------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans368, q.para368
+ fmt.Printf("【input】:%v 【output】:%v\n", p, largestDivisibleSubset(p.one))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/0368.Largest-Divisible-Subset/README.md b/leetcode/0368.Largest-Divisible-Subset/README.md
new file mode 100644
index 000000000..53eb0fa92
--- /dev/null
+++ b/leetcode/0368.Largest-Divisible-Subset/README.md
@@ -0,0 +1,86 @@
+# [368. Largest Divisible Subset](https://leetcode.com/problems/largest-divisible-subset/)
+
+
+## 题目
+
+Given a set of **distinct** positive integers `nums`, return the largest subset `answer` such that every pair `(answer[i], answer[j])` of elements in this subset satisfies:
+
+- `answer[i] % answer[j] == 0`, or
+- `answer[j] % answer[i] == 0`
+
+If there are multiple solutions, return any of them.
+
+**Example 1:**
+
+```
+Input: nums = [1,2,3]
+Output: [1,2]
+Explanation: [1,3] is also accepted.
+
+```
+
+**Example 2:**
+
+```
+Input: nums = [1,2,4,8]
+Output: [1,2,4,8]
+
+```
+
+**Constraints:**
+
+- `1 <= nums.length <= 1000`
+- `1 <= nums[i] <= 2 * 109`
+- All the integers in `nums` are **unique**.
+
+## 题目大意
+
+给你一个由 无重复 正整数组成的集合 nums ，请你找出并返回其中最大的整除子集 answer ，子集中每一元素对 (answer[i], answer[j]) 都应当满足：
+
+- answer[i] % answer[j] == 0 ，或
+- answer[j] % answer[i] == 0
+
+如果存在多个有效解子集，返回其中任何一个均可。
+
+## 解题思路
+
+- 根据题目数据规模 1000，可以估计此题大概率是动态规划，并且时间复杂度是 O(n^2)。先将集合排序，以某一个小的数作为基准，不断的选择能整除的数加入集合。按照这个思路考虑，此题和第 300 题经典的 LIS 解题思路一致。只不过 LIS 每次选择更大的数，此题除了选择更大的数，只不过多了一个判断，这个更大的数能否整除当前集合里面的所有元素。按照此法一定可以找出最大的集合。
+- 剩下的问题是如何输出最大集合。这道题的集合具有重叠子集的性质，例如 [2,4,8,16] 这个集合，长度是 4，它一定包含长度为 3 的子集，因为从它里面随便取 3 个数形成的子集也满足元素相互能整除的条件。同理，它也一定包含长度为 2，长度为 1 的子集。由于有这个性质，可以利用 dp 数组里面的数据，输出最大集合。例如，[2,4,6,8,9,13,16,40]，由动态规划可以找到最大集合是 [2,4,8,16]。长度为 4 的找到了，再找长度为 3 的，[2,4,8]，[2,4,40]。在最大集合中，最大元素是 16，所以 [2,4,40] 这个集合排除，它的最大元素大于 16。选定 [2,4,8] 这个集合，此时最大元素是 8 。以此类推，筛选到最后，便可以输出 [16,8,4,2] 这个组最大集合的答案了。
+
+## 代码
+
+```go
+package leetcode
+
+import "sort"
+
+func largestDivisibleSubset(nums []int) []int {
+ sort.Ints(nums)
+ dp, res := make([]int, len(nums)), []int{}
+ for i := range dp {
+ dp[i] = 1
+ }
+ maxSize, maxVal := 1, 1
+ for i := 1; i < len(nums); i++ {
+ for j, v := range nums[:i] {
+ if nums[i]%v == 0 && dp[j]+1 > dp[i] {
+ dp[i] = dp[j] + 1
+ }
+ }
+ if dp[i] > maxSize {
+ maxSize, maxVal = dp[i], nums[i]
+ }
+ }
+ if maxSize == 1 {
+ return []int{nums[0]}
+ }
+ for i := len(nums) - 1; i >= 0 && maxSize > 0; i-- {
+ if dp[i] == maxSize && maxVal%nums[i] == 0 {
+ res = append(res, nums[i])
+ maxVal = nums[i]
+ maxSize--
+ }
+ }
+ return res
+}
+```
\ No newline at end of file
diff --git a/leetcode/0372.Super-Pow/372. Super Pow.go b/leetcode/0372.Super-Pow/372. Super Pow.go
index aacc6c7ae..3f4082c7a 100644
--- a/leetcode/0372.Super-Pow/372. Super Pow.go
+++ b/leetcode/0372.Super-Pow/372. Super Pow.go
@@ -8,10 +8,11 @@ package leetcode
// 模运算性质五：ab % p = ((a % p) * ( b % p)) % p, 其中 ab 是一个数字，如:2874，98374 等等
// 举个例子
// 12345^678 % 1337 = (12345^670 * 12345^8) % 1337
-// = ((12345^670 % 1337) * (12345^8 % 1337)) % 1337 ---> 利用性质 三
+//
+// = ((12345^670 % 1337) * (12345^8 % 1337)) % 1337 ---> 利用性质 三
// = (((12345^67)^10 % 1337) * (12345^8 % 1337)) % 1337 ---> 乘方性质
-// = ((12345^67 % 1337)^10) % 1337 * (12345^8 % 1337)) % 1337 ---> 利用性质 四
-// = (((12345^67 % 1337)^10) * (12345^8 % 1337)) % 1337 ---> 反向利用性质 三
+// = ((12345^67 % 1337)^10) % 1337 * (12345^8 % 1337)) % 1337 ---> 利用性质 四
+// = (((12345^67 % 1337)^10) * (12345^8 % 1337)) % 1337 ---> 反向利用性质 三
func superPow(a int, b []int) int {
res := 1
for i := 0; i < len(b); i++ {
diff --git a/leetcode/0372.Super-Pow/README.md b/leetcode/0372.Super-Pow/README.md
index a08d0858a..8d7bcc7b7 100755
--- a/leetcode/0372.Super-Pow/README.md
+++ b/leetcode/0372.Super-Pow/README.md
@@ -30,14 +30,13 @@ Your task is to calculate ab mod 1337 where a is a positive integer and b
模运算性质二：(a - b) % p = (a % p - b % p + p) % p
模运算性质三：(a * b) % p = (a % p * b % p) % p
模运算性质四：a ^ b % p = ((a % p)^b) % p
- 模运算性质五：ab % p = ((a % p) * ( b % p)) % p, 其中 ab 是一个数字，如:2874，98374 等等
- 这一题需要用到性质三、四、五。举个例子：
+ 这一题需要用到性质三、四。举个例子：
12345^678 % 1337 = (12345^670 * 12345^8) % 1337
- = ((12345^670 % 1337) * (12345^8 % 1337)) % 1337 ---> 利用性质 三
- = (((12345^67)^10 % 1337) * (12345^8 % 1337)) % 1337 ---> 乘方性质
- = ((12345^67 % 1337)^10) % 1337 * (12345^8 % 1337)) % 1337 ---> 利用性质 四
- = (((12345^67 % 1337)^10) * (12345^8 % 1337)) % 1337 ---> 反向利用性质 三
+ = ((12345^670 % 1337) * (12345^8 % 1337)) % 1337 ---> 利用性质 三
+ = (((12345^67)^10 % 1337) * (12345^8 % 1337)) % 1337 ---> 乘方性质
+ = ((12345^67 % 1337)^10) % 1337 * (12345^8 % 1337)) % 1337 ---> 利用性质 四
+ = (((12345^67 % 1337)^10) * (12345^8 % 1337)) % 1337 ---> 反向利用性质 三
经过上面这样的变换，把指数 678 的个位分离出来了，可以单独求解。继续经过上面的变换，可以把指数的 6 和 7 也分离出来。最终可以把大数 b 一位一位的分离出来。至于计算 a^b 就结果快速幂求解。
diff --git a/leetcode/0374.Guess-Number-Higher-or-Lower/374. Guess Number Higher or Lower.go b/leetcode/0374.Guess-Number-Higher-or-Lower/374. Guess Number Higher or Lower.go
new file mode 100644
index 000000000..fafc4a8c4
--- /dev/null
+++ b/leetcode/0374.Guess-Number-Higher-or-Lower/374. Guess Number Higher or Lower.go
@@ -0,0 +1,20 @@
+package leetcode
+
+import "sort"
+
+/**
+ * Forward declaration of guess API.
+ * @param num your guess
+ * @return -1 if num is lower than the guess number
+ * 1 if num is higher than the guess number
+ * otherwise return 0
+ * func guess(num int) int;
+ */
+
+func guessNumber(n int) int {
+ return sort.Search(n, func(x int) bool { return guess(x) <= 0 })
+}
+
+func guess(num int) int {
+ return 0
+}
diff --git a/leetcode/0374.Guess-Number-Higher-or-Lower/374. Guess Number Higher or Lower_test.go b/leetcode/0374.Guess-Number-Higher-or-Lower/374. Guess Number Higher or Lower_test.go
new file mode 100644
index 000000000..9c66680cc
--- /dev/null
+++ b/leetcode/0374.Guess-Number-Higher-or-Lower/374. Guess Number Higher or Lower_test.go
@@ -0,0 +1,58 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question374 struct {
+ para374
+ ans374
+}
+
+// para 是参数
+// one 代表第一个参数
+type para374 struct {
+ n int
+}
+
+// ans 是答案
+// one 代表第一个答案
+type ans374 struct {
+ one int
+}
+
+func Test_Problem374(t *testing.T) {
+
+ qs := []question374{
+
+ {
+ para374{10},
+ ans374{6},
+ },
+
+ {
+ para374{1},
+ ans374{1},
+ },
+
+ {
+ para374{2},
+ ans374{1},
+ },
+
+ {
+ para374{2},
+ ans374{2},
+ },
+ // 如需多个测试，可以复制上方元素。
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 374------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans374, q.para374
+ fmt.Printf("【input】:%v 【output】:%v\n", p, guessNumber(p.n))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/0374.Guess-Number-Higher-or-Lower/README.md b/leetcode/0374.Guess-Number-Higher-or-Lower/README.md
new file mode 100644
index 000000000..795efe6f3
--- /dev/null
+++ b/leetcode/0374.Guess-Number-Higher-or-Lower/README.md
@@ -0,0 +1,94 @@
+# [374. Guess Number Higher or Lower](https://leetcode.com/problems/guess-number-higher-or-lower/)
+
+## 题目
+
+We are playing the Guess Game. The game is as follows:
+
+I pick a number from `1` to `n`. You have to guess which number I picked.
+
+Every time you guess wrong, I will tell you whether the number I picked is higher or lower than your guess.
+
+You call a pre-defined API `int guess(int num)`, which returns 3 possible results:
+
+- `1`: The number I picked is lower than your guess (i.e. `pick < num`).
+- `1`: The number I picked is higher than your guess (i.e. `pick > num`).
+- `0`: The number I picked is equal to your guess (i.e. `pick == num`).
+
+Return *the number that I picked*.
+
+**Example 1:**
+
+```
+Input: n = 10, pick = 6
+Output: 6
+```
+
+**Example 2:**
+
+```
+Input: n = 1, pick = 1
+Output: 1
+```
+
+**Example 3:**
+
+```
+Input: n = 2, pick = 1
+Output: 1
+```
+
+**Example 4:**
+
+```
+Input: n = 2, pick = 2
+Output: 2
+```
+
+**Constraints:**
+
+- `1 <= n <= 231 - 1`
+- `1 <= pick <= n`
+
+## 题目大意
+
+猜数字游戏的规则如下：
+
+- 每轮游戏，我都会从 1 到 n 随机选择一个数字。 请你猜选出的是哪个数字。
+- 如果你猜错了，我会告诉你，你猜测的数字比我选出的数字是大了还是小了。
+
+你可以通过调用一个预先定义好的接口 int guess(int num) 来获取猜测结果，返回值一共有 3 种可能的情况（-1，1 或 0）：
+
+- 1：我选出的数字比你猜的数字小 pick < num
+- 1：我选出的数字比你猜的数字大 pick > num
+- 0：我选出的数字和你猜的数字一样。恭喜！你猜对了！pick == num
+
+返回我选出的数字。
+
+## 解题思路
+
+- 这一题是简单题，和小时候玩的猜大猜小的游戏一样。思路很简单，二分查找即可。这一题和第 278 题类似。
+
+## 代码
+
+```go
+package leetcode
+
+import "sort"
+
+/**
+ * Forward declaration of guess API.
+ * @param num your guess
+ * @return -1 if num is lower than the guess number
+ * 1 if num is higher than the guess number
+ * otherwise return 0
+ * func guess(num int) int;
+ */
+
+func guessNumber(n int) int {
+ return sort.Search(n, func(x int) bool { return guess(x) <= 0 })
+}
+
+func guess(num int) int {
+ return 0
+}
+```
\ No newline at end of file
diff --git a/leetcode/0376.Wiggle-Subsequence/376. Wiggle Subsequence.go b/leetcode/0376.Wiggle-Subsequence/376. Wiggle Subsequence.go
new file mode 100644
index 000000000..2d01c7227
--- /dev/null
+++ b/leetcode/0376.Wiggle-Subsequence/376. Wiggle Subsequence.go
@@ -0,0 +1,20 @@
+package leetcode
+
+func wiggleMaxLength(nums []int) int {
+ if len(nums) < 2 {
+ return len(nums)
+ }
+ res := 1
+ prevDiff := nums[1] - nums[0]
+ if prevDiff != 0 {
+ res = 2
+ }
+ for i := 2; i < len(nums); i++ {
+ diff := nums[i] - nums[i-1]
+ if diff > 0 && prevDiff <= 0 || diff < 0 && prevDiff >= 0 {
+ res++
+ prevDiff = diff
+ }
+ }
+ return res
+}
diff --git a/leetcode/0376.Wiggle-Subsequence/376. Wiggle Subsequence_test.go b/leetcode/0376.Wiggle-Subsequence/376. Wiggle Subsequence_test.go
new file mode 100644
index 000000000..7abf91c46
--- /dev/null
+++ b/leetcode/0376.Wiggle-Subsequence/376. Wiggle Subsequence_test.go
@@ -0,0 +1,52 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question376 struct {
+ para376
+ ans376
+}
+
+// para 是参数
+// one 代表第一个参数
+type para376 struct {
+ nums []int
+}
+
+// ans 是答案
+// one 代表第一个答案
+type ans376 struct {
+ one int
+}
+
+func Test_Problem376(t *testing.T) {
+
+ qs := []question376{
+
+ {
+ para376{[]int{1, 7, 4, 9, 2, 5}},
+ ans376{6},
+ },
+
+ {
+ para376{[]int{1, 17, 5, 10, 13, 15, 10, 5, 16, 8}},
+ ans376{7},
+ },
+
+ {
+ para376{[]int{1, 2, 3, 4, 5, 6, 7, 8, 9}},
+ ans376{2},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 376------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans376, q.para376
+ fmt.Printf("【input】:%v 【output】:%v\n", p, wiggleMaxLength(p.nums))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/0376.Wiggle-Subsequence/README.md b/leetcode/0376.Wiggle-Subsequence/README.md
new file mode 100644
index 000000000..d66ed01f7
--- /dev/null
+++ b/leetcode/0376.Wiggle-Subsequence/README.md
@@ -0,0 +1,76 @@
+# [376. Wiggle Subsequence](https://leetcode.com/problems/wiggle-subsequence/)
+
+
+## 题目
+
+Given an integer array `nums`, return *the length of the longest **wiggle sequence***.
+
+A **wiggle sequence** is a sequence where the differences between successive numbers strictly alternate between positive and negative. The first difference (if one exists) may be either positive or negative. A sequence with fewer than two elements is trivially a wiggle sequence.
+
+- For example, `[1, 7, 4, 9, 2, 5]` is a **wiggle sequence** because the differences `(6, -3, 5, -7, 3)` are alternately positive and negative.
+- In contrast, `[1, 4, 7, 2, 5]` and `[1, 7, 4, 5, 5]` are not wiggle sequences, the first because its first two differences are positive and the second because its last difference is zero.
+
+A **subsequence** is obtained by deleting some elements (eventually, also zero) from the original sequence, leaving the remaining elements in their original order.
+
+**Example 1:**
+
+```
+Input: nums = [1,7,4,9,2,5]
+Output: 6
+Explanation: The entire sequence is a wiggle sequence.
+```
+
+**Example 2:**
+
+```
+Input: nums = [1,17,5,10,13,15,10,5,16,8]
+Output: 7
+Explanation: There are several subsequences that achieve this length. One is [1,17,10,13,10,16,8].
+```
+
+**Example 3:**
+
+```
+Input: nums = [1,2,3,4,5,6,7,8,9]
+Output: 2
+```
+
+**Constraints:**
+
+- `1 <= nums.length <= 1000`
+- `0 <= nums[i] <= 1000`
+
+**Follow up:** Could you solve this in `O(n)` time?
+
+## 题目大意
+
+如果连续数字之间的差严格地在正数和负数之间交替，则数字序列称为摆动序列。第一个差（如果存在的话）可能是正数或负数。少于两个元素的序列也是摆动序列。例如， [1,7,4,9,2,5] 是一个摆动序列，因为差值 (6,-3,5,-7,3) 是正负交替出现的。相反, [1,4,7,2,5] 和 [1,7,4,5,5] 不是摆动序列，第一个序列是因为它的前两个差值都是正数，第二个序列是因为它的最后一个差值为零。给定一个整数序列，返回作为摆动序列的最长子序列的长度。 通过从原始序列中删除一些（也可以不删除）元素来获得子序列，剩下的元素保持其原始顺序。
+
+## 解题思路
+
+- 题目要求找到摆动序列最长的子序列。本题可以用贪心的思路，记录当前序列的上升和下降的趋势。扫描数组过程中，每扫描一个元素都判断是“峰”还是“谷”，根据前一个是“峰”还是“谷”做出对应的决定。利用贪心的思想找到最长的摆动子序列。
+
+## 代码
+
+```go
+package leetcode
+
+func wiggleMaxLength(nums []int) int {
+ if len(nums) < 2 {
+ return len(nums)
+ }
+ res := 1
+ prevDiff := nums[1] - nums[0]
+ if prevDiff != 0 {
+ res = 2
+ }
+ for i := 2; i < len(nums); i++ {
+ diff := nums[i] - nums[i-1]
+ if diff > 0 && prevDiff <= 0 || diff < 0 && prevDiff >= 0 {
+ res++
+ prevDiff = diff
+ }
+ }
+ return res
+}
+```
\ No newline at end of file
diff --git a/leetcode/0377.Combination-Sum-IV/377. Combination Sum IV.go b/leetcode/0377.Combination-Sum-IV/377. Combination Sum IV.go
new file mode 100644
index 000000000..6a6d8ada1
--- /dev/null
+++ b/leetcode/0377.Combination-Sum-IV/377. Combination Sum IV.go
@@ -0,0 +1,38 @@
+package leetcode
+
+func combinationSum4(nums []int, target int) int {
+ dp := make([]int, target+1)
+ dp[0] = 1
+ for i := 1; i <= target; i++ {
+ for _, num := range nums {
+ if i-num >= 0 {
+ dp[i] += dp[i-num]
+ }
+ }
+ }
+ return dp[target]
+}
+
+// 暴力解法超时
+func combinationSum41(nums []int, target int) int {
+ if len(nums) == 0 {
+ return 0
+ }
+ c, res := []int{}, 0
+ findcombinationSum4(nums, target, 0, c, &res)
+ return res
+}
+
+func findcombinationSum4(nums []int, target, index int, c []int, res *int) {
+ if target <= 0 {
+ if target == 0 {
+ *res++
+ }
+ return
+ }
+ for i := 0; i < len(nums); i++ {
+ c = append(c, nums[i])
+ findcombinationSum4(nums, target-nums[i], i, c, res)
+ c = c[:len(c)-1]
+ }
+}
diff --git a/leetcode/9990377.Combination-Sum-IV/377. Combination Sum IV_test.go b/leetcode/0377.Combination-Sum-IV/377. Combination Sum IV_test.go
similarity index 96%
rename from leetcode/9990377.Combination-Sum-IV/377. Combination Sum IV_test.go
rename to leetcode/0377.Combination-Sum-IV/377. Combination Sum IV_test.go
index de17f2462..297e31c95 100644
--- a/leetcode/9990377.Combination-Sum-IV/377. Combination Sum IV_test.go
+++ b/leetcode/0377.Combination-Sum-IV/377. Combination Sum IV_test.go
@@ -34,7 +34,7 @@ func Test_Problem377(t *testing.T) {
{
para377{[]int{1, 2, 3}, 32},
- ans377{7},
+ ans377{181997601},
},
}
diff --git a/leetcode/0377.Combination-Sum-IV/README.md b/leetcode/0377.Combination-Sum-IV/README.md
new file mode 100644
index 000000000..d0920bf62
--- /dev/null
+++ b/leetcode/0377.Combination-Sum-IV/README.md
@@ -0,0 +1,98 @@
+# [377. Combination Sum IV](https://leetcode.com/problems/combination-sum-iv/)
+
+
+## 题目
+
+Given an array of **distinct** integers `nums` and a target integer `target`, return *the number of possible combinations that add up to* `target`.
+
+The answer is **guaranteed** to fit in a **32-bit** integer.
+
+**Example 1:**
+
+```
+Input: nums = [1,2,3], target = 4
+Output: 7
+Explanation:
+The possible combination ways are:
+(1, 1, 1, 1)
+(1, 1, 2)
+(1, 2, 1)
+(1, 3)
+(2, 1, 1)
+(2, 2)
+(3, 1)
+Note that different sequences are counted as different combinations.
+
+```
+
+**Example 2:**
+
+```
+Input: nums = [9], target = 3
+Output: 0
+```
+
+**Constraints:**
+
+- `1 <= nums.length <= 200`
+- `1 <= nums[i] <= 1000`
+- All the elements of `nums` are **unique**.
+- `1 <= target <= 1000`
+
+**Follow up:** What if negative numbers are allowed in the given array? How does it change the problem? What limitation we need to add to the question to allow negative numbers?
+
+## 题目大意
+
+给你一个由 不同 整数组成的数组 nums ，和一个目标整数 target 。请你从 nums 中找出并返回总和为 target 的元素组合的个数。题目数据保证答案符合 32 位整数范围。
+
+## 解题思路
+
+- Combination Sum 这是系列问题。拿到题目，笔者先用暴力解法 dfs 尝试了一版，包含的重叠子问题特别多，剪枝条件也没有写好，果然超时。元素只有 [1,2,3] 这三种，target = 32，这组数据居然有 181997601 这么多种情况。仔细看了题目数据规模 1000，基本可以断定此题是动态规划，并且时间复杂度是 O(n^2)。
+- 本题和完全背包有点像，但是还是有区别。完全背包的取法内部不区分顺序。例如 5 = 1 + 2 + 2。但是本题是 3 种答案 (1，2，2)，(2，1，2)，(2，2，1)。定义 dp[i] 为总和为 target = i 的组合总数。最终答案存在 dp[target] 中。状态转移方程为：
+
+ $$dp[i] =\left\{\begin{matrix}1,i=0\\ \sum dp[i-j],i\neq 0\end{matrix}\right.$$
+
+- 这道题最后有一个进阶问题。如果给定的数组中含有负数，则会导致出现无限长度的排列。例如，假设数组 nums 中含有正整数 a 和负整数 −b（其中 a>0,b>0,-b<0），则有 a×b+(−b)×a=0，对于任意一个元素之和等于 target 的排列，在该排列的后面添加 b 个 a 和 a 个 −b 之后，得到的新排列的元素之和仍然等于 target，而且还可以在新排列的后面继续 b 个 a 和 a 个 −b。因此只要存在元素之和等于 target 的排列，就能构造出无限长度的排列。如果允许负数出现，则必须限制排列的最大长度，不然会出现无限长度的排列。
+
+## 代码
+
+```go
+package leetcode
+
+func combinationSum4(nums []int, target int) int {
+ dp := make([]int, target+1)
+ dp[0] = 1
+ for i := 1; i <= target; i++ {
+ for _, num := range nums {
+ if i-num >= 0 {
+ dp[i] += dp[i-num]
+ }
+ }
+ }
+ return dp[target]
+}
+
+// 暴力解法超时
+func combinationSum41(nums []int, target int) int {
+ if len(nums) == 0 {
+ return 0
+ }
+ c, res := []int{}, 0
+ findcombinationSum4(nums, target, 0, c, &res)
+ return res
+}
+
+func findcombinationSum4(nums []int, target, index int, c []int, res *int) {
+ if target <= 0 {
+ if target == 0 {
+ *res++
+ }
+ return
+ }
+ for i := 0; i < len(nums); i++ {
+ c = append(c, nums[i])
+ findcombinationSum4(nums, target-nums[i], i, c, res)
+ c = c[:len(c)-1]
+ }
+}
+```
\ No newline at end of file
diff --git a/leetcode/0382.Linked-List-Random-Node/382. Linked List Random Node.go b/leetcode/0382.Linked-List-Random-Node/382. Linked List Random Node.go
new file mode 100644
index 000000000..892ca7075
--- /dev/null
+++ b/leetcode/0382.Linked-List-Random-Node/382. Linked List Random Node.go
@@ -0,0 +1,48 @@
+package leetcode
+
+import (
+ "math/rand"
+
+ "github.com/halfrost/LeetCode-Go/structures"
+)
+
+// ListNode define
+type ListNode = structures.ListNode
+
+/**
+ * Definition for singly-linked list.
+ * type ListNode struct {
+ * Val int
+ * Next *ListNode
+ * }
+ */
+type Solution struct {
+ head *ListNode
+}
+
+/*
+ - @param head The linked list's head.
+ Note that the head is guaranteed to be not null, so it contains at least one node.
+*/
+func Constructor(head *ListNode) Solution {
+ return Solution{head: head}
+}
+
+/** Returns a random node's value. */
+func (this *Solution) GetRandom() int {
+ scope, selectPoint, curr := 1, 0, this.head
+ for curr != nil {
+ if rand.Float64() < 1.0/float64(scope) {
+ selectPoint = curr.Val
+ }
+ scope += 1
+ curr = curr.Next
+ }
+ return selectPoint
+}
+
+/**
+ * Your Solution object will be instantiated and called as such:
+ * obj := Constructor(head);
+ * param_1 := obj.GetRandom();
+ */
diff --git a/leetcode/0382.Linked-List-Random-Node/382. Linked List Random Node_test.go b/leetcode/0382.Linked-List-Random-Node/382. Linked List Random Node_test.go
new file mode 100644
index 000000000..f33713446
--- /dev/null
+++ b/leetcode/0382.Linked-List-Random-Node/382. Linked List Random Node_test.go
@@ -0,0 +1,28 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+
+ "github.com/halfrost/LeetCode-Go/structures"
+)
+
+func Test_Problem382(t *testing.T) {
+ header := structures.Ints2List([]int{1, 2, 3, 4, 5, 6, 7, 8, 9, 0})
+ obj := Constructor(header)
+ fmt.Printf("obj = %v\n", structures.List2Ints(header))
+ param1 := obj.GetRandom()
+ fmt.Printf("param_1 = %v\n", param1)
+ param1 = obj.GetRandom()
+ fmt.Printf("param_1 = %v\n", param1)
+ param1 = obj.GetRandom()
+ fmt.Printf("param_1 = %v\n", param1)
+ param1 = obj.GetRandom()
+ fmt.Printf("param_1 = %v\n", param1)
+ param1 = obj.GetRandom()
+ fmt.Printf("param_1 = %v\n", param1)
+ param1 = obj.GetRandom()
+ fmt.Printf("param_1 = %v\n", param1)
+
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/0382.Linked-List-Random-Node/README.md b/leetcode/0382.Linked-List-Random-Node/README.md
new file mode 100644
index 000000000..db5ecc06c
--- /dev/null
+++ b/leetcode/0382.Linked-List-Random-Node/README.md
@@ -0,0 +1,105 @@
+# [382. Linked List Random Node](https://leetcode.com/problems/linked-list-random-node/)
+
+
+## 题目
+
+Given a singly linked list, return a random node's value from the linked list. Each node must have the **same probability** of being chosen.
+
+Implement the `Solution` class:
+
+- `Solution(ListNode head)` Initializes the object with the integer array nums.
+- `int getRandom()` Chooses a node randomly from the list and returns its value. All the nodes of the list should be equally likely to be choosen.
+
+**Example 1:**
+
+
+
+```
+Input
+["Solution", "getRandom", "getRandom", "getRandom", "getRandom", "getRandom"]
+[[[1, 2, 3]], [], [], [], [], []]
+Output
+[null, 1, 3, 2, 2, 3]
+
+Explanation
+Solution solution = new Solution([1, 2, 3]);
+solution.getRandom(); // return 1
+solution.getRandom(); // return 3
+solution.getRandom(); // return 2
+solution.getRandom(); // return 2
+solution.getRandom(); // return 3
+// getRandom() should return either 1, 2, or 3 randomly. Each element should have equal probability of returning.
+
+```
+
+**Constraints:**
+
+- The number of nodes in the linked list will be in the range `[1, 104]`.
+- `-10^4 <= Node.val <= 10^4`
+- At most `10^4` calls will be made to `getRandom`.
+
+**Follow up:**
+
+- What if the linked list is extremely large and its length is unknown to you?
+- Could you solve this efficiently without using extra space?
+
+## 题目大意
+
+给定一个单链表，随机选择链表的一个节点，并返回相应的节点值。保证每个节点被选的概率一样。
+
+进阶: 如果链表十分大且长度未知，如何解决这个问题？你能否使用常数级空间复杂度实现？
+
+## 解题思路
+
+- rand.Float64() 可以返回 [0.0,1.0) 之间的随机数。利用这个函数完成我们的随机化取节点的过程。
+
+## 代码
+
+```go
+package leetcode
+
+import (
+ "math/rand"
+
+ "github.com/halfrost/LeetCode-Go/structures"
+)
+
+// ListNode define
+type ListNode = structures.ListNode
+
+/**
+ * Definition for singly-linked list.
+ * type ListNode struct {
+ * Val int
+ * Next *ListNode
+ * }
+ */
+type Solution struct {
+ head *ListNode
+}
+
+/** @param head The linked list's head.
+ Note that the head is guaranteed to be not null, so it contains at least one node. */
+func Constructor(head *ListNode) Solution {
+ return Solution{head: head}
+}
+
+/** Returns a random node's value. */
+func (this *Solution) GetRandom() int {
+ scope, selectPoint, curr := 1, 0, this.head
+ for curr != nil {
+ if rand.Float64() < 1.0/float64(scope) {
+ selectPoint = curr.Val
+ }
+ scope += 1
+ curr = curr.Next
+ }
+ return selectPoint
+}
+
+/**
+ * Your Solution object will be instantiated and called as such:
+ * obj := Constructor(head);
+ * param_1 := obj.GetRandom();
+ */
+```
\ No newline at end of file
diff --git a/leetcode/0383.Ransom-Note/383.Ransom Note.go b/leetcode/0383.Ransom-Note/383.Ransom Note.go
new file mode 100644
index 000000000..a20162c61
--- /dev/null
+++ b/leetcode/0383.Ransom-Note/383.Ransom Note.go
@@ -0,0 +1,18 @@
+package leetcode
+
+func canConstruct(ransomNote string, magazine string) bool {
+ if len(ransomNote) > len(magazine) {
+ return false
+ }
+ var cnt [26]int
+ for _, v := range magazine {
+ cnt[v-'a']++
+ }
+ for _, v := range ransomNote {
+ cnt[v-'a']--
+ if cnt[v-'a'] < 0 {
+ return false
+ }
+ }
+ return true
+}
diff --git a/leetcode/0383.Ransom-Note/383.Ransom Note_test.go b/leetcode/0383.Ransom-Note/383.Ransom Note_test.go
new file mode 100644
index 000000000..b17147686
--- /dev/null
+++ b/leetcode/0383.Ransom-Note/383.Ransom Note_test.go
@@ -0,0 +1,51 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question383 struct {
+ para383
+ ans383
+}
+
+// para 是参数
+type para383 struct {
+ ransomNote string
+ magazine string
+}
+
+// ans 是答案
+type ans383 struct {
+ ans bool
+}
+
+func Test_Problem383(t *testing.T) {
+
+ qs := []question383{
+
+ {
+ para383{"a", "b"},
+ ans383{false},
+ },
+
+ {
+ para383{"aa", "ab"},
+ ans383{false},
+ },
+
+ {
+ para383{"aa", "aab"},
+ ans383{true},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 383------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans383, q.para383
+ fmt.Printf("【input】:%v 【output】:%v\n", p, canConstruct(p.ransomNote, p.magazine))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/0383.Ransom-Note/README.md b/leetcode/0383.Ransom-Note/README.md
new file mode 100644
index 000000000..9fe9941c5
--- /dev/null
+++ b/leetcode/0383.Ransom-Note/README.md
@@ -0,0 +1,64 @@
+# [383. Ransom Note](https://leetcode.com/problems/ransom-note/)
+
+## 题目
+
+Given two stings ransomNote and magazine, return true if ransomNote can be constructed from magazine and false otherwise.
+
+Each letter in magazine can only be used once in ransomNote.
+
+**Example 1**:
+
+ Input: ransomNote = "a", magazine = "b"
+ Output: false
+
+**Example 2**:
+
+ Input: ransomNote = "aa", magazine = "ab"
+ Output: false
+
+**Example 3**:
+
+ Input: ransomNote = "aa", magazine = "aab"
+ Output: true
+
+**Constraints:**
+
+- 1 <= ransomNote.length, magazine.length <= 100000
+- ransomNote and magazine consist of lowercase English letters.
+
+## 题目大意
+
+为了不在赎金信中暴露字迹，从杂志上搜索各个需要的字母，组成单词来表达意思。
+
+给你一个赎金信 (ransomNote) 字符串和一个杂志(magazine)字符串，判断 ransomNote 能不能由 magazines 里面的字符构成。
+
+如果可以构成，返回 true ；否则返回 false 。
+
+magazine 中的每个字符只能在 ransomNote 中使用一次。
+
+## 解题思路
+
+- ransomNote 和 magazine 都是由小写字母组成，所以用数组进行简单的字符统计
+
+## 代码
+
+````go
+package leetcode
+
+func canConstruct(ransomNote string, magazine string) bool {
+ if len(ransomNote) > len(magazine) {
+ return false
+ }
+ var cnt [26]int
+ for _, v := range magazine {
+ cnt[v-'a']++
+ }
+ for _, v := range ransomNote {
+ cnt[v-'a']--
+ if cnt[v-'a'] < 0 {
+ return false
+ }
+ }
+ return true
+}
+````
\ No newline at end of file
diff --git a/leetcode/0384.Shuffle-an-Array/384.Shuffle an Array.go b/leetcode/0384.Shuffle-an-Array/384.Shuffle an Array.go
new file mode 100644
index 000000000..541908424
--- /dev/null
+++ b/leetcode/0384.Shuffle-an-Array/384.Shuffle an Array.go
@@ -0,0 +1,28 @@
+package leetcode
+
+import "math/rand"
+
+type Solution struct {
+ nums []int
+}
+
+func Constructor(nums []int) Solution {
+ return Solution{
+ nums: nums,
+ }
+}
+
+/** Resets the array to its original configuration and return it. */
+func (this *Solution) Reset() []int {
+ return this.nums
+}
+
+/** Returns a random shuffling of the array. */
+func (this *Solution) Shuffle() []int {
+ arr := make([]int, len(this.nums))
+ copy(arr, this.nums)
+ rand.Shuffle(len(arr), func(i, j int) {
+ arr[i], arr[j] = arr[j], arr[i]
+ })
+ return arr
+}
diff --git a/leetcode/0384.Shuffle-an-Array/384.Shuffle an Array_test.go b/leetcode/0384.Shuffle-an-Array/384.Shuffle an Array_test.go
new file mode 100644
index 000000000..9ecebf0f7
--- /dev/null
+++ b/leetcode/0384.Shuffle-an-Array/384.Shuffle an Array_test.go
@@ -0,0 +1,50 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question384 struct {
+ para384
+ ans384
+}
+
+// para 是参数
+type para384 struct {
+ ops []string
+ value [][]int
+}
+
+// ans 是答案
+type ans384 struct {
+ ans [][]int
+}
+
+func Test_Problem384(t *testing.T) {
+
+ qs := []question384{
+
+ {
+ para384{ops: []string{"Solution", "shuffle", "reset", "shuffle"}, value: [][]int{{1, 2, 3}, {}, {}, {}}},
+ ans384{[][]int{nil, {3, 1, 2}, {1, 2, 3}, {1, 3, 2}}},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 384------------------------\n")
+
+ for _, q := range qs {
+ sol := Constructor(nil)
+ _, p := q.ans384, q.para384
+ for _, op := range p.ops {
+ if op == "Solution" {
+ sol = Constructor(q.value[0])
+ } else if op == "reset" {
+ fmt.Printf("【input】:%v 【output】:%v\n", op, sol.Reset())
+ } else {
+ fmt.Printf("【input】:%v 【output】:%v\n", op, sol.Shuffle())
+ }
+ }
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/0384.Shuffle-an-Array/README.md b/leetcode/0384.Shuffle-an-Array/README.md
new file mode 100644
index 000000000..df22193a8
--- /dev/null
+++ b/leetcode/0384.Shuffle-an-Array/README.md
@@ -0,0 +1,82 @@
+# [384.Shuffle an Array](https://leetcode.com/problems/shuffle-an-array/)
+
+## 题目
+
+Given an integer array nums, design an algorithm to randomly shuffle the array. All permutations of the array should be equally likely as a result of the shuffling.
+
+Implement the Solution class:
+
+- Solution(int[] nums) Initializes the object with the integer array nums.
+- int[] reset() Resets the array to its original configuration and returns it.
+- int[] shuffle() Returns a random shuffling of the array.
+
+**Example 1**:
+
+ Input
+ ["Solution", "shuffle", "reset", "shuffle"]
+ [[[1, 2, 3]], [], [], []]
+ Output
+ [null, [3, 1, 2], [1, 2, 3], [1, 3, 2]]
+
+ Explanation
+ Solution solution = new Solution([1, 2, 3]);
+ solution.shuffle(); // Shuffle the array [1,2,3] and return its result.
+ // Any permutation of [1,2,3] must be equally likely to be returned.
+ // Example: return [3, 1, 2]
+ solution.reset(); // Resets the array back to its original configuration [1,2,3]. Return [1, 2, 3]
+ solution.shuffle(); // Returns the random shuffling of array [1,2,3]. Example: return [1, 3, 2]
+
+**Constraints:**
+
+- 1 <= nums.length <= 200
+- -1000000 <= nums[i] <= 1000000
+- All the elements of nums are unique.
+- At most 5 * 10000 calls in total will be made to reset and shuffle.
+
+## 题目大意
+
+给你一个整数数组 nums ，设计算法来打乱一个没有重复元素的数组。
+
+实现 Solution class:
+
+- Solution(int[] nums) 使用整数数组 nums 初始化对象
+- int[] reset() 重设数组到它的初始状态并返回
+- int[] shuffle() 返回数组随机打乱后的结果
+
+## 解题思路
+
+- 使用 rand.Shuffle 进行数组随机打乱
+
+## 代码
+
+```go
+
+package leetcode
+
+import "math/rand"
+
+type Solution struct {
+ nums []int
+}
+
+func Constructor(nums []int) Solution {
+ return Solution{
+ nums: nums,
+ }
+}
+
+/** Resets the array to its original configuration and return it. */
+func (this *Solution) Reset() []int {
+ return this.nums
+}
+
+/** Returns a random shuffling of the array. */
+func (this *Solution) Shuffle() []int {
+ arr := make([]int, len(this.nums))
+ copy(arr, this.nums)
+ rand.Shuffle(len(arr), func(i, j int) {
+ arr[i], arr[j] = arr[j], arr[i]
+ })
+ return arr
+}
+```
\ No newline at end of file
diff --git a/leetcode/0387.First-Unique-Character-in-a-String/387. First Unique Character in a String.go b/leetcode/0387.First-Unique-Character-in-a-String/387. First Unique Character in a String.go
index 591c37f80..1ce1fe898 100644
--- a/leetcode/0387.First-Unique-Character-in-a-String/387. First Unique Character in a String.go
+++ b/leetcode/0387.First-Unique-Character-in-a-String/387. First Unique Character in a String.go
@@ -1,5 +1,6 @@
package leetcode
+// 解法一
func firstUniqChar(s string) int {
result := make([]int, 26)
for i := 0; i < len(s); i++ {
@@ -12,3 +13,34 @@ func firstUniqChar(s string) int {
}
return -1
}
+
+// 解法二
+// 执行用时: 8 ms
+// 内存消耗: 5.2 MB
+func firstUniqChar1(s string) int {
+ charMap := make([][2]int, 26)
+ for i := 0; i < 26; i++ {
+ charMap[i][0] = -1
+ charMap[i][1] = -1
+ }
+ for i := 0; i < len(s); i++ {
+ if charMap[s[i]-'a'][0] == -1 {
+ charMap[s[i]-'a'][0] = i
+ } else { //已经出现过
+ charMap[s[i]-'a'][1] = i
+ }
+ }
+ res := len(s)
+ for i := 0; i < 26; i++ {
+ //只出现了一次
+ if charMap[i][0] >= 0 && charMap[i][1] == -1 {
+ if charMap[i][0] < res {
+ res = charMap[i][0]
+ }
+ }
+ }
+ if res == len(s) {
+ return -1
+ }
+ return res
+}
diff --git a/leetcode/0390.Elimination-Game/390. Elimination Game.go b/leetcode/0390.Elimination-Game/390. Elimination Game.go
new file mode 100644
index 000000000..d741e387f
--- /dev/null
+++ b/leetcode/0390.Elimination-Game/390. Elimination Game.go
@@ -0,0 +1,18 @@
+package leetcode
+
+func lastRemaining(n int) int {
+ start, dir, step := 1, true, 1
+ for n > 1 {
+ if dir { // 正向
+ start += step
+ } else { // 反向
+ if n%2 == 1 {
+ start += step
+ }
+ }
+ dir = !dir
+ n >>= 1
+ step <<= 1
+ }
+ return start
+}
diff --git a/leetcode/0390.Elimination-Game/390. Elimination Game_test.go b/leetcode/0390.Elimination-Game/390. Elimination Game_test.go
new file mode 100644
index 000000000..d7f0c4efd
--- /dev/null
+++ b/leetcode/0390.Elimination-Game/390. Elimination Game_test.go
@@ -0,0 +1,47 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question390 struct {
+ para390
+ ans390
+}
+
+// para 是参数
+// one 代表第一个参数
+type para390 struct {
+ n int
+}
+
+// ans 是答案
+// one 代表第一个答案
+type ans390 struct {
+ one int
+}
+
+func Test_Problem390(t *testing.T) {
+
+ qs := []question390{
+
+ {
+ para390{9},
+ ans390{6},
+ },
+
+ {
+ para390{1},
+ ans390{1},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 390------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans390, q.para390
+ fmt.Printf("【input】:%v 【output】:%v\n", p, lastRemaining(p.n))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/0390.Elimination-Game/README.md b/leetcode/0390.Elimination-Game/README.md
new file mode 100644
index 000000000..91eea4eea
--- /dev/null
+++ b/leetcode/0390.Elimination-Game/README.md
@@ -0,0 +1,74 @@
+# [390. Elimination Game](https://leetcode.com/problems/elimination-game/)
+
+
+## 题目
+
+You have a list `arr` of all integers in the range `[1, n]` sorted in a strictly increasing order. Apply the following algorithm on `arr`:
+
+- Starting from left to right, remove the first number and every other number afterward until you reach the end of the list.
+- Repeat the previous step again, but this time from right to left, remove the rightmost number and every other number from the remaining numbers.
+- Keep repeating the steps again, alternating left to right and right to left, until a single number remains.
+
+Given the integer `n`, return *the last number that remains in* `arr`.
+
+**Example 1:**
+
+```
+Input: n = 9
+Output: 6
+Explanation:
+arr = [1, 2,3, 4,5, 6,7, 8,9]
+arr = [2,4, 6,8]
+arr = [2, 6]
+arr = [6]
+
+```
+
+**Example 2:**
+
+```
+Input: n = 1
+Output: 1
+
+```
+
+**Constraints:**
+
+- `1 <= n <= 109`
+
+## 题目大意
+
+列表 arr 由在范围 [1, n] 中的所有整数组成，并按严格递增排序。请你对 arr 应用下述算法：
+
+- 从左到右，删除第一个数字，然后每隔一个数字删除一个，直到到达列表末尾。
+- 重复上面的步骤，但这次是从右到左。也就是，删除最右侧的数字，然后剩下的数字每隔一个删除一个。
+- 不断重复这两步，从左到右和从右到左交替进行，直到只剩下一个数字。
+
+给你整数 n ，返回 arr 最后剩下的数字。
+
+## 解题思路
+
+- 模拟题。按照题意，第一轮从左往右删除数字，第二轮从右往左删除数字。题目要求最后剩下的数字，模拟过程中不需要真的删除元素。只需要标记起始元素，该轮步长和方向即可。最后总元素只剩下一个即为所求。
+
+## 代码
+
+```go
+package leetcode
+
+func lastRemaining(n int) int {
+ start, dir, step := 1, true, 1
+ for n > 1 {
+ if dir { // 正向
+ start += step
+ } else { // 反向
+ if n%2 == 1 {
+ start += step
+ }
+ }
+ dir = !dir
+ n >>= 1
+ step <<= 1
+ }
+ return start
+}
+```
\ No newline at end of file
diff --git a/leetcode/0391.Perfect-Rectangle/391.Perfect Rectangle.go b/leetcode/0391.Perfect-Rectangle/391.Perfect Rectangle.go
new file mode 100644
index 000000000..0d30790e0
--- /dev/null
+++ b/leetcode/0391.Perfect-Rectangle/391.Perfect Rectangle.go
@@ -0,0 +1,53 @@
+package leetcode
+
+type point struct {
+ x int
+ y int
+}
+
+func isRectangleCover(rectangles [][]int) bool {
+ minX, minY, maxA, maxB := rectangles[0][0], rectangles[0][1], rectangles[0][2], rectangles[0][3]
+ area := 0
+ cnt := make(map[point]int)
+ for _, v := range rectangles {
+ x, y, a, b := v[0], v[1], v[2], v[3]
+ area += (a - x) * (b - y)
+ minX = min(minX, x)
+ minY = min(minY, y)
+ maxA = max(maxA, a)
+ maxB = max(maxB, b)
+ cnt[point{x, y}]++
+ cnt[point{a, b}]++
+ cnt[point{x, b}]++
+ cnt[point{a, y}]++
+ }
+ if area != (maxA-minX)*(maxB-minY) ||
+ cnt[point{minX, minY}] != 1 || cnt[point{maxA, maxB}] != 1 ||
+ cnt[point{minX, maxB}] != 1 || cnt[point{maxA, minY}] != 1 {
+ return false
+ }
+ delete(cnt, point{minX, minY})
+ delete(cnt, point{maxA, maxB})
+ delete(cnt, point{minX, maxB})
+ delete(cnt, point{maxA, minY})
+ for _, v := range cnt {
+ if v != 2 && v != 4 {
+ return false
+ }
+ }
+ return true
+}
+
+func min(a, b int) int {
+ if a < b {
+ return a
+ }
+ return b
+}
+
+func max(a, b int) int {
+ if a > b {
+ return a
+ }
+ return b
+}
diff --git a/leetcode/0391.Perfect-Rectangle/391.Perfect Rectangle_test.go b/leetcode/0391.Perfect-Rectangle/391.Perfect Rectangle_test.go
new file mode 100644
index 000000000..0efa7efa7
--- /dev/null
+++ b/leetcode/0391.Perfect-Rectangle/391.Perfect Rectangle_test.go
@@ -0,0 +1,55 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question391 struct {
+ para391
+ ans391
+}
+
+// para 是参数
+type para391 struct {
+ rectangles [][]int
+}
+
+// ans 是答案
+type ans391 struct {
+ ans bool
+}
+
+func Test_Problem391(t *testing.T) {
+
+ qs := []question391{
+
+ {
+ para391{[][]int{{1, 1, 3, 3}, {3, 1, 4, 2}, {3, 2, 4, 4}, {1, 3, 2, 4}, {2, 3, 3, 4}}},
+ ans391{true},
+ },
+
+ {
+ para391{[][]int{{1, 1, 2, 3}, {1, 3, 2, 4}, {3, 1, 4, 2}, {3, 2, 4, 4}}},
+ ans391{false},
+ },
+
+ {
+ para391{[][]int{{1, 1, 3, 3}, {3, 1, 4, 2}, {1, 3, 2, 4}, {3, 2, 4, 4}}},
+ ans391{false},
+ },
+
+ {
+ para391{[][]int{{1, 1, 3, 3}, {3, 1, 4, 2}, {1, 3, 2, 4}, {2, 2, 4, 4}}},
+ ans391{false},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 391------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans391, q.para391
+ fmt.Printf("【input】:%v 【output】:%v\n", p, isRectangleCover(p.rectangles))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/0391.Perfect-Rectangle/README.md b/leetcode/0391.Perfect-Rectangle/README.md
new file mode 100644
index 000000000..9a66b3b22
--- /dev/null
+++ b/leetcode/0391.Perfect-Rectangle/README.md
@@ -0,0 +1,114 @@
+# [391. Perfect Rectangle](https://leetcode.com/problems/perfect-rectangle/)
+
+## 题目
+
+Given an array rectangles where rectangles[i] = [xi, yi, ai, bi] represents an axis-aligned rectangle. The bottom-left point of the rectangle is (xi, yi) and the top-right point of it is (ai, bi).
+
+Return true if all the rectangles together form an exact cover of a rectangular region.
+
+**Example1:**
+
+
+
+ Input: rectangles = [[1,1,3,3],[3,1,4,2],[3,2,4,4],[1,3,2,4],[2,3,3,4]]
+ Output: true
+ Explanation: All 5 rectangles together form an exact cover of a rectangular region.
+
+**Example2:**
+
+
+
+ Input: rectangles = [[1,1,2,3],[1,3,2,4],[3,1,4,2],[3,2,4,4]]
+ Output: false
+ Explanation: Because there is a gap between the two rectangular regions.
+
+**Example3:**
+
+
+
+ Input: rectangles = [[1,1,3,3],[3,1,4,2],[1,3,2,4],[3,2,4,4]]
+ Output: false
+ Explanation: Because there is a gap in the top center.
+
+**Example4:**
+
+
+
+ Input: rectangles = [[1,1,3,3],[3,1,4,2],[1,3,2,4],[2,2,4,4]]
+ Output: false
+ Explanation: Because two of the rectangles overlap with each other.
+
+**Constraints:**
+
+- 1 <= rectangles.length <= 2 * 10000
+- rectangles[i].length == 4
+- -100000 <= xi, yi, ai, bi <= 100000
+
+## 题目大意
+
+给你一个数组 rectangles ，其中 rectangles[i] = [xi, yi, ai, bi] 表示一个坐标轴平行的矩形。这个矩形的左下顶点是 (xi, yi) ，右上顶点是 (ai, bi) 。
+
+如果所有矩形一起精确覆盖了某个矩形区域，则返回 true ；否则，返回 false 。
+
+## 解题思路
+
+- 矩形区域的面积等于所有矩形的面积之和并且满足矩形区域四角的顶点只能出现一次，且其余顶点的出现次数只能是两次或四次则返回 true,否则返回 false
+
+## 代码
+
+```go
+
+package leetcode
+
+type point struct {
+ x int
+ y int
+}
+
+func isRectangleCover(rectangles [][]int) bool {
+ minX, minY, maxA, maxB := rectangles[0][0], rectangles[0][1], rectangles[0][2], rectangles[0][3]
+ area := 0
+ cnt := make(map[point]int)
+ for _, v := range rectangles {
+ x, y, a, b := v[0], v[1], v[2], v[3]
+ area += (a - x) * (b - y)
+ minX = min(minX, x)
+ minY = min(minY, y)
+ maxA = max(maxA, a)
+ maxB = max(maxB, b)
+ cnt[point{x, y}]++
+ cnt[point{a, b}]++
+ cnt[point{x, b}]++
+ cnt[point{a, y}]++
+ }
+ if area != (maxA - minX) * (maxB - minY) ||
+ cnt[point{minX, minY}] != 1 || cnt[point{maxA, maxB}] != 1 ||
+ cnt[point{minX, maxB}] != 1 || cnt[point{maxA, minY}] != 1 {
+ return false
+ }
+ delete(cnt, point{minX, minY})
+ delete(cnt, point{maxA, maxB})
+ delete(cnt, point{minX, maxB})
+ delete(cnt, point{maxA, minY})
+ for _, v := range cnt {
+ if v != 2 && v != 4 {
+ return false
+ }
+ }
+ return true
+}
+
+func min(a, b int) int {
+ if a < b {
+ return a
+ }
+ return b
+}
+
+func max(a, b int) int {
+ if a > b {
+ return a
+ }
+ return b
+}
+```
\ No newline at end of file
diff --git a/leetcode/0395.Longest-Substring-with-At-Least-K-Repeating-Characters/395. Longest Substring with At Least K Repeating Characters.go b/leetcode/0395.Longest-Substring-with-At-Least-K-Repeating-Characters/395. Longest Substring with At Least K Repeating Characters.go
new file mode 100644
index 000000000..079a6bcf2
--- /dev/null
+++ b/leetcode/0395.Longest-Substring-with-At-Least-K-Repeating-Characters/395. Longest Substring with At Least K Repeating Characters.go
@@ -0,0 +1,70 @@
+package leetcode
+
+import "strings"
+
+// 解法一 滑动窗口
+func longestSubstring(s string, k int) int {
+ res := 0
+ for t := 1; t <= 26; t++ {
+ freq, total, lessK, left, right := [26]int{}, 0, 0, 0, -1
+ for left < len(s) {
+ if right+1 < len(s) && total <= t {
+ if freq[s[right+1]-'a'] == 0 {
+ total++
+ lessK++
+ }
+ freq[s[right+1]-'a']++
+ if freq[s[right+1]-'a'] == k {
+ lessK--
+ }
+ right++
+ } else {
+ if freq[s[left]-'a'] == k {
+ lessK++
+ }
+ freq[s[left]-'a']--
+ if freq[s[left]-'a'] == 0 {
+ total--
+ lessK--
+ }
+ left++
+ }
+ if lessK == 0 {
+ res = max(res, right-left+1)
+ }
+
+ }
+ }
+ return res
+}
+
+func max(a, b int) int {
+ if a > b {
+ return a
+ }
+ return b
+}
+
+// 解法二 递归分治
+func longestSubstring1(s string, k int) int {
+ if s == "" {
+ return 0
+ }
+ freq, split, res := [26]int{}, byte(0), 0
+ for _, ch := range s {
+ freq[ch-'a']++
+ }
+ for i, c := range freq[:] {
+ if 0 < c && c < k {
+ split = 'a' + byte(i)
+ break
+ }
+ }
+ if split == 0 {
+ return len(s)
+ }
+ for _, subStr := range strings.Split(s, string(split)) {
+ res = max(res, longestSubstring1(subStr, k))
+ }
+ return res
+}
diff --git a/leetcode/0395.Longest-Substring-with-At-Least-K-Repeating-Characters/395. Longest Substring with At Least K Repeating Characters_test.go b/leetcode/0395.Longest-Substring-with-At-Least-K-Repeating-Characters/395. Longest Substring with At Least K Repeating Characters_test.go
new file mode 100644
index 000000000..3d5179e3a
--- /dev/null
+++ b/leetcode/0395.Longest-Substring-with-At-Least-K-Repeating-Characters/395. Longest Substring with At Least K Repeating Characters_test.go
@@ -0,0 +1,48 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question395 struct {
+ para395
+ ans395
+}
+
+// para 是参数
+// one 代表第一个参数
+type para395 struct {
+ s string
+ k int
+}
+
+// ans 是答案
+// one 代表第一个答案
+type ans395 struct {
+ one int
+}
+
+func Test_Problem395(t *testing.T) {
+
+ qs := []question395{
+
+ {
+ para395{"aaabb", 3},
+ ans395{3},
+ },
+
+ {
+ para395{"ababbc", 2},
+ ans395{5},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 395------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans395, q.para395
+ fmt.Printf("【input】:%v 【output】:%v\n", p, longestSubstring(p.s, p.k))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/0395.Longest-Substring-with-At-Least-K-Repeating-Characters/README.md b/leetcode/0395.Longest-Substring-with-At-Least-K-Repeating-Characters/README.md
new file mode 100644
index 000000000..cd84eba52
--- /dev/null
+++ b/leetcode/0395.Longest-Substring-with-At-Least-K-Repeating-Characters/README.md
@@ -0,0 +1,112 @@
+# [395. Longest Substring with At Least K Repeating Characters](https://leetcode.com/problems/longest-substring-with-at-least-k-repeating-characters/)
+
+
+## 题目
+
+Given a string `s` and an integer `k`, return *the length of the longest substring of* `s` *such that the frequency of each character in this substring is greater than or equal to* `k`.
+
+**Example 1:**
+
+```
+Input: s = "aaabb", k = 3
+Output: 3
+Explanation: The longest substring is "aaa", as 'a' is repeated 3 times.
+```
+
+**Example 2:**
+
+```
+Input: s = "ababbc", k = 2
+Output: 5
+Explanation: The longest substring is "ababb", as 'a' is repeated 2 times and 'b' is repeated 3 times.
+```
+
+**Constraints:**
+
+- `1 <= s.length <= 10^4`
+- `s` consists of only lowercase English letters.
+- `1 <= k <= 10^5`
+
+## 题目大意
+
+给你一个字符串 s 和一个整数 k ，请你找出 s 中的最长子串， 要求该子串中的每一字符出现次数都不少于 k 。返回这一子串的长度。
+
+## 解题思路
+
+- 最容易想到的思路是递归。如果某个字符出现次数大于 0 小于 k，那么包含这个字符的子串都不满足要求。所以按照这个字符来切分整个字符串，满足题意的最长子串一定不包含切分的字符。切分完取出最长子串即可。时间复杂度 O(26*n)，空间复杂度 O(26^2)
+- 此题另外一个思路是滑动窗口。有一个需要解决的问题是右窗口移动的条件。此题要求最长字符串，那么这个最终的字符串内包含的字符种类最多是 26 种。字符种类就是右窗口移动的条件。依次枚举字符种类，如果当前窗口内的字符种类小于当前枚举的字符种类，那么窗口右移，否则左移。窗口移动中需要动态维护 freq 频次数组。可以每次都循环一遍这个数组，计算出出现次数大于 k 的字符。虽然这种做法只最多循环 26 次，但是还是不高效。更高效的做法是维护 1 个值，一个用来记录当前出现次数小于 k 次的字符种类数 `less`。如果 freq 为 0 ，说明小于 k 次的字符种类数要发生变化，如果是右窗口移动，那么 `less++`，如果是左窗口移动，那么`less--`。同理，如果 freq 为 k ，说明小于 k 次的字符种类数要发生变化，如果是右窗口移动，那么 `less--`，如果是左窗口移动，那么`less++`。在枚举 26 个字符种类中，动态维护记录出最长字符串。枚举完成，最长字符串长度也就求出来了。时间复杂度 O(26*n)，空间复杂度 O(26)
+
+## 代码
+
+```go
+package leetcode
+
+import "strings"
+
+// 解法一 滑动窗口
+func longestSubstring(s string, k int) int {
+ res := 0
+ for t := 1; t <= 26; t++ {
+ freq, total, lessK, left, right := [26]int{}, 0, 0, 0, -1
+ for left < len(s) {
+ if right+1 < len(s) && total <= t {
+ if freq[s[right+1]-'a'] == 0 {
+ total++
+ lessK++
+ }
+ freq[s[right+1]-'a']++
+ if freq[s[right+1]-'a'] == k {
+ lessK--
+ }
+ right++
+ } else {
+ if freq[s[left]-'a'] == k {
+ lessK++
+ }
+ freq[s[left]-'a']--
+ if freq[s[left]-'a'] == 0 {
+ total--
+ lessK--
+ }
+ left++
+ }
+ if lessK == 0 {
+ res = max(res, right-left+1)
+ }
+
+ }
+ }
+ return res
+}
+
+func max(a, b int) int {
+ if a > b {
+ return a
+ }
+ return b
+}
+
+// 解法二 递归分治
+func longestSubstring1(s string, k int) int {
+ if s == "" {
+ return 0
+ }
+ freq, split, res := [26]int{}, byte(0), 0
+ for _, ch := range s {
+ freq[ch-'a']++
+ }
+ for i, c := range freq[:] {
+ if 0 < c && c < k {
+ split = 'a' + byte(i)
+ break
+ }
+ }
+ if split == 0 {
+ return len(s)
+ }
+ for _, subStr := range strings.Split(s, string(split)) {
+ res = max(res, longestSubstring1(subStr, k))
+ }
+ return res
+}
+```
\ No newline at end of file
diff --git a/leetcode/0396.Rotate-Function/396. Rotate Function.go b/leetcode/0396.Rotate-Function/396. Rotate Function.go
new file mode 100644
index 000000000..aecc5ae1c
--- /dev/null
+++ b/leetcode/0396.Rotate-Function/396. Rotate Function.go
@@ -0,0 +1,18 @@
+package leetcode
+
+func maxRotateFunction(nums []int) int {
+ n := len(nums)
+ var sum, f int
+ for i, num := range nums {
+ sum += num
+ f += i * num // F(0)
+ }
+ ans := f
+ for i := 1; i < n; i++ {
+ f += sum - n*nums[n-i] // F(i) = F(i-1) + sum - n*nums[n-i]
+ if f > ans {
+ ans = f
+ }
+ }
+ return ans
+}
diff --git a/leetcode/0396.Rotate-Function/396. Rotate Function_test.go b/leetcode/0396.Rotate-Function/396. Rotate Function_test.go
new file mode 100644
index 000000000..855323a15
--- /dev/null
+++ b/leetcode/0396.Rotate-Function/396. Rotate Function_test.go
@@ -0,0 +1,46 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question396 struct {
+ para396
+ ans396
+}
+
+// para 是参数
+// one 代表第一个参数
+type para396 struct {
+ one []int
+}
+
+// ans 是答案
+// one 代表第一个答案
+type ans396 struct {
+ one int
+}
+
+func Test_Problem396(t *testing.T) {
+
+ qs := []question396{
+ {
+ para396{[]int{4, 3, 2, 6}},
+ ans396{26},
+ },
+
+ {
+ para396{[]int{100}},
+ ans396{0},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 396------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans396, q.para396
+ fmt.Printf("【input】:%v 【output】:%v\n", p, maxRotateFunction(p.one))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/0396.Rotate-Function/README.md b/leetcode/0396.Rotate-Function/README.md
new file mode 100644
index 000000000..ed1ab9c5a
--- /dev/null
+++ b/leetcode/0396.Rotate-Function/README.md
@@ -0,0 +1,110 @@
+# [396. Rotate Function](https://leetcode.com/problems/rotate-function/)
+
+## 题目
+
+You are given an integer array `nums` of length `n`.
+
+Assume `arrk` to be an array obtained by rotating `nums` by `k` positions clock-wise. We define the **rotation function** `F` on `nums` as follow:
+
+- `F(k) = 0 * arrk[0] + 1 * arrk[1] + ... + (n - 1) * arrk[n - 1]`.
+
+Return the maximum value of `F(0), F(1), ..., F(n-1)`.
+
+The test cases are generated so that the answer fits in a **32-bit** integer.
+
+**Example 1:**
+
+```c
+Input: nums = [4,3,2,6]
+Output: 26
+Explanation:
+F(0) = (0 * 4) + (1 * 3) + (2 * 2) + (3 * 6) = 0 + 3 + 4 + 18 = 25
+F(1) = (0 * 6) + (1 * 4) + (2 * 3) + (3 * 2) = 0 + 4 + 6 + 6 = 16
+F(2) = (0 * 2) + (1 * 6) + (2 * 4) + (3 * 3) = 0 + 6 + 8 + 9 = 23
+F(3) = (0 * 3) + (1 * 2) + (2 * 6) + (3 * 4) = 0 + 2 + 12 + 12 = 26
+So the maximum value of F(0), F(1), F(2), F(3) is F(3) = 26.
+```
+
+**Example 2:**
+
+```c
+Input: nums = [100]
+Output: 0
+```
+
+**Constraints:**
+
+- `n == nums.length`
+- `1 <= n <= 105`
+- `-100 <= nums[i] <= 100`
+
+## 题目大意
+
+给定一个长度为`n`的整数数组`nums`，设`arrk`是数组`nums`顺时针旋转`k`个位置后的数组。
+
+定义`nums`的旋转函数`F`为：
+
+- `F(k) = 0 * arrk[0] + 1 * arrk[1] + ... + (n - 1) * arrk[n - 1]`
+
+返回`F(0), F(1), ..., F(n-1)`中的最大值。
+
+## 解题思路
+
+**抽象化观察：**
+
+```c
+nums = [A0, A1, A2, A3]
+
+sum = A0 + A1 + A2+ A3
+F(0) = 0*A0 +0*A0 + 1*A1 + 2*A2 + 3*A3
+
+F(1) = 0*A3 + 1*A0 + 2*A1 + 3*A2
+ = F(0) + (A0 + A1 + A2) - 3*A3
+ = F(0) + (sum-A3) - 3*A3
+ = F(0) + sum - 4*A3
+
+F(2) = 0*A2 + 1*A3 + 2*A0 + 3*A1
+ = F(1) + A3 + A0 + A1 - 3*A2
+ = F(1) + sum - 4*A2
+
+F(3) = 0*A1 + 1*A2 + 2*A3 + 3*A0
+ = F(2) + A2 + A3 + A0 - 3*A1
+ = F(2) + sum - 4*A1
+
+// 记sum为nums数组中所有元素和
+// 可以猜测当0 ≤ i < n时存在公式:
+F(i) = F(i-1) + sum - n * A(n-i)
+```
+
+**数学归纳法证明迭代公式：**
+
+根据题目中给定的旋转函数公式可得已知条件：
+
+- `F(0) = 0×nums[0] + 1×nums[1] + ... + (n−1)×nums[n−1]`；
+
+- `F(1) = 1×nums[0] + 2×nums[1] + ... + 0×nums[n-1]`。
+
+令数组`nums`中所有元素和为`sum`，用数学归纳法验证：当`1 ≤ k < n`时，`F(k) = F(k-1) + sum - n×nums[n-k]`成立。
+
+**归纳奠基**：证明`k=1`时命题成立。
+
+```c
+F(1) = 1×nums[0] + 2×nums[1] + ... + 0×nums[n-1]
+ = F(0) + sum - n×nums[n-1]
+```
+
+**归纳假设**：假设`F(k) = F(k-1) + sum - n×nums[n-k]`成立。
+
+**归纳递推**：由归纳假设推出`F(k+1) = F(k) + sum - n×nums[n-(k+1)]`成立，则假设的递推公式成立。
+
+```c
+F(k+1) = (k+1)×nums[0] + k×nums[1] + ... + 0×nums[n-1]
+ = F(k) + sum - n×nums[n-(k+1)]
+```
+
+因此可以得到递推公式：
+
+- 当`n = 0`时，`F(0) = 0×nums[0] + 1×nums[1] + ... + (n−1)×nums[n−1]`
+- 当`1 ≤ k < n`时，`F(k) = F(k-1) + sum - n×nums[n-k]`成立。
+
+循环遍历`0 ≤ k < n`，计算出不同的`F(k)`并不断更新最大值，就能求出`F(0), F(1), ..., F(n-1)`中的最大值。
diff --git a/leetcode/0400.Nth-Digit/400.Nth Digit.go b/leetcode/0400.Nth-Digit/400.Nth Digit.go
new file mode 100644
index 000000000..26d518223
--- /dev/null
+++ b/leetcode/0400.Nth-Digit/400.Nth Digit.go
@@ -0,0 +1,19 @@
+package leetcode
+
+import "math"
+
+func findNthDigit(n int) int {
+ if n <= 9 {
+ return n
+ }
+ bits := 1
+ for n > 9*int(math.Pow10(bits-1))*bits {
+ n -= 9 * int(math.Pow10(bits-1)) * bits
+ bits++
+ }
+ idx := n - 1
+ start := int(math.Pow10(bits - 1))
+ num := start + idx/bits
+ digitIdx := idx % bits
+ return num / int(math.Pow10(bits-digitIdx-1)) % 10
+}
diff --git a/leetcode/0400.Nth-Digit/400.Nth Digit_test.go b/leetcode/0400.Nth-Digit/400.Nth Digit_test.go
new file mode 100644
index 000000000..b7ecfeaf7
--- /dev/null
+++ b/leetcode/0400.Nth-Digit/400.Nth Digit_test.go
@@ -0,0 +1,45 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question400 struct {
+ para400
+ ans400
+}
+
+// para 是参数
+type para400 struct {
+ n int
+}
+
+// ans 是答案
+type ans400 struct {
+ ans int
+}
+
+func Test_Problem400(t *testing.T) {
+
+ qs := []question400{
+
+ {
+ para400{3},
+ ans400{3},
+ },
+
+ {
+ para400{11},
+ ans400{0},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 400------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans400, q.para400
+ fmt.Printf("【input】:%v 【output】:%v\n", p.n, findNthDigit(p.n))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/0400.Nth-Digit/README.md b/leetcode/0400.Nth-Digit/README.md
new file mode 100644
index 000000000..fefe14588
--- /dev/null
+++ b/leetcode/0400.Nth-Digit/README.md
@@ -0,0 +1,67 @@
+# [400. Nth Digit](https://leetcode.com/problems/nth-digit/)
+
+## 题目
+
+Given an integer n, return the nth digit of the infinite integer sequence [1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, ...].
+
+**Example 1**:
+
+ Input: n = 3
+ Output: 3
+
+**Example 2**:
+
+ Input: n = 11
+ Output: 0
+ Explanation: The 11th digit of the sequence 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, ... is a 0, which is part of the number 10.
+
+**Constraints:**
+
+- 1 <= n <= int(math.Pow(2, 31)) - 1
+
+## 题目大意
+
+给你一个整数 n ，请你在无限的整数序列 [1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, ...] 中找出并返回第 n 位数字。
+
+## 解题思路
+
+- bits = 1 的时候有 1,2,3,4,5,6,7,8,9 这 9 个数; 9 = math.Pow10(bits - 1) * bits
+- bits = 2 的时候有 10-99 这 90 个数; 90 = math.Pow10(bits - 1) * bits
+- n 不断减去 bits 从 1 开始的数字总数,求出 n 所在的数字是几位数即 bits
+- 计算 n 所在的数字 num，等于初始值加上 (n - 1) / bits
+- 计算 n 所在这个数字的第几位 digitIdx 等于 (n - 1) % bits
+- 计算出 digitIdx 位的数字
+
+ ### 以11 为例:
+ 11 - 9 = 2
+
+ (2 - 1) / 2 = 0
+
+ (2 - 1) % 2 = 1
+
+ 也就是说第 11 位数字是位数是 2 的第一个数字的第二位，即是 0
+
+## 代码
+
+```go
+
+package leetcode
+
+import "math"
+
+func findNthDigit(n int) int {
+ if n <= 9 {
+ return n
+ }
+ bits := 1
+ for n > 9*int(math.Pow10(bits-1))*bits {
+ n -= 9 * int(math.Pow10(bits-1)) * bits
+ bits++
+ }
+ idx := n - 1
+ start := int(math.Pow10(bits - 1))
+ num := start + idx/bits
+ digitIdx := idx % bits
+ return num / int(math.Pow10(bits-digitIdx-1)) % 10
+}
+```
\ No newline at end of file
diff --git a/leetcode/0401.Binary-Watch/401. Binary Watch.go b/leetcode/0401.Binary-Watch/401. Binary Watch.go
index cd42713a8..39cbf8393 100644
--- a/leetcode/0401.Binary-Watch/401. Binary Watch.go
+++ b/leetcode/0401.Binary-Watch/401. Binary Watch.go
@@ -5,6 +5,43 @@ import (
"strconv"
)
+// 解法一
+func readBinaryWatch(num int) []string {
+ memo := make([]int, 60)
+ // count the number of 1 in a binary number
+ count := func(n int) int {
+ if memo[n] != 0 {
+ return memo[n]
+ }
+ originN, res := n, 0
+ for n != 0 {
+ n = n & (n - 1)
+ res++
+ }
+ memo[originN] = res
+ return res
+ }
+ // fmtMinute format minute 0:1 -> 0:01
+ fmtMinute := func(m int) string {
+ if m < 10 {
+ return "0" + strconv.Itoa(m)
+ }
+ return strconv.Itoa(m)
+ }
+
+ var res []string
+ // traverse 0:00 -> 12:00
+ for i := 0; i < 12; i++ {
+ for j := 0; j < 60; j++ {
+ if count(i)+count(j) == num {
+ res = append(res, strconv.Itoa(i)+":"+fmtMinute(j))
+ }
+ }
+ }
+ return res
+}
+
+// 解法二 打表
var (
hour = []string{"1", "2", "4", "8"}
minute = []string{"01", "02", "04", "08", "16", "32"}
@@ -24,11 +61,11 @@ var (
}
)
-func readBinaryWatch(num int) []string {
+func readBinaryWatch1(num int) []string {
+ var res []string
if num > 8 {
- return []string{}
+ return res
}
- res := []string{}
for i := 0; i <= num; i++ {
for j := 0; j < len(hourMap[i]); j++ {
for k := 0; k < len(minuteMap[num-i]); k++ {
@@ -39,11 +76,11 @@ func readBinaryWatch(num int) []string {
return res
}
-/// ---------------------------------------
-/// ---------------------------------------
-/// ---------------------------------------
-/// ---------------------------------------
-/// ---------------------------------------
+// / ---------------------------------------
+// / ---------------------------------------
+// / ---------------------------------------
+// / ---------------------------------------
+// / ---------------------------------------
// 以下是打表用到的函数
// 调用 findReadBinaryWatchMinute(num, 0, c, &res) 打表
func findReadBinaryWatchMinute(target, index int, c []int, res *[]string) {
diff --git a/leetcode/0412.Fizz-Buzz/412. Fizz Buzz.go b/leetcode/0412.Fizz-Buzz/412. Fizz Buzz.go
index bfac3f7f4..cd3fbcd2f 100644
--- a/leetcode/0412.Fizz-Buzz/412. Fizz Buzz.go
+++ b/leetcode/0412.Fizz-Buzz/412. Fizz Buzz.go
@@ -3,18 +3,16 @@ package leetcode
import "strconv"
func fizzBuzz(n int) []string {
- if n < 0 {
- return []string{}
- }
solution := make([]string, n)
for i := 1; i <= n; i++ {
- if i%3 == 0 && i%5 == 0 {
- solution[i-1] = "FizzBuzz"
- } else if i%3 == 0 {
- solution[i-1] = "Fizz"
- } else if i%5 == 0 {
- solution[i-1] = "Buzz"
- } else {
+ solution[i-1] = ""
+ if i%3 == 0 {
+ solution[i-1] += "Fizz"
+ }
+ if i%5 == 0 {
+ solution[i-1] += "Buzz"
+ }
+ if solution[i-1] == "" {
solution[i-1] = strconv.Itoa(i)
}
}
diff --git a/leetcode/0413.Arithmetic-Slices/413. Arithmetic Slices.go b/leetcode/0413.Arithmetic-Slices/413. Arithmetic Slices.go
new file mode 100644
index 000000000..289caa828
--- /dev/null
+++ b/leetcode/0413.Arithmetic-Slices/413. Arithmetic Slices.go
@@ -0,0 +1,17 @@
+package leetcode
+
+func numberOfArithmeticSlices(A []int) int {
+ if len(A) < 3 {
+ return 0
+ }
+ res, dp := 0, 0
+ for i := 1; i < len(A)-1; i++ {
+ if A[i+1]-A[i] == A[i]-A[i-1] {
+ dp++
+ res += dp
+ } else {
+ dp = 0
+ }
+ }
+ return res
+}
diff --git a/leetcode/0413.Arithmetic-Slices/413. Arithmetic Slices_test.go b/leetcode/0413.Arithmetic-Slices/413. Arithmetic Slices_test.go
new file mode 100644
index 000000000..40fa2245c
--- /dev/null
+++ b/leetcode/0413.Arithmetic-Slices/413. Arithmetic Slices_test.go
@@ -0,0 +1,52 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question413 struct {
+ para413
+ ans413
+}
+
+// para 是参数
+// one 代表第一个参数
+type para413 struct {
+ A []int
+}
+
+// ans 是答案
+// one 代表第一个答案
+type ans413 struct {
+ one int
+}
+
+func Test_Problem413(t *testing.T) {
+
+ qs := []question413{
+
+ {
+ para413{[]int{1, 2, 3, 4}},
+ ans413{3},
+ },
+
+ {
+ para413{[]int{1, 2, 3, 4, 9}},
+ ans413{3},
+ },
+
+ {
+ para413{[]int{1, 2, 3, 4, 5, 6, 7}},
+ ans413{3},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 413------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans413, q.para413
+ fmt.Printf("【input】:%v 【output】:%v\n", p, numberOfArithmeticSlices(p.A))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/0413.Arithmetic-Slices/README.md b/leetcode/0413.Arithmetic-Slices/README.md
new file mode 100644
index 000000000..3a8575ba1
--- /dev/null
+++ b/leetcode/0413.Arithmetic-Slices/README.md
@@ -0,0 +1,64 @@
+# [413. Arithmetic Slices](https://leetcode.com/problems/arithmetic-slices/)
+
+
+## 题目
+
+A sequence of numbers is called arithmetic if it consists of at least three elements and if the difference between any two consecutive elements is the same.
+
+For example, these are arithmetic sequences:
+
+```
+1, 3, 5, 7, 9
+7, 7, 7, 7
+3, -1, -5, -9
+```
+
+The following sequence is not arithmetic.
+
+```
+1, 1, 2, 5, 7
+```
+
+A zero-indexed array A consisting of N numbers is given. A slice of that array is any pair of integers (P, Q) such that 0 <= P < Q < N.
+
+A slice (P, Q) of the array A is called arithmetic if the sequence:A[P], A[P + 1], ..., A[Q - 1], A[Q] is arithmetic. In particular, this means that P + 1 < Q.
+
+The function should return the number of arithmetic slices in the array A.
+
+**Example:**
+
+```
+A = [1, 2, 3, 4]
+
+return: 3, for 3 arithmetic slices in A: [1, 2, 3], [2, 3, 4] and [1, 2, 3, 4] itself.
+```
+
+## 题目大意
+
+数组 A 包含 N 个数，且索引从0开始。数组 A 的一个子数组划分为数组 (P, Q)，P 与 Q 是整数且满足 0<=P<Q<N 。如果满足以下条件，则称子数组(P, Q)为等差数组：元素 A[P], A[p + 1], ..., A[Q - 1], A[Q] 是等差的。并且 P + 1 < Q 。函数要返回数组 A 中所有为等差数组的子数组个数。
+
+## 解题思路
+
+- 由题目给出的定义，至少 3 个数字以上的等差数列才满足题意。连续 k 个连续等差的元素，包含的子等差数列是底层的，1，2，3…… k。所以每判断一组 3 个连续的数列，只需要用一个变量累加前面已经有多少个满足题意的连续元素，只要满足题意的等差数列就加上这个累加值。一旦不满足等差的条件，累加值置 0。如此循环一次即可找到题目要求的答案。
+
+## 代码
+
+```go
+package leetcode
+
+func numberOfArithmeticSlices(A []int) int {
+ if len(A) < 3 {
+ return 0
+ }
+ res, dp := 0, 0
+ for i := 1; i < len(A)-1; i++ {
+ if A[i+1]-A[i] == A[i]-A[i-1] {
+ dp++
+ res += dp
+ } else {
+ dp = 0
+ }
+ }
+ return res
+}
+```
\ No newline at end of file
diff --git a/leetcode/0417.Pacific-Atlantic-Water-Flow/417. Pacific Atlantic Water Flow.go b/leetcode/0417.Pacific-Atlantic-Water-Flow/417. Pacific Atlantic Water Flow.go
new file mode 100644
index 000000000..cfe62561a
--- /dev/null
+++ b/leetcode/0417.Pacific-Atlantic-Water-Flow/417. Pacific Atlantic Water Flow.go
@@ -0,0 +1,45 @@
+package leetcode
+
+import "math"
+
+func pacificAtlantic(matrix [][]int) [][]int {
+ if len(matrix) == 0 || len(matrix[0]) == 0 {
+ return nil
+ }
+ row, col, res := len(matrix), len(matrix[0]), make([][]int, 0)
+ pacific, atlantic := make([][]bool, row), make([][]bool, row)
+ for i := 0; i < row; i++ {
+ pacific[i] = make([]bool, col)
+ atlantic[i] = make([]bool, col)
+ }
+ for i := 0; i < row; i++ {
+ dfs(matrix, i, 0, &pacific, math.MinInt32)
+ dfs(matrix, i, col-1, &atlantic, math.MinInt32)
+ }
+ for j := 0; j < col; j++ {
+ dfs(matrix, 0, j, &pacific, math.MinInt32)
+ dfs(matrix, row-1, j, &atlantic, math.MinInt32)
+ }
+ for i := 0; i < row; i++ {
+ for j := 0; j < col; j++ {
+ if atlantic[i][j] && pacific[i][j] {
+ res = append(res, []int{i, j})
+ }
+ }
+ }
+ return res
+}
+
+func dfs(matrix [][]int, row, col int, visited *[][]bool, height int) {
+ if row < 0 || row >= len(matrix) || col < 0 || col >= len(matrix[0]) {
+ return
+ }
+ if (*visited)[row][col] || matrix[row][col] < height {
+ return
+ }
+ (*visited)[row][col] = true
+ dfs(matrix, row+1, col, visited, matrix[row][col])
+ dfs(matrix, row-1, col, visited, matrix[row][col])
+ dfs(matrix, row, col+1, visited, matrix[row][col])
+ dfs(matrix, row, col-1, visited, matrix[row][col])
+}
diff --git a/leetcode/0417.Pacific-Atlantic-Water-Flow/417. Pacific Atlantic Water Flow_test.go b/leetcode/0417.Pacific-Atlantic-Water-Flow/417. Pacific Atlantic Water Flow_test.go
new file mode 100644
index 000000000..a7278808f
--- /dev/null
+++ b/leetcode/0417.Pacific-Atlantic-Water-Flow/417. Pacific Atlantic Water Flow_test.go
@@ -0,0 +1,56 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question417 struct {
+ para417
+ ans417
+}
+
+// para 是参数
+// one 代表第一个参数
+type para417 struct {
+ matrix [][]int
+}
+
+// ans 是答案
+// one 代表第一个答案
+type ans417 struct {
+ one [][]int
+}
+
+func Test_Problem417(t *testing.T) {
+
+ qs := []question417{
+
+ {
+ para417{[][]int{
+ {1, 2, 2, 3, 5},
+ {3, 2, 3, 4, 4},
+ {2, 4, 5, 3, 1},
+ {6, 7, 1, 4, 5},
+ {5, 1, 1, 2, 4},
+ }},
+ ans417{[][]int{
+ {0, 4},
+ {1, 3},
+ {1, 4},
+ {2, 2},
+ {3, 0},
+ {3, 1},
+ {4, 0},
+ }},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 417------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans417, q.para417
+ fmt.Printf("【input】:%v 【output】:%v\n", p, pacificAtlantic(p.matrix))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/0417.Pacific-Atlantic-Water-Flow/README.md b/leetcode/0417.Pacific-Atlantic-Water-Flow/README.md
new file mode 100644
index 000000000..124ce1fa5
--- /dev/null
+++ b/leetcode/0417.Pacific-Atlantic-Water-Flow/README.md
@@ -0,0 +1,92 @@
+# [417. Pacific Atlantic Water Flow](https://leetcode.com/problems/pacific-atlantic-water-flow/)
+
+
+## 题目
+
+Given an `m x n` matrix of non-negative integers representing the height of each unit cell in a continent, the "Pacific ocean" touches the left and top edges of the matrix and the "Atlantic ocean" touches the right and bottom edges.
+
+Water can only flow in four directions (up, down, left, or right) from a cell to another one with height equal or lower.
+
+Find the list of grid coordinates where water can flow to both the Pacific and Atlantic ocean.
+
+**Note:**
+
+1. The order of returned grid coordinates does not matter.
+2. Both m and n are less than 150.
+
+**Example:**
+
+```
+Given the following 5x5 matrix:
+
+ Pacific ~ ~ ~ ~ ~
+ ~ 1 2 2 3 (5) *
+ ~ 3 2 3 (4) (4) *
+ ~ 2 4 (5) 3 1 *
+ ~ (6) (7) 1 4 5 *
+ ~ (5) 1 1 2 4 *
+ * * * * * Atlantic
+
+Return:
+
+[[0, 4], [1, 3], [1, 4], [2, 2], [3, 0], [3, 1], [4, 0]] (positions with parentheses in above matrix).
+
+```
+
+## 题目大意
+
+给定一个 m x n 的非负整数矩阵来表示一片大陆上各个单元格的高度。“太平洋”处于大陆的左边界和上边界，而“大西洋”处于大陆的右边界和下边界。规定水流只能按照上、下、左、右四个方向流动，且只能从高到低或者在同等高度上流动。请找出那些水流既可以流动到“太平洋”，又能流动到“大西洋”的陆地单元的坐标。
+
+## 解题思路
+
+- 暴力解法，利用 DFS 把二维数据按照行优先搜索一遍，分别标记出太平洋和大西洋水流能到达的位置。再按照列优先搜索一遍，标记出太平洋和大西洋水流能到达的位置。最后两者都能到达的坐标即为所求。
+
+## 代码
+
+```go
+package leetcode
+
+import "math"
+
+func pacificAtlantic(matrix [][]int) [][]int {
+ if len(matrix) == 0 || len(matrix[0]) == 0 {
+ return nil
+ }
+ row, col, res := len(matrix), len(matrix[0]), make([][]int, 0)
+ pacific, atlantic := make([][]bool, row), make([][]bool, row)
+ for i := 0; i < row; i++ {
+ pacific[i] = make([]bool, col)
+ atlantic[i] = make([]bool, col)
+ }
+ for i := 0; i < row; i++ {
+ dfs(matrix, i, 0, &pacific, math.MinInt32)
+ dfs(matrix, i, col-1, &atlantic, math.MinInt32)
+ }
+ for j := 0; j < col; j++ {
+ dfs(matrix, 0, j, &pacific, math.MinInt32)
+ dfs(matrix, row-1, j, &atlantic, math.MinInt32)
+ }
+ for i := 0; i < row; i++ {
+ for j := 0; j < col; j++ {
+ if atlantic[i][j] && pacific[i][j] {
+ res = append(res, []int{i, j})
+ }
+ }
+ }
+ return res
+}
+
+func dfs(matrix [][]int, row, col int, visited *[][]bool, height int) {
+ if row < 0 || row >= len(matrix) || col < 0 || col >= len(matrix[0]) {
+ return
+ }
+ if (*visited)[row][col] || matrix[row][col] < height {
+ return
+ }
+ (*visited)[row][col] = true
+ dfs(matrix, row+1, col, visited, matrix[row][col])
+ dfs(matrix, row-1, col, visited, matrix[row][col])
+ dfs(matrix, row, col+1, visited, matrix[row][col])
+ dfs(matrix, row, col-1, visited, matrix[row][col])
+}
+```
\ No newline at end of file
diff --git a/leetcode/0419.Battleships-in-a-Board/419. Battleships in a Board.go b/leetcode/0419.Battleships-in-a-Board/419. Battleships in a Board.go
new file mode 100644
index 000000000..6e519b858
--- /dev/null
+++ b/leetcode/0419.Battleships-in-a-Board/419. Battleships in a Board.go
@@ -0,0 +1,21 @@
+package leetcode
+
+func countBattleships(board [][]byte) (ans int) {
+ if len(board) == 0 || len(board[0]) == 0 {
+ return 0
+ }
+ for i := range board {
+ for j := range board[i] {
+ if board[i][j] == 'X' {
+ if i > 0 && board[i-1][j] == 'X' {
+ continue
+ }
+ if j > 0 && board[i][j-1] == 'X' {
+ continue
+ }
+ ans++
+ }
+ }
+ }
+ return
+}
diff --git a/leetcode/0419.Battleships-in-a-Board/419. Battleships in a Board_test.go b/leetcode/0419.Battleships-in-a-Board/419. Battleships in a Board_test.go
new file mode 100644
index 000000000..3669aeec3
--- /dev/null
+++ b/leetcode/0419.Battleships-in-a-Board/419. Battleships in a Board_test.go
@@ -0,0 +1,59 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+ "unsafe"
+)
+
+type question419 struct {
+ para419
+ ans419
+}
+
+// para 是参数
+// one 代表第一个参数
+type para419 struct {
+ one [][]byte
+}
+
+// ans 是答案
+// one 代表第一个答案
+type ans419 struct {
+ one int
+}
+
+func Test_Problem419(t *testing.T) {
+
+ qs := []question419{
+
+ {
+ para419{[][]byte{{'X', '.', '.', 'X'}, {'.', '.', '.', 'X'}, {'.', '.', '.', 'X'}}},
+ ans419{2},
+ },
+
+ {
+ para419{[][]byte{{'.'}}},
+ ans419{0},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 419------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans419, q.para419
+ fmt.Printf("【input】:%v 【output】:%v\n", bytesArrayToStringArray(p.one), countBattleships(p.one))
+ }
+ fmt.Printf("\n\n\n")
+
+}
+
+// 在运行go test时 为了更直观地显示[][]byte中的字符而非ASCII码数值
+// bytesArrayToStringArray converts [][]byte to []string
+func bytesArrayToStringArray(b [][]byte) []string {
+ s := make([]string, len(b))
+ for i := range b {
+ s[i] = fmt.Sprintf("[%v]", *(*string)(unsafe.Pointer(&b[i])))
+ }
+ return s
+}
diff --git a/leetcode/0419.Battleships-in-a-Board/README.md b/leetcode/0419.Battleships-in-a-Board/README.md
new file mode 100644
index 000000000..8754bfb91
--- /dev/null
+++ b/leetcode/0419.Battleships-in-a-Board/README.md
@@ -0,0 +1,51 @@
+# [419. Battleships in a Board](https://leetcode.com/problems/battleships-in-a-board/)
+
+## 题目
+
+Given an `m x n` matrix `board` where each cell is a battleship `'X'` or empty `'.'`, return the number of the **battleships** on `board`.
+
+**Battleships** can only be placed horizontally or vertically on `board`. In other words, they can only be made of the shape `1 x k` (`1` row, `k` columns) or `k x 1` (`k` rows, `1` column), where `k` can be of any size. At least one horizontal or vertical cell separates between two battleships (i.e., there are no adjacent battleships).
+
+**Example 1:**
+
+
+
+```c
+Input: board = [["X",".",".","X"],[".",".",".","X"],[".",".",".","X"]]
+Output: 2
+```
+
+**Example 2:**
+
+```c
+Input: board = [["."]]
+Output: 0
+```
+
+**Constraints:**
+
+- `m == board.length`
+- `n == board[i].length`
+- `1 <= m, n <= 200`
+- `board[i][j] is either '.' or 'X'`.
+
+**Follow up:** Could you do it in one-pass, using only `O(1)` extra memory and without modifying the values `board`?
+
+## 题目大意
+
+给定一个大小为`m × n`的矩阵 称之为甲板，矩阵单元格中的`'X'`表示战舰，`'.'`表示空位。
+
+战舰只能水平或竖直摆放在甲板上（换句话说，可以理解为联通的同一行`'X'`或同一列`'X'`只算作一个“战舰群”），任意俩个“战舰群”间都是不相邻的。返回甲板上“战舰群”的数量。
+
+## 解题思路
+
+题目进阶要求一次扫描算法，空间复杂度为`O(1)`，且不能修改矩阵中的值。
+
+因为题目中给定的两个“战舰群”间至少有一个水平或垂直的空位分隔，所以可以通过枚举每个战舰的左上顶点即可统计“战舰群”的个数。
+
+假设当前遍历到矩阵中`'X'`的位置为`(i, j)`，即 `board[i][j]='X'`。如果当前战舰属于一个新的“战舰群”，则需要满足以下条件：
+
+- 当前位置的上方位为空，即 `board[i-1][j]='.'`；
+- 当前位置的左方位为空，即 `board[i][j-1]='.'`；
+
+统计出所有左方位和上方位为空的战舰个数，即可得到“战舰群”的数量。
\ No newline at end of file
diff --git a/leetcode/0423.Reconstruct-Original-Digits-from-English/423. Reconstruct Original Digits from English.go b/leetcode/0423.Reconstruct-Original-Digits-from-English/423. Reconstruct Original Digits from English.go
new file mode 100644
index 000000000..77577c712
--- /dev/null
+++ b/leetcode/0423.Reconstruct-Original-Digits-from-English/423. Reconstruct Original Digits from English.go
@@ -0,0 +1,32 @@
+package leetcode
+
+import (
+ "strings"
+)
+
+func originalDigits(s string) string {
+ digits := make([]int, 26)
+ for i := 0; i < len(s); i++ {
+ digits[int(s[i]-'a')]++
+ }
+ res := make([]string, 10)
+ res[0] = convert('z', digits, "zero", "0")
+ res[6] = convert('x', digits, "six", "6")
+ res[2] = convert('w', digits, "two", "2")
+ res[4] = convert('u', digits, "four", "4")
+ res[5] = convert('f', digits, "five", "5")
+ res[1] = convert('o', digits, "one", "1")
+ res[7] = convert('s', digits, "seven", "7")
+ res[3] = convert('r', digits, "three", "3")
+ res[8] = convert('t', digits, "eight", "8")
+ res[9] = convert('i', digits, "nine", "9")
+ return strings.Join(res, "")
+}
+
+func convert(b byte, digits []int, s string, num string) string {
+ v := digits[int(b-'a')]
+ for i := 0; i < len(s); i++ {
+ digits[int(s[i]-'a')] -= v
+ }
+ return strings.Repeat(num, v)
+}
diff --git a/leetcode/0423.Reconstruct-Original-Digits-from-English/423. Reconstruct Original Digits from English_test.go b/leetcode/0423.Reconstruct-Original-Digits-from-English/423. Reconstruct Original Digits from English_test.go
new file mode 100644
index 000000000..758aa950f
--- /dev/null
+++ b/leetcode/0423.Reconstruct-Original-Digits-from-English/423. Reconstruct Original Digits from English_test.go
@@ -0,0 +1,47 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question423 struct {
+ para423
+ ans423
+}
+
+// para 是参数
+// one 代表第一个参数
+type para423 struct {
+ one string
+}
+
+// ans 是答案
+// one 代表第一个答案
+type ans423 struct {
+ one int
+}
+
+func Test_Problem423(t *testing.T) {
+
+ qs := []question423{
+
+ {
+ para423{"owoztneoer"},
+ ans423{012},
+ },
+
+ {
+ para423{"fviefuro"},
+ ans423{45},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 423------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans423, q.para423
+ fmt.Printf("【input】:%v 【output】:%v\n", p, originalDigits(p.one))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/0423.Reconstruct-Original-Digits-from-English/README.md b/leetcode/0423.Reconstruct-Original-Digits-from-English/README.md
new file mode 100644
index 000000000..ab95e6698
--- /dev/null
+++ b/leetcode/0423.Reconstruct-Original-Digits-from-English/README.md
@@ -0,0 +1,103 @@
+# [423. Reconstruct Original Digits from English](https://leetcode.com/problems/reconstruct-original-digits-from-english/)
+
+
+## 题目
+
+Given a **non-empty** string containing an out-of-order English representation of digits `0-9`, output the digits in ascending order.
+
+**Note:**
+
+1. Input contains only lowercase English letters.
+2. Input is guaranteed to be valid and can be transformed to its original digits. That means invalid inputs such as "abc" or "zerone" are not permitted.
+3. Input length is less than 50,000.
+
+**Example 1:**
+
+```
+Input: "owoztneoer"
+Output: "012"
+```
+
+**Example 2:**
+
+```
+Input: "fviefuro"
+Output: "45"
+```
+
+## 题目大意
+
+给定一个非空字符串，其中包含字母顺序打乱的英文单词表示的数字0-9。按升序输出原始的数字。
+
+注意:
+
+- 输入只包含小写英文字母。
+- 输入保证合法并可以转换为原始的数字，这意味着像 "abc" 或 "zerone" 的输入是不允许的。
+- 输入字符串的长度小于 50,000。
+
+## 解题思路
+
+- 这道题是一道找规律的题目。首先观察 0-9 对应的英文单词，找到特殊规律：所有的偶数都包含一个独特的字母：
+
+ `z` 只在 `zero` 中出现。
+
+ `w` 只在 `two` 中出现。
+
+ `u` 只在 `four` 中出现。
+
+ `x` 只在 `six` 中出现。
+
+ `g` 只在 `eight` 中出现。
+
+- 所以先排除掉这些偶数。然后在看剩下来几个数字对应的英文字母，这也是计算 3，5 和 7 的关键，因为有些单词只在一个奇数和一个偶数中出现（而且偶数已经被计算过了）：
+
+ `h` 只在 `three` 和 `eight` 中出现。
+
+ `f` 只在 `five` 和 `four` 中出现。
+
+ `s` 只在 `seven` 和 `six` 中出现。
+
+- 接下来只需要处理 9 和 0，思路依然相同。
+
+ `i` 在 `nine`，`five`，`six` 和 `eight` 中出现。
+
+ `n` 在 `one`，`seven` 和 `nine` 中出现。
+
+- 最后按照上述的优先级，依次消耗对应的英文字母，生成最终的原始数字。注意按照优先级换算数字的时候，注意有多个重复数字的情况，比如多个 `1`，多个 `5` 等等。
+
+## 代码
+
+```go
+package leetcode
+
+import (
+ "strings"
+)
+
+func originalDigits(s string) string {
+ digits := make([]int, 26)
+ for i := 0; i < len(s); i++ {
+ digits[int(s[i]-'a')]++
+ }
+ res := make([]string, 10)
+ res[0] = convert('z', digits, "zero", "0")
+ res[6] = convert('x', digits, "six", "6")
+ res[2] = convert('w', digits, "two", "2")
+ res[4] = convert('u', digits, "four", "4")
+ res[5] = convert('f', digits, "five", "5")
+ res[1] = convert('o', digits, "one", "1")
+ res[7] = convert('s', digits, "seven", "7")
+ res[3] = convert('r', digits, "three", "3")
+ res[8] = convert('t', digits, "eight", "8")
+ res[9] = convert('i', digits, "nine", "9")
+ return strings.Join(res, "")
+}
+
+func convert(b byte, digits []int, s string, num string) string {
+ v := digits[int(b-'a')]
+ for i := 0; i < len(s); i++ {
+ digits[int(s[i]-'a')] -= v
+ }
+ return strings.Repeat(num, v)
+}
+```
\ No newline at end of file
diff --git a/leetcode/0429.N-ary-Tree-Level-Order-Traversal/429. N-ary Tree Level Order Traversal.go b/leetcode/0429.N-ary-Tree-Level-Order-Traversal/429. N-ary Tree Level Order Traversal.go
new file mode 100644
index 000000000..dfcf57a1e
--- /dev/null
+++ b/leetcode/0429.N-ary-Tree-Level-Order-Traversal/429. N-ary Tree Level Order Traversal.go
@@ -0,0 +1,39 @@
+package leetcode
+
+/**
+ * Definition for a Node.
+ * type Node struct {
+ * Val int
+ * Children []*Node
+ * }
+ */
+
+type Node struct {
+ Val int
+ Children []*Node
+}
+
+func levelOrder(root *Node) [][]int {
+ var res [][]int
+ var temp []int
+ if root == nil {
+ return res
+ }
+ queue := []*Node{root, nil}
+ for len(queue) > 1 {
+ node := queue[0]
+ queue = queue[1:]
+ if node == nil {
+ queue = append(queue, nil)
+ res = append(res, temp)
+ temp = []int{}
+ } else {
+ temp = append(temp, node.Val)
+ if len(node.Children) > 0 {
+ queue = append(queue, node.Children...)
+ }
+ }
+ }
+ res = append(res, temp)
+ return res
+}
diff --git a/leetcode/0429.N-ary-Tree-Level-Order-Traversal/429. N-ary Tree Level Order Traversal_test.go b/leetcode/0429.N-ary-Tree-Level-Order-Traversal/429. N-ary Tree Level Order Traversal_test.go
new file mode 100644
index 000000000..fe56775a4
--- /dev/null
+++ b/leetcode/0429.N-ary-Tree-Level-Order-Traversal/429. N-ary Tree Level Order Traversal_test.go
@@ -0,0 +1,10 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+func Test_Problem429(t *testing.T) {
+ fmt.Printf("success\n")
+}
diff --git a/leetcode/0429.N-ary-Tree-Level-Order-Traversal/README.md b/leetcode/0429.N-ary-Tree-Level-Order-Traversal/README.md
new file mode 100644
index 000000000..79d4912d9
--- /dev/null
+++ b/leetcode/0429.N-ary-Tree-Level-Order-Traversal/README.md
@@ -0,0 +1,85 @@
+# [429. N-ary Tree Level Order Traversal](https://leetcode.com/problems/n-ary-tree-level-order-traversal/)
+
+
+## 题目
+
+Given an n-ary tree, return the *level order* traversal of its nodes' values.
+
+*Nary-Tree input serialization is represented in their level order traversal, each group of children is separated by the null value (See examples).*
+
+**Example 1:**
+
+
+
+```
+Input: root = [1,null,3,2,4,null,5,6]
+Output: [[1],[3,2,4],[5,6]]
+
+```
+
+**Example 2:**
+
+
+
+```
+Input: root = [1,null,2,3,4,5,null,null,6,7,null,8,null,9,10,null,null,11,null,12,null,13,null,null,14]
+Output: [[1],[2,3,4,5],[6,7,8,9,10],[11,12,13],[14]]
+
+```
+
+**Constraints:**
+
+- The height of the n-ary tree is less than or equal to `1000`
+- The total number of nodes is between `[0, 104]`
+
+## 题目大意
+
+给定一个 N 叉树，返回其节点值的层序遍历。（即从左到右，逐层遍历）。树的序列化输入是用层序遍历，每组子节点都由 null 值分隔（参见示例）。
+
+## 解题思路
+
+- 这是 n 叉树的系列题，第 589 题也是这一系列的题目。这一题思路不难，既然是层序遍历，用 BFS 解答。
+
+## 代码
+
+```go
+package leetcode
+
+/**
+ * Definition for a Node.
+ * type Node struct {
+ * Val int
+ * Children []*Node
+ * }
+ */
+
+type Node struct {
+ Val int
+ Children []*Node
+}
+
+func levelOrder(root *Node) [][]int {
+ var res [][]int
+ var temp []int
+ if root == nil {
+ return res
+ }
+ queue := []*Node{root, nil}
+ for len(queue) > 1 {
+ node := queue[0]
+ queue = queue[1:]
+ if node == nil {
+ queue = append(queue, nil)
+ res = append(res, temp)
+ temp = []int{}
+ } else {
+ temp = append(temp, node.Val)
+ if len(node.Children) > 0 {
+ queue = append(queue, node.Children...)
+ }
+ }
+ }
+ res = append(res, temp)
+ return res
+}
+```
\ No newline at end of file
diff --git a/leetcode/0434.Number-of-Segments-in-a-String/434.Number of Segments in a String.go b/leetcode/0434.Number-of-Segments-in-a-String/434.Number of Segments in a String.go
new file mode 100644
index 000000000..626caebe8
--- /dev/null
+++ b/leetcode/0434.Number-of-Segments-in-a-String/434.Number of Segments in a String.go
@@ -0,0 +1,18 @@
+package leetcode
+
+func countSegments(s string) int {
+ segments := false
+ cnt := 0
+ for _, v := range s {
+ if v == ' ' && segments {
+ segments = false
+ cnt += 1
+ } else if v != ' ' {
+ segments = true
+ }
+ }
+ if segments {
+ cnt++
+ }
+ return cnt
+}
diff --git a/leetcode/0434.Number-of-Segments-in-a-String/434.Number of Segments in a String_test.go b/leetcode/0434.Number-of-Segments-in-a-String/434.Number of Segments in a String_test.go
new file mode 100644
index 000000000..7c634601e
--- /dev/null
+++ b/leetcode/0434.Number-of-Segments-in-a-String/434.Number of Segments in a String_test.go
@@ -0,0 +1,55 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question434 struct {
+ para434
+ ans434
+}
+
+// s 是参数
+type para434 struct {
+ s string
+}
+
+// ans 是答案
+type ans434 struct {
+ ans int
+}
+
+func Test_Problem434(t *testing.T) {
+
+ qs := []question434{
+
+ {
+ para434{"Hello, my name is John"},
+ ans434{5},
+ },
+
+ {
+ para434{"Hello"},
+ ans434{1},
+ },
+
+ {
+ para434{"love live! mu'sic forever"},
+ ans434{4},
+ },
+
+ {
+ para434{""},
+ ans434{0},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 434------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans434, q.para434
+ fmt.Printf("【input】:%v 【output】:%v\n", p, countSegments(p.s))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/0434.Number-of-Segments-in-a-String/README.md b/leetcode/0434.Number-of-Segments-in-a-String/README.md
new file mode 100644
index 000000000..48fd4b8da
--- /dev/null
+++ b/leetcode/0434.Number-of-Segments-in-a-String/README.md
@@ -0,0 +1,70 @@
+# [434. Number of Segments in a String](https://leetcode.com/problems/number-of-segments-in-a-string/)
+
+
+## 题目
+
+You are given a string s, return the number of segments in the string.
+
+A segment is defined to be a contiguous sequence of non-space characters.
+
+**Example 1:**
+
+ Input: s = "Hello, my name is John"
+ Output: 5
+ Explanation: The five segments are ["Hello,", "my", "name", "is", "John"]
+
+**Example 2:**
+
+ Input: s = "Hello"
+ Output: 1
+
+**Example 3:**
+
+ Input: s = "love live! mu'sic forever"
+ Output: 4
+
+**Example 4:**
+
+ Input: s = ""
+ Output: 0
+
+**Constraints**
+
+ - 0 <= s.length <= 300
+ - s consists of lower-case and upper-case English letters, digits or one of the following characters "!@#$%^&*()_+-=',.:".
+ - The only space character in s is ' '.
+
+## 题目大意
+
+统计字符串中的单词个数，这里的单词指的是连续的不是空格的字符。
+
+请注意，你可以假定字符串里不包括任何不可打印的字符。
+
+## 解题思路
+
+- 以空格为分割计算元素个数
+
+## 代码
+
+```go
+
+package leetcode
+
+func countSegments(s string) int {
+ segments := false
+ cnt := 0
+ for _, v := range s {
+ if v == ' ' && segments {
+ segments = false
+ cnt += 1
+ } else if v != ' ' {
+ segments = true
+ }
+ }
+ if segments {
+ cnt++
+ }
+ return cnt
+}
+
+```
\ No newline at end of file
diff --git a/leetcode/0437.Path-Sum-III/437. Path Sum III.go b/leetcode/0437.Path-Sum-III/437. Path Sum III.go
index 96e208ec6..cdbe52bf6 100644
--- a/leetcode/0437.Path-Sum-III/437. Path Sum III.go
+++ b/leetcode/0437.Path-Sum-III/437. Path Sum III.go
@@ -16,6 +16,30 @@ type TreeNode = structures.TreeNode
* }
*/
+// 解法一 带缓存 dfs
+func pathSum(root *TreeNode, targetSum int) int {
+ prefixSum := make(map[int]int)
+ prefixSum[0] = 1
+ return dfs(root, prefixSum, 0, targetSum)
+}
+
+func dfs(root *TreeNode, prefixSum map[int]int, cur, sum int) int {
+ if root == nil {
+ return 0
+ }
+ cur += root.Val
+ cnt := 0
+ if v, ok := prefixSum[cur-sum]; ok {
+ cnt = v
+ }
+ prefixSum[cur]++
+ cnt += dfs(root.Left, prefixSum, cur, sum)
+ cnt += dfs(root.Right, prefixSum, cur, sum)
+ prefixSum[cur]--
+ return cnt
+}
+
+// 解法二
func pathSumIII(root *TreeNode, sum int) int {
if root == nil {
return 0
diff --git a/leetcode/0437.Path-Sum-III/437. Path Sum III_test.go b/leetcode/0437.Path-Sum-III/437. Path Sum III_test.go
index 4f122a2da..089bef78a 100644
--- a/leetcode/0437.Path-Sum-III/437. Path Sum III_test.go
+++ b/leetcode/0437.Path-Sum-III/437. Path Sum III_test.go
@@ -45,7 +45,7 @@ func Test_Problem437(t *testing.T) {
_, p := q.ans437, q.para437
fmt.Printf("【input】:%v ", p)
root := structures.Ints2TreeNode(p.one)
- fmt.Printf("【output】:%v \n", pathSumIII(root, p.sum))
+ fmt.Printf("【output】:%v \n", pathSum(root, p.sum))
}
fmt.Printf("\n\n\n")
}
diff --git a/leetcode/0437.Path-Sum-III/README.md b/leetcode/0437.Path-Sum-III/README.md
old mode 100755
new mode 100644
index cad475bdd..755a4e263
--- a/leetcode/0437.Path-Sum-III/README.md
+++ b/leetcode/0437.Path-Sum-III/README.md
@@ -3,32 +3,34 @@
## 题目
-You are given a binary tree in which each node contains an integer value.
+Given the `root` of a binary tree and an integer `targetSum`, return *the number of paths where the sum of the values along the path equals* `targetSum`.
-Find the number of paths that sum to a given value.
+The path does not need to start or end at the root or a leaf, but it must go downwards (i.e., traveling only from parent nodes to child nodes).
-The path does not need to start or end at the root or a leaf, but it must go downwards (traveling only from parent nodes to child nodes).
+**Example 1:**
-The tree has no more than 1,000 nodes and the values are in the range -1,000,000 to 1,000,000.
+
-**Example:**
+```
+Input: root = [10,5,-3,3,2,null,11,3,-2,null,1], targetSum = 8
+Output: 3
+Explanation: The paths that sum to 8 are shown.
- root = [10,5,-3,3,2,null,11,3,-2,null,1], sum = 8
-
- 10
- / \
- 5 -3
- / \ \
- 3 2 11
- / \ \
- 3 -2 1
-
- Return 3. The paths that sum to 8 are:
-
- 1. 5 -> 3
- 2. 5 -> 2 -> 1
- 3. -3 -> 11
+```
+**Example 2:**
+
+```
+Input: root = [5,4,8,11,null,13,4,7,2,null,null,5,1], targetSum = 22
+Output: 3
+
+```
+
+**Constraints:**
+
+- The number of nodes in the tree is in the range `[0, 1000]`.
+- `109 <= Node.val <= 109`
+- `1000 <= targetSum <= 1000`
## 题目大意
@@ -42,3 +44,76 @@ The tree has no more than 1,000 nodes and the values are in the range -1,000,000
- 注意这一题可能出现负数的情况，节点和为 sum，并不一定是最终情况，有可能下面还有正数节点和负数节点相加正好为 0，那么这也是一种情况。一定要遍历到底。
- 一个点是否为 sum 的起点，有 3 种情况，第一种情况路径包含该 root 节点，如果包含该结点，就在它的左子树和右子树中寻找和为 `sum-root.Val` 的情况。第二种情况路径不包含该 root 节点，那么就需要在它的左子树和右子树中分别寻找和为 sum 的结点。
+
+
+## 代码
+
+```go
+
+package leetcode
+
+import (
+ "github.com/halfrost/LeetCode-Go/structures"
+)
+
+// TreeNode define
+type TreeNode = structures.TreeNode
+
+/**
+ * Definition for a binary tree node.
+ * type TreeNode struct {
+ * Val int
+ * Left *TreeNode
+ * Right *TreeNode
+ * }
+ */
+
+// 解法一 带缓存 dfs
+func pathSum(root *TreeNode, targetSum int) int {
+ prefixSum := make(map[int]int)
+ prefixSum[0] = 1
+ return dfs(root, prefixSum, 0, targetSum)
+}
+
+func dfs(root *TreeNode, prefixSum map[int]int, cur, sum int) int {
+ if root == nil {
+ return 0
+ }
+ cur += root.Val
+ cnt := 0
+ if v, ok := prefixSum[cur-sum]; ok {
+ cnt = v
+ }
+ prefixSum[cur]++
+ cnt += dfs(root.Left, prefixSum, cur, sum)
+ cnt += dfs(root.Right, prefixSum, cur, sum)
+ prefixSum[cur]--
+ return cnt
+}
+
+// 解法二
+func pathSumIII(root *TreeNode, sum int) int {
+ if root == nil {
+ return 0
+ }
+ res := findPath437(root, sum)
+ res += pathSumIII(root.Left, sum)
+ res += pathSumIII(root.Right, sum)
+ return res
+}
+
+// 寻找包含 root 这个结点，且和为 sum 的路径
+func findPath437(root *TreeNode, sum int) int {
+ if root == nil {
+ return 0
+ }
+ res := 0
+ if root.Val == sum {
+ res++
+ }
+ res += findPath437(root.Left, sum-root.Val)
+ res += findPath437(root.Right, sum-root.Val)
+ return res
+}
+
+```
\ No newline at end of file
diff --git a/leetcode/0445.Add-Two-Numbers-II/445. Add Two Numbers II.go b/leetcode/0445.Add-Two-Numbers-II/445. Add Two Numbers II.go
index 3211805ad..e4ddee058 100644
--- a/leetcode/0445.Add-Two-Numbers-II/445. Add Two Numbers II.go
+++ b/leetcode/0445.Add-Two-Numbers-II/445. Add Two Numbers II.go
@@ -67,3 +67,72 @@ func getLength(l *ListNode) int {
}
return count
}
+
+func addTwoNumbers1(l1 *ListNode, l2 *ListNode) *ListNode {
+ reservedL1 := reverseList(l1)
+ reservedL2 := reverseList(l2)
+
+ dummyHead := &ListNode{}
+ head := dummyHead
+ carry := 0
+ for reservedL1 != nil || reservedL2 != nil || carry > 0 {
+ val := carry
+ if reservedL1 != nil {
+ val = reservedL1.Val + val
+ reservedL1 = reservedL1.Next
+ }
+ if reservedL2 != nil {
+ val = reservedL2.Val + val
+ reservedL2 = reservedL2.Next
+ }
+ carry = val / 10
+ head.Next = &ListNode{Val: val % 10}
+ head = head.Next
+ }
+ return reverseList(dummyHead.Next)
+}
+
+func reverseList(head *ListNode) *ListNode {
+ var prev *ListNode
+ for head != nil {
+ tmp := head.Next
+ head.Next = prev
+
+ prev = head
+ head = tmp
+ }
+ return prev
+}
+
+func addTwoNumbers(l1 *ListNode, l2 *ListNode) *ListNode {
+ stack1 := pushStack(l1)
+ stack2 := pushStack(l2)
+
+ dummyHead := &ListNode{}
+ head := dummyHead
+ carry := 0
+ for len(stack1) > 0 || len(stack2) > 0 || carry > 0 {
+ val := carry
+ if len(stack1) > 0 {
+ val = val + stack1[len(stack1)-1]
+ stack1 = stack1[:len(stack1)-1]
+ }
+ if len(stack2) > 0 {
+ val = val + stack2[len(stack2)-1]
+ stack2 = stack2[:len(stack2)-1]
+ }
+ carry = val / 10
+ tmp := head.Next
+ head.Next = &ListNode{Val: val % 10, Next: tmp}
+ }
+ return dummyHead.Next
+}
+
+func pushStack(l *ListNode) []int {
+ var stack []int
+ for l != nil {
+ stack = append(stack, l.Val)
+ l = l.Next
+ }
+ return stack
+}
diff --git a/leetcode/0456.132-Pattern/456. 132 Pattern.go b/leetcode/0456.132-Pattern/456. 132 Pattern.go
index 89a75e6b1..af7db50b2 100644
--- a/leetcode/0456.132-Pattern/456. 132 Pattern.go
+++ b/leetcode/0456.132-Pattern/456. 132 Pattern.go
@@ -1,7 +1,6 @@
package leetcode
import (
- "fmt"
"math"
)
@@ -20,7 +19,6 @@ func find132pattern(nums []int) bool {
stack = stack[:len(stack)-1]
}
stack = append(stack, nums[i])
- fmt.Printf("stack = %v \n", stack)
}
return false
}
diff --git a/leetcode/0458.Poor-Pigs/458.Poor Pigs.go b/leetcode/0458.Poor-Pigs/458.Poor Pigs.go
new file mode 100644
index 000000000..81162d51e
--- /dev/null
+++ b/leetcode/0458.Poor-Pigs/458.Poor Pigs.go
@@ -0,0 +1,8 @@
+package leetcode
+
+import "math"
+
+func poorPigs(buckets int, minutesToDie int, minutesToTest int) int {
+ base := minutesToTest/minutesToDie + 1
+ return int(math.Ceil(math.Log10(float64(buckets)) / math.Log10(float64(base))))
+}
diff --git a/leetcode/0458.Poor-Pigs/458.Poor Pigs_test.go b/leetcode/0458.Poor-Pigs/458.Poor Pigs_test.go
new file mode 100644
index 000000000..50bb561ea
--- /dev/null
+++ b/leetcode/0458.Poor-Pigs/458.Poor Pigs_test.go
@@ -0,0 +1,52 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question458 struct {
+ para458
+ ans458
+}
+
+// para 是参数
+type para458 struct {
+ buckets int
+ minutesToDie int
+ minutesToTest int
+}
+
+// ans 是答案
+type ans458 struct {
+ ans int
+}
+
+func Test_Problem458(t *testing.T) {
+
+ qs := []question458{
+
+ {
+ para458{1000, 15, 60},
+ ans458{5},
+ },
+
+ {
+ para458{4, 15, 15},
+ ans458{2},
+ },
+
+ {
+ para458{4, 15, 30},
+ ans458{2},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 458------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans458, q.para458
+ fmt.Printf("【input】:%v 【output】:%v\n", p, poorPigs(p.buckets, p.minutesToDie, p.minutesToTest))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/0458.Poor-Pigs/README.md b/leetcode/0458.Poor-Pigs/README.md
new file mode 100644
index 000000000..e8dba552d
--- /dev/null
+++ b/leetcode/0458.Poor-Pigs/README.md
@@ -0,0 +1,77 @@
+# [458. Poor Pigs](https://leetcode.com/problems/poor-pigs/)
+
+## 题目
+
+There are buckets buckets of liquid, where exactly one of the buckets is poisonous. To figure out which one is poisonous, you feed some number of (poor) pigs the liquid to see whether they will die or not. Unfortunately, you only have minutesToTest minutes to determine which bucket is poisonous.
+
+You can feed the pigs according to these steps:
+
+- Choose some live pigs to feed.
+- For each pig, choose which buckets to feed it. The pig will consume all the chosen buckets simultaneously and will take no time.
+- Wait for minutesToDie minutes. You may not feed any other pigs during this time.
+- After minutesToDie minutes have passed, any pigs that have been fed the poisonous bucket will die, and all others will survive.
+- Repeat this process until you run out of time.
+
+Given buckets, minutesToDie, and minutesToTest, return the minimum number of pigs needed to figure out which bucket is poisonous within the allotted time.
+
+**Example 1**:
+
+ Input: buckets = 1000, minutesToDie = 15, minutesToTest = 60
+ Output: 5
+
+**Example 2**:
+
+ Input: buckets = 4, minutesToDie = 15, minutesToTest = 15
+ Output: 2
+
+**Example 3**:
+
+ Input: buckets = 4, minutesToDie = 15, minutesToTest = 30
+ Output: 2
+
+**Constraints:**
+
+- 1 <= buckets <= 1000
+- 1 <= minutesToDie <= minutesToTest <= 100
+
+## 题目大意
+
+有 buckets 桶液体，其中 正好 有一桶含有毒药，其余装的都是水。它们从外观看起来都一样。为了弄清楚哪只水桶含有毒药，你可以喂一些猪喝，通过观察猪是否会死进行判断。不幸的是，你只有 minutesToTest 分钟时间来确定哪桶液体是有毒的。
+
+喂猪的规则如下：
+
+- 选择若干活猪进行喂养
+- 可以允许小猪同时饮用任意数量的桶中的水，并且该过程不需要时间。
+- 小猪喝完水后，必须有 minutesToDie 分钟的冷却时间。在这段时间里，你只能观察，而不允许继续喂猪。
+- 过了 minutesToDie 分钟后，所有喝到毒药的猪都会死去，其他所有猪都会活下来。
+- 重复这一过程，直到时间用完。
+
+给你桶的数目 buckets ，minutesToDie 和 minutesToTest ，返回在规定时间内判断哪个桶有毒所需的 最小 猪数。
+
+## 解题思路
+
+使用数学方法,以 minutesToDie=15, minutesToTest=60, 1 只小猪为例,可以测试 5 只桶
+
+- 0-15 小猪吃第一个桶中的液体,如果死去，则第一个桶有毒,否则继续测试
+- 15-30 小猪吃第二个桶中的液体，如果死去，则第二个桶有毒,否则继续测试
+- 30-45 小猪吃第三个桶中的液体，如果死去，则第三个桶有毒,否则继续测试
+- 45-60 小猪吃第四个桶中的液体，如果死去，则第四个桶有毒
+- 如果最后小猪没有死去，则第五个桶有毒
+
+所以一只小猪在 minutesToDie 和 minutesToTest 时间一定的情况下可以最多判断 base = minutesToTest / minutesToDie + 1 个桶
+
+假设小猪的数量是 num,那么 pow(base, num) >= buckets,根据对数运算规则，两边分别取对数得到: num >= Log10(buckets) / Log10(base)
+
+## 代码
+
+```go
+
+package leetcode
+
+import "math"
+
+func poorPigs(buckets int, minutesToDie int, minutesToTest int) int {
+ base := minutesToTest/minutesToDie + 1
+ return int(math.Ceil(math.Log10(float64(buckets)) / math.Log10(float64(base))))
+}
+```
\ No newline at end of file
diff --git a/leetcode/0460.LFU-Cache/460. LFU Cache.go b/leetcode/0460.LFU-Cache/460. LFU Cache.go
new file mode 100644
index 000000000..e2a29f539
--- /dev/null
+++ b/leetcode/0460.LFU-Cache/460. LFU Cache.go
@@ -0,0 +1,74 @@
+package leetcode
+
+import "container/list"
+
+type LFUCache struct {
+ nodes map[int]*list.Element
+ lists map[int]*list.List
+ capacity int
+ min int
+}
+
+type node struct {
+ key int
+ value int
+ frequency int
+}
+
+func Constructor(capacity int) LFUCache {
+ return LFUCache{nodes: make(map[int]*list.Element),
+ lists: make(map[int]*list.List),
+ capacity: capacity,
+ min: 0,
+ }
+}
+
+func (this *LFUCache) Get(key int) int {
+ value, ok := this.nodes[key]
+ if !ok {
+ return -1
+ }
+ currentNode := value.Value.(*node)
+ this.lists[currentNode.frequency].Remove(value)
+ currentNode.frequency++
+ if _, ok := this.lists[currentNode.frequency]; !ok {
+ this.lists[currentNode.frequency] = list.New()
+ }
+ newList := this.lists[currentNode.frequency]
+ newNode := newList.PushBack(currentNode)
+ this.nodes[key] = newNode
+ if currentNode.frequency-1 == this.min && this.lists[currentNode.frequency-1].Len() == 0 {
+ this.min++
+ }
+ return currentNode.value
+}
+
+func (this *LFUCache) Put(key int, value int) {
+ if this.capacity == 0 {
+ return
+ }
+ if currentValue, ok := this.nodes[key]; ok {
+ currentNode := currentValue.Value.(*node)
+ currentNode.value = value
+ this.Get(key)
+ return
+ }
+ if this.capacity == len(this.nodes) {
+ currentList := this.lists[this.min]
+ frontNode := currentList.Front()
+ delete(this.nodes, frontNode.Value.(*node).key)
+ currentList.Remove(frontNode)
+ }
+ this.min = 1
+ currentNode := &node{
+ key: key,
+ value: value,
+ frequency: 1,
+ }
+ if _, ok := this.lists[1]; !ok {
+ this.lists[1] = list.New()
+ }
+ newList := this.lists[1]
+ newNode := newList.PushBack(currentNode)
+ this.nodes[key] = newNode
+}
diff --git a/leetcode/0460.LFU-Cache/460. LFU Cache_test.go b/leetcode/0460.LFU-Cache/460. LFU Cache_test.go
new file mode 100644
index 000000000..12205d94e
--- /dev/null
+++ b/leetcode/0460.LFU-Cache/460. LFU Cache_test.go
@@ -0,0 +1,64 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+func Test_Problem460(t *testing.T) {
+ obj := Constructor(5)
+ fmt.Printf("obj.list = %v obj.map = %v obj.min = %v\n", MLists2Ints(&obj), MList2Ints(&obj), obj.min)
+ obj.Put(1, 1)
+ fmt.Printf("obj.list = %v obj.map = %v obj.min = %v\n", MLists2Ints(&obj), MList2Ints(&obj), obj.min)
+ obj.Put(2, 2)
+ fmt.Printf("obj.list = %v obj.map = %v obj.min = %v\n", MLists2Ints(&obj), MList2Ints(&obj), obj.min)
+ obj.Put(3, 3)
+ fmt.Printf("obj.list = %v obj.map = %v obj.min = %v\n", MLists2Ints(&obj), MList2Ints(&obj), obj.min)
+ obj.Put(4, 4)
+ fmt.Printf("obj.list = %v obj.map = %v obj.min = %v\n", MLists2Ints(&obj), MList2Ints(&obj), obj.min)
+ obj.Put(5, 5)
+ fmt.Printf("obj.list = %v obj.map = %v obj.min = %v\n", MLists2Ints(&obj), MList2Ints(&obj), obj.min)
+
+ param1 := obj.Get(4)
+ fmt.Printf("param_1 = %v obj.list = %v obj.map = %v obj.min = %v\n", param1, MLists2Ints(&obj), MList2Ints(&obj), obj.min)
+ param1 = obj.Get(4)
+ fmt.Printf("param_1 = %v obj.list = %v obj.map = %v obj.min = %v\n", param1, MLists2Ints(&obj), MList2Ints(&obj), obj.min)
+ param1 = obj.Get(4)
+ fmt.Printf("param_1 = %v obj.list = %v obj.map = %v obj.min = %v\n", param1, MLists2Ints(&obj), MList2Ints(&obj), obj.min)
+ param1 = obj.Get(5)
+ fmt.Printf("param_1 = %v obj.list = %v obj.map = %v obj.min = %v\n", param1, MLists2Ints(&obj), MList2Ints(&obj), obj.min)
+ param1 = obj.Get(5)
+ fmt.Printf("param_1 = %v obj.list = %v obj.map = %v obj.min = %v\n", param1, MLists2Ints(&obj), MList2Ints(&obj), obj.min)
+ param1 = obj.Get(5)
+ fmt.Printf("param_1 = %v obj.list = %v obj.map = %v obj.min = %v\n", param1, MLists2Ints(&obj), MList2Ints(&obj), obj.min)
+ obj.Put(6, 6)
+ fmt.Printf("obj.list = %v obj.map = %v obj.min = %v\n", MLists2Ints(&obj), MList2Ints(&obj), obj.min)
+ obj.Put(7, 7)
+ fmt.Printf("obj.list = %v obj.map = %v obj.min = %v\n", MLists2Ints(&obj), MList2Ints(&obj), obj.min)
+ obj.Put(8, 8)
+ fmt.Printf("obj.list = %v obj.map = %v obj.min = %v\n", MLists2Ints(&obj), MList2Ints(&obj), obj.min)
+}
+
+func MList2Ints(lfu *LFUCache) map[int][][]int {
+ res := map[int][][]int{}
+ for k, v := range lfu.nodes {
+ node := v.Value.(*node)
+ arr := [][]int{}
+ tmp := []int{node.key, node.value, node.frequency}
+ arr = append(arr, tmp)
+ res[k] = arr
+ }
+ return res
+}
+
+func MLists2Ints(lfu *LFUCache) map[int][]int {
+ res := map[int][]int{}
+ for k, v := range lfu.lists {
+ tmp := []int{}
+ for head := v.Front(); head != nil; head = head.Next() {
+ tmp = append(tmp, head.Value.(*node).value)
+ }
+ res[k] = tmp
+ }
+ return res
+}
diff --git a/leetcode/0460.LFU-Cache/README.md b/leetcode/0460.LFU-Cache/README.md
new file mode 100644
index 000000000..f4a07c445
--- /dev/null
+++ b/leetcode/0460.LFU-Cache/README.md
@@ -0,0 +1,142 @@
+# [460. LFU Cache](https://leetcode.com/problems/lfu-cache/)
+
+
+## 题目
+
+Design and implement a data structure for [Least Frequently Used (LFU)](https://en.wikipedia.org/wiki/Least_frequently_used) cache.
+
+Implement the `LFUCache` class:
+
+- `LFUCache(int capacity)` Initializes the object with the `capacity` of the data structure.
+- `int get(int key)` Gets the value of the `key` if the `key` exists in the cache. Otherwise, returns `1`.
+- `void put(int key, int value)` Sets or inserts the value if the `key` is not already present. When the cache reaches its `capacity`, it should invalidate the least frequently used item before inserting a new item. For this problem, when there is a tie (i.e., two or more keys with the same frequency), **the least recently** used `key` would be evicted.
+
+**Notice that** the number of times an item is used is the number of calls to the `get` and `put` functions for that item since it was inserted. This number is set to zero when the item is removed.
+
+**Example 1:**
+
+```
+Input
+["LFUCache", "put", "put", "get", "put", "get", "get", "put", "get", "get", "get"]
+[[2], [1, 1], [2, 2], [1], [3, 3], [2], [3], [4, 4], [1], [3], [4]]
+Output
+[null, null, null, 1, null, -1, 3, null, -1, 3, 4]
+
+Explanation
+LFUCache lfu = new LFUCache(2);
+lfu.put(1, 1);
+lfu.put(2, 2);
+lfu.get(1); // return 1
+lfu.put(3, 3); // evicts key 2
+lfu.get(2); // return -1 (not found)
+lfu.get(3); // return 3
+lfu.put(4, 4); // evicts key 1.
+lfu.get(1); // return -1 (not found)
+lfu.get(3); // return 3
+lfu.get(4); // return 4
+
+```
+
+**Constraints:**
+
+- `0 <= capacity, key, value <= 104`
+- At most `10^5` calls will be made to `get` and `put`.
+
+**Follow up:** Could you do both operations in `O(1)` time complexity?
+
+## 题目大意
+
+请你为 最不经常使用（LFU）缓存算法设计并实现数据结构。
+
+实现 LFUCache 类：
+
+- LFUCache(int capacity) - 用数据结构的容量 capacity 初始化对象
+- int get(int key) - 如果键存在于缓存中，则获取键的值，否则返回 -1。
+- void put(int key, int value) - 如果键已存在，则变更其值；如果键不存在，请插入键值对。当缓存达到其容量时，则应该在插入新项之前，使最不经常使用的项无效。在此问题中，当存在平局（即两个或更多个键具有相同使用频率）时，应该去除 最久未使用 的键。
+
+注意「项的使用次数」就是自插入该项以来对其调用 get 和 put 函数的次数之和。使用次数会在对应项被移除后置为 0 。
+
+进阶：你是否可以在 O(1) 时间复杂度内执行两项操作？
+
+## 解题思路
+
+- 这一题是 LFU 经典面试题，详细解释见[第三章 LFUCache 模板](https://books.halfrost.com/leetcode/ChapterThree/LFUCache/)。
+
+## 代码
+
+```go
+package leetcode
+
+import "container/list"
+
+type LFUCache struct {
+ nodes map[int]*list.Element
+ lists map[int]*list.List
+ capacity int
+ min int
+}
+
+type node struct {
+ key int
+ value int
+ frequency int
+}
+
+func Constructor(capacity int) LFUCache {
+ return LFUCache{nodes: make(map[int]*list.Element),
+ lists: make(map[int]*list.List),
+ capacity: capacity,
+ min: 0,
+ }
+}
+
+func (this *LFUCache) Get(key int) int {
+ value, ok := this.nodes[key]
+ if !ok {
+ return -1
+ }
+ currentNode := value.Value.(*node)
+ this.lists[currentNode.frequency].Remove(value)
+ currentNode.frequency++
+ if _, ok := this.lists[currentNode.frequency]; !ok {
+ this.lists[currentNode.frequency] = list.New()
+ }
+ newList := this.lists[currentNode.frequency]
+ newNode := newList.PushBack(currentNode)
+ this.nodes[key] = newNode
+ if currentNode.frequency-1 == this.min && this.lists[currentNode.frequency-1].Len() == 0 {
+ this.min++
+ }
+ return currentNode.value
+}
+
+func (this *LFUCache) Put(key int, value int) {
+ if this.capacity == 0 {
+ return
+ }
+ if currentValue, ok := this.nodes[key]; ok {
+ currentNode := currentValue.Value.(*node)
+ currentNode.value = value
+ this.Get(key)
+ return
+ }
+ if this.capacity == len(this.nodes) {
+ currentList := this.lists[this.min]
+ frontNode := currentList.Front()
+ delete(this.nodes, frontNode.Value.(*node).key)
+ currentList.Remove(frontNode)
+ }
+ this.min = 1
+ currentNode := &node{
+ key: key,
+ value: value,
+ frequency: 1,
+ }
+ if _, ok := this.lists[1]; !ok {
+ this.lists[1] = list.New()
+ }
+ newList := this.lists[1]
+ newNode := newList.PushBack(currentNode)
+ this.nodes[key] = newNode
+}
+```
\ No newline at end of file
diff --git a/leetcode/0462.Minimum-Moves-to-Equal-Array-Elements-II/462. Minimum Moves to Equal Array Elements II.go b/leetcode/0462.Minimum-Moves-to-Equal-Array-Elements-II/462. Minimum Moves to Equal Array Elements II.go
new file mode 100644
index 000000000..cd38e4787
--- /dev/null
+++ b/leetcode/0462.Minimum-Moves-to-Equal-Array-Elements-II/462. Minimum Moves to Equal Array Elements II.go
@@ -0,0 +1,21 @@
+package leetcode
+
+import (
+ "math"
+ "sort"
+)
+
+func minMoves2(nums []int) int {
+ if len(nums) == 0 {
+ return 0
+ }
+ moves, mid := 0, len(nums)/2
+ sort.Ints(nums)
+ for i := range nums {
+ if i == mid {
+ continue
+ }
+ moves += int(math.Abs(float64(nums[mid] - nums[i])))
+ }
+ return moves
+}
diff --git a/leetcode/0462.Minimum-Moves-to-Equal-Array-Elements-II/462. Minimum Moves to Equal Array Elements II_test.go b/leetcode/0462.Minimum-Moves-to-Equal-Array-Elements-II/462. Minimum Moves to Equal Array Elements II_test.go
new file mode 100644
index 000000000..bdbae051f
--- /dev/null
+++ b/leetcode/0462.Minimum-Moves-to-Equal-Array-Elements-II/462. Minimum Moves to Equal Array Elements II_test.go
@@ -0,0 +1,57 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question462 struct {
+ para462
+ ans462
+}
+
+// para 是参数
+// one 代表第一个参数
+type para462 struct {
+ nums []int
+}
+
+// ans 是答案
+// one 代表第一个答案
+type ans462 struct {
+ one int
+}
+
+func Test_Problem462(t *testing.T) {
+
+ qs := []question462{
+
+ {
+ para462{[]int{}},
+ ans462{0},
+ },
+
+ {
+ para462{[]int{1, 2, 3}},
+ ans462{2},
+ },
+
+ {
+ para462{[]int{1, 10, 2, 9}},
+ ans462{16},
+ },
+
+ {
+ para462{[]int{1, 0, 0, 8, 6}},
+ ans462{14},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 462------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans462, q.para462
+ fmt.Printf("【input】:%v 【output】:%v\n", p, minMoves2(p.nums))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/0462.Minimum-Moves-to-Equal-Array-Elements-II/README.md b/leetcode/0462.Minimum-Moves-to-Equal-Array-Elements-II/README.md
new file mode 100644
index 000000000..c030b1de0
--- /dev/null
+++ b/leetcode/0462.Minimum-Moves-to-Equal-Array-Elements-II/README.md
@@ -0,0 +1,66 @@
+# [462. Minimum Moves to Equal Array Elements II](https://leetcode.com/problems/minimum-moves-to-equal-array-elements-ii/)
+
+
+## 题目
+
+Given an integer array `nums` of size `n`, return *the minimum number of moves required to make all array elements equal*.
+
+In one move, you can increment or decrement an element of the array by `1`.
+
+**Example 1:**
+
+```
+Input: nums = [1,2,3]
+Output: 2
+Explanation:
+Only two moves are needed (remember each move increments or decrements one element):
+[1,2,3] => [2,2,3] => [2,2,2]
+```
+
+**Example 2:**
+
+```
+Input: nums = [1,10,2,9]
+Output: 16
+```
+
+**Constraints:**
+
+- `n == nums.length`
+- `1 <= nums.length <= 10^5`
+- `109 <= nums[i] <= 10^9`
+
+## 题目大意
+
+给定一个非空整数数组，找到使所有数组元素相等所需的最小移动数，其中每次移动可将选定的一个元素加 1 或减 1。 您可以假设数组的长度最多为10000。
+
+## 解题思路
+
+- 这题抽象成数学问题是，如果我们把数组 a 中的每个数看成水平轴上的一个点，那么根据上面的移动次数公式，我们需要找到在水平轴上找到一个点 x，使得这 N 个点到 x 的距离之和最小。有 2 个点值得我们考虑，一个是中位数，另外一个是平均值。举个简单的例子，[1,0,0,8,6] 这组数据，中位数是 1，平均值是 3 。分别计算移动的步数，按照中位数对齐是 14，按照平均值对齐是 16 。所以选择中位数。
+- 此题可以用数学证明，证明出，按照平均值移动的步数 ≥ 按照中位数移动的步数。具体证明笔者这里不证明了，感兴趣的同学可以自己证明试试。
+
+## 代码
+
+```go
+package leetcode
+
+import (
+ "math"
+ "sort"
+)
+
+func minMoves2(nums []int) int {
+ if len(nums) == 0 {
+ return 0
+ }
+ moves, mid := 0, len(nums)/2
+ sort.Ints(nums)
+ for i := range nums {
+ if i == mid {
+ continue
+ }
+ moves += int(math.Abs(float64(nums[mid] - nums[i])))
+ }
+ return moves
+}
+```
\ No newline at end of file
diff --git a/leetcode/0473.Matchsticks-to-Square/473. Matchsticks to Square.go b/leetcode/0473.Matchsticks-to-Square/473. Matchsticks to Square.go
new file mode 100644
index 000000000..8930f35a4
--- /dev/null
+++ b/leetcode/0473.Matchsticks-to-Square/473. Matchsticks to Square.go
@@ -0,0 +1,49 @@
+package leetcode
+
+import "sort"
+
+func makesquare(matchsticks []int) bool {
+ if len(matchsticks) < 4 {
+ return false
+ }
+ total := 0
+ for _, v := range matchsticks {
+ total += v
+ }
+ if total%4 != 0 {
+ return false
+ }
+ sort.Slice(matchsticks, func(i, j int) bool {
+ return matchsticks[i] > matchsticks[j]
+ })
+ visited := make([]bool, 16)
+ return dfs(matchsticks, 0, 0, 0, total, &visited)
+}
+
+func dfs(matchsticks []int, cur, group, sum, total int, visited *[]bool) bool {
+ if group == 4 {
+ return true
+ }
+ if sum > total/4 {
+ return false
+ }
+ if sum == total/4 {
+ return dfs(matchsticks, 0, group+1, 0, total, visited)
+ }
+ last := -1
+ for i := cur; i < len(matchsticks); i++ {
+ if (*visited)[i] {
+ continue
+ }
+ if last == matchsticks[i] {
+ continue
+ }
+ (*visited)[i] = true
+ last = matchsticks[i]
+ if dfs(matchsticks, i+1, group, sum+matchsticks[i], total, visited) {
+ return true
+ }
+ (*visited)[i] = false
+ }
+ return false
+}
diff --git a/leetcode/0473.Matchsticks-to-Square/473. Matchsticks to Square_test.go b/leetcode/0473.Matchsticks-to-Square/473. Matchsticks to Square_test.go
new file mode 100644
index 000000000..7636f00fb
--- /dev/null
+++ b/leetcode/0473.Matchsticks-to-Square/473. Matchsticks to Square_test.go
@@ -0,0 +1,47 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question473 struct {
+ para473
+ ans473
+}
+
+// para 是参数
+// one 代表第一个参数
+type para473 struct {
+ arr []int
+}
+
+// ans 是答案
+// one 代表第一个答案
+type ans473 struct {
+ one bool
+}
+
+func Test_Problem473(t *testing.T) {
+
+ qs := []question473{
+
+ {
+ para473{[]int{1, 1, 2, 2, 2}},
+ ans473{true},
+ },
+
+ {
+ para473{[]int{3, 3, 3, 3, 4}},
+ ans473{false},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 473------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans473, q.para473
+ fmt.Printf("【input】:%v 【output】:%v\n", p, makesquare(p.arr))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/0473.Matchsticks-to-Square/README.md b/leetcode/0473.Matchsticks-to-Square/README.md
new file mode 100644
index 000000000..d58d6b1c4
--- /dev/null
+++ b/leetcode/0473.Matchsticks-to-Square/README.md
@@ -0,0 +1,94 @@
+# [473. Matchsticks to Square](https://leetcode.com/problems/matchsticks-to-square/)
+
+
+## 题目
+
+You are given an integer array `matchsticks` where `matchsticks[i]` is the length of the `ith` matchstick. You want to use **all the matchsticks** to make one square. You **should not break** any stick, but you can link them up, and each matchstick must be used **exactly one time**.
+
+Return `true` if you can make this square and `false` otherwise.
+
+**Example 1:**
+
+
+
+```
+Input: matchsticks = [1,1,2,2,2]
+Output: true
+Explanation: You can form a square with length 2, one side of the square came two sticks with length 1.
+```
+
+**Example 2:**
+
+```
+Input: matchsticks = [3,3,3,3,4]
+Output: false
+Explanation: You cannot find a way to form a square with all the matchsticks.
+```
+
+**Constraints:**
+
+- `1 <= matchsticks.length <= 15`
+- `0 <= matchsticks[i] <= 109`
+
+## 题目大意
+
+现在已知小女孩有多少根火柴，请找出一种能使用所有火柴拼成一个正方形的方法。不能折断火柴，可以把火柴连接起来，并且每根火柴都要用到。输入为小女孩拥有火柴的数目，每根火柴用其长度表示。输出即为是否能用所有的火柴拼成正方形。
+
+## 解题思路
+
+- 将火柴拼成一个正方形，可以将它们分成四组，每一根火柴恰好属于其中的一组；并且每一组火柴的长度之和都相同，等于所有火柴长度之和的四分之一。
+- 考虑暴力解法，使用深度优先搜索枚举出所有的分组情况，并对于每一种情况，判断是否满足上述的两个条件(每根火柴属于其中一组，每组火柴长度之和相同)。依次对每一根火柴进行搜索，当搜索到第 i 根火柴时，可以考虑把它放到四组中的任意一种。对于每一种放置方法，继续对第 i + 1 根火柴进行深搜。当我们搜索完全部的 N 根火柴后，再判断每一组火柴的长度之和是否都相同。
+
+## 代码
+
+```go
+package leetcode
+
+import "sort"
+
+func makesquare(matchsticks []int) bool {
+ if len(matchsticks) < 4 {
+ return false
+ }
+ total := 0
+ for _, v := range matchsticks {
+ total += v
+ }
+ if total%4 != 0 {
+ return false
+ }
+ sort.Slice(matchsticks, func(i, j int) bool {
+ return matchsticks[i] > matchsticks[j]
+ })
+ visited := make([]bool, 16)
+ return dfs(matchsticks, 0, 0, 0, total, &visited)
+}
+
+func dfs(matchsticks []int, cur, group, sum, total int, visited *[]bool) bool {
+ if group == 4 {
+ return true
+ }
+ if sum > total/4 {
+ return false
+ }
+ if sum == total/4 {
+ return dfs(matchsticks, 0, group+1, 0, total, visited)
+ }
+ last := -1
+ for i := cur; i < len(matchsticks); i++ {
+ if (*visited)[i] {
+ continue
+ }
+ if last == matchsticks[i] {
+ continue
+ }
+ (*visited)[i] = true
+ last = matchsticks[i]
+ if dfs(matchsticks, i+1, group, sum+matchsticks[i], total, visited) {
+ return true
+ }
+ (*visited)[i] = false
+ }
+ return false
+}
+```
\ No newline at end of file
diff --git a/leetcode/0478.Generate-Random-Point-in-a-Circle/478. Generate Random Point in a Circle.go b/leetcode/0478.Generate-Random-Point-in-a-Circle/478. Generate Random Point in a Circle.go
new file mode 100644
index 000000000..d611124a3
--- /dev/null
+++ b/leetcode/0478.Generate-Random-Point-in-a-Circle/478. Generate Random Point in a Circle.go
@@ -0,0 +1,46 @@
+package leetcode
+
+import (
+ "math"
+ "math/rand"
+ "time"
+)
+
+type Solution struct {
+ r float64
+ x float64
+ y float64
+}
+
+func Constructor(radius float64, x_center float64, y_center float64) Solution {
+ rand.Seed(time.Now().UnixNano())
+ return Solution{radius, x_center, y_center}
+}
+
+func (this *Solution) RandPoint() []float64 {
+ /*
+ a := angle()
+ r := this.r * math.Sqrt(rand.Float64())
+ x := r * math.Cos(a) + this.x
+ y := r * math.Sin(a) + this.y
+ return []float64{x, y}*/
+ for {
+ rx := 2*rand.Float64() - 1.0
+ ry := 2*rand.Float64() - 1.0
+ x := this.r * rx
+ y := this.r * ry
+ if x*x+y*y <= this.r*this.r {
+ return []float64{x + this.x, y + this.y}
+ }
+ }
+}
+
+func angle() float64 {
+ return rand.Float64() * 2 * math.Pi
+}
+
+/**
+ * Your Solution object will be instantiated and called as such:
+ * obj := Constructor(radius, x_center, y_center);
+ * param_1 := obj.RandPoint();
+ */
diff --git a/leetcode/0478.Generate-Random-Point-in-a-Circle/478. Generate Random Point in a Circle_test.go b/leetcode/0478.Generate-Random-Point-in-a-Circle/478. Generate Random Point in a Circle_test.go
new file mode 100644
index 000000000..ddd2e62df
--- /dev/null
+++ b/leetcode/0478.Generate-Random-Point-in-a-Circle/478. Generate Random Point in a Circle_test.go
@@ -0,0 +1,18 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+func Test_Problem478(t *testing.T) {
+ obj := Constructor(1, 0, 0)
+ fmt.Printf("RandPoint() = %v\n", obj.RandPoint())
+ fmt.Printf("RandPoint() = %v\n", obj.RandPoint())
+ fmt.Printf("RandPoint() = %v\n", obj.RandPoint())
+
+ obj = Constructor(10, 5, -7.5)
+ fmt.Printf("RandPoint() = %v\n", obj.RandPoint())
+ fmt.Printf("RandPoint() = %v\n", obj.RandPoint())
+ fmt.Printf("RandPoint() = %v\n", obj.RandPoint())
+}
diff --git a/leetcode/0478.Generate-Random-Point-in-a-Circle/README.md b/leetcode/0478.Generate-Random-Point-in-a-Circle/README.md
new file mode 100644
index 000000000..bc325e62a
--- /dev/null
+++ b/leetcode/0478.Generate-Random-Point-in-a-Circle/README.md
@@ -0,0 +1,103 @@
+# [478. Generate Random Point in a Circle](https://leetcode.com/problems/generate-random-point-in-a-circle/)
+
+
+## 题目
+
+Given the radius and x-y positions of the center of a circle, write a function `randPoint` which generates a uniform random point in the circle.
+
+Note:
+
+1. input and output values are in [floating-point](https://www.webopedia.com/TERM/F/floating_point_number.html).
+2. radius and x-y position of the center of the circle is passed into the class constructor.
+3. a point on the circumference of the circle is considered to be in the circle.
+4. `randPoint` returns a size 2 array containing x-position and y-position of the random point, in that order.
+
+**Example 1:**
+
+```
+Input:
+["Solution","randPoint","randPoint","randPoint"]
+[[1,0,0],[],[],[]]
+Output: [null,[-0.72939,-0.65505],[-0.78502,-0.28626],[-0.83119,-0.19803]]
+
+```
+
+**Example 2:**
+
+```
+Input:
+["Solution","randPoint","randPoint","randPoint"]
+[[10,5,-7.5],[],[],[]]
+Output: [null,[11.52438,-8.33273],[2.46992,-16.21705],[11.13430,-12.42337]]
+```
+
+**Explanation of Input Syntax:**
+
+The input is two lists: the subroutines called and their arguments. `Solution`'s constructor has three arguments, the radius, x-position of the center, and y-position of the center of the circle. `randPoint` has no arguments. Arguments are always wrapped with a list, even if there aren't any.
+
+## 题目大意
+
+给定圆的半径和圆心的 x、y 坐标，写一个在圆中产生均匀随机点的函数 randPoint 。
+
+说明:
+
+- 输入值和输出值都将是浮点数。
+- 圆的半径和圆心的 x、y 坐标将作为参数传递给类的构造函数。
+- 圆周上的点也认为是在圆中。
+- randPoint 返回一个包含随机点的x坐标和y坐标的大小为2的数组。
+
+## 解题思路
+
+- 随机产生一个圆内的点，这个点一定满足定义 `(x-a)^2+(y-b)^2 ≤ R^2`，其中 `(a,b)` 是圆的圆心坐标，`R` 是半径。
+- 先假设圆心坐标在 (0,0)，这样方便计算，最终输出坐标的时候整体加上圆心的偏移量即可。`rand.Float64()` 产生一个 `[0.0,1.0)` 区间的浮点数。`-R ≤ 2 * R * rand() - R < R`，利用随机产生坐标点的横纵坐标 `(x,y)` 与半径 R 的关系，如果 `x^2 + y^2 ≤ R^2`，那么说明产生的点在圆内。最终输出的时候要记得加上圆心坐标的偏移值。
+
+## 代码
+
+```go
+package leetcode
+
+import (
+ "math"
+ "math/rand"
+ "time"
+)
+
+type Solution struct {
+ r float64
+ x float64
+ y float64
+}
+
+func Constructor(radius float64, x_center float64, y_center float64) Solution {
+ rand.Seed(time.Now().UnixNano())
+ return Solution{radius, x_center, y_center}
+}
+
+func (this *Solution) RandPoint() []float64 {
+ /*
+ a := angle()
+ r := this.r * math.Sqrt(rand.Float64())
+ x := r * math.Cos(a) + this.x
+ y := r * math.Sin(a) + this.y
+ return []float64{x, y}*/
+ for {
+ rx := 2*rand.Float64() - 1.0
+ ry := 2*rand.Float64() - 1.0
+ x := this.r * rx
+ y := this.r * ry
+ if x*x+y*y <= this.r*this.r {
+ return []float64{x + this.x, y + this.y}
+ }
+ }
+}
+
+func angle() float64 {
+ return rand.Float64() * 2 * math.Pi
+}
+
+/**
+ * Your Solution object will be instantiated and called as such:
+ * obj := Constructor(radius, x_center, y_center);
+ * param_1 := obj.RandPoint();
+ */
+```
\ No newline at end of file
diff --git a/leetcode/0483.Smallest-Good-Base/483. Smallest Good Base.go b/leetcode/0483.Smallest-Good-Base/483. Smallest Good Base.go
index 6c8f72d2a..7dc0430f3 100644
--- a/leetcode/0483.Smallest-Good-Base/483. Smallest Good Base.go
+++ b/leetcode/0483.Smallest-Good-Base/483. Smallest Good Base.go
@@ -2,34 +2,23 @@ package leetcode
import (
"math"
+ "math/bits"
"strconv"
)
func smallestGoodBase(n string) string {
- num, _ := strconv.ParseUint(n, 10, 64)
- for bit := uint64(math.Log2(float64(num))); bit >= 1; bit-- {
- low, high := uint64(2), uint64(math.Pow(float64(num), 1.0/float64(bit)))
- for low < high {
- mid := uint64(low + (high-low)>>1)
- sum := findBase(mid, bit)
- if sum == num {
- return strconv.FormatUint(mid, 10)
- } else if sum > num {
- high = mid - 1
- } else {
- low = mid + 1
- }
+ nVal, _ := strconv.Atoi(n)
+ mMax := bits.Len(uint(nVal)) - 1
+ for m := mMax; m > 1; m-- {
+ k := int(math.Pow(float64(nVal), 1/float64(m)))
+ mul, sum := 1, 1
+ for i := 0; i < m; i++ {
+ mul *= k
+ sum += mul
+ }
+ if sum == nVal {
+ return strconv.Itoa(k)
}
}
- return strconv.FormatUint(num-1, 10)
-}
-
-// 计算 k^m + k^(m-1) + ... + k + 1
-func findBase(mid, bit uint64) uint64 {
- sum, base := uint64(1), uint64(1)
- for i := uint64(1); i <= bit; i++ {
- base *= mid
- sum += base
- }
- return sum
+ return strconv.Itoa(nVal - 1)
}
diff --git a/leetcode/0488.Zuma-Game/488.Zuma Game.go b/leetcode/0488.Zuma-Game/488.Zuma Game.go
new file mode 100644
index 000000000..7fa5e2595
--- /dev/null
+++ b/leetcode/0488.Zuma-Game/488.Zuma Game.go
@@ -0,0 +1,50 @@
+package leetcode
+
+func findMinStep(board string, hand string) int {
+ q := [][]string{{board, hand}}
+ mp := make(map[string]bool)
+ minStep := 0
+ for len(q) > 0 {
+ length := len(q)
+ minStep++
+ for length > 0 {
+ length--
+ cur := q[0]
+ q = q[1:]
+ curB, curH := cur[0], cur[1]
+ for i := 0; i < len(curB); i++ {
+ for j := 0; j < len(curH); j++ {
+ curB2 := del3(curB[0:i] + string(curH[j]) + curB[i:])
+ curH2 := curH[0:j] + curH[j+1:]
+ if len(curB2) == 0 {
+ return minStep
+ }
+ if _, ok := mp[curB2+curH2]; ok {
+ continue
+ }
+ mp[curB2+curH2] = true
+ q = append(q, []string{curB2, curH2})
+ }
+ }
+ }
+ }
+ return -1
+}
+
+func del3(str string) string {
+ cnt := 1
+ for i := 1; i < len(str); i++ {
+ if str[i] == str[i-1] {
+ cnt++
+ } else {
+ if cnt >= 3 {
+ return del3(str[0:i-cnt] + str[i:])
+ }
+ cnt = 1
+ }
+ }
+ if cnt >= 3 {
+ return str[0 : len(str)-cnt]
+ }
+ return str
+}
diff --git a/leetcode/0488.Zuma-Game/488.Zuma Game_test.go b/leetcode/0488.Zuma-Game/488.Zuma Game_test.go
new file mode 100644
index 000000000..841c8168b
--- /dev/null
+++ b/leetcode/0488.Zuma-Game/488.Zuma Game_test.go
@@ -0,0 +1,56 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question488 struct {
+ para488
+ ans488
+}
+
+// para 是参数
+type para488 struct {
+ board string
+ hand string
+}
+
+// ans 是答案
+type ans488 struct {
+ ans int
+}
+
+func Test_Problem488(t *testing.T) {
+
+ qs := []question488{
+
+ {
+ para488{"WRRBBW", "RB"},
+ ans488{-1},
+ },
+
+ {
+ para488{"WWRRBBWW", "WRBRW"},
+ ans488{2},
+ },
+
+ {
+ para488{"G", "GGGGG"},
+ ans488{2},
+ },
+
+ {
+ para488{"RBYYBBRRB", "YRBGB"},
+ ans488{3},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 488------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans488, q.para488
+ fmt.Printf("【input】:%v 【output】:%v\n", p, findMinStep(p.board, p.hand))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/0488.Zuma-Game/README.md b/leetcode/0488.Zuma-Game/README.md
new file mode 100644
index 000000000..2e05d9d76
--- /dev/null
+++ b/leetcode/0488.Zuma-Game/README.md
@@ -0,0 +1,141 @@
+# [488. Zuma Game](https://leetcode.com/problems/zuma-game/)
+
+
+## 题目
+
+You are playing a variation of the game Zuma.
+
+In this variation of Zuma, there is a single row of colored balls on a board, where each ball can be colored red 'R', yellow 'Y', blue 'B', green 'G', or white 'W'. You also have several colored balls in your hand.
+
+Your goal is to clear all of the balls from the board. On each turn:
+
+Pick any ball from your hand and insert it in between two balls in the row or on either end of the row.
+If there is a group of three or more consecutive balls of the same color, remove the group of balls from the board.
+If this removal causes more groups of three or more of the same color to form, then continue removing each group until there are none left.
+If there are no more balls on the board, then you win the game.
+Repeat this process until you either win or do not have any more balls in your hand.
+Given a string board, representing the row of balls on the board, and a string hand, representing the balls in your hand, return the minimum number of balls you have to insert to clear all the balls from the board. If you cannot clear all the balls from the board using the balls in your hand, return -1.
+
+**Example 1**:
+
+```
+Input: board = "WRRBBW", hand = "RB"
+Output: -1
+Explanation: It is impossible to clear all the balls. The best you can do is:
+- Insert 'R' so the board becomes WRRRBBW. WRRRBBW -> WBBW.
+- Insert 'B' so the board becomes WBBBW. WBBBW -> WW.
+There are still balls remaining on the board, and you are out of balls to insert.
+```
+
+**Example 2**:
+```
+Input: board = "WWRRBBWW", hand = "WRBRW"
+Output: 2
+Explanation: To make the board empty:
+- Insert 'R' so the board becomes WWRRRBBWW. WWRRRBBWW -> WWBBWW.
+- Insert 'B' so the board becomes WWBBBWW. WWBBBWW -> WWWW -> empty.
+2 balls from your hand were needed to clear the board.
+```
+
+**Example 3**:
+```
+Input: board = "G", hand = "GGGGG"
+Output: 2
+Explanation: To make the board empty:
+- Insert 'G' so the board becomes GG.
+- Insert 'G' so the board becomes GGG. GGG -> empty.
+2 balls from your hand were needed to clear the board.
+```
+
+**Example 4**:
+```
+Input: board = "RBYYBBRRB", hand = "YRBGB"
+Output: 3
+Explanation: To make the board empty:
+- Insert 'Y' so the board becomes RBYYYBBRRB. RBYYYBBRRB -> RBBBRRB -> RRRB -> B.
+- Insert 'B' so the board becomes BB.
+- Insert 'B' so the board becomes BBB. BBB -> empty.
+3 balls from your hand were needed to clear the board.
+```
+
+**Constraints**:
+
+- 1 <= board.length <= 16
+- 1 <= hand.length <= 5
+- board and hand consist of the characters 'R', 'Y', 'B', 'G', and 'W'.
+- The initial row of balls on the board will not have any groups of three or more consecutive balls of the same color.
+
+## 题目大意
+
+你正在参与祖玛游戏的一个变种。
+
+在这个祖玛游戏变体中，桌面上有 一排 彩球，每个球的颜色可能是：红色 'R'、黄色 'Y'、蓝色 'B'、绿色 'G' 或白色 'W' 。你的手中也有一些彩球。
+
+你的目标是 清空 桌面上所有的球。每一回合：
+
+从你手上的彩球中选出 任意一颗 ，然后将其插入桌面上那一排球中：两球之间或这一排球的任一端。
+接着，如果有出现 三个或者三个以上 且 颜色相同 的球相连的话，就把它们移除掉。
+如果这种移除操作同样导致出现三个或者三个以上且颜色相同的球相连，则可以继续移除这些球，直到不再满足移除条件。
+如果桌面上所有球都被移除，则认为你赢得本场游戏。
+重复这个过程，直到你赢了游戏或者手中没有更多的球。
+给你一个字符串 board ，表示桌面上最开始的那排球。另给你一个字符串 hand ，表示手里的彩球。请你按上述操作步骤移除掉桌上所有球，计算并返回所需的 最少 球数。如果不能移除桌上所有的球，返回 -1 。
+
+## 解题思路
+
+- 使用广度优先搜索和剪枝
+
+## 代码
+
+```go
+
+package leetcode
+
+func findMinStep(board string, hand string) int {
+ q := [][]string{{board, hand}}
+ mp := make(map[string]bool)
+ minStep := 0
+ for len(q) > 0 {
+ length := len(q)
+ minStep++
+ for length > 0 {
+ length--
+ cur := q[0]
+ q = q[1:]
+ curB, curH := cur[0], cur[1]
+ for i := 0; i < len(curB); i++ {
+ for j := 0; j < len(curH); j++ {
+ curB2 := del3(curB[0:i] + string(curH[j]) + curB[i:])
+ curH2 := curH[0:j] + curH[j+1:]
+ if len(curB2) == 0 {
+ return minStep
+ }
+ if _, ok := mp[curB2+curH2]; ok {
+ continue
+ }
+ mp[curB2+curH2] = true
+ q = append(q, []string{curB2, curH2})
+ }
+ }
+ }
+ }
+ return -1
+}
+
+func del3(str string) string {
+ cnt := 1
+ for i := 1; i < len(str); i++ {
+ if str[i] == str[i-1] {
+ cnt++
+ } else {
+ if cnt >= 3 {
+ return del3(str[0:i-cnt] + str[i:])
+ }
+ cnt = 1
+ }
+ }
+ if cnt >= 3 {
+ return str[0 : len(str)-cnt]
+ }
+ return str
+}
+```
\ No newline at end of file
diff --git a/leetcode/0491.Increasing-Subsequences/README.md b/leetcode/0491.Increasing-Subsequences/README.md
deleted file mode 100755
index 79063dbc5..000000000
--- a/leetcode/0491.Increasing-Subsequences/README.md
+++ /dev/null
@@ -1,40 +0,0 @@
-# [491. Increasing Subsequences](https://leetcode.com/problems/increasing-subsequences/)
-
-
-## 题目
-
-Given an integer array, your task is to find all the different possible increasing subsequences of the given array, and the length of an increasing subsequence should be at least 2.
-
-**Example:**
-
- Input: [4, 6, 7, 7]
- Output: [[4, 6], [4, 7], [4, 6, 7], [4, 6, 7, 7], [6, 7], [6, 7, 7], [7,7], [4,7,7]]
-
-**Note:**
-
-1. The length of the given array will not exceed 15.
-2. The range of integer in the given array is [-100,100].
-3. The given array may contain duplicates, and two equal integers should also be considered as a special case of increasing sequence.
-
-
-
-## 题目大意
-
-
-给定一个整型数组, 你的任务是找到所有该数组的递增子序列，递增子序列的长度至少是 2。
-
-说明:
-
-1. 给定数组的长度不会超过15。
-2. 数组中的整数范围是 [-100,100]。
-3. 给定数组中可能包含重复数字，相等的数字应该被视为递增的一种情况。
-
-
-
-
-## 解题思路
-
-
-- 给出一个数组，要求找出这个数组中所有长度大于 2 的非递减子序列。子序列顺序和原数组元素下标必须是顺序的，不能是逆序的。
-- 这一题和第 78 题和第 90 题是类似的题目。第 78 题和第 90 题是求所有子序列，这一题在这两题的基础上增加了非递减和长度大于 2 的条件。需要注意的两点是，原数组中元素可能会重复，最终结果输出的时候需要去重。最终结果输出的去重用 map 处理，数组中重复元素用 DFS 遍历搜索。在每次 DFS 中，用 map 记录遍历过的元素，保证本轮 DFS 中不出现重复的元素，递归到下一层还可以选择值相同，但是下标不同的另外一个元素。外层循环也要加一个 map，这个 map 是过滤每组解因为重复元素导致的重复解，经过过滤以后，起点不同了，最终的解也会不同。
-- 这一题和第 78 题，第 90 题类似，可以一起解答和复习。
diff --git a/leetcode/0491.Increasing-Subsequences/491. Increasing Subsequences.go b/leetcode/0491.Non-decreasing-Subsequences/491. Non-decreasing Subsequences.go
similarity index 100%
rename from leetcode/0491.Increasing-Subsequences/491. Increasing Subsequences.go
rename to leetcode/0491.Non-decreasing-Subsequences/491. Non-decreasing Subsequences.go
diff --git a/leetcode/0491.Increasing-Subsequences/491. Increasing Subsequences_test.go b/leetcode/0491.Non-decreasing-Subsequences/491. Non-decreasing Subsequences_test.go
similarity index 100%
rename from leetcode/0491.Increasing-Subsequences/491. Increasing Subsequences_test.go
rename to leetcode/0491.Non-decreasing-Subsequences/491. Non-decreasing Subsequences_test.go
diff --git a/leetcode/0491.Non-decreasing-Subsequences/README.md b/leetcode/0491.Non-decreasing-Subsequences/README.md
new file mode 100755
index 000000000..f5c5e34a6
--- /dev/null
+++ b/leetcode/0491.Non-decreasing-Subsequences/README.md
@@ -0,0 +1,40 @@
+# [491. Non-decreasing Subsequences](https://leetcode.com/problems/non-decreasing-subsequences/)
+
+
+## 题目
+
+Given an integer array, your task is to find all the different possible increasing subsequences of the given array, and the length of an increasing subsequence should be at least 2.
+
+**Example:**
+
+ Input: [4, 6, 7, 7]
+ Output: [[4, 6], [4, 7], [4, 6, 7], [4, 6, 7, 7], [6, 7], [6, 7, 7], [7,7], [4,7,7]]
+
+**Note:**
+
+1. The length of the given array will not exceed 15.
+2. The range of integer in the given array is [-100,100].
+3. The given array may contain duplicates, and two equal integers should also be considered as a special case of increasing sequence.
+
+
+
+## 题目大意
+
+
+给定一个整型数组, 你的任务是找到所有该数组的递增子序列，递增子序列的长度至少是 2。
+
+说明:
+
+1. 给定数组的长度不会超过15。
+2. 数组中的整数范围是 [-100,100]。
+3. 给定数组中可能包含重复数字，相等的数字应该被视为递增的一种情况。
+
+
+
+
+## 解题思路
+
+
+- 给出一个数组，要求找出这个数组中所有长度大于 2 的非递减子序列。子序列顺序和原数组元素下标必须是顺序的，不能是逆序的。
+- 这一题和第 78 题和第 90 题是类似的题目。第 78 题和第 90 题是求所有子序列，这一题在这两题的基础上增加了非递减和长度大于 2 的条件。需要注意的两点是，原数组中元素可能会重复，最终结果输出的时候需要去重。最终结果输出的去重用 map 处理，数组中重复元素用 DFS 遍历搜索。在每次 DFS 中，用 map 记录遍历过的元素，保证本轮 DFS 中不出现重复的元素，递归到下一层还可以选择值相同，但是下标不同的另外一个元素。外层循环也要加一个 map，这个 map 是过滤每组解因为重复元素导致的重复解，经过过滤以后，起点不同了，最终的解也会不同。
+- 这一题和第 78 题，第 90 题类似，可以一起解答和复习。
diff --git a/leetcode/0492.Construct-the-Rectangle/492.Construct the Rectangle.go b/leetcode/0492.Construct-the-Rectangle/492.Construct the Rectangle.go
new file mode 100644
index 000000000..3314fbc13
--- /dev/null
+++ b/leetcode/0492.Construct-the-Rectangle/492.Construct the Rectangle.go
@@ -0,0 +1,16 @@
+package leetcode
+
+import "math"
+
+func constructRectangle(area int) []int {
+ ans := make([]int, 2)
+ W := int(math.Sqrt(float64(area)))
+ for W >= 1 {
+ if area%W == 0 {
+ ans[0], ans[1] = area/W, W
+ break
+ }
+ W -= 1
+ }
+ return ans
+}
diff --git a/leetcode/0492.Construct-the-Rectangle/492.Construct the Rectangle_test.go b/leetcode/0492.Construct-the-Rectangle/492.Construct the Rectangle_test.go
new file mode 100644
index 000000000..b3ed98390
--- /dev/null
+++ b/leetcode/0492.Construct-the-Rectangle/492.Construct the Rectangle_test.go
@@ -0,0 +1,50 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question492 struct {
+ para492
+ ans492
+}
+
+// area 是参数
+type para492 struct {
+ area int
+}
+
+// ans 是答案
+type ans492 struct {
+ ans []int
+}
+
+func Test_Problem492(t *testing.T) {
+
+ qs := []question492{
+
+ {
+ para492{4},
+ ans492{[]int{2, 2}},
+ },
+
+ {
+ para492{37},
+ ans492{[]int{37, 1}},
+ },
+
+ {
+ para492{122122},
+ ans492{[]int{427, 286}},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 492------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans492, q.para492
+ fmt.Printf("【input】:%v 【output】:%v\n", p, constructRectangle(p.area))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/0492.Construct-the-Rectangle/README.md b/leetcode/0492.Construct-the-Rectangle/README.md
new file mode 100644
index 000000000..8024d6e16
--- /dev/null
+++ b/leetcode/0492.Construct-the-Rectangle/README.md
@@ -0,0 +1,72 @@
+# [492. Construct the Rectangle](https://leetcode.com/problems/construct-the-rectangle/)
+
+
+## 题目
+
+A web developer needs to know how to design a web page's size.
+So, given a specific rectangular web page’s area, your job by now is to design a rectangular web page,
+whose length L and width W satisfy the following requirements:
+
+ The area of the rectangular web page you designed must equal to the given target area.
+ The width W should not be larger than the length L, which means L >= W.
+ The difference between length L and width W should be as small as possible.
+ Return an array [L, W] where L and W are the length and width of the web page you designed in sequence.
+
+**Example 1:**
+
+ Input: area = 4
+ Output: [2,2]
+ Explanation: The target area is 4, and all the possible ways to construct it are [1,4], [2,2], [4,1].
+ But according to requirement 2, [1,4] is illegal; according to requirement 3, [4,1] is not optimal compared to [2,2]. So the length L is 2, and the width W is 2.
+
+**Example 2:**
+
+ Input: area = 37
+ Output: [37,1]
+
+**Example 3:**
+
+ Input: area = 122122
+ Output: [427,286]
+
+**Constraints**
+
+ - 1 <= area <= 10000000
+
+## 题目大意
+
+作为一位 web 开发者， 懂得怎样去规划一个页面的尺寸是很重要的。 现给定一个具体的矩形页面面积，你的任务是设计一个长度为 L 和宽度为 W 且满足以下要求的矩形的页面。要求：
+
+1. 你设计的矩形页面必须等于给定的目标面积。
+2. 宽度 W 不应大于长度 L，换言之，要求 L >= W 。
+3. 长度 L 和宽度 W 之间的差距应当尽可能小。
+
+你需要按顺序输出你设计的页面的长度 L 和宽度 W。
+
+## 解题思路
+
+- 令 W 等于根号 area
+- 在 W 大于等于 1 的情况下,判断 area%W 是否等于 0,如果不相等 W 就减 1 继续循环,如果相等就返回 [area/W, W]
+
+## 代码
+
+```go
+
+package leetcode
+
+import "math"
+
+func constructRectangle(area int) []int {
+ ans := make([]int, 2)
+ W := int(math.Sqrt(float64(area)))
+ for W >= 1 {
+ if area%W == 0 {
+ ans[0], ans[1] = area/W, W
+ break
+ }
+ W -= 1
+ }
+ return ans
+}
+
+``
\ No newline at end of file
diff --git a/leetcode/0493.Reverse-Pairs/493. Reverse Pairs.go b/leetcode/0493.Reverse-Pairs/493. Reverse Pairs.go
index b21a85a53..ec312a33f 100644
--- a/leetcode/0493.Reverse-Pairs/493. Reverse Pairs.go
+++ b/leetcode/0493.Reverse-Pairs/493. Reverse Pairs.go
@@ -6,8 +6,69 @@ import (
"github.com/halfrost/LeetCode-Go/template"
)
-// 解法一 线段树，时间复杂度 O(n log n)
+// 解法一 归并排序 mergesort，时间复杂度 O(n log n)
func reversePairs(nums []int) int {
+ buf := make([]int, len(nums))
+ return mergesortCount(nums, buf)
+}
+
+func mergesortCount(nums, buf []int) int {
+ if len(nums) <= 1 {
+ return 0
+ }
+ mid := (len(nums) - 1) / 2
+ cnt := mergesortCount(nums[:mid+1], buf)
+ cnt += mergesortCount(nums[mid+1:], buf)
+ for i, j := 0, mid+1; i < mid+1; i++ { // Note!!! j is increasing.
+ for ; j < len(nums) && nums[i] <= 2*nums[j]; j++ {
+ }
+ cnt += len(nums) - j
+ }
+ copy(buf, nums)
+ for i, j, k := 0, mid+1, 0; k < len(nums); {
+ if j >= len(nums) || i < mid+1 && buf[i] > buf[j] {
+ nums[k] = buf[i]
+ i++
+ } else {
+ nums[k] = buf[j]
+ j++
+ }
+ k++
+ }
+ return cnt
+}
+
+// 解法二 树状数组，时间复杂度 O(n log n)
+func reversePairs1(nums []int) (cnt int) {
+ n := len(nums)
+ if n <= 1 {
+ return
+ }
+ // 离散化所有下面统计时会出现的元素
+ allNums := make([]int, 0, 2*n)
+ for _, v := range nums {
+ allNums = append(allNums, v, 2*v)
+ }
+ sort.Ints(allNums)
+ k := 1
+ kth := map[int]int{allNums[0]: k}
+ for i := 1; i < 2*n; i++ {
+ if allNums[i] != allNums[i-1] {
+ k++
+ kth[allNums[i]] = k
+ }
+ }
+ bit := template.BinaryIndexedTree{}
+ bit.Init(k)
+ for i, v := range nums {
+ cnt += i - bit.Query(kth[2*v])
+ bit.Add(kth[v], 1)
+ }
+ return
+}
+
+// 解法三 线段树，时间复杂度 O(n log n)
+func reversePairs2(nums []int) int {
if len(nums) < 2 {
return 0
}
@@ -42,35 +103,3 @@ func reversePairs(nums []int) int {
}
return res
}
-
-// 解法二 mergesort
-func reversePairs1(nums []int) int {
- buf := make([]int, len(nums))
- return mergesortCount(nums, buf)
-}
-
-func mergesortCount(nums, buf []int) int {
- if len(nums) <= 1 {
- return 0
- }
- mid := (len(nums) - 1) / 2
- cnt := mergesortCount(nums[:mid+1], buf)
- cnt += mergesortCount(nums[mid+1:], buf)
- for i, j := 0, mid+1; i < mid+1; i++ { // Note!!! j is increasing.
- for ; j < len(nums) && nums[i] <= 2*nums[j]; j++ {
- }
- cnt += len(nums) - j
- }
- copy(buf, nums)
- for i, j, k := 0, mid+1, 0; k < len(nums); {
- if j >= len(nums) || i < mid+1 && buf[i] > buf[j] {
- nums[k] = buf[i]
- i++
- } else {
- nums[k] = buf[j]
- j++
- }
- k++
- }
- return cnt
-}
diff --git a/leetcode/0493.Reverse-Pairs/493. Reverse Pairs_test.go b/leetcode/0493.Reverse-Pairs/493. Reverse Pairs_test.go
index 49ff2de26..2c9097080 100644
--- a/leetcode/0493.Reverse-Pairs/493. Reverse Pairs_test.go
+++ b/leetcode/0493.Reverse-Pairs/493. Reverse Pairs_test.go
@@ -31,6 +31,11 @@ func Test_Problem493(t *testing.T) {
ans493{2},
},
+ {
+ para493{[]int{9, 8, 7, 4, 7, 2, 3, 8, 7, 0}},
+ ans493{18},
+ },
+
{
para493{[]int{2, 4, 3, 5, 1}},
ans493{3},
diff --git a/leetcode/0493.Reverse-Pairs/README.md b/leetcode/0493.Reverse-Pairs/README.md
index 2094a3618..c27689198 100755
--- a/leetcode/0493.Reverse-Pairs/README.md
+++ b/leetcode/0493.Reverse-Pairs/README.md
@@ -38,5 +38,6 @@ You need to return the number of important reverse pairs in the given array.
- 给出一个数组，要求找出满足条件的所有的“重要的反转对” (i,j)。重要的反转对的定义是：`i<j`，并且 `nums[i] > 2*nums[j]`。
- 这一题是 327 题的变种题。首先将数组中所有的元素以及各自的 `2*nums[i] + 1` 都放在字典中去重。去重以后再做离散化处理。这一题的测试用例会卡离散化，如果不离散化，Math.MaxInt32 会导致数字溢出，见测试用例中 2147483647, -2147483647 这组测试用例。离散后，映射关系 保存在字典中。从左往右遍历数组，先 query ，再 update ，这个顺序和第 327 题是反的。先 query 查找 `[2*nums[i] + 1, len(indexMap)-1]` 这个区间内满足条件的值，这个区间内的值都是 `> 2*nums[j]` 的。这一题移动的是 `j`，`j` 不断的变化，往线段树中不断插入的是 `i`。每轮循环先 query 一次前一轮循环中累积插入线段树中的 `i`，这些累积在线段树中的代表的是所有在 `j` 前面的 `i`。query 查询的是本轮 `[2*nums[j] + 1, len(indexMap)-1]`，如果能找到，即找到了这样一个 `j`，能满足 `nums[i] > 2*nums[j`， 把整个数组都扫完，累加的 query 出来的 count 计数就是最终答案。
+- 另外一种解法是树状数组。树状数组最擅长解答逆序对的问题。先将原数组中所有的元素值的 2 倍算出来，和原数组合并到一个大数组中。这个大数组中装了所有可能产生 2 倍逆序对的元素值。然后再将他们所有值排序，离散化。离散化以后便将问题集转化成 `[1,N]` 这个区间。于是回到了树状数组经典的求逆序对的问题。逆序插入原数组构造树状数组，或者正序插入原数组构造树状数组都可以解答此题。
- 类似的题目：第 327 题，第 315 题。
-- 这一题用线段树并不是最优解，用线段树解这一题是为了训练线段树这个数据结构。最优解是解法二中的 mergesort。
+- 这一题用线段树和树状数组并不是最优解，用线段树和树状数组解这一题是为了训练线段树和树状数组这两个数据结构。最优解是解法一中的 mergesort。
diff --git a/leetcode/0494.Target-Sum/494. Target Sum.go b/leetcode/0494.Target-Sum/494. Target Sum.go
index b9fac40c8..8adde19c7 100644
--- a/leetcode/0494.Target-Sum/494. Target Sum.go
+++ b/leetcode/0494.Target-Sum/494. Target Sum.go
@@ -6,7 +6,7 @@ func findTargetSumWays(nums []int, S int) int {
for _, n := range nums {
total += n
}
- if S > total || (S+total)%2 == 1 {
+ if S+total < 0 || S > total || (S+total)%2 == 1 {
return 0
}
target := (S + total) / 2
diff --git a/leetcode/0494.Target-Sum/README.md b/leetcode/0494.Target-Sum/README.md
index dd3c2b103..94234e7b9 100644
--- a/leetcode/0494.Target-Sum/README.md
+++ b/leetcode/0494.Target-Sum/README.md
@@ -42,7 +42,7 @@ There are 5 ways to assign symbols to make the sum of nums be target 3.
## 解题思路
- 给出一个数组，要求在这个数组里面的每个元素前面加上 + 或者 - 号，最终总和等于 S。问有多少种不同的方法。
-- 这一题可以用 DP 和 DFS 解答。DFS 方法就不比较暴力简单了。见代码。这里分析一下 DP 的做法。题目要求在数组元素前加上 + 或者 - 号，其实相当于把数组分成了 2 组，一组全部都加 + 号，一组都加 - 号。记 + 号的一组 P ，记 - 号的一组 N，那么可以推出以下的关系。
+- 这一题可以用 DP 和 DFS 解答。DFS 方法就比较暴力简单了。见代码。这里分析一下 DP 的做法。题目要求在数组元素前加上 + 或者 - 号，其实相当于把数组分成了 2 组，一组全部都加 + 号，一组都加 - 号。记 + 号的一组 P ，记 - 号的一组 N，那么可以推出以下的关系。
```go
sum(P) - sum(N) = target
@@ -52,7 +52,7 @@ There are 5 ways to assign symbols to make the sum of nums be target 3.
等号两边都加上 `sum(N) + sum(P)`，于是可以得到结果 `2 * sum(P) = target + sum(nums)`，那么这道题就转换成了，能否在数组中找到这样一个集合，和等于 `(target + sum(nums)) / 2`。那么这题就转化为了第 416 题了。`dp[i]` 中存储的是能使和为 `i` 的方法个数。
-- 如果和不是偶数，即不能被 2 整除，那说明找不到满足题目要求的解了，直接输出 0 。
+- 如果和不是偶数，即不能被 2 整除，或者和是负数，那说明找不到满足题目要求的解了，直接输出 0 。
## 代码
@@ -63,7 +63,7 @@ func findTargetSumWays(nums []int, S int) int {
for _, n := range nums {
total += n
}
- if S > total || (S+total)%2 == 1 {
+ if S > total || (S+total)%2 == 1 || S+total < 0 {
return 0
}
target := (S + total) / 2
diff --git a/leetcode/0495.Teemo-Attacking/495.Teemo Attacking.go b/leetcode/0495.Teemo-Attacking/495.Teemo Attacking.go
new file mode 100644
index 000000000..4da646d98
--- /dev/null
+++ b/leetcode/0495.Teemo-Attacking/495.Teemo Attacking.go
@@ -0,0 +1,16 @@
+package leetcode
+
+func findPoisonedDuration(timeSeries []int, duration int) int {
+ var ans int
+ for i := 1; i < len(timeSeries); i++ {
+ t := timeSeries[i-1]
+ end := t + duration - 1
+ if end < timeSeries[i] {
+ ans += duration
+ } else {
+ ans += timeSeries[i] - t
+ }
+ }
+ ans += duration
+ return ans
+}
diff --git a/leetcode/0495.Teemo-Attacking/495.Teemo Attacking_test.go b/leetcode/0495.Teemo-Attacking/495.Teemo Attacking_test.go
new file mode 100644
index 000000000..2900a11f8
--- /dev/null
+++ b/leetcode/0495.Teemo-Attacking/495.Teemo Attacking_test.go
@@ -0,0 +1,46 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question495 struct {
+ para495
+ ans495
+}
+
+// para 是参数
+type para495 struct {
+ timeSeries []int
+ duration int
+}
+
+// ans 是答案
+type ans495 struct {
+ ans int
+}
+
+func Test_Problem495(t *testing.T) {
+
+ qs := []question495{
+
+ {
+ para495{[]int{1, 4}, 2},
+ ans495{4},
+ },
+
+ {
+ para495{[]int{1, 2}, 2},
+ ans495{3},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 495------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans495, q.para495
+ fmt.Printf("【input】:%v 【output】:%v\n", p, findPoisonedDuration(p.timeSeries, p.duration))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/0495.Teemo-Attacking/README.md b/leetcode/0495.Teemo-Attacking/README.md
new file mode 100644
index 000000000..3a52e1f27
--- /dev/null
+++ b/leetcode/0495.Teemo-Attacking/README.md
@@ -0,0 +1,85 @@
+# [495. Teemo Attacking](https://leetcode.com/problems/teemo-attacking/)
+
+
+## 题目
+
+Our hero Teemo is attacking an enemy Ashe with poison attacks! When Teemo attacks Ashe, Ashe gets poisoned for a exactly duration seconds.
+
+More formally, an attack at second t will mean Ashe is poisoned during the inclusive time interval [t, t + duration - 1].
+
+If Teemo attacks again before the poison effect ends, the timer for it is reset, and the poison effect will end duration seconds after the new attack.
+
+You are given a non-decreasing integer array timeSeries, where timeSeries[i] denotes that Teemo attacks Ashe at second timeSeries[i], and an integer duration.
+
+Return the total number of seconds that Ashe is poisoned.
+
+**Example 1**:
+```
+Input: timeSeries = [1,4], duration = 2
+Output: 4
+Explanation: Teemo's attacks on Ashe go as follows:
+- At second 1, Teemo attacks, and Ashe is poisoned for seconds 1 and 2.
+- At second 4, Teemo attacks, and Ashe is poisoned for seconds 4 and 5.
+Ashe is poisoned for seconds 1, 2, 4, and 5, which is 4 seconds in total.
+```
+
+**Example 2**:
+```
+Input: timeSeries = [1,2], duration = 2
+Output: 3
+Explanation: Teemo's attacks on Ashe go as follows:
+- At second 1, Teemo attacks, and Ashe is poisoned for seconds 1 and 2.
+- At second 2 however, Teemo attacks again and resets the poison timer. Ashe is poisoned for seconds 2 and 3.
+Ashe is poisoned for seconds 1, 2, and 3, which is 3 seconds in total.
+```
+
+**Constraints**:
+
+- 1 <= timeSeries.length <= 10000
+- 0 <= timeSeries[i], duration <= 10000000
+- timeSeries is sorted in non-decreasing order.
+
+## 题目大意
+
+在《英雄联盟》的世界中，有一个叫 “提莫” 的英雄。他的攻击可以让敌方英雄艾希（编者注：寒冰射手）进入中毒状态。
+
+当提莫攻击艾希，艾希的中毒状态正好持续duration 秒。
+
+正式地讲，提莫在t发起发起攻击意味着艾希在时间区间 [t, t + duration - 1]（含 t 和 t + duration - 1）处于中毒状态。
+
+如果提莫在中毒影响结束前再次攻击，中毒状态计时器将会重置，在新的攻击之后，中毒影响将会在duration秒后结束。
+
+给你一个非递减的整数数组timeSeries，其中timeSeries[i]表示提莫在timeSeries[i]秒时对艾希发起攻击，以及一个表示中毒持续时间的整数duration 。
+
+返回艾希处于中毒状态的总秒数。
+
+## 解题思路
+
+- i 从 1 开始计数，令 t 等于 timeSeries[i - 1]
+- 比较 end(t + duration - 1) 和 timeSeries[i] 的大小，
+ - 如果 end 小于 timeSeries[i],ans+=duration
+ - 否则 ans += timeSeries[i] - t
+- ans += duration 并返回 ans
+
+## 代码
+
+```go
+
+package leetcode
+
+func findPoisonedDuration(timeSeries []int, duration int) int {
+ var ans int
+ for i := 1; i < len(timeSeries); i++ {
+ t := timeSeries[i-1]
+ end := t + duration - 1
+ if end < timeSeries[i] {
+ ans += duration
+ } else {
+ ans += timeSeries[i] - t
+ }
+ }
+ ans += duration
+ return ans
+}
+
+```
diff --git a/leetcode/0498.Diagonal-Traverse/README.md b/leetcode/0498.Diagonal-Traverse/README.md
index e4d28abd1..6e5969c78 100755
--- a/leetcode/0498.Diagonal-Traverse/README.md
+++ b/leetcode/0498.Diagonal-Traverse/README.md
@@ -37,3 +37,10 @@ The total number of elements of the given matrix will not exceed 10,000.
- 给出一个二维数组，要求按照如图的方式遍历整个数组。
- 这一题用模拟的方式就可以解出来。需要注意的是边界条件：比如二维数组为空，二维数组退化为一行或者一列，退化为一个元素。具体例子见测试用例。
+- 解题关键是在判断下一个位置，将矩阵想像成一个X,Y坐标轴。那么可分为以下几种情况，
+ 1、斜角向右上遍历时，
+ 当右上角在坐标轴内， 正常计算 即， x+1(X轴向右移动)， y-1(Y轴向上移动)
+ 当右上角在坐标轴外，那么当前位置只能在 第一行X坐标轴 ，或者 最后一列Y坐标轴 ， 即判断该两种情况下�应该X坐标往右，或者 Y坐标往上
+ 2、同理 斜角向下遍历时
+ 当左下角在坐标轴内，正常计算 即， x-1(X轴向右移动)， y+1(Y轴向下移动)
+ 当左下角在坐标轴外，那么当前位置只能在 第一列Y坐标轴，或者 最后一行X坐标轴， 即判断该两种情况下�应该X坐标往左，或者 Y坐标往下
diff --git a/leetcode/0504.Base-7/504.Base 7.go b/leetcode/0504.Base-7/504.Base 7.go
new file mode 100644
index 000000000..5a143b2be
--- /dev/null
+++ b/leetcode/0504.Base-7/504.Base 7.go
@@ -0,0 +1,28 @@
+package leetcode
+
+import "strconv"
+
+func convertToBase7(num int) string {
+ if num == 0 {
+ return "0"
+ }
+ negative := false
+ if num < 0 {
+ negative = true
+ num = -num
+ }
+ var ans string
+ var nums []int
+ for num != 0 {
+ remainder := num % 7
+ nums = append(nums, remainder)
+ num = num / 7
+ }
+ if negative {
+ ans += "-"
+ }
+ for i := len(nums) - 1; i >= 0; i-- {
+ ans += strconv.Itoa(nums[i])
+ }
+ return ans
+}
diff --git a/leetcode/0504.Base-7/504.Base 7_test.go b/leetcode/0504.Base-7/504.Base 7_test.go
new file mode 100644
index 000000000..1309c1b63
--- /dev/null
+++ b/leetcode/0504.Base-7/504.Base 7_test.go
@@ -0,0 +1,46 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question504 struct {
+ para504
+ ans504
+}
+
+// para 是参数
+type para504 struct {
+ num int
+}
+
+// ans 是答案
+type ans504 struct {
+ ans string
+}
+
+func Test_Problem504(t *testing.T) {
+
+ qs := []question504{
+
+ {
+ para504{100},
+ ans504{"202"},
+ },
+
+ {
+ para504{-7},
+ ans504{"-10"},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 504------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans504, q.para504
+ fmt.Printf("【input】:%v ", p.num)
+ fmt.Printf("【output】:%v \n", convertToBase7(p.num))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/0504.Base-7/README.md b/leetcode/0504.Base-7/README.md
new file mode 100644
index 000000000..359b96a0c
--- /dev/null
+++ b/leetcode/0504.Base-7/README.md
@@ -0,0 +1,60 @@
+# [504. Base 7](https://leetcode.com/problems/base-7/)
+
+## 题目
+
+Given an integer num, return a string of its base 7 representation.
+
+**Example 1:**
+
+ Input: num = 100
+ Output: "202"
+
+**Example 2:**
+
+ Input: num = -7
+ Output: "-10"
+
+**Constraints:**
+
+- -10000000 <= num <= 10000000
+
+## 题目大意
+
+给定一个整数 num，将其转化为 7 进制，并以字符串形式输出。
+
+## 解题思路
+
+ num反复除以7，然后倒排余数
+
+# 代码
+
+```go
+package leetcode
+
+import "strconv"
+
+func convertToBase7(num int) string {
+ if num == 0 {
+ return "0"
+ }
+ negative := false
+ if num < 0 {
+ negative = true
+ num = -num
+ }
+ var ans string
+ var nums []int
+ for num != 0 {
+ remainder := num % 7
+ nums = append(nums, remainder)
+ num = num / 7
+ }
+ if negative {
+ ans += "-"
+ }
+ for i := len(nums) - 1; i >= 0; i-- {
+ ans += strconv.Itoa(nums[i])
+ }
+ return ans
+}
+```
\ No newline at end of file
diff --git a/leetcode/0506.Relative-Ranks/506.Relative Ranks.go b/leetcode/0506.Relative-Ranks/506.Relative Ranks.go
new file mode 100644
index 000000000..501b933b2
--- /dev/null
+++ b/leetcode/0506.Relative-Ranks/506.Relative Ranks.go
@@ -0,0 +1,29 @@
+package leetcode
+
+import (
+ "sort"
+ "strconv"
+)
+
+func findRelativeRanks(score []int) []string {
+ mp := make(map[int]int)
+ for i, v := range score {
+ mp[v] = i
+ }
+ sort.Slice(score, func(i, j int) bool {
+ return score[i] > score[j]
+ })
+ ans := make([]string, len(score))
+ for i, v := range score {
+ if i == 0 {
+ ans[mp[v]] = "Gold Medal"
+ } else if i == 1 {
+ ans[mp[v]] = "Silver Medal"
+ } else if i == 2 {
+ ans[mp[v]] = "Bronze Medal"
+ } else {
+ ans[mp[v]] = strconv.Itoa(i + 1)
+ }
+ }
+ return ans
+}
diff --git a/leetcode/0506.Relative-Ranks/506.Relative Ranks_test.go b/leetcode/0506.Relative-Ranks/506.Relative Ranks_test.go
new file mode 100644
index 000000000..b26017d68
--- /dev/null
+++ b/leetcode/0506.Relative-Ranks/506.Relative Ranks_test.go
@@ -0,0 +1,45 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question506 struct {
+ para506
+ ans506
+}
+
+// para 是参数
+type para506 struct {
+ score []int
+}
+
+// ans 是答案
+type ans506 struct {
+ ans []string
+}
+
+func Test_Problem506(t *testing.T) {
+
+ qs := []question506{
+
+ {
+ para506{[]int{5, 4, 3, 2, 1}},
+ ans506{[]string{"Gold Medal", "Silver Medal", "Bronze Medal", "4", "5"}},
+ },
+
+ {
+ para506{[]int{10, 3, 8, 9, 4}},
+ ans506{[]string{"Gold Medal", "5", "Bronze Medal", "Silver Medal", "4"}},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 506------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans506, q.para506
+ fmt.Printf("【input】:%v 【output】:%v\n", p.score, findRelativeRanks(p.score))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/0506.Relative-Ranks/README.md b/leetcode/0506.Relative-Ranks/README.md
new file mode 100644
index 000000000..e1eb64330
--- /dev/null
+++ b/leetcode/0506.Relative-Ranks/README.md
@@ -0,0 +1,84 @@
+# [506. Relative Ranks](https://leetcode.com/problems/relative-ranks/)
+
+## 题目
+
+You are given an integer array score of size n, where score[i] is the score of the ith athlete in a competition. All the scores are guaranteed to be unique.
+
+The athletes are placed based on their scores, where the 1st place athlete has the highest score, the 2nd place athlete has the 2nd highest score, and so on. The placement of each athlete determines their rank:
+
+- The 1st place athlete's rank is "Gold Medal".
+- The 2nd place athlete's rank is "Silver Medal".
+- The 3rd place athlete's rank is "Bronze Medal".
+- For the 4th place to the nth place athlete, their rank is their placement number (i.e., the xth place athlete's rank is "x").
+
+Return an array answer of size n where answer[i] is the rank of the ith athlete.
+
+**Example 1**:
+
+ Input: score = [5,4,3,2,1]
+ Output: ["Gold Medal","Silver Medal","Bronze Medal","4","5"]
+ Explanation: The placements are [1st, 2nd, 3rd, 4th, 5th].
+
+**Example 2**:
+
+ Input: score = [10,3,8,9,4]
+ Output: ["Gold Medal","5","Bronze Medal","Silver Medal","4"]
+ Explanation: The placements are [1st, 5th, 3rd, 2nd, 4th].
+
+**Constraints:**
+
+- n == score.length
+- 1 <= n <= 10000
+- 0 <= score[i] <= 1000000
+- All the values in score are unique.
+
+## 题目大意
+
+给你一个长度为 n 的整数数组 score ，其中 score[i] 是第 i 位运动员在比赛中的得分。所有得分都 互不相同 。
+
+运动员将根据得分 决定名次 ，其中名次第 1 的运动员得分最高，名次第 2 的运动员得分第 2 高，依此类推。运动员的名次决定了他们的获奖情况：
+
+- 名次第 1 的运动员获金牌 "Gold Medal" 。
+- 名次第 2 的运动员获银牌 "Silver Medal" 。
+- 名次第 3 的运动员获铜牌 "Bronze Medal" 。
+- 从名次第 4 到第 n 的运动员，只能获得他们的名次编号（即，名次第 x 的运动员获得编号 "x"）。
+
+使用长度为 n 的数组 answer 返回获奖，其中 answer[i] 是第 i 位运动员的获奖情况。
+
+## 解题思路
+
+- 用 map 记录原来 score 中元素对应的坐标，然后对 score 进行排序，对排序后的元素我们通过 map 就可以知道它排的名次了
+
+## 代码
+
+```go
+package leetcode
+
+import (
+ "sort"
+ "strconv"
+)
+
+func findRelativeRanks(score []int) []string {
+ mp := make(map[int]int)
+ for i, v := range score {
+ mp[v] = i
+ }
+ sort.Slice(score, func(i, j int) bool {
+ return score[i] > score[j]
+ })
+ ans := make([]string, len(score))
+ for i, v := range score {
+ if i == 0 {
+ ans[mp[v]] = "Gold Medal"
+ } else if i == 1 {
+ ans[mp[v]] = "Silver Medal"
+ } else if i == 2 {
+ ans[mp[v]] = "Bronze Medal"
+ } else {
+ ans[mp[v]] = strconv.Itoa(i + 1)
+ }
+ }
+ return ans
+}
+```
\ No newline at end of file
diff --git a/leetcode/0508.Most-Frequent-Subtree-Sum/508. Most Frequent Subtree Sum.go b/leetcode/0508.Most-Frequent-Subtree-Sum/508. Most Frequent Subtree Sum.go
index c35b7f7b3..98300692e 100644
--- a/leetcode/0508.Most-Frequent-Subtree-Sum/508. Most Frequent Subtree Sum.go
+++ b/leetcode/0508.Most-Frequent-Subtree-Sum/508. Most Frequent Subtree Sum.go
@@ -2,9 +2,7 @@ package leetcode
import (
"sort"
-)
-import (
"github.com/halfrost/LeetCode-Go/structures"
)
diff --git a/leetcode/0509.Fibonacci-Number/509. Fibonacci Number.go b/leetcode/0509.Fibonacci-Number/509. Fibonacci Number.go
index fcb0d3a70..ea6d95a26 100644
--- a/leetcode/0509.Fibonacci-Number/509. Fibonacci Number.go
+++ b/leetcode/0509.Fibonacci-Number/509. Fibonacci Number.go
@@ -108,3 +108,22 @@ func fib5(N int) int {
var goldenRatio float64 = float64((1 + math.Sqrt(5)) / 2)
return int(math.Round(math.Pow(goldenRatio, float64(N)) / math.Sqrt(5)))
}
+
+// 解法七 协程版，但是时间特别慢，不推荐，放在这里只是告诉大家，写 LeetCode 算法题的时候，启动 goroutine 特别慢
+func fib6(N int) int {
+ return <-fibb(N)
+}
+
+func fibb(n int) <-chan int {
+ result := make(chan int)
+ go func() {
+ defer close(result)
+
+ if n <= 1 {
+ result <- n
+ return
+ }
+ result <- <-fibb(n-1) + <-fibb(n-2)
+ }()
+ return result
+}
diff --git a/leetcode/0515.Find-Largest-Value-in-Each-Tree-Row/515. Find Largest Value in Each Tree Row.go b/leetcode/0515.Find-Largest-Value-in-Each-Tree-Row/515. Find Largest Value in Each Tree Row.go
index 042956e8c..54d831dc0 100644
--- a/leetcode/0515.Find-Largest-Value-in-Each-Tree-Row/515. Find Largest Value in Each Tree Row.go
+++ b/leetcode/0515.Find-Largest-Value-in-Each-Tree-Row/515. Find Largest Value in Each Tree Row.go
@@ -3,9 +3,7 @@ package leetcode
import (
"math"
"sort"
-)
-import (
"github.com/halfrost/LeetCode-Go/structures"
)
@@ -92,3 +90,25 @@ func largestValues1(root *TreeNode) []int {
}
return res
}
+
+// 解法三 深度遍历二叉树
+func largestValues3(root *TreeNode) []int {
+ var res []int
+ var dfs func(root *TreeNode, level int)
+ dfs = func(root *TreeNode, level int) {
+ if root == nil {
+ return
+ }
+ if len(res) == level {
+ res = append(res, root.Val)
+ }
+ if res[level] < root.Val {
+ res[level] = root.Val
+ }
+
+ dfs(root.Right, level+1)
+ dfs(root.Left, level+1)
+ }
+ dfs(root, 0)
+ return res
+}
diff --git a/leetcode/0518.Coin-Change-II/518. Coin Change II.go b/leetcode/0518.Coin-Change-II/518. Coin Change II.go
new file mode 100644
index 000000000..9de3726da
--- /dev/null
+++ b/leetcode/0518.Coin-Change-II/518. Coin Change II.go
@@ -0,0 +1,12 @@
+package leetcode
+
+func change(amount int, coins []int) int {
+ dp := make([]int, amount+1)
+ dp[0] = 1
+ for _, coin := range coins {
+ for i := coin; i <= amount; i++ {
+ dp[i] += dp[i-coin]
+ }
+ }
+ return dp[amount]
+}
diff --git a/leetcode/0518.Coin-Change-II/518. Coin Change II_test.go b/leetcode/0518.Coin-Change-II/518. Coin Change II_test.go
new file mode 100644
index 000000000..e98639433
--- /dev/null
+++ b/leetcode/0518.Coin-Change-II/518. Coin Change II_test.go
@@ -0,0 +1,53 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question518 struct {
+ para518
+ ans518
+}
+
+// para 是参数
+// one 代表第一个参数
+type para518 struct {
+ amount int
+ coins []int
+}
+
+// ans 是答案
+// one 代表第一个答案
+type ans518 struct {
+ one int
+}
+
+func Test_Problem518(t *testing.T) {
+
+ qs := []question518{
+
+ {
+ para518{5, []int{1, 2, 5}},
+ ans518{4},
+ },
+
+ {
+ para518{3, []int{2}},
+ ans518{0},
+ },
+
+ {
+ para518{10, []int{10}},
+ ans518{1},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 518------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans518, q.para518
+ fmt.Printf("【input】:%v 【output】:%v\n", p, change(p.amount, p.coins))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/0518.Coin-Change-II/README.md b/leetcode/0518.Coin-Change-II/README.md
new file mode 100644
index 000000000..4679d2d3c
--- /dev/null
+++ b/leetcode/0518.Coin-Change-II/README.md
@@ -0,0 +1,73 @@
+# [518. Coin Change II](https://leetcode.com/problems/coin-change-ii/)
+
+
+## 题目
+
+You are given an integer array `coins` representing coins of different denominations and an integer `amount` representing a total amount of money.
+
+Return *the number of combinations that make up that amount*. If that amount of money cannot be made up by any combination of the coins, return `0`.
+
+You may assume that you have an infinite number of each kind of coin.
+
+The answer is **guaranteed** to fit into a signed **32-bit** integer.
+
+**Example 1:**
+
+```
+Input: amount = 5, coins = [1,2,5]
+Output: 4
+Explanation: there are four ways to make up the amount:
+5=5
+5=2+2+1
+5=2+1+1+1
+5=1+1+1+1+1
+```
+
+**Example 2:**
+
+```
+Input: amount = 3, coins = [2]
+Output: 0
+Explanation: the amount of 3 cannot be made up just with coins of 2.
+```
+
+**Example 3:**
+
+```
+Input: amount = 10, coins = [10]
+Output: 1
+```
+
+**Constraints:**
+
+- `1 <= coins.length <= 300`
+- `1 <= coins[i] <= 5000`
+- All the values of `coins` are **unique**.
+- `0 <= amount <= 5000`
+
+## 题目大意
+
+给你一个整数数组 coins 表示不同面额的硬币，另给一个整数 amount 表示总金额。请你计算并返回可以凑成总金额的硬币组合数。如果任何硬币组合都无法凑出总金额，返回 0 。假设每一种面额的硬币有无限个。题目数据保证结果符合 32 位带符号整数。
+
+## 解题思路
+
+- 此题虽然名字叫 Coin Change，但是不是经典的背包九讲问题。题目中 coins 的每个元素可以选取多次，且不考虑选取元素的顺序，因此这道题实际需要计算的是选取硬币的组合数。定义 dp[i] 表示金额之和等于 i 的硬币组合数，目标求 dp[amount]。初始边界条件为 dp[0] = 1，即不取任何硬币，就这一种取法，金额为 0 。状态转移方程 dp[i] += dp[i-coin]，coin 为当前枚举的 coin。
+- 可能有读者会有疑惑，上述做法会不会出现重复计算。答案是不会。外层循环是遍历数组 coins 的值，内层循环是遍历不同的金额之和，在计算 dp[i] 的值时，可以确保金额之和等于 i 的硬币面额的顺序，由于顺序确定，因此不会重复计算不同的排列。
+- 和此题完全一致的解题思路的题有，第 377 题和第 494 题。
+
+## 代码
+
+```go
+package leetcode
+
+func change(amount int, coins []int) int {
+ dp := make([]int, amount+1)
+ dp[0] = 1
+ for _, coin := range coins {
+ for i := coin; i <= amount; i++ {
+ dp[i] += dp[i-coin]
+ }
+ }
+ return dp[amount]
+}
+```
\ No newline at end of file
diff --git a/leetcode/0519.Random-Flip-Matrix/519.Random Flip Matrix.go b/leetcode/0519.Random-Flip-Matrix/519.Random Flip Matrix.go
new file mode 100644
index 000000000..4b0df378a
--- /dev/null
+++ b/leetcode/0519.Random-Flip-Matrix/519.Random Flip Matrix.go
@@ -0,0 +1,43 @@
+package leetcode
+
+import (
+ "math/rand"
+)
+
+type Solution struct {
+ r int
+ c int
+ total int
+ mp map[int]int
+}
+
+func Constructor(m int, n int) Solution {
+ return Solution{
+ r: m,
+ c: n,
+ total: m * n,
+ mp: map[int]int{},
+ }
+}
+
+func (this *Solution) Flip() []int {
+ k := rand.Intn(this.total)
+ val := k
+ if v, ok := this.mp[k]; ok {
+ val = v
+ }
+ if _, ok := this.mp[this.total-1]; ok {
+ this.mp[k] = this.mp[this.total-1]
+ } else {
+ this.mp[k] = this.total - 1
+ }
+ delete(this.mp, this.total-1)
+ this.total--
+ newR, newC := val/this.c, val%this.c
+ return []int{newR, newC}
+}
+
+func (this *Solution) Reset() {
+ this.total = this.r * this.c
+ this.mp = map[int]int{}
+}
diff --git a/leetcode/0519.Random-Flip-Matrix/519.Random Flip Matrix_test.go b/leetcode/0519.Random-Flip-Matrix/519.Random Flip Matrix_test.go
new file mode 100644
index 000000000..847ac79a2
--- /dev/null
+++ b/leetcode/0519.Random-Flip-Matrix/519.Random Flip Matrix_test.go
@@ -0,0 +1,52 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question519 struct {
+ para519
+ ans519
+}
+
+// para 是参数
+type para519 struct {
+ para []string
+ val [][]int
+}
+
+// ans 是答案
+type ans519 struct {
+ ans [][]int
+}
+
+func Test_Problem519(t *testing.T) {
+
+ qs := []question519{
+
+ {
+ para519{[]string{"Solution", "flip", "flip", "flip", "reset", "flip"}, [][]int{{3, 1}, {}, {}, {}, {}, {}}},
+ ans519{[][]int{nil, {1, 0}, {2, 0}, {0, 0}, nil, {2, 0}}},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 519------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans519, q.para519
+ sol := Constructor(0, 0)
+ for _, v := range p.para {
+ if v == "Solution" {
+ sol = Constructor(q.val[0][0], q.val[0][1])
+ fmt.Printf("【input】:%v 【output】:%v\n", v, nil)
+ } else if v == "flip" {
+ fmt.Printf("【input】:%v 【output】:%v\n", v, sol.Flip())
+ } else {
+ sol.Reset()
+ fmt.Printf("【input】:%v 【output】:%v\n", v, nil)
+ }
+ }
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/0519.Random-Flip-Matrix/README.md b/leetcode/0519.Random-Flip-Matrix/README.md
new file mode 100644
index 000000000..2f9ae71c1
--- /dev/null
+++ b/leetcode/0519.Random-Flip-Matrix/README.md
@@ -0,0 +1,98 @@
+# [519. Random Flip Matrix](https://leetcode.com/problems/random-flip-matrix/)
+
+## 题目
+
+There is an m x n binary grid matrix with all the values set 0 initially. Design an algorithm to randomly pick an index (i, j) where matrix[i][j] == 0 and flips it to 1. All the indices (i, j) where matrix[i][j] == 0 should be equally likely to be returned.
+
+Optimize your algorithm to minimize the number of calls made to the built-in random function of your language and optimize the time and space complexity.
+
+Implement the Solution class:
+
+- Solution(int m, int n) Initializes the object with the size of the binary matrix m and n.
+- int[] flip() Returns a random index [i, j] of the matrix where matrix[i][j] == 0 and flips it to 1.
+- void reset() Resets all the values of the matrix to be 0.
+
+**Example 1**:
+
+ Input
+ ["Solution", "flip", "flip", "flip", "reset", "flip"]
+ [[3, 1], [], [], [], [], []]
+ Output
+ [null, [1, 0], [2, 0], [0, 0], null, [2, 0]]
+
+ Explanation
+ Solution solution = new Solution(3, 1);
+ solution.flip(); // return [1, 0], [0,0], [1,0], and [2,0] should be equally likely to be returned.
+ solution.flip(); // return [2, 0], Since [1,0] was returned, [2,0] and [0,0]
+ solution.flip(); // return [0, 0], Based on the previously returned indices, only [0,0] can be returned.
+ solution.reset(); // All the values are reset to 0 and can be returned.
+ solution.flip(); // return [2, 0], [0,0], [1,0], and [2,0] should be equally likely to be returned.
+
+**Constraints:**
+
+- 1 <= m, n <= 10000
+- There will be at least one free cell for each call to flip.
+- At most 1000 calls will be made to flip and reset.
+
+## 题目大意
+
+给你一个 m x n 的二元矩阵 matrix ，且所有值被初始化为 0 。请你设计一个算法，随机选取一个满足 matrix[i][j] == 0 的下标 (i, j) ，并将它的值变为 1 。所有满足 matrix[i][j] == 0 的下标 (i, j) 被选取的概率应当均等。
+
+尽量最少调用内置的随机函数，并且优化时间和空间复杂度。
+
+实现 Solution 类：
+
+- Solution(int m, int n) 使用二元矩阵的大小 m 和 n 初始化该对象
+- int[] flip() 返回一个满足 matrix[i][j] == 0 的随机下标 [i, j] ，并将其对应格子中的值变为 1
+- void reset() 将矩阵中所有的值重置为 0
+
+## 解题思路
+
+- 二维矩阵利用哈希表转换为一维,每次随机选择一维中的任意一个元素，然后与最后一个元素交换，一维元素的总个数减一
+- 哈希表中默认的映射为x->x, 然后将不满足这个映射的特殊键值对存入哈希表
+
+## 代码
+
+```go
+package leetcode
+
+import "math/rand"
+
+type Solution struct {
+ r int
+ c int
+ total int
+ mp map[int]int
+}
+
+func Constructor(m int, n int) Solution {
+ return Solution{
+ r: m,
+ c: n,
+ total: m * n,
+ mp: map[int]int{},
+ }
+}
+
+func (this *Solution) Flip() []int {
+ k := rand.Intn(this.total)
+ val := k
+ if v, ok := this.mp[k]; ok {
+ val = v
+ }
+ if _, ok := this.mp[this.total-1]; ok {
+ this.mp[k] = this.mp[this.total-1]
+ } else {
+ this.mp[k] = this.total - 1
+ }
+ delete(this.mp, this.total - 1)
+ this.total--
+ newR, newC := val/this.c, val%this.c
+ return []int{newR, newC}
+}
+
+func (this *Solution) Reset() {
+ this.total = this.r * this.c
+ this.mp = map[int]int{}
+}
+```
\ No newline at end of file
diff --git a/leetcode/0520.Detect-Capital/520.Detect Capital.go b/leetcode/0520.Detect-Capital/520.Detect Capital.go
new file mode 100644
index 000000000..c9710484d
--- /dev/null
+++ b/leetcode/0520.Detect-Capital/520.Detect Capital.go
@@ -0,0 +1,13 @@
+package leetcode
+
+import "strings"
+
+func detectCapitalUse(word string) bool {
+ wLower := strings.ToLower(word)
+ wUpper := strings.ToUpper(word)
+ wCaptial := strings.ToUpper(string(word[0])) + strings.ToLower(string(word[1:]))
+ if wCaptial == word || wLower == word || wUpper == word {
+ return true
+ }
+ return false
+}
diff --git a/leetcode/0520.Detect-Capital/520.Detect Capital_test.go b/leetcode/0520.Detect-Capital/520.Detect Capital_test.go
new file mode 100644
index 000000000..20635849b
--- /dev/null
+++ b/leetcode/0520.Detect-Capital/520.Detect Capital_test.go
@@ -0,0 +1,45 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question520 struct {
+ para520
+ ans520
+}
+
+// para 是参数
+type para520 struct {
+ word string
+}
+
+// ans 是答案
+type ans520 struct {
+ ans bool
+}
+
+func Test_Problem520(t *testing.T) {
+
+ qs := []question520{
+
+ {
+ para520{"USA"},
+ ans520{true},
+ },
+
+ {
+ para520{"FlaG"},
+ ans520{false},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 520------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans520, q.para520
+ fmt.Printf("【input】:%v 【output】:%v\n", p, detectCapitalUse(p.word))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/0520.Detect-Capital/README.md b/leetcode/0520.Detect-Capital/README.md
new file mode 100644
index 000000000..c4532bfd8
--- /dev/null
+++ b/leetcode/0520.Detect-Capital/README.md
@@ -0,0 +1,68 @@
+# [520. Detect Capital](https://leetcode.com/problems/detect-capital/)
+
+
+## 题目
+
+We define the usage of capitals in a word to be right when one of the following cases holds:
+
+All letters in this word are capitals, like "USA".
+
+All letters in this word are not capitals, like "leetcode".
+
+Only the first letter in this word is capital, like "Google".
+
+Given a string word, return true if the usage of capitals in it is right.
+
+**Example 1:**
+
+```
+Input: word = "USA"
+Output: true
+```
+
+**Example 2:**
+
+```
+Input: word = "FlaG"
+Output: false
+```
+
+**Constraints:**
+
+- 1 <= word.length <= 100
+- word consists of lowercase and uppercase English letters.
+
+## 题目大意
+
+我们定义，在以下情况时，单词的大写用法是正确的：
+
+全部字母都是大写，比如 "USA" 。
+单词中所有字母都不是大写，比如 "leetcode" 。
+如果单词不只含有一个字母，只有首字母大写，比如"Google" 。
+
+给你一个字符串 word 。如果大写用法正确，返回 true ；否则，返回 false 。
+
+## 解题思路
+
+- 把 word 分别转换为全部小写 wLower，全部大写 wUpper，首字母大写的字符串 wCaptial
+- 判断 word 是否等于 wLower, wUpper, wCaptial 中的一个，如果是返回 true，否则返回 false
+
+## 代码
+
+```go
+
+package leetcode
+
+import "strings"
+
+func detectCapitalUse(word string) bool {
+ wLower := strings.ToLower(word)
+ wUpper := strings.ToUpper(word)
+ wCaptial := strings.ToUpper(string(word[0])) + strings.ToLower(string(word[1:]))
+ if wCaptial == word || wLower == word || wUpper == word {
+ return true
+ }
+ return false
+}
+
+```
\ No newline at end of file
diff --git a/leetcode/0523.Continuous-Subarray-Sum/523. Continuous Subarray Sum.go b/leetcode/0523.Continuous-Subarray-Sum/523. Continuous Subarray Sum.go
new file mode 100644
index 000000000..15b23937d
--- /dev/null
+++ b/leetcode/0523.Continuous-Subarray-Sum/523. Continuous Subarray Sum.go
@@ -0,0 +1,18 @@
+package leetcode
+
+func checkSubarraySum(nums []int, k int) bool {
+ m := make(map[int]int)
+ m[0] = -1
+ sum := 0
+ for i, n := range nums {
+ sum += n
+ if r, ok := m[sum%k]; ok {
+ if i-2 >= r {
+ return true
+ }
+ } else {
+ m[sum%k] = i
+ }
+ }
+ return false
+}
diff --git a/leetcode/0523.Continuous-Subarray-Sum/523. Continuous Subarray Sum_test.go b/leetcode/0523.Continuous-Subarray-Sum/523. Continuous Subarray Sum_test.go
new file mode 100644
index 000000000..f3147e166
--- /dev/null
+++ b/leetcode/0523.Continuous-Subarray-Sum/523. Continuous Subarray Sum_test.go
@@ -0,0 +1,53 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question523 struct {
+ para523
+ ans523
+}
+
+// para 是参数
+// one 代表第一个参数
+type para523 struct {
+ nums []int
+ k int
+}
+
+// ans 是答案
+// one 代表第一个答案
+type ans523 struct {
+ one bool
+}
+
+func Test_Problem523(t *testing.T) {
+
+ qs := []question523{
+
+ {
+ para523{[]int{23, 2, 4, 6, 7}, 6},
+ ans523{true},
+ },
+
+ {
+ para523{[]int{23, 2, 6, 4, 7}, 6},
+ ans523{true},
+ },
+
+ {
+ para523{[]int{23, 2, 6, 4, 7}, 13},
+ ans523{false},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 523------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans523, q.para523
+ fmt.Printf("【input】:%v 【output】:%v\n", p, checkSubarraySum(p.nums, p.k))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/0523.Continuous-Subarray-Sum/README.md b/leetcode/0523.Continuous-Subarray-Sum/README.md
new file mode 100644
index 000000000..ac6d2df61
--- /dev/null
+++ b/leetcode/0523.Continuous-Subarray-Sum/README.md
@@ -0,0 +1,75 @@
+# [523. Continuous Subarray Sum](https://leetcode.com/problems/continuous-subarray-sum/)
+
+
+## 题目
+
+Given an integer array `nums` and an integer `k`, return `true` *if* `nums` *has a continuous subarray of size **at least two** whose elements sum up to a multiple of* `k`*, or* `false` *otherwise*.
+
+An integer `x` is a multiple of `k` if there exists an integer `n` such that `x = n * k`. `0` is **always** a multiple of `k`.
+
+**Example 1:**
+
+```
+Input: nums = [23,2,4,6,7], k = 6
+Output: true
+Explanation: [2, 4] is a continuous subarray of size 2 whose elements sum up to 6.
+```
+
+**Example 2:**
+
+```
+Input: nums = [23,2,6,4,7], k = 6
+Output: true
+Explanation: [23, 2, 6, 4, 7] is an continuous subarray of size 5 whose elements sum up to 42.
+42 is a multiple of 6 because 42 = 7 * 6 and 7 is an integer.
+```
+
+**Example 3:**
+
+```
+Input: nums = [23,2,6,4,7], k = 13
+Output: false
+```
+
+**Constraints:**
+
+- `1 <= nums.length <= 105`
+- `0 <= nums[i] <= 109`
+- `0 <= sum(nums[i]) <= 231 - 1`
+- `1 <= k <= 231 - 1`
+
+## 题目大意
+
+给你一个整数数组 nums 和一个整数 k ，编写一个函数来判断该数组是否含有同时满足下述条件的连续子数组：
+
+- 子数组大小至少为 2 ，且
+- 子数组元素总和为 k 的倍数。
+
+如果存在，返回 true ；否则，返回 false 。如果存在一个整数 n ，令整数 x 符合 x = n * k ，则称 x 是 k 的一个倍数。
+
+## 解题思路
+
+- 简单题。题目只要求是否存在，不要求找出所有解。用一个变量 sum 记录累加和。子数组的元素和可以用前缀和相减得到，例如 [i,j] 区间内的元素和，可以由 prefixSum[j] - prefixSum[i] 得到。当 prefixSums[j]−prefixSums[i] 为 k 的倍数时，prefixSums[i] 和 prefixSums[j] 除以 k 的余数相同。因此只需要计算每个下标对应的前缀和除以 k 的余数即可，使用 map 存储每个余数第一次出现的下标即可。在 map 中如果存在相同余数的 key，代表当前下标和 map 中这个 key 记录的下标可以满足总和为 k 的倍数这一条件。再判断一下能否满足大小至少为 2 的条件即可。用 2 个下标相减，长度大于等于 2 即满足条件，可以输出 true。
+
+## 代码
+
+```go
+package leetcode
+
+func checkSubarraySum(nums []int, k int) bool {
+ m := make(map[int]int)
+ m[0] = -1
+ sum := 0
+ for i, n := range nums {
+ sum += n
+ if r, ok := m[sum%k]; ok {
+ if i-2 >= r {
+ return true
+ }
+ } else {
+ m[sum%k] = i
+ }
+ }
+ return false
+}
+```
\ No newline at end of file
diff --git a/leetcode/0525.Contiguous-Array/525. Contiguous Array.go b/leetcode/0525.Contiguous-Array/525. Contiguous Array.go
new file mode 100644
index 000000000..802a3be9a
--- /dev/null
+++ b/leetcode/0525.Contiguous-Array/525. Contiguous Array.go
@@ -0,0 +1,27 @@
+package leetcode
+
+func findMaxLength(nums []int) int {
+ dict := map[int]int{}
+ dict[0] = -1
+ count, res := 0, 0
+ for i := 0; i < len(nums); i++ {
+ if nums[i] == 0 {
+ count--
+ } else {
+ count++
+ }
+ if idx, ok := dict[count]; ok {
+ res = max(res, i-idx)
+ } else {
+ dict[count] = i
+ }
+ }
+ return res
+}
+
+func max(a, b int) int {
+ if a > b {
+ return a
+ }
+ return b
+}
diff --git a/leetcode/0525.Contiguous-Array/525. Contiguous Array_test.go b/leetcode/0525.Contiguous-Array/525. Contiguous Array_test.go
new file mode 100644
index 000000000..644885d15
--- /dev/null
+++ b/leetcode/0525.Contiguous-Array/525. Contiguous Array_test.go
@@ -0,0 +1,47 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question525 struct {
+ para525
+ ans525
+}
+
+// para 是参数
+// one 代表第一个参数
+type para525 struct {
+ nums []int
+}
+
+// ans 是答案
+// one 代表第一个答案
+type ans525 struct {
+ one int
+}
+
+func Test_Problem525(t *testing.T) {
+
+ qs := []question525{
+
+ {
+ para525{[]int{0, 1}},
+ ans525{2},
+ },
+
+ {
+ para525{[]int{0, 1, 0}},
+ ans525{2},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 525------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans525, q.para525
+ fmt.Printf("【input】:%v 【output】:%v\n", p, findMaxLength(p.nums))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/0525.Contiguous-Array/README.md b/leetcode/0525.Contiguous-Array/README.md
new file mode 100644
index 000000000..7f1dbf157
--- /dev/null
+++ b/leetcode/0525.Contiguous-Array/README.md
@@ -0,0 +1,67 @@
+# [525. Contiguous Array](https://leetcode.com/problems/contiguous-array/)
+
+
+## 题目
+
+Given a binary array `nums`, return *the maximum length of a contiguous subarray with an equal number of* `0` *and* `1`.
+
+**Example 1:**
+
+```
+Input: nums = [0,1]
+Output: 2
+Explanation: [0, 1] is the longest contiguous subarray with an equal number of 0 and 1.
+```
+
+**Example 2:**
+
+```
+Input: nums = [0,1,0]
+Output: 2
+Explanation: [0, 1] (or [1, 0]) is a longest contiguous subarray with equal number of 0 and 1.
+```
+
+**Constraints:**
+
+- `1 <= nums.length <= 105`
+- `nums[i]` is either `0` or `1`.
+
+## 题目大意
+
+给定一个二进制数组 nums , 找到含有相同数量的 0 和 1 的最长连续子数组，并返回该子数组的长度。
+
+## 解题思路
+
+- 0 和 1 的数量相同可以转化为两者数量相差为 0，如果将 0 看作为 -1，那么原题转化为求最长连续子数组，其元素和为 0 。又变成了区间内求和的问题，自然而然转换为前缀和来处理。假设连续子数组是 [i,j] 区间，这个区间内元素和为 0 意味着 prefixSum[j] - prefixSum[i] = 0，也就是 prefixSum[i] = prefixSum[j]。不断累加前缀和，将每个前缀和存入 map 中。一旦某个 key 存在了，代表之前某个下标的前缀和和当前下标构成的区间，这段区间内的元素和为 0 。这个区间是所求。扫完整个数组，扫描过程中动态更新最大区间长度，扫描完成便可得到最大区间长度，即最长连续子数组。
+
+## 代码
+
+```go
+package leetcode
+
+func findMaxLength(nums []int) int {
+ dict := map[int]int{}
+ dict[0] = -1
+ count, res := 0, 0
+ for i := 0; i < len(nums); i++ {
+ if nums[i] == 0 {
+ count--
+ } else {
+ count++
+ }
+ if idx, ok := dict[count]; ok {
+ res = max(res, i-idx)
+ } else {
+ dict[count] = i
+ }
+ }
+ return res
+}
+
+func max(a, b int) int {
+ if a > b {
+ return a
+ }
+ return b
+}
+```
\ No newline at end of file
diff --git a/leetcode/0529.Minesweeper/529. Minesweeper.go b/leetcode/0529.Minesweeper/529. Minesweeper.go
index aef5d2b86..786405ee7 100644
--- a/leetcode/0529.Minesweeper/529. Minesweeper.go
+++ b/leetcode/0529.Minesweeper/529. Minesweeper.go
@@ -16,48 +16,31 @@ func updateBoard(board [][]byte, click []int) [][]byte {
board[click[0]][click[1]] = 'X'
return board
}
+ dfs(board, click[0], click[1])
+ return board
+}
- mineMap := make([][]int, len(board))
- for i := range board {
- mineMap[i] = make([]int, len(board[i]))
+func dfs(board [][]byte, x, y int) {
+ cnt := 0
+ for i := 0; i < 8; i++ {
+ nx, ny := x+dir8[i][0], y+dir8[i][1]
+ if isInBoard(board, nx, ny) && board[nx][ny] == 'M' {
+ cnt++
+ }
}
-
- for i := range board {
- for j := range board[i] {
- if board[i][j] == 'M' {
- mineMap[i][j] = -1
- for _, d := range dir8 {
- nx, ny := i+d[0], j+d[1]
- if isInBoard(board, nx, ny) && mineMap[nx][ny] >= 0 {
- mineMap[nx][ny]++
- }
- }
- }
+ if cnt > 0 {
+ board[x][y] = byte(cnt + '0')
+ return
+ }
+ board[x][y] = 'B'
+ for i := 0; i < 8; i++ {
+ nx, ny := x+dir8[i][0], y+dir8[i][1]
+ if isInBoard(board, nx, ny) && board[nx][ny] != 'B' {
+ dfs(board, nx, ny)
}
}
- mineSweeper(click[0], click[1], board, mineMap, dir8)
- return board
}
func isInBoard(board [][]byte, x, y int) bool {
return x >= 0 && x < len(board) && y >= 0 && y < len(board[0])
}
-
-func mineSweeper(x, y int, board [][]byte, mineMap [][]int, dir8 [][]int) {
- if board[x][y] != 'M' && board[x][y] != 'E' {
- return
- }
- if mineMap[x][y] == -1 {
- board[x][y] = 'X'
- } else if mineMap[x][y] > 0 {
- board[x][y] = '0' + byte(mineMap[x][y])
- } else {
- board[x][y] = 'B'
- for _, d := range dir8 {
- nx, ny := x+d[0], y+d[1]
- if isInBoard(board, nx, ny) && mineMap[nx][ny] >= 0 {
- mineSweeper(nx, ny, board, mineMap, dir8)
- }
- }
- }
-}
diff --git a/leetcode/0529.Minesweeper/README.md b/leetcode/0529.Minesweeper/README.md
index f2166a692..d25c79c50 100644
--- a/leetcode/0529.Minesweeper/README.md
+++ b/leetcode/0529.Minesweeper/README.md
@@ -103,43 +103,33 @@ func updateBoard(board [][]byte, click []int) [][]byte {
board[click[0]][click[1]] = 'X'
return board
}
- mineMap := make([][]int, len(board))
- for i := range board {
- mineMap[i] = make([]int, len(board[i]))
- }
- for i := range board {
- for j := range board[i] {
- if board[i][j] == 'M' {
- mineMap[i][j] = -1
- for _, d := range dir8 {
- nx, ny := i+d[0], j+d[1]
- if isInBoard(board, nx, ny) && mineMap[nx][ny] >= 0 {
- mineMap[nx][ny]++
- }
- }
- }
- }
- }
- mineSweeper(click[0], click[1], board, mineMap, dir8)
+ dfs(board, click[0], click[1])
return board
}
-func mineSweeper(x, y int, board [][]byte, mineMap [][]int, dir8 [][]int) {
- if board[x][y] != 'M' && board[x][y] != 'E' {
+func dfs(board [][]byte, x, y int) {
+ cnt := 0
+ for i := 0; i < 8; i++ {
+ nx, ny := x+dir8[i][0], y+dir8[i][1]
+ if isInBoard(board, nx, ny) && board[nx][ny] == 'M' {
+ cnt++
+
+ }
+ }
+ if cnt > 0 {
+ board[x][y] = byte(cnt + '0')
return
}
- if mineMap[x][y] == -1 {
- board[x][y] = 'X'
- } else if mineMap[x][y] > 0 {
- board[x][y] = '0' + byte(mineMap[x][y])
- } else {
- board[x][y] = 'B'
- for _, d := range dir8 {
- nx, ny := x+d[0], y+d[1]
- if isInBoard(board, nx, ny) && mineMap[nx][ny] >= 0 {
- mineSweeper(nx, ny, board, mineMap, dir8)
- }
+ board[x][y] = 'B'
+ for i := 0; i < 8; i++ {
+ nx, ny := x+dir8[i][0], y+dir8[i][1]
+ if isInBoard(board, nx, ny) && board[nx][ny] != 'B' {
+ dfs(board, nx, ny)
}
}
}
+
+func isInBoard(board [][]byte, x, y int) bool {
+ return x >= 0 && x < len(board) && y >= 0 && y < len(board[0])
+}
```
\ No newline at end of file
diff --git a/leetcode/0530.Minimum-Absolute-Difference-in-BST/530. Minimum Absolute Difference in BST.go b/leetcode/0530.Minimum-Absolute-Difference-in-BST/530. Minimum Absolute Difference in BST.go
new file mode 100644
index 000000000..43fc4eabb
--- /dev/null
+++ b/leetcode/0530.Minimum-Absolute-Difference-in-BST/530. Minimum Absolute Difference in BST.go
@@ -0,0 +1,51 @@
+package leetcode
+
+import (
+ "math"
+
+ "github.com/halfrost/LeetCode-Go/structures"
+)
+
+// TreeNode define
+type TreeNode = structures.TreeNode
+
+/**
+ * Definition for a binary tree node.
+ * type TreeNode struct {
+ * Val int
+ * Left *TreeNode
+ * Right *TreeNode
+ * }
+ */
+
+func getMinimumDifference(root *TreeNode) int {
+ res, nodes := math.MaxInt16, -1
+ dfsBST(root, &res, &nodes)
+ return res
+}
+
+func dfsBST(root *TreeNode, res, pre *int) {
+ if root == nil {
+ return
+ }
+ dfsBST(root.Left, res, pre)
+ if *pre != -1 {
+ *res = min(*res, abs(root.Val-*pre))
+ }
+ *pre = root.Val
+ dfsBST(root.Right, res, pre)
+}
+
+func min(a, b int) int {
+ if a > b {
+ return b
+ }
+ return a
+}
+
+func abs(a int) int {
+ if a > 0 {
+ return a
+ }
+ return -a
+}
diff --git a/leetcode/0530.Minimum-Absolute-Difference-in-BST/530. Minimum Absolute Difference in BST_test.go b/leetcode/0530.Minimum-Absolute-Difference-in-BST/530. Minimum Absolute Difference in BST_test.go
new file mode 100644
index 000000000..62230730b
--- /dev/null
+++ b/leetcode/0530.Minimum-Absolute-Difference-in-BST/530. Minimum Absolute Difference in BST_test.go
@@ -0,0 +1,56 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+
+ "github.com/halfrost/LeetCode-Go/structures"
+)
+
+type question530 struct {
+ para530
+ ans530
+}
+
+// para 是参数
+// one 代表第一个参数
+type para530 struct {
+ one []int
+}
+
+// ans 是答案
+// one 代表第一个答案
+type ans530 struct {
+ one int
+}
+
+func Test_Problem530(t *testing.T) {
+
+ qs := []question530{
+
+ {
+ para530{[]int{4, 2, 6, 1, 3}},
+ ans530{1},
+ },
+
+ {
+ para530{[]int{1, 0, 48, structures.NULL, structures.NULL, 12, 49}},
+ ans530{1},
+ },
+
+ {
+ para530{[]int{90, 69, structures.NULL, 49, 89, structures.NULL, 52}},
+ ans530{1},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 530------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans530, q.para530
+ fmt.Printf("【input】:%v ", p)
+ rootOne := structures.Ints2TreeNode(p.one)
+ fmt.Printf("【output】:%v \n", getMinimumDifference(rootOne))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/0530.Minimum-Absolute-Difference-in-BST/README.md b/leetcode/0530.Minimum-Absolute-Difference-in-BST/README.md
new file mode 100644
index 000000000..c926d3518
--- /dev/null
+++ b/leetcode/0530.Minimum-Absolute-Difference-in-BST/README.md
@@ -0,0 +1,94 @@
+# [530. Minimum Absolute Difference in BST](https://leetcode.com/problems/minimum-absolute-difference-in-bst/)
+
+
+## 题目
+
+Given a binary search tree with non-negative values, find the minimum [absolute difference](https://en.wikipedia.org/wiki/Absolute_difference) between values of any two nodes.
+
+**Example:**
+
+```
+Input:
+
+ 1
+ \
+ 3
+ /
+ 2
+
+Output:
+1
+
+Explanation:
+The minimum absolute difference is 1, which is the difference between 2 and 1 (or between 2 and 3).
+```
+
+**Note:**
+
+- There are at least two nodes in this BST.
+- This question is the same as 783: [https://leetcode.com/problems/minimum-distance-between-bst-nodes/](https://leetcode.com/problems/minimum-distance-between-bst-nodes/)
+
+## 题目大意
+
+给你一棵所有节点为非负值的二叉搜索树，请你计算树中任意两节点的差的绝对值的最小值。
+
+## 解题思路
+
+- 由于是 BST 树，利用它有序的性质，中根遍历的结果是有序的。中根遍历过程中动态维护前后两个节点的差值，即可找到最小差值。
+- 此题与第 783 题完全相同。
+
+## 代码
+
+```go
+package leetcode
+
+import (
+ "math"
+
+ "github.com/halfrost/LeetCode-Go/structures"
+)
+
+// TreeNode define
+type TreeNode = structures.TreeNode
+
+/**
+ * Definition for a binary tree node.
+ * type TreeNode struct {
+ * Val int
+ * Left *TreeNode
+ * Right *TreeNode
+ * }
+ */
+
+func getMinimumDifference(root *TreeNode) int {
+ res, nodes := math.MaxInt16, -1
+ dfsBST(root, &res, &nodes)
+ return res
+}
+
+func dfsBST(root *TreeNode, res, pre *int) {
+ if root == nil {
+ return
+ }
+ dfsBST(root.Left, res, pre)
+ if *pre != -1 {
+ *res = min(*res, abs(root.Val-*pre))
+ }
+ *pre = root.Val
+ dfsBST(root.Right, res, pre)
+}
+
+func min(a, b int) int {
+ if a > b {
+ return b
+ }
+ return a
+}
+
+func abs(a int) int {
+ if a > 0 {
+ return a
+ }
+ return -a
+}
+```
\ No newline at end of file
diff --git a/leetcode/0535.Encode-and-Decode-TinyURL/535. Encode and Decode TinyURL.go b/leetcode/0535.Encode-and-Decode-TinyURL/535. Encode and Decode TinyURL.go
new file mode 100644
index 000000000..dc7fa65d9
--- /dev/null
+++ b/leetcode/0535.Encode-and-Decode-TinyURL/535. Encode and Decode TinyURL.go
@@ -0,0 +1,35 @@
+package leetcode
+
+import (
+ "fmt"
+ "strconv"
+ "strings"
+)
+
+type Codec struct {
+ urls []string
+}
+
+func Constructor() Codec {
+ return Codec{[]string{}}
+}
+
+// Encodes a URL to a shortened URL.
+func (this *Codec) encode(longUrl string) string {
+ this.urls = append(this.urls, longUrl)
+ return "http://tinyurl.com/" + fmt.Sprintf("%v", len(this.urls)-1)
+}
+
+// Decodes a shortened URL to its original URL.
+func (this *Codec) decode(shortUrl string) string {
+ tmp := strings.Split(shortUrl, "/")
+ i, _ := strconv.Atoi(tmp[len(tmp)-1])
+ return this.urls[i]
+}
+
+/**
+ * Your Codec object will be instantiated and called as such:
+ * obj := Constructor();
+ * url := obj.encode(longUrl);
+ * ans := obj.decode(url);
+ */
diff --git a/leetcode/0535.Encode-and-Decode-TinyURL/535. Encode and Decode TinyURL_test.go b/leetcode/0535.Encode-and-Decode-TinyURL/535. Encode and Decode TinyURL_test.go
new file mode 100644
index 000000000..e3f10ae75
--- /dev/null
+++ b/leetcode/0535.Encode-and-Decode-TinyURL/535. Encode and Decode TinyURL_test.go
@@ -0,0 +1,15 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+func Test_Problem535(t *testing.T) {
+ obj := Constructor()
+ fmt.Printf("obj = %v\n", obj)
+ e := obj.encode("https://leetcode.com/problems/design-tinyurl")
+ fmt.Printf("obj encode = %v\n", e)
+ d := obj.decode(e)
+ fmt.Printf("obj decode = %v\n", d)
+}
diff --git a/leetcode/0535.Encode-and-Decode-TinyURL/README.md b/leetcode/0535.Encode-and-Decode-TinyURL/README.md
new file mode 100644
index 000000000..d7ae92b40
--- /dev/null
+++ b/leetcode/0535.Encode-and-Decode-TinyURL/README.md
@@ -0,0 +1,60 @@
+# [535. Encode and Decode TinyURL](https://leetcode.com/problems/encode-and-decode-tinyurl/)
+
+
+## 题目
+
+> Note: This is a companion problem to the System Design problem: Design TinyURL.
+
+TinyURL is a URL shortening service where you enter a URL such as `https://leetcode.com/problems/design-tinyurl` and it returns a short URL such as `http://tinyurl.com/4e9iAk`.
+
+Design the `encode` and `decode` methods for the TinyURL service. There is no restriction on how your encode/decode algorithm should work. You just need to ensure that a URL can be encoded to a tiny URL and the tiny URL can be decoded to the original URL.
+
+## 题目大意
+
+TinyURL是一种URL简化服务， 比如：当你输入一个URL [https://leetcode.com/problems/design-tinyurl](https://leetcode.com/problems/design-tinyurl) 时，它将返回一个简化的URL [http://tinyurl.com/4e9iAk](http://tinyurl.com/4e9iAk).
+
+要求：设计一个 TinyURL 的加密 encode 和解密 decode 的方法。你的加密和解密算法如何设计和运作是没有限制的，你只需要保证一个URL可以被加密成一个TinyURL，并且这个TinyURL可以用解密方法恢复成原本的URL。
+
+## 解题思路
+
+- 简单题。由于题目并无规定 `encode()` 算法，所以自由度非常高。最简单的做法是把原始 `URL` 存起来，并记录下存在字符串数组中的下标位置。`decode()` 的时候根据存储的下标还原原始的 `URL`。
+
+## 代码
+
+```go
+package leetcode
+
+import (
+ "fmt"
+ "strconv"
+ "strings"
+)
+
+type Codec struct {
+ urls []string
+}
+
+func Constructor() Codec {
+ return Codec{[]string{}}
+}
+
+// Encodes a URL to a shortened URL.
+func (this *Codec) encode(longUrl string) string {
+ this.urls = append(this.urls, longUrl)
+ return "http://tinyurl.com/" + fmt.Sprintf("%v", len(this.urls)-1)
+}
+
+// Decodes a shortened URL to its original URL.
+func (this *Codec) decode(shortUrl string) string {
+ tmp := strings.Split(shortUrl, "/")
+ i, _ := strconv.Atoi(tmp[len(tmp)-1])
+ return this.urls[i]
+}
+
+/**
+ * Your Codec object will be instantiated and called as such:
+ * obj := Constructor();
+ * url := obj.encode(longUrl);
+ * ans := obj.decode(url);
+ */
+```
\ No newline at end of file
diff --git a/leetcode/0538.Convert-BST-to-Greater-Tree/538. Convert BST to Greater Tree.go b/leetcode/0538.Convert-BST-to-Greater-Tree/538. Convert BST to Greater Tree.go
new file mode 100644
index 000000000..4a360519d
--- /dev/null
+++ b/leetcode/0538.Convert-BST-to-Greater-Tree/538. Convert BST to Greater Tree.go
@@ -0,0 +1,36 @@
+package leetcode
+
+import (
+ "github.com/halfrost/LeetCode-Go/structures"
+)
+
+// TreeNode define
+type TreeNode = structures.TreeNode
+
+/**
+ * Definition for a binary tree node.
+ * type TreeNode struct {
+ * Val int
+ * Left *TreeNode
+ * Right *TreeNode
+ * }
+ */
+
+func convertBST(root *TreeNode) *TreeNode {
+ if root == nil {
+ return root
+ }
+ sum := 0
+ dfs538(root, &sum)
+ return root
+}
+
+func dfs538(root *TreeNode, sum *int) {
+ if root == nil {
+ return
+ }
+ dfs538(root.Right, sum)
+ root.Val += *sum
+ *sum = root.Val
+ dfs538(root.Left, sum)
+}
diff --git a/leetcode/0538.Convert-BST-to-Greater-Tree/538. Convert BST to Greater Tree_test.go b/leetcode/0538.Convert-BST-to-Greater-Tree/538. Convert BST to Greater Tree_test.go
new file mode 100644
index 000000000..c42b422f1
--- /dev/null
+++ b/leetcode/0538.Convert-BST-to-Greater-Tree/538. Convert BST to Greater Tree_test.go
@@ -0,0 +1,76 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+
+ "github.com/halfrost/LeetCode-Go/structures"
+)
+
+type question538 struct {
+ para538
+ ans538
+}
+
+// para 是参数
+// one 代表第一个参数
+type para538 struct {
+ one []int
+}
+
+// ans 是答案
+// one 代表第一个答案
+type ans538 struct {
+ one []int
+}
+
+func Test_Problem538(t *testing.T) {
+
+ qs := []question538{
+
+ {
+ para538{[]int{3, 1, structures.NULL, 0, structures.NULL, -4, structures.NULL, structures.NULL, -2}},
+ ans538{[]int{3, 4, structures.NULL, 4, structures.NULL, -2, structures.NULL, structures.NULL, 2}},
+ },
+
+ {
+ para538{[]int{2, 1}},
+ ans538{[]int{2, 3}},
+ },
+
+ {
+ para538{[]int{}},
+ ans538{[]int{}},
+ },
+
+ {
+ para538{[]int{4, 1, 6, 0, 2, 5, 7, structures.NULL, structures.NULL, structures.NULL, 3, structures.NULL, structures.NULL, structures.NULL, 8}},
+ ans538{[]int{30, 36, 21, 36, 35, 26, 15, structures.NULL, structures.NULL, structures.NULL, 33, structures.NULL, structures.NULL, structures.NULL, 8}},
+ },
+
+ {
+ para538{[]int{0, structures.NULL, 1}},
+ ans538{[]int{1, structures.NULL, 1}},
+ },
+
+ {
+ para538{[]int{1, 0, 2}},
+ ans538{[]int{3, 3, 2}},
+ },
+
+ {
+ para538{[]int{3, 2, 4, 1}},
+ ans538{[]int{7, 9, 4, 10}},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 538------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans538, q.para538
+ fmt.Printf("【input】:%v ", p)
+ root := structures.Ints2TreeNode(p.one)
+ fmt.Printf("【output】:%v \n", structures.Tree2ints(convertBST(root)))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/0538.Convert-BST-to-Greater-Tree/README.md b/leetcode/0538.Convert-BST-to-Greater-Tree/README.md
new file mode 100644
index 000000000..bd56381a7
--- /dev/null
+++ b/leetcode/0538.Convert-BST-to-Greater-Tree/README.md
@@ -0,0 +1,106 @@
+# [538. Convert BST to Greater Tree](https://leetcode.com/problems/convert-bst-to-greater-tree/)
+
+## 题目
+
+Given the `root` of a Binary Search Tree (BST), convert it to a Greater Tree such that every key of the original BST is changed to the original key plus sum of all keys greater than the original key in BST.
+
+As a reminder, a *binary search tree* is a tree that satisfies these constraints:
+
+- The left subtree of a node contains only nodes with keys **less than** the node's key.
+- The right subtree of a node contains only nodes with keys **greater than** the node's key.
+- Both the left and right subtrees must also be binary search trees.
+
+**Note:** This question is the same as 1038: [https://leetcode.com/problems/binary-search-tree-to-greater-sum-tree/](https://leetcode.com/problems/binary-search-tree-to-greater-sum-tree/)
+
+**Example 1:**
+
+
+
+```
+Input: root = [4,1,6,0,2,5,7,null,null,null,3,null,null,null,8]
+Output: [30,36,21,36,35,26,15,null,null,null,33,null,null,null,8]
+```
+
+**Example 2:**
+
+```
+Input: root = [0,null,1]
+Output: [1,null,1]
+```
+
+**Example 3:**
+
+```
+Input: root = [1,0,2]
+Output: [3,3,2]
+```
+
+**Example 4:**
+
+```
+Input: root = [3,2,4,1]
+Output: [7,9,4,10]
+```
+
+**Constraints:**
+
+- The number of nodes in the tree is in the range `[0, 104]`.
+- `104 <= Node.val <= 104`
+- All the values in the tree are **unique**.
+- `root` is guaranteed to be a valid binary search tree.
+
+## 题目大意
+
+给出二叉 搜索 树的根节点，该树的节点值各不相同，请你将其转换为累加树（Greater Sum Tree），使每个节点 node 的新值等于原树中大于或等于 node.val 的值之和。
+
+提醒一下，二叉搜索树满足下列约束条件：
+
+- 节点的左子树仅包含键 小于 节点键的节点。
+- 节点的右子树仅包含键 大于 节点键的节点。
+- 左右子树也必须是二叉搜索树。
+
+## 解题思路
+
+- 根据二叉搜索树的有序性，想要将其转换为累加树，只需按照 右节点 - 根节点 - 左节点的顺序遍历，并累加和即可。
+- 此题同第 1038 题。
+
+## 代码
+
+```go
+package leetcode
+
+import (
+ "github.com/halfrost/LeetCode-Go/structures"
+)
+
+// TreeNode define
+type TreeNode = structures.TreeNode
+
+/**
+ * Definition for a binary tree node.
+ * type TreeNode struct {
+ * Val int
+ * Left *TreeNode
+ * Right *TreeNode
+ * }
+ */
+
+func convertBST(root *TreeNode) *TreeNode {
+ if root == nil {
+ return root
+ }
+ sum := 0
+ dfs538(root, &sum)
+ return root
+}
+
+func dfs538(root *TreeNode, sum *int) {
+ if root == nil {
+ return
+ }
+ dfs538(root.Right, sum)
+ root.Val += *sum
+ *sum = root.Val
+ dfs538(root.Left, sum)
+}
+```
\ No newline at end of file
diff --git a/leetcode/0540.Single-Element-in-a-Sorted-Array/540.Single Element in a Sorted Array.go b/leetcode/0540.Single-Element-in-a-Sorted-Array/540.Single Element in a Sorted Array.go
new file mode 100644
index 000000000..dc718044f
--- /dev/null
+++ b/leetcode/0540.Single-Element-in-a-Sorted-Array/540.Single Element in a Sorted Array.go
@@ -0,0 +1,22 @@
+package leetcode
+
+func singleNonDuplicate(nums []int) int {
+ left, right := 0, len(nums)-1
+ for left < right {
+ mid := (left + right) / 2
+ if mid%2 == 0 {
+ if nums[mid] == nums[mid+1] {
+ left = mid + 1
+ } else {
+ right = mid
+ }
+ } else {
+ if nums[mid] == nums[mid-1] {
+ left = mid + 1
+ } else {
+ right = mid
+ }
+ }
+ }
+ return nums[left]
+}
diff --git a/leetcode/0540.Single-Element-in-a-Sorted-Array/540.Single Element in a Sorted Array_test.go b/leetcode/0540.Single-Element-in-a-Sorted-Array/540.Single Element in a Sorted Array_test.go
new file mode 100644
index 000000000..77871f6b0
--- /dev/null
+++ b/leetcode/0540.Single-Element-in-a-Sorted-Array/540.Single Element in a Sorted Array_test.go
@@ -0,0 +1,46 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question540 struct {
+ para540
+ ans540
+}
+
+// para 是参数
+type para540 struct {
+ nums []int
+}
+
+// ans 是答案
+type ans540 struct {
+ ans int
+}
+
+func Test_Problem540(t *testing.T) {
+
+ qs := []question540{
+
+ {
+ para540{[]int{1, 1, 2, 3, 3, 4, 4, 8, 8}},
+ ans540{2},
+ },
+
+ {
+ para540{[]int{3, 3, 7, 7, 10, 11, 11}},
+ ans540{10},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 540------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans540, q.para540
+ fmt.Printf("【input】:%v ", p.nums)
+ fmt.Printf("【output】:%v \n", singleNonDuplicate(p.nums))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/0540.Single-Element-in-a-Sorted-Array/README.md b/leetcode/0540.Single-Element-in-a-Sorted-Array/README.md
new file mode 100644
index 000000000..e9a6e2cdf
--- /dev/null
+++ b/leetcode/0540.Single-Element-in-a-Sorted-Array/README.md
@@ -0,0 +1,64 @@
+# [540. Single Element in a Sorted Array](https://leetcode.com/problems/single-element-in-a-sorted-array/)
+
+## 题目
+
+You are given a sorted array consisting of only integers where every element appears exactly twice, except for one element which appears exactly once.
+
+Return the single element that appears only once.
+
+Your solution must run in O(log n) time and O(1) space.
+
+**Example 1:**
+
+ Input: nums = [1,1,2,3,3,4,4,8,8]
+ Output: 2
+
+**Example 2:**
+
+ Input: nums = [3,3,7,7,10,11,11]
+ Output: 10
+
+**Constraints:**
+
+- 1 <= nums.length <= 100000
+- 0 <= nums[i] <= 100000
+
+## 题目大意
+
+给你一个仅由整数组成的有序数组，其中每个元素都会出现两次，唯有一个数只会出现一次。
+
+请你找出并返回只出现一次的那个数。
+
+你设计的解决方案必须满足 O(log n) 时间复杂度和 O(1) 空间复杂度。
+
+## 解题思路
+
+ 假设下标idx是单独的数字,idx左边的偶数下标x有nums[x] == nums[x + 1],
+ idx右边的奇数下标y有nums[y] == nums[y + 1],可以根据此特性用二分查找idx对应的值
+
+## 代码
+
+```go
+package leetcode
+
+func singleNonDuplicate(nums []int) int {
+ left, right := 0, len(nums)-1
+ for left < right {
+ mid := (left + right) / 2
+ if mid%2 == 0 {
+ if nums[mid] == nums[mid+1] {
+ left = mid + 1
+ } else {
+ right = mid
+ }
+ } else {
+ if nums[mid] == nums[mid-1] {
+ left = mid + 1
+ } else {
+ right = mid
+ }
+ }
+ }
+ return nums[left]
+}
+```
diff --git a/leetcode/0543.Diameter-of-Binary-Tree/543. Diameter of Binary Tree.go b/leetcode/0543.Diameter-of-Binary-Tree/543. Diameter of Binary Tree.go
new file mode 100644
index 000000000..14041158f
--- /dev/null
+++ b/leetcode/0543.Diameter-of-Binary-Tree/543. Diameter of Binary Tree.go
@@ -0,0 +1,40 @@
+package leetcode
+
+import (
+ "github.com/halfrost/LeetCode-Go/structures"
+)
+
+// TreeNode define
+type TreeNode = structures.TreeNode
+
+/**
+ * Definition for a binary tree node.
+ * type TreeNode struct {
+ * Val int
+ * Left *TreeNode
+ * Right *TreeNode
+ * }
+ */
+
+func diameterOfBinaryTree(root *TreeNode) int {
+ result := 0
+ checkDiameter(root, &result)
+ return result
+}
+
+func checkDiameter(root *TreeNode, result *int) int {
+ if root == nil {
+ return 0
+ }
+ left := checkDiameter(root.Left, result)
+ right := checkDiameter(root.Right, result)
+ *result = max(*result, left+right)
+ return max(left, right) + 1
+}
+
+func max(a int, b int) int {
+ if a > b {
+ return a
+ }
+ return b
+}
diff --git a/leetcode/0543.Diameter-of-Binary-Tree/543. Diameter of Binary Tree_test.go b/leetcode/0543.Diameter-of-Binary-Tree/543. Diameter of Binary Tree_test.go
new file mode 100644
index 000000000..e88d3aa02
--- /dev/null
+++ b/leetcode/0543.Diameter-of-Binary-Tree/543. Diameter of Binary Tree_test.go
@@ -0,0 +1,56 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+
+ "github.com/halfrost/LeetCode-Go/structures"
+)
+
+type question543 struct {
+ para543
+ ans543
+}
+
+// para 是参数
+// one 代表第一个参数
+type para543 struct {
+ one []int
+}
+
+// ans 是答案
+// one 代表第一个答案
+type ans543 struct {
+ one int
+}
+
+func Test_Problem543(t *testing.T) {
+
+ qs := []question543{
+
+ {
+ para543{[]int{1, 2, 3, 4, 5}},
+ ans543{3},
+ },
+
+ {
+ para543{[]int{1, 2}},
+ ans543{1},
+ },
+
+ {
+ para543{[]int{4, -7, -3, structures.NULL, structures.NULL, -9, -3, 9, -7, -4, structures.NULL, 6, structures.NULL, -6, -6, structures.NULL, structures.NULL, 0, 6, 5, structures.NULL, 9, structures.NULL, structures.NULL, -1, -4, structures.NULL, structures.NULL, structures.NULL, -2}},
+ ans543{8},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 543------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans543, q.para543
+ fmt.Printf("【input】:%v ", p)
+ root := structures.Ints2TreeNode(p.one)
+ fmt.Printf("【output】:%v \n", diameterOfBinaryTree(root))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/0543.Diameter-of-Binary-Tree/README.md b/leetcode/0543.Diameter-of-Binary-Tree/README.md
new file mode 100644
index 000000000..78b5655e2
--- /dev/null
+++ b/leetcode/0543.Diameter-of-Binary-Tree/README.md
@@ -0,0 +1,87 @@
+# [543. Diameter of Binary Tree](https://leetcode.com/problems/diameter-of-binary-tree/)
+
+
+## 题目
+
+Given the `root` of a binary tree, return *the length of the **diameter** of the tree*.
+
+The **diameter** of a binary tree is the **length** of the longest path between any two nodes in a tree. This path may or may not pass through the `root`.
+
+The **length** of a path between two nodes is represented by the number of edges between them.
+
+**Example 1:**
+
+
+
+```
+Input: root = [1,2,3,4,5]
+Output: 3
+Explanation: 3 is the length of the path [4,2,1,3] or [5,2,1,3].
+
+```
+
+**Example 2:**
+
+```
+Input: root = [1,2]
+Output: 1
+
+```
+
+**Constraints:**
+
+- The number of nodes in the tree is in the range `[1, 104]`.
+- `100 <= Node.val <= 100`
+
+## 题目大意
+
+给定一棵二叉树，你需要计算它的直径长度。一棵二叉树的直径长度是任意两个结点路径长度中的最大值。这条路径可能穿过也可能不穿过根结点。
+
+## 解题思路
+
+- 简单题。遍历每个节点的左子树和右子树，累加从左子树到右子树的最大长度。遍历每个节点时，动态更新这个最大长度即可。
+
+## 代码
+
+```go
+package leetcode
+
+import (
+ "github.com/halfrost/LeetCode-Go/structures"
+)
+
+// TreeNode define
+type TreeNode = structures.TreeNode
+
+/**
+ * Definition for a binary tree node.
+ * type TreeNode struct {
+ * Val int
+ * Left *TreeNode
+ * Right *TreeNode
+ * }
+ */
+
+func diameterOfBinaryTree(root *TreeNode) int {
+ result := 0
+ checkDiameter(root, &result)
+ return result
+}
+
+func checkDiameter(root *TreeNode, result *int) int {
+ if root == nil {
+ return 0
+ }
+ left := checkDiameter(root.Left, result)
+ right := checkDiameter(root.Right, result)
+ *result = max(*result, left+right)
+ return max(left, right) + 1
+}
+
+func max(a int, b int) int {
+ if a > b {
+ return a
+ }
+ return b
+}
+```
\ No newline at end of file
diff --git a/leetcode/0547.Friend-Circles/README.md b/leetcode/0547.Friend-Circles/README.md
deleted file mode 100755
index 6cfe79b13..000000000
--- a/leetcode/0547.Friend-Circles/README.md
+++ /dev/null
@@ -1,54 +0,0 @@
-# [547. Friend Circles](https://leetcode.com/problems/friend-circles/)
-
-## 题目
-
-There are **N** students in a class. Some of them are friends, while some are not. Their friendship is transitive in nature. For example, if A is a **direct** friend of B, and B is a **direct**friend of C, then A is an **indirect** friend of C. And we defined a friend circle is a group of students who are direct or indirect friends.
-
-Given a **N*N** matrix **M** representing the friend relationship between students in the class. If M[i][j] = 1, then the ith and jth students are **direct** friends with each other, otherwise not. And you have to output the total number of friend circles among all the students.
-
-**Example 1:**
-
- Input:
- [[1,1,0],
- [1,1,0],
- [0,0,1]]
- Output: 2
- Explanation:The 0th and 1st students are direct friends, so they are in a friend circle.
- The 2nd student himself is in a friend circle. So return 2.
-
-**Example 2:**
-
- Input:
- [[1,1,0],
- [1,1,1],
- [0,1,1]]
- Output: 1
- Explanation:The 0th and 1st students are direct friends, the 1st and 2nd students are direct friends,
- so the 0th and 2nd students are indirect friends. All of them are in the same friend circle, so return 1.
-
-**Note:**
-
-1. N is in range [1,200].
-2. M[i][i] = 1 for all students.
-3. If M[i][j] = 1, then M[j][i] = 1.
-
-
-## 题目大意
-
-班上有 N 名学生。其中有些人是朋友，有些则不是。他们的友谊具有是传递性。如果已知 A 是 B 的朋友，B 是 C 的朋友，那么我们可以认为 A 也是 C 的朋友。所谓的朋友圈，是指所有朋友的集合。
-
-给定一个 N * N 的矩阵 M，表示班级中学生之间的朋友关系。如果 M[i][j] = 1，表示已知第 i 个和 j 个学生互为朋友关系，否则为不知道。你必须输出所有学生中的已知的朋友圈总数。
-
-
-注意：
-
-- N 在[1,200]的范围内。
-- 对于所有学生，有M[i][i] = 1。
-- 如果有 M[i][j] = 1，则有 M[j][i] = 1。
-
-
-## 解题思路
-
-
-- 给出一个二维矩阵，矩阵中的行列表示的是两个人之间是否是朋友关系，如果是 1，代表两个人是朋友关系。由于自己和自肯定朋友关系，所以对角线上都是 1，并且矩阵也是关于从左往右下的这条对角线对称。
-- 这题有 2 种解法，第一种解法是并查集，依次扫描矩阵，如果两个人认识，并且 root 并不相等就执行 union 操作。扫完所有矩阵，最后数一下还有几个不同的 root 就是最终答案。第二种解法是 DFS 或者 BFS。利用 FloodFill 的想法去染色，每次染色一次，计数器加一。最终扫完整个矩阵，计数器的结果就是最终结果。
diff --git a/leetcode/0547.Friend-Circles/547. Friend Circles.go b/leetcode/0547.Number-of-Provinces/547. Number of Provinces.go
similarity index 100%
rename from leetcode/0547.Friend-Circles/547. Friend Circles.go
rename to leetcode/0547.Number-of-Provinces/547. Number of Provinces.go
diff --git a/leetcode/0547.Friend-Circles/547. Friend Circles_test.go b/leetcode/0547.Number-of-Provinces/547. Number of Provinces_test.go
similarity index 100%
rename from leetcode/0547.Friend-Circles/547. Friend Circles_test.go
rename to leetcode/0547.Number-of-Provinces/547. Number of Provinces_test.go
diff --git a/leetcode/0547.Number-of-Provinces/README.md b/leetcode/0547.Number-of-Provinces/README.md
new file mode 100755
index 000000000..0dafa9ba9
--- /dev/null
+++ b/leetcode/0547.Number-of-Provinces/README.md
@@ -0,0 +1,54 @@
+# [547. Number of Provinces](https://leetcode.com/problems/number-of-provinces/)
+
+## 题目
+
+There are **N** students in a class. Some of them are friends, while some are not. Their friendship is transitive in nature. For example, if A is a **direct** friend of B, and B is a **direct**friend of C, then A is an **indirect** friend of C. And we defined a friend circle is a group of students who are direct or indirect friends.
+
+Given a **N*N** matrix **M** representing the friend relationship between students in the class. If M[i][j] = 1, then the ith and jth students are **direct** friends with each other, otherwise not. And you have to output the total number of friend circles among all the students.
+
+**Example 1:**
+
+ Input:
+ [[1,1,0],
+ [1,1,0],
+ [0,0,1]]
+ Output: 2
+ Explanation:The 0th and 1st students are direct friends, so they are in a friend circle.
+ The 2nd student himself is in a friend circle. So return 2.
+
+**Example 2:**
+
+ Input:
+ [[1,1,0],
+ [1,1,1],
+ [0,1,1]]
+ Output: 1
+ Explanation:The 0th and 1st students are direct friends, the 1st and 2nd students are direct friends,
+ so the 0th and 2nd students are indirect friends. All of them are in the same friend circle, so return 1.
+
+**Note:**
+
+1. N is in range [1,200].
+2. M[i][i] = 1 for all students.
+3. If M[i][j] = 1, then M[j][i] = 1.
+
+
+## 题目大意
+
+班上有 N 名学生。其中有些人是朋友，有些则不是。他们的友谊具有是传递性。如果已知 A 是 B 的朋友，B 是 C 的朋友，那么我们可以认为 A 也是 C 的朋友。所谓的朋友圈，是指所有朋友的集合。
+
+给定一个 N * N 的矩阵 M，表示班级中学生之间的朋友关系。如果 M[i][j] = 1，表示已知第 i 个和 j 个学生互为朋友关系，否则为不知道。你必须输出所有学生中的已知的朋友圈总数。
+
+
+注意：
+
+- N 在[1,200]的范围内。
+- 对于所有学生，有M[i][i] = 1。
+- 如果有 M[i][j] = 1，则有 M[j][i] = 1。
+
+
+## 解题思路
+
+
+- 给出一个二维矩阵，矩阵中的行列表示的是两个人之间是否是朋友关系，如果是 1，代表两个人是朋友关系。由于自己和自肯定朋友关系，所以对角线上都是 1，并且矩阵也是关于从左往右下的这条对角线对称。
+- 这题有 2 种解法，第一种解法是并查集，依次扫描矩阵，如果两个人认识，并且 root 并不相等就执行 union 操作。扫完所有矩阵，最后数一下还有几个不同的 root 就是最终答案。第二种解法是 DFS 或者 BFS。利用 FloodFill 的想法去染色，每次染色一次，计数器加一。最终扫完整个矩阵，计数器的结果就是最终结果。
diff --git a/leetcode/0551.Student-Attendance-Record-I/551.Student Attendance Record I.go b/leetcode/0551.Student-Attendance-Record-I/551.Student Attendance Record I.go
new file mode 100644
index 000000000..a47630c22
--- /dev/null
+++ b/leetcode/0551.Student-Attendance-Record-I/551.Student Attendance Record I.go
@@ -0,0 +1,22 @@
+package leetcode
+
+func checkRecord(s string) bool {
+ numsA, maxL, numsL := 0, 0, 0
+ for _, v := range s {
+ if v == 'L' {
+ numsL++
+ } else {
+ if numsL > maxL {
+ maxL = numsL
+ }
+ numsL = 0
+ if v == 'A' {
+ numsA++
+ }
+ }
+ }
+ if numsL > maxL {
+ maxL = numsL
+ }
+ return numsA < 2 && maxL < 3
+}
diff --git a/leetcode/0551.Student-Attendance-Record-I/551.Student Attendance Record I_test.go b/leetcode/0551.Student-Attendance-Record-I/551.Student Attendance Record I_test.go
new file mode 100644
index 000000000..cc9ace7a5
--- /dev/null
+++ b/leetcode/0551.Student-Attendance-Record-I/551.Student Attendance Record I_test.go
@@ -0,0 +1,45 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question551 struct {
+ para551
+ ans551
+}
+
+// para 是参数
+type para551 struct {
+ s string
+}
+
+// ans 是答案
+type ans551 struct {
+ ans bool
+}
+
+func Test_Problem551(t *testing.T) {
+
+ qs := []question551{
+
+ {
+ para551{"PPALLP"},
+ ans551{true},
+ },
+
+ {
+ para551{"PPALLL"},
+ ans551{false},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 551------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans551, q.para551
+ fmt.Printf("【input】:%v 【output】:%v \n", p, checkRecord(p.s))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/0551.Student-Attendance-Record-I/README.md b/leetcode/0551.Student-Attendance-Record-I/README.md
new file mode 100644
index 000000000..fe8a01616
--- /dev/null
+++ b/leetcode/0551.Student-Attendance-Record-I/README.md
@@ -0,0 +1,86 @@
+# [551. Student Attendance Record I](https://leetcode.com/problems/student-attendance-record-i/)
+
+## 题目
+
+You are given a string `s` representing an attendance record for a student where each character signifies whether the student was absent, late, or present on that day. The record only contains the following three characters:
+
+- `'A'`: Absent.
+- `'L'`: Late.
+- `'P'`: Present.
+
+The student is eligible for an attendance award if they meet **both** of the following criteria:
+
+- The student was absent (`'A'`) for **strictly** fewer than 2 days **total**.
+- The student was **never** late (`'L'`) for 3 or more **consecutive** days.
+
+Return `true` *if the student is eligible for an attendance award, or* `false` *otherwise*.
+
+**Example 1:**
+
+```
+Input: s = "PPALLP"
+Output: true
+Explanation: The student has fewer than 2 absences and was never late 3 or more consecutive days.
+
+```
+
+**Example 2:**
+
+```
+Input: s = "PPALLL"
+Output: false
+Explanation: The student was late 3 consecutive days in the last 3 days, so is not eligible for the award.
+
+```
+
+**Constraints:**
+
+- `1 <= s.length <= 1000`
+- `s[i]` is either `'A'`, `'L'`, or `'P'`.
+
+## 题目大意
+
+给你一个字符串 s 表示一个学生的出勤记录，其中的每个字符用来标记当天的出勤情况（缺勤、迟到、到场）。记录中只含下面三种字符：
+
+- 'A'：Absent，缺勤
+- 'L'：Late，迟到
+- 'P'：Present，到场
+
+如果学生能够 同时 满足下面两个条件，则可以获得出勤奖励：
+
+- 按 总出勤 计，学生缺勤（'A'）严格 少于两天。
+- 学生 不会 存在 连续 3 天或 连续 3 天以上的迟到（'L'）记录。
+
+如果学生可以获得出勤奖励，返回 true ；否则，返回 false 。
+
+## 解题思路
+
+- 遍历字符串 s 求出 'A' 的总数量和连续 'L' 的最大数量。
+- 比较 'A' 的数量是否小于 2 并且 'L' 的连续最大数量是否小于 3。
+
+## 代码
+
+```go
+package leetcode
+
+func checkRecord(s string) bool {
+ numsA, maxL, numsL := 0, 0, 0
+ for _, v := range s {
+ if v == 'L' {
+ numsL++
+ } else {
+ if numsL > maxL {
+ maxL = numsL
+ }
+ numsL = 0
+ if v == 'A' {
+ numsA++
+ }
+ }
+ }
+ if numsL > maxL {
+ maxL = numsL
+ }
+ return numsA < 2 && maxL < 3
+}
+```
\ No newline at end of file
diff --git a/leetcode/0554.Brick-Wall/554. Brick Wall.go b/leetcode/0554.Brick-Wall/554. Brick Wall.go
new file mode 100644
index 000000000..022f22010
--- /dev/null
+++ b/leetcode/0554.Brick-Wall/554. Brick Wall.go
@@ -0,0 +1,19 @@
+package leetcode
+
+func leastBricks(wall [][]int) int {
+ m := make(map[int]int)
+ for _, row := range wall {
+ sum := 0
+ for i := 0; i < len(row)-1; i++ {
+ sum += row[i]
+ m[sum]++
+ }
+ }
+ max := 0
+ for _, v := range m {
+ if v > max {
+ max = v
+ }
+ }
+ return len(wall) - max
+}
diff --git a/leetcode/0554.Brick-Wall/554. Brick Wall_test.go b/leetcode/0554.Brick-Wall/554. Brick Wall_test.go
new file mode 100644
index 000000000..00dc2d53c
--- /dev/null
+++ b/leetcode/0554.Brick-Wall/554. Brick Wall_test.go
@@ -0,0 +1,57 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question554 struct {
+ para554
+ ans554
+}
+
+// para 是参数
+// one 代表第一个参数
+type para554 struct {
+ wall [][]int
+}
+
+// ans 是答案
+// one 代表第一个答案
+type ans554 struct {
+ one int
+}
+
+func Test_Problem554(t *testing.T) {
+
+ qs := []question554{
+
+ {
+ para554{[][]int{{1, 2, 2, 1}, {3, 1, 2}, {1, 3, 2}, {2, 4}, {3, 1, 2}, {1, 3, 1, 1}}},
+ ans554{2},
+ },
+
+ {
+ para554{[][]int{{1}, {1}, {1}}},
+ ans554{3},
+ },
+
+ {
+ para554{[][]int{{1, 1, 0}, {1, 1, 0}, {0, 0, 1}}},
+ ans554{1},
+ },
+
+ {
+ para554{[][]int{{1, 1, 0}, {1, 1, 1}, {0, 1, 1}}},
+ ans554{0},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 554------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans554, q.para554
+ fmt.Printf("【input】:%v 【output】:%v\n", p, leastBricks(p.wall))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/0554.Brick-Wall/README.md b/leetcode/0554.Brick-Wall/README.md
new file mode 100644
index 000000000..0a16d12b8
--- /dev/null
+++ b/leetcode/0554.Brick-Wall/README.md
@@ -0,0 +1,68 @@
+# [554. Brick Wall](https://leetcode.com/problems/brick-wall/)
+
+## 题目
+
+There is a rectangular brick wall in front of you with `n` rows of bricks. The `ith` row has some number of bricks each of the same height (i.e., one unit) but they can be of different widths. The total width of each row is the same.
+
+Draw a vertical line from the top to the bottom and cross the least bricks. If your line goes through the edge of a brick, then the brick is not considered as crossed. You cannot draw a line just along one of the two vertical edges of the wall, in which case the line will obviously cross no bricks.
+
+Given the 2D array `wall` that contains the information about the wall, return *the minimum number of crossed bricks after drawing such a vertical line*.
+
+**Example 1:**
+
+
+
+```
+Input: wall = [[1,2,2,1],[3,1,2],[1,3,2],[2,4],[3,1,2],[1,3,1,1]]
+Output: 2
+
+```
+
+**Example 2:**
+
+```
+Input: wall = [[1],[1],[1]]
+Output: 3
+
+```
+
+**Constraints:**
+
+- `n == wall.length`
+- `1 <= n <= 10^4`
+- `1 <= wall[i].length <= 10^4`
+- `1 <= sum(wall[i].length) <= 2 * 10^4`
+- `sum(wall[i])` is the same for each row `i`.
+- `1 <= wall[i][j] <= 2^31 - 1`
+
+## 题目大意
+
+你的面前有一堵矩形的、由 n 行砖块组成的砖墙。这些砖块高度相同（也就是一个单位高）但是宽度不同。每一行砖块的宽度之和应该相等。你现在要画一条 自顶向下 的、穿过 最少 砖块的垂线。如果你画的线只是从砖块的边缘经过，就不算穿过这块砖。你不能沿着墙的两个垂直边缘之一画线，这样显然是没有穿过一块砖的。给你一个二维数组 wall ，该数组包含这堵墙的相关信息。其中，wall[i] 是一个代表从左至右每块砖的宽度的数组。你需要找出怎样画才能使这条线 穿过的砖块数量最少 ，并且返回 穿过的砖块数量 。
+
+## 解题思路
+
+- 既然穿过砖块中缝不算穿过砖块，那么穿过最少砖块数量一定是穿过很多中缝。按行遍历每一行的砖块，累加每行砖块宽度，将每行砖块“缝”的坐标存在 map 中。最后取出 map 中出现频次最高的缝，即为铅垂线要穿过的地方。墙高减去缝出现的频次，剩下的即为穿过砖块的数量。
+
+## 代码
+
+```go
+package leetcode
+
+func leastBricks(wall [][]int) int {
+ m := make(map[int]int)
+ for _, row := range wall {
+ sum := 0
+ for i := 0; i < len(row)-1; i++ {
+ sum += row[i]
+ m[sum]++
+ }
+ }
+ max := 0
+ for _, v := range m {
+ if v > max {
+ max = v
+ }
+ }
+ return len(wall) - max
+}
+```
\ No newline at end of file
diff --git a/leetcode/0559.Maximum-Depth-of-N-ary-Tree/559.Maximum Depth of N-ary Tree.go b/leetcode/0559.Maximum-Depth-of-N-ary-Tree/559.Maximum Depth of N-ary Tree.go
new file mode 100644
index 000000000..30fbc9439
--- /dev/null
+++ b/leetcode/0559.Maximum-Depth-of-N-ary-Tree/559.Maximum Depth of N-ary Tree.go
@@ -0,0 +1,32 @@
+package leetcode
+
+type Node struct {
+ Val int
+ Children []*Node
+}
+
+func maxDepth(root *Node) int {
+ if root == nil {
+ return 0
+ }
+ return 1 + bfs(root)
+}
+
+func bfs(root *Node) int {
+ var q []*Node
+ var depth int
+ q = append(q, root.Children...)
+ for len(q) != 0 {
+ depth++
+ length := len(q)
+ for length != 0 {
+ ele := q[0]
+ q = q[1:]
+ length--
+ if ele != nil && len(ele.Children) != 0 {
+ q = append(q, ele.Children...)
+ }
+ }
+ }
+ return depth
+}
diff --git a/leetcode/0559.Maximum-Depth-of-N-ary-Tree/559.Maximum Depth of N-ary Tree_test.go b/leetcode/0559.Maximum-Depth-of-N-ary-Tree/559.Maximum Depth of N-ary Tree_test.go
new file mode 100644
index 000000000..90da19b30
--- /dev/null
+++ b/leetcode/0559.Maximum-Depth-of-N-ary-Tree/559.Maximum Depth of N-ary Tree_test.go
@@ -0,0 +1,60 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question559 struct {
+ para559
+ ans559
+}
+
+// para 是参数
+type para559 struct {
+ root *Node
+}
+
+// ans 是答案
+type ans559 struct {
+ ans int
+}
+
+func Test_Problem559(t *testing.T) {
+
+ qs := []question559{
+
+ {
+ para559{&Node{
+ Val: 1,
+ Children: []*Node{
+ {Val: 3, Children: []*Node{{Val: 5, Children: nil}, {Val: 6, Children: nil}}},
+ {Val: 2, Children: nil},
+ {Val: 4, Children: nil},
+ },
+ }},
+ ans559{3},
+ },
+
+ {
+ para559{&Node{
+ Val: 1,
+ Children: []*Node{
+ {Val: 2, Children: nil},
+ {Val: 3, Children: []*Node{{Val: 6, Children: nil}, {Val: 7, Children: []*Node{{Val: 11, Children: []*Node{{Val: 14, Children: nil}}}}}}},
+ {Val: 4, Children: []*Node{{Val: 8, Children: []*Node{{Val: 12, Children: nil}}}}},
+ {Val: 5, Children: []*Node{{Val: 9, Children: []*Node{{Val: 13, Children: nil}}}, {Val: 10, Children: nil}}},
+ },
+ }},
+ ans559{5},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 559------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans559, q.para559
+ fmt.Printf("【input】:%v 【output】:%v\n", p, maxDepth(p.root))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/0559.Maximum-Depth-of-N-ary-Tree/README.md b/leetcode/0559.Maximum-Depth-of-N-ary-Tree/README.md
new file mode 100644
index 000000000..9cb575096
--- /dev/null
+++ b/leetcode/0559.Maximum-Depth-of-N-ary-Tree/README.md
@@ -0,0 +1,78 @@
+# [559. Maximum Depth of N-ary Tree](https://leetcode.com/problems/maximum-depth-of-n-ary-tree/)
+
+## 题目
+
+Given a n-ary tree, find its maximum depth.
+
+The maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf node.
+
+Nary-Tree input serialization is represented in their level order traversal, each group of children is separated by the null value (See examples).
+
+**Example 1**:
+
+
+
+ Input: root = [1,null,3,2,4,null,5,6]
+ Output: 3
+
+**Example 2**:
+
+
+
+ Input: root = [1,null,2,3,4,5,null,null,6,7,null,8,null,9,10,null,null,11,null,12,null,13,null,null,14]
+ Output: 5
+
+**Constraints:**
+
+- The total number of nodes is in the range [0, 10000].
+- The depth of the n-ary tree is less than or equal to 1000.
+
+## 题目大意
+
+给定一个 N 叉树，找到其最大深度。
+
+最大深度是指从根节点到最远叶子节点的最长路径上的节点总数。
+
+N 叉树输入按层序遍历序列化表示，每组子节点由空值分隔（请参见示例）。
+
+## 解题思路
+
+- 使用广度优先遍历
+
+## 代码
+
+```go
+
+package leetcode
+
+type Node struct {
+ Val int
+ Children []*Node
+}
+
+func maxDepth(root *Node) int {
+ if root == nil {
+ return 0
+ }
+ return 1 + bfs(root)
+}
+
+func bfs(root *Node) int {
+ var q []*Node
+ var depth int
+ q = append(q, root.Children...)
+ for len(q) != 0 {
+ depth++
+ length := len(q)
+ for length != 0 {
+ ele := q[0]
+ q = q[1:]
+ length--
+ if ele != nil && len(ele.Children) != 0 {
+ q = append(q, ele.Children...)
+ }
+ }
+ }
+ return depth
+}
+```
\ No newline at end of file
diff --git a/leetcode/0560.Subarray-Sum-Equals-K/560. Subarray Sum Equals K.go b/leetcode/0560.Subarray-Sum-Equals-K/560. Subarray Sum Equals K.go
new file mode 100644
index 000000000..0ca17f3a5
--- /dev/null
+++ b/leetcode/0560.Subarray-Sum-Equals-K/560. Subarray Sum Equals K.go
@@ -0,0 +1,15 @@
+package leetcode
+
+func subarraySum(nums []int, k int) int {
+ count, pre := 0, 0
+ m := map[int]int{}
+ m[0] = 1
+ for i := 0; i < len(nums); i++ {
+ pre += nums[i]
+ if _, ok := m[pre-k]; ok {
+ count += m[pre-k]
+ }
+ m[pre] += 1
+ }
+ return count
+}
diff --git a/leetcode/0560.Subarray-Sum-Equals-K/560. Subarray Sum Equals K_test.go b/leetcode/0560.Subarray-Sum-Equals-K/560. Subarray Sum Equals K_test.go
new file mode 100644
index 000000000..e9edf9557
--- /dev/null
+++ b/leetcode/0560.Subarray-Sum-Equals-K/560. Subarray Sum Equals K_test.go
@@ -0,0 +1,63 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question560 struct {
+ para560
+ ans560
+}
+
+// para 是参数
+// one 代表第一个参数
+type para560 struct {
+ nums []int
+ k int
+}
+
+// ans 是答案
+// one 代表第一个答案
+type ans560 struct {
+ one int
+}
+
+func Test_Problem560(t *testing.T) {
+
+ qs := []question560{
+
+ {
+ para560{[]int{1, 1, 1}, 2},
+ ans560{2},
+ },
+
+ {
+ para560{[]int{1, 2, 3}, 3},
+ ans560{2},
+ },
+
+ {
+ para560{[]int{1}, 0},
+ ans560{0},
+ },
+
+ {
+ para560{[]int{-1, -1, 1}, 0},
+ ans560{1},
+ },
+
+ {
+ para560{[]int{1, -1, 0}, 0},
+ ans560{3},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 560------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans560, q.para560
+ fmt.Printf("【input】:%v 【output】:%v\n", p, subarraySum(p.nums, p.k))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/0560.Subarray-Sum-Equals-K/README.md b/leetcode/0560.Subarray-Sum-Equals-K/README.md
new file mode 100644
index 000000000..13b588cca
--- /dev/null
+++ b/leetcode/0560.Subarray-Sum-Equals-K/README.md
@@ -0,0 +1,58 @@
+# [560. Subarray Sum Equals K](https://leetcode.com/problems/subarray-sum-equals-k/)
+
+
+## 题目
+
+Given an array of integers `nums` and an integer `k`, return *the total number of continuous subarrays whose sum equals to `k`*.
+
+**Example 1:**
+
+```
+Input: nums = [1,1,1], k = 2
+Output: 2
+
+```
+
+**Example 2:**
+
+```
+Input: nums = [1,2,3], k = 3
+Output: 2
+
+```
+
+**Constraints:**
+
+- `1 <= nums.length <= 2 * 104`
+- `-1000 <= nums[i] <= 1000`
+- `-10^7 <= k <= 10^7`
+
+## 题目大意
+
+给你一个整数数组 `nums` 和一个整数 `k` ，请你统计并返回该数组中和为 `k` ****的连续子数组的个数。
+
+## 解题思路
+
+- 此题不能使用滑动窗口来解。因为 `nums[i]` 可能为负数。
+- 前缀和的思路可以解答此题，但是时间复杂度有点高了，`O(n^2)`。考虑优化时间复杂度。
+- 题目要求找到连续区间和为 `k` 的子区间总数，即区间 `[i,j]` 内的和为 K ⇒ `prefixSum[j] - prefixSum[i-1] == k`。所以 `prefixSum[j] == k - prefixSum[i-1]` 。这样转换以后，题目就转换成类似 A + B = K 的问题了。LeetCode 第一题的优化思路拿来用。用 map 存储累加过的结果。如此优化以后，时间复杂度 `O(n)`。
+
+## 代码
+
+```go
+package leetcode
+
+func subarraySum(nums []int, k int) int {
+ count, pre := 0, 0
+ m := map[int]int{}
+ m[0] = 1
+ for i := 0; i < len(nums); i++ {
+ pre += nums[i]
+ if _, ok := m[pre-k]; ok {
+ count += m[pre-k]
+ }
+ m[pre] += 1
+ }
+ return count
+}
+```
\ No newline at end of file
diff --git a/leetcode/0561.Array-Partition-I/README.md b/leetcode/0561.Array-Partition-I/README.md
deleted file mode 100644
index d72ea633d..000000000
--- a/leetcode/0561.Array-Partition-I/README.md
+++ /dev/null
@@ -1,58 +0,0 @@
-# [561. Array Partition I](https://leetcode.com/problems/array-partition-i/)
-
-
-## 题目
-
-Given an array of **2n** integers, your task is to group these integers into **n** pairs of integer, say (a1, b1), (a2, b2), ..., (an, bn) which makes sum of min(ai, bi) for all i from 1 to n as large as possible.
-
-**Example 1**:
-
-```
-Input: [1,4,3,2]
-
-Output: 4
-Explanation: n is 2, and the maximum sum of pairs is 4 = min(1, 2) + min(3, 4).
-```
-
-**Note**:
-
-1. **n** is a positive integer, which is in the range of [1, 10000].
-2. All the integers in the array will be in the range of [-10000, 10000].
-
-## 题目大意
-
-给定长度为 2n 的数组, 你的任务是将这些数分成 n 对, 例如 (a1, b1), (a2, b2), ..., (an, bn) ，使得从1 到 n 的 min(ai, bi) 总和最大。
-
-
-## 解题思路
-
-- 给定一个 2n 个数组，要求把它们分为 n 组一行，求出各组最小值的总和的最大值。
-- 由于题目给的数据范围不大，[-10000, 10000]，所以我们可以考虑用一个哈希表数组，里面存储 i - 10000 元素的频次，偏移量是 10000。这个哈希表能按递增的顺序访问数组，这样可以减少排序的耗时。题目要求求出分组以后求和的最大值，那么所有偏小的元素尽量都安排在一组里面，这样取 min 以后，对最大和影响不大。例如，(1 , 1) 这样安排在一起，min 以后就是 1 。但是如果把相差很大的两个元素安排到一起，那么较大的那个元素就“牺牲”了。例如，(1 , 10000)，取 min 以后就是 1，于是 10000 就“牺牲”了。所以需要优先考虑较小值。
-- 较小值出现的频次可能是奇数也可能是偶数。如果是偶数，那比较简单，把它们俩俩安排在一起就可以了。如果是奇数，那么它会落单一次，落单的那个需要和距离它最近的一个元素进行配对，这样对最终的和影响最小。较小值如果是奇数，那么就会影响后面元素的选择，后面元素如果是偶数，由于需要一个元素和前面的较小值配对，所以它剩下的又是奇数个。这个影响会依次传递到后面。所以用一个 flag 标记，如果当前集合中有剩余元素将被再次考虑，则此标志设置为 1。在从下一组中选择元素时，会考虑已考虑的相同额外元素。
-- 最后扫描过程中动态的维护 sum 值就可以了。
-
-## 代码
-
-```go
-
-package leetcode
-
-func arrayPairSum(nums []int) int {
- array := [20001]int{}
- for i := 0; i < len(nums); i++ {
- array[nums[i]+10000]++
- }
- flag, sum := true, 0
- for i := 0; i < len(array); i++ {
- for array[i] > 0 {
- if flag {
- sum = sum + i - 10000
- }
- flag = !flag
- array[i]--
- }
- }
- return sum
-}
-
-```
\ No newline at end of file
diff --git a/leetcode/0561.Array-Partition-I/561. Array Partition I.go b/leetcode/0561.Array-Partition/561. Array Partition.go
similarity index 100%
rename from leetcode/0561.Array-Partition-I/561. Array Partition I.go
rename to leetcode/0561.Array-Partition/561. Array Partition.go
diff --git a/leetcode/0561.Array-Partition-I/561. Array Partition I_test.go b/leetcode/0561.Array-Partition/561. Array Partition_test.go
similarity index 100%
rename from leetcode/0561.Array-Partition-I/561. Array Partition I_test.go
rename to leetcode/0561.Array-Partition/561. Array Partition_test.go
diff --git a/leetcode/0561.Array-Partition/README.md b/leetcode/0561.Array-Partition/README.md
new file mode 100644
index 000000000..244bec8c9
--- /dev/null
+++ b/leetcode/0561.Array-Partition/README.md
@@ -0,0 +1,58 @@
+# [561. Array Partition](https://leetcode.com/problems/array-partition/)
+
+
+## 题目
+
+Given an array of **2n** integers, your task is to group these integers into **n** pairs of integer, say (a1, b1), (a2, b2), ..., (an, bn) which makes sum of min(ai, bi) for all i from 1 to n as large as possible.
+
+**Example 1**:
+
+```
+Input: [1,4,3,2]
+
+Output: 4
+Explanation: n is 2, and the maximum sum of pairs is 4 = min(1, 2) + min(3, 4).
+```
+
+**Note**:
+
+1. **n** is a positive integer, which is in the range of [1, 10000].
+2. All the integers in the array will be in the range of [-10000, 10000].
+
+## 题目大意
+
+给定长度为 2n 的数组, 你的任务是将这些数分成 n 对, 例如 (a1, b1), (a2, b2), ..., (an, bn) ，使得从1 到 n 的 min(ai, bi) 总和最大。
+
+
+## 解题思路
+
+- 给定一个 2n 个数组，要求把它们分为 n 组一行，求出各组最小值的总和的最大值。
+- 由于题目给的数据范围不大，[-10000, 10000]，所以我们可以考虑用一个哈希表数组，里面存储 i - 10000 元素的频次，偏移量是 10000。这个哈希表能按递增的顺序访问数组，这样可以减少排序的耗时。题目要求求出分组以后求和的最大值，那么所有偏小的元素尽量都安排在一组里面，这样取 min 以后，对最大和影响不大。例如，(1 , 1) 这样安排在一起，min 以后就是 1 。但是如果把相差很大的两个元素安排到一起，那么较大的那个元素就“牺牲”了。例如，(1 , 10000)，取 min 以后就是 1，于是 10000 就“牺牲”了。所以需要优先考虑较小值。
+- 较小值出现的频次可能是奇数也可能是偶数。如果是偶数，那比较简单，把它们俩俩安排在一起就可以了。如果是奇数，那么它会落单一次，落单的那个需要和距离它最近的一个元素进行配对，这样对最终的和影响最小。较小值如果是奇数，那么就会影响后面元素的选择，后面元素如果是偶数，由于需要一个元素和前面的较小值配对，所以它剩下的又是奇数个。这个影响会依次传递到后面。所以用一个 flag 标记，如果当前集合中有剩余元素将被再次考虑，则此标志设置为 1。在从下一组中选择元素时，会考虑已考虑的相同额外元素。
+- 最后扫描过程中动态的维护 sum 值就可以了。
+
+## 代码
+
+```go
+
+package leetcode
+
+func arrayPairSum(nums []int) int {
+ array := [20001]int{}
+ for i := 0; i < len(nums); i++ {
+ array[nums[i]+10000]++
+ }
+ flag, sum := true, 0
+ for i := 0; i < len(array); i++ {
+ for array[i] > 0 {
+ if flag {
+ sum = sum + i - 10000
+ }
+ flag = !flag
+ array[i]--
+ }
+ }
+ return sum
+}
+
+```
\ No newline at end of file
diff --git a/leetcode/0563.Binary-Tree-Tilt/563. Binary Tree Tilt.go b/leetcode/0563.Binary-Tree-Tilt/563. Binary Tree Tilt.go
index 74aa00974..96127e720 100644
--- a/leetcode/0563.Binary-Tree-Tilt/563. Binary Tree Tilt.go
+++ b/leetcode/0563.Binary-Tree-Tilt/563. Binary Tree Tilt.go
@@ -1,8 +1,8 @@
package leetcode
-import "math"
-
import (
+ "math"
+
"github.com/halfrost/LeetCode-Go/structures"
)
diff --git a/leetcode/0567.Permutation-in-String/README.md b/leetcode/0567.Permutation-in-String/README.md
index bcbccf293..526851a24 100644
--- a/leetcode/0567.Permutation-in-String/README.md
+++ b/leetcode/0567.Permutation-in-String/README.md
@@ -28,7 +28,7 @@ Note:
## 题目大意
-在一个字符串重寻找子串出现的位置。子串可以是 Anagrams 形式存在的。Anagrams 是一个字符串任意字符的全排列组合。
+在一个字符串中寻找子串出现的位置。子串可以是 Anagrams 形式存在的。Anagrams 是一个字符串任意字符的全排列组合。
## 解题思路
diff --git a/leetcode/0576.Out-of-Boundary-Paths/576. Out of Boundary Paths.go b/leetcode/0576.Out-of-Boundary-Paths/576. Out of Boundary Paths.go
new file mode 100644
index 000000000..e14f434da
--- /dev/null
+++ b/leetcode/0576.Out-of-Boundary-Paths/576. Out of Boundary Paths.go
@@ -0,0 +1,43 @@
+package leetcode
+
+var dir = [][]int{
+ {-1, 0},
+ {0, 1},
+ {1, 0},
+ {0, -1},
+}
+
+func findPaths(m int, n int, maxMove int, startRow int, startColumn int) int {
+ visited := make([][][]int, m)
+ for i := range visited {
+ visited[i] = make([][]int, n)
+ for j := range visited[i] {
+ visited[i][j] = make([]int, maxMove+1)
+ for l := range visited[i][j] {
+ visited[i][j][l] = -1
+ }
+ }
+ }
+ return dfs(startRow, startColumn, maxMove, m, n, visited)
+}
+
+func dfs(x, y, maxMove, m, n int, visited [][][]int) int {
+ if x < 0 || x >= m || y < 0 || y >= n {
+ return 1
+ }
+ if maxMove == 0 {
+ visited[x][y][maxMove] = 0
+ return 0
+ }
+ if visited[x][y][maxMove] >= 0 {
+ return visited[x][y][maxMove]
+ }
+ res := 0
+ for i := 0; i < 4; i++ {
+ nx := x + dir[i][0]
+ ny := y + dir[i][1]
+ res += (dfs(nx, ny, maxMove-1, m, n, visited) % 1000000007)
+ }
+ visited[x][y][maxMove] = res % 1000000007
+ return visited[x][y][maxMove]
+}
diff --git a/leetcode/0576.Out-of-Boundary-Paths/576. Out of Boundary Paths_test.go b/leetcode/0576.Out-of-Boundary-Paths/576. Out of Boundary Paths_test.go
new file mode 100644
index 000000000..b88e29e17
--- /dev/null
+++ b/leetcode/0576.Out-of-Boundary-Paths/576. Out of Boundary Paths_test.go
@@ -0,0 +1,51 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question576 struct {
+ para576
+ ans576
+}
+
+// para 是参数
+// one 代表第一个参数
+type para576 struct {
+ m int
+ n int
+ maxMove int
+ startRow int
+ startColumn int
+}
+
+// ans 是答案
+// one 代表第一个答案
+type ans576 struct {
+ one int
+}
+
+func Test_Problem576(t *testing.T) {
+
+ qs := []question576{
+
+ {
+ para576{2, 2, 2, 0, 0},
+ ans576{6},
+ },
+
+ {
+ para576{1, 3, 3, 0, 1},
+ ans576{12},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 576------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans576, q.para576
+ fmt.Printf("【input】:%v 【output】:%v\n", p, findPaths(p.m, p.n, p.maxMove, p.startRow, p.startColumn))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/0576.Out-of-Boundary-Paths/README.md b/leetcode/0576.Out-of-Boundary-Paths/README.md
new file mode 100644
index 000000000..64b74de58
--- /dev/null
+++ b/leetcode/0576.Out-of-Boundary-Paths/README.md
@@ -0,0 +1,89 @@
+# [576. Out of Boundary Paths](https://leetcode.com/problems/out-of-boundary-paths/)
+
+
+## 题目
+
+There is an `m x n` grid with a ball. The ball is initially at the position `[startRow, startColumn]`. You are allowed to move the ball to one of the four adjacent four cells in the grid (possibly out of the grid crossing the grid boundary). You can apply **at most** `maxMove` moves to the ball.
+
+Given the five integers `m`, `n`, `maxMove`, `startRow`, `startColumn`, return the number of paths to move the ball out of the grid boundary. Since the answer can be very large, return it **modulo** `109 + 7`.
+
+**Example 1:**
+
+
+
+```
+Input: m = 2, n = 2, maxMove = 2, startRow = 0, startColumn = 0
+Output: 6
+```
+
+**Example 2:**
+
+
+
+```
+Input: m = 1, n = 3, maxMove = 3, startRow = 0, startColumn = 1
+Output: 12
+```
+
+**Constraints:**
+
+- `1 <= m, n <= 50`
+- `0 <= maxMove <= 50`
+- `0 <= startRow <= m`
+- `0 <= startColumn <= n`
+
+## 题目大意
+
+给定一个 m × n 的网格和一个球。球的起始坐标为 (i,j) ，你可以将球移到相邻的单元格内，或者往上、下、左、右四个方向上移动使球穿过网格边界。但是，你最多可以移动 N 次。找出可以将球移出边界的路径数量。答案可能非常大，返回 结果 mod 109 + 7 的值。
+
+## 解题思路
+
+- 单纯暴力的思路，在球的每个方向都遍历一步，直到移动步数用完。这样暴力搜索，解空间是 4^n 。优化思路便是增加记忆化。用三维数组记录位置坐标和步数，对应的出边界的路径数量。加上记忆化以后的深搜解法 runtime beats 100% 了。
+
+## 代码
+
+```go
+package leetcode
+
+var dir = [][]int{
+ {-1, 0},
+ {0, 1},
+ {1, 0},
+ {0, -1},
+}
+
+func findPaths(m int, n int, maxMove int, startRow int, startColumn int) int {
+ visited := make([][][]int, m)
+ for i := range visited {
+ visited[i] = make([][]int, n)
+ for j := range visited[i] {
+ visited[i][j] = make([]int, maxMove+1)
+ for l := range visited[i][j] {
+ visited[i][j][l] = -1
+ }
+ }
+ }
+ return dfs(startRow, startColumn, maxMove, m, n, visited)
+}
+
+func dfs(x, y, maxMove, m, n int, visited [][][]int) int {
+ if x < 0 || x >= m || y < 0 || y >= n {
+ return 1
+ }
+ if maxMove == 0 {
+ visited[x][y][maxMove] = 0
+ return 0
+ }
+ if visited[x][y][maxMove] >= 0 {
+ return visited[x][y][maxMove]
+ }
+ res := 0
+ for i := 0; i < 4; i++ {
+ nx := x + dir[i][0]
+ ny := y + dir[i][1]
+ res += (dfs(nx, ny, maxMove-1, m, n, visited) % 1000000007)
+ }
+ visited[x][y][maxMove] = res % 1000000007
+ return visited[x][y][maxMove]
+}
+```
\ No newline at end of file
diff --git a/leetcode/0581.Shortest-Unsorted-Continuous-Subarray/581. Shortest Unsorted Continuous Subarray.go b/leetcode/0581.Shortest-Unsorted-Continuous-Subarray/581. Shortest Unsorted Continuous Subarray.go
new file mode 100644
index 000000000..328af9c3c
--- /dev/null
+++ b/leetcode/0581.Shortest-Unsorted-Continuous-Subarray/581. Shortest Unsorted Continuous Subarray.go
@@ -0,0 +1,58 @@
+package leetcode
+
+import "math"
+
+func findUnsortedSubarray(nums []int) int {
+ n, left, right, minR, maxL, isSort := len(nums), -1, -1, math.MaxInt32, math.MinInt32, false
+ // left
+ for i := 1; i < n; i++ {
+ if nums[i] < nums[i-1] {
+ isSort = true
+ }
+ if isSort {
+ minR = min(minR, nums[i])
+ }
+ }
+ isSort = false
+ // right
+ for i := n - 2; i >= 0; i-- {
+ if nums[i] > nums[i+1] {
+ isSort = true
+ }
+ if isSort {
+ maxL = max(maxL, nums[i])
+ }
+ }
+ // minR
+ for i := 0; i < n; i++ {
+ if nums[i] > minR {
+ left = i
+ break
+ }
+ }
+ // maxL
+ for i := n - 1; i >= 0; i-- {
+ if nums[i] < maxL {
+ right = i
+ break
+ }
+ }
+ if left == -1 || right == -1 {
+ return 0
+ }
+ return right - left + 1
+}
+
+func max(a, b int) int {
+ if a > b {
+ return a
+ }
+ return b
+}
+
+func min(a, b int) int {
+ if a < b {
+ return a
+ }
+ return b
+}
diff --git a/leetcode/0581.Shortest-Unsorted-Continuous-Subarray/581. Shortest Unsorted Continuous Subarray_test.go b/leetcode/0581.Shortest-Unsorted-Continuous-Subarray/581. Shortest Unsorted Continuous Subarray_test.go
new file mode 100644
index 000000000..db4b31857
--- /dev/null
+++ b/leetcode/0581.Shortest-Unsorted-Continuous-Subarray/581. Shortest Unsorted Continuous Subarray_test.go
@@ -0,0 +1,52 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question581 struct {
+ para581
+ ans581
+}
+
+// para 是参数
+// one 代表第一个参数
+type para581 struct {
+ nums []int
+}
+
+// ans 是答案
+// one 代表第一个答案
+type ans581 struct {
+ one int
+}
+
+func Test_Problem581(t *testing.T) {
+
+ qs := []question581{
+
+ {
+ para581{[]int{2, 6, 4, 8, 10, 9, 15}},
+ ans581{5},
+ },
+
+ {
+ para581{[]int{1, 2, 3, 4}},
+ ans581{0},
+ },
+
+ {
+ para581{[]int{1}},
+ ans581{0},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 581------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans581, q.para581
+ fmt.Printf("【input】:%v 【output】:%v\n", p, findUnsortedSubarray(p.nums))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/0581.Shortest-Unsorted-Continuous-Subarray/README.md b/leetcode/0581.Shortest-Unsorted-Continuous-Subarray/README.md
new file mode 100644
index 000000000..d6cf6b652
--- /dev/null
+++ b/leetcode/0581.Shortest-Unsorted-Continuous-Subarray/README.md
@@ -0,0 +1,107 @@
+# [581. Shortest Unsorted Continuous Subarray](https://leetcode.com/problems/shortest-unsorted-continuous-subarray/)
+
+
+## 题目
+
+Given an integer array `nums`, you need to find one **continuous subarray** that if you only sort this subarray in ascending order, then the whole array will be sorted in ascending order.
+
+Return *the shortest such subarray and output its length*.
+
+**Example 1:**
+
+```
+Input: nums = [2,6,4,8,10,9,15]
+Output: 5
+Explanation: You need to sort [6, 4, 8, 10, 9] in ascending order to make the whole array sorted in ascending order.
+```
+
+**Example 2:**
+
+```
+Input: nums = [1,2,3,4]
+Output: 0
+```
+
+**Example 3:**
+
+```
+Input: nums = [1]
+Output: 0
+```
+
+**Constraints:**
+
+- `1 <= nums.length <= 104`
+- `105 <= nums[i] <= 105`
+
+## 题目大意
+
+给你一个整数数组 nums ，你需要找出一个 连续子数组 ，如果对这个子数组进行升序排序，那么整个数组都会变为升序排序。请你找出符合题意的 最短 子数组，并输出它的长度。
+
+## 解题思路
+
+- 本题求的是最短逆序区间。经过简单推理，可以知道，这个逆序区间一定由这个区间内的最小元素决定左边界，最大元素决定右边界。
+- 先从左边找到第一个降序的元素，并记录最小的元素 min，再从右边往左找到最右边开始降序的元素，并记录最大的元素 max。最后需要还原最小元素和最大元素在原数组中正确的位置。以逆序区间左边界为例，如果区间外的一个元素比这个逆序区间内的最小元素还要小，说明它并不是左边界，因为这个小元素和逆序区间内的最小元素组合在一起，还是升序，并不是逆序。只有在左边区间外找到第一个大于逆序区间内最小元素，说明这里刚刚开始发生逆序，这才是最小逆序区间的左边界。同理，在逆序区间的右边找到第一个小于逆序区间内最大元素，说明这里刚刚发生逆序，这才是最小逆序区间的右边界。至此，最小逆序区间的左右边界都确定下来了，最短长度也就确定了下来。时间复杂度 O(n)，空间复杂度 O(1)。
+
+## 代码
+
+```go
+package leetcode
+
+import "math"
+
+func findUnsortedSubarray(nums []int) int {
+ n, left, right, minR, maxL, isSort := len(nums), -1, -1, math.MaxInt32, math.MinInt32, false
+ // left
+ for i := 1; i < n; i++ {
+ if nums[i] < nums[i-1] {
+ isSort = true
+ }
+ if isSort {
+ minR = min(minR, nums[i])
+ }
+ }
+ isSort = false
+ // right
+ for i := n - 2; i >= 0; i-- {
+ if nums[i] > nums[i+1] {
+ isSort = true
+ }
+ if isSort {
+ maxL = max(maxL, nums[i])
+ }
+ }
+ // minR
+ for i := 0; i < n; i++ {
+ if nums[i] > minR {
+ left = i
+ break
+ }
+ }
+ // maxL
+ for i := n - 1; i >= 0; i-- {
+ if nums[i] < maxL {
+ right = i
+ break
+ }
+ }
+ if left == -1 || right == -1 {
+ return 0
+ }
+ return right - left + 1
+}
+
+func max(a, b int) int {
+ if a > b {
+ return a
+ }
+ return b
+}
+
+func min(a, b int) int {
+ if a < b {
+ return a
+ }
+ return b
+}
+```
\ No newline at end of file
diff --git a/leetcode/0583.Delete-Operation-for-Two-Strings/583. Delete Operation for Two Strings.go b/leetcode/0583.Delete-Operation-for-Two-Strings/583. Delete Operation for Two Strings.go
new file mode 100644
index 000000000..616ddd8c8
--- /dev/null
+++ b/leetcode/0583.Delete-Operation-for-Two-Strings/583. Delete Operation for Two Strings.go
@@ -0,0 +1,31 @@
+package leetcode
+
+func minDistance(word1 string, word2 string) int {
+ dp := make([][]int, len(word1)+1)
+ for i := 0; i < len(word1)+1; i++ {
+ dp[i] = make([]int, len(word2)+1)
+ }
+ for i := 0; i < len(word1)+1; i++ {
+ dp[i][0] = i
+ }
+ for i := 0; i < len(word2)+1; i++ {
+ dp[0][i] = i
+ }
+ for i := 1; i < len(word1)+1; i++ {
+ for j := 1; j < len(word2)+1; j++ {
+ if word1[i-1] == word2[j-1] {
+ dp[i][j] = dp[i-1][j-1]
+ } else {
+ dp[i][j] = 1 + min(dp[i][j-1], dp[i-1][j])
+ }
+ }
+ }
+ return dp[len(word1)][len(word2)]
+}
+
+func min(x, y int) int {
+ if x < y {
+ return x
+ }
+ return y
+}
diff --git a/leetcode/0583.Delete-Operation-for-Two-Strings/583. Delete Operation for Two Strings_test.go b/leetcode/0583.Delete-Operation-for-Two-Strings/583. Delete Operation for Two Strings_test.go
new file mode 100644
index 000000000..d8d8c46b2
--- /dev/null
+++ b/leetcode/0583.Delete-Operation-for-Two-Strings/583. Delete Operation for Two Strings_test.go
@@ -0,0 +1,48 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question583 struct {
+ para583
+ ans583
+}
+
+// para 是参数
+// one 代表第一个参数
+type para583 struct {
+ word1 string
+ word2 string
+}
+
+// ans 是答案
+// one 代表第一个答案
+type ans583 struct {
+ one int
+}
+
+func Test_Problem583(t *testing.T) {
+
+ qs := []question583{
+
+ {
+ para583{"sea", "eat"},
+ ans583{2},
+ },
+
+ {
+ para583{"leetcode", "etco"},
+ ans583{4},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 583------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans583, q.para583
+ fmt.Printf("【input】:%v 【output】:%v\n", p, minDistance(p.word1, p.word2))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/0583.Delete-Operation-for-Two-Strings/README.md b/leetcode/0583.Delete-Operation-for-Two-Strings/README.md
new file mode 100644
index 000000000..b55d2fbf3
--- /dev/null
+++ b/leetcode/0583.Delete-Operation-for-Two-Strings/README.md
@@ -0,0 +1,76 @@
+# [583. Delete Operation for Two Strings](https://leetcode.com/problems/delete-operation-for-two-strings/)
+
+
+## 题目
+
+Given two strings `word1` and `word2`, return *the minimum number of **steps** required to make* `word1` *and* `word2` *the same*.
+
+In one **step**, you can delete exactly one character in either string.
+
+**Example 1:**
+
+```
+Input: word1 = "sea", word2 = "eat"
+Output: 2
+Explanation: You need one step to make "sea" to "ea" and another step to make "eat" to "ea".
+```
+
+**Example 2:**
+
+```
+Input: word1 = "leetcode", word2 = "etco"
+Output: 4
+```
+
+**Constraints:**
+
+- `1 <= word1.length, word2.length <= 500`
+- `word1` and `word2` consist of only lowercase English letters.
+
+## 题目大意
+
+给定两个单词 word1 和 word2，找到使得 word1 和 word2 相同所需的最小步数，每步可以删除任意一个字符串中的一个字符。
+
+## 解题思路
+
+- 从题目数据量级判断，此题一定是 O(n^2) 动态规划题。定义 `dp[i][j]` 表示 `word1[:i]` 与 `word2[:j]` 匹配所删除的最少步数。如果 `word1[:i-1]` 与 `word2[:j-1]` 匹配，那么 `dp[i][j] = dp[i-1][j-1]`。如果 `word1[:i-1]` 与 `word2[:j-1]` 不匹配，那么需要考虑删除一次，所以 `dp[i][j] = 1 + min(dp[i][j-1], dp[i-1][j])`。所以动态转移方程是：
+
+ $$dp[i][j] = \left\{\begin{matrix}dp[i-1][j-1]&, word1[i-1] == word2[j-1]\\ 1 + min(dp[i][j-1], dp[i-1][j])&, word1[i-1] \neq word2[j-1]\\\end{matrix}\right.$$
+
+ 最终答案存储在 `dp[len(word1)][len(word2)]` 中。
+
+## 代码
+
+```go
+package leetcode
+
+func minDistance(word1 string, word2 string) int {
+ dp := make([][]int, len(word1)+1)
+ for i := 0; i < len(word1)+1; i++ {
+ dp[i] = make([]int, len(word2)+1)
+ }
+ for i := 0; i < len(word1)+1; i++ {
+ dp[i][0] = i
+ }
+ for i := 0; i < len(word2)+1; i++ {
+ dp[0][i] = i
+ }
+ for i := 1; i < len(word1)+1; i++ {
+ for j := 1; j < len(word2)+1; j++ {
+ if word1[i-1] == word2[j-1] {
+ dp[i][j] = dp[i-1][j-1]
+ } else {
+ dp[i][j] = 1 + min(dp[i][j-1], dp[i-1][j])
+ }
+ }
+ }
+ return dp[len(word1)][len(word2)]
+}
+
+func min(x, y int) int {
+ if x < y {
+ return x
+ }
+ return y
+}
+```
\ No newline at end of file
diff --git a/leetcode/0589.N-ary-Tree-Preorder-Traversal/589. N-ary Tree Preorder Traversal.go b/leetcode/0589.N-ary-Tree-Preorder-Traversal/589. N-ary Tree Preorder Traversal.go
new file mode 100644
index 000000000..c0059ffd1
--- /dev/null
+++ b/leetcode/0589.N-ary-Tree-Preorder-Traversal/589. N-ary Tree Preorder Traversal.go
@@ -0,0 +1,43 @@
+package leetcode
+
+// Definition for a Node.
+type Node struct {
+ Val int
+ Children []*Node
+}
+
+// 解法一 非递归
+func preorder(root *Node) []int {
+ res := []int{}
+ if root == nil {
+ return res
+ }
+ stack := []*Node{root}
+ for len(stack) > 0 {
+ r := stack[len(stack)-1]
+ stack = stack[:len(stack)-1]
+ res = append(res, r.Val)
+ tmp := []*Node{}
+ for _, v := range r.Children {
+ tmp = append([]*Node{v}, tmp...) // 逆序存点
+ }
+ stack = append(stack, tmp...)
+ }
+ return res
+}
+
+// 解法二 递归
+func preorder1(root *Node) []int {
+ res := []int{}
+ preorderdfs(root, &res)
+ return res
+}
+
+func preorderdfs(root *Node, res *[]int) {
+ if root != nil {
+ *res = append(*res, root.Val)
+ for i := 0; i < len(root.Children); i++ {
+ preorderdfs(root.Children[i], res)
+ }
+ }
+}
diff --git a/leetcode/0589.N-ary-Tree-Preorder-Traversal/589. N-ary Tree Preorder Traversal_test.go b/leetcode/0589.N-ary-Tree-Preorder-Traversal/589. N-ary Tree Preorder Traversal_test.go
new file mode 100644
index 000000000..2f029c9fb
--- /dev/null
+++ b/leetcode/0589.N-ary-Tree-Preorder-Traversal/589. N-ary Tree Preorder Traversal_test.go
@@ -0,0 +1,82 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+
+ "github.com/halfrost/LeetCode-Go/structures"
+)
+
+type question589 struct {
+ para589
+ ans589
+}
+
+// para 是参数
+// one 代表第一个参数
+type para589 struct {
+ one []int
+}
+
+// ans 是答案
+// one 代表第一个答案
+type ans589 struct {
+ one []int
+}
+
+func Test_Problem589(t *testing.T) {
+
+ qs := []question589{
+
+ {
+ para589{[]int{1, structures.NULL, 3, 2, 4, structures.NULL, 5, 6}},
+ ans589{[]int{1, 3, 5, 6, 2, 4}},
+ },
+
+ {
+ para589{[]int{1, structures.NULL, 2, 3, 4, 5, structures.NULL, structures.NULL, 6, 7, structures.NULL, 8, structures.NULL, 9, 10, structures.NULL, structures.NULL, 11, structures.NULL, 12, structures.NULL, 13, structures.NULL, structures.NULL, 14}},
+ ans589{[]int{1, 2, 3, 6, 7, 11, 14, 4, 8, 12, 5, 9, 13, 10}},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 589------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans589, q.para589
+ fmt.Printf("【input】:%v ", p)
+ rootOne := int2NaryNode(p.one)
+ fmt.Printf("【output】:%v \n", preorder(rootOne))
+ }
+ fmt.Printf("\n\n\n")
+}
+
+func int2NaryNode(nodes []int) *Node {
+ root := &Node{}
+ if len(nodes) > 1 {
+ root.Val = nodes[0]
+ }
+ queue := []*Node{}
+ queue = append(queue, root)
+ i := 1
+ count := 0
+ for i < len(nodes) {
+ node := queue[0]
+
+ childrens := []*Node{}
+ for ; i < len(nodes) && nodes[i] != structures.NULL; i++ {
+ tmp := &Node{Val: nodes[i]}
+ childrens = append(childrens, tmp)
+ queue = append(queue, tmp)
+ }
+ count++
+ if count%2 == 0 {
+ queue = queue[1:]
+ count = 1
+ }
+ if node != nil {
+ node.Children = childrens
+ }
+ i++
+ }
+ return root
+}
diff --git a/leetcode/0589.N-ary-Tree-Preorder-Traversal/README.md b/leetcode/0589.N-ary-Tree-Preorder-Traversal/README.md
new file mode 100644
index 000000000..b3746cc47
--- /dev/null
+++ b/leetcode/0589.N-ary-Tree-Preorder-Traversal/README.md
@@ -0,0 +1,90 @@
+# [589. N-ary Tree Preorder Traversal](https://leetcode.com/problems/n-ary-tree-preorder-traversal/)
+
+## 题目
+
+Given the `root` of an n-ary tree, return *the preorder traversal of its nodes' values*.
+
+Nary-Tree input serialization is represented in their level order traversal. Each group of children is separated by the null value (See examples)
+
+**Example 1:**
+
+
+
+```
+Input: root = [1,null,3,2,4,null,5,6]
+Output: [1,3,5,6,2,4]
+```
+
+**Example 2:**
+
+
+
+```
+Input: root = [1,null,2,3,4,5,null,null,6,7,null,8,null,9,10,null,null,11,null,12,null,13,null,null,14]
+Output: [1,2,3,6,7,11,14,4,8,12,5,9,13,10]
+```
+
+**Constraints:**
+
+- The number of nodes in the tree is in the range `[0, 104]`.
+- `0 <= Node.val <= 10^4`
+- The height of the n-ary tree is less than or equal to `1000`.
+
+**Follow up:** Recursive solution is trivial, could you do it iteratively?
+
+## 题目大意
+
+给定一个 N 叉树，返回其节点值的 **前序遍历** 。N 叉树 在输入中按层序遍历进行序列化表示，每组子节点由空值 `null` 分隔（请参见示例）。
+
+## 解题思路
+
+- N 叉树和二叉树的前序遍历原理完全一样。二叉树非递归解法需要用到栈辅助，N 叉树同样如此。将父节点的所有孩子节点**逆序**入栈，逆序的目的是为了让前序节点永远在栈顶。依次循环直到栈里所有元素都出栈。输出的结果即为 N 叉树的前序遍历。时间复杂度 O(n)，空间复杂度 O(n)。
+- 递归解法非常简单，见解法二。
+
+## 代码
+
+```go
+package leetcode
+
+// Definition for a Node.
+type Node struct {
+ Val int
+ Children []*Node
+}
+
+// 解法一 非递归
+func preorder(root *Node) []int {
+ res := []int{}
+ if root == nil {
+ return res
+ }
+ stack := []*Node{root}
+ for len(stack) > 0 {
+ r := stack[len(stack)-1]
+ stack = stack[:len(stack)-1]
+ res = append(res, r.Val)
+ tmp := []*Node{}
+ for _, v := range r.Children {
+ tmp = append([]*Node{v}, tmp...) // 逆序存点
+ }
+ stack = append(stack, tmp...)
+ }
+ return res
+}
+
+// 解法二 递归
+func preorder1(root *Node) []int {
+ res := []int{}
+ preorderdfs(root, &res)
+ return res
+}
+
+func preorderdfs(root *Node, res *[]int) {
+ if root != nil {
+ *res = append(*res, root.Val)
+ for i := 0; i < len(root.Children); i++ {
+ preorderdfs(root.Children[i], res)
+ }
+ }
+}
+```
\ No newline at end of file
diff --git a/leetcode/0605.Can-Place-Flowers/605. Can Place Flowers.go b/leetcode/0605.Can-Place-Flowers/605. Can Place Flowers.go
new file mode 100644
index 000000000..0b5980963
--- /dev/null
+++ b/leetcode/0605.Can-Place-Flowers/605. Can Place Flowers.go
@@ -0,0 +1,18 @@
+package leetcode
+
+func canPlaceFlowers(flowerbed []int, n int) bool {
+ lenth := len(flowerbed)
+ for i := 0; i < lenth && n > 0; i += 2 {
+ if flowerbed[i] == 0 {
+ if i+1 == lenth || flowerbed[i+1] == 0 {
+ n--
+ } else {
+ i++
+ }
+ }
+ }
+ if n == 0 {
+ return true
+ }
+ return false
+}
diff --git a/leetcode/0605.Can-Place-Flowers/605. Can Place Flowers_test.go b/leetcode/0605.Can-Place-Flowers/605. Can Place Flowers_test.go
new file mode 100644
index 000000000..0b7ce7f2b
--- /dev/null
+++ b/leetcode/0605.Can-Place-Flowers/605. Can Place Flowers_test.go
@@ -0,0 +1,68 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question605 struct {
+ para605
+ ans605
+}
+
+// para 是参数
+// one 代表第一个参数
+type para605 struct {
+ flowerbed []int
+ n int
+}
+
+// ans 是答案
+// one 代表第一个答案
+type ans605 struct {
+ one bool
+}
+
+func Test_Problem605(t *testing.T) {
+
+ qs := []question605{
+
+ {
+ para605{[]int{1, 0, 0, 0, 1}, 1},
+ ans605{true},
+ },
+
+ {
+ para605{[]int{1, 0, 0, 0, 1}, 2},
+ ans605{false},
+ },
+
+ {
+ para605{[]int{1, 0, 0, 0, 0, 1}, 2},
+ ans605{false},
+ },
+
+ {
+ para605{[]int{0, 0, 1, 0}, 1},
+ ans605{true},
+ },
+
+ {
+ para605{[]int{0, 0, 1, 0, 0}, 1},
+ ans605{true},
+ },
+
+ {
+ para605{[]int{1, 0, 0, 1, 0}, 2},
+ ans605{false},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 605------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans605, q.para605
+ fmt.Printf("【input】:%v 【output】:%v\n", p, canPlaceFlowers(p.flowerbed, p.n))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/0605.Can-Place-Flowers/README.md b/leetcode/0605.Can-Place-Flowers/README.md
new file mode 100644
index 000000000..746817adc
--- /dev/null
+++ b/leetcode/0605.Can-Place-Flowers/README.md
@@ -0,0 +1,60 @@
+# [605. Can Place Flowers](https://leetcode.com/problems/can-place-flowers/)
+
+## 题目
+
+You have a long flowerbed in which some of the plots are planted, and some are not. However, flowers cannot be planted in **adjacent** plots.
+
+Given an integer array `flowerbed` containing `0`'s and `1`'s, where `0` means empty and `1` means not empty, and an integer `n`, return *if* `n` new flowers can be planted in the `flowerbed` without violating the no-adjacent-flowers rule.
+
+**Example 1:**
+
+```
+Input: flowerbed = [1,0,0,0,1], n = 1
+Output: true
+```
+
+**Example 2:**
+
+```
+Input: flowerbed = [1,0,0,0,1], n = 2
+Output: false
+```
+
+**Constraints:**
+
+- `1 <= flowerbed.length <= 2 * 104`
+- `flowerbed[i]` is `0` or `1`.
+- There are no two adjacent flowers in `flowerbed`.
+- `0 <= n <= flowerbed.length`
+
+## 题目大意
+
+假设你有一个很长的花坛，一部分地块种植了花，另一部分却没有。可是，花卉不能种植在相邻的地块上，它们会争夺水源，两者都会死去。给定一个花坛（表示为一个数组包含0和1，其中0表示没种植花，1表示种植了花），和一个数 n 。能否在不打破种植规则的情况下种入 n 朵花？能则返回True，不能则返回False。
+
+## 解题思路
+
+- 这一题最容易想到的解法是步长为 2 遍历数组，依次计数 0 的个数。有 2 种特殊情况需要单独判断，第一种情况是首尾连续多个 0，例如，00001 和 10000，第二种情况是 2 个 1 中间存在的 0 不足以种花，例如，1001 和 100001，1001 不能种任何花，100001 只能种一种花。单独判断出这 2 种情况，这一题就可以 AC 了。
+- 换个思路，找到可以种花的基本单元是 00，那么上面那 2 种特殊情况都可以统一成一种情况。判断是否当前存在 00 的组合，如果存在 00 的组合，都可以种花。末尾的情况需要单独判断，如果末尾为 0，也可以种花。这个时候不需要再找 00 组合，因为会越界。代码实现如下，思路很简洁明了。
+
+## 代码
+
+```go
+package leetcode
+
+func canPlaceFlowers(flowerbed []int, n int) bool {
+ lenth := len(flowerbed)
+ for i := 0; i < lenth && n > 0; i += 2 {
+ if flowerbed[i] == 0 {
+ if i+1 == lenth || flowerbed[i+1] == 0 {
+ n--
+ } else {
+ i++
+ }
+ }
+ }
+ if n == 0 {
+ return true
+ }
+ return false
+}
+```
\ No newline at end of file
diff --git a/leetcode/0609.Find-Duplicate-File-in-System/609. Find Duplicate File in System.go b/leetcode/0609.Find-Duplicate-File-in-System/609. Find Duplicate File in System.go
new file mode 100644
index 000000000..1a7852109
--- /dev/null
+++ b/leetcode/0609.Find-Duplicate-File-in-System/609. Find Duplicate File in System.go
@@ -0,0 +1,23 @@
+package leetcode
+
+import "strings"
+
+func findDuplicate(paths []string) [][]string {
+ cache := make(map[string][]string)
+ for _, path := range paths {
+ parts := strings.Split(path, " ")
+ dir := parts[0]
+ for i := 1; i < len(parts); i++ {
+ bracketPosition := strings.IndexByte(parts[i], '(')
+ content := parts[i][bracketPosition+1 : len(parts[i])-1]
+ cache[content] = append(cache[content], dir+"/"+parts[i][:bracketPosition])
+ }
+ }
+ res := make([][]string, 0, len(cache))
+ for _, group := range cache {
+ if len(group) >= 2 {
+ res = append(res, group)
+ }
+ }
+ return res
+}
diff --git a/leetcode/0609.Find-Duplicate-File-in-System/609. Find Duplicate File in System_test.go b/leetcode/0609.Find-Duplicate-File-in-System/609. Find Duplicate File in System_test.go
new file mode 100644
index 000000000..f9007fee4
--- /dev/null
+++ b/leetcode/0609.Find-Duplicate-File-in-System/609. Find Duplicate File in System_test.go
@@ -0,0 +1,47 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question609 struct {
+ para609
+ ans609
+}
+
+// para 是参数
+// one 代表第一个参数
+type para609 struct {
+ paths []string
+}
+
+// ans 是答案
+// one 代表第一个答案
+type ans609 struct {
+ one [][]string
+}
+
+func Test_Problem609(t *testing.T) {
+
+ qs := []question609{
+
+ {
+ para609{[]string{"root/a 1.txt(abcd) 2.txt(efgh)", "root/c 3.txt(abcd)", "root/c/d 4.txt(efgh)", "root 4.txt(efgh)"}},
+ ans609{[][]string{{"root/a/2.txt", "root/c/d/4.txt", "root/4.txt"}, {"root/a/1.txt", "root/c/3.txt"}}},
+ },
+
+ {
+ para609{[]string{"root/a 1.txt(abcd) 2.txt(efgh)", "root/c 3.txt(abcd)", "root/c/d 4.txt(efgh)"}},
+ ans609{[][]string{{"root/a/2.txt", "root/c/d/4.txt"}, {"root/a/1.txt", "root/c/3.txt"}}},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 609------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans609, q.para609
+ fmt.Printf("【input】:%v 【output】:%v\n", p, findDuplicate(p.paths))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/0609.Find-Duplicate-File-in-System/README.md b/leetcode/0609.Find-Duplicate-File-in-System/README.md
new file mode 100644
index 000000000..28341709a
--- /dev/null
+++ b/leetcode/0609.Find-Duplicate-File-in-System/README.md
@@ -0,0 +1,93 @@
+# [609. Find Duplicate File in System](https://leetcode.com/problems/find-duplicate-file-in-system/)
+
+
+## 题目
+
+Given a list `paths` of directory info, including the directory path, and all the files with contents in this directory, return *all the duplicate files in the file system in terms of their paths*. You may return the answer in **any order**.
+
+A group of duplicate files consists of at least two files that have the same content.
+
+A single directory info string in the input list has the following format:
+
+- `"root/d1/d2/.../dm f1.txt(f1_content) f2.txt(f2_content) ... fn.txt(fn_content)"`
+
+It means there are `n` files `(f1.txt, f2.txt ... fn.txt)` with content `(f1_content, f2_content ... fn_content)` respectively in the directory "`root/d1/d2/.../dm"`. Note that `n >= 1` and `m >= 0`. If `m = 0`, it means the directory is just the root directory.
+
+The output is a list of groups of duplicate file paths. For each group, it contains all the file paths of the files that have the same content. A file path is a string that has the following format:
+
+- `"directory_path/file_name.txt"`
+
+**Example 1:**
+
+```
+Input: paths = ["root/a 1.txt(abcd) 2.txt(efgh)","root/c 3.txt(abcd)","root/c/d 4.txt(efgh)","root 4.txt(efgh)"]
+Output: [["root/a/2.txt","root/c/d/4.txt","root/4.txt"],["root/a/1.txt","root/c/3.txt"]]
+
+```
+
+**Example 2:**
+
+```
+Input: paths = ["root/a 1.txt(abcd) 2.txt(efgh)","root/c 3.txt(abcd)","root/c/d 4.txt(efgh)"]
+Output: [["root/a/2.txt","root/c/d/4.txt"],["root/a/1.txt","root/c/3.txt"]]
+
+```
+
+**Constraints:**
+
+- `1 <= paths.length <= 2 * 104`
+- `1 <= paths[i].length <= 3000`
+- `1 <= sum(paths[i].length) <= 5 * 105`
+- `paths[i]` consist of English letters, digits, `'/'`, `'.'`, `'('`, `')'`, and `' '`.
+- You may assume no files or directories share the same name in the same directory.
+- You may assume each given directory info represents a unique directory. A single blank space separates the directory path and file info.
+
+**Follow up:**
+
+- Imagine you are given a real file system, how will you search files? DFS or BFS?
+- If the file content is very large (GB level), how will you modify your solution?
+- If you can only read the file by 1kb each time, how will you modify your solution?
+- What is the time complexity of your modified solution? What is the most time-consuming part and memory-consuming part of it? How to optimize?
+- How to make sure the duplicated files you find are not false positive?
+
+## 题目大意
+
+给定一个目录信息列表，包括目录路径，以及该目录中的所有包含内容的文件，您需要找到文件系统中的所有重复文件组的路径。一组重复的文件至少包括二个具有完全相同内容的文件。输入列表中的单个目录信息字符串的格式如下：`"root/d1/d2/.../dm f1.txt(f1_content) f2.txt(f2_content) ... fn.txt(fn_content)"`。这意味着有 n 个文件（`f1.txt, f2.txt ... fn.txt` 的内容分别是 `f1_content, f2_content ... fn_content`）在目录 `root/d1/d2/.../dm` 下。注意：n>=1 且 m>=0。如果 m=0，则表示该目录是根目录。该输出是重复文件路径组的列表。对于每个组，它包含具有相同内容的文件的所有文件路径。文件路径是具有下列格式的字符串：`"directory_path/file_name.txt"`
+
+## 解题思路
+
+- 这一题算简单题，考察的是字符串基本操作与 map 的使用。首先通过字符串操作获取目录路径、文件名和文件内容。再使用 map 来寻找重复文件，key 是文件内容，value 是存储路径和文件名的列表。遍历每一个文件，并把它加入 map 中。最后遍历 map，如果一个键对应的值列表的长度大于 1，说明找到了重复文件，可以把这个列表加入到最终答案中。
+- 这道题有价值的地方在 **Follow up** 中。感兴趣的读者可以仔细想想以下几个问题：
+ 1. 假设您有一个真正的文件系统，您将如何搜索文件？广度搜索还是宽度搜索？
+ 2. 如果文件内容非常大（GB级别），您将如何修改您的解决方案？
+ 3. 如果每次只能读取 1 kb 的文件，您将如何修改解决方案？
+ 4. 修改后的解决方案的时间复杂度是多少？其中最耗时的部分和消耗内存的部分是什么？如何优化？
+ 5. 如何确保您发现的重复文件不是误报？
+
+## 代码
+
+```go
+package leetcode
+
+import "strings"
+
+func findDuplicate(paths []string) [][]string {
+ cache := make(map[string][]string)
+ for _, path := range paths {
+ parts := strings.Split(path, " ")
+ dir := parts[0]
+ for i := 1; i < len(parts); i++ {
+ bracketPosition := strings.IndexByte(parts[i], '(')
+ content := parts[i][bracketPosition+1 : len(parts[i])-1]
+ cache[content] = append(cache[content], dir+"/"+parts[i][:bracketPosition])
+ }
+ }
+ res := make([][]string, 0, len(cache))
+ for _, group := range cache {
+ if len(group) >= 2 {
+ res = append(res, group)
+ }
+ }
+ return res
+}
+```
\ No newline at end of file
diff --git a/leetcode/0611.Valid-Triangle-Number/611. Valid Triangle Number.go b/leetcode/0611.Valid-Triangle-Number/611. Valid Triangle Number.go
new file mode 100644
index 000000000..69281b72f
--- /dev/null
+++ b/leetcode/0611.Valid-Triangle-Number/611. Valid Triangle Number.go
@@ -0,0 +1,18 @@
+package leetcode
+
+import "sort"
+
+func triangleNumber(nums []int) int {
+ res := 0
+ sort.Ints(nums)
+ for i := 0; i < len(nums)-2; i++ {
+ k := i + 2
+ for j := i + 1; j < len(nums)-1 && nums[i] != 0; j++ {
+ for k < len(nums) && nums[i]+nums[j] > nums[k] {
+ k++
+ }
+ res += k - j - 1
+ }
+ }
+ return res
+}
diff --git a/leetcode/0611.Valid-Triangle-Number/611. Valid Triangle Number_test.go b/leetcode/0611.Valid-Triangle-Number/611. Valid Triangle Number_test.go
new file mode 100644
index 000000000..c7752c1c1
--- /dev/null
+++ b/leetcode/0611.Valid-Triangle-Number/611. Valid Triangle Number_test.go
@@ -0,0 +1,52 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question611 struct {
+ para611
+ ans611
+}
+
+// para 是参数
+// one 代表第一个参数
+type para611 struct {
+ nums []int
+}
+
+// ans 是答案
+// one 代表第一个答案
+type ans611 struct {
+ one int
+}
+
+func Test_Problem611(t *testing.T) {
+
+ qs := []question611{
+
+ {
+ para611{[]int{2, 2, 3, 4}},
+ ans611{3},
+ },
+
+ {
+ para611{[]int{4, 2, 3, 4}},
+ ans611{4},
+ },
+
+ {
+ para611{[]int{0, 0}},
+ ans611{0},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 611------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans611, q.para611
+ fmt.Printf("【input】:%v 【output】:%v\n", p, triangleNumber(p.nums))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/0611.Valid-Triangle-Number/README.md b/leetcode/0611.Valid-Triangle-Number/README.md
new file mode 100644
index 000000000..a601ed595
--- /dev/null
+++ b/leetcode/0611.Valid-Triangle-Number/README.md
@@ -0,0 +1,37 @@
+# [611. Valid Triangle Number](https://leetcode.com/problems/valid-triangle-number/)
+
+## 题目
+
+Given an integer array nums, return the number of triplets chosen from the array that can make triangles if we take them as side lengths of a triangle.
+
+## 题目大意
+
+给定一个包含非负整数的数组，你的任务是统计其中可以组成三角形三条边的三元组个数。
+
+## 解题思路
+
+- 题意很简单，最容易想到的暴力解法是三重循环，暴力枚举，时间复杂度 O(n^3)。三重循环中最内层的循环可以优化，因为 k 和 i，j 存在关联性。第二层循环 j 从 i + 1 开始循环，k 从 j + 1 = i + 2 开始循环。循环累加 k 的值，直到 `nums[i] + nums[j] > nums[k]`，那么 `[nums[j + 1], nums[k - 1]]` 这个区间内的值都满足条件。满足条件的解个数增加 `k - j - 1` 个。j 再次递增 + 1，此时最内层的 k 不用从 j + 1 开始增加，只用从上次 k 开始增加即可。因为如果 `nums[i] + nums[j] > nums[k]`，如果这个 `nums[i] + nums[j + 1] > nums[m + 1]` 不等式成立，那么 m 一定不小于 k。所以内层循环 k 和 j 加起来的时间复杂度是 O(n)，最外层 i 的循环是 O(n)，这样优化以后，整体时间复杂度是 O(n^2)。
+- 可能有读者有疑问，三角形三条边的组成条件：任意两边之和大于第三边。`a + b > c`，`a + c > b`，`b + c > a`，此处为什么只判断了 `a + b > c` 呢？因为一开始进行了排序处理，使得 `a ≤ b ≤ c`，在这个前提下，`a + c > b`，`b + c > a` 是一定成立的。所以原问题便转化为只需关心 `a + b > c` 这一个不等式是否成立即可。此题的测试用例用有一种特殊情况，那就是其中一条边或者两条边长度为 0，那么 `a + b > c` 这个不等式一定不成立。综上，先排序预处理之后，只需要关心 `a + b > c` 这一个不等式是否成立即可。
+
+## 代码
+
+```go
+package leetcode
+
+import "sort"
+
+func triangleNumber(nums []int) int {
+ res := 0
+ sort.Ints(nums)
+ for i := 0; i < len(nums)-2; i++ {
+ k := i + 2
+ for j := i + 1; j < len(nums)-1 && nums[i] != 0; j++ {
+ for k < len(nums) && nums[i]+nums[j] > nums[k] {
+ k++
+ }
+ res += k - j - 1
+ }
+ }
+ return res
+}
+```
\ No newline at end of file
diff --git a/leetcode/0617.Merge-Two-Binary-Trees/617. Merge Two Binary Trees.go b/leetcode/0617.Merge-Two-Binary-Trees/617. Merge Two Binary Trees.go
new file mode 100644
index 000000000..a8d8e631a
--- /dev/null
+++ b/leetcode/0617.Merge-Two-Binary-Trees/617. Merge Two Binary Trees.go
@@ -0,0 +1,30 @@
+package leetcode
+
+import (
+ "github.com/halfrost/LeetCode-Go/structures"
+)
+
+// TreeNode define
+type TreeNode = structures.TreeNode
+
+/**
+ * Definition for a binary tree node.
+ * type TreeNode struct {
+ * Val int
+ * Left *TreeNode
+ * Right *TreeNode
+ * }
+ */
+
+func mergeTrees(root1 *TreeNode, root2 *TreeNode) *TreeNode {
+ if root1 == nil {
+ return root2
+ }
+ if root2 == nil {
+ return root1
+ }
+ root1.Val += root2.Val
+ root1.Left = mergeTrees(root1.Left, root2.Left)
+ root1.Right = mergeTrees(root1.Right, root2.Right)
+ return root1
+}
diff --git a/leetcode/0617.Merge-Two-Binary-Trees/617. Merge Two Binary Trees_test.go b/leetcode/0617.Merge-Two-Binary-Trees/617. Merge Two Binary Trees_test.go
new file mode 100644
index 000000000..249bd5d87
--- /dev/null
+++ b/leetcode/0617.Merge-Two-Binary-Trees/617. Merge Two Binary Trees_test.go
@@ -0,0 +1,63 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+
+ "github.com/halfrost/LeetCode-Go/structures"
+)
+
+type question617 struct {
+ para617
+ ans617
+}
+
+// para 是参数
+// one 代表第一个参数
+type para617 struct {
+ one []int
+ another []int
+}
+
+// ans 是答案
+// one 代表第一个答案
+type ans617 struct {
+ one []int
+}
+
+func Test_Problem617(t *testing.T) {
+
+ qs := []question617{
+
+ {
+ para617{[]int{}, []int{}},
+ ans617{[]int{}},
+ },
+
+ {
+ para617{[]int{}, []int{1}},
+ ans617{[]int{1}},
+ },
+
+ {
+ para617{[]int{1, 3, 2, 5}, []int{2, 1, 3, structures.NULL, 4, structures.NULL, 7}},
+ ans617{[]int{3, 4, 5, 5, 4, structures.NULL, 7}},
+ },
+
+ {
+ para617{[]int{1}, []int{1, 2}},
+ ans617{[]int{2, 2}},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 617------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans617, q.para617
+ fmt.Printf("【input】:%v ", p)
+ root1 := structures.Ints2TreeNode(p.one)
+ root2 := structures.Ints2TreeNode(p.another)
+ fmt.Printf("【output】:%v \n", mergeTrees(root1, root2))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/0617.Merge-Two-Binary-Trees/README.md b/leetcode/0617.Merge-Two-Binary-Trees/README.md
new file mode 100644
index 000000000..714ecedbc
--- /dev/null
+++ b/leetcode/0617.Merge-Two-Binary-Trees/README.md
@@ -0,0 +1,80 @@
+# [617. Merge Two Binary Trees](https://leetcode.com/problems/merge-two-binary-trees/)
+
+
+## 题目
+
+You are given two binary trees `root1` and `root2`.
+
+Imagine that when you put one of them to cover the other, some nodes of the two trees are overlapped while the others are not. You need to merge the two trees into a new binary tree. The merge rule is that if two nodes overlap, then sum node values up as the new value of the merged node. Otherwise, the NOT null node will be used as the node of the new tree.
+
+Return *the merged tree*.
+
+**Note:** The merging process must start from the root nodes of both trees.
+
+**Example 1:**
+
+
+
+```
+Input: root1 = [1,3,2,5], root2 = [2,1,3,null,4,null,7]
+Output: [3,4,5,5,4,null,7]
+```
+
+**Example 2:**
+
+```
+Input: root1 = [1], root2 = [1,2]
+Output: [2,2]
+```
+
+**Constraints:**
+
+- The number of nodes in both trees is in the range `[0, 2000]`.
+- `104 <= Node.val <= 104`
+
+## 题目大意
+
+给定两个二叉树，想象当你将它们中的一个覆盖到另一个上时，两个二叉树的一些节点便会重叠。你需要将他们合并为一个新的二叉树。合并的规则是如果两个节点重叠，那么将他们的值相加作为节点合并后的新值，否则不为 NULL 的节点将直接作为新二叉树的节点。
+
+## 解题思路
+
+- 简单题。采用深搜的思路，分别从根节点开始同时遍历两个二叉树，并将对应的节点进行合并。两个二叉树的对应节点可能存在以下三种情况：
+ - 如果两个二叉树的对应节点都为空，则合并后的二叉树的对应节点也为空；
+ - 如果两个二叉树的对应节点只有一个为空，则合并后的二叉树的对应节点为其中的非空节点；
+ - 如果两个二叉树的对应节点都不为空，则合并后的二叉树的对应节点的值为两个二叉树的对应节点的值之和，此时需要显性合并两个节点。
+- 对一个节点进行合并之后，还要对该节点的左右子树分别进行合并。用递归实现即可。
+
+## 代码
+
+```go
+package leetcode
+
+import (
+ "github.com/halfrost/LeetCode-Go/structures"
+)
+
+// TreeNode define
+type TreeNode = structures.TreeNode
+
+/**
+ * Definition for a binary tree node.
+ * type TreeNode struct {
+ * Val int
+ * Left *TreeNode
+ * Right *TreeNode
+ * }
+ */
+
+func mergeTrees(root1 *TreeNode, root2 *TreeNode) *TreeNode {
+ if root1 == nil {
+ return root2
+ }
+ if root2 == nil {
+ return root1
+ }
+ root1.Val += root2.Val
+ root1.Left = mergeTrees(root1.Left, root2.Left)
+ root1.Right = mergeTrees(root1.Right, root2.Right)
+ return root1
+}
+```
\ No newline at end of file
diff --git a/leetcode/0622.Design-Circular-Queue/622. Design Circular Queue.go b/leetcode/0622.Design-Circular-Queue/622. Design Circular Queue.go
new file mode 100644
index 000000000..1857196f2
--- /dev/null
+++ b/leetcode/0622.Design-Circular-Queue/622. Design Circular Queue.go
@@ -0,0 +1,71 @@
+package leetcode
+
+type MyCircularQueue struct {
+ cap int
+ size int
+ queue []int
+ left int
+ right int
+}
+
+func Constructor(k int) MyCircularQueue {
+ return MyCircularQueue{cap: k, size: 0, left: 0, right: 0, queue: make([]int, k)}
+}
+
+func (this *MyCircularQueue) EnQueue(value int) bool {
+ if this.size == this.cap {
+ return false
+ }
+ this.size++
+ this.queue[this.right] = value
+ this.right++
+ this.right %= this.cap
+ return true
+
+}
+
+func (this *MyCircularQueue) DeQueue() bool {
+ if this.size == 0 {
+ return false
+ }
+ this.size--
+ this.left++
+ this.left %= this.cap
+ return true
+}
+
+func (this *MyCircularQueue) Front() int {
+ if this.size == 0 {
+ return -1
+ }
+ return this.queue[this.left]
+}
+
+func (this *MyCircularQueue) Rear() int {
+ if this.size == 0 {
+ return -1
+ }
+ if this.right == 0 {
+ return this.queue[this.cap-1]
+ }
+ return this.queue[this.right-1]
+}
+
+func (this *MyCircularQueue) IsEmpty() bool {
+ return this.size == 0
+}
+
+func (this *MyCircularQueue) IsFull() bool {
+ return this.size == this.cap
+}
+
+/**
+ * Your MyCircularQueue object will be instantiated and called as such:
+ * obj := Constructor(k);
+ * param_1 := obj.EnQueue(value);
+ * param_2 := obj.DeQueue();
+ * param_3 := obj.Front();
+ * param_4 := obj.Rear();
+ * param_5 := obj.IsEmpty();
+ * param_6 := obj.IsFull();
+ */
diff --git a/leetcode/0622.Design-Circular-Queue/622. Design Circular Queue_test.go b/leetcode/0622.Design-Circular-Queue/622. Design Circular Queue_test.go
new file mode 100644
index 000000000..3054c06d6
--- /dev/null
+++ b/leetcode/0622.Design-Circular-Queue/622. Design Circular Queue_test.go
@@ -0,0 +1,23 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+func Test_Problem622(t *testing.T) {
+ obj := Constructor(3)
+ fmt.Printf("obj = %v\n", obj)
+ param1 := obj.EnQueue(1)
+ fmt.Printf("param_1 = %v obj = %v\n", param1, obj)
+ param2 := obj.DeQueue()
+ fmt.Printf("param_1 = %v obj = %v\n", param2, obj)
+ param3 := obj.Front()
+ fmt.Printf("param_1 = %v obj = %v\n", param3, obj)
+ param4 := obj.Rear()
+ fmt.Printf("param_1 = %v obj = %v\n", param4, obj)
+ param5 := obj.IsEmpty()
+ fmt.Printf("param_1 = %v obj = %v\n", param5, obj)
+ param6 := obj.IsFull()
+ fmt.Printf("param_1 = %v obj = %v\n", param6, obj)
+}
diff --git a/leetcode/0622.Design-Circular-Queue/README.md b/leetcode/0622.Design-Circular-Queue/README.md
new file mode 100644
index 000000000..149f07bf3
--- /dev/null
+++ b/leetcode/0622.Design-Circular-Queue/README.md
@@ -0,0 +1,147 @@
+# [622. Design Circular Queue](https://leetcode.com/problems/design-circular-queue/)
+
+
+## 题目
+
+Design your implementation of the circular queue. The circular queue is a linear data structure in which the operations are performed based on FIFO (First In First Out) principle and the last position is connected back to the first position to make a circle. It is also called "Ring Buffer".
+
+One of the benefits of the circular queue is that we can make use of the spaces in front of the queue. In a normal queue, once the queue becomes full, we cannot insert the next element even if there is a space in front of the queue. But using the circular queue, we can use the space to store new values.
+
+Implementation the `MyCircularQueue` class:
+
+- `MyCircularQueue(k)` Initializes the object with the size of the queue to be `k`.
+- `int Front()` Gets the front item from the queue. If the queue is empty, return `1`.
+- `int Rear()` Gets the last item from the queue. If the queue is empty, return `1`.
+- `boolean enQueue(int value)` Inserts an element into the circular queue. Return `true` if the operation is successful.
+- `boolean deQueue()` Deletes an element from the circular queue. Return `true` if the operation is successful.
+- `boolean isEmpty()` Checks whether the circular queue is empty or not.
+- `boolean isFull()` Checks whether the circular queue is full or not.
+
+**Example 1:**
+
+```
+Input
+["MyCircularQueue", "enQueue", "enQueue", "enQueue", "enQueue", "Rear", "isFull", "deQueue", "enQueue", "Rear"]
+[[3], [1], [2], [3], [4], [], [], [], [4], []]
+Output
+[null, true, true, true, false, 3, true, true, true, 4]
+
+Explanation
+MyCircularQueue myCircularQueue = new MyCircularQueue(3);
+myCircularQueue.enQueue(1); // return True
+myCircularQueue.enQueue(2); // return True
+myCircularQueue.enQueue(3); // return True
+myCircularQueue.enQueue(4); // return False
+myCircularQueue.Rear(); // return 3
+myCircularQueue.isFull(); // return True
+myCircularQueue.deQueue(); // return True
+myCircularQueue.enQueue(4); // return True
+myCircularQueue.Rear(); // return 4
+
+```
+
+**Constraints:**
+
+- `1 <= k <= 1000`
+- `0 <= value <= 1000`
+- At most `3000` calls will be made to `enQueue`, `deQueue`, `Front`, `Rear`, `isEmpty`, and `isFull`.
+
+**Follow up:**
+
+Could you solve the problem without using the built-in queue?
+
+## 题目大意
+
+设计你的循环队列实现。 循环队列是一种线性数据结构，其操作表现基于 FIFO（先进先出）原则并且队尾被连接在队首之后以形成一个循环。它也被称为“环形缓冲器”。
+
+循环队列的一个好处是我们可以利用这个队列之前用过的空间。在一个普通队列里，一旦一个队列满了，我们就不能插入下一个元素，即使在队列前面仍有空间。但是使用循环队列，我们能使用这些空间去存储新的值。
+
+你的实现应该支持如下操作：
+
+- MyCircularQueue(k): 构造器，设置队列长度为 k 。
+- Front: 从队首获取元素。如果队列为空，返回 -1 。
+- Rear: 获取队尾元素。如果队列为空，返回 -1 。
+- enQueue(value): 向循环队列插入一个元素。如果成功插入则返回真。
+- deQueue(): 从循环队列中删除一个元素。如果成功删除则返回真。
+- isEmpty(): 检查循环队列是否为空。
+- isFull(): 检查循环队列是否已满。
+
+## 解题思路
+
+- 简单题。设计一个环形队列，底层用数组实现。额外维护 4 个变量，队列的总 cap，队列当前的 size，前一元素下标 left，后一个元素下标 right。每添加一个元素便维护 left，right，size，下标需要对 cap 取余，因为超过 cap 大小之后，需要循环存储。代码实现没有难度，具体sh见下面代码。
+
+## 代码
+
+```go
+package leetcode
+
+type MyCircularQueue struct {
+ cap int
+ size int
+ queue []int
+ left int
+ right int
+}
+
+func Constructor(k int) MyCircularQueue {
+ return MyCircularQueue{cap: k, size: 0, left: 0, right: 0, queue: make([]int, k)}
+}
+
+func (this *MyCircularQueue) EnQueue(value int) bool {
+ if this.size == this.cap {
+ return false
+ }
+ this.size++
+ this.queue[this.right] = value
+ this.right++
+ this.right %= this.cap
+ return true
+
+}
+
+func (this *MyCircularQueue) DeQueue() bool {
+ if this.size == 0 {
+ return false
+ }
+ this.size--
+ this.left++
+ this.left %= this.cap
+ return true
+}
+
+func (this *MyCircularQueue) Front() int {
+ if this.size == 0 {
+ return -1
+ }
+ return this.queue[this.left]
+}
+
+func (this *MyCircularQueue) Rear() int {
+ if this.size == 0 {
+ return -1
+ }
+ if this.right == 0 {
+ return this.queue[this.cap-1]
+ }
+ return this.queue[this.right-1]
+}
+
+func (this *MyCircularQueue) IsEmpty() bool {
+ return this.size == 0
+}
+
+func (this *MyCircularQueue) IsFull() bool {
+ return this.size == this.cap
+}
+
+/**
+ * Your MyCircularQueue object will be instantiated and called as such:
+ * obj := Constructor(k);
+ * param_1 := obj.EnQueue(value);
+ * param_2 := obj.DeQueue();
+ * param_3 := obj.Front();
+ * param_4 := obj.Rear();
+ * param_5 := obj.IsEmpty();
+ * param_6 := obj.IsFull();
+ */
+```
\ No newline at end of file
diff --git a/leetcode/0623.Add-One-Row-to-Tree/623. Add One Row to Tree.go b/leetcode/0623.Add-One-Row-to-Tree/623. Add One Row to Tree.go
new file mode 100644
index 000000000..309ab55c8
--- /dev/null
+++ b/leetcode/0623.Add-One-Row-to-Tree/623. Add One Row to Tree.go
@@ -0,0 +1,42 @@
+package leetcode
+
+import (
+ "github.com/halfrost/LeetCode-Go/structures"
+)
+
+// TreeNode define
+type TreeNode = structures.TreeNode
+
+/**
+ * Definition for a binary tree node.
+ * type TreeNode struct {
+ * Val int
+ * Left *TreeNode
+ * Right *TreeNode
+ * }
+ */
+func addOneRow(root *TreeNode, v int, d int) *TreeNode {
+ if d == 1 {
+ tmp := &TreeNode{Val: v, Left: root, Right: nil}
+ return tmp
+ }
+ level := 1
+ addTreeRow(root, v, d, &level)
+ return root
+}
+
+func addTreeRow(root *TreeNode, v, d int, currLevel *int) {
+ if *currLevel == d-1 {
+ root.Left = &TreeNode{Val: v, Left: root.Left, Right: nil}
+ root.Right = &TreeNode{Val: v, Left: nil, Right: root.Right}
+ return
+ }
+ *currLevel++
+ if root.Left != nil {
+ addTreeRow(root.Left, v, d, currLevel)
+ }
+ if root.Right != nil {
+ addTreeRow(root.Right, v, d, currLevel)
+ }
+ *currLevel--
+}
diff --git a/leetcode/0623.Add-One-Row-to-Tree/623. Add One Row to Tree_test.go b/leetcode/0623.Add-One-Row-to-Tree/623. Add One Row to Tree_test.go
new file mode 100644
index 000000000..d13d3e51d
--- /dev/null
+++ b/leetcode/0623.Add-One-Row-to-Tree/623. Add One Row to Tree_test.go
@@ -0,0 +1,68 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+
+ "github.com/halfrost/LeetCode-Go/structures"
+)
+
+type question623 struct {
+ para623
+ ans623
+}
+
+// para 是参数
+// one 代表第一个参数
+type para623 struct {
+ one []int
+ v int
+ d int
+}
+
+// ans 是答案
+// one 代表第一个答案
+type ans623 struct {
+ one []int
+}
+
+func Test_Problem623(t *testing.T) {
+
+ qs := []question623{
+
+ {
+ para623{[]int{4, 2, 6, 3, 1, 5, structures.NULL}, 1, 2},
+ ans623{[]int{4, 1, 1, 2, structures.NULL, structures.NULL, 6, 3, 1, 5, structures.NULL}},
+ },
+
+ {
+ para623{[]int{4, 2, structures.NULL, 3, 1}, 1, 3},
+ ans623{[]int{4, 2, structures.NULL, 1, 1, 3, structures.NULL, structures.NULL, 1}},
+ },
+
+ {
+ para623{[]int{1, 2, 3, 4}, 5, 4},
+ ans623{[]int{1, 2, 3, 4, structures.NULL, structures.NULL, structures.NULL, 5, 5}},
+ },
+
+ {
+ para623{[]int{4, 2, 6, 3, 1, 5}, 1, 3},
+ ans623{[]int{4, 2, 6, 1, 1, 1, 1, 3, structures.NULL, structures.NULL, 1, 5}},
+ },
+
+ {
+ para623{[]int{4, 2, 6, 3, 1, 5}, 1, 1},
+ ans623{[]int{1, 4, structures.NULL, 2, 6, 3, 1, 5}},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 623------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans623, q.para623
+ fmt.Printf("【input】:%v ", p)
+ root := structures.Ints2TreeNode(p.one)
+ fmt.Printf("【output】:%v \n", structures.Tree2Preorder(addOneRow(root, p.v, p.d)))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/0623.Add-One-Row-to-Tree/README.md b/leetcode/0623.Add-One-Row-to-Tree/README.md
new file mode 100644
index 000000000..05f39a433
--- /dev/null
+++ b/leetcode/0623.Add-One-Row-to-Tree/README.md
@@ -0,0 +1,110 @@
+# [623. Add One Row to Tree](https://leetcode.com/problems/add-one-row-to-tree/)
+
+
+## 题目
+
+Given the root of a binary tree, then value `v` and depth `d`, you need to add a row of nodes with value `v` at the given depth `d`. The root node is at depth 1.
+
+The adding rule is: given a positive integer depth `d`, for each NOT null tree nodes `N` in depth `d-1`, create two tree nodes with value `v` as `N's` left subtree root and right subtree root. And `N's` **original left subtree** should be the left subtree of the new left subtree root, its **original right subtree** should be the right subtree of the new right subtree root. If depth `d` is 1 that means there is no depth d-1 at all, then create a tree node with value **v** as the new root of the whole original tree, and the original tree is the new root's left subtree.
+
+**Example 1:**
+
+```
+Input:
+A binary tree as following:
+ 4
+ / \
+ 2 6
+ / \ /
+ 3 1 5
+
+v = 1d = 2Output:
+ 4
+ / \
+ 1 1
+ / \
+ 2 6
+ / \ /
+ 3 1 5
+```
+
+**Example 2:**
+
+```
+Input:
+A binary tree as following:
+ 4
+ /
+ 2
+ / \
+ 3 1
+
+v = 1d = 3Output:
+ 4
+ /
+ 2
+ / \
+ 1 1
+ / \
+3 1
+```
+
+**Note:**
+
+1. The given d is in range [1, maximum depth of the given tree + 1].
+2. The given binary tree has at least one tree node.
+
+## 题目大意
+
+给定一个二叉树，根节点为第1层，深度为 1。在其第 d 层追加一行值为 v 的节点。添加规则：给定一个深度值 d （正整数），针对深度为 d-1 层的每一非空节点 N，为 N 创建两个值为 v 的左子树和右子树。将 N 原先的左子树，连接为新节点 v 的左子树；将 N 原先的右子树，连接为新节点 v 的右子树。如果 d 的值为 1，深度 d - 1 不存在，则创建一个新的根节点 v，原先的整棵树将作为 v 的左子树。
+
+## 解题思路
+
+- 这一题虽然是 Medium，实际非常简单。给二叉树添加一行，用 DFS 或者 BFS，遍历过程中记录行数，到达目标行一行，增加节点即可。不过需要注意 2 个特殊情况，特殊情况一，`d==1`，此时需要添加的行即为根节点。特殊情况二，`d>height(root)`，即要添加的行数比树还要高，这时只需要在最下层的叶子节点添加一层。时间复杂度 O(n)，空间复杂度 O(n)。
+
+## 代码
+
+```go
+package leetcode
+
+import (
+ "github.com/halfrost/LeetCode-Go/structures"
+)
+
+// TreeNode define
+type TreeNode = structures.TreeNode
+
+/**
+ * Definition for a binary tree node.
+ * type TreeNode struct {
+ * Val int
+ * Left *TreeNode
+ * Right *TreeNode
+ * }
+ */
+func addOneRow(root *TreeNode, v int, d int) *TreeNode {
+ if d == 1 {
+ tmp := &TreeNode{Val: v, Left: root, Right: nil}
+ return tmp
+ }
+ level := 1
+ addTreeRow(root, v, d, &level)
+ return root
+}
+
+func addTreeRow(root *TreeNode, v, d int, currLevel *int) {
+ if *currLevel == d-1 {
+ root.Left = &TreeNode{Val: v, Left: root.Left, Right: nil}
+ root.Right = &TreeNode{Val: v, Left: nil, Right: root.Right}
+ return
+ }
+ *currLevel++
+ if root.Left != nil {
+ addTreeRow(root.Left, v, d, currLevel)
+ }
+ if root.Right != nil {
+ addTreeRow(root.Right, v, d, currLevel)
+ }
+ *currLevel--
+}
+```
\ No newline at end of file
diff --git a/leetcode/0628.Maximum-Product-of-Three-Numbers/628. Maximum Product of Three Numbers.go b/leetcode/0628.Maximum-Product-of-Three-Numbers/628. Maximum Product of Three Numbers.go
index 1a481bff8..f3d0d1ba3 100644
--- a/leetcode/0628.Maximum-Product-of-Three-Numbers/628. Maximum Product of Three Numbers.go
+++ b/leetcode/0628.Maximum-Product-of-Three-Numbers/628. Maximum Product of Three Numbers.go
@@ -1,6 +1,7 @@
package leetcode
import (
+ "math"
"sort"
)
@@ -32,28 +33,27 @@ func max(a int, b int) int {
// 解法二 模拟，时间复杂度 O(n)
func maximumProduct1(nums []int) int {
- n1, n2, n3 := -1<<63, -1<<63, -1<<63
- n4, n5 := 0, 0
- for _, v := range nums {
- if v > n1 {
- n3 = n2
- n2 = n1
- n1 = v
- } else if v > n2 {
- n3 = n2
- n2 = v
- } else if v > n3 {
- n3 = v
+ max := make([]int, 0)
+ max = append(max, math.MinInt64, math.MinInt64, math.MinInt64)
+ min := make([]int, 0)
+ min = append(min, math.MaxInt64, math.MaxInt64)
+ for _, num := range nums {
+ if num > max[0] {
+ max[0], max[1], max[2] = num, max[0], max[1]
+ } else if num > max[1] {
+ max[1], max[2] = num, max[1]
+ } else if num > max[2] {
+ max[2] = num
}
- if v < n4 {
- n5 = n4
- n4 = v
- } else if v < n5 {
- n5 = v
+ if num < min[0] {
+ min[0], min[1] = num, min[0]
+ } else if num < min[1] {
+ min[1] = num
}
}
- if n2*n3 > n4*n5 {
- return n1 * n2 * n3
+ maxProduct1, maxProduct2 := min[0]*min[1]*max[0], max[0]*max[1]*max[2]
+ if maxProduct1 > maxProduct2 {
+ return maxProduct1
}
- return n1 * n4 * n5
+ return maxProduct2
}
diff --git a/leetcode/0630.Course-Schedule-III/630. Course Schedule III.go b/leetcode/0630.Course-Schedule-III/630. Course Schedule III.go
new file mode 100644
index 000000000..2d5101ddc
--- /dev/null
+++ b/leetcode/0630.Course-Schedule-III/630. Course Schedule III.go
@@ -0,0 +1,39 @@
+package leetcode
+
+import (
+ "container/heap"
+ "sort"
+)
+
+func scheduleCourse(courses [][]int) int {
+ sort.Slice(courses, func(i, j int) bool {
+ return courses[i][1] < courses[j][1]
+ })
+ maxHeap, time := &Schedule{}, 0
+ heap.Init(maxHeap)
+ for _, c := range courses {
+ if time+c[0] <= c[1] {
+ time += c[0]
+ heap.Push(maxHeap, c[0])
+ } else if (*maxHeap).Len() > 0 && (*maxHeap)[0] > c[0] {
+ time -= heap.Pop(maxHeap).(int) - c[0]
+ heap.Push(maxHeap, c[0])
+ }
+ }
+ return (*maxHeap).Len()
+}
+
+type Schedule []int
+
+func (s Schedule) Len() int { return len(s) }
+func (s Schedule) Less(i, j int) bool { return s[i] > s[j] }
+func (s Schedule) Swap(i, j int) { s[i], s[j] = s[j], s[i] }
+func (s *Schedule) Pop() interface{} {
+ n := len(*s)
+ t := (*s)[n-1]
+ *s = (*s)[:n-1]
+ return t
+}
+func (s *Schedule) Push(x interface{}) {
+ *s = append(*s, x.(int))
+}
diff --git a/leetcode/0630.Course-Schedule-III/630. Course Schedule III_test.go b/leetcode/0630.Course-Schedule-III/630. Course Schedule III_test.go
new file mode 100644
index 000000000..fdc727628
--- /dev/null
+++ b/leetcode/0630.Course-Schedule-III/630. Course Schedule III_test.go
@@ -0,0 +1,42 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question630 struct {
+ para630
+ ans630
+}
+
+// para 是参数
+// one 代表第一个参数
+type para630 struct {
+ courses [][]int
+}
+
+// ans 是答案
+// one 代表第一个答案
+type ans630 struct {
+ one int
+}
+
+func Test_Problem630(t *testing.T) {
+
+ qs := []question630{
+
+ {
+ para630{[][]int{{100, 200}, {200, 1300}, {1000, 1250}, {2000, 3200}}},
+ ans630{3},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 630------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans630, q.para630
+ fmt.Printf("【input】:%v 【output】:%v\n", p, scheduleCourse(p.courses))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/0630.Course-Schedule-III/README.md b/leetcode/0630.Course-Schedule-III/README.md
new file mode 100644
index 000000000..442777dda
--- /dev/null
+++ b/leetcode/0630.Course-Schedule-III/README.md
@@ -0,0 +1,96 @@
+# [630. Course Schedule III](https://leetcode.com/problems/course-schedule-iii/)
+
+## 题目
+
+There are `n` different online courses numbered from `1` to `n`. You are given an array `courses` where `courses[i] = [durationi, lastDayi]` indicate that the `ith` course should be taken **continuously** for `durationi` days and must be finished before or on `lastDayi`.
+
+You will start on the `1st` day and you cannot take two or more courses simultaneously.
+
+Return *the maximum number of courses that you can take*.
+
+**Example 1:**
+
+```
+Input: courses = [[100,200],[200,1300],[1000,1250],[2000,3200]]
+Output: 3
+Explanation:
+There are totally 4 courses, but you can take 3 courses at most:
+First, take the 1st course, it costs 100 days so you will finish it on the 100th day, and ready to take the next course on the 101st day.
+Second, take the 3rd course, it costs 1000 days so you will finish it on the 1100th day, and ready to take the next course on the 1101st day.
+Third, take the 2nd course, it costs 200 days so you will finish it on the 1300th day.
+The 4th course cannot be taken now, since you will finish it on the 3300th day, which exceeds the closed date.
+
+```
+
+**Example 2:**
+
+```
+Input: courses = [[1,2]]
+Output: 1
+
+```
+
+**Example 3:**
+
+```
+Input: courses = [[3,2],[4,3]]
+Output: 0
+
+```
+
+**Constraints:**
+
+- `1 <= courses.length <= 104`
+- `1 <= durationi, lastDayi <= 104`
+
+## 题目大意
+
+这里有 n 门不同的在线课程，他们按从 1 到 n 编号。每一门课程有一定的持续上课时间（课程时间）t 以及关闭时间第 d 天。一门课要持续学习 t 天直到第 d 天时要完成，你将会从第 1 天开始。给出 n 个在线课程用 (t, d) 对表示。你的任务是找出最多可以修几门课。
+
+## 解题思路
+
+- 一般选课，任务的题目会涉及排序 + 贪心。此题同样如此。最多修几门课，采用贪心的思路。先将课程结束时间从小到大排序，优先选择结束时间靠前的课程，这样留给后面课程的时间越多，便可以修更多的课。对排好序的课程从前往后选课，不断累积时间。如果选择修当前课程，但是会超时，这时改调整了。对于已经选择的课程，都加入到最大堆中，遇到需要调整时，比较当前待考虑的课程时长是否比(堆中)已经选择课中时长最长的课时长短，即堆顶的课程时长短，剔除 pop 它，再选择这门时长短的课，并加入最大堆中。并更新累积时间。一层循环扫完所有课程，最终最大堆中包含课程的数目便是最多可以修的课程数。
+
+## 代码
+
+```go
+package leetcode
+
+import (
+ "container/heap"
+ "sort"
+)
+
+func scheduleCourse(courses [][]int) int {
+ sort.Slice(courses, func(i, j int) bool {
+ return courses[i][1] < courses[j][1]
+ })
+ maxHeap, time := &Schedule{}, 0
+ heap.Init(maxHeap)
+ for _, c := range courses {
+ if time+c[0] <= c[1] {
+ time += c[0]
+ heap.Push(maxHeap, c[0])
+ } else if (*maxHeap).Len() > 0 && (*maxHeap)[0] > c[0] {
+ time -= heap.Pop(maxHeap).(int) - c[0]
+ heap.Push(maxHeap, c[0])
+ }
+ }
+ return (*maxHeap).Len()
+}
+
+type Schedule []int
+
+func (s Schedule) Len() int { return len(s) }
+func (s Schedule) Less(i, j int) bool { return s[i] > s[j] }
+func (s Schedule) Swap(i, j int) { s[i], s[j] = s[j], s[i] }
+func (s *Schedule) Pop() interface{} {
+ n := len(*s)
+ t := (*s)[n-1]
+ *s = (*s)[:n-1]
+ return t
+}
+func (s *Schedule) Push(x interface{}) {
+ *s = append(*s, x.(int))
+}
+```
\ No newline at end of file
diff --git a/leetcode/0633.Sum-of-Square-Numbers/README.md b/leetcode/0633.Sum-of-Square-Numbers/README.md
index 7bad99405..de0a6e546 100755
--- a/leetcode/0633.Sum-of-Square-Numbers/README.md
+++ b/leetcode/0633.Sum-of-Square-Numbers/README.md
@@ -25,4 +25,4 @@ Given a non-negative integer `c`, your task is to decide whether there're two i
## 解题思路
- 给出一个数，要求判断这个数能否由由 2 个完全平方数组成。能则输出 true，不能则输出 false。
-- 可以用二分搜索来解答这道题。判断题意，依次计算 `low * low + high * high` 和 c 是否相等。从 [1, sqrt(n)] 区间内进行二分，若能找到则返回 true，找不到就返回 false 。
+- 可以用二分搜索来解答这道题。判断题意，依次计算 `low * low + high * high` 和 c 是否相等。从 [0, sqrt(n)] 区间内进行二分，若能找到则返回 true，找不到就返回 false 。
diff --git a/leetcode/0643.Maximum-Average-Subarray-I/643. Maximum Average Subarray I.go b/leetcode/0643.Maximum-Average-Subarray-I/643. Maximum Average Subarray I.go
new file mode 100644
index 000000000..ef893beb4
--- /dev/null
+++ b/leetcode/0643.Maximum-Average-Subarray-I/643. Maximum Average Subarray I.go
@@ -0,0 +1,21 @@
+package leetcode
+
+func findMaxAverage(nums []int, k int) float64 {
+ sum := 0
+ for _, v := range nums[:k] {
+ sum += v
+ }
+ maxSum := sum
+ for i := k; i < len(nums); i++ {
+ sum = sum - nums[i-k] + nums[i]
+ maxSum = max(maxSum, sum)
+ }
+ return float64(maxSum) / float64(k)
+}
+
+func max(a, b int) int {
+ if a > b {
+ return a
+ }
+ return b
+}
diff --git a/leetcode/0643.Maximum-Average-Subarray-I/643. Maximum Average Subarray I_test.go b/leetcode/0643.Maximum-Average-Subarray-I/643. Maximum Average Subarray I_test.go
new file mode 100644
index 000000000..1e23cfe87
--- /dev/null
+++ b/leetcode/0643.Maximum-Average-Subarray-I/643. Maximum Average Subarray I_test.go
@@ -0,0 +1,43 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question643 struct {
+ para643
+ ans643
+}
+
+// para 是参数
+// one 代表第一个参数
+type para643 struct {
+ nums []int
+ k int
+}
+
+// ans 是答案
+// one 代表第一个答案
+type ans643 struct {
+ one float64
+}
+
+func Test_Problem643(t *testing.T) {
+
+ qs := []question643{
+
+ {
+ para643{[]int{1, 12, -5, -6, 50, 3}, 4},
+ ans643{12.75},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 643------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans643, q.para643
+ fmt.Printf("【input】:%v 【output】:%v\n", p, findMaxAverage(p.nums, p.k))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/0643.Maximum-Average-Subarray-I/README.md b/leetcode/0643.Maximum-Average-Subarray-I/README.md
new file mode 100644
index 000000000..0ddfcca6b
--- /dev/null
+++ b/leetcode/0643.Maximum-Average-Subarray-I/README.md
@@ -0,0 +1,52 @@
+# [643. Maximum Average Subarray I](https://leetcode.com/problems/maximum-average-subarray-i/)
+
+## 题目
+
+Given an array consisting of `n` integers, find the contiguous subarray of given length `k` that has the maximum average value. And you need to output the maximum average value.
+
+**Example 1:**
+
+```
+Input: [1,12,-5,-6,50,3], k = 4
+Output: 12.75
+Explanation: Maximum average is (12-5-6+50)/4 = 51/4 = 12.75
+```
+
+**Note:**
+
+1. 1 <= `k` <= `n` <= 30,000.
+2. Elements of the given array will be in the range [-10,000, 10,000].
+
+## 题目大意
+
+给定 n 个整数，找出平均数最大且长度为 k 的连续子数组，并输出该最大平均数。
+
+## 解题思路
+
+- 简单题。循环一次，扫描数组过程中累加窗口大小为 k 的元素值。不断更新这个最大值。循环结束求出平均值即可。
+
+## 代码
+
+```go
+package leetcode
+
+func findMaxAverage(nums []int, k int) float64 {
+ sum := 0
+ for _, v := range nums[:k] {
+ sum += v
+ }
+ maxSum := sum
+ for i := k; i < len(nums); i++ {
+ sum = sum - nums[i-k] + nums[i]
+ maxSum = max(maxSum, sum)
+ }
+ return float64(maxSum) / float64(k)
+}
+
+func max(a, b int) int {
+ if a > b {
+ return a
+ }
+ return b
+}
+```
\ No newline at end of file
diff --git a/leetcode/0647.Palindromic-Substrings/647. Palindromic Substrings.go b/leetcode/0647.Palindromic-Substrings/647. Palindromic Substrings.go
new file mode 100644
index 000000000..01f8f7999
--- /dev/null
+++ b/leetcode/0647.Palindromic-Substrings/647. Palindromic Substrings.go
@@ -0,0 +1,23 @@
+package leetcode
+
+func countSubstrings(s string) int {
+ res := 0
+ for i := 0; i < len(s); i++ {
+ res += countPalindrome(s, i, i)
+ res += countPalindrome(s, i, i+1)
+ }
+ return res
+}
+
+func countPalindrome(s string, left, right int) int {
+ res := 0
+ for left >= 0 && right < len(s) {
+ if s[left] != s[right] {
+ break
+ }
+ left--
+ right++
+ res++
+ }
+ return res
+}
diff --git a/leetcode/0647.Palindromic-Substrings/647. Palindromic Substrings_test.go b/leetcode/0647.Palindromic-Substrings/647. Palindromic Substrings_test.go
new file mode 100644
index 000000000..ed69135ef
--- /dev/null
+++ b/leetcode/0647.Palindromic-Substrings/647. Palindromic Substrings_test.go
@@ -0,0 +1,47 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question647 struct {
+ para647
+ ans647
+}
+
+// para 是参数
+// one 代表第一个参数
+type para647 struct {
+ s string
+}
+
+// ans 是答案
+// one 代表第一个答案
+type ans647 struct {
+ one int
+}
+
+func Test_Problem647(t *testing.T) {
+
+ qs := []question647{
+
+ {
+ para647{"abc"},
+ ans647{3},
+ },
+
+ {
+ para647{"aaa"},
+ ans647{6},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 647------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans647, q.para647
+ fmt.Printf("【input】:%v 【output】:%v\n", p, countSubstrings(p.s))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/0647.Palindromic-Substrings/README.md b/leetcode/0647.Palindromic-Substrings/README.md
new file mode 100644
index 000000000..79d4eae97
--- /dev/null
+++ b/leetcode/0647.Palindromic-Substrings/README.md
@@ -0,0 +1,64 @@
+# [647. Palindromic Substrings](https://leetcode.com/problems/palindromic-substrings/)
+
+
+## 题目
+
+Given a string, your task is to count how many palindromic substrings in this string.
+
+The substrings with different start indexes or end indexes are counted as different substrings even they consist of same characters.
+
+**Example 1:**
+
+```
+Input: "abc"
+Output: 3
+Explanation: Three palindromic strings: "a", "b", "c".
+```
+
+**Example 2:**
+
+```
+Input: "aaa"
+Output: 6
+Explanation: Six palindromic strings: "a", "a", "a", "aa", "aa", "aaa".
+```
+
+**Note:**
+
+1. The input string length won't exceed 1000.
+
+## 题目大意
+
+给定一个字符串，你的任务是计算这个字符串中有多少个回文子串。具有不同开始位置或结束位置的子串，即使是由相同的字符组成，也会被视作不同的子串。
+
+## 解题思路
+
+- 暴力解法，从左往右扫一遍字符串，以每个字符做轴，用中心扩散法，依次遍历计数回文子串。
+
+## 代码
+
+```go
+package leetcode
+
+func countSubstrings(s string) int {
+ res := 0
+ for i := 0; i < len(s); i++ {
+ res += countPalindrome(s, i, i)
+ res += countPalindrome(s, i, i+1)
+ }
+ return res
+}
+
+func countPalindrome(s string, left, right int) int {
+ res := 0
+ for left >= 0 && right < len(s) {
+ if s[left] != s[right] {
+ break
+ }
+ left--
+ right++
+ res++
+ }
+ return res
+}
+```
\ No newline at end of file
diff --git a/leetcode/0648.Replace-Words/648. Replace Words.go b/leetcode/0648.Replace-Words/648. Replace Words.go
index d742af98f..0d26e0756 100644
--- a/leetcode/0648.Replace-Words/648. Replace Words.go
+++ b/leetcode/0648.Replace-Words/648. Replace Words.go
@@ -34,7 +34,7 @@ func findWord(roots map[byte][]string, word []byte) bool {
return false
}
-//解法二 Trie
+// 解法二 Trie
func replaceWords1(dict []string, sentence string) string {
trie := Constructor208()
for _, v := range dict {
diff --git a/leetcode/0653.Two-Sum-IV---Input-is-a-BST/653. Two Sum IV - Input is a BST.go b/leetcode/0653.Two-Sum-IV-Input-is-a-BST/653. Two Sum IV - Input is a BST.go
similarity index 100%
rename from leetcode/0653.Two-Sum-IV---Input-is-a-BST/653. Two Sum IV - Input is a BST.go
rename to leetcode/0653.Two-Sum-IV-Input-is-a-BST/653. Two Sum IV - Input is a BST.go
diff --git a/leetcode/0653.Two-Sum-IV---Input-is-a-BST/653. Two Sum IV - Input is a BST_test.go b/leetcode/0653.Two-Sum-IV-Input-is-a-BST/653. Two Sum IV - Input is a BST_test.go
similarity index 100%
rename from leetcode/0653.Two-Sum-IV---Input-is-a-BST/653. Two Sum IV - Input is a BST_test.go
rename to leetcode/0653.Two-Sum-IV-Input-is-a-BST/653. Two Sum IV - Input is a BST_test.go
diff --git a/leetcode/0653.Two-Sum-IV---Input-is-a-BST/README.md b/leetcode/0653.Two-Sum-IV-Input-is-a-BST/README.md
similarity index 100%
rename from leetcode/0653.Two-Sum-IV---Input-is-a-BST/README.md
rename to leetcode/0653.Two-Sum-IV-Input-is-a-BST/README.md
diff --git a/leetcode/0665.Non-decreasing-Array/665. Non-decreasing Array.go b/leetcode/0665.Non-decreasing-Array/665. Non-decreasing Array.go
new file mode 100644
index 000000000..e0f00296a
--- /dev/null
+++ b/leetcode/0665.Non-decreasing-Array/665. Non-decreasing Array.go
@@ -0,0 +1,17 @@
+package leetcode
+
+func checkPossibility(nums []int) bool {
+ count := 0
+ for i := 0; i < len(nums)-1; i++ {
+ if nums[i] > nums[i+1] {
+ count++
+ if count > 1 {
+ return false
+ }
+ if i > 0 && nums[i+1] < nums[i-1] {
+ nums[i+1] = nums[i]
+ }
+ }
+ }
+ return true
+}
diff --git a/leetcode/0665.Non-decreasing-Array/665. Non-decreasing Array_test.go b/leetcode/0665.Non-decreasing-Array/665. Non-decreasing Array_test.go
new file mode 100644
index 000000000..df3f2acd1
--- /dev/null
+++ b/leetcode/0665.Non-decreasing-Array/665. Non-decreasing Array_test.go
@@ -0,0 +1,47 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question665 struct {
+ para665
+ ans665
+}
+
+// para 是参数
+// one 代表第一个参数
+type para665 struct {
+ nums []int
+}
+
+// ans 是答案
+// one 代表第一个答案
+type ans665 struct {
+ one bool
+}
+
+func Test_Problem665(t *testing.T) {
+
+ qs := []question665{
+
+ {
+ para665{[]int{4, 2, 3}},
+ ans665{true},
+ },
+
+ {
+ para665{[]int{4, 2, 1}},
+ ans665{false},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 665------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans665, q.para665
+ fmt.Printf("【input】:%v 【output】:%v\n", p, checkPossibility(p.nums))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/0665.Non-decreasing-Array/README.md b/leetcode/0665.Non-decreasing-Array/README.md
new file mode 100644
index 000000000..abc759e41
--- /dev/null
+++ b/leetcode/0665.Non-decreasing-Array/README.md
@@ -0,0 +1,59 @@
+# [665. Non-decreasing Array](https://leetcode.com/problems/non-decreasing-array/)
+
+## 题目
+
+Given an array `nums` with `n` integers, your task is to check if it could become non-decreasing by modifying **at most one element**.
+
+We define an array is non-decreasing if `nums[i] <= nums[i + 1]` holds for every `i` (**0-based**) such that (`0 <= i <= n - 2`).
+
+**Example 1:**
+
+```
+Input: nums = [4,2,3]
+Output: true
+Explanation: You could modify the first 4 to 1 to get a non-decreasing array.
+```
+
+**Example 2:**
+
+```
+Input: nums = [4,2,1]
+Output: false
+Explanation: You can't get a non-decreasing array by modify at most one element.
+```
+
+**Constraints:**
+
+- `n == nums.length`
+- `1 <= n <= 104`
+- `-10^5 <= nums[i] <= 10^5`
+
+## 题目大意
+
+给你一个长度为 n 的整数数组，请你判断在 最多 改变 1 个元素的情况下，该数组能否变成一个非递减数列。我们是这样定义一个非递减数列的： 对于数组中任意的 i (0 <= i <= n-2)，总满足 nums[i] <= nums[i + 1]。
+
+## 解题思路
+
+- 简单题。循环扫描数组，找到 `nums[i] > nums[i+1]` 这种递减组合。一旦这种组合超过 2 组，直接返回 false。找到第一组递减组合，需要手动调节一次。如果 `nums[i + 1] < nums[i - 1]`，就算交换 `nums[i+1]` 和 `nums[i]`，交换结束，`nums[i - 1]` 仍然可能大于 `nums[i + 1]`，不满足题意。正确的做法应该是让较小的那个数变大，即 `nums[i + 1] = nums[i]`。两个元素相等满足非递减的要求。
+
+## 代码
+
+```go
+package leetcode
+
+func checkPossibility(nums []int) bool {
+ count := 0
+ for i := 0; i < len(nums)-1; i++ {
+ if nums[i] > nums[i+1] {
+ count++
+ if count > 1 {
+ return false
+ }
+ if i > 0 && nums[i+1] < nums[i-1] {
+ nums[i+1] = nums[i]
+ }
+ }
+ }
+ return true
+}
+```
\ No newline at end of file
diff --git a/leetcode/0667.Beautiful-Arrangement-II/667. Beautiful Arrangement II.go b/leetcode/0667.Beautiful-Arrangement-II/667. Beautiful Arrangement II.go
new file mode 100644
index 000000000..6cbb12666
--- /dev/null
+++ b/leetcode/0667.Beautiful-Arrangement-II/667. Beautiful Arrangement II.go
@@ -0,0 +1,16 @@
+package leetcode
+
+func constructArray(n int, k int) []int {
+ res := []int{}
+ for i := 0; i < n-k-1; i++ {
+ res = append(res, i+1)
+ }
+ for i := n - k; i < n-k+(k+1)/2; i++ {
+ res = append(res, i)
+ res = append(res, 2*n-k-i)
+ }
+ if k%2 == 0 {
+ res = append(res, n-k+(k+1)/2)
+ }
+ return res
+}
diff --git a/leetcode/0667.Beautiful-Arrangement-II/667. Beautiful Arrangement II_test.go b/leetcode/0667.Beautiful-Arrangement-II/667. Beautiful Arrangement II_test.go
new file mode 100644
index 000000000..1b97bfee3
--- /dev/null
+++ b/leetcode/0667.Beautiful-Arrangement-II/667. Beautiful Arrangement II_test.go
@@ -0,0 +1,48 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question667 struct {
+ para667
+ ans667
+}
+
+// para 是参数
+// one 代表第一个参数
+type para667 struct {
+ n int
+ k int
+}
+
+// ans 是答案
+// one 代表第一个答案
+type ans667 struct {
+ one []int
+}
+
+func Test_Problem667(t *testing.T) {
+
+ qs := []question667{
+
+ {
+ para667{3, 1},
+ ans667{[]int{1, 2, 3}},
+ },
+
+ {
+ para667{3, 2},
+ ans667{[]int{1, 3, 2}},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 667------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans667, q.para667
+ fmt.Printf("【input】:%v 【output】:%v\n", p, constructArray(p.n, p.k))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/0667.Beautiful-Arrangement-II/README.md b/leetcode/0667.Beautiful-Arrangement-II/README.md
new file mode 100644
index 000000000..a707cdde7
--- /dev/null
+++ b/leetcode/0667.Beautiful-Arrangement-II/README.md
@@ -0,0 +1,62 @@
+# [667. Beautiful Arrangement II](https://leetcode.com/problems/beautiful-arrangement-ii/)
+
+
+## 题目
+
+Given two integers `n` and `k`, you need to construct a list which contains `n` different positive integers ranging from `1` to `n` and obeys the following requirement:Suppose this list is [a1, a2, a3, ... , an], then the list [|a1 - a2|, |a2 - a3|, |a3 - a4|, ... , |an-1 - an|] has exactly `k` distinct integers.
+
+If there are multiple answers, print any of them.
+
+**Example 1:**
+
+```
+Input: n = 3, k = 1
+Output: [1, 2, 3]
+Explanation: The [1, 2, 3] has three different positive integers ranging from 1 to 3, and the [1, 1] has exactly 1 distinct integer: 1.
+```
+
+**Example 2:**
+
+```
+Input: n = 3, k = 2
+Output: [1, 3, 2]
+Explanation: The [1, 3, 2] has three different positive integers ranging from 1 to 3, and the [2, 1] has exactly 2 distinct integers: 1 and 2.
+```
+
+**Note:**
+
+1. The `n` and `k` are in the range 1 <= k < n <= 10^4.
+
+## 题目大意
+
+给定两个整数 n 和 k，你需要实现一个数组，这个数组包含从 1 到 n 的 n 个不同整数，同时满足以下条件：
+
+- 如果这个数组是 [a1, a2, a3, ... , an] ，那么数组 [|a1 - a2|, |a2 - a3|, |a3 - a4|, ... , |an-1 - an|] 中应该有且仅有 k 个不同整数；.
+- 如果存在多种答案，你只需实现并返回其中任意一种.
+
+## 解题思路
+
+- 先考虑 `k` 最大值的情况。如果把末尾的较大值依次插入到前面的较小值中，形成 `[1，n，2，n-1，3，n-2，……]`，这样排列 `k` 能取到最大值 `n-1` 。`k` 最小值的情况是 `[1，2，3，4，……，n]`，`k` 取到的最小值是 1。那么 `k` 在 `[1，n-1]` 之间取值，该怎么排列呢？先顺序排列 `[1，2，3，4，……，n-k-1]`，这里有 `n-k-1` 个数，可以形成唯一一种差值。剩下 `k+1` 个数，形成 `k-1` 种差值。
+- 这又回到了 `k` 最大值的取法了。`k` 取最大值的情况是 `n` 个数，形成 `n-1` 个不同种的差值。现在 `k+1` 个数，需要形成 `k` 种不同的差值。两者是同一个问题。那么剩下 `k` 个数的排列方法是 `[n-k，n-k+1，…，n]`，这里有 `k` 个数，注意代码实现时，注意 `k` 的奇偶性，如果 `k` 是奇数，“对半穿插”以后，正好匹配完，如果 `k` 是偶数，对半处的数 `n-k+(k+1)/2`，最后还需要单独加入到排列中。
+- 可能有读者会问了，前面生成了 1 种差值，后面这部分又生产了 `k` 种差值，加起来不是 `k + 1` 种差值了么？这种理解是错误的。后面这段最后 2 个数字是 `n-k+(k+1)/2-1` 和 `n-k+(k+1)/2`，它们两者的差值是 1，和第一段构造的排列差值是相同的，都是 1。所以第一段构造了 1 种差值，第二段虽然构造了 `k` 种，但是需要去掉两段重复的差值 1，所以最终差值种类还是 `1 + k - 1 = k` 种。
+
+## 代码
+
+```go
+package leetcode
+
+func constructArray(n int, k int) []int {
+ res := []int{}
+ for i := 0; i < n-k-1; i++ {
+ res = append(res, i+1)
+ }
+ for i := n - k; i < n-k+(k+1)/2; i++ {
+ res = append(res, i)
+ res = append(res, 2*n-k-i)
+ }
+ if k%2 == 0 {
+ res = append(res, n-k+(k+1)/2)
+ }
+ return res
+}
+```
\ No newline at end of file
diff --git a/leetcode/0669.Trim-a-Binary-Search-Tree/669. Trim a Binary Search Tree.go b/leetcode/0669.Trim-a-Binary-Search-Tree/669. Trim a Binary Search Tree.go
new file mode 100644
index 000000000..33ef83df3
--- /dev/null
+++ b/leetcode/0669.Trim-a-Binary-Search-Tree/669. Trim a Binary Search Tree.go
@@ -0,0 +1,32 @@
+package leetcode
+
+import (
+ "github.com/halfrost/LeetCode-Go/structures"
+)
+
+// TreeNode define
+type TreeNode = structures.TreeNode
+
+/**
+ * Definition for a binary tree node.
+ * type TreeNode struct {
+ * Val int
+ * Left *TreeNode
+ * Right *TreeNode
+ * }
+ */
+
+func trimBST(root *TreeNode, low int, high int) *TreeNode {
+ if root == nil {
+ return root
+ }
+ if root.Val > high {
+ return trimBST(root.Left, low, high)
+ }
+ if root.Val < low {
+ return trimBST(root.Right, low, high)
+ }
+ root.Left = trimBST(root.Left, low, high)
+ root.Right = trimBST(root.Right, low, high)
+ return root
+}
diff --git a/leetcode/0669.Trim-a-Binary-Search-Tree/669. Trim a Binary Search Tree_test.go b/leetcode/0669.Trim-a-Binary-Search-Tree/669. Trim a Binary Search Tree_test.go
new file mode 100644
index 000000000..fa407b4d7
--- /dev/null
+++ b/leetcode/0669.Trim-a-Binary-Search-Tree/669. Trim a Binary Search Tree_test.go
@@ -0,0 +1,68 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+
+ "github.com/halfrost/LeetCode-Go/structures"
+)
+
+type question669 struct {
+ para669
+ ans669
+}
+
+// para 是参数
+// one 代表第一个参数
+type para669 struct {
+ one []int
+ low int
+ high int
+}
+
+// ans 是答案
+// one 代表第一个答案
+type ans669 struct {
+ one []int
+}
+
+func Test_Problem669(t *testing.T) {
+
+ qs := []question669{
+
+ {
+ para669{[]int{1, 0, 2}, 1, 2},
+ ans669{[]int{1, structures.NULL, 2}},
+ },
+
+ {
+ para669{[]int{3, 0, 4, structures.NULL, 2, structures.NULL, structures.NULL, 1}, 1, 3},
+ ans669{[]int{3, 2, structures.NULL, 1}},
+ },
+
+ {
+ para669{[]int{1}, 1, 2},
+ ans669{[]int{1}},
+ },
+
+ {
+ para669{[]int{1, structures.NULL, 2}, 1, 3},
+ ans669{[]int{1, structures.NULL, 2}},
+ },
+
+ {
+ para669{[]int{1, structures.NULL, 2}, 2, 4},
+ ans669{[]int{2}},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 669------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans669, q.para669
+ fmt.Printf("【input】:%v ", p)
+ root := structures.Ints2TreeNode(p.one)
+ fmt.Printf("【output】:%v \n", structures.Tree2ints(trimBST(root, p.low, p.high)))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/0669.Trim-a-Binary-Search-Tree/README.md b/leetcode/0669.Trim-a-Binary-Search-Tree/README.md
new file mode 100644
index 000000000..11d0c306b
--- /dev/null
+++ b/leetcode/0669.Trim-a-Binary-Search-Tree/README.md
@@ -0,0 +1,100 @@
+# [669. Trim a Binary Search Tree](https://leetcode.com/problems/trim-a-binary-search-tree/)
+
+
+## 题目
+
+Given the `root` of a binary search tree and the lowest and highest boundaries as `low` and `high`, trim the tree so that all its elements lies in `[low, high]`. Trimming the tree should **not** change the relative structure of the elements that will remain in the tree (i.e., any node's descendant should remain a descendant). It can be proven that there is a **unique answer**.
+
+Return *the root of the trimmed binary search tree*. Note that the root may change depending on the given bounds.
+
+**Example 1:**
+
+
+
+```
+Input: root = [1,0,2], low = 1, high = 2
+Output: [1,null,2]
+```
+
+**Example 2:**
+
+
+
+```
+Input: root = [3,0,4,null,2,null,null,1], low = 1, high = 3
+Output: [3,2,null,1]
+```
+
+**Example 3:**
+
+```
+Input: root = [1], low = 1, high = 2
+Output: [1]
+```
+
+**Example 4:**
+
+```
+Input: root = [1,null,2], low = 1, high = 3
+Output: [1,null,2]
+```
+
+**Example 5:**
+
+```
+Input: root = [1,null,2], low = 2, high = 4
+Output: [2]
+```
+
+**Constraints:**
+
+- The number of nodes in the tree in the range `[1, 10^4]`.
+- `0 <= Node.val <= 10^4`
+- The value of each node in the tree is **unique**.
+- `root` is guaranteed to be a valid binary search tree.
+- `0 <= low <= high <= 10^4`
+
+## 题目大意
+
+给你二叉搜索树的根节点 root ，同时给定最小边界low 和最大边界 high。通过修剪二叉搜索树，使得所有节点的值在[low, high]中。修剪树不应该改变保留在树中的元素的相对结构（即，如果没有被移除，原有的父代子代关系都应当保留）。 可以证明，存在唯一的答案。所以结果应当返回修剪好的二叉搜索树的新的根节点。注意，根节点可能会根据给定的边界发生改变。
+
+## 解题思路
+
+- 这一题考察二叉搜索树中的递归遍历。递归遍历二叉搜索树每个结点，根据有序性，当前结点如果比 high 大，那么当前结点的右子树全部修剪掉，再递归修剪左子树；当前结点如果比 low 小，那么当前结点的左子树全部修剪掉，再递归修剪右子树。处理完越界的情况，剩下的情况都在区间内，分别递归修剪左子树和右子树即可。
+
+## 代码
+
+```go
+package leetcode
+
+import (
+ "github.com/halfrost/LeetCode-Go/structures"
+)
+
+// TreeNode define
+type TreeNode = structures.TreeNode
+
+/**
+ * Definition for a binary tree node.
+ * type TreeNode struct {
+ * Val int
+ * Left *TreeNode
+ * Right *TreeNode
+ * }
+ */
+
+func trimBST(root *TreeNode, low int, high int) *TreeNode {
+ if root == nil {
+ return root
+ }
+ if root.Val > high {
+ return trimBST(root.Left, low, high)
+ }
+ if root.Val < low {
+ return trimBST(root.Right, low, high)
+ }
+ root.Left = trimBST(root.Left, low, high)
+ root.Right = trimBST(root.Right, low, high)
+ return root
+}
+```
\ No newline at end of file
diff --git a/leetcode/0674.Longest-Continuous-Increasing-Subsequence/674. Longest Continuous Increasing Subsequence.go b/leetcode/0674.Longest-Continuous-Increasing-Subsequence/674. Longest Continuous Increasing Subsequence.go
new file mode 100644
index 000000000..c9abaaa3d
--- /dev/null
+++ b/leetcode/0674.Longest-Continuous-Increasing-Subsequence/674. Longest Continuous Increasing Subsequence.go
@@ -0,0 +1,24 @@
+package leetcode
+
+func findLengthOfLCIS(nums []int) int {
+ if len(nums) == 0 {
+ return 0
+ }
+ res, length := 1, 1
+ for i := 1; i < len(nums); i++ {
+ if nums[i] > nums[i-1] {
+ length++
+ } else {
+ res = max(res, length)
+ length = 1
+ }
+ }
+ return max(res, length)
+}
+
+func max(a, b int) int {
+ if a > b {
+ return a
+ }
+ return b
+}
diff --git a/leetcode/0674.Longest-Continuous-Increasing-Subsequence/674. Longest Continuous Increasing Subsequence_test.go b/leetcode/0674.Longest-Continuous-Increasing-Subsequence/674. Longest Continuous Increasing Subsequence_test.go
new file mode 100644
index 000000000..51e5317b5
--- /dev/null
+++ b/leetcode/0674.Longest-Continuous-Increasing-Subsequence/674. Longest Continuous Increasing Subsequence_test.go
@@ -0,0 +1,52 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question674 struct {
+ para674
+ ans674
+}
+
+// para 是参数
+// one 代表第一个参数
+type para674 struct {
+ nums []int
+}
+
+// ans 是答案
+// one 代表第一个答案
+type ans674 struct {
+ one int
+}
+
+func Test_Problem674(t *testing.T) {
+
+ qs := []question674{
+
+ {
+ para674{[]int{1, 3, 5, 4, 7}},
+ ans674{3},
+ },
+
+ {
+ para674{[]int{2, 2, 2, 2, 2}},
+ ans674{1},
+ },
+
+ {
+ para674{[]int{1, 3, 5, 7}},
+ ans674{4},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 674------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans674, q.para674
+ fmt.Printf("【input】:%v 【output】:%v\n", p, findLengthOfLCIS(p.nums))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/0674.Longest-Continuous-Increasing-Subsequence/README.md b/leetcode/0674.Longest-Continuous-Increasing-Subsequence/README.md
new file mode 100644
index 000000000..50f80db9d
--- /dev/null
+++ b/leetcode/0674.Longest-Continuous-Increasing-Subsequence/README.md
@@ -0,0 +1,69 @@
+# [674. Longest Continuous Increasing Subsequence](https://leetcode.com/problems/longest-continuous-increasing-subsequence/)
+
+
+## 题目
+
+Given an unsorted array of integers `nums`, return *the length of the longest **continuous increasing subsequence** (i.e. subarray)*. The subsequence must be **strictly** increasing.
+
+A **continuous increasing subsequence** is defined by two indices `l` and `r` (`l < r`) such that it is `[nums[l], nums[l + 1], ..., nums[r - 1], nums[r]]` and for each `l <= i < r`, `nums[i] < nums[i + 1]`.
+
+**Example 1:**
+
+```
+Input: nums = [1,3,5,4,7]
+Output: 3
+Explanation: The longest continuous increasing subsequence is [1,3,5] with length 3.
+Even though [1,3,5,7] is an increasing subsequence, it is not continuous as elements 5 and 7 are separated by element
+4.
+```
+
+**Example 2:**
+
+```
+Input: nums = [2,2,2,2,2]
+Output: 1
+Explanation: The longest continuous increasing subsequence is [2] with length 1. Note that it must be strictly
+increasing.
+```
+
+**Constraints:**
+
+- `0 <= nums.length <= 10^4`
+- `10^9 <= nums[i] <= 10^9`
+
+## 题目大意
+
+给定一个未经排序的整数数组，找到最长且 连续递增的子序列，并返回该序列的长度。连续递增的子序列 可以由两个下标 l 和 r（l < r）确定，如果对于每个 l <= i < r，都有 nums[i] < nums[i + 1] ，那么子序列 [nums[l], nums[l + 1], ..., nums[r - 1], nums[r]] 就是连续递增子序列。
+
+## 解题思路
+
+- 简单题。这一题和第 128 题有区别。这一题要求子序列必须是连续下标，所以变简单了。扫描一遍数组，记下连续递增序列的长度，动态维护这个最大值，最后输出即可。
+
+## 代码
+
+```go
+package leetcode
+
+func findLengthOfLCIS(nums []int) int {
+ if len(nums) == 0 {
+ return 0
+ }
+ res, length := 1, 1
+ for i := 1; i < len(nums); i++ {
+ if nums[i] > nums[i-1] {
+ length++
+ } else {
+ res = max(res, length)
+ length = 1
+ }
+ }
+ return max(res, length)
+}
+
+func max(a, b int) int {
+ if a > b {
+ return a
+ }
+ return b
+}
+```
\ No newline at end of file
diff --git a/leetcode/0677.Map-Sum-Pairs/677. Map Sum Pairs.go b/leetcode/0677.Map-Sum-Pairs/677. Map Sum Pairs.go
new file mode 100644
index 000000000..e5560741e
--- /dev/null
+++ b/leetcode/0677.Map-Sum-Pairs/677. Map Sum Pairs.go
@@ -0,0 +1,43 @@
+package leetcode
+
+type MapSum struct {
+ keys map[string]int
+}
+
+/** Initialize your data structure here. */
+func Constructor() MapSum {
+ return MapSum{make(map[string]int)}
+}
+
+func (this *MapSum) Insert(key string, val int) {
+ this.keys[key] = val
+}
+
+func (this *MapSum) Sum(prefix string) int {
+ prefixAsRunes, res := []rune(prefix), 0
+ for key, val := range this.keys {
+ if len(key) >= len(prefix) {
+ shouldSum := true
+ for i, char := range key {
+ if i >= len(prefixAsRunes) {
+ break
+ }
+ if prefixAsRunes[i] != char {
+ shouldSum = false
+ break
+ }
+ }
+ if shouldSum {
+ res += val
+ }
+ }
+ }
+ return res
+}
+
+/**
+ * Your MapSum object will be instantiated and called as such:
+ * obj := Constructor();
+ * obj.Insert(key,val);
+ * param_2 := obj.Sum(prefix);
+ */
diff --git a/leetcode/0677.Map-Sum-Pairs/677. Map Sum Pairs_test.go b/leetcode/0677.Map-Sum-Pairs/677. Map Sum Pairs_test.go
new file mode 100644
index 000000000..1be9a3e00
--- /dev/null
+++ b/leetcode/0677.Map-Sum-Pairs/677. Map Sum Pairs_test.go
@@ -0,0 +1,17 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+func Test_Problem677(t *testing.T) {
+ obj := Constructor()
+ fmt.Printf("obj = %v\n", obj)
+ obj.Insert("apple", 3)
+ fmt.Printf("obj = %v\n", obj)
+ fmt.Printf("obj.sum = %v\n", obj.Sum("ap"))
+ obj.Insert("app", 2)
+ fmt.Printf("obj = %v\n", obj)
+ fmt.Printf("obj.sum = %v\n", obj.Sum("ap"))
+}
diff --git a/leetcode/0677.Map-Sum-Pairs/README.md b/leetcode/0677.Map-Sum-Pairs/README.md
new file mode 100644
index 000000000..bad5bc124
--- /dev/null
+++ b/leetcode/0677.Map-Sum-Pairs/README.md
@@ -0,0 +1,100 @@
+# [677. Map Sum Pairs](https://leetcode.com/problems/map-sum-pairs/)
+
+
+## 题目
+
+Design a map that allows you to do the following:
+
+- Maps a string key to a given value.
+- Returns the sum of the values that have a key with a prefix equal to a given string.
+
+Implement the `MapSum` class:
+
+- `MapSum()` Initializes the `MapSum` object.
+- `void insert(String key, int val)` Inserts the `key-val` pair into the map. If the `key` already existed, the original `key-value` pair will be overridden to the new one.
+- `int sum(string prefix)` Returns the sum of all the pairs' value whose `key` starts with the `prefix`.
+
+**Example 1:**
+
+```
+Input
+["MapSum", "insert", "sum", "insert", "sum"]
+[[], ["apple", 3], ["ap"], ["app", 2], ["ap"]]
+Output
+[null, null, 3, null, 5]
+
+Explanation
+MapSum mapSum = new MapSum();
+mapSum.insert("apple", 3);
+mapSum.sum("ap"); // return 3 (apple = 3)
+mapSum.insert("app", 2);
+mapSum.sum("ap"); // return 5 (apple +app = 3 + 2 = 5)
+
+```
+
+**Constraints:**
+
+- `1 <= key.length, prefix.length <= 50`
+- `key` and `prefix` consist of only lowercase English letters.
+- `1 <= val <= 1000`
+- At most `50` calls will be made to `insert` and `sum`.
+
+## 题目大意
+
+实现一个 MapSum 类，支持两个方法，insert 和 sum：
+
+- MapSum() 初始化 MapSum 对象
+- void insert(String key, int val) 插入 key-val 键值对，字符串表示键 key ，整数表示值 val 。如果键 key 已经存在，那么原来的键值对将被替代成新的键值对。
+- int sum(string prefix) 返回所有以该前缀 prefix 开头的键 key 的值的总和。
+
+## 解题思路
+
+- 简单题。用一个 map 存储数据，Insert() 方法即存储 key-value。Sum() 方法即累加满足条件前缀对应的 value。判断是否满足条件，先根据前缀长度来判断，只有长度大于等于 prefix 长度才可能满足要求。如果 key 是具有 prefix 前缀的，那么累加上这个值。最后输出总和即可。
+
+## 代码
+
+```go
+package leetcode
+
+type MapSum struct {
+ keys map[string]int
+}
+
+/** Initialize your data structure here. */
+func Constructor() MapSum {
+ return MapSum{make(map[string]int)}
+}
+
+func (this *MapSum) Insert(key string, val int) {
+ this.keys[key] = val
+}
+
+func (this *MapSum) Sum(prefix string) int {
+ prefixAsRunes, res := []rune(prefix), 0
+ for key, val := range this.keys {
+ if len(key) >= len(prefix) {
+ shouldSum := true
+ for i, char := range key {
+ if i >= len(prefixAsRunes) {
+ break
+ }
+ if prefixAsRunes[i] != char {
+ shouldSum = false
+ break
+ }
+ }
+ if shouldSum {
+ res += val
+ }
+ }
+ }
+ return res
+}
+
+/**
+ * Your MapSum object will be instantiated and called as such:
+ * obj := Constructor();
+ * obj.Insert(key,val);
+ * param_2 := obj.Sum(prefix);
+ */
+```
\ No newline at end of file
diff --git a/leetcode/0690.Employee-Importance/690. Employee Importance.go b/leetcode/0690.Employee-Importance/690. Employee Importance.go
new file mode 100644
index 000000000..a13ace46d
--- /dev/null
+++ b/leetcode/0690.Employee-Importance/690. Employee Importance.go
@@ -0,0 +1,26 @@
+package leetcode
+
+type Employee struct {
+ Id int
+ Importance int
+ Subordinates []int
+}
+
+func getImportance(employees []*Employee, id int) int {
+ m, queue, res := map[int]*Employee{}, []int{id}, 0
+ for _, e := range employees {
+ m[e.Id] = e
+ }
+ for len(queue) > 0 {
+ e := m[queue[0]]
+ queue = queue[1:]
+ if e == nil {
+ continue
+ }
+ res += e.Importance
+ for _, i := range e.Subordinates {
+ queue = append(queue, i)
+ }
+ }
+ return res
+}
diff --git a/leetcode/0690.Employee-Importance/690. Employee Importance_test.go b/leetcode/0690.Employee-Importance/690. Employee Importance_test.go
new file mode 100644
index 000000000..401a24bb6
--- /dev/null
+++ b/leetcode/0690.Employee-Importance/690. Employee Importance_test.go
@@ -0,0 +1,43 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question690 struct {
+ para690
+ ans690
+}
+
+// para 是参数
+// one 代表第一个参数
+type para690 struct {
+ employees []*Employee
+ id int
+}
+
+// ans 是答案
+// one 代表第一个答案
+type ans690 struct {
+ one int
+}
+
+func Test_Problem690(t *testing.T) {
+
+ qs := []question690{
+
+ {
+ para690{[]*Employee{{1, 5, []int{2, 3}}, {2, 3, []int{}}, {3, 3, []int{}}}, 1},
+ ans690{11},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 690------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans690, q.para690
+ fmt.Printf("【input】:%v 【output】:%v\n", p, getImportance(p.employees, p.id))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/0690.Employee-Importance/README.md b/leetcode/0690.Employee-Importance/README.md
new file mode 100644
index 000000000..24ee99817
--- /dev/null
+++ b/leetcode/0690.Employee-Importance/README.md
@@ -0,0 +1,62 @@
+# [690. Employee Importance](https://leetcode.com/problems/employee-importance/)
+
+## 题目
+
+You are given a data structure of employee information, which includes the employee's **unique id**, their **importance value** and their **direct** subordinates' id.
+
+For example, employee 1 is the leader of employee 2, and employee 2 is the leader of employee 3. They have importance value 15, 10 and 5, respectively. Then employee 1 has a data structure like [1, 15, [2]], and employee 2 has [2, 10, [3]], and employee 3 has [3, 5, []]. Note that although employee 3 is also a subordinate of employee 1, the relationship is **not direct**.
+
+Now given the employee information of a company, and an employee id, you need to return the total importance value of this employee and all their subordinates.
+
+**Example 1:**
+
+```
+Input: [[1, 5, [2, 3]], [2, 3, []], [3, 3, []]], 1
+Output: 11
+Explanation:
+Employee 1 has importance value 5, and he has two direct subordinates: employee 2 and employee 3. They both have importance value 3. So the total importance value of employee 1 is 5 + 3 + 3 = 11.
+```
+
+**Note:**
+
+1. One employee has at most one **direct** leader and may have several subordinates.
+2. The maximum number of employees won't exceed 2000.
+
+## 题目大意
+
+给定一个保存员工信息的数据结构，它包含了员工 唯一的 id ，重要度 和 直系下属的 id 。比如，员工 1 是员工 2 的领导，员工 2 是员工 3 的领导。他们相应的重要度为 15 , 10 , 5 。那么员工 1 的数据结构是 [1, 15, [2]] ，员工 2的 数据结构是 [2, 10, [3]] ，员工 3 的数据结构是 [3, 5, []] 。注意虽然员工 3 也是员工 1 的一个下属，但是由于 并不是直系 下属，因此没有体现在员工 1 的数据结构中。现在输入一个公司的所有员工信息，以及单个员工 id ，返回这个员工和他所有下属的重要度之和。
+
+## 解题思路
+
+- 简单题。根据题意，DFS 或者 BFS 搜索找到所求 id 下属所有员工，累加下属员工的重要度，最后再加上这个员工本身的重要度，即为所求。
+
+## 代码
+
+```go
+package leetcode
+
+type Employee struct {
+ Id int
+ Importance int
+ Subordinates []int
+}
+
+func getImportance(employees []*Employee, id int) int {
+ m, queue, res := map[int]*Employee{}, []int{id}, 0
+ for _, e := range employees {
+ m[e.Id] = e
+ }
+ for len(queue) > 0 {
+ e := m[queue[0]]
+ queue = queue[1:]
+ if e == nil {
+ continue
+ }
+ res += e.Importance
+ for _, i := range e.Subordinates {
+ queue = append(queue, i)
+ }
+ }
+ return res
+}
+```
\ No newline at end of file
diff --git a/leetcode/0692.Top-K-Frequent-Words/692. Top K Frequent Words.go b/leetcode/0692.Top-K-Frequent-Words/692. Top K Frequent Words.go
new file mode 100644
index 000000000..4b739ffb2
--- /dev/null
+++ b/leetcode/0692.Top-K-Frequent-Words/692. Top K Frequent Words.go
@@ -0,0 +1,50 @@
+package leetcode
+
+import "container/heap"
+
+func topKFrequent(words []string, k int) []string {
+ m := map[string]int{}
+ for _, word := range words {
+ m[word]++
+ }
+ pq := &PQ{}
+ heap.Init(pq)
+ for w, c := range m {
+ heap.Push(pq, &wordCount{w, c})
+ if pq.Len() > k {
+ heap.Pop(pq)
+ }
+ }
+ res := make([]string, k)
+ for i := k - 1; i >= 0; i-- {
+ wc := heap.Pop(pq).(*wordCount)
+ res[i] = wc.word
+ }
+ return res
+}
+
+type wordCount struct {
+ word string
+ cnt int
+}
+
+type PQ []*wordCount
+
+func (pq PQ) Len() int { return len(pq) }
+func (pq PQ) Swap(i, j int) { pq[i], pq[j] = pq[j], pq[i] }
+func (pq PQ) Less(i, j int) bool {
+ if pq[i].cnt == pq[j].cnt {
+ return pq[i].word > pq[j].word
+ }
+ return pq[i].cnt < pq[j].cnt
+}
+func (pq *PQ) Push(x interface{}) {
+ tmp := x.(*wordCount)
+ *pq = append(*pq, tmp)
+}
+func (pq *PQ) Pop() interface{} {
+ n := len(*pq)
+ tmp := (*pq)[n-1]
+ *pq = (*pq)[:n-1]
+ return tmp
+}
diff --git a/leetcode/0692.Top-K-Frequent-Words/692. Top K Frequent Words_test.go b/leetcode/0692.Top-K-Frequent-Words/692. Top K Frequent Words_test.go
new file mode 100644
index 000000000..97221e3ef
--- /dev/null
+++ b/leetcode/0692.Top-K-Frequent-Words/692. Top K Frequent Words_test.go
@@ -0,0 +1,48 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question692 struct {
+ para692
+ ans692
+}
+
+// para 是参数
+// one 代表第一个参数
+type para692 struct {
+ words []string
+ k int
+}
+
+// ans 是答案
+// one 代表第一个答案
+type ans692 struct {
+ one []string
+}
+
+func Test_Problem692(t *testing.T) {
+
+ qs := []question692{
+
+ {
+ para692{[]string{"i", "love", "leetcode", "i", "love", "coding"}, 2},
+ ans692{[]string{"i", "love"}},
+ },
+
+ {
+ para692{[]string{"the", "day", "is", "sunny", "the", "the", "the", "sunny", "is", "is"}, 4},
+ ans692{[]string{"the", "is", "sunny", "day"}},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 692------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans692, q.para692
+ fmt.Printf("【input】:%v 【output】:%v\n", p, topKFrequent(p.words, p.k))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/0692.Top-K-Frequent-Words/README.md b/leetcode/0692.Top-K-Frequent-Words/README.md
new file mode 100644
index 000000000..54a858d32
--- /dev/null
+++ b/leetcode/0692.Top-K-Frequent-Words/README.md
@@ -0,0 +1,98 @@
+# [692. Top K Frequent Words](https://leetcode.com/problems/top-k-frequent-words/)
+
+
+## 题目
+
+Given a non-empty list of words, return the k most frequent elements.
+
+Your answer should be sorted by frequency from highest to lowest. If two words have the same frequency, then the word with the lower alphabetical order comes first.
+
+**Example 1:**
+
+```
+Input: ["i", "love", "leetcode", "i", "love", "coding"], k = 2
+Output: ["i", "love"]
+Explanation: "i" and "love" are the two most frequent words.
+ Note that "i" comes before "love" due to a lower alphabetical order.
+```
+
+**Example 2:**
+
+```
+Input: ["the", "day", "is", "sunny", "the", "the", "the", "sunny", "is", "is"], k = 4
+Output: ["the", "is", "sunny", "day"]
+Explanation: "the", "is", "sunny" and "day" are the four most frequent words,
+ with the number of occurrence being 4, 3, 2 and 1 respectively.
+```
+
+**Note:**
+
+1. You may assume k is always valid, 1 ≤ k ≤ number of unique elements.
+2. Input words contain only lowercase letters.
+
+**Follow up:**
+
+1. Try to solve it in O(n log k) time and O(n) extra space.
+
+## 题目大意
+
+给一非空的单词列表，返回前 *k* 个出现次数最多的单词。返回的答案应该按单词出现频率由高到低排序。如果不同的单词有相同出现频率，按字母顺序排序。
+
+## 解题思路
+
+- 思路很简单的题。维护一个长度为 k 的最大堆，先按照频率排，如果频率相同再按照字母顺序排。最后输出依次将优先队列里面的元素 pop 出来即可。
+
+## 代码
+
+```go
+package leetcode
+
+import "container/heap"
+
+func topKFrequent(words []string, k int) []string {
+ m := map[string]int{}
+ for _, word := range words {
+ m[word]++
+ }
+ pq := &PQ{}
+ heap.Init(pq)
+ for w, c := range m {
+ heap.Push(pq, &wordCount{w, c})
+ if pq.Len() > k {
+ heap.Pop(pq)
+ }
+ }
+ res := make([]string, k)
+ for i := k - 1; i >= 0; i-- {
+ wc := heap.Pop(pq).(*wordCount)
+ res[i] = wc.word
+ }
+ return res
+}
+
+type wordCount struct {
+ word string
+ cnt int
+}
+
+type PQ []*wordCount
+
+func (pq PQ) Len() int { return len(pq) }
+func (pq PQ) Swap(i, j int) { pq[i], pq[j] = pq[j], pq[i] }
+func (pq PQ) Less(i, j int) bool {
+ if pq[i].cnt == pq[j].cnt {
+ return pq[i].word > pq[j].word
+ }
+ return pq[i].cnt < pq[j].cnt
+}
+func (pq *PQ) Push(x interface{}) {
+ tmp := x.(*wordCount)
+ *pq = append(*pq, tmp)
+}
+func (pq *PQ) Pop() interface{} {
+ n := len(*pq)
+ tmp := (*pq)[n-1]
+ *pq = (*pq)[:n-1]
+ return tmp
+}
+```
\ No newline at end of file
diff --git a/leetcode/0696.Count-Binary-Substrings/696. Count Binary Substrings.go b/leetcode/0696.Count-Binary-Substrings/696. Count Binary Substrings.go
new file mode 100644
index 000000000..a1c8559cc
--- /dev/null
+++ b/leetcode/0696.Count-Binary-Substrings/696. Count Binary Substrings.go
@@ -0,0 +1,21 @@
+package leetcode
+
+func countBinarySubstrings(s string) int {
+ last, res := 0, 0
+ for i := 0; i < len(s); {
+ c, count := s[i], 1
+ for i++; i < len(s) && s[i] == c; i++ {
+ count++
+ }
+ res += min(count, last)
+ last = count
+ }
+ return res
+}
+
+func min(a, b int) int {
+ if a < b {
+ return a
+ }
+ return b
+}
diff --git a/leetcode/0696.Count-Binary-Substrings/696. Count Binary Substrings_test.go b/leetcode/0696.Count-Binary-Substrings/696. Count Binary Substrings_test.go
new file mode 100644
index 000000000..557a39ed4
--- /dev/null
+++ b/leetcode/0696.Count-Binary-Substrings/696. Count Binary Substrings_test.go
@@ -0,0 +1,57 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question696 struct {
+ para696
+ ans696
+}
+
+// para 是参数
+// one 代表第一个参数
+type para696 struct {
+ one string
+}
+
+// ans 是答案
+// one 代表第一个答案
+type ans696 struct {
+ one int
+}
+
+func Test_Problem696(t *testing.T) {
+
+ qs := []question696{
+
+ {
+ para696{"00110011"},
+ ans696{6},
+ },
+
+ {
+ para696{"10101"},
+ ans696{4},
+ },
+
+ {
+ para696{"0110001111"},
+ ans696{6},
+ },
+
+ {
+ para696{"0001111"},
+ ans696{3},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 696------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans696, q.para696
+ fmt.Printf("【input】:%v 【output】:%v\n", p, countBinarySubstrings(p.one))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/0696.Count-Binary-Substrings/README.md b/leetcode/0696.Count-Binary-Substrings/README.md
new file mode 100644
index 000000000..f0fb15e09
--- /dev/null
+++ b/leetcode/0696.Count-Binary-Substrings/README.md
@@ -0,0 +1,69 @@
+# [696. Count Binary Substrings](https://leetcode.com/problems/count-binary-substrings/)
+
+
+## 题目
+
+Give a string `s`, count the number of non-empty (contiguous) substrings that have the same number of 0's and 1's, and all the 0's and all the 1's in these substrings are grouped consecutively.
+
+Substrings that occur multiple times are counted the number of times they occur.
+
+**Example 1:**
+
+```
+Input: "00110011"
+Output: 6
+Explanation: There are 6 substrings that have equal number of consecutive 1's and 0's: "0011", "01", "1100", "10", "0011", and "01".
+
+Notice that some of these substrings repeat and are counted the number of times they occur.
+
+Also, "00110011" is not a valid substring becauseall the 0's (and 1's) are not grouped together.
+
+```
+
+**Example 2:**
+
+```
+Input: "10101"
+Output: 4
+Explanation: There are 4 substrings: "10", "01", "10", "01" that have equal number of consecutive 1's and 0's.
+
+```
+
+**Note:**
+
+- `s.length` will be between 1 and 50,000.
+- `s` will only consist of "0" or "1" characters.
+
+## 题目大意
+
+给定一个字符串 s，计算具有相同数量 0 和 1 的非空（连续）子字符串的数量，并且这些子字符串中的所有 0 和所有 1 都是连续的。重复出现的子串要计算它们出现的次数。
+
+## 解题思路
+
+- 简单题。先分组统计 0 和 1 的个数，例如，`0110001111` 按照 0 和 1 分组统计出来的结果是 [1, 2, 3, 4]。再拼凑结果。相邻 2 组取两者最短的，例如 `0110001111`，凑成的结果应该是 min(1,2)，min(2,3)，min(3,4)，即 `01`，`01`，`10`，`1100`，`0011`，`000111`。时间复杂度 O(n)，空间复杂度 O(1)。
+
+## 代码
+
+```go
+package leetcode
+
+func countBinarySubstrings(s string) int {
+ last, res := 0, 0
+ for i := 0; i < len(s); {
+ c, count := s[i], 1
+ for i++; i < len(s) && s[i] == c; i++ {
+ count++
+ }
+ res += min(count, last)
+ last = count
+ }
+ return res
+}
+
+func min(a, b int) int {
+ if a < b {
+ return a
+ }
+ return b
+}
+```
\ No newline at end of file
diff --git a/leetcode/0700.Search-in-a-Binary-Search-Tree/700.Search in a Binary Search Tree.go b/leetcode/0700.Search-in-a-Binary-Search-Tree/700.Search in a Binary Search Tree.go
new file mode 100644
index 000000000..22c8d5a56
--- /dev/null
+++ b/leetcode/0700.Search-in-a-Binary-Search-Tree/700.Search in a Binary Search Tree.go
@@ -0,0 +1,30 @@
+package leetcode
+
+import (
+ "github.com/halfrost/LeetCode-Go/structures"
+)
+
+// TreeNode define
+type TreeNode = structures.TreeNode
+
+/**
+ * Definition for a binary tree node.
+ * type TreeNode struct {
+ * Val int
+ * Left *TreeNode
+ * Right *TreeNode
+ * }
+ */
+
+func searchBST(root *TreeNode, val int) *TreeNode {
+ if root == nil {
+ return nil
+ }
+ if root.Val == val {
+ return root
+ } else if root.Val < val {
+ return searchBST(root.Right, val)
+ } else {
+ return searchBST(root.Left, val)
+ }
+}
diff --git a/leetcode/0700.Search-in-a-Binary-Search-Tree/700.Search in a Binary Search Tree_test.go b/leetcode/0700.Search-in-a-Binary-Search-Tree/700.Search in a Binary Search Tree_test.go
new file mode 100644
index 000000000..ba678bc25
--- /dev/null
+++ b/leetcode/0700.Search-in-a-Binary-Search-Tree/700.Search in a Binary Search Tree_test.go
@@ -0,0 +1,51 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question700 struct {
+ para700
+ ans700
+}
+
+// para 是参数
+type para700 struct {
+ root *TreeNode
+ val int
+}
+
+// ans 是答案
+type ans700 struct {
+ ans *TreeNode
+}
+
+func Test_Problem700(t *testing.T) {
+
+ qs := []question700{
+ {
+ para700{&TreeNode{Val: 4,
+ Left: &TreeNode{Val: 2, Left: &TreeNode{Val: 1, Left: nil, Right: nil}, Right: &TreeNode{Val: 3, Left: nil, Right: nil}},
+ Right: &TreeNode{Val: 7, Left: nil, Right: nil}},
+ 2},
+ ans700{&TreeNode{Val: 2, Left: &TreeNode{Val: 1, Left: nil, Right: nil}, Right: &TreeNode{Val: 3, Left: nil, Right: nil}}},
+ },
+
+ {
+ para700{&TreeNode{Val: 4,
+ Left: &TreeNode{Val: 2, Left: &TreeNode{Val: 1, Left: nil, Right: nil}, Right: &TreeNode{Val: 3, Left: nil, Right: nil}},
+ Right: &TreeNode{Val: 7, Left: nil, Right: nil}},
+ 5},
+ ans700{nil},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 700------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans700, q.para700
+ fmt.Printf("【input】:%v 【output】:%v\n", p, searchBST(p.root, p.val))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/0700.Search-in-a-Binary-Search-Tree/README.md b/leetcode/0700.Search-in-a-Binary-Search-Tree/README.md
new file mode 100644
index 000000000..9079e64fc
--- /dev/null
+++ b/leetcode/0700.Search-in-a-Binary-Search-Tree/README.md
@@ -0,0 +1,73 @@
+# [700. Search in a Binary Search Tree](https://leetcode.com/problems/search-in-a-binary-search-tree/)
+
+## 题目
+
+You are given the root of a binary search tree (BST) and an integer val.
+
+Find the node in the BST that the node's value equals val and return the subtree rooted with that node. If such a node does not exist, return null.
+
+**Example 1**:
+
+
+
+ Input: root = [4,2,7,1,3], val = 2
+ Output: [2,1,3]
+
+**Example 2**:
+
+
+
+ Input: root = [4,2,7,1,3], val = 5
+ Output: []
+
+**Constraints:**
+
+- The number of nodes in the tree is in the range [1, 5000].
+- 1 <= Node.val <= 10000000
+- root is a binary search tree.
+- 1 <= val <= 10000000
+
+## 题目大意
+
+给定二叉搜索树（BST）的根节点和一个值。 你需要在BST中找到节点值等于给定值的节点。 返回以该节点为根的子树。 如果节点不存在，则返回 NULL。
+
+## 解题思路
+
+- 根据二叉搜索树的性质(根节点的值大于左子树所有节点的值，小于右子树所有节点的值),进行递归求解
+
+## 代码
+
+```go
+
+package leetcode
+
+import (
+ "github.com/halfrost/LeetCode-Go/structures"
+)
+
+// TreeNode define
+type TreeNode = structures.TreeNode
+
+/**
+ * Definition for a binary tree node.
+ * type TreeNode struct {
+ * Val int
+ * Left *TreeNode
+ * Right *TreeNode
+ * }
+ */
+
+func searchBST(root *TreeNode, val int) *TreeNode {
+ if root == nil {
+ return nil
+ }
+ if root.Val == val {
+ return root
+ } else if root.Val < val {
+ return searchBST(root.Right, val)
+ } else {
+ return searchBST(root.Left, val)
+ }
+}
+
+```
\ No newline at end of file
diff --git a/leetcode/0701.Insert-into-a-Binary-Search-Tree/701. Insert into a Binary Search Tree.go b/leetcode/0701.Insert-into-a-Binary-Search-Tree/701. Insert into a Binary Search Tree.go
new file mode 100644
index 000000000..7333d0318
--- /dev/null
+++ b/leetcode/0701.Insert-into-a-Binary-Search-Tree/701. Insert into a Binary Search Tree.go
@@ -0,0 +1,30 @@
+package leetcode
+
+import "github.com/halfrost/LeetCode-Go/structures"
+
+// TreeNode define
+type TreeNode = structures.TreeNode
+
+/**
+ * Definition for a binary tree node.
+ * type TreeNode struct {
+ * Val int
+ * Left *TreeNode
+ * Right *TreeNode
+ * }
+ */
+func insert(n *TreeNode, val int) *TreeNode {
+ if n == nil {
+ return &TreeNode{Val: val}
+ }
+ if n.Val < val {
+ n.Right = insert(n.Right, val)
+ } else {
+ n.Left = insert(n.Left, val)
+ }
+ return n
+}
+
+func insertIntoBST(root *TreeNode, val int) *TreeNode {
+ return insert(root, val)
+}
diff --git a/leetcode/0701.Insert-into-a-Binary-Search-Tree/701. Insert into a Binary Search Tree_test.go b/leetcode/0701.Insert-into-a-Binary-Search-Tree/701. Insert into a Binary Search Tree_test.go
new file mode 100644
index 000000000..d9e55f4c5
--- /dev/null
+++ b/leetcode/0701.Insert-into-a-Binary-Search-Tree/701. Insert into a Binary Search Tree_test.go
@@ -0,0 +1,57 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+
+ "github.com/halfrost/LeetCode-Go/structures"
+)
+
+type question701 struct {
+ para701
+ ans701
+}
+
+// para 是参数
+// one 代表第一个参数
+type para701 struct {
+ root []int
+ val int
+}
+
+// ans 是答案
+// one 代表第一个答案
+type ans701 struct {
+ one []int
+}
+
+func Test_Problem701(t *testing.T) {
+
+ qs := []question701{
+
+ {
+ para701{[]int{4, 2, 7, 1, 3}, 5},
+ ans701{[]int{4, 2, 7, 1, 3, 5}},
+ },
+
+ {
+ para701{[]int{40, 20, 60, 10, 30, 50, 70}, 25},
+ ans701{[]int{40, 20, 60, 10, 30, 50, 70, structures.NULL, structures.NULL, 25}},
+ },
+
+ {
+ para701{[]int{4, 2, 7, 1, 3, structures.NULL, structures.NULL, structures.NULL, structures.NULL, structures.NULL, structures.NULL}, 5},
+ ans701{[]int{4, 2, 7, 1, 3, 5}},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 701------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans701, q.para701
+ fmt.Printf("【input】:%v ", p)
+ rootOne := structures.Ints2TreeNode(p.root)
+ fmt.Printf("【output】:%v \n", structures.Tree2ints(insertIntoBST(rootOne, p.val)))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/0701.Insert-into-a-Binary-Search-Tree/README.md b/leetcode/0701.Insert-into-a-Binary-Search-Tree/README.md
new file mode 100644
index 000000000..fc4d504c6
--- /dev/null
+++ b/leetcode/0701.Insert-into-a-Binary-Search-Tree/README.md
@@ -0,0 +1,88 @@
+# [701. Insert into a Binary Search Tree](https://leetcode.com/problems/insert-into-a-binary-search-tree/)
+
+
+## 题目
+
+You are given the `root` node of a binary search tree (BST) and a `value` to insert into the tree. Return *the root node of the BST after the insertion*. It is **guaranteed** that the new value does not exist in the original BST.
+
+**Notice** that there may exist multiple valid ways for the insertion, as long as the tree remains a BST after insertion. You can return **any of them**.
+
+**Example 1:**
+
+
+
+```
+Input: root = [4,2,7,1,3], val = 5
+Output: [4,2,7,1,3,5]
+Explanation: Another accepted tree is:
+
+```
+
+
+
+**Example 2:**
+
+```
+Input: root = [40,20,60,10,30,50,70], val = 25
+Output: [40,20,60,10,30,50,70,null,null,25]
+
+```
+
+**Example 3:**
+
+```
+Input: root = [4,2,7,1,3,null,null,null,null,null,null], val = 5
+Output: [4,2,7,1,3,5]
+
+```
+
+**Constraints:**
+
+- The number of nodes in the tree will be in the range `[0, 104]`.
+- `108 <= Node.val <= 108`
+- All the values `Node.val` are **unique**.
+- `108 <= val <= 108`
+- It's **guaranteed** that `val` does not exist in the original BST.
+
+## 题目大意
+
+给定二叉搜索树（BST）的根节点和要插入树中的值，将值插入二叉搜索树。 返回插入后二叉搜索树的根节点。 输入数据 保证 ，新值和原始二叉搜索树中的任意节点值都不同。注意，可能存在多种有效的插入方式，只要树在插入后仍保持为二叉搜索树即可。 你可以返回 任意有效的结果 。
+
+## 解题思路
+
+- 简单题。插入节点的方法有多种，笔者这里选择一种简单的方法。从根开始遍历这个二叉树，当前节点的值比待插入节点的值小，则往右遍历；当前节点的值比待插入节点的值大，则往左遍历。最后遍历到空节点便是要插入的地方。
+
+## 代码
+
+```go
+package leetcode
+
+import "github.com/halfrost/LeetCode-Go/structures"
+
+// TreeNode define
+type TreeNode = structures.TreeNode
+
+/**
+ * Definition for a binary tree node.
+ * type TreeNode struct {
+ * Val int
+ * Left *TreeNode
+ * Right *TreeNode
+ * }
+ */
+func insert(n *TreeNode, val int) *TreeNode {
+ if n == nil {
+ return &TreeNode{Val: val}
+ }
+ if n.Val < val {
+ n.Right = insert(n.Right, val)
+ } else {
+ n.Left = insert(n.Left, val)
+ }
+ return n
+}
+
+func insertIntoBST(root *TreeNode, val int) *TreeNode {
+ return insert(root, val)
+}
+```
\ No newline at end of file
diff --git a/leetcode/0703.Kth-Largest-Element-in-a-Stream/703. Kth Largest Element in a Stream.go b/leetcode/0703.Kth-Largest-Element-in-a-Stream/703. Kth Largest Element in a Stream.go
new file mode 100644
index 000000000..c83b54ece
--- /dev/null
+++ b/leetcode/0703.Kth-Largest-Element-in-a-Stream/703. Kth Largest Element in a Stream.go
@@ -0,0 +1,38 @@
+package leetcode
+
+import (
+ "container/heap"
+ "sort"
+)
+
+type KthLargest struct {
+ sort.IntSlice
+ k int
+}
+
+func Constructor(k int, nums []int) KthLargest {
+ kl := KthLargest{k: k}
+ for _, val := range nums {
+ kl.Add(val)
+ }
+ return kl
+}
+
+func (kl *KthLargest) Push(v interface{}) {
+ kl.IntSlice = append(kl.IntSlice, v.(int))
+}
+
+func (kl *KthLargest) Pop() interface{} {
+ a := kl.IntSlice
+ v := a[len(a)-1]
+ kl.IntSlice = a[:len(a)-1]
+ return v
+}
+
+func (kl *KthLargest) Add(val int) int {
+ heap.Push(kl, val)
+ if kl.Len() > kl.k {
+ heap.Pop(kl)
+ }
+ return kl.IntSlice[0]
+}
diff --git a/leetcode/0703.Kth-Largest-Element-in-a-Stream/703. Kth Largest Element in a Stream_test.go b/leetcode/0703.Kth-Largest-Element-in-a-Stream/703. Kth Largest Element in a Stream_test.go
new file mode 100644
index 000000000..448a2b47d
--- /dev/null
+++ b/leetcode/0703.Kth-Largest-Element-in-a-Stream/703. Kth Largest Element in a Stream_test.go
@@ -0,0 +1,15 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+func Test_Problem703(t *testing.T) {
+ obj := Constructor(3, []int{4, 5, 8, 2})
+ fmt.Printf("Add 7 = %v\n", obj.Add(3))
+ fmt.Printf("Add 7 = %v\n", obj.Add(5))
+ fmt.Printf("Add 7 = %v\n", obj.Add(10))
+ fmt.Printf("Add 7 = %v\n", obj.Add(9))
+ fmt.Printf("Add 7 = %v\n", obj.Add(4))
+}
diff --git a/leetcode/0703.Kth-Largest-Element-in-a-Stream/README.md b/leetcode/0703.Kth-Largest-Element-in-a-Stream/README.md
new file mode 100644
index 000000000..4a41c9f55
--- /dev/null
+++ b/leetcode/0703.Kth-Largest-Element-in-a-Stream/README.md
@@ -0,0 +1,93 @@
+# [703. Kth Largest Element in a Stream](https://leetcode.com/problems/kth-largest-element-in-a-stream/)
+
+## 题目
+
+Design a class to find the `kth` largest element in a stream. Note that it is the `kth` largest element in the sorted order, not the `kth` distinct element.
+
+Implement `KthLargest` class:
+
+- `KthLargest(int k, int[] nums)` Initializes the object with the integer `k` and the stream of integers `nums`.
+- `int add(int val)` Returns the element representing the `kth` largest element in the stream.
+
+**Example 1:**
+
+```
+Input
+["KthLargest", "add", "add", "add", "add", "add"]
+[[3, [4, 5, 8, 2]], [3], [5], [10], [9], [4]]
+Output
+[null, 4, 5, 5, 8, 8]
+
+Explanation
+KthLargest kthLargest = new KthLargest(3, [4, 5, 8, 2]);
+kthLargest.add(3); // return 4
+kthLargest.add(5); // return 5
+kthLargest.add(10); // return 5
+kthLargest.add(9); // return 8
+kthLargest.add(4); // return 8
+
+```
+
+**Constraints:**
+
+- `1 <= k <= 104`
+- `0 <= nums.length <= 104`
+- `104 <= nums[i] <= 104`
+- `104 <= val <= 104`
+- At most `104` calls will be made to `add`.
+- It is guaranteed that there will be at least `k` elements in the array when you search for the `kth` element.
+
+## 题目大意
+
+设计一个找到数据流中第 k 大元素的类（class）。注意是排序后的第 k 大元素，不是第 k 个不同的元素。请实现 KthLargest 类：
+
+- KthLargest(int k, int[] nums) 使用整数 k 和整数流 nums 初始化对象。
+- int add(int val) 将 val 插入数据流 nums 后，返回当前数据流中第 k 大的元素。
+
+## 解题思路
+
+- 读完题就能明白这一题考察的是最小堆。构建一个长度为 K 的最小堆，每次 pop 堆首(堆中最小的元素)，维护堆首即为第 K 大元素。
+- 这里有一个简洁的写法，常规的构建一个 pq 优先队列需要自己新建一个类型，然后实现 Len()、Less()、Swap()、Push()、Pop() 这 5 个方法。在 sort 包里有一个现成的最小堆，sort.IntSlice。可以借用它，再自己实现 Push()、Pop()就可以使用最小堆了，节约一部分代码。
+
+## 代码
+
+```go
+package leetcode
+
+import (
+ "container/heap"
+ "sort"
+)
+
+type KthLargest struct {
+ sort.IntSlice
+ k int
+}
+
+func Constructor(k int, nums []int) KthLargest {
+ kl := KthLargest{k: k}
+ for _, val := range nums {
+ kl.Add(val)
+ }
+ return kl
+}
+
+func (kl *KthLargest) Push(v interface{}) {
+ kl.IntSlice = append(kl.IntSlice, v.(int))
+}
+
+func (kl *KthLargest) Pop() interface{} {
+ a := kl.IntSlice
+ v := a[len(a)-1]
+ kl.IntSlice = a[:len(a)-1]
+ return v
+}
+
+func (kl *KthLargest) Add(val int) int {
+ heap.Push(kl, val)
+ if kl.Len() > kl.k {
+ heap.Pop(kl)
+ }
+ return kl.IntSlice[0]
+}
+```
\ No newline at end of file
diff --git a/leetcode/0706.Design-HashMap/706. Design HashMap.go b/leetcode/0706.Design-HashMap/706. Design HashMap.go
index acbf36fd7..2845be611 100644
--- a/leetcode/0706.Design-HashMap/706. Design HashMap.go
+++ b/leetcode/0706.Design-HashMap/706. Design HashMap.go
@@ -1,6 +1,6 @@
package leetcode
-const Len int = 100000
+const Len int = 10000
type MyHashMap struct {
content [Len]*HashNode
@@ -41,9 +41,9 @@ func (N *HashNode) Remove(key int) *HashNode {
return p
}
if N.next != nil {
- return N.next.Remove(key)
+ N.next = N.next.Remove(key)
}
- return nil
+ return N
}
/** Initialize your data structure here. */
diff --git a/leetcode/0706.Design-HashMap/706. Design HashMap_test.go b/leetcode/0706.Design-HashMap/706. Design HashMap_test.go
index 9ff3e200c..6d83ca0d0 100644
--- a/leetcode/0706.Design-HashMap/706. Design HashMap_test.go
+++ b/leetcode/0706.Design-HashMap/706. Design HashMap_test.go
@@ -13,6 +13,9 @@ func Test_Problem706(t *testing.T) {
fmt.Printf("Contains 7 = %v\n", obj.Get(7))
param1 := obj.Get(100)
fmt.Printf("param1 = %v\n", param1)
+ obj.Remove(100007)
+ param1 = obj.Get(7)
+ fmt.Printf("param1 = %v\n", param1)
obj.Remove(7)
param1 = obj.Get(7)
fmt.Printf("param1 = %v\n", param1)
diff --git a/leetcode/0707.Design-Linked-List/707. Design Linked List.go b/leetcode/0707.Design-Linked-List/707. Design Linked List.go
index 788b9930d..57761f265 100644
--- a/leetcode/0707.Design-Linked-List/707. Design Linked List.go
+++ b/leetcode/0707.Design-Linked-List/707. Design Linked List.go
@@ -1,82 +1,97 @@
package leetcode
type MyLinkedList struct {
+ head *Node
+}
+
+type Node struct {
Val int
- Next *MyLinkedList
+ Next *Node
+ Prev *Node
}
/** Initialize your data structure here. */
func Constructor() MyLinkedList {
- return MyLinkedList{Val: -999, Next: nil}
+ return MyLinkedList{}
}
/** Get the value of the index-th node in the linked list. If the index is invalid, return -1. */
func (this *MyLinkedList) Get(index int) int {
- cur := this
- for i := 0; cur != nil; i++ {
- if i == index {
- if cur.Val == -999 {
- return -1
- } else {
- return cur.Val
- }
- }
- cur = cur.Next
+ curr := this.head
+ for i := 0; i < index && curr != nil; i++ {
+ curr = curr.Next
+ }
+ if curr != nil {
+ return curr.Val
+ } else {
+ return -1
}
- return -1
}
/** Add a node of value val before the first element of the linked list. After the insertion, the new node will be the first node of the linked list. */
func (this *MyLinkedList) AddAtHead(val int) {
- if this.Val == -999 {
- this.Val = val
- } else {
- tmp := &MyLinkedList{Val: this.Val, Next: this.Next}
- this.Val = val
- this.Next = tmp
+ node := &Node{Val: val}
+ node.Next = this.head
+ if this.head != nil {
+ this.head.Prev = node
}
+ this.head = node
}
/** Append a node of value val to the last element of the linked list. */
func (this *MyLinkedList) AddAtTail(val int) {
- cur := this
- for cur.Next != nil {
- cur = cur.Next
+ if this.head == nil {
+ this.AddAtHead(val)
+ return
}
- tmp := &MyLinkedList{Val: val, Next: nil}
- cur.Next = tmp
+ node := &Node{Val: val}
+ curr := this.head
+ for curr != nil && curr.Next != nil {
+ curr = curr.Next
+ }
+ node.Prev = curr
+ curr.Next = node
}
/** Add a node of value val before the index-th node in the linked list. If index equals to the length of linked list, the node will be appended to the end of linked list. If index is greater than the length, the node will not be inserted. */
func (this *MyLinkedList) AddAtIndex(index int, val int) {
- cur := this
if index == 0 {
this.AddAtHead(val)
- return
- }
- for i := 0; cur != nil; i++ {
- if i == index-1 {
- break
+ } else {
+ node := &Node{Val: val}
+ curr := this.head
+ for i := 0; i < index-1 && curr != nil; i++ {
+ curr = curr.Next
+ }
+ if curr != nil {
+ node.Next = curr.Next
+ node.Prev = curr
+ if node.Next != nil {
+ node.Next.Prev = node
+ }
+ curr.Next = node
}
- cur = cur.Next
- }
- if cur != nil && cur.Val != -999 {
- tmp := &MyLinkedList{Val: val, Next: cur.Next}
- cur.Next = tmp
}
}
/** Delete the index-th node in the linked list, if the index is valid. */
func (this *MyLinkedList) DeleteAtIndex(index int) {
- cur := this
- for i := 0; cur != nil; i++ {
- if i == index-1 {
- break
+ if index == 0 {
+ this.head = this.head.Next
+ if this.head != nil {
+ this.head.Prev = nil
+ }
+ } else {
+ curr := this.head
+ for i := 0; i < index-1 && curr != nil; i++ {
+ curr = curr.Next
+ }
+ if curr != nil && curr.Next != nil {
+ curr.Next = curr.Next.Next
+ if curr.Next != nil {
+ curr.Next.Prev = curr
+ }
}
- cur = cur.Next
- }
- if cur != nil && cur.Next != nil {
- cur.Next = cur.Next.Next
}
}
diff --git a/leetcode/0707.Design-Linked-List/707. Design Linked List_test.go b/leetcode/0707.Design-Linked-List/707. Design Linked List_test.go
index 4b61e11fd..3d98de216 100644
--- a/leetcode/0707.Design-Linked-List/707. Design Linked List_test.go
+++ b/leetcode/0707.Design-Linked-List/707. Design Linked List_test.go
@@ -54,11 +54,10 @@ func Test_Problem707(t *testing.T) {
func MList2Ints(head *MyLinkedList) []int {
res := []int{}
-
- for head != nil {
- res = append(res, head.Val)
- head = head.Next
+ cur := head.head
+ for cur != nil {
+ res = append(res, cur.Val)
+ cur = cur.Next
}
-
return res
}
diff --git a/leetcode/0709.To-Lower-Case/709. To Lower Case.go b/leetcode/0709.To-Lower-Case/709. To Lower Case.go
new file mode 100644
index 000000000..9ade71c0e
--- /dev/null
+++ b/leetcode/0709.To-Lower-Case/709. To Lower Case.go
@@ -0,0 +1,12 @@
+package leetcode
+
+func toLowerCase(s string) string {
+ runes := []rune(s)
+ diff := 'a' - 'A'
+ for i := 0; i < len(s); i++ {
+ if runes[i] >= 'A' && runes[i] <= 'Z' {
+ runes[i] += diff
+ }
+ }
+ return string(runes)
+}
diff --git a/leetcode/0709.To-Lower-Case/709. To Lower Case_test.go b/leetcode/0709.To-Lower-Case/709. To Lower Case_test.go
new file mode 100644
index 000000000..f7bcd27fe
--- /dev/null
+++ b/leetcode/0709.To-Lower-Case/709. To Lower Case_test.go
@@ -0,0 +1,52 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question709 struct {
+ para709
+ ans709
+}
+
+// para 是参数
+// one 代表第一个参数
+type para709 struct {
+ one string
+}
+
+// ans 是答案
+// one 代表第一个答案
+type ans709 struct {
+ one string
+}
+
+func Test_Problem709(t *testing.T) {
+
+ qs := []question709{
+
+ {
+ para709{"Hello"},
+ ans709{"hello"},
+ },
+
+ {
+ para709{"here"},
+ ans709{"here"},
+ },
+
+ {
+ para709{"LOVELY"},
+ ans709{"lovely"},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 709------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans709, q.para709
+ fmt.Printf("【input】:%v 【output】:%v\n", p, toLowerCase(p.one))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/0709.To-Lower-Case/README.md b/leetcode/0709.To-Lower-Case/README.md
new file mode 100644
index 000000000..062aa6051
--- /dev/null
+++ b/leetcode/0709.To-Lower-Case/README.md
@@ -0,0 +1,55 @@
+# [709. To Lower Case](https://leetcode.com/problems/to-lower-case/)
+
+
+## 题目
+
+Given a string `s`, return *the string after replacing every uppercase letter with the same lowercase letter*.
+
+**Example 1:**
+
+```
+Input: s = "Hello"
+Output: "hello"
+```
+
+**Example 2:**
+
+```
+Input: s = "here"
+Output: "here"
+```
+
+**Example 3:**
+
+```
+Input: s = "LOVELY"
+Output: "lovely"
+```
+
+**Constraints:**
+
+- `1 <= s.length <= 100`
+- `s` consists of printable ASCII characters.
+
+## 题目大意
+
+给你一个字符串 s ，将该字符串中的大写字母转换成相同的小写字母，返回新的字符串。
+
+## 解题思路
+
+- 简单题，将字符串中的大写字母转换成小写字母。
+
+## 代码
+
+```go
+func toLowerCase(s string) string {
+ runes := [] rune(s)
+ diff := 'a' - 'A'
+ for i := 0; i < len(s); i++ {
+ if runes[i] >= 'A' && runes[i] <= 'Z' {
+ runes[i] += diff
+ }
+ }
+ return string(runes)
+}
+```
\ No newline at end of file
diff --git a/leetcode/0725.Split-Linked-List-in-Parts/725. Split Linked List in Parts.go b/leetcode/0725.Split-Linked-List-in-Parts/725. Split Linked List in Parts.go
index 9a17de211..edfae081f 100644
--- a/leetcode/0725.Split-Linked-List-in-Parts/725. Split Linked List in Parts.go
+++ b/leetcode/0725.Split-Linked-List-in-Parts/725. Split Linked List in Parts.go
@@ -1,8 +1,8 @@
package leetcode
-import "fmt"
-
import (
+ "fmt"
+
"github.com/halfrost/LeetCode-Go/structures"
)
diff --git a/leetcode/0728.Self-Dividing-Numbers/728.Self Dividing Numbers.go b/leetcode/0728.Self-Dividing-Numbers/728.Self Dividing Numbers.go
new file mode 100644
index 000000000..a0f3c421f
--- /dev/null
+++ b/leetcode/0728.Self-Dividing-Numbers/728.Self Dividing Numbers.go
@@ -0,0 +1,24 @@
+package leetcode
+
+func selfDividingNumbers(left int, right int) []int {
+ var ans []int
+ for num := left; num <= right; num++ {
+ if selfDividingNum(num) {
+ ans = append(ans, num)
+ }
+ }
+ return ans
+}
+
+func selfDividingNum(num int) bool {
+ for d := num; d > 0; d = d / 10 {
+ reminder := d % 10
+ if reminder == 0 {
+ return false
+ }
+ if num%reminder != 0 {
+ return false
+ }
+ }
+ return true
+}
diff --git a/leetcode/0728.Self-Dividing-Numbers/728.Self Dividing Numbers_test.go b/leetcode/0728.Self-Dividing-Numbers/728.Self Dividing Numbers_test.go
new file mode 100644
index 000000000..a4e10d425
--- /dev/null
+++ b/leetcode/0728.Self-Dividing-Numbers/728.Self Dividing Numbers_test.go
@@ -0,0 +1,47 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question728 struct {
+ para728
+ ans728
+}
+
+// para 是参数
+type para728 struct {
+ left int
+ right int
+}
+
+// ans 是答案
+type ans728 struct {
+ ans []int
+}
+
+func Test_Problem728(t *testing.T) {
+
+ qs := []question728{
+
+ {
+ para728{1, 22},
+ ans728{[]int{1, 2, 3, 4, 5, 6, 7, 8, 9, 11, 12, 15, 22}},
+ },
+
+ {
+ para728{47, 85},
+ ans728{[]int{48, 55, 66, 77}},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 728------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans728, q.para728
+ fmt.Printf("【input】:%v ", p)
+ fmt.Printf("【output】:%v \n", selfDividingNumbers(p.left, p.right))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/0728.Self-Dividing-Numbers/README.md b/leetcode/0728.Self-Dividing-Numbers/README.md
new file mode 100644
index 000000000..323e51ef7
--- /dev/null
+++ b/leetcode/0728.Self-Dividing-Numbers/README.md
@@ -0,0 +1,68 @@
+# [728. Self Dividing Numbers](https://leetcode.com/problems/self-dividing-numbers/)
+
+## 题目
+
+A self-dividing number is a number that is divisible by every digit it contains.
+
+- For example, 128 is a self-dividing number because 128 % 1 == 0, 128 % 2 == 0, and 128 % 8 == 0.
+
+A self-dividing number is not allowed to contain the digit zero.
+
+Given two integers left and right, return a list of all the self-dividing numbers in the range [left, right].
+
+**Example 1:**
+
+ Input: left = 1, right = 22
+ Output: [1,2,3,4,5,6,7,8,9,11,12,15,22]
+
+**Example 2:**
+
+ Input: left = 47, right = 85
+ Output: [48,55,66,77]
+
+**Constraints:**
+
+- 1 <= left <= right <= 10000
+
+## 题目大意
+
+自除数是指可以被它包含的每一位数整除的数。
+
+- 例如，128 是一个 自除数 ，因为 128 % 1 == 0，128 % 2 == 0，128 % 8 == 0。
+
+自除数 不允许包含 0 。
+
+给定两个整数 left 和 right ，返回一个列表，列表的元素是范围 [left, right] 内所有的 自除数 。
+
+## 解题思路
+
+- 模拟计算
+
+# 代码
+
+```go
+package leetcode
+
+func selfDividingNumbers(left int, right int) []int {
+ var ans []int
+ for num := left; num <= right; num++ {
+ if selfDividingNum(num) {
+ ans = append(ans, num)
+ }
+ }
+ return ans
+}
+
+func selfDividingNum(num int) bool {
+ for d := num; d > 0; d = d / 10 {
+ reminder := d % 10
+ if reminder == 0 {
+ return false
+ }
+ if num%reminder != 0 {
+ return false
+ }
+ }
+ return true
+}
+```
diff --git a/leetcode/0747.Largest-Number-At-Least-Twice-of-Others/747. Largest Number At Least Twice of Others.go b/leetcode/0747.Largest-Number-At-Least-Twice-of-Others/747. Largest Number At Least Twice of Others.go
new file mode 100644
index 000000000..8f68963cb
--- /dev/null
+++ b/leetcode/0747.Largest-Number-At-Least-Twice-of-Others/747. Largest Number At Least Twice of Others.go
@@ -0,0 +1,20 @@
+package leetcode
+
+func dominantIndex(nums []int) int {
+ maxNum, flag, index := 0, false, 0
+ for i, v := range nums {
+ if v > maxNum {
+ maxNum = v
+ index = i
+ }
+ }
+ for _, v := range nums {
+ if v != maxNum && 2*v > maxNum {
+ flag = true
+ }
+ }
+ if flag {
+ return -1
+ }
+ return index
+}
diff --git a/leetcode/0747.Largest-Number-At-Least-Twice-of-Others/747. Largest Number At Least Twice of Others_test.go b/leetcode/0747.Largest-Number-At-Least-Twice-of-Others/747. Largest Number At Least Twice of Others_test.go
new file mode 100644
index 000000000..6d658a7b8
--- /dev/null
+++ b/leetcode/0747.Largest-Number-At-Least-Twice-of-Others/747. Largest Number At Least Twice of Others_test.go
@@ -0,0 +1,52 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question747 struct {
+ para747
+ ans747
+}
+
+// para 是参数
+// one 代表第一个参数
+type para747 struct {
+ nums []int
+}
+
+// ans 是答案
+// one 代表第一个答案
+type ans747 struct {
+ one int
+}
+
+func Test_Problem747(t *testing.T) {
+
+ qs := []question747{
+
+ {
+ para747{[]int{3, 6, 1, 0}},
+ ans747{1},
+ },
+
+ {
+ para747{[]int{1, 2, 3, 4}},
+ ans747{-1},
+ },
+
+ {
+ para747{[]int{1}},
+ ans747{0},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 747------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans747, q.para747
+ fmt.Printf("【input】:%v 【output】:%v\n", p, dominantIndex(p.nums))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/0747.Largest-Number-At-Least-Twice-of-Others/README.md b/leetcode/0747.Largest-Number-At-Least-Twice-of-Others/README.md
new file mode 100644
index 000000000..9c55c6e0f
--- /dev/null
+++ b/leetcode/0747.Largest-Number-At-Least-Twice-of-Others/README.md
@@ -0,0 +1,75 @@
+# [747. Largest Number At Least Twice of Others](https://leetcode.com/problems/largest-number-at-least-twice-of-others/)
+
+
+## 题目
+
+You are given an integer array `nums` where the largest integer is **unique**.
+
+Determine whether the largest element in the array is **at least twice** as much as every other number in the array. If it is, return *the **index** of the largest element, or return* `-1` *otherwise*.
+
+**Example 1:**
+
+```
+Input: nums = [3,6,1,0]
+Output: 1
+Explanation: 6 is the largest integer.
+For every other number in the array x, 6 is at least twice as big as x.
+The index of value 6 is 1, so we return 1.
+
+```
+
+**Example 2:**
+
+```
+Input: nums = [1,2,3,4]
+Output: -1
+Explanation: 4 is less than twice the value of 3, so we return -1.
+```
+
+**Example 3:**
+
+```
+Input: nums = [1]
+Output: 0
+Explanation: 1 is trivially at least twice the value as any other number because there are no other numbers.
+
+```
+
+**Constraints:**
+
+- `1 <= nums.length <= 50`
+- `0 <= nums[i] <= 100`
+- The largest element in `nums` is unique.
+
+## 题目大意
+
+给你一个整数数组 nums ，其中总是存在 唯一的 一个最大整数 。请你找出数组中的最大元素并检查它是否 至少是数组中每个其他数字的两倍 。如果是，则返回 最大元素的下标 ，否则返回 -1 。
+
+## 解题思路
+
+- 简单题。先扫描一遍找到最大值和下标。再扫描一遍检查最大值是否是其他数字的两倍。
+
+## 代码
+
+```go
+package leetcode
+
+func dominantIndex(nums []int) int {
+ maxNum, flag, index := 0, false, 0
+ for i, v := range nums {
+ if v > maxNum {
+ maxNum = v
+ index = i
+ }
+ }
+ for _, v := range nums {
+ if v != maxNum && 2*v > maxNum {
+ flag = true
+ }
+ }
+ if flag {
+ return -1
+ }
+ return index
+}
+```
\ No newline at end of file
diff --git a/leetcode/0752.Open-the-Lock/752. Open the Lock.go b/leetcode/0752.Open-the-Lock/752. Open the Lock.go
new file mode 100644
index 000000000..72488e57d
--- /dev/null
+++ b/leetcode/0752.Open-the-Lock/752. Open the Lock.go
@@ -0,0 +1,57 @@
+package leetcode
+
+func openLock(deadends []string, target string) int {
+ if target == "0000" {
+ return 0
+ }
+ targetNum, visited := strToInt(target), make([]bool, 10000)
+ visited[0] = true
+ for _, deadend := range deadends {
+ num := strToInt(deadend)
+ if num == 0 {
+ return -1
+ }
+ visited[num] = true
+ }
+ depth, curDepth, nextDepth := 0, []int16{0}, make([]int16, 0)
+ var nextNum int16
+ for len(curDepth) > 0 {
+ nextDepth = nextDepth[0:0]
+ for _, curNum := range curDepth {
+ for incrementer := int16(1000); incrementer > 0; incrementer /= 10 {
+ digit := (curNum / incrementer) % 10
+ if digit == 9 {
+ nextNum = curNum - 9*incrementer
+ } else {
+ nextNum = curNum + incrementer
+ }
+ if nextNum == targetNum {
+ return depth + 1
+ }
+ if !visited[nextNum] {
+ visited[nextNum] = true
+ nextDepth = append(nextDepth, nextNum)
+ }
+ if digit == 0 {
+ nextNum = curNum + 9*incrementer
+ } else {
+ nextNum = curNum - incrementer
+ }
+ if nextNum == targetNum {
+ return depth + 1
+ }
+ if !visited[nextNum] {
+ visited[nextNum] = true
+ nextDepth = append(nextDepth, nextNum)
+ }
+ }
+ }
+ curDepth, nextDepth = nextDepth, curDepth
+ depth++
+ }
+ return -1
+}
+
+func strToInt(str string) int16 {
+ return int16(str[0]-'0')*1000 + int16(str[1]-'0')*100 + int16(str[2]-'0')*10 + int16(str[3]-'0')
+}
diff --git a/leetcode/0752.Open-the-Lock/752. Open the Lock_test.go b/leetcode/0752.Open-the-Lock/752. Open the Lock_test.go
new file mode 100644
index 000000000..b6e7d24c9
--- /dev/null
+++ b/leetcode/0752.Open-the-Lock/752. Open the Lock_test.go
@@ -0,0 +1,53 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question752 struct {
+ para752
+ ans752
+}
+
+// para 是参数
+// one 代表第一个参数
+type para752 struct {
+ deadends []string
+ target string
+}
+
+// ans 是答案
+// one 代表第一个答案
+type ans752 struct {
+ one int
+}
+
+func Test_Problem752(t *testing.T) {
+
+ qs := []question752{
+
+ {
+ para752{[]string{"0201", "0101", "0102", "1212", "2002"}, "0202"},
+ ans752{6},
+ },
+
+ {
+ para752{[]string{"8888"}, "0009"},
+ ans752{1},
+ },
+
+ {
+ para752{[]string{"8887", "8889", "8878", "8898", "8788", "8988", "7888", "9888"}, "8888"},
+ ans752{-1},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 752------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans752, q.para752
+ fmt.Printf("【input】:%v 【output】:%v\n", p, openLock(p.deadends, p.target))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/0752.Open-the-Lock/README.md b/leetcode/0752.Open-the-Lock/README.md
new file mode 100644
index 000000000..132083aa0
--- /dev/null
+++ b/leetcode/0752.Open-the-Lock/README.md
@@ -0,0 +1,131 @@
+# [752. Open the Lock](https://leetcode.com/problems/open-the-lock/)
+
+
+## 题目
+
+You have a lock in front of you with 4 circular wheels. Each wheel has 10 slots: `'0', '1', '2', '3', '4', '5', '6', '7', '8', '9'`. The wheels can rotate freely and wrap around: for example we can turn `'9'` to be `'0'`, or `'0'` to be `'9'`. Each move consists of turning one wheel one slot.
+
+The lock initially starts at `'0000'`, a string representing the state of the 4 wheels.
+
+You are given a list of `deadends` dead ends, meaning if the lock displays any of these codes, the wheels of the lock will stop turning and you will be unable to open it.
+
+Given a `target` representing the value of the wheels that will unlock the lock, return the minimum total number of turns required to open the lock, or -1 if it is impossible.
+
+**Example 1:**
+
+```
+Input: deadends = ["0201","0101","0102","1212","2002"], target = "0202"
+Output: 6
+Explanation:
+A sequence of valid moves would be "0000" -> "1000" -> "1100" -> "1200" -> "1201" -> "1202" -> "0202".
+Note that a sequence like "0000" -> "0001" -> "0002" -> "0102" -> "0202" would be invalid,
+because the wheels of the lock become stuck after the display becomes the dead end "0102".
+
+```
+
+**Example 2:**
+
+```
+Input: deadends = ["8888"], target = "0009"
+Output: 1
+Explanation:
+We can turn the last wheel in reverse to move from "0000" -> "0009".
+
+```
+
+**Example 3:**
+
+```
+Input: deadends = ["8887","8889","8878","8898","8788","8988","7888","9888"], target = "8888"
+Output: -1
+Explanation:
+We can't reach the target without getting stuck.
+
+```
+
+**Example 4:**
+
+```
+Input: deadends = ["0000"], target = "8888"
+Output: -1
+
+```
+
+**Constraints:**
+
+- `1 <= deadends.length <= 500`
+- `deadends[i].length == 4`
+- `target.length == 4`
+- target **will not be** in the list `deadends`.
+- `target` and `deadends[i]` consist of digits only.
+
+## 题目大意
+
+你有一个带有四个圆形拨轮的转盘锁。每个拨轮都有10个数字： '0', '1', '2', '3', '4', '5', '6', '7', '8', '9' 。每个拨轮可以自由旋转：例如把 '9' 变为 '0'，'0' 变为 '9' 。每次旋转都只能旋转一个拨轮的一位数字。锁的初始数字为 '0000' ，一个代表四个拨轮的数字的字符串。列表 deadends 包含了一组死亡数字，一旦拨轮的数字和列表里的任何一个元素相同，这个锁将会被永久锁定，无法再被旋转。字符串 target 代表可以解锁的数字，你需要给出解锁需要的最小旋转次数，如果无论如何不能解锁，返回 -1 。
+
+## 解题思路
+
+- 此题可以转化为从起始点到终点的最短路径。采用广度优先搜索。每次广搜枚举转动一次数字的状态，并且用 visited 记录是否被搜索过，如果没有被搜索过，便加入队列，下一轮继续搜索。如果搜索到了 target，便返回对应的旋转次数。如果搜索完成后，仍没有搜索到 target，说明无法解锁，返回 -1。特殊情况，如果 target 就是初始数字 0000，那么直接返回答案 0。
+- 在广搜之前，先将 deadends 放入 map 中，搜索中判断是否搜到了 deadends。如果初始数字 0000 出现在 deadends 中，可以直接返回答案 −1。
+
+## 代码
+
+```go
+package leetcode
+
+func openLock(deadends []string, target string) int {
+ if target == "0000" {
+ return 0
+ }
+ targetNum, visited := strToInt(target), make([]bool, 10000)
+ visited[0] = true
+ for _, deadend := range deadends {
+ num := strToInt(deadend)
+ if num == 0 {
+ return -1
+ }
+ visited[num] = true
+ }
+ depth, curDepth, nextDepth := 0, []int16{0}, make([]int16, 0)
+ var nextNum int16
+ for len(curDepth) > 0 {
+ nextDepth = nextDepth[0:0]
+ for _, curNum := range curDepth {
+ for incrementer := int16(1000); incrementer > 0; incrementer /= 10 {
+ digit := (curNum / incrementer) % 10
+ if digit == 9 {
+ nextNum = curNum - 9*incrementer
+ } else {
+ nextNum = curNum + incrementer
+ }
+ if nextNum == targetNum {
+ return depth + 1
+ }
+ if !visited[nextNum] {
+ visited[nextNum] = true
+ nextDepth = append(nextDepth, nextNum)
+ }
+ if digit == 0 {
+ nextNum = curNum + 9*incrementer
+ } else {
+ nextNum = curNum - incrementer
+ }
+ if nextNum == targetNum {
+ return depth + 1
+ }
+ if !visited[nextNum] {
+ visited[nextNum] = true
+ nextDepth = append(nextDepth, nextNum)
+ }
+ }
+ }
+ curDepth, nextDepth = nextDepth, curDepth
+ depth++
+ }
+ return -1
+}
+
+func strToInt(str string) int16 {
+ return int16(str[0]-'0')*1000 + int16(str[1]-'0')*100 + int16(str[2]-'0')*10 + int16(str[3]-'0')
+}
+```
\ No newline at end of file
diff --git a/leetcode/0763.Partition-Labels/README.md b/leetcode/0763.Partition-Labels/README.md
index 68ecff8a0..68d511b40 100644
--- a/leetcode/0763.Partition-Labels/README.md
+++ b/leetcode/0763.Partition-Labels/README.md
@@ -32,6 +32,6 @@ Note:
## 解题思路
-这一题有 2 种思路，第一种思路是先记录下每个字母的出现次数，然后对滑动窗口中的每个字母判断次数是否用尽为 0，如果这个窗口内的所有字母次数都为 0，这个窗口就是符合条件的窗口。时间复杂度为 O(n^2)
+这一题有 2 种思路，第一种思路是先记录下每个字母的出现次数，然后对滑动窗口中的每个字母判断次数是否用尽为 0，如果这个窗口内的所有字母次数都为 0，这个窗口就是符合条件的窗口。时间复杂度为 O(n)
另外一种思路是记录下每个字符最后一次出现的下标，这样就不用记录次数。在每个滑动窗口中，依次判断每个字母最后一次出现的位置，如果在一个下标内，所有字母的最后一次出现的位置都包含进来了，那么这个下标就是这个满足条件的窗口大小。时间复杂度为 O(n^2)
diff --git a/leetcode/0775.Global-and-Local-Inversions/775. Global and Local Inversions.go b/leetcode/0775.Global-and-Local-Inversions/775. Global and Local Inversions.go
new file mode 100644
index 000000000..cc8fbcdf1
--- /dev/null
+++ b/leetcode/0775.Global-and-Local-Inversions/775. Global and Local Inversions.go
@@ -0,0 +1,17 @@
+package leetcode
+
+func isIdealPermutation(A []int) bool {
+ for i := range A {
+ if abs(A[i]-i) > 1 {
+ return false
+ }
+ }
+ return true
+}
+
+func abs(a int) int {
+ if a < 0 {
+ return -a
+ }
+ return a
+}
diff --git a/leetcode/0775.Global-and-Local-Inversions/775. Global and Local Inversions_test.go b/leetcode/0775.Global-and-Local-Inversions/775. Global and Local Inversions_test.go
new file mode 100644
index 000000000..7d570802f
--- /dev/null
+++ b/leetcode/0775.Global-and-Local-Inversions/775. Global and Local Inversions_test.go
@@ -0,0 +1,46 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question775 struct {
+ para775
+ ans775
+}
+
+// para 是参数
+// one 代表第一个参数
+type para775 struct {
+ A []int
+}
+
+// ans 是答案
+// one 代表第一个答案
+type ans775 struct {
+ one bool
+}
+
+func Test_Problem775(t *testing.T) {
+
+ qs := []question775{
+ {
+ para775{[]int{1, 0, 2}},
+ ans775{true},
+ },
+
+ {
+ para775{[]int{1, 2, 0}},
+ ans775{false},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 775------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans775, q.para775
+ fmt.Printf("【input】:%v 【output】:%v\n", p, isIdealPermutation(p.A))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/0775.Global-and-Local-Inversions/README.md b/leetcode/0775.Global-and-Local-Inversions/README.md
new file mode 100644
index 000000000..c20184271
--- /dev/null
+++ b/leetcode/0775.Global-and-Local-Inversions/README.md
@@ -0,0 +1,64 @@
+# [775. Global and Local Inversions](https://leetcode.com/problems/global-and-local-inversions/)
+
+
+## 题目
+
+We have some permutation `A` of `[0, 1, ..., N - 1]`, where `N` is the length of `A`.
+
+The number of (global) inversions is the number of `i < j` with `0 <= i < j < N` and `A[i] > A[j]`.
+
+The number of local inversions is the number of `i` with `0 <= i < N` and `A[i] > A[i+1]`.
+
+Return `true` if and only if the number of global inversions is equal to the number of local inversions.
+
+**Example 1:**
+
+```
+Input: A = [1,0,2]
+Output: true
+Explanation: There is 1 global inversion, and 1 local inversion.
+```
+
+**Example 2:**
+
+```
+Input: A = [1,2,0]
+Output: false
+Explanation: There are 2 global inversions, and 1 local inversion.
+```
+
+**Note:**
+
+- `A` will be a permutation of `[0, 1, ..., A.length - 1]`.
+- `A` will have length in range `[1, 5000]`.
+- The time limit for this problem has been reduced.
+
+## 题目大意
+
+数组 A 是 [0, 1, ..., N - 1] 的一种排列，N 是数组 A 的长度。全局倒置指的是 i,j 满足 0 <= i < j < N 并且 A[i] > A[j] ，局部倒置指的是 i 满足 0 <= i < N 并且 A[i] > A[i+1] 。当数组 A 中全局倒置的数量等于局部倒置的数量时，返回 true 。
+
+## 解题思路
+
+- 本题代码非常简单，重在思考的过程。`[0, 1, ..., N - 1]` 不出现全局倒置的理想情况应该是 `i` 排列在 `A[i-1]`，`A[i]`，`A[i+1]` 的位置上。例如 `1` 如果排列在 `A[3]` 的位置上，那么比 `1` 小的只有 `0` 一个元素，`A[0]`，`A[1]`，`A[2]` 中必定有 2 个元素比 `1` 大，那必须会出现全局倒置的情况。`[0, 1, ..., N - 1]` 这是最理想的情况，每个元素都在自己的位置上。每个元素如果往左右相互偏移 1 个元素，那么也能保证只存在局部倒置，如果左右偏移 2 个元素，那必定会出现全局倒置。所以结论是：**不出现全局倒置的理想情况应该是 `i` 排列在 `A[i-1]`，`A[i]`，`A[i+1]` 的位置上**。判断这个结论的代码很简单，只需要判断 `A[i] - i` 的取值是否是 -1，0，1，也即 `abs(A[i] - i ) ≤ 1`。
+
+## 代码
+
+```go
+package leetcode
+
+func isIdealPermutation(A []int) bool {
+ for i := range A {
+ if abs(A[i]-i) > 1 {
+ return false
+ }
+ }
+ return true
+}
+
+func abs(a int) int {
+ if a < 0 {
+ return -a
+ }
+ return a
+}
+```
\ No newline at end of file
diff --git a/leetcode/0783.Minimum-Distance-Between-BST-Nodes/783. Minimum Distance Between BST Nodes.go b/leetcode/0783.Minimum-Distance-Between-BST-Nodes/783. Minimum Distance Between BST Nodes.go
new file mode 100644
index 000000000..dfb529093
--- /dev/null
+++ b/leetcode/0783.Minimum-Distance-Between-BST-Nodes/783. Minimum Distance Between BST Nodes.go
@@ -0,0 +1,51 @@
+package leetcode
+
+import (
+ "math"
+
+ "github.com/halfrost/LeetCode-Go/structures"
+)
+
+// TreeNode define
+type TreeNode = structures.TreeNode
+
+/**
+ * Definition for a binary tree node.
+ * type TreeNode struct {
+ * Val int
+ * Left *TreeNode
+ * Right *TreeNode
+ * }
+ */
+
+func minDiffInBST(root *TreeNode) int {
+ res, nodes := math.MaxInt16, -1
+ dfsBST(root, &res, &nodes)
+ return res
+}
+
+func dfsBST(root *TreeNode, res, pre *int) {
+ if root == nil {
+ return
+ }
+ dfsBST(root.Left, res, pre)
+ if *pre != -1 {
+ *res = min(*res, abs(root.Val-*pre))
+ }
+ *pre = root.Val
+ dfsBST(root.Right, res, pre)
+}
+
+func min(a, b int) int {
+ if a > b {
+ return b
+ }
+ return a
+}
+
+func abs(a int) int {
+ if a > 0 {
+ return a
+ }
+ return -a
+}
diff --git a/leetcode/0783.Minimum-Distance-Between-BST-Nodes/783. Minimum Distance Between BST Nodes_test.go b/leetcode/0783.Minimum-Distance-Between-BST-Nodes/783. Minimum Distance Between BST Nodes_test.go
new file mode 100644
index 000000000..37d6e7383
--- /dev/null
+++ b/leetcode/0783.Minimum-Distance-Between-BST-Nodes/783. Minimum Distance Between BST Nodes_test.go
@@ -0,0 +1,56 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+
+ "github.com/halfrost/LeetCode-Go/structures"
+)
+
+type question783 struct {
+ para783
+ ans783
+}
+
+// para 是参数
+// one 代表第一个参数
+type para783 struct {
+ one []int
+}
+
+// ans 是答案
+// one 代表第一个答案
+type ans783 struct {
+ one int
+}
+
+func Test_Problem783(t *testing.T) {
+
+ qs := []question783{
+
+ {
+ para783{[]int{4, 2, 6, 1, 3}},
+ ans783{1},
+ },
+
+ {
+ para783{[]int{1, 0, 48, structures.NULL, structures.NULL, 12, 49}},
+ ans783{1},
+ },
+
+ {
+ para783{[]int{90, 69, structures.NULL, 49, 89, structures.NULL, 52}},
+ ans783{1},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 783------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans783, q.para783
+ fmt.Printf("【input】:%v ", p)
+ rootOne := structures.Ints2TreeNode(p.one)
+ fmt.Printf("【output】:%v \n", minDiffInBST(rootOne))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/0783.Minimum-Distance-Between-BST-Nodes/README.md b/leetcode/0783.Minimum-Distance-Between-BST-Nodes/README.md
new file mode 100644
index 000000000..78bf2a213
--- /dev/null
+++ b/leetcode/0783.Minimum-Distance-Between-BST-Nodes/README.md
@@ -0,0 +1,95 @@
+# [783. Minimum Distance Between BST Nodes](https://leetcode.com/problems/minimum-distance-between-bst-nodes/)
+
+
+## 题目
+
+Given the `root` of a Binary Search Tree (BST), return *the minimum difference between the values of any two different nodes in the tree*.
+
+**Note:** This question is the same as 530: [https://leetcode.com/problems/minimum-absolute-difference-in-bst/](https://leetcode.com/problems/minimum-absolute-difference-in-bst/)
+
+**Example 1:**
+
+
+
+```
+Input: root = [4,2,6,1,3]
+Output: 1
+```
+
+**Example 2:**
+
+
+
+```
+Input: root = [1,0,48,null,null,12,49]
+Output: 1
+```
+
+**Constraints:**
+
+- The number of nodes in the tree is in the range `[2, 100]`.
+- `0 <= Node.val <= 10^5`
+
+## 题目大意
+
+给你一个二叉搜索树的根节点 root ，返回 树中任意两不同节点值之间的最小差值 。
+
+## 解题思路
+
+- 本题和第 530 题完全相同。解题思路见第 530 题。
+
+## 代码
+
+```go
+package leetcode
+
+import (
+ "math"
+
+ "github.com/halfrost/LeetCode-Go/structures"
+)
+
+// TreeNode define
+type TreeNode = structures.TreeNode
+
+/**
+ * Definition for a binary tree node.
+ * type TreeNode struct {
+ * Val int
+ * Left *TreeNode
+ * Right *TreeNode
+ * }
+ */
+
+func minDiffInBST(root *TreeNode) int {
+ res, nodes := math.MaxInt16, -1
+ dfsBST(root, &res, &nodes)
+ return res
+}
+
+func dfsBST(root *TreeNode, res, pre *int) {
+ if root == nil {
+ return
+ }
+ dfsBST(root.Left, res, pre)
+ if *pre != -1 {
+ *res = min(*res, abs(root.Val-*pre))
+ }
+ *pre = root.Val
+ dfsBST(root.Right, res, pre)
+}
+
+func min(a, b int) int {
+ if a > b {
+ return b
+ }
+ return a
+}
+
+func abs(a int) int {
+ if a > 0 {
+ return a
+ }
+ return -a
+}
+```
\ No newline at end of file
diff --git a/leetcode/0785.Is-Graph-Bipartite/785. Is Graph Bipartite.go b/leetcode/0785.Is-Graph-Bipartite/785. Is Graph Bipartite.go
new file mode 100644
index 000000000..e0b6089ae
--- /dev/null
+++ b/leetcode/0785.Is-Graph-Bipartite/785. Is Graph Bipartite.go
@@ -0,0 +1,35 @@
+package leetcode
+
+// DFS 染色，1 是红色，0 是绿色，-1 是未染色
+func isBipartite(graph [][]int) bool {
+ colors := make([]int, len(graph))
+ for i := range colors {
+ colors[i] = -1
+ }
+ for i := range graph {
+ if !dfs(i, graph, colors, -1) {
+ return false
+ }
+ }
+ return true
+}
+
+func dfs(n int, graph [][]int, colors []int, parentCol int) bool {
+ if colors[n] == -1 {
+ if parentCol == 1 {
+ colors[n] = 0
+ } else {
+ colors[n] = 1
+ }
+ } else if colors[n] == parentCol {
+ return false
+ } else if colors[n] != parentCol {
+ return true
+ }
+ for _, c := range graph[n] {
+ if !dfs(c, graph, colors, colors[n]) {
+ return false
+ }
+ }
+ return true
+}
diff --git a/leetcode/0785.Is-Graph-Bipartite/785. Is Graph Bipartite_test.go b/leetcode/0785.Is-Graph-Bipartite/785. Is Graph Bipartite_test.go
new file mode 100644
index 000000000..862eaf590
--- /dev/null
+++ b/leetcode/0785.Is-Graph-Bipartite/785. Is Graph Bipartite_test.go
@@ -0,0 +1,52 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question785 struct {
+ para785
+ ans785
+}
+
+// para 是参数
+// one 代表第一个参数
+type para785 struct {
+ graph [][]int
+}
+
+// ans 是答案
+// one 代表第一个答案
+type ans785 struct {
+ one bool
+}
+
+func Test_Problem785(t *testing.T) {
+
+ qs := []question785{
+
+ {
+ para785{[][]int{{1, 3}, {0, 2}, {1, 3}, {0, 2}}},
+ ans785{true},
+ },
+
+ {
+ para785{[][]int{{1, 2, 3}, {0, 2}, {0, 1, 3}, {0, 2}}},
+ ans785{false},
+ },
+
+ {
+ para785{[][]int{{1, 2, 3}, {0, 2, 3}, {0, 1, 3}, {0, 1, 2}}},
+ ans785{false},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 785------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans785, q.para785
+ fmt.Printf("【input】:%v 【output】:%v\n", p, isBipartite(p.graph))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/0785.Is-Graph-Bipartite/README.md b/leetcode/0785.Is-Graph-Bipartite/README.md
new file mode 100644
index 000000000..a5eb6679d
--- /dev/null
+++ b/leetcode/0785.Is-Graph-Bipartite/README.md
@@ -0,0 +1,98 @@
+# [785. Is Graph Bipartite?](https://leetcode.com/problems/is-graph-bipartite/)
+
+
+## 题目
+
+Given an undirected `graph`, return `true` if and only if it is bipartite.
+
+Recall that a graph is *bipartite* if we can split it's set of nodes into two independent subsets A and B such that every edge in the graph has one node in A and another node in B.
+
+The graph is given in the following form: `graph[i]` is a list of indexes `j` for which the edge between nodes `i` and `j` exists. Each node is an integer between `0` and `graph.length - 1`. There are no self edges or parallel edges: `graph[i]` does not contain `i`, and it doesn't contain any element twice.
+
+
+ Example 1:Input: [[1,3], [0,2], [1,3], [0,2]]
+ Output: true
+ Explanation:
+ The graph looks like this:
+ 0----1
+ | |
+ | |
+ 3----2
+ We can divide the vertices into two groups: {0, 2} and {1, 3}.
+
+
+ Example 2:Input: [[1,2,3], [0,2], [0,1,3], [0,2]]
+ Output: false
+ Explanation:
+ The graph looks like this:
+ 0----1
+ | \ |
+ | \ |
+ 3----2
+ We cannot find a way to divide the set of nodes into two independent subsets.
+
+
+**Note:**
+
+- `graph` will have length in range `[1, 100]`.
+- `graph[i]` will contain integers in range `[0, graph.length - 1]`.
+- `graph[i]` will not contain `i` or duplicate values.
+- The graph is undirected: if any element `j` is in `graph[i]`, then `i` will be in `graph[j]`.
+
+## 题目大意
+
+给定一个无向图 graph，当这个图为二分图时返回 true。
+
+graph 将会以邻接表方式给出，graph[i] 表示图中与节点i相连的所有节点。每个节点都是一个在 0 到 graph.length-1 之间的整数。这图中没有自环和平行边： graph[i] 中不存在 i，并且 graph[i] 中没有重复的值。
+
+注意:
+
+- graph 的长度范围为 [1, 100]。
+- graph[i] 中的元素的范围为 [0, graph.length - 1]。
+- graph[i] 不会包含 i 或者有重复的值。
+- 图是无向的: 如果 j 在 graph[i] 里边, 那么 i 也会在 graph[j] 里边。
+
+## 解题思路
+
+- 判断一个无向图是否是二分图。二分图的定义：如果我们能将一个图的节点集合分割成两个独立的子集 A 和 B，并使图中的每一条边的两个节点一个来自 A 集合，一个来自 B 集合，我们就将这个图称为二分图。
+- 这一题可以用 BFS、DFS、并查集来解答。这里是 DFS 实现。任选一个节点开始，把它染成红色，然后对整个图 DFS 遍历，把与它相连的节点并且未被染色的，都染成绿色。颜色不同的节点代表不同的集合。这时候还可能遇到第 2 种情况，与它相连的节点已经有颜色了，并且这个颜色和前一个节点的颜色相同，这就说明了该无向图不是二分图。可以直接 return false。如此遍历到所有节点都染色了，如果能染色成功，说明该无向图是二分图，返回 true。
+
+## 代码
+
+```go
+package leetcode
+
+// DFS 染色，1 是红色，0 是绿色，-1 是未染色
+func isBipartite(graph [][]int) bool {
+ colors := make([]int, len(graph))
+ for i := range colors {
+ colors[i] = -1
+ }
+ for i := range graph {
+ if !dfs(i, graph, colors, -1) {
+ return false
+ }
+ }
+ return true
+}
+
+func dfs(n int, graph [][]int, colors []int, parentCol int) bool {
+ if colors[n] == -1 {
+ if parentCol == 1 {
+ colors[n] = 0
+ } else {
+ colors[n] = 1
+ }
+ } else if colors[n] == parentCol {
+ return false
+ } else if colors[n] != parentCol {
+ return true
+ }
+ for _, c := range graph[n] {
+ if !dfs(c, graph, colors, colors[n]) {
+ return false
+ }
+ }
+ return true
+}
+```
\ No newline at end of file
diff --git a/leetcode/0791.Custom-Sort-String/791. Custom Sort String.go b/leetcode/0791.Custom-Sort-String/791. Custom Sort String.go
new file mode 100644
index 000000000..0535b0591
--- /dev/null
+++ b/leetcode/0791.Custom-Sort-String/791. Custom Sort String.go
@@ -0,0 +1,15 @@
+package leetcode
+
+import "sort"
+
+func customSortString(order string, str string) string {
+ magic := map[byte]int{}
+ for i := range order {
+ magic[order[i]] = i - 30
+ }
+ byteSlice := []byte(str)
+ sort.Slice(byteSlice, func(i, j int) bool {
+ return magic[byteSlice[i]] < magic[byteSlice[j]]
+ })
+ return string(byteSlice)
+}
diff --git a/leetcode/0791.Custom-Sort-String/791. Custom Sort String_test.go b/leetcode/0791.Custom-Sort-String/791. Custom Sort String_test.go
new file mode 100644
index 000000000..c61d0da36
--- /dev/null
+++ b/leetcode/0791.Custom-Sort-String/791. Custom Sort String_test.go
@@ -0,0 +1,43 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question791 struct {
+ para791
+ ans791
+}
+
+// para 是参数
+// one 代表第一个参数
+type para791 struct {
+ order string
+ str string
+}
+
+// ans 是答案
+// one 代表第一个答案
+type ans791 struct {
+ one string
+}
+
+func Test_Problem791(t *testing.T) {
+
+ qs := []question791{
+
+ {
+ para791{"cba", "abcd"},
+ ans791{"cbad"},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 791------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans791, q.para791
+ fmt.Printf("【input】:%v 【output】:%v\n", p, customSortString(p.order, p.str))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/0791.Custom-Sort-String/README.md b/leetcode/0791.Custom-Sort-String/README.md
new file mode 100644
index 000000000..09c11d29f
--- /dev/null
+++ b/leetcode/0791.Custom-Sort-String/README.md
@@ -0,0 +1,55 @@
+# [791. Custom Sort String](https://leetcode.com/problems/custom-sort-string/)
+
+
+## 题目
+
+`order` and `str` are strings composed of lowercase letters. In `order`, no letter occurs more than once.
+
+`order` was sorted in some custom order previously. We want to permute the characters of `str` so that they match the order that `order` was sorted. More specifically, if `x` occurs before `y` in `order`, then `x` should occur before `y` in the returned string.
+
+Return any permutation of `str` (as a string) that satisfies this property.
+
+```
+Example:Input:
+order = "cba"
+str = "abcd"
+Output: "cbad"
+Explanation:
+"a", "b", "c" appear in order, so the order of "a", "b", "c" should be "c", "b", and "a".
+Since "d" does not appear in order, it can be at any position in the returned string. "dcba", "cdba", "cbda" are also valid outputs.
+
+```
+
+**Note:**
+
+- `order` has length at most `26`, and no character is repeated in `order`.
+- `str` has length at most `200`.
+- `order` and `str` consist of lowercase letters only.
+
+## 题目大意
+
+字符串 S 和 T 只包含小写字符。在 S 中，所有字符只会出现一次。S 已经根据某种规则进行了排序。我们要根据 S 中的字符顺序对 T 进行排序。更具体地说，如果 S 中 x 在 y 之前出现，那么返回的字符串中 x 也应出现在 y 之前。返回任意一种符合条件的字符串 T。
+
+## 解题思路
+
+- 题目只要求 T 中包含 S 的字符串有序，所以可以先将 T 中包含 S 的字符串排好序，然后再拼接上其他字符。S 字符串最长为 26 位，先将 S 中字符的下标向左偏移 30，并将偏移后的下标值存入字典中。再把 T 字符串按照字典中下标值进行排序。S 中出现的字符对应的下标经过处理以后变成了负数，S 中未出现的字符的下标还是正数。所以经过排序以后，S 中出现的字符按照原有顺序排列在前面，S 中未出现的字符依次排在后面。
+
+## 代码
+
+```go
+package leetcode
+
+import "sort"
+
+func customSortString(order string, str string) string {
+ magic := map[byte]int{}
+ for i := range order {
+ magic[order[i]] = i - 30
+ }
+ byteSlice := []byte(str)
+ sort.Slice(byteSlice, func(i, j int) bool {
+ return magic[byteSlice[i]] < magic[byteSlice[j]]
+ })
+ return string(byteSlice)
+}
+```
\ No newline at end of file
diff --git a/leetcode/0792.Number-of-Matching-Subsequences/792. Number of Matching Subsequences.go b/leetcode/0792.Number-of-Matching-Subsequences/792. Number of Matching Subsequences.go
new file mode 100644
index 000000000..ac40c8883
--- /dev/null
+++ b/leetcode/0792.Number-of-Matching-Subsequences/792. Number of Matching Subsequences.go
@@ -0,0 +1,20 @@
+package leetcode
+
+func numMatchingSubseq(s string, words []string) int {
+ hash, res := make([][]string, 26), 0
+ for _, w := range words {
+ hash[int(w[0]-'a')] = append(hash[int(w[0]-'a')], w)
+ }
+ for _, c := range s {
+ words := hash[int(byte(c)-'a')]
+ hash[int(byte(c)-'a')] = []string{}
+ for _, w := range words {
+ if len(w) == 1 {
+ res += 1
+ continue
+ }
+ hash[int(w[1]-'a')] = append(hash[int(w[1]-'a')], w[1:])
+ }
+ }
+ return res
+}
diff --git a/leetcode/0792.Number-of-Matching-Subsequences/792. Number of Matching Subsequences_test.go b/leetcode/0792.Number-of-Matching-Subsequences/792. Number of Matching Subsequences_test.go
new file mode 100644
index 000000000..4a1575342
--- /dev/null
+++ b/leetcode/0792.Number-of-Matching-Subsequences/792. Number of Matching Subsequences_test.go
@@ -0,0 +1,43 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question792 struct {
+ para792
+ ans792
+}
+
+// para 是参数
+// one 代表第一个参数
+type para792 struct {
+ s string
+ words []string
+}
+
+// ans 是答案
+// one 代表第一个答案
+type ans792 struct {
+ one int
+}
+
+func Test_Problem792(t *testing.T) {
+
+ qs := []question792{
+
+ {
+ para792{"abcde", []string{"a", "bb", "acd", "ace"}},
+ ans792{3},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 792------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans792, q.para792
+ fmt.Printf("【input】:%v 【output】:%v\n", p, numMatchingSubseq(p.s, p.words))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/0792.Number-of-Matching-Subsequences/README.md b/leetcode/0792.Number-of-Matching-Subsequences/README.md
new file mode 100644
index 000000000..8da33d3e7
--- /dev/null
+++ b/leetcode/0792.Number-of-Matching-Subsequences/README.md
@@ -0,0 +1,66 @@
+# [792. Number of Matching Subsequences](https://leetcode.com/problems/number-of-matching-subsequences/)
+
+
+## 题目
+
+Given a string `s` and an array of strings `words`, return *the number of* `words[i]` *that is a subsequence of* `s`.
+
+A **subsequence** of a string is a new string generated from the original string with some characters (can be none) deleted without changing the relative order of the remaining characters.
+
+- For example, `"ace"` is a subsequence of `"abcde"`.
+
+**Example 1:**
+
+```
+Input: s = "abcde", words = ["a","bb","acd","ace"]
+Output: 3
+Explanation: There are three strings in words that are a subsequence of s: "a", "acd", "ace".
+```
+
+**Example 2:**
+
+```
+Input: s = "dsahjpjauf", words = ["ahjpjau","ja","ahbwzgqnuk","tnmlanowax"]
+Output: 2
+```
+
+**Constraints:**
+
+- `1 <= s.length <= 5 * 104`
+- `1 <= words.length <= 5000`
+- `1 <= words[i].length <= 50`
+- `s` and `words[i]` consist of only lowercase English letters.
+
+## 题目大意
+
+给定字符串 S 和单词字典 words, 求 words[i] 中是 S 的子序列的单词个数。
+
+## 解题思路
+
+- 如果将 words 数组内的字符串每次都在源字符串 S 中匹配，这种暴力解法超时。超时原因是对字符串 S 遍历了多次。是否有更加高效的方法呢？
+- 把 words 数组内字符串按照首字母，分到 26 个桶中。从头开始遍历一遍源字符串 S，每扫一个字母，命中 26 个桶中其中一个桶，修改这个桶中的字符串。例如：当前遍历到了 'o'，此时桶中存的数据是 'a' : ['amy','aop'], 'o': ['oqp','onwn']，那么调整 'o' 桶中的数据后，各桶的状态为，'a' : ['amy','aop'], 'q': ['qp'], 'n': ['nwn']。从头到尾扫完整个字符串 S，某个桶中的字符串被清空，说明该桶中的字符串都符合 S 的子序列。将符合子序列的字符串个数累加起来即为最终答案。
+
+## 代码
+
+```go
+package leetcode
+
+func numMatchingSubseq(s string, words []string) int {
+ hash, res := make([][]string, 26), 0
+ for _, w := range words {
+ hash[int(w[0]-'a')] = append(hash[int(w[0]-'a')], w)
+ }
+ for _, c := range s {
+ words := hash[int(byte(c)-'a')]
+ hash[int(byte(c)-'a')] = []string{}
+ for _, w := range words {
+ if len(w) == 1 {
+ res += 1
+ continue
+ }
+ hash[int(w[1]-'a')] = append(hash[int(w[1]-'a')], w[1:])
+ }
+ }
+ return res
+}
+```
\ No newline at end of file
diff --git a/leetcode/0794.Valid-Tic-Tac-Toe-State/794.Valid Tic-Tac-Toe State.go b/leetcode/0794.Valid-Tic-Tac-Toe-State/794.Valid Tic-Tac-Toe State.go
new file mode 100644
index 000000000..235ac8d47
--- /dev/null
+++ b/leetcode/0794.Valid-Tic-Tac-Toe-State/794.Valid Tic-Tac-Toe State.go
@@ -0,0 +1,40 @@
+package leetcode
+
+func validTicTacToe(board []string) bool {
+ cntX, cntO := 0, 0
+ for i := range board {
+ for j := range board[i] {
+ if board[i][j] == 'X' {
+ cntX++
+ } else if board[i][j] == 'O' {
+ cntO++
+ }
+ }
+ }
+ if cntX < cntO || cntX > cntO+1 {
+ return false
+ }
+ if cntX == cntO {
+ return process(board, 'X')
+ }
+ return process(board, 'O')
+}
+
+func process(board []string, c byte) bool {
+ //某一行是"ccc"
+ if board[0] == string([]byte{c, c, c}) || board[1] == string([]byte{c, c, c}) || board[2] == string([]byte{c, c, c}) {
+ return false
+ }
+ //某一列是"ccc"
+ if (board[0][0] == c && board[1][0] == c && board[2][0] == c) ||
+ (board[0][1] == c && board[1][1] == c && board[2][1] == c) ||
+ (board[0][2] == c && board[1][2] == c && board[2][2] == c) {
+ return false
+ }
+ //某一对角线是"ccc"
+ if (board[0][0] == c && board[1][1] == c && board[2][2] == c) ||
+ (board[0][2] == c && board[1][1] == c && board[2][0] == c) {
+ return false
+ }
+ return true
+}
diff --git a/leetcode/0794.Valid-Tic-Tac-Toe-State/794.Valid Tic-Tac-Toe State_test.go b/leetcode/0794.Valid-Tic-Tac-Toe-State/794.Valid Tic-Tac-Toe State_test.go
new file mode 100644
index 000000000..b324954bd
--- /dev/null
+++ b/leetcode/0794.Valid-Tic-Tac-Toe-State/794.Valid Tic-Tac-Toe State_test.go
@@ -0,0 +1,55 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question794 struct {
+ para794
+ ans794
+}
+
+// para 是参数
+type para794 struct {
+ board []string
+}
+
+// ans 是答案
+type ans794 struct {
+ ans bool
+}
+
+func Test_Problem794(t *testing.T) {
+
+ qs := []question794{
+
+ {
+ para794{[]string{"O ", " ", " "}},
+ ans794{false},
+ },
+
+ {
+ para794{[]string{"XOX", " X ", " "}},
+ ans794{false},
+ },
+
+ {
+ para794{[]string{"XXX", " ", "OOO"}},
+ ans794{false},
+ },
+
+ {
+ para794{[]string{"XOX", "O O", "XOX"}},
+ ans794{true},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 794------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans794, q.para794
+ fmt.Printf("【input】:%v 【output】:%v\n", p.board, validTicTacToe(p.board))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/0794.Valid-Tic-Tac-Toe-State/README.md b/leetcode/0794.Valid-Tic-Tac-Toe-State/README.md
new file mode 100644
index 000000000..2965e983f
--- /dev/null
+++ b/leetcode/0794.Valid-Tic-Tac-Toe-State/README.md
@@ -0,0 +1,119 @@
+# [794. Valid Tic-Tac-Toe State](https://leetcode.com/problems/valid-tic-tac-toe-state/)
+
+## 题目
+
+Given a Tic-Tac-Toe board as a string array board, return true if and only if it is possible to reach this board position during the course of a valid tic-tac-toe game.
+
+The board is a 3 x 3 array that consists of characters ' ', 'X', and 'O'. The ' ' character represents an empty square.
+
+Here are the rules of Tic-Tac-Toe:
+
+- Players take turns placing characters into empty squares ' '.
+- The first player always places 'X' characters, while the second player always places 'O' characters.
+- 'X' and 'O' characters are always placed into empty squares, never filled ones.
+- The game ends when there are three of the same (non-empty) character filling any row, column, or diagonal.
+- The game also ends if all squares are non-empty.
+- No more moves can be played if the game is over.
+
+**Example 1**:
+
+
+
+ Input: board = ["O "," "," "]
+ Output: false
+ Explanation: The first player always plays "X".
+
+**Example 2**:
+
+
+
+ Input: board = ["XOX"," X "," "]
+ Output: false
+ Explanation: Players take turns making moves.
+
+**Example 3**:
+
+
+
+ Input: board = ["XXX"," ","OOO"]
+ Output: false
+
+**Example 4**:
+
+
+
+ Input: board = ["XOX","O O","XOX"]
+ Output: true
+
+**Constraints:**
+
+- board.length == 3
+- board[i].length == 3
+- board[i][j] is either 'X', 'O', or ' '.
+
+## 题目大意
+
+给你一个字符串数组 board 表示井字游戏的棋盘。当且仅当在井字游戏过程中，棋盘有可能达到 board 所显示的状态时，才返回 true 。
+
+井字游戏的棋盘是一个 3 x 3 数组，由字符 ' '，'X' 和 'O' 组成。字符 ' ' 代表一个空位。
+
+以下是井字游戏的规则：
+
+- 玩家轮流将字符放入空位（' '）中。
+- 玩家 1 总是放字符 'X' ，而玩家 2 总是放字符 'O' 。
+- 'X' 和 'O' 只允许放置在空位中，不允许对已放有字符的位置进行填充。
+- 当有 3 个相同（且非空）的字符填充任何行、列或对角线时，游戏结束。
+- 当所有位置非空时，也算为游戏结束。
+- 如果游戏结束，玩家不允许再放置字符。
+
+## 解题思路
+
+分类模拟：
+- 根据题意棋盘在任意时候，要么 X 的数量比 O 的数量多 1，要么两者相等
+- X 的数量等于 O 的数量时,任何行、列或对角线都不会出现 3 个相同的 X
+- X 的数量比 O 的数量多 1 时,任何行、列或对角线都不会出现 3 个相同的 O
+
+## 代码
+
+```go
+package leetcode
+
+func validTicTacToe(board []string) bool {
+ cntX, cntO := 0, 0
+ for i := range board {
+ for j := range board[i] {
+ if board[i][j] == 'X' {
+ cntX++
+ } else if board[i][j] == 'O' {
+ cntO++
+ }
+ }
+ }
+ if cntX < cntO || cntX > cntO+1 {
+ return false
+ }
+ if cntX == cntO {
+ return process(board, 'X')
+ }
+ return process(board, 'O')
+}
+
+func process(board []string, c byte) bool {
+ //某一行是"ccc"
+ if board[0] == string([]byte{c, c, c}) || board[1] == string([]byte{c, c, c}) || board[2] == string([]byte{c, c, c}) {
+ return false
+ }
+ //某一列是"ccc"
+ if (board[0][0] == c && board[1][0] == c && board[2][0] == c) ||
+ (board[0][1] == c && board[1][1] == c && board[2][1] == c) ||
+ (board[0][2] == c && board[1][2] == c && board[2][2] == c) {
+ return false
+ }
+ //某一对角线是"ccc"
+ if (board[0][0] == c && board[1][1] == c && board[2][2] == c) ||
+ (board[0][2] == c && board[1][1] == c && board[2][0] == c) {
+ return false
+ }
+ return true
+}
+```
\ No newline at end of file
diff --git a/leetcode/0795.Number-of-Subarrays-with-Bounded-Maximum/795. Number of Subarrays with Bounded Maximum.go b/leetcode/0795.Number-of-Subarrays-with-Bounded-Maximum/795. Number of Subarrays with Bounded Maximum.go
new file mode 100644
index 000000000..f5eb5c3f7
--- /dev/null
+++ b/leetcode/0795.Number-of-Subarrays-with-Bounded-Maximum/795. Number of Subarrays with Bounded Maximum.go
@@ -0,0 +1,18 @@
+package leetcode
+
+func numSubarrayBoundedMax(nums []int, left int, right int) int {
+ return getAnswerPerBound(nums, right) - getAnswerPerBound(nums, left-1)
+}
+
+func getAnswerPerBound(nums []int, bound int) int {
+ res, count := 0, 0
+ for _, num := range nums {
+ if num <= bound {
+ count++
+ } else {
+ count = 0
+ }
+ res += count
+ }
+ return res
+}
diff --git a/leetcode/0795.Number-of-Subarrays-with-Bounded-Maximum/795. Number of Subarrays with Bounded Maximum_test.go b/leetcode/0795.Number-of-Subarrays-with-Bounded-Maximum/795. Number of Subarrays with Bounded Maximum_test.go
new file mode 100644
index 000000000..5dba6f0cd
--- /dev/null
+++ b/leetcode/0795.Number-of-Subarrays-with-Bounded-Maximum/795. Number of Subarrays with Bounded Maximum_test.go
@@ -0,0 +1,44 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question795 struct {
+ para795
+ ans795
+}
+
+// para 是参数
+// one 代表第一个参数
+type para795 struct {
+ nums []int
+ left int
+ right int
+}
+
+// ans 是答案
+// one 代表第一个答案
+type ans795 struct {
+ one int
+}
+
+func Test_Problem795(t *testing.T) {
+
+ qs := []question795{
+
+ {
+ para795{[]int{2, 1, 4, 3}, 2, 3},
+ ans795{3},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 795------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans795, q.para795
+ fmt.Printf("【input】:%v 【output】:%v\n", p, numSubarrayBoundedMax(p.nums, p.left, p.right))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/0795.Number-of-Subarrays-with-Bounded-Maximum/README.md b/leetcode/0795.Number-of-Subarrays-with-Bounded-Maximum/README.md
new file mode 100644
index 000000000..c69294451
--- /dev/null
+++ b/leetcode/0795.Number-of-Subarrays-with-Bounded-Maximum/README.md
@@ -0,0 +1,54 @@
+# [795. Number of Subarrays with Bounded Maximum](https://leetcode.com/problems/number-of-subarrays-with-bounded-maximum/)
+
+
+## 题目
+
+We are given an array `nums` of positive integers, and two positive integers `left` and `right` (`left <= right`).
+
+Return the number of (contiguous, non-empty) subarrays such that the value of the maximum array element in that subarray is at least `left` and at most `right`.
+
+```
+Example:Input:
+nums = [2, 1, 4, 3]
+left = 2
+right = 3
+Output: 3
+Explanation: There are three subarrays that meet the requirements: [2], [2, 1], [3].
+```
+
+**Note:**
+
+- `left`, `right`, and `nums[i]` will be an integer in the range `[0, 109]`.
+- The length of `nums` will be in the range of `[1, 50000]`.
+
+## 题目大意
+
+给定一个元素都是正整数的数组`A` ，正整数 `L` 以及 `R` (`L <= R`)。求连续、非空且其中最大元素满足大于等于`L` 小于等于`R`的子数组个数。
+
+## 解题思路
+
+- 题目要求子数组最大元素在 [L,R] 区间内。假设 count(bound) 为计算所有元素都小于等于 bound 的子数组数量。那么本题所求的答案可转化为 count(R) - count(L-1)。
+- 如何统计所有元素小于 bound 的子数组数量呢？使用 count 变量记录在 bound 的左边，小于等于 bound 的连续元素数量。当找到一个这样的元素时，在此位置上结束的有效子数组的数量为 count + 1。当遇到一个元素大于 B 时，则在此位置结束的有效子数组的数量为 0。res 将每轮 count 累加，最终 res 中存的即是满足条件的所有子数组数量。
+
+## 代码
+
+```go
+package leetcode
+
+func numSubarrayBoundedMax(nums []int, left int, right int) int {
+ return getAnswerPerBound(nums, right) - getAnswerPerBound(nums, left-1)
+}
+
+func getAnswerPerBound(nums []int, bound int) int {
+ res, count := 0, 0
+ for _, num := range nums {
+ if num <= bound {
+ count++
+ } else {
+ count = 0
+ }
+ res += count
+ }
+ return res
+}
+```
\ No newline at end of file
diff --git a/leetcode/0807.Max-Increase-to-Keep-City-Skyline/807.Max Increase to Keep City Skyline.go b/leetcode/0807.Max-Increase-to-Keep-City-Skyline/807.Max Increase to Keep City Skyline.go
new file mode 100644
index 000000000..c36831734
--- /dev/null
+++ b/leetcode/0807.Max-Increase-to-Keep-City-Skyline/807.Max Increase to Keep City Skyline.go
@@ -0,0 +1,39 @@
+package leetcode
+
+func maxIncreaseKeepingSkyline(grid [][]int) int {
+ n := len(grid)
+ topBottomSkyline := make([]int, 0, n)
+ leftRightSkyline := make([]int, 0, n)
+ for i := range grid {
+ cur := 0
+ for _, v := range grid[i] {
+ if cur < v {
+ cur = v
+ }
+ }
+ leftRightSkyline = append(leftRightSkyline, cur)
+ }
+ for j := range grid {
+ cur := 0
+ for i := 0; i < len(grid[0]); i++ {
+ if cur < grid[i][j] {
+ cur = grid[i][j]
+ }
+ }
+ topBottomSkyline = append(topBottomSkyline, cur)
+ }
+ var ans int
+ for i := range grid {
+ for j := 0; j < len(grid[0]); j++ {
+ ans += min(topBottomSkyline[j], leftRightSkyline[i]) - grid[i][j]
+ }
+ }
+ return ans
+}
+
+func min(a, b int) int {
+ if a < b {
+ return a
+ }
+ return b
+}
diff --git a/leetcode/0807.Max-Increase-to-Keep-City-Skyline/807.Max Increase to Keep City Skyline_test.go b/leetcode/0807.Max-Increase-to-Keep-City-Skyline/807.Max Increase to Keep City Skyline_test.go
new file mode 100644
index 000000000..81159a0e6
--- /dev/null
+++ b/leetcode/0807.Max-Increase-to-Keep-City-Skyline/807.Max Increase to Keep City Skyline_test.go
@@ -0,0 +1,45 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question807 struct {
+ para807
+ ans807
+}
+
+// para 是参数
+type para807 struct {
+ grid [][]int
+}
+
+// ans 是答案
+type ans807 struct {
+ ans int
+}
+
+func Test_Problem807(t *testing.T) {
+
+ qs := []question807{
+
+ {
+ para807{[][]int{{3, 0, 8, 4}, {2, 4, 5, 7}, {9, 2, 6, 3}, {0, 3, 1, 0}}},
+ ans807{35},
+ },
+
+ {
+ para807{[][]int{{0, 0, 0}, {0, 0, 0}, {0, 0, 0}}},
+ ans807{0},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 807------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans807, q.para807
+ fmt.Printf("【input】:%v 【output】:%v\n", p.grid, maxIncreaseKeepingSkyline(p.grid))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/0807.Max-Increase-to-Keep-City-Skyline/README.md b/leetcode/0807.Max-Increase-to-Keep-City-Skyline/README.md
new file mode 100644
index 000000000..58651c500
--- /dev/null
+++ b/leetcode/0807.Max-Increase-to-Keep-City-Skyline/README.md
@@ -0,0 +1,97 @@
+# [807. Max Increase to Keep City Skyline](https://leetcode.com/problems/max-increase-to-keep-city-skyline/)
+
+## 题目
+
+There is a city composed of n x n blocks, where each block contains a single building shaped like a vertical square prism. You are given a 0-indexed n x n integer matrix grid where grid[r][c] represents the height of the building located in the block at row r and column c.
+
+A city's skyline is the the outer contour formed by all the building when viewing the side of the city from a distance. The skyline from each cardinal direction north, east, south, and west may be different.
+
+We are allowed to increase the height of any number of buildings by any amount (the amount can be different per building). The height of a 0-height building can also be increased. However, increasing the height of a building should not affect the city's skyline from any cardinal direction.
+
+Return the maximum total sum that the height of the buildings can be increased by without changing the city's skyline from any cardinal direction.
+
+**Example 1**:
+
+
+
+ Input: grid = [[3,0,8,4],[2,4,5,7],[9,2,6,3],[0,3,1,0]]
+ Output: 35
+ Explanation: The building heights are shown in the center of the above image.
+ The skylines when viewed from each cardinal direction are drawn in red.
+ The grid after increasing the height of buildings without affecting skylines is:
+ gridNew = [ [8, 4, 8, 7],
+ [7, 4, 7, 7],
+ [9, 4, 8, 7],
+ [3, 3, 3, 3] ]
+
+**Example 2**:
+
+ Input: grid = [[0,0,0],[0,0,0],[0,0,0]]
+ Output: 0
+ Explanation: Increasing the height of any building will result in the skyline changing.
+
+**Constraints:**
+
+- n == grid.length
+- n == grid[r].length
+- 2 <= n <= 50
+- 0 <= grid[r][c] <= 100
+
+## 题目大意
+
+在二维数组grid中，grid[i][j]代表位于某处的建筑物的高度。 我们被允许增加任何数量（不同建筑物的数量可能不同）的建筑物的高度。 高度 0 也被认为是建筑物。
+
+最后，从新数组的所有四个方向（即顶部，底部，左侧和右侧）观看的“天际线”必须与原始数组的天际线相同。 城市的天际线是从远处观看时，由所有建筑物形成的矩形的外部轮廓。 请看下面的例子。
+
+建筑物高度可以增加的最大总和是多少？
+
+## 解题思路
+
+- 从数组竖直方向（即顶部，底部）看“天际线”计算出 topBottomSkyline
+- 从数组水平方向（即左侧，右侧）看“天际线”计算出 leftRightSkyline
+- 计算 grid 中每个元素与对应的 topBottomSkyline 和 leftRightSkyline 中较小值的差值
+- 统计所有差值的总和 ans 并返回
+
+## 代码
+
+```go
+package leetcode
+
+func maxIncreaseKeepingSkyline(grid [][]int) int {
+ n := len(grid)
+ topBottomSkyline := make([]int, 0, n)
+ leftRightSkyline := make([]int, 0, n)
+ for i := range grid {
+ cur := 0
+ for _, v := range grid[i] {
+ if cur < v {
+ cur = v
+ }
+ }
+ leftRightSkyline = append(leftRightSkyline, cur)
+ }
+ for j := range grid {
+ cur := 0
+ for i := 0; i < len(grid[0]); i++ {
+ if cur < grid[i][j] {
+ cur = grid[i][j]
+ }
+ }
+ topBottomSkyline = append(topBottomSkyline, cur)
+ }
+ var ans int
+ for i := range grid {
+ for j := 0; j < len(grid[0]); j++ {
+ ans += min(topBottomSkyline[j], leftRightSkyline[i]) - grid[i][j]
+ }
+ }
+ return ans
+}
+
+func min(a, b int) int {
+ if a < b {
+ return a
+ }
+ return b
+}
+```
\ No newline at end of file
diff --git a/leetcode/0810.Chalkboard-XOR-Game/810. Chalkboard XOR Game.go b/leetcode/0810.Chalkboard-XOR-Game/810. Chalkboard XOR Game.go
new file mode 100644
index 000000000..25c791bad
--- /dev/null
+++ b/leetcode/0810.Chalkboard-XOR-Game/810. Chalkboard XOR Game.go
@@ -0,0 +1,12 @@
+package leetcode
+
+func xorGame(nums []int) bool {
+ if len(nums)%2 == 0 {
+ return true
+ }
+ xor := 0
+ for _, num := range nums {
+ xor ^= num
+ }
+ return xor == 0
+}
diff --git a/leetcode/0810.Chalkboard-XOR-Game/810. Chalkboard XOR Game_test.go b/leetcode/0810.Chalkboard-XOR-Game/810. Chalkboard XOR Game_test.go
new file mode 100644
index 000000000..5c84b5e79
--- /dev/null
+++ b/leetcode/0810.Chalkboard-XOR-Game/810. Chalkboard XOR Game_test.go
@@ -0,0 +1,42 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question810 struct {
+ para810
+ ans810
+}
+
+// para 是参数
+// one 代表第一个参数
+type para810 struct {
+ nums []int
+}
+
+// ans 是答案
+// one 代表第一个答案
+type ans810 struct {
+ one bool
+}
+
+func Test_Problem810(t *testing.T) {
+
+ qs := []question810{
+
+ {
+ para810{[]int{1, 1, 2}},
+ ans810{false},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 810------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans810, q.para810
+ fmt.Printf("【input】:%v 【output】:%v\n", p, xorGame(p.nums))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/0810.Chalkboard-XOR-Game/README.md b/leetcode/0810.Chalkboard-XOR-Game/README.md
new file mode 100644
index 000000000..e44fd391e
--- /dev/null
+++ b/leetcode/0810.Chalkboard-XOR-Game/README.md
@@ -0,0 +1,58 @@
+# [810. Chalkboard XOR Game](https://leetcode.com/problems/chalkboard-xor-game/)
+
+
+## 题目
+
+We are given non-negative integers nums[i] which are written on a chalkboard. Alice and Bob take turns erasing exactly one number from the chalkboard, with Alice starting first. If erasing a number causes the bitwise XOR of all the elements of the chalkboard to become 0, then that player loses. (Also, we'll say the bitwise XOR of one element is that element itself, and the bitwise XOR of no elements is 0.)
+
+Also, if any player starts their turn with the bitwise XOR of all the elements of the chalkboard equal to 0, then that player wins.
+
+Return True if and only if Alice wins the game, assuming both players play optimally.
+
+```
+Example:Input: nums = [1, 1, 2]
+Output: false
+Explanation:
+Alice has two choices: erase 1 or erase 2.
+If she erases 1, the nums array becomes [1, 2]. The bitwise XOR of all the elements of the chalkboard is 1 XOR 2 = 3. Now Bob can remove any element he wants, because Alice will be the one to erase the last element and she will lose.
+If Alice erases 2 first, now nums becomes [1, 1]. The bitwise XOR of all the elements of the chalkboard is 1 XOR 1 = 0. Alice will lose.
+```
+
+**Notes:**
+
+- `1 <= N <= 1000`.
+- `0 <= nums[i] <= 2^16`.
+
+## 题目大意
+
+黑板上写着一个非负整数数组 nums[i] 。Alice 和 Bob 轮流从黑板上擦掉一个数字，Alice 先手。如果擦除一个数字后，剩余的所有数字按位异或运算得出的结果等于 0 的话，当前玩家游戏失败。 (另外，如果只剩一个数字，按位异或运算得到它本身；如果无数字剩余，按位异或运算结果为 0。）并且，轮到某个玩家时，如果当前黑板上所有数字按位异或运算结果等于 0，这个玩家获胜。假设两个玩家每步都使用最优解，当且仅当 Alice 获胜时返回 true。
+
+## 解题思路
+
+- Alice 必胜情况之一，Alice 先手，起始数组全部元素本身异或结果就为 0 。不需要擦除数字便自动获胜。除去这个情况，还有其他情况么？由于 2 人是交替擦除数字，且每次都恰好擦掉一个数字，因此对于这两人中的任意一人，其每次在擦除数字前，黑板上剩余数字的个数的奇偶性一定都是相同的。于是奇偶性成为突破口。
+- 如果 nums 的长度是偶数，Alice 先手是否必败呢？如果必败，代表无论擦掉哪一个数字，剩余所有数字的异或结果都等于 0。利用反证法证明上述结论是错误的。首先 $num[0] \oplus num[1] \oplus num[2] \oplus \cdots \oplus num[n-1] = X ≠ 0$，初始所有元素异或结果不为 0。假设 Alice 当前擦掉第 i 个元素，0 ≤ i < n。令 $X_{n}$ 代表擦掉第 n 位元素以后剩余元素异或的结果。由证题，无论擦掉哪一个数字，剩余所有数字的异或结果都等于 0。所以 $X_{0} \oplus X_{1} \oplus X_{2} \oplus \cdots \oplus X_{n-1} = 0$。
+
+ $$\begin{aligned}0 &= X_{0} \oplus X_{1} \oplus X_{2} \oplus \cdots \oplus X_{n-1} \\0 &= (X \oplus nums[0]) \oplus (X \oplus nums[1]) \oplus (X \oplus nums[2]) \oplus \cdots \oplus (X \oplus nums[n-1])\\ 0 &= (X \oplus X \oplus \cdots \oplus X) \oplus (nums[0] \oplus nums[1] \oplus nums[2] \oplus \cdots \oplus nums[n-1])\\0 &= 0 \oplus X\\\\\Rightarrow X &= 0\\\end{aligned}$$
+
+ 由于 n 为偶数，所以 n 个 X 的异或结果为 0。最终推出 X = 0，很明显与前提 X ≠ 0 冲突。所以原命题，代表无论擦掉哪一个数字，剩余所有数字的异或结果都等于 0 是错误的。也就是说，当 n 为偶数时，代表无论擦掉哪一个数字，剩余所有数字的异或结果都不等于 0。即 Alice 有必胜策略。换句话说，当数组的长度是偶数时，先手 Alice 总能找到一个数字，在擦掉这个数字之后剩余的所有数字异或结果不等于 0。
+
+- 综上，Alice 必胜策略有 2 种情况：
+ 1. 数组 nums 的全部元素初始本身异或结果就等于 0。
+ 2. 数组 nums 的长度是偶数。
+
+## 代码
+
+```go
+package leetcode
+
+func xorGame(nums []int) bool {
+ if len(nums)%2 == 0 {
+ return true
+ }
+ xor := 0
+ for _, num := range nums {
+ xor ^= num
+ }
+ return xor == 0
+}
+```
\ No newline at end of file
diff --git a/leetcode/0816.Ambiguous-Coordinates/816. Ambiguous Coordinates.go b/leetcode/0816.Ambiguous-Coordinates/816. Ambiguous Coordinates.go
new file mode 100644
index 000000000..c509719ad
--- /dev/null
+++ b/leetcode/0816.Ambiguous-Coordinates/816. Ambiguous Coordinates.go
@@ -0,0 +1,36 @@
+package leetcode
+
+func ambiguousCoordinates(s string) []string {
+ res := []string{}
+ s = s[1 : len(s)-1]
+ for i := range s[:len(s)-1] {
+ a := build(s[:i+1])
+ b := build(s[i+1:])
+ for _, ta := range a {
+ for _, tb := range b {
+ res = append(res, "("+ta+", "+tb+")")
+ }
+ }
+ }
+ return res
+}
+
+func build(s string) []string {
+ res := []string{}
+ if len(s) == 1 || s[0] != '0' {
+ res = append(res, s)
+ }
+ // 结尾带 0 的情况
+ if s[len(s)-1] == '0' {
+ return res
+ }
+ // 切分长度大于一位且带前导 0 的情况
+ if s[0] == '0' {
+ res = append(res, "0."+s[1:])
+ return res
+ }
+ for i := range s[:len(s)-1] {
+ res = append(res, s[:i+1]+"."+s[i+1:])
+ }
+ return res
+}
diff --git a/leetcode/0816.Ambiguous-Coordinates/816. Ambiguous Coordinates_test.go b/leetcode/0816.Ambiguous-Coordinates/816. Ambiguous Coordinates_test.go
new file mode 100644
index 000000000..9764422d4
--- /dev/null
+++ b/leetcode/0816.Ambiguous-Coordinates/816. Ambiguous Coordinates_test.go
@@ -0,0 +1,42 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question816 struct {
+ para816
+ ans816
+}
+
+// para 是参数
+// one 代表第一个参数
+type para816 struct {
+ one string
+}
+
+// ans 是答案
+// one 代表第一个答案
+type ans816 struct {
+ one []string
+}
+
+func Test_Problem816(t *testing.T) {
+
+ qs := []question816{
+
+ {
+ para816{"(120123)"},
+ ans816{[]string{"(1, 20123)", " (1, 2.0123)", " (1, 20.123)", " (1, 201.23)", " (1, 2012.3)", " (12, 0.123)", " (1.2, 0.123)", " (120, 123)", " (120, 1.23)", " (120, 12.3)", " (1201, 23) ", "(1201, 2.3)", " (1.201, 23)", " (1.201, 2.3) ", "(12.01, 23)", " (12.01, 2.3) ", "(120.1, 23)", " (120.1, 2.3) ", "(12012, 3)", " (1.2012, 3)", " (12.012, 3)", " (120.12, 3)", " (1201.2, 3)"}},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 816------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans816, q.para816
+ fmt.Printf("【input】:%v 【output】:%v\n", p, ambiguousCoordinates(p.one))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/0816.Ambiguous-Coordinates/README.md b/leetcode/0816.Ambiguous-Coordinates/README.md
new file mode 100644
index 000000000..c1610fdec
--- /dev/null
+++ b/leetcode/0816.Ambiguous-Coordinates/README.md
@@ -0,0 +1,95 @@
+# [816. Ambiguous Coordinates](https://leetcode.com/problems/ambiguous-coordinates/)
+
+
+## 题目
+
+We had some 2-dimensional coordinates, like `"(1, 3)"` or `"(2, 0.5)"`. Then, we removed all commas, decimal points, and spaces, and ended up with the string `s`. Return a list of strings representing all possibilities for what our original coordinates could have been.
+
+Our original representation never had extraneous zeroes, so we never started with numbers like "00", "0.0", "0.00", "1.0", "001", "00.01", or any other number that can be represented with less digits. Also, a decimal point within a number never occurs without at least one digit occuring before it, so we never started with numbers like ".1".
+
+The final answer list can be returned in any order. Also note that all coordinates in the final answer have exactly one space between them (occurring after the comma.)
+
+```
+Example 1:Input: s = "(123)"
+Output: ["(1, 23)", "(12, 3)", "(1.2, 3)", "(1, 2.3)"]
+
+```
+
+```
+Example 2:Input: s = "(00011)"
+Output: ["(0.001, 1)", "(0, 0.011)"]
+Explanation:
+0.0, 00, 0001 or 00.01 are not allowed.
+
+```
+
+```
+Example 3:Input: s = "(0123)"
+Output: ["(0, 123)", "(0, 12.3)", "(0, 1.23)", "(0.1, 23)", "(0.1, 2.3)", "(0.12, 3)"]
+
+```
+
+```
+Example 4:Input: s = "(100)"
+Output: [(10, 0)]
+Explanation:
+1.0 is not allowed.
+
+```
+
+**Note:**
+
+- `4 <= s.length <= 12`.
+- `s[0]` = "(", `s[s.length - 1]` = ")", and the other elements in `s` are digits.
+
+## 题目大意
+
+我们有一些二维坐标，如 "(1, 3)" 或 "(2, 0.5)"，然后我们移除所有逗号，小数点和空格，得到一个字符串S。返回所有可能的原始字符串到一个列表中。原始的坐标表示法不会存在多余的零，所以不会出现类似于"00", "0.0", "0.00", "1.0", "001", "00.01"或一些其他更小的数来表示坐标。此外，一个小数点前至少存在一个数，所以也不会出现“.1”形式的数字。
+
+最后返回的列表可以是任意顺序的。而且注意返回的两个数字中间（逗号之后）都有一个空格。
+
+## 解题思路
+
+- 本题没有什么算法思想，纯暴力题。先将原始字符串一分为二，分为的两个子字符串再移动坐标点，最后将每种情况组合再一次，这算完成了一次切分。将原始字符串每一位都按此规律完成切分，此题便得解。
+- 这道题有 2 处需要注意的。第一处是最终输出的字符串，请注意，**两个数字中间（逗号之后）都有一个空格**。不遵守输出格式的要求也会导致 `Wrong Answer`。另外一处是切分数字时，有 2 种违法情况，一种是带前导 0 的，另外一种是末尾带 0 的。带前导 0 的也分为 2 种情况，一种是只有一位，即只有一个 0，这种情况直接返回，因为这一个 0 怎么切分也只有一种切分方法。另外一种是长度大于 1，即 `0xxx` 这种情况。`0xxx` 这种情况只有一种切分方法，即 `0.xxx`。末尾带 0 的只有一种切分方法，即 `xxx0`，不可切分，因为 `xxx.0`，`xx.x0`，`x.xx0` 这些都是违法情况，所以末尾带 0 的也可以直接返回。具体的实现见代码和注释。
+
+## 代码
+
+```go
+package leetcode
+
+func ambiguousCoordinates(s string) []string {
+ res := []string{}
+ s = s[1 : len(s)-1]
+ for i := range s[:len(s)-1] {
+ a := build(s[:i+1])
+ b := build(s[i+1:])
+ for _, ta := range a {
+ for _, tb := range b {
+ res = append(res, "("+ta+", "+tb+")")
+ }
+ }
+ }
+ return res
+}
+
+func build(s string) []string {
+ res := []string{}
+ if len(s) == 1 || s[0] != '0' {
+ res = append(res, s)
+ }
+ // 结尾带 0 的情况
+ if s[len(s)-1] == '0' {
+ return res
+ }
+ // 切分长度大于一位且带前导 0 的情况
+ if s[0] == '0' {
+ res = append(res, "0."+s[1:])
+ return res
+ }
+ for i := range s[:len(s)-1] {
+ res = append(res, s[:i+1]+"."+s[i+1:])
+ }
+ return res
+}
+```
\ No newline at end of file
diff --git a/leetcode/0820.Short-Encoding-of-Words/820. Short Encoding of Words.go b/leetcode/0820.Short-Encoding-of-Words/820. Short Encoding of Words.go
new file mode 100644
index 000000000..c88ee6790
--- /dev/null
+++ b/leetcode/0820.Short-Encoding-of-Words/820. Short Encoding of Words.go
@@ -0,0 +1,86 @@
+package leetcode
+
+// 解法一 暴力
+func minimumLengthEncoding(words []string) int {
+ res, m := 0, map[string]bool{}
+ for _, w := range words {
+ m[w] = true
+ }
+ for w := range m {
+ for i := 1; i < len(w); i++ {
+ delete(m, w[i:])
+ }
+ }
+ for w := range m {
+ res += len(w) + 1
+ }
+ return res
+}
+
+// 解法二 Trie
+type node struct {
+ value byte
+ sub []*node
+}
+
+func (t *node) has(b byte) (*node, bool) {
+ if t == nil {
+ return nil, false
+ }
+ for i := range t.sub {
+ if t.sub[i] != nil && t.sub[i].value == b {
+ return t.sub[i], true
+ }
+ }
+ return nil, false
+}
+
+func (t *node) isLeaf() bool {
+ if t == nil {
+ return false
+ }
+ return len(t.sub) == 0
+}
+
+func (t *node) add(s []byte) {
+ now := t
+ for i := len(s) - 1; i > -1; i-- {
+ if v, ok := now.has(s[i]); ok {
+ now = v
+ continue
+ }
+ temp := new(node)
+ temp.value = s[i]
+ now.sub = append(now.sub, temp)
+ now = temp
+ }
+}
+
+func (t *node) endNodeOf(s []byte) *node {
+ now := t
+ for i := len(s) - 1; i > -1; i-- {
+ if v, ok := now.has(s[i]); ok {
+ now = v
+ continue
+ }
+ return nil
+ }
+ return now
+}
+
+func minimumLengthEncoding1(words []string) int {
+ res, tree, m := 0, new(node), make(map[string]bool)
+ for i := range words {
+ if !m[words[i]] {
+ tree.add([]byte(words[i]))
+ m[words[i]] = true
+ }
+ }
+ for s := range m {
+ if tree.endNodeOf([]byte(s)).isLeaf() {
+ res += len(s)
+ res++
+ }
+ }
+ return res
+}
diff --git a/leetcode/0820.Short-Encoding-of-Words/820. Short Encoding of Words_test.go b/leetcode/0820.Short-Encoding-of-Words/820. Short Encoding of Words_test.go
new file mode 100644
index 000000000..f7f5a0579
--- /dev/null
+++ b/leetcode/0820.Short-Encoding-of-Words/820. Short Encoding of Words_test.go
@@ -0,0 +1,47 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question820 struct {
+ para820
+ ans820
+}
+
+// para 是参数
+// one 代表第一个参数
+type para820 struct {
+ words []string
+}
+
+// ans 是答案
+// one 代表第一个答案
+type ans820 struct {
+ one int
+}
+
+func Test_Problem820(t *testing.T) {
+
+ qs := []question820{
+
+ {
+ para820{[]string{"time", "me", "bell"}},
+ ans820{10},
+ },
+
+ {
+ para820{[]string{"t"}},
+ ans820{2},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 820------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans820, q.para820
+ fmt.Printf("【input】:%v 【output】:%v\n", p, minimumLengthEncoding(p.words))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/0820.Short-Encoding-of-Words/README.md b/leetcode/0820.Short-Encoding-of-Words/README.md
new file mode 100644
index 000000000..60a4ddcaf
--- /dev/null
+++ b/leetcode/0820.Short-Encoding-of-Words/README.md
@@ -0,0 +1,143 @@
+# [820. Short Encoding of Words](https://leetcode.com/problems/short-encoding-of-words/)
+
+
+## 题目
+
+A **valid encoding** of an array of `words` is any reference string `s` and array of indices `indices` such that:
+
+- `words.length == indices.length`
+- The reference string `s` ends with the `'#'` character.
+- For each index `indices[i]`, the **substring** of `s` starting from `indices[i]` and up to (but not including) the next `'#'` character is equal to `words[i]`.
+
+Given an array of `words`, return *the **length of the shortest reference string*** `s` *possible of any **valid encoding** of* `words`*.*
+
+**Example 1:**
+
+```
+Input: words = ["time", "me", "bell"]
+Output: 10
+Explanation: A valid encoding would be s = "time#bell#" and indices = [0, 2, 5].
+words[0] = "time", the substring of s starting from indices[0] = 0 to the next '#' is underlined in "time#bell#"
+words[1] = "me", the substring of s starting from indices[1] = 2 to the next '#' is underlined in "time#bell#"
+words[2] = "bell", the substring of s starting from indices[2] = 5 to the next '#' is underlined in "time#bell#"
+```
+
+**Example 2:**
+
+```
+Input: words = ["t"]
+Output: 2
+Explanation: A valid encoding would be s = "t#" and indices = [0].
+```
+
+**Constraints:**
+
+- `1 <= words.length <= 2000`
+- `1 <= words[i].length <= 7`
+- `words[i]` consists of only lowercase letters.
+
+## 题目大意
+
+单词数组 words 的 有效编码 由任意助记字符串 s 和下标数组 indices 组成，且满足：
+
+- words.length == indices.length
+- 助记字符串 s 以 '#' 字符结尾
+- 对于每个下标 indices[i] ，s 的一个从 indices[i] 开始、到下一个 '#' 字符结束（但不包括 '#'）的 子字符串 恰好与 words[i] 相等
+
+给你一个单词数组 words ，返回成功对 words 进行编码的最小助记字符串 s 的长度 。
+
+## 解题思路
+
+- 暴力解法。先将所有的单词放入字典中。然后针对字典中的每个单词，逐一从字典中删掉自己的子字符串，这样有相同后缀的字符串被删除了，字典中剩下的都是没有共同前缀的。最终的答案是剩下所有单词用 # 号连接之后的总长度。
+- Trie 解法。构建 Trie 树，相同的后缀会被放到从根到叶子节点中的某个路径中。最后依次遍历一遍所有单词，如果单词最后一个字母是叶子节点，说明这个单词是要选择的，因为它可能是包含了一些单词后缀的最长单词。累加这个单词的长度并再加 1(# 字符的长度)。最终累加出来的长度即为题目所求的答案。
+
+## 代码
+
+```go
+package leetcode
+
+// 解法一 暴力
+func minimumLengthEncoding(words []string) int {
+ res, m := 0, map[string]bool{}
+ for _, w := range words {
+ m[w] = true
+ }
+ for w := range m {
+ for i := 1; i < len(w); i++ {
+ delete(m, w[i:])
+ }
+ }
+ for w := range m {
+ res += len(w) + 1
+ }
+ return res
+}
+
+// 解法二 Trie
+type node struct {
+ value byte
+ sub []*node
+}
+
+func (t *node) has(b byte) (*node, bool) {
+ if t == nil {
+ return nil, false
+ }
+ for i := range t.sub {
+ if t.sub[i] != nil && t.sub[i].value == b {
+ return t.sub[i], true
+ }
+ }
+ return nil, false
+}
+
+func (t *node) isLeaf() bool {
+ if t == nil {
+ return false
+ }
+ return len(t.sub) == 0
+}
+
+func (t *node) add(s []byte) {
+ now := t
+ for i := len(s) - 1; i > -1; i-- {
+ if v, ok := now.has(s[i]); ok {
+ now = v
+ continue
+ }
+ temp := new(node)
+ temp.value = s[i]
+ now.sub = append(now.sub, temp)
+ now = temp
+ }
+}
+
+func (t *node) endNodeOf(s []byte) *node {
+ now := t
+ for i := len(s) - 1; i > -1; i-- {
+ if v, ok := now.has(s[i]); ok {
+ now = v
+ continue
+ }
+ return nil
+ }
+ return now
+}
+
+func minimumLengthEncoding1(words []string) int {
+ res, tree, m := 0, new(node), make(map[string]bool)
+ for i := range words {
+ if !m[words[i]] {
+ tree.add([]byte(words[i]))
+ m[words[i]] = true
+ }
+ }
+ for s := range m {
+ if tree.endNodeOf([]byte(s)).isLeaf() {
+ res += len(s)
+ res++
+ }
+ }
+ return res
+}
+```
\ No newline at end of file
diff --git a/leetcode/0821.Shortest-Distance-to-a-Character/821. Shortest Distance to a Character.go b/leetcode/0821.Shortest-Distance-to-a-Character/821. Shortest Distance to a Character.go
new file mode 100644
index 000000000..88ea9ce28
--- /dev/null
+++ b/leetcode/0821.Shortest-Distance-to-a-Character/821. Shortest Distance to a Character.go
@@ -0,0 +1,60 @@
+package leetcode
+
+import (
+ "math"
+)
+
+// 解法一
+func shortestToChar(s string, c byte) []int {
+ n := len(s)
+ res := make([]int, n)
+ for i := range res {
+ res[i] = n
+ }
+ for i := 0; i < n; i++ {
+ if s[i] == c {
+ res[i] = 0
+ } else if i > 0 {
+ res[i] = res[i-1] + 1
+ }
+ }
+ for i := n - 1; i >= 0; i-- {
+ if i < n-1 && res[i+1]+1 < res[i] {
+ res[i] = res[i+1] + 1
+ }
+ }
+ return res
+}
+
+// 解法二
+func shortestToChar1(s string, c byte) []int {
+ res := make([]int, len(s))
+ for i := 0; i < len(s); i++ {
+ if s[i] == c {
+ res[i] = 0
+ } else {
+ left, right := math.MaxInt32, math.MaxInt32
+ for j := i + 1; j < len(s); j++ {
+ if s[j] == c {
+ right = j - i
+ break
+ }
+ }
+ for k := i - 1; k >= 0; k-- {
+ if s[k] == c {
+ left = i - k
+ break
+ }
+ }
+ res[i] = min(left, right)
+ }
+ }
+ return res
+}
+
+func min(a, b int) int {
+ if a > b {
+ return b
+ }
+ return a
+}
diff --git a/leetcode/0821.Shortest-Distance-to-a-Character/821. Shortest Distance to a Character_test.go b/leetcode/0821.Shortest-Distance-to-a-Character/821. Shortest Distance to a Character_test.go
new file mode 100644
index 000000000..0420139a0
--- /dev/null
+++ b/leetcode/0821.Shortest-Distance-to-a-Character/821. Shortest Distance to a Character_test.go
@@ -0,0 +1,48 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question821 struct {
+ para821
+ ans821
+}
+
+// para 是参数
+// one 代表第一个参数
+type para821 struct {
+ s string
+ c byte
+}
+
+// ans 是答案
+// one 代表第一个答案
+type ans821 struct {
+ one []int
+}
+
+func Test_Problem821(t *testing.T) {
+
+ qs := []question821{
+
+ {
+ para821{"loveleetcode", 'e'},
+ ans821{[]int{3, 2, 1, 0, 1, 0, 0, 1, 2, 2, 1, 0}},
+ },
+
+ {
+ para821{"baaa", 'b'},
+ ans821{[]int{0, 1, 2, 3}},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 821------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans821, q.para821
+ fmt.Printf("【input】:%v 【output】:%v\n", p, shortestToChar(p.s, p.c))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/0821.Shortest-Distance-to-a-Character/README.md b/leetcode/0821.Shortest-Distance-to-a-Character/README.md
new file mode 100644
index 000000000..48721fa20
--- /dev/null
+++ b/leetcode/0821.Shortest-Distance-to-a-Character/README.md
@@ -0,0 +1,99 @@
+# [821. Shortest Distance to a Character](https://leetcode.com/problems/shortest-distance-to-a-character/)
+
+## 题目
+
+Given a string `s` and a character `c` that occurs in `s`, return *an array of integers `answer` where* `answer.length == s.length` *and* `answer[i]` *is the shortest distance from* `s[i]` *to the character* `c` *in* `s`.
+
+**Example 1:**
+
+```
+Input: s = "loveleetcode", c = "e"
+Output: [3,2,1,0,1,0,0,1,2,2,1,0]
+```
+
+**Example 2:**
+
+```
+Input: s = "aaab", c = "b"
+Output: [3,2,1,0]
+```
+
+**Constraints:**
+
+- `1 <= s.length <= 104`
+- `s[i]` and `c` are lowercase English letters.
+- `c` occurs at least once in `s`.
+
+## 题目大意
+
+给定一个字符串 S 和一个字符 C。返回一个代表字符串 S 中每个字符到字符串 S 中的字符 C 的最短距离的数组。
+
+## 解题思路
+
+- 解法一：从左至右更新一遍到 C 的值距离，再从右至左更新一遍到 C 的值，取两者中的最小值。
+- 解法二：依次扫描字符串 S，针对每一个非字符 C 的字符，分别往左扫一次，往右扫一次，计算出距离目标字符 C 的距离，然后取左右两个距离的最小值存入最终答案数组中。
+
+## 代码
+
+```go
+package leetcode
+
+import (
+ "math"
+)
+
+// 解法一
+func shortestToChar(s string, c byte) []int {
+ n := len(s)
+ res := make([]int, n)
+ for i := range res {
+ res[i] = n
+ }
+ for i := 0; i < n; i++ {
+ if s[i] == c {
+ res[i] = 0
+ } else if i > 0 {
+ res[i] = res[i-1] + 1
+ }
+ }
+ for i := n - 1; i >= 0; i-- {
+ if i < n-1 && res[i+1]+1 < res[i] {
+ res[i] = res[i+1] + 1
+ }
+ }
+ return res
+}
+
+// 解法二
+func shortestToChar1(s string, c byte) []int {
+ res := make([]int, len(s))
+ for i := 0; i < len(s); i++ {
+ if s[i] == c {
+ res[i] = 0
+ } else {
+ left, right := math.MaxInt32, math.MaxInt32
+ for j := i + 1; j < len(s); j++ {
+ if s[j] == c {
+ right = j - i
+ break
+ }
+ }
+ for k := i - 1; k >= 0; k-- {
+ if s[k] == c {
+ left = i - k
+ break
+ }
+ }
+ res[i] = min(left, right)
+ }
+ }
+ return res
+}
+
+func min(a, b int) int {
+ if a > b {
+ return b
+ }
+ return a
+}
+```
\ No newline at end of file
diff --git a/leetcode/0823.Binary-Trees-With-Factors/823. Binary Trees With Factors.go b/leetcode/0823.Binary-Trees-With-Factors/823. Binary Trees With Factors.go
new file mode 100644
index 000000000..8c9b43925
--- /dev/null
+++ b/leetcode/0823.Binary-Trees-With-Factors/823. Binary Trees With Factors.go
@@ -0,0 +1,70 @@
+package leetcode
+
+import (
+ "sort"
+)
+
+const mod = 1e9 + 7
+
+// 解法一 DFS
+func numFactoredBinaryTrees(arr []int) int {
+ sort.Ints(arr)
+ numDict := map[int]bool{}
+ for _, num := range arr {
+ numDict[num] = true
+ }
+ dict, res := make(map[int][][2]int), 0
+ for i, num := range arr {
+ for j := i; j < len(arr) && num*arr[j] <= arr[len(arr)-1]; j++ {
+ tmp := num * arr[j]
+ if !numDict[tmp] {
+ continue
+ }
+ dict[tmp] = append(dict[tmp], [2]int{num, arr[j]})
+ }
+ }
+ cache := make(map[int]int)
+ for _, num := range arr {
+ res = (res + dfs(num, dict, cache)) % mod
+ }
+ return res
+}
+
+func dfs(num int, dict map[int][][2]int, cache map[int]int) int {
+ if val, ok := cache[num]; ok {
+ return val
+ }
+ res := 1
+ for _, tuple := range dict[num] {
+ a, b := tuple[0], tuple[1]
+ x, y := dfs(a, dict, cache), dfs(b, dict, cache)
+ tmp := x * y
+ if a != b {
+ tmp *= 2
+ }
+ res = (res + tmp) % mod
+ }
+ cache[num] = res
+ return res
+}
+
+// 解法二 DP
+func numFactoredBinaryTrees1(arr []int) int {
+ dp := make(map[int]int)
+ sort.Ints(arr)
+ for i, curNum := range arr {
+ for j := 0; j < i; j++ {
+ factor := arr[j]
+ quotient, remainder := curNum/factor, curNum%factor
+ if remainder == 0 {
+ dp[curNum] += dp[factor] * dp[quotient]
+ }
+ }
+ dp[curNum]++
+ }
+ totalCount := 0
+ for _, count := range dp {
+ totalCount += count
+ }
+ return totalCount % mod
+}
diff --git a/leetcode/0823.Binary-Trees-With-Factors/823. Binary Trees With Factors_test.go b/leetcode/0823.Binary-Trees-With-Factors/823. Binary Trees With Factors_test.go
new file mode 100644
index 000000000..02b8dd5eb
--- /dev/null
+++ b/leetcode/0823.Binary-Trees-With-Factors/823. Binary Trees With Factors_test.go
@@ -0,0 +1,47 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question823 struct {
+ para823
+ ans823
+}
+
+// para 是参数
+// one 代表第一个参数
+type para823 struct {
+ arr []int
+}
+
+// ans 是答案
+// one 代表第一个答案
+type ans823 struct {
+ one int
+}
+
+func Test_Problem823(t *testing.T) {
+
+ qs := []question823{
+
+ {
+ para823{[]int{2, 4}},
+ ans823{3},
+ },
+
+ {
+ para823{[]int{2, 4, 5, 10}},
+ ans823{7},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 823------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans823, q.para823
+ fmt.Printf("【input】:%v 【output】:%v\n", p, numFactoredBinaryTrees(p.arr))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/0823.Binary-Trees-With-Factors/README.md b/leetcode/0823.Binary-Trees-With-Factors/README.md
new file mode 100644
index 000000000..1423c497f
--- /dev/null
+++ b/leetcode/0823.Binary-Trees-With-Factors/README.md
@@ -0,0 +1,119 @@
+# [823. Binary Trees With Factors](https://leetcode.com/problems/binary-trees-with-factors/)
+
+
+## 题目
+
+Given an array of unique integers, `arr`, where each integer `arr[i]` is strictly greater than `1`.
+
+We make a binary tree using these integers, and each number may be used for any number of times. Each non-leaf node's value should be equal to the product of the values of its children.
+
+Return *the number of binary trees we can make*. The answer may be too large so return the answer **modulo** `109 + 7`.
+
+**Example 1:**
+
+```
+Input: arr = [2,4]
+Output: 3
+Explanation: We can make these trees: [2], [4], [4, 2, 2]
+```
+
+**Example 2:**
+
+```
+Input: arr = [2,4,5,10]
+Output: 7
+Explanation: We can make these trees: [2], [4], [5], [10], [4, 2, 2], [10, 2, 5], [10, 5, 2].
+```
+
+**Constraints:**
+
+- `1 <= arr.length <= 1000`
+- `2 <= arr[i] <= 10^9`
+
+## 题目大意
+
+给出一个含有不重复整数元素的数组，每个整数均大于 1。我们用这些整数来构建二叉树，每个整数可以使用任意次数。其中：每个非叶结点的值应等于它的两个子结点的值的乘积。满足条件的二叉树一共有多少个？返回的结果应模除 10 * 9 + 7。
+
+## 解题思路
+
+- 首先想到的是暴力解法，先排序，然后遍历所有节点，枚举两两乘积为第三个节点值的组合。然后枚举这些组合并构成树。这里计数的时候要注意，左右孩子如果不是对称的，左右子树相互对调又是一组解。但是这个方法超时了。原因是，暴力枚举了很多次重复的节点和组合。优化这里的方法就是把已经计算过的节点放入 `map` 中。这里有 2 层 `map`，第一层 `map` 记忆化的是两两乘积的组合，将父亲节点作为 `key`，左右 2 个孩子作为 `value`。第二层 `map` 记忆化的是以 `root` 为根节点此时二叉树的种类数，`key` 是 `root`，`value` 存的是种类数。这样优化以后，DFS 暴力解法可以 runtime beats 100%。
+- 另外一种解法是 DP。定义 `dp[i]` 代表以 `i` 为根节点的树的种类数。dp[i] 初始都是 1，因为所有节点自身可以形成为自身单个节点为 `root` 的树。同样需要先排序。状态转移方程是：
+
+ $$dp[i] = \sum_{j<i, k<i}^{}dp[j] * dp[k], j * k = i$$
+
+ 最后将 `dp[]` 数组中所有结果累加取模即为最终结果，时间复杂度 O(n^2)，空间复杂度 O(n)。
+
+## 代码
+
+```go
+package leetcode
+
+import (
+ "sort"
+)
+
+const mod = 1e9 + 7
+
+// 解法一 DFS
+func numFactoredBinaryTrees(arr []int) int {
+ sort.Ints(arr)
+ numDict := map[int]bool{}
+ for _, num := range arr {
+ numDict[num] = true
+ }
+ dict, res := make(map[int][][2]int), 0
+ for i, num := range arr {
+ for j := i; j < len(arr) && num*arr[j] <= arr[len(arr)-1]; j++ {
+ tmp := num * arr[j]
+ if !numDict[tmp] {
+ continue
+ }
+ dict[tmp] = append(dict[tmp], [2]int{num, arr[j]})
+ }
+ }
+ cache := make(map[int]int)
+ for _, num := range arr {
+ res = (res + dfs(num, dict, cache)) % mod
+ }
+ return res
+}
+
+func dfs(num int, dict map[int][][2]int, cache map[int]int) int {
+ if val, ok := cache[num]; ok {
+ return val
+ }
+ res := 1
+ for _, tuple := range dict[num] {
+ a, b := tuple[0], tuple[1]
+ x, y := dfs(a, dict, cache), dfs(b, dict, cache)
+ tmp := x * y
+ if a != b {
+ tmp *= 2
+ }
+ res = (res + tmp) % mod
+ }
+ cache[num] = res
+ return res
+}
+
+// 解法二 DP
+func numFactoredBinaryTrees1(arr []int) int {
+ dp := make(map[int]int)
+ sort.Ints(arr)
+ for i, curNum := range arr {
+ for j := 0; j < i; j++ {
+ factor := arr[j]
+ quotient, remainder := curNum/factor, curNum%factor
+ if remainder == 0 {
+ dp[curNum] += dp[factor] * dp[quotient]
+ }
+ }
+ dp[curNum]++
+ }
+ totalCount := 0
+ for _, count := range dp {
+ totalCount += count
+ }
+ return totalCount % mod
+}
+```
\ No newline at end of file
diff --git a/leetcode/0825.Friends-Of-Appropriate-Ages/825. Friends Of Appropriate Ages.go b/leetcode/0825.Friends-Of-Appropriate-Ages/825. Friends Of Appropriate Ages.go
new file mode 100644
index 000000000..ebb496c68
--- /dev/null
+++ b/leetcode/0825.Friends-Of-Appropriate-Ages/825. Friends Of Appropriate Ages.go
@@ -0,0 +1,67 @@
+package leetcocde
+
+import "sort"
+
+// 解法一 前缀和，时间复杂度 O(n)
+func numFriendRequests(ages []int) int {
+ count, prefixSum, res := make([]int, 121), make([]int, 121), 0
+ for _, age := range ages {
+ count[age]++
+ }
+ for i := 1; i < 121; i++ {
+ prefixSum[i] = prefixSum[i-1] + count[i]
+ }
+ for i := 15; i < 121; i++ {
+ if count[i] > 0 {
+ bound := i/2 + 8
+ res += count[i] * (prefixSum[i] - prefixSum[bound-1] - 1)
+ }
+ }
+ return res
+}
+
+// 解法二 双指针 + 排序，时间复杂度 O(n logn)
+func numFriendRequests1(ages []int) int {
+ sort.Ints(ages)
+ left, right, res := 0, 0, 0
+ for _, age := range ages {
+ if age < 15 {
+ continue
+ }
+ for ages[left]*2 <= age+14 {
+ left++
+ }
+ for right+1 < len(ages) && ages[right+1] <= age {
+ right++
+ }
+ res += right - left
+ }
+ return res
+}
+
+// 解法三 暴力解法 O(n^2)
+func numFriendRequests2(ages []int) int {
+ res, count := 0, [125]int{}
+ for _, x := range ages {
+ count[x]++
+ }
+ for i := 1; i <= 120; i++ {
+ for j := 1; j <= 120; j++ {
+ if j > i {
+ continue
+ }
+ if (j-7)*2 <= i {
+ continue
+ }
+ if j > 100 && i < 100 {
+ continue
+ }
+ if i != j {
+ res += count[i] * count[j]
+ } else {
+ res += count[i] * (count[j] - 1)
+ }
+ }
+ }
+ return res
+}
diff --git a/leetcode/0825.Friends-Of-Appropriate-Ages/825. Friends Of Appropriate Ages_test.go b/leetcode/0825.Friends-Of-Appropriate-Ages/825. Friends Of Appropriate Ages_test.go
new file mode 100644
index 000000000..ee891c63e
--- /dev/null
+++ b/leetcode/0825.Friends-Of-Appropriate-Ages/825. Friends Of Appropriate Ages_test.go
@@ -0,0 +1,52 @@
+package leetcocde
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question825 struct {
+ para825
+ ans825
+}
+
+// para 是参数
+// one 代表第一个参数
+type para825 struct {
+ ages []int
+}
+
+// ans 是答案
+// one 代表第一个答案
+type ans825 struct {
+ one int
+}
+
+func Test_Problem825(t *testing.T) {
+
+ qs := []question825{
+
+ {
+ para825{[]int{16, 16}},
+ ans825{2},
+ },
+
+ {
+ para825{[]int{16, 17, 18}},
+ ans825{2},
+ },
+
+ {
+ para825{[]int{20, 30, 100, 110, 120}},
+ ans825{3},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 825------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans825, q.para825
+ fmt.Printf("【input】:%v 【output】:%v\n", p, numFriendRequests(p.ages))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/0825.Friends-Of-Appropriate-Ages/README.md b/leetcode/0825.Friends-Of-Appropriate-Ages/README.md
new file mode 100644
index 000000000..6249cc44c
--- /dev/null
+++ b/leetcode/0825.Friends-Of-Appropriate-Ages/README.md
@@ -0,0 +1,141 @@
+# [825. Friends Of Appropriate Ages](https://leetcode.com/problems/friends-of-appropriate-ages/)
+
+
+## 题目
+
+There are `n` persons on a social media website. You are given an integer array `ages` where `ages[i]` is the age of the `ith` person.
+
+A Person `x` will not send a friend request to a person `y` (`x != y`) if any of the following conditions is true:
+
+- `age[y] <= 0.5 * age+ 7`
+- `age[y] > age[x]`
+- `age[y] > 100 && age< 100`
+
+Otherwise, `x` will send a friend request to `y`.
+
+Note that if `x` sends a request to `y`, `y` will not necessarily send a request to `x`. Also, a person will not send a friend request to themself.
+
+Return *the total number of friend requests made*.
+
+**Example 1:**
+
+```
+Input: ages = [16,16]
+Output: 2
+Explanation: 2 people friend request each other.
+
+```
+
+**Example 2:**
+
+```
+Input: ages = [16,17,18]
+Output: 2
+Explanation: Friend requests are made 17 -> 16, 18 -> 17.
+
+```
+
+**Example 3:**
+
+```
+Input: ages = [20,30,100,110,120]
+Output: 3
+Explanation: Friend requests are made 110 -> 100, 120 -> 110, 120 -> 100.
+
+```
+
+**Constraints:**
+
+- `n == ages.length`
+- `1 <= n <= 2 * 10^4`
+- `1 <= ages[i] <= 120`
+
+## 题目大意
+
+在社交媒体网站上有 n 个用户。给你一个整数数组 ages ，其中 ages[i] 是第 i 个用户的年龄。
+
+如果下述任意一个条件为真，那么用户 x 将不会向用户 y（x != y）发送好友请求：
+
+- ages[y] <= 0.5 * ages[x] + 7
+- ages[y] > ages[x]
+- ages[y] > 100 && ages[x] < 100
+
+否则，x 将会向 y 发送一条好友请求。注意，如果 x 向 y 发送一条好友请求，y 不必也向 x 发送一条好友请求。另外，用户不会向自己发送好友请求。返回在该社交媒体网站上产生的好友请求总数。
+
+## 解题思路
+
+- 解法三，暴力解法。先统计 [1,120] 范围内每个年龄的人数。然后利用题目中的三个判断条件，筛选符合条件的用户对。需要注意的是，相同年龄的人可以相互发送好友请求。不同年龄的人发送好友请求是单向的，即年龄老的向年龄轻的发送好友请求，年龄轻的不会对年龄老的发送好友请求。
+- 解法二，排序 + 双指针。题目给定的 3 个条件其实是 2 个。条件 3 包含在条件 2 中。条件 1 和条件 2 组合起来是 `0.5 × ages[x]+7 < ages[y] ≤ ages[x]`。当 ages[x] 小于 15 时，这个等式无解。考虑到年龄是单调递增的，`(0.5 × ages[x]+7,ages[x]]` 这个区间左右边界也是单调递增的。于是可以用双指针维护两个边界。在区间 [left, right] 内，这些下标对应的的 y 值都满足条件。当 `ages[left] > 0.5 × ages[x]+7` 时，左指针停止右移。当 `ages[right+1] > ages[x]` 时， 右指针停止右移。在 `[left, right]` 区间内，满足条件的 y 有 `right-left+1` 个，即使得 `ages[y]` 取值在 `(0.5 × ages[x]+7,ages[x]]` 之间。依照题意，`x≠y`，即该区间右边界取不到。y 的取值个数需要再减一，减去的是取到和 x 相同的值的下标。那么每个区间能取 `right-left` 个值。累加所有满足条件的值即为好友请求总数。
+- 解法一。在解法二中，计算满足不等式 y 下标所在区间的时候，区间和区间存在重叠的情况，这些重叠情况导致了重复计算。所以这里可以优化。可以用 prefix sum 前缀和数组优化。代码见下方。
+
+## 代码
+
+```go
+package leetcocde
+
+import "sort"
+
+// 解法一 前缀和，时间复杂度 O(n)
+func numFriendRequests(ages []int) int {
+ count, prefixSum, res := make([]int, 121), make([]int, 121), 0
+ for _, age := range ages {
+ count[age]++
+ }
+ for i := 1; i < 121; i++ {
+ prefixSum[i] = prefixSum[i-1] + count[i]
+ }
+ for i := 15; i < 121; i++ {
+ if count[i] > 0 {
+ bound := i/2 + 8
+ res += count[i] * (prefixSum[i] - prefixSum[bound-1] - 1)
+ }
+ }
+ return res
+}
+
+// 解法二 双指针 + 排序，时间复杂度 O(n logn)
+func numFriendRequests1(ages []int) int {
+ sort.Ints(ages)
+ left, right, res := 0, 0, 0
+ for _, age := range ages {
+ if age < 15 {
+ continue
+ }
+ for ages[left]*2 <= age+14 {
+ left++
+ }
+ for right+1 < len(ages) && ages[right+1] <= age {
+ right++
+ }
+ res += right - left
+ }
+ return res
+}
+
+// 解法三 暴力解法 O(n^2)
+func numFriendRequests2(ages []int) int {
+ res, count := 0, [125]int{}
+ for _, x := range ages {
+ count[x]++
+ }
+ for i := 1; i <= 120; i++ {
+ for j := 1; j <= 120; j++ {
+ if j > i {
+ continue
+ }
+ if (j-7)*2 <= i {
+ continue
+ }
+ if j > 100 && i < 100 {
+ continue
+ }
+ if i != j {
+ res += count[i] * count[j]
+ } else {
+ res += count[i] * (count[j] - 1)
+ }
+ }
+ }
+ return res
+}
+```
\ No newline at end of file
diff --git a/leetcode/0828.COPYRIGHT-PROBLEM-XXX/README.md b/leetcode/0828.COPYRIGHT-PROBLEM-XXX/README.md
deleted file mode 100644
index b26bae01f..000000000
--- a/leetcode/0828.COPYRIGHT-PROBLEM-XXX/README.md
+++ /dev/null
@@ -1,28 +0,0 @@
-# [828. Unique Letter String](https://leetcode.com/problems/unique-letter-string/)
-
-## 题目
-
-THIS PROBLEM COPYRIGHT BELONGS TO CODILITY.COM
-
-**Example 1:**
-
-
-
-**Example 2:**
-
-
-
-## 题目大意
-
-如果一个字符在字符串 S 中有且仅有出现一次，那么我们称其为独特字符。例如，在字符串 S = "LETTER" 中，"L" 和 "R" 可以被称为独特字符。我们再定义 UNIQ(S) 作为字符串 S 中独特字符的个数。那么，在 S = "LETTER" 中， UNIQ("LETTER") = 2。
-
-对于给定字符串 S，计算其所有非空子串的独特字符的个数（即 UNIQ(substring)）之和。如果在 S 的不同位置上出现两个甚至多个相同的子串，那么我们认为这些子串是不同的。考虑到答案可能会非常大，规定返回格式为：结果 mod 10 ^ 9 + 7。
-
-
-## 解题思路
-
-- 这一题可以先用暴力解法尝试解题，不过提交以后会发现判题结果是超时。出错的一组数据是一个有 10000 个字符的字符串。暴力解法中间由于遍历了太多的子区间，导致了超时。
-- 这道题换一个角度思考问题。当子字符串中字符 X 出现了 2 次以上，那么它就对最终结果没有任何影响，所以只有当某个字符只出现一次的时候才会影响最终结果。再者，一个子字符串中不重复的字符的总个数，也就是这个子字符串 UNIQ 值。例如，“ABC”，这个子字符串的 UNIQ 值是 3，可以这样计算，它属于 A 的独特的字符串，也属于 B 的独特的字符串，也属于 C 的独特的字符串，那么计算这个子字符串的问题可以分解成计算 A 有多少个独特的子字符串，B 有多少个独特的子字符串，C 有多少个独特的子字符串的问题。在计算 A 有多少个子字符串的问题的时候，里面肯定会包含 "ABC" 这个子字符串的。所以原问题就转换成了分别计算给出的字符串中每个字符出现在独特字符串中的总数之和。
-- 假设原字符串是 BAABBABBBAAABA，这个字符串中出现了很多 A 和很多 B，假设我们当前计算到了第 3 个 A 的位置了(index = 5)，即标红色的那个 A。如何计算这个 A 在哪些子字符串中是独特的呢？由于子字符串题目中要求必须是连续的区间，所以这个问题很简单。找到这个 A 前一个 A 的下标位置(index = 2)，再找到这个 A 后一个 A 的下标位置(index = 9)，即 BAABBABBBAAABA，第一个 A 和当前计算的 A 中间区间有 2 个字符，第三个 A 和当前计算的 A 中间有 3 个字符。那么当前计算的 A 出现在 `(2 + 1) * (3 + 1) = 12` 个子字符串中是独特的，这 12 个字符串是：`A`，`BA`，`BBA`，`AB`，`ABB`，`ABBB`，`BAB`，`BABB`，`BABBB`，`BBAB`，`BBABB`，`BBABBB`。计算方法，假设当前待计算的字符的下标是 i ，找到当前字符前一次出现的下标位置 left，再找到当前字符后一次出现的下标位置 right，那么左边区间 (left,i) 的**开区间**内包含的字符数是 i - left - 1，右边区间 (i,right) 的**开区间**内包含的字符数是 right - i - 1。左右两边都还需要考虑空字符串的情况，即左右两边都可以不取任何字符，那么对应的就是只有中间这个待计算的字符 `A`。所以左右两边都还需要再加上空串的情况，左边 i - left - 1 + 1 = i - left，右边 right - i - 1 + 1 = right - i。左右两边的情况进行排列组合，即 (i - left) * (right - i)。针对字符串的每个字符都计算这样的值，最后累积的总和就是题目中要求的总 UNIQ 值。
-
-
diff --git a/leetcode/0828.COPYRIGHT-PROBLEM-XXX/828. Unique Letter String.go b/leetcode/0828.Count-Unique-Characters-of-All-Substrings-of-a-Given-String/828. Count Unique Characters of All Substrings of a Given String.go
similarity index 100%
rename from leetcode/0828.COPYRIGHT-PROBLEM-XXX/828. Unique Letter String.go
rename to leetcode/0828.Count-Unique-Characters-of-All-Substrings-of-a-Given-String/828. Count Unique Characters of All Substrings of a Given String.go
diff --git a/leetcode/0828.COPYRIGHT-PROBLEM-XXX/828. Unique Letter String_test.go b/leetcode/0828.Count-Unique-Characters-of-All-Substrings-of-a-Given-String/828. Count Unique Characters of All Substrings of a Given String_test.go
similarity index 100%
rename from leetcode/0828.COPYRIGHT-PROBLEM-XXX/828. Unique Letter String_test.go
rename to leetcode/0828.Count-Unique-Characters-of-All-Substrings-of-a-Given-String/828. Count Unique Characters of All Substrings of a Given String_test.go
diff --git a/leetcode/0828.Count-Unique-Characters-of-All-Substrings-of-a-Given-String/README.md b/leetcode/0828.Count-Unique-Characters-of-All-Substrings-of-a-Given-String/README.md
new file mode 100644
index 000000000..fd29a4af2
--- /dev/null
+++ b/leetcode/0828.Count-Unique-Characters-of-All-Substrings-of-a-Given-String/README.md
@@ -0,0 +1,101 @@
+# [828. Count Unique Characters of All Substrings of a Given String](https://leetcode.com/problems/count-unique-characters-of-all-substrings-of-a-given-string/)
+
+
+## 题目
+
+Let's define a function `countUniqueChars(s)` that returns the number of unique characters on `s`, for example if `s = "LEETCODE"` then `"L"`, `"T"`,`"C"`,`"O"`,`"D"` are the unique characters since they appear only once in `s`, therefore `countUniqueChars(s) = 5`.On this problem given a string `s` we need to return the sum of `countUniqueChars(t)` where `t` is a substring of `s`. Notice that some substrings can be repeated so on this case you have to count the repeated ones too.
+
+Since the answer can be very large, return the answer modulo `10 ^ 9 + 7`.
+
+**Example 1:**
+
+```
+Input: s = "ABC"
+Output: 10
+Explanation: All possible substrings are: "A","B","C","AB","BC" and "ABC".
+Evey substring is composed with only unique letters.
+Sum of lengths of all substring is 1 + 1 + 1 + 2 + 2 + 3 = 10
+
+```
+
+**Example 2:**
+
+```
+Input: s = "ABA"
+Output: 8
+Explanation: The same as example 1, except countUniqueChars("ABA") = 1.
+
+```
+
+**Example 3:**
+
+```
+Input: s = "LEETCODE"
+Output: 92
+
+```
+
+**Constraints:**
+
+- `0 <= s.length <= 10^4`
+- `s` contain upper-case English letters only.
+
+## 题目大意
+
+如果一个字符在字符串 S 中有且仅有出现一次，那么我们称其为独特字符。例如，在字符串 S = "LETTER" 中，"L" 和 "R" 可以被称为独特字符。我们再定义 UNIQ(S) 作为字符串 S 中独特字符的个数。那么，在 S = "LETTER" 中， UNIQ("LETTER") = 2。
+
+对于给定字符串 S，计算其所有非空子串的独特字符的个数（即 UNIQ(substring)）之和。如果在 S 的不同位置上出现两个甚至多个相同的子串，那么我们认为这些子串是不同的。考虑到答案可能会非常大，规定返回格式为：结果 mod 10 ^ 9 + 7。
+
+## 解题思路
+
+- 这一题可以先用暴力解法尝试解题，不过提交以后会发现判题结果是超时。出错的一组数据是一个有 10000 个字符的字符串。暴力解法中间由于遍历了太多的子区间，导致了超时。
+- 这道题换一个角度思考问题。当子字符串中字符 X 出现了 2 次以上，那么它就对最终结果没有任何影响，所以只有当某个字符只出现一次的时候才会影响最终结果。再者，一个子字符串中不重复的字符的总个数，也就是这个子字符串 UNIQ 值。例如，“ABC”，这个子字符串的 UNIQ 值是 3，可以这样计算，它属于 A 的独特的字符串，也属于 B 的独特的字符串，也属于 C 的独特的字符串，那么计算这个子字符串的问题可以分解成计算 A 有多少个独特的子字符串，B 有多少个独特的子字符串，C 有多少个独特的子字符串的问题。在计算 A 有多少个子字符串的问题的时候，里面肯定会包含 "ABC" 这个子字符串的。所以原问题就转换成了分别计算给出的字符串中每个字符出现在独特字符串中的总数之和。
+- 假设原字符串是 BAABBABBBAAABA，这个字符串中出现了很多 A 和很多 B，假设我们当前计算到了第 3 个 A 的位置了(index = 5)，即标红色的那个 A。如何计算这个 A 在哪些子字符串中是独特的呢？由于子字符串题目中要求必须是连续的区间，所以这个问题很简单。找到这个 A 前一个 A 的下标位置(index = 2)，再找到这个 A 后一个 A 的下标位置(index = 9)，即 BAABBABBBAAABA，第一个 A 和当前计算的 A 中间区间有 2 个字符，第三个 A 和当前计算的 A 中间有 3 个字符。那么当前计算的 A 出现在 `(2 + 1) * (3 + 1) = 12` 个子字符串中是独特的，这 12 个字符串是：`A`，`BA`，`BBA`，`AB`，`ABB`，`ABBB`，`BAB`，`BABB`，`BABBB`，`BBAB`，`BBABB`，`BBABBB`。计算方法，假设当前待计算的字符的下标是 i ，找到当前字符前一次出现的下标位置 left，再找到当前字符后一次出现的下标位置 right，那么左边区间 (left,i) 的***开区间****内包含的字符数是 i - left - 1，右边区间 (i,right) 的***开区间****内包含的字符数是 right - i - 1。左右两边都还需要考虑空字符串的情况，即左右两边都可以不取任何字符，那么对应的就是只有中间这个待计算的字符 `A`。所以左右两边都还需要再加上空串的情况，左边 i - left - 1 + 1 = i - left，右边 right - i - 1 + 1 = right - i。左右两边的情况进行排列组合，即 (i - left) * (right - i)。针对字符串的每个字符都计算这样的值，最后累积的总和就是题目中要求的总 UNIQ 值。
+
+## 代码
+
+```go
+package leetcode
+
+func uniqueLetterString(S string) int {
+ res, left, right := 0, 0, 0
+ for i := 0; i < len(S); i++ {
+ left = i - 1
+ for left >= 0 && S[left] != S[i] {
+ left--
+ }
+ right = i + 1
+ for right < len(S) && S[right] != S[i] {
+ right++
+ }
+ res += (i - left) * (right - i)
+ }
+ return res % 1000000007
+}
+
+// 暴力解法，超时！时间复杂度 O(n^2)
+func uniqueLetterString1(S string) int {
+ if len(S) == 0 {
+ return 0
+ }
+ res, mod := 0, 1000000007
+ for i := 0; i < len(S); i++ {
+ letterMap := map[byte]int{}
+ for j := i; j < len(S); j++ {
+ letterMap[S[j]]++
+ tmp := 0
+ for _, v := range letterMap {
+ if v > 1 {
+ tmp++
+ }
+ }
+ if tmp == len(letterMap) {
+ continue
+ } else {
+ res += len(letterMap) - tmp
+ }
+ }
+ }
+ return res % mod
+}
+```
\ No newline at end of file
diff --git a/leetcode/0830.Positions-of-Large-Groups/830. Positions of Large Groups.go b/leetcode/0830.Positions-of-Large-Groups/830. Positions of Large Groups.go
new file mode 100644
index 000000000..8b61b3380
--- /dev/null
+++ b/leetcode/0830.Positions-of-Large-Groups/830. Positions of Large Groups.go
@@ -0,0 +1,15 @@
+package leetcode
+
+func largeGroupPositions(S string) [][]int {
+ res, end := [][]int{}, 0
+ for end < len(S) {
+ start, str := end, S[end]
+ for end < len(S) && S[end] == str {
+ end++
+ }
+ if end-start >= 3 {
+ res = append(res, []int{start, end - 1})
+ }
+ }
+ return res
+}
diff --git a/leetcode/0830.Positions-of-Large-Groups/830. Positions of Large Groups_test.go b/leetcode/0830.Positions-of-Large-Groups/830. Positions of Large Groups_test.go
new file mode 100644
index 000000000..ed74b05a8
--- /dev/null
+++ b/leetcode/0830.Positions-of-Large-Groups/830. Positions of Large Groups_test.go
@@ -0,0 +1,57 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question830 struct {
+ para830
+ ans830
+}
+
+// para 是参数
+// one 代表第一个参数
+type para830 struct {
+ S string
+}
+
+// ans 是答案
+// one 代表第一个答案
+type ans830 struct {
+ one [][]int
+}
+
+func Test_Problem830(t *testing.T) {
+
+ qs := []question830{
+
+ {
+ para830{"abbxxxxzzy"},
+ ans830{[][]int{{3, 6}}},
+ },
+
+ {
+ para830{"abc"},
+ ans830{[][]int{{}}},
+ },
+
+ {
+ para830{"abcdddeeeeaabbbcd"},
+ ans830{[][]int{{3, 5}, {6, 9}, {12, 14}}},
+ },
+
+ {
+ para830{"aba"},
+ ans830{[][]int{{}}},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 830------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans830, q.para830
+ fmt.Printf("【input】:%v 【output】:%v\n", p, largeGroupPositions(p.S))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/0830.Positions-of-Large-Groups/README.md b/leetcode/0830.Positions-of-Large-Groups/README.md
new file mode 100644
index 000000000..5323f2e08
--- /dev/null
+++ b/leetcode/0830.Positions-of-Large-Groups/README.md
@@ -0,0 +1,80 @@
+# [830. Positions of Large Groups](https://leetcode.com/problems/positions-of-large-groups/)
+
+
+## 题目
+
+In a string `s` of lowercase letters, these letters form consecutive groups of the same character.
+
+For example, a string like `s = "abbxxxxzyy"` has the groups `"a"`, `"bb"`, `"xxxx"`, `"z"`, and `"yy"`.
+
+A group is identified by an interval `[start, end]`, where `start` and `end` denote the start and end indices (inclusive) of the group. In the above example, `"xxxx"` has the interval `[3,6]`.
+
+A group is considered **large** if it has 3 or more characters.
+
+Return *the intervals of every **large** group sorted in **increasing order by start index***.
+
+**Example 1:**
+
+```
+Input: s = "abbxxxxzzy"
+Output: [[3,6]]
+Explanation: "xxxx" is the only large group with start index 3 and end index 6.
+```
+
+**Example 2:**
+
+```
+Input: s = "abc"
+Output: []
+Explanation: We have groups "a", "b", and "c", none of which are large groups.
+```
+
+**Example 3:**
+
+```
+Input: s = "abcdddeeeeaabbbcd"
+Output: [[3,5],[6,9],[12,14]]
+Explanation: The large groups are "ddd", "eeee", and "bbb".
+```
+
+**Example 4:**
+
+```
+Input: s = "aba"
+Output: []
+```
+
+**Constraints:**
+
+- `1 <= s.length <= 1000`
+- `s` contains lower-case English letters only.
+
+## 题目大意
+
+在一个由小写字母构成的字符串 s 中，包含由一些连续的相同字符所构成的分组。例如，在字符串 s = "abbxxxxzyy" 中，就含有 "a", "bb", "xxxx", "z" 和 "yy" 这样的一些分组。分组可以用区间 [start, end] 表示，其中 start 和 end 分别表示该分组的起始和终止位置的下标。上例中的 "xxxx" 分组用区间表示为 [3,6] 。我们称所有包含大于或等于三个连续字符的分组为 较大分组 。
+
+找到每一个 较大分组 的区间，按起始位置下标递增顺序排序后，返回结果。
+
+## 解题思路
+
+- 简单题。利用滑动窗口的思想，先扩大窗口的右边界，找到能相同字母且能到达的最右边。记录左右边界。再将窗口的左边界移动到上一次的右边界处。以此类推，重复扩大窗口的右边界，直至扫完整个字符串。最终所有满足题意的较大分组区间都在数组中了。
+
+## 代码
+
+```go
+package leetcode
+
+func largeGroupPositions(S string) [][]int {
+ res, end := [][]int{}, 0
+ for end < len(S) {
+ start, str := end, S[end]
+ for end < len(S) && S[end] == str {
+ end++
+ }
+ if end-start >= 3 {
+ res = append(res, []int{start, end - 1})
+ }
+ }
+ return res
+}
+```
\ No newline at end of file
diff --git a/leetcode/0842.Split-Array-into-Fibonacci-Sequence/842. Split Array into Fibonacci Sequence.go b/leetcode/0842.Split-Array-into-Fibonacci-Sequence/842. Split Array into Fibonacci Sequence.go
index 78c8b9847..f6851cbab 100644
--- a/leetcode/0842.Split-Array-into-Fibonacci-Sequence/842. Split Array into Fibonacci Sequence.go
+++ b/leetcode/0842.Split-Array-into-Fibonacci-Sequence/842. Split Array into Fibonacci Sequence.go
@@ -32,7 +32,7 @@ func splitIntoFibonacci(S string) []int {
return res
}
-//Propagate for rest of the string
+// Propagate for rest of the string
func findRecursiveCheck(S string, x1 int, x2 int, left int, res *[]int, isComplete *bool) {
if x1 >= 1<<31 || x2 >= 1<<31 { // 题目要求每个数都要小于 2^31 - 1 = 2147483647，此处剪枝很关键！
return
diff --git a/leetcode/0846.Hand-of-Straights/846.Hand of Straights.go b/leetcode/0846.Hand-of-Straights/846.Hand of Straights.go
new file mode 100644
index 000000000..ea54dda76
--- /dev/null
+++ b/leetcode/0846.Hand-of-Straights/846.Hand of Straights.go
@@ -0,0 +1,23 @@
+package leetcode
+
+import "sort"
+
+func isNStraightHand(hand []int, groupSize int) bool {
+ mp := make(map[int]int)
+ for _, v := range hand {
+ mp[v] += 1
+ }
+ sort.Ints(hand)
+ for _, num := range hand {
+ if mp[num] == 0 {
+ continue
+ }
+ for diff := 0; diff < groupSize; diff++ {
+ if mp[num+diff] == 0 {
+ return false
+ }
+ mp[num+diff] -= 1
+ }
+ }
+ return true
+}
diff --git a/leetcode/0846.Hand-of-Straights/846.Hand of Straights_test.go b/leetcode/0846.Hand-of-Straights/846.Hand of Straights_test.go
new file mode 100644
index 000000000..2a172eb0e
--- /dev/null
+++ b/leetcode/0846.Hand-of-Straights/846.Hand of Straights_test.go
@@ -0,0 +1,46 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question846 struct {
+ para846
+ ans846
+}
+
+// para 是参数
+type para846 struct {
+ hand []int
+ groupSize int
+}
+
+// ans 是答案
+type ans846 struct {
+ ans bool
+}
+
+func Test_Problem846(t *testing.T) {
+
+ qs := []question846{
+
+ {
+ para846{[]int{1, 2, 3, 6, 2, 3, 4, 7, 8}, 3},
+ ans846{true},
+ },
+
+ {
+ para846{[]int{1, 2, 3, 4, 5}, 4},
+ ans846{false},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 846------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans846, q.para846
+ fmt.Printf("【input】:%v 【output】:%v\n", p, isNStraightHand(p.hand, p.groupSize))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/0846.Hand-of-Straights/README.md b/leetcode/0846.Hand-of-Straights/README.md
new file mode 100644
index 000000000..5df17ba73
--- /dev/null
+++ b/leetcode/0846.Hand-of-Straights/README.md
@@ -0,0 +1,68 @@
+# [846. Hand of Straights](https://leetcode.com/problems/hand-of-straights/)
+
+## 题目
+
+Alice has some number of cards and she wants to rearrange the cards into groups so that each group is of size groupSize, and consists of groupSize consecutive cards.
+
+Given an integer array hand where hand[i] is the value written on the ith card and an integer groupSize, return true if she can rearrange the cards, or false otherwise.
+
+**Example 1**:
+
+ Input: hand = [1,2,3,6,2,3,4,7,8], groupSize = 3
+ Output: true
+ Explanation: Alice's hand can be rearranged as [1,2,3],[2,3,4],[6,7,8]
+
+**Example 2**:
+
+ Input: hand = [1,2,3,4,5], groupSize = 4
+ Output: false
+ Explanation: Alice's hand can not be rearranged into groups of 4.
+
+**Constraints:**
+
+- 1 <= hand.length <= 10000
+- 0 <= hand[i] <= 1000000000
+- 1 <= groupSize <= hand.length
+
+## 题目大意
+
+Alice 手中有一把牌，她想要重新排列这些牌，分成若干组，使每一组的牌数都是 groupSize ，并且由 groupSize 张连续的牌组成。
+
+给你一个整数数组 hand 其中 hand[i] 是写在第 i 张牌，和一个整数 groupSize 。如果她可能重新排列这些牌，返回 true ；否则，返回 false 。
+
+## 解题思路
+
+贪心算法
+
+- 对hand升序排序
+- 对hand内数字进行哈希计数（key:数字，value:数量）
+- 遍历hand中的数字，以数量大于1的数字作为顺子开头，寻找顺子后续元素，若无法找到完整顺子则返回false
+- 所有数字都能找到完整顺子返回true
+
+##代码
+
+```go
+package leetcode
+
+import "sort"
+
+func isNStraightHand(hand []int, groupSize int) bool {
+ mp := make(map[int]int)
+ for _, v := range hand {
+ mp[v] += 1
+ }
+ sort.Ints(hand)
+ for _, num := range hand {
+ if mp[num] == 0 {
+ continue
+ }
+ for diff := 0; diff < groupSize; diff++ {
+ if mp[num+diff] == 0 {
+ return false
+ }
+ mp[num+diff] -= 1
+ }
+ }
+ return true
+}
+```
\ No newline at end of file
diff --git a/leetcode/0859.Buddy-Strings/859.Buddy Strings.go b/leetcode/0859.Buddy-Strings/859.Buddy Strings.go
new file mode 100644
index 000000000..8688f16e3
--- /dev/null
+++ b/leetcode/0859.Buddy-Strings/859.Buddy Strings.go
@@ -0,0 +1,30 @@
+package leetcode
+
+func buddyStrings(s string, goal string) bool {
+ if len(s) != len(goal) || len(s) <= 1 {
+ return false
+ }
+ mp := make(map[byte]int)
+ if s == goal {
+ for i := 0; i < len(s); i++ {
+ if _, ok := mp[s[i]]; ok {
+ return true
+ }
+ mp[s[i]]++
+ }
+ return false
+ }
+ first, second := -1, -1
+ for i := 0; i < len(s); i++ {
+ if s[i] != goal[i] {
+ if first == -1 {
+ first = i
+ } else if second == -1 {
+ second = i
+ } else {
+ return false
+ }
+ }
+ }
+ return second != -1 && s[first] == goal[second] && s[second] == goal[first]
+}
diff --git a/leetcode/0859.Buddy-Strings/859.Buddy Strings_test.go b/leetcode/0859.Buddy-Strings/859.Buddy Strings_test.go
new file mode 100644
index 000000000..3085e448e
--- /dev/null
+++ b/leetcode/0859.Buddy-Strings/859.Buddy Strings_test.go
@@ -0,0 +1,56 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question859 struct {
+ para859
+ ans859
+}
+
+// para 是参数
+type para859 struct {
+ s string
+ goal string
+}
+
+// ans 是答案
+type ans859 struct {
+ ans bool
+}
+
+func Test_Problem859(t *testing.T) {
+
+ qs := []question859{
+
+ {
+ para859{"ab", "ba"},
+ ans859{true},
+ },
+
+ {
+ para859{"ab", "ab"},
+ ans859{false},
+ },
+
+ {
+ para859{"aa", "aa"},
+ ans859{true},
+ },
+
+ {
+ para859{"aaaaaaabc", "aaaaaaacb"},
+ ans859{true},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 859------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans859, q.para859
+ fmt.Printf("【input】:%v 【output】:%v\n", p, buddyStrings(p.s, p.goal))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/0859.Buddy-Strings/README.md b/leetcode/0859.Buddy-Strings/README.md
new file mode 100644
index 000000000..7a7e5c650
--- /dev/null
+++ b/leetcode/0859.Buddy-Strings/README.md
@@ -0,0 +1,87 @@
+# [859. Buddy Strings](https://leetcode.com/problems/buddy-strings/)
+
+## 题目
+
+Given two strings s and goal, return true if you can swap two letters in s so the result is equal to goal, otherwise, return false.
+
+Swapping letters is defined as taking two indices i and j (0-indexed) such that i != j and swapping the characters at s[i] and s[j].
+
+For example, swapping at indices 0 and 2 in "abcd" results in "cbad".
+
+**Example 1**:
+
+ Input: s = "ab", goal = "ba"
+ Output: true
+ Explanation: You can swap s[0] = 'a' and s[1] = 'b' to get "ba", which is equal to goal.
+
+**Example 2**:
+
+ Input: s = "ab", goal = "ab"
+ Output: false
+ Explanation: The only letters you can swap are s[0] = 'a' and s[1] = 'b', which results in "ba" != goal.
+
+**Example 3**:
+
+ Input: s = "aa", goal = "aa"
+ Output: true
+ Explanation: You can swap s[0] = 'a' and s[1] = 'a' to get "aa", which is equal to goal.
+
+**Example 4**:
+
+ Input: s = "aaaaaaabc", goal = "aaaaaaacb"
+ Output: true
+
+**Constraints:**
+
+- 1 <= s.length, goal.length <= 2 * 10000
+- s and goal consist of lowercase letters.
+
+## 题目大意
+
+给你两个字符串 s 和 goal ，只要我们可以通过交换 s 中的两个字母得到与 goal 相等的结果，就返回 true；否则返回 false 。
+
+交换字母的定义是：取两个下标 i 和 j （下标从 0 开始）且满足 i != j ，接着交换 s[i] 和 s[j] 处的字符。
+
+例如，在 "abcd" 中交换下标 0 和下标 2 的元素可以生成 "cbad" 。
+
+## 解题思路
+
+分为两种情况进行比较:
+- s 等于 goal, s 中有重复元素就返回 true,否则返回 false
+- s 不等于 goal, s 中有两个下标不同的字符与 goal 中对应下标的字符分别相等
+
+## 代码
+
+```go
+
+package leetcode
+
+func buddyStrings(s string, goal string) bool {
+ if len(s) != len(goal) || len(s) <= 1 {
+ return false
+ }
+ mp := make(map[byte]int)
+ if s == goal {
+ for i := 0; i < len(s); i++ {
+ if _, ok := mp[s[i]]; ok {
+ return true
+ }
+ mp[s[i]]++
+ }
+ return false
+ }
+ first, second := -1, -1
+ for i := 0; i < len(s); i++ {
+ if s[i] != goal[i] {
+ if first == -1 {
+ first = i
+ } else if second == -1 {
+ second = i
+ } else {
+ return false
+ }
+ }
+ }
+ return second != -1 && s[first] == goal[second] && s[second] == goal[first]
+}
+```
\ No newline at end of file
diff --git a/leetcode/0869.Reordered-Power-of-2/869. Reordered Power of 2.go b/leetcode/0869.Reordered-Power-of-2/869. Reordered Power of 2.go
new file mode 100644
index 000000000..a04c8c1bd
--- /dev/null
+++ b/leetcode/0869.Reordered-Power-of-2/869. Reordered Power of 2.go
@@ -0,0 +1,32 @@
+package leetcode
+
+import "fmt"
+
+func reorderedPowerOf2(n int) bool {
+ sample, i := fmt.Sprintf("%v", n), 1
+ for len(fmt.Sprintf("%v", i)) <= len(sample) {
+ t := fmt.Sprintf("%v", i)
+ if len(t) == len(sample) && isSame(t, sample) {
+ return true
+ }
+ i = i << 1
+ }
+ return false
+}
+
+func isSame(t, s string) bool {
+ m := make(map[rune]int)
+ for _, v := range t {
+ m[v]++
+ }
+ for _, v := range s {
+ m[v]--
+ if m[v] < 0 {
+ return false
+ }
+ if m[v] == 0 {
+ delete(m, v)
+ }
+ }
+ return len(m) == 0
+}
diff --git a/leetcode/0869.Reordered-Power-of-2/869. Reordered Power of 2_test.go b/leetcode/0869.Reordered-Power-of-2/869. Reordered Power of 2_test.go
new file mode 100644
index 000000000..37682d596
--- /dev/null
+++ b/leetcode/0869.Reordered-Power-of-2/869. Reordered Power of 2_test.go
@@ -0,0 +1,72 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question869 struct {
+ para869
+ ans869
+}
+
+// para 是参数
+// one 代表第一个参数
+type para869 struct {
+ n int
+}
+
+// ans 是答案
+// one 代表第一个答案
+type ans869 struct {
+ one bool
+}
+
+func Test_Problem869(t *testing.T) {
+
+ qs := []question869{
+
+ {
+ para869{1},
+ ans869{true},
+ },
+
+ {
+ para869{10},
+ ans869{false},
+ },
+
+ {
+ para869{16},
+ ans869{true},
+ },
+
+ {
+ para869{24},
+ ans869{false},
+ },
+
+ {
+ para869{46},
+ ans869{true},
+ },
+
+ {
+ para869{100},
+ ans869{false},
+ },
+
+ {
+ para869{123453242},
+ ans869{false},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 869------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans869, q.para869
+ fmt.Printf("【input】:%v 【output】:%v\n", p, reorderedPowerOf2(p.n))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/0869.Reordered-Power-of-2/README.md b/leetcode/0869.Reordered-Power-of-2/README.md
new file mode 100644
index 000000000..106c6a38c
--- /dev/null
+++ b/leetcode/0869.Reordered-Power-of-2/README.md
@@ -0,0 +1,93 @@
+# [869. Reordered Power of 2](https://leetcode.com/problems/reordered-power-of-2/)
+
+
+## 题目
+
+Starting with a positive integer `N`, we reorder the digits in any order (including the original order) such that the leading digit is not zero.
+
+Return `true` if and only if we can do this in a way such that the resulting number is a power of 2.
+
+**Example 1:**
+
+```
+Input:1
+Output:true
+```
+
+**Example 2:**
+
+```
+Input:10
+Output:false
+```
+
+**Example 3:**
+
+```
+Input:16
+Output:true
+```
+
+**Example 4:**
+
+```
+Input:24
+Output:false
+```
+
+**Example 5:**
+
+```
+Input:46
+Output:true
+```
+
+**Note:**
+
+1. `1 <= N <= 10^9`
+
+## 题目大意
+
+给定正整数 N ，我们按任何顺序（包括原始顺序）将数字重新排序，注意其前导数字不能为零。如果我们可以通过上述方式得到 2 的幂，返回 true；否则，返回 false。
+
+## 解题思路
+
+- 将整数每个位上的所有排列看成字符串，那么题目转换为判断这些字符串是否和 2 的幂的字符串是否一致。判断的方法有很多种，笔者这里判断借助了一个 `map`。两个不同排列的字符串要相等，所有字符出现的频次必定一样。利用一个 `map` 统计它们各自字符的频次，最终都一致，则判定这两个字符串是满足题意的。
+- 此题数据量比较小，在 `[1,10^9]` 这个区间内，2 的幂只有 30 几个，所以最终要判断的字符串就是这 30 几个。笔者这里没有打表了，采用更加一般的做法。数据量更大，此解法代码也能通过。
+
+## 代码
+
+```go
+package leetcode
+
+import "fmt"
+
+func reorderedPowerOf2(n int) bool {
+ sample, i := fmt.Sprintf("%v", n), 1
+ for len(fmt.Sprintf("%v", i)) <= len(sample) {
+ t := fmt.Sprintf("%v", i)
+ if len(t) == len(sample) && isSame(t, sample) {
+ return true
+ }
+ i = i << 1
+ }
+ return false
+}
+
+func isSame(t, s string) bool {
+ m := make(map[rune]int)
+ for _, v := range t {
+ m[v]++
+ }
+ for _, v := range s {
+ m[v]--
+ if m[v] < 0 {
+ return false
+ }
+ if m[v] == 0 {
+ delete(m, v)
+ }
+ }
+ return len(m) == 0
+}
+```
\ No newline at end of file
diff --git a/leetcode/0870.Advantage-Shuffle/870. Advantage Shuffle.go b/leetcode/0870.Advantage-Shuffle/870. Advantage Shuffle.go
new file mode 100644
index 000000000..a938d3d0a
--- /dev/null
+++ b/leetcode/0870.Advantage-Shuffle/870. Advantage Shuffle.go
@@ -0,0 +1,31 @@
+package leetcode
+
+import "sort"
+
+func advantageCount1(A []int, B []int) []int {
+ n := len(A)
+ sort.Ints(A)
+ sortedB := make([]int, n)
+ for i := range sortedB {
+ sortedB[i] = i
+ }
+ sort.Slice(sortedB, func(i, j int) bool {
+ return B[sortedB[i]] < B[sortedB[j]]
+ })
+ useless, i, res := make([]int, 0), 0, make([]int, n)
+ for _, index := range sortedB {
+ b := B[index]
+ for i < n && A[i] <= b {
+ useless = append(useless, A[i])
+ i++
+ }
+ if i < n {
+ res[index] = A[i]
+ i++
+ } else {
+ res[index] = useless[0]
+ useless = useless[1:]
+ }
+ }
+ return res
+}
diff --git a/leetcode/0870.Advantage-Shuffle/870. Advantage Shuffle_test.go b/leetcode/0870.Advantage-Shuffle/870. Advantage Shuffle_test.go
new file mode 100644
index 000000000..9c58982eb
--- /dev/null
+++ b/leetcode/0870.Advantage-Shuffle/870. Advantage Shuffle_test.go
@@ -0,0 +1,48 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question870 struct {
+ para870
+ ans870
+}
+
+// para 是参数
+// one 代表第一个参数
+type para870 struct {
+ A []int
+ B []int
+}
+
+// ans 是答案
+// one 代表第一个答案
+type ans870 struct {
+ one []int
+}
+
+func Test_Problem870(t *testing.T) {
+
+ qs := []question870{
+
+ {
+ para870{[]int{2, 7, 11, 15}, []int{1, 10, 4, 11}},
+ ans870{[]int{2, 11, 7, 15}},
+ },
+
+ {
+ para870{[]int{12, 24, 8, 32}, []int{13, 25, 32, 11}},
+ ans870{[]int{24, 32, 8, 12}},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 870------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans870, q.para870
+ fmt.Printf("【input】:%v 【output】:%v\n", p, advantageCount1(p.A, p.B))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/0870.Advantage-Shuffle/README.md b/leetcode/0870.Advantage-Shuffle/README.md
new file mode 100644
index 000000000..d7b8ee44d
--- /dev/null
+++ b/leetcode/0870.Advantage-Shuffle/README.md
@@ -0,0 +1,72 @@
+# [870. Advantage Shuffle](https://leetcode.com/problems/advantage-shuffle/)
+
+## 题目
+
+Given two arrays `A` and `B` of equal size, the *advantage of `A` with respect to `B`* is the number of indices `i` for which `A[i] > B[i]`.
+
+Return **any** permutation of `A` that maximizes its advantage with respect to `B`.
+
+**Example 1:**
+
+```
+Input:A = [2,7,11,15], B = [1,10,4,11]
+Output:[2,11,7,15]
+```
+
+**Example 2:**
+
+```
+Input:A = [12,24,8,32], B = [13,25,32,11]
+Output:[24,32,8,12]
+```
+
+**Note:**
+
+1. `1 <= A.length = B.length <= 10000`
+2. `0 <= A[i] <= 10^9`
+3. `0 <= B[i] <= 10^9`
+
+## 题目大意
+
+给定两个大小相等的数组 A 和 B，A 相对于 B 的优势可以用满足 A[i] > B[i] 的索引 i 的数目来描述。返回 A 的任意排列，使其相对于 B 的优势最大化。
+
+## 解题思路
+
+- 此题用贪心算法解题。如果 A 中最小的牌 a 能击败 B 中最小的牌 b，那么将它们配对。否则， a 将无益于我们的比分，因为它无法击败任何牌。这是贪心的策略，每次匹配都用手中最弱的牌和 B 中的最小牌 b 进行配对，这样会使 A 中剩余的牌严格的变大，最后会使得得分更多。
+- 在代码实现中，将 A 数组排序，B 数组按照下标排序。因为最终输出的是相对于 B 的优势结果，所以要针对 B 的下标不变来安排 A 的排列。排好序以后按照贪心策略选择 A 中牌的顺序。
+
+## 代码
+
+```go
+package leetcode
+
+import "sort"
+
+func advantageCount1(A []int, B []int) []int {
+ n := len(A)
+ sort.Ints(A)
+ sortedB := make([]int, n)
+ for i := range sortedB {
+ sortedB[i] = i
+ }
+ sort.Slice(sortedB, func(i, j int) bool {
+ return B[sortedB[i]] < B[sortedB[j]]
+ })
+ useless, i, res := make([]int, 0), 0, make([]int, n)
+ for _, index := range sortedB {
+ b := B[index]
+ for i < n && A[i] <= b {
+ useless = append(useless, A[i])
+ i++
+ }
+ if i < n {
+ res[index] = A[i]
+ i++
+ } else {
+ res[index] = useless[0]
+ useless = useless[1:]
+ }
+ }
+ return res
+}
+```
\ No newline at end of file
diff --git a/leetcode/0874.Walking-Robot-Simulation/874. Walking Robot Simulation.go b/leetcode/0874.Walking-Robot-Simulation/874. Walking Robot Simulation.go
new file mode 100644
index 000000000..9393000b0
--- /dev/null
+++ b/leetcode/0874.Walking-Robot-Simulation/874. Walking Robot Simulation.go
@@ -0,0 +1,38 @@
+package leetcode
+
+func robotSim(commands []int, obstacles [][]int) int {
+ m := make(map[[2]int]struct{})
+ for _, v := range obstacles {
+ if len(v) != 0 {
+ m[[2]int{v[0], v[1]}] = struct{}{}
+ }
+ }
+ directX := []int{0, 1, 0, -1}
+ directY := []int{1, 0, -1, 0}
+ direct, x, y := 0, 0, 0
+ result := 0
+ for _, c := range commands {
+ if c == -2 {
+ direct = (direct + 3) % 4
+ continue
+ }
+ if c == -1 {
+ direct = (direct + 1) % 4
+ continue
+ }
+ for ; c > 0; c-- {
+ nextX := x + directX[direct]
+ nextY := y + directY[direct]
+ if _, ok := m[[2]int{nextX, nextY}]; ok {
+ break
+ }
+ tmpResult := nextX*nextX + nextY*nextY
+ if tmpResult > result {
+ result = tmpResult
+ }
+ x = nextX
+ y = nextY
+ }
+ }
+ return result
+}
diff --git a/leetcode/0874.Walking-Robot-Simulation/874. Walking Robot Simulation_test.go b/leetcode/0874.Walking-Robot-Simulation/874. Walking Robot Simulation_test.go
new file mode 100644
index 000000000..2553a4099
--- /dev/null
+++ b/leetcode/0874.Walking-Robot-Simulation/874. Walking Robot Simulation_test.go
@@ -0,0 +1,39 @@
+package leetcode
+
+import "testing"
+
+func Test_robotSim(t *testing.T) {
+ type args struct {
+ commands []int
+ obstacles [][]int
+ }
+ cases := []struct {
+ name string
+ args args
+ want int
+ }{
+ {
+ "case 1",
+ args{
+ commands: []int{4, -1, 3},
+ obstacles: [][]int{{}},
+ },
+ 25,
+ },
+ {
+ "case 2",
+ args{
+ commands: []int{4, -1, 4, -2, 4},
+ obstacles: [][]int{{2, 4}},
+ },
+ 65,
+ },
+ }
+ for _, tt := range cases {
+ t.Run(tt.name, func(t *testing.T) {
+ if got := robotSim(tt.args.commands, tt.args.obstacles); got != tt.want {
+ t.Errorf("robotSim() = %v, want %v", got, tt.want)
+ }
+ })
+ }
+}
diff --git a/leetcode/0874.Walking-Robot-Simulation/README.md b/leetcode/0874.Walking-Robot-Simulation/README.md
new file mode 100644
index 000000000..aac2857de
--- /dev/null
+++ b/leetcode/0874.Walking-Robot-Simulation/README.md
@@ -0,0 +1,135 @@
+# [874. Walking Robot Simulation](https://leetcode.com/problems/walking-robot-simulation/)
+
+
+## 题目
+
+A robot on an infinite XY-plane starts at point `(0, 0)` and faces north. The robot can receive one of three possible types of `commands`:
+
+- `2`: turn left `90` degrees,
+- `1`: turn right `90` degrees, or
+- `1 <= k <= 9`: move forward `k` units.
+
+Some of the grid squares are `obstacles`. The `ith` obstacle is at grid point `obstacles[i] = (xi, yi)`.
+
+If the robot would try to move onto them, the robot stays on the previous grid square instead (but still continues following the rest of the route.)
+
+Return *the maximum Euclidean distance that the robot will be from the origin **squared** (i.e. if the distance is* `5`*, return* `25`*)*.
+
+**Note:**
+
+- North means +Y direction.
+- East means +X direction.
+- South means -Y direction.
+- West means -X direction.
+
+**Example 1:**
+
+```
+Input: commands = [4,-1,3], obstacles = []
+Output: 25
+Explanation: The robot starts at (0, 0):
+1. Move north 4 units to (0, 4).
+2. Turn right.
+3. Move east 3 units to (3, 4).
+The furthest point away from the origin is (3, 4), which is 32 + 42 = 25 units away.
+
+```
+
+**Example 2:**
+
+```
+Input: commands = [4,-1,4,-2,4], obstacles = [[2,4]]
+Output: 65
+Explanation: The robot starts at (0, 0):
+1. Move north 4 units to (0, 4).
+2. Turn right.
+3. Move east 1 unit and get blocked by the obstacle at (2, 4), robot is at (1, 4).
+4. Turn left.
+5. Move north 4 units to (1, 8).
+The furthest point away from the origin is (1, 8), which is 12 + 82 = 65 units away.
+
+```
+
+**Constraints:**
+
+- `1 <= commands.length <= 104`
+- `commands[i]` is one of the values in the list `[-2,-1,1,2,3,4,5,6,7,8,9]`.
+- `0 <= obstacles.length <= 104`
+- `3 * 104 <= xi, yi <= 3 * 104`
+- The answer is guaranteed to be less than `231`.
+
+## 题目大意
+
+机器人在一个无限大小的 XY 网格平面上行走，从点 (0, 0) 处开始出发，面向北方。该机器人可以接收以下三种类型的命令 commands ：
+
+- 2 ：向左转 90 度
+- -1 ：向右转 90 度
+- 1 <= x <= 9 ：向前移动 x 个单位长度
+
+在网格上有一些格子被视为障碍物 obstacles 。第 i 个障碍物位于网格点 obstacles[i] = (xi, yi) 。机器人无法走到障碍物上，它将会停留在障碍物的前一个网格方块上，但仍然可以继续尝试进行该路线的其余部分。返回从原点到机器人所有经过的路径点（坐标为整数）的最大欧式距离的平方。（即，如果距离为 5 ，则返回 25 ）
+
+注意：
+
+- 北表示 +Y 方向。
+- 东表示 +X 方向。
+- 南表示 -Y 方向。
+- 西表示 -X 方向。
+
+## 解题思路
+
+- 这个题的难点在于，怎么用编程语言去描述机器人的行为，可以用以下数据结构表达机器人的行为：
+
+ ```go
+ direct:= 0 // direct表示机器人移动方向：0 1 2 3 4 （北东南西），默认朝北
+ x, y := 0, 0 // 表示当前机器人所在横纵坐标位置，默认为(0,0)
+ directX := []int{0, 1, 0, -1}
+ directY := []int{1, 0, -1, 0}
+ // 组合directX directY和direct，表示机器人往某一个方向移动
+ nextX := x + directX[direct]
+ nextY := y + directY[direct]
+ ```
+
+ 其他代码按照题意翻译即可
+
+## 代码
+
+```go
+package leetcode
+
+func robotSim(commands []int, obstacles [][]int) int {
+ m := make(map[[2]int]struct{})
+ for _, v := range obstacles {
+ if len(v) != 0 {
+ m[[2]int{v[0], v[1]}] = struct{}{}
+ }
+ }
+ directX := []int{0, 1, 0, -1}
+ directY := []int{1, 0, -1, 0}
+ direct, x, y := 0, 0, 0
+ result := 0
+ for _, c := range commands {
+ if c == -2 {
+ direct = (direct + 3) % 4
+ continue
+ }
+ if c == -1 {
+ direct = (direct + 1) % 4
+ continue
+ }
+ for ; c > 0; c-- {
+ nextX := x + directX[direct]
+ nextY := y + directY[direct]
+ if _, ok := m[[2]int{nextX, nextY}]; ok {
+ break
+ }
+ tmpResult := nextX*nextX + nextY*nextY
+ if tmpResult > result {
+ result = tmpResult
+ }
+ x = nextX
+ y = nextY
+ }
+ }
+ return result
+}
+```
\ No newline at end of file
diff --git a/leetcode/0875.Koko-Eating-Bananas/875. Koko Eating Bananas_test.go b/leetcode/0875.Koko-Eating-Bananas/875. Koko Eating Bananas_test.go
index a2a6eba65..b9fcc115e 100644
--- a/leetcode/0875.Koko-Eating-Bananas/875. Koko Eating Bananas_test.go
+++ b/leetcode/0875.Koko-Eating-Bananas/875. Koko Eating Bananas_test.go
@@ -41,6 +41,11 @@ func Test_Problem875(t *testing.T) {
para875{[]int{30, 11, 23, 4, 20}, 6},
ans875{23},
},
+
+ {
+ para875{[]int{4, 9, 11, 17}, 8},
+ ans875{6},
+ },
}
fmt.Printf("------------------------Leetcode Problem 875------------------------\n")
diff --git a/leetcode/0877.Stone-Game/877. Stone Game.go b/leetcode/0877.Stone-Game/877. Stone Game.go
new file mode 100644
index 000000000..86a89974d
--- /dev/null
+++ b/leetcode/0877.Stone-Game/877. Stone Game.go
@@ -0,0 +1,5 @@
+package leetcode
+
+func stoneGame(piles []int) bool {
+ return true
+}
diff --git a/leetcode/0877.Stone-Game/877. Stone Game_test.go b/leetcode/0877.Stone-Game/877. Stone Game_test.go
new file mode 100644
index 000000000..316c42c48
--- /dev/null
+++ b/leetcode/0877.Stone-Game/877. Stone Game_test.go
@@ -0,0 +1,42 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question877 struct {
+ para877
+ ans877
+}
+
+// para 是参数
+// one 代表第一个参数
+type para877 struct {
+ piles []int
+}
+
+// ans 是答案
+// one 代表第一个答案
+type ans877 struct {
+ one bool
+}
+
+func Test_Problem877(t *testing.T) {
+
+ qs := []question877{
+
+ {
+ para877{[]int{5, 3, 4, 5}},
+ ans877{true},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 877------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans877, q.para877
+ fmt.Printf("【input】:%v 【output】:%v\n", p, stoneGame(p.piles))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/0877.Stone-Game/README.md b/leetcode/0877.Stone-Game/README.md
new file mode 100644
index 000000000..6a23bfad6
--- /dev/null
+++ b/leetcode/0877.Stone-Game/README.md
@@ -0,0 +1,50 @@
+# [877. Stone Game](https://leetcode.com/problems/stone-game/)
+
+## 题目
+
+Alex and Lee play a game with piles of stones. There are an even number of piles **arranged in a row**, and each pile has a positive integer number of stones `piles[i]`.
+
+The objective of the game is to end with the most stones. The total number of stones is odd, so there are no ties.
+
+Alex and Lee take turns, with Alex starting first. Each turn, a player takes the entire pile of stones from either the beginning or the end of the row. This continues until there are no more piles left, at which point the person with the most stones wins.
+
+Assuming Alex and Lee play optimally, return `True` if and only if Alex wins the game.
+
+**Example 1:**
+
+```
+Input: piles = [5,3,4,5]
+Output: true
+Explanation:
+Alex starts first, and can only take the first 5 or the last 5.
+Say he takes the first 5, so that the row becomes [3, 4, 5].
+If Lee takes 3, then the board is [4, 5], and Alex takes 5 to win with 10 points.
+If Lee takes the last 5, then the board is [3, 4], and Alex takes 4 to win with 9 points.
+This demonstrated that taking the first 5 was a winning move for Alex, so we return true.
+
+```
+
+**Constraints:**
+
+- `2 <= piles.length <= 500`
+- `piles.length` is even.
+- `1 <= piles[i] <= 500`
+- `sum(piles)` is odd.
+
+## 题目大意
+
+亚历克斯和李用几堆石子在做游戏。偶数堆石子排成一行，每堆都有正整数颗石子 piles[i] 。游戏以谁手中的石子最多来决出胜负。石子的总数是奇数，所以没有平局。亚历克斯和李轮流进行，亚历克斯先开始。 每回合，玩家从行的开始或结束处取走整堆石头。 这种情况一直持续到没有更多的石子堆为止，此时手中石子最多的玩家获胜。假设亚历克斯和李都发挥出最佳水平，当亚历克斯赢得比赛时返回 true ，当李赢得比赛时返回 false 。
+
+## 解题思路
+
+- 一遇到石子问题，很容易让人联想到是否和奇偶数相关。此题指定了石子堆数一定是偶数。所以从这里为突破口试试。Alex 先拿，要么取行首下标为 0 的石子，要么取行尾下标为 n-1 的石子。假设取下标为 0 的石子，剩下的石子堆下标从 1 ~ n-1，即 Lee 只能从奇数下标的石子堆 1 或者 n-1。假设 Alex 第一次取下标为 n-1 的石子，剩下的石子堆下标从 0 ~ n-2，即 Lee 只能取偶数下标的石子堆。于是 Alex 的必胜策略是每轮取石子，取此轮奇数下标堆石子数总和，偶数下标堆石子数总和，两者大者。那么下一轮 Lee 只能取石子堆数相对少的那一堆，并且 Lee 取的石子堆下标奇偶性是完全受到上一轮 Alex 控制的。所以只要是 Alex 先手，那么每轮都可以压制 Lee，从而必胜。
+
+## 代码
+
+```go
+package leetcode
+
+func stoneGame(piles []int) bool {
+ return true
+}
+```
\ No newline at end of file
diff --git a/leetcode/0890.Find-and-Replace-Pattern/890. Find and Replace Pattern.go b/leetcode/0890.Find-and-Replace-Pattern/890. Find and Replace Pattern.go
new file mode 100644
index 000000000..0a3300f3b
--- /dev/null
+++ b/leetcode/0890.Find-and-Replace-Pattern/890. Find and Replace Pattern.go
@@ -0,0 +1,32 @@
+package leetcode
+
+func findAndReplacePattern(words []string, pattern string) []string {
+ res := make([]string, 0)
+ for _, word := range words {
+ if match(word, pattern) {
+ res = append(res, word)
+ }
+ }
+ return res
+}
+
+func match(w, p string) bool {
+ if len(w) != len(p) {
+ return false
+ }
+ m, used := make(map[uint8]uint8), make(map[uint8]bool)
+ for i := 0; i < len(w); i++ {
+ if v, ok := m[p[i]]; ok {
+ if w[i] != v {
+ return false
+ }
+ } else {
+ if used[w[i]] {
+ return false
+ }
+ m[p[i]] = w[i]
+ used[w[i]] = true
+ }
+ }
+ return true
+}
diff --git a/leetcode/0890.Find-and-Replace-Pattern/890. Find and Replace Pattern_test.go b/leetcode/0890.Find-and-Replace-Pattern/890. Find and Replace Pattern_test.go
new file mode 100644
index 000000000..3fdfd1971
--- /dev/null
+++ b/leetcode/0890.Find-and-Replace-Pattern/890. Find and Replace Pattern_test.go
@@ -0,0 +1,48 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question890 struct {
+ para890
+ ans890
+}
+
+// para 是参数
+// one 代表第一个参数
+type para890 struct {
+ words []string
+ pattern string
+}
+
+// ans 是答案
+// one 代表第一个答案
+type ans890 struct {
+ one []string
+}
+
+func Test_Problem890(t *testing.T) {
+
+ qs := []question890{
+
+ {
+ para890{[]string{"abc", "deq", "mee", "aqq", "dkd", "ccc"}, "abb"},
+ ans890{[]string{"mee", "aqq"}},
+ },
+
+ {
+ para890{[]string{"a", "b", "c"}, "a"},
+ ans890{[]string{"a", "b", "c"}},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 890------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans890, q.para890
+ fmt.Printf("【input】:%v 【output】:%v\n", p, findAndReplacePattern(p.words, p.pattern))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/0890.Find-and-Replace-Pattern/README.md b/leetcode/0890.Find-and-Replace-Pattern/README.md
new file mode 100644
index 000000000..c2cb6bb50
--- /dev/null
+++ b/leetcode/0890.Find-and-Replace-Pattern/README.md
@@ -0,0 +1,78 @@
+# [890. Find and Replace Pattern](https://leetcode.com/problems/find-and-replace-pattern/)
+
+
+## 题目
+
+Given a list of strings `words` and a string `pattern`, return *a list of* `words[i]` *that match* `pattern`. You may return the answer in **any order**.
+
+A word matches the pattern if there exists a permutation of letters `p` so that after replacing every letter `x` in the pattern with `p(x)`, we get the desired word.
+
+Recall that a permutation of letters is a bijection from letters to letters: every letter maps to another letter, and no two letters map to the same letter.
+
+**Example 1:**
+
+```
+Input: words = ["abc","deq","mee","aqq","dkd","ccc"], pattern = "abb"
+Output: ["mee","aqq"]
+Explanation: "mee" matches the pattern because there is a permutation {a -> m, b -> e, ...}.
+"ccc" does not match the pattern because {a -> c, b -> c, ...} is not a permutation, since a and b map to the same letter.
+```
+
+**Example 2:**
+
+```
+Input: words = ["a","b","c"], pattern = "a"
+Output: ["a","b","c"]
+```
+
+**Constraints:**
+
+- `1 <= pattern.length <= 20`
+- `1 <= words.length <= 50`
+- `words[i].length == pattern.length`
+- `pattern` and `words[i]` are lowercase English letters.
+
+## 题目大意
+
+你有一个单词列表 words 和一个模式 pattern，你想知道 words 中的哪些单词与模式匹配。如果存在字母的排列 p ，使得将模式中的每个字母 x 替换为 p(x) 之后，我们就得到了所需的单词，那么单词与模式是匹配的。（回想一下，字母的排列是从字母到字母的双射：每个字母映射到另一个字母，没有两个字母映射到同一个字母。）返回 words 中与给定模式匹配的单词列表。你可以按任何顺序返回答案。
+
+## 解题思路
+
+- 按照题目要求，分别映射两个字符串，words 字符串数组中的字符串与 pattern 字符串每个字母做映射。这里用 map 存储。题目还要求不存在 2 个字母映射到同一个字母的情况，所以再增加一个 map，用来判断当前字母是否已经被映射过了。以上 2 个条件都满足即代表模式匹配上了。最终将所有满足模式匹配的字符串输出即可。
+
+## 代码
+
+```go
+package leetcode
+
+func findAndReplacePattern(words []string, pattern string) []string {
+ res := make([]string, 0)
+ for _, word := range words {
+ if match(word, pattern) {
+ res = append(res, word)
+ }
+ }
+ return res
+}
+
+func match(w, p string) bool {
+ if len(w) != len(p) {
+ return false
+ }
+ m, used := make(map[uint8]uint8), make(map[uint8]bool)
+ for i := 0; i < len(w); i++ {
+ if v, ok := m[p[i]]; ok {
+ if w[i] != v {
+ return false
+ }
+ } else {
+ if used[w[i]] {
+ return false
+ }
+ m[p[i]] = w[i]
+ used[w[i]] = true
+ }
+ }
+ return true
+}
+```
\ No newline at end of file
diff --git a/leetcode/0909.Snakes-and-Ladders/909. Snakes and Ladders.go b/leetcode/0909.Snakes-and-Ladders/909. Snakes and Ladders.go
new file mode 100644
index 000000000..51c8c6be3
--- /dev/null
+++ b/leetcode/0909.Snakes-and-Ladders/909. Snakes and Ladders.go
@@ -0,0 +1,42 @@
+package leetcode
+
+type pair struct {
+ id, step int
+}
+
+func snakesAndLadders(board [][]int) int {
+ n := len(board)
+ visited := make([]bool, n*n+1)
+ queue := []pair{{1, 0}}
+ for len(queue) > 0 {
+ p := queue[0]
+ queue = queue[1:]
+ for i := 1; i <= 6; i++ {
+ nxt := p.id + i
+ if nxt > n*n { // 超出边界
+ break
+ }
+ r, c := getRowCol(nxt, n) // 得到下一步的行列
+ if board[r][c] > 0 { // 存在蛇或梯子
+ nxt = board[r][c]
+ }
+ if nxt == n*n { // 到达终点
+ return p.step + 1
+ }
+ if !visited[nxt] {
+ visited[nxt] = true
+ queue = append(queue, pair{nxt, p.step + 1}) // 扩展新状态
+ }
+ }
+ }
+ return -1
+}
+
+func getRowCol(id, n int) (r, c int) {
+ r, c = (id-1)/n, (id-1)%n
+ if r%2 == 1 {
+ c = n - 1 - c
+ }
+ r = n - 1 - r
+ return r, c
+}
diff --git a/leetcode/0909.Snakes-and-Ladders/909. Snakes and Ladders_test.go b/leetcode/0909.Snakes-and-Ladders/909. Snakes and Ladders_test.go
new file mode 100644
index 000000000..7d3d5ba16
--- /dev/null
+++ b/leetcode/0909.Snakes-and-Ladders/909. Snakes and Ladders_test.go
@@ -0,0 +1,45 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question909 struct {
+ para909
+ ans909
+}
+
+// para 是参数
+// one 代表第一个参数
+type para909 struct {
+ one [][]int
+}
+
+// ans 是答案
+// one 代表第一个答案
+type ans909 struct {
+ one int
+}
+
+func Test_Problem909(t *testing.T) {
+ qs := []question909{
+ {
+ para909{[][]int{
+ {-1, -1, -1, -1, -1, -1},
+ {-1, -1, -1, -1, -1, -1},
+ {-1, -1, -1, -1, -1, -1},
+ {-1, 35, -1, -1, 13, -1},
+ {-1, -1, -1, -1, -1, -1},
+ {-1, 15, -1, -1, -1, -1},
+ }},
+ ans909{4},
+ },
+ }
+ fmt.Printf("------------------------Leetcode Problem 909------------------------\n")
+ for _, q := range qs {
+ _, p := q.ans909, q.para909
+ fmt.Printf("【input】:%v 【output】:%v\n", p, snakesAndLadders(p.one))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/0909.Snakes-and-Ladders/README.md b/leetcode/0909.Snakes-and-Ladders/README.md
new file mode 100644
index 000000000..43b899568
--- /dev/null
+++ b/leetcode/0909.Snakes-and-Ladders/README.md
@@ -0,0 +1,110 @@
+# [909. Snakes and Ladders](https://leetcode.com/problems/snakes-and-ladders/)
+
+
+## 题目
+
+On an N x N `board`, the numbers from `1` to `N*N` are written *boustrophedonically* **starting from the bottom left of the board**, and alternating direction each row. For example, for a 6 x 6 board, the numbers are written as follows:
+
+
+
+
+You start on square `1` of the board (which is always in the last row and first column). Each move, starting from square `x`, consists of the following:
+
+- You choose a destination square `S` with number `x+1`, `x+2`, `x+3`, `x+4`, `x+5`, or `x+6`, provided this number is `<= N*N`.
+ - (This choice simulates the result of a standard 6-sided die roll: ie., there are always **at most 6 destinations, regardless of the size of the board**.)
+- If `S` has a snake or ladder, you move to the destination of that snake or ladder. Otherwise, you move to `S`.
+
+A board square on row `r` and column `c` has a "snake or ladder" if `board[r][c] != -1`. The destination of that snake or ladder is `board[r][c]`.
+
+Note that you only take a snake or ladder at most once per move: if the destination to a snake or ladder is the start of another snake or ladder, you do **not** continue moving. (For example, if the board is `[[4,-1],[-1,3]]`, and on the first move your destination square is `2`, then you finish your first move at `3`, because you do **not** continue moving to `4`.)
+
+Return the least number of moves required to reach square N*N. If it is not possible, return `-1`.
+
+**Example 1:**
+
+```
+Input:[
+[-1,-1,-1,-1,-1,-1],
+[-1,-1,-1,-1,-1,-1],
+[-1,-1,-1,-1,-1,-1],
+[-1,35,-1,-1,13,-1],
+[-1,-1,-1,-1,-1,-1],
+[-1,15,-1,-1,-1,-1]]
+Output:4
+Explanation:
+At the beginning, you start at square 1 [at row 5, column 0].
+You decide to move to square 2, and must take the ladder to square 15.
+You then decide to move to square 17 (row 3, column 5), and must take the snake to square 13.
+You then decide to move to square 14, and must take the ladder to square 35.
+You then decide to move to square 36, ending the game.
+It can be shown that you need at least 4 moves to reach the N*N-th square, so the answer is 4.
+
+```
+
+**Note:**
+
+1. `2 <= board.length = board[0].length <= 20`
+2. `board[i][j]` is between `1` and `N*N` or is equal to `1`.
+3. The board square with number `1` has no snake or ladder.
+4. The board square with number `N*N` has no snake or ladder.
+
+## 题目大意
+
+N x N 的棋盘 board 上，按从 1 到 N*N 的数字给方格编号，编号 从左下角开始，每一行交替方向。r 行 c 列的棋盘，按前述方法编号，棋盘格中可能存在 “蛇” 或 “梯子”；如果 board[r][c] != -1，那个蛇或梯子的目的地将会是 board[r][c]。玩家从棋盘上的方格 1 （总是在最后一行、第一列）开始出发。每一回合，玩家需要从当前方格 x 开始出发，按下述要求前进：选定目标方格：
+
+- 选择从编号 x+1，x+2，x+3，x+4，x+5，或者 x+6 的方格中选出一个目标方格 s ，目标方格的编号 <= N*N。该选择模拟了掷骰子的情景，无论棋盘大小如何，你的目的地范围也只能处于区间 [x+1, x+6] 之间。
+- 传送玩家：如果目标方格 S 处存在蛇或梯子，那么玩家会传送到蛇或梯子的目的地。否则，玩家传送到目标方格 S。
+
+注意，玩家在每回合的前进过程中最多只能爬过蛇或梯子一次：就算目的地是另一条蛇或梯子的起点，你也不会继续移动。返回达到方格 N*N 所需的最少移动次数，如果不可能，则返回 -1。
+
+## 解题思路
+
+- 这一题可以抽象为在有向图上求下标 1 的起点到下标 `N^2` 的终点的最短路径。用广度优先搜索。棋盘可以抽象成一个包含 `N^2` 个节点的有向图，对于每个节点 `x`，若 `x+i (1 ≤ i ≤ 6)` 上没有蛇或梯子，则连一条从 `x` 到 `x+i` 的有向边；否则记蛇梯的目的地为 `y`，连一条从 `x` 到 `y` 的有向边。然后按照最短路径的求解方式便可解题。时间复杂度 O(n^2)，空间复杂度 O(n^2)。
+- 此题棋盘上的下标是蛇形的，所以遍历下一个点的时候需要转换坐标。具体做法根据行的奇偶性，行号为偶数，下标从左往右，行号为奇数，下标从右往左。具体实现见 `getRowCol()` 函数。
+
+## 代码
+
+```go
+package leetcode
+
+type pair struct {
+ id, step int
+}
+
+func snakesAndLadders(board [][]int) int {
+ n := len(board)
+ visited := make([]bool, n*n+1)
+ queue := []pair{{1, 0}}
+ for len(queue) > 0 {
+ p := queue[0]
+ queue = queue[1:]
+ for i := 1; i <= 6; i++ {
+ nxt := p.id + i
+ if nxt > n*n { // 超出边界
+ break
+ }
+ r, c := getRowCol(nxt, n) // 得到下一步的行列
+ if board[r][c] > 0 { // 存在蛇或梯子
+ nxt = board[r][c]
+ }
+ if nxt == n*n { // 到达终点
+ return p.step + 1
+ }
+ if !visited[nxt] {
+ visited[nxt] = true
+ queue = append(queue, pair{nxt, p.step + 1}) // 扩展新状态
+ }
+ }
+ }
+ return -1
+}
+
+func getRowCol(id, n int) (r, c int) {
+ r, c = (id-1)/n, (id-1)%n
+ if r%2 == 1 {
+ c = n - 1 - c
+ }
+ r = n - 1 - r
+ return r, c
+}
+```
\ No newline at end of file
diff --git a/leetcode/0910.Smallest-Range-II/910.Smallest Range II.go b/leetcode/0910.Smallest-Range-II/910.Smallest Range II.go
new file mode 100644
index 000000000..a2543300b
--- /dev/null
+++ b/leetcode/0910.Smallest-Range-II/910.Smallest Range II.go
@@ -0,0 +1,30 @@
+package leetcode
+
+import "sort"
+
+func smallestRangeII(A []int, K int) int {
+ n := len(A)
+ sort.Ints(A)
+ res := A[n-1] - A[0]
+ for i := 0; i < n-1; i++ {
+ a, b := A[i], A[i+1]
+ high := max(A[n-1]-K, a+K)
+ low := min(A[0]+K, b-K)
+ res = min(res, high-low)
+ }
+ return res
+}
+
+func max(a, b int) int {
+ if a > b {
+ return a
+ }
+ return b
+}
+
+func min(a, b int) int {
+ if a < b {
+ return a
+ }
+ return b
+}
diff --git a/leetcode/0910.Smallest-Range-II/910.Smallest Range II_test.go b/leetcode/0910.Smallest-Range-II/910.Smallest Range II_test.go
new file mode 100644
index 000000000..f1a83a99a
--- /dev/null
+++ b/leetcode/0910.Smallest-Range-II/910.Smallest Range II_test.go
@@ -0,0 +1,48 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question910 struct {
+ para910
+ ans910
+}
+
+type para910 struct {
+ A []int
+ K int
+}
+
+type ans910 struct {
+ one int
+}
+
+// Test_Problem910 ...
+func Test_Problem910(t *testing.T) {
+
+ qs := []question910{
+
+ {
+ para910{[]int{1}, 0},
+ ans910{0},
+ },
+ {
+ para910{[]int{0, 10}, 2},
+ ans910{6},
+ },
+ {
+ para910{[]int{1, 3, 6}, 3},
+ ans910{3},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 910------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans910, q.para910
+ fmt.Printf("【input】:%v 【output】:%v\n", p, smallestRangeII(p.A, p.K))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/0910.Smallest-Range-II/README.md b/leetcode/0910.Smallest-Range-II/README.md
new file mode 100644
index 000000000..e8a3d8ff7
--- /dev/null
+++ b/leetcode/0910.Smallest-Range-II/README.md
@@ -0,0 +1,82 @@
+# [910. Smallest Range II](https://leetcode.com/problems/smallest-range-ii/)
+
+## 题目
+
+Given an array `A` of integers, for each integer `A[i]` we need to choose **either `x = -K` or `x = K`**, and add `x` to `A[i]` **(only once)**.
+
+After this process, we have some array `B`.
+
+Return the smallest possible difference between the maximum value of `B` and the minimum value of `B`.
+
+**Example 1:**
+
+```c
+Input: A = [1], K = 0
+Output: 0
+Explanation: B = [1]
+```
+
+**Example 2:**
+
+```c
+Input: A = [0,10], K = 2
+Output: 6
+Explanation: B = [2,8]
+```
+
+**Example 3:**
+
+```c
+Input: A = [1,3,6], K = 3
+Output: 3
+Explanation: B = [4,6,3]
+```
+
+**Note:**
+
+1. `1 <= A.length <= 10000`
+2. `0 <= A[i] <= 10000`
+3. `0 <= K <= 10000`
+
+## 题目大意
+
+给你一个整数数组 A，对于每个整数 A[i]，可以选择 x = -K 或是 x = K （K 总是非负整数），并将 x 加到 A[i] 中。在此过程之后，得到数组 B。返回 B 的最大值和 B 的最小值之间可能存在的最小差值。
+
+## 解题思路
+
+- 简单题。先排序，找出 A 数组中最大的差值。然后循环扫一遍数组，利用双指针，选择 x = -K 或是 x = K ，每次选择都更新一次最大值和最小值之间的最小差值。循环一次以后便可以找到满足题意的答案。
+
+## 代码
+
+```go
+package leetcode
+
+import "sort"
+
+func smallestRangeII(A []int, K int) int {
+ n := len(A)
+ sort.Ints(A)
+ res := A[n-1] - A[0]
+ for i := 0; i < n-1; i++ {
+ a, b := A[i], A[i+1]
+ high := max(A[n-1]-K, a+K)
+ low := min(A[0]+K, b-K)
+ res = min(res, high-low)
+ }
+ return res
+}
+
+func max(a, b int) int {
+ if a > b {
+ return a
+ }
+ return b
+}
+
+func min(a, b int) int {
+ if a < b {
+ return a
+ }
+ return b
+}
+```
\ No newline at end of file
diff --git a/leetcode/0916.Word-Subsets/916. Word Subsets.go b/leetcode/0916.Word-Subsets/916. Word Subsets.go
new file mode 100644
index 000000000..e614e6540
--- /dev/null
+++ b/leetcode/0916.Word-Subsets/916. Word Subsets.go
@@ -0,0 +1,36 @@
+package leetcode
+
+func wordSubsets(A []string, B []string) []string {
+ var counter [26]int
+ for _, b := range B {
+ var m [26]int
+ for _, c := range b {
+ j := c - 'a'
+ m[j]++
+ }
+ for i := 0; i < 26; i++ {
+ if m[i] > counter[i] {
+ counter[i] = m[i]
+ }
+ }
+ }
+ var res []string
+ for _, a := range A {
+ var m [26]int
+ for _, c := range a {
+ j := c - 'a'
+ m[j]++
+ }
+ ok := true
+ for i := 0; i < 26; i++ {
+ if m[i] < counter[i] {
+ ok = false
+ break
+ }
+ }
+ if ok {
+ res = append(res, a)
+ }
+ }
+ return res
+}
diff --git a/leetcode/0916.Word-Subsets/916. Word Subsets_test.go b/leetcode/0916.Word-Subsets/916. Word Subsets_test.go
new file mode 100644
index 000000000..3a0e6bc1a
--- /dev/null
+++ b/leetcode/0916.Word-Subsets/916. Word Subsets_test.go
@@ -0,0 +1,63 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question916 struct {
+ para916
+ ans916
+}
+
+// para 是参数
+// one 代表第一个参数
+type para916 struct {
+ A []string
+ B []string
+}
+
+// ans 是答案
+// one 代表第一个答案
+type ans916 struct {
+ one []string
+}
+
+func Test_Problem916(t *testing.T) {
+
+ qs := []question916{
+
+ {
+ para916{[]string{"amazon", "apple", "facebook", "google", "leetcode"}, []string{"e", "o"}},
+ ans916{[]string{"facebook", "google", "leetcode"}},
+ },
+
+ {
+ para916{[]string{"amazon", "apple", "facebook", "google", "leetcode"}, []string{"l", "e"}},
+ ans916{[]string{"apple", "google", "leetcode"}},
+ },
+
+ {
+ para916{[]string{"amazon", "apple", "facebook", "google", "leetcode"}, []string{"e", "oo"}},
+ ans916{[]string{"facebook", "google"}},
+ },
+
+ {
+ para916{[]string{"amazon", "apple", "facebook", "google", "leetcode"}, []string{"lo", "eo"}},
+ ans916{[]string{"google", "leetcode"}},
+ },
+
+ {
+ para916{[]string{"amazon", "apple", "facebook", "google", "leetcode"}, []string{"ec", "oc", "ceo"}},
+ ans916{[]string{"facebook", "leetcode"}},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 916------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans916, q.para916
+ fmt.Printf("【input】:%v 【output】:%v\n", p, wordSubsets(p.A, p.B))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/0916.Word-Subsets/README.md b/leetcode/0916.Word-Subsets/README.md
new file mode 100644
index 000000000..6c4f6538e
--- /dev/null
+++ b/leetcode/0916.Word-Subsets/README.md
@@ -0,0 +1,103 @@
+# [916. Word Subsets](https://leetcode.com/problems/word-subsets/)
+
+
+## 题目
+
+We are given two arrays `A` and `B` of words. Each word is a string of lowercase letters.
+
+Now, say that word `b` is a subset of word `a` ****if every letter in `b` occurs in `a`, **including multiplicity**. For example, `"wrr"` is a subset of `"warrior"`, but is not a subset of `"world"`.
+
+Now say a word `a` from `A` is *universal* if for every `b` in `B`, `b` is a subset of `a`.
+
+Return a list of all universal words in `A`. You can return the words in any order.
+
+**Example 1:**
+
+```
+Input:A = ["amazon","apple","facebook","google","leetcode"], B = ["e","o"]
+Output:["facebook","google","leetcode"]
+```
+
+**Example 2:**
+
+```
+Input:A = ["amazon","apple","facebook","google","leetcode"], B = ["l","e"]
+Output:["apple","google","leetcode"]
+```
+
+**Example 3:**
+
+```
+Input:A = ["amazon","apple","facebook","google","leetcode"], B = ["e","oo"]
+Output:["facebook","google"]
+```
+
+**Example 4:**
+
+```
+Input:A = ["amazon","apple","facebook","google","leetcode"], B = ["lo","eo"]
+Output:["google","leetcode"]
+```
+
+**Example 5:**
+
+```
+Input:A = ["amazon","apple","facebook","google","leetcode"], B = ["ec","oc","ceo"]
+Output:["facebook","leetcode"]
+```
+
+**Note:**
+
+1. `1 <= A.length, B.length <= 10000`
+2. `1 <= A[i].length, B[i].length <= 10`
+3. `A[i]` and `B[i]` consist only of lowercase letters.
+4. All words in `A[i]` are unique: there isn't `i != j` with `A[i] == A[j]`.
+
+## 题目大意
+
+我们给出两个单词数组 A 和 B。每个单词都是一串小写字母。现在，如果 b 中的每个字母都出现在 a 中，包括重复出现的字母，那么称单词 b 是单词 a 的子集。 例如，“wrr” 是 “warrior” 的子集，但不是 “world” 的子集。如果对 B 中的每一个单词 b，b 都是 a 的子集，那么我们称 A 中的单词 a 是通用的。你可以按任意顺序以列表形式返回 A 中所有的通用单词。
+
+## 解题思路
+
+- 简单题。先统计出 B 数组中单词每个字母的频次，再在 A 数组中依次判断每个单词是否超过了这个频次，如果超过了即输出。
+
+## 代码
+
+```go
+package leetcode
+
+func wordSubsets(A []string, B []string) []string {
+ var counter [26]int
+ for _, b := range B {
+ var m [26]int
+ for _, c := range b {
+ j := c - 'a'
+ m[j]++
+ }
+ for i := 0; i < 26; i++ {
+ if m[i] > counter[i] {
+ counter[i] = m[i]
+ }
+ }
+ }
+ var res []string
+ for _, a := range A {
+ var m [26]int
+ for _, c := range a {
+ j := c - 'a'
+ m[j]++
+ }
+ ok := true
+ for i := 0; i < 26; i++ {
+ if m[i] < counter[i] {
+ ok = false
+ break
+ }
+ }
+ if ok {
+ res = append(res, a)
+ }
+ }
+ return res
+}
+```
\ No newline at end of file
diff --git a/leetcode/0918.Maximum-Sum-Circular-Subarray/918. Maximum Sum Circular Subarray.go b/leetcode/0918.Maximum-Sum-Circular-Subarray/918. Maximum Sum Circular Subarray.go
index dd3c9a3e4..9057d97ab 100644
--- a/leetcode/0918.Maximum-Sum-Circular-Subarray/918. Maximum Sum Circular Subarray.go
+++ b/leetcode/0918.Maximum-Sum-Circular-Subarray/918. Maximum Sum Circular Subarray.go
@@ -2,34 +2,50 @@ package leetcode
import "math"
-func maxSubarraySumCircular(A []int) int {
- n, sum := len(A), 0
- for _, v := range A {
- sum += v
- }
- kad := kadane(A)
- for i := 0; i < n; i++ {
- A[i] = -A[i]
+func maxSubarraySumCircular(nums []int) int {
+ var max1, max2, sum int
+
+ // case: no circulation
+ max1 = int(math.Inf(-1))
+ l := len(nums)
+ for i := 0; i < l; i++ {
+ sum += nums[i]
+ if sum > max1 {
+ max1 = sum
+ }
+ if sum < 1 {
+ sum = 0
+ }
}
- negativeMax := kadane(A)
- if sum+negativeMax <= 0 {
- return kad
+
+ // case: circling
+ arr_sum := 0
+ for i := 0; i < l; i++ {
+ arr_sum += nums[i]
}
- return max(kad, sum+negativeMax)
-}
-func kadane(a []int) int {
- n, MaxEndingHere, maxSoFar := len(a), a[0], math.MinInt32
- for i := 1; i < n; i++ {
- MaxEndingHere = max(a[i], MaxEndingHere+a[i])
- maxSoFar = max(MaxEndingHere, maxSoFar)
+ sum = 0
+ min_sum := 0
+ for i := 1; i < l-1; i++ {
+ sum += nums[i]
+ if sum >= 0 {
+ sum = 0
+ }
+ if sum < min_sum {
+ min_sum = sum
+ }
}
- return maxSoFar
+ max2 = arr_sum - min_sum
+
+ return max(max1, max2)
}
-func max(a int, b int) int {
- if a > b {
- return a
+func max(nums ...int) int {
+ max := int(math.Inf(-1))
+ for _, num := range nums {
+ if num > max {
+ max = num
+ }
}
- return b
+ return max
}
diff --git a/leetcode/0924.Minimize-Malware-Spread/924. Minimize Malware Spread.go b/leetcode/0924.Minimize-Malware-Spread/924. Minimize Malware Spread.go
index b868b1570..0b23c427c 100644
--- a/leetcode/0924.Minimize-Malware-Spread/924. Minimize Malware Spread.go
+++ b/leetcode/0924.Minimize-Malware-Spread/924. Minimize Malware Spread.go
@@ -10,30 +10,43 @@ func minMalwareSpread(graph [][]int, initial []int) int {
if len(initial) == 0 {
return 0
}
- uf, minIndex, count, countMap := template.UnionFind{}, 0, math.MinInt64, map[int]int{}
+ uf, maxLen, maxIdx, uniqInitials, compMap := template.UnionFindCount{}, math.MinInt32, -1, map[int]int{}, map[int][]int{}
uf.Init(len(graph))
for i := range graph {
- for j := range graph[i] {
- if i == j {
- break
- }
+ for j := i + 1; j < len(graph); j++ {
if graph[i][j] == 1 {
uf.Union(i, j)
}
}
}
- for i := 0; i < len(graph); i++ {
- countMap[uf.Find(i)]++
+ for _, i := range initial {
+ compMap[uf.Find(i)] = append(compMap[uf.Find(i)], i)
+ }
+ for _, v := range compMap {
+ if len(v) == 1 {
+ uniqInitials[v[0]] = v[0]
+ }
}
- for _, v := range initial {
- tmp := countMap[uf.Find(v)]
- if count == tmp && minIndex > v {
- minIndex = v
+ if len(uniqInitials) == 0 {
+ smallestIdx := initial[0]
+ for _, i := range initial {
+ if i < smallestIdx {
+ smallestIdx = i
+ }
}
- if count < tmp {
- minIndex = v
- count = tmp
+ return smallestIdx
+ }
+ for _, i := range initial {
+ if _, ok := uniqInitials[i]; ok {
+ size := uf.Count()[uf.Find(i)]
+ if maxLen < size {
+ maxLen, maxIdx = size, i
+ } else if maxLen == size {
+ if i < maxIdx {
+ maxIdx = i
+ }
+ }
}
}
- return minIndex
+ return maxIdx
}
diff --git a/leetcode/0938.Range-Sum-of-BST/938. Range Sum of BST.go b/leetcode/0938.Range-Sum-of-BST/938. Range Sum of BST.go
new file mode 100644
index 000000000..3225367b9
--- /dev/null
+++ b/leetcode/0938.Range-Sum-of-BST/938. Range Sum of BST.go
@@ -0,0 +1,34 @@
+package leetcode
+
+import (
+ "github.com/halfrost/LeetCode-Go/structures"
+)
+
+// TreeNode define
+type TreeNode = structures.TreeNode
+
+/**
+ * Definition for a binary tree node.
+ * type TreeNode struct {
+ * Val int
+ * Left *TreeNode
+ * Right *TreeNode
+ * }
+ */
+
+func rangeSumBST(root *TreeNode, low int, high int) int {
+ res := 0
+ preOrder(root, low, high, &res)
+ return res
+}
+
+func preOrder(root *TreeNode, low, high int, res *int) {
+ if root == nil {
+ return
+ }
+ if low <= root.Val && root.Val <= high {
+ *res += root.Val
+ }
+ preOrder(root.Left, low, high, res)
+ preOrder(root.Right, low, high, res)
+}
diff --git a/leetcode/0938.Range-Sum-of-BST/938. Range Sum of BST_test.go b/leetcode/0938.Range-Sum-of-BST/938. Range Sum of BST_test.go
new file mode 100644
index 000000000..0f06ee18a
--- /dev/null
+++ b/leetcode/0938.Range-Sum-of-BST/938. Range Sum of BST_test.go
@@ -0,0 +1,53 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+
+ "github.com/halfrost/LeetCode-Go/structures"
+)
+
+type question938 struct {
+ para938
+ ans938
+}
+
+// para 是参数
+// one 代表第一个参数
+type para938 struct {
+ one []int
+ low int
+ high int
+}
+
+// ans 是答案
+// one 代表第一个答案
+type ans938 struct {
+ one int
+}
+
+func Test_Problem938(t *testing.T) {
+
+ qs := []question938{
+
+ {
+ para938{[]int{10, 5, 15, 3, 7, structures.NULL, 18}, 7, 15},
+ ans938{32},
+ },
+
+ {
+ para938{[]int{10, 5, 15, 3, 7, 13, 18, 1, structures.NULL, 6}, 6, 10},
+ ans938{23},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 938------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans938, q.para938
+ fmt.Printf("【input】:%v ", p)
+ rootOne := structures.Ints2TreeNode(p.one)
+ fmt.Printf("【output】:%v \n", rangeSumBST(rootOne, p.low, p.high))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/0938.Range-Sum-of-BST/README.md b/leetcode/0938.Range-Sum-of-BST/README.md
new file mode 100644
index 000000000..c6f04ac65
--- /dev/null
+++ b/leetcode/0938.Range-Sum-of-BST/README.md
@@ -0,0 +1,80 @@
+# [938. Range Sum of BST](https://leetcode.com/problems/range-sum-of-bst/)
+
+
+## 题目
+
+Given the `root` node of a binary search tree, return *the sum of values of all nodes with a value in the range `[low, high]`*.
+
+**Example 1:**
+
+
+
+```
+Input: root = [10,5,15,3,7,null,18], low = 7, high = 15
+Output: 32
+
+```
+
+**Example 2:**
+
+
+
+```
+Input: root = [10,5,15,3,7,13,18,1,null,6], low = 6, high = 10
+Output: 23
+
+```
+
+**Constraints:**
+
+- The number of nodes in the tree is in the range `[1, 2 * 10^4]`.
+- `1 <= Node.val <= 10^5`
+- `1 <= low <= high <= 10^5`
+- All `Node.val` are **unique**.
+
+## 题目大意
+
+给定二叉搜索树的根结点 root，返回值位于范围 [low, high] 之间的所有结点的值的和。
+
+## 解题思路
+
+- 简单题。因为二叉搜索树的有序性，先序遍历即为有序。遍历过程中判断节点值是否位于区间范围内，在区间内就累加，不在区间内节点就不管。最终输出累加和。
+
+## 代码
+
+```go
+package leetcode
+
+import (
+ "github.com/halfrost/LeetCode-Go/structures"
+)
+
+// TreeNode define
+type TreeNode = structures.TreeNode
+
+/**
+ * Definition for a binary tree node.
+ * type TreeNode struct {
+ * Val int
+ * Left *TreeNode
+ * Right *TreeNode
+ * }
+ */
+
+func rangeSumBST(root *TreeNode, low int, high int) int {
+ res := 0
+ preOrder(root, low, high, &res)
+ return res
+}
+
+func preOrder(root *TreeNode, low, high int, res *int) {
+ if root == nil {
+ return
+ }
+ if low <= root.Val && root.Val <= high {
+ *res += root.Val
+ }
+ preOrder(root.Left, low, high, res)
+ preOrder(root.Right, low, high, res)
+}
+```
\ No newline at end of file
diff --git a/leetcode/0946.Validate-Stack-Sequences/946. Validate Stack Sequences.go b/leetcode/0946.Validate-Stack-Sequences/946. Validate Stack Sequences.go
index a98ce9435..13d22de87 100644
--- a/leetcode/0946.Validate-Stack-Sequences/946. Validate Stack Sequences.go
+++ b/leetcode/0946.Validate-Stack-Sequences/946. Validate Stack Sequences.go
@@ -1,17 +1,13 @@
package leetcode
-import "fmt"
-
func validateStackSequences(pushed []int, popped []int) bool {
stack, j, N := []int{}, 0, len(pushed)
for _, x := range pushed {
stack = append(stack, x)
- fmt.Printf("stack = %v j = %v\n", stack, j)
for len(stack) != 0 && j < N && stack[len(stack)-1] == popped[j] {
stack = stack[0 : len(stack)-1]
j++
}
- fmt.Printf("*****stack = %v j = %v\n", stack, j)
}
return j == N
}
diff --git a/leetcode/0958.Check-Completeness-of-a-Binary-Tree/0958.Check Completeness of a Binary Tree.go b/leetcode/0958.Check-Completeness-of-a-Binary-Tree/0958.Check Completeness of a Binary Tree.go
new file mode 100644
index 000000000..96fb1141e
--- /dev/null
+++ b/leetcode/0958.Check-Completeness-of-a-Binary-Tree/0958.Check Completeness of a Binary Tree.go
@@ -0,0 +1,35 @@
+package leetcode
+
+import (
+ "github.com/halfrost/LeetCode-Go/structures"
+)
+
+// TreeNode define
+type TreeNode = structures.TreeNode
+
+/**
+ * Definition for a binary tree node.
+ * type TreeNode struct {
+ * Val int
+ * Left *TreeNode
+ * Right *TreeNode
+ * }
+ */
+
+func isCompleteTree(root *TreeNode) bool {
+ queue, found := []*TreeNode{root}, false
+ for len(queue) > 0 {
+ node := queue[0] //取出每一层的第一个节点
+ queue = queue[1:]
+ if node == nil {
+ found = true
+ } else {
+ if found {
+ return false // 层序遍历中，两个不为空的节点中出现一个 nil
+ }
+ //如果左孩子为nil，则append进去的node.Left为nil
+ queue = append(queue, node.Left, node.Right)
+ }
+ }
+ return true
+}
diff --git a/leetcode/0958.Check-Completeness-of-a-Binary-Tree/0958.Check Completeness of a Binary Tree_test.go b/leetcode/0958.Check-Completeness-of-a-Binary-Tree/0958.Check Completeness of a Binary Tree_test.go
new file mode 100644
index 000000000..6eb4df6d4
--- /dev/null
+++ b/leetcode/0958.Check-Completeness-of-a-Binary-Tree/0958.Check Completeness of a Binary Tree_test.go
@@ -0,0 +1,51 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+
+ "github.com/halfrost/LeetCode-Go/structures"
+)
+
+type question958 struct {
+ para958
+ ans958
+}
+
+// para 是参数
+// one 代表第一个参数
+type para958 struct {
+ one []int
+}
+
+// ans 是答案
+// one 代表第一个答案
+type ans958 struct {
+ one bool
+}
+
+func Test_Problem958(t *testing.T) {
+
+ qs := []question958{
+
+ {
+ para958{[]int{1, 2, 3, 4, 5, 6}},
+ ans958{true},
+ },
+
+ {
+ para958{[]int{1, 2, 3, 4, 5, structures.NULL, 7}},
+ ans958{false},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 958------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans958, q.para958
+ fmt.Printf("【input】:%v ", p)
+ root := structures.Ints2TreeNode(p.one)
+ fmt.Printf("【output】:%v \n", isCompleteTree(root))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/0958.Check-Completeness-of-a-Binary-Tree/README.md b/leetcode/0958.Check-Completeness-of-a-Binary-Tree/README.md
new file mode 100644
index 000000000..4325c36e8
--- /dev/null
+++ b/leetcode/0958.Check-Completeness-of-a-Binary-Tree/README.md
@@ -0,0 +1,89 @@
+# [958. Check Completeness of a Binary Tree](https://leetcode.com/problems/check-completeness-of-a-binary-tree/)
+
+
+## 题目
+
+Given the `root` of a binary tree, determine if it is a *complete binary tree*.
+
+In a **[complete binary tree](http://en.wikipedia.org/wiki/Binary_tree#Types_of_binary_trees)**, every level, except possibly the last, is completely filled, and all nodes in the last level are as far left as possible. It can have between `1` and `2h` nodes inclusive at the last level `h`.
+
+**Example 1:**
+
+
+
+```
+Input: root = [1,2,3,4,5,6]
+Output: true
+Explanation: Every level before the last is full (ie. levels with node-values {1} and {2, 3}), and all nodes in the last level ({4, 5, 6}) are as far left as possible.
+
+```
+
+**Example 2:**
+
+
+
+```
+Input: root = [1,2,3,4,5,null,7]
+Output: false
+Explanation: The node with value 7 isn't as far left as possible.
+
+```
+
+**Constraints:**
+
+- The number of nodes in the tree is in the range `[1, 100]`.
+- `1 <= Node.val <= 1000`
+
+## 题目大意
+
+给定一个二叉树，确定它是否是一个完全二叉树。
+
+百度百科中对完全二叉树的定义如下：
+
+若设二叉树的深度为 h，除第 h 层外，其它各层 (1～h-1) 的结点数都达到最大个数，第 h 层所有的结点都连续集中在最左边，这就是完全二叉树。（注：第 h 层可能包含 1~ 2h 个节点。）
+
+## 解题思路
+
+- 这一题是按层序遍历的变种题。
+- 判断每个节点的左孩子是否为空。
+- 类似的题目，第 102，107，199 题都是按层序遍历的。
+
+## 代码
+
+```go
+package leetcode
+
+import (
+ "github.com/halfrost/LeetCode-Go/structures"
+)
+
+// TreeNode define
+type TreeNode = structures.TreeNode
+
+/**
+ * Definition for a binary tree node.
+ * type TreeNode struct {
+ * Val int
+ * Left *TreeNode
+ * Right *TreeNode
+ * }
+ */
+
+func isCompleteTree(root *TreeNode) bool {
+ queue, found := []*TreeNode{root}, false
+ for len(queue) > 0 {
+ node := queue[0] //取出每一层的第一个节点
+ queue = queue[1:]
+ if node == nil {
+ found = true
+ } else {
+ if found {
+ return false // 层序遍历中，两个不为空的节点中出现一个 nil
+ }
+ //如果左孩子为nil，则append进去的node.Left为nil
+ queue = append(queue, node.Left, node.Right)
+ }
+ }
+ return true
+}
+```
\ No newline at end of file
diff --git a/leetcode/0966.Vowel-Spellchecker/966. Vowel Spellchecker.go b/leetcode/0966.Vowel-Spellchecker/966. Vowel Spellchecker.go
new file mode 100644
index 000000000..a0798e998
--- /dev/null
+++ b/leetcode/0966.Vowel-Spellchecker/966. Vowel Spellchecker.go
@@ -0,0 +1,53 @@
+package leetcode
+
+import "strings"
+
+func spellchecker(wordlist []string, queries []string) []string {
+ wordsPerfect, wordsCap, wordsVowel := map[string]bool{}, map[string]string{}, map[string]string{}
+ for _, word := range wordlist {
+ wordsPerfect[word] = true
+ wordLow := strings.ToLower(word)
+ if _, ok := wordsCap[wordLow]; !ok {
+ wordsCap[wordLow] = word
+ }
+ wordLowVowel := devowel(wordLow)
+ if _, ok := wordsVowel[wordLowVowel]; !ok {
+ wordsVowel[wordLowVowel] = word
+ }
+ }
+ res, index := make([]string, len(queries)), 0
+ for _, query := range queries {
+ if _, ok := wordsPerfect[query]; ok {
+ res[index] = query
+ index++
+ continue
+ }
+ queryL := strings.ToLower(query)
+ if v, ok := wordsCap[queryL]; ok {
+ res[index] = v
+ index++
+ continue
+ }
+
+ queryLV := devowel(queryL)
+ if v, ok := wordsVowel[queryLV]; ok {
+ res[index] = v
+ index++
+ continue
+ }
+ res[index] = ""
+ index++
+ }
+ return res
+
+}
+
+func devowel(word string) string {
+ runes := []rune(word)
+ for k, c := range runes {
+ if c == 'a' || c == 'e' || c == 'i' || c == 'o' || c == 'u' {
+ runes[k] = '*'
+ }
+ }
+ return string(runes)
+}
diff --git a/leetcode/0966.Vowel-Spellchecker/966. Vowel Spellchecker_test.go b/leetcode/0966.Vowel-Spellchecker/966. Vowel Spellchecker_test.go
new file mode 100644
index 000000000..2c7975947
--- /dev/null
+++ b/leetcode/0966.Vowel-Spellchecker/966. Vowel Spellchecker_test.go
@@ -0,0 +1,42 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question966 struct {
+ para966
+ ans966
+}
+
+// para 是参数
+// one 代表第一个参数
+type para966 struct {
+ wordlist []string
+ queries []string
+}
+
+// ans 是答案
+// one 代表第一个答案
+type ans966 struct {
+ one []string
+}
+
+func Test_Problem966(t *testing.T) {
+
+ qs := []question966{
+ {
+ para966{[]string{"KiTe", "kite", "hare", "Hare"}, []string{"kite", "Kite", "KiTe", "Hare", "HARE", "Hear", "hear", "keti", "keet", "keto"}},
+ ans966{[]string{"kite", "KiTe", "KiTe", "Hare", "hare", "", "", "KiTe", "", "KiTe"}},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 966------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans966, q.para966
+ fmt.Printf("【input】:%v 【output】:%#v\n", p, spellchecker(p.wordlist, p.queries))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/0966.Vowel-Spellchecker/README.md b/leetcode/0966.Vowel-Spellchecker/README.md
new file mode 100644
index 000000000..504a83b7a
--- /dev/null
+++ b/leetcode/0966.Vowel-Spellchecker/README.md
@@ -0,0 +1,127 @@
+# [966. Vowel Spellchecker](https://leetcode.com/problems/vowel-spellchecker/)
+
+
+## 题目
+
+Given a `wordlist`, we want to implement a spellchecker that converts a query word into a correct word.
+
+For a given `query` word, the spell checker handles two categories of spelling mistakes:
+
+- Capitalization: If the query matches a word in the wordlist (**case-insensitive**), then the query word is returned with the same case as the case in the wordlist.
+ - Example: `wordlist = ["yellow"]`, `query = "YellOw"`: `correct = "yellow"`
+ - Example: `wordlist = ["Yellow"]`, `query = "yellow"`: `correct = "Yellow"`
+ - Example: `wordlist = ["yellow"]`, `query = "yellow"`: `correct = "yellow"`
+- Vowel Errors: If after replacing the vowels ('a', 'e', 'i', 'o', 'u') of the query word with any vowel individually, it matches a word in the wordlist (**case-insensitive**), then the query word is returned with the same case as the match in the wordlist.
+ - Example: `wordlist = ["YellOw"]`, `query = "yollow"`: `correct = "YellOw"`
+ - Example: `wordlist = ["YellOw"]`, `query = "yeellow"`: `correct = ""` (no match)
+ - Example: `wordlist = ["YellOw"]`, `query = "yllw"`: `correct = ""` (no match)
+
+In addition, the spell checker operates under the following precedence rules:
+
+- When the query exactly matches a word in the wordlist (**case-sensitive**), you should return the same word back.
+- When the query matches a word up to capitlization, you should return the first such match in the wordlist.
+- When the query matches a word up to vowel errors, you should return the first such match in the wordlist.
+- If the query has no matches in the wordlist, you should return the empty string.
+
+Given some `queries`, return a list of words `answer`, where `answer[i]` is the correct word for `query = queries[i]`.
+
+**Example 1:**
+
+```
+Input:wordlist = ["KiTe","kite","hare","Hare"], queries = ["kite","Kite","KiTe","Hare","HARE","Hear","hear","keti","keet","keto"]
+Output:["kite","KiTe","KiTe","Hare","hare","","","KiTe","","KiTe"]
+```
+
+**Note:**
+
+- `1 <= wordlist.length <= 5000`
+- `1 <= queries.length <= 5000`
+- `1 <= wordlist[i].length <= 7`
+- `1 <= queries[i].length <= 7`
+- All strings in `wordlist` and `queries` consist only of **english** letters.
+
+## 题目大意
+
+在给定单词列表 wordlist 的情况下，我们希望实现一个拼写检查器，将查询单词转换为正确的单词。
+
+对于给定的查询单词 query，拼写检查器将会处理两类拼写错误：
+
+- 大小写：如果查询匹配单词列表中的某个单词（不区分大小写），则返回的正确单词与单词列表中的大小写相同。
+ - 例如：wordlist = ["yellow"], query = "YellOw": correct = "yellow"
+ - 例如：wordlist = ["Yellow"], query = "yellow": correct = "Yellow"
+ - 例如：wordlist = ["yellow"], query = "yellow": correct = "yellow"
+- 元音错误：如果在将查询单词中的元音（‘a’、‘e’、‘i’、‘o’、‘u’）分别替换为任何元音后，能与单词列表中的单词匹配（不区分大小写），则返回的正确单词与单词列表中的匹配项大小写相同。
+ - 例如：wordlist = ["YellOw"], query = "yollow": correct = "YellOw"
+ - 例如：wordlist = ["YellOw"], query = "yeellow": correct = "" （无匹配项）
+ - 例如：wordlist = ["YellOw"], query = "yllw": correct = "" （无匹配项）
+
+此外，拼写检查器还按照以下优先级规则操作：
+
+- 当查询完全匹配单词列表中的某个单词（区分大小写）时，应返回相同的单词。
+- 当查询匹配到大小写问题的单词时，您应该返回单词列表中的第一个这样的匹配项。
+- 当查询匹配到元音错误的单词时，您应该返回单词列表中的第一个这样的匹配项。
+- 如果该查询在单词列表中没有匹配项，则应返回空字符串。
+
+给出一些查询 queries，返回一个单词列表 answer，其中 answer[i] 是由查询 query = queries[i] 得到的正确单词。
+
+## 解题思路
+
+- 读完题，很明显需要用 `map` 来解题。依题意分为 3 种情况，查询字符串完全匹配；查询字符串只是大小写不同；查询字符串有元音错误。第一种情况用 `map` `key` 直接匹配即可。第二种情况，利用 `map` 将单词从小写形式转换成原单词正确的大小写形式。第三种情况，利用 `map` 将单词从忽略元音的小写形式换成原单词正确形式。最后注意一下题目最后给的 4 个优先级规则即可。
+
+## 代码
+
+```go
+package leetcode
+
+import "strings"
+
+func spellchecker(wordlist []string, queries []string) []string {
+ wordsPerfect, wordsCap, wordsVowel := map[string]bool{}, map[string]string{}, map[string]string{}
+ for _, word := range wordlist {
+ wordsPerfect[word] = true
+ wordLow := strings.ToLower(word)
+ if _, ok := wordsCap[wordLow]; !ok {
+ wordsCap[wordLow] = word
+ }
+ wordLowVowel := devowel(wordLow)
+ if _, ok := wordsVowel[wordLowVowel]; !ok {
+ wordsVowel[wordLowVowel] = word
+ }
+ }
+ res, index := make([]string, len(queries)), 0
+ for _, query := range queries {
+ if _, ok := wordsPerfect[query]; ok {
+ res[index] = query
+ index++
+ continue
+ }
+ queryL := strings.ToLower(query)
+ if v, ok := wordsCap[queryL]; ok {
+ res[index] = v
+ index++
+ continue
+ }
+
+ queryLV := devowel(queryL)
+ if v, ok := wordsVowel[queryLV]; ok {
+ res[index] = v
+ index++
+ continue
+ }
+ res[index] = ""
+ index++
+ }
+ return res
+
+}
+
+func devowel(word string) string {
+ runes := []rune(word)
+ for k, c := range runes {
+ if c == 'a' || c == 'e' || c == 'i' || c == 'o' || c == 'u' {
+ runes[k] = '*'
+ }
+ }
+ return string(runes)
+}
+```
\ No newline at end of file
diff --git a/leetcode/0971.Flip-Binary-Tree-To-Match-Preorder-Traversal/971. Flip Binary Tree To Match Preorder Traversal.go b/leetcode/0971.Flip-Binary-Tree-To-Match-Preorder-Traversal/971. Flip Binary Tree To Match Preorder Traversal.go
new file mode 100644
index 000000000..6d7dbff87
--- /dev/null
+++ b/leetcode/0971.Flip-Binary-Tree-To-Match-Preorder-Traversal/971. Flip Binary Tree To Match Preorder Traversal.go
@@ -0,0 +1,40 @@
+package leetcode
+
+import (
+ "github.com/halfrost/LeetCode-Go/structures"
+)
+
+// TreeNode define
+type TreeNode = structures.TreeNode
+
+/**
+ * Definition for a binary tree node.
+ * type TreeNode struct {
+ * Val int
+ * Left *TreeNode
+ * Right *TreeNode
+ * }
+ */
+
+func flipMatchVoyage(root *TreeNode, voyage []int) []int {
+ res, index := make([]int, 0, len(voyage)), 0
+ if travelTree(root, &index, voyage, &res) {
+ return res
+ }
+ return []int{-1}
+}
+
+func travelTree(root *TreeNode, index *int, voyage []int, res *[]int) bool {
+ if root == nil {
+ return true
+ }
+ if root.Val != voyage[*index] {
+ return false
+ }
+ *index++
+ if root.Left != nil && root.Left.Val != voyage[*index] {
+ *res = append(*res, root.Val)
+ return travelTree(root.Right, index, voyage, res) && travelTree(root.Left, index, voyage, res)
+ }
+ return travelTree(root.Left, index, voyage, res) && travelTree(root.Right, index, voyage, res)
+}
diff --git a/leetcode/0971.Flip-Binary-Tree-To-Match-Preorder-Traversal/971. Flip Binary Tree To Match Preorder Traversal_test.go b/leetcode/0971.Flip-Binary-Tree-To-Match-Preorder-Traversal/971. Flip Binary Tree To Match Preorder Traversal_test.go
new file mode 100644
index 000000000..f494b92c5
--- /dev/null
+++ b/leetcode/0971.Flip-Binary-Tree-To-Match-Preorder-Traversal/971. Flip Binary Tree To Match Preorder Traversal_test.go
@@ -0,0 +1,57 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+
+ "github.com/halfrost/LeetCode-Go/structures"
+)
+
+type question971 struct {
+ para971
+ ans971
+}
+
+// para 是参数
+// one 代表第一个参数
+type para971 struct {
+ one []int
+ voyage []int
+}
+
+// ans 是答案
+// one 代表第一个答案
+type ans971 struct {
+ one []int
+}
+
+func Test_Problem971(t *testing.T) {
+
+ qs := []question971{
+
+ {
+ para971{[]int{1, 2, structures.NULL}, []int{2, 1}},
+ ans971{[]int{-1}},
+ },
+
+ {
+ para971{[]int{1, 2, 3}, []int{1, 3, 2}},
+ ans971{[]int{1}},
+ },
+
+ {
+ para971{[]int{1, 2, 3}, []int{1, 2, 3}},
+ ans971{[]int{}},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 971------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans971, q.para971
+ fmt.Printf("【input】:%v ", p)
+ rootOne := structures.Ints2TreeNode(p.one)
+ fmt.Printf("【output】:%v \n", flipMatchVoyage(rootOne, p.voyage))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/0971.Flip-Binary-Tree-To-Match-Preorder-Traversal/README.md b/leetcode/0971.Flip-Binary-Tree-To-Match-Preorder-Traversal/README.md
new file mode 100644
index 000000000..513df8b8d
--- /dev/null
+++ b/leetcode/0971.Flip-Binary-Tree-To-Match-Preorder-Traversal/README.md
@@ -0,0 +1,106 @@
+# [971. Flip Binary Tree To Match Preorder Traversal](https://leetcode.com/problems/flip-binary-tree-to-match-preorder-traversal/)
+
+
+## 题目
+
+You are given the `root` of a binary tree with `n` nodes, where each node is uniquely assigned a value from `1` to `n`. You are also given a sequence of `n` values `voyage`, which is the **desired** **[pre-order traversal](https://en.wikipedia.org/wiki/Tree_traversal#Pre-order)** of the binary tree.
+
+Any node in the binary tree can be **flipped** by swapping its left and right subtrees. For example, flipping node 1 will have the following effect:
+
+
+
+Flip the **smallest** number of nodes so that the **pre-order traversal** of the tree **matches** `voyage`.
+
+Return *a list of the values of all **flipped** nodes. You may return the answer in **any order**. If it is **impossible** to flip the nodes in the tree to make the pre-order traversal match* `voyage`*, return the list* `[-1]`.
+
+**Example 1:**
+
+
+
+```
+Input: root = [1,2], voyage = [2,1]
+Output: [-1]
+Explanation: It is impossible to flip the nodes such that the pre-order traversal matches voyage.
+```
+
+**Example 2:**
+
+
+
+```
+Input: root = [1,2,3], voyage = [1,3,2]
+Output: [1]
+Explanation: Flipping node 1 swaps nodes 2 and 3, so the pre-order traversal matches voyage.
+```
+
+**Example 3:**
+
+
+
+```
+Input: root = [1,2,3], voyage = [1,2,3]
+Output: []
+Explanation: The tree's pre-order traversal already matches voyage, so no nodes need to be flipped.
+```
+
+**Constraints:**
+
+- The number of nodes in the tree is `n`.
+- `n == voyage.length`
+- `1 <= n <= 100`
+- `1 <= Node.val, voyage[i] <= n`
+- All the values in the tree are **unique**.
+- All the values in `voyage` are **unique**.
+
+## 题目大意
+
+给你一棵二叉树的根节点 root ，树中有 n 个节点，每个节点都有一个不同于其他节点且处于 1 到 n 之间的值。另给你一个由 n 个值组成的行程序列 voyage ，表示 预期 的二叉树 先序遍历 结果。通过交换节点的左右子树，可以 翻转 该二叉树中的任意节点。请翻转 最少 的树中节点，使二叉树的 先序遍历 与预期的遍历行程 voyage 相匹配 。如果可以，则返回 翻转的 所有节点的值的列表。你可以按任何顺序返回答案。如果不能，则返回列表 [-1]。
+
+## 解题思路
+
+- 题目要求翻转最少树中节点，利用贪心的思想，应该从根节点开始从上往下依次翻转，这样翻转的次数是最少的。对树进行深度优先遍历，如果遍历到某一个节点的时候，节点值不能与行程序列匹配，那么答案一定是 [-1]。否则，当下一个期望数字 `voyage[i]` 与即将遍历的子节点的值不同的时候，就要翻转一下当前这个节点的左右子树，继续 DFS。递归结束可能有 2 种情况，一种是找出了所有要翻转的节点，另一种情况是没有需要翻转的，即原树先序遍历的结果与 `voyage` 是完全一致的。
+
+## 代码
+
+```go
+package leetcode
+
+import (
+ "github.com/halfrost/LeetCode-Go/structures"
+)
+
+// TreeNode define
+type TreeNode = structures.TreeNode
+
+/**
+ * Definition for a binary tree node.
+ * type TreeNode struct {
+ * Val int
+ * Left *TreeNode
+ * Right *TreeNode
+ * }
+ */
+
+func flipMatchVoyage(root *TreeNode, voyage []int) []int {
+ res, index := make([]int, 0, len(voyage)), 0
+ if travelTree(root, &index, voyage, &res) {
+ return res
+ }
+ return []int{-1}
+}
+
+func travelTree(root *TreeNode, index *int, voyage []int, res *[]int) bool {
+ if root == nil {
+ return true
+ }
+ if root.Val != voyage[*index] {
+ return false
+ }
+ *index++
+ if root.Left != nil && root.Left.Val != voyage[*index] {
+ *res = append(*res, root.Val)
+ return travelTree(root.Right, index, voyage, res) && travelTree(root.Left, index, voyage, res)
+ }
+ return travelTree(root.Left, index, voyage, res) && travelTree(root.Right, index, voyage, res)
+}
+```
\ No newline at end of file
diff --git a/leetcode/0978.Longest-Turbulent-Subarray/978. Longest Turbulent Subarray.go b/leetcode/0978.Longest-Turbulent-Subarray/978. Longest Turbulent Subarray.go
index 60d3eace1..7de2db2cc 100644
--- a/leetcode/0978.Longest-Turbulent-Subarray/978. Longest Turbulent Subarray.go
+++ b/leetcode/0978.Longest-Turbulent-Subarray/978. Longest Turbulent Subarray.go
@@ -1,14 +1,14 @@
package leetcode
// 解法一 模拟法
-func maxTurbulenceSize(A []int) int {
+func maxTurbulenceSize(arr []int) int {
inc, dec := 1, 1
- maxLen := min(1, len(A))
- for i := 1; i < len(A); i++ {
- if A[i-1] < A[i] {
+ maxLen := min(1, len(arr))
+ for i := 1; i < len(arr); i++ {
+ if arr[i-1] < arr[i] {
inc = dec + 1
dec = 1
- } else if A[i-1] > A[i] {
+ } else if arr[i-1] > arr[i] {
dec = inc + 1
inc = 1
} else {
@@ -35,23 +35,21 @@ func min(a int, b int) int {
}
// 解法二 滑动窗口
-func maxTurbulenceSize1(A []int) int {
- if len(A) == 1 {
- return 1
+func maxTurbulenceSize1(arr []int) int {
+ var maxLength int
+ if len(arr) == 2 && arr[0] != arr[1] {
+ maxLength = 2
+ } else {
+ maxLength = 1
}
- // flag > 0 代表下一个数要大于前一个数，flag < 0 代表下一个数要小于前一个数
- res, left, right, flag, lastNum := 0, 0, 0, A[1]-A[0], A[0]
- for left < len(A) {
- if right < len(A)-1 && ((A[right+1] > lastNum && flag > 0) || (A[right+1] < lastNum && flag < 0) || (right == left)) {
- right++
- flag = lastNum - A[right]
- lastNum = A[right]
- } else {
- if right != left && flag != 0 {
- res = max(res, right-left+1)
- }
- left++
+ left := 0
+ for right := 2; right < len(arr); right++ {
+ if arr[right] == arr[right-1] {
+ left = right
+ } else if (arr[right]-arr[right-1])^(arr[right-1]-arr[right-2]) >= 0 {
+ left = right - 1
}
+ maxLength = max(maxLength, right-left+1)
}
- return max(res, 1)
+ return maxLength
}
diff --git a/leetcode/0978.Longest-Turbulent-Subarray/README.md b/leetcode/0978.Longest-Turbulent-Subarray/README.md
index 01583dee8..e38c46533 100755
--- a/leetcode/0978.Longest-Turbulent-Subarray/README.md
+++ b/leetcode/0978.Longest-Turbulent-Subarray/README.md
@@ -1,58 +1,58 @@
-# [978. Longest Turbulent Subarray](https://leetcode.com/problems/longest-turbulent-subarray/)
-
-## 题目
-
-A subarray `A[i], A[i+1], ..., A[j]` of `A` is said to be *turbulent* if and only if:
-
-- For `i <= k < j`, `A[k] > A[k+1]` when `k` is odd, and `A[k] < A[k+1]` when `k` is even;
-- **OR**, for `i <= k < j`, `A[k] > A[k+1]` when `k` is even, and `A[k] < A[k+1]` when `k` is odd.
-
-That is, the subarray is turbulent if the comparison sign flips between each adjacent pair of elements in the subarray.
-
-Return the **length** of a maximum size turbulent subarray of A.
-
-**Example 1:**
-
- Input: [9,4,2,10,7,8,8,1,9]
- Output: 5
- Explanation: (A[1] > A[2] < A[3] > A[4] < A[5])
-
-**Example 2:**
-
- Input: [4,8,12,16]
- Output: 2
-
-**Example 3:**
-
- Input: [100]
- Output: 1
-
-**Note:**
-
-1. `1 <= A.length <= 40000`
-2. `0 <= A[i] <= 10^9`
-
-
-## 题目大意
-
-
-当 A 的子数组 A[i], A[i+1], ..., A[j] 满足下列条件时，我们称其为湍流子数组：
-
-若 i <= k < j，当 k 为奇数时， A[k] > A[k+1]，且当 k 为偶数时，A[k] < A[k+1]；
-或 若 i <= k < j，当 k 为偶数时，A[k] > A[k+1] ，且当 k 为奇数时， A[k] < A[k+1]。
-也就是说，如果比较符号在子数组中的每个相邻元素对之间翻转，则该子数组是湍流子数组。
-
-返回 A 的最大湍流子数组的长度。
-
-提示：
-
-- 1 <= A.length <= 40000
-- 0 <= A[i] <= 10^9
-
-
-
-## 解题思路
-
-
-- 给出一个数组，要求找出“摆动数组”的最大长度。所谓“摆动数组”的意思是，元素一大一小间隔的。
-- 这一题可以用滑动窗口来解答。用一个变量记住下次出现的元素需要大于还是需要小于前一个元素。也可以用模拟的方法，用两个变量分别记录上升和下降数字的长度。一旦元素相等了，上升和下降数字长度都置为 1，其他时候按照上升和下降的关系增加队列长度即可，最后输出动态维护的最长长度。
+# [978. Longest Turbulent Subarray](https://leetcode.com/problems/longest-turbulent-subarray/)
+
+## 题目
+
+A subarray `A[i], A[i+1], ..., A[j]` of `A` is said to be *turbulent* if and only if:
+
+- For `i <= k < j`, `A[k] > A[k+1]` when `k` is odd, and `A[k] < A[k+1]` when `k` is even;
+- **OR**, for `i <= k < j`, `A[k] > A[k+1]` when `k` is even, and `A[k] < A[k+1]` when `k` is odd.
+
+That is, the subarray is turbulent if the comparison sign flips between each adjacent pair of elements in the subarray.
+
+Return the **length** of a maximum size turbulent subarray of A.
+
+**Example 1:**
+
+ Input: [9,4,2,10,7,8,8,1,9]
+ Output: 5
+ Explanation: (A[1] > A[2] < A[3] > A[4] < A[5])
+
+**Example 2:**
+
+ Input: [4,8,12,16]
+ Output: 2
+
+**Example 3:**
+
+ Input: [100]
+ Output: 1
+
+**Note:**
+
+1. `1 <= A.length <= 40000`
+2. `0 <= A[i] <= 10^9`
+
+
+## 题目大意
+
+
+当 A 的子数组 A[i], A[i+1], ..., A[j] 满足下列条件时，我们称其为湍流子数组：
+
+若 i <= k < j，当 k 为奇数时， A[k] > A[k+1]，且当 k 为偶数时，A[k] < A[k+1]；
+或 若 i <= k < j，当 k 为偶数时，A[k] > A[k+1] ，且当 k 为奇数时， A[k] < A[k+1]。
+也就是说，如果比较符号在子数组中的每个相邻元素对之间翻转，则该子数组是湍流子数组。
+
+返回 A 的最大湍流子数组的长度。
+
+提示：
+
+- 1 <= A.length <= 40000
+- 0 <= A[i] <= 10^9
+
+
+
+## 解题思路
+
+
+- 给出一个数组，要求找出“摆动数组”的最大长度。所谓“摆动数组”的意思是，元素一大一小间隔的。
+- 这一题可以用滑动窗口来解答。用相邻元素差的乘积大于零（a ^ b >= 0 说明a b乘积大于零）来判断是否是湍流， 如果是，那么扩大窗口。否则窗口缩小为0，开始新的一个窗口。
\ No newline at end of file
diff --git a/leetcode/0987.Vertical-Order-Traversal-of-a-Binary-Tree/987. Vertical Order Traversal of a Binary Tree.go b/leetcode/0987.Vertical-Order-Traversal-of-a-Binary-Tree/987. Vertical Order Traversal of a Binary Tree.go
new file mode 100644
index 000000000..a7937eb40
--- /dev/null
+++ b/leetcode/0987.Vertical-Order-Traversal-of-a-Binary-Tree/987. Vertical Order Traversal of a Binary Tree.go
@@ -0,0 +1,56 @@
+package leetcode
+
+import (
+ "math"
+ "sort"
+
+ "github.com/halfrost/LeetCode-Go/structures"
+)
+
+// TreeNode define
+type TreeNode = structures.TreeNode
+
+/**
+ * Definition for a binary tree node.
+ * type TreeNode struct {
+ * Val int
+ * Left *TreeNode
+ * Right *TreeNode
+ * }
+ */
+
+type node struct {
+ x, y, val int
+}
+
+func verticalTraversal(root *TreeNode) [][]int {
+ var dfs func(root *TreeNode, x, y int)
+ var nodes []node
+ dfs = func(root *TreeNode, x, y int) {
+ if root == nil {
+ return
+ }
+ nodes = append(nodes, node{x, y, root.Val})
+ dfs(root.Left, x+1, y-1)
+ dfs(root.Right, x+1, y+1)
+ }
+ dfs(root, 0, 0)
+
+ sort.Slice(nodes, func(i, j int) bool {
+ a, b := nodes[i], nodes[j]
+ return a.y < b.y || a.y == b.y &&
+ (a.x < b.x || a.x == b.x && a.val < b.val)
+ })
+
+ var res [][]int
+ lastY := math.MinInt32
+ for _, node := range nodes {
+ if lastY != node.y {
+ res = append(res, []int{node.val})
+ lastY = node.y
+ } else {
+ res[len(res)-1] = append(res[len(res)-1], node.val)
+ }
+ }
+ return res
+}
diff --git a/leetcode/0987.Vertical-Order-Traversal-of-a-Binary-Tree/987. Vertical Order Traversal of a Binary Tree_test.go b/leetcode/0987.Vertical-Order-Traversal-of-a-Binary-Tree/987. Vertical Order Traversal of a Binary Tree_test.go
new file mode 100644
index 000000000..669178c13
--- /dev/null
+++ b/leetcode/0987.Vertical-Order-Traversal-of-a-Binary-Tree/987. Vertical Order Traversal of a Binary Tree_test.go
@@ -0,0 +1,56 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+
+ "github.com/halfrost/LeetCode-Go/structures"
+)
+
+type question987 struct {
+ para987
+ ans987
+}
+
+// para 是参数
+// one 代表第一个参数
+type para987 struct {
+ one []int
+}
+
+// ans 是答案
+// one 代表第一个答案
+type ans987 struct {
+ one [][]int
+}
+
+func Test_Problem987(t *testing.T) {
+
+ qs := []question987{
+
+ {
+ para987{[]int{3, 9, 20, structures.NULL, structures.NULL, 15, 7}},
+ ans987{[][]int{{9}, {3, 15}, {20}, {7}}},
+ },
+
+ {
+ para987{[]int{1, 2, 3, 4, 5, 6, 7}},
+ ans987{[][]int{{4}, {2}, {1, 5, 6}, {3}, {7}}},
+ },
+
+ {
+ para987{[]int{1, 2, 3, 4, 6, 5, 7}},
+ ans987{[][]int{{4}, {2}, {1, 5, 6}, {3}, {7}}},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 987------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans987, q.para987
+ fmt.Printf("【input】:%v ", p)
+ root := structures.Ints2TreeNode(p.one)
+ fmt.Printf("【output】:%v \n", verticalTraversal(root))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/0987.Vertical-Order-Traversal-of-a-Binary-Tree/README.md b/leetcode/0987.Vertical-Order-Traversal-of-a-Binary-Tree/README.md
new file mode 100644
index 000000000..daa44efed
--- /dev/null
+++ b/leetcode/0987.Vertical-Order-Traversal-of-a-Binary-Tree/README.md
@@ -0,0 +1,135 @@
+# [987. Vertical Order Traversal of a Binary Tree](https://leetcode.com/problems/vertical-order-traversal-of-a-binary-tree/)
+
+
+## 题目
+
+Given the `root` of a binary tree, calculate the **vertical order traversal** of the binary tree.
+
+For each node at position `(row, col)`, its left and right children will be at positions `(row + 1, col - 1)` and `(row + 1, col + 1)` respectively. The root of the tree is at `(0, 0)`.
+
+The **vertical order traversal** of a binary tree is a list of top-to-bottom orderings for each column index starting from the leftmost column and ending on the rightmost column. There may be multiple nodes in the same row and same column. In such a case, sort these nodes by their values.
+
+Return *the **vertical order traversal** of the binary tree*.
+
+**Example 1:**
+
+
+
+```
+Input: root = [3,9,20,null,null,15,7]
+Output: [[9],[3,15],[20],[7]]
+Explanation:
+Column -1: Only node 9 is in this column.
+Column 0: Nodes 3 and 15 are in this column in that order from top to bottom.
+Column 1: Only node 20 is in this column.
+Column 2: Only node 7 is in this column.
+```
+
+**Example 2:**
+
+
+
+```
+Input: root = [1,2,3,4,5,6,7]
+Output: [[4],[2],[1,5,6],[3],[7]]
+Explanation:
+Column -2: Only node 4 is in this column.
+Column -1: Only node 2 is in this column.
+Column 0: Nodes 1, 5, and 6 are in this column.
+ 1 is at the top, so it comes first.
+ 5 and 6 are at the same position (2, 0), so we order them by their value, 5 before 6.
+Column 1: Only node 3 is in this column.
+Column 2: Only node 7 is in this column.
+
+```
+
+**Example 3:**
+
+
+
+```
+Input: root = [1,2,3,4,6,5,7]
+Output: [[4],[2],[1,5,6],[3],[7]]
+Explanation:
+This case is the exact same as example 2, but with nodes 5 and 6 swapped.
+Note that the solution remains the same since 5 and 6 are in the same location and should be ordered by their values.
+
+```
+
+**Constraints:**
+
+- The number of nodes in the tree is in the range `[1, 1000]`.
+- `0 <= Node.val <= 1000`
+
+## 题目大意
+
+给你二叉树的根结点 root ，请你设计算法计算二叉树的 垂序遍历 序列。
+
+对位于 (row, col) 的每个结点而言，其左右子结点分别位于 (row + 1, col - 1) 和 (row + 1, col + 1) 。树的根结点位于 (0, 0) 。二叉树的 垂序遍历 从最左边的列开始直到最右边的列结束，按列索引每一列上的所有结点，形成一个按出现位置从上到下排序的有序列表。如果同行同列上有多个结点，则按结点的值从小到大进行排序。返回二叉树的 垂序遍历 序列。
+
+## 解题思路
+
+- 题目要求按照一列一列的遍历二叉树。需要解决 2 个问题。第一个问题，二叉树上每个结点的二维坐标如何计算。第二个问题，同一个二维坐标点上摞起来多个结点，需要按照从小到大的顺序排序，如例子二和例子三，同一个二维坐标点 (2，0) 上，摞了 2 个不同的结点。
+- 先解决第一个问题，由于题目要求根结点是 (0，0) ，即根结点是坐标原点，它的左子树的 x 坐标都是负数，它的右子树的 x 坐标都是正数。按照先序遍历，就可以将这些结点的二维坐标计算出来。再进行一次排序，按照 x 坐标从小到大排序，坐标相同的情况对应着结点摞起来的情况，摞起来的结点按照 val 值的大小从小到大排序。这样在 x 轴方向，所有结点就排列好了。排序完成，也顺便解决了第二个问题。
+- 最后一步只需要扫描一遍这个排好序的数组，按照列的顺序，依次将同一列的结点打包至一个一维数组中。最终输出的二维数组即为题目所求。
+
+## 代码
+
+```go
+package leetcode
+
+import (
+ "math"
+ "sort"
+
+ "github.com/halfrost/LeetCode-Go/structures"
+)
+
+// TreeNode define
+type TreeNode = structures.TreeNode
+
+/**
+ * Definition for a binary tree node.
+ * type TreeNode struct {
+ * Val int
+ * Left *TreeNode
+ * Right *TreeNode
+ * }
+ */
+
+type node struct {
+ x, y, val int
+}
+
+func verticalTraversal(root *TreeNode) [][]int {
+ var dfs func(root *TreeNode, x, y int)
+ var nodes []node
+ dfs = func(root *TreeNode, x, y int) {
+ if root == nil {
+ return
+ }
+ nodes = append(nodes, node{x, y, root.Val})
+ dfs(root.Left, x+1, y-1)
+ dfs(root.Right, x+1, y+1)
+ }
+ dfs(root, 0, 0)
+
+ sort.Slice(nodes, func(i, j int) bool {
+ a, b := nodes[i], nodes[j]
+ return a.y < b.y || a.y == b.y &&
+ (a.x < b.x || a.x == b.x && a.val < b.val)
+ })
+
+ var res [][]int
+ lastY := math.MinInt32
+ for _, node := range nodes {
+ if lastY != node.y {
+ res = append(res, []int{node.val})
+ lastY = node.y
+ } else {
+ res[len(res)-1] = append(res[len(res)-1], node.val)
+ }
+ }
+ return res
+}
+```
\ No newline at end of file
diff --git a/leetcode/0989.Add-to-Array-Form-of-Integer/989. Add to Array-Form of Integer.go b/leetcode/0989.Add-to-Array-Form-of-Integer/989. Add to Array-Form of Integer.go
new file mode 100644
index 000000000..4281e5988
--- /dev/null
+++ b/leetcode/0989.Add-to-Array-Form-of-Integer/989. Add to Array-Form of Integer.go
@@ -0,0 +1,25 @@
+package leetcode
+
+func addToArrayForm(A []int, K int) []int {
+ res := []int{}
+ for i := len(A) - 1; i >= 0; i-- {
+ sum := A[i] + K%10
+ K /= 10
+ if sum >= 10 {
+ K++
+ sum -= 10
+ }
+ res = append(res, sum)
+ }
+ for ; K > 0; K /= 10 {
+ res = append(res, K%10)
+ }
+ reverse(res)
+ return res
+}
+
+func reverse(A []int) {
+ for i, n := 0, len(A); i < n/2; i++ {
+ A[i], A[n-1-i] = A[n-1-i], A[i]
+ }
+}
diff --git a/leetcode/0989.Add-to-Array-Form-of-Integer/989. Add to Array-Form of Integer_test.go b/leetcode/0989.Add-to-Array-Form-of-Integer/989. Add to Array-Form of Integer_test.go
new file mode 100644
index 000000000..93eacd7f2
--- /dev/null
+++ b/leetcode/0989.Add-to-Array-Form-of-Integer/989. Add to Array-Form of Integer_test.go
@@ -0,0 +1,58 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question989 struct {
+ para989
+ ans989
+}
+
+// para 是参数
+// one 代表第一个参数
+type para989 struct {
+ A []int
+ K int
+}
+
+// ans 是答案
+// one 代表第一个答案
+type ans989 struct {
+ one []int
+}
+
+func Test_Problem989(t *testing.T) {
+
+ qs := []question989{
+
+ {
+ para989{[]int{1, 2, 0, 0}, 34},
+ ans989{[]int{1, 2, 3, 4}},
+ },
+
+ {
+ para989{[]int{2, 7, 4}, 181},
+ ans989{[]int{4, 5, 5}},
+ },
+
+ {
+ para989{[]int{2, 1, 5}, 806},
+ ans989{[]int{1, 0, 2, 1}},
+ },
+
+ {
+ para989{[]int{9, 9, 9, 9, 9, 9, 9, 9, 9, 9}, 1},
+ ans989{[]int{1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0}},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 989------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans989, q.para989
+ fmt.Printf("【input】:%v 【output】:%v\n", p, addToArrayForm(p.A, p.K))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/0989.Add-to-Array-Form-of-Integer/README.md b/leetcode/0989.Add-to-Array-Form-of-Integer/README.md
new file mode 100644
index 000000000..6f48c336e
--- /dev/null
+++ b/leetcode/0989.Add-to-Array-Form-of-Integer/README.md
@@ -0,0 +1,84 @@
+# [989. Add to Array-Form of Integer](https://leetcode.com/problems/add-to-array-form-of-integer/)
+
+## 题目
+
+For a non-negative integer `X`, the *array-form of `X`* is an array of its digits in left to right order. For example, if `X = 1231`, then the array form is `[1,2,3,1]`.
+
+Given the array-form `A` of a non-negative integer `X`, return the array-form of the integer `X+K`.
+
+**Example 1:**
+
+```
+Input: A = [1,2,0,0], K = 34
+Output: [1,2,3,4]
+Explanation: 1200 + 34 = 1234
+```
+
+**Example 2:**
+
+```
+Input: A = [2,7,4], K = 181
+Output: [4,5,5]
+Explanation: 274 + 181 = 455
+```
+
+**Example 3:**
+
+```
+Input: A = [2,1,5], K = 806
+Output: [1,0,2,1]
+Explanation: 215 + 806 = 1021
+```
+
+**Example 4:**
+
+```
+Input: A = [9,9,9,9,9,9,9,9,9,9], K = 1
+Output: [1,0,0,0,0,0,0,0,0,0,0]
+Explanation: 9999999999 + 1 = 10000000000
+```
+
+**Note：**
+
+1. `1 <= A.length <= 10000`
+2. `0 <= A[i] <= 9`
+3. `0 <= K <= 10000`
+4. If `A.length > 1`, then `A[0] != 0`
+
+## 题目大意
+
+对于非负整数 X 而言，X 的数组形式是每位数字按从左到右的顺序形成的数组。例如，如果 X = 1231，那么其数组形式为 [1,2,3,1]。给定非负整数 X 的数组形式 A，返回整数 X+K 的数组形式。
+
+## 解题思路
+
+- 简单题，计算 2 个非负整数的和。累加过程中不断的进位，最终输出到数组中记得需要逆序，即数字的高位排在数组下标较小的位置。
+
+## 代码
+
+```go
+package leetcode
+
+func addToArrayForm(A []int, K int) []int {
+ res := []int{}
+ for i := len(A) - 1; i >= 0; i-- {
+ sum := A[i] + K%10
+ K /= 10
+ if sum >= 10 {
+ K++
+ sum -= 10
+ }
+ res = append(res, sum)
+ }
+ for ; K > 0; K /= 10 {
+ res = append(res, K%10)
+ }
+ reverse(res)
+ return res
+}
+
+func reverse(A []int) {
+ for i, n := 0, len(A); i < n/2; i++ {
+ A[i], A[n-1-i] = A[n-1-i], A[i]
+ }
+}
+```
\ No newline at end of file
diff --git a/leetcode/0991.Broken-Calculator/991. Broken Calculator.go b/leetcode/0991.Broken-Calculator/991. Broken Calculator.go
new file mode 100644
index 000000000..3e9e2b9a0
--- /dev/null
+++ b/leetcode/0991.Broken-Calculator/991. Broken Calculator.go
@@ -0,0 +1,14 @@
+package leetcode
+
+func brokenCalc(X int, Y int) int {
+ res := 0
+ for Y > X {
+ res++
+ if Y&1 == 1 {
+ Y++
+ } else {
+ Y /= 2
+ }
+ }
+ return res + X - Y
+}
diff --git a/leetcode/0991.Broken-Calculator/991. Broken Calculator_test.go b/leetcode/0991.Broken-Calculator/991. Broken Calculator_test.go
new file mode 100644
index 000000000..c45f7d6ec
--- /dev/null
+++ b/leetcode/0991.Broken-Calculator/991. Broken Calculator_test.go
@@ -0,0 +1,58 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question991 struct {
+ para991
+ ans991
+}
+
+// para 是参数
+// one 代表第一个参数
+type para991 struct {
+ X int
+ Y int
+}
+
+// ans 是答案
+// one 代表第一个答案
+type ans991 struct {
+ one int
+}
+
+func Test_Problem991(t *testing.T) {
+
+ qs := []question991{
+
+ {
+ para991{2, 3},
+ ans991{2},
+ },
+
+ {
+ para991{5, 8},
+ ans991{2},
+ },
+
+ {
+ para991{3, 10},
+ ans991{3},
+ },
+
+ {
+ para991{1024, 1},
+ ans991{1023},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 991------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans991, q.para991
+ fmt.Printf("【input】:%v 【output】:%v\n", p, brokenCalc(p.X, p.Y))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/0991.Broken-Calculator/README.md b/leetcode/0991.Broken-Calculator/README.md
new file mode 100644
index 000000000..4ef8bc204
--- /dev/null
+++ b/leetcode/0991.Broken-Calculator/README.md
@@ -0,0 +1,83 @@
+# [991. Broken Calculator](https://leetcode.com/problems/broken-calculator/)
+
+
+## 题目
+
+On a broken calculator that has a number showing on its display, we can perform two operations:
+
+- **Double**: Multiply the number on the display by 2, or;
+- **Decrement**: Subtract 1 from the number on the display.
+
+Initially, the calculator is displaying the number `X`.
+
+Return the minimum number of operations needed to display the number `Y`.
+
+**Example 1:**
+
+```
+Input: X = 2, Y = 3
+Output: 2
+Explanation: Use double operation and then decrement operation {2 -> 4 -> 3}.
+```
+
+**Example 2:**
+
+```
+Input: X = 5, Y = 8
+Output: 2
+Explanation: Use decrement and then double {5 -> 4 -> 8}.
+```
+
+**Example 3:**
+
+```
+Input: X = 3, Y = 10
+Output: 3
+Explanation: Use double, decrement and double {3 -> 6 -> 5 -> 10}.
+```
+
+**Example 4:**
+
+```
+Input: X = 1024, Y = 1
+Output: 1023
+Explanation: Use decrement operations 1023 times.
+```
+
+**Note:**
+
+1. `1 <= X <= 10^9`
+2. `1 <= Y <= 10^9`
+
+## 题目大意
+
+在显示着数字的坏计算器上，我们可以执行以下两种操作：
+
+- 双倍（Double）：将显示屏上的数字乘 2；
+- 递减（Decrement）：将显示屏上的数字减 1 。
+
+最初，计算器显示数字 X。返回显示数字 Y 所需的最小操作数。
+
+## 解题思路
+
+- 看到本题的数据规模非常大，`10^9`，算法只能采用 `O(sqrt(n))`、`O(log n)`、`O(1)` 的算法。`O(sqrt(n))` 和 `O(1)` 在本题中是不可能的。所以按照数据规模来估计，本题只能尝试 `O(log n)` 的算法。`O(log n)` 的算法有二分搜索，不过本题不太符合二分搜索算法背景。题目中明显出现乘 2，这很明显是可以达到 `O(log n)` 的。最终确定解题思路是数学方法，循环中会用到乘 2 或者除 2 的计算。
+- 既然出现了乘 2 和减一的操作，很容易考虑到奇偶性上。题目要求最小操作数，贪心思想，应该尽可能多的使用除 2 操作，使得 Y 和 X 大小差不多，最后再利用加一操作微调。只要 Y 比 X 大就执行除法操作。当然这里要考虑一次奇偶性，如果 Y 是奇数，先加一变成偶数再除二；如果 Y 是偶数，直接除二。如此操作直到 Y 不大于 X，最后执行 `X-Y` 次加法操作微调即可。
+
+## 代码
+
+```go
+package leetcode
+
+func brokenCalc(X int, Y int) int {
+ res := 0
+ for Y > X {
+ res++
+ if Y&1 == 1 {
+ Y++
+ } else {
+ Y /= 2
+ }
+ }
+ return res + X - Y
+}
+```
\ No newline at end of file
diff --git a/leetcode/0997.Find-the-Town-Judge/997.Find the Town Judge.go b/leetcode/0997.Find-the-Town-Judge/997.Find the Town Judge.go
new file mode 100644
index 000000000..79351288d
--- /dev/null
+++ b/leetcode/0997.Find-the-Town-Judge/997.Find the Town Judge.go
@@ -0,0 +1,22 @@
+package leetcode
+
+func findJudge(n int, trust [][]int) int {
+ if n == 1 && len(trust) == 0 {
+ return 1
+ }
+ judges := make(map[int]int)
+ for _, v := range trust {
+ judges[v[1]] += 1
+ }
+ for _, v := range trust {
+ if _, ok := judges[v[0]]; ok {
+ delete(judges, v[0])
+ }
+ }
+ for k, v := range judges {
+ if v == n-1 {
+ return k
+ }
+ }
+ return -1
+}
diff --git a/leetcode/0997.Find-the-Town-Judge/997.Find the Town Judge_test.go b/leetcode/0997.Find-the-Town-Judge/997.Find the Town Judge_test.go
new file mode 100644
index 000000000..61b2434ff
--- /dev/null
+++ b/leetcode/0997.Find-the-Town-Judge/997.Find the Town Judge_test.go
@@ -0,0 +1,51 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question997 struct {
+ para997
+ ans997
+}
+
+// para 是参数
+type para997 struct {
+ n int
+ trust [][]int
+}
+
+// ans 是答案
+type ans997 struct {
+ ans int
+}
+
+func Test_Problem997(t *testing.T) {
+
+ qs := []question997{
+
+ {
+ para997{2, [][]int{{1, 2}}},
+ ans997{2},
+ },
+
+ {
+ para997{3, [][]int{{1, 3}, {2, 3}}},
+ ans997{3},
+ },
+
+ {
+ para997{3, [][]int{{1, 3}, {2, 3}, {3, 1}}},
+ ans997{-1},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 997------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans997, q.para997
+ fmt.Printf("【input】:%v 【output】:%v\n", p, findJudge(p.n, p.trust))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/0997.Find-the-Town-Judge/README.md b/leetcode/0997.Find-the-Town-Judge/README.md
new file mode 100644
index 000000000..71dc5ecfc
--- /dev/null
+++ b/leetcode/0997.Find-the-Town-Judge/README.md
@@ -0,0 +1,87 @@
+# [997. Find the Town Judge](https://leetcode.com/problems/find-the-town-judge/)
+
+## 题目
+
+In a town, there are n people labeled from 1 to n. There is a rumor that one of these people is secretly the town judge.
+
+If the town judge exists, then:
+
+- The town judge trusts nobody.
+- Everybody (except for the town judge) trusts the town judge.
+- There is exactly one person that satisfies properties 1 and 2.
+
+You are given an array trust where trust[i] = [ai, bi] representing that the person labeled ai trusts the person labeled bi.
+
+Return the label of the town judge if the town judge exists and can be identified, or return -1 otherwise.
+
+**Example 1**:
+
+ Input: n = 2, trust = [[1,2]]
+ Output: 2
+
+**Example 2**:
+
+ Input: n = 3, trust = [[1,3],[2,3]]
+ Output: 3
+
+**Example 3**:
+
+ Input: n = 3, trust = [[1,3],[2,3],[3,1]]
+ Output: -1
+
+**Constraints:**
+
+- 1 <= n <= 1000
+- 0 <= trust.length <= 10000
+- trust[i].length == 2
+- All the pairs of trust are unique.
+- ai != bi
+- 1 <= ai, bi <= n
+
+## 题目大意
+
+小镇里有 n 个人，按从 1 到 n 的顺序编号。传言称，这些人中有一个暗地里是小镇法官。
+
+如果小镇法官真的存在，那么：
+
+- 小镇法官不会信任任何人。
+- 每个人（除了小镇法官）都信任这位小镇法官。
+- 只有一个人同时满足属性 1 和属性 2 。
+
+给你一个数组 trust ，其中 trust[i] = [ai, bi] 表示编号为 ai 的人信任编号为 bi 的人。
+
+如果小镇法官存在并且可以确定他的身份，请返回该法官的编号；否则，返回 -1 。
+
+## 解题思路
+
+入度和出度统计
+
+- 被人信任定义为入度, 信任别人定义为出度
+- 如果 1-n 之间有数字 x 的入度为 n - 1，出度为 0，则返回 x
+
+## 代码
+
+```go
+package leetcode
+
+func findJudge(n int, trust [][]int) int {
+ if n == 1 && len(trust) == 0 {
+ return 1
+ }
+ judges := make(map[int]int)
+ for _, v := range trust {
+ judges[v[1]] += 1
+ }
+ for _, v := range trust {
+ if _, ok := judges[v[0]]; ok {
+ delete(judges, v[0])
+ }
+ }
+ for k, v := range judges {
+ if v == n-1 {
+ return k
+ }
+ }
+ return -1
+}
+```
\ No newline at end of file
diff --git a/leetcode/1006.Clumsy-Factorial/1006. Clumsy Factorial.go b/leetcode/1006.Clumsy-Factorial/1006. Clumsy Factorial.go
new file mode 100644
index 000000000..f69cfaca2
--- /dev/null
+++ b/leetcode/1006.Clumsy-Factorial/1006. Clumsy Factorial.go
@@ -0,0 +1,27 @@
+package leetcode
+
+func clumsy(N int) int {
+ res, count, tmp, flag := 0, 1, N, false
+ for i := N - 1; i > 0; i-- {
+ count = count % 4
+ switch count {
+ case 1:
+ tmp = tmp * i
+ case 2:
+ tmp = tmp / i
+ case 3:
+ res = res + tmp
+ flag = true
+ tmp = -1
+ res = res + i
+ case 0:
+ flag = false
+ tmp = tmp * (i)
+ }
+ count++
+ }
+ if !flag {
+ res = res + tmp
+ }
+ return res
+}
diff --git a/leetcode/1006.Clumsy-Factorial/1006. Clumsy Factorial_test.go b/leetcode/1006.Clumsy-Factorial/1006. Clumsy Factorial_test.go
new file mode 100644
index 000000000..3f683f6fc
--- /dev/null
+++ b/leetcode/1006.Clumsy-Factorial/1006. Clumsy Factorial_test.go
@@ -0,0 +1,52 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question1006 struct {
+ para1006
+ ans1006
+}
+
+// para 是参数
+// one 代表第一个参数
+type para1006 struct {
+ N int
+}
+
+// ans 是答案
+// one 代表第一个答案
+type ans1006 struct {
+ one int
+}
+
+func Test_Problem1006(t *testing.T) {
+
+ qs := []question1006{
+
+ {
+ para1006{4},
+ ans1006{7},
+ },
+
+ {
+ para1006{10},
+ ans1006{12},
+ },
+
+ {
+ para1006{100},
+ ans1006{101},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 1006------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans1006, q.para1006
+ fmt.Printf("【input】:%v 【output】:%v\n", p, clumsy(p.N))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/1006.Clumsy-Factorial/README.md b/leetcode/1006.Clumsy-Factorial/README.md
new file mode 100644
index 000000000..db1a37324
--- /dev/null
+++ b/leetcode/1006.Clumsy-Factorial/README.md
@@ -0,0 +1,75 @@
+# [1006. Clumsy Factorial](https://leetcode.com/problems/clumsy-factorial/)
+
+
+## 题目
+
+Normally, the factorial of a positive integer `n` is the product of all positive integers less than or equal to `n`. For example, `factorial(10) = 10 * 9 * 8 * 7 * 6 * 5 * 4 * 3 * 2 * 1`.
+
+We instead make a *clumsy factorial:* using the integers in decreasing order, we swap out the multiply operations for a fixed rotation of operations: multiply (*), divide (/), add (+) and subtract (-) in this order.
+
+For example, `clumsy(10) = 10 * 9 / 8 + 7 - 6 * 5 / 4 + 3 - 2 * 1`. However, these operations are still applied using the usual order of operations of arithmetic: we do all multiplication and division steps before any addition or subtraction steps, and multiplication and division steps are processed left to right.
+
+Additionally, the division that we use is *floor division* such that `10 * 9 / 8` equals `11`. This guarantees the result is an integer.
+
+`Implement the clumsy` function as defined above: given an integer `N`, it returns the clumsy factorial of `N`.
+
+**Example 1:**
+
+```
+Input:4
+Output: 7
+Explanation: 7 = 4 * 3 / 2 + 1
+```
+
+**Example 2:**
+
+```
+Input:10
+Output:12
+Explanation:12 = 10 * 9 / 8 + 7 - 6 * 5 / 4 + 3 - 2 * 1
+```
+
+**Note:**
+
+1. `1 <= N <= 10000`
+2. `2^31 <= answer <= 2^31 - 1` (The answer is guaranteed to fit within a 32-bit integer.)
+
+## 题目大意
+
+通常，正整数 n 的阶乘是所有小于或等于 n 的正整数的乘积。例如，factorial(10) = 10 * 9 * 8 * 7 * 6 * 5 * 4 * 3 * 2 * 1。相反，我们设计了一个笨阶乘 clumsy：在整数的递减序列中，我们以一个固定顺序的操作符序列来依次替换原有的乘法操作符：乘法(*)，除法(/)，加法(+)和减法(-)。例如，clumsy(10) = 10 * 9 / 8 + 7 - 6 * 5 / 4 + 3 - 2 * 1。然而，这些运算仍然使用通常的算术运算顺序：我们在任何加、减步骤之前执行所有的乘法和除法步骤，并且按从左到右处理乘法和除法步骤。另外，我们使用的除法是地板除法（floor division），所以 10 * 9 / 8 等于 11。这保证结果是一个整数。实现上面定义的笨函数：给定一个整数 N，它返回 N 的笨阶乘。
+
+## 解题思路
+
+- 按照题意，由于本题没有括号，所以先乘除后加减。4 个操作一组，先算乘法，再算除法，再算加法，最后算减法。减法也可以看成是加法，只是带负号的加法。
+
+## 代码
+
+```go
+package leetcode
+
+func clumsy(N int) int {
+ res, count, tmp, flag := 0, 1, N, true
+ for i := N - 1; i > 0; i-- {
+ count = count % 4
+ switch count {
+ case 1:
+ tmp = tmp * i
+ case 2:
+ tmp = tmp / i
+ case 3:
+ res = res + tmp
+ flag = true
+ tmp = -1
+ res = res + i
+ case 0:
+ flag = false
+ tmp = tmp * (i)
+ }
+ count++
+ }
+ if !flag {
+ res = res + tmp
+ }
+ return res
+}
+```
\ No newline at end of file
diff --git a/leetcode/1009.Complement-of-Base-10-Integer/1009. Complement of Base 10 Integer.go b/leetcode/1009.Complement-of-Base-10-Integer/1009. Complement of Base 10 Integer.go
new file mode 100644
index 000000000..19e526e39
--- /dev/null
+++ b/leetcode/1009.Complement-of-Base-10-Integer/1009. Complement of Base 10 Integer.go
@@ -0,0 +1,9 @@
+package leetcode
+
+func bitwiseComplement(n int) int {
+ mask := 1
+ for mask < n {
+ mask = (mask << 1) + 1
+ }
+ return mask ^ n
+}
diff --git a/leetcode/1009.Complement-of-Base-10-Integer/1009. Complement of Base 10 Integer_test.go b/leetcode/1009.Complement-of-Base-10-Integer/1009. Complement of Base 10 Integer_test.go
new file mode 100644
index 000000000..90bf93447
--- /dev/null
+++ b/leetcode/1009.Complement-of-Base-10-Integer/1009. Complement of Base 10 Integer_test.go
@@ -0,0 +1,52 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question1009 struct {
+ para1009
+ ans1009
+}
+
+// para 是参数
+// one 代表第一个参数
+type para1009 struct {
+ n int
+}
+
+// ans 是答案
+// one 代表第一个答案
+type ans1009 struct {
+ one int
+}
+
+func Test_Problem1009(t *testing.T) {
+
+ qs := []question1009{
+
+ {
+ para1009{5},
+ ans1009{2},
+ },
+
+ {
+ para1009{7},
+ ans1009{0},
+ },
+
+ {
+ para1009{10},
+ ans1009{5},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 1009------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans1009, q.para1009
+ fmt.Printf("【input】:%v 【output】:%v\n", p, bitwiseComplement(p.n))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/1009.Complement-of-Base-10-Integer/README.md b/leetcode/1009.Complement-of-Base-10-Integer/README.md
new file mode 100644
index 000000000..d8b12b302
--- /dev/null
+++ b/leetcode/1009.Complement-of-Base-10-Integer/README.md
@@ -0,0 +1,67 @@
+# [1009. Complement of Base 10 Integer](https://leetcode.com/problems/complement-of-base-10-integer/)
+
+
+## 题目
+
+The **complement** of an integer is the integer you get when you flip all the `0`'s to `1`'s and all the `1`'s to `0`'s in its binary representation.
+
+- For example, The integer `5` is `"101"` in binary and its **complement** is `"010"` which is the integer `2`.
+
+Given an integer `n`, return *its complement*.
+
+**Example 1:**
+
+```
+Input: n = 5
+Output: 2
+Explanation: 5 is "101" in binary, with complement "010" in binary, which is 2 in base-10.
+
+```
+
+**Example 2:**
+
+```
+Input: n = 7
+Output: 0
+Explanation: 7 is "111" in binary, with complement "000" in binary, which is 0 in base-10.
+
+```
+
+**Example 3:**
+
+```
+Input: n = 10
+Output: 5
+Explanation: 10 is "1010" in binary, with complement "0101" in binary, which is 5 in base-10.
+
+```
+
+**Constraints:**
+
+- `0 <= n < 109`
+
+## 题目大意
+
+每个非负整数 N 都有其二进制表示。例如， 5 可以被表示为二进制 "101"，11 可以用二进制 "1011" 表示，依此类推。注意，除 N = 0 外，任何二进制表示中都不含前导零。
+
+二进制的反码表示是将每个 1 改为 0 且每个 0 变为 1。例如，二进制数 "101" 的二进制反码为 "010"。
+
+给你一个十进制数 N，请你返回其二进制表示的反码所对应的十进制整数。
+
+## 解题思路
+
+- 简单题。求一个十进制数的反码，只需要让该数和全 1 的数进行异或计算即可。所以本题重点在如何构造 mask 上。
+
+## 代码
+
+```go
+package leetcode
+
+func bitwiseComplement(n int) int {
+ mask := 1
+ for mask < n {
+ mask = (mask << 1) + 1
+ }
+ return mask ^ n
+}
+```
\ No newline at end of file
diff --git a/leetcode/1010.Pairs-of-Songs-With-Total-Durations-Divisible-by-60/1010. Pairs of Songs With Total Durations Divisible by 60.go b/leetcode/1010.Pairs-of-Songs-With-Total-Durations-Divisible-by-60/1010. Pairs of Songs With Total Durations Divisible by 60.go
new file mode 100644
index 000000000..3c6dd1afd
--- /dev/null
+++ b/leetcode/1010.Pairs-of-Songs-With-Total-Durations-Divisible-by-60/1010. Pairs of Songs With Total Durations Divisible by 60.go
@@ -0,0 +1,16 @@
+package leetcode
+
+func numPairsDivisibleBy60(time []int) int {
+ counts := make([]int, 60)
+ for _, v := range time {
+ v %= 60
+ counts[v]++
+ }
+ res := 0
+ for i := 1; i < len(counts)/2; i++ {
+ res += counts[i] * counts[60-i]
+ }
+ res += (counts[0] * (counts[0] - 1)) / 2
+ res += (counts[30] * (counts[30] - 1)) / 2
+ return res
+}
diff --git a/leetcode/1010.Pairs-of-Songs-With-Total-Durations-Divisible-by-60/1010. Pairs of Songs With Total Durations Divisible by 60_test.go b/leetcode/1010.Pairs-of-Songs-With-Total-Durations-Divisible-by-60/1010. Pairs of Songs With Total Durations Divisible by 60_test.go
new file mode 100644
index 000000000..201e0c727
--- /dev/null
+++ b/leetcode/1010.Pairs-of-Songs-With-Total-Durations-Divisible-by-60/1010. Pairs of Songs With Total Durations Divisible by 60_test.go
@@ -0,0 +1,47 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question1010 struct {
+ para1010
+ ans1010
+}
+
+// para 是参数
+// one 代表第一个参数
+type para1010 struct {
+ time []int
+}
+
+// ans 是答案
+// one 代表第一个答案
+type ans1010 struct {
+ one int
+}
+
+func Test_Problem1010(t *testing.T) {
+
+ qs := []question1010{
+
+ {
+ para1010{[]int{30, 20, 150, 100, 40}},
+ ans1010{3},
+ },
+
+ {
+ para1010{[]int{60, 60, 60}},
+ ans1010{3},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 1010------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans1010, q.para1010
+ fmt.Printf("【input】:%v 【output】:%v\n", p, numPairsDivisibleBy60(p.time))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/1010.Pairs-of-Songs-With-Total-Durations-Divisible-by-60/README.md b/leetcode/1010.Pairs-of-Songs-With-Total-Durations-Divisible-by-60/README.md
new file mode 100644
index 000000000..a49f11207
--- /dev/null
+++ b/leetcode/1010.Pairs-of-Songs-With-Total-Durations-Divisible-by-60/README.md
@@ -0,0 +1,63 @@
+# [1010. Pairs of Songs With Total Durations Divisible by 60](https://leetcode.com/problems/pairs-of-songs-with-total-durations-divisible-by-60/)
+
+
+## 题目
+
+You are given a list of songs where the ith song has a duration of `time[i]` seconds.
+
+Return *the number of pairs of songs for which their total duration in seconds is divisible by* `60`. Formally, we want the number of indices `i`, `j` such that `i < j` with `(time[i] + time[j]) % 60 == 0`.
+
+**Example 1:**
+
+```
+Input: time = [30,20,150,100,40]
+Output: 3
+Explanation: Three pairs have a total duration divisible by 60:
+(time[0] = 30, time[2] = 150): total duration 180
+(time[1] = 20, time[3] = 100): total duration 120
+(time[1] = 20, time[4] = 40): total duration 60
+
+```
+
+**Example 2:**
+
+```
+Input: time = [60,60,60]
+Output: 3
+Explanation: All three pairs have a total duration of 120, which is divisible by 60.
+
+```
+
+**Constraints:**
+
+- `1 <= time.length <= 6 * 104`
+- `1 <= time[i] <= 500`
+
+## 题目大意
+
+在歌曲列表中，第 i 首歌曲的持续时间为 time[i] 秒。
+
+返回其总持续时间（以秒为单位）可被 60 整除的歌曲对的数量。形式上，我们希望下标数字 i 和 j 满足 i < j 且有 (time[i] + time[j]) % 60 == 0。
+
+## 解题思路
+
+- 简单题。先将数组每个元素对 60 取余，将它们都转换到 [0,59] 之间。然后在数组中找两两元素之和等于 60 的数对。可以在 0-30 之内对半查找符合条件的数对。对 0 和 30 单独计算。因为多个 0 相加，余数还为 0 。2 个 30 相加之和为 60。
+
+## 代码
+
+```go
+func numPairsDivisibleBy60(time []int) int {
+ counts := make([]int, 60)
+ for _, v := range time {
+ v %= 60
+ counts[v]++
+ }
+ res := 0
+ for i := 1; i < len(counts)/2; i++ {
+ res += counts[i] * counts[60-i]
+ }
+ res += (counts[0] * (counts[0] - 1)) / 2
+ res += (counts[30] * (counts[30] - 1)) / 2
+ return res
+}
+```
\ No newline at end of file
diff --git a/leetcode/1017.Convert-to-Base--2/1017. Convert to Base -2.go b/leetcode/1017.Convert-to-Base-2/1017. Convert to Base -2.go
similarity index 100%
rename from leetcode/1017.Convert-to-Base--2/1017. Convert to Base -2.go
rename to leetcode/1017.Convert-to-Base-2/1017. Convert to Base -2.go
diff --git a/leetcode/1017.Convert-to-Base--2/1017. Convert to Base -2_test.go b/leetcode/1017.Convert-to-Base-2/1017. Convert to Base -2_test.go
similarity index 100%
rename from leetcode/1017.Convert-to-Base--2/1017. Convert to Base -2_test.go
rename to leetcode/1017.Convert-to-Base-2/1017. Convert to Base -2_test.go
diff --git a/leetcode/1017.Convert-to-Base--2/README.md b/leetcode/1017.Convert-to-Base-2/README.md
similarity index 100%
rename from leetcode/1017.Convert-to-Base--2/README.md
rename to leetcode/1017.Convert-to-Base-2/README.md
diff --git a/leetcode/1018.Binary-Prefix-Divisible-By-5/1018. Binary Prefix Divisible By 5.go b/leetcode/1018.Binary-Prefix-Divisible-By-5/1018. Binary Prefix Divisible By 5.go
new file mode 100644
index 000000000..8d88763f6
--- /dev/null
+++ b/leetcode/1018.Binary-Prefix-Divisible-By-5/1018. Binary Prefix Divisible By 5.go
@@ -0,0 +1,10 @@
+package leetcode
+
+func prefixesDivBy5(a []int) []bool {
+ res, num := make([]bool, len(a)), 0
+ for i, v := range a {
+ num = (num<<1 | v) % 5
+ res[i] = num == 0
+ }
+ return res
+}
diff --git a/leetcode/1018.Binary-Prefix-Divisible-By-5/1018. Binary Prefix Divisible By 5_test.go b/leetcode/1018.Binary-Prefix-Divisible-By-5/1018. Binary Prefix Divisible By 5_test.go
new file mode 100644
index 000000000..2903210e0
--- /dev/null
+++ b/leetcode/1018.Binary-Prefix-Divisible-By-5/1018. Binary Prefix Divisible By 5_test.go
@@ -0,0 +1,57 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question1018 struct {
+ para1018
+ ans1018
+}
+
+// para 是参数
+// one 代表第一个参数
+type para1018 struct {
+ a []int
+}
+
+// ans 是答案
+// one 代表第一个答案
+type ans1018 struct {
+ one []bool
+}
+
+func Test_Problem1018(t *testing.T) {
+
+ qs := []question1018{
+
+ {
+ para1018{[]int{0, 1, 1}},
+ ans1018{[]bool{true, false, false}},
+ },
+
+ {
+ para1018{[]int{1, 1, 1}},
+ ans1018{[]bool{false, false, false}},
+ },
+
+ {
+ para1018{[]int{0, 1, 1, 1, 1, 1}},
+ ans1018{[]bool{true, false, false, false, true, false}},
+ },
+
+ {
+ para1018{[]int{1, 1, 1, 0, 1}},
+ ans1018{[]bool{false, false, false, false, false}},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 1018------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans1018, q.para1018
+ fmt.Printf("【input】:%v 【output】:%v\n", p, prefixesDivBy5(p.a))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/1018.Binary-Prefix-Divisible-By-5/README.md b/leetcode/1018.Binary-Prefix-Divisible-By-5/README.md
new file mode 100644
index 000000000..5559c7e9a
--- /dev/null
+++ b/leetcode/1018.Binary-Prefix-Divisible-By-5/README.md
@@ -0,0 +1,70 @@
+# [1018. Binary Prefix Divisible By 5](https://leetcode.com/problems/binary-prefix-divisible-by-5/)
+
+
+## 题目
+
+Given an array `A` of `0`s and `1`s, consider `N_i`: the i-th subarray from `A[0]` to `A[i]` interpreted as a binary number (from most-significant-bit to least-significant-bit.)
+
+Return a list of booleans `answer`, where `answer[i]` is `true` if and only if `N_i` is divisible by 5.
+
+**Example 1:**
+
+```
+Input: [0,1,1]
+Output: [true,false,false]
+Explanation:
+The input numbers in binary are 0, 01, 011; which are 0, 1, and 3 in base-10. Only the first number is divisible by 5, so answer[0] is true.
+
+```
+
+**Example 2:**
+
+```
+Input: [1,1,1]
+Output: [false,false,false]
+
+```
+
+**Example 3:**
+
+```
+Input: [0,1,1,1,1,1]
+Output: [true,false,false,false,true,false]
+
+```
+
+**Example 4:**
+
+```
+Input: [1,1,1,0,1]
+Output: [false,false,false,false,false]
+
+```
+
+**Note:**
+
+1. `1 <= A.length <= 30000`
+2. `A[i]` is `0` or `1`
+
+## 题目大意
+
+给定由若干 0 和 1 组成的数组 A。我们定义 N_i：从 A[0] 到 A[i] 的第 i 个子数组被解释为一个二进制数（从最高有效位到最低有效位）。返回布尔值列表 answer，只有当 N_i 可以被 5 整除时，答案 answer[i] 为 true，否则为 false。
+
+## 解题思路
+
+- 简单题。每扫描数组中的一个数字，累计转换成二进制数对 5 取余，如果余数为 0，则存入 true，否则存入 false。
+
+## 代码
+
+```go
+package leetcode
+
+func prefixesDivBy5(a []int) []bool {
+ res, num := make([]bool, len(a)), 0
+ for i, v := range a {
+ num = (num<<1 | v) % 5
+ res[i] = num == 0
+ }
+ return res
+}
+```
\ No newline at end of file
diff --git a/leetcode/1019.Next-Greater-Node-In-Linked-List/1019. Next Greater Node In Linked List.go b/leetcode/1019.Next-Greater-Node-In-Linked-List/1019. Next Greater Node In Linked List.go
index 8ef54327c..a789e7748 100644
--- a/leetcode/1019.Next-Greater-Node-In-Linked-List/1019. Next Greater Node In Linked List.go
+++ b/leetcode/1019.Next-Greater-Node-In-Linked-List/1019. Next Greater Node In Linked List.go
@@ -14,25 +14,22 @@ type ListNode = structures.ListNode
* Next *ListNode
* }
*/
+
// 解法一 单调栈
func nextLargerNodes(head *ListNode) []int {
- res, indexes, nums := make([]int, 0), make([]int, 0), make([]int, 0)
- p := head
- for p != nil {
- nums = append(nums, p.Val)
- p = p.Next
- }
- for i := 0; i < len(nums); i++ {
- res = append(res, 0)
+ type node struct {
+ index, val int
}
- for i := 0; i < len(nums); i++ {
- num := nums[i]
- for len(indexes) > 0 && nums[indexes[len(indexes)-1]] < num {
- index := indexes[len(indexes)-1]
- res[index] = num
- indexes = indexes[:len(indexes)-1]
+ var monoStack []node
+ var res []int
+ for head != nil {
+ for len(monoStack) > 0 && monoStack[len(monoStack)-1].val < head.Val {
+ res[monoStack[len(monoStack)-1].index] = head.Val
+ monoStack = monoStack[:len(monoStack)-1]
}
- indexes = append(indexes, i)
+ monoStack = append(monoStack, node{len(res), head.Val})
+ res = append(res, 0)
+ head = head.Next
}
return res
}
diff --git a/leetcode/1022.Sum-of-Root-To-Leaf-Binary-Numbers/1022. Sum of Root To Leaf Binary Numbers.go b/leetcode/1022.Sum-of-Root-To-Leaf-Binary-Numbers/1022. Sum of Root To Leaf Binary Numbers.go
new file mode 100644
index 000000000..473564c29
--- /dev/null
+++ b/leetcode/1022.Sum-of-Root-To-Leaf-Binary-Numbers/1022. Sum of Root To Leaf Binary Numbers.go
@@ -0,0 +1,30 @@
+package leetcode
+
+import "github.com/halfrost/LeetCode-Go/structures"
+
+// TreeNode define
+type TreeNode = structures.TreeNode
+
+/**
+ * Definition for a binary tree node.
+ * type TreeNode struct {
+ * Val int
+ * Left *TreeNode
+ * Right *TreeNode
+ * }
+ */
+func sumRootToLeaf(root *TreeNode) int {
+ var dfs func(*TreeNode, int) int
+ dfs = func(node *TreeNode, sum int) int {
+ if node == nil {
+ return 0
+ }
+ sum = sum<<1 | node.Val
+ // 上一行也可以写作 sum = sum*2 + node.Val
+ if node.Left == nil && node.Right == nil {
+ return sum
+ }
+ return dfs(node.Left, sum) + dfs(node.Right, sum)
+ }
+ return dfs(root, 0)
+}
diff --git a/leetcode/1022.Sum-of-Root-To-Leaf-Binary-Numbers/1022. Sum of Root To Leaf Binary Numbers_test.go b/leetcode/1022.Sum-of-Root-To-Leaf-Binary-Numbers/1022. Sum of Root To Leaf Binary Numbers_test.go
new file mode 100644
index 000000000..3b7ce6f92
--- /dev/null
+++ b/leetcode/1022.Sum-of-Root-To-Leaf-Binary-Numbers/1022. Sum of Root To Leaf Binary Numbers_test.go
@@ -0,0 +1,49 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+
+ "github.com/halfrost/LeetCode-Go/structures"
+)
+
+type question1022 struct {
+ para1022
+ ans1022
+}
+
+// para 是参数
+// one 代表第一个参数
+type para1022 struct {
+ one []int
+}
+
+// ans 是答案
+// one 代表第一个答案
+type ans1022 struct {
+ one int
+}
+
+func Test_Problem1022(t *testing.T) {
+
+ qs := []question1022{
+ {
+ para1022{[]int{1, 0, 1, 0, 1, 0, 1}},
+ ans1022{22},
+ },
+
+ {
+ para1022{[]int{0}},
+ ans1022{0},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 1022------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans1022, q.para1022
+ root := structures.Ints2TreeNode(p.one)
+ fmt.Printf("【input】:%v 【output】:%v\n", p, sumRootToLeaf(root))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/1022.Sum-of-Root-To-Leaf-Binary-Numbers/README.md b/leetcode/1022.Sum-of-Root-To-Leaf-Binary-Numbers/README.md
new file mode 100644
index 000000000..83578063e
--- /dev/null
+++ b/leetcode/1022.Sum-of-Root-To-Leaf-Binary-Numbers/README.md
@@ -0,0 +1,54 @@
+# [1022. Sum of Root To Leaf Binary Numbers](https://leetcode.com/problems/sum-of-root-to-leaf-binary-numbers/)
+
+## 题目
+
+You are given the root of a binary tree where each node has a value 0 or 1. Each root-to-leaf path represents a binary number starting with the most significant bit.
+
+For example, if the path is 0 -> 1 -> 1 -> 0 -> 1, then this could represent 01101 in binary, which is 13.
+For all leaves in the tree, consider the numbers represented by the path from the root to that leaf. Return the sum of these numbers.
+
+The test cases are generated so that the answer fits in a 32-bits integer.
+
+**Example 1:**
+
+```c
+Input: root = [1,0,1,0,1,0,1]
+Output: 22
+Explanation: (100) + (101) + (110) + (111) = 4 + 5 + 6 + 7 = 22
+```
+
+**Example 2:**
+
+```c
+Input: root = [0]
+Output: 0
+```
+
+**Constraints:**
+
+- The number of nodes in the tree is in the range `[1, 1000]`.
+
+- `Node.val` is `0` or `1`.
+
+
+## 题目大意
+
+给定一棵结点值都是`0`或`1`的二叉树，每条从根结点到叶结点的路径都代表一个从最高有效位开始的二进制数。
+
+返回从根节点到所有叶结点的路径所表示的数字之和。
+
+
+## 解题思路
+
+采用递归的方式对根结点`root`进行后序遍历（左子树-右子树-根结点）。
+
+**递归函数的返回值**：
+
+递归遍历每个结点时，计算从根结点到当前访问结点的所表示数值`sum`都用到了上次的计算结果，所以递归函数的返回值是当前访问结点的计算结果值。
+
+**递归函数的逻辑**：
+
+- 当前遍历结点为`nil`，表示本层递归结束了，直接`return 0`。
+
+- 如果当前访问结点是叶结点，则返回从根结点到该结点所表示的数值`sum`。
+- 如果当前访问结点不是叶结点，则返回左子树和右子树所对应的结果之和。
diff --git a/leetcode/1028.Recover-a-Tree-From-Preorder-Traversal/1028. Recover a Tree From Preorder Traversal.go b/leetcode/1028.Recover-a-Tree-From-Preorder-Traversal/1028. Recover a Tree From Preorder Traversal.go
index c3929f74e..f597f671c 100644
--- a/leetcode/1028.Recover-a-Tree-From-Preorder-Traversal/1028. Recover a Tree From Preorder Traversal.go
+++ b/leetcode/1028.Recover-a-Tree-From-Preorder-Traversal/1028. Recover a Tree From Preorder Traversal.go
@@ -2,9 +2,7 @@ package leetcode
import (
"strconv"
-)
-import (
"github.com/halfrost/LeetCode-Go/structures"
)
diff --git a/leetcode/1034.Coloring-A-Border/1034.Coloring A Border.go b/leetcode/1034.Coloring-A-Border/1034.Coloring A Border.go
new file mode 100644
index 000000000..70df28edd
--- /dev/null
+++ b/leetcode/1034.Coloring-A-Border/1034.Coloring A Border.go
@@ -0,0 +1,50 @@
+package leetcode
+
+type point struct {
+ x int
+ y int
+}
+
+type gridInfo struct {
+ m int
+ n int
+ grid [][]int
+ originalColor int
+}
+
+func colorBorder(grid [][]int, row, col, color int) [][]int {
+ m, n := len(grid), len(grid[0])
+ dirs := []point{{1, 0}, {-1, 0}, {0, 1}, {0, -1}}
+ vis := make([][]bool, m)
+ for i := range vis {
+ vis[i] = make([]bool, n)
+ }
+ var borders []point
+ gInfo := gridInfo{
+ m: m,
+ n: n,
+ grid: grid,
+ originalColor: grid[row][col],
+ }
+ dfs(row, col, gInfo, dirs, vis, &borders)
+ for _, p := range borders {
+ grid[p.x][p.y] = color
+ }
+ return grid
+}
+
+func dfs(x, y int, gInfo gridInfo, dirs []point, vis [][]bool, borders *[]point) {
+ vis[x][y] = true
+ isBorder := false
+ for _, dir := range dirs {
+ nx, ny := x+dir.x, y+dir.y
+ if !(0 <= nx && nx < gInfo.m && 0 <= ny && ny < gInfo.n && gInfo.grid[nx][ny] == gInfo.originalColor) {
+ isBorder = true
+ } else if !vis[nx][ny] {
+ dfs(nx, ny, gInfo, dirs, vis, borders)
+ }
+ }
+ if isBorder {
+ *borders = append(*borders, point{x, y})
+ }
+}
diff --git a/leetcode/1034.Coloring-A-Border/1034.Coloring A Border_test.go b/leetcode/1034.Coloring-A-Border/1034.Coloring A Border_test.go
new file mode 100644
index 000000000..812a9c241
--- /dev/null
+++ b/leetcode/1034.Coloring-A-Border/1034.Coloring A Border_test.go
@@ -0,0 +1,53 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question1034 struct {
+ para1034
+ ans1034
+}
+
+// para 是参数
+type para1034 struct {
+ grid [][]int
+ row int
+ col int
+ color int
+}
+
+// ans 是答案
+type ans1034 struct {
+ ans [][]int
+}
+
+func Test_Problem1034(t *testing.T) {
+
+ qs := []question1034{
+
+ {
+ para1034{[][]int{{1, 1}, {1, 2}}, 0, 0, 3},
+ ans1034{[][]int{{3, 3}, {3, 2}}},
+ },
+
+ {
+ para1034{[][]int{{1, 2, 2}, {2, 3, 2}}, 0, 1, 3},
+ ans1034{[][]int{{1, 3, 3}, {2, 3, 3}}},
+ },
+
+ {
+ para1034{[][]int{{1, 1, 1}, {1, 1, 1}, {1, 1, 1}}, 1, 1, 2},
+ ans1034{[][]int{{2, 2, 2}, {2, 1, 2}, {2, 2, 2}}},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 1034------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans1034, q.para1034
+ fmt.Printf("【input】:%v 【output】:%v\n", p, colorBorder(p.grid, p.row, p.col, p.color))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/1034.Coloring-A-Border/README.md b/leetcode/1034.Coloring-A-Border/README.md
new file mode 100644
index 000000000..6700260f9
--- /dev/null
+++ b/leetcode/1034.Coloring-A-Border/README.md
@@ -0,0 +1,108 @@
+# [1034. Coloring A Border](https://leetcode.com/problems/coloring-a-border/)
+
+## 题目
+
+You are given an m x n integer matrix grid, and three integers row, col, and color. Each value in the grid represents the color of the grid square at that location.
+
+Two squares belong to the same connected component if they have the same color and are next to each other in any of the 4 directions.
+
+The border of a connected component is all the squares in the connected component that are either 4-directionally adjacent to a square not in the component, or on the boundary of the grid (the first or last row or column).
+
+You should color the border of the connected component that contains the square grid[row][col] with color.
+
+Return the final grid.
+
+**Example 1**:
+
+ Input: grid = [[1,1],[1,2]], row = 0, col = 0, color = 3
+ Output: [[3,3],[3,2]]
+
+**Example 2**:
+
+ Input: grid = [[1,2,2],[2,3,2]], row = 0, col = 1, color = 3
+ Output: [[1,3,3],[2,3,3]]
+
+**Example 3**:
+
+ Input: grid = [[1,1,1],[1,1,1],[1,1,1]], row = 1, col = 1, color = 2
+ Output: [[2,2,2],[2,1,2],[2,2,2]]
+
+**Constraints:**
+
+- m == grid.length
+- n == grid[i].length
+- 1 <= m, n <= 50
+- 1 <= grid[i][j], color <= 1000
+- 0 <= row < m
+- 0 <= col < n
+
+## 题目大意
+
+给你一个大小为 m x n 的整数矩阵 grid ，表示一个网格。另给你三个整数 row、col 和 color 。网格中的每个值表示该位置处的网格块的颜色。
+
+当两个网格块的颜色相同，而且在四个方向中任意一个方向上相邻时，它们属于同一连通分量
+
+边界：在连通分量的块中（前提）并且满足以下条件之一：
+（1）要么上下左右存在一个块不在连通分量里面
+（2）要么这个块的位置在整个grid的边框上
+
+请你使用指定颜色 color 为所有包含网格块 grid[row][col] 的连通分量的边界进行着色，并返回最终的网格 grid 。
+
+## 解题思路
+
+- 用 bfs 进行遍历选出边界，使用 color 给边界着色
+
+## 代码
+
+```go
+package leetcode
+
+type point struct {
+ x int
+ y int
+}
+
+type gridInfo struct {
+ m int
+ n int
+ grid [][]int
+ originalColor int
+}
+
+func colorBorder(grid [][]int, row, col, color int) [][]int {
+ m, n := len(grid), len(grid[0])
+ dirs := []point{{1, 0}, {-1, 0}, {0, 1}, {0, -1}}
+ vis := make([][]bool, m)
+ for i := range vis {
+ vis[i] = make([]bool, n)
+ }
+ var borders []point
+ gInfo := gridInfo{
+ m: m,
+ n: n,
+ grid: grid,
+ originalColor: grid[row][col],
+ }
+ dfs(row, col, gInfo, dirs, vis, &borders)
+ for _, p := range borders {
+ grid[p.x][p.y] = color
+ }
+ return grid
+}
+
+func dfs(x, y int, gInfo gridInfo, dirs []point, vis [][]bool, borders *[]point) {
+ vis[x][y] = true
+ isBorder := false
+ for _, dir := range dirs {
+ nx, ny := x+dir.x, y+dir.y
+ if !(0 <= nx && nx < gInfo.m && 0 <= ny && ny < gInfo.n && gInfo.grid[nx][ny] == gInfo.originalColor) {
+ isBorder = true
+ } else if !vis[nx][ny] {
+ dfs(nx, ny, gInfo, dirs, vis, borders)
+ }
+ }
+ if isBorder {
+ *borders = append(*borders, point{x, y})
+ }
+}
+```
\ No newline at end of file
diff --git a/leetcode/1038.Binary-Search-Tree-to-Greater-Sum-Tree/1038. Binary Search Tree to Greater Sum Tree.go b/leetcode/1038.Binary-Search-Tree-to-Greater-Sum-Tree/1038. Binary Search Tree to Greater Sum Tree.go
new file mode 100644
index 000000000..eedf6c39c
--- /dev/null
+++ b/leetcode/1038.Binary-Search-Tree-to-Greater-Sum-Tree/1038. Binary Search Tree to Greater Sum Tree.go
@@ -0,0 +1,36 @@
+package leetcode
+
+import (
+ "github.com/halfrost/LeetCode-Go/structures"
+)
+
+// TreeNode define
+type TreeNode = structures.TreeNode
+
+/**
+ * Definition for a binary tree node.
+ * type TreeNode struct {
+ * Val int
+ * Left *TreeNode
+ * Right *TreeNode
+ * }
+ */
+
+func bstToGst(root *TreeNode) *TreeNode {
+ if root == nil {
+ return root
+ }
+ sum := 0
+ dfs1038(root, &sum)
+ return root
+}
+
+func dfs1038(root *TreeNode, sum *int) {
+ if root == nil {
+ return
+ }
+ dfs1038(root.Right, sum)
+ root.Val += *sum
+ *sum = root.Val
+ dfs1038(root.Left, sum)
+}
diff --git a/leetcode/1038.Binary-Search-Tree-to-Greater-Sum-Tree/1038. Binary Search Tree to Greater Sum Tree_test.go b/leetcode/1038.Binary-Search-Tree-to-Greater-Sum-Tree/1038. Binary Search Tree to Greater Sum Tree_test.go
new file mode 100644
index 000000000..e6310e25f
--- /dev/null
+++ b/leetcode/1038.Binary-Search-Tree-to-Greater-Sum-Tree/1038. Binary Search Tree to Greater Sum Tree_test.go
@@ -0,0 +1,76 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+
+ "github.com/halfrost/LeetCode-Go/structures"
+)
+
+type question1038 struct {
+ para1038
+ ans1038
+}
+
+// para 是参数
+// one 代表第一个参数
+type para1038 struct {
+ one []int
+}
+
+// ans 是答案
+// one 代表第一个答案
+type ans1038 struct {
+ one []int
+}
+
+func Test_Problem1038(t *testing.T) {
+
+ qs := []question1038{
+
+ {
+ para1038{[]int{3, 1, structures.NULL, 0, structures.NULL, -4, structures.NULL, structures.NULL, -2}},
+ ans1038{[]int{3, 4, structures.NULL, 4, structures.NULL, -2, structures.NULL, structures.NULL, 2}},
+ },
+
+ {
+ para1038{[]int{2, 1}},
+ ans1038{[]int{2, 3}},
+ },
+
+ {
+ para1038{[]int{}},
+ ans1038{[]int{}},
+ },
+
+ {
+ para1038{[]int{4, 1, 6, 0, 2, 5, 7, structures.NULL, structures.NULL, structures.NULL, 3, structures.NULL, structures.NULL, structures.NULL, 8}},
+ ans1038{[]int{30, 36, 21, 36, 35, 26, 15, structures.NULL, structures.NULL, structures.NULL, 33, structures.NULL, structures.NULL, structures.NULL, 8}},
+ },
+
+ {
+ para1038{[]int{0, structures.NULL, 1}},
+ ans1038{[]int{1, structures.NULL, 1}},
+ },
+
+ {
+ para1038{[]int{1, 0, 2}},
+ ans1038{[]int{3, 3, 2}},
+ },
+
+ {
+ para1038{[]int{3, 2, 4, 1}},
+ ans1038{[]int{7, 9, 4, 10}},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 1038------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans1038, q.para1038
+ fmt.Printf("【input】:%v ", p)
+ root := structures.Ints2TreeNode(p.one)
+ fmt.Printf("【output】:%v \n", structures.Tree2ints(bstToGst(root)))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/1038.Binary-Search-Tree-to-Greater-Sum-Tree/README.md b/leetcode/1038.Binary-Search-Tree-to-Greater-Sum-Tree/README.md
new file mode 100644
index 000000000..69481c9dd
--- /dev/null
+++ b/leetcode/1038.Binary-Search-Tree-to-Greater-Sum-Tree/README.md
@@ -0,0 +1,107 @@
+# [1038. Binary Search Tree to Greater Sum Tree](https://leetcode.com/problems/binary-search-tree-to-greater-sum-tree/)
+
+
+## 题目
+
+Given the `root` of a Binary Search Tree (BST), convert it to a Greater Tree such that every key of the original BST is changed to the original key plus sum of all keys greater than the original key in BST.
+
+As a reminder, a *binary search tree* is a tree that satisfies these constraints:
+
+- The left subtree of a node contains only nodes with keys **less than** the node's key.
+- The right subtree of a node contains only nodes with keys **greater than** the node's key.
+- Both the left and right subtrees must also be binary search trees.
+
+**Note:** This question is the same as 538: [https://leetcode.com/problems/convert-bst-to-greater-tree/](https://leetcode.com/problems/convert-bst-to-greater-tree/)
+
+**Example 1:**
+
+
+
+```
+Input: root = [4,1,6,0,2,5,7,null,null,null,3,null,null,null,8]
+Output: [30,36,21,36,35,26,15,null,null,null,33,null,null,null,8]
+```
+
+**Example 2:**
+
+```
+Input: root = [0,null,1]
+Output: [1,null,1]
+```
+
+**Example 3:**
+
+```
+Input: root = [1,0,2]
+Output: [3,3,2]
+```
+
+**Example 4:**
+
+```
+Input: root = [3,2,4,1]
+Output: [7,9,4,10]
+```
+
+**Constraints:**
+
+- The number of nodes in the tree is in the range `[1, 100]`.
+- `0 <= Node.val <= 100`
+- All the values in the tree are **unique**.
+- `root` is guaranteed to be a valid binary search tree.
+
+## 题目大意
+
+给出二叉 搜索 树的根节点，该树的节点值各不相同，请你将其转换为累加树（Greater Sum Tree），使每个节点 node 的新值等于原树中大于或等于 node.val 的值之和。
+
+提醒一下，二叉搜索树满足下列约束条件：
+
+- 节点的左子树仅包含键 小于 节点键的节点。
+- 节点的右子树仅包含键 大于 节点键的节点。
+- 左右子树也必须是二叉搜索树。
+
+## 解题思路
+
+- 根据二叉搜索树的有序性，想要将其转换为累加树，只需按照 右节点 - 根节点 - 左节点的顺序遍历，并累加和即可。
+- 此题同第 538 题。
+
+## 代码
+
+```go
+package leetcode
+
+import (
+ "github.com/halfrost/LeetCode-Go/structures"
+)
+
+// TreeNode define
+type TreeNode = structures.TreeNode
+
+/**
+ * Definition for a binary tree node.
+ * type TreeNode struct {
+ * Val int
+ * Left *TreeNode
+ * Right *TreeNode
+ * }
+ */
+
+func bstToGst(root *TreeNode) *TreeNode {
+ if root == nil {
+ return root
+ }
+ sum := 0
+ dfs1038(root, &sum)
+ return root
+}
+
+func dfs1038(root *TreeNode, sum *int) {
+ if root == nil {
+ return
+ }
+ dfs1038(root.Right, sum)
+ root.Val += *sum
+ *sum = root.Val
+ dfs1038(root.Left, sum)
+}
+```
\ No newline at end of file
diff --git a/leetcode/1048.Longest-String-Chain/1048. Longest String Chain.go b/leetcode/1048.Longest-String-Chain/1048. Longest String Chain.go
new file mode 100644
index 000000000..b16653ba6
--- /dev/null
+++ b/leetcode/1048.Longest-String-Chain/1048. Longest String Chain.go
@@ -0,0 +1,49 @@
+package leetcode
+
+import "sort"
+
+func longestStrChain(words []string) int {
+ sort.Slice(words, func(i, j int) bool { return len(words[i]) < len(words[j]) })
+ poss, res := make([]int, 16+2), 0
+ for i, w := range words {
+ if poss[len(w)] == 0 {
+ poss[len(w)] = i
+ }
+ }
+ dp := make([]int, len(words))
+ for i := len(words) - 1; i >= 0; i-- {
+ dp[i] = 1
+ for j := poss[len(words[i])+1]; j < len(words) && len(words[j]) == len(words[i])+1; j++ {
+ if isPredecessor(words[j], words[i]) {
+ dp[i] = max(dp[i], 1+dp[j])
+ }
+ }
+ res = max(res, dp[i])
+ }
+ return res
+}
+
+func max(a, b int) int {
+ if a > b {
+ return a
+ }
+ return b
+}
+
+func isPredecessor(long, short string) bool {
+ i, j := 0, 0
+ wasMismatch := false
+ for j < len(short) {
+ if long[i] != short[j] {
+ if wasMismatch {
+ return false
+ }
+ wasMismatch = true
+ i++
+ continue
+ }
+ i++
+ j++
+ }
+ return true
+}
diff --git a/leetcode/1048.Longest-String-Chain/1048. Longest String Chain_test.go b/leetcode/1048.Longest-String-Chain/1048. Longest String Chain_test.go
new file mode 100644
index 000000000..97c9b3b5a
--- /dev/null
+++ b/leetcode/1048.Longest-String-Chain/1048. Longest String Chain_test.go
@@ -0,0 +1,78 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question1048 struct {
+ para1048
+ ans1048
+}
+
+// para 是参数
+// one 代表第一个参数
+type para1048 struct {
+ words []string
+}
+
+// ans 是答案
+// one 代表第一个答案
+type ans1048 struct {
+ one int
+}
+
+func Test_Problem1048(t *testing.T) {
+
+ qs := []question1048{
+
+ {
+ para1048{[]string{"a", "b", "ab", "bac"}},
+ ans1048{2},
+ },
+
+ {
+ para1048{[]string{"xbc", "pcxbcf", "xb", "cxbc", "pcxbc"}},
+ ans1048{5},
+ },
+
+ {
+ para1048{[]string{"a", "b", "ba", "bca", "bda", "bdca"}},
+ ans1048{4},
+ },
+
+ {
+ para1048{[]string{"qjcaeymang", "bqiq", "bcntqiqulagurhz", "lyctmomvis", "bdnhym", "crxrdlv", "wo", "kijftxssyqmui", "abtcrjs", "rceecupq", "crxrdclv", "tvwkxrev", "oc", "lrzzcl", "snpzuykyobci", "abbtczrjs", "rpqojpmv",
+ "kbfbcjxgvnb", "uqvhuucupu", "fwoquoih", "ezsuqxunx", "biq", "crxrwdclv", "qoyfqhytzxfp", "aryqceercpaupqm", "tvwxrev", "gchusjxz", "uls", "whb", "natdmc", "jvidsf", "yhyz", "smvsitdbutamn", "gcfsghusjsxiz", "ijpyhk", "tzvqwkmzxruevs",
+ "fwvjxaxrvmfm", "wscxklqmxhn", "velgcy", "lyctomvi", "smvsitbutam", "hfosz", "fuzubrpo", "dfdeidcepshvjn", "twqol", "rpqjpmv", "ijftxssyqmi", "dzuzsainzbsx", "qyzxfp", "tvwkmzxruev", "farfm", "bbwkizqhicip", "wqobtmamvpgluh", "rytspgy",
+ "uqvheuucdupuw", "jcmang", "h", "kijfhtxssyqmui", "twqgolksq", "rtkgopofnykkrl", "smvstbutam", "xkbfbbcjxgvnbq", "feyq", "oyfqhytzxfp", "velgcby", "dmnioxbf", "kbx", "zx", "wscxkqlqmxbhn", "efvcjtgoiga", "jumttwxv", "zux", "z", "smvsitbutamn",
+ "jftxssyqmi", "wnlhsaj", "bbwizqhcp", "yctomv", "oyqyzxfp", "wqhc", "jnnwp", "bcntqiquagurz", "qzx", "kbfbjxn", "dmnixbf", "ukqs", "fey", "ryqceecaupq", "smvlsitzdbutamn", "bdnhm", "lrhtwfosrzq", "nkptknldw", "crxrwdclvx", "abbtcwzrjs",
+ "uqvheuucupu", "abjbtcwbzrjs", "nkmptknldw", "wnulhsbaj", "wnlhsbaj", "wqobtmamvgluh", "jvis", "pcd", "s", "kjuannelajc", "valas", "lrrzzcl", "kjuannelajct", "snyyoc", "jwp", "vbum", "ezuunx", "bcntqiquagur", "vals", "cov", "dfdidcepshvjn",
+ "vvamlasl", "budnhym", "h", "fwxarvfm", "lrhwfosrz", "nkptnldw", "vjhse", "zzeb", "fubrpo", "fkla", "qjulm", "xpdcdxqia", "ucwxwdm", "jvidsfr", "exhc", "kbfbjx", "bcntqiquaur", "fwnoqjuoihe", "ezsruqxuinrpxc", "ec", "dzuzstuacinzbvsx",
+ "cxkqmxhn", "egpveohyvq", "bkcv", "dzuzsaizbx", "jftxssymi", "ycov", "zbvbeai", "ch", "atcrjs", "qjcemang", "tvjhsed", "vamlas", "bundnhym", "li", "wnulfhsbaj", "o", "ijhtpyhkrif", "nyoc", "ov", "ryceecupq", "wjcrjnszipc", "lrhtwfosrz",
+ "tbzngeqcz", "awfotfiqni", "azbw", "o", "gcfghusjsxiz", "uqvheuucdupu", "rypgy", "snpuykyobc", "ckhn", "kbfbcjxgnb", "xkeow", "jvids", "ubnsnusvgmqog", "endjbkjere", "fwarfm", "wvhb", "fwnoqtjuozihe", "jnwp", "awfotfmiyqni", "iv", "ryqceecupq",
+ "y", "qjuelm", "qyzxp", "vsbum", "dnh", "fam", "snpuyyobc", "wqobtmamvglu", "gjpw", "jcemang", "ukqso", "evhlfz", "nad", "bucwxwdm", "xkabfbbcjxgvnbq", "fwnoqjuozihe", "smvsitzdbutamn", "vec", "fos", "abbtcwbzrjs", "uyifxeyq", "kbfbjxgnb",
+ "nyyoc", "kcv", "fbundnhym", "tbzngpeqcz", "yekfvcjtgoiga", "rgjpw", "ezgvhsalfz", "yoc", "ezvhsalfz", "crxdlv", "chusjz", "fwxaxrvfm", "dzuzstuacinzbsx", "bwizqhc", "pdcdx", "dmnioxbmf", "zuunx", "oqyzxfp", "ezsruqxuinxc", "qjcaemang", "gcghusjsxiz", "nktnldw",
+ "qoyfqhytxzxfp", "bwqhc", "btkcvj", "qxpdcdxqia", "kijofhtxssyqmui", "rypy", "helmi", "zkrlexhxbwt", "qobtmamgu", "vhlfz", "rqjpmv", "yhy", "zzembhy", "rjpmv", "jhse", "fosz", "twol", "qbtamu", "nawxxbslyhucqxb", "dzzsaizbx", "dmnijgoxsbmf",
+ "ijhtpyhkr", "yp", "awfotfgmiyqni", "yctov", "hse", "azabw", "aryqceercaupqm", "fuzubrpoa", "ubnswnusvgmqog", "fafm", "i", "ezvhalfz", "aryxqceercpaupqm", "bwizqhcp", "pdcdxq", "wscxkqlqmxhn", "fuubrpo", "fwvxaxrvmfm", "abjbtcwbzrjas", "zx",
+ "rxmiirbxemog", "dfdeidcepshvvjqn", "az", "velc", "zkrlexnhxbwt", "nawxbslyhucqxb", "qjugelm", "ijhtpdyhkrif", "dmixbf", "gcfsghtusjsxiz", "juannlajc", "uqvheuucdupmuw", "rpqojpmgxv", "rpqojpmxv", "xppph", "kjuannellajct", "lrhfosrz", "dmnijoxsbmf",
+ "ckmxhn", "tvijhsed", "dzuzstuainzbsx", "exhvc", "tvwkxruev", "rxmiirbemog", "lhfosz", "fkyla", "tlwqgolksq", "velgcbpy", "bcqiqaur", "xkhfejow", "ezsuqunx", "dmnioxsbmf", "bqiqu", "ijhtpudyhkrif", "xpdcdxqi", "ckh", "nwxbslyhucqxb", "bbwkizqhcip", "pcdx",
+ "dzuzsuainzbsx", "xkbfbcjxgvnbq", "smvsbutm", "ezsruqxuinrxc", "smvlsitzdbutamdn", "am", "tvwkzxruev", "scxkqmxhn", "snpzuykyobc", "ekfvcjtgoiga", "fuzsubrpoa", "trtkgopofnykkrl", "oyqhytzxfp", "kbjx", "ifeyq", "vhl", "xkfeow", "ezgvhsialfz", "velgc", "hb",
+ "zbveai", "gcghusjxz", "twqgolkq", "btkcv", "ryqceercaupq", "bi", "vvamlas", "awfotfmiqni", "abbtcrjs", "jutkqesoh", "xkbfbcjxgvnb", "hli", "ryspgy", "endjjjbkjere", "mvsbum", "ckqmxhn", "ezsruqxunxc", "zzeby", "xhc", "ezvhlfz", "ezsruqxunx", "tzvwkmzxruev",
+ "hlmi", "kbbjx", "uqvhuuupu", "scxklqmxhn", "wqobtmamglu", "xpdcdxq", "qjugelym", "ifxeyq", "bcnqiquaur", "qobtmamglu", "xkabfbbcjxbgvnbq", "fuuzsubrpoa", "tvibjhsed", "oyqhyzxfp", "ijhpyhk", "c", "gcghusjxiz", "exhvoc", "awfotfini", "vhlz", "rtgopofykkrl",
+ "yh", "ypy", "azb", "bwiqhc", "fla", "dmnijgioxsbmf", "chusjxz", "jvjidsfr", "natddmc", "uifxeyq", "x", "tzvqwkmzxruev", "bucwxwdwm", "ckmhn", "zzemby", "rpmv", "bcntqiqulagurz", "fwoqjuoihe", "dzuzsainzbx", "zkrlehxbwt", "kv", "ucwxwm", "ubnswnusvgmdqog",
+ "wol", "endjjbkjere", "natyddmc", "vl", "ukqsoh", "ezuqunx", "exhvovc", "bqiqau", "bqiqaur", "zunx", "pc", "snuyyoc", "a", "lrhfosz", "kbfbjxgn", "rtgopofnykkrl", "hehszegkvse", "smvsbum", "ijhpyhkr", "ijftxssyqmui", "lyctomvis", "juanlajc", "jukqesoh",
+ "xptpph", "fwarvfm", "qbtmamu", "twqgolq", "aryqceercaupq", "qbtmamgu", "rtgopofykkr", "snpuyyoc", "qyzx", "fwvxaxrvfm", "juannelajc", "fwoquoihe", "nadmc", "jumttwxvx", "ijhtpyhkrf", "twqolq", "rpv", "hehszegkuvse", "ls", "tvjhse", "rxmiirbemg",
+ "dfdeidcepshvvjn", "dnhm", "egpeohyvq", "rgnjpw", "bbwkizqhcp", "nadc", "bcqiquaur", "xkhfeow", "smvstbutm", "ukqesoh", "yctomvi"}},
+ ans1048{15},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 1048------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans1048, q.para1048
+ fmt.Printf("【input】:%v 【output】:%v\n", p, longestStrChain(p.words))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/1048.Longest-String-Chain/README.md b/leetcode/1048.Longest-String-Chain/README.md
new file mode 100644
index 000000000..66c079516
--- /dev/null
+++ b/leetcode/1048.Longest-String-Chain/README.md
@@ -0,0 +1,96 @@
+# [1048. Longest String Chain](https://leetcode.com/problems/longest-string-chain/)
+
+
+## 题目
+
+Given a list of words, each word consists of English lowercase letters.
+
+Let's say `word1` is a predecessor of `word2` if and only if we can add exactly one letter anywhere in `word1` to make it equal to `word2`. For example, `"abc"` is a predecessor of `"abac"`.
+
+A *word chain* is a sequence of words `[word_1, word_2, ..., word_k]` with `k >= 1`, where `word_1` is a predecessor of `word_2`, `word_2` is a predecessor of `word_3`, and so on.
+
+Return the longest possible length of a word chain with words chosen from the given list of `words`.
+
+**Example 1:**
+
+```
+Input: words = ["a","b","ba","bca","bda","bdca"]
+Output: 4
+Explanation: One of the longest word chain is "a","ba","bda","bdca".
+```
+
+**Example 2:**
+
+```
+Input: words = ["xbc","pcxbcf","xb","cxbc","pcxbc"]
+Output: 5
+```
+
+**Constraints:**
+
+- `1 <= words.length <= 1000`
+- `1 <= words[i].length <= 16`
+- `words[i]` only consists of English lowercase letters.
+
+## 题目大意
+
+给出一个单词列表，其中每个单词都由小写英文字母组成。如果我们可以在 word1 的任何地方添加一个字母使其变成 word2，那么我们认为 word1 是 word2 的前身。例如，"abc" 是 "abac" 的前身。词链是单词 [word_1, word_2, ..., word_k] 组成的序列，k >= 1，其中 word_1 是 word_2 的前身，word_2 是 word_3 的前身，依此类推。从给定单词列表 words 中选择单词组成词链，返回词链的最长可能长度。
+
+## 解题思路
+
+- 从这题的数据规模上分析，可以猜出此题是 DFS 或者 DP 的题。简单暴力的方法是以每个字符串为链条的起点开始枚举之后的字符串，两两判断能否构成满足题意的前身字符串。这种做法包含很多重叠子问题，例如 a 和 b 能构成前身字符串，以 c 为起点的字符串链条可能用到 a 和 b，以 d 为起点的字符串链条也可能用到 a 和 b。顺其自然，考虑用 DP 的思路解题。
+- 先将 words 字符串数组排序，然后用 poss 数组记录下每种长度字符串的在排序数组中的起始下标。然后逆序往前递推。因为初始条件只能得到以最长字符串为起始的字符串链长度为 1 。每选择一个起始字符串，从它的长度 + 1 的每个字符串 j 开始比较，是否能为其前身字符串。如果能构成前身字符串，那么 dp[i] = max(dp[i], 1+dp[j])。最终递推到下标为 0 的字符串。最终输出整个递推过程中的最大长度即为所求。
+
+## 代码
+
+```go
+package leetcode
+
+import "sort"
+
+func longestStrChain(words []string) int {
+ sort.Slice(words, func(i, j int) bool { return len(words[i]) < len(words[j]) })
+ poss, res := make([]int, 16+2), 0
+ for i, w := range words {
+ if poss[len(w)] == 0 {
+ poss[len(w)] = i
+ }
+ }
+ dp := make([]int, len(words))
+ for i := len(words) - 1; i >= 0; i-- {
+ dp[i] = 1
+ for j := poss[len(words[i])+1]; j < len(words) && len(words[j]) == len(words[i])+1; j++ {
+ if isPredecessor(words[j], words[i]) {
+ dp[i] = max(dp[i], 1+dp[j])
+ }
+ }
+ res = max(res, dp[i])
+ }
+ return res
+}
+
+func max(a, b int) int {
+ if a > b {
+ return a
+ }
+ return b
+}
+
+func isPredecessor(long, short string) bool {
+ i, j := 0, 0
+ wasMismatch := false
+ for j < len(short) {
+ if long[i] != short[j] {
+ if wasMismatch {
+ return false
+ }
+ wasMismatch = true
+ i++
+ continue
+ }
+ i++
+ j++
+ }
+ return true
+}
+```
\ No newline at end of file
diff --git a/leetcode/1074.Number-of-Submatrices-That-Sum-to-Target/README.md b/leetcode/1074.Number-of-Submatrices-That-Sum-to-Target/README.md
index 641b694af..bf115a33c 100755
--- a/leetcode/1074.Number-of-Submatrices-That-Sum-to-Target/README.md
+++ b/leetcode/1074.Number-of-Submatrices-That-Sum-to-Target/README.md
@@ -11,6 +11,8 @@ Two submatrices `(x1, y1, x2, y2)` and `(x1', y1', x2', y2')` are different
**Example 1:**
+
+
Input: matrix = [[0,1,0],[1,1,1],[0,1,0]], target = 0
Output: 4
Explanation: The four 1x1 submatrices that only contain 0.
diff --git a/leetcode/1079.Letter-Tile-Possibilities/README.md b/leetcode/1079.Letter-Tile-Possibilities/README.md
index e8e12a5e5..4f789c73f 100755
--- a/leetcode/1079.Letter-Tile-Possibilities/README.md
+++ b/leetcode/1079.Letter-Tile-Possibilities/README.md
@@ -33,4 +33,4 @@ You have a set of `tiles`, where each tile has one letter `tiles[i]` printed
- 题目要求输出所有非空字母序列的数目。这一题是排列和组合的结合题目。组合是可以选择一个字母，二个字母，…… n 个字母。每个组合内是排列问题。比如选择 2 个字母，字母之间相互排序不同是影响最终结果的，不同的排列顺序是不同的解。
- 这道题目由于不需要输出所有解，所以解法可以优化，例如我们在递归计算解的时候，不需要真的遍历原字符串，只需要累加一些字母的频次就可以。当然如果要输出所有解，就需要真实遍历原字符串了(见解法二)。简单的做法是每次递归按照频次累加。因为每次增加一个字母一定是 26 个大写字母中的一个。这里需要注意的是，增加的只能是 26 个字母里面还能取出“机会”的字母，例如递归到到第 3 轮了，A 用完了，这个时候只能取频次还不为 0 的字母拼上去。
-
\ No newline at end of file
+
diff --git a/leetcode/1091.Shortest-Path-in-Binary-Matrix/1091. Shortest Path in Binary Matrix.go b/leetcode/1091.Shortest-Path-in-Binary-Matrix/1091. Shortest Path in Binary Matrix.go
new file mode 100644
index 000000000..544de00cd
--- /dev/null
+++ b/leetcode/1091.Shortest-Path-in-Binary-Matrix/1091. Shortest Path in Binary Matrix.go
@@ -0,0 +1,54 @@
+package leetcode
+
+var dir = [][]int{
+ {-1, -1},
+ {-1, 0},
+ {-1, 1},
+ {0, 1},
+ {0, -1},
+ {1, -1},
+ {1, 0},
+ {1, 1},
+}
+
+func shortestPathBinaryMatrix(grid [][]int) int {
+ visited := make([][]bool, 0)
+ for range make([]int, len(grid)) {
+ visited = append(visited, make([]bool, len(grid[0])))
+ }
+ dis := make([][]int, 0)
+ for range make([]int, len(grid)) {
+ dis = append(dis, make([]int, len(grid[0])))
+ }
+ if grid[0][0] == 1 {
+ return -1
+ }
+ if len(grid) == 1 && len(grid[0]) == 1 {
+ return 1
+ }
+
+ queue := []int{0}
+ visited[0][0], dis[0][0] = true, 1
+ for len(queue) > 0 {
+ cur := queue[0]
+ queue = queue[1:]
+ curx, cury := cur/len(grid[0]), cur%len(grid[0])
+ for d := 0; d < 8; d++ {
+ nextx := curx + dir[d][0]
+ nexty := cury + dir[d][1]
+ if isInBoard(grid, nextx, nexty) && !visited[nextx][nexty] && grid[nextx][nexty] == 0 {
+ queue = append(queue, nextx*len(grid[0])+nexty)
+ visited[nextx][nexty] = true
+ dis[nextx][nexty] = dis[curx][cury] + 1
+ if nextx == len(grid)-1 && nexty == len(grid[0])-1 {
+ return dis[nextx][nexty]
+ }
+ }
+ }
+ }
+ return -1
+}
+
+func isInBoard(board [][]int, x, y int) bool {
+ return x >= 0 && x < len(board) && y >= 0 && y < len(board[0])
+}
diff --git a/leetcode/1091.Shortest-Path-in-Binary-Matrix/1091. Shortest Path in Binary Matrix_test.go b/leetcode/1091.Shortest-Path-in-Binary-Matrix/1091. Shortest Path in Binary Matrix_test.go
new file mode 100644
index 000000000..a038921ac
--- /dev/null
+++ b/leetcode/1091.Shortest-Path-in-Binary-Matrix/1091. Shortest Path in Binary Matrix_test.go
@@ -0,0 +1,48 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question1091 struct {
+ para1091
+ ans1091
+}
+
+// para 是参数
+// one 代表第一个参数
+type para1091 struct {
+ grid [][]int
+}
+
+// ans 是答案
+// one 代表第一个答案
+type ans1091 struct {
+ one int
+}
+
+func Test_Problem1091(t *testing.T) {
+
+ qs := []question1091{
+
+ {
+ para1091{[][]int{{0, 1}, {1, 0}}},
+ ans1091{2},
+ },
+
+ {
+ para1091{[][]int{{0, 0, 0}, {1, 1, 0}, {1, 1, 0}}},
+ ans1091{4},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 1091------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans1091, q.para1091
+ fmt.Printf("【input】:%v 【output】:%v\n", p, shortestPathBinaryMatrix(p.grid))
+
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/1091.Shortest-Path-in-Binary-Matrix/README.md b/leetcode/1091.Shortest-Path-in-Binary-Matrix/README.md
new file mode 100644
index 000000000..c7397b78e
--- /dev/null
+++ b/leetcode/1091.Shortest-Path-in-Binary-Matrix/README.md
@@ -0,0 +1,114 @@
+# [1091. Shortest Path in Binary Matrix](https://leetcode.com/problems/shortest-path-in-binary-matrix/)
+
+
+## 题目
+
+In an N by N square grid, each cell is either empty (0) or blocked (1).
+
+A *clear path from top-left to bottom-right* has length `k` if and only if it is composed of cells `C_1, C_2, ..., C_k` such that:
+
+- Adjacent cells `C_i` and `C_{i+1}` are connected 8-directionally (ie., they are different and share an edge or corner)
+- `C_1` is at location `(0, 0)` (ie. has value `grid[0][0]`)
+- `C_k` is at location `(N-1, N-1)` (ie. has value `grid[N-1][N-1]`)
+- If `C_i` is located at `(r, c)`, then `grid[r][c]` is empty (ie. `grid[r][c] == 0`).
+
+Return the length of the shortest such clear path from top-left to bottom-right. If such a path does not exist, return -1.
+
+**Example 1:**
+
+```
+Input: [[0,1],[1,0]]
+Output: 2
+```
+
+
+
+
+
+**Example 2:**
+
+```
+Input: [[0,0,0],[1,1,0],[1,1,0]]
+Output: 4
+```
+
+
+
+
+
+**Note:**
+
+1. `1 <= grid.length == grid[0].length <= 100`
+2. `grid[r][c]` is `0` or `1`
+
+## 题目大意
+
+在一个 N × N 的方形网格中，每个单元格有两种状态：空（0）或者阻塞（1）。一条从左上角到右下角、长度为 k 的畅通路径，由满足下述条件的单元格 C_1, C_2, ..., C_k 组成：
+
+- 相邻单元格 C_i 和 C_{i+1} 在八个方向之一上连通（此时，C_i 和 C_{i+1} 不同且共享边或角）
+- C_1 位于 (0, 0)（即，值为 grid[0][0]）
+- C_k 位于 (N-1, N-1)（即，值为 grid[N-1][N-1]）
+- 如果 C_i 位于 (r, c)，则 grid[r][c] 为空（即，grid[r][c] == 0）
+
+返回这条从左上角到右下角的最短畅通路径的长度。如果不存在这样的路径，返回 -1 。
+
+## 解题思路
+
+- 这一题是简单的找最短路径。利用 BFS 从左上角逐步扩展到右下角，便可以很容易求解。注意每轮扩展需要考虑 8 个方向。
+
+## 代码
+
+```go
+var dir = [][]int{
+ {-1, -1},
+ {-1, 0},
+ {-1, 1},
+ {0, 1},
+ {0, -1},
+ {1, -1},
+ {1, 0},
+ {1, 1},
+}
+
+func shortestPathBinaryMatrix(grid [][]int) int {
+ visited := make([][]bool, 0)
+ for range make([]int, len(grid)) {
+ visited = append(visited, make([]bool, len(grid[0])))
+ }
+ dis := make([][]int, 0)
+ for range make([]int, len(grid)) {
+ dis = append(dis, make([]int, len(grid[0])))
+ }
+ if grid[0][0] == 1 {
+ return -1
+ }
+ if len(grid) == 1 && len(grid[0]) == 1 {
+ return 1
+ }
+
+ queue := []int{0}
+ visited[0][0], dis[0][0] = true, 1
+ for len(queue) > 0 {
+ cur := queue[0]
+ queue = queue[1:]
+ curx, cury := cur/len(grid[0]), cur%len(grid[0])
+ for d := 0; d < 8; d++ {
+ nextx := curx + dir[d][0]
+ nexty := cury + dir[d][1]
+ if isInBoard(grid, nextx, nexty) && !visited[nextx][nexty] && grid[nextx][nexty] == 0 {
+ queue = append(queue, nextx*len(grid[0])+nexty)
+ visited[nextx][nexty] = true
+ dis[nextx][nexty] = dis[curx][cury] + 1
+ if nextx == len(grid)-1 && nexty == len(grid[0])-1 {
+ return dis[nextx][nexty]
+ }
+ }
+ }
+ }
+ return -1
+}
+
+func isInBoard(board [][]int, x, y int) bool {
+ return x >= 0 && x < len(board) && y >= 0 && y < len(board[0])
+}
+```
\ No newline at end of file
diff --git a/leetcode/1104.Path-In-Zigzag-Labelled-Binary-Tree/1104.Path In Zigzag Labelled Binary Tree.go b/leetcode/1104.Path-In-Zigzag-Labelled-Binary-Tree/1104.Path In Zigzag Labelled Binary Tree.go
new file mode 100644
index 000000000..a7e2f580e
--- /dev/null
+++ b/leetcode/1104.Path-In-Zigzag-Labelled-Binary-Tree/1104.Path In Zigzag Labelled Binary Tree.go
@@ -0,0 +1,43 @@
+package leetcode
+
+func pathInZigZagTree(label int) []int {
+ level := getLevel(label)
+ ans := []int{label}
+ curIndex := label - (1 << level)
+ parent := 0
+ for level >= 1 {
+ parent, curIndex = getParent(curIndex, level)
+ ans = append(ans, parent)
+ level--
+ }
+ ans = reverse(ans)
+ return ans
+}
+
+func getLevel(label int) int {
+ level := 0
+ nums := 0
+ for {
+ nums += 1 << level
+ if nums >= label {
+ return level
+ }
+ level++
+ }
+}
+
+func getParent(index int, level int) (parent int, parentIndex int) {
+ parentIndex = 1<<(level-1) - 1 + (index/2)*(-1)
+ parent = 1<<(level-1) + parentIndex
+ return
+}
+
+func reverse(nums []int) []int {
+ left, right := 0, len(nums)-1
+ for left < right {
+ nums[left], nums[right] = nums[right], nums[left]
+ left++
+ right--
+ }
+ return nums
+}
diff --git a/leetcode/1104.Path-In-Zigzag-Labelled-Binary-Tree/1104.Path In Zigzag Labelled Binary Tree_test.go b/leetcode/1104.Path-In-Zigzag-Labelled-Binary-Tree/1104.Path In Zigzag Labelled Binary Tree_test.go
new file mode 100644
index 000000000..5bdd0cf0d
--- /dev/null
+++ b/leetcode/1104.Path-In-Zigzag-Labelled-Binary-Tree/1104.Path In Zigzag Labelled Binary Tree_test.go
@@ -0,0 +1,45 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question1104 struct {
+ para1104
+ ans1104
+}
+
+// para 是参数
+type para1104 struct {
+ label int
+}
+
+// ans 是答案
+type ans1104 struct {
+ ans []int
+}
+
+func Test_Problem1104(t *testing.T) {
+
+ qs := []question1104{
+
+ {
+ para1104{14},
+ ans1104{[]int{1, 3, 4, 14}},
+ },
+
+ {
+ para1104{26},
+ ans1104{[]int{1, 2, 6, 10, 26}},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 1104------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans1104, q.para1104
+ fmt.Printf("【input】:%v 【output】:%v \n", p, pathInZigZagTree(p.label))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/1104.Path-In-Zigzag-Labelled-Binary-Tree/README.md b/leetcode/1104.Path-In-Zigzag-Labelled-Binary-Tree/README.md
new file mode 100644
index 000000000..bdca7d7d0
--- /dev/null
+++ b/leetcode/1104.Path-In-Zigzag-Labelled-Binary-Tree/README.md
@@ -0,0 +1,92 @@
+# [1104. Path In Zigzag Labelled Binary Tree](https://leetcode.com/problems/path-in-zigzag-labelled-binary-tree/)
+
+
+## 题目
+
+In an infinite binary tree where every node has two children, the nodes are labelled in row order.
+
+In the odd numbered rows (ie., the first, third, fifth,...), the labelling is left to right, while in the even numbered rows (second, fourth, sixth,...), the labelling is right to left.
+
+
+
+Given the `label` of a node in this tree, return the labels in the path from the root of the tree to the node with that `label`.
+
+**Example 1:**
+
+```
+Input: label = 14
+Output: [1,3,4,14]
+
+```
+
+**Example 2:**
+
+```
+Input: label = 26
+Output: [1,2,6,10,26]
+
+```
+
+**Constraints:**
+
+- `1 <= label <= 10^6`
+
+## 题目大意
+
+在一棵无限的二叉树上，每个节点都有两个子节点，树中的节点 逐行 依次按 “之” 字形进行标记。如下图所示，在奇数行（即，第一行、第三行、第五行……）中，按从左到右的顺序进行标记；而偶数行（即，第二行、第四行、第六行……）中，按从右到左的顺序进行标记。
+
+给你树上某一个节点的标号 label，请你返回从根节点到该标号为 label 节点的路径，该路径是由途经的节点标号所组成的。
+
+## 解题思路
+
+- 计算出 label 所在的 level 和 index。
+- 根据 index 和 level 计算出父节点的 index 和 value。
+- level 减一，循环计算出对应的父节点直到根节点。
+
+## 代码
+
+```go
+package leetcode
+
+func pathInZigZagTree(label int) []int {
+ level := getLevel(label)
+ ans := []int{label}
+ curIndex := label - (1 << level)
+ parent := 0
+ for level >= 1 {
+ parent, curIndex = getParent(curIndex, level)
+ ans = append(ans, parent)
+ level--
+ }
+ ans = reverse(ans)
+ return ans
+}
+
+func getLevel(label int) int {
+ level := 0
+ nums := 0
+ for {
+ nums += 1 << level
+ if nums >= label {
+ return level
+ }
+ level++
+ }
+}
+
+func getParent(index int, level int) (parent int, parentIndex int) {
+ parentIndex = 1<<(level-1) - 1 + (index/2)*(-1)
+ parent = 1<<(level-1) + parentIndex
+ return
+}
+
+func reverse(nums []int) []int {
+ left, right := 0, len(nums)-1
+ for left < right {
+ nums[left], nums[right] = nums[right], nums[left]
+ left++
+ right--
+ }
+ return nums
+}
+```
\ No newline at end of file
diff --git a/leetcode/1143.Longest-Common-Subsequence/1143. Longest Common Subsequence.go b/leetcode/1143.Longest-Common-Subsequence/1143. Longest Common Subsequence.go
new file mode 100644
index 000000000..f81c73c9b
--- /dev/null
+++ b/leetcode/1143.Longest-Common-Subsequence/1143. Longest Common Subsequence.go
@@ -0,0 +1,28 @@
+package leetcode
+
+func longestCommonSubsequence(text1 string, text2 string) int {
+ if len(text1) == 0 || len(text2) == 0 {
+ return 0
+ }
+ dp := make([][]int, len(text1)+1)
+ for i := range dp {
+ dp[i] = make([]int, len(text2)+1)
+ }
+ for i := 1; i < len(text1)+1; i++ {
+ for j := 1; j < len(text2)+1; j++ {
+ if text1[i-1] == text2[j-1] {
+ dp[i][j] = dp[i-1][j-1] + 1
+ } else {
+ dp[i][j] = max(dp[i][j-1], dp[i-1][j])
+ }
+ }
+ }
+ return dp[len(text1)][len(text2)]
+}
+
+func max(a, b int) int {
+ if a > b {
+ return a
+ }
+ return b
+}
diff --git a/leetcode/1143.Longest-Common-Subsequence/1143. Longest Common Subsequence_test.go b/leetcode/1143.Longest-Common-Subsequence/1143. Longest Common Subsequence_test.go
new file mode 100644
index 000000000..ced017063
--- /dev/null
+++ b/leetcode/1143.Longest-Common-Subsequence/1143. Longest Common Subsequence_test.go
@@ -0,0 +1,53 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question1143 struct {
+ para1143
+ ans1143
+}
+
+// para 是参数
+// one 代表第一个参数
+type para1143 struct {
+ text1 string
+ text2 string
+}
+
+// ans 是答案
+// one 代表第一个答案
+type ans1143 struct {
+ one int
+}
+
+func Test_Problem1143(t *testing.T) {
+
+ qs := []question1143{
+
+ {
+ para1143{"abcde", "ace"},
+ ans1143{3},
+ },
+
+ {
+ para1143{"abc", "abc"},
+ ans1143{3},
+ },
+
+ {
+ para1143{"abc", "def"},
+ ans1143{0},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 1143------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans1143, q.para1143
+ fmt.Printf("【input】:%v 【output】:%v\n", p, longestCommonSubsequence(p.text1, p.text2))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/1143.Longest-Common-Subsequence/README.md b/leetcode/1143.Longest-Common-Subsequence/README.md
new file mode 100644
index 000000000..78367ca19
--- /dev/null
+++ b/leetcode/1143.Longest-Common-Subsequence/README.md
@@ -0,0 +1,86 @@
+# [1143. Longest Common Subsequence](https://leetcode.com/problems/longest-common-subsequence/)
+
+## 题目
+
+Given two strings `text1` and `text2`, return *the length of their longest **common subsequence**.* If there is no **common subsequence**, return `0`.
+
+A **subsequence** of a string is a new string generated from the original string with some characters (can be none) deleted without changing the relative order of the remaining characters.
+
+- For example, `"ace"` is a subsequence of `"abcde"`.
+
+A **common subsequence** of two strings is a subsequence that is common to both strings.
+
+**Example 1:**
+
+```
+Input: text1 = "abcde", text2 = "ace"
+Output: 3
+Explanation: The longest common subsequence is "ace" and its length is 3.
+```
+
+**Example 2:**
+
+```
+Input: text1 = "abc", text2 = "abc"
+Output: 3
+Explanation: The longest common subsequence is "abc" and its length is 3.
+```
+
+**Example 3:**
+
+```
+Input: text1 = "abc", text2 = "def"
+Output: 0
+Explanation: There is no such common subsequence, so the result is 0.
+```
+
+**Constraints:**
+
+- `1 <= text1.length, text2.length <= 1000`
+- `text1` and `text2` consist of only lowercase English characters.
+
+## 题目大意
+
+给定两个字符串 text1 和 text2，返回这两个字符串的最长 公共子序列 的长度。如果不存在 公共子序列 ，返回 0 。一个字符串的 子序列 是指这样一个新的字符串：它是由原字符串在不改变字符的相对顺序的情况下删除某些字符（也可以不删除任何字符）后组成的新字符串。例如，"ace" 是 "abcde" 的子序列，但 "aec" 不是 "abcde" 的子序列。两个字符串的 公共子序列 是这两个字符串所共同拥有的子序列。
+
+## 解题思路
+
+- 这一题是经典的最长公共子序列的问题。解题思路是二维动态规划。假设字符串 `text1` 和 `text2` 的长度分别为 `m` 和 `n`，创建 `m+1` 行 `n+1` 列的二维数组 `dp`，定义 `dp[i][j]` 表示长度为 i 的 `text1[0:i-1]` 和长度为 j 的 `text2[0:j-1]` 的最长公共子序列的长度。先考虑边界条件。当 `i = 0` 时，`text1[]` 为空字符串，它与任何字符串的最长公共子序列的长度都是 `0`，所以 `dp[0][j] = 0`。同理当 `j = 0` 时，`text2[]` 为空字符串，它与任何字符串的最长公共子序列的长度都是 `0`，所以 `dp[i][0] = 0`。由于二维数组的大小特意增加了 `1`，即 `m+1` 和 `n+1`，并且默认值是 `0`，所以不需要再初始化赋值了。
+- 当 `text1[i−1] = text2[j−1]` 时，将这两个相同的字符称为公共字符，考虑 `text1[0:i−1]` 和 `text2[0:j−1]` 的最长公共子序列，再增加一个字符（即公共字符）即可得到 `text1[0:i]` 和 `text2[0:j]` 的最长公共子序列，所以 `dp[i][j]=dp[i−1][j−1]+1`。当 `text1[i−1] != text2[j−1]` 时，最长公共子序列一定在 `text[0:i-1], text2[0:j]` 和 `text[0:i], text2[0:j-1]` 中取得。即 `dp[i][j] = max(dp[i-1][j], dp[i][j-1])`。所以状态转移方程如下：
+
+ $$dp[i][j] = \left\{\begin{matrix}dp[i-1][j-1]+1 &,text1[i-1]=text2[j-1]\\max(dp[i-1][j],dp[i][j-1])&,text1[i-1]\neq text2[j-1]\end{matrix}\right.$$
+
+- 最终结果存储在 `dp[len(text1)][len(text2)]` 中。时间复杂度 `O(mn)`，空间复杂度 `O(mn)`，其中 `m` 和 `n` 分别是 `text1` 和 `text2` 的长度。
+
+## 代码
+
+```go
+package leetcode
+
+func longestCommonSubsequence(text1 string, text2 string) int {
+ if len(text1) == 0 || len(text2) == 0 {
+ return 0
+ }
+ dp := make([][]int, len(text1)+1)
+ for i := range dp {
+ dp[i] = make([]int, len(text2)+1)
+ }
+ for i := 1; i < len(text1)+1; i++ {
+ for j := 1; j < len(text2)+1; j++ {
+ if text1[i-1] == text2[j-1] {
+ dp[i][j] = dp[i-1][j-1] + 1
+ } else {
+ dp[i][j] = max(dp[i][j-1], dp[i-1][j])
+ }
+ }
+ }
+ return dp[len(text1)][len(text2)]
+}
+
+func max(a, b int) int {
+ if a > b {
+ return a
+ }
+ return b
+}
+```
\ No newline at end of file
diff --git a/leetcode/1178.Number-of-Valid-Words-for-Each-Puzzle/1178. Number of Valid Words for Each Puzzle.go b/leetcode/1178.Number-of-Valid-Words-for-Each-Puzzle/1178. Number of Valid Words for Each Puzzle.go
new file mode 100644
index 000000000..8acbe9ebc
--- /dev/null
+++ b/leetcode/1178.Number-of-Valid-Words-for-Each-Puzzle/1178. Number of Valid Words for Each Puzzle.go
@@ -0,0 +1,45 @@
+package leetcode
+
+/*
+匹配跟单词中的字母顺序，字母个数都无关，可以用 bitmap 压缩
+ 1. 记录 word 中 利用 map 记录各种 bit 标示的个数
+ 2. puzzles 中各个字母都不相同! 记录 bitmap，然后搜索子空间中各种 bit 标识的个数的和
+ 因为 puzzles 长度最长是7，所以搜索空间 2^7
+*/
+func findNumOfValidWords(words []string, puzzles []string) []int {
+ wordBitStatusMap, res := make(map[uint32]int, 0), []int{}
+ for _, w := range words {
+ wordBitStatusMap[toBitMap([]byte(w))]++
+ }
+ for _, p := range puzzles {
+ var bitMap uint32
+ var totalNum int
+ bitMap |= (1 << (p[0] - 'a')) //work 中要包含 p 的第一个字母 所以这个 bit 位上必须是 1
+ findNum([]byte(p)[1:], bitMap, &totalNum, wordBitStatusMap)
+ res = append(res, totalNum)
+ }
+ return res
+}
+
+func toBitMap(word []byte) uint32 {
+ var res uint32
+ for _, b := range word {
+ res |= (1 << (b - 'a'))
+ }
+ return res
+}
+
+// 利用 dfs 搜索 puzzles 的子空间
+func findNum(puzzles []byte, bitMap uint32, totalNum *int, m map[uint32]int) {
+ if len(puzzles) == 0 {
+ *totalNum = *totalNum + m[bitMap]
+ return
+ }
+ //不包含 puzzles[0],即 puzzles[0] 对应 bit 是 0
+ findNum(puzzles[1:], bitMap, totalNum, m)
+ //包含 puzzles[0],即 puzzles[0] 对应 bit 是 1
+ bitMap |= (1 << (puzzles[0] - 'a'))
+ findNum(puzzles[1:], bitMap, totalNum, m)
+ bitMap ^= (1 << (puzzles[0] - 'a')) //异或 清零
+ return
+}
diff --git a/leetcode/1178.Number-of-Valid-Words-for-Each-Puzzle/1178. Number of Valid Words for Each Puzzle_test.go b/leetcode/1178.Number-of-Valid-Words-for-Each-Puzzle/1178. Number of Valid Words for Each Puzzle_test.go
new file mode 100644
index 000000000..5d87ba685
--- /dev/null
+++ b/leetcode/1178.Number-of-Valid-Words-for-Each-Puzzle/1178. Number of Valid Words for Each Puzzle_test.go
@@ -0,0 +1,32 @@
+package leetcode
+
+import (
+ "reflect"
+ "testing"
+)
+
+func Test_findNumOfValidWords(t *testing.T) {
+
+ words1 := []string{"aaaa", "asas", "able", "ability", "actt", "actor", "access"}
+ puzzles1 := []string{"aboveyz", "abrodyz", "abslute", "absoryz", "actresz", "gaswxyz"}
+
+ type args struct {
+ words []string
+ puzzles []string
+ }
+ tests := []struct {
+ name string
+ args args
+ want []int
+ }{
+ // TODO: Add test cases.
+ {"1", args{words: words1, puzzles: puzzles1}, []int{1, 1, 3, 2, 4, 0}},
+ }
+ for _, tt := range tests {
+ t.Run(tt.name, func(t *testing.T) {
+ if got := findNumOfValidWords(tt.args.words, tt.args.puzzles); !reflect.DeepEqual(got, tt.want) {
+ t.Errorf("findNumOfValidWords() = %v, want %v", got, tt.want)
+ }
+ })
+ }
+}
diff --git a/leetcode/1178.Number-of-Valid-Words-for-Each-Puzzle/README.md b/leetcode/1178.Number-of-Valid-Words-for-Each-Puzzle/README.md
new file mode 100644
index 000000000..40d69ec65
--- /dev/null
+++ b/leetcode/1178.Number-of-Valid-Words-for-Each-Puzzle/README.md
@@ -0,0 +1,119 @@
+# [1178. Number of Valid Words for Each Puzzle](https://leetcode.com/problems/number-of-valid-words-for-each-puzzle/)
+
+
+## 题目
+
+With respect to a given `puzzle` string, a `word` is *valid* if both the following conditions are satisfied:
+
+- `word` contains the first letter of `puzzle`.
+- For each letter in `word`, that letter is in `puzzle`.For example, if the puzzle is "abcdefg", then valid words are "faced", "cabbage", and "baggage"; while invalid words are "beefed" (doesn't include "a") and "based" (includes "s" which isn't in the puzzle).
+
+Return an array `answer`, where `answer[i]` is the number of words in the given word list `words` that are valid with respect to the puzzle `puzzles[i]`.
+
+**Example :**
+
+```
+Input:
+words = ["aaaa","asas","able","ability","actt","actor","access"],
+puzzles = ["aboveyz","abrodyz","abslute","absoryz","actresz","gaswxyz"]
+Output: [1,1,3,2,4,0]
+Explanation:
+1 valid word for "aboveyz" : "aaaa"
+1 valid word for "abrodyz" : "aaaa"
+3 valid words for "abslute" : "aaaa", "asas", "able"
+2 valid words for "absoryz" : "aaaa", "asas"
+4 valid words for "actresz" : "aaaa", "asas", "actt", "access"
+There're no valid words for "gaswxyz" cause none of the words in the list contains letter 'g'.
+
+```
+
+**Constraints:**
+
+- `1 <= words.length <= 10^5`
+- `4 <= words[i].length <= 50`
+- `1 <= puzzles.length <= 10^4`
+- `puzzles[i].length == 7`
+- `words[i][j]`, `puzzles[i][j]` are English lowercase letters.
+- Each `puzzles[i]` doesn't contain repeated characters.
+
+## 题目大意
+
+外国友人仿照中国字谜设计了一个英文版猜字谜小游戏，请你来猜猜看吧。
+
+字谜的迷面 puzzle 按字符串形式给出，如果一个单词 word 符合下面两个条件，那么它就可以算作谜底：
+
+- 单词 word 中包含谜面 puzzle 的第一个字母。
+- 单词 word 中的每一个字母都可以在谜面 puzzle 中找到。
+例如，如果字谜的谜面是 "abcdefg"，那么可以作为谜底的单词有 "faced", "cabbage", 和 "baggage"；而 "beefed"（不含字母 "a"）以及 "based"（其中的 "s" 没有出现在谜面中）都不能作为谜底。
+
+返回一个答案数组 answer，数组中的每个元素 answer[i] 是在给出的单词列表 words 中可以作为字谜迷面 puzzles[i] 所对应的谜底的单词数目。
+
+提示：
+
+- 1 <= words.length <= 10^5
+- 4 <= words[i].length <= 50
+- 1 <= puzzles.length <= 10^4
+- puzzles[i].length == 7
+- words[i][j], puzzles[i][j] 都是小写英文字母。
+- 每个 puzzles[i] 所包含的字符都不重复。
+
+## 解题思路
+
+- 首先题目中两个限制条件非常关键：**puzzles[i].length == 7**，**每个 puzzles[i] 所包含的字符都不重复**。也就是说穷举每个puzzle的子串的搜索空间就是2^7=128，而且不用考虑去重问题。
+- 因为谜底的判断只跟字符是否出现有关，跟字符的个数无关，另外都是小写的英文字母，所以可以用 `bitmap` 来表示单词(word)。
+- 利用 `map` 记录不同状态的单词(word)的个数。
+- 根据题意，如果某个单词(word)是某个字谜(puzzle)的谜底，那么 `word` 的 `bitmap` 肯定对应于 `puzzle` 某个子串的 `bitmap` 表示，且 `bitmap` 中包含 `puzzle` 的第一个字母的 `bit` 占用。
+- 问题就转换为：求每一个 `puzzle` 的每一个子串，然后求和这个子串具有相同 `bitmap` 表示且 `word` 中包含 `puzzle` 的第一个字母的 `word` 的个数。
+
+## 代码
+
+```go
+
+package leetcode
+
+/*
+ 匹配跟单词中的字母顺序，字母个数都无关，可以用 bitmap 压缩
+ 1. 记录 word 中 利用 map 记录各种 bit 标示的个数
+ 2. puzzles 中各个字母都不相同! 记录 bitmap，然后搜索子空间中各种 bit 标识的个数的和
+ 因为 puzzles 长度最长是7，所以搜索空间 2^7
+*/
+func findNumOfValidWords(words []string, puzzles []string) []int {
+ wordBitStatusMap, res := make(map[uint32]int, 0), []int{}
+ for _, w := range words {
+ wordBitStatusMap[toBitMap([]byte(w))]++
+ }
+ for _, p := range puzzles {
+ var bitMap uint32
+ var totalNum int
+ bitMap |= (1 << (p[0] - 'a')) //work 中要包含 p 的第一个字母 所以这个 bit 位上必须是 1
+ findNum([]byte(p)[1:], bitMap, &totalNum, wordBitStatusMap)
+ res = append(res, totalNum)
+ }
+ return res
+}
+
+func toBitMap(word []byte) uint32 {
+ var res uint32
+ for _, b := range word {
+ res |= (1 << (b - 'a'))
+ }
+ return res
+}
+
+//利用 dfs 搜索 puzzles 的子空间
+func findNum(puzzles []byte, bitMap uint32, totalNum *int, m map[uint32]int) {
+ if len(puzzles) == 0 {
+ *totalNum = *totalNum + m[bitMap]
+ return
+ }
+ //不包含 puzzles[0],即 puzzles[0] 对应 bit 是 0
+ findNum(puzzles[1:], bitMap, totalNum, m)
+ //包含 puzzles[0],即 puzzles[0] 对应 bit 是 1
+ bitMap |= (1 << (puzzles[0] - 'a'))
+ findNum(puzzles[1:], bitMap, totalNum, m)
+ bitMap ^= (1 << (puzzles[0] - 'a')) //异或 清零
+ return
+}
+
+
+```
\ No newline at end of file
diff --git a/leetcode/1190.Reverse-Substrings-Between-Each-Pair-of-Parentheses/1190. Reverse Substrings Between Each Pair of Parentheses.go b/leetcode/1190.Reverse-Substrings-Between-Each-Pair-of-Parentheses/1190. Reverse Substrings Between Each Pair of Parentheses.go
new file mode 100644
index 000000000..fe76ab529
--- /dev/null
+++ b/leetcode/1190.Reverse-Substrings-Between-Each-Pair-of-Parentheses/1190. Reverse Substrings Between Each Pair of Parentheses.go
@@ -0,0 +1,24 @@
+package leetcode
+
+func reverseParentheses(s string) string {
+ pair, stack := make([]int, len(s)), []int{}
+ for i, b := range s {
+ if b == '(' {
+ stack = append(stack, i)
+ } else if b == ')' {
+ j := stack[len(stack)-1]
+ stack = stack[:len(stack)-1]
+ pair[i], pair[j] = j, i
+ }
+ }
+ res := []byte{}
+ for i, step := 0, 1; i < len(s); i += step {
+ if s[i] == '(' || s[i] == ')' {
+ i = pair[i]
+ step = -step
+ } else {
+ res = append(res, s[i])
+ }
+ }
+ return string(res)
+}
diff --git a/leetcode/1190.Reverse-Substrings-Between-Each-Pair-of-Parentheses/1190. Reverse Substrings Between Each Pair of Parentheses_test.go b/leetcode/1190.Reverse-Substrings-Between-Each-Pair-of-Parentheses/1190. Reverse Substrings Between Each Pair of Parentheses_test.go
new file mode 100644
index 000000000..cf5c51b1c
--- /dev/null
+++ b/leetcode/1190.Reverse-Substrings-Between-Each-Pair-of-Parentheses/1190. Reverse Substrings Between Each Pair of Parentheses_test.go
@@ -0,0 +1,57 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question1190 struct {
+ para1190
+ ans1190
+}
+
+// para 是参数
+// one 代表第一个参数
+type para1190 struct {
+ s string
+}
+
+// ans 是答案
+// one 代表第一个答案
+type ans1190 struct {
+ one string
+}
+
+func Test_Problem1190(t *testing.T) {
+
+ qs := []question1190{
+
+ {
+ para1190{"(abcd)"},
+ ans1190{"dcba"},
+ },
+
+ {
+ para1190{"(u(love)i)"},
+ ans1190{"iloveu"},
+ },
+
+ {
+ para1190{"(ed(et(oc))el)"},
+ ans1190{"leetcode"},
+ },
+
+ {
+ para1190{"a(bcdefghijkl(mno)p)q"},
+ ans1190{"apmnolkjihgfedcbq"},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 1190------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans1190, q.para1190
+ fmt.Printf("【input】:%v 【output】:%v\n", p, reverseParentheses(p.s))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/1190.Reverse-Substrings-Between-Each-Pair-of-Parentheses/README.md b/leetcode/1190.Reverse-Substrings-Between-Each-Pair-of-Parentheses/README.md
new file mode 100644
index 000000000..22bc27edd
--- /dev/null
+++ b/leetcode/1190.Reverse-Substrings-Between-Each-Pair-of-Parentheses/README.md
@@ -0,0 +1,84 @@
+# [1190. Reverse Substrings Between Each Pair of Parentheses](https://leetcode.com/problems/reverse-substrings-between-each-pair-of-parentheses/)
+
+
+## 题目
+
+You are given a string `s` that consists of lower case English letters and brackets.
+
+Reverse the strings in each pair of matching parentheses, starting from the innermost one.
+
+Your result should **not** contain any brackets.
+
+**Example 1:**
+
+```
+Input: s = "(abcd)"
+Output: "dcba"
+```
+
+**Example 2:**
+
+```
+Input: s = "(u(love)i)"
+Output: "iloveu"
+Explanation: The substring "love" is reversed first, then the whole string is reversed.
+```
+
+**Example 3:**
+
+```
+Input: s = "(ed(et(oc))el)"
+Output: "leetcode"
+Explanation: First, we reverse the substring "oc", then "etco", and finally, the whole string.
+```
+
+**Example 4:**
+
+```
+Input: s = "a(bcdefghijkl(mno)p)q"
+Output: "apmnolkjihgfedcbq"
+```
+
+**Constraints:**
+
+- `0 <= s.length <= 2000`
+- `s` only contains lower case English characters and parentheses.
+- It's guaranteed that all parentheses are balanced.
+
+## 题目大意
+
+给出一个字符串 s（仅含有小写英文字母和括号）。请你按照从括号内到外的顺序，逐层反转每对匹配括号中的字符串，并返回最终的结果。注意，您的结果中 不应 包含任何括号。
+
+## 解题思路
+
+- 本题最容易想到的思路是利用栈将每对括号里面的字符串入栈，当遇到 ")" 括号时出栈并逆序。由于用到了栈的数据结构，多层括号嵌套的问题也不用担心。这种边入栈出栈，逆序字符串的方法，时间复杂度是 O(n^2)，有没有可能进一步降低时间复杂度呢？
+- 上述解法中，存在重复遍历的情况。扫描原字符串的时候，入栈出栈已经扫描了一次，在 ")" 括号出栈时，逆序又会扫一遍已经入栈的字符串。这部分重复遍历的过程可以优化掉。第一次循环先标记出逆序区间。例如遇到 "(" 的时候，入栈并记录下它的下标，当遇到 ")" 的时候，意味着这一对括号匹配上了，所以将 ")" 的下标和之前入栈 "(" 的下标交换。此次遍历将逆序区间标记出来了。再遍历一次，根据逆序区间逆序字符串。不在逆序区间的字符串正常 append。如果在逆序区间内的，逆序遍历，添加到最终结果字符串中。这样做，时间复杂度仅为 O(n)。具体实现见下面代码。
+
+## 代码
+
+```go
+package leetcode
+
+func reverseParentheses(s string) string {
+ pair, stack := make([]int, len(s)), []int{}
+ for i, b := range s {
+ if b == '(' {
+ stack = append(stack, i)
+ } else if b == ')' {
+ j := stack[len(stack)-1]
+ stack = stack[:len(stack)-1]
+ pair[i], pair[j] = j, i
+ }
+ }
+ res := []byte{}
+ for i, step := 0, 1; i < len(s); i += step {
+ if s[i] == '(' || s[i] == ')' {
+ i = pair[i]
+ step = -step
+ } else {
+ res = append(res, s[i])
+ }
+ }
+ return string(res)
+}
+```
\ No newline at end of file
diff --git a/leetcode/1203.Sort-Items-by-Groups-Respecting-Dependencies/1203. Sort Items by Groups Respecting Dependencies.go b/leetcode/1203.Sort-Items-by-Groups-Respecting-Dependencies/1203. Sort Items by Groups Respecting Dependencies.go
new file mode 100644
index 000000000..07a715b86
--- /dev/null
+++ b/leetcode/1203.Sort-Items-by-Groups-Respecting-Dependencies/1203. Sort Items by Groups Respecting Dependencies.go
@@ -0,0 +1,123 @@
+package leetcode
+
+// 解法一 拓扑排序版的 DFS
+func sortItems(n int, m int, group []int, beforeItems [][]int) []int {
+ groups, inDegrees := make([][]int, n+m), make([]int, n+m)
+ for i, g := range group {
+ if g > -1 {
+ g += n
+ groups[g] = append(groups[g], i)
+ inDegrees[i]++
+ }
+ }
+ for i, ancestors := range beforeItems {
+ gi := group[i]
+ if gi == -1 {
+ gi = i
+ } else {
+ gi += n
+ }
+ for _, ancestor := range ancestors {
+ ga := group[ancestor]
+ if ga == -1 {
+ ga = ancestor
+ } else {
+ ga += n
+ }
+ if gi == ga {
+ groups[ancestor] = append(groups[ancestor], i)
+ inDegrees[i]++
+ } else {
+ groups[ga] = append(groups[ga], gi)
+ inDegrees[gi]++
+ }
+ }
+ }
+ res := []int{}
+ for i, d := range inDegrees {
+ if d == 0 {
+ sortItemsDFS(i, n, &res, &inDegrees, &groups)
+ }
+ }
+ if len(res) != n {
+ return nil
+ }
+ return res
+}
+
+func sortItemsDFS(i, n int, res, inDegrees *[]int, groups *[][]int) {
+ if i < n {
+ *res = append(*res, i)
+ }
+ (*inDegrees)[i] = -1
+ for _, ch := range (*groups)[i] {
+ if (*inDegrees)[ch]--; (*inDegrees)[ch] == 0 {
+ sortItemsDFS(ch, n, res, inDegrees, groups)
+ }
+ }
+}
+
+// 解法二 二维拓扑排序 时间复杂度 O(m+n)，空间复杂度 O(m+n)
+func sortItems1(n int, m int, group []int, beforeItems [][]int) []int {
+ groupItems, res := map[int][]int{}, []int{}
+ for i := 0; i < len(group); i++ {
+ if group[i] == -1 {
+ group[i] = m + i
+ }
+ groupItems[group[i]] = append(groupItems[group[i]], i)
+ }
+ groupGraph, groupDegree, itemGraph, itemDegree := make([][]int, m+n), make([]int, m+n), make([][]int, n), make([]int, n)
+ for i := 0; i < len(beforeItems); i++ {
+ for j := 0; j < len(beforeItems[i]); j++ {
+ if group[beforeItems[i][j]] != group[i] {
+ // 不同组项目，确定组间依赖关系
+ groupGraph[group[beforeItems[i][j]]] = append(groupGraph[group[beforeItems[i][j]]], group[i])
+ groupDegree[group[i]]++
+ } else {
+ // 同组项目，确定组内依赖关系
+ itemGraph[beforeItems[i][j]] = append(itemGraph[beforeItems[i][j]], i)
+ itemDegree[i]++
+ }
+ }
+ }
+ items := []int{}
+ for i := 0; i < m+n; i++ {
+ items = append(items, i)
+ }
+ // 组间拓扑
+ groupOrders := topSort(groupGraph, groupDegree, items)
+ if len(groupOrders) < len(items) {
+ return nil
+ }
+ for i := 0; i < len(groupOrders); i++ {
+ items := groupItems[groupOrders[i]]
+ // 组内拓扑
+ orders := topSort(itemGraph, itemDegree, items)
+ if len(orders) < len(items) {
+ return nil
+ }
+ res = append(res, orders...)
+ }
+ return res
+}
+
+func topSort(graph [][]int, deg, items []int) (orders []int) {
+ q := []int{}
+ for _, i := range items {
+ if deg[i] == 0 {
+ q = append(q, i)
+ }
+ }
+ for len(q) > 0 {
+ from := q[0]
+ q = q[1:]
+ orders = append(orders, from)
+ for _, to := range graph[from] {
+ deg[to]--
+ if deg[to] == 0 {
+ q = append(q, to)
+ }
+ }
+ }
+ return
+}
diff --git a/leetcode/1203.Sort-Items-by-Groups-Respecting-Dependencies/1203. Sort Items by Groups Respecting Dependencies_test.go b/leetcode/1203.Sort-Items-by-Groups-Respecting-Dependencies/1203. Sort Items by Groups Respecting Dependencies_test.go
new file mode 100644
index 000000000..6abb3b54c
--- /dev/null
+++ b/leetcode/1203.Sort-Items-by-Groups-Respecting-Dependencies/1203. Sort Items by Groups Respecting Dependencies_test.go
@@ -0,0 +1,50 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question1203 struct {
+ para1203
+ ans1203
+}
+
+// para 是参数
+// one 代表第一个参数
+type para1203 struct {
+ n int
+ m int
+ group []int
+ beforeItems [][]int
+}
+
+// ans 是答案
+// one 代表第一个答案
+type ans1203 struct {
+ one []int
+}
+
+func Test_Problem1203(t *testing.T) {
+
+ qs := []question1203{
+
+ {
+ para1203{8, 2, []int{-1, -1, 1, 0, 0, 1, 0, -1}, [][]int{{}, {6}, {5}, {6}, {3, 6}, {}, {}, {}}},
+ ans1203{[]int{6, 3, 4, 5, 2, 0, 7, 1}},
+ },
+
+ {
+ para1203{8, 2, []int{-1, -1, 1, 0, 0, 1, 0, -1}, [][]int{{}, {6}, {5}, {6}, {3}, {}, {4}, {}}},
+ ans1203{[]int{}},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 1203------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans1203, q.para1203
+ fmt.Printf("【input】:%v 【output】:%v\n", p, sortItems1(p.n, p.m, p.group, p.beforeItems))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/1203.Sort-Items-by-Groups-Respecting-Dependencies/README.md b/leetcode/1203.Sort-Items-by-Groups-Respecting-Dependencies/README.md
new file mode 100644
index 000000000..3bbddd165
--- /dev/null
+++ b/leetcode/1203.Sort-Items-by-Groups-Respecting-Dependencies/README.md
@@ -0,0 +1,191 @@
+# [1203. Sort Items by Groups Respecting Dependencies](https://leetcode.com/problems/sort-items-by-groups-respecting-dependencies/)
+
+
+## 题目
+
+There are `n` items each belonging to zero or one of `m` groups where `group[i]` is the group that the `i`-th item belongs to and it's equal to `-1` if the `i`-th item belongs to no group. The items and the groups are zero indexed. A group can have no item belonging to it.
+
+Return a sorted list of the items such that:
+
+- The items that belong to the same group are next to each other in the sorted list.
+- There are some relations between these items where `beforeItems[i]` is a list containing all the items that should come before the `i`th item in the sorted array (to the left of the `i`th item).
+
+Return any solution if there is more than one solution and return an **empty list** if there is no solution.
+
+**Example 1:**
+
+
+
+```
+Input: n = 8, m = 2, group = [-1,-1,1,0,0,1,0,-1], beforeItems = [[],[6],[5],[6],[3,6],[],[],[]]
+Output: [6,3,4,1,5,2,0,7]
+
+```
+
+**Example 2:**
+
+```
+Input: n = 8, m = 2, group = [-1,-1,1,0,0,1,0,-1], beforeItems = [[],[6],[5],[6],[3],[],[4],[]]
+Output: []
+Explanation: This is the same as example 1 except that 4 needs to be before 6 in the sorted list.
+
+```
+
+**Constraints:**
+
+- `1 <= m <= n <= 3 * 104`
+- `group.length == beforeItems.length == n`
+- `1 <= group[i] <= m - 1`
+- `0 <= beforeItems[i].length <= n - 1`
+- `0 <= beforeItems[i][j] <= n - 1`
+- `i != beforeItems[i][j]`
+- `beforeItems[i]` does not contain duplicates elements.
+
+## 题目大意
+
+有 n 个项目，每个项目或者不属于任何小组，或者属于 m 个小组之一。group[i] 表示第 i 个小组所属的小组，如果第 i 个项目不属于任何小组，则 group[i] 等于 -1。项目和小组都是从零开始编号的。可能存在小组不负责任何项目，即没有任何项目属于这个小组。
+
+请你帮忙按要求安排这些项目的进度，并返回排序后的项目列表：
+
+- 同一小组的项目，排序后在列表中彼此相邻。
+- 项目之间存在一定的依赖关系，我们用一个列表 beforeItems 来表示，其中 beforeItems[i] 表示在进行第 i 个项目前（位于第 i 个项目左侧）应该完成的所有项目。
+
+如果存在多个解决方案，只需要返回其中任意一个即可。如果没有合适的解决方案，就请返回一个 空列表 。
+
+## 解题思路
+
+- 读完题能确定这一题是拓扑排序。但是和单纯的拓扑排序有区别的是，同一小组内的项目需要彼此相邻。用 2 次拓扑排序即可解决。第一次拓扑排序排出组间的顺序，第二次拓扑排序排出组内的顺序。为了实现方便，用 map 给虚拟分组标记编号。如下图，将 3，4，6 三个任务打包到 0 号分组里面，将 2，5 两个任务打包到 1 号分组里面，其他任务单独各自为一组。组间的依赖是 6 号任务依赖 1 号任务。由于 6 号任务封装在 0 号分组里，所以 3 号分组依赖 0 号分组。先组间排序，确定分组顺序，再组内拓扑排序，排出最终顺序。
+
+ 
+
+- 上面的解法可以 AC，但是时间太慢了。因为做了一些不必要的操作。有没有可能只用一次拓扑排序呢？将必须要在一起的结点统一依赖一个虚拟结点，例如下图中的虚拟结点 8 和 9 。3，4，6 都依赖 8 号任务，2 和 5 都依赖 9 号任务。1 号任务本来依赖 6 号任务，由于 6 由依赖 8 ，所以添加 1 依赖 8 的边。通过增加虚拟结点，增加了需要打包在一起结点的入度。构建出以上关系以后，按照入度为 0 的原则，依次进行 DFS。8 号和 9 号两个虚拟结点的入度都为 0 ，对它们进行 DFS，必定会使得与它关联的节点都被安排在一起，这样就满足了题意：同一小组的项目，排序后在列表中彼此相邻。一遍扫完，满足题意的顺序就排出来了。这个解法 beat 100%！
+
+ 
+
+## 代码
+
+```go
+package leetcode
+
+// 解法一 拓扑排序版的 DFS
+func sortItems(n int, m int, group []int, beforeItems [][]int) []int {
+ groups, inDegrees := make([][]int, n+m), make([]int, n+m)
+ for i, g := range group {
+ if g > -1 {
+ g += n
+ groups[g] = append(groups[g], i)
+ inDegrees[i]++
+ }
+ }
+ for i, ancestors := range beforeItems {
+ gi := group[i]
+ if gi == -1 {
+ gi = i
+ } else {
+ gi += n
+ }
+ for _, ancestor := range ancestors {
+ ga := group[ancestor]
+ if ga == -1 {
+ ga = ancestor
+ } else {
+ ga += n
+ }
+ if gi == ga {
+ groups[ancestor] = append(groups[ancestor], i)
+ inDegrees[i]++
+ } else {
+ groups[ga] = append(groups[ga], gi)
+ inDegrees[gi]++
+ }
+ }
+ }
+ res := []int{}
+ for i, d := range inDegrees {
+ if d == 0 {
+ sortItemsDFS(i, n, &res, &inDegrees, &groups)
+ }
+ }
+ if len(res) != n {
+ return nil
+ }
+ return res
+}
+
+func sortItemsDFS(i, n int, res, inDegrees *[]int, groups *[][]int) {
+ if i < n {
+ *res = append(*res, i)
+ }
+ (*inDegrees)[i] = -1
+ for _, ch := range (*groups)[i] {
+ if (*inDegrees)[ch]--; (*inDegrees)[ch] == 0 {
+ sortItemsDFS(ch, n, res, inDegrees, groups)
+ }
+ }
+}
+
+// 解法二 二维拓扑排序 时间复杂度 O(m+n)，空间复杂度 O(m+n)
+func sortItems1(n int, m int, group []int, beforeItems [][]int) []int {
+ groupItems, res := map[int][]int{}, []int{}
+ for i := 0; i < len(group); i++ {
+ if group[i] == -1 {
+ group[i] = m + i
+ }
+ groupItems[group[i]] = append(groupItems[group[i]], i)
+ }
+ groupGraph, groupDegree, itemGraph, itemDegree := make([][]int, m+n), make([]int, m+n), make([][]int, n), make([]int, n)
+ for i := 0; i < len(beforeItems); i++ {
+ for j := 0; j < len(beforeItems[i]); j++ {
+ if group[beforeItems[i][j]] != group[i] {
+ // 不同组项目，确定组间依赖关系
+ groupGraph[group[beforeItems[i][j]]] = append(groupGraph[group[beforeItems[i][j]]], group[i])
+ groupDegree[group[i]]++
+ } else {
+ // 同组项目，确定组内依赖关系
+ itemGraph[beforeItems[i][j]] = append(itemGraph[beforeItems[i][j]], i)
+ itemDegree[i]++
+ }
+ }
+ }
+ items := []int{}
+ for i := 0; i < m+n; i++ {
+ items = append(items, i)
+ }
+ // 组间拓扑
+ groupOrders := topSort(groupGraph, groupDegree, items)
+ if len(groupOrders) < len(items) {
+ return nil
+ }
+ for i := 0; i < len(groupOrders); i++ {
+ items := groupItems[groupOrders[i]]
+ // 组内拓扑
+ orders := topSort(itemGraph, itemDegree, items)
+ if len(orders) < len(items) {
+ return nil
+ }
+ res = append(res, orders...)
+ }
+ return res
+}
+
+func topSort(graph [][]int, deg, items []int) (orders []int) {
+ q := []int{}
+ for _, i := range items {
+ if deg[i] == 0 {
+ q = append(q, i)
+ }
+ }
+ for len(q) > 0 {
+ from := q[0]
+ q = q[1:]
+ orders = append(orders, from)
+ for _, to := range graph[from] {
+ deg[to]--
+ if deg[to] == 0 {
+ q = append(q, to)
+ }
+ }
+ }
+ return
+}
+```
\ No newline at end of file
diff --git a/leetcode/1209.Remove-All-Adjacent-Duplicates-in-String-II/1209. Remove All Adjacent Duplicates in String II.go b/leetcode/1209.Remove-All-Adjacent-Duplicates-in-String-II/1209. Remove All Adjacent Duplicates in String II.go
new file mode 100644
index 000000000..34a937c5a
--- /dev/null
+++ b/leetcode/1209.Remove-All-Adjacent-Duplicates-in-String-II/1209. Remove All Adjacent Duplicates in String II.go
@@ -0,0 +1,48 @@
+package leetcode
+
+// 解法一 stack
+func removeDuplicates(s string, k int) string {
+ stack, arr := [][2]int{}, []byte{}
+ for _, c := range s {
+ i := int(c - 'a')
+ if len(stack) > 0 && stack[len(stack)-1][0] == i {
+ stack[len(stack)-1][1]++
+ if stack[len(stack)-1][1] == k {
+ stack = stack[:len(stack)-1]
+ }
+ } else {
+ stack = append(stack, [2]int{i, 1})
+ }
+ }
+ for _, pair := range stack {
+ c := byte(pair[0] + 'a')
+ for i := 0; i < pair[1]; i++ {
+ arr = append(arr, c)
+ }
+ }
+ return string(arr)
+}
+
+// 解法二 暴力
+func removeDuplicates1(s string, k int) string {
+ arr, count, tmp := []rune{}, 0, '#'
+ for _, v := range s {
+ arr = append(arr, v)
+ for len(arr) > 0 {
+ count = 0
+ tmp = arr[len(arr)-1]
+ for i := len(arr) - 1; i >= 0; i-- {
+ if arr[i] != tmp {
+ break
+ }
+ count++
+ }
+ if count == k {
+ arr = arr[:len(arr)-k]
+ } else {
+ break
+ }
+ }
+ }
+ return string(arr)
+}
diff --git a/leetcode/1209.Remove-All-Adjacent-Duplicates-in-String-II/1209. Remove All Adjacent Duplicates in String II_test.go b/leetcode/1209.Remove-All-Adjacent-Duplicates-in-String-II/1209. Remove All Adjacent Duplicates in String II_test.go
new file mode 100644
index 000000000..8af7d1dda
--- /dev/null
+++ b/leetcode/1209.Remove-All-Adjacent-Duplicates-in-String-II/1209. Remove All Adjacent Duplicates in String II_test.go
@@ -0,0 +1,53 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question1209 struct {
+ para1209
+ ans1209
+}
+
+// para 是参数
+// one 代表第一个参数
+type para1209 struct {
+ s string
+ k int
+}
+
+// ans 是答案
+// one 代表第一个答案
+type ans1209 struct {
+ one string
+}
+
+func Test_Problem1209(t *testing.T) {
+
+ qs := []question1209{
+
+ // {
+ // para1209{"abcd", 2},
+ // ans1209{"abcd"},
+ // },
+
+ {
+ para1209{"deeedbbcccbdaa", 3},
+ ans1209{"aa"},
+ },
+
+ {
+ para1209{"pbbcggttciiippooaais", 2},
+ ans1209{"ps"},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 1209------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans1209, q.para1209
+ fmt.Printf("【input】:%v 【output】:%v\n", p, removeDuplicates(p.s, p.k))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/1209.Remove-All-Adjacent-Duplicates-in-String-II/README.md b/leetcode/1209.Remove-All-Adjacent-Duplicates-in-String-II/README.md
new file mode 100644
index 000000000..d8488f0f0
--- /dev/null
+++ b/leetcode/1209.Remove-All-Adjacent-Duplicates-in-String-II/README.md
@@ -0,0 +1,106 @@
+# [1209. Remove All Adjacent Duplicates in String II](https://leetcode.com/problems/remove-all-adjacent-duplicates-in-string-ii/)
+
+
+## 题目
+
+Given a string `s`, a *k* *duplicate removal* consists of choosing `k` adjacent and equal letters from `s` and removing them causing the left and the right side of the deleted substring to concatenate together.
+
+We repeatedly make `k` duplicate removals on `s` until we no longer can.
+
+Return the final string after all such duplicate removals have been made.
+
+It is guaranteed that the answer is unique.
+
+**Example 1:**
+
+```
+Input: s = "abcd", k = 2
+Output: "abcd"
+Explanation:There's nothing to delete.
+```
+
+**Example 2:**
+
+```
+Input: s = "deeedbbcccbdaa", k = 3
+Output: "aa"
+Explanation:
+First delete "eee" and "ccc", get "ddbbbdaa"
+Then delete "bbb", get "dddaa"
+Finally delete "ddd", get "aa"
+```
+
+**Example 3:**
+
+```
+Input: s = "pbbcggttciiippooaais", k = 2
+Output: "ps"
+```
+
+**Constraints:**
+
+- `1 <= s.length <= 10^5`
+- `2 <= k <= 10^4`
+- `s` only contains lower case English letters.
+
+## 题目大意
+
+给你一个字符串 s，「k 倍重复项删除操作」将会从 s 中选择 k 个相邻且相等的字母，并删除它们，使被删去的字符串的左侧和右侧连在一起。你需要对 s 重复进行无限次这样的删除操作，直到无法继续为止。在执行完所有删除操作后，返回最终得到的字符串。本题答案保证唯一。
+
+## 解题思路
+
+- 暴力解法。每增加一个字符，就往前扫描 `k` 位，判断是否存在 `k` 个连续相同的字符。消除了 `k` 个相同字符后，重新组成的字符串还可能再次产出 `k` 位相同的字符，（类似消消乐，`k` 个相同的字符碰到一起就“消除”），还需要继续消除。最差情况要再次扫描一次字符串。时间复杂度 O(n^2)，空间复杂度 O(n)。
+- 暴力解法的低效在于重复统计字符频次，如果每个字符的频次统计一次就好了。按照这个思路，利用 stack ，每个栈元素存 2 个值，一个是字符，一个是该字符对应的频次。有了栈顶字符频次信息，就不需要重复往前扫描了。只要栈顶字符频次到达了 `k`，就弹出该字符。如此反复，最终剩下的字符串为所求。时间复杂度 O(n)，空间复杂度 O(n)。
+
+## 代码
+
+```go
+package leetcode
+
+// 解法一 stack
+func removeDuplicates(s string, k int) string {
+ stack, arr := [][2]int{}, []byte{}
+ for _, c := range s {
+ i := int(c - 'a')
+ if len(stack) > 0 && stack[len(stack)-1][0] == i {
+ stack[len(stack)-1][1]++
+ if stack[len(stack)-1][1] == k {
+ stack = stack[:len(stack)-1]
+ }
+ } else {
+ stack = append(stack, [2]int{i, 1})
+ }
+ }
+ for _, pair := range stack {
+ c := byte(pair[0] + 'a')
+ for i := 0; i < pair[1]; i++ {
+ arr = append(arr, c)
+ }
+ }
+ return string(arr)
+}
+
+// 解法二 暴力
+func removeDuplicates1(s string, k int) string {
+ arr, count, tmp := []rune{}, 0, '#'
+ for _, v := range s {
+ arr = append(arr, v)
+ for len(arr) > 0 {
+ count = 0
+ tmp = arr[len(arr)-1]
+ for i := len(arr) - 1; i >= 0; i-- {
+ if arr[i] != tmp {
+ break
+ }
+ count++
+ }
+ if count == k {
+ arr = arr[:len(arr)-k]
+ } else {
+ break
+ }
+ }
+ }
+ return string(arr)
+}
+```
\ No newline at end of file
diff --git a/leetcode/1217.Play-with-Chips/1217. Play with Chips.go b/leetcode/1217.Minimum-Cost-to-Move-Chips-to-The-Same-Position/1217. Minimum Cost to Move Chips to The Same Position.go
similarity index 100%
rename from leetcode/1217.Play-with-Chips/1217. Play with Chips.go
rename to leetcode/1217.Minimum-Cost-to-Move-Chips-to-The-Same-Position/1217. Minimum Cost to Move Chips to The Same Position.go
diff --git a/leetcode/1217.Play-with-Chips/1217. Play with Chips_test.go b/leetcode/1217.Minimum-Cost-to-Move-Chips-to-The-Same-Position/1217. Minimum Cost to Move Chips to The Same Position_test.go
similarity index 100%
rename from leetcode/1217.Play-with-Chips/1217. Play with Chips_test.go
rename to leetcode/1217.Minimum-Cost-to-Move-Chips-to-The-Same-Position/1217. Minimum Cost to Move Chips to The Same Position_test.go
diff --git a/leetcode/1217.Minimum-Cost-to-Move-Chips-to-The-Same-Position/README.md b/leetcode/1217.Minimum-Cost-to-Move-Chips-to-The-Same-Position/README.md
new file mode 100755
index 000000000..e7ac7fe5a
--- /dev/null
+++ b/leetcode/1217.Minimum-Cost-to-Move-Chips-to-The-Same-Position/README.md
@@ -0,0 +1,55 @@
+# [1217. Minimum Cost to Move Chips to The Same Position](https://leetcode.com/problems/minimum-cost-to-move-chips-to-the-same-position/)
+
+
+## 题目
+
+There are some chips, and the i-th chip is at position `chips[i]`.
+
+You can perform any of the two following types of moves **any number of times** (possibly zero) **on any chip**:
+
+- Move the `i`-th chip by 2 units to the left or to the right with a cost of **0**.
+- Move the `i`-th chip by 1 unit to the left or to the right with a cost of **1**.
+
+There can be two or more chips at the same position initially.
+
+Return the minimum cost needed to move all the chips to the same position (any position).
+
+**Example 1:**
+
+ Input: chips = [1,2,3]
+ Output: 1
+ Explanation: Second chip will be moved to positon 3 with cost 1. First chip will be moved to position 3 with cost 0. Total cost is 1.
+
+**Example 2:**
+
+ Input: chips = [2,2,2,3,3]
+ Output: 2
+ Explanation: Both fourth and fifth chip will be moved to position two with cost 1. Total minimum cost will be 2.
+
+**Constraints:**
+
+- `1 <= chips.length <= 100`
+- `1 <= chips[i] <= 10^9`
+
+
+## 题目大意
+
+
+数轴上放置了一些筹码，每个筹码的位置存在数组 chips 当中。你可以对 任何筹码 执行下面两种操作之一（不限操作次数，0 次也可以）：
+
+- 将第 i 个筹码向左或者右移动 2 个单位，代价为 0。
+- 将第 i 个筹码向左或者右移动 1 个单位，代价为 1。
+
+最开始的时候，同一位置上也可能放着两个或者更多的筹码。返回将所有筹码移动到同一位置（任意位置）上所需要的最小代价。
+
+
+提示：
+
+- 1 <= chips.length <= 100
+- 1 <= chips[i] <= 10^9
+
+
+## 解题思路
+
+- 给出一个数组，数组的下标代表的是数轴上的坐标点，数组的元素代表的是砝码大小。砝码移动规则，左右移动 2 格，没有代价，左右移动 1 个，代价是 1 。问最终把砝码都移动到一个格子上，最小代价是多少。
+- 先解读砝码移动规则：偶数位置的到偶数位置的没有代价，奇数到奇数位置的没有代价。利用这个规则，我们可以把所有的砝码**无代价**的摞在一个奇数的位置上和一个偶数的位置上。这样我们只用关心这两个位置了。并且这两个位置可以连续在一起。最后一步即将相邻的这两摞砝码合并到一起。由于左右移动一个代价是 1，所以最小代价的操作是移动最少砝码的那一边。奇数位置上砝码少就移动奇数位置上的，偶数位置上砝码少就移动偶数位置上的。所以这道题解法变的异常简单，遍历一次数组，找到其中有多少个奇数和偶数位置的砝码，取其中比较少的，就是最终答案。
diff --git a/leetcode/1217.Play-with-Chips/README.md b/leetcode/1217.Play-with-Chips/README.md
deleted file mode 100755
index 7eb9669fa..000000000
--- a/leetcode/1217.Play-with-Chips/README.md
+++ /dev/null
@@ -1,55 +0,0 @@
-# [1217. Play with Chips](https://leetcode.com/problems/play-with-chips/)
-
-
-## 题目
-
-There are some chips, and the i-th chip is at position `chips[i]`.
-
-You can perform any of the two following types of moves **any number of times** (possibly zero) **on any chip**:
-
-- Move the `i`-th chip by 2 units to the left or to the right with a cost of **0**.
-- Move the `i`-th chip by 1 unit to the left or to the right with a cost of **1**.
-
-There can be two or more chips at the same position initially.
-
-Return the minimum cost needed to move all the chips to the same position (any position).
-
-**Example 1:**
-
- Input: chips = [1,2,3]
- Output: 1
- Explanation: Second chip will be moved to positon 3 with cost 1. First chip will be moved to position 3 with cost 0. Total cost is 1.
-
-**Example 2:**
-
- Input: chips = [2,2,2,3,3]
- Output: 2
- Explanation: Both fourth and fifth chip will be moved to position two with cost 1. Total minimum cost will be 2.
-
-**Constraints:**
-
-- `1 <= chips.length <= 100`
-- `1 <= chips[i] <= 10^9`
-
-
-## 题目大意
-
-
-数轴上放置了一些筹码，每个筹码的位置存在数组 chips 当中。你可以对 任何筹码 执行下面两种操作之一（不限操作次数，0 次也可以）：
-
-- 将第 i 个筹码向左或者右移动 2 个单位，代价为 0。
-- 将第 i 个筹码向左或者右移动 1 个单位，代价为 1。
-
-最开始的时候，同一位置上也可能放着两个或者更多的筹码。返回将所有筹码移动到同一位置（任意位置）上所需要的最小代价。
-
-
-提示：
-
-- 1 <= chips.length <= 100
-- 1 <= chips[i] <= 10^9
-
-
-## 解题思路
-
-- 给出一个数组，数组的下标代表的是数轴上的坐标点，数组的元素代表的是砝码大小。砝码移动规则，左右移动 2 格，没有代价，左右移动 1 个，代价是 1 。问最终把砝码都移动到一个格子上，最小代价是多少。
-- 先解读砝码移动规则：偶数位置的到偶数位置的没有代价，奇数到奇数位置的没有代价。利用这个规则，我们可以把所有的砝码**无代价**的摞在一个奇数的位置上和一个偶数的位置上。这样我们只用关心这两个位置了。并且这两个位置可以连续在一起。最后一步即将相邻的这两摞砝码合并到一起。由于左右移动一个代价是 1，所以最小代价的操作是移动最少砝码的那一边。奇数位置上砝码少就移动奇数位置上的，偶数位置上砝码少就移动偶数位置上的。所以这道题解法变的异常简单，遍历一次数组，找到其中有多少个奇数和偶数位置的砝码，取其中比较少的，就是最终答案。
diff --git a/leetcode/1239.Maximum-Length-of-a-Concatenated-String-with-Unique-Characters/1239. Maximum Length of a Concatenated String with Unique Characters.go b/leetcode/1239.Maximum-Length-of-a-Concatenated-String-with-Unique-Characters/1239. Maximum Length of a Concatenated String with Unique Characters.go
new file mode 100644
index 000000000..f75727caf
--- /dev/null
+++ b/leetcode/1239.Maximum-Length-of-a-Concatenated-String-with-Unique-Characters/1239. Maximum Length of a Concatenated String with Unique Characters.go
@@ -0,0 +1,38 @@
+package leetcode
+
+import (
+ "math/bits"
+)
+
+func maxLength(arr []string) int {
+ c, res := []uint32{}, 0
+ for _, s := range arr {
+ var mask uint32
+ for _, c := range s {
+ mask = mask | 1<<(c-'a')
+ }
+ if len(s) != bits.OnesCount32(mask) { // 如果字符串本身带有重复的字符，需要排除
+ continue
+ }
+ c = append(c, mask)
+ }
+ dfs(c, 0, 0, &res)
+ return res
+}
+
+func dfs(c []uint32, index int, mask uint32, res *int) {
+ *res = max(*res, bits.OnesCount32(mask))
+ for i := index; i < len(c); i++ {
+ if mask&c[i] == 0 {
+ dfs(c, i+1, mask|c[i], res)
+ }
+ }
+ return
+}
+
+func max(a, b int) int {
+ if a > b {
+ return a
+ }
+ return b
+}
diff --git a/leetcode/1239.Maximum-Length-of-a-Concatenated-String-with-Unique-Characters/1239. Maximum Length of a Concatenated String with Unique Characters_test.go b/leetcode/1239.Maximum-Length-of-a-Concatenated-String-with-Unique-Characters/1239. Maximum Length of a Concatenated String with Unique Characters_test.go
new file mode 100644
index 000000000..8a0c00345
--- /dev/null
+++ b/leetcode/1239.Maximum-Length-of-a-Concatenated-String-with-Unique-Characters/1239. Maximum Length of a Concatenated String with Unique Characters_test.go
@@ -0,0 +1,52 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question1239 struct {
+ para1239
+ ans1239
+}
+
+// para 是参数
+// one 代表第一个参数
+type para1239 struct {
+ arr []string
+}
+
+// ans 是答案
+// one 代表第一个答案
+type ans1239 struct {
+ one int
+}
+
+func Test_Problem1239(t *testing.T) {
+
+ qs := []question1239{
+
+ {
+ para1239{[]string{"un", "iq", "ue"}},
+ ans1239{4},
+ },
+
+ {
+ para1239{[]string{"cha", "r", "act", "ers"}},
+ ans1239{6},
+ },
+
+ {
+ para1239{[]string{"abcdefghijklmnopqrstuvwxyz"}},
+ ans1239{26},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 1239------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans1239, q.para1239
+ fmt.Printf("【input】:%v 【output】:%v\n", p, maxLength(p.arr))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/1239.Maximum-Length-of-a-Concatenated-String-with-Unique-Characters/README.md b/leetcode/1239.Maximum-Length-of-a-Concatenated-String-with-Unique-Characters/README.md
new file mode 100644
index 000000000..58cdb2e9d
--- /dev/null
+++ b/leetcode/1239.Maximum-Length-of-a-Concatenated-String-with-Unique-Characters/README.md
@@ -0,0 +1,88 @@
+# [1239. Maximum Length of a Concatenated String with Unique Characters](https://leetcode.com/problems/maximum-length-of-a-concatenated-string-with-unique-characters/)
+
+## 题目
+
+Given an array of strings `arr`. String `s` is a concatenation of a sub-sequence of `arr` which have **unique characters**.
+
+Return *the maximum possible length* of `s`.
+
+**Example 1:**
+
+```
+Input: arr = ["un","iq","ue"]
+Output: 4
+Explanation: All possible concatenations are "","un","iq","ue","uniq" and "ique".
+Maximum length is 4.
+```
+
+**Example 2:**
+
+```
+Input: arr = ["cha","r","act","ers"]
+Output: 6
+Explanation: Possible solutions are "chaers" and "acters".
+```
+
+**Example 3:**
+
+```
+Input: arr = ["abcdefghijklmnopqrstuvwxyz"]
+Output: 26
+```
+
+**Constraints:**
+
+- `1 <= arr.length <= 16`
+- `1 <= arr[i].length <= 26`
+- `arr[i]` contains only lower case English letters.
+
+## 题目大意
+
+给定一个字符串数组 arr，字符串 s 是将 arr 某一子序列字符串连接所得的字符串，如果 s 中的每一个字符都只出现过一次，那么它就是一个可行解。请返回所有可行解 s 中最长长度。
+
+## 解题思路
+
+- 每个字符串数组可以想象为 26 位的 0101 二进制串。出现的字符对应的位上标记为 1，没有出现的字符对应的位上标记为 0 。如果一个字符串中包含重复的字符，那么它所有 1 的个数一定不等于字符串的长度。如果 2 个字符串每个字母都只出现了一次，那么它们俩对应的二进制串 mask 相互与运算的结果一定为 0 ，即 0，1 互补了。利用这个特点，深搜所有解，保存出最长可行解的长度即可。
+
+## 代码
+
+```go
+package leetcode
+
+import (
+ "math/bits"
+)
+
+func maxLength(arr []string) int {
+ c, res := []uint32{}, 0
+ for _, s := range arr {
+ var mask uint32
+ for _, c := range s {
+ mask = mask | 1<<(c-'a')
+ }
+ if len(s) != bits.OnesCount32(mask) { // 如果字符串本身带有重复的字符，需要排除
+ continue
+ }
+ c = append(c, mask)
+ }
+ dfs(c, 0, 0, &res)
+ return res
+}
+
+func dfs(c []uint32, index int, mask uint32, res *int) {
+ *res = max(*res, bits.OnesCount32(mask))
+ for i := index; i < len(c); i++ {
+ if mask&c[i] == 0 {
+ dfs(c, i+1, mask|c[i], res)
+ }
+ }
+ return
+}
+
+func max(a, b int) int {
+ if a > b {
+ return a
+ }
+ return b
+}
+```
\ No newline at end of file
diff --git a/leetcode/1249.Minimum-Remove-to-Make-Valid-Parentheses/1249. Minimum Remove to Make Valid Parentheses.go b/leetcode/1249.Minimum-Remove-to-Make-Valid-Parentheses/1249. Minimum Remove to Make Valid Parentheses.go
new file mode 100644
index 000000000..9943e5881
--- /dev/null
+++ b/leetcode/1249.Minimum-Remove-to-Make-Valid-Parentheses/1249. Minimum Remove to Make Valid Parentheses.go
@@ -0,0 +1,23 @@
+package leetcode
+
+func minRemoveToMakeValid(s string) string {
+ res, opens := []byte{}, 0
+ for i := 0; i < len(s); i++ {
+ if s[i] == '(' {
+ opens++
+ } else if s[i] == ')' {
+ if opens == 0 {
+ continue
+ }
+ opens--
+ }
+ res = append(res, s[i])
+ }
+ for i := len(res) - 1; i >= 0; i-- {
+ if res[i] == '(' && opens > 0 {
+ opens--
+ res = append(res[:i], res[i+1:]...)
+ }
+ }
+ return string(res)
+}
diff --git a/leetcode/1249.Minimum-Remove-to-Make-Valid-Parentheses/1249. Minimum Remove to Make Valid Parentheses_test.go b/leetcode/1249.Minimum-Remove-to-Make-Valid-Parentheses/1249. Minimum Remove to Make Valid Parentheses_test.go
new file mode 100644
index 000000000..f09bc3a5a
--- /dev/null
+++ b/leetcode/1249.Minimum-Remove-to-Make-Valid-Parentheses/1249. Minimum Remove to Make Valid Parentheses_test.go
@@ -0,0 +1,57 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question1249 struct {
+ para1249
+ ans1249
+}
+
+// para 是参数
+// one 代表第一个参数
+type para1249 struct {
+ s string
+}
+
+// ans 是答案
+// one 代表第一个答案
+type ans1249 struct {
+ one string
+}
+
+func Test_Problem1249(t *testing.T) {
+
+ qs := []question1249{
+
+ {
+ para1249{"lee(t(c)o)de)"},
+ ans1249{"lee(t(c)o)de"},
+ },
+
+ {
+ para1249{"a)b(c)d"},
+ ans1249{"ab(c)d"},
+ },
+
+ {
+ para1249{"))(("},
+ ans1249{""},
+ },
+
+ {
+ para1249{"(a(b(c)d)"},
+ ans1249{"a(b(c)d)"},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 1249------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans1249, q.para1249
+ fmt.Printf("【input】:%v 【output】:%v\n", p, minRemoveToMakeValid(p.s))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/1249.Minimum-Remove-to-Make-Valid-Parentheses/README.md b/leetcode/1249.Minimum-Remove-to-Make-Valid-Parentheses/README.md
new file mode 100644
index 000000000..1e60b4d77
--- /dev/null
+++ b/leetcode/1249.Minimum-Remove-to-Make-Valid-Parentheses/README.md
@@ -0,0 +1,95 @@
+# [1249. Minimum Remove to Make Valid Parentheses](https://leetcode.com/problems/minimum-remove-to-make-valid-parentheses/)
+
+
+## 题目
+
+Given a string s of `'('` , `')'` and lowercase English characters.
+
+Your task is to remove the minimum number of parentheses ( `'('` or `')'`, in any positions ) so that the resulting *parentheses string* is valid and return **any** valid string.
+
+Formally, a *parentheses string* is valid if and only if:
+
+- It is the empty string, contains only lowercase characters, or
+- It can be written as `AB` (`A` concatenated with `B`), where `A` and `B` are valid strings, or
+- It can be written as `(A)`, where `A` is a valid string.
+
+**Example 1:**
+
+```
+Input: s = "lee(t(c)o)de)"
+Output: "lee(t(c)o)de"
+Explanation: "lee(t(co)de)" , "lee(t(c)ode)" would also be accepted.
+
+```
+
+**Example 2:**
+
+```
+Input: s = "a)b(c)d"
+Output: "ab(c)d"
+
+```
+
+**Example 3:**
+
+```
+Input: s = "))(("
+Output: ""
+Explanation: An empty string is also valid.
+
+```
+
+**Example 4:**
+
+```
+Input: s = "(a(b(c)d)"
+Output: "a(b(c)d)"
+
+```
+
+**Constraints:**
+
+- `1 <= s.length <= 10^5`
+- `s[i]` is one of `'('` , `')'` and lowercase English letters`.`
+
+## 题目大意
+
+给你一个由 '('、')' 和小写字母组成的字符串 s。你需要从字符串中删除最少数目的 '(' 或者 ')' （可以删除任意位置的括号)，使得剩下的「括号字符串」有效。请返回任意一个合法字符串。有效「括号字符串」应当符合以下 任意一条 要求：
+
+- 空字符串或只包含小写字母的字符串
+- 可以被写作 AB（A 连接 B）的字符串，其中 A 和 B 都是有效「括号字符串」
+- 可以被写作 (A) 的字符串，其中 A 是一个有效的「括号字符串」
+
+## 解题思路
+
+- 最容易想到的思路是利用栈判断括号匹配是否有效。这个思路可行，时间复杂度也只是 O(n)。
+- 不用栈，可以 2 次循环遍历，正向遍历一次，标记出多余的 `'('` ，逆向遍历一次，再标记出多余的 `')'`，最后将所有这些标记多余的字符删掉即可。这种解法写出来的代码也很简洁，时间复杂度也是 O(n)。
+- 针对上面的解法再改进一点。正向遍历的时候不仅标记出多余的 `'('`，还可以顺手把多余的 `')'` 删除。这样只用循环一次。最后再删除掉多余的 `'('` 即可。时间复杂度还是 O(n)。
+
+## 代码
+
+```go
+package leetcode
+
+func minRemoveToMakeValid(s string) string {
+ res, opens := []byte{}, 0
+ for i := 0; i < len(s); i++ {
+ if s[i] == '(' {
+ opens++
+ } else if s[i] == ')' {
+ if opens == 0 {
+ continue
+ }
+ opens--
+ }
+ res = append(res, s[i])
+ }
+ for i := len(res) - 1; i >= 0; i-- {
+ if res[i] == '(' && opens > 0 {
+ opens--
+ res = append(res[:i], res[i+1:]...)
+ }
+ }
+ return string(res)
+}
+```
\ No newline at end of file
diff --git a/leetcode/1268.Search-Suggestions-System/1268. Search Suggestions System.go b/leetcode/1268.Search-Suggestions-System/1268. Search Suggestions System.go
new file mode 100644
index 000000000..d9ba6b502
--- /dev/null
+++ b/leetcode/1268.Search-Suggestions-System/1268. Search Suggestions System.go
@@ -0,0 +1,22 @@
+package leetcode
+
+import (
+ "sort"
+)
+
+func suggestedProducts(products []string, searchWord string) [][]string {
+ sort.Strings(products)
+ searchWordBytes, result := []byte(searchWord), make([][]string, 0, len(searchWord))
+ for i := 1; i <= len(searchWord); i++ {
+ searchWordBytes[i-1]++
+ products = products[:sort.SearchStrings(products, string(searchWordBytes[:i]))]
+ searchWordBytes[i-1]--
+ products = products[sort.SearchStrings(products, searchWord[:i]):]
+ if len(products) > 3 {
+ result = append(result, products[:3])
+ } else {
+ result = append(result, products)
+ }
+ }
+ return result
+}
diff --git a/leetcode/1268.Search-Suggestions-System/1268. Search Suggestions System_test.go b/leetcode/1268.Search-Suggestions-System/1268. Search Suggestions System_test.go
new file mode 100644
index 000000000..bc2be9a48
--- /dev/null
+++ b/leetcode/1268.Search-Suggestions-System/1268. Search Suggestions System_test.go
@@ -0,0 +1,70 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question1268 struct {
+ para1268
+ ans1268
+}
+
+// para 是参数
+// one 代表第一个参数
+type para1268 struct {
+ products []string
+ searchWord string
+}
+
+// ans 是答案
+// one 代表第一个答案
+type ans1268 struct {
+ one [][]string
+}
+
+func Test_Problem1268(t *testing.T) {
+
+ qs := []question1268{
+
+ {
+ para1268{[]string{"bags", "baggage", "banner", "box", "cloths"}, "bags"},
+ ans1268{[][]string{
+ {"baggage", "bags", "banner"}, {"baggage", "bags", "banner"}, {"baggage", "bags"}, {"bags"},
+ }},
+ },
+
+ {
+ para1268{[]string{"mobile", "mouse", "moneypot", "monitor", "mousepad"}, "mouse"},
+ ans1268{[][]string{
+ {"mobile", "moneypot", "monitor"},
+ {"mobile", "moneypot", "monitor"},
+ {"mouse", "mousepad"},
+ {"mouse", "mousepad"},
+ {"mouse", "mousepad"},
+ }},
+ },
+
+ {
+ para1268{[]string{"havana"}, "havana"},
+ ans1268{[][]string{
+ {"havana"}, {"havana"}, {"havana"}, {"havana"}, {"havana"}, {"havana"},
+ }},
+ },
+
+ {
+ para1268{[]string{"havana"}, "tatiana"},
+ ans1268{[][]string{
+ {}, {}, {}, {}, {}, {}, {},
+ }},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 1268------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans1268, q.para1268
+ fmt.Printf("【input】:%v 【output】:%v\n", p, suggestedProducts(p.products, p.searchWord))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/1268.Search-Suggestions-System/README.md b/leetcode/1268.Search-Suggestions-System/README.md
new file mode 100644
index 000000000..769f4d7a8
--- /dev/null
+++ b/leetcode/1268.Search-Suggestions-System/README.md
@@ -0,0 +1,89 @@
+# [1268. Search Suggestions System](https://leetcode.com/problems/search-suggestions-system/)
+
+## 题目
+
+Given an array of strings `products` and a string `searchWord`. We want to design a system that suggests at most three product names from `products` after each character of `searchWord` is typed. Suggested products should have common prefix with the searchWord. If there are more than three products with a common prefix return the three lexicographically minimums products.
+
+Return *list of lists* of the suggested `products` after each character of `searchWord` is typed.
+
+**Example 1:**
+
+```
+Input: products = ["mobile","mouse","moneypot","monitor","mousepad"], searchWord = "mouse"
+Output: [
+["mobile","moneypot","monitor"],
+["mobile","moneypot","monitor"],
+["mouse","mousepad"],
+["mouse","mousepad"],
+["mouse","mousepad"]
+]
+Explanation: products sorted lexicographically = ["mobile","moneypot","monitor","mouse","mousepad"]
+After typing m and mo all products match and we show user ["mobile","moneypot","monitor"]
+After typing mou, mous and mouse the system suggests ["mouse","mousepad"]
+
+```
+
+**Example 2:**
+
+```
+Input: products = ["havana"], searchWord = "havana"
+Output: [["havana"],["havana"],["havana"],["havana"],["havana"],["havana"]]
+```
+
+**Example 3:**
+
+```
+Input: products = ["bags","baggage","banner","box","cloths"], searchWord = "bags"
+Output: [["baggage","bags","banner"],["baggage","bags","banner"],["baggage","bags"],["bags"]]
+```
+
+**Example 4:**
+
+```
+Input: products = ["havana"], searchWord = "tatiana"
+Output: [[],[],[],[],[],[],[]]
+```
+
+**Constraints:**
+
+- `1 <= products.length <= 1000`
+- There are no repeated elements in `products`.
+- `1 <= Σ products[i].length <= 2 * 10^4`
+- All characters of `products[i]` are lower-case English letters.
+- `1 <= searchWord.length <= 1000`
+- All characters of `searchWord` are lower-case English letters.
+
+## 题目大意
+
+给你一个产品数组 products 和一个字符串 searchWord ，products 数组中每个产品都是一个字符串。请你设计一个推荐系统，在依次输入单词 searchWord 的每一个字母后，推荐 products 数组中前缀与 searchWord 相同的最多三个产品。如果前缀相同的可推荐产品超过三个，请按字典序返回最小的三个。请你以二维列表的形式，返回在输入 searchWord 每个字母后相应的推荐产品的列表。
+
+## 解题思路
+
+- 由于题目要求返回的答案要按照字典序输出，所以先排序。有序字符串又满足了二分搜索的条件，于是可以用二分搜索。sort.SearchStrings 返回的是满足搜索条件的第一个起始下标。末尾不满足条件的字符串要切掉。所以要搜 2 次，第一次二分搜索先将不满足目标串前缀的字符串筛掉。第二次二分搜索再搜索出最终满足题意的字符串。
+
+## 代码
+
+```go
+package leetcode
+
+import (
+ "sort"
+)
+
+func suggestedProducts(products []string, searchWord string) [][]string {
+ sort.Strings(products)
+ searchWordBytes, result := []byte(searchWord), make([][]string, 0, len(searchWord))
+ for i := 1; i <= len(searchWord); i++ {
+ searchWordBytes[i-1]++
+ products = products[:sort.SearchStrings(products, string(searchWordBytes[:i]))]
+ searchWordBytes[i-1]--
+ products = products[sort.SearchStrings(products, searchWord[:i]):]
+ if len(products) > 3 {
+ result = append(result, products[:3])
+ } else {
+ result = append(result, products)
+ }
+ }
+ return result
+}
+```
\ No newline at end of file
diff --git a/leetcode/1293.Shortest-Path-in-a-Grid-with-Obstacles-Elimination/1293. Shortest Path in a Grid with Obstacles Elimination.go b/leetcode/1293.Shortest-Path-in-a-Grid-with-Obstacles-Elimination/1293. Shortest Path in a Grid with Obstacles Elimination.go
new file mode 100644
index 000000000..71140a986
--- /dev/null
+++ b/leetcode/1293.Shortest-Path-in-a-Grid-with-Obstacles-Elimination/1293. Shortest Path in a Grid with Obstacles Elimination.go
@@ -0,0 +1,71 @@
+package leetcode
+
+var dir = [][]int{
+ {-1, 0},
+ {0, 1},
+ {1, 0},
+ {0, -1},
+}
+
+type pos struct {
+ x, y int
+ obstacle int
+ step int
+}
+
+func shortestPath(grid [][]int, k int) int {
+ queue, m, n := []pos{}, len(grid), len(grid[0])
+ visitor := make([][][]int, m)
+ if len(grid) == 1 && len(grid[0]) == 1 {
+ return 0
+ }
+ for i := 0; i < m; i++ {
+ visitor[i] = make([][]int, n)
+ for j := 0; j < n; j++ {
+ visitor[i][j] = make([]int, k+1)
+ }
+ }
+ visitor[0][0][0] = 1
+ queue = append(queue, pos{x: 0, y: 0, obstacle: 0, step: 0})
+ for len(queue) > 0 {
+ size := len(queue)
+ for size > 0 {
+ size--
+ node := queue[0]
+ queue = queue[1:]
+ for i := 0; i < len(dir); i++ {
+ newX := node.x + dir[i][0]
+ newY := node.y + dir[i][1]
+ if newX == m-1 && newY == n-1 {
+ if node.obstacle != 0 {
+ if node.obstacle <= k {
+ return node.step + 1
+ } else {
+ continue
+ }
+ }
+ return node.step + 1
+ }
+ if isInBoard(grid, newX, newY) {
+ if grid[newX][newY] == 1 {
+ if node.obstacle+1 <= k && visitor[newX][newY][node.obstacle+1] != 1 {
+ queue = append(queue, pos{x: newX, y: newY, obstacle: node.obstacle + 1, step: node.step + 1})
+ visitor[newX][newY][node.obstacle+1] = 1
+ }
+ } else {
+ if node.obstacle <= k && visitor[newX][newY][node.obstacle] != 1 {
+ queue = append(queue, pos{x: newX, y: newY, obstacle: node.obstacle, step: node.step + 1})
+ visitor[newX][newY][node.obstacle] = 1
+ }
+ }
+
+ }
+ }
+ }
+ }
+ return -1
+}
+
+func isInBoard(board [][]int, x, y int) bool {
+ return x >= 0 && x < len(board) && y >= 0 && y < len(board[0])
+}
diff --git a/leetcode/1293.Shortest-Path-in-a-Grid-with-Obstacles-Elimination/1293. Shortest Path in a Grid with Obstacles Elimination_test.go b/leetcode/1293.Shortest-Path-in-a-Grid-with-Obstacles-Elimination/1293. Shortest Path in a Grid with Obstacles Elimination_test.go
new file mode 100644
index 000000000..c7e4c68dd
--- /dev/null
+++ b/leetcode/1293.Shortest-Path-in-a-Grid-with-Obstacles-Elimination/1293. Shortest Path in a Grid with Obstacles Elimination_test.go
@@ -0,0 +1,73 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question1293 struct {
+ para1293
+ ans1293
+}
+
+// para 是参数
+// one 代表第一个参数
+type para1293 struct {
+ grid [][]int
+ k int
+}
+
+// ans 是答案
+// one 代表第一个答案
+type ans1293 struct {
+ one int
+}
+
+func Test_Problem1293(t *testing.T) {
+
+ qs := []question1293{
+
+ {
+ para1293{[][]int{
+ {0, 0, 0},
+ }, 1},
+ ans1293{2},
+ },
+
+ {
+ para1293{[][]int{
+ {0, 1, 1}, {0, 1, 1}, {0, 0, 0}, {0, 1, 0}, {0, 1, 0},
+ }, 2},
+ ans1293{6},
+ },
+
+ {
+ para1293{[][]int{
+ {0, 0, 0}, {1, 1, 0}, {0, 0, 0}, {0, 1, 1}, {0, 0, 0},
+ }, 1},
+ ans1293{6},
+ },
+
+ {
+ para1293{[][]int{
+ {0, 1, 1}, {1, 1, 1}, {1, 0, 0},
+ }, 1},
+ ans1293{-1},
+ },
+
+ {
+ para1293{[][]int{
+ {0},
+ }, 1},
+ ans1293{0},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 1293------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans1293, q.para1293
+ fmt.Printf("【input】:%v 【output】:%v\n", p, shortestPath(p.grid, p.k))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/1293.Shortest-Path-in-a-Grid-with-Obstacles-Elimination/README.md b/leetcode/1293.Shortest-Path-in-a-Grid-with-Obstacles-Elimination/README.md
new file mode 100644
index 000000000..0ef3fc05e
--- /dev/null
+++ b/leetcode/1293.Shortest-Path-in-a-Grid-with-Obstacles-Elimination/README.md
@@ -0,0 +1,131 @@
+# [1293. Shortest Path in a Grid with Obstacles Elimination](https://leetcode.com/problems/shortest-path-in-a-grid-with-obstacles-elimination/)
+
+
+
+## 题目
+
+You are given an m x n integer matrix grid where each cell is either 0 (empty) or 1 (obstacle). You can move up, down, left, or right from and to an empty cell in one step.
+
+Return the minimum number of steps to walk from the upper left corner (0, 0) to the lower right corner (m - 1, n - 1) given that you can eliminate at most k obstacles. If it is not possible to find such walk return -1.
+
+
+
+Example 1:
+
+
+
+
+
+```
+Input: grid = [[0,0,0],[1,1,0],[0,0,0],[0,1,1],[0,0,0]], k = 1
+Output: 6
+Explanation:
+The shortest path without eliminating any obstacle is 10.
+The shortest path with one obstacle elimination at position (3,2) is 6. Such path is (0,0) -> (0,1) -> (0,2) -> (1,2) -> (2,2) -> (3,2) -> (4,2).
+```
+
+Example 2:
+
+
+
+```
+Input: grid = [[0,1,1],[1,1,1],[1,0,0]], k = 1
+Output: -1
+Explanation: We need to eliminate at least two obstacles to find such a walk.
+```
+
+Constraints:
+
+- m == grid.length
+- n == grid[i].length
+- 1 <= m, n <= 40
+- 1 <= k <= m * n
+- grid[i][j] is either 0 or 1.
+- grid[0][0] == grid[m - 1][n - 1] == 0
+
+
+
+## 题目大意
+
+给你一个 m * n 的网格，其中每个单元格不是 0（空）就是 1（障碍物）。每一步，您都可以在空白单元格中上、下、左、右移动。
+
+如果您 最多 可以消除 k 个障碍物，请找出从左上角 (0, 0) 到右下角 (m-1, n-1) 的最短路径，并返回通过该路径所需的步数。如果找不到这样的路径，则返回 -1 。
+
+
+## 解题思路
+
+使用 BFS 遍历棋盘。这题比普通可达性问题多了一个障碍物的限制。这个也不难。每个点往周边四个方向扩展的时候，如果遇到障碍物，先算上这个障碍物，障碍物累积总个数小于 K 的时候，从障碍物的这个格子继续开始遍历。如果没有遇到障碍物，判断当前累积障碍物个数是否已经小于 K 个，如果小于 K 便继续遍历。如果大于 K，便终止此轮遍历。
+
+## 代码
+
+```go
+var dir = [][]int{
+ {-1, 0},
+ {0, 1},
+ {1, 0},
+ {0, -1},
+}
+
+type pos struct {
+ x, y int
+ obstacle int
+ step int
+}
+
+func shortestPath(grid [][]int, k int) int {
+ queue, m, n := []pos{}, len(grid), len(grid[0])
+ visitor := make([][][]int, m)
+ if len(grid) == 1 && len(grid[0]) == 1 {
+ return 0
+ }
+ for i := 0; i < m; i++ {
+ visitor[i] = make([][]int, n)
+ for j := 0; j < n; j++ {
+ visitor[i][j] = make([]int, k+1)
+ }
+ }
+ visitor[0][0][0] = 1
+ queue = append(queue, pos{x: 0, y: 0, obstacle: 0, step: 0})
+ for len(queue) > 0 {
+ size := len(queue)
+ for size > 0 {
+ size--
+ node := queue[0]
+ queue = queue[1:]
+ for i := 0; i < len(dir); i++ {
+ newX := node.x + dir[i][0]
+ newY := node.y + dir[i][1]
+ if newX == m-1 && newY == n-1 {
+ if node.obstacle != 0 {
+ if node.obstacle <= k {
+ return node.step + 1
+ } else {
+ continue
+ }
+ }
+ return node.step + 1
+ }
+ if isInBoard(grid, newX, newY) {
+ if grid[newX][newY] == 1 {
+ if node.obstacle+1 <= k && visitor[newX][newY][node.obstacle+1] != 1 {
+ queue = append(queue, pos{x: newX, y: newY, obstacle: node.obstacle + 1, step: node.step + 1})
+ visitor[newX][newY][node.obstacle+1] = 1
+ }
+ } else {
+ if node.obstacle <= k && visitor[newX][newY][node.obstacle] != 1 {
+ queue = append(queue, pos{x: newX, y: newY, obstacle: node.obstacle, step: node.step + 1})
+ visitor[newX][newY][node.obstacle] = 1
+ }
+ }
+
+ }
+ }
+ }
+ }
+ return -1
+}
+
+func isInBoard(board [][]int, x, y int) bool {
+ return x >= 0 && x < len(board) && y >= 0 && y < len(board[0])
+}
+```
\ No newline at end of file
diff --git a/leetcode/1296.Divide-Array-in-Sets-of-K-Consecutive-Numbers/1296.Divide Array in Sets of K Consecutive Numbers.go b/leetcode/1296.Divide-Array-in-Sets-of-K-Consecutive-Numbers/1296.Divide Array in Sets of K Consecutive Numbers.go
new file mode 100644
index 000000000..22663df49
--- /dev/null
+++ b/leetcode/1296.Divide-Array-in-Sets-of-K-Consecutive-Numbers/1296.Divide Array in Sets of K Consecutive Numbers.go
@@ -0,0 +1,23 @@
+package leetcode
+
+import "sort"
+
+func isPossibleDivide(nums []int, k int) bool {
+ mp := make(map[int]int)
+ for _, v := range nums {
+ mp[v] += 1
+ }
+ sort.Ints(nums)
+ for _, num := range nums {
+ if mp[num] == 0 {
+ continue
+ }
+ for diff := 0; diff < k; diff++ {
+ if mp[num+diff] == 0 {
+ return false
+ }
+ mp[num+diff] -= 1
+ }
+ }
+ return true
+}
diff --git a/leetcode/1296.Divide-Array-in-Sets-of-K-Consecutive-Numbers/1296.Divide Array in Sets of K Consecutive Numbers_test.go b/leetcode/1296.Divide-Array-in-Sets-of-K-Consecutive-Numbers/1296.Divide Array in Sets of K Consecutive Numbers_test.go
new file mode 100644
index 000000000..ac0630695
--- /dev/null
+++ b/leetcode/1296.Divide-Array-in-Sets-of-K-Consecutive-Numbers/1296.Divide Array in Sets of K Consecutive Numbers_test.go
@@ -0,0 +1,51 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question1296 struct {
+ para1296
+ ans1296
+}
+
+// para 是参数
+type para1296 struct {
+ nums []int
+ k int
+}
+
+// ans 是答案
+type ans1296 struct {
+ ans bool
+}
+
+func Test_Problem1296(t *testing.T) {
+
+ qs := []question1296{
+
+ {
+ para1296{[]int{1, 2, 3, 3, 4, 4, 5, 6}, 4},
+ ans1296{true},
+ },
+
+ {
+ para1296{[]int{3, 2, 1, 2, 3, 4, 3, 4, 5, 9, 10, 11}, 3},
+ ans1296{true},
+ },
+
+ {
+ para1296{[]int{1, 2, 3, 4}, 3},
+ ans1296{false},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 1296------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans1296, q.para1296
+ fmt.Printf("【input】:%v 【output】:%v\n", p, isPossibleDivide(p.nums, p.k))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/1296.Divide-Array-in-Sets-of-K-Consecutive-Numbers/README.md b/leetcode/1296.Divide-Array-in-Sets-of-K-Consecutive-Numbers/README.md
new file mode 100644
index 000000000..cd644c590
--- /dev/null
+++ b/leetcode/1296.Divide-Array-in-Sets-of-K-Consecutive-Numbers/README.md
@@ -0,0 +1,72 @@
+# [1296. Divide Array in Sets of K Consecutive Numbers](https://leetcode.com/problems/divide-array-in-sets-of-k-consecutive-numbers/)
+
+## 题目
+
+Given an array of integers nums and a positive integer k, check whether it is possible to divide this array into sets of k consecutive numbers.
+
+Return true if it is possible. Otherwise, return false.
+
+**Example 1**:
+
+ Input: nums = [1,2,3,3,4,4,5,6], k = 4
+ Output: true
+ Explanation: Array can be divided into [1,2,3,4] and [3,4,5,6].
+
+**Example 2**:
+
+ Input: nums = [3,2,1,2,3,4,3,4,5,9,10,11], k = 3
+ Output: true
+ Explanation: Array can be divided into [1,2,3] , [2,3,4] , [3,4,5] and [9,10,11].
+
+**Example 3**:
+
+ Input: nums = [1,2,3,4], k = 3
+ Output: false
+ Explanation: Each array should be divided in subarrays of size 3.
+
+**Constraints:**
+
+- 1 <= k <= nums.length <= 100000
+- 1 <= nums[i] <= 1000000000
+
+## 题目大意
+
+给你一个整数数组 nums 和一个正整数 k，请你判断是否可以把这个数组划分成一些由 k 个连续数字组成的集合。
+如果可以，请返回 true；否则，返回 false。
+
+## 解题思路
+
+贪心算法
+
+- 对nums升序排序
+- 对nums内数字进行哈希计数（key:数字，value:数量）
+- 遍历nums中的数字，以数量大于1的数字作为连续数字开头，寻找连续数字后续元素，若无法找到 k 个连续数字则返回false
+- 所有数字都能找到 k 个连续数字返回true
+
+##代码
+
+```go
+package leetcode
+
+import "sort"
+
+func isPossibleDivide(nums []int, k int) bool {
+ mp := make(map[int]int)
+ for _, v := range nums {
+ mp[v] += 1
+ }
+ sort.Ints(nums)
+ for _, num := range nums {
+ if mp[num] == 0 {
+ continue
+ }
+ for diff := 0; diff < k; diff++ {
+ if mp[num+diff] == 0 {
+ return false
+ }
+ mp[num+diff] -= 1
+ }
+ }
+ return true
+}
+```
diff --git a/leetcode/1305.All-Elements-in-Two-Binary-Search-Trees/1305. All Elements in Two Binary Search Trees.go b/leetcode/1305.All-Elements-in-Two-Binary-Search-Trees/1305. All Elements in Two Binary Search Trees.go
index 3206a1cdb..b3c1bcb7e 100644
--- a/leetcode/1305.All-Elements-in-Two-Binary-Search-Trees/1305. All Elements in Two Binary Search Trees.go
+++ b/leetcode/1305.All-Elements-in-Two-Binary-Search-Trees/1305. All Elements in Two Binary Search Trees.go
@@ -2,9 +2,7 @@ package leetcode
import (
"sort"
-)
-import (
"github.com/halfrost/LeetCode-Go/structures"
)
diff --git a/leetcode/1310.XOR-Queries-of-a-Subarray/1310. XOR Queries of a Subarray.go b/leetcode/1310.XOR-Queries-of-a-Subarray/1310. XOR Queries of a Subarray.go
new file mode 100644
index 000000000..e5da239c8
--- /dev/null
+++ b/leetcode/1310.XOR-Queries-of-a-Subarray/1310. XOR Queries of a Subarray.go
@@ -0,0 +1,17 @@
+package leetcode
+
+func xorQueries(arr []int, queries [][]int) []int {
+ xors := make([]int, len(arr))
+ xors[0] = arr[0]
+ for i := 1; i < len(arr); i++ {
+ xors[i] = arr[i] ^ xors[i-1]
+ }
+ res := make([]int, len(queries))
+ for i, q := range queries {
+ res[i] = xors[q[1]]
+ if q[0] > 0 {
+ res[i] ^= xors[q[0]-1]
+ }
+ }
+ return res
+}
diff --git a/leetcode/1310.XOR-Queries-of-a-Subarray/1310. XOR Queries of a Subarray_test.go b/leetcode/1310.XOR-Queries-of-a-Subarray/1310. XOR Queries of a Subarray_test.go
new file mode 100644
index 000000000..8066c3432
--- /dev/null
+++ b/leetcode/1310.XOR-Queries-of-a-Subarray/1310. XOR Queries of a Subarray_test.go
@@ -0,0 +1,48 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question1310 struct {
+ para1310
+ ans1310
+}
+
+// para 是参数
+// one 代表第一个参数
+type para1310 struct {
+ arr []int
+ queries [][]int
+}
+
+// ans 是答案
+// one 代表第一个答案
+type ans1310 struct {
+ one []int
+}
+
+func Test_Problem1310(t *testing.T) {
+
+ qs := []question1310{
+
+ {
+ para1310{[]int{1, 3, 4, 8}, [][]int{{0, 1}, {1, 2}, {0, 3}, {3, 3}}},
+ ans1310{[]int{2, 7, 14, 8}},
+ },
+
+ {
+ para1310{[]int{4, 8, 2, 10}, [][]int{{2, 3}, {1, 3}, {0, 0}, {0, 3}}},
+ ans1310{[]int{8, 0, 4, 4}},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 1310------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans1310, q.para1310
+ fmt.Printf("【input】:%v 【output】:%v\n", p, xorQueries(p.arr, p.queries))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/1310.XOR-Queries-of-a-Subarray/README.md b/leetcode/1310.XOR-Queries-of-a-Subarray/README.md
new file mode 100644
index 000000000..7babbbd79
--- /dev/null
+++ b/leetcode/1310.XOR-Queries-of-a-Subarray/README.md
@@ -0,0 +1,75 @@
+# [1310. XOR Queries of a Subarray](https://leetcode.com/problems/xor-queries-of-a-subarray/)
+
+
+## 题目
+
+Given the array `arr` of positive integers and the array `queries` where `queries[i] = [Li,Ri]`, for each query `i` compute the **XOR** of elements from `Li` to `Ri` (that is, `arr[Li]xor arr[Li+1]xor ...xor arr[Ri]`). Return an array containing the result for the given `queries`.
+
+**Example 1:**
+
+```
+Input: arr = [1,3,4,8], queries = [[0,1],[1,2],[0,3],[3,3]]
+Output: [2,7,14,8]
+Explanation:
+The binary representation of the elements in the array are:
+1 = 0001
+3 = 0011
+4 = 0100
+8 = 1000
+The XOR values for queries are:
+[0,1] = 1 xor 3 = 2
+[1,2] = 3 xor 4 = 7
+[0,3] = 1 xor 3 xor 4 xor 8 = 14
+[3,3] = 8
+
+```
+
+**Example 2:**
+
+```
+Input: arr = [4,8,2,10], queries = [[2,3],[1,3],[0,0],[0,3]]
+Output: [8,0,4,4]
+
+```
+
+**Constraints:**
+
+- `1 <= arr.length <= 3 * 10^4`
+- `1 <= arr[i] <= 10^9`
+- `1 <= queries.length <= 3 * 10^4`
+- `queries[i].length == 2`
+- `0 <= queries[i][0] <= queries[i][1] < arr.length`
+
+## 题目大意
+
+有一个正整数数组 arr，现给你一个对应的查询数组 queries，其中 queries[i] = [Li, Ri]。对于每个查询 i，请你计算从 Li 到 Ri 的 XOR 值（即 arr[Li] xor arr[Li+1] xor ... xor arr[Ri]）作为本次查询的结果。并返回一个包含给定查询 queries 所有结果的数组。
+
+## 解题思路
+
+- 此题求区间异或，很容易让人联想到区间求和。区间求和利用前缀和，可以使得 query 从 O(n) 降为 O(1)。区间异或能否也用类似前缀和的思想呢？答案是肯定的。利用异或的两个性质，x ^ x = 0，x ^ 0 = x。那么有：（由于 LaTeX 中异或符号 ^ 是特殊字符，笔者用 $\oplus$ 代替异或）
+
+ $$\begin{aligned}Query(left,right) &=arr[left] \oplus \cdots \oplus arr[right]\\&=(arr[0] \oplus \cdots \oplus arr[left-1]) \oplus (arr[0] \oplus \cdots \oplus arr[left-1]) \oplus (arr[left] \oplus \cdots \oplus arr[right])\\ &=(arr[0] \oplus \cdots \oplus arr[left-1]) \oplus (arr[0] \oplus \cdots \oplus arr[right])\\ &=xors[left] \oplus xors[right+1]\\ \end{aligned}$$
+
+ 按照这个思路解题，便可以将 query 从 O(n) 降为 O(1)，总的时间复杂度为 O(n)。
+
+## 代码
+
+```go
+package leetcode
+
+func xorQueries(arr []int, queries [][]int) []int {
+ xors := make([]int, len(arr))
+ xors[0] = arr[0]
+ for i := 1; i < len(arr); i++ {
+ xors[i] = arr[i] ^ xors[i-1]
+ }
+ res := make([]int, len(queries))
+ for i, q := range queries {
+ res[i] = xors[q[1]]
+ if q[0] > 0 {
+ res[i] ^= xors[q[0]-1]
+ }
+ }
+ return res
+}
+```
\ No newline at end of file
diff --git a/leetcode/1319.Number-of-Operations-to-Make-Network-Connected/1319. Number of Operations to Make Network Connected.go b/leetcode/1319.Number-of-Operations-to-Make-Network-Connected/1319. Number of Operations to Make Network Connected.go
new file mode 100644
index 000000000..0180e380c
--- /dev/null
+++ b/leetcode/1319.Number-of-Operations-to-Make-Network-Connected/1319. Number of Operations to Make Network Connected.go
@@ -0,0 +1,24 @@
+package leetcode
+
+import (
+ "github.com/halfrost/LeetCode-Go/template"
+)
+
+func makeConnected(n int, connections [][]int) int {
+ if n-1 > len(connections) {
+ return -1
+ }
+ uf, redundance := template.UnionFind{}, 0
+ uf.Init(n)
+ for _, connection := range connections {
+ if uf.Find(connection[0]) == uf.Find(connection[1]) {
+ redundance++
+ } else {
+ uf.Union(connection[0], connection[1])
+ }
+ }
+ if uf.TotalCount() == 1 || redundance < uf.TotalCount()-1 {
+ return 0
+ }
+ return uf.TotalCount() - 1
+}
diff --git a/leetcode/1319.Number-of-Operations-to-Make-Network-Connected/1319. Number of Operations to Make Network Connected_test.go b/leetcode/1319.Number-of-Operations-to-Make-Network-Connected/1319. Number of Operations to Make Network Connected_test.go
new file mode 100644
index 000000000..1cdd6b437
--- /dev/null
+++ b/leetcode/1319.Number-of-Operations-to-Make-Network-Connected/1319. Number of Operations to Make Network Connected_test.go
@@ -0,0 +1,63 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question1319 struct {
+ para1319
+ ans1319
+}
+
+// para 是参数
+// one 代表第一个参数
+type para1319 struct {
+ n int
+ connections [][]int
+}
+
+// ans 是答案
+// one 代表第一个答案
+type ans1319 struct {
+ one int
+}
+
+func Test_Problem1319(t *testing.T) {
+
+ qs := []question1319{
+
+ {
+ para1319{4, [][]int{{0, 1}, {0, 2}, {1, 2}}},
+ ans1319{1},
+ },
+
+ {
+ para1319{6, [][]int{{0, 1}, {0, 2}, {0, 3}, {1, 2}, {1, 3}}},
+ ans1319{2},
+ },
+
+ {
+ para1319{6, [][]int{{0, 1}, {0, 2}, {0, 3}, {1, 2}}},
+ ans1319{-1},
+ },
+
+ {
+ para1319{5, [][]int{{0, 1}, {0, 2}, {3, 4}, {2, 3}}},
+ ans1319{0},
+ },
+
+ {
+ para1319{12, [][]int{{1, 5}, {1, 7}, {1, 2}, {1, 4}, {3, 7}, {4, 7}, {3, 5}, {0, 6}, {0, 1}, {0, 4}, {2, 6}, {0, 3}, {0, 2}}},
+ ans1319{4},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 1319------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans1319, q.para1319
+ fmt.Printf("【input】:%v 【output】:%v\n", p, makeConnected(p.n, p.connections))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/1319.Number-of-Operations-to-Make-Network-Connected/README.md b/leetcode/1319.Number-of-Operations-to-Make-Network-Connected/README.md
new file mode 100644
index 000000000..15232def6
--- /dev/null
+++ b/leetcode/1319.Number-of-Operations-to-Make-Network-Connected/README.md
@@ -0,0 +1,90 @@
+# [1319. Number of Operations to Make Network Connected](https://leetcode.com/problems/number-of-operations-to-make-network-connected/)
+
+
+## 题目
+
+There are `n` computers numbered from `0` to `n-1` connected by ethernet cables `connections` forming a network where `connections[i] = [a, b]` represents a connection between computers `a` and `b`. Any computer can reach any other computer directly or indirectly through the network.
+
+Given an initial computer network `connections`. You can extract certain cables between two directly connected computers, and place them between any pair of disconnected computers to make them directly connected. Return the *minimum number of times* you need to do this in order to make all the computers connected. If it's not possible, return -1.
+
+**Example 1:**
+
+
+
+```
+Input: n = 4, connections = [[0,1],[0,2],[1,2]]
+Output: 1
+Explanation: Remove cable between computer 1 and 2 and place between computers 1 and 3.
+```
+
+**Example 2:**
+
+
+
+```
+Input: n = 6, connections = [[0,1],[0,2],[0,3],[1,2],[1,3]]
+Output: 2
+```
+
+**Example 3:**
+
+```
+Input: n = 6, connections = [[0,1],[0,2],[0,3],[1,2]]
+Output: -1
+Explanation: There are not enough cables.
+```
+
+**Example 4:**
+
+```
+Input: n = 5, connections = [[0,1],[0,2],[3,4],[2,3]]
+Output: 0
+```
+
+**Constraints:**
+
+- `1 <= n <= 10^5`
+- `1 <= connections.length <= min(n*(n-1)/2, 10^5)`
+- `connections[i].length == 2`
+- `0 <= connections[i][0], connections[i][1] < n`
+- `connections[i][0] != connections[i][1]`
+- There are no repeated connections.
+- No two computers are connected by more than one cable.
+
+## 题目大意
+
+用以太网线缆将 n 台计算机连接成一个网络，计算机的编号从 0 到 n-1。线缆用 connections 表示，其中 connections[i] = [a, b] 连接了计算机 a 和 b。网络中的任何一台计算机都可以通过网络直接或者间接访问同一个网络中其他任意一台计算机。给你这个计算机网络的初始布线 connections，你可以拔开任意两台直连计算机之间的线缆，并用它连接一对未直连的计算机。请你计算并返回使所有计算机都连通所需的最少操作次数。如果不可能，则返回 -1 。
+
+## 解题思路
+
+- 很明显这题的解题思路是并查集。先将每个 connections 构建出并查集。构建中需要累加冗余的连接。例如 2 个节点已经连通，再连接这个集合中的任意 2 个节点就算冗余连接。冗余连接的线都可以移动，去连接还没有连通的节点。计算出冗余连接数，再根据并查集的集合总数，即可得出答案。
+- 这一题答案有 3 种可能。第一种，所有点都在一个集合内，即全部连通，这时输出 0 。第二种，冗余的连接不够串起所有点，这时输出 -1 。第三种情况是可以连通的情况。 m 个集合需要连通，最少需要 m - 1 条线。如果冗余连接数大于 m - 1，则输出 m - 1 即可。
+
+## 代码
+
+```go
+package leetcode
+
+import (
+ "github.com/halfrost/LeetCode-Go/template"
+)
+
+func makeConnected(n int, connections [][]int) int {
+ if n-1 > len(connections) {
+ return -1
+ }
+ uf, redundance := template.UnionFind{}, 0
+ uf.Init(n)
+ for _, connection := range connections {
+ if uf.Find(connection[0]) == uf.Find(connection[1]) {
+ redundance++
+ } else {
+ uf.Union(connection[0], connection[1])
+ }
+ }
+ if uf.TotalCount() == 1 || redundance < uf.TotalCount()-1 {
+ return 0
+ }
+ return uf.TotalCount() - 1
+}
+```
\ No newline at end of file
diff --git a/leetcode/1329.Sort-the-Matrix-Diagonally/1329. Sort the Matrix Diagonally.go b/leetcode/1329.Sort-the-Matrix-Diagonally/1329. Sort the Matrix Diagonally.go
new file mode 100644
index 000000000..23bda9c79
--- /dev/null
+++ b/leetcode/1329.Sort-the-Matrix-Diagonally/1329. Sort the Matrix Diagonally.go
@@ -0,0 +1,24 @@
+package leetcode
+
+import (
+ "sort"
+)
+
+func diagonalSort(mat [][]int) [][]int {
+ m, n, diagonalsMap := len(mat), len(mat[0]), make(map[int][]int)
+ for i := 0; i < m; i++ {
+ for j := 0; j < n; j++ {
+ diagonalsMap[i-j] = append(diagonalsMap[i-j], mat[i][j])
+ }
+ }
+ for _, v := range diagonalsMap {
+ sort.Ints(v)
+ }
+ for i := 0; i < m; i++ {
+ for j := 0; j < n; j++ {
+ mat[i][j] = diagonalsMap[i-j][0]
+ diagonalsMap[i-j] = diagonalsMap[i-j][1:]
+ }
+ }
+ return mat
+}
diff --git a/leetcode/1329.Sort-the-Matrix-Diagonally/1329. Sort the Matrix Diagonally_test.go b/leetcode/1329.Sort-the-Matrix-Diagonally/1329. Sort the Matrix Diagonally_test.go
new file mode 100644
index 000000000..21cd808e2
--- /dev/null
+++ b/leetcode/1329.Sort-the-Matrix-Diagonally/1329. Sort the Matrix Diagonally_test.go
@@ -0,0 +1,42 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question1329 struct {
+ para1329
+ ans1329
+}
+
+// para 是参数
+// one 代表第一个参数
+type para1329 struct {
+ mat [][]int
+}
+
+// ans 是答案
+// one 代表第一个答案
+type ans1329 struct {
+ one [][]int
+}
+
+func Test_Problem1329(t *testing.T) {
+
+ qs := []question1329{
+
+ {
+ para1329{[][]int{{3, 3, 1, 1}, {2, 2, 1, 2}, {1, 1, 1, 2}}},
+ ans1329{[][]int{{1, 1, 1, 1}, {1, 2, 2, 2}, {1, 2, 3, 3}}},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 1329------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans1329, q.para1329
+ fmt.Printf("【input】:%v 【output】:%v\n", p, diagonalSort(p.mat))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/1329.Sort-the-Matrix-Diagonally/README.md b/leetcode/1329.Sort-the-Matrix-Diagonally/README.md
new file mode 100644
index 000000000..2b4a52cfc
--- /dev/null
+++ b/leetcode/1329.Sort-the-Matrix-Diagonally/README.md
@@ -0,0 +1,57 @@
+# [1329. Sort the Matrix Diagonally](https://leetcode.com/problems/sort-the-matrix-diagonally/)
+
+
+## 题目
+
+A **matrix diagonal** is a diagonal line of cells starting from some cell in either the topmost row or leftmost column and going in the bottom-right direction until reaching the matrix's end. For example, the **matrix diagonal** starting from `mat[2][0]`, where `mat` is a `6 x 3` matrix, includes cells `mat[2][0]`, `mat[3][1]`, and `mat[4][2]`.
+
+Given an `m x n` matrix `mat` of integers, sort each **matrix diagonal** in ascending order and return *the resulting matrix*.
+
+**Example 1:**
+
+
+
+```
+Input: mat = [[3,3,1,1],[2,2,1,2],[1,1,1,2]]
+Output: [[1,1,1,1],[1,2,2,2],[1,2,3,3]]
+```
+
+**Constraints:**
+
+- `m == mat.length`
+- `n == mat[i].length`
+- `1 <= m, n <= 100`
+- `1 <= mat[i][j] <= 100`
+
+## 题目大意
+
+给你一个 m * n 的整数矩阵 mat ，请你将同一条对角线上的元素（从左上到右下）按升序排序后，返回排好序的矩阵。
+
+## 解题思路
+
+- 这道题思路很简单。按照对角线，把每条对角线的元素读取出来放在数组中。这里可以利用 map 保存这些数组。再将这些数组排序。最后按照对角线还原矩阵即可。
+
+## 代码
+
+```go
+package leetcode
+
+func diagonalSort(mat [][]int) [][]int {
+ m, n, diagonalsMap := len(mat), len(mat[0]), make(map[int][]int)
+ for i := 0; i < m; i++ {
+ for j := 0; j < n; j++ {
+ diagonalsMap[i-j] = append(diagonalsMap[i-j], mat[i][j])
+ }
+ }
+ for _, v := range diagonalsMap {
+ sort.Ints(v)
+ }
+ for i := 0; i < m; i++ {
+ for j := 0; j < n; j++ {
+ mat[i][j] = diagonalsMap[i-j][0]
+ diagonalsMap[i-j] = diagonalsMap[i-j][1:]
+ }
+ }
+ return mat
+}
+```
\ No newline at end of file
diff --git a/leetcode/1332.Remove-Palindromic-Subsequences/1332. Remove Palindromic Subsequences.go b/leetcode/1332.Remove-Palindromic-Subsequences/1332. Remove Palindromic Subsequences.go
new file mode 100644
index 000000000..cf21cdf72
--- /dev/null
+++ b/leetcode/1332.Remove-Palindromic-Subsequences/1332. Remove Palindromic Subsequences.go
@@ -0,0 +1,13 @@
+package leetcode
+
+func removePalindromeSub(s string) int {
+ if len(s) == 0 {
+ return 0
+ }
+ for i := 0; i < len(s)/2; i++ {
+ if s[i] != s[len(s)-1-i] {
+ return 2
+ }
+ }
+ return 1
+}
diff --git a/leetcode/1332.Remove-Palindromic-Subsequences/1332. Remove Palindromic Subsequences_test.go b/leetcode/1332.Remove-Palindromic-Subsequences/1332. Remove Palindromic Subsequences_test.go
new file mode 100644
index 000000000..458d9f877
--- /dev/null
+++ b/leetcode/1332.Remove-Palindromic-Subsequences/1332. Remove Palindromic Subsequences_test.go
@@ -0,0 +1,62 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question1332 struct {
+ para1332
+ ans1332
+}
+
+// para 是参数
+// one 代表第一个参数
+type para1332 struct {
+ s string
+}
+
+// ans 是答案
+// one 代表第一个答案
+type ans1332 struct {
+ one int
+}
+
+func Test_Problem1332(t *testing.T) {
+
+ qs := []question1332{
+
+ {
+ para1332{"ababa"},
+ ans1332{1},
+ },
+
+ {
+ para1332{"abb"},
+ ans1332{2},
+ },
+
+ {
+ para1332{"baabb"},
+ ans1332{2},
+ },
+
+ {
+ para1332{""},
+ ans1332{0},
+ },
+
+ {
+ para1332{"bbaabaaa"},
+ ans1332{2},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 1332------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans1332, q.para1332
+ fmt.Printf("【input】:%v 【output】:%v\n", p, removePalindromeSub(p.s))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/1332.Remove-Palindromic-Subsequences/README.md b/leetcode/1332.Remove-Palindromic-Subsequences/README.md
new file mode 100644
index 000000000..5a7743d6d
--- /dev/null
+++ b/leetcode/1332.Remove-Palindromic-Subsequences/README.md
@@ -0,0 +1,81 @@
+# [1332. Remove Palindromic Subsequences](https://leetcode.com/problems/remove-palindromic-subsequences/)
+
+
+## 题目
+
+Given a string `s` consisting only of letters `'a'` and `'b'`. In a single step you can remove one palindromic **subsequence** from `s`.
+
+Return the minimum number of steps to make the given string empty.
+
+A string is a subsequence of a given string, if it is generated by deleting some characters of a given string without changing its order.
+
+A string is called palindrome if is one that reads the same backward as well as forward.
+
+**Example 1:**
+
+```
+Input: s = "ababa"
+Output: 1
+Explanation: String is already palindrome
+```
+
+**Example 2:**
+
+```
+Input: s = "abb"
+Output: 2
+Explanation: "abb" -> "bb" -> "".
+Remove palindromic subsequence "a" then "bb".
+```
+
+**Example 3:**
+
+```
+Input: s = "baabb"
+Output: 2
+Explanation: "baabb" -> "b" -> "".
+Remove palindromic subsequence "baab" then "b".
+```
+
+**Example 4:**
+
+```
+Input: s = ""
+Output: 0
+```
+
+**Constraints:**
+
+- `0 <= s.length <= 1000`
+- `s` only consists of letters 'a' and 'b'
+
+## 题目大意
+
+给你一个字符串 s，它仅由字母 'a' 和 'b' 组成。每一次删除操作都可以从 s 中删除一个回文 子序列。返回删除给定字符串中所有字符（字符串为空）的最小删除次数。
+
+「子序列」定义：如果一个字符串可以通过删除原字符串某些字符而不改变原字符顺序得到，那么这个字符串就是原字符串的一个子序列。
+
+「回文」定义：如果一个字符串向后和向前读是一致的，那么这个字符串就是一个回文。
+
+## 解题思路
+
+- 笔者读完题以为是第 5 题的加强版。在字符串中每次都找到最长的回文子串删除，一直删除到找不到回文子串结束，删除的总次数 + 剩余字母数 = 最小删除次数。提交以后 `wrong answer` 了，在 `bbaabaaa` 这组测试用例出错了。如果按照找最长回文字符串的思路，先找到最长回文子串 `aabaa`，剩余 `bba`，还需要再删除 2 次，`bb` 和 `a`。总共删除次数是 3 。为什么出错误了呢？仔细再读题，题目中说的是子序列，这不是连续的，再加上这道题是 `easy` 难度，其实很简单。
+- 这道题的答案只可能是 0，1，2 。空串对应的 0 。如果有一个字母，单个字母可以构成回文，所以是 1，如果字符串长度大于等于 2，即 `a` 和 `b` 都有，第一步先删除所有 `a`，因为所有的 `a` 构成了回文子序列。第二步删除所有的 `b`，因为所有的 `b` 构成了回文子序列。经过这样两步，一定能删除所有字符。
+
+## 代码
+
+```go
+package leetcode
+
+func removePalindromeSub(s string) int {
+ if len(s) == 0 {
+ return 0
+ }
+ for i := 0; i < len(s)/2; i++ {
+ if s[i] != s[len(s)-1-i] {
+ return 2
+ }
+ }
+ return 1
+}
+```
\ No newline at end of file
diff --git a/leetcode/1337.The-K-Weakest-Rows-in-a-Matrix/1337. The K Weakest Rows in a Matrix.go b/leetcode/1337.The-K-Weakest-Rows-in-a-Matrix/1337. The K Weakest Rows in a Matrix.go
new file mode 100644
index 000000000..a774f3be0
--- /dev/null
+++ b/leetcode/1337.The-K-Weakest-Rows-in-a-Matrix/1337. The K Weakest Rows in a Matrix.go
@@ -0,0 +1,18 @@
+package leetcode
+
+func kWeakestRows(mat [][]int, k int) []int {
+ res := []int{}
+ for j := 0; j < len(mat[0]); j++ {
+ for i := 0; i < len(mat); i++ {
+ if mat[i][j] == 0 && ((j == 0) || (mat[i][j-1] != 0)) {
+ res = append(res, i)
+ }
+ }
+ }
+ for i := 0; i < len(mat); i++ {
+ if mat[i][len(mat[0])-1] == 1 {
+ res = append(res, i)
+ }
+ }
+ return res[:k]
+}
diff --git a/leetcode/1337.The-K-Weakest-Rows-in-a-Matrix/1337. The K Weakest Rows in a Matrix_test.go b/leetcode/1337.The-K-Weakest-Rows-in-a-Matrix/1337. The K Weakest Rows in a Matrix_test.go
new file mode 100644
index 000000000..2592dd5fa
--- /dev/null
+++ b/leetcode/1337.The-K-Weakest-Rows-in-a-Matrix/1337. The K Weakest Rows in a Matrix_test.go
@@ -0,0 +1,48 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question1337 struct {
+ para1337
+ ans1337
+}
+
+// para 是参数
+// one 代表第一个参数
+type para1337 struct {
+ mat [][]int
+ k int
+}
+
+// ans 是答案
+// one 代表第一个答案
+type ans1337 struct {
+ one []int
+}
+
+func Test_Problem1337(t *testing.T) {
+
+ qs := []question1337{
+
+ {
+ para1337{[][]int{{1, 1, 0, 0, 0}, {1, 1, 1, 1, 0}, {1, 0, 0, 0, 0}, {1, 1, 0, 0, 0}, {1, 1, 1, 1, 1}}, 3},
+ ans1337{[]int{2, 0, 3}},
+ },
+
+ {
+ para1337{[][]int{{1, 0, 0, 0}, {1, 1, 1, 1}, {1, 0, 0, 0}, {1, 0, 0, 0}}, 2},
+ ans1337{[]int{0, 2}},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 1337------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans1337, q.para1337
+ fmt.Printf("【input】:%v 【output】:%v\n", p, kWeakestRows(p.mat, p.k))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/1337.The-K-Weakest-Rows-in-a-Matrix/README.md b/leetcode/1337.The-K-Weakest-Rows-in-a-Matrix/README.md
new file mode 100644
index 000000000..003048edb
--- /dev/null
+++ b/leetcode/1337.The-K-Weakest-Rows-in-a-Matrix/README.md
@@ -0,0 +1,90 @@
+# [1337. The K Weakest Rows in a Matrix](https://leetcode.com/problems/the-k-weakest-rows-in-a-matrix/)
+
+
+## 题目
+
+Given a `m * n` matrix `mat` of *ones* (representing soldiers) and *zeros* (representing civilians), return the indexes of the `k` weakest rows in the matrix ordered from the weakest to the strongest.
+
+A row ***i*** is weaker than row ***j***, if the number of soldiers in row ***i*** is less than the number of soldiers in row ***j***, or they have the same number of soldiers but ***i*** is less than ***j***. Soldiers are **always** stand in the frontier of a row, that is, always *ones* may appear first and then *zeros*.
+
+**Example 1:**
+
+```
+Input: mat =
+[[1,1,0,0,0],
+ [1,1,1,1,0],
+ [1,0,0,0,0],
+ [1,1,0,0,0],
+ [1,1,1,1,1]],
+k = 3
+Output: [2,0,3]
+Explanation:
+The number of soldiers for each row is:
+row 0 -> 2
+row 1 -> 4
+row 2 -> 1
+row 3 -> 2
+row 4 -> 5
+Rows ordered from the weakest to the strongest are [2,0,3,1,4]
+
+```
+
+**Example 2:**
+
+```
+Input: mat =
+[[1,0,0,0],
+ [1,1,1,1],
+ [1,0,0,0],
+ [1,0,0,0]],
+k = 2
+Output: [0,2]
+Explanation:
+The number of soldiers for each row is:
+row 0 -> 1
+row 1 -> 4
+row 2 -> 1
+row 3 -> 1
+Rows ordered from the weakest to the strongest are [0,2,3,1]
+
+```
+
+**Constraints:**
+
+- `m == mat.length`
+- `n == mat[i].length`
+- `2 <= n, m <= 100`
+- `1 <= k <= m`
+- `matrix[i][j]` is either 0 **or** 1.
+
+## 题目大意
+
+给你一个大小为 m * n 的矩阵 mat，矩阵由若干军人和平民组成，分别用 1 和 0 表示。请你返回矩阵中战斗力最弱的 k 行的索引，按从最弱到最强排序。如果第 i 行的军人数量少于第 j 行，或者两行军人数量相同但 i 小于 j，那么我们认为第 i 行的战斗力比第 j 行弱。军人 总是 排在一行中的靠前位置，也就是说 1 总是出现在 0 之前。
+
+## 解题思路
+
+- 简单题。第一个能想到的解题思路是，先统计每一行 1 的个数，然后将结果进行排序，按照 1 的个数从小到大排序，如果 1 的个数相同，再按照行号从小到大排序。排好序的数组取出前 K 位即为答案。
+- 此题还有第二种解法。在第一种解法中，并没有用到题目中“军人 总是 排在一行中的靠前位置，也就是说 1 总是出现在 0 之前。”这一条件。由于有了这个条件，使得如果按照列去遍历，最先出现 0 的行，则是最弱的行。行号小的先被遍历到，所以相同数量 1 的行，行号小的会排在前面。最后记得再添加上全 1 的行。同样，最终输出取出前 K 位即为答案。此题解法二才是最优雅最高效的解法。
+
+## 代码
+
+```go
+package leetcode
+
+func kWeakestRows(mat [][]int, k int) []int {
+ res := []int{}
+ for j := 0; j < len(mat[0]); j++ {
+ for i := 0; i < len(mat); i++ {
+ if mat[i][j] == 0 && ((j == 0) || (mat[i][j-1] != 0)) {
+ res = append(res, i)
+ }
+ }
+ }
+ for i := 0; i < len(mat); i++ {
+ if mat[i][len(mat[0])-1] == 1 {
+ res = append(res, i)
+ }
+ }
+ return res[:k]
+}
+```
\ No newline at end of file
diff --git a/leetcode/1353.Maximum-Number-of-Events-That-Can-Be-Attended/1353. Maximum Number of Events That Can Be Attended.go b/leetcode/1353.Maximum-Number-of-Events-That-Can-Be-Attended/1353. Maximum Number of Events That Can Be Attended.go
new file mode 100644
index 000000000..67700713e
--- /dev/null
+++ b/leetcode/1353.Maximum-Number-of-Events-That-Can-Be-Attended/1353. Maximum Number of Events That Can Be Attended.go
@@ -0,0 +1,35 @@
+package leetcode
+
+import (
+ "sort"
+)
+
+func maxEvents(events [][]int) int {
+ sort.Slice(events, func(i, j int) bool {
+ if events[i][0] == events[j][0] {
+ return events[i][1] < events[j][1]
+ }
+ return events[i][0] < events[j][0]
+ })
+ attended, current := 1, events[0]
+ for i := 1; i < len(events); i++ {
+ prev, event := events[i-1], events[i]
+ if event[0] == prev[0] && event[1] == prev[1] && event[1] == event[0] {
+ continue
+ }
+ start, end := max(current[0], event[0]-1), max(current[1], event[1])
+ if end-start > 0 {
+ current[0] = start + 1
+ current[1] = end
+ attended++
+ }
+ }
+ return attended
+}
+
+func max(a, b int) int {
+ if a > b {
+ return a
+ }
+ return b
+}
diff --git a/leetcode/1353.Maximum-Number-of-Events-That-Can-Be-Attended/1353. Maximum Number of Events That Can Be Attended_test.go b/leetcode/1353.Maximum-Number-of-Events-That-Can-Be-Attended/1353. Maximum Number of Events That Can Be Attended_test.go
new file mode 100644
index 000000000..89798e1f9
--- /dev/null
+++ b/leetcode/1353.Maximum-Number-of-Events-That-Can-Be-Attended/1353. Maximum Number of Events That Can Be Attended_test.go
@@ -0,0 +1,67 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question1353 struct {
+ para1353
+ ans1353
+}
+
+// para 是参数
+// one 代表第一个参数
+type para1353 struct {
+ events [][]int
+}
+
+// ans 是答案
+// one 代表第一个答案
+type ans1353 struct {
+ one int
+}
+
+func Test_Problem1353(t *testing.T) {
+
+ qs := []question1353{
+
+ {
+ para1353{[][]int{{1, 2}, {2, 3}, {3, 4}}},
+ ans1353{3},
+ },
+
+ {
+ para1353{[][]int{{1, 4}, {4, 4}, {2, 2}, {3, 4}, {1, 1}}},
+ ans1353{4},
+ },
+
+ {
+ para1353{[][]int{{1, 100000}}},
+ ans1353{1},
+ },
+
+ {
+ para1353{[][]int{{1, 1}, {2, 2}, {1, 3}, {1, 4}, {1, 5}, {1, 6}, {1, 7}}},
+ ans1353{7},
+ },
+
+ {
+ para1353{[][]int{{1, 2}, {2, 2}, {3, 3}, {3, 4}, {3, 4}}},
+ ans1353{4},
+ },
+
+ {
+ para1353{[][]int{{1, 10}, {2, 2}, {2, 2}, {2, 2}, {2, 2}}},
+ ans1353{2},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 1353------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans1353, q.para1353
+ fmt.Printf("【input】:%v 【output】:%v\n", p, maxEvents(p.events))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/1353.Maximum-Number-of-Events-That-Can-Be-Attended/README.md b/leetcode/1353.Maximum-Number-of-Events-That-Can-Be-Attended/README.md
new file mode 100644
index 000000000..3ac1505cc
--- /dev/null
+++ b/leetcode/1353.Maximum-Number-of-Events-That-Can-Be-Attended/README.md
@@ -0,0 +1,113 @@
+# [1353. Maximum Number of Events That Can Be Attended](https://leetcode.com/problems/maximum-number-of-events-that-can-be-attended/)
+
+
+## 题目
+
+Given an array of `events` where `events[i] = [startDayi, endDayi]`. Every event `i` starts at `startDayi` and ends at `endDayi`.
+
+You can attend an event `i` at any day `d` where `startTimei <= d <= endTimei`. Notice that you can only attend one event at any time `d`.
+
+Return *the maximum number of events* you can attend.
+
+**Example 1:**
+
+
+
+```
+Input: events = [[1,2],[2,3],[3,4]]
+Output: 3
+Explanation: You can attend all the three events.
+One way to attend them all is as shown.
+Attend the first event on day 1.
+Attend the second event on day 2.
+Attend the third event on day 3.
+
+```
+
+**Example 2:**
+
+```
+Input: events= [[1,2],[2,3],[3,4],[1,2]]
+Output: 4
+
+```
+
+**Example 3:**
+
+```
+Input: events = [[1,4],[4,4],[2,2],[3,4],[1,1]]
+Output: 4
+
+```
+
+**Example 4:**
+
+```
+Input: events = [[1,100000]]
+Output: 1
+
+```
+
+**Example 5:**
+
+```
+Input: events = [[1,1],[1,2],[1,3],[1,4],[1,5],[1,6],[1,7]]
+Output: 7
+
+```
+
+**Constraints:**
+
+- `1 <= events.length <= 10^5`
+- `events[i].length == 2`
+- `1 <= startDayi <= endDayi <= 10^5`
+
+## 题目大意
+
+给你一个数组 events，其中 events[i] = [startDayi, endDayi] ，表示会议 i 开始于 startDayi ，结束于 endDayi 。你可以在满足 startDayi <= d <= endDayi 中的任意一天 d 参加会议 i 。注意，一天只能参加一个会议。请你返回你可以参加的 最大 会议数目。
+
+## 解题思路
+
+- 关于会议安排，活动安排这类题，第一直觉是贪心问题。先按照会议开始时间从小到大排序，如果开始时间相同，再按照结束时间从小到大排序。贪心策略是，优先选择参加早结束的会议。因为一个结束时间晚的会议，代表这个会议持续时间长，先参加马上要结束的会议，这样可以参加更多的会议。
+- 注意题目给的数据代表的是天数。比较大小的时候最好转换成坐标轴上的坐标点。例如 [1,2] 代表这个会议持续 2 天，如果在坐标轴上表示，是 [0,2]，0-1 表示第一天，1-2 表示第二天。所以比较会议时需要把开始时间减一。选定了这个会议以后记得要把这一天排除，例如选择了第二天，那么下次对比起始时间需要从坐标 2 开始，因为第二天的时间范围是 1-2，所以下一轮比较会议前需要把开始时间加一。从左往右依次扫描各个会议时间段，选择结束时间大于起始时间的会议，不断累加次数，扫描完所有会议，最终结果即为可参加的最大会议数。
+- 测试数据中有一组很恶心的数据，见 test 文件中最后一组数据。这组数据在同一天叠加了多个会议，并且起始时间完全一致。这种特殊情况需要加判断条件排除，见下面代码 continue 条件。
+
+## 代码
+
+```go
+package leetcode
+
+import (
+ "sort"
+)
+
+func maxEvents(events [][]int) int {
+ sort.Slice(events, func(i, j int) bool {
+ if events[i][0] == events[j][0] {
+ return events[i][1] < events[j][1]
+ }
+ return events[i][0] < events[j][0]
+ })
+ attended, current := 1, events[0]
+ for i := 1; i < len(events); i++ {
+ prev, event := events[i-1], events[i]
+ if event[0] == prev[0] && event[1] == prev[1] && event[1] == event[0] {
+ continue
+ }
+ start, end := max(current[0], event[0]-1), max(current[1], event[1])
+ if end-start > 0 {
+ current[0] = start + 1
+ current[1] = end
+ attended++
+ }
+ }
+ return attended
+}
+
+func max(a, b int) int {
+ if a > b {
+ return a
+ }
+ return b
+}
+```
\ No newline at end of file
diff --git a/leetcode/1383.Maximum-Performance-of-a-Team/1383. Maximum Performance of a Team.go b/leetcode/1383.Maximum-Performance-of-a-Team/1383. Maximum Performance of a Team.go
new file mode 100644
index 000000000..db69d3781
--- /dev/null
+++ b/leetcode/1383.Maximum-Performance-of-a-Team/1383. Maximum Performance of a Team.go
@@ -0,0 +1,48 @@
+package leetcode
+
+import (
+ "container/heap"
+ "sort"
+)
+
+func maxPerformance(n int, speed []int, efficiency []int, k int) int {
+ indexes := make([]int, n)
+ for i := range indexes {
+ indexes[i] = i
+ }
+ sort.Slice(indexes, func(i, j int) bool {
+ return efficiency[indexes[i]] > efficiency[indexes[j]]
+ })
+ ph := speedHeap{}
+ heap.Init(&ph)
+ speedSum := 0
+ var max int64
+ for _, index := range indexes {
+ if ph.Len() == k {
+ speedSum -= heap.Pop(&ph).(int)
+ }
+ speedSum += speed[index]
+ heap.Push(&ph, speed[index])
+ max = Max(max, int64(speedSum)*int64(efficiency[index]))
+ }
+ return int(max % (1e9 + 7))
+}
+
+type speedHeap []int
+
+func (h speedHeap) Less(i, j int) bool { return h[i] < h[j] }
+func (h speedHeap) Swap(i, j int) { h[i], h[j] = h[j], h[i] }
+func (h speedHeap) Len() int { return len(h) }
+func (h *speedHeap) Push(x interface{}) { *h = append(*h, x.(int)) }
+func (h *speedHeap) Pop() interface{} {
+ res := (*h)[len(*h)-1]
+ *h = (*h)[:h.Len()-1]
+ return res
+}
+
+func Max(a, b int64) int64 {
+ if a > b {
+ return a
+ }
+ return b
+}
diff --git a/leetcode/1383.Maximum-Performance-of-a-Team/1383. Maximum Performance of a Team_test.go b/leetcode/1383.Maximum-Performance-of-a-Team/1383. Maximum Performance of a Team_test.go
new file mode 100644
index 000000000..0caa6af08
--- /dev/null
+++ b/leetcode/1383.Maximum-Performance-of-a-Team/1383. Maximum Performance of a Team_test.go
@@ -0,0 +1,55 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question1383 struct {
+ para1383
+ ans1383
+}
+
+// para 是参数
+// one 代表第一个参数
+type para1383 struct {
+ n int
+ speed []int
+ efficiency []int
+ k int
+}
+
+// ans 是答案
+// one 代表第一个答案
+type ans1383 struct {
+ one int
+}
+
+func Test_Problem1383(t *testing.T) {
+
+ qs := []question1383{
+
+ {
+ para1383{6, []int{2, 10, 3, 1, 5, 8}, []int{5, 4, 3, 9, 7, 2}, 2},
+ ans1383{60},
+ },
+
+ {
+ para1383{6, []int{2, 10, 3, 1, 5, 8}, []int{5, 4, 3, 9, 7, 2}, 3},
+ ans1383{68},
+ },
+
+ {
+ para1383{6, []int{2, 10, 3, 1, 5, 8}, []int{5, 4, 3, 9, 7, 2}, 4},
+ ans1383{72},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 1383------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans1383, q.para1383
+ fmt.Printf("【input】:%v 【output】:%v\n", p, maxPerformance(p.n, p.speed, p.efficiency, p.k))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/1383.Maximum-Performance-of-a-Team/README.md b/leetcode/1383.Maximum-Performance-of-a-Team/README.md
new file mode 100644
index 000000000..ce941cfd2
--- /dev/null
+++ b/leetcode/1383.Maximum-Performance-of-a-Team/README.md
@@ -0,0 +1,105 @@
+# [1383. Maximum Performance of a Team](https://leetcode.com/problems/maximum-performance-of-a-team/)
+
+## 题目
+
+You are given two integers `n` and `k` and two integer arrays `speed` and `efficiency` both of length `n`. There are `n` engineers numbered from `1` to `n`. `speed[i]` and `efficiency[i]` represent the speed and efficiency of the `ith` engineer respectively.
+
+Choose **at most** `k` different engineers out of the `n` engineers to form a team with the maximum **performance**.
+
+The performance of a team is the sum of their engineers' speeds multiplied by the minimum efficiency among their engineers.
+
+Return *the maximum performance of this team*. Since the answer can be a huge number, return it **modulo** `109 + 7`.
+
+**Example 1:**
+
+```
+Input: n = 6, speed = [2,10,3,1,5,8], efficiency = [5,4,3,9,7,2], k = 2
+Output: 60
+Explanation:
+We have the maximum performance of the team by selecting engineer 2 (with speed=10 and efficiency=4) and engineer 5 (with speed=5 and efficiency=7). That is, performance = (10 + 5) * min(4, 7) = 60.
+```
+
+**Example 2:**
+
+```
+Input: n = 6, speed = [2,10,3,1,5,8], efficiency = [5,4,3,9,7,2], k = 3
+Output: 68
+Explanation:
+This is the same example as the first but k = 3. We can select engineer 1, engineer 2 and engineer 5 to get the maximum performance of the team. That is, performance = (2 + 10 + 5) * min(5, 4, 7) = 68.
+```
+
+**Example 3:**
+
+```
+Input: n = 6, speed = [2,10,3,1,5,8], efficiency = [5,4,3,9,7,2], k = 4
+Output: 72
+```
+
+**Constraints:**
+
+- `1 <= <= k <= n <= 105`
+- `speed.length == n`
+- `efficiency.length == n`
+- `1 <= speed[i] <= 105`
+- `1 <= efficiency[i] <= 108`
+
+## 题目大意
+
+公司有编号为 1 到 n 的 n 个工程师，给你两个数组 speed 和 efficiency ，其中 speed[i] 和 efficiency[i] 分别代表第 i 位工程师的速度和效率。请你返回由最多 k 个工程师组成的 最大团队表现值 ，由于答案可能很大，请你返回结果对 10^9 + 7 取余后的结果。团队表现值 的定义为：一个团队中「所有工程师速度的和」乘以他们「效率值中的最小值」。
+
+## 解题思路
+
+- 题目要求返回最大团队表现值，表现值需要考虑速度的累加和，和效率的最小值。即使速度快，效率的最小值很小，总的表现值还是很小。先将效率从大到小排序。从效率高的工程师开始选起，遍历过程中维护一个大小为 k 的速度最小堆。每次遍历都计算一次团队最大表现值。扫描完成，最大团队表现值也筛选出来了。具体实现见下面的代码。
+
+## 代码
+
+```go
+package leetcode
+
+import (
+ "container/heap"
+ "sort"
+)
+
+func maxPerformance(n int, speed []int, efficiency []int, k int) int {
+ indexes := make([]int, n)
+ for i := range indexes {
+ indexes[i] = i
+ }
+ sort.Slice(indexes, func(i, j int) bool {
+ return efficiency[indexes[i]] > efficiency[indexes[j]]
+ })
+ ph := speedHeap{}
+ heap.Init(&ph)
+ speedSum := 0
+ var max int64
+ for _, index := range indexes {
+ if ph.Len() == k {
+ speedSum -= heap.Pop(&ph).(int)
+ }
+ speedSum += speed[index]
+ heap.Push(&ph, speed[index])
+ max = Max(max, int64(speedSum)*int64(efficiency[index]))
+ }
+ return int(max % (1e9 + 7))
+}
+
+type speedHeap []int
+
+func (h speedHeap) Less(i, j int) bool { return h[i] < h[j] }
+func (h speedHeap) Swap(i, j int) { h[i], h[j] = h[j], h[i] }
+func (h speedHeap) Len() int { return len(h) }
+func (h *speedHeap) Push(x interface{}) { *h = append(*h, x.(int)) }
+func (h *speedHeap) Pop() interface{} {
+ res := (*h)[len(*h)-1]
+ *h = (*h)[:h.Len()-1]
+ return res
+}
+
+func Max(a, b int64) int64 {
+ if a > b {
+ return a
+ }
+ return b
+}
+```
\ No newline at end of file
diff --git a/leetcode/1396.Design-Underground-System/1396. Design Underground System.go b/leetcode/1396.Design-Underground-System/1396. Design Underground System.go
new file mode 100644
index 000000000..cf9db5045
--- /dev/null
+++ b/leetcode/1396.Design-Underground-System/1396. Design Underground System.go
@@ -0,0 +1,55 @@
+package leetcode
+
+type checkin struct {
+ station string
+ time int
+}
+
+type stationTime struct {
+ sum, count float64
+}
+
+type UndergroundSystem struct {
+ checkins map[int]*checkin
+ stationTimes map[string]map[string]*stationTime
+}
+
+func Constructor() UndergroundSystem {
+ return UndergroundSystem{
+ make(map[int]*checkin),
+ make(map[string]map[string]*stationTime),
+ }
+}
+
+func (s *UndergroundSystem) CheckIn(id int, stationName string, t int) {
+ s.checkins[id] = &checkin{stationName, t}
+}
+
+func (s *UndergroundSystem) CheckOut(id int, stationName string, t int) {
+ checkin := s.checkins[id]
+ destination := s.stationTimes[checkin.station]
+ if destination == nil {
+ s.stationTimes[checkin.station] = make(map[string]*stationTime)
+ }
+ st := s.stationTimes[checkin.station][stationName]
+ if st == nil {
+ st = new(stationTime)
+ s.stationTimes[checkin.station][stationName] = st
+ }
+ st.sum += float64(t - checkin.time)
+ st.count++
+ delete(s.checkins, id)
+}
+
+func (s *UndergroundSystem) GetAverageTime(startStation string, endStation string) float64 {
+ st := s.stationTimes[startStation][endStation]
+ return st.sum / st.count
+}
+
+/**
+ * Your UndergroundSystem object will be instantiated and called as such:
+ * obj := Constructor();
+ * obj.CheckIn(id,stationName,t);
+ * obj.CheckOut(id,stationName,t);
+ * param_3 := obj.GetAverageTime(startStation,endStation);
+ */
diff --git a/leetcode/1396.Design-Underground-System/1396. Design Underground System_test.go b/leetcode/1396.Design-Underground-System/1396. Design Underground System_test.go
new file mode 100644
index 000000000..fc7e521c7
--- /dev/null
+++ b/leetcode/1396.Design-Underground-System/1396. Design Underground System_test.go
@@ -0,0 +1,32 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+func Test_Problem(t *testing.T) {
+ undergroundSystem := Constructor()
+ undergroundSystem.CheckIn(45, "Leyton", 3)
+ undergroundSystem.CheckIn(32, "Paradise", 8)
+ undergroundSystem.CheckIn(27, "Leyton", 10)
+ undergroundSystem.CheckOut(45, "Waterloo", 15)
+ undergroundSystem.CheckOut(27, "Waterloo", 20)
+ undergroundSystem.CheckOut(32, "Cambridge", 22)
+ fmt.Println("Output: ", undergroundSystem.GetAverageTime("Paradise", "Cambridge")) // return 14.00000. There was only one travel from "Paradise" (at time 8) to "Cambridge" (at time 22)
+ fmt.Println("Output: ", undergroundSystem.GetAverageTime("Leyton", "Waterloo")) // return 11.00000. There were two travels from "Leyton" to "Waterloo", a customer with id=45 from time=3 to time=15 and a customer with id=27 from time=10 to time=20. So the average time is ( (15-3) + (20-10) ) / 2 = 11.00000
+ undergroundSystem.CheckIn(10, "Leyton", 24)
+ fmt.Println("Output: ", undergroundSystem.GetAverageTime("Leyton", "Waterloo")) // return 11.00000
+ undergroundSystem.CheckOut(10, "Waterloo", 38)
+ fmt.Println("Output: ", undergroundSystem.GetAverageTime("Leyton", "Waterloo")) // return 12.00000
+
+ undergroundSystem.CheckIn(10, "Leyton", 3)
+ undergroundSystem.CheckOut(10, "Paradise", 8)
+ fmt.Println("Output: ", undergroundSystem.GetAverageTime("Leyton", "Paradise")) // return 5.00000
+ undergroundSystem.CheckIn(5, "Leyton", 10)
+ undergroundSystem.CheckOut(5, "Paradise", 16)
+ fmt.Println("Output: ", undergroundSystem.GetAverageTime("Leyton", "Paradise")) // return 5.50000
+ undergroundSystem.CheckIn(2, "Leyton", 21)
+ undergroundSystem.CheckOut(2, "Paradise", 30)
+ fmt.Println("Output: ", undergroundSystem.GetAverageTime("Leyton", "Paradise")) // return 6.66667
+}
diff --git a/leetcode/1396.Design-Underground-System/README.md b/leetcode/1396.Design-Underground-System/README.md
new file mode 100644
index 000000000..3f3f83cbd
--- /dev/null
+++ b/leetcode/1396.Design-Underground-System/README.md
@@ -0,0 +1,155 @@
+# [1396. Design Underground System](https://leetcode.com/problems/design-underground-system/)
+
+
+## 题目
+
+Implement the `UndergroundSystem` class:
+
+- `void checkIn(int id, string stationName, int t)`
+ - A customer with a card id equal to `id`, gets in the station `stationName` at time `t`.
+ - A customer can only be checked into one place at a time.
+- `void checkOut(int id, string stationName, int t)`
+ - A customer with a card id equal to `id`, gets out from the station `stationName` at time `t`.
+- `double getAverageTime(string startStation, string endStation)`
+ - Returns the average time to travel between the `startStation` and the `endStation`.
+ - The average time is computed from all the previous traveling from `startStation` to `endStation` that happened **directly**.
+ - Call to `getAverageTime` is always valid.
+
+You can assume all calls to `checkIn` and `checkOut` methods are consistent. If a customer gets in at time **t1** at some station, they get out at time **t2** with **t2 > t1**. All events happen in chronological order.
+
+**Example 1:**
+
+```
+Input
+["UndergroundSystem","checkIn","checkIn","checkIn","checkOut","checkOut","checkOut","getAverageTime","getAverageTime","checkIn","getAverageTime","checkOut","getAverageTime"]
+[[],[45,"Leyton",3],[32,"Paradise",8],[27,"Leyton",10],[45,"Waterloo",15],[27,"Waterloo",20],[32,"Cambridge",22],["Paradise","Cambridge"],["Leyton","Waterloo"],[10,"Leyton",24],["Leyton","Waterloo"],[10,"Waterloo",38],["Leyton","Waterloo"]]
+
+Output
+[null,null,null,null,null,null,null,14.00000,11.00000,null,11.00000,null,12.00000]
+
+Explanation
+UndergroundSystem undergroundSystem = new UndergroundSystem();
+undergroundSystem.checkIn(45, "Leyton", 3);
+undergroundSystem.checkIn(32, "Paradise", 8);
+undergroundSystem.checkIn(27, "Leyton", 10);
+undergroundSystem.checkOut(45, "Waterloo", 15);
+undergroundSystem.checkOut(27, "Waterloo", 20);
+undergroundSystem.checkOut(32, "Cambridge", 22);
+undergroundSystem.getAverageTime("Paradise", "Cambridge"); // return 14.00000. There was only one travel from "Paradise" (at time 8) to "Cambridge" (at time 22)
+undergroundSystem.getAverageTime("Leyton", "Waterloo"); // return 11.00000. There were two travels from "Leyton" to "Waterloo", a customer with id=45 from time=3 to time=15 and a customer with id=27 from time=10 to time=20. So the average time is ( (15-3) + (20-10) ) / 2 = 11.00000
+undergroundSystem.checkIn(10, "Leyton", 24);
+undergroundSystem.getAverageTime("Leyton", "Waterloo"); // return 11.00000
+undergroundSystem.checkOut(10, "Waterloo", 38);
+undergroundSystem.getAverageTime("Leyton", "Waterloo"); // return 12.00000
+```
+
+**Example 2:**
+
+```
+Input
+["UndergroundSystem","checkIn","checkOut","getAverageTime","checkIn","checkOut","getAverageTime","checkIn","checkOut","getAverageTime"]
+[[],[10,"Leyton",3],[10,"Paradise",8],["Leyton","Paradise"],[5,"Leyton",10],[5,"Paradise",16],["Leyton","Paradise"],[2,"Leyton",21],[2,"Paradise",30],["Leyton","Paradise"]]
+
+Output
+[null,null,null,5.00000,null,null,5.50000,null,null,6.66667]
+
+Explanation
+UndergroundSystem undergroundSystem = new UndergroundSystem();
+undergroundSystem.checkIn(10, "Leyton", 3);
+undergroundSystem.checkOut(10, "Paradise", 8);
+undergroundSystem.getAverageTime("Leyton", "Paradise"); // return 5.00000
+undergroundSystem.checkIn(5, "Leyton", 10);
+undergroundSystem.checkOut(5, "Paradise", 16);
+undergroundSystem.getAverageTime("Leyton", "Paradise"); // return 5.50000
+undergroundSystem.checkIn(2, "Leyton", 21);
+undergroundSystem.checkOut(2, "Paradise", 30);
+undergroundSystem.getAverageTime("Leyton", "Paradise"); // return 6.66667
+```
+
+**Constraints:**
+
+- There will be at most `20000` operations.
+- `1 <= id, t <= 106`
+- All strings consist of uppercase and lowercase English letters, and digits.
+- `1 <= stationName.length <= 10`
+- Answers within `105` of the actual value will be accepted as correct.
+
+## 题目大意
+
+请你实现一个类 UndergroundSystem ，它支持以下 3 种方法：
+
+- 1. checkIn(int id, string stationName, int t)
+ - 编号为 id 的乘客在 t 时刻进入地铁站 stationName 。
+ - 一个乘客在同一时间只能在一个地铁站进入或者离开。
+- 2. checkOut(int id, string stationName, int t)
+ - 编号为 id 的乘客在 t 时刻离开地铁站 stationName 。
+- 3. getAverageTime(string startStation, string endStation)
+ - 返回从地铁站 startStation 到地铁站 endStation 的平均花费时间。
+ - 平均时间计算的行程包括当前为止所有从 startStation 直接到达 endStation 的行程。
+ - 调用 getAverageTime 时，询问的路线至少包含一趟行程。
+
+你可以假设所有对 checkIn 和 checkOut 的调用都是符合逻辑的。也就是说，如果一个顾客在 t1 时刻到达某个地铁站，那么他离开的时间 t2 一定满足 t2 > t1 。所有的事件都按时间顺序给出。
+
+## 解题思路
+
+- 维护 2 个 `map`。一个 `mapA` 内部存储的是乘客 `id` 与（入站时间，站名）的对应关系。另外一个 `mapB` 存储的是起点站与终点站花费总时间与人数总数的关系。每当有人 `checkin()`，就更新 `mapA` 中的信息。每当有人 `checkout()`，就更新 `mapB` 中的信息，并删除 `mapA` 对应乘客 `id` 的键值对。最后调用 `getAverageTime()` 函数的时候根据 `mapB` 中存储的信息计算即可。
+
+## 代码
+
+```go
+package leetcode
+
+type checkin struct {
+ station string
+ time int
+}
+
+type stationTime struct {
+ sum, count float64
+}
+
+type UndergroundSystem struct {
+ checkins map[int]*checkin
+ stationTimes map[string]map[string]*stationTime
+}
+
+func Constructor() UndergroundSystem {
+ return UndergroundSystem{
+ make(map[int]*checkin),
+ make(map[string]map[string]*stationTime),
+ }
+}
+
+func (s *UndergroundSystem) CheckIn(id int, stationName string, t int) {
+ s.checkins[id] = &checkin{stationName, t}
+}
+
+func (s *UndergroundSystem) CheckOut(id int, stationName string, t int) {
+ checkin := s.checkins[id]
+ destination := s.stationTimes[checkin.station]
+ if destination == nil {
+ s.stationTimes[checkin.station] = make(map[string]*stationTime)
+ }
+ st := s.stationTimes[checkin.station][stationName]
+ if st == nil {
+ st = new(stationTime)
+ s.stationTimes[checkin.station][stationName] = st
+ }
+ st.sum += float64(t - checkin.time)
+ st.count++
+ delete(s.checkins, id)
+}
+
+func (s *UndergroundSystem) GetAverageTime(startStation string, endStation string) float64 {
+ st := s.stationTimes[startStation][endStation]
+ return st.sum / st.count
+}
+
+/**
+ * Your UndergroundSystem object will be instantiated and called as such:
+ * obj := Constructor();
+ * obj.CheckIn(id,stationName,t);
+ * obj.CheckOut(id,stationName,t);
+ * param_3 := obj.GetAverageTime(startStation,endStation);
+ */
+```
\ No newline at end of file
diff --git a/leetcode/1423.Maximum-Points-You-Can-Obtain-from-Cards/1423. Maximum Points You Can Obtain from Cards.go b/leetcode/1423.Maximum-Points-You-Can-Obtain-from-Cards/1423. Maximum Points You Can Obtain from Cards.go
new file mode 100644
index 000000000..c237e7e40
--- /dev/null
+++ b/leetcode/1423.Maximum-Points-You-Can-Obtain-from-Cards/1423. Maximum Points You Can Obtain from Cards.go
@@ -0,0 +1,20 @@
+package leetcode
+
+func maxScore(cardPoints []int, k int) int {
+ windowSize, sum := len(cardPoints)-k, 0
+ for _, val := range cardPoints[:windowSize] {
+ sum += val
+ }
+ minSum := sum
+ for i := windowSize; i < len(cardPoints); i++ {
+ sum += cardPoints[i] - cardPoints[i-windowSize]
+ if sum < minSum {
+ minSum = sum
+ }
+ }
+ total := 0
+ for _, pt := range cardPoints {
+ total += pt
+ }
+ return total - minSum
+}
diff --git a/leetcode/1423.Maximum-Points-You-Can-Obtain-from-Cards/1423. Maximum Points You Can Obtain from Cards_test.go b/leetcode/1423.Maximum-Points-You-Can-Obtain-from-Cards/1423. Maximum Points You Can Obtain from Cards_test.go
new file mode 100644
index 000000000..9cae408dc
--- /dev/null
+++ b/leetcode/1423.Maximum-Points-You-Can-Obtain-from-Cards/1423. Maximum Points You Can Obtain from Cards_test.go
@@ -0,0 +1,63 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question1423 struct {
+ para1423
+ ans1423
+}
+
+// para 是参数
+// one 代表第一个参数
+type para1423 struct {
+ cardPoints []int
+ k int
+}
+
+// ans 是答案
+// one 代表第一个答案
+type ans1423 struct {
+ one int
+}
+
+func Test_Problem1423(t *testing.T) {
+
+ qs := []question1423{
+
+ {
+ para1423{[]int{1, 2, 3, 4, 5, 6, 1}, 3},
+ ans1423{12},
+ },
+
+ {
+ para1423{[]int{2, 2, 2}, 2},
+ ans1423{4},
+ },
+
+ {
+ para1423{[]int{9, 7, 7, 9, 7, 7, 9}, 7},
+ ans1423{55},
+ },
+
+ {
+ para1423{[]int{1, 1000, 1}, 1},
+ ans1423{1},
+ },
+
+ {
+ para1423{[]int{1, 79, 80, 1, 1, 1, 200, 1}, 3},
+ ans1423{202},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 1423------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans1423, q.para1423
+ fmt.Printf("【input】:%v 【output】:%v\n", p, maxScore(p.cardPoints, p.k))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/1423.Maximum-Points-You-Can-Obtain-from-Cards/README.md b/leetcode/1423.Maximum-Points-You-Can-Obtain-from-Cards/README.md
new file mode 100644
index 000000000..70c8e55b0
--- /dev/null
+++ b/leetcode/1423.Maximum-Points-You-Can-Obtain-from-Cards/README.md
@@ -0,0 +1,90 @@
+# [1423. Maximum Points You Can Obtain from Cards](https://leetcode.com/problems/maximum-points-you-can-obtain-from-cards/)
+
+
+## 题目
+
+There are several cards **arranged in a row**, and each card has an associated number of points The points are given in the integer array `cardPoints`.
+
+In one step, you can take one card from the beginning or from the end of the row. You have to take exactly `k` cards.
+
+Your score is the sum of the points of the cards you have taken.
+
+Given the integer array `cardPoints` and the integer `k`, return the *maximum score* you can obtain.
+
+**Example 1:**
+
+```
+Input: cardPoints = [1,2,3,4,5,6,1], k = 3
+Output: 12
+Explanation: After the first step, your score will always be 1. However, choosing the rightmost card first will maximize your total score. The optimal strategy is to take the three cards on the right, giving a final score of 1 + 6 + 5 = 12.
+```
+
+**Example 2:**
+
+```
+Input: cardPoints = [2,2,2], k = 2
+Output: 4
+Explanation: Regardless of which two cards you take, your score will always be 4.
+```
+
+**Example 3:**
+
+```
+Input: cardPoints = [9,7,7,9,7,7,9], k = 7
+Output: 55
+Explanation: You have to take all the cards. Your score is the sum of points of all cards.
+```
+
+**Example 4:**
+
+```
+Input: cardPoints = [1,1000,1], k = 1
+Output: 1
+Explanation: You cannot take the card in the middle. Your best score is 1.
+```
+
+**Example 5:**
+
+```
+Input: cardPoints = [1,79,80,1,1,1,200,1], k = 3
+Output: 202
+```
+
+**Constraints:**
+
+- `1 <= cardPoints.length <= 10^5`
+- `1 <= cardPoints[i] <= 10^4`
+- `1 <= k <= cardPoints.length`
+
+## 题目大意
+
+几张卡牌 排成一行，每张卡牌都有一个对应的点数。点数由整数数组 cardPoints 给出。每次行动，你可以从行的开头或者末尾拿一张卡牌，最终你必须正好拿 k 张卡牌。你的点数就是你拿到手中的所有卡牌的点数之和。给你一个整数数组 cardPoints 和整数 k，请你返回可以获得的最大点数。
+
+## 解题思路
+
+- 这一题是滑动窗口题的简化题。从卡牌两边取 K 张牌，可以转换成在中间连续取 n-K 张牌。从两边取牌的点数最大，意味着剩下来中间牌的点数最小。扫描一遍数组，在每一个窗口大小为 n-K 的窗口内计算累加和，记录下最小的累加和。题目最终求的最大点数等于牌的总和减去中间最小的累加和。
+
+## 代码
+
+```go
+package leetcode
+
+func maxScore(cardPoints []int, k int) int {
+ windowSize, sum := len(cardPoints)-k, 0
+ for _, val := range cardPoints[:windowSize] {
+ sum += val
+ }
+ minSum := sum
+ for i := windowSize; i < len(cardPoints); i++ {
+ sum += cardPoints[i] - cardPoints[i-windowSize]
+ if sum < minSum {
+ minSum = sum
+ }
+ }
+ total := 0
+ for _, pt := range cardPoints {
+ total += pt
+ }
+ return total - minSum
+}
+```
\ No newline at end of file
diff --git a/leetcode/1437.Check-If-All-1s-Are-at-Least-Length-K-Places-Away/1437. Check If All 1s Are at Least Length K Places Away.go b/leetcode/1437.Check-If-All-1s-Are-at-Least-Length-K-Places-Away/1437. Check If All 1s Are at Least Length K Places Away.go
new file mode 100644
index 000000000..029ecfbd0
--- /dev/null
+++ b/leetcode/1437.Check-If-All-1s-Are-at-Least-Length-K-Places-Away/1437. Check If All 1s Are at Least Length K Places Away.go
@@ -0,0 +1,14 @@
+package leetcode
+
+func kLengthApart(nums []int, k int) bool {
+ prevIndex := -1
+ for i, num := range nums {
+ if num == 1 {
+ if prevIndex != -1 && i-prevIndex-1 < k {
+ return false
+ }
+ prevIndex = i
+ }
+ }
+ return true
+}
diff --git a/leetcode/1437.Check-If-All-1s-Are-at-Least-Length-K-Places-Away/1437. Check If All 1s Are at Least Length K Places Away_test.go b/leetcode/1437.Check-If-All-1s-Are-at-Least-Length-K-Places-Away/1437. Check If All 1s Are at Least Length K Places Away_test.go
new file mode 100644
index 000000000..dbd26ccf6
--- /dev/null
+++ b/leetcode/1437.Check-If-All-1s-Are-at-Least-Length-K-Places-Away/1437. Check If All 1s Are at Least Length K Places Away_test.go
@@ -0,0 +1,59 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question1437 struct {
+ para1437
+ ans1437
+}
+
+// para 是参数
+// one 代表第一个参数
+type para1437 struct {
+ nums []int
+ k int
+}
+
+// ans 是答案
+// one 代表第一个答案
+type ans1437 struct {
+ one bool
+}
+
+func Test_Problem1437(t *testing.T) {
+
+ qs := []question1437{
+
+ {
+ para1437{[]int{1, 0, 0, 0, 1, 0, 0, 1}, 2},
+ ans1437{true},
+ },
+
+ {
+ para1437{[]int{1, 0, 0, 1, 0, 1}, 2},
+ ans1437{false},
+ },
+
+ {
+ para1437{[]int{1, 1, 1, 1, 1}, 0},
+ ans1437{true},
+ },
+
+ {
+ para1437{[]int{0, 1, 0, 1}, 1},
+ ans1437{true},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 1437------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans1437, q.para1437
+ fmt.Printf("【input】:%v ", p)
+ fmt.Printf("【output】:%v \n", kLengthApart(p.nums, p.k))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/1437.Check-If-All-1s-Are-at-Least-Length-K-Places-Away/README.md b/leetcode/1437.Check-If-All-1s-Are-at-Least-Length-K-Places-Away/README.md
new file mode 100644
index 000000000..8efb6f5b9
--- /dev/null
+++ b/leetcode/1437.Check-If-All-1s-Are-at-Least-Length-K-Places-Away/README.md
@@ -0,0 +1,73 @@
+# [1437. Check If All 1's Are at Least Length K Places Away](https://leetcode.com/problems/check-if-all-1s-are-at-least-length-k-places-away/)
+
+
+## 题目
+
+Given an array `nums` of 0s and 1s and an integer `k`, return `True` if all 1's are at least `k` places away from each other, otherwise return `False`.
+
+**Example 1:**
+
+
+
+```
+Input: nums = [1,0,0,0,1,0,0,1], k = 2
+Output: true
+Explanation: Each of the 1s are at least 2 places away from each other.
+```
+
+**Example 2:**
+
+
+
+```
+Input: nums = [1,0,0,1,0,1], k = 2
+Output: false
+Explanation: The second 1 and third 1 are only one apart from each other.
+```
+
+**Example 3:**
+
+```
+Input: nums = [1,1,1,1,1], k = 0
+Output: true
+```
+
+**Example 4:**
+
+```
+Input: nums = [0,1,0,1], k = 1
+Output: true
+```
+
+**Constraints:**
+
+- `1 <= nums.length <= 10^5`
+- `0 <= k <= nums.length`
+- `nums[i]` is `0` or `1`
+
+## 题目大意
+
+给你一个由若干 0 和 1 组成的数组 nums 以及整数 k。如果所有 1 都至少相隔 k 个元素，则返回 True ；否则，返回 False 。
+
+## 解题思路
+
+- 简单题。扫描一遍数组，遇到 1 的时候比较前一个 1 的下标索引，如果相隔小于 k 则返回 false。如果大于等于 k 就更新下标索引，继续循环。循环结束输出 true 即可。
+
+## 代码
+
+```go
+package leetcode
+
+func kLengthApart(nums []int, k int) bool {
+ prevIndex := -1
+ for i, num := range nums {
+ if num == 1 {
+ if prevIndex != -1 && i-prevIndex-1 < k {
+ return false
+ }
+ prevIndex = i
+ }
+ }
+ return true
+}
+```
\ No newline at end of file
diff --git a/leetcode/1438.Longest-Continuous-Subarray-With-Absolute-Diff-Less-Than-or-Equal-to-Limit/1438. Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit.go b/leetcode/1438.Longest-Continuous-Subarray-With-Absolute-Diff-Less-Than-or-Equal-to-Limit/1438. Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit.go
new file mode 100644
index 000000000..7589a9408
--- /dev/null
+++ b/leetcode/1438.Longest-Continuous-Subarray-With-Absolute-Diff-Less-Than-or-Equal-to-Limit/1438. Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit.go
@@ -0,0 +1,28 @@
+package leetcode
+
+func longestSubarray(nums []int, limit int) int {
+ minStack, maxStack, left, res := []int{}, []int{}, 0, 0
+ for right, num := range nums {
+ for len(minStack) > 0 && nums[minStack[len(minStack)-1]] > num {
+ minStack = minStack[:len(minStack)-1]
+ }
+ minStack = append(minStack, right)
+ for len(maxStack) > 0 && nums[maxStack[len(maxStack)-1]] < num {
+ maxStack = maxStack[:len(maxStack)-1]
+ }
+ maxStack = append(maxStack, right)
+ if len(minStack) > 0 && len(maxStack) > 0 && nums[maxStack[0]]-nums[minStack[0]] > limit {
+ if left == minStack[0] {
+ minStack = minStack[1:]
+ }
+ if left == maxStack[0] {
+ maxStack = maxStack[1:]
+ }
+ left++
+ }
+ if right-left+1 > res {
+ res = right - left + 1
+ }
+ }
+ return res
+}
diff --git a/leetcode/1438.Longest-Continuous-Subarray-With-Absolute-Diff-Less-Than-or-Equal-to-Limit/1438. Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit_test.go b/leetcode/1438.Longest-Continuous-Subarray-With-Absolute-Diff-Less-Than-or-Equal-to-Limit/1438. Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit_test.go
new file mode 100644
index 000000000..278366837
--- /dev/null
+++ b/leetcode/1438.Longest-Continuous-Subarray-With-Absolute-Diff-Less-Than-or-Equal-to-Limit/1438. Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit_test.go
@@ -0,0 +1,53 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question1438 struct {
+ para1438
+ ans1438
+}
+
+// para 是参数
+// one 代表第一个参数
+type para1438 struct {
+ nums []int
+ limit int
+}
+
+// ans 是答案
+// one 代表第一个答案
+type ans1438 struct {
+ one int
+}
+
+func Test_Problem1438(t *testing.T) {
+
+ qs := []question1438{
+
+ {
+ para1438{[]int{8, 2, 4, 7}, 4},
+ ans1438{2},
+ },
+
+ {
+ para1438{[]int{10, 1, 2, 4, 7, 2}, 5},
+ ans1438{4},
+ },
+
+ {
+ para1438{[]int{4, 2, 2, 2, 4, 4, 2, 2}, 0},
+ ans1438{3},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 1438------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans1438, q.para1438
+ fmt.Printf("【input】:%v 【output】:%v\n", p, longestSubarray(p.nums, p.limit))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/1438.Longest-Continuous-Subarray-With-Absolute-Diff-Less-Than-or-Equal-to-Limit/README.md b/leetcode/1438.Longest-Continuous-Subarray-With-Absolute-Diff-Less-Than-or-Equal-to-Limit/README.md
new file mode 100644
index 000000000..eac1b5a80
--- /dev/null
+++ b/leetcode/1438.Longest-Continuous-Subarray-With-Absolute-Diff-Less-Than-or-Equal-to-Limit/README.md
@@ -0,0 +1,89 @@
+# [1438. Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit](https://leetcode.com/problems/longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit/)
+
+
+## 题目
+
+Given an array of integers `nums` and an integer `limit`, return the size of the longest **non-empty** subarray such that the absolute difference between any two elements of this subarray is less than or equal to `limit`*.*
+
+**Example 1:**
+
+```
+Input: nums = [8,2,4,7], limit = 4
+Output: 2
+Explanation: All subarrays are:
+[8] with maximum absolute diff |8-8| = 0 <= 4.
+[8,2] with maximum absolute diff |8-2| = 6 > 4.
+[8,2,4] with maximum absolute diff |8-2| = 6 > 4.
+[8,2,4,7] with maximum absolute diff |8-2| = 6 > 4.
+[2] with maximum absolute diff |2-2| = 0 <= 4.
+[2,4] with maximum absolute diff |2-4| = 2 <= 4.
+[2,4,7] with maximum absolute diff |2-7| = 5 > 4.
+[4] with maximum absolute diff |4-4| = 0 <= 4.
+[4,7] with maximum absolute diff |4-7| = 3 <= 4.
+[7] with maximum absolute diff |7-7| = 0 <= 4.
+Therefore, the size of the longest subarray is 2.
+```
+
+**Example 2:**
+
+```
+Input: nums = [10,1,2,4,7,2], limit = 5
+Output: 4
+Explanation: The subarray [2,4,7,2] is the longest since the maximum absolute diff is |2-7| = 5 <= 5.
+```
+
+**Example 3:**
+
+```
+Input: nums = [4,2,2,2,4,4,2,2], limit = 0
+Output: 3
+```
+
+**Constraints:**
+
+- `1 <= nums.length <= 10^5`
+- `1 <= nums[i] <= 10^9`
+- `0 <= limit <= 10^9`
+
+## 题目大意
+
+给你一个整数数组 nums ，和一个表示限制的整数 limit，请你返回最长连续子数组的长度，该子数组中的任意两个元素之间的绝对差必须小于或者等于 limit 。如果不存在满足条件的子数组，则返回 0 。
+
+## 解题思路
+
+- 最开始想到的思路是利用滑动窗口遍历一遍数组，每个窗口内排序，取出最大最小值。滑动窗口遍历一次的时间复杂度是 O(n)，所以此题时间复杂度是否高效落在了排序算法上了。由于前后 2 个窗口数据是有关联的，仅仅只变动了 2 个数据（左窗口移出的数据和右窗口移进的数据），所以排序没有必要每次都重新排序。这里利用二叉排序树来排序，添加和删除元素时间复杂度是 O(log n)，这种方法总的时间复杂度是 O(n log n)。空间复杂度 O(n)。
+- 二叉排序树的思路是否还有再优化的空间？答案是有。二叉排序树内维护了所有结点的有序关系，但是这个关系是多余的。此题只需要找到最大值和最小值，并不需要除此以外节点的有序信息。所以用二叉排序树是大材小用了。可以换成 2 个单调队列，一个维护窗口内的最大值，另一个维护窗口内的最小值。这样优化以后，时间复杂度降低到 O(n)，空间复杂度 O(n)。具体实现见代码。
+- 单调栈的题还有第 42 题，第 84 题，第 496 题，第 503 题，第 739 题，第 856 题，第 901 题，第 907 题，第 1130 题，第 1425 题，第 1673 题。
+
+## 代码
+
+```go
+package leetcode
+
+func longestSubarray(nums []int, limit int) int {
+ minStack, maxStack, left, res := []int{}, []int{}, 0, 0
+ for right, num := range nums {
+ for len(minStack) > 0 && nums[minStack[len(minStack)-1]] > num {
+ minStack = minStack[:len(minStack)-1]
+ }
+ minStack = append(minStack, right)
+ for len(maxStack) > 0 && nums[maxStack[len(maxStack)-1]] < num {
+ maxStack = maxStack[:len(maxStack)-1]
+ }
+ maxStack = append(maxStack, right)
+ if len(minStack) > 0 && len(maxStack) > 0 && nums[maxStack[0]]-nums[minStack[0]] > limit {
+ if left == minStack[0] {
+ minStack = minStack[1:]
+ }
+ if left == maxStack[0] {
+ maxStack = maxStack[1:]
+ }
+ left++
+ }
+ if right-left+1 > res {
+ res = right - left + 1
+ }
+ }
+ return res
+}
+```
\ No newline at end of file
diff --git a/leetcode/1439.Find-the-Kth-Smallest-Sum-of-a-Matrix-With-Sorted-Rows/1439. Find the Kth Smallest Sum of a Matrix With Sorted Rows.go b/leetcode/1439.Find-the-Kth-Smallest-Sum-of-a-Matrix-With-Sorted-Rows/1439. Find the Kth Smallest Sum of a Matrix With Sorted Rows.go
new file mode 100644
index 000000000..d3f5aa159
--- /dev/null
+++ b/leetcode/1439.Find-the-Kth-Smallest-Sum-of-a-Matrix-With-Sorted-Rows/1439. Find the Kth Smallest Sum of a Matrix With Sorted Rows.go
@@ -0,0 +1,82 @@
+package leetcode
+
+import "container/heap"
+
+func kthSmallest(mat [][]int, k int) int {
+ if len(mat) == 0 || len(mat[0]) == 0 || k == 0 {
+ return 0
+ }
+ prev := mat[0]
+ for i := 1; i < len(mat); i++ {
+ prev = kSmallestPairs(prev, mat[i], k)
+ }
+ if k < len(prev) {
+ return -1
+ }
+ return prev[k-1]
+}
+
+func kSmallestPairs(nums1 []int, nums2 []int, k int) []int {
+ res := []int{}
+ if len(nums2) == 0 {
+ return res
+ }
+ pq := newPriorityQueue()
+ for i := 0; i < len(nums1) && i < k; i++ {
+ heap.Push(pq, &pddata{
+ n1: nums1[i],
+ n2: nums2[0],
+ n2Idx: 0,
+ })
+ }
+ for pq.Len() > 0 {
+ i := heap.Pop(pq)
+ data := i.(*pddata)
+ res = append(res, data.n1+data.n2)
+ k--
+ if k <= 0 {
+ break
+ }
+ idx := data.n2Idx
+ idx++
+ if idx >= len(nums2) {
+ continue
+ }
+ heap.Push(pq, &pddata{
+ n1: data.n1,
+ n2: nums2[idx],
+ n2Idx: idx,
+ })
+ }
+ return res
+}
+
+type pddata struct {
+ n1 int
+ n2 int
+ n2Idx int
+}
+
+type priorityQueue []*pddata
+
+func newPriorityQueue() *priorityQueue {
+ pq := priorityQueue([]*pddata{})
+ heap.Init(&pq)
+ return &pq
+}
+
+func (pq priorityQueue) Len() int { return len(pq) }
+func (pq priorityQueue) Swap(i, j int) { pq[i], pq[j] = pq[j], pq[i] }
+func (pq priorityQueue) Less(i, j int) bool { return pq[i].n1+pq[i].n2 < pq[j].n1+pq[j].n2 }
+func (pq *priorityQueue) Pop() interface{} {
+ old := *pq
+ val := old[len(old)-1]
+ old[len(old)-1] = nil
+ *pq = old[0 : len(old)-1]
+ return val
+}
+
+func (pq *priorityQueue) Push(i interface{}) {
+ val := i.(*pddata)
+ *pq = append(*pq, val)
+}
diff --git a/leetcode/1439.Find-the-Kth-Smallest-Sum-of-a-Matrix-With-Sorted-Rows/1439. Find the Kth Smallest Sum of a Matrix With Sorted Rows_test.go b/leetcode/1439.Find-the-Kth-Smallest-Sum-of-a-Matrix-With-Sorted-Rows/1439. Find the Kth Smallest Sum of a Matrix With Sorted Rows_test.go
new file mode 100644
index 000000000..12edb22a9
--- /dev/null
+++ b/leetcode/1439.Find-the-Kth-Smallest-Sum-of-a-Matrix-With-Sorted-Rows/1439. Find the Kth Smallest Sum of a Matrix With Sorted Rows_test.go
@@ -0,0 +1,56 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question1439 struct {
+ para1439
+ ans1439
+}
+
+// para 是参数
+// one 代表第一个参数
+type para1439 struct {
+ mat [][]int
+ k int
+}
+
+// ans 是答案
+// one 代表第一个答案
+type ans1439 struct {
+ one int
+}
+
+func Test_Problem1439(t *testing.T) {
+
+ qs := []question1439{
+
+ {
+ para1439{[][]int{{1, 3, 11}, {2, 4, 6}}, 5},
+ ans1439{7},
+ },
+
+ {
+ para1439{[][]int{{1, 3, 11}, {2, 4, 6}}, 9},
+ ans1439{17},
+ },
+ {
+ para1439{[][]int{{1, 10, 10}, {1, 4, 5}, {2, 3, 6}}, 7},
+ ans1439{9},
+ },
+ {
+ para1439{[][]int{{1, 1, 10}, {2, 2, 9}}, 7},
+ ans1439{12},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 1439------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans1439, q.para1439
+ fmt.Printf("【input】:%v 【output】:%v\n", p, kthSmallest(p.mat, p.k))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/1439.Find-the-Kth-Smallest-Sum-of-a-Matrix-With-Sorted-Rows/README.md b/leetcode/1439.Find-the-Kth-Smallest-Sum-of-a-Matrix-With-Sorted-Rows/README.md
new file mode 100644
index 000000000..b13885732
--- /dev/null
+++ b/leetcode/1439.Find-the-Kth-Smallest-Sum-of-a-Matrix-With-Sorted-Rows/README.md
@@ -0,0 +1,144 @@
+# [1439. Find the Kth Smallest Sum of a Matrix With Sorted Rows](https://leetcode.com/problems/find-the-kth-smallest-sum-of-a-matrix-with-sorted-rows/)
+
+
+## 题目
+
+You are given an `m * n` matrix, `mat`, and an integer `k`, which has its rows sorted in non-decreasing order.
+
+You are allowed to choose exactly 1 element from each row to form an array. Return the Kth **smallest** array sum among all possible arrays.
+
+**Example 1:**
+
+```
+Input: mat = [[1,3,11],[2,4,6]], k = 5
+Output: 7
+Explanation: Choosing one element from each row, the first k smallest sum are:
+[1,2], [1,4], [3,2], [3,4], [1,6]. Where the 5th sum is 7.
+```
+
+**Example 2:**
+
+```
+Input: mat = [[1,3,11],[2,4,6]], k = 9
+Output: 17
+```
+
+**Example 3:**
+
+```
+Input: mat = [[1,10,10],[1,4,5],[2,3,6]], k = 7
+Output: 9
+Explanation: Choosing one element from each row, the first k smallest sum are:
+[1,1,2], [1,1,3], [1,4,2], [1,4,3], [1,1,6], [1,5,2], [1,5,3]. Where the 7th sum is 9.
+```
+
+**Example 4:**
+
+```
+Input: mat = [[1,1,10],[2,2,9]], k = 7
+Output: 12
+```
+
+**Constraints:**
+
+- `m == mat.length`
+- `n == mat.length[i]`
+- `1 <= m, n <= 40`
+- `1 <= k <= min(200, n ^ m)`
+- `1 <= mat[i][j] <= 5000`
+- `mat[i]` is a non decreasing array.
+
+## 题目大意
+
+给你一个 m * n 的矩阵 mat，以及一个整数 k ，矩阵中的每一行都以非递减的顺序排列。你可以从每一行中选出 1 个元素形成一个数组。返回所有可能数组中的第 k 个 最小数组和。
+
+## 解题思路
+
+- 这一题是第 373 题的升级版。在第 373 题中，给定 2 个有序数组，要求分别从这 2 个数组中选出一个数组成一个数对，最终输出和最小的 K 组。这一题中给出的是 m*n 的矩阵。其实是将第 373 题的 2 个数组升级为了 m 个数组。无非外层多了一层循环。这层循环依次从每一行中选出一个数，先从第 0 行和第 1 行取数，找到前 K 小的组合以后，再从第 2 行取数，以此类推。其他做法和第 373 题一致。维护一个长度为 k 的最小堆。每次从堆中 pop 出最小的数组和 sum 和对应的下标 index，然后依次将下标向后移动一位，生成新的 sum，加入堆中。
+
+## 代码
+
+```go
+package leetcode
+
+import "container/heap"
+
+func kthSmallest(mat [][]int, k int) int {
+ if len(mat) == 0 || len(mat[0]) == 0 || k == 0 {
+ return 0
+ }
+ prev := mat[0]
+ for i := 1; i < len(mat); i++ {
+ prev = kSmallestPairs(prev, mat[i], k)
+ }
+ if k < len(prev) {
+ return -1
+ }
+ return prev[k-1]
+}
+
+func kSmallestPairs(nums1 []int, nums2 []int, k int) []int {
+ res := []int{}
+ if len(nums2) == 0 {
+ return res
+ }
+ pq := newPriorityQueue()
+ for i := 0; i < len(nums1) && i < k; i++ {
+ heap.Push(pq, &pddata{
+ n1: nums1[i],
+ n2: nums2[0],
+ n2Idx: 0,
+ })
+ }
+ for pq.Len() > 0 {
+ i := heap.Pop(pq)
+ data := i.(*pddata)
+ res = append(res, data.n1+data.n2)
+ k--
+ if k <= 0 {
+ break
+ }
+ idx := data.n2Idx
+ idx++
+ if idx >= len(nums2) {
+ continue
+ }
+ heap.Push(pq, &pddata{
+ n1: data.n1,
+ n2: nums2[idx],
+ n2Idx: idx,
+ })
+ }
+ return res
+}
+
+type pddata struct {
+ n1 int
+ n2 int
+ n2Idx int
+}
+
+type priorityQueue []*pddata
+
+func newPriorityQueue() *priorityQueue {
+ pq := priorityQueue([]*pddata{})
+ heap.Init(&pq)
+ return &pq
+}
+
+func (pq priorityQueue) Len() int { return len(pq) }
+func (pq priorityQueue) Swap(i, j int) { pq[i], pq[j] = pq[j], pq[i] }
+func (pq priorityQueue) Less(i, j int) bool { return pq[i].n1+pq[i].n2 < pq[j].n1+pq[j].n2 }
+func (pq *priorityQueue) Pop() interface{} {
+ old := *pq
+ val := old[len(old)-1]
+ old[len(old)-1] = nil
+ *pq = old[0 : len(old)-1]
+ return val
+}
+
+func (pq *priorityQueue) Push(i interface{}) {
+ val := i.(*pddata)
+ *pq = append(*pq, val)
+}
+```
\ No newline at end of file
diff --git a/leetcode/1442.Count-Triplets-That-Can-Form-Two-Arrays-of-Equal-XOR/1442. Count Triplets That Can Form Two Arrays of Equal XOR.go b/leetcode/1442.Count-Triplets-That-Can-Form-Two-Arrays-of-Equal-XOR/1442. Count Triplets That Can Form Two Arrays of Equal XOR.go
new file mode 100644
index 000000000..19cbf203f
--- /dev/null
+++ b/leetcode/1442.Count-Triplets-That-Can-Form-Two-Arrays-of-Equal-XOR/1442. Count Triplets That Can Form Two Arrays of Equal XOR.go
@@ -0,0 +1,21 @@
+package leetcode
+
+func countTriplets(arr []int) int {
+ prefix, num, count, total := make([]int, len(arr)), 0, 0, 0
+ for i, v := range arr {
+ num ^= v
+ prefix[i] = num
+ }
+ for i := 0; i < len(prefix)-1; i++ {
+ for k := i + 1; k < len(prefix); k++ {
+ total = prefix[k]
+ if i > 0 {
+ total ^= prefix[i-1]
+ }
+ if total == 0 {
+ count += k - i
+ }
+ }
+ }
+ return count
+}
diff --git a/leetcode/1442.Count-Triplets-That-Can-Form-Two-Arrays-of-Equal-XOR/1442. Count Triplets That Can Form Two Arrays of Equal XOR_test.go b/leetcode/1442.Count-Triplets-That-Can-Form-Two-Arrays-of-Equal-XOR/1442. Count Triplets That Can Form Two Arrays of Equal XOR_test.go
new file mode 100644
index 000000000..38b31020f
--- /dev/null
+++ b/leetcode/1442.Count-Triplets-That-Can-Form-Two-Arrays-of-Equal-XOR/1442. Count Triplets That Can Form Two Arrays of Equal XOR_test.go
@@ -0,0 +1,62 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question1442 struct {
+ para1442
+ ans1442
+}
+
+// para 是参数
+// one 代表第一个参数
+type para1442 struct {
+ arr []int
+}
+
+// ans 是答案
+// one 代表第一个答案
+type ans1442 struct {
+ one int
+}
+
+func Test_Problem1442(t *testing.T) {
+
+ qs := []question1442{
+
+ {
+ para1442{[]int{2, 3, 1, 6, 7}},
+ ans1442{4},
+ },
+
+ {
+ para1442{[]int{1, 1, 1, 1, 1}},
+ ans1442{10},
+ },
+
+ {
+ para1442{[]int{2, 3}},
+ ans1442{0},
+ },
+
+ {
+ para1442{[]int{1, 3, 5, 7, 9}},
+ ans1442{3},
+ },
+
+ {
+ para1442{[]int{7, 11, 12, 9, 5, 2, 7, 17, 22}},
+ ans1442{8},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 1442------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans1442, q.para1442
+ fmt.Printf("【input】:%v 【output】:%v\n", p, countTriplets(p.arr))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/1442.Count-Triplets-That-Can-Form-Two-Arrays-of-Equal-XOR/README.md b/leetcode/1442.Count-Triplets-That-Can-Form-Two-Arrays-of-Equal-XOR/README.md
new file mode 100644
index 000000000..4e45df7cf
--- /dev/null
+++ b/leetcode/1442.Count-Triplets-That-Can-Form-Two-Arrays-of-Equal-XOR/README.md
@@ -0,0 +1,97 @@
+# [1442. Count Triplets That Can Form Two Arrays of Equal XOR](https://leetcode.com/problems/count-triplets-that-can-form-two-arrays-of-equal-xor/)
+
+
+## 题目
+
+Given an array of integers `arr`.
+
+We want to select three indices `i`, `j` and `k` where `(0 <= i < j <= k < arr.length)`.
+
+Let's define `a` and `b` as follows:
+
+- `a = arr[i] ^ arr[i + 1] ^ ... ^ arr[j - 1]`
+- `b = arr[j] ^ arr[j + 1] ^ ... ^ arr[k]`
+
+Note that **^** denotes the **bitwise-xor** operation.
+
+Return *the number of triplets* (`i`, `j` and `k`) Where `a == b`.
+
+**Example 1:**
+
+```
+Input: arr = [2,3,1,6,7]
+Output: 4
+Explanation: The triplets are (0,1,2), (0,2,2), (2,3,4) and (2,4,4)
+```
+
+**Example 2:**
+
+```
+Input: arr = [1,1,1,1,1]
+Output: 10
+```
+
+**Example 3:**
+
+```
+Input: arr = [2,3]
+Output: 0
+```
+
+**Example 4:**
+
+```
+Input: arr = [1,3,5,7,9]
+Output: 3
+```
+
+**Example 5:**
+
+```
+Input: arr = [7,11,12,9,5,2,7,17,22]
+Output: 8
+```
+
+**Constraints:**
+
+- `1 <= arr.length <= 300`
+- `1 <= arr[i] <= 10^8`
+
+## 题目大意
+
+给你一个整数数组 arr 。现需要从数组中取三个下标 i、j 和 k ，其中 (0 <= i < j <= k < arr.length) 。a 和 b 定义如下：
+
+- a = arr[i] ^ arr[i + 1] ^ ... ^ arr[j - 1]
+- b = arr[j] ^ arr[j + 1] ^ ... ^ arr[k]
+
+注意：^ 表示 按位异或 操作。请返回能够令 a == b 成立的三元组 (i, j , k) 的数目。
+
+## 解题思路
+
+- 这一题需要用到 `x^x = 0` 这个异或特性。题目要求 `a == b`，可以等效转化为 `arr[i] ^ arr[i + 1] ^ ... ^ arr[j - 1] ^ arr[j] ^ arr[j + 1] ^ ... ^ arr[k] = 0`，这样 j 相当于可以“忽略”，专注找到所有元素异或结果为 0 的区间 [i,k] 即为答案。利用前缀和的思想，只不过此题非累加和，而是异或。又由 `x^x = 0` 这个异或特性，相同部分异或相当于消除，于是有 `prefix[i,k] = prefix[0,k] ^ prefix[0,i-1]`，找到每一个 `prefix[i,k] = 0` 的 i，k 组合，i < j <= k，那么满足条件的三元组 (i,j,k) 的个数完全取决于 j 的取值范围，(因为 i 和 k 已经固定了)，j 的取值范围为 k-i，所以累加所有满足条件的 k-i，输出即为最终答案。
+
+## 代码
+
+```go
+package leetcode
+
+func countTriplets(arr []int) int {
+ prefix, num, count, total := make([]int, len(arr)), 0, 0, 0
+ for i, v := range arr {
+ num ^= v
+ prefix[i] = num
+ }
+ for i := 0; i < len(prefix)-1; i++ {
+ for k := i + 1; k < len(prefix); k++ {
+ total = prefix[k]
+ if i > 0 {
+ total ^= prefix[i-1]
+ }
+ if total == 0 {
+ count += k - i
+ }
+ }
+ }
+ return count
+}
+```
\ No newline at end of file
diff --git a/leetcode/1446.Consecutive-Characters/1446.Consecutive Characters.go b/leetcode/1446.Consecutive-Characters/1446.Consecutive Characters.go
new file mode 100644
index 000000000..9da00e7c0
--- /dev/null
+++ b/leetcode/1446.Consecutive-Characters/1446.Consecutive Characters.go
@@ -0,0 +1,20 @@
+package leetcode
+
+func maxPower(s string) int {
+ cur, cnt, ans := s[0], 1, 1
+ for i := 1; i < len(s); i++ {
+ if cur == s[i] {
+ cnt++
+ } else {
+ if cnt > ans {
+ ans = cnt
+ }
+ cur = s[i]
+ cnt = 1
+ }
+ }
+ if cnt > ans {
+ ans = cnt
+ }
+ return ans
+}
diff --git a/leetcode/1446.Consecutive-Characters/1446.Consecutive Characters_test.go b/leetcode/1446.Consecutive-Characters/1446.Consecutive Characters_test.go
new file mode 100644
index 000000000..d191126ec
--- /dev/null
+++ b/leetcode/1446.Consecutive-Characters/1446.Consecutive Characters_test.go
@@ -0,0 +1,60 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question1446 struct {
+ para1446
+ ans1446
+}
+
+// para 是参数
+type para1446 struct {
+ s string
+}
+
+// ans 是答案
+type ans1446 struct {
+ ans int
+}
+
+func Test_Problem1446(t *testing.T) {
+
+ qs := []question1446{
+
+ {
+ para1446{"leetcode"},
+ ans1446{2},
+ },
+
+ {
+ para1446{"abbcccddddeeeeedcba"},
+ ans1446{5},
+ },
+
+ {
+ para1446{"triplepillooooow"},
+ ans1446{5},
+ },
+
+ {
+ para1446{"hooraaaaaaaaaaay"},
+ ans1446{11},
+ },
+
+ {
+ para1446{"tourist"},
+ ans1446{1},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 1446------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans1446, q.para1446
+ fmt.Printf("【input】:%v 【output】:%v\n", p.s, maxPower(p.s))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/1446.Consecutive-Characters/README.md b/leetcode/1446.Consecutive-Characters/README.md
new file mode 100644
index 000000000..78a6527af
--- /dev/null
+++ b/leetcode/1446.Consecutive-Characters/README.md
@@ -0,0 +1,75 @@
+# [1446. Consecutive Characters](https://leetcode.com/problems/consecutive-characters/)
+
+## 题目
+
+The power of the string is the maximum length of a non-empty substring that contains only one unique character.
+
+Given a string s, return the power of s.
+
+**Example 1**:
+
+ Input: s = "leetcode"
+ Output: 2
+ Explanation: The substring "ee" is of length 2 with the character 'e' only.
+
+**Example 2**:
+
+ Input: s = "abbcccddddeeeeedcba"
+ Output: 5
+ Explanation: The substring "eeeee" is of length 5 with the character 'e' only.
+
+**Example 3**:
+
+ Input: s = "triplepillooooow"
+ Output: 5
+
+**Example 4**:
+
+ Input: s = "hooraaaaaaaaaaay"
+ Output: 11
+
+**Example 5**:
+
+ Input: s = "tourist"
+ Output: 1
+
+**Constraints:**
+
+- 1 <= s.length <= 500
+- s consists of only lowercase English letters.
+
+## 题目大意
+
+给你一个字符串 s ，字符串的「能量」定义为：只包含一种字符的最长非空子字符串的长度。
+
+请你返回字符串的能量。
+
+## 解题思路
+
+- 顺序遍历进行统计
+
+## 代码
+
+```go
+package leetcode
+
+func maxPower(s string) int {
+ cur, cnt, ans := s[0], 1, 1
+ for i := 1; i < len(s); i++ {
+ if cur == s[i] {
+ cnt++
+ } else {
+ if cnt > ans {
+ ans = cnt
+ }
+ cur = s[i]
+ cnt = 1
+ }
+ }
+ if cnt > ans {
+ ans = cnt
+ }
+ return ans
+}
+
+```
\ No newline at end of file
diff --git a/leetcode/1461.Check-If-a-String-Contains-All-Binary-Codes-of-Size-K/1461. Check If a String Contains All Binary Codes of Size K.go b/leetcode/1461.Check-If-a-String-Contains-All-Binary-Codes-of-Size-K/1461. Check If a String Contains All Binary Codes of Size K.go
new file mode 100644
index 000000000..b16ad956c
--- /dev/null
+++ b/leetcode/1461.Check-If-a-String-Contains-All-Binary-Codes-of-Size-K/1461. Check If a String Contains All Binary Codes of Size K.go
@@ -0,0 +1,21 @@
+package leetcode
+
+import "math"
+
+func hasAllCodes(s string, k int) bool {
+ need := int(math.Pow(2.0, float64(k)))
+ visited, mask, curr := make([]bool, need), (1<<k)-1, 0
+ for i := 0; i < len(s); i++ {
+ curr = ((curr << 1) | int(s[i]-'0')) & mask
+ if i >= k-1 { // mask 有效位达到了 k 位
+ if !visited[curr] {
+ need--
+ visited[curr] = true
+ if need == 0 {
+ return true
+ }
+ }
+ }
+ }
+ return false
+}
diff --git a/leetcode/1461.Check-If-a-String-Contains-All-Binary-Codes-of-Size-K/1461. Check If a String Contains All Binary Codes of Size K_test.go b/leetcode/1461.Check-If-a-String-Contains-All-Binary-Codes-of-Size-K/1461. Check If a String Contains All Binary Codes of Size K_test.go
new file mode 100644
index 000000000..e44997397
--- /dev/null
+++ b/leetcode/1461.Check-If-a-String-Contains-All-Binary-Codes-of-Size-K/1461. Check If a String Contains All Binary Codes of Size K_test.go
@@ -0,0 +1,63 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question1461 struct {
+ para1461
+ ans1461
+}
+
+// para 是参数
+// one 代表第一个参数
+type para1461 struct {
+ s string
+ k int
+}
+
+// ans 是答案
+// one 代表第一个答案
+type ans1461 struct {
+ one bool
+}
+
+func Test_Problem1461(t *testing.T) {
+
+ qs := []question1461{
+
+ {
+ para1461{"00110110", 2},
+ ans1461{true},
+ },
+
+ {
+ para1461{"00110", 2},
+ ans1461{true},
+ },
+
+ {
+ para1461{"0110", 1},
+ ans1461{true},
+ },
+
+ {
+ para1461{"0110", 2},
+ ans1461{false},
+ },
+
+ {
+ para1461{"0000000001011100", 4},
+ ans1461{false},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 1461------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans1461, q.para1461
+ fmt.Printf("【input】:%v 【output】:%v\n", p, hasAllCodes(p.s, p.k))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/1461.Check-If-a-String-Contains-All-Binary-Codes-of-Size-K/README.md b/leetcode/1461.Check-If-a-String-Contains-All-Binary-Codes-of-Size-K/README.md
new file mode 100644
index 000000000..07269309e
--- /dev/null
+++ b/leetcode/1461.Check-If-a-String-Contains-All-Binary-Codes-of-Size-K/README.md
@@ -0,0 +1,86 @@
+# [1461. Check If a String Contains All Binary Codes of Size K](https://leetcode.com/problems/check-if-a-string-contains-all-binary-codes-of-size-k/)
+
+
+## 题目
+
+Given a binary string `s` and an integer `k`.
+
+Return *True* if every binary code of length `k` is a substring of `s`. Otherwise, return *False*.
+
+**Example 1:**
+
+```
+Input: s = "00110110", k = 2
+Output: true
+Explanation: The binary codes of length 2 are "00", "01", "10" and "11". They can be all found as substrings at indicies 0, 1, 3 and 2 respectively.
+```
+
+**Example 2:**
+
+```
+Input: s = "00110", k = 2
+Output: true
+```
+
+**Example 3:**
+
+```
+Input: s = "0110", k = 1
+Output: true
+Explanation: The binary codes of length 1 are "0" and "1", it is clear that both exist as a substring.
+```
+
+**Example 4:**
+
+```
+Input: s = "0110", k = 2
+Output: false
+Explanation: The binary code "00" is of length 2 and doesn't exist in the array.
+```
+
+**Example 5:**
+
+```
+Input: s = "0000000001011100", k = 4
+Output: false
+```
+
+**Constraints:**
+
+- `1 <= s.length <= 5 * 10^5`
+- `s` consists of 0's and 1's only.
+- `1 <= k <= 20`
+
+## 题目大意
+
+给你一个二进制字符串 `s` 和一个整数 `k` 。如果所有长度为 `k` 的二进制字符串都是 `s` 的子串，请返回 `True` ，否则请返回 `False` 。
+
+## 解题思路
+
+- 构造一个 `mask` 遮罩，依次划过整个二进制字符串，每次滑动即取出遮罩遮住的 `k` 位二进制字符。可以用 `map` 存储不同的二进制转换成的十进制数，最后判断 `len(map)` 是否等于 `k` 即可。但是用 `map` 存比较慢，此处换成 `bool` 数组。先构造一个长度为 `k` 的数组，然后每次通过 `mask` 更新这个 `bool` 数组对应十进制的 `bool` 值，并且记录剩余还缺几个二进制数。等剩余的等于 0 的时候，说明所有二进制字符串都出现了，直接输出 `true`，否则循环完以后输出 `false`。
+
+## 代码
+
+```go
+package leetcode
+
+import "math"
+
+func hasAllCodes(s string, k int) bool {
+ need := int(math.Pow(2.0, float64(k)))
+ visited, mask, curr := make([]bool, need), (1<<k)-1, 0
+ for i := 0; i < len(s); i++ {
+ curr = ((curr << 1) | int(s[i]-'0')) & mask
+ if i >= k-1 { // mask 有效位达到了 k 位
+ if !visited[curr] {
+ need--
+ visited[curr] = true
+ if need == 0 {
+ return true
+ }
+ }
+ }
+ }
+ return false
+}
+```
\ No newline at end of file
diff --git a/leetcode/1463.Cherry-Pickup-II/1463. Cherry Pickup II.go b/leetcode/1463.Cherry-Pickup-II/1463. Cherry Pickup II.go
new file mode 100644
index 000000000..949476117
--- /dev/null
+++ b/leetcode/1463.Cherry-Pickup-II/1463. Cherry Pickup II.go
@@ -0,0 +1,52 @@
+package leetcode
+
+func cherryPickup(grid [][]int) int {
+ rows, cols := len(grid), len(grid[0])
+ dp := make([][][]int, rows)
+ for i := 0; i < rows; i++ {
+ dp[i] = make([][]int, cols)
+ for j := 0; j < cols; j++ {
+ dp[i][j] = make([]int, cols)
+ }
+ }
+ for i := 0; i < rows; i++ {
+ for j := 0; j <= i && j < cols; j++ {
+ for k := cols - 1; k >= cols-1-i && k >= 0; k-- {
+ max := 0
+ for a := j - 1; a <= j+1; a++ {
+ for b := k - 1; b <= k+1; b++ {
+ sum := isInBoard(dp, i-1, a, b)
+ if a == b && i > 0 && a >= 0 && a < cols {
+ sum -= grid[i-1][a]
+ }
+ if sum > max {
+ max = sum
+ }
+ }
+ }
+ if j == k {
+ max += grid[i][j]
+ } else {
+ max += grid[i][j] + grid[i][k]
+ }
+ dp[i][j][k] = max
+ }
+ }
+ }
+ count := 0
+ for j := 0; j < cols && j < rows; j++ {
+ for k := cols - 1; k >= 0 && k >= cols-rows; k-- {
+ if dp[rows-1][j][k] > count {
+ count = dp[rows-1][j][k]
+ }
+ }
+ }
+ return count
+}
+
+func isInBoard(dp [][][]int, i, j, k int) int {
+ if i < 0 || j < 0 || j >= len(dp[0]) || k < 0 || k >= len(dp[0]) {
+ return 0
+ }
+ return dp[i][j][k]
+}
diff --git a/leetcode/1463.Cherry-Pickup-II/1463. Cherry Pickup II_test.go b/leetcode/1463.Cherry-Pickup-II/1463. Cherry Pickup II_test.go
new file mode 100644
index 000000000..3b85275f5
--- /dev/null
+++ b/leetcode/1463.Cherry-Pickup-II/1463. Cherry Pickup II_test.go
@@ -0,0 +1,71 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question1463 struct {
+ para1463
+ ans1463
+}
+
+type para1463 struct {
+ grid [][]int
+}
+
+type ans1463 struct {
+ ans int
+}
+
+func Test_Problem1463(t *testing.T) {
+
+ qs := []question1463{
+
+ {
+ para1463{[][]int{
+ {3, 1, 1},
+ {2, 5, 1},
+ {1, 5, 5},
+ {2, 1, 1},
+ }},
+ ans1463{24},
+ },
+
+ {
+ para1463{[][]int{
+ {1, 0, 0, 0, 0, 0, 1},
+ {2, 0, 0, 0, 0, 3, 0},
+ {2, 0, 9, 0, 0, 0, 0},
+ {0, 3, 0, 5, 4, 0, 0},
+ {1, 0, 2, 3, 0, 0, 6},
+ }},
+ ans1463{28},
+ },
+ {
+ para1463{[][]int{
+ {1, 0, 0, 3},
+ {0, 0, 0, 3},
+ {0, 0, 3, 3},
+ {9, 0, 3, 3},
+ }},
+ ans1463{22},
+ },
+ {
+ para1463{[][]int{
+ {1, 1},
+ {1, 1},
+ }},
+ ans1463{4},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 1463------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans1463, q.para1463
+ fmt.Printf("【input】:%v ", p)
+ fmt.Printf("【output】:%v \n", cherryPickup(p.grid))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/1463.Cherry-Pickup-II/README.md b/leetcode/1463.Cherry-Pickup-II/README.md
new file mode 100644
index 000000000..88a4bd415
--- /dev/null
+++ b/leetcode/1463.Cherry-Pickup-II/README.md
@@ -0,0 +1,148 @@
+# [1463. Cherry Pickup II](https://leetcode.com/problems/cherry-pickup-ii/)
+
+## 题目
+
+Given a `rows x cols` matrix `grid` representing a field of cherries. Each cell in `grid` represents the number of cherries that you can collect.
+
+You have two robots that can collect cherries for you, Robot #1 is located at the top-left corner (0,0) , and Robot #2 is located at the top-right corner (0, cols-1) of the grid.
+
+Return the maximum number of cherries collection using both robots by following the rules below:
+
+- From a cell (i,j), robots can move to cell (i+1, j-1) , (i+1, j) or (i+1, j+1).
+- When any robot is passing through a cell, It picks it up all cherries, and the cell becomes an empty cell (0).
+- When both robots stay on the same cell, only one of them takes the cherries.
+- Both robots cannot move outside of the grid at any moment.
+- Both robots should reach the bottom row in the `grid`.
+
+**Example 1:**
+
+
+
+```
+Input: grid = [[3,1,1],[2,5,1],[1,5,5],[2,1,1]]
+Output: 24
+Explanation: Path of robot #1 and #2 are described in color green and blue respectively.
+Cherries taken by Robot #1, (3 + 2 + 5 + 2) = 12.
+Cherries taken by Robot #2, (1 + 5 + 5 + 1) = 12.
+Total of cherries: 12 + 12 = 24.
+```
+
+**Example 2:**
+
+
+
+```
+Input: grid = [[1,0,0,0,0,0,1],[2,0,0,0,0,3,0],[2,0,9,0,0,0,0],[0,3,0,5,4,0,0],[1,0,2,3,0,0,6]]
+Output: 28
+Explanation: Path of robot #1 and #2 are described in color green and blue respectively.
+Cherries taken by Robot #1, (1 + 9 + 5 + 2) = 17.
+Cherries taken by Robot #2, (1 + 3 + 4 + 3) = 11.
+Total of cherries: 17 + 11 = 28.
+```
+
+**Example 3:**
+
+```
+Input: grid = [[1,0,0,3],[0,0,0,3],[0,0,3,3],[9,0,3,3]]
+Output: 22
+```
+
+**Example 4:**
+
+```
+Input: grid = [[1,1],[1,1]]
+Output: 4
+```
+
+**Constraints:**
+
+- `rows == grid.length`
+- `cols == grid[i].length`
+- `2 <= rows, cols <= 70`
+- `0 <= grid[i][j] <= 100`
+
+## 题目大意
+
+给你一个 rows x cols 的矩阵 grid 来表示一块樱桃地。 grid 中每个格子的数字表示你能获得的樱桃数目。你有两个机器人帮你收集樱桃，机器人 1 从左上角格子 (0,0) 出发，机器人 2 从右上角格子 (0, cols-1) 出发。请你按照如下规则，返回两个机器人能收集的最多樱桃数目：
+
+- 从格子 (i,j) 出发，机器人可以移动到格子 (i+1, j-1)，(i+1, j) 或者 (i+1, j+1) 。
+- 当一个机器人经过某个格子时，它会把该格子内所有的樱桃都摘走，然后这个位置会变成空格子，即没有樱桃的格子。
+- 当两个机器人同时到达同一个格子时，它们中只有一个可以摘到樱桃。
+- 两个机器人在任意时刻都不能移动到 grid 外面。
+- 两个机器人最后都要到达 grid 最底下一行。
+
+## 解题思路
+
+- 如果没有思路可以先用暴力解法 DFS 尝试。读完题可以分析出求最多樱桃数目，里面包含了很多重叠子问题，于是乎自然而然思路是用动态规划。数据规模上看，100 的数据规模最多能保证 O(n^3) 时间复杂度的算法不超时。
+- 这一题的变量有 2 个，一个是行号，另外一个是机器人所在的列。具体来说，机器人每走一步的移动范围只能往下走，不能往上走，所以 2 个机器人所在行号一定相同。两个机器人的列号不同。综上，变量有 3 个，1 个行号和2 个列号。定义 `dp[i][j][k]` 代表第一个机器人从 (0,0) 走到 (i,k) 坐标，第二个机器人从 (0,n-1) 走到 (i,k) 坐标，两者最多能收集樱桃的数目。状态转移方程为 ：
+
+ {{< katex display >}}
+ dp[i][j][k] = max \begin{pmatrix}\begin{array}{lr} dp[i-1][f(j_1))][f(j_2)] + grid[i][j_1] + grid[i][j_2], j_1\neq j_2 \\ dp[i-1][f(j_1))][f(j_2)] + grid[i][j_1], j_1 = j_2 \end{array} \end{pmatrix}
+ {{< /katex>}}
+
+ 其中：
+
+ {{< katex display >}}
+ \left\{\begin{matrix}f(j_1) \in [0,n), f(j_1) - j_1 \in [-1,0,1]\\ f(j_2) \in [0,n), f(j_2) - j_2 \in [-1,0,1]\end{matrix}\right.
+ {{< /katex>}}
+
+ 即状态转移过程中需要在 `[j1 - 1, j1, j1 + 1]` 中枚举 `j1`，同理，在 在 `[j2 - 1, j2, j2 + 1]` 中枚举 `j2`，每个状态转移需要枚举这 3*3 = 9 种状态。
+
+- 边界条件 `dp[i][0][n-1] = grid[0][0] + grid[0][n-1]`，最终答案存储在 `dp[m-1]` 行中，循环找出 `dp[m-1][j1][j2]` 中的最大值，到此该题得解。
+
+## 代码
+
+```go
+package leetcode
+
+func cherryPickup(grid [][]int) int {
+ rows, cols := len(grid), len(grid[0])
+ dp := make([][][]int, rows)
+ for i := 0; i < rows; i++ {
+ dp[i] = make([][]int, cols)
+ for j := 0; j < cols; j++ {
+ dp[i][j] = make([]int, cols)
+ }
+ }
+ for i := 0; i < rows; i++ {
+ for j := 0; j <= i && j < cols; j++ {
+ for k := cols - 1; k >= cols-1-i && k >= 0; k-- {
+ max := 0
+ for a := j - 1; a <= j+1; a++ {
+ for b := k - 1; b <= k+1; b++ {
+ sum := isInBoard(dp, i-1, a, b)
+ if a == b && i > 0 && a >= 0 && a < cols {
+ sum -= grid[i-1][a]
+ }
+ if sum > max {
+ max = sum
+ }
+ }
+ }
+ if j == k {
+ max += grid[i][j]
+ } else {
+ max += grid[i][j] + grid[i][k]
+ }
+ dp[i][j][k] = max
+ }
+ }
+ }
+ count := 0
+ for j := 0; j < cols && j < rows; j++ {
+ for k := cols - 1; k >= 0 && k >= cols-rows; k-- {
+ if dp[rows-1][j][k] > count {
+ count = dp[rows-1][j][k]
+ }
+ }
+ }
+ return count
+}
+
+func isInBoard(dp [][][]int, i, j, k int) int {
+ if i < 0 || j < 0 || j >= len(dp[0]) || k < 0 || k >= len(dp[0]) {
+ return 0
+ }
+ return dp[i][j][k]
+}
+```
\ No newline at end of file
diff --git a/leetcode/1465.Maximum-Area-of-a-Piece-of-Cake-After-Horizontal-and-Vertical-Cuts/1465. Maximum Area of a Piece of Cake After Horizontal and Vertical Cuts.go b/leetcode/1465.Maximum-Area-of-a-Piece-of-Cake-After-Horizontal-and-Vertical-Cuts/1465. Maximum Area of a Piece of Cake After Horizontal and Vertical Cuts.go
new file mode 100644
index 000000000..d6a29607c
--- /dev/null
+++ b/leetcode/1465.Maximum-Area-of-a-Piece-of-Cake-After-Horizontal-and-Vertical-Cuts/1465. Maximum Area of a Piece of Cake After Horizontal and Vertical Cuts.go
@@ -0,0 +1,26 @@
+package leetcode
+
+import "sort"
+
+func maxArea(h int, w int, horizontalCuts []int, verticalCuts []int) int {
+ sort.Ints(horizontalCuts)
+ sort.Ints(verticalCuts)
+ maxw, maxl := horizontalCuts[0], verticalCuts[0]
+ for i, c := range horizontalCuts[1:] {
+ if c-horizontalCuts[i] > maxw {
+ maxw = c - horizontalCuts[i]
+ }
+ }
+ if h-horizontalCuts[len(horizontalCuts)-1] > maxw {
+ maxw = h - horizontalCuts[len(horizontalCuts)-1]
+ }
+ for i, c := range verticalCuts[1:] {
+ if c-verticalCuts[i] > maxl {
+ maxl = c - verticalCuts[i]
+ }
+ }
+ if w-verticalCuts[len(verticalCuts)-1] > maxl {
+ maxl = w - verticalCuts[len(verticalCuts)-1]
+ }
+ return (maxw * maxl) % (1000000007)
+}
diff --git a/leetcode/1465.Maximum-Area-of-a-Piece-of-Cake-After-Horizontal-and-Vertical-Cuts/1465. Maximum Area of a Piece of Cake After Horizontal and Vertical Cuts_test.go b/leetcode/1465.Maximum-Area-of-a-Piece-of-Cake-After-Horizontal-and-Vertical-Cuts/1465. Maximum Area of a Piece of Cake After Horizontal and Vertical Cuts_test.go
new file mode 100644
index 000000000..b6caabf3a
--- /dev/null
+++ b/leetcode/1465.Maximum-Area-of-a-Piece-of-Cake-After-Horizontal-and-Vertical-Cuts/1465. Maximum Area of a Piece of Cake After Horizontal and Vertical Cuts_test.go
@@ -0,0 +1,55 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question1465 struct {
+ para1465
+ ans1465
+}
+
+// para 是参数
+// one 代表第一个参数
+type para1465 struct {
+ h int
+ w int
+ horizontalCuts []int
+ verticalCuts []int
+}
+
+// ans 是答案
+// one 代表第一个答案
+type ans1465 struct {
+ one int
+}
+
+func Test_Problem1465(t *testing.T) {
+
+ qs := []question1465{
+
+ {
+ para1465{5, 4, []int{1, 2, 4}, []int{1, 3}},
+ ans1465{4},
+ },
+
+ {
+ para1465{5, 4, []int{3, 1}, []int{1}},
+ ans1465{6},
+ },
+
+ {
+ para1465{5, 4, []int{3}, []int{3}},
+ ans1465{9},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 1465------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans1465, q.para1465
+ fmt.Printf("【input】:%v 【output】:%v \n", p, maxArea(p.h, p.w, p.horizontalCuts, p.verticalCuts))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/1465.Maximum-Area-of-a-Piece-of-Cake-After-Horizontal-and-Vertical-Cuts/README.md b/leetcode/1465.Maximum-Area-of-a-Piece-of-Cake-After-Horizontal-and-Vertical-Cuts/README.md
new file mode 100644
index 000000000..8926b1776
--- /dev/null
+++ b/leetcode/1465.Maximum-Area-of-a-Piece-of-Cake-After-Horizontal-and-Vertical-Cuts/README.md
@@ -0,0 +1,89 @@
+# [1465. Maximum Area of a Piece of Cake After Horizontal and Vertical Cuts](https://leetcode.com/problems/maximum-area-of-a-piece-of-cake-after-horizontal-and-vertical-cuts/)
+
+
+## 题目
+
+Given a rectangular cake with height `h` and width `w`, and two arrays of integers `horizontalCuts` and `verticalCuts` where `horizontalCuts[i]` is the distance from the top of the rectangular cake to the `ith` horizontal cut and similarly, `verticalCuts[j]` is the distance from the left of the rectangular cake to the `jth` vertical cut.
+
+*Return the maximum area of a piece of cake after you cut at each horizontal and vertical position provided in the arrays `horizontalCuts` and `verticalCuts`.* Since the answer can be a huge number, return this modulo 10^9 + 7.
+
+**Example 1:**
+
+
+
+```
+Input: h = 5, w = 4, horizontalCuts = [1,2,4], verticalCuts = [1,3]
+Output: 4
+Explanation: The figure above represents the given rectangular cake. Red lines are the horizontal and vertical cuts. After you cut the cake, the green piece of cake has the maximum area.
+
+```
+
+**Example 2:**
+
+
+
+```
+Input: h = 5, w = 4, horizontalCuts = [3,1], verticalCuts = [1]
+Output: 6
+Explanation: The figure above represents the given rectangular cake. Red lines are the horizontal and vertical cuts. After you cut the cake, the green and yellow pieces of cake have the maximum area.
+
+```
+
+**Example 3:**
+
+```
+Input: h = 5, w = 4, horizontalCuts = [3], verticalCuts = [3]
+Output: 9
+
+```
+
+**Constraints:**
+
+- `2 <= h, w <= 10^9`
+- `1 <= horizontalCuts.length < min(h, 10^5)`
+- `1 <= verticalCuts.length < min(w, 10^5)`
+- `1 <= horizontalCuts[i] < h`
+- `1 <= verticalCuts[i] < w`
+- It is guaranteed that all elements in `horizontalCuts` are distinct.
+- It is guaranteed that all elements in `verticalCuts` are distinct.
+
+## 题目大意
+
+矩形蛋糕的高度为 h 且宽度为 w，给你两个整数数组 horizontalCuts 和 verticalCuts，其中 horizontalCuts[i] 是从矩形蛋糕顶部到第 i 个水平切口的距离，类似地， verticalCuts[j] 是从矩形蛋糕的左侧到第 j 个竖直切口的距离。请你按数组 horizontalCuts 和 verticalCuts 中提供的水平和竖直位置切割后，请你找出 面积最大 的那份蛋糕，并返回其 面积 。由于答案可能是一个很大的数字，因此需要将结果对 10^9 + 7 取余后返回。
+
+## 解题思路
+
+- 读完题比较容易想到解题思路。找到水平切口最大的差值和竖直切口最大的差值，这 4 条边构成的矩形即为最大矩形。不过有特殊情况需要判断，切口除了题目给的切口坐标以外，默认还有 4 个切口，即蛋糕原始的 4 条边。如下图二，最大的矩形其实在切口之外。所以找水平切口最大差值和竖直切口最大差值需要考虑到蛋糕原始的 4 条边。
+
+
+
+## 代码
+
+```go
+package leetcode
+
+import "sort"
+
+func maxArea(h int, w int, hcuts []int, vcuts []int) int {
+ sort.Ints(hcuts)
+ sort.Ints(vcuts)
+ maxw, maxl := hcuts[0], vcuts[0]
+ for i, c := range hcuts[1:] {
+ if c-hcuts[i] > maxw {
+ maxw = c - hcuts[i]
+ }
+ }
+ if h-hcuts[len(hcuts)-1] > maxw {
+ maxw = h - hcuts[len(hcuts)-1]
+ }
+ for i, c := range vcuts[1:] {
+ if c-vcuts[i] > maxl {
+ maxl = c - vcuts[i]
+ }
+ }
+ if w-vcuts[len(vcuts)-1] > maxl {
+ maxl = w - vcuts[len(vcuts)-1]
+ }
+ return (maxw * maxl) % (1000000007)
+}
+```
\ No newline at end of file
diff --git a/leetcode/1480.Running-Sum-of-1d-Array/1480. Running Sum of 1d Array.go b/leetcode/1480.Running-Sum-of-1d-Array/1480. Running Sum of 1d Array.go
new file mode 100644
index 000000000..7663c290c
--- /dev/null
+++ b/leetcode/1480.Running-Sum-of-1d-Array/1480. Running Sum of 1d Array.go
@@ -0,0 +1,10 @@
+package leetcode
+
+func runningSum(nums []int) []int {
+ dp := make([]int, len(nums)+1)
+ dp[0] = 0
+ for i := 1; i <= len(nums); i++ {
+ dp[i] = dp[i-1] + nums[i-1]
+ }
+ return dp[1:]
+}
diff --git a/leetcode/1480.Running-Sum-of-1d-Array/1480. Running Sum of 1d Array_test.go b/leetcode/1480.Running-Sum-of-1d-Array/1480. Running Sum of 1d Array_test.go
new file mode 100644
index 000000000..c2053b1b1
--- /dev/null
+++ b/leetcode/1480.Running-Sum-of-1d-Array/1480. Running Sum of 1d Array_test.go
@@ -0,0 +1,52 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question1480 struct {
+ para1480
+ ans1480
+}
+
+// para 是参数
+// one 代表第一个参数
+type para1480 struct {
+ nums []int
+}
+
+// ans 是答案
+// one 代表第一个答案
+type ans1480 struct {
+ one []int
+}
+
+func Test_Problem1480(t *testing.T) {
+
+ qs := []question1480{
+
+ {
+ para1480{[]int{1, 2, 3, 4}},
+ ans1480{[]int{1, 3, 6, 10}},
+ },
+
+ {
+ para1480{[]int{1, 1, 1, 1, 1}},
+ ans1480{[]int{1, 2, 3, 4, 5}},
+ },
+
+ {
+ para1480{[]int{3, 1, 2, 10, 1}},
+ ans1480{[]int{3, 4, 6, 16, 17}},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 1480------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans1480, q.para1480
+ fmt.Printf("【input】:%v 【output】:%v \n", p, runningSum(p.nums))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/1480.Running-Sum-of-1d-Array/README.md b/leetcode/1480.Running-Sum-of-1d-Array/README.md
new file mode 100644
index 000000000..d0e483358
--- /dev/null
+++ b/leetcode/1480.Running-Sum-of-1d-Array/README.md
@@ -0,0 +1,64 @@
+# [1480. Running Sum of 1d Array](https://leetcode.com/problems/running-sum-of-1d-array/)
+
+## 题目
+
+Given an array `nums`. We define a running sum of an array as `runningSum[i] = sum(nums[0]…nums[i])`.
+
+Return the running sum of `nums`.
+
+**Example 1**:
+
+```
+Input: nums = [1,2,3,4]
+Output: [1,3,6,10]
+Explanation: Running sum is obtained as follows: [1, 1+2, 1+2+3, 1+2+3+4].
+
+```
+
+**Example 2**:
+
+```
+Input: nums = [1,1,1,1,1]
+Output: [1,2,3,4,5]
+Explanation: Running sum is obtained as follows: [1, 1+1, 1+1+1, 1+1+1+1, 1+1+1+1+1].
+
+```
+
+**Example 3**:
+
+```
+Input: nums = [3,1,2,10,1]
+Output: [3,4,6,16,17]
+
+```
+
+
+**Constraints**:
+
+- `1 <= nums.length <= 1000`
+- `-10^6 <= nums[i] <= 10^6`
+
+## 题目大意
+
+给你一个数组 nums 。数组「动态和」的计算公式为：runningSum[i] = sum(nums[0]…nums[i]) 。请返回 nums 的动态和。
+
+
+## 解题思路
+
+- 简单题，按照题意依次循环计算前缀和即可。
+
+## 代码
+
+```go
+package leetcode
+
+func runningSum(nums []int) []int {
+ dp := make([]int, len(nums)+1)
+ dp[0] = 0
+ for i := 1; i <= len(nums); i++ {
+ dp[i] = dp[i-1] + nums[i-1]
+ }
+ return dp[1:]
+}
+
+```
\ No newline at end of file
diff --git a/leetcode/1482.Minimum-Number-of-Days-to-Make-m-Bouquets/1482. Minimum Number of Days to Make m Bouquets.go b/leetcode/1482.Minimum-Number-of-Days-to-Make-m-Bouquets/1482. Minimum Number of Days to Make m Bouquets.go
new file mode 100644
index 000000000..759e93542
--- /dev/null
+++ b/leetcode/1482.Minimum-Number-of-Days-to-Make-m-Bouquets/1482. Minimum Number of Days to Make m Bouquets.go
@@ -0,0 +1,30 @@
+package leetcode
+
+import "sort"
+
+func minDays(bloomDay []int, m int, k int) int {
+ if m*k > len(bloomDay) {
+ return -1
+ }
+ maxDay := 0
+ for _, day := range bloomDay {
+ if day > maxDay {
+ maxDay = day
+ }
+ }
+ return sort.Search(maxDay, func(days int) bool {
+ flowers, bouquets := 0, 0
+ for _, d := range bloomDay {
+ if d > days {
+ flowers = 0
+ } else {
+ flowers++
+ if flowers == k {
+ bouquets++
+ flowers = 0
+ }
+ }
+ }
+ return bouquets >= m
+ })
+}
diff --git a/leetcode/1482.Minimum-Number-of-Days-to-Make-m-Bouquets/1482. Minimum Number of Days to Make m Bouquets_test.go b/leetcode/1482.Minimum-Number-of-Days-to-Make-m-Bouquets/1482. Minimum Number of Days to Make m Bouquets_test.go
new file mode 100644
index 000000000..e505095f1
--- /dev/null
+++ b/leetcode/1482.Minimum-Number-of-Days-to-Make-m-Bouquets/1482. Minimum Number of Days to Make m Bouquets_test.go
@@ -0,0 +1,64 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question1482 struct {
+ para1482
+ ans1482
+}
+
+// para 是参数
+// one 代表第一个参数
+type para1482 struct {
+ bloomDay []int
+ m int
+ k int
+}
+
+// ans 是答案
+// one 代表第一个答案
+type ans1482 struct {
+ one int
+}
+
+func Test_Problem1482(t *testing.T) {
+
+ qs := []question1482{
+
+ {
+ para1482{[]int{1, 10, 3, 10, 2}, 3, 1},
+ ans1482{3},
+ },
+
+ {
+ para1482{[]int{1, 10, 3, 10, 2}, 3, 2},
+ ans1482{-1},
+ },
+
+ {
+ para1482{[]int{7, 7, 7, 7, 12, 7, 7}, 2, 3},
+ ans1482{12},
+ },
+
+ {
+ para1482{[]int{1000000000, 1000000000}, 1, 1},
+ ans1482{1000000000},
+ },
+
+ {
+ para1482{[]int{1, 10, 2, 9, 3, 8, 4, 7, 5, 6}, 4, 2},
+ ans1482{9},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 1482------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans1482, q.para1482
+ fmt.Printf("【input】:%v 【output】:%v \n", p, minDays(p.bloomDay, p.m, p.k))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/1482.Minimum-Number-of-Days-to-Make-m-Bouquets/README.md b/leetcode/1482.Minimum-Number-of-Days-to-Make-m-Bouquets/README.md
new file mode 100644
index 000000000..b7d691d38
--- /dev/null
+++ b/leetcode/1482.Minimum-Number-of-Days-to-Make-m-Bouquets/README.md
@@ -0,0 +1,110 @@
+# [1482. Minimum Number of Days to Make m Bouquets](https://leetcode.com/problems/minimum-number-of-days-to-make-m-bouquets/)
+
+## 题目
+
+Given an integer array `bloomDay`, an integer `m` and an integer `k`.
+
+We need to make `m` bouquets. To make a bouquet, you need to use `k` **adjacent flowers** from the garden.
+
+The garden consists of `n` flowers, the `ith` flower will bloom in the `bloomDay[i]` and then can be used in **exactly one** bouquet.
+
+Return *the minimum number of days* you need to wait to be able to make `m` bouquets from the garden. If it is impossible to make `m` bouquets return **-1**.
+
+**Example 1:**
+
+```
+Input: bloomDay = [1,10,3,10,2], m = 3, k = 1
+Output: 3
+Explanation: Let's see what happened in the first three days. x means flower bloomed and _ means flower didn't bloom in the garden.
+We need 3 bouquets each should contain 1 flower.
+After day 1: [x, _, _, _, _] // we can only make one bouquet.
+After day 2: [x, _, _, _, x] // we can only make two bouquets.
+After day 3: [x, _, x, _, x] // we can make 3 bouquets. The answer is 3.
+```
+
+**Example 2:**
+
+```
+Input: bloomDay = [1,10,3,10,2], m = 3, k = 2
+Output: -1
+Explanation: We need 3 bouquets each has 2 flowers, that means we need 6 flowers. We only have 5 flowers so it is impossible to get the needed bouquets and we return -1.
+```
+
+**Example 3:**
+
+```
+Input: bloomDay = [7,7,7,7,12,7,7], m = 2, k = 3
+Output: 12
+Explanation: We need 2 bouquets each should have 3 flowers.
+Here's the garden after the 7 and 12 days:
+After day 7: [x, x, x, x, _, x, x]
+We can make one bouquet of the first three flowers that bloomed. We cannot make another bouquet from the last three flowers that bloomed because they are not adjacent.
+After day 12: [x, x, x, x, x, x, x]
+It is obvious that we can make two bouquets in different ways.
+```
+
+**Example 4:**
+
+```
+Input: bloomDay = [1000000000,1000000000], m = 1, k = 1
+Output: 1000000000
+Explanation: You need to wait 1000000000 days to have a flower ready for a bouquet.
+```
+
+**Example 5:**
+
+```
+Input: bloomDay = [1,10,2,9,3,8,4,7,5,6], m = 4, k = 2
+Output: 9
+```
+
+**Constraints:**
+
+- `bloomDay.length == n`
+- `1 <= n <= 10^5`
+- `1 <= bloomDay[i] <= 10^9`
+- `1 <= m <= 10^6`
+- `1 <= k <= n`
+
+## 题目大意
+
+给你一个整数数组 bloomDay，以及两个整数 m 和 k 。现需要制作 m 束花。制作花束时，需要使用花园中 相邻的 k 朵花 。花园中有 n 朵花，第 i 朵花会在 bloomDay[i] 时盛开，恰好 可以用于 一束 花中。请你返回从花园中摘 m 束花需要等待的最少的天数。如果不能摘到 m 束花则返回 -1 。
+
+## 解题思路
+
+- 本题是二分搜索提醒。题目解空间固定，答案区间一定在 [0, maxDay] 中。这是单调增且有序区间，所以可以在这个解空间内使用二分搜索。在区间 [0, maxDay] 中找到第一个能满足 m 束花的解。二分搜索判断是否为 true 的条件为：从左往右遍历数组，依次统计当前日期下，花是否开了，如果连续开花 k 朵，便为 1 束，数组遍历结束如果花束总数 ≥ k 即为答案。二分搜索会返回最小的下标，即对应满足题意的最少天数。
+
+## 代码
+
+```go
+package leetcode
+
+import "sort"
+
+func minDays(bloomDay []int, m int, k int) int {
+ if m*k > len(bloomDay) {
+ return -1
+ }
+ maxDay := 0
+ for _, day := range bloomDay {
+ if day > maxDay {
+ maxDay = day
+ }
+ }
+ return sort.Search(maxDay, func(days int) bool {
+ flowers, bouquets := 0, 0
+ for _, d := range bloomDay {
+ if d > days {
+ flowers = 0
+ } else {
+ flowers++
+ if flowers == k {
+ bouquets++
+ flowers = 0
+ }
+ }
+ }
+ return bouquets >= m
+ })
+}
+```
\ No newline at end of file
diff --git a/leetcode/1486.XOR-Operation-in-an-Array/1486. XOR Operation in an Array.go b/leetcode/1486.XOR-Operation-in-an-Array/1486. XOR Operation in an Array.go
new file mode 100644
index 000000000..a9040341d
--- /dev/null
+++ b/leetcode/1486.XOR-Operation-in-an-Array/1486. XOR Operation in an Array.go
@@ -0,0 +1,9 @@
+package leetcode
+
+func xorOperation(n int, start int) int {
+ res := 0
+ for i := 0; i < n; i++ {
+ res ^= start + 2*i
+ }
+ return res
+}
diff --git a/leetcode/1486.XOR-Operation-in-an-Array/1486. XOR Operation in an Array_test.go b/leetcode/1486.XOR-Operation-in-an-Array/1486. XOR Operation in an Array_test.go
new file mode 100644
index 000000000..e1887c155
--- /dev/null
+++ b/leetcode/1486.XOR-Operation-in-an-Array/1486. XOR Operation in an Array_test.go
@@ -0,0 +1,58 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question1486 struct {
+ para1486
+ ans1486
+}
+
+// para 是参数
+// one 代表第一个参数
+type para1486 struct {
+ n int
+ start int
+}
+
+// ans 是答案
+// one 代表第一个答案
+type ans1486 struct {
+ one int
+}
+
+func Test_Problem1486(t *testing.T) {
+
+ qs := []question1486{
+
+ {
+ para1486{5, 0},
+ ans1486{8},
+ },
+
+ {
+ para1486{4, 3},
+ ans1486{8},
+ },
+
+ {
+ para1486{1, 7},
+ ans1486{7},
+ },
+
+ {
+ para1486{10, 5},
+ ans1486{2},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 1486------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans1486, q.para1486
+ fmt.Printf("【input】:%v 【output】:%v \n", p, xorOperation(p.n, p.start))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/1486.XOR-Operation-in-an-Array/README.md b/leetcode/1486.XOR-Operation-in-an-Array/README.md
new file mode 100644
index 000000000..3a6438de8
--- /dev/null
+++ b/leetcode/1486.XOR-Operation-in-an-Array/README.md
@@ -0,0 +1,69 @@
+# [1486. XOR Operation in an Array](https://leetcode.com/problems/xor-operation-in-an-array/)
+
+
+## 题目
+
+Given an integer `n` and an integer `start`.
+
+Define an array `nums` where `nums[i] = start + 2*i` (0-indexed) and `n == nums.length`.
+
+Return the bitwise XOR of all elements of `nums`.
+
+**Example 1:**
+
+```
+Input: n = 5, start = 0
+Output: 8
+Explanation:Array nums is equal to [0, 2, 4, 6, 8] where (0 ^ 2 ^ 4 ^ 6 ^ 8) = 8.
+Where "^" corresponds to bitwise XOR operator.
+```
+
+**Example 2:**
+
+```
+Input: n = 4, start = 3
+Output: 8
+Explanation:Array nums is equal to [3, 5, 7, 9] where (3 ^ 5 ^ 7 ^ 9) = 8.
+```
+
+**Example 3:**
+
+```
+Input: n = 1, start = 7
+Output: 7
+```
+
+**Example 4:**
+
+```
+Input: n = 10, start = 5
+Output: 2
+```
+
+**Constraints:**
+
+- `1 <= n <= 1000`
+- `0 <= start <= 1000`
+- `n == nums.length`
+
+## 题目大意
+
+给你两个整数，n 和 start 。数组 nums 定义为：nums[i] = start + 2*i（下标从 0 开始）且 n == nums.length 。请返回 nums 中所有元素按位异或（XOR）后得到的结果。
+
+## 解题思路
+
+- 简单题。按照题意，一层循环依次累积异或数组中每个元素。
+
+## 代码
+
+```go
+package leetcode
+
+func xorOperation(n int, start int) int {
+ res := 0
+ for i := 0; i < n; i++ {
+ res ^= start + 2*i
+ }
+ return res
+}
+```
\ No newline at end of file
diff --git a/leetcode/1512.Number-of-Good-Pairs/1512. Number of Good Pairs.go b/leetcode/1512.Number-of-Good-Pairs/1512. Number of Good Pairs.go
new file mode 100644
index 000000000..6edfcdfa4
--- /dev/null
+++ b/leetcode/1512.Number-of-Good-Pairs/1512. Number of Good Pairs.go
@@ -0,0 +1,13 @@
+package leetcode
+
+func numIdenticalPairs(nums []int) int {
+ total := 0
+ for x := 0; x < len(nums); x++ {
+ for y := x + 1; y < len(nums); y++ {
+ if nums[x] == nums[y] {
+ total++
+ }
+ }
+ }
+ return total
+}
diff --git a/leetcode/1512.Number-of-Good-Pairs/1512. Number of Good Pairs_test.go b/leetcode/1512.Number-of-Good-Pairs/1512. Number of Good Pairs_test.go
new file mode 100644
index 000000000..3fc122186
--- /dev/null
+++ b/leetcode/1512.Number-of-Good-Pairs/1512. Number of Good Pairs_test.go
@@ -0,0 +1,52 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question1512 struct {
+ para1512
+ ans1512
+}
+
+// para 是参数
+// one 代表第一个参数
+type para1512 struct {
+ nums []int
+}
+
+// ans 是答案
+// one 代表第一个答案
+type ans1512 struct {
+ one int
+}
+
+func Test_Problem1512(t *testing.T) {
+
+ qs := []question1512{
+
+ {
+ para1512{[]int{1, 2, 3, 1, 1, 3}},
+ ans1512{4},
+ },
+
+ {
+ para1512{[]int{1, 1, 1, 1}},
+ ans1512{6},
+ },
+
+ {
+ para1512{[]int{1, 2, 3}},
+ ans1512{0},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 1512------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans1512, q.para1512
+ fmt.Printf("【input】:%v 【output】:%v \n", p, numIdenticalPairs(p.nums))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/1512.Number-of-Good-Pairs/README.md b/leetcode/1512.Number-of-Good-Pairs/README.md
new file mode 100644
index 000000000..a6954aa0a
--- /dev/null
+++ b/leetcode/1512.Number-of-Good-Pairs/README.md
@@ -0,0 +1,67 @@
+# [1512. Number of Good Pairs](https://leetcode.com/problems/number-of-good-pairs/)
+
+## 题目
+
+Given an array of integers `nums`.
+
+A pair `(i,j)` is called good if `nums[i] == nums[j]` and `i < j`.
+
+Return the number of good pairs.
+
+**Example 1**:
+
+```
+Input: nums = [1,2,3,1,1,3]
+Output: 4
+Explanation: There are 4 good pairs (0,3), (0,4), (3,4), (2,5) 0-indexed.
+
+```
+
+**Example 2**:
+
+```
+Input: nums = [1,1,1,1]
+Output: 6
+Explanation: Each pair in the array are good.
+
+```
+
+**Example 3**:
+
+```
+Input: nums = [1,2,3]
+Output: 0
+
+```
+
+**Constraints**:
+
+- `1 <= nums.length <= 1000`
+- `1 <= nums[i] <= 100`
+
+## 题目大意
+
+给你一个整数数组 nums。如果一组数字 (i,j) 满足 nums[i] == nums[j] 且 i < j ，就可以认为这是一组好数对。返回好数对的数目。
+
+## 解题思路
+
+- 简单题，按照题目中好数对的定义，循环遍历判断两数是否相等，累加计数即可。
+
+## 代码
+
+```go
+package leetcode
+
+func numIdenticalPairs(nums []int) int {
+ total := 0
+ for x := 0; x < len(nums); x++ {
+ for y := x + 1; y < len(nums); y++ {
+ if nums[x] == nums[y] {
+ total++
+ }
+ }
+ }
+ return total
+}
+
+```
\ No newline at end of file
diff --git a/leetcode/1518.Water-Bottles/1518.Water Bottles.go b/leetcode/1518.Water-Bottles/1518.Water Bottles.go
new file mode 100644
index 000000000..987c6b86b
--- /dev/null
+++ b/leetcode/1518.Water-Bottles/1518.Water Bottles.go
@@ -0,0 +1,15 @@
+package leetcode
+
+func numWaterBottles(numBottles int, numExchange int) int {
+ if numBottles < numExchange {
+ return numBottles
+ }
+ quotient := numBottles / numExchange
+ reminder := numBottles % numExchange
+ ans := numBottles + quotient
+ for quotient+reminder >= numExchange {
+ quotient, reminder = (quotient+reminder)/numExchange, (quotient+reminder)%numExchange
+ ans += quotient
+ }
+ return ans
+}
diff --git a/leetcode/1518.Water-Bottles/1518.Water Bottles_test.go b/leetcode/1518.Water-Bottles/1518.Water Bottles_test.go
new file mode 100644
index 000000000..20c2a18d7
--- /dev/null
+++ b/leetcode/1518.Water-Bottles/1518.Water Bottles_test.go
@@ -0,0 +1,56 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question1518 struct {
+ para1518
+ ans1518
+}
+
+// para 是参数
+type para1518 struct {
+ numBottles int
+ numExchange int
+}
+
+// ans 是答案
+type ans1518 struct {
+ ans int
+}
+
+func Test_Problem1518(t *testing.T) {
+
+ qs := []question1518{
+
+ {
+ para1518{9, 3},
+ ans1518{13},
+ },
+
+ {
+ para1518{15, 4},
+ ans1518{19},
+ },
+
+ {
+ para1518{5, 5},
+ ans1518{6},
+ },
+
+ {
+ para1518{2, 3},
+ ans1518{2},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 1518------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans1518, q.para1518
+ fmt.Printf("【input】:%v 【output】:%v\n", p, numWaterBottles(p.numBottles, p.numExchange))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/1518.Water-Bottles/README.md b/leetcode/1518.Water-Bottles/README.md
new file mode 100644
index 000000000..3f05e1815
--- /dev/null
+++ b/leetcode/1518.Water-Bottles/README.md
@@ -0,0 +1,74 @@
+# [1518. Water Bottles](https://leetcode.com/problems/water-bottles/)
+
+## 题目
+
+Given numBottles full water bottles, you can exchange numExchange empty water bottles for one full water bottle.
+
+The operation of drinking a full water bottle turns it into an empty bottle.
+
+Return the maximum number of water bottles you can drink.
+
+**Example 1**:
+
+
+
+ Input: numBottles = 9, numExchange = 3
+ Output: 13
+ Explanation: You can exchange 3 empty bottles to get 1 full water bottle.
+ Number of water bottles you can drink: 9 + 3 + 1 = 13.
+
+**Example 2**:
+
+
+
+ Input: numBottles = 15, numExchange = 4
+ Output: 19
+ Explanation: You can exchange 4 empty bottles to get 1 full water bottle.
+ Number of water bottles you can drink: 15 + 3 + 1 = 19.
+
+**Example 3**:
+
+ Input: numBottles = 5, numExchange = 5
+ Output: 6
+
+**Example 4**:
+
+ Input: numBottles = 2, numExchange = 3
+ Output: 2
+
+**Constraints:**
+
+- 1 <= numBottles <= 100
+- 2 <= numExchange <= 100
+
+## 题目大意
+
+小区便利店正在促销，用 numExchange 个空酒瓶可以兑换一瓶新酒。你购入了 numBottles 瓶酒。
+
+如果喝掉了酒瓶中的酒，那么酒瓶就会变成空的。
+
+请你计算 最多 能喝到多少瓶酒。
+
+## 解题思路
+
+- 模拟。首先我们一定可以喝到 numBottles 瓶酒，剩下 numBottles 个空瓶。接下来我们可以拿空瓶子换酒，每次拿出 numExchange 个瓶子换一瓶酒，然后再喝完这瓶酒，得到一个空瓶。这样模拟下去，直到所有的空瓶子小于numExchange结束。
+
+## 代码
+
+```go
+package leetcode
+
+func numWaterBottles(numBottles int, numExchange int) int {
+ if numBottles < numExchange {
+ return numBottles
+ }
+ quotient := numBottles / numExchange
+ reminder := numBottles % numExchange
+ ans := numBottles + quotient
+ for quotient+reminder >= numExchange {
+ quotient, reminder = (quotient+reminder)/numExchange, (quotient+reminder)%numExchange
+ ans += quotient
+ }
+ return ans
+}
+```
\ No newline at end of file
diff --git a/leetcode/1539.Kth-Missing-Positive-Number/1539. Kth Missing Positive Number.go b/leetcode/1539.Kth-Missing-Positive-Number/1539. Kth Missing Positive Number.go
new file mode 100644
index 000000000..667a3b705
--- /dev/null
+++ b/leetcode/1539.Kth-Missing-Positive-Number/1539. Kth Missing Positive Number.go
@@ -0,0 +1,20 @@
+package leetcode
+
+func findKthPositive(arr []int, k int) int {
+ positive, index := 1, 0
+ for index < len(arr) {
+ if arr[index] != positive {
+ k--
+ } else {
+ index++
+ }
+ if k == 0 {
+ break
+ }
+ positive++
+ }
+ if k != 0 {
+ positive += k - 1
+ }
+ return positive
+}
diff --git a/leetcode/1539.Kth-Missing-Positive-Number/1539. Kth Missing Positive Number_test.go b/leetcode/1539.Kth-Missing-Positive-Number/1539. Kth Missing Positive Number_test.go
new file mode 100644
index 000000000..ffd938415
--- /dev/null
+++ b/leetcode/1539.Kth-Missing-Positive-Number/1539. Kth Missing Positive Number_test.go
@@ -0,0 +1,48 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question1539 struct {
+ para1539
+ ans1539
+}
+
+// para 是参数
+// one 代表第一个参数
+type para1539 struct {
+ arr []int
+ k int
+}
+
+// ans 是答案
+// one 代表第一个答案
+type ans1539 struct {
+ one int
+}
+
+func Test_Problem1539(t *testing.T) {
+
+ qs := []question1539{
+
+ {
+ para1539{[]int{2, 3, 4, 7, 11}, 5},
+ ans1539{9},
+ },
+
+ {
+ para1539{[]int{1, 2, 3, 4}, 2},
+ ans1539{6},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 1539------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans1539, q.para1539
+ fmt.Printf("【input】:%v 【output】:%v \n", p, findKthPositive(p.arr, p.k))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/1539.Kth-Missing-Positive-Number/README.md b/leetcode/1539.Kth-Missing-Positive-Number/README.md
new file mode 100644
index 000000000..ba13a085c
--- /dev/null
+++ b/leetcode/1539.Kth-Missing-Positive-Number/README.md
@@ -0,0 +1,63 @@
+# [1539. Kth Missing Positive Number](https://leetcode.com/problems/kth-missing-positive-number/)
+
+## 题目
+
+Given an array `arr` of positive integers sorted in a **strictly increasing order**, and an integer `k`.
+
+*Find the* `kth` *positive integer that is missing from this array.*
+
+**Example 1:**
+
+```
+Input: arr = [2,3,4,7,11], k = 5
+Output: 9
+Explanation: The missing positive integers are [1,5,6,8,9,10,12,13,...]. The 5th missing positive integer is 9.
+```
+
+**Example 2:**
+
+```
+Input: arr = [1,2,3,4], k = 2
+Output: 6
+Explanation: The missing positive integers are [5,6,7,...]. The 2nd missing positive integer is 6.
+```
+
+**Constraints:**
+
+- `1 <= arr.length <= 1000`
+- `1 <= arr[i] <= 1000`
+- `1 <= k <= 1000`
+- `arr[i] < arr[j]` for `1 <= i < j <= arr.length`
+
+## 题目大意
+
+给你一个 **严格升序排列** 的正整数数组 `arr` 和一个整数 `k` 。请你找到这个数组里第 `k` 个缺失的正整数。
+
+## 解题思路
+
+- 简单题。用一个变量从 1 开始累加，依次比对数组中是否存在，不存在的话就把 k - -，直到 k 为 0 的时候即是要输出的值。特殊情况，missing positive 都在数组之外，如例子 2 。
+
+## 代码
+
+```go
+package leetcode
+
+func findKthPositive(arr []int, k int) int {
+ positive, index := 1, 0
+ for index < len(arr) {
+ if arr[index] != positive {
+ k--
+ } else {
+ index++
+ }
+ if k == 0 {
+ break
+ }
+ positive++
+ }
+ if k != 0 {
+ positive += k - 1
+ }
+ return positive
+}
+```
\ No newline at end of file
diff --git a/leetcode/1551.Minimum-Operations-to-Make-Array-Equal/1551. Minimum Operations to Make Array Equal.go b/leetcode/1551.Minimum-Operations-to-Make-Array-Equal/1551. Minimum Operations to Make Array Equal.go
new file mode 100644
index 000000000..7010048d1
--- /dev/null
+++ b/leetcode/1551.Minimum-Operations-to-Make-Array-Equal/1551. Minimum Operations to Make Array Equal.go
@@ -0,0 +1,5 @@
+package leetcode
+
+func minOperations(n int) int {
+ return n * n / 4
+}
diff --git a/leetcode/1551.Minimum-Operations-to-Make-Array-Equal/1551. Minimum Operations to Make Array Equal_test.go b/leetcode/1551.Minimum-Operations-to-Make-Array-Equal/1551. Minimum Operations to Make Array Equal_test.go
new file mode 100644
index 000000000..49debf1a8
--- /dev/null
+++ b/leetcode/1551.Minimum-Operations-to-Make-Array-Equal/1551. Minimum Operations to Make Array Equal_test.go
@@ -0,0 +1,52 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question1551 struct {
+ para1551
+ ans1551
+}
+
+// para 是参数
+// one 代表第一个参数
+type para1551 struct {
+ n int
+}
+
+// ans 是答案
+// one 代表第一个答案
+type ans1551 struct {
+ one int
+}
+
+func Test_Problem1551(t *testing.T) {
+
+ qs := []question1551{
+
+ {
+ para1551{3},
+ ans1551{2},
+ },
+
+ {
+ para1551{6},
+ ans1551{9},
+ },
+
+ {
+ para1551{534},
+ ans1551{71289},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 1551------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans1551, q.para1551
+ fmt.Printf("【input】:%v 【output】:%v \n", p, minOperations(p.n))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/1551.Minimum-Operations-to-Make-Array-Equal/README.md b/leetcode/1551.Minimum-Operations-to-Make-Array-Equal/README.md
new file mode 100644
index 000000000..0720b9db1
--- /dev/null
+++ b/leetcode/1551.Minimum-Operations-to-Make-Array-Equal/README.md
@@ -0,0 +1,58 @@
+# [1551. Minimum Operations to Make Array Equal](https://leetcode.com/problems/minimum-operations-to-make-array-equal/)
+
+
+## 题目
+
+You have an array `arr` of length `n` where `arr[i] = (2 * i) + 1` for all valid values of `i` (i.e. `0 <= i < n`).
+
+In one operation, you can select two indices `x` and `y` where `0 <= x, y < n` and subtract `1` from `arr[x]` and add `1` to `arr[y]` (i.e. perform `arr[x] -=1` and `arr[y] += 1`). The goal is to make all the elements of the array **equal**. It is **guaranteed** that all the elements of the array can be made equal using some operations.
+
+Given an integer `n`, the length of the array. Return *the minimum number of operations* needed to make all the elements of arr equal.
+
+**Example 1:**
+
+```
+Input: n = 3
+Output: 2
+Explanation: arr = [1, 3, 5]
+First operation choose x = 2 and y = 0, this leads arr to be [2, 3, 4]
+In the second operation choose x = 2 and y = 0 again, thus arr = [3, 3, 3].
+```
+
+**Example 2:**
+
+```
+Input: n = 6
+Output: 9
+```
+
+**Constraints:**
+
+- `1 <= n <= 10^4`
+
+## 题目大意
+
+存在一个长度为 n 的数组 arr ，其中 arr[i] = (2 * i) + 1 （ 0 <= i < n ）。一次操作中，你可以选出两个下标，记作 x 和 y （ 0 <= x, y < n ）并使 arr[x] 减去 1 、arr[y] 加上 1 （即 arr[x] -=1 且 arr[y] += 1 ）。最终的目标是使数组中的所有元素都 相等 。题目测试用例将会 保证 ：在执行若干步操作后，数组中的所有元素最终可以全部相等。给你一个整数 n，即数组的长度。请你返回使数组 arr 中所有元素相等所需的 最小操作数 。
+
+## 解题思路
+
+- 这一题是数学题。题目给定的操作并不会使数组中所有元素之和变化，最终让所有元素相等，那么数组中所有元素的平均值即为最后数组中每一个元素的值。最少操作数的策略应该是以平均数为中心，中心右边的数减小，对称的中心左边的数增大。由于原数组是等差数列，两两元素之间相差 2，利用数学方法可以算出操作数。
+- 数组长度分为奇数和偶数分别讨论。如果数组长度为奇数，所需要的操作数是：
+
+ $$\begin{aligned} &\quad 2 + 4 + \cdots + 2\cdot\left\lfloor\frac{n}{2}\right\rfloor \\ &= \frac{1}{2}\left\lfloor\frac{n}{2}\right\rfloor\left(2\cdot\left\lfloor\frac{n}{2}\right\rfloor + 2\right) \\ &= \left\lfloor\frac{n}{2}\right\rfloor \left(\left\lfloor\frac{n}{2}\right\rfloor + 1\right) \\ &= \frac{n-1}{2}\left(\frac{n-1}{2} + 1\right) \\ &= \frac{n-1}{2}\cdot\frac{n+1}{2} \\ &= \frac{n^2-1}{4} \\ &= \left\lfloor\frac{n^2}{4}\right\rfloor \end{aligned}$$
+
+ 数组长度是偶数，所需要的操作数是：
+
+ $$\begin{aligned} &\quad 1 + 3 + \cdots + \left(2\cdot\left\lfloor\frac{n}{2}\right\rfloor - 1\right) \\ &= \frac{1}{2}\left\lfloor\frac{n}{2}\right\rfloor\left(2\cdot\left\lfloor\frac{n}{2}\right\rfloor - 1 + 1\right)\\ &= \left(\left\lfloor\frac{n}{2}\right\rfloor\right)^2 \\ &= \frac{n^2}{4} \end{aligned}$$
+
+ 综上所述，最小操作数是 n^2/4
+
+## 代码
+
+```go
+package leetcode
+
+func minOperations(n int) int {
+ return n * n / 4
+}
+```
\ No newline at end of file
diff --git a/leetcode/1572.Matrix-Diagonal-Sum/1572.Matrix Diagonal Sum.go b/leetcode/1572.Matrix-Diagonal-Sum/1572.Matrix Diagonal Sum.go
new file mode 100644
index 000000000..4f1756a33
--- /dev/null
+++ b/leetcode/1572.Matrix-Diagonal-Sum/1572.Matrix Diagonal Sum.go
@@ -0,0 +1,16 @@
+package leetcode
+
+func diagonalSum(mat [][]int) int {
+ n := len(mat)
+ ans := 0
+ for pi := 0; pi < n; pi++ {
+ ans += mat[pi][pi]
+ }
+ for si, sj := n-1, 0; sj < n; si, sj = si-1, sj+1 {
+ ans += mat[si][sj]
+ }
+ if n%2 == 0 {
+ return ans
+ }
+ return ans - mat[n/2][n/2]
+}
diff --git a/leetcode/1572.Matrix-Diagonal-Sum/1572.Matrix Diagonal Sum_test.go b/leetcode/1572.Matrix-Diagonal-Sum/1572.Matrix Diagonal Sum_test.go
new file mode 100644
index 000000000..c658de147
--- /dev/null
+++ b/leetcode/1572.Matrix-Diagonal-Sum/1572.Matrix Diagonal Sum_test.go
@@ -0,0 +1,51 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question1572 struct {
+ para1572
+ ans1572
+}
+
+// para 是参数
+type para1572 struct {
+ mat [][]int
+}
+
+// ans 是答案
+// one 代表第一个答案
+type ans1572 struct {
+ one int
+}
+
+func Test_Problem1572(t *testing.T) {
+
+ qs := []question1572{
+
+ {
+ para1572{[][]int{{1, 2, 3}, {4, 5, 6}, {7, 8, 9}}},
+ ans1572{25},
+ },
+
+ {
+ para1572{[][]int{{1, 1, 1, 1}, {1, 1, 1, 1}, {1, 1, 1, 1}, {1, 1, 1, 1}}},
+ ans1572{8},
+ },
+
+ {
+ para1572{[][]int{{5}}},
+ ans1572{5},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 1572------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans1572, q.para1572
+ fmt.Printf("【input】:%v 【output】:%v \n", p, diagonalSum(p.mat))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/1572.Matrix-Diagonal-Sum/README.md b/leetcode/1572.Matrix-Diagonal-Sum/README.md
new file mode 100644
index 000000000..697aef7ee
--- /dev/null
+++ b/leetcode/1572.Matrix-Diagonal-Sum/README.md
@@ -0,0 +1,77 @@
+# [1572. Matrix Diagonal Sum](https://leetcode.com/problems/matrix-diagonal-sum/)
+
+
+## 题目
+
+Given a square matrix `mat`, return the sum of the matrix diagonals.
+
+Only include the sum of all the elements on the primary diagonal and all the elements on the secondary diagonal that are not part of the primary diagonal.
+
+**Example 1:**
+
+
+
+```
+Input: mat = [[1,2,3],
+ [4,5,6],
+ [7,8,9]]
+Output: 25
+Explanation:Diagonals sum: 1 + 5 + 9 + 3 + 7 = 25
+Notice that element mat[1][1] = 5 is counted only once.
+
+```
+
+**Example 2:**
+
+```
+Input: mat = [[1,1,1,1],
+ [1,1,1,1],
+ [1,1,1,1],
+ [1,1,1,1]]
+Output: 8
+
+```
+
+**Example 3:**
+
+```
+Input: mat = [[5]]
+Output: 5
+
+```
+
+**Constraints:**
+
+- `n == mat.length == mat[i].length`
+- `1 <= n <= 100`
+- `1 <= mat[i][j] <= 100`
+
+## 题目大意
+
+给你一个正方形矩阵 mat，请你返回矩阵对角线元素的和。请你返回在矩阵主对角线上的元素和副对角线上且不在主对角线上元素的和。
+
+## 解题思路
+
+- 简单题。根据题意，把主对角线和副对角线上的元素相加。
+- 如果正方形矩阵的长度 n 为奇数，相加的结果需要减去 mat[n/2][n/2]。
+
+## 代码
+
+```go
+package leetcode
+
+func diagonalSum(mat [][]int) int {
+ n := len(mat)
+ ans := 0
+ for pi := 0; pi < n; pi++ {
+ ans += mat[pi][pi]
+ }
+ for si, sj := n-1, 0; sj < n; si, sj = si-1, sj+1 {
+ ans += mat[si][sj]
+ }
+ if n%2 == 0 {
+ return ans
+ }
+ return ans - mat[n/2][n/2]
+}
+```
\ No newline at end of file
diff --git a/leetcode/1573.Number-of-Ways-to-Split-a-String/1573. Number of Ways to Split a String.go b/leetcode/1573.Number-of-Ways-to-Split-a-String/1573. Number of Ways to Split a String.go
new file mode 100644
index 000000000..8d81e4956
--- /dev/null
+++ b/leetcode/1573.Number-of-Ways-to-Split-a-String/1573. Number of Ways to Split a String.go
@@ -0,0 +1,38 @@
+package leetcode
+
+func numWays(s string) int {
+ ones := 0
+ for _, c := range s {
+ if c == '1' {
+ ones++
+ }
+ }
+ if ones%3 != 0 {
+ return 0
+ }
+ if ones == 0 {
+ return (len(s) - 1) * (len(s) - 2) / 2 % 1000000007
+ }
+ N, a, b, c, d, count := ones/3, 0, 0, 0, 0, 0
+ for i, letter := range s {
+ if letter == '0' {
+ continue
+ }
+ if letter == '1' {
+ count++
+ }
+ if count == N {
+ a = i
+ }
+ if count == N+1 {
+ b = i
+ }
+ if count == 2*N {
+ c = i
+ }
+ if count == 2*N+1 {
+ d = i
+ }
+ }
+ return (b - a) * (d - c) % 1000000007
+}
diff --git a/leetcode/1573.Number-of-Ways-to-Split-a-String/1573. Number of Ways to Split a String_test.go b/leetcode/1573.Number-of-Ways-to-Split-a-String/1573. Number of Ways to Split a String_test.go
new file mode 100644
index 000000000..367191452
--- /dev/null
+++ b/leetcode/1573.Number-of-Ways-to-Split-a-String/1573. Number of Ways to Split a String_test.go
@@ -0,0 +1,57 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question1573 struct {
+ para1573
+ ans1573
+}
+
+// para 是参数
+// one 代表第一个参数
+type para1573 struct {
+ s string
+}
+
+// ans 是答案
+// one 代表第一个答案
+type ans1573 struct {
+ one int
+}
+
+func Test_Problem1573(t *testing.T) {
+
+ qs := []question1573{
+
+ {
+ para1573{"10101"},
+ ans1573{4},
+ },
+
+ {
+ para1573{"1001"},
+ ans1573{0},
+ },
+
+ {
+ para1573{"0000"},
+ ans1573{3},
+ },
+
+ {
+ para1573{"100100010100110"},
+ ans1573{12},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 1573------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans1573, q.para1573
+ fmt.Printf("【input】:%v 【output】:%v \n", p, numWays(p.s))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/1573.Number-of-Ways-to-Split-a-String/README.md b/leetcode/1573.Number-of-Ways-to-Split-a-String/README.md
new file mode 100644
index 000000000..6b8ac2266
--- /dev/null
+++ b/leetcode/1573.Number-of-Ways-to-Split-a-String/README.md
@@ -0,0 +1,108 @@
+# [1573. Number of Ways to Split a String](https://leetcode.com/problems/number-of-ways-to-split-a-string/)
+
+
+## 题目
+
+Given a binary string `s` (a string consisting only of '0's and '1's), we can split `s` into 3 **non-empty** strings s1, s2, s3 (s1+ s2+ s3 = s).
+
+Return the number of ways `s` can be split such that the number of characters '1' is the same in s1, s2, and s3.
+
+Since the answer may be too large, return it modulo 10^9 + 7.
+
+**Example 1:**
+
+```
+Input: s = "10101"
+Output: 4
+Explanation: There are four ways to split s in 3 parts where each part contain the same number of letters '1'.
+"1|010|1"
+"1|01|01"
+"10|10|1"
+"10|1|01"
+
+```
+
+**Example 2:**
+
+```
+Input: s = "1001"
+Output: 0
+
+```
+
+**Example 3:**
+
+```
+Input: s = "0000"
+Output: 3
+Explanation: There are three ways to split s in 3 parts.
+"0|0|00"
+"0|00|0"
+"00|0|0"
+
+```
+
+**Example 4:**
+
+```
+Input: s = "100100010100110"
+Output: 12
+
+```
+
+**Constraints:**
+
+- `3 <= s.length <= 10^5`
+- `s[i]` is `'0'` or `'1'`.
+
+## 题目大意
+
+给你一个二进制串 s （一个只包含 0 和 1 的字符串），我们可以将 s 分割成 3 个 非空 字符串 s1, s2, s3 （s1 + s2 + s3 = s）。请你返回分割 s 的方案数，满足 s1，s2 和 s3 中字符 '1' 的数目相同。由于答案可能很大，请将它对 10^9 + 7 取余后返回。
+
+## 解题思路
+
+- 这一题是考察的排列组合的知识。根据题意，如果 1 的个数不是 3 的倍数，直接返回 -1。如果字符串里面没有 1，那么切分的方案就是组合，在 n-1 个字母里面选出 2 个位置。利用组合的计算方法，组合数是 (n-1) * (n-2) / 2 。
+- 剩下的是 3 的倍数的情况。在字符串中选 2 个位置隔成 3 段。从第一段最后一个 1 到第二段第一个 1 之间的 0 的个数为 m1，从第二段最后一个 1 到第三段第一个 1 之间的 0 的个数为 m2。利用乘法原理，方案数为 m1 * m2。
+
+## 代码
+
+```go
+package leetcode
+
+func numWays(s string) int {
+ ones := 0
+ for _, c := range s {
+ if c == '1' {
+ ones++
+ }
+ }
+ if ones%3 != 0 {
+ return 0
+ }
+ if ones == 0 {
+ return (len(s) - 1) * (len(s) - 2) / 2 % 1000000007
+ }
+ N, a, b, c, d, count := ones/3, 0, 0, 0, 0, 0
+ for i, letter := range s {
+ if letter == '0' {
+ continue
+ }
+ if letter == '1' {
+ count++
+ }
+ if count == N {
+ a = i
+ }
+ if count == N+1 {
+ b = i
+ }
+ if count == 2*N {
+ c = i
+ }
+ if count == 2*N+1 {
+ d = i
+ }
+ }
+ return (b - a) * (d - c) % 1000000007
+}
+```
\ No newline at end of file
diff --git a/leetcode/1576.Replace-All-s-to-Avoid-Consecutive-Repeating-Characters/1576. Replace-All-s-to-Avoid-Consecutive-Repeating-Characters.go b/leetcode/1576.Replace-All-s-to-Avoid-Consecutive-Repeating-Characters/1576. Replace-All-s-to-Avoid-Consecutive-Repeating-Characters.go
new file mode 100644
index 000000000..1e1f287d0
--- /dev/null
+++ b/leetcode/1576.Replace-All-s-to-Avoid-Consecutive-Repeating-Characters/1576. Replace-All-s-to-Avoid-Consecutive-Repeating-Characters.go
@@ -0,0 +1,16 @@
+package leetcode
+
+func modifyString(s string) string {
+ res := []byte(s)
+ for i, ch := range res {
+ if ch == '?' {
+ for b := byte('a'); b <= 'z'; b++ {
+ if !(i > 0 && res[i-1] == b || i < len(res)-1 && res[i+1] == b) {
+ res[i] = b
+ break
+ }
+ }
+ }
+ }
+ return string(res)
+}
diff --git a/leetcode/1576.Replace-All-s-to-Avoid-Consecutive-Repeating-Characters/1576. Replace-All-s-to-Avoid-Consecutive-Repeating-Characters_test.go b/leetcode/1576.Replace-All-s-to-Avoid-Consecutive-Repeating-Characters/1576. Replace-All-s-to-Avoid-Consecutive-Repeating-Characters_test.go
new file mode 100644
index 000000000..9513b182c
--- /dev/null
+++ b/leetcode/1576.Replace-All-s-to-Avoid-Consecutive-Repeating-Characters/1576. Replace-All-s-to-Avoid-Consecutive-Repeating-Characters_test.go
@@ -0,0 +1,47 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question1576 struct {
+ para1576
+ ans1576
+}
+
+// para 是参数
+// one 代表第一个参数
+type para1576 struct {
+ s string
+}
+
+// ans 是答案
+// one 代表第一个答案
+type ans1576 struct {
+ one string
+}
+
+func Test_Problem1576(t *testing.T) {
+
+ qs := []question1576{
+
+ {
+ para1576{"?zs"},
+ ans1576{"azs"},
+ },
+
+ {
+ para1576{"ubv?w"},
+ ans1576{"ubvaw"},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 1576------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans1576, q.para1576
+ fmt.Printf("【input】:%v 【output】:%v \n", p, modifyString(p.s))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/1576.Replace-All-s-to-Avoid-Consecutive-Repeating-Characters/README.md b/leetcode/1576.Replace-All-s-to-Avoid-Consecutive-Repeating-Characters/README.md
new file mode 100644
index 000000000..9d7a93b39
--- /dev/null
+++ b/leetcode/1576.Replace-All-s-to-Avoid-Consecutive-Repeating-Characters/README.md
@@ -0,0 +1,63 @@
+# [1576. Replace All ?'s to Avoid Consecutive Repeating Characters](https://leetcode.com/problems/replace-all-s-to-avoid-consecutive-repeating-characters/)
+
+## 题目
+
+Given a string `s` containing only lowercase English letters and the `'?'` character, convert **all** the `'?'` characters into lowercase letters such that the final string does not contain any **consecutive repeating** characters. You **cannot** modify the non `'?'` characters.
+
+It is **guaranteed** that there are no consecutive repeating characters in the given string **except** for `'?'`.
+
+Return *the final string after all the conversions (possibly zero) have been made*. If there is more than one solution, return **any of them**. It can be shown that an answer is always possible with the given constraints.
+
+**Example 1:**
+
+```
+Input: s = "?zs"
+Output: "azs"
+Explanation: There are 25 solutions for this problem. From "azs" to "yzs", all are valid. Only "z" is an invalid modification as the string will consist of consecutive repeating characters in "zzs".
+
+```
+
+**Example 2:**
+
+```
+Input: s = "ubv?w"
+Output: "ubvaw"
+Explanation: There are 24 solutions for this problem. Only "v" and "w" are invalid modifications as the strings will consist of consecutive repeating characters in "ubvvw" and "ubvww".
+
+```
+
+**Constraints:**
+
+- `1 <= s.length <= 100`
+- `s` consist of lowercase English letters and `'?'`.
+
+## 题目大意
+
+给你一个仅包含小写英文字母和 '?' 字符的字符串 s，请你将所有的 '?' 转换为若干小写字母，使最终的字符串不包含任何 连续重复 的字符。注意：你 不能 修改非 '?' 字符。
+
+题目测试用例保证 除 '?' 字符 之外，不存在连续重复的字符。在完成所有转换（可能无需转换）后返回最终的字符串。如果有多个解决方案，请返回其中任何一个。可以证明，在给定的约束条件下，答案总是存在的。
+
+## 解题思路
+
+- 简单题。找到源字符串中 ‘?’ 字符的位置，然后依次用 a ~ z 字符去替换，替换进去的字符不能和前后字符相同即可。
+
+## 代码
+
+```go
+package leetcode
+
+func modifyString(s string) string {
+ res := []byte(s)
+ for i, ch := range res {
+ if ch == '?' {
+ for b := byte('a'); b <= 'z'; b++ {
+ if !(i > 0 && res[i-1] == b || i < len(res)-1 && res[i+1] == b) {
+ res[i] = b
+ break
+ }
+ }
+ }
+ }
+ return string(res)
+}
+```
\ No newline at end of file
diff --git a/leetcode/1579.Remove-Max-Number-of-Edges-to-Keep-Graph-Fully-Traversable/1579. Remove Max Number of Edges to Keep Graph Fully Traversable.go b/leetcode/1579.Remove-Max-Number-of-Edges-to-Keep-Graph-Fully-Traversable/1579. Remove Max Number of Edges to Keep Graph Fully Traversable.go
new file mode 100644
index 000000000..9ea0984fc
--- /dev/null
+++ b/leetcode/1579.Remove-Max-Number-of-Edges-to-Keep-Graph-Fully-Traversable/1579. Remove Max Number of Edges to Keep Graph Fully Traversable.go
@@ -0,0 +1,30 @@
+package leetcode
+
+import (
+ "github.com/halfrost/LeetCode-Go/template"
+)
+
+func maxNumEdgesToRemove(n int, edges [][]int) int {
+ alice, bob, res := template.UnionFind{}, template.UnionFind{}, len(edges)
+ alice.Init(n)
+ bob.Init(n)
+ for _, e := range edges {
+ x, y := e[1]-1, e[2]-1
+ if e[0] == 3 && (!(alice.Find(x) == alice.Find(y)) || !(bob.Find(x) == bob.Find(y))) {
+ alice.Union(x, y)
+ bob.Union(x, y)
+ res--
+ }
+ }
+ ufs := [2]*template.UnionFind{&alice, &bob}
+ for _, e := range edges {
+ if tp := e[0]; tp < 3 && !(ufs[tp-1].Find(e[1]-1) == ufs[tp-1].Find(e[2]-1)) {
+ ufs[tp-1].Union(e[1]-1, e[2]-1)
+ res--
+ }
+ }
+ if alice.TotalCount() > 1 || bob.TotalCount() > 1 {
+ return -1
+ }
+ return res
+}
diff --git a/leetcode/1579.Remove-Max-Number-of-Edges-to-Keep-Graph-Fully-Traversable/1579. Remove Max Number of Edges to Keep Graph Fully Traversable_test.go b/leetcode/1579.Remove-Max-Number-of-Edges-to-Keep-Graph-Fully-Traversable/1579. Remove Max Number of Edges to Keep Graph Fully Traversable_test.go
new file mode 100644
index 000000000..be247a192
--- /dev/null
+++ b/leetcode/1579.Remove-Max-Number-of-Edges-to-Keep-Graph-Fully-Traversable/1579. Remove Max Number of Edges to Keep Graph Fully Traversable_test.go
@@ -0,0 +1,53 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question1579 struct {
+ para1579
+ ans1579
+}
+
+// para 是参数
+// one 代表第一个参数
+type para1579 struct {
+ n int
+ edges [][]int
+}
+
+// ans 是答案
+// one 代表第一个答案
+type ans1579 struct {
+ one int
+}
+
+func Test_Problem1579(t *testing.T) {
+
+ qs := []question1579{
+
+ {
+ para1579{4, [][]int{{3, 1, 2}, {3, 2, 3}, {1, 1, 3}, {1, 2, 4}, {1, 1, 2}, {2, 3, 4}}},
+ ans1579{2},
+ },
+
+ {
+ para1579{4, [][]int{{3, 1, 2}, {3, 2, 3}, {1, 1, 4}, {2, 1, 4}}},
+ ans1579{0},
+ },
+
+ {
+ para1579{4, [][]int{{3, 2, 3}, {1, 1, 2}, {2, 3, 4}}},
+ ans1579{-1},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 1579------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans1579, q.para1579
+ fmt.Printf("【input】:%v 【output】:%v \n", p, maxNumEdgesToRemove(p.n, p.edges))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/1579.Remove-Max-Number-of-Edges-to-Keep-Graph-Fully-Traversable/README.md b/leetcode/1579.Remove-Max-Number-of-Edges-to-Keep-Graph-Fully-Traversable/README.md
new file mode 100644
index 000000000..4f4e8db34
--- /dev/null
+++ b/leetcode/1579.Remove-Max-Number-of-Edges-to-Keep-Graph-Fully-Traversable/README.md
@@ -0,0 +1,103 @@
+# [1579. Remove Max Number of Edges to Keep Graph Fully Traversable](https://leetcode.com/problems/remove-max-number-of-edges-to-keep-graph-fully-traversable/)
+
+
+## 题目
+
+Alice and Bob have an undirected graph of `n` nodes and 3 types of edges:
+
+- Type 1: Can be traversed by Alice only.
+- Type 2: Can be traversed by Bob only.
+- Type 3: Can by traversed by both Alice and Bob.
+
+Given an array `edges` where `edges[i] = [typei, ui, vi]` represents a bidirectional edge of type `typei` between nodes `ui` and `vi`, find the maximum number of edges you can remove so that after removing the edges, the graph can still be fully traversed by both Alice and Bob. The graph is fully traversed by Alice and Bob if starting from any node, they can reach all other nodes.
+
+Return *the maximum number of edges you can remove, or return* `-1` *if it's impossible for the graph to be fully traversed by Alice and Bob.*
+
+**Example 1:**
+
+
+
+```
+Input: n = 4, edges = [[3,1,2],[3,2,3],[1,1,3],[1,2,4],[1,1,2],[2,3,4]]
+Output: 2
+Explanation: If we remove the 2 edges [1,1,2] and [1,1,3]. The graph will still be fully traversable by Alice and Bob. Removing any additional edge will not make it so. So the maximum number of edges we can remove is 2.
+```
+
+**Example 2:**
+
+
+
+```
+Input: n = 4, edges = [[3,1,2],[3,2,3],[1,1,4],[2,1,4]]
+Output: 0
+Explanation: Notice that removing any edge will not make the graph fully traversable by Alice and Bob.
+```
+
+**Example 3:**
+
+
+
+```
+Input: n = 4, edges = [[3,2,3],[1,1,2],[2,3,4]]
+Output: -1
+Explanation: In the current graph, Alice cannot reach node 4 from the other nodes. Likewise, Bob cannot reach 1. Therefore it's impossible to make the graph fully traversable.
+```
+
+**Constraints:**
+
+- `1 <= n <= 10^5`
+- `1 <= edges.length <= min(10^5, 3 * n * (n-1) / 2)`
+- `edges[i].length == 3`
+- `1 <= edges[i][0] <= 3`
+- `1 <= edges[i][1] < edges[i][2] <= n`
+- All tuples `(typei, ui, vi)` are distinct.
+
+## 题目大意
+
+Alice 和 Bob 共有一个无向图，其中包含 n 个节点和 3 种类型的边：
+
+- 类型 1：只能由 Alice 遍历。
+- 类型 2：只能由 Bob 遍历。
+- 类型 3：Alice 和 Bob 都可以遍历。
+
+给你一个数组 edges ，其中 edges[i] = [typei, ui, vi] 表示节点 ui 和 vi 之间存在类型为 typei 的双向边。请你在保证图仍能够被 Alice和 Bob 完全遍历的前提下，找出可以删除的最大边数。如果从任何节点开始，Alice 和 Bob 都可以到达所有其他节点，则认为图是可以完全遍历的。返回可以删除的最大边数，如果 Alice 和 Bob 无法完全遍历图，则返回 -1 。
+
+## 解题思路
+
+- 本题是第 1319 题的加强版。在第 1319 题中只有一个人，同样也是判断在保证图可连通的基础上，删掉最多边的条数。这一题只不过变成了 2 个人。解题思路依旧是并查集。
+- 初始化 2 个并查集，分别表示 Alice 和 Bob。先合并公共边，每合并一条边，可删除的最大总边数便减少 1 。再合并 2 人各自的单独的边，同样是每合并一条边，每合并一条边，可删除的最大总边数便减少 1 。合并完所有的边，2 人的并查集内部集合数仍大于 1，那么则代表 2 人无法完全遍历图，则输出 -1。如果 2 人的并查集内部集合都是 1，代表整个图都连通了。输出可以删除的最大边数。
+
+## 代码
+
+```go
+package leetcode
+
+import (
+ "github.com/halfrost/LeetCode-Go/template"
+)
+
+func maxNumEdgesToRemove(n int, edges [][]int) int {
+ alice, bob, res := template.UnionFind{}, template.UnionFind{}, len(edges)
+ alice.Init(n)
+ bob.Init(n)
+ for _, e := range edges {
+ x, y := e[1]-1, e[2]-1
+ if e[0] == 3 && (!(alice.Find(x) == alice.Find(y)) || !(bob.Find(x) == bob.Find(y))) {
+ alice.Union(x, y)
+ bob.Union(x, y)
+ res--
+ }
+ }
+ ufs := [2]*template.UnionFind{&alice, &bob}
+ for _, e := range edges {
+ if tp := e[0]; tp < 3 && !(ufs[tp-1].Find(e[1]-1) == ufs[tp-1].Find(e[2]-1)) {
+ ufs[tp-1].Union(e[1]-1, e[2]-1)
+ res--
+ }
+ }
+ if alice.TotalCount() > 1 || bob.TotalCount() > 1 {
+ return -1
+ }
+ return res
+}
+```
\ No newline at end of file
diff --git a/leetcode/1600.Throne-Inheritance/1600. Throne Inheritance.go b/leetcode/1600.Throne-Inheritance/1600. Throne Inheritance.go
new file mode 100644
index 000000000..4ab87aff8
--- /dev/null
+++ b/leetcode/1600.Throne-Inheritance/1600. Throne Inheritance.go
@@ -0,0 +1,41 @@
+package leetcode
+
+type ThroneInheritance struct {
+ king string
+ edges map[string][]string
+ dead map[string]bool
+}
+
+func Constructor(kingName string) (t ThroneInheritance) {
+ return ThroneInheritance{kingName, map[string][]string{}, map[string]bool{}}
+}
+
+func (t *ThroneInheritance) Birth(parentName, childName string) {
+ t.edges[parentName] = append(t.edges[parentName], childName)
+}
+
+func (t *ThroneInheritance) Death(name string) {
+ t.dead[name] = true
+}
+
+func (t *ThroneInheritance) GetInheritanceOrder() (res []string) {
+ var preorder func(string)
+ preorder = func(name string) {
+ if !t.dead[name] {
+ res = append(res, name)
+ }
+ for _, childName := range t.edges[name] {
+ preorder(childName)
+ }
+ }
+ preorder(t.king)
+ return
+}
+
+/**
+ * Your ThroneInheritance object will be instantiated and called as such:
+ * obj := Constructor(kingName);
+ * obj.Birth(parentName,childName);
+ * obj.Death(name);
+ * param_3 := obj.GetInheritanceOrder();
+ */
diff --git a/leetcode/1600.Throne-Inheritance/1600. Throne Inheritance_test.go b/leetcode/1600.Throne-Inheritance/1600. Throne Inheritance_test.go
new file mode 100644
index 000000000..2ce13f58a
--- /dev/null
+++ b/leetcode/1600.Throne-Inheritance/1600. Throne Inheritance_test.go
@@ -0,0 +1,29 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+func Test_Problem1600(t *testing.T) {
+ obj := Constructor("king")
+ fmt.Printf("obj = %v\n", obj)
+ obj.Birth("king", "andy")
+ fmt.Printf("obj = %v\n", obj)
+ obj.Birth("king", "bob")
+ fmt.Printf("obj = %v\n", obj)
+ obj.Birth("king", "catherine")
+ fmt.Printf("obj = %v\n", obj)
+ obj.Birth("andy", "matthew")
+ fmt.Printf("obj = %v\n", obj)
+ obj.Birth("bob", "alex")
+ fmt.Printf("obj = %v\n", obj)
+ obj.Birth("bob", "asha")
+ fmt.Printf("obj = %v\n", obj)
+ param2 := obj.GetInheritanceOrder()
+ fmt.Printf("param_2 = %v obj = %v\n", param2, obj)
+ obj.Death("bob")
+ fmt.Printf("obj = %v\n", obj)
+ param2 = obj.GetInheritanceOrder()
+ fmt.Printf("param_2 = %v obj = %v\n", param2, obj)
+}
diff --git a/leetcode/1600.Throne-Inheritance/README.md b/leetcode/1600.Throne-Inheritance/README.md
new file mode 100644
index 000000000..8e5ed385e
--- /dev/null
+++ b/leetcode/1600.Throne-Inheritance/README.md
@@ -0,0 +1,120 @@
+# [1600. Throne Inheritance](https://leetcode.com/problems/throne-inheritance/)
+
+
+## 题目
+
+A kingdom consists of a king, his children, his grandchildren, and so on. Every once in a while, someone in the family dies or a child is born.
+
+The kingdom has a well-defined order of inheritance that consists of the king as the first member. Let's define the recursive function `Successor(x, curOrder)`, which given a person `x` and the inheritance order so far, returns who should be the next person after `x` in the order of inheritance.
+
+```
+Successor(x, curOrder):
+ if x has no children or all of x's children are in curOrder:
+ if x is the king return null
+ else return Successor(x's parent, curOrder)
+ else return x's oldest child who's not in curOrder
+```
+
+For example, assume we have a kingdom that consists of the king, his children Alice and Bob (Alice is older than Bob), and finally Alice's son Jack.
+
+1. In the beginning, `curOrder` will be `["king"]`.
+2. Calling `Successor(king, curOrder)` will return Alice, so we append to `curOrder` to get `["king", "Alice"]`.
+3. Calling `Successor(Alice, curOrder)` will return Jack, so we append to `curOrder` to get `["king", "Alice", "Jack"]`.
+4. Calling `Successor(Jack, curOrder)` will return Bob, so we append to `curOrder` to get `["king", "Alice", "Jack", "Bob"]`.
+5. Calling `Successor(Bob, curOrder)` will return `null`. Thus the order of inheritance will be `["king", "Alice", "Jack", "Bob"]`.
+
+Using the above function, we can always obtain a unique order of inheritance.
+
+Implement the `ThroneInheritance` class:
+
+- `ThroneInheritance(string kingName)` Initializes an object of the `ThroneInheritance` class. The name of the king is given as part of the constructor.
+- `void birth(string parentName, string childName)` Indicates that `parentName` gave birth to `childName`.
+- `void death(string name)` Indicates the death of `name`. The death of the person doesn't affect the `Successor` function nor the current inheritance order. You can treat it as just marking the person as dead.
+- `string[] getInheritanceOrder()` Returns a list representing the current order of inheritance **excluding** dead people.
+
+**Example 1:**
+
+```
+Input
+["ThroneInheritance", "birth", "birth", "birth", "birth", "birth", "birth", "getInheritanceOrder", "death", "getInheritanceOrder"]
+[["king"], ["king", "andy"], ["king", "bob"], ["king", "catherine"], ["andy", "matthew"], ["bob", "alex"], ["bob", "asha"], [null], ["bob"], [null]]
+Output
+[null, null, null, null, null, null, null, ["king", "andy", "matthew", "bob", "alex", "asha", "catherine"], null, ["king", "andy", "matthew", "alex", "asha", "catherine"]]
+
+Explanation
+ThroneInheritance t= new ThroneInheritance("king"); // order:king
+t.birth("king", "andy"); // order: king >andy
+t.birth("king", "bob"); // order: king > andy >bob
+t.birth("king", "catherine"); // order: king > andy > bob >catherine
+t.birth("andy", "matthew"); // order: king > andy >matthew > bob > catherine
+t.birth("bob", "alex"); // order: king > andy > matthew > bob >alex > catherine
+t.birth("bob", "asha"); // order: king > andy > matthew > bob > alex >asha > catherine
+t.getInheritanceOrder(); // return ["king", "andy", "matthew", "bob", "alex", "asha", "catherine"]
+t.death("bob"); // order: king > andy > matthew >bob > alex > asha > catherine
+t.getInheritanceOrder(); // return ["king", "andy", "matthew", "alex", "asha", "catherine"]
+
+```
+
+**Constraints:**
+
+- `1 <= kingName.length, parentName.length, childName.length, name.length <= 15`
+- `kingName`, `parentName`, `childName`, and `name` consist of lowercase English letters only.
+- All arguments `childName` and `kingName` are **distinct**.
+- All `name` arguments of `death` will be passed to either the constructor or as `childName` to `birth` first.
+- For each call to `birth(parentName, childName)`, it is guaranteed that `parentName` is alive.
+- At most `105` calls will be made to `birth` and `death`.
+- At most `10` calls will be made to `getInheritanceOrder`.
+
+## 题目大意
+
+一个王国里住着国王、他的孩子们、他的孙子们等等。每一个时间点，这个家庭里有人出生也有人死亡。这个王国有一个明确规定的皇位继承顺序，第一继承人总是国王自己。我们定义递归函数 Successor(x, curOrder) ，给定一个人 x 和当前的继承顺序，该函数返回 x 的下一继承人。
+
+## 解题思路
+
+- 这道题思路不难。先将国王每个孩子按照顺序存在一个 map 中，然后每个国王的孩子还存在父子关系，同理也按顺序存在 map 中。执行 GetInheritanceOrder() 函数时，将国王的孩子按顺序遍历，如果每个孩子还有孩子，递归遍历到底。如果把继承关系看成一棵树，此题便是多叉树的先根遍历的问题。
+
+## 代码
+
+```go
+package leetcode
+
+type ThroneInheritance struct {
+ king string
+ edges map[string][]string
+ dead map[string]bool
+}
+
+func Constructor(kingName string) (t ThroneInheritance) {
+ return ThroneInheritance{kingName, map[string][]string{}, map[string]bool{}}
+}
+
+func (t *ThroneInheritance) Birth(parentName, childName string) {
+ t.edges[parentName] = append(t.edges[parentName], childName)
+}
+
+func (t *ThroneInheritance) Death(name string) {
+ t.dead[name] = true
+}
+
+func (t *ThroneInheritance) GetInheritanceOrder() (res []string) {
+ var preorder func(string)
+ preorder = func(name string) {
+ if !t.dead[name] {
+ res = append(res, name)
+ }
+ for _, childName := range t.edges[name] {
+ preorder(childName)
+ }
+ }
+ preorder(t.king)
+ return
+}
+
+/**
+ * Your ThroneInheritance object will be instantiated and called as such:
+ * obj := Constructor(kingName);
+ * obj.Birth(parentName,childName);
+ * obj.Death(name);
+ * param_3 := obj.GetInheritanceOrder();
+ */
+```
\ No newline at end of file
diff --git a/leetcode/1603.Design-Parking-System/1603. Design Parking System.go b/leetcode/1603.Design-Parking-System/1603. Design Parking System.go
new file mode 100644
index 000000000..86c9c60a5
--- /dev/null
+++ b/leetcode/1603.Design-Parking-System/1603. Design Parking System.go
@@ -0,0 +1,51 @@
+package leetcode
+
+type ParkingSystem struct {
+ Big int
+ Medium int
+ Small int
+}
+
+func Constructor(big int, medium int, small int) ParkingSystem {
+ return ParkingSystem{
+ Big: big,
+ Medium: medium,
+ Small: small,
+ }
+}
+
+func (this *ParkingSystem) AddCar(carType int) bool {
+ switch carType {
+ case 1:
+ {
+ if this.Big > 0 {
+ this.Big--
+ return true
+ }
+ return false
+ }
+ case 2:
+ {
+ if this.Medium > 0 {
+ this.Medium--
+ return true
+ }
+ return false
+ }
+ case 3:
+ {
+ if this.Small > 0 {
+ this.Small--
+ return true
+ }
+ return false
+ }
+ }
+ return false
+}
+
+/**
+ * Your ParkingSystem object will be instantiated and called as such:
+ * obj := Constructor(big, medium, small);
+ * param_1 := obj.AddCar(carType);
+ */
diff --git a/leetcode/1603.Design-Parking-System/1603. Design Parking System_test.go b/leetcode/1603.Design-Parking-System/1603. Design Parking System_test.go
new file mode 100644
index 000000000..9fa635702
--- /dev/null
+++ b/leetcode/1603.Design-Parking-System/1603. Design Parking System_test.go
@@ -0,0 +1,15 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+func Test_Problem1603(t *testing.T) {
+ obj := Constructor(1, 1, 0)
+ fmt.Printf("obj = %v\n", obj)
+ fmt.Printf("obj = %v\n", obj.AddCar(1))
+ fmt.Printf("obj = %v\n", obj.AddCar(2))
+ fmt.Printf("obj = %v\n", obj.AddCar(3))
+ fmt.Printf("obj = %v\n", obj.AddCar(1))
+}
diff --git a/leetcode/1603.Design-Parking-System/README.md b/leetcode/1603.Design-Parking-System/README.md
new file mode 100644
index 000000000..b4a5a8fe7
--- /dev/null
+++ b/leetcode/1603.Design-Parking-System/README.md
@@ -0,0 +1,103 @@
+# [1603. Design Parking System](https://leetcode.com/problems/design-parking-system/)
+
+
+## 题目
+
+Design a parking system for a parking lot. The parking lot has three kinds of parking spaces: big, medium, and small, with a fixed number of slots for each size.
+
+Implement the `ParkingSystem` class:
+
+- `ParkingSystem(int big, int medium, int small)` Initializes object of the `ParkingSystem` class. The number of slots for each parking space are given as part of the constructor.
+- `bool addCar(int carType)` Checks whether there is a parking space of `carType` for the car that wants to get into the parking lot. `carType` can be of three kinds: big, medium, or small, which are represented by `1`, `2`, and `3` respectively. **A car can only park in a parking space of its** `carType`. If there is no space available, return `false`, else park the car in that size space and return `true`.
+
+**Example 1:**
+
+```
+Input
+["ParkingSystem", "addCar", "addCar", "addCar", "addCar"]
+[[1, 1, 0], [1], [2], [3], [1]]
+Output
+[null, true, true, false, false]
+
+Explanation
+ParkingSystem parkingSystem = new ParkingSystem(1, 1, 0);
+parkingSystem.addCar(1); // return true because there is 1 available slot for a big car
+parkingSystem.addCar(2); // return true because there is 1 available slot for a medium car
+parkingSystem.addCar(3); // return false because there is no available slot for a small car
+parkingSystem.addCar(1); // return false because there is no available slot for a big car. It is already occupied.
+```
+
+**Constraints:**
+
+- `0 <= big, medium, small <= 1000`
+- `carType` is `1`, `2`, or `3`
+- At most `1000` calls will be made to `addCar`
+
+## 题目大意
+
+请你给一个停车场设计一个停车系统。停车场总共有三种不同大小的车位：大，中和小，每种尺寸分别有固定数目的车位。
+
+请你实现 ParkingSystem 类：
+
+- ParkingSystem(int big, int medium, int small) 初始化 ParkingSystem 类，三个参数分别对应每种停车位的数目。
+- bool addCar(int carType) 检查是否有 carType 对应的停车位。 carType 有三种类型：大，中，小，分别用数字 1， 2 和 3 表示。一辆车只能停在 carType 对应尺寸的停车位中。如果没有空车位，请返回 false ，否则将该车停入车位并返回 true 。
+
+## 解题思路
+
+- 简单题。分别用 3 个变量表示大，中和小车位。`addCar()` 判断这 3 个变量是否还有空车位即可。
+
+## 代码
+
+```go
+package leetcode
+
+type ParkingSystem struct {
+ Big int
+ Medium int
+ Small int
+}
+
+func Constructor(big int, medium int, small int) ParkingSystem {
+ return ParkingSystem{
+ Big: big,
+ Medium: medium,
+ Small: small,
+ }
+}
+
+func (this *ParkingSystem) AddCar(carType int) bool {
+ switch carType {
+ case 1:
+ {
+ if this.Big > 0 {
+ this.Big--
+ return true
+ }
+ return false
+ }
+ case 2:
+ {
+ if this.Medium > 0 {
+ this.Medium--
+ return true
+ }
+ return false
+ }
+ case 3:
+ {
+ if this.Small > 0 {
+ this.Small--
+ return true
+ }
+ return false
+ }
+ }
+ return false
+}
+
+/**
+ * Your ParkingSystem object will be instantiated and called as such:
+ * obj := Constructor(big, medium, small);
+ * param_1 := obj.AddCar(carType);
+ */
+```
\ No newline at end of file
diff --git a/leetcode/1608.Special-Array-With-X-Elements-Greater-Than-or-Equal-X/1608. Special Array With X Elements Greater Than or Equal X.go b/leetcode/1608.Special-Array-With-X-Elements-Greater-Than-or-Equal-X/1608. Special Array With X Elements Greater Than or Equal X.go
new file mode 100644
index 000000000..27ea1e025
--- /dev/null
+++ b/leetcode/1608.Special-Array-With-X-Elements-Greater-Than-or-Equal-X/1608. Special Array With X Elements Greater Than or Equal X.go
@@ -0,0 +1,18 @@
+package leetcode
+
+import "sort"
+
+func specialArray(nums []int) int {
+ sort.Ints(nums)
+ x := len(nums)
+ for _, num := range nums {
+ if num >= x {
+ return x
+ }
+ x--
+ if num >= x {
+ return -1
+ }
+ }
+ return -1
+}
diff --git a/leetcode/1608.Special-Array-With-X-Elements-Greater-Than-or-Equal-X/1608. Special Array With X Elements Greater Than or Equal X_test.go b/leetcode/1608.Special-Array-With-X-Elements-Greater-Than-or-Equal-X/1608. Special Array With X Elements Greater Than or Equal X_test.go
new file mode 100644
index 000000000..5d17d1c46
--- /dev/null
+++ b/leetcode/1608.Special-Array-With-X-Elements-Greater-Than-or-Equal-X/1608. Special Array With X Elements Greater Than or Equal X_test.go
@@ -0,0 +1,57 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question1608 struct {
+ para1608
+ ans1608
+}
+
+// para 是参数
+// one 代表第一个参数
+type para1608 struct {
+ nums []int
+}
+
+// ans 是答案
+// one 代表第一个答案
+type ans1608 struct {
+ one int
+}
+
+func Test_Problem1608(t *testing.T) {
+
+ qs := []question1608{
+
+ {
+ para1608{[]int{3, 5}},
+ ans1608{2},
+ },
+
+ {
+ para1608{[]int{0, 0}},
+ ans1608{-1},
+ },
+
+ {
+ para1608{[]int{0, 4, 3, 0, 4}},
+ ans1608{3},
+ },
+
+ {
+ para1608{[]int{3, 6, 7, 7, 0}},
+ ans1608{-1},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 1608------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans1608, q.para1608
+ fmt.Printf("【input】:%v 【output】:%v \n", p, specialArray(p.nums))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/1608.Special-Array-With-X-Elements-Greater-Than-or-Equal-X/README.md b/leetcode/1608.Special-Array-With-X-Elements-Greater-Than-or-Equal-X/README.md
new file mode 100644
index 000000000..96ac718ac
--- /dev/null
+++ b/leetcode/1608.Special-Array-With-X-Elements-Greater-Than-or-Equal-X/README.md
@@ -0,0 +1,80 @@
+# [1608. Special Array With X Elements Greater Than or Equal X](https://leetcode.com/problems/special-array-with-x-elements-greater-than-or-equal-x/)
+
+## 题目
+
+You are given an array `nums` of non-negative integers. `nums` is considered **special** if there exists a number `x` such that there are **exactly** `x` numbers in `nums` that are **greater than or equal to** `x`.
+
+Notice that `x` **does not** have to be an element in `nums`.
+
+Return `x` *if the array is **special**, otherwise, return* `-1`. It can be proven that if `nums` is special, the value for `x` is **unique**.
+
+**Example 1:**
+
+```
+Input: nums = [3,5]
+Output: 2
+Explanation: There are 2 values (3 and 5) that are greater than or equal to 2.
+```
+
+**Example 2:**
+
+```
+Input: nums = [0,0]
+Output: -1
+Explanation: No numbers fit the criteria for x.
+If x = 0, there should be 0 numbers >= x, but there are 2.
+If x = 1, there should be 1 number >= x, but there are 0.
+If x = 2, there should be 2 numbers >= x, but there are 0.
+x cannot be greater since there are only 2 numbers in nums.
+```
+
+**Example 3:**
+
+```
+Input: nums = [0,4,3,0,4]
+Output: 3
+Explanation: There are 3 values that are greater than or equal to 3.
+```
+
+**Example 4:**
+
+```
+Input: nums = [3,6,7,7,0]
+Output: -1
+```
+
+**Constraints:**
+
+- `1 <= nums.length <= 100`
+- `0 <= nums[i] <= 1000`
+
+## 题目大意
+
+给你一个非负整数数组 nums 。如果存在一个数 x ，使得 nums 中恰好有 x 个元素 大于或者等于 x ，那么就称 nums 是一个 特殊数组 ，而 x 是该数组的 特征值 。（注意： x 不必 是 nums 的中的元素。）如果数组 nums 是一个 特殊数组 ，请返回它的特征值 x 。否则，返回 -1 。可以证明的是，如果 nums 是特殊数组，那么其特征值 x 是 唯一的 。
+
+## 解题思路
+
+- 简单题。抓住题干中给的证明，特征值是唯一的。先将数组从小到大排序，下标的含义与特征值就等价了。下标 `i` 代表大于等于 `nums[i]` 的元素有 `len(nums) - i` 个，那么从第 0 个下标的元素开始遍历，如果这个元素都大于 `len(nums)`，那么后面 `len(nums)` 个元素也都大于等于它，特征值就找到了。如果特征值减一以后，仍然满足 `nums[i] >= x`，说明满足条件的值有多个，这一点不满足特征值唯一性，可以直接返回 -1 了。下标继续右移，特征值继续减一。如果最终循环结束依旧找不到特征值，返回 -1 。
+
+## 代码
+
+```go
+package leetcode
+
+import "sort"
+
+func specialArray(nums []int) int {
+ sort.Ints(nums)
+ x := len(nums)
+ for _, num := range nums {
+ if num >= x {
+ return x
+ }
+ x--
+ if num >= x {
+ return -1
+ }
+ }
+ return -1
+}
+```
\ No newline at end of file
diff --git a/leetcode/1609.Even-Odd-Tree/1609.Even Odd Tree.go b/leetcode/1609.Even-Odd-Tree/1609.Even Odd Tree.go
new file mode 100644
index 000000000..e48683a0b
--- /dev/null
+++ b/leetcode/1609.Even-Odd-Tree/1609.Even Odd Tree.go
@@ -0,0 +1,72 @@
+package leetcode
+
+type TreeNode struct {
+ Val int
+ Left *TreeNode
+ Right *TreeNode
+}
+
+func isEvenOddTree(root *TreeNode) bool {
+ level := 0
+ queue := []*TreeNode{root}
+ for len(queue) != 0 {
+ length := len(queue)
+ var nums []int
+ for i := 0; i < length; i++ {
+ node := queue[i]
+ if node.Left != nil {
+ queue = append(queue, node.Left)
+ }
+ if node.Right != nil {
+ queue = append(queue, node.Right)
+ }
+ nums = append(nums, node.Val)
+ }
+ if level%2 == 0 {
+ if !even(nums) {
+ return false
+ }
+ } else {
+ if !odd(nums) {
+ return false
+ }
+ }
+ queue = queue[length:]
+ level++
+ }
+ return true
+}
+
+func odd(nums []int) bool {
+ cur := nums[0]
+ if cur%2 != 0 {
+ return false
+ }
+ for _, num := range nums[1:] {
+ if num >= cur {
+ return false
+ }
+ if num%2 != 0 {
+ return false
+ }
+ cur = num
+ }
+ return true
+}
+
+func even(nums []int) bool {
+ cur := nums[0]
+ if cur%2 == 0 {
+ return false
+ }
+ for _, num := range nums[1:] {
+ if num <= cur {
+ return false
+ }
+ if num%2 == 0 {
+ return false
+ }
+ cur = num
+ }
+ return true
+}
diff --git a/leetcode/1609.Even-Odd-Tree/1609.Even Odd Tree_test.go b/leetcode/1609.Even-Odd-Tree/1609.Even Odd Tree_test.go
new file mode 100644
index 000000000..6ac31fbc5
--- /dev/null
+++ b/leetcode/1609.Even-Odd-Tree/1609.Even Odd Tree_test.go
@@ -0,0 +1,73 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question1609 struct {
+ para1609
+ ans1609
+}
+
+// para 是参数
+type para1609 struct {
+ root *TreeNode
+}
+
+// ans 是答案
+type ans1609 struct {
+ ans bool
+}
+
+func Test_Problem1609(t *testing.T) {
+
+ qs := []question1609{
+
+ {
+ para1609{&TreeNode{1,
+ &TreeNode{10,
+ &TreeNode{3, &TreeNode{12, nil, nil}, &TreeNode{8, nil, nil}}, nil},
+ &TreeNode{4, &TreeNode{7, &TreeNode{6, nil, nil}, nil}, &TreeNode{9, nil, &TreeNode{2, nil, nil}}}}},
+ ans1609{true},
+ },
+
+ {
+ para1609{&TreeNode{5,
+ &TreeNode{4, &TreeNode{3, nil, nil}, &TreeNode{3, nil, nil}},
+ &TreeNode{2, &TreeNode{7, nil, nil}, nil}}},
+ ans1609{false},
+ },
+
+ {
+ para1609{&TreeNode{5,
+ &TreeNode{9, &TreeNode{3, nil, nil}, &TreeNode{5, nil, nil}},
+ &TreeNode{1, &TreeNode{7, nil, nil}, nil}}},
+ ans1609{false},
+ },
+
+ {
+ para1609{&TreeNode{1, nil, nil}},
+ ans1609{true},
+ },
+
+ {
+ para1609{&TreeNode{11,
+ &TreeNode{8,
+ &TreeNode{1, &TreeNode{30, &TreeNode{17, nil, nil}, nil}, &TreeNode{20, nil, nil}},
+ &TreeNode{3, &TreeNode{18, nil, nil}, &TreeNode{16, nil, nil}}},
+ &TreeNode{6,
+ &TreeNode{9, &TreeNode{12, nil, nil}, &TreeNode{10, nil, nil}},
+ &TreeNode{11, &TreeNode{4, nil, nil}, &TreeNode{2, nil, nil}}}}},
+ ans1609{true},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 1609------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans1609, q.para1609
+ fmt.Printf("【input】:%v 【output】:%v\n", p.root, isEvenOddTree(p.root))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/1609.Even-Odd-Tree/README.md b/leetcode/1609.Even-Odd-Tree/README.md
new file mode 100644
index 000000000..0481d9821
--- /dev/null
+++ b/leetcode/1609.Even-Odd-Tree/README.md
@@ -0,0 +1,150 @@
+# [1609. Even Odd Tree](https://leetcode.com/problems/even-odd-tree/)
+
+## 题目
+
+A binary tree is named Even-Odd if it meets the following conditions:
+
+- The root of the binary tree is at level index 0, its children are at level index 1, their children are at level index 2, etc.
+- For every even-indexed level, all nodes at the level have odd integer values in strictly increasing order (from left to right).
+- For every odd-indexed level, all nodes at the level have even integer values in strictly decreasing order (from left to right).
+
+Given the root of a binary tree, return true if the binary tree is Even-Odd, otherwise return false.
+
+**Example 1**:
+
+
+
+ Input: root = [1,10,4,3,null,7,9,12,8,6,null,null,2]
+ Output: true
+ Explanation: The node values on each level are:
+ Level 0: [1]
+ Level 1: [10,4]
+ Level 2: [3,7,9]
+ Level 3: [12,8,6,2]
+ Since levels 0 and 2 are all odd and increasing and levels 1 and 3 are all even and decreasing, the tree is Even-Odd.
+
+**Example 2**:
+
+
+
+ Input: root = [5,4,2,3,3,7]
+ Output: false
+ Explanation: The node values on each level are:
+ Level 0: [5]
+ Level 1: [4,2]
+ Level 2: [3,3,7]
+ Node values in level 2 must be in strictly increasing order, so the tree is not Even-Odd.
+
+**Example 3**:
+
+
+
+ Input: root = [5,9,1,3,5,7]
+ Output: false
+ Explanation: Node values in the level 1 should be even integers.
+
+**Example 4**:
+
+ Input: root = [1]
+ Output: true
+
+**Example 5**:
+
+ Input: root = [11,8,6,1,3,9,11,30,20,18,16,12,10,4,2,17]
+ Output: True
+
+**Constraints:**
+
+- The number of nodes in the tree is in the range [1, 100000].
+- 1 <= Node.val <= 1000000
+
+## 题目大意
+
+如果一棵二叉树满足下述几个条件，则可以称为 奇偶树 ：
+
+- 二叉树根节点所在层下标为 0 ，根的子节点所在层下标为 1 ，根的孙节点所在层下标为 2 ，依此类推。
+- 偶数下标 层上的所有节点的值都是 奇 整数，从左到右按顺序 严格递增
+- 奇数下标 层上的所有节点的值都是 偶 整数，从左到右按顺序 严格递减
+
+给你二叉树的根节点，如果二叉树为 奇偶树 ，则返回 true ，否则返回 false 。
+
+## 解题思路
+
+- 广度优先遍历(分别判断奇数层和偶数层)
+
+## 代码
+
+```go
+package leetcode
+
+type TreeNode struct {
+ Val int
+ Left *TreeNode
+ Right *TreeNode
+}
+
+func isEvenOddTree(root *TreeNode) bool {
+ level := 0
+ queue := []*TreeNode{root}
+ for len(queue) != 0 {
+ length := len(queue)
+ var nums []int
+ for i := 0; i < length; i++ {
+ node := queue[i]
+ if node.Left != nil {
+ queue = append(queue, node.Left)
+ }
+ if node.Right != nil {
+ queue = append(queue, node.Right)
+ }
+ nums = append(nums, node.Val)
+ }
+ if level%2 == 0 {
+ if !even(nums) {
+ return false
+ }
+ } else {
+ if !odd(nums) {
+ return false
+ }
+ }
+ queue = queue[length:]
+ level++
+ }
+ return true
+}
+
+func odd(nums []int) bool {
+ cur := nums[0]
+ if cur%2 != 0 {
+ return false
+ }
+ for _, num := range nums[1:] {
+ if num >= cur {
+ return false
+ }
+ if num%2 != 0 {
+ return false
+ }
+ cur = num
+ }
+ return true
+}
+
+func even(nums []int) bool {
+ cur := nums[0]
+ if cur%2 == 0 {
+ return false
+ }
+ for _, num := range nums[1:] {
+ if num <= cur {
+ return false
+ }
+ if num%2 == 0 {
+ return false
+ }
+ cur = num
+ }
+ return true
+}
+```
\ No newline at end of file
diff --git a/leetcode/1614.Maximum-Nesting-Depth-of-the-Parentheses/1614. Maximum Nesting Depth of the Parentheses.go b/leetcode/1614.Maximum-Nesting-Depth-of-the-Parentheses/1614. Maximum Nesting Depth of the Parentheses.go
new file mode 100644
index 000000000..5f83a24ce
--- /dev/null
+++ b/leetcode/1614.Maximum-Nesting-Depth-of-the-Parentheses/1614. Maximum Nesting Depth of the Parentheses.go
@@ -0,0 +1,21 @@
+package leetcode
+
+func maxDepth(s string) int {
+ res, cur := 0, 0
+ for _, c := range s {
+ if c == '(' {
+ cur++
+ res = max(res, cur)
+ } else if c == ')' {
+ cur--
+ }
+ }
+ return res
+}
+
+func max(a, b int) int {
+ if a > b {
+ return a
+ }
+ return b
+}
diff --git a/leetcode/1614.Maximum-Nesting-Depth-of-the-Parentheses/1614. Maximum Nesting Depth of the Parentheses_test.go b/leetcode/1614.Maximum-Nesting-Depth-of-the-Parentheses/1614. Maximum Nesting Depth of the Parentheses_test.go
new file mode 100644
index 000000000..cfb465461
--- /dev/null
+++ b/leetcode/1614.Maximum-Nesting-Depth-of-the-Parentheses/1614. Maximum Nesting Depth of the Parentheses_test.go
@@ -0,0 +1,57 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question1614 struct {
+ para1614
+ ans1614
+}
+
+// para 是参数
+// one 代表第一个参数
+type para1614 struct {
+ p string
+}
+
+// ans 是答案
+// one 代表第一个答案
+type ans1614 struct {
+ one int
+}
+
+func Test_Problem1614(t *testing.T) {
+
+ qs := []question1614{
+
+ {
+ para1614{"(1+(2*3)+((8)/4))+1"},
+ ans1614{3},
+ },
+
+ {
+ para1614{"(1)+((2))+(((3)))"},
+ ans1614{3},
+ },
+
+ {
+ para1614{"1+(2*3)/(2-1)"},
+ ans1614{1},
+ },
+
+ {
+ para1614{"1"},
+ ans1614{0},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 1614------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans1614, q.para1614
+ fmt.Printf("【input】:%v 【output】:%v \n", p, maxDepth(p.p))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/1614.Maximum-Nesting-Depth-of-the-Parentheses/README.md b/leetcode/1614.Maximum-Nesting-Depth-of-the-Parentheses/README.md
new file mode 100644
index 000000000..6f87c911b
--- /dev/null
+++ b/leetcode/1614.Maximum-Nesting-Depth-of-the-Parentheses/README.md
@@ -0,0 +1,102 @@
+# [1614. Maximum Nesting Depth of the Parentheses](https://leetcode.com/problems/maximum-nesting-depth-of-the-parentheses/)
+
+## 题目
+
+A string is a **valid parentheses string** (denoted **VPS**) if it meets one of the following:
+
+- It is an empty string `""`, or a single character not equal to `"("` or `")"`,
+- It can be written as `AB` (`A` concatenated with `B`), where `A` and `B` are **VPS**'s, or
+- It can be written as `(A)`, where `A` is a **VPS**.
+
+We can similarly define the **nesting depth** `depth(S)` of any VPS `S` as follows:
+
+- `depth("") = 0`
+- `depth(C) = 0`, where `C` is a string with a single character not equal to `"("` or `")"`.
+- `depth(A + B) = max(depth(A), depth(B))`, where `A` and `B` are **VPS**'s.
+- `depth("(" + A + ")") = 1 + depth(A)`, where `A` is a **VPS**.
+
+For example, `""`, `"()()"`, and `"()(()())"` are **VPS**'s (with nesting depths 0, 1, and 2), and `")("` and `"(()"` are not **VPS**'s.
+
+Given a **VPS** represented as string `s`, return *the **nesting depth** of* `s`.
+
+**Example 1:**
+
+```
+Input: s = "(1+(2*3)+((8)/4))+1"
+Output: 3
+Explanation: Digit 8 is inside of 3 nested parentheses in the string.
+```
+
+**Example 2:**
+
+```
+Input: s = "(1)+((2))+(((3)))"
+Output: 3
+```
+
+**Example 3:**
+
+```
+Input: s = "1+(2*3)/(2-1)"
+Output: 1
+```
+
+**Example 4:**
+
+```
+Input: s = "1"
+Output: 0
+```
+
+**Constraints:**
+
+- `1 <= s.length <= 100`
+- `s` consists of digits `0-9` and characters `'+'`, `'-'`, `'*'`, `'/'`, `'('`, and `')'`.
+- It is guaranteed that parentheses expression `s` is a **VPS**.
+
+## 题目大意
+
+如果字符串满足以下条件之一，则可以称之为 有效括号字符串（valid parentheses string，可以简写为 VPS）：
+
+- 字符串是一个空字符串 ""，或者是一个不为 "(" 或 ")" 的单字符。
+- 字符串可以写为 AB（A 与 B 字符串连接），其中 A 和 B 都是 有效括号字符串 。
+- 字符串可以写为 (A)，其中 A 是一个 有效括号字符串 。
+
+类似地，可以定义任何有效括号字符串 S 的 嵌套深度 depth(S)：
+
+- depth("") = 0
+- depth(C) = 0，其中 C 是单个字符的字符串，且该字符不是 "(" 或者 ")"
+- depth(A + B) = max(depth(A), depth(B))，其中 A 和 B 都是 有效括号字符串
+- depth("(" + A + ")") = 1 + depth(A)，其中 A 是一个 有效括号字符串
+
+例如：""、"()()"、"()(()())" 都是 有效括号字符串（嵌套深度分别为 0、1、2），而 ")(" 、"(()" 都不是 有效括号字符串 。给你一个 有效括号字符串 s，返回该字符串的 s 嵌套深度 。
+
+## 解题思路
+
+- 简单题。求一个括号字符串的嵌套深度。题目给的括号字符串都是有效的，所以不需要考虑非法的情况。扫描一遍括号字符串，遇到 `(` 可以无脑 ++，并动态维护最大值，遇到 `)` 可以无脑 - - 。最后输出最大值即可。
+
+## 代码
+
+```go
+package leetcode
+
+func maxDepth(s string) int {
+ res, cur := 0, 0
+ for _, c := range s {
+ if c == '(' {
+ cur++
+ res = max(res, cur)
+ } else if c == ')' {
+ cur--
+ }
+ }
+ return res
+}
+
+func max(a, b int) int {
+ if a > b {
+ return a
+ }
+ return b
+}
+```
\ No newline at end of file
diff --git a/leetcode/1619.Mean-of-Array-After-Removing-Some-Elements/1619. Mean of Array After Removing Some Elements.go b/leetcode/1619.Mean-of-Array-After-Removing-Some-Elements/1619. Mean of Array After Removing Some Elements.go
new file mode 100644
index 000000000..a037ec08a
--- /dev/null
+++ b/leetcode/1619.Mean-of-Array-After-Removing-Some-Elements/1619. Mean of Array After Removing Some Elements.go
@@ -0,0 +1,12 @@
+package leetcode
+
+import "sort"
+
+func trimMean(arr []int) float64 {
+ sort.Ints(arr)
+ n, sum := len(arr), 0
+ for i := n / 20; i < n-(n/20); i++ {
+ sum += arr[i]
+ }
+ return float64(sum) / float64((n - (n / 10)))
+}
diff --git a/leetcode/1619.Mean-of-Array-After-Removing-Some-Elements/1619. Mean of Array After Removing Some Elements_test.go b/leetcode/1619.Mean-of-Array-After-Removing-Some-Elements/1619. Mean of Array After Removing Some Elements_test.go
new file mode 100644
index 000000000..ecb7e9016
--- /dev/null
+++ b/leetcode/1619.Mean-of-Array-After-Removing-Some-Elements/1619. Mean of Array After Removing Some Elements_test.go
@@ -0,0 +1,62 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question1619 struct {
+ para1619
+ ans1619
+}
+
+// para 是参数
+// one 代表第一个参数
+type para1619 struct {
+ p []int
+}
+
+// ans 是答案
+// one 代表第一个答案
+type ans1619 struct {
+ one float64
+}
+
+func Test_Problem1619(t *testing.T) {
+
+ qs := []question1619{
+
+ {
+ para1619{[]int{1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 3}},
+ ans1619{2.00000},
+ },
+
+ {
+ para1619{[]int{6, 2, 7, 5, 1, 2, 0, 3, 10, 2, 5, 0, 5, 5, 0, 8, 7, 6, 8, 0}},
+ ans1619{4.00000},
+ },
+
+ {
+ para1619{[]int{6, 0, 7, 0, 7, 5, 7, 8, 3, 4, 0, 7, 8, 1, 6, 8, 1, 1, 2, 4, 8, 1, 9, 5, 4, 3, 8, 5, 10, 8, 6, 6, 1, 0, 6, 10, 8, 2, 3, 4}},
+ ans1619{4.77778},
+ },
+
+ {
+ para1619{[]int{9, 7, 8, 7, 7, 8, 4, 4, 6, 8, 8, 7, 6, 8, 8, 9, 2, 6, 0, 0, 1, 10, 8, 6, 3, 3, 5, 1, 10, 9, 0, 7, 10, 0, 10, 4, 1, 10, 6, 9, 3, 6, 0, 0, 2, 7, 0, 6, 7, 2, 9, 7, 7, 3, 0, 1, 6, 1, 10, 3}},
+ ans1619{5.27778},
+ },
+
+ {
+ para1619{[]int{4, 8, 4, 10, 0, 7, 1, 3, 7, 8, 8, 3, 4, 1, 6, 2, 1, 1, 8, 0, 9, 8, 0, 3, 9, 10, 3, 10, 1, 10, 7, 3, 2, 1, 4, 9, 10, 7, 6, 4, 0, 8, 5, 1, 2, 1, 6, 2, 5, 0, 7, 10, 9, 10, 3, 7, 10, 5, 8, 5, 7, 6, 7, 6, 10, 9, 5, 10, 5, 5, 7, 2, 10, 7, 7, 8, 2, 0, 1, 1}},
+ ans1619{5.29167},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 1619------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans1619, q.para1619
+ fmt.Printf("【input】:%v 【output】:%v \n", p, trimMean(p.p))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/1619.Mean-of-Array-After-Removing-Some-Elements/README.md b/leetcode/1619.Mean-of-Array-After-Removing-Some-Elements/README.md
new file mode 100644
index 000000000..35a8e7c4a
--- /dev/null
+++ b/leetcode/1619.Mean-of-Array-After-Removing-Some-Elements/README.md
@@ -0,0 +1,74 @@
+# [1619. Mean of Array After Removing Some Elements](https://leetcode.com/problems/mean-of-array-after-removing-some-elements/)
+
+## 题目
+
+Given an integer array `arr`, return *the mean of the remaining integers after removing the smallest `5%` and the largest `5%` of the elements.*
+
+Answers within `10-5` of the **actual answer** will be considered accepted.
+
+**Example 1:**
+
+```
+Input: arr = [1,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,3]
+Output: 2.00000
+Explanation: After erasing the minimum and the maximum values of this array, all elements are equal to 2, so the mean is 2.
+```
+
+**Example 2:**
+
+```
+Input: arr = [6,2,7,5,1,2,0,3,10,2,5,0,5,5,0,8,7,6,8,0]
+Output: 4.00000
+```
+
+**Example 3:**
+
+```
+Input: arr = [6,0,7,0,7,5,7,8,3,4,0,7,8,1,6,8,1,1,2,4,8,1,9,5,4,3,8,5,10,8,6,6,1,0,6,10,8,2,3,4]
+Output: 4.77778
+```
+
+**Example 4:**
+
+```
+Input: arr = [9,7,8,7,7,8,4,4,6,8,8,7,6,8,8,9,2,6,0,0,1,10,8,6,3,3,5,1,10,9,0,7,10,0,10,4,1,10,6,9,3,6,0,0,2,7,0,6,7,2,9,7,7,3,0,1,6,1,10,3]
+Output: 5.27778
+```
+
+**Example 5:**
+
+```
+Input: arr = [4,8,4,10,0,7,1,3,7,8,8,3,4,1,6,2,1,1,8,0,9,8,0,3,9,10,3,10,1,10,7,3,2,1,4,9,10,7,6,4,0,8,5,1,2,1,6,2,5,0,7,10,9,10,3,7,10,5,8,5,7,6,7,6,10,9,5,10,5,5,7,2,10,7,7,8,2,0,1,1]
+Output: 5.29167
+```
+
+**Constraints:**
+
+- `20 <= arr.length <= 1000`
+- `arr.length` **is a multiple** of `20`.
+- `0 <= arr[i] <= 10^5`
+
+## 题目大意
+
+给你一个整数数组 `arr` ，请你删除最小 `5%` 的数字和最大 `5%` 的数字后，剩余数字的平均值。与 **标准答案** 误差在 `10-5` 的结果都被视为正确结果。
+
+## 解题思路
+
+- 简单题。先将数组排序，然后累加中间 90% 的元素，最后计算平均值。
+
+## 代码
+
+```go
+package leetcode
+
+import "sort"
+
+func trimMean(arr []int) float64 {
+ sort.Ints(arr)
+ n, sum := len(arr), 0
+ for i := n / 20; i < n-(n/20); i++ {
+ sum += arr[i]
+ }
+ return float64(sum) / float64((n - (n / 10)))
+}
+```
\ No newline at end of file
diff --git a/leetcode/1624.Largest-Substring-Between-Two-Equal-Characters/1624. Largest Substring Between Two Equal Characters.go b/leetcode/1624.Largest-Substring-Between-Two-Equal-Characters/1624. Largest Substring Between Two Equal Characters.go
new file mode 100644
index 000000000..1889318bb
--- /dev/null
+++ b/leetcode/1624.Largest-Substring-Between-Two-Equal-Characters/1624. Largest Substring Between Two Equal Characters.go
@@ -0,0 +1,16 @@
+package leetcode
+
+import "strings"
+
+func maxLengthBetweenEqualCharacters(s string) int {
+ res := -1
+ for k, v := range s {
+ tmp := strings.LastIndex(s, string(v))
+ if tmp > 0 {
+ if res < tmp-k-1 {
+ res = tmp - k - 1
+ }
+ }
+ }
+ return res
+}
diff --git a/leetcode/1624.Largest-Substring-Between-Two-Equal-Characters/1624. Largest Substring Between Two Equal Characters_test.go b/leetcode/1624.Largest-Substring-Between-Two-Equal-Characters/1624. Largest Substring Between Two Equal Characters_test.go
new file mode 100644
index 000000000..6c5959a17
--- /dev/null
+++ b/leetcode/1624.Largest-Substring-Between-Two-Equal-Characters/1624. Largest Substring Between Two Equal Characters_test.go
@@ -0,0 +1,57 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question1624 struct {
+ para1624
+ ans1624
+}
+
+// para 是参数
+// one 代表第一个参数
+type para1624 struct {
+ s string
+}
+
+// ans 是答案
+// one 代表第一个答案
+type ans1624 struct {
+ one int
+}
+
+func Test_Problem1624(t *testing.T) {
+
+ qs := []question1624{
+
+ {
+ para1624{"aa"},
+ ans1624{0},
+ },
+
+ {
+ para1624{"abca"},
+ ans1624{2},
+ },
+
+ {
+ para1624{"cbzxy"},
+ ans1624{-1},
+ },
+
+ {
+ para1624{"cabbac"},
+ ans1624{4},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 1624------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans1624, q.para1624
+ fmt.Printf("【input】:%v 【output】:%v \n", p, maxLengthBetweenEqualCharacters(p.s))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/1624.Largest-Substring-Between-Two-Equal-Characters/README.md b/leetcode/1624.Largest-Substring-Between-Two-Equal-Characters/README.md
new file mode 100644
index 000000000..b488fdb8b
--- /dev/null
+++ b/leetcode/1624.Largest-Substring-Between-Two-Equal-Characters/README.md
@@ -0,0 +1,73 @@
+# [1624. Largest Substring Between Two Equal Characters](https://leetcode.com/problems/largest-substring-between-two-equal-characters/)
+
+## 题目
+
+Given a string `s`, return *the length of the longest substring between two equal characters, excluding the two characters.* If there is no such substring return `-1`.
+
+A **substring** is a contiguous sequence of characters within a string.
+
+**Example 1:**
+
+```
+Input: s = "aa"
+Output: 0
+Explanation: The optimal substring here is an empty substring between the two 'a's.
+```
+
+**Example 2:**
+
+```
+Input: s = "abca"
+Output: 2
+Explanation: The optimal substring here is "bc".
+```
+
+**Example 3:**
+
+```
+Input: s = "cbzxy"
+Output: -1
+Explanation: There are no characters that appear twice in s.
+```
+
+**Example 4:**
+
+```
+Input: s = "cabbac"
+Output: 4
+Explanation: The optimal substring here is "abba". Other non-optimal substrings include "bb" and "".
+```
+
+**Constraints:**
+
+- `1 <= s.length <= 300`
+- `s` contains only lowercase English letters.
+
+## 题目大意
+
+给你一个字符串 s，请你返回 两个相同字符之间的最长子字符串的长度 ，计算长度时不含这两个字符。如果不存在这样的子字符串，返回 -1 。子字符串 是字符串中的一个连续字符序列。
+
+## 解题思路
+
+- 简单题。取每个字符，扫描一次字符串，如果在字符串中还能找到相同的字符，则返回最末尾的那个字符，计算这两个字符之间的距离。取最末尾的字符是为了让两个相同的字符距离最长。扫描字符串过程中动态维护最长长度。如果字符串中不存在 2 个相同的字符，则返回 -1 。
+
+## 代码
+
+```go
+package leetcode
+
+import "strings"
+
+func maxLengthBetweenEqualCharacters(s string) int {
+ res := -1
+ for k, v := range s {
+ tmp := strings.LastIndex(s, string(v))
+ if tmp > 0 {
+ if res < tmp-k-1 {
+ res = tmp - k - 1
+ }
+ }
+ }
+ return res
+}
+```
\ No newline at end of file
diff --git a/leetcode/1629.Slowest-Key/1629. Slowest Key.go b/leetcode/1629.Slowest-Key/1629. Slowest Key.go
new file mode 100644
index 000000000..05da61a4a
--- /dev/null
+++ b/leetcode/1629.Slowest-Key/1629. Slowest Key.go
@@ -0,0 +1,15 @@
+package leetcode
+
+func slowestKey(releaseTimes []int, keysPressed string) byte {
+ longestDuration, key := releaseTimes[0], keysPressed[0]
+ for i := 1; i < len(releaseTimes); i++ {
+ duration := releaseTimes[i] - releaseTimes[i-1]
+ if duration > longestDuration {
+ longestDuration = duration
+ key = keysPressed[i]
+ } else if duration == longestDuration && keysPressed[i] > key {
+ key = keysPressed[i]
+ }
+ }
+ return key
+}
diff --git a/leetcode/1629.Slowest-Key/1629. Slowest Key_test.go b/leetcode/1629.Slowest-Key/1629. Slowest Key_test.go
new file mode 100644
index 000000000..90d9b6b2e
--- /dev/null
+++ b/leetcode/1629.Slowest-Key/1629. Slowest Key_test.go
@@ -0,0 +1,48 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question1629 struct {
+ para1629
+ ans1629
+}
+
+// para 是参数
+// one 代表第一个参数
+type para1629 struct {
+ releaseTimes []int
+ keysPressed string
+}
+
+// ans 是答案
+// one 代表第一个答案
+type ans1629 struct {
+ one byte
+}
+
+func Test_Problem1629(t *testing.T) {
+
+ qs := []question1629{
+
+ {
+ para1629{[]int{9, 29, 49, 50}, "cbcd"},
+ ans1629{'c'},
+ },
+
+ {
+ para1629{[]int{12, 23, 36, 46, 62}, "spuda"},
+ ans1629{'a'},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 1629------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans1629, q.para1629
+ fmt.Printf("【input】:%v 【output】:%c \n", p, slowestKey(p.releaseTimes, p.keysPressed))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/1629.Slowest-Key/README.md b/leetcode/1629.Slowest-Key/README.md
new file mode 100644
index 000000000..a12b8ba6f
--- /dev/null
+++ b/leetcode/1629.Slowest-Key/README.md
@@ -0,0 +1,83 @@
+# [1629. Slowest Key](https://leetcode.com/problems/slowest-key/)
+
+
+## 题目
+
+A newly designed keypad was tested, where a tester pressed a sequence of `n` keys, one at a time.
+
+You are given a string `keysPressed` of length `n`, where `keysPressed[i]` was the `ith` key pressed in the testing sequence, and a sorted list `releaseTimes`, where `releaseTimes[i]` was the time the `ith` key was released. Both arrays are **0-indexed**. The `0th` key was pressed at the time `0`, and every subsequent key was pressed at the **exact** time the previous key was released.
+
+The tester wants to know the key of the keypress that had the **longest duration**. The `ith` keypress had a **duration** of `releaseTimes[i] - releaseTimes[i - 1]`, and the `0th` keypress had a duration of `releaseTimes[0]`.
+
+Note that the same key could have been pressed multiple times during the test, and these multiple presses of the same key **may not** have had the same **duration**.
+
+*Return the key of the keypress that had the **longest duration**. If there are multiple such keypresses, return the lexicographically largest key of the keypresses.*
+
+**Example 1:**
+
+```
+Input: releaseTimes = [9,29,49,50], keysPressed = "cbcd"
+Output: "c"
+Explanation: The keypresses were as follows:
+Keypress for 'c' had a duration of 9 (pressed at time 0 and released at time 9).
+Keypress for 'b' had a duration of 29 - 9 = 20 (pressed at time 9 right after the release of the previous character and released at time 29).
+Keypress for 'c' had a duration of 49 - 29 = 20 (pressed at time 29 right after the release of the previous character and released at time 49).
+Keypress for 'd' had a duration of 50 - 49 = 1 (pressed at time 49 right after the release of the previous character and released at time 50).
+The longest of these was the keypress for 'b' and the second keypress for 'c', both with duration 20.
+'c' is lexicographically larger than 'b', so the answer is 'c'.
+```
+
+**Example 2:**
+
+```
+Input: releaseTimes = [12,23,36,46,62], keysPressed = "spuda"
+Output: "a"
+Explanation: The keypresses were as follows:
+Keypress for 's' had a duration of 12.
+Keypress for 'p' had a duration of 23 - 12 = 11.
+Keypress for 'u' had a duration of 36 - 23 = 13.
+Keypress for 'd' had a duration of 46 - 36 = 10.
+Keypress for 'a' had a duration of 62 - 46 = 16.
+The longest of these was the keypress for 'a' with duration 16.
+```
+
+**Constraints:**
+
+- `releaseTimes.length == n`
+- `keysPressed.length == n`
+- `2 <= n <= 1000`
+- `1 <= releaseTimes[i] <= 109`
+- `releaseTimes[i] < releaseTimes[i+1]`
+- `keysPressed` contains only lowercase English letters.
+
+## 题目大意
+
+LeetCode 设计了一款新式键盘，正在测试其可用性。测试人员将会点击一系列键（总计 n 个），每次一个。
+
+给你一个长度为 n 的字符串 keysPressed ，其中 keysPressed[i] 表示测试序列中第 i 个被按下的键。releaseTimes 是一个升序排列的列表，其中 releaseTimes[i] 表示松开第 i 个键的时间。字符串和数组的 下标都从 0 开始 。第 0 个键在时间为 0 时被按下，接下来每个键都 恰好 在前一个键松开时被按下。测试人员想要找出按键 持续时间最长 的键。第 i 次按键的持续时间为 releaseTimes[i] - releaseTimes[i - 1] ，第 0 次按键的持续时间为 releaseTimes[0] 。
+
+注意，测试期间，同一个键可以在不同时刻被多次按下，而每次的持续时间都可能不同。请返回按键 持续时间最长 的键，如果有多个这样的键，则返回 按字母顺序排列最大 的那个键。
+
+## 解题思路
+
+- 题干很长，不过还是简单题。循环扫描一遍数组，计算出每个按键的持续时间。动态更新按键最长时间的键。如果持续时间最长的有多个键，需要返回字母序最大的那一个键。
+
+## 代码
+
+```go
+package leetcode
+
+func slowestKey(releaseTimes []int, keysPressed string) byte {
+ longestDuration, key := releaseTimes[0], keysPressed[0]
+ for i := 1; i < len(releaseTimes); i++ {
+ duration := releaseTimes[i] - releaseTimes[i-1]
+ if duration > longestDuration {
+ longestDuration = duration
+ key = keysPressed[i]
+ } else if duration == longestDuration && keysPressed[i] > key {
+ key = keysPressed[i]
+ }
+ }
+ return key
+}
+```
\ No newline at end of file
diff --git a/leetcode/1631.Path-With-Minimum-Effort/1631. Path With Minimum Effort.go b/leetcode/1631.Path-With-Minimum-Effort/1631. Path With Minimum Effort.go
new file mode 100644
index 000000000..9a3b4ec0f
--- /dev/null
+++ b/leetcode/1631.Path-With-Minimum-Effort/1631. Path With Minimum Effort.go
@@ -0,0 +1,108 @@
+package leetcode
+
+import (
+ "sort"
+
+ "github.com/halfrost/LeetCode-Go/template"
+)
+
+var dir = [4][2]int{
+ {0, 1},
+ {1, 0},
+ {0, -1},
+ {-1, 0},
+}
+
+// 解法一 DFS + 二分
+func minimumEffortPath(heights [][]int) int {
+ n, m := len(heights), len(heights[0])
+ visited := make([][]bool, n)
+ for i := range visited {
+ visited[i] = make([]bool, m)
+ }
+ low, high := 0, 1000000
+ for low < high {
+ threshold := low + (high-low)>>1
+ if !hasPath(heights, visited, 0, 0, threshold) {
+ low = threshold + 1
+ } else {
+ high = threshold
+ }
+ for i := range visited {
+ for j := range visited[i] {
+ visited[i][j] = false
+ }
+ }
+ }
+ return low
+}
+
+func hasPath(heights [][]int, visited [][]bool, i, j, threshold int) bool {
+ n, m := len(heights), len(heights[0])
+ if i == n-1 && j == m-1 {
+ return true
+ }
+ visited[i][j] = true
+ res := false
+ for _, d := range dir {
+ ni, nj := i+d[0], j+d[1]
+ if ni < 0 || ni >= n || nj < 0 || nj >= m || visited[ni][nj] || res {
+ continue
+ }
+ diff := abs(heights[i][j] - heights[ni][nj])
+ if diff <= threshold && hasPath(heights, visited, ni, nj, threshold) {
+ res = true
+ }
+ }
+ return res
+}
+
+func abs(a int) int {
+ if a < 0 {
+ a = -a
+ }
+ return a
+}
+
+func min(a, b int) int {
+ if a < b {
+ return a
+ }
+ return b
+}
+
+func max(a, b int) int {
+ if a < b {
+ return b
+ }
+ return a
+}
+
+// 解法二 并查集
+func minimumEffortPath1(heights [][]int) int {
+ n, m, edges, uf := len(heights), len(heights[0]), []edge{}, template.UnionFind{}
+ uf.Init(n * m)
+ for i, row := range heights {
+ for j, h := range row {
+ id := i*m + j
+ if i > 0 {
+ edges = append(edges, edge{id - m, id, abs(h - heights[i-1][j])})
+ }
+ if j > 0 {
+ edges = append(edges, edge{id - 1, id, abs(h - heights[i][j-1])})
+ }
+ }
+ }
+ sort.Slice(edges, func(i, j int) bool { return edges[i].diff < edges[j].diff })
+ for _, e := range edges {
+ uf.Union(e.v, e.w)
+ if uf.Find(0) == uf.Find(n*m-1) {
+ return e.diff
+ }
+ }
+ return 0
+}
+
+type edge struct {
+ v, w, diff int
+}
diff --git a/leetcode/1631.Path-With-Minimum-Effort/1631. Path With Minimum Effort_test.go b/leetcode/1631.Path-With-Minimum-Effort/1631. Path With Minimum Effort_test.go
new file mode 100644
index 000000000..7b2cd74b2
--- /dev/null
+++ b/leetcode/1631.Path-With-Minimum-Effort/1631. Path With Minimum Effort_test.go
@@ -0,0 +1,52 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question1631 struct {
+ para1631
+ ans1631
+}
+
+// para 是参数
+// one 代表第一个参数
+type para1631 struct {
+ heights [][]int
+}
+
+// ans 是答案
+// one 代表第一个答案
+type ans1631 struct {
+ one int
+}
+
+func Test_Problem1631(t *testing.T) {
+
+ qs := []question1631{
+
+ {
+ para1631{[][]int{{1, 2, 2}, {3, 8, 2}, {5, 3, 5}}},
+ ans1631{2},
+ },
+
+ {
+ para1631{[][]int{{1, 2, 3}, {3, 8, 4}, {5, 3, 5}}},
+ ans1631{1},
+ },
+
+ {
+ para1631{[][]int{{1, 2, 1, 1, 1}, {1, 2, 1, 2, 1}, {1, 2, 1, 2, 1}, {1, 2, 1, 2, 1}, {1, 1, 1, 2, 1}}},
+ ans1631{0},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 1631------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans1631, q.para1631
+ fmt.Printf("【input】:%v 【output】:%v \n", p, minimumEffortPath(p.heights))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/1631.Path-With-Minimum-Effort/README.md b/leetcode/1631.Path-With-Minimum-Effort/README.md
new file mode 100644
index 000000000..414863562
--- /dev/null
+++ b/leetcode/1631.Path-With-Minimum-Effort/README.md
@@ -0,0 +1,170 @@
+# [1631. Path With Minimum Effort](https://leetcode.com/problems/path-with-minimum-effort/)
+
+## 题目
+
+You are a hiker preparing for an upcoming hike. You are given `heights`, a 2D array of size `rows x columns`, where `heights[row][col]` represents the height of cell `(row, col)`. You are situated in the top-left cell, `(0, 0)`, and you hope to travel to the bottom-right cell, `(rows-1, columns-1)` (i.e., **0-indexed**). You can move **up**, **down**, **left**, or **right**, and you wish to find a route that requires the minimum **effort**.
+
+A route's **effort** is the **maximum absolute difference** in heights between two consecutive cells of the route.
+
+Return *the minimum **effort** required to travel from the top-left cell to the bottom-right cell.*
+
+**Example 1:**
+
+
+
+```
+Input: heights = [[1,2,2],[3,8,2],[5,3,5]]
+Output: 2
+Explanation: The route of [1,3,5,3,5] has a maximum absolute difference of 2 in consecutive cells.
+This is better than the route of [1,2,2,2,5], where the maximum absolute difference is 3.
+```
+
+**Example 2:**
+
+
+
+```
+Input: heights = [[1,2,3],[3,8,4],[5,3,5]]
+Output: 1
+Explanation: The route of [1,2,3,4,5] has a maximum absolute difference of 1 in consecutive cells, which is better than route [1,3,5,3,5].
+```
+
+**Example 3:**
+
+
+
+```
+Input: heights = [[1,2,1,1,1],[1,2,1,2,1],[1,2,1,2,1],[1,2,1,2,1],[1,1,1,2,1]]
+Output: 0
+Explanation: This route does not require any effort.
+```
+
+**Constraints:**
+
+- `rows == heights.length`
+- `columns == heights[i].length`
+- `1 <= rows, columns <= 100`
+- `1 <= heights[i][j] <= 10^6`
+
+## 题目大意
+
+你准备参加一场远足活动。给你一个二维 `rows x columns` 的地图 `heights` ，其中 `heights[row][col]` 表示格子 `(row, col)` 的高度。一开始你在最左上角的格子 `(0, 0)` ，且你希望去最右下角的格子 `(rows-1, columns-1)` （注意下标从 0 开始编号）。你每次可以往 上，下，左，右 四个方向之一移动，你想要找到耗费 体力 最小的一条路径。一条路径耗费的 体力值 是路径上相邻格子之间 高度差绝对值 的 最大值 决定的。请你返回从左上角走到右下角的最小 体力消耗值 。
+
+## 解题思路
+
+- 此题和第 778 题解题思路完全一致。在第 778 题中求的是最短连通时间。此题求的是连通路径下的最小体力值。都是求的最小值，只是 2 个值的意义不同罢了。
+- 按照第 778 题的思路，本题也有多种解法。第一种解法是 DFS + 二分。先将题目变换一个等价问法。题目要求找到最小体力消耗值，也相当于问是否存在一个体力消耗值 x，只要大于等于 x，一定能连通。利用二分搜索来找到这个临界值。体力消耗值是有序的，此处满足二分搜索的条件。题目给定柱子高度是 [1,10^6]，所以体力值一定在 [0,10^6-1] 这个区间内。判断是否取中值的条件是用 DFS 或者 BFS 搜索 (0,0) 点和 (N-1, N-1) 点之间是否连通。时间复杂度：O(mnlogC)，其中 m 和 n 分别是地图的行数和列数，C 是格子的最大高度。C 最大为 10^6，所以 logC 常数也很小。空间复杂度 O(mn)。
+- 第二种解法是并查集。将图中所有边按照权值从小到大进行排序，并依次加入并查集中。直到加入一条权值为 x 的边以后，左上角到右下角连通了。最小体力消耗值也就找到了。注意加入边的时候，只加入 `i-1` 和 `i` ，`j-1` 和 `j` 这 2 类相邻的边。因为最小体力消耗意味着不走回头路。上下左右四个方向到达一个节点，只可能从上边和左边走过来。从下边和右边走过来肯定是浪费体力了。时间复杂度：O(mnlog(mn))，其中 m 和 n 分别是地图的行数和列数，图中的边数为 O(mn)。空间复杂度 O(mn)，即为存储所有边以及并查集需要的空间。
+
+## 代码
+
+```go
+package leetcode
+
+import (
+ "sort"
+
+ "github.com/halfrost/LeetCode-Go/template"
+)
+
+var dir = [4][2]int{
+ {0, 1},
+ {1, 0},
+ {0, -1},
+ {-1, 0},
+}
+
+// 解法一 DFS + 二分
+func minimumEffortPath(heights [][]int) int {
+ n, m := len(heights), len(heights[0])
+ visited := make([][]bool, n)
+ for i := range visited {
+ visited[i] = make([]bool, m)
+ }
+ low, high := 0, 1000000
+ for low < high {
+ threshold := low + (high-low)>>1
+ if !hasPath(heights, visited, 0, 0, threshold) {
+ low = threshold + 1
+ } else {
+ high = threshold
+ }
+ for i := range visited {
+ for j := range visited[i] {
+ visited[i][j] = false
+ }
+ }
+ }
+ return low
+}
+
+func hasPath(heights [][]int, visited [][]bool, i, j, threshold int) bool {
+ n, m := len(heights), len(heights[0])
+ if i == n-1 && j == m-1 {
+ return true
+ }
+ visited[i][j] = true
+ res := false
+ for _, d := range dir {
+ ni, nj := i+d[0], j+d[1]
+ if ni < 0 || ni >= n || nj < 0 || nj >= m || visited[ni][nj] || res {
+ continue
+ }
+ diff := abs(heights[i][j] - heights[ni][nj])
+ if diff <= threshold && hasPath(heights, visited, ni, nj, threshold) {
+ res = true
+ }
+ }
+ return res
+}
+
+func abs(a int) int {
+ if a < 0 {
+ a = -a
+ }
+ return a
+}
+
+func min(a, b int) int {
+ if a < b {
+ return a
+ }
+ return b
+}
+
+func max(a, b int) int {
+ if a < b {
+ return b
+ }
+ return a
+}
+
+// 解法二 并查集
+func minimumEffortPath1(heights [][]int) int {
+ n, m, edges, uf := len(heights), len(heights[0]), []edge{}, template.UnionFind{}
+ uf.Init(n * m)
+ for i, row := range heights {
+ for j, h := range row {
+ id := i*m + j
+ if i > 0 {
+ edges = append(edges, edge{id - m, id, abs(h - heights[i-1][j])})
+ }
+ if j > 0 {
+ edges = append(edges, edge{id - 1, id, abs(h - heights[i][j-1])})
+ }
+ }
+ }
+ sort.Slice(edges, func(i, j int) bool { return edges[i].diff < edges[j].diff })
+ for _, e := range edges {
+ uf.Union(e.v, e.w)
+ if uf.Find(0) == uf.Find(n*m-1) {
+ return e.diff
+ }
+ }
+ return 0
+}
+
+type edge struct {
+ v, w, diff int
+}
+```
\ No newline at end of file
diff --git a/leetcode/1636.Sort-Array-by-Increasing-Frequency/1636. Sort Array by Increasing Frequency.go b/leetcode/1636.Sort-Array-by-Increasing-Frequency/1636. Sort Array by Increasing Frequency.go
new file mode 100644
index 000000000..a4240e99e
--- /dev/null
+++ b/leetcode/1636.Sort-Array-by-Increasing-Frequency/1636. Sort Array by Increasing Frequency.go
@@ -0,0 +1,17 @@
+package leetcode
+
+import "sort"
+
+func frequencySort(nums []int) []int {
+ freq := map[int]int{}
+ for _, v := range nums {
+ freq[v]++
+ }
+ sort.Slice(nums, func(i, j int) bool {
+ if freq[nums[i]] == freq[nums[j]] {
+ return nums[j] < nums[i]
+ }
+ return freq[nums[i]] < freq[nums[j]]
+ })
+ return nums
+}
diff --git a/leetcode/1636.Sort-Array-by-Increasing-Frequency/1636. Sort Array by Increasing Frequency_test.go b/leetcode/1636.Sort-Array-by-Increasing-Frequency/1636. Sort Array by Increasing Frequency_test.go
new file mode 100644
index 000000000..ac5b8a61e
--- /dev/null
+++ b/leetcode/1636.Sort-Array-by-Increasing-Frequency/1636. Sort Array by Increasing Frequency_test.go
@@ -0,0 +1,52 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question1636 struct {
+ para1636
+ ans1636
+}
+
+// para 是参数
+// one 代表第一个参数
+type para1636 struct {
+ nums []int
+}
+
+// ans 是答案
+// one 代表第一个答案
+type ans1636 struct {
+ one []int
+}
+
+func Test_Problem1636(t *testing.T) {
+
+ qs := []question1636{
+
+ {
+ para1636{[]int{1, 1, 2, 2, 2, 3}},
+ ans1636{[]int{3, 1, 1, 2, 2, 2}},
+ },
+
+ {
+ para1636{[]int{2, 3, 1, 3, 2}},
+ ans1636{[]int{1, 3, 3, 2, 2}},
+ },
+
+ {
+ para1636{[]int{-1, 1, -6, 4, 5, -6, 1, 4, 1}},
+ ans1636{[]int{5, -1, 4, 4, -6, -6, 1, 1, 1}},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 1636------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans1636, q.para1636
+ fmt.Printf("【input】:%v 【output】:%v \n", p, frequencySort(p.nums))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/1636.Sort-Array-by-Increasing-Frequency/README.md b/leetcode/1636.Sort-Array-by-Increasing-Frequency/README.md
new file mode 100644
index 000000000..fb4e75d5e
--- /dev/null
+++ b/leetcode/1636.Sort-Array-by-Increasing-Frequency/README.md
@@ -0,0 +1,66 @@
+# [1636. Sort Array by Increasing Frequency](https://leetcode.com/problems/sort-array-by-increasing-frequency/)
+
+
+## 题目
+
+Given an array of integers `nums`, sort the array in **increasing** order based on the frequency of the values. If multiple values have the same frequency, sort them in **decreasing** order.
+
+Return the *sorted array*.
+
+**Example 1:**
+
+```
+Input: nums = [1,1,2,2,2,3]
+Output: [3,1,1,2,2,2]
+Explanation: '3' has a frequency of 1, '1' has a frequency of 2, and '2' has a frequency of 3.
+```
+
+**Example 2:**
+
+```
+Input: nums = [2,3,1,3,2]
+Output: [1,3,3,2,2]
+Explanation: '2' and '3' both have a frequency of 2, so they are sorted in decreasing order.
+```
+
+**Example 3:**
+
+```
+Input: nums = [-1,1,-6,4,5,-6,1,4,1]
+Output: [5,-1,4,4,-6,-6,1,1,1]
+```
+
+**Constraints:**
+
+- `1 <= nums.length <= 100`
+- `100 <= nums[i] <= 100`
+
+## 题目大意
+
+给你一个整数数组 `nums` ，请你将数组按照每个值的频率 **升序** 排序。如果有多个值的频率相同，请你按照数值本身将它们 **降序** 排序。请你返回排序后的数组。
+
+## 解题思路
+
+- 简单题。先统计每个值的频率，然后按照频率从小到大排序，相同频率的按照值的大小，从大到小排序。
+
+## 代码
+
+```go
+package leetcode
+
+import "sort"
+
+func frequencySort(nums []int) []int {
+ freq := map[int]int{}
+ for _, v := range nums {
+ freq[v]++
+ }
+ sort.Slice(nums, func(i, j int) bool {
+ if freq[nums[i]] == freq[nums[j]] {
+ return nums[j] < nums[i]
+ }
+ return freq[nums[i]] < freq[nums[j]]
+ })
+ return nums
+}
+```
\ No newline at end of file
diff --git a/leetcode/1640.Check-Array-Formation-Through-Concatenation/1640. Check Array Formation Through Concatenation.go b/leetcode/1640.Check-Array-Formation-Through-Concatenation/1640. Check Array Formation Through Concatenation.go
new file mode 100644
index 000000000..384022e24
--- /dev/null
+++ b/leetcode/1640.Check-Array-Formation-Through-Concatenation/1640. Check Array Formation Through Concatenation.go
@@ -0,0 +1,26 @@
+package leetcode
+
+func canFormArray(arr []int, pieces [][]int) bool {
+ arrMap := map[int]int{}
+ for i, v := range arr {
+ arrMap[v] = i
+ }
+ for i := 0; i < len(pieces); i++ {
+ order := -1
+ for j := 0; j < len(pieces[i]); j++ {
+ if _, ok := arrMap[pieces[i][j]]; !ok {
+ return false
+ }
+ if order == -1 {
+ order = arrMap[pieces[i][j]]
+ } else {
+ if arrMap[pieces[i][j]] == order+1 {
+ order = arrMap[pieces[i][j]]
+ } else {
+ return false
+ }
+ }
+ }
+ }
+ return true
+}
diff --git a/leetcode/1640.Check-Array-Formation-Through-Concatenation/1640. Check Array Formation Through Concatenation_test.go b/leetcode/1640.Check-Array-Formation-Through-Concatenation/1640. Check Array Formation Through Concatenation_test.go
new file mode 100644
index 000000000..39b3a7170
--- /dev/null
+++ b/leetcode/1640.Check-Array-Formation-Through-Concatenation/1640. Check Array Formation Through Concatenation_test.go
@@ -0,0 +1,63 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question1640 struct {
+ para1640
+ ans1640
+}
+
+// para 是参数
+// one 代表第一个参数
+type para1640 struct {
+ arr []int
+ pieces [][]int
+}
+
+// ans 是答案
+// one 代表第一个答案
+type ans1640 struct {
+ one bool
+}
+
+func Test_Problem1640(t *testing.T) {
+
+ qs := []question1640{
+
+ {
+ para1640{[]int{85}, [][]int{{85}}},
+ ans1640{true},
+ },
+
+ {
+ para1640{[]int{15, 88}, [][]int{{88}, {15}}},
+ ans1640{true},
+ },
+
+ {
+ para1640{[]int{49, 18, 16}, [][]int{{16, 18, 49}}},
+ ans1640{false},
+ },
+
+ {
+ para1640{[]int{91, 4, 64, 78}, [][]int{{78}, {4, 64}, {91}}},
+ ans1640{true},
+ },
+
+ {
+ para1640{[]int{1, 3, 5, 7}, [][]int{{2, 4, 6, 8}}},
+ ans1640{false},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 1640------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans1640, q.para1640
+ fmt.Printf("【input】:%v 【output】:%v \n", p, canFormArray(p.arr, p.pieces))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/1640.Check-Array-Formation-Through-Concatenation/README.md b/leetcode/1640.Check-Array-Formation-Through-Concatenation/README.md
new file mode 100644
index 000000000..864981778
--- /dev/null
+++ b/leetcode/1640.Check-Array-Formation-Through-Concatenation/README.md
@@ -0,0 +1,95 @@
+# [1640. Check Array Formation Through Concatenation](https://leetcode.com/problems/check-array-formation-through-concatenation/)
+
+
+## 题目
+
+You are given an array of **distinct** integers `arr` and an array of integer arrays `pieces`, where the integers in `pieces` are **distinct**. Your goal is to form `arr` by concatenating the arrays in `pieces` **in any order**. However, you are **not** allowed to reorder the integers in each array `pieces[i]`.
+
+Return `true` *if it is possible to form the array* `arr` *from* `pieces`. Otherwise, return `false`.
+
+**Example 1:**
+
+```
+Input: arr = [85], pieces = [[85]]
+Output: true
+```
+
+**Example 2:**
+
+```
+Input: arr = [15,88], pieces = [[88],[15]]
+Output: true
+Explanation: Concatenate [15] then [88]
+```
+
+**Example 3:**
+
+```
+Input: arr = [49,18,16], pieces = [[16,18,49]]
+Output: false
+Explanation: Even though the numbers match, we cannot reorder pieces[0].
+```
+
+**Example 4:**
+
+```
+Input: arr = [91,4,64,78], pieces = [[78],[4,64],[91]]
+Output: true
+Explanation: Concatenate [91] then [4,64] then [78]
+```
+
+**Example 5:**
+
+```
+Input: arr = [1,3,5,7], pieces = [[2,4,6,8]]
+Output: false
+
+```
+
+**Constraints:**
+
+- `1 <= pieces.length <= arr.length <= 100`
+- `sum(pieces[i].length) == arr.length`
+- `1 <= pieces[i].length <= arr.length`
+- `1 <= arr[i], pieces[i][j] <= 100`
+- The integers in `arr` are **distinct**.
+- The integers in `pieces` are **distinct** (i.e., If we flatten pieces in a 1D array, all the integers in this array are distinct).
+
+## 题目大意
+
+给你一个整数数组 arr ，数组中的每个整数 互不相同 。另有一个由整数数组构成的数组 pieces，其中的整数也 互不相同 。请你以 任意顺序 连接 pieces 中的数组以形成 arr 。但是，不允许 对每个数组 pieces[i] 中的整数重新排序。如果可以连接 pieces 中的数组形成 arr ，返回 true ；否则，返回 false 。
+
+## 解题思路
+
+- 简单题。题目保证了 arr 中的元素唯一，所以可以用 map 把每个元素的 index 存起来，方便查找。遍历 pieces 数组，在每个一维数组中判断元素顺序是否和原 arr 元素相对顺序一致。这个时候就用 map 查找，如果顺序是一一相连的，那么就是正确的。有一个顺序不是一一相连，或者出现了 arr 不存在的元素，都返回 false。
+
+## 代码
+
+```go
+package leetcode
+
+func canFormArray(arr []int, pieces [][]int) bool {
+ arrMap := map[int]int{}
+ for i, v := range arr {
+ arrMap[v] = i
+ }
+ for i := 0; i < len(pieces); i++ {
+ order := -1
+ for j := 0; j < len(pieces[i]); j++ {
+ if _, ok := arrMap[pieces[i][j]]; !ok {
+ return false
+ }
+ if order == -1 {
+ order = arrMap[pieces[i][j]]
+ } else {
+ if arrMap[pieces[i][j]] == order+1 {
+ order = arrMap[pieces[i][j]]
+ } else {
+ return false
+ }
+ }
+ }
+ }
+ return true
+}
+```
\ No newline at end of file
diff --git a/leetcode/1641.Count-Sorted-Vowel-Strings/1641. Count Sorted Vowel Strings.go b/leetcode/1641.Count-Sorted-Vowel-Strings/1641. Count Sorted Vowel Strings.go
new file mode 100644
index 000000000..be2ec59d4
--- /dev/null
+++ b/leetcode/1641.Count-Sorted-Vowel-Strings/1641. Count Sorted Vowel Strings.go
@@ -0,0 +1,35 @@
+package leetcode
+
+// 解法一 打表
+func countVowelStrings(n int) int {
+ res := []int{1, 5, 15, 35, 70, 126, 210, 330, 495, 715, 1001, 1365, 1820, 2380, 3060, 3876, 4845, 5985, 7315, 8855, 10626, 12650, 14950, 17550, 20475, 23751, 27405, 31465, 35960, 40920, 46376, 52360, 58905, 66045, 73815, 82251, 91390, 101270, 111930, 123410, 135751, 148995, 163185, 178365, 194580, 211876, 230300, 249900, 270725, 292825, 316251}
+ return res[n]
+}
+
+func makeTable() []int {
+ res, array := 0, []int{}
+ for i := 0; i < 51; i++ {
+ countVowelStringsDFS(i, 0, []string{}, []string{"a", "e", "i", "o", "u"}, &res)
+ array = append(array, res)
+ res = 0
+ }
+ return array
+}
+
+func countVowelStringsDFS(n, index int, cur []string, vowels []string, res *int) {
+ vowels = vowels[index:]
+ if len(cur) == n {
+ (*res)++
+ return
+ }
+ for i := 0; i < len(vowels); i++ {
+ cur = append(cur, vowels[i])
+ countVowelStringsDFS(n, i, cur, vowels, res)
+ cur = cur[:len(cur)-1]
+ }
+}
+
+// 解法二 数学方法 —— 组合
+func countVowelStrings1(n int) int {
+ return (n + 1) * (n + 2) * (n + 3) * (n + 4) / 24
+}
diff --git a/leetcode/1641.Count-Sorted-Vowel-Strings/1641. Count Sorted Vowel Strings_test.go b/leetcode/1641.Count-Sorted-Vowel-Strings/1641. Count Sorted Vowel Strings_test.go
new file mode 100644
index 000000000..081ffbcd0
--- /dev/null
+++ b/leetcode/1641.Count-Sorted-Vowel-Strings/1641. Count Sorted Vowel Strings_test.go
@@ -0,0 +1,52 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question1641 struct {
+ para1641
+ ans1641
+}
+
+// para 是参数
+// one 代表第一个参数
+type para1641 struct {
+ n int
+}
+
+// ans 是答案
+// one 代表第一个答案
+type ans1641 struct {
+ one int
+}
+
+func Test_Problem1641(t *testing.T) {
+
+ qs := []question1641{
+
+ {
+ para1641{1},
+ ans1641{5},
+ },
+
+ {
+ para1641{2},
+ ans1641{15},
+ },
+
+ {
+ para1641{33},
+ ans1641{66045},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 1641------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans1641, q.para1641
+ fmt.Printf("【input】:%v 【output】:%v \n", p, countVowelStrings(p.n))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/1641.Count-Sorted-Vowel-Strings/README.md b/leetcode/1641.Count-Sorted-Vowel-Strings/README.md
new file mode 100644
index 000000000..8da3acfde
--- /dev/null
+++ b/leetcode/1641.Count-Sorted-Vowel-Strings/README.md
@@ -0,0 +1,90 @@
+# [1641. Count Sorted Vowel Strings](https://leetcode.com/problems/count-sorted-vowel-strings/)
+
+
+## 题目
+
+Given an integer `n`, return *the number of strings of length* `n` *that consist only of vowels (*`a`*,* `e`*,* `i`*,* `o`*,* `u`*) and are **lexicographically sorted**.*
+
+A string `s` is **lexicographically sorted** if for all valid `i`, `s[i]` is the same as or comes before `s[i+1]` in the alphabet.
+
+**Example 1:**
+
+```
+Input: n = 1
+Output: 5
+Explanation: The 5 sorted strings that consist of vowels only are ["a","e","i","o","u"].
+```
+
+**Example 2:**
+
+```
+Input: n = 2
+Output: 15
+Explanation: The 15 sorted strings that consist of vowels only are
+["aa","ae","ai","ao","au","ee","ei","eo","eu","ii","io","iu","oo","ou","uu"].
+Note that "ea" is not a valid string since 'e' comes after 'a' in the alphabet.
+
+```
+
+**Example 3:**
+
+```
+Input: n = 33
+Output: 66045
+
+```
+
+**Constraints:**
+
+- `1 <= n <= 50`
+
+## 题目大意
+
+给你一个整数 n，请返回长度为 n 、仅由元音 (a, e, i, o, u) 组成且按 字典序排列 的字符串数量。
+
+字符串 s 按 字典序排列 需要满足：对于所有有效的 i，s[i] 在字母表中的位置总是与 s[i+1] 相同或在 s[i+1] 之前。
+
+## 解题思路
+
+- 题目给的数据量并不大，第一个思路是利用 DFS 遍历打表法。时间复杂度 O(1)，空间复杂度 O(1)。
+- 第二个思路是利用数学中的组合公式计算结果。题目等价于假设现在有 n 个字母，要求取 4 次球（可以选择不取）将字母分为 5 堆，问有几种取法。确定了取法以后，`a`，`e`，`i`，`o`，`u`，每个字母的个数就确定了，据题意要求按照字母序排序，那么最终字符串也就确定了。现在关注解决这个组合问题就可以了。把问题再转化一次，等价于，有 n+4 个字母，取 4 次，问有几种取法。+4 代表 4 个空操作，取走它们意味着不取。根据组合的数学定义，答案为 C(n+4,4)。
+
+## 代码
+
+```go
+package leetcode
+
+// 解法一 打表
+func countVowelStrings(n int) int {
+ res := []int{1, 5, 15, 35, 70, 126, 210, 330, 495, 715, 1001, 1365, 1820, 2380, 3060, 3876, 4845, 5985, 7315, 8855, 10626, 12650, 14950, 17550, 20475, 23751, 27405, 31465, 35960, 40920, 46376, 52360, 58905, 66045, 73815, 82251, 91390, 101270, 111930, 123410, 135751, 148995, 163185, 178365, 194580, 211876, 230300, 249900, 270725, 292825, 316251}
+ return res[n]
+}
+
+func makeTable() []int {
+ res, array := 0, []int{}
+ for i := 0; i < 51; i++ {
+ countVowelStringsDFS(i, 0, []string{}, []string{"a", "e", "i", "o", "u"}, &res)
+ array = append(array, res)
+ res = 0
+ }
+ return array
+}
+
+func countVowelStringsDFS(n, index int, cur []string, vowels []string, res *int) {
+ vowels = vowels[index:]
+ if len(cur) == n {
+ (*res)++
+ return
+ }
+ for i := 0; i < len(vowels); i++ {
+ cur = append(cur, vowels[i])
+ countVowelStringsDFS(n, i, cur, vowels, res)
+ cur = cur[:len(cur)-1]
+ }
+}
+
+// 解法二 数学方法 —— 组合
+func countVowelStrings1(n int) int {
+ return (n + 1) * (n + 2) * (n + 3) * (n + 4) / 24
+}
+```
\ No newline at end of file
diff --git a/leetcode/1642.Furthest-Building-You-Can-Reach/1642. Furthest Building You Can Reach.go b/leetcode/1642.Furthest-Building-You-Can-Reach/1642. Furthest Building You Can Reach.go
new file mode 100644
index 000000000..c2adc1d97
--- /dev/null
+++ b/leetcode/1642.Furthest-Building-You-Can-Reach/1642. Furthest Building You Can Reach.go
@@ -0,0 +1,40 @@
+package leetcode
+
+import (
+ "container/heap"
+)
+
+func furthestBuilding(heights []int, bricks int, ladder int) int {
+ usedLadder := &heightDiffPQ{}
+ for i := 1; i < len(heights); i++ {
+ needbricks := heights[i] - heights[i-1]
+ if needbricks < 0 {
+ continue
+ }
+ if ladder > 0 {
+ heap.Push(usedLadder, needbricks)
+ ladder--
+ } else {
+ if len(*usedLadder) > 0 && needbricks > (*usedLadder)[0] {
+ needbricks, (*usedLadder)[0] = (*usedLadder)[0], needbricks
+ heap.Fix(usedLadder, 0)
+ }
+ if bricks -= needbricks; bricks < 0 {
+ return i - 1
+ }
+ }
+ }
+ return len(heights) - 1
+}
+
+type heightDiffPQ []int
+
+func (pq heightDiffPQ) Len() int { return len(pq) }
+func (pq heightDiffPQ) Less(i, j int) bool { return pq[i] < pq[j] }
+func (pq heightDiffPQ) Swap(i, j int) { pq[i], pq[j] = pq[j], pq[i] }
+func (pq *heightDiffPQ) Push(x interface{}) { *pq = append(*pq, x.(int)) }
+func (pq *heightDiffPQ) Pop() interface{} {
+ x := (*pq)[len(*pq)-1]
+ *pq = (*pq)[:len(*pq)-1]
+ return x
+}
diff --git a/leetcode/1642.Furthest-Building-You-Can-Reach/1642. Furthest Building You Can Reach_test.go b/leetcode/1642.Furthest-Building-You-Can-Reach/1642. Furthest Building You Can Reach_test.go
new file mode 100644
index 000000000..ee04d85aa
--- /dev/null
+++ b/leetcode/1642.Furthest-Building-You-Can-Reach/1642. Furthest Building You Can Reach_test.go
@@ -0,0 +1,59 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question1642 struct {
+ para1642
+ ans1642
+}
+
+// para 是参数
+// one 代表第一个参数
+type para1642 struct {
+ heights []int
+ bricks int
+ ladders int
+}
+
+// ans 是答案
+// one 代表第一个答案
+type ans1642 struct {
+ one int
+}
+
+func Test_Problem1642(t *testing.T) {
+
+ qs := []question1642{
+
+ {
+ para1642{[]int{1, 5, 1, 2, 3, 4, 10000}, 4, 1},
+ ans1642{5},
+ },
+
+ {
+ para1642{[]int{4, 2, 7, 6, 9, 14, 12}, 5, 1},
+ ans1642{4},
+ },
+
+ {
+ para1642{[]int{4, 12, 2, 7, 3, 18, 20, 3, 19}, 10, 2},
+ ans1642{7},
+ },
+
+ {
+ para1642{[]int{14, 3, 19, 3}, 17, 0},
+ ans1642{3},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 1642------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans1642, q.para1642
+ fmt.Printf("【input】:%v 【output】:%v \n", p, furthestBuilding(p.heights, p.bricks, p.ladders))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/1642.Furthest-Building-You-Can-Reach/README.md b/leetcode/1642.Furthest-Building-You-Can-Reach/README.md
new file mode 100644
index 000000000..e111e26e7
--- /dev/null
+++ b/leetcode/1642.Furthest-Building-You-Can-Reach/README.md
@@ -0,0 +1,113 @@
+# [1642. Furthest Building You Can Reach](https://leetcode.com/problems/furthest-building-you-can-reach/)
+
+
+## 题目
+
+You are given an integer array `heights` representing the heights of buildings, some `bricks`, and some `ladders`.
+
+You start your journey from building `0` and move to the next building by possibly using bricks or ladders.
+
+While moving from building `i` to building `i+1` (**0-indexed**),
+
+- If the current building's height is **greater than or equal** to the next building's height, you do **not** need a ladder or bricks.
+- If the current building's height is **less than** the next building's height, you can either use **one ladder** or `(h[i+1] - h[i])` **bricks**.
+
+*Return the furthest building index (0-indexed) you can reach if you use the given ladders and bricks optimally.*
+
+**Example 1:**
+
+
+
+```
+Input: heights = [4,2,7,6,9,14,12], bricks = 5, ladders = 1
+Output: 4
+Explanation: Starting at building 0, you can follow these steps:
+- Go to building 1 without using ladders nor bricks since 4 >= 2.
+- Go to building 2 using 5 bricks. You must use either bricks or ladders because 2 < 7.
+- Go to building 3 without using ladders nor bricks since 7 >= 6.
+- Go to building 4 using your only ladder. You must use either bricks or ladders because 6 < 9.
+It is impossible to go beyond building 4 because you do not have any more bricks or ladders.
+
+```
+
+**Example 2:**
+
+```
+Input: heights = [4,12,2,7,3,18,20,3,19], bricks = 10, ladders = 2
+Output: 7
+
+```
+
+**Example 3:**
+
+```
+Input: heights = [14,3,19,3], bricks = 17, ladders = 0
+Output: 3
+
+```
+
+**Constraints:**
+
+- `1 <= heights.length <= 10^5`
+- `1 <= heights[i] <= 10^6`
+- `0 <= bricks <= 10^9`
+- `0 <= ladders <= heights.length`
+
+## 题目大意
+
+给你一个整数数组 heights ，表示建筑物的高度。另有一些砖块 bricks 和梯子 ladders 。你从建筑物 0 开始旅程，不断向后面的建筑物移动，期间可能会用到砖块或梯子。当从建筑物 i 移动到建筑物 i+1（下标 从 0 开始 ）时：
+
+- 如果当前建筑物的高度 大于或等于 下一建筑物的高度，则不需要梯子或砖块。
+- 如果当前建筑的高度 小于 下一个建筑的高度，您可以使用 一架梯子 或 (h[i+1] - h[i]) 个砖块
+
+如果以最佳方式使用给定的梯子和砖块，返回你可以到达的最远建筑物的下标（下标 从 0 开始 ）。
+
+## 解题思路
+
+- 这一题可能会想到贪心算法。梯子很厉害，可以无限长，所以梯子用来跨越最高的楼。遇到非最高的距离差，先用砖头。这样贪心的话不正确。例如，[1, 5, 1, 2, 3, 4, 10000] 这组数据，梯子有 1 个，4 块砖头。最大的差距在 10000 和 4 之间，贪心选择在此处用梯子。但是砖头不足以让我们走到最后两栋楼。贪心得到的结果是 3，正确的结果是 5，先用梯子，再用砖头走过 3，4，5 号楼。
+- 上面的贪心解法错误在于没有“动态”的贪心，使用梯子应该选择能爬过楼里面最高的 2 个。于是顺理成章的想到了优先队列。维护一个长度为梯子个数的最小堆，当队列中元素超过梯子个数，便将队首最小值出队，出队的这个楼与楼的差距用砖头填补。所有砖头用完了，即是可以到达的最远楼号。
+
+## 代码
+
+```go
+package leetcode
+
+import (
+ "container/heap"
+)
+
+func furthestBuilding(heights []int, bricks int, ladder int) int {
+ usedLadder := &heightDiffPQ{}
+ for i := 1; i < len(heights); i++ {
+ needbricks := heights[i] - heights[i-1]
+ if needbricks < 0 {
+ continue
+ }
+ if ladder > 0 {
+ heap.Push(usedLadder, needbricks)
+ ladder--
+ } else {
+ if len(*usedLadder) > 0 && needbricks > (*usedLadder)[0] {
+ needbricks, (*usedLadder)[0] = (*usedLadder)[0], needbricks
+ heap.Fix(usedLadder, 0)
+ }
+ if bricks -= needbricks; bricks < 0 {
+ return i - 1
+ }
+ }
+ }
+ return len(heights) - 1
+}
+
+type heightDiffPQ []int
+
+func (pq heightDiffPQ) Len() int { return len(pq) }
+func (pq heightDiffPQ) Less(i, j int) bool { return pq[i] < pq[j] }
+func (pq heightDiffPQ) Swap(i, j int) { pq[i], pq[j] = pq[j], pq[i] }
+func (pq *heightDiffPQ) Push(x interface{}) { *pq = append(*pq, x.(int)) }
+func (pq *heightDiffPQ) Pop() interface{} {
+ x := (*pq)[len(*pq)-1]
+ *pq = (*pq)[:len(*pq)-1]
+ return x
+}
+```
\ No newline at end of file
diff --git a/leetcode/1646.Get-Maximum-in-Generated-Array/1646. Get Maximum in Generated Array.go b/leetcode/1646.Get-Maximum-in-Generated-Array/1646. Get Maximum in Generated Array.go
new file mode 100644
index 000000000..246a1e1fa
--- /dev/null
+++ b/leetcode/1646.Get-Maximum-in-Generated-Array/1646. Get Maximum in Generated Array.go
@@ -0,0 +1,21 @@
+package leetcode
+
+func getMaximumGenerated(n int) int {
+ if n == 0 {
+ return 0
+ }
+ nums, max := make([]int, n+1), 0
+ nums[0], nums[1] = 0, 1
+ for i := 0; i <= n; i++ {
+ if nums[i] > max {
+ max = nums[i]
+ }
+ if 2*i >= 2 && 2*i <= n {
+ nums[2*i] = nums[i]
+ }
+ if 2*i+1 >= 2 && 2*i+1 <= n {
+ nums[2*i+1] = nums[i] + nums[i+1]
+ }
+ }
+ return max
+}
diff --git a/leetcode/1646.Get-Maximum-in-Generated-Array/1646. Get Maximum in Generated Array_test.go b/leetcode/1646.Get-Maximum-in-Generated-Array/1646. Get Maximum in Generated Array_test.go
new file mode 100644
index 000000000..384721906
--- /dev/null
+++ b/leetcode/1646.Get-Maximum-in-Generated-Array/1646. Get Maximum in Generated Array_test.go
@@ -0,0 +1,62 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question1646 struct {
+ para1646
+ ans1646
+}
+
+// para 是参数
+// one 代表第一个参数
+type para1646 struct {
+ n int
+}
+
+// ans 是答案
+// one 代表第一个答案
+type ans1646 struct {
+ one int
+}
+
+func Test_Problem1646(t *testing.T) {
+
+ qs := []question1646{
+
+ {
+ para1646{7},
+ ans1646{3},
+ },
+
+ {
+ para1646{2},
+ ans1646{1},
+ },
+
+ {
+ para1646{3},
+ ans1646{2},
+ },
+
+ {
+ para1646{0},
+ ans1646{0},
+ },
+
+ {
+ para1646{1},
+ ans1646{1},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 1646------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans1646, q.para1646
+ fmt.Printf("【input】:%v 【output】:%v \n", p, getMaximumGenerated(p.n))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/1646.Get-Maximum-in-Generated-Array/README.md b/leetcode/1646.Get-Maximum-in-Generated-Array/README.md
new file mode 100644
index 000000000..a703bba78
--- /dev/null
+++ b/leetcode/1646.Get-Maximum-in-Generated-Array/README.md
@@ -0,0 +1,96 @@
+# [1646. Get Maximum in Generated Array](https://leetcode.com/problems/get-maximum-in-generated-array/)
+
+
+## 题目
+
+You are given an integer `n`. An array `nums` of length `n + 1` is generated in the following way:
+
+- `nums[0] = 0`
+- `nums[1] = 1`
+- `nums[2 * i] = nums[i]` when `2 <= 2 * i <= n`
+- `nums[2 * i + 1] = nums[i] + nums[i + 1]` when `2 <= 2 * i + 1 <= n`
+
+Return *****the **maximum** integer in the array* `nums`.
+
+**Example 1:**
+
+```
+Input: n = 7
+Output: 3
+Explanation: According to the given rules:
+ nums[0] = 0
+ nums[1] = 1
+ nums[(1 * 2) = 2] = nums[1] = 1
+ nums[(1 * 2) + 1 = 3] = nums[1] + nums[2] = 1 + 1 = 2
+ nums[(2 * 2) = 4] = nums[2] = 1
+ nums[(2 * 2) + 1 = 5] = nums[2] + nums[3] = 1 + 2 = 3
+ nums[(3 * 2) = 6] = nums[3] = 2
+ nums[(3 * 2) + 1 = 7] = nums[3] + nums[4] = 2 + 1 = 3
+Hence, nums = [0,1,1,2,1,3,2,3], and the maximum is 3.
+
+```
+
+**Example 2:**
+
+```
+Input: n = 2
+Output: 1
+Explanation: According to the given rules, the maximum between nums[0], nums[1], and nums[2] is 1.
+
+```
+
+**Example 3:**
+
+```
+Input: n = 3
+Output: 2
+Explanation: According to the given rules, the maximum between nums[0], nums[1], nums[2], and nums[3] is 2.
+
+```
+
+**Constraints:**
+
+- `0 <= n <= 100`
+
+## 题目大意
+
+给你一个整数 n 。按下述规则生成一个长度为 n + 1 的数组 nums ：
+
+- nums[0] = 0
+- nums[1] = 1
+- 当 2 <= 2 * i <= n 时，nums[2 * i] = nums[i]
+- 当 2 <= 2 * i + 1 <= n 时，nums[2 * i + 1] = nums[i] + nums[i + 1]
+
+返回生成数组 nums 中的 最大值。
+
+## 解题思路
+
+- 给出一个 n + 1 的数组，并按照生成规则生成这个数组，求出这个数组中的最大值。
+- 简单题，按照题意生成数组，边生成边记录和更新最大值即可。
+- 注意边界条件，当 n 为 0 的时候，数组里面只有一个元素 0 。
+
+## 代码
+
+```go
+package leetcode
+
+func getMaximumGenerated(n int) int {
+ if n == 0 {
+ return 0
+ }
+ nums, max := make([]int, n+1), 0
+ nums[0], nums[1] = 0, 1
+ for i := 0; i <= n; i++ {
+ if nums[i] > max {
+ max = nums[i]
+ }
+ if 2*i >= 2 && 2*i <= n {
+ nums[2*i] = nums[i]
+ }
+ if 2*i+1 >= 2 && 2*i+1 <= n {
+ nums[2*i+1] = nums[i] + nums[i+1]
+ }
+ }
+ return max
+}
+```
\ No newline at end of file
diff --git a/leetcode/1647.Minimum-Deletions-to-Make-Character-Frequencies-Unique/1647. Minimum Deletions to Make Character Frequencies Unique.go b/leetcode/1647.Minimum-Deletions-to-Make-Character-Frequencies-Unique/1647. Minimum Deletions to Make Character Frequencies Unique.go
new file mode 100644
index 000000000..302196609
--- /dev/null
+++ b/leetcode/1647.Minimum-Deletions-to-Make-Character-Frequencies-Unique/1647. Minimum Deletions to Make Character Frequencies Unique.go
@@ -0,0 +1,22 @@
+package leetcode
+
+import (
+ "sort"
+)
+
+func minDeletions(s string) int {
+ frequency, res := make([]int, 26), 0
+ for i := 0; i < len(s); i++ {
+ frequency[s[i]-'a']++
+ }
+ sort.Sort(sort.Reverse(sort.IntSlice(frequency)))
+ for i := 1; i <= 25; i++ {
+ if frequency[i] == frequency[i-1] && frequency[i] != 0 {
+ res++
+ frequency[i]--
+ sort.Sort(sort.Reverse(sort.IntSlice(frequency)))
+ i--
+ }
+ }
+ return res
+}
diff --git a/leetcode/1647.Minimum-Deletions-to-Make-Character-Frequencies-Unique/1647. Minimum Deletions to Make Character Frequencies Unique_test.go b/leetcode/1647.Minimum-Deletions-to-Make-Character-Frequencies-Unique/1647. Minimum Deletions to Make Character Frequencies Unique_test.go
new file mode 100644
index 000000000..3bdc27352
--- /dev/null
+++ b/leetcode/1647.Minimum-Deletions-to-Make-Character-Frequencies-Unique/1647. Minimum Deletions to Make Character Frequencies Unique_test.go
@@ -0,0 +1,62 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question1647 struct {
+ para1647
+ ans1647
+}
+
+// para 是参数
+// one 代表第一个参数
+type para1647 struct {
+ s string
+}
+
+// ans 是答案
+// one 代表第一个答案
+type ans1647 struct {
+ one int
+}
+
+func Test_Problem1647(t *testing.T) {
+
+ qs := []question1647{
+
+ {
+ para1647{"aab"},
+ ans1647{0},
+ },
+
+ {
+ para1647{"aaabbbcc"},
+ ans1647{2},
+ },
+
+ {
+ para1647{"ceabaacb"},
+ ans1647{2},
+ },
+
+ {
+ para1647{""},
+ ans1647{0},
+ },
+
+ {
+ para1647{"abcabc"},
+ ans1647{3},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 1647------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans1647, q.para1647
+ fmt.Printf("【input】:%v 【output】:%v \n", p, minDeletions(p.s))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/1647.Minimum-Deletions-to-Make-Character-Frequencies-Unique/README.md b/leetcode/1647.Minimum-Deletions-to-Make-Character-Frequencies-Unique/README.md
new file mode 100644
index 000000000..e6b2fff80
--- /dev/null
+++ b/leetcode/1647.Minimum-Deletions-to-Make-Character-Frequencies-Unique/README.md
@@ -0,0 +1,89 @@
+# [1647. Minimum Deletions to Make Character Frequencies Unique](https://leetcode.com/problems/minimum-deletions-to-make-character-frequencies-unique/)
+
+
+## 题目
+
+A string `s` is called **good** if there are no two different characters in `s` that have the same **frequency**.
+
+Given a string `s`, return *the **minimum** number of characters you need to delete to make* `s` ***good**.*
+
+The **frequency** of a character in a string is the number of times it appears in the string. For example, in the string `"aab"`, the **frequency** of `'a'` is `2`, while the **frequency** of `'b'` is `1`.
+
+**Example 1:**
+
+```
+Input: s = "aab"
+Output: 0
+Explanation: s is already good.
+
+```
+
+**Example 2:**
+
+```
+Input: s = "aaabbbcc"
+Output: 2
+Explanation: You can delete two 'b's resulting in the good string "aaabcc".
+Another way it to delete one 'b' and one 'c' resulting in the good string "aaabbc".
+```
+
+**Example 3:**
+
+```
+Input: s = "ceabaacb"
+Output: 2
+Explanation: You can delete both 'c's resulting in the good string "eabaab".
+Note that we only care about characters that are still in the string at the end (i.e. frequency of 0 is ignored).
+
+```
+
+**Constraints:**
+
+- `1 <= s.length <= 105`
+- `s` contains only lowercase English letters.
+
+## 题目大意
+
+如果字符串 s 中 不存在 两个不同字符 频次 相同的情况，就称 s 是 优质字符串 。
+
+给你一个字符串 s，返回使 s 成为优质字符串需要删除的最小字符数。
+
+字符串中字符的 频次 是该字符在字符串中的出现次数。例如，在字符串 "aab" 中，'a' 的频次是 2，而 'b' 的频次是 1 。
+
+**提示：**
+
+- `1 <= s.length <= 105`
+- `s` 仅含小写英文字母
+
+## 解题思路
+
+- 给出一个字符串 s，要求输出使 s 变成“优质字符串”需要删除的最小字符数。“优质字符串”的定义是：字符串 s 中不存在频次相同的两个不同字符。
+- 首先将 26 个字母在字符串中的频次分别统计出来，然后把频次从大到小排列，从频次大的开始，依次调整：例如，假设前一个和后一个频次相等，就把前一个字符删除一个，频次减一，再次排序，如果频次还相等，继续调整，如果频次不同了，游标往后移，继续调整后面的频次。直到所有的频次都不同了，就可以输出最终结果了。
+- 这里需要注意频次为 0 的情况，即字母都被删光了。频次为 0 以后，就不需要再比较了。
+
+## 代码
+
+```go
+package leetcode
+
+import (
+ "sort"
+)
+
+func minDeletions(s string) int {
+ frequency, res := make([]int, 26), 0
+ for i := 0; i < len(s); i++ {
+ frequency[s[i]-'a']++
+ }
+ sort.Sort(sort.Reverse(sort.IntSlice(frequency)))
+ for i := 1; i <= 25; i++ {
+ if frequency[i] == frequency[i-1] && frequency[i] != 0 {
+ res++
+ frequency[i]--
+ sort.Sort(sort.Reverse(sort.IntSlice(frequency)))
+ i--
+ }
+ }
+ return res
+}
+```
\ No newline at end of file
diff --git a/leetcode/1648.Sell-Diminishing-Valued-Colored-Balls/1648. Sell Diminishing-Valued Colored Balls.go b/leetcode/1648.Sell-Diminishing-Valued-Colored-Balls/1648. Sell Diminishing-Valued Colored Balls.go
new file mode 100644
index 000000000..677a3699f
--- /dev/null
+++ b/leetcode/1648.Sell-Diminishing-Valued-Colored-Balls/1648. Sell Diminishing-Valued Colored Balls.go
@@ -0,0 +1,102 @@
+package leetcode
+
+import (
+ "container/heap"
+)
+
+// 解法一 贪心 + 二分搜索
+func maxProfit(inventory []int, orders int) int {
+ maxItem, thresholdValue, count, res, mod := 0, -1, 0, 0, 1000000007
+ for i := 0; i < len(inventory); i++ {
+ if inventory[i] > maxItem {
+ maxItem = inventory[i]
+ }
+ }
+ low, high := 0, maxItem
+ for low <= high {
+ mid := low + ((high - low) >> 1)
+ for i := 0; i < len(inventory); i++ {
+ count += max(inventory[i]-mid, 0)
+ }
+ if count <= orders {
+ thresholdValue = mid
+ high = mid - 1
+ } else {
+ low = mid + 1
+ }
+ count = 0
+ }
+ count = 0
+ for i := 0; i < len(inventory); i++ {
+ count += max(inventory[i]-thresholdValue, 0)
+ }
+ count = orders - count
+ for i := 0; i < len(inventory); i++ {
+ if inventory[i] >= thresholdValue {
+ if count > 0 {
+ res += (thresholdValue + inventory[i]) * (inventory[i] - thresholdValue + 1) / 2
+ count--
+ } else {
+ res += (thresholdValue + 1 + inventory[i]) * (inventory[i] - thresholdValue) / 2
+ }
+ }
+ }
+ return res % mod
+}
+
+func max(a int, b int) int {
+ if a > b {
+ return a
+ }
+ return b
+}
+
+// 解法二 优先队列，超时！
+func maxProfit_(inventory []int, orders int) int {
+ res, mod := 0, 1000000007
+ q := PriorityQueue{}
+ for i := 0; i < len(inventory); i++ {
+ heap.Push(&q, &Item{count: inventory[i]})
+ }
+ for ; orders > 0; orders-- {
+ item := heap.Pop(&q).(*Item)
+ res = (res + item.count) % mod
+ heap.Push(&q, &Item{count: item.count - 1})
+ }
+ return res
+}
+
+// Item define
+type Item struct {
+ count int
+}
+
+// A PriorityQueue implements heap.Interface and holds Items.
+type PriorityQueue []*Item
+
+func (pq PriorityQueue) Len() int {
+ return len(pq)
+}
+
+func (pq PriorityQueue) Less(i, j int) bool {
+ // 注意：因为golang中的heap是按最小堆组织的，所以count越大，Less()越小，越靠近堆顶.
+ return pq[i].count > pq[j].count
+}
+
+func (pq PriorityQueue) Swap(i, j int) {
+ pq[i], pq[j] = pq[j], pq[i]
+}
+
+// Push define
+func (pq *PriorityQueue) Push(x interface{}) {
+ item := x.(*Item)
+ *pq = append(*pq, item)
+}
+
+// Pop define
+func (pq *PriorityQueue) Pop() interface{} {
+ n := len(*pq)
+ item := (*pq)[n-1]
+ *pq = (*pq)[:n-1]
+ return item
+}
diff --git a/leetcode/1648.Sell-Diminishing-Valued-Colored-Balls/1648. Sell Diminishing-Valued Colored Balls_test.go b/leetcode/1648.Sell-Diminishing-Valued-Colored-Balls/1648. Sell Diminishing-Valued Colored Balls_test.go
new file mode 100644
index 000000000..b81ce0e6e
--- /dev/null
+++ b/leetcode/1648.Sell-Diminishing-Valued-Colored-Balls/1648. Sell Diminishing-Valued Colored Balls_test.go
@@ -0,0 +1,63 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question1648 struct {
+ para1648
+ ans1648
+}
+
+// para 是参数
+// one 代表第一个参数
+type para1648 struct {
+ inventory []int
+ orders int
+}
+
+// ans 是答案
+// one 代表第一个答案
+type ans1648 struct {
+ one int
+}
+
+func Test_Problem1648(t *testing.T) {
+
+ qs := []question1648{
+
+ {
+ para1648{[]int{2, 3, 3, 4, 5}, 4},
+ ans1648{16},
+ },
+
+ {
+ para1648{[]int{2, 5}, 4},
+ ans1648{14},
+ },
+
+ {
+ para1648{[]int{3, 5}, 6},
+ ans1648{19},
+ },
+
+ {
+ para1648{[]int{2, 8, 4, 10, 6}, 20},
+ ans1648{110},
+ },
+
+ {
+ para1648{[]int{1000000000}, 1000000000},
+ ans1648{21},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 1648------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans1648, q.para1648
+ fmt.Printf("【input】:%v 【output】:%v \n", p, maxProfit(p.inventory, p.orders))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/1648.Sell-Diminishing-Valued-Colored-Balls/README.md b/leetcode/1648.Sell-Diminishing-Valued-Colored-Balls/README.md
new file mode 100644
index 000000000..bddd91b31
--- /dev/null
+++ b/leetcode/1648.Sell-Diminishing-Valued-Colored-Balls/README.md
@@ -0,0 +1,131 @@
+# [1648. Sell Diminishing-Valued Colored Balls](https://leetcode.com/problems/sell-diminishing-valued-colored-balls/)
+
+
+## 题目
+
+You have an `inventory` of different colored balls, and there is a customer that wants `orders` balls of **any** color.
+
+The customer weirdly values the colored balls. Each colored ball's value is the number of balls **of that color** you currently have in your `inventory`. For example, if you own `6` yellow balls, the customer would pay `6` for the first yellow ball. After the transaction, there are only `5` yellow balls left, so the next yellow ball is then valued at `5` (i.e., the value of the balls decreases as you sell more to the customer).
+
+You are given an integer array, `inventory`, where `inventory[i]` represents the number of balls of the `ith` color that you initially own. You are also given an integer `orders`, which represents the total number of balls that the customer wants. You can sell the balls **in any order**.
+
+Return *the **maximum** total value that you can attain after selling* `orders` *colored balls*. As the answer may be too large, return it **modulo** `109 + 7`.
+
+**Example 1:**
+
+
+
+```
+Input: inventory = [2,5], orders = 4
+Output: 14
+Explanation: Sell the 1st color 1 time (2) and the 2nd color 3 times (5 + 4 + 3).
+The maximum total value is 2 + 5 + 4 + 3 = 14.
+
+```
+
+**Example 2:**
+
+```
+Input: inventory = [3,5], orders = 6
+Output: 19
+Explanation: Sell the 1st color 2 times (3 + 2) and the 2nd color 4 times (5 + 4 + 3 + 2).
+The maximum total value is 3 + 2 + 5 + 4 + 3 + 2 = 19.
+```
+
+**Example 3:**
+
+```
+Input: inventory = [2,8,4,10,6], orders = 20
+Output: 110
+```
+
+**Example 4:**
+
+```
+Input: inventory = [1000000000], orders = 1000000000
+Output: 21
+Explanation: Sell the 1st color 1000000000 times for a total value of 500000000500000000. 500000000500000000 modulo 109 + 7 = 21.
+```
+
+**Constraints:**
+
+- `1 <= inventory.length <= 10^5`
+- `1 <= inventory[i] <= 10^9`
+- `1 <= orders <= min(sum(inventory[i]), 10^9)`
+
+## 题目大意
+
+你有一些球的库存 inventory ，里面包含着不同颜色的球。一个顾客想要 任意颜色 总数为 orders 的球。这位顾客有一种特殊的方式衡量球的价值：每个球的价值是目前剩下的 同色球 的数目。比方说还剩下 6 个黄球，那么顾客买第一个黄球的时候该黄球的价值为 6 。这笔交易以后，只剩下 5 个黄球了，所以下一个黄球的价值为 5 （也就是球的价值随着顾客购买同色球是递减的）
+
+给你整数数组 inventory ，其中 inventory[i] 表示第 i 种颜色球一开始的数目。同时给你整数 orders ，表示顾客总共想买的球数目。你可以按照 任意顺序 卖球。请你返回卖了 orders 个球以后 最大 总价值之和。由于答案可能会很大，请你返回答案对 109 + 7 取余数 的结果。
+
+提示：
+
+- 1 <= inventory.length <= 10^5
+- 1 <= inventory[i] <= 10^9
+- 1 <= orders <= min(sum(inventory[i]), 10^9)
+
+## 解题思路
+
+- 给出一个 `inventory` 数组和 `orders` 次操作，要求输出数组中前 `orders` 大个元素累加和。需要注意的是，每累加一个元素 `inventory[i]`，这个元素都会减一，下次再累加的时候，需要选取更新以后的数组的最大值。
+- 拿到这个题目以后很容易想到优先队列，建立大根堆以后，`pop` 出当前最大值 `maxItem`，累加，以后把 `maxItem` 减一再 `push` 回去。循环执行 `orders` 次以后即是最终结果。题目是这个意思，但是我们不能这么写代码，因为题目条件里面给出了 `orders` 的数据大小。orders 最大为 10^9。按照优先队列的这个方法一定会超时，时间复杂度为 O(orders⋅logn)。那就换一个思路。优先队列这个思路中，重复操作了 `orders` 次，其实在这些操作中，有一些是没有必要的废操作。这些大量的“废”操作导致了超时。试想，在 `orders` 次操作中，能否合并 `n` 个 `pop` 操作，一口气先 `pop` 掉 `n` 个前 `n` 大的数呢？这个是可行的，因为每次 `pop` 出去，元素都只会减一，这个是非常有规律的。
+- 为了接下来的描述更加清晰易懂，还需要再定义 1 个值， `thresholdValue` 为操作 `n` 次以后，当前 `inventory` 数组的最大值。关于 `thresholdValue` 的理解，这里要说明一下。 `thresholdValue` 的来源有 2 种，一种是本来数组里面就有这个值，还有一种来源是 `inventory[i]` 元素减少到了 `thresholdValue` 这个值。举个例子：原始数组是 [2,3,3,4,5]，`orders` = 4，取 4 次以后，剩下的数组是 [2,2,3,3,3]。3 个 3 里面其中一个 3 就来自于 `4-1=3`，或者 `5-2=3`。
+- 用二分搜索在 [0，max(`inventory`)] 区间内找到这个 `thresholdValue` 值，能满足下列不等式的最小 `thresholdValue` 值：
+
+ $$\sum_{inventory[i]\geqslant thresholdValue}^{} \left ( inventory[i] - thresholdValue \right )\leqslant orders$$
+
+ `thresholdValue` 越小，不等式左边的值越大，随着 `thresholdValue` 的增大，不等式左边的值越来越小，直到刚刚能小于等于 `orders`。求出了 `thresholdValue` 值以后，还需要再判断有多少值等于 `thresholdValue - 1` 值了。
+
+ 
+
+- 还是举上面的例子，原始数组是 [2,3,3,4,5]，`orders` = 4，我们可以求得 `thresholdValue` = 3 。`inventory[i]` > `thresholdValue` 的那部分 100% 的要取走，`thresholdValue` 就像一个水平面，突出水平面的那些都要拿走，每列的值按照等差数列求和公式计算即可。但是 `orders` - `thresholdValue` = 1，说明水平面以下还要拿走一个，即 `thresholdValue` 线下的虚线框里面的那 4 个球，还需要任意取走一个。最后总的结果是这 2 部分的总和，( ( 5 + 4 ) + 4 ) + 3 = 16 。
+
+## 代码
+
+```go
+package leetcode
+
+import (
+ "container/heap"
+)
+
+// 解法一 贪心 + 二分搜索
+func maxProfit(inventory []int, orders int) int {
+ maxItem, thresholdValue, count, res, mod := 0, -1, 0, 0, 1000000007
+ for i := 0; i < len(inventory); i++ {
+ if inventory[i] > maxItem {
+ maxItem = inventory[i]
+ }
+ }
+ low, high := 0, maxItem
+ for low <= high {
+ mid := low + ((high - low) >> 1)
+ for i := 0; i < len(inventory); i++ {
+ count += max(inventory[i]-mid, 0)
+ }
+ if count <= orders {
+ thresholdValue = mid
+ high = mid - 1
+ } else {
+ low = mid + 1
+ }
+ count = 0
+ }
+ count = 0
+ for i := 0; i < len(inventory); i++ {
+ count += max(inventory[i]-thresholdValue, 0)
+ }
+ count = orders - count
+ for i := 0; i < len(inventory); i++ {
+ if inventory[i] >= thresholdValue {
+ if count > 0 {
+ res += (thresholdValue + inventory[i]) * (inventory[i] - thresholdValue + 1) / 2
+ count--
+ } else {
+ res += (thresholdValue + 1 + inventory[i]) * (inventory[i] - thresholdValue) / 2
+ }
+ }
+ }
+ return res % mod
+}
+```
\ No newline at end of file
diff --git a/leetcode/1649.Create-Sorted-Array-through-Instructions/1649. Create Sorted Array through Instructions.go b/leetcode/1649.Create-Sorted-Array-through-Instructions/1649. Create Sorted Array through Instructions.go
new file mode 100644
index 000000000..094f4cd09
--- /dev/null
+++ b/leetcode/1649.Create-Sorted-Array-through-Instructions/1649. Create Sorted Array through Instructions.go
@@ -0,0 +1,65 @@
+package leetcode
+
+import (
+ "sort"
+
+ "github.com/halfrost/LeetCode-Go/template"
+)
+
+// 解法一 树状数组 Binary Indexed Tree
+func createSortedArray(instructions []int) int {
+ bit, res := template.BinaryIndexedTree{}, 0
+ bit.Init(100001)
+ for i, v := range instructions {
+ less := bit.Query(v - 1)
+ greater := i - bit.Query(v)
+ res = (res + min(less, greater)) % (1e9 + 7)
+ bit.Add(v, 1)
+ }
+ return res
+}
+
+// 解法二 线段树 SegmentTree
+func createSortedArray1(instructions []int) int {
+ if len(instructions) == 0 {
+ return 0
+ }
+ st, res, mod := template.SegmentCountTree{}, 0, 1000000007
+ numsMap, numsArray, tmpArray := discretization1649(instructions)
+ // 初始化线段树，节点内的值都赋值为 0，即计数为 0
+ st.Init(tmpArray, func(i, j int) int {
+ return 0
+ })
+ for i := 0; i < len(instructions); i++ {
+ strictlyLessThan := st.Query(0, numsMap[instructions[i]]-1)
+ strictlyGreaterThan := st.Query(numsMap[instructions[i]]+1, numsArray[len(numsArray)-1])
+ res = (res + min(strictlyLessThan, strictlyGreaterThan)) % mod
+ st.UpdateCount(numsMap[instructions[i]])
+ }
+ return res
+}
+
+func discretization1649(instructions []int) (map[int]int, []int, []int) {
+ tmpArray, numsArray, numsMap := []int{}, []int{}, map[int]int{}
+ for i := 0; i < len(instructions); i++ {
+ numsMap[instructions[i]] = instructions[i]
+ }
+ for _, v := range numsMap {
+ numsArray = append(numsArray, v)
+ }
+ sort.Ints(numsArray)
+ for i, num := range numsArray {
+ numsMap[num] = i
+ }
+ for i := range numsArray {
+ tmpArray = append(tmpArray, i)
+ }
+ return numsMap, numsArray, tmpArray
+}
+
+func min(a int, b int) int {
+ if a > b {
+ return b
+ }
+ return a
+}
diff --git a/leetcode/1649.Create-Sorted-Array-through-Instructions/1649. Create Sorted Array through Instructions_test.go b/leetcode/1649.Create-Sorted-Array-through-Instructions/1649. Create Sorted Array through Instructions_test.go
new file mode 100644
index 000000000..892fe14f0
--- /dev/null
+++ b/leetcode/1649.Create-Sorted-Array-through-Instructions/1649. Create Sorted Array through Instructions_test.go
@@ -0,0 +1,52 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question1649 struct {
+ para1649
+ ans1649
+}
+
+// para 是参数
+// one 代表第一个参数
+type para1649 struct {
+ instructions []int
+}
+
+// ans 是答案
+// one 代表第一个答案
+type ans1649 struct {
+ one int
+}
+
+func Test_Problem1649(t *testing.T) {
+
+ qs := []question1649{
+
+ {
+ para1649{[]int{1, 5, 6, 2}},
+ ans1649{1},
+ },
+
+ {
+ para1649{[]int{1, 2, 3, 6, 5, 4}},
+ ans1649{3},
+ },
+
+ {
+ para1649{[]int{1, 3, 3, 3, 2, 4, 2, 1, 2}},
+ ans1649{4},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 1649------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans1649, q.para1649
+ fmt.Printf("【input】:%v 【output】:%v \n", p, createSortedArray(p.instructions))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/1649.Create-Sorted-Array-through-Instructions/README.md b/leetcode/1649.Create-Sorted-Array-through-Instructions/README.md
new file mode 100644
index 000000000..0ecda999f
--- /dev/null
+++ b/leetcode/1649.Create-Sorted-Array-through-Instructions/README.md
@@ -0,0 +1,149 @@
+# [1649. Create Sorted Array through Instructions](https://leetcode.com/problems/create-sorted-array-through-instructions/)
+
+## 题目
+
+Given an integer array `instructions`, you are asked to create a sorted array from the elements in `instructions`. You start with an empty container `nums`. For each element from **left to right** in `instructions`, insert it into `nums`. The **cost** of each insertion is the **minimum** of the following:
+
+- The number of elements currently in `nums` that are **strictly less than** `instructions[i]`.
+- The number of elements currently in `nums` that are **strictly greater than** `instructions[i]`.
+
+For example, if inserting element `3` into `nums = [1,2,3,5]`, the **cost** of insertion is `min(2, 1)` (elements `1` and `2` are less than `3`, element `5` is greater than `3`) and `nums` will become `[1,2,3,3,5]`.
+
+Return *the **total cost** to insert all elements from* `instructions` *into* `nums`. Since the answer may be large, return it **modulo** `10^9 + 7`
+
+**Example 1:**
+
+```
+Input: instructions = [1,5,6,2]
+Output: 1
+Explanation: Begin with nums = [].
+Insert 1 with cost min(0, 0) = 0, now nums = [1].
+Insert 5 with cost min(1, 0) = 0, now nums = [1,5].
+Insert 6 with cost min(2, 0) = 0, now nums = [1,5,6].
+Insert 2 with cost min(1, 2) = 1, now nums = [1,2,5,6].
+The total cost is 0 + 0 + 0 + 1 = 1.
+```
+
+**Example 2:**
+
+```
+Input: instructions = [1,2,3,6,5,4]
+Output: 3
+Explanation: Begin with nums = [].
+Insert 1 with cost min(0, 0) = 0, now nums = [1].
+Insert 2 with cost min(1, 0) = 0, now nums = [1,2].
+Insert 3 with cost min(2, 0) = 0, now nums = [1,2,3].
+Insert 6 with cost min(3, 0) = 0, now nums = [1,2,3,6].
+Insert 5 with cost min(3, 1) = 1, now nums = [1,2,3,5,6].
+Insert 4 with cost min(3, 2) = 2, now nums = [1,2,3,4,5,6].
+The total cost is 0 + 0 + 0 + 0 + 1 + 2 = 3.
+```
+
+**Example 3:**
+
+```
+Input: instructions = [1,3,3,3,2,4,2,1,2]
+Output: 4
+Explanation: Begin with nums = [].
+Insert 1 with cost min(0, 0) = 0, now nums = [1].
+Insert 3 with cost min(1, 0) = 0, now nums = [1,3].
+Insert 3 with cost min(1, 0) = 0, now nums = [1,3,3].
+Insert 3 with cost min(1, 0) = 0, now nums = [1,3,3,3].
+Insert 2 with cost min(1, 3) = 1, now nums = [1,2,3,3,3].
+Insert 4 with cost min(5, 0) = 0, now nums = [1,2,3,3,3,4].
+Insert 2 with cost min(1, 4) = 1, now nums = [1,2,2,3,3,3,4].
+Insert 1 with cost min(0, 6) = 0, now nums = [1,1,2,2,3,3,3,4].
+Insert 2 with cost min(2, 4) = 2, now nums = [1,1,2,2,2,3,3,3,4].
+The total cost is 0 + 0 + 0 + 0 + 1 + 0 + 1 + 0 + 2 = 4.
+```
+
+**Constraints:**
+
+- `1 <= instructions.length <= 105`
+- `1 <= instructions[i] <= 105`
+
+## 题目大意
+
+给你一个整数数组 instructions ，你需要根据 instructions 中的元素创建一个有序数组。一开始你有一个空的数组 nums ，你需要 从左到右 遍历 instructions 中的元素，将它们依次插入 nums 数组中。每一次插入操作的 代价 是以下两者的 较小值 ：
+
+- nums 中 严格小于 instructions[i] 的数字数目。
+- nums 中 严格大于 instructions[i] 的数字数目。
+
+比方说，如果要将 3 插入到 nums = [1,2,3,5] ，那么插入操作的 代价 为 min(2, 1) (元素 1 和 2 小于 3 ，元素 5 大于 3 ），插入后 nums 变成 [1,2,3,3,5] 。请你返回将 instructions 中所有元素依次插入 nums 后的 总最小代价 。由于答案会很大，请将它对 10^9 + 7 取余 后返回。
+
+## 解题思路
+
+- 给出一个数组，要求将其中的元素从头开始往另外一个空数组中插入，每次插入前，累加代价值 cost = min(**strictly less than**, **strictly greater than**)。最后输出累加值。
+- 这一题虽然是 Hard 题，但是读完题以后就可以判定这是模板题了。可以用线段树和树状数组来解决。这里简单说说线段树的思路吧，先将待插入的数组排序，获得总的区间。每次循环做 4 步：2 次 `query` 分别得到 `strictlyLessThan` 和 `strictlyGreaterThan` ，再比较出两者中的最小值累加，最后一步就是 `update`。
+- 由于题目给的数据比较大，所以建立线段树之前记得要先离散化。这一题核心代码不超过 10 行，其他的都是模板代码。具体实现见代码。
+
+## 代码
+
+```go
+package leetcode
+
+import (
+ "sort"
+
+ "github.com/halfrost/LeetCode-Go/template"
+)
+
+// 解法一 树状数组 Binary Indexed Tree
+func createSortedArray(instructions []int) int {
+ bit, res := template.BinaryIndexedTree{}, 0
+ bit.Init(100001)
+ for i, v := range instructions {
+ less := bit.Query(v - 1)
+ greater := i - bit.Query(v)
+ res = (res + min(less, greater)) % (1e9 + 7)
+ bit.Add(v, 1)
+ }
+ return res
+}
+
+// 解法二 线段树 SegmentTree
+func createSortedArray1(instructions []int) int {
+ if len(instructions) == 0 {
+ return 0
+ }
+ st, res, mod := template.SegmentCountTree{}, 0, 1000000007
+ numsMap, numsArray, tmpArray := discretization1649(instructions)
+ // 初始化线段树，节点内的值都赋值为 0，即计数为 0
+ st.Init(tmpArray, func(i, j int) int {
+ return 0
+ })
+ for i := 0; i < len(instructions); i++ {
+ strictlyLessThan := st.Query(0, numsMap[instructions[i]]-1)
+ strictlyGreaterThan := st.Query(numsMap[instructions[i]]+1, numsArray[len(numsArray)-1])
+ res = (res + min(strictlyLessThan, strictlyGreaterThan)) % mod
+ st.UpdateCount(numsMap[instructions[i]])
+ }
+ return res
+}
+
+func discretization1649(instructions []int) (map[int]int, []int, []int) {
+ tmpArray, numsArray, numsMap := []int{}, []int{}, map[int]int{}
+ for i := 0; i < len(instructions); i++ {
+ numsMap[instructions[i]] = instructions[i]
+ }
+ for _, v := range numsMap {
+ numsArray = append(numsArray, v)
+ }
+ sort.Ints(numsArray)
+ for i, num := range numsArray {
+ numsMap[num] = i
+ }
+ for i := range numsArray {
+ tmpArray = append(tmpArray, i)
+ }
+ return numsMap, numsArray, tmpArray
+}
+
+func min(a int, b int) int {
+ if a > b {
+ return b
+ }
+ return a
+}
+
+```
\ No newline at end of file
diff --git a/leetcode/1652.Defuse-the-Bomb/1652. Defuse the Bomb.go b/leetcode/1652.Defuse-the-Bomb/1652. Defuse the Bomb.go
new file mode 100644
index 000000000..cd0c245ed
--- /dev/null
+++ b/leetcode/1652.Defuse-the-Bomb/1652. Defuse the Bomb.go
@@ -0,0 +1,56 @@
+package leetcode
+
+func decrypt(code []int, k int) []int {
+ if k == 0 {
+ for i := 0; i < len(code); i++ {
+ code[i] = 0
+ }
+ return code
+ }
+ count, sum, res := k, 0, make([]int, len(code))
+ if k > 0 {
+ for i := 0; i < len(code); i++ {
+ for j := i + 1; j < len(code); j++ {
+ if count == 0 {
+ break
+ }
+ sum += code[j]
+ count--
+ }
+ if count > 0 {
+ for j := 0; j < len(code); j++ {
+ if count == 0 {
+ break
+ }
+ sum += code[j]
+ count--
+ }
+ }
+ res[i] = sum
+ sum, count = 0, k
+ }
+ }
+ if k < 0 {
+ for i := 0; i < len(code); i++ {
+ for j := i - 1; j >= 0; j-- {
+ if count == 0 {
+ break
+ }
+ sum += code[j]
+ count++
+ }
+ if count < 0 {
+ for j := len(code) - 1; j >= 0; j-- {
+ if count == 0 {
+ break
+ }
+ sum += code[j]
+ count++
+ }
+ }
+ res[i] = sum
+ sum, count = 0, k
+ }
+ }
+ return res
+}
diff --git a/leetcode/1652.Defuse-the-Bomb/1652. Defuse the Bomb_test.go b/leetcode/1652.Defuse-the-Bomb/1652. Defuse the Bomb_test.go
new file mode 100644
index 000000000..87ce3aeff
--- /dev/null
+++ b/leetcode/1652.Defuse-the-Bomb/1652. Defuse the Bomb_test.go
@@ -0,0 +1,53 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question1652 struct {
+ para1652
+ ans1652
+}
+
+// para 是参数
+// one 代表第一个参数
+type para1652 struct {
+ code []int
+ k int
+}
+
+// ans 是答案
+// one 代表第一个答案
+type ans1652 struct {
+ one []int
+}
+
+func Test_Problem1652(t *testing.T) {
+
+ qs := []question1652{
+
+ {
+ para1652{[]int{5, 7, 1, 4}, 3},
+ ans1652{[]int{12, 10, 16, 13}},
+ },
+
+ {
+ para1652{[]int{1, 2, 3, 4}, 0},
+ ans1652{[]int{0, 0, 0, 0}},
+ },
+
+ {
+ para1652{[]int{2, 4, 9, 3}, -2},
+ ans1652{[]int{12, 5, 6, 13}},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 1652------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans1652, q.para1652
+ fmt.Printf("【input】:%v 【output】:%v \n", p, decrypt(p.code, p.k))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/1652.Defuse-the-Bomb/README.md b/leetcode/1652.Defuse-the-Bomb/README.md
new file mode 100644
index 000000000..cc47f853e
--- /dev/null
+++ b/leetcode/1652.Defuse-the-Bomb/README.md
@@ -0,0 +1,125 @@
+# [1652. Defuse the Bomb](https://leetcode.com/problems/defuse-the-bomb/)
+
+
+## 题目
+
+You have a bomb to defuse, and your time is running out! Your informer will provide you with a **circular** array `code` of length of `n` and a key `k`.
+
+To decrypt the code, you must replace every number. All the numbers are replaced **simultaneously**.
+
+- If `k > 0`, replace the `ith` number with the sum of the **next** `k` numbers.
+- If `k < 0`, replace the `ith` number with the sum of the **previous** `k` numbers.
+- If `k == 0`, replace the `ith` number with `0`.
+
+As `code` is circular, the next element of `code[n-1]` is `code[0]`, and the previous element of `code[0]` is `code[n-1]`.
+
+Given the **circular** array `code` and an integer key `k`, return *the decrypted code to defuse the bomb*!
+
+**Example 1:**
+
+```
+Input: code = [5,7,1,4], k = 3
+Output: [12,10,16,13]
+Explanation: Each number is replaced by the sum of the next 3 numbers. The decrypted code is [7+1+4, 1+4+5, 4+5+7, 5+7+1]. Notice that the numbers wrap around.
+```
+
+**Example 2:**
+
+```
+Input: code = [1,2,3,4], k = 0
+Output: [0,0,0,0]
+Explanation: When k is zero, the numbers are replaced by 0.
+```
+
+**Example 3:**
+
+```
+Input: code = [2,4,9,3], k = -2
+Output: [12,5,6,13]
+Explanation: The decrypted code is [3+9, 2+3, 4+2, 9+4]. Notice that the numbers wrap around again. If k is negative, the sum is of the previous numbers.
+```
+
+**Constraints:**
+
+- `n == code.length`
+- `1 <= n <= 100`
+- `1 <= code[i] <= 100`
+- `(n - 1) <= k <= n - 1`
+
+## 题目大意
+
+你有一个炸弹需要拆除，时间紧迫！你的情报员会给你一个长度为 n 的 循环 数组 code 以及一个密钥 k 。为了获得正确的密码，你需要替换掉每一个数字。所有数字会 同时 被替换。
+
+- 如果 k > 0 ，将第 i 个数字用 接下来 k 个数字之和替换。
+- 如果 k < 0 ，将第 i 个数字用 之前 k 个数字之和替换。
+- 如果 k == 0 ，将第 i 个数字用 0 替换。
+
+由于 code 是循环的， code[n-1] 下一个元素是 code[0] ，且 code[0] 前一个元素是 code[n-1] 。
+
+给你 循环 数组 code 和整数密钥 k ，请你返回解密后的结果来拆除炸弹！
+
+## 解题思路
+
+- 给出一个 code 数组，要求按照规则替换每个字母。
+- 简单题，按照题意描述循环即可。
+
+## 代码
+
+```go
+package leetcode
+
+func decrypt(code []int, k int) []int {
+ if k == 0 {
+ for i := 0; i < len(code); i++ {
+ code[i] = 0
+ }
+ return code
+ }
+ count, sum, res := k, 0, make([]int, len(code))
+ if k > 0 {
+ for i := 0; i < len(code); i++ {
+ for j := i + 1; j < len(code); j++ {
+ if count == 0 {
+ break
+ }
+ sum += code[j]
+ count--
+ }
+ if count > 0 {
+ for j := 0; j < len(code); j++ {
+ if count == 0 {
+ break
+ }
+ sum += code[j]
+ count--
+ }
+ }
+ res[i] = sum
+ sum, count = 0, k
+ }
+ }
+ if k < 0 {
+ for i := 0; i < len(code); i++ {
+ for j := i - 1; j >= 0; j-- {
+ if count == 0 {
+ break
+ }
+ sum += code[j]
+ count++
+ }
+ if count < 0 {
+ for j := len(code) - 1; j >= 0; j-- {
+ if count == 0 {
+ break
+ }
+ sum += code[j]
+ count++
+ }
+ }
+ res[i] = sum
+ sum, count = 0, k
+ }
+ }
+ return res
+}
+```
\ No newline at end of file
diff --git a/leetcode/1653.Minimum-Deletions-to-Make-String-Balanced/1653. Minimum Deletions to Make String Balanced.go b/leetcode/1653.Minimum-Deletions-to-Make-String-Balanced/1653. Minimum Deletions to Make String Balanced.go
new file mode 100644
index 000000000..1d5bc9889
--- /dev/null
+++ b/leetcode/1653.Minimum-Deletions-to-Make-String-Balanced/1653. Minimum Deletions to Make String Balanced.go
@@ -0,0 +1,42 @@
+package leetcode
+
+// 解法一 DP
+func minimumDeletions(s string) int {
+ prev, res, bCount := 0, 0, 0
+ for _, c := range s {
+ if c == 'a' {
+ res = min(prev+1, bCount)
+ prev = res
+ } else {
+ bCount++
+ }
+ }
+ return res
+}
+
+func min(a, b int) int {
+ if a < b {
+ return a
+ }
+ return b
+}
+
+// 解法二 模拟
+func minimumDeletions1(s string) int {
+ aCount, bCount, res := 0, 0, 0
+ for i := 0; i < len(s); i++ {
+ if s[i] == 'a' {
+ aCount++
+ }
+ }
+ res = aCount
+ for i := 0; i < len(s); i++ {
+ if s[i] == 'a' {
+ aCount--
+ } else {
+ bCount++
+ }
+ res = min(res, aCount+bCount)
+ }
+ return res
+}
diff --git a/leetcode/1653.Minimum-Deletions-to-Make-String-Balanced/1653. Minimum Deletions to Make String Balanced_test.go b/leetcode/1653.Minimum-Deletions-to-Make-String-Balanced/1653. Minimum Deletions to Make String Balanced_test.go
new file mode 100644
index 000000000..672ef5cd1
--- /dev/null
+++ b/leetcode/1653.Minimum-Deletions-to-Make-String-Balanced/1653. Minimum Deletions to Make String Balanced_test.go
@@ -0,0 +1,57 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question1653 struct {
+ para1653
+ ans1653
+}
+
+// para 是参数
+// one 代表第一个参数
+type para1653 struct {
+ s string
+}
+
+// ans 是答案
+// one 代表第一个答案
+type ans1653 struct {
+ one int
+}
+
+func Test_Problem1653(t *testing.T) {
+
+ qs := []question1653{
+
+ {
+ para1653{"aababbab"},
+ ans1653{2},
+ },
+
+ {
+ para1653{"bbaaaaabb"},
+ ans1653{2},
+ },
+
+ {
+ para1653{"b"},
+ ans1653{0},
+ },
+
+ {
+ para1653{"ababaaaabbbbbaaababbbbbbaaabbaababbabbbbaabbbbaabbabbabaabbbababaa"},
+ ans1653{25},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 1653------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans1653, q.para1653
+ fmt.Printf("【input】:%v 【output】:%v \n", p, minimumDeletions(p.s))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/1653.Minimum-Deletions-to-Make-String-Balanced/README.md b/leetcode/1653.Minimum-Deletions-to-Make-String-Balanced/README.md
new file mode 100644
index 000000000..f162b23ef
--- /dev/null
+++ b/leetcode/1653.Minimum-Deletions-to-Make-String-Balanced/README.md
@@ -0,0 +1,90 @@
+# [1653. Minimum Deletions to Make String Balanced](https://leetcode.com/problems/minimum-deletions-to-make-string-balanced/)
+
+
+## 题目
+
+You are given a string `s` consisting only of characters `'a'` and `'b'`.
+
+You can delete any number of characters in `s` to make `s` **balanced**. `s` is **balanced** if there is no pair of indices `(i,j)` such that `i < j` and `s[i] = 'b'` and `s[j]= 'a'`.
+
+Return *the **minimum** number of deletions needed to make* `s` ***balanced***.
+
+**Example 1:**
+
+```
+Input: s = "aababbab"
+Output: 2
+Explanation: You can either:
+Delete the characters at 0-indexed positions 2 and 6 ("aababbab" -> "aaabbb"), or
+Delete the characters at 0-indexed positions 3 and 6 ("aababbab" -> "aabbbb").
+```
+
+**Example 2:**
+
+```
+Input: s = "bbaaaaabb"
+Output: 2
+Explanation: The only solution is to delete the first two characters.
+```
+
+**Constraints:**
+
+- `1 <= s.length <= 105`
+- `s[i]` is `'a'` or `'b'`.
+
+## 题目大意
+
+给你一个字符串 s ，它仅包含字符 'a' 和 'b' 。你可以删除 s 中任意数目的字符，使得 s 平衡 。我们称 s 平衡的 当不存在下标对 (i,j) 满足 i < j 且 s[i] = 'b' 同时 s[j]= 'a' 。请你返回使 s 平衡 的 最少 删除次数。
+
+## 解题思路
+
+- 给定一个字符串，要求删除最少次数，使得字母 a 都排在字母 b 的前面。
+- 很容易想到的一个解题思路是 DP。定义 `dp[i]` 为字符串下标 [ 0, i ] 这个区间内使得字符串平衡的最少删除次数。当 `s[i] == 'a'` 的时候，有 2 种情况，一种是 `s[i]` 前面全是 `[aa……aa]` 的情况，这个时候只需要把其中的所有的字母 `b` 删除即可。还有一种情况是 `s[i]` 前面有字母 `a` 也有字母 `b`，即 `[aaa……abb……b]`，这种情况就需要考虑 `dp[i-1]` 了。当前字母是 `a`，那么肯定要删除字母 `a`，来维持前面有一段字母 `b` 的情况。当 `s[i] == 'b'` 的时候，不管是 `[aa……aa]` 这种情况，还是 `[aaa……abb……b]` 这种情况，当前字母 `b` 都可以直接附加在后面，也能保证整个字符串是平衡的。所以状态转移方程为 `dp[i+1] = min(dp[i] + 1, bCount), s[i] == 'a'`，`dp[i+1] = dp[i], s[i] == 'b'`。最终答案存在 `dp[n]` 中。由于前后项的递推关系中只用到一次前一项，所以我们还可以优化一下空间，用一个变量保存前一项的结果。优化以后的代码见解法一。
+- 这一题还有一个模拟的思路。题目要求找到最小删除字数，那么就是要找到一个“临界点”，在这个临界点的左边删除所有的字母 b，在这个临界点的右边删除所有的字母 a。在所有的“临界点”中找到删除最少的次数。代码实现见解法二。
+
+## 代码
+
+```go
+package leetcode
+
+// 解法一 DP
+func minimumDeletions(s string) int {
+ prev, res, bCount := 0, 0, 0
+ for _, c := range s {
+ if c == 'a' {
+ res = min(prev+1, bCount)
+ prev = res
+ } else {
+ bCount++
+ }
+ }
+ return res
+}
+
+func min(a, b int) int {
+ if a < b {
+ return a
+ }
+ return b
+}
+
+// 解法二 模拟
+func minimumDeletions1(s string) int {
+ aCount, bCount, res := 0, 0, 0
+ for i := 0; i < len(s); i++ {
+ if s[i] == 'a' {
+ aCount++
+ }
+ }
+ res = aCount
+ for i := 0; i < len(s); i++ {
+ if s[i] == 'a' {
+ aCount--
+ } else {
+ bCount++
+ }
+ res = min(res, aCount+bCount)
+ }
+ return res
+}
+```
\ No newline at end of file
diff --git a/leetcode/1654.Minimum-Jumps-to-Reach-Home/1654. Minimum Jumps to Reach Home.go b/leetcode/1654.Minimum-Jumps-to-Reach-Home/1654. Minimum Jumps to Reach Home.go
new file mode 100644
index 000000000..fcfda83b9
--- /dev/null
+++ b/leetcode/1654.Minimum-Jumps-to-Reach-Home/1654. Minimum Jumps to Reach Home.go
@@ -0,0 +1,29 @@
+package leetcode
+
+func minimumJumps(forbidden []int, a int, b int, x int) int {
+ visited := make([]bool, 6000)
+ for i := range forbidden {
+ visited[forbidden[i]] = true
+ }
+ queue, res := [][2]int{{0, 0}}, -1
+ for len(queue) > 0 {
+ length := len(queue)
+ res++
+ for i := 0; i < length; i++ {
+ cur, isBack := queue[i][0], queue[i][1]
+ if cur == x {
+ return res
+ }
+ if isBack == 0 && cur-b > 0 && !visited[cur-b] {
+ visited[cur-b] = true
+ queue = append(queue, [2]int{cur - b, 1})
+ }
+ if cur+a < len(visited) && !visited[cur+a] {
+ visited[cur+a] = true
+ queue = append(queue, [2]int{cur + a, 0})
+ }
+ }
+ queue = queue[length:]
+ }
+ return -1
+}
diff --git a/leetcode/1654.Minimum-Jumps-to-Reach-Home/1654. Minimum Jumps to Reach Home_test.go b/leetcode/1654.Minimum-Jumps-to-Reach-Home/1654. Minimum Jumps to Reach Home_test.go
new file mode 100644
index 000000000..b08d6b743
--- /dev/null
+++ b/leetcode/1654.Minimum-Jumps-to-Reach-Home/1654. Minimum Jumps to Reach Home_test.go
@@ -0,0 +1,60 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question1654 struct {
+ para1654
+ ans1654
+}
+
+// para 是参数
+// one 代表第一个参数
+type para1654 struct {
+ forbidden []int
+ a int
+ b int
+ x int
+}
+
+// ans 是答案
+// one 代表第一个答案
+type ans1654 struct {
+ one int
+}
+
+func Test_Problem1654(t *testing.T) {
+
+ qs := []question1654{
+
+ {
+ para1654{[]int{14, 4, 18, 1, 15}, 3, 15, 9},
+ ans1654{3},
+ },
+
+ {
+ para1654{[]int{8, 3, 16, 6, 12, 20}, 15, 13, 11},
+ ans1654{-1},
+ },
+
+ {
+ para1654{[]int{1, 6, 2, 14, 5, 17, 4}, 16, 9, 7},
+ ans1654{2},
+ },
+
+ {
+ para1654{[]int{1998}, 1999, 2000, 2000},
+ ans1654{3998},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 1654------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans1654, q.para1654
+ fmt.Printf("【input】:%v 【output】:%v \n", p, minimumJumps(p.forbidden, p.a, p.b, p.x))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/1654.Minimum-Jumps-to-Reach-Home/README.md b/leetcode/1654.Minimum-Jumps-to-Reach-Home/README.md
new file mode 100644
index 000000000..790c9cf34
--- /dev/null
+++ b/leetcode/1654.Minimum-Jumps-to-Reach-Home/README.md
@@ -0,0 +1,101 @@
+# [1654. Minimum Jumps to Reach Home](https://leetcode.com/problems/minimum-jumps-to-reach-home/)
+
+
+## 题目
+
+A certain bug's home is on the x-axis at position `x`. Help them get there from position `0`.
+
+The bug jumps according to the following rules:
+
+- It can jump exactly `a` positions **forward** (to the right).
+- It can jump exactly `b` positions **backward** (to the left).
+- It cannot jump backward twice in a row.
+- It cannot jump to any `forbidden` positions.
+
+The bug may jump forward **beyond** its home, but it **cannot jump** to positions numbered with **negative** integers.
+
+Given an array of integers `forbidden`, where `forbidden[i]` means that the bug cannot jump to the position `forbidden[i]`, and integers `a`, `b`, and `x`, return *the minimum number of jumps needed for the bug to reach its home*. If there is no possible sequence of jumps that lands the bug on position `x`, return `1.`
+
+**Example 1:**
+
+```
+Input: forbidden = [14,4,18,1,15], a = 3, b = 15, x = 9
+Output: 3
+Explanation: 3 jumps forward (0 -> 3 -> 6 -> 9) will get the bug home.
+```
+
+**Example 2:**
+
+```
+Input: forbidden = [8,3,16,6,12,20], a = 15, b = 13, x = 11
+Output: -1
+```
+
+**Example 3:**
+
+```
+Input: forbidden = [1,6,2,14,5,17,4], a = 16, b = 9, x = 7
+Output: 2
+Explanation: One jump forward (0 -> 16) then one jump backward (16 -> 7) will get the bug home.
+
+```
+
+**Constraints:**
+
+- `1 <= forbidden.length <= 1000`
+- `1 <= a, b, forbidden[i] <= 2000`
+- `0 <= x <= 2000`
+- All the elements in `forbidden` are distinct.
+- Position `x` is not forbidden.
+
+## 题目大意
+
+有一只跳蚤的家在数轴上的位置 x 处。请你帮助它从位置 0 出发，到达它的家。
+
+跳蚤跳跃的规则如下：
+
+- 它可以 往前 跳恰好 a 个位置（即往右跳）。
+- 它可以 往后 跳恰好 b 个位置（即往左跳）。
+- 它不能 连续 往后跳 2 次。
+- 它不能跳到任何 forbidden 数组中的位置。
+
+跳蚤可以往前跳 超过 它的家的位置，但是它 不能跳到负整数 的位置。给你一个整数数组 forbidden ，其中 forbidden[i] 是跳蚤不能跳到的位置，同时给你整数 a， b 和 x ，请你返回跳蚤到家的最少跳跃次数。如果没有恰好到达 x 的可行方案，请你返回 -1 。
+
+## 解题思路
+
+- 给出坐标 x ，可以往前跳的步长 a，往后跳的步长 b。要求输出能跳回家的最少跳跃次数。
+- 求最少跳跃次数，思路用 BFS 求解，最先到达坐标 x 的方案即是最少跳跃次数。对`forbidden` 的处理是把记忆化数组里面把他们标记为 true。禁止连续往后跳 2 次的限制，要求我们在 BFS 入队的时候再记录一下跳跃方向，每次往后跳的时候判断前一跳是否是往后跳，如果是往后跳，此次就不能往后跳了。
+
+## 代码
+
+```go
+package leetcode
+
+func minimumJumps(forbidden []int, a int, b int, x int) int {
+ visited := make([]bool, 6000)
+ for i := range forbidden {
+ visited[forbidden[i]] = true
+ }
+ queue, res := [][2]int{{0, 0}}, -1
+ for len(queue) > 0 {
+ length := len(queue)
+ res++
+ for i := 0; i < length; i++ {
+ cur, isBack := queue[i][0], queue[i][1]
+ if cur == x {
+ return res
+ }
+ if isBack == 0 && cur-b > 0 && !visited[cur-b] {
+ visited[cur-b] = true
+ queue = append(queue, [2]int{cur - b, 1})
+ }
+ if cur+a < len(visited) && !visited[cur+a] {
+ visited[cur+a] = true
+ queue = append(queue, [2]int{cur + a, 0})
+ }
+ }
+ queue = queue[length:]
+ }
+ return -1
+}
+```
\ No newline at end of file
diff --git a/leetcode/1655.Distribute-Repeating-Integers/1655. Distribute Repeating Integers.go b/leetcode/1655.Distribute-Repeating-Integers/1655. Distribute Repeating Integers.go
new file mode 100644
index 000000000..f0f57da21
--- /dev/null
+++ b/leetcode/1655.Distribute-Repeating-Integers/1655. Distribute Repeating Integers.go
@@ -0,0 +1,30 @@
+package leetcode
+
+func canDistribute(nums []int, quantity []int) bool {
+ freq := make(map[int]int)
+ for _, n := range nums {
+ freq[n]++
+ }
+ return dfs(freq, quantity)
+}
+
+func dfs(freq map[int]int, quantity []int) bool {
+ if len(quantity) == 0 {
+ return true
+ }
+ visited := make(map[int]bool)
+ for i := range freq {
+ if visited[freq[i]] {
+ continue
+ }
+ visited[freq[i]] = true
+ if freq[i] >= quantity[0] {
+ freq[i] -= quantity[0]
+ if dfs(freq, quantity[1:]) {
+ return true
+ }
+ freq[i] += quantity[0]
+ }
+ }
+ return false
+}
diff --git a/leetcode/1655.Distribute-Repeating-Integers/1655. Distribute Repeating Integers_test.go b/leetcode/1655.Distribute-Repeating-Integers/1655. Distribute Repeating Integers_test.go
new file mode 100644
index 000000000..d1c7bd260
--- /dev/null
+++ b/leetcode/1655.Distribute-Repeating-Integers/1655. Distribute Repeating Integers_test.go
@@ -0,0 +1,63 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question1655 struct {
+ para1655
+ ans1655
+}
+
+// para 是参数
+// one 代表第一个参数
+type para1655 struct {
+ nums []int
+ quantity []int
+}
+
+// ans 是答案
+// one 代表第一个答案
+type ans1655 struct {
+ one bool
+}
+
+func Test_Problem1655(t *testing.T) {
+
+ qs := []question1655{
+
+ {
+ para1655{[]int{1, 2, 3, 4}, []int{2}},
+ ans1655{false},
+ },
+
+ {
+ para1655{[]int{1, 2, 3, 3}, []int{2}},
+ ans1655{true},
+ },
+
+ {
+ para1655{[]int{1, 1, 2, 2}, []int{2, 2}},
+ ans1655{true},
+ },
+
+ {
+ para1655{[]int{1, 1, 2, 3}, []int{2, 2}},
+ ans1655{false},
+ },
+
+ {
+ para1655{[]int{1, 1, 1, 1, 1}, []int{2, 3}},
+ ans1655{true},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 1655------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans1655, q.para1655
+ fmt.Printf("【input】:%v 【output】:%v \n", p, canDistribute(p.nums, p.quantity))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/1655.Distribute-Repeating-Integers/README.md b/leetcode/1655.Distribute-Repeating-Integers/README.md
new file mode 100644
index 000000000..1c1faaedf
--- /dev/null
+++ b/leetcode/1655.Distribute-Repeating-Integers/README.md
@@ -0,0 +1,112 @@
+# [1655. Distribute Repeating Integers](https://leetcode.com/problems/distribute-repeating-integers/)
+
+
+## 题目
+
+You are given an array of `n` integers, `nums`, where there are at most `50` unique values in the array. You are also given an array of `m` customer order quantities, `quantity`, where `quantity[i]` is the amount of integers the `ith` customer ordered. Determine if it is possible to distribute `nums` such that:
+
+- The `ith` customer gets **exactly** `quantity[i]` integers,
+- The integers the `ith` customer gets are **all equal**, and
+- Every customer is satisfied.
+
+Return `true` *if it is possible to distribute* `nums` *according to the above conditions*.
+
+**Example 1:**
+
+```
+Input: nums = [1,2,3,4], quantity = [2]
+Output: false
+Explanation: The 0th customer cannot be given two different integers.
+```
+
+**Example 2:**
+
+```
+Input: nums = [1,2,3,3], quantity = [2]
+Output: true
+Explanation: The 0th customer is given [3,3]. The integers [1,2] are not used.
+```
+
+**Example 3:**
+
+```
+Input: nums = [1,1,2,2], quantity = [2,2]
+Output: true
+Explanation: The 0th customer is given [1,1], and the 1st customer is given [2,2].
+```
+
+**Example 4:**
+
+```
+Input: nums = [1,1,2,3], quantity = [2,2]
+Output: false
+Explanation: Although the 0th customer could be given [1,1], the 1st customer cannot be satisfied.
+```
+
+**Example 5:**
+
+```
+Input: nums = [1,1,1,1,1], quantity = [2,3]
+Output: true
+Explanation: The 0th customer is given [1,1], and the 1st customer is given [1,1,1].
+```
+
+**Constraints:**
+
+- `n == nums.length`
+- `1 <= n <= 105`
+- `1 <= nums[i] <= 1000`
+- `m == quantity.length`
+- `1 <= m <= 10`
+- `1 <= quantity[i] <= 105`
+- There are at most `50` unique values in `nums`.
+
+## 题目大意
+
+给你一个长度为 n 的整数数组 nums ，这个数组中至多有 50 个不同的值。同时你有 m 个顾客的订单 quantity ，其中，整数 quantity[i] 是第 i 位顾客订单的数目。请你判断是否能将 nums 中的整数分配给这些顾客，且满足：
+
+- 第 i 位顾客 恰好 有 quantity[i] 个整数。
+- 第 i 位顾客拿到的整数都是 相同的 。
+- 每位顾客都满足上述两个要求。
+
+如果你可以分配 nums 中的整数满足上面的要求，那么请返回 true ，否则返回 false 。
+
+## 解题思路
+
+- 给定一个数组 nums，订单数组 quantity，要求按照订单满足顾客的需求。如果能满足输出 true，不能满足输出 false。
+- 用 DFS 记忆化暴力搜索。代码实现不难。（不知道此题为什么是 Hard）
+
+## 代码
+
+```go
+package leetcode
+
+func canDistribute(nums []int, quantity []int) bool {
+ freq := make(map[int]int)
+ for _, n := range nums {
+ freq[n]++
+ }
+ return dfs(freq, quantity)
+}
+
+func dfs(freq map[int]int, quantity []int) bool {
+ if len(quantity) == 0 {
+ return true
+ }
+ visited := make(map[int]bool)
+ for i := range freq {
+ if visited[freq[i]] {
+ continue
+ }
+ visited[freq[i]] = true
+ if freq[i] >= quantity[0] {
+ freq[i] -= quantity[0]
+ if dfs(freq, quantity[1:]) {
+ return true
+ }
+ freq[i] += quantity[0]
+ }
+ }
+ return false
+}
+```
\ No newline at end of file
diff --git a/leetcode/1656.Design-an-Ordered-Stream/1656. Design an Ordered Stream.go b/leetcode/1656.Design-an-Ordered-Stream/1656. Design an Ordered Stream.go
new file mode 100644
index 000000000..bb6035d99
--- /dev/null
+++ b/leetcode/1656.Design-an-Ordered-Stream/1656. Design an Ordered Stream.go
@@ -0,0 +1,37 @@
+package leetcode
+
+type OrderedStream struct {
+ ptr int
+ stream []string
+}
+
+func Constructor(n int) OrderedStream {
+ ptr, stream := 1, make([]string, n+1)
+ return OrderedStream{ptr: ptr, stream: stream}
+}
+
+func (this *OrderedStream) Insert(id int, value string) []string {
+ this.stream[id] = value
+ res := []string{}
+ if this.ptr == id || this.stream[this.ptr] != "" {
+ res = append(res, this.stream[this.ptr])
+ for i := id + 1; i < len(this.stream); i++ {
+ if this.stream[i] != "" {
+ res = append(res, this.stream[i])
+ } else {
+ this.ptr = i
+ return res
+ }
+ }
+ }
+ if len(res) > 0 {
+ return res
+ }
+ return []string{}
+}
+
+/**
+ * Your OrderedStream object will be instantiated and called as such:
+ * obj := Constructor(n);
+ * param_1 := obj.Insert(id,value);
+ */
diff --git a/leetcode/1656.Design-an-Ordered-Stream/1656. Design an Ordered Stream_test.go b/leetcode/1656.Design-an-Ordered-Stream/1656. Design an Ordered Stream_test.go
new file mode 100644
index 000000000..870fc070f
--- /dev/null
+++ b/leetcode/1656.Design-an-Ordered-Stream/1656. Design an Ordered Stream_test.go
@@ -0,0 +1,21 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+func Test_Problem1656(t *testing.T) {
+ obj := Constructor(5)
+ fmt.Printf("obj = %v\n", obj)
+ param1 := obj.Insert(3, "ccccc")
+ fmt.Printf("param_1 = %v obj = %v\n", param1, obj)
+ param1 = obj.Insert(1, "aaaaa")
+ fmt.Printf("param_1 = %v obj = %v\n", param1, obj)
+ param1 = obj.Insert(2, "bbbbb")
+ fmt.Printf("param_1 = %v obj = %v\n", param1, obj)
+ param1 = obj.Insert(5, "eeeee")
+ fmt.Printf("param_1 = %v obj = %v\n", param1, obj)
+ param1 = obj.Insert(4, "ddddd")
+ fmt.Printf("param_1 = %v obj = %v\n", param1, obj)
+}
diff --git a/leetcode/1656.Design-an-Ordered-Stream/README.md b/leetcode/1656.Design-an-Ordered-Stream/README.md
new file mode 100644
index 000000000..96d52e601
--- /dev/null
+++ b/leetcode/1656.Design-an-Ordered-Stream/README.md
@@ -0,0 +1,106 @@
+# [1656. Design an Ordered Stream](https://leetcode.com/problems/design-an-ordered-stream/)
+
+## 题目
+
+There is a stream of `n` `(id, value)` pairs arriving in an **arbitrary** order, where `id` is an integer between `1` and `n` and `value` is a string. No two pairs have the same `id`.
+
+Design a stream that returns the values in **increasing order of their IDs** by returning a **chunk** (list) of values after each insertion. The concatenation of all the **chunks** should result in a list of the sorted values.
+
+Implement the `OrderedStream` class:
+
+- `OrderedStream(int n)` Constructs the stream to take `n` values.
+- `String[] insert(int id, String value)` Inserts the pair `(id, value)` into the stream, then returns the **largest possible chunk** of currently inserted values that appear next in the order.
+
+**Example:**
+
+
+
+```
+Input
+["OrderedStream", "insert", "insert", "insert", "insert", "insert"]
+[[5], [3, "ccccc"], [1, "aaaaa"], [2, "bbbbb"], [5, "eeeee"], [4, "ddddd"]]
+Output
+[null, [], ["aaaaa"], ["bbbbb", "ccccc"], [], ["ddddd", "eeeee"]]
+
+Explanation
+// Note that the values ordered by ID is ["aaaaa", "bbbbb", "ccccc", "ddddd", "eeeee"].
+OrderedStream os = new OrderedStream(5);
+os.insert(3, "ccccc"); // Inserts (3, "ccccc"), returns [].
+os.insert(1, "aaaaa"); // Inserts (1, "aaaaa"), returns ["aaaaa"].
+os.insert(2, "bbbbb"); // Inserts (2, "bbbbb"), returns ["bbbbb", "ccccc"].
+os.insert(5, "eeeee"); // Inserts (5, "eeeee"), returns [].
+os.insert(4, "ddddd"); // Inserts (4, "ddddd"), returns ["ddddd", "eeeee"].
+// Concatentating all the chunks returned:
+// [] + ["aaaaa"] + ["bbbbb", "ccccc"] + [] + ["ddddd", "eeeee"] = ["aaaaa", "bbbbb", "ccccc", "ddddd", "eeeee"]
+// The resulting order is the same as the order above.
+
+```
+
+**Constraints:**
+
+- `1 <= n <= 1000`
+- `1 <= id <= n`
+- `value.length == 5`
+- `value` consists only of lowercase letters.
+- Each call to `insert` will have a unique `id.`
+- Exactly `n` calls will be made to `insert`.
+
+## 题目大意
+
+有 n 个 (id, value) 对，其中 id 是 1 到 n 之间的一个整数，value 是一个字符串。不存在 id 相同的两个 (id, value) 对。
+
+设计一个流，以 任意 顺序获取 n 个 (id, value) 对，并在多次调用时 按 id 递增的顺序 返回一些值。
+
+实现 OrderedStream 类：
+
+- OrderedStream(int n) 构造一个能接收 n 个值的流，并将当前指针 ptr 设为 1 。
+- String[] insert(int id, String value) 向流中存储新的 (id, value) 对。存储后：
+如果流存储有 id = ptr 的 (id, value) 对，则找出从 id = ptr 开始的 最长 id 连续递增序列 ，并 按顺序 返回与这些 id 关联的值的列表。然后，将 ptr 更新为最后那个 id + 1 。
+否则，返回一个空列表。
+
+## 解题思路
+
+- 设计一个具有插入操作的 Ordered Stream。insert 操作先在指定位置插入 value，然后返回当前指针 ptr 到最近一个空位置的最长连续递增字符串。如果字符串不为空，ptr 移动到非空 value 的后一个下标位置处。
+- 简单题。按照题目描述模拟即可。注意控制好 ptr 的位置。
+
+## 代码
+
+```go
+package leetcode
+
+type OrderedStream struct {
+ ptr int
+ stream []string
+}
+
+func Constructor(n int) OrderedStream {
+ ptr, stream := 1, make([]string, n+1)
+ return OrderedStream{ptr: ptr, stream: stream}
+}
+
+func (this *OrderedStream) Insert(id int, value string) []string {
+ this.stream[id] = value
+ res := []string{}
+ if this.ptr == id || this.stream[this.ptr] != "" {
+ res = append(res, this.stream[this.ptr])
+ for i := id + 1; i < len(this.stream); i++ {
+ if this.stream[i] != "" {
+ res = append(res, this.stream[i])
+ } else {
+ this.ptr = i
+ return res
+ }
+ }
+ }
+ if len(res) > 0 {
+ return res
+ }
+ return []string{}
+}
+
+/**
+ * Your OrderedStream object will be instantiated and called as such:
+ * obj := Constructor(n);
+ * param_1 := obj.Insert(id,value);
+ */
+```
\ No newline at end of file
diff --git a/leetcode/1657.Determine-if-Two-Strings-Are-Close/1657. Determine if Two Strings Are Close.go b/leetcode/1657.Determine-if-Two-Strings-Are-Close/1657. Determine if Two Strings Are Close.go
new file mode 100644
index 000000000..9fa3d9479
--- /dev/null
+++ b/leetcode/1657.Determine-if-Two-Strings-Are-Close/1657. Determine if Two Strings Are Close.go
@@ -0,0 +1,33 @@
+package leetcode
+
+import (
+ "sort"
+)
+
+func closeStrings(word1 string, word2 string) bool {
+ if len(word1) != len(word2) {
+ return false
+ }
+ freqCount1, freqCount2 := make([]int, 26), make([]int, 26)
+ for _, c := range word1 {
+ freqCount1[c-97]++
+ }
+ for _, c := range word2 {
+ freqCount2[c-97]++
+ }
+ for i := 0; i < 26; i++ {
+ if (freqCount1[i] == freqCount2[i]) ||
+ (freqCount1[i] > 0 && freqCount2[i] > 0) {
+ continue
+ }
+ return false
+ }
+ sort.Ints(freqCount1)
+ sort.Ints(freqCount2)
+ for i := 0; i < 26; i++ {
+ if freqCount1[i] != freqCount2[i] {
+ return false
+ }
+ }
+ return true
+}
diff --git a/leetcode/1657.Determine-if-Two-Strings-Are-Close/1657. Determine if Two Strings Are Close_test.go b/leetcode/1657.Determine-if-Two-Strings-Are-Close/1657. Determine if Two Strings Are Close_test.go
new file mode 100644
index 000000000..cfc982540
--- /dev/null
+++ b/leetcode/1657.Determine-if-Two-Strings-Are-Close/1657. Determine if Two Strings Are Close_test.go
@@ -0,0 +1,68 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question1657 struct {
+ para1657
+ ans1657
+}
+
+// para 是参数
+// one 代表第一个参数
+type para1657 struct {
+ word1 string
+ word2 string
+}
+
+// ans 是答案
+// one 代表第一个答案
+type ans1657 struct {
+ one bool
+}
+
+func Test_Problem1657(t *testing.T) {
+
+ qs := []question1657{
+
+ {
+ para1657{"abc", "bca"},
+ ans1657{true},
+ },
+
+ {
+ para1657{"a", "aa"},
+ ans1657{false},
+ },
+
+ {
+ para1657{"cabbba", "abbccc"},
+ ans1657{true},
+ },
+
+ {
+ para1657{"cabbba", "aabbss"},
+ ans1657{false},
+ },
+
+ {
+ para1657{"uau", "ssx"},
+ ans1657{false},
+ },
+
+ {
+ para1657{"uuukuuuukkuusuususuuuukuskuusuuusuusuuuuuuk", "kssskkskkskssskksskskksssssksskksskskksksuu"},
+ ans1657{false},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 1657------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans1657, q.para1657
+ fmt.Printf("【input】:%v 【output】:%v \n", p, closeStrings(p.word1, p.word2))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/1657.Determine-if-Two-Strings-Are-Close/README.md b/leetcode/1657.Determine-if-Two-Strings-Are-Close/README.md
new file mode 100644
index 000000000..711c758fb
--- /dev/null
+++ b/leetcode/1657.Determine-if-Two-Strings-Are-Close/README.md
@@ -0,0 +1,114 @@
+# [1657. Determine if Two Strings Are Close](https://leetcode.com/problems/determine-if-two-strings-are-close/)
+
+
+## 题目
+
+Two strings are considered **close** if you can attain one from the other using the following operations:
+
+- Operation 1: Swap any two **existing** characters.
+ - For example, `abcde -> aecdb`
+- Operation 2: Transform **every** occurrence of one **existing** character into another **existing** character, and do the same with the other character.
+ - For example, `aacabb -> bbcbaa` (all `a`'s turn into `b`'s, and all `b`'s turn into `a`'s)
+
+You can use the operations on either string as many times as necessary.
+
+Given two strings, `word1` and `word2`, return `true` *if* `word1` *and* `word2` *are **close**, and* `false` *otherwise.*
+
+**Example 1:**
+
+```
+Input: word1 = "abc", word2 = "bca"
+Output: true
+Explanation: You can attain word2 from word1 in 2 operations.
+Apply Operation 1: "abc" -> "acb"
+Apply Operation 1: "acb" -> "bca"
+
+```
+
+**Example 2:**
+
+```
+Input: word1 = "a", word2 = "aa"
+Output: false
+Explanation: It is impossible to attain word2 from word1, or vice versa, in any number of operations.
+
+```
+
+**Example 3:**
+
+```
+Input: word1 = "cabbba", word2 = "abbccc"
+Output: true
+Explanation: You can attain word2 from word1 in 3 operations.
+Apply Operation 1: "cabbba" -> "caabbb"
+Apply Operation 2: "caabbb" -> "baaccc"
+Apply Operation 2: "baaccc" -> "abbccc"
+
+```
+
+**Example 4:**
+
+```
+Input: word1 = "cabbba", word2 = "aabbss"
+Output: false
+Explanation: It is impossible to attain word2 from word1, or vice versa, in any amount of operations.
+
+```
+
+**Constraints:**
+
+- `1 <= word1.length, word2.length <= 105`
+- `word1` and `word2` contain only lowercase English letters.
+
+## 题目大意
+
+如果可以使用以下操作从一个字符串得到另一个字符串，则认为两个字符串 接近 ：
+
+- 操作 1：交换任意两个 现有 字符。例如，abcde -> aecdb
+- 操作 2：将一个 现有 字符的每次出现转换为另一个 现有 字符，并对另一个字符执行相同的操作。例如，aacabb -> bbcbaa（所有 a 转化为 b ，而所有的 b 转换为 a ）
+
+你可以根据需要对任意一个字符串多次使用这两种操作。给你两个字符串，word1 和 word2 。如果 word1 和 word2 接近 ，就返回 true ；否则，返回 false 。
+
+## 解题思路
+
+- 判断 2 个字符串是否“接近”。“接近”的定义是能否通过交换 2 个字符或者 2 个字母互换，从一个字符串变换成另外一个字符串，如果存在这样的变换，即是“接近”。
+- 先统计 2 个字符串的 26 个字母的频次，如果频次有不相同的，直接返回 false。在频次相同的情况下，再从小到大排序，再次扫描判断频次是否相同。
+- 注意几种特殊情况：频次相同，再判断字母交换是否合法存在，如果字母不存在，输出 false。例如测试文件中的 case 5 。出现频次个数相同，但是频次不同。例如测试文件中的 case 6 。
+
+## 代码
+
+```go
+package leetcode
+
+import (
+ "sort"
+)
+
+func closeStrings(word1 string, word2 string) bool {
+ if len(word1) != len(word2) {
+ return false
+ }
+ freqCount1, freqCount2 := make([]int, 26), make([]int, 26)
+ for _, c := range word1 {
+ freqCount1[c-97]++
+ }
+ for _, c := range word2 {
+ freqCount2[c-97]++
+ }
+ for i := 0; i < 26; i++ {
+ if (freqCount1[i] == freqCount2[i]) ||
+ (freqCount1[i] > 0 && freqCount2[i] > 0) {
+ continue
+ }
+ return false
+ }
+ sort.Ints(freqCount1)
+ sort.Ints(freqCount2)
+ for i := 0; i < 26; i++ {
+ if freqCount1[i] != freqCount2[i] {
+ return false
+ }
+ }
+ return true
+}
+```
\ No newline at end of file
diff --git a/leetcode/1658.Minimum-Operations-to-Reduce-X-to-Zero/1658. Minimum Operations to Reduce X to Zero.go b/leetcode/1658.Minimum-Operations-to-Reduce-X-to-Zero/1658. Minimum Operations to Reduce X to Zero.go
new file mode 100644
index 000000000..a0db0774d
--- /dev/null
+++ b/leetcode/1658.Minimum-Operations-to-Reduce-X-to-Zero/1658. Minimum Operations to Reduce X to Zero.go
@@ -0,0 +1,40 @@
+package leetcode
+
+func minOperations(nums []int, x int) int {
+ total := 0
+ for _, n := range nums {
+ total += n
+ }
+ target := total - x
+ if target < 0 {
+ return -1
+ }
+ if target == 0 {
+ return len(nums)
+ }
+ left, right, sum, res := 0, 0, 0, -1
+ for right < len(nums) {
+ if sum < target {
+ sum += nums[right]
+ right++
+ }
+ for sum >= target {
+ if sum == target {
+ res = max(res, right-left)
+ }
+ sum -= nums[left]
+ left++
+ }
+ }
+ if res == -1 {
+ return -1
+ }
+ return len(nums) - res
+}
+
+func max(a, b int) int {
+ if a > b {
+ return a
+ }
+ return b
+}
diff --git a/leetcode/1658.Minimum-Operations-to-Reduce-X-to-Zero/1658. Minimum Operations to Reduce X to Zero_test.go b/leetcode/1658.Minimum-Operations-to-Reduce-X-to-Zero/1658. Minimum Operations to Reduce X to Zero_test.go
new file mode 100644
index 000000000..f781c28a8
--- /dev/null
+++ b/leetcode/1658.Minimum-Operations-to-Reduce-X-to-Zero/1658. Minimum Operations to Reduce X to Zero_test.go
@@ -0,0 +1,53 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question1658 struct {
+ para1658
+ ans1658
+}
+
+// para 是参数
+// one 代表第一个参数
+type para1658 struct {
+ nums []int
+ x int
+}
+
+// ans 是答案
+// one 代表第一个答案
+type ans1658 struct {
+ one int
+}
+
+func Test_Problem1658(t *testing.T) {
+
+ qs := []question1658{
+
+ {
+ para1658{[]int{1, 1, 4, 2, 3}, 5},
+ ans1658{2},
+ },
+
+ {
+ para1658{[]int{5, 6, 7, 8, 9}, 4},
+ ans1658{-1},
+ },
+
+ {
+ para1658{[]int{3, 2, 20, 1, 1, 3}, 10},
+ ans1658{5},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 1658------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans1658, q.para1658
+ fmt.Printf("【input】:%v 【output】:%v \n", p, minOperations(p.nums, p.x))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/1658.Minimum-Operations-to-Reduce-X-to-Zero/README.md b/leetcode/1658.Minimum-Operations-to-Reduce-X-to-Zero/README.md
new file mode 100644
index 000000000..3fb34d44a
--- /dev/null
+++ b/leetcode/1658.Minimum-Operations-to-Reduce-X-to-Zero/README.md
@@ -0,0 +1,96 @@
+# [1658. Minimum Operations to Reduce X to Zero](https://leetcode.com/problems/minimum-operations-to-reduce-x-to-zero/)
+
+
+## 题目
+
+You are given an integer array `nums` and an integer `x`. In one operation, you can either remove the leftmost or the rightmost element from the array `nums` and subtract its value from `x`. Note that this **modifies** the array for future operations.
+
+Return *the **minimum number** of operations to reduce* `x` *to **exactly*** `0` *if it's possible, otherwise, return* `1`.
+
+**Example 1:**
+
+```
+Input: nums = [1,1,4,2,3], x = 5
+Output: 2
+Explanation: The optimal solution is to remove the last two elements to reduce x to zero.
+
+```
+
+**Example 2:**
+
+```
+Input: nums = [5,6,7,8,9], x = 4
+Output: -1
+
+```
+
+**Example 3:**
+
+```
+Input: nums = [3,2,20,1,1,3], x = 10
+Output: 5
+Explanation: The optimal solution is to remove the last three elements and the first two elements (5 operations in total) to reduce x to zero.
+
+```
+
+**Constraints:**
+
+- `1 <= nums.length <= 105`
+- `1 <= nums[i] <= 104`
+- `1 <= x <= 109`
+
+## 题目大意
+
+给你一个整数数组 nums 和一个整数 x 。每一次操作时，你应当移除数组 nums 最左边或最右边的元素，然后从 x 中减去该元素的值。请注意，需要 修改 数组以供接下来的操作使用。如果可以将 x 恰好 减到 0 ，返回 最小操作数 ；否则，返回 -1 。
+
+## 解题思路
+
+- 给定一个数组 nums 和一个整数 x，要求从数组两端分别移除一些数，使得这些数加起来正好等于整数 x，要求输出最小操作数。
+- 要求输出最小操作数，即数组两头的数字个数最少，并且加起来和正好等于整数 x。由于在数组的两头，用 2 个指针分别操作不太方便。我当时解题的时候的思路是把它变成循环数组，这样两边的指针就在一个区间内了。利用滑动窗口找到一个最小的窗口，使得窗口内的累加和等于整数 k。这个方法可行，但是代码挺多的。
+- 有没有更优美的方法呢？有的。要想两头的长度最少，也就是中间这段的长度最大。这样就转换成直接在数组上使用滑动窗口求解，累加和等于一个固定值的连续最长的子数组。
+- 和这道题类似思路的题目，209，1040(循环数组)，325。强烈推荐这 3 题。
+
+## 代码
+
+```go
+package leetcode
+
+func minOperations(nums []int, x int) int {
+ total := 0
+ for _, n := range nums {
+ total += n
+ }
+ target := total - x
+ if target < 0 {
+ return -1
+ }
+ if target == 0 {
+ return len(nums)
+ }
+ left, right, sum, res := 0, 0, 0, -1
+ for right < len(nums) {
+ if sum < target {
+ sum += nums[right]
+ right++
+ }
+ for sum >= target {
+ if sum == target {
+ res = max(res, right-left)
+ }
+ sum -= nums[left]
+ left++
+ }
+ }
+ if res == -1 {
+ return -1
+ }
+ return len(nums) - res
+}
+
+func max(a, b int) int {
+ if a > b {
+ return a
+ }
+ return b
+}
+```
\ No newline at end of file
diff --git a/leetcode/1659.Maximize-Grid-Happiness/1659. Maximize Grid Happiness.go b/leetcode/1659.Maximize-Grid-Happiness/1659. Maximize Grid Happiness.go
new file mode 100644
index 000000000..c0b506021
--- /dev/null
+++ b/leetcode/1659.Maximize-Grid-Happiness/1659. Maximize Grid Happiness.go
@@ -0,0 +1,107 @@
+package leetcode
+
+import (
+ "math"
+)
+
+func getMaxGridHappiness(m int, n int, introvertsCount int, extrovertsCount int) int {
+ // lineStatus 将每一行中 3 种状态进行编码，空白 - 0，内向人 - 1，外向人 - 2，每行状态用三进制表示
+ // lineStatusList[729][6] 每一行的三进制表示
+ // introvertsCountInner[729] 每一个 lineStatus 包含的内向人数
+ // extrovertsCountInner[729] 每一个 lineStatus 包含的外向人数
+ // scoreInner[729] 每一个 lineStatus 包含的行内得分（只统计 lineStatus 本身的得分，不包括它与上一行的）
+ // scoreOuter[729][729] 每一个 lineStatus 包含的行外得分
+ // dp[上一行的 lineStatus][当前处理到的行][剩余的内向人数][剩余的外向人数]
+ n3, lineStatus, introvertsCountInner, extrovertsCountInner, scoreInner, scoreOuter, lineStatusList, dp := math.Pow(3.0, float64(n)), 0, [729]int{}, [729]int{}, [729]int{}, [729][729]int{}, [729][6]int{}, [729][6][7][7]int{}
+ for i := 0; i < 729; i++ {
+ lineStatusList[i] = [6]int{}
+ }
+ for i := 0; i < 729; i++ {
+ dp[i] = [6][7][7]int{}
+ for j := 0; j < 6; j++ {
+ dp[i][j] = [7][7]int{}
+ for k := 0; k < 7; k++ {
+ dp[i][j][k] = [7]int{-1, -1, -1, -1, -1, -1, -1}
+ }
+ }
+ }
+ // 预处理
+ for lineStatus = 0; lineStatus < int(n3); lineStatus++ {
+ tmp := lineStatus
+ for i := 0; i < n; i++ {
+ lineStatusList[lineStatus][i] = tmp % 3
+ tmp /= 3
+ }
+ introvertsCountInner[lineStatus], extrovertsCountInner[lineStatus], scoreInner[lineStatus] = 0, 0, 0
+ for i := 0; i < n; i++ {
+ if lineStatusList[lineStatus][i] != 0 {
+ // 个人分数
+ if lineStatusList[lineStatus][i] == 1 {
+ introvertsCountInner[lineStatus]++
+ scoreInner[lineStatus] += 120
+ } else if lineStatusList[lineStatus][i] == 2 {
+ extrovertsCountInner[lineStatus]++
+ scoreInner[lineStatus] += 40
+ }
+ // 行内分数
+ if i-1 >= 0 {
+ scoreInner[lineStatus] += closeScore(lineStatusList[lineStatus][i], lineStatusList[lineStatus][i-1])
+ }
+ }
+ }
+ }
+ // 行外分数
+ for lineStatus0 := 0; lineStatus0 < int(n3); lineStatus0++ {
+ for lineStatus1 := 0; lineStatus1 < int(n3); lineStatus1++ {
+ scoreOuter[lineStatus0][lineStatus1] = 0
+ for i := 0; i < n; i++ {
+ scoreOuter[lineStatus0][lineStatus1] += closeScore(lineStatusList[lineStatus0][i], lineStatusList[lineStatus1][i])
+ }
+ }
+ }
+ return dfs(0, 0, introvertsCount, extrovertsCount, m, int(n3), &dp, &introvertsCountInner, &extrovertsCountInner, &scoreInner, &scoreOuter)
+}
+
+// 如果 x 和 y 相邻，需要加上的分数
+func closeScore(x, y int) int {
+ if x == 0 || y == 0 {
+ return 0
+ }
+ // 两个内向的人，每个人要 -30，一共 -60
+ if x == 1 && y == 1 {
+ return -60
+ }
+ if x == 2 && y == 2 {
+ return 40
+ }
+ return -10
+}
+
+// dfs(上一行的 lineStatus，当前处理到的行，剩余的内向人数，剩余的外向人数）
+func dfs(lineStatusLast, row, introvertsCount, extrovertsCount, m, n3 int, dp *[729][6][7][7]int, introvertsCountInner, extrovertsCountInner, scoreInner *[729]int, scoreOuter *[729][729]int) int {
+ // 边界条件：如果已经处理完，或者没有人了
+ if row == m || introvertsCount+extrovertsCount == 0 {
+ return 0
+ }
+ // 记忆化
+ if dp[lineStatusLast][row][introvertsCount][extrovertsCount] != -1 {
+ return dp[lineStatusLast][row][introvertsCount][extrovertsCount]
+ }
+ best := 0
+ for lineStatus := 0; lineStatus < n3; lineStatus++ {
+ if introvertsCountInner[lineStatus] > introvertsCount || extrovertsCountInner[lineStatus] > extrovertsCount {
+ continue
+ }
+ score := scoreInner[lineStatus] + scoreOuter[lineStatus][lineStatusLast]
+ best = max(best, score+dfs(lineStatus, row+1, introvertsCount-introvertsCountInner[lineStatus], extrovertsCount-extrovertsCountInner[lineStatus], m, n3, dp, introvertsCountInner, extrovertsCountInner, scoreInner, scoreOuter))
+ }
+ dp[lineStatusLast][row][introvertsCount][extrovertsCount] = best
+ return best
+}
+
+func max(a int, b int) int {
+ if a > b {
+ return a
+ }
+ return b
+}
diff --git a/leetcode/1659.Maximize-Grid-Happiness/1659. Maximize Grid Happiness_test.go b/leetcode/1659.Maximize-Grid-Happiness/1659. Maximize Grid Happiness_test.go
new file mode 100644
index 000000000..909e36b04
--- /dev/null
+++ b/leetcode/1659.Maximize-Grid-Happiness/1659. Maximize Grid Happiness_test.go
@@ -0,0 +1,55 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question1659 struct {
+ para1659
+ ans1659
+}
+
+// para 是参数
+// one 代表第一个参数
+type para1659 struct {
+ m int
+ n int
+ introvertsCount int
+ extrovertsCount int
+}
+
+// ans 是答案
+// one 代表第一个答案
+type ans1659 struct {
+ one int
+}
+
+func Test_Problem1659(t *testing.T) {
+
+ qs := []question1659{
+
+ {
+ para1659{2, 3, 1, 2},
+ ans1659{240},
+ },
+
+ {
+ para1659{3, 1, 2, 1},
+ ans1659{260},
+ },
+
+ {
+ para1659{2, 2, 4, 0},
+ ans1659{240},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 1659------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans1659, q.para1659
+ fmt.Printf("【input】:%v 【output】:%v \n", p, getMaxGridHappiness(p.m, p.n, p.introvertsCount, p.extrovertsCount))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/1659.Maximize-Grid-Happiness/README.md b/leetcode/1659.Maximize-Grid-Happiness/README.md
new file mode 100644
index 000000000..6f880d261
--- /dev/null
+++ b/leetcode/1659.Maximize-Grid-Happiness/README.md
@@ -0,0 +1,185 @@
+# [1659. Maximize Grid Happiness](https://leetcode.com/problems/maximize-grid-happiness/)
+
+## 题目
+
+You are given four integers, `m`, `n`, `introvertsCount`, and `extrovertsCount`. You have an `m x n` grid, and there are two types of people: introverts and extroverts. There are `introvertsCount` introverts and `extrovertsCount` extroverts.
+
+You should decide how many people you want to live in the grid and assign each of them one grid cell. Note that you **do not** have to have all the people living in the grid.
+
+The **happiness** of each person is calculated as follows:
+
+- Introverts **start** with `120` happiness and **lose** `30` happiness for each neighbor (introvert or extrovert).
+- Extroverts **start** with `40` happiness and **gain** `20` happiness for each neighbor (introvert or extrovert).
+
+Neighbors live in the directly adjacent cells north, east, south, and west of a person's cell.
+
+The **grid happiness** is the **sum** of each person's happiness. Return *the **maximum possible grid happiness**.*
+
+**Example 1:**
+
+
+
+```
+Input: m = 2, n = 3, introvertsCount = 1, extrovertsCount = 2
+Output: 240
+Explanation: Assume the grid is 1-indexed with coordinates (row, column).
+We can put the introvert in cell (1,1) and put the extroverts in cells (1,3) and (2,3).
+- Introvert at (1,1) happiness: 120 (starting happiness) - (0 * 30) (0 neighbors) = 120
+- Extrovert at (1,3) happiness: 40 (starting happiness) + (1 * 20) (1 neighbor) = 60
+- Extrovert at (2,3) happiness: 40 (starting happiness) + (1 * 20) (1 neighbor) = 60
+The grid happiness is 120 + 60 + 60 = 240.
+The above figure shows the grid in this example with each person's happiness. The introvert stays in the light green cell while the extroverts live on the light purple cells.
+```
+
+**Example 2:**
+
+```
+Input: m = 3, n = 1, introvertsCount = 2, extrovertsCount = 1
+Output: 260
+Explanation: Place the two introverts in (1,1) and (3,1) and the extrovert at (2,1).
+- Introvert at (1,1) happiness: 120 (starting happiness) - (1 * 30) (1 neighbor) = 90
+- Extrovert at (2,1) happiness: 40 (starting happiness) + (2 * 20) (2 neighbors) = 80
+- Introvert at (3,1) happiness: 120 (starting happiness) - (1 * 30) (1 neighbor) = 90
+The grid happiness is 90 + 80 + 90 = 260.
+```
+
+**Example 3:**
+
+```
+Input: m = 2, n = 2, introvertsCount = 4, extrovertsCount = 0
+Output: 240
+```
+
+**Constraints:**
+
+- `1 <= m, n <= 5`
+- `0 <= introvertsCount, extrovertsCount <= min(m * n, 6)`
+
+## 题目大意
+
+给你四个整数 m、n、introvertsCount 和 extrovertsCount 。有一个 m x n 网格，和两种类型的人：内向的人和外向的人。总共有 introvertsCount 个内向的人和 extrovertsCount 个外向的人。请你决定网格中应当居住多少人，并为每个人分配一个网格单元。 注意，不必 让所有人都生活在网格中。每个人的 幸福感 计算如下：
+
+- 内向的人 开始 时有 120 个幸福感，但每存在一个邻居（内向的或外向的）他都会 失去 30 个幸福感。
+- 外向的人 开始 时有 40 个幸福感，每存在一个邻居（内向的或外向的）他都会 得到 20 个幸福感。
+
+邻居是指居住在一个人所在单元的上、下、左、右四个直接相邻的单元中的其他人。网格幸福感 是每个人幸福感的 总和 。 返回 最大可能的网格幸福感 。
+
+## 解题思路
+
+- 给出 `m` x `n` 网格和两种人，要求如何安排这两种人能使得网格的得分最大。两种人有各自的初始分，相邻可能会加分也有可能减分。
+- 这一题状态很多。首先每个格子有 3 种状态，那么每一行有 3^6 = 729 种不同的状态。每行行内分数变化值可能是 -60(两个内向)，+40(两个外向)，-10(一个内向一个外向)。两行行间分数变化值可能是 -60(两个内向)，+40(两个外向)，-10(一个内向一个外向)。那么我们可以把每行的状态压缩成一个三进制，那么网格就变成了一维，每两个三进制之间的关系是行间关系，每个三进制内部还需要根据内向和外向的人数决定行内最终分数。定义 `dp[lineStatusLast][row][introvertsCount][extrovertsCount]` 代表在上一行 `row - 1` 的状态是 `lineStatusLast` 的情况下，当前枚举到了第 `row` 行，内向还有 `introvertsCount` 个人，外向还有 `extrovertsCount` 个人能获得的最大分数。状态转移方程是 `dp[lineStatusLast(row-1)][row][introvertsCount][extrovertsCount] = max{dp[lineStatusLast(row)][row+1][introvertsCount - countIC(lineStatusLast(row)) ][extrovertsCount - countEC(lineStatusLast(row)) ] + scoreInner(lineStatusLast(row)) + scoreOuter(lineStatusLast(row-1),lineStatusLast(row))}` ，这里有 2 个统计函数，`countIC` 是统计当前行状态三进制里面有多少个内向人。`countEC` 是统计当前行状态三进制里面有多少个外向人。`scoreInner` 是计算当前行状态三进制的行内分数。`scoreOuter` 是计算 `row -1` 行和 `row` 行之间的行间分数。
+- 由于这个状态转移方程的计算量是巨大的。所以需要预先初始化一些计算结果。比如把 729 中行状态分别对应的行内、行间的分数都计算好，在动态规划状态转移的时候，直接查表获取分数即可。这样我们在深搜的时候，利用 dp 的记忆化，可以大幅减少时间复杂度。
+- 题目中还提到，人数可以不用完。如果 `introvertsCount = 0`, `extrovertsCount = 0` ，即人数都用完了的情况，这时候 `dp = 0`。如果 `row = m`，即已经枚举完了所有行，那么不管剩下多少人，这一行的 `dp = 0` 。
+- 初始化的时候，注意，特殊处理 0 的情况，0 行 0 列都初始化为 -1 。
+
+## 代码
+
+```go
+package leetcode
+
+import (
+ "math"
+)
+
+func getMaxGridHappiness(m int, n int, introvertsCount int, extrovertsCount int) int {
+ // lineStatus 将每一行中 3 种状态进行编码，空白 - 0，内向人 - 1，外向人 - 2，每行状态用三进制表示
+ // lineStatusList[729][6] 每一行的三进制表示
+ // introvertsCountInner[729] 每一个 lineStatus 包含的内向人数
+ // extrovertsCountInner[729] 每一个 lineStatus 包含的外向人数
+ // scoreInner[729] 每一个 lineStatus 包含的行内得分（只统计 lineStatus 本身的得分，不包括它与上一行的）
+ // scoreOuter[729][729] 每一个 lineStatus 包含的行外得分
+ // dp[上一行的 lineStatus][当前处理到的行][剩余的内向人数][剩余的外向人数]
+ n3, lineStatus, introvertsCountInner, extrovertsCountInner, scoreInner, scoreOuter, lineStatusList, dp := math.Pow(3.0, float64(n)), 0, [729]int{}, [729]int{}, [729]int{}, [729][729]int{}, [729][6]int{}, [729][6][7][7]int{}
+ for i := 0; i < 729; i++ {
+ lineStatusList[i] = [6]int{}
+ }
+ for i := 0; i < 729; i++ {
+ dp[i] = [6][7][7]int{}
+ for j := 0; j < 6; j++ {
+ dp[i][j] = [7][7]int{}
+ for k := 0; k < 7; k++ {
+ dp[i][j][k] = [7]int{-1, -1, -1, -1, -1, -1, -1}
+ }
+ }
+ }
+ // 预处理
+ for lineStatus = 0; lineStatus < int(n3); lineStatus++ {
+ tmp := lineStatus
+ for i := 0; i < n; i++ {
+ lineStatusList[lineStatus][i] = tmp % 3
+ tmp /= 3
+ }
+ introvertsCountInner[lineStatus], extrovertsCountInner[lineStatus], scoreInner[lineStatus] = 0, 0, 0
+ for i := 0; i < n; i++ {
+ if lineStatusList[lineStatus][i] != 0 {
+ // 个人分数
+ if lineStatusList[lineStatus][i] == 1 {
+ introvertsCountInner[lineStatus]++
+ scoreInner[lineStatus] += 120
+ } else if lineStatusList[lineStatus][i] == 2 {
+ extrovertsCountInner[lineStatus]++
+ scoreInner[lineStatus] += 40
+ }
+ // 行内分数
+ if i-1 >= 0 {
+ scoreInner[lineStatus] += closeScore(lineStatusList[lineStatus][i], lineStatusList[lineStatus][i-1])
+ }
+ }
+ }
+ }
+ // 行外分数
+ for lineStatus0 := 0; lineStatus0 < int(n3); lineStatus0++ {
+ for lineStatus1 := 0; lineStatus1 < int(n3); lineStatus1++ {
+ scoreOuter[lineStatus0][lineStatus1] = 0
+ for i := 0; i < n; i++ {
+ scoreOuter[lineStatus0][lineStatus1] += closeScore(lineStatusList[lineStatus0][i], lineStatusList[lineStatus1][i])
+ }
+ }
+ }
+ return dfs(0, 0, introvertsCount, extrovertsCount, m, int(n3), &dp, &introvertsCountInner, &extrovertsCountInner, &scoreInner, &scoreOuter)
+}
+
+// 如果 x 和 y 相邻，需要加上的分数
+func closeScore(x, y int) int {
+ if x == 0 || y == 0 {
+ return 0
+ }
+ // 两个内向的人，每个人要 -30，一共 -60
+ if x == 1 && y == 1 {
+ return -60
+ }
+ if x == 2 && y == 2 {
+ return 40
+ }
+ return -10
+}
+
+// dfs(上一行的 lineStatus，当前处理到的行，剩余的内向人数，剩余的外向人数）
+func dfs(lineStatusLast, row, introvertsCount, extrovertsCount, m, n3 int, dp *[729][6][7][7]int, introvertsCountInner, extrovertsCountInner, scoreInner *[729]int, scoreOuter *[729][729]int) int {
+ // 边界条件：如果已经处理完，或者没有人了
+ if row == m || introvertsCount+extrovertsCount == 0 {
+ return 0
+ }
+ // 记忆化
+ if dp[lineStatusLast][row][introvertsCount][extrovertsCount] != -1 {
+ return dp[lineStatusLast][row][introvertsCount][extrovertsCount]
+ }
+ best := 0
+ for lineStatus := 0; lineStatus < n3; lineStatus++ {
+ if introvertsCountInner[lineStatus] > introvertsCount || extrovertsCountInner[lineStatus] > extrovertsCount {
+ continue
+ }
+ score := scoreInner[lineStatus] + scoreOuter[lineStatus][lineStatusLast]
+ best = max(best, score+dfs(lineStatus, row+1, introvertsCount-introvertsCountInner[lineStatus], extrovertsCount-extrovertsCountInner[lineStatus], m, n3, dp, introvertsCountInner, extrovertsCountInner, scoreInner, scoreOuter))
+ }
+ dp[lineStatusLast][row][introvertsCount][extrovertsCount] = best
+ return best
+}
+
+func max(a int, b int) int {
+ if a > b {
+ return a
+ }
+ return b
+}
+```
\ No newline at end of file
diff --git a/leetcode/1662.Check-If-Two-String-Arrays-are-Equivalent/1662. Check If Two String Arrays are Equivalent.go b/leetcode/1662.Check-If-Two-String-Arrays-are-Equivalent/1662. Check If Two String Arrays are Equivalent.go
new file mode 100644
index 000000000..f85e3b053
--- /dev/null
+++ b/leetcode/1662.Check-If-Two-String-Arrays-are-Equivalent/1662. Check If Two String Arrays are Equivalent.go
@@ -0,0 +1,12 @@
+package leetcode
+
+func arrayStringsAreEqual(word1 []string, word2 []string) bool {
+ str1, str2 := "", ""
+ for i := 0; i < len(word1); i++ {
+ str1 += word1[i]
+ }
+ for i := 0; i < len(word2); i++ {
+ str2 += word2[i]
+ }
+ return str1 == str2
+}
diff --git a/leetcode/1662.Check-If-Two-String-Arrays-are-Equivalent/1662. Check If Two String Arrays are Equivalent_test.go b/leetcode/1662.Check-If-Two-String-Arrays-are-Equivalent/1662. Check If Two String Arrays are Equivalent_test.go
new file mode 100644
index 000000000..271b0dea9
--- /dev/null
+++ b/leetcode/1662.Check-If-Two-String-Arrays-are-Equivalent/1662. Check If Two String Arrays are Equivalent_test.go
@@ -0,0 +1,53 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question1662 struct {
+ para1662
+ ans1662
+}
+
+// para 是参数
+// one 代表第一个参数
+type para1662 struct {
+ word1 []string
+ word2 []string
+}
+
+// ans 是答案
+// one 代表第一个答案
+type ans1662 struct {
+ one bool
+}
+
+func Test_Problem1662(t *testing.T) {
+
+ qs := []question1662{
+
+ {
+ para1662{[]string{"ab", "c"}, []string{"a", "bc"}},
+ ans1662{true},
+ },
+
+ {
+ para1662{[]string{"a", "cb"}, []string{"ab", "c"}},
+ ans1662{false},
+ },
+
+ {
+ para1662{[]string{"abc", "d", "defg"}, []string{"abcddefg"}},
+ ans1662{true},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 1662------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans1662, q.para1662
+ fmt.Printf("【input】:%v 【output】:%v \n", p, arrayStringsAreEqual(p.word1, p.word2))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/1662.Check-If-Two-String-Arrays-are-Equivalent/README.md b/leetcode/1662.Check-If-Two-String-Arrays-are-Equivalent/README.md
new file mode 100644
index 000000000..d1e47d012
--- /dev/null
+++ b/leetcode/1662.Check-If-Two-String-Arrays-are-Equivalent/README.md
@@ -0,0 +1,65 @@
+# [1662. Check If Two String Arrays are Equivalent](https://leetcode.com/problems/check-if-two-string-arrays-are-equivalent/)
+
+
+## 题目
+
+Given two string arrays `word1` and `word2`, return **`true` *if the two arrays **represent** the same string, and* `false` *otherwise.*
+
+A string is **represented** by an array if the array elements concatenated **in order** forms the string.
+
+**Example 1:**
+
+```
+Input: word1 = ["ab", "c"], word2 = ["a", "bc"]
+Output: true
+Explanation:
+word1 represents string "ab" + "c" -> "abc"
+word2 represents string "a" + "bc" -> "abc"
+The strings are the same, so return true.
+```
+
+**Example 2:**
+
+```
+Input: word1 = ["a", "cb"], word2 = ["ab", "c"]
+Output: false
+```
+
+**Example 3:**
+
+```
+Input: word1 = ["abc", "d", "defg"], word2 = ["abcddefg"]
+Output: true
+```
+
+**Constraints:**
+
+- `1 <= word1.length, word2.length <= 103`
+- `1 <= word1[i].length, word2[i].length <= 103`
+- `1 <= sum(word1[i].length), sum(word2[i].length) <= 103`
+- `word1[i]` and `word2[i]` consist of lowercase letters.
+
+## 题目大意
+
+给你两个字符串数组 word1 和 word2 。如果两个数组表示的字符串相同，返回 true ；否则，返回 false 。数组表示的字符串 是由数组中的所有元素 按顺序 连接形成的字符串。
+
+## 解题思路
+
+- 简单题，依次拼接 2 个数组内的字符串，然后比较 str1 和 str2 是否相同即可。
+
+## 代码
+
+```go
+package leetcode
+
+func arrayStringsAreEqual(word1 []string, word2 []string) bool {
+ str1, str2 := "", ""
+ for i := 0; i < len(word1); i++ {
+ str1 += word1[i]
+ }
+ for i := 0; i < len(word2); i++ {
+ str2 += word2[i]
+ }
+ return str1 == str2
+}
+```
\ No newline at end of file
diff --git a/leetcode/1663.Smallest-String-With-A-Given-Numeric-Value/1663. Smallest String With A Given Numeric Value.go b/leetcode/1663.Smallest-String-With-A-Given-Numeric-Value/1663. Smallest String With A Given Numeric Value.go
new file mode 100644
index 000000000..514abb09b
--- /dev/null
+++ b/leetcode/1663.Smallest-String-With-A-Given-Numeric-Value/1663. Smallest String With A Given Numeric Value.go
@@ -0,0 +1,53 @@
+package leetcode
+
+// 解法一 贪心
+func getSmallestString(n int, k int) string {
+ str, i, j := make([]byte, n), 0, 0
+ for i = n - 1; i <= k-26; i, k = i-1, k-26 {
+ str[i] = 'z'
+ }
+ if i >= 0 {
+ str[i] = byte('a' + k - 1 - i)
+ for ; j < i; j++ {
+ str[j] = 'a'
+ }
+ }
+ return string(str)
+}
+
+// 解法二 DFS
+func getSmallestString1(n int, k int) string {
+ if n == 0 {
+ return ""
+ }
+ res, c := "", []byte{}
+ findSmallestString(0, n, k, 0, c, &res)
+ return res
+}
+
+func findSmallestString(value int, length, k, index int, str []byte, res *string) {
+ if len(str) == length && value == k {
+ tmp := string(str)
+ if (*res) == "" {
+ *res = tmp
+ }
+ if tmp < *res && *res != "" {
+ *res = tmp
+ }
+ return
+ }
+ if len(str) >= index && (*res) != "" && str[index-1] > (*res)[index-1] {
+ return
+ }
+ for j := 0; j < 26; j++ {
+ if k-value > (length-len(str))*26 || value > k {
+ return
+ }
+ str = append(str, byte(int('a')+j))
+ value += j + 1
+ findSmallestString(value, length, k, index+1, str, res)
+ str = str[:len(str)-1]
+ value -= j + 1
+
+ }
+}
diff --git a/leetcode/1663.Smallest-String-With-A-Given-Numeric-Value/1663. Smallest String With A Given Numeric Value_test.go b/leetcode/1663.Smallest-String-With-A-Given-Numeric-Value/1663. Smallest String With A Given Numeric Value_test.go
new file mode 100644
index 000000000..f3c07a4cb
--- /dev/null
+++ b/leetcode/1663.Smallest-String-With-A-Given-Numeric-Value/1663. Smallest String With A Given Numeric Value_test.go
@@ -0,0 +1,53 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question1663 struct {
+ para1663
+ ans1663
+}
+
+// para 是参数
+// one 代表第一个参数
+type para1663 struct {
+ n int
+ k int
+}
+
+// ans 是答案
+// one 代表第一个答案
+type ans1663 struct {
+ one string
+}
+
+func Test_Problem1663(t *testing.T) {
+
+ qs := []question1663{
+
+ {
+ para1663{3, 27},
+ ans1663{"aay"},
+ },
+
+ {
+ para1663{5, 73},
+ ans1663{"aaszz"},
+ },
+
+ {
+ para1663{24, 552},
+ ans1663{"aaszz"},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 1663------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans1663, q.para1663
+ fmt.Printf("【input】:%v 【output】:%v \n", p, getSmallestString(p.n, p.k))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/1663.Smallest-String-With-A-Given-Numeric-Value/README.md b/leetcode/1663.Smallest-String-With-A-Given-Numeric-Value/README.md
new file mode 100644
index 000000000..efa8c4063
--- /dev/null
+++ b/leetcode/1663.Smallest-String-With-A-Given-Numeric-Value/README.md
@@ -0,0 +1,102 @@
+# [1663. Smallest String With A Given Numeric Value](https://leetcode.com/problems/smallest-string-with-a-given-numeric-value/)
+
+## 题目
+
+The **numeric value** of a **lowercase character** is defined as its position `(1-indexed)` in the alphabet, so the numeric value of `a` is `1`, the numeric value of `b` is `2`, the numeric value of `c` is `3`, and so on.
+
+The **numeric value** of a **string** consisting of lowercase characters is defined as the sum of its characters' numeric values. For example, the numeric value of the string `"abe"` is equal to `1 + 2 + 5 = 8`.
+
+You are given two integers `n` and `k`. Return *the **lexicographically smallest string** with **length** equal to `n` and **numeric value** equal to `k`.*
+
+Note that a string `x` is lexicographically smaller than string `y` if `x` comes before `y` in dictionary order, that is, either `x` is a prefix of `y`, or if `i` is the first position such that `x[i] != y[i]`, then `x[i]` comes before `y[i]` in alphabetic order.
+
+**Example 1:**
+
+```
+Input: n = 3, k = 27
+Output: "aay"
+Explanation: The numeric value of the string is 1 + 1 + 25 = 27, and it is the smallest string with such a value and length equal to 3.
+```
+
+**Example 2:**
+
+```
+Input: n = 5, k = 73
+Output: "aaszz"
+```
+
+**Constraints:**
+
+- `1 <= n <= 105`
+- `n <= k <= 26 * n`
+
+## 题目大意
+
+小写字符 的 数值 是它在字母表中的位置（从 1 开始），因此 a 的数值为 1 ，b 的数值为 2 ，c 的数值为 3 ，以此类推。字符串由若干小写字符组成，字符串的数值 为各字符的数值之和。例如，字符串 "abe" 的数值等于 1 + 2 + 5 = 8 。给你两个整数 n 和 k 。返回 长度 等于 n 且 数值 等于 k 的 字典序最小 的字符串。注意，如果字符串 x 在字典排序中位于 y 之前，就认为 x 字典序比 y 小，有以下两种情况：
+
+- x 是 y 的一个前缀；
+- 如果 i 是 x[i] != y[i] 的第一个位置，且 x[i] 在字母表中的位置比 y[i] 靠前。
+
+## 解题思路
+
+- 给出 n 和 k，要求找到字符串长度为 n，字母在字母表内位置总和为 k 的最小字典序字符串。
+- 这一题笔者读完题，比赛的时候直接用 DFS 撸了一版。赛后看了时间复杂度马马虎虎，感觉还有优化的空间。DFS 会遍历出所有的解，实际上这一题只要求最小字典序，所以 DFS 剪枝的时候要加上判断字典序的判断，如果新添加进来的字母比已经保存的字符串的相应位置上的字母字典序大，那么就直接 return，这个答案一定不会是最小字典序。代码见解法二
+- 想到这里，其实 DFS 不必要，直接用 for 循环就可找到最小字典序的字符串。代码见解法一。
+
+## 代码
+
+```go
+package leetcode
+
+// 解法一 贪心
+func getSmallestString(n int, k int) string {
+ str, i, j := make([]byte, n), 0, 0
+ for i = n-1; i <= k-26; i, k = i-1, k-26 {
+ str[i] = 'z'
+ }
+ if i >= 0 {
+ str[i] = byte('a' + k-1-i)
+ for ; j < i; j++ {
+ str[j] = 'a'
+ }
+ }
+ return string(str)
+}
+
+// 解法二 DFS
+func getSmallestString1(n int, k int) string {
+ if n == 0 {
+ return ""
+ }
+ res, c := "", []byte{}
+ findSmallestString(0, n, k, 0, c, &res)
+ return res
+}
+
+func findSmallestString(value int, length, k, index int, str []byte, res *string) {
+ if len(str) == length && value == k {
+ tmp := string(str)
+ if (*res) == "" {
+ *res = tmp
+ }
+ if tmp < *res && *res != "" {
+ *res = tmp
+ }
+ return
+ }
+ if len(str) >= index && (*res) != "" && str[index-1] > (*res)[index-1] {
+ return
+ }
+ for j := 0; j < 26; j++ {
+ if k-value > (length-len(str))*26 || value > k {
+ return
+ }
+ str = append(str, byte(int('a')+j))
+ value += j + 1
+ findSmallestString(value, length, k, index+1, str, res)
+ str = str[:len(str)-1]
+ value -= j + 1
+
+ }
+}
+```
\ No newline at end of file
diff --git a/leetcode/1664.Ways-to-Make-a-Fair-Array/1664. Ways to Make a Fair Array.go b/leetcode/1664.Ways-to-Make-a-Fair-Array/1664. Ways to Make a Fair Array.go
new file mode 100644
index 000000000..c66641a0d
--- /dev/null
+++ b/leetcode/1664.Ways-to-Make-a-Fair-Array/1664. Ways to Make a Fair Array.go
@@ -0,0 +1,45 @@
+package leetcode
+
+// 解法一 超简洁写法
+func waysToMakeFair(nums []int) int {
+ sum, res := [2]int{}, 0
+ for i := 0; i < len(nums); i++ {
+ sum[i%2] += nums[i]
+ }
+ for i := 0; i < len(nums); i++ {
+ sum[i%2] -= nums[i]
+ if sum[i%2] == sum[1-(i%2)] {
+ res++
+ }
+ sum[1-(i%2)] += nums[i]
+ }
+ return res
+}
+
+// 解法二 前缀和，后缀和
+func waysToMakeFair1(nums []int) int {
+ evenPrefix, oddPrefix, evenSuffix, oddSuffix, res := 0, 0, 0, 0, 0
+ for i := 0; i < len(nums); i++ {
+ if i%2 == 0 {
+ evenSuffix += nums[i]
+ } else {
+ oddSuffix += nums[i]
+ }
+ }
+ for i := 0; i < len(nums); i++ {
+ if i%2 == 0 {
+ evenSuffix -= nums[i]
+ } else {
+ oddSuffix -= nums[i]
+ }
+ if (evenPrefix + oddSuffix) == (oddPrefix + evenSuffix) {
+ res++
+ }
+ if i%2 == 0 {
+ evenPrefix += nums[i]
+ } else {
+ oddPrefix += nums[i]
+ }
+ }
+ return res
+}
diff --git a/leetcode/1664.Ways-to-Make-a-Fair-Array/1664. Ways to Make a Fair Array_test.go b/leetcode/1664.Ways-to-Make-a-Fair-Array/1664. Ways to Make a Fair Array_test.go
new file mode 100644
index 000000000..670e994e8
--- /dev/null
+++ b/leetcode/1664.Ways-to-Make-a-Fair-Array/1664. Ways to Make a Fair Array_test.go
@@ -0,0 +1,57 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question1664 struct {
+ para1664
+ ans1664
+}
+
+// para 是参数
+// one 代表第一个参数
+type para1664 struct {
+ nums []int
+}
+
+// ans 是答案
+// one 代表第一个答案
+type ans1664 struct {
+ one int
+}
+
+func Test_Problem1664(t *testing.T) {
+
+ qs := []question1664{
+
+ {
+ para1664{[]int{6, 1, 7, 4, 1}},
+ ans1664{0},
+ },
+
+ {
+ para1664{[]int{2, 1, 6, 4}},
+ ans1664{1},
+ },
+
+ {
+ para1664{[]int{1, 1, 1}},
+ ans1664{3},
+ },
+
+ {
+ para1664{[]int{1, 2, 3}},
+ ans1664{0},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 1664------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans1664, q.para1664
+ fmt.Printf("【input】:%v 【output】:%v \n", p, waysToMakeFair(p.nums))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/1664.Ways-to-Make-a-Fair-Array/README.md b/leetcode/1664.Ways-to-Make-a-Fair-Array/README.md
new file mode 100644
index 000000000..9c40f8230
--- /dev/null
+++ b/leetcode/1664.Ways-to-Make-a-Fair-Array/README.md
@@ -0,0 +1,116 @@
+# [1664. Ways to Make a Fair Array](https://leetcode.com/problems/ways-to-make-a-fair-array/)
+
+
+## 题目
+
+You are given an integer array `nums`. You can choose **exactly one** index (**0-indexed**) and remove the element. Notice that the index of the elements may change after the removal.
+
+For example, if `nums = [6,1,7,4,1]`:
+
+- Choosing to remove index `1` results in `nums = [6,7,4,1]`.
+- Choosing to remove index `2` results in `nums = [6,1,4,1]`.
+- Choosing to remove index `4` results in `nums = [6,1,7,4]`.
+
+An array is **fair** if the sum of the odd-indexed values equals the sum of the even-indexed values.
+
+Return the ***number** of indices that you could choose such that after the removal,* `nums` *is **fair**.*
+
+**Example 1:**
+
+```
+Input: nums = [2,1,6,4]
+Output: 1
+Explanation:
+Remove index 0: [1,6,4] -> Even sum: 1 + 4 = 5. Odd sum: 6. Not fair.
+Remove index 1: [2,6,4] -> Even sum: 2 + 4 = 6. Odd sum: 6. Fair.
+Remove index 2: [2,1,4] -> Even sum: 2 + 4 = 6. Odd sum: 1. Not fair.
+Remove index 3: [2,1,6] -> Even sum: 2 + 6 = 8. Odd sum: 1. Not fair.
+There is 1 index that you can remove to make nums fair.
+```
+
+**Example 2:**
+
+```
+Input: nums = [1,1,1]
+Output: 3
+Explanation: You can remove any index and the remaining array is fair.
+```
+
+**Example 3:**
+
+```
+Input: nums = [1,2,3]
+Output: 0
+Explanation: You cannot make a fair array after removing any index.
+```
+
+**Constraints:**
+
+- `1 <= nums.length <= 105`
+- `1 <= nums[i] <= 104`
+
+## 题目大意
+
+给你一个整数数组 nums 。你需要选择 恰好 一个下标（下标从 0 开始）并删除对应的元素。请注意剩下元素的下标可能会因为删除操作而发生改变。
+
+比方说，如果 nums = [6,1,7,4,1] ，那么：
+
+- 选择删除下标 1 ，剩下的数组为 nums = [6,7,4,1] 。
+- 选择删除下标 2 ，剩下的数组为 nums = [6,1,4,1] 。
+- 选择删除下标 4 ，剩下的数组为 nums = [6,1,7,4] 。
+
+如果一个数组满足奇数下标元素的和与偶数下标元素的和相等，该数组就是一个 平衡数组 。请你返回删除操作后，剩下的数组 nums 是 平衡数组 的 方案数 。
+
+## 解题思路
+
+- 给定一个数组 nums，要求输出仅删除一个元素以后能使得整个数组平衡的方案数。平衡的定义是奇数下标元素总和等于偶数下标元素总和。
+- 这一题如果暴力解答，会超时。原因是每次删除元素以后，都重新计算奇偶数位总和比较耗时。应该利用前面计算过的累加和，推导出此次删除元素以后的情况。这样修改以后就不超时了。具体的，如果删除的是元素是奇数位，这个下标的前缀和不变，要变化的是后面的。删除元素后面，原来偶数位的总和变成了奇数位了，原来奇数位的总和变成偶数位了。删除元素后面这半段的总和可以用前缀和计算出来，奇数位的总和减去删除元素的前缀和，就得到了删除元素后面的后缀和。通过这个办法就可以得到删除元素后面的，奇数位总和，偶数位总和。注意这个后缀和是包含了删除元素的。所以最后需要判断删除元素是奇数位还是偶数位，如果是奇数位，那么在计算出来的偶数和上再减去这个删除元素；如果是偶数位，就在计算出来的奇数和上再减去这个删除元素。代码见解法二。
+- 这一题还有一种更简洁的写法，就是解法一了。通过了解法二的思考，我们可以知道，每次变换以后的操作可以抽象出来，即三步，减去一个数，判断是否相等，再加上一个数。只不过这三步在解法二中都去判断了奇偶性。如果我们不判断奇偶性，那么代码就可以写成解法一的样子。为什么可以不用管奇偶性呢？因为每次删除一个元素以后，下次再删除，奇偶就发生颠倒了，上次的奇数和到了下次就是偶数和了。想通这一点就可以把代码写成解法一的样子。
+
+## 代码
+
+```go
+// 解法一 超简洁写法
+func waysToMakeFair(nums []int) int {
+ sum, res := [2]int{}, 0
+ for i := 0; i < len(nums); i++ {
+ sum[i%2] += nums[i]
+ }
+ for i := 0; i < len(nums); i++ {
+ sum[i%2] -= nums[i]
+ if sum[i%2] == sum[1-(i%2)] {
+ res++
+ }
+ sum[1-(i%2)] += nums[i]
+ }
+ return res
+}
+
+// 解法二 前缀和，后缀和
+func waysToMakeFair1(nums []int) int {
+ evenPrefix, oddPrefix, evenSuffix, oddSuffix, res := 0, 0, 0, 0, 0
+ for i := 0; i < len(nums); i++ {
+ if i%2 == 0 {
+ evenSuffix += nums[i]
+ } else {
+ oddSuffix += nums[i]
+ }
+ }
+ for i := 0; i < len(nums); i++ {
+ if i%2 == 0 {
+ evenSuffix -= nums[i]
+ } else {
+ oddSuffix -= nums[i]
+ }
+ if (evenPrefix + oddSuffix) == (oddPrefix + evenSuffix) {
+ res++
+ }
+ if i%2 == 0 {
+ evenPrefix += nums[i]
+ } else {
+ oddPrefix += nums[i]
+ }
+ }
+ return res
+}
+```
\ No newline at end of file
diff --git a/leetcode/1665.Minimum-Initial-Energy-to-Finish-Tasks/1665. Minimum Initial Energy to Finish Tasks.go b/leetcode/1665.Minimum-Initial-Energy-to-Finish-Tasks/1665. Minimum Initial Energy to Finish Tasks.go
new file mode 100644
index 000000000..f44dfcd91
--- /dev/null
+++ b/leetcode/1665.Minimum-Initial-Energy-to-Finish-Tasks/1665. Minimum Initial Energy to Finish Tasks.go
@@ -0,0 +1,47 @@
+package leetcode
+
+import (
+ "sort"
+)
+
+func minimumEffort(tasks [][]int) int {
+ sort.Sort(Task(tasks))
+ res, cur := 0, 0
+ for _, t := range tasks {
+ if t[1] > cur {
+ res += t[1] - cur
+ cur = t[1] - t[0]
+ } else {
+ cur -= t[0]
+ }
+ }
+ return res
+}
+
+func max(a, b int) int {
+ if a > b {
+ return a
+ }
+ return b
+}
+
+// Task define
+type Task [][]int
+
+func (task Task) Len() int {
+ return len(task)
+}
+
+func (task Task) Less(i, j int) bool {
+ t1, t2 := task[i][1]-task[i][0], task[j][1]-task[j][0]
+ if t1 != t2 {
+ return t2 < t1
+ }
+ return task[j][1] < task[i][1]
+}
+
+func (task Task) Swap(i, j int) {
+ t := task[i]
+ task[i] = task[j]
+ task[j] = t
+}
diff --git a/leetcode/1665.Minimum-Initial-Energy-to-Finish-Tasks/1665. Minimum Initial Energy to Finish Tasks_test.go b/leetcode/1665.Minimum-Initial-Energy-to-Finish-Tasks/1665. Minimum Initial Energy to Finish Tasks_test.go
new file mode 100644
index 000000000..ce0762380
--- /dev/null
+++ b/leetcode/1665.Minimum-Initial-Energy-to-Finish-Tasks/1665. Minimum Initial Energy to Finish Tasks_test.go
@@ -0,0 +1,52 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question1665 struct {
+ para1665
+ ans1665
+}
+
+// para 是参数
+// one 代表第一个参数
+type para1665 struct {
+ tasks [][]int
+}
+
+// ans 是答案
+// one 代表第一个答案
+type ans1665 struct {
+ one int
+}
+
+func Test_Problem1665(t *testing.T) {
+
+ qs := []question1665{
+
+ {
+ para1665{[][]int{{1, 2}, {2, 4}, {4, 8}}},
+ ans1665{8},
+ },
+
+ {
+ para1665{[][]int{{1, 3}, {2, 4}, {10, 11}, {10, 12}, {8, 9}}},
+ ans1665{32},
+ },
+
+ {
+ para1665{[][]int{{1, 7}, {2, 8}, {3, 9}, {4, 10}, {5, 11}, {6, 12}}},
+ ans1665{27},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 1665------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans1665, q.para1665
+ fmt.Printf("【input】:%v 【output】:%v \n", p, minimumEffort(p.tasks))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/1665.Minimum-Initial-Energy-to-Finish-Tasks/README.md b/leetcode/1665.Minimum-Initial-Energy-to-Finish-Tasks/README.md
new file mode 100644
index 000000000..c2bd57e69
--- /dev/null
+++ b/leetcode/1665.Minimum-Initial-Energy-to-Finish-Tasks/README.md
@@ -0,0 +1,128 @@
+# [1665. Minimum Initial Energy to Finish Tasks](https://leetcode.com/problems/minimum-initial-energy-to-finish-tasks/)
+
+## 题目
+
+You are given an array `tasks` where `tasks[i] = [actuali, minimumi]`:
+
+- `actuali` is the actual amount of energy you **spend to finish** the `ith` task.
+- `minimumi` is the minimum amount of energy you **require to begin** the `ith` task.
+
+For example, if the task is `[10, 12]` and your current energy is `11`, you cannot start this task. However, if your current energy is `13`, you can complete this task, and your energy will be `3` after finishing it.
+
+You can finish the tasks in **any order** you like.
+
+Return *the **minimum** initial amount of energy you will need* *to finish all the tasks*.
+
+**Example 1:**
+
+```
+Input: tasks = [[1,2],[2,4],[4,8]]
+Output: 8
+Explanation:
+Starting with 8 energy, we finish the tasks in the following order:
+ - 3rd task. Now energy = 8 - 4 = 4.
+ - 2nd task. Now energy = 4 - 2 = 2.
+ - 1st task. Now energy = 2 - 1 = 1.
+Notice that even though we have leftover energy, starting with 7 energy does not work because we cannot do the 3rd task.
+```
+
+**Example 2:**
+
+```
+Input: tasks = [[1,3],[2,4],[10,11],[10,12],[8,9]]
+Output: 32
+Explanation:
+Starting with 32 energy, we finish the tasks in the following order:
+ - 1st task. Now energy = 32 - 1 = 31.
+ - 2nd task. Now energy = 31 - 2 = 29.
+ - 3rd task. Now energy = 29 - 10 = 19.
+ - 4th task. Now energy = 19 - 10 = 9.
+ - 5th task. Now energy = 9 - 8 = 1.
+```
+
+**Example 3:**
+
+```
+Input: tasks = [[1,7],[2,8],[3,9],[4,10],[5,11],[6,12]]
+Output: 27
+Explanation:
+Starting with 27 energy, we finish the tasks in the following order:
+ - 5th task. Now energy = 27 - 5 = 22.
+ - 2nd task. Now energy = 22 - 2 = 20.
+ - 3rd task. Now energy = 20 - 3 = 17.
+ - 1st task. Now energy = 17 - 1 = 16.
+ - 4th task. Now energy = 16 - 4 = 12.
+ - 6th task. Now energy = 12 - 6 = 6.
+
+```
+
+**Constraints:**
+
+- `1 <= tasks.length <= 105`
+- `1 <= actuali <= minimumi <= 104`
+
+## 题目大意
+
+给你一个任务数组 tasks ，其中 tasks[i] = [actuali, minimumi] ：
+
+- actual i 是完成第 i 个任务 需要耗费 的实际能量。
+- minimum i 是开始第 i 个任务前需要达到的最低能量。
+
+比方说，如果任务为 [10, 12] 且你当前的能量为 11 ，那么你不能开始这个任务。如果你当前的能量为 13 ，你可以完成这个任务，且完成它后剩余能量为 3 。你可以按照 任意顺序 完成任务。请你返回完成所有任务的 最少 初始能量。
+
+## 解题思路
+
+- 给出一个 task 数组，每个元素代表一个任务，每个任务有实际消费能量值和开始这个任务需要的最低能量。要求输出能完成所有任务的最少初始能量。
+- 这一题直觉是贪心。先将任务按照 `minimum - actual` 进行排序。先完成差值大的任务，那么接下来的能量能最大限度的满足接下来的任务。这样可能完成所有任务的可能性越大。循环任务数组的时候，保存当前能量在 `cur` 中，如果当前能量不够开启下一个任务，那么这个差值就是需要弥补的，这些能量就是最少初始能量中的，所以加上这些差值能量。如果当前能量可以开启下一个任务，那么就更新当前能量，减去实际消耗的能量以后，再继续循环。循环结束就能得到最少初始能量了。
+
+## 代码
+
+```go
+package leetcode
+
+import (
+ "sort"
+)
+
+func minimumEffort(tasks [][]int) int {
+ sort.Sort(Task(tasks))
+ res, cur := 0, 0
+ for _, t := range tasks {
+ if t[1] > cur {
+ res += t[1] - cur
+ cur = t[1] - t[0]
+ } else {
+ cur -= t[0]
+ }
+ }
+ return res
+}
+
+func max(a, b int) int {
+ if a > b {
+ return a
+ }
+ return b
+}
+
+// Task define
+type Task [][]int
+
+func (task Task) Len() int {
+ return len(task)
+}
+
+func (task Task) Less(i, j int) bool {
+ t1, t2 := task[i][1]-task[i][0], task[j][1]-task[j][0]
+ if t1 != t2 {
+ return t2 < t1
+ }
+ return task[j][1] < task[i][1]
+}
+
+func (task Task) Swap(i, j int) {
+ t := task[i]
+ task[i] = task[j]
+ task[j] = t
+}
+```
\ No newline at end of file
diff --git a/leetcode/1668.Maximum-Repeating-Substring/1668. Maximum Repeating Substring.go b/leetcode/1668.Maximum-Repeating-Substring/1668. Maximum Repeating Substring.go
new file mode 100644
index 000000000..1ef762ab5
--- /dev/null
+++ b/leetcode/1668.Maximum-Repeating-Substring/1668. Maximum Repeating Substring.go
@@ -0,0 +1,18 @@
+package leetcode
+
+import (
+ "strings"
+)
+
+func maxRepeating(sequence string, word string) int {
+ for i := len(sequence) / len(word); i >= 0; i-- {
+ tmp := ""
+ for j := 0; j < i; j++ {
+ tmp += word
+ }
+ if strings.Contains(sequence, tmp) {
+ return i
+ }
+ }
+ return 0
+}
diff --git a/leetcode/1668.Maximum-Repeating-Substring/1668. Maximum Repeating Substring_test.go b/leetcode/1668.Maximum-Repeating-Substring/1668. Maximum Repeating Substring_test.go
new file mode 100644
index 000000000..ee5aadd59
--- /dev/null
+++ b/leetcode/1668.Maximum-Repeating-Substring/1668. Maximum Repeating Substring_test.go
@@ -0,0 +1,53 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question1668 struct {
+ para1668
+ ans1668
+}
+
+// para 是参数
+// one 代表第一个参数
+type para1668 struct {
+ sequence string
+ word string
+}
+
+// ans 是答案
+// one 代表第一个答案
+type ans1668 struct {
+ one int
+}
+
+func Test_Problem1668(t *testing.T) {
+
+ qs := []question1668{
+
+ {
+ para1668{"ababc", "ab"},
+ ans1668{2},
+ },
+
+ {
+ para1668{"ababc", "ba"},
+ ans1668{1},
+ },
+
+ {
+ para1668{"ababc", "ac"},
+ ans1668{0},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 1668------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans1668, q.para1668
+ fmt.Printf("【input】:%v 【output】:%v \n", p, maxRepeating(p.sequence, p.word))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/1668.Maximum-Repeating-Substring/README.md b/leetcode/1668.Maximum-Repeating-Substring/README.md
new file mode 100644
index 000000000..b25e75de9
--- /dev/null
+++ b/leetcode/1668.Maximum-Repeating-Substring/README.md
@@ -0,0 +1,69 @@
+# [1668. Maximum Repeating Substring](https://leetcode.com/problems/maximum-repeating-substring/)
+
+
+## 题目
+
+For a string `sequence`, a string `word` is **`k`-repeating** if `word` concatenated `k` times is a substring of `sequence`. The `word`'s **maximum `k`-repeating value** is the highest value `k` where `word` is `k`-repeating in `sequence`. If `word` is not a substring of `sequence`, `word`'s maximum `k`-repeating value is `0`.
+
+Given strings `sequence` and `word`, return *the **maximum `k`-repeating value** of `word` in `sequence`*.
+
+**Example 1:**
+
+```
+Input: sequence = "ababc", word = "ab"
+Output: 2
+Explanation: "abab" is a substring in "ababc".
+```
+
+**Example 2:**
+
+```
+Input: sequence = "ababc", word = "ba"
+Output: 1
+Explanation: "ba" is a substring in "ababc". "baba" is not a substring in "ababc".
+```
+
+**Example 3:**
+
+```
+Input: sequence = "ababc", word = "ac"
+Output: 0
+Explanation: "ac" is not a substring in "ababc".
+```
+
+**Constraints:**
+
+- `1 <= sequence.length <= 100`
+- `1 <= word.length <= 100`
+- `sequence` and `word` contains only lowercase English letters.
+
+## 题目大意
+
+给你一个字符串 sequence ，如果字符串 word 连续重复 k 次形成的字符串是 sequence 的一个子字符串，那么单词 word 的 重复值为 k 。单词 word 的 最大重复值 是单词 word 在 sequence 中最大的重复值。如果 word 不是 sequence 的子串，那么重复值 k 为 0 。给你一个字符串 sequence 和 word ，请你返回 最大重复值 k 。
+
+## 解题思路
+
+- 循环叠加构造 `word`，每次构造出新的 `word` 都在 `sequence` 查找一次，如果找到就输出叠加次数，否则继续叠加构造，直到字符串长度和 `sequence` 一样长，最终都没有找到则输出 0 。
+
+## 代码
+
+```go
+package leetcode
+
+import (
+ "strings"
+)
+
+func maxRepeating(sequence string, word string) int {
+ for i := len(sequence) / len(word); i >= 0; i-- {
+ tmp := ""
+ for j := 0; j < i; j++ {
+ tmp += word
+ }
+ if strings.Contains(sequence, tmp) {
+ return i
+ }
+ }
+ return 0
+}
+```
\ No newline at end of file
diff --git a/leetcode/1669.Merge-In-Between-Linked-Lists/1669. Merge In Between Linked Lists.go b/leetcode/1669.Merge-In-Between-Linked-Lists/1669. Merge In Between Linked Lists.go
new file mode 100644
index 000000000..9536270e5
--- /dev/null
+++ b/leetcode/1669.Merge-In-Between-Linked-Lists/1669. Merge In Between Linked Lists.go
@@ -0,0 +1,37 @@
+package leetcode
+
+import (
+ "github.com/halfrost/LeetCode-Go/structures"
+)
+
+// ListNode define
+type ListNode = structures.ListNode
+
+/**
+ * Definition for singly-linked list.
+ * type ListNode struct {
+ * Val int
+ * Next *ListNode
+ * }
+ */
+
+func mergeInBetween(list1 *ListNode, a int, b int, list2 *ListNode) *ListNode {
+ n := list1
+ var startRef, endRef *ListNode
+ for i := 0; i <= b; i++ {
+ if i == a-1 {
+ startRef = n
+ }
+ if i == b {
+ endRef = n
+ }
+ n = n.Next
+ }
+ startRef.Next = list2
+ n = list2
+ for n.Next != nil {
+ n = n.Next
+ }
+ n.Next = endRef.Next
+ return list1
+}
diff --git a/leetcode/1669.Merge-In-Between-Linked-Lists/1669. Merge In Between Linked Lists_test.go b/leetcode/1669.Merge-In-Between-Linked-Lists/1669. Merge In Between Linked Lists_test.go
new file mode 100644
index 000000000..b7d63a0e8
--- /dev/null
+++ b/leetcode/1669.Merge-In-Between-Linked-Lists/1669. Merge In Between Linked Lists_test.go
@@ -0,0 +1,62 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+
+ "github.com/halfrost/LeetCode-Go/structures"
+)
+
+type question1669 struct {
+ para1669
+ ans1669
+}
+
+// para 是参数
+// one 代表第一个参数
+type para1669 struct {
+ one []int
+ a int
+ b int
+ another []int
+}
+
+// ans 是答案
+// one 代表第一个答案
+type ans1669 struct {
+ one []int
+}
+
+func Test_Problem1669(t *testing.T) {
+
+ qs := []question1669{
+
+ {
+ para1669{[]int{0, 1, 2, 3, 4, 5}, 3, 4, []int{1000000, 1000001, 1000002}},
+ ans1669{[]int{0, 1, 2, 1000000, 1000001, 1000002, 5}},
+ },
+
+ {
+ para1669{[]int{0, 1, 2, 3, 4, 5, 6}, 2, 5, []int{1000000, 1000001, 1000002, 1000003, 1000004}},
+ ans1669{[]int{0, 1, 1000000, 1000001, 1000002, 1000003, 1000004, 6}},
+ },
+
+ {
+ para1669{[]int{0, 1, 2, 3, 4, 5, 6, 7, 8, 9}, 3, 5, []int{1000000, 1000001, 1000002, 1000003, 1000004, 1000005, 1000006}},
+ ans1669{[]int{0, 1, 2, 1000000, 1000001, 1000002, 1000003, 1000004, 1000005, 1000006, 6, 7, 8, 9}},
+ },
+
+ {
+ para1669{[]int{0, 1, 2}, 1, 1, []int{1000000, 1000001, 1000002, 1000003}},
+ ans1669{[]int{0, 1000000, 1000001, 1000002, 1000003, 2}},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 1669------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans1669, q.para1669
+ fmt.Printf("【input】:%v 【output】:%v\n", p, structures.List2Ints(mergeInBetween(structures.Ints2List(p.one), p.a, p.b, structures.Ints2List(p.another))))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/1669.Merge-In-Between-Linked-Lists/README.md b/leetcode/1669.Merge-In-Between-Linked-Lists/README.md
new file mode 100644
index 000000000..3b221b0f5
--- /dev/null
+++ b/leetcode/1669.Merge-In-Between-Linked-Lists/README.md
@@ -0,0 +1,75 @@
+# [1669. Merge In Between Linked Lists](https://leetcode.com/problems/merge-in-between-linked-lists/)
+
+
+## 题目
+
+You are given two linked lists: `list1` and `list2` of sizes `n` and `m` respectively.
+
+Remove `list1`'s nodes from the `ath` node to the `bth` node, and put `list2` in their place.
+
+The blue edges and nodes in the following figure incidate the result:
+
+
+
+*Build the result list and return its head.*
+
+**Example 1:**
+
+
+
+```
+Input: list1 = [0,1,2,3,4,5], a = 3, b = 4, list2 = [1000000,1000001,1000002]
+Output: [0,1,2,1000000,1000001,1000002,5]
+Explanation: We remove the nodes 3 and 4 and put the entire list2 in their place. The blue edges and nodes in the above figure indicate the result.
+
+```
+
+**Example 2:**
+
+
+
+```
+Input: list1 = [0,1,2,3,4,5,6], a = 2, b = 5, list2 = [1000000,1000001,1000002,1000003,1000004]
+Output: [0,1,1000000,1000001,1000002,1000003,1000004,6]
+Explanation: The blue edges and nodes in the above figure indicate the result.
+
+```
+
+**Constraints:**
+
+- `3 <= list1.length <= 104`
+- `1 <= a <= b < list1.length - 1`
+- `1 <= list2.length <= 104`
+
+## 题目大意
+
+给你两个链表 list1 和 list2 ，它们包含的元素分别为 n 个和 m 个。请你将 list1 中第 a 个节点到第 b 个节点删除，并将list2 接在被删除节点的位置。
+
+## 解题思路
+
+- 简单题，考查链表的基本操作。此题注意 a == b 的情况。
+
+## 代码
+
+```go
+func mergeInBetween(list1 *ListNode, a int, b int, list2 *ListNode) *ListNode {
+ n := list1
+ var startRef, endRef *ListNode
+ for i := 0; i <= b; i++ {
+ if i == a-1 {
+ startRef = n
+ }
+ if i == b {
+ endRef = n
+ }
+ n = n.Next
+ }
+ startRef.Next = list2
+ n = list2
+ for n.Next != nil {
+ n = n.Next
+ }
+ n.Next = endRef.Next
+ return list1
+}
+```
\ No newline at end of file
diff --git a/leetcode/1670.Design-Front-Middle-Back-Queue/1670. Design Front Middle Back Queue.go b/leetcode/1670.Design-Front-Middle-Back-Queue/1670. Design Front Middle Back Queue.go
new file mode 100644
index 000000000..63e8326b1
--- /dev/null
+++ b/leetcode/1670.Design-Front-Middle-Back-Queue/1670. Design Front Middle Back Queue.go
@@ -0,0 +1,94 @@
+package leetcode
+
+import (
+ "container/list"
+)
+
+type FrontMiddleBackQueue struct {
+ list *list.List
+ middle *list.Element
+}
+
+func Constructor() FrontMiddleBackQueue {
+ return FrontMiddleBackQueue{list: list.New()}
+}
+
+func (this *FrontMiddleBackQueue) PushFront(val int) {
+ e := this.list.PushFront(val)
+ if this.middle == nil {
+ this.middle = e
+ } else if this.list.Len()%2 == 0 && this.middle.Prev() != nil {
+ this.middle = this.middle.Prev()
+ }
+}
+
+func (this *FrontMiddleBackQueue) PushMiddle(val int) {
+ if this.middle == nil {
+ this.PushFront(val)
+ } else {
+ if this.list.Len()%2 != 0 {
+ this.middle = this.list.InsertBefore(val, this.middle)
+ } else {
+ this.middle = this.list.InsertAfter(val, this.middle)
+ }
+ }
+}
+
+func (this *FrontMiddleBackQueue) PushBack(val int) {
+ e := this.list.PushBack(val)
+ if this.middle == nil {
+ this.middle = e
+ } else if this.list.Len()%2 != 0 && this.middle.Next() != nil {
+ this.middle = this.middle.Next()
+ }
+}
+
+func (this *FrontMiddleBackQueue) PopFront() int {
+ if this.list.Len() == 0 {
+ return -1
+ }
+ e := this.list.Front()
+ if this.list.Len() == 1 {
+ this.middle = nil
+ } else if this.list.Len()%2 == 0 && this.middle.Next() != nil {
+ this.middle = this.middle.Next()
+ }
+ return this.list.Remove(e).(int)
+}
+
+func (this *FrontMiddleBackQueue) PopMiddle() int {
+ if this.middle == nil {
+ return -1
+ }
+ e := this.middle
+ if this.list.Len()%2 != 0 {
+ this.middle = e.Prev()
+ } else {
+ this.middle = e.Next()
+ }
+ return this.list.Remove(e).(int)
+}
+
+func (this *FrontMiddleBackQueue) PopBack() int {
+ if this.list.Len() == 0 {
+ return -1
+ }
+ e := this.list.Back()
+ if this.list.Len() == 1 {
+ this.middle = nil
+ } else if this.list.Len()%2 != 0 && this.middle.Prev() != nil {
+ this.middle = this.middle.Prev()
+ }
+ return this.list.Remove(e).(int)
+}
+
+/**
+ * Your FrontMiddleBackQueue object will be instantiated and called as such:
+ * obj := Constructor();
+ * obj.PushFront(val);
+ * obj.PushMiddle(val);
+ * obj.PushBack(val);
+ * param_4 := obj.PopFront();
+ * param_5 := obj.PopMiddle();
+ * param_6 := obj.PopBack();
+ */
diff --git a/leetcode/1670.Design-Front-Middle-Back-Queue/1670. Design Front Middle Back Queue_test.go b/leetcode/1670.Design-Front-Middle-Back-Queue/1670. Design Front Middle Back Queue_test.go
new file mode 100644
index 000000000..e2b30c0e2
--- /dev/null
+++ b/leetcode/1670.Design-Front-Middle-Back-Queue/1670. Design Front Middle Back Queue_test.go
@@ -0,0 +1,112 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+func Test_Problem1670(t *testing.T) {
+ obj := Constructor()
+ fmt.Printf("obj = %v %v\n", MList2Ints(&obj), obj)
+ obj.PushFront(1)
+ fmt.Printf("obj = %v %v\n", MList2Ints(&obj), obj)
+ obj.PushBack(2)
+ fmt.Printf("obj = %v\n", MList2Ints(&obj))
+ obj.PushMiddle(3)
+ fmt.Printf("obj = %v\n", MList2Ints(&obj))
+ obj.PushMiddle(4)
+ fmt.Printf("obj = %v\n", MList2Ints(&obj))
+ param1 := obj.PopFront()
+ fmt.Printf("param1 = %v obj = %v\n", param1, MList2Ints(&obj))
+ param1 = obj.PopMiddle()
+ fmt.Printf("param1 = %v obj = %v\n", param1, MList2Ints(&obj))
+ param1 = obj.PopMiddle()
+ fmt.Printf("param1 = %v obj = %v\n", param1, MList2Ints(&obj))
+ param1 = obj.PopBack()
+ fmt.Printf("param1 = %v obj = %v\n", param1, MList2Ints(&obj))
+ param1 = obj.PopFront()
+ fmt.Printf("param1 = %v obj = %v\n", param1, MList2Ints(&obj))
+ fmt.Printf("-----------------------------------------------------------------\n")
+ obj = Constructor()
+ fmt.Printf("obj = %v %v\n", MList2Ints(&obj), obj)
+ obj.PushFront(1)
+ fmt.Printf("obj = %v %v\n", MList2Ints(&obj), obj)
+ obj.PushFront(2)
+ fmt.Printf("obj = %v %v\n", MList2Ints(&obj), obj)
+ obj.PushFront(3)
+ fmt.Printf("obj = %v %v\n", MList2Ints(&obj), obj)
+ obj.PushFront(4)
+ fmt.Printf("obj = %v %v\n", MList2Ints(&obj), obj)
+ param1 = obj.PopBack()
+ fmt.Printf("param1 = %v obj = %v\n", param1, MList2Ints(&obj))
+ param1 = obj.PopBack()
+ fmt.Printf("param1 = %v obj = %v\n", param1, MList2Ints(&obj))
+ param1 = obj.PopBack()
+ fmt.Printf("param1 = %v obj = %v\n", param1, MList2Ints(&obj))
+ param1 = obj.PopBack()
+ fmt.Printf("param1 = %v obj = %v\n", param1, MList2Ints(&obj))
+ fmt.Printf("-----------------------------------------------------------------\n")
+ obj = Constructor()
+ fmt.Printf("obj = %v %v\n", MList2Ints(&obj), obj)
+ obj.PushMiddle(1)
+ fmt.Printf("obj = %v\n", MList2Ints(&obj))
+ obj.PushMiddle(2)
+ fmt.Printf("obj = %v\n", MList2Ints(&obj))
+ obj.PushMiddle(3)
+ fmt.Printf("obj = %v\n", MList2Ints(&obj))
+ param1 = obj.PopMiddle()
+ fmt.Printf("param1 = %v obj = %v\n", param1, MList2Ints(&obj))
+ param1 = obj.PopMiddle()
+ fmt.Printf("param1 = %v obj = %v\n", param1, MList2Ints(&obj))
+ param1 = obj.PopMiddle()
+ fmt.Printf("param1 = %v obj = %v\n", param1, MList2Ints(&obj))
+ fmt.Printf("-----------------------------------------------------------------\n")
+ obj = Constructor()
+ fmt.Printf("obj = %v %v\n", MList2Ints(&obj), obj)
+ obj.PushMiddle(8)
+ fmt.Printf("obj = %v\n", MList2Ints(&obj))
+ param1 = obj.PopMiddle()
+ fmt.Printf("param1 = %v obj = %v\n", param1, MList2Ints(&obj))
+ param1 = obj.PopFront()
+ fmt.Printf("param1 = %v obj = %v\n", param1, MList2Ints(&obj))
+ param1 = obj.PopBack()
+ fmt.Printf("param1 = %v obj = %v\n", param1, MList2Ints(&obj))
+ param1 = obj.PopMiddle()
+ fmt.Printf("param1 = %v obj = %v\n", param1, MList2Ints(&obj))
+ obj.PushMiddle(1)
+ fmt.Printf("obj = %v\n", MList2Ints(&obj))
+ obj.PushMiddle(10)
+ fmt.Printf("obj = %v\n", MList2Ints(&obj))
+ fmt.Printf("-----------------------------------------------------------------\n")
+ obj = Constructor()
+ fmt.Printf("obj = %v %v\n", MList2Ints(&obj), obj)
+ param1 = obj.PopMiddle()
+ fmt.Printf("param1 = %v obj = %v\n", param1, MList2Ints(&obj))
+ obj.PushMiddle(3)
+ fmt.Printf("obj = %v %v\n", MList2Ints(&obj), obj)
+ obj.PushFront(6)
+ fmt.Printf("obj = %v %v\n", MList2Ints(&obj), obj)
+ obj.PushMiddle(6)
+ fmt.Printf("obj = %v %v\n", MList2Ints(&obj), obj)
+ obj.PushMiddle(3)
+ fmt.Printf("obj = %v %v\n", MList2Ints(&obj), obj)
+ param1 = obj.PopMiddle()
+ fmt.Printf("param1 = %v obj = %v %v\n", param1, MList2Ints(&obj), obj)
+ obj.PushMiddle(7)
+ fmt.Printf("obj = %v %v\n", MList2Ints(&obj), obj)
+ param1 = obj.PopMiddle()
+ fmt.Printf("param1 = %v obj = %v %v\n", param1, MList2Ints(&obj), obj)
+ obj.PushMiddle(8)
+ fmt.Printf("obj = %v %v\n", MList2Ints(&obj), obj)
+ // ["FrontMiddleBackQueue","popMiddle","pushMiddle","pushFront","pushMiddle","pushMiddle","popMiddle","pushMiddle","popMiddle","pushMiddle"]
+ // [[],[],[3],[6],[6],[3],[],[7],[],[8]]
+}
+
+func MList2Ints(this *FrontMiddleBackQueue) []int {
+ array := []int{}
+ for e := this.list.Front(); e != nil; e = e.Next() {
+ value, _ := e.Value.(int)
+ array = append(array, value)
+ }
+ return array
+}
diff --git a/leetcode/1670.Design-Front-Middle-Back-Queue/README.md b/leetcode/1670.Design-Front-Middle-Back-Queue/README.md
new file mode 100644
index 000000000..2046abf8a
--- /dev/null
+++ b/leetcode/1670.Design-Front-Middle-Back-Queue/README.md
@@ -0,0 +1,172 @@
+# [1670. Design Front Middle Back Queue](https://leetcode.com/problems/design-front-middle-back-queue/)
+
+
+## 题目
+
+Design a queue that supports `push` and `pop` operations in the front, middle, and back.
+
+Implement the `FrontMiddleBack` class:
+
+- `FrontMiddleBack()` Initializes the queue.
+- `void pushFront(int val)` Adds `val` to the **front** of the queue.
+- `void pushMiddle(int val)` Adds `val` to the **middle** of the queue.
+- `void pushBack(int val)` Adds `val` to the **back** of the queue.
+- `int popFront()` Removes the **front** element of the queue and returns it. If the queue is empty, return `1`.
+- `int popMiddle()` Removes the **middle** element of the queue and returns it. If the queue is empty, return `1`.
+- `int popBack()` Removes the **back** element of the queue and returns it. If the queue is empty, return `1`.
+
+**Notice** that when there are **two** middle position choices, the operation is performed on the **frontmost** middle position choice. For example:
+
+- Pushing `6` into the middle of `[1, 2, 3, 4, 5]` results in `[1, 2, 6, 3, 4, 5]`.
+- Popping the middle from `[1, 2, 3, 4, 5, 6]` returns `3` and results in `[1, 2, 4, 5, 6]`.
+
+**Example 1:**
+
+```
+Input:
+["FrontMiddleBackQueue", "pushFront", "pushBack", "pushMiddle", "pushMiddle", "popFront", "popMiddle", "popMiddle", "popBack", "popFront"]
+[[], [1], [2], [3], [4], [], [], [], [], []]
+Output:
+[null, null, null, null, null, 1, 3, 4, 2, -1]
+
+Explanation:
+FrontMiddleBackQueue q = new FrontMiddleBackQueue();
+q.pushFront(1); // [1]
+q.pushBack(2); // [1, 2]
+q.pushMiddle(3); // [1, 3, 2]
+q.pushMiddle(4); // [1, 4, 3, 2]
+q.popFront(); // return 1 -> [4, 3, 2]
+q.popMiddle(); // return 3 -> [4, 2]
+q.popMiddle(); // return 4 -> [2]
+q.popBack(); // return 2 -> []
+q.popFront(); // return -1 -> [] (The queue is empty)
+
+```
+
+**Constraints:**
+
+- `1 <= val <= 109`
+- At most `1000` calls will be made to `pushFront`, `pushMiddle`, `pushBack`, `popFront`, `popMiddle`, and `popBack`.
+
+## 题目大意
+
+请你设计一个队列，支持在前，中，后三个位置的 push 和 pop 操作。
+
+请你完成 FrontMiddleBack 类：
+
+- FrontMiddleBack() 初始化队列。
+- void pushFront(int val) 将 val 添加到队列的 最前面 。
+- void pushMiddle(int val) 将 val 添加到队列的 正中间 。
+- void pushBack(int val) 将 val 添加到队里的 最后面 。
+- int popFront() 将 最前面 的元素从队列中删除并返回值，如果删除之前队列为空，那么返回 -1 。
+- int popMiddle() 将 正中间 的元素从队列中删除并返回值，如果删除之前队列为空，那么返回 -1 。
+- int popBack() 将 最后面 的元素从队列中删除并返回值，如果删除之前队列为空，那么返回 -1 。
+
+请注意当有 两个 中间位置的时候，选择靠前面的位置进行操作。比方说：
+
+- 将 6 添加到 [1, 2, 3, 4, 5] 的中间位置，结果数组为 [1, 2, 6, 3, 4, 5] 。
+- 从 [1, 2, 3, 4, 5, 6] 的中间位置弹出元素，返回 3 ，数组变为 [1, 2, 4, 5, 6] 。
+
+## 解题思路
+
+- 简单题，利用 go 原生的双向队列 list 的实现，可以轻松实现这个“前中后队列”。
+- 具体实现见代码，几组特殊测试用例见测试文件。
+
+## 代码
+
+```go
+package leetcode
+
+import (
+ "container/list"
+)
+
+type FrontMiddleBackQueue struct {
+ list *list.List
+ middle *list.Element
+}
+
+func Constructor() FrontMiddleBackQueue {
+ return FrontMiddleBackQueue{list: list.New()}
+}
+
+func (this *FrontMiddleBackQueue) PushFront(val int) {
+ e := this.list.PushFront(val)
+ if this.middle == nil {
+ this.middle = e
+ } else if this.list.Len()%2 == 0 && this.middle.Prev() != nil {
+ this.middle = this.middle.Prev()
+ }
+}
+
+func (this *FrontMiddleBackQueue) PushMiddle(val int) {
+ if this.middle == nil {
+ this.PushFront(val)
+ } else {
+ if this.list.Len()%2 != 0 {
+ this.middle = this.list.InsertBefore(val, this.middle)
+ } else {
+ this.middle = this.list.InsertAfter(val, this.middle)
+ }
+ }
+}
+
+func (this *FrontMiddleBackQueue) PushBack(val int) {
+ e := this.list.PushBack(val)
+ if this.middle == nil {
+ this.middle = e
+ } else if this.list.Len()%2 != 0 && this.middle.Next() != nil {
+ this.middle = this.middle.Next()
+ }
+}
+
+func (this *FrontMiddleBackQueue) PopFront() int {
+ if this.list.Len() == 0 {
+ return -1
+ }
+ e := this.list.Front()
+ if this.list.Len() == 1 {
+ this.middle = nil
+ } else if this.list.Len()%2 == 0 && this.middle.Next() != nil {
+ this.middle = this.middle.Next()
+ }
+ return this.list.Remove(e).(int)
+}
+
+func (this *FrontMiddleBackQueue) PopMiddle() int {
+ if this.middle == nil {
+ return -1
+ }
+ e := this.middle
+ if this.list.Len()%2 != 0 {
+ this.middle = e.Prev()
+ } else {
+ this.middle = e.Next()
+ }
+ return this.list.Remove(e).(int)
+}
+
+func (this *FrontMiddleBackQueue) PopBack() int {
+ if this.list.Len() == 0 {
+ return -1
+ }
+ e := this.list.Back()
+ if this.list.Len() == 1 {
+ this.middle = nil
+ } else if this.list.Len()%2 != 0 && this.middle.Prev() != nil {
+ this.middle = this.middle.Prev()
+ }
+ return this.list.Remove(e).(int)
+}
+
+/**
+ * Your FrontMiddleBackQueue object will be instantiated and called as such:
+ * obj := Constructor();
+ * obj.PushFront(val);
+ * obj.PushMiddle(val);
+ * obj.PushBack(val);
+ * param_4 := obj.PopFront();
+ * param_5 := obj.PopMiddle();
+ * param_6 := obj.PopBack();
+ */
+```
\ No newline at end of file
diff --git a/leetcode/1672.Richest-Customer-Wealth/1672. Richest Customer Wealth.go b/leetcode/1672.Richest-Customer-Wealth/1672. Richest Customer Wealth.go
new file mode 100644
index 000000000..3a851ad99
--- /dev/null
+++ b/leetcode/1672.Richest-Customer-Wealth/1672. Richest Customer Wealth.go
@@ -0,0 +1,15 @@
+package leetcode
+
+func maximumWealth(accounts [][]int) int {
+ res := 0
+ for _, banks := range accounts {
+ sAmount := 0
+ for _, amount := range banks {
+ sAmount += amount
+ }
+ if sAmount > res {
+ res = sAmount
+ }
+ }
+ return res
+}
diff --git a/leetcode/1672.Richest-Customer-Wealth/1672. Richest Customer Wealth_test.go b/leetcode/1672.Richest-Customer-Wealth/1672. Richest Customer Wealth_test.go
new file mode 100644
index 000000000..7c6e689fe
--- /dev/null
+++ b/leetcode/1672.Richest-Customer-Wealth/1672. Richest Customer Wealth_test.go
@@ -0,0 +1,52 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question1672 struct {
+ para1672
+ ans1672
+}
+
+// para 是参数
+// one 代表第一个参数
+type para1672 struct {
+ accounts [][]int
+}
+
+// ans 是答案
+// one 代表第一个答案
+type ans1672 struct {
+ one int
+}
+
+func Test_Problem1672(t *testing.T) {
+
+ qs := []question1672{
+
+ {
+ para1672{[][]int{{1, 2, 3}, {3, 2, 1}}},
+ ans1672{6},
+ },
+
+ {
+ para1672{[][]int{{1, 5}, {7, 3}, {3, 5}}},
+ ans1672{10},
+ },
+
+ {
+ para1672{[][]int{{2, 8, 7}, {7, 1, 3}, {1, 9, 5}}},
+ ans1672{17},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 1672------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans1672, q.para1672
+ fmt.Printf("【input】:%v 【output】:%v\n", p, maximumWealth(p.accounts))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/1672.Richest-Customer-Wealth/README.md b/leetcode/1672.Richest-Customer-Wealth/README.md
new file mode 100644
index 000000000..250cf4805
--- /dev/null
+++ b/leetcode/1672.Richest-Customer-Wealth/README.md
@@ -0,0 +1,72 @@
+# [1672. Richest Customer Wealth](https://leetcode.com/problems/richest-customer-wealth/)
+
+
+## 题目
+
+You are given an `m x n` integer grid `accounts` where `accounts[i][j]` is the amount of money the `ith` customer has in the `jth` bank. Return *the **wealth** that the richest customer has.*
+
+A customer's **wealth** is the amount of money they have in all their bank accounts. The richest customer is the customer that has the maximum **wealth**.
+
+**Example 1:**
+
+```
+Input: accounts = [[1,2,3],[3,2,1]]
+Output: 6
+Explanation:1st customer has wealth = 1 + 2 + 3 = 6
+2nd customer has wealth = 3 + 2 + 1 = 6
+Both customers are considered the richest with a wealth of 6 each, so return 6.
+```
+
+**Example 2:**
+
+```
+Input: accounts = [[1,5],[7,3],[3,5]]
+Output: 10
+Explanation:
+1st customer has wealth = 6
+2nd customer has wealth = 10
+3rd customer has wealth = 8
+The 2nd customer is the richest with a wealth of 10.
+```
+
+**Example 3:**
+
+```
+Input: accounts = [[2,8,7],[7,1,3],[1,9,5]]
+Output: 17
+```
+
+**Constraints:**
+
+- `m == accounts.length`
+- `n == accounts[i].length`
+- `1 <= m, n <= 50`
+- `1 <= accounts[i][j] <= 100`
+
+## 题目大意
+
+给你一个 m x n 的整数网格 accounts ，其中 accounts[i][j] 是第 i 位客户在第 j 家银行托管的资产数量。返回最富有客户所拥有的 资产总量 。客户的 资产总量 就是他们在各家银行托管的资产数量之和。最富有客户就是 资产总量 最大的客户。
+
+## 解题思路
+
+- 简单题。计算二维数组中每个一位数组的元素总和，然后动态维护这些一位数组和的最大值即可。
+
+## 代码
+
+```go
+package leetcode
+
+func maximumWealth(accounts [][]int) int {
+ res := 0
+ for _, banks := range accounts {
+ sAmount := 0
+ for _, amount := range banks {
+ sAmount += amount
+ }
+ if sAmount > res {
+ res = sAmount
+ }
+ }
+ return res
+}
+```
\ No newline at end of file
diff --git a/leetcode/1673.Find-the-Most-Competitive-Subsequence/1673. Find the Most Competitive Subsequence.go b/leetcode/1673.Find-the-Most-Competitive-Subsequence/1673. Find the Most Competitive Subsequence.go
new file mode 100644
index 000000000..04f8fb522
--- /dev/null
+++ b/leetcode/1673.Find-the-Most-Competitive-Subsequence/1673. Find the Most Competitive Subsequence.go
@@ -0,0 +1,13 @@
+package leetcode
+
+// 单调栈
+func mostCompetitive(nums []int, k int) []int {
+ stack := make([]int, 0, len(nums))
+ for i := 0; i < len(nums); i++ {
+ for len(stack)+len(nums)-i > k && len(stack) > 0 && nums[i] < stack[len(stack)-1] {
+ stack = stack[:len(stack)-1]
+ }
+ stack = append(stack, nums[i])
+ }
+ return stack[:k]
+}
diff --git a/leetcode/1673.Find-the-Most-Competitive-Subsequence/1673. Find the Most Competitive Subsequence_test.go b/leetcode/1673.Find-the-Most-Competitive-Subsequence/1673. Find the Most Competitive Subsequence_test.go
new file mode 100644
index 000000000..33f2724d3
--- /dev/null
+++ b/leetcode/1673.Find-the-Most-Competitive-Subsequence/1673. Find the Most Competitive Subsequence_test.go
@@ -0,0 +1,63 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question1673 struct {
+ para1673
+ ans1673
+}
+
+// para 是参数
+// one 代表第一个参数
+type para1673 struct {
+ nums []int
+ k int
+}
+
+// ans 是答案
+// one 代表第一个答案
+type ans1673 struct {
+ one []int
+}
+
+func Test_Problem1673(t *testing.T) {
+
+ qs := []question1673{
+
+ {
+ para1673{[]int{3, 5, 2, 6}, 2},
+ ans1673{[]int{2, 6}},
+ },
+
+ {
+ para1673{[]int{2, 4, 3, 3, 5, 4, 9, 6}, 4},
+ ans1673{[]int{2, 3, 3, 4}},
+ },
+
+ {
+ para1673{[]int{2, 4, 3, 3, 5, 4, 9, 6}, 4},
+ ans1673{[]int{2, 3, 3, 4}},
+ },
+
+ {
+ para1673{[]int{71, 18, 52, 29, 55, 73, 24, 42, 66, 8, 80, 2}, 3},
+ ans1673{[]int{8, 80, 2}},
+ },
+
+ {
+ para1673{[]int{84, 10, 71, 23, 66, 61, 62, 64, 34, 41, 80, 25, 91, 43, 4, 75, 65, 13, 37, 41, 46, 90, 55, 8, 85, 61, 95, 71}, 24},
+ ans1673{[]int{10, 23, 61, 62, 34, 41, 80, 25, 91, 43, 4, 75, 65, 13, 37, 41, 46, 90, 55, 8, 85, 61, 95, 71}},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 1673------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans1673, q.para1673
+ fmt.Printf("【input】:%v 【output】:%v\n", p, mostCompetitive(p.nums, p.k))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/1673.Find-the-Most-Competitive-Subsequence/README.md b/leetcode/1673.Find-the-Most-Competitive-Subsequence/README.md
new file mode 100644
index 000000000..74ced3985
--- /dev/null
+++ b/leetcode/1673.Find-the-Most-Competitive-Subsequence/README.md
@@ -0,0 +1,62 @@
+# [1673. Find the Most Competitive Subsequence](https://leetcode.com/problems/find-the-most-competitive-subsequence/)
+
+
+## 题目
+
+Given an integer array `nums` and a positive integer `k`, return *the most **competitive** subsequence of* `nums` *of size* `k`.
+
+An array's subsequence is a resulting sequence obtained by erasing some (possibly zero) elements from the array.
+
+We define that a subsequence `a` is more **competitive** than a subsequence `b` (of the same length) if in the first position where `a` and `b` differ, subsequence `a` has a number **less** than the corresponding number in `b`. For example, `[1,3,4]` is more competitive than `[1,3,5]` because the first position they differ is at the final number, and `4` is less than `5`.
+
+**Example 1:**
+
+```
+Input: nums = [3,5,2,6], k = 2
+Output: [2,6]
+Explanation: Among the set of every possible subsequence: {[3,5], [3,2], [3,6], [5,2], [5,6], [2,6]}, [2,6] is the most competitive.
+
+```
+
+**Example 2:**
+
+```
+Input: nums = [2,4,3,3,5,4,9,6], k = 4
+Output: [2,3,3,4]
+
+```
+
+**Constraints:**
+
+- `1 <= nums.length <= 105`
+- `0 <= nums[i] <= 109`
+- `1 <= k <= nums.length`
+
+## 题目大意
+
+给你一个整数数组 nums 和一个正整数 k ，返回长度为 k 且最具 竞争力 的 nums 子序列。数组的子序列是从数组中删除一些元素（可能不删除元素）得到的序列。
+
+在子序列 a 和子序列 b 第一个不相同的位置上，如果 a 中的数字小于 b 中对应的数字，那么我们称子序列 a 比子序列 b（相同长度下）更具 竞争力 。 例如，[1,3,4] 比 [1,3,5] 更具竞争力，在第一个不相同的位置，也就是最后一个位置上， 4 小于 5 。
+
+## 解题思路
+
+- 这一题是单调栈的典型题型。利用单调栈，可以保证原数组中元素相对位置不变，这满足题意中删除元素但不移动元素的要求。单调栈又能保证每次进栈，元素是最小的。
+- 类似的题目还有第 42 题，第 84 题，第 496 题，第 503 题，第 856 题，第 901 题，第 907 题，第 1130 题，第 1425 题，第 1673 题。
+
+## 代码
+
+```go
+package leetcode
+
+// 单调栈
+func mostCompetitive(nums []int, k int) []int {
+ stack := make([]int, 0, len(nums))
+ for i := 0; i < len(nums); i++ {
+ for len(stack)+len(nums)-i > k && len(stack) > 0 && nums[i] < stack[len(stack)-1] {
+ stack = stack[:len(stack)-1]
+ }
+ stack = append(stack, nums[i])
+ }
+ return stack[:k]
+}
+```
\ No newline at end of file
diff --git a/leetcode/1674.Minimum-Moves-to-Make-Array-Complementary/1674. Minimum Moves to Make Array Complementary.go b/leetcode/1674.Minimum-Moves-to-Make-Array-Complementary/1674. Minimum Moves to Make Array Complementary.go
new file mode 100644
index 000000000..cd8ef3b42
--- /dev/null
+++ b/leetcode/1674.Minimum-Moves-to-Make-Array-Complementary/1674. Minimum Moves to Make Array Complementary.go
@@ -0,0 +1,34 @@
+package leetcode
+
+func minMoves(nums []int, limit int) int {
+ diff := make([]int, limit*2+2) // nums[i] <= limit, b+limit+1 is maximum limit+limit+1
+ for j := 0; j < len(nums)/2; j++ {
+ a, b := min(nums[j], nums[len(nums)-j-1]), max(nums[j], nums[len(nums)-j-1])
+ // using prefix sum: most interesting point, and is the key to reduce complexity
+ diff[2] += 2
+ diff[a+1]--
+ diff[a+b]--
+ diff[a+b+1]++
+ diff[b+limit+1]++
+ }
+ cur, res := 0, len(nums)
+ for i := 2; i <= 2*limit; i++ {
+ cur += diff[i]
+ res = min(res, cur)
+ }
+ return res
+}
+
+func min(a, b int) int {
+ if a < b {
+ return a
+ }
+ return b
+}
+
+func max(a, b int) int {
+ if a > b {
+ return a
+ }
+ return b
+}
diff --git a/leetcode/1674.Minimum-Moves-to-Make-Array-Complementary/1674. Minimum Moves to Make Array Complementary_test.go b/leetcode/1674.Minimum-Moves-to-Make-Array-Complementary/1674. Minimum Moves to Make Array Complementary_test.go
new file mode 100644
index 000000000..c111bf145
--- /dev/null
+++ b/leetcode/1674.Minimum-Moves-to-Make-Array-Complementary/1674. Minimum Moves to Make Array Complementary_test.go
@@ -0,0 +1,53 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question1674 struct {
+ para1674
+ ans1674
+}
+
+// para 是参数
+// one 代表第一个参数
+type para1674 struct {
+ nums []int
+ limit int
+}
+
+// ans 是答案
+// one 代表第一个答案
+type ans1674 struct {
+ one int
+}
+
+func Test_Problem1674(t *testing.T) {
+
+ qs := []question1674{
+
+ {
+ para1674{[]int{1, 2, 4, 3}, 4},
+ ans1674{1},
+ },
+
+ {
+ para1674{[]int{1, 2, 2, 1}, 2},
+ ans1674{2},
+ },
+
+ {
+ para1674{[]int{1, 2, 1, 2}, 2},
+ ans1674{0},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 1674------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans1674, q.para1674
+ fmt.Printf("【input】:%v 【output】:%v\n", p, minMoves(p.nums, p.limit))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/1674.Minimum-Moves-to-Make-Array-Complementary/README.md b/leetcode/1674.Minimum-Moves-to-Make-Array-Complementary/README.md
new file mode 100644
index 000000000..8e565e10a
--- /dev/null
+++ b/leetcode/1674.Minimum-Moves-to-Make-Array-Complementary/README.md
@@ -0,0 +1,97 @@
+# [1674. Minimum Moves to Make Array Complementary](https://leetcode.com/problems/minimum-moves-to-make-array-complementary/)
+
+## 题目
+
+You are given an integer array `nums` of **even** length `n` and an integer `limit`. In one move, you can replace any integer from `nums` with another integer between `1` and `limit`, inclusive.
+
+The array `nums` is **complementary** if for all indices `i` (**0-indexed**), `nums[i] + nums[n - 1 - i]` equals the same number. For example, the array `[1,2,3,4]` is complementary because for all indices `i`, `nums[i] + nums[n - 1 - i] = 5`.
+
+Return the ***minimum** number of moves required to make* `nums` ***complementary***.
+
+**Example 1:**
+
+```
+Input: nums = [1,2,4,3], limit = 4
+Output: 1
+Explanation: In 1 move, you can change nums to [1,2,2,3] (underlined elements are changed).
+nums[0] + nums[3] = 1 + 3 = 4.
+nums[1] + nums[2] = 2 + 2 = 4.
+nums[2] + nums[1] = 2 + 2 = 4.
+nums[3] + nums[0] = 3 + 1 = 4.
+Therefore, nums[i] + nums[n-1-i] = 4 for every i, so nums is complementary.
+```
+
+**Example 2:**
+
+```
+Input: nums = [1,2,2,1], limit = 2
+Output: 2
+Explanation: In 2 moves, you can change nums to [2,2,2,2]. You cannot change any number to 3 since 3 > limit.
+```
+
+**Example 3:**
+
+```
+Input: nums = [1,2,1,2], limit = 2
+Output: 0
+Explanation: nums is already complementary.
+```
+
+**Constraints:**
+
+- `n == nums.length`
+- `2 <= n <= 105`
+- `1 <= nums[i] <= limit <= 105`
+- `n` is even.
+
+## 题目大意
+
+给你一个长度为 偶数 n 的整数数组 nums 和一个整数 limit 。每一次操作，你可以将 nums 中的任何整数替换为 1 到 limit 之间的另一个整数。
+
+如果对于所有下标 i（下标从 0 开始），nums[i] + nums[n - 1 - i] 都等于同一个数，则数组 nums 是 互补的 。例如，数组 [1,2,3,4] 是互补的，因为对于所有下标 i ，nums[i] + nums[n - 1 - i] = 5 。
+
+返回使数组 互补 的 最少 操作次数。
+
+## 解题思路
+
+- 这一题考察的是差分数组。通过分析题意，可以得出，针对每一个 `sum` 的取值范围是 `[2, 2* limt]`，定义 `a = min(nums[i], nums[n - i - 1])`，`b = max(nums[i], nums[n - i - 1])`，在这个区间内，又可以细分成 5 个区间，`[2, a + 1)`，`[a + 1, a + b)`，`[a + b + 1, a + b + 1)`，`[a + b + 1, b + limit + 1)`，`[b + limit + 1, 2 * limit)`，在这 5 个区间内使得数组互补的最小操作次数分别是 `2(减少 a, 减少 b)`，`1(减少 b)`，`0(不用操作)`，`1(增大 a)`，`+2(增大 a, 增大 b)`，换个表达方式，按照扫描线从左往右扫描，在这 5 个区间内使得数组互补的最小操作次数叠加变化分别是 `+2(减少 a, 减少 b)`，`-1(减少 a)`，`-1(不用操作)`，`+1(增大 a)`，`+1(增大 a, 增大 b)`，利用这前后两个区间的关系，就可以构造一个差分数组。差分数组反应的是前后两者的关系。如果想求得 0 ~ n 的总关系，只需要求一次前缀和即可。
+- 这道题要求输出最少的操作次数，所以利用差分数组 + 前缀和，累加前缀和的同时维护最小值。从左往右扫描完一遍以后，输出最小值即可。
+
+## 代码
+
+```go
+package leetcode
+
+func minMoves(nums []int, limit int) int {
+ diff := make([]int, limit*2+2) // nums[i] <= limit, b+limit+1 is maximum limit+limit+1
+ for j := 0; j < len(nums)/2; j++ {
+ a, b := min(nums[j], nums[len(nums)-j-1]), max(nums[j], nums[len(nums)-j-1])
+ // using prefix sum: most interesting point, and is the key to reduce complexity
+ diff[2] += 2
+ diff[a+1]--
+ diff[a+b]--
+ diff[a+b+1]++
+ diff[b+limit+1]++
+ }
+ cur, res := 0, len(nums)
+ for i := 2; i <= 2*limit; i++ {
+ cur += diff[i]
+ res = min(res, cur)
+ }
+ return res
+}
+
+func min(a, b int) int {
+ if a < b {
+ return a
+ }
+ return b
+}
+
+func max(a, b int) int {
+ if a > b {
+ return a
+ }
+ return b
+}
+```
\ No newline at end of file
diff --git a/leetcode/1675.Minimize-Deviation-in-Array/1675. Minimize Deviation in Array.go b/leetcode/1675.Minimize-Deviation-in-Array/1675. Minimize Deviation in Array.go
new file mode 100644
index 000000000..315b9f855
--- /dev/null
+++ b/leetcode/1675.Minimize-Deviation-in-Array/1675. Minimize Deviation in Array.go
@@ -0,0 +1,40 @@
+package leetcode
+
+func minimumDeviation(nums []int) int {
+ min, max := 0, 0
+ for i := range nums {
+ if nums[i]%2 == 1 {
+ nums[i] *= 2
+ }
+ if i == 0 {
+ min = nums[i]
+ max = nums[i]
+ } else if nums[i] < min {
+ min = nums[i]
+ } else if max < nums[i] {
+ max = nums[i]
+ }
+ }
+ res := max - min
+ for max%2 == 0 {
+ tmax, tmin := 0, 0
+ for i := range nums {
+ if nums[i] == max || (nums[i]%2 == 0 && min <= nums[i]/2) {
+ nums[i] /= 2
+ }
+ if i == 0 {
+ tmin = nums[i]
+ tmax = nums[i]
+ } else if nums[i] < tmin {
+ tmin = nums[i]
+ } else if tmax < nums[i] {
+ tmax = nums[i]
+ }
+ }
+ if tmax-tmin < res {
+ res = tmax - tmin
+ }
+ min, max = tmin, tmax
+ }
+ return res
+}
diff --git a/leetcode/1675.Minimize-Deviation-in-Array/1675. Minimize Deviation in Array_test.go b/leetcode/1675.Minimize-Deviation-in-Array/1675. Minimize Deviation in Array_test.go
new file mode 100644
index 000000000..331acf266
--- /dev/null
+++ b/leetcode/1675.Minimize-Deviation-in-Array/1675. Minimize Deviation in Array_test.go
@@ -0,0 +1,52 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question1675 struct {
+ para1675
+ ans1675
+}
+
+// para 是参数
+// one 代表第一个参数
+type para1675 struct {
+ nums []int
+}
+
+// ans 是答案
+// one 代表第一个答案
+type ans1675 struct {
+ one int
+}
+
+func Test_Problem1675(t *testing.T) {
+
+ qs := []question1675{
+
+ {
+ para1675{[]int{1, 2, 4, 3}},
+ ans1675{1},
+ },
+
+ {
+ para1675{[]int{4, 1, 5, 20, 3}},
+ ans1675{3},
+ },
+
+ {
+ para1675{[]int{2, 10, 8}},
+ ans1675{3},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 1675------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans1675, q.para1675
+ fmt.Printf("【input】:%v 【output】:%v\n", p, minimumDeviation(p.nums))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/1675.Minimize-Deviation-in-Array/README.md b/leetcode/1675.Minimize-Deviation-in-Array/README.md
new file mode 100644
index 000000000..d9e4336d2
--- /dev/null
+++ b/leetcode/1675.Minimize-Deviation-in-Array/README.md
@@ -0,0 +1,105 @@
+# [1675. Minimize Deviation in Array](https://leetcode.com/problems/minimize-deviation-in-array/)
+
+## 题目
+
+You are given an array `nums` of `n` positive integers.
+
+You can perform two types of operations on any element of the array any number of times:
+
+- If the element is **even**, **divide** it by `2`.
+ - For example, if the array is `[1,2,3,4]`, then you can do this operation on the last element, and the array will be `[1,2,3,2].`
+- If the element is **odd**, **multiply** it by `2`.
+ - For example, if the array is `[1,2,3,4]`, then you can do this operation on the first element, and the array will be `[2,2,3,4].`
+
+The **deviation** of the array is the **maximum difference** between any two elements in the array.
+
+Return *the **minimum deviation** the array can have after performing some number of operations.*
+
+**Example 1:**
+
+```
+Input: nums = [1,2,3,4]
+Output: 1
+Explanation: You can transform the array to [1,2,3,2], then to [2,2,3,2], then the deviation will be 3 - 2 = 1.
+```
+
+**Example 2:**
+
+```
+Input: nums = [4,1,5,20,3]
+Output: 3
+Explanation: You can transform the array after two operations to [4,2,5,5,3], then the deviation will be 5 - 2 = 3.
+```
+
+**Example 3:**
+
+```
+Input: nums = [2,10,8]
+Output: 3
+```
+
+**Constraints:**
+
+- `n == nums.length`
+- `2 <= n <= 105`
+- `1 <= nums[i] <= 10^9`
+
+## 题目大意
+
+给你一个由 n 个正整数组成的数组 nums 。你可以对数组的任意元素执行任意次数的两类操作：
+
+- 如果元素是 偶数 ，除以 2。例如，如果数组是 [1,2,3,4] ，那么你可以对最后一个元素执行此操作，使其变成 [1,2,3,2]
+- 如果元素是 奇数 ，乘上 2。例如，如果数组是 [1,2,3,4] ，那么你可以对第一个元素执行此操作，使其变成 [2,2,3,4]
+数组的 偏移量 是数组中任意两个元素之间的 最大差值 。
+
+返回数组在执行某些操作之后可以拥有的 最小偏移量 。
+
+## 解题思路
+
+- 要找到最小偏移量，即需要令最大值变小，最小值变大。要想达到这个要求，需要对奇数偶数做乘法和除法。这里特殊的是，奇数一旦乘以 2 以后，就变成偶数了。偶数除以 2 以后可能是奇数也可能是偶数。所以可以先将所有的奇数都乘以 2 统一变成偶数。
+- 第二轮不断的将最大值除 2，直到最大值为奇数，不能再操作了。每轮循环中把比 min 值大的偶数也都除以 2 。这里除以 2 有 2 个目的，一个目的是将第一步奇数乘 2 还原回去，另一个目的是将本来的偶数除以 2 。可能有人有疑问，为什么只把最大值变小，没有将最小值变大呢？如果最小值是奇数，那么它一定是由上一个偶数除以 2 变过来的，我们在上一个状态已经计算过这个偶数了，因此没必要扩大它；如果最小值是偶数，那么它一定会在某一轮的除 2 操作中，不操作，即它不会满足 `min <= nums[i]/2` 这个条件。每次循环都更新该次循环的最大值和最小值，并记录偏移量。不断的循环，直到最大值为奇数，退出循环。最终输出最小偏移量。
+
+## 代码
+
+```go
+package leetcode
+
+func minimumDeviation(nums []int) int {
+ min, max := 0, 0
+ for i := range nums {
+ if nums[i]%2 == 1 {
+ nums[i] *= 2
+ }
+ if i == 0 {
+ min = nums[i]
+ max = nums[i]
+ } else if nums[i] < min {
+ min = nums[i]
+ } else if max < nums[i] {
+ max = nums[i]
+ }
+ }
+ res := max - min
+ for max%2 == 0 {
+ tmax, tmin := 0, 0
+ for i := range nums {
+ if nums[i] == max || (nums[i]%2 == 0 && min <= nums[i]/2) {
+ nums[i] /= 2
+ }
+ if i == 0 {
+ tmin = nums[i]
+ tmax = nums[i]
+ } else if nums[i] < tmin {
+ tmin = nums[i]
+ } else if tmax < nums[i] {
+ tmax = nums[i]
+ }
+ }
+ if tmax-tmin < res {
+ res = tmax - tmin
+ }
+ min, max = tmin, tmax
+ }
+ return res
+}
+```
\ No newline at end of file
diff --git a/leetcode/1678.Goal-Parser-Interpretation/1678. Goal Parser Interpretation.go b/leetcode/1678.Goal-Parser-Interpretation/1678. Goal Parser Interpretation.go
new file mode 100644
index 000000000..de1612003
--- /dev/null
+++ b/leetcode/1678.Goal-Parser-Interpretation/1678. Goal Parser Interpretation.go
@@ -0,0 +1,22 @@
+package leetcode
+
+func interpret(command string) string {
+ if command == "" {
+ return ""
+ }
+ res := ""
+ for i := 0; i < len(command); i++ {
+ if command[i] == 'G' {
+ res += "G"
+ } else {
+ if command[i] == '(' && command[i+1] == 'a' {
+ res += "al"
+ i += 3
+ } else {
+ res += "o"
+ i++
+ }
+ }
+ }
+ return res
+}
diff --git a/leetcode/1678.Goal-Parser-Interpretation/1678. Goal Parser Interpretation_test.go b/leetcode/1678.Goal-Parser-Interpretation/1678. Goal Parser Interpretation_test.go
new file mode 100644
index 000000000..588368aa5
--- /dev/null
+++ b/leetcode/1678.Goal-Parser-Interpretation/1678. Goal Parser Interpretation_test.go
@@ -0,0 +1,52 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question1678 struct {
+ para1678
+ ans1678
+}
+
+// para 是参数
+// one 代表第一个参数
+type para1678 struct {
+ command string
+}
+
+// ans 是答案
+// one 代表第一个答案
+type ans1678 struct {
+ one string
+}
+
+func Test_Problem1678(t *testing.T) {
+
+ qs := []question1678{
+
+ {
+ para1678{"G()(al)"},
+ ans1678{"Goal"},
+ },
+
+ {
+ para1678{"G()()()()(al)"},
+ ans1678{"Gooooal"},
+ },
+
+ {
+ para1678{"(al)G(al)()()G"},
+ ans1678{"alGalooG"},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 1678------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans1678, q.para1678
+ fmt.Printf("【input】:%v 【output】:%v\n", p, interpret(p.command))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/1678.Goal-Parser-Interpretation/README.md b/leetcode/1678.Goal-Parser-Interpretation/README.md
new file mode 100644
index 000000000..4f8145f4f
--- /dev/null
+++ b/leetcode/1678.Goal-Parser-Interpretation/README.md
@@ -0,0 +1,73 @@
+# [1678. Goal Parser Interpretation](https://leetcode.com/problems/goal-parser-interpretation/)
+
+## 题目
+
+You own a **Goal Parser** that can interpret a string `command`. The `command` consists of an alphabet of `"G"`, `"()"` and/or `"(al)"` in some order. The Goal Parser will interpret `"G"` as the string `"G"`, `"()"` as the string `"o"`, and `"(al)"` as the string `"al"`. The interpreted strings are then concatenated in the original order.
+
+Given the string `command`, return *the **Goal Parser**'s interpretation of* `command`.
+
+**Example 1:**
+
+```
+Input: command = "G()(al)"
+Output: "Goal"
+Explanation: The Goal Parser interprets the command as follows:
+G -> G
+() -> o
+(al) -> al
+The final concatenated result is "Goal".
+```
+
+**Example 2:**
+
+```
+Input: command = "G()()()()(al)"
+Output: "Gooooal"
+```
+
+**Example 3:**
+
+```
+Input: command = "(al)G(al)()()G"
+Output: "alGalooG"
+```
+
+**Constraints:**
+
+- `1 <= command.length <= 100`
+- `command` consists of `"G"`, `"()"`, and/or `"(al)"` in some order.
+
+## 题目大意
+
+请你设计一个可以解释字符串 command 的 Goal 解析器 。command 由 "G"、"()" 和/或 "(al)" 按某种顺序组成。Goal 解析器会将 "G" 解释为字符串 "G"、"()" 解释为字符串 "o" ，"(al)" 解释为字符串 "al" 。然后，按原顺序将经解释得到的字符串连接成一个字符串。给你字符串 command ，返回 Goal 解析器 对 command 的解释结果。
+
+## 解题思路
+
+- 简单题，按照题意修改字符串即可。由于是简单题，这一题也不用考虑嵌套的情况。
+
+## 代码
+
+```go
+package leetcode
+
+func interpret(command string) string {
+ if command == "" {
+ return ""
+ }
+ res := ""
+ for i := 0; i < len(command); i++ {
+ if command[i] == 'G' {
+ res += "G"
+ } else {
+ if command[i] == '(' && command[i+1] == 'a' {
+ res += "al"
+ i += 3
+ } else {
+ res += "o"
+ i ++
+ }
+ }
+ }
+ return res
+}
+```
\ No newline at end of file
diff --git a/leetcode/1679.Max-Number-of-K-Sum-Pairs/1679. Max Number of K-Sum Pairs.go b/leetcode/1679.Max-Number-of-K-Sum-Pairs/1679. Max Number of K-Sum Pairs.go
new file mode 100644
index 000000000..8a601ffac
--- /dev/null
+++ b/leetcode/1679.Max-Number-of-K-Sum-Pairs/1679. Max Number of K-Sum Pairs.go
@@ -0,0 +1,48 @@
+package leetcode
+
+// 解法一 优化版
+func maxOperations(nums []int, k int) int {
+ counter, res := make(map[int]int), 0
+ for _, n := range nums {
+ counter[n]++
+ }
+ if (k & 1) == 0 {
+ res += counter[k>>1] >> 1
+ // 能够由 2 个相同的数构成 k 的组合已经都排除出去了，剩下的一个单独的也不能组成 k 了
+ // 所以这里要把它的频次置为 0 。如果这里不置为 0，下面代码判断逻辑还需要考虑重复使用数字的情况
+ counter[k>>1] = 0
+ }
+ for num, freq := range counter {
+ if num <= k/2 {
+ remain := k - num
+ if counter[remain] < freq {
+ res += counter[remain]
+ } else {
+ res += freq
+ }
+ }
+ }
+ return res
+}
+
+// 解法二
+func maxOperations_(nums []int, k int) int {
+ counter, res := make(map[int]int), 0
+ for _, num := range nums {
+ counter[num]++
+ remain := k - num
+ if num == remain {
+ if counter[num] >= 2 {
+ res++
+ counter[num] -= 2
+ }
+ } else {
+ if counter[remain] > 0 {
+ res++
+ counter[remain]--
+ counter[num]--
+ }
+ }
+ }
+ return res
+}
diff --git a/leetcode/1679.Max-Number-of-K-Sum-Pairs/1679. Max Number of K-Sum Pairs_test.go b/leetcode/1679.Max-Number-of-K-Sum-Pairs/1679. Max Number of K-Sum Pairs_test.go
new file mode 100644
index 000000000..c9a96b2be
--- /dev/null
+++ b/leetcode/1679.Max-Number-of-K-Sum-Pairs/1679. Max Number of K-Sum Pairs_test.go
@@ -0,0 +1,58 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question1679 struct {
+ para1679
+ ans1679
+}
+
+// para 是参数
+// one 代表第一个参数
+type para1679 struct {
+ nums []int
+ k int
+}
+
+// ans 是答案
+// one 代表第一个答案
+type ans1679 struct {
+ one int
+}
+
+func Test_Problem1679(t *testing.T) {
+
+ qs := []question1679{
+
+ {
+ para1679{[]int{1, 2, 3, 4}, 5},
+ ans1679{2},
+ },
+
+ {
+ para1679{[]int{3, 1, 3, 4, 3}, 6},
+ ans1679{1},
+ },
+
+ {
+ para1679{[]int{2, 5, 4, 4, 1, 3, 4, 4, 1, 4, 4, 1, 2, 1, 2, 2, 3, 2, 4, 2}, 3},
+ ans1679{4},
+ },
+
+ {
+ para1679{[]int{2, 5, 5, 5, 1, 3, 4, 4, 1, 4, 4, 1, 3, 1, 3, 1, 3, 2, 4, 2}, 6},
+ ans1679{8},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 1679------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans1679, q.para1679
+ fmt.Printf("【input】:%v 【output】:%v\n", p, maxOperations(p.nums, p.k))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/1679.Max-Number-of-K-Sum-Pairs/README.md b/leetcode/1679.Max-Number-of-K-Sum-Pairs/README.md
new file mode 100644
index 000000000..83ed4b311
--- /dev/null
+++ b/leetcode/1679.Max-Number-of-K-Sum-Pairs/README.md
@@ -0,0 +1,98 @@
+# [1679. Max Number of K-Sum Pairs](https://leetcode.com/problems/max-number-of-k-sum-pairs/)
+
+
+## 题目
+
+You are given an integer array `nums` and an integer `k`.
+
+In one operation, you can pick two numbers from the array whose sum equals `k` and remove them from the array.
+
+Return *the maximum number of operations you can perform on the array*.
+
+**Example 1:**
+
+```
+Input: nums = [1,2,3,4], k = 5
+Output: 2
+Explanation: Starting with nums = [1,2,3,4]:
+- Remove numbers 1 and 4, then nums = [2,3]
+- Remove numbers 2 and 3, then nums = []
+There are no more pairs that sum up to 5, hence a total of 2 operations.
+```
+
+**Example 2:**
+
+```
+Input: nums = [3,1,3,4,3], k = 6
+Output: 1
+Explanation: Starting with nums = [3,1,3,4,3]:
+- Remove the first two 3's, then nums = [1,4,3]
+There are no more pairs that sum up to 6, hence a total of 1 operation.
+```
+
+**Constraints:**
+
+- `1 <= nums.length <= 105`
+- `1 <= nums[i] <= 109`
+- `1 <= k <= 109`
+
+## 题目大意
+
+给你一个整数数组 nums 和一个整数 k 。每一步操作中，你需要从数组中选出和为 k 的两个整数，并将它们移出数组。返回你可以对数组执行的最大操作数。
+
+## 解题思路
+
+- 读完题第一感觉这道题是 TWO SUM 题目的加强版。需要找到所有满足和是 k 的数对。先考虑能不能找到两个数都是 k/2 ，如果能找到多个这样的数，可以先移除他们。其次在利用 TWO SUM 的思路，找出和为 k 的数对。利用 TWO SUM 里面 map 的做法，时间复杂度 O(n)。
+
+## 代码
+
+```go
+package leetcode
+
+// 解法一 优化版
+func maxOperations(nums []int, k int) int {
+ counter, res := make(map[int]int), 0
+ for _, n := range nums {
+ counter[n]++
+ }
+ if (k & 1) == 0 {
+ res += counter[k>>1] >> 1
+ // 能够由 2 个相同的数构成 k 的组合已经都排除出去了，剩下的一个单独的也不能组成 k 了
+ // 所以这里要把它的频次置为 0 。如果这里不置为 0，下面代码判断逻辑还需要考虑重复使用数字的情况
+ counter[k>>1] = 0
+ }
+ for num, freq := range counter {
+ if num <= k/2 {
+ remain := k - num
+ if counter[remain] < freq {
+ res += counter[remain]
+ } else {
+ res += freq
+ }
+ }
+ }
+ return res
+}
+
+// 解法二
+func maxOperations_(nums []int, k int) int {
+ counter, res := make(map[int]int), 0
+ for _, num := range nums {
+ counter[num]++
+ remain := k - num
+ if num == remain {
+ if counter[num] >= 2 {
+ res++
+ counter[num] -= 2
+ }
+ } else {
+ if counter[remain] > 0 {
+ res++
+ counter[remain]--
+ counter[num]--
+ }
+ }
+ }
+ return res
+}
+```
\ No newline at end of file
diff --git a/leetcode/1680.Concatenation-of-Consecutive-Binary-Numbers/1680. Concatenation of Consecutive Binary Numbers.go b/leetcode/1680.Concatenation-of-Consecutive-Binary-Numbers/1680. Concatenation of Consecutive Binary Numbers.go
new file mode 100644
index 000000000..eff4e12b9
--- /dev/null
+++ b/leetcode/1680.Concatenation-of-Consecutive-Binary-Numbers/1680. Concatenation of Consecutive Binary Numbers.go
@@ -0,0 +1,26 @@
+package leetcode
+
+import (
+ "math/bits"
+)
+
+// 解法一 模拟
+func concatenatedBinary(n int) int {
+ res, mod, shift := 0, 1000000007, 0
+ for i := 1; i <= n; i++ {
+ if (i & (i - 1)) == 0 {
+ shift++
+ }
+ res = ((res << shift) + i) % mod
+ }
+ return res
+}
+
+// 解法二 位运算
+func concatenatedBinary1(n int) int {
+ res := 0
+ for i := 1; i <= n; i++ {
+ res = (res<<bits.Len(uint(i)) | i) % (1e9 + 7)
+ }
+ return res
+}
diff --git a/leetcode/1680.Concatenation-of-Consecutive-Binary-Numbers/1680. Concatenation of Consecutive Binary Numbers_test.go b/leetcode/1680.Concatenation-of-Consecutive-Binary-Numbers/1680. Concatenation of Consecutive Binary Numbers_test.go
new file mode 100644
index 000000000..88cebf974
--- /dev/null
+++ b/leetcode/1680.Concatenation-of-Consecutive-Binary-Numbers/1680. Concatenation of Consecutive Binary Numbers_test.go
@@ -0,0 +1,72 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question1680 struct {
+ para1680
+ ans1680
+}
+
+// para 是参数
+// one 代表第一个参数
+type para1680 struct {
+ n int
+}
+
+// ans 是答案
+// one 代表第一个答案
+type ans1680 struct {
+ one int
+}
+
+func Test_Problem1680(t *testing.T) {
+
+ qs := []question1680{
+
+ {
+ para1680{1},
+ ans1680{1},
+ },
+
+ {
+ para1680{3},
+ ans1680{27},
+ },
+
+ {
+ para1680{12},
+ ans1680{505379714},
+ },
+
+ {
+ para1680{42},
+ ans1680{727837408},
+ },
+
+ {
+ para1680{24},
+ ans1680{385951001},
+ },
+
+ {
+ para1680{81},
+ ans1680{819357292},
+ },
+
+ {
+ para1680{66},
+ ans1680{627730462},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 1680------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans1680, q.para1680
+ fmt.Printf("【input】:%v 【output】:%v\n", p, concatenatedBinary(p.n))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/1680.Concatenation-of-Consecutive-Binary-Numbers/README.md b/leetcode/1680.Concatenation-of-Consecutive-Binary-Numbers/README.md
new file mode 100644
index 000000000..b43a3e664
--- /dev/null
+++ b/leetcode/1680.Concatenation-of-Consecutive-Binary-Numbers/README.md
@@ -0,0 +1,95 @@
+# [1680. Concatenation of Consecutive Binary Numbers](https://leetcode.com/problems/concatenation-of-consecutive-binary-numbers/)
+
+
+## 题目
+
+Given an integer `n`, return *the **decimal value** of the binary string formed by concatenating the binary representations of* `1` *to* `n` *in order, **modulo*** `109 + 7`.
+
+**Example 1:**
+
+```
+Input: n = 1
+Output: 1
+Explanation: "1" in binary corresponds to the decimal value 1.
+```
+
+**Example 2:**
+
+```
+Input: n = 3
+Output: 27
+Explanation: In binary, 1, 2, and 3 corresponds to "1", "10", and "11".
+After concatenating them, we have "11011", which corresponds to the decimal value 27.
+```
+
+**Example 3:**
+
+```
+Input: n = 12
+Output: 505379714
+Explanation: The concatenation results in "1101110010111011110001001101010111100".
+The decimal value of that is 118505380540.
+After modulo 109 + 7, the result is 505379714.
+```
+
+**Constraints:**
+
+- `1 <= n <= 10^5`
+
+## 题目大意
+
+给你一个整数 n ，请你将 1 到 n 的二进制表示连接起来，并返回连接结果对应的 十进制 数字对 10^9 + 7 取余的结果。
+
+## 解题思路
+
+- 理解题意以后，先找到如何拼接最终二进制数的规律。假设 `f(n)` 为最终变换以后的十进制数。那么根据题意，`f(n) = f(n-1) << shift + n` 这是一个递推公式。`shift` 左移的位数就是 `n` 的二进制对应的长度。`shift` 的值是随着 `n` 变化而变化的。由二进制进位规律可以知道，2 的整数次幂的时候，对应的二进制长度会增加 1 位。这里可以利用位运算来判断是否是 2 的整数次幂。
+- 这道题另外一个需要处理的是模运算的法则。此题需要用到模运算的加法法则。
+
+ ```go
+ 模运算与基本四则运算有些相似，但是除法例外。
+ (a + b) % p = (a % p + b % p) % p （1）
+ (a - b) % p = (a % p - b % p) % p （2）
+ (a * b) % p = (a % p * b % p) % p （3）
+ a ^ b % p = ((a % p)^b) % p （4）
+ 结合律：
+ ((a+b) % p + c) % p = (a + (b+c) % p) % p （5）
+ ((a*b) % p * c)% p = (a * (b*c) % p) % p （6）
+ 交换律：
+ (a + b) % p = (b+a) % p （7）
+ (a * b) % p = (b * a) % p （8）
+ 分配律：
+ ((a +b)% p * c) % p = ((a * c) % p + (b * c) % p) % p （9）
+ ```
+
+ 这一题需要用到模运算的加法运算法则。
+
+## 代码
+
+```go
+package leetcode
+
+import (
+ "math/bits"
+)
+
+// 解法一 模拟
+func concatenatedBinary(n int) int {
+ res, mod, shift := 0, 1000000007, 0
+ for i := 1; i <= n; i++ {
+ if (i & (i - 1)) == 0 {
+ shift++
+ }
+ res = ((res << shift) + i) % mod
+ }
+ return res
+}
+
+// 解法二 位运算
+func concatenatedBinary1(n int) int {
+ res := 0
+ for i := 1; i <= n; i++ {
+ res = (res<<bits.Len(uint(i)) | i) % (1e9 + 7)
+ }
+ return res
+}
+```
\ No newline at end of file
diff --git a/leetcode/1681.Minimum-Incompatibility/1681. Minimum Incompatibility.go b/leetcode/1681.Minimum-Incompatibility/1681. Minimum Incompatibility.go
new file mode 100644
index 000000000..88b465d26
--- /dev/null
+++ b/leetcode/1681.Minimum-Incompatibility/1681. Minimum Incompatibility.go
@@ -0,0 +1,58 @@
+package leetcode
+
+import (
+ "math"
+ "sort"
+)
+
+func minimumIncompatibility(nums []int, k int) int {
+ sort.Ints(nums)
+ eachSize, counts := len(nums)/k, make([]int, len(nums)+1)
+ for i := range nums {
+ counts[nums[i]]++
+ if counts[nums[i]] > k {
+ return -1
+ }
+ }
+ orders := []int{}
+ for i := range counts {
+ orders = append(orders, i)
+ }
+ sort.Ints(orders)
+ res := math.MaxInt32
+ generatePermutation1681(nums, counts, orders, 0, 0, eachSize, &res, []int{})
+ if res == math.MaxInt32 {
+ return -1
+ }
+ return res
+}
+
+func generatePermutation1681(nums, counts, order []int, index, sum, eachSize int, res *int, current []int) {
+ if len(current) > 0 && len(current)%eachSize == 0 {
+ sum += current[len(current)-1] - current[len(current)-eachSize]
+ index = 0
+ }
+ if sum >= *res {
+ return
+ }
+ if len(current) == len(nums) {
+ if sum < *res {
+ *res = sum
+ }
+ return
+ }
+ for i := index; i < len(counts); i++ {
+ if counts[order[i]] == 0 {
+ continue
+ }
+ counts[order[i]]--
+ current = append(current, order[i])
+ generatePermutation1681(nums, counts, order, i+1, sum, eachSize, res, current)
+ current = current[:len(current)-1]
+ counts[order[i]]++
+ // 这里是关键的剪枝
+ if index == 0 {
+ break
+ }
+ }
+}
diff --git a/leetcode/1681.Minimum-Incompatibility/1681. Minimum Incompatibility_test.go b/leetcode/1681.Minimum-Incompatibility/1681. Minimum Incompatibility_test.go
new file mode 100644
index 000000000..903c963b9
--- /dev/null
+++ b/leetcode/1681.Minimum-Incompatibility/1681. Minimum Incompatibility_test.go
@@ -0,0 +1,53 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question1681 struct {
+ para1681
+ ans1681
+}
+
+// para 是参数
+// one 代表第一个参数
+type para1681 struct {
+ nums []int
+ k int
+}
+
+// ans 是答案
+// one 代表第一个答案
+type ans1681 struct {
+ one int
+}
+
+func Test_Problem1681(t *testing.T) {
+
+ qs := []question1681{
+
+ {
+ para1681{[]int{1, 2, 1, 4}, 2},
+ ans1681{4},
+ },
+
+ {
+ para1681{[]int{6, 3, 8, 1, 3, 1, 2, 2}, 4},
+ ans1681{6},
+ },
+
+ {
+ para1681{[]int{5, 3, 3, 6, 3, 3}, 3},
+ ans1681{-1},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 1681------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans1681, q.para1681
+ fmt.Printf("【input】:%v 【output】:%v\n", p, minimumIncompatibility(p.nums, p.k))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/1681.Minimum-Incompatibility/README.md b/leetcode/1681.Minimum-Incompatibility/README.md
new file mode 100644
index 000000000..e2f5dc1dc
--- /dev/null
+++ b/leetcode/1681.Minimum-Incompatibility/README.md
@@ -0,0 +1,122 @@
+# [1681. Minimum Incompatibility](https://leetcode.com/problems/minimum-incompatibility/)
+
+
+## 题目
+
+You are given an integer array `nums` and an integer `k`. You are asked to distribute this array into `k` subsets of **equal size** such that there are no two equal elements in the same subset.
+
+A subset's **incompatibility** is the difference between the maximum and minimum elements in that array.
+
+Return *the **minimum possible sum of incompatibilities** of the* `k` *subsets after distributing the array optimally, or return* `-1` *if it is not possible.*
+
+A subset is a group integers that appear in the array with no particular order.
+
+**Example 1:**
+
+```
+Input: nums = [1,2,1,4], k = 2
+Output: 4
+Explanation: The optimal distribution of subsets is [1,2] and [1,4].
+The incompatibility is (2-1) + (4-1) = 4.
+Note that [1,1] and [2,4] would result in a smaller sum, but the first subset contains 2 equal elements.
+```
+
+**Example 2:**
+
+```
+Input: nums = [6,3,8,1,3,1,2,2], k = 4
+Output: 6
+Explanation: The optimal distribution of subsets is [1,2], [2,3], [6,8], and [1,3].
+The incompatibility is (2-1) + (3-2) + (8-6) + (3-1) = 6.
+
+```
+
+**Example 3:**
+
+```
+Input: nums = [5,3,3,6,3,3], k = 3
+Output: -1
+Explanation: It is impossible to distribute nums into 3 subsets where no two elements are equal in the same subset.
+
+```
+
+**Constraints:**
+
+- `1 <= k <= nums.length <= 16`
+- `nums.length` is divisible by `k`
+- `1 <= nums[i] <= nums.length`
+
+## 题目大意
+
+给你一个整数数组 nums 和一个整数 k 。你需要将这个数组划分到 k 个相同大小的子集中，使得同一个子集里面没有两个相同的元素。一个子集的 不兼容性 是该子集里面最大值和最小值的差。
+
+请你返回将数组分成 k 个子集后，各子集 **不兼容性** 的 **和** 的 **最小值** ，如果无法分成分成 k 个子集，返回 -1 。子集的定义是数组中一些数字的集合，对数字顺序没有要求。
+
+## 解题思路
+
+- 读完题最直白的思路就是 DFS。做法类似第 77 题。这里就不赘述了。可以见第 77 题题解。
+- 这一题还需要用到贪心的思想。每次取数都取最小的数。这样可以不会让最大数和最小数在一个集合中。由于每次取数都是取最小的，那么能保证不兼容性每次都尽量最小。于是在 order 数组中定义取数的顺序。然后再把数组从小到大排列。这样每次按照 order 顺序取数，都是取的最小值。
+- 正常的 DFS 写完提交，耗时是很长的。大概是 1532ms。如何优化到极致呢？这里需要加上 2 个剪枝条件。第一个剪枝条件比较简单，如果累计 sum 比之前存储的 res 大，那么直接 return，不需要继续递归了。第二个剪枝条件就非常重要了，可以一下子减少很多次递归。每次取数产生新的集合的时候，要从第一个最小数开始取，一旦取了，后面就不需要再循环递归了。举个例子，[1,2,3,4]，第一个数如果取 2，集合可以是 [[2,3],[1,4]] 或 [[2,4], [1,3]], 这个集合和[[1,3],[2,4]]、[[1,4], [2,3]] 情况一样。可以看到如果取出第一个最小值以后，后面的循环是不必要的了。所以在取下标为 0 的数的时候，递归到底层以后，返回就可以直接 break，不用接下去的循环了，接下去的循环和递归是不必要的。每组组内的顺序我们并不关心，只要最大值和最小值在分组内即可。另外组间顺序我们也不关心。所以可以把排列问题 O(n!) 时间复杂度降低到组合问题 O(2^n)。加了这 2 个剪枝条件以后，耗时就变成了 0ms 了。beats 100%
+
+## 代码
+
+```go
+package leetcode
+
+import (
+ "math"
+ "sort"
+)
+
+func minimumIncompatibility(nums []int, k int) int {
+ sort.Ints(nums)
+ eachSize, counts := len(nums)/k, make([]int, len(nums)+1)
+ for i := range nums {
+ counts[nums[i]]++
+ if counts[nums[i]] > k {
+ return -1
+ }
+ }
+ orders := []int{}
+ for i := range counts {
+ orders = append(orders, i)
+ }
+ sort.Ints(orders)
+ res := math.MaxInt32
+ generatePermutation1681(nums, counts, orders, 0, 0, eachSize, &res, []int{})
+ if res == math.MaxInt32 {
+ return -1
+ }
+ return res
+}
+
+func generatePermutation1681(nums, counts, order []int, index, sum, eachSize int, res *int, current []int) {
+ if len(current) > 0 && len(current)%eachSize == 0 {
+ sum += current[len(current)-1] - current[len(current)-eachSize]
+ index = 0
+ }
+ if sum >= *res {
+ return
+ }
+ if len(current) == len(nums) {
+ if sum < *res {
+ *res = sum
+ }
+ return
+ }
+ for i := index; i < len(counts); i++ {
+ if counts[order[i]] == 0 {
+ continue
+ }
+ counts[order[i]]--
+ current = append(current, order[i])
+ generatePermutation1681(nums, counts, order, i+1, sum, eachSize, res, current)
+ current = current[:len(current)-1]
+ counts[order[i]]++
+ // 这里是关键的剪枝
+ if index == 0 {
+ break
+ }
+ }
+}
+```
\ No newline at end of file
diff --git a/leetcode/1684.Count-the-Number-of-Consistent-Strings/1684. Count the Number of Consistent Strings.go b/leetcode/1684.Count-the-Number-of-Consistent-Strings/1684. Count the Number of Consistent Strings.go
new file mode 100644
index 000000000..80b40a082
--- /dev/null
+++ b/leetcode/1684.Count-the-Number-of-Consistent-Strings/1684. Count the Number of Consistent Strings.go
@@ -0,0 +1,21 @@
+package leetcode
+
+func countConsistentStrings(allowed string, words []string) int {
+ allowedMap, res, flag := map[rune]int{}, 0, true
+ for _, str := range allowed {
+ allowedMap[str]++
+ }
+ for i := 0; i < len(words); i++ {
+ flag = true
+ for j := 0; j < len(words[i]); j++ {
+ if _, ok := allowedMap[rune(words[i][j])]; !ok {
+ flag = false
+ break
+ }
+ }
+ if flag {
+ res++
+ }
+ }
+ return res
+}
diff --git a/leetcode/1684.Count-the-Number-of-Consistent-Strings/1684. Count the Number of Consistent Strings_test.go b/leetcode/1684.Count-the-Number-of-Consistent-Strings/1684. Count the Number of Consistent Strings_test.go
new file mode 100644
index 000000000..c94501b6d
--- /dev/null
+++ b/leetcode/1684.Count-the-Number-of-Consistent-Strings/1684. Count the Number of Consistent Strings_test.go
@@ -0,0 +1,53 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question1684 struct {
+ para1684
+ ans1684
+}
+
+// para 是参数
+// one 代表第一个参数
+type para1684 struct {
+ allowed string
+ words []string
+}
+
+// ans 是答案
+// one 代表第一个答案
+type ans1684 struct {
+ one int
+}
+
+func Test_Problem1684(t *testing.T) {
+
+ qs := []question1684{
+
+ {
+ para1684{"ab", []string{"ad", "bd", "aaab", "baa", "badab"}},
+ ans1684{2},
+ },
+
+ {
+ para1684{"abc", []string{"a", "b", "c", "ab", "ac", "bc", "abc"}},
+ ans1684{7},
+ },
+
+ {
+ para1684{"cad", []string{"cc", "acd", "b", "ba", "bac", "bad", "ac", "d"}},
+ ans1684{4},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 1684------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans1684, q.para1684
+ fmt.Printf("【input】:%v 【output】:%v\n", p, countConsistentStrings(p.allowed, p.words))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/1684.Count-the-Number-of-Consistent-Strings/README.md b/leetcode/1684.Count-the-Number-of-Consistent-Strings/README.md
new file mode 100644
index 000000000..85a779c83
--- /dev/null
+++ b/leetcode/1684.Count-the-Number-of-Consistent-Strings/README.md
@@ -0,0 +1,79 @@
+# [1684. Count the Number of Consistent Strings](https://leetcode.com/problems/count-the-number-of-consistent-strings/)
+
+
+## 题目
+
+You are given a string `allowed` consisting of **distinct** characters and an array of strings `words`. A string is **consistent** if all characters in the string appear in the string `allowed`.
+
+Return *the number of **consistent** strings in the array* `words`.
+
+**Example 1:**
+
+```
+Input: allowed = "ab", words = ["ad","bd","aaab","baa","badab"]
+Output: 2
+Explanation: Strings "aaab" and "baa" are consistent since they only contain characters 'a' and 'b'.
+
+```
+
+**Example 2:**
+
+```
+Input: allowed = "abc", words = ["a","b","c","ab","ac","bc","abc"]
+Output: 7
+Explanation: All strings are consistent.
+
+```
+
+**Example 3:**
+
+```
+Input: allowed = "cad", words = ["cc","acd","b","ba","bac","bad","ac","d"]
+Output: 4
+Explanation: Strings "cc", "acd", "ac", and "d" are consistent.
+
+```
+
+**Constraints:**
+
+- `1 <= words.length <= 104`
+- `1 <= allowed.length <= 26`
+- `1 <= words[i].length <= 10`
+- The characters in `allowed` are **distinct**.
+- `words[i]` and `allowed` contain only lowercase English letters.
+
+## 题目大意
+
+给你一个由不同字符组成的字符串 `allowed` 和一个字符串数组 `words` 。如果一个字符串的每一个字符都在 `allowed` 中，就称这个字符串是 一致字符串 。
+
+请你返回 `words` 数组中 一致字符串 的数目。
+
+## 解题思路
+
+- 简单题。先将 `allowed` 转化成 map。将 `words` 数组中每个单词的字符都在 map 中查找一遍，如果都存在就累加 res。如果有不存在的字母，不累加。最终输出 res 即可。
+
+## 代码
+
+```go
+package leetcode
+
+func countConsistentStrings(allowed string, words []string) int {
+ allowedMap, res, flag := map[rune]int{}, 0, true
+ for _, str := range allowed {
+ allowedMap[str]++
+ }
+ for i := 0; i < len(words); i++ {
+ flag = true
+ for j := 0; j < len(words[i]); j++ {
+ if _, ok := allowedMap[rune(words[i][j])]; !ok {
+ flag = false
+ break
+ }
+ }
+ if flag {
+ res++
+ }
+ }
+ return res
+}
+```
\ No newline at end of file
diff --git a/leetcode/1685.Sum-of-Absolute-Differences-in-a-Sorted-Array/1685. Sum of Absolute Differences in a Sorted Array.go b/leetcode/1685.Sum-of-Absolute-Differences-in-a-Sorted-Array/1685. Sum of Absolute Differences in a Sorted Array.go
new file mode 100644
index 000000000..15656d39b
--- /dev/null
+++ b/leetcode/1685.Sum-of-Absolute-Differences-in-a-Sorted-Array/1685. Sum of Absolute Differences in a Sorted Array.go
@@ -0,0 +1,42 @@
+package leetcode
+
+// 解法一 优化版 prefixSum + sufixSum
+func getSumAbsoluteDifferences(nums []int) []int {
+ size := len(nums)
+ sufixSum := make([]int, size)
+ sufixSum[size-1] = nums[size-1]
+ for i := size - 2; i >= 0; i-- {
+ sufixSum[i] = sufixSum[i+1] + nums[i]
+ }
+ ans, preSum := make([]int, size), 0
+ for i := 0; i < size; i++ {
+ // 后面可以加到的值
+ res, sum := 0, sufixSum[i]-nums[i]
+ res += (sum - (size-i-1)*nums[i])
+ // 前面可以加到的值
+ res += (i*nums[i] - preSum)
+ ans[i] = res
+ preSum += nums[i]
+ }
+ return ans
+}
+
+// 解法二 prefixSum
+func getSumAbsoluteDifferences1(nums []int) []int {
+ preSum, res, sum := []int{}, []int{}, nums[0]
+ preSum = append(preSum, nums[0])
+ for i := 1; i < len(nums); i++ {
+ sum += nums[i]
+ preSum = append(preSum, sum)
+ }
+ for i := 0; i < len(nums); i++ {
+ if i == 0 {
+ res = append(res, preSum[len(nums)-1]-preSum[0]-nums[i]*(len(nums)-1))
+ } else if i > 0 && i < len(nums)-1 {
+ res = append(res, preSum[len(nums)-1]-preSum[i]-preSum[i-1]+nums[i]*i-nums[i]*(len(nums)-1-i))
+ } else {
+ res = append(res, nums[i]*len(nums)-preSum[len(nums)-1])
+ }
+ }
+ return res
+}
diff --git a/leetcode/1685.Sum-of-Absolute-Differences-in-a-Sorted-Array/1685. Sum of Absolute Differences in a Sorted Array_test.go b/leetcode/1685.Sum-of-Absolute-Differences-in-a-Sorted-Array/1685. Sum of Absolute Differences in a Sorted Array_test.go
new file mode 100644
index 000000000..70ba45b46
--- /dev/null
+++ b/leetcode/1685.Sum-of-Absolute-Differences-in-a-Sorted-Array/1685. Sum of Absolute Differences in a Sorted Array_test.go
@@ -0,0 +1,47 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question1685 struct {
+ para1685
+ ans1685
+}
+
+// para 是参数
+// one 代表第一个参数
+type para1685 struct {
+ nums []int
+}
+
+// ans 是答案
+// one 代表第一个答案
+type ans1685 struct {
+ one []int
+}
+
+func Test_Problem1685(t *testing.T) {
+
+ qs := []question1685{
+
+ {
+ para1685{[]int{2, 3, 5}},
+ ans1685{[]int{4, 3, 5}},
+ },
+
+ {
+ para1685{[]int{1, 4, 6, 8, 10}},
+ ans1685{[]int{24, 15, 13, 15, 21}},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 1685------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans1685, q.para1685
+ fmt.Printf("【input】:%v 【output】:%v\n", p, getSumAbsoluteDifferences(p.nums))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/1685.Sum-of-Absolute-Differences-in-a-Sorted-Array/README.md b/leetcode/1685.Sum-of-Absolute-Differences-in-a-Sorted-Array/README.md
new file mode 100644
index 000000000..2de2fe4c4
--- /dev/null
+++ b/leetcode/1685.Sum-of-Absolute-Differences-in-a-Sorted-Array/README.md
@@ -0,0 +1,88 @@
+# [1685. Sum of Absolute Differences in a Sorted Array](https://leetcode.com/problems/sum-of-absolute-differences-in-a-sorted-array/)
+
+
+## 题目
+
+You are given an integer array `nums` sorted in **non-decreasing** order.
+
+Build and return *an integer array* `result` *with the same length as* `nums` *such that* `result[i]` *is equal to the **summation of absolute differences** between* `nums[i]` *and all the other elements in the array.*
+
+In other words, `result[i]` is equal to `sum(|nums[i]-nums[j]|)` where `0 <= j < nums.length` and `j != i` (**0-indexed**).
+
+**Example 1:**
+
+```
+Input: nums = [2,3,5]
+Output: [4,3,5]
+Explanation: Assuming the arrays are 0-indexed, then
+result[0] = |2-2| + |2-3| + |2-5| = 0 + 1 + 3 = 4,
+result[1] = |3-2| + |3-3| + |3-5| = 1 + 0 + 2 = 3,
+result[2] = |5-2| + |5-3| + |5-5| = 3 + 2 + 0 = 5.
+```
+
+**Example 2:**
+
+```
+Input: nums = [1,4,6,8,10]
+Output: [24,15,13,15,21]
+```
+
+**Constraints:**
+
+- `2 <= nums.length <= 105`
+- `1 <= nums[i] <= nums[i + 1] <= 104`
+
+## 题目大意
+
+给你一个 非递减 有序整数数组 `nums` 。请你建立并返回一个整数数组 `result`，它跟 `nums` 长度相同，且`result[i]` 等于 `nums[i]` 与数组中所有其他元素差的绝对值之和。换句话说， `result[i]` 等于 `sum(|nums[i]-nums[j]|)` ，其中 `0 <= j < nums.length` 且 `j != i` （下标从 0 开始）。
+
+## 解题思路
+
+- 利用前缀和思路解题。题目中说明了是有序数组，所以在计算绝对值的时候可以拆开绝对值符号。假设要计算当前 `result[i]`，以 `i` 为界，把原数组 `nums` 分成了 3 段。`nums[0 ~ i-1]` 和 `nums[i+1 ~ n]`，前面一段 `nums[0 ~ i-1]` 中的每个元素都比 `nums[i]` 小，拆掉绝对值以后，`sum(|nums[i]-nums[j]|) = nums[i] * i - prefixSum[0 ~ i-1]`，后面一段 `nums[i+1 ~ n]` 中的每个元素都比 `nums[i]` 大，拆掉绝对值以后，`sum(|nums[i]-nums[j]|) = prefixSum[i+1 ~ n] - nums[i] * (n - 1 - i)`。特殊的情况，`i = 0` 和 `i = n` 的情况特殊处理一下就行。
+
+## 代码
+
+```go
+package leetcode
+
+//解法一 优化版 prefixSum + sufixSum
+func getSumAbsoluteDifferences(nums []int) []int {
+ size := len(nums)
+ sufixSum := make([]int, size)
+ sufixSum[size-1] = nums[size-1]
+ for i := size - 2; i >= 0; i-- {
+ sufixSum[i] = sufixSum[i+1] + nums[i]
+ }
+ ans, preSum := make([]int, size), 0
+ for i := 0; i < size; i++ {
+ // 后面可以加到的值
+ res, sum := 0, sufixSum[i]-nums[i]
+ res += (sum - (size-i-1)*nums[i])
+ // 前面可以加到的值
+ res += (i*nums[i] - preSum)
+ ans[i] = res
+ preSum += nums[i]
+ }
+ return ans
+}
+
+// 解法二 prefixSum
+func getSumAbsoluteDifferences1(nums []int) []int {
+ preSum, res, sum := []int{}, []int{}, nums[0]
+ preSum = append(preSum, nums[0])
+ for i := 1; i < len(nums); i++ {
+ sum += nums[i]
+ preSum = append(preSum, sum)
+ }
+ for i := 0; i < len(nums); i++ {
+ if i == 0 {
+ res = append(res, preSum[len(nums)-1]-preSum[0]-nums[i]*(len(nums)-1))
+ } else if i > 0 && i < len(nums)-1 {
+ res = append(res, preSum[len(nums)-1]-preSum[i]-preSum[i-1]+nums[i]*i-nums[i]*(len(nums)-1-i))
+ } else {
+ res = append(res, nums[i]*len(nums)-preSum[len(nums)-1])
+ }
+ }
+ return res
+}
+```
\ No newline at end of file
diff --git a/leetcode/1688.Count-of-Matches-in-Tournament/1688. Count of Matches in Tournament.go b/leetcode/1688.Count-of-Matches-in-Tournament/1688. Count of Matches in Tournament.go
new file mode 100644
index 000000000..67c8ac65b
--- /dev/null
+++ b/leetcode/1688.Count-of-Matches-in-Tournament/1688. Count of Matches in Tournament.go
@@ -0,0 +1,21 @@
+package leetcode
+
+// 解法一
+func numberOfMatches(n int) int {
+ return n - 1
+}
+
+// 解法二 模拟
+func numberOfMatches1(n int) int {
+ sum := 0
+ for n != 1 {
+ if n&1 == 0 {
+ sum += n / 2
+ n = n / 2
+ } else {
+ sum += (n - 1) / 2
+ n = (n-1)/2 + 1
+ }
+ }
+ return sum
+}
diff --git a/leetcode/1688.Count-of-Matches-in-Tournament/1688. Count of Matches in Tournament_test.go b/leetcode/1688.Count-of-Matches-in-Tournament/1688. Count of Matches in Tournament_test.go
new file mode 100644
index 000000000..71e60e594
--- /dev/null
+++ b/leetcode/1688.Count-of-Matches-in-Tournament/1688. Count of Matches in Tournament_test.go
@@ -0,0 +1,47 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question1688 struct {
+ para1688
+ ans1688
+}
+
+// para 是参数
+// one 代表第一个参数
+type para1688 struct {
+ n int
+}
+
+// ans 是答案
+// one 代表第一个答案
+type ans1688 struct {
+ one int
+}
+
+func Test_Problem1688(t *testing.T) {
+
+ qs := []question1688{
+
+ {
+ para1688{7},
+ ans1688{6},
+ },
+
+ {
+ para1688{14},
+ ans1688{13},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 1688------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans1688, q.para1688
+ fmt.Printf("【input】:%v 【output】:%v\n", p, numberOfMatches(p.n))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/1688.Count-of-Matches-in-Tournament/README.md b/leetcode/1688.Count-of-Matches-in-Tournament/README.md
new file mode 100644
index 000000000..b9b5f0a92
--- /dev/null
+++ b/leetcode/1688.Count-of-Matches-in-Tournament/README.md
@@ -0,0 +1,80 @@
+# [1688. Count of Matches in Tournament](https://leetcode.com/problems/count-of-matches-in-tournament/)
+
+
+## 题目
+
+You are given an integer `n`, the number of teams in a tournament that has strange rules:
+
+- If the current number of teams is **even**, each team gets paired with another team. A total of `n / 2` matches are played, and `n / 2` teams advance to the next round.
+- If the current number of teams is **odd**, one team randomly advances in the tournament, and the rest gets paired. A total of `(n - 1) / 2` matches are played, and `(n - 1) / 2 + 1` teams advance to the next round.
+
+Return *the number of matches played in the tournament until a winner is decided.*
+
+**Example 1:**
+
+```
+Input: n = 7
+Output: 6
+Explanation: Details of the tournament:
+- 1st Round: Teams = 7, Matches = 3, and 4 teams advance.
+- 2nd Round: Teams = 4, Matches = 2, and 2 teams advance.
+- 3rd Round: Teams = 2, Matches = 1, and 1 team is declared the winner.
+Total number of matches = 3 + 2 + 1 = 6.
+```
+
+**Example 2:**
+
+```
+Input: n = 14
+Output: 13
+Explanation: Details of the tournament:
+- 1st Round: Teams = 14, Matches = 7, and 7 teams advance.
+- 2nd Round: Teams = 7, Matches = 3, and 4 teams advance.
+- 3rd Round: Teams = 4, Matches = 2, and 2 teams advance.
+- 4th Round: Teams = 2, Matches = 1, and 1 team is declared the winner.
+Total number of matches = 7 + 3 + 2 + 1 = 13.
+```
+
+**Constraints:**
+
+- `1 <= n <= 200`
+
+## 题目大意
+
+给你一个整数 n ，表示比赛中的队伍数。比赛遵循一种独特的赛制：
+
+- 如果当前队伍数是 偶数 ，那么每支队伍都会与另一支队伍配对。总共进行 n / 2 场比赛，且产生 n / 2 支队伍进入下一轮。
+- 如果当前队伍数为 奇数 ，那么将会随机轮空并晋级一支队伍，其余的队伍配对。总共进行 (n - 1) / 2 场比赛，且产生 (n - 1) / 2 + 1 支队伍进入下一轮。
+
+返回在比赛中进行的配对次数，直到决出获胜队伍为止。
+
+## 解题思路
+
+- 简单题，按照题目的规则模拟。
+- 这一题还有更加简洁的代码，见解法一。n 个队伍，一个冠军，需要淘汰 n-1 个队伍。每一场比赛淘汰一个队伍，因此进行了 n-1 场比赛。所以共有 n-1 个配对。
+
+## 代码
+
+```go
+package leetcode
+
+// 解法一
+func numberOfMatches(n int) int {
+ return n - 1
+}
+
+// 解法二 模拟
+func numberOfMatches1(n int) int {
+ sum := 0
+ for n != 1 {
+ if n&1 == 0 {
+ sum += n / 2
+ n = n / 2
+ } else {
+ sum += (n - 1) / 2
+ n = (n-1)/2 + 1
+ }
+ }
+ return sum
+}
+```
\ No newline at end of file
diff --git a/leetcode/1689.Partitioning-Into-Minimum-Number-Of-Deci-Binary-Numbers/1689. Partitioning Into Minimum Number Of Deci-Binary Numbers.go b/leetcode/1689.Partitioning-Into-Minimum-Number-Of-Deci-Binary-Numbers/1689. Partitioning Into Minimum Number Of Deci-Binary Numbers.go
new file mode 100644
index 000000000..a6313fa3c
--- /dev/null
+++ b/leetcode/1689.Partitioning-Into-Minimum-Number-Of-Deci-Binary-Numbers/1689. Partitioning Into Minimum Number Of Deci-Binary Numbers.go
@@ -0,0 +1,11 @@
+package leetcode
+
+func minPartitions(n string) int {
+ res := 0
+ for i := 0; i < len(n); i++ {
+ if int(n[i]-'0') > res {
+ res = int(n[i] - '0')
+ }
+ }
+ return res
+}
diff --git a/leetcode/1689.Partitioning-Into-Minimum-Number-Of-Deci-Binary-Numbers/1689. Partitioning Into Minimum Number Of Deci-Binary Numbers_test.go b/leetcode/1689.Partitioning-Into-Minimum-Number-Of-Deci-Binary-Numbers/1689. Partitioning Into Minimum Number Of Deci-Binary Numbers_test.go
new file mode 100644
index 000000000..9acc0a74c
--- /dev/null
+++ b/leetcode/1689.Partitioning-Into-Minimum-Number-Of-Deci-Binary-Numbers/1689. Partitioning Into Minimum Number Of Deci-Binary Numbers_test.go
@@ -0,0 +1,47 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question1689 struct {
+ para1689
+ ans1689
+}
+
+// para 是参数
+// one 代表第一个参数
+type para1689 struct {
+ n string
+}
+
+// ans 是答案
+// one 代表第一个答案
+type ans1689 struct {
+ one int
+}
+
+func Test_Problem1689(t *testing.T) {
+
+ qs := []question1689{
+
+ {
+ para1689{"32"},
+ ans1689{3},
+ },
+
+ {
+ para1689{"82734"},
+ ans1689{8},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 1689------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans1689, q.para1689
+ fmt.Printf("【input】:%v 【output】:%v\n", p, minPartitions(p.n))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/1689.Partitioning-Into-Minimum-Number-Of-Deci-Binary-Numbers/README.md b/leetcode/1689.Partitioning-Into-Minimum-Number-Of-Deci-Binary-Numbers/README.md
new file mode 100644
index 000000000..2ac4daa24
--- /dev/null
+++ b/leetcode/1689.Partitioning-Into-Minimum-Number-Of-Deci-Binary-Numbers/README.md
@@ -0,0 +1,60 @@
+# [1689. Partitioning Into Minimum Number Of Deci-Binary Numbers](https://leetcode.com/problems/partitioning-into-minimum-number-of-deci-binary-numbers/)
+
+## 题目
+
+A decimal number is called **deci-binary** if each of its digits is either `0` or `1` without any leading zeros. For example, `101` and `1100` are **deci-binary**, while `112` and `3001` are not.
+
+Given a string `n` that represents a positive decimal integer, return *the **minimum** number of positive **deci-binary** numbers needed so that they sum up to* `n`*.*
+
+**Example 1:**
+
+```
+Input: n = "32"
+Output: 3
+Explanation: 10 + 11 + 11 = 32
+```
+
+**Example 2:**
+
+```
+Input: n = "82734"
+Output: 8
+```
+
+**Example 3:**
+
+```
+Input: n = "27346209830709182346"
+Output: 9
+```
+
+**Constraints:**
+
+- `1 <= n.length <= 105`
+- `n` consists of only digits.
+- `n` does not contain any leading zeros and represents a positive integer.
+
+## 题目大意
+
+如果一个十进制数字不含任何前导零，且每一位上的数字不是 0 就是 1 ，那么该数字就是一个 十-二进制数 。例如，101 和 1100 都是 十-二进制数，而 112 和 3001 不是。给你一个表示十进制整数的字符串 n ，返回和为 n 的 十-二进制数 的最少数目。
+
+## 解题思路
+
+- 这一题也算是简单题，相通了以后，代码就 3 行。
+- 要想由 01 组成的十进制数组成 n，只需要在 n 这个数的各个数位上依次排上 0 和 1 即可。例如 n = 23423723，这是一个 8 位数。最大数字是 7，所以至少需要 7 个数累加能得到这个 n。这 7 个数的百位都为 1，其他数位按需求取 0 和 1 即可。例如万位是 2，那么这 7 个数中任找 2 个数的万位是 1 ，其他 5 个数的万位是 0 即可。
+
+## 代码
+
+```go
+package leetcode
+
+func minPartitions(n string) int {
+ res := 0
+ for i := 0; i < len(n); i++ {
+ if int(n[i]-'0') > res {
+ res = int(n[i] - '0')
+ }
+ }
+ return res
+}
+```
\ No newline at end of file
diff --git a/leetcode/1690.Stone-Game-VII/1690. Stone Game VII.go b/leetcode/1690.Stone-Game-VII/1690. Stone Game VII.go
new file mode 100644
index 000000000..c2ad93b4f
--- /dev/null
+++ b/leetcode/1690.Stone-Game-VII/1690. Stone Game VII.go
@@ -0,0 +1,65 @@
+package leetcode
+
+// 解法一 优化空间版 DP
+func stoneGameVII(stones []int) int {
+ n := len(stones)
+ sum := make([]int, n)
+ dp := make([]int, n)
+ for i, d := range stones {
+ sum[i] = d
+ }
+ for i := 1; i < n; i++ {
+ for j := 0; j+i < n; j++ {
+ if (n-i)%2 == 1 {
+ d0 := dp[j] + sum[j]
+ d1 := dp[j+1] + sum[j+1]
+ if d0 > d1 {
+ dp[j] = d0
+ } else {
+ dp[j] = d1
+ }
+ } else {
+ d0 := dp[j] - sum[j]
+ d1 := dp[j+1] - sum[j+1]
+ if d0 < d1 {
+ dp[j] = d0
+ } else {
+ dp[j] = d1
+ }
+ }
+ sum[j] = sum[j] + stones[i+j]
+ }
+ }
+ return dp[0]
+}
+
+// 解法二 常规 DP
+func stoneGameVII1(stones []int) int {
+ prefixSum := make([]int, len(stones))
+ for i := 0; i < len(stones); i++ {
+ if i == 0 {
+ prefixSum[i] = stones[i]
+ } else {
+ prefixSum[i] = prefixSum[i-1] + stones[i]
+ }
+ }
+ dp := make([][]int, len(stones))
+ for i := range dp {
+ dp[i] = make([]int, len(stones))
+ dp[i][i] = 0
+ }
+ n := len(stones)
+ for l := 2; l <= n; l++ {
+ for i := 0; i+l <= n; i++ {
+ dp[i][i+l-1] = max(prefixSum[i+l-1]-prefixSum[i+1]+stones[i+1]-dp[i+1][i+l-1], prefixSum[i+l-2]-prefixSum[i]+stones[i]-dp[i][i+l-2])
+ }
+ }
+ return dp[0][n-1]
+}
+
+func max(a, b int) int {
+ if a > b {
+ return a
+ }
+ return b
+}
diff --git a/leetcode/1690.Stone-Game-VII/1690. Stone Game VII_test.go b/leetcode/1690.Stone-Game-VII/1690. Stone Game VII_test.go
new file mode 100644
index 000000000..60656ac91
--- /dev/null
+++ b/leetcode/1690.Stone-Game-VII/1690. Stone Game VII_test.go
@@ -0,0 +1,47 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question1690 struct {
+ para1690
+ ans1690
+}
+
+// para 是参数
+// one 代表第一个参数
+type para1690 struct {
+ stones []int
+}
+
+// ans 是答案
+// one 代表第一个答案
+type ans1690 struct {
+ one int
+}
+
+func Test_Problem1690(t *testing.T) {
+
+ qs := []question1690{
+
+ {
+ para1690{[]int{5, 3, 1, 4, 2}},
+ ans1690{6},
+ },
+
+ {
+ para1690{[]int{7, 90, 5, 1, 100, 10, 10, 2}},
+ ans1690{122},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 1690------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans1690, q.para1690
+ fmt.Printf("【input】:%v 【output】:%v\n", p, stoneGameVII(p.stones))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/1690.Stone-Game-VII/README.md b/leetcode/1690.Stone-Game-VII/README.md
new file mode 100644
index 000000000..c7b618acf
--- /dev/null
+++ b/leetcode/1690.Stone-Game-VII/README.md
@@ -0,0 +1,130 @@
+# [1690. Stone Game VII](https://leetcode.com/problems/stone-game-vii/)
+
+## 题目
+
+Alice and Bob take turns playing a game, with **Alice starting first**.
+
+There are `n` stones arranged in a row. On each player's turn, they can **remove** either the leftmost stone or the rightmost stone from the row and receive points equal to the **sum** of the remaining stones' values in the row. The winner is the one with the higher score when there are no stones left to remove.
+
+Bob found that he will always lose this game (poor Bob, he always loses), so he decided to **minimize the score's difference**. Alice's goal is to **maximize the difference** in the score.
+
+Given an array of integers `stones` where `stones[i]` represents the value of the `ith` stone **from the left**, return *the **difference** in Alice and Bob's score if they both play **optimally**.*
+
+**Example 1:**
+
+```
+Input: stones = [5,3,1,4,2]
+Output: 6
+Explanation:
+- Alice removes 2 and gets 5 + 3 + 1 + 4 = 13 points. Alice = 13, Bob = 0, stones = [5,3,1,4].
+- Bob removes 5 and gets 3 + 1 + 4 = 8 points. Alice = 13, Bob = 8, stones = [3,1,4].
+- Alice removes 3 and gets 1 + 4 = 5 points. Alice = 18, Bob = 8, stones = [1,4].
+- Bob removes 1 and gets 4 points. Alice = 18, Bob = 12, stones = [4].
+- Alice removes 4 and gets 0 points. Alice = 18, Bob = 12, stones = [].
+The score difference is 18 - 12 = 6.
+```
+
+**Example 2:**
+
+```
+Input: stones = [7,90,5,1,100,10,10,2]
+Output: 122
+```
+
+**Constraints:**
+
+- `n == stones.length`
+- `2 <= n <= 1000`
+- `1 <= stones[i] <= 1000`
+
+## 题目大意
+
+石子游戏中，爱丽丝和鲍勃轮流进行自己的回合，爱丽丝先开始 。有 n 块石子排成一排。每个玩家的回合中，可以从行中 移除 最左边的石头或最右边的石头，并获得与该行中剩余石头值之 和 相等的得分。当没有石头可移除时，得分较高者获胜。鲍勃发现他总是输掉游戏（可怜的鲍勃，他总是输），所以他决定尽力 减小得分的差值 。爱丽丝的目标是最大限度地 扩大得分的差值 。
+
+给你一个整数数组 stones ，其中 stones[i] 表示 从左边开始 的第 i 个石头的值，如果爱丽丝和鲍勃都 发挥出最佳水平 ，请返回他们 得分的差值 。
+
+## 解题思路
+
+- 首先考虑 Bob 缩小分值差距意味着什么，意味着他想让他和 Alice 相对分数最小。Bob 已经明确肯定是输，所以他的分数一定比 Alice 小，那么 Bob - Alice 分数相减一定是负数。相对分数越小，意味着差值越大。负数越大，差值越小。-50 和 -10，-10 数值大，相差小。所以 Bob 的操作是让相对分数越大。Alice 的目的也是这样，要让 Alice - Bob 的相对分数越大，这里是正数的越大。综上，两者的目的相同，都是让相对分数最大化。
+- 定义 `dp[i][j]` 代表在当前 `stone[i ~ j]` 区间内能获得的最大分差。状态转移方程为：
+
+ ```go
+ dp[i][j] = max(
+ sum(i + 1, j) - dp[i + 1][j], // 这一局取走 `stone[i]`，获得 sum(i + 1, j) 分数，再减去剩下对手能获得的分数，即是此局能获得的最大分差。
+ sum(i, j - 1) - dp[i][j - 1] // 这一局取走 `stone[j]`，获得 sum(i, j - 1) 分数，再减去剩下对手能获得的分数，即是此局能获得的最大分差。
+ )
+ ```
+
+ 计算 `sum(i + 1, j) = stone[i + 1] + stone[i + 2] + …… + stone[j]` 利用前缀和计算区间和。
+
+- 解法二是正常思路解答出来的代码。解法一是压缩了 DP 数组，在 DP 状态转移的时候，生成下一个 `dp[j]` 实际上是有规律的。利用这个规律可以少存一维数据，压缩空间。解法一的代码直接写出来，比较难想。先写出解法二的代码，然后找到递推规律，优化空间压缩一维，再写出解法一的代码。
+
+## 代码
+
+```go
+package leetcode
+
+// 解法一 优化空间版 DP
+func stoneGameVII(stones []int) int {
+ n := len(stones)
+ sum := make([]int, n)
+ dp := make([]int, n)
+ for i, d := range stones {
+ sum[i] = d
+ }
+ for i := 1; i < n; i++ {
+ for j := 0; j+i < n; j++ {
+ if (n-i)%2 == 1 {
+ d0 := dp[j] + sum[j]
+ d1 := dp[j+1] + sum[j+1]
+ if d0 > d1 {
+ dp[j] = d0
+ } else {
+ dp[j] = d1
+ }
+ } else {
+ d0 := dp[j] - sum[j]
+ d1 := dp[j+1] - sum[j+1]
+ if d0 < d1 {
+ dp[j] = d0
+ } else {
+ dp[j] = d1
+ }
+ }
+ sum[j] = sum[j] + stones[i+j]
+ }
+ }
+ return dp[0]
+}
+
+// 解法二 常规 DP
+func stoneGameVII1(stones []int) int {
+ prefixSum := make([]int, len(stones))
+ for i := 0; i < len(stones); i++ {
+ if i == 0 {
+ prefixSum[i] = stones[i]
+ } else {
+ prefixSum[i] = prefixSum[i-1] + stones[i]
+ }
+ }
+ dp := make([][]int, len(stones))
+ for i := range dp {
+ dp[i] = make([]int, len(stones))
+ dp[i][i] = 0
+ }
+ n := len(stones)
+ for l := 2; l <= n; l++ {
+ for i := 0; i+l <= n; i++ {
+ dp[i][i+l-1] = max(prefixSum[i+l-1]-prefixSum[i+1]+stones[i+1]-dp[i+1][i+l-1], prefixSum[i+l-2]-prefixSum[i]+stones[i]-dp[i][i+l-2])
+ }
+ }
+ return dp[0][n-1]
+}
+
+func max(a, b int) int {
+ if a > b {
+ return a
+ }
+ return b
+}
+```
\ No newline at end of file
diff --git a/leetcode/1691.Maximum-Height-by-Stacking-Cuboids/1691. Maximum Height by Stacking Cuboids.go b/leetcode/1691.Maximum-Height-by-Stacking-Cuboids/1691. Maximum Height by Stacking Cuboids.go
new file mode 100644
index 000000000..2d2b14f1f
--- /dev/null
+++ b/leetcode/1691.Maximum-Height-by-Stacking-Cuboids/1691. Maximum Height by Stacking Cuboids.go
@@ -0,0 +1,42 @@
+package leetcode
+
+import "sort"
+
+func maxHeight(cuboids [][]int) int {
+ n := len(cuboids)
+ for i := 0; i < n; i++ {
+ sort.Ints(cuboids[i]) // 立方体三边内部排序
+ }
+ // 立方体排序，先按最短边，再到最长边
+ sort.Slice(cuboids, func(i, j int) bool {
+ if cuboids[i][0] != cuboids[j][0] {
+ return cuboids[i][0] < cuboids[j][0]
+ }
+ if cuboids[i][1] != cuboids[j][1] {
+ return cuboids[i][1] < cuboids[j][1]
+ }
+ return cuboids[i][2] < cuboids[j][2]
+ })
+ res := 0
+ dp := make([]int, n)
+ for i := 0; i < n; i++ {
+ dp[i] = cuboids[i][2]
+ res = max(res, dp[i])
+ }
+ for i := 1; i < n; i++ {
+ for j := 0; j < i; j++ {
+ if cuboids[j][0] <= cuboids[i][0] && cuboids[j][1] <= cuboids[i][1] && cuboids[j][2] <= cuboids[i][2] {
+ dp[i] = max(dp[i], dp[j]+cuboids[i][2])
+ }
+ }
+ res = max(res, dp[i])
+ }
+ return res
+}
+
+func max(x, y int) int {
+ if x > y {
+ return x
+ }
+ return y
+}
diff --git a/leetcode/1691.Maximum-Height-by-Stacking-Cuboids/1691. Maximum Height by Stacking Cuboids_test.go b/leetcode/1691.Maximum-Height-by-Stacking-Cuboids/1691. Maximum Height by Stacking Cuboids_test.go
new file mode 100644
index 000000000..b49a94636
--- /dev/null
+++ b/leetcode/1691.Maximum-Height-by-Stacking-Cuboids/1691. Maximum Height by Stacking Cuboids_test.go
@@ -0,0 +1,52 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question1691 struct {
+ para1691
+ ans1691
+}
+
+// para 是参数
+// one 代表第一个参数
+type para1691 struct {
+ cuboids [][]int
+}
+
+// ans 是答案
+// one 代表第一个答案
+type ans1691 struct {
+ one int
+}
+
+func Test_Problem1691(t *testing.T) {
+
+ qs := []question1691{
+
+ {
+ para1691{[][]int{{50, 45, 20}, {95, 37, 53}, {45, 23, 12}}},
+ ans1691{190},
+ },
+
+ {
+ para1691{[][]int{{38, 25, 45}, {76, 35, 3}}},
+ ans1691{76},
+ },
+
+ {
+ para1691{[][]int{{7, 11, 17}, {7, 17, 11}, {11, 7, 17}, {11, 17, 7}, {17, 7, 11}, {17, 11, 7}}},
+ ans1691{102},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 1691------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans1691, q.para1691
+ fmt.Printf("【input】:%v 【output】:%v\n", p, maxHeight(p.cuboids))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/1691.Maximum-Height-by-Stacking-Cuboids/README.md b/leetcode/1691.Maximum-Height-by-Stacking-Cuboids/README.md
new file mode 100644
index 000000000..bd8eca873
--- /dev/null
+++ b/leetcode/1691.Maximum-Height-by-Stacking-Cuboids/README.md
@@ -0,0 +1,106 @@
+# [1691. Maximum Height by Stacking Cuboids](https://leetcode.com/problems/maximum-height-by-stacking-cuboids/)
+
+## 题目
+
+Given `n` `cuboids` where the dimensions of the `ith` cuboid is `cuboids[i] = [widthi, lengthi, heighti]` (**0-indexed**). Choose a **subset** of `cuboids` and place them on each other.
+
+You can place cuboid `i` on cuboid `j` if `widthi <= widthj` and `lengthi <= lengthj` and `heighti <= heightj`. You can rearrange any cuboid's dimensions by rotating it to put it on another cuboid.
+
+Return *the **maximum height** of the stacked* `cuboids`.
+
+**Example 1:**
+
+
+
+```
+Input: cuboids = [[50,45,20],[95,37,53],[45,23,12]]
+Output: 190
+Explanation:
+Cuboid 1 is placed on the bottom with the 53x37 side facing down with height 95.
+Cuboid 0 is placed next with the 45x20 side facing down with height 50.
+Cuboid 2 is placed next with the 23x12 side facing down with height 45.
+The total height is 95 + 50 + 45 = 190.
+```
+
+**Example 2:**
+
+```
+Input: cuboids = [[38,25,45],[76,35,3]]
+Output: 76
+Explanation:
+You can't place any of the cuboids on the other.
+We choose cuboid 1 and rotate it so that the 35x3 side is facing down and its height is 76.
+```
+
+**Example 3:**
+
+```
+Input: cuboids = [[7,11,17],[7,17,11],[11,7,17],[11,17,7],[17,7,11],[17,11,7]]
+Output: 102
+Explanation:
+After rearranging the cuboids, you can see that all cuboids have the same dimension.
+You can place the 11x7 side down on all cuboids so their heights are 17.
+The maximum height of stacked cuboids is 6 * 17 = 102.
+```
+
+**Constraints:**
+
+- `n == cuboids.length`
+- `1 <= n <= 100`
+- `1 <= widthi, lengthi, heighti <= 100`
+
+## 题目大意
+
+给你 n 个长方体 cuboids ，其中第 i 个长方体的长宽高表示为 cuboids[i] = [widthi, lengthi, heighti]（下标从 0 开始）。请你从 cuboids 选出一个 子集 ，并将它们堆叠起来。如果 widthi <= widthj 且 lengthi <= lengthj 且 heighti <= heightj ，你就可以将长方体 i 堆叠在长方体 j 上。你可以通过旋转把长方体的长宽高重新排列，以将它放在另一个长方体上。返回 堆叠长方体 cuboids 可以得到的 最大高度 。
+
+## 解题思路
+
+- 这一题是 LIS 最长递增子序列系列问题的延续。一维 LIS 问题是第 300 题。二维 LIS 问题是 354 题。这一题是三维的 LIS 问题。
+- 题目要求最终摞起来的长方体尽可能的高，那么把长宽高中最大的值旋转为高。这是针对单个方块的排序。多个方块间还要排序，因为他们摞起来有要求，大的方块必须放在下面。所以针对多个方块，按照长，宽，高的顺序进行排序。两次排序完成以后，可以用动态规划找出最大值了。定义 `dp[i]` 为以 `i` 为最后一块砖块所能堆叠的最高高度。由于长和宽已经排好序了。所以只需要在 [0, i - 1] 这个区间内动态更新 dp 最大值。
+
+## 代码
+
+```go
+package leetcode
+
+import "sort"
+
+func maxHeight(cuboids [][]int) int {
+ n := len(cuboids)
+ for i := 0; i < n; i++ {
+ sort.Ints(cuboids[i]) // 立方体三边内部排序
+ }
+ // 立方体排序，先按最短边，再到最长边
+ sort.Slice(cuboids, func(i, j int) bool {
+ if cuboids[i][0] != cuboids[j][0] {
+ return cuboids[i][0] < cuboids[j][0]
+ }
+ if cuboids[i][1] != cuboids[j][1] {
+ return cuboids[i][1] < cuboids[j][1]
+ }
+ return cuboids[i][2] < cuboids[j][2]
+ })
+ res := 0
+ dp := make([]int, n)
+ for i := 0; i < n; i++ {
+ dp[i] = cuboids[i][2]
+ res = max(res, dp[i])
+ }
+ for i := 1; i < n; i++ {
+ for j := 0; j < i; j++ {
+ if cuboids[j][0] <= cuboids[i][0] && cuboids[j][1] <= cuboids[i][1] && cuboids[j][2] <= cuboids[i][2] {
+ dp[i] = max(dp[i], dp[j]+cuboids[i][2])
+ }
+ }
+ res = max(res, dp[i])
+ }
+ return res
+}
+
+func max(x, y int) int {
+ if x > y {
+ return x
+ }
+ return y
+}
+```
\ No newline at end of file
diff --git a/leetcode/1694.Reformat-Phone-Number/1694. Reformat Phone Number.go b/leetcode/1694.Reformat-Phone-Number/1694. Reformat Phone Number.go
new file mode 100644
index 000000000..22a8d6663
--- /dev/null
+++ b/leetcode/1694.Reformat-Phone-Number/1694. Reformat Phone Number.go
@@ -0,0 +1,37 @@
+package leetcode
+
+import (
+ "strings"
+)
+
+func reformatNumber(number string) string {
+ parts, nums := []string{}, []rune{}
+ for _, r := range number {
+ if r != '-' && r != ' ' {
+ nums = append(nums, r)
+ }
+ }
+ threeDigits, twoDigits := len(nums)/3, 0
+ switch len(nums) % 3 {
+ case 1:
+ threeDigits--
+ twoDigits = 2
+ case 2:
+ twoDigits = 1
+ default:
+ twoDigits = 0
+ }
+ for i := 0; i < threeDigits; i++ {
+ s := ""
+ s += string(nums[0:3])
+ nums = nums[3:]
+ parts = append(parts, s)
+ }
+ for i := 0; i < twoDigits; i++ {
+ s := ""
+ s += string(nums[0:2])
+ nums = nums[2:]
+ parts = append(parts, s)
+ }
+ return strings.Join(parts, "-")
+}
diff --git a/leetcode/1694.Reformat-Phone-Number/1694. Reformat Phone Number_test.go b/leetcode/1694.Reformat-Phone-Number/1694. Reformat Phone Number_test.go
new file mode 100644
index 000000000..8eb4f7a13
--- /dev/null
+++ b/leetcode/1694.Reformat-Phone-Number/1694. Reformat Phone Number_test.go
@@ -0,0 +1,67 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question1694 struct {
+ para1694
+ ans1694
+}
+
+// para 是参数
+// one 代表第一个参数
+type para1694 struct {
+ number string
+}
+
+// ans 是答案
+// one 代表第一个答案
+type ans1694 struct {
+ one string
+}
+
+func Test_Problem1694(t *testing.T) {
+
+ qs := []question1694{
+
+ {
+ para1694{"1-23-45 6"},
+ ans1694{"123-456"},
+ },
+
+ {
+ para1694{"123 4-567"},
+ ans1694{"123-45-67"},
+ },
+
+ {
+ para1694{"123 4-5678"},
+ ans1694{"123-456-78"},
+ },
+
+ {
+ para1694{"12"},
+ ans1694{"12"},
+ },
+
+ {
+ para1694{"--17-5 229 35-39475 "},
+ ans1694{"175-229-353-94-75"},
+ },
+
+ {
+ para1694{"9964-"},
+ ans1694{"99-64"},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 1694------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans1694, q.para1694
+ fmt.Printf("【input】:%v 【output】:%v\n", p, reformatNumber(p.number))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/1694.Reformat-Phone-Number/README.md b/leetcode/1694.Reformat-Phone-Number/README.md
new file mode 100644
index 000000000..670aae712
--- /dev/null
+++ b/leetcode/1694.Reformat-Phone-Number/README.md
@@ -0,0 +1,135 @@
+# [1694. Reformat Phone Number](https://leetcode.com/problems/reformat-phone-number/)
+
+
+## 题目
+
+You are given a phone number as a string `number`. `number` consists of digits, spaces `' '`, and/or dashes `'-'`.
+
+You would like to reformat the phone number in a certain manner. Firstly, **remove** all spaces and dashes. Then, **group** the digits from left to right into blocks of length 3 **until** there are 4 or fewer digits. The final digits are then grouped as follows:
+
+- 2 digits: A single block of length 2.
+- 3 digits: A single block of length 3.
+- 4 digits: Two blocks of length 2 each.
+
+The blocks are then joined by dashes. Notice that the reformatting process should **never** produce any blocks of length 1 and produce **at most** two blocks of length 2.
+
+Return *the phone number after formatting.*
+
+**Example 1:**
+
+```
+Input: number = "1-23-45 6"
+Output: "123-456"
+Explanation: The digits are "123456".
+Step 1: There are more than 4 digits, so group the next 3 digits. The 1st block is "123".
+Step 2: There are 3 digits remaining, so put them in a single block of length 3. The 2nd block is "456".
+Joining the blocks gives "123-456".
+
+```
+
+**Example 2:**
+
+```
+Input: number = "123 4-567"
+Output: "123-45-67"
+Explanation: The digits are "1234567".
+Step 1: There are more than 4 digits, so group the next 3 digits. The 1st block is "123".
+Step 2: There are 4 digits left, so split them into two blocks of length 2. The blocks are "45" and "67".
+Joining the blocks gives "123-45-67".
+
+```
+
+**Example 3:**
+
+```
+Input: number = "123 4-5678"
+Output: "123-456-78"
+Explanation: The digits are "12345678".
+Step 1: The 1st block is "123".
+Step 2: The 2nd block is "456".
+Step 3: There are 2 digits left, so put them in a single block of length 2. The 3rd block is "78".
+Joining the blocks gives "123-456-78".
+
+```
+
+**Example 4:**
+
+```
+Input: number = "12"
+Output: "12"
+
+```
+
+**Example 5:**
+
+```
+Input: number = "--17-5 229 35-39475 "
+Output: "175-229-353-94-75"
+
+```
+
+**Constraints:**
+
+- `2 <= number.length <= 100`
+- `number` consists of digits and the characters `'-'` and `' '`.
+- There are at least **two** digits in `number`.
+
+## 题目大意
+
+给你一个字符串形式的电话号码 number 。number 由数字、空格 ' '、和破折号 '-' 组成。
+
+请你按下述方式重新格式化电话号码。
+
+- 首先，删除 所有的空格和破折号。
+- 其次，将数组从左到右 每 3 个一组 分块，直到 剩下 4 个或更少数字。剩下的数字将按下述规定再分块：
+ - 2 个数字：单个含 2 个数字的块。
+ - 3 个数字：单个含 3 个数字的块。
+ - 4 个数字：两个分别含 2 个数字的块。
+
+最后用破折号将这些块连接起来。注意，重新格式化过程中 不应该 生成仅含 1 个数字的块，并且 最多 生成两个含 2 个数字的块。返回格式化后的电话号码。
+
+## 解题思路
+
+- 简单题。先判断号码是不是 2 位和 4 位，如果是，单独输出这 2 种情况。剩下的都是 3 位以上了，取余，判断剩余的数字是 2 个还是 4 个。这时不可能存在剩 1 位数的情况。除 3 余 1，即剩 4 位的情况，末尾 4 位需要 2 个一组输出。除 3 余 2，即剩 2 位的情况。处理好末尾，再逆序每 3 个一组连接 "-" 即可。可能需要注意的 case 见 test 文件。
+
+## 代码
+
+```go
+package leetcode
+
+import (
+ "strings"
+)
+
+func reformatNumber(number string) string {
+ parts, nums := []string{}, []rune{}
+ for _, r := range number {
+ if r != '-' && r != ' ' {
+ nums = append(nums, r)
+ }
+ }
+ threeDigits, twoDigits := len(nums)/3, 0
+ switch len(nums) % 3 {
+ case 1:
+ threeDigits--
+ twoDigits = 2
+ case 2:
+ twoDigits = 1
+ default:
+ twoDigits = 0
+ }
+ for i := 0; i < threeDigits; i++ {
+ s := ""
+ s += string(nums[0:3])
+ nums = nums[3:]
+ parts = append(parts, s)
+ }
+ for i := 0; i < twoDigits; i++ {
+ s := ""
+ s += string(nums[0:2])
+ nums = nums[2:]
+ parts = append(parts, s)
+ }
+ return strings.Join(parts, "-")
+}
+```
\ No newline at end of file
diff --git a/leetcode/1695.Maximum-Erasure-Value/1695. Maximum Erasure Value.go b/leetcode/1695.Maximum-Erasure-Value/1695. Maximum Erasure Value.go
new file mode 100644
index 000000000..ccca3f96a
--- /dev/null
+++ b/leetcode/1695.Maximum-Erasure-Value/1695. Maximum Erasure Value.go
@@ -0,0 +1,30 @@
+package leetcode
+
+func maximumUniqueSubarray(nums []int) int {
+ if len(nums) == 0 {
+ return 0
+ }
+ result, left, right, freq := 0, 0, -1, map[int]int{}
+ for left < len(nums) {
+ if right+1 < len(nums) && freq[nums[right+1]] == 0 {
+ freq[nums[right+1]]++
+ right++
+ } else {
+ freq[nums[left]]--
+ left++
+ }
+ sum := 0
+ for i := left; i <= right; i++ {
+ sum += nums[i]
+ }
+ result = max(result, sum)
+ }
+ return result
+}
+
+func max(a int, b int) int {
+ if a > b {
+ return a
+ }
+ return b
+}
diff --git a/leetcode/1695.Maximum-Erasure-Value/1695. Maximum Erasure Value_test.go b/leetcode/1695.Maximum-Erasure-Value/1695. Maximum Erasure Value_test.go
new file mode 100644
index 000000000..bc088cdab
--- /dev/null
+++ b/leetcode/1695.Maximum-Erasure-Value/1695. Maximum Erasure Value_test.go
@@ -0,0 +1,47 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question1695 struct {
+ para1695
+ ans1695
+}
+
+// para 是参数
+// one 代表第一个参数
+type para1695 struct {
+ nums []int
+}
+
+// ans 是答案
+// one 代表第一个答案
+type ans1695 struct {
+ one int
+}
+
+func Test_Problem1695(t *testing.T) {
+
+ qs := []question1695{
+
+ {
+ para1695{[]int{4, 2, 4, 5, 6}},
+ ans1695{17},
+ },
+
+ {
+ para1695{[]int{5, 2, 1, 2, 5, 2, 1, 2, 5}},
+ ans1695{8},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 1695------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans1695, q.para1695
+ fmt.Printf("【input】:%v 【output】:%v\n", p, maximumUniqueSubarray(p.nums))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/1695.Maximum-Erasure-Value/README.md b/leetcode/1695.Maximum-Erasure-Value/README.md
new file mode 100644
index 000000000..a2dec532d
--- /dev/null
+++ b/leetcode/1695.Maximum-Erasure-Value/README.md
@@ -0,0 +1,74 @@
+# [1695. Maximum Erasure Value](https://leetcode.com/problems/maximum-erasure-value/)
+
+
+## 题目
+
+You are given an array of positive integers `nums` and want to erase a subarray containing **unique elements**. The **score** you get by erasing the subarray is equal to the **sum** of its elements.
+
+Return *the **maximum score** you can get by erasing **exactly one** subarray.*
+
+An array `b` is called to be a subarray of `a` if it forms a contiguous subsequence of `a`, that is, if it is equal to `a[l],a[l+1],...,a[r]` for some `(l,r)`.
+
+**Example 1:**
+
+```
+Input: nums = [4,2,4,5,6]
+Output: 17
+Explanation: The optimal subarray here is [2,4,5,6].
+```
+
+**Example 2:**
+
+```
+Input: nums = [5,2,1,2,5,2,1,2,5]
+Output: 8
+Explanation: The optimal subarray here is [5,2,1] or [1,2,5].
+```
+
+**Constraints:**
+
+- `1 <= nums.length <= 105`
+- `1 <= nums[i] <= 104`
+
+## 题目大意
+
+给你一个正整数数组 nums ，请你从中删除一个含有 若干不同元素 的子数组。删除子数组的 得分 就是子数组各元素之 和 。返回 只删除一个 子数组可获得的 最大得分 。如果数组 b 是数组 a 的一个连续子序列，即如果它等于 a[l],a[l+1],...,a[r] ，那么它就是 a 的一个子数组。
+
+## 解题思路
+
+- 读完题立马能识别出这是经典的滑动窗口题。利用滑动窗口从左往右滑动窗口，滑动过程中统计频次，如果是不同元素，右边界窗口又移，否则左边窗口缩小。每次移动更新 max 值。最终扫完一遍以后，max 值即为所求。
+
+## 代码
+
+```go
+package leetcode
+
+func maximumUniqueSubarray(nums []int) int {
+ if len(nums) == 0 {
+ return 0
+ }
+ result, left, right, freq := 0, 0, -1, map[int]int{}
+ for left < len(nums) {
+ if right+1 < len(nums) && freq[nums[right+1]] == 0 {
+ freq[nums[right+1]]++
+ right++
+ } else {
+ freq[nums[left]]--
+ left++
+ }
+ sum := 0
+ for i := left; i <= right; i++ {
+ sum += nums[i]
+ }
+ result = max(result, sum)
+ }
+ return result
+}
+
+func max(a int, b int) int {
+ if a > b {
+ return a
+ }
+ return b
+}
+```
\ No newline at end of file
diff --git a/leetcode/1696.Jump-Game-VI/1696. Jump Game VI.go b/leetcode/1696.Jump-Game-VI/1696. Jump Game VI.go
new file mode 100644
index 000000000..b57b2500d
--- /dev/null
+++ b/leetcode/1696.Jump-Game-VI/1696. Jump Game VI.go
@@ -0,0 +1,53 @@
+package leetcode
+
+import (
+ "math"
+)
+
+// 单调队列
+func maxResult(nums []int, k int) int {
+ dp := make([]int, len(nums))
+ dp[0] = nums[0]
+ for i := 1; i < len(dp); i++ {
+ dp[i] = math.MinInt32
+ }
+ window := make([]int, k)
+ for i := 1; i < len(nums); i++ {
+ dp[i] = nums[i] + dp[window[0]]
+ for len(window) > 0 && dp[window[len(window)-1]] <= dp[i] {
+ window = window[:len(window)-1]
+ }
+ for len(window) > 0 && i-k >= window[0] {
+ window = window[1:]
+ }
+ window = append(window, i)
+ }
+ return dp[len(nums)-1]
+}
+
+// 超时
+func maxResult1(nums []int, k int) int {
+ dp := make([]int, len(nums))
+ if k > len(nums) {
+ k = len(nums)
+ }
+ dp[0] = nums[0]
+ for i := 1; i < len(dp); i++ {
+ dp[i] = math.MinInt32
+ }
+ for i := 1; i < len(nums); i++ {
+ left, tmp := max(0, i-k), math.MinInt32
+ for j := left; j < i; j++ {
+ tmp = max(tmp, dp[j])
+ }
+ dp[i] = nums[i] + tmp
+ }
+ return dp[len(nums)-1]
+}
+
+func max(a, b int) int {
+ if a > b {
+ return a
+ }
+ return b
+}
diff --git a/leetcode/1696.Jump-Game-VI/1696. Jump Game VI_test.go b/leetcode/1696.Jump-Game-VI/1696. Jump Game VI_test.go
new file mode 100644
index 000000000..9b75ea76d
--- /dev/null
+++ b/leetcode/1696.Jump-Game-VI/1696. Jump Game VI_test.go
@@ -0,0 +1,53 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question1696 struct {
+ para1696
+ ans1696
+}
+
+// para 是参数
+// one 代表第一个参数
+type para1696 struct {
+ nums []int
+ k int
+}
+
+// ans 是答案
+// one 代表第一个答案
+type ans1696 struct {
+ one int
+}
+
+func Test_Problem1696(t *testing.T) {
+
+ qs := []question1696{
+
+ {
+ para1696{[]int{1, -1, -2, 4, -7, 3}, 2},
+ ans1696{7},
+ },
+
+ {
+ para1696{[]int{10, -5, -2, 4, 0, 3}, 3},
+ ans1696{17},
+ },
+
+ {
+ para1696{[]int{1, -5, -20, 4, -1, 3, -6, -3}, 2},
+ ans1696{0},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 1696------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans1696, q.para1696
+ fmt.Printf("【input】:%v 【output】:%v\n", p, maxResult(p.nums, p.k))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/1696.Jump-Game-VI/README.md b/leetcode/1696.Jump-Game-VI/README.md
new file mode 100644
index 000000000..5a2ae2455
--- /dev/null
+++ b/leetcode/1696.Jump-Game-VI/README.md
@@ -0,0 +1,109 @@
+# [1696. Jump Game VI](https://leetcode.com/problems/jump-game-vi/)
+
+## 题目
+
+You are given a **0-indexed** integer array `nums` and an integer `k`.
+
+You are initially standing at index `0`. In one move, you can jump at most `k` steps forward without going outside the boundaries of the array. That is, you can jump from index `i` to any index in the range `[i + 1, min(n - 1, i + k)]` **inclusive**.
+
+You want to reach the last index of the array (index `n - 1`). Your **score** is the **sum** of all `nums[j]` for each index `j` you visited in the array.
+
+Return *the **maximum score** you can get*.
+
+**Example 1:**
+
+```
+Input: nums = [1,-1,-2,4,-7,3], k = 2
+Output: 7
+Explanation: You can choose your jumps forming the subsequence [1,-1,4,3] (underlined above). The sum is 7.
+
+```
+
+**Example 2:**
+
+```
+Input: nums = [10,-5,-2,4,0,3], k = 3
+Output: 17
+Explanation: You can choose your jumps forming the subsequence [10,4,3] (underlined above). The sum is 17.
+
+```
+
+**Example 3:**
+
+```
+Input: nums = [1,-5,-20,4,-1,3,-6,-3], k = 2
+Output: 0
+
+```
+
+**Constraints:**
+
+- `1 <= nums.length, k <= 10^5`
+- `10^4 <= nums[i] <= 10^4`
+
+## 题目大意
+
+给你一个下标从 0 开始的整数数组 nums 和一个整数 k 。一开始你在下标 0 处。每一步，你最多可以往前跳 k 步，但你不能跳出数组的边界。也就是说，你可以从下标 i 跳到 [i + 1， min(n - 1, i + k)] 包含 两个端点的任意位置。你的目标是到达数组最后一个位置（下标为 n - 1 ），你的 得分 为经过的所有数字之和。请你返回你能得到的 最大得分 。
+
+## 解题思路
+
+- 首先能想到的解题思路是动态规划。定义 `dp[i]` 为跳到第 `i` 个位子能获得的最大分数。题目要求的是 `dp[n-1]`，状态转移方程是：`dp[i] = nums[i] + max(dp[j]), max(0, i - k ) <= j < i`，这里需要注意 `j` 的下界，题目中说到不能跳到负数区间，所以左边界下界为 0 。求 `max(dp[j])` 需要遍历一次求得最大值，所以这个解法整体时间复杂度是 O((n - k) * k)，但是提交以后提示超时了。
+- 分析一下超时原因。每次都要在 `[max(0, i - k ), i)` 区间内扫描找到最大值，下一轮的区间是 `[max(0, i - k + 1), i + 1)`，前后这两轮扫描的区间存在大量重合部分 `[max(0, i - k + 1), i)`，正是这部分反反复复的扫描导致算法低效。如何高效的在一个区间内找到最大值是本题的关键。利用单调队列可以完成此题。单调队列里面存一个区间内最大值的下标。这里单调队列有 2 个性质。性质一，队列的队首永远都是最大值，队列从大到小降序排列。如果来了一个比队首更大的值的下标，需要将单调队列清空，只存这个新的最大值的下标。性质二，队列的长度为 k。从队尾插入新值，并把队头的最大值“挤”出队首。拥有了这个单调队列以后，再进行 DP 状态转移，效率就很高了。每次只需取出队首的最大值即可。具体代码见下面。
+
+## 代码
+
+```go
+package leetcode
+
+import (
+ "math"
+)
+
+// 单调队列
+func maxResult(nums []int, k int) int {
+ dp := make([]int, len(nums))
+ dp[0] = nums[0]
+ for i := 1; i < len(dp); i++ {
+ dp[i] = math.MinInt32
+ }
+ window := make([]int, k)
+ for i := 1; i < len(nums); i++ {
+ dp[i] = nums[i] + dp[window[0]]
+ for len(window) > 0 && dp[window[len(window)-1]] <= dp[i] {
+ window = window[:len(window)-1]
+ }
+ for len(window) > 0 && i-k >= window[0] {
+ window = window[1:]
+ }
+ window = append(window, i)
+ }
+ return dp[len(nums)-1]
+}
+
+// 超时
+func maxResult1(nums []int, k int) int {
+ dp := make([]int, len(nums))
+ if k > len(nums) {
+ k = len(nums)
+ }
+ dp[0] = nums[0]
+ for i := 1; i < len(dp); i++ {
+ dp[i] = math.MinInt32
+ }
+ for i := 1; i < len(nums); i++ {
+ left, tmp := max(0, i-k), math.MinInt32
+ for j := left; j < i; j++ {
+ tmp = max(tmp, dp[j])
+ }
+ dp[i] = nums[i] + tmp
+ }
+ return dp[len(nums)-1]
+}
+
+func max(a, b int) int {
+ if a > b {
+ return a
+ }
+ return b
+}
+```
\ No newline at end of file
diff --git a/leetcode/1700.Number-of-Students-Unable-to-Eat-Lunch/1700. Number of Students Unable to Eat Lunch.go b/leetcode/1700.Number-of-Students-Unable-to-Eat-Lunch/1700. Number of Students Unable to Eat Lunch.go
new file mode 100644
index 000000000..a956a03ff
--- /dev/null
+++ b/leetcode/1700.Number-of-Students-Unable-to-Eat-Lunch/1700. Number of Students Unable to Eat Lunch.go
@@ -0,0 +1,13 @@
+package leetcode
+
+func countStudents(students []int, sandwiches []int) int {
+ tmp, n, i := [2]int{}, len(students), 0
+ for _, v := range students {
+ tmp[v]++
+ }
+ for i < n && tmp[sandwiches[i]] > 0 {
+ tmp[sandwiches[i]]--
+ i++
+ }
+ return n - i
+}
diff --git a/leetcode/1700.Number-of-Students-Unable-to-Eat-Lunch/1700. Number of Students Unable to Eat Lunch_test.go b/leetcode/1700.Number-of-Students-Unable-to-Eat-Lunch/1700. Number of Students Unable to Eat Lunch_test.go
new file mode 100644
index 000000000..d407a9687
--- /dev/null
+++ b/leetcode/1700.Number-of-Students-Unable-to-Eat-Lunch/1700. Number of Students Unable to Eat Lunch_test.go
@@ -0,0 +1,48 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question1700 struct {
+ para1700
+ ans1700
+}
+
+// para 是参数
+// one 代表第一个参数
+type para1700 struct {
+ students []int
+ sandwiches []int
+}
+
+// ans 是答案
+// one 代表第一个答案
+type ans1700 struct {
+ one int
+}
+
+func Test_Problem1700(t *testing.T) {
+
+ qs := []question1700{
+
+ {
+ para1700{[]int{1, 1, 0, 0}, []int{0, 1, 0, 1}},
+ ans1700{0},
+ },
+
+ {
+ para1700{[]int{1, 1, 1, 0, 0, 1}, []int{1, 0, 0, 0, 1, 1}},
+ ans1700{3},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 1700------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans1700, q.para1700
+ fmt.Printf("【input】:%v 【output】:%v\n", p, countStudents(p.students, p.sandwiches))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/1700.Number-of-Students-Unable-to-Eat-Lunch/README.md b/leetcode/1700.Number-of-Students-Unable-to-Eat-Lunch/README.md
new file mode 100644
index 000000000..1ff50247b
--- /dev/null
+++ b/leetcode/1700.Number-of-Students-Unable-to-Eat-Lunch/README.md
@@ -0,0 +1,79 @@
+# [1700. Number of Students Unable to Eat Lunch](https://leetcode.com/problems/number-of-students-unable-to-eat-lunch/)
+
+
+## 题目
+
+The school cafeteria offers circular and square sandwiches at lunch break, referred to by numbers `0` and `1` respectively. All students stand in a queue. Each student either prefers square or circular sandwiches.
+
+The number of sandwiches in the cafeteria is equal to the number of students. The sandwiches are placed in a **stack**. At each step:
+
+- If the student at the front of the queue **prefers** the sandwich on the top of the stack, they will **take it** and leave the queue.
+- Otherwise, they will **leave it** and go to the queue's end.
+
+This continues until none of the queue students want to take the top sandwich and are thus unable to eat.
+
+You are given two integer arrays `students` and `sandwiches` where `sandwiches[i]` is the type of the `ith` sandwich in the stack (`i = 0` is the top of the stack) and `students[j]` is the preference of the `jth` student in the initial queue (`j = 0` is the front of the queue). Return *the number of students that are unable to eat.*
+
+**Example 1:**
+
+```
+Input: students = [1,1,0,0], sandwiches = [0,1,0,1]
+Output: 0
+Explanation:
+- Front student leaves the top sandwich and returns to the end of the line making students = [1,0,0,1].
+- Front student leaves the top sandwich and returns to the end of the line making students = [0,0,1,1].
+- Front student takes the top sandwich and leaves the line making students = [0,1,1] and sandwiches = [1,0,1].
+- Front student leaves the top sandwich and returns to the end of the line making students = [1,1,0].
+- Front student takes the top sandwich and leaves the line making students = [1,0] and sandwiches = [0,1].
+- Front student leaves the top sandwich and returns to the end of the line making students = [0,1].
+- Front student takes the top sandwich and leaves the line making students = [1] and sandwiches = [1].
+- Front student takes the top sandwich and leaves the line making students = [] and sandwiches = [].
+Hence all students are able to eat.
+```
+
+**Example 2:**
+
+```
+Input: students = [1,1,1,0,0,1], sandwiches = [1,0,0,0,1,1]
+Output: 3
+```
+
+**Constraints:**
+
+- `1 <= students.length, sandwiches.length <= 100`
+- `students.length == sandwiches.length`
+- `sandwiches[i]` is `0` or `1`.
+- `students[i]` is `0` or `1`.
+
+## 题目大意
+
+学校的自助午餐提供圆形和方形的三明治，分别用数字 0 和 1 表示。所有学生站在一个队列里，每个学生要么喜欢圆形的要么喜欢方形的。
+餐厅里三明治的数量与学生的数量相同。所有三明治都放在一个 栈 里，每一轮：
+
+- 如果队列最前面的学生 喜欢 栈顶的三明治，那么会 拿走它 并离开队列。
+- 否则，这名学生会 放弃这个三明治 并回到队列的尾部。
+这个过程会一直持续到队列里所有学生都不喜欢栈顶的三明治为止。
+
+给你两个整数数组 students 和 sandwiches ，其中 sandwiches[i] 是栈里面第 i 个三明治的类型（i = 0 是栈的顶部）， students[j] 是初始队列里第 j 名学生对三明治的喜好（j = 0 是队列的最开始位置）。请你返回无法吃午餐的学生数量。
+
+## 解题思路
+
+- 简单题。按照题意，学生不管怎么轮流领三明治，如果数量够，经过多轮循环，总能领到。问题可以等价为，学生依次到队列前面领取三明治。2 个种类的三明治都摆好放在那里了。最终领不到三明治的学生都是因为喜欢的三明治不够发放了。按照这个思路，先统计 2 种三明治的总个数，然后减去学生对三明治的需求总数，剩下的学生即都是无法满足的。
+
+## 代码
+
+```go
+package leetcode
+
+func countStudents(students []int, sandwiches []int) int {
+ tmp, n, i := [2]int{}, len(students), 0
+ for _, v := range students {
+ tmp[v]++
+ }
+ for i < n && tmp[sandwiches[i]] > 0 {
+ tmp[sandwiches[i]]--
+ i++
+ }
+ return n - i
+}
+```
\ No newline at end of file
diff --git a/leetcode/1704.Determine-if-String-Halves-Are-Alike/1704. Determine if String Halves Are Alike.go b/leetcode/1704.Determine-if-String-Halves-Are-Alike/1704. Determine if String Halves Are Alike.go
new file mode 100644
index 000000000..4b2296824
--- /dev/null
+++ b/leetcode/1704.Determine-if-String-Halves-Are-Alike/1704. Determine if String Halves Are Alike.go
@@ -0,0 +1,16 @@
+package leetcode
+
+func halvesAreAlike(s string) bool {
+ return numVowels(s[len(s)/2:]) == numVowels(s[:len(s)/2])
+}
+
+func numVowels(x string) int {
+ res := 0
+ for _, c := range x {
+ switch c {
+ case 'a', 'e', 'i', 'o', 'u', 'A', 'E', 'I', 'O', 'U':
+ res++
+ }
+ }
+ return res
+}
diff --git a/leetcode/1704.Determine-if-String-Halves-Are-Alike/1704. Determine if String Halves Are Alike_test.go b/leetcode/1704.Determine-if-String-Halves-Are-Alike/1704. Determine if String Halves Are Alike_test.go
new file mode 100644
index 000000000..fd7060404
--- /dev/null
+++ b/leetcode/1704.Determine-if-String-Halves-Are-Alike/1704. Determine if String Halves Are Alike_test.go
@@ -0,0 +1,57 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question1704 struct {
+ para1704
+ ans1704
+}
+
+// para 是参数
+// one 代表第一个参数
+type para1704 struct {
+ s string
+}
+
+// ans 是答案
+// one 代表第一个答案
+type ans1704 struct {
+ one bool
+}
+
+func Test_Problem1704(t *testing.T) {
+
+ qs := []question1704{
+
+ {
+ para1704{"book"},
+ ans1704{true},
+ },
+
+ {
+ para1704{"textbook"},
+ ans1704{false},
+ },
+
+ {
+ para1704{"MerryChristmas"},
+ ans1704{false},
+ },
+
+ {
+ para1704{"AbCdEfGh"},
+ ans1704{true},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 1704------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans1704, q.para1704
+ fmt.Printf("【input】:%v 【output】:%v\n", p, halvesAreAlike(p.s))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/1704.Determine-if-String-Halves-Are-Alike/README.md b/leetcode/1704.Determine-if-String-Halves-Are-Alike/README.md
new file mode 100644
index 000000000..323687048
--- /dev/null
+++ b/leetcode/1704.Determine-if-String-Halves-Are-Alike/README.md
@@ -0,0 +1,75 @@
+# [1704. Determine if String Halves Are Alike](https://leetcode.com/problems/determine-if-string-halves-are-alike/)
+
+## 题目
+
+You are given a string `s` of even length. Split this string into two halves of equal lengths, and let `a` be the first half and `b` be the second half.
+
+Two strings are **alike** if they have the same number of vowels (`'a'`, `'e'`, `'i'`, `'o'`, `'u'`, `'A'`, `'E'`, `'I'`, `'O'`, `'U'`). Notice that `s` contains uppercase and lowercase letters.
+
+Return `true` *if* `a` *and* `b` *are **alike***. Otherwise, return `false`.
+
+**Example 1:**
+
+```
+Input: s = "book"
+Output: true
+Explanation: a = "bo" and b = "ok". a has 1 vowel and b has 1 vowel. Therefore, they are alike.
+```
+
+**Example 2:**
+
+```
+Input: s = "textbook"
+Output: false
+Explanation: a = "text" and b = "book". a has 1 vowel whereas b has 2. Therefore, they are not alike.
+Notice that the vowel o is counted twice.
+```
+
+**Example 3:**
+
+```
+Input: s = "MerryChristmas"
+Output: false
+```
+
+**Example 4:**
+
+```
+Input: s = "AbCdEfGh"
+Output: true
+```
+
+**Constraints:**
+
+- `2 <= s.length <= 1000`
+- `s.length` is even.
+- `s` consists of **uppercase and lowercase** letters.
+
+## 题目大意
+
+给你一个偶数长度的字符串 s 。将其拆分成长度相同的两半，前一半为 a ，后一半为 b 。两个字符串 相似 的前提是它们都含有相同数目的元音（'a'，'e'，'i'，'o'，'u'，'A'，'E'，'I'，'O'，'U'）。注意，s 可能同时含有大写和小写字母。如果 a 和 b 相似，返回 true ；否则，返回 false 。
+
+## 解题思路
+
+- 简单题。依题意，分别统计前半段元音字母的个数和后半段元音字母的个数，个数相同则输出 true，不同就输出 false。
+
+## 代码
+
+```go
+package leetcode
+
+func halvesAreAlike(s string) bool {
+ return numVowels(s[len(s)/2:]) == numVowels(s[:len(s)/2])
+}
+
+func numVowels(x string) int {
+ res := 0
+ for _, c := range x {
+ switch c {
+ case 'a', 'e', 'i', 'o', 'u', 'A', 'E', 'I', 'O', 'U':
+ res++
+ }
+ }
+ return res
+}
+```
\ No newline at end of file
diff --git a/leetcode/1705.Maximum-Number-of-Eaten-Apples/1705.Maximum Number of Eaten Apples.go b/leetcode/1705.Maximum-Number-of-Eaten-Apples/1705.Maximum Number of Eaten Apples.go
new file mode 100644
index 000000000..a4ffd6cf3
--- /dev/null
+++ b/leetcode/1705.Maximum-Number-of-Eaten-Apples/1705.Maximum Number of Eaten Apples.go
@@ -0,0 +1,67 @@
+package leetcode
+
+import "container/heap"
+
+func eatenApples(apples []int, days []int) int {
+ h := hp{}
+ i := 0
+ var ans int
+ for ; i < len(apples); i++ {
+ for len(h) > 0 && h[0].end <= i {
+ heap.Pop(&h)
+ }
+ if apples[i] > 0 {
+ heap.Push(&h, data{apples[i], i + days[i]})
+ }
+ if len(h) > 0 {
+ minData := heap.Pop(&h).(data)
+ ans++
+ if minData.left > 1 {
+ heap.Push(&h, data{minData.left - 1, minData.end})
+ }
+ }
+ }
+ for len(h) > 0 {
+ for len(h) > 0 && h[0].end <= i {
+ heap.Pop(&h)
+ }
+ if len(h) == 0 {
+ break
+ }
+ minData := heap.Pop(&h).(data)
+ nums := min(minData.left, minData.end-i)
+ ans += nums
+ i += nums
+ }
+ return ans
+}
+
+func min(a, b int) int {
+ if a < b {
+ return a
+ }
+ return b
+}
+
+type data struct {
+ left int
+ end int
+}
+
+type hp []data
+
+func (h hp) Len() int { return len(h) }
+func (h hp) Less(i, j int) bool { return h[i].end < h[j].end }
+func (h hp) Swap(i, j int) { h[i], h[j] = h[j], h[i] }
+
+func (h *hp) Push(x interface{}) {
+ *h = append(*h, x.(data))
+}
+
+func (h *hp) Pop() interface{} {
+ old := *h
+ n := len(old)
+ x := old[n-1]
+ *h = old[0 : n-1]
+ return x
+}
diff --git a/leetcode/1705.Maximum-Number-of-Eaten-Apples/1705.Maximum Number of Eaten Apples_test.go b/leetcode/1705.Maximum-Number-of-Eaten-Apples/1705.Maximum Number of Eaten Apples_test.go
new file mode 100644
index 000000000..3b178c7a0
--- /dev/null
+++ b/leetcode/1705.Maximum-Number-of-Eaten-Apples/1705.Maximum Number of Eaten Apples_test.go
@@ -0,0 +1,46 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question1705 struct {
+ para1705
+ ans1705
+}
+
+// para 是参数
+type para1705 struct {
+ apples []int
+ days []int
+}
+
+// ans 是答案
+type ans1705 struct {
+ ans int
+}
+
+func Test_Problem1705(t *testing.T) {
+
+ qs := []question1705{
+
+ {
+ para1705{[]int{1, 2, 3, 5, 2}, []int{3, 2, 1, 4, 2}},
+ ans1705{7},
+ },
+
+ {
+ para1705{[]int{3, 0, 0, 0, 0, 2}, []int{3, 0, 0, 0, 0, 2}},
+ ans1705{5},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 1705------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans1705, q.para1705
+ fmt.Printf("【input】:%v 【output】:%v\n", p, eatenApples(p.apples, p.days))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/1705.Maximum-Number-of-Eaten-Apples/README.md b/leetcode/1705.Maximum-Number-of-Eaten-Apples/README.md
new file mode 100644
index 000000000..b5717e75a
--- /dev/null
+++ b/leetcode/1705.Maximum-Number-of-Eaten-Apples/README.md
@@ -0,0 +1,124 @@
+# [1705. Maximum Number of Eaten Apples](https://leetcode.com/problems/maximum-number-of-eaten-apples/)
+
+## 题目
+
+There is a special kind of apple tree that grows apples every day for n days. On the ith day, the tree grows apples[i] apples that will rot after days[i] days, that is on day i + days[i] the apples will be rotten and cannot be eaten. On some days, the apple tree does not grow any apples, which are denoted by apples[i] == 0 and days[i] == 0.
+
+You decided to eat at most one apple a day (to keep the doctors away). Note that you can keep eating after the first n days.
+
+Given two integer arrays days and apples of length n, return the maximum number of apples you can eat.
+
+**Example 1**:
+
+ Input: apples = [1,2,3,5,2], days = [3,2,1,4,2]
+ Output: 7
+ Explanation: You can eat 7 apples:
+ - On the first day, you eat an apple that grew on the first day.
+ - On the second day, you eat an apple that grew on the second day.
+ - On the third day, you eat an apple that grew on the second day. After this day, the apples that grew on the third day rot.
+ - On the fourth to the seventh days, you eat apples that grew on the fourth day.
+
+**Example 2**:
+
+ Input: apples = [3,0,0,0,0,2], days = [3,0,0,0,0,2]
+ Output: 5
+ Explanation: You can eat 5 apples:
+ - On the first to the third day you eat apples that grew on the first day.
+ - Do nothing on the fouth and fifth days.
+ - On the sixth and seventh days you eat apples that grew on the sixth day.
+
+**Constraints:**
+
+- apples.length == n
+- days.length == n
+- 1 <= n <= 2 * 10000
+- 0 <= apples[i], days[i] <= 2 * 10000
+- days[i] = 0 if and only if apples[i] = 0.
+
+## 题目大意
+
+有一棵特殊的苹果树，一连 n 天，每天都可以长出若干个苹果。在第 i 天，树上会长出 apples[i] 个苹果，这些苹果将会在 days[i] 天后（也就是说，第 i + days[i] 天时）腐烂，变得无法食用。也可能有那么几天，树上不会长出新的苹果，此时用 apples[i] == 0 且 days[i] == 0 表示。
+
+你打算每天 最多 吃一个苹果来保证营养均衡。注意，你可以在这 n 天之后继续吃苹果。
+
+给你两个长度为 n 的整数数组 days 和 apples ，返回你可以吃掉的苹果的最大数目。
+
+## 解题思路
+
+贪心算法和最小堆
+
+ - data中的end表示腐烂的日期，left表示拥有的苹果数量
+ - 贪心:每天吃掉end最小但没有腐烂的苹果
+ - 最小堆:构造类型为数组(数组中元素的类型为data)的最小堆
+
+## 代码
+
+```go
+package leetcode
+
+import "container/heap"
+
+func eatenApples(apples []int, days []int) int {
+ h := hp{}
+ i := 0
+ var ans int
+ for ; i < len(apples); i++ {
+ for len(h) > 0 && h[0].end <= i {
+ heap.Pop(&h)
+ }
+ if apples[i] > 0 {
+ heap.Push(&h, data{apples[i], i + days[i]})
+ }
+ if len(h) > 0 {
+ minData := heap.Pop(&h).(data)
+ ans++
+ if minData.left > 1 {
+ heap.Push(&h, data{minData.left - 1, minData.end})
+ }
+ }
+ }
+ for len(h) > 0 {
+ for len(h) > 0 && h[0].end <= i {
+ heap.Pop(&h)
+ }
+ if len(h) == 0 {
+ break
+ }
+ minData := heap.Pop(&h).(data)
+ nums := min(minData.left, minData.end-i)
+ ans += nums
+ i += nums
+ }
+ return ans
+}
+
+func min(a, b int) int {
+ if a < b {
+ return a
+ }
+ return b
+}
+
+type data struct {
+ left int
+ end int
+}
+
+type hp []data
+
+func (h hp) Len() int { return len(h) }
+func (h hp) Less(i, j int) bool { return h[i].end < h[j].end }
+func (h hp) Swap(i, j int) { h[i], h[j] = h[j], h[i] }
+
+func (h *hp) Push(x interface{}) {
+ *h = append(*h, x.(data))
+}
+
+func (h *hp) Pop() interface{} {
+ old := *h
+ n := len(old)
+ x := old[n-1]
+ *h = old[0 : n-1]
+ return x
+}
+```
\ No newline at end of file
diff --git a/leetcode/1710.Maximum-Units-on-a-Truck/1710. Maximum Units on a Truck.go b/leetcode/1710.Maximum-Units-on-a-Truck/1710. Maximum Units on a Truck.go
new file mode 100644
index 000000000..7caf40e83
--- /dev/null
+++ b/leetcode/1710.Maximum-Units-on-a-Truck/1710. Maximum Units on a Truck.go
@@ -0,0 +1,20 @@
+package leetcode
+
+import "sort"
+
+func maximumUnits(boxTypes [][]int, truckSize int) int {
+ sort.Slice(boxTypes, func(i, j int) bool {
+ return boxTypes[i][1] > boxTypes[j][1]
+ })
+ res := 0
+ for i := 0; truckSize > 0 && i < len(boxTypes); i++ {
+ if truckSize >= boxTypes[i][0] {
+ truckSize -= boxTypes[i][0]
+ res += (boxTypes[i][1] * boxTypes[i][0])
+ } else {
+ res += (truckSize * boxTypes[i][1])
+ truckSize = 0
+ }
+ }
+ return res
+}
diff --git a/leetcode/1710.Maximum-Units-on-a-Truck/1710. Maximum Units on a Truck_test.go b/leetcode/1710.Maximum-Units-on-a-Truck/1710. Maximum Units on a Truck_test.go
new file mode 100644
index 000000000..2c2b216da
--- /dev/null
+++ b/leetcode/1710.Maximum-Units-on-a-Truck/1710. Maximum Units on a Truck_test.go
@@ -0,0 +1,48 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question1710 struct {
+ para1710
+ ans1710
+}
+
+// para 是参数
+// one 代表第一个参数
+type para1710 struct {
+ boxTypes [][]int
+ truckSize int
+}
+
+// ans 是答案
+// one 代表第一个答案
+type ans1710 struct {
+ one int
+}
+
+func Test_Problem1710(t *testing.T) {
+
+ qs := []question1710{
+
+ {
+ para1710{[][]int{{1, 3}, {2, 2}, {3, 1}}, 4},
+ ans1710{8},
+ },
+
+ {
+ para1710{[][]int{{5, 10}, {2, 5}, {4, 7}, {3, 9}}, 10},
+ ans1710{91},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 1710------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans1710, q.para1710
+ fmt.Printf("【input】:%v 【output】:%v\n", p, maximumUnits(p.boxTypes, p.truckSize))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/1710.Maximum-Units-on-a-Truck/README.md b/leetcode/1710.Maximum-Units-on-a-Truck/README.md
new file mode 100644
index 000000000..f6ab86363
--- /dev/null
+++ b/leetcode/1710.Maximum-Units-on-a-Truck/README.md
@@ -0,0 +1,77 @@
+# [1710. Maximum Units on a Truck](https://leetcode.com/problems/maximum-units-on-a-truck/)
+
+
+## 题目
+
+You are assigned to put some amount of boxes onto **one truck**. You are given a 2D array `boxTypes`, where `boxTypes[i] = [numberOfBoxesi, numberOfUnitsPerBoxi]`:
+
+- `numberOfBoxesi` is the number of boxes of type `i`.
+- `numberOfUnitsPerBoxi`is the number of units in each box of the type `i`.
+
+You are also given an integer `truckSize`, which is the **maximum** number of **boxes** that can be put on the truck. You can choose any boxes to put on the truck as long as the number of boxes does not exceed `truckSize`.
+
+Return *the **maximum** total number of **units** that can be put on the truck.*
+
+**Example 1:**
+
+```
+Input: boxTypes = [[1,3],[2,2],[3,1]], truckSize = 4
+Output: 8
+Explanation: There are:
+- 1 box of the first type that contains 3 units.
+- 2 boxes of the second type that contain 2 units each.
+- 3 boxes of the third type that contain 1 unit each.
+You can take all the boxes of the first and second types, and one box of the third type.
+The total number of units will be = (1 * 3) + (2 * 2) + (1 * 1) = 8.
+```
+
+**Example 2:**
+
+```
+Input: boxTypes = [[5,10],[2,5],[4,7],[3,9]], truckSize = 10
+Output: 91
+```
+
+**Constraints:**
+
+- `1 <= boxTypes.length <= 1000`
+- `1 <= numberOfBoxesi, numberOfUnitsPerBoxi <= 1000`
+- `1 <= truckSize <= 106`
+
+## 题目大意
+
+请你将一些箱子装在 一辆卡车 上。给你一个二维数组 boxTypes ，其中 boxTypes[i] = [numberOfBoxesi, numberOfUnitsPerBoxi] ：
+
+- numberOfBoxesi 是类型 i 的箱子的数量。-
+- numberOfUnitsPerBoxi 是类型 i 每个箱子可以装载的单元数量。
+
+整数 truckSize 表示卡车上可以装载 箱子 的 最大数量 。只要箱子数量不超过 truckSize ，你就可以选择任意箱子装到卡车上。返回卡车可以装载 单元 的 最大 总数。
+
+## 解题思路
+
+- 简单题。先将箱子按照单元数量从大到小排序。要想卡车装载单元数最大，那么需要尽量装单元数多的箱子。所以排序以后从单元数量多的箱子开始取。一直取至 truckSize 没有空间。累积的单元数即最大总数。
+
+## 代码
+
+```go
+package leetcode
+
+import "sort"
+
+func maximumUnits(boxTypes [][]int, truckSize int) int {
+ sort.Slice(boxTypes, func(i, j int) bool {
+ return boxTypes[i][1] > boxTypes[j][1]
+ })
+ res := 0
+ for i := 0; truckSize > 0 && i < len(boxTypes); i++ {
+ if truckSize >= boxTypes[i][0] {
+ truckSize -= boxTypes[i][0]
+ res += (boxTypes[i][1] * boxTypes[i][0])
+ } else {
+ res += (truckSize * boxTypes[i][1])
+ truckSize = 0
+ }
+ }
+ return res
+}
+```
\ No newline at end of file
diff --git a/leetcode/1716.Calculate-Money-in-Leetcode-Bank/1716. Calculate Money in Leetcode Bank.go b/leetcode/1716.Calculate-Money-in-Leetcode-Bank/1716. Calculate Money in Leetcode Bank.go
new file mode 100644
index 000000000..20e62732a
--- /dev/null
+++ b/leetcode/1716.Calculate-Money-in-Leetcode-Bank/1716. Calculate Money in Leetcode Bank.go
@@ -0,0 +1,13 @@
+package leetcode
+
+func totalMoney(n int) int {
+ res := 0
+ for tmp, count := 1, 7; n > 0; tmp, count = tmp+1, 7 {
+ for m := tmp; n > 0 && count > 0; m++ {
+ res += m
+ n--
+ count--
+ }
+ }
+ return res
+}
diff --git a/leetcode/1716.Calculate-Money-in-Leetcode-Bank/1716. Calculate Money in Leetcode Bank_test.go b/leetcode/1716.Calculate-Money-in-Leetcode-Bank/1716. Calculate Money in Leetcode Bank_test.go
new file mode 100644
index 000000000..e6c47c29c
--- /dev/null
+++ b/leetcode/1716.Calculate-Money-in-Leetcode-Bank/1716. Calculate Money in Leetcode Bank_test.go
@@ -0,0 +1,52 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question1716 struct {
+ para1716
+ ans1716
+}
+
+// para 是参数
+// one 代表第一个参数
+type para1716 struct {
+ n int
+}
+
+// ans 是答案
+// one 代表第一个答案
+type ans1716 struct {
+ one int
+}
+
+func Test_Problem1716(t *testing.T) {
+
+ qs := []question1716{
+
+ {
+ para1716{4},
+ ans1716{10},
+ },
+
+ {
+ para1716{10},
+ ans1716{37},
+ },
+
+ {
+ para1716{20},
+ ans1716{96},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 1716------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans1716, q.para1716
+ fmt.Printf("【input】:%v 【output】:%v\n", p, totalMoney(p.n))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/1716.Calculate-Money-in-Leetcode-Bank/README.md b/leetcode/1716.Calculate-Money-in-Leetcode-Bank/README.md
new file mode 100644
index 000000000..34eb627db
--- /dev/null
+++ b/leetcode/1716.Calculate-Money-in-Leetcode-Bank/README.md
@@ -0,0 +1,64 @@
+# [1716. Calculate Money in Leetcode Bank](https://leetcode.com/problems/calculate-money-in-leetcode-bank/)
+
+
+## 题目
+
+Hercy wants to save money for his first car. He puts money in the Leetcode bank **every day**.
+
+He starts by putting in `$1` on Monday, the first day. Every day from Tuesday to Sunday, he will put in `$1` more than the day before. On every subsequent Monday, he will put in `$1` more than the **previous Monday**.
+
+Given `n`, return *the total amount of money he will have in the Leetcode bank at the end of the* `nth` *day.*
+
+**Example 1:**
+
+```
+Input: n = 4
+Output: 10
+Explanation: After the 4th day, the total is 1 + 2 + 3 + 4 = 10.
+```
+
+**Example 2:**
+
+```
+Input: n = 10
+Output: 37
+Explanation: After the 10th day, the total is (1 + 2 + 3 + 4 + 5 + 6 + 7) + (2 + 3 + 4) = 37. Notice that on the 2nd Monday, Hercy only puts in $2.
+```
+
+**Example 3:**
+
+```
+Input: n = 20
+Output: 96
+Explanation: After the 20th day, the total is (1 + 2 + 3 + 4 + 5 + 6 + 7) + (2 + 3 + 4 + 5 + 6 + 7 + 8) + (3 + 4 + 5 + 6 + 7 + 8) = 96.
+```
+
+**Constraints:**
+
+- `1 <= n <= 1000`
+
+## 题目大意
+
+Hercy 想要为购买第一辆车存钱。他 每天 都往力扣银行里存钱。最开始，他在周一的时候存入 1 块钱。从周二到周日，他每天都比前一天多存入 1 块钱。在接下来每一个周一，他都会比 前一个周一 多存入 1 块钱。给你 n ，请你返回在第 n 天结束的时候他在力扣银行总共存了多少块钱。
+
+## 解题思路
+
+- 简单题。按照题意写 2 层循环即可。
+
+## 代码
+
+```go
+package leetcode
+
+func totalMoney(n int) int {
+ res := 0
+ for tmp, count := 1, 7; n > 0; tmp, count = tmp+1, 7 {
+ for m := tmp; n > 0 && count > 0; m++ {
+ res += m
+ n--
+ count--
+ }
+ }
+ return res
+}
+```
\ No newline at end of file
diff --git a/leetcode/1720.Decode-XORed-Array/1720. Decode XORed Array.go b/leetcode/1720.Decode-XORed-Array/1720. Decode XORed Array.go
new file mode 100644
index 000000000..108624cbc
--- /dev/null
+++ b/leetcode/1720.Decode-XORed-Array/1720. Decode XORed Array.go
@@ -0,0 +1,10 @@
+package leetcode
+
+func decode(encoded []int, first int) []int {
+ arr := make([]int, len(encoded)+1)
+ arr[0] = first
+ for i, val := range encoded {
+ arr[i+1] = arr[i] ^ val
+ }
+ return arr
+}
diff --git a/leetcode/1720.Decode-XORed-Array/1720. Decode XORed Array_test.go b/leetcode/1720.Decode-XORed-Array/1720. Decode XORed Array_test.go
new file mode 100644
index 000000000..2b152ecc2
--- /dev/null
+++ b/leetcode/1720.Decode-XORed-Array/1720. Decode XORed Array_test.go
@@ -0,0 +1,48 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question1720 struct {
+ para1720
+ ans1720
+}
+
+// para 是参数
+// one 代表第一个参数
+type para1720 struct {
+ encoded []int
+ first int
+}
+
+// ans 是答案
+// one 代表第一个答案
+type ans1720 struct {
+ one []int
+}
+
+func Test_Problem1720(t *testing.T) {
+
+ qs := []question1720{
+
+ {
+ para1720{[]int{1, 2, 3}, 1},
+ ans1720{[]int{1, 0, 2, 1}},
+ },
+
+ {
+ para1720{[]int{6, 2, 7, 3}, 4},
+ ans1720{[]int{4, 2, 0, 7, 4}},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 1720------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans1720, q.para1720
+ fmt.Printf("【input】:%v 【output】:%v\n", p, decode(p.encoded, p.first))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/1720.Decode-XORed-Array/README.md b/leetcode/1720.Decode-XORed-Array/README.md
new file mode 100644
index 000000000..9cff1dcc8
--- /dev/null
+++ b/leetcode/1720.Decode-XORed-Array/README.md
@@ -0,0 +1,59 @@
+# [1720. Decode XORed Array](https://leetcode.com/problems/decode-xored-array/)
+
+
+## 题目
+
+There is a **hidden** integer array `arr` that consists of `n` non-negative integers.
+
+It was encoded into another integer array `encoded` of length `n - 1`, such that `encoded[i] = arr[i] XOR arr[i + 1]`. For example, if `arr = [1,0,2,1]`, then `encoded = [1,2,3]`.
+
+You are given the `encoded` array. You are also given an integer `first`, that is the first element of `arr`, i.e. `arr[0]`.
+
+Return *the original array* `arr`. It can be proved that the answer exists and is unique.
+
+**Example 1:**
+
+```
+Input: encoded = [1,2,3], first = 1
+Output: [1,0,2,1]
+Explanation: If arr = [1,0,2,1], then first = 1 and encoded = [1 XOR 0, 0 XOR 2, 2 XOR 1] = [1,2,3]
+
+```
+
+**Example 2:**
+
+```
+Input: encoded = [6,2,7,3], first = 4
+Output: [4,2,0,7,4]
+
+```
+
+**Constraints:**
+
+- `2 <= n <= 104`
+- `encoded.length == n - 1`
+- `0 <= encoded[i] <= 105`
+- `0 <= first <= 10^5`
+
+## 题目大意
+
+未知 整数数组 arr 由 n 个非负整数组成。经编码后变为长度为 n - 1 的另一个整数数组 encoded ，其中 encoded[i] = arr[i] XOR arr[i + 1] 。例如，arr = [1,0,2,1] 经编码后得到 encoded = [1,2,3] 。给你编码后的数组 encoded 和原数组 arr 的第一个元素 first（arr[0]）。请解码返回原数组 arr 。可以证明答案存在并且是唯一的。
+
+## 解题思路
+
+- 简单题。按照题意，求返回解码以后的原数组，即将编码后的数组前后两两元素依次做异或 `XOR` 运算。
+
+## 代码
+
+```go
+package leetcode
+
+func decode(encoded []int, first int) []int {
+ arr := make([]int, len(encoded)+1)
+ arr[0] = first
+ for i, val := range encoded {
+ arr[i+1] = arr[i] ^ val
+ }
+ return arr
+}
+```
\ No newline at end of file
diff --git a/leetcode/1721.Swapping-Nodes-in-a-Linked-List/1721. Swapping Nodes in a Linked List.go b/leetcode/1721.Swapping-Nodes-in-a-Linked-List/1721. Swapping Nodes in a Linked List.go
new file mode 100644
index 000000000..7f5b5173c
--- /dev/null
+++ b/leetcode/1721.Swapping-Nodes-in-a-Linked-List/1721. Swapping Nodes in a Linked List.go
@@ -0,0 +1,36 @@
+package leetcode
+
+import (
+ "github.com/halfrost/LeetCode-Go/structures"
+)
+
+// ListNode define
+type ListNode = structures.ListNode
+
+/**
+ * Definition for singly-linked list.
+ * type ListNode struct {
+ * Val int
+ * Next *ListNode
+ * }
+ */
+func swapNodes(head *ListNode, k int) *ListNode {
+ count := 1
+ var a, b *ListNode
+ for node := head; node != nil; node = node.Next {
+ if count == k {
+ a = node
+ }
+ count++
+ }
+ length := count
+ count = 1
+ for node := head; node != nil; node = node.Next {
+ if count == length-k {
+ b = node
+ }
+ count++
+ }
+ a.Val, b.Val = b.Val, a.Val
+ return head
+}
diff --git a/leetcode/1721.Swapping-Nodes-in-a-Linked-List/1721. Swapping Nodes in a Linked List_test.go b/leetcode/1721.Swapping-Nodes-in-a-Linked-List/1721. Swapping Nodes in a Linked List_test.go
new file mode 100644
index 000000000..7a9345afb
--- /dev/null
+++ b/leetcode/1721.Swapping-Nodes-in-a-Linked-List/1721. Swapping Nodes in a Linked List_test.go
@@ -0,0 +1,66 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+
+ "github.com/halfrost/LeetCode-Go/structures"
+)
+
+type question2 struct {
+ para2
+ ans2
+}
+
+// para 是参数
+// one 代表第一个参数
+type para2 struct {
+ head []int
+ k int
+}
+
+// ans 是答案
+// one 代表第一个答案
+type ans2 struct {
+ one []int
+}
+
+func Test_Problem2(t *testing.T) {
+
+ qs := []question2{
+
+ {
+ para2{[]int{1, 2, 3, 4, 5}, 2},
+ ans2{[]int{1, 4, 3, 2, 5}},
+ },
+
+ {
+ para2{[]int{7, 9, 6, 6, 7, 8, 3, 0, 9, 5}, 5},
+ ans2{[]int{7, 9, 6, 6, 8, 7, 3, 0, 9, 5}},
+ },
+
+ {
+ para2{[]int{1}, 1},
+ ans2{[]int{1}},
+ },
+
+ {
+ para2{[]int{1, 2}, 1},
+ ans2{[]int{2, 1}},
+ },
+
+ {
+ para2{[]int{1, 2, 3}, 2},
+ ans2{[]int{1, 2, 3}},
+ },
+ // 如需多个测试，可以复制上方元素。
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 2------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans2, q.para2
+ fmt.Printf("【input】:%v 【output】:%v\n", p, structures.List2Ints(swapNodes(structures.Ints2List(p.head), p.k)))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/1721.Swapping-Nodes-in-a-Linked-List/README.md b/leetcode/1721.Swapping-Nodes-in-a-Linked-List/README.md
new file mode 100644
index 000000000..d05957693
--- /dev/null
+++ b/leetcode/1721.Swapping-Nodes-in-a-Linked-List/README.md
@@ -0,0 +1,100 @@
+# [1721. Swapping Nodes in a Linked List](https://leetcode.com/problems/swapping-nodes-in-a-linked-list/)
+
+
+## 题目
+
+You are given the `head` of a linked list, and an integer `k`.
+
+Return *the head of the linked list after **swapping** the values of the* `kth` *node from the beginning and the* `kth` *node from the end (the list is **1-indexed**).*
+
+**Example 1:**
+
+
+
+```
+Input: head = [1,2,3,4,5], k = 2
+Output: [1,4,3,2,5]
+```
+
+**Example 2:**
+
+```
+Input: head = [7,9,6,6,7,8,3,0,9,5], k = 5
+Output: [7,9,6,6,8,7,3,0,9,5]
+```
+
+**Example 3:**
+
+```
+Input: head = [1], k = 1
+Output: [1]
+```
+
+**Example 4:**
+
+```
+Input: head = [1,2], k = 1
+Output: [2,1]
+```
+
+**Example 5:**
+
+```
+Input: head = [1,2,3], k = 2
+Output: [1,2,3]
+```
+
+**Constraints:**
+
+- The number of nodes in the list is `n`.
+- `1 <= k <= n <= 10^5`
+- `0 <= Node.val <= 100`
+
+## 题目大意
+
+给你链表的头节点 `head` 和一个整数 `k` 。**交换** 链表正数第 `k` 个节点和倒数第 `k` 个节点的值后，返回链表的头节点（链表 **从 1 开始索引**）。
+
+## 解题思路
+
+- 这道题虽然是 medium，但是实际非常简单。题目要求链表中 2 个节点的值，无非是先找到这 2 个节点，然后再交换即可。链表查询节点需要 O(n)，2 次循环找到对应的 2 个节点，交换值即可。
+
+## 代码
+
+```go
+package leetcode
+
+import (
+ "github.com/halfrost/LeetCode-Go/structures"
+)
+
+// ListNode define
+type ListNode = structures.ListNode
+
+/**
+ * Definition for singly-linked list.
+ * type ListNode struct {
+ * Val int
+ * Next *ListNode
+ * }
+ */
+func swapNodes(head *ListNode, k int) *ListNode {
+ count := 1
+ var a, b *ListNode
+ for node := head; node != nil; node = node.Next {
+ if count == k {
+ a = node
+ }
+ count++
+ }
+ length := count
+ count = 1
+ for node := head; node != nil; node = node.Next {
+ if count == length-k {
+ b = node
+ }
+ count++
+ }
+ a.Val, b.Val = b.Val, a.Val
+ return head
+}
+```
\ No newline at end of file
diff --git a/leetcode/1725.Number-Of-Rectangles-That-Can-Form-The-Largest-Square/1725. Number Of Rectangles That Can Form The Largest Square.go b/leetcode/1725.Number-Of-Rectangles-That-Can-Form-The-Largest-Square/1725. Number Of Rectangles That Can Form The Largest Square.go
new file mode 100644
index 000000000..4c7bf664b
--- /dev/null
+++ b/leetcode/1725.Number-Of-Rectangles-That-Can-Form-The-Largest-Square/1725. Number Of Rectangles That Can Form The Largest Square.go
@@ -0,0 +1,20 @@
+package leetcode
+
+func countGoodRectangles(rectangles [][]int) int {
+ minLength, count := 0, 0
+ for i := range rectangles {
+ minSide := 0
+ if rectangles[i][0] <= rectangles[i][1] {
+ minSide = rectangles[i][0]
+ } else {
+ minSide = rectangles[i][1]
+ }
+ if minSide > minLength {
+ minLength = minSide
+ count = 1
+ } else if minSide == minLength {
+ count++
+ }
+ }
+ return count
+}
diff --git a/leetcode/1725.Number-Of-Rectangles-That-Can-Form-The-Largest-Square/1725. Number Of Rectangles That Can Form The Largest Square_test.go b/leetcode/1725.Number-Of-Rectangles-That-Can-Form-The-Largest-Square/1725. Number Of Rectangles That Can Form The Largest Square_test.go
new file mode 100644
index 000000000..40b7d86e9
--- /dev/null
+++ b/leetcode/1725.Number-Of-Rectangles-That-Can-Form-The-Largest-Square/1725. Number Of Rectangles That Can Form The Largest Square_test.go
@@ -0,0 +1,47 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question1725 struct {
+ para1725
+ ans1725
+}
+
+// para 是参数
+// one 代表第一个参数
+type para1725 struct {
+ rectangles [][]int
+}
+
+// ans 是答案
+// one 代表第一个答案
+type ans1725 struct {
+ one int
+}
+
+func Test_Problem1725(t *testing.T) {
+
+ qs := []question1725{
+
+ {
+ para1725{[][]int{{5, 8}, {3, 9}, {5, 12}, {16, 5}}},
+ ans1725{3},
+ },
+
+ {
+ para1725{[][]int{{2, 3}, {3, 7}, {4, 3}, {3, 7}}},
+ ans1725{3},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 1725------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans1725, q.para1725
+ fmt.Printf("【input】:%v 【output】:%v\n", p, countGoodRectangles(p.rectangles))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/1725.Number-Of-Rectangles-That-Can-Form-The-Largest-Square/README.md b/leetcode/1725.Number-Of-Rectangles-That-Can-Form-The-Largest-Square/README.md
new file mode 100644
index 000000000..0c59194fa
--- /dev/null
+++ b/leetcode/1725.Number-Of-Rectangles-That-Can-Form-The-Largest-Square/README.md
@@ -0,0 +1,68 @@
+# [1725. Number Of Rectangles That Can Form The Largest Square](https://leetcode.com/problems/number-of-rectangles-that-can-form-the-largest-square/)
+
+
+## 题目
+
+You are given an array `rectangles` where `rectangles[i] = [li, wi]` represents the `ith` rectangle of length `li` and width `wi`.
+
+You can cut the `ith` rectangle to form a square with a side length of `k` if both `k <= li` and `k <= wi`. For example, if you have a rectangle `[4,6]`, you can cut it to get a square with a side length of at most `4`.
+
+Let `maxLen` be the side length of the **largest** square you can obtain from any of the given rectangles.
+
+Return *the **number** of rectangles that can make a square with a side length of* `maxLen`.
+
+**Example 1:**
+
+```
+Input: rectangles = [[5,8],[3,9],[5,12],[16,5]]
+Output: 3
+Explanation: The largest squares you can get from each rectangle are of lengths [5,3,5,5].
+The largest possible square is of length 5, and you can get it out of 3 rectangles.
+```
+
+**Example 2:**
+
+```
+Input: rectangles = [[2,3],[3,7],[4,3],[3,7]]
+Output: 3
+```
+
+**Constraints:**
+
+- `1 <= rectangles.length <= 1000`
+- `rectangles[i].length == 2`
+- `1 <= li, wi <= 10^9`
+- `li != wi`
+
+## 题目大意
+
+给你一个数组 rectangles ，其中 rectangles[i] = [li, wi] 表示第 i 个矩形的长度为 li 、宽度为 wi 。如果存在 k 同时满足 k <= li 和 k <= wi ，就可以将第 i 个矩形切成边长为 k 的正方形。例如，矩形 [4,6] 可以切成边长最大为 4 的正方形。设 maxLen 为可以从矩形数组 rectangles 切分得到的 最大正方形 的边长。返回可以切出边长为 maxLen 的正方形的矩形 数目 。
+
+## 解题思路
+
+- 简单题。扫描数组中的每一个矩形，先找到边长较小的那条边，作为正方形的边长。扫描过程中动态更新最大的正方形边长，并累加计数。循环一遍结束，输出最终计数值即可。
+
+## 代码
+
+```go
+package leetcode
+
+func countGoodRectangles(rectangles [][]int) int {
+ minLength, count := 0, 0
+ for i, _ := range rectangles {
+ minSide := 0
+ if rectangles[i][0] <= rectangles[i][1] {
+ minSide = rectangles[i][0]
+ } else {
+ minSide = rectangles[i][1]
+ }
+ if minSide > minLength {
+ minLength = minSide
+ count = 1
+ } else if minSide == minLength {
+ count++
+ }
+ }
+ return count
+}
+```
\ No newline at end of file
diff --git a/leetcode/1732.Find-the-Highest-Altitude/1732. Find the Highest Altitude.go b/leetcode/1732.Find-the-Highest-Altitude/1732. Find the Highest Altitude.go
new file mode 100644
index 000000000..62d66bf6d
--- /dev/null
+++ b/leetcode/1732.Find-the-Highest-Altitude/1732. Find the Highest Altitude.go
@@ -0,0 +1,12 @@
+package leetcode
+
+func largestAltitude(gain []int) int {
+ max, height := 0, 0
+ for _, g := range gain {
+ height += g
+ if height > max {
+ max = height
+ }
+ }
+ return max
+}
diff --git a/leetcode/1732.Find-the-Highest-Altitude/1732. Find the Highest Altitude_test.go b/leetcode/1732.Find-the-Highest-Altitude/1732. Find the Highest Altitude_test.go
new file mode 100644
index 000000000..eb56bfe0f
--- /dev/null
+++ b/leetcode/1732.Find-the-Highest-Altitude/1732. Find the Highest Altitude_test.go
@@ -0,0 +1,47 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question1732 struct {
+ para1732
+ ans1732
+}
+
+// para 是参数
+// one 代表第一个参数
+type para1732 struct {
+ gain []int
+}
+
+// ans 是答案
+// one 代表第一个答案
+type ans1732 struct {
+ one int
+}
+
+func Test_Problem1732(t *testing.T) {
+
+ qs := []question1732{
+
+ {
+ para1732{[]int{-5, 1, 5, 0, -7}},
+ ans1732{1},
+ },
+
+ {
+ para1732{[]int{-4, -3, -2, -1, 4, 3, 2}},
+ ans1732{0},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 1732------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans1732, q.para1732
+ fmt.Printf("【input】:%v 【output】:%v\n", p, largestAltitude(p.gain))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/1732.Find-the-Highest-Altitude/README.md b/leetcode/1732.Find-the-Highest-Altitude/README.md
new file mode 100644
index 000000000..5b6b437d8
--- /dev/null
+++ b/leetcode/1732.Find-the-Highest-Altitude/README.md
@@ -0,0 +1,55 @@
+# [1732. Find the Highest Altitude](https://leetcode.com/problems/find-the-highest-altitude/)
+
+
+## 题目
+
+There is a biker going on a road trip. The road trip consists of `n + 1` points at different altitudes. The biker starts his trip on point `0` with altitude equal `0`.
+
+You are given an integer array `gain` of length `n` where `gain[i]` is the **net gain in altitude** between points `i` and `i + 1` for all (`0 <= i < n)`. Return *the **highest altitude** of a point.*
+
+**Example 1:**
+
+```
+Input: gain = [-5,1,5,0,-7]
+Output: 1
+Explanation: The altitudes are [0,-5,-4,1,1,-6]. The highest is 1.
+```
+
+**Example 2:**
+
+```
+Input: gain = [-4,-3,-2,-1,4,3,2]
+Output: 0
+Explanation: The altitudes are [0,-4,-7,-9,-10,-6,-3,-1]. The highest is 0.
+```
+
+**Constraints:**
+
+- `n == gain.length`
+- `1 <= n <= 100`
+- `100 <= gain[i] <= 100`
+
+## 题目大意
+
+有一个自行车手打算进行一场公路骑行，这条路线总共由 n + 1 个不同海拔的点组成。自行车手从海拔为 0 的点 0 开始骑行。给你一个长度为 n 的整数数组 gain ，其中 gain[i] 是点 i 和点 i + 1 的 净海拔高度差（0 <= i < n）。请你返回 最高点的海拔 。
+
+## 解题思路
+
+- 简单题。循环数组依次从第一个海拔点开始还原每个海拔点，动态记录最大高度。循环结束输出最大高度即可。
+
+## 代码
+
+```go
+package leetcode
+
+func largestAltitude(gain []int) int {
+ max, height := 0, 0
+ for _, g := range gain {
+ height += g
+ if height > max {
+ max = height
+ }
+ }
+ return max
+}
+```
\ No newline at end of file
diff --git a/leetcode/1734.Decode-XORed-Permutation/1734. Decode XORed Permutation.go b/leetcode/1734.Decode-XORed-Permutation/1734. Decode XORed Permutation.go
new file mode 100644
index 000000000..60f24d323
--- /dev/null
+++ b/leetcode/1734.Decode-XORed-Permutation/1734. Decode XORed Permutation.go
@@ -0,0 +1,17 @@
+package leetcode
+
+func decode(encoded []int) []int {
+ n, total, odd := len(encoded), 0, 0
+ for i := 1; i <= n+1; i++ {
+ total ^= i
+ }
+ for i := 1; i < n; i += 2 {
+ odd ^= encoded[i]
+ }
+ perm := make([]int, n+1)
+ perm[0] = total ^ odd
+ for i, v := range encoded {
+ perm[i+1] = perm[i] ^ v
+ }
+ return perm
+}
diff --git a/leetcode/1734.Decode-XORed-Permutation/1734. Decode XORed Permutation_test.go b/leetcode/1734.Decode-XORed-Permutation/1734. Decode XORed Permutation_test.go
new file mode 100644
index 000000000..837beab52
--- /dev/null
+++ b/leetcode/1734.Decode-XORed-Permutation/1734. Decode XORed Permutation_test.go
@@ -0,0 +1,47 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question1734 struct {
+ para1734
+ ans1734
+}
+
+// para 是参数
+// one 代表第一个参数
+type para1734 struct {
+ encoded []int
+}
+
+// ans 是答案
+// one 代表第一个答案
+type ans1734 struct {
+ one []int
+}
+
+func Test_Problem1734(t *testing.T) {
+
+ qs := []question1734{
+
+ {
+ para1734{[]int{3, 1}},
+ ans1734{[]int{1, 2, 3}},
+ },
+
+ {
+ para1734{[]int{6, 5, 4, 6}},
+ ans1734{[]int{2, 4, 1, 5, 3}},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 1734------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans1734, q.para1734
+ fmt.Printf("【input】:%v 【output】:%v\n", p, decode(p.encoded))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/1734.Decode-XORed-Permutation/README.md b/leetcode/1734.Decode-XORed-Permutation/README.md
new file mode 100644
index 000000000..b60ab2e63
--- /dev/null
+++ b/leetcode/1734.Decode-XORed-Permutation/README.md
@@ -0,0 +1,71 @@
+# [1734. Decode XORed Permutation](https://leetcode.com/problems/decode-xored-permutation/)
+
+
+## 题目
+
+There is an integer array `perm` that is a permutation of the first `n` positive integers, where `n` is always **odd**.
+
+It was encoded into another integer array `encoded` of length `n - 1`, such that `encoded[i] = perm[i] XOR perm[i + 1]`. For example, if `perm = [1,3,2]`, then `encoded = [2,1]`.
+
+Given the `encoded` array, return *the original array* `perm`. It is guaranteed that the answer exists and is unique.
+
+**Example 1:**
+
+```
+Input: encoded = [3,1]
+Output: [1,2,3]
+Explanation: If perm = [1,2,3], then encoded = [1 XOR 2,2 XOR 3] = [3,1]
+
+```
+
+**Example 2:**
+
+```
+Input: encoded = [6,5,4,6]
+Output: [2,4,1,5,3]
+
+```
+
+**Constraints:**
+
+- `3 <= n < 10^5`
+- `n` is odd.
+- `encoded.length == n - 1`
+
+## 题目大意
+
+给你一个整数数组 perm ，它是前 n 个正整数的排列，且 n 是个奇数 。它被加密成另一个长度为 n - 1 的整数数组 encoded ，满足 encoded[i] = perm[i] XOR perm[i + 1] 。比方说，如果 perm = [1,3,2] ，那么 encoded = [2,1] 。给你 encoded 数组，请你返回原始数组 perm 。题目保证答案存在且唯一。
+
+## 解题思路
+
+- 这一题与第 136 题和第 137 题思路类似，借用 `x ^ x = 0` 这个性质解题。依题意，原数组 perm 是 n 个正整数，即取值在 `[1,n+1]` 区间内，但是排列顺序未知。可以考虑先将 `[1,n+1]` 区间内的所有数异或得到 total。再将 encoded 数组中奇数下标的元素异或得到 odd：
+
+ $$\begin{aligned}odd &= encoded[1] + encoded[3] + ... + encoded[n-1]\\&= (perm[1] \,\, XOR \,\, perm[2]) + (perm[3] \,\, XOR \,\, perm[4]) + ... + (perm[n-1] \,\, XOR \,\, perm[n])\end{aligned}$$
+
+ total 是 n 个正整数异或全集，odd 是 `n-1` 个正整数异或集。两者异或 `total ^ odd` 得到的值必定是 perm[0]，因为 `x ^ x = 0`，那么重复出现的元素被异或以后消失了。算出 perm[0] 就好办了。
+
+ $$\begin{aligned}encoded[0] &= perm[0] \,\, XOR \,\, perm[1]\\perm[0] \,\, XOR \,\, encoded[0] &= perm[0] \,\, XOR \,\, perm[0] \,\, XOR \,\, perm[1] = perm[1]\\perm[1] \,\, XOR \,\, encoded[1] &= perm[1] \,\, XOR \,\, perm[1] \,\, XOR \,\, perm[2] = perm[2]\\...\\perm[n-1] \,\, XOR \,\, encoded[n-1] &= perm[n-1] \,\, XOR \,\, perm[n-1] \,\, XOR \,\, perm[n] = perm[n]\\\end{aligned}$$
+
+ 依次类推，便可以推出原数组 perm 中的所有数。
+
+## 代码
+
+```go
+package leetcode
+
+func decode(encoded []int) []int {
+ n, total, odd := len(encoded), 0, 0
+ for i := 1; i <= n+1; i++ {
+ total ^= i
+ }
+ for i := 1; i < n; i += 2 {
+ odd ^= encoded[i]
+ }
+ perm := make([]int, n+1)
+ perm[0] = total ^ odd
+ for i, v := range encoded {
+ perm[i+1] = perm[i] ^ v
+ }
+ return perm
+}
+```
\ No newline at end of file
diff --git a/leetcode/1736.Latest-Time-by-Replacing-Hidden-Digits/1736. Latest Time by Replacing Hidden Digits.go b/leetcode/1736.Latest-Time-by-Replacing-Hidden-Digits/1736. Latest Time by Replacing Hidden Digits.go
new file mode 100644
index 000000000..7b30b387c
--- /dev/null
+++ b/leetcode/1736.Latest-Time-by-Replacing-Hidden-Digits/1736. Latest Time by Replacing Hidden Digits.go
@@ -0,0 +1,25 @@
+package leetcode
+
+func maximumTime(time string) string {
+ timeb := []byte(time)
+ if timeb[3] == '?' {
+ timeb[3] = '5'
+ }
+ if timeb[4] == '?' {
+ timeb[4] = '9'
+ }
+ if timeb[0] == '?' {
+ if int(timeb[1]-'0') > 3 && int(timeb[1]-'0') < 10 {
+ timeb[0] = '1'
+ } else {
+ timeb[0] = '2'
+ }
+ }
+ if timeb[1] == '?' {
+ timeb[1] = '9'
+ }
+ if timeb[0] == '2' && timeb[1] == '9' {
+ timeb[1] = '3'
+ }
+ return string(timeb)
+}
diff --git a/leetcode/1736.Latest-Time-by-Replacing-Hidden-Digits/1736. Latest Time by Replacing Hidden Digits_test.go b/leetcode/1736.Latest-Time-by-Replacing-Hidden-Digits/1736. Latest Time by Replacing Hidden Digits_test.go
new file mode 100644
index 000000000..2213b85f1
--- /dev/null
+++ b/leetcode/1736.Latest-Time-by-Replacing-Hidden-Digits/1736. Latest Time by Replacing Hidden Digits_test.go
@@ -0,0 +1,52 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question1736 struct {
+ para1736
+ ans1736
+}
+
+// para 是参数
+// one 代表第一个参数
+type para1736 struct {
+ time string
+}
+
+// ans 是答案
+// one 代表第一个答案
+type ans1736 struct {
+ one string
+}
+
+func Test_Problem1736(t *testing.T) {
+
+ qs := []question1736{
+
+ {
+ para1736{"2?:?0"},
+ ans1736{"23:50"},
+ },
+
+ {
+ para1736{"0?:3?"},
+ ans1736{"09:39"},
+ },
+
+ {
+ para1736{"1?:22"},
+ ans1736{"19:22"},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 1736------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans1736, q.para1736
+ fmt.Printf("【input】:%v 【output】:%v\n", p, maximumTime(p.time))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/1736.Latest-Time-by-Replacing-Hidden-Digits/README.md b/leetcode/1736.Latest-Time-by-Replacing-Hidden-Digits/README.md
new file mode 100644
index 000000000..a34ceb176
--- /dev/null
+++ b/leetcode/1736.Latest-Time-by-Replacing-Hidden-Digits/README.md
@@ -0,0 +1,75 @@
+# [1736. Latest Time by Replacing Hidden Digits](https://leetcode.com/problems/latest-time-by-replacing-hidden-digits/)
+
+
+## 题目
+
+You are given a string `time` in the form of `hh:mm`, where some of the digits in the string are hidden (represented by `?`).
+
+The valid times are those inclusively between `00:00` and `23:59`.
+
+Return *the latest valid time you can get from* `time` *by replacing the hidden* *digits*.
+
+**Example 1:**
+
+```
+Input: time = "2?:?0"
+Output: "23:50"
+Explanation: The latest hour beginning with the digit '2' is 23 and the latest minute ending with the digit '0' is 50.
+```
+
+**Example 2:**
+
+```
+Input: time = "0?:3?"
+Output: "09:39"
+```
+
+**Example 3:**
+
+```
+Input: time = "1?:22"
+Output: "19:22"
+```
+
+**Constraints:**
+
+- `time` is in the format `hh:mm`.
+- It is guaranteed that you can produce a valid time from the given string.
+
+## 题目大意
+
+给你一个字符串 time ，格式为 hh:mm（小时：分钟），其中某几位数字被隐藏（用 ? 表示）。有效的时间为 00:00 到 23:59 之间的所有时间，包括 00:00 和 23:59 。替换 time 中隐藏的数字，返回你可以得到的最晚有效时间。
+
+## 解题思路
+
+- 简单题。根据题意，需要找到最晚的有效时间。枚举时间 4 个位置即可。如果第 3 个位置是 ？，那么它最晚时间是 5；如果第 4 个位置是 ？，那么它最晚时间是 9；如果第 2 个位置是 ？，那么它最晚时间是 9；如果第 1 个位置是 ？，根据第 2 个位置判断，如果第 2 个位置是大于 3 的数，那么第一个位置最晚时间是 1，如果第 2 个位置是小于 3 的数那么第一个位置最晚时间是 2 。按照上述规则即可还原最晚时间。
+
+## 代码
+
+```go
+package leetcode
+
+func maximumTime(time string) string {
+ timeb := []byte(time)
+ if timeb[3] == '?' {
+ timeb[3] = '5'
+ }
+ if timeb[4] == '?' {
+ timeb[4] = '9'
+ }
+ if timeb[0] == '?' {
+ if int(timeb[1]-'0') > 3 && int(timeb[1]-'0') < 10 {
+ timeb[0] = '1'
+ } else {
+ timeb[0] = '2'
+ }
+ }
+ if timeb[1] == '?' {
+ timeb[1] = '9'
+ }
+ if timeb[0] == '2' && timeb[1] == '9' {
+ timeb[1] = '3'
+ }
+ return string(timeb)
+}
+```
\ No newline at end of file
diff --git a/leetcode/1738.Find-Kth-Largest-XOR-Coordinate-Value/1738. Find Kth Largest XOR Coordinate Value.go b/leetcode/1738.Find-Kth-Largest-XOR-Coordinate-Value/1738. Find Kth Largest XOR Coordinate Value.go
new file mode 100644
index 000000000..8c5760ef4
--- /dev/null
+++ b/leetcode/1738.Find-Kth-Largest-XOR-Coordinate-Value/1738. Find Kth Largest XOR Coordinate Value.go
@@ -0,0 +1,36 @@
+package leetcode
+
+import "sort"
+
+// 解法一 压缩版的前缀和
+func kthLargestValue(matrix [][]int, k int) int {
+ if len(matrix) == 0 || len(matrix[0]) == 0 {
+ return 0
+ }
+ res, prefixSum := make([]int, 0, len(matrix)*len(matrix[0])), make([]int, len(matrix[0]))
+ for i := range matrix {
+ line := 0
+ for j, v := range matrix[i] {
+ line ^= v
+ prefixSum[j] ^= line
+ res = append(res, prefixSum[j])
+ }
+ }
+ sort.Ints(res)
+ return res[len(res)-k]
+}
+
+// 解法二 前缀和
+func kthLargestValue1(matrix [][]int, k int) int {
+ nums, prefixSum := []int{}, make([][]int, len(matrix)+1)
+ prefixSum[0] = make([]int, len(matrix[0])+1)
+ for i, row := range matrix {
+ prefixSum[i+1] = make([]int, len(matrix[0])+1)
+ for j, val := range row {
+ prefixSum[i+1][j+1] = prefixSum[i+1][j] ^ prefixSum[i][j+1] ^ prefixSum[i][j] ^ val
+ nums = append(nums, prefixSum[i+1][j+1])
+ }
+ }
+ sort.Ints(nums)
+ return nums[len(nums)-k]
+}
diff --git a/leetcode/1738.Find-Kth-Largest-XOR-Coordinate-Value/1738. Find Kth Largest XOR Coordinate Value_test.go b/leetcode/1738.Find-Kth-Largest-XOR-Coordinate-Value/1738. Find Kth Largest XOR Coordinate Value_test.go
new file mode 100644
index 000000000..90d199ecc
--- /dev/null
+++ b/leetcode/1738.Find-Kth-Largest-XOR-Coordinate-Value/1738. Find Kth Largest XOR Coordinate Value_test.go
@@ -0,0 +1,58 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question1738 struct {
+ para1738
+ ans1738
+}
+
+// para 是参数
+// one 代表第一个参数
+type para1738 struct {
+ matrix [][]int
+ k int
+}
+
+// ans 是答案
+// one 代表第一个答案
+type ans1738 struct {
+ one int
+}
+
+func Test_Problem1738(t *testing.T) {
+
+ qs := []question1738{
+
+ {
+ para1738{[][]int{{5, 2}, {1, 6}}, 1},
+ ans1738{7},
+ },
+
+ {
+ para1738{[][]int{{5, 2}, {1, 6}}, 2},
+ ans1738{5},
+ },
+
+ {
+ para1738{[][]int{{5, 2}, {1, 6}}, 3},
+ ans1738{4},
+ },
+
+ {
+ para1738{[][]int{{5, 2}, {1, 6}}, 4},
+ ans1738{0},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 1738------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans1738, q.para1738
+ fmt.Printf("【input】:%v 【output】:%v\n", p, kthLargestValue(p.matrix, p.k))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/1738.Find-Kth-Largest-XOR-Coordinate-Value/README.md b/leetcode/1738.Find-Kth-Largest-XOR-Coordinate-Value/README.md
new file mode 100644
index 000000000..a264778a4
--- /dev/null
+++ b/leetcode/1738.Find-Kth-Largest-XOR-Coordinate-Value/README.md
@@ -0,0 +1,111 @@
+# [1738. Find Kth Largest XOR Coordinate Value](https://leetcode.com/problems/find-kth-largest-xor-coordinate-value/)
+
+
+## 题目
+
+You are given a 2D `matrix` of size `m x n`, consisting of non-negative integers. You are also given an integer `k`.
+
+The **value** of coordinate `(a, b)` of the matrix is the XOR of all `matrix[i][j]` where `0 <= i <= a < m` and `0 <= j <= b < n` **(0-indexed)**.
+
+Find the `kth` largest value **(1-indexed)** of all the coordinates of `matrix`.
+
+**Example 1:**
+
+```
+Input: matrix = [[5,2],[1,6]], k = 1
+Output: 7
+Explanation: The value of coordinate (0,1) is 5 XOR 2 = 7, which is the largest value.
+```
+
+**Example 2:**
+
+```
+Input: matrix = [[5,2],[1,6]], k = 2
+Output: 5
+Explanation:The value of coordinate (0,0) is 5 = 5, which is the 2nd largest value.
+```
+
+**Example 3:**
+
+```
+Input: matrix = [[5,2],[1,6]], k = 3
+Output: 4
+Explanation: The value of coordinate (1,0) is 5 XOR 1 = 4, which is the 3rd largest value.
+```
+
+**Example 4:**
+
+```
+Input: matrix = [[5,2],[1,6]], k = 4
+Output: 0
+Explanation: The value of coordinate (1,1) is 5 XOR 2 XOR 1 XOR 6 = 0, which is the 4th largest value.
+```
+
+**Constraints:**
+
+- `m == matrix.length`
+- `n == matrix[i].length`
+- `1 <= m, n <= 1000`
+- `0 <= matrix[i][j] <= 10^6`
+- `1 <= k <= m * n`
+
+## 题目大意
+
+给你一个二维矩阵 matrix 和一个整数 k ，矩阵大小为 m x n 由非负整数组成。矩阵中坐标 (a, b) 的 值 可由对所有满足 0 <= i <= a < m 且 0 <= j <= b < n 的元素 matrix[i][j]（下标从 0 开始计数）执行异或运算得到。请你找出 matrix 的所有坐标中第 k 大的值（k 的值从 1 开始计数）。
+
+## 解题思路
+
+- 区间异或结果类比于区间二维前缀和。只不过需要注意 x^x = 0 这一性质。举例：
+
+ 
+
+ 通过简单推理，可以得出区间二维前缀和 preSum 的递推式。具体代码见解法二。
+
+- 上面的解法中，preSum 用二维数组计算的。能否再优化空间复杂度，降低成 O(n)？答案是可以的。通过观察可以发现。preSum 可以按照一行一行来生成。先生成 preSum 前一行，下一行生成过程中会用到前一行的信息，异或计算以后，可以覆盖原数据(前一行的信息)，对之后的计算没有影响。这个优化空间复杂度的方法和优化 DP 空间复杂度是完全一样的思路和方法。
+
+ 
+
+ 具体代码见解法一。
+
+- 计算出了 preSum，还需要考虑如何输出第 k 大的值。有 3 种做法，第一种是排序，第二种是优先队列，第三种是第 215 题中的 O(n) 的 partition 方法。时间复杂度最低的当然是 O(n)。但是经过实际测试，runtime 最优的是排序的方法。所以笔者以下两种方法均采用了排序的方法。
+
+## 代码
+
+```go
+package leetcode
+
+import "sort"
+
+// 解法一 压缩版的前缀和
+func kthLargestValue(matrix [][]int, k int) int {
+ if len(matrix) == 0 || len(matrix[0]) == 0 {
+ return 0
+ }
+ res, prefixSum := make([]int, 0, len(matrix)*len(matrix[0])), make([]int, len(matrix[0]))
+ for i := range matrix {
+ line := 0
+ for j, v := range matrix[i] {
+ line ^= v
+ prefixSum[j] ^= line
+ res = append(res, prefixSum[j])
+ }
+ }
+ sort.Ints(res)
+ return res[len(res)-k]
+}
+
+// 解法二 前缀和
+func kthLargestValue1(matrix [][]int, k int) int {
+ nums, prefixSum := []int{}, make([][]int, len(matrix)+1)
+ prefixSum[0] = make([]int, len(matrix[0])+1)
+ for i, row := range matrix {
+ prefixSum[i+1] = make([]int, len(matrix[0])+1)
+ for j, val := range row {
+ prefixSum[i+1][j+1] = prefixSum[i+1][j] ^ prefixSum[i][j+1] ^ prefixSum[i][j] ^ val
+ nums = append(nums, prefixSum[i+1][j+1])
+ }
+ }
+ sort.Ints(nums)
+ return nums[len(nums)-k]
+}
+```
\ No newline at end of file
diff --git a/leetcode/1742.Maximum-Number-of-Balls-in-a-Box/1742. Maximum Number of Balls in a Box.go b/leetcode/1742.Maximum-Number-of-Balls-in-a-Box/1742. Maximum Number of Balls in a Box.go
new file mode 100644
index 000000000..e4d415872
--- /dev/null
+++ b/leetcode/1742.Maximum-Number-of-Balls-in-a-Box/1742. Maximum Number of Balls in a Box.go
@@ -0,0 +1,17 @@
+package leetcode
+
+func countBalls(lowLimit int, highLimit int) int {
+ buckets, maxBall := [46]int{}, 0
+ for i := lowLimit; i <= highLimit; i++ {
+ t := 0
+ for j := i; j > 0; {
+ t += j % 10
+ j = j / 10
+ }
+ buckets[t]++
+ if buckets[t] > maxBall {
+ maxBall = buckets[t]
+ }
+ }
+ return maxBall
+}
diff --git a/leetcode/1742.Maximum-Number-of-Balls-in-a-Box/1742. Maximum Number of Balls in a Box_test.go b/leetcode/1742.Maximum-Number-of-Balls-in-a-Box/1742. Maximum Number of Balls in a Box_test.go
new file mode 100644
index 000000000..06bc63a1e
--- /dev/null
+++ b/leetcode/1742.Maximum-Number-of-Balls-in-a-Box/1742. Maximum Number of Balls in a Box_test.go
@@ -0,0 +1,53 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question1742 struct {
+ para1742
+ ans1742
+}
+
+// para 是参数
+// one 代表第一个参数
+type para1742 struct {
+ lowLimit int
+ highLimit int
+}
+
+// ans 是答案
+// one 代表第一个答案
+type ans1742 struct {
+ one int
+}
+
+func Test_Problem1742(t *testing.T) {
+
+ qs := []question1742{
+
+ {
+ para1742{1, 10},
+ ans1742{2},
+ },
+
+ {
+ para1742{5, 15},
+ ans1742{2},
+ },
+
+ {
+ para1742{19, 28},
+ ans1742{2},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 1742------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans1742, q.para1742
+ fmt.Printf("【input】:%v 【output】:%v\n", p, countBalls(p.lowLimit, p.highLimit))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/1742.Maximum-Number-of-Balls-in-a-Box/README.md b/leetcode/1742.Maximum-Number-of-Balls-in-a-Box/README.md
new file mode 100644
index 000000000..5c5284b61
--- /dev/null
+++ b/leetcode/1742.Maximum-Number-of-Balls-in-a-Box/README.md
@@ -0,0 +1,81 @@
+# [1742. Maximum Number of Balls in a Box](https://leetcode.com/problems/maximum-number-of-balls-in-a-box/)
+
+
+## 题目
+
+You are working in a ball factory where you have `n` balls numbered from `lowLimit` up to `highLimit` **inclusive** (i.e., `n == highLimit - lowLimit + 1`), and an infinite number of boxes numbered from `1` to `infinity`.
+
+Your job at this factory is to put each ball in the box with a number equal to the sum of digits of the ball's number. For example, the ball number `321` will be put in the box number `3 + 2 + 1 = 6` and the ball number `10` will be put in the box number `1 + 0 = 1`.
+
+Given two integers `lowLimit` and `highLimit`, return *the number of balls in the box with the most balls.*
+
+**Example 1:**
+
+```
+Input: lowLimit = 1, highLimit = 10
+Output: 2
+Explanation:
+Box Number: 1 2 3 4 5 6 7 8 9 10 11 ...
+Ball Count: 2 1 1 1 1 1 1 1 1 0 0 ...
+Box 1 has the most number of balls with 2 balls.
+```
+
+**Example 2:**
+
+```
+Input: lowLimit = 5, highLimit = 15
+Output: 2
+Explanation:
+Box Number: 1 2 3 4 5 6 7 8 9 10 11 ...
+Ball Count: 1 1 1 1 2 2 1 1 1 0 0 ...
+Boxes 5 and 6 have the most number of balls with 2 balls in each.
+
+```
+
+**Example 3:**
+
+```
+Input: lowLimit = 19, highLimit = 28
+Output: 2
+Explanation:
+Box Number: 1 2 3 4 5 6 7 8 9 10 11 12 ...
+Ball Count: 0 1 1 1 1 1 1 1 1 2 0 0 ...
+Box 10 has the most number of balls with 2 balls.
+
+```
+
+**Constraints:**
+
+- `1 <= lowLimit <= highLimit <= 10^5`
+
+## 题目大意
+
+你在一家生产小球的玩具厂工作，有 n 个小球，编号从 lowLimit 开始，到 highLimit 结束（包括 lowLimit 和 highLimit ，即 n == highLimit - lowLimit + 1）。另有无限数量的盒子，编号从 1 到 infinity 。你的工作是将每个小球放入盒子中，其中盒子的编号应当等于小球编号上每位数字的和。例如，编号 321 的小球应当放入编号 3 + 2 + 1 = 6 的盒子，而编号 10 的小球应当放入编号 1 + 0 = 1 的盒子。
+
+给你两个整数 lowLimit 和 highLimit ，返回放有最多小球的盒子中的小球数量。如果有多个盒子都满足放有最多小球，只需返回其中任一盒子的小球数量。
+
+## 解题思路
+
+- 简单题。循环遍历一遍数组，依次计算出所有小球的编号各位数字累加和，并且动态维护放有小球最多的数目。循环结束，输出最多小球个数即可。
+
+## 代码
+
+```go
+package leetcode
+
+func countBalls(lowLimit int, highLimit int) int {
+ buckets, maxBall := [46]int{}, 0
+ for i := lowLimit; i <= highLimit; i++ {
+ t := 0
+ for j := i; j > 0; {
+ t += j % 10
+ j = j / 10
+ }
+ buckets[t]++
+ if buckets[t] > maxBall {
+ maxBall = buckets[t]
+ }
+ }
+ return maxBall
+}
+```
\ No newline at end of file
diff --git a/leetcode/1744.Can-You-Eat-Your-Favorite-Candy-on-Your-Favorite-Day/1744. Can You Eat Your Favorite Candy on Your Favorite Day.go b/leetcode/1744.Can-You-Eat-Your-Favorite-Candy-on-Your-Favorite-Day/1744. Can You Eat Your Favorite Candy on Your Favorite Day.go
new file mode 100644
index 000000000..ce89feb07
--- /dev/null
+++ b/leetcode/1744.Can-You-Eat-Your-Favorite-Candy-on-Your-Favorite-Day/1744. Can You Eat Your Favorite Candy on Your Favorite Day.go
@@ -0,0 +1,23 @@
+package leetcode
+
+func canEat(candiesCount []int, queries [][]int) []bool {
+ n := len(candiesCount)
+ prefixSum := make([]int, n)
+ prefixSum[0] = candiesCount[0]
+ for i := 1; i < n; i++ {
+ prefixSum[i] = prefixSum[i-1] + candiesCount[i]
+ }
+ res := make([]bool, len(queries))
+ for i, q := range queries {
+ favoriteType, favoriteDay, dailyCap := q[0], q[1], q[2]
+ x1 := favoriteDay + 1
+ y1 := (favoriteDay + 1) * dailyCap
+ x2 := 1
+ if favoriteType > 0 {
+ x2 = prefixSum[favoriteType-1] + 1
+ }
+ y2 := prefixSum[favoriteType]
+ res[i] = !(x1 > y2 || y1 < x2)
+ }
+ return res
+}
diff --git a/leetcode/1744.Can-You-Eat-Your-Favorite-Candy-on-Your-Favorite-Day/1744. Can You Eat Your Favorite Candy on Your Favorite Day_test.go b/leetcode/1744.Can-You-Eat-Your-Favorite-Candy-on-Your-Favorite-Day/1744. Can You Eat Your Favorite Candy on Your Favorite Day_test.go
new file mode 100644
index 000000000..73a486bcd
--- /dev/null
+++ b/leetcode/1744.Can-You-Eat-Your-Favorite-Candy-on-Your-Favorite-Day/1744. Can You Eat Your Favorite Candy on Your Favorite Day_test.go
@@ -0,0 +1,48 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question1744 struct {
+ para1744
+ ans1744
+}
+
+// para 是参数
+// one 代表第一个参数
+type para1744 struct {
+ candiesCount []int
+ queries [][]int
+}
+
+// ans 是答案
+// one 代表第一个答案
+type ans1744 struct {
+ one []bool
+}
+
+func Test_Problem1744(t *testing.T) {
+
+ qs := []question1744{
+
+ {
+ para1744{[]int{7, 4, 5, 3, 8}, [][]int{{0, 2, 2}, {4, 2, 4}, {2, 13, 1000000000}}},
+ ans1744{[]bool{true, false, true}},
+ },
+
+ {
+ para1744{[]int{5, 2, 6, 4, 1}, [][]int{{3, 1, 2}, {4, 10, 3}, {3, 10, 100}, {4, 100, 30}, {1, 3, 1}}},
+ ans1744{[]bool{false, true, true, false, false}},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 1744------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans1744, q.para1744
+ fmt.Printf("【input】:%v 【output】:%v\n", p, canEat(p.candiesCount, p.queries))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/1744.Can-You-Eat-Your-Favorite-Candy-on-Your-Favorite-Day/README.md b/leetcode/1744.Can-You-Eat-Your-Favorite-Candy-on-Your-Favorite-Day/README.md
new file mode 100644
index 000000000..bb06c20a2
--- /dev/null
+++ b/leetcode/1744.Can-You-Eat-Your-Favorite-Candy-on-Your-Favorite-Day/README.md
@@ -0,0 +1,88 @@
+# [1744. Can You Eat Your Favorite Candy on Your Favorite Day?](https://leetcode.com/problems/can-you-eat-your-favorite-candy-on-your-favorite-day/)
+
+## 题目
+
+You are given a **(0-indexed)** array of positive integers `candiesCount` where `candiesCount[i]` represents the number of candies of the `ith` type you have. You are also given a 2D array `queries` where `queries[i] = [favoriteTypei, favoriteDayi, dailyCapi]`.
+
+You play a game with the following rules:
+
+- You start eating candies on day **`0`**.
+- You **cannot** eat **any** candy of type `i` unless you have eaten **all** candies of type `i - 1`.
+- You must eat **at least** **one** candy per day until you have eaten all the candies.
+
+Construct a boolean array `answer` such that `answer.length == queries.length` and `answer[i]` is `true` if you can eat a candy of type `favoriteTypei` on day `favoriteDayi` without eating **more than** `dailyCapi` candies on **any** day, and `false` otherwise. Note that you can eat different types of candy on the same day, provided that you follow rule 2.
+
+Return *the constructed array* `answer`.
+
+**Example 1:**
+
+```
+Input: candiesCount = [7,4,5,3,8], queries = [[0,2,2],[4,2,4],[2,13,1000000000]]
+Output: [true,false,true]
+Explanation:
+1- If you eat 2 candies (type 0) on day 0 and 2 candies (type 0) on day 1, you will eat a candy of type 0 on day 2.
+2- You can eat at most 4 candies each day.
+ If you eat 4 candies every day, you will eat 4 candies (type 0) on day 0 and 4 candies (type 0 and type 1) on day 1.
+ On day 2, you can only eat 4 candies (type 1 and type 2), so you cannot eat a candy of type 4 on day 2.
+3- If you eat 1 candy each day, you will eat a candy of type 2 on day 13.
+```
+
+**Example 2:**
+
+```
+Input: candiesCount = [5,2,6,4,1], queries = [[3,1,2],[4,10,3],[3,10,100],[4,100,30],[1,3,1]]
+Output: [false,true,true,false,false]
+```
+
+**Constraints:**
+
+- `1 <= candiesCount.length <= 105`
+- `1 <= candiesCount[i] <= 105`
+- `1 <= queries.length <= 105`
+- `queries[i].length == 3`
+- `0 <= favoriteTypei < candiesCount.length`
+- `0 <= favoriteDayi <= 109`
+- `1 <= dailyCapi <= 109`
+
+## 题目大意
+
+给你一个下标从 0 开始的正整数数组 candiesCount ，其中 candiesCount[i] 表示你拥有的第 i 类糖果的数目。同时给你一个二维数组 queries ，其中 queries[i] = [favoriteTypei, favoriteDayi, dailyCapi] 。你按照如下规则进行一场游戏：
+
+- 你从第 0 天开始吃糖果。
+- 你在吃完 所有 第 i - 1 类糖果之前，不能 吃任何一颗第 i 类糖果。
+- 在吃完所有糖果之前，你必须每天 至少 吃 一颗 糖果。
+
+请你构建一个布尔型数组 answer ，满足 answer.length == queries.length 。answer[i] 为 true 的条件是：在每天吃 不超过 dailyCapi 颗糖果的前提下，你可以在第 favoriteDayi 天吃到第 favoriteTypei 类糖果；否则 answer[i] 为 false 。注意，只要满足上面 3 条规则中的第二条规则，你就可以在同一天吃不同类型的糖果。请你返回得到的数组 answer 。
+
+## 解题思路
+
+- 每天吃糖个数的下限是 1 颗，上限是 dailyCap。针对每一个 query 查询在第 i 天能否吃到 i 类型的糖果，要想吃到 i 类型的糖果，必须吃完 i-1 类型的糖果。意味着在 [favoriteDayi + 1, (favoriteDayi+1)×dailyCapi] 区间内能否包含一颗第 favoriteTypei 类型的糖果。如果能包含则输出 true，不能包含则输出 false。吃的糖果数是累积的，所以这里利用前缀和计算出累积吃糖果数所在区间 [sum[favoriteTypei−1]+1, sum[favoriteTypei]]。最后判断 query 区间和累积吃糖果数的区间是否有重叠即可。如果重叠即输出 true。
+- 判断两个区间是否重合，情况有好几种：内包含，全包含，半包含等等。没有交集的情况比较少，所以可以用排除法。对于区间 [x1, y1] 以及 [x2, y2]，它们没有交集当且仅当 x1 > y2 或者 y1 < x2。
+
+## 代码
+
+```go
+package leetcode
+
+func canEat(candiesCount []int, queries [][]int) []bool {
+ n := len(candiesCount)
+ prefixSum := make([]int, n)
+ prefixSum[0] = candiesCount[0]
+ for i := 1; i < n; i++ {
+ prefixSum[i] = prefixSum[i-1] + candiesCount[i]
+ }
+ res := make([]bool, len(queries))
+ for i, q := range queries {
+ favoriteType, favoriteDay, dailyCap := q[0], q[1], q[2]
+ x1 := favoriteDay + 1
+ y1 := (favoriteDay + 1) * dailyCap
+ x2 := 1
+ if favoriteType > 0 {
+ x2 = prefixSum[favoriteType-1] + 1
+ }
+ y2 := prefixSum[favoriteType]
+ res[i] = !(x1 > y2 || y1 < x2)
+ }
+ return res
+}
+```
\ No newline at end of file
diff --git a/leetcode/1748.Sum-of-Unique-Elements/1748. Sum of Unique Elements.go b/leetcode/1748.Sum-of-Unique-Elements/1748. Sum of Unique Elements.go
new file mode 100644
index 000000000..e8ebac9af
--- /dev/null
+++ b/leetcode/1748.Sum-of-Unique-Elements/1748. Sum of Unique Elements.go
@@ -0,0 +1,17 @@
+package leetcode
+
+func sumOfUnique(nums []int) int {
+ freq, res := make(map[int]int), 0
+ for _, v := range nums {
+ if _, ok := freq[v]; !ok {
+ freq[v] = 0
+ }
+ freq[v]++
+ }
+ for k, v := range freq {
+ if v == 1 {
+ res += k
+ }
+ }
+ return res
+}
diff --git a/leetcode/1748.Sum-of-Unique-Elements/1748. Sum of Unique Elements_test.go b/leetcode/1748.Sum-of-Unique-Elements/1748. Sum of Unique Elements_test.go
new file mode 100644
index 000000000..0a38e0b45
--- /dev/null
+++ b/leetcode/1748.Sum-of-Unique-Elements/1748. Sum of Unique Elements_test.go
@@ -0,0 +1,52 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question1748 struct {
+ para1748
+ ans1748
+}
+
+// para 是参数
+// one 代表第一个参数
+type para1748 struct {
+ nums []int
+}
+
+// ans 是答案
+// one 代表第一个答案
+type ans1748 struct {
+ one int
+}
+
+func Test_Problem1748(t *testing.T) {
+
+ qs := []question1748{
+
+ {
+ para1748{[]int{1, 2, 3, 2}},
+ ans1748{4},
+ },
+
+ {
+ para1748{[]int{1, 1, 1, 1, 1}},
+ ans1748{0},
+ },
+
+ {
+ para1748{[]int{1, 2, 3, 4, 5}},
+ ans1748{15},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 1748------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans1748, q.para1748
+ fmt.Printf("【input】:%v 【output】:%v\n", p, sumOfUnique(p.nums))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/1748.Sum-of-Unique-Elements/README.md b/leetcode/1748.Sum-of-Unique-Elements/README.md
new file mode 100644
index 000000000..6a3ac8b27
--- /dev/null
+++ b/leetcode/1748.Sum-of-Unique-Elements/README.md
@@ -0,0 +1,67 @@
+# [1748. Sum of Unique Elements](https://leetcode.com/problems/sum-of-unique-elements/)
+
+
+## 题目
+
+You are given an integer array `nums`. The unique elements of an array are the elements that appear **exactly once** in the array.
+
+Return *the **sum** of all the unique elements of* `nums`.
+
+**Example 1:**
+
+```
+Input: nums = [1,2,3,2]
+Output: 4
+Explanation: The unique elements are [1,3], and the sum is 4.
+```
+
+**Example 2:**
+
+```
+Input: nums = [1,1,1,1,1]
+Output: 0
+Explanation: There are no unique elements, and the sum is 0.
+```
+
+**Example 3:**
+
+```
+Input: nums = [1,2,3,4,5]
+Output: 15
+Explanation: The unique elements are [1,2,3,4,5], and the sum is 15.
+```
+
+**Constraints:**
+
+- `1 <= nums.length <= 100`
+- `1 <= nums[i] <= 100`
+
+## 题目大意
+
+给你一个整数数组 `nums` 。数组中唯一元素是那些只出现 **恰好一次** 的元素。请你返回 `nums` 中唯一元素的 **和** 。
+
+## 解题思路
+
+- 简单题。利用 map 统计出每个元素出现的频次。再累加所有频次为 1 的元素，最后输出累加和即可。
+
+## 代码
+
+```go
+package leetcode
+
+func sumOfUnique(nums []int) int {
+ freq, res := make(map[int]int), 0
+ for _, v := range nums {
+ if _, ok := freq[v]; !ok {
+ freq[v] = 0
+ }
+ freq[v]++
+ }
+ for k, v := range freq {
+ if v == 1 {
+ res += k
+ }
+ }
+ return res
+}
+```
\ No newline at end of file
diff --git a/leetcode/1752.Check-if-Array-Is-Sorted-and-Rotated/1752. Check if Array Is Sorted and Rotated.go b/leetcode/1752.Check-if-Array-Is-Sorted-and-Rotated/1752. Check if Array Is Sorted and Rotated.go
new file mode 100644
index 000000000..ef10f2d95
--- /dev/null
+++ b/leetcode/1752.Check-if-Array-Is-Sorted-and-Rotated/1752. Check if Array Is Sorted and Rotated.go
@@ -0,0 +1,14 @@
+package leetcode
+
+func check(nums []int) bool {
+ count := 0
+ for i := 0; i < len(nums)-1; i++ {
+ if nums[i] > nums[i+1] {
+ count++
+ if count > 1 || nums[0] < nums[len(nums)-1] {
+ return false
+ }
+ }
+ }
+ return true
+}
diff --git a/leetcode/1752.Check-if-Array-Is-Sorted-and-Rotated/1752. Check if Array Is Sorted and Rotated_test.go b/leetcode/1752.Check-if-Array-Is-Sorted-and-Rotated/1752. Check if Array Is Sorted and Rotated_test.go
new file mode 100644
index 000000000..4ebdd4e01
--- /dev/null
+++ b/leetcode/1752.Check-if-Array-Is-Sorted-and-Rotated/1752. Check if Array Is Sorted and Rotated_test.go
@@ -0,0 +1,67 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question1752 struct {
+ para1752
+ ans1752
+}
+
+// para 是参数
+// one 代表第一个参数
+type para1752 struct {
+ nums []int
+}
+
+// ans 是答案
+// one 代表第一个答案
+type ans1752 struct {
+ one bool
+}
+
+func Test_Problem1752(t *testing.T) {
+
+ qs := []question1752{
+
+ {
+ para1752{[]int{3, 4, 5, 1, 2}},
+ ans1752{true},
+ },
+
+ {
+ para1752{[]int{2, 1, 3, 4}},
+ ans1752{false},
+ },
+
+ {
+ para1752{[]int{1, 2, 3}},
+ ans1752{true},
+ },
+
+ {
+ para1752{[]int{1, 1, 1}},
+ ans1752{true},
+ },
+
+ {
+ para1752{[]int{2, 1}},
+ ans1752{true},
+ },
+
+ {
+ para1752{[]int{1, 3, 2, 4}},
+ ans1752{false},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 1752------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans1752, q.para1752
+ fmt.Printf("【input】:%v 【output】:%v\n", p, check(p.nums))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/1752.Check-if-Array-Is-Sorted-and-Rotated/README.md b/leetcode/1752.Check-if-Array-Is-Sorted-and-Rotated/README.md
new file mode 100644
index 000000000..775b7c192
--- /dev/null
+++ b/leetcode/1752.Check-if-Array-Is-Sorted-and-Rotated/README.md
@@ -0,0 +1,86 @@
+# [1752. Check if Array Is Sorted and Rotated](https://leetcode.com/problems/check-if-array-is-sorted-and-rotated/)
+
+
+## 题目
+
+Given an array `nums`, return `true` *if the array was originally sorted in non-decreasing order, then rotated **some** number of positions (including zero)*. Otherwise, return `false`.
+
+There may be **duplicates** in the original array.
+
+**Note:** An array `A` rotated by `x` positions results in an array `B` of the same length such that `A[i] == B[(i+x) % A.length]`, where `%` is the modulo operation.
+
+**Example 1:**
+
+```
+Input: nums = [3,4,5,1,2]
+Output: true
+Explanation: [1,2,3,4,5] is the original sorted array.
+You can rotate the array by x = 3 positions to begin on the the element of value 3: [3,4,5,1,2].
+```
+
+**Example 2:**
+
+```
+Input: nums = [2,1,3,4]
+Output: false
+Explanation: There is no sorted array once rotated that can make nums.
+```
+
+**Example 3:**
+
+```
+Input: nums = [1,2,3]
+Output: true
+Explanation: [1,2,3] is the original sorted array.
+You can rotate the array by x = 0 positions (i.e. no rotation) to make nums.
+```
+
+**Example 4:**
+
+```
+Input: nums = [1,1,1]
+Output: true
+Explanation: [1,1,1] is the original sorted array.
+You can rotate any number of positions to make nums.
+```
+
+**Example 5:**
+
+```
+Input: nums = [2,1]
+Output: true
+Explanation: [1,2] is the original sorted array.
+You can rotate the array by x = 5 positions to begin on the element of value 2: [2,1].
+```
+
+**Constraints:**
+
+- `1 <= nums.length <= 100`
+- `1 <= nums[i] <= 100`
+
+## 题目大意
+
+给你一个数组 nums 。nums 的源数组中，所有元素与 nums 相同，但按非递减顺序排列。如果 nums 能够由源数组轮转若干位置（包括 0 个位置）得到，则返回 true ；否则，返回 false 。源数组中可能存在 重复项 。
+
+## 解题思路
+
+- 简单题。从头扫描一遍数组，找出相邻两个元素递减的数对。如果递减的数对只有 1 个，则有可能是轮转得来的，超过 1 个，则返回 false。题干里面还提到可能有多个重复元素，针对这一情况还需要判断一下 `nums[0]` 和 `nums[len(nums)-1]` 。如果是相同元素，`nums[0] < nums[len(nums)-1]`，并且数组中间还存在一对递减的数对，这时候也是 false。判断好上述这 2 种情况，本题得解。
+
+## 代码
+
+```go
+package leetcode
+
+func check(nums []int) bool {
+ count := 0
+ for i := 0; i < len(nums)-1; i++ {
+ if nums[i] > nums[i+1] {
+ count++
+ if count > 1 || nums[0] < nums[len(nums)-1] {
+ return false
+ }
+ }
+ }
+ return true
+}
+```
\ No newline at end of file
diff --git a/leetcode/1758.Minimum-Changes-To-Make-Alternating-Binary-String/1758. Minimum Changes To Make Alternating Binary String.go b/leetcode/1758.Minimum-Changes-To-Make-Alternating-Binary-String/1758. Minimum Changes To Make Alternating Binary String.go
new file mode 100644
index 000000000..ed0dabf5f
--- /dev/null
+++ b/leetcode/1758.Minimum-Changes-To-Make-Alternating-Binary-String/1758. Minimum Changes To Make Alternating Binary String.go
@@ -0,0 +1,18 @@
+package leetcode
+
+func minOperations(s string) int {
+ res := 0
+ for i := 0; i < len(s); i++ {
+ if int(s[i]-'0') != i%2 {
+ res++
+ }
+ }
+ return min(res, len(s)-res)
+}
+
+func min(a, b int) int {
+ if a > b {
+ return b
+ }
+ return a
+}
diff --git a/leetcode/1758.Minimum-Changes-To-Make-Alternating-Binary-String/1758. Minimum Changes To Make Alternating Binary String_test.go b/leetcode/1758.Minimum-Changes-To-Make-Alternating-Binary-String/1758. Minimum Changes To Make Alternating Binary String_test.go
new file mode 100644
index 000000000..121db556a
--- /dev/null
+++ b/leetcode/1758.Minimum-Changes-To-Make-Alternating-Binary-String/1758. Minimum Changes To Make Alternating Binary String_test.go
@@ -0,0 +1,52 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question1758 struct {
+ para1758
+ ans1758
+}
+
+// para 是参数
+// one 代表第一个参数
+type para1758 struct {
+ s string
+}
+
+// ans 是答案
+// one 代表第一个答案
+type ans1758 struct {
+ one int
+}
+
+func Test_Problem1758(t *testing.T) {
+
+ qs := []question1758{
+
+ {
+ para1758{"0100"},
+ ans1758{1},
+ },
+
+ {
+ para1758{"10"},
+ ans1758{0},
+ },
+
+ {
+ para1758{"1111"},
+ ans1758{2},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 1758------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans1758, q.para1758
+ fmt.Printf("【input】:%v 【output】:%v\n", p, minOperations(p.s))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/1758.Minimum-Changes-To-Make-Alternating-Binary-String/README.md b/leetcode/1758.Minimum-Changes-To-Make-Alternating-Binary-String/README.md
new file mode 100644
index 000000000..f268462ee
--- /dev/null
+++ b/leetcode/1758.Minimum-Changes-To-Make-Alternating-Binary-String/README.md
@@ -0,0 +1,70 @@
+# [1758. Minimum Changes To Make Alternating Binary String](https://leetcode.com/problems/minimum-changes-to-make-alternating-binary-string/)
+
+
+## 题目
+
+You are given a string `s` consisting only of the characters `'0'` and `'1'`. In one operation, you can change any `'0'` to `'1'` or vice versa.
+
+The string is called alternating if no two adjacent characters are equal. For example, the string `"010"` is alternating, while the string `"0100"` is not.
+
+Return *the **minimum** number of operations needed to make* `s` *alternating*.
+
+**Example 1:**
+
+```
+Input: s = "0100"
+Output: 1
+Explanation: If you change the last character to '1', s will be "0101", which is alternating.
+```
+
+**Example 2:**
+
+```
+Input: s = "10"
+Output: 0
+Explanation: s is already alternating.
+```
+
+**Example 3:**
+
+```
+Input: s = "1111"
+Output: 2
+Explanation: You need two operations to reach "0101" or "1010".
+```
+
+**Constraints:**
+
+- `1 <= s.length <= 104`
+- `s[i]` is either `'0'` or `'1'`.
+
+## 题目大意
+
+你将得到一个仅包含字符“ 0”和“ 1”的字符串 `s`。 在一项操作中，你可以将任何 `'0'` 更改为 `'1'`，反之亦然。 如果两个相邻字符都不相等，则该字符串称为交替字符串。 例如，字符串“ 010”是交替的，而字符串“ 0100”则不是。 返回使 `s` 交替所需的最小操作数。
+
+## 解题思路
+
+- 简单题。利用数组下标奇偶交替性来判断交替字符串。交替字符串有 2 种，一个是 `'01010101……'` 还有一个是 `'1010101010……'`，这两个只需要计算出一个即可，另外一个利用 `len(s) - res` 就是答案。
+
+## 代码
+
+```go
+package leetcode
+
+func minOperations(s string) int {
+ res := 0
+ for i := 0; i < len(s); i++ {
+ if int(s[i]-'0') != i%2 {
+ res++
+ }
+ }
+ return min(res, len(s)-res)
+}
+
+func min(a, b int) int {
+ if a > b {
+ return b
+ }
+ return a
+}
+```
\ No newline at end of file
diff --git a/leetcode/1763.Longest-Nice-Substring/1763. Longest Nice Substring.go b/leetcode/1763.Longest-Nice-Substring/1763. Longest Nice Substring.go
new file mode 100644
index 000000000..9219ed23a
--- /dev/null
+++ b/leetcode/1763.Longest-Nice-Substring/1763. Longest Nice Substring.go
@@ -0,0 +1,82 @@
+package leetcode
+
+import "unicode"
+
+// 解法一 分治，时间复杂度 O(n)
+func longestNiceSubstring(s string) string {
+ if len(s) < 2 {
+ return ""
+ }
+
+ chars := map[rune]int{}
+ for _, r := range s {
+ chars[r]++
+ }
+
+ for i := 0; i < len(s); i++ {
+ r := rune(s[i])
+ _, u := chars[unicode.ToUpper(r)]
+ _, l := chars[unicode.ToLower(r)]
+ if u && l {
+ continue
+ }
+ left := longestNiceSubstring(s[:i])
+ right := longestNiceSubstring(s[i+1:])
+ if len(left) >= len(right) {
+ return left
+ } else {
+ return right
+ }
+ }
+ return s
+}
+
+// 解法二 用二进制表示状态
+func longestNiceSubstring1(s string) (ans string) {
+ for i := range s {
+ lower, upper := 0, 0
+ for j := i; j < len(s); j++ {
+ if unicode.IsLower(rune(s[j])) {
+ lower |= 1 << (s[j] - 'a')
+ } else {
+ upper |= 1 << (s[j] - 'A')
+ }
+ if lower == upper && j-i+1 > len(ans) {
+ ans = s[i : j+1]
+ }
+ }
+ }
+ return
+}
+
+// 解法三 暴力枚举，时间复杂度 O(n^2)
+func longestNiceSubstring2(s string) string {
+ res := ""
+ for i := 0; i < len(s); i++ {
+ m := map[byte]int{}
+ m[s[i]]++
+ for j := i + 1; j < len(s); j++ {
+ m[s[j]]++
+ if checkNiceString(m) && (j-i+1 > len(res)) {
+ res = s[i : j+1]
+ }
+ }
+ }
+ return res
+}
+
+func checkNiceString(m map[byte]int) bool {
+ for k := range m {
+ if k >= 97 && k <= 122 {
+ if _, ok := m[k-32]; !ok {
+ return false
+ }
+ }
+ if k >= 65 && k <= 90 {
+ if _, ok := m[k+32]; !ok {
+ return false
+ }
+ }
+ }
+ return true
+}
diff --git a/leetcode/1763.Longest-Nice-Substring/1763. Longest Nice Substring_test.go b/leetcode/1763.Longest-Nice-Substring/1763. Longest Nice Substring_test.go
new file mode 100644
index 000000000..08d550a30
--- /dev/null
+++ b/leetcode/1763.Longest-Nice-Substring/1763. Longest Nice Substring_test.go
@@ -0,0 +1,52 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question1763 struct {
+ para1763
+ ans1763
+}
+
+// para 是参数
+// one 代表第一个参数
+type para1763 struct {
+ s string
+}
+
+// ans 是答案
+// one 代表第一个答案
+type ans1763 struct {
+ one string
+}
+
+func Test_Problem1763(t *testing.T) {
+
+ qs := []question1763{
+
+ {
+ para1763{"YazaAay"},
+ ans1763{"aAa"},
+ },
+
+ {
+ para1763{"Bb"},
+ ans1763{"Bb"},
+ },
+
+ {
+ para1763{"c"},
+ ans1763{""},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 1763------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans1763, q.para1763
+ fmt.Printf("【input】:%v 【output】:%v\n", p, longestNiceSubstring(p.s))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/1763.Longest-Nice-Substring/README.md b/leetcode/1763.Longest-Nice-Substring/README.md
new file mode 100644
index 000000000..05dd0bac4
--- /dev/null
+++ b/leetcode/1763.Longest-Nice-Substring/README.md
@@ -0,0 +1,140 @@
+# [1763. Longest Nice Substring](https://leetcode.com/problems/longest-nice-substring/)
+
+
+## 题目
+
+A string `s` is **nice** if, for every letter of the alphabet that `s` contains, it appears **both** in uppercase and lowercase. For example, `"abABB"` is nice because `'A'` and `'a'` appear, and `'B'` and `'b'` appear. However, `"abA"` is not because `'b'` appears, but `'B'` does not.
+
+Given a string `s`, return *the longest **substring** of `s` that is **nice**. If there are multiple, return the substring of the **earliest** occurrence. If there are none, return an empty string*.
+
+**Example 1:**
+
+```
+Input: s = "YazaAay"
+Output: "aAa"
+Explanation:"aAa" is a nice string because 'A/a' is the only letter of the alphabet in s, and both 'A' and 'a' appear.
+"aAa" is the longest nice substring.
+
+```
+
+**Example 2:**
+
+```
+Input: s = "Bb"
+Output: "Bb"
+Explanation: "Bb" is a nice string because both 'B' and 'b' appear. The whole string is a substring.
+
+```
+
+**Example 3:**
+
+```
+Input: s = "c"
+Output: ""
+Explanation: There are no nice substrings.
+
+```
+
+**Constraints:**
+
+- `1 <= s.length <= 100`
+- `s` consists of uppercase and lowercase English letters.
+
+## 题目大意
+
+当一个字符串 s 包含的每一种字母的大写和小写形式 同时 出现在 s 中，就称这个字符串 s 是 美好 字符串。比方说，"abABB" 是美好字符串，因为 'A' 和 'a' 同时出现了，且 'B' 和 'b' 也同时出现了。然而，"abA" 不是美好字符串因为 'b' 出现了，而 'B' 没有出现。
+
+给你一个字符串 s ，请你返回 s 最长的 美好子字符串 。如果有多个答案，请你返回 最早 出现的一个。如果不存在美好子字符串，请你返回一个空字符串。
+
+## 解题思路
+
+- 解法一，暴力解法。枚举每一段字符串，判断这个子字符串内是否满足美好字符串的定义，即字母的大小写是否同时出现。
+- 解法二，这个解法是解法一的小幅优化版，利用二进制记录状态。先构造二进制状态串，再利用直接比较这个二进制串。
+- 解法三，分治。以 `i` 为分割点依次切开字符串。左右两个字符串分别判断是否满足美好字符串的定义。左右分开的字符串还可以继续划分。直至分到一个字母为止。在这个过程中记录最早出现的字符串。
+
+## 代码
+
+```go
+package leetcode
+
+import "unicode"
+
+// 解法一 分治，时间复杂度 O(n)
+func longestNiceSubstring(s string) string {
+ if len(s) < 2 {
+ return ""
+ }
+
+ chars := map[rune]int{}
+ for _, r := range s {
+ chars[r]++
+ }
+
+ for i := 0; i < len(s); i++ {
+ r := rune(s[i])
+ _, u := chars[unicode.ToUpper(r)]
+ _, l := chars[unicode.ToLower(r)]
+ if u && l {
+ continue
+ }
+ left := longestNiceSubstring(s[:i])
+ right := longestNiceSubstring(s[i+1:])
+ if len(left) >= len(right) {
+ return left
+ } else {
+ return right
+ }
+ }
+ return s
+}
+
+// 解法二 用二进制表示状态
+func longestNiceSubstring1(s string) (ans string) {
+ for i := range s {
+ lower, upper := 0, 0
+ for j := i; j < len(s); j++ {
+ if unicode.IsLower(rune(s[j])) {
+ lower |= 1 << (s[j] - 'a')
+ } else {
+ upper |= 1 << (s[j] - 'A')
+ }
+ if lower == upper && j-i+1 > len(ans) {
+ ans = s[i : j+1]
+ }
+ }
+ }
+ return
+}
+
+// 解法三 暴力枚举，时间复杂度 O(n^2)
+func longestNiceSubstring2(s string) string {
+ res := ""
+ for i := 0; i < len(s); i++ {
+ m := map[byte]int{}
+ m[s[i]]++
+ for j := i + 1; j < len(s); j++ {
+ m[s[j]]++
+ if checkNiceString(m) && (j-i+1 > len(res)) {
+ res = s[i : j+1]
+ }
+ }
+ }
+ return res
+}
+
+func checkNiceString(m map[byte]int) bool {
+ for k := range m {
+ if k >= 97 && k <= 122 {
+ if _, ok := m[k-32]; !ok {
+ return false
+ }
+ }
+ if k >= 65 && k <= 90 {
+ if _, ok := m[k+32]; !ok {
+ return false
+ }
+ }
+ }
+ return true
+}
+```
\ No newline at end of file
diff --git a/leetcode/1791.Find-Center-of-Star-Graph/1791.Find Center of Star Graph.go b/leetcode/1791.Find-Center-of-Star-Graph/1791.Find Center of Star Graph.go
new file mode 100644
index 000000000..6f39e98f9
--- /dev/null
+++ b/leetcode/1791.Find-Center-of-Star-Graph/1791.Find Center of Star Graph.go
@@ -0,0 +1,8 @@
+package leetcode
+
+func findCenter(edges [][]int) int {
+ if edges[0][0] == edges[1][0] || edges[0][0] == edges[1][1] {
+ return edges[0][0]
+ }
+ return edges[0][1]
+}
diff --git a/leetcode/1791.Find-Center-of-Star-Graph/1791.Find Center of Star Graph_test.go b/leetcode/1791.Find-Center-of-Star-Graph/1791.Find Center of Star Graph_test.go
new file mode 100644
index 000000000..e1ade4d8e
--- /dev/null
+++ b/leetcode/1791.Find-Center-of-Star-Graph/1791.Find Center of Star Graph_test.go
@@ -0,0 +1,46 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question1791 struct {
+ para1791
+ ans1791
+}
+
+// para 是参数
+type para1791 struct {
+ edges [][]int
+}
+
+// ans 是答案
+type ans1791 struct {
+ ans int
+}
+
+func Test_Problem1791(t *testing.T) {
+
+ qs := []question1791{
+
+ {
+ para1791{[][]int{{1, 2}, {2, 3}, {4, 2}}},
+ ans1791{2},
+ },
+
+ {
+ para1791{[][]int{{1, 2}, {5, 1}, {1, 3}, {1, 4}}},
+ ans1791{1},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 1791------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans1791, q.para1791
+ fmt.Printf("【input】:%v ", p.edges)
+ fmt.Printf("【output】:%v \n", findCenter(p.edges))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/1791.Find-Center-of-Star-Graph/README.md b/leetcode/1791.Find-Center-of-Star-Graph/README.md
new file mode 100644
index 000000000..7c3a049fa
--- /dev/null
+++ b/leetcode/1791.Find-Center-of-Star-Graph/README.md
@@ -0,0 +1,52 @@
+# [1791.Find Center of Star Graph](https://leetcode.com/problems/find-center-of-star-graph/)
+
+## 题目
+
+There is an undirected star graph consisting of n nodes labeled from 1 to n. A star graph is a graph where there is one center node and exactly n - 1 edges that connect the center node with every other node.
+
+You are given a 2D integer array edges where each edges[i] = [ui, vi] indicates that there is an edge between the nodes ui and vi. Return the center of the given star graph.
+
+**Example 1:**
+
+
+
+ Input: edges = [[1,2],[2,3],[4,2]]
+ Output: 2
+ Explanation: As shown in the figure above, node 2 is connected to every other node, so 2 is the center.
+
+**Example 2:**
+
+ Input: edges = [[1,2],[5,1],[1,3],[1,4]]
+ Output: 1
+
+**Constraints:**
+
+- 3 <= n <= 100000
+- edges.length == n - 1
+- edges[i].length == 2
+- 1 <= ui, vi <= n
+- ui != vi
+- The given edges represent a valid star graph.
+
+## 题目大意
+
+有一个无向的 星型 图，由 n 个编号从 1 到 n 的节点组成。星型图有一个 中心 节点，并且恰有 n - 1 条边将中心节点与其他每个节点连接起来。
+
+给你一个二维整数数组 edges ，其中 edges[i] = [ui, vi] 表示在节点 ui 和 vi 之间存在一条边。请你找出并返回 edges 所表示星型图的中心节点。
+
+## 解题思路
+
+- 求出edges中前两个元素的共同值，即是中心节点
+
+## 代码
+
+```go
+package leetcode
+
+func findCenter(edges [][]int) int {
+ if edges[0][0] == edges[1][0] || edges[0][0] == edges[1][1] {
+ return edges[0][0]
+ }
+ return edges[0][1]
+}
+```
diff --git a/leetcode/1816.Truncate-Sentence/1816.Truncate Sentence.go b/leetcode/1816.Truncate-Sentence/1816.Truncate Sentence.go
new file mode 100644
index 000000000..99d917314
--- /dev/null
+++ b/leetcode/1816.Truncate-Sentence/1816.Truncate Sentence.go
@@ -0,0 +1,18 @@
+package leetcode
+
+func truncateSentence(s string, k int) string {
+ end := 0
+ for i := range s {
+ if k > 0 && s[i] == ' ' {
+ k--
+ }
+ if k == 0 {
+ end = i
+ break
+ }
+ }
+ if end == 0 {
+ return s
+ }
+ return s[:end]
+}
diff --git a/leetcode/1816.Truncate-Sentence/1816.Truncate Sentence_test.go b/leetcode/1816.Truncate-Sentence/1816.Truncate Sentence_test.go
new file mode 100644
index 000000000..2d277bbfa
--- /dev/null
+++ b/leetcode/1816.Truncate-Sentence/1816.Truncate Sentence_test.go
@@ -0,0 +1,51 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question1816 struct {
+ para1816
+ ans1816
+}
+
+// para 是参数
+type para1816 struct {
+ s string
+ k int
+}
+
+// ans 是答案
+type ans1816 struct {
+ ans string
+}
+
+func Test_Problem1816(t *testing.T) {
+
+ qs := []question1816{
+
+ {
+ para1816{"Hello how are you Contestant", 4},
+ ans1816{"Hello how are you"},
+ },
+
+ {
+ para1816{"What is the solution to this problem", 4},
+ ans1816{"What is the solution"},
+ },
+
+ {
+ para1816{"chopper is not a tanuki", 5},
+ ans1816{"chopper is not a tanuki"},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 1816------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans1816, q.para1816
+ fmt.Printf("【input】:%v 【output】:%v\n", p, truncateSentence(p.s, p.k))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/1816.Truncate-Sentence/README.md b/leetcode/1816.Truncate-Sentence/README.md
new file mode 100644
index 000000000..ebd9b5877
--- /dev/null
+++ b/leetcode/1816.Truncate-Sentence/README.md
@@ -0,0 +1,76 @@
+# [1816. Truncate Sentence](https://leetcode.com/problems/truncate-sentence/)
+
+## 题目
+
+A sentence is a list of words that are separated by a single space with no leading or trailing spaces. Each of the words consists of only uppercase and lowercase English letters (no punctuation).
+
+- For example, "Hello World", "HELLO", and "hello world hello world" are all sentences.
+
+You are given a sentence s and an integer k. You want to truncate s such that it contains only the first k words. Return s after truncating it.
+
+**Example 1**:
+
+ Input: s = "Hello how are you Contestant", k = 4
+ Output: "Hello how are you"
+ Explanation:
+ The words in s are ["Hello", "how" "are", "you", "Contestant"].
+ The first 4 words are ["Hello", "how", "are", "you"].
+ Hence, you should return "Hello how are you".
+
+**Example 2**:
+
+ Input: s = "What is the solution to this problem", k = 4
+ Output: "What is the solution"
+ Explanation:
+ The words in s are ["What", "is" "the", "solution", "to", "this", "problem"].
+ The first 4 words are ["What", "is", "the", "solution"].
+ Hence, you should return "What is the solution".
+
+**Example 3**:
+
+ Input: s = "chopper is not a tanuki", k = 5
+ Output: "chopper is not a tanuki"
+
+**Constraints:**
+
+- 1 <= s.length <= 500
+- k is in the range [1, the number of words in s].
+- s consist of only lowercase and uppercase English letters and spaces.
+- The words in s are separated by a single space.
+- There are no leading or trailing spaces.
+
+## 题目大意
+
+句子 是一个单词列表，列表中的单词之间用单个空格隔开，且不存在前导或尾随空格。每个单词仅由大小写英文字母组成（不含标点符号）。
+
+- 例如，"Hello World"、"HELLO" 和 "hello world hello world" 都是句子。
+
+给你一个句子 s 和一个整数 k ，请你将 s 截断使截断后的句子仅含前 k 个单词。返回截断 s 后得到的句子。
+
+## 解题思路
+
+- 遍历字符串 s，找到最后一个空格的下标 end
+- 如果 end 为 0，直接返回 s,否则返回 s[:end]
+
+## 代码
+
+```go
+package leetcode
+
+func truncateSentence(s string, k int) string {
+ end := 0
+ for i := range s {
+ if k > 0 && s[i] == ' ' {
+ k--
+ }
+ if k == 0 {
+ end = i
+ break
+ }
+ }
+ if end == 0 {
+ return s
+ }
+ return s[:end]
+}
+```
\ No newline at end of file
diff --git a/leetcode/1818.Minimum-Absolute-Sum-Difference/1818. Minimum Absolute Sum Difference.go b/leetcode/1818.Minimum-Absolute-Sum-Difference/1818. Minimum Absolute Sum Difference.go
new file mode 100644
index 000000000..dec40606d
--- /dev/null
+++ b/leetcode/1818.Minimum-Absolute-Sum-Difference/1818. Minimum Absolute Sum Difference.go
@@ -0,0 +1,38 @@
+package leetcode
+
+func minAbsoluteSumDiff(nums1 []int, nums2 []int) int {
+ diff := 0
+ maxDiff := 0
+ for i, n2 := range nums2 {
+ d := abs(nums1[i] - n2)
+ diff += d
+ if maxDiff < d {
+ t := 100001
+ for _, n1 := range nums1 {
+ maxDiff = max(maxDiff, d-min(t, abs(n1-n2)))
+ }
+ }
+ }
+ return (diff - maxDiff) % (1e9 + 7)
+}
+
+func max(a, b int) int {
+ if a > b {
+ return a
+ }
+ return b
+}
+
+func abs(a int) int {
+ if a > 0 {
+ return a
+ }
+ return -a
+}
+
+func min(a, b int) int {
+ if a > b {
+ return b
+ }
+ return a
+}
diff --git a/leetcode/1818.Minimum-Absolute-Sum-Difference/1818. Minimum Absolute Sum Difference_test.go b/leetcode/1818.Minimum-Absolute-Sum-Difference/1818. Minimum Absolute Sum Difference_test.go
new file mode 100644
index 000000000..9c9b36cf1
--- /dev/null
+++ b/leetcode/1818.Minimum-Absolute-Sum-Difference/1818. Minimum Absolute Sum Difference_test.go
@@ -0,0 +1,53 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question1818 struct {
+ para1818
+ ans1818
+}
+
+// para 是参数
+// one 代表第一个参数
+type para1818 struct {
+ nums1 []int
+ nums2 []int
+}
+
+// ans 是答案
+// one 代表第一个答案
+type ans1818 struct {
+ one int
+}
+
+func Test_Problem1818(t *testing.T) {
+
+ qs := []question1818{
+
+ {
+ para1818{[]int{1, 7, 5}, []int{2, 3, 5}},
+ ans1818{3},
+ },
+
+ {
+ para1818{[]int{2, 4, 6, 8, 10}, []int{2, 4, 6, 8, 10}},
+ ans1818{0},
+ },
+
+ {
+ para1818{[]int{1, 10, 4, 4, 2, 7}, []int{9, 3, 5, 1, 7, 4}},
+ ans1818{20},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 1818------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans1818, q.para1818
+ fmt.Printf("【input】:%v 【output】:%v\n", p, minAbsoluteSumDiff(p.nums1, p.nums2))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/1818.Minimum-Absolute-Sum-Difference/README.md b/leetcode/1818.Minimum-Absolute-Sum-Difference/README.md
new file mode 100644
index 000000000..d66650997
--- /dev/null
+++ b/leetcode/1818.Minimum-Absolute-Sum-Difference/README.md
@@ -0,0 +1,117 @@
+# [1818. Minimum Absolute Sum Difference](https://leetcode.com/problems/minimum-absolute-sum-difference/)
+
+## 题目
+
+You are given two positive integer arrays `nums1` and `nums2`, both of length `n`.
+
+The **absolute sum difference** of arrays `nums1` and `nums2` is defined as the **sum** of `|nums1[i] - nums2[i]|` for each `0 <= i < n` (**0-indexed**).
+
+You can replace **at most one** element of `nums1` with **any** other element in `nums1` to **minimize** the absolute sum difference.
+
+Return the *minimum absolute sum difference **after** replacing at most one ****element in the array `nums1`.* Since the answer may be large, return it **modulo** `109 + 7`.
+
+`|x|` is defined as:
+
+- `x` if `x >= 0`, or
+- `x` if `x < 0`.
+
+**Example 1:**
+
+```
+Input: nums1 = [1,7,5], nums2 = [2,3,5]
+Output: 3
+Explanation:There are two possible optimal solutions:
+- Replace the second element with the first: [1,7,5] => [1,1,5], or
+- Replace the second element with the third: [1,7,5] => [1,5,5].
+Both will yield an absolute sum difference of|1-2| + (|1-3| or |5-3|) + |5-5| =3.
+
+```
+
+**Example 2:**
+
+```
+Input: nums1 = [2,4,6,8,10], nums2 = [2,4,6,8,10]
+Output: 0
+Explanation:nums1 is equal to nums2 so no replacement is needed. This will result in an
+absolute sum difference of 0.
+
+```
+
+**Example 3:**
+
+```
+Input: nums1 = [1,10,4,4,2,7], nums2 = [9,3,5,1,7,4]
+Output: 20
+Explanation:Replace the first element with the second: [1,10,4,4,2,7] => [10,10,4,4,2,7].
+This yields an absolute sum difference of|10-9| + |10-3| + |4-5| + |4-1| + |2-7| + |7-4| = 20
+```
+
+**Constraints:**
+
+- `n == nums1.length`
+- `n == nums2.length`
+- `1 <= n <= 10^5`
+- `1 <= nums1[i], nums2[i] <= 10^5`
+
+## 题目大意
+
+给你两个正整数数组 nums1 和 nums2 ，数组的长度都是 n 。数组 nums1 和 nums2 的 绝对差值和 定义为所有 |nums1[i] - nums2[i]|（0 <= i < n）的 总和（下标从 0 开始）。你可以选用 nums1 中的 任意一个 元素来替换 nums1 中的 至多 一个元素，以 最小化 绝对差值和。在替换数组 nums1 中最多一个元素 之后 ，返回最小绝对差值和。因为答案可能很大，所以需要对 10^9 + 7 取余 后返回。
+
+## 解题思路
+
+- 如果不改变任何元素，绝对差值和为
+
+$$\sum \left | nums1[i] - nums2[i] \right |$$
+
+- 如果改变一个元素后，那么绝对差值和为
+
+$$\begin{aligned}&\sum \left | nums1[i] - nums2[i] \right | - \left ( \left | nums1[i] - nums2[i] \right | - \left | nums1[j] - nums2[i] \right |\right )\\= &\sum \left | nums1[i] - nums2[i] \right | - \Delta \end{aligned}$$
+
+题目要求返回最小绝对差值和，即求
+
+$$\Delta $$
+
+的最大值。暴力枚举 nums1 和 nums2 中两两差值，找到 maxdiff。
+
+## 代码
+
+```go
+package leetcode
+
+func minAbsoluteSumDiff(nums1 []int, nums2 []int) int {
+ diff := 0
+ maxDiff := 0
+ for i, n2 := range nums2 {
+ d := abs(nums1[i] - n2)
+ diff += d
+ if maxDiff < d {
+ t := 100001
+ for _, n1 := range nums1 {
+ maxDiff = max(maxDiff, d-min(t, abs(n1-n2)))
+ }
+ }
+ }
+ return (diff - maxDiff) % (1e9 + 7)
+}
+
+func max(a, b int) int {
+ if a > b {
+ return a
+ }
+ return b
+}
+
+func abs(a int) int {
+ if a > 0 {
+ return a
+ }
+ return -a
+}
+
+func min(a, b int) int {
+ if a > b {
+ return b
+ }
+ return a
+}
+```
\ No newline at end of file
diff --git a/leetcode/1846.Maximum-Element-After-Decreasing-and-Rearranging/1846. Maximum Element After Decreasing and Rearranging.go b/leetcode/1846.Maximum-Element-After-Decreasing-and-Rearranging/1846. Maximum Element After Decreasing and Rearranging.go
new file mode 100644
index 000000000..1fde93aba
--- /dev/null
+++ b/leetcode/1846.Maximum-Element-After-Decreasing-and-Rearranging/1846. Maximum Element After Decreasing and Rearranging.go
@@ -0,0 +1,25 @@
+package leetcode
+
+func maximumElementAfterDecrementingAndRearranging(arr []int) int {
+ n := len(arr)
+ count := make([]int, n+1)
+ for _, v := range arr {
+ count[min(v, n)]++
+ }
+ miss := 0
+ for _, c := range count[1:] {
+ if c == 0 {
+ miss++
+ } else {
+ miss -= min(c-1, miss)
+ }
+ }
+ return n - miss
+}
+
+func min(a, b int) int {
+ if a < b {
+ return a
+ }
+ return b
+}
diff --git a/leetcode/1846.Maximum-Element-After-Decreasing-and-Rearranging/1846. Maximum Element After Decreasing and Rearranging_test.go b/leetcode/1846.Maximum-Element-After-Decreasing-and-Rearranging/1846. Maximum Element After Decreasing and Rearranging_test.go
new file mode 100644
index 000000000..b4198e574
--- /dev/null
+++ b/leetcode/1846.Maximum-Element-After-Decreasing-and-Rearranging/1846. Maximum Element After Decreasing and Rearranging_test.go
@@ -0,0 +1,52 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question1846 struct {
+ para1846
+ ans1846
+}
+
+// para 是参数
+// one 代表第一个参数
+type para1846 struct {
+ arr []int
+}
+
+// ans 是答案
+// one 代表第一个答案
+type ans1846 struct {
+ one int
+}
+
+func Test_Problem1846(t *testing.T) {
+
+ qs := []question1846{
+
+ {
+ para1846{[]int{2, 2, 1, 2, 1}},
+ ans1846{2},
+ },
+
+ {
+ para1846{[]int{100, 1, 1000}},
+ ans1846{3},
+ },
+
+ {
+ para1846{[]int{1, 2, 3, 4, 5}},
+ ans1846{5},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 1846------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans1846, q.para1846
+ fmt.Printf("【input】:%v 【output】:%v\n", p, maximumElementAfterDecrementingAndRearranging(p.arr))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/1846.Maximum-Element-After-Decreasing-and-Rearranging/README.md b/leetcode/1846.Maximum-Element-After-Decreasing-and-Rearranging/README.md
new file mode 100644
index 000000000..2196f6bb4
--- /dev/null
+++ b/leetcode/1846.Maximum-Element-After-Decreasing-and-Rearranging/README.md
@@ -0,0 +1,103 @@
+# [1846. Maximum Element After Decreasing and Rearranging](https://leetcode.com/problems/maximum-element-after-decreasing-and-rearranging/)
+
+
+## 题目
+
+You are given an array of positive integers `arr`. Perform some operations (possibly none) on `arr` so that it satisfies these conditions:
+
+- The value of the **first** element in `arr` must be `1`.
+- The absolute difference between any 2 adjacent elements must be **less than or equal to** `1`. In other words, `abs(arr[i] - arr[i - 1]) <= 1` for each `i` where `1 <= i < arr.length` (**0-indexed**). `abs(x)` is the absolute value of `x`.
+
+There are 2 types of operations that you can perform any number of times:
+
+- **Decrease** the value of any element of `arr` to a **smaller positive integer**.
+- **Rearrange** the elements of `arr` to be in any order.
+
+Return *the **maximum** possible value of an element in* `arr` *after performing the operations to satisfy the conditions*.
+
+**Example 1:**
+
+```
+Input: arr = [2,2,1,2,1]
+Output: 2
+Explanation:
+We can satisfy the conditions by rearrangingarr so it becomes[1,2,2,2,1].
+The largest element inarr is 2.
+
+```
+
+**Example 2:**
+
+```
+Input: arr = [100,1,1000]
+Output: 3
+Explanation:
+One possible way to satisfy the conditions is by doing the following:
+1. Rearrangearr so it becomes[1,100,1000].
+2. Decrease the value of the second element to 2.
+3. Decrease the value of the third element to 3.
+Nowarr = [1,2,3], whichsatisfies the conditions.
+The largest element inarr is 3.
+```
+
+**Example 3:**
+
+```
+Input: arr = [1,2,3,4,5]
+Output: 5
+Explanation: The array already satisfies the conditions, and the largest element is 5.
+
+```
+
+**Constraints:**
+
+- `1 <= arr.length <= 10^5`
+- `1 <= arr[i] <= 10^9`
+
+## 题目大意
+
+给你一个正整数数组 arr 。请你对 arr 执行一些操作（也可以不进行任何操作），使得数组满足以下条件：
+
+- arr 中 第一个 元素必须为 1 。
+- 任意相邻两个元素的差的绝对值 小于等于 1 ，也就是说，对于任意的 1 <= i < arr.length （数组下标从 0 开始），都满足 abs(arr[i] - arr[i - 1]) <= 1 。abs(x) 为 x 的绝对值。
+
+你可以执行以下 2 种操作任意次：
+
+- 减小 arr 中任意元素的值，使其变为一个 更小的正整数 。
+- 重新排列 arr 中的元素，你可以以任意顺序重新排列。
+
+请你返回执行以上操作后，在满足前文所述的条件下，arr 中可能的 最大值 。
+
+## 解题思路
+
+- 正整数数组 arr 第一个元素必须为 1，且两两元素绝对值小于等于 1，那么 arr 最大值肯定不大于 n。采用贪心的策略，先统计所有元素出现的次数，大于 n 的元素出现次数都累加到 n 上。然后从 1 扫描到 n，遇到“空隙”（出现次数为 0 的元素），便将最近一个出现次数大于 1 的元素“挪”过来填补“空隙”。题目所求最大值出现在，“填补空隙”之后，数组从左往右连续的最右端。
+
+## 代码
+
+```go
+package leetcode
+
+func maximumElementAfterDecrementingAndRearranging(arr []int) int {
+ n := len(arr)
+ count := make([]int, n+1)
+ for _, v := range arr {
+ count[min(v, n)]++
+ }
+ miss := 0
+ for _, c := range count[1:] {
+ if c == 0 {
+ miss++
+ } else {
+ miss -= min(c-1, miss)
+ }
+ }
+ return n - miss
+}
+
+func min(a, b int) int {
+ if a < b {
+ return a
+ }
+ return b
+}
+```
\ No newline at end of file
diff --git a/leetcode/1877.Minimize-Maximum-Pair-Sum-in-Array/1877. Minimize Maximum Pair Sum in Array.go b/leetcode/1877.Minimize-Maximum-Pair-Sum-in-Array/1877. Minimize Maximum Pair Sum in Array.go
new file mode 100644
index 000000000..3d74fe3a1
--- /dev/null
+++ b/leetcode/1877.Minimize-Maximum-Pair-Sum-in-Array/1877. Minimize Maximum Pair Sum in Array.go
@@ -0,0 +1,19 @@
+package leetcode
+
+import "sort"
+
+func minPairSum(nums []int) int {
+ sort.Ints(nums)
+ n, res := len(nums), 0
+ for i, val := range nums[:n/2] {
+ res = max(res, val+nums[n-1-i])
+ }
+ return res
+}
+
+func max(a, b int) int {
+ if a > b {
+ return a
+ }
+ return b
+}
diff --git a/leetcode/1877.Minimize-Maximum-Pair-Sum-in-Array/1877. Minimize Maximum Pair Sum in Array_test.go b/leetcode/1877.Minimize-Maximum-Pair-Sum-in-Array/1877. Minimize Maximum Pair Sum in Array_test.go
new file mode 100644
index 000000000..c07aba6e9
--- /dev/null
+++ b/leetcode/1877.Minimize-Maximum-Pair-Sum-in-Array/1877. Minimize Maximum Pair Sum in Array_test.go
@@ -0,0 +1,62 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question1877 struct {
+ para1877
+ ans1877
+}
+
+// para 是参数
+// one 代表第一个参数
+type para1877 struct {
+ nums []int
+}
+
+// ans 是答案
+// one 代表第一个答案
+type ans1877 struct {
+ one int
+}
+
+func Test_Problem1877(t *testing.T) {
+
+ qs := []question1877{
+
+ {
+ para1877{[]int{2, 2, 1, 2, 1}},
+ ans1877{3},
+ },
+
+ {
+ para1877{[]int{100, 1, 1000}},
+ ans1877{1001},
+ },
+
+ {
+ para1877{[]int{1, 2, 3, 4, 5}},
+ ans1877{6},
+ },
+
+ {
+ para1877{[]int{3, 5, 2, 3}},
+ ans1877{7},
+ },
+
+ {
+ para1877{[]int{3, 5, 4, 2, 4, 6}},
+ ans1877{8},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 1877------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans1877, q.para1877
+ fmt.Printf("【input】:%v 【output】:%v\n", p, minPairSum(p.nums))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/1877.Minimize-Maximum-Pair-Sum-in-Array/README.md b/leetcode/1877.Minimize-Maximum-Pair-Sum-in-Array/README.md
new file mode 100644
index 000000000..17ff53013
--- /dev/null
+++ b/leetcode/1877.Minimize-Maximum-Pair-Sum-in-Array/README.md
@@ -0,0 +1,81 @@
+# [1877. Minimize Maximum Pair Sum in Array](https://leetcode.com/problems/minimize-maximum-pair-sum-in-array/)
+
+
+## 题目
+
+The **pair sum** of a pair `(a,b)` is equal to `a + b`. The **maximum pair sum** is the largest **pair sum** in a list of pairs.
+
+- For example, if we have pairs `(1,5)`, `(2,3)`, and `(4,4)`, the **maximum pair sum** would be `max(1+5, 2+3, 4+4) = max(6, 5, 8) = 8`.
+
+Given an array `nums` of **even** length `n`, pair up the elements of `nums` into `n / 2` pairs such that:
+
+- Each element of `nums` is in **exactly one** pair, and
+- The **maximum pair sum** is **minimized**.
+
+Return *the minimized **maximum pair sum** after optimally pairing up the elements*.
+
+**Example 1:**
+
+```
+Input: nums = [3,5,2,3]
+Output: 7
+Explanation: The elements can be paired up into pairs (3,3) and (5,2).
+The maximum pair sum is max(3+3, 5+2) = max(6, 7) = 7.
+```
+
+**Example 2:**
+
+```
+Input: nums = [3,5,4,2,4,6]
+Output: 8
+Explanation: The elements can be paired up into pairs (3,5), (4,4), and (6,2).
+The maximum pair sum is max(3+5, 4+4, 6+2) = max(8, 8, 8) = 8.
+```
+
+**Constraints:**
+
+- `n == nums.length`
+- `2 <= n <= 105`
+- `n` is **even**.
+- `1 <= nums[i] <= 105`
+
+## 题目大意
+
+一个数对 (a,b) 的 **数对和** 等于 a + b 。**最大数对和** 是一个数对数组中最大的 数对和 。
+
+- 比方说，如果我们有数对 (1,5) ，(2,3) 和 (4,4)，**最大数对和** 为 max(1+5, 2+3, 4+4) = max(6, 5, 8) = 8 。
+
+给你一个长度为 **偶数** n 的数组 nums ，请你将 nums 中的元素分成 n / 2 个数对，使得：
+
+- nums 中每个元素 **恰好** 在 一个 数对中，且
+- **最大数对和** 的值 **最小** 。
+
+请你在最优数对划分的方案下，返回最小的 最大数对和 。
+
+## 解题思路
+
+- 要想最大数对和最小，那么最大的元素一定只能和最小的元素组合在一起，不然一定不是最小。当最大元素和最小元素组合在一起了，剩下的次最大元素也应该和次最小元素组合在一起。按照这个思路，先将数组从小到大排序，然后依次取出首尾元素，两两组合在一起。输出这些数对的最大值即为所求。
+
+## 代码
+
+```go
+package leetcode
+
+import "sort"
+
+func minPairSum(nums []int) int {
+ sort.Ints(nums)
+ n, res := len(nums), 0
+ for i, val := range nums[:n/2] {
+ res = max(res, val+nums[n-1-i])
+ }
+ return res
+}
+
+func max(a, b int) int {
+ if a > b {
+ return a
+ }
+ return b
+}
+```
\ No newline at end of file
diff --git a/leetcode/1984.Minimum-Difference-Between-Highest-and-Lowest-of-K-Scores/1984.Minimum Difference Between Highest and Lowest of K Scores.go b/leetcode/1984.Minimum-Difference-Between-Highest-and-Lowest-of-K-Scores/1984.Minimum Difference Between Highest and Lowest of K Scores.go
new file mode 100644
index 000000000..b4b381488
--- /dev/null
+++ b/leetcode/1984.Minimum-Difference-Between-Highest-and-Lowest-of-K-Scores/1984.Minimum Difference Between Highest and Lowest of K Scores.go
@@ -0,0 +1,18 @@
+package leetcode
+
+import "sort"
+
+func minimumDifference(nums []int, k int) int {
+ sort.Ints(nums)
+ minDiff := 100000 + 1
+ for i := 0; i < len(nums); i++ {
+ if i+k-1 >= len(nums) {
+ break
+ }
+ diff := nums[i+k-1] - nums[i]
+ if diff < minDiff {
+ minDiff = diff
+ }
+ }
+ return minDiff
+}
diff --git a/leetcode/1984.Minimum-Difference-Between-Highest-and-Lowest-of-K-Scores/1984.Minimum Difference Between Highest and Lowest of K Scores_test.go b/leetcode/1984.Minimum-Difference-Between-Highest-and-Lowest-of-K-Scores/1984.Minimum Difference Between Highest and Lowest of K Scores_test.go
new file mode 100644
index 000000000..90997ca78
--- /dev/null
+++ b/leetcode/1984.Minimum-Difference-Between-Highest-and-Lowest-of-K-Scores/1984.Minimum Difference Between Highest and Lowest of K Scores_test.go
@@ -0,0 +1,47 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question1984 struct {
+ para1984
+ ans1984
+}
+
+// para 是参数
+type para1984 struct {
+ nums []int
+ k int
+}
+
+// ans 是答案
+type ans1984 struct {
+ ans int
+}
+
+func Test_Problem1984(t *testing.T) {
+
+ qs := []question1984{
+
+ {
+ para1984{[]int{90}, 1},
+ ans1984{0},
+ },
+
+ {
+ para1984{[]int{9, 4, 1, 7}, 2},
+ ans1984{2},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 1984------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans1984, q.para1984
+ fmt.Printf("【input】:%v ", p)
+ fmt.Printf("【output】:%v \n", minimumDifference(p.nums, p.k))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/1984.Minimum-Difference-Between-Highest-and-Lowest-of-K-Scores/README.md b/leetcode/1984.Minimum-Difference-Between-Highest-and-Lowest-of-K-Scores/README.md
new file mode 100644
index 000000000..fe7146c04
--- /dev/null
+++ b/leetcode/1984.Minimum-Difference-Between-Highest-and-Lowest-of-K-Scores/README.md
@@ -0,0 +1,71 @@
+# [1984. Minimum Difference Between Highest and Lowest of K Scores](https://leetcode.com/problems/minimum-difference-between-highest-and-lowest-of-k-scores/)
+
+## 题目
+
+You are given a 0-indexed integer array nums, where nums[i] represents the score of the ith student. You are also given an integer k.
+
+Pick the scores of any k students from the array so that the difference between the highest and the lowest of the k scores is minimized.
+
+Return the minimum possible difference.
+
+**Example 1:**
+
+ Input: nums = [90], k = 1
+ Output: 0
+ Explanation: There is one way to pick score(s) of one student:
+ - [90]. The difference between the highest and lowest score is 90 - 90 = 0.
+ The minimum possible difference is 0.
+
+**Example 2:**
+
+ Input: nums = [9,4,1,7], k = 2
+ Output: 2
+ Explanation: There are six ways to pick score(s) of two students:
+ - [9,4,1,7]. The difference between the highest and lowest score is 9 - 4 = 5.
+ - [9,4,1,7]. The difference between the highest and lowest score is 9 - 1 = 8.
+ - [9,4,1,7]. The difference between the highest and lowest score is 9 - 7 = 2.
+ - [9,4,1,7]. The difference between the highest and lowest score is 4 - 1 = 3.
+ - [9,4,1,7]. The difference between the highest and lowest score is 7 - 4 = 3.
+ - [9,4,1,7]. The difference between the highest and lowest score is 7 - 1 = 6.
+ The minimum possible difference is 2.
+
+**Constraints:**
+
+- 1 <= k <= nums.length <= 1000
+- 0 <= nums[i] <= 100000
+
+## 题目大意
+
+给你一个下标从 0 开始的整数数组 nums ，其中 nums[i] 表示第 i 名学生的分数。另给你一个整数 k 。
+
+从数组中选出任意 k 名学生的分数，使这 k 个分数间最高分和最低分的差值达到最小化 。
+
+返回可能的最小差值 。
+
+## 解题思路
+
+- nums 排序
+- 求出nums[i+k-1] - nums[i]中的最小差值
+
+## 代码
+
+```go
+package leetcode
+
+import "sort"
+
+func minimumDifference(nums []int, k int) int {
+ sort.Ints(nums)
+ minDiff := 100000 + 1
+ for i := 0; i < len(nums); i++ {
+ if i+k-1 >= len(nums) {
+ break
+ }
+ diff := nums[i+k-1] - nums[i]
+ if diff < minDiff {
+ minDiff = diff
+ }
+ }
+ return minDiff
+}
+```
\ No newline at end of file
diff --git a/leetcode/2021.Brightest-Position-on-Street/2021. Brightest Position on Street.go b/leetcode/2021.Brightest-Position-on-Street/2021. Brightest Position on Street.go
new file mode 100644
index 000000000..c667e2465
--- /dev/null
+++ b/leetcode/2021.Brightest-Position-on-Street/2021. Brightest Position on Street.go
@@ -0,0 +1,33 @@
+package leetcode
+
+import (
+ "sort"
+)
+
+type lightItem struct {
+ index int
+ sign int
+}
+
+func brightestPosition(lights [][]int) int {
+ lightMap, lightItems := map[int]int{}, []lightItem{}
+ for _, light := range lights {
+ lightMap[light[0]-light[1]] += 1
+ lightMap[light[0]+light[1]+1] -= 1
+ }
+ for k, v := range lightMap {
+ lightItems = append(lightItems, lightItem{index: k, sign: v})
+ }
+ sort.SliceStable(lightItems, func(i, j int) bool {
+ return lightItems[i].index < lightItems[j].index
+ })
+ res, border, tmp := 0, 0, 0
+ for _, v := range lightItems {
+ tmp += v.sign
+ if border < tmp {
+ res = v.index
+ border = tmp
+ }
+ }
+ return res
+}
diff --git a/leetcode/2021.Brightest-Position-on-Street/2021. Brightest Position on Street_test.go b/leetcode/2021.Brightest-Position-on-Street/2021. Brightest Position on Street_test.go
new file mode 100644
index 000000000..5247fbf6e
--- /dev/null
+++ b/leetcode/2021.Brightest-Position-on-Street/2021. Brightest Position on Street_test.go
@@ -0,0 +1,56 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question2021 struct {
+ para2021
+ ans2021
+}
+
+// para 是参数
+type para2021 struct {
+ lights [][]int
+}
+
+// ans 是答案
+type ans2021 struct {
+ ans int
+}
+
+func Test_Problem2021(t *testing.T) {
+
+ qs := []question2021{
+
+ {
+ para2021{[][]int{{-3, 2}, {1, 2}, {3, 3}}},
+ ans2021{-1},
+ },
+
+ {
+ para2021{[][]int{{1, 0}, {0, 1}}},
+ ans2021{1},
+ },
+
+ {
+ para2021{[][]int{{1, 2}}},
+ ans2021{-1},
+ },
+
+ {
+ para2021{[][]int{{1, 1}, {2, 4}, {-1, 0}, {-3, 5}, {1, 2}}},
+ ans2021{-1},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 2021------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans2021, q.para2021
+ fmt.Printf("【input】:%v ", p)
+ fmt.Printf("【output】:%v \n", brightestPosition(p.lights))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/2021.Brightest-Position-on-Street/README.md b/leetcode/2021.Brightest-Position-on-Street/README.md
new file mode 100644
index 000000000..3456fc7a0
--- /dev/null
+++ b/leetcode/2021.Brightest-Position-on-Street/README.md
@@ -0,0 +1,109 @@
+# [2021. Brightest Position on Street](https://leetcode.com/problems/brightest-position-on-street/)
+
+
+## 题目
+
+A perfectly straight street is represented by a number line. The street has street lamp(s) on it and is represented by a 2D integer array `lights`. Each `lights[i] = [positioni, rangei]` indicates that there is a street lamp at position `positioni` that lights up the area from `[positioni - rangei, positioni + rangei]` (**inclusive**).
+
+The **brightness** of a position `p` is defined as the number of street lamp that light up the position `p`.
+
+Given `lights`, return *the **brightest** position on the street. If there are multiple brightest positions, return the **smallest** one.*
+
+**Example 1:**
+
+
+
+```
+Input: lights = [[-3,2],[1,2],[3,3]]
+Output: -1
+Explanation:
+The first street lamp lights up the area from [(-3) - 2, (-3) + 2] = [-5, -1].
+The second street lamp lights up the area from [1 - 2, 1 + 2] = [-1, 3].
+The third street lamp lights up the area from [3 - 3, 3 + 3] = [0, 6].
+
+Position -1 has a brightness of 2, illuminated by the first and second street light.
+Positions 0, 1, 2, and 3 have a brightness of 2, illuminated by the second and third street light.
+Out of all these positions, -1 is the smallest, so return it.
+
+```
+
+**Example 2:**
+
+```
+Input: lights = [[1,0],[0,1]]
+Output: 1
+Explanation:
+The first street lamp lights up the area from [1 - 0, 1 + 0] = [1, 1].
+The second street lamp lights up the area from [0 - 1, 0 + 1] = [-1, 1].
+
+Position 1 has a brightness of 2, illuminated by the first and second street light.
+Return 1 because it is the brightest position on the street.
+
+```
+
+**Example 3:**
+
+```
+Input: lights = [[1,2]]
+Output: -1
+Explanation:
+The first street lamp lights up the area from [1 - 2, 1 + 2] = [-1, 3].
+
+Positions -1, 0, 1, 2, and 3 have a brightness of 1, illuminated by the first street light.
+Out of all these positions, -1 is the smallest, so return it.
+
+```
+
+**Constraints:**
+
+- `1 <= lights.length <= 105`
+- `lights[i].length == 2`
+- `108 <= positioni <= 108`
+- `0 <= rangei <= 108`
+
+## 题目大意
+
+一条完全笔直的街道由一条数字线表示。街道上有路灯，由二维数据表示。每个 `lights[i] = [positioni, rangei]` 表示位置 `i` 处有一盏路灯，灯可以照亮从 `[positioni - rangei, positioni + rangei]` （含）的区域。 位置 `p` 的亮度定义为点亮位置 `p` 的路灯数量。 给定路灯，返回街道上最亮的位置。如果有多个最亮的位置，则返回最小的一个。
+
+## 解题思路
+
+- 先将每个路灯的起始和终点位置计算出来。这样我们得到了一堆坐标点。假设灯照亮的范围是 [A, B]，那么在坐标轴上 A 坐标点处 + 1， B + 1 坐标点处 -1 。这样处理的含义是：坐标点 A 可以被一盏灯照亮，所以它照亮次数加一，坐标点 B + 1 出了灯照亮的范围了，所以照亮次数减一。那么从坐标轴坐标开始扫一遍，每次遇到 + 1 的时候就 + 1，遇到 - 1 的地方就 - 1。如此可以算出某个坐标点处，可以被灯照亮的总次数。
+- 需要注意的点是，题目给的测试数据可能会有单点照亮的情况，即某一盏灯只照亮一个坐标点，灯照范围为 0。同一个坐标点也可能是多个灯的起点。用一个 map 去重坐标点即可。
+
+## 代码
+
+```go
+package leetcode
+
+import (
+ "sort"
+)
+
+type lightItem struct {
+ index int
+ sign int
+}
+
+func brightestPosition(lights [][]int) int {
+ lightMap, lightItems := map[int]int{}, []lightItem{}
+ for _, light := range lights {
+ lightMap[light[0]-light[1]] += 1
+ lightMap[light[0]+light[1]+1] -= 1
+ }
+ for k, v := range lightMap {
+ lightItems = append(lightItems, lightItem{index: k, sign: v})
+ }
+ sort.SliceStable(lightItems, func(i, j int) bool {
+ return lightItems[i].index < lightItems[j].index
+ })
+ res, border, tmp := 0, 0, 0
+ for _, v := range lightItems {
+ tmp += v.sign
+ if border < tmp {
+ res = v.index
+ border = tmp
+ }
+ }
+ return res
+}
+```
\ No newline at end of file
diff --git a/leetcode/2022.Convert-1D-Array-Into-2D-Array/2022. Convert 1D Array Into 2D Array.go b/leetcode/2022.Convert-1D-Array-Into-2D-Array/2022. Convert 1D Array Into 2D Array.go
new file mode 100644
index 000000000..28dd363b8
--- /dev/null
+++ b/leetcode/2022.Convert-1D-Array-Into-2D-Array/2022. Convert 1D Array Into 2D Array.go
@@ -0,0 +1,12 @@
+package leetcode
+
+func construct2DArray(original []int, m int, n int) [][]int {
+ if m*n != len(original) {
+ return [][]int{}
+ }
+ res := make([][]int, m)
+ for i := 0; i < m; i++ {
+ res[i] = original[n*i : n*(i+1)]
+ }
+ return res
+}
diff --git a/leetcode/2022.Convert-1D-Array-Into-2D-Array/2022. Convert 1D Array Into 2D Array_test.go b/leetcode/2022.Convert-1D-Array-Into-2D-Array/2022. Convert 1D Array Into 2D Array_test.go
new file mode 100644
index 000000000..39f540d38
--- /dev/null
+++ b/leetcode/2022.Convert-1D-Array-Into-2D-Array/2022. Convert 1D Array Into 2D Array_test.go
@@ -0,0 +1,64 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question2022 struct {
+ para2022
+ ans2022
+}
+
+// para 是参数
+// one 代表第一个参数
+type para2022 struct {
+ original []int
+ m int
+ n int
+}
+
+// ans 是答案
+// one 代表第一个答案
+type ans2022 struct {
+ one [][]int
+}
+
+func Test_Problem2022(t *testing.T) {
+
+ qs := []question2022{
+
+ {
+ para2022{[]int{1, 2, 3, 4}, 2, 2},
+ ans2022{[][]int{{1, 2}, {3, 4}}},
+ },
+
+ {
+ para2022{[]int{1, 2, 3}, 1, 3},
+ ans2022{[][]int{{1, 2, 3}}},
+ },
+
+ {
+ para2022{[]int{1, 2}, 1, 1},
+ ans2022{[][]int{{}}},
+ },
+
+ {
+ para2022{[]int{3}, 1, 2},
+ ans2022{[][]int{{3}}},
+ },
+
+ {
+ para2022{[]int{1, 1, 1, 1}, 4, 1},
+ ans2022{[][]int{{1, 1, 1, 1}}},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 2022------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans2022, q.para2022
+ fmt.Printf("【input】:%v 【output】:%v\n", p, construct2DArray(p.original, p.m, p.n))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/2022.Convert-1D-Array-Into-2D-Array/README.md b/leetcode/2022.Convert-1D-Array-Into-2D-Array/README.md
new file mode 100644
index 000000000..83899096d
--- /dev/null
+++ b/leetcode/2022.Convert-1D-Array-Into-2D-Array/README.md
@@ -0,0 +1,77 @@
+# [2022. Convert 1D Array Into 2D Array](https://leetcode.com/problems/convert-1d-array-into-2d-array/)
+
+## 题目
+
+You are given a **0-indexed** 1-dimensional (1D) integer array `original`, and two integers, `m` and `n`. You are tasked with creating a 2-dimensional (2D) array with `m` rows and `n` columns using **all** the elements from `original`.
+
+The elements from indices `0` to `n - 1` (**inclusive**) of `original` should form the first row of the constructed 2D array, the elements from indices `n` to `2 * n - 1` (**inclusive**) should form the second row of the constructed 2D array, and so on.
+
+Return *an* `m x n` *2D array constructed according to the above procedure, or an empty 2D array if it is impossible*.
+
+**Example 1:**
+
+
+
+```
+Input: original = [1,2,3,4], m = 2, n = 2
+Output: [[1,2],[3,4]]
+Explanation: The constructed 2D array should contain 2 rows and 2 columns.
+The first group of n=2 elements in original, [1,2], becomes the first row in the constructed 2D array.
+The second group of n=2 elements in original, [3,4], becomes the second row in the constructed 2D array.
+
+```
+
+**Example 2:**
+
+```
+Input: original = [1,2,3], m = 1, n = 3
+Output: [[1,2,3]]
+Explanation: The constructed 2D array should contain 1 row and 3 columns.
+Put all three elements in original into the first row of the constructed 2D array.
+
+```
+
+**Example 3:**
+
+```
+Input: original = [1,2], m = 1, n = 1
+Output: []
+Explanation: There are 2 elements in original.
+It is impossible to fit 2 elements in a 1x1 2D array, so return an empty 2D array.
+
+```
+
+**Constraints:**
+
+- `1 <= original.length <= 5 * 104`
+- `1 <= original[i] <= 105`
+- `1 <= m, n <= 4 * 104`
+
+## 题目大意
+
+给你一个下标从 0 开始的一维整数数组 original 和两个整数 m 和 n 。你需要使用 original 中 所有 元素创建一个 m 行 n 列的二维数组。
+
+original 中下标从 0 到 n - 1 （都 包含 ）的元素构成二维数组的第一行，下标从 n 到 2 * n - 1 （都 包含 ）的元素构成二维数组的第二行，依此类推。
+
+请你根据上述过程返回一个 m x n 的二维数组。如果无法构成这样的二维数组，请你返回一个空的二维数组。
+
+## 解题思路
+
+- 简单题。从一维数组 original 中依次取出每行 n 个元素，顺序放到 m 行中。此题中，如果 m*n 大于或者小于 original 的长度，都输出空数组。
+
+## 代码
+
+```go
+package leetcode
+
+func construct2DArray(original []int, m int, n int) [][]int {
+ if m*n != len(original) {
+ return [][]int{}
+ }
+ res := make([][]int, m)
+ for i := 0; i < m; i++ {
+ res[i] = original[n*i : n*(i+1)]
+ }
+ return res
+}
+```
\ No newline at end of file
diff --git a/leetcode/2037.Minimum-Number-of-Moves-to-Seat-Everyone/2037.Minimum Number of Moves to Seat Everyone.go b/leetcode/2037.Minimum-Number-of-Moves-to-Seat-Everyone/2037.Minimum Number of Moves to Seat Everyone.go
new file mode 100644
index 000000000..89cae6ff4
--- /dev/null
+++ b/leetcode/2037.Minimum-Number-of-Moves-to-Seat-Everyone/2037.Minimum Number of Moves to Seat Everyone.go
@@ -0,0 +1,21 @@
+package leetcode
+
+import "sort"
+
+func minMovesToSeat(seats []int, students []int) int {
+ sort.Ints(seats)
+ sort.Ints(students)
+ n := len(students)
+ moves := 0
+ for i := 0; i < n; i++ {
+ moves += abs(seats[i], students[i])
+ }
+ return moves
+}
+
+func abs(a, b int) int {
+ if a > b {
+ return a - b
+ }
+ return b - a
+}
diff --git a/leetcode/2037.Minimum-Number-of-Moves-to-Seat-Everyone/2037.Minimum Number of Moves to Seat Everyone_test.go b/leetcode/2037.Minimum-Number-of-Moves-to-Seat-Everyone/2037.Minimum Number of Moves to Seat Everyone_test.go
new file mode 100644
index 000000000..17239790e
--- /dev/null
+++ b/leetcode/2037.Minimum-Number-of-Moves-to-Seat-Everyone/2037.Minimum Number of Moves to Seat Everyone_test.go
@@ -0,0 +1,52 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question2037 struct {
+ para2037
+ ans2037
+}
+
+// para 是参数
+type para2037 struct {
+ seats []int
+ students []int
+}
+
+// ans 是答案
+type ans2037 struct {
+ ans int
+}
+
+func Test_Problem2037(t *testing.T) {
+
+ qs := []question2037{
+
+ {
+ para2037{[]int{3, 1, 5}, []int{2, 7, 4}},
+ ans2037{4},
+ },
+
+ {
+ para2037{[]int{4, 1, 5, 9}, []int{1, 3, 2, 6}},
+ ans2037{7},
+ },
+
+ {
+ para2037{[]int{2, 2, 6, 6}, []int{1, 3, 2, 6}},
+ ans2037{4},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 2037------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans2037, q.para2037
+ fmt.Printf("【input】:%v ", p)
+ fmt.Printf("【output】:%v \n", minMovesToSeat(p.seats, p.students))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/2037.Minimum-Number-of-Moves-to-Seat-Everyone/README.md b/leetcode/2037.Minimum-Number-of-Moves-to-Seat-Everyone/README.md
new file mode 100644
index 000000000..beec7e76c
--- /dev/null
+++ b/leetcode/2037.Minimum-Number-of-Moves-to-Seat-Everyone/README.md
@@ -0,0 +1,94 @@
+# [2037. Minimum Number of Moves to Seat Everyone](https://leetcode.com/problems/minimum-number-of-moves-to-seat-everyone/)
+
+## 题目
+
+There are n seats and n students in a room. You are given an array seats of length n, where seats[i] is the position of the ith seat. You are also given the array students of length n, where students[j] is the position of the jth student.
+
+You may perform the following move any number of times:
+
+- Increase or decrease the position of the ith student by 1 (i.e., moving the ith student from position x to x + 1 or x - 1)
+
+Return the minimum number of moves required to move each student to a seat such that no two students are in the same seat.
+
+Note that there may be multiple seats or students in the same position at the beginning.
+
+**Example 1:**
+
+ Input: seats = [3,1,5], students = [2,7,4]
+ Output: 4
+ Explanation: The students are moved as follows:
+ - The first student is moved from from position 2 to position 1 using 1 move.
+ - The second student is moved from from position 7 to position 5 using 2 moves.
+ - The third student is moved from from position 4 to position 3 using 1 move.
+ In total, 1 + 2 + 1 = 4 moves were used.
+
+**Example 2:**
+
+ Input: seats = [4,1,5,9], students = [1,3,2,6]
+ Output: 7
+ Explanation: The students are moved as follows:
+ - The first student is not moved.
+ - The second student is moved from from position 3 to position 4 using 1 move.
+ - The third student is moved from from position 2 to position 5 using 3 moves.
+ - The fourth student is moved from from position 6 to position 9 using 3 moves.
+ In total, 0 + 1 + 3 + 3 = 7 moves were used.
+
+**Example 3:**
+
+ Input: seats = [2,2,6,6], students = [1,3,2,6]
+ Output: 4
+ Explanation: Note that there are two seats at position 2 and two seats at position 6.
+ The students are moved as follows:
+ - The first student is moved from from position 1 to position 2 using 1 move.
+ - The second student is moved from from position 3 to position 6 using 3 moves.
+ - The third student is not moved.
+ - The fourth student is not moved.
+ In total, 1 + 3 + 0 + 0 = 4 moves were used.
+
+**Constraints:**
+
+- n == seats.length == students.length
+- 1 <= n <= 100
+- 1 <= seats[i], students[j] <= 100
+
+## 题目大意
+
+一个房间里有 n 个座位和 n 名学生，房间用一个数轴表示。给你一个长度为 n 的数组 seats，其中 seats[i] 是第 i 个座位的位置。同时给你一个长度为 n 的数组 students ，其中 students[j] 是第 j 位学生的位置。
+
+你可以执行以下操作任意次：
+
+增加或者减少第 i 位学生的位置，每次变化量为 1（也就是将第 i 位学生从位置 x 移动到 x + 1或者 x - 1）
+
+请你返回使所有学生都有座位坐的最少移动次数，并确保没有两位学生的座位相同。
+
+请注意，初始时有可能有多个座位或者多位学生在 同一位置。
+
+## 解题思路
+
+- 排序+模拟计算
+
+# 代码
+
+```go
+package leetcode
+
+import "sort"
+
+func minMovesToSeat(seats []int, students []int) int {
+ sort.Ints(seats)
+ sort.Ints(students)
+ n := len(students)
+ moves := 0
+ for i := 0; i < n; i++ {
+ moves += abs(seats[i], students[i])
+ }
+ return moves
+}
+
+func abs(a, b int) int {
+ if a > b {
+ return a - b
+ }
+ return b - a
+}
+```
\ No newline at end of file
diff --git a/leetcode/2038.Remove-Colored-Pieces-if-Both-Neighbors-are-the-Same-Color/2038.Remove Colored Pieces if Both Neighbors are the Same Color.go b/leetcode/2038.Remove-Colored-Pieces-if-Both-Neighbors-are-the-Same-Color/2038.Remove Colored Pieces if Both Neighbors are the Same Color.go
new file mode 100644
index 000000000..8962f957a
--- /dev/null
+++ b/leetcode/2038.Remove-Colored-Pieces-if-Both-Neighbors-are-the-Same-Color/2038.Remove Colored Pieces if Both Neighbors are the Same Color.go
@@ -0,0 +1,25 @@
+package leetcode
+
+func winnerOfGame(colors string) bool {
+ As, Bs := 0, 0
+ Acont, Bcont := 0, 0
+ for _, color := range colors {
+ if color == 'A' {
+ Acont += 1
+ Bcont = 0
+ } else {
+ Bcont += 1
+ Acont = 0
+ }
+ if Acont >= 3 {
+ As += Acont - 2
+ }
+ if Bcont >= 3 {
+ Bs += Bcont - 2
+ }
+ }
+ if As > Bs {
+ return true
+ }
+ return false
+}
diff --git a/leetcode/2038.Remove-Colored-Pieces-if-Both-Neighbors-are-the-Same-Color/2038.Remove Colored Pieces if Both Neighbors are the Same Color_test.go b/leetcode/2038.Remove-Colored-Pieces-if-Both-Neighbors-are-the-Same-Color/2038.Remove Colored Pieces if Both Neighbors are the Same Color_test.go
new file mode 100644
index 000000000..567eea1fe
--- /dev/null
+++ b/leetcode/2038.Remove-Colored-Pieces-if-Both-Neighbors-are-the-Same-Color/2038.Remove Colored Pieces if Both Neighbors are the Same Color_test.go
@@ -0,0 +1,51 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question2038 struct {
+ para2038
+ ans2038
+}
+
+// para 是参数
+type para2038 struct {
+ colors string
+}
+
+// ans 是答案
+type ans2038 struct {
+ ans bool
+}
+
+func Test_Problem2038(t *testing.T) {
+
+ qs := []question2038{
+
+ {
+ para2038{"AAABABB"},
+ ans2038{true},
+ },
+
+ {
+ para2038{"AA"},
+ ans2038{false},
+ },
+
+ {
+ para2038{"ABBBBBBBAAA"},
+ ans2038{false},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 2038------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans2038, q.para2038
+ fmt.Printf("【input】:%v ", p.colors)
+ fmt.Printf("【output】:%v \n", winnerOfGame(p.colors))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/2038.Remove-Colored-Pieces-if-Both-Neighbors-are-the-Same-Color/README.md b/leetcode/2038.Remove-Colored-Pieces-if-Both-Neighbors-are-the-Same-Color/README.md
new file mode 100644
index 000000000..fdf3e5525
--- /dev/null
+++ b/leetcode/2038.Remove-Colored-Pieces-if-Both-Neighbors-are-the-Same-Color/README.md
@@ -0,0 +1,105 @@
+# [2038. Remove Colored Pieces if Both Neighbors are the Same Color](https://leetcode.com/problems/remove-colored-pieces-if-both-neighbors-are-the-same-color/)
+
+## 题目
+
+There are n pieces arranged in a line, and each piece is colored either by 'A' or by 'B'. You are given a string colors of length n where colors[i] is the color of the ith piece.
+
+Alice and Bob are playing a game where they take alternating turns removing pieces from the line. In this game, Alice moves first.
+
+- Alice is only allowed to remove a piece colored 'A' if both its neighbors are also colored 'A'. She is not allowed to remove pieces that are colored 'B'.
+- Bob is only allowed to remove a piece colored 'B' if both its neighbors are also colored 'B'. He is not allowed to remove pieces that are colored 'A'.
+- Alice and Bob cannot remove pieces from the edge of the line.
+- If a player cannot make a move on their turn, that player loses and the other player wins.
+
+Assuming Alice and Bob play optimally, return true if Alice wins, or return false if Bob wins.
+
+**Example 1:**
+
+ Input: colors = "AAABABB"
+ Output: true
+ Explanation:
+ AAABABB -> AABABB
+ Alice moves first.
+ She removes the second 'A' from the left since that is the only 'A' whose neighbors are both 'A'.
+
+ Now it's Bob's turn.
+ Bob cannot make a move on his turn since there are no 'B's whose neighbors are both 'B'.
+ Thus, Alice wins, so return true.
+
+**Example 2:**
+
+ Input: colors = "AA"
+ Output: false
+ Explanation:
+ Alice has her turn first.
+ There are only two 'A's and both are on the edge of the line, so she cannot move on her turn.
+ Thus, Bob wins, so return false.
+
+**Example 3:**
+
+ Input: colors = "ABBBBBBBAAA"
+ Output: false
+ Explanation:
+ ABBBBBBBAAA -> ABBBBBBBAA
+ Alice moves first.
+ Her only option is to remove the second to last 'A' from the right.
+
+ ABBBBBBBAA -> ABBBBBBAA
+ Next is Bob's turn.
+ He has many options for which 'B' piece to remove. He can pick any.
+
+ On Alice's second turn, she has no more pieces that she can remove.
+ Thus, Bob wins, so return false.
+
+**Constraints:**
+
+- 1 <= colors.length <= 100000
+- colors consists of only the letters 'A' and 'B'
+
+## 题目大意
+
+总共有 n 个颜色片段排成一列，每个颜色片段要么是 'A' 要么是 'B' 。给你一个长度为 n 的字符串 colors ，其中 colors[i] 表示第 i 个颜色片段的颜色。
+
+Alice 和 Bob 在玩一个游戏，他们轮流从这个字符串中删除颜色。Alice 先手。
+
+- 如果一个颜色片段为 'A' 且相邻两个颜色都是颜色 'A'，那么 Alice 可以删除该颜色片段。Alice不可以删除任何颜色 'B' 片段。
+- 如果一个颜色片段为 'B'且相邻两个颜色都是颜色 'B' ，那么 Bob 可以删除该颜色片段。Bob 不可以删除任何颜色 'A' 片段。
+- Alice 和 Bob 不能从字符串两端删除颜色片段。
+- 如果其中一人无法继续操作，则该玩家 输掉游戏且另一玩家 获胜。
+
+假设 Alice 和 Bob 都采用最优策略，如果 Alice 获胜，请返回true，否则 Bob 获胜，返回false。
+
+## 解题思路
+
+- 统计 Alice 和 Bob 分别可以操作的次数记为 As，Bs
+- 因为 Alice 先手，所以只要 As 大于 Bs，Alice 获胜返回 true，否则 Bob 获胜返回 false
+
+# 代码
+
+```go
+package leetcode
+
+func winnerOfGame(colors string) bool {
+ As, Bs := 0, 0
+ Acont, Bcont := 0, 0
+ for _, color := range colors {
+ if color == 'A' {
+ Acont += 1
+ Bcont = 0
+ } else {
+ Bcont += 1
+ Acont = 0
+ }
+ if Acont >= 3 {
+ As += Acont - 2
+ }
+ if Bcont >= 3 {
+ Bs += Bcont - 2
+ }
+ }
+ if As > Bs {
+ return true
+ }
+ return false
+}
+```
\ No newline at end of file
diff --git a/leetcode/2043.Simple-Bank-System/2043.Simple Bank System.go b/leetcode/2043.Simple-Bank-System/2043.Simple Bank System.go
new file mode 100644
index 000000000..025ce2480
--- /dev/null
+++ b/leetcode/2043.Simple-Bank-System/2043.Simple Bank System.go
@@ -0,0 +1,44 @@
+package leetcode
+
+type Bank struct {
+ accounts []int64
+ n int
+}
+
+func Constructor(balance []int64) Bank {
+ return Bank{
+ accounts: balance,
+ n: len(balance),
+ }
+}
+
+func (this *Bank) Transfer(account1 int, account2 int, money int64) bool {
+ if account1 > this.n || account2 > this.n {
+ return false
+ }
+ if this.accounts[account1-1] < money {
+ return false
+ }
+ this.accounts[account1-1] -= money
+ this.accounts[account2-1] += money
+ return true
+}
+
+func (this *Bank) Deposit(account int, money int64) bool {
+ if account > this.n {
+ return false
+ }
+ this.accounts[account-1] += money
+ return true
+}
+
+func (this *Bank) Withdraw(account int, money int64) bool {
+ if account > this.n {
+ return false
+ }
+ if this.accounts[account-1] < money {
+ return false
+ }
+ this.accounts[account-1] -= money
+ return true
+}
diff --git a/leetcode/2043.Simple-Bank-System/2043.Simple Bank System_test.go b/leetcode/2043.Simple-Bank-System/2043.Simple Bank System_test.go
new file mode 100644
index 000000000..96908986c
--- /dev/null
+++ b/leetcode/2043.Simple-Bank-System/2043.Simple Bank System_test.go
@@ -0,0 +1,62 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question2043 struct {
+ para2043
+ ans2043
+}
+
+// para 是参数
+type para2043 struct {
+ ops []string
+ para [][]int64
+}
+
+// ans 是答案
+type ans2043 struct {
+ ans []bool
+}
+
+func Test_Problem2043(t *testing.T) {
+
+ qs := []question2043{
+
+ {
+ para2043{
+ []string{"Bank", "withdraw", "transfer", "deposit", "transfer", "withdraw"},
+ [][]int64{{10, 100, 20, 50, 30}, {3, 10}, {5, 1, 20}, {5, 20}, {3, 4, 15}, {10, 50}}},
+ ans2043{[]bool{true, true, true, false, false}},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 2043------------------------\n")
+
+ for _, q := range qs {
+ var b Bank
+ var res []bool
+ _, p := q.ans2043, q.para2043
+ for i, op := range p.ops {
+ if op == "Bank" {
+ b = Constructor(q.para[i])
+ } else if op == "withdraw" {
+ isSuccess := b.Withdraw(int(p.para[i][0]), p.para[i][1])
+ res = append(res, isSuccess)
+ } else if op == "transfer" {
+ isSuccess := b.Transfer(int(p.para[i][0]), int(p.para[i][0]), p.para[i][2])
+ res = append(res, isSuccess)
+ } else if op == "deposit" {
+ isSuccess := b.Deposit(int(p.para[i][0]), p.para[i][1])
+ res = append(res, isSuccess)
+ } else {
+ fmt.Println("unknown operation")
+ }
+ }
+ fmt.Printf("【input】:%v \n", p)
+ fmt.Printf("【output】:%v \n", res)
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/2043.Simple-Bank-System/README.md b/leetcode/2043.Simple-Bank-System/README.md
new file mode 100644
index 000000000..abae43d3b
--- /dev/null
+++ b/leetcode/2043.Simple-Bank-System/README.md
@@ -0,0 +1,113 @@
+# [2043. Simple Bank System](https://leetcode.com/problems/simple-bank-system/)
+
+## 题目
+
+You have been tasked with writing a program for a popular bank that will automate all its incoming transactions (transfer, deposit, and withdraw). The bank has n accounts numbered from 1 to n. The initial balance of each account is stored in a 0-indexed integer array balance, with the (i + 1)th account having an initial balance of balance[i].
+
+Execute all the valid transactions. A transaction is valid if:
+
+- The given account number(s) are between 1 and n, and
+- The amount of money withdrawn or transferred from is less than or equal to the balance of the account.
+
+Implement the Bank class:
+
+- Bank(long[] balance) Initializes the object with the 0-indexed integer array balance.
+- boolean transfer(int account1, int account2, long money) Transfers money dollars from the account numbered account1 to the account numbered account2. Return true if the transaction was successful, false otherwise.
+- boolean deposit(int account, long money) Deposit money dollars into the account numbered account. Return true if the transaction was successful, false otherwise.
+- boolean withdraw(int account, long money) Withdraw money dollars from the account numbered account. Return true if the transaction was successful, false otherwise.
+
+**Example 1:**
+
+ Input
+ ["Bank", "withdraw", "transfer", "deposit", "transfer", "withdraw"]
+ [[[10, 100, 20, 50, 30]], [3, 10], [5, 1, 20], [5, 20], [3, 4, 15], [10, 50]]
+ Output
+ [null, true, true, true, false, false]
+
+ Explanation
+ Bank bank = new Bank([10, 100, 20, 50, 30]);
+ bank.withdraw(3, 10); // return true, account 3 has a balance of $20, so it is valid to withdraw $10.
+ // Account 3 has $20 - $10 = $10.
+ bank.transfer(5, 1, 20); // return true, account 5 has a balance of $30, so it is valid to transfer $20.
+ // Account 5 has $30 - $20 = $10, and account 1 has $10 + $20 = $30.
+ bank.deposit(5, 20); // return true, it is valid to deposit $20 to account 5.
+ // Account 5 has $10 + $20 = $30.
+ bank.transfer(3, 4, 15); // return false, the current balance of account 3 is $10,
+ // so it is invalid to transfer $15 from it.
+ bank.withdraw(10, 50); // return false, it is invalid because account 10 does not exist.
+
+**Constraints:**
+
+- n == balance.length
+- 1 <= n, account, account1, account2 <= 100000
+- 0 <= balance[i], money <= 1000000000000
+- At most 104 calls will be made to each function transfer, deposit, withdraw.
+
+## 题目大意
+
+你的任务是为一个很受欢迎的银行设计一款程序，以自动化执行所有传入的交易（转账，存款和取款）。银行共有 n 个账户，编号从 1 到 n 。每个账号的初始余额存储在一个下标从 0 开始的整数数组 balance 中，其中第 (i + 1) 个账户的初始余额是 balance[i] 。
+
+请你执行所有 有效的 交易。如果满足下面全部条件，则交易 有效 ：
+
+- 指定的账户数量在 1 和 n 之间，且
+- 取款或者转账需要的钱的总数 小于或者等于 账户余额。
+
+实现 Bank 类：
+
+- Bank(long[] balance) 使用下标从 0 开始的整数数组 balance 初始化该对象。
+- boolean transfer(int account1, int account2, long money) 从编号为 account1 的账户向编号为 account2 的账户转帐 money 美元。如果交易成功，返回 true ，否则，返回 false 。
+- boolean deposit(int account, long money) 向编号为 account 的账户存款 money 美元。如果交易成功，返回 true ；否则，返回 false 。
+- boolean withdraw(int account, long money) 从编号为 account 的账户取款 money 美元。如果交易成功，返回 true ；否则，返回 false 。
+
+## 解题思路
+
+ 根据题意进行简单模拟
+
+# 代码
+
+```go
+package leetcode
+
+type Bank struct {
+ accounts []int64
+ n int
+}
+
+func Constructor(balance []int64) Bank {
+ return Bank{
+ accounts: balance,
+ n: len(balance),
+ }
+}
+
+func (this *Bank) Transfer(account1 int, account2 int, money int64) bool {
+ if account1 > this.n || account2 > this.n {
+ return false
+ }
+ if this.accounts[account1-1] < money {
+ return false
+ }
+ this.accounts[account1-1] -= money
+ this.accounts[account2-1] += money
+ return true
+}
+
+func (this *Bank) Deposit(account int, money int64) bool {
+ if account > this.n {
+ return false
+ }
+ this.accounts[account-1] += money
+ return true
+}
+
+func (this *Bank) Withdraw(account int, money int64) bool {
+ if account > this.n {
+ return false
+ }
+ if this.accounts[account-1] < money {
+ return false
+ }
+ this.accounts[account-1] -= money
+ return true
+}
+```
\ No newline at end of file
diff --git a/leetcode/2096.Step-By-Step-Directions-From-a-Binary-Tree-Node-to-Another/2096. Step-By-Step Directions From a Binary Tree Node to Another.go b/leetcode/2096.Step-By-Step-Directions-From-a-Binary-Tree-Node-to-Another/2096. Step-By-Step Directions From a Binary Tree Node to Another.go
new file mode 100644
index 000000000..cd4f10897
--- /dev/null
+++ b/leetcode/2096.Step-By-Step-Directions-From-a-Binary-Tree-Node-to-Another/2096. Step-By-Step Directions From a Binary Tree Node to Another.go
@@ -0,0 +1,77 @@
+package leetcode
+
+import (
+ "github.com/halfrost/LeetCode-Go/structures"
+)
+
+// TreeNode define
+type TreeNode = structures.TreeNode
+
+/**
+ * Definition for a binary tree node.
+ * type TreeNode struct {
+ * Val int
+ * Left *TreeNode
+ * Right *TreeNode
+ * }
+ */
+
+func getDirections(root *TreeNode, startValue int, destValue int) string {
+ sPath, dPath := make([]byte, 0), make([]byte, 0)
+ findPath(root, startValue, &sPath)
+ findPath(root, destValue, &dPath)
+ size, i := min(len(sPath), len(dPath)), 0
+ for i < size {
+ if sPath[len(sPath)-1-i] == dPath[len(dPath)-1-i] {
+ i++
+ } else {
+ break
+ }
+ }
+ sPath = sPath[:len(sPath)-i]
+ replace(sPath)
+ dPath = dPath[:len(dPath)-i]
+ reverse(dPath)
+ sPath = append(sPath, dPath...)
+ return string(sPath)
+}
+
+func findPath(root *TreeNode, value int, path *[]byte) bool {
+ if root.Val == value {
+ return true
+ }
+
+ if root.Left != nil && findPath(root.Left, value, path) {
+ *path = append(*path, 'L')
+ return true
+ }
+
+ if root.Right != nil && findPath(root.Right, value, path) {
+ *path = append(*path, 'R')
+ return true
+ }
+
+ return false
+}
+
+func reverse(path []byte) {
+ left, right := 0, len(path)-1
+ for left < right {
+ path[left], path[right] = path[right], path[left]
+ left++
+ right--
+ }
+}
+
+func replace(path []byte) {
+ for i := 0; i < len(path); i++ {
+ path[i] = 'U'
+ }
+}
+
+func min(i, j int) int {
+ if i < j {
+ return i
+ }
+ return j
+}
diff --git a/leetcode/2096.Step-By-Step-Directions-From-a-Binary-Tree-Node-to-Another/2096. Step-By-Step Directions From a Binary Tree Node to Another_test.go b/leetcode/2096.Step-By-Step-Directions-From-a-Binary-Tree-Node-to-Another/2096. Step-By-Step Directions From a Binary Tree Node to Another_test.go
new file mode 100644
index 000000000..e30610185
--- /dev/null
+++ b/leetcode/2096.Step-By-Step-Directions-From-a-Binary-Tree-Node-to-Another/2096. Step-By-Step Directions From a Binary Tree Node to Another_test.go
@@ -0,0 +1,68 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+
+ "github.com/halfrost/LeetCode-Go/structures"
+)
+
+type question2096 struct {
+ para2096
+ ans2096
+}
+
+// para 是参数
+// one 代表第一个参数
+type para2096 struct {
+ one []int
+ startValue int
+ destValue int
+}
+
+// ans 是答案
+// one 代表第一个答案
+type ans2096 struct {
+ one string
+}
+
+func Test_Problem2096(t *testing.T) {
+
+ qs := []question2096{
+
+ {
+ para2096{[]int{5, 1, 2, 3, structures.NULL, 6, 4}, 3, 6},
+ ans2096{"UURL"},
+ },
+
+ {
+ para2096{[]int{2, 1}, 2, 1},
+ ans2096{"L"},
+ },
+
+ {
+ para2096{[]int{1, 2}, 2, 1},
+ ans2096{"U"},
+ },
+
+ {
+ para2096{[]int{3, 1, 2}, 2, 1},
+ ans2096{"UL"},
+ },
+
+ {
+ para2096{[]int{7, 8, 3, 1, structures.NULL, 4, 5, 6, structures.NULL, structures.NULL, structures.NULL, structures.NULL, structures.NULL, structures.NULL, 2}, 7, 5},
+ ans2096{"RR"},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 2096------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans2096, q.para2096
+ fmt.Printf("【input】:%v ", p)
+ root := structures.Ints2TreeNode(p.one)
+ fmt.Printf("【output】:%v \n", getDirections(root, p.startValue, p.destValue))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/2096.Step-By-Step-Directions-From-a-Binary-Tree-Node-to-Another/README.md b/leetcode/2096.Step-By-Step-Directions-From-a-Binary-Tree-Node-to-Another/README.md
new file mode 100644
index 000000000..409608c8c
--- /dev/null
+++ b/leetcode/2096.Step-By-Step-Directions-From-a-Binary-Tree-Node-to-Another/README.md
@@ -0,0 +1,145 @@
+# [2096. Step-By-Step Directions From a Binary Tree Node to Another](https://leetcode.com/problems/step-by-step-directions-from-a-binary-tree-node-to-another/)
+
+
+## 题目
+
+You are given the `root` of a **binary tree** with `n` nodes. Each node is uniquely assigned a value from `1` to `n`. You are also given an integer `startValue` representing the value of the start node `s`, and a different integer `destValue` representing the value of the destination node `t`.
+
+Find the **shortest path** starting from node `s` and ending at node `t`. Generate step-by-step directions of such path as a string consisting of only the **uppercase** letters `'L'`, `'R'`, and `'U'`. Each letter indicates a specific direction:
+
+- `'L'` means to go from a node to its **left child** node.
+- `'R'` means to go from a node to its **right child** node.
+- `'U'` means to go from a node to its **parent** node.
+
+Return *the step-by-step directions of the **shortest path** from node* `s` *to node* `t`.
+
+**Example 1:**
+
+
+
+```
+Input: root = [5,1,2,3,null,6,4], startValue = 3, destValue = 6
+Output: "UURL"
+Explanation: The shortest path is: 3 → 1 → 5 → 2 → 6.
+
+```
+
+**Example 2:**
+
+
+
+```
+Input: root = [2,1], startValue = 2, destValue = 1
+Output: "L"
+Explanation: The shortest path is: 2 → 1.
+
+```
+
+**Constraints:**
+
+- The number of nodes in the tree is `n`.
+- `2 <= n <= 105`
+- `1 <= Node.val <= n`
+- All the values in the tree are **unique**.
+- `1 <= startValue, destValue <= n`
+- `startValue != destValue`
+
+## 题目大意
+
+给你一棵 二叉树 的根节点 root ，这棵二叉树总共有 n 个节点。每个节点的值为 1 到 n 中的一个整数，且互不相同。给你一个整数 startValue ，表示起点节点 s 的值，和另一个不同的整数 destValue ，表示终点节点 t 的值。
+
+请找到从节点 s 到节点 t 的 最短路径 ，并以字符串的形式返回每一步的方向。每一步用 大写 字母 'L' ，'R' 和 'U' 分别表示一种方向：
+
+- 'L' 表示从一个节点前往它的 左孩子 节点。
+- 'R' 表示从一个节点前往它的 右孩子 节点。
+- 'U' 表示从一个节点前往它的 父 节点。
+
+请你返回从 s 到 t 最短路径 每一步的方向。
+
+## 解题思路
+
+- 二叉树中一个节点到另一个节点的最短路径一定可以分为两个部分（可能为空）：从起点节点向上到两个节点的**最近公共祖先**，再从最近公共祖先向下到达终点节点。
+- 首先需要找到起点 s 与公共祖先的节点之间的 path1，公共祖先节点与终点 t 的 path2。再删掉 2 个 path 的公共前缀。如果起点 s 和终点 t 在不同的分支上，不存在公共前缀。如果他们在相同的分支上，那么最终答案要去掉这个公共前缀。
+- 删除掉公共前缀以后，需要再整理一下最终答案的输出格式。由于题目要求，起点到公共祖先节点需要输出 U，所以把这段 path1 全部改成 U，然后再拼接上 path2 字符串，即可得到的字符串即为待求 ss 到 tt 每一步的最短路径。
+
+## 代码
+
+```go
+package leetcode
+
+import (
+ "github.com/halfrost/LeetCode-Go/structures"
+)
+
+// TreeNode define
+type TreeNode = structures.TreeNode
+
+/**
+ * Definition for a binary tree node.
+ * type TreeNode struct {
+ * Val int
+ * Left *TreeNode
+ * Right *TreeNode
+ * }
+ */
+
+func getDirections(root *TreeNode, startValue int, destValue int) string {
+ sPath, dPath := make([]byte, 0), make([]byte, 0)
+ findPath(root, startValue, &sPath)
+ findPath(root, destValue, &dPath)
+ size, i := min(len(sPath), len(dPath)), 0
+ for i < size {
+ if sPath[len(sPath)-1-i] == dPath[len(dPath)-1-i] {
+ i++
+ } else {
+ break
+ }
+ }
+ sPath = sPath[:len(sPath)-i]
+ replace(sPath)
+ dPath = dPath[:len(dPath)-i]
+ reverse(dPath)
+ sPath = append(sPath, dPath...)
+ return string(sPath)
+}
+
+func findPath(root *TreeNode, value int, path *[]byte) bool {
+ if root.Val == value {
+ return true
+ }
+
+ if root.Left != nil && findPath(root.Left, value, path) {
+ *path = append(*path, 'L')
+ return true
+ }
+
+ if root.Right != nil && findPath(root.Right, value, path) {
+ *path = append(*path, 'R')
+ return true
+ }
+
+ return false
+}
+
+func reverse(path []byte) {
+ left, right := 0, len(path)-1
+ for left < right {
+ path[left], path[right] = path[right], path[left]
+ left++
+ right--
+ }
+}
+
+func replace(path []byte) {
+ for i := 0; i < len(path); i++ {
+ path[i] = 'U'
+ }
+}
+
+func min(i, j int) int {
+ if i < j {
+ return i
+ }
+ return j
+}
+```
\ No newline at end of file
diff --git a/leetcode/2164.Sort-Even-and-Odd-Indices-Independently/2164. Sort Even and Odd Indices Independently.go b/leetcode/2164.Sort-Even-and-Odd-Indices-Independently/2164. Sort Even and Odd Indices Independently.go
new file mode 100644
index 000000000..fa5fd49d9
--- /dev/null
+++ b/leetcode/2164.Sort-Even-and-Odd-Indices-Independently/2164. Sort Even and Odd Indices Independently.go
@@ -0,0 +1,30 @@
+package leetcode
+
+import (
+ "sort"
+)
+
+func sortEvenOdd(nums []int) []int {
+ odd, even, res := []int{}, []int{}, []int{}
+ for index, v := range nums {
+ if index%2 == 0 {
+ even = append(even, v)
+ } else {
+ odd = append(odd, v)
+ }
+ }
+ sort.Ints(even)
+ sort.Sort(sort.Reverse(sort.IntSlice(odd)))
+
+ indexO, indexE := 0, 0
+ for i := 0; i < len(nums); i++ {
+ if i%2 == 0 {
+ res = append(res, even[indexE])
+ indexE++
+ } else {
+ res = append(res, odd[indexO])
+ indexO++
+ }
+ }
+ return res
+}
diff --git a/leetcode/2164.Sort-Even-and-Odd-Indices-Independently/2164. Sort Even and Odd Indices Independently_test.go b/leetcode/2164.Sort-Even-and-Odd-Indices-Independently/2164. Sort Even and Odd Indices Independently_test.go
new file mode 100644
index 000000000..77933ad14
--- /dev/null
+++ b/leetcode/2164.Sort-Even-and-Odd-Indices-Independently/2164. Sort Even and Odd Indices Independently_test.go
@@ -0,0 +1,46 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question2164 struct {
+ para2164
+ ans2164
+}
+
+// para 是参数
+// one 代表第一个参数
+type para2164 struct {
+ nums []int
+}
+
+// ans 是答案
+// one 代表第一个答案
+type ans2164 struct {
+ one []int
+}
+
+func Test_Problem1(t *testing.T) {
+
+ qs := []question2164{
+ {
+ para2164{[]int{4, 1, 2, 3}},
+ ans2164{[]int{2, 3, 4, 1}},
+ },
+
+ {
+ para2164{[]int{2, 1}},
+ ans2164{[]int{2, 1}},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 2164------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans2164, q.para2164
+ fmt.Printf("【input】:%v 【output】:%v\n", p, sortEvenOdd(p.nums))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/2164.Sort-Even-and-Odd-Indices-Independently/README.md b/leetcode/2164.Sort-Even-and-Odd-Indices-Independently/README.md
new file mode 100644
index 000000000..a8e650740
--- /dev/null
+++ b/leetcode/2164.Sort-Even-and-Odd-Indices-Independently/README.md
@@ -0,0 +1,93 @@
+# [2164. Sort Even and Odd Indices Independently](https://leetcode.com/problems/sort-even-and-odd-indices-independently/)
+
+
+## 题目
+
+You are given a **0-indexed** integer array `nums`. Rearrange the values of `nums` according to the following rules:
+
+1. Sort the values at **odd indices** of `nums` in **non-increasing** order.
+ - For example, if `nums = [4,**1**,2,**3**]` before this step, it becomes `[4,**3**,2,**1**]` after. The values at odd indices `1` and `3` are sorted in non-increasing order.
+2. Sort the values at **even indices** of `nums` in **non-decreasing** order.
+ - For example, if `nums = [**4**,1,**2**,3]` before this step, it becomes `[**2**,1,**4**,3]` after. The values at even indices `0` and `2` are sorted in non-decreasing order.
+
+Return *the array formed after rearranging the values of* `nums`.
+
+**Example 1:**
+
+```
+Input: nums = [4,1,2,3]
+Output: [2,3,4,1]
+Explanation:
+First, we sort the values present at odd indices (1 and 3) in non-increasing order.
+So, nums changes from [4,1,2,3] to [4,3,2,1].
+Next, we sort the values present at even indices (0 and 2) in non-decreasing order.
+So, nums changes from [4,1,2,3] to [2,3,4,1].
+Thus, the array formed after rearranging the values is [2,3,4,1].
+
+```
+
+**Example 2:**
+
+```
+Input: nums = [2,1]
+Output: [2,1]
+Explanation:
+Since there is exactly one odd index and one even index, no rearrangement of values takes place.
+The resultant array formed is [2,1], which is the same as the initial array.
+
+```
+
+**Constraints:**
+
+- `1 <= nums.length <= 100`
+- `1 <= nums[i] <= 100`
+
+## 题目大意
+
+给你一个下标从 0 开始的整数数组 nums 。根据下述规则重排 nums 中的值：
+
+1. 按 非递增 顺序排列 nums 奇数下标 上的所有值。
+举个例子，如果排序前 nums = [4,1,2,3] ，对奇数下标的值排序后变为 [4,3,2,1] 。奇数下标 1 和 3 的值按照非递增顺序重排。
+2. 按 非递减 顺序排列 nums 偶数下标 上的所有值。
+举个例子，如果排序前 nums = [4,1,2,3] ，对偶数下标的值排序后变为 [2,1,4,3] 。偶数下标 0 和 2 的值按照非递减顺序重排。
+
+返回重排 nums 的值之后形成的数组。
+
+## 解题思路
+
+- 简单题。分别将奇数和偶数位上的数字排序，奇数位的数从大到小，偶数位的数从小到大。最后将他们组合成一个数组。
+
+## 代码
+
+```go
+package leetcode
+
+import (
+ "sort"
+)
+
+func sortEvenOdd(nums []int) []int {
+ odd, even, res := []int{}, []int{}, []int{}
+ for index, v := range nums {
+ if index%2 == 0 {
+ even = append(even, v)
+ } else {
+ odd = append(odd, v)
+ }
+ }
+ sort.Ints(even)
+ sort.Sort(sort.Reverse(sort.IntSlice(odd)))
+
+ indexO, indexE := 0, 0
+ for i := 0; i < len(nums); i++ {
+ if i%2 == 0 {
+ res = append(res, even[indexE])
+ indexE++
+ } else {
+ res = append(res, odd[indexO])
+ indexO++
+ }
+ }
+ return res
+}
+```
\ No newline at end of file
diff --git a/leetcode/2165.Smallest-Value-of-the-Rearranged-Number/2165. Smallest Value of the Rearranged Number.go b/leetcode/2165.Smallest-Value-of-the-Rearranged-Number/2165. Smallest Value of the Rearranged Number.go
new file mode 100644
index 000000000..1ca93c413
--- /dev/null
+++ b/leetcode/2165.Smallest-Value-of-the-Rearranged-Number/2165. Smallest Value of the Rearranged Number.go
@@ -0,0 +1,51 @@
+package leetcode
+
+import "sort"
+
+func smallestNumber(num int64) int64 {
+ pos := true
+ if num < 0 {
+ pos = false
+ num *= -1
+ }
+ nums, m, res := []int{}, map[int]int{}, 0
+ for num != 0 {
+ tmp := int(num % 10)
+ m[tmp]++
+ num = num / 10
+ }
+
+ for k := range m {
+ nums = append(nums, k)
+ }
+ if pos {
+ sort.Ints(nums)
+ } else {
+ sort.Sort(sort.Reverse(sort.IntSlice(nums)))
+ }
+
+ if nums[0] == 0 && len(nums) > 1 {
+ res += nums[1]
+ m[nums[1]]--
+ }
+
+ for _, v := range nums {
+ if res != 0 {
+ for j := m[v]; j > 0; j-- {
+ res = res * 10
+ res += v
+ }
+ } else {
+ res += v
+ tmp := m[v] - 1
+ for j := tmp; j > 0; j-- {
+ res = res * 10
+ res += v
+ }
+ }
+ }
+ if !pos {
+ return -1 * int64(res)
+ }
+ return int64(res)
+}
diff --git a/leetcode/2165.Smallest-Value-of-the-Rearranged-Number/2165. Smallest Value of the Rearranged Number_test.go b/leetcode/2165.Smallest-Value-of-the-Rearranged-Number/2165. Smallest Value of the Rearranged Number_test.go
new file mode 100644
index 000000000..657fe30c4
--- /dev/null
+++ b/leetcode/2165.Smallest-Value-of-the-Rearranged-Number/2165. Smallest Value of the Rearranged Number_test.go
@@ -0,0 +1,52 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question2165 struct {
+ para2165
+ ans2165
+}
+
+// para 是参数
+// one 代表第一个参数
+type para2165 struct {
+ nums int64
+}
+
+// ans 是答案
+// one 代表第一个答案
+type ans2165 struct {
+ one int64
+}
+
+func Test_Problem1(t *testing.T) {
+
+ qs := []question2165{
+
+ {
+ para2165{310},
+ ans2165{103},
+ },
+
+ {
+ para2165{5059},
+ ans2165{5059},
+ },
+
+ {
+ para2165{-7605},
+ ans2165{-7650},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 2165------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans2165, q.para2165
+ fmt.Printf("【input】:%v 【output】:%v\n", p, smallestNumber(p.nums))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/2165.Smallest-Value-of-the-Rearranged-Number/README.md b/leetcode/2165.Smallest-Value-of-the-Rearranged-Number/README.md
new file mode 100644
index 000000000..8561bf22e
--- /dev/null
+++ b/leetcode/2165.Smallest-Value-of-the-Rearranged-Number/README.md
@@ -0,0 +1,101 @@
+# [2165. Smallest Value of the Rearranged Number](https://leetcode.com/problems/smallest-value-of-the-rearranged-number/)
+
+
+## 题目
+
+You are given an integer `num.` **Rearrange** the digits of `num` such that its value is **minimized** and it does not contain **any** leading zeros.
+
+Return *the rearranged number with minimal value*.
+
+Note that the sign of the number does not change after rearranging the digits.
+
+**Example 1:**
+
+```
+Input: num = 310
+Output: 103
+Explanation: The possible arrangements for the digits of 310 are 013, 031, 103, 130, 301, 310.
+The arrangement with the smallest value that does not contain any leading zeros is 103.
+
+```
+
+**Example 2:**
+
+```
+Input: num = -7605
+Output: -7650
+Explanation: Some possible arrangements for the digits of -7605 are -7650, -6705, -5076, -0567.
+The arrangement with the smallest value that does not contain any leading zeros is -7650.
+
+```
+
+**Constraints:**
+
+- `10^15 <= num <= 10^15`
+
+## 题目大意
+
+给你一个整数 num 。重排 num 中的各位数字，使其值 最小化 且不含 任何 前导零。
+
+返回不含前导零且值最小的重排数字。注意，重排各位数字后，num 的符号不会改变。
+
+## 解题思路
+
+- 先将每个数字出现次数统计出来。然后将数字大小从小到大排序。如果原数是正数，当出现有数字 0 的情况的时候，需先将第二小的数字排列到第一个，再把 0 排列完。再继续排列第二小，第三小。。。
+- 如果原数是负数。那么就逆序排列，即先排列最大的数字，然后次大的数字，直到排列最小的数字。因为数字越大，对应的这个数的负数就越小。
+
+## 代码
+
+```go
+package leetcode
+
+import "sort"
+
+func smallestNumber(num int64) int64 {
+ pos := true
+ if num < 0 {
+ pos = false
+ num *= -1
+ }
+ nums, m, res := []int{}, map[int]int{}, 0
+ for num != 0 {
+ tmp := int(num % 10)
+ m[tmp]++
+ num = num / 10
+ }
+
+ for k := range m {
+ nums = append(nums, k)
+ }
+ if pos {
+ sort.Ints(nums)
+ } else {
+ sort.Sort(sort.Reverse(sort.IntSlice(nums)))
+ }
+
+ if nums[0] == 0 && len(nums) > 1 {
+ res += nums[1]
+ m[nums[1]]--
+ }
+
+ for _, v := range nums {
+ if res != 0 {
+ for j := m[v]; j > 0; j-- {
+ res = res * 10
+ res += v
+ }
+ } else {
+ res += v
+ tmp := m[v] - 1
+ for j := tmp; j > 0; j-- {
+ res = res * 10
+ res += v
+ }
+ }
+ }
+ if !pos {
+ return -1 * int64(res)
+ }
+ return int64(res)
+}
+```
\ No newline at end of file
diff --git a/leetcode/2166.Design-Bitset/2166. Design Bitset.go b/leetcode/2166.Design-Bitset/2166. Design Bitset.go
new file mode 100644
index 000000000..27d7bb0af
--- /dev/null
+++ b/leetcode/2166.Design-Bitset/2166. Design Bitset.go
@@ -0,0 +1,72 @@
+package leetcode
+
+type Bitset struct {
+ set []byte
+ flipped []byte
+ oneCount int
+ size int
+}
+
+func Constructor(size int) Bitset {
+ set := make([]byte, size)
+ flipped := make([]byte, size)
+ for i := 0; i < size; i++ {
+ set[i] = byte('0')
+ flipped[i] = byte('1')
+ }
+ return Bitset{
+ set: set,
+ flipped: flipped,
+ oneCount: 0,
+ size: size,
+ }
+}
+
+func (this *Bitset) Fix(idx int) {
+ if this.set[idx] == byte('0') {
+ this.set[idx] = byte('1')
+ this.flipped[idx] = byte('0')
+ this.oneCount++
+ }
+}
+
+func (this *Bitset) Unfix(idx int) {
+ if this.set[idx] == byte('1') {
+ this.set[idx] = byte('0')
+ this.flipped[idx] = byte('1')
+ this.oneCount--
+ }
+}
+
+func (this *Bitset) Flip() {
+ this.set, this.flipped = this.flipped, this.set
+ this.oneCount = this.size - this.oneCount
+}
+
+func (this *Bitset) All() bool {
+ return this.oneCount == this.size
+}
+
+func (this *Bitset) One() bool {
+ return this.oneCount != 0
+}
+
+func (this *Bitset) Count() int {
+ return this.oneCount
+}
+
+func (this *Bitset) ToString() string {
+ return string(this.set)
+}
+
+/**
+ * Your Bitset object will be instantiated and called as such:
+ * obj := Constructor(size);
+ * obj.Fix(idx);
+ * obj.Unfix(idx);
+ * obj.Flip();
+ * param_4 := obj.All();
+ * param_5 := obj.One();
+ * param_6 := obj.Count();
+ * param_7 := obj.ToString();
+ */
diff --git a/leetcode/2166.Design-Bitset/2166. Design Bitset_test.go b/leetcode/2166.Design-Bitset/2166. Design Bitset_test.go
new file mode 100644
index 000000000..48ee6ec0a
--- /dev/null
+++ b/leetcode/2166.Design-Bitset/2166. Design Bitset_test.go
@@ -0,0 +1,31 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+func Test_Problem2166(t *testing.T) {
+ obj := Constructor(5)
+ fmt.Printf("obj = %v\n", obj)
+
+ obj.Fix(3)
+ fmt.Printf("obj = %v\n", obj)
+ obj.Fix(1)
+ fmt.Printf("obj = %v\n", obj)
+ obj.Flip()
+ fmt.Printf("obj = %v\n", obj)
+
+ fmt.Printf("all = %v\n", obj.All())
+ obj.Unfix(0)
+ fmt.Printf("obj = %v\n", obj)
+ obj.Flip()
+ fmt.Printf("obj = %v\n", obj)
+
+ fmt.Printf("one = %v\n", obj.One())
+ obj.Unfix(0)
+ fmt.Printf("obj = %v\n", obj)
+
+ fmt.Printf("count = %v\n", obj.Count())
+ fmt.Printf("toString = %v\n", obj.ToString())
+}
diff --git a/leetcode/2166.Design-Bitset/README.md b/leetcode/2166.Design-Bitset/README.md
new file mode 100644
index 000000000..916bbf5ed
--- /dev/null
+++ b/leetcode/2166.Design-Bitset/README.md
@@ -0,0 +1,156 @@
+# [2166. Design Bitset](https://leetcode.com/problems/design-bitset/)
+
+
+## 题目
+
+A **Bitset** is a data structure that compactly stores bits.
+
+Implement the `Bitset` class:
+
+- `Bitset(int size)` Initializes the Bitset with `size` bits, all of which are `0`.
+- `void fix(int idx)` Updates the value of the bit at the index `idx` to `1`. If the value was already `1`, no change occurs.
+- `void unfix(int idx)` Updates the value of the bit at the index `idx` to `0`. If the value was already `0`, no change occurs.
+- `void flip()` Flips the values of each bit in the Bitset. In other words, all bits with value `0` will now have value `1` and vice versa.
+- `boolean all()` Checks if the value of **each** bit in the Bitset is `1`. Returns `true` if it satisfies the condition, `false` otherwise.
+- `boolean one()` Checks if there is **at least one** bit in the Bitset with value `1`. Returns `true` if it satisfies the condition, `false` otherwise.
+- `int count()` Returns the **total number** of bits in the Bitset which have value `1`.
+- `String toString()` Returns the current composition of the Bitset. Note that in the resultant string, the character at the `ith` index should coincide with the value at the `ith` bit of the Bitset.
+
+**Example 1:**
+
+```
+Input
+["Bitset", "fix", "fix", "flip", "all", "unfix", "flip", "one", "unfix", "count", "toString"]
+[[5], [3], [1], [], [], [0], [], [], [0], [], []]
+Output
+[null, null, null, null, false, null, null, true, null, 2, "01010"]
+
+Explanation
+Bitset bs = new Bitset(5); // bitset = "00000".
+bs.fix(3); // the value at idx = 3 is updated to 1, so bitset = "00010".
+bs.fix(1); // the value at idx = 1 is updated to 1, so bitset = "01010".
+bs.flip(); // the value of each bit is flipped, so bitset = "10101".
+bs.all(); // return False, as not all values of the bitset are 1.
+bs.unfix(0); // the value at idx = 0 is updated to 0, so bitset = "00101".
+bs.flip(); // the value of each bit is flipped, so bitset = "11010".
+bs.one(); // return True, as there is at least 1 index with value 1.
+bs.unfix(0); // the value at idx = 0 is updated to 0, so bitset = "01010".
+bs.count(); // return 2, as there are 2 bits with value 1.
+bs.toString(); // return "01010", which is the composition of bitset.
+
+```
+
+**Constraints:**
+
+- `1 <= size <= 10^5`
+- `0 <= idx <= size - 1`
+- At most `10^5` calls will be made **in total** to `fix`, `unfix`, `flip`, `all`, `one`, `count`, and `toString`.
+- At least one call will be made to `all`, `one`, `count`, or `toString`.
+- At most `5` calls will be made to `toString`.
+
+## 题目大意
+
+位集 Bitset 是一种能以紧凑形式存储位的数据结构。
+
+请你实现 Bitset 类。
+
+- Bitset(int size) 用 size 个位初始化 Bitset ，所有位都是 0 。
+- void fix(int idx) 将下标为 idx 的位上的值更新为 1 。如果值已经是 1 ，则不会发生任何改变。
+- void unfix(int idx) 将下标为 idx 的位上的值更新为 0 。如果值已经是 0 ，则不会发生任何改变。
+- void flip() 翻转 Bitset 中每一位上的值。换句话说，所有值为 0 的位将会变成 1 ，反之亦然。
+- boolean all() 检查 Bitset 中 每一位 的值是否都是 1 。如果满足此条件，返回 true ；否则，返回 false 。
+- boolean one() 检查 Bitset 中 是否 至少一位 的值是 1 。如果满足此条件，返回 true ；否则，返回 false 。
+- int count() 返回 Bitset 中值为 1 的位的 总数 。
+- String toString() 返回 Bitset 的当前组成情况。注意，在结果字符串中，第 i 个下标处的字符应该与 Bitset 中的第 i 位一致。
+
+提示：
+
+- 1 <= size <= 10^5
+- 0 <= idx <= size - 1
+- 至多调用 fix、unfix、flip、all、one、count 和 toString 方法 总共 10^5 次
+- 至少调用 all、one、count 或 toString 方法一次
+- 至多调用 toString 方法 5 次
+
+## 解题思路
+
+- 题目中给出了 size 大小，10^5 位二进制。所以不能用 int64 数据类型。
+- 用数组模拟二进制位的一系列操作。flip 操作并不需要每次去翻转，偶数次翻转等于没有翻转，奇数次翻转记下标记，同时更新 1 的个数。这次懒操作在调用 fix 和 unfix 时，更新到原来数组中。
+- fix 和 unfix 根据懒数组中的标记对应更新二进制位。同时更新 1 的个数。
+- all，one，count 都是判断 1 的个数。toString 输出即可。
+
+## 代码
+
+```go
+package leetcode
+
+type Bitset struct {
+ set []byte
+ flipped []byte
+ oneCount int
+ size int
+}
+
+func Constructor(size int) Bitset {
+ set := make([]byte, size)
+ flipped := make([]byte, size)
+ for i := 0; i < size; i++ {
+ set[i] = byte('0')
+ flipped[i] = byte('1')
+ }
+ return Bitset{
+ set: set,
+ flipped: flipped,
+ oneCount: 0,
+ size: size,
+ }
+}
+
+func (this *Bitset) Fix(idx int) {
+ if this.set[idx] == byte('0') {
+ this.set[idx] = byte('1')
+ this.flipped[idx] = byte('0')
+ this.oneCount++
+ }
+}
+
+func (this *Bitset) Unfix(idx int) {
+ if this.set[idx] == byte('1') {
+ this.set[idx] = byte('0')
+ this.flipped[idx] = byte('1')
+ this.oneCount--
+ }
+}
+
+func (this *Bitset) Flip() {
+ this.set, this.flipped = this.flipped, this.set
+ this.oneCount = this.size - this.oneCount
+}
+
+func (this *Bitset) All() bool {
+ return this.oneCount == this.size
+}
+
+func (this *Bitset) One() bool {
+ return this.oneCount != 0
+}
+
+func (this *Bitset) Count() int {
+ return this.oneCount
+}
+
+func (this *Bitset) ToString() string {
+ return string(this.set)
+}
+
+/**
+ * Your Bitset object will be instantiated and called as such:
+ * obj := Constructor(size);
+ * obj.Fix(idx);
+ * obj.Unfix(idx);
+ * obj.Flip();
+ * param_4 := obj.All();
+ * param_5 := obj.One();
+ * param_6 := obj.Count();
+ * param_7 := obj.ToString();
+ */
+```
\ No newline at end of file
diff --git a/leetcode/2167.Minimum-Time-to-Remove-All-Cars-Containing-Illegal-Goods/2167. Minimum Time to Remove All Cars Containing Illegal Goods.go b/leetcode/2167.Minimum-Time-to-Remove-All-Cars-Containing-Illegal-Goods/2167. Minimum Time to Remove All Cars Containing Illegal Goods.go
new file mode 100644
index 000000000..72335ded0
--- /dev/null
+++ b/leetcode/2167.Minimum-Time-to-Remove-All-Cars-Containing-Illegal-Goods/2167. Minimum Time to Remove All Cars Containing Illegal Goods.go
@@ -0,0 +1,48 @@
+package leetcode
+
+import "runtime/debug"
+
+// 解法一 DP
+func minimumTime(s string) int {
+ suffixSum, prefixSum, res := make([]int, len(s)+1), make([]int, len(s)+1), 0
+ for i := len(s) - 1; i >= 0; i-- {
+ if s[i] == '0' {
+ suffixSum[i] = suffixSum[i+1]
+ } else {
+ suffixSum[i] = min(suffixSum[i+1]+2, len(s)-i)
+ }
+ }
+ res = suffixSum[0]
+ if s[0] == '1' {
+ prefixSum[0] = 1
+ }
+ for i := 1; i < len(s); i++ {
+ if s[i] == '0' {
+ prefixSum[i] = prefixSum[i-1]
+ } else {
+ prefixSum[i] = min(prefixSum[i-1]+2, i+1)
+ }
+ res = min(res, prefixSum[i]+suffixSum[i+1])
+ }
+ return res
+}
+
+func init() { debug.SetGCPercent(-1) }
+
+// 解法二 小幅优化时间和空间复杂度
+func minimumTime1(s string) int {
+ res, count := len(s), 0
+ for i := 0; i < len(s); i++ {
+ count = min(count+int(s[i]-'0')*2, i+1)
+ res = min(res, count+len(s)-i-1)
+ }
+ return res
+}
+
+func min(a, b int) int {
+ if a < b {
+ return a
+ } else {
+ return b
+ }
+}
diff --git a/leetcode/2167.Minimum-Time-to-Remove-All-Cars-Containing-Illegal-Goods/2167. Minimum Time to Remove All Cars Containing Illegal Goods_test.go b/leetcode/2167.Minimum-Time-to-Remove-All-Cars-Containing-Illegal-Goods/2167. Minimum Time to Remove All Cars Containing Illegal Goods_test.go
new file mode 100644
index 000000000..c3d59064a
--- /dev/null
+++ b/leetcode/2167.Minimum-Time-to-Remove-All-Cars-Containing-Illegal-Goods/2167. Minimum Time to Remove All Cars Containing Illegal Goods_test.go
@@ -0,0 +1,57 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question2167 struct {
+ para2167
+ ans2167
+}
+
+// para 是参数
+// one 代表第一个参数
+type para2167 struct {
+ s string
+}
+
+// ans 是答案
+// one 代表第一个答案
+type ans2167 struct {
+ one int
+}
+
+func Test_Problem2167(t *testing.T) {
+
+ qs := []question2167{
+
+ {
+ para2167{"1100101"},
+ ans2167{5},
+ },
+
+ {
+ para2167{"0010"},
+ ans2167{2},
+ },
+
+ {
+ para2167{"1100111101"},
+ ans2167{8},
+ },
+
+ {
+ para2167{"1001010101"},
+ ans2167{8},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 2167------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans2167, q.para2167
+ fmt.Printf("【input】:%v 【output】:%v\n", p, minimumTime(p.s))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/2167.Minimum-Time-to-Remove-All-Cars-Containing-Illegal-Goods/README.md b/leetcode/2167.Minimum-Time-to-Remove-All-Cars-Containing-Illegal-Goods/README.md
new file mode 100644
index 000000000..258e5b9a9
--- /dev/null
+++ b/leetcode/2167.Minimum-Time-to-Remove-All-Cars-Containing-Illegal-Goods/README.md
@@ -0,0 +1,145 @@
+# [2167. Minimum Time to Remove All Cars Containing Illegal Goods](https://leetcode.com/problems/minimum-time-to-remove-all-cars-containing-illegal-goods/)
+
+
+## 题目
+
+You are given a **0-indexed** binary string `s` which represents a sequence of train cars. `s[i] = '0'` denotes that the `ith` car does **not** contain illegal goods and `s[i] = '1'` denotes that the `ith` car does contain illegal goods.
+
+As the train conductor, you would like to get rid of all the cars containing illegal goods. You can do any of the following three operations **any** number of times:
+
+1. Remove a train car from the **left** end (i.e., remove `s[0]`) which takes 1 unit of time.
+2. Remove a train car from the **right** end (i.e., remove `s[s.length - 1]`) which takes 1 unit of time.
+3. Remove a train car from **anywhere** in the sequence which takes 2 units of time.
+
+Return *the **minimum** time to remove all the cars containing illegal goods*.
+
+Note that an empty sequence of cars is considered to have no cars containing illegal goods.
+
+**Example 1:**
+
+```
+Input: s = "1100101"
+Output: 5
+Explanation:
+One way to remove all the cars containing illegal goods from the sequence is to
+- remove a car from the left end 2 times. Time taken is 2 * 1 = 2.
+- remove a car from the right end. Time taken is 1.
+- remove the car containing illegal goods found in the middle. Time taken is 2.
+This obtains a total time of 2 + 1 + 2 = 5.
+
+An alternative way is to
+- remove a car from the left end 2 times. Time taken is 2 * 1 = 2.
+- remove a car from the right end 3 times. Time taken is 3 * 1 = 3.
+This also obtains a total time of 2 + 3 = 5.
+
+5 is the minimum time taken to remove all the cars containing illegal goods.
+There are no other ways to remove them with less time.
+
+```
+
+**Example 2:**
+
+```
+Input: s = "0010"
+Output: 2
+Explanation:
+One way to remove all the cars containing illegal goods from the sequence is to
+- remove a car from the left end 3 times. Time taken is 3 * 1 = 3.
+This obtains a total time of 3.
+
+Another way to remove all the cars containing illegal goods from the sequence is to
+- remove the car containing illegal goods found in the middle. Time taken is 2.
+This obtains a total time of 2.
+
+Another way to remove all the cars containing illegal goods from the sequence is to
+- remove a car from the right end 2 times. Time taken is 2 * 1 = 2.
+This obtains a total time of 2.
+
+2 is the minimum time taken to remove all the cars containing illegal goods.
+There are no other ways to remove them with less time.
+```
+
+**Constraints:**
+
+- `1 <= s.length <= 2 * 10^5`
+- `s[i]` is either `'0'` or `'1'`.
+
+## 题目大意
+
+给你一个下标从 0 开始的二进制字符串 s ，表示一个列车车厢序列。s[i] = '0' 表示第 i 节车厢 不 含违禁货物，而 s[i] = '1' 表示第 i 节车厢含违禁货物。
+
+作为列车长，你需要清理掉所有载有违禁货物的车厢。你可以不限次数执行下述三种操作中的任意一个：
+
+1. 从列车 左 端移除一节车厢（即移除 s[0]），用去 1 单位时间。
+2. 从列车 右 端移除一节车厢（即移除 s[s.length - 1]），用去 1 单位时间。
+3. 从列车车厢序列的 任意位置 移除一节车厢，用去 2 单位时间。
+
+返回移除所有载有违禁货物车厢所需要的 最少 单位时间数。注意，空的列车车厢序列视为没有车厢含违禁货物。
+
+## 解题思路
+
+- 这道题求最少单位时间数，最少时间数一定是尽量少使用 2 个单位时间的操作，多用 1 个时间的操作。从列车两头移除车厢，只需要移除和旁边车厢的金属连接处即可。由于列车位于两边，所以与其他车厢的金属连接处只有 1 个，故只需要 1 个单位时间；当车厢在中间，该车厢与两边的车厢有 2 个金属连接处，移除它需要断开与两边车厢的连接。所以需要 2 个单位时间。
+- 断开中间一节车厢以后，列车会被断成 2 部分。2 部分列车分别有 2 个头 2 个尾。举例：`1100111101`，如果把它从第 5 节开始断开，剩下的列车为 `11001 (1)` 和 `1101`。剩下的 1 都位于 2 边，移除他们都只需要 1 个单位时间。那么移除所有违禁品最少时间是 2 * 1 + 1 * 6 = 8。
+- 左半部分，定义 prefixSum[i] 表示移除前 i 节车厢所花费的最少时间。状态转移方程为：
+
+ $prefixSum[i] =\left\{\begin{matrix}prefixSum[i-1],s[i]=0\\ min(prefixSum[i-1]+2, i+1), s[i]=1\end{matrix}\right.$
+
+- 同理，右半部分定义 suffixSum[i] 表示移除后 i 节车厢所花费的最少时间。状态转移方程为：
+
+ $suffixSum[i] =\left\{\begin{matrix} suffixSum[i+1],s[i]=0\\ min(suffixSum[i+1]+2, n-i), s[i]=1\end{matrix}\right.$
+
+- 最后一层循环枚举 prefixSum[i] + suffixSum[i+1] 的最小值即为答案。
+- 这一题在解法一的基础上还可以再简化。当 s[i] = 1 时，prefixSum 和 suffixSum 是两种计算方法。我们可以假设中间断开的部分在 prefixSum 中。于是可以合并上面两个状态转移方程。简化以后的代码见解法二。
+
+## 代码
+
+```go
+package leetcode
+
+import "runtime/debug"
+
+// 解法一 DP
+func minimumTime(s string) int {
+ suffixSum, prefixSum, res := make([]int, len(s)+1), make([]int, len(s)+1), 0
+ for i := len(s) - 1; i >= 0; i-- {
+ if s[i] == '0' {
+ suffixSum[i] = suffixSum[i+1]
+ } else {
+ suffixSum[i] = min(suffixSum[i+1]+2, len(s)-i)
+ }
+ }
+ res = suffixSum[0]
+ if s[0] == '1' {
+ prefixSum[0] = 1
+ }
+ for i := 1; i < len(s); i++ {
+ if s[i] == '0' {
+ prefixSum[i] = prefixSum[i-1]
+ } else {
+ prefixSum[i] = min(prefixSum[i-1]+2, i+1)
+ }
+ res = min(res, prefixSum[i]+suffixSum[i+1])
+ }
+ return res
+}
+
+func init() { debug.SetGCPercent(-1) }
+
+// 解法二 小幅优化时间和空间复杂度
+func minimumTime1(s string) int {
+ res, count := len(s), 0
+ for i := 0; i < len(s); i++ {
+ count = min(count+int(s[i]-'0')*2, i+1)
+ res = min(res, count+len(s)-i-1)
+ }
+ return res
+}
+
+func min(a, b int) int {
+ if a < b {
+ return a
+ } else {
+ return b
+ }
+}
+```
\ No newline at end of file
diff --git a/leetcode/2169.Count-Operations-to-Obtain-Zero/2169. Count Operations to Obtain Zero.go b/leetcode/2169.Count-Operations-to-Obtain-Zero/2169. Count Operations to Obtain Zero.go
new file mode 100644
index 000000000..040ac3705
--- /dev/null
+++ b/leetcode/2169.Count-Operations-to-Obtain-Zero/2169. Count Operations to Obtain Zero.go
@@ -0,0 +1,14 @@
+package leetcode
+
+func countOperations(num1 int, num2 int) int {
+ res := 0
+ for num1 != 0 && num2 != 0 {
+ if num1 >= num2 {
+ num1 -= num2
+ } else {
+ num2 -= num1
+ }
+ res++
+ }
+ return res
+}
diff --git a/leetcode/2169.Count-Operations-to-Obtain-Zero/2169. Count Operations to Obtain Zero_test.go b/leetcode/2169.Count-Operations-to-Obtain-Zero/2169. Count Operations to Obtain Zero_test.go
new file mode 100644
index 000000000..69d21f8a8
--- /dev/null
+++ b/leetcode/2169.Count-Operations-to-Obtain-Zero/2169. Count Operations to Obtain Zero_test.go
@@ -0,0 +1,48 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question2169 struct {
+ para2169
+ ans2169
+}
+
+// para 是参数
+// one 代表第一个参数
+type para2169 struct {
+ num1 int
+ num2 int
+}
+
+// ans 是答案
+// one 代表第一个答案
+type ans2169 struct {
+ one int
+}
+
+func Test_Problem2169(t *testing.T) {
+
+ qs := []question2169{
+
+ {
+ para2169{2, 3},
+ ans2169{3},
+ },
+
+ {
+ para2169{10, 10},
+ ans2169{1},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 2169------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans2169, q.para2169
+ fmt.Printf("【input】:%v 【output】:%v\n", p, countOperations(p.num1, p.num2))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/2169.Count-Operations-to-Obtain-Zero/README.md b/leetcode/2169.Count-Operations-to-Obtain-Zero/README.md
new file mode 100644
index 000000000..10878ea04
--- /dev/null
+++ b/leetcode/2169.Count-Operations-to-Obtain-Zero/README.md
@@ -0,0 +1,73 @@
+# [2169. Count Operations to Obtain Zero](https://leetcode.com/problems/count-operations-to-obtain-zero/)
+
+
+## 题目
+
+You are given two **non-negative** integers `num1` and `num2`.
+
+In one **operation**, if `num1 >= num2`, you must subtract `num2` from `num1`, otherwise subtract `num1` from `num2`.
+
+- For example, if `num1 = 5` and `num2 = 4`, subtract `num2` from `num1`, thus obtaining `num1 = 1` and `num2 = 4`. However, if `num1 = 4` and `num2 = 5`, after one operation, `num1 = 4` and `num2 = 1`.
+
+Return *the **number of operations** required to make either* `num1 = 0` *or* `num2 = 0`.
+
+**Example 1:**
+
+```
+Input: num1 = 2, num2 = 3
+Output: 3
+Explanation:
+- Operation 1: num1 = 2, num2 = 3. Since num1 < num2, we subtract num1 from num2 and get num1 = 2, num2 = 3 - 2 = 1.
+- Operation 2: num1 = 2, num2 = 1. Since num1 > num2, we subtract num2 from num1.
+- Operation 3: num1 = 1, num2 = 1. Since num1 == num2, we subtract num2 from num1.
+Now num1 = 0 and num2 = 1. Since num1 == 0, we do not need to perform any further operations.
+So the total number of operations required is 3.
+
+```
+
+**Example 2:**
+
+```
+Input: num1 = 10, num2 = 10
+Output: 1
+Explanation:
+- Operation 1: num1 = 10, num2 = 10. Since num1 == num2, we subtract num2 from num1 and get num1 = 10 - 10 = 0.
+Now num1 = 0 and num2 = 10. Since num1 == 0, we are done.
+So the total number of operations required is 1.
+
+```
+
+**Constraints:**
+
+- `0 <= num1, num2 <= 10^5`
+
+## 题目大意
+
+给你两个 非负 整数 num1 和 num2 。每一步 操作 中，如果 num1 >= num2 ，你必须用 num1 减 num2 ；否则，你必须用 num2 减 num1 。
+
+- 例如，num1 = 5 且 num2 = 4 ，应该用 num1 减 num2 ，因此，得到 num1 = 1 和 num2 = 4 。然而，如果 num1 = 4且 num2 = 5 ，一步操作后，得到 num1 = 4 和 num2 = 1 。
+
+返回使 num1 = 0 或 num2 = 0 的 操作数 。
+
+## 解题思路
+
+- 简单题，按照题意模拟，每次两个数字相减，便累加操作次数。当某个数字变为 0 时，输出操作次数。
+
+## 代码
+
+```go
+package leetcode
+
+func countOperations(num1 int, num2 int) int {
+ res := 0
+ for num1 != 0 && num2 != 0 {
+ if num1 >= num2 {
+ num1 -= num2
+ } else {
+ num2 -= num1
+ }
+ res++
+ }
+ return res
+}
+```
\ No newline at end of file
diff --git a/leetcode/2170.Minimum-Operations-to-Make-the-Array-Alternating/2170. Minimum Operations to Make the Array Alternating.go b/leetcode/2170.Minimum-Operations-to-Make-the-Array-Alternating/2170. Minimum Operations to Make the Array Alternating.go
new file mode 100644
index 000000000..d5d156ffb
--- /dev/null
+++ b/leetcode/2170.Minimum-Operations-to-Make-the-Array-Alternating/2170. Minimum Operations to Make the Array Alternating.go
@@ -0,0 +1,60 @@
+package leetcode
+
+import (
+ "sort"
+)
+
+type node struct {
+ value int
+ count int
+}
+
+func minimumOperations(nums []int) int {
+ if len(nums) == 1 {
+ return 0
+ }
+ res, odd, even, oddMap, evenMap := 0, []node{}, []node{}, map[int]int{}, map[int]int{}
+
+ for i := 0; i < len(nums); i += 2 {
+ evenMap[nums[i]]++
+ }
+ for k, v := range evenMap {
+ even = append(even, node{value: k, count: v})
+ }
+ sort.Slice(even, func(i, j int) bool {
+ return even[i].count > even[j].count
+ })
+
+ for i := 1; i < len(nums); i += 2 {
+ oddMap[nums[i]]++
+ }
+ for k, v := range oddMap {
+ odd = append(odd, node{value: k, count: v})
+ }
+ sort.Slice(odd, func(i, j int) bool {
+ return odd[i].count > odd[j].count
+ })
+
+ if even[0].value == odd[0].value {
+ if len(even) == 1 && len(odd) != 1 {
+ res = len(nums) - even[0].count - odd[1].count
+ } else if len(odd) == 1 && len(even) != 1 {
+ res = len(nums) - odd[0].count - even[1].count
+ } else if len(odd) == 1 && len(even) == 1 {
+ res = len(nums) / 2
+ } else {
+ // both != 1
+ res = min(len(nums)-odd[0].count-even[1].count, len(nums)-odd[1].count-even[0].count)
+ }
+ } else {
+ res = len(nums) - even[0].count - odd[0].count
+ }
+ return res
+}
+
+func min(a, b int) int {
+ if a > b {
+ return b
+ }
+ return a
+}
diff --git a/leetcode/2170.Minimum-Operations-to-Make-the-Array-Alternating/2170. Minimum Operations to Make the Array Alternating_test.go b/leetcode/2170.Minimum-Operations-to-Make-the-Array-Alternating/2170. Minimum Operations to Make the Array Alternating_test.go
new file mode 100644
index 000000000..c792e89e4
--- /dev/null
+++ b/leetcode/2170.Minimum-Operations-to-Make-the-Array-Alternating/2170. Minimum Operations to Make the Array Alternating_test.go
@@ -0,0 +1,57 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question2170 struct {
+ para2170
+ ans2170
+}
+
+// para 是参数
+// one 代表第一个参数
+type para2170 struct {
+ nums []int
+}
+
+// ans 是答案
+// one 代表第一个答案
+type ans2170 struct {
+ one int
+}
+
+func Test_Problem1(t *testing.T) {
+
+ qs := []question2170{
+
+ {
+ para2170{[]int{1}},
+ ans2170{0},
+ },
+
+ {
+ para2170{[]int{3, 1, 3, 2, 4, 3}},
+ ans2170{3},
+ },
+
+ {
+ para2170{[]int{1, 2, 2, 2, 2}},
+ ans2170{2},
+ },
+
+ {
+ para2170{[]int{69, 91, 47, 74, 75, 94, 22, 100, 43, 50, 82, 47, 40, 51, 90, 27, 98, 85, 47, 14, 55, 82, 52, 9, 65, 90, 86, 45, 52, 52, 95, 40, 85, 3, 46, 77, 16, 59, 32, 22, 41, 87, 89, 78, 59, 78, 34, 26, 71, 9, 82, 68, 80, 74, 100, 6, 10, 53, 84, 80, 7, 87, 3, 82, 26, 26, 14, 37, 26, 58, 96, 73, 41, 2, 79, 43, 56, 74, 30, 71, 6, 100, 72, 93, 83, 40, 28, 79, 24}},
+ ans2170{84},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 2170------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans2170, q.para2170
+ fmt.Printf("【input】:%v 【output】:%v\n", p, minimumOperations(p.nums))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/2170.Minimum-Operations-to-Make-the-Array-Alternating/README.md b/leetcode/2170.Minimum-Operations-to-Make-the-Array-Alternating/README.md
new file mode 100644
index 000000000..305d79ce6
--- /dev/null
+++ b/leetcode/2170.Minimum-Operations-to-Make-the-Array-Alternating/README.md
@@ -0,0 +1,130 @@
+# [2170. Minimum Operations to Make the Array Alternating](https://leetcode.com/problems/minimum-operations-to-make-the-array-alternating/)
+
+
+## 题目
+
+You are given a **0-indexed** array `nums` consisting of `n` positive integers.
+
+The array `nums` is called **alternating** if:
+
+- `nums[i - 2] == nums[i]`, where `2 <= i <= n - 1`.
+- `nums[i - 1] != nums[i]`, where `1 <= i <= n - 1`.
+
+In one **operation**, you can choose an index `i` and **change** `nums[i]` into **any** positive integer.
+
+Return *the **minimum number of operations** required to make the array alternating*.
+
+**Example 1:**
+
+```
+Input: nums = [3,1,3,2,4,3]
+Output: 3
+Explanation:
+One way to make the array alternating is by converting it to [3,1,3,1,3,1].
+The number of operations required in this case is 3.
+It can be proven that it is not possible to make the array alternating in less than 3 operations.
+
+```
+
+**Example 2:**
+
+```
+Input: nums = [1,2,2,2,2]
+Output: 2
+Explanation:
+One way to make the array alternating is by converting it to [1,2,1,2,1].
+The number of operations required in this case is 2.
+Note that the array cannot be converted to [2,2,2,2,2] because in this case nums[0] == nums[1] which violates the conditions of an alternating array.
+
+```
+
+**Constraints:**
+
+- `1 <= nums.length <= 10^5`
+- `1 <= nums[i] <= 10^5`
+
+## 题目大意
+
+给你一个下标从 0 开始的数组 nums ，该数组由 n 个正整数组成。
+
+如果满足下述条件，则数组 nums 是一个 交替数组 ：
+
+- nums[i - 2] == nums[i] ，其中 2 <= i <= n - 1 。
+- nums[i - 1] != nums[i] ，其中 1 <= i <= n - 1 。
+
+在一步 操作 中，你可以选择下标 i 并将 nums[i] 更改 为 任一 正整数。返回使数组变成交替数组的 最少操作数 。
+
+**提示：**
+
+- `1 <= nums.length <= 10^5`
+- `1 <= nums[i] <= 10^5`
+
+## 解题思路
+
+- 题目要求最少操作数，即留下出现频次最多的数字，剩下的数字都替换成这个数字。先将每个数字出现的频次统计出来，然后按照频次从大到小排序。优先选择出现频次高的数字。
+- 有几种“特殊”情况需要处理：当奇数下标的数字频次最大的数字和偶数下标的数字频次最大的数字相同（数字相同，频次不同），这时应选取频次大的数字留下；当数字相同，频次也相同，这时要看奇数下标和偶数下标的数字分别有几个。 如果其中一个只有一种数字，那么另外一组数字则需都变成该组频次第二大的数字，例如奇数下标的数字全是 1，频次是 3，偶数下标的数字是 1，最大频次是 2。第二频次的数字是 9，频次是 1 。那么这种情况下，选择奇数下标的数字 1，和偶数下标数字 9 。将偶数下标不是 9 的数字改变成 9 ；更近一步，如果奇数下标和偶数下标都只有一个数字，频次相同，那么只能改变奇数下标或者偶数下标的所有数字。
+
+## 代码
+
+```go
+package leetcode
+
+import (
+ "sort"
+)
+
+type node struct {
+ value int
+ count int
+}
+
+func minimumOperations(nums []int) int {
+ if len(nums) == 1 {
+ return 0
+ }
+ res, odd, even, oddMap, evenMap := 0, []node{}, []node{}, map[int]int{}, map[int]int{}
+
+ for i := 0; i < len(nums); i += 2 {
+ evenMap[nums[i]]++
+ }
+ for k, v := range evenMap {
+ even = append(even, node{value: k, count: v})
+ }
+ sort.Slice(even, func(i, j int) bool {
+ return even[i].count > even[j].count
+ })
+
+ for i := 1; i < len(nums); i += 2 {
+ oddMap[nums[i]]++
+ }
+ for k, v := range oddMap {
+ odd = append(odd, node{value: k, count: v})
+ }
+ sort.Slice(odd, func(i, j int) bool {
+ return odd[i].count > odd[j].count
+ })
+
+ if even[0].value == odd[0].value {
+ if len(even) == 1 && len(odd) != 1 {
+ res = len(nums) - even[0].count - odd[1].count
+ } else if len(odd) == 1 && len(even) != 1 {
+ res = len(nums) - odd[0].count - even[1].count
+ } else if len(odd) == 1 && len(even) == 1 {
+ res = len(nums) / 2
+ } else {
+ // both != 1
+ res = min(len(nums)-odd[0].count-even[1].count, len(nums)-odd[1].count-even[0].count)
+ }
+ } else {
+ res = len(nums) - even[0].count - odd[0].count
+ }
+ return res
+}
+
+func min(a, b int) int {
+ if a > b {
+ return b
+ }
+ return a
+}
+```
\ No newline at end of file
diff --git a/leetcode/2171.Removing-Minimum-Number-of-Magic-Beans/2171. Removing Minimum Number of Magic Beans.go b/leetcode/2171.Removing-Minimum-Number-of-Magic-Beans/2171. Removing Minimum Number of Magic Beans.go
new file mode 100644
index 000000000..c4032a1d2
--- /dev/null
+++ b/leetcode/2171.Removing-Minimum-Number-of-Magic-Beans/2171. Removing Minimum Number of Magic Beans.go
@@ -0,0 +1,20 @@
+package leetcode
+
+import "sort"
+
+func minimumRemoval(beans []int) int64 {
+ sort.Ints(beans)
+ sum, mx := 0, 0
+ for i, v := range beans {
+ sum += v
+ mx = max(mx, (len(beans)-i)*v)
+ }
+ return int64(sum - mx)
+}
+
+func max(a, b int) int {
+ if b > a {
+ return b
+ }
+ return a
+}
diff --git a/leetcode/2171.Removing-Minimum-Number-of-Magic-Beans/2171. Removing Minimum Number of Magic Beans_test.go b/leetcode/2171.Removing-Minimum-Number-of-Magic-Beans/2171. Removing Minimum Number of Magic Beans_test.go
new file mode 100644
index 000000000..068733524
--- /dev/null
+++ b/leetcode/2171.Removing-Minimum-Number-of-Magic-Beans/2171. Removing Minimum Number of Magic Beans_test.go
@@ -0,0 +1,47 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question2170 struct {
+ para2170
+ ans2170
+}
+
+// para 是参数
+// one 代表第一个参数
+type para2170 struct {
+ beans []int
+}
+
+// ans 是答案
+// one 代表第一个答案
+type ans2170 struct {
+ one int
+}
+
+func Test_Problem1(t *testing.T) {
+
+ qs := []question2170{
+
+ {
+ para2170{[]int{4, 1, 6, 5}},
+ ans2170{4},
+ },
+
+ {
+ para2170{[]int{2, 10, 3, 2}},
+ ans2170{7},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 2170------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans2170, q.para2170
+ fmt.Printf("【input】:%v 【output】:%v\n", p, minimumRemoval(p.beans))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/2171.Removing-Minimum-Number-of-Magic-Beans/README.md b/leetcode/2171.Removing-Minimum-Number-of-Magic-Beans/README.md
new file mode 100644
index 000000000..0234821dc
--- /dev/null
+++ b/leetcode/2171.Removing-Minimum-Number-of-Magic-Beans/README.md
@@ -0,0 +1,90 @@
+# [2171. Removing Minimum Number of Magic Beans](https://leetcode.com/problems/removing-minimum-number-of-magic-beans/)
+
+
+## 题目
+
+You are given an array of **positive** integers `beans`, where each integer represents the number of magic beans found in a particular magic bag.
+
+**Remove** any number of beans (**possibly none**) from each bag such that the number of beans in each remaining **non-empty** bag (still containing **at least one** bean) is **equal**. Once a bean has been removed from a bag, you are **not** allowed to return it to any of the bags.
+
+Return *the **minimum** number of magic beans that you have to remove*.
+
+**Example 1:**
+
+```
+Input: beans = [4,1,6,5]
+Output: 4
+Explanation:
+- We remove 1 bean from the bag with only 1 bean.
+ This results in the remaining bags: [4,0,6,5]
+- Then we remove 2 beans from the bag with 6 beans.
+ This results in the remaining bags: [4,0,4,5]
+- Then we remove 1 bean from the bag with 5 beans.
+ This results in the remaining bags: [4,0,4,4]
+We removed a total of 1 + 2 + 1 = 4 beans to make the remaining non-empty bags have an equal number of beans.
+There are no other solutions that remove 4 beans or fewer.
+
+```
+
+**Example 2:**
+
+```
+Input: beans = [2,10,3,2]
+Output: 7
+Explanation:
+- We remove 2 beans from one of the bags with 2 beans.
+ This results in the remaining bags: [0,10,3,2]
+- Then we remove 2 beans from the other bag with 2 beans.
+ This results in the remaining bags: [0,10,3,0]
+- Then we remove 3 beans from the bag with 3 beans.
+ This results in the remaining bags: [0,10,0,0]
+We removed a total of 2 + 2 + 3 = 7 beans to make the remaining non-empty bags have an equal number of beans.
+There are no other solutions that removes 7 beans or fewer.
+
+```
+
+**Constraints:**
+
+- `1 <= beans.length <= 10^5`
+- `1 <= beans[i] <= 10^5`
+
+## 题目大意
+
+给你一个 正 整数数组 beans ，其中每个整数表示一个袋子里装的魔法豆的数目。
+
+请你从每个袋子中 拿出 一些豆子（也可以 不拿出），使得剩下的 非空 袋子中（即 至少 还有 一颗 魔法豆的袋子）魔法豆的数目 相等 。一旦魔法豆从袋子中取出，你不能将它放到任何其他的袋子中。请你返回你需要拿出魔法豆的 最少数目。
+
+**提示：**
+
+- `1 <= beans.length <= 10^5`
+- `1 <= beans[i] <= 10^5`
+
+## 解题思路
+
+- 这一题没有特别巧妙的方法。最初思路来源于暴力解法。从第一个袋子开始，依次以每个袋子中的豆子为基准，改变其他袋子里面的豆子数，使得其他袋子里面的豆子都和基准袋子中豆子一样多。
+- 如果从下标为 0 扫到下标 n-1 ，这中间会有大量重复计算。有些计算区间和的操作，反复计算了很多遍，导致算法不高效。由于移除豆子数量多少和基准袋豆子数量强相关，所以先排序。如果袋子内豆子数目小于基准袋的豆子，`0 ≤ j < i`，那么这些袋子内的豆子数量会归零。需要移除 `beans[0] + beans[1] + ... + beans[i-1]` 个豆子；如果袋子内豆子数目大于等于基准袋的豆子，`j ≥ i` ，那么这些袋子内的豆子需要调整为 `beans[i]` 个。需要移除 `(beans[i] - beans[i]) + (beans[i+1] - beans[i]) + (beans[i+2] - beans[i]) + ... + (beans[n-1] - beans[i]) = beans[i]+ ... + beans[n-1] - (n-i) * beans[i]` 个豆子。将这 2 种情况综合起来，那么总共需要移除 `sum(beans) - (N - i) * beans[i]` 个豆子。综上，先排序，然后从小到大扫一遍数组，动态维护最少移除豆子的个数即可。
+
+## 代码
+
+```go
+package leetcode
+
+import "sort"
+
+func minimumRemoval(beans []int) int64 {
+ sort.Ints(beans)
+ sum, mx := 0, 0
+ for i, v := range beans {
+ sum += v
+ mx = max(mx, (len(beans)-i)*v)
+ }
+ return int64(sum - mx)
+}
+
+func max(a, b int) int {
+ if b > a {
+ return b
+ }
+ return a
+}
+```
\ No newline at end of file
diff --git a/leetcode/2180.Count-Integers-With-Even-Digit-Sum/2180. Count Integers With Even Digit Sum.go b/leetcode/2180.Count-Integers-With-Even-Digit-Sum/2180. Count Integers With Even Digit Sum.go
new file mode 100644
index 000000000..d942429c6
--- /dev/null
+++ b/leetcode/2180.Count-Integers-With-Even-Digit-Sum/2180. Count Integers With Even Digit Sum.go
@@ -0,0 +1,21 @@
+package leetcode
+
+func countEven(num int) int {
+ count := 0
+ for i := 1; i <= num; i++ {
+ if addSum(i)%2 == 0 {
+ count++
+ }
+ }
+ return count
+}
+
+func addSum(num int) int {
+ sum := 0
+ tmp := num
+ for tmp != 0 {
+ sum += tmp % 10
+ tmp = tmp / 10
+ }
+ return sum
+}
diff --git a/leetcode/2180.Count-Integers-With-Even-Digit-Sum/2180. Count Integers With Even Digit Sum_test.go b/leetcode/2180.Count-Integers-With-Even-Digit-Sum/2180. Count Integers With Even Digit Sum_test.go
new file mode 100644
index 000000000..684e23100
--- /dev/null
+++ b/leetcode/2180.Count-Integers-With-Even-Digit-Sum/2180. Count Integers With Even Digit Sum_test.go
@@ -0,0 +1,46 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question2180 struct {
+ para2180
+ ans2180
+}
+
+// para 是参数
+// one 代表第一个参数
+type para2180 struct {
+ target int
+}
+
+// ans 是答案
+// one 代表第一个答案
+type ans2180 struct {
+ one int
+}
+
+func Test_Problem1(t *testing.T) {
+
+ qs := []question2180{
+ {
+ para2180{4},
+ ans2180{2},
+ },
+
+ {
+ para2180{30},
+ ans2180{14},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 2180------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans2180, q.para2180
+ fmt.Printf("【input】:%v 【output】:%v\n", p, countEven(p.target))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/2180.Count-Integers-With-Even-Digit-Sum/README.md b/leetcode/2180.Count-Integers-With-Even-Digit-Sum/README.md
new file mode 100644
index 000000000..15b2a5410
--- /dev/null
+++ b/leetcode/2180.Count-Integers-With-Even-Digit-Sum/README.md
@@ -0,0 +1,69 @@
+# [2180. Count Integers With Even Digit Sum](https://leetcode.com/problems/count-integers-with-even-digit-sum/)
+
+
+## 题目
+
+Given a positive integer `num`, return *the number of positive integers **less than or equal to*** `num` *whose digit sums are **even***.
+
+The **digit sum** of a positive integer is the sum of all its digits.
+
+**Example 1:**
+
+```
+Input: num = 4
+Output: 2
+Explanation:
+The only integers less than or equal to 4 whose digit sums are even are 2 and 4.
+
+```
+
+**Example 2:**
+
+```
+Input: num = 30
+Output: 14
+Explanation:
+The 14 integers less than or equal to 30 whose digit sums are even are
+2, 4, 6, 8, 11, 13, 15, 17, 19, 20, 22, 24, 26, and 28.
+
+```
+
+**Constraints:**
+
+- `1 <= num <= 1000`
+
+## 题目大意
+
+给你一个正整数 num ，请你统计并返回 小于或等于 num 且各位数字之和为 偶数 的正整数的数目。
+
+正整数的 各位数字之和 是其所有位上的对应数字相加的结果。
+
+## 解题思路
+
+- 简单题。依照题意，计算每个数的各位数字之和，如何和为偶数，则统计结果加一。最后输出统计结果即可。
+
+## 代码
+
+```go
+package leetcode
+
+func countEven(num int) int {
+ count := 0
+ for i := 1; i <= num; i++ {
+ if addSum(i)%2 == 0 {
+ count++
+ }
+ }
+ return count
+}
+
+func addSum(num int) int {
+ sum := 0
+ tmp := num
+ for tmp != 0 {
+ sum += tmp % 10
+ tmp = tmp / 10
+ }
+ return sum
+}
+```
\ No newline at end of file
diff --git a/leetcode/2181.Merge-Nodes-in-Between-Zeros/2181. Merge Nodes in Between Zeros.go b/leetcode/2181.Merge-Nodes-in-Between-Zeros/2181. Merge Nodes in Between Zeros.go
new file mode 100644
index 000000000..be7ef2c6a
--- /dev/null
+++ b/leetcode/2181.Merge-Nodes-in-Between-Zeros/2181. Merge Nodes in Between Zeros.go
@@ -0,0 +1,36 @@
+package leetcode
+
+import (
+ "github.com/halfrost/LeetCode-Go/structures"
+)
+
+// ListNode define
+type ListNode = structures.ListNode
+
+/**
+ * Definition for singly-linked list.
+ * type ListNode struct {
+ * Val int
+ * Next *ListNode
+ * }
+ */
+func mergeNodes(head *ListNode) *ListNode {
+ res := &ListNode{}
+ h := res
+ if head.Next == nil {
+ return &structures.ListNode{}
+ }
+ cur := head
+ sum := 0
+ for cur.Next != nil {
+ if cur.Next.Val != 0 {
+ sum += cur.Next.Val
+ } else {
+ h.Next = &ListNode{Val: sum, Next: nil}
+ h = h.Next
+ sum = 0
+ }
+ cur = cur.Next
+ }
+ return res.Next
+}
diff --git a/leetcode/2181.Merge-Nodes-in-Between-Zeros/2181. Merge Nodes in Between Zeros_test.go b/leetcode/2181.Merge-Nodes-in-Between-Zeros/2181. Merge Nodes in Between Zeros_test.go
new file mode 100644
index 000000000..44a308c12
--- /dev/null
+++ b/leetcode/2181.Merge-Nodes-in-Between-Zeros/2181. Merge Nodes in Between Zeros_test.go
@@ -0,0 +1,67 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+
+ "github.com/halfrost/LeetCode-Go/structures"
+)
+
+type question2181 struct {
+ para2181
+ ans2181
+}
+
+// para 是参数
+// one 代表第一个参数
+type para2181 struct {
+ one []int
+}
+
+// ans 是答案
+// one 代表第一个答案
+type ans2181 struct {
+ one []int
+}
+
+func Test_Problem2181(t *testing.T) {
+
+ qs := []question2181{
+
+ {
+ para2181{[]int{0, 3, 1, 0, 4, 5, 2, 0}},
+ ans2181{[]int{4, 11}},
+ },
+
+ {
+ para2181{[]int{0, 1, 0, 3, 0, 2, 2, 0}},
+ ans2181{[]int{1, 3, 4}},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 2181------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans2181, q.para2181
+ fmt.Printf("【input】:%v 【output】:%v\n", p, structures.List2Ints(mergeNodes(structures.Ints2List(p.one))))
+ }
+ fmt.Printf("\n\n\n")
+}
+
+func removeElements(head *ListNode, val int) *ListNode {
+ if head == nil {
+ return head
+ }
+ newHead := &ListNode{Val: 0, Next: head}
+ pre := newHead
+ cur := head
+ for cur != nil {
+ if cur.Val == val {
+ pre.Next = cur.Next
+ } else {
+ pre = cur
+ }
+ cur = cur.Next
+ }
+ return newHead.Next
+}
diff --git a/leetcode/2181.Merge-Nodes-in-Between-Zeros/README.md b/leetcode/2181.Merge-Nodes-in-Between-Zeros/README.md
new file mode 100644
index 000000000..6aba3609f
--- /dev/null
+++ b/leetcode/2181.Merge-Nodes-in-Between-Zeros/README.md
@@ -0,0 +1,96 @@
+# [2181. Merge Nodes in Between Zeros](https://leetcode.com/problems/merge-nodes-in-between-zeros/)
+
+## 题目
+
+You are given the `head` of a linked list, which contains a series of integers **separated** by `0`'s. The **beginning** and **end** of the linked list will have `Node.val == 0`.
+
+For **every** two consecutive `0`'s, **merge** all the nodes lying in between them into a single node whose value is the **sum** of all the merged nodes. The modified list should not contain any `0`'s.
+
+Return *the* `head` *of the modified linked list*.
+
+**Example 1:**
+
+
+
+```
+Input: head = [0,3,1,0,4,5,2,0]
+Output: [4,11]
+Explanation:
+The above figure represents the given linked list. The modified list contains
+- The sum of the nodes marked in green: 3 + 1 = 4.
+- The sum of the nodes marked in red: 4 + 5 + 2 = 11.
+
+```
+
+**Example 2:**
+
+
+
+```
+Input: head = [0,1,0,3,0,2,2,0]
+Output: [1,3,4]
+Explanation:
+The above figure represents the given linked list. The modified list contains
+- The sum of the nodes marked in green: 1 = 1.
+- The sum of the nodes marked in red: 3 = 3.
+- The sum of the nodes marked in yellow: 2 + 2 = 4.
+
+```
+
+**Constraints:**
+
+- The number of nodes in the list is in the range `[3, 2 * 10^5]`.
+- `0 <= Node.val <= 1000`
+- There are **no** two consecutive nodes with `Node.val == 0`.
+- The **beginning** and **end** of the linked list have `Node.val == 0`.
+
+## 题目大意
+
+给你一个链表的头节点 head ，该链表包含由 0 分隔开的一连串整数。链表的 开端 和 末尾 的节点都满足 Node.val == 0 。对于每两个相邻的 0 ，请你将它们之间的所有节点合并成一个节点，其值是所有已合并节点的值之和。然后将所有 0 移除，修改后的链表不应该含有任何 0 。
+
+返回修改后链表的头节点 head 。
+
+## 解题思路
+
+- 简单题。合并链表中两个值为 0 的节点。从头开始遍历链表，遇到节点值不为 0 的节点便累加；遇到节点值为 0 的节点，将累加值转换成结果链表要输出的节点值，然后继续遍历。
+
+## 代码
+
+```go
+package leetcode
+
+import (
+ "github.com/halfrost/LeetCode-Go/structures"
+)
+
+// ListNode define
+type ListNode = structures.ListNode
+
+/**
+ * Definition for singly-linked list.
+ * type ListNode struct {
+ * Val int
+ * Next *ListNode
+ * }
+ */
+func mergeNodes(head *ListNode) *ListNode {
+ res := &ListNode{}
+ h := res
+ if head.Next == nil {
+ return &structures.ListNode{}
+ }
+ cur := head
+ sum := 0
+ for cur.Next != nil {
+ if cur.Next.Val != 0 {
+ sum += cur.Next.Val
+ } else {
+ h.Next = &ListNode{Val: sum, Next: nil}
+ h = h.Next
+ sum = 0
+ }
+ cur = cur.Next
+ }
+ return res.Next
+}
+```
\ No newline at end of file
diff --git a/leetcode/2182.Construct-String-With-Repeat-Limit/2182. Construct String With Repeat Limit.go b/leetcode/2182.Construct-String-With-Repeat-Limit/2182. Construct String With Repeat Limit.go
new file mode 100644
index 000000000..9baa17c4f
--- /dev/null
+++ b/leetcode/2182.Construct-String-With-Repeat-Limit/2182. Construct String With Repeat Limit.go
@@ -0,0 +1,37 @@
+package leetcode
+
+func repeatLimitedString(s string, repeatLimit int) string {
+ cnt := make([]int, 26)
+ for _, c := range s {
+ cnt[int(c-'a')]++
+ }
+ var ns []byte
+ for i := 25; i >= 0; {
+ k := i - 1
+ for cnt[i] > 0 {
+ for j := 0; j < min(cnt[i], repeatLimit); j++ {
+ ns = append(ns, byte(i)+'a')
+ }
+ cnt[i] -= repeatLimit
+ if cnt[i] > 0 {
+ for ; k >= 0 && cnt[k] == 0; k-- {
+ }
+ if k < 0 {
+ break
+ } else {
+ ns = append(ns, byte(k)+'a')
+ cnt[k]--
+ }
+ }
+ }
+ i = k
+ }
+ return string(ns)
+}
+func min(a, b int) int {
+ if a < b {
+ return a
+ } else {
+ return b
+ }
+}
diff --git a/leetcode/2182.Construct-String-With-Repeat-Limit/2182. Construct String With Repeat Limit_test.go b/leetcode/2182.Construct-String-With-Repeat-Limit/2182. Construct String With Repeat Limit_test.go
new file mode 100644
index 000000000..ac01fb982
--- /dev/null
+++ b/leetcode/2182.Construct-String-With-Repeat-Limit/2182. Construct String With Repeat Limit_test.go
@@ -0,0 +1,48 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question2182 struct {
+ para2182
+ ans2182
+}
+
+// para 是参数
+// one 代表第一个参数
+type para2182 struct {
+ one string
+ limit int
+}
+
+// ans 是答案
+// one 代表第一个答案
+type ans2182 struct {
+ one string
+}
+
+func Test_Problem2182(t *testing.T) {
+
+ qs := []question2182{
+
+ {
+ para2182{"cczazcc", 3},
+ ans2182{"zzcccac"},
+ },
+
+ {
+ para2182{"aababab", 2},
+ ans2182{"bbabaa"},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 2182------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans2182, q.para2182
+ fmt.Printf("【input】:%v 【output】:%v\n", p, repeatLimitedString(p.one, p.limit))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/2182.Construct-String-With-Repeat-Limit/README.md b/leetcode/2182.Construct-String-With-Repeat-Limit/README.md
new file mode 100644
index 000000000..68500ed18
--- /dev/null
+++ b/leetcode/2182.Construct-String-With-Repeat-Limit/README.md
@@ -0,0 +1,98 @@
+# [2182. Construct String With Repeat Limit](https://leetcode.com/problems/construct-string-with-repeat-limit/)
+
+
+## 题目
+
+You are given a string `s` and an integer `repeatLimit`. Construct a new string `repeatLimitedString` using the characters of `s` such that no letter appears **more than** `repeatLimit` times **in a row**. You do **not** have to use all characters from `s`.
+
+Return *the **lexicographically largest*** `repeatLimitedString` *possible*.
+
+A string `a` is **lexicographically larger** than a string `b` if in the first position where `a` and `b` differ, string `a` has a letter that appears later in the alphabet than the corresponding letter in `b`. If the first `min(a.length, b.length)` characters do not differ, then the longer string is the lexicographically larger one.
+
+**Example 1:**
+
+```
+Input: s = "cczazcc", repeatLimit = 3
+Output: "zzcccac"
+Explanation: We use all of the characters from s to construct the repeatLimitedString "zzcccac".
+The letter 'a' appears at most 1 time in a row.
+The letter 'c' appears at most 3 times in a row.
+The letter 'z' appears at most 2 times in a row.
+Hence, no letter appears more than repeatLimit times in a row and the string is a valid repeatLimitedString.
+The string is the lexicographically largest repeatLimitedString possible so we return "zzcccac".
+Note that the string "zzcccca" is lexicographically larger but the letter 'c' appears more than 3 times in a row, so it is not a valid repeatLimitedString.
+
+```
+
+**Example 2:**
+
+```
+Input: s = "aababab", repeatLimit = 2
+Output: "bbabaa"
+Explanation: We use only some of the characters from s to construct the repeatLimitedString "bbabaa".
+The letter 'a' appears at most 2 times in a row.
+The letter 'b' appears at most 2 times in a row.
+Hence, no letter appears more than repeatLimit times in a row and the string is a valid repeatLimitedString.
+The string is the lexicographically largest repeatLimitedString possible so we return "bbabaa".
+Note that the string "bbabaaa" is lexicographically larger but the letter 'a' appears more than 2 times in a row, so it is not a valid repeatLimitedString.
+
+```
+
+**Constraints:**
+
+- `1 <= repeatLimit <= s.length <= 10^5`
+- `s` consists of lowercase English letters.
+
+## 题目大意
+
+给你一个字符串 s 和一个整数 repeatLimit ，用 s 中的字符构造一个新字符串 repeatLimitedString ，使任何字母 连续 出现的次数都不超过 repeatLimit 次。你不必使用 s 中的全部字符。
+
+返回 字典序最大的 repeatLimitedString 。
+
+如果在字符串 a 和 b 不同的第一个位置，字符串 a 中的字母在字母表中出现时间比字符串 b 对应的字母晚，则认为字符串 a 比字符串 b 字典序更大 。如果字符串中前 min(a.length, b.length) 个字符都相同，那么较长的字符串字典序更大。
+
+## 解题思路
+
+- 利用贪心的思想，由于题意要求返回字典序最大的字符串，所以先从字典序最大的字母开始选起。然后选择当前字典序最大的字母个数和 limit 的最小值。如果当前字典序最大的字母比较多，多于 limit，不能一直选择它。选完 limit 个以后，需要选一个字典序次大的字母，选完这个字母以后再次选择字典序最大的字母。因为 limit 限制字母不能连续多于 limit 个。如此循环，直到所有的字母都选完。这样的策略排列出来的字母串为最大字典序。
+
+## 代码
+
+```go
+package leetcode
+
+func repeatLimitedString(s string, repeatLimit int) string {
+ cnt := make([]int, 26)
+ for _, c := range s {
+ cnt[int(c-'a')]++
+ }
+ var ns []byte
+ for i := 25; i >= 0; {
+ k := i - 1
+ for cnt[i] > 0 {
+ for j := 0; j < min(cnt[i], repeatLimit); j++ {
+ ns = append(ns, byte(i)+'a')
+ }
+ cnt[i] -= repeatLimit
+ if cnt[i] > 0 {
+ for ; k >= 0 && cnt[k] == 0; k-- {
+ }
+ if k < 0 {
+ break
+ } else {
+ ns = append(ns, byte(k)+'a')
+ cnt[k]--
+ }
+ }
+ }
+ i = k
+ }
+ return string(ns)
+}
+func min(a, b int) int {
+ if a < b {
+ return a
+ } else {
+ return b
+ }
+}
+```
\ No newline at end of file
diff --git a/leetcode/2183.Count-Array-Pairs-Divisible-by-K/2183. Count Array Pairs Divisible by K.go b/leetcode/2183.Count-Array-Pairs-Divisible-by-K/2183. Count Array Pairs Divisible by K.go
new file mode 100644
index 000000000..62c22397f
--- /dev/null
+++ b/leetcode/2183.Count-Array-Pairs-Divisible-by-K/2183. Count Array Pairs Divisible by K.go
@@ -0,0 +1,32 @@
+package leetcode
+
+import "math"
+
+func countPairs(nums []int, k int) int64 {
+ n := int(math.Sqrt(float64(k)))
+ gcds, res := make(map[int]int, n), 0
+ for _, num := range nums {
+ gcds[gcd(num, k)]++
+ }
+
+ for a, n1 := range gcds {
+ for b, n2 := range gcds {
+ if a > b || (a*b)%k != 0 {
+ continue
+ }
+ if a != b {
+ res += n1 * n2
+ } else { // a == b
+ res += n1 * (n1 - 1) / 2
+ }
+ }
+ }
+ return int64(res)
+}
+
+func gcd(a, b int) int {
+ for a%b != 0 {
+ a, b = b, a%b
+ }
+ return b
+}
diff --git a/leetcode/2183.Count-Array-Pairs-Divisible-by-K/2183. Count Array Pairs Divisible by K_test.go b/leetcode/2183.Count-Array-Pairs-Divisible-by-K/2183. Count Array Pairs Divisible by K_test.go
new file mode 100644
index 000000000..487dd70cd
--- /dev/null
+++ b/leetcode/2183.Count-Array-Pairs-Divisible-by-K/2183. Count Array Pairs Divisible by K_test.go
@@ -0,0 +1,48 @@
+package leetcode
+
+import (
+ "fmt"
+ "testing"
+)
+
+type question2182 struct {
+ para2182
+ ans2182
+}
+
+// para 是参数
+// one 代表第一个参数
+type para2182 struct {
+ nums []int
+ k int
+}
+
+// ans 是答案
+// one 代表第一个答案
+type ans2182 struct {
+ one int64
+}
+
+func Test_Problem2182(t *testing.T) {
+
+ qs := []question2182{
+
+ {
+ para2182{[]int{1, 2, 3, 4, 5}, 2},
+ ans2182{7},
+ },
+
+ {
+ para2182{[]int{1, 2, 3, 4}, 5},
+ ans2182{0},
+ },
+ }
+
+ fmt.Printf("------------------------Leetcode Problem 2183------------------------\n")
+
+ for _, q := range qs {
+ _, p := q.ans2182, q.para2182
+ fmt.Printf("【input】:%v 【output】:%v\n", p, countPairs(p.nums, p.k))
+ }
+ fmt.Printf("\n\n\n")
+}
diff --git a/leetcode/2183.Count-Array-Pairs-Divisible-by-K/README.md b/leetcode/2183.Count-Array-Pairs-Divisible-by-K/README.md
new file mode 100644
index 000000000..f7bec80a3
--- /dev/null
+++ b/leetcode/2183.Count-Array-Pairs-Divisible-by-K/README.md
@@ -0,0 +1,85 @@
+# [2183. Count Array Pairs Divisible by K](https://leetcode.com/problems/count-array-pairs-divisible-by-k/)
+
+
+## 题目
+
+Given a **0-indexed** integer array `nums` of length `n` and an integer `k`, return *the **number of pairs*** `(i, j)` *such that:*
+
+- `0 <= i < j <= n - 1` *and*
+- `nums[i] * nums[j]` *is divisible by* `k`.
+
+**Example 1:**
+
+```
+Input: nums = [1,2,3,4,5], k = 2
+Output: 7
+Explanation:
+The 7 pairs of indices whose corresponding products are divisible by 2 are
+(0, 1), (0, 3), (1, 2), (1, 3), (1, 4), (2, 3), and (3, 4).
+Their products are 2, 4, 6, 8, 10, 12, and 20 respectively.
+Other pairs such as (0, 2) and (2, 4) have products 3 and 15 respectively, which are not divisible by 2.
+
+```
+
+**Example 2:**
+
+```
+Input: nums = [1,2,3,4], k = 5
+Output: 0
+Explanation: There does not exist any pair of indices whose corresponding product is divisible by 5.
+
+```
+
+**Constraints:**
+
+- `1 <= nums.length <= 10^5`
+- `1 <= nums[i], k <= 10^5`
+
+## 题目大意
+
+给你一个下标从 0 开始、长度为 n 的整数数组 nums 和一个整数 k ，返回满足下述条件的下标对 (i, j) 的数目：
+
+- 0 <= i < j <= n - 1 且
+- nums[i] * nums[j] 能被 k 整除。
+
+## 解题思路
+
+- 先找出 num 中每个元素与 k 的最大公约数。并统计这些公约数出现的频次，将数据保存在 map 中。在计算过程中，循环可以只需算到 ${O(\sqrt {k})}$ , 因为每一个 gcd[i] 一定是 k 的因数，而它出现的频次不会超过 ${O(\sqrt {k})}$。简单证明一下：假设因子 v 和 k/v 这两个因数为 k 的因子。v 和 k/v 必至少有 1 个小于等于 $\sqrt {k}$。所以 k 的因子也不会超过 2 * $\sqrt {k}$ = ${O(\sqrt {k})}$ 个。
+- 算出上述的 map 以后，2 层循环暴力遍历 key 值，如果 a * b 能被 k 整除，并且 a 和 b 不相同，那么 a 和 b 对应的 value 值相乘即为满足条件的下标对数；如果 a 和 b 相同，那么下标对数为 $C_{n}^{2}$。最后累加结果即可。
+
+## 代码
+
+```go
+package leetcode
+
+import "math"
+
+func countPairs(nums []int, k int) int64 {
+ n := int(math.Sqrt(float64(k)))
+ gcds, res := make(map[int]int, n), 0
+ for _, num := range nums {
+ gcds[gcd(num, k)]++
+ }
+
+ for a, n1 := range gcds {
+ for b, n2 := range gcds {
+ if a > b || (a*b)%k != 0 {
+ continue
+ }
+ if a != b {
+ res += n1 * n2
+ } else { // a == b
+ res += n1 * (n1 - 1) / 2
+ }
+ }
+ }
+ return int64(res)
+}
+
+func gcd(a, b int) int {
+ for a%b != 0 {
+ a, b = b, a%b
+ }
+ return b
+}
+```
\ No newline at end of file
diff --git a/leetcode/9990377.Combination-Sum-IV/377. Combination Sum IV.go b/leetcode/9990377.Combination-Sum-IV/377. Combination Sum IV.go
deleted file mode 100644
index 6d99c99ba..000000000
--- a/leetcode/9990377.Combination-Sum-IV/377. Combination Sum IV.go
+++ /dev/null
@@ -1,24 +0,0 @@
-package leetcode
-
-func combinationSum4(nums []int, target int) int {
- if len(nums) == 0 {
- return 0
- }
- c, res := []int{}, 0
- findcombinationSum4(nums, target, 0, c, &res)
- return res
-}
-
-func findcombinationSum4(nums []int, target, index int, c []int, res *int) {
- if target <= 0 {
- if target == 0 {
- *res++
- }
- return
- }
- for i := 0; i < len(nums); i++ {
- c = append(c, nums[i])
- findcombinationSum4(nums, target-nums[i], i, c, res)
- c = c[:len(c)-1]
- }
-}
diff --git a/note/time_complexity.md b/note/time_complexity.md
new file mode 100644
index 000000000..174aad59f
--- /dev/null
+++ b/note/time_complexity.md
@@ -0,0 +1,127 @@
+# 时间复杂度和空间复杂度
+
+
+## 一. 时间复杂度数据规模
+
+1s 内能解决问题的数据规模：10^6 ~ 10^7
+
+- O(n^2) 算法可以处理 10^4 级别的数据规模(保守估计，处理 1000 级别的问题肯定没问题)
+- O(n) 算法可以处理 10^8 级别的数据规模(保守估计，处理 10^7 级别的问题肯定没问题)
+- O(nlog n) 算法可以处理 10^7 级别的数据规模(保守估计，处理 10^6 级别的问题肯定没问题)
+
+| | 数据规模|时间复杂度 | 算法举例|
+|:------:|:------:|:------:|:------:|
+|1|10|O(n!)|permutation 排列|
+|2|20~30|O(2^n)|combination 组合|
+|3|50|O(n^4)|DFS 搜索、DP 动态规划|
+|4|100|O(n^3)|任意两点最短路径、DP 动态规划|
+|5|1000|O(n^2)|稠密图、DP 动态规划|
+|6|10^6|O(nlog n)|排序，堆，递归与分治|
+|7|10^7|O(n)|DP 动态规划、图遍历、拓扑排序、树遍历|
+|8|10^9|O(sqrt(n))|筛素数、求平方根|
+|9|10^10|O(log n)|二分搜索|
+|10|+∞|O(1)|数学相关算法|
+|----------------|----------------|------------------------------------------------------------------|--------------------------------|
+
+
+一些具有迷惑性的例子：
+
+```c
+void hello (int n){
+
+ for( int sz = 1 ; sz < n ; sz += sz)
+ for( int i = 1 ; i < n ; i ++)
+ cout << "Hello" << endl;
+}
+```
+
+上面这段代码的时间复杂度是 O(nlog n) 而不是 O(n^2)
+
+```c
+bool isPrime (int n){
+
+ for( int x = 2 ; x * x <= n ; x ++ )
+ if( n % x == 0)
+ return false;
+ return true;
+}
+```
+
+上面这段代码的时间复杂度是 O(sqrt(n)) 而不是 O(n)。
+
+再举一个例子，有一个字符串数组，将数组中的每一个字符串按照字母序排序，之后再将整个字符串数组按照字典序排序。两步操作的整体时间复杂度是多少呢？
+
+如果回答是 O(n*nlog n + nlog n) = O(n^2log n)，这个答案是错误的。字符串的长度和数组的长度是没有关系的，所以这两个变量应该单独计算。假设最长的字符串长度为 s，数组中有 n 个字符串。对每个字符串排序的时间复杂度是 O(slog s)，将数组中每个字符串都按照字母序排序的时间复杂度是 O(n * slog s)。
+
+将整个字符串数组按照字典序排序的时间复杂度是 O(s * nlog n)。排序算法中的 O(nlog n) 是比较的次数，由于比较的是整型数字，所以每次比较是 O(1)。但是字符串按照字典序比较，时间复杂度是 O(s)。所以字符串数组按照字典序排序的时间复杂度是 O(s * nlog n)。所以整体复杂度是 O(n * slog s) + O(s * nlog n) = O(n\*slog s + s\*nlogn) = O(n\*s\*(log s + log n))
+
+## 二. 空间复杂度
+
+递归调用是有空间代价的，递归算法需要保存递归栈信息，所以花费的空间复杂度会比非递归算法要高。
+
+```c
+int sum( int n ){
+ assert( n >= 0 )
+ int ret = 0;
+ for ( int i = 0 ; i <= n ; i++)
+ ret += i;
+ return ret;
+}
+```
+
+上面算法的时间复杂度为 O(n)，空间复杂度 O(1)。
+
+```c
+int sum( int n ){
+ assert( n >= 0 )
+ if ( n == 0 )
+ return 0;
+ return n + sum( n - 1);
+}
+```
+
+上面算法的时间复杂度为 O(n)，空间复杂度 O(n)。
+
+## 三. 递归的时间复杂度
+
+### 只有一次递归调用
+
+如果递归函数中，只进行了一次递归调用，且递归深度为 depth，在每个递归函数中，时间复杂度为 T，那么总体的时间复杂度为 O(T * depth)
+
+举个例子：
+
+```c
+int binarySearch(int arr[], int l, int r, int target){
+ if( l > r)
+ return -1;
+ int mid = l + (r-l)/2;//防溢出
+ if(arr[mid] == target)
+ return mid;
+ else if (arr[mid]>target)
+ return binarySearch(arr,l,mid-1,target);
+ else
+ return binarySearch(arr,mid+1,r,target);
+}
+
+```
+
+在二分查找的递归实现中，只递归调用了自身。递归深度是 log n ，每次递归里面的复杂度是 O(1) 的，所以二分查找的递归实现的时间复杂度为 O(log n) 的。
+
+
+### 只有多次递归调用
+
+针对多次递归调用的情况，就需要看它的计算调用的次数了。通常可以画一颗递归树来看。举例：
+
+```c
+int f(int n){
+ assert( n >= 0 );
+ if( n ==0 )
+ return 1;
+ return f( n - 1 ) + f ( n - 1 );
+
+```
+
+上述这次递归调用的次数为 2^0^ + 2^1^ + 2^2^ + …… + 2^n^ = 2^n+1^ - 1 = O(2^n)
+
+
+> 关于更加复杂的递归的复杂度分析，请参考，主定理。主定理中针对各种复杂情况都给出了正确的结论。
diff --git "a/note/\346\227\266\351\227\264\345\244\215\346\235\202\345\272\246.md" "b/note/\346\227\266\351\227\264\345\244\215\346\235\202\345\272\246.md"
deleted file mode 100644
index 4dd545e18..000000000
--- "a/note/\346\227\266\351\227\264\345\244\215\346\235\202\345\272\246.md"
+++ /dev/null
@@ -1,118 +0,0 @@
-# 时间复杂度和空间复杂度
-
-
-## 一. 时间复杂度数据规模
-
-1s 内能解决问题的数据规模：
-
-- O(n^2) 算法可以处理 10^4 级别的数据规模(保守估计，处理 1000 级别的问题肯定没问题)
-- O(n) 算法可以处理 10^8 级别的数据规模(保守估计，处理 10^7 级别的问题肯定没问题)
-- O(nlog n) 算法可以处理 10^7 级别的数据规模(保守估计，处理 10^6 级别的问题肯定没问题)
-
-一些具有迷惑性的例子：
-
-```c
-void hello (int n){
-
- for( int sz = 1 ; sz < n ; sz += sz)
- for( int i = 1 ; i < n ; i ++)
- cout << "Hello" << endl;
-}
-```
-
-上面这段代码的时间复杂度是 O(nlog n) 而不是 O(n^2)
-
-```c
-bool isPrime (int n){
-
- for( int x = 2 ; x * x <= n ; x ++ )
- if( n % x == 0)
- return false;
- return true;
-}
-```
-
-上面这段代码的时间复杂度是 O(sqrt(n)) 而不是 O(n)
-
-再举一个例子，有一个字符串数组，将数组中的每一个字符串按照字母序排序，之后再降整个字符串数组按照字典序排序。两步操作的整体时间复杂度是多少呢？
-
-如果回答是 O(n*nlog n + nlog n) = O(n^2log n)，这个答案是错误的。
-
-字符串的长度和数组的长度是没有关系的，所以这两个变量应该单独计算。
-
-假设最长的字符串长度为 s，数组中有 n 个字符串。对每个字符串排序的时间复杂度是 O(slog s)，将数组中每个字符串都按照字母序排序的时间复杂度是 O(n * slog s)。
-
-将整个字符串数组按照字典序排序的时间复杂度是 O(s * nlog n)。排序算法中的 O(nlog n) 是比较的次数，由于比较的是整型数字，所以每次比较是 O(1)。但是字符串按照字典序比较，时间复杂度是 O(s)。所以字符串数组按照字典序排序的时间复杂度是 O(s * nlog n)
-
-所以整体复杂度是 O(n * slog s) + O(s * nlog n) = O(n\*slog s + s\*nlogn) = O(n\*s\*(log s + log n))
-
-## 二. 空间复杂度
-
-递归调用是有空间代价的，递归算法需要保存递归栈信息，所以花费的空间复杂度会比非递归算法要高。
-
-```c
-int sum( int n ){
- assert( n >= 0 )
- int ret = 0;
- for ( int i = 0 ; i <= n ; i++)
- ret += i;
- return ret;
-}
-```
-
-上面算法的时间复杂度为 O(n)，空间复杂度 O(1)。
-
-```c
-int sum( int n ){
- assert( n >= 0 )
- if ( n == 0 )
- return 0;
- return n + sum( n - 1);
-}
-```
-
-上面算法的时间复杂度为 O(n)，空间复杂度 O(n)。
-
-## 三. 递归的时间复杂度
-
-### 只有一次递归调用
-
-如果递归函数中，只进行了一次递归调用，且递归深度为 depth，在每个递归函数中，时间复杂度为 T，那么总体的时间复杂度为 O(T * depth)
-
-举个例子：
-
-```c
-int binarySearch(int arr[], int l, int r, int target){
- if( l > r)
- return -1;
- int mid = l + (r-l)/2;//防溢出
- if(arr[mid] == target)
- return mid;
- else if (arr[mid]>target)
- return binarySearch(arr,l,mid-1,target);
- eles
- return binarySearch(arr,mid+1,r,target);
-}
-
-```
-
-在二分查找的递归实现中，只递归调用了自身。递归深度是 log n ，每次递归里面的复杂度是 O(1) 的，所以二分查找的递归实现的时间复杂度为 O(log n) 的。
-
-
-### 只有多次递归调用
-
-针对多次递归调用的情况，就需要看它的计算调用的次数了。通常可以画一颗递归树来看。举例：
-
-```c
-int f(int n){
- assert( n >= 0 );
- if( n ==0 )
- return 1;
- return f( n - 1 ) + f ( n - 1 );
-
-```
-
-上述这次递归调用的次数为 2^0^ + 2^1^ + 2^2^ + …… + 2^n^ = 2^n+1^ - 1 = O(2^n)
-
-
-> 关于更加复杂的递归的复杂度分析，请参考，主定理。主定理中针对各种复杂情况都给出了正确的结论。
\ No newline at end of file
diff --git a/structures/Heap.go b/structures/Heap.go
index b8881fb81..2910773b4 100644
--- a/structures/Heap.go
+++ b/structures/Heap.go
@@ -1,6 +1,6 @@
package structures
-// intHeap 实现了 heap 的接口
+// intHeap 实现了最小堆 heap 的接口
type intHeap []int
func (h intHeap) Len() int {
diff --git a/structures/Heap_test.go b/structures/Heap_test.go
index 8e6a30c40..af8291f52 100644
--- a/structures/Heap_test.go
+++ b/structures/Heap_test.go
@@ -20,7 +20,7 @@ func Test_intHeap(t *testing.T) {
begin, end := 0, 10
for i := begin; i < end; i++ {
heap.Push(ih, i)
- ast.Equal(0, (*ih)[0], "插入 %d 后的最小值却是 %d，ih=%v", i, (*ih)[0], (*ih))
+ ast.Equal(0, (*ih)[0], "插入 %d 后的最小值却是 %d, ih=%v", i, (*ih)[0], (*ih))
}
for i := begin; i < end; i++ {
diff --git a/structures/TreeNode.go b/structures/TreeNode.go
index f6edb9c4b..99060be17 100644
--- a/structures/TreeNode.go
+++ b/structures/TreeNode.go
@@ -2,6 +2,7 @@ package structures
import (
"fmt"
+ "strconv"
)
// TreeNode is tree's node
@@ -218,7 +219,7 @@ func Tree2ints(tn *TreeNode) []int {
return res[:i]
}
-// T2s convert *TreeNode to []int
+// T2s converts *TreeNode to []int
func T2s(head *TreeNode, array *[]int) {
fmt.Printf("运行到这里了 head = %v array = %v\n", head, array)
// fmt.Printf("****array = %v\n", array)
@@ -231,3 +232,83 @@ func T2s(head *TreeNode, array *[]int) {
T2s(head.Right, array)
}
}
+
+// Strings2TreeNode converts []string to *TreeNode
+func Strings2TreeNode(strs []string) *TreeNode {
+ n := len(strs)
+ if n == 0 {
+ return nil
+ }
+ x, _ := strconv.Atoi(strs[0])
+ root := &TreeNode{Val: x}
+ queue := make([]*TreeNode, 1, n<<1)
+ queue[0] = root
+ i := 1
+ for i < n {
+ node := queue[0]
+ queue = queue[1:]
+ if i < n && strs[i] != "null" {
+ x, _ = strconv.Atoi(strs[i])
+ node.Left = &TreeNode{Val: x}
+ queue = append(queue, node.Left)
+ }
+ i++
+ if i < n && strs[i] != "null" {
+ x, _ = strconv.Atoi(strs[i])
+ node.Right = &TreeNode{Val: x}
+ queue = append(queue, node.Right)
+ }
+ i++
+ }
+ return root
+}
+
+// Tree2LevelOrderStrings converts *TreeNode into []string by level order traversal.
+func Tree2LevelOrderStrings(root *TreeNode) []string {
+ var ans []string
+ if root == nil {
+ return ans
+ }
+ queue := []*TreeNode{root}
+ var level int
+ for level = 0; len(queue) > 0; level++ {
+ size := len(queue)
+ for i := 0; i < size; i++ {
+ node := queue[i]
+ if node == nil {
+ ans = append(ans, "null")
+ } else {
+ ans = append(ans, strconv.Itoa(node.Val))
+ if node.Left != nil || node.Right != nil {
+ queue = append(queue, node.Left, node.Right)
+ }
+ }
+ }
+ queue = queue[size:]
+ }
+ level--
+ return ans
+}
+
+// Tree2PreOrderStrings converts *TreeNode into []string by preorder traversal.
+func Tree2PreOrderStrings(root *TreeNode) []string {
+ var ans []string
+ if root == nil {
+ return ans
+ }
+ stack := []*TreeNode{root}
+ node := root
+ for len(stack) > 0 {
+ if node == nil {
+ ans = append(ans, "null")
+ }
+ for node != nil {
+ ans = append(ans, strconv.Itoa(node.Val))
+ stack = append(stack, node)
+ node = node.Left
+ }
+ node = stack[len(stack)-1].Right
+ stack = stack[:len(stack)-1]
+ }
+ return ans
+}
diff --git a/structures/go.mod b/structures/go.mod
new file mode 100644
index 000000000..53c9843a0
--- /dev/null
+++ b/structures/go.mod
@@ -0,0 +1,11 @@
+module github.com/halfrost/LeetCode-Go/structures
+
+go 1.19
+
+require github.com/stretchr/testify v1.8.0
+
+require (
+ github.com/davecgh/go-spew v1.1.1 // indirect
+ github.com/pmezard/go-difflib v1.0.0 // indirect
+ gopkg.in/yaml.v3 v3.0.1 // indirect
+)
diff --git a/structures/go.sum b/structures/go.sum
new file mode 100644
index 000000000..51648299d
--- /dev/null
+++ b/structures/go.sum
@@ -0,0 +1,15 @@
+github.com/davecgh/go-spew v1.1.0/go.mod h1:J7Y8YcW2NihsgmVo/mv3lAwl/skON4iLHjSsI+c5H38=
+github.com/davecgh/go-spew v1.1.1 h1:vj9j/u1bqnvCEfJOwUhtlOARqs3+rkHYY13jYWTU97c=
+github.com/davecgh/go-spew v1.1.1/go.mod h1:J7Y8YcW2NihsgmVo/mv3lAwl/skON4iLHjSsI+c5H38=
+github.com/pmezard/go-difflib v1.0.0 h1:4DBwDE0NGyQoBHbLQYPwSUPoCMWR5BEzIk/f1lZbAQM=
+github.com/pmezard/go-difflib v1.0.0/go.mod h1:iKH77koFhYxTK1pcRnkKkqfTogsbg7gZNVY4sRDYZ/4=
+github.com/stretchr/objx v0.1.0/go.mod h1:HFkY916IF+rwdDfMAkV7OtwuqBVzrE8GR6GFx+wExME=
+github.com/stretchr/objx v0.4.0/go.mod h1:YvHI0jy2hoMjB+UWwv71VJQ9isScKT/TqJzVSSt89Yw=
+github.com/stretchr/testify v1.7.1/go.mod h1:6Fq8oRcR53rry900zMqJjRRixrwX3KX962/h/Wwjteg=
+github.com/stretchr/testify v1.8.0 h1:pSgiaMZlXftHpm5L7V1+rVB+AZJydKsMxsQBIJw4PKk=
+github.com/stretchr/testify v1.8.0/go.mod h1:yNjHg4UonilssWZ8iaSj1OCr/vHnekPRkoO+kdMU+MU=
+gopkg.in/check.v1 v0.0.0-20161208181325-20d25e280405 h1:yhCVgyC4o1eVCa2tZl7eS0r+SDo693bJlVdllGtEeKM=
+gopkg.in/check.v1 v0.0.0-20161208181325-20d25e280405/go.mod h1:Co6ibVJAznAaIkqp8huTwlJQCZ016jof/cbN4VW5Yz0=
+gopkg.in/yaml.v3 v3.0.0-20200313102051-9f266ea9e77c/go.mod h1:K4uyk7z7BCEPqu6E+C64Yfv1cQ7kz7rIZviUmN+EgEM=
+gopkg.in/yaml.v3 v3.0.1 h1:fxVm/GzAzEWqLHuvctI91KS9hhNmmWOoWu0XTYJS7CA=
+gopkg.in/yaml.v3 v3.0.1/go.mod h1:K4uyk7z7BCEPqu6E+C64Yfv1cQ7kz7rIZviUmN+EgEM=
diff --git a/template/BIT.go b/template/BIT.go
new file mode 100644
index 000000000..0679b4262
--- /dev/null
+++ b/template/BIT.go
@@ -0,0 +1,76 @@
+package template
+
+// BinaryIndexedTree define
+type BinaryIndexedTree struct {
+ tree []int
+ capacity int
+}
+
+// Init define
+func (bit *BinaryIndexedTree) Init(capacity int) {
+ bit.tree, bit.capacity = make([]int, capacity+1), capacity
+}
+
+// Add define
+func (bit *BinaryIndexedTree) Add(index int, val int) {
+ for ; index <= bit.capacity; index += index & -index {
+ bit.tree[index] += val
+ }
+}
+
+// Query define
+func (bit *BinaryIndexedTree) Query(index int) int {
+ sum := 0
+ for ; index > 0; index -= index & -index {
+ sum += bit.tree[index]
+ }
+ return sum
+}
+
+// InitWithNums define
+func (bit *BinaryIndexedTree) InitWithNums(nums []int) {
+ bit.tree, bit.capacity = make([]int, len(nums)+1), len(nums)
+ for i := 1; i <= len(nums); i++ {
+ bit.tree[i] += nums[i-1]
+ for j := i - 2; j >= i-lowbit(i); j-- {
+ bit.tree[i] += nums[j]
+ }
+ }
+}
+
+func lowbit(x int) int {
+ return x & -x
+}
+
+// BinaryIndexedTree2D define
+type BinaryIndexedTree2D struct {
+ tree [][]int
+ row int
+ col int
+}
+
+// Add define
+func (bit2 *BinaryIndexedTree2D) Add(i, j int, val int) {
+ for i <= bit2.row {
+ k := j
+ for k <= bit2.col {
+ bit2.tree[i][k] += val
+ k += lowbit(k)
+ }
+ i += lowbit(i)
+ }
+}
+
+// Query define
+func (bit2 *BinaryIndexedTree2D) Query(i, j int) int {
+ sum := 0
+ for i >= 1 {
+ k := j
+ for k >= 1 {
+ sum += bit2.tree[i][k]
+ k -= lowbit(k)
+ }
+ i -= lowbit(i)
+ }
+ return sum
+}
diff --git a/template/BIT_test.go b/template/BIT_test.go
new file mode 100644
index 000000000..062cae72f
--- /dev/null
+++ b/template/BIT_test.go
@@ -0,0 +1,12 @@
+package template
+
+import (
+ "fmt"
+ "testing"
+)
+
+func Test_BIT(t *testing.T) {
+ nums, bit := []int{1, 2, 3, 4, 5, 6, 7, 8}, BinaryIndexedTree{}
+ bit.Init(8)
+ fmt.Printf("nums = %v bit = %v\n", nums, bit.tree) // [0 1 3 3 10 5 11 7 36]
+}
diff --git a/template/CLRUCache.go b/template/CLRUCache.go
new file mode 100644
index 000000000..9738fb86e
--- /dev/null
+++ b/template/CLRUCache.go
@@ -0,0 +1,176 @@
+package template
+
+import (
+ "container/list"
+ "hash/fnv"
+ "sync"
+)
+
+type command int
+
+const (
+ // MoveToFront define
+ MoveToFront command = iota
+ // PushFront define
+ PushFront
+ // Delete define
+ Delete
+)
+
+type clear struct {
+ done chan struct{}
+}
+
+// CLRUCache define: High Concurrency LRUCache
+type CLRUCache struct {
+ sync.RWMutex
+ cap int
+ list *list.List
+ buckets []*bucket
+ bucketMask uint32
+ deletePairs chan *list.Element
+ movePairs chan *list.Element
+ control chan interface{}
+}
+
+// Pair define
+type Pair struct {
+ key string
+ value interface{}
+ cmd command
+}
+
+// New define
+func New(capacity int) *CLRUCache {
+ c := &CLRUCache{
+ cap: capacity,
+ list: list.New(),
+ bucketMask: uint32(1024) - 1,
+ buckets: make([]*bucket, 1024),
+ }
+ for i := 0; i < 1024; i++ {
+ c.buckets[i] = &bucket{
+ keys: make(map[string]*list.Element),
+ }
+ }
+ c.restart()
+ return c
+}
+
+// Get define
+func (c *CLRUCache) Get(key string) interface{} {
+ el := c.bucket(key).get(key)
+ if el == nil {
+ return nil
+ }
+ c.move(el)
+ return el.Value.(Pair).value
+}
+
+// Put define
+func (c *CLRUCache) Put(key string, value interface{}) {
+ el, exist := c.bucket(key).set(key, value)
+ if exist != nil {
+ c.deletePairs <- exist
+ }
+ c.move(el)
+}
+
+func (c *CLRUCache) move(el *list.Element) {
+ select {
+ case c.movePairs <- el:
+ default:
+ }
+}
+
+// Delete define
+func (c *CLRUCache) Delete(key string) bool {
+ el := c.bucket(key).delete(key)
+ if el != nil {
+ c.deletePairs <- el
+ return true
+ }
+ return false
+}
+
+// Clear define
+func (c *CLRUCache) Clear() {
+ done := make(chan struct{})
+ c.control <- clear{done: done}
+ <-done
+}
+
+// Count define
+func (c *CLRUCache) Count() int {
+ count := 0
+ for _, b := range c.buckets {
+ count += b.pairCount()
+ }
+ return count
+}
+
+func (c *CLRUCache) bucket(key string) *bucket {
+ h := fnv.New32a()
+ h.Write([]byte(key))
+ return c.buckets[h.Sum32()&c.bucketMask]
+}
+
+func (c *CLRUCache) stop() {
+ close(c.movePairs)
+ <-c.control
+}
+
+func (c *CLRUCache) restart() {
+ c.deletePairs = make(chan *list.Element, 128)
+ c.movePairs = make(chan *list.Element, 128)
+ c.control = make(chan interface{})
+ go c.worker()
+}
+
+func (c *CLRUCache) worker() {
+ defer close(c.control)
+ for {
+ select {
+ case el, ok := <-c.movePairs:
+ if !ok {
+ goto clean
+ }
+ if c.doMove(el) && c.list.Len() > c.cap {
+ el := c.list.Back()
+ c.list.Remove(el)
+ c.bucket(el.Value.(Pair).key).delete(el.Value.(Pair).key)
+ }
+ case el := <-c.deletePairs:
+ c.list.Remove(el)
+ case control := <-c.control:
+ switch msg := control.(type) {
+ case clear:
+ for _, bucket := range c.buckets {
+ bucket.clear()
+ }
+ c.list = list.New()
+ msg.done <- struct{}{}
+ }
+ }
+ }
+clean:
+ for {
+ select {
+ case el := <-c.deletePairs:
+ c.list.Remove(el)
+ default:
+ close(c.deletePairs)
+ return
+ }
+ }
+}
+
+func (c *CLRUCache) doMove(el *list.Element) bool {
+ if el.Value.(Pair).cmd == MoveToFront {
+ c.list.MoveToFront(el)
+ return false
+ }
+ newel := c.list.PushFront(el.Value.(Pair))
+ c.bucket(el.Value.(Pair).key).update(el.Value.(Pair).key, newel)
+ return true
+}
diff --git a/template/CLRUCache_test.go b/template/CLRUCache_test.go
new file mode 100644
index 000000000..fa1722c54
--- /dev/null
+++ b/template/CLRUCache_test.go
@@ -0,0 +1,130 @@
+package template
+
+import (
+ "container/list"
+ "math/rand"
+ "strconv"
+ "sync"
+ "testing"
+ "time"
+
+ "github.com/stretchr/testify/assert"
+)
+
+func Test_CLRUCache(t *testing.T) {
+ obj := New(2)
+ time.Sleep(150 * time.Millisecond)
+ obj.Put("1", 1)
+ time.Sleep(150 * time.Millisecond)
+ obj.Put("2", 2)
+ time.Sleep(150 * time.Millisecond)
+ param1 := obj.Get("1")
+ time.Sleep(150 * time.Millisecond)
+ assert.Equal(t, 1, param1)
+ obj.Put("3", 3)
+ time.Sleep(150 * time.Millisecond)
+ param1 = obj.Get("2")
+ assert.Equal(t, nil, param1)
+ obj.Put("4", 4)
+ time.Sleep(150 * time.Millisecond)
+ param1 = obj.Get("1")
+ time.Sleep(150 * time.Millisecond)
+ assert.Equal(t, nil, param1)
+ param1 = obj.Get("3")
+ time.Sleep(150 * time.Millisecond)
+ assert.Equal(t, 3, param1)
+ param1 = obj.Get("4")
+ time.Sleep(150 * time.Millisecond)
+ assert.Equal(t, 4, param1)
+}
+
+func MList2Ints(lru *CLRUCache) [][]interface{} {
+ res := [][]interface{}{}
+ for head := lru.list.Front(); head != nil; head = head.Next() {
+ tmp := []interface{}{head.Value.(Pair).key, head.Value.(Pair).value}
+ res = append(res, tmp)
+ }
+ return res
+}
+
+func BenchmarkGetAndPut1(b *testing.B) {
+ b.ResetTimer()
+ obj := New(128)
+ wg := sync.WaitGroup{}
+ wg.Add(b.N * 2)
+ for i := 0; i < b.N; i++ {
+ go func() {
+ defer wg.Done()
+ obj.Get(strconv.Itoa(rand.Intn(200)))
+ }()
+ go func() {
+ defer wg.Done()
+ obj.Put(strconv.Itoa(rand.Intn(200)), strconv.Itoa(rand.Intn(200)))
+ }()
+ }
+ wg.Wait()
+}
+
+type Cache struct {
+ sync.RWMutex
+ Cap int
+ Keys map[string]*list.Element
+ List *list.List
+}
+
+type pair struct {
+ K, V string
+}
+
+func NewLRUCache(capacity int) Cache {
+ return Cache{
+ Cap: capacity,
+ Keys: make(map[string]*list.Element),
+ List: list.New(),
+ }
+}
+
+func (c *Cache) Get(key string) interface{} {
+ c.Lock()
+ if el, ok := c.Keys[key]; ok {
+ c.List.MoveToFront(el)
+ return el.Value.(pair).V
+ }
+ c.Unlock()
+ return nil
+}
+
+func (c *Cache) Put(key string, value string) {
+ c.Lock()
+ if el, ok := c.Keys[key]; ok {
+ el.Value = pair{K: key, V: value}
+ c.List.MoveToFront(el)
+ } else {
+ el := c.List.PushFront(pair{K: key, V: value})
+ c.Keys[key] = el
+ }
+ if c.List.Len() > c.Cap {
+ el := c.List.Back()
+ c.List.Remove(el)
+ delete(c.Keys, el.Value.(pair).K)
+ }
+ c.Unlock()
+}
+
+func BenchmarkGetAndPut2(b *testing.B) {
+ b.ResetTimer()
+ obj := NewLRUCache(128)
+ wg := sync.WaitGroup{}
+ wg.Add(b.N * 2)
+ for i := 0; i < b.N; i++ {
+ go func() {
+ defer wg.Done()
+ obj.Get(strconv.Itoa(rand.Intn(200)))
+ }()
+ go func() {
+ defer wg.Done()
+ obj.Put(strconv.Itoa(rand.Intn(200)), strconv.Itoa(rand.Intn(200)))
+ }()
+ }
+ wg.Wait()
+}
diff --git a/template/LFUCache.go b/template/LFUCache.go
new file mode 100644
index 000000000..74a8a9a9d
--- /dev/null
+++ b/template/LFUCache.go
@@ -0,0 +1,196 @@
+package template
+
+import "container/list"
+
+// LFUCache define
+type LFUCache struct {
+ nodes map[int]*list.Element
+ lists map[int]*list.List
+ capacity int
+ min int
+}
+
+type node struct {
+ key int
+ value int
+ frequency int
+}
+
+// Constructor define
+func Constructor(capacity int) LFUCache {
+ return LFUCache{nodes: make(map[int]*list.Element),
+ lists: make(map[int]*list.List),
+ capacity: capacity,
+ min: 0,
+ }
+}
+
+// Get define
+func (lfuCache *LFUCache) Get(key int) int {
+ value, ok := lfuCache.nodes[key]
+ if !ok {
+ return -1
+ }
+ currentNode := value.Value.(*node)
+ lfuCache.lists[currentNode.frequency].Remove(value)
+ currentNode.frequency++
+ if _, ok := lfuCache.lists[currentNode.frequency]; !ok {
+ lfuCache.lists[currentNode.frequency] = list.New()
+ }
+ newList := lfuCache.lists[currentNode.frequency]
+ newNode := newList.PushFront(currentNode)
+ lfuCache.nodes[key] = newNode
+ if currentNode.frequency-1 == lfuCache.min && lfuCache.lists[currentNode.frequency-1].Len() == 0 {
+ lfuCache.min++
+ }
+ return currentNode.value
+}
+
+// Put define
+func (lfuCache *LFUCache) Put(key int, value int) {
+ if lfuCache.capacity == 0 {
+ return
+ }
+ if currentValue, ok := lfuCache.nodes[key]; ok {
+ currentNode := currentValue.Value.(*node)
+ currentNode.value = value
+ lfuCache.Get(key)
+ return
+ }
+ if lfuCache.capacity == len(lfuCache.nodes) {
+ currentList := lfuCache.lists[lfuCache.min]
+ backNode := currentList.Back()
+ delete(lfuCache.nodes, backNode.Value.(*node).key)
+ currentList.Remove(backNode)
+ }
+ lfuCache.min = 1
+ currentNode := &node{
+ key: key,
+ value: value,
+ frequency: 1,
+ }
+ if _, ok := lfuCache.lists[1]; !ok {
+ lfuCache.lists[1] = list.New()
+ }
+ newList := lfuCache.lists[1]
+ newNode := newList.PushFront(currentNode)
+ lfuCache.nodes[key] = newNode
+}
+
+/**
+ * Your LFUCache object will be instantiated and called as such:
+ * obj := Constructor(capacity);
+ * param_1 := obj.Get(key);
+ * obj.Put(key,value);
+ */
+
+// Index Priority Queue
+// import "container/heap"
+
+// type LFUCache struct {
+// capacity int
+// pq PriorityQueue
+// hash map[int]*Item
+// counter int
+// }
+
+// func Constructor(capacity int) LFUCache {
+// lfu := LFUCache{
+// pq: PriorityQueue{},
+// hash: make(map[int]*Item, capacity),
+// capacity: capacity,
+// }
+// return lfu
+// }
+
+// func (this *LFUCache) Get(key int) int {
+// if this.capacity == 0 {
+// return -1
+// }
+// if item, ok := this.hash[key]; ok {
+// this.counter++
+// this.pq.update(item, item.value, item.frequency+1, this.counter)
+// return item.value
+// }
+// return -1
+// }
+
+// func (this *LFUCache) Put(key int, value int) {
+// if this.capacity == 0 {
+// return
+// }
+// // fmt.Printf("Put %d\n", key)
+// this.counter++
+// // 如果存在，增加 frequency，再调整堆
+// if item, ok := this.hash[key]; ok {
+// this.pq.update(item, value, item.frequency+1, this.counter)
+// return
+// }
+// // 如果不存在且缓存满了，需要删除。在 hashmap 和 pq 中删除。
+// if len(this.pq) == this.capacity {
+// item := heap.Pop(&this.pq).(*Item)
+// delete(this.hash, item.key)
+// }
+// // 新建结点，在 hashmap 和 pq 中添加。
+// item := &Item{
+// value: value,
+// key: key,
+// count: this.counter,
+// }
+// heap.Push(&this.pq, item)
+// this.hash[key] = item
+// }
+
+// // An Item is something we manage in a priority queue.
+// type Item struct {
+// value int // The value of the item; arbitrary.
+// key int
+// frequency int // The priority of the item in the queue.
+// count int // use for evicting the oldest element
+// // The index is needed by update and is maintained by the heap.Interface methods.
+// index int // The index of the item in the heap.
+// }
+
+// // A PriorityQueue implements heap.Interface and holds Items.
+// type PriorityQueue []*Item
+
+// func (pq PriorityQueue) Len() int { return len(pq) }
+
+// func (pq PriorityQueue) Less(i, j int) bool {
+// // We want Pop to give us the highest, not lowest, priority so we use greater than here.
+// if pq[i].frequency == pq[j].frequency {
+// return pq[i].count < pq[j].count
+// }
+// return pq[i].frequency < pq[j].frequency
+// }
+
+// func (pq PriorityQueue) Swap(i, j int) {
+// pq[i], pq[j] = pq[j], pq[i]
+// pq[i].index = i
+// pq[j].index = j
+// }
+
+// func (pq *PriorityQueue) Push(x interface{}) {
+// n := len(*pq)
+// item := x.(*Item)
+// item.index = n
+// *pq = append(*pq, item)
+// }
+
+// func (pq *PriorityQueue) Pop() interface{} {
+// old := *pq
+// n := len(old)
+// item := old[n-1]
+// old[n-1] = nil // avoid memory leak
+// item.index = -1 // for safety
+// *pq = old[0 : n-1]
+// return item
+// }
+
+// // update modifies the priority and value of an Item in the queue.
+// func (pq *PriorityQueue) update(item *Item, value int, frequency int, count int) {
+// item.value = value
+// item.count = count
+// item.frequency = frequency
+// heap.Fix(pq, item.index)
+// }
diff --git a/template/LRUCache.go b/template/LRUCache.go
new file mode 100644
index 000000000..581f42a8c
--- /dev/null
+++ b/template/LRUCache.go
@@ -0,0 +1,139 @@
+package template
+
+// LRUCache define
+type LRUCache struct {
+ head, tail *Node
+ keys map[int]*Node
+ capacity int
+}
+
+// Node define
+type Node struct {
+ key, val int
+ prev, next *Node
+}
+
+// ConstructorLRU define
+func ConstructorLRU(capacity int) LRUCache {
+ return LRUCache{keys: make(map[int]*Node), capacity: capacity}
+}
+
+// Get define
+func (lruCache *LRUCache) Get(key int) int {
+ if node, ok := lruCache.keys[key]; ok {
+ lruCache.Remove(node)
+ lruCache.Add(node)
+ return node.val
+ }
+ return -1
+}
+
+// Put define
+func (lruCache *LRUCache) Put(key int, value int) {
+ node, ok := lruCache.keys[key]
+ if ok {
+ node.val = value
+ lruCache.Remove(node)
+ lruCache.Add(node)
+ return
+ }
+ node = &Node{key: key, val: value}
+ lruCache.keys[key] = node
+ lruCache.Add(node)
+ if len(lruCache.keys) > lruCache.capacity {
+ delete(lruCache.keys, lruCache.tail.key)
+ lruCache.Remove(lruCache.tail)
+ }
+}
+
+// Add define
+func (lruCache *LRUCache) Add(node *Node) {
+ node.prev = nil
+ node.next = lruCache.head
+ if lruCache.head != nil {
+ lruCache.head.prev = node
+ }
+ lruCache.head = node
+ if lruCache.tail == nil {
+ lruCache.tail = node
+ lruCache.tail.next = nil
+ }
+}
+
+// Remove define
+func (lruCache *LRUCache) Remove(node *Node) {
+ if node == lruCache.head {
+ lruCache.head = node.next
+ if node.next != nil {
+ node.next.prev = nil
+ }
+ node.next = nil
+ return
+ }
+ if node == lruCache.tail {
+ lruCache.tail = node.prev
+ node.prev.next = nil
+ node.prev = nil
+ return
+ }
+ node.prev.next = node.next
+ node.next.prev = node.prev
+}
+
+/**
+ * Your LRUCache object will be instantiated and called as such:
+ * obj := Constructor(capacity);
+ * param_1 := obj.Get(key);
+ * obj.Put(key,value);
+ */
+
+// 22%
+// import "container/list"
+
+// type LRUCache struct {
+// Cap int
+// Keys map[int]*list.Element
+// List *list.List
+// }
+
+// type pair struct {
+// K, V int
+// }
+
+// func Constructor(capacity int) LRUCache {
+// return LRUCache{
+// Cap: capacity,
+// Keys: make(map[int]*list.Element),
+// List: list.New(),
+// }
+// }
+
+// func (c *LRUCache) Get(key int) int {
+// if el, ok := c.Keys[key]; ok {
+// c.List.MoveToFront(el)
+// return el.Value.(pair).V
+// }
+// return -1
+// }
+
+// func (c *LRUCache) Put(key int, value int) {
+// if el, ok := c.Keys[key]; ok {
+// el.Value = pair{K: key, V: value}
+// c.List.MoveToFront(el)
+// } else {
+// el := c.List.PushFront(pair{K: key, V: value})
+// c.Keys[key] = el
+// }
+// if c.List.Len() > c.Cap {
+// el := c.List.Back()
+// c.List.Remove(el)
+// delete(c.Keys, el.Value.(pair).K)
+// }
+// }
+
+/**
+ * Your LRUCache object will be instantiated and called as such:
+ * obj := Constructor(capacity);
+ * param_1 := obj.Get(key);
+ * obj.Put(key,value);
+ */
diff --git a/template/bucket.go b/template/bucket.go
new file mode 100644
index 000000000..ac9ab9289
--- /dev/null
+++ b/template/bucket.go
@@ -0,0 +1,55 @@
+package template
+
+import (
+ "container/list"
+ "sync"
+)
+
+type bucket struct {
+ sync.RWMutex
+ keys map[string]*list.Element
+}
+
+func (b *bucket) pairCount() int {
+ b.RLock()
+ defer b.RUnlock()
+ return len(b.keys)
+}
+
+func (b *bucket) get(key string) *list.Element {
+ b.RLock()
+ defer b.RUnlock()
+ if el, ok := b.keys[key]; ok {
+ return el
+ }
+ return nil
+}
+
+func (b *bucket) set(key string, value interface{}) (*list.Element, *list.Element) {
+ el := &list.Element{Value: Pair{key: key, value: value, cmd: PushFront}}
+ b.Lock()
+ exist := b.keys[key]
+ b.keys[key] = el
+ b.Unlock()
+ return el, exist
+}
+
+func (b *bucket) update(key string, el *list.Element) {
+ b.Lock()
+ b.keys[key] = el
+ b.Unlock()
+}
+
+func (b *bucket) delete(key string) *list.Element {
+ b.Lock()
+ el := b.keys[key]
+ delete(b.keys, key)
+ b.Unlock()
+ return el
+}
+
+func (b *bucket) clear() {
+ b.Lock()
+ b.keys = make(map[string]*list.Element)
+ b.Unlock()
+}
diff --git a/template/go.mod b/template/go.mod
new file mode 100644
index 000000000..6ef287eab
--- /dev/null
+++ b/template/go.mod
@@ -0,0 +1,11 @@
+module github.com/halfrost/LeetCode-Go/template
+
+go 1.19
+
+require github.com/stretchr/testify v1.8.0
+
+require (
+ github.com/davecgh/go-spew v1.1.1 // indirect
+ github.com/pmezard/go-difflib v1.0.0 // indirect
+ gopkg.in/yaml.v3 v3.0.1 // indirect
+)
diff --git a/template/go.sum b/template/go.sum
new file mode 100644
index 000000000..51648299d
--- /dev/null
+++ b/template/go.sum
@@ -0,0 +1,15 @@
+github.com/davecgh/go-spew v1.1.0/go.mod h1:J7Y8YcW2NihsgmVo/mv3lAwl/skON4iLHjSsI+c5H38=
+github.com/davecgh/go-spew v1.1.1 h1:vj9j/u1bqnvCEfJOwUhtlOARqs3+rkHYY13jYWTU97c=
+github.com/davecgh/go-spew v1.1.1/go.mod h1:J7Y8YcW2NihsgmVo/mv3lAwl/skON4iLHjSsI+c5H38=
+github.com/pmezard/go-difflib v1.0.0 h1:4DBwDE0NGyQoBHbLQYPwSUPoCMWR5BEzIk/f1lZbAQM=
+github.com/pmezard/go-difflib v1.0.0/go.mod h1:iKH77koFhYxTK1pcRnkKkqfTogsbg7gZNVY4sRDYZ/4=
+github.com/stretchr/objx v0.1.0/go.mod h1:HFkY916IF+rwdDfMAkV7OtwuqBVzrE8GR6GFx+wExME=
+github.com/stretchr/objx v0.4.0/go.mod h1:YvHI0jy2hoMjB+UWwv71VJQ9isScKT/TqJzVSSt89Yw=
+github.com/stretchr/testify v1.7.1/go.mod h1:6Fq8oRcR53rry900zMqJjRRixrwX3KX962/h/Wwjteg=
+github.com/stretchr/testify v1.8.0 h1:pSgiaMZlXftHpm5L7V1+rVB+AZJydKsMxsQBIJw4PKk=
+github.com/stretchr/testify v1.8.0/go.mod h1:yNjHg4UonilssWZ8iaSj1OCr/vHnekPRkoO+kdMU+MU=
+gopkg.in/check.v1 v0.0.0-20161208181325-20d25e280405 h1:yhCVgyC4o1eVCa2tZl7eS0r+SDo693bJlVdllGtEeKM=
+gopkg.in/check.v1 v0.0.0-20161208181325-20d25e280405/go.mod h1:Co6ibVJAznAaIkqp8huTwlJQCZ016jof/cbN4VW5Yz0=
+gopkg.in/yaml.v3 v3.0.0-20200313102051-9f266ea9e77c/go.mod h1:K4uyk7z7BCEPqu6E+C64Yfv1cQ7kz7rIZviUmN+EgEM=
+gopkg.in/yaml.v3 v3.0.1 h1:fxVm/GzAzEWqLHuvctI91KS9hhNmmWOoWu0XTYJS7CA=
+gopkg.in/yaml.v3 v3.0.1/go.mod h1:K4uyk7z7BCEPqu6E+C64Yfv1cQ7kz7rIZviUmN+EgEM=
diff --git a/website/config.toml b/website/config.toml
index ce6e14c27..52297f0ba 100644
--- a/website/config.toml
+++ b/website/config.toml
@@ -73,10 +73,14 @@ disablePathToLower = true
# weight = 30
[params]
+ # (Optional, default light) Sets color theme: light, dark or auto.
+ # Theme 'auto' switches between dark and light modes based on browser/os preferences
+ BookTheme = 'light'
+
# (Optional, default true) Controls table of contents visibility on right side of pages.
# Start and end levels can be controlled with markup.tableOfContents setting.
# You can also specify this parameter per page in front matter.
- BookToC = false
+ BookToC = true
# (Optional, default none) Set the path to a logo for the book. If the logo is
# /static/logo.png then the path would be logo.png
@@ -84,20 +88,27 @@ disablePathToLower = true
# (Optional, default none) Set leaf bundle to render as side menu
# When not specified file structure and weights will be used
- BookMenuBundle = '/menu'
+ # BookMenuBundle = '/menu'
# (Optional, default docs) Specify section of content to render as menu
# You can also set value to '*' to render all sections to menu
- BookSection = 'docs'
+ BookSection = '*'
# Set source repository location.
# Used for 'Last Modified' and 'Edit this page' links.
BookRepo = 'https://github.com/halfrost/LeetCode-Go'
+ # Specifies commit portion of the link to the page's last modified commit hash for 'doc' page
+ # type.
+ # Required if 'BookRepo' param is set.
+ # Value used to construct a URL consisting of BookRepo/BookCommitPath/<commit-hash>
+ # Github uses 'commit', Bitbucket uses 'commits'
+ BookCommitPath = 'commit'
+
# Enable "Edit this page" links for 'doc' page type.
# Disabled by default. Uncomment to enable. Requires 'BookRepo' param.
# Path must point to 'content' directory of repo.
- BookEditPath = 'tree/master/website/content'
+ BookEditPath = 'tree/master/website/'
# Configure the date format used on the pages
# - In git information
@@ -126,6 +137,10 @@ disablePathToLower = true
# (Optional, experimental, default false) Enables service worker that caches visited pages and resources for offline use.
BookServiceWorker = true
+ # /!\ This is an experimental feature, might be removed or changed at any time
+ # (Optional, experimental, default false) Enables a drop-down menu for translations only if a translation is present.
+ BookTranslatedOnly = false
+
[params.gitalk]
clientID = "75d9d747f200c623a0e6" # Your client ID
clientSecret = "e3cc2ff8d8f6ae3c894a827f226188de0d26f37e" # Your client secret
@@ -139,5 +154,5 @@ disablePathToLower = true
pagerDirection= "last" # Comment sorting direction, available values are 'last' and 'first'.
createIssueManually= true # If it is 'false', it is auto to make a Github issue when the administrators login.
distractionFreeMode= true # Enable hot key (cmd|ctrl + enter) submit comment.
-
+ proxy= "https://shielded-brushlands-08810.herokuapp.com/https://github.com/login/oauth/access_token"
diff --git a/website/content/ChapterFour/0001.Two-Sum.md b/website/content/ChapterFour/0001~0099/0001.Two-Sum.md
similarity index 77%
rename from website/content/ChapterFour/0001.Two-Sum.md
rename to website/content/ChapterFour/0001~0099/0001.Two-Sum.md
index 469d1d19f..d84bc7af1 100644
--- a/website/content/ChapterFour/0001.Two-Sum.md
+++ b/website/content/ChapterFour/0001~0099/0001.Two-Sum.md
@@ -47,4 +47,11 @@ func twoSum(nums []int, target int) []int {
return nil
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<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/0001~0099/0002.Add-Two-Numbers/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0002.Add-Two-Numbers.md b/website/content/ChapterFour/0001~0099/0002.Add-Two-Numbers.md
similarity index 81%
rename from website/content/ChapterFour/0002.Add-Two-Numbers.md
rename to website/content/ChapterFour/0001~0099/0002.Add-Two-Numbers.md
index c30fb0ef0..a64c6a301 100644
--- a/website/content/ChapterFour/0002.Add-Two-Numbers.md
+++ b/website/content/ChapterFour/0001~0099/0002.Add-Two-Numbers.md
@@ -75,4 +75,11 @@ func addTwoNumbers(l1 *ListNode, l2 *ListNode) *ListNode {
return head.Next
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<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>
diff --git a/website/content/ChapterFour/0001~0099/0003.Longest-Substring-Without-Repeating-Characters.md b/website/content/ChapterFour/0001~0099/0003.Longest-Substring-Without-Repeating-Characters.md
new file mode 100644
index 000000000..f86f9d4d4
--- /dev/null
+++ b/website/content/ChapterFour/0001~0099/0003.Longest-Substring-Without-Repeating-Characters.md
@@ -0,0 +1,146 @@
+# [3. Longest Substring Without Repeating Characters](https://leetcode.com/problems/longest-substring-without-repeating-characters/)
+
+## 题目
+
+Given a string, find the length of the longest substring without repeating characters.
+
+
+
+**Example 1**:
+
+```
+
+Input: "abcabcbb"
+Output: 3
+Explanation: The answer is "abc", with the length of 3.
+
+```
+
+**Example 2**:
+
+```
+
+Input: "bbbbb"
+Output: 1
+Explanation: The answer is "b", with the length of 1.
+
+```
+
+**Example 3**:
+
+```
+
+Input: "pwwkew"
+Output: 3
+Explanation: The answer is "wke", with the length of 3.
+ Note that the answer must be a substring, "pwke" is a subsequence and not a substring.
+
+```
+
+## 题目大意
+
+
+在一个字符串重寻找没有重复字母的最长子串。
+
+## 解题思路
+
+这一题和第 438 题，第 3 题，第 76 题，第 567 题类似，用的思想都是"滑动窗口"。
+
+滑动窗口的右边界不断的右移，只要没有重复的字符，就持续向右扩大窗口边界。一旦出现了重复字符，就需要缩小左边界，直到重复的字符移出了左边界，然后继续移动滑动窗口的右边界。以此类推，每次移动需要计算当前长度，并判断是否需要更新最大长度，最终最大的值就是题目中的所求。
+
+
+## 代码
+
+```go
+
+package leetcode
+
+// 解法一 位图
+func lengthOfLongestSubstring(s string) int {
+ if len(s) == 0 {
+ return 0
+ }
+ var bitSet [256]bool
+ result, left, right := 0, 0, 0
+ for left < len(s) {
+ // 右侧字符对应的 bitSet 被标记 true，说明此字符在 X 位置重复，需要左侧向前移动，直到将 X 标记为 false
+ if bitSet[s[right]] {
+ bitSet[s[left]] = false
+ left++
+ } else {
+ bitSet[s[right]] = true
+ right++
+ }
+ if result < right-left {
+ result = right - left
+ }
+ if left+result >= len(s) || right >= len(s) {
+ break
+ }
+ }
+ return result
+}
+
+// 解法二 滑动窗口
+func lengthOfLongestSubstring1(s string) int {
+ if len(s) == 0 {
+ return 0
+ }
+ var freq [127]int
+ result, left, right := 0, 0, -1
+
+ for left < len(s) {
+ if right+1 < len(s) && freq[s[right+1]] == 0 {
+ freq[s[right+1]]++
+ right++
+
+ } else {
+ freq[s[left]]--
+ left++
+ }
+ result = max(result, right-left+1)
+ }
+ return result
+}
+
+// 解法三 滑动窗口-哈希桶
+func lengthOfLongestSubstring2(s string) int {
+ right, left, res := 0, 0, 0
+ indexes := make(map[byte]int, len(s))
+ for left < len(s) {
+ if idx, ok := indexes[s[left]]; ok && idx >= right {
+ right = idx + 1
+ }
+ indexes[s[left]] = left
+ left++
+ res = max(res, left-right)
+ }
+ return res
+}
+
+func max(a int, b int) int {
+ if a > b {
+ return a
+ }
+ return b
+}
+
+```
+
+
+
+
+
+
+
+
+
+
+
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<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>
diff --git a/website/content/ChapterFour/0004.Median-of-Two-Sorted-Arrays.md b/website/content/ChapterFour/0001~0099/0004.Median-of-Two-Sorted-Arrays.md
similarity index 87%
rename from website/content/ChapterFour/0004.Median-of-Two-Sorted-Arrays.md
rename to website/content/ChapterFour/0001~0099/0004.Median-of-Two-Sorted-Arrays.md
index 9ad0c55b0..ddca884df 100755
--- a/website/content/ChapterFour/0004.Median-of-Two-Sorted-Arrays.md
+++ b/website/content/ChapterFour/0001~0099/0004.Median-of-Two-Sorted-Arrays.md
@@ -40,7 +40,7 @@ You may assume **nums1** and **nums2** cannot be both empty.
- 给出两个有序数组，要求找出这两个数组合并以后的有序数组中的中位数。要求时间复杂度为 O(log (m+n))。
-- 这一题最容易想到的办法是把两个数组合并，然后取出中位数。但是合并有序数组的操作是 `O(max(n,m))` 的，不符合题意。看到题目给的 `log` 的时间复杂度，很容易联想到二分搜索。
+- 这一题最容易想到的办法是把两个数组合并，然后取出中位数。但是合并有序数组的操作是 `O(m+n)` 的，不符合题意。看到题目给的 `log` 的时间复杂度，很容易联想到二分搜索。
- 由于要找到最终合并以后数组的中位数，两个数组的总大小也知道，所以中间这个位置也是知道的。只需要二分搜索一个数组中切分的位置，另一个数组中切分的位置也能得到。为了使得时间复杂度最小，所以二分搜索两个数组中长度较小的那个数组。
- 关键的问题是如何切分数组 1 和数组 2 。其实就是如何切分数组 1 。先随便二分产生一个 `midA`，切分的线何时算满足了中位数的条件呢？即，线左边的数都小于右边的数，即，`nums1[midA-1] ≤ nums2[midB] && nums2[midB-1] ≤ nums1[midA]` 。如果这些条件都不满足，切分线就需要调整。如果 `nums1[midA] < nums2[midB-1]`，说明 `midA` 这条线划分出来左边的数小了，切分线应该右移；如果 `nums1[midA-1] > nums2[midB]`，说明 midA 这条线划分出来左边的数大了，切分线应该左移。经过多次调整以后，切分线总能找到满足条件的解。
- 假设现在找到了切分的两条线了，`数组 1` 在切分线两边的下标分别是 `midA - 1` 和 `midA`。`数组 2` 在切分线两边的下标分别是 `midB - 1` 和 `midB`。最终合并成最终数组，如果数组长度是奇数，那么中位数就是 `max(nums1[midA-1], nums2[midB-1])`。如果数组长度是偶数，那么中间位置的两个数依次是：`max(nums1[midA-1], nums2[midB-1])` 和 `min(nums1[midA], nums2[midB])`，那么中位数就是 `(max(nums1[midA-1], nums2[midB-1]) + min(nums1[midA], nums2[midB])) / 2`。图示见下图：
@@ -96,3 +96,10 @@ 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/0001~0099/0003.Longest-Substring-Without-Repeating-Characters/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0001~0099/0005.Longest-Palindromic-Substring/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0001~0099/0005.Longest-Palindromic-Substring.md b/website/content/ChapterFour/0001~0099/0005.Longest-Palindromic-Substring.md
new file mode 100644
index 000000000..1adffa4b2
--- /dev/null
+++ b/website/content/ChapterFour/0001~0099/0005.Longest-Palindromic-Substring.md
@@ -0,0 +1,193 @@
+# [5. Longest Palindromic Substring](https://leetcode.com/problems/longest-palindromic-substring/)
+
+
+## 题目
+
+Given a string `s`, return *the longest palindromic substring* in `s`.
+
+**Example 1:**
+
+```
+Input: s = "babad"
+Output: "bab"
+Note: "aba" is also a valid answer.
+
+```
+
+**Example 2:**
+
+```
+Input: s = "cbbd"
+Output: "bb"
+
+```
+
+**Example 3:**
+
+```
+Input: s = "a"
+Output: "a"
+
+```
+
+**Example 4:**
+
+```
+Input: s = "ac"
+Output: "a"
+
+```
+
+**Constraints:**
+
+- `1 <= s.length <= 1000`
+- `s` consist of only digits and English letters (lower-case and/or upper-case),
+
+## 题目大意
+
+给你一个字符串 `s`，找到 `s` 中最长的回文子串。
+
+## 解题思路
+
+- 此题非常经典，并且有多种解法。
+- 解法一，动态规划。定义 `dp[i][j]` 表示从字符串第 `i` 个字符到第 `j` 个字符这一段子串是否是回文串。由回文串的性质可以得知，回文串去掉一头一尾相同的字符以后，剩下的还是回文串。所以状态转移方程是 `dp[i][j] = (s[i] == s[j]) && ((j-i < 3) || dp[i+1][j-1])`，注意特殊的情况，`j - i == 1` 的时候，即只有 2 个字符的情况，只需要判断这 2 个字符是否相同即可。`j - i == 2` 的时候，即只有 3 个字符的情况，只需要判断除去中心以外对称的 2 个字符是否相等。每次循环动态维护保存最长回文串即可。时间复杂度 O(n^2)，空间复杂度 O(n^2)。
+- 解法二，中心扩散法。动态规划的方法中，我们将任意起始，终止范围内的字符串都判断了一遍。其实没有这个必要，如果不是最长回文串，无需判断并保存结果。所以动态规划的方法在空间复杂度上还有优化空间。判断回文有一个核心问题是找到“轴心”。如果长度是偶数，那么轴心是中心虚拟的，如果长度是奇数，那么轴心正好是正中心的那个字母。中心扩散法的思想是枚举每个轴心的位置。然后做两次假设，假设最长回文串是偶数，那么以虚拟中心往 2 边扩散；假设最长回文串是奇数，那么以正中心的字符往 2 边扩散。扩散的过程就是对称判断两边字符是否相等的过程。这个方法时间复杂度和动态规划是一样的，但是空间复杂度降低了。时间复杂度 O(n^2)，空间复杂度 O(1)。
+- 解法三，滑动窗口。这个写法其实就是中心扩散法变了一个写法。中心扩散是依次枚举每一个轴心。滑动窗口的方法稍微优化了一点，有些轴心两边字符不相等，下次就不会枚举这些不可能形成回文子串的轴心了。不过这点优化并没有优化时间复杂度，时间复杂度 O(n^2)，空间复杂度 O(1)。
+- 解法四，马拉车算法。这个算法是本题的最优解，也是最复杂的解法。时间复杂度 O(n)，空间复杂度 O(n)。中心扩散法有 2 处有重复判断，第一处是每次都往两边扩散，不同中心扩散多次，实际上有很多重复判断的字符，能否不重复判断？第二处，中心能否跳跃选择，不是每次都枚举，是否可以利用前一次的信息，跳跃选择下一次的中心？马拉车算法针对重复判断的问题做了优化，增加了一个辅助数组，将时间复杂度从 O(n^2) 优化到了 O(n)，空间换了时间，空间复杂度增加到 O(n)。
+
+ 
+
+- 首先是预处理，向字符串的头尾以及每两个字符中间添加一个特殊字符 `#`，比如字符串 `aaba` 处理后会变成 `#a#a#b#a#`。那么原先长度为偶数的回文字符串 `aa` 会变成长度为奇数的回文字符串 `#a#a#`，而长度为奇数的回文字符串 `aba` 会变成长度仍然为奇数的回文字符串 `#a#b#a#`，经过预处理以后，都会变成长度为奇数的字符串。**注意这里的特殊字符不需要是没有出现过的字母，也可以使用任何一个字符来作为这个特殊字符。**这是因为，当我们只考虑长度为奇数的回文字符串时，每次我们比较的两个字符奇偶性一定是相同的，所以原来字符串中的字符不会与插入的特殊字符互相比较，不会因此产生问题。**预处理以后，以某个中心扩散的步数和实际字符串长度是相等的。**因为半径里面包含了插入的特殊字符，又由于左右对称的性质，所以扩散半径就等于原来回文子串的长度。
+
+ 
+
+- 核心部分是如何通过左边已经扫描过的数据推出右边下一次要扩散的中心。这里定义下一次要扩散的中心下标是 `i`。如果 `i` 比 `maxRight` 要大，只能继续中心扩散。如果 `i` 比 `maxRight` 小，这时又分为 3 种情况。三种情况见上图。将上述 3 种情况总结起来，就是 ：`dp[i] = min(maxRight-i, dp[2*center-i])`，其中，`mirror` 相对于 `center` 是和 `i` 中心对称的，所以它的下标可以计算出来是 `2*center-i`。更新完 `dp[i]` 以后，就要进行中心扩散了。中心扩散以后动态维护最长回文串并相应的更新 `center`，`maxRight`，并且记录下原始字符串的起始位置 `begin` 和 `maxLen`。
+
+## 代码
+
+```go
+package leetcode
+
+// 解法一 Manacher's algorithm，时间复杂度 O(n)，空间复杂度 O(n)
+func longestPalindrome(s string) string {
+ if len(s) < 2 {
+ return s
+ }
+ newS := make([]rune, 0)
+ newS = append(newS, '#')
+ for _, c := range s {
+ newS = append(newS, c)
+ newS = append(newS, '#')
+ }
+ // dp[i]: 以预处理字符串下标 i 为中心的回文半径(奇数长度时不包括中心)
+ // maxRight: 通过中心扩散的方式能够扩散的最右边的下标
+ // center: 与 maxRight 对应的中心字符的下标
+ // maxLen: 记录最长回文串的半径
+ // begin: 记录最长回文串在起始串 s 中的起始下标
+ dp, maxRight, center, maxLen, begin := make([]int, len(newS)), 0, 0, 1, 0
+ for i := 0; i < len(newS); i++ {
+ if i < maxRight {
+ // 这一行代码是 Manacher 算法的关键所在
+ dp[i] = min(maxRight-i, dp[2*center-i])
+ }
+ // 中心扩散法更新 dp[i]
+ left, right := i-(1+dp[i]), i+(1+dp[i])
+ for left >= 0 && right < len(newS) && newS[left] == newS[right] {
+ dp[i]++
+ left--
+ right++
+ }
+ // 更新 maxRight，它是遍历过的 i 的 i + dp[i] 的最大者
+ if i+dp[i] > maxRight {
+ maxRight = i + dp[i]
+ center = i
+ }
+ // 记录最长回文子串的长度和相应它在原始字符串中的起点
+ if dp[i] > maxLen {
+ maxLen = dp[i]
+ begin = (i - maxLen) / 2 // 这里要除以 2 因为有我们插入的辅助字符 #
+ }
+ }
+ return s[begin : begin+maxLen]
+}
+
+func min(x, y int) int {
+ if x < y {
+ return x
+ }
+ return y
+}
+
+// 解法二 滑动窗口，时间复杂度 O(n^2)，空间复杂度 O(1)
+func longestPalindrome1(s string) string {
+ if len(s) == 0 {
+ return ""
+ }
+ left, right, pl, pr := 0, -1, 0, 0
+ for left < len(s) {
+ // 移动到相同字母的最右边（如果有相同字母）
+ for right+1 < len(s) && s[left] == s[right+1] {
+ right++
+ }
+ // 找到回文的边界
+ for left-1 >= 0 && right+1 < len(s) && s[left-1] == s[right+1] {
+ left--
+ right++
+ }
+ if right-left > pr-pl {
+ pl, pr = left, right
+ }
+ // 重置到下一次寻找回文的中心
+ left = (left+right)/2 + 1
+ right = left
+ }
+ return s[pl : pr+1]
+}
+
+// 解法三 中心扩散法，时间复杂度 O(n^2)，空间复杂度 O(1)
+func longestPalindrome2(s string) string {
+ res := ""
+ for i := 0; i < len(s); i++ {
+ res = maxPalindrome(s, i, i, res)
+ res = maxPalindrome(s, i, i+1, res)
+ }
+ return res
+}
+
+func maxPalindrome(s string, i, j int, res string) string {
+ sub := ""
+ for i >= 0 && j < len(s) && s[i] == s[j] {
+ sub = s[i : j+1]
+ i--
+ j++
+ }
+ if len(res) < len(sub) {
+ return sub
+ }
+ return res
+}
+
+// 解法四 DP，时间复杂度 O(n^2)，空间复杂度 O(n^2)
+func longestPalindrome3(s string) string {
+ res, dp := "", make([][]bool, len(s))
+ for i := 0; i < len(s); i++ {
+ dp[i] = make([]bool, len(s))
+ }
+ for i := len(s) - 1; i >= 0; i-- {
+ for j := i; j < len(s); j++ {
+ dp[i][j] = (s[i] == s[j]) && ((j-i < 3) || dp[i+1][j-1])
+ if dp[i][j] && (res == "" || j-i+1 > len(res)) {
+ res = s[i : j+1]
+ }
+ }
+ }
+ return res
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<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/0006.ZigZag-Conversion/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0001~0099/0006.ZigZag-Conversion.md b/website/content/ChapterFour/0001~0099/0006.ZigZag-Conversion.md
new file mode 100644
index 000000000..8f61aedc3
--- /dev/null
+++ b/website/content/ChapterFour/0001~0099/0006.ZigZag-Conversion.md
@@ -0,0 +1,114 @@
+# [6. ZigZag Conversion](https://leetcode.com/problems/zigzag-conversion/)
+
+
+## 题目
+
+The string `"PAYPALISHIRING"` is written in a zigzag pattern on a given number of rows like this: (you may want to display this pattern in a fixed font for better legibility)
+
+```
+P A H N
+A P L S I I G
+Y I R
+```
+
+And then read line by line: `"PAHNAPLSIIGYIR"`
+
+Write the code that will take a string and make this conversion given a number of rows:
+
+```
+string convert(string s, int numRows);
+```
+
+**Example 1:**
+
+```
+Input: s = "PAYPALISHIRING", numRows = 3
+Output: "PAHNAPLSIIGYIR"
+```
+
+**Example 2:**
+
+```
+Input: s = "PAYPALISHIRING", numRows = 4
+Output: "PINALSIGYAHRPI"
+Explanation:
+P I N
+A L S I G
+Y A H R
+P I
+```
+
+**Example 3:**
+
+```
+Input: s = "A", numRows = 1
+Output: "A"
+```
+
+**Constraints:**
+
+- `1 <= s.length <= 1000`
+- `s` consists of English letters (lower-case and upper-case), `','` and `'.'`.
+- `1 <= numRows <= 1000`
+
+## 题目大意
+
+将一个给定字符串 `s` 根据给定的行数 `numRows` ，以从上往下、从左到右进行 Z 字形排列。
+
+比如输入字符串为 `"PAYPALISHIRING"` 行数为 3 时，排列如下：
+
+```go
+P A H N
+A P L S I I G
+Y I R
+```
+
+之后，你的输出需要从左往右逐行读取，产生出一个新的字符串，比如：`"PAHNAPLSIIGYIR"`。
+
+请你实现这个将字符串进行指定行数变换的函数：
+
+```go
+string convert(string s, int numRows);
+```
+
+## 解题思路
+
+- 这一题没有什么算法思想，考察的是对程序控制的能力。用 2 个变量保存方向，当垂直输出的行数达到了规定的目标行数以后，需要从下往上转折到第一行，循环中控制好方向ji
+
+## 代码
+
+```go
+package leetcode
+
+func convert(s string, numRows int) string {
+ matrix, down, up := make([][]byte, numRows, numRows), 0, numRows-2
+ for i := 0; i != len(s); {
+ if down != numRows {
+ matrix[down] = append(matrix[down], byte(s[i]))
+ down++
+ i++
+ } else if up > 0 {
+ matrix[up] = append(matrix[up], byte(s[i]))
+ up--
+ i++
+ } else {
+ up = numRows - 2
+ down = 0
+ }
+ }
+ solution := make([]byte, 0, len(s))
+ for _, row := range matrix {
+ for _, item := range row {
+ solution = append(solution, item)
+ }
+ }
+ return string(solution)
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0001~0099/0005.Longest-Palindromic-Substring/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0001~0099/0007.Reverse-Integer/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0007.Reverse-Integer.md b/website/content/ChapterFour/0001~0099/0007.Reverse-Integer.md
similarity index 77%
rename from website/content/ChapterFour/0007.Reverse-Integer.md
rename to website/content/ChapterFour/0001~0099/0007.Reverse-Integer.md
index 801d50888..5f0b783fa 100755
--- a/website/content/ChapterFour/0007.Reverse-Integer.md
+++ b/website/content/ChapterFour/0001~0099/0007.Reverse-Integer.md
@@ -53,3 +53,10 @@ 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/0001~0099/0006.ZigZag-Conversion/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0001~0099/0008.String-to-Integer-atoi/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0001~0099/0008.String-to-Integer-atoi.md b/website/content/ChapterFour/0001~0099/0008.String-to-Integer-atoi.md
new file mode 100644
index 000000000..0f37b876a
--- /dev/null
+++ b/website/content/ChapterFour/0001~0099/0008.String-to-Integer-atoi.md
@@ -0,0 +1,199 @@
+# [8. String to Integer (atoi)](https://leetcode.com/problems/string-to-integer-atoi/)
+
+
+## 题目
+
+Implement the `myAtoi(string s)` function, which converts a string to a 32-bit signed integer (similar to C/C++'s `atoi` function).
+
+The algorithm for `myAtoi(string s)` is as follows:
+
+1. Read in and ignore any leading whitespace.
+2. Check if the next character (if not already at the end of the string) is `'-'` or `'+'`. Read this character in if it is either. This determines if the final result is negative or positive respectively. Assume the result is positive if neither is present.
+3. Read in next the characters until the next non-digit charcter or the end of the input is reached. The rest of the string is ignored.
+4. Convert these digits into an integer (i.e. `"123" -> 123`, `"0032" -> 32`). If no digits were read, then the integer is `0`. Change the sign as necessary (from step 2).
+5. If the integer is out of the 32-bit signed integer range `[-231, 231 - 1]`, then clamp the integer so that it remains in the range. Specifically, integers less than `231` should be clamped to `231`, and integers greater than `231 - 1` should be clamped to `231 - 1`.
+6. Return the integer as the final result.
+
+**Note:**
+
+- Only the space character `' '` is considered a whitespace character.
+- **Do not ignore** any characters other than the leading whitespace or the rest of the string after the digits.
+
+**Example 1:**
+
+```
+Input: s = "42"
+Output: 42
+Explanation: The underlined characters are what is read in, the caret is the current reader position.
+Step 1: "42" (no characters read because there is no leading whitespace)
+ ^
+Step 2: "42" (no characters read because there is neither a '-' nor '+')
+ ^
+Step 3: "42" ("42" is read in)
+ ^
+The parsed integer is 42.
+Since 42 is in the range [-231, 231 - 1], the final result is 42.
+
+```
+
+**Example 2:**
+
+```
+Input: s = " -42"
+Output: -42
+Explanation:
+Step 1: " -42" (leading whitespace is read and ignored)
+ ^
+Step 2: " -42" ('-' is read, so the result should be negative)
+ ^
+Step 3: " -42" ("42" is read in)
+ ^
+The parsed integer is -42.
+Since -42 is in the range [-231, 231 - 1], the final result is -42.
+
+```
+
+**Example 3:**
+
+```
+Input: s = "4193 with words"
+Output: 4193
+Explanation:
+Step 1: "4193 with words" (no characters read because there is no leading whitespace)
+ ^
+Step 2: "4193 with words" (no characters read because there is neither a '-' nor '+')
+ ^
+Step 3: "4193 with words" ("4193" is read in; reading stops because the next character is a non-digit)
+ ^
+The parsed integer is 4193.
+Since 4193 is in the range [-231, 231 - 1], the final result is 4193.
+
+```
+
+**Example 4:**
+
+```
+Input: s = "words and 987"
+Output: 0
+Explanation:
+Step 1: "words and 987" (no characters read because there is no leading whitespace)
+ ^
+Step 2: "words and 987" (no characters read because there is neither a '-' nor '+')
+ ^
+Step 3: "words and 987" (reading stops immediately because there is a non-digit 'w')
+ ^
+The parsed integer is 0 because no digits were read.
+Since 0 is in the range [-231, 231 - 1], the final result is 0.
+
+```
+
+**Example 5:**
+
+```
+Input: s = "-91283472332"
+Output: -2147483648
+Explanation:
+Step 1: "-91283472332" (no characters read because there is no leading whitespace)
+ ^
+Step 2: "-91283472332" ('-' is read, so the result should be negative)
+ ^
+Step 3: "-91283472332" ("91283472332" is read in)
+ ^
+The parsed integer is -91283472332.
+Since -91283472332 is less than the lower bound of the range [-231, 231 - 1], the final result is clamped to -231 = -2147483648.
+```
+
+**Constraints:**
+
+- `0 <= s.length <= 200`
+- `s` consists of English letters (lower-case and upper-case), digits (`0-9`), `' '`, `'+'`
+
+## 题目大意
+
+请你来实现一个 myAtoi(string s) 函数，使其能将字符串转换成一个 32 位有符号整数（类似 C/C++ 中的 atoi 函数）。
+
+函数 myAtoi(string s) 的算法如下：
+
+- 读入字符串并丢弃无用的前导空格
+- 检查下一个字符（假设还未到字符末尾）为正还是负号，读取该字符（如果有）。 确定最终结果是负数还是正数。 如果两者都不存在，则假定结果为正。
+- 读入下一个字符，直到到达下一个非数字字符或到达输入的结尾。字符串的其余部分将被忽略。
+- 将前面步骤读入的这些数字转换为整数（即，"123" -> 123， "0032" -> 32）。如果没有读入数字，则整数为 0 。必要时更改符号（从步骤 2 开始）。
+- 如果整数数超过 32 位有符号整数范围 [−231, 231 − 1] ，需要截断这个整数，使其保持在这个范围内。具体来说，小于 −231 的整数应该被固定为 −231 ，大于 231 − 1 的整数应该被固定为 231 − 1 。
+- 返回整数作为最终结果。
+
+注意：
+
+- 本题中的空白字符只包括空格字符 ' ' 。
+- 除前导空格或数字后的其余字符串外，请勿忽略 任何其他字符。
+
+## 解题思路
+
+- 这题是简单题。题目要求实现类似 `C++` 中 `atoi` 函数的功能。这个函数功能是将字符串类型的数字转成 `int` 类型数字。先去除字符串中的前导空格，并判断记录数字的符号。数字需要去掉前导 `0` 。最后将数字转换成数字类型，判断是否超过 `int` 类型的上限 `[-2^31, 2^31 - 1]`，如果超过上限，需要输出边界，即 `-2^31`，或者 `2^31 - 1`。
+
+## 代码
+
+```go
+package leetcode
+
+func myAtoi(s string) int {
+ maxInt, signAllowed, whitespaceAllowed, sign, digits := int64(2<<30), true, true, 1, []int{}
+ for _, c := range s {
+ if c == ' ' && whitespaceAllowed {
+ continue
+ }
+ if signAllowed {
+ if c == '+' {
+ signAllowed = false
+ whitespaceAllowed = false
+ continue
+ } else if c == '-' {
+ sign = -1
+ signAllowed = false
+ whitespaceAllowed = false
+ continue
+ }
+ }
+ if c < '0' || c > '9' {
+ break
+ }
+ whitespaceAllowed, signAllowed = false, false
+ digits = append(digits, int(c-48))
+ }
+ var num, place int64
+ place, num = 1, 0
+ lastLeading0Index := -1
+ for i, d := range digits {
+ if d == 0 {
+ lastLeading0Index = i
+ } else {
+ break
+ }
+ }
+ if lastLeading0Index > -1 {
+ digits = digits[lastLeading0Index+1:]
+ }
+ var rtnMax int64
+ if sign > 0 {
+ rtnMax = maxInt - 1
+ } else {
+ rtnMax = maxInt
+ }
+ digitsCount := len(digits)
+ for i := digitsCount - 1; i >= 0; i-- {
+ num += int64(digits[i]) * place
+ place *= 10
+ if digitsCount-i > 10 || num > rtnMax {
+ return int(int64(sign) * rtnMax)
+ }
+ }
+ num *= int64(sign)
+ return int(num)
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<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/0009.Palindrome-Number/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0001~0099/0009.Palindrome-Number.md b/website/content/ChapterFour/0001~0099/0009.Palindrome-Number.md
new file mode 100644
index 000000000..4cfa1c984
--- /dev/null
+++ b/website/content/ChapterFour/0001~0099/0009.Palindrome-Number.md
@@ -0,0 +1,103 @@
+# [9. Palindrome Number](https://leetcode.com/problems/palindrome-number/)
+
+
+## 题目
+
+Determine whether an integer is a palindrome. An integer is a palindrome when it reads the same backward as forward.
+
+**Example 1**:
+
+```
+Input: 121
+Output: true
+```
+
+**Example 2**:
+
+```
+Input: -121
+Output: false
+Explanation: From left to right, it reads -121. From right to left, it becomes 121-. Therefore it is not a palindrome.
+```
+
+**Example 3**:
+
+```
+Input: 10
+Output: false
+Explanation: Reads 01 from right to left. Therefore it is not a palindrome.
+```
+
+**Follow up**:
+
+Coud you solve it without converting the integer to a string?
+
+## 题目大意
+
+判断一个整数是否是回文数。回文数是指正序（从左向右）和倒序（从右向左）读都是一样的整数。
+
+## 解题思路
+
+- 判断一个整数是不是回文数。
+- 简单题。注意会有负数的情况，负数，个位数，10 都不是回文数。其他的整数再按照回文的规则判断。
+
+## 代码
+
+```go
+
+package leetcode
+
+import "strconv"
+
+// 解法一
+func isPalindrome(x int) bool {
+ if x < 0 {
+ return false
+ }
+ if x == 0 {
+ return true
+ }
+ if x%10 == 0 {
+ return false
+ }
+ arr := make([]int, 0, 32)
+ for x > 0 {
+ arr = append(arr, x%10)
+ x = x / 10
+ }
+ sz := len(arr)
+ for i, j := 0, sz-1; i <= j; i, j = i+1, j-1 {
+ if arr[i] != arr[j] {
+ return false
+ }
+ }
+ return true
+}
+
+// 解法二 数字转字符串
+func isPalindrome1(x int) bool {
+ if x < 0 {
+ return false
+ }
+ if x < 10 {
+ return true
+ }
+ s := strconv.Itoa(x)
+ length := len(s)
+ for i := 0; i <= length/2; i++ {
+ if s[i] != s[length-1-i] {
+ return false
+ }
+ }
+ return true
+}
+
+
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0001~0099/0008.String-to-Integer-atoi/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0001~0099/0011.Container-With-Most-Water/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0011.Container-With-Most-Water.md b/website/content/ChapterFour/0001~0099/0011.Container-With-Most-Water.md
similarity index 80%
rename from website/content/ChapterFour/0011.Container-With-Most-Water.md
rename to website/content/ChapterFour/0001~0099/0011.Container-With-Most-Water.md
index c8d25a2ea..6e81d5b00 100644
--- a/website/content/ChapterFour/0011.Container-With-Most-Water.md
+++ b/website/content/ChapterFour/0001~0099/0011.Container-With-Most-Water.md
@@ -57,3 +57,10 @@ 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/0001~0099/0009.Palindrome-Number/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0001~0099/0012.Integer-to-Roman/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0001~0099/0012.Integer-to-Roman.md b/website/content/ChapterFour/0001~0099/0012.Integer-to-Roman.md
new file mode 100644
index 000000000..274c2a126
--- /dev/null
+++ b/website/content/ChapterFour/0001~0099/0012.Integer-to-Roman.md
@@ -0,0 +1,109 @@
+# [12. Integer to Roman](https://leetcode.com/problems/integer-to-roman/)
+
+
+## 题目
+
+Roman numerals are represented by seven different symbols: `I`, `V`, `X`, `L`, `C`, `D` and `M`.
+
+```
+Symbol Value
+I 1
+V 5
+X 10
+L 50
+C 100
+D 500
+M 1000
+```
+
+For example, `2` is written as `II` in Roman numeral, just two one's added together. `12` is written as `XII`, which is simply `X + II`. The number `27` is written as `XXVII`, which is `XX + V + II`.
+
+Roman numerals are usually written largest to smallest from left to right. However, the numeral for four is not `IIII`. Instead, the number four is written as `IV`. Because the one is before the five we subtract it making four. The same principle applies to the number nine, which is written as `IX`. There are six instances where subtraction is used:
+
+- `I` can be placed before `V` (5) and `X` (10) to make 4 and 9.
+- `X` can be placed before `L` (50) and `C` (100) to make 40 and 90.
+- `C` can be placed before `D` (500) and `M` (1000) to make 400 and 900.
+
+Given an integer, convert it to a roman numeral.
+
+**Example 1:**
+
+```
+Input: num = 3
+Output: "III"
+```
+
+**Example 2:**
+
+```
+Input: num = 4
+Output: "IV"
+```
+
+**Example 3:**
+
+```
+Input: num = 9
+Output: "IX"
+```
+
+**Example 4:**
+
+```
+Input: num = 58
+Output: "LVIII"
+Explanation: L = 50, V = 5, III = 3.
+```
+
+**Example 5:**
+
+```
+Input: num = 1994
+Output: "MCMXCIV"
+Explanation: M = 1000, CM = 900, XC = 90 and IV = 4.
+```
+
+**Constraints:**
+
+- `1 <= num <= 3999`
+
+## 题目大意
+
+通常情况下，罗马数字中小的数字在大的数字的右边。但也存在特例，例如 4 不写做 IIII，而是 IV。数字 1 在数字 5 的左边，所表示的数等于大数 5 减小数 1 得到的数值 4 。同样地，数字 9 表示为 IX。这个特殊的规则只适用于以下六种情况：
+
+- I 可以放在 V (5) 和 X (10) 的左边，来表示 4 和 9。
+- X 可以放在 L (50) 和 C (100) 的左边，来表示 40 和 90。
+- C 可以放在 D (500) 和 M (1000) 的左边，来表示 400 和 900。
+
+给定一个整数，将其转为罗马数字。输入确保在 1 到 3999 的范围内。
+
+## 解题思路
+
+- 依照题意，优先选择大的数字，解题思路采用贪心算法。将 1-3999 范围内的罗马数字从大到小放在数组中，从头选择到尾，即可把整数转成罗马数字。
+
+## 代码
+
+```go
+package leetcode
+
+func intToRoman(num int) string {
+ values := []int{1000, 900, 500, 400, 100, 90, 50, 40, 10, 9, 5, 4, 1}
+ symbols := []string{"M", "CM", "D", "CD", "C", "XC", "L", "XL", "X", "IX", "V", "IV", "I"}
+ res, i := "", 0
+ for num != 0 {
+ for values[i] > num {
+ i++
+ }
+ num -= values[i]
+ res += symbols[i]
+ }
+ return res
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<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/0013.Roman-to-Integer/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0013.Roman-to-Integer.md b/website/content/ChapterFour/0001~0099/0013.Roman-to-Integer.md
similarity index 89%
rename from website/content/ChapterFour/0013.Roman-to-Integer.md
rename to website/content/ChapterFour/0001~0099/0013.Roman-to-Integer.md
index 44d758ebb..ae95445d3 100644
--- a/website/content/ChapterFour/0013.Roman-to-Integer.md
+++ b/website/content/ChapterFour/0001~0099/0013.Roman-to-Integer.md
@@ -129,4 +129,11 @@ func romanToInt(s string) int {
return total
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0001~0099/0012.Integer-to-Roman/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0001~0099/0014.Longest-Common-Prefix/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0001~0099/0014.Longest-Common-Prefix.md b/website/content/ChapterFour/0001~0099/0014.Longest-Common-Prefix.md
new file mode 100644
index 000000000..c6354e451
--- /dev/null
+++ b/website/content/ChapterFour/0001~0099/0014.Longest-Common-Prefix.md
@@ -0,0 +1,65 @@
+# [14. Longest Common Prefix](https://leetcode.com/problems/longest-common-prefix/)
+
+## 题目
+
+Write a function to find the longest common prefix string amongst an array of strings.
+
+If there is no common prefix, return an empty string "".
+
+**Example 1**:
+
+ Input: strs = ["flower","flow","flight"]
+ Output: "fl"
+
+**Example 2**:
+
+ Input: strs = ["dog","racecar","car"]
+ Output: ""
+ Explanation: There is no common prefix among the input strings.
+
+**Constraints:**
+
+- 1 <= strs.length <= 200
+- 0 <= strs[i].length <= 200
+- strs[i] consists of only lower-case English letters.
+
+## 题目大意
+
+编写一个函数来查找字符串数组中的最长公共前缀。
+
+如果不存在公共前缀，返回空字符串 ""。
+
+## 解题思路
+
+- 对 strs 按照字符串长度进行升序排序，求出 strs 中长度最小字符串的长度 minLen
+- 逐个比较长度最小字符串与其它字符串中的字符，如果不相等就返回 commonPrefix,否则就把该字符加入 commonPrefix
+
+## 代码
+
+```go
+
+package leetcode
+
+func longestCommonPrefix(strs []string) string {
+ prefix := strs[0]
+
+ for i := 1; i < len(strs); i++ {
+ for j := 0; j < len(prefix); j++ {
+ if len(strs[i]) <= j || strs[i][j] != prefix[j] {
+ prefix = prefix[0:j]
+ break
+ }
+ }
+ }
+
+ return prefix
+}
+
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<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/0015.3Sum/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0001~0099/0015.3Sum.md b/website/content/ChapterFour/0001~0099/0015.3Sum.md
new file mode 100644
index 000000000..48d53acb3
--- /dev/null
+++ b/website/content/ChapterFour/0001~0099/0015.3Sum.md
@@ -0,0 +1,125 @@
+# [15. 3Sum](https://leetcode.com/problems/3sum/)
+
+## 题目
+
+Given an array nums of n integers, are there elements a, b, c in nums such that a + b + c = 0? Find all unique triplets in the array which gives the sum of zero.
+
+**Note**:
+
+The solution set must not contain duplicate triplets.
+
+**Example**:
+
+```
+
+Given array nums = [-1, 0, 1, 2, -1, -4],
+
+A solution set is:
+[
+ [-1, 0, 1],
+ [-1, -1, 2]
+]
+
+```
+
+## 题目大意
+
+给定一个数组，要求在这个数组中找出 3 个数之和为 0 的所有组合。
+
+## 解题思路
+
+用 map 提前计算好任意 2 个数字之和，保存起来，可以将时间复杂度降到 O(n^2)。这一题比较麻烦的一点在于，最后输出解的时候，要求输出不重复的解。数组中同一个数字可能出现多次，同一个数字也可能使用多次，但是最后输出解的时候，不能重复。例如 [-1，-1，2] 和 [2, -1, -1]、[-1, 2, -1] 这 3 个解是重复的，即使 -1 可能出现 100 次，每次使用的 -1 的数组下标都是不同的。
+
+这里就需要去重和排序了。map 记录每个数字出现的次数，然后对 map 的 key 数组进行排序，最后在这个排序以后的数组里面扫，找到另外 2 个数字能和自己组成 0 的组合。
+
+## 代码
+
+```go
+
+package leetcode
+
+import (
+ "sort"
+)
+
+// 解法一 最优解，双指针 + 排序
+func threeSum(nums []int) [][]int {
+ sort.Ints(nums)
+ result, start, end, index, addNum, length := make([][]int, 0), 0, 0, 0, 0, len(nums)
+ for index = 1; index < length-1; index++ {
+ start, end = 0, length-1
+ if index > 1 && nums[index] == nums[index-1] {
+ start = index - 1
+ }
+ for start < index && end > index {
+ if start > 0 && nums[start] == nums[start-1] {
+ start++
+ continue
+ }
+ if end < length-1 && nums[end] == nums[end+1] {
+ end--
+ continue
+ }
+ addNum = nums[start] + nums[end] + nums[index]
+ if addNum == 0 {
+ result = append(result, []int{nums[start], nums[index], nums[end]})
+ start++
+ end--
+ } else if addNum > 0 {
+ end--
+ } else {
+ start++
+ }
+ }
+ }
+ return result
+}
+
+// 解法二
+func threeSum1(nums []int) [][]int {
+ res := [][]int{}
+ counter := map[int]int{}
+ for _, value := range nums {
+ counter[value]++
+ }
+
+ uniqNums := []int{}
+ for key := range counter {
+ uniqNums = append(uniqNums, key)
+ }
+ sort.Ints(uniqNums)
+
+ for i := 0; i < len(uniqNums); i++ {
+ if (uniqNums[i]*3 == 0) && counter[uniqNums[i]] >= 3 {
+ res = append(res, []int{uniqNums[i], uniqNums[i], uniqNums[i]})
+ }
+ for j := i + 1; j < len(uniqNums); j++ {
+ if (uniqNums[i]*2+uniqNums[j] == 0) && counter[uniqNums[i]] > 1 {
+ res = append(res, []int{uniqNums[i], uniqNums[i], uniqNums[j]})
+ }
+ if (uniqNums[j]*2+uniqNums[i] == 0) && counter[uniqNums[j]] > 1 {
+ res = append(res, []int{uniqNums[i], uniqNums[j], uniqNums[j]})
+ }
+ c := 0 - uniqNums[i] - uniqNums[j]
+ if c > uniqNums[j] && counter[c] > 0 {
+ res = append(res, []int{uniqNums[i], uniqNums[j], c})
+ }
+ }
+ }
+ return res
+}
+
+
+
+```
+
+
+
+
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0001~0099/0014.Longest-Common-Prefix/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0001~0099/0016.3Sum-Closest/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0016.3Sum-Closest.md b/website/content/ChapterFour/0001~0099/0016.3Sum-Closest.md
similarity index 84%
rename from website/content/ChapterFour/0016.3Sum-Closest.md
rename to website/content/ChapterFour/0001~0099/0016.3Sum-Closest.md
index 19d44e56f..c98e985ad 100644
--- a/website/content/ChapterFour/0016.3Sum-Closest.md
+++ b/website/content/ChapterFour/0001~0099/0016.3Sum-Closest.md
@@ -44,6 +44,9 @@ func threeSumClosest(nums []int, target int) int {
if n > 2 {
sort.Ints(nums)
for i := 0; i < n-2; i++ {
+ if i > 0 && nums[i] == nums[i-1] {
+ continue
+ }
for j, k := i+1, n-1; j < k; {
sum := nums[i] + nums[j] + nums[k]
if abs(sum-target) < diff {
@@ -87,3 +90,10 @@ 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/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>
diff --git a/website/content/ChapterFour/0017.Letter-Combinations-of-a-Phone-Number.md b/website/content/ChapterFour/0001~0099/0017.Letter-Combinations-of-a-Phone-Number.md
similarity index 89%
rename from website/content/ChapterFour/0017.Letter-Combinations-of-a-Phone-Number.md
rename to website/content/ChapterFour/0001~0099/0017.Letter-Combinations-of-a-Phone-Number.md
index 8de0f9118..4bb0f769a 100755
--- a/website/content/ChapterFour/0017.Letter-Combinations-of-a-Phone-Number.md
+++ b/website/content/ChapterFour/0001~0099/0017.Letter-Combinations-of-a-Phone-Number.md
@@ -142,3 +142,10 @@ 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/0001~0099/0016.3Sum-Closest/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0001~0099/0018.4Sum/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0001~0099/0018.4Sum.md b/website/content/ChapterFour/0001~0099/0018.4Sum.md
new file mode 100644
index 000000000..672e26be7
--- /dev/null
+++ b/website/content/ChapterFour/0001~0099/0018.4Sum.md
@@ -0,0 +1,189 @@
+# [18. 4Sum](https://leetcode.com/problems/4sum/)
+
+## 题目
+
+Given an array nums of n integers and an integer target, are there elements a, b, c, and d in nums such that a + b + c + d = target? Find all unique quadruplets in the array which gives the sum of target.
+
+**Note**:
+
+The solution set must not contain duplicate quadruplets.
+
+**Example**:
+
+```
+
+Given array nums = [1, 0, -1, 0, -2, 2], and target = 0.
+
+A solution set is:
+[
+ [-1, 0, 0, 1],
+ [-2, -1, 1, 2],
+ [-2, 0, 0, 2]
+]
+
+```
+
+## 题目大意
+
+给定一个数组，要求在这个数组中找出 4 个数之和为 0 的所有组合。
+
+
+## 解题思路
+
+用 map 提前计算好任意 3 个数字之和，保存起来，可以将时间复杂度降到 O(n^3)。这一题比较麻烦的一点在于，最后输出解的时候，要求输出不重复的解。数组中同一个数字可能出现多次，同一个数字也可能使用多次，但是最后输出解的时候，不能重复。例如 [-1，1，2, -2] 和 [2, -1, -2, 1]、[-2, 2, -1, 1] 这 3 个解是重复的，即使 -1, -2 可能出现 100 次，每次使用的 -1, -2 的数组下标都是不同的。
+
+这一题是第 15 题的升级版，思路都是完全一致的。这里就需要去重和排序了。map 记录每个数字出现的次数，然后对 map 的 key 数组进行排序，最后在这个排序以后的数组里面扫，找到另外 3 个数字能和自己组成 0 的组合。
+
+第 15 题和第 18 题的解法一致。
+
+## 代码
+
+```go
+
+package leetcode
+
+import "sort"
+
+// 解法一 双指针
+func fourSum(nums []int, target int) (quadruplets [][]int) {
+ sort.Ints(nums)
+ n := len(nums)
+ for i := 0; i < n-3 && nums[i]+nums[i+1]+nums[i+2]+nums[i+3] <= target; i++ {
+ if i > 0 && nums[i] == nums[i-1] || nums[i]+nums[n-3]+nums[n-2]+nums[n-1] < target {
+ continue
+ }
+ for j := i + 1; j < n-2 && nums[i]+nums[j]+nums[j+1]+nums[j+2] <= target; j++ {
+ if j > i+1 && nums[j] == nums[j-1] || nums[i]+nums[j]+nums[n-2]+nums[n-1] < target {
+ continue
+ }
+ for left, right := j+1, n-1; left < right; {
+ if sum := nums[i] + nums[j] + nums[left] + nums[right]; sum == target {
+ quadruplets = append(quadruplets, []int{nums[i], nums[j], nums[left], nums[right]})
+ for left++; left < right && nums[left] == nums[left-1]; left++ {
+ }
+ for right--; left < right && nums[right] == nums[right+1]; right-- {
+ }
+ } else if sum < target {
+ left++
+ } else {
+ right--
+ }
+ }
+ }
+ }
+ return
+}
+
+// 解法二 kSum
+func fourSum1(nums []int, target int) [][]int {
+ res, cur := make([][]int, 0), make([]int, 0)
+ sort.Ints(nums)
+ kSum(nums, 0, len(nums)-1, target, 4, cur, &res)
+ return res
+}
+
+func kSum(nums []int, left, right int, target int, k int, cur []int, res *[][]int) {
+ if right-left+1 < k || k < 2 || target < nums[left]*k || target > nums[right]*k {
+ return
+ }
+ if k == 2 {
+ // 2 sum
+ twoSum(nums, left, right, target, cur, res)
+ } else {
+ for i := left; i < len(nums); i++ {
+ if i == left || (i > left && nums[i-1] != nums[i]) {
+ next := make([]int, len(cur))
+ copy(next, cur)
+ next = append(next, nums[i])
+ kSum(nums, i+1, len(nums)-1, target-nums[i], k-1, next, res)
+ }
+ }
+ }
+
+}
+
+func twoSum(nums []int, left, right int, target int, cur []int, res *[][]int) {
+ for left < right {
+ sum := nums[left] + nums[right]
+ if sum == target {
+ cur = append(cur, nums[left], nums[right])
+ temp := make([]int, len(cur))
+ copy(temp, cur)
+ *res = append(*res, temp)
+ // reset cur to previous state
+ cur = cur[:len(cur)-2]
+ left++
+ right--
+ for left < right && nums[left] == nums[left-1] {
+ left++
+ }
+ for left < right && nums[right] == nums[right+1] {
+ right--
+ }
+ } else if sum < target {
+ left++
+ } else {
+ right--
+ }
+ }
+}
+
+// 解法三
+func fourSum2(nums []int, target int) [][]int {
+ res := [][]int{}
+ counter := map[int]int{}
+ for _, value := range nums {
+ counter[value]++
+ }
+
+ uniqNums := []int{}
+ for key := range counter {
+ uniqNums = append(uniqNums, key)
+ }
+ sort.Ints(uniqNums)
+
+ for i := 0; i < len(uniqNums); i++ {
+ if (uniqNums[i]*4 == target) && counter[uniqNums[i]] >= 4 {
+ res = append(res, []int{uniqNums[i], uniqNums[i], uniqNums[i], uniqNums[i]})
+ }
+ for j := i + 1; j < len(uniqNums); j++ {
+ if (uniqNums[i]*3+uniqNums[j] == target) && counter[uniqNums[i]] > 2 {
+ res = append(res, []int{uniqNums[i], uniqNums[i], uniqNums[i], uniqNums[j]})
+ }
+ if (uniqNums[j]*3+uniqNums[i] == target) && counter[uniqNums[j]] > 2 {
+ res = append(res, []int{uniqNums[i], uniqNums[j], uniqNums[j], uniqNums[j]})
+ }
+ if (uniqNums[j]*2+uniqNums[i]*2 == target) && counter[uniqNums[j]] > 1 && counter[uniqNums[i]] > 1 {
+ res = append(res, []int{uniqNums[i], uniqNums[i], uniqNums[j], uniqNums[j]})
+ }
+ for k := j + 1; k < len(uniqNums); k++ {
+ if (uniqNums[i]*2+uniqNums[j]+uniqNums[k] == target) && counter[uniqNums[i]] > 1 {
+ res = append(res, []int{uniqNums[i], uniqNums[i], uniqNums[j], uniqNums[k]})
+ }
+ if (uniqNums[j]*2+uniqNums[i]+uniqNums[k] == target) && counter[uniqNums[j]] > 1 {
+ res = append(res, []int{uniqNums[i], uniqNums[j], uniqNums[j], uniqNums[k]})
+ }
+ if (uniqNums[k]*2+uniqNums[i]+uniqNums[j] == target) && counter[uniqNums[k]] > 1 {
+ res = append(res, []int{uniqNums[i], uniqNums[j], uniqNums[k], uniqNums[k]})
+ }
+ c := target - uniqNums[i] - uniqNums[j] - uniqNums[k]
+ if c > uniqNums[k] && counter[c] > 0 {
+ res = append(res, []int{uniqNums[i], uniqNums[j], uniqNums[k], c})
+ }
+ }
+ }
+ }
+ return res
+}
+
+
+```
+
+
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<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>
diff --git a/website/content/ChapterFour/0001~0099/0019.Remove-Nth-Node-From-End-of-List.md b/website/content/ChapterFour/0001~0099/0019.Remove-Nth-Node-From-End-of-List.md
new file mode 100644
index 000000000..0a511762f
--- /dev/null
+++ b/website/content/ChapterFour/0001~0099/0019.Remove-Nth-Node-From-End-of-List.md
@@ -0,0 +1,132 @@
+# [19. Remove Nth Node From End of List](https://leetcode.com/problems/remove-nth-node-from-end-of-list/)
+
+## 题目
+
+Given the `head` of a linked list, remove the `nth` node from the end of the list and return its head.
+
+**Follow up:** Could you do this in one pass?
+
+**Example 1:**
+
+
+
+```
+Input: head = [1,2,3,4,5], n = 2
+Output: [1,2,3,5]
+
+```
+
+**Example 2:**
+
+```
+Input: head = [1], n = 1
+Output: []
+
+```
+
+**Example 3:**
+
+```
+Input: head = [1,2], n = 1
+Output: [1]
+
+```
+
+**Constraints:**
+
+- The number of nodes in the list is `sz`.
+- `1 <= sz <= 30`
+- `0 <= Node.val <= 100`
+- `1 <= n <= sz`
+
+## 题目大意
+
+删除链表中倒数第 n 个结点。
+
+## 解题思路
+
+这道题比较简单，先循环一次拿到链表的总长度，然后循环到要删除的结点的前一个结点开始删除操作。需要注意的一个特例是，有可能要删除头结点，要单独处理。
+
+这道题有一种特别简单的解法。设置 2 个指针，一个指针距离前一个指针 n 个距离。同时移动 2 个指针，2 个指针都移动相同的距离。当一个指针移动到了终点，那么前一个指针就是倒数第 n 个节点了。
+
+## 代码
+
+```go
+package leetcode
+
+import (
+ "github.com/halfrost/leetcode-go/structures"
+)
+
+// ListNode define
+type ListNode = structures.ListNode
+
+/**
+ * Definition for singly-linked list.
+ * type ListNode struct {
+ * Val int
+ * Next *ListNode
+ * }
+ */
+
+// 解法一
+func removeNthFromEnd(head *ListNode, n int) *ListNode {
+ dummyHead := &ListNode{Next: head}
+ preSlow, slow, fast := dummyHead, head, head
+ for fast != nil {
+ if n <= 0 {
+ preSlow = slow
+ slow = slow.Next
+ }
+ n--
+ fast = fast.Next
+ }
+ preSlow.Next = slow.Next
+ return dummyHead.Next
+}
+
+// 解法二
+func removeNthFromEnd1(head *ListNode, n int) *ListNode {
+ if head == nil {
+ return nil
+ }
+ if n <= 0 {
+ return head
+ }
+ current := head
+ len := 0
+ for current != nil {
+ len++
+ current = current.Next
+ }
+ if n > len {
+ return head
+ }
+ if n == len {
+ current := head
+ head = head.Next
+ current.Next = nil
+ return head
+ }
+ current = head
+ i := 0
+ for current != nil {
+ if i == len-n-1 {
+ deleteNode := current.Next
+ current.Next = current.Next.Next
+ deleteNode.Next = nil
+ break
+ }
+ i++
+ current = current.Next
+ }
+ return head
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<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>
diff --git a/website/content/ChapterFour/0020.Valid-Parentheses.md b/website/content/ChapterFour/0001~0099/0020.Valid-Parentheses.md
similarity index 79%
rename from website/content/ChapterFour/0020.Valid-Parentheses.md
rename to website/content/ChapterFour/0001~0099/0020.Valid-Parentheses.md
index 1df3ba11a..f1a6faa2c 100644
--- a/website/content/ChapterFour/0020.Valid-Parentheses.md
+++ b/website/content/ChapterFour/0001~0099/0020.Valid-Parentheses.md
@@ -94,3 +94,10 @@ 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/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>
diff --git a/website/content/ChapterFour/0001~0099/0021.Merge-Two-Sorted-Lists.md b/website/content/ChapterFour/0001~0099/0021.Merge-Two-Sorted-Lists.md
new file mode 100644
index 000000000..76cdbff72
--- /dev/null
+++ b/website/content/ChapterFour/0001~0099/0021.Merge-Two-Sorted-Lists.md
@@ -0,0 +1,60 @@
+# [21. Merge Two Sorted Lists](https://leetcode.com/problems/merge-two-sorted-lists/)
+
+## 题目
+
+Merge two sorted linked lists and return it as a new list. The new list should be made by splicing together the nodes of the first two lists.
+
+**Example**:
+
+```
+
+Input: 1->2->4, 1->3->4
+Output: 1->1->2->3->4->4
+
+```
+
+## 题目大意
+
+合并 2 个有序链表
+
+## 解题思路
+
+按照题意做即可。
+
+## 代码
+
+```go
+
+package leetcode
+
+/**
+ * Definition for singly-linked list.
+ * type ListNode struct {
+ * Val int
+ * Next *ListNode
+ * }
+ */
+func mergeTwoLists(l1 *ListNode, l2 *ListNode) *ListNode {
+ if l1 == nil {
+ return l2
+ }
+ if l2 == nil {
+ return l1
+ }
+ if l1.Val < l2.Val {
+ l1.Next = mergeTwoLists(l1.Next, l2)
+ return l1
+ }
+ l2.Next = mergeTwoLists(l1, l2.Next)
+ return l2
+}
+
+
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<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>
diff --git a/website/content/ChapterFour/0022.Generate-Parentheses.md b/website/content/ChapterFour/0001~0099/0022.Generate-Parentheses.md
similarity index 78%
rename from website/content/ChapterFour/0022.Generate-Parentheses.md
rename to website/content/ChapterFour/0001~0099/0022.Generate-Parentheses.md
index 0e340b390..882fdd4b7 100755
--- a/website/content/ChapterFour/0022.Generate-Parentheses.md
+++ b/website/content/ChapterFour/0001~0099/0022.Generate-Parentheses.md
@@ -58,3 +58,10 @@ 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/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>
diff --git a/website/content/ChapterFour/0001~0099/0023.Merge-k-Sorted-Lists.md b/website/content/ChapterFour/0001~0099/0023.Merge-k-Sorted-Lists.md
new file mode 100644
index 000000000..d6c5ef8d8
--- /dev/null
+++ b/website/content/ChapterFour/0001~0099/0023.Merge-k-Sorted-Lists.md
@@ -0,0 +1,81 @@
+# [23. Merge k Sorted Lists](https://leetcode.com/problems/merge-k-sorted-lists/)
+
+## 题目
+
+Merge k sorted linked lists and return it as one sorted list. Analyze and describe its complexity.
+
+
+
+**Example**:
+
+```
+
+Input:
+[
+ 1->4->5,
+ 1->3->4,
+ 2->6
+]
+Output: 1->1->2->3->4->4->5->6
+
+```
+
+## 题目大意
+
+合并 K 个有序链表
+
+## 解题思路
+
+借助分治的思想，把 K 个有序链表两两合并即可。相当于是第 21 题的加强版。
+
+## 代码
+
+```go
+
+package leetcode
+
+/**
+ * Definition for singly-linked list.
+ * type ListNode struct {
+ * Val int
+ * Next *ListNode
+ * }
+ */
+func mergeKLists(lists []*ListNode) *ListNode {
+ length := len(lists)
+ if length < 1 {
+ return nil
+ }
+ if length == 1 {
+ return lists[0]
+ }
+ num := length / 2
+ left := mergeKLists(lists[:num])
+ right := mergeKLists(lists[num:])
+ return mergeTwoLists1(left, right)
+}
+
+func mergeTwoLists1(l1 *ListNode, l2 *ListNode) *ListNode {
+ if l1 == nil {
+ return l2
+ }
+ if l2 == nil {
+ return l1
+ }
+ if l1.Val < l2.Val {
+ l1.Next = mergeTwoLists1(l1.Next, l2)
+ return l1
+ }
+ l2.Next = mergeTwoLists1(l1, l2.Next)
+ return l2
+}
+
+
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<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>
diff --git a/website/content/ChapterFour/0001~0099/0024.Swap-Nodes-in-Pairs.md b/website/content/ChapterFour/0001~0099/0024.Swap-Nodes-in-Pairs.md
new file mode 100644
index 000000000..460110543
--- /dev/null
+++ b/website/content/ChapterFour/0001~0099/0024.Swap-Nodes-in-Pairs.md
@@ -0,0 +1,65 @@
+# [24. Swap Nodes in Pairs](https://leetcode.com/problems/swap-nodes-in-pairs/description/)
+
+## 题目
+
+Given a linked list, swap every two adjacent nodes and return its head.
+
+You may not modify the values in the list's nodes, only nodes itself may be changed.
+
+
+
+**Example**:
+
+```
+
+Given 1->2->3->4, you should return the list as 2->1->4->3.
+
+```
+
+## 题目大意
+
+两两相邻的元素，翻转链表
+
+## 解题思路
+
+按照题意做即可。
+
+## 代码
+
+```go
+
+package leetcode
+
+import (
+ "github.com/halfrost/leetcode-go/structures"
+)
+
+// ListNode define
+type ListNode = structures.ListNode
+
+/**
+ * Definition for singly-linked list.
+ * type ListNode struct {
+ * Val int
+ * Next *ListNode
+ * }
+ */
+
+func swapPairs(head *ListNode) *ListNode {
+ dummy := &ListNode{Next: head}
+ for pt := dummy; pt != nil && pt.Next != nil && pt.Next.Next != nil; {
+ pt, pt.Next, pt.Next.Next, pt.Next.Next.Next = pt.Next, pt.Next.Next, pt.Next.Next.Next, pt.Next
+ }
+ return dummy.Next
+}
+
+
+
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<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>
diff --git a/website/content/ChapterFour/0025.Reverse-Nodes-in-k-Group.md b/website/content/ChapterFour/0001~0099/0025.Reverse-Nodes-in-k-Group.md
similarity index 80%
rename from website/content/ChapterFour/0025.Reverse-Nodes-in-k-Group.md
rename to website/content/ChapterFour/0001~0099/0025.Reverse-Nodes-in-k-Group.md
index 8d6ba27ae..417548b9a 100644
--- a/website/content/ChapterFour/0025.Reverse-Nodes-in-k-Group.md
+++ b/website/content/ChapterFour/0001~0099/0025.Reverse-Nodes-in-k-Group.md
@@ -72,3 +72,10 @@ 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/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>
diff --git a/website/content/ChapterFour/0026.Remove-Duplicates-from-Sorted-Array.md b/website/content/ChapterFour/0001~0099/0026.Remove-Duplicates-from-Sorted-Array.md
similarity index 88%
rename from website/content/ChapterFour/0026.Remove-Duplicates-from-Sorted-Array.md
rename to website/content/ChapterFour/0001~0099/0026.Remove-Duplicates-from-Sorted-Array.md
index b7f1b4793..6d6034249 100644
--- a/website/content/ChapterFour/0026.Remove-Duplicates-from-Sorted-Array.md
+++ b/website/content/ChapterFour/0001~0099/0026.Remove-Duplicates-from-Sorted-Array.md
@@ -126,3 +126,10 @@ 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/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>
diff --git a/website/content/ChapterFour/0027.Remove-Element.md b/website/content/ChapterFour/0001~0099/0027.Remove-Element.md
similarity index 84%
rename from website/content/ChapterFour/0027.Remove-Element.md
rename to website/content/ChapterFour/0001~0099/0027.Remove-Element.md
index d3ddc59dd..ef1a75df3 100644
--- a/website/content/ChapterFour/0027.Remove-Element.md
+++ b/website/content/ChapterFour/0001~0099/0027.Remove-Element.md
@@ -80,10 +80,8 @@ func removeElement(nums []int, val int) int {
if nums[i] != val {
if i != j {
nums[i], nums[j] = nums[j], nums[i]
- j++
- } else {
- j++
}
+ j++
}
}
return j
@@ -91,3 +89,10 @@ 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/0001~0099/0026.Remove-Duplicates-from-Sorted-Array/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0001~0099/0028.Find-the-Index-of-the-First-Occurrence-in-a-String/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0001~0099/0028.Find-the-Index-of-the-First-Occurrence-in-a-String.md b/website/content/ChapterFour/0001~0099/0028.Find-the-Index-of-the-First-Occurrence-in-a-String.md
new file mode 100644
index 000000000..ee3577638
--- /dev/null
+++ b/website/content/ChapterFour/0001~0099/0028.Find-the-Index-of-the-First-Occurrence-in-a-String.md
@@ -0,0 +1,93 @@
+# [28. Find the Index of the First Occurrence in a String](https://leetcode.com/problems/find-the-index-of-the-first-occurrence-in-a-string/)
+
+## 题目
+
+Implement strStr().
+
+Return the index of the first occurrence of needle in haystack, or -1 if needle is not part of haystack.
+
+
+**Example 1**:
+
+```
+
+Input: haystack = "hello", needle = "ll"
+Output: 2
+
+```
+
+**Example 2**:
+
+```
+
+Input: haystack = "aaaaa", needle = "bba"
+Output: -1
+
+```
+
+**Clarification**:
+
+What should we return when needle is an empty string? This is a great question to ask during an interview.
+
+For the purpose of this problem, we will return 0 when needle is an empty string. This is consistent to C's strstr() and Java's indexOf().
+
+## 题目大意
+
+
+实现一个查找 substring 的函数。如果在母串中找到了子串，返回子串在母串中出现的下标，如果没有找到，返回 -1，如果子串是空串，则返回 0 。
+
+## 解题思路
+
+这一题比较简单，直接写即可。
+
+## 代码
+
+```go
+
+package leetcode
+
+import "strings"
+
+// 解法一
+func strStr(haystack string, needle string) int {
+ for i := 0; ; i++ {
+ for j := 0; ; j++ {
+ if j == len(needle) {
+ return i
+ }
+ if i+j == len(haystack) {
+ return -1
+ }
+ if needle[j] != haystack[i+j] {
+ break
+ }
+ }
+ }
+}
+
+// 解法二
+func strStr1(haystack string, needle string) int {
+ return strings.Index(haystack, needle)
+}
+
+
+```
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<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>
diff --git a/website/content/ChapterFour/0029.Divide-Two-Integers.md b/website/content/ChapterFour/0001~0099/0029.Divide-Two-Integers.md
similarity index 91%
rename from website/content/ChapterFour/0029.Divide-Two-Integers.md
rename to website/content/ChapterFour/0001~0099/0029.Divide-Two-Integers.md
index c3f4a834d..72f2e1062 100755
--- a/website/content/ChapterFour/0029.Divide-Two-Integers.md
+++ b/website/content/ChapterFour/0001~0099/0029.Divide-Two-Integers.md
@@ -146,3 +146,10 @@ 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/0001~0099/0028.Find-the-Index-of-the-First-Occurrence-in-a-String/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0001~0099/0030.Substring-with-Concatenation-of-All-Words/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0030.Substring-with-Concatenation-of-All-Words.md b/website/content/ChapterFour/0001~0099/0030.Substring-with-Concatenation-of-All-Words.md
similarity index 88%
rename from website/content/ChapterFour/0030.Substring-with-Concatenation-of-All-Words.md
rename to website/content/ChapterFour/0001~0099/0030.Substring-with-Concatenation-of-All-Words.md
index d4eb4ef05..00b3a0e0d 100644
--- a/website/content/ChapterFour/0030.Substring-with-Concatenation-of-All-Words.md
+++ b/website/content/ChapterFour/0001~0099/0030.Substring-with-Concatenation-of-All-Words.md
@@ -96,3 +96,10 @@ 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/0001~0099/0029.Divide-Two-Integers/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0001~0099/0031.Next-Permutation/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0001~0099/0031.Next-Permutation.md b/website/content/ChapterFour/0001~0099/0031.Next-Permutation.md
new file mode 100644
index 000000000..4689e75ba
--- /dev/null
+++ b/website/content/ChapterFour/0001~0099/0031.Next-Permutation.md
@@ -0,0 +1,138 @@
+# [31. Next Permutation](https://leetcode.com/problems/next-permutation/)
+
+
+## 题目
+
+Implement **next permutation**, which rearranges numbers into the lexicographically next greater permutation of numbers.
+
+If such an arrangement is not possible, it must rearrange it as the lowest possible order (i.e., sorted in ascending order).
+
+The replacement must be **[in place](http://en.wikipedia.org/wiki/In-place_algorithm)** and use only constant extra memory.
+
+**Example 1:**
+
+```
+Input: nums = [1,2,3]
+Output: [1,3,2]
+```
+
+**Example 2:**
+
+```
+Input: nums = [3,2,1]
+Output: [1,2,3]
+```
+
+**Example 3:**
+
+```
+Input: nums = [1,1,5]
+Output: [1,5,1]
+```
+
+**Example 4:**
+
+```
+Input: nums = [1]
+Output: [1]
+```
+
+**Constraints:**
+
+- `1 <= nums.length <= 100`
+- `0 <= nums[i] <= 100`
+
+## 题目大意
+
+实现获取 下一个排列 的函数，算法需要将给定数字序列重新排列成字典序中下一个更大的排列。如果不存在下一个更大的排列，则将数字重新排列成最小的排列（即升序排列）。必须 原地 修改，只允许使用额外常数空间。
+
+## 解题思路
+
+- 题目有 3 个问题需要解决。如何找到下一个排列。不存在下一个排列的时候如何生成最小的排列。如何原地修改。先解决第一个问题，如何找到下一个排列。下一个排列是找到一个大于当前排序的字典序，且变大的幅度最小。那么只能将较小的数与较大数做一次原地交换。并且较小数的下标要尽量靠右，较大数也要尽可能小。原地交换以后，还需要将较大数右边的数按照升序重新排列。这样交换以后，才能生成下一个排列。以排列 [8,9,6,10,7,2] 为例：能找到的符合条件的一对「较小数」与「较大数」的组合为 6 与 7，满足「较小数」尽量靠右，而「较大数」尽可能小。当完成交换后排列变为 [8,9,7,10,6,2]，此时我们可以重排「较小数」右边的序列，序列变为 [8,9,7,2,6,10]。
+- 第一步：在 `nums[i]` 中找到 `i` 使得 `nums[i] < nums[i+1]`，此时较小数为 `nums[i]`，并且 `[i+1, n)` 一定为下降区间。第二步：如果找到了这样的 `i` ，则在下降区间 `[i+1, n)` 中从后往前找到第一个 `j` ，使得 `nums[i] < nums[j]` ，此时较大数为 `nums[j]`。第三步，交换 `nums[i]` 和 `nums[j]`，此时区间 `[i+1, n)` 一定为降序区间。最后原地交换 `[i+1, n)` 区间内的元素，使其变为升序，无需对该区间进行排序。
+- 如果第一步找不到符合条件的下标 `i`，说明当前序列已经是一个最大的排列。那么应该直接执行第三步，生成最小的排列。
+
+## 代码
+
+```go
+package leetcode
+
+// 解法一
+func nextPermutation(nums []int) {
+ i, j := 0, 0
+ for i = len(nums) - 2; i >= 0; i-- {
+ if nums[i] < nums[i+1] {
+ break
+ }
+ }
+ if i >= 0 {
+ for j = len(nums) - 1; j > i; j-- {
+ if nums[j] > nums[i] {
+ break
+ }
+ }
+ swap(&nums, i, j)
+ }
+ reverse(&nums, i+1, len(nums)-1)
+}
+
+func reverse(nums *[]int, i, j int) {
+ for i < j {
+ swap(nums, i, j)
+ i++
+ j--
+ }
+}
+
+func swap(nums *[]int, i, j int) {
+ (*nums)[i], (*nums)[j] = (*nums)[j], (*nums)[i]
+}
+
+// 解法二
+// [2,(3),6,5,4,1] -> 2,(4),6,5,(3),1 -> 2,4, 1,3,5,6
+func nextPermutation1(nums []int) {
+ var n = len(nums)
+ var pIdx = checkPermutationPossibility(nums)
+ if pIdx == -1 {
+ reverse(&nums, 0, n-1)
+ return
+ }
+
+ var rp = len(nums) - 1
+ // start from right most to leftward,find the first number which is larger than PIVOT
+ for rp > 0 {
+ if nums[rp] > nums[pIdx] {
+ swap(&nums, pIdx, rp)
+ break
+ } else {
+ rp--
+ }
+ }
+ // Finally, Reverse all elements which are right from pivot
+ reverse(&nums, pIdx+1, n-1)
+}
+
+// checkPermutationPossibility returns 1st occurrence Index where
+// value is in decreasing order(from right to left)
+// returns -1 if not found(it's already in its last permutation)
+func checkPermutationPossibility(nums []int) (idx int) {
+ // search right to left for 1st number(from right) that is not in increasing order
+ var rp = len(nums) - 1
+ for rp > 0 {
+ if nums[rp-1] < nums[rp] {
+ idx = rp - 1
+ return idx
+ }
+ rp--
+ }
+ return -1
+}
+
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<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/0032.Longest-Valid-Parentheses/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0001~0099/0032.Longest-Valid-Parentheses.md b/website/content/ChapterFour/0001~0099/0032.Longest-Valid-Parentheses.md
new file mode 100644
index 000000000..db8cb726b
--- /dev/null
+++ b/website/content/ChapterFour/0001~0099/0032.Longest-Valid-Parentheses.md
@@ -0,0 +1,115 @@
+# [32. Longest Valid Parentheses](https://leetcode.com/problems/longest-valid-parentheses/)
+
+
+## 题目
+
+Given a string containing just the characters `'('` and `')'`, find the length of the longest valid (well-formed) parentheses substring.
+
+**Example 1:**
+
+```
+Input: s = "(()"
+Output: 2
+Explanation: The longest valid parentheses substring is "()".
+```
+
+**Example 2:**
+
+```
+Input: s = ")()())"
+Output: 4
+Explanation: The longest valid parentheses substring is "()()".
+```
+
+**Example 3:**
+
+```
+Input: s = ""
+Output: 0
+```
+
+**Constraints:**
+
+- `0 <= s.length <= 3 * 104`
+- `s[i]` is `'('`, or `')'`.
+
+## 题目大意
+
+给你一个只包含 '(' 和 ')' 的字符串，找出最长有效（格式正确且连续）括号子串的长度。
+
+## 解题思路
+
+- 提到括号匹配，第一时间能让人想到的就是利用栈。这里需要计算嵌套括号的总长度，所以栈里面不能单纯的存左括号，而应该存左括号在原字符串的下标，这样通过下标相减可以获取长度。那么栈如果是非空，栈底永远存的是当前遍历过的字符串中**上一个没有被匹配的右括号的下标**。**上一个没有被匹配的右括号的下标**可以理解为每段括号匹配之间的“隔板”。例如，`())((()))`，第三个右括号，即为左右 2 段正确的括号匹配中间的“隔板”。“隔板”的存在影响计算最长括号长度。如果不存在“隔板”，前后 2 段正确的括号匹配应该“融合”在一起，最长长度为 `2 + 6 = 8`，但是这里存在了“隔板”，所以最长长度仅为 `6`。
+- 具体算法实现，遇到每个 `'('` ，将它的下标压入栈中。对于遇到的每个 `')'`，先弹出栈顶元素表示匹配了当前右括号。如果栈为空，说明当前的右括号为没有被匹配的右括号，于是将其下标放入栈中来更新**上一个没有被匹配的右括号的下标**。如果栈不为空，当前右括号的下标减去栈顶元素即为以该右括号为结尾的最长有效括号的长度。需要注意初始化时，不存在**上一个没有被匹配的右括号的下标**，那么将 `-1` 放入栈中，充当下标为 `0` 的“隔板”。时间复杂度 O(n)，空间复杂度 O(n)。
+- 在栈的方法中，实际用到的元素仅仅是栈底的**上一个没有被匹配的右括号的下标**。那么考虑能否把这个值存在一个变量中，这样可以省去栈 O(n) 的时间复杂度。利用两个计数器 left 和 right 。首先，从左到右遍历字符串，每当遇到 `'('`，增加 left 计数器，每当遇到 `')'` ，增加 right 计数器。每当 left 计数器与 right 计数器相等时，计算当前有效字符串的长度，并且记录目前为止找到的最长子字符串。当 right 计数器比 left 计数器大时，说明括号不匹配，于是将 left 和 right 计数器同时变回 0。这样的做法利用了贪心的思想，考虑了以当前字符下标结尾的有效括号长度，每次当右括号数量多于左括号数量的时候之前的字符就扔掉不再考虑，重新从下一个字符开始计算。
+- 但上面的做法会漏掉一种情况，就是遍历的时候左括号的数量始终大于右括号的数量，即 `(()` ，这种时候最长有效括号是求不出来的。解决办法是反向再计算一遍，如果从右往左计算，`(()` 先计算匹配的括号，最后只剩下 `'('`，这样依旧可以算出最长匹配的括号长度。反过来计算的方法和上述从左往右计算的方法一致：当 left 计数器比 right 计数器大时，将 left 和 right 计数器同时变回 0；当 left 计数器与 right 计数器相等时，计算当前有效字符串的长度，并且记录目前为止找到的最长子字符串。这种方法的时间复杂度是 O(n)，空间复杂度 O(1)。
+
+## 代码
+
+```go
+package leetcode
+
+// 解法一 栈
+func longestValidParentheses(s string) int {
+ stack, res := []int{}, 0
+ stack = append(stack, -1)
+ for i := 0; i < len(s); i++ {
+ if s[i] == '(' {
+ stack = append(stack, i)
+ } else {
+ stack = stack[:len(stack)-1]
+ if len(stack) == 0 {
+ stack = append(stack, i)
+ } else {
+ res = max(res, i-stack[len(stack)-1])
+ }
+ }
+ }
+ return res
+}
+
+func max(a, b int) int {
+ if a > b {
+ return a
+ }
+ return b
+}
+
+// 解法二 双指针
+func longestValidParentheses1(s string) int {
+ left, right, maxLength := 0, 0, 0
+ for i := 0; i < len(s); i++ {
+ if s[i] == '(' {
+ left++
+ } else {
+ right++
+ }
+ if left == right {
+ maxLength = max(maxLength, 2*right)
+ } else if right > left {
+ left, right = 0, 0
+ }
+ }
+ left, right = 0, 0
+ for i := len(s) - 1; i >= 0; i-- {
+ if s[i] == '(' {
+ left++
+ } else {
+ right++
+ }
+ if left == right {
+ maxLength = max(maxLength, 2*left)
+ } else if left > right {
+ left, right = 0, 0
+ }
+ }
+ return maxLength
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0001~0099/0031.Next-Permutation/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0001~0099/0033.Search-in-Rotated-Sorted-Array/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0033.Search-in-Rotated-Sorted-Array.md b/website/content/ChapterFour/0001~0099/0033.Search-in-Rotated-Sorted-Array.md
similarity index 87%
rename from website/content/ChapterFour/0033.Search-in-Rotated-Sorted-Array.md
rename to website/content/ChapterFour/0001~0099/0033.Search-in-Rotated-Sorted-Array.md
index ac935c4d7..df41f1251 100755
--- a/website/content/ChapterFour/0033.Search-in-Rotated-Sorted-Array.md
+++ b/website/content/ChapterFour/0001~0099/0033.Search-in-Rotated-Sorted-Array.md
@@ -76,3 +76,10 @@ 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/0001~0099/0032.Longest-Valid-Parentheses/">⬅️上一页</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>
diff --git a/website/content/ChapterFour/0034.Find-First-and-Last-Position-of-Element-in-Sorted-Array.md b/website/content/ChapterFour/0001~0099/0034.Find-First-and-Last-Position-of-Element-in-Sorted-Array.md
similarity index 90%
rename from website/content/ChapterFour/0034.Find-First-and-Last-Position-of-Element-in-Sorted-Array.md
rename to website/content/ChapterFour/0001~0099/0034.Find-First-and-Last-Position-of-Element-in-Sorted-Array.md
index 6d9912860..bed0481ab 100755
--- a/website/content/ChapterFour/0034.Find-First-and-Last-Position-of-Element-in-Sorted-Array.md
+++ b/website/content/ChapterFour/0001~0099/0034.Find-First-and-Last-Position-of-Element-in-Sorted-Array.md
@@ -119,3 +119,10 @@ 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/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>
diff --git a/website/content/ChapterFour/0035.Search-Insert-Position.md b/website/content/ChapterFour/0001~0099/0035.Search-Insert-Position.md
similarity index 76%
rename from website/content/ChapterFour/0035.Search-Insert-Position.md
rename to website/content/ChapterFour/0001~0099/0035.Search-Insert-Position.md
index 18339f1e9..ec99aca71 100755
--- a/website/content/ChapterFour/0035.Search-Insert-Position.md
+++ b/website/content/ChapterFour/0001~0099/0035.Search-Insert-Position.md
@@ -63,3 +63,10 @@ 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/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>
diff --git a/website/content/ChapterFour/0036.Valid-Sudoku.md b/website/content/ChapterFour/0001~0099/0036.Valid-Sudoku.md
similarity index 92%
rename from website/content/ChapterFour/0036.Valid-Sudoku.md
rename to website/content/ChapterFour/0001~0099/0036.Valid-Sudoku.md
index 72e8ba470..68ad64cd1 100755
--- a/website/content/ChapterFour/0036.Valid-Sudoku.md
+++ b/website/content/ChapterFour/0001~0099/0036.Valid-Sudoku.md
@@ -166,3 +166,10 @@ 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/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>
diff --git a/website/content/ChapterFour/0037.Sudoku-Solver.md b/website/content/ChapterFour/0001~0099/0037.Sudoku-Solver.md
similarity index 89%
rename from website/content/ChapterFour/0037.Sudoku-Solver.md
rename to website/content/ChapterFour/0001~0099/0037.Sudoku-Solver.md
index 724076d32..541b4efcf 100755
--- a/website/content/ChapterFour/0037.Sudoku-Solver.md
+++ b/website/content/ChapterFour/0001~0099/0037.Sudoku-Solver.md
@@ -116,3 +116,10 @@ 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/0001~0099/0036.Valid-Sudoku/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0001~0099/0039.Combination-Sum/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0039.Combination-Sum.md b/website/content/ChapterFour/0001~0099/0039.Combination-Sum.md
similarity index 84%
rename from website/content/ChapterFour/0039.Combination-Sum.md
rename to website/content/ChapterFour/0001~0099/0039.Combination-Sum.md
index 6167df458..4681f48b6 100755
--- a/website/content/ChapterFour/0039.Combination-Sum.md
+++ b/website/content/ChapterFour/0001~0099/0039.Combination-Sum.md
@@ -85,3 +85,10 @@ 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/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>
diff --git a/website/content/ChapterFour/0040.Combination-Sum-II.md b/website/content/ChapterFour/0001~0099/0040.Combination-Sum-II.md
similarity index 84%
rename from website/content/ChapterFour/0040.Combination-Sum-II.md
rename to website/content/ChapterFour/0001~0099/0040.Combination-Sum-II.md
index 9d0188a33..aa46f3f10 100755
--- a/website/content/ChapterFour/0040.Combination-Sum-II.md
+++ b/website/content/ChapterFour/0001~0099/0040.Combination-Sum-II.md
@@ -45,7 +45,7 @@ candidates 中的每个数字在每个组合中只能使用一次。
## 解题思路
- 题目要求出总和为 sum 的所有组合，组合需要去重。这一题是第 39 题的加强版，第 39 题中元素可以重复利用(重复元素可无限次使用)，这一题中元素只能有限次数的利用，因为存在重复元素，并且每个元素只能用一次(重复元素只能使用有限次)
-- 这一题和第 47 题类似，只不过元素可以反复使用。
+- 这一题和第 47 题类似。
## 代码
@@ -87,3 +87,10 @@ 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/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>
diff --git a/website/content/ChapterFour/0001~0099/0041.First-Missing-Positive.md b/website/content/ChapterFour/0001~0099/0041.First-Missing-Positive.md
new file mode 100644
index 000000000..6ab60da34
--- /dev/null
+++ b/website/content/ChapterFour/0001~0099/0041.First-Missing-Positive.md
@@ -0,0 +1,73 @@
+# [41. First Missing Positive](https://leetcode.com/problems/first-missing-positive/description/)
+
+## 题目
+
+Given an unsorted integer array, find the smallest missing positive integer.
+
+**Example 1**:
+
+```
+
+Input: [1,2,0]
+Output: 3
+
+```
+
+**Example 2**:
+
+```
+
+Input: [3,4,-1,1]
+Output: 2
+
+```
+
+**Example 3**:
+
+```
+
+Input: [7,8,9,11,12]
+Output: 1
+
+```
+
+**Note**:
+
+Your algorithm should run in O(n) time and uses constant extra space.
+
+## 题目大意
+
+找到缺失的第一个正整数。
+
+## 解题思路
+
+
+为了减少时间复杂度，可以把 input 数组都装到 map 中，然后 i 循环从 1 开始，依次比对 map 中是否存在 i，只要不存在 i 就立即返回结果，即所求。
+
+## 代码
+
+```go
+
+package leetcode
+
+func firstMissingPositive(nums []int) int {
+ numMap := make(map[int]int, len(nums))
+ for _, v := range nums {
+ numMap[v] = v
+ }
+ for index := 1; index < len(nums)+1; index++ {
+ if _, ok := numMap[index]; !ok {
+ return index
+ }
+ }
+ return len(nums) + 1
+}
+
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<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>
diff --git a/website/content/ChapterFour/0001~0099/0042.Trapping-Rain-Water.md b/website/content/ChapterFour/0001~0099/0042.Trapping-Rain-Water.md
new file mode 100644
index 000000000..be6a256ef
--- /dev/null
+++ b/website/content/ChapterFour/0001~0099/0042.Trapping-Rain-Water.md
@@ -0,0 +1,68 @@
+# [42. Trapping Rain Water](https://leetcode.com/problems/trapping-rain-water/)
+
+## 题目
+
+Given n non-negative integers representing an elevation map where the width of each bar is 1, compute how much water it is able to trap after raining.
+
+
+
+
+The above elevation map is represented by array [0,1,0,2,1,0,1,3,2,1,2,1]. In this case, 6 units of rain water (blue section) are being trapped. Thanks Marcos for contributing this image!
+
+
+**Example**:
+
+```go
+Input: [0,1,0,2,1,0,1,3,2,1,2,1]
+Output: 6
+```
+
+## 题目大意
+
+从 x 轴开始，给出一个数组，数组里面的数字代表从 (0,0) 点开始，宽度为 1 个单位，高度为数组元素的值。如果下雨了，问这样一个容器能装多少单位的水？
+
+## 解题思路
+
+- 每个数组里面的元素值可以想象成一个左右都有壁的圆柱筒。例如下图中左边的第二个元素 1，当前左边最大的元素是 2 ，所以 2 高度的水会装到 1 的上面(因为想象成了左右都有筒壁)。这道题的思路就是左指针从 0 开始往右扫，右指针从最右边开始往左扫。额外还需要 2 个变量分别记住左边最大的高度和右边最大高度。遍历扫数组元素的过程中，如果左指针的高度比右指针的高度小，就不断的移动左指针，否则移动右指针。循环的终止条件就是左右指针碰上以后就结束。只要数组中元素的高度比保存的局部最大高度小，就累加 res 的值，否则更新局部最大高度。最终解就是 res 的值。
+ 
+- 抽象一下，本题是想求针对每个 i，找到它左边最大值 leftMax，右边的最大值 rightMax，然后 min(leftMax，rightMax) 为能够接到水的高度。left 和 right 指针是两边往中间移动的游标指针。最傻的解题思路是针对每个下标 i，往左循环找到第一个最大值，往右循环找到第一个最大值，然后把这两个最大值取出最小者，即为当前雨水的高度。这样做时间复杂度高，浪费了很多循环。i 在从左往右的过程中，是可以动态维护最大值的。右边的最大值用右边的游标指针来维护。从左往右扫一遍下标，和，从两边往中间遍历一遍下标，是相同的结果，每个下标都遍历了一次。
+ 
+- 每个 i 的宽度固定为 1，所以每个“坑”只需要求出高度，即当前这个“坑”能积攒的雨水。最后依次将每个“坑”中的雨水相加即是能接到的雨水数。
+ 
+
+## 代码
+
+```go
+package leetcode
+
+func trap(height []int) int {
+ res, left, right, maxLeft, maxRight := 0, 0, len(height)-1, 0, 0
+ for left <= right {
+ if height[left] <= height[right] {
+ if height[left] > maxLeft {
+ maxLeft = height[left]
+ } else {
+ res += maxLeft - height[left]
+ }
+ left++
+ } else {
+ if height[right] >= maxRight {
+ maxRight = height[right]
+ } else {
+ res += maxRight - height[right]
+ }
+ right--
+ }
+ }
+ return res
+}
+```
+
+
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<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/0043.Multiply-Strings/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0001~0099/0043.Multiply-Strings.md b/website/content/ChapterFour/0001~0099/0043.Multiply-Strings.md
new file mode 100644
index 000000000..b807342cf
--- /dev/null
+++ b/website/content/ChapterFour/0001~0099/0043.Multiply-Strings.md
@@ -0,0 +1,73 @@
+# [43. Multiply Strings](https://leetcode.com/problems/multiply-strings/)
+
+
+## 题目
+
+Given two non-negative integers `num1` and `num2` represented as strings, return the product of `num1` and `num2`, also represented as a string.
+
+**Note:** You must not use any built-in BigInteger library or convert the inputs to integer directly.
+
+**Example 1:**
+
+```
+Input: num1 = "2", num2 = "3"
+Output: "6"
+```
+
+**Example 2:**
+
+```
+Input: num1 = "123", num2 = "456"
+Output: "56088"
+```
+
+**Constraints:**
+
+- `1 <= num1.length, num2.length <= 200`
+- `num1` and `num2` consist of digits only.
+- Both `num1` and `num2` do not contain any leading zero, except the number `0` itself.
+
+## 题目大意
+
+给定两个以字符串形式表示的非负整数 num1 和 num2，返回 num1 和 num2 的乘积，它们的乘积也表示为字符串形式。
+
+## 解题思路
+
+- 用数组模拟乘法。创建一个数组长度为 `len(num1) + len(num2)` 的数组用于存储乘积。对于任意 `0 ≤ i < len(num1)`，`0 ≤ j < len(num2)`，`num1[i] * num2[j]` 的结果位于 `tmp[i+j+1]`，如果 `tmp[i+j+1]≥10`，则将进位部分加到 `tmp[i+j]`。最后，将数组 `tmp` 转成字符串，如果最高位是 0 则舍弃最高位。
+
+## 代码
+
+```go
+package leetcode
+
+func multiply(num1 string, num2 string) string {
+ if num1 == "0" || num2 == "0" {
+ return "0"
+ }
+ b1, b2, tmp := []byte(num1), []byte(num2), make([]int, len(num1)+len(num2))
+ for i := 0; i < len(b1); i++ {
+ for j := 0; j < len(b2); j++ {
+ tmp[i+j+1] += int(b1[i]-'0') * int(b2[j]-'0')
+ }
+ }
+ for i := len(tmp) - 1; i > 0; i-- {
+ tmp[i-1] += tmp[i] / 10
+ tmp[i] = tmp[i] % 10
+ }
+ if tmp[0] == 0 {
+ tmp = tmp[1:]
+ }
+ res := make([]byte, len(tmp))
+ for i := 0; i < len(tmp); i++ {
+ res[i] = '0' + byte(tmp[i])
+ }
+ return string(res)
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<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/0045.Jump-Game-II/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0001~0099/0045.Jump-Game-II.md b/website/content/ChapterFour/0001~0099/0045.Jump-Game-II.md
new file mode 100644
index 000000000..fc910ad23
--- /dev/null
+++ b/website/content/ChapterFour/0001~0099/0045.Jump-Game-II.md
@@ -0,0 +1,74 @@
+# [45. Jump Game II](https://leetcode.com/problems/jump-game-ii/)
+
+
+## 题目
+
+Given an array of non-negative integers `nums`, you are initially positioned at the first index of the array.
+
+Each element in the array represents your maximum jump length at that position.
+
+Your goal is to reach the last index in the minimum number of jumps.
+
+You can assume that you can always reach the last index.
+
+**Example 1:**
+
+```
+Input: nums = [2,3,1,1,4]
+Output: 2
+Explanation: The minimum number of jumps to reach the last index is 2. Jump 1 step from index 0 to 1, then 3 steps to the last index.
+```
+
+**Example 2:**
+
+```
+Input: nums = [2,3,0,1,4]
+Output: 2
+```
+
+**Constraints:**
+
+- `1 <= nums.length <= 1000`
+- `0 <= nums[i] <= 10^5`
+
+## 题目大意
+
+给定一个非负整数数组，你最初位于数组的第一个位置。数组中的每个元素代表你在该位置可以跳跃的最大长度。你的目标是使用最少的跳跃次数到达数组的最后一个位置。
+
+## 解题思路
+
+- 要求找到最少跳跃次数，顺理成章的会想到用贪心算法解题。扫描步数数组，维护当前能够到达最大下标的位置，记为能到达的最远边界，如果扫描过程中到达了最远边界，更新边界并将跳跃次数 + 1。
+- 扫描数组的时候，其实不需要扫描最后一个元素，因为在跳到最后一个元素之前，能到达的最远边界一定大于等于最后一个元素的位置，不然就跳不到最后一个元素，到达不了终点了；如果遍历到最后一个元素，说明边界正好为最后一个位置，最终跳跃次数直接 + 1 即可，也不需要访问最后一个元素。
+
+## 代码
+
+```go
+package leetcode
+
+func jump(nums []int) int {
+ if len(nums) == 1 {
+ return 0
+ }
+ needChoose, canReach, step := 0, 0, 0
+ for i, x := range nums {
+ if i+x > canReach {
+ canReach = i + x
+ if canReach >= len(nums)-1 {
+ return step + 1
+ }
+ }
+ if i == needChoose {
+ needChoose = canReach
+ step++
+ }
+ }
+ return step
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0001~0099/0043.Multiply-Strings/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0001~0099/0046.Permutations/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0046.Permutations.md b/website/content/ChapterFour/0001~0099/0046.Permutations.md
similarity index 75%
rename from website/content/ChapterFour/0046.Permutations.md
rename to website/content/ChapterFour/0001~0099/0046.Permutations.md
index 6ddd55f4d..54fceeeb0 100755
--- a/website/content/ChapterFour/0046.Permutations.md
+++ b/website/content/ChapterFour/0001~0099/0046.Permutations.md
@@ -64,3 +64,10 @@ 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/0001~0099/0045.Jump-Game-II/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0001~0099/0047.Permutations-II/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0047.Permutations-II.md b/website/content/ChapterFour/0001~0099/0047.Permutations-II.md
similarity index 81%
rename from website/content/ChapterFour/0047.Permutations-II.md
rename to website/content/ChapterFour/0001~0099/0047.Permutations-II.md
index ff63b6876..e6aaccdff 100755
--- a/website/content/ChapterFour/0047.Permutations-II.md
+++ b/website/content/ChapterFour/0001~0099/0047.Permutations-II.md
@@ -68,3 +68,10 @@ 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/0001~0099/0046.Permutations/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0001~0099/0048.Rotate-Image/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0001~0099/0048.Rotate-Image.md b/website/content/ChapterFour/0001~0099/0048.Rotate-Image.md
new file mode 100755
index 000000000..4e7a4e0ce
--- /dev/null
+++ b/website/content/ChapterFour/0001~0099/0048.Rotate-Image.md
@@ -0,0 +1,169 @@
+# [48. Rotate Image](https://leetcode.com/problems/rotate-image/)
+
+## 题目
+
+You are given an *n* x *n* 2D matrix representing an image.
+
+Rotate the image by 90 degrees (clockwise).
+
+**Note**:
+
+You have to rotate the image **[in-place](https://en.wikipedia.org/wiki/In-place_algorithm)**, which means you have to modify the input 2D matrix directly. **DO NOT** allocate another 2D matrix and do the rotation.
+
+**Example 1**:
+
+
+
+ Given input matrix =
+ [
+ [1,2,3],
+ [4,5,6],
+ [7,8,9]
+ ],
+
+ rotate the input matrix in-place such that it becomes:
+ [
+ [7,4,1],
+ [8,5,2],
+ [9,6,3]
+ ]
+
+
+**Example 2**:
+
+
+
+ Given input matrix =
+ [
+ [ 5, 1, 9,11],
+ [ 2, 4, 8,10],
+ [13, 3, 6, 7],
+ [15,14,12,16]
+ ],
+
+ rotate the input matrix in-place such that it becomes:
+ [
+ [15,13, 2, 5],
+ [14, 3, 4, 1],
+ [12, 6, 8, 9],
+ [16, 7,10,11]
+ ]
+
+
+## 题目大意
+
+给定一个 n × n 的二维矩阵表示一个图像。将图像顺时针旋转 90 度。说明：你必须在原地旋转图像，这意味着你需要直接修改输入的二维矩阵。请不要使用另一个矩阵来旋转图像。
+
+
+## 解题思路
+
+- 给出一个二维数组，要求顺时针旋转 90 度。
+- 这一题比较简单，按照题意做就可以。这里给出 2 种旋转方法的实现，顺时针旋转和逆时针旋转。
+
+```c
+
+ /*
+ * clockwise rotate 顺时针旋转
+ * first reverse up to down, then swap the symmetry
+ * 1 2 3 7 8 9 7 4 1
+ * 4 5 6 => 4 5 6 => 8 5 2
+ * 7 8 9 1 2 3 9 6 3
+ */
+ void rotate(vector<vector<int> > &matrix) {
+ reverse(matrix.begin(), matrix.end());
+ for (int i = 0; i < matrix.size(); ++i) {
+ for (int j = i + 1; j < matrix[i].size(); ++j)
+ swap(matrix[i][j], matrix[j][i]);
+ }
+ }
+
+ /*
+ * anticlockwise rotate 逆时针旋转
+ * first reverse left to right, then swap the symmetry
+ * 1 2 3 3 2 1 3 6 9
+ * 4 5 6 => 6 5 4 => 2 5 8
+ * 7 8 9 9 8 7 1 4 7
+ */
+ void anti_rotate(vector<vector<int> > &matrix) {
+ for (auto vi : matrix) reverse(vi.begin(), vi.end());
+ for (int i = 0; i < matrix.size(); ++i) {
+ for (int j = i + 1; j < matrix[i].size(); ++j)
+ swap(matrix[i][j], matrix[j][i]);
+ }
+ }
+
+```
+
+## 代码
+
+```go
+package leetcode
+
+// 解法一
+func rotate(matrix [][]int) {
+ length := len(matrix)
+ // rotate by diagonal 对角线变换
+ for i := 0; i < length; i++ {
+ for j := i + 1; j < length; j++ {
+ matrix[i][j], matrix[j][i] = matrix[j][i], matrix[i][j]
+ }
+ }
+ // rotate by vertical centerline 竖直轴对称翻转
+ for i := 0; i < length; i++ {
+ for j := 0; j < length/2; j++ {
+ matrix[i][j], matrix[i][length-j-1] = matrix[i][length-j-1], matrix[i][j]
+ }
+ }
+}
+
+// 解法二
+func rotate1(matrix [][]int) {
+ n := len(matrix)
+ if n == 1 {
+ return
+ }
+ /* rotate clock-wise = 1. transpose matrix => 2. reverse(matrix[i])
+
+ 1 2 3 4 1 5 9 13 13 9 5 1
+ 5 6 7 8 => 2 6 10 14 => 14 10 6 2
+ 9 10 11 12 3 7 11 15 15 11 7 3
+ 13 14 15 16 4 8 12 16 16 12 8 4
+
+ */
+
+ for i := 0; i < n; i++ {
+ // transpose, i=rows, j=columns
+ // j = i+1, coz diagonal elements didn't change in a square matrix
+ for j := i + 1; j < n; j++ {
+ swap(matrix, i, j)
+ }
+ // reverse each row of the image
+ matrix[i] = reverse(matrix[i])
+ }
+}
+
+// swap changes original slice's i,j position
+func swap(nums [][]int, i, j int) {
+ nums[i][j], nums[j][i] = nums[j][i], nums[i][j]
+}
+
+// reverses a row of image, matrix[i]
+func reverse(nums []int) []int {
+ var lp, rp = 0, len(nums) - 1
+
+ for lp < rp {
+ nums[lp], nums[rp] = nums[rp], nums[lp]
+ lp++
+ rp--
+ }
+ return nums
+}
+
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<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>
diff --git a/website/content/ChapterFour/0049.Group-Anagrams.md b/website/content/ChapterFour/0001~0099/0049.Group-Anagrams.md
similarity index 81%
rename from website/content/ChapterFour/0049.Group-Anagrams.md
rename to website/content/ChapterFour/0001~0099/0049.Group-Anagrams.md
index 8eca6bea8..d677466da 100644
--- a/website/content/ChapterFour/0049.Group-Anagrams.md
+++ b/website/content/ChapterFour/0001~0099/0049.Group-Anagrams.md
@@ -70,3 +70,10 @@ 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/0001~0099/0048.Rotate-Image/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0001~0099/0050.Powx-n/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0001~0099/0050.Powx-n.md b/website/content/ChapterFour/0001~0099/0050.Powx-n.md
new file mode 100755
index 000000000..714c18617
--- /dev/null
+++ b/website/content/ChapterFour/0001~0099/0050.Powx-n.md
@@ -0,0 +1,76 @@
+# [50. Pow(x, n)](https://leetcode.com/problems/powx-n/)
+
+
+## 题目
+
+Implement [pow(*x*, *n*)](http://www.cplusplus.com/reference/valarray/pow/), which calculates *x* raised to the power *n* (xn).
+
+**Example 1**:
+
+
+ Input: 2.00000, 10
+ Output: 1024.00000
+
+
+**Example 2**:
+
+
+ Input: 2.10000, 3
+ Output: 9.26100
+
+
+**Example 3**:
+
+
+ Input: 2.00000, -2
+ Output: 0.25000
+ Explanation: 2-2 = 1/22 = 1/4 = 0.25
+
+
+**Note**:
+
+- -100.0 < *x* < 100.0
+- *n* is a 32-bit signed integer, within the range [−2^31, 2^31− 1]
+
+## 题目大意
+
+实现 pow(x, n) ，即计算 x 的 n 次幂函数。
+
+## 解题思路
+
+- 要求计算 Pow(x, n)
+- 这一题用递归的方式，不断的将 n 2 分下去。注意 n 的正负数，n 的奇偶性。
+
+## 代码
+
+```go
+
+package leetcode
+
+// 时间复杂度 O(log n),空间复杂度 O(1)
+func myPow(x float64, n int) float64 {
+ if n == 0 {
+ return 1
+ }
+ if n == 1 {
+ return x
+ }
+ if n < 0 {
+ n = -n
+ x = 1 / x
+ }
+ tmp := myPow(x, n/2)
+ if n%2 == 0 {
+ return tmp * tmp
+ }
+ return tmp * tmp * x
+}
+
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<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>
diff --git a/website/content/ChapterFour/0001~0099/0051.N-Queens.md b/website/content/ChapterFour/0001~0099/0051.N-Queens.md
new file mode 100755
index 000000000..eacce3135
--- /dev/null
+++ b/website/content/ChapterFour/0001~0099/0051.N-Queens.md
@@ -0,0 +1,148 @@
+# [51. N-Queens](https://leetcode.com/problems/n-queens/)
+
+
+## 题目
+
+The n-queens puzzle is the problem of placing n queens on an n×n chessboard such that no two queens attack each other.
+
+
+
+Given an integer *n*, return all distinct solutions to the *n*-queens puzzle.
+
+Each solution contains a distinct board configuration of the *n*-queens' placement, where `'Q'` and `'.'` both indicate a queen and an empty space respectively.
+
+**Example**:
+
+
+ Input: 4
+ Output: [
+ [".Q..", // Solution 1
+ "...Q",
+ "Q...",
+ "..Q."],
+
+ ["..Q.", // Solution 2
+ "Q...",
+ "...Q",
+ ".Q.."]
+ ]
+ Explanation: There exist two distinct solutions to the 4-queens puzzle as shown above.
+
+
+## 题目大意
+
+给定一个整数 n，返回所有不同的 n 皇后问题的解决方案。每一种解法包含一个明确的 n 皇后问题的棋子放置方案，该方案中 'Q' 和 '.' 分别代表了皇后和空位。
+
+
+## 解题思路
+
+- 求解 n 皇后问题
+- 利用 col 数组记录列信息，col 有 `n` 列。用 dia1，dia2 记录从左下到右上的对角线，从左上到右下的对角线的信息，dia1 和 dia2 分别都有 `2*n-1` 个。
+- dia1 对角线的规律是 `i + j 是定值`，例如[0,0]，为 0；[1,0]、[0,1] 为 1；[2,0]、[1,1]、[0,2] 为 2；
+- dia2 对角线的规律是 `i - j 是定值`，例如[0,7]，为 -7；[0,6]、[1,7] 为 -6；[0,5]、[1,6]、[2,7] 为 -5；为了使他们从 0 开始，i - j + n - 1 偏移到 0 开始，所以 dia2 的规律是 `i - j + n - 1 为定值`。
+- 还有一个位运算的方法，每行只能选一个位置放皇后，那么对每行遍历可能放皇后的位置。如何高效判断哪些点不能放皇后呢？这里的做法毕竟巧妙，把所有之前选过的点按照顺序存下来，然后根据之前选的点到当前行的距离，就可以快速判断是不是会有冲突。举个例子: 假如在 4 皇后问题中，如果第一二行已经选择了位置 [1, 3]，那么在第三行选择时，首先不能再选 1, 3 列了，而对于第三行， 1 距离长度为2，所以它会影响到 -1, 3 两个列。同理，3 在第二行，距离第三行为 1，所以 3 会影响到列 2, 4。由上面的结果，我们知道 -1, 4 超出边界了不用去管，别的不能选的点是 1, 2, 3，所以第三行就只能选 0。在代码实现中，可以在每次遍历前根据之前选择的情况生成一个 occupied 用来记录当前这一行，已经被选了的和由于之前皇后攻击范围所以不能选的位置，然后只选择合法的位置进入到下一层递归。另外就是预处理了一个皇后放不同位置的字符串，这样这些字符串在返回结果的时候是可以在内存中复用的，省一点内存。
+
+## 代码
+
+```go
+
+package leetcode
+
+// 解法一 DFS
+func solveNQueens(n int) [][]string {
+ col, dia1, dia2, row, res := make([]bool, n), make([]bool, 2*n-1), make([]bool, 2*n-1), []int{}, [][]string{}
+ putQueen(n, 0, &col, &dia1, &dia2, &row, &res)
+ return res
+}
+
+// 尝试在一个n皇后问题中, 摆放第index行的皇后位置
+func putQueen(n, index int, col, dia1, dia2 *[]bool, row *[]int, res *[][]string) {
+ if index == n {
+ *res = append(*res, generateBoard(n, row))
+ return
+ }
+ for i := 0; i < n; i++ {
+ // 尝试将第index行的皇后摆放在第i列
+ if !(*col)[i] && !(*dia1)[index+i] && !(*dia2)[index-i+n-1] {
+ *row = append(*row, i)
+ (*col)[i] = true
+ (*dia1)[index+i] = true
+ (*dia2)[index-i+n-1] = true
+ putQueen(n, index+1, col, dia1, dia2, row, res)
+ (*col)[i] = false
+ (*dia1)[index+i] = false
+ (*dia2)[index-i+n-1] = false
+ *row = (*row)[:len(*row)-1]
+ }
+ }
+ return
+}
+
+func generateBoard(n int, row *[]int) []string {
+ board := []string{}
+ res := ""
+ for i := 0; i < n; i++ {
+ res += "."
+ }
+ for i := 0; i < n; i++ {
+ board = append(board, res)
+ }
+ for i := 0; i < n; i++ {
+ tmp := []byte(board[i])
+ tmp[(*row)[i]] = 'Q'
+ board[i] = string(tmp)
+ }
+ return board
+}
+
+// 解法二 二进制操作法 Signed-off-by: Hanlin Shi shihanlin9@gmail.com
+func solveNQueens2(n int) (res [][]string) {
+ placements := make([]string, n)
+ for i := range placements {
+ buf := make([]byte, n)
+ for j := range placements {
+ if i == j {
+ buf[j] = 'Q'
+ } else {
+ buf[j] = '.'
+ }
+ }
+ placements[i] = string(buf)
+ }
+ var construct func(prev []int)
+ construct = func(prev []int) {
+ if len(prev) == n {
+ plan := make([]string, n)
+ for i := 0; i < n; i++ {
+ plan[i] = placements[prev[i]]
+ }
+ res = append(res, plan)
+ return
+ }
+ occupied := 0
+ for i := range prev {
+ dist := len(prev) - i
+ bit := 1 << prev[i]
+ occupied |= bit | bit<<dist | bit>>dist
+ }
+ prev = append(prev, -1)
+ for i := 0; i < n; i++ {
+ if (occupied>>i)&1 != 0 {
+ continue
+ }
+ prev[len(prev)-1] = i
+ construct(prev)
+ }
+ }
+ construct(make([]int, 0, n))
+ return
+}
+
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<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>
diff --git a/website/content/ChapterFour/0052.N-Queens-II.md b/website/content/ChapterFour/0001~0099/0052.N-Queens-II.md
similarity index 88%
rename from website/content/ChapterFour/0052.N-Queens-II.md
rename to website/content/ChapterFour/0001~0099/0052.N-Queens-II.md
index 36b5911b3..4bf016f13 100755
--- a/website/content/ChapterFour/0052.N-Queens-II.md
+++ b/website/content/ChapterFour/0001~0099/0052.N-Queens-II.md
@@ -104,4 +104,11 @@ func putQueen52(n, index int, col, dia1, dia2 *[]bool, row *[]int, res *int) {
// }
// };
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<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>
diff --git a/website/content/ChapterFour/0053.Maximum-Subarray.md b/website/content/ChapterFour/0001~0099/0053.Maximum-Subarray.md
similarity index 81%
rename from website/content/ChapterFour/0053.Maximum-Subarray.md
rename to website/content/ChapterFour/0001~0099/0053.Maximum-Subarray.md
index a5c3a0a5b..a02481277 100755
--- a/website/content/ChapterFour/0053.Maximum-Subarray.md
+++ b/website/content/ChapterFour/0001~0099/0053.Maximum-Subarray.md
@@ -72,4 +72,11 @@ func maxSubArray1(nums []int) int {
return maxSum
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<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>
diff --git a/website/content/ChapterFour/0054.Spiral-Matrix.md b/website/content/ChapterFour/0001~0099/0054.Spiral-Matrix.md
similarity index 90%
rename from website/content/ChapterFour/0054.Spiral-Matrix.md
rename to website/content/ChapterFour/0001~0099/0054.Spiral-Matrix.md
index 4fd81dc5c..5d75a8e6e 100755
--- a/website/content/ChapterFour/0054.Spiral-Matrix.md
+++ b/website/content/ChapterFour/0001~0099/0054.Spiral-Matrix.md
@@ -162,4 +162,11 @@ func spiralOrder2(matrix [][]int) []int {
return res
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<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>
diff --git a/website/content/ChapterFour/0055.Jump-Game.md b/website/content/ChapterFour/0001~0099/0055.Jump-Game.md
similarity index 82%
rename from website/content/ChapterFour/0055.Jump-Game.md
rename to website/content/ChapterFour/0001~0099/0055.Jump-Game.md
index 84b7ddaf1..a34c5d262 100644
--- a/website/content/ChapterFour/0055.Jump-Game.md
+++ b/website/content/ChapterFour/0001~0099/0055.Jump-Game.md
@@ -55,4 +55,11 @@ func canJump(nums []int) bool {
}
return true
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<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>
diff --git a/website/content/ChapterFour/0056.Merge-Intervals.md b/website/content/ChapterFour/0001~0099/0056.Merge-Intervals.md
similarity index 83%
rename from website/content/ChapterFour/0056.Merge-Intervals.md
rename to website/content/ChapterFour/0001~0099/0056.Merge-Intervals.md
index cfe7aecd0..236c252fc 100644
--- a/website/content/ChapterFour/0056.Merge-Intervals.md
+++ b/website/content/ChapterFour/0001~0099/0056.Merge-Intervals.md
@@ -106,4 +106,11 @@ func quickSort(a []Interval, lo, hi int) {
quickSort(a, p+1, hi)
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<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>
diff --git a/website/content/ChapterFour/0057.Insert-Interval.md b/website/content/ChapterFour/0001~0099/0057.Insert-Interval.md
similarity index 83%
rename from website/content/ChapterFour/0057.Insert-Interval.md
rename to website/content/ChapterFour/0001~0099/0057.Insert-Interval.md
index 63b6df7c3..f5eb6964e 100644
--- a/website/content/ChapterFour/0057.Insert-Interval.md
+++ b/website/content/ChapterFour/0001~0099/0057.Insert-Interval.md
@@ -72,4 +72,11 @@ func insert(intervals []Interval, newInterval Interval) []Interval {
return res
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<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/0058.Length-of-Last-Word/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0001~0099/0058.Length-of-Last-Word.md b/website/content/ChapterFour/0001~0099/0058.Length-of-Last-Word.md
new file mode 100644
index 000000000..3d25cf40d
--- /dev/null
+++ b/website/content/ChapterFour/0001~0099/0058.Length-of-Last-Word.md
@@ -0,0 +1,77 @@
+# [58. Length of Last Word](https://leetcode.com/problems/length-of-last-word/)
+
+
+## 题目
+
+Given a string `s` consisting of some words separated by some number of spaces, return *the length of the **last** word in the string.*
+
+A **word** is a maximal substring consisting of non-space characters only.
+
+**Example 1:**
+
+```
+Input: s = "Hello World"
+Output: 5
+Explanation: The last word is "World" with length 5.
+
+```
+
+**Example 2:**
+
+```
+Input: s = " fly me to the moon "
+Output: 4
+Explanation: The last word is "moon" with length 4.
+
+```
+
+**Example 3:**
+
+```
+Input: s = "luffy is still joyboy"
+Output: 6
+Explanation: The last word is "joyboy" with length 6.
+
+```
+
+**Constraints:**
+
+- `1 <= s.length <= 104`
+- `s` consists of only English letters and spaces `' '`.
+- There will be at least one word in `s`.
+
+## 题目大意
+
+给你一个字符串 `s`，由若干单词组成，单词前后用一些空格字符隔开。返回字符串中最后一个单词的长度。**单词** 是指仅由字母组成、不包含任何空格字符的最大子字符串。
+
+## 解题思路
+
+- 先从后过滤掉空格找到单词尾部，再从尾部向前遍历，找到单词头部，最后两者相减，即为单词的长度。
+
+## 代码
+
+```go
+package leetcode
+
+func lengthOfLastWord(s string) int {
+ last := len(s) - 1
+ for last >= 0 && s[last] == ' ' {
+ last--
+ }
+ if last < 0 {
+ return 0
+ }
+ first := last
+ for first >= 0 && s[first] != ' ' {
+ first--
+ }
+ return last - first
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<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/0059.Spiral-Matrix-II/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0059.Spiral-Matrix-II.md b/website/content/ChapterFour/0001~0099/0059.Spiral-Matrix-II.md
similarity index 82%
rename from website/content/ChapterFour/0059.Spiral-Matrix-II.md
rename to website/content/ChapterFour/0001~0099/0059.Spiral-Matrix-II.md
index 201b80f3f..7d6df02a0 100755
--- a/website/content/ChapterFour/0059.Spiral-Matrix-II.md
+++ b/website/content/ChapterFour/0001~0099/0059.Spiral-Matrix-II.md
@@ -91,4 +91,11 @@ func generateMatrix(n int) [][]int {
return res
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0001~0099/0058.Length-of-Last-Word/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0001~0099/0060.Permutation-Sequence/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0060.Permutation-Sequence.md b/website/content/ChapterFour/0001~0099/0060.Permutation-Sequence.md
similarity index 82%
rename from website/content/ChapterFour/0060.Permutation-Sequence.md
rename to website/content/ChapterFour/0001~0099/0060.Permutation-Sequence.md
index e762d748f..ea18f6956 100755
--- a/website/content/ChapterFour/0060.Permutation-Sequence.md
+++ b/website/content/ChapterFour/0001~0099/0060.Permutation-Sequence.md
@@ -93,4 +93,11 @@ func findPermutation(n, index int, k *int, p []int, res *string, used *[]bool) {
return
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<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>
diff --git a/website/content/ChapterFour/0061.Rotate-List.md b/website/content/ChapterFour/0001~0099/0061.Rotate-List.md
similarity index 81%
rename from website/content/ChapterFour/0061.Rotate-List.md
rename to website/content/ChapterFour/0001~0099/0061.Rotate-List.md
index 6bef2616a..9a0da026f 100644
--- a/website/content/ChapterFour/0061.Rotate-List.md
+++ b/website/content/ChapterFour/0001~0099/0061.Rotate-List.md
@@ -78,4 +78,11 @@ func rotateRight(head *ListNode, k int) *ListNode {
return res.Next
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<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>
diff --git a/website/content/ChapterFour/0062.Unique-Paths.md b/website/content/ChapterFour/0001~0099/0062.Unique-Paths.md
similarity index 79%
rename from website/content/ChapterFour/0062.Unique-Paths.md
rename to website/content/ChapterFour/0001~0099/0062.Unique-Paths.md
index 9a67bbb91..fcd62db98 100755
--- a/website/content/ChapterFour/0062.Unique-Paths.md
+++ b/website/content/ChapterFour/0001~0099/0062.Unique-Paths.md
@@ -52,18 +52,23 @@ func uniquePaths(m int, n int) int {
for i := 0; i < n; i++ {
dp[i] = make([]int, m)
}
- for i := 0; i < m; i++ {
- dp[0][i] = 1
- }
for i := 0; i < n; i++ {
- dp[i][0] = 1
- }
- for i := 1; i < n; i++ {
- for j := 1; j < m; j++ {
+ for j := 0; j < m; j++ {
+ if i == 0 || j == 0 {
+ dp[i][j] = 1
+ continue
+ }
dp[i][j] = dp[i-1][j] + dp[i][j-1]
}
}
return dp[n-1][m-1]
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<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>
diff --git a/website/content/ChapterFour/0063.Unique-Paths-II.md b/website/content/ChapterFour/0001~0099/0063.Unique-Paths-II.md
similarity index 86%
rename from website/content/ChapterFour/0063.Unique-Paths-II.md
rename to website/content/ChapterFour/0001~0099/0063.Unique-Paths-II.md
index 7ab37659c..b5353ca87 100755
--- a/website/content/ChapterFour/0063.Unique-Paths-II.md
+++ b/website/content/ChapterFour/0001~0099/0063.Unique-Paths-II.md
@@ -77,4 +77,11 @@ func uniquePathsWithObstacles(obstacleGrid [][]int) int {
return dp[m-1][n-1]
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<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>
diff --git a/website/content/ChapterFour/0064.Minimum-Path-Sum.md b/website/content/ChapterFour/0001~0099/0064.Minimum-Path-Sum.md
similarity index 85%
rename from website/content/ChapterFour/0064.Minimum-Path-Sum.md
rename to website/content/ChapterFour/0001~0099/0064.Minimum-Path-Sum.md
index 8ae24ab1c..5f833d874 100755
--- a/website/content/ChapterFour/0064.Minimum-Path-Sum.md
+++ b/website/content/ChapterFour/0001~0099/0064.Minimum-Path-Sum.md
@@ -90,4 +90,11 @@ func minPathSum1(grid [][]int) int {
return dp[m-1][n-1]
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<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/0065.Valid-Number/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0001~0099/0065.Valid-Number.md b/website/content/ChapterFour/0001~0099/0065.Valid-Number.md
new file mode 100644
index 000000000..024f13106
--- /dev/null
+++ b/website/content/ChapterFour/0001~0099/0065.Valid-Number.md
@@ -0,0 +1,85 @@
+# [65. Valid Number](https://leetcode.com/problems/valid-number/)
+
+
+## 题目
+
+A **valid number** can be split up into these components (in order):
+
+ 1. A **decimal number** or an integer.
+ 2. (Optional) An 'e' or 'E', followed by an **integer.**
+
+A **decimal number** can be split up into these components (in order):
+
+ 1. (Optional) A sign character (either '+' or '-').
+ 2. One of the following formats:
+ 1. One or more digits, followed by a dot '.'.
+ 2. One or more digits, followed by a dot '.', followed by one or more digits.
+ 3. A dot '.', followed by one or more digits.
+
+An **integer** can be split up into these components (in order):
+
+ 1. (Optional) A sign character (either '+' or '-').
+ 2. One or more digits.
+
+For example, all the following are valid numbers: `["2", "0089", "-0.1", "+3.14", "4.", "-.9", "2e10", "-90E3", "3e+7", "+6e-1", "53.5e93", "-123.456e789"]`, while the following are not valid numbers: `["abc", "1a", "1e", "e3", "99e2.5", "--6", "-+3", "95a54e53"].`
+
+Given a string s, return true if s is a **valid number.**
+
+**Example:**
+
+ Input: s = "0"
+ Output: true
+
+ Input: s = "e"
+ Output: false
+
+## 题目大意
+
+给定一个字符串S，请根据以上的规则判断该字符串是否是一个有效的数字字符串。
+
+
+## 解题思路
+
+- 用三个变量分别标记是否出现过数字、是否出现过'.'和 是否出现过 'e/E'
+- 从左到右依次遍历字符串中的每一个元素
+ - 如果是数字，则标记数字出现过
+ - 如果是 '.', 则需要 '.'没有出现过，并且 'e/E' 没有出现过，才会进行标记
+ - 如果是 'e/E', 则需要 'e/E'没有出现过，并且前面出现过数字，才会进行标记
+ - 如果是 '+/-', 则需要是第一个字符，或者前一个字符是 'e/E'，才会进行标记，并重置数字出现的标识
+ - 最后返回时，需要字符串中至少出现过数字，避免下列case: s == '.' or 'e/E' or '+/e' and etc...
+
+## 代码
+
+```go
+
+package leetcode
+
+func isNumber(s string) bool {
+ numFlag, dotFlag, eFlag := false, false, false
+ for i := 0; i < len(s); i++ {
+ if '0' <= s[i] && s[i] <= '9' {
+ numFlag = true
+ } else if s[i] == '.' && !dotFlag && !eFlag {
+ dotFlag = true
+ } else if (s[i] == 'e' || s[i] == 'E') && !eFlag && numFlag {
+ eFlag = true
+ numFlag = false // reJudge integer after 'e' or 'E'
+ } else if (s[i] == '+' || s[i] == '-') && (i == 0 || s[i-1] == 'e' || s[i-1] == 'E') {
+ continue
+ } else {
+ return false
+ }
+ }
+ // avoid case: s == '.' or 'e/E' or '+/-' and etc...
+ // string s must have num
+ return numFlag
+}
+
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<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/0066.Plus-One/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0001~0099/0066.Plus-One.md b/website/content/ChapterFour/0001~0099/0066.Plus-One.md
new file mode 100755
index 000000000..37761b545
--- /dev/null
+++ b/website/content/ChapterFour/0001~0099/0066.Plus-One.md
@@ -0,0 +1,68 @@
+# [66. Plus One](https://leetcode.com/problems/plus-one/)
+
+
+## 题目
+
+Given a **non-empty** array of digits representing a non-negative integer, plus one to the integer.
+
+The digits are stored such that the most significant digit is at the head of the list, and each element in the array contain a single digit.
+
+You may assume the integer does not contain any leading zero, except the number 0 itself.
+
+**Example 1**:
+
+ Input: [1,2,3]
+ Output: [1,2,4]
+ Explanation: The array represents the integer 123.
+
+**Example 2**:
+
+ Input: [4,3,2,1]
+ Output: [4,3,2,2]
+ Explanation: The array represents the integer 4321.
+
+
+## 题目大意
+
+
+给定一个由整数组成的非空数组所表示的非负整数，在该数的基础上加一。最高位数字存放在数组的首位， 数组中每个元素只存储单个数字。你可以假设除了整数 0 之外，这个整数不会以零开头。
+
+
+
+## 解题思路
+
+- 给出一个数组，代表一个十进制数，数组的 0 下标是十进制数的高位。要求计算这个十进制数加一以后的结果。
+- 简单的模拟题。从数组尾部开始往前扫，逐位进位即可。最高位如果还有进位需要在数组里面第 0 位再插入一个 1 。
+
+## 代码
+
+```go
+
+package leetcode
+
+func plusOne(digits []int) []int {
+ for i := len(digits) - 1; i >= 0; i-- {
+ digits[i]++
+ if digits[i] != 10 {
+ // no carry
+ return digits
+ }
+ // carry
+ digits[i] = 0
+ }
+ // all carry
+ digits[0] = 1
+ digits = append(digits, 0)
+ return digits
+}
+
+
+
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0001~0099/0065.Valid-Number/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0001~0099/0067.Add-Binary/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0067.Add-Binary.md b/website/content/ChapterFour/0001~0099/0067.Add-Binary.md
similarity index 78%
rename from website/content/ChapterFour/0067.Add-Binary.md
rename to website/content/ChapterFour/0001~0099/0067.Add-Binary.md
index 91d977e58..f685c2582 100644
--- a/website/content/ChapterFour/0067.Add-Binary.md
+++ b/website/content/ChapterFour/0001~0099/0067.Add-Binary.md
@@ -73,4 +73,11 @@ func addBinary(a string, b string) string {
return strings.Join(res, "")
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<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>
diff --git a/website/content/ChapterFour/0069.Sqrtx.md b/website/content/ChapterFour/0001~0099/0069.Sqrtx.md
similarity index 80%
rename from website/content/ChapterFour/0069.Sqrtx.md
rename to website/content/ChapterFour/0001~0099/0069.Sqrtx.md
index 3b4397dee..fc0aba54a 100755
--- a/website/content/ChapterFour/0069.Sqrtx.md
+++ b/website/content/ChapterFour/0001~0099/0069.Sqrtx.md
@@ -42,24 +42,18 @@ Since the return type is an integer, the decimal digits are truncated and only
package leetcode
-// 解法一 二分
+// 解法一 二分, 找到最后一个满足 n^2 <= x 的整数n
func mySqrt(x int) int {
- if x == 0 {
- return 0
- }
- left, right, res := 1, x, 0
- for left <= right {
- mid := left + ((right - left) >> 1)
- if mid < x/mid {
- left = mid + 1
- res = mid
- } else if mid == x/mid {
- return mid
+ l, r := 0, x
+ for l < r {
+ mid := (l + r + 1) / 2
+ if mid*mid > x {
+ r = mid - 1
} else {
- right = mid - 1
+ l = mid
}
}
- return res
+ return l
}
// 解法二 牛顿迭代法 https://en.wikipedia.org/wiki/Integer_square_root
@@ -88,4 +82,11 @@ func mySqrt1(x int) int {
// return y;
// }
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<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>
diff --git a/website/content/ChapterFour/0070.Climbing-Stairs.md b/website/content/ChapterFour/0001~0099/0070.Climbing-Stairs.md
similarity index 76%
rename from website/content/ChapterFour/0070.Climbing-Stairs.md
rename to website/content/ChapterFour/0001~0099/0070.Climbing-Stairs.md
index 5eda8e5ca..274f7e02b 100755
--- a/website/content/ChapterFour/0070.Climbing-Stairs.md
+++ b/website/content/ChapterFour/0001~0099/0070.Climbing-Stairs.md
@@ -52,4 +52,11 @@ func climbStairs(n int) int {
return dp[n]
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<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>
diff --git a/website/content/ChapterFour/0071.Simplify-Path.md b/website/content/ChapterFour/0001~0099/0071.Simplify-Path.md
similarity index 86%
rename from website/content/ChapterFour/0071.Simplify-Path.md
rename to website/content/ChapterFour/0001~0099/0071.Simplify-Path.md
index b4a7c4cf0..750f72c7f 100644
--- a/website/content/ChapterFour/0071.Simplify-Path.md
+++ b/website/content/ChapterFour/0001~0099/0071.Simplify-Path.md
@@ -114,4 +114,11 @@ func simplifyPath1(path string) string {
return filepath.Clean(path)
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<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/0073.Set-Matrix-Zeroes/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0001~0099/0073.Set-Matrix-Zeroes.md b/website/content/ChapterFour/0001~0099/0073.Set-Matrix-Zeroes.md
new file mode 100644
index 000000000..faa39f428
--- /dev/null
+++ b/website/content/ChapterFour/0001~0099/0073.Set-Matrix-Zeroes.md
@@ -0,0 +1,111 @@
+# [73. Set Matrix Zeroes](https://leetcode.com/problems/set-matrix-zeroes/)
+
+
+## 题目
+
+Given an *`m* x *n*` matrix. If an element is **0**, set its entire row and column to **0**. Do it **[in-place](https://en.wikipedia.org/wiki/In-place_algorithm)**.
+
+**Follow up:**
+
+- A straight forward solution using O(*mn*) space is probably a bad idea.
+- A simple improvement uses O(*m* + *n*) space, but still not the best solution.
+- Could you devise a constant space solution?
+
+**Example 1:**
+
+
+
+```
+Input: matrix = [[1,1,1],[1,0,1],[1,1,1]]
+Output: [[1,0,1],[0,0,0],[1,0,1]]
+```
+
+**Example 2:**
+
+
+
+```
+Input: matrix = [[0,1,2,0],[3,4,5,2],[1,3,1,5]]
+Output: [[0,0,0,0],[0,4,5,0],[0,3,1,0]]
+```
+
+**Constraints:**
+
+- `m == matrix.length`
+- `n == matrix[0].length`
+- `1 <= m, n <= 200`
+- `2^31 <= matrix[i][j] <= 2^31 - 1`
+
+## 题目大意
+
+给定一个 `m x n` 的矩阵，如果一个元素为 0，则将其所在行和列的所有元素都设为 0。请使用原地算法。
+
+## 解题思路
+
+- 此题考查对程序的控制能力，无算法思想。题目要求采用原地的算法，所有修改即在原二维数组上进行。在二维数组中有 2 个特殊位置，一个是第一行，一个是第一列。它们的特殊性在于，它们之间只要有一个 0，它们都会变为全 0 。先用 2 个变量记录这一行和这一列中是否有 0，防止之后的修改覆盖了这 2 个地方。然后除去这一行和这一列以外的部分判断是否有 0，如果有 0，将它们所在的行第一个元素标记为 0，所在列的第一个元素标记为 0 。最后通过标记，将对应的行列置 0 即可。
+
+## 代码
+
+```go
+package leetcode
+
+func setZeroes(matrix [][]int) {
+ if len(matrix) == 0 || len(matrix[0]) == 0 {
+ return
+ }
+ isFirstRowExistZero, isFirstColExistZero := false, false
+ for i := 0; i < len(matrix); i++ {
+ if matrix[i][0] == 0 {
+ isFirstColExistZero = true
+ break
+ }
+ }
+ for j := 0; j < len(matrix[0]); j++ {
+ if matrix[0][j] == 0 {
+ isFirstRowExistZero = true
+ break
+ }
+ }
+ for i := 1; i < len(matrix); i++ {
+ for j := 1; j < len(matrix[0]); j++ {
+ if matrix[i][j] == 0 {
+ matrix[i][0] = 0
+ matrix[0][j] = 0
+ }
+ }
+ }
+ // 处理[1:]行全部置 0
+ for i := 1; i < len(matrix); i++ {
+ if matrix[i][0] == 0 {
+ for j := 1; j < len(matrix[0]); j++ {
+ matrix[i][j] = 0
+ }
+ }
+ }
+ // 处理[1:]列全部置 0
+ for j := 1; j < len(matrix[0]); j++ {
+ if matrix[0][j] == 0 {
+ for i := 1; i < len(matrix); i++ {
+ matrix[i][j] = 0
+ }
+ }
+ }
+ if isFirstRowExistZero {
+ for j := 0; j < len(matrix[0]); j++ {
+ matrix[0][j] = 0
+ }
+ }
+ if isFirstColExistZero {
+ for i := 0; i < len(matrix); i++ {
+ matrix[i][0] = 0
+ }
+ }
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<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/0074.Search-a-2D-Matrix/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0074.Search-a-2D-Matrix.md b/website/content/ChapterFour/0001~0099/0074.Search-a-2D-Matrix.md
similarity index 82%
rename from website/content/ChapterFour/0074.Search-a-2D-Matrix.md
rename to website/content/ChapterFour/0001~0099/0074.Search-a-2D-Matrix.md
index 072908621..df5886ea8 100755
--- a/website/content/ChapterFour/0074.Search-a-2D-Matrix.md
+++ b/website/content/ChapterFour/0001~0099/0074.Search-a-2D-Matrix.md
@@ -69,4 +69,11 @@ func searchMatrix(matrix [][]int, target int) bool {
return false
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0001~0099/0073.Set-Matrix-Zeroes/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0001~0099/0075.Sort-Colors/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0075.Sort-Colors.md b/website/content/ChapterFour/0001~0099/0075.Sort-Colors.md
similarity index 77%
rename from website/content/ChapterFour/0075.Sort-Colors.md
rename to website/content/ChapterFour/0001~0099/0075.Sort-Colors.md
index 127d74c04..7a980a932 100644
--- a/website/content/ChapterFour/0075.Sort-Colors.md
+++ b/website/content/ChapterFour/0001~0099/0075.Sort-Colors.md
@@ -43,30 +43,25 @@ First, iterate the array counting number of 0's, 1's, and 2's, then overwrite ar
package leetcode
func sortColors(nums []int) {
- if len(nums) == 0 {
- return
- }
-
- r := 0
- w := 0
- b := 0 // label the end of different colors;
- for _, num := range nums {
- if num == 0 {
- nums[b] = 2
- b++
- nums[w] = 1
- w++
- nums[r] = 0
- r++
- } else if num == 1 {
- nums[b] = 2
- b++
- nums[w] = 1
- w++
- } else if num == 2 {
- b++
+ zero, one := 0, 0
+ for i, n := range nums {
+ nums[i] = 2
+ if n <= 1 {
+ nums[one] = 1
+ one++
+ }
+ if n == 0 {
+ nums[zero] = 0
+ zero++
}
}
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<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>
diff --git a/website/content/ChapterFour/0076.Minimum-Window-Substring.md b/website/content/ChapterFour/0001~0099/0076.Minimum-Window-Substring.md
similarity index 82%
rename from website/content/ChapterFour/0076.Minimum-Window-Substring.md
rename to website/content/ChapterFour/0001~0099/0076.Minimum-Window-Substring.md
index a13affa38..ebaaaa47b 100644
--- a/website/content/ChapterFour/0076.Minimum-Window-Substring.md
+++ b/website/content/ChapterFour/0001~0099/0076.Minimum-Window-Substring.md
@@ -65,12 +65,18 @@ func minWindow(s string, t string) string {
}
}
if finalLeft != -1 {
- for i := finalLeft; i < finalRight+1; i++ {
- result += string(s[i])
- }
+ result = string(s[finalLeft : finalRight+1])
}
return result
}
+
```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<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>
diff --git a/website/content/ChapterFour/0001~0099/0077.Combinations.md b/website/content/ChapterFour/0001~0099/0077.Combinations.md
new file mode 100755
index 000000000..19ff4112e
--- /dev/null
+++ b/website/content/ChapterFour/0001~0099/0077.Combinations.md
@@ -0,0 +1,67 @@
+# [77. Combinations](https://leetcode.com/problems/combinations/)
+
+
+## 题目
+
+Given two integers *n* and *k*, return all possible combinations of *k* numbers out of 1 ... *n*.
+
+**Example**:
+
+ Input: n = 4, k = 2
+ Output:
+ [
+ [2,4],
+ [3,4],
+ [2,3],
+ [1,2],
+ [1,3],
+ [1,4],
+ ]
+
+## 题目大意
+
+给定两个整数 n 和 k，返回 1 ... n 中所有可能的 k 个数的组合。
+
+## 解题思路
+
+- 计算排列组合中的组合，用 DFS 深搜即可，注意剪枝
+
+## 代码
+
+```go
+
+package leetcode
+
+func combine(n int, k int) [][]int {
+ if n <= 0 || k <= 0 || k > n {
+ return [][]int{}
+ }
+ c, res := []int{}, [][]int{}
+ generateCombinations(n, k, 1, c, &res)
+ return res
+}
+
+func generateCombinations(n, k, start int, c []int, res *[][]int) {
+ if len(c) == k {
+ b := make([]int, len(c))
+ copy(b, c)
+ *res = append(*res, b)
+ return
+ }
+ // i will at most be n - (k - c.size()) + 1
+ for i := start; i <= n-(k-len(c))+1; i++ {
+ c = append(c, i)
+ generateCombinations(n, k, i+1, c, res)
+ c = c[:len(c)-1]
+ }
+ return
+}
+
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<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>
diff --git a/website/content/ChapterFour/0078.Subsets.md b/website/content/ChapterFour/0001~0099/0078.Subsets.md
similarity index 85%
rename from website/content/ChapterFour/0078.Subsets.md
rename to website/content/ChapterFour/0001~0099/0078.Subsets.md
index 3173014e1..f0ccb1427 100755
--- a/website/content/ChapterFour/0078.Subsets.md
+++ b/website/content/ChapterFour/0001~0099/0078.Subsets.md
@@ -102,4 +102,11 @@ func subsets2(nums []int) [][]int {
return res
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<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>
diff --git a/website/content/ChapterFour/0079.Word-Search.md b/website/content/ChapterFour/0001~0099/0079.Word-Search.md
similarity index 84%
rename from website/content/ChapterFour/0079.Word-Search.md
rename to website/content/ChapterFour/0001~0099/0079.Word-Search.md
index b38e63baf..d8d123f48 100755
--- a/website/content/ChapterFour/0079.Word-Search.md
+++ b/website/content/ChapterFour/0001~0099/0079.Word-Search.md
@@ -80,4 +80,11 @@ func searchWord(board [][]byte, visited [][]bool, word string, index, x, y int)
return false
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<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>
diff --git a/website/content/ChapterFour/0001~0099/0080.Remove-Duplicates-from-Sorted-Array-II.md b/website/content/ChapterFour/0001~0099/0080.Remove-Duplicates-from-Sorted-Array-II.md
new file mode 100644
index 000000000..84a5e631a
--- /dev/null
+++ b/website/content/ChapterFour/0001~0099/0080.Remove-Duplicates-from-Sorted-Array-II.md
@@ -0,0 +1,92 @@
+# [80. Remove Duplicates from Sorted Array II](https://leetcode.com/problems/remove-duplicates-from-sorted-array-ii/)
+
+## 题目
+
+Given a sorted array nums, remove the duplicates in-place such that duplicates appeared at most twice and return the new
+length.
+
+Do not allocate extra space for another array, you must do this by modifying the input array in-place with O(1) extra
+memory.
+
+**Example 1**:
+
+```
+
+Given nums = [1,1,1,2,2,3],
+
+Your function should return length = 5, with the first five elements of nums being 1, 1, 2, 2 and 3 respectively.
+
+It doesn't matter what you leave beyond the returned length.
+
+```
+
+**Example 2**:
+
+```
+
+Given nums = [0,0,1,1,1,1,2,3,3],
+
+Your function should return length = 7, with the first seven elements of nums being modified to 0, 0, 1, 1, 2, 3 and 3 respectively.
+
+It doesn't matter what values are set beyond the returned length.
+
+```
+
+**Clarification**:
+
+Confused why the returned value is an integer but your answer is an array?
+
+Note that the input array is passed in by reference, which means modification to the input array will be known to the
+caller as well.
+
+Internally you can think of this:
+
+```
+
+// nums is passed in by reference. (i.e., without making a copy)
+int len = removeElement(nums, val);
+
+// any modification to nums in your function would be known by the caller.
+// using the length returned by your function, it prints the first len elements.
+for (int i = 0; i < len; i++) {
+ print(nums[i]);
+}
+
+```
+
+## 题目大意
+
+给定一个有序数组 nums，对数组中的元素进行去重，使得原数组中的每个元素最多暴露 2 个。最后返回去重以后数组的长度值。
+
+## 解题思路
+
+- 问题提示有序数组，一般最容易想到使用双指针的解法，双指针的关键点：移动两个指针的条件。
+- 在该题中移动的条件：快指针从头遍历数组，慢指针指向修改后的数组的末端，当慢指针指向倒数第二个数与快指针指向的数不相等时，才移动慢指针，同时赋值慢指针。
+- 处理边界条件：当数组小于两个元素时，不做处理。
+
+## 代码
+
+```go
+
+package leetcode
+
+func removeDuplicates(nums []int) int {
+ slow := 0
+ for fast, v := range nums {
+ if fast < 2 || nums[slow-2] != v {
+ nums[slow] = v
+ slow++
+ }
+ }
+ return slow
+}
+
+
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<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>
diff --git a/website/content/ChapterFour/0081.Search-in-Rotated-Sorted-Array-II.md b/website/content/ChapterFour/0001~0099/0081.Search-in-Rotated-Sorted-Array-II.md
similarity index 85%
rename from website/content/ChapterFour/0081.Search-in-Rotated-Sorted-Array-II.md
rename to website/content/ChapterFour/0001~0099/0081.Search-in-Rotated-Sorted-Array-II.md
index e9b9a8800..7ed0474b7 100755
--- a/website/content/ChapterFour/0081.Search-in-Rotated-Sorted-Array-II.md
+++ b/website/content/ChapterFour/0001~0099/0081.Search-in-Rotated-Sorted-Array-II.md
@@ -82,4 +82,11 @@ func search(nums []int, target int) bool {
return false
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<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>
diff --git a/website/content/ChapterFour/0001~0099/0082.Remove-Duplicates-from-Sorted-List-II.md b/website/content/ChapterFour/0001~0099/0082.Remove-Duplicates-from-Sorted-List-II.md
new file mode 100644
index 000000000..4cbc0bf89
--- /dev/null
+++ b/website/content/ChapterFour/0001~0099/0082.Remove-Duplicates-from-Sorted-List-II.md
@@ -0,0 +1,198 @@
+# [82. Remove Duplicates from Sorted List II](https://leetcode.com/problems/remove-duplicates-from-sorted-list-ii/)
+
+## 题目
+
+Given a sorted linked list, delete all nodes that have duplicate numbers, leaving only distinct numbers from the original list.
+
+**Example 1**:
+
+```
+
+Input: 1->2->3->3->4->4->5
+Output: 1->2->5
+
+```
+
+**Example 2**:
+
+```
+
+Input: 1->1->1->2->3
+Output: 2->3
+
+```
+
+## 题目大意
+
+删除链表中重复的结点，只要是有重复过的结点，全部删除。
+
+## 解题思路
+
+按照题意做即可。
+
+## 代码
+
+```go
+
+package leetcode
+
+/**
+ * Definition for singly-linked list.
+ * type ListNode struct {
+ * Val int
+ * Next *ListNode
+ * }
+ */
+
+// 解法一
+func deleteDuplicates1(head *ListNode) *ListNode {
+ if head == nil {
+ return nil
+ }
+ if head.Next == nil {
+ return head
+ }
+ newHead := &ListNode{Next: head, Val: -999999}
+ cur := newHead
+ last := newHead
+ front := head
+ for front.Next != nil {
+ if front.Val == cur.Val {
+ // fmt.Printf("相同节点front = %v | cur = %v | last = %v\n", front.Val, cur.Val, last.Val)
+ front = front.Next
+ continue
+ } else {
+ if cur.Next != front {
+ // fmt.Printf("删除重复节点front = %v | cur = %v | last = %v\n", front.Val, cur.Val, last.Val)
+ last.Next = front
+ if front.Next != nil && front.Next.Val != front.Val {
+ last = front
+ }
+ cur = front
+ front = front.Next
+ } else {
+ // fmt.Printf("常规循环前front = %v | cur = %v | last = %v\n", front.Val, cur.Val, last.Val)
+ last = cur
+ cur = cur.Next
+ front = front.Next
+ // fmt.Printf("常规循环后front = %v | cur = %v | last = %v\n", front.Val, cur.Val, last.Val)
+
+ }
+ }
+ }
+ if front.Val == cur.Val {
+ // fmt.Printf("相同节点front = %v | cur = %v | last = %v\n", front.Val, cur.Val, last.Val)
+ last.Next = nil
+ } else {
+ if cur.Next != front {
+ last.Next = front
+ }
+ }
+ return newHead.Next
+}
+
+// 解法二
+func deleteDuplicates2(head *ListNode) *ListNode {
+ if head == nil {
+ return nil
+ }
+ if head.Next != nil && head.Val == head.Next.Val {
+ for head.Next != nil && head.Val == head.Next.Val {
+ head = head.Next
+ }
+ return deleteDuplicates(head.Next)
+ }
+ head.Next = deleteDuplicates(head.Next)
+ return head
+}
+
+func deleteDuplicates(head *ListNode) *ListNode {
+ cur := head
+ if head == nil {
+ return nil
+ }
+ if head.Next == nil {
+ return head
+ }
+ for cur.Next != nil {
+ if cur.Next.Val == cur.Val {
+ cur.Next = cur.Next.Next
+ } else {
+ cur = cur.Next
+ }
+ }
+ return head
+}
+
+// 解法三 双循环简单解法 O(n*m)
+func deleteDuplicates3(head *ListNode) *ListNode {
+ if head == nil {
+ return head
+ }
+
+ nilNode := &ListNode{Val: 0, Next: head}
+ head = nilNode
+
+ lastVal := 0
+ for head.Next != nil && head.Next.Next != nil {
+ if head.Next.Val == head.Next.Next.Val {
+ lastVal = head.Next.Val
+ for head.Next != nil && lastVal == head.Next.Val {
+ head.Next = head.Next.Next
+ }
+ } else {
+ head = head.Next
+ }
+ }
+ return nilNode.Next
+}
+
+// 解法四 双指针+删除标志位，单循环解法 O(n)
+func deleteDuplicates4(head *ListNode) *ListNode {
+ if head == nil || head.Next == nil {
+ return head
+ }
+
+ nilNode := &ListNode{Val: 0, Next: head}
+ // 上次遍历有删除操作的标志位
+ lastIsDel := false
+ // 虚拟空结点
+ head = nilNode
+ // 前后指针用于判断
+ pre, back := head.Next, head.Next.Next
+ // 每次只删除前面的一个重复的元素，留一个用于下次遍历判重
+ // pre, back 指针的更新位置和值比较重要和巧妙
+ for head.Next != nil && head.Next.Next != nil {
+ if pre.Val != back.Val && lastIsDel {
+ head.Next = head.Next.Next
+ pre, back = head.Next, head.Next.Next
+ lastIsDel = false
+ continue
+ }
+
+ if pre.Val == back.Val {
+ head.Next = head.Next.Next
+ pre, back = head.Next, head.Next.Next
+ lastIsDel = true
+ } else {
+ head = head.Next
+ pre, back = head.Next, head.Next.Next
+ lastIsDel = false
+ }
+ }
+ // 处理 [1,1] 这种删除还剩一个的情况
+ if lastIsDel && head.Next != nil {
+ head.Next = nil
+ }
+ return nilNode.Next
+}
+
+
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<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>
diff --git a/website/content/ChapterFour/0001~0099/0083.Remove-Duplicates-from-Sorted-List.md b/website/content/ChapterFour/0001~0099/0083.Remove-Duplicates-from-Sorted-List.md
new file mode 100644
index 000000000..434449c9e
--- /dev/null
+++ b/website/content/ChapterFour/0001~0099/0083.Remove-Duplicates-from-Sorted-List.md
@@ -0,0 +1,73 @@
+# [83. Remove Duplicates from Sorted List](https://leetcode.com/problems/remove-duplicates-from-sorted-list/)
+
+## 题目
+
+Given a sorted linked list, delete all duplicates such that each element appear only once.
+
+**Example 1**:
+
+```
+
+Input: 1->1->2
+Output: 1->2
+
+```
+
+**Example 2**:
+
+```
+
+Input: 1->1->2->3->3
+Output: 1->2->3
+
+```
+
+## 题目大意
+
+删除链表中重复的结点，以保障每个结点只出现一次。
+
+
+## 解题思路
+
+按照题意做即可。
+
+## 代码
+
+```go
+
+package leetcode
+
+/**
+ * Definition for singly-linked list.
+ * type ListNode struct {
+ * Val int
+ * Next *ListNode
+ * }
+ */
+
+func deleteDuplicates(head *ListNode) *ListNode {
+ cur := head
+ if head == nil {
+ return nil
+ }
+ if head.Next == nil {
+ return head
+ }
+ for cur.Next != nil {
+ if cur.Next.Val == cur.Val {
+ cur.Next = cur.Next.Next
+ } else {
+ cur = cur.Next
+ }
+ }
+ return head
+}
+
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<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>
diff --git a/website/content/ChapterFour/0001~0099/0084.Largest-Rectangle-in-Histogram.md b/website/content/ChapterFour/0001~0099/0084.Largest-Rectangle-in-Histogram.md
new file mode 100644
index 000000000..c2c9e289c
--- /dev/null
+++ b/website/content/ChapterFour/0001~0099/0084.Largest-Rectangle-in-Histogram.md
@@ -0,0 +1,83 @@
+# [84. Largest Rectangle in Histogram](https://leetcode.com/problems/largest-rectangle-in-histogram/)
+
+## 题目
+
+Given n non-negative integers representing the histogram's bar height where the width of each bar is 1, find the area of largest rectangle in the histogram.
+
+ 
+
+
+Above is a histogram where width of each bar is 1, given height = [2,1,5,6,2,3].
+
+
+
+
+The largest rectangle is shown in the shaded area, which has area = 10 unit.
+
+
+
+**Example**:
+
+```
+
+Input: [2,1,5,6,2,3]
+Output: 10
+
+```
+
+
+## 题目大意
+
+给出每个直方图的高度，要求在这些直方图之中找到面积最大的矩形，输出矩形的面积。
+
+
+## 解题思路
+
+用单调栈依次保存直方图的高度下标，一旦出现高度比栈顶元素小的情况就取出栈顶元素，单独计算一下这个栈顶元素的矩形的高度。然后停在这里(外层循环中的 i--，再 ++，就相当于停在这里了)，继续取出当前最大栈顶的前一个元素，即连续弹出 2 个最大的，以稍小的一个作为矩形的边，宽就是 2 计算面积…………如果停在这里的下标代表的高度一直比栈里面的元素小，就一直弹出，取出最后一个比当前下标大的高度作为矩形的边。宽就是最后一个比当前下标大的高度和当前下标 i 的差值。计算出面积以后不断的更新 maxArea 即可。
+
+## 代码
+
+```go
+
+package leetcode
+
+func largestRectangleArea(heights []int) int {
+ maxArea := 0
+ n := len(heights) + 2
+ // Add a sentry at the beginning and the end
+ getHeight := func(i int) int {
+ if i == 0 || n-1 == i {
+ return 0
+ }
+ return heights[i-1]
+ }
+ st := make([]int, 0, n/2)
+ for i := 0; i < n; i++ {
+ for len(st) > 0 && getHeight(st[len(st)-1]) > getHeight(i) {
+ // pop stack
+ idx := st[len(st)-1]
+ st = st[:len(st)-1]
+ maxArea = max(maxArea, getHeight(idx)*(i-st[len(st)-1]-1))
+ }
+ // push stack
+ st = append(st, i)
+ }
+ return maxArea
+}
+
+func max(a int, b int) int {
+ if a > b {
+ return a
+ }
+ return b
+}
+
+
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<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>
diff --git a/website/content/ChapterFour/0086.Partition-List.md b/website/content/ChapterFour/0001~0099/0086.Partition-List.md
similarity index 90%
rename from website/content/ChapterFour/0086.Partition-List.md
rename to website/content/ChapterFour/0001~0099/0086.Partition-List.md
index d261700df..de6bb8fcc 100644
--- a/website/content/ChapterFour/0086.Partition-List.md
+++ b/website/content/ChapterFour/0001~0099/0086.Partition-List.md
@@ -145,4 +145,11 @@ func genListNode(head *DoublyListNode) *ListNode {
return LNHead
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<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>
diff --git a/website/content/ChapterFour/0001~0099/0088.Merge-Sorted-Array.md b/website/content/ChapterFour/0001~0099/0088.Merge-Sorted-Array.md
new file mode 100644
index 000000000..5c05cffa9
--- /dev/null
+++ b/website/content/ChapterFour/0001~0099/0088.Merge-Sorted-Array.md
@@ -0,0 +1,64 @@
+# [88. Merge Sorted Array](https://leetcode.com/problems/merge-sorted-array/description/)
+
+## 题目
+
+Given two sorted integer arrays nums1 and nums2, merge nums2 into nums1 as one sorted array.
+
+**Note**:
+
+- The number of elements initialized in nums1 and nums2 are m and n respectively.
+- You may assume that nums1 has enough space (size that is equal to m + n) to hold additional elements from nums2.
+
+**Example**:
+
+ Input:
+ nums1 = [1,2,3,0,0,0], m = 3
+ nums2 = [2,5,6], n = 3
+
+ Output: [1,2,2,3,5,6]
+
+
+**Constraints**:
+
+- -10^9 <= nums1[i], nums2[i] <= 10^9
+- nums1.length == m + n
+- nums2.length == n
+
+## 题目大意
+
+合并两个已经有序的数组，结果放在第一个数组中，第一个数组假设空间足够大。要求算法时间复杂度足够低。
+
+## 解题思路
+
+为了不大量移动元素，就要从2个数组长度之和的最后一个位置开始，依次选取两个数组中大的数，从第一个数组的尾巴开始往头放，只要循环一次以后，就生成了合并以后的数组了。
+
+## 代码
+
+```go
+
+package leetcode
+
+func merge(nums1 []int, m int, nums2 []int, n int) {
+ for p := m + n; m > 0 && n > 0; p-- {
+ if nums1[m-1] <= nums2[n-1] {
+ nums1[p-1] = nums2[n-1]
+ n--
+ } else {
+ nums1[p-1] = nums1[m-1]
+ m--
+ }
+ }
+ for ; n > 0; n-- {
+ nums1[n-1] = nums2[n-1]
+ }
+}
+
+
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<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>
diff --git a/website/content/ChapterFour/0089.Gray-Code.md b/website/content/ChapterFour/0001~0099/0089.Gray-Code.md
similarity index 87%
rename from website/content/ChapterFour/0089.Gray-Code.md
rename to website/content/ChapterFour/0001~0099/0089.Gray-Code.md
index cb3d5df92..63b2e39a4 100755
--- a/website/content/ChapterFour/0089.Gray-Code.md
+++ b/website/content/ChapterFour/0001~0099/0089.Gray-Code.md
@@ -114,4 +114,11 @@ func grayCode1(n int) []int {
return out
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<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>
diff --git a/website/content/ChapterFour/0090.Subsets-II.md b/website/content/ChapterFour/0001~0099/0090.Subsets-II.md
similarity index 82%
rename from website/content/ChapterFour/0090.Subsets-II.md
rename to website/content/ChapterFour/0001~0099/0090.Subsets-II.md
index 53e156115..73c331b1c 100755
--- a/website/content/ChapterFour/0090.Subsets-II.md
+++ b/website/content/ChapterFour/0001~0099/0090.Subsets-II.md
@@ -73,4 +73,11 @@ func generateSubsetsWithDup(nums []int, k, start int, c []int, res *[][]int) {
return
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<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>
diff --git a/website/content/ChapterFour/0001~0099/0091.Decode-Ways.md b/website/content/ChapterFour/0001~0099/0091.Decode-Ways.md
new file mode 100755
index 000000000..7ac985062
--- /dev/null
+++ b/website/content/ChapterFour/0001~0099/0091.Decode-Ways.md
@@ -0,0 +1,76 @@
+# [91. Decode Ways](https://leetcode.com/problems/decode-ways/)
+
+
+## 题目
+
+A message containing letters from `A-Z` is being encoded to numbers using the following mapping:
+
+ 'A' -> 1
+ 'B' -> 2
+ ...
+ 'Z' -> 26
+
+Given a **non-empty** string containing only digits, determine the total number of ways to decode it.
+
+**Example 1**:
+
+ Input: "12"
+ Output: 2
+ Explanation: It could be decoded as "AB" (1 2) or "L" (12).
+
+**Example 2**:
+
+ Input: "226"
+ Output: 3
+ Explanation: It could be decoded as "BZ" (2 26), "VF" (22 6), or "BBF" (2 2 6).
+
+## 题目大意
+
+一条包含字母 A-Z 的消息通过以下方式进行了编码：
+
+```go
+'A' -> 1
+'B' -> 2
+...
+'Z' -> 26
+```
+
+给定一个只包含数字的非空字符串，请计算解码方法的总数。
+
+
+
+## 解题思路
+
+- 给出一个数字字符串，题目要求把数字映射成 26 个字母，映射以后问有多少种可能的翻译方法。
+- 这题思路也是 DP。`dp[n]` 代表翻译长度为 n 个字符的字符串的方法总数。由于题目中的数字可能出现 0，0 不能翻译成任何字母，所以出现 0 要跳过。dp[0] 代表空字符串，只有一种翻译方法，`dp[0] = 1`。dp[1] 需要考虑原字符串是否是 0 开头的，如果是 0 开头的，`dp[1] = 0`，如果不是 0 开头的，`dp[1] = 1`。状态转移方程是 `dp[i] += dp[i-1] (当 1 ≤ s[i-1 : i] ≤ 9)；dp[i] += dp[i-2] (当 10 ≤ s[i-2 : i] ≤ 26)`。最终结果是 `dp[n]`。
+
+
+## 代码
+
+```go
+
+package leetcode
+
+func numDecodings(s string) int {
+ n := len(s)
+ dp := make([]int, n+1)
+ dp[0] = 1
+ for i := 1; i <= n; i++ {
+ if s[i-1] != '0' {
+ dp[i] += dp[i-1]
+ }
+ if i > 1 && s[i-2] != '0' && (s[i-2]-'0')*10+(s[i-1]-'0') <= 26 {
+ dp[i] += dp[i-2]
+ }
+ }
+ return dp[n]
+}
+
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<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>
diff --git a/website/content/ChapterFour/0092.Reverse-Linked-List-II.md b/website/content/ChapterFour/0001~0099/0092.Reverse-Linked-List-II.md
similarity index 81%
rename from website/content/ChapterFour/0092.Reverse-Linked-List-II.md
rename to website/content/ChapterFour/0001~0099/0092.Reverse-Linked-List-II.md
index 59cd5d573..d7f3dc7e3 100644
--- a/website/content/ChapterFour/0092.Reverse-Linked-List-II.md
+++ b/website/content/ChapterFour/0001~0099/0092.Reverse-Linked-List-II.md
@@ -62,4 +62,11 @@ func reverseBetween(head *ListNode, m int, n int) *ListNode {
return newHead.Next
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<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>
diff --git a/website/content/ChapterFour/0093.Restore-IP-Addresses.md b/website/content/ChapterFour/0001~0099/0093.Restore-IP-Addresses.md
similarity index 78%
rename from website/content/ChapterFour/0093.Restore-IP-Addresses.md
rename to website/content/ChapterFour/0001~0099/0093.Restore-IP-Addresses.md
index 1ef2120d0..ba641bfe8 100755
--- a/website/content/ChapterFour/0093.Restore-IP-Addresses.md
+++ b/website/content/ChapterFour/0001~0099/0093.Restore-IP-Addresses.md
@@ -75,4 +75,11 @@ func getString(ip []int) string {
return res
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<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>
diff --git a/website/content/ChapterFour/0001~0099/0094.Binary-Tree-Inorder-Traversal.md b/website/content/ChapterFour/0001~0099/0094.Binary-Tree-Inorder-Traversal.md
new file mode 100644
index 000000000..7656edd67
--- /dev/null
+++ b/website/content/ChapterFour/0001~0099/0094.Binary-Tree-Inorder-Traversal.md
@@ -0,0 +1,80 @@
+# [94. Binary Tree Inorder Traversal](https://leetcode.com/problems/binary-tree-inorder-traversal/)
+
+## 题目
+
+
+Given a binary tree, return the inorder traversal of its nodes' values.
+
+
+
+**Example**:
+
+```
+
+Input: [1,null,2,3]
+ 1
+ \
+ 2
+ /
+ 3
+
+Output: [1,3,2]
+
+```
+
+
+**Follow up**: Recursive solution is trivial, could you do it iteratively?
+
+
+
+
+
+
+## 题目大意
+
+中根遍历一颗树。
+
+## 解题思路
+
+递归的实现方法，见代码。
+
+
+
+
+
+## 代码
+
+```go
+
+package leetcode
+
+/**
+ * Definition for a binary tree node.
+ * type TreeNode struct {
+ * Val int
+ * Left *TreeNode
+ * Right *TreeNode
+ * }
+ */
+func inorderTraversal(root *TreeNode) []int {
+ var result []int
+ inorder(root, &result)
+ return result
+}
+
+func inorder(root *TreeNode, output *[]int) {
+ if root != nil {
+ inorder(root.Left, output)
+ *output = append(*output, root.Val)
+ inorder(root.Right, output)
+ }
+}
+
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<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>
diff --git a/website/content/ChapterFour/0095.Unique-Binary-Search-Trees-II.md b/website/content/ChapterFour/0001~0099/0095.Unique-Binary-Search-Trees-II.md
similarity index 80%
rename from website/content/ChapterFour/0095.Unique-Binary-Search-Trees-II.md
rename to website/content/ChapterFour/0001~0099/0095.Unique-Binary-Search-Trees-II.md
index 790470c16..4ba09dfdf 100755
--- a/website/content/ChapterFour/0095.Unique-Binary-Search-Trees-II.md
+++ b/website/content/ChapterFour/0001~0099/0095.Unique-Binary-Search-Trees-II.md
@@ -75,4 +75,11 @@ func generateBSTree(start, end int) []*TreeNode {
return tree
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<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>
diff --git a/website/content/ChapterFour/0096.Unique-Binary-Search-Trees.md b/website/content/ChapterFour/0001~0099/0096.Unique-Binary-Search-Trees.md
similarity index 84%
rename from website/content/ChapterFour/0096.Unique-Binary-Search-Trees.md
rename to website/content/ChapterFour/0001~0099/0096.Unique-Binary-Search-Trees.md
index a3fca5ef1..f98628afc 100755
--- a/website/content/ChapterFour/0096.Unique-Binary-Search-Trees.md
+++ b/website/content/ChapterFour/0001~0099/0096.Unique-Binary-Search-Trees.md
@@ -50,4 +50,11 @@ func numTrees(n int) int {
return dp[n]
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<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/0097.Interleaving-String/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0001~0099/0097.Interleaving-String.md b/website/content/ChapterFour/0001~0099/0097.Interleaving-String.md
new file mode 100644
index 000000000..2b6daae8c
--- /dev/null
+++ b/website/content/ChapterFour/0001~0099/0097.Interleaving-String.md
@@ -0,0 +1,111 @@
+# [97. Interleaving String](https://leetcode.com/problems/interleaving-string/)
+
+
+## 题目
+
+Given strings `s1`, `s2`, and `s3`, find whether `s3` is formed by an **interleaving** of `s1` and `s2`.
+
+An **interleaving** of two strings `s` and `t` is a configuration where they are divided into **non-empty** substrings such that:
+
+- `s = s1 + s2 + ... + sn`
+- `t = t1 + t2 + ... + tm`
+- `|n - m| <= 1`
+- The **interleaving** is `s1 + t1 + s2 + t2 + s3 + t3 + ...` or `t1 + s1 + t2 + s2 + t3 + s3 + ...`
+
+**Note:** `a + b` is the concatenation of strings `a` and `b`.
+
+**Example 1:**
+
+
+
+```
+Input: s1 = "aabcc", s2 = "dbbca", s3 = "aadbbcbcac"
+Output: true
+
+```
+
+**Example 2:**
+
+```
+Input: s1 = "aabcc", s2 = "dbbca", s3 = "aadbbbaccc"
+Output: false
+
+```
+
+**Example 3:**
+
+```
+Input: s1 = "", s2 = "", s3 = ""
+Output: true
+
+```
+
+**Constraints:**
+
+- `0 <= s1.length, s2.length <= 100`
+- `0 <= s3.length <= 200`
+- `s1`, `s2`, and `s3` consist of lowercase English letters.
+
+**Follow up:** Could you solve it using only `O(s2.length)` additional memory space?
+
+## 题目大意
+
+给定三个字符串 s1、s2、s3，请你帮忙验证 s3 是否是由 s1 和 s2 交错 组成的。两个字符串 s 和 t 交错 的定义与过程如下，其中每个字符串都会被分割成若干 非空 子字符串：
+
+- s = s1 + s2 + ... + sn
+- t = t1 + t2 + ... + tm
+- |n - m| <= 1
+- 交错 是 s1 + t1 + s2 + t2 + s3 + t3 + ... 或者 t1 + s1 + t2 + s2 + t3 + s3 + ...
+
+提示：a + b 意味着字符串 a 和 b 连接。
+
+## 解题思路
+
+- 深搜或者广搜暴力解题。笔者用深搜实现的。记录 s1 和 s2 串当前比较的位置 p1 和 p2。如果 s3[p1+p2] 的位置上等于 s1[p1] 或者 s2[p2] 代表能匹配上，那么继续往后移动 p1 和 p2 相应的位置。因为是交错字符串，所以判断匹配的位置是 s3[p1+p2] 的位置。如果仅仅这么写，会超时，s1 和 s2 两个字符串重复交叉判断的位置太多了。需要加上记忆化搜索。可以用 visited[i][j] 这样的二维数组来记录是否搜索过了。笔者为了压缩空间，将 i 和 j 编码压缩到一维数组了。i * len(s3) + j 是唯一下标，所以可以用这种方式存储是否搜索过。具体代码见下面的实现。
+
+## 代码
+
+```go
+package leetcode
+
+func isInterleave(s1 string, s2 string, s3 string) bool {
+ if len(s1)+len(s2) != len(s3) {
+ return false
+ }
+ visited := make(map[int]bool)
+ return dfs(s1, s2, s3, 0, 0, visited)
+}
+
+func dfs(s1, s2, s3 string, p1, p2 int, visited map[int]bool) bool {
+ if p1+p2 == len(s3) {
+ return true
+ }
+ if _, ok := visited[(p1*len(s3))+p2]; ok {
+ return false
+ }
+ visited[(p1*len(s3))+p2] = true
+ var match1, match2 bool
+ if p1 < len(s1) && s3[p1+p2] == s1[p1] {
+ match1 = true
+ }
+ if p2 < len(s2) && s3[p1+p2] == s2[p2] {
+ match2 = true
+ }
+ if match1 && match2 {
+ return dfs(s1, s2, s3, p1+1, p2, visited) || dfs(s1, s2, s3, p1, p2+1, visited)
+ } else if match1 {
+ return dfs(s1, s2, s3, p1+1, p2, visited)
+ } else if match2 {
+ return dfs(s1, s2, s3, p1, p2+1, visited)
+ } else {
+ return false
+ }
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<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/0098.Validate-Binary-Search-Tree/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0098.Validate-Binary-Search-Tree.md b/website/content/ChapterFour/0001~0099/0098.Validate-Binary-Search-Tree.md
similarity index 84%
rename from website/content/ChapterFour/0098.Validate-Binary-Search-Tree.md
rename to website/content/ChapterFour/0001~0099/0098.Validate-Binary-Search-Tree.md
index 870f35989..ffc988c57 100755
--- a/website/content/ChapterFour/0098.Validate-Binary-Search-Tree.md
+++ b/website/content/ChapterFour/0001~0099/0098.Validate-Binary-Search-Tree.md
@@ -11,7 +11,7 @@ Assume a BST is defined as follows:
- The right subtree of a node contains only nodes with keys **greater than** the node's key.
- Both the left and right subtrees must also be binary search trees.
-**xample 1:**
+**Example 1**:
2
/ \
@@ -96,4 +96,11 @@ func inOrder(root *TreeNode, arr *[]int) {
inOrder(root.Right, arr)
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0001~0099/0097.Interleaving-String/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0001~0099/0099.Recover-Binary-Search-Tree/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0099.Recover-Binary-Search-Tree.md b/website/content/ChapterFour/0001~0099/0099.Recover-Binary-Search-Tree.md
similarity index 86%
rename from website/content/ChapterFour/0099.Recover-Binary-Search-Tree.md
rename to website/content/ChapterFour/0001~0099/0099.Recover-Binary-Search-Tree.md
index 0a0e86e98..4a28ea15d 100755
--- a/website/content/ChapterFour/0099.Recover-Binary-Search-Tree.md
+++ b/website/content/ChapterFour/0001~0099/0099.Recover-Binary-Search-Tree.md
@@ -98,4 +98,11 @@ func inOrderTraverse(root, prev, target1, target2 *TreeNode) (*TreeNode, *TreeNo
return prev, target1, target2
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<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>
diff --git a/website/content/ChapterFour/0001~0099/_index.md b/website/content/ChapterFour/0001~0099/_index.md
new file mode 100644
index 000000000..d2021683f
--- /dev/null
+++ b/website/content/ChapterFour/0001~0099/_index.md
@@ -0,0 +1,5 @@
+---
+bookCollapseSection: true
+weight: 20
+---
+
diff --git a/website/content/ChapterFour/0003.Longest-Substring-Without-Repeating-Characters.md b/website/content/ChapterFour/0003.Longest-Substring-Without-Repeating-Characters.md
deleted file mode 100644
index 36e027da8..000000000
--- a/website/content/ChapterFour/0003.Longest-Substring-Without-Repeating-Characters.md
+++ /dev/null
@@ -1,124 +0,0 @@
-# [3. Longest Substring Without Repeating Characters](https://leetcode.com/problems/longest-substring-without-repeating-characters/)
-
-## 题目
-
-Given a string, find the length of the longest substring without repeating characters.
-
-
-
-**Example 1**:
-
-```
-
-Input: "abcabcbb"
-Output: 3
-Explanation: The answer is "abc", with the length of 3.
-
-```
-
-**Example 2**:
-
-```
-
-Input: "bbbbb"
-Output: 1
-Explanation: The answer is "b", with the length of 1.
-
-```
-
-**Example 3**:
-
-```
-
-Input: "pwwkew"
-Output: 3
-Explanation: The answer is "wke", with the length of 3.
- Note that the answer must be a substring, "pwke" is a subsequence and not a substring.
-
-```
-
-## 题目大意
-
-
-在一个字符串重寻找没有重复字母的最长子串。
-
-## 解题思路
-
-这一题和第 438 题，第 3 题，第 76 题，第 567 题类似，用的思想都是"滑动窗口"。
-
-滑动窗口的右边界不断的右移，只要没有重复的字符，就持续向右扩大窗口边界。一旦出现了重复字符，就需要缩小左边界，直到重复的字符移出了左边界，然后继续移动滑动窗口的右边界。以此类推，每次移动需要计算当前长度，并判断是否需要更新最大长度，最终最大的值就是题目中的所求。
-
-
-## 代码
-
-```go
-
-package leetcode
-
-// 解法一 位图
-func lengthOfLongestSubstring(s string) int {
- if len(s) == 0 {
- return 0
- }
- var bitSet [256]bool
- result, left, right := 0, 0, 0
- for left < len(s) {
- // 右侧字符对应的 bitSet 被标记 true，说明此字符在 X 位置重复，需要左侧向前移动，直到将X标记为 false
- if bitSet[s[right]] {
- bitSet[s[left]] = false
- left++
- } else {
- bitSet[s[right]] = true
- right++
- }
- if result < right-left {
- result = right - left
- }
- if left+result >= len(s) || right >= len(s) {
- break
- }
- }
- return result
-}
-
-// 解法二 滑动窗口
-func lengthOfLongestSubstring_(s string) int {
- if len(s) == 0 {
- return 0
- }
- var freq [256]int
- result, left, right := 0, 0, -1
-
- for left < len(s) {
- if right+1 < len(s) && freq[s[right+1]-'a'] == 0 {
- freq[s[right+1]-'a']++
- right++
- } else {
- freq[s[left]-'a']--
- left++
- }
- result = max(result, right-left+1)
- }
- return result
-}
-
-func max(a int, b int) int {
- if a > b {
- return a
- }
- return b
-}
-
-
-```
-
-
-
-
-
-
-
-
-
-
-
diff --git a/website/content/ChapterFour/0009.Palindrome-Number.md b/website/content/ChapterFour/0009.Palindrome-Number.md
deleted file mode 100644
index d01fc716d..000000000
--- a/website/content/ChapterFour/0009.Palindrome-Number.md
+++ /dev/null
@@ -1,69 +0,0 @@
-# [9. Palindrome Number](https://leetcode.com/problems/palindrome-number/)
-
-
-## 题目
-
-Determine whether an integer is a palindrome. An integer is a palindrome when it reads the same backward as forward.
-
-**Example 1**:
-
-```
-Input: 121
-Output: true
-```
-
-**Example 2**:
-
-```
-Input: -121
-Output: false
-Explanation: From left to right, it reads -121. From right to left, it becomes 121-. Therefore it is not a palindrome.
-```
-
-**Example 3**:
-
-```
-Input: 10
-Output: false
-Explanation: Reads 01 from right to left. Therefore it is not a palindrome.
-```
-
-**Follow up**:
-
-Coud you solve it without converting the integer to a string?
-
-## 题目大意
-
-判断一个整数是否是回文数。回文数是指正序（从左向右）和倒序（从右向左）读都是一样的整数。
-
-## 解题思路
-
-- 判断一个整数是不是回文数。
-- 简单题。注意会有负数的情况，负数，个位数，10 都不是回文数。其他的整数再按照回文的规则判断。
-
-## 代码
-
-```go
-
-package leetcode
-
-import "strconv"
-
-func isPalindrome(x int) bool {
- if x < 0 {
- return false
- }
- if x < 10 {
- return true
- }
- s := strconv.Itoa(x)
- length := len(s)
- for i := 0; i <= length/2; i++ {
- if s[i] != s[length-1-i] {
- return false
- }
- }
- return true
-}
-
-```
\ No newline at end of file
diff --git a/website/content/ChapterFour/0015.3Sum.md b/website/content/ChapterFour/0015.3Sum.md
deleted file mode 100644
index 454f3aeec..000000000
--- a/website/content/ChapterFour/0015.3Sum.md
+++ /dev/null
@@ -1,83 +0,0 @@
-# [15. 3Sum](https://leetcode.com/problems/3sum/)
-
-## 题目
-
-Given an array nums of n integers, are there elements a, b, c in nums such that a + b + c = 0? Find all unique triplets in the array which gives the sum of zero.
-
-**Note**:
-
-The solution set must not contain duplicate triplets.
-
-**Example**:
-
-```
-
-Given array nums = [-1, 0, 1, 2, -1, -4],
-
-A solution set is:
-[
- [-1, 0, 1],
- [-1, -1, 2]
-]
-
-```
-
-## 题目大意
-
-给定一个数组，要求在这个数组中找出 3 个数之和为 0 的所有组合。
-
-## 解题思路
-
-用 map 提前计算好任意 2 个数字之和，保存起来，可以将时间复杂度降到 O(n^2)。这一题比较麻烦的一点在于，最后输出解的时候，要求输出不重复的解。数组中同一个数字可能出现多次，同一个数字也可能使用多次，但是最后输出解的时候，不能重复。例如 [-1，-1，2] 和 [2, -1, -1]、[-1, 2, -1] 这 3 个解是重复的，即使 -1 可能出现 100 次，每次使用的 -1 的数组下标都是不同的。
-
-这里就需要去重和排序了。map 记录每个数字出现的次数，然后对 map 的 key 数组进行排序，最后在这个排序以后的数组里面扫，找到另外 2 个数字能和自己组成 0 的组合。
-
-## 代码
-
-```go
-
-package leetcode
-
-import (
- "sort"
-)
-
-func threeSum(nums []int) [][]int {
- res := [][]int{}
- counter := map[int]int{}
- for _, value := range nums {
- counter[value]++
- }
-
- uniqNums := []int{}
- for key := range counter {
- uniqNums = append(uniqNums, key)
- }
- sort.Ints(uniqNums)
-
- for i := 0; i < len(uniqNums); i++ {
- if (uniqNums[i]*3 == 0) && counter[uniqNums[i]] >= 3 {
- res = append(res, []int{uniqNums[i], uniqNums[i], uniqNums[i]})
- }
- for j := i + 1; j < len(uniqNums); j++ {
- if (uniqNums[i]*2+uniqNums[j] == 0) && counter[uniqNums[i]] > 1 {
- res = append(res, []int{uniqNums[i], uniqNums[i], uniqNums[j]})
- }
- if (uniqNums[j]*2+uniqNums[i] == 0) && counter[uniqNums[j]] > 1 {
- res = append(res, []int{uniqNums[i], uniqNums[j], uniqNums[j]})
- }
- c := 0 - uniqNums[i] - uniqNums[j]
- if c > uniqNums[j] && counter[c] > 0 {
- res = append(res, []int{uniqNums[i], uniqNums[j], c})
- }
- }
- }
- return res
-}
-
-
-```
-
-
-
-
diff --git a/website/content/ChapterFour/0018.4Sum.md b/website/content/ChapterFour/0018.4Sum.md
deleted file mode 100644
index e0f70941f..000000000
--- a/website/content/ChapterFour/0018.4Sum.md
+++ /dev/null
@@ -1,97 +0,0 @@
-# [18. 4Sum](https://leetcode.com/problems/4sum/)
-
-## 题目
-
-Given an array nums of n integers and an integer target, are there elements a, b, c, and d in nums such that a + b + c + d = target? Find all unique quadruplets in the array which gives the sum of target.
-
-**Note**:
-
-The solution set must not contain duplicate quadruplets.
-
-**Example**:
-
-```
-
-Given array nums = [1, 0, -1, 0, -2, 2], and target = 0.
-
-A solution set is:
-[
- [-1, 0, 0, 1],
- [-2, -1, 1, 2],
- [-2, 0, 0, 2]
-]
-
-```
-
-## 题目大意
-
-给定一个数组，要求在这个数组中找出 4 个数之和为 0 的所有组合。
-
-
-## 解题思路
-
-用 map 提前计算好任意 3 个数字之和，保存起来，可以将时间复杂度降到 O(n^3)。这一题比较麻烦的一点在于，最后输出解的时候，要求输出不重复的解。数组中同一个数字可能出现多次，同一个数字也可能使用多次，但是最后输出解的时候，不能重复。例如 [-1，1，2, -2] 和 [2, -1, -2, 1]、[-2, 2, -1, 1] 这 3 个解是重复的，即使 -1, -2 可能出现 100 次，每次使用的 -1, -2 的数组下标都是不同的。
-
-这一题是第 15 题的升级版，思路都是完全一致的。这里就需要去重和排序了。map 记录每个数字出现的次数，然后对 map 的 key 数组进行排序，最后在这个排序以后的数组里面扫，找到另外 3 个数字能和自己组成 0 的组合。
-
-第 15 题和第 18 题的解法一致。
-
-## 代码
-
-```go
-
-package leetcode
-
-import "sort"
-
-func fourSum(nums []int, target int) [][]int {
- res := [][]int{}
- counter := map[int]int{}
- for _, value := range nums {
- counter[value]++
- }
-
- uniqNums := []int{}
- for key := range counter {
- uniqNums = append(uniqNums, key)
- }
- sort.Ints(uniqNums)
-
- for i := 0; i < len(uniqNums); i++ {
- if (uniqNums[i]*4 == target) && counter[uniqNums[i]] >= 4 {
- res = append(res, []int{uniqNums[i], uniqNums[i], uniqNums[i], uniqNums[i]})
- }
- for j := i + 1; j < len(uniqNums); j++ {
- if (uniqNums[i]*3+uniqNums[j] == target) && counter[uniqNums[i]] > 2 {
- res = append(res, []int{uniqNums[i], uniqNums[i], uniqNums[i], uniqNums[j]})
- }
- if (uniqNums[j]*3+uniqNums[i] == target) && counter[uniqNums[j]] > 2 {
- res = append(res, []int{uniqNums[i], uniqNums[j], uniqNums[j], uniqNums[j]})
- }
- if (uniqNums[j]*2+uniqNums[i]*2 == target) && counter[uniqNums[j]] > 1 && counter[uniqNums[i]] > 1 {
- res = append(res, []int{uniqNums[i], uniqNums[i], uniqNums[j], uniqNums[j]})
- }
- for k := j + 1; k < len(uniqNums); k++ {
- if (uniqNums[i]*2+uniqNums[j]+uniqNums[k] == target) && counter[uniqNums[i]] > 1 {
- res = append(res, []int{uniqNums[i], uniqNums[i], uniqNums[j], uniqNums[k]})
- }
- if (uniqNums[j]*2+uniqNums[i]+uniqNums[k] == target) && counter[uniqNums[j]] > 1 {
- res = append(res, []int{uniqNums[i], uniqNums[j], uniqNums[j], uniqNums[k]})
- }
- if (uniqNums[k]*2+uniqNums[i]+uniqNums[j] == target) && counter[uniqNums[k]] > 1 {
- res = append(res, []int{uniqNums[i], uniqNums[j], uniqNums[k], uniqNums[k]})
- }
- c := target - uniqNums[i] - uniqNums[j] - uniqNums[k]
- if c > uniqNums[k] && counter[c] > 0 {
- res = append(res, []int{uniqNums[i], uniqNums[j], uniqNums[k], c})
- }
- }
- }
- }
- return res
-}
-
-
-```
-
-
diff --git a/website/content/ChapterFour/0019.Remove-Nth-Node-From-End-of-List.md b/website/content/ChapterFour/0019.Remove-Nth-Node-From-End-of-List.md
deleted file mode 100644
index 0cb4c9d0f..000000000
--- a/website/content/ChapterFour/0019.Remove-Nth-Node-From-End-of-List.md
+++ /dev/null
@@ -1,100 +0,0 @@
-# [19. Remove Nth Node From End of List](https://leetcode.com/problems/remove-nth-node-from-end-of-list/)
-
-## 题目
-
-Given a linked list, remove the n-th node from the end of list and return its head.
-
-**Example**:
-
-```
-
-Given linked list: 1->2->3->4->5, and n = 2.
-
-After removing the second node from the end, the linked list becomes 1->2->3->5.
-
-```
-
-## 题目大意
-
-删除链表中倒数第 n 个结点。
-
-## 解题思路
-
-这道题比较简单，先循环一次拿到链表的总长度，然后循环到要删除的结点的前一个结点开始删除操作。需要注意的一个特例是，有可能要删除头结点，要单独处理。
-
-这道题有一种特别简单的解法。设置 2 个指针，一个指针距离前一个指针 n 个距离。同时移动 2 个指针，2 个指针都移动相同的距离。当一个指针移动到了终点，那么前一个指针就是倒数第 n 个节点了。
-
-## 代码
-
-```go
-
-package leetcode
-
-/**
- * Definition for singly-linked list.
- * type ListNode struct {
- * Val int
- * Next *ListNode
- * }
- */
-
-// 解法一
-func removeNthFromEnd(head *ListNode, n int) *ListNode {
- var fast, slow *ListNode
- fast = head
- slow = head
- for i := 0; i < n; i++ {
- fast = fast.Next
- }
- if fast == nil {
- head = head.Next
- return head
- }
- for fast.Next != nil {
- fast = fast.Next
- slow = slow.Next
- }
- slow.Next = slow.Next.Next
- return head
-}
-
-// 解法二
-func removeNthFromEnd1(head *ListNode, n int) *ListNode {
- if head == nil {
- return nil
- }
- if n <= 0 {
- return head
- }
- current := head
- len := 0
- for current != nil {
- len++
- current = current.Next
- }
- if n > len {
- return head
- }
- if n == len {
- current := head
- head = head.Next
- current.Next = nil
- return head
- }
- current = head
- i := 0
- for current != nil {
- if i == len-n-1 {
- deleteNode := current.Next
- current.Next = current.Next.Next
- deleteNode.Next = nil
- break
- }
- i++
- current = current.Next
- }
- return head
-}
-
-
-```
diff --git a/website/content/ChapterFour/0021.Merge-Two-Sorted-Lists.md b/website/content/ChapterFour/0021.Merge-Two-Sorted-Lists.md
deleted file mode 100644
index cc559bc3c..000000000
--- a/website/content/ChapterFour/0021.Merge-Two-Sorted-Lists.md
+++ /dev/null
@@ -1,53 +0,0 @@
-# [21. Merge Two Sorted Lists](https://leetcode.com/problems/merge-two-sorted-lists/)
-
-## 题目
-
-Merge two sorted linked lists and return it as a new list. The new list should be made by splicing together the nodes of the first two lists.
-
-**Example**:
-
-```
-
-Input: 1->2->4, 1->3->4
-Output: 1->1->2->3->4->4
-
-```
-
-## 题目大意
-
-合并 2 个有序链表
-
-## 解题思路
-
-按照题意做即可。
-
-## 代码
-
-```go
-
-package leetcode
-
-/**
- * Definition for singly-linked list.
- * type ListNode struct {
- * Val int
- * Next *ListNode
- * }
- */
-func mergeTwoLists(l1 *ListNode, l2 *ListNode) *ListNode {
- if l1 == nil {
- return l2
- }
- if l2 == nil {
- return l1
- }
- if l1.Val < l2.Val {
- l1.Next = mergeTwoLists(l1.Next, l2)
- return l1
- }
- l2.Next = mergeTwoLists(l1, l2.Next)
- return l2
-}
-
-
-```
diff --git a/website/content/ChapterFour/0023.Merge-k-Sorted-Lists.md b/website/content/ChapterFour/0023.Merge-k-Sorted-Lists.md
deleted file mode 100644
index 3166c480b..000000000
--- a/website/content/ChapterFour/0023.Merge-k-Sorted-Lists.md
+++ /dev/null
@@ -1,74 +0,0 @@
-# [23. Merge k Sorted Lists](https://leetcode.com/problems/merge-k-sorted-lists/)
-
-## 题目
-
-Merge k sorted linked lists and return it as one sorted list. Analyze and describe its complexity.
-
-
-
-**Example**:
-
-```
-
-Input:
-[
- 1->4->5,
- 1->3->4,
- 2->6
-]
-Output: 1->1->2->3->4->4->5->6
-
-```
-
-## 题目大意
-
-合并 K 个有序链表
-
-## 解题思路
-
-借助分治的思想，把 K 个有序链表两两合并即可。相当于是第 21 题的加强版。
-
-## 代码
-
-```go
-
-package leetcode
-
-/**
- * Definition for singly-linked list.
- * type ListNode struct {
- * Val int
- * Next *ListNode
- * }
- */
-func mergeKLists(lists []*ListNode) *ListNode {
- length := len(lists)
- if length < 1 {
- return nil
- }
- if length == 1 {
- return lists[0]
- }
- num := length / 2
- left := mergeKLists(lists[:num])
- right := mergeKLists(lists[num:])
- return mergeTwoLists1(left, right)
-}
-
-func mergeTwoLists1(l1 *ListNode, l2 *ListNode) *ListNode {
- if l1 == nil {
- return l2
- }
- if l2 == nil {
- return l1
- }
- if l1.Val < l2.Val {
- l1.Next = mergeTwoLists1(l1.Next, l2)
- return l1
- }
- l2.Next = mergeTwoLists1(l1, l2.Next)
- return l2
-}
-
-
-```
diff --git a/website/content/ChapterFour/0024.Swap-Nodes-in-Pairs.md b/website/content/ChapterFour/0024.Swap-Nodes-in-Pairs.md
deleted file mode 100644
index 017a0eb43..000000000
--- a/website/content/ChapterFour/0024.Swap-Nodes-in-Pairs.md
+++ /dev/null
@@ -1,71 +0,0 @@
-# [24. Swap Nodes in Pairs](https://leetcode.com/problems/swap-nodes-in-pairs/description/)
-
-## 题目
-
-Given a linked list, swap every two adjacent nodes and return its head.
-
-You may not modify the values in the list's nodes, only nodes itself may be changed.
-
-
-
-**Example**:
-
-```
-
-Given 1->2->3->4, you should return the list as 2->1->4->3.
-
-```
-
-## 题目大意
-
-两两相邻的元素，翻转链表
-
-## 解题思路
-
-按照题意做即可。
-
-## 代码
-
-```go
-
-package leetcode
-
-/**
- * Definition for singly-linked list.
- * type ListNode struct {
- * Val int
- * Next *ListNode
- * }
- */
-
-func swapPairs(head *ListNode) *ListNode {
- if head == nil || head.Next == nil {
- return head
- }
- s := head.Next
- var behind *ListNode
- for head.Next != nil {
- headNext := head.Next
- if behind != nil && behind.Next != nil {
- behind.Next = headNext
- }
- var next *ListNode
- if head.Next.Next != nil {
- next = head.Next.Next
- }
- if head.Next.Next != nil {
- head.Next = next
- } else {
- head.Next = nil
- }
- headNext.Next = head
- behind = head
- if head.Next != nil {
- head = next
- }
- }
- return s
-}
-
-
-```
diff --git a/website/content/ChapterFour/0028.Implement-strStr.md b/website/content/ChapterFour/0028.Implement-strStr.md
deleted file mode 100644
index 4bcbaebbf..000000000
--- a/website/content/ChapterFour/0028.Implement-strStr.md
+++ /dev/null
@@ -1,86 +0,0 @@
-# [28. Implement strStr()](https://leetcode.com/problems/implement-strstr/)
-
-## 题目
-
-Implement strStr().
-
-Return the index of the first occurrence of needle in haystack, or -1 if needle is not part of haystack.
-
-
-**Example 1**:
-
-```
-
-Input: haystack = "hello", needle = "ll"
-Output: 2
-
-```
-
-**Example 2**:
-
-```
-
-Input: haystack = "aaaaa", needle = "bba"
-Output: -1
-
-```
-
-**Clarification**:
-
-What should we return when needle is an empty string? This is a great question to ask during an interview.
-
-For the purpose of this problem, we will return 0 when needle is an empty string. This is consistent to C's strstr() and Java's indexOf().
-
-## 题目大意
-
-
-实现一个查找 substring 的函数。如果在母串中找到了子串，返回子串在母串中出现的下标，如果没有找到，返回 -1，如果子串是空串，则返回 0 。
-
-## 解题思路
-
-这一题比较简单，直接写即可。
-
-## 代码
-
-```go
-
-package leetcode
-
-import "strings"
-
-// 解法一
-func strStr(haystack string, needle string) int {
- for i := 0; ; i++ {
- for j := 0; ; j++ {
- if j == len(needle) {
- return i
- }
- if i+j == len(haystack) {
- return -1
- }
- if needle[j] != haystack[i+j] {
- break
- }
- }
- }
-}
-
-// 解法二
-func strStr1(haystack string, needle string) int {
- return strings.Index(haystack, needle)
-}
-
-
-```
-
-
-
-
-
-
-
-
-
-
-
-
diff --git a/website/content/ChapterFour/0041.First-Missing-Positive.md b/website/content/ChapterFour/0041.First-Missing-Positive.md
deleted file mode 100644
index 88564723e..000000000
--- a/website/content/ChapterFour/0041.First-Missing-Positive.md
+++ /dev/null
@@ -1,66 +0,0 @@
-# [41. First Missing Positive](https://leetcode.com/problems/first-missing-positive/description/)
-
-## 题目
-
-Given an unsorted integer array, find the smallest missing positive integer.
-
-**Example 1**:
-
-```
-
-Input: [1,2,0]
-Output: 3
-
-```
-
-**Example 2**:
-
-```
-
-Input: [3,4,-1,1]
-Output: 2
-
-```
-
-**Example 3**:
-
-```
-
-Input: [7,8,9,11,12]
-Output: 1
-
-```
-
-**Note**:
-
-Your algorithm should run in O(n) time and uses constant extra space.
-
-## 题目大意
-
-找到缺失的第一个正整数。
-
-## 解题思路
-
-
-为了减少时间复杂度，可以把 input 数组都装到 map 中，然后 i 循环从 1 开始，依次比对 map 中是否存在 i，只要不存在 i 就立即返回结果，即所求。
-
-## 代码
-
-```go
-
-package leetcode
-
-func firstMissingPositive(nums []int) int {
- numMap := make(map[int]int, len(nums))
- for _, v := range nums {
- numMap[v] = v
- }
- for index := 1; index < len(nums)+1; index++ {
- if _, ok := numMap[index]; !ok {
- return index
- }
- }
- return len(nums) + 1
-}
-
-```
diff --git a/website/content/ChapterFour/0042.Trapping-Rain-Water.md b/website/content/ChapterFour/0042.Trapping-Rain-Water.md
deleted file mode 100644
index 1b0dd4b76..000000000
--- a/website/content/ChapterFour/0042.Trapping-Rain-Water.md
+++ /dev/null
@@ -1,61 +0,0 @@
-# [42. Trapping Rain Water](https://leetcode.com/problems/trapping-rain-water/)
-
-## 题目
-
-Given n non-negative integers representing an elevation map where the width of each bar is 1, compute how much water it is able to trap after raining.
-
-
-
-
-The above elevation map is represented by array [0,1,0,2,1,0,1,3,2,1,2,1]. In this case, 6 units of rain water (blue section) are being trapped. Thanks Marcos for contributing this image!
-
-
-**Example**:
-
-```
-
-Input: [0,1,0,2,1,0,1,3,2,1,2,1]
-Output: 6
-
-```
-
-## 题目大意
-
-从 x 轴开始，给出一个数组，数组里面的数字代表从 (0,0) 点开始，宽度为 1 个单位，高度为数组元素的值。如果下雨了，问这样一个容器能装多少单位的水？
-
-## 解题思路
-
-
-
-
-每个数组里面的元素值可以想象成一个左右都有壁的圆柱筒。例如上图中左边的第二个元素 1，当前左边最大的元素是 2 ，所以 2 高度的水会装到 1 的上面(因为想象成了左右都有筒壁)。这道题的思路就是左指针从 0 开始往右扫，右指针从最右边开始往左扫。额外还需要 2 个变量分别记住左边最大的高度和右边最大高度。遍历扫数组元素的过程中，如果左指针的高度比右指针的高度小，就不断的移动左指针，否则移动右指针。循环的终止条件就是左右指针碰上以后就结束。只要数组中元素的高度比保存的局部最大高度小，就累加 res 的值，否则更新局部最大高度。最终解就是 res 的值。
-
-## 代码
-
-```go
-
-package leetcode
-
-func trap(height []int) int {
- res, left, right, maxLeft, maxRight := 0, 0, len(height)-1, 0, 0
- for left <= right {
- if height[left] <= height[right] {
- if height[left] > maxLeft {
- maxLeft = height[left]
- } else {
- res += maxLeft - height[left]
- }
- left++
- } else {
- if height[right] >= maxRight {
- maxRight = height[right]
- } else {
- res += maxRight - height[right]
- }
- right--
- }
- }
- return res
-}
-
-```
diff --git a/website/content/ChapterFour/0048.Rotate-Image.md b/website/content/ChapterFour/0048.Rotate-Image.md
deleted file mode 100755
index 48d11b65b..000000000
--- a/website/content/ChapterFour/0048.Rotate-Image.md
+++ /dev/null
@@ -1,127 +0,0 @@
-# [48. Rotate Image](https://leetcode.com/problems/rotate-image/)
-
-## 题目
-
-You are given an *n* x *n* 2D matrix representing an image.
-
-Rotate the image by 90 degrees (clockwise).
-
-**Note**:
-
-You have to rotate the image **[in-place](https://en.wikipedia.org/wiki/In-place_algorithm)**, which means you have to modify the input 2D matrix directly. **DO NOT** allocate another 2D matrix and do the rotation.
-
-**Example 1**:
-
-
- Given input matrix =
- [
- [1,2,3],
- [4,5,6],
- [7,8,9]
- ],
-
- rotate the input matrix in-place such that it becomes:
- [
- [7,4,1],
- [8,5,2],
- [9,6,3]
- ]
-
-
-**Example 2**:
-
-
- Given input matrix =
- [
- [ 5, 1, 9,11],
- [ 2, 4, 8,10],
- [13, 3, 6, 7],
- [15,14,12,16]
- ],
-
- rotate the input matrix in-place such that it becomes:
- [
- [15,13, 2, 5],
- [14, 3, 4, 1],
- [12, 6, 8, 9],
- [16, 7,10,11]
- ]
-
-
-## 题目大意
-
-给定一个 n × n 的二维矩阵表示一个图像。将图像顺时针旋转 90 度。说明：你必须在原地旋转图像，这意味着你需要直接修改输入的二维矩阵。请不要使用另一个矩阵来旋转图像。
-
-
-## 解题思路
-
-- 给出一个二维数组，要求顺时针旋转 90 度。
-- 这一题比较简单，按照题意做就可以。这里给出 2 种旋转方法的实现，顺时针旋转和逆时针旋转。
-
-```c
-
- /*
- * clockwise rotate 顺时针旋转
- * first reverse up to down, then swap the symmetry
- * 1 2 3 7 8 9 7 4 1
- * 4 5 6 => 4 5 6 => 8 5 2
- * 7 8 9 1 2 3 9 6 3
- */
- void rotate(vector<vector<int> > &matrix) {
- reverse(matrix.begin(), matrix.end());
- for (int i = 0; i < matrix.size(); ++i) {
- for (int j = i + 1; j < matrix[i].size(); ++j)
- swap(matrix[i][j], matrix[j][i]);
- }
- }
-
- /*
- * anticlockwise rotate 逆时针旋转
- * first reverse left to right, then swap the symmetry
- * 1 2 3 3 2 1 3 6 9
- * 4 5 6 => 6 5 4 => 2 5 8
- * 7 8 9 9 8 7 1 4 7
- */
- void anti_rotate(vector<vector<int> > &matrix) {
- for (auto vi : matrix) reverse(vi.begin(), vi.end());
- for (int i = 0; i < matrix.size(); ++i) {
- for (int j = i + 1; j < matrix[i].size(); ++j)
- swap(matrix[i][j], matrix[j][i]);
- }
- }
-
-```
-
-## 代码
-
-```go
-
-package leetcode
-
-func rotate(matrix [][]int) {
- row := len(matrix)
- if row <= 0 {
- return
- }
- column := len(matrix[0])
- // rotate by diagonal 对角线变换
- for i := 0; i < row; i++ {
- for j := i + 1; j < column; j++ {
- tmp := matrix[i][j]
- matrix[i][j] = matrix[j][i]
- matrix[j][i] = tmp
- }
- }
- // rotate by vertical centerline 竖直轴对称翻转
- halfColumn := column / 2
- for i := 0; i < row; i++ {
- for j := 0; j < halfColumn; j++ {
- tmp := matrix[i][j]
- matrix[i][j] = matrix[i][column-j-1]
- matrix[i][column-j-1] = tmp
- }
- }
-}
-
-
-```
diff --git a/website/content/ChapterFour/0050.Powx-n.md b/website/content/ChapterFour/0050.Powx-n.md
deleted file mode 100755
index 86ec74519..000000000
--- a/website/content/ChapterFour/0050.Powx-n.md
+++ /dev/null
@@ -1,69 +0,0 @@
-# [50. Pow(x, n)](https://leetcode.com/problems/powx-n/)
-
-
-## 题目
-
-Implement [pow(*x*, *n*)](http://www.cplusplus.com/reference/valarray/pow/), which calculates *x* raised to the power *n* (xn).
-
-**Example 1**:
-
-
- Input: 2.00000, 10
- Output: 1024.00000
-
-
-**Example 2**:
-
-
- Input: 2.10000, 3
- Output: 9.26100
-
-
-**Example 3**:
-
-
- Input: 2.00000, -2
- Output: 0.25000
- Explanation: 2-2 = 1/22 = 1/4 = 0.25
-
-
-**Note**:
-
-- -100.0 < *x* < 100.0
-- *n* is a 32-bit signed integer, within the range [−2^31, 2^31− 1]
-
-## 题目大意
-
-实现 pow(x, n) ，即计算 x 的 n 次幂函数。
-
-## 解题思路
-
-- 要求计算 Pow(x, n)
-- 这一题用递归的方式，不断的将 n 2 分下去。注意 n 的正负数，n 的奇偶性。
-
-## 代码
-
-```go
-
-package leetcode
-
-// 时间复杂度 O(log n),空间复杂度 O(1)
-func myPow(x float64, n int) float64 {
- if n == 0 {
- return 1
- }
- if n == 1 {
- return x
- }
- if n < 0 {
- n = -n
- x = 1 / x
- }
- tmp := myPow(x, n/2)
- if n%2 == 0 {
- return tmp * tmp
- }
- return tmp * tmp * x
-}
-
-```
diff --git a/website/content/ChapterFour/0051.N-Queens.md b/website/content/ChapterFour/0051.N-Queens.md
deleted file mode 100755
index 9c9b2ebae..000000000
--- a/website/content/ChapterFour/0051.N-Queens.md
+++ /dev/null
@@ -1,134 +0,0 @@
-# [51. N-Queens](https://leetcode.com/problems/n-queens/)
-
-
-## 题目
-
-The n-queens puzzle is the problem of placing n queens on an n×n chessboard such that no two queens attack each other.
-
-
-
-Given an integer *n*, return all distinct solutions to the *n*-queens puzzle.
-
-Each solution contains a distinct board configuration of the *n*-queens' placement, where `'Q'` and `'.'` both indicate a queen and an empty space respectively.
-
-**Example**:
-
-
- Input: 4
- Output: [
- [".Q..", // Solution 1
- "...Q",
- "Q...",
- "..Q."],
-
- ["..Q.", // Solution 2
- "Q...",
- "...Q",
- ".Q.."]
- ]
- Explanation: There exist two distinct solutions to the 4-queens puzzle as shown above.
-
-
-## 题目大意
-
-给定一个整数 n，返回所有不同的 n 皇后问题的解决方案。每一种解法包含一个明确的 n 皇后问题的棋子放置方案，该方案中 'Q' 和 '.' 分别代表了皇后和空位。
-
-
-## 解题思路
-
-- 求解 n 皇后问题
-- 利用 col 数组记录列信息，col 有 `n` 列。用 dia1，dia2 记录从左下到右上的对角线，从左上到右下的对角线的信息，dia1 和 dia2 分别都有 `2*n-1` 个。
-- dia1 对角线的规律是 `i + j 是定值`，例如[0,0]，为 0；[1,0]、[0,1] 为 1；[2,0]、[1,1]、[0,2] 为 2；
-- dia2 对角线的规律是 `i - j 是定值`，例如[0,7]，为 -7；[0,6]、[1,7] 为 -6；[0,5]、[1,6]、[2,7] 为 -5；为了使他们从 0 开始，i - j + n - 1 偏移到 0 开始，所以 dia2 的规律是 `i - j + n - 1 为定值`。
-
-## 代码
-
-```go
-
-package leetcode
-
-// 解法一 DFS
-func solveNQueens(n int) [][]string {
- col, dia1, dia2, row, res := make([]bool, n), make([]bool, 2*n-1), make([]bool, 2*n-1), []int{}, [][]string{}
- putQueen(n, 0, &col, &dia1, &dia2, &row, &res)
- return res
-}
-
-// 尝试在一个n皇后问题中, 摆放第index行的皇后位置
-func putQueen(n, index int, col, dia1, dia2 *[]bool, row *[]int, res *[][]string) {
- if index == n {
- *res = append(*res, generateBoard(n, row))
- return
- }
- for i := 0; i < n; i++ {
- // 尝试将第index行的皇后摆放在第i列
- if !(*col)[i] && !(*dia1)[index+i] && !(*dia2)[index-i+n-1] {
- *row = append(*row, i)
- (*col)[i] = true
- (*dia1)[index+i] = true
- (*dia2)[index-i+n-1] = true
- putQueen(n, index+1, col, dia1, dia2, row, res)
- (*col)[i] = false
- (*dia1)[index+i] = false
- (*dia2)[index-i+n-1] = false
- *row = (*row)[:len(*row)-1]
- }
- }
- return
-}
-
-func generateBoard(n int, row *[]int) []string {
- board := []string{}
- res := ""
- for i := 0; i < n; i++ {
- res += "."
- }
- for i := 0; i < n; i++ {
- board = append(board, res)
- }
- for i := 0; i < n; i++ {
- tmp := []byte(board[i])
- tmp[(*row)[i]] = 'Q'
- board[i] = string(tmp)
- }
- return board
-}
-
-// 解法二 二进制操作法
-// class Solution
-// {
-// int n;
-// string getNq(int p)
-// {
-// string s(n, '.');
-// s[p] = 'Q';
-// return s;
-// }
-// void nQueens(int p, int l, int m, int r, vector<vector<string>> &res)
-// {
-// static vector<string> ans;
-// if (p >= n)
-// {
-// res.push_back(ans);
-// return ;
-// }
-// int mask = l | m | r;
-// for (int i = 0, b = 1; i < n; ++ i, b <<= 1)
-// if (!(mask & b))
-// {
-// ans.push_back(getNq(i));
-// nQueens(p + 1, (l | b) >> 1, m | b, (r | b) << 1, res);
-// ans.pop_back();
-// }
-// }
-// public:
-// vector<vector<string> > solveNQueens(int n)
-// {
-// this->n = n;
-// vector<vector<string>> res;
-// nQueens(0, 0, 0, 0, res);
-// return res;
-// }
-// };
-
-```
\ No newline at end of file
diff --git a/website/content/ChapterFour/0066.Plus-One.md b/website/content/ChapterFour/0066.Plus-One.md
deleted file mode 100755
index 441789f9b..000000000
--- a/website/content/ChapterFour/0066.Plus-One.md
+++ /dev/null
@@ -1,63 +0,0 @@
-# [66. Plus One](https://leetcode.com/problems/plus-one/)
-
-
-## 题目
-
-Given a **non-empty** array of digits representing a non-negative integer, plus one to the integer.
-
-The digits are stored such that the most significant digit is at the head of the list, and each element in the array contain a single digit.
-
-You may assume the integer does not contain any leading zero, except the number 0 itself.
-
-**Example 1**:
-
- Input: [1,2,3]
- Output: [1,2,4]
- Explanation: The array represents the integer 123.
-
-**Example 2**:
-
- Input: [4,3,2,1]
- Output: [4,3,2,2]
- Explanation: The array represents the integer 4321.
-
-
-## 题目大意
-
-
-给定一个由整数组成的非空数组所表示的非负整数，在该数的基础上加一。最高位数字存放在数组的首位， 数组中每个元素只存储单个数字。你可以假设除了整数 0 之外，这个整数不会以零开头。
-
-
-
-## 解题思路
-
-- 给出一个数组，代表一个十进制数，数组的 0 下标是十进制数的高位。要求计算这个十进制数加一以后的结果。
-- 简单的模拟题。从数组尾部开始往前扫，逐位进位即可。最高位如果还有进位需要在数组里面第 0 位再插入一个 1 。
-
-## 代码
-
-```go
-
-package leetcode
-
-func plusOne(digits []int) []int {
- if len(digits) == 0 {
- return []int{}
- }
- carry := 1
- for i := len(digits) - 1; i >= 0; i-- {
- if digits[i]+carry > 9 {
- digits[i] = 0
- carry = 1
- } else {
- digits[i] += carry
- carry = 0
- }
- }
- if digits[0] == 0 && carry == 1 {
- digits = append([]int{1}, digits...)
- }
- return digits
-}
-
-```
\ No newline at end of file
diff --git a/website/content/ChapterFour/0077.Combinations.md b/website/content/ChapterFour/0077.Combinations.md
deleted file mode 100755
index 74a6bf26b..000000000
--- a/website/content/ChapterFour/0077.Combinations.md
+++ /dev/null
@@ -1,60 +0,0 @@
-# [77. Combinations](https://leetcode.com/problems/combinations/)
-
-
-## 题目
-
-Given two integers *n* and *k*, return all possible combinations of *k* numbers out of 1 ... *n*.
-
-**Example**:
-
- Input: n = 4, k = 2
- Output:
- [
- [2,4],
- [3,4],
- [2,3],
- [1,2],
- [1,3],
- [1,4],
- ]
-
-## 题目大意
-
-给定两个整数 n 和 k，返回 1 ... n 中所有可能的 k 个数的组合。
-
-## 解题思路
-
-- 计算排列组合中的组合，用 DFS 深搜即可，注意剪枝
-
-## 代码
-
-```
-
-package leetcode
-
-func combine(n int, k int) [][]int {
- if n <= 0 || k <= 0 || k > n {
- return [][]int{}
- }
- c, res := []int{}, [][]int{}
- generateCombinations(n, k, 1, c, &res)
- return res
-}
-
-func generateCombinations(n, k, start int, c []int, res *[][]int) {
- if len(c) == k {
- b := make([]int, len(c))
- copy(b, c)
- *res = append(*res, b)
- return
- }
- // i will at most be n - (k - c.size()) + 1
- for i := start; i <= n-(k-len(c))+1; i++ {
- c = append(c, i)
- generateCombinations(n, k, i+1, c, res)
- c = c[:len(c)-1]
- }
- return
-}
-
-```
\ No newline at end of file
diff --git a/website/content/ChapterFour/0080.Remove-Duplicates-from-Sorted-Array-II.md b/website/content/ChapterFour/0080.Remove-Duplicates-from-Sorted-Array-II.md
deleted file mode 100644
index e0811e928..000000000
--- a/website/content/ChapterFour/0080.Remove-Duplicates-from-Sorted-Array-II.md
+++ /dev/null
@@ -1,105 +0,0 @@
-# [80. Remove Duplicates from Sorted Array II](https://leetcode.com/problems/remove-duplicates-from-sorted-array-ii/)
-
-## 题目
-
-Given a sorted array nums, remove the duplicates in-place such that duplicates appeared at most twice and return the new length.
-
-Do not allocate extra space for another array, you must do this by modifying the input array in-place with O(1) extra memory.
-
-**Example 1**:
-
-```
-
-Given nums = [1,1,1,2,2,3],
-
-Your function should return length = 5, with the first five elements of nums being 1, 1, 2, 2 and 3 respectively.
-
-It doesn't matter what you leave beyond the returned length.
-
-```
-
-**Example 2**:
-
-```
-
-Given nums = [0,0,1,1,1,1,2,3,3],
-
-Your function should return length = 7, with the first seven elements of nums being modified to 0, 0, 1, 1, 2, 3 and 3 respectively.
-
-It doesn't matter what values are set beyond the returned length.
-
-```
-
-**Clarification**:
-
-Confused why the returned value is an integer but your answer is an array?
-
-Note that the input array is passed in by reference, which means modification to the input array will be known to the caller as well.
-
-Internally you can think of this:
-
-```
-
-// nums is passed in by reference. (i.e., without making a copy)
-int len = removeElement(nums, val);
-
-// any modification to nums in your function would be known by the caller.
-// using the length returned by your function, it prints the first len elements.
-for (int i = 0; i < len; i++) {
- print(nums[i]);
-}
-
-```
-
-## 题目大意
-
-给定一个有序数组 nums，对数组中的元素进行去重，使得原数组中的每个元素最多暴露 2 个。最后返回去重以后数组的长度值。
-
-## 解题思路
-
-这道题和第 26 题很像。是第 26 题的加强版。这道题和第 283 题，第 27 题基本一致，283 题是删除 0，27 题是删除指定元素，这一题是删除重复元素，实质是一样的。
-
-这里数组的删除并不是真的删除，只是将删除的元素移动到数组后面的空间内，然后返回数组实际剩余的元素个数，OJ 最终判断题目的时候会读取数组剩余个数的元素进行输出。
-
-## 代码
-
-```go
-
-package leetcode
-
-func removeDuplicates80(nums []int) int {
- if len(nums) == 0 {
- return 0
- }
- last, finder := 0, 0
- for last < len(nums)-1 {
- startFinder := -1
- for nums[finder] == nums[last] {
- if startFinder == -1 || startFinder > finder {
- startFinder = finder
- }
- if finder == len(nums)-1 {
- break
- }
- finder++
- }
- if finder-startFinder >= 2 && nums[finder-1] == nums[last] && nums[finder] != nums[last] {
- nums[last+1] = nums[finder-1]
- nums[last+2] = nums[finder]
- last += 2
- } else {
- nums[last+1] = nums[finder]
- last++
- }
- if finder == len(nums)-1 {
- if nums[finder] != nums[last-1] {
- nums[last] = nums[finder]
- }
- return last + 1
- }
- }
- return last + 1
-}
-
-
-```
\ No newline at end of file
diff --git a/website/content/ChapterFour/0082.Remove-Duplicates-from-Sorted-List-II.md b/website/content/ChapterFour/0082.Remove-Duplicates-from-Sorted-List-II.md
deleted file mode 100644
index 4fc6a768e..000000000
--- a/website/content/ChapterFour/0082.Remove-Duplicates-from-Sorted-List-II.md
+++ /dev/null
@@ -1,190 +0,0 @@
-# [82. Remove Duplicates from Sorted List II](https://leetcode.com/problems/remove-duplicates-from-sorted-list-ii/)
-
-## 题目
-
-Given a sorted linked list, delete all nodes that have duplicate numbers, leaving only distinct numbers from the original list.
-
-**Example 1**:
-
-```
-
-Input: 1->2->3->3->4->4->5
-Output: 1->2->5
-
-```
-
-**Example 2**:
-
-```
-
-Input: 1->1->1->2->3
-Output: 2->3
-
-```
-
-## 题目大意
-
-删除链表中重复的结点，只要是有重复过的结点，全部删除。
-
-## 解题思路
-
-按照题意做即可。
-
-## 代码
-
-```go
-
-package leetcode
-
-/**
- * Definition for singly-linked list.
- * type ListNode struct {
- * Val int
- * Next *ListNode
- * }
- */
-
-// 解法一
-func deleteDuplicates1(head *ListNode) *ListNode {
- if head == nil {
- return nil
- }
- if head.Next == nil {
- return head
- }
- newHead := &ListNode{Next: head, Val: -999999}
- cur := newHead
- last := newHead
- front := head
- for front.Next != nil {
- if front.Val == cur.Val {
- // fmt.Printf("相同节点front = %v | cur = %v | last = %v\n", front.Val, cur.Val, last.Val)
- front = front.Next
- continue
- } else {
- if cur.Next != front {
- // fmt.Printf("删除重复节点front = %v | cur = %v | last = %v\n", front.Val, cur.Val, last.Val)
- last.Next = front
- if front.Next != nil && front.Next.Val != front.Val {
- last = front
- }
- cur = front
- front = front.Next
- } else {
- // fmt.Printf("常规循环前front = %v | cur = %v | last = %v\n", front.Val, cur.Val, last.Val)
- last = cur
- cur = cur.Next
- front = front.Next
- // fmt.Printf("常规循环后front = %v | cur = %v | last = %v\n", front.Val, cur.Val, last.Val)
-
- }
- }
- }
- if front.Val == cur.Val {
- // fmt.Printf("相同节点front = %v | cur = %v | last = %v\n", front.Val, cur.Val, last.Val)
- last.Next = nil
- } else {
- if cur.Next != front {
- last.Next = front
- }
- }
- return newHead.Next
-}
-
-// 解法二
-func deleteDuplicates2(head *ListNode) *ListNode {
- if head == nil {
- return nil
- }
- if head.Next != nil && head.Val == head.Next.Val {
- for head.Next != nil && head.Val == head.Next.Val {
- head = head.Next
- }
- return deleteDuplicates(head.Next)
- }
- head.Next = deleteDuplicates(head.Next)
- return head
-}
-
-func deleteDuplicates(head *ListNode) *ListNode {
- cur := head
- if head == nil {
- return nil
- }
- if head.Next == nil {
- return head
- }
- for cur.Next != nil {
- if cur.Next.Val == cur.Val {
- cur.Next = cur.Next.Next
- } else {
- cur = cur.Next
- }
- }
- return head
-}
-
-// 解法三 双循环简单解法 O(n*m)
-func deleteDuplicates3(head *ListNode) *ListNode {
- if head == nil {
- return head
- }
-
- nilNode := &ListNode{Val: 0, Next: head}
- head = nilNode
-
- lastVal := 0
- for head.Next != nil && head.Next.Next != nil {
- if head.Next.Val == head.Next.Next.Val {
- lastVal = head.Next.Val
- for head.Next != nil && lastVal == head.Next.Val {
- head.Next = head.Next.Next
- }
- } else {
- head = head.Next
- }
- }
- return nilNode.Next
-}
-
-// 解法四 双指针+删除标志位，单循环解法 O(n)
-func deleteDuplicates4(head *ListNode) *ListNode {
- if head == nil || head.Next == nil {
- return head
- }
-
- nilNode := &ListNode{Val: 0, Next: head}
- // 上次遍历有删除操作的标志位
- lastIsDel := false
- // 虚拟空结点
- head = nilNode
- // 前后指针用于判断
- pre, back := head.Next, head.Next.Next
- // 每次只删除前面的一个重复的元素，留一个用于下次遍历判重
- // pre, back 指针的更新位置和值比较重要和巧妙
- for head.Next != nil && head.Next.Next != nil {
- if pre.Val != back.Val && lastIsDel {
- head.Next = head.Next.Next
- pre, back = head.Next, head.Next.Next
- lastIsDel = false
- continue
- }
-
- if pre.Val == back.Val {
- head.Next = head.Next.Next
- pre, back = head.Next, head.Next.Next
- lastIsDel = true
- } else {
- head = head.Next
- pre, back = head.Next, head.Next.Next
- lastIsDel = false
- }
- }
- // 处理 [1,1] 这种删除还剩一个的情况
- if lastIsDel && head.Next != nil {
- head.Next = nil
- }
- return nilNode.Next
-}
-
-```
\ No newline at end of file
diff --git a/website/content/ChapterFour/0083.Remove-Duplicates-from-Sorted-List.md b/website/content/ChapterFour/0083.Remove-Duplicates-from-Sorted-List.md
deleted file mode 100644
index 07d1654e7..000000000
--- a/website/content/ChapterFour/0083.Remove-Duplicates-from-Sorted-List.md
+++ /dev/null
@@ -1,66 +0,0 @@
-# [83. Remove Duplicates from Sorted List](https://leetcode.com/problems/remove-duplicates-from-sorted-list/)
-
-## 题目
-
-Given a sorted linked list, delete all duplicates such that each element appear only once.
-
-**Example 1**:
-
-```
-
-Input: 1->1->2
-Output: 1->2
-
-```
-
-**Example 2**:
-
-```
-
-Input: 1->1->2->3->3
-Output: 1->2->3
-
-```
-
-## 题目大意
-
-删除链表中重复的结点，以保障每个结点只出现一次。
-
-
-## 解题思路
-
-按照题意做即可。
-
-## 代码
-
-```go
-
-package leetcode
-
-/**
- * Definition for singly-linked list.
- * type ListNode struct {
- * Val int
- * Next *ListNode
- * }
- */
-
-func deleteDuplicates(head *ListNode) *ListNode {
- cur := head
- if head == nil {
- return nil
- }
- if head.Next == nil {
- return head
- }
- for cur.Next != nil {
- if cur.Next.Val == cur.Val {
- cur.Next = cur.Next.Next
- } else {
- cur = cur.Next
- }
- }
- return head
-}
-
-```
\ No newline at end of file
diff --git a/website/content/ChapterFour/0084.Largest-Rectangle-in-Histogram.md b/website/content/ChapterFour/0084.Largest-Rectangle-in-Histogram.md
deleted file mode 100644
index 7b22b2200..000000000
--- a/website/content/ChapterFour/0084.Largest-Rectangle-in-Histogram.md
+++ /dev/null
@@ -1,75 +0,0 @@
-# [84. Largest Rectangle in Histogram](https://leetcode.com/problems/largest-rectangle-in-histogram/)
-
-## 题目
-
-Given n non-negative integers representing the histogram's bar height where the width of each bar is 1, find the area of largest rectangle in the histogram.
-
- 
-
-
-Above is a histogram where width of each bar is 1, given height = [2,1,5,6,2,3].
-
-
-
-
-The largest rectangle is shown in the shaded area, which has area = 10 unit.
-
-
-
-**Example**:
-
-```
-
-Input: [2,1,5,6,2,3]
-Output: 10
-
-```
-
-
-## 题目大意
-
-给出每个直方图的高度，要求在这些直方图之中找到面积最大的矩形，输出矩形的面积。
-
-
-## 解题思路
-
-用单调栈依次保存直方图的高度下标，一旦出现高度比栈顶元素小的情况就取出栈顶元素，单独计算一下这个栈顶元素的矩形的高度。然后停在这里(外层循环中的 i--，再 ++，就相当于停在这里了)，继续取出当前最大栈顶的前一个元素，即连续弹出 2 个最大的，以稍小的一个作为矩形的边，宽就是 2 计算面积…………如果停在这里的下标代表的高度一直比栈里面的元素小，就一直弹出，取出最后一个比当前下标大的高度作为矩形的边。宽就是最后一个比当前下标大的高度和当前下标 i 的差值。计算出面积以后不断的更新 maxArea 即可。
-
-## 代码
-
-```go
-
-package leetcode
-
-import "fmt"
-
-func largestRectangleArea(heights []int) int {
- maxArea, stack, height := 0, []int{}, 0
- for i := 0; i <= len(heights); i++ {
- if i == len(heights) {
- height = 0
- } else {
- height = heights[i]
- }
- if len(stack) == 0 || height >= heights[stack[len(stack)-1]] {
- stack = append(stack, i)
- } else {
- tmp := stack[len(stack)-1]
- fmt.Printf("1. tmp = %v stack = %v\n", tmp, stack)
- stack = stack[:len(stack)-1]
- length := 0
- if len(stack) == 0 {
- length = i
- } else {
- length = i - 1 - stack[len(stack)-1]
- fmt.Printf("2. length = %v stack = %v i = %v\n", length, stack, i)
- }
- maxArea = max(maxArea, heights[tmp]*length)
- fmt.Printf("3. maxArea = %v heights[tmp]*length = %v\n", maxArea, heights[tmp]*length)
- i--
- }
- }
- return maxArea
-}
-
-```
\ No newline at end of file
diff --git a/website/content/ChapterFour/0088.Merge-Sorted-Array.md b/website/content/ChapterFour/0088.Merge-Sorted-Array.md
deleted file mode 100644
index 42d50a53a..000000000
--- a/website/content/ChapterFour/0088.Merge-Sorted-Array.md
+++ /dev/null
@@ -1,69 +0,0 @@
-# [88. Merge Sorted Array](https://leetcode.com/problems/merge-sorted-array/description/)
-
-## 题目
-
-Given two sorted integer arrays nums1 and nums2, merge nums2 into nums1 as one sorted array.
-
-**Note**:
-
-- The number of elements initialized in nums1 and nums2 are m and n respectively.
-- You may assume that nums1 has enough space (size that is equal to m + n) to hold additional elements from nums2.
-
-**Example**:
-
- Input:
- nums1 = [1,2,3,0,0,0], m = 3
- nums2 = [2,5,6], n = 3
-
- Output: [1,2,2,3,5,6]
-
-
-**Constraints**:
-
-- -10^9 <= nums1[i], nums2[i] <= 10^9
-- nums1.length == m + n
-- nums2.length == n
-
-## 题目大意
-
-合并两个已经有序的数组，结果放在第一个数组中，第一个数组假设空间足够大。要求算法时间复杂度足够低。
-
-## 解题思路
-
-为了不大量移动元素，就要从2个数组长度之和的最后一个位置开始，依次选取两个数组中大的数，从第一个数组的尾巴开始往头放，只要循环一次以后，就生成了合并以后的数组了。
-
-## 代码
-
-```go
-
-package leetcode
-
-func merge(nums1 []int, m int, nums2 []int, n int) {
- if m == 0 {
- copy(nums1, nums2)
- return
- }
- // 这里不需要，因为测试数据考虑到了第一个数组的空间问题
- // for index := 0; index < n; index++ {
- // nums1 = append(nums1, nums2[index])
- // }
- i := m - 1
- j := n - 1
- k := m + n - 1
- // 从后面往前放，只需要循环一次即可
- for ; i >= 0 && j >= 0; k-- {
- if nums1[i] > nums2[j] {
- nums1[k] = nums1[i]
- i--
- } else {
- nums1[k] = nums2[j]
- j--
- }
- }
- for ; j >= 0; k-- {
- nums1[k] = nums2[j]
- j--
- }
-}
-
-```
\ No newline at end of file
diff --git a/website/content/ChapterFour/0091.Decode-Ways.md b/website/content/ChapterFour/0091.Decode-Ways.md
deleted file mode 100755
index 11dc54166..000000000
--- a/website/content/ChapterFour/0091.Decode-Ways.md
+++ /dev/null
@@ -1,82 +0,0 @@
-# [91. Decode Ways](https://leetcode.com/problems/decode-ways/)
-
-
-## 题目
-
-A message containing letters from `A-Z` is being encoded to numbers using the following mapping:
-
- 'A' -> 1
- 'B' -> 2
- ...
- 'Z' -> 26
-
-Given a **non-empty** string containing only digits, determine the total number of ways to decode it.
-
-**Example 1**:
-
- Input: "12"
- Output: 2
- Explanation: It could be decoded as "AB" (1 2) or "L" (12).
-
-**Example 2**:
-
- Input: "226"
- Output: 3
- Explanation: It could be decoded as "BZ" (2 26), "VF" (22 6), or "BBF" (2 2 6).
-
-## 题目大意
-
-一条包含字母 A-Z 的消息通过以下方式进行了编码：
-
-```go
-'A' -> 1
-'B' -> 2
-...
-'Z' -> 26
-```
-
-给定一个只包含数字的非空字符串，请计算解码方法的总数。
-
-
-
-## 解题思路
-
-- 给出一个数字字符串，题目要求把数字映射成 26 个字母，映射以后问有多少种可能的翻译方法。
-- 这题思路也是 DP。`dp[n]` 代表翻译长度为 n 个字符的字符串的方法总数。由于题目中的数字可能出现 0，0 不能翻译成任何字母，所以出现 0 要跳过。dp[0] 代表空字符串，只有一种翻译方法，`dp[0] = 1`。dp[1] 需要考虑原字符串是否是 0 开头的，如果是 0 开头的，`dp[1] = 0`，如果不是 0 开头的，`dp[1] = 1`。状态转移方程是 `dp[i] += dp[i-1] (当 1 ≤ s[i-1 : i] ≤ 9)；dp[i] += dp[i-2] (当 10 ≤ s[i-2 : i] ≤ 26)`。最终结果是 `dp[n]`。
-
-
-## 代码
-
-```go
-
-package leetcode
-
-import (
- "strconv"
-)
-
-func numDecodings(s string) int {
- if len(s) == 0 {
- return 0
- }
- dp := make([]int, len(s)+1)
- dp[0] = 1
- if s[:1] == "0" {
- dp[1] = 0
- } else {
- dp[1] = 1
- }
- for i := 2; i <= len(s); i++ {
- lastNum, _ := strconv.Atoi(s[i-1 : i])
- if lastNum >= 1 && lastNum <= 9 {
- dp[i] += dp[i-1]
- }
- lastNum, _ = strconv.Atoi(s[i-2 : i])
- if lastNum >= 10 && lastNum <= 26 {
- dp[i] += dp[i-2]
- }
- }
- return dp[len(s)]
-}
-
-```
\ No newline at end of file
diff --git a/website/content/ChapterFour/0094.Binary-Tree-Inorder-Traversal.md b/website/content/ChapterFour/0094.Binary-Tree-Inorder-Traversal.md
deleted file mode 100644
index 1161f1584..000000000
--- a/website/content/ChapterFour/0094.Binary-Tree-Inorder-Traversal.md
+++ /dev/null
@@ -1,73 +0,0 @@
-# [94. Binary Tree Inorder Traversal](https://leetcode.com/problems/binary-tree-inorder-traversal/)
-
-## 题目
-
-
-Given a binary tree, return the inorder traversal of its nodes' values.
-
-
-
-**Example**:
-
-```
-
-Input: [1,null,2,3]
- 1
- \
- 2
- /
- 3
-
-Output: [1,3,2]
-
-```
-
-
-**Follow up**: Recursive solution is trivial, could you do it iteratively?
-
-
-
-
-
-
-## 题目大意
-
-中根遍历一颗树。
-
-## 解题思路
-
-递归的实现方法，见代码。
-
-
-
-
-
-## 代码
-
-```go
-
-package leetcode
-
-/**
- * Definition for a binary tree node.
- * type TreeNode struct {
- * Val int
- * Left *TreeNode
- * Right *TreeNode
- * }
- */
-func inorderTraversal(root *TreeNode) []int {
- var result []int
- inorder(root, &result)
- return result
-}
-
-func inorder(root *TreeNode, output *[]int) {
- if root != nil {
- inorder(root.Left, output)
- *output = append(*output, root.Val)
- inorder(root.Right, output)
- }
-}
-
-```
\ No newline at end of file
diff --git a/website/content/ChapterFour/0100.Same-Tree.md b/website/content/ChapterFour/0100~0199/0100.Same-Tree.md
similarity index 76%
rename from website/content/ChapterFour/0100.Same-Tree.md
rename to website/content/ChapterFour/0100~0199/0100.Same-Tree.md
index 6c12131bf..90227a8eb 100644
--- a/website/content/ChapterFour/0100.Same-Tree.md
+++ b/website/content/ChapterFour/0100~0199/0100.Same-Tree.md
@@ -89,4 +89,11 @@ func isSameTree(p *TreeNode, q *TreeNode) bool {
}
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<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>
diff --git a/website/content/ChapterFour/0100~0199/0101.Symmetric-Tree.md b/website/content/ChapterFour/0100~0199/0101.Symmetric-Tree.md
new file mode 100644
index 000000000..2b9de1e98
--- /dev/null
+++ b/website/content/ChapterFour/0100~0199/0101.Symmetric-Tree.md
@@ -0,0 +1,130 @@
+# [101. Symmetric Tree](https://leetcode.com/problems/symmetric-tree/)
+
+## 题目
+
+
+Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center).
+
+For example, this binary tree [1,2,2,3,4,4,3] is symmetric:
+
+
+```
+
+ 1
+ / \
+ 2 2
+ / \ / \
+3 4 4 3
+
+```
+
+But the following [1,2,2,null,3,null,3] is not:
+
+```
+
+ 1
+ / \
+ 2 2
+ \ \
+ 3 3
+
+```
+
+**Note**:
+
+Bonus points if you could solve it both recursively and iteratively.
+
+## 题目大意
+
+这一题要求判断 2 颗树是否是左右对称的。
+
+
+## 解题思路
+
+- 这道题是几道题的综合题。将根节点的左字数反转二叉树，然后再和根节点的右节点进行比较，是否完全相等。
+- 反转二叉树是第 226 题。判断 2 颗树是否完全相等是第 100 题。
+
+
+
+
+## 代码
+
+```go
+
+package leetcode
+
+import (
+ "github.com/halfrost/leetcode-go/structures"
+)
+
+// TreeNode define
+type TreeNode = structures.TreeNode
+
+/**
+ * Definition for a binary tree node.
+ * type TreeNode struct {
+ * Val int
+ * Left *TreeNode
+ * Right *TreeNode
+ * }
+ */
+
+// 解法一 dfs
+func isSymmetric(root *TreeNode) bool {
+ if root == nil {
+ return true
+ }
+ return isMirror(root.Left, root.Right)
+}
+
+func isMirror(left *TreeNode, right *TreeNode) bool {
+ if left == nil && right == nil {
+ return true
+ }
+ if left == nil || right == nil {
+ return false
+ }
+ return (left.Val == right.Val) && isMirror(left.Left, right.Right) && isMirror(left.Right, right.Left)
+}
+
+// 解法二
+func isSymmetric1(root *TreeNode) bool {
+ if root == nil {
+ return true
+ }
+ return isSameTree(invertTree(root.Left), root.Right)
+}
+
+func isSameTree(p *TreeNode, q *TreeNode) bool {
+ if p == nil && q == nil {
+ return true
+ } else if p != nil && q != nil {
+ if p.Val != q.Val {
+ return false
+ }
+ return isSameTree(p.Left, q.Left) && isSameTree(p.Right, q.Right)
+ } else {
+ return false
+ }
+}
+
+func invertTree(root *TreeNode) *TreeNode {
+ if root == nil {
+ return nil
+ }
+ invertTree(root.Left)
+ invertTree(root.Right)
+ root.Left, root.Right = root.Right, root.Left
+ return root
+}
+
+
+
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<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>
diff --git a/website/content/ChapterFour/0100~0199/0102.Binary-Tree-Level-Order-Traversal.md b/website/content/ChapterFour/0100~0199/0102.Binary-Tree-Level-Order-Traversal.md
new file mode 100644
index 000000000..68f93c42a
--- /dev/null
+++ b/website/content/ChapterFour/0100~0199/0102.Binary-Tree-Level-Order-Traversal.md
@@ -0,0 +1,122 @@
+# [102. Binary Tree Level Order Traversal](https://leetcode.com/problems/binary-tree-level-order-traversal/)
+
+## 题目
+
+
+Given a binary tree, return the level order traversal of its nodes' values. (ie, from left to right, level by level).
+
+**For Example**:
+
+Given binary tree [3,9,20,null,null,15,7],
+
+```
+
+ 3
+ / \
+ 9 20
+ / \
+ 15 7
+
+```
+
+return its level order traversal as:
+
+```
+
+[
+ [3],
+ [9,20],
+ [15,7]
+]
+
+```
+
+
+## 题目大意
+
+按层序从上到下遍历一颗树。
+
+## 解题思路
+
+用一个队列即可实现。
+
+
+
+
+
+## 代码
+
+```go
+
+package leetcode
+
+import (
+ "github.com/halfrost/leetcode-go/structures"
+)
+
+// TreeNode define
+type TreeNode = structures.TreeNode
+
+/**
+ * Definition for a binary tree node.
+ * type TreeNode struct {
+ * Val int
+ * Left *TreeNode
+ * Right *TreeNode
+ * }
+ */
+
+// 解法一 BFS
+func levelOrder(root *TreeNode) [][]int {
+ if root == nil {
+ return [][]int{}
+ }
+ queue := []*TreeNode{root}
+ res := make([][]int, 0)
+ for len(queue) > 0 {
+ l := len(queue)
+ tmp := make([]int, 0, l)
+ for i := 0; i < l; i++ {
+ if queue[i].Left != nil {
+ queue = append(queue, queue[i].Left)
+ }
+ if queue[i].Right != nil {
+ queue = append(queue, queue[i].Right)
+ }
+ tmp = append(tmp, queue[i].Val)
+ }
+ queue = queue[l:]
+ res = append(res, tmp)
+ }
+ return res
+}
+
+// 解法二 DFS
+func levelOrder1(root *TreeNode) [][]int {
+ var res [][]int
+ var dfsLevel func(node *TreeNode, level int)
+ dfsLevel = func(node *TreeNode, level int) {
+ if node == nil {
+ return
+ }
+ if len(res) == level {
+ res = append(res, []int{node.Val})
+ } else {
+ res[level] = append(res[level], node.Val)
+ }
+ dfsLevel(node.Left, level+1)
+ dfsLevel(node.Right, level+1)
+ }
+ dfsLevel(root, 0)
+ return res
+}
+
+
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<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>
diff --git a/website/content/ChapterFour/0100~0199/0103.Binary-Tree-Zigzag-Level-Order-Traversal.md b/website/content/ChapterFour/0100~0199/0103.Binary-Tree-Zigzag-Level-Order-Traversal.md
new file mode 100644
index 000000000..0afad6242
--- /dev/null
+++ b/website/content/ChapterFour/0100~0199/0103.Binary-Tree-Zigzag-Level-Order-Traversal.md
@@ -0,0 +1,178 @@
+# [103. Binary Tree Zigzag Level Order Traversal](https://leetcode.com/problems/binary-tree-zigzag-level-order-traversal/)
+
+## 题目
+
+Given a binary tree, return the zigzag level order traversal of its nodes' values. (ie, from left to right, then right to left for the next level and alternate between).
+
+**For Example**:
+Given binary tree [3,9,20,null,null,15,7],
+
+```
+
+ 3
+ / \
+ 9 20
+ / \
+ 15 7
+
+```
+
+return its zigzag level order traversal as:
+
+```
+
+[
+ [3],
+ [20,9],
+ [15,7]
+]
+
+```
+
+
+## 题目大意
+
+按照 Z 字型层序遍历一棵树。
+
+## 解题思路
+
+- 按层序从上到下遍历一颗树，但是每一层的顺序是相互反转的，即上一层是从左往右，下一层就是从右往左，以此类推。用一个队列即可实现。
+- 第 102 题和第 107 题都是按层序遍历的。
+
+
+
+
+## 代码
+
+```go
+
+package leetcode
+
+import (
+ "github.com/halfrost/leetcode-go/structures"
+)
+
+// TreeNode define
+type TreeNode = structures.TreeNode
+
+/**
+ * Definition for a binary tree node.
+ * type TreeNode struct {
+ * Val int
+ * Left *TreeNode
+ * Right *TreeNode
+ * }
+ */
+
+// 解法一
+func zigzagLevelOrder(root *TreeNode) [][]int {
+ if root == nil {
+ return [][]int{}
+ }
+ queue := []*TreeNode{}
+ queue = append(queue, root)
+ curNum, nextLevelNum, res, tmp, curDir := 1, 0, [][]int{}, []int{}, 0
+ for len(queue) != 0 {
+ if curNum > 0 {
+ node := queue[0]
+ if node.Left != nil {
+ queue = append(queue, node.Left)
+ nextLevelNum++
+ }
+ if node.Right != nil {
+ queue = append(queue, node.Right)
+ nextLevelNum++
+ }
+ curNum--
+ tmp = append(tmp, node.Val)
+ queue = queue[1:]
+ }
+ if curNum == 0 {
+ if curDir == 1 {
+ for i, j := 0, len(tmp)-1; i < j; i, j = i+1, j-1 {
+ tmp[i], tmp[j] = tmp[j], tmp[i]
+ }
+ }
+ res = append(res, tmp)
+ curNum = nextLevelNum
+ nextLevelNum = 0
+ tmp = []int{}
+ if curDir == 0 {
+ curDir = 1
+ } else {
+ curDir = 0
+ }
+ }
+ }
+ return res
+}
+
+// 解法二 递归
+func zigzagLevelOrder0(root *TreeNode) [][]int {
+ var res [][]int
+ search(root, 0, &res)
+ return res
+}
+
+func search(root *TreeNode, depth int, res *[][]int) {
+ if root == nil {
+ return
+ }
+ for len(*res) < depth+1 {
+ *res = append(*res, []int{})
+ }
+ if depth%2 == 0 {
+ (*res)[depth] = append((*res)[depth], root.Val)
+ } else {
+ (*res)[depth] = append([]int{root.Val}, (*res)[depth]...)
+ }
+ search(root.Left, depth+1, res)
+ search(root.Right, depth+1, res)
+}
+
+// 解法三 BFS
+func zigzagLevelOrder1(root *TreeNode) [][]int {
+ res := [][]int{}
+ if root == nil {
+ return res
+ }
+ q := []*TreeNode{root}
+ size, i, j, lay, tmp, flag := 0, 0, 0, []int{}, []*TreeNode{}, false
+ for len(q) > 0 {
+ size = len(q)
+ tmp = []*TreeNode{}
+ lay = make([]int, size)
+ j = size - 1
+ for i = 0; i < size; i++ {
+ root = q[0]
+ q = q[1:]
+ if !flag {
+ lay[i] = root.Val
+ } else {
+ lay[j] = root.Val
+ j--
+ }
+ if root.Left != nil {
+ tmp = append(tmp, root.Left)
+ }
+ if root.Right != nil {
+ tmp = append(tmp, root.Right)
+ }
+
+ }
+ res = append(res, lay)
+ flag = !flag
+ q = tmp
+ }
+ return res
+}
+
+
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<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>
diff --git a/website/content/ChapterFour/0100~0199/0104.Maximum-Depth-of-Binary-Tree.md b/website/content/ChapterFour/0100~0199/0104.Maximum-Depth-of-Binary-Tree.md
new file mode 100644
index 000000000..36d39f9f4
--- /dev/null
+++ b/website/content/ChapterFour/0100~0199/0104.Maximum-Depth-of-Binary-Tree.md
@@ -0,0 +1,67 @@
+# [104. Maximum Depth of Binary Tree](https://leetcode.com/problems/maximum-depth-of-binary-tree/)
+
+## 题目
+
+Given a binary tree, find its maximum depth.
+
+The maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf node.
+
+**Note**: A leaf is a node with no children.
+
+**Example**:
+
+Given binary tree [3,9,20,null,null,15,7],
+
+```
+
+ 3
+ / \
+ 9 20
+ / \
+ 15 7
+
+```
+
+return its depth = 3.
+
+
+## 题目大意
+
+要求输出一棵树的最大高度。
+
+## 解题思路
+
+这一题递归遍历就可，遍历根节点的左孩子的高度和根节点右孩子的高度，取出两者的最大值再加一即为总高度。
+
+
+
+
+## 代码
+
+```go
+
+package leetcode
+
+/**
+ * Definition for a binary tree node.
+ * type TreeNode struct {
+ * Val int
+ * Left *TreeNode
+ * Right *TreeNode
+ * }
+ */
+func maxDepth(root *TreeNode) int {
+ if root == nil {
+ return 0
+ }
+ return max(maxDepth(root.Left), maxDepth(root.Right)) + 1
+}
+
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<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>
diff --git a/website/content/ChapterFour/0100~0199/0105.Construct-Binary-Tree-from-Preorder-and-Inorder-Traversal.md b/website/content/ChapterFour/0100~0199/0105.Construct-Binary-Tree-from-Preorder-and-Inorder-Traversal.md
new file mode 100755
index 000000000..556a6da65
--- /dev/null
+++ b/website/content/ChapterFour/0100~0199/0105.Construct-Binary-Tree-from-Preorder-and-Inorder-Traversal.md
@@ -0,0 +1,105 @@
+# [105. Construct Binary Tree from Preorder and Inorder Traversal](https://leetcode.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal/)
+
+
+## 题目
+
+Given preorder and inorder traversal of a tree, construct the binary tree.
+
+**Note**:You may assume that duplicates do not exist in the tree.
+
+For example, given
+
+ preorder = [3,9,20,15,7]
+ inorder = [9,3,15,20,7]
+
+Return the following binary tree:
+
+ 3
+ / \
+ 9 20
+ / \
+ 15 7
+
+
+
+## 题目大意
+
+根据一棵树的前序遍历与中序遍历构造二叉树。
+
+注意:
+你可以假设树中没有重复的元素。
+
+
+## 解题思路
+
+- 给出 2 个数组，根据 preorder 和 inorder 数组构造一颗树。
+- 利用递归思想，从 preorder 可以得到根节点，从 inorder 中得到左子树和右子树。只剩一个节点的时候即为根节点。不断的递归直到所有的树都生成完成。
+
+
+## 代码
+
+```go
+
+package leetcode
+
+import (
+ "github.com/halfrost/leetcode-go/structures"
+)
+
+// TreeNode define
+type TreeNode = structures.TreeNode
+
+/**
+ * Definition for a binary tree node.
+ * type TreeNode struct {
+ * Val int
+ * Left *TreeNode
+ * Right *TreeNode
+ * }
+ */
+
+// 解法一, 直接传入需要的 slice 范围作为输入, 可以避免申请对应 inorder 索引的内存, 内存使用(leetcode test case) 4.7MB -> 4.3MB.
+func buildTree(preorder []int, inorder []int) *TreeNode {
+ if len(preorder) == 0 {
+ return nil
+ }
+ root := &TreeNode{Val: preorder[0]}
+ for pos, node := range inorder {
+ if node == root.Val {
+ root.Left = buildTree(preorder[1:pos+1], inorder[:pos])
+ root.Right = buildTree(preorder[pos+1:], inorder[pos+1:])
+ }
+ }
+ return root
+}
+
+// 解法二
+func buildTree1(preorder []int, inorder []int) *TreeNode {
+ inPos := make(map[int]int)
+ for i := 0; i < len(inorder); i++ {
+ inPos[inorder[i]] = i
+ }
+ return buildPreIn2TreeDFS(preorder, 0, len(preorder)-1, 0, inPos)
+}
+
+func buildPreIn2TreeDFS(pre []int, preStart int, preEnd int, inStart int, inPos map[int]int) *TreeNode {
+ if preStart > preEnd {
+ return nil
+ }
+ root := &TreeNode{Val: pre[preStart]}
+ rootIdx := inPos[pre[preStart]]
+ leftLen := rootIdx - inStart
+ root.Left = buildPreIn2TreeDFS(pre, preStart+1, preStart+leftLen, inStart, inPos)
+ root.Right = buildPreIn2TreeDFS(pre, preStart+leftLen+1, preEnd, rootIdx+1, inPos)
+ return root
+}
+
+
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<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>
diff --git a/website/content/ChapterFour/0100~0199/0106.Construct-Binary-Tree-from-Inorder-and-Postorder-Traversal.md b/website/content/ChapterFour/0100~0199/0106.Construct-Binary-Tree-from-Inorder-and-Postorder-Traversal.md
new file mode 100755
index 000000000..fe051ed8c
--- /dev/null
+++ b/website/content/ChapterFour/0100~0199/0106.Construct-Binary-Tree-from-Inorder-and-Postorder-Traversal.md
@@ -0,0 +1,105 @@
+# [106. Construct Binary Tree from Inorder and Postorder Traversal](https://leetcode.com/problems/construct-binary-tree-from-inorder-and-postorder-traversal/)
+
+## 题目
+
+Given inorder and postorder traversal of a tree, construct the binary tree.
+
+**Note**: You may assume that duplicates do not exist in the tree.
+
+For example, given
+
+ inorder = [9,3,15,20,7]
+ postorder = [9,15,7,20,3]
+
+Return the following binary tree:
+
+ 3
+ / \
+ 9 20
+ / \
+ 15 7
+
+
+## 题目大意
+
+根据一棵树的中序遍历与后序遍历构造二叉树。
+
+注意:
+你可以假设树中没有重复的元素。
+
+
+## 解题思路
+
+- 给出 2 个数组，根据 inorder 和 postorder 数组构造一颗树。
+- 利用递归思想，从 postorder 可以得到根节点，从 inorder 中得到左子树和右子树。只剩一个节点的时候即为根节点。不断的递归直到所有的树都生成完成。
+
+
+## 代码
+
+```go
+
+package leetcode
+
+import (
+ "github.com/halfrost/leetcode-go/structures"
+)
+
+// TreeNode define
+type TreeNode = structures.TreeNode
+
+/**
+ * Definition for a binary tree node.
+ * type TreeNode struct {
+ * Val int
+ * Left *TreeNode
+ * Right *TreeNode
+ * }
+ */
+
+// 解法一, 直接传入需要的 slice 范围作为输入, 可以避免申请对应 inorder 索引的内存, 内存使用(leetcode test case) 4.7MB -> 4.3MB.
+func buildTree(inorder []int, postorder []int) *TreeNode {
+ postorderLen := len(postorder)
+ if len(inorder) == 0 {
+ return nil
+ }
+ root := &TreeNode{Val: postorder[postorderLen-1]}
+ postorder = postorder[:postorderLen-1]
+ for pos, node := range inorder {
+ if node == root.Val {
+ root.Left = buildTree(inorder[:pos], postorder[:len(inorder[:pos])])
+ root.Right = buildTree(inorder[pos+1:], postorder[len(inorder[:pos]):])
+ }
+ }
+ return root
+}
+
+// 解法二
+func buildTree1(inorder []int, postorder []int) *TreeNode {
+ inPos := make(map[int]int)
+ for i := 0; i < len(inorder); i++ {
+ inPos[inorder[i]] = i
+ }
+ return buildInPos2TreeDFS(postorder, 0, len(postorder)-1, 0, inPos)
+}
+
+func buildInPos2TreeDFS(post []int, postStart int, postEnd int, inStart int, inPos map[int]int) *TreeNode {
+ if postStart > postEnd {
+ return nil
+ }
+ root := &TreeNode{Val: post[postEnd]}
+ rootIdx := inPos[post[postEnd]]
+ leftLen := rootIdx - inStart
+ root.Left = buildInPos2TreeDFS(post, postStart, postStart+leftLen-1, inStart, inPos)
+ root.Right = buildInPos2TreeDFS(post, postStart+leftLen, postEnd-1, rootIdx+1, inPos)
+ return root
+}
+
+
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<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>
diff --git a/website/content/ChapterFour/0100~0199/0107.Binary-Tree-Level-Order-Traversal-II.md b/website/content/ChapterFour/0100~0199/0107.Binary-Tree-Level-Order-Traversal-II.md
new file mode 100644
index 000000000..172e977be
--- /dev/null
+++ b/website/content/ChapterFour/0100~0199/0107.Binary-Tree-Level-Order-Traversal-II.md
@@ -0,0 +1,77 @@
+# [107. Binary Tree Level Order Traversal II](https://leetcode.com/problems/binary-tree-level-order-traversal-ii/)
+
+## 题目
+
+Given a binary tree, return the bottom-up level order traversal of its nodes' values. (ie, from left to right, level by level from leaf to root).
+
+**For Example**:
+
+Given binary tree [3,9,20,null,null,15,7],
+
+```
+
+ 3
+ / \
+ 9 20
+ / \
+ 15 7
+
+```
+
+return its bottom-up level order traversal as:
+
+
+```
+
+[
+ [15,7],
+ [9,20],
+ [3]
+]
+
+```
+
+
+## 题目大意
+
+按层序从下到上遍历一颗树。
+
+## 解题思路
+
+用一个队列即可实现。
+
+
+
+
+
+## 代码
+
+```go
+
+package leetcode
+
+/**
+ * Definition for a binary tree node.
+ * type TreeNode struct {
+ * Val int
+ * Left *TreeNode
+ * Right *TreeNode
+ * }
+ */
+func levelOrderBottom(root *TreeNode) [][]int {
+ tmp := levelOrder(root)
+ res := [][]int{}
+ for i := len(tmp) - 1; i >= 0; i-- {
+ res = append(res, tmp[i])
+ }
+ return res
+}
+
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<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>
diff --git a/website/content/ChapterFour/0108.Convert-Sorted-Array-to-Binary-Search-Tree.md b/website/content/ChapterFour/0100~0199/0108.Convert-Sorted-Array-to-Binary-Search-Tree.md
similarity index 76%
rename from website/content/ChapterFour/0108.Convert-Sorted-Array-to-Binary-Search-Tree.md
rename to website/content/ChapterFour/0100~0199/0108.Convert-Sorted-Array-to-Binary-Search-Tree.md
index b888c624c..3ed5eb093 100755
--- a/website/content/ChapterFour/0108.Convert-Sorted-Array-to-Binary-Search-Tree.md
+++ b/website/content/ChapterFour/0100~0199/0108.Convert-Sorted-Array-to-Binary-Search-Tree.md
@@ -49,4 +49,11 @@ func sortedArrayToBST(nums []int) *TreeNode {
return &TreeNode{Val: nums[len(nums)/2], Left: sortedArrayToBST(nums[:len(nums)/2]), Right: sortedArrayToBST(nums[len(nums)/2+1:])}
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<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>
diff --git a/website/content/ChapterFour/0109.Convert-Sorted-List-to-Binary-Search-Tree.md b/website/content/ChapterFour/0100~0199/0109.Convert-Sorted-List-to-Binary-Search-Tree.md
similarity index 83%
rename from website/content/ChapterFour/0109.Convert-Sorted-List-to-Binary-Search-Tree.md
rename to website/content/ChapterFour/0100~0199/0109.Convert-Sorted-List-to-Binary-Search-Tree.md
index 5ddfce296..dd85b3b16 100644
--- a/website/content/ChapterFour/0109.Convert-Sorted-List-to-Binary-Search-Tree.md
+++ b/website/content/ChapterFour/0100~0199/0109.Convert-Sorted-List-to-Binary-Search-Tree.md
@@ -94,4 +94,11 @@ func middleNodeAndPreNode(head *ListNode) (middle *ListNode, pre *ListNode) {
return p1, pre
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<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>
diff --git a/website/content/ChapterFour/0110.Balanced-Binary-Tree.md b/website/content/ChapterFour/0100~0199/0110.Balanced-Binary-Tree.md
similarity index 77%
rename from website/content/ChapterFour/0110.Balanced-Binary-Tree.md
rename to website/content/ChapterFour/0100~0199/0110.Balanced-Binary-Tree.md
index 9417fd714..3aad94369 100644
--- a/website/content/ChapterFour/0110.Balanced-Binary-Tree.md
+++ b/website/content/ChapterFour/0100~0199/0110.Balanced-Binary-Tree.md
@@ -87,4 +87,11 @@ func depth(root *TreeNode) int {
return max(depth(root.Left), depth(root.Right)) + 1
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<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>
diff --git a/website/content/ChapterFour/0111.Minimum-Depth-of-Binary-Tree.md b/website/content/ChapterFour/0100~0199/0111.Minimum-Depth-of-Binary-Tree.md
similarity index 76%
rename from website/content/ChapterFour/0111.Minimum-Depth-of-Binary-Tree.md
rename to website/content/ChapterFour/0100~0199/0111.Minimum-Depth-of-Binary-Tree.md
index 12019aedc..54530d510 100755
--- a/website/content/ChapterFour/0111.Minimum-Depth-of-Binary-Tree.md
+++ b/website/content/ChapterFour/0100~0199/0111.Minimum-Depth-of-Binary-Tree.md
@@ -59,4 +59,11 @@ func minDepth(root *TreeNode) int {
return min(minDepth(root.Left), minDepth(root.Right)) + 1
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<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>
diff --git a/website/content/ChapterFour/0112.Path-Sum.md b/website/content/ChapterFour/0100~0199/0112.Path-Sum.md
similarity index 75%
rename from website/content/ChapterFour/0112.Path-Sum.md
rename to website/content/ChapterFour/0100~0199/0112.Path-Sum.md
index 19a226319..5964900af 100755
--- a/website/content/ChapterFour/0112.Path-Sum.md
+++ b/website/content/ChapterFour/0100~0199/0112.Path-Sum.md
@@ -56,4 +56,11 @@ func hasPathSum(root *TreeNode, sum int) bool {
return hasPathSum(root.Left, sum-root.Val) || hasPathSum(root.Right, sum-root.Val)
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<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>
diff --git a/website/content/ChapterFour/0113.Path-Sum-II.md b/website/content/ChapterFour/0100~0199/0113.Path-Sum-II.md
similarity index 84%
rename from website/content/ChapterFour/0113.Path-Sum-II.md
rename to website/content/ChapterFour/0100~0199/0113.Path-Sum-II.md
index ac592ca89..2b6927fff 100755
--- a/website/content/ChapterFour/0113.Path-Sum-II.md
+++ b/website/content/ChapterFour/0100~0199/0113.Path-Sum-II.md
@@ -105,4 +105,11 @@ func pathSum1(root *TreeNode, sum int) [][]int {
return res
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<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>
diff --git a/website/content/ChapterFour/0114.Flatten-Binary-Tree-to-Linked-List.md b/website/content/ChapterFour/0100~0199/0114.Flatten-Binary-Tree-to-Linked-List.md
similarity index 90%
rename from website/content/ChapterFour/0114.Flatten-Binary-Tree-to-Linked-List.md
rename to website/content/ChapterFour/0100~0199/0114.Flatten-Binary-Tree-to-Linked-List.md
index 4cfc5452b..a466638e6 100755
--- a/website/content/ChapterFour/0114.Flatten-Binary-Tree-to-Linked-List.md
+++ b/website/content/ChapterFour/0100~0199/0114.Flatten-Binary-Tree-to-Linked-List.md
@@ -188,4 +188,11 @@ func flatten2(root *TreeNode) {
root.Left = nil
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<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/0115.Distinct-Subsequences/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0100~0199/0115.Distinct-Subsequences.md b/website/content/ChapterFour/0100~0199/0115.Distinct-Subsequences.md
new file mode 100644
index 000000000..b3baae4d5
--- /dev/null
+++ b/website/content/ChapterFour/0100~0199/0115.Distinct-Subsequences.md
@@ -0,0 +1,108 @@
+# [115. Distinct Subsequences](https://leetcode.com/problems/distinct-subsequences/)
+
+
+## 题目
+
+Given two strings `s` and `t`, return *the number of distinct subsequences of `s` which equals `t`*.
+
+A string's **subsequence** is a new string formed from the original string by deleting some (can be none) of the characters without disturbing the remaining characters' relative positions. (i.e., `"ACE"` is a subsequence of `"ABCDE"` while `"AEC"` is not).
+
+It is guaranteed the answer fits on a 32-bit signed integer.
+
+**Example 1:**
+
+```
+Input: s = "rabbbit", t = "rabbit"
+Output: 3
+Explanation:
+As shown below, there are 3 ways you can generate "rabbit" from S.
+rabbbitrabbbitrabbbit
+```
+
+**Example 2:**
+
+```
+Input: s = "babgbag", t = "bag"
+Output: 5
+Explanation:
+As shown below, there are 5 ways you can generate "bag" from S.
+babgbagbabgbagbabgbagbabgbagbabgbag
+```
+
+**Constraints:**
+
+- `0 <= s.length, t.length <= 1000`
+- `s` and `t` consist of English letters.
+
+## 题目大意
+
+给定一个字符串 s 和一个字符串 t ，计算在 s 的子序列中 t 出现的个数。字符串的一个 子序列 是指，通过删除一些（也可以不删除）字符且不干扰剩余字符相对位置所组成的新字符串。（例如，"ACE" 是 "ABCDE" 的一个子序列，而 "AEC" 不是）题目数据保证答案符合 32 位带符号整数范围。
+
+## 解题思路
+
+- 在字符串 `s` 中最多包含多少个字符串 `t`。这里面包含很多重叠子问题，所以尝试用动态规划解决这个问题。定义 `dp[i][j]` 代表 `s[i:]` 的子序列中 `t[j:]` 出现的个数。初始化先判断边界条件。当 `i = len(s)` 且 `0≤ j < len(t)` 的时候，`s[i:]` 为空字符串，`t[j:]` 不为空，所以 `dp[len(s)][j] = 0`。当 `j = len(t)` 且 `0 ≤ i < len(s)` 的时候，`t[j:]` 不为空字符串，空字符串是任何字符串的子序列。所以 `dp[i][n] = 1`。
+- 当 `i < len(s)` 且 `j < len(t)` 的时候，如果 `s[i] == t[j]`，有 2 种匹配方式，第一种将 `s[i]` 与 `t[j]` 匹配，那么 `t[j+1:]` 匹配 `s[i+1:]` 的子序列，子序列数为 `dp[i+1][j+1]`；第二种将 `s[i]` 不与 `t[j]` 匹配，`t[j:]` 作为 `s[i+1:]` 的子序列，子序列数为 `dp[i+1][j]`。综合 2 种情况，当 `s[i] == t[j]` 时，`dp[i][j] = dp[i+1][j+1] + dp[i+1][j]`。
+- 如果 `s[i] != t[j]`，此时 `t[j:]` 只能作为 `s[i+1:]` 的子序列，子序列数为 `dp[i+1][j]`。所以当 `s[i] != t[j]` 时，`dp[i][j] = dp[i+1][j]`。综上分析得：
+
+ {{< katex display >}}
+ dp[i][j] = \left\{\begin{matrix}dp[i+1][j+1]+dp[i+1][j]&,s[i]=t[j]\\ dp[i+1][j]&,s[i]!=t[j]\end{matrix}\right.
+ {{< /katex >}}
+
+- 最后是优化版本。写出上述代码以后，可以发现填表的过程是从右下角一直填到左上角。填表顺序是 从下往上一行一行的填。行内从右往左填。于是可以将这个二维数据压缩到一维。因为填充当前行只需要用到它的下一行信息即可，更进一步，用到的是下一行中右边元素的信息。于是可以每次更新该行时，先将旧的值存起来，计算更新该行的时候从右往左更新。这样做即可减少一维空间，将原来的二维数组压缩到一维数组。
+
+## 代码
+
+```go
+package leetcode
+
+// 解法一 压缩版 DP
+func numDistinct(s string, t string) int {
+ dp := make([]int, len(s)+1)
+ for i, curT := range t {
+ pre := 0
+ for j, curS := range s {
+ if i == 0 {
+ pre = 1
+ }
+ newDP := dp[j+1]
+ if curT == curS {
+ dp[j+1] = dp[j] + pre
+ } else {
+ dp[j+1] = dp[j]
+ }
+ pre = newDP
+ }
+ }
+ return dp[len(s)]
+}
+
+// 解法二 普通 DP
+func numDistinct1(s, t string) int {
+ m, n := len(s), len(t)
+ if m < n {
+ return 0
+ }
+ dp := make([][]int, m+1)
+ for i := range dp {
+ dp[i] = make([]int, n+1)
+ dp[i][n] = 1
+ }
+ for i := m - 1; i >= 0; i-- {
+ for j := n - 1; j >= 0; j-- {
+ if s[i] == t[j] {
+ dp[i][j] = dp[i+1][j+1] + dp[i+1][j]
+ } else {
+ dp[i][j] = dp[i+1][j]
+ }
+ }
+ }
+ return dp[0][0]
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<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/0116.Populating-Next-Right-Pointers-in-Each-Node/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0100~0199/0116.Populating-Next-Right-Pointers-in-Each-Node.md b/website/content/ChapterFour/0100~0199/0116.Populating-Next-Right-Pointers-in-Each-Node.md
new file mode 100644
index 000000000..95b54ea29
--- /dev/null
+++ b/website/content/ChapterFour/0100~0199/0116.Populating-Next-Right-Pointers-in-Each-Node.md
@@ -0,0 +1,125 @@
+# [116. Populating Next Right Pointers in Each Node](https://leetcode.com/problems/populating-next-right-pointers-in-each-node/)
+
+
+## 题目
+
+You are given a **perfect binary tree** where all leaves are on the same level, and every parent has two children. The binary tree has the following definition:
+
+```
+struct Node {
+ int val;
+ Node *left;
+ Node *right;
+ Node *next;
+}
+
+```
+
+Populate each next pointer to point to its next right node. If there is no next right node, the next pointer should be set to `NULL`.
+
+Initially, all next pointers are set to `NULL`.
+
+**Follow up:**
+
+- You may only use constant extra space.
+- Recursive approach is fine, you may assume implicit stack space does not count as extra space for this problem.
+
+**Example 1:**
+
+
+
+```
+Input: root = [1,2,3,4,5,6,7]
+Output: [1,#,2,3,#,4,5,6,7,#]
+Explanation:Given the above perfect binary tree (Figure A), your function should populate each next pointer to point to its next right node, just like in Figure B. The serialized output is in level order as connected by the next pointers, with '#' signifying the end of each level.
+
+```
+
+**Constraints:**
+
+- The number of nodes in the given tree is less than `4096`.
+- `1000 <= node.val <= 1000`
+
+## 题目大意
+
+给定一个 完美二叉树 ，其所有叶子节点都在同一层，每个父节点都有两个子节点。二叉树定义如下：
+
+```jsx
+struct Node {
+ int val;
+ Node *left;
+ Node *right;
+ Node *next;
+}
+
+```
+
+填充它的每个 next 指针，让这个指针指向其下一个右侧节点。如果找不到下一个右侧节点，则将 next 指针设置为 NULL。初始状态下，所有 next 指针都被设置为 NULL。
+
+## 解题思路
+
+- 本质上是二叉树的层序遍历，基于广度优先搜索，将每层的节点放入队列，并遍历队列进行连接。
+
+## 代码
+
+```go
+package leetcode
+
+type Node struct {
+ Val int
+ Left *Node
+ Right *Node
+ Next *Node
+}
+
+//解法一：迭代
+func connect(root *Node) *Node {
+ if root == nil {
+ return root
+ }
+ q := []*Node{root}
+ for len(q) > 0 {
+ var p []*Node
+ // 遍历这一层的所有节点
+ for i, node := range q {
+ if i+1 < len(q) {
+ node.Next = q[i+1]
+ }
+ if node.Left != nil {
+ p = append(p, node.Left)
+ }
+ if node.Right != nil {
+ p = append(p, node.Right)
+ }
+ }
+ q = p
+ }
+ return root
+}
+
+// 解法二 递归
+func connect2(root *Node) *Node {
+ if root == nil {
+ return nil
+ }
+ connectTwoNode(root.Left, root.Right)
+ return root
+}
+
+func connectTwoNode(node1, node2 *Node) {
+ if node1 == nil || node2 == nil {
+ return
+ }
+ node1.Next = node2
+ connectTwoNode(node1.Left, node1.Right)
+ connectTwoNode(node2.Left, node2.Right)
+ connectTwoNode(node1.Right, node2.Left)
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0100~0199/0115.Distinct-Subsequences/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0100~0199/0118.Pascals-Triangle/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0100~0199/0118.Pascals-Triangle.md b/website/content/ChapterFour/0100~0199/0118.Pascals-Triangle.md
new file mode 100644
index 000000000..9dee8ab67
--- /dev/null
+++ b/website/content/ChapterFour/0100~0199/0118.Pascals-Triangle.md
@@ -0,0 +1,67 @@
+# [118. Pascal's Triangle](https://leetcode.com/problems/pascals-triangle/)
+
+
+## 题目
+
+Given a non-negative integer numRows, generate the first numRows of Pascal's triangle.
+
+
+
+**Note**: In Pascal's triangle, each number is the sum of the two numbers directly above it.
+
+**Example**:
+
+```
+Input: 5
+Output:
+[
+ [1],
+ [1,1],
+ [1,2,1],
+ [1,3,3,1],
+ [1,4,6,4,1]
+]
+```
+
+## 题目大意
+
+给定一个非负整数 numRows，生成杨辉三角的前 numRows 行。在杨辉三角中，每个数是它左上方和右上方的数的和。
+
+
+## 解题思路
+
+- 给定一个 n，要求打印杨辉三角的前 n 行。
+- 简单题。按照杨辉三角的生成规则循环打印即可。
+
+
+## 代码
+
+```go
+
+package leetcode
+
+func generate(numRows int) [][]int {
+ result := [][]int{}
+ for i := 0; i < numRows; i++ {
+ row := []int{}
+ for j := 0; j < i+1; j++ {
+ if j == 0 || j == i {
+ row = append(row, 1)
+ } else if i > 1 {
+ row = append(row, result[i-1][j-1]+result[i-1][j])
+ }
+ }
+ result = append(result, row)
+ }
+ return result
+}
+
+```
+
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0100~0199/0116.Populating-Next-Right-Pointers-in-Each-Node/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0100~0199/0119.Pascals-Triangle-II/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0100~0199/0119.Pascals-Triangle-II.md b/website/content/ChapterFour/0100~0199/0119.Pascals-Triangle-II.md
new file mode 100644
index 000000000..368da337e
--- /dev/null
+++ b/website/content/ChapterFour/0100~0199/0119.Pascals-Triangle-II.md
@@ -0,0 +1,83 @@
+# [119. Pascal's Triangle II](https://leetcode.com/problems/pascals-triangle-ii/)
+
+
+## 题目
+
+Given an integer `rowIndex`, return the `rowIndexth` row of the Pascal's triangle.
+
+Notice that the row index starts from **0**.
+
+
+
+In Pascal's triangle, each number is the sum of the two numbers directly above it.
+
+**Follow up:**
+
+Could you optimize your algorithm to use only *O*(*k*) extra space?
+
+**Example 1:**
+
+```
+Input: rowIndex = 3
+Output: [1,3,3,1]
+```
+
+**Example 2:**
+
+```
+Input: rowIndex = 0
+Output: [1]
+```
+
+**Example 3:**
+
+```
+Input: rowIndex = 1
+Output: [1,1]
+```
+
+**Constraints:**
+
+- `0 <= rowIndex <= 33`
+
+## 题目大意
+
+给定一个非负索引 k，其中 k ≤ 33，返回杨辉三角的第 k 行。
+
+## 解题思路
+
+- 题目中的三角是杨辉三角，每个数字是 `(a+b)^n` 二项式展开的系数。题目要求我们只能使用 O(k) 的空间。那么需要找到两两项直接的递推关系。由组合知识得知：
+
+ {{< katex display >}}
+ \begin{aligned}C_{n}^{m} &= \frac{n!}{m!(n-m)!} \\C_{n}^{m-1} &= \frac{n!}{(m-1)!(n-m+1)!}\end{aligned}
+ {{< /katex>}}
+
+ 于是得到递推公式：
+
+ {{< katex display >}}
+ C_{n}^{m} = C_{n}^{m-1} \times \frac{n-m+1}{m}
+ {{< /katex>}}
+
+ 利用这个递推公式即可以把空间复杂度优化到 O(k)
+
+## 代码
+
+```go
+package leetcode
+
+func getRow(rowIndex int) []int {
+ row := make([]int, rowIndex+1)
+ row[0] = 1
+ for i := 1; i <= rowIndex; i++ {
+ row[i] = row[i-1] * (rowIndex - i + 1) / i
+ }
+ return row
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<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/0120.Triangle/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0120.Triangle.md b/website/content/ChapterFour/0100~0199/0120.Triangle.md
similarity index 84%
rename from website/content/ChapterFour/0120.Triangle.md
rename to website/content/ChapterFour/0100~0199/0120.Triangle.md
index d3ec11128..83498b7e7 100755
--- a/website/content/ChapterFour/0120.Triangle.md
+++ b/website/content/ChapterFour/0100~0199/0120.Triangle.md
@@ -86,4 +86,11 @@ func minimumTotal1(triangle [][]int) int {
return minNum
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0100~0199/0119.Pascals-Triangle-II/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0100~0199/0121.Best-Time-to-Buy-and-Sell-Stock/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0121.Best-Time-to-Buy-and-Sell-Stock.md b/website/content/ChapterFour/0100~0199/0121.Best-Time-to-Buy-and-Sell-Stock.md
similarity index 84%
rename from website/content/ChapterFour/0121.Best-Time-to-Buy-and-Sell-Stock.md
rename to website/content/ChapterFour/0100~0199/0121.Best-Time-to-Buy-and-Sell-Stock.md
index 5a39f8cc8..b08d1fd2e 100755
--- a/website/content/ChapterFour/0121.Best-Time-to-Buy-and-Sell-Stock.md
+++ b/website/content/ChapterFour/0100~0199/0121.Best-Time-to-Buy-and-Sell-Stock.md
@@ -79,4 +79,11 @@ func maxProfit1(prices []int) int {
return res
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<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>
diff --git a/website/content/ChapterFour/0122.Best-Time-to-Buy-and-Sell-Stock-II.md b/website/content/ChapterFour/0100~0199/0122.Best-Time-to-Buy-and-Sell-Stock-II.md
similarity index 84%
rename from website/content/ChapterFour/0122.Best-Time-to-Buy-and-Sell-Stock-II.md
rename to website/content/ChapterFour/0100~0199/0122.Best-Time-to-Buy-and-Sell-Stock-II.md
index 5029cbf82..93d77d36d 100755
--- a/website/content/ChapterFour/0122.Best-Time-to-Buy-and-Sell-Stock-II.md
+++ b/website/content/ChapterFour/0100~0199/0122.Best-Time-to-Buy-and-Sell-Stock-II.md
@@ -57,4 +57,11 @@ func maxProfit122(prices []int) int {
return profit
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<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>
diff --git a/website/content/ChapterFour/0124.Binary-Tree-Maximum-Path-Sum.md b/website/content/ChapterFour/0100~0199/0124.Binary-Tree-Maximum-Path-Sum.md
similarity index 83%
rename from website/content/ChapterFour/0124.Binary-Tree-Maximum-Path-Sum.md
rename to website/content/ChapterFour/0100~0199/0124.Binary-Tree-Maximum-Path-Sum.md
index b8fdab715..51e96ff61 100755
--- a/website/content/ChapterFour/0124.Binary-Tree-Maximum-Path-Sum.md
+++ b/website/content/ChapterFour/0100~0199/0124.Binary-Tree-Maximum-Path-Sum.md
@@ -77,4 +77,11 @@ func getPathSum(root *TreeNode, maxSum *int) int {
return currMax
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<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>
diff --git a/website/content/ChapterFour/0100~0199/0125.Valid-Palindrome.md b/website/content/ChapterFour/0100~0199/0125.Valid-Palindrome.md
new file mode 100644
index 000000000..b0c7257ac
--- /dev/null
+++ b/website/content/ChapterFour/0100~0199/0125.Valid-Palindrome.md
@@ -0,0 +1,74 @@
+# [125. Valid Palindrome](https://leetcode.com/problems/valid-palindrome/description/)
+
+## 题目
+
+Given a string, determine if it is a palindrome, considering only alphanumeric characters and ignoring cases.
+
+For example,
+
+```
+
+"A man, a plan, a canal: Panama" is a palindrome.
+"race a car" is not a palindrome.
+
+```
+
+**Note**:
+
+Have you consider that the string might be empty? This is a good question to ask during an interview.
+
+For the purpose of this problem, we define empty string as valid palindrome.
+
+## 题目大意
+
+判断所给的字符串是否是有效的回文串。
+
+## 解题思路
+
+简单题，按照题意做即可。
+
+## 代码
+
+```go
+
+package leetcode
+
+import (
+ "strings"
+)
+
+func isPalindrome(s string) bool {
+ s = strings.ToLower(s)
+ i, j := 0, len(s)-1
+ for i < j {
+ for i < j && !isChar(s[i]) {
+ i++
+ }
+ for i < j && !isChar(s[j]) {
+ j--
+ }
+ if s[i] != s[j] {
+ return false
+ }
+ i++
+ j--
+ }
+ return true
+}
+
+// 判断 c 是否是字符或者数字
+func isChar(c byte) bool {
+ if ('a' <= c && c <= 'z') || ('0' <= c && c <= '9') {
+ return true
+ }
+ return false
+}
+
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<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>
diff --git a/website/content/ChapterFour/0126.Word-Ladder-II.md b/website/content/ChapterFour/0100~0199/0126.Word-Ladder-II.md
similarity index 91%
rename from website/content/ChapterFour/0126.Word-Ladder-II.md
rename to website/content/ChapterFour/0100~0199/0126.Word-Ladder-II.md
index 687124c7b..e1d328a52 100755
--- a/website/content/ChapterFour/0126.Word-Ladder-II.md
+++ b/website/content/ChapterFour/0100~0199/0126.Word-Ladder-II.md
@@ -127,4 +127,11 @@ func findLadders(beginWord string, endWord string, wordList []string) [][]string
return result
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0100~0199/0125.Valid-Palindrome/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0100~0199/0127.Word-Ladder/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0127.Word-Ladder.md b/website/content/ChapterFour/0100~0199/0127.Word-Ladder.md
similarity index 90%
rename from website/content/ChapterFour/0127.Word-Ladder.md
rename to website/content/ChapterFour/0100~0199/0127.Word-Ladder.md
index cf67f6d1a..7a7db0e87 100755
--- a/website/content/ChapterFour/0127.Word-Ladder.md
+++ b/website/content/ChapterFour/0100~0199/0127.Word-Ladder.md
@@ -118,4 +118,11 @@ func getCandidates(word string) []string {
return res
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0100~0199/0126.Word-Ladder-II/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0100~0199/0128.Longest-Consecutive-Sequence/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0128.Longest-Consecutive-Sequence.md b/website/content/ChapterFour/0100~0199/0128.Longest-Consecutive-Sequence.md
similarity index 90%
rename from website/content/ChapterFour/0128.Longest-Consecutive-Sequence.md
rename to website/content/ChapterFour/0100~0199/0128.Longest-Consecutive-Sequence.md
index 80d7a5f47..fddce0f06 100755
--- a/website/content/ChapterFour/0128.Longest-Consecutive-Sequence.md
+++ b/website/content/ChapterFour/0100~0199/0128.Longest-Consecutive-Sequence.md
@@ -37,7 +37,7 @@ Your algorithm should run in O(*n*) complexity.
package leetcode
import (
- "github.com/halfrost/LeetCode-Go/template"
+ "github.com/halfrost/leetcode-go/template"
)
// 解法一 map，时间复杂度 O(n)
@@ -136,4 +136,11 @@ func longestConsecutive2(nums []int) int {
return max(lcs, length)
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0100~0199/0127.Word-Ladder/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0100~0199/0129.Sum-Root-to-Leaf-Numbers/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0100~0199/0129.Sum-Root-to-Leaf-Numbers.md b/website/content/ChapterFour/0100~0199/0129.Sum-Root-to-Leaf-Numbers.md
new file mode 100755
index 000000000..312f4a066
--- /dev/null
+++ b/website/content/ChapterFour/0100~0199/0129.Sum-Root-to-Leaf-Numbers.md
@@ -0,0 +1,99 @@
+# [129. Sum Root to Leaf Numbers](https://leetcode.com/problems/sum-root-to-leaf-numbers/)
+
+
+## 题目
+
+Given a binary tree containing digits from `0-9` only, each root-to-leaf path could represent a number.
+
+An example is the root-to-leaf path `1->2->3` which represents the number `123`.
+
+Find the total sum of all root-to-leaf numbers.
+
+**Note**: A leaf is a node with no children.
+
+**Example**:
+
+ Input: [1,2,3]
+ 1
+ / \
+ 2 3
+ Output: 25
+ Explanation:
+ The root-to-leaf path 1->2 represents the number 12.
+ The root-to-leaf path 1->3 represents the number 13.
+ Therefore, sum = 12 + 13 = 25.
+
+**Example 2**:
+
+ Input: [4,9,0,5,1]
+ 4
+ / \
+ 9 0
+ / \
+ 5 1
+ Output: 1026
+ Explanation:
+ The root-to-leaf path 4->9->5 represents the number 495.
+ The root-to-leaf path 4->9->1 represents the number 491.
+ The root-to-leaf path 4->0 represents the number 40.
+ Therefore, sum = 495 + 491 + 40 = 1026.
+
+## 题目大意
+
+给定一个二叉树，它的每个结点都存放一个 0-9 的数字，每条从根到叶子节点的路径都代表一个数字。例如，从根到叶子节点路径 1->2->3 代表数字 123。计算从根到叶子节点生成的所有数字之和。说明: 叶子节点是指没有子节点的节点。
+
+
+## 解题思路
+
+- 这一题是第 257 题的变形题，第 257 题要求输出每条从根节点到叶子节点的路径，这一题变成了把每一个从根节点到叶子节点的数字都串联起来，再累加每条路径，求出最后的总和。实际做题思路基本没变。运用前序遍历的思想，当从根节点出发一直加到叶子节点，每个叶子节点汇总一次。
+
+
+## 代码
+
+```go
+
+package leetcode
+
+import (
+ "github.com/halfrost/leetcode-go/structures"
+)
+
+// TreeNode define
+type TreeNode = structures.TreeNode
+
+/**
+ * Definition for a binary tree node.
+ * type TreeNode struct {
+ * Val int
+ * Left *TreeNode
+ * Right *TreeNode
+ * }
+ */
+
+func sumNumbers(root *TreeNode) int {
+ res := 0
+ dfs(root,0,&res)
+ return res
+}
+
+func dfs(root *TreeNode,sum int,res *int) {
+ if root == nil{
+ return
+ }
+ sum = sum*10 + root.Val
+ if root.Left == nil && root.Right == nil{
+ *res += sum
+ return
+ }
+ dfs(root.Left,sum,res)
+ dfs(root.Right,sum,res)
+}
+
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0100~0199/0128.Longest-Consecutive-Sequence/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0100~0199/0130.Surrounded-Regions/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0130.Surrounded-Regions.md b/website/content/ChapterFour/0100~0199/0130.Surrounded-Regions.md
similarity index 88%
rename from website/content/ChapterFour/0130.Surrounded-Regions.md
rename to website/content/ChapterFour/0100~0199/0130.Surrounded-Regions.md
index 4ba381974..279e9551b 100755
--- a/website/content/ChapterFour/0130.Surrounded-Regions.md
+++ b/website/content/ChapterFour/0100~0199/0130.Surrounded-Regions.md
@@ -22,7 +22,7 @@ After running your function, the board should be:
X X X X
X O X X
-**Explanation:**
+**Explanation**:
Surrounded regions shouldn’t be on the border, which means that any `'O'` on the border of the board are not flipped to `'X'`. Any `'O'` that is not on the border and it is not connected to an `'O'` on the border will be flipped to `'X'`. Two cells are connected if they are adjacent cells connected horizontally or vertically.
@@ -46,7 +46,7 @@ Surrounded regions shouldn’t be on the border, which means that any `'O'` on
package leetcode
import (
- "github.com/halfrost/LeetCode-Go/template"
+ "github.com/halfrost/leetcode-go/template"
)
// 解法一 并查集
@@ -123,4 +123,11 @@ func dfs130(i, j int, board [][]byte) {
}
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0100~0199/0129.Sum-Root-to-Leaf-Numbers/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0100~0199/0131.Palindrome-Partitioning/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0131.Palindrome-Partitioning.md b/website/content/ChapterFour/0100~0199/0131.Palindrome-Partitioning.md
similarity index 86%
rename from website/content/ChapterFour/0131.Palindrome-Partitioning.md
rename to website/content/ChapterFour/0100~0199/0131.Palindrome-Partitioning.md
index 29b17bff6..eb77f95c5 100755
--- a/website/content/ChapterFour/0131.Palindrome-Partitioning.md
+++ b/website/content/ChapterFour/0100~0199/0131.Palindrome-Partitioning.md
@@ -118,4 +118,11 @@ func isPal(str string, s, e int) bool {
return true
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0100~0199/0130.Surrounded-Regions/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0100~0199/0135.Candy/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0100~0199/0135.Candy.md b/website/content/ChapterFour/0100~0199/0135.Candy.md
new file mode 100644
index 000000000..d2df666b9
--- /dev/null
+++ b/website/content/ChapterFour/0100~0199/0135.Candy.md
@@ -0,0 +1,81 @@
+# [135. Candy](https://leetcode.com/problems/candy/)
+
+
+## 题目
+
+There are `n` children standing in a line. Each child is assigned a rating value given in the integer array `ratings`.
+
+You are giving candies to these children subjected to the following requirements:
+
+- Each child must have at least one candy.
+- Children with a higher rating get more candies than their neighbors.
+
+Return *the minimum number of candies you need to have to distribute the candies to the children*.
+
+**Example 1:**
+
+```
+Input: ratings = [1,0,2]
+Output: 5
+Explanation: You can allocate to the first, second and third child with 2, 1, 2 candies respectively.
+```
+
+**Example 2:**
+
+```
+Input: ratings = [1,2,2]
+Output: 4
+Explanation: You can allocate to the first, second and third child with 1, 2, 1 candies respectively.
+The third child gets 1 candy because it satisfies the above two conditions.
+```
+
+**Constraints:**
+
+- `n == ratings.length`
+- `1 <= n <= 2 * 10^4`
+- `0 <= ratings[i] <= 2 * 10^4`
+
+## 题目大意
+
+老师想给孩子们分发糖果，有 N 个孩子站成了一条直线，老师会根据每个孩子的表现，预先给他们评分。你需要按照以下要求，帮助老师给这些孩子分发糖果：
+
+- 每个孩子至少分配到 1 个糖果。
+- 评分更高的孩子必须比他两侧的邻位孩子获得更多的糖果。
+
+那么这样下来，老师至少需要准备多少颗糖果呢？
+
+## 解题思路
+
+- 本题的突破口在于，评分更高的孩子必须比他两侧的邻位孩子获得更多的糖果，这句话。这个规则可以理解为 2 条规则，想象成按身高排队，站在下标为 0 的地方往后“看”，评分高即为个子高的，应该比前面个子矮(评分低)的分到糖果多；站在下标为 n - 1 的地方往后“看”，评分高即为个子高的，同样应该比前面个子矮(评分低)的分到糖果多。你可能会有疑问，规则都是一样的，为什么会出现至少需要多少糖果呢？因为可能出现评分一样高的同学。扫描数组两次，处理出每一个学生分别满足左规则或右规则时，最少需要被分得的糖果数量。每个人最终分得的糖果数量即为这两个数量的最大值。两次遍历结束，将所有糖果累加起来即为至少需要准备的糖果数。由于每个人至少分配到 1 个糖果，所以每个人糖果数再加一。
+
+## 代码
+
+```go
+package leetcode
+
+func candy(ratings []int) int {
+ candies := make([]int, len(ratings))
+ for i := 1; i < len(ratings); i++ {
+ if ratings[i] > ratings[i-1] {
+ candies[i] += candies[i-1] + 1
+ }
+ }
+ for i := len(ratings) - 2; i >= 0; i-- {
+ if ratings[i] > ratings[i+1] && candies[i] <= candies[i+1] {
+ candies[i] = candies[i+1] + 1
+ }
+ }
+ total := 0
+ for _, candy := range candies {
+ total += candy + 1
+ }
+ return total
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0100~0199/0131.Palindrome-Partitioning/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0100~0199/0136.Single-Number/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0136.Single-Number.md b/website/content/ChapterFour/0100~0199/0136.Single-Number.md
similarity index 77%
rename from website/content/ChapterFour/0136.Single-Number.md
rename to website/content/ChapterFour/0100~0199/0136.Single-Number.md
index e3d24d83e..a5801d4e1 100755
--- a/website/content/ChapterFour/0136.Single-Number.md
+++ b/website/content/ChapterFour/0100~0199/0136.Single-Number.md
@@ -26,7 +26,7 @@ Your algorithm should have a linear runtime complexity. Could you implement it w
## 解题思路
- 题目要求不能使用辅助空间，并且时间复杂度只能是线性的。
-- 题目为什么要强调有一个数字出现一次，其他的出现两次？我们想到了异或运算的性质：任何一个数字异或它自己都等于0。也就是说，如果我们从头到尾依次异或数组中的每一个数字，那么最终的结果刚好是那个只出现依次的数字，因为那些出现两次的数字全部在异或中抵消掉了。于是最终做法是从头到尾依次异或数组中的每一个数字，那么最终得到的结果就是两个只出现一次的数字的异或结果。因为其他数字都出现了两次，在异或中全部抵消掉了。**利用的性质是 x^x = 0**。
+- 题目为什么要强调有一个数字出现一次，其他的出现两次？我们想到了异或运算的性质：任何一个数字异或它自己都等于0。也就是说，如果我们从头到尾依次异或数组中的每一个数字，那么最终的结果刚好是那个只出现一次的数字，因为那些出现两次的数字全部在异或中抵消掉了。于是最终做法是从头到尾依次异或数组中的每一个数字，那么最终得到的结果就是两个只出现一次的数字的异或结果。因为其他数字都出现了两次，在异或中全部抵消掉了。**利用的性质是 x^x = 0**。
## 代码
@@ -43,4 +43,11 @@ func singleNumber(nums []int) int {
return result
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0100~0199/0135.Candy/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0100~0199/0137.Single-Number-II/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0137.Single-Number-II.md b/website/content/ChapterFour/0100~0199/0137.Single-Number-II.md
similarity index 78%
rename from website/content/ChapterFour/0137.Single-Number-II.md
rename to website/content/ChapterFour/0100~0199/0137.Single-Number-II.md
index 5e82a6b73..9cbca6720 100755
--- a/website/content/ChapterFour/0137.Single-Number-II.md
+++ b/website/content/ChapterFour/0100~0199/0137.Single-Number-II.md
@@ -30,9 +30,9 @@ Your algorithm should have a linear runtime complexity. Could you implement it w
## 解题思路
- 这一题是第 136 题的加强版。这类题也可以扩展，在数组中每个元素都出现 5 次，找出只出现 1 次的数。
-- 本题中要求找出只出现 1 次的数，出现 3 次的数都要被消除。第 136 题是消除出现 2 次的数。这一题也会相当相同的解法，出现 3 次的数也要被消除。定义状态，00、10、01，这 3 个状态。当一个数出现 3 次，那么它每个位置上的 1 出现的次数肯定是 3 的倍数，所以当 1 出现 3 次以后，就归零清除。如何能做到这点呢？仿造`三进制(00，10，01)` 就可以做到。
+- 本题中要求找出只出现 1 次的数，出现 3 次的数都要被消除。第 136 题是消除出现 2 次的数。这一题也会相当相同的解法，出现 3 次的数也要被消除。定义状态，00、10、01，这 3 个状态。当一个数出现 3 次，那么它每个位置上的 1 出现的次数肯定是 3 的倍数，所以当 1 出现 3 次以后，就归零清除。如何能做到这点呢？仿造`三进制(00，01，10)` 就可以做到。
- 变量 ones 中记录遍历中每个位上出现 1 的个数。将它与 A[i] 进行异或，目的是：
- - 每位上两者都是 1 的，表示历史统计结果 ones 出现1次、A[i]中又出现1次，则是出现 2 次，需要进位到 twos 变量中。
+ - 每位上两者都是 1 的，表示历史统计结果 ones 出现1次、A[i]中又出现 1 次，则是出现 2 次，需要进位到 twos 变量中。
- 每位上两者分别为 0、1 的，加入到 ones 统计结果中。
- 最后还要 & ^twos ，是为了能做到三进制，出现 3 次就清零。例如 ones = x，那么 twos = 0，当 twos = x，那么 ones = 0；
- 变量 twos 中记录遍历中每个位上出现 1 ，2次 的个数。与 A[i] 进行异或的目的和上述描述相同，不再赘述。
@@ -41,6 +41,31 @@ Your algorithm should have a linear runtime complexity. Could you implement it w
> 在 golang 中没有 Java 中的 ~ 位操作运算符，Java 中的 ~ 运算符代表按位取反。这个操作就想当于 golang 中的 ^ 运算符当做一元运算符使用的效果。
+|(twos,ones)|xi|(twos'',ones')|ones'|
+|:----:|:----:|:----:|:----:|
+|00|0|00|0|
+|00|1|01|1|
+|01|0|01|1|
+|01|1|10|0|
+|10|0|10|0|
+|10|1|00|0|
+
+- 第一步，先将 ones -> ones'。通过观察可以看出 ones = (ones ^ nums[i]) & ^twos
+
+|(twos,ones')|xi|twos'|
+|:----:|:----:|:----:|
+|00|0|0|
+|01|1|0|
+|01|0|0|
+|00|1|1|
+|10|0|1|
+|10|1|0|
+
+
+- 第二步，再将 twos -> twos'。这一步需要用到前一步的 ones。通过观察可以看出 twos = (twos ^ nums[i]) & ^ones。
+
+--------------------------
+
这一题还可以继续扩展，在数组中每个元素都出现 5 次，找出只出现 1 次的数。那该怎么做呢？思路还是一样的，模拟一个五进制，5 次就会消除。代码如下：
// 解法一
@@ -106,4 +131,11 @@ func singleNumberIIIII1(nums []int) int {
return ones
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0100~0199/0136.Single-Number/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0100~0199/0138.Copy-List-With-Random-Pointer/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0100~0199/0138.Copy-List-With-Random-Pointer.md b/website/content/ChapterFour/0100~0199/0138.Copy-List-With-Random-Pointer.md
new file mode 100644
index 000000000..e43924798
--- /dev/null
+++ b/website/content/ChapterFour/0100~0199/0138.Copy-List-With-Random-Pointer.md
@@ -0,0 +1,137 @@
+# [138. Copy List with Random Pointer](https://leetcode.com/problems/copy-list-with-random-pointer/)
+
+## 题目
+
+A linked list is given such that each node contains an additional random pointer which could point to any node in the list or null.
+
+Return a **[deep copy](https://en.wikipedia.org/wiki/Object_copying#Deep_copy)** of the list.
+
+The Linked List is represented in the input/output as a list of `n` nodes. Each node is represented as a pair of `[val, random_index]` where:
+
+- `val`: an integer representing `Node.val`
+- `random_index`: the index of the node (range from `0` to `n-1`) where random pointer points to, or `null` if it does not point to any node.
+
+**Example 1:**
+
+
+
+```
+Input: head = [[7,null],[13,0],[11,4],[10,2],[1,0]]
+Output: [[7,null],[13,0],[11,4],[10,2],[1,0]]
+
+```
+
+**Example 2:**
+
+
+
+```
+Input: head = [[1,1],[2,1]]
+Output: [[1,1],[2,1]]
+
+```
+
+**Example 3:**
+
+
+
+```
+Input: head = [[3,null],[3,0],[3,null]]
+Output: [[3,null],[3,0],[3,null]]
+
+```
+
+**Example 4:**
+
+```
+Input: head = []
+Output: []
+Explanation: Given linked list is empty (null pointer), so return null.
+
+```
+
+**Constraints:**
+
+- `10000 <= Node.val <= 10000`
+- `Node.random` is null or pointing to a node in the linked list.
+- The number of nodes will not exceed 1000.
+
+## 题目大意
+
+给定一个链表，每个节点包含一个额外增加的随机指针，该指针可以指向链表中的任何节点或空节点。要求返回这个链表的 深拷贝。
+
+我们用一个由 n 个节点组成的链表来表示输入/输出中的链表。每个节点用一个 [val, random_index] 表示：
+
+- val：一个表示 Node.val 的整数。
+- random_index：随机指针指向的节点索引（范围从 0 到 n-1）；如果不指向任何节点，则为 null 。
+
+## 解题思路
+
+- 这道题严格意义上是数据结构题，根据给定的数据结构，对它进行深拷贝。
+- 先将每个节点都复制一份，放在它的 next 节点中。如此穿插的复制一份链表。
+
+ 
+
+ 再将穿插版的链表的 random 指针指向正确的位置。
+
+ 
+
+ 再将穿插版的链表的 next 指针指向正确的位置。最后分开这交织在一起的两个链表的头节点，即可分开 2 个链表。
+
+ 
+
+## 代码
+
+```go
+package leetcode
+
+// Node define
+type Node struct {
+ Val int
+ Next *Node
+ Random *Node
+}
+
+func copyRandomList(head *Node) *Node {
+ if head == nil {
+ return nil
+ }
+ tempHead := copyNodeToLinkedList(head)
+ return splitLinkedList(tempHead)
+}
+
+func splitLinkedList(head *Node) *Node {
+ cur := head
+ head = head.Next
+ for cur != nil && cur.Next != nil {
+ cur.Next, cur = cur.Next.Next, cur.Next
+ }
+ return head
+}
+
+func copyNodeToLinkedList(head *Node) *Node {
+ cur := head
+ for cur != nil {
+ node := &Node{
+ Val: cur.Val,
+ Next: cur.Next,
+ }
+ cur.Next, cur = node, cur.Next
+ }
+ cur = head
+ for cur != nil {
+ if cur.Random != nil {
+ cur.Next.Random = cur.Random.Next
+ }
+ cur = cur.Next.Next
+ }
+ return head
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0100~0199/0137.Single-Number-II/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0100~0199/0141.Linked-List-Cycle/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0100~0199/0141.Linked-List-Cycle.md b/website/content/ChapterFour/0100~0199/0141.Linked-List-Cycle.md
new file mode 100644
index 000000000..96c3310bd
--- /dev/null
+++ b/website/content/ChapterFour/0100~0199/0141.Linked-List-Cycle.md
@@ -0,0 +1,62 @@
+# [141. Linked List Cycle](https://leetcode.com/problems/linked-list-cycle/description/)
+
+## 题目
+
+Given a linked list, determine if it has a cycle in it.
+
+**Follow up**:
+Can you solve it without using extra space?
+
+
+
+## 题目大意
+
+判断链表是否有环，不能使用额外的空间。
+
+## 解题思路
+
+给 2 个指针，一个指针是另外一个指针的下一个指针。快指针一次走 2 格，慢指针一次走 1 格。如果存在环，那么前一个指针一定会经过若干圈之后追上慢的指针。
+
+## 代码
+
+```go
+
+package leetcode
+
+import (
+ "github.com/halfrost/leetcode-go/structures"
+)
+
+// ListNode define
+type ListNode = structures.ListNode
+
+/**
+ * Definition for singly-linked list.
+ * type ListNode struct {
+ * Val int
+ * Next *ListNode
+ * }
+ */
+
+func hasCycle(head *ListNode) bool {
+ fast := head
+ slow := head
+ for fast != nil && fast.Next != nil {
+ fast = fast.Next.Next
+ slow = slow.Next
+ if fast == slow {
+ return true
+ }
+ }
+ return false
+}
+
+
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0100~0199/0138.Copy-List-With-Random-Pointer/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0100~0199/0142.Linked-List-Cycle-II/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0142.Linked-List-Cycle-II.md b/website/content/ChapterFour/0100~0199/0142.Linked-List-Cycle-II.md
similarity index 87%
rename from website/content/ChapterFour/0142.Linked-List-Cycle-II.md
rename to website/content/ChapterFour/0100~0199/0142.Linked-List-Cycle-II.md
index f598045a2..3bd614255 100644
--- a/website/content/ChapterFour/0142.Linked-List-Cycle-II.md
+++ b/website/content/ChapterFour/0100~0199/0142.Linked-List-Cycle-II.md
@@ -106,4 +106,11 @@ func hasCycle142(head *ListNode) (bool, *ListNode) {
return false, nil
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0100~0199/0141.Linked-List-Cycle/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0100~0199/0143.Reorder-List/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0143.Reorder-List.md b/website/content/ChapterFour/0100~0199/0143.Reorder-List.md
similarity index 86%
rename from website/content/ChapterFour/0143.Reorder-List.md
rename to website/content/ChapterFour/0100~0199/0143.Reorder-List.md
index 9383f56ea..4e835246c 100644
--- a/website/content/ChapterFour/0143.Reorder-List.md
+++ b/website/content/ChapterFour/0100~0199/0143.Reorder-List.md
@@ -35,7 +35,7 @@ Given 1->2->3->4->5, reorder it to 1->5->2->4->3.
更好的做法是结合之前几道题的操作：链表逆序，找中间结点。
-先找到链表的中间结点，然后利用逆序区间的操作，如 [第 92 题](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0092.Reverse-Linked-List-II) 里的 reverseBetween() 操作，只不过这里的反转区间是从中点一直到末尾。最后利用 2 个指针，一个指向头结点，一个指向中间结点，开始拼接最终的结果。这种做法的时间复杂度是 O(n)，空间复杂度是 O(1)。
+先找到链表的中间结点，然后利用逆序区间的操作，如 [第 92 题](https://github.com/halfrost/leetcode-go/tree/master/leetcode/0092.Reverse-Linked-List-II) 里的 reverseBetween() 操作，只不过这里的反转区间是从中点一直到末尾。最后利用 2 个指针，一个指向头结点，一个指向中间结点，开始拼接最终的结果。这种做法的时间复杂度是 O(n)，空间复杂度是 O(1)。
## 代码
@@ -124,4 +124,11 @@ func listToArray(head *ListNode) []int {
return array
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0100~0199/0142.Linked-List-Cycle-II/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0100~0199/0144.Binary-Tree-Preorder-Traversal/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0144.Binary-Tree-Preorder-Traversal.md b/website/content/ChapterFour/0100~0199/0144.Binary-Tree-Preorder-Traversal.md
similarity index 82%
rename from website/content/ChapterFour/0144.Binary-Tree-Preorder-Traversal.md
rename to website/content/ChapterFour/0100~0199/0144.Binary-Tree-Preorder-Traversal.md
index 408ccb75d..36f8e02f2 100644
--- a/website/content/ChapterFour/0144.Binary-Tree-Preorder-Traversal.md
+++ b/website/content/ChapterFour/0100~0199/0144.Binary-Tree-Preorder-Traversal.md
@@ -109,4 +109,11 @@ func preorderTraversal2(root *TreeNode) []int {
return res
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0100~0199/0143.Reorder-List/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0100~0199/0145.Binary-Tree-Postorder-Traversal/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0100~0199/0145.Binary-Tree-Postorder-Traversal.md b/website/content/ChapterFour/0100~0199/0145.Binary-Tree-Postorder-Traversal.md
new file mode 100644
index 000000000..e688f82f1
--- /dev/null
+++ b/website/content/ChapterFour/0100~0199/0145.Binary-Tree-Postorder-Traversal.md
@@ -0,0 +1,78 @@
+# [145. Binary Tree Postorder Traversal](https://leetcode.com/problems/binary-tree-postorder-traversal/)
+
+## 题目
+
+
+Given a binary tree, return the postorder traversal of its nodes' values.
+
+
+
+**Example**:
+
+```
+
+Input: [1,null,2,3]
+ 1
+ \
+ 2
+ /
+ 3
+
+Output: [3,2,1]
+
+```
+
+
+**Follow up**: Recursive solution is trivial, could you do it iteratively?
+
+
+
+
+## 题目大意
+
+后根遍历一颗树。
+
+## 解题思路
+
+递归的实现方法，见代码。
+
+
+
+
+
+## 代码
+
+```go
+
+package leetcode
+
+/**
+ * Definition for a binary tree node.
+ * type TreeNode struct {
+ * Val int
+ * Left *TreeNode
+ * Right *TreeNode
+ * }
+ */
+func postorderTraversal(root *TreeNode) []int {
+ var result []int
+ postorder(root, &result)
+ return result
+}
+
+func postorder(root *TreeNode, output *[]int) {
+ if root != nil {
+ postorder(root.Left, output)
+ postorder(root.Right, output)
+ *output = append(*output, root.Val)
+ }
+}
+
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0100~0199/0144.Binary-Tree-Preorder-Traversal/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0100~0199/0146.LRU-Cache/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0100~0199/0146.LRU-Cache.md b/website/content/ChapterFour/0100~0199/0146.LRU-Cache.md
new file mode 100644
index 000000000..7c60b34f8
--- /dev/null
+++ b/website/content/ChapterFour/0100~0199/0146.LRU-Cache.md
@@ -0,0 +1,141 @@
+# [146. LRU Cache](https://leetcode.com/problems/lru-cache/)
+
+## 题目
+
+Design a data structure that follows the constraints of a **[Least Recently Used (LRU) cache](https://en.wikipedia.org/wiki/Cache_replacement_policies#LRU)**.
+
+Implement the `LRUCache` class:
+
+- `LRUCache(int capacity)` Initialize the LRU cache with **positive** size `capacity`.
+- `int get(int key)` Return the value of the `key` if the key exists, otherwise return `1`.
+- `void put(int key, int value)` Update the value of the `key` if the `key` exists. Otherwise, add the `key-value` pair to the cache. If the number of keys exceeds the `capacity` from this operation, **evict** the least recently used key.
+
+**Follow up**:Could you do `get` and `put` in `O(1)` time complexity?
+
+**Example 1**:
+
+```
+Input
+["LRUCache", "put", "put", "get", "put", "get", "put", "get", "get", "get"]
+[[2], [1, 1], [2, 2], [1], [3, 3], [2], [4, 4], [1], [3], [4]]
+Output
+[null, null, null, 1, null, -1, null, -1, 3, 4]
+
+Explanation
+LRUCache lRUCache = new LRUCache(2);
+lRUCache.put(1, 1); // cache is {1=1}
+lRUCache.put(2, 2); // cache is {1=1, 2=2}
+lRUCache.get(1); // return 1
+lRUCache.put(3, 3); // LRU key was 2, evicts key 2, cache is {1=1, 3=3}
+lRUCache.get(2); // returns -1 (not found)
+lRUCache.put(4, 4); // LRU key was 1, evicts key 1, cache is {4=4, 3=3}
+lRUCache.get(1); // return -1 (not found)
+lRUCache.get(3); // return 3
+lRUCache.get(4); // return 4
+
+```
+
+**Constraints**:
+
+- `1 <= capacity <= 3000`
+- `0 <= key <= 3000`
+- `0 <= value <= 104`
+- At most `3 * 104` calls will be made to `get` and `put`.
+
+## 题目大意
+
+运用你所掌握的数据结构，设计和实现一个 LRU (最近最少使用) 缓存机制 。
+实现 LRUCache 类：
+
+- LRUCache(int capacity) 以正整数作为容量 capacity 初始化 LRU 缓存
+- int get(int key) 如果关键字 key 存在于缓存中，则返回关键字的值，否则返回 -1 。
+- void put(int key, int value) 如果关键字已经存在，则变更其数据值；如果关键字不存在，则插入该组「关键字-值」。当缓存容量达到上限时，它应该在写入新数据之前删除最久未使用的数据值，从而为新的数据值留出空间。
+
+进阶：你是否可以在 O(1) 时间复杂度内完成这两种操作？
+
+## 解题思路
+
+- 这一题是 LRU 经典面试题，详细解释见第三章模板。
+
+## 代码
+
+```go
+package leetcode
+
+type LRUCache struct {
+ head, tail *Node
+ Keys map[int]*Node
+ Cap int
+}
+
+type Node struct {
+ Key, Val int
+ Prev, Next *Node
+}
+
+func Constructor(capacity int) LRUCache {
+ return LRUCache{Keys: make(map[int]*Node), Cap: capacity}
+}
+
+func (this *LRUCache) Get(key int) int {
+ if node, ok := this.Keys[key]; ok {
+ this.Remove(node)
+ this.Add(node)
+ return node.Val
+ }
+ return -1
+}
+
+func (this *LRUCache) Put(key int, value int) {
+ if node, ok := this.Keys[key]; ok {
+ node.Val = value
+ this.Remove(node)
+ this.Add(node)
+ return
+ } else {
+ node = &Node{Key: key, Val: value}
+ this.Keys[key] = node
+ this.Add(node)
+ }
+ if len(this.Keys) > this.Cap {
+ delete(this.Keys, this.tail.Key)
+ this.Remove(this.tail)
+ }
+}
+
+func (this *LRUCache) Add(node *Node) {
+ node.Prev = nil
+ node.Next = this.head
+ if this.head != nil {
+ this.head.Prev = node
+ }
+ this.head = node
+ if this.tail == nil {
+ this.tail = node
+ this.tail.Next = nil
+ }
+}
+
+func (this *LRUCache) Remove(node *Node) {
+ if node == this.head {
+ this.head = node.Next
+ node.Next = nil
+ return
+ }
+ if node == this.tail {
+ this.tail = node.Prev
+ node.Prev.Next = nil
+ node.Prev = nil
+ return
+ }
+ node.Prev.Next = node.Next
+ node.Next.Prev = node.Prev
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0100~0199/0145.Binary-Tree-Postorder-Traversal/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0100~0199/0147.Insertion-Sort-List/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0147.Insertion-Sort-List.md b/website/content/ChapterFour/0100~0199/0147.Insertion-Sort-List.md
similarity index 81%
rename from website/content/ChapterFour/0147.Insertion-Sort-List.md
rename to website/content/ChapterFour/0100~0199/0147.Insertion-Sort-List.md
index 80bedc458..5ef908560 100644
--- a/website/content/ChapterFour/0147.Insertion-Sort-List.md
+++ b/website/content/ChapterFour/0100~0199/0147.Insertion-Sort-List.md
@@ -74,4 +74,11 @@ func insertionSortList(head *ListNode) *ListNode {
return newHead.Next
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0100~0199/0146.LRU-Cache/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0100~0199/0148.Sort-List/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0100~0199/0148.Sort-List.md b/website/content/ChapterFour/0100~0199/0148.Sort-List.md
new file mode 100644
index 000000000..f92e2b858
--- /dev/null
+++ b/website/content/ChapterFour/0100~0199/0148.Sort-List.md
@@ -0,0 +1,103 @@
+# [148. Sort List](https://leetcode.com/problems/sort-list/)
+
+## 题目
+
+Sort a linked list in O(n log n) time using constant space complexity.
+
+**Example 1**:
+
+```
+
+Input: 4->2->1->3
+Output: 1->2->3->4
+
+```
+
+**Example 2**:
+
+```
+
+Input: -1->5->3->4->0
+Output: -1->0->3->4->5
+
+```
+
+## 题目大意
+
+链表的排序，要求时间复杂度必须是 O(n log n)，空间复杂度是 O(1)
+
+## 解题思路
+
+这道题只能用归并排序才能符合要求。归并排序需要的 2 个操作在其他题目已经出现过了，取中间点是第 876 题，合并 2 个有序链表是第 21 题。
+
+## 代码
+
+```go
+
+package leetcode
+
+/**
+ * Definition for singly-linked list.
+ * type ListNode struct {
+ * Val int
+ * Next *ListNode
+ * }
+ */
+func sortList(head *ListNode) *ListNode {
+ length := 0
+ cur := head
+ for cur != nil {
+ length++
+ cur = cur.Next
+ }
+ if length <= 1 {
+ return head
+ }
+
+ middleNode := middleNode(head)
+ cur = middleNode.Next
+ middleNode.Next = nil
+ middleNode = cur
+
+ left := sortList(head)
+ right := sortList(middleNode)
+ return mergeTwoLists(left, right)
+}
+
+func middleNode(head *ListNode) *ListNode {
+ if head == nil || head.Next == nil {
+ return head
+ }
+ p1 := head
+ p2 := head
+ for p2.Next != nil && p2.Next.Next != nil {
+ p1 = p1.Next
+ p2 = p2.Next.Next
+ }
+ return p1
+}
+
+func mergeTwoLists(l1 *ListNode, l2 *ListNode) *ListNode {
+ if l1 == nil {
+ return l2
+ }
+ if l2 == nil {
+ return l1
+ }
+ if l1.Val < l2.Val {
+ l1.Next = mergeTwoLists(l1.Next, l2)
+ return l1
+ }
+ l2.Next = mergeTwoLists(l1, l2.Next)
+ return l2
+}
+
+
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0100~0199/0147.Insertion-Sort-List/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0100~0199/0150.Evaluate-Reverse-Polish-Notation/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0100~0199/0150.Evaluate-Reverse-Polish-Notation.md b/website/content/ChapterFour/0100~0199/0150.Evaluate-Reverse-Polish-Notation.md
new file mode 100644
index 000000000..0e4614d5a
--- /dev/null
+++ b/website/content/ChapterFour/0100~0199/0150.Evaluate-Reverse-Polish-Notation.md
@@ -0,0 +1,99 @@
+# [150. Evaluate Reverse Polish Notation](https://leetcode.com/problems/evaluate-reverse-polish-notation/)
+
+## 题目
+
+Evaluate the value of an arithmetic expression in Reverse Polish Notation.
+
+Valid operators are +, -, *, /. Each operand may be an integer or another expression.
+
+**Note**:
+
+- Division between two integers should truncate toward zero.
+- The given RPN expression is always valid. That means the expression would always evaluate to a result and there won't be any divide by zero operation.
+
+**Example 1**:
+
+```
+
+Input: ["2", "1", "+", "3", "*"]
+Output: 9
+Explanation: ((2 + 1) * 3) = 9
+
+```
+
+**Example 2**:
+
+```
+
+Input: ["4", "13", "5", "/", "+"]
+Output: 6
+Explanation: (4 + (13 / 5)) = 6
+
+```
+**Example 3**:
+
+```
+
+Input: ["10", "6", "9", "3", "+", "-11", "*", "/", "*", "17", "+", "5", "+"]
+Output: 22
+Explanation:
+ ((10 * (6 / ((9 + 3) * -11))) + 17) + 5
+= ((10 * (6 / (12 * -11))) + 17) + 5
+= ((10 * (6 / -132)) + 17) + 5
+= ((10 * 0) + 17) + 5
+= (0 + 17) + 5
+= 17 + 5
+= 22
+
+```
+
+## 题目大意
+
+计算逆波兰表达式。
+
+## 解题思路
+
+这道题就是经典的考察栈的知识的题目。
+
+## 代码
+
+```go
+
+package leetcode
+
+import (
+ "strconv"
+)
+
+func evalRPN(tokens []string) int {
+ stack := make([]int, 0, len(tokens))
+ for _, token := range tokens {
+ v, err := strconv.Atoi(token)
+ if err == nil {
+ stack = append(stack, v)
+ } else {
+ num1, num2 := stack[len(stack)-2], stack[len(stack)-1]
+ stack = stack[:len(stack)-2]
+ switch token {
+ case "+":
+ stack = append(stack, num1+num2)
+ case "-":
+ stack = append(stack, num1-num2)
+ case "*":
+ stack = append(stack, num1*num2)
+ case "/":
+ stack = append(stack, num1/num2)
+ }
+ }
+ }
+ return stack[0]
+}
+
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0100~0199/0148.Sort-List/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0100~0199/0151.Reverse-Words-in-a-String/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0151.Reverse-Words-in-a-String.md b/website/content/ChapterFour/0100~0199/0151.Reverse-Words-in-a-String.md
similarity index 83%
rename from website/content/ChapterFour/0151.Reverse-Words-in-a-String.md
rename to website/content/ChapterFour/0100~0199/0151.Reverse-Words-in-a-String.md
index e7d47d727..cb2545f17 100755
--- a/website/content/ChapterFour/0151.Reverse-Words-in-a-String.md
+++ b/website/content/ChapterFour/0100~0199/0151.Reverse-Words-in-a-String.md
@@ -79,4 +79,11 @@ func reverse151(m *[]string, i int, j int) {
}
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0100~0199/0150.Evaluate-Reverse-Polish-Notation/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0100~0199/0152.Maximum-Product-Subarray/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0152.Maximum-Product-Subarray.md b/website/content/ChapterFour/0100~0199/0152.Maximum-Product-Subarray.md
similarity index 78%
rename from website/content/ChapterFour/0152.Maximum-Product-Subarray.md
rename to website/content/ChapterFour/0100~0199/0152.Maximum-Product-Subarray.md
index a09a12968..852c8b8a2 100755
--- a/website/content/ChapterFour/0152.Maximum-Product-Subarray.md
+++ b/website/content/ChapterFour/0100~0199/0152.Maximum-Product-Subarray.md
@@ -49,4 +49,11 @@ func maxProduct(nums []int) int {
return res
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0100~0199/0151.Reverse-Words-in-a-String/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0100~0199/0153.Find-Minimum-in-Rotated-Sorted-Array/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0153.Find-Minimum-in-Rotated-Sorted-Array.md b/website/content/ChapterFour/0100~0199/0153.Find-Minimum-in-Rotated-Sorted-Array.md
similarity index 86%
rename from website/content/ChapterFour/0153.Find-Minimum-in-Rotated-Sorted-Array.md
rename to website/content/ChapterFour/0100~0199/0153.Find-Minimum-in-Rotated-Sorted-Array.md
index b2a6d6e6b..c48a82ae8 100755
--- a/website/content/ChapterFour/0153.Find-Minimum-in-Rotated-Sorted-Array.md
+++ b/website/content/ChapterFour/0100~0199/0153.Find-Minimum-in-Rotated-Sorted-Array.md
@@ -105,4 +105,11 @@ func findMin2(nums []int) int {
return min
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0100~0199/0152.Maximum-Product-Subarray/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0100~0199/0154.Find-Minimum-in-Rotated-Sorted-Array-II/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0154.Find-Minimum-in-Rotated-Sorted-Array-II.md b/website/content/ChapterFour/0100~0199/0154.Find-Minimum-in-Rotated-Sorted-Array-II.md
similarity index 82%
rename from website/content/ChapterFour/0154.Find-Minimum-in-Rotated-Sorted-Array-II.md
rename to website/content/ChapterFour/0100~0199/0154.Find-Minimum-in-Rotated-Sorted-Array-II.md
index 4ddfaa71a..7d2c1235f 100755
--- a/website/content/ChapterFour/0154.Find-Minimum-in-Rotated-Sorted-Array-II.md
+++ b/website/content/ChapterFour/0100~0199/0154.Find-Minimum-in-Rotated-Sorted-Array-II.md
@@ -64,4 +64,11 @@ func findMin154(nums []int) int {
return nums[low]
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0100~0199/0153.Find-Minimum-in-Rotated-Sorted-Array/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0100~0199/0155.Min-Stack/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0155.Min-Stack.md b/website/content/ChapterFour/0100~0199/0155.Min-Stack.md
similarity index 79%
rename from website/content/ChapterFour/0155.Min-Stack.md
rename to website/content/ChapterFour/0100~0199/0155.Min-Stack.md
index 5d811c4e4..606f65003 100644
--- a/website/content/ChapterFour/0155.Min-Stack.md
+++ b/website/content/ChapterFour/0100~0199/0155.Min-Stack.md
@@ -84,4 +84,11 @@ func (this *MinStack) GetMin() int {
return this.min[this.l-1]
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0100~0199/0154.Find-Minimum-in-Rotated-Sorted-Array-II/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0100~0199/0160.Intersection-of-Two-Linked-Lists/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0160.Intersection-of-Two-Linked-Lists.md b/website/content/ChapterFour/0100~0199/0160.Intersection-of-Two-Linked-Lists.md
similarity index 89%
rename from website/content/ChapterFour/0160.Intersection-of-Two-Linked-Lists.md
rename to website/content/ChapterFour/0100~0199/0160.Intersection-of-Two-Linked-Lists.md
index 6a450ebac..77ea4b624 100644
--- a/website/content/ChapterFour/0160.Intersection-of-Two-Linked-Lists.md
+++ b/website/content/ChapterFour/0100~0199/0160.Intersection-of-Two-Linked-Lists.md
@@ -113,4 +113,11 @@ func getIntersectionNode(headA, headB *ListNode) *ListNode {
return a
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0100~0199/0155.Min-Stack/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0100~0199/0162.Find-Peak-Element/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0162.Find-Peak-Element.md b/website/content/ChapterFour/0100~0199/0162.Find-Peak-Element.md
similarity index 87%
rename from website/content/ChapterFour/0162.Find-Peak-Element.md
rename to website/content/ChapterFour/0100~0199/0162.Find-Peak-Element.md
index 2b69dbdbe..1c3e810fe 100755
--- a/website/content/ChapterFour/0162.Find-Peak-Element.md
+++ b/website/content/ChapterFour/0100~0199/0162.Find-Peak-Element.md
@@ -91,4 +91,11 @@ func findPeakElement1(nums []int) int {
return low
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0100~0199/0160.Intersection-of-Two-Linked-Lists/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0100~0199/0164.Maximum-Gap/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0164.Maximum-Gap.md b/website/content/ChapterFour/0100~0199/0164.Maximum-Gap.md
similarity index 82%
rename from website/content/ChapterFour/0164.Maximum-Gap.md
rename to website/content/ChapterFour/0100~0199/0164.Maximum-Gap.md
index e1579e679..f5ff4d4aa 100644
--- a/website/content/ChapterFour/0164.Maximum-Gap.md
+++ b/website/content/ChapterFour/0100~0199/0164.Maximum-Gap.md
@@ -51,13 +51,12 @@ Explanation: The array contains less than 2 elements, therefore return 0.
package leetcode
-// 解法一
+// 解法一 快排
func maximumGap(nums []int) int {
if len(nums) < 2 {
return 0
}
quickSort164(nums, 0, len(nums)-1)
-
res := 0
for i := 0; i < len(nums)-1; i++ {
if (nums[i+1] - nums[i]) > res {
@@ -88,53 +87,58 @@ func quickSort164(a []int, lo, hi int) {
quickSort164(a, p+1, hi)
}
-// 解法二
+// 解法二 基数排序
func maximumGap1(nums []int) int {
-
if nums == nil || len(nums) < 2 {
return 0
}
-
// m is the maximal number in nums
m := nums[0]
for i := 1; i < len(nums); i++ {
m = max(m, nums[i])
}
-
exp := 1 // 1, 10, 100, 1000 ...
R := 10 // 10 digits
-
aux := make([]int, len(nums))
-
for (m / exp) > 0 { // Go through all digits from LSB to MSB
count := make([]int, R)
-
for i := 0; i < len(nums); i++ {
count[(nums[i]/exp)%10]++
}
-
for i := 1; i < len(count); i++ {
count[i] += count[i-1]
}
-
for i := len(nums) - 1; i >= 0; i-- {
tmp := count[(nums[i]/exp)%10]
tmp--
aux[tmp] = nums[i]
+ count[(nums[i]/exp)%10] = tmp
}
-
for i := 0; i < len(nums); i++ {
nums[i] = aux[i]
}
exp *= 10
}
-
maxValue := 0
for i := 1; i < len(aux); i++ {
maxValue = max(maxValue, aux[i]-aux[i-1])
}
-
return maxValue
}
-```
\ No newline at end of file
+func max(a int, b int) int {
+ if a > b {
+ return a
+ }
+ return b
+}
+
+
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0100~0199/0162.Find-Peak-Element/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0100~0199/0167.Two-Sum-II-Input-array-is-sorted/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0100~0199/0167.Two-Sum-II-Input-array-is-sorted.md b/website/content/ChapterFour/0100~0199/0167.Two-Sum-II-Input-array-is-sorted.md
new file mode 100644
index 000000000..18fd28620
--- /dev/null
+++ b/website/content/ChapterFour/0100~0199/0167.Two-Sum-II-Input-array-is-sorted.md
@@ -0,0 +1,76 @@
+# [167. Two Sum II - Input array is sorted](https://leetcode.com/problems/two-sum-ii-input-array-is-sorted/)
+
+## 题目
+
+Given an array of integers that is already sorted in ascending order, find two numbers such that they add up to a specific target number.
+
+The function twoSum should return indices of the two numbers such that they add up to the target, where index1 must be less than index2.
+
+**Note**:
+
+- Your returned answers (both index1 and index2) are not zero-based.
+- You may assume that each input would have exactly one solution and you may not use the same element twice.
+
+**Example**:
+
+```
+
+Input: numbers = [2,7,11,15], target = 9
+Output: [1,2]
+Explanation: The sum of 2 and 7 is 9. Therefore index1 = 1, index2 = 2.
+
+```
+
+## 题目大意
+
+找出两个数之和等于 target 的两个数字，要求输出它们的下标。注意一个数字不能使用 2 次。下标从小到大输出。假定题目一定有一个解。
+
+## 解题思路
+
+这一题比第 1 题 Two Sum 的问题还要简单，因为这里数组是有序的。可以直接用第一题的解法解决这道题。
+
+
+
+## 代码
+
+```go
+
+package leetcode
+
+// 解法一 这一题可以利用数组有序的特性
+func twoSum167(numbers []int, target int) []int {
+ i, j := 0, len(numbers)-1
+ for i < j {
+ if numbers[i]+numbers[j] == target {
+ return []int{i + 1, j + 1}
+ }
+ if numbers[i]+numbers[j] < target {
+ i++
+ } else {
+ j--
+ }
+ }
+ return nil
+}
+
+// 解法二 不管数组是否有序，空间复杂度比上一种解法要多 O(n)
+func twoSum167_1(numbers []int, target int) []int {
+ m := make(map[int]int)
+ for i := 0; i < len(numbers); i++ {
+ another := target - numbers[i]
+ if idx, ok := m[another]; ok {
+ return []int{idx + 1, i + 1}
+ }
+ m[numbers[i]] = i
+ }
+ return nil
+}
+
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0100~0199/0164.Maximum-Gap/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0100~0199/0168.Excel-Sheet-Column-Title/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0100~0199/0168.Excel-Sheet-Column-Title.md b/website/content/ChapterFour/0100~0199/0168.Excel-Sheet-Column-Title.md
new file mode 100644
index 000000000..6cfe377e7
--- /dev/null
+++ b/website/content/ChapterFour/0100~0199/0168.Excel-Sheet-Column-Title.md
@@ -0,0 +1,87 @@
+# [168. Excel Sheet Column Title](https://leetcode.com/problems/excel-sheet-column-title/)
+
+## 题目
+
+Given a positive integer, return its corresponding column title as appear in an Excel sheet.
+
+For example:
+
+```
+ 1 -> A
+ 2 -> B
+ 3 -> C
+ ...
+ 26 -> Z
+ 27 -> AA
+ 28 -> AB
+ ...
+```
+
+**Example 1**:
+
+```
+Input: 1
+Output: "A"
+```
+
+**Example 2**:
+
+```
+Input: 28
+Output: "AB"
+```
+
+**Example 3**:
+
+```
+Input: 701
+Output: "ZY"
+```
+
+## 题目大意
+
+给定一个正整数，返回它在 Excel 表中相对应的列名称。
+
+例如，
+
+ 1 -> A
+ 2 -> B
+ 3 -> C
+ ...
+ 26 -> Z
+ 27 -> AA
+ 28 -> AB
+ ...
+
+
+## 解题思路
+
+- 给定一个正整数，返回它在 Excel 表中的对应的列名称
+- 简单题。这一题就类似短除法的计算过程。以 26 进制的字母编码。按照短除法先除，然后余数逆序输出即可。
+
+## 代码
+
+```go
+
+package leetcode
+
+func convertToTitle(n int) string {
+ result := []byte{}
+ for n > 0 {
+ result = append(result, 'A'+byte((n-1)%26))
+ n = (n - 1) / 26
+ }
+ for i, j := 0, len(result)-1; i < j; i, j = i+1, j-1 {
+ result[i], result[j] = result[j], result[i]
+ }
+ return string(result)
+}
+
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0100~0199/0167.Two-Sum-II-Input-array-is-sorted/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0100~0199/0169.Majority-Element/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0169.Majority-Element.md b/website/content/ChapterFour/0100~0199/0169.Majority-Element.md
similarity index 79%
rename from website/content/ChapterFour/0169.Majority-Element.md
rename to website/content/ChapterFour/0100~0199/0169.Majority-Element.md
index 548fb3ed3..7c24db72a 100755
--- a/website/content/ChapterFour/0169.Majority-Element.md
+++ b/website/content/ChapterFour/0100~0199/0169.Majority-Element.md
@@ -63,4 +63,12 @@ func majorityElement1(nums []int) int {
return 0
}
-```
\ No newline at end of file
+
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0100~0199/0168.Excel-Sheet-Column-Title/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0100~0199/0171.Excel-Sheet-Column-Number/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0100~0199/0171.Excel-Sheet-Column-Number.md b/website/content/ChapterFour/0100~0199/0171.Excel-Sheet-Column-Number.md
new file mode 100644
index 000000000..06ec111e0
--- /dev/null
+++ b/website/content/ChapterFour/0100~0199/0171.Excel-Sheet-Column-Number.md
@@ -0,0 +1,74 @@
+# [171. Excel Sheet Column Number](https://leetcode.com/problems/excel-sheet-column-number/)
+
+
+## 题目
+
+Given a column title as appear in an Excel sheet, return its corresponding column number.
+
+For example:
+
+```
+ A -> 1
+ B -> 2
+ C -> 3
+ ...
+ Z -> 26
+ AA -> 27
+ AB -> 28
+ ...
+```
+
+**Example 1**:
+
+```
+Input: "A"
+Output: 1
+```
+
+**Example 2**:
+
+```
+Input: "AB"
+Output: 28
+```
+
+**Example 3**:
+
+```
+Input: "ZY"
+Output: 701
+```
+
+## 题目大意
+
+给定一个 Excel 表格中的列名称，返回其相应的列序号。
+
+
+## 解题思路
+
+- 给出 Excel 中列的名称，输出其对应的列序号。
+- 简单题。这一题是第 168 题的逆序题。按照 26 进制还原成十进制即可。
+
+## 代码
+
+```go
+
+package leetcode
+
+func titleToNumber(s string) int {
+ val, res := 0, 0
+ for i := 0; i < len(s); i++ {
+ val = int(s[i] - 'A' + 1)
+ res = res*26 + val
+ }
+ return res
+}
+
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0100~0199/0169.Majority-Element/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0100~0199/0172.Factorial-Trailing-Zeroes/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0172.Factorial-Trailing-Zeroes.md b/website/content/ChapterFour/0100~0199/0172.Factorial-Trailing-Zeroes.md
similarity index 80%
rename from website/content/ChapterFour/0172.Factorial-Trailing-Zeroes.md
rename to website/content/ChapterFour/0100~0199/0172.Factorial-Trailing-Zeroes.md
index 4c6db6329..4ac18a762 100755
--- a/website/content/ChapterFour/0172.Factorial-Trailing-Zeroes.md
+++ b/website/content/ChapterFour/0100~0199/0172.Factorial-Trailing-Zeroes.md
@@ -48,4 +48,11 @@ func trailingZeroes(n int) int {
return n/5 + trailingZeroes(n/5)
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0100~0199/0171.Excel-Sheet-Column-Number/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0100~0199/0173.Binary-Search-Tree-Iterator/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0173.Binary-Search-Tree-Iterator.md b/website/content/ChapterFour/0100~0199/0173.Binary-Search-Tree-Iterator.md
similarity index 79%
rename from website/content/ChapterFour/0173.Binary-Search-Tree-Iterator.md
rename to website/content/ChapterFour/0100~0199/0173.Binary-Search-Tree-Iterator.md
index 8521ef5b5..559f61217 100755
--- a/website/content/ChapterFour/0173.Binary-Search-Tree-Iterator.md
+++ b/website/content/ChapterFour/0100~0199/0173.Binary-Search-Tree-Iterator.md
@@ -44,7 +44,14 @@ Calling `next()` will return the next smallest number in the BST.
package leetcode
-import "container/heap"
+import (
+ "container/heap"
+
+ "github.com/halfrost/leetcode-go/structures"
+)
+
+// TreeNode define
+type TreeNode = structures.TreeNode
/**
* Definition for a binary tree node.
@@ -72,6 +79,14 @@ func Constructor173(root *TreeNode) BSTIterator {
return bs
}
+func postorder(root *TreeNode, output *[]int) {
+ if root != nil {
+ postorder(root.Left, output)
+ postorder(root.Right, output)
+ *output = append(*output, root.Val)
+ }
+}
+
/** @return the next smallest number */
func (this *BSTIterator) Next() int {
this.count--
@@ -115,4 +130,11 @@ func (pq *PriorityQueueOfInt) Pop() interface{} {
return item
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0100~0199/0172.Factorial-Trailing-Zeroes/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0100~0199/0174.Dungeon-Game/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0174.Dungeon-Game.md b/website/content/ChapterFour/0100~0199/0174.Dungeon-Game.md
similarity index 88%
rename from website/content/ChapterFour/0174.Dungeon-Game.md
rename to website/content/ChapterFour/0100~0199/0174.Dungeon-Game.md
index d95cc1acb..30df3397c 100755
--- a/website/content/ChapterFour/0174.Dungeon-Game.md
+++ b/website/content/ChapterFour/0100~0199/0174.Dungeon-Game.md
@@ -41,9 +41,20 @@ For example, given the dungeon below, the initial health of the knight must be a
## 解题思路
- 在二维地图上给出每个格子扣血数，负数代表扣血，正数代表补血。左上角第一个格子是起点，右下角最后一个格子是终点。问骑士初始最少多少血才能走完迷宫，顺利营救位于终点的公主。需要注意的是，起点和终点都会对血量进行影响。每到一个格子，骑士的血都不能少于 1，一旦少于 1 点血，骑士就会死去。
-- 这一题首先想到的解题思路是动态规划。从终点逆推回起点。`dp[i][j]` 代表骑士进入坐标为 `(i,j)` 的格子之前最少的血量值。 那么 `dp[m-1][n-1]` 应该同时满足两个条件，`dp[m-1][n-1] + dungeon[m-1][n-1] ≥ 1` 并且 `dp[m-1][n-1] ≥ 1`，由于这两个不等式的方向是相同的，取交集以后，起决定作用的是数轴最右边的数，即 `max(1-dungeon[m-1][n-1] , 1)`。算出 `dp[m-1][n-1]` 以后，接着可以推出 `dp[m-1][i]` 这一行和 `dp[i][n-1]` 这一列的值。因为骑士只能往右走和往下走。往回推，即只能往上走和往左走。到这里，DP 的初始条件都准备好了。那么状态转移方程是什么呢？分析一般的情况，`dp[i][j]` 这个值应该是和 `dp[i+1][j]` 和 `dp[i][j+1]` 这两者有关系。即 `dp[i][j]` 经过自己本格子的扣血以后，要能至少满足下一行和右一列格子血量的最少要求。并且自己的血量也应该 `≥1`。即需要满足下面这两组不等式。
- 
- 
+- 这一题首先想到的解题思路是动态规划。从终点逆推回起点。`dp[i][j]` 代表骑士进入坐标为 `(i,j)` 的格子之前最少的血量值。 那么 `dp[m-1][n-1]` 应该同时满足两个条件，`dp[m-1][n-1] + dungeon[m-1][n-1] ≥ 1` 并且 `dp[m-1][n-1] ≥ 1`，由于这两个不等式的方向是相同的，取交集以后，起决定作用的是数轴最右边的数，即 `max(1-dungeon[m-1][n-1] , 1)`。算出 `dp[m-1][n-1]` 以后，接着可以推出 `dp[m-1][i]` 这一行和 `dp[i][n-1]` 这一列的值。因为骑士只能往右走和往下走。往回推，即只能往上走和往左走。到这里，DP 的初始条件都准备好了。那么状态转移方程是什么呢？分析一般的情况，`dp[i][j]` 这个值应该是和 `dp[i+1][j]` 和 `dp[i][j+1]` 这两者有关系。即 `dp[i][j]` 经过自己本格子的扣血以后，要能至少满足下一行和右一列格子血量的最少要求。并且自己的血量也应该 `≥1`。即需要满足下面这两组不等式。
+
+ {{< katex display >}}
+ \begin{matrix} \left\{
+ \begin{array}{lr}
+ dp[i][j] + dungeon[i][j] \geqslant dp[i+1][j] \\
+ dp[i][j] \geqslant 1
+ \end{array} \right.
+ \end{matrix}
+ {{< /katex >}}
+
+ {{< katex display >}}
+ \begin{matrix} \left\{ \begin{array}{lr} dp[i][j] + dungeon[i][j] \geqslant dp[i][j+1] \\ dp[i][j] \geqslant 1 \end{array} \right. \end{matrix}
+ {{< /katex >}}
上面不等式中第一组不等式是满足下一行格子的最低血量要求，第二组不等式是满足右一列格子的最低血量要求。第一个式子化简即 `dp[i][j] = max(1, dp[i+1][j]-dungeon[i][j])`，第二个式子化简即 `dp[i][j] = max(1, dp[i][j+1]-dungeon[i][j])`。求得了这两种走法的最低血量值，从这两个值里面取最小，即是当前格子所需的最低血量，所以状态转移方程为 `dp[i][j] = min(max(1, dp[i][j+1]-dungeon[i][j]), max(1, dp[i+1][j]-dungeon[i][j]))`。DP 完成以后，`dp[0][0]` 中记录的就是骑士初始最低血量值。时间复杂度 O(m\*n)，空间复杂度 O(m\*n)。
- 这一题还可以用二分搜索来求解。骑士的血量取值范围一定是在 `[1，+∞)` 这个区间内。那么二分这个区间，每次二分的中间值，再用 dp 在地图中去判断是否能到达终点，如果能，就缩小搜索空间至 `[1，mid]`，否则搜索空间为 `[mid + 1，+∞)` 。时间复杂度 O(m\*n\* log math.MaxInt64)，空间复杂度 O(m\*n)。
@@ -121,4 +132,11 @@ func canCross(dungeon [][]int, start int) bool {
return dp[m-1][n-1] > 0
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0100~0199/0173.Binary-Search-Tree-Iterator/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0100~0199/0179.Largest-Number/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0179.Largest-Number.md b/website/content/ChapterFour/0100~0199/0179.Largest-Number.md
similarity index 86%
rename from website/content/ChapterFour/0179.Largest-Number.md
rename to website/content/ChapterFour/0100~0199/0179.Largest-Number.md
index de1677858..09f1a0708 100644
--- a/website/content/ChapterFour/0179.Largest-Number.md
+++ b/website/content/ChapterFour/0100~0199/0179.Largest-Number.md
@@ -119,4 +119,11 @@ func quickSortString(a []string, lo, hi int) {
quickSortString(a, p+1, hi)
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0100~0199/0174.Dungeon-Game/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0100~0199/0187.Repeated-DNA-Sequences/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0187.Repeated-DNA-Sequences.md b/website/content/ChapterFour/0100~0199/0187.Repeated-DNA-Sequences.md
similarity index 86%
rename from website/content/ChapterFour/0187.Repeated-DNA-Sequences.md
rename to website/content/ChapterFour/0100~0199/0187.Repeated-DNA-Sequences.md
index 5f917e03e..5480f7a72 100755
--- a/website/content/ChapterFour/0187.Repeated-DNA-Sequences.md
+++ b/website/content/ChapterFour/0100~0199/0187.Repeated-DNA-Sequences.md
@@ -68,4 +68,11 @@ func findRepeatedDnaSequences1(s string) []string {
return ans
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0100~0199/0179.Largest-Number/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0100~0199/0189.Rotate-Array/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0100~0199/0189.Rotate-Array.md b/website/content/ChapterFour/0100~0199/0189.Rotate-Array.md
new file mode 100644
index 000000000..34733ee96
--- /dev/null
+++ b/website/content/ChapterFour/0100~0199/0189.Rotate-Array.md
@@ -0,0 +1,82 @@
+# [189. Rotate Array](https://leetcode.com/problems/rotate-array/)
+
+## 题目
+
+Given an array, rotate the array to the right by *k* steps, where *k* is non-negative.
+
+**Follow up**:
+
+- Try to come up as many solutions as you can, there are at least 3 different ways to solve this problem.
+- Could you do it in-place with O(1) extra space?
+
+**Example 1**:
+
+```
+Input: nums = [1,2,3,4,5,6,7], k = 3
+Output: [5,6,7,1,2,3,4]
+Explanation:
+rotate 1 steps to the right: [7,1,2,3,4,5,6]
+rotate 2 steps to the right: [6,7,1,2,3,4,5]
+rotate 3 steps to the right: [5,6,7,1,2,3,4]
+```
+
+**Example 2**:
+
+```
+Input: nums = [-1,-100,3,99], k = 2
+Output: [3,99,-1,-100]
+Explanation:
+rotate 1 steps to the right: [99,-1,-100,3]
+rotate 2 steps to the right: [3,99,-1,-100]
+```
+
+**Constraints**:
+
+- `1 <= nums.length <= 2 * 10^4`
+- `-2^31 <= nums[i] <= 2^31 - 1`
+- `0 <= k <= 10^5`
+
+## 题目大意
+
+给定一个数组，将数组中的元素向右移动 k 个位置，其中 k 是非负数。
+
+## 解题思路
+
+- 解法二，使用一个额外的数组，先将原数组下标为 i 的元素移动到 `(i+k) mod n` 的位置，再将剩下的元素拷贝回来即可。
+- 解法一，由于题目要求不能使用额外的空间，所以本题最佳解法不是解法二。翻转最终态是，末尾 `k mod n` 个元素移动至了数组头部，剩下的元素右移 `k mod n` 个位置至最尾部。确定了最终态以后再变换就很容易。先将数组中所有元素从头到尾翻转一次，尾部的所有元素都到了头部，然后再将 `[0,(k mod n) − 1]` 区间内的元素翻转一次，最后再将 `[k mod n, n − 1]` 区间内的元素翻转一次，即可满足题目要求。
+
+## 代码
+
+```go
+package leetcode
+
+// 解法一 时间复杂度 O(n)，空间复杂度 O(1)
+func rotate(nums []int, k int) {
+ k %= len(nums)
+ reverse(nums)
+ reverse(nums[:k])
+ reverse(nums[k:])
+}
+
+func reverse(a []int) {
+ for i, n := 0, len(a); i < n/2; i++ {
+ a[i], a[n-1-i] = a[n-1-i], a[i]
+ }
+}
+
+// 解法二 时间复杂度 O(n)，空间复杂度 O(n)
+func rotate1(nums []int, k int) {
+ newNums := make([]int, len(nums))
+ for i, v := range nums {
+ newNums[(i+k)%len(nums)] = v
+ }
+ copy(nums, newNums)
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0100~0199/0187.Repeated-DNA-Sequences/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0100~0199/0190.Reverse-Bits/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0190.Reverse-Bits.md b/website/content/ChapterFour/0100~0199/0190.Reverse-Bits.md
similarity index 86%
rename from website/content/ChapterFour/0190.Reverse-Bits.md
rename to website/content/ChapterFour/0100~0199/0190.Reverse-Bits.md
index 47b9b939b..d73e2f2f1 100755
--- a/website/content/ChapterFour/0190.Reverse-Bits.md
+++ b/website/content/ChapterFour/0100~0199/0190.Reverse-Bits.md
@@ -50,4 +50,11 @@ func reverseBits(num uint32) uint32 {
return res
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0100~0199/0189.Rotate-Array/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0100~0199/0191.Number-of-1-Bits/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0191.Number-of-1-Bits.md b/website/content/ChapterFour/0100~0199/0191.Number-of-1-Bits.md
similarity index 85%
rename from website/content/ChapterFour/0191.Number-of-1-Bits.md
rename to website/content/ChapterFour/0100~0199/0191.Number-of-1-Bits.md
index 2723d2a03..d3a45e1d3 100755
--- a/website/content/ChapterFour/0191.Number-of-1-Bits.md
+++ b/website/content/ChapterFour/0100~0199/0191.Number-of-1-Bits.md
@@ -62,4 +62,11 @@ func hammingWeight1(num uint32) int {
return count
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0100~0199/0190.Reverse-Bits/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0100~0199/0198.House-Robber/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0198.House-Robber.md b/website/content/ChapterFour/0100~0199/0198.House-Robber.md
similarity index 88%
rename from website/content/ChapterFour/0198.House-Robber.md
rename to website/content/ChapterFour/0100~0199/0198.House-Robber.md
index 4ad33a623..2ee3a7a18 100755
--- a/website/content/ChapterFour/0198.House-Robber.md
+++ b/website/content/ChapterFour/0100~0199/0198.House-Robber.md
@@ -91,4 +91,11 @@ func rob(nums []int) int {
return max(a, b)
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0100~0199/0191.Number-of-1-Bits/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0100~0199/0199.Binary-Tree-Right-Side-View/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0100~0199/0199.Binary-Tree-Right-Side-View.md b/website/content/ChapterFour/0100~0199/0199.Binary-Tree-Right-Side-View.md
new file mode 100644
index 000000000..70be59786
--- /dev/null
+++ b/website/content/ChapterFour/0100~0199/0199.Binary-Tree-Right-Side-View.md
@@ -0,0 +1,81 @@
+# [199. Binary Tree Right Side View](https://leetcode.com/problems/binary-tree-right-side-view/)
+
+## 题目
+
+Given a binary tree, imagine yourself standing on the right side of it, return the values of the nodes you can see ordered from top to bottom.
+
+**Example**:
+
+```
+
+Input: [1,2,3,null,5,null,4]
+Output: [1, 3, 4]
+Explanation:
+
+ 1 <---
+ / \
+2 3 <---
+ \ \
+ 5 4 <---
+
+```
+
+
+
+## 题目大意
+
+从右边看一个树，输出看到的数字。注意有遮挡。
+
+
+## 解题思路
+
+- 这一题是按层序遍历的变种题。按照层序把每层的元素都遍历出来，然后依次取每一层的最右边的元素即可。用一个队列即可实现。
+- 第 102 题和第 107 题都是按层序遍历的。
+
+
+
+
+## 代码
+
+```go
+
+package leetcode
+
+/**
+ * Definition for a binary tree node.
+ * type TreeNode struct {
+ * Val int
+ * Left *TreeNode
+ * Right *TreeNode
+ * }
+ */
+func rightSideView(root *TreeNode) []int {
+ res := []int{}
+ if root == nil {
+ return res
+ }
+ queue := []*TreeNode{root}
+ for len(queue) > 0 {
+ n := len(queue)
+ for i := 0; i < n; i++ {
+ if queue[i].Left != nil {
+ queue = append(queue, queue[i].Left)
+ }
+ if queue[i].Right != nil {
+ queue = append(queue, queue[i].Right)
+ }
+ }
+ res = append(res, queue[n-1].Val)
+ queue = queue[n:]
+ }
+ return res
+}
+
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0100~0199/0198.House-Robber/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0200~0299/0200.Number-of-Islands/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0100~0199/_index.md b/website/content/ChapterFour/0100~0199/_index.md
new file mode 100644
index 000000000..d2021683f
--- /dev/null
+++ b/website/content/ChapterFour/0100~0199/_index.md
@@ -0,0 +1,5 @@
+---
+bookCollapseSection: true
+weight: 20
+---
+
diff --git a/website/content/ChapterFour/0101.Symmetric-Tree.md b/website/content/ChapterFour/0101.Symmetric-Tree.md
deleted file mode 100644
index b3f2ea189..000000000
--- a/website/content/ChapterFour/0101.Symmetric-Tree.md
+++ /dev/null
@@ -1,71 +0,0 @@
-# [101. Symmetric Tree](https://leetcode.com/problems/symmetric-tree/)
-
-## 题目
-
-
-Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center).
-
-For example, this binary tree [1,2,2,3,4,4,3] is symmetric:
-
-
-```
-
- 1
- / \
- 2 2
- / \ / \
-3 4 4 3
-
-```
-
-But the following [1,2,2,null,3,null,3] is not:
-
-```
-
- 1
- / \
- 2 2
- \ \
- 3 3
-
-```
-
-**Note**:
-
-Bonus points if you could solve it both recursively and iteratively.
-
-## 题目大意
-
-这一题要求判断 2 颗树是否是左右对称的。
-
-
-## 解题思路
-
-- 这道题是几道题的综合题。将根节点的左字数反转二叉树，然后再和根节点的右节点进行比较，是否完全相等。
-- 反转二叉树是第 226 题。判断 2 颗树是否完全相等是第 100 题。
-
-
-
-
-## 代码
-
-```go
-
-package leetcode
-
-/**
- * Definition for a binary tree node.
- * type TreeNode struct {
- * Val int
- * Left *TreeNode
- * Right *TreeNode
- * }
- */
-func isSymmetric(root *TreeNode) bool {
- if root == nil {
- return true
- }
- return isSameTree(invertTree(root.Left), root.Right)
-}
-
-```
\ No newline at end of file
diff --git a/website/content/ChapterFour/0102.Binary-Tree-Level-Order-Traversal.md b/website/content/ChapterFour/0102.Binary-Tree-Level-Order-Traversal.md
deleted file mode 100644
index 6848f2caf..000000000
--- a/website/content/ChapterFour/0102.Binary-Tree-Level-Order-Traversal.md
+++ /dev/null
@@ -1,115 +0,0 @@
-# [102. Binary Tree Level Order Traversal](https://leetcode.com/problems/binary-tree-level-order-traversal/)
-
-## 题目
-
-
-Given a binary tree, return the level order traversal of its nodes' values. (ie, from left to right, level by level).
-
-**For Example**:
-
-Given binary tree [3,9,20,null,null,15,7],
-
-```
-
- 3
- / \
- 9 20
- / \
- 15 7
-
-```
-
-return its level order traversal as:
-
-```
-
-[
- [3],
- [9,20],
- [15,7]
-]
-
-```
-
-
-## 题目大意
-
-按层序从上到下遍历一颗树。
-
-## 解题思路
-
-用一个队列即可实现。
-
-
-
-
-
-## 代码
-
-```go
-
-package leetcode
-
-/**
- * Definition for a binary tree node.
- * type TreeNode struct {
- * Val int
- * Left *TreeNode
- * Right *TreeNode
- * }
- */
-
-// 解法一 BFS
-func levelOrder(root *TreeNode) [][]int {
- if root == nil {
- return [][]int{}
- }
- queue := []*TreeNode{}
- queue = append(queue, root)
- curNum, nextLevelNum, res, tmp := 1, 0, [][]int{}, []int{}
- for len(queue) != 0 {
- if curNum > 0 {
- node := queue[0]
- if node.Left != nil {
- queue = append(queue, node.Left)
- nextLevelNum++
- }
- if node.Right != nil {
- queue = append(queue, node.Right)
- nextLevelNum++
- }
- curNum--
- tmp = append(tmp, node.Val)
- queue = queue[1:]
- }
- if curNum == 0 {
- res = append(res, tmp)
- curNum = nextLevelNum
- nextLevelNum = 0
- tmp = []int{}
- }
- }
- return res
-}
-
-// 解法二 DFS
-func levelOrder1(root *TreeNode) [][]int {
- levels := [][]int{}
- dfsLevel(root, -1, &levels)
- return levels
-}
-
-func dfsLevel(node *TreeNode, level int, res *[][]int) {
- if node == nil {
- return
- }
- currLevel := level + 1
- for len(*res) <= currLevel {
- *res = append(*res, []int{})
- }
- (*res)[currLevel] = append((*res)[currLevel], node.Val)
- dfsLevel(node.Left, currLevel, res)
- dfsLevel(node.Right, currLevel, res)
-}
-
-```
\ No newline at end of file
diff --git a/website/content/ChapterFour/0103.Binary-Tree-Zigzag-Level-Order-Traversal.md b/website/content/ChapterFour/0103.Binary-Tree-Zigzag-Level-Order-Traversal.md
deleted file mode 100644
index 1f2db14f0..000000000
--- a/website/content/ChapterFour/0103.Binary-Tree-Zigzag-Level-Order-Traversal.md
+++ /dev/null
@@ -1,126 +0,0 @@
-# [103. Binary Tree Zigzag Level Order Traversal](https://leetcode.com/problems/binary-tree-zigzag-level-order-traversal/)
-
-## 题目
-
-Given a binary tree, return the zigzag level order traversal of its nodes' values. (ie, from left to right, then right to left for the next level and alternate between).
-
-**For Example**:
-Given binary tree [3,9,20,null,null,15,7],
-
-```
-
- 3
- / \
- 9 20
- / \
- 15 7
-
-```
-
-return its zigzag level order traversal as:
-
-```
-
-[
- [3],
- [20,9],
- [15,7]
-]
-
-```
-
-
-## 题目大意
-
-按照 Z 字型层序遍历一棵树。
-
-## 解题思路
-
-- 按层序从上到下遍历一颗树，但是每一层的顺序是相互反转的，即上一层是从左往右，下一层就是从右往左，以此类推。用一个队列即可实现。
-- 第 102 题和第 107 题都是按层序遍历的。
-
-
-
-
-## 代码
-
-```go
-
-package leetcode
-
-/**
- * Definition for a binary tree node.
- * type TreeNode struct {
- * Val int
- * Left *TreeNode
- * Right *TreeNode
- * }
- */
-
-// 解法一
-func zigzagLevelOrder(root *TreeNode) [][]int {
- if root == nil {
- return [][]int{}
- }
- queue := []*TreeNode{}
- queue = append(queue, root)
- curNum, nextLevelNum, res, tmp, curDir := 1, 0, [][]int{}, []int{}, 0
- for len(queue) != 0 {
- if curNum > 0 {
- node := queue[0]
- if node.Left != nil {
- queue = append(queue, node.Left)
- nextLevelNum++
- }
- if node.Right != nil {
- queue = append(queue, node.Right)
- nextLevelNum++
- }
- curNum--
- tmp = append(tmp, node.Val)
- queue = queue[1:]
- }
- if curNum == 0 {
- if curDir == 1 {
- for i, j := 0, len(tmp)-1; i < j; i, j = i+1, j-1 {
- tmp[i], tmp[j] = tmp[j], tmp[i]
- }
- }
- res = append(res, tmp)
- curNum = nextLevelNum
- nextLevelNum = 0
- tmp = []int{}
- if curDir == 0 {
- curDir = 1
- } else {
- curDir = 0
- }
- }
- }
- return res
-}
-
-// 解法二 递归
-func zigzagLevelOrder0(root *TreeNode) [][]int {
- var res [][]int
- search(root, 0, &res)
- return res
-}
-
-func search(root *TreeNode, depth int, res *[][]int) {
- if root == nil {
- return
- }
- for len(*res) < depth+1 {
- *res = append(*res, []int{})
- }
- if depth%2 == 0 {
- (*res)[depth] = append((*res)[depth], root.Val)
- } else {
- (*res)[depth] = append([]int{root.Val}, (*res)[depth]...)
- }
- search(root.Left, depth+1, res)
- search(root.Right, depth+1, res)
-}
-
-```
\ No newline at end of file
diff --git a/website/content/ChapterFour/0104.Maximum-Depth-of-Binary-Tree.md b/website/content/ChapterFour/0104.Maximum-Depth-of-Binary-Tree.md
deleted file mode 100644
index 3502cb855..000000000
--- a/website/content/ChapterFour/0104.Maximum-Depth-of-Binary-Tree.md
+++ /dev/null
@@ -1,60 +0,0 @@
-# [104. Maximum Depth of Binary Tree](https://leetcode.com/problems/maximum-depth-of-binary-tree/)
-
-## 题目
-
-Given a binary tree, find its maximum depth.
-
-The maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf node.
-
-**Note**: A leaf is a node with no children.
-
-**Example**:
-
-Given binary tree [3,9,20,null,null,15,7],
-
-```
-
- 3
- / \
- 9 20
- / \
- 15 7
-
-```
-
-return its depth = 3.
-
-
-## 题目大意
-
-要求输出一棵树的最大高度。
-
-## 解题思路
-
-这一题递归遍历就可，遍历根节点的左孩子的高度和根节点右孩子的高度，取出两者的最大值再加一即为总高度。
-
-
-
-
-## 代码
-
-```go
-
-package leetcode
-
-/**
- * Definition for a binary tree node.
- * type TreeNode struct {
- * Val int
- * Left *TreeNode
- * Right *TreeNode
- * }
- */
-func maxDepth(root *TreeNode) int {
- if root == nil {
- return 0
- }
- return max(maxDepth(root.Left), maxDepth(root.Right)) + 1
-}
-
-```
\ No newline at end of file
diff --git a/website/content/ChapterFour/0105.Construct-Binary-Tree-from-Preorder-and-Inorder-Traversal.md b/website/content/ChapterFour/0105.Construct-Binary-Tree-from-Preorder-and-Inorder-Traversal.md
deleted file mode 100755
index 0d6259c05..000000000
--- a/website/content/ChapterFour/0105.Construct-Binary-Tree-from-Preorder-and-Inorder-Traversal.md
+++ /dev/null
@@ -1,73 +0,0 @@
-# [105. Construct Binary Tree from Preorder and Inorder Traversal](https://leetcode.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal/)
-
-
-## 题目
-
-Given preorder and inorder traversal of a tree, construct the binary tree.
-
-**Note**:You may assume that duplicates do not exist in the tree.
-
-For example, given
-
- preorder = [3,9,20,15,7]
- inorder = [9,3,15,20,7]
-
-Return the following binary tree:
-
- 3
- / \
- 9 20
- / \
- 15 7
-
-
-
-## 题目大意
-
-根据一棵树的前序遍历与中序遍历构造二叉树。
-
-注意:
-你可以假设树中没有重复的元素。
-
-
-## 解题思路
-
-- 给出 2 个数组，根据 preorder 和 inorder 数组构造一颗树。
-- 利用递归思想，从 preorder 可以得到根节点，从 inorder 中得到左子树和右子树。只剩一个节点的时候即为根节点。不断的递归直到所有的树都生成完成。
-
-
-## 代码
-
-```go
-
-package leetcode
-
-/**
- * Definition for a binary tree node.
- * type TreeNode struct {
- * Val int
- * Left *TreeNode
- * Right *TreeNode
- * }
- */
-func buildTree(preorder []int, inorder []int) *TreeNode {
- inPos := make(map[int]int)
- for i := 0; i < len(inorder); i++ {
- inPos[inorder[i]] = i
- }
- return buildPreIn2TreeDFS(preorder, 0, len(preorder)-1, 0, inPos)
-}
-
-func buildPreIn2TreeDFS(pre []int, preStart int, preEnd int, inStart int, inPos map[int]int) *TreeNode {
- if preStart > preEnd {
- return nil
- }
- root := &TreeNode{Val: pre[preStart]}
- rootIdx := inPos[pre[preStart]]
- leftLen := rootIdx - inStart
- root.Left = buildPreIn2TreeDFS(pre, preStart+1, preStart+leftLen, inStart, inPos)
- root.Right = buildPreIn2TreeDFS(pre, preStart+leftLen+1, preEnd, rootIdx+1, inPos)
- return root
-}
-
-```
\ No newline at end of file
diff --git a/website/content/ChapterFour/0106.Construct-Binary-Tree-from-Inorder-and-Postorder-Traversal.md b/website/content/ChapterFour/0106.Construct-Binary-Tree-from-Inorder-and-Postorder-Traversal.md
deleted file mode 100755
index 62ea1c8a6..000000000
--- a/website/content/ChapterFour/0106.Construct-Binary-Tree-from-Inorder-and-Postorder-Traversal.md
+++ /dev/null
@@ -1,71 +0,0 @@
-# [106. Construct Binary Tree from Inorder and Postorder Traversal](https://leetcode.com/problems/construct-binary-tree-from-inorder-and-postorder-traversal/)
-
-## 题目
-
-Given inorder and postorder traversal of a tree, construct the binary tree.
-
-**Note**: You may assume that duplicates do not exist in the tree.
-
-For example, given
-
- inorder = [9,3,15,20,7]
- postorder = [9,15,7,20,3]
-
-Return the following binary tree:
-
- 3
- / \
- 9 20
- / \
- 15 7
-
-
-## 题目大意
-
-根据一棵树的中序遍历与后序遍历构造二叉树。
-
-注意:
-你可以假设树中没有重复的元素。
-
-
-## 解题思路
-
-- 给出 2 个数组，根据 inorder 和 postorder 数组构造一颗树。
-- 利用递归思想，从 postorder 可以得到根节点，从 inorder 中得到左子树和右子树。只剩一个节点的时候即为根节点。不断的递归直到所有的树都生成完成。
-
-
-## 代码
-
-```go
-
-package leetcode
-
-/**
- * Definition for a binary tree node.
- * type TreeNode struct {
- * Val int
- * Left *TreeNode
- * Right *TreeNode
- * }
- */
-func buildTree106(inorder []int, postorder []int) *TreeNode {
- inPos := make(map[int]int)
- for i := 0; i < len(inorder); i++ {
- inPos[inorder[i]] = i
- }
- return buildInPos2TreeDFS(postorder, 0, len(postorder)-1, 0, inPos)
-}
-
-func buildInPos2TreeDFS(post []int, postStart int, postEnd int, inStart int, inPos map[int]int) *TreeNode {
- if postStart > postEnd {
- return nil
- }
- root := &TreeNode{Val: post[postEnd]}
- rootIdx := inPos[post[postEnd]]
- leftLen := rootIdx - inStart
- root.Left = buildInPos2TreeDFS(post, postStart, postStart+leftLen-1, inStart, inPos)
- root.Right = buildInPos2TreeDFS(post, postStart+leftLen, postEnd-1, rootIdx+1, inPos)
- return root
-}
-
-```
\ No newline at end of file
diff --git a/website/content/ChapterFour/0107.Binary-Tree-Level-Order-Traversal-II.md b/website/content/ChapterFour/0107.Binary-Tree-Level-Order-Traversal-II.md
deleted file mode 100644
index 5054e26fa..000000000
--- a/website/content/ChapterFour/0107.Binary-Tree-Level-Order-Traversal-II.md
+++ /dev/null
@@ -1,70 +0,0 @@
-# [107. Binary Tree Level Order Traversal II](https://leetcode.com/problems/binary-tree-level-order-traversal-ii/)
-
-## 题目
-
-Given a binary tree, return the bottom-up level order traversal of its nodes' values. (ie, from left to right, level by level from leaf to root).
-
-**For Example**:
-
-Given binary tree [3,9,20,null,null,15,7],
-
-```
-
- 3
- / \
- 9 20
- / \
- 15 7
-
-```
-
-return its bottom-up level order traversal as:
-
-
-```
-
-[
- [15,7],
- [9,20],
- [3]
-]
-
-```
-
-
-## 题目大意
-
-按层序从下到上遍历一颗树。
-
-## 解题思路
-
-用一个队列即可实现。
-
-
-
-
-
-## 代码
-
-```go
-
-package leetcode
-
-/**
- * Definition for a binary tree node.
- * type TreeNode struct {
- * Val int
- * Left *TreeNode
- * Right *TreeNode
- * }
- */
-func levelOrderBottom(root *TreeNode) [][]int {
- tmp := levelOrder(root)
- res := [][]int{}
- for i := len(tmp) - 1; i >= 0; i-- {
- res = append(res, tmp[i])
- }
- return res
-}
-
-```
\ No newline at end of file
diff --git a/website/content/ChapterFour/0118.Pascals-Triangle.md b/website/content/ChapterFour/0118.Pascals-Triangle.md
deleted file mode 100644
index b74f58fab..000000000
--- a/website/content/ChapterFour/0118.Pascals-Triangle.md
+++ /dev/null
@@ -1,60 +0,0 @@
-# [118. Pascal's Triangle](https://leetcode.com/problems/pascals-triangle/)
-
-
-## 题目
-
-Given a non-negative integer numRows, generate the first numRows of Pascal's triangle.
-
-
-
-**Note**: In Pascal's triangle, each number is the sum of the two numbers directly above it.
-
-**Example**:
-
-```
-Input: 5
-Output:
-[
- [1],
- [1,1],
- [1,2,1],
- [1,3,3,1],
- [1,4,6,4,1]
-]
-```
-
-## 题目大意
-
-给定一个非负整数 numRows，生成杨辉三角的前 numRows 行。在杨辉三角中，每个数是它左上方和右上方的数的和。
-
-
-## 解题思路
-
-- 给定一个 n，要求打印杨辉三角的前 n 行。
-- 简单题。按照杨辉三角的生成规则循环打印即可。
-
-
-## 代码
-
-```go
-
-package leetcode
-
-func generate(numRows int) [][]int {
- result := [][]int{}
- for i := 0; i < numRows; i++ {
- row := []int{}
- for j := 0; j < i+1; j++ {
- if j == 0 || j == i {
- row = append(row, 1)
- } else if i > 1 {
- row = append(row, result[i-1][j-1]+result[i-1][j])
- }
- }
- result = append(result, row)
- }
- return result
-}
-
-```
-
diff --git a/website/content/ChapterFour/0125.Valid-Palindrome.md b/website/content/ChapterFour/0125.Valid-Palindrome.md
deleted file mode 100644
index 552c02c97..000000000
--- a/website/content/ChapterFour/0125.Valid-Palindrome.md
+++ /dev/null
@@ -1,70 +0,0 @@
-# [125. Valid Palindrome](https://leetcode.com/problems/valid-palindrome/description/)
-
-## 题目
-
-Given a string, determine if it is a palindrome, considering only alphanumeric characters and ignoring cases.
-
-For example,
-
-```
-
-"A man, a plan, a canal: Panama" is a palindrome.
-"race a car" is not a palindrome.
-
-```
-
-**Note**:
-
-Have you consider that the string might be empty? This is a good question to ask during an interview.
-
-For the purpose of this problem, we define empty string as valid palindrome.
-
-## 题目大意
-
-判断所给的字符串是否是有效的回文串。
-
-## 解题思路
-
-简单题，按照题意做即可。
-
-## 代码
-
-```go
-
-package leetcode
-
-import (
- "strings"
-)
-
-func isPalindrome(s string) bool {
-
- s = strings.ToLower(s)
-
- i, j := 0, len(s)-1
- for i < j {
- for i < j && !isChar(s[i]) {
- i++
- }
- for i < j && !isChar(s[j]) {
- j--
- }
- if s[i] != s[j] {
- return false
- }
- i++
- j--
- }
-
- return true
-}
-
-// 判断 c 是否是字符或者数字
-func isChar(c byte) bool {
- if ('a' <= c && c <= 'z') || ('0' <= c && c <= '9') {
- return true
- }
- return false
-}
-
-```
\ No newline at end of file
diff --git a/website/content/ChapterFour/0129.Sum-Root-to-Leaf-Numbers.md b/website/content/ChapterFour/0129.Sum-Root-to-Leaf-Numbers.md
deleted file mode 100755
index 261b8ebd1..000000000
--- a/website/content/ChapterFour/0129.Sum-Root-to-Leaf-Numbers.md
+++ /dev/null
@@ -1,97 +0,0 @@
-# [129. Sum Root to Leaf Numbers](https://leetcode.com/problems/sum-root-to-leaf-numbers/)
-
-
-## 题目
-
-Given a binary tree containing digits from `0-9` only, each root-to-leaf path could represent a number.
-
-An example is the root-to-leaf path `1->2->3` which represents the number `123`.
-
-Find the total sum of all root-to-leaf numbers.
-
-**Note**: A leaf is a node with no children.
-
-**Example**:
-
- Input: [1,2,3]
- 1
- / \
- 2 3
- Output: 25
- Explanation:
- The root-to-leaf path 1->2 represents the number 12.
- The root-to-leaf path 1->3 represents the number 13.
- Therefore, sum = 12 + 13 = 25.
-
-**Example 2**:
-
- Input: [4,9,0,5,1]
- 4
- / \
- 9 0
- / \
- 5 1
- Output: 1026
- Explanation:
- The root-to-leaf path 4->9->5 represents the number 495.
- The root-to-leaf path 4->9->1 represents the number 491.
- The root-to-leaf path 4->0 represents the number 40.
- Therefore, sum = 495 + 491 + 40 = 1026.
-
-## 题目大意
-
-给定一个二叉树，它的每个结点都存放一个 0-9 的数字，每条从根到叶子节点的路径都代表一个数字。例如，从根到叶子节点路径 1->2->3 代表数字 123。计算从根到叶子节点生成的所有数字之和。说明: 叶子节点是指没有子节点的节点。
-
-
-## 解题思路
-
-- 这一题是第 257 题的变形题，第 257 题要求输出每条从根节点到叶子节点的路径，这一题变成了把每一个从根节点到叶子节点的数字都串联起来，再累加每条路径，求出最后的总和。实际做题思路基本没变
-
-
-## 代码
-
-```go
-
-package leetcode
-
-import (
- "strconv"
-)
-
-/**
- * Definition for a binary tree node.
- * type TreeNode struct {
- * Val int
- * Left *TreeNode
- * Right *TreeNode
- * }
- */
-func sumNumbers(root *TreeNode) int {
- res, nums := 0, binaryTreeNums(root)
- for _, n := range nums {
- num, _ := strconv.Atoi(n)
- res += num
- }
- return res
-}
-
-func binaryTreeNums(root *TreeNode) []string {
- if root == nil {
- return []string{}
- }
- res := []string{}
- if root.Left == nil && root.Right == nil {
- return []string{strconv.Itoa(root.Val)}
- }
- tmpLeft := binaryTreeNums(root.Left)
- for i := 0; i < len(tmpLeft); i++ {
- res = append(res, strconv.Itoa(root.Val)+tmpLeft[i])
- }
- tmpRight := binaryTreeNums(root.Right)
- for i := 0; i < len(tmpRight); i++ {
- res = append(res, strconv.Itoa(root.Val)+tmpRight[i])
- }
- return res
-}
-
-```
\ No newline at end of file
diff --git a/website/content/ChapterFour/0141.Linked-List-Cycle.md b/website/content/ChapterFour/0141.Linked-List-Cycle.md
deleted file mode 100644
index ac0553c60..000000000
--- a/website/content/ChapterFour/0141.Linked-List-Cycle.md
+++ /dev/null
@@ -1,48 +0,0 @@
-# [141. Linked List Cycle](https://leetcode.com/problems/linked-list-cycle/description/)
-
-## 题目
-
-Given a linked list, determine if it has a cycle in it.
-
-**Follow up**:
-Can you solve it without using extra space?
-
-
-
-## 题目大意
-
-判断链表是否有环，不能使用额外的空间。
-
-## 解题思路
-
-给 2 个指针，一个指针是另外一个指针的下一个指针。快指针一次走 2 格，慢指针一次走 1 格。如果存在环，那么前一个指针一定会经过若干圈之后追上慢的指针。
-
-## 代码
-
-```go
-
-package leetcode
-
-/**
- * Definition for singly-linked list.
- * struct ListNode {
- * int val;
- * ListNode *next;
- * ListNode(int x) : val(x), next(NULL) {}
- * };
- */
-
-func hasCycle(head *ListNode) bool {
- fast := head
- slow := head
- for slow != nil && fast != nil && fast.Next != nil {
- fast = fast.Next.Next
- slow = slow.Next
- if fast == slow {
- return true
- }
- }
- return false
-}
-
-```w
\ No newline at end of file
diff --git a/website/content/ChapterFour/0145.Binary-Tree-Postorder-Traversal.md b/website/content/ChapterFour/0145.Binary-Tree-Postorder-Traversal.md
deleted file mode 100644
index a78a7465e..000000000
--- a/website/content/ChapterFour/0145.Binary-Tree-Postorder-Traversal.md
+++ /dev/null
@@ -1,71 +0,0 @@
-# [145. Binary Tree Postorder Traversal](https://leetcode.com/problems/binary-tree-postorder-traversal/)
-
-## 题目
-
-
-Given a binary tree, return the postorder traversal of its nodes' values.
-
-
-
-**Example**:
-
-```
-
-Input: [1,null,2,3]
- 1
- \
- 2
- /
- 3
-
-Output: [3,2,1]
-
-```
-
-
-**Follow up**: Recursive solution is trivial, could you do it iteratively?
-
-
-
-
-## 题目大意
-
-后根遍历一颗树。
-
-## 解题思路
-
-递归的实现方法，见代码。
-
-
-
-
-
-## 代码
-
-```go
-
-package leetcode
-
-/**
- * Definition for a binary tree node.
- * type TreeNode struct {
- * Val int
- * Left *TreeNode
- * Right *TreeNode
- * }
- */
-func postorderTraversal(root *TreeNode) []int {
- var result []int
- postorder(root, &result)
- return result
-}
-
-func postorder(root *TreeNode, output *[]int) {
- if root != nil {
- postorder(root.Left, output)
- postorder(root.Right, output)
- *output = append(*output, root.Val)
- }
-}
-
-```
\ No newline at end of file
diff --git a/website/content/ChapterFour/0148.Sort-List.md b/website/content/ChapterFour/0148.Sort-List.md
deleted file mode 100644
index 0cf29b929..000000000
--- a/website/content/ChapterFour/0148.Sort-List.md
+++ /dev/null
@@ -1,95 +0,0 @@
-# [148. Sort List](https://leetcode.com/problems/sort-list/)
-
-## 题目
-
-Sort a linked list in O(n log n) time using constant space complexity.
-
-**Example 1**:
-
-```
-
-Input: 4->2->1->3
-Output: 1->2->3->4
-
-```
-
-**Example 2**:
-
-```
-
-Input: -1->5->3->4->0
-Output: -1->0->3->4->5
-
-```
-
-## 题目大意
-
-链表的排序，要求时间复杂度必须是 O(n log n)，空间复杂度是 O(1)
-
-## 解题思路
-
-这道题只能用归并排序才能符合要求。归并排序需要的 2 个操作在其他题目已经出现过了，取中间点是第 876 题，合并 2 个有序链表是第 21 题。
-
-## 代码
-
-```go
-
-package leetcode
-
-/**
- * Definition for singly-linked list.
- * type ListNode struct {
- * Val int
- * Next *ListNode
- * }
- */
-func sortList(head *ListNode) *ListNode {
- length := 0
- cur := head
- for cur != nil {
- length++
- cur = cur.Next
- }
- if length <= 1 {
- return head
- }
-
- middleNode := middleNode1(head)
- cur = middleNode.Next
- middleNode.Next = nil
- middleNode = cur
-
- left := sortList(head)
- right := sortList(middleNode)
- return mergeTwoLists148(left, right)
-}
-
-func middleNode1(head *ListNode) *ListNode {
- if head == nil || head.Next == nil {
- return head
- }
- p1 := head
- p2 := head
- for p2.Next != nil && p2.Next.Next != nil {
- p1 = p1.Next
- p2 = p2.Next.Next
- }
- return p1
-}
-
-func mergeTwoLists148(l1 *ListNode, l2 *ListNode) *ListNode {
- if l1 == nil {
- return l2
- }
- if l2 == nil {
- return l1
- }
- if l1.Val < l2.Val {
- l1.Next = mergeTwoLists(l1.Next, l2)
- return l1
- }
- l2.Next = mergeTwoLists(l1, l2.Next)
- return l2
-}
-
-```
\ No newline at end of file
diff --git a/website/content/ChapterFour/0150.Evaluate-Reverse-Polish-Notation.md b/website/content/ChapterFour/0150.Evaluate-Reverse-Polish-Notation.md
deleted file mode 100644
index 0cb6b4725..000000000
--- a/website/content/ChapterFour/0150.Evaluate-Reverse-Polish-Notation.md
+++ /dev/null
@@ -1,115 +0,0 @@
-# [150. Evaluate Reverse Polish Notation](https://leetcode.com/problems/evaluate-reverse-polish-notation/)
-
-## 题目
-
-Evaluate the value of an arithmetic expression in Reverse Polish Notation.
-
-Valid operators are +, -, *, /. Each operand may be an integer or another expression.
-
-**Note**:
-
-- Division between two integers should truncate toward zero.
-- The given RPN expression is always valid. That means the expression would always evaluate to a result and there won't be any divide by zero operation.
-
-**Example 1**:
-
-```
-
-Input: ["2", "1", "+", "3", "*"]
-Output: 9
-Explanation: ((2 + 1) * 3) = 9
-
-```
-
-**Example 2**:
-
-```
-
-Input: ["4", "13", "5", "/", "+"]
-Output: 6
-Explanation: (4 + (13 / 5)) = 6
-
-```
-**Example 3**:
-
-```
-
-Input: ["10", "6", "9", "3", "+", "-11", "*", "/", "*", "17", "+", "5", "+"]
-Output: 22
-Explanation:
- ((10 * (6 / ((9 + 3) * -11))) + 17) + 5
-= ((10 * (6 / (12 * -11))) + 17) + 5
-= ((10 * (6 / -132)) + 17) + 5
-= ((10 * 0) + 17) + 5
-= (0 + 17) + 5
-= 17 + 5
-= 22
-
-```
-
-## 题目大意
-
-计算逆波兰表达式。
-
-## 解题思路
-
-这道题就是经典的考察栈的知识的题目。
-
-## 代码
-
-```go
-
-package leetcode
-
-import (
- "strconv"
-)
-
-func evalRPN(tokens []string) int {
- if len(tokens) == 1 {
- i, _ := strconv.Atoi(tokens[0])
- return i
- }
- stack, top := []int{}, 0
- for _, v := range tokens {
- switch v {
- case "+":
- {
- sum := stack[top-2] + stack[top-1]
- stack = stack[:top-2]
- stack = append(stack, sum)
- top--
- }
- case "-":
- {
- sub := stack[top-2] - stack[top-1]
- stack = stack[:top-2]
- stack = append(stack, sub)
- top--
- }
- case "*":
- {
- mul := stack[top-2] * stack[top-1]
- stack = stack[:top-2]
- stack = append(stack, mul)
- top--
- }
- case "/":
- {
- div := stack[top-2] / stack[top-1]
- stack = stack[:top-2]
- stack = append(stack, div)
- top--
- }
- default:
- {
- i, _ := strconv.Atoi(v)
- stack = append(stack, i)
- top++
- }
- }
- }
- return stack[0]
-}
-
-```
\ No newline at end of file
diff --git a/website/content/ChapterFour/0167.Two-Sum-II---Input-array-is-sorted.md b/website/content/ChapterFour/0167.Two-Sum-II---Input-array-is-sorted.md
deleted file mode 100644
index b4a1dd226..000000000
--- a/website/content/ChapterFour/0167.Two-Sum-II---Input-array-is-sorted.md
+++ /dev/null
@@ -1,68 +0,0 @@
-# [167. Two Sum II - Input array is sorted](https://leetcode.com/problems/two-sum-ii-input-array-is-sorted/)
-
-## 题目
-
-Given an array of integers that is already sorted in ascending order, find two numbers such that they add up to a specific target number.
-
-The function twoSum should return indices of the two numbers such that they add up to the target, where index1 must be less than index2.
-
-**Note**:
-
-- Your returned answers (both index1 and index2) are not zero-based.
-- You may assume that each input would have exactly one solution and you may not use the same element twice.
-
-**Example**:
-
-```
-
-Input: numbers = [2,7,11,15], target = 9
-Output: [1,2]
-Explanation: The sum of 2 and 7 is 9. Therefore index1 = 1, index2 = 2.
-
-```
-
-## 题目大意
-
-找出两个数之和等于 target 的两个数字，要求输出它们的下标。注意一个数字不能使用 2 次。下标从小到大输出。假定题目一定有一个解。
-
-## 解题思路
-
-这一题比第 1 题 Two Sum 的问题还要简单，因为这里数组是有序的。可以直接用第一题的解法解决这道题。
-
-
-
-## 代码
-
-```go
-
-package leetcode
-
-// 解法一 这一题可以利用数组有序的特性
-func twoSum167(numbers []int, target int) []int {
- i, j := 0, len(numbers)-1
- for i < j {
- if numbers[i]+numbers[j] == target {
- return []int{i + 1, j + 1}
- } else if numbers[i]+numbers[j] < target {
- i++
- } else {
- j--
- }
- }
- return []int{-1, -1}
-}
-
-// 解法二 不管数组是否有序，空间复杂度比上一种解法要多 O(n)
-func twoSum167_1(numbers []int, target int) []int {
- m := make(map[int]int)
- for i := 0; i < len(numbers); i++ {
- another := target - numbers[i]
- if _, ok := m[another]; ok {
- return []int{m[another] + 1, i + 1}
- }
- m[numbers[i]] = i
- }
- return nil
-}
-
-```
\ No newline at end of file
diff --git a/website/content/ChapterFour/0168.Excel-Sheet-Column-Title.md b/website/content/ChapterFour/0168.Excel-Sheet-Column-Title.md
deleted file mode 100644
index c1ecdd583..000000000
--- a/website/content/ChapterFour/0168.Excel-Sheet-Column-Title.md
+++ /dev/null
@@ -1,80 +0,0 @@
-# [168. Excel Sheet Column Title](https://leetcode.com/problems/excel-sheet-column-title/)
-
-## 题目
-
-Given a positive integer, return its corresponding column title as appear in an Excel sheet.
-
-For example:
-
-```
- 1 -> A
- 2 -> B
- 3 -> C
- ...
- 26 -> Z
- 27 -> AA
- 28 -> AB
- ...
-```
-
-**Example 1**:
-
-```
-Input: 1
-Output: "A"
-```
-
-**Example 2**:
-
-```
-Input: 28
-Output: "AB"
-```
-
-**Example 3**:
-
-```
-Input: 701
-Output: "ZY"
-```
-
-## 题目大意
-
-给定一个正整数，返回它在 Excel 表中相对应的列名称。
-
-例如，
-
- 1 -> A
- 2 -> B
- 3 -> C
- ...
- 26 -> Z
- 27 -> AA
- 28 -> AB
- ...
-
-
-## 解题思路
-
-- 给定一个正整数，返回它在 Excel 表中的对应的列名称
-- 简单题。这一题就类似短除法的计算过程。以 26 进制的字母编码。按照短除法先除，然后余数逆序输出即可。
-
-## 代码
-
-```go
-
-package leetcode
-
-func convertToTitle(n int) string {
- result := []byte{}
- for n > 0 {
- result = append(result, 'A'+byte((n-1)%26))
- n = (n - 1) / 26
- }
- for i, j := 0, len(result)-1; i < j; i, j = i+1, j-1 {
- result[i], result[j] = result[j], result[i]
- }
- return string(result)
-}
-
-```
\ No newline at end of file
diff --git a/website/content/ChapterFour/0171.Excel-Sheet-Column-Number.md b/website/content/ChapterFour/0171.Excel-Sheet-Column-Number.md
deleted file mode 100644
index 8c9f6651d..000000000
--- a/website/content/ChapterFour/0171.Excel-Sheet-Column-Number.md
+++ /dev/null
@@ -1,67 +0,0 @@
-# [171. Excel Sheet Column Number](https://leetcode.com/problems/excel-sheet-column-number/)
-
-
-## 题目
-
-Given a column title as appear in an Excel sheet, return its corresponding column number.
-
-For example:
-
-```
- A -> 1
- B -> 2
- C -> 3
- ...
- Z -> 26
- AA -> 27
- AB -> 28
- ...
-```
-
-**Example 1**:
-
-```
-Input: "A"
-Output: 1
-```
-
-**Example 2**:
-
-```
-Input: "AB"
-Output: 28
-```
-
-**Example 3**:
-
-```
-Input: "ZY"
-Output: 701
-```
-
-## 题目大意
-
-给定一个 Excel 表格中的列名称，返回其相应的列序号。
-
-
-## 解题思路
-
-- 给出 Excel 中列的名称，输出其对应的列序号。
-- 简单题。这一题是第 168 题的逆序题。按照 26 进制还原成十进制即可。
-
-## 代码
-
-```go
-
-package leetcode
-
-func titleToNumber(s string) int {
- val, res := 0, 0
- for i := 0; i < len(s); i++ {
- val = int(s[i] - 'A' + 1)
- res = res*26 + val
- }
- return res
-}
-
-```
\ No newline at end of file
diff --git a/website/content/ChapterFour/0199.Binary-Tree-Right-Side-View.md b/website/content/ChapterFour/0199.Binary-Tree-Right-Side-View.md
deleted file mode 100644
index 621d23338..000000000
--- a/website/content/ChapterFour/0199.Binary-Tree-Right-Side-View.md
+++ /dev/null
@@ -1,84 +0,0 @@
-# [199. Binary Tree Right Side View](https://leetcode.com/problems/binary-tree-right-side-view/)
-
-## 题目
-
-Given a binary tree, imagine yourself standing on the right side of it, return the values of the nodes you can see ordered from top to bottom.
-
-**Example**:
-
-```
-
-Input: [1,2,3,null,5,null,4]
-Output: [1, 3, 4]
-Explanation:
-
- 1 <---
- / \
-2 3 <---
- \ \
- 5 4 <---
-
-```
-
-
-
-## 题目大意
-
-从右边看一个树，输出看到的数字。注意有遮挡。
-
-
-## 解题思路
-
-- 这一题是按层序遍历的变种题。按照层序把每层的元素都遍历出来，然后依次取每一层的最右边的元素即可。用一个队列即可实现。
-- 第 102 题和第 107 题都是按层序遍历的。
-
-
-
-
-## 代码
-
-```go
-
-package leetcode
-
-/**
- * Definition for a binary tree node.
- * type TreeNode struct {
- * Val int
- * Left *TreeNode
- * Right *TreeNode
- * }
- */
-func rightSideView(root *TreeNode) []int {
- if root == nil {
- return []int{}
- }
- queue := []*TreeNode{}
- queue = append(queue, root)
- curNum, nextLevelNum, res, tmp := 1, 0, []int{}, []int{}
- for len(queue) != 0 {
- if curNum > 0 {
- node := queue[0]
- if node.Left != nil {
- queue = append(queue, node.Left)
- nextLevelNum++
- }
- if node.Right != nil {
- queue = append(queue, node.Right)
- nextLevelNum++
- }
- curNum--
- tmp = append(tmp, node.Val)
- queue = queue[1:]
- }
- if curNum == 0 {
- res = append(res, tmp[len(tmp)-1])
- curNum = nextLevelNum
- nextLevelNum = 0
- tmp = []int{}
- }
- }
- return res
-}
-
-```
\ No newline at end of file
diff --git a/website/content/ChapterFour/0200.Number-of-Islands.md b/website/content/ChapterFour/0200~0299/0200.Number-of-Islands.md
similarity index 82%
rename from website/content/ChapterFour/0200.Number-of-Islands.md
rename to website/content/ChapterFour/0200~0299/0200.Number-of-Islands.md
index 3fe5a2f26..909363570 100755
--- a/website/content/ChapterFour/0200.Number-of-Islands.md
+++ b/website/content/ChapterFour/0200~0299/0200.Number-of-Islands.md
@@ -78,4 +78,11 @@ func searchIslands(grid [][]byte, visited *[][]bool, x, y int) {
}
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0100~0199/0199.Binary-Tree-Right-Side-View/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0200~0299/0201.Bitwise-AND-of-Numbers-Range/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0201.Bitwise-AND-of-Numbers-Range.md b/website/content/ChapterFour/0200~0299/0201.Bitwise-AND-of-Numbers-Range.md
similarity index 84%
rename from website/content/ChapterFour/0201.Bitwise-AND-of-Numbers-Range.md
rename to website/content/ChapterFour/0200~0299/0201.Bitwise-AND-of-Numbers-Range.md
index cccdb75b8..6f064185d 100755
--- a/website/content/ChapterFour/0201.Bitwise-AND-of-Numbers-Range.md
+++ b/website/content/ChapterFour/0200~0299/0201.Bitwise-AND-of-Numbers-Range.md
@@ -63,4 +63,11 @@ func rangeBitwiseAnd(m int, n int) int {
return n
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0200~0299/0200.Number-of-Islands/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0200~0299/0202.Happy-Number/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0200~0299/0202.Happy-Number.md b/website/content/ChapterFour/0200~0299/0202.Happy-Number.md
new file mode 100644
index 000000000..db82ed58e
--- /dev/null
+++ b/website/content/ChapterFour/0200~0299/0202.Happy-Number.md
@@ -0,0 +1,71 @@
+# [202. Happy Number](https://leetcode.com/problems/happy-number/)
+
+## 题目
+
+Write an algorithm to determine if a number is "happy".
+
+A happy number is a number defined by the following process: Starting with any positive integer, replace the number by the sum of the squares of its digits, and repeat the process until the number equals 1 (where it will stay), or it loops endlessly in a cycle which does not include 1. Those numbers for which this process ends in 1 are happy numbers.
+
+**Example 1**:
+
+```
+
+Input: 19
+Output: true
+Explanation:
+12 + 92 = 82
+82 + 22 = 68
+62 + 82 = 100
+12 + 02 + 02 = 1
+
+```
+
+## 题目大意
+
+判断一个数字是否是“快乐数字”，“快乐数字”的定义是，不断的把这个数字的每个数字的平方和加起来，反复的加，最终如果能有结果是 1，则是“快乐数字”，如果不能得到一，出现了循环，则输出 false。
+
+## 解题思路
+
+按照题意要求做即可。
+
+
+
+## 代码
+
+```go
+
+package leetcode
+
+func isHappy(n int) bool {
+ record := map[int]int{}
+ for n != 1 {
+ record[n] = n
+ n = getSquareOfDigits(n)
+ for _, previous := range record {
+ if n == previous {
+ return false
+ }
+ }
+ }
+ return true
+}
+
+func getSquareOfDigits(n int) int {
+ squareOfDigits := 0
+ temporary := n
+ for temporary != 0 {
+ remainder := temporary % 10
+ squareOfDigits += remainder * remainder
+ temporary /= 10
+ }
+ return squareOfDigits
+}
+
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0200~0299/0201.Bitwise-AND-of-Numbers-Range/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0200~0299/0203.Remove-Linked-List-Elements/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0200~0299/0203.Remove-Linked-List-Elements.md b/website/content/ChapterFour/0200~0299/0203.Remove-Linked-List-Elements.md
new file mode 100644
index 000000000..d86711619
--- /dev/null
+++ b/website/content/ChapterFour/0200~0299/0203.Remove-Linked-List-Elements.md
@@ -0,0 +1,63 @@
+# [203. Remove Linked List Elements](https://leetcode.com/problems/remove-linked-list-elements/)
+
+## 题目
+
+Remove all elements from a linked list of integers that have value val.
+
+**Example**:
+
+```
+
+Input: 1->2->6->3->4->5->6, val = 6
+Output: 1->2->3->4->5
+
+```
+
+
+## 题目大意
+
+删除链表中所有指定值的结点。
+
+## 解题思路
+
+按照题意做即可。
+
+## 代码
+
+```go
+
+package leetcode
+
+/**
+ * Definition for singly-linked list.
+ * type ListNode struct {
+ * Val int
+ * Next *ListNode
+ * }
+ */
+func removeElements(head *ListNode, val int) *ListNode {
+ if head == nil {
+ return head
+ }
+ newHead := &ListNode{Val: 0, Next: head}
+ pre := newHead
+ cur := head
+ for cur != nil {
+ if cur.Val == val {
+ pre.Next = cur.Next
+ } else {
+ pre = cur
+ }
+ cur = cur.Next
+ }
+ return newHead.Next
+}
+
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0200~0299/0202.Happy-Number/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0200~0299/0204.Count-Primes/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0200~0299/0204.Count-Primes.md b/website/content/ChapterFour/0200~0299/0204.Count-Primes.md
new file mode 100755
index 000000000..fe09cb95c
--- /dev/null
+++ b/website/content/ChapterFour/0200~0299/0204.Count-Primes.md
@@ -0,0 +1,57 @@
+# [204. Count Primes](https://leetcode.com/problems/count-primes/)
+
+
+## 题目
+
+Count the number of prime numbers less than a non-negative number, **n**.
+
+**Example**:
+
+ Input: 10
+ Output: 4
+ Explanation: There are 4 prime numbers less than 10, they are 2, 3, 5, 7.
+
+
+## 题目大意
+
+统计所有小于非负整数 n 的质数的数量。
+
+
+## 解题思路
+
+- 给出一个数字 n，要求输出小于 n 的所有素数的个数总和。简单题。
+
+
+## 代码
+
+```go
+
+package leetcode
+
+func countPrimes(n int) int {
+ isNotPrime := make([]bool, n)
+ for i := 2; i*i < n; i++ {
+ if isNotPrime[i] {
+ continue
+ }
+ for j := i * i; j < n; j = j + i {
+ isNotPrime[j] = true
+ }
+ }
+ count := 0
+ for i := 2; i < n; i++ {
+ if !isNotPrime[i] {
+ count++
+ }
+ }
+ return count
+}
+
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0200~0299/0203.Remove-Linked-List-Elements/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0200~0299/0205.Isomorphic-Strings/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0205.Isomorphic-Strings.md b/website/content/ChapterFour/0200~0299/0205.Isomorphic-Strings.md
similarity index 81%
rename from website/content/ChapterFour/0205.Isomorphic-Strings.md
rename to website/content/ChapterFour/0200~0299/0205.Isomorphic-Strings.md
index 31a2b620d..6854aa2a1 100644
--- a/website/content/ChapterFour/0205.Isomorphic-Strings.md
+++ b/website/content/ChapterFour/0200~0299/0205.Isomorphic-Strings.md
@@ -87,4 +87,11 @@ func isIsomorphic(s string, t string) bool {
return true
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0200~0299/0204.Count-Primes/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0200~0299/0206.Reverse-Linked-List/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0200~0299/0206.Reverse-Linked-List.md b/website/content/ChapterFour/0200~0299/0206.Reverse-Linked-List.md
new file mode 100644
index 000000000..773f955f9
--- /dev/null
+++ b/website/content/ChapterFour/0200~0299/0206.Reverse-Linked-List.md
@@ -0,0 +1,54 @@
+# [206. Reverse Linked List](https://leetcode.com/problems/reverse-linked-list/description/)
+
+## 题目
+
+Reverse a singly linked list.
+
+## 题目大意
+
+翻转单链表
+
+
+## 解题思路
+
+按照题意做即可。
+
+## 代码
+
+```go
+
+package leetcode
+
+/**
+ * Definition for singly-linked list.
+ * type ListNode struct {
+ * Val int
+ * Next *ListNode
+ * }
+ */
+
+// ListNode define
+type ListNode struct {
+ Val int
+ Next *ListNode
+}
+
+func reverseList(head *ListNode) *ListNode {
+ var behind *ListNode
+ for head != nil {
+ next := head.Next
+ head.Next = behind
+ behind = head
+ head = next
+ }
+ return behind
+}
+
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0200~0299/0205.Isomorphic-Strings/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0200~0299/0207.Course-Schedule/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0207.Course-Schedule.md b/website/content/ChapterFour/0200~0299/0207.Course-Schedule.md
similarity index 87%
rename from website/content/ChapterFour/0207.Course-Schedule.md
rename to website/content/ChapterFour/0200~0299/0207.Course-Schedule.md
index 7d2e8401a..52442d3c9 100755
--- a/website/content/ChapterFour/0207.Course-Schedule.md
+++ b/website/content/ChapterFour/0200~0299/0207.Course-Schedule.md
@@ -79,4 +79,11 @@ func canFinish(n int, pre [][]int) bool {
return len(next) == n
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0200~0299/0206.Reverse-Linked-List/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0200~0299/0208.Implement-Trie-Prefix-Tree/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0208.Implement-Trie-Prefix-Tree.md b/website/content/ChapterFour/0200~0299/0208.Implement-Trie-Prefix-Tree.md
similarity index 85%
rename from website/content/ChapterFour/0208.Implement-Trie-Prefix-Tree.md
rename to website/content/ChapterFour/0200~0299/0208.Implement-Trie-Prefix-Tree.md
index 42d6500bd..9f997351b 100755
--- a/website/content/ChapterFour/0208.Implement-Trie-Prefix-Tree.md
+++ b/website/content/ChapterFour/0200~0299/0208.Implement-Trie-Prefix-Tree.md
@@ -96,4 +96,11 @@ func (this *Trie) StartsWith(prefix string) bool {
* param_3 := obj.StartsWith(prefix);
*/
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0200~0299/0207.Course-Schedule/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0200~0299/0209.Minimum-Size-Subarray-Sum/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0200~0299/0209.Minimum-Size-Subarray-Sum.md b/website/content/ChapterFour/0200~0299/0209.Minimum-Size-Subarray-Sum.md
new file mode 100644
index 000000000..806093aee
--- /dev/null
+++ b/website/content/ChapterFour/0200~0299/0209.Minimum-Size-Subarray-Sum.md
@@ -0,0 +1,67 @@
+# [209. Minimum Size Subarray Sum](https://leetcode.com/problems/minimum-size-subarray-sum/)
+
+## 题目
+
+Given an array of n positive integers and a positive integer s, find the minimal length of a contiguous subarray of which the sum ≥ s. If there isn't one, return 0 instead.
+
+**Example 1**:
+
+```
+
+Input: s = 7, nums = [2,3,1,2,4,3]
+Output: 2
+Explanation: the subarray [4,3] has the minimal length under the problem constraint.
+
+```
+
+**Follow up**:
+
+If you have figured out the O(n) solution, try coding another solution of which the time complexity is O(n log n).
+
+## 题目大意
+
+给定一个整型数组和一个数字 s，找到数组中最短的一个连续子数组，使得连续子数组的数字之和 sum>=s，返回最短的连续子数组的返回值。
+
+## 解题思路
+
+这一题的解题思路是用滑动窗口。在滑动窗口 [i,j]之间不断往后移动，如果总和小于 s，就扩大右边界 j，不断加入右边的值，直到 sum > s，之和再缩小 i 的左边界，不断缩小直到 sum < s，这时候右边界又可以往右移动。以此类推。
+
+
+
+## 代码
+
+```go
+
+package leetcode
+
+func minSubArrayLen(target int, nums []int) int {
+ left, sum, res := 0, 0, len(nums)+1
+ for right, v := range nums {
+ sum += v
+ for sum >= target {
+ res = min(res, right-left+1)
+ sum -= nums[left]
+ left++
+ }
+ }
+ if res == len(nums)+1 {
+ return 0
+ }
+ return res
+}
+
+func min(a int, b int) int {
+ if a > b {
+ return b
+ }
+ return a
+}
+
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0200~0299/0208.Implement-Trie-Prefix-Tree/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0200~0299/0210.Course-Schedule-II/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0210.Course-Schedule-II.md b/website/content/ChapterFour/0200~0299/0210.Course-Schedule-II.md
similarity index 88%
rename from website/content/ChapterFour/0210.Course-Schedule-II.md
rename to website/content/ChapterFour/0200~0299/0210.Course-Schedule-II.md
index 735d260e1..8f73b2405 100755
--- a/website/content/ChapterFour/0210.Course-Schedule-II.md
+++ b/website/content/ChapterFour/0200~0299/0210.Course-Schedule-II.md
@@ -77,4 +77,11 @@ func findOrder(numCourses int, prerequisites [][]int) []int {
return []int{}
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0200~0299/0209.Minimum-Size-Subarray-Sum/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0200~0299/0211.Design-Add-and-Search-Words-Data-Structure/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0200~0299/0211.Design-Add-and-Search-Words-Data-Structure.md b/website/content/ChapterFour/0200~0299/0211.Design-Add-and-Search-Words-Data-Structure.md
new file mode 100755
index 000000000..311a827ce
--- /dev/null
+++ b/website/content/ChapterFour/0200~0299/0211.Design-Add-and-Search-Words-Data-Structure.md
@@ -0,0 +1,102 @@
+# [211. Design Add and Search Words Data Structure](https://leetcode.com/problems/design-add-and-search-words-data-structure/)
+
+
+## 题目
+
+Design a data structure that supports the following two operations:
+
+ void addWord(word)
+ bool search(word)
+
+search(word) can search a literal word or a regular expression string containing only letters `a-z` or `.`. A `.` means it can represent any one letter.
+
+**Example**:
+
+ addWord("bad")
+ addWord("dad")
+ addWord("mad")
+ search("pad") -> false
+ search("bad") -> true
+ search(".ad") -> true
+ search("b..") -> true
+
+**Note**: You may assume that all words are consist of lowercase letters `a-z`.
+
+## 题目大意
+
+设计一个支持以下两种操作的数据结构：`void addWord(word)`、`bool search(word)`。`search(word)` 可以搜索文字或正则表达式字符串，字符串只包含字母 . 或 a-z 。 "." 可以表示任何一个字母。
+
+
+
+## 解题思路
+
+- 设计一个 `WordDictionary` 的数据结构，要求具有 `addWord(word)` 和 `search(word)` 的操作，并且具有模糊查找的功能。
+- 这一题是第 208 题的加强版，在第 208 题经典的 Trie 上加上了模糊查找的功能。其他实现一模一样。
+
+
+## 代码
+
+```go
+
+package leetcode
+
+type WordDictionary struct {
+ children map[rune]*WordDictionary
+ isWord bool
+}
+
+/** Initialize your data structure here. */
+func Constructor211() WordDictionary {
+ return WordDictionary{children: make(map[rune]*WordDictionary)}
+}
+
+/** Adds a word into the data structure. */
+func (this *WordDictionary) AddWord(word string) {
+ parent := this
+ for _, ch := range word {
+ if child, ok := parent.children[ch]; ok {
+ parent = child
+ } else {
+ newChild := &WordDictionary{children: make(map[rune]*WordDictionary)}
+ parent.children[ch] = newChild
+ parent = newChild
+ }
+ }
+ parent.isWord = true
+}
+
+/** Returns if the word is in the data structure. A word could contain the dot character '.' to represent any one letter. */
+func (this *WordDictionary) Search(word string) bool {
+ parent := this
+ for i, ch := range word {
+ if rune(ch) == '.' {
+ isMatched := false
+ for _, v := range parent.children {
+ if v.Search(word[i+1:]) {
+ isMatched = true
+ }
+ }
+ return isMatched
+ } else if _, ok := parent.children[rune(ch)]; !ok {
+ return false
+ }
+ parent = parent.children[rune(ch)]
+ }
+ return len(parent.children) == 0 || parent.isWord
+}
+
+/**
+ * Your WordDictionary object will be instantiated and called as such:
+ * obj := Constructor();
+ * obj.AddWord(word);
+ * param_2 := obj.Search(word);
+ */
+
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0200~0299/0210.Course-Schedule-II/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0200~0299/0212.Word-Search-II/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0200~0299/0212.Word-Search-II.md b/website/content/ChapterFour/0200~0299/0212.Word-Search-II.md
new file mode 100755
index 000000000..69511f5f4
--- /dev/null
+++ b/website/content/ChapterFour/0200~0299/0212.Word-Search-II.md
@@ -0,0 +1,110 @@
+# [212. Word Search II](https://leetcode.com/problems/word-search-ii/)
+
+
+## 题目
+
+Given a 2D board and a list of words from the dictionary, find all words in the board.
+
+Each word must be constructed from letters of sequentially adjacent cell, where "adjacent" cells are those horizontally or vertically neighboring. The same letter cell may not be used more than once in a word.
+
+**Example**:
+
+ Input:
+ board = [
+ ['o','a','a','n'],
+ ['e','t','a','e'],
+ ['i','h','k','r'],
+ ['i','f','l','v']
+ ]
+ words = ["oath","pea","eat","rain"]
+
+ Output: ["eat","oath"]
+
+**Note**:
+
+1. All inputs are consist of lowercase letters `a-z`.
+2. The values of `words` are distinct.
+
+## 题目大意
+
+给定一个二维网格 board 和一个字典中的单词列表 words，找出所有同时在二维网格和字典中出现的单词。
+
+单词必须按照字母顺序，通过相邻的单元格内的字母构成，其中“相邻”单元格是那些水平相邻或垂直相邻的单元格。同一个单元格内的字母在一个单词中不允许被重复使用。
+
+
+## 解题思路
+
+- 这一题是第 79 题的加强版，在第 79 题的基础上增加了一个 word 数组，要求找出所有出现在地图中的单词。思路还是可以按照第 79 题 DFS 搜索，不过时间复杂度特别高！
+- 想想更优的解法。
+
+
+## 代码
+
+```go
+
+package leetcode
+
+func findWords(board [][]byte, words []string) []string {
+ res := []string{}
+ for _, v := range words {
+ if exist(board, v) {
+ res = append(res, v)
+ }
+ }
+ return res
+}
+
+// these is 79 solution
+var dir = [][]int{
+ {-1, 0},
+ {0, 1},
+ {1, 0},
+ {0, -1},
+}
+
+func exist(board [][]byte, word string) bool {
+ visited := make([][]bool, len(board))
+ for i := 0; i < len(visited); i++ {
+ visited[i] = make([]bool, len(board[0]))
+ }
+ for i, v := range board {
+ for j := range v {
+ if searchWord(board, visited, word, 0, i, j) {
+ return true
+ }
+ }
+ }
+ return false
+}
+
+func isInBoard(board [][]byte, x, y int) bool {
+ return x >= 0 && x < len(board) && y >= 0 && y < len(board[0])
+}
+
+func searchWord(board [][]byte, visited [][]bool, word string, index, x, y int) bool {
+ if index == len(word)-1 {
+ return board[x][y] == word[index]
+ }
+ if board[x][y] == word[index] {
+ visited[x][y] = true
+ for i := 0; i < 4; i++ {
+ nx := x + dir[i][0]
+ ny := y + dir[i][1]
+ if isInBoard(board, nx, ny) && !visited[nx][ny] && searchWord(board, visited, word, index+1, nx, ny) {
+ return true
+ }
+ }
+ visited[x][y] = false
+ }
+ return false
+}
+
+
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0200~0299/0211.Design-Add-and-Search-Words-Data-Structure/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0200~0299/0213.House-Robber-II/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0213.House-Robber-II.md b/website/content/ChapterFour/0200~0299/0213.House-Robber-II.md
similarity index 87%
rename from website/content/ChapterFour/0213.House-Robber-II.md
rename to website/content/ChapterFour/0200~0299/0213.House-Robber-II.md
index b53c02f67..e108507ba 100755
--- a/website/content/ChapterFour/0213.House-Robber-II.md
+++ b/website/content/ChapterFour/0200~0299/0213.House-Robber-II.md
@@ -67,4 +67,11 @@ func rob213_1(nums []int, start, end int) int {
return curMax
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0200~0299/0212.Word-Search-II/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0200~0299/0215.Kth-Largest-Element-in-an-Array/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0200~0299/0215.Kth-Largest-Element-in-an-Array.md b/website/content/ChapterFour/0200~0299/0215.Kth-Largest-Element-in-an-Array.md
new file mode 100644
index 000000000..0213a51c2
--- /dev/null
+++ b/website/content/ChapterFour/0200~0299/0215.Kth-Largest-Element-in-an-Array.md
@@ -0,0 +1,125 @@
+# [215. Kth Largest Element in an Array](https://leetcode.com/problems/kth-largest-element-in-an-array/)
+
+## 题目
+
+Find the kth largest element in an unsorted array. Note that it is the kth largest element in the sorted order, not the kth distinct element.
+
+**Example 1**:
+
+```
+
+Input: [3,2,1,5,6,4] and k = 2
+Output: 5
+
+```
+
+**Example 2**:
+
+```
+
+Input: [3,2,3,1,2,4,5,5,6] and k = 4
+Output: 4
+
+```
+
+**Note**:
+
+You may assume k is always valid, 1 ≤ k ≤ array's length.
+
+
+## 题目大意
+
+找出数组中第 K 大的元素。这一题非常经典。可以用 O(n) 的时间复杂度实现。
+
+## 解题思路
+
+- 在快速选择 quickselect 的 partition 操作中，每次 partition 操作结束都会返回一个点，这个标定点的下标和最终排序之后有序数组中这个元素所在的下标是一致的。利用这个特性，我们可以不断的划分数组区间，最终找到第 K 大的元素。执行一次 partition 操作以后，如果这个元素的下标比 K 小，那么接着就在后边的区间继续执行 partition 操作；如果这个元素的下标比 K 大，那么就在左边的区间继续执行 partition 操作；如果相等就直接输出这个下标对应的数组元素即可。
+- 快速选择 quickselect 的思路实现的算法时间复杂度为 O(n)，空间复杂度为 O(logn)。由于证明过程很繁琐，所以不再这里展开讲。具体证明可以参考《算法导论》第 9 章第 2 小节。
+
+
+## 代码
+
+```go
+
+package leetcode
+
+import (
+ "math/rand"
+ "sort"
+)
+
+// 解法一 排序，排序的方法反而速度是最快的
+func findKthLargest1(nums []int, k int) int {
+ sort.Ints(nums)
+ return nums[len(nums)-k]
+}
+
+// 解法二 这个方法的理论依据是 partition 得到的点的下标就是最终排序之后的下标，根据这个下标，我们可以判断第 K 大的数在哪里
+// 时间复杂度 O(n)，空间复杂度 O(log n)，最坏时间复杂度为 O(n^2)，空间复杂度 O(n)
+func findKthLargest(nums []int, k int) int {
+ m := len(nums) - k + 1 // mth smallest, from 1..len(nums)
+ return selectSmallest(nums, 0, len(nums)-1, m)
+}
+
+func selectSmallest(nums []int, l, r, i int) int {
+ if l >= r {
+ return nums[l]
+ }
+ q := partition(nums, l, r)
+ k := q - l + 1
+ if k == i {
+ return nums[q]
+ }
+ if i < k {
+ return selectSmallest(nums, l, q-1, i)
+ } else {
+ return selectSmallest(nums, q+1, r, i-k)
+ }
+}
+
+func partition(nums []int, l, r int) int {
+ k := l + rand.Intn(r-l+1) // 此处为优化，使得时间复杂度期望降为 O(n)，最坏时间复杂度为 O(n^2)
+ nums[k], nums[r] = nums[r], nums[k]
+ i := l - 1
+ // nums[l..i] <= nums[r]
+ // nums[i+1..j-1] > nums[r]
+ for j := l; j < r; j++ {
+ if nums[j] <= nums[r] {
+ i++
+ nums[i], nums[j] = nums[j], nums[i]
+ }
+ }
+ nums[i+1], nums[r] = nums[r], nums[i+1]
+ return i + 1
+}
+
+// 扩展题 剑指 Offer 40. 最小的 k 个数
+func getLeastNumbers(arr []int, k int) []int {
+ return selectSmallest1(arr, 0, len(arr)-1, k)[:k]
+}
+
+// 和 selectSmallest 实现完全一致，只是返回值不用再截取了，直接返回 nums 即可
+func selectSmallest1(nums []int, l, r, i int) []int {
+ if l >= r {
+ return nums
+ }
+ q := partition(nums, l, r)
+ k := q - l + 1
+ if k == i {
+ return nums
+ }
+ if i < k {
+ return selectSmallest1(nums, l, q-1, i)
+ } else {
+ return selectSmallest1(nums, q+1, r, i-k)
+ }
+}
+
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0200~0299/0213.House-Robber-II/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0200~0299/0216.Combination-Sum-III/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0216.Combination-Sum-III.md b/website/content/ChapterFour/0200~0299/0216.Combination-Sum-III.md
similarity index 80%
rename from website/content/ChapterFour/0216.Combination-Sum-III.md
rename to website/content/ChapterFour/0200~0299/0216.Combination-Sum-III.md
index 8aadea35d..c6dbd156b 100755
--- a/website/content/ChapterFour/0216.Combination-Sum-III.md
+++ b/website/content/ChapterFour/0200~0299/0216.Combination-Sum-III.md
@@ -70,4 +70,11 @@ func findcombinationSum3(k, target, index int, c []int, res *[][]int) {
}
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0200~0299/0215.Kth-Largest-Element-in-an-Array/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0200~0299/0217.Contains-Duplicate/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0200~0299/0217.Contains-Duplicate.md b/website/content/ChapterFour/0200~0299/0217.Contains-Duplicate.md
new file mode 100644
index 000000000..ddb948e79
--- /dev/null
+++ b/website/content/ChapterFour/0200~0299/0217.Contains-Duplicate.md
@@ -0,0 +1,69 @@
+# [217. Contains Duplicate](https://leetcode.com/problems/contains-duplicate/)
+
+## 题目
+
+Given an array of integers, find if the array contains any duplicates.
+
+Your function should return true if any value appears at least twice in the array, and it should return false if every element is distinct.
+
+
+**Example 1**:
+
+```
+
+Input: [1,2,3,1]
+Output: true
+
+```
+**Example 2**:
+
+```
+
+Input: [1,2,3,4]
+Output: false
+
+```
+
+**Example 3**:
+
+```
+
+Input: [1,1,1,3,3,4,3,2,4,2]
+Output: true
+
+```
+
+## 题目大意
+
+这是一道简单题，如果数组里面有重复数字就输出 true，否则输出 flase。
+
+## 解题思路
+
+用 map 判断即可。
+
+
+## 代码
+
+```go
+
+package leetcode
+
+func containsDuplicate(nums []int) bool {
+ record := make(map[int]bool, len(nums))
+ for _, n := range nums {
+ if _, found := record[n]; found {
+ return true
+ }
+ record[n] = true
+ }
+ return false
+}
+
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0200~0299/0216.Combination-Sum-III/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0200~0299/0218.The-Skyline-Problem/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0200~0299/0218.The-Skyline-Problem.md b/website/content/ChapterFour/0200~0299/0218.The-Skyline-Problem.md
new file mode 100755
index 000000000..e563455f6
--- /dev/null
+++ b/website/content/ChapterFour/0200~0299/0218.The-Skyline-Problem.md
@@ -0,0 +1,382 @@
+# [218. The Skyline Problem](https://leetcode.com/problems/the-skyline-problem/)
+
+## 题目
+
+A city's skyline is the outer contour of the silhouette formed by all the buildings in that city when viewed from a distance. Now suppose you are **given the locations and height of all the buildings** as shown on a cityscape photo (Figure A), write a program to **output the skyline** formed by these buildings collectively (Figure B).
+
+
+
+
+
+The geometric information of each building is represented by a triplet of integers `[Li, Ri, Hi]`, where `Li` and `Ri` are the x coordinates of the left and right edge of the ith building, respectively, and `Hi` is its height. It is guaranteed that `0 ≤ Li, Ri ≤ INT_MAX`, `0 < Hi ≤ INT_MAX`, and `Ri - Li > 0`. You may assume all buildings are perfect rectangles grounded on an absolutely flat surface at height 0.
+
+For instance, the dimensions of all buildings in Figure A are recorded as: `[ [2 9 10], [3 7 15], [5 12 12], [15 20 10], [19 24 8] ]` .
+
+The output is a list of "**key points**" (red dots in Figure B) in the format of `[ [x1,y1], [x2, y2], [x3, y3], ... ]` that uniquely defines a skyline. **A key point is the left endpoint of a horizontal line segment**. Note that the last key point, where the rightmost building ends, is merely used to mark the termination of the skyline, and always has zero height. Also, the ground in between any two adjacent buildings should be considered part of the skyline contour.
+
+For instance, the skyline in Figure B should be represented as:`[ [2 10], [3 15], [7 12], [12 0], [15 10], [20 8], [24, 0] ]`.
+
+**Notes**:
+
+- The number of buildings in any input list is guaranteed to be in the range `[0, 10000]`.
+- The input list is already sorted in ascending order by the left x position `Li`.
+- The output list must be sorted by the x position.
+- There must be no consecutive horizontal lines of equal height in the output skyline. For instance, `[...[2 3], [4 5], [7 5], [11 5], [12 7]...]` is not acceptable; the three lines of height 5 should be merged into one in the final output as such: `[...[2 3], [4 5], [12 7], ...]`
+
+
+## 题目大意
+
+城市的天际线是从远处观看该城市中所有建筑物形成的轮廓的外部轮廓。现在，假设您获得了城市风光照片（图A）上显示的所有建筑物的位置和高度，请编写一个程序以输出由这些建筑物形成的天际线（图B）。
+
+每个建筑物的几何信息用三元组 [Li，Ri，Hi] 表示，其中 Li 和 Ri 分别是第 i 座建筑物左右边缘的 x 坐标，Hi 是其高度。可以保证 0 ≤ Li, Ri ≤ INT\_MAX, 0 < Hi ≤ INT\_MAX 和 Ri - Li > 0。您可以假设所有建筑物都是在绝对平坦且高度为 0 的表面上的完美矩形。
+
+例如，图 A 中所有建筑物的尺寸记录为：[ [2 9 10], [3 7 15], [5 12 12], [15 20 10], [19 24 8] ] 。
+
+输出是以 [ [x1,y1], [x2, y2], [x3, y3], ... ] 格式的“关键点”（图 B 中的红点）的列表，它们唯一地定义了天际线。关键点是水平线段的左端点。请注意，最右侧建筑物的最后一个关键点仅用于标记天际线的终点，并始终为零高度。此外，任何两个相邻建筑物之间的地面都应被视为天际线轮廓的一部分。
+
+例如，图 B 中的天际线应该表示为：[ [2 10], [3 15], [7 12], [12 0], [15 10], [20 8], [24, 0] ]。
+
+说明:
+
+- 任何输入列表中的建筑物数量保证在 [0, 10000] 范围内。
+- 输入列表已经按左 x 坐标 Li 进行升序排列。
+- 输出列表必须按 x 位排序。
+- 输出天际线中不得有连续的相同高度的水平线。例如 [...[2 3], [4 5], [7 5], [11 5], [12 7]...] 是不正确的答案；三条高度为 5 的线应该在最终输出中合并为一个：[...[2 3], [4 5], [12 7], ...]
+
+
+## 解题思路
+
+
+- 给出一个二维数组，每个子数组里面代表一个高楼的信息，一个高楼的信息包含 3 个信息，高楼起始坐标，高楼终止坐标，高楼高度。要求找到这些高楼的边际点，并输出这些边际点的高度信息。
+- 这一题可以用树状数组来解答。要求天际线，即找到楼与楼重叠区间外边缘的线，说白了是维护各个区间内的最值。这有 2 个需要解决的问题。
+ 1. 如何维护最值。当一个高楼的右边界消失，剩下的各个小楼间还需要选出最大值作为天际线。剩下重重叠叠的小楼很多，树状数组如何维护区间最值是解决此类题的关键。
+ 2. 如何维护天际线的转折点。有些楼与楼并非完全重叠，重叠一半的情况导致天际线出现转折点。如上图中标记的红色转折点。树状数组如何维护这些点呢？
+- 先解决第一个问题(维护最值)。树状数组只有 2 个操作，一个是 Add() 一个是 Query()。从上面关于这 2 个操作的讲解中可以知道这 2 个操作都不能满足我们的需求。Add() 操作可以改成维护区间内 max() 的操作。但是 max() 容易获得却很难“去除”。如上图 [3,7] 这个区间内的最大值是 15。根据树状数组的定义，[3,12] 这个区间内最值还是 15。观察上图可以看到 [5,12] 区间内最值其实是 12。树状数组如何维护这种最值呢？最大值既然难以“去除”，那么需要考虑如何让最大值“来的晚一点”。解决办法是将 Query() 操作含义从前缀含义改成后缀含义。Query(i) 查询区间是 [1,i]，现在查询区间变成 {{< katex >}}[i,+\infty){{< /katex >}}。例如：[i,j] 区间内最值是 {{< katex >}}max_{i...j}{{< /katex >}}，Query(j+1) 的结果不会包含 {{< katex >}}max_{i...j}{{< /katex >}}，因为它查询的区间是 {{< katex >}}[j+1,+\infty){{< /katex >}}。这样更改以后，可以有效避免前驱高楼对后面楼的累积 max() 最值的影响。具体做法，将 x 轴上的各个区间排序，按照 x 值大小从小到大排序。从左往右依次遍历各个区间。Add() 操作含义是加入每个区间右边界代表后缀区间的最值。这样不需要考虑“移除”最值的问题了。细心的读者可能又有疑问了：能否从右往左遍历区间，Query() 的含义继续延续前缀区间？这样做是可行的，解决第一个问题(维护最值)是可以的。但是这种处理办法解决第二个问题(维护转折点)会遇到麻烦。
+- 再解决第二个问题(维护转折点)。如果用前缀含义的 Query()，在单点 i 上除了考虑以这个点为结束点的区间，还需要考虑以这个单点 i 为起点的区间。如果是后缀含义的 Query() 就没有这个问题了，{{< katex >}}[i+1,+\infty){{< /katex >}} 这个区间内不用考虑以单点 i 为结束点的区间。此题用树状数组代码实现见下面解法一。
+- 这一题也可以用线段树来解。用线段树来解答，可以不用关心“楼挡住楼”的情况。由于楼的坐标是离散的，所以先把楼在 X 轴上两个坐标离散化。同第 699 题一样，楼的宽度是一个区间，但是离散的过程中，楼的宽度右边界需要减一，不然查询一个区间会包含两个点，导致错误的结果，例如，第一个楼是 [1,3)，楼高 10，第二个楼是 [3,6)，楼高 20 。第一个楼如果算上右边界 3，查询 [1,3] 的结果是 20，因为 [3,3] 这个点会查询到第二个楼上面去。所以每个楼的右边界应该减一。但是每个楼的右边界也要加入到 query 中，因为最终 query 的结果需要包含这些边界。将离散的数据排序以后，按照楼的信息，每个区间依次 update。最后统计的时候依次统计每个区间，如果当前区间的高度和前一个区间的高度一样，就算是等高的楼。当高度与前一个高度不相同的时候就算是天际线的边缘，就要添加到最后输出数组中。
+- 类似的线段树的题目有：第 715 题，第 732 题，第 699 题。第 715 题是区间更新定值(**不是增减**)，第 218 题可以用扫描线，第 732 题和第 699 题类似，也是俄罗斯方块的题目，但是第 732 题的俄罗斯方块的方块会“断裂”。
+- 这一题用线段树做时间复杂度有点高，可以用扫描线解题。扫描线的思路很简单，用一根根垂直于 X 轴的竖线，从最左边依次扫到最右边，扫描每一条大楼的边界，当进入大楼的左边界的时候，如果没有比这个左边界最高点更高的点，就记录下这个最高点 keyPoint，状态是进入状态。如果扫到一个大楼的左边界，有比它更高的高度，就不记录，因为它不是天际线，它被楼挡楼，挡在其他楼后面了。当扫到一个大楼的右边界的时候，如果是最高点，那么记录下它的状态是离开状态，此时还需要记录下第二高的点。在扫描线扫描的过程中，动态的维护大楼的高度，同时维护最高的高度和第二高的高度。其实只需要维护最高的高度这一个高度，因为当离开状态到来的时候，移除掉当前最高的，剩下的高度里面最高的就是第二高的高度。描述的伪代码如下：
+
+ // 扫描线伪代码
+ events = {{x: L , height: H , type: entering},
+ {x: R , height: H , type: leaving}}
+ event.SortByX()
+ ds = new DS()
+
+ for e in events:
+ if entering(e):
+ if e.height > ds.max(): ans += [e.height]
+ ds.add(e.height)
+ if leaving(e):
+ ds.remove(e.height)
+ if e.height > ds.max(): ans += [ds.max()]
+
+- 动态插入，查找最大值可以选用的数据结构有，最大堆和二叉搜索树。最大堆找最大值 O(1)，插入 O(log n)，但是 remove_by_key 需要 O(n) 的时间复杂度，并且需要自己实现。二叉搜索树，查找 max，添加和删除元素都是 O(log n) 的时间复杂度。
+- 排序的时候也需要注意几个问题：如果大楼的边界相等，并且是进入状态，那么再按照高度从大到小进行排序；如果大楼的边界相等，并且是离开状态，那么高度按照从小到大进行排序。
+
+
+## 代码
+
+```go
+
+package leetcode
+
+import (
+ "sort"
+
+ "github.com/halfrost/leetcode-go/template"
+)
+
+// 解法一 树状数组，时间复杂度 O(n log n)
+const LEFTSIDE = 1
+const RIGHTSIDE = 2
+
+type Point struct {
+ xAxis int
+ side int
+ index int
+}
+
+func getSkyline(buildings [][]int) [][]int {
+ res := [][]int{}
+ if len(buildings) == 0 {
+ return res
+ }
+ allPoints, bit := make([]Point, 0), BinaryIndexedTree{}
+ // [x-axis (value), [1 (left) | 2 (right)], index (building number)]
+ for i, b := range buildings {
+ allPoints = append(allPoints, Point{xAxis: b[0], side: LEFTSIDE, index: i})
+ allPoints = append(allPoints, Point{xAxis: b[1], side: RIGHTSIDE, index: i})
+ }
+ sort.Slice(allPoints, func(i, j int) bool {
+ if allPoints[i].xAxis == allPoints[j].xAxis {
+ return allPoints[i].side < allPoints[j].side
+ }
+ return allPoints[i].xAxis < allPoints[j].xAxis
+ })
+ bit.Init(len(allPoints))
+ kth := make(map[Point]int)
+ for i := 0; i < len(allPoints); i++ {
+ kth[allPoints[i]] = i
+ }
+ for i := 0; i < len(allPoints); i++ {
+ pt := allPoints[i]
+ if pt.side == LEFTSIDE {
+ bit.Add(kth[Point{xAxis: buildings[pt.index][1], side: RIGHTSIDE, index: pt.index}], buildings[pt.index][2])
+ }
+ currHeight := bit.Query(kth[pt] + 1)
+ if len(res) == 0 || res[len(res)-1][1] != currHeight {
+ if len(res) > 0 && res[len(res)-1][0] == pt.xAxis {
+ res[len(res)-1][1] = currHeight
+ } else {
+ res = append(res, []int{pt.xAxis, currHeight})
+ }
+ }
+ }
+ return res
+}
+
+type BinaryIndexedTree struct {
+ tree []int
+ capacity int
+}
+
+// Init define
+func (bit *BinaryIndexedTree) Init(capacity int) {
+ bit.tree, bit.capacity = make([]int, capacity+1), capacity
+}
+
+// Add define
+func (bit *BinaryIndexedTree) Add(index int, val int) {
+ for ; index > 0; index -= index & -index {
+ bit.tree[index] = max(bit.tree[index], val)
+ }
+}
+
+// Query define
+func (bit *BinaryIndexedTree) Query(index int) int {
+ sum := 0
+ for ; index <= bit.capacity; index += index & -index {
+ sum = max(sum, bit.tree[index])
+ }
+ return sum
+}
+
+// 解法二 线段树 Segment Tree，时间复杂度 O(n log n)
+func getSkyline1(buildings [][]int) [][]int {
+ st, ans, lastHeight, check := template.SegmentTree{}, [][]int{}, 0, false
+ posMap, pos := discretization218(buildings)
+ tmp := make([]int, len(posMap))
+ st.Init(tmp, func(i, j int) int {
+ return max(i, j)
+ })
+ for _, b := range buildings {
+ st.UpdateLazy(posMap[b[0]], posMap[b[1]-1], b[2])
+ }
+ for i := 0; i < len(pos); i++ {
+ h := st.QueryLazy(posMap[pos[i]], posMap[pos[i]])
+ if check == false && h != 0 {
+ ans = append(ans, []int{pos[i], h})
+ check = true
+ } else if i > 0 && h != lastHeight {
+ ans = append(ans, []int{pos[i], h})
+ }
+ lastHeight = h
+ }
+ return ans
+}
+
+func discretization218(positions [][]int) (map[int]int, []int) {
+ tmpMap, posArray, posMap := map[int]int{}, []int{}, map[int]int{}
+ for _, pos := range positions {
+ tmpMap[pos[0]]++
+ tmpMap[pos[1]-1]++
+ tmpMap[pos[1]]++
+ }
+ for k := range tmpMap {
+ posArray = append(posArray, k)
+ }
+ sort.Ints(posArray)
+ for i, pos := range posArray {
+ posMap[pos] = i
+ }
+ return posMap, posArray
+}
+
+func max(a int, b int) int {
+ if a > b {
+ return a
+ }
+ return b
+}
+
+// 解法三 扫描线 Sweep Line，时间复杂度 O(n log n)
+func getSkyline2(buildings [][]int) [][]int {
+ size := len(buildings)
+ es := make([]E, 0)
+ for i, b := range buildings {
+ l := b[0]
+ r := b[1]
+ h := b[2]
+ // 1-- enter
+ el := NewE(i, l, h, 0)
+ es = append(es, el)
+ // 0 -- leave
+ er := NewE(i, r, h, 1)
+ es = append(es, er)
+ }
+ skyline := make([][]int, 0)
+ sort.Slice(es, func(i, j int) bool {
+ if es[i].X == es[j].X {
+ if es[i].T == es[j].T {
+ if es[i].T == 0 {
+ return es[i].H > es[j].H
+ }
+ return es[i].H < es[j].H
+ }
+ return es[i].T < es[j].T
+ }
+ return es[i].X < es[j].X
+ })
+ pq := NewIndexMaxPQ(size)
+ for _, e := range es {
+ curH := pq.Front()
+ if e.T == 0 {
+ if e.H > curH {
+ skyline = append(skyline, []int{e.X, e.H})
+ }
+ pq.Enque(e.N, e.H)
+ } else {
+ pq.Remove(e.N)
+ h := pq.Front()
+ if curH > h {
+ skyline = append(skyline, []int{e.X, h})
+ }
+ }
+ }
+ return skyline
+}
+
+// 扫面线伪代码
+// events = {{x: L , height: H , type: entering},
+// {x: R , height: H , type: leaving}}
+// event.SortByX()
+// ds = new DS()
+
+// for e in events:
+// if entering(e):
+// if e.height > ds.max(): ans += [e.height]
+// ds.add(e.height)
+// if leaving(e):
+// ds.remove(e.height)
+// if e.height > ds.max(): ans += [ds.max()]
+
+// E define
+type E struct { // 定义一个 event 事件
+ N int // number 编号
+ X int // x 坐标
+ H int // height 高度
+ T int // type 0-进入 1-离开
+}
+
+// NewE define
+func NewE(n, x, h, t int) E {
+ return E{
+ N: n,
+ X: x,
+ H: h,
+ T: t,
+ }
+}
+
+// IndexMaxPQ define
+type IndexMaxPQ struct {
+ items []int
+ pq []int
+ qp []int
+ total int
+}
+
+// NewIndexMaxPQ define
+func NewIndexMaxPQ(n int) IndexMaxPQ {
+ qp := make([]int, n)
+ for i := 0; i < n; i++ {
+ qp[i] = -1
+ }
+ return IndexMaxPQ{
+ items: make([]int, n),
+ pq: make([]int, n+1),
+ qp: qp,
+ }
+}
+
+// Enque define
+func (q *IndexMaxPQ) Enque(key, val int) {
+ q.total++
+ q.items[key] = val
+ q.pq[q.total] = key
+ q.qp[key] = q.total
+ q.swim(q.total)
+}
+
+// Front define
+func (q *IndexMaxPQ) Front() int {
+ if q.total < 1 {
+ return 0
+ }
+ return q.items[q.pq[1]]
+}
+
+// Remove define
+func (q *IndexMaxPQ) Remove(key int) {
+ rank := q.qp[key]
+ q.exch(rank, q.total)
+ q.total--
+ q.qp[key] = -1
+ q.sink(rank)
+}
+
+func (q *IndexMaxPQ) sink(n int) {
+ for 2*n <= q.total {
+ k := 2 * n
+ if k < q.total && q.less(k, k+1) {
+ k++
+ }
+ if q.less(k, n) {
+ break
+ }
+ q.exch(k, n)
+ n = k
+ }
+}
+
+func (q *IndexMaxPQ) swim(n int) {
+ for n > 1 {
+ k := n / 2
+ if q.less(n, k) {
+ break
+ }
+ q.exch(n, k)
+ n = k
+ }
+}
+
+func (q *IndexMaxPQ) exch(i, j int) {
+ q.pq[i], q.pq[j] = q.pq[j], q.pq[i]
+ q.qp[q.pq[i]] = i
+ q.qp[q.pq[j]] = j
+}
+
+func (q *IndexMaxPQ) less(i, j int) bool {
+ return q.items[q.pq[i]] < q.items[q.pq[j]]
+}
+
+
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0200~0299/0217.Contains-Duplicate/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0200~0299/0219.Contains-Duplicate-II/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0219.Contains-Duplicate-II.md b/website/content/ChapterFour/0200~0299/0219.Contains-Duplicate-II.md
similarity index 78%
rename from website/content/ChapterFour/0219.Contains-Duplicate-II.md
rename to website/content/ChapterFour/0200~0299/0219.Contains-Duplicate-II.md
index 8cf856a37..c40808250 100644
--- a/website/content/ChapterFour/0219.Contains-Duplicate-II.md
+++ b/website/content/ChapterFour/0200~0299/0219.Contains-Duplicate-II.md
@@ -66,4 +66,11 @@ func containsNearbyDuplicate(nums []int, k int) bool {
return false
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0200~0299/0218.The-Skyline-Problem/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0200~0299/0220.Contains-Duplicate-III/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0200~0299/0220.Contains-Duplicate-III.md b/website/content/ChapterFour/0200~0299/0220.Contains-Duplicate-III.md
new file mode 100644
index 000000000..b26d478fc
--- /dev/null
+++ b/website/content/ChapterFour/0200~0299/0220.Contains-Duplicate-III.md
@@ -0,0 +1,112 @@
+# [220. Contains Duplicate III](https://leetcode.com/problems/contains-duplicate-iii/)
+
+## 题目
+
+Given an array of integers, find out whether there are two distinct indices i and j in the array such that the **absolute** difference between **nums[i]** and **nums[j]** is at most t and the **absolute** difference between i and j is at most k.
+
+**Example 1**:
+
+ Input: nums = [1,2,3,1], k = 3, t = 0
+ Output: true
+
+**Example 2**:
+
+ Input: nums = [1,0,1,1], k = 1, t = 2
+ Output: true
+
+**Example 3**:
+
+ Input: nums = [1,5,9,1,5,9], k = 2, t = 3
+ Output: false
+
+
+
+
+## 题目大意
+
+给出一个数组 num，再给 K 和 t。问在 num 中能否找到一组 i 和 j，使得 num[i] 和 num[j] 的绝对差值最大为 t，并且 i 和 j 之前的绝对差值最大为 k。
+
+## 解题思路
+
+
+- 给出一个数组，要求在数组里面找到 2 个索引，`i` 和 `j`，使得 `| nums[i] - nums[j] | ≤ t` ，并且 `| i - j | ≤ k` 。
+- 这是一道滑动窗口的题目。第一想法就是用 `i` 和 `j` 两个指针，针对每个 `i` ，都从 `i + 1` 往后扫完整个数组，判断每个 `i` 和 `j` ，判断是否满足题意。`j` 在循环的过程中注意判断剪枝条件 `| i - j | ≤ k`。这个做法的时间复杂度是 O(n^2)。这个做法慢的原因在于滑动窗口的左边界和右边界在滑动过程中不是联动滑动的。
+- 于是考虑，如果数组是有序的呢？把数组按照元素值从小到大进行排序，如果元素值相等，就按照 index 从小到大进行排序。在这样有序的数组中找满足题意的 `i` 和 `j`，滑动窗口左边界和右边界就是联动的了。窗口的右边界滑到与左边界元素值的差值 ≤ t 的地方，满足了这个条件再判断 `| i - j | ≤ k`，如果右边界与左边界元素值的差值 > t 了，说明该把左边界往右移动了(能这样移动的原因就是因为我们将数组元素大小排序了，右移是增大元素的方向)。移动左边界的时候需要注意左边界不能超过右边界。这样滑动窗口一次滑过整个排序后的数组，就可以判断是否存在满足题意的 `i` 和 `j` 。这个做法的时间主要花在排序上了，时间复杂度是 O(n log n)。
+- 本题最优解是利用桶排序的思想。`| i - j | ≤ k` 这个条件利用一个窗口大小为 k 来维护。重点在 `| nums[i] - nums[j] | ≤ t` 这个条件如何满足。利用桶排序的思想，将 `nums[i]` 所有元素分为 ...,`[0,t]`,`[t+1,2t+1]`,...。每个区间的大小为 `t + 1`。每个元素现在都对应一个桶编号。进行 3 次查找即可确定能否找到满足这个 `| nums[i] - nums[j] | ≤ t` 条件的数对。如果在相同的桶中找到了元素，那么说明能找到这样的 i 和 j。还有 2 种可能对应桶边界的情况。如果存在前一个桶中的元素能使得相差的值也 `≤ t`，这样的数对同样满足题意。最后一种情况是，如果存在后一个桶中的元素能使得相差的值也 `≤ t`，这样的数对同样满足题意。查询 3 次，如果都不存在，说明当前的 i 找不到满足题意的 j。继续循环寻找。循环一遍都找不到满足题意的数对，输出 false。
+
+
+## 代码
+
+```go
+
+package leetcode
+
+// 解法一 桶排序
+func containsNearbyAlmostDuplicate(nums []int, k int, t int) bool {
+ if k <= 0 || t < 0 || len(nums) < 2 {
+ return false
+ }
+ buckets := map[int]int{}
+ for i := 0; i < len(nums); i++ {
+ // Get the ID of the bucket from element value nums[i] and bucket width t + 1
+ key := nums[i] / (t + 1)
+ // -7/9 = 0, but need -7/9 = -1
+ if nums[i] < 0 {
+ key--
+ }
+ if _, ok := buckets[key]; ok {
+ return true
+ }
+ // check the lower bucket, and have to check the value too
+ if v, ok := buckets[key-1]; ok && nums[i]-v <= t {
+ return true
+ }
+ // check the upper bucket, and have to check the value too
+ if v, ok := buckets[key+1]; ok && v-nums[i] <= t {
+ return true
+ }
+ // maintain k size of window
+ if len(buckets) >= k {
+ delete(buckets, nums[i-k]/(t+1))
+ }
+ buckets[key] = nums[i]
+ }
+ return false
+}
+
+func abs(a int) int {
+ if a > 0 {
+ return a
+ }
+ return -a
+}
+
+// 解法二 滑动窗口 + 剪枝
+func containsNearbyAlmostDuplicate1(nums []int, k int, t int) bool {
+ if len(nums) <= 1 {
+ return false
+ }
+ if k <= 0 {
+ return false
+ }
+ n := len(nums)
+ for i := 0; i < n; i++ {
+ count := 0
+ for j := i + 1; j < n && count < k; j++ {
+ if abs(nums[i]-nums[j]) <= t {
+ return true
+ }
+ count++
+ }
+ }
+ return false
+}
+
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0200~0299/0219.Contains-Duplicate-II/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0200~0299/0222.Count-Complete-Tree-Nodes/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0222.Count-Complete-Tree-Nodes.md b/website/content/ChapterFour/0200~0299/0222.Count-Complete-Tree-Nodes.md
similarity index 78%
rename from website/content/ChapterFour/0222.Count-Complete-Tree-Nodes.md
rename to website/content/ChapterFour/0200~0299/0222.Count-Complete-Tree-Nodes.md
index b2a21ebeb..a7f148ba7 100644
--- a/website/content/ChapterFour/0222.Count-Complete-Tree-Nodes.md
+++ b/website/content/ChapterFour/0200~0299/0222.Count-Complete-Tree-Nodes.md
@@ -79,4 +79,11 @@ func countNodes(root *TreeNode) int {
return res
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0200~0299/0220.Contains-Duplicate-III/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0200~0299/0223.Rectangle-Area/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0223.Rectangle-Area.md b/website/content/ChapterFour/0200~0299/0223.Rectangle-Area.md
similarity index 78%
rename from website/content/ChapterFour/0223.Rectangle-Area.md
rename to website/content/ChapterFour/0200~0299/0223.Rectangle-Area.md
index 08d9c64dd..a85324ad1 100755
--- a/website/content/ChapterFour/0223.Rectangle-Area.md
+++ b/website/content/ChapterFour/0200~0299/0223.Rectangle-Area.md
@@ -50,4 +50,11 @@ func area(x0, y0, x1, y1 int) int {
return l * h
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0200~0299/0222.Count-Complete-Tree-Nodes/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0200~0299/0224.Basic-Calculator/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0224.Basic-Calculator.md b/website/content/ChapterFour/0200~0299/0224.Basic-Calculator.md
similarity index 90%
rename from website/content/ChapterFour/0224.Basic-Calculator.md
rename to website/content/ChapterFour/0200~0299/0224.Basic-Calculator.md
index 5861726a7..3ae0cccf2 100755
--- a/website/content/ChapterFour/0224.Basic-Calculator.md
+++ b/website/content/ChapterFour/0200~0299/0224.Basic-Calculator.md
@@ -162,4 +162,11 @@ func isDigital(v byte) bool {
return false
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0200~0299/0223.Rectangle-Area/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0200~0299/0225.Implement-Stack-using-Queues/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0225.Implement-Stack-using-Queues.md b/website/content/ChapterFour/0200~0299/0225.Implement-Stack-using-Queues.md
similarity index 84%
rename from website/content/ChapterFour/0225.Implement-Stack-using-Queues.md
rename to website/content/ChapterFour/0200~0299/0225.Implement-Stack-using-Queues.md
index 11ef48664..47b8177c3 100644
--- a/website/content/ChapterFour/0225.Implement-Stack-using-Queues.md
+++ b/website/content/ChapterFour/0200~0299/0225.Implement-Stack-using-Queues.md
@@ -92,4 +92,11 @@ func (this *MyStack) Empty() bool {
return false
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0200~0299/0224.Basic-Calculator/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0200~0299/0226.Invert-Binary-Tree/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0200~0299/0226.Invert-Binary-Tree.md b/website/content/ChapterFour/0200~0299/0226.Invert-Binary-Tree.md
new file mode 100644
index 000000000..d9f53c25f
--- /dev/null
+++ b/website/content/ChapterFour/0200~0299/0226.Invert-Binary-Tree.md
@@ -0,0 +1,83 @@
+# [226. Invert Binary Tree](https://leetcode.com/problems/invert-binary-tree/)
+
+## 题目
+
+Invert a binary tree.
+
+**Example**:
+
+Input:
+
+```
+
+ 4
+ / \
+ 2 7
+ / \ / \
+1 3 6 9
+
+```
+
+Output:
+
+```
+
+ 4
+ / \
+ 7 2
+ / \ / \
+9 6 3 1
+
+```
+
+Trivia:
+
+This problem was inspired by this original tweet by Max Howell:
+
+>Google: 90% of our engineers use the software you wrote (Homebrew), but you can’t invert a binary tree on a whiteboard so f*** off.
+
+
+## 题目大意
+
+"经典"的反转二叉树的问题。
+
+
+## 解题思路
+
+还是用递归来解决，先递归调用反转根节点的左孩子，然后递归调用反转根节点的右孩子，然后左右交换根节点的左孩子和右孩子。
+
+
+
+
+## 代码
+
+```go
+
+package leetcode
+
+/**
+ * Definition for a binary tree node.
+ * type TreeNode struct {
+ * Val int
+ * Left *TreeNode
+ * Right *TreeNode
+ * }
+ */
+func invertTree(root *TreeNode) *TreeNode {
+ if root == nil {
+ return nil
+ }
+ invertTree(root.Left)
+ invertTree(root.Right)
+ root.Left, root.Right = root.Right, root.Left
+ return root
+}
+
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0200~0299/0225.Implement-Stack-using-Queues/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0200~0299/0227.Basic-Calculator-II/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0200~0299/0227.Basic-Calculator-II.md b/website/content/ChapterFour/0200~0299/0227.Basic-Calculator-II.md
new file mode 100644
index 000000000..d40024449
--- /dev/null
+++ b/website/content/ChapterFour/0200~0299/0227.Basic-Calculator-II.md
@@ -0,0 +1,87 @@
+# [227. Basic Calculator II](https://leetcode.com/problems/basic-calculator-ii/)
+
+
+## 题目
+
+Given a string `s` which represents an expression, *evaluate this expression and return its value*.
+
+The integer division should truncate toward zero.
+
+**Example 1:**
+
+```
+Input: s = "3+2*2"
+Output: 7
+```
+
+**Example 2:**
+
+```
+Input: s = " 3/2 "
+Output: 1
+```
+
+**Example 3:**
+
+```
+Input: s = " 3+5 / 2 "
+Output: 5
+```
+
+**Constraints:**
+
+- `1 <= s.length <= 3 * 10^5`
+- `s` consists of integers and operators `('+', '-', '*', '/')` separated by some number of spaces.
+- `s` represents **a valid expression**.
+- All the integers in the expression are non-negative integers in the range `[0, 2^31 - 1]`.
+- The answer is **guaranteed** to fit in a **32-bit integer**.
+
+## 题目大意
+
+给你一个字符串表达式 `s` ，请你实现一个基本计算器来计算并返回它的值。整数除法仅保留整数部分。
+
+## 解题思路
+
+- 这道题是第 224 题的加强版。第 224 题中只有加减运算和括号，这一题增加了乘除运算。由于乘除运算的优先级高于加减。所以先计算乘除运算，将算出来的结果再替换回原来的算式中。最后只剩下加减运算，于是题目降级成了第 224 题。
+- 把加减运算符号后面的数字压入栈中，遇到乘除运算，直接将它与栈顶的元素计算，并将计算后的结果放入栈顶。若读到一个运算符，或者遍历到字符串末尾，即认为是遍历到了数字末尾。处理完该数字后，更新 `preSign` 为当前遍历的字符。遍历完字符串 `s` 后，将栈中元素累加，即为该字符串表达式的值。时间复杂度 O(n)，空间复杂度 O(n)。
+
+## 代码
+
+```go
+package leetcode
+
+func calculate(s string) int {
+ stack, preSign, num, res := []int{}, '+', 0, 0
+ for i, ch := range s {
+ isDigit := '0' <= ch && ch <= '9'
+ if isDigit {
+ num = num*10 + int(ch-'0')
+ }
+ if !isDigit && ch != ' ' || i == len(s)-1 {
+ switch preSign {
+ case '+':
+ stack = append(stack, num)
+ case '-':
+ stack = append(stack, -num)
+ case '*':
+ stack[len(stack)-1] *= num
+ default:
+ stack[len(stack)-1] /= num
+ }
+ preSign = ch
+ num = 0
+ }
+ }
+ for _, v := range stack {
+ res += v
+ }
+ return res
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0200~0299/0226.Invert-Binary-Tree/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0200~0299/0228.Summary-Ranges/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0200~0299/0228.Summary-Ranges.md b/website/content/ChapterFour/0200~0299/0228.Summary-Ranges.md
new file mode 100644
index 000000000..974e066f2
--- /dev/null
+++ b/website/content/ChapterFour/0200~0299/0228.Summary-Ranges.md
@@ -0,0 +1,115 @@
+# [228. Summary Ranges](https://leetcode.com/problems/summary-ranges/)
+
+
+## 题目
+
+You are given a **sorted unique** integer array `nums`.
+
+Return *the **smallest sorted** list of ranges that **cover all the numbers in the array exactly***. That is, each element of `nums` is covered by exactly one of the ranges, and there is no integer `x` such that `x` is in one of the ranges but not in `nums`.
+
+Each range `[a,b]` in the list should be output as:
+
+- `"a->b"` if `a != b`
+- `"a"` if `a == b`
+
+**Example 1**:
+
+```
+Input: nums = [0,1,2,4,5,7]
+Output: ["0->2","4->5","7"]
+Explanation: The ranges are:
+[0,2] --> "0->2"
+[4,5] --> "4->5"
+[7,7] --> "7"
+
+```
+
+**Example 2**:
+
+```
+Input: nums = [0,2,3,4,6,8,9]
+Output: ["0","2->4","6","8->9"]
+Explanation: The ranges are:
+[0,0] --> "0"
+[2,4] --> "2->4"
+[6,6] --> "6"
+[8,9] --> "8->9"
+
+```
+
+**Example 3**:
+
+```
+Input: nums = []
+Output: []
+
+```
+
+**Example 4**:
+
+```
+Input: nums = [-1]
+Output: ["-1"]
+
+```
+
+**Example 5**:
+
+```
+Input: nums = [0]
+Output: ["0"]
+
+```
+
+**Constraints**:
+
+- `0 <= nums.length <= 20`
+- `231 <= nums[i] <= 231 - 1`
+- All the values of `nums` are **unique**.
+- `nums` is sorted in ascending order.
+
+## 题目大意
+
+给定一个无重复元素的有序整数数组 nums 。
+
+返回 恰好覆盖数组中所有数字 的 最小有序 区间范围列表。也就是说，nums 的每个元素都恰好被某个区间范围所覆盖，并且不存在属于某个范围但不属于 nums 的数字 x 。
+
+列表中的每个区间范围 [a,b] 应该按如下格式输出：
+
+- "a->b" ，如果 a != b
+- "a" ，如果 a == b
+
+## 解题思路
+
+- 简单题。按照题意，用一个游标变量累加寻找连续的区间。一旦出现了中断，就按照题意格式输出。输出的规则有多种，带箭头的区间，单个元素区间，空区间。
+
+## 代码
+
+```go
+package leetcode
+
+import (
+ "strconv"
+)
+
+func summaryRanges(nums []int) (ans []string) {
+ for i, n := 0, len(nums); i < n; {
+ left := i
+ for i++; i < n && nums[i-1]+1 == nums[i]; i++ {
+ }
+ s := strconv.Itoa(nums[left])
+ if left != i-1 {
+ s += "->" + strconv.Itoa(nums[i-1])
+ }
+ ans = append(ans, s)
+ }
+ return
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0200~0299/0227.Basic-Calculator-II/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0200~0299/0229.Majority-Element-II/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0229.Majority-Element-II.md b/website/content/ChapterFour/0200~0299/0229.Majority-Element-II.md
similarity index 86%
rename from website/content/ChapterFour/0229.Majority-Element-II.md
rename to website/content/ChapterFour/0200~0299/0229.Majority-Element-II.md
index ce9260581..fb043de6f 100755
--- a/website/content/ChapterFour/0229.Majority-Element-II.md
+++ b/website/content/ChapterFour/0200~0299/0229.Majority-Element-II.md
@@ -97,4 +97,11 @@ func majorityElement229_1(nums []int) []int {
return result
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0200~0299/0228.Summary-Ranges/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0200~0299/0230.Kth-Smallest-Element-in-a-BST/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0230.Kth-Smallest-Element-in-a-BST.md b/website/content/ChapterFour/0200~0299/0230.Kth-Smallest-Element-in-a-BST.md
similarity index 81%
rename from website/content/ChapterFour/0230.Kth-Smallest-Element-in-a-BST.md
rename to website/content/ChapterFour/0200~0299/0230.Kth-Smallest-Element-in-a-BST.md
index b874e616b..3383a50fb 100755
--- a/website/content/ChapterFour/0230.Kth-Smallest-Element-in-a-BST.md
+++ b/website/content/ChapterFour/0200~0299/0230.Kth-Smallest-Element-in-a-BST.md
@@ -75,4 +75,11 @@ func inorder230(node *TreeNode, k int, count *int, ans *int) {
}
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0200~0299/0229.Majority-Element-II/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0200~0299/0231.Power-of-Two/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0231.Power-of-Two.md b/website/content/ChapterFour/0200~0299/0231.Power-of-Two.md
similarity index 80%
rename from website/content/ChapterFour/0231.Power-of-Two.md
rename to website/content/ChapterFour/0200~0299/0231.Power-of-Two.md
index d2b3d4926..491f55343 100755
--- a/website/content/ChapterFour/0231.Power-of-Two.md
+++ b/website/content/ChapterFour/0200~0299/0231.Power-of-Two.md
@@ -67,4 +67,11 @@ func isPowerOfTwo3(num int) bool {
return num == 1
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0200~0299/0230.Kth-Smallest-Element-in-a-BST/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0200~0299/0232.Implement-Queue-using-Stacks/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0232.Implement-Queue-using-Stacks.md b/website/content/ChapterFour/0200~0299/0232.Implement-Queue-using-Stacks.md
similarity index 85%
rename from website/content/ChapterFour/0232.Implement-Queue-using-Stacks.md
rename to website/content/ChapterFour/0200~0299/0232.Implement-Queue-using-Stacks.md
index fded5d37d..71e5bc148 100644
--- a/website/content/ChapterFour/0232.Implement-Queue-using-Stacks.md
+++ b/website/content/ChapterFour/0200~0299/0232.Implement-Queue-using-Stacks.md
@@ -96,4 +96,11 @@ func (this *MyQueue) fromStackToQueue(s, q *[]int) {
}
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0200~0299/0231.Power-of-Two/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0200~0299/0234.Palindrome-Linked-List/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0200~0299/0234.Palindrome-Linked-List.md b/website/content/ChapterFour/0200~0299/0234.Palindrome-Linked-List.md
new file mode 100644
index 000000000..2870f9571
--- /dev/null
+++ b/website/content/ChapterFour/0200~0299/0234.Palindrome-Linked-List.md
@@ -0,0 +1,138 @@
+# [234. Palindrome Linked List](https://leetcode.com/problems/palindrome-linked-list/)
+
+## 题目
+
+Given a singly linked list, determine if it is a palindrome.
+
+**Example 1**:
+
+```
+
+Input: 1->2
+Output: false
+
+```
+
+**Example 2**:
+
+```
+
+Input: 1->2->2->1
+Output: true
+
+```
+
+**Follow up**:
+
+Could you do it in O(n) time and O(1) space?
+
+## 题目大意
+
+判断一个链表是否是回文链表。要求时间复杂度 O(n)，空间复杂度 O(1)。
+
+## 解题思路
+
+这道题只需要在第 143 题上面改改就可以了。思路是完全一致的。先找到中间结点，然后反转中间结点后面到结尾的所有结点。最后一一判断头结点开始的结点和中间结点往后开始的结点是否相等。如果一直相等，就是回文链表，如果有不相等的，直接返回不是回文链表。
+
+## 代码
+
+```go
+
+package leetcode
+
+import (
+ "github.com/halfrost/leetcode-go/structures"
+)
+
+// ListNode define
+type ListNode = structures.ListNode
+
+/**
+ * Definition for singly-linked list.
+ * type ListNode struct {
+ * Val int
+ * Next *ListNode
+ * }
+ */
+
+// 解法一
+func isPalindrome(head *ListNode) bool {
+ slice := []int{}
+ for head != nil {
+ slice = append(slice, head.Val)
+ head = head.Next
+ }
+ for i, j := 0, len(slice)-1; i < j; {
+ if slice[i] != slice[j] {
+ return false
+ }
+ i++
+ j--
+ }
+ return true
+}
+
+// 解法二
+// 此题和 143 题 Reorder List 思路基本一致
+func isPalindrome1(head *ListNode) bool {
+ if head == nil || head.Next == nil {
+ return true
+ }
+ res := true
+ // 寻找中间结点
+ p1 := head
+ p2 := head
+ for p2.Next != nil && p2.Next.Next != nil {
+ p1 = p1.Next
+ p2 = p2.Next.Next
+ }
+ // 反转链表后半部分 1->2->3->4->5->6 to 1->2->3->6->5->4
+ preMiddle := p1
+ preCurrent := p1.Next
+ for preCurrent.Next != nil {
+ current := preCurrent.Next
+ preCurrent.Next = current.Next
+ current.Next = preMiddle.Next
+ preMiddle.Next = current
+ }
+ // 扫描表，判断是否是回文
+ p1 = head
+ p2 = preMiddle.Next
+ // fmt.Printf("p1 = %v p2 = %v preMiddle = %v head = %v\n", p1.Val, p2.Val, preMiddle.Val, L2ss(head))
+ for p1 != preMiddle {
+ // fmt.Printf("*****p1 = %v p2 = %v preMiddle = %v head = %v\n", p1, p2, preMiddle, L2ss(head))
+ if p1.Val == p2.Val {
+ p1 = p1.Next
+ p2 = p2.Next
+ // fmt.Printf("-------p1 = %v p2 = %v preMiddle = %v head = %v\n", p1, p2, preMiddle, L2ss(head))
+ } else {
+ res = false
+ break
+ }
+ }
+ if p1 == preMiddle {
+ if p2 != nil && p1.Val != p2.Val {
+ return false
+ }
+ }
+ return res
+}
+
+// L2ss define
+func L2ss(head *ListNode) []int {
+ res := []int{}
+ for head != nil {
+ res = append(res, head.Val)
+ head = head.Next
+ }
+ return res
+}
+
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0200~0299/0232.Implement-Queue-using-Stacks/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0200~0299/0235.Lowest-Common-Ancestor-of-a-Binary-Search-Tree/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0235.Lowest-Common-Ancestor-of-a-Binary-Search-Tree.md b/website/content/ChapterFour/0200~0299/0235.Lowest-Common-Ancestor-of-a-Binary-Search-Tree.md
similarity index 84%
rename from website/content/ChapterFour/0235.Lowest-Common-Ancestor-of-a-Binary-Search-Tree.md
rename to website/content/ChapterFour/0200~0299/0235.Lowest-Common-Ancestor-of-a-Binary-Search-Tree.md
index 6cadb8e97..77f6cdbfa 100755
--- a/website/content/ChapterFour/0235.Lowest-Common-Ancestor-of-a-Binary-Search-Tree.md
+++ b/website/content/ChapterFour/0200~0299/0235.Lowest-Common-Ancestor-of-a-Binary-Search-Tree.md
@@ -69,4 +69,11 @@ func lowestCommonAncestor(root, p, q *TreeNode) *TreeNode {
return root
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0200~0299/0234.Palindrome-Linked-List/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0200~0299/0236.Lowest-Common-Ancestor-of-a-Binary-Tree/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0236.Lowest-Common-Ancestor-of-a-Binary-Tree.md b/website/content/ChapterFour/0200~0299/0236.Lowest-Common-Ancestor-of-a-Binary-Tree.md
similarity index 83%
rename from website/content/ChapterFour/0236.Lowest-Common-Ancestor-of-a-Binary-Tree.md
rename to website/content/ChapterFour/0200~0299/0236.Lowest-Common-Ancestor-of-a-Binary-Tree.md
index ccd47234c..302f3f19a 100755
--- a/website/content/ChapterFour/0236.Lowest-Common-Ancestor-of-a-Binary-Tree.md
+++ b/website/content/ChapterFour/0200~0299/0236.Lowest-Common-Ancestor-of-a-Binary-Tree.md
@@ -69,4 +69,11 @@ func lowestCommonAncestor236(root, p, q *TreeNode) *TreeNode {
return right
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0200~0299/0235.Lowest-Common-Ancestor-of-a-Binary-Search-Tree/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0200~0299/0237.Delete-Node-in-a-Linked-List/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0200~0299/0237.Delete-Node-in-a-Linked-List.md b/website/content/ChapterFour/0200~0299/0237.Delete-Node-in-a-Linked-List.md
new file mode 100644
index 000000000..e8690ff52
--- /dev/null
+++ b/website/content/ChapterFour/0200~0299/0237.Delete-Node-in-a-Linked-List.md
@@ -0,0 +1,101 @@
+# [237. Delete Node in a Linked List](https://leetcode.com/problems/delete-node-in-a-linked-list/)
+
+
+## 题目
+
+Write a function to **delete a node** in a singly-linked list. You will **not** be given access to the `head` of the list, instead you will be given access to **the node to be deleted** directly.
+
+It is **guaranteed** that the node to be deleted is **not a tail node** in the list.
+
+**Example 1:**
+
+
+
+```
+Input: head = [4,5,1,9], node = 5
+Output: [4,1,9]
+Explanation:You are given the second node with value 5, the linked list should become 4 -> 1 -> 9 after calling your function.
+
+```
+
+**Example 2:**
+
+
+
+```
+Input: head = [4,5,1,9], node = 1
+Output: [4,5,9]
+Explanation:You are given the third node with value 1, the linked list should become 4 -> 5 -> 9 after calling your function.
+
+```
+
+**Example 3:**
+
+```
+Input: head = [1,2,3,4], node = 3
+Output: [1,2,4]
+
+```
+
+**Example 4:**
+
+```
+Input: head = [0,1], node = 0
+Output: [1]
+
+```
+
+**Example 5:**
+
+```
+Input: head = [-3,5,-99], node = -3
+Output: [5,-99]
+
+```
+
+**Constraints:**
+
+- The number of the nodes in the given list is in the range `[2, 1000]`.
+- `1000 <= Node.val <= 1000`
+- The value of each node in the list is **unique**.
+- The `node` to be deleted is **in the list** and is **not a tail** node
+
+## 题目大意
+
+删除给点结点。没有给链表的头结点。
+
+## 解题思路
+
+其实就是把后面的结点都覆盖上来即可。或者直接当前结点的值等于下一个结点，Next 指针指向下下个结点，这样做也可以，只不过中间有一个结点不被释放，内存消耗多一些。
+
+## 代码
+
+```go
+package leetcode
+
+import (
+ "github.com/halfrost/leetcode-go/structures"
+)
+
+// ListNode define
+type ListNode = structures.ListNode
+
+/**
+ * Definition for singly-linked list.
+ * type ListNode struct {
+ * Val int
+ * Next *ListNode
+ * }
+ */
+func deleteNode(node *ListNode) {
+ node.Val = node.Next.Val
+ node.Next = node.Next.Next
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0200~0299/0236.Lowest-Common-Ancestor-of-a-Binary-Tree/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0200~0299/0239.Sliding-Window-Maximum/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0239.Sliding-Window-Maximum.md b/website/content/ChapterFour/0200~0299/0239.Sliding-Window-Maximum.md
similarity index 88%
rename from website/content/ChapterFour/0239.Sliding-Window-Maximum.md
rename to website/content/ChapterFour/0200~0299/0239.Sliding-Window-Maximum.md
index dd1cd6973..bf2a3a115 100755
--- a/website/content/ChapterFour/0239.Sliding-Window-Maximum.md
+++ b/website/content/ChapterFour/0200~0299/0239.Sliding-Window-Maximum.md
@@ -92,4 +92,11 @@ func maxSlidingWindow(nums []int, k int) []int {
return result
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0200~0299/0237.Delete-Node-in-a-Linked-List/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0200~0299/0240.Search-a-2D-Matrix-II/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0240.Search-a-2D-Matrix-II.md b/website/content/ChapterFour/0200~0299/0240.Search-a-2D-Matrix-II.md
similarity index 88%
rename from website/content/ChapterFour/0240.Search-a-2D-Matrix-II.md
rename to website/content/ChapterFour/0200~0299/0240.Search-a-2D-Matrix-II.md
index d8d92a106..55f99caf8 100755
--- a/website/content/ChapterFour/0240.Search-a-2D-Matrix-II.md
+++ b/website/content/ChapterFour/0200~0299/0240.Search-a-2D-Matrix-II.md
@@ -86,4 +86,11 @@ func searchMatrix2401(matrix [][]int, target int) bool {
return false
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0200~0299/0239.Sliding-Window-Maximum/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0200~0299/0242.Valid-Anagram/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0200~0299/0242.Valid-Anagram.md b/website/content/ChapterFour/0200~0299/0242.Valid-Anagram.md
new file mode 100644
index 000000000..15f171934
--- /dev/null
+++ b/website/content/ChapterFour/0200~0299/0242.Valid-Anagram.md
@@ -0,0 +1,98 @@
+# [242. Valid Anagram](https://leetcode.com/problems/valid-anagram/)
+
+## 题目
+
+Given two strings s and t , write a function to determine if t is an anagram of s.
+
+**Example 1**:
+
+```
+
+Input: s = "anagram", t = "nagaram"
+Output: true
+
+```
+
+**Example 2**:
+
+```
+
+Input: s = "rat", t = "car"
+Output: false
+
+```
+
+**Note**:
+
+
+You may assume the string contains only lowercase alphabets.
+
+
+
+**Follow up**:
+
+
+What if the inputs contain unicode characters? How would you adapt your solution to such case?
+
+## 题目大意
+
+给出 2 个字符串 s 和 t，如果 t 中的字母在 s 中都存在，输出 true，否则输出 false。
+
+## 解题思路
+
+这道题可以用打表的方式做。先把 s 中的每个字母都存在一个 26 个容量的数组里面，每个下标依次对应 26 个字母。s 中每个字母都对应表中一个字母，每出现一次就加 1。然后再扫字符串 t，每出现一个字母就在表里面减一。如果都出现了，最终表里面的值肯定都是 0 。最终判断表里面的值是否都是 0 即可，有非 0 的数都输出 false 。
+
+## 代码
+
+```go
+
+package leetcode
+
+// 解法一
+func isAnagram(s string, t string) bool {
+ alphabet := make([]int, 26)
+ sBytes := []byte(s)
+ tBytes := []byte(t)
+ if len(sBytes) != len(tBytes) {
+ return false
+ }
+ for i := 0; i < len(sBytes); i++ {
+ alphabet[sBytes[i]-'a']++
+ }
+ for i := 0; i < len(tBytes); i++ {
+ alphabet[tBytes[i]-'a']--
+ }
+ for i := 0; i < 26; i++ {
+ if alphabet[i] != 0 {
+ return false
+ }
+ }
+ return true
+}
+
+// 解法二
+func isAnagram1(s string, t string) bool {
+ hash := map[rune]int{}
+ for _, value := range s {
+ hash[value]++
+ }
+ for _, value := range t {
+ hash[value]--
+ }
+ for _, value := range hash {
+ if value != 0 {
+ return false
+ }
+ }
+ return true
+}
+
+
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0200~0299/0240.Search-a-2D-Matrix-II/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0200~0299/0257.Binary-Tree-Paths/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0257.Binary-Tree-Paths.md b/website/content/ChapterFour/0200~0299/0257.Binary-Tree-Paths.md
similarity index 77%
rename from website/content/ChapterFour/0257.Binary-Tree-Paths.md
rename to website/content/ChapterFour/0200~0299/0257.Binary-Tree-Paths.md
index 5ee5f35f6..22b451cee 100755
--- a/website/content/ChapterFour/0257.Binary-Tree-Paths.md
+++ b/website/content/ChapterFour/0200~0299/0257.Binary-Tree-Paths.md
@@ -68,4 +68,11 @@ func binaryTreePaths(root *TreeNode) []string {
return res
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0200~0299/0242.Valid-Anagram/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0200~0299/0258.Add-Digits/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0200~0299/0258.Add-Digits.md b/website/content/ChapterFour/0200~0299/0258.Add-Digits.md
new file mode 100644
index 000000000..4e0770ad8
--- /dev/null
+++ b/website/content/ChapterFour/0200~0299/0258.Add-Digits.md
@@ -0,0 +1,54 @@
+# [258. Add Digits](https://leetcode.com/problems/add-digits/)
+
+
+## 题目
+
+Given a non-negative integer `num`, repeatedly add all its digits until the result has only one digit.
+
+**Example**:
+
+```
+Input: 38
+Output: 2
+Explanation: The process is like: 3 + 8 = 11, 1 + 1 = 2.
+ Since 2 has only one digit, return it.
+```
+
+**Follow up**: Could you do it without any loop/recursion in O(1) runtime?
+
+## 题目大意
+
+给定一个非负整数 num，反复将各个位上的数字相加，直到结果为一位数。
+
+
+## 解题思路
+
+- 给定一个非负整数，反复加各个位上的数，直到结果为一位数为止，最后输出这一位数。
+- 简单题。按照题意循环累加即可。
+
+## 代码
+
+```go
+
+package leetcode
+
+func addDigits(num int) int {
+ for num > 9 {
+ cur := 0
+ for num != 0 {
+ cur += num % 10
+ num /= 10
+ }
+ num = cur
+ }
+ return num
+}
+
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0200~0299/0257.Binary-Tree-Paths/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0200~0299/0260.Single-Number-III/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0260.Single-Number-III.md b/website/content/ChapterFour/0200~0299/0260.Single-Number-III.md
similarity index 84%
rename from website/content/ChapterFour/0260.Single-Number-III.md
rename to website/content/ChapterFour/0200~0299/0260.Single-Number-III.md
index fa8e45b50..ed2a461b5 100755
--- a/website/content/ChapterFour/0260.Single-Number-III.md
+++ b/website/content/ChapterFour/0200~0299/0260.Single-Number-III.md
@@ -58,4 +58,11 @@ func singleNumberIII(nums []int) []int {
return res
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0200~0299/0258.Add-Digits/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0200~0299/0263.Ugly-Number/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0200~0299/0263.Ugly-Number.md b/website/content/ChapterFour/0200~0299/0263.Ugly-Number.md
new file mode 100644
index 000000000..5d2ad1e10
--- /dev/null
+++ b/website/content/ChapterFour/0200~0299/0263.Ugly-Number.md
@@ -0,0 +1,79 @@
+# [263. Ugly Number](https://leetcode.com/problems/ugly-number/)
+
+## 题目
+
+Write a program to check whether a given number is an ugly number.
+
+Ugly numbers are positive numbers whose prime factors only include 2, 3, 5.
+
+**Example 1**:
+
+```
+
+Input: 6
+Output: true
+Explanation: 6 = 2 × 3
+
+```
+
+**Example 2**:
+
+```
+Input: 8
+Output: true
+Explanation: 8 = 2 × 2 × 2
+
+```
+
+**Example 3**:
+
+```
+
+Input: 14
+Output: false
+Explanation: 14 is not ugly since it includes another prime factor 7.
+
+```
+
+**Note**:
+
+- 1 is typically treated as an ugly number.
+- Input is within the 32-bit signed integer range: [−2^31, 2^31 − 1].
+
+
+## 题目大意
+
+判断一个数字是否是“丑陋数字”，“丑陋数字”的定义是一个正数，并且因子只包含 2，3，5 。
+
+## 解题思路
+
+依照题意要求做即可。
+
+
+
+## 代码
+
+```go
+
+package leetcode
+
+func isUgly(num int) bool {
+ if num > 0 {
+ for _, i := range []int{2, 3, 5} {
+ for num%i == 0 {
+ num /= i
+ }
+ }
+ }
+ return num == 1
+}
+
+
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0200~0299/0260.Single-Number-III/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0200~0299/0264.Ugly-Number-II/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0200~0299/0264.Ugly-Number-II.md b/website/content/ChapterFour/0200~0299/0264.Ugly-Number-II.md
new file mode 100644
index 000000000..ff68409f4
--- /dev/null
+++ b/website/content/ChapterFour/0200~0299/0264.Ugly-Number-II.md
@@ -0,0 +1,76 @@
+# [264. Ugly Number II](https://leetcode.com/problems/ugly-number-ii/)
+
+
+## 题目
+
+Given an integer `n`, return *the* `nth` ***ugly number***.
+
+**Ugly number** is a positive number whose prime factors only include `2`, `3`, and/or `5`.
+
+**Example 1:**
+
+```
+Input: n = 10
+Output: 12
+Explanation: [1, 2, 3, 4, 5, 6, 8, 9, 10, 12] is the sequence of the first 10 ugly numbers.
+```
+
+**Example 2:**
+
+```
+Input: n = 1
+Output: 1
+Explanation: 1 is typically treated as an ugly number.
+```
+
+**Constraints:**
+
+- `1 <= n <= 1690`
+
+## 题目大意
+
+给你一个整数 `n` ，请你找出并返回第 `n` 个 **丑数** 。**丑数** 就是只包含质因数 `2`、`3` 和/或 `5` 的正整数。
+
+## 解题思路
+
+- 解法一，生成丑数的方法：先用最小质因数 1，分别和 2，3，5 相乘，得到的数是丑数，不断的将这些数分别和 2，3，5 相乘，得到的数去重以后，从小到大排列，第 n 个数即为所求。排序可用最小堆实现，去重用 map 去重。时间复杂度 O(n log n)，空间复杂度 O(n)
+- 上面的解法耗时在排序中，需要排序的根源是小的丑数乘以 5 大于了大的丑数乘以 2 。如何保证每次乘积以后，找出有序的丑数，是去掉排序，提升时间复杂度的关键。举个例子很容易想通：初始状态丑数只有 {1}，乘以 2，3，5 以后，将最小的结果存入集合中 {1,2}。下一轮再相乘，由于上一轮 1 已经和 2 相乘过了，1 不要再和 2 相乘了，所以这一轮 1 和 3，5 相乘。2 和 2，3，5 相乘。将最小的结果存入集合中 {1,2,3}，按照这样的策略往下比较，每轮选出的丑数是有序且不重复的。具体实现利用 3 个指针和一个数组即可实现。时间复杂度 O(n)，空间复杂度 O(n)。
+
+## 代码
+
+```go
+package leetcode
+
+func nthUglyNumber(n int) int {
+ dp, p2, p3, p5 := make([]int, n+1), 1, 1, 1
+ dp[0], dp[1] = 0, 1
+ for i := 2; i <= n; i++ {
+ x2, x3, x5 := dp[p2]*2, dp[p3]*3, dp[p5]*5
+ dp[i] = min(min(x2, x3), x5)
+ if dp[i] == x2 {
+ p2++
+ }
+ if dp[i] == x3 {
+ p3++
+ }
+ if dp[i] == x5 {
+ p5++
+ }
+ }
+ return dp[n]
+}
+
+func min(a, b int) int {
+ if a < b {
+ return a
+ }
+ return b
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0200~0299/0263.Ugly-Number/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0200~0299/0268.Missing-Number/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0268.Missing-Number.md b/website/content/ChapterFour/0200~0299/0268.Missing-Number.md
similarity index 77%
rename from website/content/ChapterFour/0268.Missing-Number.md
rename to website/content/ChapterFour/0200~0299/0268.Missing-Number.md
index cf72f8c04..05d3fe54c 100755
--- a/website/content/ChapterFour/0268.Missing-Number.md
+++ b/website/content/ChapterFour/0200~0299/0268.Missing-Number.md
@@ -44,4 +44,11 @@ func missingNumber(nums []int) int {
return xor ^ i
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0200~0299/0264.Ugly-Number-II/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0200~0299/0274.H-Index/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0274.H-Index.md b/website/content/ChapterFour/0200~0299/0274.H-Index.md
similarity index 83%
rename from website/content/ChapterFour/0274.H-Index.md
rename to website/content/ChapterFour/0200~0299/0274.H-Index.md
index 4306deedc..75cf67b16 100644
--- a/website/content/ChapterFour/0274.H-Index.md
+++ b/website/content/ChapterFour/0200~0299/0274.H-Index.md
@@ -75,4 +75,11 @@ func hIndex1(citations []int) int {
return hIndex
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0200~0299/0268.Missing-Number/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0200~0299/0275.H-Index-II/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0275.H-Index-II.md b/website/content/ChapterFour/0200~0299/0275.H-Index-II.md
similarity index 89%
rename from website/content/ChapterFour/0275.H-Index-II.md
rename to website/content/ChapterFour/0200~0299/0275.H-Index-II.md
index 21310f019..2ab6406b6 100755
--- a/website/content/ChapterFour/0275.H-Index-II.md
+++ b/website/content/ChapterFour/0200~0299/0275.H-Index-II.md
@@ -68,4 +68,11 @@ func hIndex275(citations []int) int {
return len(citations) - low
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0200~0299/0274.H-Index/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0200~0299/0278.First-Bad-Version/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0200~0299/0278.First-Bad-Version.md b/website/content/ChapterFour/0200~0299/0278.First-Bad-Version.md
new file mode 100644
index 000000000..36fd27b46
--- /dev/null
+++ b/website/content/ChapterFour/0200~0299/0278.First-Bad-Version.md
@@ -0,0 +1,69 @@
+# [278. First Bad Version](https://leetcode.com/problems/first-bad-version/)
+
+## 题目
+
+You are a product manager and currently leading a team to develop a new product. Unfortunately, the latest version of your product fails the quality check. Since each version is developed based on the previous version, all the versions after a bad version are also bad.
+
+Suppose you have `n` versions `[1, 2, ..., n]` and you want to find out the first bad one, which causes all the following ones to be bad.
+
+You are given an API `bool isBadVersion(version)` which returns whether `version` is bad. Implement a function to find the first bad version. You should minimize the number of calls to the API.
+
+**Example 1:**
+
+```
+Input: n = 5, bad = 4
+Output: 4
+Explanation:
+call isBadVersion(3) -> false
+call isBadVersion(5) -> true
+call isBadVersion(4) -> true
+Then 4 is the first bad version.
+
+```
+
+**Example 2:**
+
+```
+Input: n = 1, bad = 1
+Output: 1
+
+```
+
+**Constraints:**
+
+- `1 <= bad <= n <= 231 - 1`
+
+## 题目大意
+
+你是产品经理，目前正在带领一个团队开发新的产品。不幸的是，你的产品的最新版本没有通过质量检测。由于每个版本都是基于之前的版本开发的，所以错误的版本之后的所有版本都是错的。假设你有 n 个版本 [1, 2, ..., n]，你想找出导致之后所有版本出错的第一个错误的版本。你可以通过调用 bool isBadVersion(version) 接口来判断版本号 version 是否在单元测试中出错。实现一个函数来查找第一个错误的版本。你应该尽量减少对调用 API 的次数。
+
+## 解题思路
+
+- 我们知道开发产品迭代的版本，如果当一个版本为正确版本，则该版本之前的所有版本均为正确版本；当一个版本为错误版本，则该版本之后的所有版本均为错误版本。利用这个性质就可以进行二分查找。利用二分搜索，也可以满足减少对调用 API 的次数的要求。时间复杂度：O(logn)，其中 n 是给定版本的数量。空间复杂度：O(1)。
+
+## 代码
+
+```go
+package leetcode
+
+import "sort"
+
+/**
+ * Forward declaration of isBadVersion API.
+ * @param version your guess about first bad version
+ * @return true if current version is bad
+ * false if current version is good
+ * func isBadVersion(version int) bool;
+ */
+
+func firstBadVersion(n int) int {
+ return sort.Search(n, func(version int) bool { return isBadVersion(version) })
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0200~0299/0275.H-Index-II/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0200~0299/0279.Perfect-Squares/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0200~0299/0279.Perfect-Squares.md b/website/content/ChapterFour/0200~0299/0279.Perfect-Squares.md
new file mode 100644
index 000000000..6ef4ffcc9
--- /dev/null
+++ b/website/content/ChapterFour/0200~0299/0279.Perfect-Squares.md
@@ -0,0 +1,85 @@
+# [279. Perfect Squares](https://leetcode.com/problems/perfect-squares/)
+
+
+## 题目
+
+Given an integer `n`, return *the least number of perfect square numbers that sum to* `n`.
+
+A **perfect square** is an integer that is the square of an integer; in other words, it is the product of some integer with itself. For example, `1`, `4`, `9`, and `16` are perfect squares while `3` and `11` are not.
+
+**Example 1:**
+
+```
+Input: n = 12
+Output: 3
+Explanation: 12 = 4 + 4 + 4.
+```
+
+**Example 2:**
+
+```
+Input: n = 13
+Output: 2
+Explanation: 13 = 4 + 9.
+```
+
+**Constraints:**
+
+- `1 <= n <= 104`
+
+## 题目大意
+
+给定正整数 n，找到若干个完全平方数（比如 1, 4, 9, 16, ...）使得它们的和等于 n。你需要让组成和的完全平方数的个数最少。给你一个整数 n ，返回和为 n 的完全平方数的 最少数量 。
+
+完全平方数 是一个整数，其值等于另一个整数的平方；换句话说，其值等于一个整数自乘的积。例如，1、4、9 和 16 都是完全平方数，而 3 和 11 不是。
+
+## 解题思路
+
+- 由拉格朗日的四平方定理可得，每个自然数都可以表示为四个整数平方之和。 其中四个数字是整数。四平方和定理证明了任意一个正整数都可以被表示为至多四个正整数的平方和。这给出了本题的答案的上界。
+- 四平方和定理可以推出三平方和推论：当且仅当 {{< katex >}} n \neq 4^{k} \times (8*m + 7){{< /katex >}} 时，n 可以被表示为至多三个正整数的平方和。所以当 {{< katex >}} n = 4^{k} * (8*m + 7){{< /katex >}} 时，n 只能被表示为四个正整数的平方和。此时我们可以直接返回 4。
+- 当 {{< katex >}} n \neq 4^{k} \times (8*m + 7){{< /katex >}} 时，需要判断 n 到底可以分解成几个完全平方数之和。答案肯定是 1，2，3 中的一个。题目要求我们求最小的，所以从 1 开始一个个判断是否满足。如果答案为 1，代表 n 为完全平方数，这很好判断。如果答案为 2，代表 {{< katex >}} n = a^{2} + b^{2} {{< /katex >}}，枚举 {{< katex >}} 1 \leqslant a \leqslant \sqrt{n} {{< /katex >}}，判断 {{< katex >}} n - a^{2} {{< /katex >}} 是否为完全平方数。当 1 和 2 都排除了，剩下的答案只能为 3 了。
+
+## 代码
+
+```go
+package leetcode
+
+import "math"
+
+func numSquares(n int) int {
+ if isPerfectSquare(n) {
+ return 1
+ }
+ if checkAnswer4(n) {
+ return 4
+ }
+ for i := 1; i*i <= n; i++ {
+ j := n - i*i
+ if isPerfectSquare(j) {
+ return 2
+ }
+ }
+ return 3
+}
+
+// 判断是否为完全平方数
+func isPerfectSquare(n int) bool {
+ sq := int(math.Floor(math.Sqrt(float64(n))))
+ return sq*sq == n
+}
+
+// 判断是否能表示为 4^k*(8m+7)
+func checkAnswer4(x int) bool {
+ for x%4 == 0 {
+ x /= 4
+ }
+ return x%8 == 7
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0200~0299/0278.First-Bad-Version/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0200~0299/0283.Move-Zeroes/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0200~0299/0283.Move-Zeroes.md b/website/content/ChapterFour/0200~0299/0283.Move-Zeroes.md
new file mode 100644
index 000000000..16c37efae
--- /dev/null
+++ b/website/content/ChapterFour/0200~0299/0283.Move-Zeroes.md
@@ -0,0 +1,60 @@
+# [283. Move Zeroes](https://leetcode.com/problems/move-zeroes/)
+
+## 题目
+
+Given an array nums, write a function to move all 0's to the end of it while maintaining the relative order of the non-zero elements.
+
+**Example 1**:
+
+```
+
+Input: [0,1,0,3,12]
+Output: [1,3,12,0,0]
+
+```
+
+**Note**:
+
+- You must do this in-place without making a copy of the array.
+- Minimize the total number of operations.
+
+
+
+## 题目大意
+
+题目要求不能采用额外的辅助空间，将数组中 0 元素都移动到数组的末尾，并且维持所有非 0 元素的相对位置。
+
+## 解题思路
+
+这一题可以只扫描数组一遍，不断的用 i，j 标记 0 和非 0 的元素，然后相互交换，最终到达题目的目的。与这一题相近的题目有第 26 题，第 27 题，第 80 题。
+
+
+## 代码
+
+```go
+
+package leetcode
+
+func moveZeroes(nums []int) {
+ if len(nums) == 0 {
+ return
+ }
+ j := 0
+ for i := 0; i < len(nums); i++ {
+ if nums[i] != 0 {
+ if i != j {
+ nums[i], nums[j] = nums[j], nums[i]
+ }
+ j++
+ }
+ }
+}
+
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0200~0299/0279.Perfect-Squares/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0200~0299/0284.Peeking-Iterator/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0200~0299/0284.Peeking-Iterator.md b/website/content/ChapterFour/0200~0299/0284.Peeking-Iterator.md
new file mode 100644
index 000000000..9693b934b
--- /dev/null
+++ b/website/content/ChapterFour/0200~0299/0284.Peeking-Iterator.md
@@ -0,0 +1,94 @@
+# [284. Peeking Iterator](https://leetcode.com/problems/peeking-iterator/)
+
+## 题目
+
+Given an Iterator class interface with methods: `next()` and `hasNext()`, design and implement a PeekingIterator that support the `peek()` operation -- it essentially peek() at the element that will be returned by the next call to next().
+
+**Example:**
+
+```
+Assume that the iterator is initialized to the beginning of the list: [1,2,3].
+
+Call next() gets you 1, the first element in the list.
+Now you call peek() and it returns 2, the next element. Calling next() after that still return 2.
+You call next() the final time and it returns 3, the last element.
+Calling hasNext() after that should return false.
+```
+
+**Follow up**: How would you extend your design to be generic and work with all types, not just integer?
+
+## 题目大意
+
+给定一个迭代器类的接口，接口包含两个方法： next() 和 hasNext()。设计并实现一个支持 peek() 操作的顶端迭代器 -- 其本质就是把原本应由 next() 方法返回的元素 peek() 出来。
+
+> peek() 是偷看的意思。偷偷看一看下一个元素是什么，但是并不是 next() 访问。
+
+## 解题思路
+
+- 简单题。在 PeekingIterator 内部保存 2 个变量，一个是下一个元素值，另一个是是否有下一个元素。在 next() 操作和 hasNext() 操作时，访问保存的这 2 个变量。peek() 操作也比较简单，判断是否有下一个元素，如果有，即返回该元素值。这里实现了迭代指针不移动的功能。如果没有保存下一个元素值，即没有 peek() 偷看，next() 操作继续往后移动指针，读取后一位元素。
+- 这里复用了是否有下一个元素值，来判断 hasNext() 和 peek() 操作中不移动指针的逻辑。
+
+## 代码
+
+```go
+package leetcode
+
+//Below is the interface for Iterator, which is already defined for you.
+
+type Iterator struct {
+}
+
+func (this *Iterator) hasNext() bool {
+ // Returns true if the iteration has more elements.
+ return true
+}
+
+func (this *Iterator) next() int {
+ // Returns the next element in the iteration.
+ return 0
+}
+
+type PeekingIterator struct {
+ nextEl int
+ hasEl bool
+ iter *Iterator
+}
+
+func Constructor(iter *Iterator) *PeekingIterator {
+ return &PeekingIterator{
+ iter: iter,
+ }
+}
+
+func (this *PeekingIterator) hasNext() bool {
+ if this.hasEl {
+ return true
+ }
+ return this.iter.hasNext()
+}
+
+func (this *PeekingIterator) next() int {
+ if this.hasEl {
+ this.hasEl = false
+ return this.nextEl
+ } else {
+ return this.iter.next()
+ }
+}
+
+func (this *PeekingIterator) peek() int {
+ if this.hasEl {
+ return this.nextEl
+ }
+ this.hasEl = true
+ this.nextEl = this.iter.next()
+ return this.nextEl
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0200~0299/0283.Move-Zeroes/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0200~0299/0287.Find-the-Duplicate-Number/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0287.Find-the-Duplicate-Number.md b/website/content/ChapterFour/0200~0299/0287.Find-the-Duplicate-Number.md
similarity index 89%
rename from website/content/ChapterFour/0287.Find-the-Duplicate-Number.md
rename to website/content/ChapterFour/0200~0299/0287.Find-the-Duplicate-Number.md
index a8146fe38..d3f95b60b 100644
--- a/website/content/ChapterFour/0287.Find-the-Duplicate-Number.md
+++ b/website/content/ChapterFour/0200~0299/0287.Find-the-Duplicate-Number.md
@@ -104,4 +104,11 @@ func findDuplicate2(nums []int) int {
return 0
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0200~0299/0284.Peeking-Iterator/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0200~0299/0290.Word-Pattern/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0290.Word-Pattern.md b/website/content/ChapterFour/0200~0299/0290.Word-Pattern.md
similarity index 82%
rename from website/content/ChapterFour/0290.Word-Pattern.md
rename to website/content/ChapterFour/0200~0299/0290.Word-Pattern.md
index d7764d4eb..15b9cdf3b 100644
--- a/website/content/ChapterFour/0290.Word-Pattern.md
+++ b/website/content/ChapterFour/0200~0299/0290.Word-Pattern.md
@@ -95,4 +95,11 @@ func wordPattern(pattern string, str string) bool {
return true
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0200~0299/0287.Find-the-Duplicate-Number/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0200~0299/0297.Serialize-and-Deserialize-Binary-Tree/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0200~0299/0297.Serialize-and-Deserialize-Binary-Tree.md b/website/content/ChapterFour/0200~0299/0297.Serialize-and-Deserialize-Binary-Tree.md
new file mode 100644
index 000000000..dc86b67fa
--- /dev/null
+++ b/website/content/ChapterFour/0200~0299/0297.Serialize-and-Deserialize-Binary-Tree.md
@@ -0,0 +1,120 @@
+# [297. Serialize and Deserialize Binary Tree](https://leetcode.com/problems/serialize-and-deserialize-binary-tree/)
+
+
+## 题目
+
+Serialization is the process of converting a data structure or object into a sequence of bits so that it can be stored in a file or memory buffer, or transmitted across a network connection link to be reconstructed later in the same or another computer environment.
+
+Design an algorithm to serialize and deserialize a binary tree. There is no restriction on how your serialization/deserialization algorithm should work. You just need to ensure that a binary tree can be serialized to a string and this string can be deserialized to the original tree structure.
+
+**Clarification:** The input/output format is the same as [how LeetCode serializes a binary tree](https://leetcode.com/faq/#binary-tree). You do not necessarily need to follow this format, so please be creative and come up with different approaches yourself.
+
+**Example 1:**
+
+
+
+```
+Input: root = [1,2,3,null,null,4,5]
+Output: [1,2,3,null,null,4,5]
+```
+
+**Example 2:**
+
+```
+Input: root = []
+Output: []
+```
+
+**Example 3:**
+
+```
+Input: root = [1]
+Output: [1]
+```
+
+**Example 4:**
+
+```
+Input: root = [1,2]
+Output: [1,2]
+```
+
+**Constraints:**
+
+- The number of nodes in the tree is in the range `[0, 104]`.
+- `1000 <= Node.val <= 1000`
+
+## 题目大意
+
+设计一个算法，来序列化和反序列化二叉树。并不限制如何进行序列化和反序列化，但是你需要保证二叉树可以序列化为字符串，并且这个字符串可以被反序列化成原有的二叉树。
+
+## 解题思路
+
+- 1. 将给定的二叉树想象成一颗满二叉树(不存在的结点用 null 填充)。
+- 2. 通过前序遍历，可以得到一个第一个结点为根的序列，然后递归进行序列化/反序列化即可。
+
+## 代码
+
+```go
+package leetcode
+
+import (
+ "strconv"
+ "strings"
+
+ "github.com/halfrost/leetcode-go/structures"
+)
+
+type TreeNode = structures.TreeNode
+
+type Codec struct {
+ builder strings.Builder
+ input []string
+}
+
+func Constructor() Codec {
+ return Codec{}
+}
+
+// Serializes a tree to a single string.
+func (this *Codec) serialize(root *TreeNode) string {
+ if root == nil {
+ this.builder.WriteString("#,")
+ return ""
+ }
+ this.builder.WriteString(strconv.Itoa(root.Val) + ",")
+ this.serialize(root.Left)
+ this.serialize(root.Right)
+ return this.builder.String()
+}
+
+// Deserializes your encoded data to tree.
+func (this *Codec) deserialize(data string) *TreeNode {
+ if len(data) == 0 {
+ return nil
+ }
+ this.input = strings.Split(data, ",")
+ return this.deserializeHelper()
+}
+
+func (this *Codec) deserializeHelper() *TreeNode {
+ if this.input[0] == "#" {
+ this.input = this.input[1:]
+ return nil
+ }
+ val, _ := strconv.Atoi(this.input[0])
+ this.input = this.input[1:]
+ return &TreeNode{
+ Val: val,
+ Left: this.deserializeHelper(),
+ Right: this.deserializeHelper(),
+ }
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0200~0299/0290.Word-Pattern/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0200~0299/0299.Bulls-and-Cows/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0200~0299/0299.Bulls-and-Cows.md b/website/content/ChapterFour/0200~0299/0299.Bulls-and-Cows.md
new file mode 100644
index 000000000..10b6261d4
--- /dev/null
+++ b/website/content/ChapterFour/0200~0299/0299.Bulls-and-Cows.md
@@ -0,0 +1,121 @@
+# [299. Bulls and Cows](https://leetcode.com/problems/bulls-and-cows/)
+
+
+## 题目
+
+You are playing the Bulls and Cows game with your friend.
+
+You write down a secret number and ask your friend to guess what the number is. When your friend makes a guess, you provide a hint with the following info:
+
+The number of "bulls", which are digits in the guess that are in the correct position.
+The number of "cows", which are digits in the guess that are in your secret number but are located in the wrong position. Specifically, the non-bull digits in the guess that could be rearranged such that they become bulls.
+Given the secret number secret and your friend's guess guess, return the hint for your friend's guess.
+
+The hint should be formatted as "xAyB", where x is the number of bulls and y is the number of cows. Note that both secret and guess may contain duplicate digits.
+
+**Example 1:**
+
+```
+Input: secret = "1807", guess = "7810"
+Output: "1A3B"
+Explanation: Bulls are connected with a '|' and cows are underlined:
+"1807"
+ |
+"7810"
+```
+
+**Example 2:**
+
+```
+Input: secret = "1123", guess = "0111"
+Output: "1A1B"
+Explanation: Bulls are connected with a '|' and cows are underlined:
+"1123" "1123"
+ | or |
+"0111" "0111"
+Note that only one of the two unmatched 1s is counted as a cow since the non-bull digits can only be rearranged to allow one 1 to be a bull.
+```
+
+**Example 3:**
+
+```
+Input: secret = "1", guess = "0"
+Output: "0A0B"
+```
+
+**Example 4:**
+
+```
+Input: secret = "1", guess = "1"
+Output: "1A0B"
+```
+
+**Constraints:**
+
+- 1 <= secret.length, guess.length <= 1000
+- secret.length == guess.length
+- secret and guess consist of digits only.
+
+## 题目大意
+
+你在和朋友一起玩 猜数字（Bulls and Cows）游戏，该游戏规则如下：
+
+写出一个秘密数字，并请朋友猜这个数字是多少。朋友每猜测一次，你就会给他一个包含下述信息的提示：
+
+猜测数字中有多少位属于数字和确切位置都猜对了（称为 "Bulls", 公牛），
+有多少位属于数字猜对了但是位置不对（称为 "Cows", 奶牛）。也就是说，这次猜测中有多少位非公牛数字可以通过重新排列转换成公牛数字。
+给你一个秘密数字secret 和朋友猜测的数字guess ，请你返回对朋友这次猜测的提示。
+
+提示的格式为 "xAyB" ，x 是公牛个数， y 是奶牛个数，A 表示公牛，B表示奶牛。
+
+请注意秘密数字和朋友猜测的数字都可能含有重复数字。
+
+## 解题思路
+
+- 计算下标一致并且对应下标的元素一致的个数，即 x
+- secret 和 guess 分别去除 x 个公牛的元素,剩下 secret 和 guess 求共同的元素个数就是 y
+- 把 x， y 转换成字符串，分别与 "A" 和 "B" 进行拼接返回结果
+
+## 代码
+
+```go
+
+package leetcode
+
+import "strconv"
+
+func getHint(secret string, guess string) string {
+ cntA, cntB := 0, 0
+ mpS := make(map[byte]int)
+ var strG []byte
+ n := len(secret)
+ var ans string
+ for i := 0; i < n; i++ {
+ if secret[i] == guess[i] {
+ cntA++
+ } else {
+ mpS[secret[i]] += 1
+ strG = append(strG, guess[i])
+ }
+ }
+ for _, v := range strG {
+ if _, ok := mpS[v]; ok {
+ if mpS[v] > 1 {
+ mpS[v] -= 1
+ } else {
+ delete(mpS, v)
+ }
+ cntB++
+ }
+ }
+ ans += strconv.Itoa(cntA) + "A" + strconv.Itoa(cntB) + "B"
+ return ans
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0200~0299/0297.Serialize-and-Deserialize-Binary-Tree/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0300~0399/0300.Longest-Increasing-Subsequence/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0200~0299/_index.md b/website/content/ChapterFour/0200~0299/_index.md
new file mode 100644
index 000000000..d2021683f
--- /dev/null
+++ b/website/content/ChapterFour/0200~0299/_index.md
@@ -0,0 +1,5 @@
+---
+bookCollapseSection: true
+weight: 20
+---
+
diff --git a/website/content/ChapterFour/0202.Happy-Number.md b/website/content/ChapterFour/0202.Happy-Number.md
deleted file mode 100644
index 673c90cbc..000000000
--- a/website/content/ChapterFour/0202.Happy-Number.md
+++ /dev/null
@@ -1,65 +0,0 @@
-# [202. Happy Number](https://leetcode.com/problems/happy-number/)
-
-## 题目
-
-Write an algorithm to determine if a number is "happy".
-
-A happy number is a number defined by the following process: Starting with any positive integer, replace the number by the sum of the squares of its digits, and repeat the process until the number equals 1 (where it will stay), or it loops endlessly in a cycle which does not include 1. Those numbers for which this process ends in 1 are happy numbers.
-
-**Example 1**:
-
-```
-
-Input: 19
-Output: true
-Explanation:
-12 + 92 = 82
-82 + 22 = 68
-62 + 82 = 100
-12 + 02 + 02 = 1
-
-```
-
-## 题目大意
-
-判断一个数字是否是“快乐数字”，“快乐数字”的定义是，不断的把这个数字的每个数字的平方和加起来，反复的加，最终如果能有结果是 1，则是“快乐数字”，如果不能得到一，出现了循环，则输出 false。
-
-## 解题思路
-
-按照题意要求做即可。
-
-
-
-## 代码
-
-```go
-
-package leetcode
-
-func isHappy(n int) bool {
- if n == 0 {
- return false
- }
- res := 0
- num := n
- record := map[int]int{}
- for {
- for num != 0 {
- res += (num % 10) * (num % 10)
- num = num / 10
- }
- if _, ok := record[res]; !ok {
- if res == 1 {
- return true
- }
- record[res] = res
- num = res
- res = 0
- continue
- } else {
- return false
- }
- }
-}
-
-```
\ No newline at end of file
diff --git a/website/content/ChapterFour/0203.Remove-Linked-List-Elements.md b/website/content/ChapterFour/0203.Remove-Linked-List-Elements.md
deleted file mode 100644
index 049e25615..000000000
--- a/website/content/ChapterFour/0203.Remove-Linked-List-Elements.md
+++ /dev/null
@@ -1,56 +0,0 @@
-# [203. Remove Linked List Elements](https://leetcode.com/problems/remove-linked-list-elements/)
-
-## 题目
-
-Remove all elements from a linked list of integers that have value val.
-
-**Example**:
-
-```
-
-Input: 1->2->6->3->4->5->6, val = 6
-Output: 1->2->3->4->5
-
-```
-
-
-## 题目大意
-
-删除链表中所有指定值的结点。
-
-## 解题思路
-
-按照题意做即可。
-
-## 代码
-
-```go
-
-package leetcode
-
-/**
- * Definition for singly-linked list.
- * type ListNode struct {
- * Val int
- * Next *ListNode
- * }
- */
-func removeElements(head *ListNode, val int) *ListNode {
- if head == nil {
- return head
- }
- newHead := &ListNode{Val: 0, Next: head}
- pre := newHead
- cur := head
- for cur != nil {
- if cur.Val == val {
- pre.Next = cur.Next
- } else {
- pre = cur
- }
- cur = cur.Next
- }
- return newHead.Next
-}
-
-```
\ No newline at end of file
diff --git a/website/content/ChapterFour/0204.Count-Primes.md b/website/content/ChapterFour/0204.Count-Primes.md
deleted file mode 100755
index 81f49cdc5..000000000
--- a/website/content/ChapterFour/0204.Count-Primes.md
+++ /dev/null
@@ -1,50 +0,0 @@
-# [204. Count Primes](https://leetcode.com/problems/count-primes/)
-
-
-## 题目
-
-Count the number of prime numbers less than a non-negative number, **n**.
-
-**Example**:
-
- Input: 10
- Output: 4
- Explanation: There are 4 prime numbers less than 10, they are 2, 3, 5, 7.
-
-
-## 题目大意
-
-统计所有小于非负整数 n 的质数的数量。
-
-
-## 解题思路
-
-- 给出一个数字 n，要求输出小于 n 的所有素数的个数总和。简单题。
-
-
-## 代码
-
-```go
-
-package leetcode
-
-func countPrimes(n int) int {
- isNotPrime := make([]bool, n)
- for i := 2; i*i < n; i++ {
- if isNotPrime[i] {
- continue
- }
- for j := i * i; j < n; j = j + i {
- isNotPrime[j] = true
- }
- }
- count := 0
- for i := 2; i < n; i++ {
- if !isNotPrime[i] {
- count++
- }
- }
- return count
-}
-
-```
\ No newline at end of file
diff --git a/website/content/ChapterFour/0206.Reverse-Linked-List.md b/website/content/ChapterFour/0206.Reverse-Linked-List.md
deleted file mode 100644
index 28f4d7e6f..000000000
--- a/website/content/ChapterFour/0206.Reverse-Linked-List.md
+++ /dev/null
@@ -1,47 +0,0 @@
-# [206. Reverse Linked List](https://leetcode.com/problems/reverse-linked-list/description/)
-
-## 题目
-
-Reverse a singly linked list.
-
-## 题目大意
-
-翻转单链表
-
-
-## 解题思路
-
-按照题意做即可。
-
-## 代码
-
-```go
-
-package leetcode
-
-/**
- * Definition for singly-linked list.
- * type ListNode struct {
- * Val int
- * Next *ListNode
- * }
- */
-
-// ListNode define
-type ListNode struct {
- Val int
- Next *ListNode
-}
-
-func reverseList(head *ListNode) *ListNode {
- var behind *ListNode
- for head != nil {
- next := head.Next
- head.Next = behind
- behind = head
- head = next
- }
- return behind
-}
-
-```
\ No newline at end of file
diff --git a/website/content/ChapterFour/0209.Minimum-Size-Subarray-Sum.md b/website/content/ChapterFour/0209.Minimum-Size-Subarray-Sum.md
deleted file mode 100644
index c2fd8a75b..000000000
--- a/website/content/ChapterFour/0209.Minimum-Size-Subarray-Sum.md
+++ /dev/null
@@ -1,61 +0,0 @@
-# [209. Minimum Size Subarray Sum](https://leetcode.com/problems/minimum-size-subarray-sum/)
-
-## 题目
-
-Given an array of n positive integers and a positive integer s, find the minimal length of a contiguous subarray of which the sum ≥ s. If there isn't one, return 0 instead.
-
-**Example 1**:
-
-```
-
-Input: s = 7, nums = [2,3,1,2,4,3]
-Output: 2
-Explanation: the subarray [4,3] has the minimal length under the problem constraint.
-
-```
-
-**Follow up**:
-
-If you have figured out the O(n) solution, try coding another solution of which the time complexity is O(n log n).
-
-## 题目大意
-
-给定一个整型数组和一个数字 s，找到数组中最短的一个连续子数组，使得连续子数组的数字之和 sum>=s，返回最短的连续子数组的返回值。
-
-## 解题思路
-
-这一题的解题思路是用滑动窗口。在滑动窗口 [i,j]之间不断往后移动，如果总和小于 s，就扩大右边界 j，不断加入右边的值，直到 sum > s，之和再缩小 i 的左边界，不断缩小直到 sum < s，这时候右边界又可以往右移动。以此类推。
-
-
-
-## 代码
-
-```go
-
-package leetcode
-
-func minSubArrayLen(s int, nums []int) int {
- n := len(nums)
- if n == 0 {
- return 0
- }
- left, right, res, sum := 0, -1, n+1, 0
- for left < n {
- if (right+1) < n && sum < s {
- right++
- sum += nums[right]
- } else {
- sum -= nums[left]
- left++
- }
- if sum >= s {
- res = min(res, right-left+1)
- }
- }
- if res == n+1 {
- return 0
- }
- return res
-}
-
-```
\ No newline at end of file
diff --git a/website/content/ChapterFour/0211.Add-and-Search-Word---Data-structure-design.md b/website/content/ChapterFour/0211.Add-and-Search-Word---Data-structure-design.md
deleted file mode 100755
index ba8502f7f..000000000
--- a/website/content/ChapterFour/0211.Add-and-Search-Word---Data-structure-design.md
+++ /dev/null
@@ -1,95 +0,0 @@
-# [211. Add and Search Word - Data structure design](https://leetcode.com/problems/add-and-search-word-data-structure-design/)
-
-
-## 题目
-
-Design a data structure that supports the following two operations:
-
- void addWord(word)
- bool search(word)
-
-search(word) can search a literal word or a regular expression string containing only letters `a-z` or `.`. A `.` means it can represent any one letter.
-
-**Example**:
-
- addWord("bad")
- addWord("dad")
- addWord("mad")
- search("pad") -> false
- search("bad") -> true
- search(".ad") -> true
- search("b..") -> true
-
-**Note**: You may assume that all words are consist of lowercase letters `a-z`.
-
-## 题目大意
-
-设计一个支持以下两种操作的数据结构：`void addWord(word)`、`bool search(word)`。`search(word)` 可以搜索文字或正则表达式字符串，字符串只包含字母 . 或 a-z 。 "." 可以表示任何一个字母。
-
-
-
-## 解题思路
-
-- 设计一个 `WordDictionary` 的数据结构，要求具有 `addWord(word)` 和 `search(word)` 的操作，并且具有模糊查找的功能。
-- 这一题是第 208 题的加强版，在第 208 题经典的 Trie 上加上了模糊查找的功能。其他实现一模一样。
-
-
-## 代码
-
-```go
-
-package leetcode
-
-type WordDictionary struct {
- children map[rune]*WordDictionary
- isWord bool
-}
-
-/** Initialize your data structure here. */
-func Constructor211() WordDictionary {
- return WordDictionary{children: make(map[rune]*WordDictionary)}
-}
-
-/** Adds a word into the data structure. */
-func (this *WordDictionary) AddWord(word string) {
- parent := this
- for _, ch := range word {
- if child, ok := parent.children[ch]; ok {
- parent = child
- } else {
- newChild := &WordDictionary{children: make(map[rune]*WordDictionary)}
- parent.children[ch] = newChild
- parent = newChild
- }
- }
- parent.isWord = true
-}
-
-/** Returns if the word is in the data structure. A word could contain the dot character '.' to represent any one letter. */
-func (this *WordDictionary) Search(word string) bool {
- parent := this
- for i, ch := range word {
- if rune(ch) == '.' {
- isMatched := false
- for _, v := range parent.children {
- if v.Search(word[i+1:]) {
- isMatched = true
- }
- }
- return isMatched
- } else if _, ok := parent.children[rune(ch)]; !ok {
- return false
- }
- parent = parent.children[rune(ch)]
- }
- return len(parent.children) == 0 || parent.isWord
-}
-
-/**
- * Your WordDictionary object will be instantiated and called as such:
- * obj := Constructor();
- * obj.AddWord(word);
- * param_2 := obj.Search(word);
- */
-
-```
\ No newline at end of file
diff --git a/website/content/ChapterFour/0212.Word-Search-II.md b/website/content/ChapterFour/0212.Word-Search-II.md
deleted file mode 100755
index b277984b1..000000000
--- a/website/content/ChapterFour/0212.Word-Search-II.md
+++ /dev/null
@@ -1,57 +0,0 @@
-# [212. Word Search II](https://leetcode.com/problems/word-search-ii/)
-
-
-## 题目
-
-Given a 2D board and a list of words from the dictionary, find all words in the board.
-
-Each word must be constructed from letters of sequentially adjacent cell, where "adjacent" cells are those horizontally or vertically neighboring. The same letter cell may not be used more than once in a word.
-
-**Example**:
-
- Input:
- board = [
- ['o','a','a','n'],
- ['e','t','a','e'],
- ['i','h','k','r'],
- ['i','f','l','v']
- ]
- words = ["oath","pea","eat","rain"]
-
- Output: ["eat","oath"]
-
-**Note**:
-
-1. All inputs are consist of lowercase letters `a-z`.
-2. The values of `words` are distinct.
-
-## 题目大意
-
-给定一个二维网格 board 和一个字典中的单词列表 words，找出所有同时在二维网格和字典中出现的单词。
-
-单词必须按照字母顺序，通过相邻的单元格内的字母构成，其中“相邻”单元格是那些水平相邻或垂直相邻的单元格。同一个单元格内的字母在一个单词中不允许被重复使用。
-
-
-## 解题思路
-
-- 这一题是第 79 题的加强版，在第 79 题的基础上增加了一个 word 数组，要求找出所有出现在地图中的单词。思路还是可以按照第 79 题 DFS 搜索，不过时间复杂度特别高！
-- 想想更优的解法。
-
-
-## 代码
-
-```go
-
-package leetcode
-
-func findWords(board [][]byte, words []string) []string {
- res := []string{}
- for _, v := range words {
- if exist(board, v) {
- res = append(res, v)
- }
- }
- return res
-}
-
-```
\ No newline at end of file
diff --git a/website/content/ChapterFour/0215.Kth-Largest-Element-in-an-Array.md b/website/content/ChapterFour/0215.Kth-Largest-Element-in-an-Array.md
deleted file mode 100644
index babad9e9c..000000000
--- a/website/content/ChapterFour/0215.Kth-Largest-Element-in-an-Array.md
+++ /dev/null
@@ -1,76 +0,0 @@
-# [215. Kth Largest Element in an Array](https://leetcode.com/problems/kth-largest-element-in-an-array/)
-
-## 题目
-
-Find the kth largest element in an unsorted array. Note that it is the kth largest element in the sorted order, not the kth distinct element.
-
-**Example 1**:
-
-```
-
-Input: [3,2,1,5,6,4] and k = 2
-Output: 5
-
-```
-
-**Example 2**:
-
-```
-
-Input: [3,2,3,1,2,4,5,5,6] and k = 4
-Output: 4
-
-```
-
-**Note**:
-
-You may assume k is always valid, 1 ≤ k ≤ array's length.
-
-
-## 题目大意
-
-找出数组中第 K 大的元素。这一题非常经典。可以用 O(n) 的时间复杂度实现。
-
-## 解题思路
-
-在快排的 partition 操作中，每次 partition 操作结束都会返回一个点，这个标定点的下标和最终排序之后有序数组中这个元素所在的下标是一致的。利用这个特性，我们可以不断的划分数组区间，最终找到第 K 大的元素。执行一次 partition 操作以后，如果这个元素的下标比 K 小，那么接着就在后边的区间继续执行 partition 操作；如果这个元素的下标比 K 大，那么就在左边的区间继续执行 partition 操作；如果相等就直接输出这个下标对应的数组元素即可。
-
-
-
-## 代码
-
-```go
-
-package leetcode
-
-import "sort"
-
-// 解法一 排序，排序的方法反而速度是最快的
-func findKthLargest1(nums []int, k int) int {
- sort.Ints(nums)
- return nums[len(nums)-k]
-}
-
-// 解法二 这个方法的理论依据是 partition 得到的点的下标就是最终排序之后的下标，根据这个下标，我们可以判断第 K 大的数在哪里
-func findKthLargest(nums []int, k int) int {
- if len(nums) == 0 {
- return 0
- }
- return selection(nums, 0, len(nums)-1, len(nums)-k)
-}
-
-func selection(arr []int, l, r, k int) int {
- if l == r {
- return arr[l]
- }
- p := partition164(arr, l, r)
- if k == p {
- return arr[p]
- } else if k < p {
- return selection(arr, l, p-1, k)
- } else {
- return selection(arr, p+1, r, k)
- }
-}
-
-```
\ No newline at end of file
diff --git a/website/content/ChapterFour/0217.Contains-Duplicate.md b/website/content/ChapterFour/0217.Contains-Duplicate.md
deleted file mode 100644
index c9ce8b435..000000000
--- a/website/content/ChapterFour/0217.Contains-Duplicate.md
+++ /dev/null
@@ -1,62 +0,0 @@
-# [217. Contains Duplicate](https://leetcode.com/problems/contains-duplicate/)
-
-## 题目
-
-Given an array of integers, find if the array contains any duplicates.
-
-Your function should return true if any value appears at least twice in the array, and it should return false if every element is distinct.
-
-
-**Example 1**:
-
-```
-
-Input: [1,2,3,1]
-Output: true
-
-```
-**Example 2**:
-
-```
-
-Input: [1,2,3,4]
-Output: false
-
-```
-
-**Example 3**:
-
-```
-
-Input: [1,1,1,3,3,4,3,2,4,2]
-Output: true
-
-```
-
-## 题目大意
-
-这是一道简单题，如果数组里面有重复数字就输出 true，否则输出 flase。
-
-## 解题思路
-
-用 map 判断即可。
-
-
-## 代码
-
-```go
-
-package leetcode
-
-func containsDuplicate(nums []int) bool {
- record := make(map[int]bool, len(nums))
- for _, n := range nums {
- if _, found := record[n]; found {
- return true
- }
- record[n] = true
- }
- return false
-}
-
-```
\ No newline at end of file
diff --git a/website/content/ChapterFour/0218.The-Skyline-Problem.md b/website/content/ChapterFour/0218.The-Skyline-Problem.md
deleted file mode 100755
index 0a4f2bc69..000000000
--- a/website/content/ChapterFour/0218.The-Skyline-Problem.md
+++ /dev/null
@@ -1,287 +0,0 @@
-# [218. The Skyline Problem](https://leetcode.com/problems/the-skyline-problem/)
-
-## 题目
-
-A city's skyline is the outer contour of the silhouette formed by all the buildings in that city when viewed from a distance. Now suppose you are **given the locations and height of all the buildings** as shown on a cityscape photo (Figure A), write a program to **output the skyline** formed by these buildings collectively (Figure B).
-
-
-
-
-
-The geometric information of each building is represented by a triplet of integers `[Li, Ri, Hi]`, where `Li` and `Ri` are the x coordinates of the left and right edge of the ith building, respectively, and `Hi` is its height. It is guaranteed that `0 ≤ Li, Ri ≤ INT_MAX`, `0 < Hi ≤ INT_MAX`, and `Ri - Li > 0`. You may assume all buildings are perfect rectangles grounded on an absolutely flat surface at height 0.
-
-For instance, the dimensions of all buildings in Figure A are recorded as: `[ [2 9 10], [3 7 15], [5 12 12], [15 20 10], [19 24 8] ]` .
-
-The output is a list of "**key points**" (red dots in Figure B) in the format of `[ [x1,y1], [x2, y2], [x3, y3], ... ]` that uniquely defines a skyline. **A key point is the left endpoint of a horizontal line segment**. Note that the last key point, where the rightmost building ends, is merely used to mark the termination of the skyline, and always has zero height. Also, the ground in between any two adjacent buildings should be considered part of the skyline contour.
-
-For instance, the skyline in Figure B should be represented as:`[ [2 10], [3 15], [7 12], [12 0], [15 10], [20 8], [24, 0] ]`.
-
-**Notes**:
-
-- The number of buildings in any input list is guaranteed to be in the range `[0, 10000]`.
-- The input list is already sorted in ascending order by the left x position `Li`.
-- The output list must be sorted by the x position.
-- There must be no consecutive horizontal lines of equal height in the output skyline. For instance, `[...[2 3], [4 5], [7 5], [11 5], [12 7]...]` is not acceptable; the three lines of height 5 should be merged into one in the final output as such: `[...[2 3], [4 5], [12 7], ...]`
-
-
-## 题目大意
-
-城市的天际线是从远处观看该城市中所有建筑物形成的轮廓的外部轮廓。现在，假设您获得了城市风光照片（图A）上显示的所有建筑物的位置和高度，请编写一个程序以输出由这些建筑物形成的天际线（图B）。
-
-每个建筑物的几何信息用三元组 [Li，Ri，Hi] 表示，其中 Li 和 Ri 分别是第 i 座建筑物左右边缘的 x 坐标，Hi 是其高度。可以保证 0 ≤ Li, Ri ≤ INT\_MAX, 0 < Hi ≤ INT\_MAX 和 Ri - Li > 0。您可以假设所有建筑物都是在绝对平坦且高度为 0 的表面上的完美矩形。
-
-例如，图 A 中所有建筑物的尺寸记录为：[ [2 9 10], [3 7 15], [5 12 12], [15 20 10], [19 24 8] ] 。
-
-输出是以 [ [x1,y1], [x2, y2], [x3, y3], ... ] 格式的“关键点”（图 B 中的红点）的列表，它们唯一地定义了天际线。关键点是水平线段的左端点。请注意，最右侧建筑物的最后一个关键点仅用于标记天际线的终点，并始终为零高度。此外，任何两个相邻建筑物之间的地面都应被视为天际线轮廓的一部分。
-
-例如，图 B 中的天际线应该表示为：[ [2 10], [3 15], [7 12], [12 0], [15 10], [20 8], [24, 0] ]。
-
-说明:
-
-- 任何输入列表中的建筑物数量保证在 [0, 10000] 范围内。
-- 输入列表已经按左 x 坐标 Li 进行升序排列。
-- 输出列表必须按 x 位排序。
-- 输出天际线中不得有连续的相同高度的水平线。例如 [...[2 3], [4 5], [7 5], [11 5], [12 7]...] 是不正确的答案；三条高度为 5 的线应该在最终输出中合并为一个：[...[2 3], [4 5], [12 7], ...]
-
-
-## 解题思路
-
-
-- 给出一个二维数组，每个子数组里面代表一个高楼的信息，一个高楼的信息包含 3 个信息，高楼起始坐标，高楼终止坐标，高楼高度。要求找到这些高楼的边际点，并输出这些边际点的高度信息。
-- 这一题可以用线段树来解。用线段树来解答，可以不用关心“楼挡住楼”的情况。由于楼的坐标是离散的，所以先把楼在 X 轴上两个坐标离散化。同第 699 题一样，楼的宽度是一个区间，但是离散的过程中，楼的宽度右边界需要减一，不然查询一个区间会包含两个点，导致错误的结果，例如，第一个楼是 [1,3)，楼高 10，第二个楼是 [3,6)，楼高 20 。第一个楼如果算上右边界 3，查询 [1,3] 的结果是 20，因为 [3,3] 这个点会查询到第二个楼上面去。所以每个楼的右边界应该减一。但是每个楼的右边界也要加入到 query 中，因为最终 query 的结果需要包含这些边界。将离散的数据排序以后，按照楼的信息，每个区间依次 update。最后统计的时候依次统计每个区间，如果当前区间的高度和前一个区间的高度一样，就算是等高的楼。当高度与前一个高度不相同的时候就算是天际线的边缘，就要添加到最后输出数组中。
-- 类似的线段树的题目有：第 715 题，第 732 题，第 699 题。第 715 题是区间更新定值(**不是增减**)，第 218 题可以用扫描线，第 732 题和第 699 题类似，也是俄罗斯方块的题目，但是第 732 题的俄罗斯方块的方块会“断裂”。
-- 这一题用线段树做时间复杂度有点高，可以用扫描线解题。扫描线的思路很简单，用一根根垂直于 X 轴的竖线，从最左边依次扫到最右边，扫描每一条大楼的边界，当进入大楼的左边界的时候，如果没有比这个左边界最高点更高的点，就记录下这个最高点 keyPoint，状态是进入状态。如果扫到一个大楼的左边界，有比它更高的高度，就不记录，因为它不是天际线，它被楼挡楼，挡在其他楼后面了。当扫到一个大楼的右边界的时候，如果是最高点，那么记录下它的状态是离开状态，此时还需要记录下第二高的点。在扫描线扫描的过程中，动态的维护大楼的高度，同时维护最高的高度和第二高的高度。其实只需要维护最高的高度这一个高度，因为当离开状态到来的时候，移除掉当前最高的，剩下的高度里面最高的就是第二高的高度。描述的伪代码如下：
-
- // 扫描线伪代码
- events = {{x: L , height: H , type: entering},
- {x: R , height: H , type: leaving}}
- event.SortByX()
- ds = new DS()
-
- for e in events:
- if entering(e):
- if e.height > ds.max(): ans += [e.height]
- ds.add(e.height)
- if leaving(e):
- ds.remove(e.height)
- if e.height > ds.max(): ans += [ds.max()]
-
-- 动态插入，查找最大值可以选用的数据结构有，最大堆和二叉搜索树。最大堆找最大值 O(1)，插入 O(log n)，但是 remove_by_key 需要 O(n) 的时间复杂度，并且需要自己实现。二叉搜索树，查找 max，添加和删除元素都是 O(log n) 的时间复杂度。
-- 排序的时候也需要注意几个问题：如果大楼的边界相等，并且是进入状态，那么再按照高度从大到小进行排序；如果大楼的边界相等，并且是离开状态，那么高度按照从小到大进行排序。
-
-
-## 代码
-
-```go
-
-package leetcode
-
-import (
- "sort"
-
- "github.com/halfrost/LeetCode-Go/template"
-)
-
-// 解法一 线段树 Segment Tree，时间复杂度 O(n log n)
-func getSkyline(buildings [][]int) [][]int {
- st, ans, lastHeight, check := template.SegmentTree{}, [][]int{}, 0, false
- posMap, pos := discretization218(buildings)
- tmp := make([]int, len(posMap))
- st.Init(tmp, func(i, j int) int {
- return max(i, j)
- })
- for _, b := range buildings {
- st.UpdateLazy(posMap[b[0]], posMap[b[1]-1], b[2])
- }
- for i := 0; i < len(pos); i++ {
- h := st.QueryLazy(posMap[pos[i]], posMap[pos[i]])
- if check == false && h != 0 {
- ans = append(ans, []int{pos[i], h})
- check = true
- } else if i > 0 && h != lastHeight {
- ans = append(ans, []int{pos[i], h})
- }
- lastHeight = h
- }
- return ans
-}
-
-func discretization218(positions [][]int) (map[int]int, []int) {
- tmpMap, posArray, posMap := map[int]int{}, []int{}, map[int]int{}
- for _, pos := range positions {
- tmpMap[pos[0]]++
- tmpMap[pos[1]-1]++
- tmpMap[pos[1]]++
- }
- for k := range tmpMap {
- posArray = append(posArray, k)
- }
- sort.Ints(posArray)
- for i, pos := range posArray {
- posMap[pos] = i
- }
- return posMap, posArray
-}
-
-// 解法二 扫描线 Sweep Line，时间复杂度 O(n log n)
-func getSkyline1(buildings [][]int) [][]int {
- size := len(buildings)
- es := make([]E, 0)
- for i, b := range buildings {
- l := b[0]
- r := b[1]
- h := b[2]
- // 1-- enter
- el := NewE(i, l, h, 0)
- es = append(es, el)
- // 0 -- leave
- er := NewE(i, r, h, 1)
- es = append(es, er)
- }
- skyline := make([][]int, 0)
- sort.Slice(es, func(i, j int) bool {
- if es[i].X == es[j].X {
- if es[i].T == es[j].T {
- if es[i].T == 0 {
- return es[i].H > es[j].H
- }
- return es[i].H < es[j].H
- }
- return es[i].T < es[j].T
- }
- return es[i].X < es[j].X
- })
- pq := NewIndexMaxPQ(size)
- for _, e := range es {
- curH := pq.Front()
- if e.T == 0 {
- if e.H > curH {
- skyline = append(skyline, []int{e.X, e.H})
- }
- pq.Enque(e.N, e.H)
- } else {
- pq.Remove(e.N)
- h := pq.Front()
- if curH > h {
- skyline = append(skyline, []int{e.X, h})
- }
- }
- }
- return skyline
-}
-
-// 扫面线伪代码
-// events = {{x: L , height: H , type: entering},
-// {x: R , height: H , type: leaving}}
-// event.SortByX()
-// ds = new DS()
-
-// for e in events:
-// if entering(e):
-// if e.height > ds.max(): ans += [e.height]
-// ds.add(e.height)
-// if leaving(e):
-// ds.remove(e.height)
-// if e.height > ds.max(): ans += [ds.max()]
-
-// E define
-type E struct { // 定义一个 event 事件
- N int // number 编号
- X int // x 坐标
- H int // height 高度
- T int // type 0-进入 1-离开
-}
-
-// NewE define
-func NewE(n, x, h, t int) E {
- return E{
- N: n,
- X: x,
- H: h,
- T: t,
- }
-}
-
-// IndexMaxPQ define
-type IndexMaxPQ struct {
- items []int
- pq []int
- qp []int
- total int
-}
-
-// NewIndexMaxPQ define
-func NewIndexMaxPQ(n int) IndexMaxPQ {
- qp := make([]int, n)
- for i := 0; i < n; i++ {
- qp[i] = -1
- }
- return IndexMaxPQ{
- items: make([]int, n),
- pq: make([]int, n+1),
- qp: qp,
- }
-}
-
-// Enque define
-func (q *IndexMaxPQ) Enque(key, val int) {
- q.total++
- q.items[key] = val
- q.pq[q.total] = key
- q.qp[key] = q.total
- q.swim(q.total)
-}
-
-// Front define
-func (q *IndexMaxPQ) Front() int {
- if q.total < 1 {
- return 0
- }
- return q.items[q.pq[1]]
-}
-
-// Remove define
-func (q *IndexMaxPQ) Remove(key int) {
- rank := q.qp[key]
- q.exch(rank, q.total)
- q.total--
- q.qp[key] = -1
- q.sink(rank)
-}
-
-func (q *IndexMaxPQ) sink(n int) {
- for 2*n <= q.total {
- k := 2 * n
- if k < q.total && q.less(k, k+1) {
- k++
- }
- if q.less(k, n) {
- break
- }
- q.exch(k, n)
- n = k
- }
-}
-
-func (q *IndexMaxPQ) swim(n int) {
- for n > 1 {
- k := n / 2
- if q.less(n, k) {
- break
- }
- q.exch(n, k)
- n = k
- }
-}
-
-func (q *IndexMaxPQ) exch(i, j int) {
- q.pq[i], q.pq[j] = q.pq[j], q.pq[i]
- q.qp[q.pq[i]] = i
- q.qp[q.pq[j]] = j
-}
-
-func (q *IndexMaxPQ) less(i, j int) bool {
- return q.items[q.pq[i]] < q.items[q.pq[j]]
-}
-
-```
\ No newline at end of file
diff --git a/website/content/ChapterFour/0220.Contains-Duplicate-III.md b/website/content/ChapterFour/0220.Contains-Duplicate-III.md
deleted file mode 100644
index 9dcd3f1ba..000000000
--- a/website/content/ChapterFour/0220.Contains-Duplicate-III.md
+++ /dev/null
@@ -1,103 +0,0 @@
-# [220. Contains Duplicate III](https://leetcode.com/problems/contains-duplicate-iii/)
-
-## 题目
-
-Given an array of integers, find out whether there are two distinct indices i and j in the array such that the **absolute** difference between **nums[i]** and **nums[j]** is at most t and the **absolute** difference between i and j is at most k.
-
-**Example 1**:
-
- Input: nums = [1,2,3,1], k = 3, t = 0
- Output: true
-
-**Example 2**:
-
- Input: nums = [1,0,1,1], k = 1, t = 2
- Output: true
-
-**Example 3**:
-
- Input: nums = [1,5,9,1,5,9], k = 2, t = 3
- Output: false
-
-
-
-
-## 题目大意
-
-给出一个数组 num，再给 K 和 t。问在 num 中能否找到一组 i 和 j，使得 num[i] 和 num[j] 的绝对差值最大为 t，并且 i 和 j 之前的绝对差值最大为 k。
-
-## 解题思路
-
-
-- 给出一个数组，要求在数组里面找到 2 个索引，`i` 和 `j`，使得 `| nums[i] - nums[j] | ≤ t` ，并且 `| i - j | ≤ k` 。
-- 这是一道滑动窗口的题目。第一想法就是用 `i` 和 `j` 两个指针，针对每个 `i` ，都从 `i + 1` 往后扫完整个数组，判断每个 `i` 和 `j` ，判断是否满足题意。`j` 在循环的过程中注意判断剪枝条件 `| i - j | ≤ k`。这个做法的时间复杂度是 O(n^2)。这个做法慢的原因在于滑动窗口的左边界和右边界在滑动过程中不是联动滑动的。
-- 于是考虑，如果数组是有序的呢？把数组按照元素值从小到大进行排序，如果元素值相等，就按照 index 从小到大进行排序。在这样有序的数组中找满足题意的 `i` 和 `j`，滑动窗口左边界和右边界就是联动的了。窗口的右边界滑到与左边界元素值的差值 ≤ t 的地方，满足了这个条件再判断 `| i - j | ≤ k`，如果右边界与左边界元素值的差值 > t 了，说明该把左边界往右移动了(能这样移动的原因就是因为我们将数组元素大小排序了，右移是增大元素的方向)。移动左边界的时候需要注意左边界不能超过右边界。这样滑动窗口一次滑过整个排序后的数组，就可以判断是否存在满足题意的 `i` 和 `j` 。这个做法的时间主要花在排序上了，时间复杂度是 O(n log n)。
-
-
-## 代码
-
-```go
-
-package leetcode
-
-import "sort"
-
-// 解法一 排序 + 滑动窗口
-func containsNearbyAlmostDuplicate(nums []int, k int, t int) bool {
- if len(nums) < 2 {
- return false
- }
- elemList := make([]*elem, len(nums))
- for i, num := range nums {
- elemList[i] = &elem{num, i}
- }
- sort.SliceStable(elemList, func(i, j int) bool {
- if elemList[i].val != elemList[j].val {
- return elemList[i].val < elemList[j].val
- }
- return elemList[i].idx < elemList[j].idx
- })
- i, j := 0, 1
- for j < len(elemList) {
- if elemList[j].val-elemList[i].val <= t {
- if abs(elemList[j].idx-elemList[i].idx) <= k {
- return true
- }
- j++
- } else {
- i++
- if j <= i {
- j++
- }
- }
- }
- return false
-}
-
-type elem struct {
- val int
- idx int
-}
-
-// 解法二 滑动窗口 + 剪枝
-func containsNearbyAlmostDuplicate1(nums []int, k int, t int) bool {
- if len(nums) <= 1 {
- return false
- }
- if k <= 0 {
- return false
- }
- n := len(nums)
- for i := 0; i < n; i++ {
- count := 0
- for j := i + 1; j < n && count < k; j++ {
- if abs(nums[i]-nums[j]) <= t {
- return true
- }
- count++
- }
- }
- return false
-}
-
-```
\ No newline at end of file
diff --git a/website/content/ChapterFour/0226.Invert-Binary-Tree.md b/website/content/ChapterFour/0226.Invert-Binary-Tree.md
deleted file mode 100644
index 8fae9dff0..000000000
--- a/website/content/ChapterFour/0226.Invert-Binary-Tree.md
+++ /dev/null
@@ -1,76 +0,0 @@
-# [226. Invert Binary Tree](https://leetcode.com/problems/invert-binary-tree/)
-
-## 题目
-
-Invert a binary tree.
-
-**Example**:
-
-Input:
-
-```
-
- 4
- / \
- 2 7
- / \ / \
-1 3 6 9
-
-```
-
-Output:
-
-```
-
- 4
- / \
- 7 2
- / \ / \
-9 6 3 1
-
-```
-
-Trivia:
-
-This problem was inspired by this original tweet by Max Howell:
-
->Google: 90% of our engineers use the software you wrote (Homebrew), but you can’t invert a binary tree on a whiteboard so f*** off.
-
-
-## 题目大意
-
-"经典"的反转二叉树的问题。
-
-
-## 解题思路
-
-还是用递归来解决，先递归调用反转根节点的左孩子，然后递归调用反转根节点的右孩子，然后左右交换根节点的左孩子和右孩子。
-
-
-
-
-## 代码
-
-```go
-
-package leetcode
-
-/**
- * Definition for a binary tree node.
- * type TreeNode struct {
- * Val int
- * Left *TreeNode
- * Right *TreeNode
- * }
- */
-func invertTree(root *TreeNode) *TreeNode {
- if root == nil {
- return nil
- }
- invertTree(root.Left)
- invertTree(root.Right)
- root.Left, root.Right = root.Right, root.Left
- return root
-}
-
-```
\ No newline at end of file
diff --git a/website/content/ChapterFour/0234.Palindrome-Linked-List.md b/website/content/ChapterFour/0234.Palindrome-Linked-List.md
deleted file mode 100644
index f883bea3c..000000000
--- a/website/content/ChapterFour/0234.Palindrome-Linked-List.md
+++ /dev/null
@@ -1,111 +0,0 @@
-# [234. Palindrome Linked List](https://leetcode.com/problems/palindrome-linked-list/)
-
-## 题目
-
-Given a singly linked list, determine if it is a palindrome.
-
-**Example 1**:
-
-```
-
-Input: 1->2
-Output: false
-
-```
-
-**Example 2**:
-
-```
-
-Input: 1->2->2->1
-Output: true
-
-```
-
-**Follow up**:
-
-Could you do it in O(n) time and O(1) space?
-
-## 题目大意
-
-判断一个链表是否是回文链表。要求时间复杂度 O(n)，空间复杂度 O(1)。
-
-## 解题思路
-
-这道题只需要在第 143 题上面改改就可以了。思路是完全一致的。先找到中间结点，然后反转中间结点后面到结尾的所有结点。最后一一判断头结点开始的结点和中间结点往后开始的结点是否相等。如果一直相等，就是回文链表，如果有不相等的，直接返回不是回文链表。
-
-## 代码
-
-```go
-
-package leetcode
-
-/**
- * Definition for singly-linked list.
- * type ListNode struct {
- * Val int
- * Next *ListNode
- * }
- */
-
-// 此题和 143 题 Reorder List 思路基本一致
-func isPalindrome234(head *ListNode) bool {
- if head == nil || head.Next == nil {
- return true
- }
- res := true
- // 寻找中间结点
- p1 := head
- p2 := head
- for p2.Next != nil && p2.Next.Next != nil {
- p1 = p1.Next
- p2 = p2.Next.Next
- }
-
- // 反转链表后半部分 1->2->3->4->5->6 to 1->2->3->6->5->4
- preMiddle := p1
- preCurrent := p1.Next
- for preCurrent.Next != nil {
- current := preCurrent.Next
- preCurrent.Next = current.Next
- current.Next = preMiddle.Next
- preMiddle.Next = current
- }
-
- // 扫描表，判断是否是回文
- p1 = head
- p2 = preMiddle.Next
- // fmt.Printf("p1 = %v p2 = %v preMiddle = %v head = %v\n", p1.Val, p2.Val, preMiddle.Val, L2ss(head))
- for p1 != preMiddle {
- // fmt.Printf("*****p1 = %v p2 = %v preMiddle = %v head = %v\n", p1, p2, preMiddle, L2ss(head))
- if p1.Val == p2.Val {
- p1 = p1.Next
- p2 = p2.Next
- // fmt.Printf("-------p1 = %v p2 = %v preMiddle = %v head = %v\n", p1, p2, preMiddle, L2ss(head))
- } else {
- res = false
- break
- }
- }
- if p1 == preMiddle {
- if p2 != nil && p1.Val != p2.Val {
- return false
- }
- }
-
- return res
-}
-
-// L2ss define
-func L2ss(head *ListNode) []int {
- res := []int{}
-
- for head != nil {
- res = append(res, head.Val)
- head = head.Next
- }
-
- return res
-}
-
-```
\ No newline at end of file
diff --git a/website/content/ChapterFour/0237.Delete-Node-in-a-Linked-List.md b/website/content/ChapterFour/0237.Delete-Node-in-a-Linked-List.md
deleted file mode 100644
index c431655d6..000000000
--- a/website/content/ChapterFour/0237.Delete-Node-in-a-Linked-List.md
+++ /dev/null
@@ -1,72 +0,0 @@
-# [237. Delete Node in a Linked List](https://leetcode.com/problems/delete-node-in-a-linked-list/)
-
-## 题目
-
-Write a function to delete a node (except the tail) in a singly linked list, given only access to that node.
-
-Given linked list -- head = [4,5,1,9], which looks like following:
-
-
-
-**Example 1**:
-
-```
-
-Input: head = [4,5,1,9], node = 5
-Output: [4,1,9]
-Explanation: You are given the second node with value 5, the linked list should become 4 -> 1 -> 9 after calling your function.
-
-```
-
-**Example 2**:
-
-```
-
-Input: head = [4,5,1,9], node = 1
-Output: [4,5,9]
-Explanation: You are given the third node with value 1, the linked list should become 4 -> 5 -> 9 after calling your function.
-
-```
-
-**Note**:
-
-- The linked list will have at least two elements.
-- All of the nodes' values will be unique.
-- The given node will not be the tail and it will always be a valid node of the linked list.
-- Do not return anything from your function.
-
-## 题目大意
-
-删除给点结点。没有给链表的头结点。
-
-## 解题思路
-
-其实就是把后面的结点都覆盖上来即可。或者直接当前结点的值等于下一个结点，Next 指针指向下下个结点，这样做也可以，只不过中间有一个结点不被释放，内存消耗多一些。
-
-## 代码
-
-```go
-
-package leetcode
-
-/**
- * Definition for singly-linked list.
- * type ListNode struct {
- * Val int
- * Next *ListNode
- * }
- */
-func deleteNode(node *ListNode) {
- if node == nil {
- return
- }
- cur := node
- for cur.Next.Next != nil {
- cur.Val = cur.Next.Val
- cur = cur.Next
- }
- cur.Val = cur.Next.Val
- cur.Next = nil
-}
-
-```
\ No newline at end of file
diff --git a/website/content/ChapterFour/0242.Valid-Anagram.md b/website/content/ChapterFour/0242.Valid-Anagram.md
deleted file mode 100644
index cc243f3eb..000000000
--- a/website/content/ChapterFour/0242.Valid-Anagram.md
+++ /dev/null
@@ -1,117 +0,0 @@
-# [242. Valid Anagram](https://leetcode.com/problems/valid-anagram/)
-
-## 题目
-
-Given two strings s and t , write a function to determine if t is an anagram of s.
-
-**Example 1**:
-
-```
-
-Input: s = "anagram", t = "nagaram"
-Output: true
-
-```
-
-**Example 2**:
-
-```
-
-Input: s = "rat", t = "car"
-Output: false
-
-```
-
-**Note**:
-
-
-You may assume the string contains only lowercase alphabets.
-
-
-
-**Follow up**:
-
-
-What if the inputs contain unicode characters? How would you adapt your solution to such case?
-
-## 题目大意
-
-给出 2 个字符串 s 和 t，如果 t 中的字母在 s 中都存在，输出 true，否则输出 false。
-
-## 解题思路
-
-这道题可以用打表的方式做。先把 s 中的每个字母都存在一个 26 个容量的数组里面，每个下标依次对应 26 个字母。s 中每个字母都对应表中一个字母，每出现一次就加 1。然后再扫字符串 t，每出现一个字母就在表里面减一。如果都出现了，最终表里面的值肯定都是 0 。最终判断表里面的值是否都是 0 即可，有非 0 的数都输出 false 。
-
-## 代码
-
-```go
-
-package leetcode
-
-// 解法一
-func isAnagram(s string, t string) bool {
- alphabet := make([]int, 26)
- sBytes := []byte(s)
- tBytes := []byte(t)
- if len(sBytes) != len(tBytes) {
- return false
- }
- for i := 0; i < len(sBytes); i++ {
- alphabet[sBytes[i]-'a']++
- }
- for i := 0; i < len(tBytes); i++ {
- alphabet[tBytes[i]-'a']--
- }
- for i := 0; i < 26; i++ {
- if alphabet[i] != 0 {
- return false
- }
- }
- return true
-}
-
-// 解法二
-func isAnagram1(s string, t string) bool {
- if s == "" && t == "" {
- return true
- }
- if s == "" || t == "" {
- return false
- }
- sBytes := []byte(s)
- tBytes := []byte(t)
- if len(sBytes) != len(tBytes) {
- return false
- }
- quickSortByte(sBytes, 0, len(sBytes)-1)
- quickSortByte(tBytes, 0, len(tBytes)-1)
-
- for i := 0; i < len(sBytes); i++ {
- if sBytes[i] != tBytes[i] {
- return false
- }
- }
- return true
-}
-func partitionByte(a []byte, lo, hi int) int {
- pivot := a[hi]
- i := lo - 1
- for j := lo; j < hi; j++ {
- if a[j] > pivot {
- i++
- a[j], a[i] = a[i], a[j]
- }
- }
- a[i+1], a[hi] = a[hi], a[i+1]
- return i + 1
-}
-func quickSortByte(a []byte, lo, hi int) {
- if lo >= hi {
- return
- }
- p := partitionByte(a, lo, hi)
- quickSortByte(a, lo, p-1)
- quickSortByte(a, p+1, hi)
-}
-
-```
\ No newline at end of file
diff --git a/website/content/ChapterFour/0258.Add-Digits.md b/website/content/ChapterFour/0258.Add-Digits.md
deleted file mode 100644
index 8c8119043..000000000
--- a/website/content/ChapterFour/0258.Add-Digits.md
+++ /dev/null
@@ -1,47 +0,0 @@
-# [258. Add Digits](https://leetcode.com/problems/add-digits/)
-
-
-## 题目
-
-Given a non-negative integer `num`, repeatedly add all its digits until the result has only one digit.
-
-**Example**:
-
-```
-Input: 38
-Output: 2
-Explanation: The process is like: 3 + 8 = 11, 1 + 1 = 2.
- Since 2 has only one digit, return it.
-```
-
-**Follow up**: Could you do it without any loop/recursion in O(1) runtime?
-
-## 题目大意
-
-给定一个非负整数 num，反复将各个位上的数字相加，直到结果为一位数。
-
-
-## 解题思路
-
-- 给定一个非负整数，反复加各个位上的数，直到结果为一位数为止，最后输出这一位数。
-- 简单题。按照题意循环累加即可。
-
-## 代码
-
-```go
-
-package leetcode
-
-func addDigits(num int) int {
- for num > 9 {
- cur := 0
- for num != 0 {
- cur += num % 10
- num /= 10
- }
- num = cur
- }
- return num
-}
-
-```
\ No newline at end of file
diff --git a/website/content/ChapterFour/0263.Ugly-Number.md b/website/content/ChapterFour/0263.Ugly-Number.md
deleted file mode 100644
index e677f673f..000000000
--- a/website/content/ChapterFour/0263.Ugly-Number.md
+++ /dev/null
@@ -1,69 +0,0 @@
-# [263. Ugly Number](https://leetcode.com/problems/ugly-number/)
-
-## 题目
-
-Write a program to check whether a given number is an ugly number.
-
-Ugly numbers are positive numbers whose prime factors only include 2, 3, 5.
-
-**Example 1**:
-
-```
-
-Input: 6
-Output: true
-Explanation: 6 = 2 × 3
-
-```
-
-**Example 2**:
-
-```
-Input: 8
-Output: true
-Explanation: 8 = 2 × 2 × 2
-
-```
-
-**Example 3**:
-
-```
-
-Input: 14
-Output: false
-Explanation: 14 is not ugly since it includes another prime factor 7.
-
-```
-
-**Note**:
-
-- 1 is typically treated as an ugly number.
-- Input is within the 32-bit signed integer range: [−2^31, 2^31 − 1].
-
-
-## 题目大意
-
-判断一个数字是否是“丑陋数字”，“丑陋数字”的定义是一个正数，并且因子只包含 2，3，5 。
-
-## 解题思路
-
-依照题意要求做即可。
-
-
-
-## 代码
-
-```go
-
-package leetcode
-
-func isUgly(num int) bool {
- for i := 2; i < 6 && num > 0; i++ {
- for num%i == 0 {
- num /= i
- }
- }
- return num == 1
-}
-
-```
\ No newline at end of file
diff --git a/website/content/ChapterFour/0283.Move-Zeroes.md b/website/content/ChapterFour/0283.Move-Zeroes.md
deleted file mode 100644
index f7c334ea4..000000000
--- a/website/content/ChapterFour/0283.Move-Zeroes.md
+++ /dev/null
@@ -1,55 +0,0 @@
-# [283. Move Zeroes](https://leetcode.com/problems/move-zeroes/)
-
-## 题目
-
-Given an array nums, write a function to move all 0's to the end of it while maintaining the relative order of the non-zero elements.
-
-**Example 1**:
-
-```
-
-Input: [0,1,0,3,12]
-Output: [1,3,12,0,0]
-
-```
-
-**Note**:
-
-- You must do this in-place without making a copy of the array.
-- Minimize the total number of operations.
-
-
-
-## 题目大意
-
-题目要求不能采用额外的辅助空间，将数组中 0 元素都移动到数组的末尾，并且维持所有非 0 元素的相对位置。
-
-## 解题思路
-
-这一题可以只扫描数组一遍，不断的用 i，j 标记 0 和非 0 的元素，然后相互交换，最终到达题目的目的。与这一题相近的题目有第 26 题，第 27 题，第 80 题。
-
-
-## 代码
-
-```go
-
-package leetcode
-
-func moveZeroes(nums []int) {
- if len(nums) == 0 {
- return
- }
- j := 0
- for i := 0; i < len(nums); i++ {
- if nums[i] != 0 {
- if i != j {
- nums[i], nums[j] = nums[j], nums[i]
- j++
- } else {
- j++
- }
- }
- }
-}
-
-```
\ No newline at end of file
diff --git a/website/content/ChapterFour/0300.Longest-Increasing-Subsequence.md b/website/content/ChapterFour/0300.Longest-Increasing-Subsequence.md
deleted file mode 100755
index eb6436a67..000000000
--- a/website/content/ChapterFour/0300.Longest-Increasing-Subsequence.md
+++ /dev/null
@@ -1,79 +0,0 @@
-# [300. Longest Increasing Subsequence](https://leetcode.com/problems/longest-increasing-subsequence/)
-
-
-## 题目
-
-Given an unsorted array of integers, find the length of longest increasing subsequence.
-
-**Example**:
-
- Input: [10,9,2,5,3,7,101,18]
- Output: 4
- Explanation: The longest increasing subsequence is [2,3,7,101], therefore the length is 4.
-
-**Note**:
-
-- There may be more than one LIS combination, it is only necessary for you to return the length.
-- Your algorithm should run in O(n^2) complexity.
-
-**Follow up**: Could you improve it to O(n log n) time complexity?
-
-## 题目大意
-
-给定一个无序的整数数组，找到其中最长上升子序列的长度。
-
-
-## 解题思路
-
-- 给定一个整数序列，求其中的最长上升子序列的长度。这一题就是经典的最长上升子序列的问题。
-- `dp[i]` 代表为第 i 个数字为结尾的最长上升子序列的长度。换种表述，dp[i] 代表 [0,i] 范围内，选择数字 nums[i] 可以获得的最长上升子序列的长度。状态转移方程为 `dp[i] = max( 1 + dp[j]) ，其中 j < i && nums[j] > nums[i]`，取所有满足条件的最大值。时间复杂度 O(n^2)
-- 这道题还有一种更快的解法。考虑这样一个问题，我们是否能用一个数组，记录上升子序列的最末尾的一个数字呢？如果这个数字越小，那么这个子序列往后面添加数字的几率就越大，那么就越可能成为最长的上升子序列。举个例子：nums = [4,5,6,3]，它的所有的上升子序列为
-
-```
- len = 1 : [4], [5], [6], [3] => tails[0] = 3
- len = 2 : [4, 5], [5, 6] => tails[1] = 5
- len = 3 : [4, 5, 6] => tails[2] = 6
-```
-- 其中 `tails[i]` 中存储的是所有长度为 i + 1 的上升子序列中末尾最小的值。也很容易证明 `tails` 数组里面的值一定是递增的(因为我们用末尾的数字描述最长递增子序列)。既然 tails 是有序的，我们就可以用二分查找的方法去更新这个 tail 数组里面的值。更新策略如下：(1). 如果 x 比所有的 tails 元素都要大，那么就直接放在末尾，并且 tails 数组长度加一；(2). 如果 `tails[i-1] < x <= tails[i]`，则更新 tails[i]，因为 x 更小，更能获得最长上升子序列。最终 tails 数组的长度即为最长的上升子序列。这种做法的时间复杂度 O(n log n)。
-
-
-
-## 代码
-
-```go
-
-package leetcode
-
-import "sort"
-
-// 解法一 O(n^2) DP
-func lengthOfLIS(nums []int) int {
- dp, res := make([]int, len(nums)+1), 0
- dp[0] = 0
- for i := 1; i <= len(nums); i++ {
- for j := 1; j < i; j++ {
- if nums[j-1] < nums[i-1] {
- dp[i] = max(dp[i], dp[j])
- }
- }
- dp[i] = dp[i] + 1
- res = max(res, dp[i])
- }
- return res
-}
-
-// 解法二 O(n log n) DP
-func lengthOfLIS1(nums []int) int {
- dp := []int{}
- for _, num := range nums {
- i := sort.SearchInts(dp, num)
- if i == len(dp) {
- dp = append(dp, num)
- } else {
- dp[i] = num
- }
- }
- return len(dp)
-}
-
-```
\ No newline at end of file
diff --git a/website/content/ChapterFour/0300~0399/0300.Longest-Increasing-Subsequence.md b/website/content/ChapterFour/0300~0399/0300.Longest-Increasing-Subsequence.md
new file mode 100755
index 000000000..3692985ac
--- /dev/null
+++ b/website/content/ChapterFour/0300~0399/0300.Longest-Increasing-Subsequence.md
@@ -0,0 +1,87 @@
+# [300. Longest Increasing Subsequence](https://leetcode.com/problems/longest-increasing-subsequence/)
+
+
+## 题目
+
+Given an unsorted array of integers, find the length of longest increasing subsequence.
+
+**Example**:
+
+ Input: [10,9,2,5,3,7,101,18]
+ Output: 4
+ Explanation: The longest increasing subsequence is [2,3,7,101], therefore the length is 4.
+
+**Note**:
+
+- There may be more than one LIS combination, it is only necessary for you to return the length.
+- Your algorithm should run in O(n^2) complexity.
+
+**Follow up**: Could you improve it to O(n log n) time complexity?
+
+## 题目大意
+
+给定一个无序的整数数组，找到其中最长上升子序列的长度。
+
+
+## 解题思路
+
+- 给定一个整数序列，求其中的最长上升子序列的长度。这一题就是经典的 LIS 最长上升子序列的问题。
+- `dp[i]` 代表为第 i 个数字为结尾的最长上升子序列的长度。换种表述，dp[i] 代表 [0,i] 范围内，选择数字 nums[i] 可以获得的最长上升子序列的长度。状态转移方程为 `dp[i] = max( 1 + dp[j]) ，其中 j < i && nums[j] > nums[i]`，取所有满足条件的最大值。时间复杂度 O(n^2)
+- 这道题还有一种更快的解法。考虑这样一个问题，我们是否能用一个数组，记录上升子序列的最末尾的一个数字呢？如果这个数字越小，那么这个子序列往后面添加数字的几率就越大，那么就越可能成为最长的上升子序列。举个例子：nums = [4,5,6,3]，它的所有的上升子序列为
+
+```
+ len = 1 : [4], [5], [6], [3] => tails[0] = 3
+ len = 2 : [4, 5], [5, 6] => tails[1] = 5
+ len = 3 : [4, 5, 6] => tails[2] = 6
+```
+- 其中 `tails[i]` 中存储的是所有长度为 i + 1 的上升子序列中末尾最小的值。也很容易证明 `tails` 数组里面的值一定是递增的(因为我们用末尾的数字描述最长递增子序列)。既然 tails 是有序的，我们就可以用二分查找的方法去更新这个 tail 数组里面的值。更新策略如下：(1). 如果 x 比所有的 tails 元素都要大，那么就直接放在末尾，并且 tails 数组长度加一，这里对应解法二中，二分搜索找不到对应的元素值，直接把 num 放在 dp[] 的最后；(2). 如果 `tails[i-1] < x <= tails[i]`，则更新 tails[i]，因为 x 更小，更能获得最长上升子序列，这一步对应解法二中将 dp[i] 更新为 num。最终 tails 数组的长度即为最长的上升子序列。这种做法的时间复杂度 O(n log n)。
+- 此题是一维的 LIS 问题。二维的 LIS 问题是第 354 题。三维的 LIS 问题是第 1691 题。
+
+
+
+## 代码
+
+```go
+
+package leetcode
+
+import "sort"
+
+// 解法一 O(n^2) DP
+func lengthOfLIS(nums []int) int {
+ dp, res := make([]int, len(nums)+1), 0
+ dp[0] = 0
+ for i := 1; i <= len(nums); i++ {
+ for j := 1; j < i; j++ {
+ if nums[j-1] < nums[i-1] {
+ dp[i] = max(dp[i], dp[j])
+ }
+ }
+ dp[i] = dp[i] + 1
+ res = max(res, dp[i])
+ }
+ return res
+}
+
+// 解法二 O(n log n) DP
+func lengthOfLIS1(nums []int) int {
+ dp := []int{}
+ for _, num := range nums {
+ i := sort.SearchInts(dp, num)
+ if i == len(dp) {
+ dp = append(dp, num)
+ } else {
+ dp[i] = num
+ }
+ }
+ return len(dp)
+}
+
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0200~0299/0299.Bulls-and-Cows/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0300~0399/0301.Remove-Invalid-Parentheses/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0300~0399/0301.Remove-Invalid-Parentheses.md b/website/content/ChapterFour/0300~0399/0301.Remove-Invalid-Parentheses.md
new file mode 100644
index 000000000..db483d160
--- /dev/null
+++ b/website/content/ChapterFour/0300~0399/0301.Remove-Invalid-Parentheses.md
@@ -0,0 +1,138 @@
+# [301. Remove Invalid Parentheses](https://leetcode.com/problems/remove-invalid-parentheses/)
+
+
+## 题目
+
+Given a string s that contains parentheses and letters, remove the minimum number of invalid parentheses to make the input string valid.
+
+Return all the possible results. You may return the answer in any order.
+
+**Example 1:**
+
+ Input: s = "()())()"
+ Output: ["(())()","()()()"]
+
+**Example 2:**
+
+ Input: s = "(a)())()"
+ Output: ["(a())()","(a)()()"]
+
+**Example 3:**
+
+ Input: s = ")("
+ Output: [""]
+
+**Constraints:**
+
+- 1 <= s.length <= 25
+- s consists of lowercase English letters and parentheses '(' and ')'.
+- There will be at most 20 parentheses in s.
+
+## 题目大意
+
+给你一个由若干括号和字母组成的字符串 s ，删除最小数量的无效括号，使得输入的字符串有效。
+
+返回所有可能的结果。答案可以按 任意顺序 返回。
+
+说明:
+
+- 1 <= s.length <= 25
+- s 由小写英文字母以及括号 '(' 和 ')' 组成
+- s 中至多含 20 个括号
+
+
+## 解题思路
+
+回溯和剪枝
+- 计算最大得分数maxScore，合法字符串的长度length，左括号和右括号的移除次数lmoves,rmoves
+- 加一个左括号的得分加1；加一个右括号的得分减1
+- 对于一个合法的字符串，左括号等于右括号，得分最终为0；
+- 搜索过程中出现以下任何一种情况都直接返回
+ - 得分值为负数
+ - 得分大于最大得分数
+ - 得分小于0
+ - lmoves小于0
+ - rmoves小于0
+
+## 代码
+
+```go
+
+package leetcode
+
+var (
+ res []string
+ mp map[string]int
+ n int
+ length int
+ maxScore int
+ str string
+)
+
+func removeInvalidParentheses(s string) []string {
+ lmoves, rmoves, lcnt, rcnt := 0, 0, 0, 0
+ for _, v := range s {
+ if v == '(' {
+ lmoves++
+ lcnt++
+ } else if v == ')' {
+ if lmoves != 0 {
+ lmoves--
+ } else {
+ rmoves++
+ }
+ rcnt++
+ }
+ }
+ n = len(s)
+ length = n - lmoves - rmoves
+ res = []string{}
+ mp = make(map[string]int)
+ maxScore = min(lcnt, rcnt)
+ str = s
+ backtrace(0, "", lmoves, rmoves, 0)
+ return res
+}
+
+func backtrace(i int, cur string, lmoves int, rmoves int, score int) {
+ if lmoves < 0 || rmoves < 0 || score < 0 || score > maxScore {
+ return
+ }
+ if lmoves == 0 && rmoves == 0 {
+ if len(cur) == length {
+ if _, ok := mp[cur]; !ok {
+ res = append(res, cur)
+ mp[cur] = 1
+ }
+ return
+ }
+ }
+ if i == n {
+ return
+ }
+ if str[i] == '(' {
+ backtrace(i+1, cur+string('('), lmoves, rmoves, score+1)
+ backtrace(i+1, cur, lmoves-1, rmoves, score)
+ } else if str[i] == ')' {
+ backtrace(i+1, cur+string(')'), lmoves, rmoves, score-1)
+ backtrace(i+1, cur, lmoves, rmoves-1, score)
+ } else {
+ backtrace(i+1, cur+string(str[i]), lmoves, rmoves, score)
+ }
+}
+
+func min(a, b int) int {
+ if a < b {
+ return a
+ }
+ return b
+}
+
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0300~0399/0300.Longest-Increasing-Subsequence/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0300~0399/0303.Range-Sum-Query-Immutable/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0300~0399/0303.Range-Sum-Query-Immutable.md b/website/content/ChapterFour/0300~0399/0303.Range-Sum-Query-Immutable.md
new file mode 100755
index 000000000..8b49288ba
--- /dev/null
+++ b/website/content/ChapterFour/0300~0399/0303.Range-Sum-Query-Immutable.md
@@ -0,0 +1,117 @@
+# [303. Range Sum Query - Immutable](https://leetcode.com/problems/range-sum-query-immutable/)
+
+
+## 题目
+
+Given an integer array nums, find the sum of the elements between indices i and j (i ≤ j), inclusive.
+
+**Example**:
+
+ Given nums = [-2, 0, 3, -5, 2, -1]
+
+ sumRange(0, 2) -> 1
+ sumRange(2, 5) -> -1
+ sumRange(0, 5) -> -3
+
+**Note**:
+
+1. You may assume that the array does not change.
+2. There are many calls to sumRange function.
+
+
+## 题目大意
+
+给定一个整数数组 nums，求出数组从索引 i 到 j (i ≤ j) 范围内元素的总和，包含 i, j 两点。
+
+示例：
+
+```
+给定 nums = [-2, 0, 3, -5, 2, -1]，求和函数为 sumRange()
+
+sumRange(0, 2) -> 1
+sumRange(2, 5) -> -1
+sumRange(0, 5) -> -3
+
+```
+
+说明:
+
+- 你可以假设数组不可变。
+- 会多次调用 sumRange 方法。
+
+
+## 解题思路
+
+
+- 给出一个数组，数组里面的数都是`**不可变**`的，设计一个数据结构能够满足查询数组任意区间内元素的和。
+- 这一题由于数组里面的元素都是`**不可变**`的，所以可以用 2 种方式来解答，第一种解法是用 prefixSum，通过累计和相减的办法来计算区间内的元素和，初始化的时间复杂度是 O(n)，但是查询区间元素和的时间复杂度是 O(1)。第二种解法是利用线段树，构建一颗线段树，父结点内存的是两个子结点的和，初始化建树的时间复杂度是 O(log n)，查询区间元素和的时间复杂度是 O(log n)。
+
+
+## 代码
+
+```go
+
+package leetcode
+
+import (
+ "github.com/halfrost/leetcode-go/template"
+)
+
+//解法一 线段树，sumRange 时间复杂度 O(1)
+
+// NumArray define
+type NumArray struct {
+ st *template.SegmentTree
+}
+
+// Constructor303 define
+func Constructor303(nums []int) NumArray {
+ st := template.SegmentTree{}
+ st.Init(nums, func(i, j int) int {
+ return i + j
+ })
+ return NumArray{st: &st}
+}
+
+// SumRange define
+func (ma *NumArray) SumRange(i int, j int) int {
+ return ma.st.Query(i, j)
+}
+
+//解法二 prefixSum，sumRange 时间复杂度 O(1)
+
+// // NumArray define
+// type NumArray struct {
+// prefixSum []int
+// }
+
+// // Constructor303 define
+// func Constructor303(nums []int) NumArray {
+// for i := 1; i < len(nums); i++ {
+// nums[i] += nums[i-1]
+// }
+// return NumArray{prefixSum: nums}
+// }
+
+// // SumRange define
+// func (this *NumArray) SumRange(i int, j int) int {
+// if i > 0 {
+// return this.prefixSum[j] - this.prefixSum[i-1]
+// }
+// return this.prefixSum[j]
+// }
+
+/**
+ * Your NumArray object will be instantiated and called as such:
+ * obj := Constructor(nums);
+ * param_1 := obj.SumRange(i,j);
+ */
+
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0300~0399/0301.Remove-Invalid-Parentheses/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0300~0399/0304.Range-Sum-Query-2D-Immutable/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0300~0399/0304.Range-Sum-Query-2D-Immutable.md b/website/content/ChapterFour/0300~0399/0304.Range-Sum-Query-2D-Immutable.md
new file mode 100644
index 000000000..c70fa06cf
--- /dev/null
+++ b/website/content/ChapterFour/0300~0399/0304.Range-Sum-Query-2D-Immutable.md
@@ -0,0 +1,101 @@
+# [304. Range Sum Query 2D - Immutable](https://leetcode.com/problems/range-sum-query-2d-immutable/)
+
+
+## 题目
+
+Given a 2D matrix matrix, find the sum of the elements inside the rectangle defined by its upper left corner (row1, col1) and lower right corner (row2, col2).
+
+
+
+The above rectangle (with the red border) is defined by (row1, col1) = **(2, 1)** and (row2, col2) = **(4, 3)**, which contains sum = **8**.
+
+**Example:**
+
+```
+Given matrix = [
+ [3, 0, 1, 4, 2],
+ [5, 6, 3, 2, 1],
+ [1, 2, 0, 1, 5],
+ [4, 1, 0, 1, 7],
+ [1, 0, 3, 0, 5]
+]
+
+sumRegion(2, 1, 4, 3) -> 8
+sumRegion(1, 1, 2, 2) -> 11
+sumRegion(1, 2, 2, 4) -> 12
+
+```
+
+**Note:**
+
+1. You may assume that the matrix does not change.
+2. There are many calls to sumRegion function.
+3. You may assume that row1 ≤ row2 and col1 ≤ col2.
+
+## 题目大意
+
+给定一个二维矩阵，计算其子矩形范围内元素的总和，该子矩阵的左上角为 (row1, col1) ，右下角为 (row2, col2) 。
+
+## 解题思路
+
+- 这一题是一维数组前缀和的进阶版本。定义 f(x,y) 代表矩形左上角 (0,0)，右下角 (x,y) 内的元素和。{{< katex display >}} f(i,j) = \sum_{x=0}^{i}\sum_{y=0}^{j} Matrix[x][y]{{< /katex >}}
+
+ {{< katex display >}}
+ \begin{aligned}
+ f(i,j) &= \sum_{x=0}^{i-1}\sum_{y=0}^{j-1} Matrix[x][y] + \sum_{x=0}^{i-1} Matrix[x][j] + \sum_{y=0}^{j-1} Matrix[i][y] + Matrix[i][j]\\
+ &= (\sum_{x=0}^{i-1}\sum_{y=0}^{j-1} Matrix[x][y] + \sum_{x=0}^{i-1} Matrix[x][j]) + (\sum_{x=0}^{i-1}\sum_{y=0}^{j-1} Matrix[x][y] + \sum_{y=0}^{j-1} Matrix[i][y]) - \sum_{x=0}^{i-1}\sum_{y=0}^{j-1} Matrix[x][y] + Matrix[i][j]\\
+ &= \sum_{x=0}^{i-1}\sum_{y=0}^{j} Matrix[x][y] + \sum_{x=0}^{i}\sum_{y=0}^{j-1} Matrix[x][y] - \sum_{x=0}^{i-1}\sum_{y=0}^{j-1} Matrix[x][y] + Matrix[i][j]\\
+ &= f(i-1,j) + f(i,j-1) - f(i-1,j-1) + Matrix[i][j]
+ \end{aligned}
+ {{< /katex >}}
+
+- 于是得到递推的关系式：`f(i, j) = f(i-1, j) + f(i, j-1) - f(i-1, j-1) + matrix[i][j]`，写代码为了方便，新建一个 `m+1 * n+1` 的矩阵，这样就不需要对 `row = 0` 和 `col = 0` 做单独处理了。上述推导公式如果画成图也很好理解：
+
+ 
+
+ 左图中大的矩形由粉红色的矩形 + 绿色矩形 - 粉红色和绿色重叠部分 + 黄色部分。这就对应的是上面推导出来的递推公式。左图是矩形左上角为 (0，0) 的情况，更加一般的情况是右图，左上角是任意的坐标，公式不变。
+
+- 时间复杂度：初始化 O(mn)，查询 O(1)。空间复杂度 O(mn)
+
+## 代码
+
+```go
+package leetcode
+
+type NumMatrix struct {
+ cumsum [][]int
+}
+
+func Constructor(matrix [][]int) NumMatrix {
+ if len(matrix) == 0 {
+ return NumMatrix{nil}
+ }
+ cumsum := make([][]int, len(matrix)+1)
+ cumsum[0] = make([]int, len(matrix[0])+1)
+ for i := range matrix {
+ cumsum[i+1] = make([]int, len(matrix[i])+1)
+ for j := range matrix[i] {
+ cumsum[i+1][j+1] = matrix[i][j] + cumsum[i][j+1] + cumsum[i+1][j] - cumsum[i][j]
+ }
+ }
+ return NumMatrix{cumsum}
+}
+
+func (this *NumMatrix) SumRegion(row1 int, col1 int, row2 int, col2 int) int {
+ cumsum := this.cumsum
+ return cumsum[row2+1][col2+1] - cumsum[row1][col2+1] - cumsum[row2+1][col1] + cumsum[row1][col1]
+}
+
+/**
+ * Your NumMatrix object will be instantiated and called as such:
+ * obj := Constructor(matrix);
+ * param_1 := obj.SumRegion(row1,col1,row2,col2);
+ */
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0300~0399/0303.Range-Sum-Query-Immutable/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0300~0399/0306.Additive-Number/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0306.Additive-Number.md b/website/content/ChapterFour/0300~0399/0306.Additive-Number.md
similarity index 88%
rename from website/content/ChapterFour/0306.Additive-Number.md
rename to website/content/ChapterFour/0300~0399/0306.Additive-Number.md
index 4d1884720..d93b46929 100755
--- a/website/content/ChapterFour/0306.Additive-Number.md
+++ b/website/content/ChapterFour/0300~0399/0306.Additive-Number.md
@@ -86,4 +86,11 @@ func recursiveCheck(num string, x1 int, x2 int, left int) bool {
return false
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0300~0399/0304.Range-Sum-Query-2D-Immutable/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0300~0399/0307.Range-Sum-Query-Mutable/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0300~0399/0307.Range-Sum-Query-Mutable.md b/website/content/ChapterFour/0300~0399/0307.Range-Sum-Query-Mutable.md
new file mode 100755
index 000000000..50b02e262
--- /dev/null
+++ b/website/content/ChapterFour/0300~0399/0307.Range-Sum-Query-Mutable.md
@@ -0,0 +1,161 @@
+# [307. Range Sum Query - Mutable](https://leetcode.com/problems/range-sum-query-mutable/)
+
+
+## 题目
+
+Given an integer array nums, find the sum of the elements between indices i and j (i ≤ j), inclusive.
+
+The update(i, val) function modifies nums by updating the element at index i to val.
+
+**Example**:
+
+ Given nums = [1, 3, 5]
+
+ sumRange(0, 2) -> 9
+ update(1, 2)
+ sumRange(0, 2) -> 8
+
+**Note**:
+
+1. The array is only modifiable by the update function.
+2. You may assume the number of calls to update and sumRange function is distributed evenly.
+
+
+## 题目大意
+
+给定一个整数数组 nums，求出数组从索引 i 到 j (i ≤ j) 范围内元素的总和，包含 i, j 两点。
+
+update(i, val) 函数可以通过将下标为 i 的数值更新为 val，从而对数列进行修改。
+
+示例:
+
+```
+Given nums = [1, 3, 5]
+
+sumRange(0, 2) -> 9
+update(1, 2)
+sumRange(0, 2) -> 8
+```
+
+说明:
+
+- 数组仅可以在 update 函数下进行修改。
+- 你可以假设 update 函数与 sumRange 函数的调用次数是均匀分布的。
+
+## 解题思路
+
+
+- 给出一个数组，数组里面的数都是`**可变**`的，设计一个数据结构能够满足查询数组任意区间内元素的和。
+- 对比第 303 题，这一题由于数组里面的元素都是**`可变`**的，所以第一个想到的解法就是线段树，构建一颗线段树，父结点内存的是两个子结点的和，初始化建树的时间复杂度是 O(log n)，查询区间元素和的时间复杂度是 O(log n)，更新元素值的时间复杂度是 O(log n)。
+- 如果此题还用 prefixSum 的思路解答呢？那每次 update 操作的时间复杂度都是 O(n)，因为每次更改一个值，最坏情况就是所有的 prefixSum 都要更新一次。prefixSum 的方法在这道题上面也可以 AC，只不过时间排名在 5%，非常差。
+- 此题也可以用树状数组解决。代码很直白，区间查询即是两个区间前缀和相减。最简单的树状数组应用。
+
+
+## 代码
+
+```go
+
+package leetcode
+
+import "github.com/halfrost/leetcode-go/template"
+
+// NumArray define
+type NumArray struct {
+ st *template.SegmentTree
+}
+
+// Constructor307 define
+func Constructor307(nums []int) NumArray {
+ st := template.SegmentTree{}
+ st.Init(nums, func(i, j int) int {
+ return i + j
+ })
+ return NumArray{st: &st}
+}
+
+// Update define
+func (this *NumArray) Update(i int, val int) {
+ this.st.Update(i, val)
+}
+
+// SumRange define
+func (this *NumArray) SumRange(i int, j int) int {
+ return this.st.Query(i, j)
+}
+
+//解法二 prefixSum，sumRange 时间复杂度 O(1)
+
+// // NumArray define
+// type NumArray307 struct {
+// prefixSum []int
+// data []int
+// }
+
+// // Constructor307 define
+// func Constructor307(nums []int) NumArray307 {
+// data := make([]int, len(nums))
+// for i := 0; i < len(nums); i++ {
+// data[i] = nums[i]
+// }
+// for i := 1; i < len(nums); i++ {
+// nums[i] += nums[i-1]
+// }
+// return NumArray307{prefixSum: nums, data: data}
+// }
+
+// // Update define
+// func (this *NumArray307) Update(i int, val int) {
+// this.data[i] = val
+// this.prefixSum[0] = this.data[0]
+// for i := 1; i < len(this.data); i++ {
+// this.prefixSum[i] = this.prefixSum[i-1] + this.data[i]
+// }
+// }
+
+// // SumRange define
+// func (this *NumArray307) SumRange(i int, j int) int {
+// if i > 0 {
+// return this.prefixSum[j] - this.prefixSum[i-1]
+// }
+// return this.prefixSum[j]
+// }
+
+// 解法三 树状数组
+// type NumArray struct {
+// bit template.BinaryIndexedTree
+// data []int
+// }
+
+// // Constructor define
+// func Constructor307(nums []int) NumArray {
+// bit := template.BinaryIndexedTree{}
+// bit.InitWithNums(nums)
+// return NumArray{bit: bit, data: nums}
+// }
+
+// // Update define
+// func (this *NumArray) Update(i int, val int) {
+// this.bit.Add(i+1, val-this.data[i])
+// this.data[i] = val
+// }
+
+// // SumRange define
+// func (this *NumArray) SumRange(i int, j int) int {
+// return this.bit.Query(j+1) - this.bit.Query(i)
+// }
+
+/**
+ * Your NumArray object will be instantiated and called as such:
+ * obj := Constructor(nums);
+ * obj.Update(i,val);
+ * param_2 := obj.SumRange(i,j);
+ */
+
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0300~0399/0306.Additive-Number/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0300~0399/0309.Best-Time-to-Buy-and-Sell-Stock-with-Cooldown/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0309.Best-Time-to-Buy-and-Sell-Stock-with-Cooldown.md b/website/content/ChapterFour/0300~0399/0309.Best-Time-to-Buy-and-Sell-Stock-with-Cooldown.md
similarity index 91%
rename from website/content/ChapterFour/0309.Best-Time-to-Buy-and-Sell-Stock-with-Cooldown.md
rename to website/content/ChapterFour/0300~0399/0309.Best-Time-to-Buy-and-Sell-Stock-with-Cooldown.md
index f9d6d14ab..ebee3b2d3 100755
--- a/website/content/ChapterFour/0309.Best-Time-to-Buy-and-Sell-Stock-with-Cooldown.md
+++ b/website/content/ChapterFour/0300~0399/0309.Best-Time-to-Buy-and-Sell-Stock-with-Cooldown.md
@@ -81,4 +81,11 @@ func maxProfit309_1(prices []int) int {
return sell[(len(prices)-1)%3]
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0300~0399/0307.Range-Sum-Query-Mutable/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0300~0399/0315.Count-of-Smaller-Numbers-After-Self/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0300~0399/0315.Count-of-Smaller-Numbers-After-Self.md b/website/content/ChapterFour/0300~0399/0315.Count-of-Smaller-Numbers-After-Self.md
new file mode 100755
index 000000000..ac37bace0
--- /dev/null
+++ b/website/content/ChapterFour/0300~0399/0315.Count-of-Smaller-Numbers-After-Self.md
@@ -0,0 +1,124 @@
+# [315. Count of Smaller Numbers After Self](https://leetcode.com/problems/count-of-smaller-numbers-after-self/)
+
+
+## 题目
+
+You are given an integer array nums and you have to return a new counts array. The counts array has the property where `counts[i]` is the number of smaller elements to the right of `nums[i]`.
+
+**Example**:
+
+ Input: [5,2,6,1]
+ Output: [2,1,1,0]
+ Explanation:
+ To the right of 5 there are 2 smaller elements (2 and 1).
+ To the right of 2 there is only 1 smaller element (1).
+ To the right of 6 there is 1 smaller element (1).
+ To the right of 1 there is 0 smaller element.
+
+
+## 题目大意
+
+
+给定一个整数数组 nums，按要求返回一个新数组 counts。数组 counts 有该性质： counts[i] 的值是 nums[i] 右侧小于 nums[i] 的元素的数量。
+
+示例:
+
+```
+
+输入: [5,2,6,1]
+输出: [2,1,1,0]
+解释:
+5 的右侧有 2 个更小的元素 (2 和 1).
+2 的右侧仅有 1 个更小的元素 (1).
+6 的右侧有 1 个更小的元素 (1).
+1 的右侧有 0 个更小的元素.
+
+```
+
+
+## 解题思路
+
+
+- 给出一个数组，要求输出数组中每个元素相对于数组中的位置右边比它小的元素。
+- 这一题是第 327 题的缩水版。由于需要找数组位置右边比当前位置元素小的元素，所以从数组右边开始往左边扫。构造一颗线段树，线段树里面父节点存的是子节点出现的次数和。有可能给的数据会很大，所以构造线段树的时候先离散化。还需要注意的是数组里面可能有重复元素，所以构造线段树要先去重并排序。从右往左扫的过程中，依次添加数组中的元素，添加了一次就立即 query 一次。query 的区间是 [minNum, nums[i]-1]。如果是 minNum 则输出 0，并且也要记得插入这个最小值。这一题的思路和第 327 题大体类似，详解可见第 327 题。
+- 这一题同样可以用树状数组来解答。相比 327 题简单很多。第一步还是把所有用到的元素放入 allNums 数组中，第二步排序 + 离散化。由于题目要求输出右侧更小的元素，所以第三步倒序插入构造树状数组，Query 查询 `[1,i-1]` 区间内元素总数即为右侧更小元素个数。注意最终输出是顺序输出，计算是逆序计算的，最终数组里面的答案还需要逆序一遍。相同的套路题有，第 327 题，第 493 题。
+
+## 代码
+
+```go
+
+package leetcode
+
+import (
+ "sort"
+
+ "github.com/halfrost/leetcode-go/template"
+)
+
+// 解法一 线段树
+func countSmaller(nums []int) []int {
+ if len(nums) == 0 {
+ return []int{}
+ }
+ st, minNum, numsMap, numsArray, res := template.SegmentCountTree{}, 0, make(map[int]int, 0), []int{}, make([]int, len(nums))
+ for i := 0; i < len(nums); i++ {
+ numsMap[nums[i]] = nums[i]
+ }
+ for _, v := range numsMap {
+ numsArray = append(numsArray, v)
+ }
+ // 排序是为了使得线段树中的区间 left <= right，如果此处不排序，线段树中的区间有很多不合法。
+ sort.Ints(numsArray)
+ minNum = numsArray[0]
+ // 初始化线段树，节点内的值都赋值为 0，即计数为 0
+ st.Init(numsArray, func(i, j int) int {
+ return 0
+ })
+ for i := len(nums) - 1; i >= 0; i-- {
+ if nums[i] == minNum {
+ res[i] = 0
+ st.UpdateCount(nums[i])
+ continue
+ }
+ st.UpdateCount(nums[i])
+ res[i] = st.Query(minNum, nums[i]-1)
+ }
+ return res
+}
+
+// 解法二 树状数组
+func countSmaller1(nums []int) []int {
+ // copy 一份原数组至所有数字 allNums 数组中
+ allNums, res := make([]int, len(nums)), []int{}
+ copy(allNums, nums)
+ // 将 allNums 离散化
+ sort.Ints(allNums)
+ k := 1
+ kth := map[int]int{allNums[0]: k}
+ for i := 1; i < len(allNums); i++ {
+ if allNums[i] != allNums[i-1] {
+ k++
+ kth[allNums[i]] = k
+ }
+ }
+ // 树状数组 Query
+ bit := template.BinaryIndexedTree{}
+ bit.Init(k)
+ for i := len(nums) - 1; i >= 0; i-- {
+ res = append(res, bit.Query(kth[nums[i]]-1))
+ bit.Add(kth[nums[i]], 1)
+ }
+ for i := 0; i < len(res)/2; i++ {
+ res[i], res[len(res)-1-i] = res[len(res)-1-i], res[i]
+ }
+ return res
+}
+
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0300~0399/0309.Best-Time-to-Buy-and-Sell-Stock-with-Cooldown/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0300~0399/0318.Maximum-Product-of-Word-Lengths/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0318.Maximum-Product-of-Word-Lengths.md b/website/content/ChapterFour/0300~0399/0318.Maximum-Product-of-Word-Lengths.md
similarity index 85%
rename from website/content/ChapterFour/0318.Maximum-Product-of-Word-Lengths.md
rename to website/content/ChapterFour/0300~0399/0318.Maximum-Product-of-Word-Lengths.md
index 7020a8bd2..436375e9b 100755
--- a/website/content/ChapterFour/0318.Maximum-Product-of-Word-Lengths.md
+++ b/website/content/ChapterFour/0300~0399/0318.Maximum-Product-of-Word-Lengths.md
@@ -74,4 +74,11 @@ func maxProduct318(words []string) int {
return maxProduct
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0300~0399/0315.Count-of-Smaller-Numbers-After-Self/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0300~0399/0319.Bulb-Switcher/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0300~0399/0319.Bulb-Switcher.md b/website/content/ChapterFour/0300~0399/0319.Bulb-Switcher.md
new file mode 100644
index 000000000..5a4e16e1e
--- /dev/null
+++ b/website/content/ChapterFour/0300~0399/0319.Bulb-Switcher.md
@@ -0,0 +1,65 @@
+# [319. Bulb Switcher](https://leetcode.com/problems/bulb-switcher/)
+
+
+## 题目
+
+There are n bulbs that are initially off. You first turn on all the bulbs, then you turn off every second bulb.
+
+On the third round, you toggle every third bulb (turning on if it's off or turning off if it's on). For the ith round, you toggle every i bulb. For the nth round, you only toggle the last bulb.
+
+Return the number of bulbs that are on after n rounds.
+
+**Example 1:**
+
+ Input: n = 3
+ Output: 1
+ Explanation: At first, the three bulbs are [off, off, off].
+ After the first round, the three bulbs are [on, on, on].
+ After the second round, the three bulbs are [on, off, on].
+ After the third round, the three bulbs are [on, off, off].
+ So you should return 1 because there is only one bulb is on.
+
+**Example 2:**
+
+ Input: n = 0
+ Output: 0
+
+**Example 3:**
+
+ Input: n = 1
+ Output: 1
+
+## 题目大意
+
+初始时有 n 个灯泡处于关闭状态。第一轮，你将会打开所有灯泡。接下来的第二轮，你将会每两个灯泡关闭一个。
+
+第三轮，你每三个灯泡就切换一个灯泡的开关（即，打开变关闭，关闭变打开）。第 i 轮，你每 i 个灯泡就切换一个灯泡的开关。直到第 n 轮，你只需要切换最后一个灯泡的开关。
+
+找出并返回 n 轮后有多少个亮着的灯泡。
+
+## 解题思路
+
+- 计算 1 到 n 中有奇数个约数的个数
+- 1 到 n 中的某个数 x 有奇数个约数,也即 x 是完全平方数
+- 计算 1 到 n 中完全平方数的个数 sqrt(n)
+
+## 代码
+
+```go
+
+package leetcode
+
+import "math"
+
+func bulbSwitch(n int) int {
+ return int(math.Sqrt(float64(n)))
+}
+
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0300~0399/0318.Maximum-Product-of-Word-Lengths/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0300~0399/0322.Coin-Change/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0322.Coin-Change.md b/website/content/ChapterFour/0300~0399/0322.Coin-Change.md
similarity index 82%
rename from website/content/ChapterFour/0322.Coin-Change.md
rename to website/content/ChapterFour/0300~0399/0322.Coin-Change.md
index ee3adf0b0..a1bd78323 100755
--- a/website/content/ChapterFour/0322.Coin-Change.md
+++ b/website/content/ChapterFour/0300~0399/0322.Coin-Change.md
@@ -58,4 +58,11 @@ func coinChange(coins []int, amount int) int {
return dp[amount]
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0300~0399/0319.Bulb-Switcher/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0300~0399/0324.Wiggle-Sort-II/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0324.Wiggle-Sort-II.md b/website/content/ChapterFour/0300~0399/0324.Wiggle-Sort-II.md
similarity index 94%
rename from website/content/ChapterFour/0324.Wiggle-Sort-II.md
rename to website/content/ChapterFour/0300~0399/0324.Wiggle-Sort-II.md
index d8baed573..5d5a250eb 100644
--- a/website/content/ChapterFour/0324.Wiggle-Sort-II.md
+++ b/website/content/ChapterFour/0300~0399/0324.Wiggle-Sort-II.md
@@ -260,4 +260,11 @@ func wiggleSort1(nums []int) {
}
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0300~0399/0322.Coin-Change/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0300~0399/0326.Power-of-Three/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0326.Power-of-Three.md b/website/content/ChapterFour/0300~0399/0326.Power-of-Three.md
similarity index 81%
rename from website/content/ChapterFour/0326.Power-of-Three.md
rename to website/content/ChapterFour/0300~0399/0326.Power-of-Three.md
index 7455f8647..99596c264 100755
--- a/website/content/ChapterFour/0326.Power-of-Three.md
+++ b/website/content/ChapterFour/0300~0399/0326.Power-of-Three.md
@@ -74,4 +74,11 @@ func isPowerOfThree2(num int) bool {
return num == 1
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0300~0399/0324.Wiggle-Sort-II/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0300~0399/0327.Count-of-Range-Sum/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0327.Count-of-Range-Sum.md b/website/content/ChapterFour/0300~0399/0327.Count-of-Range-Sum.md
similarity index 75%
rename from website/content/ChapterFour/0327.Count-of-Range-Sum.md
rename to website/content/ChapterFour/0300~0399/0327.Count-of-Range-Sum.md
index 87a5d3240..6b57a221f 100755
--- a/website/content/ChapterFour/0327.Count-of-Range-Sum.md
+++ b/website/content/ChapterFour/0300~0399/0327.Count-of-Range-Sum.md
@@ -76,6 +76,8 @@ Given an integer array `nums`, return the number of range sums that lie in `[l
这时候查找区间变为了 `[-3 + prefixSum[0-1], -1 + prefixSum[0-1]] = [-3,-1]`，注意 `prefixSum[-1] = 0`，即判断 `-3 ≤ sum(0, 0,1,2,3,4,5) ≤ -1`，满足等式的有几种情况，这里有六种情况，即 `j = 0`、`j = 1`、`j = 2`、 `j = 3` 、`j = 4` 或者 `j = 5`，满足等式的有 `j = 0`、`j = 1`、 `j = 3` 和 `j = 5`，即 `-3 ≤ sum(0, 0) ≤ -1` 、 `-3 ≤ sum(0, 1) ≤ -1`、`-3 ≤ sum(0, 3) ≤ -1` 和 `-3 ≤ sum(0, 5) ≤ -1`。所以这一步 `res = 4`。最后的答案就是把每一步的结果都累加，`res = 1 + 0 + 2 + 0 + 0 + 4 = 7`。
+- 此题同样可以用树状数组来解答。同样把问题先转化成区间 Query 的模型，`lower ≤ prefixSum(j) - prefixSum(i-1) ≤ upper` 等价于 `prefixSum(j) - upper ≤ prefixSum(i-1) ≤ prefixSum(j) - lower`，`i` 的取值在 `[0,j-1]` 区间内。所以题目可以转化为 `i` 在 `[0,j-1]` 区间内取值，问数组 `prefixSum[0...j-1]` 中的所有取值，位于区间 `[prefixSum(j) - upper, prefixSum(j) - lower]` 内的次数。在树状数组中，区间内的前缀和可以转化为 2 个区间的前缀和相减，即 `Query([i,j]) = Query(j) - Query(i-1)`。所以这道题枚举数组 `prefixSum[0...j-1]` 中每个值是否出现在指定区间内出现次数即可。第一步先将所有的前缀和 `prefixSum(j)` 以及 `[prefixSum(j) - upper, prefixSum(j) - lower]` 计算出来。第二步排序和离散化，离散化以后的点区间为 `[1,n]`。最后根据数组 `prefixSum(j)` 的值在指定区间内查询出现次数即可。相同的套路题有，第 315 题，第 493 题。
+
## 代码
@@ -86,7 +88,7 @@ package leetcode
import (
"sort"
- "github.com/halfrost/LeetCode-Go/template"
+ "github.com/halfrost/leetcode-go/template"
)
// 解法一 线段树，时间复杂度 O(n log n)
@@ -123,8 +125,39 @@ func countRangeSum(nums []int, lower int, upper int) int {
return res
}
-// 解法二 暴力，时间复杂度 O(n^2)
+// 解法二 树状数组，时间复杂度 O(n log n)
func countRangeSum1(nums []int, lower int, upper int) int {
+ n := len(nums)
+ // 计算前缀和 preSum，以及后面统计时会用到的所有数字 allNums
+ allNums, preSum, res := make([]int, 1, 3*n+1), make([]int, n+1), 0
+ for i, v := range nums {
+ preSum[i+1] = preSum[i] + v
+ allNums = append(allNums, preSum[i+1], preSum[i+1]-lower, preSum[i+1]-upper)
+ }
+ // 将 allNums 离散化
+ sort.Ints(allNums)
+ k := 1
+ kth := map[int]int{allNums[0]: k}
+ for i := 1; i <= 3*n; i++ {
+ if allNums[i] != allNums[i-1] {
+ k++
+ kth[allNums[i]] = k
+ }
+ }
+ // 遍历 preSum，利用树状数组计算每个前缀和对应的合法区间数
+ bit := template.BinaryIndexedTree{}
+ bit.Init(k)
+ bit.Add(kth[0], 1)
+ for _, sum := range preSum[1:] {
+ left, right := kth[sum-upper], kth[sum-lower]
+ res += bit.Query(right) - bit.Query(left-1)
+ bit.Add(kth[sum], 1)
+ }
+ return res
+}
+
+// 解法三 暴力，时间复杂度 O(n^2)
+func countRangeSum2(nums []int, lower int, upper int) int {
res, n := 0, len(nums)
for i := 0; i < n; i++ {
tmp := 0
@@ -142,4 +175,11 @@ func countRangeSum1(nums []int, lower int, upper int) int {
return res
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0300~0399/0326.Power-of-Three/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0300~0399/0328.Odd-Even-Linked-List/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0300~0399/0328.Odd-Even-Linked-List.md b/website/content/ChapterFour/0300~0399/0328.Odd-Even-Linked-List.md
new file mode 100644
index 000000000..dcf9585a7
--- /dev/null
+++ b/website/content/ChapterFour/0300~0399/0328.Odd-Even-Linked-List.md
@@ -0,0 +1,84 @@
+# [328. Odd Even Linked List](https://leetcode.com/problems/odd-even-linked-list/)
+
+## 题目
+
+Given a singly linked list, group all odd nodes together followed by the even nodes. Please note here we are talking about the node number and not the value in the nodes.
+
+You should try to do it in place. The program should run in O(1) space complexity and O(nodes) time complexity.
+
+**Example 1**:
+
+```
+
+Input: 1->2->3->4->5->NULL
+Output: 1->3->5->2->4->NULL
+
+```
+
+**Example 2**:
+
+```
+
+Input: 2->1->3->5->6->4->7->NULL
+Output: 2->3->6->7->1->5->4->NULL
+
+```
+
+**Note**:
+
+- The relative order inside both the even and odd groups should remain as it was in the input.
+- The first node is considered odd, the second node even and so on ...
+
+## 题目大意
+
+这道题和第 86 题非常类型。第 86 题是把排在某个点前面的小值放在一个链表中，排在某个点后端的大值放在另外一个链表中，最后 2 个链表首尾拼接一下就是答案。
+
+## 解题思路
+
+这道题思路也是一样的，分别把奇数节点和偶数节点都放在 2 个链表中，最后首尾拼接就是答案。
+
+## 代码
+
+```go
+
+package leetcode
+
+/**
+ * Definition for singly-linked list.
+ * type ListNode struct {
+ * Val int
+ * Next *ListNode
+ * }
+ */
+
+func oddEvenList(head *ListNode) *ListNode {
+ oddHead := &ListNode{Val: 0, Next: nil}
+ odd := oddHead
+ evenHead := &ListNode{Val: 0, Next: nil}
+ even := evenHead
+
+ count := 1
+ for head != nil {
+ if count%2 == 1 {
+ odd.Next = head
+ odd = odd.Next
+ } else {
+ even.Next = head
+ even = even.Next
+ }
+ head = head.Next
+ count++
+ }
+ even.Next = nil
+ odd.Next = evenHead.Next
+ return oddHead.Next
+}
+
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0300~0399/0327.Count-of-Range-Sum/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0300~0399/0329.Longest-Increasing-Path-in-a-Matrix/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0329.Longest-Increasing-Path-in-a-Matrix.md b/website/content/ChapterFour/0300~0399/0329.Longest-Increasing-Path-in-a-Matrix.md
similarity index 81%
rename from website/content/ChapterFour/0329.Longest-Increasing-Path-in-a-Matrix.md
rename to website/content/ChapterFour/0300~0399/0329.Longest-Increasing-Path-in-a-Matrix.md
index 4ae431127..8369dbdec 100755
--- a/website/content/ChapterFour/0329.Longest-Increasing-Path-in-a-Matrix.md
+++ b/website/content/ChapterFour/0300~0399/0329.Longest-Increasing-Path-in-a-Matrix.md
@@ -52,6 +52,13 @@ import (
"math"
)
+var dir = [][]int{
+ {-1, 0},
+ {0, 1},
+ {1, 0},
+ {0, -1},
+}
+
func longestIncreasingPath(matrix [][]int) int {
cache, res := make([][]int, len(matrix)), 0
for i := 0; i < len(cache); i++ {
@@ -66,6 +73,13 @@ func longestIncreasingPath(matrix [][]int) int {
return res
}
+func max(a int, b int) int {
+ if a > b {
+ return a
+ }
+ return b
+}
+
func isInIntBoard(board [][]int, x, y int) bool {
return x >= 0 && x < len(board) && y >= 0 && y < len(board[0])
}
@@ -89,4 +103,11 @@ func searchPath(board, cache [][]int, lastNum, x, y int) int {
return count
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0300~0399/0328.Odd-Even-Linked-List/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0300~0399/0331.Verify-Preorder-Serialization-of-a-Binary-Tree/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0331.Verify-Preorder-Serialization-of-a-Binary-Tree.md b/website/content/ChapterFour/0300~0399/0331.Verify-Preorder-Serialization-of-a-Binary-Tree.md
similarity index 86%
rename from website/content/ChapterFour/0331.Verify-Preorder-Serialization-of-a-Binary-Tree.md
rename to website/content/ChapterFour/0300~0399/0331.Verify-Preorder-Serialization-of-a-Binary-Tree.md
index 8df741a16..5167b2620 100644
--- a/website/content/ChapterFour/0331.Verify-Preorder-Serialization-of-a-Binary-Tree.md
+++ b/website/content/ChapterFour/0300~0399/0331.Verify-Preorder-Serialization-of-a-Binary-Tree.md
@@ -82,4 +82,11 @@ func isValidSerialization(preorder string) bool {
return diff == 0
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0300~0399/0329.Longest-Increasing-Path-in-a-Matrix/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0300~0399/0337.House-Robber-III/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0337.House-Robber-III.md b/website/content/ChapterFour/0300~0399/0337.House-Robber-III.md
similarity index 85%
rename from website/content/ChapterFour/0337.House-Robber-III.md
rename to website/content/ChapterFour/0300~0399/0337.House-Robber-III.md
index e84518812..08ee691b6 100644
--- a/website/content/ChapterFour/0337.House-Robber-III.md
+++ b/website/content/ChapterFour/0300~0399/0337.House-Robber-III.md
@@ -70,4 +70,11 @@ func dfsTreeRob(root *TreeNode) (a, b int) {
return tmp0, tmp1
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0300~0399/0331.Verify-Preorder-Serialization-of-a-Binary-Tree/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0300~0399/0338.Counting-Bits/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0338.Counting-Bits.md b/website/content/ChapterFour/0300~0399/0338.Counting-Bits.md
similarity index 78%
rename from website/content/ChapterFour/0338.Counting-Bits.md
rename to website/content/ChapterFour/0300~0399/0338.Counting-Bits.md
index ea8e0de28..d67be88de 100755
--- a/website/content/ChapterFour/0338.Counting-Bits.md
+++ b/website/content/ChapterFour/0300~0399/0338.Counting-Bits.md
@@ -51,4 +51,11 @@ func countBits(num int) []int {
return bits
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0300~0399/0337.House-Robber-III/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0300~0399/0341.Flatten-Nested-List-Iterator/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0300~0399/0341.Flatten-Nested-List-Iterator.md b/website/content/ChapterFour/0300~0399/0341.Flatten-Nested-List-Iterator.md
new file mode 100644
index 000000000..5f6fa1c79
--- /dev/null
+++ b/website/content/ChapterFour/0300~0399/0341.Flatten-Nested-List-Iterator.md
@@ -0,0 +1,117 @@
+# [341. Flatten Nested List Iterator](https://leetcode.com/problems/flatten-nested-list-iterator/)
+
+
+## 题目
+
+Given a nested list of integers, implement an iterator to flatten it.
+
+Each element is either an integer, or a list -- whose elements may also be integers or other lists.
+
+**Example 1:**
+
+```
+Input:[[1,1],2,[1,1]]
+Output:[1,1,2,1,1]
+Explanation:By callingnext repeatedly untilhasNext returns false,
+ the order of elements returned bynext should be:[1,1,2,1,1].
+```
+
+**Example 2:**
+
+```
+Input:[1,[4,[6]]]
+Output:[1,4,6]
+Explanation:By callingnext repeatedly untilhasNext returns false,
+ the order of elements returned bynext should be:[1,4,6].
+
+```
+
+## 题目大意
+
+给你一个嵌套的整型列表。请你设计一个迭代器，使其能够遍历这个整型列表中的所有整数。列表中的每一项或者为一个整数，或者是另一个列表。其中列表的元素也可能是整数或是其他列表。
+
+## 解题思路
+
+- 题目要求实现一个嵌套版的数组。可以用 `[]int` 实现，也可以用链表实现。笔者此处用链表实现。外层构造一个一维数组，一维数组内部每个元素是一个链表。额外还需要记录这个嵌套链表在原数组中的 `index` 索引。`Next()` 实现比较简单，取出对应的嵌套节点。`HasNext()` 方法则感觉嵌套节点里面的 `index` 信息判断是否还有 `next` 元素。
+
+## 代码
+
+```go
+/**
+ * // This is the interface that allows for creating nested lists.
+ * // You should not implement it, or speculate about its implementation
+ * type NestedInteger struct {
+ * }
+ *
+ * // Return true if this NestedInteger holds a single integer, rather than a nested list.
+ * func (this NestedInteger) IsInteger() bool {}
+ *
+ * // Return the single integer that this NestedInteger holds, if it holds a single integer
+ * // The result is undefined if this NestedInteger holds a nested list
+ * // So before calling this method, you should have a check
+ * func (this NestedInteger) GetInteger() int {}
+ *
+ * // Set this NestedInteger to hold a single integer.
+ * func (n *NestedInteger) SetInteger(value int) {}
+ *
+ * // Set this NestedInteger to hold a nested list and adds a nested integer to it.
+ * func (this *NestedInteger) Add(elem NestedInteger) {}
+ *
+ * // Return the nested list that this NestedInteger holds, if it holds a nested list
+ * // The list length is zero if this NestedInteger holds a single integer
+ * // You can access NestedInteger's List element directly if you want to modify it
+ * func (this NestedInteger) GetList() []*NestedInteger {}
+ */
+
+type NestedIterator struct {
+ stack *list.List
+}
+
+type listIndex struct {
+ nestedList []*NestedInteger
+ index int
+}
+
+func Constructor(nestedList []*NestedInteger) *NestedIterator {
+ stack := list.New()
+ stack.PushBack(&listIndex{nestedList, 0})
+ return &NestedIterator{stack}
+}
+
+func (this *NestedIterator) Next() int {
+ if !this.HasNext() {
+ return -1
+ }
+ last := this.stack.Back().Value.(*listIndex)
+ nestedList, i := last.nestedList, last.index
+ val := nestedList[i].GetInteger()
+ last.index++
+ return val
+}
+
+func (this *NestedIterator) HasNext() bool {
+ stack := this.stack
+ for stack.Len() > 0 {
+ last := stack.Back().Value.(*listIndex)
+ nestedList, i := last.nestedList, last.index
+ if i >= len(nestedList) {
+ stack.Remove(stack.Back())
+ } else {
+ val := nestedList[i]
+ if val.IsInteger() {
+ return true
+ }
+ last.index++
+ stack.PushBack(&listIndex{val.GetList(), 0})
+ }
+ }
+ return false
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0300~0399/0338.Counting-Bits/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0300~0399/0342.Power-of-Four/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0342.Power-of-Four.md b/website/content/ChapterFour/0300~0399/0342.Power-of-Four.md
similarity index 76%
rename from website/content/ChapterFour/0342.Power-of-Four.md
rename to website/content/ChapterFour/0300~0399/0342.Power-of-Four.md
index 64782049d..a8a6f3848 100755
--- a/website/content/ChapterFour/0342.Power-of-Four.md
+++ b/website/content/ChapterFour/0300~0399/0342.Power-of-Four.md
@@ -52,4 +52,11 @@ func isPowerOfFour1(num int) bool {
return num == 1
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0300~0399/0341.Flatten-Nested-List-Iterator/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0300~0399/0343.Integer-Break/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0343.Integer-Break.md b/website/content/ChapterFour/0300~0399/0343.Integer-Break.md
similarity index 79%
rename from website/content/ChapterFour/0343.Integer-Break.md
rename to website/content/ChapterFour/0300~0399/0343.Integer-Break.md
index cfa558d7e..ff492fa2c 100755
--- a/website/content/ChapterFour/0343.Integer-Break.md
+++ b/website/content/ChapterFour/0300~0399/0343.Integer-Break.md
@@ -50,4 +50,11 @@ func integerBreak(n int) int {
return dp[n]
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0300~0399/0342.Power-of-Four/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0300~0399/0344.Reverse-String/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0300~0399/0344.Reverse-String.md b/website/content/ChapterFour/0300~0399/0344.Reverse-String.md
new file mode 100644
index 000000000..e2ed876c5
--- /dev/null
+++ b/website/content/ChapterFour/0300~0399/0344.Reverse-String.md
@@ -0,0 +1,60 @@
+# [344. Reverse String](https://leetcode.com/problems/reverse-string/)
+
+## 题目
+
+Write a function that reverses a string. The input string is given as an array of characters char[].
+
+Do not allocate extra space for another array, you must do this by modifying the input array in-place with O(1) extra memory.
+
+You may assume all the characters consist of printable ascii characters.
+
+**Example 1**:
+
+```
+
+Input: ["h","e","l","l","o"]
+Output: ["o","l","l","e","h"]
+
+```
+
+**Example 2**:
+
+```
+
+Input: ["H","a","n","n","a","h"]
+Output: ["h","a","n","n","a","H"]
+
+```
+
+## 题目大意
+
+题目要求我们反转一个字符串。
+
+## 解题思路
+
+这一题的解题思路是用 2 个指针，指针对撞的思路，来不断交换首尾元素，即可。
+
+
+
+## 代码
+
+```go
+
+package leetcode
+
+func reverseString(s []byte) {
+ for i, j := 0, len(s)-1; i < j; {
+ s[i], s[j] = s[j], s[i]
+ i++
+ j--
+ }
+}
+
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0300~0399/0343.Integer-Break/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0300~0399/0345.Reverse-Vowels-of-a-String/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0300~0399/0345.Reverse-Vowels-of-a-String.md b/website/content/ChapterFour/0300~0399/0345.Reverse-Vowels-of-a-String.md
new file mode 100644
index 000000000..1c87310a9
--- /dev/null
+++ b/website/content/ChapterFour/0300~0399/0345.Reverse-Vowels-of-a-String.md
@@ -0,0 +1,71 @@
+# [345. Reverse Vowels of a String](https://leetcode.com/problems/reverse-vowels-of-a-string/)
+
+## 题目
+
+Write a function that takes a string as input and reverse only the vowels of a string.
+
+
+
+**Example 1**:
+
+```
+
+Input: "hello"
+Output: "holle"
+
+```
+
+**Example 2**:
+
+```
+
+Input: "leetcode"
+Output: "leotcede"
+
+```
+
+## 题目大意
+
+题目要求我们反转字符串中的元音字母。需要注意字母大小写。
+
+## 解题思路
+
+这一题的解题思路是用 2 个指针，指针对撞的思路，来不断交换首尾元素，即可。这一题和第 344 题思路一样。
+
+
+
+## 代码
+
+```go
+package leetcode
+
+func reverseVowels(s string) string {
+ b := []byte(s)
+ for i, j := 0, len(b)-1; i < j; {
+ if !isVowel(b[i]) {
+ i++
+ continue
+ }
+ if !isVowel(b[j]) {
+ j--
+ continue
+ }
+ b[i], b[j] = b[j], b[i]
+ i++
+ j--
+ }
+ return string(b)
+}
+
+func isVowel(s byte) bool {
+ return s == 'a' || s == 'e' || s == 'i' || s == 'o' || s == 'u' || s == 'A' ||
+ s == 'E' || s == 'I' || s == 'O' || s == 'U'
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0300~0399/0344.Reverse-String/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0300~0399/0347.Top-K-Frequent-Elements/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0347.Top-K-Frequent-Elements.md b/website/content/ChapterFour/0300~0399/0347.Top-K-Frequent-Elements.md
similarity index 75%
rename from website/content/ChapterFour/0347.Top-K-Frequent-Elements.md
rename to website/content/ChapterFour/0300~0399/0347.Top-K-Frequent-Elements.md
index c2a98fcdd..fc4474815 100644
--- a/website/content/ChapterFour/0347.Top-K-Frequent-Elements.md
+++ b/website/content/ChapterFour/0300~0399/0347.Top-K-Frequent-Elements.md
@@ -78,7 +78,7 @@ func (pq PriorityQueue) Len() int {
}
func (pq PriorityQueue) Less(i, j int) bool {
- // 注意：因为golang中的heap是按最小堆组织的，所以count越大，Less()越小，越靠近堆顶.
+ // 注意：因为 golang 中的 heap 默认是按最小堆组织的，所以 count 越大，Less() 越小，越靠近堆顶。这里采用 >，变为最大堆
return pq[i].count > pq[j].count
}
@@ -100,4 +100,11 @@ func (pq *PriorityQueue) Pop() interface{} {
return item
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0300~0399/0345.Reverse-Vowels-of-a-String/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0300~0399/0349.Intersection-of-Two-Arrays/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0300~0399/0349.Intersection-of-Two-Arrays.md b/website/content/ChapterFour/0300~0399/0349.Intersection-of-Two-Arrays.md
new file mode 100644
index 000000000..b57951ab3
--- /dev/null
+++ b/website/content/ChapterFour/0300~0399/0349.Intersection-of-Two-Arrays.md
@@ -0,0 +1,67 @@
+# [349. Intersection of Two Arrays](https://leetcode.com/problems/intersection-of-two-arrays/)
+
+## 题目
+
+Given two arrays, write a function to compute their intersection.
+
+
+**Example 1**:
+
+```
+
+Input: nums1 = [1,2,2,1], nums2 = [2,2]
+Output: [2]
+
+```
+
+**Example 2**:
+
+```
+
+Input: nums1 = [4,9,5], nums2 = [9,4,9,8,4]
+Output: [9,4]
+
+```
+
+**Note**:
+
+- Each element in the result must be unique.
+- The result can be in any order.
+
+## 题目大意
+
+找到两个数组的交集元素，如果交集元素同一个数字出现了多次，只输出一次。
+
+## 解题思路
+
+把数组一的每个数字都存进字典中，然后在数组二中依次判断字典中是否存在，如果存在，在字典中删除它(因为输出要求只输出一次)。
+
+## 代码
+
+```go
+
+package leetcode
+
+func intersection(nums1 []int, nums2 []int) []int {
+ m := map[int]bool{}
+ var res []int
+ for _, n := range nums1 {
+ m[n] = true
+ }
+ for _, n := range nums2 {
+ if m[n] {
+ delete(m, n)
+ res = append(res, n)
+ }
+ }
+ return res
+}
+
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0300~0399/0347.Top-K-Frequent-Elements/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0300~0399/0350.Intersection-of-Two-Arrays-II/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0350.Intersection-of-Two-Arrays-II.md b/website/content/ChapterFour/0300~0399/0350.Intersection-of-Two-Arrays-II.md
similarity index 79%
rename from website/content/ChapterFour/0350.Intersection-of-Two-Arrays-II.md
rename to website/content/ChapterFour/0300~0399/0350.Intersection-of-Two-Arrays-II.md
index dc92b38ca..b3b3c30b0 100644
--- a/website/content/ChapterFour/0350.Intersection-of-Two-Arrays-II.md
+++ b/website/content/ChapterFour/0300~0399/0350.Intersection-of-Two-Arrays-II.md
@@ -69,4 +69,11 @@ func intersect(nums1 []int, nums2 []int) []int {
return res
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0300~0399/0349.Intersection-of-Two-Arrays/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0300~0399/0352.Data-Stream-as-Disjoint-Intervals/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0300~0399/0352.Data-Stream-as-Disjoint-Intervals.md b/website/content/ChapterFour/0300~0399/0352.Data-Stream-as-Disjoint-Intervals.md
new file mode 100644
index 000000000..14899590d
--- /dev/null
+++ b/website/content/ChapterFour/0300~0399/0352.Data-Stream-as-Disjoint-Intervals.md
@@ -0,0 +1,115 @@
+# [352. Data Stream as Disjoint Intervals](https://leetcode.com/problems/data-stream-as-disjoint-intervals/)
+
+
+## 题目
+
+Given a data stream input of non-negative integers a1, a2, ..., an, summarize the numbers seen so far as a list of disjoint intervals.
+
+Implement the SummaryRanges class:
+
+ - SummaryRanges() Initializes the object with an empty stream.
+ - void addNum(int val) Adds the integer val to the stream.
+ - int[][] getIntervals() Returns a summary of the integers in the stream currently as a list of disjoint intervals [starti, endi].
+
+**Example 1:**
+
+ Input
+ ["SummaryRanges", "addNum", "getIntervals", "addNum", "getIntervals", "addNum", "getIntervals", "addNum", "getIntervals", "addNum", "getIntervals"]
+ [[], [1], [], [3], [], [7], [], [2], [], [6], []]
+ Output
+ [null, null, [[1, 1]], null, [[1, 1], [3, 3]], null, [[1, 1], [3, 3], [7, 7]], null, [[1, 3], [7, 7]], null, [[1, 3], [6, 7]]]
+
+ Explanation
+ SummaryRanges summaryRanges = new SummaryRanges();
+ summaryRanges.addNum(1); // arr = [1]
+ summaryRanges.getIntervals(); // return [[1, 1]]
+ summaryRanges.addNum(3); // arr = [1, 3]
+ summaryRanges.getIntervals(); // return [[1, 1], [3, 3]]
+ summaryRanges.addNum(7); // arr = [1, 3, 7]
+ summaryRanges.getIntervals(); // return [[1, 1], [3, 3], [7, 7]]
+ summaryRanges.addNum(2); // arr = [1, 2, 3, 7]
+ summaryRanges.getIntervals(); // return [[1, 3], [7, 7]]
+ summaryRanges.addNum(6); // arr = [1, 2, 3, 6, 7]
+ summaryRanges.getIntervals(); // return [[1, 3], [6, 7]]
+
+**Constraints**
+
+ - 0 <= val <= 10000
+ - At most 3 * 10000 calls will be made to addNum and getIntervals.
+
+## 题目大意
+
+给你一个由非负整数a1, a2, ..., an 组成的数据流输入，请你将到目前为止看到的数字总结为不相交的区间列表。
+
+实现 SummaryRanges 类：
+
+ - SummaryRanges() 使用一个空数据流初始化对象。
+ - void addNum(int val) 向数据流中加入整数 val 。
+ - int[][] getIntervals() 以不相交区间[starti, endi] 的列表形式返回对数据流中整数的总结
+
+## 解题思路
+
+- 使用字典过滤掉重复的数字
+- 把过滤后的数字放到nums中,并进行排序
+- 使用nums构建不重复的区间
+
+## 代码
+
+```go
+package leetcode
+
+import "sort"
+
+type SummaryRanges struct {
+ nums []int
+ mp map[int]int
+}
+
+func Constructor() SummaryRanges {
+ return SummaryRanges{
+ nums: []int{},
+ mp : map[int]int{},
+ }
+}
+
+func (this *SummaryRanges) AddNum(val int) {
+ if _, ok := this.mp[val]; !ok {
+ this.mp[val] = 1
+ this.nums = append(this.nums, val)
+ }
+ sort.Ints(this.nums)
+}
+
+func (this *SummaryRanges) GetIntervals() [][]int {
+ n := len(this.nums)
+ var ans [][]int
+ if n == 0 {
+ return ans
+ }
+ if n == 1 {
+ ans = append(ans, []int{this.nums[0], this.nums[0]})
+ return ans
+ }
+ start, end := this.nums[0], this.nums[0]
+ ans = append(ans, []int{start, end})
+ index := 0
+ for i := 1; i < n; i++ {
+ if this.nums[i] == end + 1 {
+ end = this.nums[i]
+ ans[index][1] = end
+ } else {
+ start, end = this.nums[i], this.nums[i]
+ ans = append(ans, []int{start, end})
+ index++
+ }
+ }
+ return ans
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0300~0399/0350.Intersection-of-Two-Arrays-II/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0300~0399/0354.Russian-Doll-Envelopes/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0354.Russian-Doll-Envelopes.md b/website/content/ChapterFour/0300~0399/0354.Russian-Doll-Envelopes.md
similarity index 82%
rename from website/content/ChapterFour/0354.Russian-Doll-Envelopes.md
rename to website/content/ChapterFour/0300~0399/0354.Russian-Doll-Envelopes.md
index 810345d39..af4abd4a2 100755
--- a/website/content/ChapterFour/0354.Russian-Doll-Envelopes.md
+++ b/website/content/ChapterFour/0300~0399/0354.Russian-Doll-Envelopes.md
@@ -29,6 +29,7 @@ What is the maximum number of envelopes can you Russian doll? (put one inside ot
- 给出一组信封的宽度和高度，如果组成俄罗斯套娃，问最多能套几层。只有当一个信封的宽度和高度都比另外一个信封大的时候，才能套在小信封上面。
- 这一题的实质是第 300 题 Longest Increasing Subsequence 的加强版。能组成俄罗斯套娃的条件就是能找到一个最长上升子序列。但是这题的条件是二维的，要求能找到在二维上都能满足条件的最长上升子序列。先降维，把宽度排序。然后在高度上寻找最长上升子序列。这里用到的方法和第 300 题的方法一致。解题思路详解见第 300 题。
+- 此题是二维的 LIS 问题。一维的 LIS 问题是第 300 题。三维的 LIS 问题是第 1691 题。
## 代码
@@ -78,4 +79,11 @@ func maxEnvelopes(envelopes [][]int) int {
return len(dp)
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0300~0399/0352.Data-Stream-as-Disjoint-Intervals/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0300~0399/0357.Count-Numbers-with-Unique-Digits/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0357.Count-Numbers-with-Unique-Digits.md b/website/content/ChapterFour/0300~0399/0357.Count-Numbers-with-Unique-Digits.md
similarity index 85%
rename from website/content/ChapterFour/0357.Count-Numbers-with-Unique-Digits.md
rename to website/content/ChapterFour/0300~0399/0357.Count-Numbers-with-Unique-Digits.md
index 021b41873..4ae4f41b1 100755
--- a/website/content/ChapterFour/0357.Count-Numbers-with-Unique-Digits.md
+++ b/website/content/ChapterFour/0300~0399/0357.Count-Numbers-with-Unique-Digits.md
@@ -58,4 +58,11 @@ func countNumbersWithUniqueDigits(n int) int {
return res
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0300~0399/0354.Russian-Doll-Envelopes/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0300~0399/0367.Valid-Perfect-Square/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0367.Valid-Perfect-Square.md b/website/content/ChapterFour/0300~0399/0367.Valid-Perfect-Square.md
similarity index 75%
rename from website/content/ChapterFour/0367.Valid-Perfect-Square.md
rename to website/content/ChapterFour/0300~0399/0367.Valid-Perfect-Square.md
index 50584b0dc..d46d7c8bd 100755
--- a/website/content/ChapterFour/0367.Valid-Perfect-Square.md
+++ b/website/content/ChapterFour/0300~0399/0367.Valid-Perfect-Square.md
@@ -54,4 +54,11 @@ func isPerfectSquare(num int) bool {
return false
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0300~0399/0357.Count-Numbers-with-Unique-Digits/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0300~0399/0368.Largest-Divisible-Subset/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0300~0399/0368.Largest-Divisible-Subset.md b/website/content/ChapterFour/0300~0399/0368.Largest-Divisible-Subset.md
new file mode 100644
index 000000000..b61958e13
--- /dev/null
+++ b/website/content/ChapterFour/0300~0399/0368.Largest-Divisible-Subset.md
@@ -0,0 +1,93 @@
+# [368. Largest Divisible Subset](https://leetcode.com/problems/largest-divisible-subset/)
+
+
+## 题目
+
+Given a set of **distinct** positive integers `nums`, return the largest subset `answer` such that every pair `(answer[i], answer[j])` of elements in this subset satisfies:
+
+- `answer[i] % answer[j] == 0`, or
+- `answer[j] % answer[i] == 0`
+
+If there are multiple solutions, return any of them.
+
+**Example 1:**
+
+```
+Input: nums = [1,2,3]
+Output: [1,2]
+Explanation: [1,3] is also accepted.
+
+```
+
+**Example 2:**
+
+```
+Input: nums = [1,2,4,8]
+Output: [1,2,4,8]
+
+```
+
+**Constraints:**
+
+- `1 <= nums.length <= 1000`
+- `1 <= nums[i] <= 2 * 109`
+- All the integers in `nums` are **unique**.
+
+## 题目大意
+
+给你一个由 无重复 正整数组成的集合 nums ，请你找出并返回其中最大的整除子集 answer ，子集中每一元素对 (answer[i], answer[j]) 都应当满足：
+
+- answer[i] % answer[j] == 0 ，或
+- answer[j] % answer[i] == 0
+
+如果存在多个有效解子集，返回其中任何一个均可。
+
+## 解题思路
+
+- 根据题目数据规模 1000，可以估计此题大概率是动态规划，并且时间复杂度是 O(n^2)。先将集合排序，以某一个小的数作为基准，不断的选择能整除的数加入集合。按照这个思路考虑，此题和第 300 题经典的 LIS 解题思路一致。只不过 LIS 每次选择更大的数，此题除了选择更大的数，只不过多了一个判断，这个更大的数能否整除当前集合里面的所有元素。按照此法一定可以找出最大的集合。
+- 剩下的问题是如何输出最大集合。这道题的集合具有重叠子集的性质，例如 [2,4,8,16] 这个集合，长度是 4，它一定包含长度为 3 的子集，因为从它里面随便取 3 个数形成的子集也满足元素相互能整除的条件。同理，它也一定包含长度为 2，长度为 1 的子集。由于有这个性质，可以利用 dp 数组里面的数据，输出最大集合。例如，[2,4,6,8,9,13,16,40]，由动态规划可以找到最大集合是 [2,4,8,16]。长度为 4 的找到了，再找长度为 3 的，[2,4,8]，[2,4,40]。在最大集合中，最大元素是 16，所以 [2,4,40] 这个集合排除，它的最大元素大于 16。选定 [2,4,8] 这个集合，此时最大元素是 8 。以此类推，筛选到最后，便可以输出 [16,8,4,2] 这个组最大集合的答案了。
+
+## 代码
+
+```go
+package leetcode
+
+import "sort"
+
+func largestDivisibleSubset(nums []int) []int {
+ sort.Ints(nums)
+ dp, res := make([]int, len(nums)), []int{}
+ for i := range dp {
+ dp[i] = 1
+ }
+ maxSize, maxVal := 1, 1
+ for i := 1; i < len(nums); i++ {
+ for j, v := range nums[:i] {
+ if nums[i]%v == 0 && dp[j]+1 > dp[i] {
+ dp[i] = dp[j] + 1
+ }
+ }
+ if dp[i] > maxSize {
+ maxSize, maxVal = dp[i], nums[i]
+ }
+ }
+ if maxSize == 1 {
+ return []int{nums[0]}
+ }
+ for i := len(nums) - 1; i >= 0 && maxSize > 0; i-- {
+ if dp[i] == maxSize && maxVal%nums[i] == 0 {
+ res = append(res, nums[i])
+ maxVal = nums[i]
+ maxSize--
+ }
+ }
+ return res
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0300~0399/0367.Valid-Perfect-Square/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0300~0399/0371.Sum-of-Two-Integers/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0371.Sum-of-Two-Integers.md b/website/content/ChapterFour/0300~0399/0371.Sum-of-Two-Integers.md
similarity index 77%
rename from website/content/ChapterFour/0371.Sum-of-Two-Integers.md
rename to website/content/ChapterFour/0300~0399/0371.Sum-of-Two-Integers.md
index 31318dd7f..52a2bb04f 100755
--- a/website/content/ChapterFour/0371.Sum-of-Two-Integers.md
+++ b/website/content/ChapterFour/0300~0399/0371.Sum-of-Two-Integers.md
@@ -44,4 +44,11 @@ func getSum(a int, b int) int {
return getSum((a&b)<<1, a^b)
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0300~0399/0368.Largest-Divisible-Subset/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0300~0399/0372.Super-Pow/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0300~0399/0372.Super-Pow.md b/website/content/ChapterFour/0300~0399/0372.Super-Pow.md
new file mode 100755
index 000000000..2e3c2fddc
--- /dev/null
+++ b/website/content/ChapterFour/0300~0399/0372.Super-Pow.md
@@ -0,0 +1,113 @@
+# [372. Super Pow](https://leetcode.com/problems/super-pow/)
+
+
+## 题目
+
+Your task is to calculate ab mod 1337 where a is a positive integer and b is an extremely large positive integer given in the form of an array.
+
+**Example 1**:
+
+ Input: a = 2, b = [3]
+ Output: 8
+
+**Example 2**:
+
+ Input: a = 2, b = [1,0]
+ Output: 1024
+
+
+## 题目大意
+
+
+你的任务是计算 a^b 对 1337 取模，a 是一个正整数，b 是一个非常大的正整数且会以数组形式给出。
+
+## 解题思路
+
+- 求 a^b mod p 的结果，b 是大数。
+- 这一题可以用暴力解法尝试。需要用到 mod 计算的几个运算性质：
+
+ 模运算性质一：(a + b) % p = (a % p + b % p) % p
+ 模运算性质二：(a - b) % p = (a % p - b % p + p) % p
+ 模运算性质三：(a * b) % p = (a % p * b % p) % p
+ 模运算性质四：a ^ b % p = ((a % p)^b) % p
+
+ 这一题需要用到性质三、四。举个例子：
+
+ 12345^678 % 1337 = (12345^670 * 12345^8) % 1337
+ = ((12345^670 % 1337) * (12345^8 % 1337)) % 1337 ---> 利用性质 三
+ = (((12345^67)^10 % 1337) * (12345^8 % 1337)) % 1337 ---> 乘方性质
+ = ((12345^67 % 1337)^10) % 1337 * (12345^8 % 1337)) % 1337 ---> 利用性质 四
+ = (((12345^67 % 1337)^10) * (12345^8 % 1337)) % 1337 ---> 反向利用性质 三
+
+ 经过上面这样的变换，把指数 678 的个位分离出来了，可以单独求解。继续经过上面的变换，可以把指数的 6 和 7 也分离出来。最终可以把大数 b 一位一位的分离出来。至于计算 a^b 就结果快速幂求解。
+
+
+## 代码
+
+```go
+
+package leetcode
+
+// 解法一 快速幂 res = res^10 * qpow(a, b[i])
+// 模运算性质一：(a + b) % p = (a % p + b % p) % p
+// 模运算性质二：(a - b) % p = (a % p - b % p + p) % p
+// 模运算性质三：(a * b) % p = (a % p * b % p) % p
+// 模运算性质四：a ^ b % p = ((a % p)^b) % p
+// 举个例子
+// 12345^678 % 1337 = (12345^670 * 12345^8) % 1337
+// = ((12345^670 % 1337) * (12345^8 % 1337)) % 1337 ---> 利用性质 三
+// = (((12345^67)^10 % 1337) * (12345^8 % 1337)) % 1337 ---> 乘方性质
+// = ((12345^67 % 1337)^10) % 1337 * (12345^8 % 1337)) % 1337 ---> 利用性质 四
+// = (((12345^67 % 1337)^10) * (12345^8 % 1337)) % 1337 ---> 反向利用性质 三
+func superPow(a int, b []int) int {
+ res := 1
+ for i := 0; i < len(b); i++ {
+ res = (qpow(res, 10) * qpow(a, b[i])) % 1337
+ }
+ return res
+}
+
+// 快速幂计算 x^n
+func qpow(x, n int) int {
+ res := 1
+ x %= 1337
+ for n > 0 {
+ if (n & 1) == 1 {
+ res = (res * x) % 1337
+ }
+ x = (x * x) % 1337
+ n >>= 1
+ }
+ return res
+}
+
+// 解法二 暴力解法
+// 利用上面的性质，可以得到：a^1234567 % 1337 = (a^1234560 % 1337) * (a^7 % 1337) % k = ((((a^123456) % 1337)^10)% 1337 * (a^7 % 1337))% 1337;
+func superPow1(a int, b []int) int {
+ if len(b) == 0 {
+ return 1
+ }
+ last := b[len(b)-1]
+ l := 1
+ // 先计算个位的 a^x 结果，对应上面例子中的 (a^7 % 1337)% 1337
+ for i := 1; i <= last; i++ {
+ l = l * a % 1337
+ }
+ // 再计算除去个位以外的 a^y 的结果，对应上面例子中的 (a^123456) % 1337)
+ temp := superPow1(a, b[:len(b)-1])
+ f := 1
+ // 对应上面例子中的 (((a^123456) % 1337)^10)% 1337
+ for i := 1; i <= 10; i++ {
+ f = f * temp % 1337
+ }
+ return f * l % 1337
+}
+
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0300~0399/0371.Sum-of-Two-Integers/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0300~0399/0373.Find-K-Pairs-with-Smallest-Sums/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0373.Find-K-Pairs-with-Smallest-Sums.md b/website/content/ChapterFour/0300~0399/0373.Find-K-Pairs-with-Smallest-Sums.md
similarity index 91%
rename from website/content/ChapterFour/0373.Find-K-Pairs-with-Smallest-Sums.md
rename to website/content/ChapterFour/0300~0399/0373.Find-K-Pairs-with-Smallest-Sums.md
index 237c063d3..ff62bbf4f 100755
--- a/website/content/ChapterFour/0373.Find-K-Pairs-with-Smallest-Sums.md
+++ b/website/content/ChapterFour/0300~0399/0373.Find-K-Pairs-with-Smallest-Sums.md
@@ -123,4 +123,11 @@ func kSmallestPairs1(nums1 []int, nums2 []int, k int) [][]int {
return res
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0300~0399/0372.Super-Pow/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0300~0399/0374.Guess-Number-Higher-or-Lower/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0300~0399/0374.Guess-Number-Higher-or-Lower.md b/website/content/ChapterFour/0300~0399/0374.Guess-Number-Higher-or-Lower.md
new file mode 100644
index 000000000..a904fadd8
--- /dev/null
+++ b/website/content/ChapterFour/0300~0399/0374.Guess-Number-Higher-or-Lower.md
@@ -0,0 +1,101 @@
+# [374. Guess Number Higher or Lower](https://leetcode.com/problems/guess-number-higher-or-lower/)
+
+## 题目
+
+We are playing the Guess Game. The game is as follows:
+
+I pick a number from `1` to `n`. You have to guess which number I picked.
+
+Every time you guess wrong, I will tell you whether the number I picked is higher or lower than your guess.
+
+You call a pre-defined API `int guess(int num)`, which returns 3 possible results:
+
+- `1`: The number I picked is lower than your guess (i.e. `pick < num`).
+- `1`: The number I picked is higher than your guess (i.e. `pick > num`).
+- `0`: The number I picked is equal to your guess (i.e. `pick == num`).
+
+Return *the number that I picked*.
+
+**Example 1:**
+
+```
+Input: n = 10, pick = 6
+Output: 6
+```
+
+**Example 2:**
+
+```
+Input: n = 1, pick = 1
+Output: 1
+```
+
+**Example 3:**
+
+```
+Input: n = 2, pick = 1
+Output: 1
+```
+
+**Example 4:**
+
+```
+Input: n = 2, pick = 2
+Output: 2
+```
+
+**Constraints:**
+
+- `1 <= n <= 231 - 1`
+- `1 <= pick <= n`
+
+## 题目大意
+
+猜数字游戏的规则如下：
+
+- 每轮游戏，我都会从 1 到 n 随机选择一个数字。 请你猜选出的是哪个数字。
+- 如果你猜错了，我会告诉你，你猜测的数字比我选出的数字是大了还是小了。
+
+你可以通过调用一个预先定义好的接口 int guess(int num) 来获取猜测结果，返回值一共有 3 种可能的情况（-1，1 或 0）：
+
+- 1：我选出的数字比你猜的数字小 pick < num
+- 1：我选出的数字比你猜的数字大 pick > num
+- 0：我选出的数字和你猜的数字一样。恭喜！你猜对了！pick == num
+
+返回我选出的数字。
+
+## 解题思路
+
+- 这一题是简单题，和小时候玩的猜大猜小的游戏一样。思路很简单，二分查找即可。这一题和第 278 题类似。
+
+## 代码
+
+```go
+package leetcode
+
+import "sort"
+
+/**
+ * Forward declaration of guess API.
+ * @param num your guess
+ * @return -1 if num is lower than the guess number
+ * 1 if num is higher than the guess number
+ * otherwise return 0
+ * func guess(num int) int;
+ */
+
+func guessNumber(n int) int {
+ return sort.Search(n, func(x int) bool { return guess(x) <= 0 })
+}
+
+func guess(num int) int {
+ return 0
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0300~0399/0373.Find-K-Pairs-with-Smallest-Sums/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0300~0399/0376.Wiggle-Subsequence/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0300~0399/0376.Wiggle-Subsequence.md b/website/content/ChapterFour/0300~0399/0376.Wiggle-Subsequence.md
new file mode 100644
index 000000000..bc9b7c693
--- /dev/null
+++ b/website/content/ChapterFour/0300~0399/0376.Wiggle-Subsequence.md
@@ -0,0 +1,83 @@
+# [376. Wiggle Subsequence](https://leetcode.com/problems/wiggle-subsequence/)
+
+
+## 题目
+
+Given an integer array `nums`, return *the length of the longest **wiggle sequence***.
+
+A **wiggle sequence** is a sequence where the differences between successive numbers strictly alternate between positive and negative. The first difference (if one exists) may be either positive or negative. A sequence with fewer than two elements is trivially a wiggle sequence.
+
+- For example, `[1, 7, 4, 9, 2, 5]` is a **wiggle sequence** because the differences `(6, -3, 5, -7, 3)` are alternately positive and negative.
+- In contrast, `[1, 4, 7, 2, 5]` and `[1, 7, 4, 5, 5]` are not wiggle sequences, the first because its first two differences are positive and the second because its last difference is zero.
+
+A **subsequence** is obtained by deleting some elements (eventually, also zero) from the original sequence, leaving the remaining elements in their original order.
+
+**Example 1:**
+
+```
+Input: nums = [1,7,4,9,2,5]
+Output: 6
+Explanation: The entire sequence is a wiggle sequence.
+```
+
+**Example 2:**
+
+```
+Input: nums = [1,17,5,10,13,15,10,5,16,8]
+Output: 7
+Explanation: There are several subsequences that achieve this length. One is [1,17,10,13,10,16,8].
+```
+
+**Example 3:**
+
+```
+Input: nums = [1,2,3,4,5,6,7,8,9]
+Output: 2
+```
+
+**Constraints:**
+
+- `1 <= nums.length <= 1000`
+- `0 <= nums[i] <= 1000`
+
+**Follow up:** Could you solve this in `O(n)` time?
+
+## 题目大意
+
+如果连续数字之间的差严格地在正数和负数之间交替，则数字序列称为摆动序列。第一个差（如果存在的话）可能是正数或负数。少于两个元素的序列也是摆动序列。例如， [1,7,4,9,2,5] 是一个摆动序列，因为差值 (6,-3,5,-7,3) 是正负交替出现的。相反, [1,4,7,2,5] 和 [1,7,4,5,5] 不是摆动序列，第一个序列是因为它的前两个差值都是正数，第二个序列是因为它的最后一个差值为零。给定一个整数序列，返回作为摆动序列的最长子序列的长度。 通过从原始序列中删除一些（也可以不删除）元素来获得子序列，剩下的元素保持其原始顺序。
+
+## 解题思路
+
+- 题目要求找到摆动序列最长的子序列。本题可以用贪心的思路，记录当前序列的上升和下降的趋势。扫描数组过程中，每扫描一个元素都判断是“峰”还是“谷”，根据前一个是“峰”还是“谷”做出对应的决定。利用贪心的思想找到最长的摆动子序列。
+
+## 代码
+
+```go
+package leetcode
+
+func wiggleMaxLength(nums []int) int {
+ if len(nums) < 2 {
+ return len(nums)
+ }
+ res := 1
+ prevDiff := nums[1] - nums[0]
+ if prevDiff != 0 {
+ res = 2
+ }
+ for i := 2; i < len(nums); i++ {
+ diff := nums[i] - nums[i-1]
+ if diff > 0 && prevDiff <= 0 || diff < 0 && prevDiff >= 0 {
+ res++
+ prevDiff = diff
+ }
+ }
+ return res
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0300~0399/0374.Guess-Number-Higher-or-Lower/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0300~0399/0377.Combination-Sum-IV/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0300~0399/0377.Combination-Sum-IV.md b/website/content/ChapterFour/0300~0399/0377.Combination-Sum-IV.md
new file mode 100644
index 000000000..5bf89f8b1
--- /dev/null
+++ b/website/content/ChapterFour/0300~0399/0377.Combination-Sum-IV.md
@@ -0,0 +1,107 @@
+# [377. Combination Sum IV](https://leetcode.com/problems/combination-sum-iv/)
+
+
+## 题目
+
+Given an array of **distinct** integers `nums` and a target integer `target`, return *the number of possible combinations that add up to* `target`.
+
+The answer is **guaranteed** to fit in a **32-bit** integer.
+
+**Example 1:**
+
+```
+Input: nums = [1,2,3], target = 4
+Output: 7
+Explanation:
+The possible combination ways are:
+(1, 1, 1, 1)
+(1, 1, 2)
+(1, 2, 1)
+(1, 3)
+(2, 1, 1)
+(2, 2)
+(3, 1)
+Note that different sequences are counted as different combinations.
+
+```
+
+**Example 2:**
+
+```
+Input: nums = [9], target = 3
+Output: 0
+```
+
+**Constraints:**
+
+- `1 <= nums.length <= 200`
+- `1 <= nums[i] <= 1000`
+- All the elements of `nums` are **unique**.
+- `1 <= target <= 1000`
+
+**Follow up:** What if negative numbers are allowed in the given array? How does it change the problem? What limitation we need to add to the question to allow negative numbers?
+
+## 题目大意
+
+给你一个由 不同 整数组成的数组 nums ，和一个目标整数 target 。请你从 nums 中找出并返回总和为 target 的元素组合的个数。题目数据保证答案符合 32 位整数范围。
+
+## 解题思路
+
+- Combination Sum 这是系列问题。拿到题目，笔者先用暴力解法 dfs 尝试了一版，包含的重叠子问题特别多，剪枝条件也没有写好，果然超时。元素只有 [1,2,3] 这三种，target = 32，这组数据居然有 181997601 这么多种情况。仔细看了题目数据规模 1000，基本可以断定此题是动态规划，并且时间复杂度是 O(n^2)。
+- 本题和完全背包有点像，但是还是有区别。完全背包的取法内部不区分顺序。例如 5 = 1 + 2 + 2。但是本题是 3 种答案 (1，2，2)，(2，1，2)，(2，2，1)。定义 dp[i] 为总和为 target = i 的组合总数。最终答案存在 dp[target] 中。状态转移方程为：
+
+ {{< katex display >}}
+ dp[i] =\left\{\begin{matrix}1,i=0\\ \sum dp[i-j],i\neq 0\end{matrix}\right.
+ {{< /katex >}}
+
+- 这道题最后有一个进阶问题。如果给定的数组中含有负数，则会导致出现无限长度的排列。例如，假设数组 nums 中含有正整数 a 和负整数 −b（其中 a>0,b>0,-b<0），则有 a×b+(−b)×a=0，对于任意一个元素之和等于 target 的排列，在该排列的后面添加 b 个 a 和 a 个 −b 之后，得到的新排列的元素之和仍然等于 target，而且还可以在新排列的后面继续 b 个 a 和 a 个 −b。因此只要存在元素之和等于 target 的排列，就能构造出无限长度的排列。如果允许负数出现，则必须限制排列的最大长度，不然会出现无限长度的排列。
+
+## 代码
+
+```go
+package leetcode
+
+func combinationSum4(nums []int, target int) int {
+ dp := make([]int, target+1)
+ dp[0] = 1
+ for i := 1; i <= target; i++ {
+ for _, num := range nums {
+ if i-num >= 0 {
+ dp[i] += dp[i-num]
+ }
+ }
+ }
+ return dp[target]
+}
+
+// 暴力解法超时
+func combinationSum41(nums []int, target int) int {
+ if len(nums) == 0 {
+ return 0
+ }
+ c, res := []int{}, 0
+ findcombinationSum4(nums, target, 0, c, &res)
+ return res
+}
+
+func findcombinationSum4(nums []int, target, index int, c []int, res *int) {
+ if target <= 0 {
+ if target == 0 {
+ *res++
+ }
+ return
+ }
+ for i := 0; i < len(nums); i++ {
+ c = append(c, nums[i])
+ findcombinationSum4(nums, target-nums[i], i, c, res)
+ c = c[:len(c)-1]
+ }
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0300~0399/0376.Wiggle-Subsequence/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0300~0399/0378.Kth-Smallest-Element-in-a-Sorted-Matrix/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0378.Kth-Smallest-Element-in-a-Sorted-Matrix.md b/website/content/ChapterFour/0300~0399/0378.Kth-Smallest-Element-in-a-Sorted-Matrix.md
similarity index 90%
rename from website/content/ChapterFour/0378.Kth-Smallest-Element-in-a-Sorted-Matrix.md
rename to website/content/ChapterFour/0300~0399/0378.Kth-Smallest-Element-in-a-Sorted-Matrix.md
index 922adeebb..e0b264fbc 100755
--- a/website/content/ChapterFour/0378.Kth-Smallest-Element-in-a-Sorted-Matrix.md
+++ b/website/content/ChapterFour/0300~0399/0378.Kth-Smallest-Element-in-a-Sorted-Matrix.md
@@ -132,4 +132,11 @@ func (p *pq) Pop() interface{} {
return p.data[p.len]
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0300~0399/0377.Combination-Sum-IV/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0300~0399/0382.Linked-List-Random-Node/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0300~0399/0382.Linked-List-Random-Node.md b/website/content/ChapterFour/0300~0399/0382.Linked-List-Random-Node.md
new file mode 100644
index 000000000..449c5aaa8
--- /dev/null
+++ b/website/content/ChapterFour/0300~0399/0382.Linked-List-Random-Node.md
@@ -0,0 +1,112 @@
+# [382. Linked List Random Node](https://leetcode.com/problems/linked-list-random-node/)
+
+
+## 题目
+
+Given a singly linked list, return a random node's value from the linked list. Each node must have the **same probability** of being chosen.
+
+Implement the `Solution` class:
+
+- `Solution(ListNode head)` Initializes the object with the integer array nums.
+- `int getRandom()` Chooses a node randomly from the list and returns its value. All the nodes of the list should be equally likely to be choosen.
+
+**Example 1:**
+
+
+
+```
+Input
+["Solution", "getRandom", "getRandom", "getRandom", "getRandom", "getRandom"]
+[[[1, 2, 3]], [], [], [], [], []]
+Output
+[null, 1, 3, 2, 2, 3]
+
+Explanation
+Solution solution = new Solution([1, 2, 3]);
+solution.getRandom(); // return 1
+solution.getRandom(); // return 3
+solution.getRandom(); // return 2
+solution.getRandom(); // return 2
+solution.getRandom(); // return 3
+// getRandom() should return either 1, 2, or 3 randomly. Each element should have equal probability of returning.
+
+```
+
+**Constraints:**
+
+- The number of nodes in the linked list will be in the range `[1, 104]`.
+- `-10^4 <= Node.val <= 10^4`
+- At most `10^4` calls will be made to `getRandom`.
+
+**Follow up:**
+
+- What if the linked list is extremely large and its length is unknown to you?
+- Could you solve this efficiently without using extra space?
+
+## 题目大意
+
+给定一个单链表，随机选择链表的一个节点，并返回相应的节点值。保证每个节点被选的概率一样。
+
+进阶: 如果链表十分大且长度未知，如何解决这个问题？你能否使用常数级空间复杂度实现？
+
+## 解题思路
+
+- rand.Float64() 可以返回 [0.0,1.0) 之间的随机数。利用这个函数完成我们的随机化取节点的过程。
+
+## 代码
+
+```go
+package leetcode
+
+import (
+ "math/rand"
+
+ "github.com/halfrost/leetcode-go/structures"
+)
+
+// ListNode define
+type ListNode = structures.ListNode
+
+/**
+ * Definition for singly-linked list.
+ * type ListNode struct {
+ * Val int
+ * Next *ListNode
+ * }
+ */
+type Solution struct {
+ head *ListNode
+}
+
+/** @param head The linked list's head.
+ Note that the head is guaranteed to be not null, so it contains at least one node. */
+func Constructor(head *ListNode) Solution {
+ return Solution{head: head}
+}
+
+/** Returns a random node's value. */
+func (this *Solution) GetRandom() int {
+ scope, selectPoint, curr := 1, 0, this.head
+ for curr != nil {
+ if rand.Float64() < 1.0/float64(scope) {
+ selectPoint = curr.Val
+ }
+ scope += 1
+ curr = curr.Next
+ }
+ return selectPoint
+}
+
+/**
+ * Your Solution object will be instantiated and called as such:
+ * obj := Constructor(head);
+ * param_1 := obj.GetRandom();
+ */
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0300~0399/0378.Kth-Smallest-Element-in-a-Sorted-Matrix/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0300~0399/0383.Ransom-Note/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0300~0399/0383.Ransom-Note.md b/website/content/ChapterFour/0300~0399/0383.Ransom-Note.md
new file mode 100644
index 000000000..ef5603c7c
--- /dev/null
+++ b/website/content/ChapterFour/0300~0399/0383.Ransom-Note.md
@@ -0,0 +1,71 @@
+# [383. Ransom Note](https://leetcode.com/problems/ransom-note/)
+
+## 题目
+
+Given two stings ransomNote and magazine, return true if ransomNote can be constructed from magazine and false otherwise.
+
+Each letter in magazine can only be used once in ransomNote.
+
+**Example 1**:
+
+ Input: ransomNote = "a", magazine = "b"
+ Output: false
+
+**Example 2**:
+
+ Input: ransomNote = "aa", magazine = "ab"
+ Output: false
+
+**Example 3**:
+
+ Input: ransomNote = "aa", magazine = "aab"
+ Output: true
+
+**Constraints:**
+
+- 1 <= ransomNote.length, magazine.length <= 100000
+- ransomNote and magazine consist of lowercase English letters.
+
+## 题目大意
+
+为了不在赎金信中暴露字迹，从杂志上搜索各个需要的字母，组成单词来表达意思。
+
+给你一个赎金信 (ransomNote) 字符串和一个杂志(magazine)字符串，判断 ransomNote 能不能由 magazines 里面的字符构成。
+
+如果可以构成，返回 true ；否则返回 false 。
+
+magazine 中的每个字符只能在 ransomNote 中使用一次。
+
+## 解题思路
+
+- ransomNote 和 magazine 都是由小写字母组成，所以用数组进行简单的字符统计
+
+## 代码
+
+````go
+package leetcode
+
+func canConstruct(ransomNote string, magazine string) bool {
+ if len(ransomNote) > len(magazine) {
+ return false
+ }
+ var cnt [26]int
+ for _, v := range magazine {
+ cnt[v-'a']++
+ }
+ for _, v := range ransomNote {
+ cnt[v-'a']--
+ if cnt[v-'a'] < 0 {
+ return false
+ }
+ }
+ return true
+}
+````
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0300~0399/0382.Linked-List-Random-Node/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0300~0399/0384.Shuffle-an-Array/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0300~0399/0384.Shuffle-an-Array.md b/website/content/ChapterFour/0300~0399/0384.Shuffle-an-Array.md
new file mode 100644
index 000000000..908f9049c
--- /dev/null
+++ b/website/content/ChapterFour/0300~0399/0384.Shuffle-an-Array.md
@@ -0,0 +1,89 @@
+# [384.Shuffle an Array](https://leetcode.com/problems/shuffle-an-array/)
+
+## 题目
+
+Given an integer array nums, design an algorithm to randomly shuffle the array. All permutations of the array should be equally likely as a result of the shuffling.
+
+Implement the Solution class:
+
+- Solution(int[] nums) Initializes the object with the integer array nums.
+- int[] reset() Resets the array to its original configuration and returns it.
+- int[] shuffle() Returns a random shuffling of the array.
+
+**Example 1**:
+
+ Input
+ ["Solution", "shuffle", "reset", "shuffle"]
+ [[[1, 2, 3]], [], [], []]
+ Output
+ [null, [3, 1, 2], [1, 2, 3], [1, 3, 2]]
+
+ Explanation
+ Solution solution = new Solution([1, 2, 3]);
+ solution.shuffle(); // Shuffle the array [1,2,3] and return its result.
+ // Any permutation of [1,2,3] must be equally likely to be returned.
+ // Example: return [3, 1, 2]
+ solution.reset(); // Resets the array back to its original configuration [1,2,3]. Return [1, 2, 3]
+ solution.shuffle(); // Returns the random shuffling of array [1,2,3]. Example: return [1, 3, 2]
+
+**Constraints:**
+
+- 1 <= nums.length <= 200
+- -1000000 <= nums[i] <= 1000000
+- All the elements of nums are unique.
+- At most 5 * 10000 calls in total will be made to reset and shuffle.
+
+## 题目大意
+
+给你一个整数数组 nums ，设计算法来打乱一个没有重复元素的数组。
+
+实现 Solution class:
+
+- Solution(int[] nums) 使用整数数组 nums 初始化对象
+- int[] reset() 重设数组到它的初始状态并返回
+- int[] shuffle() 返回数组随机打乱后的结果
+
+## 解题思路
+
+- 使用 rand.Shuffle 进行数组随机打乱
+
+## 代码
+
+```go
+
+package leetcode
+
+import "math/rand"
+
+type Solution struct {
+ nums []int
+}
+
+func Constructor(nums []int) Solution {
+ return Solution{
+ nums: nums,
+ }
+}
+
+/** Resets the array to its original configuration and return it. */
+func (this *Solution) Reset() []int {
+ return this.nums
+}
+
+/** Returns a random shuffling of the array. */
+func (this *Solution) Shuffle() []int {
+ arr := make([]int, len(this.nums))
+ copy(arr, this.nums)
+ rand.Shuffle(len(arr), func(i, j int) {
+ arr[i], arr[j] = arr[j], arr[i]
+ })
+ return arr
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0300~0399/0383.Ransom-Note/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0300~0399/0385.Mini-Parser/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0385.Mini-Parser.md b/website/content/ChapterFour/0300~0399/0385.Mini-Parser.md
similarity index 92%
rename from website/content/ChapterFour/0385.Mini-Parser.md
rename to website/content/ChapterFour/0300~0399/0385.Mini-Parser.md
index 57a00d321..eff5eb9d9 100755
--- a/website/content/ChapterFour/0385.Mini-Parser.md
+++ b/website/content/ChapterFour/0300~0399/0385.Mini-Parser.md
@@ -172,4 +172,11 @@ func deserialize(s string) *NestedInteger {
return cur
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0300~0399/0384.Shuffle-an-Array/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0300~0399/0386.Lexicographical-Numbers/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0300~0399/0386.Lexicographical-Numbers.md b/website/content/ChapterFour/0300~0399/0386.Lexicographical-Numbers.md
new file mode 100755
index 000000000..dc76ab44f
--- /dev/null
+++ b/website/content/ChapterFour/0300~0399/0386.Lexicographical-Numbers.md
@@ -0,0 +1,58 @@
+# [386. Lexicographical Numbers](https://leetcode.com/problems/lexicographical-numbers/)
+
+
+## 题目
+
+Given an integer n, return 1 - n in lexicographical order.
+
+For example, given 13, return: [1,10,11,12,13,2,3,4,5,6,7,8,9].
+
+Please optimize your algorithm to use less time and space. The input size may be as large as 5,000,000.
+
+
+## 题目大意
+
+给定一个整数 n, 返回从 1 到 n 的字典顺序。例如，给定 n =13，返回 [1,10,11,12,13,2,3,4,5,6,7,8,9] 。
+
+请尽可能的优化算法的时间复杂度和空间复杂度。 输入的数据 n 小于等于 5,000,000。
+
+
+
+## 解题思路
+
+
+- 给出一个数字 n ，要求按照字典序对 1-n 这 n 个数排序。
+- DFS 暴力求解即可。
+
+
+## 代码
+
+```go
+
+package leetcode
+
+func lexicalOrder(n int) []int {
+ res := make([]int, 0, n)
+ dfs386(1, n, &res)
+ return res
+}
+
+func dfs386(x, n int, res *[]int) {
+ limit := (x + 10) / 10 * 10
+ for x <= n && x < limit {
+ *res = append(*res, x)
+ if x*10 <= n {
+ dfs386(x*10, n, res)
+ }
+ x++
+ }
+}
+
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0300~0399/0385.Mini-Parser/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0300~0399/0387.First-Unique-Character-in-a-String/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0300~0399/0387.First-Unique-Character-in-a-String.md b/website/content/ChapterFour/0300~0399/0387.First-Unique-Character-in-a-String.md
new file mode 100755
index 000000000..8f7954da2
--- /dev/null
+++ b/website/content/ChapterFour/0300~0399/0387.First-Unique-Character-in-a-String.md
@@ -0,0 +1,88 @@
+# [387. First Unique Character in a String](https://leetcode.com/problems/first-unique-character-in-a-string/)
+
+## 题目
+
+Given a string, find the first non-repeating character in it and return it's index. If it doesn't exist, return -1.
+
+**Examples**:
+
+ s = "leetcode"
+ return 0.
+
+ s = "loveleetcode",
+ return 2.
+
+**Note**: You may assume the string contain only lowercase letters.
+
+
+
+## 题目大意
+
+给定一个字符串，找到它的第一个不重复的字符，并返回它的索引。如果不存在，则返回 -1。
+
+
+## 解题思路
+
+- 简单题，要求输出第一个没有重复的字符。
+- 解法二这个思路只超过 81% 的用户，但是如果测试样例中 s 的字符串很长，但是满足条件的字符都在靠后的位置的话，这个思路应该会更有优势。通过记录每个字符的第一次出现的位置和最后一次出现的位置。第一次对 s 进行一次遍历。第二次仅仅对数组进行遍历就可以了。
+
+
+## 代码
+
+```go
+
+package leetcode
+
+// 解法 一
+func firstUniqChar(s string) int {
+ result := make([]int, 26)
+ for i := 0; i < len(s); i++ {
+ result[s[i]-'a']++
+ }
+ for i := 0; i < len(s); i++ {
+ if result[s[i]-'a'] == 1 {
+ return i
+ }
+ }
+ return -1
+}
+
+// 解法 二
+// 执行用时: 8 ms
+// 内存消耗: 5.2 MB
+func firstUniqChar1(s string) int {
+ charMap := make([][2]int, 26)
+ for i := 0; i < 26; i++ {
+ charMap[i][0] = -1
+ charMap[i][1] = -1
+ }
+ for i := 0; i < len(s); i++ {
+ if charMap[s[i]-'a'][0] == -1 {
+ charMap[s[i]-'a'][0] = i
+ } else { //已经出现过
+ charMap[s[i]-'a'][1] = i
+ }
+ }
+ res := len(s)
+ for i := 0; i < 26; i++ {
+ //只出现了一次
+ if charMap[i][0] >= 0 && charMap[i][1] == -1 {
+ if charMap[i][0] < res {
+ res = charMap[i][0]
+ }
+ }
+ }
+ if res == len(s) {
+ return -1
+ }
+ return res
+}
+
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0300~0399/0386.Lexicographical-Numbers/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0300~0399/0389.Find-the-Difference/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0300~0399/0389.Find-the-Difference.md b/website/content/ChapterFour/0300~0399/0389.Find-the-Difference.md
new file mode 100755
index 000000000..d21ed2376
--- /dev/null
+++ b/website/content/ChapterFour/0300~0399/0389.Find-the-Difference.md
@@ -0,0 +1,55 @@
+# [389. Find the Difference](https://leetcode.com/problems/find-the-difference/)
+
+## 题目
+
+Given two strings **s** and **t** which consist of only lowercase letters.
+
+String **t** is generated by random shuffling string **s** and then add one more letter at a random position.
+
+Find the letter that was added in **t**.
+
+**Example**:
+
+ Input:
+ s = "abcd"
+ t = "abcde"
+
+ Output:
+ e
+
+ Explanation:
+ 'e' is the letter that was added.
+
+## 题目大意
+
+给定两个字符串 s 和 t，它们只包含小写字母。字符串 t 由字符串 s 随机重排，然后在随机位置添加一个字母。请找出在 t 中被添加的字母。
+
+
+## 解题思路
+
+- 题目要求找出 t 字符串中比 s 字符串多出的一个字符。思路还是利用异或的性质，`X^X = 0`，将 s 和 t 依次异或，最终多出来的字符就是最后异或的结果。
+
+
+## 代码
+
+```go
+
+package leetcode
+
+func findTheDifference(s string, t string) byte {
+ n, ch := len(t), t[len(t)-1]
+ for i := 0; i < n-1; i++ {
+ ch ^= s[i]
+ ch ^= t[i]
+ }
+ return ch
+}
+
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0300~0399/0387.First-Unique-Character-in-a-String/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0300~0399/0390.Elimination-Game/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0300~0399/0390.Elimination-Game.md b/website/content/ChapterFour/0300~0399/0390.Elimination-Game.md
new file mode 100644
index 000000000..d90aca5b9
--- /dev/null
+++ b/website/content/ChapterFour/0300~0399/0390.Elimination-Game.md
@@ -0,0 +1,81 @@
+# [390. Elimination Game](https://leetcode.com/problems/elimination-game/)
+
+
+## 题目
+
+You have a list `arr` of all integers in the range `[1, n]` sorted in a strictly increasing order. Apply the following algorithm on `arr`:
+
+- Starting from left to right, remove the first number and every other number afterward until you reach the end of the list.
+- Repeat the previous step again, but this time from right to left, remove the rightmost number and every other number from the remaining numbers.
+- Keep repeating the steps again, alternating left to right and right to left, until a single number remains.
+
+Given the integer `n`, return *the last number that remains in* `arr`.
+
+**Example 1:**
+
+```
+Input: n = 9
+Output: 6
+Explanation:
+arr = [1, 2,3, 4,5, 6,7, 8,9]
+arr = [2,4, 6,8]
+arr = [2, 6]
+arr = [6]
+
+```
+
+**Example 2:**
+
+```
+Input: n = 1
+Output: 1
+
+```
+
+**Constraints:**
+
+- `1 <= n <= 109`
+
+## 题目大意
+
+列表 arr 由在范围 [1, n] 中的所有整数组成，并按严格递增排序。请你对 arr 应用下述算法：
+
+- 从左到右，删除第一个数字，然后每隔一个数字删除一个，直到到达列表末尾。
+- 重复上面的步骤，但这次是从右到左。也就是，删除最右侧的数字，然后剩下的数字每隔一个删除一个。
+- 不断重复这两步，从左到右和从右到左交替进行，直到只剩下一个数字。
+
+给你整数 n ，返回 arr 最后剩下的数字。
+
+## 解题思路
+
+- 模拟题。按照题意，第一轮从左往右删除数字，第二轮从右往左删除数字。题目要求最后剩下的数字，模拟过程中不需要真的删除元素。只需要标记起始元素，该轮步长和方向即可。最后总元素只剩下一个即为所求。
+
+## 代码
+
+```go
+package leetcode
+
+func lastRemaining(n int) int {
+ start, dir, step := 1, true, 1
+ for n > 1 {
+ if dir { // 正向
+ start += step
+ } else { // 反向
+ if n%2 == 1 {
+ start += step
+ }
+ }
+ dir = !dir
+ n >>= 1
+ step <<= 1
+ }
+ return start
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0300~0399/0389.Find-the-Difference/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0300~0399/0391.Perfect-Rectangle/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0300~0399/0391.Perfect-Rectangle.md b/website/content/ChapterFour/0300~0399/0391.Perfect-Rectangle.md
new file mode 100644
index 000000000..3028424f4
--- /dev/null
+++ b/website/content/ChapterFour/0300~0399/0391.Perfect-Rectangle.md
@@ -0,0 +1,121 @@
+# [391. Perfect Rectangle](https://leetcode.com/problems/perfect-rectangle/)
+
+## 题目
+
+Given an array rectangles where rectangles[i] = [xi, yi, ai, bi] represents an axis-aligned rectangle. The bottom-left point of the rectangle is (xi, yi) and the top-right point of it is (ai, bi).
+
+Return true if all the rectangles together form an exact cover of a rectangular region.
+
+**Example1:**
+
+
+
+ Input: rectangles = [[1,1,3,3],[3,1,4,2],[3,2,4,4],[1,3,2,4],[2,3,3,4]]
+ Output: true
+ Explanation: All 5 rectangles together form an exact cover of a rectangular region.
+
+**Example2:**
+
+
+
+ Input: rectangles = [[1,1,2,3],[1,3,2,4],[3,1,4,2],[3,2,4,4]]
+ Output: false
+ Explanation: Because there is a gap between the two rectangular regions.
+
+**Example3:**
+
+
+
+ Input: rectangles = [[1,1,3,3],[3,1,4,2],[1,3,2,4],[3,2,4,4]]
+ Output: false
+ Explanation: Because there is a gap in the top center.
+
+**Example4:**
+
+
+
+ Input: rectangles = [[1,1,3,3],[3,1,4,2],[1,3,2,4],[2,2,4,4]]
+ Output: false
+ Explanation: Because two of the rectangles overlap with each other.
+
+**Constraints:**
+
+- 1 <= rectangles.length <= 2 * 10000
+- rectangles[i].length == 4
+- -100000 <= xi, yi, ai, bi <= 100000
+
+## 题目大意
+
+给你一个数组 rectangles ，其中 rectangles[i] = [xi, yi, ai, bi] 表示一个坐标轴平行的矩形。这个矩形的左下顶点是 (xi, yi) ，右上顶点是 (ai, bi) 。
+
+如果所有矩形一起精确覆盖了某个矩形区域，则返回 true ；否则，返回 false 。
+
+## 解题思路
+
+- 矩形区域的面积等于所有矩形的面积之和并且满足矩形区域四角的顶点只能出现一次，且其余顶点的出现次数只能是两次或四次则返回 true,否则返回 false
+
+## 代码
+
+```go
+
+package leetcode
+
+type point struct {
+ x int
+ y int
+}
+
+func isRectangleCover(rectangles [][]int) bool {
+ minX, minY, maxA, maxB := rectangles[0][0], rectangles[0][1], rectangles[0][2], rectangles[0][3]
+ area := 0
+ cnt := make(map[point]int)
+ for _, v := range rectangles {
+ x, y, a, b := v[0], v[1], v[2], v[3]
+ area += (a - x) * (b - y)
+ minX = min(minX, x)
+ minY = min(minY, y)
+ maxA = max(maxA, a)
+ maxB = max(maxB, b)
+ cnt[point{x, y}]++
+ cnt[point{a, b}]++
+ cnt[point{x, b}]++
+ cnt[point{a, y}]++
+ }
+ if area != (maxA - minX) * (maxB - minY) ||
+ cnt[point{minX, minY}] != 1 || cnt[point{maxA, maxB}] != 1 ||
+ cnt[point{minX, maxB}] != 1 || cnt[point{maxA, minY}] != 1 {
+ return false
+ }
+ delete(cnt, point{minX, minY})
+ delete(cnt, point{maxA, maxB})
+ delete(cnt, point{minX, maxB})
+ delete(cnt, point{maxA, minY})
+ for _, v := range cnt {
+ if v != 2 && v != 4 {
+ return false
+ }
+ }
+ return true
+}
+
+func min(a, b int) int {
+ if a < b {
+ return a
+ }
+ return b
+}
+
+func max(a, b int) int {
+ if a > b {
+ return a
+ }
+ return b
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0300~0399/0390.Elimination-Game/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0300~0399/0392.Is-Subsequence/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0392.Is-Subsequence.md b/website/content/ChapterFour/0300~0399/0392.Is-Subsequence.md
similarity index 85%
rename from website/content/ChapterFour/0392.Is-Subsequence.md
rename to website/content/ChapterFour/0300~0399/0392.Is-Subsequence.md
index 09ff2c759..459d38068 100755
--- a/website/content/ChapterFour/0392.Is-Subsequence.md
+++ b/website/content/ChapterFour/0300~0399/0392.Is-Subsequence.md
@@ -77,4 +77,11 @@ func isSubsequence1(s string, t string) bool {
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0300~0399/0391.Perfect-Rectangle/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0300~0399/0393.UTF-8-Validation/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0393.UTF-8-Validation.md b/website/content/ChapterFour/0300~0399/0393.UTF-8-Validation.md
similarity index 90%
rename from website/content/ChapterFour/0393.UTF-8-Validation.md
rename to website/content/ChapterFour/0300~0399/0393.UTF-8-Validation.md
index 1d8b50fb4..1275685b2 100755
--- a/website/content/ChapterFour/0393.UTF-8-Validation.md
+++ b/website/content/ChapterFour/0300~0399/0393.UTF-8-Validation.md
@@ -102,4 +102,11 @@ func validUtf8(data []int) bool {
return count == 0
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0300~0399/0392.Is-Subsequence/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0300~0399/0394.Decode-String/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0394.Decode-String.md b/website/content/ChapterFour/0300~0399/0394.Decode-String.md
similarity index 85%
rename from website/content/ChapterFour/0394.Decode-String.md
rename to website/content/ChapterFour/0300~0399/0394.Decode-String.md
index 93a71bce3..febd7d6e1 100644
--- a/website/content/ChapterFour/0394.Decode-String.md
+++ b/website/content/ChapterFour/0300~0399/0394.Decode-String.md
@@ -78,4 +78,11 @@ func decodeString(s string) string {
return res
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0300~0399/0393.UTF-8-Validation/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0300~0399/0395.Longest-Substring-with-At-Least-K-Repeating-Characters/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0300~0399/0395.Longest-Substring-with-At-Least-K-Repeating-Characters.md b/website/content/ChapterFour/0300~0399/0395.Longest-Substring-with-At-Least-K-Repeating-Characters.md
new file mode 100644
index 000000000..5c3966441
--- /dev/null
+++ b/website/content/ChapterFour/0300~0399/0395.Longest-Substring-with-At-Least-K-Repeating-Characters.md
@@ -0,0 +1,119 @@
+# [395. Longest Substring with At Least K Repeating Characters](https://leetcode.com/problems/longest-substring-with-at-least-k-repeating-characters/)
+
+
+## 题目
+
+Given a string `s` and an integer `k`, return *the length of the longest substring of* `s` *such that the frequency of each character in this substring is greater than or equal to* `k`.
+
+**Example 1:**
+
+```
+Input: s = "aaabb", k = 3
+Output: 3
+Explanation: The longest substring is "aaa", as 'a' is repeated 3 times.
+```
+
+**Example 2:**
+
+```
+Input: s = "ababbc", k = 2
+Output: 5
+Explanation: The longest substring is "ababb", as 'a' is repeated 2 times and 'b' is repeated 3 times.
+```
+
+**Constraints:**
+
+- `1 <= s.length <= 10^4`
+- `s` consists of only lowercase English letters.
+- `1 <= k <= 10^5`
+
+## 题目大意
+
+给你一个字符串 s 和一个整数 k ，请你找出 s 中的最长子串， 要求该子串中的每一字符出现次数都不少于 k 。返回这一子串的长度。
+
+## 解题思路
+
+- 最容易想到的思路是递归。如果某个字符出现次数大于 0 小于 k，那么包含这个字符的子串都不满足要求。所以按照这个字符来切分整个字符串，满足题意的最长子串一定不包含切分的字符。切分完取出最长子串即可。时间复杂度 O(26*n)，空间复杂度 O(26^2)
+- 此题另外一个思路是滑动窗口。有一个需要解决的问题是右窗口移动的条件。此题要求最长字符串，那么这个最终的字符串内包含的字符种类最多是 26 种。字符种类就是右窗口移动的条件。依次枚举字符种类，如果当前窗口内的字符种类小于当前枚举的字符种类，那么窗口右移，否则左移。窗口移动中需要动态维护 freq 频次数组。可以每次都循环一遍这个数组，计算出出现次数大于 k 的字符。虽然这种做法只最多循环 26 次，但是还是不高效。更高效的做法是维护 1 个值，一个用来记录当前出现次数小于 k 次的字符种类数 `less`。如果 freq 为 0 ，说明小于 k 次的字符种类数要发生变化，如果是右窗口移动，那么 `less++`，如果是左窗口移动，那么`less--`。同理，如果 freq 为 k ，说明小于 k 次的字符种类数要发生变化，如果是右窗口移动，那么 `less--`，如果是左窗口移动，那么`less++`。在枚举 26 个字符种类中，动态维护记录出最长字符串。枚举完成，最长字符串长度也就求出来了。时间复杂度 O(26*n)，空间复杂度 O(26)
+
+## 代码
+
+```go
+package leetcode
+
+import "strings"
+
+// 解法一 滑动窗口
+func longestSubstring(s string, k int) int {
+ res := 0
+ for t := 1; t <= 26; t++ {
+ freq, total, lessK, left, right := [26]int{}, 0, 0, 0, -1
+ for left < len(s) {
+ if right+1 < len(s) && total <= t {
+ if freq[s[right+1]-'a'] == 0 {
+ total++
+ lessK++
+ }
+ freq[s[right+1]-'a']++
+ if freq[s[right+1]-'a'] == k {
+ lessK--
+ }
+ right++
+ } else {
+ if freq[s[left]-'a'] == k {
+ lessK++
+ }
+ freq[s[left]-'a']--
+ if freq[s[left]-'a'] == 0 {
+ total--
+ lessK--
+ }
+ left++
+ }
+ if lessK == 0 {
+ res = max(res, right-left+1)
+ }
+
+ }
+ }
+ return res
+}
+
+func max(a, b int) int {
+ if a > b {
+ return a
+ }
+ return b
+}
+
+// 解法二 递归分治
+func longestSubstring1(s string, k int) int {
+ if s == "" {
+ return 0
+ }
+ freq, split, res := [26]int{}, byte(0), 0
+ for _, ch := range s {
+ freq[ch-'a']++
+ }
+ for i, c := range freq[:] {
+ if 0 < c && c < k {
+ split = 'a' + byte(i)
+ break
+ }
+ }
+ if split == 0 {
+ return len(s)
+ }
+ for _, subStr := range strings.Split(s, string(split)) {
+ res = max(res, longestSubstring1(subStr, k))
+ }
+ return res
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0300~0399/0394.Decode-String/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0300~0399/0396.Rotate-Function/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0300~0399/0396.Rotate-Function.md b/website/content/ChapterFour/0300~0399/0396.Rotate-Function.md
new file mode 100644
index 000000000..95a661c99
--- /dev/null
+++ b/website/content/ChapterFour/0300~0399/0396.Rotate-Function.md
@@ -0,0 +1,117 @@
+# [396. Rotate Function](https://leetcode.com/problems/rotate-function/)
+
+## 题目
+
+You are given an integer array `nums` of length `n`.
+
+Assume `arrk` to be an array obtained by rotating `nums` by `k` positions clock-wise. We define the **rotation function** `F` on `nums` as follow:
+
+- `F(k) = 0 * arrk[0] + 1 * arrk[1] + ... + (n - 1) * arrk[n - 1]`.
+
+Return the maximum value of `F(0), F(1), ..., F(n-1)`.
+
+The test cases are generated so that the answer fits in a **32-bit** integer.
+
+**Example 1:**
+
+```c
+Input: nums = [4,3,2,6]
+Output: 26
+Explanation:
+F(0) = (0 * 4) + (1 * 3) + (2 * 2) + (3 * 6) = 0 + 3 + 4 + 18 = 25
+F(1) = (0 * 6) + (1 * 4) + (2 * 3) + (3 * 2) = 0 + 4 + 6 + 6 = 16
+F(2) = (0 * 2) + (1 * 6) + (2 * 4) + (3 * 3) = 0 + 6 + 8 + 9 = 23
+F(3) = (0 * 3) + (1 * 2) + (2 * 6) + (3 * 4) = 0 + 2 + 12 + 12 = 26
+So the maximum value of F(0), F(1), F(2), F(3) is F(3) = 26.
+```
+
+**Example 2:**
+
+```c
+Input: nums = [100]
+Output: 0
+```
+
+**Constraints:**
+
+- `n == nums.length`
+- `1 <= n <= 105`
+- `-100 <= nums[i] <= 100`
+
+## 题目大意
+
+给定一个长度为`n`的整数数组`nums`，设`arrk`是数组`nums`顺时针旋转`k`个位置后的数组。
+
+定义`nums`的旋转函数`F`为：
+
+- `F(k) = 0 * arrk[0] + 1 * arrk[1] + ... + (n - 1) * arrk[n - 1]`
+
+返回`F(0), F(1), ..., F(n-1)`中的最大值。
+
+## 解题思路
+
+**抽象化观察：**
+
+```c
+nums = [A0, A1, A2, A3]
+
+sum = A0 + A1 + A2+ A3
+F(0) = 0*A0 +0*A0 + 1*A1 + 2*A2 + 3*A3
+
+F(1) = 0*A3 + 1*A0 + 2*A1 + 3*A2
+ = F(0) + (A0 + A1 + A2) - 3*A3
+ = F(0) + (sum-A3) - 3*A3
+ = F(0) + sum - 4*A3
+
+F(2) = 0*A2 + 1*A3 + 2*A0 + 3*A1
+ = F(1) + A3 + A0 + A1 - 3*A2
+ = F(1) + sum - 4*A2
+
+F(3) = 0*A1 + 1*A2 + 2*A3 + 3*A0
+ = F(2) + A2 + A3 + A0 - 3*A1
+ = F(2) + sum - 4*A1
+
+// 记sum为nums数组中所有元素和
+// 可以猜测当0 ≤ i < n时存在公式:
+F(i) = F(i-1) + sum - n * A(n-i)
+```
+
+**数学归纳法证明迭代公式：**
+
+根据题目中给定的旋转函数公式可得已知条件：
+
+- `F(0) = 0×nums[0] + 1×nums[1] + ... + (n−1)×nums[n−1]`；
+
+- `F(1) = 1×nums[0] + 2×nums[1] + ... + 0×nums[n-1]`。
+
+令数组`nums`中所有元素和为`sum`，用数学归纳法验证：当`1 ≤ k < n`时，`F(k) = F(k-1) + sum - n×nums[n-k]`成立。
+
+**归纳奠基**：证明`k=1`时命题成立。
+
+```c
+F(1) = 1×nums[0] + 2×nums[1] + ... + 0×nums[n-1]
+ = F(0) + sum - n×nums[n-1]
+```
+
+**归纳假设**：假设`F(k) = F(k-1) + sum - n×nums[n-k]`成立。
+
+**归纳递推**：由归纳假设推出`F(k+1) = F(k) + sum - n×nums[n-(k+1)]`成立，则假设的递推公式成立。
+
+```c
+F(k+1) = (k+1)×nums[0] + k×nums[1] + ... + 0×nums[n-1]
+ = F(k) + sum - n×nums[n-(k+1)]
+```
+
+因此可以得到递推公式：
+
+- 当`n = 0`时，`F(0) = 0×nums[0] + 1×nums[1] + ... + (n−1)×nums[n−1]`
+- 当`1 ≤ k < n`时，`F(k) = F(k-1) + sum - n×nums[n-k]`成立。
+
+循环遍历`0 ≤ k < n`，计算出不同的`F(k)`并不断更新最大值，就能求出`F(0), F(1), ..., F(n-1)`中的最大值。
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0300~0399/0395.Longest-Substring-with-At-Least-K-Repeating-Characters/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0300~0399/0397.Integer-Replacement/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0397.Integer-Replacement.md b/website/content/ChapterFour/0300~0399/0397.Integer-Replacement.md
similarity index 86%
rename from website/content/ChapterFour/0397.Integer-Replacement.md
rename to website/content/ChapterFour/0300~0399/0397.Integer-Replacement.md
index 1dea6f592..92179b94a 100755
--- a/website/content/ChapterFour/0397.Integer-Replacement.md
+++ b/website/content/ChapterFour/0300~0399/0397.Integer-Replacement.md
@@ -83,4 +83,11 @@ func integerReplacement(n int) int {
return res
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0300~0399/0396.Rotate-Function/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0300~0399/0399.Evaluate-Division/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0399.Evaluate-Division.md b/website/content/ChapterFour/0300~0399/0399.Evaluate-Division.md
similarity index 92%
rename from website/content/ChapterFour/0399.Evaluate-Division.md
rename to website/content/ChapterFour/0300~0399/0399.Evaluate-Division.md
index d4cf45245..b1d2a5988 100755
--- a/website/content/ChapterFour/0399.Evaluate-Division.md
+++ b/website/content/ChapterFour/0300~0399/0399.Evaluate-Division.md
@@ -114,4 +114,11 @@ func calcEquation(equations [][]string, values []float64, queries [][]string) []
return res
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0300~0399/0397.Integer-Replacement/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0400~0499/0400.Nth-Digit/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0300~0399/_index.md b/website/content/ChapterFour/0300~0399/_index.md
new file mode 100644
index 000000000..d2021683f
--- /dev/null
+++ b/website/content/ChapterFour/0300~0399/_index.md
@@ -0,0 +1,5 @@
+---
+bookCollapseSection: true
+weight: 20
+---
+
diff --git a/website/content/ChapterFour/0303.Range-Sum-Query---Immutable.md b/website/content/ChapterFour/0303.Range-Sum-Query---Immutable.md
deleted file mode 100755
index 12ebbe676..000000000
--- a/website/content/ChapterFour/0303.Range-Sum-Query---Immutable.md
+++ /dev/null
@@ -1,110 +0,0 @@
-# [303. Range Sum Query - Immutable](https://leetcode.com/problems/range-sum-query-immutable/)
-
-
-## 题目
-
-Given an integer array nums, find the sum of the elements between indices i and j (i ≤ j), inclusive.
-
-**Example**:
-
- Given nums = [-2, 0, 3, -5, 2, -1]
-
- sumRange(0, 2) -> 1
- sumRange(2, 5) -> -1
- sumRange(0, 5) -> -3
-
-**Note**:
-
-1. You may assume that the array does not change.
-2. There are many calls to sumRange function.
-
-
-## 题目大意
-
-给定一个整数数组 nums，求出数组从索引 i 到 j (i ≤ j) 范围内元素的总和，包含 i, j 两点。
-
-示例：
-
-```
-给定 nums = [-2, 0, 3, -5, 2, -1]，求和函数为 sumRange()
-
-sumRange(0, 2) -> 1
-sumRange(2, 5) -> -1
-sumRange(0, 5) -> -3
-
-```
-
-说明:
-
-- 你可以假设数组不可变。
-- 会多次调用 sumRange 方法。
-
-
-## 解题思路
-
-
-- 给出一个数组，数组里面的数都是`**不可变**`的，设计一个数据结构能够满足查询数组任意区间内元素的和。
-- 这一题由于数组里面的元素都是`**不可变**`的，所以可以用 2 种方式来解答，第一种解法是用 prefixSum，通过累计和相减的办法来计算区间内的元素和，初始化的时间复杂度是 O(n)，但是查询区间元素和的时间复杂度是 O(1)。第二种解法是利用线段树，构建一颗线段树，父结点内存的是两个子结点的和，初始化建树的时间复杂度是 O(log n)，查询区间元素和的时间复杂度是 O(log n)。
-
-
-## 代码
-
-```go
-
-package leetcode
-
-import (
- "github.com/halfrost/LeetCode-Go/template"
-)
-
-//解法一 线段树，sumRange 时间复杂度 O(1)
-
-// NumArray define
-type NumArray struct {
- st *template.SegmentTree
-}
-
-// Constructor303 define
-func Constructor303(nums []int) NumArray {
- st := template.SegmentTree{}
- st.Init(nums, func(i, j int) int {
- return i + j
- })
- return NumArray{st: &st}
-}
-
-// SumRange define
-func (ma *NumArray) SumRange(i int, j int) int {
- return ma.st.Query(i, j)
-}
-
-//解法二 prefixSum，sumRange 时间复杂度 O(1)
-
-// // NumArray define
-// type NumArray struct {
-// prefixSum []int
-// }
-
-// // Constructor303 define
-// func Constructor303(nums []int) NumArray {
-// for i := 1; i < len(nums); i++ {
-// nums[i] += nums[i-1]
-// }
-// return NumArray{prefixSum: nums}
-// }
-
-// // SumRange define
-// func (this *NumArray) SumRange(i int, j int) int {
-// if i > 0 {
-// return this.prefixSum[j] - this.prefixSum[i-1]
-// }
-// return this.prefixSum[j]
-// }
-
-/**
- * Your NumArray object will be instantiated and called as such:
- * obj := Constructor(nums);
- * param_1 := obj.SumRange(i,j);
- */
-
-```
\ No newline at end of file
diff --git a/website/content/ChapterFour/0307.Range-Sum-Query---Mutable.md b/website/content/ChapterFour/0307.Range-Sum-Query---Mutable.md
deleted file mode 100755
index 1d17bbecc..000000000
--- a/website/content/ChapterFour/0307.Range-Sum-Query---Mutable.md
+++ /dev/null
@@ -1,121 +0,0 @@
-# [307. Range Sum Query - Mutable](https://leetcode.com/problems/range-sum-query-mutable/)
-
-
-## 题目
-
-Given an integer array nums, find the sum of the elements between indices i and j (i ≤ j), inclusive.
-
-The update(i, val) function modifies nums by updating the element at index i to val.
-
-**Example**:
-
- Given nums = [1, 3, 5]
-
- sumRange(0, 2) -> 9
- update(1, 2)
- sumRange(0, 2) -> 8
-
-**Note**:
-
-1. The array is only modifiable by the update function.
-2. You may assume the number of calls to update and sumRange function is distributed evenly.
-
-
-## 题目大意
-
-给定一个整数数组 nums，求出数组从索引 i 到 j (i ≤ j) 范围内元素的总和，包含 i, j 两点。
-
-update(i, val) 函数可以通过将下标为 i 的数值更新为 val，从而对数列进行修改。
-
-示例:
-
-```
-Given nums = [1, 3, 5]
-
-sumRange(0, 2) -> 9
-update(1, 2)
-sumRange(0, 2) -> 8
-```
-
-说明:
-
-- 数组仅可以在 update 函数下进行修改。
-- 你可以假设 update 函数与 sumRange 函数的调用次数是均匀分布的。
-
-## 解题思路
-
-
-- 给出一个数组，数组里面的数都是`**可变**`的，设计一个数据结构能够满足查询数组任意区间内元素的和。
-- 对比第 303 题，这一题由于数组里面的元素都是**`可变`**的，所以第一个想到的解法就是线段树，构建一颗线段树，父结点内存的是两个子结点的和，初始化建树的时间复杂度是 O(log n)，查询区间元素和的时间复杂度是 O(log n)，更新元素值的时间复杂度是 O(log n)。
-- 如果此题还用 prefixSum 的思路解答呢？那每次 update 操作的时间复杂度都是 O(n)，因为每次更改一个值，最坏情况就是所有的 prefixSum 都要更新一次。prefixSum 的方法在这道题上面也可以 AC，只不过时间排名在 5%，非常差。
-
-
-## 代码
-
-```go
-
-package leetcode
-
-import (
- "github.com/halfrost/LeetCode-Go/template"
-)
-
-// Constructor307 define
-func Constructor307(nums []int) NumArray {
- st := template.SegmentTree{}
- st.Init(nums, func(i, j int) int {
- return i + j
- })
- return NumArray{st: &st}
-}
-
-// Update define
-func (this *NumArray) Update(i int, val int) {
- this.st.Update(i, val)
-}
-
-//解法二 prefixSum，sumRange 时间复杂度 O(1)
-
-// // NumArray define
-// type NumArray307 struct {
-// prefixSum []int
-// data []int
-// }
-
-// // Constructor307 define
-// func Constructor307(nums []int) NumArray307 {
-// data := make([]int, len(nums))
-// for i := 0; i < len(nums); i++ {
-// data[i] = nums[i]
-// }
-// for i := 1; i < len(nums); i++ {
-// nums[i] += nums[i-1]
-// }
-// return NumArray307{prefixSum: nums, data: data}
-// }
-
-// // Update define
-// func (this *NumArray307) Update(i int, val int) {
-// this.data[i] = val
-// this.prefixSum[0] = this.data[0]
-// for i := 1; i < len(this.data); i++ {
-// this.prefixSum[i] = this.prefixSum[i-1] + this.data[i]
-// }
-// }
-
-// // SumRange define
-// func (this *NumArray307) SumRange(i int, j int) int {
-// if i > 0 {
-// return this.prefixSum[j] - this.prefixSum[i-1]
-// }
-// return this.prefixSum[j]
-// }
-
-/**
- * Your NumArray object will be instantiated and called as such:
- * obj := Constructor(nums);
- * obj.Update(i,val);
- * param_2 := obj.SumRange(i,j);
- */
-
-```
\ No newline at end of file
diff --git a/website/content/ChapterFour/0315.Count-of-Smaller-Numbers-After-Self.md b/website/content/ChapterFour/0315.Count-of-Smaller-Numbers-After-Self.md
deleted file mode 100755
index e82ba661f..000000000
--- a/website/content/ChapterFour/0315.Count-of-Smaller-Numbers-After-Self.md
+++ /dev/null
@@ -1,88 +0,0 @@
-# [315. Count of Smaller Numbers After Self](https://leetcode.com/problems/count-of-smaller-numbers-after-self/)
-
-
-## 题目
-
-You are given an integer array nums and you have to return a new counts array. The counts array has the property where `counts[i]` is the number of smaller elements to the right of `nums[i]`.
-
-**Example**:
-
- Input: [5,2,6,1]
- Output: [2,1,1,0]
- Explanation:
- To the right of 5 there are 2 smaller elements (2 and 1).
- To the right of 2 there is only 1 smaller element (1).
- To the right of 6 there is 1 smaller element (1).
- To the right of 1 there is 0 smaller element.
-
-
-## 题目大意
-
-
-给定一个整数数组 nums，按要求返回一个新数组 counts。数组 counts 有该性质： counts[i] 的值是 nums[i] 右侧小于 nums[i] 的元素的数量。
-
-示例:
-
-```
-
-输入: [5,2,6,1]
-输出: [2,1,1,0]
-解释:
-5 的右侧有 2 个更小的元素 (2 和 1).
-2 的右侧仅有 1 个更小的元素 (1).
-6 的右侧有 1 个更小的元素 (1).
-1 的右侧有 0 个更小的元素.
-
-```
-
-
-## 解题思路
-
-
-- 给出一个数组，要求输出数组中每个元素相对于数组中的位置右边比它小的元素。
-- 这一题是第 327 题的缩水版。由于需要找数组位置右边比当前位置元素小的元素，所以从数组右边开始往左边扫。构造一颗线段树，线段树里面父节点存的是子节点出现的次数和。有可能给的数据会很大，所以构造线段树的时候先离散化。还需要注意的是数组里面可能有重复元素，所以构造线段树要先去重并排序。从右往左扫的过程中，依次添加数组中的元素，添加了一次就立即 query 一次。query 的区间是 [minNum, nums[i]-1]。如果是 minNum 则输出 0，并且也要记得插入这个最小值。这一题的思路和第 327 题大体类似，详解可见第 327 题。
-
-
-## 代码
-
-```go
-
-package leetcode
-
-import (
- "sort"
-
- "github.com/halfrost/LeetCode-Go/template"
-)
-
-func countSmaller(nums []int) []int {
- if len(nums) == 0 {
- return []int{}
- }
- st, minNum, numsMap, numsArray, res := template.SegmentCountTree{}, 0, make(map[int]int, 0), []int{}, make([]int, len(nums))
- for i := 0; i < len(nums); i++ {
- numsMap[nums[i]] = nums[i]
- }
- for _, v := range numsMap {
- numsArray = append(numsArray, v)
- }
- // 排序是为了使得线段树中的区间 left <= right，如果此处不排序，线段树中的区间有很多不合法。
- sort.Ints(numsArray)
- minNum = numsArray[0]
- // 初始化线段树，节点内的值都赋值为 0，即计数为 0
- st.Init(numsArray, func(i, j int) int {
- return 0
- })
- for i := len(nums) - 1; i >= 0; i-- {
- if nums[i] == minNum {
- res[i] = 0
- st.UpdateCount(nums[i])
- continue
- }
- st.UpdateCount(nums[i])
- res[i] = st.Query(minNum, nums[i]-1)
- }
- return res
-}
-
-```
\ No newline at end of file
diff --git a/website/content/ChapterFour/0328.Odd-Even-Linked-List.md b/website/content/ChapterFour/0328.Odd-Even-Linked-List.md
deleted file mode 100644
index b7201e5df..000000000
--- a/website/content/ChapterFour/0328.Odd-Even-Linked-List.md
+++ /dev/null
@@ -1,77 +0,0 @@
-# [328. Odd Even Linked List](https://leetcode.com/problems/odd-even-linked-list/)
-
-## 题目
-
-Given a singly linked list, group all odd nodes together followed by the even nodes. Please note here we are talking about the node number and not the value in the nodes.
-
-You should try to do it in place. The program should run in O(1) space complexity and O(nodes) time complexity.
-
-**Example 1**:
-
-```
-
-Input: 1->2->3->4->5->NULL
-Output: 1->3->5->2->4->NULL
-
-```
-
-**Example 2**:
-
-```
-
-Input: 2->1->3->5->6->4->7->NULL
-Output: 2->3->6->7->1->5->4->NULL
-
-```
-
-**Note**:
-
-- The relative order inside both the even and odd groups should remain as it was in the input.
-- The first node is considered odd, the second node even and so on ...
-
-## 题目大意
-
-这道题和第 86 题非常类型。第 86 题是把排在某个点前面的小值放在一个链表中，排在某个点后端的大值放在另外一个链表中，最后 2 个链表首尾拼接一下就是答案。
-
-## 解题思路
-
-这道题思路也是一样的，分别把奇数和偶数都放在 2 个链表中，最后首尾拼接就是答案。
-
-## 代码
-
-```go
-
-package leetcode
-
-/**
- * Definition for singly-linked list.
- * type ListNode struct {
- * Val int
- * Next *ListNode
- * }
- */
-
-func oddEvenList(head *ListNode) *ListNode {
- oddHead := &ListNode{Val: 0, Next: nil}
- odd := oddHead
- evenHead := &ListNode{Val: 0, Next: nil}
- even := evenHead
-
- count := 1
- for head != nil {
- if count%2 == 1 {
- odd.Next = head
- odd = odd.Next
- } else {
- even.Next = head
- even = even.Next
- }
- head = head.Next
- count++
- }
- even.Next = nil
- odd.Next = evenHead.Next
- return oddHead.Next
-}
-
-```
\ No newline at end of file
diff --git a/website/content/ChapterFour/0344.Reverse-String.md b/website/content/ChapterFour/0344.Reverse-String.md
deleted file mode 100644
index f3568648b..000000000
--- a/website/content/ChapterFour/0344.Reverse-String.md
+++ /dev/null
@@ -1,53 +0,0 @@
-# [344. Reverse String](https://leetcode.com/problems/reverse-string/)
-
-## 题目
-
-Write a function that reverses a string. The input string is given as an array of characters char[].
-
-Do not allocate extra space for another array, you must do this by modifying the input array in-place with O(1) extra memory.
-
-You may assume all the characters consist of printable ascii characters.
-
-**Example 1**:
-
-```
-
-Input: ["h","e","l","l","o"]
-Output: ["o","l","l","e","h"]
-
-```
-
-**Example 2**:
-
-```
-
-Input: ["H","a","n","n","a","h"]
-Output: ["h","a","n","n","a","H"]
-
-```
-
-## 题目大意
-
-题目要求我们反转一个字符串。
-
-## 解题思路
-
-这一题的解题思路是用 2 个指针，指针对撞的思路，来不断交换首尾元素，即可。
-
-
-
-## 代码
-
-```go
-
-package leetcode
-
-func reverseString(s []byte) {
- for i, j := 0, len(s)-1; i < j; {
- s[i], s[j] = s[j], s[i]
- i++
- j--
- }
-}
-
-```
\ No newline at end of file
diff --git a/website/content/ChapterFour/0345.Reverse-Vowels-of-a-String.md b/website/content/ChapterFour/0345.Reverse-Vowels-of-a-String.md
deleted file mode 100644
index 2cbb07fb6..000000000
--- a/website/content/ChapterFour/0345.Reverse-Vowels-of-a-String.md
+++ /dev/null
@@ -1,69 +0,0 @@
-# [345. Reverse Vowels of a String](https://leetcode.com/problems/reverse-vowels-of-a-string/)
-
-## 题目
-
-Write a function that takes a string as input and reverse only the vowels of a string.
-
-
-
-**Example 1**:
-
-```
-
-Input: "hello"
-Output: "holle"
-
-```
-
-**Example 2**:
-
-```
-
-Input: "leetcode"
-Output: "leotcede"
-
-```
-
-## 题目大意
-
-题目要求我们反转字符串中的元音字母。需要注意字母大小写。
-
-## 解题思路
-
-这一题的解题思路是用 2 个指针，指针对撞的思路，来不断交换首尾元素，即可。这一题和第 344 题思路一样。
-
-
-
-## 代码
-
-```go
-
-package leetcode
-
-func reverseVowels(s string) string {
- b := []byte(s)
- for i, j := 0, len(b)-1; i < j; {
- if isVowels(b[i]) && isVowels(b[j]) {
- b[i], b[j] = b[j], b[i]
- i++
- j--
- } else if isVowels(b[i]) && !isVowels(b[j]) {
- j--
- } else if !isVowels(b[i]) && isVowels(b[j]) {
- i++
- } else {
- i++
- j--
- }
- }
- return string(b)
-}
-
-func isVowels(s byte) bool {
- if s == 'a' || s == 'e' || s == 'i' || s == 'o' || s == 'u' || s == 'A' || s == 'E' || s == 'I' || s == 'O' || s == 'U' {
- return true
- }
- return false
-}
-
-```
\ No newline at end of file
diff --git a/website/content/ChapterFour/0349.Intersection-of-Two-Arrays.md b/website/content/ChapterFour/0349.Intersection-of-Two-Arrays.md
deleted file mode 100644
index 8f8ad399c..000000000
--- a/website/content/ChapterFour/0349.Intersection-of-Two-Arrays.md
+++ /dev/null
@@ -1,60 +0,0 @@
-# [349. Intersection of Two Arrays](https://leetcode.com/problems/intersection-of-two-arrays/)
-
-## 题目
-
-Given two arrays, write a function to compute their intersection.
-
-
-**Example 1**:
-
-```
-
-Input: nums1 = [1,2,2,1], nums2 = [2,2]
-Output: [2]
-
-```
-
-**Example 2**:
-
-```
-
-Input: nums1 = [4,9,5], nums2 = [9,4,9,8,4]
-Output: [9,4]
-
-```
-
-**Note**:
-
-- Each element in the result must be unique.
-- The result can be in any order.
-
-## 题目大意
-
-找到两个数组的交集元素，如果交集元素同一个数字出现了多次，只输出一次。
-
-## 解题思路
-
-把数组一的每个数字都存进字典中，然后在数组二中依次判断字典中是否存在，如果存在，在字典中删除它(因为输出要求只输出一次)。
-
-## 代码
-
-```go
-
-package leetcode
-
-func intersection(nums1 []int, nums2 []int) []int {
- m := map[int]bool{}
- var res []int
- for _, n := range nums1 {
- m[n] = true
- }
- for _, n := range nums2 {
- if m[n] {
- delete(m, n)
- res = append(res, n)
- }
- }
- return res
-}
-
-```
\ No newline at end of file
diff --git a/website/content/ChapterFour/0372.Super-Pow.md b/website/content/ChapterFour/0372.Super-Pow.md
deleted file mode 100755
index 79b2830c2..000000000
--- a/website/content/ChapterFour/0372.Super-Pow.md
+++ /dev/null
@@ -1,108 +0,0 @@
-# [372. Super Pow](https://leetcode.com/problems/super-pow/)
-
-
-## 题目
-
-Your task is to calculate ab mod 1337 where a is a positive integer and b is an extremely large positive integer given in the form of an array.
-
-**Example 1**:
-
- Input: a = 2, b = [3]
- Output: 8
-
-**Example 2**:
-
- Input: a = 2, b = [1,0]
- Output: 1024
-
-
-## 题目大意
-
-
-你的任务是计算 a^b 对 1337 取模，a 是一个正整数，b 是一个非常大的正整数且会以数组形式给出。
-
-## 解题思路
-
-- 求 a^b mod p 的结果，b 是大数。
-- 这一题可以用暴力解法尝试。需要用到 mod 计算的几个运算性质：
-
- 模运算性质一：(a + b) % p = (a % p + b % p) % p
- 模运算性质二：(a - b) % p = (a % p - b % p + p) % p
- 模运算性质三：(a * b) % p = (a % p * b % p) % p
- 模运算性质四：a ^ b % p = ((a % p)^b) % p
- 模运算性质五：ab % p = ((a % p) * ( b % p)) % p, 其中 ab 是一个数字，如:2874，98374 等等
-
- 这一题需要用到性质三、四、五。举个例子：
-
- 12345^678 % 1337 = (12345^670 * 12345^8) % 1337
- = ((12345^670 % 1337) * (12345^8 % 1337)) % 1337 ---> 利用性质 三
- = (((12345^67)^10 % 1337) * (12345^8 % 1337)) % 1337 ---> 乘方性质
- = ((12345^67 % 1337)^10) % 1337 * (12345^8 % 1337)) % 1337 ---> 利用性质 四
- = (((12345^67 % 1337)^10) * (12345^8 % 1337)) % 1337 ---> 反向利用性质 三
-
- 经过上面这样的变换，把指数 678 的个位分离出来了，可以单独求解。继续经过上面的变换，可以把指数的 6 和 7 也分离出来。最终可以把大数 b 一位一位的分离出来。至于计算 a^b 就结果快速幂求解。
-
-
-## 代码
-
-```go
-
-package leetcode
-
-// 解法一 快速幂 res = res^10 * qpow(a, b[i])
-// 模运算性质一：(a + b) % p = (a % p + b % p) % p
-// 模运算性质二：(a - b) % p = (a % p - b % p + p) % p
-// 模运算性质三：(a * b) % p = (a % p * b % p) % p
-// 模运算性质四：a ^ b % p = ((a % p)^b) % p
-// 模运算性质五：ab % p = ((a % p) * ( b % p)) % p, 其中 ab 是一个数字，如:2874，98374 等等
-// 举个例子
-// 12345^678 % 1337 = (12345^670 * 12345^8) % 1337
-// = ((12345^670 % 1337) * (12345^8 % 1337)) % 1337 ---> 利用性质 三
-// = (((12345^67)^10 % 1337) * (12345^8 % 1337)) % 1337 ---> 乘方性质
-// = ((12345^67 % 1337)^10) % 1337 * (12345^8 % 1337)) % 1337 ---> 利用性质 四
-// = (((12345^67 % 1337)^10) * (12345^8 % 1337)) % 1337 ---> 反向利用性质 三
-func superPow(a int, b []int) int {
- res := 1
- for i := 0; i < len(b); i++ {
- res = (qpow(res, 10) * qpow(a, b[i])) % 1337
- }
- return res
-}
-
-// 快速幂计算 x^n
-func qpow(x, n int) int {
- res := 1
- x %= 1337
- for n > 0 {
- if (n & 1) == 1 {
- res = (res * x) % 1337
- }
- x = (x * x) % 1337
- n >>= 1
- }
- return res
-}
-
-// 解法二 暴力解法
-// 利用上面的性质，可以得到：a^1234567 % 1337 = (a^1234560 % 1337) * (a^7 % 1337) % k = ((((a^123456) % 1337)^10)% 1337 * (a^7 % 1337))% 1337;
-func superPow1(a int, b []int) int {
- if len(b) == 0 {
- return 1
- }
- last := b[len(b)-1]
- l := 1
- // 先计算个位的 a^x 结果，对应上面例子中的 (a^7 % 1337)% 1337
- for i := 1; i <= last; i++ {
- l = l * a % 1337
- }
- // 再计算除去个位以外的 a^y 的结果，对应上面例子中的 (a^123456) % 1337)
- temp := superPow1(a, b[:len(b)-1])
- f := 1
- // 对应上面例子中的 (((a^123456) % 1337)^10)% 1337
- for i := 1; i <= 10; i++ {
- f = f * temp % 1337
- }
- return f * l % 1337
-}
-
-```
\ No newline at end of file
diff --git a/website/content/ChapterFour/0386.Lexicographical-Numbers.md b/website/content/ChapterFour/0386.Lexicographical-Numbers.md
deleted file mode 100755
index 7bb82d4b3..000000000
--- a/website/content/ChapterFour/0386.Lexicographical-Numbers.md
+++ /dev/null
@@ -1,51 +0,0 @@
-# [386. Lexicographical Numbers](https://leetcode.com/problems/lexicographical-numbers/)
-
-
-## 题目
-
-Given an integer n, return 1 - n in lexicographical order.
-
-For example, given 13, return: [1,10,11,12,13,2,3,4,5,6,7,8,9].
-
-Please optimize your algorithm to use less time and space. The input size may be as large as 5,000,000.
-
-
-## 题目大意
-
-给定一个整数 n, 返回从 1 到 n 的字典顺序。例如，给定 n =13，返回 [1,10,11,12,13,2,3,4,5,6,7,8,9] 。
-
-请尽可能的优化算法的时间复杂度和空间复杂度。 输入的数据 n 小于等于 5,000,000。
-
-
-
-## 解题思路
-
-
-- 给出一个数字 n ，要求按照字典序对 1-n 这 n 个数排序。
-- DFS 暴力求解即可。
-
-
-## 代码
-
-```go
-
-package leetcode
-
-func lexicalOrder(n int) []int {
- res := make([]int, 0, n)
- dfs386(1, n, &res)
- return res
-}
-
-func dfs386(x, n int, res *[]int) {
- limit := (x + 10) / 10 * 10
- for x <= n && x < limit {
- *res = append(*res, x)
- if x*10 <= n {
- dfs386(x*10, n, res)
- }
- x++
- }
-}
-
-```
\ No newline at end of file
diff --git a/website/content/ChapterFour/0387.First-Unique-Character-in-a-String.md b/website/content/ChapterFour/0387.First-Unique-Character-in-a-String.md
deleted file mode 100755
index b3ccff4ce..000000000
--- a/website/content/ChapterFour/0387.First-Unique-Character-in-a-String.md
+++ /dev/null
@@ -1,48 +0,0 @@
-# [387. First Unique Character in a String](https://leetcode.com/problems/first-unique-character-in-a-string/)
-
-## 题目
-
-Given a string, find the first non-repeating character in it and return it's index. If it doesn't exist, return -1.
-
-**Examples**:
-
- s = "leetcode"
- return 0.
-
- s = "loveleetcode",
- return 2.
-
-**Note**: You may assume the string contain only lowercase letters.
-
-
-
-## 题目大意
-
-给定一个字符串，找到它的第一个不重复的字符，并返回它的索引。如果不存在，则返回 -1。
-
-
-## 解题思路
-
-- 简单题，要求输出第一个没有重复的字符。
-
-
-## 代码
-
-```go
-
-package leetcode
-
-func firstUniqChar(s string) int {
- result := make([]int, 26)
- for i := 0; i < len(s); i++ {
- result[s[i]-'a']++
- }
- for i := 0; i < len(s); i++ {
- if result[s[i]-'a'] == 1 {
- return i
- }
- }
- return -1
-}
-
-```
\ No newline at end of file
diff --git a/website/content/ChapterFour/0389.Find-the-Difference.md b/website/content/ChapterFour/0389.Find-the-Difference.md
deleted file mode 100755
index 57b53354f..000000000
--- a/website/content/ChapterFour/0389.Find-the-Difference.md
+++ /dev/null
@@ -1,48 +0,0 @@
-# [389. Find the Difference](https://leetcode.com/problems/find-the-difference/)
-
-## 题目
-
-Given two strings **s** and **t** which consist of only lowercase letters.
-
-String **t** is generated by random shuffling string **s** and then add one more letter at a random position.
-
-Find the letter that was added in **t**.
-
-**Example**:
-
- Input:
- s = "abcd"
- t = "abcde"
-
- Output:
- e
-
- Explanation:
- 'e' is the letter that was added.
-
-## 题目大意
-
-给定两个字符串 s 和 t，它们只包含小写字母。字符串 t 由字符串 s 随机重排，然后在随机位置添加一个字母。请找出在 t 中被添加的字母。
-
-
-## 解题思路
-
-- 题目要求找出 t 字符串中比 s 字符串多出的一个字符。思路还是利用异或的性质，`X^X = 0`，将 s 和 t 依次异或，最终多出来的字符就是最后异或的结果。
-
-
-## 代码
-
-```go
-
-package leetcode
-
-func findTheDifference(s string, t string) byte {
- n, ch := len(t), t[len(t)-1]
- for i := 0; i < n-1; i++ {
- ch ^= s[i]
- ch ^= t[i]
- }
- return ch
-}
-
-```
\ No newline at end of file
diff --git a/website/content/ChapterFour/0400~0499/0400.Nth-Digit.md b/website/content/ChapterFour/0400~0499/0400.Nth-Digit.md
new file mode 100644
index 000000000..543559ac1
--- /dev/null
+++ b/website/content/ChapterFour/0400~0499/0400.Nth-Digit.md
@@ -0,0 +1,74 @@
+# [400. Nth Digit](https://leetcode.com/problems/nth-digit/)
+
+## 题目
+
+Given an integer n, return the nth digit of the infinite integer sequence [1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, ...].
+
+**Example 1**:
+
+ Input: n = 3
+ Output: 3
+
+**Example 2**:
+
+ Input: n = 11
+ Output: 0
+ Explanation: The 11th digit of the sequence 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, ... is a 0, which is part of the number 10.
+
+**Constraints:**
+
+- 1 <= n <= int(math.Pow(2, 31)) - 1
+
+## 题目大意
+
+给你一个整数 n ，请你在无限的整数序列 [1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, ...] 中找出并返回第 n 位数字。
+
+## 解题思路
+
+- bits = 1 的时候有 1,2,3,4,5,6,7,8,9 这 9 个数; 9 = math.Pow10(bits - 1) * bits
+- bits = 2 的时候有 10-99 这 90 个数; 90 = math.Pow10(bits - 1) * bits
+- n 不断减去 bits 从 1 开始的数字总数,求出 n 所在的数字是几位数即 bits
+- 计算 n 所在的数字 num，等于初始值加上 (n - 1) / bits
+- 计算 n 所在这个数字的第几位 digitIdx 等于 (n - 1) % bits
+- 计算出 digitIdx 位的数字
+
+ ### 以11 为例:
+ 11 - 9 = 2
+
+ (2 - 1) / 2 = 0
+
+ (2 - 1) % 2 = 1
+
+ 也就是说第 11 位数字是位数是 2 的第一个数字的第二位，即是 0
+
+## 代码
+
+```go
+
+package leetcode
+
+import "math"
+
+func findNthDigit(n int) int {
+ if n <= 9 {
+ return n
+ }
+ bits := 1
+ for n > 9*int(math.Pow10(bits-1))*bits {
+ n -= 9 * int(math.Pow10(bits-1)) * bits
+ bits++
+ }
+ idx := n - 1
+ start := int(math.Pow10(bits - 1))
+ num := start + idx/bits
+ digitIdx := idx % bits
+ return num / int(math.Pow10(bits-digitIdx-1)) % 10
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0300~0399/0399.Evaluate-Division/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0400~0499/0401.Binary-Watch/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0400~0499/0401.Binary-Watch.md b/website/content/ChapterFour/0400~0499/0401.Binary-Watch.md
new file mode 100755
index 000000000..07ebddf69
--- /dev/null
+++ b/website/content/ChapterFour/0400~0499/0401.Binary-Watch.md
@@ -0,0 +1,183 @@
+# [401. Binary Watch](https://leetcode.com/problems/binary-watch/)
+
+
+## 题目
+
+A binary watch has 4 LEDs on the top which represent the **hours** (**0-11**), and the 6 LEDs on the bottom represent the **minutes** (**0-59**).
+
+Each LED represents a zero or one, with the least significant bit on the right.
+
+
+
+For example, the above binary watch reads "3:25".
+
+Given a non-negative integer n which represents the number of LEDs that are currently on, return all possible times the watch could represent.
+
+**Example**:
+
+ Input: n = 1
+ Return: ["1:00", "2:00", "4:00", "8:00", "0:01", "0:02", "0:04", "0:08", "0:16", "0:32"]
+
+**Note**:
+
+- The order of output does not matter.
+- The hour must not contain a leading zero, for example "01:00" is not valid, it should be "1:00".
+- The minute must be consist of two digits and may contain a leading zero, for example "10:2" is not valid, it should be "10:02".
+
+
+## 题目大意
+
+二进制手表顶部有 4 个 LED 代表小时（0-11），底部的 6 个 LED 代表分钟（0-59）。每个 LED 代表一个 0 或 1，最低位在右侧。
+
+给定一个非负整数 n 代表当前 LED 亮着的数量，返回二进制表所有可能的时间。
+
+
+## 解题思路
+
+
+- 给出数字 n，要求输出二进制表中所有可能的时间
+- 题目中比较坑的是，分钟大于 60 的都不应该打印出来，小时大于 12 的也不应该打印出来，因为是非法的。给出的 num 大于 8 的也是非法值，最终结果应该输出空字符串数组。
+- 这道题的数据量不大，可以直接用打表法，具体打表函数见 `findReadBinaryWatchMinute()` 和 `findReadBinaryWatchHour()` 这两个函数。
+
+
+## 代码
+
+```go
+
+package leetcode
+
+import (
+ "fmt"
+ "strconv"
+)
+
+// 解法一
+func readBinaryWatch(num int) []string {
+ memo := make([]int, 60)
+ // count the number of 1 in a binary number
+ count := func(n int) int {
+ if memo[n] != 0 {
+ return memo[n]
+ }
+ originN, res := n, 0
+ for n != 0 {
+ n = n & (n - 1)
+ res++
+ }
+ memo[originN] = res
+ return res
+ }
+ // fmtMinute format minute 0:1 -> 0:01
+ fmtMinute := func(m int) string {
+ if m < 10 {
+ return "0" + strconv.Itoa(m)
+ }
+ return strconv.Itoa(m)
+ }
+
+ var res []string
+ // traverse 0:00 -> 12:00
+ for i := 0; i < 12; i++ {
+ for j := 0; j < 60; j++ {
+ if count(i)+count(j) == num {
+ res = append(res, strconv.Itoa(i)+":"+fmtMinute(j))
+ }
+ }
+ }
+ return res
+}
+
+// 解法二 打表
+var (
+ hour = []string{"1", "2", "4", "8"}
+ minute = []string{"01", "02", "04", "08", "16", "32"}
+ hourMap = map[int][]string{
+ 0: {"0"},
+ 1: {"1", "2", "4", "8"},
+ 2: {"3", "5", "9", "6", "10"},
+ 3: {"7", "11"},
+ }
+ minuteMap = map[int][]string{
+ 0: {"00"},
+ 1: {"01", "02", "04", "08", "16", "32"},
+ 2: {"03", "05", "09", "17", "33", "06", "10", "18", "34", "12", "20", "36", "24", "40", "48"},
+ 3: {"07", "11", "19", "35", "13", "21", "37", "25", "41", "49", "14", "22", "38", "26", "42", "50", "28", "44", "52", "56"},
+ 4: {"15", "23", "39", "27", "43", "51", "29", "45", "53", "57", "30", "46", "54", "58"},
+ 5: {"31", "47", "55", "59"},
+ }
+)
+
+func readBinaryWatch1(num int) []string {
+ var res []string
+ if num > 8 {
+ return res
+ }
+ for i := 0; i <= num; i++ {
+ for j := 0; j < len(hourMap[i]); j++ {
+ for k := 0; k < len(minuteMap[num-i]); k++ {
+ res = append(res, hourMap[i][j]+":"+minuteMap[num-i][k])
+ }
+ }
+ }
+ return res
+}
+
+/// ---------------------------------------
+/// ---------------------------------------
+/// ---------------------------------------
+/// ---------------------------------------
+/// ---------------------------------------
+// 以下是打表用到的函数
+// 调用 findReadBinaryWatchMinute(num, 0, c, &res) 打表
+func findReadBinaryWatchMinute(target, index int, c []int, res *[]string) {
+ if target == 0 {
+ str, tmp := "", 0
+ for i := 0; i < len(c); i++ {
+ t, _ := strconv.Atoi(minute[c[i]])
+ tmp += t
+ }
+ if tmp < 10 {
+ str = "0" + strconv.Itoa(tmp)
+ } else {
+ str = strconv.Itoa(tmp)
+ }
+ // fmt.Printf("找到解了 c = %v str = %v\n", c, str)
+ fmt.Printf("\"%v\", ", str)
+ return
+ }
+ for i := index; i < 6; i++ {
+ c = append(c, i)
+ findReadBinaryWatchMinute(target-1, i+1, c, res)
+ c = c[:len(c)-1]
+ }
+}
+
+// 调用 findReadBinaryWatchHour(num, 0, c, &res) 打表
+func findReadBinaryWatchHour(target, index int, c []int, res *[]string) {
+ if target == 0 {
+ str, tmp := "", 0
+ for i := 0; i < len(c); i++ {
+ t, _ := strconv.Atoi(hour[c[i]])
+ tmp += t
+ }
+ str = strconv.Itoa(tmp)
+ //fmt.Printf("找到解了 c = %v str = %v\n", c, str)
+ fmt.Printf("\"%v\", ", str)
+ return
+ }
+ for i := index; i < 4; i++ {
+ c = append(c, i)
+ findReadBinaryWatchHour(target-1, i+1, c, res)
+ c = c[:len(c)-1]
+ }
+}
+
+
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0400~0499/0400.Nth-Digit/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0400~0499/0402.Remove-K-Digits/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0402.Remove-K-Digits.md b/website/content/ChapterFour/0400~0499/0402.Remove-K-Digits.md
similarity index 84%
rename from website/content/ChapterFour/0402.Remove-K-Digits.md
rename to website/content/ChapterFour/0400~0499/0402.Remove-K-Digits.md
index 52c3ce27c..7e3592c6b 100644
--- a/website/content/ChapterFour/0402.Remove-K-Digits.md
+++ b/website/content/ChapterFour/0400~0499/0402.Remove-K-Digits.md
@@ -85,4 +85,11 @@ func removeKdigits(num string, k int) string {
return string(res)
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0400~0499/0401.Binary-Watch/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0400~0499/0404.Sum-of-Left-Leaves/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0400~0499/0404.Sum-of-Left-Leaves.md b/website/content/ChapterFour/0400~0499/0404.Sum-of-Left-Leaves.md
new file mode 100755
index 000000000..7e280d0fa
--- /dev/null
+++ b/website/content/ChapterFour/0400~0499/0404.Sum-of-Left-Leaves.md
@@ -0,0 +1,62 @@
+# [404. Sum of Left Leaves](https://leetcode.com/problems/sum-of-left-leaves/)
+
+
+## 题目
+
+Find the sum of all left leaves in a given binary tree.
+
+**Example**:
+
+ 3
+ / \
+ 9 20
+ / \
+ 15 7
+
+ There are two left leaves in the binary tree, with values 9 and 15 respectively. Return 24.
+
+
+## 题目大意
+
+计算给定二叉树的所有左叶子之和。
+
+
+## 解题思路
+
+
+- 这一题是微软的面试题。递归求解即可
+
+
+
+## 代码
+
+```go
+
+package leetcode
+
+/**
+ * Definition for a binary tree node.
+ * type TreeNode struct {
+ * Val int
+ * Left *TreeNode
+ * Right *TreeNode
+ * }
+ */
+func sumOfLeftLeaves(root *TreeNode) int {
+ if root == nil {
+ return 0
+ }
+ if root.Left != nil && root.Left.Left == nil && root.Left.Right == nil {
+ return root.Left.Val + sumOfLeftLeaves(root.Right)
+ }
+ return sumOfLeftLeaves(root.Left) + sumOfLeftLeaves(root.Right)
+}
+
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0400~0499/0402.Remove-K-Digits/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0400~0499/0405.Convert-a-Number-to-Hexadecimal/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0405.Convert-a-Number-to-Hexadecimal.md b/website/content/ChapterFour/0400~0499/0405.Convert-a-Number-to-Hexadecimal.md
similarity index 85%
rename from website/content/ChapterFour/0405.Convert-a-Number-to-Hexadecimal.md
rename to website/content/ChapterFour/0400~0499/0405.Convert-a-Number-to-Hexadecimal.md
index c77a02585..62615f8d9 100755
--- a/website/content/ChapterFour/0405.Convert-a-Number-to-Hexadecimal.md
+++ b/website/content/ChapterFour/0400~0499/0405.Convert-a-Number-to-Hexadecimal.md
@@ -77,4 +77,11 @@ func toHex(num int) string {
return str
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0400~0499/0404.Sum-of-Left-Leaves/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0400~0499/0409.Longest-Palindrome/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0409.Longest-Palindrome.md b/website/content/ChapterFour/0400~0499/0409.Longest-Palindrome.md
similarity index 79%
rename from website/content/ChapterFour/0409.Longest-Palindrome.md
rename to website/content/ChapterFour/0400~0499/0409.Longest-Palindrome.md
index a0e18ad19..2f6aa28a3 100755
--- a/website/content/ChapterFour/0409.Longest-Palindrome.md
+++ b/website/content/ChapterFour/0400~0499/0409.Longest-Palindrome.md
@@ -54,4 +54,11 @@ func longestPalindrome(s string) int {
return answer
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0400~0499/0405.Convert-a-Number-to-Hexadecimal/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0400~0499/0410.Split-Array-Largest-Sum/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0410.Split-Array-Largest-Sum.md b/website/content/ChapterFour/0400~0499/0410.Split-Array-Largest-Sum.md
similarity index 86%
rename from website/content/ChapterFour/0410.Split-Array-Largest-Sum.md
rename to website/content/ChapterFour/0400~0499/0410.Split-Array-Largest-Sum.md
index f4ce4e9b1..c84eebaa0 100755
--- a/website/content/ChapterFour/0410.Split-Array-Largest-Sum.md
+++ b/website/content/ChapterFour/0400~0499/0410.Split-Array-Largest-Sum.md
@@ -89,4 +89,11 @@ func calSum(mid, m int, nums []int) bool {
return true
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0400~0499/0409.Longest-Palindrome/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0400~0499/0412.Fizz-Buzz/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0400~0499/0412.Fizz-Buzz.md b/website/content/ChapterFour/0400~0499/0412.Fizz-Buzz.md
new file mode 100644
index 000000000..72ab8c7c3
--- /dev/null
+++ b/website/content/ChapterFour/0400~0499/0412.Fizz-Buzz.md
@@ -0,0 +1,76 @@
+# [412. Fizz Buzz](https://leetcode.com/problems/fizz-buzz/)
+
+## 题目
+
+Write a program that outputs the string representation of numbers from 1 to n.
+
+But for multiples of three it should output “Fizz” instead of the number and for the multiples of five output “Buzz”. For numbers which are multiples of both three and five output “FizzBuzz”.
+
+**Example**:
+
+```
+n = 15,
+
+Return:
+[
+ "1",
+ "2",
+ "Fizz",
+ "4",
+ "Buzz",
+ "Fizz",
+ "7",
+ "8",
+ "Fizz",
+ "Buzz",
+ "11",
+ "Fizz",
+ "13",
+ "14",
+ "FizzBuzz"
+]
+
+```
+
+## 题目大意
+
+3的倍数输出 "Fizz"，5的倍数输出 "Buzz"，15的倍数输出 "FizzBuzz"，其他时候都输出原本的数字。
+
+
+## 解题思路
+
+按照题意做即可。
+
+## 代码
+
+```go
+
+package leetcode
+
+import "strconv"
+
+func fizzBuzz(n int) []string {
+ solution := make([]string, n)
+ for i := 1; i <= n; i++ {
+ solution[i-1] = ""
+ if i%3 == 0 {
+ solution[i-1] += "Fizz"
+ }
+ if i%5 == 0 {
+ solution[i-1] += "Buzz"
+ }
+ if solution[i-1] == "" {
+ solution[i-1] = strconv.Itoa(i)
+ }
+ }
+ return solution
+}
+
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0400~0499/0410.Split-Array-Largest-Sum/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0400~0499/0413.Arithmetic-Slices/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0400~0499/0413.Arithmetic-Slices.md b/website/content/ChapterFour/0400~0499/0413.Arithmetic-Slices.md
new file mode 100644
index 000000000..7c3ee5097
--- /dev/null
+++ b/website/content/ChapterFour/0400~0499/0413.Arithmetic-Slices.md
@@ -0,0 +1,71 @@
+# [413. Arithmetic Slices](https://leetcode.com/problems/arithmetic-slices/)
+
+
+## 题目
+
+A sequence of numbers is called arithmetic if it consists of at least three elements and if the difference between any two consecutive elements is the same.
+
+For example, these are arithmetic sequences:
+
+```
+1, 3, 5, 7, 9
+7, 7, 7, 7
+3, -1, -5, -9
+```
+
+The following sequence is not arithmetic.
+
+```
+1, 1, 2, 5, 7
+```
+
+A zero-indexed array A consisting of N numbers is given. A slice of that array is any pair of integers (P, Q) such that 0 <= P < Q < N.
+
+A slice (P, Q) of the array A is called arithmetic if the sequence:A[P], A[P + 1], ..., A[Q - 1], A[Q] is arithmetic. In particular, this means that P + 1 < Q.
+
+The function should return the number of arithmetic slices in the array A.
+
+**Example:**
+
+```
+A = [1, 2, 3, 4]
+
+return: 3, for 3 arithmetic slices in A: [1, 2, 3], [2, 3, 4] and [1, 2, 3, 4] itself.
+```
+
+## 题目大意
+
+数组 A 包含 N 个数，且索引从0开始。数组 A 的一个子数组划分为数组 (P, Q)，P 与 Q 是整数且满足 0<=P<Q<N 。如果满足以下条件，则称子数组(P, Q)为等差数组：元素 A[P], A[p + 1], ..., A[Q - 1], A[Q] 是等差的。并且 P + 1 < Q 。函数要返回数组 A 中所有为等差数组的子数组个数。
+
+## 解题思路
+
+- 由题目给出的定义，至少 3 个数字以上的等差数列才满足题意。连续 k 个连续等差的元素，包含的子等差数列是底层的，1，2，3…… k。所以每判断一组 3 个连续的数列，只需要用一个变量累加前面已经有多少个满足题意的连续元素，只要满足题意的等差数列就加上这个累加值。一旦不满足等差的条件，累加值置 0。如此循环一次即可找到题目要求的答案。
+
+## 代码
+
+```go
+package leetcode
+
+func numberOfArithmeticSlices(A []int) int {
+ if len(A) < 3 {
+ return 0
+ }
+ res, dp := 0, 0
+ for i := 1; i < len(A)-1; i++ {
+ if A[i+1]-A[i] == A[i]-A[i-1] {
+ dp++
+ res += dp
+ } else {
+ dp = 0
+ }
+ }
+ return res
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0400~0499/0412.Fizz-Buzz/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0400~0499/0414.Third-Maximum-Number/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0414.Third-Maximum-Number.md b/website/content/ChapterFour/0400~0499/0414.Third-Maximum-Number.md
similarity index 79%
rename from website/content/ChapterFour/0414.Third-Maximum-Number.md
rename to website/content/ChapterFour/0400~0499/0414.Third-Maximum-Number.md
index 7c8ef633f..cf74dd4b9 100644
--- a/website/content/ChapterFour/0414.Third-Maximum-Number.md
+++ b/website/content/ChapterFour/0400~0499/0414.Third-Maximum-Number.md
@@ -69,4 +69,11 @@ func thirdMax(nums []int) int {
return c
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0400~0499/0413.Arithmetic-Slices/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0400~0499/0416.Partition-Equal-Subset-Sum/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0416.Partition-Equal-Subset-Sum.md b/website/content/ChapterFour/0400~0499/0416.Partition-Equal-Subset-Sum.md
similarity index 83%
rename from website/content/ChapterFour/0416.Partition-Equal-Subset-Sum.md
rename to website/content/ChapterFour/0400~0499/0416.Partition-Equal-Subset-Sum.md
index ce3a79cca..2947ad58f 100755
--- a/website/content/ChapterFour/0416.Partition-Equal-Subset-Sum.md
+++ b/website/content/ChapterFour/0400~0499/0416.Partition-Equal-Subset-Sum.md
@@ -73,4 +73,11 @@ func canPartition(nums []int) bool {
return dp[C]
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0400~0499/0414.Third-Maximum-Number/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0400~0499/0417.Pacific-Atlantic-Water-Flow/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0400~0499/0417.Pacific-Atlantic-Water-Flow.md b/website/content/ChapterFour/0400~0499/0417.Pacific-Atlantic-Water-Flow.md
new file mode 100644
index 000000000..c19fb8751
--- /dev/null
+++ b/website/content/ChapterFour/0400~0499/0417.Pacific-Atlantic-Water-Flow.md
@@ -0,0 +1,99 @@
+# [417. Pacific Atlantic Water Flow](https://leetcode.com/problems/pacific-atlantic-water-flow/)
+
+
+## 题目
+
+Given an `m x n` matrix of non-negative integers representing the height of each unit cell in a continent, the "Pacific ocean" touches the left and top edges of the matrix and the "Atlantic ocean" touches the right and bottom edges.
+
+Water can only flow in four directions (up, down, left, or right) from a cell to another one with height equal or lower.
+
+Find the list of grid coordinates where water can flow to both the Pacific and Atlantic ocean.
+
+**Note:**
+
+1. The order of returned grid coordinates does not matter.
+2. Both m and n are less than 150.
+
+**Example:**
+
+```
+Given the following 5x5 matrix:
+
+ Pacific ~ ~ ~ ~ ~
+ ~ 1 2 2 3 (5) *
+ ~ 3 2 3 (4) (4) *
+ ~ 2 4 (5) 3 1 *
+ ~ (6) (7) 1 4 5 *
+ ~ (5) 1 1 2 4 *
+ * * * * * Atlantic
+
+Return:
+
+[[0, 4], [1, 3], [1, 4], [2, 2], [3, 0], [3, 1], [4, 0]] (positions with parentheses in above matrix).
+
+```
+
+## 题目大意
+
+给定一个 m x n 的非负整数矩阵来表示一片大陆上各个单元格的高度。“太平洋”处于大陆的左边界和上边界，而“大西洋”处于大陆的右边界和下边界。规定水流只能按照上、下、左、右四个方向流动，且只能从高到低或者在同等高度上流动。请找出那些水流既可以流动到“太平洋”，又能流动到“大西洋”的陆地单元的坐标。
+
+## 解题思路
+
+- 暴力解法，利用 DFS 把二维数据按照行优先搜索一遍，分别标记出太平洋和大西洋水流能到达的位置。再按照列优先搜索一遍，标记出太平洋和大西洋水流能到达的位置。最后两者都能到达的坐标即为所求。
+
+## 代码
+
+```go
+package leetcode
+
+import "math"
+
+func pacificAtlantic(matrix [][]int) [][]int {
+ if len(matrix) == 0 || len(matrix[0]) == 0 {
+ return nil
+ }
+ row, col, res := len(matrix), len(matrix[0]), make([][]int, 0)
+ pacific, atlantic := make([][]bool, row), make([][]bool, row)
+ for i := 0; i < row; i++ {
+ pacific[i] = make([]bool, col)
+ atlantic[i] = make([]bool, col)
+ }
+ for i := 0; i < row; i++ {
+ dfs(matrix, i, 0, &pacific, math.MinInt32)
+ dfs(matrix, i, col-1, &atlantic, math.MinInt32)
+ }
+ for j := 0; j < col; j++ {
+ dfs(matrix, 0, j, &pacific, math.MinInt32)
+ dfs(matrix, row-1, j, &atlantic, math.MinInt32)
+ }
+ for i := 0; i < row; i++ {
+ for j := 0; j < col; j++ {
+ if atlantic[i][j] && pacific[i][j] {
+ res = append(res, []int{i, j})
+ }
+ }
+ }
+ return res
+}
+
+func dfs(matrix [][]int, row, col int, visited *[][]bool, height int) {
+ if row < 0 || row >= len(matrix) || col < 0 || col >= len(matrix[0]) {
+ return
+ }
+ if (*visited)[row][col] || matrix[row][col] < height {
+ return
+ }
+ (*visited)[row][col] = true
+ dfs(matrix, row+1, col, visited, matrix[row][col])
+ dfs(matrix, row-1, col, visited, matrix[row][col])
+ dfs(matrix, row, col+1, visited, matrix[row][col])
+ dfs(matrix, row, col-1, visited, matrix[row][col])
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0400~0499/0416.Partition-Equal-Subset-Sum/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0400~0499/0419.Battleships-in-a-Board/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0400~0499/0419.Battleships-in-a-Board.md b/website/content/ChapterFour/0400~0499/0419.Battleships-in-a-Board.md
new file mode 100644
index 000000000..505b3ab0a
--- /dev/null
+++ b/website/content/ChapterFour/0400~0499/0419.Battleships-in-a-Board.md
@@ -0,0 +1,58 @@
+# [419. Battleships in a Board](https://leetcode.com/problems/battleships-in-a-board/)
+
+## 题目
+
+Given an `m x n` matrix `board` where each cell is a battleship `'X'` or empty `'.'`, return the number of the **battleships** on `board`.
+
+**Battleships** can only be placed horizontally or vertically on `board`. In other words, they can only be made of the shape `1 x k` (`1` row, `k` columns) or `k x 1` (`k` rows, `1` column), where `k` can be of any size. At least one horizontal or vertical cell separates between two battleships (i.e., there are no adjacent battleships).
+
+**Example 1:**
+
+
+
+```c
+Input: board = [["X",".",".","X"],[".",".",".","X"],[".",".",".","X"]]
+Output: 2
+```
+
+**Example 2:**
+
+```c
+Input: board = [["."]]
+Output: 0
+```
+
+**Constraints:**
+
+- `m == board.length`
+- `n == board[i].length`
+- `1 <= m, n <= 200`
+- `board[i][j] is either '.' or 'X'`.
+
+**Follow up:** Could you do it in one-pass, using only `O(1)` extra memory and without modifying the values `board`?
+
+## 题目大意
+
+给定一个大小为`m × n`的矩阵 称之为甲板，矩阵单元格中的`'X'`表示战舰，`'.'`表示空位。
+
+战舰只能水平或竖直摆放在甲板上（换句话说，可以理解为联通的同一行`'X'`或同一列`'X'`只算作一个“战舰群”），任意俩个“战舰群”间都是不相邻的。返回甲板上“战舰群”的数量。
+
+## 解题思路
+
+题目进阶要求一次扫描算法，空间复杂度为`O(1)`，且不能修改矩阵中的值。
+
+因为题目中给定的两个“战舰群”间至少有一个水平或垂直的空位分隔，所以可以通过枚举每个战舰的左上顶点即可统计“战舰群”的个数。
+
+假设当前遍历到矩阵中`'X'`的位置为`(i, j)`，即 `board[i][j]='X'`。如果当前战舰属于一个新的“战舰群”，则需要满足以下条件：
+
+- 当前位置的上方位为空，即 `board[i-1][j]='.'`；
+- 当前位置的左方位为空，即 `board[i][j-1]='.'`；
+
+统计出所有左方位和上方位为空的战舰个数，即可得到“战舰群”的数量。
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0400~0499/0417.Pacific-Atlantic-Water-Flow/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0400~0499/0421.Maximum-XOR-of-Two-Numbers-in-an-Array/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0421.Maximum-XOR-of-Two-Numbers-in-an-Array.md b/website/content/ChapterFour/0400~0499/0421.Maximum-XOR-of-Two-Numbers-in-an-Array.md
similarity index 92%
rename from website/content/ChapterFour/0421.Maximum-XOR-of-Two-Numbers-in-an-Array.md
rename to website/content/ChapterFour/0400~0499/0421.Maximum-XOR-of-Two-Numbers-in-an-Array.md
index e4c527b3e..7abc8d853 100755
--- a/website/content/ChapterFour/0421.Maximum-XOR-of-Two-Numbers-in-an-Array.md
+++ b/website/content/ChapterFour/0400~0499/0421.Maximum-XOR-of-Two-Numbers-in-an-Array.md
@@ -96,4 +96,11 @@ func findMaximumXOR1(nums []int) int {
return res
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0400~0499/0419.Battleships-in-a-Board/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0400~0499/0423.Reconstruct-Original-Digits-from-English/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0400~0499/0423.Reconstruct-Original-Digits-from-English.md b/website/content/ChapterFour/0400~0499/0423.Reconstruct-Original-Digits-from-English.md
new file mode 100644
index 000000000..81309c6a0
--- /dev/null
+++ b/website/content/ChapterFour/0400~0499/0423.Reconstruct-Original-Digits-from-English.md
@@ -0,0 +1,110 @@
+# [423. Reconstruct Original Digits from English](https://leetcode.com/problems/reconstruct-original-digits-from-english/)
+
+
+## 题目
+
+Given a **non-empty** string containing an out-of-order English representation of digits `0-9`, output the digits in ascending order.
+
+**Note:**
+
+1. Input contains only lowercase English letters.
+2. Input is guaranteed to be valid and can be transformed to its original digits. That means invalid inputs such as "abc" or "zerone" are not permitted.
+3. Input length is less than 50,000.
+
+**Example 1:**
+
+```
+Input: "owoztneoer"
+Output: "012"
+```
+
+**Example 2:**
+
+```
+Input: "fviefuro"
+Output: "45"
+```
+
+## 题目大意
+
+给定一个非空字符串，其中包含字母顺序打乱的英文单词表示的数字0-9。按升序输出原始的数字。
+
+注意:
+
+- 输入只包含小写英文字母。
+- 输入保证合法并可以转换为原始的数字，这意味着像 "abc" 或 "zerone" 的输入是不允许的。
+- 输入字符串的长度小于 50,000。
+
+## 解题思路
+
+- 这道题是一道找规律的题目。首先观察 0-9 对应的英文单词，找到特殊规律：所有的偶数都包含一个独特的字母：
+
+ `z` 只在 `zero` 中出现。
+
+ `w` 只在 `two` 中出现。
+
+ `u` 只在 `four` 中出现。
+
+ `x` 只在 `six` 中出现。
+
+ `g` 只在 `eight` 中出现。
+
+- 所以先排除掉这些偶数。然后在看剩下来几个数字对应的英文字母，这也是计算 3，5 和 7 的关键，因为有些单词只在一个奇数和一个偶数中出现（而且偶数已经被计算过了）：
+
+ `h` 只在 `three` 和 `eight` 中出现。
+
+ `f` 只在 `five` 和 `four` 中出现。
+
+ `s` 只在 `seven` 和 `six` 中出现。
+
+- 接下来只需要处理 9 和 0，思路依然相同。
+
+ `i` 在 `nine`，`five`，`six` 和 `eight` 中出现。
+
+ `n` 在 `one`，`seven` 和 `nine` 中出现。
+
+- 最后按照上述的优先级，依次消耗对应的英文字母，生成最终的原始数字。注意按照优先级换算数字的时候，注意有多个重复数字的情况，比如多个 `1`，多个 `5` 等等。
+
+## 代码
+
+```go
+package leetcode
+
+import (
+ "strings"
+)
+
+func originalDigits(s string) string {
+ digits := make([]int, 26)
+ for i := 0; i < len(s); i++ {
+ digits[int(s[i]-'a')]++
+ }
+ res := make([]string, 10)
+ res[0] = convert('z', digits, "zero", "0")
+ res[6] = convert('x', digits, "six", "6")
+ res[2] = convert('w', digits, "two", "2")
+ res[4] = convert('u', digits, "four", "4")
+ res[5] = convert('f', digits, "five", "5")
+ res[1] = convert('o', digits, "one", "1")
+ res[7] = convert('s', digits, "seven", "7")
+ res[3] = convert('r', digits, "three", "3")
+ res[8] = convert('t', digits, "eight", "8")
+ res[9] = convert('i', digits, "nine", "9")
+ return strings.Join(res, "")
+}
+
+func convert(b byte, digits []int, s string, num string) string {
+ v := digits[int(b-'a')]
+ for i := 0; i < len(s); i++ {
+ digits[int(s[i]-'a')] -= v
+ }
+ return strings.Repeat(num, v)
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0400~0499/0421.Maximum-XOR-of-Two-Numbers-in-an-Array/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0400~0499/0424.Longest-Repeating-Character-Replacement/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0424.Longest-Repeating-Character-Replacement.md b/website/content/ChapterFour/0400~0499/0424.Longest-Repeating-Character-Replacement.md
similarity index 83%
rename from website/content/ChapterFour/0424.Longest-Repeating-Character-Replacement.md
rename to website/content/ChapterFour/0400~0499/0424.Longest-Repeating-Character-Replacement.md
index 8e54fbcc6..d9cc7cbe1 100644
--- a/website/content/ChapterFour/0424.Longest-Repeating-Character-Replacement.md
+++ b/website/content/ChapterFour/0400~0499/0424.Longest-Repeating-Character-Replacement.md
@@ -82,4 +82,11 @@ func max(a int, b int) int {
return b
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0400~0499/0423.Reconstruct-Original-Digits-from-English/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0400~0499/0429.N-ary-Tree-Level-Order-Traversal/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0400~0499/0429.N-ary-Tree-Level-Order-Traversal.md b/website/content/ChapterFour/0400~0499/0429.N-ary-Tree-Level-Order-Traversal.md
new file mode 100644
index 000000000..ac4fe90a2
--- /dev/null
+++ b/website/content/ChapterFour/0400~0499/0429.N-ary-Tree-Level-Order-Traversal.md
@@ -0,0 +1,92 @@
+# [429.N-ary Tree Level Order Traversal](https://leetcode.com/problems/n-ary-tree-level-order-traversal/)
+
+
+## 题目
+
+Given an n-ary tree, return the *level order* traversal of its nodes' values.
+
+*Nary-Tree input serialization is represented in their level order traversal, each group of children is separated by the null value (See examples).*
+
+**Example 1:**
+
+
+
+```
+Input: root = [1,null,3,2,4,null,5,6]
+Output: [[1],[3,2,4],[5,6]]
+
+```
+
+**Example 2:**
+
+
+
+```
+Input: root = [1,null,2,3,4,5,null,null,6,7,null,8,null,9,10,null,null,11,null,12,null,13,null,null,14]
+Output: [[1],[2,3,4,5],[6,7,8,9,10],[11,12,13],[14]]
+
+```
+
+**Constraints:**
+
+- The height of the n-ary tree is less than or equal to `1000`
+- The total number of nodes is between `[0, 104]`
+
+## 题目大意
+
+给定一个 N 叉树，返回其节点值的层序遍历。（即从左到右，逐层遍历）。树的序列化输入是用层序遍历，每组子节点都由 null 值分隔（参见示例）。
+
+## 解题思路
+
+- 这是 n 叉树的系列题，第 589 题也是这一系列的题目。这一题思路不难，既然是层序遍历，用 BFS 解答。
+
+## 代码
+
+```go
+package leetcode
+
+/**
+ * Definition for a Node.
+ * type Node struct {
+ * Val int
+ * Children []*Node
+ * }
+ */
+
+type Node struct {
+ Val int
+ Children []*Node
+}
+
+func levelOrder(root *Node) [][]int {
+ var res [][]int
+ var temp []int
+ if root == nil {
+ return res
+ }
+ queue := []*Node{root, nil}
+ for len(queue) > 1 {
+ node := queue[0]
+ queue = queue[1:]
+ if node == nil {
+ queue = append(queue, nil)
+ res = append(res, temp)
+ temp = []int{}
+ } else {
+ temp = append(temp, node.Val)
+ if len(node.Children) > 0 {
+ queue = append(queue, node.Children...)
+ }
+ }
+ }
+ res = append(res, temp)
+ return res
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0400~0499/0424.Longest-Repeating-Character-Replacement/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0400~0499/0433.Minimum-Genetic-Mutation/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0433.Minimum-Genetic-Mutation.md b/website/content/ChapterFour/0400~0499/0433.Minimum-Genetic-Mutation.md
similarity index 91%
rename from website/content/ChapterFour/0433.Minimum-Genetic-Mutation.md
rename to website/content/ChapterFour/0400~0499/0433.Minimum-Genetic-Mutation.md
index 8fea5ecf6..566f2afde 100755
--- a/website/content/ChapterFour/0433.Minimum-Genetic-Mutation.md
+++ b/website/content/ChapterFour/0400~0499/0433.Minimum-Genetic-Mutation.md
@@ -180,4 +180,11 @@ func convert(gene string) uint32 {
return v
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0400~0499/0429.N-ary-Tree-Level-Order-Traversal/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0400~0499/0434.Number-of-Segments-in-a-String/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0400~0499/0434.Number-of-Segments-in-a-String.md b/website/content/ChapterFour/0400~0499/0434.Number-of-Segments-in-a-String.md
new file mode 100644
index 000000000..71d45b7d7
--- /dev/null
+++ b/website/content/ChapterFour/0400~0499/0434.Number-of-Segments-in-a-String.md
@@ -0,0 +1,77 @@
+# [434. Number of Segments in a String](https://leetcode.com/problems/number-of-segments-in-a-string/)
+
+
+## 题目
+
+You are given a string s, return the number of segments in the string.
+
+A segment is defined to be a contiguous sequence of non-space characters.
+
+**Example 1:**
+
+ Input: s = "Hello, my name is John"
+ Output: 5
+ Explanation: The five segments are ["Hello,", "my", "name", "is", "John"]
+
+**Example 2:**
+
+ Input: s = "Hello"
+ Output: 1
+
+**Example 3:**
+
+ Input: s = "love live! mu'sic forever"
+ Output: 4
+
+**Example 4:**
+
+ Input: s = ""
+ Output: 0
+
+**Constraints**
+
+ - 0 <= s.length <= 300
+ - s consists of lower-case and upper-case English letters, digits or one of the following characters "!@#$%^&*()_+-=',.:".
+ - The only space character in s is ' '.
+
+## 题目大意
+
+统计字符串中的单词个数，这里的单词指的是连续的不是空格的字符。
+
+请注意，你可以假定字符串里不包括任何不可打印的字符。
+
+## 解题思路
+
+- 以空格为分割计算元素个数
+
+## 代码
+
+```go
+
+package leetcode
+
+func countSegments(s string) int {
+ segments := false
+ cnt := 0
+ for _, v := range s {
+ if v == ' ' && segments {
+ segments = false
+ cnt += 1
+ } else if v != ' ' {
+ segments = true
+ }
+ }
+ if segments {
+ cnt++
+ }
+ return cnt
+}
+
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0400~0499/0433.Minimum-Genetic-Mutation/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0400~0499/0435.Non-overlapping-Intervals/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0435.Non-overlapping-Intervals.md b/website/content/ChapterFour/0400~0499/0435.Non-overlapping-Intervals.md
similarity index 89%
rename from website/content/ChapterFour/0435.Non-overlapping-Intervals.md
rename to website/content/ChapterFour/0400~0499/0435.Non-overlapping-Intervals.md
index ff8c90743..17d409ac3 100755
--- a/website/content/ChapterFour/0435.Non-overlapping-Intervals.md
+++ b/website/content/ChapterFour/0400~0499/0435.Non-overlapping-Intervals.md
@@ -132,4 +132,11 @@ func eraseOverlapIntervals1(intervals [][]int) int {
return len(intervals) - res
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0400~0499/0434.Number-of-Segments-in-a-String/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0400~0499/0436.Find-Right-Interval/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0436.Find-Right-Interval.md b/website/content/ChapterFour/0400~0499/0436.Find-Right-Interval.md
similarity index 92%
rename from website/content/ChapterFour/0436.Find-Right-Interval.md
rename to website/content/ChapterFour/0400~0499/0436.Find-Right-Interval.md
index 2bb73c8d2..d8b2d726f 100755
--- a/website/content/ChapterFour/0436.Find-Right-Interval.md
+++ b/website/content/ChapterFour/0400~0499/0436.Find-Right-Interval.md
@@ -139,4 +139,11 @@ func searchFirstGreaterInterval(nums []Interval, target int) int {
return -1
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0400~0499/0435.Non-overlapping-Intervals/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0400~0499/0437.Path-Sum-III/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0400~0499/0437.Path-Sum-III.md b/website/content/ChapterFour/0400~0499/0437.Path-Sum-III.md
new file mode 100755
index 000000000..cf8405325
--- /dev/null
+++ b/website/content/ChapterFour/0400~0499/0437.Path-Sum-III.md
@@ -0,0 +1,127 @@
+# [437. Path Sum III](https://leetcode.com/problems/path-sum-iii/)
+
+
+## 题目
+
+Given the `root` of a binary tree and an integer `targetSum`, return *the number of paths where the sum of the values along the path equals* `targetSum`.
+
+The path does not need to start or end at the root or a leaf, but it must go downwards (i.e., traveling only from parent nodes to child nodes).
+
+**Example 1:**
+
+
+
+```
+Input: root = [10,5,-3,3,2,null,11,3,-2,null,1], targetSum = 8
+Output: 3
+Explanation: The paths that sum to 8 are shown.
+
+```
+
+**Example 2:**
+
+```
+Input: root = [5,4,8,11,null,13,4,7,2,null,null,5,1], targetSum = 22
+Output: 3
+
+```
+
+**Constraints:**
+
+- The number of nodes in the tree is in the range `[0, 1000]`.
+- `109 <= Node.val <= 109`
+- `1000 <= targetSum <= 1000`
+
+## 题目大意
+
+给定一个二叉树，它的每个结点都存放着一个整数值。找出路径和等于给定数值的路径总数。路径不需要从根节点开始，也不需要在叶子节点结束，但是路径方向必须是向下的（只能从父节点到子节点）。二叉树不超过1000个节点，且节点数值范围是 [-1000000,1000000] 的整数。
+
+
+## 解题思路
+
+
+- 这一题是第 112 题 Path Sum 和第 113 题 Path Sum II 的加强版，这一题要求求出任意一条路径的和为 sum，起点不一定是根节点，可以是任意节点开始。
+- 注意这一题可能出现负数的情况，节点和为 sum，并不一定是最终情况，有可能下面还有正数节点和负数节点相加正好为 0，那么这也是一种情况。一定要遍历到底。
+- 一个点是否为 sum 的起点，有 3 种情况，第一种情况路径包含该 root 节点，如果包含该结点，就在它的左子树和右子树中寻找和为 `sum-root.Val` 的情况。第二种情况路径不包含该 root 节点，那么就需要在它的左子树和右子树中分别寻找和为 sum 的结点。
+
+
+
+## 代码
+
+```go
+
+package leetcode
+
+import (
+ "github.com/halfrost/leetcode-go/structures"
+)
+
+// TreeNode define
+type TreeNode = structures.TreeNode
+
+/**
+ * Definition for a binary tree node.
+ * type TreeNode struct {
+ * Val int
+ * Left *TreeNode
+ * Right *TreeNode
+ * }
+ */
+
+// 解法一 带缓存 dfs
+func pathSum(root *TreeNode, targetSum int) int {
+ prefixSum := make(map[int]int)
+ prefixSum[0] = 1
+ return dfs(root, prefixSum, 0, targetSum)
+}
+
+func dfs(root *TreeNode, prefixSum map[int]int, cur, sum int) int {
+ if root == nil {
+ return 0
+ }
+ cur += root.Val
+ cnt := 0
+ if v, ok := prefixSum[cur-sum]; ok {
+ cnt = v
+ }
+ prefixSum[cur]++
+ cnt += dfs(root.Left, prefixSum, cur, sum)
+ cnt += dfs(root.Right, prefixSum, cur, sum)
+ prefixSum[cur]--
+ return cnt
+}
+
+// 解法二
+func pathSumIII(root *TreeNode, sum int) int {
+ if root == nil {
+ return 0
+ }
+ res := findPath437(root, sum)
+ res += pathSumIII(root.Left, sum)
+ res += pathSumIII(root.Right, sum)
+ return res
+}
+
+// 寻找包含 root 这个结点，且和为 sum 的路径
+func findPath437(root *TreeNode, sum int) int {
+ if root == nil {
+ return 0
+ }
+ res := 0
+ if root.Val == sum {
+ res++
+ }
+ res += findPath437(root.Left, sum-root.Val)
+ res += findPath437(root.Right, sum-root.Val)
+ return res
+}
+
+
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0400~0499/0436.Find-Right-Interval/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0400~0499/0438.Find-All-Anagrams-in-a-String/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0438.Find-All-Anagrams-in-a-String.md b/website/content/ChapterFour/0400~0499/0438.Find-All-Anagrams-in-a-String.md
similarity index 88%
rename from website/content/ChapterFour/0438.Find-All-Anagrams-in-a-String.md
rename to website/content/ChapterFour/0400~0499/0438.Find-All-Anagrams-in-a-String.md
index c422dbb1b..93d240934 100644
--- a/website/content/ChapterFour/0438.Find-All-Anagrams-in-a-String.md
+++ b/website/content/ChapterFour/0400~0499/0438.Find-All-Anagrams-in-a-String.md
@@ -103,4 +103,11 @@ func findAnagrams(s string, p string) []int {
return result
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0400~0499/0437.Path-Sum-III/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0400~0499/0441.Arranging-Coins/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0441.Arranging-Coins.md b/website/content/ChapterFour/0400~0499/0441.Arranging-Coins.md
similarity index 80%
rename from website/content/ChapterFour/0441.Arranging-Coins.md
rename to website/content/ChapterFour/0400~0499/0441.Arranging-Coins.md
index d76eb6264..33fdee75b 100755
--- a/website/content/ChapterFour/0441.Arranging-Coins.md
+++ b/website/content/ChapterFour/0400~0499/0441.Arranging-Coins.md
@@ -72,4 +72,11 @@ func arrangeCoins1(n int) int {
return k - 1
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0400~0499/0438.Find-All-Anagrams-in-a-String/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0400~0499/0445.Add-Two-Numbers-II/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0400~0499/0445.Add-Two-Numbers-II.md b/website/content/ChapterFour/0400~0499/0445.Add-Two-Numbers-II.md
new file mode 100644
index 000000000..a4156c6fb
--- /dev/null
+++ b/website/content/ChapterFour/0400~0499/0445.Add-Two-Numbers-II.md
@@ -0,0 +1,188 @@
+# [445. Add Two Numbers II](https://leetcode.com/problems/add-two-numbers-ii/)
+
+## 题目
+
+You are given two non-empty linked lists representing two non-negative integers. The most significant digit comes first and each of their nodes contain a single digit. Add the two numbers and return it as a linked list.
+
+You may assume the two numbers do not contain any leading zero, except the number 0 itself.
+
+**Follow up**:
+What if you cannot modify the input lists? In other words, reversing the lists is not allowed.
+
+**Example**:
+
+```
+
+Input: (7 -> 2 -> 4 -> 3) + (5 -> 6 -> 4)
+Output: 7 -> 8 -> 0 -> 7
+
+```
+
+## 题目大意
+
+这道题是第 2 题的变种题，第 2 题中的 2 个数是从个位逆序排到高位，这样相加只用从头交到尾，进位一直进位即可。这道题目中强制要求不能把链表逆序。2 个数字是从高位排到低位的，这样进位是倒着来的。
+
+## 解题思路
+
+思路也不难，加法只用把短的链表依次加到长的链表上面来就可以了，最终判断一下最高位有没有进位，有进位再往前进一位。加法的过程可以用到递归。
+
+## 代码
+
+```go
+
+package leetcode
+
+/**
+ * Definition for singly-linked list.
+ * type ListNode struct {
+ * Val int
+ * Next *ListNode
+ * }
+ */
+package leetcode
+
+import (
+ "github.com/halfrost/leetcode-go/structures"
+)
+
+// ListNode define
+type ListNode = structures.ListNode
+
+/**
+ * Definition for singly-linked list.
+ * type ListNode struct {
+ * Val int
+ * Next *ListNode
+ * }
+ */
+func addTwoNumbers445(l1 *ListNode, l2 *ListNode) *ListNode {
+ if l1 == nil {
+ return l2
+ }
+ if l2 == nil {
+ return l1
+ }
+ l1Length := getLength(l1)
+ l2Length := getLength(l2)
+ newHeader := &ListNode{Val: 1, Next: nil}
+ if l1Length < l2Length {
+ newHeader.Next = addNode(l2, l1, l2Length-l1Length)
+ } else {
+ newHeader.Next = addNode(l1, l2, l1Length-l2Length)
+ }
+ if newHeader.Next.Val > 9 {
+ newHeader.Next.Val = newHeader.Next.Val % 10
+ return newHeader
+ }
+ return newHeader.Next
+}
+
+func addNode(l1 *ListNode, l2 *ListNode, offset int) *ListNode {
+ if l1 == nil {
+ return nil
+ }
+ var (
+ res, node *ListNode
+ )
+ if offset == 0 {
+ res = &ListNode{Val: l1.Val + l2.Val, Next: nil}
+ node = addNode(l1.Next, l2.Next, 0)
+ } else {
+ res = &ListNode{Val: l1.Val, Next: nil}
+ node = addNode(l1.Next, l2, offset-1)
+ }
+ if node != nil && node.Val > 9 {
+ res.Val++
+ node.Val = node.Val % 10
+ }
+ res.Next = node
+ return res
+}
+
+func getLength(l *ListNode) int {
+ count := 0
+ cur := l
+ for cur != nil {
+ count++
+ cur = cur.Next
+ }
+ return count
+}
+
+func addTwoNumbers1(l1 *ListNode, l2 *ListNode) *ListNode {
+ reservedL1 := reverseList(l1)
+ reservedL2 := reverseList(l2)
+
+ dummyHead := &ListNode{}
+ head := dummyHead
+ carry := 0
+ for reservedL1 != nil || reservedL2 != nil || carry > 0 {
+ val := carry
+ if reservedL1 != nil {
+ val = reservedL1.Val + val
+ reservedL1 = reservedL1.Next
+ }
+ if reservedL2 != nil {
+ val = reservedL2.Val + val
+ reservedL2 = reservedL2.Next
+ }
+ carry = val / 10
+ head.Next = &ListNode{Val: val % 10}
+ head = head.Next
+ }
+ return reverseList(dummyHead.Next)
+}
+
+func reverseList(head *ListNode) *ListNode {
+ var prev *ListNode
+ for head != nil {
+ tmp := head.Next
+ head.Next = prev
+
+ prev = head
+ head = tmp
+ }
+ return prev
+}
+
+func addTwoNumbers(l1 *ListNode, l2 *ListNode) *ListNode {
+ stack1 := pushStack(l1)
+ stack2 := pushStack(l2)
+
+ dummyHead := &ListNode{}
+ head := dummyHead
+ carry := 0
+ for len(stack1) > 0 || len(stack2) > 0 || carry > 0 {
+ val := carry
+ if len(stack1) > 0 {
+ val = val + stack1[len(stack1)-1]
+ stack1 = stack1[:len(stack1)-1]
+ }
+ if len(stack2) > 0 {
+ val = val + stack2[len(stack2)-1]
+ stack2 = stack2[:len(stack2)-1]
+ }
+ carry = val / 10
+ tmp := head.Next
+ head.Next = &ListNode{Val: val % 10, Next: tmp}
+ }
+ return dummyHead.Next
+}
+
+func pushStack(l *ListNode) []int {
+ var stack []int
+ for l != nil {
+ stack = append(stack, l.Val)
+ l = l.Next
+ }
+ return stack
+}
+
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0400~0499/0441.Arranging-Coins/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0400~0499/0447.Number-of-Boomerangs/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0447.Number-of-Boomerangs.md b/website/content/ChapterFour/0400~0499/0447.Number-of-Boomerangs.md
similarity index 83%
rename from website/content/ChapterFour/0447.Number-of-Boomerangs.md
rename to website/content/ChapterFour/0400~0499/0447.Number-of-Boomerangs.md
index 332a6a3e6..33f3c1fd9 100644
--- a/website/content/ChapterFour/0447.Number-of-Boomerangs.md
+++ b/website/content/ChapterFour/0400~0499/0447.Number-of-Boomerangs.md
@@ -63,4 +63,11 @@ func dis(pa, pb []int) int {
return (pa[0]-pb[0])*(pa[0]-pb[0]) + (pa[1]-pb[1])*(pa[1]-pb[1])
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0400~0499/0445.Add-Two-Numbers-II/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0400~0499/0448.Find-All-Numbers-Disappeared-in-an-Array/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0448.Find-All-Numbers-Disappeared-in-an-Array.md b/website/content/ChapterFour/0400~0499/0448.Find-All-Numbers-Disappeared-in-an-Array.md
similarity index 83%
rename from website/content/ChapterFour/0448.Find-All-Numbers-Disappeared-in-an-Array.md
rename to website/content/ChapterFour/0400~0499/0448.Find-All-Numbers-Disappeared-in-an-Array.md
index ec98b0b4a..29532c7ef 100644
--- a/website/content/ChapterFour/0448.Find-All-Numbers-Disappeared-in-an-Array.md
+++ b/website/content/ChapterFour/0400~0499/0448.Find-All-Numbers-Disappeared-in-an-Array.md
@@ -54,4 +54,11 @@ func findDisappearedNumbers(nums []int) []int {
return res
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0400~0499/0447.Number-of-Boomerangs/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0400~0499/0451.Sort-Characters-By-Frequency/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0451.Sort-Characters-By-Frequency.md b/website/content/ChapterFour/0400~0499/0451.Sort-Characters-By-Frequency.md
similarity index 80%
rename from website/content/ChapterFour/0451.Sort-Characters-By-Frequency.md
rename to website/content/ChapterFour/0400~0499/0451.Sort-Characters-By-Frequency.md
index 58558d7f3..81a8d91a0 100644
--- a/website/content/ChapterFour/0451.Sort-Characters-By-Frequency.md
+++ b/website/content/ChapterFour/0400~0499/0451.Sort-Characters-By-Frequency.md
@@ -110,4 +110,11 @@ func frequencySort(s string) string {
return string(res)
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0400~0499/0448.Find-All-Numbers-Disappeared-in-an-Array/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0400~0499/0453.Minimum-Moves-to-Equal-Array-Elements/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0453.Minimum-Moves-to-Equal-Array-Elements.md b/website/content/ChapterFour/0400~0499/0453.Minimum-Moves-to-Equal-Array-Elements.md
similarity index 80%
rename from website/content/ChapterFour/0453.Minimum-Moves-to-Equal-Array-Elements.md
rename to website/content/ChapterFour/0400~0499/0453.Minimum-Moves-to-Equal-Array-Elements.md
index 280f22a25..f868c33a3 100644
--- a/website/content/ChapterFour/0453.Minimum-Moves-to-Equal-Array-Elements.md
+++ b/website/content/ChapterFour/0400~0499/0453.Minimum-Moves-to-Equal-Array-Elements.md
@@ -48,4 +48,11 @@ func minMoves(nums []int) int {
return sum - min*l
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0400~0499/0451.Sort-Characters-By-Frequency/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0400~0499/0454.4Sum-II/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0454.4Sum-II.md b/website/content/ChapterFour/0400~0499/0454.4Sum-II.md
similarity index 80%
rename from website/content/ChapterFour/0454.4Sum-II.md
rename to website/content/ChapterFour/0400~0499/0454.4Sum-II.md
index 6a60ecf1e..bccad3d5a 100644
--- a/website/content/ChapterFour/0454.4Sum-II.md
+++ b/website/content/ChapterFour/0400~0499/0454.4Sum-II.md
@@ -23,7 +23,7 @@ Explanation:
The two tuples are:
1. (0, 0, 0, 1) -> A[0] + B[0] + C[0] + D[1] = 1 + (-2) + (-1) + 2 = 0
2. (1, 1, 0, 0) -> A[1] + B[1] + C[0] + D[0] = 2 + (-1) + (-1) + 0 = 0
-3.
+
```
@@ -62,4 +62,11 @@ func fourSumCount(A []int, B []int, C []int, D []int) int {
return ret
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0400~0499/0453.Minimum-Moves-to-Equal-Array-Elements/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0400~0499/0455.Assign-Cookies/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0455.Assign-Cookies.md b/website/content/ChapterFour/0400~0499/0455.Assign-Cookies.md
similarity index 88%
rename from website/content/ChapterFour/0455.Assign-Cookies.md
rename to website/content/ChapterFour/0400~0499/0455.Assign-Cookies.md
index 4efda7a80..dfd13b3a0 100755
--- a/website/content/ChapterFour/0455.Assign-Cookies.md
+++ b/website/content/ChapterFour/0400~0499/0455.Assign-Cookies.md
@@ -66,4 +66,11 @@ func findContentChildren(g []int, s []int) int {
return res
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0400~0499/0454.4Sum-II/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0400~0499/0456.132-Pattern/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0456.132-Pattern.md b/website/content/ChapterFour/0400~0499/0456.132-Pattern.md
similarity index 85%
rename from website/content/ChapterFour/0456.132-Pattern.md
rename to website/content/ChapterFour/0400~0499/0456.132-Pattern.md
index 382c27208..abd44ce62 100755
--- a/website/content/ChapterFour/0456.132-Pattern.md
+++ b/website/content/ChapterFour/0400~0499/0456.132-Pattern.md
@@ -53,7 +53,6 @@ Given a sequence of n integers a1, a2, ..., an, a 132 pattern is a subsequence a
package leetcode
import (
- "fmt"
"math"
)
@@ -72,7 +71,6 @@ func find132pattern(nums []int) bool {
stack = stack[:len(stack)-1]
}
stack = append(stack, nums[i])
- fmt.Printf("stack = %v \n", stack)
}
return false
}
@@ -100,4 +98,11 @@ func find132pattern1(nums []int) bool {
return false
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0400~0499/0455.Assign-Cookies/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0400~0499/0457.Circular-Array-Loop/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0457.Circular-Array-Loop.md b/website/content/ChapterFour/0400~0499/0457.Circular-Array-Loop.md
similarity index 92%
rename from website/content/ChapterFour/0457.Circular-Array-Loop.md
rename to website/content/ChapterFour/0400~0499/0457.Circular-Array-Loop.md
index 89756b228..d43a50e6e 100755
--- a/website/content/ChapterFour/0457.Circular-Array-Loop.md
+++ b/website/content/ChapterFour/0400~0499/0457.Circular-Array-Loop.md
@@ -101,4 +101,11 @@ func getNextIndex(nums []int, index int) int {
return ((nums[index]+index)%len(nums) + len(nums)) % len(nums)
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0400~0499/0456.132-Pattern/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0400~0499/0458.Poor-Pigs/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0400~0499/0458.Poor-Pigs.md b/website/content/ChapterFour/0400~0499/0458.Poor-Pigs.md
new file mode 100644
index 000000000..dcccfda06
--- /dev/null
+++ b/website/content/ChapterFour/0400~0499/0458.Poor-Pigs.md
@@ -0,0 +1,84 @@
+# [458. Poor Pigs](https://leetcode.com/problems/poor-pigs/)
+
+## 题目
+
+There are buckets buckets of liquid, where exactly one of the buckets is poisonous. To figure out which one is poisonous, you feed some number of (poor) pigs the liquid to see whether they will die or not. Unfortunately, you only have minutesToTest minutes to determine which bucket is poisonous.
+
+You can feed the pigs according to these steps:
+
+- Choose some live pigs to feed.
+- For each pig, choose which buckets to feed it. The pig will consume all the chosen buckets simultaneously and will take no time.
+- Wait for minutesToDie minutes. You may not feed any other pigs during this time.
+- After minutesToDie minutes have passed, any pigs that have been fed the poisonous bucket will die, and all others will survive.
+- Repeat this process until you run out of time.
+
+Given buckets, minutesToDie, and minutesToTest, return the minimum number of pigs needed to figure out which bucket is poisonous within the allotted time.
+
+**Example 1**:
+
+ Input: buckets = 1000, minutesToDie = 15, minutesToTest = 60
+ Output: 5
+
+**Example 2**:
+
+ Input: buckets = 4, minutesToDie = 15, minutesToTest = 15
+ Output: 2
+
+**Example 3**:
+
+ Input: buckets = 4, minutesToDie = 15, minutesToTest = 30
+ Output: 2
+
+**Constraints:**
+
+- 1 <= buckets <= 1000
+- 1 <= minutesToDie <= minutesToTest <= 100
+
+## 题目大意
+
+有 buckets 桶液体，其中 正好 有一桶含有毒药，其余装的都是水。它们从外观看起来都一样。为了弄清楚哪只水桶含有毒药，你可以喂一些猪喝，通过观察猪是否会死进行判断。不幸的是，你只有 minutesToTest 分钟时间来确定哪桶液体是有毒的。
+
+喂猪的规则如下：
+
+- 选择若干活猪进行喂养
+- 可以允许小猪同时饮用任意数量的桶中的水，并且该过程不需要时间。
+- 小猪喝完水后，必须有 minutesToDie 分钟的冷却时间。在这段时间里，你只能观察，而不允许继续喂猪。
+- 过了 minutesToDie 分钟后，所有喝到毒药的猪都会死去，其他所有猪都会活下来。
+- 重复这一过程，直到时间用完。
+
+给你桶的数目 buckets ，minutesToDie 和 minutesToTest ，返回在规定时间内判断哪个桶有毒所需的 最小 猪数。
+
+## 解题思路
+
+使用数学方法,以 minutesToDie=15, minutesToTest=60, 1 只小猪为例,可以测试 5 只桶
+
+- 0-15 小猪吃第一个桶中的液体,如果死去，则第一个桶有毒,否则继续测试
+- 15-30 小猪吃第二个桶中的液体，如果死去，则第二个桶有毒,否则继续测试
+- 30-45 小猪吃第三个桶中的液体，如果死去，则第三个桶有毒,否则继续测试
+- 45-60 小猪吃第四个桶中的液体，如果死去，则第四个桶有毒
+- 如果最后小猪没有死去，则第五个桶有毒
+
+所以一只小猪在 minutesToDie 和 minutesToTest 时间一定的情况下可以最多判断 base = minutesToTest / minutesToDie + 1 个桶
+
+假设小猪的数量是 num,那么 pow(base, num) >= buckets,根据对数运算规则，两边分别取对数得到: num >= Log10(buckets) / Log10(base)
+
+## 代码
+
+```go
+
+package leetcode
+
+import "math"
+
+func poorPigs(buckets int, minutesToDie int, minutesToTest int) int {
+ base := minutesToTest/minutesToDie + 1
+ return int(math.Ceil(math.Log10(float64(buckets)) / math.Log10(float64(base))))
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0400~0499/0457.Circular-Array-Loop/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0400~0499/0460.LFU-Cache/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0400~0499/0460.LFU-Cache.md b/website/content/ChapterFour/0400~0499/0460.LFU-Cache.md
new file mode 100644
index 000000000..5692cc711
--- /dev/null
+++ b/website/content/ChapterFour/0400~0499/0460.LFU-Cache.md
@@ -0,0 +1,149 @@
+# [460. LFU Cache](https://leetcode.com/problems/lfu-cache/)
+
+
+## 题目
+
+Design and implement a data structure for [Least Frequently Used (LFU)](https://en.wikipedia.org/wiki/Least_frequently_used) cache.
+
+Implement the `LFUCache` class:
+
+- `LFUCache(int capacity)` Initializes the object with the `capacity` of the data structure.
+- `int get(int key)` Gets the value of the `key` if the `key` exists in the cache. Otherwise, returns `1`.
+- `void put(int key, int value)` Sets or inserts the value if the `key` is not already present. When the cache reaches its `capacity`, it should invalidate the least frequently used item before inserting a new item. For this problem, when there is a tie (i.e., two or more keys with the same frequency), **the least recently** used `key` would be evicted.
+
+**Notice that** the number of times an item is used is the number of calls to the `get` and `put` functions for that item since it was inserted. This number is set to zero when the item is removed.
+
+**Example 1**:
+
+```
+Input
+["LFUCache", "put", "put", "get", "put", "get", "get", "put", "get", "get", "get"]
+[[2], [1, 1], [2, 2], [1], [3, 3], [2], [3], [4, 4], [1], [3], [4]]
+Output
+[null, null, null, 1, null, -1, 3, null, -1, 3, 4]
+
+Explanation
+LFUCache lfu = new LFUCache(2);
+lfu.put(1, 1);
+lfu.put(2, 2);
+lfu.get(1); // return 1
+lfu.put(3, 3); // evicts key 2
+lfu.get(2); // return -1 (not found)
+lfu.get(3); // return 3
+lfu.put(4, 4); // evicts key 1.
+lfu.get(1); // return -1 (not found)
+lfu.get(3); // return 3
+lfu.get(4); // return 4
+
+```
+
+**Constraints**:
+
+- `0 <= capacity, key, value <= 104`
+- At most `10^5` calls will be made to `get` and `put`.
+
+**Follow up**: Could you do both operations in `O(1)` time complexity?
+
+## 题目大意
+
+请你为 最不经常使用（LFU）缓存算法设计并实现数据结构。
+
+实现 LFUCache 类：
+
+- LFUCache(int capacity) - 用数据结构的容量 capacity 初始化对象
+- int get(int key) - 如果键存在于缓存中，则获取键的值，否则返回 -1。
+- void put(int key, int value) - 如果键已存在，则变更其值；如果键不存在，请插入键值对。当缓存达到其容量时，则应该在插入新项之前，使最不经常使用的项无效。在此问题中，当存在平局（即两个或更多个键具有相同使用频率）时，应该去除 最久未使用 的键。
+
+注意「项的使用次数」就是自插入该项以来对其调用 get 和 put 函数的次数之和。使用次数会在对应项被移除后置为 0 。
+
+进阶：你是否可以在 O(1) 时间复杂度内执行两项操作？
+
+## 解题思路
+
+- 这一题是 LFU 经典面试题，详细解释见第三章模板。
+
+## 代码
+
+```go
+package leetcode
+
+import "container/list"
+
+type LFUCache struct {
+ nodes map[int]*list.Element
+ lists map[int]*list.List
+ capacity int
+ min int
+}
+
+type node struct {
+ key int
+ value int
+ frequency int
+}
+
+func Constructor(capacity int) LFUCache {
+ return LFUCache{nodes: make(map[int]*list.Element),
+ lists: make(map[int]*list.List),
+ capacity: capacity,
+ min: 0,
+ }
+}
+
+func (this *LFUCache) Get(key int) int {
+ value, ok := this.nodes[key]
+ if !ok {
+ return -1
+ }
+ currentNode := value.Value.(*node)
+ this.lists[currentNode.frequency].Remove(value)
+ currentNode.frequency++
+ if _, ok := this.lists[currentNode.frequency]; !ok {
+ this.lists[currentNode.frequency] = list.New()
+ }
+ newList := this.lists[currentNode.frequency]
+ newNode := newList.PushBack(currentNode)
+ this.nodes[key] = newNode
+ if currentNode.frequency-1 == this.min && this.lists[currentNode.frequency-1].Len() == 0 {
+ this.min++
+ }
+ return currentNode.value
+}
+
+func (this *LFUCache) Put(key int, value int) {
+ if this.capacity == 0 {
+ return
+ }
+ if currentValue, ok := this.nodes[key]; ok {
+ currentNode := currentValue.Value.(*node)
+ currentNode.value = value
+ this.Get(key)
+ return
+ }
+ if this.capacity == len(this.nodes) {
+ currentList := this.lists[this.min]
+ frontNode := currentList.Front()
+ delete(this.nodes, frontNode.Value.(*node).key)
+ currentList.Remove(frontNode)
+ }
+ this.min = 1
+ currentNode := &node{
+ key: key,
+ value: value,
+ frequency: 1,
+ }
+ if _, ok := this.lists[1]; !ok {
+ this.lists[1] = list.New()
+ }
+ newList := this.lists[1]
+ newNode := newList.PushBack(currentNode)
+ this.nodes[key] = newNode
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0400~0499/0458.Poor-Pigs/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0400~0499/0461.Hamming-Distance/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0461.Hamming-Distance.md b/website/content/ChapterFour/0400~0499/0461.Hamming-Distance.md
similarity index 76%
rename from website/content/ChapterFour/0461.Hamming-Distance.md
rename to website/content/ChapterFour/0400~0499/0461.Hamming-Distance.md
index 9d0d75c0b..c36e66eb7 100755
--- a/website/content/ChapterFour/0461.Hamming-Distance.md
+++ b/website/content/ChapterFour/0400~0499/0461.Hamming-Distance.md
@@ -50,4 +50,11 @@ func hammingDistance(x int, y int) int {
return distance
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0400~0499/0460.LFU-Cache/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0400~0499/0462.Minimum-Moves-to-Equal-Array-Elements-II/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0400~0499/0462.Minimum-Moves-to-Equal-Array-Elements-II.md b/website/content/ChapterFour/0400~0499/0462.Minimum-Moves-to-Equal-Array-Elements-II.md
new file mode 100644
index 000000000..c43b0bdeb
--- /dev/null
+++ b/website/content/ChapterFour/0400~0499/0462.Minimum-Moves-to-Equal-Array-Elements-II.md
@@ -0,0 +1,73 @@
+# [462. Minimum Moves to Equal Array Elements II](https://leetcode.com/problems/minimum-moves-to-equal-array-elements-ii/)
+
+
+## 题目
+
+Given an integer array `nums` of size `n`, return *the minimum number of moves required to make all array elements equal*.
+
+In one move, you can increment or decrement an element of the array by `1`.
+
+**Example 1:**
+
+```
+Input: nums = [1,2,3]
+Output: 2
+Explanation:
+Only two moves are needed (remember each move increments or decrements one element):
+[1,2,3] => [2,2,3] => [2,2,2]
+```
+
+**Example 2:**
+
+```
+Input: nums = [1,10,2,9]
+Output: 16
+```
+
+**Constraints:**
+
+- `n == nums.length`
+- `1 <= nums.length <= 10^5`
+- `109 <= nums[i] <= 10^9`
+
+## 题目大意
+
+给定一个非空整数数组，找到使所有数组元素相等所需的最小移动数，其中每次移动可将选定的一个元素加 1 或减 1。 您可以假设数组的长度最多为10000。
+
+## 解题思路
+
+- 这题抽象成数学问题是，如果我们把数组 a 中的每个数看成水平轴上的一个点，那么根据上面的移动次数公式，我们需要找到在水平轴上找到一个点 x，使得这 N 个点到 x 的距离之和最小。有 2 个点值得我们考虑，一个是中位数，另外一个是平均值。举个简单的例子，[1,0,0,8,6] 这组数据，中位数是 1，平均值是 3 。分别计算移动的步数，按照中位数对齐是 14，按照平均值对齐是 16 。所以选择中位数。
+- 此题可以用数学证明，证明出，按照平均值移动的步数 ≥ 按照中位数移动的步数。具体证明笔者这里不证明了，感兴趣的同学可以自己证明试试。
+
+## 代码
+
+```go
+package leetcode
+
+import (
+ "math"
+ "sort"
+)
+
+func minMoves2(nums []int) int {
+ if len(nums) == 0 {
+ return 0
+ }
+ moves, mid := 0, len(nums)/2
+ sort.Ints(nums)
+ for i := range nums {
+ if i == mid {
+ continue
+ }
+ moves += int(math.Abs(float64(nums[mid] - nums[i])))
+ }
+ return moves
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0400~0499/0461.Hamming-Distance/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0400~0499/0463.Island-Perimeter/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0463.Island-Perimeter.md b/website/content/ChapterFour/0400~0499/0463.Island-Perimeter.md
similarity index 83%
rename from website/content/ChapterFour/0463.Island-Perimeter.md
rename to website/content/ChapterFour/0400~0499/0463.Island-Perimeter.md
index 7a319887a..3ac220658 100755
--- a/website/content/ChapterFour/0463.Island-Perimeter.md
+++ b/website/content/ChapterFour/0400~0499/0463.Island-Perimeter.md
@@ -68,4 +68,11 @@ func islandPerimeter(grid [][]int) int {
return counter
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0400~0499/0462.Minimum-Moves-to-Equal-Array-Elements-II/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0400~0499/0470.Implement-Rand10-Using-Rand7/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0470.Implement-Rand10-Using-Rand7.md b/website/content/ChapterFour/0400~0499/0470.Implement-Rand10-Using-Rand7.md
similarity index 90%
rename from website/content/ChapterFour/0470.Implement-Rand10-Using-Rand7.md
rename to website/content/ChapterFour/0400~0499/0470.Implement-Rand10-Using-Rand7.md
index 1c650ca33..3e3ac3826 100755
--- a/website/content/ChapterFour/0470.Implement-Rand10-Using-Rand7.md
+++ b/website/content/ChapterFour/0400~0499/0470.Implement-Rand10-Using-Rand7.md
@@ -97,4 +97,11 @@ func rand101() int {
return rand40%10 + 1
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0400~0499/0463.Island-Perimeter/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0400~0499/0473.Matchsticks-to-Square/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0400~0499/0473.Matchsticks-to-Square.md b/website/content/ChapterFour/0400~0499/0473.Matchsticks-to-Square.md
new file mode 100644
index 000000000..5ac15f049
--- /dev/null
+++ b/website/content/ChapterFour/0400~0499/0473.Matchsticks-to-Square.md
@@ -0,0 +1,101 @@
+# [473. Matchsticks to Square](https://leetcode.com/problems/matchsticks-to-square/)
+
+
+## 题目
+
+You are given an integer array `matchsticks` where `matchsticks[i]` is the length of the `ith` matchstick. You want to use **all the matchsticks** to make one square. You **should not break** any stick, but you can link them up, and each matchstick must be used **exactly one time**.
+
+Return `true` if you can make this square and `false` otherwise.
+
+**Example 1:**
+
+
+
+```
+Input: matchsticks = [1,1,2,2,2]
+Output: true
+Explanation: You can form a square with length 2, one side of the square came two sticks with length 1.
+```
+
+**Example 2:**
+
+```
+Input: matchsticks = [3,3,3,3,4]
+Output: false
+Explanation: You cannot find a way to form a square with all the matchsticks.
+```
+
+**Constraints:**
+
+- `1 <= matchsticks.length <= 15`
+- `0 <= matchsticks[i] <= 109`
+
+## 题目大意
+
+现在已知小女孩有多少根火柴，请找出一种能使用所有火柴拼成一个正方形的方法。不能折断火柴，可以把火柴连接起来，并且每根火柴都要用到。输入为小女孩拥有火柴的数目，每根火柴用其长度表示。输出即为是否能用所有的火柴拼成正方形。
+
+## 解题思路
+
+- 将火柴拼成一个正方形，可以将它们分成四组，每一根火柴恰好属于其中的一组；并且每一组火柴的长度之和都相同，等于所有火柴长度之和的四分之一。
+- 考虑暴力解法，使用深度优先搜索枚举出所有的分组情况，并对于每一种情况，判断是否满足上述的两个条件(每根火柴属于其中一组，每组火柴长度之和相同)。依次对每一根火柴进行搜索，当搜索到第 i 根火柴时，可以考虑把它放到四组中的任意一种。对于每一种放置方法，继续对第 i + 1 根火柴进行深搜。当我们搜索完全部的 N 根火柴后，再判断每一组火柴的长度之和是否都相同。
+
+## 代码
+
+```go
+package leetcode
+
+import "sort"
+
+func makesquare(matchsticks []int) bool {
+ if len(matchsticks) < 4 {
+ return false
+ }
+ total := 0
+ for _, v := range matchsticks {
+ total += v
+ }
+ if total%4 != 0 {
+ return false
+ }
+ sort.Slice(matchsticks, func(i, j int) bool {
+ return matchsticks[i] > matchsticks[j]
+ })
+ visited := make([]bool, 16)
+ return dfs(matchsticks, 0, 0, 0, total, &visited)
+}
+
+func dfs(matchsticks []int, cur, group, sum, total int, visited *[]bool) bool {
+ if group == 4 {
+ return true
+ }
+ if sum > total/4 {
+ return false
+ }
+ if sum == total/4 {
+ return dfs(matchsticks, 0, group+1, 0, total, visited)
+ }
+ last := -1
+ for i := cur; i < len(matchsticks); i++ {
+ if (*visited)[i] {
+ continue
+ }
+ if last == matchsticks[i] {
+ continue
+ }
+ (*visited)[i] = true
+ last = matchsticks[i]
+ if dfs(matchsticks, i+1, group, sum+matchsticks[i], total, visited) {
+ return true
+ }
+ (*visited)[i] = false
+ }
+ return false
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0400~0499/0470.Implement-Rand10-Using-Rand7/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0400~0499/0474.Ones-and-Zeroes/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0474.Ones-and-Zeroes.md b/website/content/ChapterFour/0400~0499/0474.Ones-and-Zeroes.md
similarity index 89%
rename from website/content/ChapterFour/0474.Ones-and-Zeroes.md
rename to website/content/ChapterFour/0400~0499/0474.Ones-and-Zeroes.md
index 65e293924..7cd4969c7 100755
--- a/website/content/ChapterFour/0474.Ones-and-Zeroes.md
+++ b/website/content/ChapterFour/0400~0499/0474.Ones-and-Zeroes.md
@@ -75,4 +75,11 @@ func findMaxForm(strs []string, m int, n int) int {
return dp[m][n]
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0400~0499/0473.Matchsticks-to-Square/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0400~0499/0475.Heaters/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0475.Heaters.md b/website/content/ChapterFour/0400~0499/0475.Heaters.md
similarity index 91%
rename from website/content/ChapterFour/0475.Heaters.md
rename to website/content/ChapterFour/0400~0499/0475.Heaters.md
index bbe46ca73..90e81ad35 100755
--- a/website/content/ChapterFour/0475.Heaters.md
+++ b/website/content/ChapterFour/0400~0499/0475.Heaters.md
@@ -119,4 +119,11 @@ func findRadius1(houses []int, heaters []int) int {
return res
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0400~0499/0474.Ones-and-Zeroes/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0400~0499/0476.Number-Complement/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0476.Number-Complement.md b/website/content/ChapterFour/0400~0499/0476.Number-Complement.md
similarity index 82%
rename from website/content/ChapterFour/0476.Number-Complement.md
rename to website/content/ChapterFour/0400~0499/0476.Number-Complement.md
index 1bc61a9e9..41198d109 100755
--- a/website/content/ChapterFour/0476.Number-Complement.md
+++ b/website/content/ChapterFour/0400~0499/0476.Number-Complement.md
@@ -65,4 +65,11 @@ func findComplement1(num int) int {
return (temp - 1) ^ num // temp - 1 即是前面都是 0，num 长度的末尾都是 1 的数，再异或 num 即是最终结果
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0400~0499/0475.Heaters/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0400~0499/0477.Total-Hamming-Distance/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0477.Total-Hamming-Distance.md b/website/content/ChapterFour/0400~0499/0477.Total-Hamming-Distance.md
similarity index 84%
rename from website/content/ChapterFour/0477.Total-Hamming-Distance.md
rename to website/content/ChapterFour/0400~0499/0477.Total-Hamming-Distance.md
index f3e64a051..2ac93c9f7 100755
--- a/website/content/ChapterFour/0477.Total-Hamming-Distance.md
+++ b/website/content/ChapterFour/0400~0499/0477.Total-Hamming-Distance.md
@@ -63,4 +63,11 @@ func totalHammingDistance1(nums []int) int {
return res
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0400~0499/0476.Number-Complement/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0400~0499/0478.Generate-Random-Point-in-a-Circle/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0400~0499/0478.Generate-Random-Point-in-a-Circle.md b/website/content/ChapterFour/0400~0499/0478.Generate-Random-Point-in-a-Circle.md
new file mode 100644
index 000000000..c76e82fb7
--- /dev/null
+++ b/website/content/ChapterFour/0400~0499/0478.Generate-Random-Point-in-a-Circle.md
@@ -0,0 +1,110 @@
+# [478. Generate Random Point in a Circle](https://leetcode.com/problems/generate-random-point-in-a-circle/)
+
+
+## 题目
+
+Given the radius and x-y positions of the center of a circle, write a function `randPoint` which generates a uniform random point in the circle.
+
+Note:
+
+1. input and output values are in [floating-point](https://www.webopedia.com/TERM/F/floating_point_number.html).
+2. radius and x-y position of the center of the circle is passed into the class constructor.
+3. a point on the circumference of the circle is considered to be in the circle.
+4. `randPoint` returns a size 2 array containing x-position and y-position of the random point, in that order.
+
+**Example 1:**
+
+```
+Input:
+["Solution","randPoint","randPoint","randPoint"]
+[[1,0,0],[],[],[]]
+Output: [null,[-0.72939,-0.65505],[-0.78502,-0.28626],[-0.83119,-0.19803]]
+
+```
+
+**Example 2:**
+
+```
+Input:
+["Solution","randPoint","randPoint","randPoint"]
+[[10,5,-7.5],[],[],[]]
+Output: [null,[11.52438,-8.33273],[2.46992,-16.21705],[11.13430,-12.42337]]
+```
+
+**Explanation of Input Syntax:**
+
+The input is two lists: the subroutines called and their arguments. `Solution`'s constructor has three arguments, the radius, x-position of the center, and y-position of the center of the circle. `randPoint` has no arguments. Arguments are always wrapped with a list, even if there aren't any.
+
+## 题目大意
+
+给定圆的半径和圆心的 x、y 坐标，写一个在圆中产生均匀随机点的函数 randPoint 。
+
+说明:
+
+- 输入值和输出值都将是浮点数。
+- 圆的半径和圆心的 x、y 坐标将作为参数传递给类的构造函数。
+- 圆周上的点也认为是在圆中。
+- randPoint 返回一个包含随机点的x坐标和y坐标的大小为2的数组。
+
+## 解题思路
+
+- 随机产生一个圆内的点，这个点一定满足定义 `(x-a)^2+(y-b)^2 ≤ R^2`，其中 `(a,b)` 是圆的圆心坐标，`R` 是半径。
+- 先假设圆心坐标在 (0,0)，这样方便计算，最终输出坐标的时候整体加上圆心的偏移量即可。`rand.Float64()` 产生一个 `[0.0,1.0)` 区间的浮点数。`-R ≤ 2 * R * rand() - R < R`，利用随机产生坐标点的横纵坐标 `(x,y)` 与半径 R 的关系，如果 `x^2 + y^2 ≤ R^2`，那么说明产生的点在圆内。最终输出的时候要记得加上圆心坐标的偏移值。
+
+## 代码
+
+```go
+package leetcode
+
+import (
+ "math"
+ "math/rand"
+ "time"
+)
+
+type Solution struct {
+ r float64
+ x float64
+ y float64
+}
+
+func Constructor(radius float64, x_center float64, y_center float64) Solution {
+ rand.Seed(time.Now().UnixNano())
+ return Solution{radius, x_center, y_center}
+}
+
+func (this *Solution) RandPoint() []float64 {
+ /*
+ a := angle()
+ r := this.r * math.Sqrt(rand.Float64())
+ x := r * math.Cos(a) + this.x
+ y := r * math.Sin(a) + this.y
+ return []float64{x, y}*/
+ for {
+ rx := 2*rand.Float64() - 1.0
+ ry := 2*rand.Float64() - 1.0
+ x := this.r * rx
+ y := this.r * ry
+ if x*x+y*y <= this.r*this.r {
+ return []float64{x + this.x, y + this.y}
+ }
+ }
+}
+
+func angle() float64 {
+ return rand.Float64() * 2 * math.Pi
+}
+
+/**
+ * Your Solution object will be instantiated and called as such:
+ * obj := Constructor(radius, x_center, y_center);
+ * param_1 := obj.RandPoint();
+ */
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0400~0499/0477.Total-Hamming-Distance/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0400~0499/0480.Sliding-Window-Median/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0480.Sliding-Window-Median.md b/website/content/ChapterFour/0400~0499/0480.Sliding-Window-Median.md
similarity index 94%
rename from website/content/ChapterFour/0480.Sliding-Window-Median.md
rename to website/content/ChapterFour/0400~0499/0480.Sliding-Window-Median.md
index 23499f930..01e40d5d3 100755
--- a/website/content/ChapterFour/0480.Sliding-Window-Median.md
+++ b/website/content/ChapterFour/0400~0499/0480.Sliding-Window-Median.md
@@ -273,4 +273,11 @@ func (h *MaxHeapR) Push(x int) { heap.Push(&h.hp, x) }
// Remove define
func (h *MaxHeapR) Remove(x int) { heap.Push(&h.hpDel, x) }
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0400~0499/0478.Generate-Random-Point-in-a-Circle/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0400~0499/0483.Smallest-Good-Base/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0400~0499/0483.Smallest-Good-Base.md b/website/content/ChapterFour/0400~0499/0483.Smallest-Good-Base.md
new file mode 100755
index 000000000..817478cec
--- /dev/null
+++ b/website/content/ChapterFour/0400~0499/0483.Smallest-Good-Base.md
@@ -0,0 +1,136 @@
+# [483. Smallest Good Base](https://leetcode.com/problems/smallest-good-base/)
+
+
+## 题目
+
+For an integer n, we call k>=2 a **good base** of n, if all digits of n base k are 1.
+
+Now given a string representing n, you should return the smallest good base of n in string format.
+
+**Example 1**:
+
+ Input: "13"
+ Output: "3"
+ Explanation: 13 base 3 is 111.
+
+**Example 2**:
+
+ Input: "4681"
+ Output: "8"
+ Explanation: 4681 base 8 is 11111.
+
+**Example 3**:
+
+ Input: "1000000000000000000"
+ Output: "999999999999999999"
+ Explanation: 1000000000000000000 base 999999999999999999 is 11.
+
+**Note**:
+
+1. The range of n is [3, 10^18].
+2. The string representing n is always valid and will not have leading zeros.
+
+
+## 题目大意
+
+
+对于给定的整数 n, 如果n的k（k>=2）进制数的所有数位全为1，则称 k（k>=2）是 n 的一个好进制。
+
+以字符串的形式给出 n, 以字符串的形式返回 n 的最小好进制。
+
+提示：
+
+- n 的取值范围是 [3, 10^18]。
+- 输入总是有效且没有前导 0。
+
+
+
+## 解题思路
+
+
+- 给出一个数 n，要求找一个进制 k，使得数字 n 在 k 进制下每一位都是 1 。求最小的进制 k。
+- 这一题等价于求最小的正整数 k，满足存在一个正整数 m 使得
+
+{{< katex display >}}
+ \sum_{i=0}^{m} k^{i} = \frac{1-k^{m+1}}{1-k} = n
+{{< /katex >}}
+
+
+- 这一题需要确定 k 和 m 两个数的值。m 和 k 是有关系的，确定了一个值，另外一个值也确定了。由
+
+{{< katex display >}}
+ \frac{1-k^{m+1}}{1-k} = n \\
+{{< /katex >}}
+
+
+可得：
+
+{{< katex display >}}
+ m = log_{k}(kn-n+1) - 1 < log_{k}(kn) = 1 + log_{k}n
+{{< /katex >}}
+
+
+根据题意，可以知道 k ≥2，m ≥1 ，所以有:
+
+{{< katex display >}}
+ 1 \leqslant m \leqslant log_{2}n
+{{< /katex >}}
+
+
+所以 m 的取值范围确定了。那么外层循环从 1 到 log n 遍历。找到一个最小的 k ，能满足：
+
+可以用二分搜索来逼近找到最小的 k。先找到 k 的取值范围。由
+
+{{< katex display >}}
+ \frac{1-k^{m+1}}{1-k} = n \\
+{{< /katex >}}
+
+
+可得，
+
+{{< katex display >}}
+ k^{m+1} = nk-n+1 < nk\\ \Rightarrow k < \sqrt[m]{n}
+{{< /katex >}}
+
+
+所以 k 的取值范围是 [2, n*(1/m) ]。再利用二分搜索逼近找到最小的 k 即为答案。
+
+
+## 代码
+
+```go
+
+package leetcode
+
+import (
+ "math"
+ "math/bits"
+ "strconv"
+)
+
+func smallestGoodBase(n string) string {
+ nVal, _ := strconv.Atoi(n)
+ mMax := bits.Len(uint(nVal)) - 1
+ for m := mMax; m > 1; m-- {
+ k := int(math.Pow(float64(nVal), 1/float64(m)))
+ mul, sum := 1, 1
+ for i := 0; i < m; i++ {
+ mul *= k
+ sum += mul
+ }
+ if sum == nVal {
+ return strconv.Itoa(k)
+ }
+ }
+ return strconv.Itoa(nVal - 1)
+}
+
+
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0400~0499/0480.Sliding-Window-Median/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0400~0499/0485.Max-Consecutive-Ones/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0485.Max-Consecutive-Ones.md b/website/content/ChapterFour/0400~0499/0485.Max-Consecutive-Ones.md
similarity index 76%
rename from website/content/ChapterFour/0485.Max-Consecutive-Ones.md
rename to website/content/ChapterFour/0400~0499/0485.Max-Consecutive-Ones.md
index 6bd2c40eb..dce4ba166 100644
--- a/website/content/ChapterFour/0485.Max-Consecutive-Ones.md
+++ b/website/content/ChapterFour/0400~0499/0485.Max-Consecutive-Ones.md
@@ -56,4 +56,11 @@ func findMaxConsecutiveOnes(nums []int) int {
return maxCount
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0400~0499/0483.Smallest-Good-Base/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0400~0499/0488.Zuma-Game/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0400~0499/0488.Zuma-Game.md b/website/content/ChapterFour/0400~0499/0488.Zuma-Game.md
new file mode 100644
index 000000000..3b17baa76
--- /dev/null
+++ b/website/content/ChapterFour/0400~0499/0488.Zuma-Game.md
@@ -0,0 +1,148 @@
+# [488. Zuma Game](https://leetcode.com/problems/zuma-game/)
+
+
+## 题目
+
+You are playing a variation of the game Zuma.
+
+In this variation of Zuma, there is a single row of colored balls on a board, where each ball can be colored red 'R', yellow 'Y', blue 'B', green 'G', or white 'W'. You also have several colored balls in your hand.
+
+Your goal is to clear all of the balls from the board. On each turn:
+
+Pick any ball from your hand and insert it in between two balls in the row or on either end of the row.
+If there is a group of three or more consecutive balls of the same color, remove the group of balls from the board.
+If this removal causes more groups of three or more of the same color to form, then continue removing each group until there are none left.
+If there are no more balls on the board, then you win the game.
+Repeat this process until you either win or do not have any more balls in your hand.
+Given a string board, representing the row of balls on the board, and a string hand, representing the balls in your hand, return the minimum number of balls you have to insert to clear all the balls from the board. If you cannot clear all the balls from the board using the balls in your hand, return -1.
+
+**Example 1**:
+
+```
+Input: board = "WRRBBW", hand = "RB"
+Output: -1
+Explanation: It is impossible to clear all the balls. The best you can do is:
+- Insert 'R' so the board becomes WRRRBBW. WRRRBBW -> WBBW.
+- Insert 'B' so the board becomes WBBBW. WBBBW -> WW.
+There are still balls remaining on the board, and you are out of balls to insert.
+```
+
+**Example 2**:
+```
+Input: board = "WWRRBBWW", hand = "WRBRW"
+Output: 2
+Explanation: To make the board empty:
+- Insert 'R' so the board becomes WWRRRBBWW. WWRRRBBWW -> WWBBWW.
+- Insert 'B' so the board becomes WWBBBWW. WWBBBWW -> WWWW -> empty.
+2 balls from your hand were needed to clear the board.
+```
+
+**Example 3**:
+```
+Input: board = "G", hand = "GGGGG"
+Output: 2
+Explanation: To make the board empty:
+- Insert 'G' so the board becomes GG.
+- Insert 'G' so the board becomes GGG. GGG -> empty.
+2 balls from your hand were needed to clear the board.
+```
+
+**Example 4**:
+```
+Input: board = "RBYYBBRRB", hand = "YRBGB"
+Output: 3
+Explanation: To make the board empty:
+- Insert 'Y' so the board becomes RBYYYBBRRB. RBYYYBBRRB -> RBBBRRB -> RRRB -> B.
+- Insert 'B' so the board becomes BB.
+- Insert 'B' so the board becomes BBB. BBB -> empty.
+3 balls from your hand were needed to clear the board.
+```
+
+**Constraints**:
+
+- 1 <= board.length <= 16
+- 1 <= hand.length <= 5
+- board and hand consist of the characters 'R', 'Y', 'B', 'G', and 'W'.
+- The initial row of balls on the board will not have any groups of three or more consecutive balls of the same color.
+
+## 题目大意
+
+你正在参与祖玛游戏的一个变种。
+
+在这个祖玛游戏变体中，桌面上有 一排 彩球，每个球的颜色可能是：红色 'R'、黄色 'Y'、蓝色 'B'、绿色 'G' 或白色 'W' 。你的手中也有一些彩球。
+
+你的目标是 清空 桌面上所有的球。每一回合：
+
+从你手上的彩球中选出 任意一颗 ，然后将其插入桌面上那一排球中：两球之间或这一排球的任一端。
+接着，如果有出现 三个或者三个以上 且 颜色相同 的球相连的话，就把它们移除掉。
+如果这种移除操作同样导致出现三个或者三个以上且颜色相同的球相连，则可以继续移除这些球，直到不再满足移除条件。
+如果桌面上所有球都被移除，则认为你赢得本场游戏。
+重复这个过程，直到你赢了游戏或者手中没有更多的球。
+给你一个字符串 board ，表示桌面上最开始的那排球。另给你一个字符串 hand ，表示手里的彩球。请你按上述操作步骤移除掉桌上所有球，计算并返回所需的 最少 球数。如果不能移除桌上所有的球，返回 -1 。
+
+## 解题思路
+
+- 使用广度优先搜索和剪枝
+
+## 代码
+
+```go
+
+package leetcode
+
+func findMinStep(board string, hand string) int {
+ q := [][]string{{board, hand}}
+ mp := make(map[string]bool)
+ minStep := 0
+ for len(q) > 0 {
+ length := len(q)
+ minStep++
+ for length > 0 {
+ length--
+ cur := q[0]
+ q = q[1:]
+ curB, curH := cur[0], cur[1]
+ for i := 0; i < len(curB); i++ {
+ for j := 0; j < len(curH); j++ {
+ curB2 := del3(curB[0:i] + string(curH[j]) + curB[i:])
+ curH2 := curH[0:j] + curH[j+1:]
+ if len(curB2) == 0 {
+ return minStep
+ }
+ if _, ok := mp[curB2+curH2]; ok {
+ continue
+ }
+ mp[curB2+curH2] = true
+ q = append(q, []string{curB2, curH2})
+ }
+ }
+ }
+ }
+ return -1
+}
+
+func del3(str string) string {
+ cnt := 1
+ for i := 1; i < len(str); i++ {
+ if str[i] == str[i-1] {
+ cnt++
+ } else {
+ if cnt >= 3 {
+ return del3(str[0:i-cnt] + str[i:])
+ }
+ cnt = 1
+ }
+ }
+ if cnt >= 3 {
+ return str[0 : len(str)-cnt]
+ }
+ return str
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0400~0499/0485.Max-Consecutive-Ones/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0400~0499/0491.Increasing-Subsequences/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0400~0499/0491.Non-decreasing-Subsequences.md b/website/content/ChapterFour/0400~0499/0491.Non-decreasing-Subsequences.md
new file mode 100755
index 000000000..e18e428c3
--- /dev/null
+++ b/website/content/ChapterFour/0400~0499/0491.Non-decreasing-Subsequences.md
@@ -0,0 +1,91 @@
+# [491. Non-decreasing Subsequences](https://leetcode.com/problems/non-decreasing-subsequences/)
+
+
+## 题目
+
+Given an integer array, your task is to find all the different possible increasing subsequences of the given array, and the length of an increasing subsequence should be at least 2.
+
+**Example**:
+
+ Input: [4, 6, 7, 7]
+ Output: [[4, 6], [4, 7], [4, 6, 7], [4, 6, 7, 7], [6, 7], [6, 7, 7], [7,7], [4,7,7]]
+
+**Note**:
+
+1. The length of the given array will not exceed 15.
+2. The range of integer in the given array is [-100,100].
+3. The given array may contain duplicates, and two equal integers should also be considered as a special case of increasing sequence.
+
+
+
+## 题目大意
+
+
+给定一个整型数组, 你的任务是找到所有该数组的递增子序列，递增子序列的长度至少是 2。
+
+说明:
+
+1. 给定数组的长度不会超过15。
+2. 数组中的整数范围是 [-100,100]。
+3. 给定数组中可能包含重复数字，相等的数字应该被视为递增的一种情况。
+
+
+
+
+## 解题思路
+
+
+- 给出一个数组，要求找出这个数组中所有长度大于 2 的非递减子序列。子序列顺序和原数组元素下标必须是顺序的，不能是逆序的。
+- 这一题和第 78 题和第 90 题是类似的题目。第 78 题和第 90 题是求所有子序列，这一题在这两题的基础上增加了非递减和长度大于 2 的条件。需要注意的两点是，原数组中元素可能会重复，最终结果输出的时候需要去重。最终结果输出的去重用 map 处理，数组中重复元素用 DFS 遍历搜索。在每次 DFS 中，用 map 记录遍历过的元素，保证本轮 DFS 中不出现重复的元素，递归到下一层还可以选择值相同，但是下标不同的另外一个元素。外层循环也要加一个 map，这个 map 是过滤每组解因为重复元素导致的重复解，经过过滤以后，起点不同了，最终的解也会不同。
+- 这一题和第 78 题，第 90 题类似，可以一起解答和复习。
+
+
+## 代码
+
+```go
+
+package leetcode
+
+func findSubsequences(nums []int) [][]int {
+ c, visited, res := []int{}, map[int]bool{}, [][]int{}
+ for i := 0; i < len(nums)-1; i++ {
+ if _, ok := visited[nums[i]]; ok {
+ continue
+ } else {
+ visited[nums[i]] = true
+ generateIncSubsets(nums, i, c, &res)
+ }
+ }
+ return res
+}
+
+func generateIncSubsets(nums []int, current int, c []int, res *[][]int) {
+ c = append(c, nums[current])
+ if len(c) >= 2 {
+ b := make([]int, len(c))
+ copy(b, c)
+ *res = append(*res, b)
+ }
+ visited := map[int]bool{}
+ for i := current + 1; i < len(nums); i++ {
+ if nums[current] <= nums[i] {
+ if _, ok := visited[nums[i]]; ok {
+ continue
+ } else {
+ visited[nums[i]] = true
+ generateIncSubsets(nums, i, c, res)
+ }
+ }
+ }
+ c = c[:len(c)-1]
+ return
+}
+
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0400~0499/0488.Zuma-Game/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0400~0499/0492.Construct-the-Rectangle/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0400~0499/0492.Construct-the-Rectangle.md b/website/content/ChapterFour/0400~0499/0492.Construct-the-Rectangle.md
new file mode 100644
index 000000000..5e02ec17e
--- /dev/null
+++ b/website/content/ChapterFour/0400~0499/0492.Construct-the-Rectangle.md
@@ -0,0 +1,79 @@
+# [492. Construct the Rectangle](https://leetcode.com/problems/construct-the-rectangle/)
+
+
+## 题目
+
+A web developer needs to know how to design a web page's size.
+So, given a specific rectangular web page’s area, your job by now is to design a rectangular web page,
+whose length L and width W satisfy the following requirements:
+
+ The area of the rectangular web page you designed must equal to the given target area.
+ The width W should not be larger than the length L, which means L >= W.
+ The difference between length L and width W should be as small as possible.
+ Return an array [L, W] where L and W are the length and width of the web page you designed in sequence.
+
+**Example 1:**
+
+ Input: area = 4
+ Output: [2,2]
+ Explanation: The target area is 4, and all the possible ways to construct it are [1,4], [2,2], [4,1].
+ But according to requirement 2, [1,4] is illegal; according to requirement 3, [4,1] is not optimal compared to [2,2]. So the length L is 2, and the width W is 2.
+
+**Example 2:**
+
+ Input: area = 37
+ Output: [37,1]
+
+**Example 3:**
+
+ Input: area = 122122
+ Output: [427,286]
+
+**Constraints**
+
+ - 1 <= area <= 10000000
+
+## 题目大意
+
+作为一位 web 开发者， 懂得怎样去规划一个页面的尺寸是很重要的。 现给定一个具体的矩形页面面积，你的任务是设计一个长度为 L 和宽度为 W 且满足以下要求的矩形的页面。要求：
+
+1. 你设计的矩形页面必须等于给定的目标面积。
+2. 宽度 W 不应大于长度 L，换言之，要求 L >= W 。
+3. 长度 L 和宽度 W 之间的差距应当尽可能小。
+
+你需要按顺序输出你设计的页面的长度 L 和宽度 W。
+
+## 解题思路
+
+- 令 W 等于根号 area
+- 在 W 大于等于 1 的情况下,判断 area%W 是否等于 0,如果不相等 W 就减 1 继续循环,如果相等就返回 [area/W, W]
+
+## 代码
+
+```go
+
+package leetcode
+
+import "math"
+
+func constructRectangle(area int) []int {
+ ans := make([]int, 2)
+ W := int(math.Sqrt(float64(area)))
+ for W >= 1 {
+ if area%W == 0 {
+ ans[0], ans[1] = area/W, W
+ break
+ }
+ W -= 1
+ }
+ return ans
+}
+
+``
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0400~0499/0491.Increasing-Subsequences/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0400~0499/0493.Reverse-Pairs/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0400~0499/0493.Reverse-Pairs.md b/website/content/ChapterFour/0400~0499/0493.Reverse-Pairs.md
new file mode 100755
index 000000000..0e53ce7d5
--- /dev/null
+++ b/website/content/ChapterFour/0400~0499/0493.Reverse-Pairs.md
@@ -0,0 +1,163 @@
+# [493. Reverse Pairs](https://leetcode.com/problems/reverse-pairs/)
+
+
+## 题目
+
+Given an array `nums`, we call `(i, j)` an **important reverse pair** if `i < j` and `nums[i] > 2*nums[j]`.
+
+You need to return the number of important reverse pairs in the given array.
+
+**Example1**:
+
+ Input: [1,3,2,3,1]
+ Output: 2
+
+**Example2**:
+
+ Input: [2,4,3,5,1]
+ Output: 3
+
+**Note**:
+
+1. The length of the given array will not exceed `50,000`.
+2. All the numbers in the input array are in the range of 32-bit integer.
+
+
+## 题目大意
+
+给定一个数组 nums ，如果 i < j 且 nums[i] > 2\*nums[j] 我们就将 (i, j) 称作一个重要翻转对。你需要返回给定数组中的重要翻转对的数量。
+
+注意:
+
+- 给定数组的长度不会超过 50000。
+- 输入数组中的所有数字都在 32 位整数的表示范围内。
+
+
+## 解题思路
+
+
+- 给出一个数组，要求找出满足条件的所有的“重要的反转对” (i,j)。重要的反转对的定义是：`i<j`，并且 `nums[i] > 2*nums[j]`。
+- 这一题是 327 题的变种题。首先将数组中所有的元素以及各自的 `2*nums[i] + 1` 都放在字典中去重。去重以后再做离散化处理。这一题的测试用例会卡离散化，如果不离散化，Math.MaxInt32 会导致数字溢出，见测试用例中 2147483647, -2147483647 这组测试用例。离散后，映射关系 保存在字典中。从左往右遍历数组，先 query ，再 update ，这个顺序和第 327 题是反的。先 query 查找 `[2*nums[i] + 1, len(indexMap)-1]` 这个区间内满足条件的值，这个区间内的值都是 `> 2*nums[j]` 的。这一题移动的是 `j`，`j` 不断的变化，往线段树中不断插入的是 `i`。每轮循环先 query 一次前一轮循环中累积插入线段树中的 `i`，这些累积在线段树中的代表的是所有在 `j` 前面的 `i`。query 查询的是本轮 `[2*nums[j] + 1, len(indexMap)-1]`，如果能找到，即找到了这样一个 `j`，能满足 `nums[i] > 2*nums[j`， 把整个数组都扫完，累加的 query 出来的 count 计数就是最终答案。
+- 另外一种解法是树状数组。树状数组最擅长解答逆序对的问题。先将原数组中所有的元素值的 2 倍算出来，和原数组合并到一个大数组中。这个大数组中装了所有可能产生 2 倍逆序对的元素值。然后再将他们所有值排序，离散化。离散化以后便将问题集转化成 `[1,N]` 这个区间。于是回到了树状数组经典的求逆序对的问题。逆序插入原数组构造树状数组，或者正序插入原数组构造树状数组都可以解答此题。
+- 类似的题目：第 327 题，第 315 题。
+- 这一题用线段树和树状数组并不是最优解，用线段树和树状数组解这一题是为了训练线段树和树状数组这两个数据结构。最优解是解法一中的 mergesort。
+
+
+## 代码
+
+```go
+
+package leetcode
+
+import (
+ "sort"
+
+ "github.com/halfrost/leetcode-go/template"
+)
+
+// 解法一 归并排序 mergesort，时间复杂度 O(n log n)
+func reversePairs(nums []int) int {
+ buf := make([]int, len(nums))
+ return mergesortCount(nums, buf)
+}
+
+func mergesortCount(nums, buf []int) int {
+ if len(nums) <= 1 {
+ return 0
+ }
+ mid := (len(nums) - 1) / 2
+ cnt := mergesortCount(nums[:mid+1], buf)
+ cnt += mergesortCount(nums[mid+1:], buf)
+ for i, j := 0, mid+1; i < mid+1; i++ { // Note!!! j is increasing.
+ for ; j < len(nums) && nums[i] <= 2*nums[j]; j++ {
+ }
+ cnt += len(nums) - j
+ }
+ copy(buf, nums)
+ for i, j, k := 0, mid+1, 0; k < len(nums); {
+ if j >= len(nums) || i < mid+1 && buf[i] > buf[j] {
+ nums[k] = buf[i]
+ i++
+ } else {
+ nums[k] = buf[j]
+ j++
+ }
+ k++
+ }
+ return cnt
+}
+
+// 解法二 树状数组，时间复杂度 O(n log n)
+func reversePairs1(nums []int) (cnt int) {
+ n := len(nums)
+ if n <= 1 {
+ return
+ }
+ // 离散化所有下面统计时会出现的元素
+ allNums := make([]int, 0, 2*n)
+ for _, v := range nums {
+ allNums = append(allNums, v, 2*v)
+ }
+ sort.Ints(allNums)
+ k := 1
+ kth := map[int]int{allNums[0]: k}
+ for i := 1; i < 2*n; i++ {
+ if allNums[i] != allNums[i-1] {
+ k++
+ kth[allNums[i]] = k
+ }
+ }
+ bit := template.BinaryIndexedTree{}
+ bit.Init(k)
+ for i, v := range nums {
+ cnt += i - bit.Query(kth[2*v])
+ bit.Add(kth[v], 1)
+ }
+ return
+}
+
+// 解法三 线段树，时间复杂度 O(n log n)
+func reversePairs2(nums []int) int {
+ if len(nums) < 2 {
+ return 0
+ }
+ st, numsMap, indexMap, numsArray, res := template.SegmentCountTree{}, make(map[int]int, 0), make(map[int]int, 0), []int{}, 0
+ numsMap[nums[0]] = nums[0]
+ for _, num := range nums {
+ numsMap[num] = num
+ numsMap[2*num+1] = 2*num + 1
+ }
+ // numsArray 是 prefixSum 去重之后的版本，利用 numsMap 去重
+ for _, v := range numsMap {
+ numsArray = append(numsArray, v)
+ }
+ // 排序是为了使得线段树中的区间 left <= right，如果此处不排序，线段树中的区间有很多不合法。
+ sort.Ints(numsArray)
+ // 离散化，构建映射关系
+ for i, n := range numsArray {
+ indexMap[n] = i
+ }
+ numsArray = []int{}
+ // 离散化，此题如果不离散化，MaxInt32 的数据会使得数字越界。
+ for i := 0; i < len(indexMap); i++ {
+ numsArray = append(numsArray, i)
+ }
+ // 初始化线段树，节点内的值都赋值为 0，即计数为 0
+ st.Init(numsArray, func(i, j int) int {
+ return 0
+ })
+ for _, num := range nums {
+ res += st.Query(indexMap[num*2+1], len(indexMap)-1)
+ st.UpdateCount(indexMap[num])
+ }
+ return res
+}
+
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0400~0499/0492.Construct-the-Rectangle/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0400~0499/0494.Target-Sum/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0494.Target-Sum.md b/website/content/ChapterFour/0400~0499/0494.Target-Sum.md
similarity index 81%
rename from website/content/ChapterFour/0494.Target-Sum.md
rename to website/content/ChapterFour/0400~0499/0494.Target-Sum.md
index dd3c2b103..e104ed18a 100644
--- a/website/content/ChapterFour/0494.Target-Sum.md
+++ b/website/content/ChapterFour/0400~0499/0494.Target-Sum.md
@@ -42,7 +42,7 @@ There are 5 ways to assign symbols to make the sum of nums be target 3.
## 解题思路
- 给出一个数组，要求在这个数组里面的每个元素前面加上 + 或者 - 号，最终总和等于 S。问有多少种不同的方法。
-- 这一题可以用 DP 和 DFS 解答。DFS 方法就不比较暴力简单了。见代码。这里分析一下 DP 的做法。题目要求在数组元素前加上 + 或者 - 号，其实相当于把数组分成了 2 组，一组全部都加 + 号，一组都加 - 号。记 + 号的一组 P ，记 - 号的一组 N，那么可以推出以下的关系。
+- 这一题可以用 DP 和 DFS 解答。DFS 方法就比较暴力简单了。见代码。这里分析一下 DP 的做法。题目要求在数组元素前加上 + 或者 - 号，其实相当于把数组分成了 2 组，一组全部都加 + 号，一组都加 - 号。记 + 号的一组 P ，记 - 号的一组 N，那么可以推出以下的关系。
```go
sum(P) - sum(N) = target
@@ -105,4 +105,11 @@ func dfsFindTargetSumWays(nums []int, index int, curSum int, S int, res *int, su
dfsFindTargetSumWays(nums, index+1, curSum-nums[index], S, res, sums)
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0400~0499/0493.Reverse-Pairs/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0400~0499/0495.Teemo-Attacking/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0400~0499/0495.Teemo-Attacking.md b/website/content/ChapterFour/0400~0499/0495.Teemo-Attacking.md
new file mode 100644
index 000000000..b575de2cb
--- /dev/null
+++ b/website/content/ChapterFour/0400~0499/0495.Teemo-Attacking.md
@@ -0,0 +1,92 @@
+# [495. Teemo Attacking](https://leetcode.com/problems/teemo-attacking/)
+
+
+## 题目
+
+Our hero Teemo is attacking an enemy Ashe with poison attacks! When Teemo attacks Ashe, Ashe gets poisoned for a exactly duration seconds.
+
+More formally, an attack at second t will mean Ashe is poisoned during the inclusive time interval [t, t + duration - 1].
+
+If Teemo attacks again before the poison effect ends, the timer for it is reset, and the poison effect will end duration seconds after the new attack.
+
+You are given a non-decreasing integer array timeSeries, where timeSeries[i] denotes that Teemo attacks Ashe at second timeSeries[i], and an integer duration.
+
+Return the total number of seconds that Ashe is poisoned.
+
+**Example 1**:
+```
+Input: timeSeries = [1,4], duration = 2
+Output: 4
+Explanation: Teemo's attacks on Ashe go as follows:
+- At second 1, Teemo attacks, and Ashe is poisoned for seconds 1 and 2.
+- At second 4, Teemo attacks, and Ashe is poisoned for seconds 4 and 5.
+Ashe is poisoned for seconds 1, 2, 4, and 5, which is 4 seconds in total.
+```
+
+**Example 2**:
+```
+Input: timeSeries = [1,2], duration = 2
+Output: 3
+Explanation: Teemo's attacks on Ashe go as follows:
+- At second 1, Teemo attacks, and Ashe is poisoned for seconds 1 and 2.
+- At second 2 however, Teemo attacks again and resets the poison timer. Ashe is poisoned for seconds 2 and 3.
+Ashe is poisoned for seconds 1, 2, and 3, which is 3 seconds in total.
+```
+
+**Constraints**:
+
+- 1 <= timeSeries.length <= 10000
+- 0 <= timeSeries[i], duration <= 10000000
+- timeSeries is sorted in non-decreasing order.
+
+## 题目大意
+
+在《英雄联盟》的世界中，有一个叫 “提莫” 的英雄。他的攻击可以让敌方英雄艾希（编者注：寒冰射手）进入中毒状态。
+
+当提莫攻击艾希，艾希的中毒状态正好持续duration 秒。
+
+正式地讲，提莫在t发起发起攻击意味着艾希在时间区间 [t, t + duration - 1]（含 t 和 t + duration - 1）处于中毒状态。
+
+如果提莫在中毒影响结束前再次攻击，中毒状态计时器将会重置，在新的攻击之后，中毒影响将会在duration秒后结束。
+
+给你一个非递减的整数数组timeSeries，其中timeSeries[i]表示提莫在timeSeries[i]秒时对艾希发起攻击，以及一个表示中毒持续时间的整数duration 。
+
+返回艾希处于中毒状态的总秒数。
+
+## 解题思路
+
+- i 从 1 开始计数，令 t 等于 timeSeries[i - 1]
+- 比较 end(t + duration - 1) 和 timeSeries[i] 的大小，
+ - 如果 end 小于 timeSeries[i],ans+=duration
+ - 否则 ans += timeSeries[i] - t
+- ans += duration 并返回 ans
+
+## 代码
+
+```go
+
+package leetcode
+
+func findPoisonedDuration(timeSeries []int, duration int) int {
+ var ans int
+ for i := 1; i < len(timeSeries); i++ {
+ t := timeSeries[i-1]
+ end := t + duration - 1
+ if end < timeSeries[i] {
+ ans += duration
+ } else {
+ ans += timeSeries[i] - t
+ }
+ }
+ ans += duration
+ return ans
+}
+
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0400~0499/0494.Target-Sum/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0400~0499/0496.Next-Greater-Element-I/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0496.Next-Greater-Element-I.md b/website/content/ChapterFour/0400~0499/0496.Next-Greater-Element-I.md
similarity index 84%
rename from website/content/ChapterFour/0496.Next-Greater-Element-I.md
rename to website/content/ChapterFour/0400~0499/0496.Next-Greater-Element-I.md
index 2a62ef326..1075380ba 100644
--- a/website/content/ChapterFour/0496.Next-Greater-Element-I.md
+++ b/website/content/ChapterFour/0400~0499/0496.Next-Greater-Element-I.md
@@ -77,4 +77,11 @@ func nextGreaterElement(nums1 []int, nums2 []int) []int {
return res
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0400~0499/0495.Teemo-Attacking/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0400~0499/0497.Random-Point-in-Non-overlapping-Rectangles/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0497.Random-Point-in-Non-overlapping-Rectangles.md b/website/content/ChapterFour/0400~0499/0497.Random-Point-in-Non-overlapping-Rectangles.md
similarity index 90%
rename from website/content/ChapterFour/0497.Random-Point-in-Non-overlapping-Rectangles.md
rename to website/content/ChapterFour/0400~0499/0497.Random-Point-in-Non-overlapping-Rectangles.md
index 3c68e0533..6d6fa225c 100755
--- a/website/content/ChapterFour/0497.Random-Point-in-Non-overlapping-Rectangles.md
+++ b/website/content/ChapterFour/0400~0499/0497.Random-Point-in-Non-overlapping-Rectangles.md
@@ -31,7 +31,7 @@ Given a list of **non-overlapping** axis-aligned rectangles `rects`, write a
Output:
[null,[-1,-2],[2,0],[-2,-1],[3,0],[-2,-2]]
-**Explanation of Input Syntax:**
+**Explanation of Input Syntax**:
The input is two lists: the subroutines called and their arguments. `Solution`'s constructor has one argument, the array of rectangles `rects`. `pick` has no arguments. Arguments are always wrapped with a list, even if there aren't any.
@@ -131,4 +131,11 @@ func (so *Solution497) Pick() []int {
* param_1 := obj.Pick();
*/
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0400~0499/0496.Next-Greater-Element-I/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0400~0499/0498.Diagonal-Traverse/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0498.Diagonal-Traverse.md b/website/content/ChapterFour/0400~0499/0498.Diagonal-Traverse.md
similarity index 75%
rename from website/content/ChapterFour/0498.Diagonal-Traverse.md
rename to website/content/ChapterFour/0400~0499/0498.Diagonal-Traverse.md
index f28348a6b..454f91cfe 100755
--- a/website/content/ChapterFour/0498.Diagonal-Traverse.md
+++ b/website/content/ChapterFour/0400~0499/0498.Diagonal-Traverse.md
@@ -37,6 +37,13 @@ The total number of elements of the given matrix will not exceed 10,000.
- 给出一个二维数组，要求按照如图的方式遍历整个数组。
- 这一题用模拟的方式就可以解出来。需要注意的是边界条件：比如二维数组为空，二维数组退化为一行或者一列，退化为一个元素。具体例子见测试用例。
+- 解题关键是在判断下一个位置，将矩阵想像成一个X,Y坐标轴。那么可分为以下几种情况，
+ 1、斜角向右上遍历时，
+ 当右上角在坐标轴内， 正常计算 即， x+1(X轴向右移动)， y-1(Y轴向上移动)
+ 当右上角在坐标轴外，那么当前位置只能在 第一行X坐标轴 ，或者 最后一列Y坐标轴 ， 即判断该两种情况下�应该X坐标往右，或者 Y坐标往上
+ 2、同理 斜角向下遍历时
+ 当左下角在坐标轴内，正常计算 即， x-1(X轴向右移动)， y+1(Y轴向下移动)
+ 当左下角在坐标轴外，那么当前位置只能在 第一列Y坐标轴，或者 最后一行X坐标轴， 即判断该两种情况下�应该X坐标往左，或者 Y坐标往下
## 代码
@@ -181,4 +188,11 @@ func addTraverse(matrix [][]int, i, j int, res *[]int) {
}
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0400~0499/0497.Random-Point-in-Non-overlapping-Rectangles/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0500~0599/0500.Keyboard-Row/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0400~0499/_index.md b/website/content/ChapterFour/0400~0499/_index.md
new file mode 100644
index 000000000..d2021683f
--- /dev/null
+++ b/website/content/ChapterFour/0400~0499/_index.md
@@ -0,0 +1,5 @@
+---
+bookCollapseSection: true
+weight: 20
+---
+
diff --git a/website/content/ChapterFour/0401.Binary-Watch.md b/website/content/ChapterFour/0401.Binary-Watch.md
deleted file mode 100755
index 0d40d6f2e..000000000
--- a/website/content/ChapterFour/0401.Binary-Watch.md
+++ /dev/null
@@ -1,138 +0,0 @@
-# [401. Binary Watch](https://leetcode.com/problems/binary-watch/)
-
-
-## 题目
-
-A binary watch has 4 LEDs on the top which represent the **hours** (**0-11**), and the 6 LEDs on the bottom represent the **minutes** (**0-59**).
-
-Each LED represents a zero or one, with the least significant bit on the right.
-
-
-
-For example, the above binary watch reads "3:25".
-
-Given a non-negative integer n which represents the number of LEDs that are currently on, return all possible times the watch could represent.
-
-**Example**:
-
- Input: n = 1
- Return: ["1:00", "2:00", "4:00", "8:00", "0:01", "0:02", "0:04", "0:08", "0:16", "0:32"]
-
-**Note**:
-
-- The order of output does not matter.
-- The hour must not contain a leading zero, for example "01:00" is not valid, it should be "1:00".
-- The minute must be consist of two digits and may contain a leading zero, for example "10:2" is not valid, it should be "10:02".
-
-
-## 题目大意
-
-二进制手表顶部有 4 个 LED 代表小时（0-11），底部的 6 个 LED 代表分钟（0-59）。每个 LED 代表一个 0 或 1，最低位在右侧。
-
-给定一个非负整数 n 代表当前 LED 亮着的数量，返回二进制表所有可能的时间。
-
-
-## 解题思路
-
-
-- 给出数字 n，要求输出二进制表中所有可能的时间
-- 题目中比较坑的是，分钟大于 60 的都不应该打印出来，小时大于 12 的也不应该打印出来，因为是非法的。给出的 num 大于 8 的也是非法值，最终结果应该输出空字符串数组。
-- 这道题的数据量不大，可以直接用打表法，具体打表函数见 `findReadBinaryWatchMinute()` 和 `findReadBinaryWatchHour()` 这两个函数。
-
-
-## 代码
-
-```go
-
-package leetcode
-
-import (
- "fmt"
- "strconv"
-)
-
-var (
- hour = []string{"1", "2", "4", "8"}
- minute = []string{"01", "02", "04", "08", "16", "32"}
- hourMap = map[int][]string{
- 0: []string{"0"},
- 1: []string{"1", "2", "4", "8"},
- 2: []string{"3", "5", "9", "6", "10"},
- 3: []string{"7", "11"},
- }
- minuteMap = map[int][]string{
- 0: []string{"00"},
- 1: []string{"01", "02", "04", "08", "16", "32"},
- 2: []string{"03", "05", "09", "17", "33", "06", "10", "18", "34", "12", "20", "36", "24", "40", "48"},
- 3: []string{"07", "11", "19", "35", "13", "21", "37", "25", "41", "49", "14", "22", "38", "26", "42", "50", "28", "44", "52", "56"},
- 4: []string{"15", "23", "39", "27", "43", "51", "29", "45", "53", "57", "30", "46", "54", "58"},
- 5: []string{"31", "47", "55", "59"},
- }
-)
-
-func readBinaryWatch(num int) []string {
- if num > 8 {
- return []string{}
- }
- res := []string{}
- for i := 0; i <= num; i++ {
- for j := 0; j < len(hourMap[i]); j++ {
- for k := 0; k < len(minuteMap[num-i]); k++ {
- res = append(res, hourMap[i][j]+":"+minuteMap[num-i][k])
- }
- }
- }
- return res
-}
-
-/// ---------------------------------------
-/// ---------------------------------------
-/// ---------------------------------------
-/// ---------------------------------------
-/// ---------------------------------------
-// 以下是打表用到的函数
-// 调用 findReadBinaryWatchMinute(num, 0, c, &res) 打表
-func findReadBinaryWatchMinute(target, index int, c []int, res *[]string) {
- if target == 0 {
- str, tmp := "", 0
- for i := 0; i < len(c); i++ {
- t, _ := strconv.Atoi(minute[c[i]])
- tmp += t
- }
- if tmp < 10 {
- str = "0" + strconv.Itoa(tmp)
- } else {
- str = strconv.Itoa(tmp)
- }
- // fmt.Printf("找到解了 c = %v str = %v\n", c, str)
- fmt.Printf("\"%v\", ", str)
- return
- }
- for i := index; i < 6; i++ {
- c = append(c, i)
- findReadBinaryWatchMinute(target-1, i+1, c, res)
- c = c[:len(c)-1]
- }
-}
-
-// 调用 findReadBinaryWatchHour(num, 0, c, &res) 打表
-func findReadBinaryWatchHour(target, index int, c []int, res *[]string) {
- if target == 0 {
- str, tmp := "", 0
- for i := 0; i < len(c); i++ {
- t, _ := strconv.Atoi(hour[c[i]])
- tmp += t
- }
- str = strconv.Itoa(tmp)
- //fmt.Printf("找到解了 c = %v str = %v\n", c, str)
- fmt.Printf("\"%v\", ", str)
- return
- }
- for i := index; i < 4; i++ {
- c = append(c, i)
- findReadBinaryWatchHour(target-1, i+1, c, res)
- c = c[:len(c)-1]
- }
-}
-
-```
\ No newline at end of file
diff --git a/website/content/ChapterFour/0404.Sum-of-Left-Leaves.md b/website/content/ChapterFour/0404.Sum-of-Left-Leaves.md
deleted file mode 100755
index c2103dbef..000000000
--- a/website/content/ChapterFour/0404.Sum-of-Left-Leaves.md
+++ /dev/null
@@ -1,55 +0,0 @@
-# [404. Sum of Left Leaves](https://leetcode.com/problems/sum-of-left-leaves/)
-
-
-## 题目
-
-Find the sum of all left leaves in a given binary tree.
-
-**Example**:
-
- 3
- / \
- 9 20
- / \
- 15 7
-
- There are two left leaves in the binary tree, with values 9 and 15 respectively. Return 24.
-
-
-## 题目大意
-
-计算给定二叉树的所有左叶子之和。
-
-
-## 解题思路
-
-
-- 这一题是微软的面试题。递归求解即可
-
-
-
-## 代码
-
-```go
-
-package leetcode
-
-/**
- * Definition for a binary tree node.
- * type TreeNode struct {
- * Val int
- * Left *TreeNode
- * Right *TreeNode
- * }
- */
-func sumOfLeftLeaves(root *TreeNode) int {
- if root == nil {
- return 0
- }
- if root.Left != nil && root.Left.Left == nil && root.Left.Right == nil {
- return root.Left.Val + sumOfLeftLeaves(root.Right)
- }
- return sumOfLeftLeaves(root.Left) + sumOfLeftLeaves(root.Right)
-}
-
-```
\ No newline at end of file
diff --git a/website/content/ChapterFour/0412.Fizz-Buzz.md b/website/content/ChapterFour/0412.Fizz-Buzz.md
deleted file mode 100644
index cf9fdd906..000000000
--- a/website/content/ChapterFour/0412.Fizz-Buzz.md
+++ /dev/null
@@ -1,71 +0,0 @@
-# [412. Fizz Buzz](https://leetcode.com/problems/fizz-buzz/)
-
-## 题目
-
-Write a program that outputs the string representation of numbers from 1 to n.
-
-But for multiples of three it should output “Fizz” instead of the number and for the multiples of five output “Buzz”. For numbers which are multiples of both three and five output “FizzBuzz”.
-
-**Example**:
-
-```
-n = 15,
-
-Return:
-[
- "1",
- "2",
- "Fizz",
- "4",
- "Buzz",
- "Fizz",
- "7",
- "8",
- "Fizz",
- "Buzz",
- "11",
- "Fizz",
- "13",
- "14",
- "FizzBuzz"
-]
-
-```
-
-## 题目大意
-
-3的倍数输出 "Fizz"，5的倍数输出 "Buzz"，15的倍数输出 "FizzBuzz"，其他时候都输出原本的数字。
-
-
-## 解题思路
-
-按照题意做即可。
-
-## 代码
-
-```go
-
-package leetcode
-
-import "strconv"
-
-func fizzBuzz(n int) []string {
- if n < 0 {
- return []string{}
- }
- solution := make([]string, n)
- for i := 1; i <= n; i++ {
- if i%3 == 0 && i%5 == 0 {
- solution[i-1] = "FizzBuzz"
- } else if i%3 == 0 {
- solution[i-1] = "Fizz"
- } else if i%5 == 0 {
- solution[i-1] = "Buzz"
- } else {
- solution[i-1] = strconv.Itoa(i)
- }
- }
- return solution
-}
-
-```
\ No newline at end of file
diff --git a/website/content/ChapterFour/0437.Path-Sum-III.md b/website/content/ChapterFour/0437.Path-Sum-III.md
deleted file mode 100755
index 8b9811d5c..000000000
--- a/website/content/ChapterFour/0437.Path-Sum-III.md
+++ /dev/null
@@ -1,85 +0,0 @@
-# [437. Path Sum III](https://leetcode.com/problems/path-sum-iii/)
-
-
-## 题目
-
-You are given a binary tree in which each node contains an integer value.
-
-Find the number of paths that sum to a given value.
-
-The path does not need to start or end at the root or a leaf, but it must go downwards (traveling only from parent nodes to child nodes).
-
-The tree has no more than 1,000 nodes and the values are in the range -1,000,000 to 1,000,000.
-
-**Example**:
-
- root = [10,5,-3,3,2,null,11,3,-2,null,1], sum = 8
-
- 10
- / \
- 5 -3
- / \ \
- 3 2 11
- / \ \
- 3 -2 1
-
- Return 3. The paths that sum to 8 are:
-
- 1. 5 -> 3
- 2. 5 -> 2 -> 1
- 3. -3 -> 11
-
-
-## 题目大意
-
-给定一个二叉树，它的每个结点都存放着一个整数值。找出路径和等于给定数值的路径总数。路径不需要从根节点开始，也不需要在叶子节点结束，但是路径方向必须是向下的（只能从父节点到子节点）。二叉树不超过1000个节点，且节点数值范围是 [-1000000,1000000] 的整数。
-
-
-## 解题思路
-
-
-- 这一题是第 112 题 Path Sum 和第 113 题 Path Sum II 的加强版，这一题要求求出任意一条路径的和为 sum，起点不一定是根节点，可以是任意节点开始。
-- 注意这一题可能出现负数的情况，节点和为 sum，并不一定是最终情况，有可能下面还有正数节点和负数节点相加正好为 0，那么这也是一种情况。一定要遍历到底。
-- 一个点是否为 sum 的起点，有 3 种情况，第一种情况路径包含该 root 节点，如果包含该结点，就在它的左子树和右子树中寻找和为 `sum-root.Val` 的情况。第二种情况路径不包含该 root 节点，那么就需要在它的左子树和右子树中分别寻找和为 sum 的结点。
-
-
-
-## 代码
-
-```go
-
-package leetcode
-
-/**
- * Definition for a binary tree node.
- * type TreeNode struct {
- * Val int
- * Left *TreeNode
- * Right *TreeNode
- * }
- */
-func pathSumIII(root *TreeNode, sum int) int {
- if root == nil {
- return 0
- }
- res := findPath437(root, sum)
- res += pathSumIII(root.Left, sum)
- res += pathSumIII(root.Right, sum)
- return res
-}
-
-// 寻找包含 root 这个结点，且和为 sum 的路径
-func findPath437(root *TreeNode, sum int) int {
- if root == nil {
- return 0
- }
- res := 0
- if root.Val == sum {
- res++
- }
- res += findPath437(root.Left, sum-root.Val)
- res += findPath437(root.Right, sum-root.Val)
- return res
-}
-
-```
\ No newline at end of file
diff --git a/website/content/ChapterFour/0445.Add-Two-Numbers-II.md b/website/content/ChapterFour/0445.Add-Two-Numbers-II.md
deleted file mode 100644
index 19c3a5769..000000000
--- a/website/content/ChapterFour/0445.Add-Two-Numbers-II.md
+++ /dev/null
@@ -1,96 +0,0 @@
-# [445. Add Two Numbers II](https://leetcode.com/problems/add-two-numbers-ii/)
-
-## 题目
-
-You are given two non-empty linked lists representing two non-negative integers. The most significant digit comes first and each of their nodes contain a single digit. Add the two numbers and return it as a linked list.
-
-You may assume the two numbers do not contain any leading zero, except the number 0 itself.
-
-**Follow up**:
-What if you cannot modify the input lists? In other words, reversing the lists is not allowed.
-
-**Example**:
-
-```
-
-Input: (7 -> 2 -> 4 -> 3) + (5 -> 6 -> 4)
-Output: 7 -> 8 -> 0 -> 7
-
-```
-
-## 题目大意
-
-这道题是第 2 题的变种题，第 2 题中的 2 个数是从个位逆序排到高位，这样相加只用从头交到尾，进位一直进位即可。这道题目中强制要求不能把链表逆序。2 个数字是从高位排到低位的，这样进位是倒着来的。
-
-## 解题思路
-
-思路也不难，加法只用把短的链表依次加到长的链表上面来就可以了，最终判断一下最高位有没有进位，有进位再往前进一位。加法的过程可以用到递归。
-
-## 代码
-
-```go
-
-package leetcode
-
-/**
- * Definition for singly-linked list.
- * type ListNode struct {
- * Val int
- * Next *ListNode
- * }
- */
-func addTwoNumbers445(l1 *ListNode, l2 *ListNode) *ListNode {
- if l1 == nil {
- return l2
- }
- if l2 == nil {
- return l1
- }
- l1Length := getLength(l1)
- l2Length := getLength(l2)
- newHeader := &ListNode{Val: 1, Next: nil}
- if l1Length < l2Length {
- newHeader.Next = addNode(l2, l1, l2Length-l1Length)
- } else {
- newHeader.Next = addNode(l1, l2, l1Length-l2Length)
- }
- if newHeader.Next.Val > 9 {
- newHeader.Next.Val = newHeader.Next.Val % 10
- return newHeader
- }
- return newHeader.Next
-}
-
-func addNode(l1 *ListNode, l2 *ListNode, offset int) *ListNode {
- if l1 == nil {
- return nil
- }
- var (
- res, node *ListNode
- )
- if offset == 0 {
- res = &ListNode{Val: l1.Val + l2.Val, Next: nil}
- node = addNode(l1.Next, l2.Next, 0)
- } else {
- res = &ListNode{Val: l1.Val, Next: nil}
- node = addNode(l1.Next, l2, offset-1)
- }
- if node != nil && node.Val > 9 {
- res.Val++
- node.Val = node.Val % 10
- }
- res.Next = node
- return res
-}
-
-func getLength(l *ListNode) int {
- count := 0
- cur := l
- for cur != nil {
- count++
- cur = cur.Next
- }
- return count
-}
-
-```
\ No newline at end of file
diff --git a/website/content/ChapterFour/0483.Smallest-Good-Base.md b/website/content/ChapterFour/0483.Smallest-Good-Base.md
deleted file mode 100755
index 117d95c41..000000000
--- a/website/content/ChapterFour/0483.Smallest-Good-Base.md
+++ /dev/null
@@ -1,138 +0,0 @@
-# [483. Smallest Good Base](https://leetcode.com/problems/smallest-good-base/)
-
-
-## 题目
-
-For an integer n, we call k>=2 a **good base** of n, if all digits of n base k are 1.
-
-Now given a string representing n, you should return the smallest good base of n in string format.
-
-**Example 1**:
-
- Input: "13"
- Output: "3"
- Explanation: 13 base 3 is 111.
-
-**Example 2**:
-
- Input: "4681"
- Output: "8"
- Explanation: 4681 base 8 is 11111.
-
-**Example 3**:
-
- Input: "1000000000000000000"
- Output: "999999999999999999"
- Explanation: 1000000000000000000 base 999999999999999999 is 11.
-
-**Note**:
-
-1. The range of n is [3, 10^18].
-2. The string representing n is always valid and will not have leading zeros.
-
-
-## 题目大意
-
-
-对于给定的整数 n, 如果n的k（k>=2）进制数的所有数位全为1，则称 k（k>=2）是 n 的一个好进制。
-
-以字符串的形式给出 n, 以字符串的形式返回 n 的最小好进制。
-
-提示：
-
-- n 的取值范围是 [3, 10^18]。
-- 输入总是有效且没有前导 0。
-
-
-
-## 解题思路
-
-
-- 给出一个数 n，要求找一个进制 k，使得数字 n 在 k 进制下每一位都是 1 。求最小的进制 k。
-- 这一题等价于求最小的正整数 k，满足存在一个正整数 m 使得
-
-<p align='center'>
-<img src='https://img.halfrost.com/Leetcode/leetcode_483_1.png'>
-</p>
-
-
-- 这一题需要确定 k 和 m 两个数的值。m 和 k 是有关系的，确定了一个值，另外一个值也确定了。由
-
-<p align='center'>
-<img src='https://img.halfrost.com/Leetcode/leetcode_483_2.png'>
-</p>
-
-
-可得：
-
-<p align='center'>
-<img src='https://img.halfrost.com/Leetcode/leetcode_483_3.png'>
-</p>
-
-
-根据题意，可以知道 k ≥2，m ≥1 ，所以有:
-
-<p align='center'>
-<img src='https://img.halfrost.com/Leetcode/leetcode_483_4.png'>
-</p>
-
-
-所以 m 的取值范围确定了。那么外层循环从 1 到 log n 遍历。找到一个最小的 k ，能满足：
-
-可以用二分搜索来逼近找到最小的 k。先找到 k 的取值范围。由
-
-<p align='center'>
-<img src='https://img.halfrost.com/Leetcode/leetcode_483_5.png'>
-</p>
-
-
-可得，
-
-<p align='center'>
-<img src='https://img.halfrost.com/Leetcode/leetcode_483_6.png'>
-</p>
-
-所以 k 的取值范围是 [2, n*(1/m) ]。再利用二分搜索逼近找到最小的 k 即为答案。
-
-
-## 代码
-
-```go
-
-package leetcode
-
-import (
- "math"
- "strconv"
-)
-
-func smallestGoodBase(n string) string {
- num, _ := strconv.ParseUint(n, 10, 64)
- for bit := uint64(math.Log2(float64(num))); bit >= 1; bit-- {
- low, high := uint64(2), uint64(math.Pow(float64(num), 1.0/float64(bit)))
- for low < high {
- mid := uint64(low + (high-low)>>1)
- sum := findBase(mid, bit)
- if sum == num {
- return strconv.FormatUint(mid, 10)
- } else if sum > num {
- high = mid - 1
- } else {
- low = mid + 1
- }
- }
- }
- return strconv.FormatUint(num-1, 10)
-}
-
-// 计算 k^m + k^(m-1) + ... + k + 1
-func findBase(mid, bit uint64) uint64 {
- sum, base := uint64(1), uint64(1)
- for i := uint64(1); i <= bit; i++ {
- base *= mid
- sum += base
- }
- return sum
-}
-
-```
\ No newline at end of file
diff --git a/website/content/ChapterFour/0491.Increasing-Subsequences.md b/website/content/ChapterFour/0491.Increasing-Subsequences.md
deleted file mode 100755
index 9a262bb73..000000000
--- a/website/content/ChapterFour/0491.Increasing-Subsequences.md
+++ /dev/null
@@ -1,84 +0,0 @@
-# [491. Increasing Subsequences](https://leetcode.com/problems/increasing-subsequences/)
-
-
-## 题目
-
-Given an integer array, your task is to find all the different possible increasing subsequences of the given array, and the length of an increasing subsequence should be at least 2.
-
-**Example**:
-
- Input: [4, 6, 7, 7]
- Output: [[4, 6], [4, 7], [4, 6, 7], [4, 6, 7, 7], [6, 7], [6, 7, 7], [7,7], [4,7,7]]
-
-**Note**:
-
-1. The length of the given array will not exceed 15.
-2. The range of integer in the given array is [-100,100].
-3. The given array may contain duplicates, and two equal integers should also be considered as a special case of increasing sequence.
-
-
-
-## 题目大意
-
-
-给定一个整型数组, 你的任务是找到所有该数组的递增子序列，递增子序列的长度至少是 2。
-
-说明:
-
-1. 给定数组的长度不会超过15。
-2. 数组中的整数范围是 [-100,100]。
-3. 给定数组中可能包含重复数字，相等的数字应该被视为递增的一种情况。
-
-
-
-
-## 解题思路
-
-
-- 给出一个数组，要求找出这个数组中所有长度大于 2 的非递减子序列。子序列顺序和原数组元素下标必须是顺序的，不能是逆序的。
-- 这一题和第 78 题和第 90 题是类似的题目。第 78 题和第 90 题是求所有子序列，这一题在这两题的基础上增加了非递减和长度大于 2 的条件。需要注意的两点是，原数组中元素可能会重复，最终结果输出的时候需要去重。最终结果输出的去重用 map 处理，数组中重复元素用 DFS 遍历搜索。在每次 DFS 中，用 map 记录遍历过的元素，保证本轮 DFS 中不出现重复的元素，递归到下一层还可以选择值相同，但是下标不同的另外一个元素。外层循环也要加一个 map，这个 map 是过滤每组解因为重复元素导致的重复解，经过过滤以后，起点不同了，最终的解也会不同。
-- 这一题和第 78 题，第 90 题类似，可以一起解答和复习。
-
-
-## 代码
-
-```go
-
-package leetcode
-
-func findSubsequences(nums []int) [][]int {
- c, visited, res := []int{}, map[int]bool{}, [][]int{}
- for i := 0; i < len(nums)-1; i++ {
- if _, ok := visited[nums[i]]; ok {
- continue
- } else {
- visited[nums[i]] = true
- generateIncSubsets(nums, i, c, &res)
- }
- }
- return res
-}
-
-func generateIncSubsets(nums []int, current int, c []int, res *[][]int) {
- c = append(c, nums[current])
- if len(c) >= 2 {
- b := make([]int, len(c))
- copy(b, c)
- *res = append(*res, b)
- }
- visited := map[int]bool{}
- for i := current + 1; i < len(nums); i++ {
- if nums[current] <= nums[i] {
- if _, ok := visited[nums[i]]; ok {
- continue
- } else {
- visited[nums[i]] = true
- generateIncSubsets(nums, i, c, res)
- }
- }
- }
- c = c[:len(c)-1]
- return
-}
-
-```
\ No newline at end of file
diff --git a/website/content/ChapterFour/0493.Reverse-Pairs.md b/website/content/ChapterFour/0493.Reverse-Pairs.md
deleted file mode 100755
index 6335db07b..000000000
--- a/website/content/ChapterFour/0493.Reverse-Pairs.md
+++ /dev/null
@@ -1,126 +0,0 @@
-# [493. Reverse Pairs](https://leetcode.com/problems/reverse-pairs/)
-
-
-## 题目
-
-Given an array `nums`, we call `(i, j)` an **important reverse pair** if `i < j` and `nums[i] > 2*nums[j]`.
-
-You need to return the number of important reverse pairs in the given array.
-
-**Example1:**
-
- Input: [1,3,2,3,1]
- Output: 2
-
-**Example2:**
-
- Input: [2,4,3,5,1]
- Output: 3
-
-**Note**:
-
-1. The length of the given array will not exceed `50,000`.
-2. All the numbers in the input array are in the range of 32-bit integer.
-
-
-## 题目大意
-
-给定一个数组 nums ，如果 i < j 且 nums[i] > 2\*nums[j] 我们就将 (i, j) 称作一个重要翻转对。你需要返回给定数组中的重要翻转对的数量。
-
-注意:
-
-- 给定数组的长度不会超过 50000。
-- 输入数组中的所有数字都在 32 位整数的表示范围内。
-
-
-## 解题思路
-
-
-- 给出一个数组，要求找出满足条件的所有的“重要的反转对” (i,j)。重要的反转对的定义是：`i<j`，并且 `nums[i] > 2*nums[j]`。
-- 这一题是 327 题的变种题。首先将数组中所有的元素以及各自的 `2*nums[i] + 1` 都放在字典中去重。去重以后再做离散化处理。这一题的测试用例会卡离散化，如果不离散化，Math.MaxInt32 会导致数字溢出，见测试用例中 2147483647, -2147483647 这组测试用例。离散后，映射关系 保存在字典中。从左往右遍历数组，先 query ，再 update ，这个顺序和第 327 题是反的。先 query 查找 `[2*nums[i] + 1, len(indexMap)-1]` 这个区间内满足条件的值，这个区间内的值都是 `> 2*nums[j]` 的。这一题移动的是 `j`，`j` 不断的变化，往线段树中不断插入的是 `i`。每轮循环先 query 一次前一轮循环中累积插入线段树中的 `i`，这些累积在线段树中的代表的是所有在 `j` 前面的 `i`。query 查询的是本轮 `[2*nums[j] + 1, len(indexMap)-1]`，如果能找到，即找到了这样一个 `j`，能满足 `nums[i] > 2*nums[j`， 把整个数组都扫完，累加的 query 出来的 count 计数就是最终答案。
-- 类似的题目：第 327 题，第 315 题。
-- 这一题用线段树并不是最优解，用线段树解这一题是为了训练线段树这个数据结构。最优解是解法二中的 mergesort。
-
-
-## 代码
-
-```go
-
-package leetcode
-
-import (
- "sort"
-
- "github.com/halfrost/LeetCode-Go/template"
-)
-
-// 解法一 线段树，时间复杂度 O(n log n)
-func reversePairs(nums []int) int {
- if len(nums) < 2 {
- return 0
- }
- st, numsMap, indexMap, numsArray, res := template.SegmentCountTree{}, make(map[int]int, 0), make(map[int]int, 0), []int{}, 0
- numsMap[nums[0]] = nums[0]
- for _, num := range nums {
- numsMap[num] = num
- numsMap[2*num+1] = 2*num + 1
- }
- // numsArray 是 prefixSum 去重之后的版本，利用 numsMap 去重
- for _, v := range numsMap {
- numsArray = append(numsArray, v)
- }
- // 排序是为了使得线段树中的区间 left <= right，如果此处不排序，线段树中的区间有很多不合法。
- sort.Ints(numsArray)
- // 离散化，构建映射关系
- for i, n := range numsArray {
- indexMap[n] = i
- }
- numsArray = []int{}
- // 离散化，此题如果不离散化，MaxInt32 的数据会使得数字越界。
- for i := 0; i < len(indexMap); i++ {
- numsArray = append(numsArray, i)
- }
- // 初始化线段树，节点内的值都赋值为 0，即计数为 0
- st.Init(numsArray, func(i, j int) int {
- return 0
- })
- for _, num := range nums {
- res += st.Query(indexMap[num*2+1], len(indexMap)-1)
- st.UpdateCount(indexMap[num])
- }
- return res
-}
-
-// 解法二 mergesort
-func reversePairs1(nums []int) int {
- buf := make([]int, len(nums))
- return mergesortCount(nums, buf)
-}
-
-func mergesortCount(nums, buf []int) int {
- if len(nums) <= 1 {
- return 0
- }
- mid := (len(nums) - 1) / 2
- cnt := mergesortCount(nums[:mid+1], buf)
- cnt += mergesortCount(nums[mid+1:], buf)
- for i, j := 0, mid+1; i < mid+1; i++ { // Note!!! j is increasing.
- for ; j < len(nums) && nums[i] <= 2*nums[j]; j++ {
- }
- cnt += len(nums) - j
- }
- copy(buf, nums)
- for i, j, k := 0, mid+1, 0; k < len(nums); {
- if j >= len(nums) || i < mid+1 && buf[i] > buf[j] {
- nums[k] = buf[i]
- i++
- } else {
- nums[k] = buf[j]
- j++
- }
- k++
- }
- return cnt
-}
-
-```
\ No newline at end of file
diff --git a/website/content/ChapterFour/0500.Keyboard-Row.md b/website/content/ChapterFour/0500~0599/0500.Keyboard-Row.md
similarity index 78%
rename from website/content/ChapterFour/0500.Keyboard-Row.md
rename to website/content/ChapterFour/0500~0599/0500.Keyboard-Row.md
index 6d6eda08f..9771d2e2c 100755
--- a/website/content/ChapterFour/0500.Keyboard-Row.md
+++ b/website/content/ChapterFour/0500~0599/0500.Keyboard-Row.md
@@ -59,4 +59,11 @@ func findWords500(words []string) []string {
return output
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0400~0499/0498.Diagonal-Traverse/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0500~0599/0503.Next-Greater-Element-II/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0503.Next-Greater-Element-II.md b/website/content/ChapterFour/0500~0599/0503.Next-Greater-Element-II.md
similarity index 85%
rename from website/content/ChapterFour/0503.Next-Greater-Element-II.md
rename to website/content/ChapterFour/0500~0599/0503.Next-Greater-Element-II.md
index a8d5f46c9..69675aa8d 100644
--- a/website/content/ChapterFour/0503.Next-Greater-Element-II.md
+++ b/website/content/ChapterFour/0500~0599/0503.Next-Greater-Element-II.md
@@ -75,4 +75,11 @@ func nextGreaterElements1(nums []int) []int {
return res
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0500~0599/0500.Keyboard-Row/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0500~0599/0504.Base-7/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0500~0599/0504.Base-7.md b/website/content/ChapterFour/0500~0599/0504.Base-7.md
new file mode 100644
index 000000000..30b82e50e
--- /dev/null
+++ b/website/content/ChapterFour/0500~0599/0504.Base-7.md
@@ -0,0 +1,67 @@
+# [504. Base 7](https://leetcode.com/problems/base-7/)
+
+## 题目
+
+Given an integer num, return a string of its base 7 representation.
+
+**Example 1:**
+
+ Input: num = 100
+ Output: "202"
+
+**Example 2:**
+
+ Input: num = -7
+ Output: "-10"
+
+**Constraints:**
+
+- -10000000 <= num <= 10000000
+
+## 题目大意
+
+给定一个整数 num，将其转化为 7 进制，并以字符串形式输出。
+
+## 解题思路
+
+ num反复除以7，然后倒排余数
+
+# 代码
+
+```go
+package leetcode
+
+import "strconv"
+
+func convertToBase7(num int) string {
+ if num == 0 {
+ return "0"
+ }
+ negative := false
+ if num < 0 {
+ negative = true
+ num = -num
+ }
+ var ans string
+ var nums []int
+ for num != 0 {
+ remainder := num % 7
+ nums = append(nums, remainder)
+ num = num / 7
+ }
+ if negative {
+ ans += "-"
+ }
+ for i := len(nums) - 1; i >= 0; i-- {
+ ans += strconv.Itoa(nums[i])
+ }
+ return ans
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0500~0599/0503.Next-Greater-Element-II/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0500~0599/0506.Relative-Ranks/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0500~0599/0506.Relative-Ranks.md b/website/content/ChapterFour/0500~0599/0506.Relative-Ranks.md
new file mode 100644
index 000000000..0e1522f5f
--- /dev/null
+++ b/website/content/ChapterFour/0500~0599/0506.Relative-Ranks.md
@@ -0,0 +1,91 @@
+# [506. Relative Ranks](https://leetcode.com/problems/relative-ranks/)
+
+## 题目
+
+You are given an integer array score of size n, where score[i] is the score of the ith athlete in a competition. All the scores are guaranteed to be unique.
+
+The athletes are placed based on their scores, where the 1st place athlete has the highest score, the 2nd place athlete has the 2nd highest score, and so on. The placement of each athlete determines their rank:
+
+- The 1st place athlete's rank is "Gold Medal".
+- The 2nd place athlete's rank is "Silver Medal".
+- The 3rd place athlete's rank is "Bronze Medal".
+- For the 4th place to the nth place athlete, their rank is their placement number (i.e., the xth place athlete's rank is "x").
+
+Return an array answer of size n where answer[i] is the rank of the ith athlete.
+
+**Example 1**:
+
+ Input: score = [5,4,3,2,1]
+ Output: ["Gold Medal","Silver Medal","Bronze Medal","4","5"]
+ Explanation: The placements are [1st, 2nd, 3rd, 4th, 5th].
+
+**Example 2**:
+
+ Input: score = [10,3,8,9,4]
+ Output: ["Gold Medal","5","Bronze Medal","Silver Medal","4"]
+ Explanation: The placements are [1st, 5th, 3rd, 2nd, 4th].
+
+**Constraints:**
+
+- n == score.length
+- 1 <= n <= 10000
+- 0 <= score[i] <= 1000000
+- All the values in score are unique.
+
+## 题目大意
+
+给你一个长度为 n 的整数数组 score ，其中 score[i] 是第 i 位运动员在比赛中的得分。所有得分都 互不相同 。
+
+运动员将根据得分 决定名次 ，其中名次第 1 的运动员得分最高，名次第 2 的运动员得分第 2 高，依此类推。运动员的名次决定了他们的获奖情况：
+
+- 名次第 1 的运动员获金牌 "Gold Medal" 。
+- 名次第 2 的运动员获银牌 "Silver Medal" 。
+- 名次第 3 的运动员获铜牌 "Bronze Medal" 。
+- 从名次第 4 到第 n 的运动员，只能获得他们的名次编号（即，名次第 x 的运动员获得编号 "x"）。
+
+使用长度为 n 的数组 answer 返回获奖，其中 answer[i] 是第 i 位运动员的获奖情况。
+
+## 解题思路
+
+- 用 map 记录原来 score 中元素对应的坐标，然后对 score 进行排序，对排序后的元素我们通过 map 就可以知道它排的名次了
+
+## 代码
+
+```go
+package leetcode
+
+import (
+ "sort"
+ "strconv"
+)
+
+func findRelativeRanks(score []int) []string {
+ mp := make(map[int]int)
+ for i, v := range score {
+ mp[v] = i
+ }
+ sort.Slice(score, func(i, j int) bool {
+ return score[i] > score[j]
+ })
+ ans := make([]string, len(score))
+ for i, v := range score {
+ if i == 0 {
+ ans[mp[v]] = "Gold Medal"
+ } else if i == 1 {
+ ans[mp[v]] = "Silver Medal"
+ } else if i == 2 {
+ ans[mp[v]] = "Bronze Medal"
+ } else {
+ ans[mp[v]] = strconv.Itoa(i + 1)
+ }
+ }
+ return ans
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0500~0599/0504.Base-7/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0500~0599/0507.Perfect-Number/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0507.Perfect-Number.md b/website/content/ChapterFour/0500~0599/0507.Perfect-Number.md
similarity index 80%
rename from website/content/ChapterFour/0507.Perfect-Number.md
rename to website/content/ChapterFour/0500~0599/0507.Perfect-Number.md
index 12d0c7649..d48f8bd18 100644
--- a/website/content/ChapterFour/0507.Perfect-Number.md
+++ b/website/content/ChapterFour/0500~0599/0507.Perfect-Number.md
@@ -61,4 +61,11 @@ func checkPerfectNumber_(num int) bool {
return num == 6 || num == 28 || num == 496 || num == 8128 || num == 33550336
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0500~0599/0506.Relative-Ranks/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0500~0599/0508.Most-Frequent-Subtree-Sum/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0508.Most-Frequent-Subtree-Sum.md b/website/content/ChapterFour/0500~0599/0508.Most-Frequent-Subtree-Sum.md
similarity index 89%
rename from website/content/ChapterFour/0508.Most-Frequent-Subtree-Sum.md
rename to website/content/ChapterFour/0500~0599/0508.Most-Frequent-Subtree-Sum.md
index 91c2a9a6d..2467d23f3 100755
--- a/website/content/ChapterFour/0508.Most-Frequent-Subtree-Sum.md
+++ b/website/content/ChapterFour/0500~0599/0508.Most-Frequent-Subtree-Sum.md
@@ -120,4 +120,11 @@ func findTreeSum(root *TreeNode, fre map[int]int) int {
return val
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0500~0599/0507.Perfect-Number/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0500~0599/0509.Fibonacci-Number/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0509.Fibonacci-Number.md b/website/content/ChapterFour/0500~0599/0509.Fibonacci-Number.md
similarity index 82%
rename from website/content/ChapterFour/0509.Fibonacci-Number.md
rename to website/content/ChapterFour/0500~0599/0509.Fibonacci-Number.md
index ee3046077..55c0de7d7 100755
--- a/website/content/ChapterFour/0509.Fibonacci-Number.md
+++ b/website/content/ChapterFour/0500~0599/0509.Fibonacci-Number.md
@@ -168,4 +168,30 @@ func fib5(N int) int {
return int(math.Round(math.Pow(goldenRatio, float64(N)) / math.Sqrt(5)))
}
-```
\ No newline at end of file
+// 解法七 协程版，但是时间特别慢，不推荐，放在这里只是告诉大家，写 LeetCode 算法题的时候，启动 goroutine 特别慢
+func fib6(N int) int {
+ return <-fibb(N)
+}
+
+func fibb(n int) <- chan int {
+ result := make(chan int)
+ go func() {
+ defer close(result)
+
+ if n <= 1 {
+ result <- n
+ return
+ }
+ result <- <-fibb(n-1) + <-fibb(n-2)
+ }()
+ return result
+}
+
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0500~0599/0508.Most-Frequent-Subtree-Sum/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0500~0599/0513.Find-Bottom-Left-Tree-Value/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0513.Find-Bottom-Left-Tree-Value.md b/website/content/ChapterFour/0500~0599/0513.Find-Bottom-Left-Tree-Value.md
similarity index 83%
rename from website/content/ChapterFour/0513.Find-Bottom-Left-Tree-Value.md
rename to website/content/ChapterFour/0500~0599/0513.Find-Bottom-Left-Tree-Value.md
index c4f7f0830..bce46e77b 100755
--- a/website/content/ChapterFour/0513.Find-Bottom-Left-Tree-Value.md
+++ b/website/content/ChapterFour/0500~0599/0513.Find-Bottom-Left-Tree-Value.md
@@ -109,4 +109,11 @@ func findBottomLeftValue1(root *TreeNode) int {
return 0
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0500~0599/0509.Fibonacci-Number/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0500~0599/0515.Find-Largest-Value-in-Each-Tree-Row/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0500~0599/0515.Find-Largest-Value-in-Each-Tree-Row.md b/website/content/ChapterFour/0500~0599/0515.Find-Largest-Value-in-Each-Tree-Row.md
new file mode 100755
index 000000000..063e06f5e
--- /dev/null
+++ b/website/content/ChapterFour/0500~0599/0515.Find-Largest-Value-in-Each-Tree-Row.md
@@ -0,0 +1,122 @@
+# [515. Find Largest Value in Each Tree Row](https://leetcode.com/problems/find-largest-value-in-each-tree-row/)
+
+
+## 题目
+
+You need to find the largest value in each row of a binary tree.
+
+**Example**:
+
+ Input:
+
+ 1
+ / \
+ 3 2
+ / \ \
+ 5 3 9
+
+ Output: [1, 3, 9]
+
+
+## 题目大意
+
+求在二叉树的每一行中找到最大的值。
+
+
+## 解题思路
+
+
+- 给出一个二叉树，要求依次输出每行的最大值
+- 用 BFS 层序遍历，将每层排序取出最大值。改进的做法是遍历中不断更新每层的最大值。
+
+
+
+## 代码
+
+```go
+
+package leetcode
+
+import (
+ "math"
+ "sort"
+)
+
+/**
+ * Definition for a binary tree node.
+ * type TreeNode struct {
+ * Val int
+ * Left *TreeNode
+ * Right *TreeNode
+ * }
+ */
+
+// 解法一 层序遍历二叉树，再将每层排序取出最大值
+func largestValues(root *TreeNode) []int {
+ tmp := levelOrder(root)
+ res := []int{}
+ for i := 0; i < len(tmp); i++ {
+ sort.Ints(tmp[i])
+ res = append(res, tmp[i][len(tmp[i])-1])
+ }
+ return res
+}
+
+// 解法二 层序遍历二叉树，遍历过程中不断更新最大值
+func largestValues1(root *TreeNode) []int {
+ if root == nil {
+ return []int{}
+ }
+ q := []*TreeNode{root}
+ var res []int
+ for len(q) > 0 {
+ qlen := len(q)
+ max := math.MinInt32
+ for i := 0; i < qlen; i++ {
+ node := q[0]
+ q = q[1:]
+ if node.Val > max {
+ max = node.Val
+ }
+ if node.Left != nil {
+ q = append(q, node.Left)
+ }
+ if node.Right != nil {
+ q = append(q, node.Right)
+ }
+ }
+ res = append(res, max)
+ }
+ return res
+}
+
+// 解法三 深度遍历二叉树
+func largestValues3(root *TreeNode) []int {
+ var res []int
+ var dfs func(root *TreeNode, level int)
+ dfs = func(root *TreeNode, level int) {
+ if root == nil {
+ return
+ }
+ if len(res) == level {
+ res = append(res, root.Val)
+ }
+ if res[level] < root.Val {
+ res[level] = root.Val
+ }
+
+ dfs(root.Right, level+1)
+ dfs(root.Left, level+1)
+ }
+ dfs(root, 0)
+ return res
+}
+
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0500~0599/0513.Find-Bottom-Left-Tree-Value/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0500~0599/0518.Coin-Change-II/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0500~0599/0518.Coin-Change-II.md b/website/content/ChapterFour/0500~0599/0518.Coin-Change-II.md
new file mode 100644
index 000000000..5fc89a1cd
--- /dev/null
+++ b/website/content/ChapterFour/0500~0599/0518.Coin-Change-II.md
@@ -0,0 +1,80 @@
+# [518. Coin Change II](https://leetcode.com/problems/coin-change-ii/)
+
+
+## 题目
+
+You are given an integer array `coins` representing coins of different denominations and an integer `amount` representing a total amount of money.
+
+Return *the number of combinations that make up that amount*. If that amount of money cannot be made up by any combination of the coins, return `0`.
+
+You may assume that you have an infinite number of each kind of coin.
+
+The answer is **guaranteed** to fit into a signed **32-bit** integer.
+
+**Example 1:**
+
+```
+Input: amount = 5, coins = [1,2,5]
+Output: 4
+Explanation: there are four ways to make up the amount:
+5=5
+5=2+2+1
+5=2+1+1+1
+5=1+1+1+1+1
+```
+
+**Example 2:**
+
+```
+Input: amount = 3, coins = [2]
+Output: 0
+Explanation: the amount of 3 cannot be made up just with coins of 2.
+```
+
+**Example 3:**
+
+```
+Input: amount = 10, coins = [10]
+Output: 1
+```
+
+**Constraints:**
+
+- `1 <= coins.length <= 300`
+- `1 <= coins[i] <= 5000`
+- All the values of `coins` are **unique**.
+- `0 <= amount <= 5000`
+
+## 题目大意
+
+给你一个整数数组 coins 表示不同面额的硬币，另给一个整数 amount 表示总金额。请你计算并返回可以凑成总金额的硬币组合数。如果任何硬币组合都无法凑出总金额，返回 0 。假设每一种面额的硬币有无限个。题目数据保证结果符合 32 位带符号整数。
+
+## 解题思路
+
+- 此题虽然名字叫 Coin Change，但是不是经典的背包九讲问题。题目中 coins 的每个元素可以选取多次，且不考虑选取元素的顺序，因此这道题实际需要计算的是选取硬币的组合数。定义 dp[i] 表示金额之和等于 i 的硬币组合数，目标求 dp[amount]。初始边界条件为 dp[0] = 1，即不取任何硬币，就这一种取法，金额为 0 。状态转移方程 dp[i] += dp[i-coin]，coin 为当前枚举的 coin。
+- 可能有读者会有疑惑，上述做法会不会出现重复计算。答案是不会。外层循环是遍历数组 coins 的值，内层循环是遍历不同的金额之和，在计算 dp[i] 的值时，可以确保金额之和等于 i 的硬币面额的顺序，由于顺序确定，因此不会重复计算不同的排列。
+- 和此题完全一致的解题思路的题有，第 377 题和第 494 题。
+
+## 代码
+
+```go
+package leetcode
+
+func change(amount int, coins []int) int {
+ dp := make([]int, amount+1)
+ dp[0] = 1
+ for _, coin := range coins {
+ for i := coin; i <= amount; i++ {
+ dp[i] += dp[i-coin]
+ }
+ }
+ return dp[amount]
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0500~0599/0515.Find-Largest-Value-in-Each-Tree-Row/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0500~0599/0519.Random-Flip-Matrix/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0500~0599/0519.Random-Flip-Matrix.md b/website/content/ChapterFour/0500~0599/0519.Random-Flip-Matrix.md
new file mode 100644
index 000000000..d72da22bb
--- /dev/null
+++ b/website/content/ChapterFour/0500~0599/0519.Random-Flip-Matrix.md
@@ -0,0 +1,105 @@
+# [519. Random Flip Matrix](https://leetcode.com/problems/random-flip-matrix/)
+
+## 题目
+
+There is an m x n binary grid matrix with all the values set 0 initially. Design an algorithm to randomly pick an index (i, j) where matrix[i][j] == 0 and flips it to 1. All the indices (i, j) where matrix[i][j] == 0 should be equally likely to be returned.
+
+Optimize your algorithm to minimize the number of calls made to the built-in random function of your language and optimize the time and space complexity.
+
+Implement the Solution class:
+
+- Solution(int m, int n) Initializes the object with the size of the binary matrix m and n.
+- int[] flip() Returns a random index [i, j] of the matrix where matrix[i][j] == 0 and flips it to 1.
+- void reset() Resets all the values of the matrix to be 0.
+
+**Example 1**:
+
+ Input
+ ["Solution", "flip", "flip", "flip", "reset", "flip"]
+ [[3, 1], [], [], [], [], []]
+ Output
+ [null, [1, 0], [2, 0], [0, 0], null, [2, 0]]
+
+ Explanation
+ Solution solution = new Solution(3, 1);
+ solution.flip(); // return [1, 0], [0,0], [1,0], and [2,0] should be equally likely to be returned.
+ solution.flip(); // return [2, 0], Since [1,0] was returned, [2,0] and [0,0]
+ solution.flip(); // return [0, 0], Based on the previously returned indices, only [0,0] can be returned.
+ solution.reset(); // All the values are reset to 0 and can be returned.
+ solution.flip(); // return [2, 0], [0,0], [1,0], and [2,0] should be equally likely to be returned.
+
+**Constraints:**
+
+- 1 <= m, n <= 10000
+- There will be at least one free cell for each call to flip.
+- At most 1000 calls will be made to flip and reset.
+
+## 题目大意
+
+给你一个 m x n 的二元矩阵 matrix ，且所有值被初始化为 0 。请你设计一个算法，随机选取一个满足 matrix[i][j] == 0 的下标 (i, j) ，并将它的值变为 1 。所有满足 matrix[i][j] == 0 的下标 (i, j) 被选取的概率应当均等。
+
+尽量最少调用内置的随机函数，并且优化时间和空间复杂度。
+
+实现 Solution 类：
+
+- Solution(int m, int n) 使用二元矩阵的大小 m 和 n 初始化该对象
+- int[] flip() 返回一个满足 matrix[i][j] == 0 的随机下标 [i, j] ，并将其对应格子中的值变为 1
+- void reset() 将矩阵中所有的值重置为 0
+
+## 解题思路
+
+- 二维矩阵利用哈希表转换为一维,每次随机选择一维中的任意一个元素，然后与最后一个元素交换，一维元素的总个数减一
+- 哈希表中默认的映射为x->x, 然后将不满足这个映射的特殊键值对存入哈希表
+
+## 代码
+
+```go
+package leetcode
+
+import "math/rand"
+
+type Solution struct {
+ r int
+ c int
+ total int
+ mp map[int]int
+}
+
+func Constructor(m int, n int) Solution {
+ return Solution{
+ r: m,
+ c: n,
+ total: m * n,
+ mp: map[int]int{},
+ }
+}
+
+func (this *Solution) Flip() []int {
+ k := rand.Intn(this.total)
+ val := k
+ if v, ok := this.mp[k]; ok {
+ val = v
+ }
+ if _, ok := this.mp[this.total-1]; ok {
+ this.mp[k] = this.mp[this.total-1]
+ } else {
+ this.mp[k] = this.total - 1
+ }
+ delete(this.mp, this.total - 1)
+ this.total--
+ newR, newC := val/this.c, val%this.c
+ return []int{newR, newC}
+}
+
+func (this *Solution) Reset() {
+ this.total = this.r * this.c
+ this.mp = map[int]int{}
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0500~0599/0518.Coin-Change-II/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0500~0599/0520.Detect-Capital/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0500~0599/0520.Detect-Capital.md b/website/content/ChapterFour/0500~0599/0520.Detect-Capital.md
new file mode 100644
index 000000000..33791a2ec
--- /dev/null
+++ b/website/content/ChapterFour/0500~0599/0520.Detect-Capital.md
@@ -0,0 +1,75 @@
+# [520. Detect Capital](https://leetcode.com/problems/detect-capital/)
+
+
+## 题目
+
+We define the usage of capitals in a word to be right when one of the following cases holds:
+
+All letters in this word are capitals, like "USA".
+
+All letters in this word are not capitals, like "leetcode".
+
+Only the first letter in this word is capital, like "Google".
+
+Given a string word, return true if the usage of capitals in it is right.
+
+**Example 1:**
+
+```
+Input: word = "USA"
+Output: true
+```
+
+**Example 2:**
+
+```
+Input: word = "FlaG"
+Output: false
+```
+
+**Constraints:**
+
+- 1 <= word.length <= 100
+- word consists of lowercase and uppercase English letters.
+
+## 题目大意
+
+我们定义，在以下情况时，单词的大写用法是正确的：
+
+全部字母都是大写，比如 "USA" 。
+单词中所有字母都不是大写，比如 "leetcode" 。
+如果单词不只含有一个字母，只有首字母大写，比如"Google" 。
+
+给你一个字符串 word 。如果大写用法正确，返回 true ；否则，返回 false 。
+
+## 解题思路
+
+- 把 word 分别转换为全部小写 wLower，全部大写 wUpper，首字母大写的字符串 wCaptial
+- 判断 word 是否等于 wLower, wUpper, wCaptial 中的一个，如果是返回 true，否则返回 false
+
+## 代码
+
+```go
+
+package leetcode
+
+import "strings"
+
+func detectCapitalUse(word string) bool {
+ wLower := strings.ToLower(word)
+ wUpper := strings.ToUpper(word)
+ wCaptial := strings.ToUpper(string(word[0])) + strings.ToLower(string(word[1:]))
+ if wCaptial == word || wLower == word || wUpper == word {
+ return true
+ }
+ return false
+}
+
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0500~0599/0519.Random-Flip-Matrix/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0500~0599/0523.Continuous-Subarray-Sum/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0500~0599/0523.Continuous-Subarray-Sum.md b/website/content/ChapterFour/0500~0599/0523.Continuous-Subarray-Sum.md
new file mode 100644
index 000000000..671295e2a
--- /dev/null
+++ b/website/content/ChapterFour/0500~0599/0523.Continuous-Subarray-Sum.md
@@ -0,0 +1,82 @@
+# [523. Continuous Subarray Sum](https://leetcode.com/problems/continuous-subarray-sum/)
+
+
+## 题目
+
+Given an integer array `nums` and an integer `k`, return `true` *if* `nums` *has a continuous subarray of size **at least two** whose elements sum up to a multiple of* `k`*, or* `false` *otherwise*.
+
+An integer `x` is a multiple of `k` if there exists an integer `n` such that `x = n * k`. `0` is **always** a multiple of `k`.
+
+**Example 1:**
+
+```
+Input: nums = [23,2,4,6,7], k = 6
+Output: true
+Explanation: [2, 4] is a continuous subarray of size 2 whose elements sum up to 6.
+```
+
+**Example 2:**
+
+```
+Input: nums = [23,2,6,4,7], k = 6
+Output: true
+Explanation: [23, 2, 6, 4, 7] is an continuous subarray of size 5 whose elements sum up to 42.
+42 is a multiple of 6 because 42 = 7 * 6 and 7 is an integer.
+```
+
+**Example 3:**
+
+```
+Input: nums = [23,2,6,4,7], k = 13
+Output: false
+```
+
+**Constraints:**
+
+- `1 <= nums.length <= 105`
+- `0 <= nums[i] <= 109`
+- `0 <= sum(nums[i]) <= 231 - 1`
+- `1 <= k <= 231 - 1`
+
+## 题目大意
+
+给你一个整数数组 nums 和一个整数 k ，编写一个函数来判断该数组是否含有同时满足下述条件的连续子数组：
+
+- 子数组大小至少为 2 ，且
+- 子数组元素总和为 k 的倍数。
+
+如果存在，返回 true ；否则，返回 false 。如果存在一个整数 n ，令整数 x 符合 x = n * k ，则称 x 是 k 的一个倍数。
+
+## 解题思路
+
+- 简单题。题目只要求是否存在，不要求找出所有解。用一个变量 sum 记录累加和。子数组的元素和可以用前缀和相减得到，例如 [i,j] 区间内的元素和，可以由 prefixSum[j] - prefixSum[i] 得到。当 prefixSums[j]−prefixSums[i] 为 k 的倍数时，prefixSums[i] 和 prefixSums[j] 除以 k 的余数相同。因此只需要计算每个下标对应的前缀和除以 k 的余数即可，使用 map 存储每个余数第一次出现的下标即可。在 map 中如果存在相同余数的 key，代表当前下标和 map 中这个 key 记录的下标可以满足总和为 k 的倍数这一条件。再判断一下能否满足大小至少为 2 的条件即可。用 2 个下标相减，长度大于等于 2 即满足条件，可以输出 true。
+
+## 代码
+
+```go
+package leetcode
+
+func checkSubarraySum(nums []int, k int) bool {
+ m := make(map[int]int)
+ m[0] = -1
+ sum := 0
+ for i, n := range nums {
+ sum += n
+ if r, ok := m[sum%k]; ok {
+ if i-2 >= r {
+ return true
+ }
+ } else {
+ m[sum%k] = i
+ }
+ }
+ return false
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0500~0599/0520.Detect-Capital/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0500~0599/0524.Longest-Word-in-Dictionary-through-Deleting/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0524.Longest-Word-in-Dictionary-through-Deleting.md b/website/content/ChapterFour/0500~0599/0524.Longest-Word-in-Dictionary-through-Deleting.md
similarity index 81%
rename from website/content/ChapterFour/0524.Longest-Word-in-Dictionary-through-Deleting.md
rename to website/content/ChapterFour/0500~0599/0524.Longest-Word-in-Dictionary-through-Deleting.md
index d139890af..51d40043e 100644
--- a/website/content/ChapterFour/0524.Longest-Word-in-Dictionary-through-Deleting.md
+++ b/website/content/ChapterFour/0500~0599/0524.Longest-Word-in-Dictionary-through-Deleting.md
@@ -73,4 +73,11 @@ func findLongestWord(s string, d []string) string {
return res
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0500~0599/0523.Continuous-Subarray-Sum/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0500~0599/0525.Contiguous-Array/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0500~0599/0525.Contiguous-Array.md b/website/content/ChapterFour/0500~0599/0525.Contiguous-Array.md
new file mode 100644
index 000000000..412f71fad
--- /dev/null
+++ b/website/content/ChapterFour/0500~0599/0525.Contiguous-Array.md
@@ -0,0 +1,74 @@
+# [525. Contiguous Array](https://leetcode.com/problems/contiguous-array/)
+
+
+## 题目
+
+Given a binary array `nums`, return *the maximum length of a contiguous subarray with an equal number of* `0` *and* `1`.
+
+**Example 1:**
+
+```
+Input: nums = [0,1]
+Output: 2
+Explanation: [0, 1] is the longest contiguous subarray with an equal number of 0 and 1.
+```
+
+**Example 2:**
+
+```
+Input: nums = [0,1,0]
+Output: 2
+Explanation: [0, 1] (or [1, 0]) is a longest contiguous subarray with equal number of 0 and 1.
+```
+
+**Constraints:**
+
+- `1 <= nums.length <= 105`
+- `nums[i]` is either `0` or `1`.
+
+## 题目大意
+
+给定一个二进制数组 nums , 找到含有相同数量的 0 和 1 的最长连续子数组，并返回该子数组的长度。
+
+## 解题思路
+
+- 0 和 1 的数量相同可以转化为两者数量相差为 0，如果将 0 看作为 -1，那么原题转化为求最长连续子数组，其元素和为 0 。又变成了区间内求和的问题，自然而然转换为前缀和来处理。假设连续子数组是 [i,j] 区间，这个区间内元素和为 0 意味着 prefixSum[j] - prefixSum[i] = 0，也就是 prefixSum[i] = prefixSum[j]。不断累加前缀和，将每个前缀和存入 map 中。一旦某个 key 存在了，代表之前某个下标的前缀和和当前下标构成的区间，这段区间内的元素和为 0 。这个区间是所求。扫完整个数组，扫描过程中动态更新最大区间长度，扫描完成便可得到最大区间长度，即最长连续子数组。
+
+## 代码
+
+```go
+package leetcode
+
+func findMaxLength(nums []int) int {
+ dict := map[int]int{}
+ dict[0] = -1
+ count, res := 0, 0
+ for i := 0; i < len(nums); i++ {
+ if nums[i] == 0 {
+ count--
+ } else {
+ count++
+ }
+ if idx, ok := dict[count]; ok {
+ res = max(res, i-idx)
+ } else {
+ dict[count] = i
+ }
+ }
+ return res
+}
+
+func max(a, b int) int {
+ if a > b {
+ return a
+ }
+ return b
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0500~0599/0524.Longest-Word-in-Dictionary-through-Deleting/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0500~0599/0526.Beautiful-Arrangement/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0526.Beautiful-Arrangement.md b/website/content/ChapterFour/0500~0599/0526.Beautiful-Arrangement.md
similarity index 88%
rename from website/content/ChapterFour/0526.Beautiful-Arrangement.md
rename to website/content/ChapterFour/0500~0599/0526.Beautiful-Arrangement.md
index f9f005cda..f3188ead0 100755
--- a/website/content/ChapterFour/0526.Beautiful-Arrangement.md
+++ b/website/content/ChapterFour/0500~0599/0526.Beautiful-Arrangement.md
@@ -107,4 +107,11 @@ func checkDivisible(num, d int) bool {
return false
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0500~0599/0525.Contiguous-Array/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0500~0599/0528.Random-Pick-with-Weight/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0528.Random-Pick-with-Weight.md b/website/content/ChapterFour/0500~0599/0528.Random-Pick-with-Weight.md
similarity index 88%
rename from website/content/ChapterFour/0528.Random-Pick-with-Weight.md
rename to website/content/ChapterFour/0500~0599/0528.Random-Pick-with-Weight.md
index 9e5d63976..3b83ea432 100755
--- a/website/content/ChapterFour/0528.Random-Pick-with-Weight.md
+++ b/website/content/ChapterFour/0500~0599/0528.Random-Pick-with-Weight.md
@@ -25,7 +25,7 @@ Given an array `w` of positive integers, where `w[i]` describes the weight o
[[[1,3]],[],[],[],[],[]]
Output: [null,0,1,1,1,0]
-**Explanation of Input Syntax:**
+**Explanation of Input Syntax**:
The input is two lists: the subroutines called and their arguments. `Solution`'s constructor has one argument, the array `w`. `pickIndex` has no arguments. Arguments are always wrapped with a list, even if there aren't any.
@@ -105,4 +105,11 @@ func (so *Solution528) PickIndex() int {
* param_1 := obj.PickIndex();
*/
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0500~0599/0526.Beautiful-Arrangement/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0500~0599/0529.Minesweeper/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0529.Minesweeper.md b/website/content/ChapterFour/0500~0599/0529.Minesweeper.md
similarity index 84%
rename from website/content/ChapterFour/0529.Minesweeper.md
rename to website/content/ChapterFour/0500~0599/0529.Minesweeper.md
index f2166a692..88540208a 100644
--- a/website/content/ChapterFour/0529.Minesweeper.md
+++ b/website/content/ChapterFour/0500~0599/0529.Minesweeper.md
@@ -103,43 +103,40 @@ func updateBoard(board [][]byte, click []int) [][]byte {
board[click[0]][click[1]] = 'X'
return board
}
- mineMap := make([][]int, len(board))
- for i := range board {
- mineMap[i] = make([]int, len(board[i]))
- }
- for i := range board {
- for j := range board[i] {
- if board[i][j] == 'M' {
- mineMap[i][j] = -1
- for _, d := range dir8 {
- nx, ny := i+d[0], j+d[1]
- if isInBoard(board, nx, ny) && mineMap[nx][ny] >= 0 {
- mineMap[nx][ny]++
- }
- }
- }
- }
- }
- mineSweeper(click[0], click[1], board, mineMap, dir8)
+ dfs(board, click[0], click[1])
return board
}
-func mineSweeper(x, y int, board [][]byte, mineMap [][]int, dir8 [][]int) {
- if board[x][y] != 'M' && board[x][y] != 'E' {
+func dfs(board [][]byte, x, y int) {
+ cnt := 0
+ for i := 0; i < 8; i++ {
+ nx, ny := x+dir8[i][0], y+dir8[i][1]
+ if isInBoard(board, nx, ny) && board[nx][ny] == 'M' {
+ cnt++
+
+ }
+ }
+ if cnt > 0 {
+ board[x][y] = byte(cnt + '0')
return
}
- if mineMap[x][y] == -1 {
- board[x][y] = 'X'
- } else if mineMap[x][y] > 0 {
- board[x][y] = '0' + byte(mineMap[x][y])
- } else {
- board[x][y] = 'B'
- for _, d := range dir8 {
- nx, ny := x+d[0], y+d[1]
- if isInBoard(board, nx, ny) && mineMap[nx][ny] >= 0 {
- mineSweeper(nx, ny, board, mineMap, dir8)
- }
+ board[x][y] = 'B'
+ for i := 0; i < 8; i++ {
+ nx, ny := x+dir8[i][0], y+dir8[i][1]
+ if isInBoard(board, nx, ny) && board[nx][ny] != 'B' {
+ dfs(board, nx, ny)
}
}
}
-```
\ No newline at end of file
+
+func isInBoard(board [][]byte, x, y int) bool {
+ return x >= 0 && x < len(board) && y >= 0 && y < len(board[0])
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0500~0599/0528.Random-Pick-with-Weight/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0500~0599/0530.Minimum-Absolute-Difference-in-BST/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0500~0599/0530.Minimum-Absolute-Difference-in-BST.md b/website/content/ChapterFour/0500~0599/0530.Minimum-Absolute-Difference-in-BST.md
new file mode 100644
index 000000000..5dcd943f9
--- /dev/null
+++ b/website/content/ChapterFour/0500~0599/0530.Minimum-Absolute-Difference-in-BST.md
@@ -0,0 +1,101 @@
+# [530. Minimum Absolute Difference in BST](https://leetcode.com/problems/minimum-absolute-difference-in-bst/)
+
+
+## 题目
+
+Given a binary search tree with non-negative values, find the minimum [absolute difference](https://en.wikipedia.org/wiki/Absolute_difference) between values of any two nodes.
+
+**Example:**
+
+```
+Input:
+
+ 1
+ \
+ 3
+ /
+ 2
+
+Output:
+1
+
+Explanation:
+The minimum absolute difference is 1, which is the difference between 2 and 1 (or between 2 and 3).
+```
+
+**Note:**
+
+- There are at least two nodes in this BST.
+- This question is the same as 783: [https://leetcode.com/problems/minimum-distance-between-bst-nodes/](https://leetcode.com/problems/minimum-distance-between-bst-nodes/)
+
+## 题目大意
+
+给你一棵所有节点为非负值的二叉搜索树，请你计算树中任意两节点的差的绝对值的最小值。
+
+## 解题思路
+
+- 由于是 BST 树，利用它有序的性质，中根遍历的结果是有序的。中根遍历过程中动态维护前后两个节点的差值，即可找到最小差值。
+- 此题与第 783 题完全相同。
+
+## 代码
+
+```go
+package leetcode
+
+import (
+ "math"
+
+ "github.com/halfrost/leetcode-go/structures"
+)
+
+// TreeNode define
+type TreeNode = structures.TreeNode
+
+/**
+ * Definition for a binary tree node.
+ * type TreeNode struct {
+ * Val int
+ * Left *TreeNode
+ * Right *TreeNode
+ * }
+ */
+
+func getMinimumDifference(root *TreeNode) int {
+ res, nodes := math.MaxInt16, -1
+ dfsBST(root, &res, &nodes)
+ return res
+}
+
+func dfsBST(root *TreeNode, res, pre *int) {
+ if root == nil {
+ return
+ }
+ dfsBST(root.Left, res, pre)
+ if *pre != -1 {
+ *res = min(*res, abs(root.Val-*pre))
+ }
+ *pre = root.Val
+ dfsBST(root.Right, res, pre)
+}
+
+func min(a, b int) int {
+ if a > b {
+ return b
+ }
+ return a
+}
+
+func abs(a int) int {
+ if a > 0 {
+ return a
+ }
+ return -a
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0500~0599/0529.Minesweeper/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0500~0599/0532.K-diff-Pairs-in-an-Array/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0532.K-diff-Pairs-in-an-Array.md b/website/content/ChapterFour/0500~0599/0532.K-diff-Pairs-in-an-Array.md
similarity index 82%
rename from website/content/ChapterFour/0532.K-diff-Pairs-in-an-Array.md
rename to website/content/ChapterFour/0500~0599/0532.K-diff-Pairs-in-an-Array.md
index 20aa28893..abbfb45ad 100644
--- a/website/content/ChapterFour/0532.K-diff-Pairs-in-an-Array.md
+++ b/website/content/ChapterFour/0500~0599/0532.K-diff-Pairs-in-an-Array.md
@@ -92,4 +92,11 @@ func findPairs(nums []int, k int) int {
return count
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0500~0599/0530.Minimum-Absolute-Difference-in-BST/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0500~0599/0535.Encode-and-Decode-TinyURL/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0500~0599/0535.Encode-and-Decode-TinyURL.md b/website/content/ChapterFour/0500~0599/0535.Encode-and-Decode-TinyURL.md
new file mode 100644
index 000000000..edb658941
--- /dev/null
+++ b/website/content/ChapterFour/0500~0599/0535.Encode-and-Decode-TinyURL.md
@@ -0,0 +1,67 @@
+# [535. Encode and Decode TinyURL](https://leetcode.com/problems/encode-and-decode-tinyurl/)
+
+
+## 题目
+
+> Note: This is a companion problem to the System Design problem: Design TinyURL.
+
+TinyURL is a URL shortening service where you enter a URL such as `https://leetcode.com/problems/design-tinyurl` and it returns a short URL such as `http://tinyurl.com/4e9iAk`.
+
+Design the `encode` and `decode` methods for the TinyURL service. There is no restriction on how your encode/decode algorithm should work. You just need to ensure that a URL can be encoded to a tiny URL and the tiny URL can be decoded to the original URL.
+
+## 题目大意
+
+TinyURL是一种URL简化服务， 比如：当你输入一个URL [https://leetcode.com/problems/design-tinyurl](https://leetcode.com/problems/design-tinyurl) 时，它将返回一个简化的URL [http://tinyurl.com/4e9iAk](http://tinyurl.com/4e9iAk).
+
+要求：设计一个 TinyURL 的加密 encode 和解密 decode 的方法。你的加密和解密算法如何设计和运作是没有限制的，你只需要保证一个URL可以被加密成一个TinyURL，并且这个TinyURL可以用解密方法恢复成原本的URL。
+
+## 解题思路
+
+- 简单题。由于题目并无规定 `encode()` 算法，所以自由度非常高。最简单的做法是把原始 `URL` 存起来，并记录下存在字符串数组中的下标位置。`decode()` 的时候根据存储的下标还原原始的 `URL`。
+
+## 代码
+
+```go
+package leetcode
+
+import (
+ "fmt"
+ "strconv"
+ "strings"
+)
+
+type Codec struct {
+ urls []string
+}
+
+func Constructor() Codec {
+ return Codec{[]string{}}
+}
+
+// Encodes a URL to a shortened URL.
+func (this *Codec) encode(longUrl string) string {
+ this.urls = append(this.urls, longUrl)
+ return "http://tinyurl.com/" + fmt.Sprintf("%v", len(this.urls)-1)
+}
+
+// Decodes a shortened URL to its original URL.
+func (this *Codec) decode(shortUrl string) string {
+ tmp := strings.Split(shortUrl, "/")
+ i, _ := strconv.Atoi(tmp[len(tmp)-1])
+ return this.urls[i]
+}
+
+/**
+ * Your Codec object will be instantiated and called as such:
+ * obj := Constructor();
+ * url := obj.encode(longUrl);
+ * ans := obj.decode(url);
+ */
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0500~0599/0532.K-diff-Pairs-in-an-Array/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0500~0599/0537.Complex-Number-Multiplication/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0537.Complex-Number-Multiplication.md b/website/content/ChapterFour/0500~0599/0537.Complex-Number-Multiplication.md
similarity index 82%
rename from website/content/ChapterFour/0537.Complex-Number-Multiplication.md
rename to website/content/ChapterFour/0500~0599/0537.Complex-Number-Multiplication.md
index 568404bab..46592cf55 100644
--- a/website/content/ChapterFour/0537.Complex-Number-Multiplication.md
+++ b/website/content/ChapterFour/0500~0599/0537.Complex-Number-Multiplication.md
@@ -70,4 +70,11 @@ func parse(s string) (int, int) {
return r, i
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0500~0599/0535.Encode-and-Decode-TinyURL/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0500~0599/0538.Convert-BST-to-Greater-Tree/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0500~0599/0538.Convert-BST-to-Greater-Tree.md b/website/content/ChapterFour/0500~0599/0538.Convert-BST-to-Greater-Tree.md
new file mode 100644
index 000000000..c69654019
--- /dev/null
+++ b/website/content/ChapterFour/0500~0599/0538.Convert-BST-to-Greater-Tree.md
@@ -0,0 +1,113 @@
+# [538. Convert BST to Greater Tree](https://leetcode.com/problems/convert-bst-to-greater-tree/)
+
+## 题目
+
+Given the `root` of a Binary Search Tree (BST), convert it to a Greater Tree such that every key of the original BST is changed to the original key plus sum of all keys greater than the original key in BST.
+
+As a reminder, a *binary search tree* is a tree that satisfies these constraints:
+
+- The left subtree of a node contains only nodes with keys **less than** the node's key.
+- The right subtree of a node contains only nodes with keys **greater than** the node's key.
+- Both the left and right subtrees must also be binary search trees.
+
+**Note:** This question is the same as 1038: [https://leetcode.com/problems/binary-search-tree-to-greater-sum-tree/](https://leetcode.com/problems/binary-search-tree-to-greater-sum-tree/)
+
+**Example 1:**
+
+
+
+```
+Input: root = [4,1,6,0,2,5,7,null,null,null,3,null,null,null,8]
+Output: [30,36,21,36,35,26,15,null,null,null,33,null,null,null,8]
+```
+
+**Example 2:**
+
+```
+Input: root = [0,null,1]
+Output: [1,null,1]
+```
+
+**Example 3:**
+
+```
+Input: root = [1,0,2]
+Output: [3,3,2]
+```
+
+**Example 4:**
+
+```
+Input: root = [3,2,4,1]
+Output: [7,9,4,10]
+```
+
+**Constraints:**
+
+- The number of nodes in the tree is in the range `[0, 104]`.
+- `104 <= Node.val <= 104`
+- All the values in the tree are **unique**.
+- `root` is guaranteed to be a valid binary search tree.
+
+## 题目大意
+
+给出二叉 搜索 树的根节点，该树的节点值各不相同，请你将其转换为累加树（Greater Sum Tree），使每个节点 node 的新值等于原树中大于或等于 node.val 的值之和。
+
+提醒一下，二叉搜索树满足下列约束条件：
+
+- 节点的左子树仅包含键 小于 节点键的节点。
+- 节点的右子树仅包含键 大于 节点键的节点。
+- 左右子树也必须是二叉搜索树。
+
+## 解题思路
+
+- 根据二叉搜索树的有序性，想要将其转换为累加树，只需按照 右节点 - 根节点 - 左节点的顺序遍历，并累加和即可。
+- 此题同第 1038 题。
+
+## 代码
+
+```go
+package leetcode
+
+import (
+ "github.com/halfrost/leetcode-go/structures"
+)
+
+// TreeNode define
+type TreeNode = structures.TreeNode
+
+/**
+ * Definition for a binary tree node.
+ * type TreeNode struct {
+ * Val int
+ * Left *TreeNode
+ * Right *TreeNode
+ * }
+ */
+
+func convertBST(root *TreeNode) *TreeNode {
+ if root == nil {
+ return root
+ }
+ sum := 0
+ dfs538(root, &sum)
+ return root
+}
+
+func dfs538(root *TreeNode, sum *int) {
+ if root == nil {
+ return
+ }
+ dfs538(root.Right, sum)
+ root.Val += *sum
+ *sum = root.Val
+ dfs538(root.Left, sum)
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0500~0599/0537.Complex-Number-Multiplication/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0500~0599/0540.Single-Element-in-a-Sorted-Array/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0500~0599/0540.Single-Element-in-a-Sorted-Array.md b/website/content/ChapterFour/0500~0599/0540.Single-Element-in-a-Sorted-Array.md
new file mode 100644
index 000000000..b092e6466
--- /dev/null
+++ b/website/content/ChapterFour/0500~0599/0540.Single-Element-in-a-Sorted-Array.md
@@ -0,0 +1,71 @@
+# [540. Single Element in a Sorted Array](https://leetcode.com/problems/single-element-in-a-sorted-array/)
+
+## 题目
+
+You are given a sorted array consisting of only integers where every element appears exactly twice, except for one element which appears exactly once.
+
+Return the single element that appears only once.
+
+Your solution must run in O(log n) time and O(1) space.
+
+**Example 1:**
+
+ Input: nums = [1,1,2,3,3,4,4,8,8]
+ Output: 2
+
+**Example 2:**
+
+ Input: nums = [3,3,7,7,10,11,11]
+ Output: 10
+
+**Constraints:**
+
+- 1 <= nums.length <= 100000
+- 0 <= nums[i] <= 100000
+
+## 题目大意
+
+给你一个仅由整数组成的有序数组，其中每个元素都会出现两次，唯有一个数只会出现一次。
+
+请你找出并返回只出现一次的那个数。
+
+你设计的解决方案必须满足 O(log n) 时间复杂度和 O(1) 空间复杂度。
+
+## 解题思路
+
+ 假设下标idx是单独的数字,idx左边的偶数下标x有nums[x] == nums[x + 1],
+ idx右边的奇数下标y有nums[y] == nums[y + 1],可以根据此特性用二分查找idx对应的值
+
+## 代码
+
+```go
+package leetcode
+
+func singleNonDuplicate(nums []int) int {
+ left, right := 0, len(nums)-1
+ for left < right {
+ mid := (left + right) / 2
+ if mid%2 == 0 {
+ if nums[mid] == nums[mid+1] {
+ left = mid + 1
+ } else {
+ right = mid
+ }
+ } else {
+ if nums[mid] == nums[mid-1] {
+ left = mid + 1
+ } else {
+ right = mid
+ }
+ }
+ }
+ return nums[left]
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0500~0599/0538.Convert-BST-to-Greater-Tree/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0500~0599/0541.Reverse-String-II/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0541.Reverse-String-II.md b/website/content/ChapterFour/0500~0599/0541.Reverse-String-II.md
similarity index 75%
rename from website/content/ChapterFour/0541.Reverse-String-II.md
rename to website/content/ChapterFour/0500~0599/0541.Reverse-String-II.md
index 8d9ebdafb..ad726de6d 100755
--- a/website/content/ChapterFour/0541.Reverse-String-II.md
+++ b/website/content/ChapterFour/0500~0599/0541.Reverse-String-II.md
@@ -10,7 +10,7 @@ Given a string and an integer k, you need to reverse the first k characters for
Input: s = "abcdefg", k = 2
Output: "bacdfeg"
-**Restrictions:**
+**Restrictions**:
1. The string consists of lower English letters only.
2. Length of the given string and k will in the range [1, 10000]
@@ -53,4 +53,23 @@ func reverseStr(s string, k int) string {
return s
}
-```
\ No newline at end of file
+func revers(s string) string {
+ bytes := []byte(s)
+ i, j := 0, len(bytes)-1
+ for i < j {
+ bytes[i], bytes[j] = bytes[j], bytes[i]
+ i++
+ j--
+ }
+ return string(bytes)
+}
+
+
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0500~0599/0540.Single-Element-in-a-Sorted-Array/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0500~0599/0542.01-Matrix/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0542.01-Matrix.md b/website/content/ChapterFour/0500~0599/0542.01-Matrix.md
similarity index 93%
rename from website/content/ChapterFour/0542.01-Matrix.md
rename to website/content/ChapterFour/0500~0599/0542.01-Matrix.md
index deb16e4c7..09f41a810 100755
--- a/website/content/ChapterFour/0542.01-Matrix.md
+++ b/website/content/ChapterFour/0500~0599/0542.01-Matrix.md
@@ -199,4 +199,11 @@ func updateMatrixDP(matrix [][]int) [][]int {
return matrix
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0500~0599/0541.Reverse-String-II/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0500~0599/0543.Diameter-of-Binary-Tree/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0500~0599/0543.Diameter-of-Binary-Tree.md b/website/content/ChapterFour/0500~0599/0543.Diameter-of-Binary-Tree.md
new file mode 100644
index 000000000..ced821989
--- /dev/null
+++ b/website/content/ChapterFour/0500~0599/0543.Diameter-of-Binary-Tree.md
@@ -0,0 +1,94 @@
+# [543. Diameter of Binary Tree](https://leetcode.com/problems/diameter-of-binary-tree/)
+
+
+## 题目
+
+Given the `root` of a binary tree, return *the length of the **diameter** of the tree*.
+
+The **diameter** of a binary tree is the **length** of the longest path between any two nodes in a tree. This path may or may not pass through the `root`.
+
+The **length** of a path between two nodes is represented by the number of edges between them.
+
+**Example 1:**
+
+
+
+```
+Input: root = [1,2,3,4,5]
+Output: 3
+Explanation: 3 is the length of the path [4,2,1,3] or [5,2,1,3].
+
+```
+
+**Example 2:**
+
+```
+Input: root = [1,2]
+Output: 1
+
+```
+
+**Constraints:**
+
+- The number of nodes in the tree is in the range `[1, 104]`.
+- `100 <= Node.val <= 100`
+
+## 题目大意
+
+给定一棵二叉树，你需要计算它的直径长度。一棵二叉树的直径长度是任意两个结点路径长度中的最大值。这条路径可能穿过也可能不穿过根结点。
+
+## 解题思路
+
+- 简单题。遍历每个节点的左子树和右子树，累加从左子树到右子树的最大长度。遍历每个节点时，动态更新这个最大长度即可。
+
+## 代码
+
+```go
+package leetcode
+
+import (
+ "github.com/halfrost/leetcode-go/structures"
+)
+
+// TreeNode define
+type TreeNode = structures.TreeNode
+
+/**
+ * Definition for a binary tree node.
+ * type TreeNode struct {
+ * Val int
+ * Left *TreeNode
+ * Right *TreeNode
+ * }
+ */
+
+func diameterOfBinaryTree(root *TreeNode) int {
+ result := 0
+ checkDiameter(root, &result)
+ return result
+}
+
+func checkDiameter(root *TreeNode, result *int) int {
+ if root == nil {
+ return 0
+ }
+ left := checkDiameter(root.Left, result)
+ right := checkDiameter(root.Right, result)
+ *result = max(*result, left+right)
+ return max(left, right) + 1
+}
+
+func max(a int, b int) int {
+ if a > b {
+ return a
+ }
+ return b
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0500~0599/0542.01-Matrix/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0500~0599/0547.Number-of-Provinces/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0500~0599/0547.Number-of-Provinces.md b/website/content/ChapterFour/0500~0599/0547.Number-of-Provinces.md
new file mode 100755
index 000000000..60011312f
--- /dev/null
+++ b/website/content/ChapterFour/0500~0599/0547.Number-of-Provinces.md
@@ -0,0 +1,118 @@
+# [547. Number of Provinces](https://leetcode.com/problems/number-of-provinces/)
+
+## 题目
+
+There are **N** students in a class. Some of them are friends, while some are not. Their friendship is transitive in nature. For example, if A is a **direct** friend of B, and B is a **direct**friend of C, then A is an **indirect** friend of C. And we defined a friend circle is a group of students who are direct or indirect friends.
+
+Given a **N*N** matrix **M** representing the friend relationship between students in the class. If M[i][j] = 1, then the ith and jth students are **direct** friends with each other, otherwise not. And you have to output the total number of friend circles among all the students.
+
+**Example 1**:
+
+ Input:
+ [[1,1,0],
+ [1,1,0],
+ [0,0,1]]
+ Output: 2
+ Explanation:The 0th and 1st students are direct friends, so they are in a friend circle.
+ The 2nd student himself is in a friend circle. So return 2.
+
+**Example 2**:
+
+ Input:
+ [[1,1,0],
+ [1,1,1],
+ [0,1,1]]
+ Output: 1
+ Explanation:The 0th and 1st students are direct friends, the 1st and 2nd students are direct friends,
+ so the 0th and 2nd students are indirect friends. All of them are in the same friend circle, so return 1.
+
+**Note**:
+
+1. N is in range [1,200].
+2. M[i][i] = 1 for all students.
+3. If M[i][j] = 1, then M[j][i] = 1.
+
+
+## 题目大意
+
+班上有 N 名学生。其中有些人是朋友，有些则不是。他们的友谊具有是传递性。如果已知 A 是 B 的朋友，B 是 C 的朋友，那么我们可以认为 A 也是 C 的朋友。所谓的朋友圈，是指所有朋友的集合。
+
+给定一个 N * N 的矩阵 M，表示班级中学生之间的朋友关系。如果 M[i][j] = 1，表示已知第 i 个和 j 个学生互为朋友关系，否则为不知道。你必须输出所有学生中的已知的朋友圈总数。
+
+
+注意：
+
+- N 在[1,200]的范围内。
+- 对于所有学生，有M[i][i] = 1。
+- 如果有 M[i][j] = 1，则有 M[j][i] = 1。
+
+
+## 解题思路
+
+
+- 给出一个二维矩阵，矩阵中的行列表示的是两个人之间是否是朋友关系，如果是 1，代表两个人是朋友关系。由于自己和自肯定朋友关系，所以对角线上都是 1，并且矩阵也是关于从左往右下的这条对角线对称。
+- 这题有 2 种解法，第一种解法是并查集，依次扫描矩阵，如果两个人认识，并且 root 并不相等就执行 union 操作。扫完所有矩阵，最后数一下还有几个不同的 root 就是最终答案。第二种解法是 DFS 或者 BFS。利用 FloodFill 的想法去染色，每次染色一次，计数器加一。最终扫完整个矩阵，计数器的结果就是最终结果。
+
+
+## 代码
+
+```go
+
+package leetcode
+
+import (
+ "github.com/halfrost/leetcode-go/template"
+)
+
+// 解法一 并查集
+
+func findCircleNum(M [][]int) int {
+ n := len(M)
+ if n == 0 {
+ return 0
+ }
+ uf := template.UnionFind{}
+ uf.Init(n)
+ for i := 0; i < n; i++ {
+ for j := 0; j <= i; j++ {
+ if M[i][j] == 1 {
+ uf.Union(i, j)
+ }
+ }
+ }
+ return uf.TotalCount()
+}
+
+// 解法二 FloodFill DFS 暴力解法
+func findCircleNum1(M [][]int) int {
+ if len(M) == 0 {
+ return 0
+ }
+ visited := make([]bool, len(M))
+ res := 0
+ for i := range M {
+ if !visited[i] {
+ dfs547(M, i, visited)
+ res++
+ }
+ }
+ return res
+}
+
+func dfs547(M [][]int, cur int, visited []bool) {
+ visited[cur] = true
+ for j := 0; j < len(M[cur]); j++ {
+ if !visited[j] && M[cur][j] == 1 {
+ dfs547(M, j, visited)
+ }
+ }
+}
+
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0500~0599/0543.Diameter-of-Binary-Tree/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0500~0599/0551.Student-Attendance-Record-I/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0500~0599/0551.Student-Attendance-Record-I.md b/website/content/ChapterFour/0500~0599/0551.Student-Attendance-Record-I.md
new file mode 100644
index 000000000..6d5a09651
--- /dev/null
+++ b/website/content/ChapterFour/0500~0599/0551.Student-Attendance-Record-I.md
@@ -0,0 +1,93 @@
+# [551. Student Attendance Record I](https://leetcode.com/problems/student-attendance-record-i/)
+
+## 题目
+
+You are given a string `s` representing an attendance record for a student where each character signifies whether the student was absent, late, or present on that day. The record only contains the following three characters:
+
+- `'A'`: Absent.
+- `'L'`: Late.
+- `'P'`: Present.
+
+The student is eligible for an attendance award if they meet **both** of the following criteria:
+
+- The student was absent (`'A'`) for **strictly** fewer than 2 days **total**.
+- The student was **never** late (`'L'`) for 3 or more **consecutive** days.
+
+Return `true` *if the student is eligible for an attendance award, or* `false` *otherwise*.
+
+**Example 1:**
+
+```
+Input: s = "PPALLP"
+Output: true
+Explanation: The student has fewer than 2 absences and was never late 3 or more consecutive days.
+
+```
+
+**Example 2:**
+
+```
+Input: s = "PPALLL"
+Output: false
+Explanation: The student was late 3 consecutive days in the last 3 days, so is not eligible for the award.
+
+```
+
+**Constraints:**
+
+- `1 <= s.length <= 1000`
+- `s[i]` is either `'A'`, `'L'`, or `'P'`.
+
+## 题目大意
+
+给你一个字符串 s 表示一个学生的出勤记录，其中的每个字符用来标记当天的出勤情况（缺勤、迟到、到场）。记录中只含下面三种字符：
+
+- 'A'：Absent，缺勤
+- 'L'：Late，迟到
+- 'P'：Present，到场
+
+如果学生能够 同时 满足下面两个条件，则可以获得出勤奖励：
+
+- 按 总出勤 计，学生缺勤（'A'）严格 少于两天。
+- 学生 不会 存在 连续 3 天或 连续 3 天以上的迟到（'L'）记录。
+
+如果学生可以获得出勤奖励，返回 true ；否则，返回 false 。
+
+## 解题思路
+
+- 遍历字符串 s 求出 'A' 的总数量和连续 'L' 的最大数量。
+- 比较 'A' 的数量是否小于 2 并且 'L' 的连续最大数量是否小于 3。
+
+## 代码
+
+```go
+package leetcode
+
+func checkRecord(s string) bool {
+ numsA, maxL, numsL := 0, 0, 0
+ for _, v := range s {
+ if v == 'L' {
+ numsL++
+ } else {
+ if numsL > maxL {
+ maxL = numsL
+ }
+ numsL = 0
+ if v == 'A' {
+ numsA++
+ }
+ }
+ }
+ if numsL > maxL {
+ maxL = numsL
+ }
+ return numsA < 2 && maxL < 3
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0500~0599/0547.Number-of-Provinces/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0500~0599/0554.Brick-Wall/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0500~0599/0554.Brick-Wall.md b/website/content/ChapterFour/0500~0599/0554.Brick-Wall.md
new file mode 100644
index 000000000..88f47f615
--- /dev/null
+++ b/website/content/ChapterFour/0500~0599/0554.Brick-Wall.md
@@ -0,0 +1,75 @@
+# [554. Brick Wall](https://leetcode.com/problems/brick-wall/)
+
+## 题目
+
+There is a rectangular brick wall in front of you with `n` rows of bricks. The `ith` row has some number of bricks each of the same height (i.e., one unit) but they can be of different widths. The total width of each row is the same.
+
+Draw a vertical line from the top to the bottom and cross the least bricks. If your line goes through the edge of a brick, then the brick is not considered as crossed. You cannot draw a line just along one of the two vertical edges of the wall, in which case the line will obviously cross no bricks.
+
+Given the 2D array `wall` that contains the information about the wall, return *the minimum number of crossed bricks after drawing such a vertical line*.
+
+**Example 1:**
+
+
+
+```
+Input: wall = [[1,2,2,1],[3,1,2],[1,3,2],[2,4],[3,1,2],[1,3,1,1]]
+Output: 2
+
+```
+
+**Example 2:**
+
+```
+Input: wall = [[1],[1],[1]]
+Output: 3
+
+```
+
+**Constraints:**
+
+- `n == wall.length`
+- `1 <= n <= 10^4`
+- `1 <= wall[i].length <= 10^4`
+- `1 <= sum(wall[i].length) <= 2 * 10^4`
+- `sum(wall[i])` is the same for each row `i`.
+- `1 <= wall[i][j] <= 2^31 - 1`
+
+## 题目大意
+
+你的面前有一堵矩形的、由 n 行砖块组成的砖墙。这些砖块高度相同（也就是一个单位高）但是宽度不同。每一行砖块的宽度之和应该相等。你现在要画一条 自顶向下 的、穿过 最少 砖块的垂线。如果你画的线只是从砖块的边缘经过，就不算穿过这块砖。你不能沿着墙的两个垂直边缘之一画线，这样显然是没有穿过一块砖的。给你一个二维数组 wall ，该数组包含这堵墙的相关信息。其中，wall[i] 是一个代表从左至右每块砖的宽度的数组。你需要找出怎样画才能使这条线 穿过的砖块数量最少 ，并且返回 穿过的砖块数量 。
+
+## 解题思路
+
+- 既然穿过砖块中缝不算穿过砖块，那么穿过最少砖块数量一定是穿过很多中缝。按行遍历每一行的砖块，累加每行砖块宽度，将每行砖块“缝”的坐标存在 map 中。最后取出 map 中出现频次最高的缝，即为铅垂线要穿过的地方。墙高减去缝出现的频次，剩下的即为穿过砖块的数量。
+
+## 代码
+
+```go
+package leetcode
+
+func leastBricks(wall [][]int) int {
+ m := make(map[int]int)
+ for _, row := range wall {
+ sum := 0
+ for i := 0; i < len(row)-1; i++ {
+ sum += row[i]
+ m[sum]++
+ }
+ }
+ max := 0
+ for _, v := range m {
+ if v > max {
+ max = v
+ }
+ }
+ return len(wall) - max
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0500~0599/0551.Student-Attendance-Record-I/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0500~0599/0557.Reverse-Words-in-a-String-III/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0557.Reverse-Words-in-a-String-III.md b/website/content/ChapterFour/0500~0599/0557.Reverse-Words-in-a-String-III.md
similarity index 77%
rename from website/content/ChapterFour/0557.Reverse-Words-in-a-String-III.md
rename to website/content/ChapterFour/0500~0599/0557.Reverse-Words-in-a-String-III.md
index 68363ed8d..0f277d761 100755
--- a/website/content/ChapterFour/0557.Reverse-Words-in-a-String-III.md
+++ b/website/content/ChapterFour/0500~0599/0557.Reverse-Words-in-a-String-III.md
@@ -54,4 +54,11 @@ func revers(s string) string {
return string(bytes)
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0500~0599/0554.Brick-Wall/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0500~0599/0559.Maximum-Depth-of-N-ary-Tree/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0500~0599/0559.Maximum-Depth-of-N-ary-Tree.md b/website/content/ChapterFour/0500~0599/0559.Maximum-Depth-of-N-ary-Tree.md
new file mode 100644
index 000000000..fec8b6e83
--- /dev/null
+++ b/website/content/ChapterFour/0500~0599/0559.Maximum-Depth-of-N-ary-Tree.md
@@ -0,0 +1,85 @@
+# [559. Maximum Depth of N-ary Tree](https://leetcode.com/problems/maximum-depth-of-n-ary-tree/)
+
+## 题目
+
+Given a n-ary tree, find its maximum depth.
+
+The maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf node.
+
+Nary-Tree input serialization is represented in their level order traversal, each group of children is separated by the null value (See examples).
+
+**Example 1**:
+
+
+
+ Input: root = [1,null,3,2,4,null,5,6]
+ Output: 3
+
+**Example 2**:
+
+
+
+ Input: root = [1,null,2,3,4,5,null,null,6,7,null,8,null,9,10,null,null,11,null,12,null,13,null,null,14]
+ Output: 5
+
+**Constraints:**
+
+- The total number of nodes is in the range [0, 10000].
+- The depth of the n-ary tree is less than or equal to 1000.
+
+## 题目大意
+
+给定一个 N 叉树，找到其最大深度。
+
+最大深度是指从根节点到最远叶子节点的最长路径上的节点总数。
+
+N 叉树输入按层序遍历序列化表示，每组子节点由空值分隔（请参见示例）。
+
+## 解题思路
+
+- 使用广度优先遍历
+
+## 代码
+
+```go
+
+package leetcode
+
+type Node struct {
+ Val int
+ Children []*Node
+}
+
+func maxDepth(root *Node) int {
+ if root == nil {
+ return 0
+ }
+ return 1 + bfs(root)
+}
+
+func bfs(root *Node) int {
+ var q []*Node
+ var depth int
+ q = append(q, root.Children...)
+ for len(q) != 0 {
+ depth++
+ length := len(q)
+ for length != 0 {
+ ele := q[0]
+ q = q[1:]
+ length--
+ if ele != nil && len(ele.Children) != 0 {
+ q = append(q, ele.Children...)
+ }
+ }
+ }
+ return depth
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0500~0599/0557.Reverse-Words-in-a-String-III/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0500~0599/0560.Subarray-Sum-Equals-K/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0500~0599/0560.Subarray-Sum-Equals-K.md b/website/content/ChapterFour/0500~0599/0560.Subarray-Sum-Equals-K.md
new file mode 100644
index 000000000..024667f09
--- /dev/null
+++ b/website/content/ChapterFour/0500~0599/0560.Subarray-Sum-Equals-K.md
@@ -0,0 +1,65 @@
+# [560. Subarray Sum Equals K](https://leetcode.com/problems/subarray-sum-equals-k/)
+
+
+## 题目
+
+Given an array of integers `nums` and an integer `k`, return *the total number of continuous subarrays whose sum equals to `k`*.
+
+**Example 1:**
+
+```
+Input: nums = [1,1,1], k = 2
+Output: 2
+
+```
+
+**Example 2:**
+
+```
+Input: nums = [1,2,3], k = 3
+Output: 2
+
+```
+
+**Constraints:**
+
+- `1 <= nums.length <= 2 * 104`
+- `-1000 <= nums[i] <= 1000`
+- `-10^7 <= k <= 10^7`
+
+## 题目大意
+
+给你一个整数数组 `nums` 和一个整数 `k` ，请你统计并返回该数组中和为 `k` ****的连续子数组的个数。
+
+## 解题思路
+
+- 此题不能使用滑动窗口来解。因为 `nums[i]` 可能为负数。
+- 前缀和的思路可以解答此题，但是时间复杂度有点高了，`O(n^2)`。考虑优化时间复杂度。
+- 题目要求找到连续区间和为 `k` 的子区间总数，即区间 `[i,j]` 内的和为 K ⇒ `prefixSum[j] - prefixSum[i-1] == k`。所以 `prefixSum[j] == k - prefixSum[i-1]` 。这样转换以后，题目就转换成类似 A + B = K 的问题了。LeetCode 第一题的优化思路拿来用。用 map 存储累加过的结果。如此优化以后，时间复杂度 `O(n)`。
+
+## 代码
+
+```go
+package leetcode
+
+func subarraySum(nums []int, k int) int {
+ count, pre := 0, 0
+ m := map[int]int{}
+ m[0] = 1
+ for i := 0; i < len(nums); i++ {
+ pre += nums[i]
+ if _, ok := m[pre-k]; ok {
+ count += m[pre-k]
+ }
+ m[pre] += 1
+ }
+ return count
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0500~0599/0559.Maximum-Depth-of-N-ary-Tree/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0500~0599/0561.Array-Partition/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0500~0599/0561.Array-Partition.md b/website/content/ChapterFour/0500~0599/0561.Array-Partition.md
new file mode 100644
index 000000000..04b71df09
--- /dev/null
+++ b/website/content/ChapterFour/0500~0599/0561.Array-Partition.md
@@ -0,0 +1,65 @@
+# [561. Array Partition](https://leetcode.com/problems/array-partition/)
+
+
+## 题目
+
+Given an array of **2n** integers, your task is to group these integers into **n** pairs of integer, say (a1, b1), (a2, b2), ..., (an, bn) which makes sum of min(ai, bi) for all i from 1 to n as large as possible.
+
+**Example 1**:
+
+```
+Input: [1,4,3,2]
+
+Output: 4
+Explanation: n is 2, and the maximum sum of pairs is 4 = min(1, 2) + min(3, 4).
+```
+
+**Note**:
+
+1. **n** is a positive integer, which is in the range of [1, 10000].
+2. All the integers in the array will be in the range of [-10000, 10000].
+
+## 题目大意
+
+给定长度为 2n 的数组, 你的任务是将这些数分成 n 对, 例如 (a1, b1), (a2, b2), ..., (an, bn) ，使得从1 到 n 的 min(ai, bi) 总和最大。
+
+
+## 解题思路
+
+- 给定一个 2n 个数组，要求把它们分为 n 组一行，求出各组最小值的总和的最大值。
+- 由于题目给的数据范围不大，[-10000, 10000]，所以我们可以考虑用一个哈希表数组，里面存储 i - 10000 元素的频次，偏移量是 10000。这个哈希表能按递增的顺序访问数组，这样可以减少排序的耗时。题目要求求出分组以后求和的最大值，那么所有偏小的元素尽量都安排在一组里面，这样取 min 以后，对最大和影响不大。例如，(1 , 1) 这样安排在一起，min 以后就是 1 。但是如果把相差很大的两个元素安排到一起，那么较大的那个元素就“牺牲”了。例如，(1 , 10000)，取 min 以后就是 1，于是 10000 就“牺牲”了。所以需要优先考虑较小值。
+- 较小值出现的频次可能是奇数也可能是偶数。如果是偶数，那比较简单，把它们俩俩安排在一起就可以了。如果是奇数，那么它会落单一次，落单的那个需要和距离它最近的一个元素进行配对，这样对最终的和影响最小。较小值如果是奇数，那么就会影响后面元素的选择，后面元素如果是偶数，由于需要一个元素和前面的较小值配对，所以它剩下的又是奇数个。这个影响会依次传递到后面。所以用一个 flag 标记，如果当前集合中有剩余元素将被再次考虑，则此标志设置为 1。在从下一组中选择元素时，会考虑已考虑的相同额外元素。
+- 最后扫描过程中动态的维护 sum 值就可以了。
+
+## 代码
+
+```go
+
+package leetcode
+
+func arrayPairSum(nums []int) int {
+ array := [20001]int{}
+ for i := 0; i < len(nums); i++ {
+ array[nums[i]+10000]++
+ }
+ flag, sum := true, 0
+ for i := 0; i < len(array); i++ {
+ for array[i] > 0 {
+ if flag {
+ sum = sum + i - 10000
+ }
+ flag = !flag
+ array[i]--
+ }
+ }
+ return sum
+}
+
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0500~0599/0560.Subarray-Sum-Equals-K/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0500~0599/0563.Binary-Tree-Tilt/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0563.Binary-Tree-Tilt.md b/website/content/ChapterFour/0500~0599/0563.Binary-Tree-Tilt.md
similarity index 85%
rename from website/content/ChapterFour/0563.Binary-Tree-Tilt.md
rename to website/content/ChapterFour/0500~0599/0563.Binary-Tree-Tilt.md
index b5a8ce5cf..dfe47b0de 100755
--- a/website/content/ChapterFour/0563.Binary-Tree-Tilt.md
+++ b/website/content/ChapterFour/0500~0599/0563.Binary-Tree-Tilt.md
@@ -80,4 +80,11 @@ func findTiltDFS(root *TreeNode, sum *int) int {
return root.Val + left + right
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0500~0599/0561.Array-Partition/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0500~0599/0566.Reshape-the-Matrix/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0566.Reshape-the-Matrix.md b/website/content/ChapterFour/0500~0599/0566.Reshape-the-Matrix.md
similarity index 88%
rename from website/content/ChapterFour/0566.Reshape-the-Matrix.md
rename to website/content/ChapterFour/0500~0599/0566.Reshape-the-Matrix.md
index a55a7028c..7097fecec 100755
--- a/website/content/ChapterFour/0566.Reshape-the-Matrix.md
+++ b/website/content/ChapterFour/0500~0599/0566.Reshape-the-Matrix.md
@@ -99,4 +99,11 @@ func reshape(nums [][]int, r, c int) [][]int {
return newShape
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0500~0599/0563.Binary-Tree-Tilt/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0500~0599/0567.Permutation-in-String/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0567.Permutation-in-String.md b/website/content/ChapterFour/0500~0599/0567.Permutation-in-String.md
similarity index 77%
rename from website/content/ChapterFour/0567.Permutation-in-String.md
rename to website/content/ChapterFour/0500~0599/0567.Permutation-in-String.md
index e2e9d17ad..35262e5db 100644
--- a/website/content/ChapterFour/0567.Permutation-in-String.md
+++ b/website/content/ChapterFour/0500~0599/0567.Permutation-in-String.md
@@ -32,7 +32,7 @@ Output: False
## 题目大意
-在一个字符串重寻找子串出现的位置。子串可以是 Anagrams 形式存在的。Anagrams 是一个字符串任意字符的全排列组合。
+在一个字符串中寻找子串出现的位置。子串可以是 Anagrams 形式存在的。Anagrams 是一个字符串任意字符的全排列组合。
## 解题思路
@@ -84,4 +84,11 @@ func checkInclusion(s1 string, s2 string) bool {
return false
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0500~0599/0566.Reshape-the-Matrix/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0500~0599/0572.Subtree-of-Another-Tree/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0572.Subtree-of-Another-Tree.md b/website/content/ChapterFour/0500~0599/0572.Subtree-of-Another-Tree.md
similarity index 82%
rename from website/content/ChapterFour/0572.Subtree-of-Another-Tree.md
rename to website/content/ChapterFour/0500~0599/0572.Subtree-of-Another-Tree.md
index 21611c120..9781a1795 100755
--- a/website/content/ChapterFour/0572.Subtree-of-Another-Tree.md
+++ b/website/content/ChapterFour/0500~0599/0572.Subtree-of-Another-Tree.md
@@ -84,4 +84,11 @@ func isSubtree(s *TreeNode, t *TreeNode) bool {
return false
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0500~0599/0567.Permutation-in-String/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0500~0599/0575.Distribute-Candies/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0575.Distribute-Candies.md b/website/content/ChapterFour/0500~0599/0575.Distribute-Candies.md
similarity index 84%
rename from website/content/ChapterFour/0575.Distribute-Candies.md
rename to website/content/ChapterFour/0500~0599/0575.Distribute-Candies.md
index 4e3299366..cdbf391ed 100755
--- a/website/content/ChapterFour/0575.Distribute-Candies.md
+++ b/website/content/ChapterFour/0500~0599/0575.Distribute-Candies.md
@@ -56,4 +56,11 @@ func distributeCandies(candies []int) int {
return res
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0500~0599/0572.Subtree-of-Another-Tree/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0500~0599/0576.Out-of-Boundary-Paths/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0500~0599/0576.Out-of-Boundary-Paths.md b/website/content/ChapterFour/0500~0599/0576.Out-of-Boundary-Paths.md
new file mode 100644
index 000000000..c58ba3fd3
--- /dev/null
+++ b/website/content/ChapterFour/0500~0599/0576.Out-of-Boundary-Paths.md
@@ -0,0 +1,96 @@
+# [576. Out of Boundary Paths](https://leetcode.com/problems/out-of-boundary-paths/)
+
+
+## 题目
+
+There is an `m x n` grid with a ball. The ball is initially at the position `[startRow, startColumn]`. You are allowed to move the ball to one of the four adjacent four cells in the grid (possibly out of the grid crossing the grid boundary). You can apply **at most** `maxMove` moves to the ball.
+
+Given the five integers `m`, `n`, `maxMove`, `startRow`, `startColumn`, return the number of paths to move the ball out of the grid boundary. Since the answer can be very large, return it **modulo** `109 + 7`.
+
+**Example 1:**
+
+
+
+```
+Input: m = 2, n = 2, maxMove = 2, startRow = 0, startColumn = 0
+Output: 6
+```
+
+**Example 2:**
+
+
+
+```
+Input: m = 1, n = 3, maxMove = 3, startRow = 0, startColumn = 1
+Output: 12
+```
+
+**Constraints:**
+
+- `1 <= m, n <= 50`
+- `0 <= maxMove <= 50`
+- `0 <= startRow <= m`
+- `0 <= startColumn <= n`
+
+## 题目大意
+
+给定一个 m × n 的网格和一个球。球的起始坐标为 (i,j) ，你可以将球移到相邻的单元格内，或者往上、下、左、右四个方向上移动使球穿过网格边界。但是，你最多可以移动 N 次。找出可以将球移出边界的路径数量。答案可能非常大，返回 结果 mod 109 + 7 的值。
+
+## 解题思路
+
+- 单纯暴力的思路，在球的每个方向都遍历一步，直到移动步数用完。这样暴力搜索，解空间是 4^n 。优化思路便是增加记忆化。用三维数组记录位置坐标和步数，对应的出边界的路径数量。加上记忆化以后的深搜解法 runtime beats 100% 了。
+
+## 代码
+
+```go
+package leetcode
+
+var dir = [][]int{
+ {-1, 0},
+ {0, 1},
+ {1, 0},
+ {0, -1},
+}
+
+func findPaths(m int, n int, maxMove int, startRow int, startColumn int) int {
+ visited := make([][][]int, m)
+ for i := range visited {
+ visited[i] = make([][]int, n)
+ for j := range visited[i] {
+ visited[i][j] = make([]int, maxMove+1)
+ for l := range visited[i][j] {
+ visited[i][j][l] = -1
+ }
+ }
+ }
+ return dfs(startRow, startColumn, maxMove, m, n, visited)
+}
+
+func dfs(x, y, maxMove, m, n int, visited [][][]int) int {
+ if x < 0 || x >= m || y < 0 || y >= n {
+ return 1
+ }
+ if maxMove == 0 {
+ visited[x][y][maxMove] = 0
+ return 0
+ }
+ if visited[x][y][maxMove] >= 0 {
+ return visited[x][y][maxMove]
+ }
+ res := 0
+ for i := 0; i < 4; i++ {
+ nx := x + dir[i][0]
+ ny := y + dir[i][1]
+ res += (dfs(nx, ny, maxMove-1, m, n, visited) % 1000000007)
+ }
+ visited[x][y][maxMove] = res % 1000000007
+ return visited[x][y][maxMove]
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0500~0599/0575.Distribute-Candies/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0500~0599/0581.Shortest-Unsorted-Continuous-Subarray/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0500~0599/0581.Shortest-Unsorted-Continuous-Subarray.md b/website/content/ChapterFour/0500~0599/0581.Shortest-Unsorted-Continuous-Subarray.md
new file mode 100644
index 000000000..88bece34b
--- /dev/null
+++ b/website/content/ChapterFour/0500~0599/0581.Shortest-Unsorted-Continuous-Subarray.md
@@ -0,0 +1,114 @@
+# [581. Shortest Unsorted Continuous Subarray](https://leetcode.com/problems/shortest-unsorted-continuous-subarray/)
+
+
+## 题目
+
+Given an integer array `nums`, you need to find one **continuous subarray** that if you only sort this subarray in ascending order, then the whole array will be sorted in ascending order.
+
+Return *the shortest such subarray and output its length*.
+
+**Example 1:**
+
+```
+Input: nums = [2,6,4,8,10,9,15]
+Output: 5
+Explanation: You need to sort [6, 4, 8, 10, 9] in ascending order to make the whole array sorted in ascending order.
+```
+
+**Example 2:**
+
+```
+Input: nums = [1,2,3,4]
+Output: 0
+```
+
+**Example 3:**
+
+```
+Input: nums = [1]
+Output: 0
+```
+
+**Constraints:**
+
+- `1 <= nums.length <= 104`
+- `105 <= nums[i] <= 105`
+
+## 题目大意
+
+给你一个整数数组 nums ，你需要找出一个 连续子数组 ，如果对这个子数组进行升序排序，那么整个数组都会变为升序排序。请你找出符合题意的 最短 子数组，并输出它的长度。
+
+## 解题思路
+
+- 本题求的是最短逆序区间。经过简单推理，可以知道，这个逆序区间一定由这个区间内的最小元素决定左边界，最大元素决定右边界。
+- 先从左边找到第一个降序的元素，并记录最小的元素 min，再从右边往左找到最右边开始降序的元素，并记录最大的元素 max。最后需要还原最小元素和最大元素在原数组中正确的位置。以逆序区间左边界为例，如果区间外的一个元素比这个逆序区间内的最小元素还要小，说明它并不是左边界，因为这个小元素和逆序区间内的最小元素组合在一起，还是升序，并不是逆序。只有在左边区间外找到第一个大于逆序区间内最小元素，说明这里刚刚开始发生逆序，这才是最小逆序区间的左边界。同理，在逆序区间的右边找到第一个小于逆序区间内最大元素，说明这里刚刚发生逆序，这才是最小逆序区间的右边界。至此，最小逆序区间的左右边界都确定下来了，最短长度也就确定了下来。时间复杂度 O(n)，空间复杂度 O(1)。
+
+## 代码
+
+```go
+package leetcode
+
+import "math"
+
+func findUnsortedSubarray(nums []int) int {
+ n, left, right, minR, maxL, isSort := len(nums), -1, -1, math.MaxInt32, math.MinInt32, false
+ // left
+ for i := 1; i < n; i++ {
+ if nums[i] < nums[i-1] {
+ isSort = true
+ }
+ if isSort {
+ minR = min(minR, nums[i])
+ }
+ }
+ isSort = false
+ // right
+ for i := n - 2; i >= 0; i-- {
+ if nums[i] > nums[i+1] {
+ isSort = true
+ }
+ if isSort {
+ maxL = max(maxL, nums[i])
+ }
+ }
+ // minR
+ for i := 0; i < n; i++ {
+ if nums[i] > minR {
+ left = i
+ break
+ }
+ }
+ // maxL
+ for i := n - 1; i >= 0; i-- {
+ if nums[i] < maxL {
+ right = i
+ break
+ }
+ }
+ if left == -1 || right == -1 {
+ return 0
+ }
+ return right - left + 1
+}
+
+func max(a, b int) int {
+ if a > b {
+ return a
+ }
+ return b
+}
+
+func min(a, b int) int {
+ if a < b {
+ return a
+ }
+ return b
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0500~0599/0576.Out-of-Boundary-Paths/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0500~0599/0583.Delete-Operation-for-Two-Strings/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0500~0599/0583.Delete-Operation-for-Two-Strings.md b/website/content/ChapterFour/0500~0599/0583.Delete-Operation-for-Two-Strings.md
new file mode 100644
index 000000000..98678815b
--- /dev/null
+++ b/website/content/ChapterFour/0500~0599/0583.Delete-Operation-for-Two-Strings.md
@@ -0,0 +1,85 @@
+# [583. Delete Operation for Two Strings](https://leetcode.com/problems/delete-operation-for-two-strings/)
+
+
+## 题目
+
+Given two strings `word1` and `word2`, return *the minimum number of **steps** required to make* `word1` *and* `word2` *the same*.
+
+In one **step**, you can delete exactly one character in either string.
+
+**Example 1:**
+
+```
+Input: word1 = "sea", word2 = "eat"
+Output: 2
+Explanation: You need one step to make "sea" to "ea" and another step to make "eat" to "ea".
+```
+
+**Example 2:**
+
+```
+Input: word1 = "leetcode", word2 = "etco"
+Output: 4
+```
+
+**Constraints:**
+
+- `1 <= word1.length, word2.length <= 500`
+- `word1` and `word2` consist of only lowercase English letters.
+
+## 题目大意
+
+给定两个单词 word1 和 word2，找到使得 word1 和 word2 相同所需的最小步数，每步可以删除任意一个字符串中的一个字符。
+
+## 解题思路
+
+- 从题目数据量级判断，此题一定是 O(n^2) 动态规划题。定义 `dp[i][j]` 表示 `word1[:i]` 与 `word2[:j]` 匹配所删除的最少步数。如果 `word1[:i-1]` 与 `word2[:j-1]` 匹配，那么 `dp[i][j] = dp[i-1][j-1]`。如果 `word1[:i-1]` 与 `word2[:j-1]` 不匹配，那么需要考虑删除一次，所以 `dp[i][j] = 1 + min(dp[i][j-1], dp[i-1][j])`。所以动态转移方程是：
+
+ {{< katex display >}}
+ dp[i][j] = \left\{\begin{matrix}dp[i-1][j-1]&, word1[i-1] == word2[j-1]\\ 1 + min(dp[i][j-1], dp[i-1][j])&, word1[i-1] \neq word2[j-1]\\\end{matrix}\right.
+ {{< /katex >}}
+
+ 最终答案存储在 `dp[len(word1)][len(word2)]` 中。
+
+## 代码
+
+```go
+package leetcode
+
+func minDistance(word1 string, word2 string) int {
+ dp := make([][]int, len(word1)+1)
+ for i := 0; i < len(word1)+1; i++ {
+ dp[i] = make([]int, len(word2)+1)
+ }
+ for i := 0; i < len(word1)+1; i++ {
+ dp[i][0] = i
+ }
+ for i := 0; i < len(word2)+1; i++ {
+ dp[0][i] = i
+ }
+ for i := 1; i < len(word1)+1; i++ {
+ for j := 1; j < len(word2)+1; j++ {
+ if word1[i-1] == word2[j-1] {
+ dp[i][j] = dp[i-1][j-1]
+ } else {
+ dp[i][j] = 1 + min(dp[i][j-1], dp[i-1][j])
+ }
+ }
+ }
+ return dp[len(word1)][len(word2)]
+}
+
+func min(x, y int) int {
+ if x < y {
+ return x
+ }
+ return y
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0500~0599/0581.Shortest-Unsorted-Continuous-Subarray/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0500~0599/0589.N-ary-Tree-Preorder-Traversal/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0500~0599/0589.N-ary-Tree-Preorder-Traversal.md b/website/content/ChapterFour/0500~0599/0589.N-ary-Tree-Preorder-Traversal.md
new file mode 100644
index 000000000..0bef5c6a2
--- /dev/null
+++ b/website/content/ChapterFour/0500~0599/0589.N-ary-Tree-Preorder-Traversal.md
@@ -0,0 +1,97 @@
+# [589. N-ary Tree Preorder Traversal](https://leetcode.com/problems/n-ary-tree-preorder-traversal/)
+
+## 题目
+
+Given the `root` of an n-ary tree, return *the preorder traversal of its nodes' values*.
+
+Nary-Tree input serialization is represented in their level order traversal. Each group of children is separated by the null value (See examples)
+
+**Example 1:**
+
+
+
+```
+Input: root = [1,null,3,2,4,null,5,6]
+Output: [1,3,5,6,2,4]
+```
+
+**Example 2:**
+
+
+
+```
+Input: root = [1,null,2,3,4,5,null,null,6,7,null,8,null,9,10,null,null,11,null,12,null,13,null,null,14]
+Output: [1,2,3,6,7,11,14,4,8,12,5,9,13,10]
+```
+
+**Constraints:**
+
+- The number of nodes in the tree is in the range `[0, 104]`.
+- `0 <= Node.val <= 10^4`
+- The height of the n-ary tree is less than or equal to `1000`.
+
+**Follow up:** Recursive solution is trivial, could you do it iteratively?
+
+## 题目大意
+
+给定一个 N 叉树，返回其节点值的 **前序遍历** 。N 叉树 在输入中按层序遍历进行序列化表示，每组子节点由空值 `null` 分隔（请参见示例）。
+
+## 解题思路
+
+- N 叉树和二叉树的前序遍历原理完全一样。二叉树非递归解法需要用到栈辅助，N 叉树同样如此。将父节点的所有孩子节点**逆序**入栈，逆序的目的是为了让前序节点永远在栈顶。依次循环直到栈里所有元素都出栈。输出的结果即为 N 叉树的前序遍历。时间复杂度 O(n)，空间复杂度 O(n)。
+- 递归解法非常简单，见解法二。
+
+## 代码
+
+```go
+package leetcode
+
+// Definition for a Node.
+type Node struct {
+ Val int
+ Children []*Node
+}
+
+// 解法一 非递归
+func preorder(root *Node) []int {
+ res := []int{}
+ if root == nil {
+ return res
+ }
+ stack := []*Node{root}
+ for len(stack) > 0 {
+ r := stack[len(stack)-1]
+ stack = stack[:len(stack)-1]
+ res = append(res, r.Val)
+ tmp := []*Node{}
+ for _, v := range r.Children {
+ tmp = append([]*Node{v}, tmp...) // 逆序存点
+ }
+ stack = append(stack, tmp...)
+ }
+ return res
+}
+
+// 解法二 递归
+func preorder1(root *Node) []int {
+ res := []int{}
+ preorderdfs(root, &res)
+ return res
+}
+
+func preorderdfs(root *Node, res *[]int) {
+ if root != nil {
+ *res = append(*res, root.Val)
+ for i := 0; i < len(root.Children); i++ {
+ preorderdfs(root.Children[i], res)
+ }
+ }
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0500~0599/0583.Delete-Operation-for-Two-Strings/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0500~0599/0594.Longest-Harmonious-Subsequence/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0594.Longest-Harmonious-Subsequence.md b/website/content/ChapterFour/0500~0599/0594.Longest-Harmonious-Subsequence.md
similarity index 80%
rename from website/content/ChapterFour/0594.Longest-Harmonious-Subsequence.md
rename to website/content/ChapterFour/0500~0599/0594.Longest-Harmonious-Subsequence.md
index 380ad65ae..963aef862 100755
--- a/website/content/ChapterFour/0594.Longest-Harmonious-Subsequence.md
+++ b/website/content/ChapterFour/0500~0599/0594.Longest-Harmonious-Subsequence.md
@@ -54,4 +54,11 @@ func findLHS(nums []int) int {
return longest
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0500~0599/0589.N-ary-Tree-Preorder-Traversal/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0500~0599/0598.Range-Addition-II/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0598.Range-Addition-II.md b/website/content/ChapterFour/0500~0599/0598.Range-Addition-II.md
similarity index 87%
rename from website/content/ChapterFour/0598.Range-Addition-II.md
rename to website/content/ChapterFour/0500~0599/0598.Range-Addition-II.md
index a4606f951..c4ca5720b 100644
--- a/website/content/ChapterFour/0598.Range-Addition-II.md
+++ b/website/content/ChapterFour/0500~0599/0598.Range-Addition-II.md
@@ -79,4 +79,11 @@ func min(a, b int) int {
return b
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0500~0599/0594.Longest-Harmonious-Subsequence/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0500~0599/0599.Minimum-Index-Sum-of-Two-Lists/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0599.Minimum-Index-Sum-of-Two-Lists.md b/website/content/ChapterFour/0500~0599/0599.Minimum-Index-Sum-of-Two-Lists.md
similarity index 86%
rename from website/content/ChapterFour/0599.Minimum-Index-Sum-of-Two-Lists.md
rename to website/content/ChapterFour/0500~0599/0599.Minimum-Index-Sum-of-Two-Lists.md
index 01cc155e0..a33f1d285 100755
--- a/website/content/ChapterFour/0599.Minimum-Index-Sum-of-Two-Lists.md
+++ b/website/content/ChapterFour/0500~0599/0599.Minimum-Index-Sum-of-Two-Lists.md
@@ -74,4 +74,11 @@ func findRestaurant(list1 []string, list2 []string) []string {
return ans
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0500~0599/0598.Range-Addition-II/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0600~0699/0605.Can-Place-Flowers/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0500~0599/_index.md b/website/content/ChapterFour/0500~0599/_index.md
new file mode 100644
index 000000000..d2021683f
--- /dev/null
+++ b/website/content/ChapterFour/0500~0599/_index.md
@@ -0,0 +1,5 @@
+---
+bookCollapseSection: true
+weight: 20
+---
+
diff --git a/website/content/ChapterFour/0515.Find-Largest-Value-in-Each-Tree-Row.md b/website/content/ChapterFour/0515.Find-Largest-Value-in-Each-Tree-Row.md
deleted file mode 100755
index 7cf9f3034..000000000
--- a/website/content/ChapterFour/0515.Find-Largest-Value-in-Each-Tree-Row.md
+++ /dev/null
@@ -1,93 +0,0 @@
-# [515. Find Largest Value in Each Tree Row](https://leetcode.com/problems/find-largest-value-in-each-tree-row/)
-
-
-## 题目
-
-You need to find the largest value in each row of a binary tree.
-
-**Example**:
-
- Input:
-
- 1
- / \
- 3 2
- / \ \
- 5 3 9
-
- Output: [1, 3, 9]
-
-
-## 题目大意
-
-求在二叉树的每一行中找到最大的值。
-
-
-## 解题思路
-
-
-- 给出一个二叉树，要求依次输出每行的最大值
-- 用 BFS 层序遍历，将每层排序取出最大值。改进的做法是遍历中不断更新每层的最大值。
-
-
-
-## 代码
-
-```go
-
-package leetcode
-
-import (
- "math"
- "sort"
-)
-
-/**
- * Definition for a binary tree node.
- * type TreeNode struct {
- * Val int
- * Left *TreeNode
- * Right *TreeNode
- * }
- */
-
-// 解法一 层序遍历二叉树，再将每层排序取出最大值
-func largestValues(root *TreeNode) []int {
- tmp := levelOrder(root)
- res := []int{}
- for i := 0; i < len(tmp); i++ {
- sort.Ints(tmp[i])
- res = append(res, tmp[i][len(tmp[i])-1])
- }
- return res
-}
-
-// 解法二 层序遍历二叉树，遍历过程中不断更新最大值
-func largestValues1(root *TreeNode) []int {
- if root == nil {
- return []int{}
- }
- q := []*TreeNode{root}
- var res []int
- for len(q) > 0 {
- qlen := len(q)
- max := math.MinInt32
- for i := 0; i < qlen; i++ {
- node := q[0]
- q = q[1:]
- if node.Val > max {
- max = node.Val
- }
- if node.Left != nil {
- q = append(q, node.Left)
- }
- if node.Right != nil {
- q = append(q, node.Right)
- }
- }
- res = append(res, max)
- }
- return res
-}
-
-```
\ No newline at end of file
diff --git a/website/content/ChapterFour/0547.Friend-Circles.md b/website/content/ChapterFour/0547.Friend-Circles.md
deleted file mode 100755
index a55972974..000000000
--- a/website/content/ChapterFour/0547.Friend-Circles.md
+++ /dev/null
@@ -1,111 +0,0 @@
-# [547. Friend Circles](https://leetcode.com/problems/friend-circles/)
-
-## 题目
-
-There are **N** students in a class. Some of them are friends, while some are not. Their friendship is transitive in nature. For example, if A is a **direct** friend of B, and B is a **direct**friend of C, then A is an **indirect** friend of C. And we defined a friend circle is a group of students who are direct or indirect friends.
-
-Given a **N*N** matrix **M** representing the friend relationship between students in the class. If M[i][j] = 1, then the ith and jth students are **direct** friends with each other, otherwise not. And you have to output the total number of friend circles among all the students.
-
-**Example 1**:
-
- Input:
- [[1,1,0],
- [1,1,0],
- [0,0,1]]
- Output: 2
- Explanation:The 0th and 1st students are direct friends, so they are in a friend circle.
- The 2nd student himself is in a friend circle. So return 2.
-
-**Example 2**:
-
- Input:
- [[1,1,0],
- [1,1,1],
- [0,1,1]]
- Output: 1
- Explanation:The 0th and 1st students are direct friends, the 1st and 2nd students are direct friends,
- so the 0th and 2nd students are indirect friends. All of them are in the same friend circle, so return 1.
-
-**Note**:
-
-1. N is in range [1,200].
-2. M[i][i] = 1 for all students.
-3. If M[i][j] = 1, then M[j][i] = 1.
-
-
-## 题目大意
-
-班上有 N 名学生。其中有些人是朋友，有些则不是。他们的友谊具有是传递性。如果已知 A 是 B 的朋友，B 是 C 的朋友，那么我们可以认为 A 也是 C 的朋友。所谓的朋友圈，是指所有朋友的集合。
-
-给定一个 N * N 的矩阵 M，表示班级中学生之间的朋友关系。如果 M[i][j] = 1，表示已知第 i 个和 j 个学生互为朋友关系，否则为不知道。你必须输出所有学生中的已知的朋友圈总数。
-
-
-注意：
-
-- N 在[1,200]的范围内。
-- 对于所有学生，有M[i][i] = 1。
-- 如果有 M[i][j] = 1，则有 M[j][i] = 1。
-
-
-## 解题思路
-
-
-- 给出一个二维矩阵，矩阵中的行列表示的是两个人之间是否是朋友关系，如果是 1，代表两个人是朋友关系。由于自己和自肯定朋友关系，所以对角线上都是 1，并且矩阵也是关于从左往右下的这条对角线对称。
-- 这题有 2 种解法，第一种解法是并查集，依次扫描矩阵，如果两个人认识，并且 root 并不相等就执行 union 操作。扫完所有矩阵，最后数一下还有几个不同的 root 就是最终答案。第二种解法是 DFS 或者 BFS。利用 FloodFill 的想法去染色，每次染色一次，计数器加一。最终扫完整个矩阵，计数器的结果就是最终结果。
-
-
-## 代码
-
-```go
-
-package leetcode
-
-import (
- "github.com/halfrost/LeetCode-Go/template"
-)
-
-// 解法一 并查集
-
-func findCircleNum(M [][]int) int {
- n := len(M)
- if n == 0 {
- return 0
- }
- uf := template.UnionFind{}
- uf.Init(n)
- for i := 0; i < n; i++ {
- for j := 0; j <= i; j++ {
- if M[i][j] == 1 {
- uf.Union(i, j)
- }
- }
- }
- return uf.TotalCount()
-}
-
-// 解法二 FloodFill DFS 暴力解法
-func findCircleNum1(M [][]int) int {
- if len(M) == 0 {
- return 0
- }
- visited := make([]bool, len(M))
- res := 0
- for i := range M {
- if !visited[i] {
- dfs547(M, i, visited)
- res++
- }
- }
- return res
-}
-
-func dfs547(M [][]int, cur int, visited []bool) {
- visited[cur] = true
- for j := 0; j < len(M[cur]); j++ {
- if !visited[j] && M[cur][j] == 1 {
- dfs547(M, j, visited)
- }
- }
-}
-
-```
\ No newline at end of file
diff --git a/website/content/ChapterFour/0561.Array-Partition-I.md b/website/content/ChapterFour/0561.Array-Partition-I.md
deleted file mode 100644
index d72ea633d..000000000
--- a/website/content/ChapterFour/0561.Array-Partition-I.md
+++ /dev/null
@@ -1,58 +0,0 @@
-# [561. Array Partition I](https://leetcode.com/problems/array-partition-i/)
-
-
-## 题目
-
-Given an array of **2n** integers, your task is to group these integers into **n** pairs of integer, say (a1, b1), (a2, b2), ..., (an, bn) which makes sum of min(ai, bi) for all i from 1 to n as large as possible.
-
-**Example 1**:
-
-```
-Input: [1,4,3,2]
-
-Output: 4
-Explanation: n is 2, and the maximum sum of pairs is 4 = min(1, 2) + min(3, 4).
-```
-
-**Note**:
-
-1. **n** is a positive integer, which is in the range of [1, 10000].
-2. All the integers in the array will be in the range of [-10000, 10000].
-
-## 题目大意
-
-给定长度为 2n 的数组, 你的任务是将这些数分成 n 对, 例如 (a1, b1), (a2, b2), ..., (an, bn) ，使得从1 到 n 的 min(ai, bi) 总和最大。
-
-
-## 解题思路
-
-- 给定一个 2n 个数组，要求把它们分为 n 组一行，求出各组最小值的总和的最大值。
-- 由于题目给的数据范围不大，[-10000, 10000]，所以我们可以考虑用一个哈希表数组，里面存储 i - 10000 元素的频次，偏移量是 10000。这个哈希表能按递增的顺序访问数组，这样可以减少排序的耗时。题目要求求出分组以后求和的最大值，那么所有偏小的元素尽量都安排在一组里面，这样取 min 以后，对最大和影响不大。例如，(1 , 1) 这样安排在一起，min 以后就是 1 。但是如果把相差很大的两个元素安排到一起，那么较大的那个元素就“牺牲”了。例如，(1 , 10000)，取 min 以后就是 1，于是 10000 就“牺牲”了。所以需要优先考虑较小值。
-- 较小值出现的频次可能是奇数也可能是偶数。如果是偶数，那比较简单，把它们俩俩安排在一起就可以了。如果是奇数，那么它会落单一次，落单的那个需要和距离它最近的一个元素进行配对，这样对最终的和影响最小。较小值如果是奇数，那么就会影响后面元素的选择，后面元素如果是偶数，由于需要一个元素和前面的较小值配对，所以它剩下的又是奇数个。这个影响会依次传递到后面。所以用一个 flag 标记，如果当前集合中有剩余元素将被再次考虑，则此标志设置为 1。在从下一组中选择元素时，会考虑已考虑的相同额外元素。
-- 最后扫描过程中动态的维护 sum 值就可以了。
-
-## 代码
-
-```go
-
-package leetcode
-
-func arrayPairSum(nums []int) int {
- array := [20001]int{}
- for i := 0; i < len(nums); i++ {
- array[nums[i]+10000]++
- }
- flag, sum := true, 0
- for i := 0; i < len(array); i++ {
- for array[i] > 0 {
- if flag {
- sum = sum + i - 10000
- }
- flag = !flag
- array[i]--
- }
- }
- return sum
-}
-
-```
\ No newline at end of file
diff --git a/website/content/ChapterFour/0600~0699/0605.Can-Place-Flowers.md b/website/content/ChapterFour/0600~0699/0605.Can-Place-Flowers.md
new file mode 100644
index 000000000..fe4ee14a7
--- /dev/null
+++ b/website/content/ChapterFour/0600~0699/0605.Can-Place-Flowers.md
@@ -0,0 +1,67 @@
+# [605. Can Place Flowers](https://leetcode.com/problems/can-place-flowers/)
+
+## 题目
+
+You have a long flowerbed in which some of the plots are planted, and some are not. However, flowers cannot be planted in **adjacent** plots.
+
+Given an integer array `flowerbed` containing `0`'s and `1`'s, where `0` means empty and `1` means not empty, and an integer `n`, return *if* `n` new flowers can be planted in the `flowerbed` without violating the no-adjacent-flowers rule.
+
+**Example 1**:
+
+```
+Input: flowerbed = [1,0,0,0,1], n = 1
+Output: true
+```
+
+**Example 2**:
+
+```
+Input: flowerbed = [1,0,0,0,1], n = 2
+Output: false
+```
+
+**Constraints**:
+
+- `1 <= flowerbed.length <= 2 * 104`
+- `flowerbed[i]` is `0` or `1`.
+- There are no two adjacent flowers in `flowerbed`.
+- `0 <= n <= flowerbed.length`
+
+## 题目大意
+
+假设你有一个很长的花坛，一部分地块种植了花，另一部分却没有。可是，花卉不能种植在相邻的地块上，它们会争夺水源，两者都会死去。给定一个花坛（表示为一个数组包含0和1，其中0表示没种植花，1表示种植了花），和一个数 n 。能否在不打破种植规则的情况下种入 n 朵花？能则返回True，不能则返回False。
+
+## 解题思路
+
+- 这一题最容易想到的解法是步长为 2 遍历数组，依次计数 0 的个数。有 2 种特殊情况需要单独判断，第一种情况是首尾连续多个 0，例如，00001 和 10000，第二种情况是 2 个 1 中间存在的 0 不足以种花，例如，1001 和 100001，1001 不能种任何花，100001 只能种一种花。单独判断出这 2 种情况，这一题就可以 AC 了。
+- 换个思路，找到可以种花的基本单元是 00，那么上面那 2 种特殊情况都可以统一成一种情况。判断是否当前存在 00 的组合，如果存在 00 的组合，都可以种花。末尾的情况需要单独判断，如果末尾为 0，也可以种花。这个时候不需要再找 00 组合，因为会越界。代码实现如下，思路很简洁明了。
+
+## 代码
+
+```go
+package leetcode
+
+func canPlaceFlowers(flowerbed []int, n int) bool {
+ lenth := len(flowerbed)
+ for i := 0; i < lenth && n > 0; i += 2 {
+ if flowerbed[i] == 0 {
+ if i+1 == lenth || flowerbed[i+1] == 0 {
+ n--
+ } else {
+ i++
+ }
+ }
+ }
+ if n == 0 {
+ return true
+ }
+ return false
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0500~0599/0599.Minimum-Index-Sum-of-Two-Lists/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0600~0699/0609.Find-Duplicate-File-in-System/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0600~0699/0609.Find-Duplicate-File-in-System.md b/website/content/ChapterFour/0600~0699/0609.Find-Duplicate-File-in-System.md
new file mode 100644
index 000000000..0e7cc04ab
--- /dev/null
+++ b/website/content/ChapterFour/0600~0699/0609.Find-Duplicate-File-in-System.md
@@ -0,0 +1,100 @@
+# [609. Find Duplicate File in System](https://leetcode.com/problems/find-duplicate-file-in-system/)
+
+
+## 题目
+
+Given a list `paths` of directory info, including the directory path, and all the files with contents in this directory, return *all the duplicate files in the file system in terms of their paths*. You may return the answer in **any order**.
+
+A group of duplicate files consists of at least two files that have the same content.
+
+A single directory info string in the input list has the following format:
+
+- `"root/d1/d2/.../dm f1.txt(f1_content) f2.txt(f2_content) ... fn.txt(fn_content)"`
+
+It means there are `n` files `(f1.txt, f2.txt ... fn.txt)` with content `(f1_content, f2_content ... fn_content)` respectively in the directory "`root/d1/d2/.../dm"`. Note that `n >= 1` and `m >= 0`. If `m = 0`, it means the directory is just the root directory.
+
+The output is a list of groups of duplicate file paths. For each group, it contains all the file paths of the files that have the same content. A file path is a string that has the following format:
+
+- `"directory_path/file_name.txt"`
+
+**Example 1:**
+
+```
+Input: paths = ["root/a 1.txt(abcd) 2.txt(efgh)","root/c 3.txt(abcd)","root/c/d 4.txt(efgh)","root 4.txt(efgh)"]
+Output: [["root/a/2.txt","root/c/d/4.txt","root/4.txt"],["root/a/1.txt","root/c/3.txt"]]
+
+```
+
+**Example 2:**
+
+```
+Input: paths = ["root/a 1.txt(abcd) 2.txt(efgh)","root/c 3.txt(abcd)","root/c/d 4.txt(efgh)"]
+Output: [["root/a/2.txt","root/c/d/4.txt"],["root/a/1.txt","root/c/3.txt"]]
+
+```
+
+**Constraints:**
+
+- `1 <= paths.length <= 2 * 104`
+- `1 <= paths[i].length <= 3000`
+- `1 <= sum(paths[i].length) <= 5 * 105`
+- `paths[i]` consist of English letters, digits, `'/'`, `'.'`, `'('`, `')'`, and `' '`.
+- You may assume no files or directories share the same name in the same directory.
+- You may assume each given directory info represents a unique directory. A single blank space separates the directory path and file info.
+
+**Follow up:**
+
+- Imagine you are given a real file system, how will you search files? DFS or BFS?
+- If the file content is very large (GB level), how will you modify your solution?
+- If you can only read the file by 1kb each time, how will you modify your solution?
+- What is the time complexity of your modified solution? What is the most time-consuming part and memory-consuming part of it? How to optimize?
+- How to make sure the duplicated files you find are not false positive?
+
+## 题目大意
+
+给定一个目录信息列表，包括目录路径，以及该目录中的所有包含内容的文件，您需要找到文件系统中的所有重复文件组的路径。一组重复的文件至少包括二个具有完全相同内容的文件。输入列表中的单个目录信息字符串的格式如下：`"root/d1/d2/.../dm f1.txt(f1_content) f2.txt(f2_content) ... fn.txt(fn_content)"`。这意味着有 n 个文件（`f1.txt, f2.txt ... fn.txt` 的内容分别是 `f1_content, f2_content ... fn_content`）在目录 `root/d1/d2/.../dm` 下。注意：n>=1 且 m>=0。如果 m=0，则表示该目录是根目录。该输出是重复文件路径组的列表。对于每个组，它包含具有相同内容的文件的所有文件路径。文件路径是具有下列格式的字符串：`"directory_path/file_name.txt"`
+
+## 解题思路
+
+- 这一题算简单题，考察的是字符串基本操作与 map 的使用。首先通过字符串操作获取目录路径、文件名和文件内容。再使用 map 来寻找重复文件，key 是文件内容，value 是存储路径和文件名的列表。遍历每一个文件，并把它加入 map 中。最后遍历 map，如果一个键对应的值列表的长度大于 1，说明找到了重复文件，可以把这个列表加入到最终答案中。
+- 这道题有价值的地方在 **Follow up** 中。感兴趣的读者可以仔细想想以下几个问题：
+ 1. 假设您有一个真正的文件系统，您将如何搜索文件？广度搜索还是宽度搜索？
+ 2. 如果文件内容非常大（GB级别），您将如何修改您的解决方案？
+ 3. 如果每次只能读取 1 kb 的文件，您将如何修改解决方案？
+ 4. 修改后的解决方案的时间复杂度是多少？其中最耗时的部分和消耗内存的部分是什么？如何优化？
+ 5. 如何确保您发现的重复文件不是误报？
+
+## 代码
+
+```go
+package leetcode
+
+import "strings"
+
+func findDuplicate(paths []string) [][]string {
+ cache := make(map[string][]string)
+ for _, path := range paths {
+ parts := strings.Split(path, " ")
+ dir := parts[0]
+ for i := 1; i < len(parts); i++ {
+ bracketPosition := strings.IndexByte(parts[i], '(')
+ content := parts[i][bracketPosition+1 : len(parts[i])-1]
+ cache[content] = append(cache[content], dir+"/"+parts[i][:bracketPosition])
+ }
+ }
+ res := make([][]string, 0, len(cache))
+ for _, group := range cache {
+ if len(group) >= 2 {
+ res = append(res, group)
+ }
+ }
+ return res
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0600~0699/0605.Can-Place-Flowers/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0600~0699/0611.Valid-Triangle-Number/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0600~0699/0611.Valid-Triangle-Number.md b/website/content/ChapterFour/0600~0699/0611.Valid-Triangle-Number.md
new file mode 100644
index 000000000..417b341fd
--- /dev/null
+++ b/website/content/ChapterFour/0600~0699/0611.Valid-Triangle-Number.md
@@ -0,0 +1,44 @@
+# [611. Valid Triangle Number](https://leetcode.com/problems/valid-triangle-number/)
+
+## 题目
+
+Given an integer array nums, return the number of triplets chosen from the array that can make triangles if we take them as side lengths of a triangle.
+
+## 题目大意
+
+给定一个包含非负整数的数组，你的任务是统计其中可以组成三角形三条边的三元组个数。
+
+## 解题思路
+
+- 题意很简单，最容易想到的暴力解法是三重循环，暴力枚举，时间复杂度 O(n^3)。三重循环中最内层的循环可以优化，因为 k 和 i，j 存在关联性。第二层循环 j 从 i + 1 开始循环，k 从 j + 1 = i + 2 开始循环。循环累加 k 的值，直到 `nums[i] + nums[j] > nums[k]`，那么 `[nums[j + 1], nums[k - 1]]` 这个区间内的值都满足条件。满足条件的解个数增加 `k - j - 1` 个。j 再次递增 + 1，此时最内层的 k 不用从 j + 1 开始增加，只用从上次 k 开始增加即可。因为如果 `nums[i] + nums[j] > nums[k]`，如果这个 `nums[i] + nums[j + 1] > nums[m + 1]` 不等式成立，那么 m 一定不小于 k。所以内层循环 k 和 j 加起来的时间复杂度是 O(n)，最外层 i 的循环是 O(n)，这样优化以后，整体时间复杂度是 O(n^2)。
+- 可能有读者有疑问，三角形三条边的组成条件：任意两边之和大于第三边。`a + b > c`，`a + c > b`，`b + c > a`，此处为什么只判断了 `a + b > c` 呢？因为一开始进行了排序处理，使得 `a ≤ b ≤ c`，在这个前提下，`a + c > b`，`b + c > a` 是一定成立的。所以原问题便转化为只需关心 `a + b > c` 这一个不等式是否成立即可。此题的测试用例用有一种特殊情况，那就是其中一条边或者两条边长度为 0，那么 `a + b > c` 这个不等式一定不成立。综上，先排序预处理之后，只需要关心 `a + b > c` 这一个不等式是否成立即可。
+
+## 代码
+
+```go
+package leetcode
+
+import "sort"
+
+func triangleNumber(nums []int) int {
+ res := 0
+ sort.Ints(nums)
+ for i := 0; i < len(nums)-2; i++ {
+ k := i + 2
+ for j := i + 1; j < len(nums)-1 && nums[i] != 0; j++ {
+ for k < len(nums) && nums[i]+nums[j] > nums[k] {
+ k++
+ }
+ res += k - j - 1
+ }
+ }
+ return res
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0600~0699/0609.Find-Duplicate-File-in-System/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0600~0699/0617.Merge-Two-Binary-Trees/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0600~0699/0617.Merge-Two-Binary-Trees.md b/website/content/ChapterFour/0600~0699/0617.Merge-Two-Binary-Trees.md
new file mode 100644
index 000000000..8e535838c
--- /dev/null
+++ b/website/content/ChapterFour/0600~0699/0617.Merge-Two-Binary-Trees.md
@@ -0,0 +1,87 @@
+# [617. Merge Two Binary Trees](https://leetcode.com/problems/merge-two-binary-trees/)
+
+
+## 题目
+
+You are given two binary trees `root1` and `root2`.
+
+Imagine that when you put one of them to cover the other, some nodes of the two trees are overlapped while the others are not. You need to merge the two trees into a new binary tree. The merge rule is that if two nodes overlap, then sum node values up as the new value of the merged node. Otherwise, the NOT null node will be used as the node of the new tree.
+
+Return *the merged tree*.
+
+**Note:** The merging process must start from the root nodes of both trees.
+
+**Example 1:**
+
+
+
+```
+Input: root1 = [1,3,2,5], root2 = [2,1,3,null,4,null,7]
+Output: [3,4,5,5,4,null,7]
+```
+
+**Example 2:**
+
+```
+Input: root1 = [1], root2 = [1,2]
+Output: [2,2]
+```
+
+**Constraints:**
+
+- The number of nodes in both trees is in the range `[0, 2000]`.
+- `104 <= Node.val <= 104`
+
+## 题目大意
+
+给定两个二叉树，想象当你将它们中的一个覆盖到另一个上时，两个二叉树的一些节点便会重叠。你需要将他们合并为一个新的二叉树。合并的规则是如果两个节点重叠，那么将他们的值相加作为节点合并后的新值，否则不为 NULL 的节点将直接作为新二叉树的节点。
+
+## 解题思路
+
+- 简单题。采用深搜的思路，分别从根节点开始同时遍历两个二叉树，并将对应的节点进行合并。两个二叉树的对应节点可能存在以下三种情况：
+ - 如果两个二叉树的对应节点都为空，则合并后的二叉树的对应节点也为空；
+ - 如果两个二叉树的对应节点只有一个为空，则合并后的二叉树的对应节点为其中的非空节点；
+ - 如果两个二叉树的对应节点都不为空，则合并后的二叉树的对应节点的值为两个二叉树的对应节点的值之和，此时需要显性合并两个节点。
+- 对一个节点进行合并之后，还要对该节点的左右子树分别进行合并。用递归实现即可。
+
+## 代码
+
+```go
+package leetcode
+
+import (
+ "github.com/halfrost/leetcode-go/structures"
+)
+
+// TreeNode define
+type TreeNode = structures.TreeNode
+
+/**
+ * Definition for a binary tree node.
+ * type TreeNode struct {
+ * Val int
+ * Left *TreeNode
+ * Right *TreeNode
+ * }
+ */
+
+func mergeTrees(root1 *TreeNode, root2 *TreeNode) *TreeNode {
+ if root1 == nil {
+ return root2
+ }
+ if root2 == nil {
+ return root1
+ }
+ root1.Val += root2.Val
+ root1.Left = mergeTrees(root1.Left, root2.Left)
+ root1.Right = mergeTrees(root1.Right, root2.Right)
+ return root1
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0600~0699/0611.Valid-Triangle-Number/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0600~0699/0622.Design-Circular-Queue/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0600~0699/0622.Design-Circular-Queue.md b/website/content/ChapterFour/0600~0699/0622.Design-Circular-Queue.md
new file mode 100644
index 000000000..54dfe8f24
--- /dev/null
+++ b/website/content/ChapterFour/0600~0699/0622.Design-Circular-Queue.md
@@ -0,0 +1,154 @@
+# [622. Design Circular Queue](https://leetcode.com/problems/design-circular-queue/)
+
+
+## 题目
+
+Design your implementation of the circular queue. The circular queue is a linear data structure in which the operations are performed based on FIFO (First In First Out) principle and the last position is connected back to the first position to make a circle. It is also called "Ring Buffer".
+
+One of the benefits of the circular queue is that we can make use of the spaces in front of the queue. In a normal queue, once the queue becomes full, we cannot insert the next element even if there is a space in front of the queue. But using the circular queue, we can use the space to store new values.
+
+Implementation the `MyCircularQueue` class:
+
+- `MyCircularQueue(k)` Initializes the object with the size of the queue to be `k`.
+- `int Front()` Gets the front item from the queue. If the queue is empty, return `1`.
+- `int Rear()` Gets the last item from the queue. If the queue is empty, return `1`.
+- `boolean enQueue(int value)` Inserts an element into the circular queue. Return `true` if the operation is successful.
+- `boolean deQueue()` Deletes an element from the circular queue. Return `true` if the operation is successful.
+- `boolean isEmpty()` Checks whether the circular queue is empty or not.
+- `boolean isFull()` Checks whether the circular queue is full or not.
+
+**Example 1:**
+
+```
+Input
+["MyCircularQueue", "enQueue", "enQueue", "enQueue", "enQueue", "Rear", "isFull", "deQueue", "enQueue", "Rear"]
+[[3], [1], [2], [3], [4], [], [], [], [4], []]
+Output
+[null, true, true, true, false, 3, true, true, true, 4]
+
+Explanation
+MyCircularQueue myCircularQueue = new MyCircularQueue(3);
+myCircularQueue.enQueue(1); // return True
+myCircularQueue.enQueue(2); // return True
+myCircularQueue.enQueue(3); // return True
+myCircularQueue.enQueue(4); // return False
+myCircularQueue.Rear(); // return 3
+myCircularQueue.isFull(); // return True
+myCircularQueue.deQueue(); // return True
+myCircularQueue.enQueue(4); // return True
+myCircularQueue.Rear(); // return 4
+
+```
+
+**Constraints:**
+
+- `1 <= k <= 1000`
+- `0 <= value <= 1000`
+- At most `3000` calls will be made to `enQueue`, `deQueue`, `Front`, `Rear`, `isEmpty`, and `isFull`.
+
+**Follow up:**
+
+Could you solve the problem without using the built-in queue?
+
+## 题目大意
+
+设计你的循环队列实现。 循环队列是一种线性数据结构，其操作表现基于 FIFO（先进先出）原则并且队尾被连接在队首之后以形成一个循环。它也被称为“环形缓冲器”。
+
+循环队列的一个好处是我们可以利用这个队列之前用过的空间。在一个普通队列里，一旦一个队列满了，我们就不能插入下一个元素，即使在队列前面仍有空间。但是使用循环队列，我们能使用这些空间去存储新的值。
+
+你的实现应该支持如下操作：
+
+- MyCircularQueue(k): 构造器，设置队列长度为 k 。
+- Front: 从队首获取元素。如果队列为空，返回 -1 。
+- Rear: 获取队尾元素。如果队列为空，返回 -1 。
+- enQueue(value): 向循环队列插入一个元素。如果成功插入则返回真。
+- deQueue(): 从循环队列中删除一个元素。如果成功删除则返回真。
+- isEmpty(): 检查循环队列是否为空。
+- isFull(): 检查循环队列是否已满。
+
+## 解题思路
+
+- 简单题。设计一个环形队列，底层用数组实现。额外维护 4 个变量，队列的总 cap，队列当前的 size，前一元素下标 left，后一个元素下标 right。每添加一个元素便维护 left，right，size，下标需要对 cap 取余，因为超过 cap 大小之后，需要循环存储。代码实现没有难度，具体sh见下面代码。
+
+## 代码
+
+```go
+package leetcode
+
+type MyCircularQueue struct {
+ cap int
+ size int
+ queue []int
+ left int
+ right int
+}
+
+func Constructor(k int) MyCircularQueue {
+ return MyCircularQueue{cap: k, size: 0, left: 0, right: 0, queue: make([]int, k)}
+}
+
+func (this *MyCircularQueue) EnQueue(value int) bool {
+ if this.size == this.cap {
+ return false
+ }
+ this.size++
+ this.queue[this.right] = value
+ this.right++
+ this.right %= this.cap
+ return true
+
+}
+
+func (this *MyCircularQueue) DeQueue() bool {
+ if this.size == 0 {
+ return false
+ }
+ this.size--
+ this.left++
+ this.left %= this.cap
+ return true
+}
+
+func (this *MyCircularQueue) Front() int {
+ if this.size == 0 {
+ return -1
+ }
+ return this.queue[this.left]
+}
+
+func (this *MyCircularQueue) Rear() int {
+ if this.size == 0 {
+ return -1
+ }
+ if this.right == 0 {
+ return this.queue[this.cap-1]
+ }
+ return this.queue[this.right-1]
+}
+
+func (this *MyCircularQueue) IsEmpty() bool {
+ return this.size == 0
+}
+
+func (this *MyCircularQueue) IsFull() bool {
+ return this.size == this.cap
+}
+
+/**
+ * Your MyCircularQueue object will be instantiated and called as such:
+ * obj := Constructor(k);
+ * param_1 := obj.EnQueue(value);
+ * param_2 := obj.DeQueue();
+ * param_3 := obj.Front();
+ * param_4 := obj.Rear();
+ * param_5 := obj.IsEmpty();
+ * param_6 := obj.IsFull();
+ */
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0600~0699/0617.Merge-Two-Binary-Trees/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0600~0699/0623.Add-One-Row-to-Tree/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0600~0699/0623.Add-One-Row-to-Tree.md b/website/content/ChapterFour/0600~0699/0623.Add-One-Row-to-Tree.md
new file mode 100644
index 000000000..356232ccb
--- /dev/null
+++ b/website/content/ChapterFour/0600~0699/0623.Add-One-Row-to-Tree.md
@@ -0,0 +1,117 @@
+# [623. Add One Row to Tree](https://leetcode.com/problems/add-one-row-to-tree/)
+
+
+## 题目
+
+Given the root of a binary tree, then value `v` and depth `d`, you need to add a row of nodes with value `v` at the given depth `d`. The root node is at depth 1.
+
+The adding rule is: given a positive integer depth `d`, for each NOT null tree nodes `N` in depth `d-1`, create two tree nodes with value `v` as `N's` left subtree root and right subtree root. And `N's` **original left subtree** should be the left subtree of the new left subtree root, its **original right subtree** should be the right subtree of the new right subtree root. If depth `d` is 1 that means there is no depth d-1 at all, then create a tree node with value **v** as the new root of the whole original tree, and the original tree is the new root's left subtree.
+
+**Example 1:**
+
+```
+Input:
+A binary tree as following:
+ 4
+ / \
+ 2 6
+ / \ /
+ 3 1 5
+
+v = 1d = 2Output:
+ 4
+ / \
+ 1 1
+ / \
+ 2 6
+ / \ /
+ 3 1 5
+```
+
+**Example 2:**
+
+```
+Input:
+A binary tree as following:
+ 4
+ /
+ 2
+ / \
+ 3 1
+
+v = 1d = 3Output:
+ 4
+ /
+ 2
+ / \
+ 1 1
+ / \
+3 1
+```
+
+**Note:**
+
+1. The given d is in range [1, maximum depth of the given tree + 1].
+2. The given binary tree has at least one tree node.
+
+## 题目大意
+
+给定一个二叉树，根节点为第1层，深度为 1。在其第 d 层追加一行值为 v 的节点。添加规则：给定一个深度值 d （正整数），针对深度为 d-1 层的每一非空节点 N，为 N 创建两个值为 v 的左子树和右子树。将 N 原先的左子树，连接为新节点 v 的左子树；将 N 原先的右子树，连接为新节点 v 的右子树。如果 d 的值为 1，深度 d - 1 不存在，则创建一个新的根节点 v，原先的整棵树将作为 v 的左子树。
+
+## 解题思路
+
+- 这一题虽然是 Medium，实际非常简单。给二叉树添加一行，用 DFS 或者 BFS，遍历过程中记录行数，到达目标行一行，增加节点即可。不过需要注意 2 个特殊情况，特殊情况一，`d==1`，此时需要添加的行即为根节点。特殊情况二，`d>height(root)`，即要添加的行数比树还要高，这时只需要在最下层的叶子节点添加一层。时间复杂度 O(n)，空间复杂度 O(n)。
+
+## 代码
+
+```go
+package leetcode
+
+import (
+ "github.com/halfrost/leetcode-go/structures"
+)
+
+// TreeNode define
+type TreeNode = structures.TreeNode
+
+/**
+ * Definition for a binary tree node.
+ * type TreeNode struct {
+ * Val int
+ * Left *TreeNode
+ * Right *TreeNode
+ * }
+ */
+func addOneRow(root *TreeNode, v int, d int) *TreeNode {
+ if d == 1 {
+ tmp := &TreeNode{Val: v, Left: root, Right: nil}
+ return tmp
+ }
+ level := 1
+ addTreeRow(root, v, d, &level)
+ return root
+}
+
+func addTreeRow(root *TreeNode, v, d int, currLevel *int) {
+ if *currLevel == d-1 {
+ root.Left = &TreeNode{Val: v, Left: root.Left, Right: nil}
+ root.Right = &TreeNode{Val: v, Left: nil, Right: root.Right}
+ return
+ }
+ *currLevel++
+ if root.Left != nil {
+ addTreeRow(root.Left, v, d, currLevel)
+ }
+ if root.Right != nil {
+ addTreeRow(root.Right, v, d, currLevel)
+ }
+ *currLevel--
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0600~0699/0622.Design-Circular-Queue/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0600~0699/0628.Maximum-Product-of-Three-Numbers/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0600~0699/0628.Maximum-Product-of-Three-Numbers.md b/website/content/ChapterFour/0600~0699/0628.Maximum-Product-of-Three-Numbers.md
new file mode 100755
index 000000000..8eedbe1ea
--- /dev/null
+++ b/website/content/ChapterFour/0600~0699/0628.Maximum-Product-of-Three-Numbers.md
@@ -0,0 +1,110 @@
+# [628. Maximum Product of Three Numbers](https://leetcode.com/problems/maximum-product-of-three-numbers/)
+
+
+## 题目
+
+Given an integer array, find three numbers whose product is maximum and output the maximum product.
+
+**Example 1**:
+
+ Input: [1,2,3]
+ Output: 6
+
+**Example 2**:
+
+ Input: [1,2,3,4]
+ Output: 24
+
+**Note**:
+
+1. The length of the given array will be in range [3,10^4] and all elements are in the range [-1000, 1000].
+2. Multiplication of any three numbers in the input won't exceed the range of 32-bit signed integer.
+
+
+## 题目大意
+
+给定一个整型数组，在数组中找出由三个数组成的最大乘积，并输出这个乘积。
+
+
+
+
+## 解题思路
+
+
+- 给出一个数组，要求求出这个数组中任意挑 3 个数能组成的乘积最大的值。
+- 题目的 test case 数据量比较大，如果用排序的话，时间复杂度高，可以直接考虑模拟，挑出 3 个数组成乘积最大值，必然是一个正数和二个负数，或者三个正数。那么选出最大的三个数和最小的二个数，对比一下就可以求出最大值了。时间复杂度 O(n)
+
+
+
+## 代码
+
+```go
+
+package leetcode
+
+import (
+ "math"
+ "sort"
+)
+
+// 解法一 排序，时间复杂度 O(n log n)
+func maximumProduct(nums []int) int {
+ if len(nums) == 0 {
+ return 0
+ }
+ res := 1
+ if len(nums) <= 3 {
+ for i := 0; i < len(nums); i++ {
+ res = res * nums[i]
+ }
+ return res
+ }
+ sort.Ints(nums)
+ if nums[len(nums)-1] <= 0 {
+ return 0
+ }
+ return max(nums[0]*nums[1]*nums[len(nums)-1], nums[len(nums)-1]*nums[len(nums)-2]*nums[len(nums)-3])
+}
+
+func max(a int, b int) int {
+ if a > b {
+ return a
+ }
+ return b
+}
+
+// 解法二 模拟，时间复杂度 O(n)
+func maximumProduct1(nums []int) int {
+ max := make([]int, 0)
+ max = append(max, math.MinInt64, math.MinInt64, math.MinInt64)
+ min := make([]int, 0)
+ min = append(min, math.MaxInt64, math.MaxInt64)
+ for _, num := range nums {
+ if num > max[0] {
+ max[0], max[1], max[2] = num, max[0], max[1]
+ } else if num > max[1] {
+ max[1], max[2] = num, max[1]
+ } else if num > max[2] {
+ max[2] = num
+ }
+ if num < min[0] {
+ min[0], min[1] = num, min[0]
+ } else if num < min[1] {
+ min[1] = num
+ }
+ }
+ maxProduct1, maxProduct2 := min[0]*min[1]*max[0], max[0]*max[1]*max[2]
+ if maxProduct1 > maxProduct2 {
+ return maxProduct1
+ }
+ return maxProduct2
+}
+
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0600~0699/0623.Add-One-Row-to-Tree/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0600~0699/0630.Course-Schedule-III/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0600~0699/0630.Course-Schedule-III.md b/website/content/ChapterFour/0600~0699/0630.Course-Schedule-III.md
new file mode 100644
index 000000000..2179af424
--- /dev/null
+++ b/website/content/ChapterFour/0600~0699/0630.Course-Schedule-III.md
@@ -0,0 +1,103 @@
+# [630. Course Schedule III](https://leetcode.com/problems/course-schedule-iii/)
+
+## 题目
+
+There are `n` different online courses numbered from `1` to `n`. You are given an array `courses` where `courses[i] = [durationi, lastDayi]` indicate that the `ith` course should be taken **continuously** for `durationi` days and must be finished before or on `lastDayi`.
+
+You will start on the `1st` day and you cannot take two or more courses simultaneously.
+
+Return *the maximum number of courses that you can take*.
+
+**Example 1:**
+
+```
+Input: courses = [[100,200],[200,1300],[1000,1250],[2000,3200]]
+Output: 3
+Explanation:
+There are totally 4 courses, but you can take 3 courses at most:
+First, take the 1st course, it costs 100 days so you will finish it on the 100th day, and ready to take the next course on the 101st day.
+Second, take the 3rd course, it costs 1000 days so you will finish it on the 1100th day, and ready to take the next course on the 1101st day.
+Third, take the 2nd course, it costs 200 days so you will finish it on the 1300th day.
+The 4th course cannot be taken now, since you will finish it on the 3300th day, which exceeds the closed date.
+
+```
+
+**Example 2:**
+
+```
+Input: courses = [[1,2]]
+Output: 1
+
+```
+
+**Example 3:**
+
+```
+Input: courses = [[3,2],[4,3]]
+Output: 0
+
+```
+
+**Constraints:**
+
+- `1 <= courses.length <= 104`
+- `1 <= durationi, lastDayi <= 104`
+
+## 题目大意
+
+这里有 n 门不同的在线课程，他们按从 1 到 n 编号。每一门课程有一定的持续上课时间（课程时间）t 以及关闭时间第 d 天。一门课要持续学习 t 天直到第 d 天时要完成，你将会从第 1 天开始。给出 n 个在线课程用 (t, d) 对表示。你的任务是找出最多可以修几门课。
+
+## 解题思路
+
+- 一般选课，任务的题目会涉及排序 + 贪心。此题同样如此。最多修几门课，采用贪心的思路。先将课程结束时间从小到大排序，优先选择结束时间靠前的课程，这样留给后面课程的时间越多，便可以修更多的课。对排好序的课程从前往后选课，不断累积时间。如果选择修当前课程，但是会超时，这时改调整了。对于已经选择的课程，都加入到最大堆中，遇到需要调整时，比较当前待考虑的课程时长是否比(堆中)已经选择课中时长最长的课时长短，即堆顶的课程时长短，剔除 pop 它，再选择这门时长短的课，并加入最大堆中。并更新累积时间。一层循环扫完所有课程，最终最大堆中包含课程的数目便是最多可以修的课程数。
+
+## 代码
+
+```go
+package leetcode
+
+import (
+ "container/heap"
+ "sort"
+)
+
+func scheduleCourse(courses [][]int) int {
+ sort.Slice(courses, func(i, j int) bool {
+ return courses[i][1] < courses[j][1]
+ })
+ maxHeap, time := &Schedule{}, 0
+ heap.Init(maxHeap)
+ for _, c := range courses {
+ if time+c[0] <= c[1] {
+ time += c[0]
+ heap.Push(maxHeap, c[0])
+ } else if (*maxHeap).Len() > 0 && (*maxHeap)[0] > c[0] {
+ time -= heap.Pop(maxHeap).(int) - c[0]
+ heap.Push(maxHeap, c[0])
+ }
+ }
+ return (*maxHeap).Len()
+}
+
+type Schedule []int
+
+func (s Schedule) Len() int { return len(s) }
+func (s Schedule) Less(i, j int) bool { return s[i] > s[j] }
+func (s Schedule) Swap(i, j int) { s[i], s[j] = s[j], s[i] }
+func (s *Schedule) Pop() interface{} {
+ n := len(*s)
+ t := (*s)[n-1]
+ *s = (*s)[:n-1]
+ return t
+}
+func (s *Schedule) Push(x interface{}) {
+ *s = append(*s, x.(int))
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0600~0699/0628.Maximum-Product-of-Three-Numbers/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0600~0699/0632.Smallest-Range-Covering-Elements-from-K-Lists/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0632.Smallest-Range-Covering-Elements-from-K-Lists.md b/website/content/ChapterFour/0600~0699/0632.Smallest-Range-Covering-Elements-from-K-Lists.md
similarity index 90%
rename from website/content/ChapterFour/0632.Smallest-Range-Covering-Elements-from-K-Lists.md
rename to website/content/ChapterFour/0600~0699/0632.Smallest-Range-Covering-Elements-from-K-Lists.md
index b1187be98..def61bb38 100755
--- a/website/content/ChapterFour/0632.Smallest-Range-Covering-Elements-from-K-Lists.md
+++ b/website/content/ChapterFour/0600~0699/0632.Smallest-Range-Covering-Elements-from-K-Lists.md
@@ -110,4 +110,11 @@ func (p SortByVal) Less(i, j int) bool {
return p.elements[i].val < p.elements[j].val
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0600~0699/0630.Course-Schedule-III/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0600~0699/0633.Sum-of-Square-Numbers/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0600~0699/0633.Sum-of-Square-Numbers.md b/website/content/ChapterFour/0600~0699/0633.Sum-of-Square-Numbers.md
new file mode 100755
index 000000000..de723caef
--- /dev/null
+++ b/website/content/ChapterFour/0600~0699/0633.Sum-of-Square-Numbers.md
@@ -0,0 +1,60 @@
+# [633. Sum of Square Numbers](https://leetcode.com/problems/sum-of-square-numbers/)
+
+
+## 题目
+
+Given a non-negative integer `c`, your task is to decide whether there're two integers `a` and `b` such that a^2 + b^2 = c.
+
+**Example 1**:
+
+ Input: 5
+ Output: True
+ Explanation: 1 * 1 + 2 * 2 = 5
+
+**Example 2**:
+
+ Input: 3
+ Output: False
+
+
+## 题目大意
+
+给定一个非负整数 c ，你要判断是否存在两个整数 a 和 b，使得 a^2 + b^2 = c。
+
+
+## 解题思路
+
+- 给出一个数，要求判断这个数能否由由 2 个完全平方数组成。能则输出 true，不能则输出 false。
+- 可以用二分搜索来解答这道题。判断题意，依次计算 `low * low + high * high` 和 c 是否相等。从 [0, sqrt(n)] 区间内进行二分，若能找到则返回 true，找不到就返回 false 。
+
+
+## 代码
+
+```go
+
+package leetcode
+
+import "math"
+
+func judgeSquareSum(c int) bool {
+ low, high := 0, int(math.Sqrt(float64(c)))
+ for low <= high {
+ if low*low+high*high < c {
+ low++
+ } else if low*low+high*high > c {
+ high--
+ } else {
+ return true
+ }
+ }
+ return false
+}
+
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0600~0699/0632.Smallest-Range-Covering-Elements-from-K-Lists/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0600~0699/0636.Exclusive-Time-of-Functions/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0636.Exclusive-Time-of-Functions.md b/website/content/ChapterFour/0600~0699/0636.Exclusive-Time-of-Functions.md
similarity index 89%
rename from website/content/ChapterFour/0636.Exclusive-Time-of-Functions.md
rename to website/content/ChapterFour/0600~0699/0636.Exclusive-Time-of-Functions.md
index 71458a892..ebe7628c7 100755
--- a/website/content/ChapterFour/0636.Exclusive-Time-of-Functions.md
+++ b/website/content/ChapterFour/0600~0699/0636.Exclusive-Time-of-Functions.md
@@ -97,4 +97,11 @@ func exclusiveTime(n int, logs []string) []int {
return res
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0600~0699/0633.Sum-of-Square-Numbers/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0600~0699/0637.Average-of-Levels-in-Binary-Tree/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0637.Average-of-Levels-in-Binary-Tree.md b/website/content/ChapterFour/0600~0699/0637.Average-of-Levels-in-Binary-Tree.md
similarity index 80%
rename from website/content/ChapterFour/0637.Average-of-Levels-in-Binary-Tree.md
rename to website/content/ChapterFour/0600~0699/0637.Average-of-Levels-in-Binary-Tree.md
index 34b0c41aa..256e1e0b5 100644
--- a/website/content/ChapterFour/0637.Average-of-Levels-in-Binary-Tree.md
+++ b/website/content/ChapterFour/0600~0699/0637.Average-of-Levels-in-Binary-Tree.md
@@ -82,4 +82,11 @@ func averageOfLevels(root *TreeNode) []float64 {
return res
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0600~0699/0636.Exclusive-Time-of-Functions/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0600~0699/0638.Shopping-Offers/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0638.Shopping-Offers.md b/website/content/ChapterFour/0600~0699/0638.Shopping-Offers.md
similarity index 93%
rename from website/content/ChapterFour/0638.Shopping-Offers.md
rename to website/content/ChapterFour/0600~0699/0638.Shopping-Offers.md
index cf389acb3..292f03ddf 100644
--- a/website/content/ChapterFour/0638.Shopping-Offers.md
+++ b/website/content/ChapterFour/0600~0699/0638.Shopping-Offers.md
@@ -126,4 +126,11 @@ func dfsShoppingOffers(price []int, special [][]int, needs []int, pay int, res *
dfsShoppingOffers(price, special[1:], newNeeds, pay+special[0][len(price)], res)
dfsShoppingOffers(price, special[1:], needs, pay, res)
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0600~0699/0637.Average-of-Levels-in-Binary-Tree/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0600~0699/0643.Maximum-Average-Subarray-I/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0600~0699/0643.Maximum-Average-Subarray-I.md b/website/content/ChapterFour/0600~0699/0643.Maximum-Average-Subarray-I.md
new file mode 100644
index 000000000..63ec049f0
--- /dev/null
+++ b/website/content/ChapterFour/0600~0699/0643.Maximum-Average-Subarray-I.md
@@ -0,0 +1,59 @@
+# [643. Maximum Average Subarray I](https://leetcode.com/problems/maximum-average-subarray-i/)
+
+## 题目
+
+Given an array consisting of `n` integers, find the contiguous subarray of given length `k` that has the maximum average value. And you need to output the maximum average value.
+
+**Example 1:**
+
+```
+Input: [1,12,-5,-6,50,3], k = 4
+Output: 12.75
+Explanation: Maximum average is (12-5-6+50)/4 = 51/4 = 12.75
+```
+
+**Note:**
+
+1. 1 <= `k` <= `n` <= 30,000.
+2. Elements of the given array will be in the range [-10,000, 10,000].
+
+## 题目大意
+
+给定 n 个整数，找出平均数最大且长度为 k 的连续子数组，并输出该最大平均数。
+
+## 解题思路
+
+- 简单题。循环一次，扫描数组过程中累加窗口大小为 k 的元素值。不断更新这个最大值。循环结束求出平均值即可。
+
+## 代码
+
+```go
+package leetcode
+
+func findMaxAverage(nums []int, k int) float64 {
+ sum := 0
+ for _, v := range nums[:k] {
+ sum += v
+ }
+ maxSum := sum
+ for i := k; i < len(nums); i++ {
+ sum = sum - nums[i-k] + nums[i]
+ maxSum = max(maxSum, sum)
+ }
+ return float64(maxSum) / float64(k)
+}
+
+func max(a, b int) int {
+ if a > b {
+ return a
+ }
+ return b
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0600~0699/0638.Shopping-Offers/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0600~0699/0645.Set-Mismatch/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0645.Set-Mismatch.md b/website/content/ChapterFour/0600~0699/0645.Set-Mismatch.md
similarity index 82%
rename from website/content/ChapterFour/0645.Set-Mismatch.md
rename to website/content/ChapterFour/0600~0699/0645.Set-Mismatch.md
index 9236fd4c2..93d481833 100755
--- a/website/content/ChapterFour/0645.Set-Mismatch.md
+++ b/website/content/ChapterFour/0600~0699/0645.Set-Mismatch.md
@@ -59,4 +59,11 @@ func findErrorNums(nums []int) []int {
return res
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0600~0699/0643.Maximum-Average-Subarray-I/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0600~0699/0647.Palindromic-Substrings/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0600~0699/0647.Palindromic-Substrings.md b/website/content/ChapterFour/0600~0699/0647.Palindromic-Substrings.md
new file mode 100644
index 000000000..10eadcfae
--- /dev/null
+++ b/website/content/ChapterFour/0600~0699/0647.Palindromic-Substrings.md
@@ -0,0 +1,71 @@
+# [647. Palindromic Substrings](https://leetcode.com/problems/palindromic-substrings/)
+
+
+## 题目
+
+Given a string, your task is to count how many palindromic substrings in this string.
+
+The substrings with different start indexes or end indexes are counted as different substrings even they consist of same characters.
+
+**Example 1:**
+
+```
+Input: "abc"
+Output: 3
+Explanation: Three palindromic strings: "a", "b", "c".
+```
+
+**Example 2:**
+
+```
+Input: "aaa"
+Output: 6
+Explanation: Six palindromic strings: "a", "a", "a", "aa", "aa", "aaa".
+```
+
+**Note:**
+
+1. The input string length won't exceed 1000.
+
+## 题目大意
+
+给定一个字符串，你的任务是计算这个字符串中有多少个回文子串。具有不同开始位置或结束位置的子串，即使是由相同的字符组成，也会被视作不同的子串。
+
+## 解题思路
+
+- 暴力解法，从左往右扫一遍字符串，以每个字符做轴，用中心扩散法，依次遍历计数回文子串。
+
+## 代码
+
+```go
+package leetcode
+
+func countSubstrings(s string) int {
+ res := 0
+ for i := 0; i < len(s); i++ {
+ res += countPalindrome(s, i, i)
+ res += countPalindrome(s, i, i+1)
+ }
+ return res
+}
+
+func countPalindrome(s string, left, right int) int {
+ res := 0
+ for left >= 0 && right < len(s) {
+ if s[left] != s[right] {
+ break
+ }
+ left--
+ right++
+ res++
+ }
+ return res
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0600~0699/0645.Set-Mismatch/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0600~0699/0648.Replace-Words/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0648.Replace-Words.md b/website/content/ChapterFour/0600~0699/0648.Replace-Words.md
similarity index 88%
rename from website/content/ChapterFour/0648.Replace-Words.md
rename to website/content/ChapterFour/0600~0699/0648.Replace-Words.md
index 17614c9c6..e16a17162 100755
--- a/website/content/ChapterFour/0648.Replace-Words.md
+++ b/website/content/ChapterFour/0600~0699/0648.Replace-Words.md
@@ -108,4 +108,11 @@ func replaceWords1(dict []string, sentence string) string {
return strings.Join(result, " ")
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0600~0699/0647.Palindromic-Substrings/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0600~0699/0653.Two-Sum-IV-Input-is-a-BST/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0600~0699/0653.Two-Sum-IV-Input-is-a-BST.md b/website/content/ChapterFour/0600~0699/0653.Two-Sum-IV-Input-is-a-BST.md
new file mode 100755
index 000000000..4d13db566
--- /dev/null
+++ b/website/content/ChapterFour/0600~0699/0653.Two-Sum-IV-Input-is-a-BST.md
@@ -0,0 +1,82 @@
+# [653. Two Sum IV - Input is a BST](https://leetcode.com/problems/two-sum-iv-input-is-a-bst/)
+
+## 题目
+
+Given a Binary Search Tree and a target number, return true if there exist two elements in the BST such that their sum is equal to the given target.
+
+**Example 1**:
+
+ Input:
+ 5
+ / \
+ 3 6
+ / \ \
+ 2 4 7
+
+ Target = 9
+
+ Output: True
+
+**Example 2**:
+
+ Input:
+ 5
+ / \
+ 3 6
+ / \ \
+ 2 4 7
+
+ Target = 28
+
+ Output: False
+
+
+## 题目大意
+
+给定一个二叉搜索树和一个目标结果，如果 BST 中存在两个元素且它们的和等于给定的目标结果，则返回 true。
+
+## 解题思路
+
+
+- 在树中判断是否存在 2 个数的和是 sum。
+- 这一题是 two sum 问题的变形题，只不过题目背景是在 BST 上处理的。处理思路大体一致，用 map 记录已经访问过的节点值。边遍历树边查看 map 里面是否有 sum 的另外一半。
+
+
+## 代码
+
+```go
+
+package leetcode
+
+/**
+ * Definition for a binary tree node.
+ * type TreeNode struct {
+ * Val int
+ * Left *TreeNode
+ * Right *TreeNode
+ * }
+ */
+func findTarget(root *TreeNode, k int) bool {
+ m := make(map[int]int, 0)
+ return findTargetDFS(root, k, m)
+}
+
+func findTargetDFS(root *TreeNode, k int, m map[int]int) bool {
+ if root == nil {
+ return false
+ }
+ if _, ok := m[k-root.Val]; ok {
+ return ok
+ }
+ m[root.Val]++
+ return findTargetDFS(root.Left, k, m) || findTargetDFS(root.Right, k, m)
+}
+
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0600~0699/0648.Replace-Words/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0600~0699/0658.Find-K-Closest-Elements/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0658.Find-K-Closest-Elements.md b/website/content/ChapterFour/0600~0699/0658.Find-K-Closest-Elements.md
similarity index 87%
rename from website/content/ChapterFour/0658.Find-K-Closest-Elements.md
rename to website/content/ChapterFour/0600~0699/0658.Find-K-Closest-Elements.md
index b55ced18a..4fe0f821a 100755
--- a/website/content/ChapterFour/0658.Find-K-Closest-Elements.md
+++ b/website/content/ChapterFour/0600~0699/0658.Find-K-Closest-Elements.md
@@ -79,4 +79,11 @@ func findClosestElements1(arr []int, k int, x int) []int {
return arr[low : low+k]
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0600~0699/0653.Two-Sum-IV-Input-is-a-BST/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0600~0699/0661.Image-Smoother/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0661.Image-Smoother.md b/website/content/ChapterFour/0600~0699/0661.Image-Smoother.md
similarity index 86%
rename from website/content/ChapterFour/0661.Image-Smoother.md
rename to website/content/ChapterFour/0600~0699/0661.Image-Smoother.md
index 03fde6bf7..048d5da9d 100644
--- a/website/content/ChapterFour/0661.Image-Smoother.md
+++ b/website/content/ChapterFour/0600~0699/0661.Image-Smoother.md
@@ -108,4 +108,11 @@ func smooth(x, y int, M [][]int) int {
return sum / count
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0600~0699/0658.Find-K-Closest-Elements/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0600~0699/0662.Maximum-Width-of-Binary-Tree/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0662.Maximum-Width-of-Binary-Tree.md b/website/content/ChapterFour/0600~0699/0662.Maximum-Width-of-Binary-Tree.md
similarity index 93%
rename from website/content/ChapterFour/0662.Maximum-Width-of-Binary-Tree.md
rename to website/content/ChapterFour/0600~0699/0662.Maximum-Width-of-Binary-Tree.md
index d60af0250..d7257d840 100755
--- a/website/content/ChapterFour/0662.Maximum-Width-of-Binary-Tree.md
+++ b/website/content/ChapterFour/0600~0699/0662.Maximum-Width-of-Binary-Tree.md
@@ -149,4 +149,11 @@ func widthOfBinaryTree(root *TreeNode) int {
return res
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0600~0699/0661.Image-Smoother/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0600~0699/0665.Non-decreasing-Array/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0600~0699/0665.Non-decreasing-Array.md b/website/content/ChapterFour/0600~0699/0665.Non-decreasing-Array.md
new file mode 100644
index 000000000..a698b301f
--- /dev/null
+++ b/website/content/ChapterFour/0600~0699/0665.Non-decreasing-Array.md
@@ -0,0 +1,66 @@
+# [665. Non-decreasing Array](https://leetcode.com/problems/non-decreasing-array/)
+
+## 题目
+
+Given an array `nums` with `n` integers, your task is to check if it could become non-decreasing by modifying **at most one element**.
+
+We define an array is non-decreasing if `nums[i] <= nums[i + 1]` holds for every `i` (**0-based**) such that (`0 <= i <= n - 2`).
+
+**Example 1:**
+
+```
+Input: nums = [4,2,3]
+Output: true
+Explanation: You could modify the first 4 to 1 to get a non-decreasing array.
+```
+
+**Example 2:**
+
+```
+Input: nums = [4,2,1]
+Output: false
+Explanation: You can't get a non-decreasing array by modify at most one element.
+```
+
+**Constraints:**
+
+- `n == nums.length`
+- `1 <= n <= 104`
+- `-10^5 <= nums[i] <= 10^5`
+
+## 题目大意
+
+给你一个长度为 n 的整数数组，请你判断在 最多 改变 1 个元素的情况下，该数组能否变成一个非递减数列。我们是这样定义一个非递减数列的： 对于数组中任意的 i (0 <= i <= n-2)，总满足 nums[i] <= nums[i + 1]。
+
+## 解题思路
+
+- 简单题。循环扫描数组，找到 `nums[i] > nums[i+1]` 这种递减组合。一旦这种组合超过 2 组，直接返回 false。找到第一组递减组合，需要手动调节一次。如果 `nums[i + 1] < nums[i - 1]`，就算交换 `nums[i+1]` 和 `nums[i]`，交换结束，`nums[i - 1]` 仍然可能大于 `nums[i + 1]`，不满足题意。正确的做法应该是让较小的那个数变大，即 `nums[i + 1] = nums[i]`。两个元素相等满足非递减的要求。
+
+## 代码
+
+```go
+package leetcode
+
+func checkPossibility(nums []int) bool {
+ count := 0
+ for i := 0; i < len(nums)-1; i++ {
+ if nums[i] > nums[i+1] {
+ count++
+ if count > 1 {
+ return false
+ }
+ if i > 0 && nums[i+1] < nums[i-1] {
+ nums[i+1] = nums[i]
+ }
+ }
+ }
+ return true
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0600~0699/0662.Maximum-Width-of-Binary-Tree/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0600~0699/0667.Beautiful-Arrangement-II/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0600~0699/0667.Beautiful-Arrangement-II.md b/website/content/ChapterFour/0600~0699/0667.Beautiful-Arrangement-II.md
new file mode 100644
index 000000000..7417a3ec8
--- /dev/null
+++ b/website/content/ChapterFour/0600~0699/0667.Beautiful-Arrangement-II.md
@@ -0,0 +1,69 @@
+# [667. Beautiful Arrangement II](https://leetcode.com/problems/beautiful-arrangement-ii/)
+
+
+## 题目
+
+Given two integers `n` and `k`, you need to construct a list which contains `n` different positive integers ranging from `1` to `n` and obeys the following requirement:Suppose this list is [a1, a2, a3, ... , an], then the list [|a1 - a2|, |a2 - a3|, |a3 - a4|, ... , |an-1 - an|] has exactly `k` distinct integers.
+
+If there are multiple answers, print any of them.
+
+**Example 1:**
+
+```
+Input: n = 3, k = 1
+Output: [1, 2, 3]
+Explanation: The [1, 2, 3] has three different positive integers ranging from 1 to 3, and the [1, 1] has exactly 1 distinct integer: 1.
+```
+
+**Example 2:**
+
+```
+Input: n = 3, k = 2
+Output: [1, 3, 2]
+Explanation: The [1, 3, 2] has three different positive integers ranging from 1 to 3, and the [2, 1] has exactly 2 distinct integers: 1 and 2.
+```
+
+**Note:**
+
+1. The `n` and `k` are in the range 1 <= k < n <= 10^4.
+
+## 题目大意
+
+给定两个整数 n 和 k，你需要实现一个数组，这个数组包含从 1 到 n 的 n 个不同整数，同时满足以下条件：
+
+- 如果这个数组是 [a1, a2, a3, ... , an] ，那么数组 [|a1 - a2|, |a2 - a3|, |a3 - a4|, ... , |an-1 - an|] 中应该有且仅有 k 个不同整数；.
+- 如果存在多种答案，你只需实现并返回其中任意一种.
+
+## 解题思路
+
+- 先考虑 `k` 最大值的情况。如果把末尾的较大值依次插入到前面的较小值中，形成 `[1，n，2，n-1，3，n-2，……]`，这样排列 `k` 能取到最大值 `n-1` 。`k` 最小值的情况是 `[1，2，3，4，……，n]`，`k` 取到的最小值是 1。那么 `k` 在 `[1，n-1]` 之间取值，该怎么排列呢？先顺序排列 `[1，2，3，4，……，n-k-1]`，这里有 `n-k-1` 个数，可以形成唯一一种差值。剩下 `k+1` 个数，形成 `k-1` 种差值。
+- 这又回到了 `k` 最大值的取法了。`k` 取最大值的情况是 `n` 个数，形成 `n-1` 个不同种的差值。现在 `k+1` 个数，需要形成 `k` 种不同的差值。两者是同一个问题。那么剩下 `k` 个数的排列方法是 `[n-k，n-k+1，…，n]`，这里有 `k` 个数，注意代码实现时，注意 `k` 的奇偶性，如果 `k` 是奇数，“对半穿插”以后，正好匹配完，如果 `k` 是偶数，对半处的数 `n-k+(k+1)/2`，最后还需要单独加入到排列中。
+- 可能有读者会问了，前面生成了 1 种差值，后面这部分又生产了 `k` 种差值，加起来不是 `k + 1` 种差值了么？这种理解是错误的。后面这段最后 2 个数字是 `n-k+(k+1)/2-1` 和 `n-k+(k+1)/2`，它们两者的差值是 1，和第一段构造的排列差值是相同的，都是 1。所以第一段构造了 1 种差值，第二段虽然构造了 `k` 种，但是需要去掉两段重复的差值 1，所以最终差值种类还是 `1 + k - 1 = k` 种。
+
+## 代码
+
+```go
+package leetcode
+
+func constructArray(n int, k int) []int {
+ res := []int{}
+ for i := 0; i < n-k-1; i++ {
+ res = append(res, i+1)
+ }
+ for i := n - k; i < n-k+(k+1)/2; i++ {
+ res = append(res, i)
+ res = append(res, 2*n-k-i)
+ }
+ if k%2 == 0 {
+ res = append(res, n-k+(k+1)/2)
+ }
+ return res
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0600~0699/0665.Non-decreasing-Array/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0600~0699/0668.Kth-Smallest-Number-in-Multiplication-Table/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0668.Kth-Smallest-Number-in-Multiplication-Table.md b/website/content/ChapterFour/0600~0699/0668.Kth-Smallest-Number-in-Multiplication-Table.md
similarity index 85%
rename from website/content/ChapterFour/0668.Kth-Smallest-Number-in-Multiplication-Table.md
rename to website/content/ChapterFour/0600~0699/0668.Kth-Smallest-Number-in-Multiplication-Table.md
index 491973cba..0dbd4cfdb 100755
--- a/website/content/ChapterFour/0668.Kth-Smallest-Number-in-Multiplication-Table.md
+++ b/website/content/ChapterFour/0600~0699/0668.Kth-Smallest-Number-in-Multiplication-Table.md
@@ -81,4 +81,11 @@ func counterKthNum(m, n, mid int) int {
return count
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0600~0699/0667.Beautiful-Arrangement-II/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0600~0699/0669.Trim-a-Binary-Search-Tree/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0600~0699/0669.Trim-a-Binary-Search-Tree.md b/website/content/ChapterFour/0600~0699/0669.Trim-a-Binary-Search-Tree.md
new file mode 100644
index 000000000..12b162fbc
--- /dev/null
+++ b/website/content/ChapterFour/0600~0699/0669.Trim-a-Binary-Search-Tree.md
@@ -0,0 +1,107 @@
+# [669. Trim a Binary Search Tree](https://leetcode.com/problems/trim-a-binary-search-tree/)
+
+
+## 题目
+
+Given the `root` of a binary search tree and the lowest and highest boundaries as `low` and `high`, trim the tree so that all its elements lies in `[low, high]`. Trimming the tree should **not** change the relative structure of the elements that will remain in the tree (i.e., any node's descendant should remain a descendant). It can be proven that there is a **unique answer**.
+
+Return *the root of the trimmed binary search tree*. Note that the root may change depending on the given bounds.
+
+**Example 1:**
+
+
+
+```
+Input: root = [1,0,2], low = 1, high = 2
+Output: [1,null,2]
+```
+
+**Example 2:**
+
+
+
+```
+Input: root = [3,0,4,null,2,null,null,1], low = 1, high = 3
+Output: [3,2,null,1]
+```
+
+**Example 3:**
+
+```
+Input: root = [1], low = 1, high = 2
+Output: [1]
+```
+
+**Example 4:**
+
+```
+Input: root = [1,null,2], low = 1, high = 3
+Output: [1,null,2]
+```
+
+**Example 5:**
+
+```
+Input: root = [1,null,2], low = 2, high = 4
+Output: [2]
+```
+
+**Constraints:**
+
+- The number of nodes in the tree in the range `[1, 10^4]`.
+- `0 <= Node.val <= 10^4`
+- The value of each node in the tree is **unique**.
+- `root` is guaranteed to be a valid binary search tree.
+- `0 <= low <= high <= 10^4`
+
+## 题目大意
+
+给你二叉搜索树的根节点 root ，同时给定最小边界low 和最大边界 high。通过修剪二叉搜索树，使得所有节点的值在[low, high]中。修剪树不应该改变保留在树中的元素的相对结构（即，如果没有被移除，原有的父代子代关系都应当保留）。 可以证明，存在唯一的答案。所以结果应当返回修剪好的二叉搜索树的新的根节点。注意，根节点可能会根据给定的边界发生改变。
+
+## 解题思路
+
+- 这一题考察二叉搜索树中的递归遍历。递归遍历二叉搜索树每个结点，根据有序性，当前结点如果比 high 大，那么当前结点的右子树全部修剪掉，再递归修剪左子树；当前结点如果比 low 小，那么当前结点的左子树全部修剪掉，再递归修剪右子树。处理完越界的情况，剩下的情况都在区间内，分别递归修剪左子树和右子树即可。
+
+## 代码
+
+```go
+package leetcode
+
+import (
+ "github.com/halfrost/leetcode-go/structures"
+)
+
+// TreeNode define
+type TreeNode = structures.TreeNode
+
+/**
+ * Definition for a binary tree node.
+ * type TreeNode struct {
+ * Val int
+ * Left *TreeNode
+ * Right *TreeNode
+ * }
+ */
+
+func trimBST(root *TreeNode, low int, high int) *TreeNode {
+ if root == nil {
+ return root
+ }
+ if root.Val > high {
+ return trimBST(root.Left, low, high)
+ }
+ if root.Val < low {
+ return trimBST(root.Right, low, high)
+ }
+ root.Left = trimBST(root.Left, low, high)
+ root.Right = trimBST(root.Right, low, high)
+ return root
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0600~0699/0668.Kth-Smallest-Number-in-Multiplication-Table/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0600~0699/0674.Longest-Continuous-Increasing-Subsequence/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0600~0699/0674.Longest-Continuous-Increasing-Subsequence.md b/website/content/ChapterFour/0600~0699/0674.Longest-Continuous-Increasing-Subsequence.md
new file mode 100644
index 000000000..016217491
--- /dev/null
+++ b/website/content/ChapterFour/0600~0699/0674.Longest-Continuous-Increasing-Subsequence.md
@@ -0,0 +1,76 @@
+# [674. Longest Continuous Increasing Subsequence](https://leetcode.com/problems/longest-continuous-increasing-subsequence/)
+
+
+## 题目
+
+Given an unsorted array of integers `nums`, return *the length of the longest **continuous increasing subsequence** (i.e. subarray)*. The subsequence must be **strictly** increasing.
+
+A **continuous increasing subsequence** is defined by two indices `l` and `r` (`l < r`) such that it is `[nums[l], nums[l + 1], ..., nums[r - 1], nums[r]]` and for each `l <= i < r`, `nums[i] < nums[i + 1]`.
+
+**Example 1:**
+
+```
+Input: nums = [1,3,5,4,7]
+Output: 3
+Explanation: The longest continuous increasing subsequence is [1,3,5] with length 3.
+Even though [1,3,5,7] is an increasing subsequence, it is not continuous as elements 5 and 7 are separated by element
+4.
+```
+
+**Example 2:**
+
+```
+Input: nums = [2,2,2,2,2]
+Output: 1
+Explanation: The longest continuous increasing subsequence is [2] with length 1. Note that it must be strictly
+increasing.
+```
+
+**Constraints:**
+
+- `0 <= nums.length <= 10^4`
+- `10^9 <= nums[i] <= 10^9`
+
+## 题目大意
+
+给定一个未经排序的整数数组，找到最长且 连续递增的子序列，并返回该序列的长度。连续递增的子序列 可以由两个下标 l 和 r（l < r）确定，如果对于每个 l <= i < r，都有 nums[i] < nums[i + 1] ，那么子序列 [nums[l], nums[l + 1], ..., nums[r - 1], nums[r]] 就是连续递增子序列。
+
+## 解题思路
+
+- 简单题。这一题和第 128 题有区别。这一题要求子序列必须是连续下标，所以变简单了。扫描一遍数组，记下连续递增序列的长度，动态维护这个最大值，最后输出即可。
+
+## 代码
+
+```go
+package leetcode
+
+func findLengthOfLCIS(nums []int) int {
+ if len(nums) == 0 {
+ return 0
+ }
+ res, length := 1, 1
+ for i := 1; i < len(nums); i++ {
+ if nums[i] > nums[i-1] {
+ length++
+ } else {
+ res = max(res, length)
+ length = 1
+ }
+ }
+ return max(res, length)
+}
+
+func max(a, b int) int {
+ if a > b {
+ return a
+ }
+ return b
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0600~0699/0669.Trim-a-Binary-Search-Tree/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0600~0699/0676.Implement-Magic-Dictionary/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0676.Implement-Magic-Dictionary.md b/website/content/ChapterFour/0600~0699/0676.Implement-Magic-Dictionary.md
similarity index 88%
rename from website/content/ChapterFour/0676.Implement-Magic-Dictionary.md
rename to website/content/ChapterFour/0600~0699/0676.Implement-Magic-Dictionary.md
index 4ce7d05cd..74961388c 100755
--- a/website/content/ChapterFour/0676.Implement-Magic-Dictionary.md
+++ b/website/content/ChapterFour/0600~0699/0676.Implement-Magic-Dictionary.md
@@ -84,4 +84,11 @@ func (this *MagicDictionary) Search(word string) bool {
* param_2 := obj.Search(word);
*/
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0600~0699/0674.Longest-Continuous-Increasing-Subsequence/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0600~0699/0677.Map-Sum-Pairs/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0600~0699/0677.Map-Sum-Pairs.md b/website/content/ChapterFour/0600~0699/0677.Map-Sum-Pairs.md
new file mode 100644
index 000000000..2fa80a36b
--- /dev/null
+++ b/website/content/ChapterFour/0600~0699/0677.Map-Sum-Pairs.md
@@ -0,0 +1,107 @@
+# [677. Map Sum Pairs](https://leetcode.com/problems/map-sum-pairs/)
+
+
+## 题目
+
+Design a map that allows you to do the following:
+
+- Maps a string key to a given value.
+- Returns the sum of the values that have a key with a prefix equal to a given string.
+
+Implement the `MapSum` class:
+
+- `MapSum()` Initializes the `MapSum` object.
+- `void insert(String key, int val)` Inserts the `key-val` pair into the map. If the `key` already existed, the original `key-value` pair will be overridden to the new one.
+- `int sum(string prefix)` Returns the sum of all the pairs' value whose `key` starts with the `prefix`.
+
+**Example 1:**
+
+```
+Input
+["MapSum", "insert", "sum", "insert", "sum"]
+[[], ["apple", 3], ["ap"], ["app", 2], ["ap"]]
+Output
+[null, null, 3, null, 5]
+
+Explanation
+MapSum mapSum = new MapSum();
+mapSum.insert("apple", 3);
+mapSum.sum("ap"); // return 3 (apple = 3)
+mapSum.insert("app", 2);
+mapSum.sum("ap"); // return 5 (apple +app = 3 + 2 = 5)
+
+```
+
+**Constraints:**
+
+- `1 <= key.length, prefix.length <= 50`
+- `key` and `prefix` consist of only lowercase English letters.
+- `1 <= val <= 1000`
+- At most `50` calls will be made to `insert` and `sum`.
+
+## 题目大意
+
+实现一个 MapSum 类，支持两个方法，insert 和 sum：
+
+- MapSum() 初始化 MapSum 对象
+- void insert(String key, int val) 插入 key-val 键值对，字符串表示键 key ，整数表示值 val 。如果键 key 已经存在，那么原来的键值对将被替代成新的键值对。
+- int sum(string prefix) 返回所有以该前缀 prefix 开头的键 key 的值的总和。
+
+## 解题思路
+
+- 简单题。用一个 map 存储数据，Insert() 方法即存储 key-value。Sum() 方法即累加满足条件前缀对应的 value。判断是否满足条件，先根据前缀长度来判断，只有长度大于等于 prefix 长度才可能满足要求。如果 key 是具有 prefix 前缀的，那么累加上这个值。最后输出总和即可。
+
+## 代码
+
+```go
+package leetcode
+
+type MapSum struct {
+ keys map[string]int
+}
+
+/** Initialize your data structure here. */
+func Constructor() MapSum {
+ return MapSum{make(map[string]int)}
+}
+
+func (this *MapSum) Insert(key string, val int) {
+ this.keys[key] = val
+}
+
+func (this *MapSum) Sum(prefix string) int {
+ prefixAsRunes, res := []rune(prefix), 0
+ for key, val := range this.keys {
+ if len(key) >= len(prefix) {
+ shouldSum := true
+ for i, char := range key {
+ if i >= len(prefixAsRunes) {
+ break
+ }
+ if prefixAsRunes[i] != char {
+ shouldSum = false
+ break
+ }
+ }
+ if shouldSum {
+ res += val
+ }
+ }
+ }
+ return res
+}
+
+/**
+ * Your MapSum object will be instantiated and called as such:
+ * obj := Constructor();
+ * obj.Insert(key,val);
+ * param_2 := obj.Sum(prefix);
+ */
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0600~0699/0676.Implement-Magic-Dictionary/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0600~0699/0682.Baseball-Game/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0682.Baseball-Game.md b/website/content/ChapterFour/0600~0699/0682.Baseball-Game.md
similarity index 88%
rename from website/content/ChapterFour/0682.Baseball-Game.md
rename to website/content/ChapterFour/0600~0699/0682.Baseball-Game.md
index 6f76fd353..17efc69b7 100644
--- a/website/content/ChapterFour/0682.Baseball-Game.md
+++ b/website/content/ChapterFour/0600~0699/0682.Baseball-Game.md
@@ -103,4 +103,11 @@ func calPoints(ops []string) int {
return points
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0600~0699/0677.Map-Sum-Pairs/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0600~0699/0684.Redundant-Connection/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0684.Redundant-Connection.md b/website/content/ChapterFour/0600~0699/0684.Redundant-Connection.md
similarity index 88%
rename from website/content/ChapterFour/0684.Redundant-Connection.md
rename to website/content/ChapterFour/0600~0699/0684.Redundant-Connection.md
index 527d61bee..4fff04a31 100755
--- a/website/content/ChapterFour/0684.Redundant-Connection.md
+++ b/website/content/ChapterFour/0600~0699/0684.Redundant-Connection.md
@@ -62,7 +62,7 @@ Return an edge that can be removed so that the resulting graph is a tree of N no
package leetcode
import (
- "github.com/halfrost/LeetCode-Go/template"
+ "github.com/halfrost/leetcode-go/template"
)
func findRedundantConnection(edges [][]int) []int {
@@ -82,4 +82,11 @@ func findRedundantConnection(edges [][]int) []int {
return res
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0600~0699/0682.Baseball-Game/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0600~0699/0685.Redundant-Connection-II/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0685.Redundant-Connection-II.md b/website/content/ChapterFour/0600~0699/0685.Redundant-Connection-II.md
similarity index 93%
rename from website/content/ChapterFour/0685.Redundant-Connection-II.md
rename to website/content/ChapterFour/0600~0699/0685.Redundant-Connection-II.md
index d6436f4ba..f24a372a4 100755
--- a/website/content/ChapterFour/0685.Redundant-Connection-II.md
+++ b/website/content/ChapterFour/0600~0699/0685.Redundant-Connection-II.md
@@ -107,4 +107,11 @@ func findRoot(parent *[]int, k int) int {
return (*parent)[k]
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0600~0699/0684.Redundant-Connection/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0600~0699/0690.Employee-Importance/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0600~0699/0690.Employee-Importance.md b/website/content/ChapterFour/0600~0699/0690.Employee-Importance.md
new file mode 100644
index 000000000..df80e9bc7
--- /dev/null
+++ b/website/content/ChapterFour/0600~0699/0690.Employee-Importance.md
@@ -0,0 +1,69 @@
+# [690. Employee Importance](https://leetcode.com/problems/employee-importance/)
+
+## 题目
+
+You are given a data structure of employee information, which includes the employee's **unique id**, their **importance value** and their **direct** subordinates' id.
+
+For example, employee 1 is the leader of employee 2, and employee 2 is the leader of employee 3. They have importance value 15, 10 and 5, respectively. Then employee 1 has a data structure like [1, 15, [2]], and employee 2 has [2, 10, [3]], and employee 3 has [3, 5, []]. Note that although employee 3 is also a subordinate of employee 1, the relationship is **not direct**.
+
+Now given the employee information of a company, and an employee id, you need to return the total importance value of this employee and all their subordinates.
+
+**Example 1:**
+
+```
+Input: [[1, 5, [2, 3]], [2, 3, []], [3, 3, []]], 1
+Output: 11
+Explanation:
+Employee 1 has importance value 5, and he has two direct subordinates: employee 2 and employee 3. They both have importance value 3. So the total importance value of employee 1 is 5 + 3 + 3 = 11.
+```
+
+**Note:**
+
+1. One employee has at most one **direct** leader and may have several subordinates.
+2. The maximum number of employees won't exceed 2000.
+
+## 题目大意
+
+给定一个保存员工信息的数据结构，它包含了员工 唯一的 id ，重要度 和 直系下属的 id 。比如，员工 1 是员工 2 的领导，员工 2 是员工 3 的领导。他们相应的重要度为 15 , 10 , 5 。那么员工 1 的数据结构是 [1, 15, [2]] ，员工 2的 数据结构是 [2, 10, [3]] ，员工 3 的数据结构是 [3, 5, []] 。注意虽然员工 3 也是员工 1 的一个下属，但是由于 并不是直系 下属，因此没有体现在员工 1 的数据结构中。现在输入一个公司的所有员工信息，以及单个员工 id ，返回这个员工和他所有下属的重要度之和。
+
+## 解题思路
+
+- 简单题。根据题意，DFS 或者 BFS 搜索找到所求 id 下属所有员工，累加下属员工的重要度，最后再加上这个员工本身的重要度，即为所求。
+
+## 代码
+
+```go
+package leetcode
+
+type Employee struct {
+ Id int
+ Importance int
+ Subordinates []int
+}
+
+func getImportance(employees []*Employee, id int) int {
+ m, queue, res := map[int]*Employee{}, []int{id}, 0
+ for _, e := range employees {
+ m[e.Id] = e
+ }
+ for len(queue) > 0 {
+ e := m[queue[0]]
+ queue = queue[1:]
+ if e == nil {
+ continue
+ }
+ res += e.Importance
+ for _, i := range e.Subordinates {
+ queue = append(queue, i)
+ }
+ }
+ return res
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0600~0699/0685.Redundant-Connection-II/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0600~0699/0692.Top-K-Frequent-Words/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0600~0699/0692.Top-K-Frequent-Words.md b/website/content/ChapterFour/0600~0699/0692.Top-K-Frequent-Words.md
new file mode 100644
index 000000000..1d8f09791
--- /dev/null
+++ b/website/content/ChapterFour/0600~0699/0692.Top-K-Frequent-Words.md
@@ -0,0 +1,105 @@
+# [692. Top K Frequent Words](https://leetcode.com/problems/top-k-frequent-words/)
+
+
+## 题目
+
+Given a non-empty list of words, return the k most frequent elements.
+
+Your answer should be sorted by frequency from highest to lowest. If two words have the same frequency, then the word with the lower alphabetical order comes first.
+
+**Example 1:**
+
+```
+Input: ["i", "love", "leetcode", "i", "love", "coding"], k = 2
+Output: ["i", "love"]
+Explanation: "i" and "love" are the two most frequent words.
+ Note that "i" comes before "love" due to a lower alphabetical order.
+```
+
+**Example 2:**
+
+```
+Input: ["the", "day", "is", "sunny", "the", "the", "the", "sunny", "is", "is"], k = 4
+Output: ["the", "is", "sunny", "day"]
+Explanation: "the", "is", "sunny" and "day" are the four most frequent words,
+ with the number of occurrence being 4, 3, 2 and 1 respectively.
+```
+
+**Note:**
+
+1. You may assume k is always valid, 1 ≤ k ≤ number of unique elements.
+2. Input words contain only lowercase letters.
+
+**Follow up:**
+
+1. Try to solve it in O(n log k) time and O(n) extra space.
+
+## 题目大意
+
+给一非空的单词列表，返回前 *k* 个出现次数最多的单词。返回的答案应该按单词出现频率由高到低排序。如果不同的单词有相同出现频率，按字母顺序排序。
+
+## 解题思路
+
+- 思路很简单的题。维护一个长度为 k 的最大堆，先按照频率排，如果频率相同再按照字母顺序排。最后输出依次将优先队列里面的元素 pop 出来即可。
+
+## 代码
+
+```go
+package leetcode
+
+import "container/heap"
+
+func topKFrequent(words []string, k int) []string {
+ m := map[string]int{}
+ for _, word := range words {
+ m[word]++
+ }
+ pq := &PQ{}
+ heap.Init(pq)
+ for w, c := range m {
+ heap.Push(pq, &wordCount{w, c})
+ if pq.Len() > k {
+ heap.Pop(pq)
+ }
+ }
+ res := make([]string, k)
+ for i := k - 1; i >= 0; i-- {
+ wc := heap.Pop(pq).(*wordCount)
+ res[i] = wc.word
+ }
+ return res
+}
+
+type wordCount struct {
+ word string
+ cnt int
+}
+
+type PQ []*wordCount
+
+func (pq PQ) Len() int { return len(pq) }
+func (pq PQ) Swap(i, j int) { pq[i], pq[j] = pq[j], pq[i] }
+func (pq PQ) Less(i, j int) bool {
+ if pq[i].cnt == pq[j].cnt {
+ return pq[i].word > pq[j].word
+ }
+ return pq[i].cnt < pq[j].cnt
+}
+func (pq *PQ) Push(x interface{}) {
+ tmp := x.(*wordCount)
+ *pq = append(*pq, tmp)
+}
+func (pq *PQ) Pop() interface{} {
+ n := len(*pq)
+ tmp := (*pq)[n-1]
+ *pq = (*pq)[:n-1]
+ return tmp
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0600~0699/0690.Employee-Importance/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0600~0699/0693.Binary-Number-with-Alternating-Bits/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0693.Binary-Number-with-Alternating-Bits.md b/website/content/ChapterFour/0600~0699/0693.Binary-Number-with-Alternating-Bits.md
similarity index 82%
rename from website/content/ChapterFour/0693.Binary-Number-with-Alternating-Bits.md
rename to website/content/ChapterFour/0600~0699/0693.Binary-Number-with-Alternating-Bits.md
index 290e2cda6..b77b30872 100755
--- a/website/content/ChapterFour/0693.Binary-Number-with-Alternating-Bits.md
+++ b/website/content/ChapterFour/0600~0699/0693.Binary-Number-with-Alternating-Bits.md
@@ -77,4 +77,11 @@ func hasAlternatingBits1(n int) bool {
return true
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0600~0699/0692.Top-K-Frequent-Words/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0600~0699/0695.Max-Area-of-Island/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0695.Max-Area-of-Island.md b/website/content/ChapterFour/0600~0699/0695.Max-Area-of-Island.md
similarity index 80%
rename from website/content/ChapterFour/0695.Max-Area-of-Island.md
rename to website/content/ChapterFour/0600~0699/0695.Max-Area-of-Island.md
index 2419d561e..05c391e04 100644
--- a/website/content/ChapterFour/0695.Max-Area-of-Island.md
+++ b/website/content/ChapterFour/0600~0699/0695.Max-Area-of-Island.md
@@ -45,6 +45,14 @@ Given the above grid, return`0`.
## 代码
```go
+
+var dir = [][]int{
+ {-1, 0},
+ {0, 1},
+ {1, 0},
+ {0, -1},
+}
+
func maxAreaOfIsland(grid [][]int) int {
res := 0
for i, row := range grid {
@@ -61,6 +69,10 @@ func maxAreaOfIsland(grid [][]int) int {
return res
}
+func isInGrid(grid [][]int, x, y int) bool {
+ return x >= 0 && x < len(grid) && y >= 0 && y < len(grid[0])
+}
+
func areaOfIsland(grid [][]int, x, y int) int {
if !isInGrid(grid, x, y) || grid[x][y] == 0 {
return 0
@@ -74,4 +86,12 @@ func areaOfIsland(grid [][]int, x, y int) int {
}
return total
}
-```
\ No newline at end of file
+
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0600~0699/0693.Binary-Number-with-Alternating-Bits/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0600~0699/0696.Count-Binary-Substrings/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0600~0699/0696.Count-Binary-Substrings.md b/website/content/ChapterFour/0600~0699/0696.Count-Binary-Substrings.md
new file mode 100644
index 000000000..0bc7aaca8
--- /dev/null
+++ b/website/content/ChapterFour/0600~0699/0696.Count-Binary-Substrings.md
@@ -0,0 +1,76 @@
+# [696. Count Binary Substrings](https://leetcode.com/problems/count-binary-substrings/)
+
+
+## 题目
+
+Give a string `s`, count the number of non-empty (contiguous) substrings that have the same number of 0's and 1's, and all the 0's and all the 1's in these substrings are grouped consecutively.
+
+Substrings that occur multiple times are counted the number of times they occur.
+
+**Example 1:**
+
+```
+Input: "00110011"
+Output: 6
+Explanation: There are 6 substrings that have equal number of consecutive 1's and 0's: "0011", "01", "1100", "10", "0011", and "01".
+
+Notice that some of these substrings repeat and are counted the number of times they occur.
+
+Also, "00110011" is not a valid substring becauseall the 0's (and 1's) are not grouped together.
+
+```
+
+**Example 2:**
+
+```
+Input: "10101"
+Output: 4
+Explanation: There are 4 substrings: "10", "01", "10", "01" that have equal number of consecutive 1's and 0's.
+
+```
+
+**Note:**
+
+- `s.length` will be between 1 and 50,000.
+- `s` will only consist of "0" or "1" characters.
+
+## 题目大意
+
+给定一个字符串 s，计算具有相同数量 0 和 1 的非空（连续）子字符串的数量，并且这些子字符串中的所有 0 和所有 1 都是连续的。重复出现的子串要计算它们出现的次数。
+
+## 解题思路
+
+- 简单题。先分组统计 0 和 1 的个数，例如，`0110001111` 按照 0 和 1 分组统计出来的结果是 [1, 2, 3, 4]。再拼凑结果。相邻 2 组取两者最短的，例如 `0110001111`，凑成的结果应该是 min(1,2)，min(2,3)，min(3,4)，即 `01`，`01`，`10`，`1100`，`0011`，`000111`。时间复杂度 O(n)，空间复杂度 O(1)。
+
+## 代码
+
+```go
+package leetcode
+
+func countBinarySubstrings(s string) int {
+ last, res := 0, 0
+ for i := 0; i < len(s); {
+ c, count := s[i], 1
+ for i++; i < len(s) && s[i] == c; i++ {
+ count++
+ }
+ res += min(count, last)
+ last = count
+ }
+ return res
+}
+
+func min(a, b int) int {
+ if a < b {
+ return a
+ }
+ return b
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0600~0699/0695.Max-Area-of-Island/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0600~0699/0697.Degree-of-an-Array/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0697.Degree-of-an-Array.md b/website/content/ChapterFour/0600~0699/0697.Degree-of-an-Array.md
similarity index 86%
rename from website/content/ChapterFour/0697.Degree-of-an-Array.md
rename to website/content/ChapterFour/0600~0699/0697.Degree-of-an-Array.md
index ab032f5c5..b9533ece3 100644
--- a/website/content/ChapterFour/0697.Degree-of-an-Array.md
+++ b/website/content/ChapterFour/0600~0699/0697.Degree-of-an-Array.md
@@ -77,4 +77,11 @@ func findShortestSubArray(nums []int) int {
return smallest
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0600~0699/0696.Count-Binary-Substrings/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0600~0699/0699.Falling-Squares/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0699.Falling-Squares.md b/website/content/ChapterFour/0600~0699/0699.Falling-Squares.md
similarity index 93%
rename from website/content/ChapterFour/0699.Falling-Squares.md
rename to website/content/ChapterFour/0600~0699/0699.Falling-Squares.md
index a3228a87e..83772c54a 100755
--- a/website/content/ChapterFour/0699.Falling-Squares.md
+++ b/website/content/ChapterFour/0600~0699/0699.Falling-Squares.md
@@ -108,7 +108,7 @@ package leetcode
import (
"sort"
- "github.com/halfrost/LeetCode-Go/template"
+ "github.com/halfrost/leetcode-go/template"
)
func fallingSquares(positions [][]int) []int {
@@ -142,4 +142,11 @@ func discretization(positions [][]int) map[int]int {
return posMap
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0600~0699/0697.Degree-of-an-Array/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0700~0799/0700.Search-in-a-Binary-Search-Tree/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0600~0699/_index.md b/website/content/ChapterFour/0600~0699/_index.md
new file mode 100644
index 000000000..d2021683f
--- /dev/null
+++ b/website/content/ChapterFour/0600~0699/_index.md
@@ -0,0 +1,5 @@
+---
+bookCollapseSection: true
+weight: 20
+---
+
diff --git a/website/content/ChapterFour/0628.Maximum-Product-of-Three-Numbers.md b/website/content/ChapterFour/0628.Maximum-Product-of-Three-Numbers.md
deleted file mode 100755
index c51411ad5..000000000
--- a/website/content/ChapterFour/0628.Maximum-Product-of-Three-Numbers.md
+++ /dev/null
@@ -1,96 +0,0 @@
-# [628. Maximum Product of Three Numbers](https://leetcode.com/problems/maximum-product-of-three-numbers/)
-
-
-## 题目
-
-Given an integer array, find three numbers whose product is maximum and output the maximum product.
-
-**Example 1**:
-
- Input: [1,2,3]
- Output: 6
-
-**Example 2**:
-
- Input: [1,2,3,4]
- Output: 24
-
-**Note**:
-
-1. The length of the given array will be in range [3,10^4] and all elements are in the range [-1000, 1000].
-2. Multiplication of any three numbers in the input won't exceed the range of 32-bit signed integer.
-
-
-## 题目大意
-
-给定一个整型数组，在数组中找出由三个数组成的最大乘积，并输出这个乘积。
-
-
-
-
-## 解题思路
-
-
-- 给出一个数组，要求求出这个数组中任意挑 3 个数能组成的乘积最大的值。
-- 题目的 test case 数据量比较大，如果用排序的话，时间复杂度高，可以直接考虑模拟，挑出 3 个数组成乘积最大值，必然是一个正数和二个负数，或者三个正数。那么选出最大的三个数和最小的二个数，对比一下就可以求出最大值了。时间复杂度 O(n)
-
-
-
-## 代码
-
-```go
-
-package leetcode
-
-import (
- "sort"
-)
-
-// 解法一 排序，时间复杂度 O(n log n)
-func maximumProduct(nums []int) int {
- if len(nums) == 0 {
- return 0
- }
- res := 1
- if len(nums) <= 3 {
- for i := 0; i < len(nums); i++ {
- res = res * nums[i]
- }
- return res
- }
- sort.Ints(nums)
- if nums[len(nums)-1] <= 0 {
- return 0
- }
- return max(nums[0]*nums[1]*nums[len(nums)-1], nums[len(nums)-1]*nums[len(nums)-2]*nums[len(nums)-3])
-}
-
-// 解法二 模拟，时间复杂度 O(n)
-func maximumProduct1(nums []int) int {
- n1, n2, n3 := -1<<63, -1<<63, -1<<63
- n4, n5 := 0, 0
- for _, v := range nums {
- if v > n1 {
- n3 = n2
- n2 = n1
- n1 = v
- } else if v > n2 {
- n3 = n2
- n2 = v
- } else if v > n3 {
- n3 = v
- }
- if v < n4 {
- n5 = n4
- n4 = v
- } else if v < n5 {
- n5 = v
- }
- }
- if n2*n3 > n4*n5 {
- return n1 * n2 * n3
- }
- return n1 * n4 * n5
-}
-
-```
\ No newline at end of file
diff --git a/website/content/ChapterFour/0633.Sum-of-Square-Numbers.md b/website/content/ChapterFour/0633.Sum-of-Square-Numbers.md
deleted file mode 100755
index 4af1d2a4f..000000000
--- a/website/content/ChapterFour/0633.Sum-of-Square-Numbers.md
+++ /dev/null
@@ -1,53 +0,0 @@
-# [633. Sum of Square Numbers](https://leetcode.com/problems/sum-of-square-numbers/)
-
-
-## 题目
-
-Given a non-negative integer `c`, your task is to decide whether there're two integers `a` and `b` such that a^2 + b^2 = c.
-
-**Example 1**:
-
- Input: 5
- Output: True
- Explanation: 1 * 1 + 2 * 2 = 5
-
-**Example 2**:
-
- Input: 3
- Output: False
-
-
-## 题目大意
-
-给定一个非负整数 c ，你要判断是否存在两个整数 a 和 b，使得 a^2 + b^2 = c。
-
-
-## 解题思路
-
-- 给出一个数，要求判断这个数能否由由 2 个完全平方数组成。能则输出 true，不能则输出 false。
-- 可以用二分搜索来解答这道题。判断题意，依次计算 `low * low + high * high` 和 c 是否相等。从 [1, sqrt(n)] 区间内进行二分，若能找到则返回 true，找不到就返回 false 。
-
-
-## 代码
-
-```go
-
-package leetcode
-
-import "math"
-
-func judgeSquareSum(c int) bool {
- low, high := 0, int(math.Sqrt(float64(c)))
- for low <= high {
- if low*low+high*high < c {
- low++
- } else if low*low+high*high > c {
- high--
- } else {
- return true
- }
- }
- return false
-}
-
-```
\ No newline at end of file
diff --git a/website/content/ChapterFour/0653.Two-Sum-IV---Input-is-a-BST.md b/website/content/ChapterFour/0653.Two-Sum-IV---Input-is-a-BST.md
deleted file mode 100755
index e203db033..000000000
--- a/website/content/ChapterFour/0653.Two-Sum-IV---Input-is-a-BST.md
+++ /dev/null
@@ -1,75 +0,0 @@
-# [653. Two Sum IV - Input is a BST](https://leetcode.com/problems/two-sum-iv-input-is-a-bst/)
-
-## 题目
-
-Given a Binary Search Tree and a target number, return true if there exist two elements in the BST such that their sum is equal to the given target.
-
-**Example 1**:
-
- Input:
- 5
- / \
- 3 6
- / \ \
- 2 4 7
-
- Target = 9
-
- Output: True
-
-**Example 2**:
-
- Input:
- 5
- / \
- 3 6
- / \ \
- 2 4 7
-
- Target = 28
-
- Output: False
-
-
-## 题目大意
-
-给定一个二叉搜索树和一个目标结果，如果 BST 中存在两个元素且它们的和等于给定的目标结果，则返回 true。
-
-## 解题思路
-
-
-- 在树中判断是否存在 2 个数的和是 sum。
-- 这一题是 two sum 问题的变形题，只不过题目背景是在 BST 上处理的。处理思路大体一致，用 map 记录已经访问过的节点值。边遍历树边查看 map 里面是否有 sum 的另外一半。
-
-
-## 代码
-
-```go
-
-package leetcode
-
-/**
- * Definition for a binary tree node.
- * type TreeNode struct {
- * Val int
- * Left *TreeNode
- * Right *TreeNode
- * }
- */
-func findTarget(root *TreeNode, k int) bool {
- m := make(map[int]int, 0)
- return findTargetDFS(root, k, m)
-}
-
-func findTargetDFS(root *TreeNode, k int, m map[int]int) bool {
- if root == nil {
- return false
- }
- if _, ok := m[k-root.Val]; ok {
- return ok
- }
- m[root.Val]++
- return findTargetDFS(root.Left, k, m) || findTargetDFS(root.Right, k, m)
-}
-
-```
\ No newline at end of file
diff --git a/website/content/ChapterFour/0700~0799/0700.Search-in-a-Binary-Search-Tree.md b/website/content/ChapterFour/0700~0799/0700.Search-in-a-Binary-Search-Tree.md
new file mode 100644
index 000000000..dd0072acb
--- /dev/null
+++ b/website/content/ChapterFour/0700~0799/0700.Search-in-a-Binary-Search-Tree.md
@@ -0,0 +1,80 @@
+# [700. Search in a Binary Search Tree](https://leetcode.com/problems/search-in-a-binary-search-tree/)
+
+## 题目
+
+You are given the root of a binary search tree (BST) and an integer val.
+
+Find the node in the BST that the node's value equals val and return the subtree rooted with that node. If such a node does not exist, return null.
+
+**Example 1**:
+
+
+
+ Input: root = [4,2,7,1,3], val = 2
+ Output: [2,1,3]
+
+**Example 2**:
+
+
+
+ Input: root = [4,2,7,1,3], val = 5
+ Output: []
+
+**Constraints:**
+
+- The number of nodes in the tree is in the range [1, 5000].
+- 1 <= Node.val <= 10000000
+- root is a binary search tree.
+- 1 <= val <= 10000000
+
+## 题目大意
+
+给定二叉搜索树（BST）的根节点和一个值。 你需要在BST中找到节点值等于给定值的节点。 返回以该节点为根的子树。 如果节点不存在，则返回 NULL。
+
+## 解题思路
+
+- 根据二叉搜索树的性质(根节点的值大于左子树所有节点的值，小于右子树所有节点的值),进行递归求解
+
+## 代码
+
+```go
+
+package leetcode
+
+import (
+ "github.com/halfrost/leetcode-go/structures"
+)
+
+// TreeNode define
+type TreeNode = structures.TreeNode
+
+/**
+ * Definition for a binary tree node.
+ * type TreeNode struct {
+ * Val int
+ * Left *TreeNode
+ * Right *TreeNode
+ * }
+ */
+
+func searchBST(root *TreeNode, val int) *TreeNode {
+ if root == nil {
+ return nil
+ }
+ if root.Val == val {
+ return root
+ } else if root.Val < val {
+ return searchBST(root.Right, val)
+ } else {
+ return searchBST(root.Left, val)
+ }
+}
+
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0600~0699/0699.Falling-Squares/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0700~0799/0701.Insert-into-a-Binary-Search-Tree/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0700~0799/0701.Insert-into-a-Binary-Search-Tree.md b/website/content/ChapterFour/0700~0799/0701.Insert-into-a-Binary-Search-Tree.md
new file mode 100644
index 000000000..bbfc43a22
--- /dev/null
+++ b/website/content/ChapterFour/0700~0799/0701.Insert-into-a-Binary-Search-Tree.md
@@ -0,0 +1,95 @@
+# [701. Insert into a Binary Search Tree](https://leetcode.com/problems/insert-into-a-binary-search-tree/)
+
+
+## 题目
+
+You are given the `root` node of a binary search tree (BST) and a `value` to insert into the tree. Return *the root node of the BST after the insertion*. It is **guaranteed** that the new value does not exist in the original BST.
+
+**Notice** that there may exist multiple valid ways for the insertion, as long as the tree remains a BST after insertion. You can return **any of them**.
+
+**Example 1:**
+
+
+
+```
+Input: root = [4,2,7,1,3], val = 5
+Output: [4,2,7,1,3,5]
+Explanation: Another accepted tree is:
+
+```
+
+
+
+**Example 2:**
+
+```
+Input: root = [40,20,60,10,30,50,70], val = 25
+Output: [40,20,60,10,30,50,70,null,null,25]
+
+```
+
+**Example 3:**
+
+```
+Input: root = [4,2,7,1,3,null,null,null,null,null,null], val = 5
+Output: [4,2,7,1,3,5]
+
+```
+
+**Constraints:**
+
+- The number of nodes in the tree will be in the range `[0, 104]`.
+- `108 <= Node.val <= 108`
+- All the values `Node.val` are **unique**.
+- `108 <= val <= 108`
+- It's **guaranteed** that `val` does not exist in the original BST.
+
+## 题目大意
+
+给定二叉搜索树（BST）的根节点和要插入树中的值，将值插入二叉搜索树。 返回插入后二叉搜索树的根节点。 输入数据 保证 ，新值和原始二叉搜索树中的任意节点值都不同。注意，可能存在多种有效的插入方式，只要树在插入后仍保持为二叉搜索树即可。 你可以返回 任意有效的结果 。
+
+## 解题思路
+
+- 简单题。插入节点的方法有多种，笔者这里选择一种简单的方法。从根开始遍历这个二叉树，当前节点的值比待插入节点的值小，则往右遍历；当前节点的值比待插入节点的值大，则往左遍历。最后遍历到空节点便是要插入的地方。
+
+## 代码
+
+```go
+package leetcode
+
+import "github.com/halfrost/leetcode-go/structures"
+
+// TreeNode define
+type TreeNode = structures.TreeNode
+
+/**
+ * Definition for a binary tree node.
+ * type TreeNode struct {
+ * Val int
+ * Left *TreeNode
+ * Right *TreeNode
+ * }
+ */
+func insert(n *TreeNode, val int) *TreeNode {
+ if n == nil {
+ return &TreeNode{Val: val}
+ }
+ if n.Val < val {
+ n.Right = insert(n.Right, val)
+ } else {
+ n.Left = insert(n.Left, val)
+ }
+ return n
+}
+
+func insertIntoBST(root *TreeNode, val int) *TreeNode {
+ return insert(root, val)
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0700~0799/0700.Search-in-a-Binary-Search-Tree/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0700~0799/0703.Kth-Largest-Element-in-a-Stream/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0700~0799/0703.Kth-Largest-Element-in-a-Stream.md b/website/content/ChapterFour/0700~0799/0703.Kth-Largest-Element-in-a-Stream.md
new file mode 100644
index 000000000..0cce2cbfa
--- /dev/null
+++ b/website/content/ChapterFour/0700~0799/0703.Kth-Largest-Element-in-a-Stream.md
@@ -0,0 +1,100 @@
+# [703. Kth Largest Element in a Stream](https://leetcode.com/problems/kth-largest-element-in-a-stream/)
+
+## 题目
+
+Design a class to find the `kth` largest element in a stream. Note that it is the `kth` largest element in the sorted order, not the `kth` distinct element.
+
+Implement `KthLargest` class:
+
+- `KthLargest(int k, int[] nums)` Initializes the object with the integer `k` and the stream of integers `nums`.
+- `int add(int val)` Returns the element representing the `kth` largest element in the stream.
+
+**Example 1:**
+
+```
+Input
+["KthLargest", "add", "add", "add", "add", "add"]
+[[3, [4, 5, 8, 2]], [3], [5], [10], [9], [4]]
+Output
+[null, 4, 5, 5, 8, 8]
+
+Explanation
+KthLargest kthLargest = new KthLargest(3, [4, 5, 8, 2]);
+kthLargest.add(3); // return 4
+kthLargest.add(5); // return 5
+kthLargest.add(10); // return 5
+kthLargest.add(9); // return 8
+kthLargest.add(4); // return 8
+
+```
+
+**Constraints:**
+
+- `1 <= k <= 104`
+- `0 <= nums.length <= 104`
+- `104 <= nums[i] <= 104`
+- `104 <= val <= 104`
+- At most `104` calls will be made to `add`.
+- It is guaranteed that there will be at least `k` elements in the array when you search for the `kth` element.
+
+## 题目大意
+
+设计一个找到数据流中第 k 大元素的类（class）。注意是排序后的第 k 大元素，不是第 k 个不同的元素。请实现 KthLargest 类：
+
+- KthLargest(int k, int[] nums) 使用整数 k 和整数流 nums 初始化对象。
+- int add(int val) 将 val 插入数据流 nums 后，返回当前数据流中第 k 大的元素。
+
+## 解题思路
+
+- 读完题就能明白这一题考察的是最小堆。构建一个长度为 K 的最小堆，每次 pop 堆首(堆中最小的元素)，维护堆首即为第 K 大元素。
+- 这里有一个简洁的写法，常规的构建一个 pq 优先队列需要自己新建一个类型，然后实现 Len()、Less()、Swap()、Push()、Pop() 这 5 个方法。在 sort 包里有一个现成的最小堆，sort.IntSlice。可以借用它，再自己实现 Push()、Pop()就可以使用最小堆了，节约一部分代码。
+
+## 代码
+
+```go
+package leetcode
+
+import (
+ "container/heap"
+ "sort"
+)
+
+type KthLargest struct {
+ sort.IntSlice
+ k int
+}
+
+func Constructor(k int, nums []int) KthLargest {
+ kl := KthLargest{k: k}
+ for _, val := range nums {
+ kl.Add(val)
+ }
+ return kl
+}
+
+func (kl *KthLargest) Push(v interface{}) {
+ kl.IntSlice = append(kl.IntSlice, v.(int))
+}
+
+func (kl *KthLargest) Pop() interface{} {
+ a := kl.IntSlice
+ v := a[len(a)-1]
+ kl.IntSlice = a[:len(a)-1]
+ return v
+}
+
+func (kl *KthLargest) Add(val int) int {
+ heap.Push(kl, val)
+ if kl.Len() > kl.k {
+ heap.Pop(kl)
+ }
+ return kl.IntSlice[0]
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0700~0799/0701.Insert-into-a-Binary-Search-Tree/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0700~0799/0704.Binary-Search/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0704.Binary-Search.md b/website/content/ChapterFour/0700~0799/0704.Binary-Search.md
similarity index 80%
rename from website/content/ChapterFour/0704.Binary-Search.md
rename to website/content/ChapterFour/0700~0799/0704.Binary-Search.md
index b10293d9a..383ad604b 100755
--- a/website/content/ChapterFour/0704.Binary-Search.md
+++ b/website/content/ChapterFour/0700~0799/0704.Binary-Search.md
@@ -64,4 +64,11 @@ func search704(nums []int, target int) int {
return -1
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0700~0799/0703.Kth-Largest-Element-in-a-Stream/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0700~0799/0705.Design-HashSet/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0705.Design-HashSet.md b/website/content/ChapterFour/0700~0799/0705.Design-HashSet.md
similarity index 86%
rename from website/content/ChapterFour/0705.Design-HashSet.md
rename to website/content/ChapterFour/0700~0799/0705.Design-HashSet.md
index d4d241f7a..c535d896a 100755
--- a/website/content/ChapterFour/0705.Design-HashSet.md
+++ b/website/content/ChapterFour/0700~0799/0705.Design-HashSet.md
@@ -91,4 +91,11 @@ func (this *MyHashSet) Contains(key int) bool {
* param_3 := obj.Contains(key);
*/
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0700~0799/0704.Binary-Search/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0700~0799/0706.Design-HashMap/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0706.Design-HashMap.md b/website/content/ChapterFour/0700~0799/0706.Design-HashMap.md
similarity index 90%
rename from website/content/ChapterFour/0706.Design-HashMap.md
rename to website/content/ChapterFour/0700~0799/0706.Design-HashMap.md
index 801460984..e6b441607 100755
--- a/website/content/ChapterFour/0706.Design-HashMap.md
+++ b/website/content/ChapterFour/0700~0799/0706.Design-HashMap.md
@@ -98,9 +98,9 @@ func (N *HashNode) Remove(key int) *HashNode {
return p
}
if N.next != nil {
- return N.next.Remove(key)
+ N.next = N.next.Remove(key)
}
- return nil
+ return N
}
/** Initialize your data structure here. */
@@ -148,4 +148,11 @@ func (this *MyHashMap) Hash(value int) int {
* obj.Remove(key);
*/
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0700~0799/0705.Design-HashSet/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0700~0799/0707.Design-Linked-List/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0700~0799/0707.Design-Linked-List.md b/website/content/ChapterFour/0700~0799/0707.Design-Linked-List.md
new file mode 100644
index 000000000..93aaf77b9
--- /dev/null
+++ b/website/content/ChapterFour/0700~0799/0707.Design-Linked-List.md
@@ -0,0 +1,163 @@
+# [707. Design Linked List](https://leetcode.com/problems/design-linked-list/)
+
+## 题目
+
+Design your implementation of the linked list. You can choose to use the singly linked list or the doubly linked list. A node in a singly linked list should have two attributes: val and next. val is the value of the current node, and next is a pointer/reference to the next node. If you want to use the doubly linked list, you will need one more attribute prev to indicate the previous node in the linked list. Assume all nodes in the linked list are 0-indexed.
+
+Implement these functions in your linked list class:
+
+- get(index) : Get the value of the index-th node in the linked list. If the index is invalid, return -1.
+- addAtHead(val) : Add a node of value val before the first element of the linked list. After the insertion, the new node will be the first node of the linked list.
+- addAtTail(val) : Append a node of value val to the last element of the linked list.
+- addAtIndex(index, val) : Add a node of value val before the index-th node in the linked list. If index equals to the length of linked list, the node will be appended to the end of linked list. If index is greater than the length, the node will not be inserted.
+- deleteAtIndex(index) : Delete the index-th node in the linked list, if the index is valid.
+
+**Example**:
+
+```
+
+MyLinkedList linkedList = new MyLinkedList();
+linkedList.addAtHead(1);
+linkedList.addAtTail(3);
+linkedList.addAtIndex(1, 2); // linked list becomes 1->2->3
+linkedList.get(1); // returns 2
+linkedList.deleteAtIndex(1); // now the linked list is 1->3
+linkedList.get(1); // returns 3
+
+```
+
+**Note**:
+
+- All values will be in the range of [1, 1000].
+- The number of operations will be in the range of [1, 1000].
+- Please do not use the built-in LinkedList library.
+
+## 题目大意
+
+这道题比较简单，设计一个链表，实现相关操作即可。
+
+## 解题思路
+
+这题有一个地方比较坑，题目中 Note 里面写的数值取值范围是 [1, 1000]，笔者把 0 当做无效值。结果 case 里面出现了 0 是有效值。case 和题意不符。
+
+
+## 代码
+
+```go
+
+package leetcode
+
+type MyLinkedList struct {
+ head *Node
+}
+
+type Node struct {
+ Val int
+ Next *Node
+ Prev *Node
+}
+
+/** Initialize your data structure here. */
+func Constructor() MyLinkedList {
+ return MyLinkedList{}
+}
+
+/** Get the value of the index-th node in the linked list. If the index is invalid, return -1. */
+func (this *MyLinkedList) Get(index int) int {
+ curr := this.head
+ for i := 0; i < index && curr != nil; i++ {
+ curr = curr.Next
+ }
+ if curr != nil {
+ return curr.Val
+ } else {
+ return -1
+ }
+}
+
+/** Add a node of value val before the first element of the linked list. After the insertion, the new node will be the first node of the linked list. */
+func (this *MyLinkedList) AddAtHead(val int) {
+ node := &Node{Val: val}
+ node.Next = this.head
+ if this.head != nil {
+ this.head.Prev = node
+ }
+ this.head = node
+}
+
+/** Append a node of value val to the last element of the linked list. */
+func (this *MyLinkedList) AddAtTail(val int) {
+ if this.head == nil {
+ this.AddAtHead(val)
+ return
+ }
+ node := &Node{Val: val}
+ curr := this.head
+ for curr != nil && curr.Next != nil {
+ curr = curr.Next
+ }
+ node.Prev = curr
+ curr.Next = node
+}
+
+/** Add a node of value val before the index-th node in the linked list. If index equals to the length of linked list, the node will be appended to the end of linked list. If index is greater than the length, the node will not be inserted. */
+func (this *MyLinkedList) AddAtIndex(index int, val int) {
+ if index == 0 {
+ this.AddAtHead(val)
+ } else {
+ node := &Node{Val: val}
+ curr := this.head
+ for i := 0; i < index-1 && curr != nil; i++ {
+ curr = curr.Next
+ }
+ if curr != nil {
+ node.Next = curr.Next
+ node.Prev = curr
+ if node.Next != nil {
+ node.Next.Prev = node
+ }
+ curr.Next = node
+ }
+ }
+}
+
+/** Delete the index-th node in the linked list, if the index is valid. */
+func (this *MyLinkedList) DeleteAtIndex(index int) {
+ if index == 0 {
+ this.head = this.head.Next
+ if this.head != nil {
+ this.head.Prev = nil
+ }
+ } else {
+ curr := this.head
+ for i := 0; i < index-1 && curr != nil; i++ {
+ curr = curr.Next
+ }
+ if curr != nil && curr.Next != nil {
+ curr.Next = curr.Next.Next
+ if curr.Next != nil {
+ curr.Next.Prev = curr
+ }
+ }
+ }
+}
+
+/**
+ * Your MyLinkedList object will be instantiated and called as such:
+ * obj := Constructor();
+ * param_1 := obj.Get(index);
+ * obj.AddAtHead(val);
+ * obj.AddAtTail(val);
+ * obj.AddAtIndex(index,val);
+ * obj.DeleteAtIndex(index);
+ */
+
+
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0700~0799/0706.Design-HashMap/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0700~0799/0709.To-Lower-Case/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0700~0799/0709.To-Lower-Case.md b/website/content/ChapterFour/0700~0799/0709.To-Lower-Case.md
new file mode 100644
index 000000000..b88578cf6
--- /dev/null
+++ b/website/content/ChapterFour/0700~0799/0709.To-Lower-Case.md
@@ -0,0 +1,62 @@
+# [709. To Lower Case](https://leetcode.com/problems/to-lower-case/)
+
+
+## 题目
+
+Given a string `s`, return *the string after replacing every uppercase letter with the same lowercase letter*.
+
+**Example 1:**
+
+```
+Input: s = "Hello"
+Output: "hello"
+```
+
+**Example 2:**
+
+```
+Input: s = "here"
+Output: "here"
+```
+
+**Example 3:**
+
+```
+Input: s = "LOVELY"
+Output: "lovely"
+```
+
+**Constraints:**
+
+- `1 <= s.length <= 100`
+- `s` consists of printable ASCII characters.
+
+## 题目大意
+
+给你一个字符串 s ，将该字符串中的大写字母转换成相同的小写字母，返回新的字符串。
+
+## 解题思路
+
+- 简单题，将字符串中的大写字母转换成小写字母。
+
+## 代码
+
+```go
+func toLowerCase(s string) string {
+ runes := [] rune(s)
+ diff := 'a' - 'A'
+ for i := 0; i < len(s); i++ {
+ if runes[i] >= 'A' && runes[i] <= 'Z' {
+ runes[i] += diff
+ }
+ }
+ return string(runes)
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0700~0799/0707.Design-Linked-List/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0700~0799/0710.Random-Pick-with-Blacklist/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0710.Random-Pick-with-Blacklist.md b/website/content/ChapterFour/0700~0799/0710.Random-Pick-with-Blacklist.md
similarity index 90%
rename from website/content/ChapterFour/0710.Random-Pick-with-Blacklist.md
rename to website/content/ChapterFour/0700~0799/0710.Random-Pick-with-Blacklist.md
index d796e1e7e..d0e9356c8 100644
--- a/website/content/ChapterFour/0710.Random-Pick-with-Blacklist.md
+++ b/website/content/ChapterFour/0700~0799/0710.Random-Pick-with-Blacklist.md
@@ -142,4 +142,11 @@ func (this *Solution) Pick() int {
* param_1 := obj.Pick();
*/
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0700~0799/0709.To-Lower-Case/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0700~0799/0713.Subarray-Product-Less-Than-K/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0713.Subarray-Product-Less-Than-K.md b/website/content/ChapterFour/0700~0799/0713.Subarray-Product-Less-Than-K.md
similarity index 78%
rename from website/content/ChapterFour/0713.Subarray-Product-Less-Than-K.md
rename to website/content/ChapterFour/0700~0799/0713.Subarray-Product-Less-Than-K.md
index f5afc7d1a..11c50a4b8 100644
--- a/website/content/ChapterFour/0713.Subarray-Product-Less-Than-K.md
+++ b/website/content/ChapterFour/0700~0799/0713.Subarray-Product-Less-Than-K.md
@@ -62,4 +62,11 @@ func numSubarrayProductLessThanK(nums []int, k int) int {
return res
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0700~0799/0710.Random-Pick-with-Blacklist/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0700~0799/0714.Best-Time-to-Buy-and-Sell-Stock-with-Transaction-Fee/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0714.Best-Time-to-Buy-and-Sell-Stock-with-Transaction-Fee.md b/website/content/ChapterFour/0700~0799/0714.Best-Time-to-Buy-and-Sell-Stock-with-Transaction-Fee.md
similarity index 88%
rename from website/content/ChapterFour/0714.Best-Time-to-Buy-and-Sell-Stock-with-Transaction-Fee.md
rename to website/content/ChapterFour/0700~0799/0714.Best-Time-to-Buy-and-Sell-Stock-with-Transaction-Fee.md
index 7bf23833c..055c8f848 100755
--- a/website/content/ChapterFour/0714.Best-Time-to-Buy-and-Sell-Stock-with-Transaction-Fee.md
+++ b/website/content/ChapterFour/0700~0799/0714.Best-Time-to-Buy-and-Sell-Stock-with-Transaction-Fee.md
@@ -77,4 +77,11 @@ func maxProfit714_1(prices []int, fee int) int {
return sell
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0700~0799/0713.Subarray-Product-Less-Than-K/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0700~0799/0715.Range-Module/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0715.Range-Module.md b/website/content/ChapterFour/0700~0799/0715.Range-Module.md
similarity index 95%
rename from website/content/ChapterFour/0715.Range-Module.md
rename to website/content/ChapterFour/0700~0799/0715.Range-Module.md
index acd403646..27defe3dd 100755
--- a/website/content/ChapterFour/0715.Range-Module.md
+++ b/website/content/ChapterFour/0700~0799/0715.Range-Module.md
@@ -267,4 +267,11 @@ func query(node *SegmentTreeNode, start, end int) bool {
* obj.RemoveRange(left,right);
*/
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0700~0799/0714.Best-Time-to-Buy-and-Sell-Stock-with-Transaction-Fee/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0700~0799/0717.1-bit-and-2-bit-Characters/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0717.1-bit-and-2-bit-Characters.md b/website/content/ChapterFour/0700~0799/0717.1-bit-and-2-bit-Characters.md
similarity index 87%
rename from website/content/ChapterFour/0717.1-bit-and-2-bit-Characters.md
rename to website/content/ChapterFour/0700~0799/0717.1-bit-and-2-bit-Characters.md
index 499889244..baf0dc106 100755
--- a/website/content/ChapterFour/0717.1-bit-and-2-bit-Characters.md
+++ b/website/content/ChapterFour/0700~0799/0717.1-bit-and-2-bit-Characters.md
@@ -62,4 +62,11 @@ func isOneBitCharacter(bits []int) bool {
return i == len(bits)-1
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0700~0799/0715.Range-Module/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0700~0799/0718.Maximum-Length-of-Repeated-Subarray/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0718.Maximum-Length-of-Repeated-Subarray.md b/website/content/ChapterFour/0700~0799/0718.Maximum-Length-of-Repeated-Subarray.md
similarity index 91%
rename from website/content/ChapterFour/0718.Maximum-Length-of-Repeated-Subarray.md
rename to website/content/ChapterFour/0700~0799/0718.Maximum-Length-of-Repeated-Subarray.md
index eec248fe6..004d6f820 100755
--- a/website/content/ChapterFour/0718.Maximum-Length-of-Repeated-Subarray.md
+++ b/website/content/ChapterFour/0700~0799/0718.Maximum-Length-of-Repeated-Subarray.md
@@ -120,4 +120,11 @@ func findLength1(A []int, B []int) int {
return res
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0700~0799/0717.1-bit-and-2-bit-Characters/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0700~0799/0719.Find-K-th-Smallest-Pair-Distance/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0719.Find-K-th-Smallest-Pair-Distance.md b/website/content/ChapterFour/0700~0799/0719.Find-K-th-Smallest-Pair-Distance.md
similarity index 86%
rename from website/content/ChapterFour/0719.Find-K-th-Smallest-Pair-Distance.md
rename to website/content/ChapterFour/0700~0799/0719.Find-K-th-Smallest-Pair-Distance.md
index 836b8922a..3f85a6de9 100755
--- a/website/content/ChapterFour/0719.Find-K-th-Smallest-Pair-Distance.md
+++ b/website/content/ChapterFour/0700~0799/0719.Find-K-th-Smallest-Pair-Distance.md
@@ -94,4 +94,11 @@ func findDistanceCount1(nums []int, num int) int {
return count
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0700~0799/0718.Maximum-Length-of-Repeated-Subarray/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0700~0799/0720.Longest-Word-in-Dictionary/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0720.Longest-Word-in-Dictionary.md b/website/content/ChapterFour/0700~0799/0720.Longest-Word-in-Dictionary.md
similarity index 85%
rename from website/content/ChapterFour/0720.Longest-Word-in-Dictionary.md
rename to website/content/ChapterFour/0700~0799/0720.Longest-Word-in-Dictionary.md
index 8a70177f3..f35712bb4 100755
--- a/website/content/ChapterFour/0720.Longest-Word-in-Dictionary.md
+++ b/website/content/ChapterFour/0700~0799/0720.Longest-Word-in-Dictionary.md
@@ -69,4 +69,11 @@ func longestWord(words []string) string {
return res
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0700~0799/0719.Find-K-th-Smallest-Pair-Distance/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0700~0799/0721.Accounts-Merge/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0721.Accounts-Merge.md b/website/content/ChapterFour/0700~0799/0721.Accounts-Merge.md
similarity index 93%
rename from website/content/ChapterFour/0721.Accounts-Merge.md
rename to website/content/ChapterFour/0700~0799/0721.Accounts-Merge.md
index 352343d96..a7cb56781 100755
--- a/website/content/ChapterFour/0721.Accounts-Merge.md
+++ b/website/content/ChapterFour/0700~0799/0721.Accounts-Merge.md
@@ -58,7 +58,7 @@ package leetcode
import (
"sort"
- "github.com/halfrost/LeetCode-Go/template"
+ "github.com/halfrost/leetcode-go/template"
)
// 解法一 并查集优化搜索解法
@@ -146,4 +146,11 @@ func accountsMerge1(accounts [][]string) [][]string {
return res
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0700~0799/0720.Longest-Word-in-Dictionary/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0700~0799/0724.Find-Pivot-Index/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0724.Find-Pivot-Index.md b/website/content/ChapterFour/0700~0799/0724.Find-Pivot-Index.md
similarity index 85%
rename from website/content/ChapterFour/0724.Find-Pivot-Index.md
rename to website/content/ChapterFour/0700~0799/0724.Find-Pivot-Index.md
index 1e93cf475..23a7aeee6 100644
--- a/website/content/ChapterFour/0724.Find-Pivot-Index.md
+++ b/website/content/ChapterFour/0700~0799/0724.Find-Pivot-Index.md
@@ -72,3 +72,10 @@ func pivotIndex(nums []int) int {
}
```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0700~0799/0721.Accounts-Merge/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0700~0799/0725.Split-Linked-List-in-Parts/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0725.Split-Linked-List-in-Parts.md b/website/content/ChapterFour/0700~0799/0725.Split-Linked-List-in-Parts.md
similarity index 90%
rename from website/content/ChapterFour/0725.Split-Linked-List-in-Parts.md
rename to website/content/ChapterFour/0700~0799/0725.Split-Linked-List-in-Parts.md
index 6c7fdf871..310afd70e 100644
--- a/website/content/ChapterFour/0725.Split-Linked-List-in-Parts.md
+++ b/website/content/ChapterFour/0700~0799/0725.Split-Linked-List-in-Parts.md
@@ -139,4 +139,11 @@ func getLength(l *ListNode) int {
return count
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0700~0799/0724.Find-Pivot-Index/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0700~0799/0726.Number-of-Atoms/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0726.Number-of-Atoms.md b/website/content/ChapterFour/0700~0799/0726.Number-of-Atoms.md
similarity index 92%
rename from website/content/ChapterFour/0726.Number-of-Atoms.md
rename to website/content/ChapterFour/0700~0799/0726.Number-of-Atoms.md
index a9d3cf4a7..da6ec1a93 100755
--- a/website/content/ChapterFour/0726.Number-of-Atoms.md
+++ b/website/content/ChapterFour/0700~0799/0726.Number-of-Atoms.md
@@ -183,4 +183,11 @@ func isLowerLetter(v byte) bool {
return false
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0700~0799/0725.Split-Linked-List-in-Parts/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0700~0799/0728.Self-Dividing-Numbers/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0700~0799/0728.Self-Dividing-Numbers.md b/website/content/ChapterFour/0700~0799/0728.Self-Dividing-Numbers.md
new file mode 100644
index 000000000..0a7871712
--- /dev/null
+++ b/website/content/ChapterFour/0700~0799/0728.Self-Dividing-Numbers.md
@@ -0,0 +1,75 @@
+# [728. Self Dividing Numbers](https://leetcode.com/problems/self-dividing-numbers/)
+
+## 题目
+
+A self-dividing number is a number that is divisible by every digit it contains.
+
+- For example, 128 is a self-dividing number because 128 % 1 == 0, 128 % 2 == 0, and 128 % 8 == 0.
+
+A self-dividing number is not allowed to contain the digit zero.
+
+Given two integers left and right, return a list of all the self-dividing numbers in the range [left, right].
+
+**Example 1:**
+
+ Input: left = 1, right = 22
+ Output: [1,2,3,4,5,6,7,8,9,11,12,15,22]
+
+**Example 2:**
+
+ Input: left = 47, right = 85
+ Output: [48,55,66,77]
+
+**Constraints:**
+
+- 1 <= left <= right <= 10000
+
+## 题目大意
+
+自除数是指可以被它包含的每一位数整除的数。
+
+- 例如，128 是一个 自除数 ，因为 128 % 1 == 0，128 % 2 == 0，128 % 8 == 0。
+
+自除数 不允许包含 0 。
+
+给定两个整数 left 和 right ，返回一个列表，列表的元素是范围 [left, right] 内所有的 自除数 。
+
+## 解题思路
+
+- 模拟计算
+
+# 代码
+
+```go
+package leetcode
+
+func selfDividingNumbers(left int, right int) []int {
+ var ans []int
+ for num := left; num <= right; num++ {
+ if selfDividingNum(num) {
+ ans = append(ans, num)
+ }
+ }
+ return ans
+}
+
+func selfDividingNum(num int) bool {
+ for d := num; d > 0; d = d / 10 {
+ reminder := d % 10
+ if reminder == 0 {
+ return false
+ }
+ if num%reminder != 0 {
+ return false
+ }
+ }
+ return true
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0700~0799/0726.Number-of-Atoms/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0700~0799/0729.My-Calendar-I/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0729.My-Calendar-I.md b/website/content/ChapterFour/0700~0799/0729.My-Calendar-I.md
similarity index 94%
rename from website/content/ChapterFour/0729.My-Calendar-I.md
rename to website/content/ChapterFour/0700~0799/0729.My-Calendar-I.md
index bc957abac..0579c76da 100755
--- a/website/content/ChapterFour/0729.My-Calendar-I.md
+++ b/website/content/ChapterFour/0700~0799/0729.My-Calendar-I.md
@@ -177,4 +177,11 @@ func (this *MyCalendar) Book(start int, end int) bool {
* param_1 := obj.Book(start,end);
*/
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0700~0799/0728.Self-Dividing-Numbers/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0700~0799/0732.My-Calendar-III/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0732.My-Calendar-III.md b/website/content/ChapterFour/0700~0799/0732.My-Calendar-III.md
similarity index 94%
rename from website/content/ChapterFour/0732.My-Calendar-III.md
rename to website/content/ChapterFour/0700~0799/0732.My-Calendar-III.md
index 5b953911a..170edfd72 100755
--- a/website/content/ChapterFour/0732.My-Calendar-III.md
+++ b/website/content/ChapterFour/0700~0799/0732.My-Calendar-III.md
@@ -139,4 +139,11 @@ func (st *SegmentTree732) book(start, end int, maxHeight *int) {
* param_1 := obj.Book(start,end);
*/
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0700~0799/0729.My-Calendar-I/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0700~0799/0733.Flood-Fill/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0733.Flood-Fill.md b/website/content/ChapterFour/0700~0799/0733.Flood-Fill.md
similarity index 89%
rename from website/content/ChapterFour/0733.Flood-Fill.md
rename to website/content/ChapterFour/0700~0799/0733.Flood-Fill.md
index 8fd2bba3f..9fee69a41 100755
--- a/website/content/ChapterFour/0733.Flood-Fill.md
+++ b/website/content/ChapterFour/0700~0799/0733.Flood-Fill.md
@@ -78,4 +78,11 @@ func dfs733(image [][]int, x, y int, newColor int) {
}
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0700~0799/0732.My-Calendar-III/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0700~0799/0735.Asteroid-Collision/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0735.Asteroid-Collision.md b/website/content/ChapterFour/0700~0799/0735.Asteroid-Collision.md
similarity index 89%
rename from website/content/ChapterFour/0735.Asteroid-Collision.md
rename to website/content/ChapterFour/0700~0799/0735.Asteroid-Collision.md
index 2db714471..7a9227f5f 100644
--- a/website/content/ChapterFour/0735.Asteroid-Collision.md
+++ b/website/content/ChapterFour/0700~0799/0735.Asteroid-Collision.md
@@ -102,4 +102,11 @@ func asteroidCollision(asteroids []int) []int {
return res
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0700~0799/0733.Flood-Fill/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0700~0799/0739.Daily-Temperatures/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0739.Daily-Temperatures.md b/website/content/ChapterFour/0700~0799/0739.Daily-Temperatures.md
similarity index 79%
rename from website/content/ChapterFour/0739.Daily-Temperatures.md
rename to website/content/ChapterFour/0700~0799/0739.Daily-Temperatures.md
index 9fef4be8f..4a15a20bd 100644
--- a/website/content/ChapterFour/0739.Daily-Temperatures.md
+++ b/website/content/ChapterFour/0700~0799/0739.Daily-Temperatures.md
@@ -56,4 +56,11 @@ func dailyTemperatures1(T []int) []int {
return res
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0700~0799/0735.Asteroid-Collision/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0700~0799/0744.Find-Smallest-Letter-Greater-Than-Target/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0744.Find-Smallest-Letter-Greater-Than-Target.md b/website/content/ChapterFour/0700~0799/0744.Find-Smallest-Letter-Greater-Than-Target.md
similarity index 86%
rename from website/content/ChapterFour/0744.Find-Smallest-Letter-Greater-Than-Target.md
rename to website/content/ChapterFour/0700~0799/0744.Find-Smallest-Letter-Greater-Than-Target.md
index fc6e62086..daa8ce502 100755
--- a/website/content/ChapterFour/0744.Find-Smallest-Letter-Greater-Than-Target.md
+++ b/website/content/ChapterFour/0700~0799/0744.Find-Smallest-Letter-Greater-Than-Target.md
@@ -89,4 +89,11 @@ func nextGreatestLetter(letters []byte, target byte) byte {
return find
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0700~0799/0739.Daily-Temperatures/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0700~0799/0745.Prefix-and-Suffix-Search/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0745.Prefix-and-Suffix-Search.md b/website/content/ChapterFour/0700~0799/0745.Prefix-and-Suffix-Search.md
similarity index 89%
rename from website/content/ChapterFour/0745.Prefix-and-Suffix-Search.md
rename to website/content/ChapterFour/0700~0799/0745.Prefix-and-Suffix-Search.md
index 705aa2171..6934034ef 100755
--- a/website/content/ChapterFour/0745.Prefix-and-Suffix-Search.md
+++ b/website/content/ChapterFour/0700~0799/0745.Prefix-and-Suffix-Search.md
@@ -95,4 +95,11 @@ func (this *WordFilter_) F_(prefix string, suffix string) int {
* param_1 := obj.F(prefix,suffix);
*/
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0700~0799/0744.Find-Smallest-Letter-Greater-Than-Target/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0700~0799/0746.Min-Cost-Climbing-Stairs/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0746.Min-Cost-Climbing-Stairs.md b/website/content/ChapterFour/0700~0799/0746.Min-Cost-Climbing-Stairs.md
similarity index 85%
rename from website/content/ChapterFour/0746.Min-Cost-Climbing-Stairs.md
rename to website/content/ChapterFour/0700~0799/0746.Min-Cost-Climbing-Stairs.md
index 2abd334b8..b4f00e291 100755
--- a/website/content/ChapterFour/0746.Min-Cost-Climbing-Stairs.md
+++ b/website/content/ChapterFour/0700~0799/0746.Min-Cost-Climbing-Stairs.md
@@ -68,4 +68,11 @@ func minCostClimbingStairs1(cost []int) int {
return last
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0700~0799/0745.Prefix-and-Suffix-Search/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0700~0799/0747.Largest-Number-At-Least-Twice-of-Others/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0700~0799/0747.Largest-Number-At-Least-Twice-of-Others.md b/website/content/ChapterFour/0700~0799/0747.Largest-Number-At-Least-Twice-of-Others.md
new file mode 100644
index 000000000..759e8cb7f
--- /dev/null
+++ b/website/content/ChapterFour/0700~0799/0747.Largest-Number-At-Least-Twice-of-Others.md
@@ -0,0 +1,82 @@
+# [747. Largest Number At Least Twice of Others](https://leetcode.com/problems/largest-number-at-least-twice-of-others/)
+
+
+## 题目
+
+You are given an integer array `nums` where the largest integer is **unique**.
+
+Determine whether the largest element in the array is **at least twice** as much as every other number in the array. If it is, return *the **index** of the largest element, or return* `-1` *otherwise*.
+
+**Example 1:**
+
+```
+Input: nums = [3,6,1,0]
+Output: 1
+Explanation: 6 is the largest integer.
+For every other number in the array x, 6 is at least twice as big as x.
+The index of value 6 is 1, so we return 1.
+
+```
+
+**Example 2:**
+
+```
+Input: nums = [1,2,3,4]
+Output: -1
+Explanation: 4 is less than twice the value of 3, so we return -1.
+```
+
+**Example 3:**
+
+```
+Input: nums = [1]
+Output: 0
+Explanation: 1 is trivially at least twice the value as any other number because there are no other numbers.
+
+```
+
+**Constraints:**
+
+- `1 <= nums.length <= 50`
+- `0 <= nums[i] <= 100`
+- The largest element in `nums` is unique.
+
+## 题目大意
+
+给你一个整数数组 nums ，其中总是存在 唯一的 一个最大整数 。请你找出数组中的最大元素并检查它是否 至少是数组中每个其他数字的两倍 。如果是，则返回 最大元素的下标 ，否则返回 -1 。
+
+## 解题思路
+
+- 简单题。先扫描一遍找到最大值和下标。再扫描一遍检查最大值是否是其他数字的两倍。
+
+## 代码
+
+```go
+package leetcode
+
+func dominantIndex(nums []int) int {
+ maxNum, flag, index := 0, false, 0
+ for i, v := range nums {
+ if v > maxNum {
+ maxNum = v
+ index = i
+ }
+ }
+ for _, v := range nums {
+ if v != maxNum && 2*v > maxNum {
+ flag = true
+ }
+ }
+ if flag {
+ return -1
+ }
+ return index
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0700~0799/0746.Min-Cost-Climbing-Stairs/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0700~0799/0748.Shortest-Completing-Word/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0748.Shortest-Completing-Word.md b/website/content/ChapterFour/0700~0799/0748.Shortest-Completing-Word.md
similarity index 90%
rename from website/content/ChapterFour/0748.Shortest-Completing-Word.md
rename to website/content/ChapterFour/0700~0799/0748.Shortest-Completing-Word.md
index ec0267e33..54e53357a 100755
--- a/website/content/ChapterFour/0748.Shortest-Completing-Word.md
+++ b/website/content/ChapterFour/0700~0799/0748.Shortest-Completing-Word.md
@@ -99,4 +99,11 @@ func match(lp [26]int, w string) bool {
return true
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0700~0799/0747.Largest-Number-At-Least-Twice-of-Others/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0700~0799/0752.Open-the-Lock/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0700~0799/0752.Open-the-Lock.md b/website/content/ChapterFour/0700~0799/0752.Open-the-Lock.md
new file mode 100644
index 000000000..3c442ae7f
--- /dev/null
+++ b/website/content/ChapterFour/0700~0799/0752.Open-the-Lock.md
@@ -0,0 +1,138 @@
+# [752. Open the Lock](https://leetcode.com/problems/open-the-lock/)
+
+
+## 题目
+
+You have a lock in front of you with 4 circular wheels. Each wheel has 10 slots: `'0', '1', '2', '3', '4', '5', '6', '7', '8', '9'`. The wheels can rotate freely and wrap around: for example we can turn `'9'` to be `'0'`, or `'0'` to be `'9'`. Each move consists of turning one wheel one slot.
+
+The lock initially starts at `'0000'`, a string representing the state of the 4 wheels.
+
+You are given a list of `deadends` dead ends, meaning if the lock displays any of these codes, the wheels of the lock will stop turning and you will be unable to open it.
+
+Given a `target` representing the value of the wheels that will unlock the lock, return the minimum total number of turns required to open the lock, or -1 if it is impossible.
+
+**Example 1:**
+
+```
+Input: deadends = ["0201","0101","0102","1212","2002"], target = "0202"
+Output: 6
+Explanation:
+A sequence of valid moves would be "0000" -> "1000" -> "1100" -> "1200" -> "1201" -> "1202" -> "0202".
+Note that a sequence like "0000" -> "0001" -> "0002" -> "0102" -> "0202" would be invalid,
+because the wheels of the lock become stuck after the display becomes the dead end "0102".
+
+```
+
+**Example 2:**
+
+```
+Input: deadends = ["8888"], target = "0009"
+Output: 1
+Explanation:
+We can turn the last wheel in reverse to move from "0000" -> "0009".
+
+```
+
+**Example 3:**
+
+```
+Input: deadends = ["8887","8889","8878","8898","8788","8988","7888","9888"], target = "8888"
+Output: -1
+Explanation:
+We can't reach the target without getting stuck.
+
+```
+
+**Example 4:**
+
+```
+Input: deadends = ["0000"], target = "8888"
+Output: -1
+
+```
+
+**Constraints:**
+
+- `1 <= deadends.length <= 500`
+- `deadends[i].length == 4`
+- `target.length == 4`
+- target **will not be** in the list `deadends`.
+- `target` and `deadends[i]` consist of digits only.
+
+## 题目大意
+
+你有一个带有四个圆形拨轮的转盘锁。每个拨轮都有10个数字： '0', '1', '2', '3', '4', '5', '6', '7', '8', '9' 。每个拨轮可以自由旋转：例如把 '9' 变为 '0'，'0' 变为 '9' 。每次旋转都只能旋转一个拨轮的一位数字。锁的初始数字为 '0000' ，一个代表四个拨轮的数字的字符串。列表 deadends 包含了一组死亡数字，一旦拨轮的数字和列表里的任何一个元素相同，这个锁将会被永久锁定，无法再被旋转。字符串 target 代表可以解锁的数字，你需要给出解锁需要的最小旋转次数，如果无论如何不能解锁，返回 -1 。
+
+## 解题思路
+
+- 此题可以转化为从起始点到终点的最短路径。采用广度优先搜索。每次广搜枚举转动一次数字的状态，并且用 visited 记录是否被搜索过，如果没有被搜索过，便加入队列，下一轮继续搜索。如果搜索到了 target，便返回对应的旋转次数。如果搜索完成后，仍没有搜索到 target，说明无法解锁，返回 -1。特殊情况，如果 target 就是初始数字 0000，那么直接返回答案 0。
+- 在广搜之前，先将 deadends 放入 map 中，搜索中判断是否搜到了 deadends。如果初始数字 0000 出现在 deadends 中，可以直接返回答案 −1。
+
+## 代码
+
+```go
+package leetcode
+
+func openLock(deadends []string, target string) int {
+ if target == "0000" {
+ return 0
+ }
+ targetNum, visited := strToInt(target), make([]bool, 10000)
+ visited[0] = true
+ for _, deadend := range deadends {
+ num := strToInt(deadend)
+ if num == 0 {
+ return -1
+ }
+ visited[num] = true
+ }
+ depth, curDepth, nextDepth := 0, []int16{0}, make([]int16, 0)
+ var nextNum int16
+ for len(curDepth) > 0 {
+ nextDepth = nextDepth[0:0]
+ for _, curNum := range curDepth {
+ for incrementer := int16(1000); incrementer > 0; incrementer /= 10 {
+ digit := (curNum / incrementer) % 10
+ if digit == 9 {
+ nextNum = curNum - 9*incrementer
+ } else {
+ nextNum = curNum + incrementer
+ }
+ if nextNum == targetNum {
+ return depth + 1
+ }
+ if !visited[nextNum] {
+ visited[nextNum] = true
+ nextDepth = append(nextDepth, nextNum)
+ }
+ if digit == 0 {
+ nextNum = curNum + 9*incrementer
+ } else {
+ nextNum = curNum - incrementer
+ }
+ if nextNum == targetNum {
+ return depth + 1
+ }
+ if !visited[nextNum] {
+ visited[nextNum] = true
+ nextDepth = append(nextDepth, nextNum)
+ }
+ }
+ }
+ curDepth, nextDepth = nextDepth, curDepth
+ depth++
+ }
+ return -1
+}
+
+func strToInt(str string) int16 {
+ return int16(str[0]-'0')*1000 + int16(str[1]-'0')*100 + int16(str[2]-'0')*10 + int16(str[3]-'0')
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0700~0799/0748.Shortest-Completing-Word/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0700~0799/0753.Cracking-the-Safe/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0753.Cracking-the-Safe.md b/website/content/ChapterFour/0700~0799/0753.Cracking-the-Safe.md
similarity index 89%
rename from website/content/ChapterFour/0753.Cracking-the-Safe.md
rename to website/content/ChapterFour/0700~0799/0753.Cracking-the-Safe.md
index 39c79a48d..3a919ce78 100644
--- a/website/content/ChapterFour/0753.Cracking-the-Safe.md
+++ b/website/content/ChapterFour/0700~0799/0753.Cracking-the-Safe.md
@@ -89,4 +89,11 @@ func dfsCrackSafe(depth, n, k int, str *[]byte, visit *map[string]bool) bool {
}
return false
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0700~0799/0752.Open-the-Lock/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0700~0799/0756.Pyramid-Transition-Matrix/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0756.Pyramid-Transition-Matrix.md b/website/content/ChapterFour/0700~0799/0756.Pyramid-Transition-Matrix.md
similarity index 90%
rename from website/content/ChapterFour/0756.Pyramid-Transition-Matrix.md
rename to website/content/ChapterFour/0700~0799/0756.Pyramid-Transition-Matrix.md
index 1b158131c..8694d1fee 100755
--- a/website/content/ChapterFour/0756.Pyramid-Transition-Matrix.md
+++ b/website/content/ChapterFour/0700~0799/0756.Pyramid-Transition-Matrix.md
@@ -89,4 +89,11 @@ func dfsT(bottom, above string, pyramid map[string][]string) bool {
return false
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0700~0799/0753.Cracking-the-Safe/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0700~0799/0762.Prime-Number-of-Set-Bits-in-Binary-Representation/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0762.Prime-Number-of-Set-Bits-in-Binary-Representation.md b/website/content/ChapterFour/0700~0799/0762.Prime-Number-of-Set-Bits-in-Binary-Representation.md
similarity index 86%
rename from website/content/ChapterFour/0762.Prime-Number-of-Set-Bits-in-Binary-Representation.md
rename to website/content/ChapterFour/0700~0799/0762.Prime-Number-of-Set-Bits-in-Binary-Representation.md
index 8c01e90f6..a4c571cf2 100755
--- a/website/content/ChapterFour/0762.Prime-Number-of-Set-Bits-in-Binary-Representation.md
+++ b/website/content/ChapterFour/0700~0799/0762.Prime-Number-of-Set-Bits-in-Binary-Representation.md
@@ -75,4 +75,11 @@ func isPrime(x int) bool {
return x == 2 || x == 3 || x == 5 || x == 7 || x == 11 || x == 13 || x == 17 || x == 19
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0700~0799/0756.Pyramid-Transition-Matrix/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0700~0799/0763.Partition-Labels/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0763.Partition-Labels.md b/website/content/ChapterFour/0700~0799/0763.Partition-Labels.md
similarity index 85%
rename from website/content/ChapterFour/0763.Partition-Labels.md
rename to website/content/ChapterFour/0700~0799/0763.Partition-Labels.md
index 76bf1b3f7..68b1b7b24 100644
--- a/website/content/ChapterFour/0763.Partition-Labels.md
+++ b/website/content/ChapterFour/0700~0799/0763.Partition-Labels.md
@@ -34,7 +34,7 @@ A partition like "ababcbacadefegde", "hijhklij" is incorrect, because it splits
## 解题思路
-这一题有 2 种思路，第一种思路是先记录下每个字母的出现次数，然后对滑动窗口中的每个字母判断次数是否用尽为 0，如果这个窗口内的所有字母次数都为 0，这个窗口就是符合条件的窗口。时间复杂度为 O(n^2)
+这一题有 2 种思路，第一种思路是先记录下每个字母的出现次数，然后对滑动窗口中的每个字母判断次数是否用尽为 0，如果这个窗口内的所有字母次数都为 0，这个窗口就是符合条件的窗口。时间复杂度为 O(n)
另外一种思路是记录下每个字符最后一次出现的下标，这样就不用记录次数。在每个滑动窗口中，依次判断每个字母最后一次出现的位置，如果在一个下标内，所有字母的最后一次出现的位置都包含进来了，那么这个下标就是这个满足条件的窗口大小。时间复杂度为 O(n^2)
@@ -89,4 +89,11 @@ func partitionLabels1(S string) []int {
return res
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0700~0799/0762.Prime-Number-of-Set-Bits-in-Binary-Representation/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0700~0799/0765.Couples-Holding-Hands/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0765.Couples-Holding-Hands.md b/website/content/ChapterFour/0700~0799/0765.Couples-Holding-Hands.md
similarity index 91%
rename from website/content/ChapterFour/0765.Couples-Holding-Hands.md
rename to website/content/ChapterFour/0700~0799/0765.Couples-Holding-Hands.md
index 035512fe7..988f3eaea 100755
--- a/website/content/ChapterFour/0765.Couples-Holding-Hands.md
+++ b/website/content/ChapterFour/0700~0799/0765.Couples-Holding-Hands.md
@@ -70,7 +70,7 @@ N 对情侣坐在连续排列的 2N 个座位上，想要牵到对方的手。
package leetcode
import (
- "github.com/halfrost/LeetCode-Go/template"
+ "github.com/halfrost/leetcode-go/template"
)
func minSwapsCouples(row []int) int {
@@ -90,4 +90,11 @@ func minSwapsCouples(row []int) int {
return len(row)/2 - uf.TotalCount()
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0700~0799/0763.Partition-Labels/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0700~0799/0766.Toeplitz-Matrix/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0766.Toeplitz-Matrix.md b/website/content/ChapterFour/0700~0799/0766.Toeplitz-Matrix.md
similarity index 83%
rename from website/content/ChapterFour/0766.Toeplitz-Matrix.md
rename to website/content/ChapterFour/0700~0799/0766.Toeplitz-Matrix.md
index a595e632b..e18758dac 100755
--- a/website/content/ChapterFour/0766.Toeplitz-Matrix.md
+++ b/website/content/ChapterFour/0700~0799/0766.Toeplitz-Matrix.md
@@ -76,4 +76,11 @@ func isToeplitzMatrix(matrix [][]int) bool {
return true
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0700~0799/0765.Couples-Holding-Hands/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0700~0799/0767.Reorganize-String/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0767.Reorganize-String.md b/website/content/ChapterFour/0700~0799/0767.Reorganize-String.md
similarity index 90%
rename from website/content/ChapterFour/0767.Reorganize-String.md
rename to website/content/ChapterFour/0700~0799/0767.Reorganize-String.md
index 45388be33..c3bb92342 100644
--- a/website/content/ChapterFour/0767.Reorganize-String.md
+++ b/website/content/ChapterFour/0700~0799/0767.Reorganize-String.md
@@ -146,4 +146,11 @@ func frequencySort767(s string) string {
return string(res)
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0700~0799/0766.Toeplitz-Matrix/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0700~0799/0771.Jewels-and-Stones/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0771.Jewels-and-Stones.md b/website/content/ChapterFour/0700~0799/0771.Jewels-and-Stones.md
similarity index 81%
rename from website/content/ChapterFour/0771.Jewels-and-Stones.md
rename to website/content/ChapterFour/0700~0799/0771.Jewels-and-Stones.md
index e5490bedd..1d6f568c1 100755
--- a/website/content/ChapterFour/0771.Jewels-and-Stones.md
+++ b/website/content/ChapterFour/0700~0799/0771.Jewels-and-Stones.md
@@ -71,4 +71,11 @@ func numJewelsInStones1(J string, S string) int {
return result
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0700~0799/0767.Reorganize-String/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0700~0799/0775.Global-and-Local-Inversions/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0700~0799/0775.Global-and-Local-Inversions.md b/website/content/ChapterFour/0700~0799/0775.Global-and-Local-Inversions.md
new file mode 100644
index 000000000..03345b905
--- /dev/null
+++ b/website/content/ChapterFour/0700~0799/0775.Global-and-Local-Inversions.md
@@ -0,0 +1,71 @@
+# [775. Global and Local Inversions](https://leetcode.com/problems/global-and-local-inversions/)
+
+
+## 题目
+
+We have some permutation `A` of `[0, 1, ..., N - 1]`, where `N` is the length of `A`.
+
+The number of (global) inversions is the number of `i < j` with `0 <= i < j < N` and `A[i] > A[j]`.
+
+The number of local inversions is the number of `i` with `0 <= i < N` and `A[i] > A[i+1]`.
+
+Return `true` if and only if the number of global inversions is equal to the number of local inversions.
+
+**Example 1:**
+
+```
+Input: A = [1,0,2]
+Output: true
+Explanation: There is 1 global inversion, and 1 local inversion.
+```
+
+**Example 2:**
+
+```
+Input: A = [1,2,0]
+Output: false
+Explanation: There are 2 global inversions, and 1 local inversion.
+```
+
+**Note:**
+
+- `A` will be a permutation of `[0, 1, ..., A.length - 1]`.
+- `A` will have length in range `[1, 5000]`.
+- The time limit for this problem has been reduced.
+
+## 题目大意
+
+数组 A 是 [0, 1, ..., N - 1] 的一种排列，N 是数组 A 的长度。全局倒置指的是 i,j 满足 0 <= i < j < N 并且 A[i] > A[j] ，局部倒置指的是 i 满足 0 <= i < N 并且 A[i] > A[i+1] 。当数组 A 中全局倒置的数量等于局部倒置的数量时，返回 true 。
+
+## 解题思路
+
+- 本题代码非常简单，重在思考的过程。`[0, 1, ..., N - 1]` 不出现全局倒置的理想情况应该是 `i` 排列在 `A[i-1]`，`A[i]`，`A[i+1]` 的位置上。例如 `1` 如果排列在 `A[3]` 的位置上，那么比 `1` 小的只有 `0` 一个元素，`A[0]`，`A[1]`，`A[2]` 中必定有 2 个元素比 `1` 大，那必须会出现全局倒置的情况。`[0, 1, ..., N - 1]` 这是最理想的情况，每个元素都在自己的位置上。每个元素如果往左右相互偏移 1 个元素，那么也能保证只存在局部倒置，如果左右偏移 2 个元素，那必定会出现全局倒置。所以结论是：**不出现全局倒置的理想情况应该是 `i` 排列在 `A[i-1]`，`A[i]`，`A[i+1]` 的位置上**。判断这个结论的代码很简单，只需要判断 `A[i] - i` 的取值是否是 -1，0，1，也即 `abs(A[i] - i ) ≤ 1`。
+
+## 代码
+
+```go
+package leetcode
+
+func isIdealPermutation(A []int) bool {
+ for i := range A {
+ if abs(A[i]-i) > 1 {
+ return false
+ }
+ }
+ return true
+}
+
+func abs(a int) int {
+ if a < 0 {
+ return -a
+ }
+ return a
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0700~0799/0771.Jewels-and-Stones/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0700~0799/0778.Swim-in-Rising-Water/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0778.Swim-in-Rising-Water.md b/website/content/ChapterFour/0700~0799/0778.Swim-in-Rising-Water.md
similarity index 92%
rename from website/content/ChapterFour/0778.Swim-in-Rising-Water.md
rename to website/content/ChapterFour/0700~0799/0778.Swim-in-Rising-Water.md
index 7153069f3..6ac095ff3 100755
--- a/website/content/ChapterFour/0778.Swim-in-Rising-Water.md
+++ b/website/content/ChapterFour/0700~0799/0778.Swim-in-Rising-Water.md
@@ -65,7 +65,7 @@ You start at the top left square `(0, 0)`. What is the least time until you can
package leetcode
import (
- "github.com/halfrost/LeetCode-Go/template"
+ "github.com/halfrost/leetcode-go/template"
)
// 解法一 DFS + 二分
@@ -129,4 +129,11 @@ func swimInWater1(grid [][]int) int {
return res - 1
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0700~0799/0775.Global-and-Local-Inversions/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0700~0799/0781.Rabbits-in-Forest/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0781.Rabbits-in-Forest.md b/website/content/ChapterFour/0700~0799/0781.Rabbits-in-Forest.md
similarity index 84%
rename from website/content/ChapterFour/0781.Rabbits-in-Forest.md
rename to website/content/ChapterFour/0700~0799/0781.Rabbits-in-Forest.md
index 61aa4555a..cf8d19323 100755
--- a/website/content/ChapterFour/0781.Rabbits-in-Forest.md
+++ b/website/content/ChapterFour/0700~0799/0781.Rabbits-in-Forest.md
@@ -66,4 +66,11 @@ func numRabbits(ans []int) int {
return total
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0700~0799/0778.Swim-in-Rising-Water/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0700~0799/0783.Minimum-Distance-Between-BST-Nodes/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0700~0799/0783.Minimum-Distance-Between-BST-Nodes.md b/website/content/ChapterFour/0700~0799/0783.Minimum-Distance-Between-BST-Nodes.md
new file mode 100644
index 000000000..ae6f93087
--- /dev/null
+++ b/website/content/ChapterFour/0700~0799/0783.Minimum-Distance-Between-BST-Nodes.md
@@ -0,0 +1,102 @@
+# [783. Minimum Distance Between BST Nodes](https://leetcode.com/problems/minimum-distance-between-bst-nodes/)
+
+
+## 题目
+
+Given the `root` of a Binary Search Tree (BST), return *the minimum difference between the values of any two different nodes in the tree*.
+
+**Note:** This question is the same as 530: [https://leetcode.com/problems/minimum-absolute-difference-in-bst/](https://leetcode.com/problems/minimum-absolute-difference-in-bst/)
+
+**Example 1:**
+
+
+
+```
+Input: root = [4,2,6,1,3]
+Output: 1
+```
+
+**Example 2:**
+
+
+
+```
+Input: root = [1,0,48,null,null,12,49]
+Output: 1
+```
+
+**Constraints:**
+
+- The number of nodes in the tree is in the range `[2, 100]`.
+- `0 <= Node.val <= 10^5`
+
+## 题目大意
+
+给你一个二叉搜索树的根节点 root ，返回 树中任意两不同节点值之间的最小差值 。
+
+## 解题思路
+
+- 本题和第 530 题完全相同。解题思路见第 530 题。
+
+## 代码
+
+```go
+package leetcode
+
+import (
+ "math"
+
+ "github.com/halfrost/leetcode-go/structures"
+)
+
+// TreeNode define
+type TreeNode = structures.TreeNode
+
+/**
+ * Definition for a binary tree node.
+ * type TreeNode struct {
+ * Val int
+ * Left *TreeNode
+ * Right *TreeNode
+ * }
+ */
+
+func minDiffInBST(root *TreeNode) int {
+ res, nodes := math.MaxInt16, -1
+ dfsBST(root, &res, &nodes)
+ return res
+}
+
+func dfsBST(root *TreeNode, res, pre *int) {
+ if root == nil {
+ return
+ }
+ dfsBST(root.Left, res, pre)
+ if *pre != -1 {
+ *res = min(*res, abs(root.Val-*pre))
+ }
+ *pre = root.Val
+ dfsBST(root.Right, res, pre)
+}
+
+func min(a, b int) int {
+ if a > b {
+ return b
+ }
+ return a
+}
+
+func abs(a int) int {
+ if a > 0 {
+ return a
+ }
+ return -a
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0700~0799/0781.Rabbits-in-Forest/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0700~0799/0784.Letter-Case-Permutation/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0784.Letter-Case-Permutation.md b/website/content/ChapterFour/0700~0799/0784.Letter-Case-Permutation.md
similarity index 86%
rename from website/content/ChapterFour/0784.Letter-Case-Permutation.md
rename to website/content/ChapterFour/0700~0799/0784.Letter-Case-Permutation.md
index 323b4e63e..5954779f4 100755
--- a/website/content/ChapterFour/0784.Letter-Case-Permutation.md
+++ b/website/content/ChapterFour/0700~0799/0784.Letter-Case-Permutation.md
@@ -117,4 +117,11 @@ func toUpper(s string, i int) string {
return string(b)
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0700~0799/0783.Minimum-Distance-Between-BST-Nodes/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0700~0799/0785.Is-Graph-Bipartite/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0700~0799/0785.Is-Graph-Bipartite.md b/website/content/ChapterFour/0700~0799/0785.Is-Graph-Bipartite.md
new file mode 100644
index 000000000..748451eef
--- /dev/null
+++ b/website/content/ChapterFour/0700~0799/0785.Is-Graph-Bipartite.md
@@ -0,0 +1,105 @@
+# [785. Is Graph Bipartite?](https://leetcode.com/problems/is-graph-bipartite/)
+
+
+## 题目
+
+Given an undirected `graph`, return `true` if and only if it is bipartite.
+
+Recall that a graph is *bipartite* if we can split it's set of nodes into two independent subsets A and B such that every edge in the graph has one node in A and another node in B.
+
+The graph is given in the following form: `graph[i]` is a list of indexes `j` for which the edge between nodes `i` and `j` exists. Each node is an integer between `0` and `graph.length - 1`. There are no self edges or parallel edges: `graph[i]` does not contain `i`, and it doesn't contain any element twice.
+
+
+ Example 1:Input: [[1,3], [0,2], [1,3], [0,2]]
+ Output: true
+ Explanation:
+ The graph looks like this:
+ 0----1
+ | |
+ | |
+ 3----2
+ We can divide the vertices into two groups: {0, 2} and {1, 3}.
+
+
+ Example 2:Input: [[1,2,3], [0,2], [0,1,3], [0,2]]
+ Output: false
+ Explanation:
+ The graph looks like this:
+ 0----1
+ | \ |
+ | \ |
+ 3----2
+ We cannot find a way to divide the set of nodes into two independent subsets.
+
+
+**Note**:
+
+- `graph` will have length in range `[1, 100]`.
+- `graph[i]` will contain integers in range `[0, graph.length - 1]`.
+- `graph[i]` will not contain `i` or duplicate values.
+- The graph is undirected: if any element `j` is in `graph[i]`, then `i` will be in `graph[j]`.
+
+## 题目大意
+
+给定一个无向图 graph，当这个图为二分图时返回 true。
+
+graph 将会以邻接表方式给出，graph[i] 表示图中与节点i相连的所有节点。每个节点都是一个在 0 到 graph.length-1 之间的整数。这图中没有自环和平行边： graph[i] 中不存在 i，并且 graph[i] 中没有重复的值。
+
+注意:
+
+- graph 的长度范围为 [1, 100]。
+- graph[i] 中的元素的范围为 [0, graph.length - 1]。
+- graph[i] 不会包含 i 或者有重复的值。
+- 图是无向的: 如果 j 在 graph[i] 里边, 那么 i 也会在 graph[j] 里边。
+
+## 解题思路
+
+- 判断一个无向图是否是二分图。二分图的定义：如果我们能将一个图的节点集合分割成两个独立的子集 A 和 B，并使图中的每一条边的两个节点一个来自 A 集合，一个来自 B 集合，我们就将这个图称为二分图。
+- 这一题可以用 BFS、DFS、并查集来解答。这里是 DFS 实现。任选一个节点开始，把它染成红色，然后对整个图 DFS 遍历，把与它相连的节点并且未被染色的，都染成绿色。颜色不同的节点代表不同的集合。这时候还可能遇到第 2 种情况，与它相连的节点已经有颜色了，并且这个颜色和前一个节点的颜色相同，这就说明了该无向图不是二分图。可以直接 return false。如此遍历到所有节点都染色了，如果能染色成功，说明该无向图是二分图，返回 true。
+
+## 代码
+
+```go
+package leetcode
+
+// DFS 染色，1 是红色，0 是绿色，-1 是未染色
+func isBipartite(graph [][]int) bool {
+ colors := make([]int, len(graph))
+ for i := range colors {
+ colors[i] = -1
+ }
+ for i := range graph {
+ if !dfs(i, graph, colors, -1) {
+ return false
+ }
+ }
+ return true
+}
+
+func dfs(n int, graph [][]int, colors []int, parentCol int) bool {
+ if colors[n] == -1 {
+ if parentCol == 1 {
+ colors[n] = 0
+ } else {
+ colors[n] = 1
+ }
+ } else if colors[n] == parentCol {
+ return false
+ } else if colors[n] != parentCol {
+ return true
+ }
+ for _, c := range graph[n] {
+ if !dfs(c, graph, colors, colors[n]) {
+ return false
+ }
+ }
+ return true
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0700~0799/0784.Letter-Case-Permutation/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0700~0799/0786.K-th-Smallest-Prime-Fraction/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0786.K-th-Smallest-Prime-Fraction.md b/website/content/ChapterFour/0700~0799/0786.K-th-Smallest-Prime-Fraction.md
similarity index 91%
rename from website/content/ChapterFour/0786.K-th-Smallest-Prime-Fraction.md
rename to website/content/ChapterFour/0700~0799/0786.K-th-Smallest-Prime-Fraction.md
index 9646d5af7..ac61759e4 100755
--- a/website/content/ChapterFour/0786.K-th-Smallest-Prime-Fraction.md
+++ b/website/content/ChapterFour/0700~0799/0786.K-th-Smallest-Prime-Fraction.md
@@ -116,4 +116,11 @@ func (a SortByFraction) Less(i, j int) bool {
return a[i].molecule*a[j].denominator < a[j].molecule*a[i].denominator
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0700~0799/0785.Is-Graph-Bipartite/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0700~0799/0791.Custom-Sort-String/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0700~0799/0791.Custom-Sort-String.md b/website/content/ChapterFour/0700~0799/0791.Custom-Sort-String.md
new file mode 100644
index 000000000..80de5408e
--- /dev/null
+++ b/website/content/ChapterFour/0700~0799/0791.Custom-Sort-String.md
@@ -0,0 +1,62 @@
+# [791. Custom Sort String](https://leetcode.com/problems/custom-sort-string/)
+
+
+## 题目
+
+`order` and `str` are strings composed of lowercase letters. In `order`, no letter occurs more than once.
+
+`order` was sorted in some custom order previously. We want to permute the characters of `str` so that they match the order that `order` was sorted. More specifically, if `x` occurs before `y` in `order`, then `x` should occur before `y` in the returned string.
+
+Return any permutation of `str` (as a string) that satisfies this property.
+
+```
+Example:Input:
+order = "cba"
+str = "abcd"
+Output: "cbad"
+Explanation:
+"a", "b", "c" appear in order, so the order of "a", "b", "c" should be "c", "b", and "a".
+Since "d" does not appear in order, it can be at any position in the returned string. "dcba", "cdba", "cbda" are also valid outputs.
+
+```
+
+**Note:**
+
+- `order` has length at most `26`, and no character is repeated in `order`.
+- `str` has length at most `200`.
+- `order` and `str` consist of lowercase letters only.
+
+## 题目大意
+
+字符串 S 和 T 只包含小写字符。在 S 中，所有字符只会出现一次。S 已经根据某种规则进行了排序。我们要根据 S 中的字符顺序对 T 进行排序。更具体地说，如果 S 中 x 在 y 之前出现，那么返回的字符串中 x 也应出现在 y 之前。返回任意一种符合条件的字符串 T。
+
+## 解题思路
+
+- 题目只要求 T 中包含 S 的字符串有序，所以可以先将 T 中包含 S 的字符串排好序，然后再拼接上其他字符。S 字符串最长为 26 位，先将 S 中字符的下标向左偏移 30，并将偏移后的下标值存入字典中。再把 T 字符串按照字典中下标值进行排序。S 中出现的字符对应的下标经过处理以后变成了负数，S 中未出现的字符的下标还是正数。所以经过排序以后，S 中出现的字符按照原有顺序排列在前面，S 中未出现的字符依次排在后面。
+
+## 代码
+
+```go
+package leetcode
+
+import "sort"
+
+func customSortString(order string, str string) string {
+ magic := map[byte]int{}
+ for i := range order {
+ magic[order[i]] = i - 30
+ }
+ byteSlice := []byte(str)
+ sort.Slice(byteSlice, func(i, j int) bool {
+ return magic[byteSlice[i]] < magic[byteSlice[j]]
+ })
+ return string(byteSlice)
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0700~0799/0786.K-th-Smallest-Prime-Fraction/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0700~0799/0792.Number-of-Matching-Subsequences/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0700~0799/0792.Number-of-Matching-Subsequences.md b/website/content/ChapterFour/0700~0799/0792.Number-of-Matching-Subsequences.md
new file mode 100644
index 000000000..9f773b9e2
--- /dev/null
+++ b/website/content/ChapterFour/0700~0799/0792.Number-of-Matching-Subsequences.md
@@ -0,0 +1,73 @@
+# [792. Number of Matching Subsequences](https://leetcode.com/problems/number-of-matching-subsequences/)
+
+
+## 题目
+
+Given a string `s` and an array of strings `words`, return *the number of* `words[i]` *that is a subsequence of* `s`.
+
+A **subsequence** of a string is a new string generated from the original string with some characters (can be none) deleted without changing the relative order of the remaining characters.
+
+- For example, `"ace"` is a subsequence of `"abcde"`.
+
+**Example 1:**
+
+```
+Input: s = "abcde", words = ["a","bb","acd","ace"]
+Output: 3
+Explanation: There are three strings in words that are a subsequence of s: "a", "acd", "ace".
+```
+
+**Example 2:**
+
+```
+Input: s = "dsahjpjauf", words = ["ahjpjau","ja","ahbwzgqnuk","tnmlanowax"]
+Output: 2
+```
+
+**Constraints:**
+
+- `1 <= s.length <= 5 * 104`
+- `1 <= words.length <= 5000`
+- `1 <= words[i].length <= 50`
+- `s` and `words[i]` consist of only lowercase English letters.
+
+## 题目大意
+
+给定字符串 S 和单词字典 words, 求 words[i] 中是 S 的子序列的单词个数。
+
+## 解题思路
+
+- 如果将 words 数组内的字符串每次都在源字符串 S 中匹配，这种暴力解法超时。超时原因是对字符串 S 遍历了多次。是否有更加高效的方法呢？
+- 把 words 数组内字符串按照首字母，分到 26 个桶中。从头开始遍历一遍源字符串 S，每扫一个字母，命中 26 个桶中其中一个桶，修改这个桶中的字符串。例如：当前遍历到了 'o'，此时桶中存的数据是 'a' : ['amy','aop'], 'o': ['oqp','onwn']，那么调整 'o' 桶中的数据后，各桶的状态为，'a' : ['amy','aop'], 'q': ['qp'], 'n': ['nwn']。从头到尾扫完整个字符串 S，某个桶中的字符串被清空，说明该桶中的字符串都符合 S 的子序列。将符合子序列的字符串个数累加起来即为最终答案。
+
+## 代码
+
+```go
+package leetcode
+
+func numMatchingSubseq(s string, words []string) int {
+ hash, res := make([][]string, 26), 0
+ for _, w := range words {
+ hash[int(w[0]-'a')] = append(hash[int(w[0]-'a')], w)
+ }
+ for _, c := range s {
+ words := hash[int(byte(c)-'a')]
+ hash[int(byte(c)-'a')] = []string{}
+ for _, w := range words {
+ if len(w) == 1 {
+ res += 1
+ continue
+ }
+ hash[int(w[1]-'a')] = append(hash[int(w[1]-'a')], w[1:])
+ }
+ }
+ return res
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0700~0799/0791.Custom-Sort-String/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0700~0799/0793.Preimage-Size-of-Factorial-Zeroes-Function/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0700~0799/0793.Preimage-Size-of-Factorial-Zeroes-Function.md b/website/content/ChapterFour/0700~0799/0793.Preimage-Size-of-Factorial-Zeroes-Function.md
new file mode 100755
index 000000000..deca87330
--- /dev/null
+++ b/website/content/ChapterFour/0700~0799/0793.Preimage-Size-of-Factorial-Zeroes-Function.md
@@ -0,0 +1,108 @@
+# [793. Preimage Size of Factorial Zeroes Function](https://leetcode.com/problems/preimage-size-of-factorial-zeroes-function/)
+
+
+## 题目
+
+Let `f(x)` be the number of zeroes at the end of `x!`. (Recall that `x! = 1 * 2 * 3 * ... * x`, and by convention, `0! = 1`.)
+
+For example, `f(3) = 0` because 3! = 6 has no zeroes at the end, while `f(11) = 2` because 11! = 39916800 has 2 zeroes at the end. Given `K`, find how many non-negative integers `x` have the property that `f(x) = K`.
+
+**Example 1**:
+
+ Input: K = 0
+ Output: 5
+ Explanation: 0!, 1!, 2!, 3!, and 4! end with K = 0 zeroes.
+
+**Example 2**:
+
+ Input: K = 5
+ Output: 0
+ Explanation: There is no x such that x! ends in K = 5 zeroes.
+
+**Note**:
+
+- `K` will be an integer in the range `[0, 10^9]`.
+
+
+## 题目大意
+
+
+f(x) 是 x! 末尾是0的数量。（回想一下 x! = 1 * 2 * 3 * ... * x，且0! = 1）
+
+例如， f(3) = 0 ，因为3! = 6的末尾没有0；而 f(11) = 2 ，因为11!= 39916800末端有2个0。给定 K，找出多少个非负整数x ，有 f(x) = K 的性质。
+
+注意：
+
+- K 是范围在 [0, 10^9] 的整数。
+
+
+## 解题思路
+
+- 给出一个数 K，要求有多少个 n 能使得 n！末尾 0 的个数等于 K。
+- 这一题是基于第 172 题的逆过程加强版。第 172 题是给出 `n`，求得末尾 0 的个数。由第 172 题可以知道，`n！`末尾 0 的个数取决于因子 5 的个数。末尾可能有 `K` 个 0，那么 `n` 最多可以等于 `5 * K`，在 `[0, 5* K]` 区间内二分搜索，判断 `mid` 末尾 0 的个数，如果能找到 `K`，那么就范围 5，如果找不到这个 `K`，返回 0 。为什么答案取值只有 0 和 5 呢？因为当 `n` 增加 5 以后，因子 5 的个数又加一了，末尾又可以多 1 个或者多个 0(如果加 5 以后，有多个 5 的因子，例如 25，125，就有可能末尾增加多个 0)。所以有效的 `K` 值对应的 `n` 的范围区间就是 5 。反过来，无效的 `K` 值对应的 `n` 是 0。`K` 在 `5^n` 的分界线处会发生跳变，所有有些值取不到。例如，`n` 在 `[0,5)` 内取值，`K = 0`；`n` 在 `[5,10)` 内取值，`K = 1`；`n` 在 `[10,15)` 内取值，`K = 2`；`n` 在 `[15,20)` 内取值，`K = 3`；`n` 在 `[20,25)` 内取值，`K = 4`；`n` 在 `[25,30)` 内取值，`K = 6`，因为 25 提供了 2 个 5，也就提供了 2 个 0，所以 `K` 永远无法取值等于 5，即当 `K = 5` 时，找不到任何的 `n` 与之对应。
+- 这一题也可以用数学的方法解题。见解法二。这个解法的灵感来自于：n！末尾 0 的个数等于 [1,n] 所有数的因子 5 的个数总和。其次此题的结果一定只有 0 和 5 (分析见上一种解法)。有了这两个结论以后，就可以用数学的方法推导了。首先 n 可以表示为 5 进制的形式
+{{< katex display >}}
+n = 5^{0} * a_{0} + 5^{1} * a_{1} + 5^{2} * a_{2} + ... + 5^{n} * a_{n}, (a_{n} < 5)
+{{< /katex >}}
+ 上面式子中，所有有因子 5 的个数为：
+{{< katex display >}}
+K = \sum_{n=0}^{n} a_{n} * c_{n}
+{{< /katex >}}
+ 这个总数就即是 K。针对不同的 n，an 的通项公式不同，所以表示的 K 的系数也不同。cn 的通项公式呢？
+{{< katex display >}}
+c_{n} = 5 * c_{n-1} + 1，c_{0} = 0
+{{< /katex >}}
+ 由上面这个递推还能推出通项公式(不过这题不适用通项公式，是用递推公式更方便)：
+{{< katex display >}}
+c_{n} = \frac{5^{n} - 1 }{4}
+{{< /katex >}}
+ 判断 K 是否能表示成两个数列的表示形式，等价于判断 K 是否能转化为以 Cn 为基的变进制数。到此，转化成类似第 483 题了。代码实现不难，见解法二。
+
+
+## 代码
+
+```go
+
+package leetcode
+
+// 解法一 二分搜索
+func preimageSizeFZF(K int) int {
+ low, high := 0, 5*K
+ for low <= high {
+ mid := low + (high-low)>>1
+ k := trailingZeroes(mid)
+ if k == K {
+ return 5
+ } else if k > K {
+ high = mid - 1
+ } else {
+ low = mid + 1
+ }
+ }
+ return 0
+}
+
+// 解法二 数学方法
+func preimageSizeFZF1(K int) int {
+ base := 0
+ for base < K {
+ base = base*5 + 1
+ }
+ for K > 0 {
+ base = (base - 1) / 5
+ if K/base == 5 {
+ return 0
+ }
+ K %= base
+ }
+ return 5
+}
+
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0700~0799/0792.Number-of-Matching-Subsequences/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0700~0799/0794.Valid-Tic-Tac-Toe-State/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0700~0799/0794.Valid-Tic-Tac-Toe-State.md b/website/content/ChapterFour/0700~0799/0794.Valid-Tic-Tac-Toe-State.md
new file mode 100644
index 000000000..6bc24866a
--- /dev/null
+++ b/website/content/ChapterFour/0700~0799/0794.Valid-Tic-Tac-Toe-State.md
@@ -0,0 +1,126 @@
+# [794. Valid Tic-Tac-Toe State](https://leetcode.com/problems/valid-tic-tac-toe-state/)
+
+## 题目
+
+Given a Tic-Tac-Toe board as a string array board, return true if and only if it is possible to reach this board position during the course of a valid tic-tac-toe game.
+
+The board is a 3 x 3 array that consists of characters ' ', 'X', and 'O'. The ' ' character represents an empty square.
+
+Here are the rules of Tic-Tac-Toe:
+
+- Players take turns placing characters into empty squares ' '.
+- The first player always places 'X' characters, while the second player always places 'O' characters.
+- 'X' and 'O' characters are always placed into empty squares, never filled ones.
+- The game ends when there are three of the same (non-empty) character filling any row, column, or diagonal.
+- The game also ends if all squares are non-empty.
+- No more moves can be played if the game is over.
+
+**Example 1**:
+
+
+
+ Input: board = ["O "," "," "]
+ Output: false
+ Explanation: The first player always plays "X".
+
+**Example 2**:
+
+
+
+ Input: board = ["XOX"," X "," "]
+ Output: false
+ Explanation: Players take turns making moves.
+
+**Example 3**:
+
+
+
+ Input: board = ["XXX"," ","OOO"]
+ Output: false
+
+**Example 4**:
+
+
+
+ Input: board = ["XOX","O O","XOX"]
+ Output: true
+
+**Constraints:**
+
+- board.length == 3
+- board[i].length == 3
+- board[i][j] is either 'X', 'O', or ' '.
+
+## 题目大意
+
+给你一个字符串数组 board 表示井字游戏的棋盘。当且仅当在井字游戏过程中，棋盘有可能达到 board 所显示的状态时，才返回 true 。
+
+井字游戏的棋盘是一个 3 x 3 数组，由字符 ' '，'X' 和 'O' 组成。字符 ' ' 代表一个空位。
+
+以下是井字游戏的规则：
+
+- 玩家轮流将字符放入空位（' '）中。
+- 玩家 1 总是放字符 'X' ，而玩家 2 总是放字符 'O' 。
+- 'X' 和 'O' 只允许放置在空位中，不允许对已放有字符的位置进行填充。
+- 当有 3 个相同（且非空）的字符填充任何行、列或对角线时，游戏结束。
+- 当所有位置非空时，也算为游戏结束。
+- 如果游戏结束，玩家不允许再放置字符。
+
+## 解题思路
+
+分类模拟：
+- 根据题意棋盘在任意时候，要么 X 的数量比 O 的数量多 1，要么两者相等
+- X 的数量等于 O 的数量时,任何行、列或对角线都不会出现 3 个相同的 X
+- X 的数量比 O 的数量多 1 时,任何行、列或对角线都不会出现 3 个相同的 O
+
+## 代码
+
+```go
+package leetcode
+
+func validTicTacToe(board []string) bool {
+ cntX, cntO := 0, 0
+ for i := range board {
+ for j := range board[i] {
+ if board[i][j] == 'X' {
+ cntX++
+ } else if board[i][j] == 'O' {
+ cntO++
+ }
+ }
+ }
+ if cntX < cntO || cntX > cntO+1 {
+ return false
+ }
+ if cntX == cntO {
+ return process(board, 'X')
+ }
+ return process(board, 'O')
+}
+
+func process(board []string, c byte) bool {
+ //某一行是"ccc"
+ if board[0] == string([]byte{c, c, c}) || board[1] == string([]byte{c, c, c}) || board[2] == string([]byte{c, c, c}) {
+ return false
+ }
+ //某一列是"ccc"
+ if (board[0][0] == c && board[1][0] == c && board[2][0] == c) ||
+ (board[0][1] == c && board[1][1] == c && board[2][1] == c) ||
+ (board[0][2] == c && board[1][2] == c && board[2][2] == c) {
+ return false
+ }
+ //某一对角线是"ccc"
+ if (board[0][0] == c && board[1][1] == c && board[2][2] == c) ||
+ (board[0][2] == c && board[1][1] == c && board[2][0] == c) {
+ return false
+ }
+ return true
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0700~0799/0793.Preimage-Size-of-Factorial-Zeroes-Function/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0700~0799/0795.Number-of-Subarrays-with-Bounded-Maximum/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0700~0799/0795.Number-of-Subarrays-with-Bounded-Maximum.md b/website/content/ChapterFour/0700~0799/0795.Number-of-Subarrays-with-Bounded-Maximum.md
new file mode 100644
index 000000000..3b206fcca
--- /dev/null
+++ b/website/content/ChapterFour/0700~0799/0795.Number-of-Subarrays-with-Bounded-Maximum.md
@@ -0,0 +1,61 @@
+# [795. Number of Subarrays with Bounded Maximum](https://leetcode.com/problems/number-of-subarrays-with-bounded-maximum/)
+
+
+## 题目
+
+We are given an array `nums` of positive integers, and two positive integers `left` and `right` (`left <= right`).
+
+Return the number of (contiguous, non-empty) subarrays such that the value of the maximum array element in that subarray is at least `left` and at most `right`.
+
+```
+Example:Input:
+nums = [2, 1, 4, 3]
+left = 2
+right = 3
+Output: 3
+Explanation: There are three subarrays that meet the requirements: [2], [2, 1], [3].
+```
+
+**Note:**
+
+- `left`, `right`, and `nums[i]` will be an integer in the range `[0, 109]`.
+- The length of `nums` will be in the range of `[1, 50000]`.
+
+## 题目大意
+
+给定一个元素都是正整数的数组`A` ，正整数 `L` 以及 `R` (`L <= R`)。求连续、非空且其中最大元素满足大于等于`L` 小于等于`R`的子数组个数。
+
+## 解题思路
+
+- 题目要求子数组最大元素在 [L,R] 区间内。假设 count(bound) 为计算所有元素都小于等于 bound 的子数组数量。那么本题所求的答案可转化为 count(R) - count(L-1)。
+- 如何统计所有元素小于 bound 的子数组数量呢？使用 count 变量记录在 bound 的左边，小于等于 bound 的连续元素数量。当找到一个这样的元素时，在此位置上结束的有效子数组的数量为 count + 1。当遇到一个元素大于 B 时，则在此位置结束的有效子数组的数量为 0。res 将每轮 count 累加，最终 res 中存的即是满足条件的所有子数组数量。
+
+## 代码
+
+```go
+package leetcode
+
+func numSubarrayBoundedMax(nums []int, left int, right int) int {
+ return getAnswerPerBound(nums, right) - getAnswerPerBound(nums, left-1)
+}
+
+func getAnswerPerBound(nums []int, bound int) int {
+ res, count := 0, 0
+ for _, num := range nums {
+ if num <= bound {
+ count++
+ } else {
+ count = 0
+ }
+ res += count
+ }
+ return res
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0700~0799/0794.Valid-Tic-Tac-Toe-State/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0800~0899/0802.Find-Eventual-Safe-States/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0700~0799/_index.md b/website/content/ChapterFour/0700~0799/_index.md
new file mode 100644
index 000000000..d2021683f
--- /dev/null
+++ b/website/content/ChapterFour/0700~0799/_index.md
@@ -0,0 +1,5 @@
+---
+bookCollapseSection: true
+weight: 20
+---
+
diff --git a/website/content/ChapterFour/0707.Design-Linked-List.md b/website/content/ChapterFour/0707.Design-Linked-List.md
deleted file mode 100644
index c014e9e6b..000000000
--- a/website/content/ChapterFour/0707.Design-Linked-List.md
+++ /dev/null
@@ -1,140 +0,0 @@
-# [707. Design Linked List](https://leetcode.com/problems/design-linked-list/)
-
-## 题目
-
-Design your implementation of the linked list. You can choose to use the singly linked list or the doubly linked list. A node in a singly linked list should have two attributes: val and next. val is the value of the current node, and next is a pointer/reference to the next node. If you want to use the doubly linked list, you will need one more attribute prev to indicate the previous node in the linked list. Assume all nodes in the linked list are 0-indexed.
-
-Implement these functions in your linked list class:
-
-- get(index) : Get the value of the index-th node in the linked list. If the index is invalid, return -1.
-- addAtHead(val) : Add a node of value val before the first element of the linked list. After the insertion, the new node will be the first node of the linked list.
-- addAtTail(val) : Append a node of value val to the last element of the linked list.
-- addAtIndex(index, val) : Add a node of value val before the index-th node in the linked list. If index equals to the length of linked list, the node will be appended to the end of linked list. If index is greater than the length, the node will not be inserted.
-- deleteAtIndex(index) : Delete the index-th node in the linked list, if the index is valid.
-
-**Example**:
-
-```
-
-MyLinkedList linkedList = new MyLinkedList();
-linkedList.addAtHead(1);
-linkedList.addAtTail(3);
-linkedList.addAtIndex(1, 2); // linked list becomes 1->2->3
-linkedList.get(1); // returns 2
-linkedList.deleteAtIndex(1); // now the linked list is 1->3
-linkedList.get(1); // returns 3
-
-```
-
-**Note**:
-
-- All values will be in the range of [1, 1000].
-- The number of operations will be in the range of [1, 1000].
-- Please do not use the built-in LinkedList library.
-
-## 题目大意
-
-这道题比较简单，设计一个链表，实现相关操作即可。
-
-## 解题思路
-
-这题有一个地方比较坑，题目中 Note 里面写的数值取值范围是 [1, 1000]，笔者把 0 当做无效值。结果 case 里面出现了 0 是有效值。case 和题意不符。
-
-
-## 代码
-
-```go
-
-package leetcode
-
-type MyLinkedList struct {
- Val int
- Next *MyLinkedList
-}
-
-/** Initialize your data structure here. */
-func Constructor() MyLinkedList {
- return MyLinkedList{Val: -999, Next: nil}
-}
-
-/** Get the value of the index-th node in the linked list. If the index is invalid, return -1. */
-func (this *MyLinkedList) Get(index int) int {
- cur := this
- for i := 0; cur != nil; i++ {
- if i == index {
- if cur.Val == -999 {
- return -1
- } else {
- return cur.Val
- }
- }
- cur = cur.Next
- }
- return -1
-}
-
-/** Add a node of value val before the first element of the linked list. After the insertion, the new node will be the first node of the linked list. */
-func (this *MyLinkedList) AddAtHead(val int) {
- if this.Val == -999 {
- this.Val = val
- } else {
- tmp := &MyLinkedList{Val: this.Val, Next: this.Next}
- this.Val = val
- this.Next = tmp
- }
-}
-
-/** Append a node of value val to the last element of the linked list. */
-func (this *MyLinkedList) AddAtTail(val int) {
- cur := this
- for cur.Next != nil {
- cur = cur.Next
- }
- tmp := &MyLinkedList{Val: val, Next: nil}
- cur.Next = tmp
-}
-
-/** Add a node of value val before the index-th node in the linked list. If index equals to the length of linked list, the node will be appended to the end of linked list. If index is greater than the length, the node will not be inserted. */
-func (this *MyLinkedList) AddAtIndex(index int, val int) {
- cur := this
- if index == 0 {
- this.AddAtHead(val)
- return
- }
- for i := 0; cur != nil; i++ {
- if i == index-1 {
- break
- }
- cur = cur.Next
- }
- if cur != nil && cur.Val != -999 {
- tmp := &MyLinkedList{Val: val, Next: cur.Next}
- cur.Next = tmp
- }
-}
-
-/** Delete the index-th node in the linked list, if the index is valid. */
-func (this *MyLinkedList) DeleteAtIndex(index int) {
- cur := this
- for i := 0; cur != nil; i++ {
- if i == index-1 {
- break
- }
- cur = cur.Next
- }
- if cur != nil && cur.Next != nil {
- cur.Next = cur.Next.Next
- }
-}
-
-/**
- * Your MyLinkedList object will be instantiated and called as such:
- * obj := Constructor();
- * param_1 := obj.Get(index);
- * obj.AddAtHead(val);
- * obj.AddAtTail(val);
- * obj.AddAtIndex(index,val);
- * obj.DeleteAtIndex(index);
- */
-
-```
\ No newline at end of file
diff --git a/website/content/ChapterFour/0793.Preimage-Size-of-Factorial-Zeroes-Function.md b/website/content/ChapterFour/0793.Preimage-Size-of-Factorial-Zeroes-Function.md
deleted file mode 100755
index b784e0465..000000000
--- a/website/content/ChapterFour/0793.Preimage-Size-of-Factorial-Zeroes-Function.md
+++ /dev/null
@@ -1,106 +0,0 @@
-# [793. Preimage Size of Factorial Zeroes Function](https://leetcode.com/problems/preimage-size-of-factorial-zeroes-function/)
-
-
-## 题目
-
-Let `f(x)` be the number of zeroes at the end of `x!`. (Recall that `x! = 1 * 2 * 3 * ... * x`, and by convention, `0! = 1`.)
-
-For example, `f(3) = 0` because 3! = 6 has no zeroes at the end, while `f(11) = 2` because 11! = 39916800 has 2 zeroes at the end. Given `K`, find how many non-negative integers `x` have the property that `f(x) = K`.
-
-**Example 1**:
-
- Input: K = 0
- Output: 5
- Explanation: 0!, 1!, 2!, 3!, and 4! end with K = 0 zeroes.
-
-**Example 2**:
-
- Input: K = 5
- Output: 0
- Explanation: There is no x such that x! ends in K = 5 zeroes.
-
-**Note**:
-
-- `K` will be an integer in the range `[0, 10^9]`.
-
-
-## 题目大意
-
-
-f(x) 是 x! 末尾是0的数量。（回想一下 x! = 1 * 2 * 3 * ... * x，且0! = 1）
-
-例如， f(3) = 0 ，因为3! = 6的末尾没有0；而 f(11) = 2 ，因为11!= 39916800末端有2个0。给定 K，找出多少个非负整数x ，有 f(x) = K 的性质。
-
-注意：
-
-- K 是范围在 [0, 10^9] 的整数。
-
-
-## 解题思路
-
-- 给出一个数 K，要求有多少个 n 能使得 n！末尾 0 的个数等于 K。
-- 这一题是基于第 172 题的逆过程加强版。第 172 题是给出 `n`，求得末尾 0 的个数。由第 172 题可以知道，`n！`末尾 0 的个数取决于因子 5 的个数。末尾可能有 `K` 个 0，那么 `n` 最多可以等于 `5 * K`，在 `[0, 5* K]` 区间内二分搜索，判断 `mid` 末尾 0 的个数，如果能找到 `K`，那么就范围 5，如果找不到这个 `K`，返回 0 。为什么答案取值只有 0 和 5 呢？因为当 `n` 增加 5 以后，因子 5 的个数又加一了，末尾又可以多 1 个或者多个 0(如果加 5 以后，有多个 5 的因子，例如 25，125，就有可能末尾增加多个 0)。所以有效的 `K` 值对应的 `n` 的范围区间就是 5 。反过来，无效的 `K` 值对应的 `n` 是 0。`K` 在 `5^n` 的分界线处会发生跳变，所有有些值取不到。例如，`n` 在 `[0,5)` 内取值，`K = 0`；`n` 在 `[5,10)` 内取值，`K = 1`；`n` 在 `[10,15)` 内取值，`K = 2`；`n` 在 `[15,20)` 内取值，`K = 3`；`n` 在 `[20,25)` 内取值，`K = 4`；`n` 在 `[25,30)` 内取值，`K = 6`，因为 25 提供了 2 个 5，也就提供了 2 个 0，所以 `K` 永远无法取值等于 5，即当 `K = 5` 时，找不到任何的 `n` 与之对应。
-- 这一题也可以用数学的方法解题。见解法二。这个解法的灵感来自于：n！末尾 0 的个数等于 [1,n] 所有数的因子 5 的个数总和。其次此题的结果一定只有 0 和 5 (分析见上一种解法)。有了这两个结论以后，就可以用数学的方法推导了。首先 n 可以表示为 5 进制的形式
-<p align='center'>
-<img src='https://img.halfrost.com/Leetcode/leetcode_793_1.png'>
-</p>
- 上面式子中，所有有因子 5 的个数为：
-<p align='center'>
-<img src='https://img.halfrost.com/Leetcode/leetcode_793_2.png'>
-</p>
-
- 这个总数就即是 K。针对不同的 n，an 的通项公式不同，所以表示的 K 的系数也不同。cn 的通项公式呢？
-<p align='center'>
-<img src='https://img.halfrost.com/Leetcode/leetcode_793_2.png'>
-</p>
-<p align='center'>
-<img src='https://img.halfrost.com/Leetcode/leetcode_793_3.png'>
-</p>
-
- 由上面这个递推还能推出通项公式(不过这题不适用通项公式，是用递推公式更方便)：
-<p align='center'>
-<img src='https://img.halfrost.com/Leetcode/leetcode_793_4.png'>
-</p>
- 判断 K 是否能表示成两个数列的表示形式，等价于判断 K 是否能转化为以 Cn 为基的变进制数。到此，转化成类似第 483 题了。代码实现不难，见解法二。
-
-
-## 代码
-
-```go
-
-package leetcode
-
-// 解法一 二分搜索
-func preimageSizeFZF(K int) int {
- low, high := 0, 5*K
- for low <= high {
- mid := low + (high-low)>>1
- k := trailingZeroes(mid)
- if k == K {
- return 5
- } else if k > K {
- high = mid - 1
- } else {
- low = mid + 1
- }
- }
- return 0
-}
-
-// 解法二 数学方法
-func preimageSizeFZF1(K int) int {
- base := 0
- for base < K {
- base = base*5 + 1
- }
- for K > 0 {
- base = (base - 1) / 5
- if K/base == 5 {
- return 0
- }
- K %= base
- }
- return 5
-}
-
-```
\ No newline at end of file
diff --git a/website/content/ChapterFour/0802.Find-Eventual-Safe-States.md b/website/content/ChapterFour/0800~0899/0802.Find-Eventual-Safe-States.md
similarity index 90%
rename from website/content/ChapterFour/0802.Find-Eventual-Safe-States.md
rename to website/content/ChapterFour/0800~0899/0802.Find-Eventual-Safe-States.md
index f6879f300..1a3d0cd79 100644
--- a/website/content/ChapterFour/0802.Find-Eventual-Safe-States.md
+++ b/website/content/ChapterFour/0800~0899/0802.Find-Eventual-Safe-States.md
@@ -70,4 +70,11 @@ func dfsEventualSafeNodes(graph [][]int, idx int, color []int) bool {
color[idx] = 2
return true
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0700~0799/0795.Number-of-Subarrays-with-Bounded-Maximum/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0800~0899/0803.Bricks-Falling-When-Hit/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0803.Bricks-Falling-When-Hit.md b/website/content/ChapterFour/0800~0899/0803.Bricks-Falling-When-Hit.md
similarity index 93%
rename from website/content/ChapterFour/0803.Bricks-Falling-When-Hit.md
rename to website/content/ChapterFour/0800~0899/0803.Bricks-Falling-When-Hit.md
index 6f5335eda..f05f3978f 100755
--- a/website/content/ChapterFour/0803.Bricks-Falling-When-Hit.md
+++ b/website/content/ChapterFour/0800~0899/0803.Bricks-Falling-When-Hit.md
@@ -65,7 +65,7 @@ Return an array representing the number of bricks that will drop after each eras
package leetcode
import (
- "github.com/halfrost/LeetCode-Go/template"
+ "github.com/halfrost/leetcode-go/template"
)
func hitBricks(grid [][]int, hits [][]int) []int {
@@ -122,4 +122,11 @@ func getUnionFindFromGrid(grid [][]int, x, y int, uf template.UnionFindCount) {
}
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0800~0899/0802.Find-Eventual-Safe-States/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0800~0899/0807.Max-Increase-to-Keep-City-Skyline/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0800~0899/0807.Max-Increase-to-Keep-City-Skyline.md b/website/content/ChapterFour/0800~0899/0807.Max-Increase-to-Keep-City-Skyline.md
new file mode 100644
index 000000000..cb19b053a
--- /dev/null
+++ b/website/content/ChapterFour/0800~0899/0807.Max-Increase-to-Keep-City-Skyline.md
@@ -0,0 +1,104 @@
+# [807. Max Increase to Keep City Skyline](https://leetcode.com/problems/max-increase-to-keep-city-skyline/)
+
+## 题目
+
+There is a city composed of n x n blocks, where each block contains a single building shaped like a vertical square prism. You are given a 0-indexed n x n integer matrix grid where grid[r][c] represents the height of the building located in the block at row r and column c.
+
+A city's skyline is the the outer contour formed by all the building when viewing the side of the city from a distance. The skyline from each cardinal direction north, east, south, and west may be different.
+
+We are allowed to increase the height of any number of buildings by any amount (the amount can be different per building). The height of a 0-height building can also be increased. However, increasing the height of a building should not affect the city's skyline from any cardinal direction.
+
+Return the maximum total sum that the height of the buildings can be increased by without changing the city's skyline from any cardinal direction.
+
+**Example 1**:
+
+
+
+ Input: grid = [[3,0,8,4],[2,4,5,7],[9,2,6,3],[0,3,1,0]]
+ Output: 35
+ Explanation: The building heights are shown in the center of the above image.
+ The skylines when viewed from each cardinal direction are drawn in red.
+ The grid after increasing the height of buildings without affecting skylines is:
+ gridNew = [ [8, 4, 8, 7],
+ [7, 4, 7, 7],
+ [9, 4, 8, 7],
+ [3, 3, 3, 3] ]
+
+**Example 2**:
+
+ Input: grid = [[0,0,0],[0,0,0],[0,0,0]]
+ Output: 0
+ Explanation: Increasing the height of any building will result in the skyline changing.
+
+**Constraints:**
+
+- n == grid.length
+- n == grid[r].length
+- 2 <= n <= 50
+- 0 <= grid[r][c] <= 100
+
+## 题目大意
+
+在二维数组grid中，grid[i][j]代表位于某处的建筑物的高度。 我们被允许增加任何数量（不同建筑物的数量可能不同）的建筑物的高度。 高度 0 也被认为是建筑物。
+
+最后，从新数组的所有四个方向（即顶部，底部，左侧和右侧）观看的“天际线”必须与原始数组的天际线相同。 城市的天际线是从远处观看时，由所有建筑物形成的矩形的外部轮廓。 请看下面的例子。
+
+建筑物高度可以增加的最大总和是多少？
+
+## 解题思路
+
+- 从数组竖直方向（即顶部，底部）看“天际线”计算出 topBottomSkyline
+- 从数组水平方向（即左侧，右侧）看“天际线”计算出 leftRightSkyline
+- 计算 grid 中每个元素与对应的 topBottomSkyline 和 leftRightSkyline 中较小值的差值
+- 统计所有差值的总和 ans 并返回
+
+## 代码
+
+```go
+package leetcode
+
+func maxIncreaseKeepingSkyline(grid [][]int) int {
+ n := len(grid)
+ topBottomSkyline := make([]int, 0, n)
+ leftRightSkyline := make([]int, 0, n)
+ for i := range grid {
+ cur := 0
+ for _, v := range grid[i] {
+ if cur < v {
+ cur = v
+ }
+ }
+ leftRightSkyline = append(leftRightSkyline, cur)
+ }
+ for j := range grid {
+ cur := 0
+ for i := 0; i < len(grid[0]); i++ {
+ if cur < grid[i][j] {
+ cur = grid[i][j]
+ }
+ }
+ topBottomSkyline = append(topBottomSkyline, cur)
+ }
+ var ans int
+ for i := range grid {
+ for j := 0; j < len(grid[0]); j++ {
+ ans += min(topBottomSkyline[j], leftRightSkyline[i]) - grid[i][j]
+ }
+ }
+ return ans
+}
+
+func min(a, b int) int {
+ if a < b {
+ return a
+ }
+ return b
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0800~0899/0803.Bricks-Falling-When-Hit/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0800~0899/0810.Chalkboard-XOR-Game/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0800~0899/0810.Chalkboard-XOR-Game.md b/website/content/ChapterFour/0800~0899/0810.Chalkboard-XOR-Game.md
new file mode 100644
index 000000000..2c2d62d0f
--- /dev/null
+++ b/website/content/ChapterFour/0800~0899/0810.Chalkboard-XOR-Game.md
@@ -0,0 +1,67 @@
+# [810. Chalkboard XOR Game](https://leetcode.com/problems/chalkboard-xor-game/)
+
+
+## 题目
+
+We are given non-negative integers nums[i] which are written on a chalkboard. Alice and Bob take turns erasing exactly one number from the chalkboard, with Alice starting first. If erasing a number causes the bitwise XOR of all the elements of the chalkboard to become 0, then that player loses. (Also, we'll say the bitwise XOR of one element is that element itself, and the bitwise XOR of no elements is 0.)
+
+Also, if any player starts their turn with the bitwise XOR of all the elements of the chalkboard equal to 0, then that player wins.
+
+Return True if and only if Alice wins the game, assuming both players play optimally.
+
+```
+Example:Input: nums = [1, 1, 2]
+Output: false
+Explanation:
+Alice has two choices: erase 1 or erase 2.
+If she erases 1, the nums array becomes [1, 2]. The bitwise XOR of all the elements of the chalkboard is 1 XOR 2 = 3. Now Bob can remove any element he wants, because Alice will be the one to erase the last element and she will lose.
+If Alice erases 2 first, now nums becomes [1, 1]. The bitwise XOR of all the elements of the chalkboard is 1 XOR 1 = 0. Alice will lose.
+```
+
+**Notes:**
+
+- `1 <= N <= 1000`.
+- `0 <= nums[i] <= 2^16`.
+
+## 题目大意
+
+黑板上写着一个非负整数数组 nums[i] 。Alice 和 Bob 轮流从黑板上擦掉一个数字，Alice 先手。如果擦除一个数字后，剩余的所有数字按位异或运算得出的结果等于 0 的话，当前玩家游戏失败。 (另外，如果只剩一个数字，按位异或运算得到它本身；如果无数字剩余，按位异或运算结果为 0。）并且，轮到某个玩家时，如果当前黑板上所有数字按位异或运算结果等于 0，这个玩家获胜。假设两个玩家每步都使用最优解，当且仅当 Alice 获胜时返回 true。
+
+## 解题思路
+
+- Alice 必胜情况之一，Alice 先手，起始数组全部元素本身异或结果就为 0 。不需要擦除数字便自动获胜。除去这个情况，还有其他情况么？由于 2 人是交替擦除数字，且每次都恰好擦掉一个数字，因此对于这两人中的任意一人，其每次在擦除数字前，黑板上剩余数字的个数的奇偶性一定都是相同的。于是奇偶性成为突破口。
+- 如果 nums 的长度是偶数，Alice 先手是否必败呢？如果必败，代表无论擦掉哪一个数字，剩余所有数字的异或结果都等于 0。利用反证法证明上述结论是错误的。首先 {{< katex >}} num[0] \oplus num[1] \oplus num[2] \oplus \cdots \oplus num[n-1] = X ≠ 0 {{< /katex >}} ，初始所有元素异或结果不为 0。假设 Alice 当前擦掉第 i 个元素，0 ≤ i < n。令 {{< katex >}}X_{n}{{< /katex >}} 代表擦掉第 n 位元素以后剩余元素异或的结果。由证题，无论擦掉哪一个数字，剩余所有数字的异或结果都等于 0。所以 {{< katex >}} X_{0} \oplus X_{1} \oplus X_{2} \oplus \cdots \oplus X_{n-1} = 0{{< /katex >}} 。
+
+ {{< katex display >}}
+ \begin{aligned}0 &= X_{0} \oplus X_{1} \oplus X_{2} \oplus \cdots \oplus X_{n-1} \\0 &= (X \oplus nums[0]) \oplus (X \oplus nums[1]) \oplus (X \oplus nums[2]) \oplus \cdots \oplus (X \oplus nums[n-1])\\ 0 &= (X \oplus X \oplus \cdots \oplus X) \oplus (nums[0] \oplus nums[1] \oplus nums[2] \oplus \cdots \oplus nums[n-1])\\0 &= 0 \oplus X\\\\\Rightarrow X &= 0\\\end{aligned}
+ {{< /katex >}}
+
+ 由于 n 为偶数，所以 n 个 X 的异或结果为 0。最终推出 X = 0，很明显与前提 X ≠ 0 冲突。所以原命题，代表无论擦掉哪一个数字，剩余所有数字的异或结果都等于 0 是错误的。也就是说，当 n 为偶数时，代表无论擦掉哪一个数字，剩余所有数字的异或结果都不等于 0。即 Alice 有必胜策略。换句话说，当数组的长度是偶数时，先手 Alice 总能找到一个数字，在擦掉这个数字之后剩余的所有数字异或结果不等于 0。
+
+- 综上，Alice 必胜策略有 2 种情况：
+ 1. 数组 nums 的全部元素初始本身异或结果就等于 0。
+ 2. 数组 nums 的长度是偶数。
+
+## 代码
+
+```go
+package leetcode
+
+func xorGame(nums []int) bool {
+ if len(nums)%2 == 0 {
+ return true
+ }
+ xor := 0
+ for _, num := range nums {
+ xor ^= num
+ }
+ return xor == 0
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0800~0899/0807.Max-Increase-to-Keep-City-Skyline/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0800~0899/0811.Subdomain-Visit-Count/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0811.Subdomain-Visit-Count.md b/website/content/ChapterFour/0800~0899/0811.Subdomain-Visit-Count.md
similarity index 92%
rename from website/content/ChapterFour/0811.Subdomain-Visit-Count.md
rename to website/content/ChapterFour/0800~0899/0811.Subdomain-Visit-Count.md
index 69840bd97..12232f80e 100755
--- a/website/content/ChapterFour/0811.Subdomain-Visit-Count.md
+++ b/website/content/ChapterFour/0800~0899/0811.Subdomain-Visit-Count.md
@@ -140,4 +140,11 @@ func splitDomain(domain string, domains map[string]int) {
}
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0800~0899/0810.Chalkboard-XOR-Game/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0800~0899/0812.Largest-Triangle-Area/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0812.Largest-Triangle-Area.md b/website/content/ChapterFour/0800~0899/0812.Largest-Triangle-Area.md
similarity index 81%
rename from website/content/ChapterFour/0812.Largest-Triangle-Area.md
rename to website/content/ChapterFour/0800~0899/0812.Largest-Triangle-Area.md
index 426826f15..6519d1581 100644
--- a/website/content/ChapterFour/0812.Largest-Triangle-Area.md
+++ b/website/content/ChapterFour/0800~0899/0812.Largest-Triangle-Area.md
@@ -67,4 +67,11 @@ func max(a, b float64) float64 {
return b
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0800~0899/0811.Subdomain-Visit-Count/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0800~0899/0815.Bus-Routes/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0815.Bus-Routes.md b/website/content/ChapterFour/0800~0899/0815.Bus-Routes.md
similarity index 89%
rename from website/content/ChapterFour/0815.Bus-Routes.md
rename to website/content/ChapterFour/0800~0899/0815.Bus-Routes.md
index bddbd3b07..29ab7cfa8 100755
--- a/website/content/ChapterFour/0815.Bus-Routes.md
+++ b/website/content/ChapterFour/0800~0899/0815.Bus-Routes.md
@@ -85,4 +85,11 @@ func numBusesToDestination(routes [][]int, S int, T int) int {
return -1
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0800~0899/0812.Largest-Triangle-Area/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0800~0899/0816.Ambiguous-Coordinates/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0800~0899/0816.Ambiguous-Coordinates.md b/website/content/ChapterFour/0800~0899/0816.Ambiguous-Coordinates.md
new file mode 100644
index 000000000..3c10a9ec1
--- /dev/null
+++ b/website/content/ChapterFour/0800~0899/0816.Ambiguous-Coordinates.md
@@ -0,0 +1,102 @@
+# [816. Ambiguous Coordinates](https://leetcode.com/problems/ambiguous-coordinates/)
+
+
+## 题目
+
+We had some 2-dimensional coordinates, like `"(1, 3)"` or `"(2, 0.5)"`. Then, we removed all commas, decimal points, and spaces, and ended up with the string `s`. Return a list of strings representing all possibilities for what our original coordinates could have been.
+
+Our original representation never had extraneous zeroes, so we never started with numbers like "00", "0.0", "0.00", "1.0", "001", "00.01", or any other number that can be represented with less digits. Also, a decimal point within a number never occurs without at least one digit occuring before it, so we never started with numbers like ".1".
+
+The final answer list can be returned in any order. Also note that all coordinates in the final answer have exactly one space between them (occurring after the comma.)
+
+```
+Example 1:Input: s = "(123)"
+Output: ["(1, 23)", "(12, 3)", "(1.2, 3)", "(1, 2.3)"]
+
+```
+
+```
+Example 2:Input: s = "(00011)"
+Output: ["(0.001, 1)", "(0, 0.011)"]
+Explanation:
+0.0, 00, 0001 or 00.01 are not allowed.
+
+```
+
+```
+Example 3:Input: s = "(0123)"
+Output: ["(0, 123)", "(0, 12.3)", "(0, 1.23)", "(0.1, 23)", "(0.1, 2.3)", "(0.12, 3)"]
+
+```
+
+```
+Example 4:Input: s = "(100)"
+Output: [(10, 0)]
+Explanation:
+1.0 is not allowed.
+
+```
+
+**Note:**
+
+- `4 <= s.length <= 12`.
+- `s[0]` = "(", `s[s.length - 1]` = ")", and the other elements in `s` are digits.
+
+## 题目大意
+
+我们有一些二维坐标，如 "(1, 3)" 或 "(2, 0.5)"，然后我们移除所有逗号，小数点和空格，得到一个字符串S。返回所有可能的原始字符串到一个列表中。原始的坐标表示法不会存在多余的零，所以不会出现类似于"00", "0.0", "0.00", "1.0", "001", "00.01"或一些其他更小的数来表示坐标。此外，一个小数点前至少存在一个数，所以也不会出现“.1”形式的数字。
+
+最后返回的列表可以是任意顺序的。而且注意返回的两个数字中间（逗号之后）都有一个空格。
+
+## 解题思路
+
+- 本题没有什么算法思想，纯暴力题。先将原始字符串一分为二，分为的两个子字符串再移动坐标点，最后将每种情况组合再一次，这算完成了一次切分。将原始字符串每一位都按此规律完成切分，此题便得解。
+- 这道题有 2 处需要注意的。第一处是最终输出的字符串，请注意，**两个数字中间（逗号之后）都有一个空格**。不遵守输出格式的要求也会导致 `Wrong Answer`。另外一处是切分数字时，有 2 种违法情况，一种是带前导 0 的，另外一种是末尾带 0 的。带前导 0 的也分为 2 种情况，一种是只有一位，即只有一个 0，这种情况直接返回，因为这一个 0 怎么切分也只有一种切分方法。另外一种是长度大于 1，即 `0xxx` 这种情况。`0xxx` 这种情况只有一种切分方法，即 `0.xxx`。末尾带 0 的只有一种切分方法，即 `xxx0`，不可切分，因为 `xxx.0`，`xx.x0`，`x.xx0` 这些都是违法情况，所以末尾带 0 的也可以直接返回。具体的实现见代码和注释。
+
+## 代码
+
+```go
+package leetcode
+
+func ambiguousCoordinates(s string) []string {
+ res := []string{}
+ s = s[1 : len(s)-1]
+ for i := range s[:len(s)-1] {
+ a := build(s[:i+1])
+ b := build(s[i+1:])
+ for _, ta := range a {
+ for _, tb := range b {
+ res = append(res, "("+ta+", "+tb+")")
+ }
+ }
+ }
+ return res
+}
+
+func build(s string) []string {
+ res := []string{}
+ if len(s) == 1 || s[0] != '0' {
+ res = append(res, s)
+ }
+ // 结尾带 0 的情况
+ if s[len(s)-1] == '0' {
+ return res
+ }
+ // 切分长度大于一位且带前导 0 的情况
+ if s[0] == '0' {
+ res = append(res, "0."+s[1:])
+ return res
+ }
+ for i := range s[:len(s)-1] {
+ res = append(res, s[:i+1]+"."+s[i+1:])
+ }
+ return res
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0800~0899/0815.Bus-Routes/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0800~0899/0817.Linked-List-Components/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0817.Linked-List-Components.md b/website/content/ChapterFour/0800~0899/0817.Linked-List-Components.md
similarity index 86%
rename from website/content/ChapterFour/0817.Linked-List-Components.md
rename to website/content/ChapterFour/0800~0899/0817.Linked-List-Components.md
index a04153712..9527d1750 100644
--- a/website/content/ChapterFour/0817.Linked-List-Components.md
+++ b/website/content/ChapterFour/0800~0899/0817.Linked-List-Components.md
@@ -106,4 +106,11 @@ func toMap(G []int) map[int]int {
return GMap
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0800~0899/0816.Ambiguous-Coordinates/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0800~0899/0819.Most-Common-Word/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0819.Most-Common-Word.md b/website/content/ChapterFour/0800~0899/0819.Most-Common-Word.md
similarity index 88%
rename from website/content/ChapterFour/0819.Most-Common-Word.md
rename to website/content/ChapterFour/0800~0899/0819.Most-Common-Word.md
index e37b45ee4..fc0a4bc2d 100755
--- a/website/content/ChapterFour/0819.Most-Common-Word.md
+++ b/website/content/ChapterFour/0800~0899/0819.Most-Common-Word.md
@@ -86,4 +86,11 @@ func mostCommonWord(paragraph string, banned []string) string {
return mostFreqWord
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0800~0899/0817.Linked-List-Components/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0800~0899/0820.Short-Encoding-of-Words/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0800~0899/0820.Short-Encoding-of-Words.md b/website/content/ChapterFour/0800~0899/0820.Short-Encoding-of-Words.md
new file mode 100644
index 000000000..fcacf0d03
--- /dev/null
+++ b/website/content/ChapterFour/0800~0899/0820.Short-Encoding-of-Words.md
@@ -0,0 +1,150 @@
+# [820. Short Encoding of Words](https://leetcode.com/problems/short-encoding-of-words/)
+
+
+## 题目
+
+A **valid encoding** of an array of `words` is any reference string `s` and array of indices `indices` such that:
+
+- `words.length == indices.length`
+- The reference string `s` ends with the `'#'` character.
+- For each index `indices[i]`, the **substring** of `s` starting from `indices[i]` and up to (but not including) the next `'#'` character is equal to `words[i]`.
+
+Given an array of `words`, return *the **length of the shortest reference string*** `s` *possible of any **valid encoding** of* `words`*.*
+
+**Example 1:**
+
+```
+Input: words = ["time", "me", "bell"]
+Output: 10
+Explanation: A valid encoding would be s = "time#bell#" and indices = [0, 2, 5].
+words[0] = "time", the substring of s starting from indices[0] = 0 to the next '#' is underlined in "time#bell#"
+words[1] = "me", the substring of s starting from indices[1] = 2 to the next '#' is underlined in "time#bell#"
+words[2] = "bell", the substring of s starting from indices[2] = 5 to the next '#' is underlined in "time#bell#"
+```
+
+**Example 2:**
+
+```
+Input: words = ["t"]
+Output: 2
+Explanation: A valid encoding would be s = "t#" and indices = [0].
+```
+
+**Constraints:**
+
+- `1 <= words.length <= 2000`
+- `1 <= words[i].length <= 7`
+- `words[i]` consists of only lowercase letters.
+
+## 题目大意
+
+单词数组 words 的 有效编码 由任意助记字符串 s 和下标数组 indices 组成，且满足：
+
+- words.length == indices.length
+- 助记字符串 s 以 '#' 字符结尾
+- 对于每个下标 indices[i] ，s 的一个从 indices[i] 开始、到下一个 '#' 字符结束（但不包括 '#'）的 子字符串 恰好与 words[i] 相等
+
+给你一个单词数组 words ，返回成功对 words 进行编码的最小助记字符串 s 的长度 。
+
+## 解题思路
+
+- 暴力解法。先将所有的单词放入字典中。然后针对字典中的每个单词，逐一从字典中删掉自己的子字符串，这样有相同后缀的字符串被删除了，字典中剩下的都是没有共同前缀的。最终的答案是剩下所有单词用 # 号连接之后的总长度。
+- Trie 解法。构建 Trie 树，相同的后缀会被放到从根到叶子节点中的某个路径中。最后依次遍历一遍所有单词，如果单词最后一个字母是叶子节点，说明这个单词是要选择的，因为它可能是包含了一些单词后缀的最长单词。累加这个单词的长度并再加 1(# 字符的长度)。最终累加出来的长度即为题目所求的答案。
+
+## 代码
+
+```go
+package leetcode
+
+// 解法一 暴力
+func minimumLengthEncoding(words []string) int {
+ res, m := 0, map[string]bool{}
+ for _, w := range words {
+ m[w] = true
+ }
+ for w := range m {
+ for i := 1; i < len(w); i++ {
+ delete(m, w[i:])
+ }
+ }
+ for w := range m {
+ res += len(w) + 1
+ }
+ return res
+}
+
+// 解法二 Trie
+type node struct {
+ value byte
+ sub []*node
+}
+
+func (t *node) has(b byte) (*node, bool) {
+ if t == nil {
+ return nil, false
+ }
+ for i := range t.sub {
+ if t.sub[i] != nil && t.sub[i].value == b {
+ return t.sub[i], true
+ }
+ }
+ return nil, false
+}
+
+func (t *node) isLeaf() bool {
+ if t == nil {
+ return false
+ }
+ return len(t.sub) == 0
+}
+
+func (t *node) add(s []byte) {
+ now := t
+ for i := len(s) - 1; i > -1; i-- {
+ if v, ok := now.has(s[i]); ok {
+ now = v
+ continue
+ }
+ temp := new(node)
+ temp.value = s[i]
+ now.sub = append(now.sub, temp)
+ now = temp
+ }
+}
+
+func (t *node) endNodeOf(s []byte) *node {
+ now := t
+ for i := len(s) - 1; i > -1; i-- {
+ if v, ok := now.has(s[i]); ok {
+ now = v
+ continue
+ }
+ return nil
+ }
+ return now
+}
+
+func minimumLengthEncoding1(words []string) int {
+ res, tree, m := 0, new(node), make(map[string]bool)
+ for i := range words {
+ if !m[words[i]] {
+ tree.add([]byte(words[i]))
+ m[words[i]] = true
+ }
+ }
+ for s := range m {
+ if tree.endNodeOf([]byte(s)).isLeaf() {
+ res += len(s)
+ res++
+ }
+ }
+ return res
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0800~0899/0819.Most-Common-Word/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0800~0899/0821.Shortest-Distance-to-a-Character/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0800~0899/0821.Shortest-Distance-to-a-Character.md b/website/content/ChapterFour/0800~0899/0821.Shortest-Distance-to-a-Character.md
new file mode 100644
index 000000000..1f88563da
--- /dev/null
+++ b/website/content/ChapterFour/0800~0899/0821.Shortest-Distance-to-a-Character.md
@@ -0,0 +1,109 @@
+# [821. Shortest Distance to a Character](https://leetcode.com/problems/shortest-distance-to-a-character/)
+
+
+## 题目
+
+Given a string `s` and a character `c` that occurs in `s`, return *an array of integers `answer` where* `answer.length == s.length` *and* `answer[i]` *is the shortest distance from* `s[i]` *to the character* `c` *in* `s`.
+
+**Example 1:**
+
+```
+Input: s = "loveleetcode", c = "e"
+Output: [3,2,1,0,1,0,0,1,2,2,1,0]
+```
+
+**Example 2:**
+
+```
+Input: s = "aaab", c = "b"
+Output: [3,2,1,0]
+```
+
+**Constraints:**
+
+- `1 <= s.length <= 104`
+- `s[i]` and `c` are lowercase English letters.
+- `c` occurs at least once in `s`.
+
+## 题目大意
+
+给定一个字符串 S 和一个字符 C。返回一个代表字符串 S 中每个字符到字符串 S 中的字符 C 的最短距离的数组。
+
+## 解题思路
+
+- 解法一：从左至右更新一遍到 C 的值距离，再从右至左更新一遍到 C 的值，取两者中的最小值。
+- 解法二：依次扫描字符串 S，针对每一个非字符 C 的字符，分别往左扫一次，往右扫一次，计算出距离目标字符 C 的距离，然后取左右两个距离的最小值存入最终答案数组中。
+
+## 代码
+
+```go
+
+package leetcode
+
+import (
+ "math"
+)
+
+// 解法一
+func shortestToChar(s string, c byte) []int {
+ n := len(s)
+ res := make([]int, n)
+ for i := range res {
+ res[i] = n
+ }
+ for i := 0; i < n; i++ {
+ if s[i] == c {
+ res[i] = 0
+ } else if i > 0 {
+ res[i] = res[i-1] + 1
+ }
+ }
+ for i := n - 1; i >= 0; i-- {
+ if i < n-1 && res[i+1]+1 < res[i] {
+ res[i] = res[i+1] + 1
+ }
+ }
+ return res
+}
+
+// 解法二
+func shortestToChar1(s string, c byte) []int {
+ res := make([]int, len(s))
+ for i := 0; i < len(s); i++ {
+ if s[i] == c {
+ res[i] = 0
+ } else {
+ left, right := math.MaxInt32, math.MaxInt32
+ for j := i + 1; j < len(s); j++ {
+ if s[j] == c {
+ right = j - i
+ break
+ }
+ }
+ for k := i - 1; k >= 0; k-- {
+ if s[k] == c {
+ left = i - k
+ break
+ }
+ }
+ res[i] = min(left, right)
+ }
+ }
+ return res
+}
+
+func min(a, b int) int {
+ if a > b {
+ return b
+ }
+ return a
+}
+
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0800~0899/0820.Short-Encoding-of-Words/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0800~0899/0823.Binary-Trees-With-Factors/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0800~0899/0823.Binary-Trees-With-Factors.md b/website/content/ChapterFour/0800~0899/0823.Binary-Trees-With-Factors.md
new file mode 100644
index 000000000..d58e146da
--- /dev/null
+++ b/website/content/ChapterFour/0800~0899/0823.Binary-Trees-With-Factors.md
@@ -0,0 +1,128 @@
+# [823. Binary Trees With Factors](https://leetcode.com/problems/binary-trees-with-factors/)
+
+
+## 题目
+
+Given an array of unique integers, `arr`, where each integer `arr[i]` is strictly greater than `1`.
+
+We make a binary tree using these integers, and each number may be used for any number of times. Each non-leaf node's value should be equal to the product of the values of its children.
+
+Return *the number of binary trees we can make*. The answer may be too large so return the answer **modulo** `109 + 7`.
+
+**Example 1:**
+
+```
+Input: arr = [2,4]
+Output: 3
+Explanation: We can make these trees: [2], [4], [4, 2, 2]
+```
+
+**Example 2:**
+
+```
+Input: arr = [2,4,5,10]
+Output: 7
+Explanation: We can make these trees: [2], [4], [5], [10], [4, 2, 2], [10, 2, 5], [10, 5, 2].
+```
+
+**Constraints:**
+
+- `1 <= arr.length <= 1000`
+- `2 <= arr[i] <= 10^9`
+
+## 题目大意
+
+给出一个含有不重复整数元素的数组，每个整数均大于 1。我们用这些整数来构建二叉树，每个整数可以使用任意次数。其中：每个非叶结点的值应等于它的两个子结点的值的乘积。满足条件的二叉树一共有多少个？返回的结果应模除 10 * 9 + 7。
+
+## 解题思路
+
+- 首先想到的是暴力解法，先排序，然后遍历所有节点，枚举两两乘积为第三个节点值的组合。然后枚举这些组合并构成树。这里计数的时候要注意，左右孩子如果不是对称的，左右子树相互对调又是一组解。但是这个方法超时了。原因是，暴力枚举了很多次重复的节点和组合。优化这里的方法就是把已经计算过的节点放入 `map` 中。这里有 2 层 `map`，第一层 `map` 记忆化的是两两乘积的组合，将父亲节点作为 `key`，左右 2 个孩子作为 `value`。第二层 `map` 记忆化的是以 `root` 为根节点此时二叉树的种类数，`key` 是 `root`，`value` 存的是种类数。这样优化以后，DFS 暴力解法可以 runtime beats 100%。
+- 另外一种解法是 DP。定义 `dp[i]` 代表以 `i` 为根节点的树的种类数。dp[i] 初始都是 1，因为所有节点自身可以形成为自身单个节点为 `root` 的树。同样需要先排序。状态转移方程是：
+
+ {{< katex display >}}
+ dp[i] = \sum_{j<i, k<i}^{}dp[j] * dp[k], j * k = i
+ {{< /katex >}}
+
+ 最后将 `dp[]` 数组中所有结果累加取模即为最终结果，时间复杂度 O(n^2)，空间复杂度 O(n)。
+
+## 代码
+
+```go
+package leetcode
+
+import (
+ "sort"
+)
+
+const mod = 1e9 + 7
+
+// 解法一 DFS
+func numFactoredBinaryTrees(arr []int) int {
+ sort.Ints(arr)
+ numDict := map[int]bool{}
+ for _, num := range arr {
+ numDict[num] = true
+ }
+ dict, res := make(map[int][][2]int), 0
+ for i, num := range arr {
+ for j := i; j < len(arr) && num*arr[j] <= arr[len(arr)-1]; j++ {
+ tmp := num * arr[j]
+ if !numDict[tmp] {
+ continue
+ }
+ dict[tmp] = append(dict[tmp], [2]int{num, arr[j]})
+ }
+ }
+ cache := make(map[int]int)
+ for _, num := range arr {
+ res = (res + dfs(num, dict, cache)) % mod
+ }
+ return res
+}
+
+func dfs(num int, dict map[int][][2]int, cache map[int]int) int {
+ if val, ok := cache[num]; ok {
+ return val
+ }
+ res := 1
+ for _, tuple := range dict[num] {
+ a, b := tuple[0], tuple[1]
+ x, y := dfs(a, dict, cache), dfs(b, dict, cache)
+ tmp := x * y
+ if a != b {
+ tmp *= 2
+ }
+ res = (res + tmp) % mod
+ }
+ cache[num] = res
+ return res
+}
+
+// 解法二 DP
+func numFactoredBinaryTrees1(arr []int) int {
+ dp := make(map[int]int)
+ sort.Ints(arr)
+ for i, curNum := range arr {
+ for j := 0; j < i; j++ {
+ factor := arr[j]
+ quotient, remainder := curNum/factor, curNum%factor
+ if remainder == 0 {
+ dp[curNum] += dp[factor] * dp[quotient]
+ }
+ }
+ dp[curNum]++
+ }
+ totalCount := 0
+ for _, count := range dp {
+ totalCount += count
+ }
+ return totalCount % mod
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0800~0899/0821.Shortest-Distance-to-a-Character/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0800~0899/0825.Friends-Of-Appropriate-Ages/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0800~0899/0825.Friends-Of-Appropriate-Ages.md b/website/content/ChapterFour/0800~0899/0825.Friends-Of-Appropriate-Ages.md
new file mode 100644
index 000000000..4f278efa1
--- /dev/null
+++ b/website/content/ChapterFour/0800~0899/0825.Friends-Of-Appropriate-Ages.md
@@ -0,0 +1,148 @@
+# [825. Friends Of Appropriate Ages](https://leetcode.com/problems/friends-of-appropriate-ages/)
+
+
+## 题目
+
+There are `n` persons on a social media website. You are given an integer array `ages` where `ages[i]` is the age of the `ith` person.
+
+A Person `x` will not send a friend request to a person `y` (`x != y`) if any of the following conditions is true:
+
+- `age[y] <= 0.5 * age+ 7`
+- `age[y] > age[x]`
+- `age[y] > 100 && age< 100`
+
+Otherwise, `x` will send a friend request to `y`.
+
+Note that if `x` sends a request to `y`, `y` will not necessarily send a request to `x`. Also, a person will not send a friend request to themself.
+
+Return *the total number of friend requests made*.
+
+**Example 1:**
+
+```
+Input: ages = [16,16]
+Output: 2
+Explanation: 2 people friend request each other.
+
+```
+
+**Example 2:**
+
+```
+Input: ages = [16,17,18]
+Output: 2
+Explanation: Friend requests are made 17 -> 16, 18 -> 17.
+
+```
+
+**Example 3:**
+
+```
+Input: ages = [20,30,100,110,120]
+Output: 3
+Explanation: Friend requests are made 110 -> 100, 120 -> 110, 120 -> 100.
+
+```
+
+**Constraints:**
+
+- `n == ages.length`
+- `1 <= n <= 2 * 10^4`
+- `1 <= ages[i] <= 120`
+
+## 题目大意
+
+在社交媒体网站上有 n 个用户。给你一个整数数组 ages ，其中 ages[i] 是第 i 个用户的年龄。
+
+如果下述任意一个条件为真，那么用户 x 将不会向用户 y（x != y）发送好友请求：
+
+- ages[y] <= 0.5 * ages[x] + 7
+- ages[y] > ages[x]
+- ages[y] > 100 && ages[x] < 100
+
+否则，x 将会向 y 发送一条好友请求。注意，如果 x 向 y 发送一条好友请求，y 不必也向 x 发送一条好友请求。另外，用户不会向自己发送好友请求。返回在该社交媒体网站上产生的好友请求总数。
+
+## 解题思路
+
+- 解法三，暴力解法。先统计 [1,120] 范围内每个年龄的人数。然后利用题目中的三个判断条件，筛选符合条件的用户对。需要注意的是，相同年龄的人可以相互发送好友请求。不同年龄的人发送好友请求是单向的，即年龄老的向年龄轻的发送好友请求，年龄轻的不会对年龄老的发送好友请求。
+- 解法二，排序 + 双指针。题目给定的 3 个条件其实是 2 个。条件 3 包含在条件 2 中。条件 1 和条件 2 组合起来是 `0.5 × ages[x]+7 < ages[y] ≤ ages[x]`。当 ages[x] 小于 15 时，这个等式无解。考虑到年龄是单调递增的，`(0.5 × ages[x]+7,ages[x]]` 这个区间左右边界也是单调递增的。于是可以用双指针维护两个边界。在区间 [left, right] 内，这些下标对应的的 y 值都满足条件。当 `ages[left] > 0.5 × ages[x]+7` 时，左指针停止右移。当 `ages[right+1] > ages[x]` 时， 右指针停止右移。在 `[left, right]` 区间内，满足条件的 y 有 `right-left+1` 个，即使得 `ages[y]` 取值在 `(0.5 × ages[x]+7,ages[x]]` 之间。依照题意，`x≠y`，即该区间右边界取不到。y 的取值个数需要再减一，减去的是取到和 x 相同的值的下标。那么每个区间能取 `right-left` 个值。累加所有满足条件的值即为好友请求总数。
+- 解法一。在解法二中，计算满足不等式 y 下标所在区间的时候，区间和区间存在重叠的情况，这些重叠情况导致了重复计算。所以这里可以优化。可以用 prefix sum 前缀和数组优化。代码见下方。
+
+## 代码
+
+```go
+package leetcocde
+
+import "sort"
+
+// 解法一 前缀和，时间复杂度 O(n)
+func numFriendRequests(ages []int) int {
+ count, prefixSum, res := make([]int, 121), make([]int, 121), 0
+ for _, age := range ages {
+ count[age]++
+ }
+ for i := 1; i < 121; i++ {
+ prefixSum[i] = prefixSum[i-1] + count[i]
+ }
+ for i := 15; i < 121; i++ {
+ if count[i] > 0 {
+ bound := i/2 + 8
+ res += count[i] * (prefixSum[i] - prefixSum[bound-1] - 1)
+ }
+ }
+ return res
+}
+
+// 解法二 双指针 + 排序，时间复杂度 O(n logn)
+func numFriendRequests1(ages []int) int {
+ sort.Ints(ages)
+ left, right, res := 0, 0, 0
+ for _, age := range ages {
+ if age < 15 {
+ continue
+ }
+ for ages[left]*2 <= age+14 {
+ left++
+ }
+ for right+1 < len(ages) && ages[right+1] <= age {
+ right++
+ }
+ res += right - left
+ }
+ return res
+}
+
+// 解法三 暴力解法 O(n^2)
+func numFriendRequests2(ages []int) int {
+ res, count := 0, [125]int{}
+ for _, x := range ages {
+ count[x]++
+ }
+ for i := 1; i <= 120; i++ {
+ for j := 1; j <= 120; j++ {
+ if j > i {
+ continue
+ }
+ if (j-7)*2 <= i {
+ continue
+ }
+ if j > 100 && i < 100 {
+ continue
+ }
+ if i != j {
+ res += count[i] * count[j]
+ } else {
+ res += count[i] * (count[j] - 1)
+ }
+ }
+ }
+ return res
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0800~0899/0823.Binary-Trees-With-Factors/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0800~0899/0826.Most-Profit-Assigning-Work/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0826.Most-Profit-Assigning-Work.md b/website/content/ChapterFour/0800~0899/0826.Most-Profit-Assigning-Work.md
similarity index 88%
rename from website/content/ChapterFour/0826.Most-Profit-Assigning-Work.md
rename to website/content/ChapterFour/0800~0899/0826.Most-Profit-Assigning-Work.md
index 33059b959..fa7464dbd 100644
--- a/website/content/ChapterFour/0826.Most-Profit-Assigning-Work.md
+++ b/website/content/ChapterFour/0800~0899/0826.Most-Profit-Assigning-Work.md
@@ -104,4 +104,11 @@ func maxProfitAssignment(difficulty []int, profit []int, worker []int) int {
return res
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0800~0899/0825.Friends-Of-Appropriate-Ages/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0800~0899/0828.Count-Unique-Characters-of-All-Substrings-of-a-Given-String/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0800~0899/0828.Count-Unique-Characters-of-All-Substrings-of-a-Given-String.md b/website/content/ChapterFour/0800~0899/0828.Count-Unique-Characters-of-All-Substrings-of-a-Given-String.md
new file mode 100644
index 000000000..6f5f28d42
--- /dev/null
+++ b/website/content/ChapterFour/0800~0899/0828.Count-Unique-Characters-of-All-Substrings-of-a-Given-String.md
@@ -0,0 +1,108 @@
+# [828. Count Unique Characters of All Substrings of a Given String](https://leetcode.com/problems/count-unique-characters-of-all-substrings-of-a-given-string/)
+
+
+## 题目
+
+Let's define a function `countUniqueChars(s)` that returns the number of unique characters on `s`, for example if `s = "LEETCODE"` then `"L"`, `"T"`,`"C"`,`"O"`,`"D"` are the unique characters since they appear only once in `s`, therefore `countUniqueChars(s) = 5`.On this problem given a string `s` we need to return the sum of `countUniqueChars(t)` where `t` is a substring of `s`. Notice that some substrings can be repeated so on this case you have to count the repeated ones too.
+
+Since the answer can be very large, return the answer modulo `10 ^ 9 + 7`.
+
+**Example 1**:
+
+```
+Input: s = "ABC"
+Output: 10
+Explanation: All possible substrings are: "A","B","C","AB","BC" and "ABC".
+Evey substring is composed with only unique letters.
+Sum of lengths of all substring is 1 + 1 + 1 + 2 + 2 + 3 = 10
+
+```
+
+**Example 2**:
+
+```
+Input: s = "ABA"
+Output: 8
+Explanation: The same as example 1, except countUniqueChars("ABA") = 1.
+
+```
+
+**Example 3**:
+
+```
+Input: s = "LEETCODE"
+Output: 92
+
+```
+
+**Constraints**:
+
+- `0 <= s.length <= 10^4`
+- `s` contain upper-case English letters only.
+
+## 题目大意
+
+如果一个字符在字符串 S 中有且仅有出现一次，那么我们称其为独特字符。例如，在字符串 S = "LETTER" 中，"L" 和 "R" 可以被称为独特字符。我们再定义 UNIQ(S) 作为字符串 S 中独特字符的个数。那么，在 S = "LETTER" 中， UNIQ("LETTER") = 2。
+
+对于给定字符串 S，计算其所有非空子串的独特字符的个数（即 UNIQ(substring)）之和。如果在 S 的不同位置上出现两个甚至多个相同的子串，那么我们认为这些子串是不同的。考虑到答案可能会非常大，规定返回格式为：结果 mod 10 ^ 9 + 7。
+
+## 解题思路
+
+- 这一题可以先用暴力解法尝试解题，不过提交以后会发现判题结果是超时。出错的一组数据是一个有 10000 个字符的字符串。暴力解法中间由于遍历了太多的子区间，导致了超时。
+- 这道题换一个角度思考问题。当子字符串中字符 X 出现了 2 次以上，那么它就对最终结果没有任何影响，所以只有当某个字符只出现一次的时候才会影响最终结果。再者，一个子字符串中不重复的字符的总个数，也就是这个子字符串 UNIQ 值。例如，“ABC”，这个子字符串的 UNIQ 值是 3，可以这样计算，它属于 A 的独特的字符串，也属于 B 的独特的字符串，也属于 C 的独特的字符串，那么计算这个子字符串的问题可以分解成计算 A 有多少个独特的子字符串，B 有多少个独特的子字符串，C 有多少个独特的子字符串的问题。在计算 A 有多少个子字符串的问题的时候，里面肯定会包含 "ABC" 这个子字符串的。所以原问题就转换成了分别计算给出的字符串中每个字符出现在独特字符串中的总数之和。
+- 假设原字符串是 BAABBABBBAAABA，这个字符串中出现了很多 A 和很多 B，假设我们当前计算到了第 3 个 A 的位置了(index = 5)，即标红色的那个 A。如何计算这个 A 在哪些子字符串中是独特的呢？由于子字符串题目中要求必须是连续的区间，所以这个问题很简单。找到这个 A 前一个 A 的下标位置(index = 2)，再找到这个 A 后一个 A 的下标位置(index = 9)，即 BAABBABBBAAABA，第一个 A 和当前计算的 A 中间区间有 2 个字符，第三个 A 和当前计算的 A 中间有 3 个字符。那么当前计算的 A 出现在 `(2 + 1) * (3 + 1) = 12` 个子字符串中是独特的，这 12 个字符串是：`A`，`BA`，`BBA`，`AB`，`ABB`，`ABBB`，`BAB`，`BABB`，`BABBB`，`BBAB`，`BBABB`，`BBABBB`。计算方法，假设当前待计算的字符的下标是 i ，找到当前字符前一次出现的下标位置 left，再找到当前字符后一次出现的下标位置 right，那么左边区间 (left,i) 的***开区间****内包含的字符数是 i - left - 1，右边区间 (i,right) 的***开区间****内包含的字符数是 right - i - 1。左右两边都还需要考虑空字符串的情况，即左右两边都可以不取任何字符，那么对应的就是只有中间这个待计算的字符 `A`。所以左右两边都还需要再加上空串的情况，左边 i - left - 1 + 1 = i - left，右边 right - i - 1 + 1 = right - i。左右两边的情况进行排列组合，即 (i - left) * (right - i)。针对字符串的每个字符都计算这样的值，最后累积的总和就是题目中要求的总 UNIQ 值。
+
+## 代码
+
+```go
+package leetcode
+
+func uniqueLetterString(S string) int {
+ res, left, right := 0, 0, 0
+ for i := 0; i < len(S); i++ {
+ left = i - 1
+ for left >= 0 && S[left] != S[i] {
+ left--
+ }
+ right = i + 1
+ for right < len(S) && S[right] != S[i] {
+ right++
+ }
+ res += (i - left) * (right - i)
+ }
+ return res % 1000000007
+}
+
+// 暴力解法，超时！时间复杂度 O(n^2)
+func uniqueLetterString1(S string) int {
+ if len(S) == 0 {
+ return 0
+ }
+ res, mod := 0, 1000000007
+ for i := 0; i < len(S); i++ {
+ letterMap := map[byte]int{}
+ for j := i; j < len(S); j++ {
+ letterMap[S[j]]++
+ tmp := 0
+ for _, v := range letterMap {
+ if v > 1 {
+ tmp++
+ }
+ }
+ if tmp == len(letterMap) {
+ continue
+ } else {
+ res += len(letterMap) - tmp
+ }
+ }
+ }
+ return res % mod
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0800~0899/0826.Most-Profit-Assigning-Work/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0800~0899/0830.Positions-of-Large-Groups/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0800~0899/0830.Positions-of-Large-Groups.md b/website/content/ChapterFour/0800~0899/0830.Positions-of-Large-Groups.md
new file mode 100644
index 000000000..5efa20eda
--- /dev/null
+++ b/website/content/ChapterFour/0800~0899/0830.Positions-of-Large-Groups.md
@@ -0,0 +1,87 @@
+# [830. Positions of Large Groups](https://leetcode.com/problems/positions-of-large-groups/)
+
+
+## 题目
+
+In a string `s` of lowercase letters, these letters form consecutive groups of the same character.
+
+For example, a string like `s = "abbxxxxzyy"` has the groups `"a"`, `"bb"`, `"xxxx"`, `"z"`, and `"yy"`.
+
+A group is identified by an interval `[start, end]`, where `start` and `end` denote the start and end indices (inclusive) of the group. In the above example, `"xxxx"` has the interval `[3,6]`.
+
+A group is considered **large** if it has 3 or more characters.
+
+Return *the intervals of every **large** group sorted in **increasing order by start index***.
+
+**Example 1**:
+
+```
+Input: s = "abbxxxxzzy"
+Output: [[3,6]]
+Explanation: "xxxx" is the only large group with start index 3 and end index 6.
+```
+
+**Example 2**:
+
+```
+Input: s = "abc"
+Output: []
+Explanation: We have groups "a", "b", and "c", none of which are large groups.
+```
+
+**Example 3**:
+
+```
+Input: s = "abcdddeeeeaabbbcd"
+Output: [[3,5],[6,9],[12,14]]
+Explanation: The large groups are "ddd", "eeee", and "bbb".
+```
+
+**Example 4**:
+
+```
+Input: s = "aba"
+Output: []
+```
+
+**Constraints**:
+
+- `1 <= s.length <= 1000`
+- `s` contains lower-case English letters only.
+
+## 题目大意
+
+在一个由小写字母构成的字符串 s 中，包含由一些连续的相同字符所构成的分组。例如，在字符串 s = "abbxxxxzyy" 中，就含有 "a", "bb", "xxxx", "z" 和 "yy" 这样的一些分组。分组可以用区间 [start, end] 表示，其中 start 和 end 分别表示该分组的起始和终止位置的下标。上例中的 "xxxx" 分组用区间表示为 [3,6] 。我们称所有包含大于或等于三个连续字符的分组为 较大分组 。
+
+找到每一个 较大分组 的区间，按起始位置下标递增顺序排序后，返回结果。
+
+## 解题思路
+
+- 简单题。利用滑动窗口的思想，先扩大窗口的右边界，找到能相同字母且能到达的最右边。记录左右边界。再将窗口的左边界移动到上一次的右边界处。以此类推，重复扩大窗口的右边界，直至扫完整个字符串。最终所有满足题意的较大分组区间都在数组中了。
+
+## 代码
+
+```go
+package leetcode
+
+func largeGroupPositions(S string) [][]int {
+ res, end := [][]int{}, 0
+ for end < len(S) {
+ start, str := end, S[end]
+ for end < len(S) && S[end] == str {
+ end++
+ }
+ if end-start >= 3 {
+ res = append(res, []int{start, end - 1})
+ }
+ }
+ return res
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0800~0899/0828.Count-Unique-Characters-of-All-Substrings-of-a-Given-String/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0800~0899/0832.Flipping-an-Image/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0832.Flipping-an-Image.md b/website/content/ChapterFour/0800~0899/0832.Flipping-an-Image.md
similarity index 83%
rename from website/content/ChapterFour/0832.Flipping-an-Image.md
rename to website/content/ChapterFour/0800~0899/0832.Flipping-an-Image.md
index 81b8ccc97..3c3bc5aa9 100644
--- a/website/content/ChapterFour/0832.Flipping-an-Image.md
+++ b/website/content/ChapterFour/0800~0899/0832.Flipping-an-Image.md
@@ -60,4 +60,11 @@ func flipAndInvertImage(A [][]int) [][]int {
return A
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0800~0899/0830.Positions-of-Large-Groups/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0800~0899/0834.Sum-of-Distances-in-Tree/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0834.Sum-of-Distances-in-Tree.md b/website/content/ChapterFour/0800~0899/0834.Sum-of-Distances-in-Tree.md
similarity index 93%
rename from website/content/ChapterFour/0834.Sum-of-Distances-in-Tree.md
rename to website/content/ChapterFour/0800~0899/0834.Sum-of-Distances-in-Tree.md
index b0390a4aa..f4c5a0497 100755
--- a/website/content/ChapterFour/0834.Sum-of-Distances-in-Tree.md
+++ b/website/content/ChapterFour/0800~0899/0834.Sum-of-Distances-in-Tree.md
@@ -98,4 +98,11 @@ func deepSecondSearch(root int, visited []bool, count, res []int, tree [][]int)
}
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0800~0899/0832.Flipping-an-Image/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0800~0899/0836.Rectangle-Overlap/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0836.Rectangle-Overlap.md b/website/content/ChapterFour/0800~0899/0836.Rectangle-Overlap.md
similarity index 80%
rename from website/content/ChapterFour/0836.Rectangle-Overlap.md
rename to website/content/ChapterFour/0800~0899/0836.Rectangle-Overlap.md
index 2cce0169b..0475596b1 100755
--- a/website/content/ChapterFour/0836.Rectangle-Overlap.md
+++ b/website/content/ChapterFour/0800~0899/0836.Rectangle-Overlap.md
@@ -51,4 +51,11 @@ func isRectangleOverlap(rec1 []int, rec2 []int) bool {
return rec1[0] < rec2[2] && rec2[0] < rec1[2] && rec1[1] < rec2[3] && rec2[1] < rec1[3]
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0800~0899/0834.Sum-of-Distances-in-Tree/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0800~0899/0838.Push-Dominoes/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0838.Push-Dominoes.md b/website/content/ChapterFour/0800~0899/0838.Push-Dominoes.md
similarity index 89%
rename from website/content/ChapterFour/0838.Push-Dominoes.md
rename to website/content/ChapterFour/0800~0899/0838.Push-Dominoes.md
index 7acc9ce53..773914eff 100644
--- a/website/content/ChapterFour/0838.Push-Dominoes.md
+++ b/website/content/ChapterFour/0800~0899/0838.Push-Dominoes.md
@@ -141,4 +141,11 @@ func pushDominoes1(dominoes string) string {
return res
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0800~0899/0836.Rectangle-Overlap/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0800~0899/0839.Similar-String-Groups/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0839.Similar-String-Groups.md b/website/content/ChapterFour/0800~0899/0839.Similar-String-Groups.md
similarity index 90%
rename from website/content/ChapterFour/0839.Similar-String-Groups.md
rename to website/content/ChapterFour/0800~0899/0839.Similar-String-Groups.md
index 217ee2da3..c369de1d9 100755
--- a/website/content/ChapterFour/0839.Similar-String-Groups.md
+++ b/website/content/ChapterFour/0800~0899/0839.Similar-String-Groups.md
@@ -66,7 +66,7 @@ We are given a list `A` of strings. Every string in `A` is an anagram of eve
package leetcode
import (
- "github.com/halfrost/LeetCode-Go/template"
+ "github.com/halfrost/leetcode-go/template"
)
func numSimilarGroups(A []string) int {
@@ -95,4 +95,11 @@ func isSimilar(a, b string) bool {
return true
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0800~0899/0838.Push-Dominoes/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0800~0899/0841.Keys-and-Rooms/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0841.Keys-and-Rooms.md b/website/content/ChapterFour/0800~0899/0841.Keys-and-Rooms.md
similarity index 86%
rename from website/content/ChapterFour/0841.Keys-and-Rooms.md
rename to website/content/ChapterFour/0800~0899/0841.Keys-and-Rooms.md
index 69d1da3a2..8e4f23f93 100644
--- a/website/content/ChapterFour/0841.Keys-and-Rooms.md
+++ b/website/content/ChapterFour/0800~0899/0841.Keys-and-Rooms.md
@@ -77,4 +77,11 @@ func dfsVisitAllRooms(es [][]int, visited map[int]bool, from int) {
dfsVisitAllRooms(es, visited, to)
}
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0800~0899/0839.Similar-String-Groups/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0800~0899/0842.Split-Array-into-Fibonacci-Sequence/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0842.Split-Array-into-Fibonacci-Sequence.md b/website/content/ChapterFour/0800~0899/0842.Split-Array-into-Fibonacci-Sequence.md
similarity index 91%
rename from website/content/ChapterFour/0842.Split-Array-into-Fibonacci-Sequence.md
rename to website/content/ChapterFour/0800~0899/0842.Split-Array-into-Fibonacci-Sequence.md
index 9bb286ec4..a50cc2f3f 100755
--- a/website/content/ChapterFour/0842.Split-Array-into-Fibonacci-Sequence.md
+++ b/website/content/ChapterFour/0800~0899/0842.Split-Array-into-Fibonacci-Sequence.md
@@ -132,4 +132,11 @@ func findRecursiveCheck(S string, x1 int, x2 int, left int, res *[]int, isComple
return
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0800~0899/0841.Keys-and-Rooms/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0800~0899/0844.Backspace-String-Compare/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0844.Backspace-String-Compare.md b/website/content/ChapterFour/0800~0899/0844.Backspace-String-Compare.md
similarity index 79%
rename from website/content/ChapterFour/0844.Backspace-String-Compare.md
rename to website/content/ChapterFour/0800~0899/0844.Backspace-String-Compare.md
index fb758f3b0..6adcab297 100644
--- a/website/content/ChapterFour/0844.Backspace-String-Compare.md
+++ b/website/content/ChapterFour/0800~0899/0844.Backspace-String-Compare.md
@@ -108,4 +108,11 @@ func backspaceCompare(S string, T string) bool {
return string(s) == string(s2)
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0800~0899/0842.Split-Array-into-Fibonacci-Sequence/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0800~0899/0845.Longest-Mountain-in-Array/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0845.Longest-Mountain-in-Array.md b/website/content/ChapterFour/0800~0899/0845.Longest-Mountain-in-Array.md
similarity index 82%
rename from website/content/ChapterFour/0845.Longest-Mountain-in-Array.md
rename to website/content/ChapterFour/0800~0899/0845.Longest-Mountain-in-Array.md
index 0f44f6739..8854bef47 100644
--- a/website/content/ChapterFour/0845.Longest-Mountain-in-Array.md
+++ b/website/content/ChapterFour/0800~0899/0845.Longest-Mountain-in-Array.md
@@ -88,4 +88,11 @@ func longestMountain(A []int) int {
return res
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0800~0899/0844.Backspace-String-Compare/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0800~0899/0846.Hand-of-Straights/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0800~0899/0846.Hand-of-Straights.md b/website/content/ChapterFour/0800~0899/0846.Hand-of-Straights.md
new file mode 100644
index 000000000..f26eb6cc6
--- /dev/null
+++ b/website/content/ChapterFour/0800~0899/0846.Hand-of-Straights.md
@@ -0,0 +1,75 @@
+# [846. Hand of Straights](https://leetcode.com/problems/hand-of-straights/)
+
+## 题目
+
+Alice has some number of cards and she wants to rearrange the cards into groups so that each group is of size groupSize, and consists of groupSize consecutive cards.
+
+Given an integer array hand where hand[i] is the value written on the ith card and an integer groupSize, return true if she can rearrange the cards, or false otherwise.
+
+**Example 1**:
+
+ Input: hand = [1,2,3,6,2,3,4,7,8], groupSize = 3
+ Output: true
+ Explanation: Alice's hand can be rearranged as [1,2,3],[2,3,4],[6,7,8]
+
+**Example 2**:
+
+ Input: hand = [1,2,3,4,5], groupSize = 4
+ Output: false
+ Explanation: Alice's hand can not be rearranged into groups of 4.
+
+**Constraints:**
+
+- 1 <= hand.length <= 10000
+- 0 <= hand[i] <= 1000000000
+- 1 <= groupSize <= hand.length
+
+## 题目大意
+
+Alice 手中有一把牌，她想要重新排列这些牌，分成若干组，使每一组的牌数都是 groupSize ，并且由 groupSize 张连续的牌组成。
+
+给你一个整数数组 hand 其中 hand[i] 是写在第 i 张牌，和一个整数 groupSize 。如果她可能重新排列这些牌，返回 true ；否则，返回 false 。
+
+## 解题思路
+
+贪心算法
+
+- 对hand升序排序
+- 对hand内数字进行哈希计数（key:数字，value:数量）
+- 遍历hand中的数字，以数量大于1的数字作为顺子开头，寻找顺子后续元素，若无法找到完整顺子则返回false
+- 所有数字都能找到完整顺子返回true
+
+##代码
+
+```go
+package leetcode
+
+import "sort"
+
+func isNStraightHand(hand []int, groupSize int) bool {
+ mp := make(map[int]int)
+ for _, v := range hand {
+ mp[v] += 1
+ }
+ sort.Ints(hand)
+ for _, num := range hand {
+ if mp[num] == 0 {
+ continue
+ }
+ for diff := 0; diff < groupSize; diff++ {
+ if mp[num+diff] == 0 {
+ return false
+ }
+ mp[num+diff] -= 1
+ }
+ }
+ return true
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0800~0899/0845.Longest-Mountain-in-Array/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0800~0899/0850.Rectangle-Area-II/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0850.Rectangle-Area-II.md b/website/content/ChapterFour/0800~0899/0850.Rectangle-Area-II.md
similarity index 96%
rename from website/content/ChapterFour/0850.Rectangle-Area-II.md
rename to website/content/ChapterFour/0800~0899/0850.Rectangle-Area-II.md
index 29dbe94e4..b16e51fe7 100755
--- a/website/content/ChapterFour/0850.Rectangle-Area-II.md
+++ b/website/content/ChapterFour/0800~0899/0850.Rectangle-Area-II.md
@@ -290,4 +290,11 @@ func (sat *SegmentAreaTree) updateInTree(treeIndex, left, right, updateLeft, upd
sat.pushUp(treeIndex, leftTreeIndex, rightTreeIndex)
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0800~0899/0846.Hand-of-Straights/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0800~0899/0851.Loud-and-Rich/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0851.Loud-and-Rich.md b/website/content/ChapterFour/0800~0899/0851.Loud-and-Rich.md
similarity index 91%
rename from website/content/ChapterFour/0851.Loud-and-Rich.md
rename to website/content/ChapterFour/0800~0899/0851.Loud-and-Rich.md
index 26351328b..ca43a9ef0 100644
--- a/website/content/ChapterFour/0851.Loud-and-Rich.md
+++ b/website/content/ChapterFour/0800~0899/0851.Loud-and-Rich.md
@@ -105,4 +105,11 @@ func loudAndRich(richer [][]int, quiet []int) []int {
}
return res
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0800~0899/0850.Rectangle-Area-II/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0800~0899/0852.Peak-Index-in-a-Mountain-Array/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0852.Peak-Index-in-a-Mountain-Array.md b/website/content/ChapterFour/0800~0899/0852.Peak-Index-in-a-Mountain-Array.md
similarity index 86%
rename from website/content/ChapterFour/0852.Peak-Index-in-a-Mountain-Array.md
rename to website/content/ChapterFour/0800~0899/0852.Peak-Index-in-a-Mountain-Array.md
index ea6ae9421..12aa32deb 100755
--- a/website/content/ChapterFour/0852.Peak-Index-in-a-Mountain-Array.md
+++ b/website/content/ChapterFour/0800~0899/0852.Peak-Index-in-a-Mountain-Array.md
@@ -88,4 +88,11 @@ func peakIndexInMountainArray1(A []int) int {
return low
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0800~0899/0851.Loud-and-Rich/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0800~0899/0853.Car-Fleet/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0853.Car-Fleet.md b/website/content/ChapterFour/0800~0899/0853.Car-Fleet.md
similarity index 89%
rename from website/content/ChapterFour/0853.Car-Fleet.md
rename to website/content/ChapterFour/0800~0899/0853.Car-Fleet.md
index b28efdbd7..b3532036f 100755
--- a/website/content/ChapterFour/0853.Car-Fleet.md
+++ b/website/content/ChapterFour/0800~0899/0853.Car-Fleet.md
@@ -95,4 +95,11 @@ func carFleet(target int, position []int, speed []int) int {
return fleet
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0800~0899/0852.Peak-Index-in-a-Mountain-Array/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0800~0899/0856.Score-of-Parentheses/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0856.Score-of-Parentheses.md b/website/content/ChapterFour/0800~0899/0856.Score-of-Parentheses.md
similarity index 82%
rename from website/content/ChapterFour/0856.Score-of-Parentheses.md
rename to website/content/ChapterFour/0800~0899/0856.Score-of-Parentheses.md
index 9d5c8758e..d94ee68f1 100644
--- a/website/content/ChapterFour/0856.Score-of-Parentheses.md
+++ b/website/content/ChapterFour/0800~0899/0856.Score-of-Parentheses.md
@@ -99,4 +99,11 @@ func scoreOfParentheses(S string) int {
return res
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0800~0899/0853.Car-Fleet/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0800~0899/0859.Buddy-Strings/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0800~0899/0859.Buddy-Strings.md b/website/content/ChapterFour/0800~0899/0859.Buddy-Strings.md
new file mode 100644
index 000000000..9c8ddd17f
--- /dev/null
+++ b/website/content/ChapterFour/0800~0899/0859.Buddy-Strings.md
@@ -0,0 +1,94 @@
+# [859. Buddy Strings](https://leetcode.com/problems/buddy-strings/)
+
+## 题目
+
+Given two strings s and goal, return true if you can swap two letters in s so the result is equal to goal, otherwise, return false.
+
+Swapping letters is defined as taking two indices i and j (0-indexed) such that i != j and swapping the characters at s[i] and s[j].
+
+For example, swapping at indices 0 and 2 in "abcd" results in "cbad".
+
+**Example 1**:
+
+ Input: s = "ab", goal = "ba"
+ Output: true
+ Explanation: You can swap s[0] = 'a' and s[1] = 'b' to get "ba", which is equal to goal.
+
+**Example 2**:
+
+ Input: s = "ab", goal = "ab"
+ Output: false
+ Explanation: The only letters you can swap are s[0] = 'a' and s[1] = 'b', which results in "ba" != goal.
+
+**Example 3**:
+
+ Input: s = "aa", goal = "aa"
+ Output: true
+ Explanation: You can swap s[0] = 'a' and s[1] = 'a' to get "aa", which is equal to goal.
+
+**Example 4**:
+
+ Input: s = "aaaaaaabc", goal = "aaaaaaacb"
+ Output: true
+
+**Constraints:**
+
+- 1 <= s.length, goal.length <= 2 * 10000
+- s and goal consist of lowercase letters.
+
+## 题目大意
+
+给你两个字符串 s 和 goal ，只要我们可以通过交换 s 中的两个字母得到与 goal 相等的结果，就返回 true；否则返回 false 。
+
+交换字母的定义是：取两个下标 i 和 j （下标从 0 开始）且满足 i != j ，接着交换 s[i] 和 s[j] 处的字符。
+
+例如，在 "abcd" 中交换下标 0 和下标 2 的元素可以生成 "cbad" 。
+
+## 解题思路
+
+分为两种情况进行比较:
+- s 等于 goal, s 中有重复元素就返回 true,否则返回 false
+- s 不等于 goal, s 中有两个下标不同的字符与 goal 中对应下标的字符分别相等
+
+## 代码
+
+```go
+
+package leetcode
+
+func buddyStrings(s string, goal string) bool {
+ if len(s) != len(goal) || len(s) <= 1 {
+ return false
+ }
+ mp := make(map[byte]int)
+ if s == goal {
+ for i := 0; i < len(s); i++ {
+ if _, ok := mp[s[i]]; ok {
+ return true
+ }
+ mp[s[i]]++
+ }
+ return false
+ }
+ first, second := -1, -1
+ for i := 0; i < len(s); i++ {
+ if s[i] != goal[i] {
+ if first == -1 {
+ first = i
+ } else if second == -1 {
+ second = i
+ } else {
+ return false
+ }
+ }
+ }
+ return second != -1 && s[first] == goal[second] && s[second] == goal[first]
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0800~0899/0856.Score-of-Parentheses/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0800~0899/0862.Shortest-Subarray-with-Sum-at-Least-K/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0862.Shortest-Subarray-with-Sum-at-Least-K.md b/website/content/ChapterFour/0800~0899/0862.Shortest-Subarray-with-Sum-at-Least-K.md
similarity index 91%
rename from website/content/ChapterFour/0862.Shortest-Subarray-with-Sum-at-Least-K.md
rename to website/content/ChapterFour/0800~0899/0862.Shortest-Subarray-with-Sum-at-Least-K.md
index 469ca3bd7..0f0090725 100644
--- a/website/content/ChapterFour/0862.Shortest-Subarray-with-Sum-at-Least-K.md
+++ b/website/content/ChapterFour/0800~0899/0862.Shortest-Subarray-with-Sum-at-Least-K.md
@@ -87,4 +87,11 @@ func shortestSubarray(A []int, K int) int {
}
return -1
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0800~0899/0859.Buddy-Strings/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0800~0899/0863.All-Nodes-Distance-K-in-Binary-Tree/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0863.All-Nodes-Distance-K-in-Binary-Tree.md b/website/content/ChapterFour/0800~0899/0863.All-Nodes-Distance-K-in-Binary-Tree.md
similarity index 87%
rename from website/content/ChapterFour/0863.All-Nodes-Distance-K-in-Binary-Tree.md
rename to website/content/ChapterFour/0800~0899/0863.All-Nodes-Distance-K-in-Binary-Tree.md
index 4ea32b206..2944f0e14 100644
--- a/website/content/ChapterFour/0863.All-Nodes-Distance-K-in-Binary-Tree.md
+++ b/website/content/ChapterFour/0800~0899/0863.All-Nodes-Distance-K-in-Binary-Tree.md
@@ -93,4 +93,11 @@ func findChild(root *TreeNode, K int, visit *[]int) {
findChild(root.Right, K-1, visit)
}
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0800~0899/0862.Shortest-Subarray-with-Sum-at-Least-K/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0800~0899/0864.Shortest-Path-to-Get-All-Keys/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0864.Shortest-Path-to-Get-All-Keys.md b/website/content/ChapterFour/0800~0899/0864.Shortest-Path-to-Get-All-Keys.md
similarity index 95%
rename from website/content/ChapterFour/0864.Shortest-Path-to-Get-All-Keys.md
rename to website/content/ChapterFour/0800~0899/0864.Shortest-Path-to-Get-All-Keys.md
index d6d65b49c..7c05689b1 100755
--- a/website/content/ChapterFour/0864.Shortest-Path-to-Get-All-Keys.md
+++ b/website/content/ChapterFour/0800~0899/0864.Shortest-Path-to-Get-All-Keys.md
@@ -228,4 +228,11 @@ func isKey(board [][]byte, x, y int) bool {
return false
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0800~0899/0863.All-Nodes-Distance-K-in-Binary-Tree/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0800~0899/0867.Transpose-Matrix/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0800~0899/0867.Transpose-Matrix.md b/website/content/ChapterFour/0800~0899/0867.Transpose-Matrix.md
new file mode 100755
index 000000000..8560e9169
--- /dev/null
+++ b/website/content/ChapterFour/0800~0899/0867.Transpose-Matrix.md
@@ -0,0 +1,64 @@
+# [867. Transpose Matrix](https://leetcode.com/problems/transpose-matrix/)
+
+
+## 题目
+
+Given a matrix `A`, return the transpose of `A`.
+
+The transpose of a matrix is the matrix flipped over it's main diagonal, switching the row and column indices of the matrix.
+
+**Example 1**:
+
+ Input: [[1,2,3],[4,5,6],[7,8,9]]
+ Output: [[1,4,7],[2,5,8],[3,6,9]]
+
+**Example 2**:
+
+ Input: [[1,2,3],[4,5,6]]
+ Output: [[1,4],[2,5],[3,6]]
+
+**Note**:
+
+1. `1 <= A.length <= 1000`
+2. `1 <= A[0].length <= 1000`
+
+
+## 题目大意
+
+给定一个矩阵 A， 返回 A 的转置矩阵。矩阵的转置是指将矩阵的主对角线翻转，交换矩阵的行索引与列索引。
+
+
+## 解题思路
+
+
+- 给出一个矩阵，顺时针旋转 90°
+- 解题思路很简单，直接模拟即可。
+
+
+## 代码
+
+```go
+
+package leetcode
+
+func transpose(A [][]int) [][]int {
+ row, col, result := len(A), len(A[0]), make([][]int, len(A[0]))
+ for i := range result {
+ result[i] = make([]int, row)
+ }
+ for i := 0; i < row; i++ {
+ for j := 0; j < col; j++ {
+ result[j][i] = A[i][j]
+ }
+ }
+ return result
+}
+
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0800~0899/0864.Shortest-Path-to-Get-All-Keys/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0800~0899/0869.Reordered-Power-of-2/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0800~0899/0869.Reordered-Power-of-2.md b/website/content/ChapterFour/0800~0899/0869.Reordered-Power-of-2.md
new file mode 100644
index 000000000..183d1daf8
--- /dev/null
+++ b/website/content/ChapterFour/0800~0899/0869.Reordered-Power-of-2.md
@@ -0,0 +1,100 @@
+# [869. Reordered Power of 2](https://leetcode.com/problems/reordered-power-of-2/)
+
+
+## 题目
+
+Starting with a positive integer `N`, we reorder the digits in any order (including the original order) such that the leading digit is not zero.
+
+Return `true` if and only if we can do this in a way such that the resulting number is a power of 2.
+
+**Example 1:**
+
+```
+Input:1
+Output:true
+```
+
+**Example 2:**
+
+```
+Input:10
+Output:false
+```
+
+**Example 3:**
+
+```
+Input:16
+Output:true
+```
+
+**Example 4:**
+
+```
+Input:24
+Output:false
+```
+
+**Example 5:**
+
+```
+Input:46
+Output:true
+```
+
+**Note:**
+
+1. `1 <= N <= 10^9`
+
+## 题目大意
+
+给定正整数 N ，我们按任何顺序（包括原始顺序）将数字重新排序，注意其前导数字不能为零。如果我们可以通过上述方式得到 2 的幂，返回 true；否则，返回 false。
+
+## 解题思路
+
+- 将整数每个位上的所有排列看成字符串，那么题目转换为判断这些字符串是否和 2 的幂的字符串是否一致。判断的方法有很多种，笔者这里判断借助了一个 `map`。两个不同排列的字符串要相等，所有字符出现的频次必定一样。利用一个 `map` 统计它们各自字符的频次，最终都一致，则判定这两个字符串是满足题意的。
+- 此题数据量比较小，在 `[1,10^9]` 这个区间内，2 的幂只有 30 几个，所以最终要判断的字符串就是这 30 几个。笔者这里没有打表了，采用更加一般的做法。数据量更大，此解法代码也能通过。
+
+## 代码
+
+```go
+package leetcode
+
+import "fmt"
+
+func reorderedPowerOf2(n int) bool {
+ sample, i := fmt.Sprintf("%v", n), 1
+ for len(fmt.Sprintf("%v", i)) <= len(sample) {
+ t := fmt.Sprintf("%v", i)
+ if len(t) == len(sample) && isSame(t, sample) {
+ return true
+ }
+ i = i << 1
+ }
+ return false
+}
+
+func isSame(t, s string) bool {
+ m := make(map[rune]int)
+ for _, v := range t {
+ m[v]++
+ }
+ for _, v := range s {
+ m[v]--
+ if m[v] < 0 {
+ return false
+ }
+ if m[v] == 0 {
+ delete(m, v)
+ }
+ }
+ return len(m) == 0
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0800~0899/0867.Transpose-Matrix/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0800~0899/0870.Advantage-Shuffle/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0800~0899/0870.Advantage-Shuffle.md b/website/content/ChapterFour/0800~0899/0870.Advantage-Shuffle.md
new file mode 100644
index 000000000..6d9ccecb1
--- /dev/null
+++ b/website/content/ChapterFour/0800~0899/0870.Advantage-Shuffle.md
@@ -0,0 +1,79 @@
+# [870. Advantage Shuffle](https://leetcode.com/problems/advantage-shuffle/)
+
+## 题目
+
+Given two arrays `A` and `B` of equal size, the *advantage of `A` with respect to `B`* is the number of indices `i` for which `A[i] > B[i]`.
+
+Return **any** permutation of `A` that maximizes its advantage with respect to `B`.
+
+**Example 1:**
+
+```
+Input:A = [2,7,11,15], B = [1,10,4,11]
+Output:[2,11,7,15]
+```
+
+**Example 2:**
+
+```
+Input:A = [12,24,8,32], B = [13,25,32,11]
+Output:[24,32,8,12]
+```
+
+**Note:**
+
+1. `1 <= A.length = B.length <= 10000`
+2. `0 <= A[i] <= 10^9`
+3. `0 <= B[i] <= 10^9`
+
+## 题目大意
+
+给定两个大小相等的数组 A 和 B，A 相对于 B 的优势可以用满足 A[i] > B[i] 的索引 i 的数目来描述。返回 A 的任意排列，使其相对于 B 的优势最大化。
+
+## 解题思路
+
+- 此题用贪心算法解题。如果 A 中最小的牌 a 能击败 B 中最小的牌 b，那么将它们配对。否则， a 将无益于我们的比分，因为它无法击败任何牌。这是贪心的策略，每次匹配都用手中最弱的牌和 B 中的最小牌 b 进行配对，这样会使 A 中剩余的牌严格的变大，最后会使得得分更多。
+- 在代码实现中，将 A 数组排序，B 数组按照下标排序。因为最终输出的是相对于 B 的优势结果，所以要针对 B 的下标不变来安排 A 的排列。排好序以后按照贪心策略选择 A 中牌的顺序。
+
+## 代码
+
+```go
+package leetcode
+
+import "sort"
+
+func advantageCount1(A []int, B []int) []int {
+ n := len(A)
+ sort.Ints(A)
+ sortedB := make([]int, n)
+ for i := range sortedB {
+ sortedB[i] = i
+ }
+ sort.Slice(sortedB, func(i, j int) bool {
+ return B[sortedB[i]] < B[sortedB[j]]
+ })
+ useless, i, res := make([]int, 0), 0, make([]int, n)
+ for _, index := range sortedB {
+ b := B[index]
+ for i < n && A[i] <= b {
+ useless = append(useless, A[i])
+ i++
+ }
+ if i < n {
+ res[index] = A[i]
+ i++
+ } else {
+ res[index] = useless[0]
+ useless = useless[1:]
+ }
+ }
+ return res
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0800~0899/0869.Reordered-Power-of-2/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0800~0899/0872.Leaf-Similar-Trees/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0872.Leaf-Similar-Trees.md b/website/content/ChapterFour/0800~0899/0872.Leaf-Similar-Trees.md
similarity index 85%
rename from website/content/ChapterFour/0872.Leaf-Similar-Trees.md
rename to website/content/ChapterFour/0800~0899/0872.Leaf-Similar-Trees.md
index 900b7e746..04f5b7f27 100644
--- a/website/content/ChapterFour/0872.Leaf-Similar-Trees.md
+++ b/website/content/ChapterFour/0800~0899/0872.Leaf-Similar-Trees.md
@@ -59,4 +59,11 @@ func dfsLeaf(root *TreeNode, leaf *[]int) {
dfsLeaf(root.Right, leaf)
}
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0800~0899/0870.Advantage-Shuffle/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0800~0899/0874.Walking-Robot-Simulation/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0800~0899/0874.Walking-Robot-Simulation.md b/website/content/ChapterFour/0800~0899/0874.Walking-Robot-Simulation.md
new file mode 100644
index 000000000..61df07cec
--- /dev/null
+++ b/website/content/ChapterFour/0800~0899/0874.Walking-Robot-Simulation.md
@@ -0,0 +1,142 @@
+# [874. Walking Robot Simulation](https://leetcode.com/problems/walking-robot-simulation/)
+
+
+## 题目
+
+A robot on an infinite XY-plane starts at point `(0, 0)` and faces north. The robot can receive one of three possible types of `commands`:
+
+- `2`: turn left `90` degrees,
+- `1`: turn right `90` degrees, or
+- `1 <= k <= 9`: move forward `k` units.
+
+Some of the grid squares are `obstacles`. The `ith` obstacle is at grid point `obstacles[i] = (xi, yi)`.
+
+If the robot would try to move onto them, the robot stays on the previous grid square instead (but still continues following the rest of the route.)
+
+Return *the maximum Euclidean distance that the robot will be from the origin **squared** (i.e. if the distance is* `5`*, return* `25`*)*.
+
+**Note:**
+
+- North means +Y direction.
+- East means +X direction.
+- South means -Y direction.
+- West means -X direction.
+
+**Example 1:**
+
+```
+Input: commands = [4,-1,3], obstacles = []
+Output: 25
+Explanation: The robot starts at (0, 0):
+1. Move north 4 units to (0, 4).
+2. Turn right.
+3. Move east 3 units to (3, 4).
+The furthest point away from the origin is (3, 4), which is 32 + 42 = 25 units away.
+
+```
+
+**Example 2:**
+
+```
+Input: commands = [4,-1,4,-2,4], obstacles = [[2,4]]
+Output: 65
+Explanation: The robot starts at (0, 0):
+1. Move north 4 units to (0, 4).
+2. Turn right.
+3. Move east 1 unit and get blocked by the obstacle at (2, 4), robot is at (1, 4).
+4. Turn left.
+5. Move north 4 units to (1, 8).
+The furthest point away from the origin is (1, 8), which is 12 + 82 = 65 units away.
+
+```
+
+**Constraints:**
+
+- `1 <= commands.length <= 104`
+- `commands[i]` is one of the values in the list `[-2,-1,1,2,3,4,5,6,7,8,9]`.
+- `0 <= obstacles.length <= 104`
+- `3 * 104 <= xi, yi <= 3 * 104`
+- The answer is guaranteed to be less than `231`.
+
+## 题目大意
+
+机器人在一个无限大小的 XY 网格平面上行走，从点 (0, 0) 处开始出发，面向北方。该机器人可以接收以下三种类型的命令 commands ：
+
+- 2 ：向左转 90 度
+- -1 ：向右转 90 度
+- 1 <= x <= 9 ：向前移动 x 个单位长度
+
+在网格上有一些格子被视为障碍物 obstacles 。第 i 个障碍物位于网格点 obstacles[i] = (xi, yi) 。机器人无法走到障碍物上，它将会停留在障碍物的前一个网格方块上，但仍然可以继续尝试进行该路线的其余部分。返回从原点到机器人所有经过的路径点（坐标为整数）的最大欧式距离的平方。（即，如果距离为 5 ，则返回 25 ）
+
+注意：
+
+- 北表示 +Y 方向。
+- 东表示 +X 方向。
+- 南表示 -Y 方向。
+- 西表示 -X 方向。
+
+## 解题思路
+
+- 这个题的难点在于，怎么用编程语言去描述机器人的行为，可以用以下数据结构表达机器人的行为：
+
+ ```go
+ direct:= 0 // direct表示机器人移动方向：0 1 2 3 4 （北东南西），默认朝北
+ x, y := 0, 0 // 表示当前机器人所在横纵坐标位置，默认为(0,0)
+ directX := []int{0, 1, 0, -1}
+ directY := []int{1, 0, -1, 0}
+ // 组合directX directY和direct，表示机器人往某一个方向移动
+ nextX := x + directX[direct]
+ nextY := y + directY[direct]
+ ```
+
+ 其他代码按照题意翻译即可
+
+## 代码
+
+```go
+package leetcode
+
+func robotSim(commands []int, obstacles [][]int) int {
+ m := make(map[[2]int]struct{})
+ for _, v := range obstacles {
+ if len(v) != 0 {
+ m[[2]int{v[0], v[1]}] = struct{}{}
+ }
+ }
+ directX := []int{0, 1, 0, -1}
+ directY := []int{1, 0, -1, 0}
+ direct, x, y := 0, 0, 0
+ result := 0
+ for _, c := range commands {
+ if c == -2 {
+ direct = (direct + 3) % 4
+ continue
+ }
+ if c == -1 {
+ direct = (direct + 1) % 4
+ continue
+ }
+ for ; c > 0; c-- {
+ nextX := x + directX[direct]
+ nextY := y + directY[direct]
+ if _, ok := m[[2]int{nextX, nextY}]; ok {
+ break
+ }
+ tmpResult := nextX*nextX + nextY*nextY
+ if tmpResult > result {
+ result = tmpResult
+ }
+ x = nextX
+ y = nextY
+ }
+ }
+ return result
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0800~0899/0872.Leaf-Similar-Trees/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0800~0899/0875.Koko-Eating-Bananas/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0875.Koko-Eating-Bananas.md b/website/content/ChapterFour/0800~0899/0875.Koko-Eating-Bananas.md
similarity index 88%
rename from website/content/ChapterFour/0875.Koko-Eating-Bananas.md
rename to website/content/ChapterFour/0800~0899/0875.Koko-Eating-Bananas.md
index f2c7c411c..734bf16d3 100755
--- a/website/content/ChapterFour/0875.Koko-Eating-Bananas.md
+++ b/website/content/ChapterFour/0800~0899/0875.Koko-Eating-Bananas.md
@@ -98,4 +98,11 @@ func maxInArr(xs []int) int {
return res
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0800~0899/0874.Walking-Robot-Simulation/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0800~0899/0876.Middle-of-the-Linked-List/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0876.Middle-of-the-Linked-List.md b/website/content/ChapterFour/0800~0899/0876.Middle-of-the-Linked-List.md
similarity index 83%
rename from website/content/ChapterFour/0876.Middle-of-the-Linked-List.md
rename to website/content/ChapterFour/0800~0899/0876.Middle-of-the-Linked-List.md
index b9f801fd2..264d75801 100644
--- a/website/content/ChapterFour/0876.Middle-of-the-Linked-List.md
+++ b/website/content/ChapterFour/0800~0899/0876.Middle-of-the-Linked-List.md
@@ -79,4 +79,11 @@ func middleNode(head *ListNode) *ListNode {
return p1
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0800~0899/0875.Koko-Eating-Bananas/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0800~0899/0877.Stone-Game/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0800~0899/0877.Stone-Game.md b/website/content/ChapterFour/0800~0899/0877.Stone-Game.md
new file mode 100644
index 000000000..104eedb8f
--- /dev/null
+++ b/website/content/ChapterFour/0800~0899/0877.Stone-Game.md
@@ -0,0 +1,57 @@
+# [877. Stone Game](https://leetcode.com/problems/stone-game/)
+
+## 题目
+
+Alex and Lee play a game with piles of stones. There are an even number of piles **arranged in a row**, and each pile has a positive integer number of stones `piles[i]`.
+
+The objective of the game is to end with the most stones. The total number of stones is odd, so there are no ties.
+
+Alex and Lee take turns, with Alex starting first. Each turn, a player takes the entire pile of stones from either the beginning or the end of the row. This continues until there are no more piles left, at which point the person with the most stones wins.
+
+Assuming Alex and Lee play optimally, return `True` if and only if Alex wins the game.
+
+**Example 1:**
+
+```
+Input: piles = [5,3,4,5]
+Output: true
+Explanation:
+Alex starts first, and can only take the first 5 or the last 5.
+Say he takes the first 5, so that the row becomes [3, 4, 5].
+If Lee takes 3, then the board is [4, 5], and Alex takes 5 to win with 10 points.
+If Lee takes the last 5, then the board is [3, 4], and Alex takes 4 to win with 9 points.
+This demonstrated that taking the first 5 was a winning move for Alex, so we return true.
+
+```
+
+**Constraints:**
+
+- `2 <= piles.length <= 500`
+- `piles.length` is even.
+- `1 <= piles[i] <= 500`
+- `sum(piles)` is odd.
+
+## 题目大意
+
+亚历克斯和李用几堆石子在做游戏。偶数堆石子排成一行，每堆都有正整数颗石子 piles[i] 。游戏以谁手中的石子最多来决出胜负。石子的总数是奇数，所以没有平局。亚历克斯和李轮流进行，亚历克斯先开始。 每回合，玩家从行的开始或结束处取走整堆石头。 这种情况一直持续到没有更多的石子堆为止，此时手中石子最多的玩家获胜。假设亚历克斯和李都发挥出最佳水平，当亚历克斯赢得比赛时返回 true ，当李赢得比赛时返回 false 。
+
+## 解题思路
+
+- 一遇到石子问题，很容易让人联想到是否和奇偶数相关。此题指定了石子堆数一定是偶数。所以从这里为突破口试试。Alex 先拿，要么取行首下标为 0 的石子，要么取行尾下标为 n-1 的石子。假设取下标为 0 的石子，剩下的石子堆下标从 1 ~ n-1，即 Lee 只能从奇数下标的石子堆 1 或者 n-1。假设 Alex 第一次取下标为 n-1 的石子，剩下的石子堆下标从 0 ~ n-2，即 Lee 只能取偶数下标的石子堆。于是 Alex 的必胜策略是每轮取石子，取此轮奇数下标堆石子数总和，偶数下标堆石子数总和，两者大者。那么下一轮 Lee 只能取石子堆数相对少的那一堆，并且 Lee 取的石子堆下标奇偶性是完全受到上一轮 Alex 控制的。所以只要是 Alex 先手，那么每轮都可以压制 Lee，从而必胜。
+
+## 代码
+
+```go
+package leetcode
+
+func stoneGame(piles []int) bool {
+ return true
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0800~0899/0876.Middle-of-the-Linked-List/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0800~0899/0878.Nth-Magical-Number/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0878.Nth-Magical-Number.md b/website/content/ChapterFour/0800~0899/0878.Nth-Magical-Number.md
similarity index 81%
rename from website/content/ChapterFour/0878.Nth-Magical-Number.md
rename to website/content/ChapterFour/0800~0899/0878.Nth-Magical-Number.md
index d78c5ed96..18bad9d0e 100755
--- a/website/content/ChapterFour/0878.Nth-Magical-Number.md
+++ b/website/content/ChapterFour/0800~0899/0878.Nth-Magical-Number.md
@@ -78,4 +78,11 @@ func calNthMagicalCount(num, a, b int64) int64 {
return num/a + num/b - num/ab
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0800~0899/0877.Stone-Game/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0800~0899/0880.Decoded-String-at-Index/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0880.Decoded-String-at-Index.md b/website/content/ChapterFour/0800~0899/0880.Decoded-String-at-Index.md
similarity index 87%
rename from website/content/ChapterFour/0880.Decoded-String-at-Index.md
rename to website/content/ChapterFour/0800~0899/0880.Decoded-String-at-Index.md
index 960564387..08ca3315c 100644
--- a/website/content/ChapterFour/0880.Decoded-String-at-Index.md
+++ b/website/content/ChapterFour/0800~0899/0880.Decoded-String-at-Index.md
@@ -101,4 +101,11 @@ func decodeAtIndex(S string, K int) string {
return ""
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0800~0899/0878.Nth-Magical-Number/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0800~0899/0881.Boats-to-Save-People/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0881.Boats-to-Save-People.md b/website/content/ChapterFour/0800~0899/0881.Boats-to-Save-People.md
similarity index 80%
rename from website/content/ChapterFour/0881.Boats-to-Save-People.md
rename to website/content/ChapterFour/0800~0899/0881.Boats-to-Save-People.md
index 2af2b88d5..ddc07e9f3 100644
--- a/website/content/ChapterFour/0881.Boats-to-Save-People.md
+++ b/website/content/ChapterFour/0800~0899/0881.Boats-to-Save-People.md
@@ -87,4 +87,11 @@ func numRescueBoats(people []int, limit int) int {
return res
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0800~0899/0880.Decoded-String-at-Index/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0800~0899/0884.Uncommon-Words-from-Two-Sentences/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0884.Uncommon-Words-from-Two-Sentences.md b/website/content/ChapterFour/0800~0899/0884.Uncommon-Words-from-Two-Sentences.md
similarity index 81%
rename from website/content/ChapterFour/0884.Uncommon-Words-from-Two-Sentences.md
rename to website/content/ChapterFour/0800~0899/0884.Uncommon-Words-from-Two-Sentences.md
index 66fc23b03..40c260249 100755
--- a/website/content/ChapterFour/0884.Uncommon-Words-from-Two-Sentences.md
+++ b/website/content/ChapterFour/0800~0899/0884.Uncommon-Words-from-Two-Sentences.md
@@ -63,4 +63,11 @@ func uncommonFromSentences(A string, B string) []string {
return res
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0800~0899/0881.Boats-to-Save-People/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0800~0899/0885.Spiral-Matrix-III/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0885.Spiral-Matrix-III.md b/website/content/ChapterFour/0800~0899/0885.Spiral-Matrix-III.md
similarity index 88%
rename from website/content/ChapterFour/0885.Spiral-Matrix-III.md
rename to website/content/ChapterFour/0800~0899/0885.Spiral-Matrix-III.md
index 0a80d2e00..48444a0d4 100755
--- a/website/content/ChapterFour/0885.Spiral-Matrix-III.md
+++ b/website/content/ChapterFour/0800~0899/0885.Spiral-Matrix-III.md
@@ -81,4 +81,11 @@ func spiralMatrixIII(R int, C int, r0 int, c0 int) [][]int {
return res
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0800~0899/0884.Uncommon-Words-from-Two-Sentences/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0800~0899/0887.Super-Egg-Drop/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0800~0899/0887.Super-Egg-Drop.md b/website/content/ChapterFour/0800~0899/0887.Super-Egg-Drop.md
new file mode 100755
index 000000000..1e1672237
--- /dev/null
+++ b/website/content/ChapterFour/0800~0899/0887.Super-Egg-Drop.md
@@ -0,0 +1,152 @@
+# [887. Super Egg Drop](https://leetcode.com/problems/super-egg-drop/)
+
+
+## 题目
+
+You are given `K` eggs, and you have access to a building with `N` floors from `1` to `N`.
+
+Each egg is identical in function, and if an egg breaks, you cannot drop it again.
+
+You know that there exists a floor `F` with `0 <= F <= N` such that any egg dropped at a floor higher than `F` will break, and any egg dropped at or below floor `F` will not break.
+
+Each *move*, you may take an egg (if you have an unbroken one) and drop it from any floor `X` (with `1 <= X <= N`).
+
+Your goal is to know **with certainty** what the value of `F` is.
+
+What is the minimum number of moves that you need to know with certainty what `F` is, regardless of the initial value of `F`?
+
+**Example 1**:
+
+ Input: K = 1, N = 2
+ Output: 2
+ Explanation:
+ Drop the egg from floor 1. If it breaks, we know with certainty that F = 0.
+ Otherwise, drop the egg from floor 2. If it breaks, we know with certainty that F = 1.
+ If it didn't break, then we know with certainty F = 2.
+ Hence, we needed 2 moves in the worst case to know what F is with certainty.
+
+**Example 2**:
+
+ Input: K = 2, N = 6
+ Output: 3
+
+**Example 3**:
+
+ Input: K = 3, N = 14
+ Output: 4
+
+**Note**:
+
+1. `1 <= K <= 100`
+2. `1 <= N <= 10000`
+
+
+## 题目大意
+
+你将获得 K 个鸡蛋，并可以使用一栋从 1 到 N 共有 N 层楼的建筑。每个蛋的功能都是一样的，如果一个蛋碎了，你就不能再把它掉下去。你知道存在楼层 F ，满足 0 <= F <= N 任何从高于 F 的楼层落下的鸡蛋都会碎，从 F 楼层或比它低的楼层落下的鸡蛋都不会破。每次移动，你可以取一个鸡蛋（如果你有完整的鸡蛋）并把它从任一楼层 X 扔下（满足 1 <= X <= N）。你的目标是确切地知道 F 的值是多少。无论 F 的初始值如何，你确定 F 的值的最小移动次数是多少？
+
+
+提示：
+
+1. 1 <= K <= 100
+2. 1 <= N <= 10000
+
+
+## 解题思路
+
+- 给出 `K` 个鸡蛋，`N` 层楼，要求确定安全楼层 `F` 需要最小步数 `t`。
+- 这一题是微软的经典面试题。拿到题最容易想到的是二分搜索。但是仔细分析以后会发现单纯的二分是不对的。不断的二分确实能找到最终安全的楼层，但是这里没有考虑到 `K` 个鸡蛋。鸡蛋数的限制会导致二分搜索无法找到最终楼层。题目要求要在保证能找到最终安全楼层的情况下，找到最小步数。所以单纯的二分搜索并不能解答这道题。
+- 这一题如果按照题意正向考虑，动态规划的状态转移方程是 `searchTime(K, N) = max( searchTime(K-1, X-1), searchTime(K, N-X) )`。其中 `X` 是丢鸡蛋的楼层。随着 `X` 从 `[1,N]`，都能计算出一个 `searchTime` 的值，在所有这 `N` 个值之中，取最小值就是本题的答案了。这个解法可以 AC 这道题。不过这个解法不细展开了。时间复杂度 `O(k*N^2)`。
+{{< katex display >}}
+dp(K,N) = MIN \begin{bmatrix} \, \, MAX(dp(K-1,X-1),dp(K,N-X))\, \, \end{bmatrix} ,1\leqslant x \leqslant N \\
+{{< /katex >}}
+- 换个角度来看这个问题，定义 `dp[k][m]` 代表 `K` 个鸡蛋，`M` 次移动能检查的最大楼层。考虑某一步 `t` 应该在哪一层丢鸡蛋呢？一个正确的选择是在 `dp[k-1][t-1] + 1` 层丢鸡蛋，结果分两种情况：
+ 1. 如果鸡蛋碎了，我们首先排除了该层以上的所有楼层（不管这个楼有多高），而对于剩下的 `dp[k-1][t-1]` 层楼，我们一定能用 `k-1` 个鸡蛋在 `t-1` 步内求解。因此这种情况下，我们总共可以求解无限高的楼层。可见，这是一种非常好的情况，但并不总是发生。
+ 2. 如果鸡蛋没碎，我们首先排除了该层以下的 `dp[k-1][t-1]` 层楼，此时我们还有 `k` 个蛋和 `t-1` 步，那么我们去该层以上的楼层继续测得 `dp[k][t-1]` 层楼。因此这种情况下，我们总共可以求解 `dp[k-1][t-1] + 1 + dp[k][t-1]` 层楼。
+- 在所有 `m` 步中只要有一次出现了第一种情况，那么我们就可以求解无限高的楼层。但题目要求我们能保证一定能找到安全楼层，所以每次丢鸡蛋的情况应该按照最差情况来，即每次都是第二种情况。于是得到转状态转移方程: `dp[k][m] = dp[k-1][m-1] + dp[k][m-1] + 1` 。这个方程可以压缩到一维，因为每个新的状态只和上一行和左一列有关。那么每一行从右往左更新，即 `dp[i] += 1 + dp[i-1]`。时间复杂度 `O(K * log N)`，空间复杂度 `O(N)`。
+- 可能会有人有疑问，如果最初选择不在 `dp[k-1][t-1] + 1` 层丢鸡蛋会怎么样呢？选择在更低的层或者更高的层丢鸡蛋会怎样呢？
+ 1. 如果在更低的楼层丢鸡蛋也能保证找到安全楼层。那么得到的结果一定不是最小步数。因为这次丢鸡蛋没有充分的展现鸡蛋和移动次数的潜力，最终求解一定会有鸡蛋和步数剩余，即不是能探测的最大楼层了。
+ 2. 如果在更高的楼层丢鸡蛋，假设是第 `dp[k-1][t-1] + 2` 层丢鸡蛋，如果这次鸡蛋碎了，剩下 `k-1` 个鸡蛋和 `t-1` 步只能保证验证 `dp[k-1][t-1]` 的楼层，这里还剩**第** `dp[k-1][t-1]+ 1` 的楼层，不能保证最终一定能找到安全楼层了。
+- 用反证法就能得出每一步都应该在第 `dp[k-1][t-1] + 1` 层丢鸡蛋。
+- 这道题还可以用二分搜索来解答。回到上面分析的状态转移方程：`dp[k][m] = dp[k-1][m-1] + dp[k][m-1] + 1` 。用数学方法来解析这个递推关系。令 `f(t,k)` 为 `t` 和 `k` 的函数，题目所要求能测到最大楼层是 `N` 的最小步数，即要求出 `f(t,k) ≥ N` 时候的最小 `t`。由状态转移方程可以知道：`f(t,k) = f(t-1,k) + f(t-1,k-1) + 1`，当 `k = 1` 的时候，对应一个鸡蛋的情况，`f(t,1) = t`，当 `t = 1` 的时候，对应一步的情况，`f(1,k) = 1`。有状态转移方程得：
+{{< katex display >}}
+\begin{aligned} f(t,k) &= 1 + f(t-1,k-1) + f(t-1,k) \\ f(t,k-1) &= 1 + f(t-1,k-2) + f(t-1,k-1) \\ \end{aligned}
+{{< /katex >}}
+ 令 `g(t,k) = f(t,k) - f(t,k-1)`，可以得到：
+{{< katex display >}}
+g(t,k) = g(t-1,k) + g(t-1,k-1)
+{{< /katex >}}
+ 可以知道 `g(t,k)` 是一个杨辉三角，即二项式系数：
+{{< katex display >}}
+g(t,k) = \binom{t}{k+1} = C_{t}^{k+1}
+{{< /katex >}}
+ 利用裂项相消的方法：
+{{< katex display >}}
+\begin{aligned} g(t,x) &= f(t,x) - f(t,x-1) \\ g(t,x-1) &= f(t,x-1) - f(t,x-2) \\ g(t,x-2) &= f(t,x-2) - f(t,x-3) \\ \begin{matrix} .\\ .\\ .\\ \end{matrix}\\ g(t,2) &= f(t,2) - f(t,1) \\ g(t,1) &= f(t,1) - f(t,0) \\ \end{aligned}
+{{< /katex >}}
+ 于是可以得到：
+{{< katex display >}}
+\begin{aligned} f(t,k) &= \sum_{1}^{k}g(t,x) = \sum_{0}^{k} \binom{t}{x} \\ &= C_{t}^{0} + C_{t}^{1} + C_{t}^{2} + ... + C_{t}^{k} \\ \end{aligned}
+{{< /katex >}}
+ 其中：
+{{< katex display >}}
+\begin{aligned} C_{t}^{k} \cdot \frac{n-k}{k+1} &= C_{t}^{k+1} \\ C_{t}^{k} &= C_{t}^{k-1} \cdot \frac{t-k+1}{k} \\ \end{aligned}
+{{< /katex >}}
+ 于是针对每一项的二项式常数，都可以由前一项乘以一个分数得到下一项。
+{{< katex display >}}
+\begin{aligned} C_{t}^{0} &= 1 \\ C_{t}^{1} &= C_{t}^{0} \cdot \frac{t-1+1}{1} \\ C_{t}^{2} &= C_{t}^{1} \cdot \frac{t-2+1}{2} \\ C_{t}^{3} &= C_{t}^{2} \cdot \frac{t-3+1}{3} \\ \begin{matrix} .\\ .\\ .\\ \end{matrix}\\ C_{t}^{k} &= C_{t}^{k-1} \cdot \frac{t-k+1}{k} \\ \end{aligned}
+{{< /katex >}}
+ 利用二分搜索，不断的二分 `t`，直到逼近找到 `f(t,k) ≥ N` 时候最小的 `t`。时间复杂度 `O(K * log N)`，空间复杂度 `O(1)`。
+
+
+
+## 代码
+
+```go
+
+package leetcode
+
+// 解法一 二分搜索
+func superEggDrop(K int, N int) int {
+ low, high := 1, N
+ for low < high {
+ mid := low + (high-low)>>1
+ if counterF(K, N, mid) >= N {
+ high = mid
+ } else {
+ low = mid + 1
+ }
+ }
+ return low
+}
+
+// 计算二项式和，特殊的第一项 C(t,0) = 1
+func counterF(k, n, mid int) int {
+ res, sum := 1, 0
+ for i := 1; i <= k && sum < n; i++ {
+ res *= mid - i + 1
+ res /= i
+ sum += res
+ }
+ return sum
+}
+
+// 解法二 动态规划 DP
+func superEggDrop1(K int, N int) int {
+ dp, step := make([]int, K+1), 0
+ for ; dp[K] < N; step++ {
+ for i := K; i > 0; i-- {
+ dp[i] = (1 + dp[i] + dp[i-1])
+ }
+ }
+ return step
+}
+
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0800~0899/0885.Spiral-Matrix-III/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0800~0899/0888.Fair-Candy-Swap/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0888.Fair-Candy-Swap.md b/website/content/ChapterFour/0800~0899/0888.Fair-Candy-Swap.md
similarity index 89%
rename from website/content/ChapterFour/0888.Fair-Candy-Swap.md
rename to website/content/ChapterFour/0800~0899/0888.Fair-Candy-Swap.md
index 79a2c2bc1..f47316529 100644
--- a/website/content/ChapterFour/0888.Fair-Candy-Swap.md
+++ b/website/content/ChapterFour/0800~0899/0888.Fair-Candy-Swap.md
@@ -107,4 +107,11 @@ func max(a, b int) int {
return b
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0800~0899/0887.Super-Egg-Drop/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0800~0899/0890.Find-and-Replace-Pattern/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0800~0899/0890.Find-and-Replace-Pattern.md b/website/content/ChapterFour/0800~0899/0890.Find-and-Replace-Pattern.md
new file mode 100644
index 000000000..1931ae16a
--- /dev/null
+++ b/website/content/ChapterFour/0800~0899/0890.Find-and-Replace-Pattern.md
@@ -0,0 +1,85 @@
+# [890. Find and Replace Pattern](https://leetcode.com/problems/find-and-replace-pattern/)
+
+
+## 题目
+
+Given a list of strings `words` and a string `pattern`, return *a list of* `words[i]` *that match* `pattern`. You may return the answer in **any order**.
+
+A word matches the pattern if there exists a permutation of letters `p` so that after replacing every letter `x` in the pattern with `p(x)`, we get the desired word.
+
+Recall that a permutation of letters is a bijection from letters to letters: every letter maps to another letter, and no two letters map to the same letter.
+
+**Example 1:**
+
+```
+Input: words = ["abc","deq","mee","aqq","dkd","ccc"], pattern = "abb"
+Output: ["mee","aqq"]
+Explanation: "mee" matches the pattern because there is a permutation {a -> m, b -> e, ...}.
+"ccc" does not match the pattern because {a -> c, b -> c, ...} is not a permutation, since a and b map to the same letter.
+```
+
+**Example 2:**
+
+```
+Input: words = ["a","b","c"], pattern = "a"
+Output: ["a","b","c"]
+```
+
+**Constraints:**
+
+- `1 <= pattern.length <= 20`
+- `1 <= words.length <= 50`
+- `words[i].length == pattern.length`
+- `pattern` and `words[i]` are lowercase English letters.
+
+## 题目大意
+
+你有一个单词列表 words 和一个模式 pattern，你想知道 words 中的哪些单词与模式匹配。如果存在字母的排列 p ，使得将模式中的每个字母 x 替换为 p(x) 之后，我们就得到了所需的单词，那么单词与模式是匹配的。（回想一下，字母的排列是从字母到字母的双射：每个字母映射到另一个字母，没有两个字母映射到同一个字母。）返回 words 中与给定模式匹配的单词列表。你可以按任何顺序返回答案。
+
+## 解题思路
+
+- 按照题目要求，分别映射两个字符串，words 字符串数组中的字符串与 pattern 字符串每个字母做映射。这里用 map 存储。题目还要求不存在 2 个字母映射到同一个字母的情况，所以再增加一个 map，用来判断当前字母是否已经被映射过了。以上 2 个条件都满足即代表模式匹配上了。最终将所有满足模式匹配的字符串输出即可。
+
+## 代码
+
+```go
+package leetcode
+
+func findAndReplacePattern(words []string, pattern string) []string {
+ res := make([]string, 0)
+ for _, word := range words {
+ if match(word, pattern) {
+ res = append(res, word)
+ }
+ }
+ return res
+}
+
+func match(w, p string) bool {
+ if len(w) != len(p) {
+ return false
+ }
+ m, used := make(map[uint8]uint8), make(map[uint8]bool)
+ for i := 0; i < len(w); i++ {
+ if v, ok := m[p[i]]; ok {
+ if w[i] != v {
+ return false
+ }
+ } else {
+ if used[w[i]] {
+ return false
+ }
+ m[p[i]] = w[i]
+ used[w[i]] = true
+ }
+ }
+ return true
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0800~0899/0888.Fair-Candy-Swap/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0800~0899/0891.Sum-of-Subsequence-Widths/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0891.Sum-of-Subsequence-Widths.md b/website/content/ChapterFour/0800~0899/0891.Sum-of-Subsequence-Widths.md
similarity index 86%
rename from website/content/ChapterFour/0891.Sum-of-Subsequence-Widths.md
rename to website/content/ChapterFour/0800~0899/0891.Sum-of-Subsequence-Widths.md
index 9e5f04794..a0baf573d 100644
--- a/website/content/ChapterFour/0891.Sum-of-Subsequence-Widths.md
+++ b/website/content/ChapterFour/0800~0899/0891.Sum-of-Subsequence-Widths.md
@@ -65,4 +65,11 @@ func sumSubseqWidths(A []int) int {
return res
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0800~0899/0890.Find-and-Replace-Pattern/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0800~0899/0892.Surface-Area-of-3D-Shapes/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0892.Surface-Area-of-3D-Shapes.md b/website/content/ChapterFour/0800~0899/0892.Surface-Area-of-3D-Shapes.md
similarity index 82%
rename from website/content/ChapterFour/0892.Surface-Area-of-3D-Shapes.md
rename to website/content/ChapterFour/0800~0899/0892.Surface-Area-of-3D-Shapes.md
index bcb6ad517..9fa02621f 100644
--- a/website/content/ChapterFour/0892.Surface-Area-of-3D-Shapes.md
+++ b/website/content/ChapterFour/0800~0899/0892.Surface-Area-of-3D-Shapes.md
@@ -105,4 +105,11 @@ func min(a, b int) int {
return a
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0800~0899/0891.Sum-of-Subsequence-Widths/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0800~0899/0895.Maximum-Frequency-Stack/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0895.Maximum-Frequency-Stack.md b/website/content/ChapterFour/0800~0899/0895.Maximum-Frequency-Stack.md
similarity index 88%
rename from website/content/ChapterFour/0895.Maximum-Frequency-Stack.md
rename to website/content/ChapterFour/0800~0899/0895.Maximum-Frequency-Stack.md
index bd1c20607..069117500 100644
--- a/website/content/ChapterFour/0895.Maximum-Frequency-Stack.md
+++ b/website/content/ChapterFour/0800~0899/0895.Maximum-Frequency-Stack.md
@@ -110,4 +110,11 @@ func (this *FreqStack) Pop() int {
* param_2 := obj.Pop();
*/
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0800~0899/0892.Surface-Area-of-3D-Shapes/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0800~0899/0896.Monotonic-Array/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0896.Monotonic-Array.md b/website/content/ChapterFour/0800~0899/0896.Monotonic-Array.md
similarity index 80%
rename from website/content/ChapterFour/0896.Monotonic-Array.md
rename to website/content/ChapterFour/0800~0899/0896.Monotonic-Array.md
index afd6b08d4..931017500 100644
--- a/website/content/ChapterFour/0896.Monotonic-Array.md
+++ b/website/content/ChapterFour/0800~0899/0896.Monotonic-Array.md
@@ -96,4 +96,11 @@ func dec(A []int) bool {
return true
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0800~0899/0895.Maximum-Frequency-Stack/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0800~0899/0897.Increasing-Order-Search-Tree/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0897.Increasing-Order-Search-Tree.md b/website/content/ChapterFour/0800~0899/0897.Increasing-Order-Search-Tree.md
similarity index 89%
rename from website/content/ChapterFour/0897.Increasing-Order-Search-Tree.md
rename to website/content/ChapterFour/0800~0899/0897.Increasing-Order-Search-Tree.md
index 44076d305..cfac7507d 100755
--- a/website/content/ChapterFour/0897.Increasing-Order-Search-Tree.md
+++ b/website/content/ChapterFour/0800~0899/0897.Increasing-Order-Search-Tree.md
@@ -120,4 +120,11 @@ func inorder(root *TreeNode, output *[]int) {
}
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0800~0899/0896.Monotonic-Array/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0800~0899/0898.Bitwise-ORs-of-Subarrays/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0898.Bitwise-ORs-of-Subarrays.md b/website/content/ChapterFour/0800~0899/0898.Bitwise-ORs-of-Subarrays.md
similarity index 90%
rename from website/content/ChapterFour/0898.Bitwise-ORs-of-Subarrays.md
rename to website/content/ChapterFour/0800~0899/0898.Bitwise-ORs-of-Subarrays.md
index 259871f11..bf494c573 100755
--- a/website/content/ChapterFour/0898.Bitwise-ORs-of-Subarrays.md
+++ b/website/content/ChapterFour/0800~0899/0898.Bitwise-ORs-of-Subarrays.md
@@ -140,4 +140,11 @@ func subarrayBitwiseORs1(A []int) int {
return len(res)
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0800~0899/0897.Increasing-Order-Search-Tree/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0900~0999/0901.Online-Stock-Span/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0800~0899/_index.md b/website/content/ChapterFour/0800~0899/_index.md
new file mode 100644
index 000000000..d2021683f
--- /dev/null
+++ b/website/content/ChapterFour/0800~0899/_index.md
@@ -0,0 +1,5 @@
+---
+bookCollapseSection: true
+weight: 20
+---
+
diff --git a/website/content/ChapterFour/0828.COPYRIGHT-PROBLEM-XXX.md b/website/content/ChapterFour/0828.COPYRIGHT-PROBLEM-XXX.md
deleted file mode 100644
index 49ebc4c03..000000000
--- a/website/content/ChapterFour/0828.COPYRIGHT-PROBLEM-XXX.md
+++ /dev/null
@@ -1,80 +0,0 @@
-# [828. Unique Letter String](https://leetcode.com/problems/unique-letter-string/)
-
-## 题目
-
-THIS PROBLEM COPYRIGHT BELONGS TO CODILITY.COM
-
-**Example 1**:
-
-
-
-**Example 2**:
-
-
-
-## 题目大意
-
-如果一个字符在字符串 S 中有且仅有出现一次，那么我们称其为独特字符。例如，在字符串 S = "LETTER" 中，"L" 和 "R" 可以被称为独特字符。我们再定义 UNIQ(S) 作为字符串 S 中独特字符的个数。那么，在 S = "LETTER" 中， UNIQ("LETTER") = 2。
-
-对于给定字符串 S，计算其所有非空子串的独特字符的个数（即 UNIQ(substring)）之和。如果在 S 的不同位置上出现两个甚至多个相同的子串，那么我们认为这些子串是不同的。考虑到答案可能会非常大，规定返回格式为：结果 mod 10 ^ 9 + 7。
-
-
-## 解题思路
-
-- 这一题可以先用暴力解法尝试解题，不过提交以后会发现判题结果是超时。出错的一组数据是一个有 10000 个字符的字符串。暴力解法中间由于遍历了太多的子区间，导致了超时。
-- 这道题换一个角度思考问题。当子字符串中字符 X 出现了 2 次以上，那么它就对最终结果没有任何影响，所以只有当某个字符只出现一次的时候才会影响最终结果。再者，一个子字符串中不重复的字符的总个数，也就是这个子字符串 UNIQ 值。例如，“ABC”，这个子字符串的 UNIQ 值是 3，可以这样计算，它属于 A 的独特的字符串，也属于 B 的独特的字符串，也属于 C 的独特的字符串，那么计算这个子字符串的问题可以分解成计算 A 有多少个独特的子字符串，B 有多少个独特的子字符串，C 有多少个独特的子字符串的问题。在计算 A 有多少个子字符串的问题的时候，里面肯定会包含 "ABC" 这个子字符串的。所以原问题就转换成了分别计算给出的字符串中每个字符出现在独特字符串中的总数之和。
-- 假设原字符串是 BAABBABBBAAABA，这个字符串中出现了很多 A 和很多 B，假设我们当前计算到了第 3 个 A 的位置了(index = 5)，即标红色的那个 A。如何计算这个 A 在哪些子字符串中是独特的呢？由于子字符串题目中要求必须是连续的区间，所以这个问题很简单。找到这个 A 前一个 A 的下标位置(index = 2)，再找到这个 A 后一个 A 的下标位置(index = 9)，即 BAABBABBBAAABA，第一个 A 和当前计算的 A 中间区间有 2 个字符，第三个 A 和当前计算的 A 中间有 3 个字符。那么当前计算的 A 出现在 `(2 + 1) * (3 + 1) = 12` 个子字符串中是独特的，这 12 个字符串是：`A`，`BA`，`BBA`，`AB`，`ABB`，`ABBB`，`BAB`，`BABB`，`BABBB`，`BBAB`，`BBABB`，`BBABBB`。计算方法，假设当前待计算的字符的下标是 i ，找到当前字符前一次出现的下标位置 left，再找到当前字符后一次出现的下标位置 right，那么左边区间 (left,i) 的**开区间**内包含的字符数是 i - left - 1，右边区间 (i,right) 的**开区间**内包含的字符数是 right - i - 1。左右两边都还需要考虑空字符串的情况，即左右两边都可以不取任何字符，那么对应的就是只有中间这个待计算的字符 `A`。所以左右两边都还需要再加上空串的情况，左边 i - left - 1 + 1 = i - left，右边 right - i - 1 + 1 = right - i。左右两边的情况进行排列组合，即 (i - left) * (right - i)。针对字符串的每个字符都计算这样的值，最后累积的总和就是题目中要求的总 UNIQ 值。
-
-
-
-
-## 代码
-
-```go
-
-package leetcode
-
-func uniqueLetterString(S string) int {
- res, left, right := 0, 0, 0
- for i := 0; i < len(S); i++ {
- left = i - 1
- for left >= 0 && S[left] != S[i] {
- left--
- }
- right = i + 1
- for right < len(S) && S[right] != S[i] {
- right++
- }
- res += (i - left) * (right - i)
- }
- return res % 1000000007
-}
-
-// 暴力解法，超时！时间复杂度 O(n^2)
-func uniqueLetterString1(S string) int {
- if len(S) == 0 {
- return 0
- }
- res, mod := 0, 1000000007
- for i := 0; i < len(S); i++ {
- letterMap := map[byte]int{}
- for j := i; j < len(S); j++ {
- letterMap[S[j]]++
- tmp := 0
- for _, v := range letterMap {
- if v > 1 {
- tmp++
- }
- }
- if tmp == len(letterMap) {
- continue
- } else {
- res += len(letterMap) - tmp
- }
- }
- }
- return res % mod
-}
-
-
-```
\ No newline at end of file
diff --git a/website/content/ChapterFour/0867.Transpose-Matrix.md b/website/content/ChapterFour/0867.Transpose-Matrix.md
deleted file mode 100755
index 379b9b25b..000000000
--- a/website/content/ChapterFour/0867.Transpose-Matrix.md
+++ /dev/null
@@ -1,57 +0,0 @@
-# [867. Transpose Matrix](https://leetcode.com/problems/transpose-matrix/)
-
-
-## 题目
-
-Given a matrix `A`, return the transpose of `A`.
-
-The transpose of a matrix is the matrix flipped over it's main diagonal, switching the row and column indices of the matrix.
-
-**Example 1**:
-
- Input: [[1,2,3],[4,5,6],[7,8,9]]
- Output: [[1,4,7],[2,5,8],[3,6,9]]
-
-**Example 2**:
-
- Input: [[1,2,3],[4,5,6]]
- Output: [[1,4],[2,5],[3,6]]
-
-**Note**:
-
-1. `1 <= A.length <= 1000`
-2. `1 <= A[0].length <= 1000`
-
-
-## 题目大意
-
-给定一个矩阵 A， 返回 A 的转置矩阵。矩阵的转置是指将矩阵的主对角线翻转，交换矩阵的行索引与列索引。
-
-
-## 解题思路
-
-
-- 给出一个矩阵，顺时针旋转 90°
-- 解题思路很简单，直接模拟即可。
-
-
-## 代码
-
-```go
-
-package leetcode
-
-func transpose(A [][]int) [][]int {
- row, col, result := len(A), len(A[0]), make([][]int, len(A[0]))
- for i := range result {
- result[i] = make([]int, row)
- }
- for i := 0; i < row; i++ {
- for j := 0; j < col; j++ {
- result[j][i] = A[i][j]
- }
- }
- return result
-}
-
-```
\ No newline at end of file
diff --git a/website/content/ChapterFour/0887.Super-Egg-Drop.md b/website/content/ChapterFour/0887.Super-Egg-Drop.md
deleted file mode 100755
index a79b60859..000000000
--- a/website/content/ChapterFour/0887.Super-Egg-Drop.md
+++ /dev/null
@@ -1,155 +0,0 @@
-# [887. Super Egg Drop](https://leetcode.com/problems/super-egg-drop/)
-
-
-## 题目
-
-You are given `K` eggs, and you have access to a building with `N` floors from `1` to `N`.
-
-Each egg is identical in function, and if an egg breaks, you cannot drop it again.
-
-You know that there exists a floor `F` with `0 <= F <= N` such that any egg dropped at a floor higher than `F` will break, and any egg dropped at or below floor `F` will not break.
-
-Each *move*, you may take an egg (if you have an unbroken one) and drop it from any floor `X` (with `1 <= X <= N`).
-
-Your goal is to know **with certainty** what the value of `F` is.
-
-What is the minimum number of moves that you need to know with certainty what `F` is, regardless of the initial value of `F`?
-
-**Example 1**:
-
- Input: K = 1, N = 2
- Output: 2
- Explanation:
- Drop the egg from floor 1. If it breaks, we know with certainty that F = 0.
- Otherwise, drop the egg from floor 2. If it breaks, we know with certainty that F = 1.
- If it didn't break, then we know with certainty F = 2.
- Hence, we needed 2 moves in the worst case to know what F is with certainty.
-
-**Example 2**:
-
- Input: K = 2, N = 6
- Output: 3
-
-**Example 3**:
-
- Input: K = 3, N = 14
- Output: 4
-
-**Note**:
-
-1. `1 <= K <= 100`
-2. `1 <= N <= 10000`
-
-
-## 题目大意
-
-你将获得 K 个鸡蛋，并可以使用一栋从 1 到 N 共有 N 层楼的建筑。每个蛋的功能都是一样的，如果一个蛋碎了，你就不能再把它掉下去。你知道存在楼层 F ，满足 0 <= F <= N 任何从高于 F 的楼层落下的鸡蛋都会碎，从 F 楼层或比它低的楼层落下的鸡蛋都不会破。每次移动，你可以取一个鸡蛋（如果你有完整的鸡蛋）并把它从任一楼层 X 扔下（满足 1 <= X <= N）。你的目标是确切地知道 F 的值是多少。无论 F 的初始值如何，你确定 F 的值的最小移动次数是多少？
-
-
-提示：
-
-1. 1 <= K <= 100
-2. 1 <= N <= 10000
-
-
-## 解题思路
-
-- 给出 `K` 个鸡蛋，`N` 层楼，要求确定安全楼层 `F` 需要最小步数 `t`。
-- 这一题是微软的经典面试题。拿到题最容易想到的是二分搜索。但是仔细分析以后会发现单纯的二分是不对的。不断的二分确实能找到最终安全的楼层，但是这里没有考虑到 `K` 个鸡蛋。鸡蛋数的限制会导致二分搜索无法找到最终楼层。题目要求要在保证能找到最终安全楼层的情况下，找到最小步数。所以单纯的二分搜索并不能解答这道题。
-- 这一题如果按照题意正向考虑，动态规划的状态转移方程是 `searchTime(K, N) = max( searchTime(K-1, X-1), searchTime(K, N-X) )`。其中 `X` 是丢鸡蛋的楼层。随着 `X` 从 `[1,N]`，都能计算出一个 `searchTime` 的值，在所有这 `N` 个值之中，取最小值就是本题的答案了。这个解法可以 AC 这道题。不过这个解法不细展开了。时间复杂度 `O(k*N^2)`。
-<p align='center'>
-<img src='https://img.halfrost.com/Leetcode/leetcode_887_8.png'>
-</p>
-
-- 换个角度来看这个问题，定义 `dp[k][m]` 代表 `K` 个鸡蛋，`M` 次移动能检查的最大楼层。考虑某一步 `t` 应该在哪一层丢鸡蛋呢？一个正确的选择是在 `dp[k-1][t-1] + 1` 层丢鸡蛋，结果分两种情况：
- 1. 如果鸡蛋碎了，我们首先排除了该层以上的所有楼层（不管这个楼有多高），而对于剩下的 `dp[k-1][t-1]` 层楼，我们一定能用 `k-1` 个鸡蛋在 `t-1` 步内求解。因此这种情况下，我们总共可以求解无限高的楼层。可见，这是一种非常好的情况，但并不总是发生。
- 2. 如果鸡蛋没碎，我们首先排除了该层以下的 `dp[k-1][t-1]` 层楼，此时我们还有 `k` 个蛋和 `t-1` 步，那么我们去该层以上的楼层继续测得 `dp[k][t-1]` 层楼。因此这种情况下，我们总共可以求解 `dp[k-1][t-1] + 1 + dp[k][t-1]` 层楼。
-- 在所有 `m` 步中只要有一次出现了第一种情况，那么我们就可以求解无限高的楼层。但题目要求我们能保证一定能找到安全楼层，所以每次丢鸡蛋的情况应该按照最差情况来，即每次都是第二种情况。于是得到转状态转移方程: `dp[k][m] = dp[k-1][m-1] + dp[k][m-1] + 1` 。这个方程可以压缩到一维，因为每个新的状态只和上一行和左一列有关。那么每一行从右往左更新，即 `dp[i] += 1 + dp[i-1]`。时间复杂度 `O(K * log N)`，空间复杂度 `O(N)`。
-- 可能会有人有疑问，如果最初选择不在 `dp[k-1][t-1] + 1` 层丢鸡蛋会怎么样呢？选择在更低的层或者更高的层丢鸡蛋会怎样呢？
- 1. 如果在更低的楼层丢鸡蛋也能保证找到安全楼层。那么得到的结果一定不是最小步数。因为这次丢鸡蛋没有充分的展现鸡蛋和移动次数的潜力，最终求解一定会有鸡蛋和步数剩余，即不是能探测的最大楼层了。
- 2. 如果在更高的楼层丢鸡蛋，假设是第 `dp[k-1][t-1] + 2` 层丢鸡蛋，如果这次鸡蛋碎了，剩下 `k-1` 个鸡蛋和 `t-1` 步只能保证验证 `dp[k-1][t-1]` 的楼层，这里还剩**第** `dp[k-1][t-1]+ 1` 的楼层，不能保证最终一定能找到安全楼层了。
-- 用反证法就能得出每一步都应该在第 `dp[k-1][t-1] + 1` 层丢鸡蛋。
-- 这道题还可以用二分搜索来解答。回到上面分析的状态转移方程：`dp[k][m] = dp[k-1][m-1] + dp[k][m-1] + 1` 。用数学方法来解析这个递推关系。令 `f(t,k)` 为 `t` 和 `k` 的函数，题目所要求能测到最大楼层是 `N` 的最小步数，即要求出 `f(t,k) ≥ N` 时候的最小 `t`。由状态转移方程可以知道：`f(t,k) = f(t-1,k) + f(t-1,k-1) + 1`，当 `k = 1` 的时候，对应一个鸡蛋的情况，`f(t,1) = t`，当 `t = 1` 的时候，对应一步的情况，`f(1,k) = 1`。有状态转移方程得：
-<p align='center'>
-<img src='https://img.halfrost.com/Leetcode/leetcode_887_1.png'>
-</p>
-
-- 令 `g(t,k) = f(t,k) - f(t,k-1)`，可以得到：
-
-<p align='center'>
-<img src='https://img.halfrost.com/Leetcode/leetcode_887_2.png'>
-</p>
-
-- 可以知道 `g(t,k)` 是一个杨辉三角，即二项式系数：
-
-<p align='center'>
-<img src='https://img.halfrost.com/Leetcode/leetcode_887_3.png'>
-</p>
-
-- 利用裂项相消的方法：
-<p align='center'>
-<img src='https://img.halfrost.com/Leetcode/leetcode_887_4.png'>
-</p>
-
-- 于是可以得到：
-<p align='center'>
-<img src='https://img.halfrost.com/Leetcode/leetcode_887_5.png'>
-</p>
-
-- 其中：
-<p align='center'>
-<img src='https://img.halfrost.com/Leetcode/leetcode_887_6.png'>
-</p>
-
-- 于是针对每一项的二项式常数，都可以由前一项乘以一个分数得到下一项。
-<p align='center'>
-<img src='https://img.halfrost.com/Leetcode/leetcode_887_7.png'>
-</p>
-
-- 利用二分搜索，不断的二分 `t`，直到逼近找到 `f(t,k) ≥ N` 时候最小的 `t`。时间复杂度 `O(K * log N)`，空间复杂度 `O(1)`。
-
-
-
-## 代码
-
-```go
-
-package leetcode
-
-// 解法一 二分搜索
-func superEggDrop(K int, N int) int {
- low, high := 1, N
- for low < high {
- mid := low + (high-low)>>1
- if counterF(K, N, mid) >= N {
- high = mid
- } else {
- low = mid + 1
- }
- }
- return low
-}
-
-// 计算二项式和，特殊的第一项 C(t,0) = 1
-func counterF(k, n, mid int) int {
- res, sum := 1, 0
- for i := 1; i <= k && sum < n; i++ {
- res *= mid - i + 1
- res /= i
- sum += res
- }
- return sum
-}
-
-// 解法二 动态规划 DP
-func superEggDrop1(K int, N int) int {
- dp, step := make([]int, K+1), 0
- for ; dp[K] < N; step++ {
- for i := K; i > 0; i-- {
- dp[i] = (1 + dp[i] + dp[i-1])
- }
- }
- return step
-}
-
-```
\ No newline at end of file
diff --git a/website/content/ChapterFour/0901.Online-Stock-Span.md b/website/content/ChapterFour/0900~0999/0901.Online-Stock-Span.md
similarity index 85%
rename from website/content/ChapterFour/0901.Online-Stock-Span.md
rename to website/content/ChapterFour/0900~0999/0901.Online-Stock-Span.md
index 582fa43f5..1ba0fcd96 100644
--- a/website/content/ChapterFour/0901.Online-Stock-Span.md
+++ b/website/content/ChapterFour/0900~0999/0901.Online-Stock-Span.md
@@ -57,10 +57,10 @@ Note that (for example) S.next(75) returned 4, because the last 4 prices
单调栈类似的题
496. Next Greater Element I
-497. Next Greater Element II
-498. Daily Temperatures
-499. Sum of Subarray Minimums
-500. Largest Rectangle in Histogram
+503. Next Greater Element II
+739. Daily Temperatures
+907. Sum of Subarray Minimums
+84. Largest Rectangle in Histogram
## 代码
@@ -108,4 +108,11 @@ func (this *StockSpanner) Next(price int) int {
* param_1 := obj.Next(price);
*/
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0800~0899/0898.Bitwise-ORs-of-Subarrays/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0900~0999/0904.Fruit-Into-Baskets/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0904.Fruit-Into-Baskets.md b/website/content/ChapterFour/0900~0999/0904.Fruit-Into-Baskets.md
similarity index 88%
rename from website/content/ChapterFour/0904.Fruit-Into-Baskets.md
rename to website/content/ChapterFour/0900~0999/0904.Fruit-Into-Baskets.md
index c3786ae76..7f155d1b3 100644
--- a/website/content/ChapterFour/0904.Fruit-Into-Baskets.md
+++ b/website/content/ChapterFour/0900~0999/0904.Fruit-Into-Baskets.md
@@ -112,4 +112,11 @@ func totalFruit(tree []int) int {
return res
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0900~0999/0901.Online-Stock-Span/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0900~0999/0907.Sum-of-Subarray-Minimums/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0907.Sum-of-Subarray-Minimums.md b/website/content/ChapterFour/0900~0999/0907.Sum-of-Subarray-Minimums.md
similarity index 94%
rename from website/content/ChapterFour/0907.Sum-of-Subarray-Minimums.md
rename to website/content/ChapterFour/0900~0999/0907.Sum-of-Subarray-Minimums.md
index 7c5374d43..1fd0096d1 100644
--- a/website/content/ChapterFour/0907.Sum-of-Subarray-Minimums.md
+++ b/website/content/ChapterFour/0900~0999/0907.Sum-of-Subarray-Minimums.md
@@ -121,4 +121,11 @@ func sumSubarrayMins2(A []int) int {
return res % mod
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0900~0999/0904.Fruit-Into-Baskets/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0900~0999/0909.Snakes-and-Ladders/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0900~0999/0909.Snakes-and-Ladders.md b/website/content/ChapterFour/0900~0999/0909.Snakes-and-Ladders.md
new file mode 100644
index 000000000..ebba1cb5d
--- /dev/null
+++ b/website/content/ChapterFour/0900~0999/0909.Snakes-and-Ladders.md
@@ -0,0 +1,117 @@
+# [909. Snakes and Ladders](https://leetcode.com/problems/snakes-and-ladders/)
+
+
+## 题目
+
+On an N x N `board`, the numbers from `1` to `N*N` are written *boustrophedonically* **starting from the bottom left of the board**, and alternating direction each row. For example, for a 6 x 6 board, the numbers are written as follows:
+
+
+
+
+You start on square `1` of the board (which is always in the last row and first column). Each move, starting from square `x`, consists of the following:
+
+- You choose a destination square `S` with number `x+1`, `x+2`, `x+3`, `x+4`, `x+5`, or `x+6`, provided this number is `<= N*N`.
+ - (This choice simulates the result of a standard 6-sided die roll: ie., there are always **at most 6 destinations, regardless of the size of the board**.)
+- If `S` has a snake or ladder, you move to the destination of that snake or ladder. Otherwise, you move to `S`.
+
+A board square on row `r` and column `c` has a "snake or ladder" if `board[r][c] != -1`. The destination of that snake or ladder is `board[r][c]`.
+
+Note that you only take a snake or ladder at most once per move: if the destination to a snake or ladder is the start of another snake or ladder, you do **not** continue moving. (For example, if the board is `[[4,-1],[-1,3]]`, and on the first move your destination square is `2`, then you finish your first move at `3`, because you do **not** continue moving to `4`.)
+
+Return the least number of moves required to reach square N*N. If it is not possible, return `-1`.
+
+**Example 1:**
+
+```
+Input:[
+[-1,-1,-1,-1,-1,-1],
+[-1,-1,-1,-1,-1,-1],
+[-1,-1,-1,-1,-1,-1],
+[-1,35,-1,-1,13,-1],
+[-1,-1,-1,-1,-1,-1],
+[-1,15,-1,-1,-1,-1]]
+Output:4
+Explanation:
+At the beginning, you start at square 1 [at row 5, column 0].
+You decide to move to square 2, and must take the ladder to square 15.
+You then decide to move to square 17 (row 3, column 5), and must take the snake to square 13.
+You then decide to move to square 14, and must take the ladder to square 35.
+You then decide to move to square 36, ending the game.
+It can be shown that you need at least 4 moves to reach the N*N-th square, so the answer is 4.
+
+```
+
+**Note:**
+
+1. `2 <= board.length = board[0].length <= 20`
+2. `board[i][j]` is between `1` and `N*N` or is equal to `1`.
+3. The board square with number `1` has no snake or ladder.
+4. The board square with number `N*N` has no snake or ladder.
+
+## 题目大意
+
+N x N 的棋盘 board 上，按从 1 到 N*N 的数字给方格编号，编号 从左下角开始，每一行交替方向。r 行 c 列的棋盘，按前述方法编号，棋盘格中可能存在 “蛇” 或 “梯子”；如果 board[r][c] != -1，那个蛇或梯子的目的地将会是 board[r][c]。玩家从棋盘上的方格 1 （总是在最后一行、第一列）开始出发。每一回合，玩家需要从当前方格 x 开始出发，按下述要求前进：选定目标方格：
+
+- 选择从编号 x+1，x+2，x+3，x+4，x+5，或者 x+6 的方格中选出一个目标方格 s ，目标方格的编号 <= N*N。该选择模拟了掷骰子的情景，无论棋盘大小如何，你的目的地范围也只能处于区间 [x+1, x+6] 之间。
+- 传送玩家：如果目标方格 S 处存在蛇或梯子，那么玩家会传送到蛇或梯子的目的地。否则，玩家传送到目标方格 S。
+
+注意，玩家在每回合的前进过程中最多只能爬过蛇或梯子一次：就算目的地是另一条蛇或梯子的起点，你也不会继续移动。返回达到方格 N*N 所需的最少移动次数，如果不可能，则返回 -1。
+
+## 解题思路
+
+- 这一题可以抽象为在有向图上求下标 1 的起点到下标 `N^2` 的终点的最短路径。用广度优先搜索。棋盘可以抽象成一个包含 `N^2` 个节点的有向图，对于每个节点 `x`，若 `x+i (1 ≤ i ≤ 6)` 上没有蛇或梯子，则连一条从 `x` 到 `x+i` 的有向边；否则记蛇梯的目的地为 `y`，连一条从 `x` 到 `y` 的有向边。然后按照最短路径的求解方式便可解题。时间复杂度 O(n^2)，空间复杂度 O(n^2)。
+- 此题棋盘上的下标是蛇形的，所以遍历下一个点的时候需要转换坐标。具体做法根据行的奇偶性，行号为偶数，下标从左往右，行号为奇数，下标从右往左。具体实现见 `getRowCol()` 函数。
+
+## 代码
+
+```go
+package leetcode
+
+type pair struct {
+ id, step int
+}
+
+func snakesAndLadders(board [][]int) int {
+ n := len(board)
+ visited := make([]bool, n*n+1)
+ queue := []pair{{1, 0}}
+ for len(queue) > 0 {
+ p := queue[0]
+ queue = queue[1:]
+ for i := 1; i <= 6; i++ {
+ nxt := p.id + i
+ if nxt > n*n { // 超出边界
+ break
+ }
+ r, c := getRowCol(nxt, n) // 得到下一步的行列
+ if board[r][c] > 0 { // 存在蛇或梯子
+ nxt = board[r][c]
+ }
+ if nxt == n*n { // 到达终点
+ return p.step + 1
+ }
+ if !visited[nxt] {
+ visited[nxt] = true
+ queue = append(queue, pair{nxt, p.step + 1}) // 扩展新状态
+ }
+ }
+ }
+ return -1
+}
+
+func getRowCol(id, n int) (r, c int) {
+ r, c = (id-1)/n, (id-1)%n
+ if r%2 == 1 {
+ c = n - 1 - c
+ }
+ r = n - 1 - r
+ return r, c
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0900~0999/0907.Sum-of-Subarray-Minimums/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0900~0999/0910.Smallest-Range-II/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0900~0999/0910.Smallest-Range-II.md b/website/content/ChapterFour/0900~0999/0910.Smallest-Range-II.md
new file mode 100644
index 000000000..1f9f33035
--- /dev/null
+++ b/website/content/ChapterFour/0900~0999/0910.Smallest-Range-II.md
@@ -0,0 +1,89 @@
+# [910. Smallest Range II](https://leetcode.com/problems/smallest-range-ii/)
+
+## 题目
+
+Given an array `A` of integers, for each integer `A[i]` we need to choose **either `x = -K` or `x = K`**, and add `x` to `A[i]` **(only once)**.
+
+After this process, we have some array `B`.
+
+Return the smallest possible difference between the maximum value of `B` and the minimum value of `B`.
+
+**Example 1**:
+
+```
+Input: A = [1], K = 0
+Output: 0
+Explanation: B = [1]
+```
+
+**Example 2**:
+
+```
+Input: A = [0,10], K = 2
+Output: 6
+Explanation: B = [2,8]
+```
+
+**Example 3**:
+
+```
+Input: A = [1,3,6], K = 3
+Output: 3
+Explanation: B = [4,6,3]
+```
+
+**Note**:
+
+1. `1 <= A.length <= 10000`
+2. `0 <= A[i] <= 10000`
+3. `0 <= K <= 10000`
+
+## 题目大意
+
+给你一个整数数组 A，对于每个整数 A[i]，可以选择 x = -K 或是 x = K （K 总是非负整数），并将 x 加到 A[i] 中。在此过程之后，得到数组 B。返回 B 的最大值和 B 的最小值之间可能存在的最小差值。
+
+## 解题思路
+
+- 简单题。先排序，找出 A 数组中最大的差值。然后循环扫一遍数组，利用双指针，选择 x = -K 或是 x = K ，每次选择都更新一次最大值和最小值之间的最小差值。循环一次以后便可以找到满足题意的答案。
+
+## 代码
+
+```go
+package leetcode
+
+import "sort"
+
+func smallestRangeII(A []int, K int) int {
+ n := len(A)
+ sort.Ints(A)
+ res := A[n-1] - A[0]
+ for i := 0; i < n-1; i++ {
+ a, b := A[i], A[i+1]
+ high := max(A[n-1]-K, a+K)
+ low := min(A[0]+K, b-K)
+ res = min(res, high-low)
+ }
+ return res
+}
+
+func max(a, b int) int {
+ if a > b {
+ return a
+ }
+ return b
+}
+
+func min(a, b int) int {
+ if a < b {
+ return a
+ }
+ return b
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0900~0999/0909.Snakes-and-Ladders/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0900~0999/0911.Online-Election/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0911.Online-Election.md b/website/content/ChapterFour/0900~0999/0911.Online-Election.md
similarity index 89%
rename from website/content/ChapterFour/0911.Online-Election.md
rename to website/content/ChapterFour/0900~0999/0911.Online-Election.md
index 63a73bb66..a00cd7365 100755
--- a/website/content/ChapterFour/0911.Online-Election.md
+++ b/website/content/ChapterFour/0900~0999/0911.Online-Election.md
@@ -96,4 +96,11 @@ func (tvc *TopVotedCandidate) Q(t int) int {
* param_1 := obj.Q(t);
*/
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0900~0999/0910.Smallest-Range-II/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0900~0999/0914.X-of-a-Kind-in-a-Deck-of-Cards/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0914.X-of-a-Kind-in-a-Deck-of-Cards.md b/website/content/ChapterFour/0900~0999/0914.X-of-a-Kind-in-a-Deck-of-Cards.md
similarity index 86%
rename from website/content/ChapterFour/0914.X-of-a-Kind-in-a-Deck-of-Cards.md
rename to website/content/ChapterFour/0900~0999/0914.X-of-a-Kind-in-a-Deck-of-Cards.md
index 02c8ebddd..f8cac7562 100644
--- a/website/content/ChapterFour/0914.X-of-a-Kind-in-a-Deck-of-Cards.md
+++ b/website/content/ChapterFour/0900~0999/0914.X-of-a-Kind-in-a-Deck-of-Cards.md
@@ -102,4 +102,11 @@ func gcd(a, b int) int {
return gcd(b%a, a)
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0900~0999/0911.Online-Election/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0900~0999/0916.Word-Subsets/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0900~0999/0916.Word-Subsets.md b/website/content/ChapterFour/0900~0999/0916.Word-Subsets.md
new file mode 100644
index 000000000..8e54db5cb
--- /dev/null
+++ b/website/content/ChapterFour/0900~0999/0916.Word-Subsets.md
@@ -0,0 +1,110 @@
+# [916. Word Subsets](https://leetcode.com/problems/word-subsets/)
+
+
+## 题目
+
+We are given two arrays `A` and `B` of words. Each word is a string of lowercase letters.
+
+Now, say that word `b` is a subset of word `a` ****if every letter in `b` occurs in `a`, **including multiplicity**. For example, `"wrr"` is a subset of `"warrior"`, but is not a subset of `"world"`.
+
+Now say a word `a` from `A` is *universal* if for every `b` in `B`, `b` is a subset of `a`.
+
+Return a list of all universal words in `A`. You can return the words in any order.
+
+**Example 1:**
+
+```
+Input:A = ["amazon","apple","facebook","google","leetcode"], B = ["e","o"]
+Output:["facebook","google","leetcode"]
+```
+
+**Example 2:**
+
+```
+Input:A = ["amazon","apple","facebook","google","leetcode"], B = ["l","e"]
+Output:["apple","google","leetcode"]
+```
+
+**Example 3:**
+
+```
+Input:A = ["amazon","apple","facebook","google","leetcode"], B = ["e","oo"]
+Output:["facebook","google"]
+```
+
+**Example 4:**
+
+```
+Input:A = ["amazon","apple","facebook","google","leetcode"], B = ["lo","eo"]
+Output:["google","leetcode"]
+```
+
+**Example 5:**
+
+```
+Input:A = ["amazon","apple","facebook","google","leetcode"], B = ["ec","oc","ceo"]
+Output:["facebook","leetcode"]
+```
+
+**Note:**
+
+1. `1 <= A.length, B.length <= 10000`
+2. `1 <= A[i].length, B[i].length <= 10`
+3. `A[i]` and `B[i]` consist only of lowercase letters.
+4. All words in `A[i]` are unique: there isn't `i != j` with `A[i] == A[j]`.
+
+## 题目大意
+
+我们给出两个单词数组 A 和 B。每个单词都是一串小写字母。现在，如果 b 中的每个字母都出现在 a 中，包括重复出现的字母，那么称单词 b 是单词 a 的子集。 例如，“wrr” 是 “warrior” 的子集，但不是 “world” 的子集。如果对 B 中的每一个单词 b，b 都是 a 的子集，那么我们称 A 中的单词 a 是通用的。你可以按任意顺序以列表形式返回 A 中所有的通用单词。
+
+## 解题思路
+
+- 简单题。先统计出 B 数组中单词每个字母的频次，再在 A 数组中依次判断每个单词是否超过了这个频次，如果超过了即输出。
+
+## 代码
+
+```go
+package leetcode
+
+func wordSubsets(A []string, B []string) []string {
+ var counter [26]int
+ for _, b := range B {
+ var m [26]int
+ for _, c := range b {
+ j := c - 'a'
+ m[j]++
+ }
+ for i := 0; i < 26; i++ {
+ if m[i] > counter[i] {
+ counter[i] = m[i]
+ }
+ }
+ }
+ var res []string
+ for _, a := range A {
+ var m [26]int
+ for _, c := range a {
+ j := c - 'a'
+ m[j]++
+ }
+ ok := true
+ for i := 0; i < 26; i++ {
+ if m[i] < counter[i] {
+ ok = false
+ break
+ }
+ }
+ if ok {
+ res = append(res, a)
+ }
+ }
+ return res
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0900~0999/0914.X-of-a-Kind-in-a-Deck-of-Cards/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0900~0999/0918.Maximum-Sum-Circular-Subarray/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0918.Maximum-Sum-Circular-Subarray.md b/website/content/ChapterFour/0900~0999/0918.Maximum-Sum-Circular-Subarray.md
similarity index 78%
rename from website/content/ChapterFour/0918.Maximum-Sum-Circular-Subarray.md
rename to website/content/ChapterFour/0900~0999/0918.Maximum-Sum-Circular-Subarray.md
index 1b60e16e3..955a68679 100755
--- a/website/content/ChapterFour/0918.Maximum-Sum-Circular-Subarray.md
+++ b/website/content/ChapterFour/0900~0999/0918.Maximum-Sum-Circular-Subarray.md
@@ -73,29 +73,60 @@ package leetcode
import "math"
-func maxSubarraySumCircular(A []int) int {
- n, sum := len(A), 0
- for _, v := range A {
- sum += v
+func maxSubarraySumCircular(nums []int) int {
+ var max1, max2, sum int
+
+ // case: no circulation
+ max1 = int(math.Inf(-1))
+ l := len(nums)
+ for i := 0; i < l; i++ {
+ sum += nums[i]
+ if sum > max1 {
+ max1 = sum
+ }
+ if sum < 1 {
+ sum = 0
+ }
}
- kad := kadane(A)
- for i := 0; i < n; i++ {
- A[i] = -A[i]
+
+ // case: circling
+ arr_sum := 0
+ for i := 0; i < l; i++ {
+ arr_sum += nums[i]
}
- negativeMax := kadane(A)
- if sum+negativeMax <= 0 {
- return kad
+
+ sum = 0
+ min_sum := 0
+ for i := 1; i < l-1; i++ {
+ sum += nums[i]
+ if sum >= 0 {
+ sum = 0
+ }
+ if sum < min_sum {
+ min_sum = sum
+ }
}
- return max(kad, sum+negativeMax)
+ max2 = arr_sum - min_sum
+
+ return max(max1, max2)
}
-func kadane(a []int) int {
- n, MaxEndingHere, maxSoFar := len(a), a[0], math.MinInt32
- for i := 1; i < n; i++ {
- MaxEndingHere = max(a[i], MaxEndingHere+a[i])
- maxSoFar = max(MaxEndingHere, maxSoFar)
+func max(nums ...int) int {
+ max := int(math.Inf(-1))
+ for _, num := range nums {
+ if num > max {
+ max = num
+ }
}
- return maxSoFar
+ return max
}
-```
\ No newline at end of file
+
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0900~0999/0916.Word-Subsets/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0900~0999/0920.Number-of-Music-Playlists/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0920.Number-of-Music-Playlists.md b/website/content/ChapterFour/0900~0999/0920.Number-of-Music-Playlists.md
similarity index 85%
rename from website/content/ChapterFour/0920.Number-of-Music-Playlists.md
rename to website/content/ChapterFour/0900~0999/0920.Number-of-Music-Playlists.md
index b0efa478d..27e214453 100755
--- a/website/content/ChapterFour/0920.Number-of-Music-Playlists.md
+++ b/website/content/ChapterFour/0900~0999/0920.Number-of-Music-Playlists.md
@@ -53,9 +53,9 @@ Return the number of possible playlists. **As the answer can be very large, ret
- 简化抽象一下题意，给 N 个数，要求从这 N 个数里面组成一个长度为 L 的序列，并且相同元素的间隔不能小于 K 个数。问总共有多少组组成方法。
- 一拿到题，会觉得这一题是三维 DP，因为存在 3 个变量，但是实际考虑一下，可以降一维。我们先不考虑 K 的限制，只考虑 N 和 L。定义 `dp[i][j]` 代表播放列表里面有 `i` 首歌，其中包含 `j` 首不同的歌曲，那么题目要求的最终解存在 `dp[L][N]` 中。考虑 `dp[i][j]` 的递归公式，音乐列表当前需要组成 `i` 首歌，有 2 种方式可以得到，由 `i - 1` 首歌的列表中添加一首列表中**不存在**的新歌曲，或者由 `i - 1` 首歌的列表中添加一首列表中**已经存在**的歌曲。即，`dp[i][j]` 可以由 `dp[i - 1][j - 1]` 得到，也可以由 `dp[i - 1][j]` 得到。如果是第一种情况，添加一首新歌，那么新歌有 N - ( j - 1 ) 首，如果是第二种情况，添加一首已经存在的歌，歌有 j 首，所以状态转移方程是 `dp[i][j] = dp[i - 1][j - 1] * ( N - ( j - 1 ) ) + dp[i - 1][j] * j` 。但是这个方程是在不考虑 K 的限制条件下得到的，距离满足题意还差一步。接下来需要考虑加入 K 这个限制条件以后，状态转移方程该如何推导。
- 如果是添加一首新歌，是不受 K 限制的，所以 `dp[i - 1][j - 1] * ( N - ( j - 1 ) )` 这里不需要变化。如果是添加一首存在的歌曲，这个时候就会受到 K 的限制了。如果当前播放列表里面的歌曲有 `j` 首，并且 `j > K`，那么选择歌曲只能从 `j - K` 里面选，因为不能选择 `j - 1` 到 `j - k` 的这些歌，选择了就不满足重复的歌之间间隔不能小于 `K` 的限制条件了。那 j ≤ K 呢？这个时候一首歌都不能选，因为歌曲数都没有超过 K，当然不能再选择重复的歌曲。(选择了就再次不满足重复的歌之间间隔不能小于 `K` 的限制条件了)。经过上述分析，可以得到最终的状态转移方程：
-
-
-
+{{< katex display >}}
+dp[i][j]= \begin{matrix} \left\{ \begin{array}{lr} dp[i - 1][j - 1] * ( N - ( j - 1 ) ) + dp[i - 1][j] * ( j - k ) , & {j > k}\\ dp[i - 1][j - 1] * ( N - ( j - 1 ) ), & {j \leq k} \end{array} \right. \end{matrix}
+{{< /katex >}}
- 上面的式子可以合并简化成下面这个式子：`dp[i][j] = dp[i - 1][j - 1]*(N - (j - 1)) + dp[i-1][j]*max(j-K, 0)`，递归初始值 `dp[0][0] = 1`。
@@ -82,4 +82,11 @@ func numMusicPlaylists(N int, L int, K int) int {
return dp[L][N]
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0900~0999/0918.Maximum-Sum-Circular-Subarray/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0900~0999/0921.Minimum-Add-to-Make-Parentheses-Valid/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0921.Minimum-Add-to-Make-Parentheses-Valid.md b/website/content/ChapterFour/0900~0999/0921.Minimum-Add-to-Make-Parentheses-Valid.md
similarity index 80%
rename from website/content/ChapterFour/0921.Minimum-Add-to-Make-Parentheses-Valid.md
rename to website/content/ChapterFour/0900~0999/0921.Minimum-Add-to-Make-Parentheses-Valid.md
index 8952fe952..f11d433ee 100644
--- a/website/content/ChapterFour/0921.Minimum-Add-to-Make-Parentheses-Valid.md
+++ b/website/content/ChapterFour/0900~0999/0921.Minimum-Add-to-Make-Parentheses-Valid.md
@@ -85,4 +85,11 @@ func minAddToMakeValid(S string) int {
return len(stack)
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0900~0999/0920.Number-of-Music-Playlists/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0900~0999/0922.Sort-Array-By-Parity-II/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0922.Sort-Array-By-Parity-II.md b/website/content/ChapterFour/0900~0999/0922.Sort-Array-By-Parity-II.md
similarity index 75%
rename from website/content/ChapterFour/0922.Sort-Array-By-Parity-II.md
rename to website/content/ChapterFour/0900~0999/0922.Sort-Array-By-Parity-II.md
index ca915fd94..c89384dd7 100644
--- a/website/content/ChapterFour/0922.Sort-Array-By-Parity-II.md
+++ b/website/content/ChapterFour/0900~0999/0922.Sort-Array-By-Parity-II.md
@@ -58,4 +58,11 @@ func sortArrayByParityII(A []int) []int {
return res
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0900~0999/0921.Minimum-Add-to-Make-Parentheses-Valid/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0900~0999/0923.3Sum-With-Multiplicity/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0923.3Sum-With-Multiplicity.md b/website/content/ChapterFour/0900~0999/0923.3Sum-With-Multiplicity.md
similarity index 85%
rename from website/content/ChapterFour/0923.3Sum-With-Multiplicity.md
rename to website/content/ChapterFour/0900~0999/0923.3Sum-With-Multiplicity.md
index 0673f0de4..6cacce754 100644
--- a/website/content/ChapterFour/0923.3Sum-With-Multiplicity.md
+++ b/website/content/ChapterFour/0900~0999/0923.3Sum-With-Multiplicity.md
@@ -99,4 +99,11 @@ func threeSumMulti(A []int, target int) int {
return res % mod
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0900~0999/0922.Sort-Array-By-Parity-II/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0900~0999/0924.Minimize-Malware-Spread/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0900~0999/0924.Minimize-Malware-Spread.md b/website/content/ChapterFour/0900~0999/0924.Minimize-Malware-Spread.md
new file mode 100755
index 000000000..b5835a932
--- /dev/null
+++ b/website/content/ChapterFour/0900~0999/0924.Minimize-Malware-Spread.md
@@ -0,0 +1,126 @@
+# [924. Minimize Malware Spread](https://leetcode.com/problems/minimize-malware-spread/)
+
+
+## 题目
+
+In a network of nodes, each node `i` is directly connected to another node `j` if and only if `graph[i][j] = 1`.
+
+Some nodes `initial` are initially infected by malware. Whenever two nodes are directly connected and at least one of those two nodes is infected by malware, both nodes will be infected by malware. This spread of malware will continue until no more nodes can be infected in this manner.
+
+Suppose `M(initial)` is the final number of nodes infected with malware in the entire network, after the spread of malware stops.
+
+We will remove one node from the initial list. Return the node that if removed, would minimize `M(initial)`. If multiple nodes could be removed to minimize `M(initial)`, return such a node with the smallest index.
+
+Note that if a node was removed from the `initial` list of infected nodes, it may still be infected later as a result of the malware spread.
+
+**Example 1**:
+
+ Input: graph = [[1,1,0],[1,1,0],[0,0,1]], initial = [0,1]
+ Output: 0
+
+**Example 2**:
+
+ Input: graph = [[1,0,0],[0,1,0],[0,0,1]], initial = [0,2]
+ Output: 0
+
+**Example 3**:
+
+ Input: graph = [[1,1,1],[1,1,1],[1,1,1]], initial = [1,2]
+ Output: 1
+
+**Note**:
+
+1. `1 < graph.length = graph[0].length <= 300`
+2. `0 <= graph[i][j] == graph[j][i] <= 1`
+3. `graph[i][i] = 1`
+4. `1 <= initial.length < graph.length`
+5. `0 <= initial[i] < graph.length`
+
+
+## 题目大意
+
+在节点网络中，只有当 graph[i][j] = 1 时，每个节点 i 能够直接连接到另一个节点 j。一些节点 initial 最初被恶意软件感染。只要两个节点直接连接，且其中至少一个节点受到恶意软件的感染，那么两个节点都将被恶意软件感染。这种恶意软件的传播将继续，直到没有更多的节点可以被这种方式感染。假设 M(initial) 是在恶意软件停止传播之后，整个网络中感染恶意软件的最终节点数。我们可以从初始列表中删除一个节点。如果移除这一节点将最小化 M(initial)， 则返回该节点。如果有多个节点满足条件，就返回索引最小的节点。请注意，如果某个节点已从受感染节点的列表 initial 中删除，它以后可能仍然因恶意软件传播而受到感染。
+
+
+提示：
+
+- 1 < graph.length = graph[0].length <= 300
+- 0 <= graph[i][j] == graph[j][i] <= 1
+- graph[i][i] = 1
+- 1 <= initial.length < graph.length
+- 0 <= initial[i] < graph.length
+
+
+## 解题思路
+
+
+- 给出一个节点之间的关系图，如果两个节点是连通的，那么病毒软件就会感染到连通的所有节点。现在如果想移除一个病毒节点，能最大减少感染，请问移除哪个节点？如果多个节点都能减少感染量，优先移除序号偏小的那个节点。
+- 这一题一看就是考察的并查集。利用节点的连通关系，把题目中给的所有节点都 `union()` 起来，然后依次统计每个集合内有多少个点。最后扫描一次 initial 数组，选出这个数组中节点小的并且所在集合节点多，这个节点就是最终答案。
+
+
+## 代码
+
+```go
+
+package leetcode
+
+import (
+ "math"
+
+ "github.com/halfrost/leetcode-go/template"
+)
+
+func minMalwareSpread(graph [][]int, initial []int) int {
+ if len(initial) == 0 {
+ return 0
+ }
+ uf, maxLen, maxIdx, uniqInitials, compMap := template.UnionFindCount{}, math.MinInt32, -1, map[int]int{}, map[int][]int{}
+ uf.Init(len(graph))
+ for i := range graph {
+ for j := i + 1; j < len(graph); j++ {
+ if graph[i][j] == 1 {
+ uf.Union(i, j)
+ }
+ }
+ }
+ for _, i := range initial {
+ compMap[uf.Find(i)] = append(compMap[uf.Find(i)], i)
+ }
+ for _, v := range compMap {
+ if len(v) == 1 {
+ uniqInitials[v[0]] = v[0]
+ }
+ }
+ if len(uniqInitials) == 0 {
+ smallestIdx := initial[0]
+ for _, i := range initial {
+ if i < smallestIdx {
+ smallestIdx = i
+ }
+ }
+ return smallestIdx
+ }
+ for _, i := range initial {
+ if _, ok := uniqInitials[i]; ok {
+ size := uf.Count()[uf.Find(i)]
+ if maxLen < size {
+ maxLen, maxIdx = size, i
+ } else if maxLen == size {
+ if i < maxIdx {
+ maxIdx = i
+ }
+ }
+ }
+ }
+ return maxIdx
+}
+
+
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0900~0999/0923.3Sum-With-Multiplicity/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0900~0999/0925.Long-Pressed-Name/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0925.Long-Pressed-Name.md b/website/content/ChapterFour/0900~0999/0925.Long-Pressed-Name.md
similarity index 86%
rename from website/content/ChapterFour/0925.Long-Pressed-Name.md
rename to website/content/ChapterFour/0900~0999/0925.Long-Pressed-Name.md
index fb33cbd99..1634e0602 100644
--- a/website/content/ChapterFour/0925.Long-Pressed-Name.md
+++ b/website/content/ChapterFour/0900~0999/0925.Long-Pressed-Name.md
@@ -104,4 +104,11 @@ func isLongPressedName(name string, typed string) bool {
return i == len(name) && j == len(typed)
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0900~0999/0924.Minimize-Malware-Spread/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0900~0999/0927.Three-Equal-Parts/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0927.Three-Equal-Parts.md b/website/content/ChapterFour/0900~0999/0927.Three-Equal-Parts.md
similarity index 89%
rename from website/content/ChapterFour/0927.Three-Equal-Parts.md
rename to website/content/ChapterFour/0900~0999/0927.Three-Equal-Parts.md
index 311b8c493..9cdabc5d9 100755
--- a/website/content/ChapterFour/0927.Three-Equal-Parts.md
+++ b/website/content/ChapterFour/0900~0999/0927.Three-Equal-Parts.md
@@ -110,4 +110,11 @@ func threeEqualParts(A []int) []int {
return []int{-1, -1}
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0900~0999/0925.Long-Pressed-Name/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0900~0999/0928.Minimize-Malware-Spread-II/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0928.Minimize-Malware-Spread-II.md b/website/content/ChapterFour/0900~0999/0928.Minimize-Malware-Spread-II.md
similarity index 93%
rename from website/content/ChapterFour/0928.Minimize-Malware-Spread-II.md
rename to website/content/ChapterFour/0900~0999/0928.Minimize-Malware-Spread-II.md
index 4d83986bb..ad047b303 100755
--- a/website/content/ChapterFour/0928.Minimize-Malware-Spread-II.md
+++ b/website/content/ChapterFour/0900~0999/0928.Minimize-Malware-Spread-II.md
@@ -70,7 +70,7 @@ package leetcode
import (
"math"
- "github.com/halfrost/LeetCode-Go/template"
+ "github.com/halfrost/leetcode-go/template"
)
func minMalwareSpread2(graph [][]int, initial []int) int {
@@ -134,4 +134,11 @@ func minMalwareSpread2(graph [][]int, initial []int) int {
return minIndex
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0900~0999/0927.Three-Equal-Parts/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0900~0999/0930.Binary-Subarrays-With-Sum/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0930.Binary-Subarrays-With-Sum.md b/website/content/ChapterFour/0900~0999/0930.Binary-Subarrays-With-Sum.md
similarity index 81%
rename from website/content/ChapterFour/0930.Binary-Subarrays-With-Sum.md
rename to website/content/ChapterFour/0900~0999/0930.Binary-Subarrays-With-Sum.md
index 161579ce6..b79ee1608 100644
--- a/website/content/ChapterFour/0930.Binary-Subarrays-With-Sum.md
+++ b/website/content/ChapterFour/0900~0999/0930.Binary-Subarrays-With-Sum.md
@@ -62,4 +62,11 @@ func numSubarraysWithSum(A []int, S int) int {
return res
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0900~0999/0928.Minimize-Malware-Spread-II/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0900~0999/0933.Number-of-Recent-Calls/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0933.Number-of-Recent-Calls.md b/website/content/ChapterFour/0900~0999/0933.Number-of-Recent-Calls.md
similarity index 84%
rename from website/content/ChapterFour/0933.Number-of-Recent-Calls.md
rename to website/content/ChapterFour/0900~0999/0933.Number-of-Recent-Calls.md
index 02b2340ce..a5b0005a5 100644
--- a/website/content/ChapterFour/0933.Number-of-Recent-Calls.md
+++ b/website/content/ChapterFour/0900~0999/0933.Number-of-Recent-Calls.md
@@ -71,4 +71,11 @@ func (this *RecentCounter) Ping(t int) int {
* obj := Constructor();
* param_1 := obj.Ping(t);
*/
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0900~0999/0930.Binary-Subarrays-With-Sum/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0900~0999/0938.Range-Sum-of-BST/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0900~0999/0938.Range-Sum-of-BST.md b/website/content/ChapterFour/0900~0999/0938.Range-Sum-of-BST.md
new file mode 100644
index 000000000..a0c1644ec
--- /dev/null
+++ b/website/content/ChapterFour/0900~0999/0938.Range-Sum-of-BST.md
@@ -0,0 +1,87 @@
+# [938. Range Sum of BST](https://leetcode.com/problems/range-sum-of-bst/)
+
+
+## 题目
+
+Given the `root` node of a binary search tree, return *the sum of values of all nodes with a value in the range `[low, high]`*.
+
+**Example 1:**
+
+
+
+```
+Input: root = [10,5,15,3,7,null,18], low = 7, high = 15
+Output: 32
+
+```
+
+**Example 2:**
+
+
+
+```
+Input: root = [10,5,15,3,7,13,18,1,null,6], low = 6, high = 10
+Output: 23
+
+```
+
+**Constraints:**
+
+- The number of nodes in the tree is in the range `[1, 2 * 10^4]`.
+- `1 <= Node.val <= 10^5`
+- `1 <= low <= high <= 10^5`
+- All `Node.val` are **unique**.
+
+## 题目大意
+
+给定二叉搜索树的根结点 root，返回值位于范围 [low, high] 之间的所有结点的值的和。
+
+## 解题思路
+
+- 简单题。因为二叉搜索树的有序性，先序遍历即为有序。遍历过程中判断节点值是否位于区间范围内，在区间内就累加，不在区间内节点就不管。最终输出累加和。
+
+## 代码
+
+```go
+package leetcode
+
+import (
+ "github.com/halfrost/leetcode-go/structures"
+)
+
+// TreeNode define
+type TreeNode = structures.TreeNode
+
+/**
+ * Definition for a binary tree node.
+ * type TreeNode struct {
+ * Val int
+ * Left *TreeNode
+ * Right *TreeNode
+ * }
+ */
+
+func rangeSumBST(root *TreeNode, low int, high int) int {
+ res := 0
+ preOrder(root, low, high, &res)
+ return res
+}
+
+func preOrder(root *TreeNode, low, high int, res *int) {
+ if root == nil {
+ return
+ }
+ if low <= root.Val && root.Val <= high {
+ *res += root.Val
+ }
+ preOrder(root.Left, low, high, res)
+ preOrder(root.Right, low, high, res)
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0900~0999/0933.Number-of-Recent-Calls/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0900~0999/0942.DI-String-Match/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0942.DI-String-Match.md b/website/content/ChapterFour/0900~0999/0942.DI-String-Match.md
similarity index 80%
rename from website/content/ChapterFour/0942.DI-String-Match.md
rename to website/content/ChapterFour/0900~0999/0942.DI-String-Match.md
index 485dee18f..ccc5bfa53 100755
--- a/website/content/ChapterFour/0942.DI-String-Match.md
+++ b/website/content/ChapterFour/0900~0999/0942.DI-String-Match.md
@@ -70,4 +70,11 @@ func diStringMatch(S string) []int {
return result
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0900~0999/0938.Range-Sum-of-BST/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0900~0999/0946.Validate-Stack-Sequences/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0946.Validate-Stack-Sequences.md b/website/content/ChapterFour/0900~0999/0946.Validate-Stack-Sequences.md
similarity index 80%
rename from website/content/ChapterFour/0946.Validate-Stack-Sequences.md
rename to website/content/ChapterFour/0900~0999/0946.Validate-Stack-Sequences.md
index f69621d28..a71eed54f 100644
--- a/website/content/ChapterFour/0946.Validate-Stack-Sequences.md
+++ b/website/content/ChapterFour/0900~0999/0946.Validate-Stack-Sequences.md
@@ -49,20 +49,23 @@ Explanation: 1 cannot be popped before 2.
package leetcode
-import "fmt"
-
func validateStackSequences(pushed []int, popped []int) bool {
stack, j, N := []int{}, 0, len(pushed)
for _, x := range pushed {
stack = append(stack, x)
- fmt.Printf("stack = %v j = %v\n", stack, j)
for len(stack) != 0 && j < N && stack[len(stack)-1] == popped[j] {
stack = stack[0 : len(stack)-1]
j++
}
- fmt.Printf("*****stack = %v j = %v\n", stack, j)
}
return j == N
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0900~0999/0942.DI-String-Match/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0900~0999/0947.Most-Stones-Removed-with-Same-Row-or-Column/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0947.Most-Stones-Removed-with-Same-Row-or-Column.md b/website/content/ChapterFour/0900~0999/0947.Most-Stones-Removed-with-Same-Row-or-Column.md
similarity index 86%
rename from website/content/ChapterFour/0947.Most-Stones-Removed-with-Same-Row-or-Column.md
rename to website/content/ChapterFour/0900~0999/0947.Most-Stones-Removed-with-Same-Row-or-Column.md
index 886bb0361..e19800760 100755
--- a/website/content/ChapterFour/0947.Most-Stones-Removed-with-Same-Row-or-Column.md
+++ b/website/content/ChapterFour/0900~0999/0947.Most-Stones-Removed-with-Same-Row-or-Column.md
@@ -55,7 +55,7 @@ What is the largest possible number of moves we can make?
package leetcode
import (
- "github.com/halfrost/LeetCode-Go/template"
+ "github.com/halfrost/leetcode-go/template"
)
func removeStones(stones [][]int) int {
@@ -79,4 +79,11 @@ func removeStones(stones [][]int) int {
return len(stones) - uf.TotalCount()
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0900~0999/0946.Validate-Stack-Sequences/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0900~0999/0949.Largest-Time-for-Given-Digits/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0949.Largest-Time-for-Given-Digits.md b/website/content/ChapterFour/0900~0999/0949.Largest-Time-for-Given-Digits.md
similarity index 82%
rename from website/content/ChapterFour/0949.Largest-Time-for-Given-Digits.md
rename to website/content/ChapterFour/0900~0999/0949.Largest-Time-for-Given-Digits.md
index 02f0bf435..4dee6fdb1 100644
--- a/website/content/ChapterFour/0949.Largest-Time-for-Given-Digits.md
+++ b/website/content/ChapterFour/0900~0999/0949.Largest-Time-for-Given-Digits.md
@@ -75,4 +75,11 @@ func largestTimeFromDigits(A []int) string {
}
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0900~0999/0947.Most-Stones-Removed-with-Same-Row-or-Column/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0900~0999/0952.Largest-Component-Size-by-Common-Factor/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0952.Largest-Component-Size-by-Common-Factor.md b/website/content/ChapterFour/0900~0999/0952.Largest-Component-Size-by-Common-Factor.md
similarity index 88%
rename from website/content/ChapterFour/0952.Largest-Component-Size-by-Common-Factor.md
rename to website/content/ChapterFour/0900~0999/0952.Largest-Component-Size-by-Common-Factor.md
index d37262bce..f40b90a1c 100755
--- a/website/content/ChapterFour/0952.Largest-Component-Size-by-Common-Factor.md
+++ b/website/content/ChapterFour/0900~0999/0952.Largest-Component-Size-by-Common-Factor.md
@@ -63,7 +63,7 @@ Return the size of the largest connected component in the graph.
package leetcode
import (
- "github.com/halfrost/LeetCode-Go/template"
+ "github.com/halfrost/leetcode-go/template"
)
// 解法一 并查集 UnionFind
@@ -116,4 +116,11 @@ func largestComponentSize1(A []int) int {
return uf.MaxUnionCount()
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0900~0999/0949.Largest-Time-for-Given-Digits/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0900~0999/0953.Verifying-an-Alien-Dictionary/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0953.Verifying-an-Alien-Dictionary.md b/website/content/ChapterFour/0900~0999/0953.Verifying-an-Alien-Dictionary.md
similarity index 87%
rename from website/content/ChapterFour/0953.Verifying-an-Alien-Dictionary.md
rename to website/content/ChapterFour/0900~0999/0953.Verifying-an-Alien-Dictionary.md
index ff648c14e..f50c0855a 100755
--- a/website/content/ChapterFour/0953.Verifying-an-Alien-Dictionary.md
+++ b/website/content/ChapterFour/0900~0999/0953.Verifying-an-Alien-Dictionary.md
@@ -78,4 +78,11 @@ func isAlienSorted(words []string, order string) bool {
return true
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0900~0999/0952.Largest-Component-Size-by-Common-Factor/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0900~0999/0958.Check-Completeness-of-a-Binary-Tree/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0900~0999/0958.Check-Completeness-of-a-Binary-Tree.md b/website/content/ChapterFour/0900~0999/0958.Check-Completeness-of-a-Binary-Tree.md
new file mode 100644
index 000000000..d9a30b23b
--- /dev/null
+++ b/website/content/ChapterFour/0900~0999/0958.Check-Completeness-of-a-Binary-Tree.md
@@ -0,0 +1,96 @@
+# [958. Check Completeness of a Binary Tree](https://leetcode.com/problems/check-completeness-of-a-binary-tree/)
+
+
+## 题目
+
+Given the `root` of a binary tree, determine if it is a *complete binary tree*.
+
+In a **[complete binary tree](http://en.wikipedia.org/wiki/Binary_tree#Types_of_binary_trees)**, every level, except possibly the last, is completely filled, and all nodes in the last level are as far left as possible. It can have between `1` and `2h` nodes inclusive at the last level `h`.
+
+**Example 1:**
+
+
+
+```
+Input: root = [1,2,3,4,5,6]
+Output: true
+Explanation: Every level before the last is full (ie. levels with node-values {1} and {2, 3}), and all nodes in the last level ({4, 5, 6}) are as far left as possible.
+
+```
+
+**Example 2:**
+
+
+
+```
+Input: root = [1,2,3,4,5,null,7]
+Output: false
+Explanation: The node with value 7 isn't as far left as possible.
+
+```
+
+**Constraints:**
+
+- The number of nodes in the tree is in the range `[1, 100]`.
+- `1 <= Node.val <= 1000`
+
+## 题目大意
+
+给定一个二叉树，确定它是否是一个完全二叉树。
+
+百度百科中对完全二叉树的定义如下：
+
+若设二叉树的深度为 h，除第 h 层外，其它各层 (1～h-1) 的结点数都达到最大个数，第 h 层所有的结点都连续集中在最左边，这就是完全二叉树。（注：第 h 层可能包含 1~ 2h 个节点。）
+
+## 解题思路
+
+- 这一题是按层序遍历的变种题。
+- 判断每个节点的左孩子是否为空。
+- 类似的题目，第 102，107，199 题都是按层序遍历的。
+
+## 代码
+
+```go
+package leetcode
+
+import (
+ "github.com/halfrost/leetcode-go/structures"
+)
+
+// TreeNode define
+type TreeNode = structures.TreeNode
+
+/**
+ * Definition for a binary tree node.
+ * type TreeNode struct {
+ * Val int
+ * Left *TreeNode
+ * Right *TreeNode
+ * }
+ */
+
+func isCompleteTree(root *TreeNode) bool {
+ queue, found := []*TreeNode{root}, false
+ for len(queue) > 0 {
+ node := queue[0] //取出每一层的第一个节点
+ queue = queue[1:]
+ if node == nil {
+ found = true
+ } else {
+ if found {
+ return false // 层序遍历中，两个不为空的节点中出现一个 nil
+ }
+ //如果左孩子为nil，则append进去的node.Left为nil
+ queue = append(queue, node.Left, node.Right)
+ }
+ }
+ return true
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0900~0999/0953.Verifying-an-Alien-Dictionary/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0900~0999/0959.Regions-Cut-By-Slashes/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0959.Regions-Cut-By-Slashes.md b/website/content/ChapterFour/0900~0999/0959.Regions-Cut-By-Slashes.md
similarity index 90%
rename from website/content/ChapterFour/0959.Regions-Cut-By-Slashes.md
rename to website/content/ChapterFour/0900~0999/0959.Regions-Cut-By-Slashes.md
index c560cc59b..1aba869f9 100755
--- a/website/content/ChapterFour/0959.Regions-Cut-By-Slashes.md
+++ b/website/content/ChapterFour/0900~0999/0959.Regions-Cut-By-Slashes.md
@@ -105,7 +105,7 @@ Return the number of regions.
package leetcode
import (
- "github.com/halfrost/LeetCode-Go/template"
+ "github.com/halfrost/leetcode-go/template"
)
func regionsBySlashes(grid []string) int {
@@ -147,4 +147,11 @@ func getFaceIdx(size, i, j, k int) int {
return 4*(i*size+j) + k
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0900~0999/0958.Check-Completeness-of-a-Binary-Tree/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0900~0999/0961.N-Repeated-Element-in-Size-2N-Array/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0961.N-Repeated-Element-in-Size-2N-Array.md b/website/content/ChapterFour/0900~0999/0961.N-Repeated-Element-in-Size-2N-Array.md
similarity index 75%
rename from website/content/ChapterFour/0961.N-Repeated-Element-in-Size-2N-Array.md
rename to website/content/ChapterFour/0900~0999/0961.N-Repeated-Element-in-Size-2N-Array.md
index a9e53e779..e6f46cf28 100755
--- a/website/content/ChapterFour/0961.N-Repeated-Element-in-Size-2N-Array.md
+++ b/website/content/ChapterFour/0900~0999/0961.N-Repeated-Element-in-Size-2N-Array.md
@@ -57,4 +57,11 @@ func repeatedNTimes(A []int) int {
return 0
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0900~0999/0959.Regions-Cut-By-Slashes/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0900~0999/0966.Vowel-Spellchecker/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0900~0999/0966.Vowel-Spellchecker.md b/website/content/ChapterFour/0900~0999/0966.Vowel-Spellchecker.md
new file mode 100644
index 000000000..645daa8d6
--- /dev/null
+++ b/website/content/ChapterFour/0900~0999/0966.Vowel-Spellchecker.md
@@ -0,0 +1,134 @@
+# [966. Vowel Spellchecker](https://leetcode.com/problems/vowel-spellchecker/)
+
+
+## 题目
+
+Given a `wordlist`, we want to implement a spellchecker that converts a query word into a correct word.
+
+For a given `query` word, the spell checker handles two categories of spelling mistakes:
+
+- Capitalization: If the query matches a word in the wordlist (**case-insensitive**), then the query word is returned with the same case as the case in the wordlist.
+ - Example: `wordlist = ["yellow"]`, `query = "YellOw"`: `correct = "yellow"`
+ - Example: `wordlist = ["Yellow"]`, `query = "yellow"`: `correct = "Yellow"`
+ - Example: `wordlist = ["yellow"]`, `query = "yellow"`: `correct = "yellow"`
+- Vowel Errors: If after replacing the vowels ('a', 'e', 'i', 'o', 'u') of the query word with any vowel individually, it matches a word in the wordlist (**case-insensitive**), then the query word is returned with the same case as the match in the wordlist.
+ - Example: `wordlist = ["YellOw"]`, `query = "yollow"`: `correct = "YellOw"`
+ - Example: `wordlist = ["YellOw"]`, `query = "yeellow"`: `correct = ""` (no match)
+ - Example: `wordlist = ["YellOw"]`, `query = "yllw"`: `correct = ""` (no match)
+
+In addition, the spell checker operates under the following precedence rules:
+
+- When the query exactly matches a word in the wordlist (**case-sensitive**), you should return the same word back.
+- When the query matches a word up to capitlization, you should return the first such match in the wordlist.
+- When the query matches a word up to vowel errors, you should return the first such match in the wordlist.
+- If the query has no matches in the wordlist, you should return the empty string.
+
+Given some `queries`, return a list of words `answer`, where `answer[i]` is the correct word for `query = queries[i]`.
+
+**Example 1:**
+
+```
+Input:wordlist = ["KiTe","kite","hare","Hare"], queries = ["kite","Kite","KiTe","Hare","HARE","Hear","hear","keti","keet","keto"]
+Output:["kite","KiTe","KiTe","Hare","hare","","","KiTe","","KiTe"]
+```
+
+**Note:**
+
+- `1 <= wordlist.length <= 5000`
+- `1 <= queries.length <= 5000`
+- `1 <= wordlist[i].length <= 7`
+- `1 <= queries[i].length <= 7`
+- All strings in `wordlist` and `queries` consist only of **english** letters.
+
+## 题目大意
+
+在给定单词列表 wordlist 的情况下，我们希望实现一个拼写检查器，将查询单词转换为正确的单词。
+
+对于给定的查询单词 query，拼写检查器将会处理两类拼写错误：
+
+- 大小写：如果查询匹配单词列表中的某个单词（不区分大小写），则返回的正确单词与单词列表中的大小写相同。
+ - 例如：wordlist = ["yellow"], query = "YellOw": correct = "yellow"
+ - 例如：wordlist = ["Yellow"], query = "yellow": correct = "Yellow"
+ - 例如：wordlist = ["yellow"], query = "yellow": correct = "yellow"
+- 元音错误：如果在将查询单词中的元音（‘a’、‘e’、‘i’、‘o’、‘u’）分别替换为任何元音后，能与单词列表中的单词匹配（不区分大小写），则返回的正确单词与单词列表中的匹配项大小写相同。
+ - 例如：wordlist = ["YellOw"], query = "yollow": correct = "YellOw"
+ - 例如：wordlist = ["YellOw"], query = "yeellow": correct = "" （无匹配项）
+ - 例如：wordlist = ["YellOw"], query = "yllw": correct = "" （无匹配项）
+
+此外，拼写检查器还按照以下优先级规则操作：
+
+- 当查询完全匹配单词列表中的某个单词（区分大小写）时，应返回相同的单词。
+- 当查询匹配到大小写问题的单词时，您应该返回单词列表中的第一个这样的匹配项。
+- 当查询匹配到元音错误的单词时，您应该返回单词列表中的第一个这样的匹配项。
+- 如果该查询在单词列表中没有匹配项，则应返回空字符串。
+
+给出一些查询 queries，返回一个单词列表 answer，其中 answer[i] 是由查询 query = queries[i] 得到的正确单词。
+
+## 解题思路
+
+- 读完题，很明显需要用 `map` 来解题。依题意分为 3 种情况，查询字符串完全匹配；查询字符串只是大小写不同；查询字符串有元音错误。第一种情况用 `map` `key` 直接匹配即可。第二种情况，利用 `map` 将单词从小写形式转换成原单词正确的大小写形式。第三种情况，利用 `map` 将单词从忽略元音的小写形式换成原单词正确形式。最后注意一下题目最后给的 4 个优先级规则即可。
+
+## 代码
+
+```go
+package leetcode
+
+import "strings"
+
+func spellchecker(wordlist []string, queries []string) []string {
+ wordsPerfect, wordsCap, wordsVowel := map[string]bool{}, map[string]string{}, map[string]string{}
+ for _, word := range wordlist {
+ wordsPerfect[word] = true
+ wordLow := strings.ToLower(word)
+ if _, ok := wordsCap[wordLow]; !ok {
+ wordsCap[wordLow] = word
+ }
+ wordLowVowel := devowel(wordLow)
+ if _, ok := wordsVowel[wordLowVowel]; !ok {
+ wordsVowel[wordLowVowel] = word
+ }
+ }
+ res, index := make([]string, len(queries)), 0
+ for _, query := range queries {
+ if _, ok := wordsPerfect[query]; ok {
+ res[index] = query
+ index++
+ continue
+ }
+ queryL := strings.ToLower(query)
+ if v, ok := wordsCap[queryL]; ok {
+ res[index] = v
+ index++
+ continue
+ }
+
+ queryLV := devowel(queryL)
+ if v, ok := wordsVowel[queryLV]; ok {
+ res[index] = v
+ index++
+ continue
+ }
+ res[index] = ""
+ index++
+ }
+ return res
+
+}
+
+func devowel(word string) string {
+ runes := []rune(word)
+ for k, c := range runes {
+ if c == 'a' || c == 'e' || c == 'i' || c == 'o' || c == 'u' {
+ runes[k] = '*'
+ }
+ }
+ return string(runes)
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0900~0999/0961.N-Repeated-Element-in-Size-2N-Array/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0900~0999/0968.Binary-Tree-Cameras/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0968.Binary-Tree-Cameras.md b/website/content/ChapterFour/0900~0999/0968.Binary-Tree-Cameras.md
similarity index 91%
rename from website/content/ChapterFour/0968.Binary-Tree-Cameras.md
rename to website/content/ChapterFour/0900~0999/0968.Binary-Tree-Cameras.md
index d9873a5bb..3806dc55a 100755
--- a/website/content/ChapterFour/0968.Binary-Tree-Cameras.md
+++ b/website/content/ChapterFour/0900~0999/0968.Binary-Tree-Cameras.md
@@ -100,4 +100,11 @@ func minCameraCoverDFS(root *TreeNode, res *int) status {
}
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0900~0999/0966.Vowel-Spellchecker/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0900~0999/0969.Pancake-Sorting/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0969.Pancake-Sorting.md b/website/content/ChapterFour/0900~0999/0969.Pancake-Sorting.md
similarity index 87%
rename from website/content/ChapterFour/0969.Pancake-Sorting.md
rename to website/content/ChapterFour/0900~0999/0969.Pancake-Sorting.md
index 68288d5c2..29ed06f44 100644
--- a/website/content/ChapterFour/0969.Pancake-Sorting.md
+++ b/website/content/ChapterFour/0900~0999/0969.Pancake-Sorting.md
@@ -93,4 +93,11 @@ func find(nums []int, t int) int {
return -1
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0900~0999/0968.Binary-Tree-Cameras/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0900~0999/0970.Powerful-Integers/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0970.Powerful-Integers.md b/website/content/ChapterFour/0900~0999/0970.Powerful-Integers.md
similarity index 82%
rename from website/content/ChapterFour/0970.Powerful-Integers.md
rename to website/content/ChapterFour/0900~0999/0970.Powerful-Integers.md
index 9de409549..444df1b99 100755
--- a/website/content/ChapterFour/0970.Powerful-Integers.md
+++ b/website/content/ChapterFour/0900~0999/0970.Powerful-Integers.md
@@ -85,4 +85,11 @@ func pow(x, i int) int {
return int(math.Pow(float64(x), float64(i)))
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0900~0999/0969.Pancake-Sorting/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0900~0999/0971.Flip-Binary-Tree-To-Match-Preorder-Traversal/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0900~0999/0971.Flip-Binary-Tree-To-Match-Preorder-Traversal.md b/website/content/ChapterFour/0900~0999/0971.Flip-Binary-Tree-To-Match-Preorder-Traversal.md
new file mode 100644
index 000000000..5433a7ae8
--- /dev/null
+++ b/website/content/ChapterFour/0900~0999/0971.Flip-Binary-Tree-To-Match-Preorder-Traversal.md
@@ -0,0 +1,113 @@
+# [971. Flip Binary Tree To Match Preorder Traversal](https://leetcode.com/problems/flip-binary-tree-to-match-preorder-traversal/)
+
+
+## 题目
+
+You are given the `root` of a binary tree with `n` nodes, where each node is uniquely assigned a value from `1` to `n`. You are also given a sequence of `n` values `voyage`, which is the **desired** **[pre-order traversal](https://en.wikipedia.org/wiki/Tree_traversal#Pre-order)** of the binary tree.
+
+Any node in the binary tree can be **flipped** by swapping its left and right subtrees. For example, flipping node 1 will have the following effect:
+
+
+
+Flip the **smallest** number of nodes so that the **pre-order traversal** of the tree **matches** `voyage`.
+
+Return *a list of the values of all **flipped** nodes. You may return the answer in **any order**. If it is **impossible** to flip the nodes in the tree to make the pre-order traversal match* `voyage`*, return the list* `[-1]`.
+
+**Example 1:**
+
+
+
+```
+Input: root = [1,2], voyage = [2,1]
+Output: [-1]
+Explanation: It is impossible to flip the nodes such that the pre-order traversal matches voyage.
+```
+
+**Example 2:**
+
+
+
+```
+Input: root = [1,2,3], voyage = [1,3,2]
+Output: [1]
+Explanation: Flipping node 1 swaps nodes 2 and 3, so the pre-order traversal matches voyage.
+```
+
+**Example 3:**
+
+
+
+```
+Input: root = [1,2,3], voyage = [1,2,3]
+Output: []
+Explanation: The tree's pre-order traversal already matches voyage, so no nodes need to be flipped.
+```
+
+**Constraints:**
+
+- The number of nodes in the tree is `n`.
+- `n == voyage.length`
+- `1 <= n <= 100`
+- `1 <= Node.val, voyage[i] <= n`
+- All the values in the tree are **unique**.
+- All the values in `voyage` are **unique**.
+
+## 题目大意
+
+给你一棵二叉树的根节点 root ，树中有 n 个节点，每个节点都有一个不同于其他节点且处于 1 到 n 之间的值。另给你一个由 n 个值组成的行程序列 voyage ，表示 预期 的二叉树 先序遍历 结果。通过交换节点的左右子树，可以 翻转 该二叉树中的任意节点。请翻转 最少 的树中节点，使二叉树的 先序遍历 与预期的遍历行程 voyage 相匹配 。如果可以，则返回 翻转的 所有节点的值的列表。你可以按任何顺序返回答案。如果不能，则返回列表 [-1]。
+
+## 解题思路
+
+- 题目要求翻转最少树中节点，利用贪心的思想，应该从根节点开始从上往下依次翻转，这样翻转的次数是最少的。对树进行深度优先遍历，如果遍历到某一个节点的时候，节点值不能与行程序列匹配，那么答案一定是 [-1]。否则，当下一个期望数字 `voyage[i]` 与即将遍历的子节点的值不同的时候，就要翻转一下当前这个节点的左右子树，继续 DFS。递归结束可能有 2 种情况，一种是找出了所有要翻转的节点，另一种情况是没有需要翻转的，即原树先序遍历的结果与 `voyage` 是完全一致的。
+
+## 代码
+
+```go
+package leetcode
+
+import (
+ "github.com/halfrost/leetcode-go/structures"
+)
+
+// TreeNode define
+type TreeNode = structures.TreeNode
+
+/**
+ * Definition for a binary tree node.
+ * type TreeNode struct {
+ * Val int
+ * Left *TreeNode
+ * Right *TreeNode
+ * }
+ */
+
+func flipMatchVoyage(root *TreeNode, voyage []int) []int {
+ res, index := make([]int, 0, len(voyage)), 0
+ if travelTree(root, &index, voyage, &res) {
+ return res
+ }
+ return []int{-1}
+}
+
+func travelTree(root *TreeNode, index *int, voyage []int, res *[]int) bool {
+ if root == nil {
+ return true
+ }
+ if root.Val != voyage[*index] {
+ return false
+ }
+ *index++
+ if root.Left != nil && root.Left.Val != voyage[*index] {
+ *res = append(*res, root.Val)
+ return travelTree(root.Right, index, voyage, res) && travelTree(root.Left, index, voyage, res)
+ }
+ return travelTree(root.Left, index, voyage, res) && travelTree(root.Right, index, voyage, res)
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0900~0999/0970.Powerful-Integers/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0900~0999/0973.K-Closest-Points-to-Origin/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0973.K-Closest-Points-to-Origin.md b/website/content/ChapterFour/0900~0999/0973.K-Closest-Points-to-Origin.md
similarity index 79%
rename from website/content/ChapterFour/0973.K-Closest-Points-to-Origin.md
rename to website/content/ChapterFour/0900~0999/0973.K-Closest-Points-to-Origin.md
index a0b3a7608..8a50e28fc 100644
--- a/website/content/ChapterFour/0973.K-Closest-Points-to-Origin.md
+++ b/website/content/ChapterFour/0900~0999/0973.K-Closest-Points-to-Origin.md
@@ -68,4 +68,11 @@ func KClosest(points [][]int, K int) [][]int {
return ans
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0900~0999/0971.Flip-Binary-Tree-To-Match-Preorder-Traversal/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0900~0999/0976.Largest-Perimeter-Triangle/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0976.Largest-Perimeter-Triangle.md b/website/content/ChapterFour/0900~0999/0976.Largest-Perimeter-Triangle.md
similarity index 76%
rename from website/content/ChapterFour/0976.Largest-Perimeter-Triangle.md
rename to website/content/ChapterFour/0900~0999/0976.Largest-Perimeter-Triangle.md
index 52b5b24c4..02ade12a3 100644
--- a/website/content/ChapterFour/0976.Largest-Perimeter-Triangle.md
+++ b/website/content/ChapterFour/0900~0999/0976.Largest-Perimeter-Triangle.md
@@ -75,4 +75,11 @@ func largestPerimeter(A []int) int {
return 0
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0900~0999/0973.K-Closest-Points-to-Origin/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0900~0999/0977.Squares-of-a-Sorted-Array/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0977.Squares-of-a-Sorted-Array.md b/website/content/ChapterFour/0900~0999/0977.Squares-of-a-Sorted-Array.md
similarity index 80%
rename from website/content/ChapterFour/0977.Squares-of-a-Sorted-Array.md
rename to website/content/ChapterFour/0900~0999/0977.Squares-of-a-Sorted-Array.md
index 06fbd1a7d..3b279c16a 100644
--- a/website/content/ChapterFour/0977.Squares-of-a-Sorted-Array.md
+++ b/website/content/ChapterFour/0900~0999/0977.Squares-of-a-Sorted-Array.md
@@ -83,4 +83,11 @@ func sortedSquares1(A []int) []int {
return A
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0900~0999/0976.Largest-Perimeter-Triangle/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0900~0999/0978.Longest-Turbulent-Subarray/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0900~0999/0978.Longest-Turbulent-Subarray.md b/website/content/ChapterFour/0900~0999/0978.Longest-Turbulent-Subarray.md
new file mode 100755
index 000000000..58ff3044d
--- /dev/null
+++ b/website/content/ChapterFour/0900~0999/0978.Longest-Turbulent-Subarray.md
@@ -0,0 +1,113 @@
+# [978. Longest Turbulent Subarray](https://leetcode.com/problems/longest-turbulent-subarray/)
+
+## 题目
+
+A subarray `A[i], A[i+1], ..., A[j]` of `A` is said to be *turbulent* if and only if:
+
+- For `i <= k < j`, `A[k] > A[k+1]` when `k` is odd, and `A[k] < A[k+1]` when `k` is even;
+- **OR**, for `i <= k < j`, `A[k] > A[k+1]` when `k` is even, and `A[k] < A[k+1]` when `k` is odd.
+
+That is, the subarray is turbulent if the comparison sign flips between each adjacent pair of elements in the subarray.
+
+Return the **length** of a maximum size turbulent subarray of A.
+
+**Example 1**:
+
+ Input: [9,4,2,10,7,8,8,1,9]
+ Output: 5
+ Explanation: (A[1] > A[2] < A[3] > A[4] < A[5])
+
+**Example 2**:
+
+ Input: [4,8,12,16]
+ Output: 2
+
+**Example 3**:
+
+ Input: [100]
+ Output: 1
+
+**Note**:
+
+1. `1 <= A.length <= 40000`
+2. `0 <= A[i] <= 10^9`
+
+
+## 题目大意
+
+
+当 A 的子数组 A[i], A[i+1], ..., A[j] 满足下列条件时，我们称其为湍流子数组：
+
+若 i <= k < j，当 k 为奇数时， A[k] > A[k+1]，且当 k 为偶数时，A[k] < A[k+1]；
+或 若 i <= k < j，当 k 为偶数时，A[k] > A[k+1] ，且当 k 为奇数时， A[k] < A[k+1]。
+也就是说，如果比较符号在子数组中的每个相邻元素对之间翻转，则该子数组是湍流子数组。
+
+返回 A 的最大湍流子数组的长度。
+
+提示：
+
+- 1 <= A.length <= 40000
+- 0 <= A[i] <= 10^9
+
+
+
+## 解题思路
+
+
+- 给出一个数组，要求找出“摆动数组”的最大长度。所谓“摆动数组”的意思是，元素一大一小间隔的。
+- 这一题可以用滑动窗口来解答。用相邻元素差的乘积大于零（a ^ b >= 0 说明a b乘积大于零）来判断是否是湍流， 如果是，那么扩大窗口。否则窗口缩小为0，开始新的一个窗口。
+
+## 代码
+
+```go
+
+package leetcode
+
+// 解法一 模拟法
+func maxTurbulenceSize(arr []int) int {
+ inc, dec := 1, 1
+ maxLen := min(1, len(arr))
+ for i := 1; i < len(arr); i++ {
+ if arr[i-1] < arr[i] {
+ inc = dec + 1
+ dec = 1
+ } else if arr[i-1] > arr[i] {
+ dec = inc + 1
+ inc = 1
+ } else {
+ inc = 1
+ dec = 1
+ }
+ maxLen = max(maxLen, max(inc, dec))
+ }
+ return maxLen
+}
+
+// 解法二 滑动窗口
+func maxTurbulenceSize1(arr []int) int {
+ var maxLength int
+ if len(arr) == 2 && arr[0] != arr[1] {
+ maxLength = 2
+ } else {
+ maxLength = 1
+ }
+ left := 0
+ for right := 2; right < len(arr); right++ {
+ if arr[right] == arr[right-1] {
+ left = right
+ } else if (arr[right]-arr[right-1])^(arr[right-1]-arr[right-2]) >= 0 {
+ left = right - 1
+ }
+ maxLength = max(maxLength, right-left+1)
+ }
+ return maxLength
+}
+
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0900~0999/0977.Squares-of-a-Sorted-Array/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0900~0999/0979.Distribute-Coins-in-Binary-Tree/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0979.Distribute-Coins-in-Binary-Tree.md b/website/content/ChapterFour/0900~0999/0979.Distribute-Coins-in-Binary-Tree.md
similarity index 90%
rename from website/content/ChapterFour/0979.Distribute-Coins-in-Binary-Tree.md
rename to website/content/ChapterFour/0900~0999/0979.Distribute-Coins-in-Binary-Tree.md
index ac98a4523..c76f68080 100755
--- a/website/content/ChapterFour/0979.Distribute-Coins-in-Binary-Tree.md
+++ b/website/content/ChapterFour/0900~0999/0979.Distribute-Coins-in-Binary-Tree.md
@@ -93,4 +93,11 @@ func distributeCoinsDFS(root *TreeNode, res *int) int {
return left + right + root.Val - 1
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0900~0999/0978.Longest-Turbulent-Subarray/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0900~0999/0980.Unique-Paths-III/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0980.Unique-Paths-III.md b/website/content/ChapterFour/0900~0999/0980.Unique-Paths-III.md
similarity index 90%
rename from website/content/ChapterFour/0980.Unique-Paths-III.md
rename to website/content/ChapterFour/0900~0999/0980.Unique-Paths-III.md
index 94f53c18e..cd74994ff 100755
--- a/website/content/ChapterFour/0980.Unique-Paths-III.md
+++ b/website/content/ChapterFour/0900~0999/0980.Unique-Paths-III.md
@@ -128,4 +128,11 @@ func findUniquePathIII(board [][]int, visited [][]bool, path []int, empty, start
return
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0900~0999/0979.Distribute-Coins-in-Binary-Tree/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0900~0999/0981.Time-Based-Key-Value-Store/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0981.Time-Based-Key-Value-Store.md b/website/content/ChapterFour/0900~0999/0981.Time-Based-Key-Value-Store.md
similarity index 92%
rename from website/content/ChapterFour/0981.Time-Based-Key-Value-Store.md
rename to website/content/ChapterFour/0900~0999/0981.Time-Based-Key-Value-Store.md
index a598ed752..4ef63e1d7 100755
--- a/website/content/ChapterFour/0981.Time-Based-Key-Value-Store.md
+++ b/website/content/ChapterFour/0900~0999/0981.Time-Based-Key-Value-Store.md
@@ -121,4 +121,11 @@ func (t TimeMap) Get(key string, timestamp int) string {
* param_2 := obj.Get(key,timestamp);
*/
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0900~0999/0980.Unique-Paths-III/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0900~0999/0984.String-Without-AAA-or-BBB/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0984.String-Without-AAA-or-BBB.md b/website/content/ChapterFour/0900~0999/0984.String-Without-AAA-or-BBB.md
similarity index 83%
rename from website/content/ChapterFour/0984.String-Without-AAA-or-BBB.md
rename to website/content/ChapterFour/0900~0999/0984.String-Without-AAA-or-BBB.md
index cccb67b22..df90e6f04 100755
--- a/website/content/ChapterFour/0984.String-Without-AAA-or-BBB.md
+++ b/website/content/ChapterFour/0900~0999/0984.String-Without-AAA-or-BBB.md
@@ -90,4 +90,11 @@ func strWithout3a3b(A int, B int) string {
return ans
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0900~0999/0981.Time-Based-Key-Value-Store/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0900~0999/0985.Sum-of-Even-Numbers-After-Queries/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0985.Sum-of-Even-Numbers-After-Queries.md b/website/content/ChapterFour/0900~0999/0985.Sum-of-Even-Numbers-After-Queries.md
similarity index 86%
rename from website/content/ChapterFour/0985.Sum-of-Even-Numbers-After-Queries.md
rename to website/content/ChapterFour/0900~0999/0985.Sum-of-Even-Numbers-After-Queries.md
index 8811079ba..07f6c748e 100644
--- a/website/content/ChapterFour/0985.Sum-of-Even-Numbers-After-Queries.md
+++ b/website/content/ChapterFour/0900~0999/0985.Sum-of-Even-Numbers-After-Queries.md
@@ -69,4 +69,11 @@ func sumEvenAfterQueries(A []int, queries [][]int) []int {
return res
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0900~0999/0984.String-Without-AAA-or-BBB/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0900~0999/0986.Interval-List-Intersections/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0986.Interval-List-Intersections.md b/website/content/ChapterFour/0900~0999/0986.Interval-List-Intersections.md
similarity index 84%
rename from website/content/ChapterFour/0986.Interval-List-Intersections.md
rename to website/content/ChapterFour/0900~0999/0986.Interval-List-Intersections.md
index d1a463415..304c9ce37 100644
--- a/website/content/ChapterFour/0986.Interval-List-Intersections.md
+++ b/website/content/ChapterFour/0900~0999/0986.Interval-List-Intersections.md
@@ -70,4 +70,11 @@ func intervalIntersection(A []Interval, B []Interval) []Interval {
return res
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0900~0999/0985.Sum-of-Even-Numbers-After-Queries/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0900~0999/0987.Vertical-Order-Traversal-of-a-Binary-Tree/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0900~0999/0987.Vertical-Order-Traversal-of-a-Binary-Tree.md b/website/content/ChapterFour/0900~0999/0987.Vertical-Order-Traversal-of-a-Binary-Tree.md
new file mode 100644
index 000000000..aba6488b5
--- /dev/null
+++ b/website/content/ChapterFour/0900~0999/0987.Vertical-Order-Traversal-of-a-Binary-Tree.md
@@ -0,0 +1,143 @@
+# [987. Vertical Order Traversal of a Binary Tree](https://leetcode.com/problems/vertical-order-traversal-of-a-binary-tree/)
+
+
+## 题目
+
+Given the `root` of a binary tree, calculate the **vertical order traversal** of the binary tree.
+
+For each node at position `(row, col)`, its left and right children will be at positions `(row + 1, col - 1)` and `(row + 1, col + 1)` respectively. The root of the tree is at `(0, 0)`.
+
+The **vertical order traversal** of a binary tree is a list of top-to-bottom orderings for each column index starting from the leftmost column and ending on the rightmost column. There may be multiple nodes in the same row and same column. In such a case, sort these nodes by their values.
+
+Return *the **vertical order traversal** of the binary tree*.
+
+**Example 1:**
+
+
+
+```
+Input: root = [3,9,20,null,null,15,7]
+Output: [[9],[3,15],[20],[7]]
+Explanation:
+Column -1: Only node 9 is in this column.
+Column 0: Nodes 3 and 15 are in this column in that order from top to bottom.
+Column 1: Only node 20 is in this column.
+Column 2: Only node 7 is in this column.
+```
+
+**Example 2:**
+
+
+
+```
+Input: root = [1,2,3,4,5,6,7]
+Output: [[4],[2],[1,5,6],[3],[7]]
+Explanation:
+Column -2: Only node 4 is in this column.
+Column -1: Only node 2 is in this column.
+Column 0: Nodes 1, 5, and 6 are in this column.
+ 1 is at the top, so it comes first.
+ 5 and 6 are at the same position (2, 0), so we order them by their value, 5 before 6.
+Column 1: Only node 3 is in this column.
+Column 2: Only node 7 is in this column.
+
+```
+
+**Example 3:**
+
+
+
+```
+Input: root = [1,2,3,4,6,5,7]
+Output: [[4],[2],[1,5,6],[3],[7]]
+Explanation:
+This case is the exact same as example 2, but with nodes 5 and 6 swapped.
+Note that the solution remains the same since 5 and 6 are in the same location and should be ordered by their values.
+
+```
+
+**Constraints:**
+
+- The number of nodes in the tree is in the range `[1, 1000]`.
+- `0 <= Node.val <= 1000`
+
+## 题目大意
+
+给你二叉树的根结点 root ，请你设计算法计算二叉树的 垂序遍历 序列。
+
+对位于 (row, col) 的每个结点而言，其左右子结点分别位于 (row + 1, col - 1) 和 (row + 1, col + 1) 。树的根结点位于 (0, 0) 。二叉树的 垂序遍历 从最左边的列开始直到最右边的列结束，按列索引每一列上的所有结点，形成一个按出现位置从上到下排序的有序列表。如果同行同列上有多个结点，则按结点的值从小到大进行排序。返回二叉树的 垂序遍历 序列。
+
+## 解题思路
+
+- 题目要求按照一列一列的遍历二叉树。需要解决 2 个问题。第一个问题，二叉树上每个结点的二维坐标如何计算。第二个问题，同一个二维坐标点上摞起来多个结点，需要按照从小到大的顺序排序，如例子二和例子三，同一个二维坐标点 (2，0) 上，摞了 2 个不同的结点。
+- 先解决第一个问题，由于题目要求根结点是 (0，0) ，即根结点是坐标原点，它的左子树的 x 坐标都是负数，它的右子树的 x 坐标都是正数。按照先序遍历，就可以将这些结点的二维坐标计算出来。再进行一次排序，按照 x 坐标从小到大排序，坐标相同的情况对应着结点摞起来的情况，摞起来的结点按照 val 值的大小从小到大排序。这样在 x 轴方向，所有结点就排列好了。排序完成，也顺便解决了第二个问题。
+- 最后一步只需要扫描一遍这个排好序的数组，按照列的顺序，依次将同一列的结点打包至一个一维数组中。最终输出的二维数组即为题目所求。
+
+## 代码
+
+```go
+package leetcode
+
+import (
+ "math"
+ "sort"
+
+ "github.com/halfrost/leetcode-go/structures"
+)
+
+// TreeNode define
+type TreeNode = structures.TreeNode
+
+/**
+ * Definition for a binary tree node.
+ * type TreeNode struct {
+ * Val int
+ * Left *TreeNode
+ * Right *TreeNode
+ * }
+ */
+
+type node struct {
+ x, y, val int
+}
+
+func verticalTraversal(root *TreeNode) [][]int {
+ var dfs func(root *TreeNode, x, y int)
+ var nodes []node
+ dfs = func(root *TreeNode, x, y int) {
+ if root == nil {
+ return
+ }
+ nodes = append(nodes, node{x, y, root.Val})
+ dfs(root.Left, x+1, y-1)
+ dfs(root.Right, x+1, y+1)
+ }
+ dfs(root, 0, 0)
+
+ sort.Slice(nodes, func(i, j int) bool {
+ a, b := nodes[i], nodes[j]
+ return a.y < b.y || a.y == b.y &&
+ (a.x < b.x || a.x == b.x && a.val < b.val)
+ })
+
+ var res [][]int
+ lastY := math.MinInt32
+ for _, node := range nodes {
+ if lastY != node.y {
+ res = append(res, []int{node.val})
+ lastY = node.y
+ } else {
+ res[len(res)-1] = append(res[len(res)-1], node.val)
+ }
+ }
+ return res
+}
+
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0900~0999/0986.Interval-List-Intersections/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0900~0999/0989.Add-to-Array-Form-of-Integer/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0900~0999/0989.Add-to-Array-Form-of-Integer.md b/website/content/ChapterFour/0900~0999/0989.Add-to-Array-Form-of-Integer.md
new file mode 100644
index 000000000..ab9a6d8a2
--- /dev/null
+++ b/website/content/ChapterFour/0900~0999/0989.Add-to-Array-Form-of-Integer.md
@@ -0,0 +1,91 @@
+# [989. Add to Array-Form of Integer](https://leetcode.com/problems/add-to-array-form-of-integer/)
+
+## 题目
+
+For a non-negative integer `X`, the *array-form of `X`* is an array of its digits in left to right order. For example, if `X = 1231`, then the array form is `[1,2,3,1]`.
+
+Given the array-form `A` of a non-negative integer `X`, return the array-form of the integer `X+K`.
+
+**Example 1:**
+
+```
+Input: A = [1,2,0,0], K = 34
+Output: [1,2,3,4]
+Explanation: 1200 + 34 = 1234
+```
+
+**Example 2:**
+
+```
+Input: A = [2,7,4], K = 181
+Output: [4,5,5]
+Explanation: 274 + 181 = 455
+```
+
+**Example 3:**
+
+```
+Input: A = [2,1,5], K = 806
+Output: [1,0,2,1]
+Explanation: 215 + 806 = 1021
+```
+
+**Example 4:**
+
+```
+Input: A = [9,9,9,9,9,9,9,9,9,9], K = 1
+Output: [1,0,0,0,0,0,0,0,0,0,0]
+Explanation: 9999999999 + 1 = 10000000000
+```
+
+**Note：**
+
+1. `1 <= A.length <= 10000`
+2. `0 <= A[i] <= 9`
+3. `0 <= K <= 10000`
+4. If `A.length > 1`, then `A[0] != 0`
+
+## 题目大意
+
+对于非负整数 X 而言，X 的数组形式是每位数字按从左到右的顺序形成的数组。例如，如果 X = 1231，那么其数组形式为 [1,2,3,1]。给定非负整数 X 的数组形式 A，返回整数 X+K 的数组形式。
+
+## 解题思路
+
+- 简单题，计算 2 个非负整数的和。累加过程中不断的进位，最终输出到数组中记得需要逆序，即数字的高位排在数组下标较小的位置。
+
+## 代码
+
+```go
+package leetcode
+
+func addToArrayForm(A []int, K int) []int {
+ res := []int{}
+ for i := len(A) - 1; i >= 0; i-- {
+ sum := A[i] + K%10
+ K /= 10
+ if sum >= 10 {
+ K++
+ sum -= 10
+ }
+ res = append(res, sum)
+ }
+ for ; K > 0; K /= 10 {
+ res = append(res, K%10)
+ }
+ reverse(res)
+ return res
+}
+
+func reverse(A []int) {
+ for i, n := 0, len(A); i < n/2; i++ {
+ A[i], A[n-1-i] = A[n-1-i], A[i]
+ }
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0900~0999/0987.Vertical-Order-Traversal-of-a-Binary-Tree/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0900~0999/0990.Satisfiability-of-Equality-Equations/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0990.Satisfiability-of-Equality-Equations.md b/website/content/ChapterFour/0900~0999/0990.Satisfiability-of-Equality-Equations.md
similarity index 87%
rename from website/content/ChapterFour/0990.Satisfiability-of-Equality-Equations.md
rename to website/content/ChapterFour/0900~0999/0990.Satisfiability-of-Equality-Equations.md
index 75f33db2c..bca338729 100755
--- a/website/content/ChapterFour/0990.Satisfiability-of-Equality-Equations.md
+++ b/website/content/ChapterFour/0900~0999/0990.Satisfiability-of-Equality-Equations.md
@@ -72,7 +72,7 @@ Return `true` if and only if it is possible to assign integers to variable nam
package leetcode
import (
- "github.com/halfrost/LeetCode-Go/template"
+ "github.com/halfrost/leetcode-go/template"
)
func equationsPossible(equations []string) bool {
@@ -96,4 +96,11 @@ func equationsPossible(equations []string) bool {
return true
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0900~0999/0989.Add-to-Array-Form-of-Integer/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0900~0999/0991.Broken-Calculator/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0900~0999/0991.Broken-Calculator.md b/website/content/ChapterFour/0900~0999/0991.Broken-Calculator.md
new file mode 100644
index 000000000..e5dfd8dc9
--- /dev/null
+++ b/website/content/ChapterFour/0900~0999/0991.Broken-Calculator.md
@@ -0,0 +1,90 @@
+# [991. Broken Calculator](https://leetcode.com/problems/broken-calculator/)
+
+
+## 题目
+
+On a broken calculator that has a number showing on its display, we can perform two operations:
+
+- **Double**: Multiply the number on the display by 2, or;
+- **Decrement**: Subtract 1 from the number on the display.
+
+Initially, the calculator is displaying the number `X`.
+
+Return the minimum number of operations needed to display the number `Y`.
+
+**Example 1:**
+
+```
+Input: X = 2, Y = 3
+Output: 2
+Explanation: Use double operation and then decrement operation {2 -> 4 -> 3}.
+```
+
+**Example 2:**
+
+```
+Input: X = 5, Y = 8
+Output: 2
+Explanation: Use decrement and then double {5 -> 4 -> 8}.
+```
+
+**Example 3:**
+
+```
+Input: X = 3, Y = 10
+Output: 3
+Explanation: Use double, decrement and double {3 -> 6 -> 5 -> 10}.
+```
+
+**Example 4:**
+
+```
+Input: X = 1024, Y = 1
+Output: 1023
+Explanation: Use decrement operations 1023 times.
+```
+
+**Note:**
+
+1. `1 <= X <= 10^9`
+2. `1 <= Y <= 10^9`
+
+## 题目大意
+
+在显示着数字的坏计算器上，我们可以执行以下两种操作：
+
+- 双倍（Double）：将显示屏上的数字乘 2；
+- 递减（Decrement）：将显示屏上的数字减 1 。
+
+最初，计算器显示数字 X。返回显示数字 Y 所需的最小操作数。
+
+## 解题思路
+
+- 看到本题的数据规模非常大，`10^9`，算法只能采用 `O(sqrt(n))`、`O(log n)`、`O(1)` 的算法。`O(sqrt(n))` 和 `O(1)` 在本题中是不可能的。所以按照数据规模来估计，本题只能尝试 `O(log n)` 的算法。`O(log n)` 的算法有二分搜索，不过本题不太符合二分搜索算法背景。题目中明显出现乘 2，这很明显是可以达到 `O(log n)` 的。最终确定解题思路是数学方法，循环中会用到乘 2 或者除 2 的计算。
+- 既然出现了乘 2 和减一的操作，很容易考虑到奇偶性上。题目要求最小操作数，贪心思想，应该尽可能多的使用除 2 操作，使得 Y 和 X 大小差不多，最后再利用加一操作微调。只要 Y 比 X 大就执行除法操作。当然这里要考虑一次奇偶性，如果 Y 是奇数，先加一变成偶数再除二；如果 Y 是偶数，直接除二。如此操作直到 Y 不大于 X，最后执行 `X-Y` 次加法操作微调即可。
+
+## 代码
+
+```go
+package leetcode
+
+func brokenCalc(X int, Y int) int {
+ res := 0
+ for Y > X {
+ res++
+ if Y&1 == 1 {
+ Y++
+ } else {
+ Y /= 2
+ }
+ }
+ return res + X - Y
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0900~0999/0990.Satisfiability-of-Equality-Equations/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0900~0999/0992.Subarrays-with-K-Different-Integers/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0992.Subarrays-with-K-Different-Integers.md b/website/content/ChapterFour/0900~0999/0992.Subarrays-with-K-Different-Integers.md
similarity index 90%
rename from website/content/ChapterFour/0992.Subarrays-with-K-Different-Integers.md
rename to website/content/ChapterFour/0900~0999/0992.Subarrays-with-K-Different-Integers.md
index 33155fa22..d9c975512 100644
--- a/website/content/ChapterFour/0992.Subarrays-with-K-Different-Integers.md
+++ b/website/content/ChapterFour/0900~0999/0992.Subarrays-with-K-Different-Integers.md
@@ -110,4 +110,11 @@ func subarraysWithKDistinctSlideWindow(A []int, K int) int {
return res
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0900~0999/0991.Broken-Calculator/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0900~0999/0993.Cousins-in-Binary-Tree/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0993.Cousins-in-Binary-Tree.md b/website/content/ChapterFour/0900~0999/0993.Cousins-in-Binary-Tree.md
similarity index 91%
rename from website/content/ChapterFour/0993.Cousins-in-Binary-Tree.md
rename to website/content/ChapterFour/0900~0999/0993.Cousins-in-Binary-Tree.md
index 1fd4a366a..8a75f3e20 100755
--- a/website/content/ChapterFour/0993.Cousins-in-Binary-Tree.md
+++ b/website/content/ChapterFour/0900~0999/0993.Cousins-in-Binary-Tree.md
@@ -160,4 +160,11 @@ func dfsCousins(root *TreeNode, val, depth, last int, parent, res *int) {
dfsCousins(root.Right, val, depth, root.Val, parent, res)
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0900~0999/0992.Subarrays-with-K-Different-Integers/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0900~0999/0995.Minimum-Number-of-K-Consecutive-Bit-Flips/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0995.Minimum-Number-of-K-Consecutive-Bit-Flips.md b/website/content/ChapterFour/0900~0999/0995.Minimum-Number-of-K-Consecutive-Bit-Flips.md
similarity index 92%
rename from website/content/ChapterFour/0995.Minimum-Number-of-K-Consecutive-Bit-Flips.md
rename to website/content/ChapterFour/0900~0999/0995.Minimum-Number-of-K-Consecutive-Bit-Flips.md
index 768d37be9..31066661c 100755
--- a/website/content/ChapterFour/0995.Minimum-Number-of-K-Consecutive-Bit-Flips.md
+++ b/website/content/ChapterFour/0900~0999/0995.Minimum-Number-of-K-Consecutive-Bit-Flips.md
@@ -94,4 +94,11 @@ func minKBitFlips(A []int, K int) int {
return count
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0900~0999/0993.Cousins-in-Binary-Tree/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0900~0999/0996.Number-of-Squareful-Arrays/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0996.Number-of-Squareful-Arrays.md b/website/content/ChapterFour/0900~0999/0996.Number-of-Squareful-Arrays.md
similarity index 86%
rename from website/content/ChapterFour/0996.Number-of-Squareful-Arrays.md
rename to website/content/ChapterFour/0900~0999/0996.Number-of-Squareful-Arrays.md
index 5a420a2c0..c305fa181 100755
--- a/website/content/ChapterFour/0996.Number-of-Squareful-Arrays.md
+++ b/website/content/ChapterFour/0900~0999/0996.Number-of-Squareful-Arrays.md
@@ -104,4 +104,11 @@ func checkSquare(num int) bool {
return false
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0900~0999/0995.Minimum-Number-of-K-Consecutive-Bit-Flips/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0900~0999/0997.Find-the-Town-Judge/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0900~0999/0997.Find-the-Town-Judge.md b/website/content/ChapterFour/0900~0999/0997.Find-the-Town-Judge.md
new file mode 100644
index 000000000..495f18cad
--- /dev/null
+++ b/website/content/ChapterFour/0900~0999/0997.Find-the-Town-Judge.md
@@ -0,0 +1,94 @@
+# [997. Find the Town Judge](https://leetcode.com/problems/find-the-town-judge/)
+
+## 题目
+
+In a town, there are n people labeled from 1 to n. There is a rumor that one of these people is secretly the town judge.
+
+If the town judge exists, then:
+
+- The town judge trusts nobody.
+- Everybody (except for the town judge) trusts the town judge.
+- There is exactly one person that satisfies properties 1 and 2.
+
+You are given an array trust where trust[i] = [ai, bi] representing that the person labeled ai trusts the person labeled bi.
+
+Return the label of the town judge if the town judge exists and can be identified, or return -1 otherwise.
+
+**Example 1**:
+
+ Input: n = 2, trust = [[1,2]]
+ Output: 2
+
+**Example 2**:
+
+ Input: n = 3, trust = [[1,3],[2,3]]
+ Output: 3
+
+**Example 3**:
+
+ Input: n = 3, trust = [[1,3],[2,3],[3,1]]
+ Output: -1
+
+**Constraints:**
+
+- 1 <= n <= 1000
+- 0 <= trust.length <= 10000
+- trust[i].length == 2
+- All the pairs of trust are unique.
+- ai != bi
+- 1 <= ai, bi <= n
+
+## 题目大意
+
+小镇里有 n 个人，按从 1 到 n 的顺序编号。传言称，这些人中有一个暗地里是小镇法官。
+
+如果小镇法官真的存在，那么：
+
+- 小镇法官不会信任任何人。
+- 每个人（除了小镇法官）都信任这位小镇法官。
+- 只有一个人同时满足属性 1 和属性 2 。
+
+给你一个数组 trust ，其中 trust[i] = [ai, bi] 表示编号为 ai 的人信任编号为 bi 的人。
+
+如果小镇法官存在并且可以确定他的身份，请返回该法官的编号；否则，返回 -1 。
+
+## 解题思路
+
+入度和出度统计
+
+- 被人信任定义为入度, 信任别人定义为出度
+- 如果 1-n 之间有数字 x 的入度为 n - 1，出度为 0，则返回 x
+
+## 代码
+
+```go
+package leetcode
+
+func findJudge(n int, trust [][]int) int {
+ if n == 1 && len(trust) == 0 {
+ return 1
+ }
+ judges := make(map[int]int)
+ for _, v := range trust {
+ judges[v[1]] += 1
+ }
+ for _, v := range trust {
+ if _, ok := judges[v[0]]; ok {
+ delete(judges, v[0])
+ }
+ }
+ for k, v := range judges {
+ if v == n-1 {
+ return k
+ }
+ }
+ return -1
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0900~0999/0996.Number-of-Squareful-Arrays/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0900~0999/0999.Available-Captures-for-Rook/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0999.Available-Captures-for-Rook.md b/website/content/ChapterFour/0900~0999/0999.Available-Captures-for-Rook.md
similarity index 91%
rename from website/content/ChapterFour/0999.Available-Captures-for-Rook.md
rename to website/content/ChapterFour/0900~0999/0999.Available-Captures-for-Rook.md
index 47e6d127e..8797ca961 100644
--- a/website/content/ChapterFour/0999.Available-Captures-for-Rook.md
+++ b/website/content/ChapterFour/0900~0999/0999.Available-Captures-for-Rook.md
@@ -96,4 +96,11 @@ func caputure(board [][]byte, x, y int, bx, by int) int {
return 0
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0900~0999/0997.Find-the-Town-Judge/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1000~1099/1002.Find-Common-Characters/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0900~0999/_index.md b/website/content/ChapterFour/0900~0999/_index.md
new file mode 100644
index 000000000..d2021683f
--- /dev/null
+++ b/website/content/ChapterFour/0900~0999/_index.md
@@ -0,0 +1,5 @@
+---
+bookCollapseSection: true
+weight: 20
+---
+
diff --git a/website/content/ChapterFour/0924.Minimize-Malware-Spread.md b/website/content/ChapterFour/0924.Minimize-Malware-Spread.md
deleted file mode 100755
index ce5c89702..000000000
--- a/website/content/ChapterFour/0924.Minimize-Malware-Spread.md
+++ /dev/null
@@ -1,105 +0,0 @@
-# [924. Minimize Malware Spread](https://leetcode.com/problems/minimize-malware-spread/)
-
-
-## 题目
-
-In a network of nodes, each node `i` is directly connected to another node `j` if and only if `graph[i][j] = 1`.
-
-Some nodes `initial` are initially infected by malware. Whenever two nodes are directly connected and at least one of those two nodes is infected by malware, both nodes will be infected by malware. This spread of malware will continue until no more nodes can be infected in this manner.
-
-Suppose `M(initial)` is the final number of nodes infected with malware in the entire network, after the spread of malware stops.
-
-We will remove one node from the initial list. Return the node that if removed, would minimize `M(initial)`. If multiple nodes could be removed to minimize `M(initial)`, return such a node with the smallest index.
-
-Note that if a node was removed from the `initial` list of infected nodes, it may still be infected later as a result of the malware spread.
-
-**Example 1**:
-
- Input: graph = [[1,1,0],[1,1,0],[0,0,1]], initial = [0,1]
- Output: 0
-
-**Example 2**:
-
- Input: graph = [[1,0,0],[0,1,0],[0,0,1]], initial = [0,2]
- Output: 0
-
-**Example 3**:
-
- Input: graph = [[1,1,1],[1,1,1],[1,1,1]], initial = [1,2]
- Output: 1
-
-**Note**:
-
-1. `1 < graph.length = graph[0].length <= 300`
-2. `0 <= graph[i][j] == graph[j][i] <= 1`
-3. `graph[i][i] = 1`
-4. `1 <= initial.length < graph.length`
-5. `0 <= initial[i] < graph.length`
-
-
-## 题目大意
-
-在节点网络中，只有当 graph[i][j] = 1 时，每个节点 i 能够直接连接到另一个节点 j。一些节点 initial 最初被恶意软件感染。只要两个节点直接连接，且其中至少一个节点受到恶意软件的感染，那么两个节点都将被恶意软件感染。这种恶意软件的传播将继续，直到没有更多的节点可以被这种方式感染。假设 M(initial) 是在恶意软件停止传播之后，整个网络中感染恶意软件的最终节点数。我们可以从初始列表中删除一个节点。如果移除这一节点将最小化 M(initial)， 则返回该节点。如果有多个节点满足条件，就返回索引最小的节点。请注意，如果某个节点已从受感染节点的列表 initial 中删除，它以后可能仍然因恶意软件传播而受到感染。
-
-
-提示：
-
-- 1 < graph.length = graph[0].length <= 300
-- 0 <= graph[i][j] == graph[j][i] <= 1
-- graph[i][i] = 1
-- 1 <= initial.length < graph.length
-- 0 <= initial[i] < graph.length
-
-
-## 解题思路
-
-
-- 给出一个节点之间的关系图，如果两个节点是连通的，那么病毒软件就会感染到连通的所有节点。现在如果想移除一个病毒节点，能最大减少感染，请问移除哪个节点？如果多个节点都能减少感染量，优先移除序号偏小的那个节点。
-- 这一题一看就是考察的并查集。利用节点的连通关系，把题目中给的所有节点都 `union()` 起来，然后依次统计每个集合内有多少个点。最后扫描一次 initial 数组，选出这个数组中节点小的并且所在集合节点多，这个节点就是最终答案。
-
-
-## 代码
-
-```go
-
-package leetcode
-
-import (
- "math"
-
- "github.com/halfrost/LeetCode-Go/template"
-)
-
-func minMalwareSpread(graph [][]int, initial []int) int {
- if len(initial) == 0 {
- return 0
- }
- uf, minIndex, count, countMap := template.UnionFind{}, 0, math.MinInt64, map[int]int{}
- uf.Init(len(graph))
- for i := range graph {
- for j := range graph[i] {
- if i == j {
- break
- }
- if graph[i][j] == 1 {
- uf.Union(i, j)
- }
- }
- }
- for i := 0; i < len(graph); i++ {
- countMap[uf.Find(i)]++
- }
- for _, v := range initial {
- tmp := countMap[uf.Find(v)]
- if count == tmp && minIndex > v {
- minIndex = v
- }
- if count < tmp {
- minIndex = v
- count = tmp
- }
- }
- return minIndex
-}
-
-```
\ No newline at end of file
diff --git a/website/content/ChapterFour/0978.Longest-Turbulent-Subarray.md b/website/content/ChapterFour/0978.Longest-Turbulent-Subarray.md
deleted file mode 100755
index e4b8bea71..000000000
--- a/website/content/ChapterFour/0978.Longest-Turbulent-Subarray.md
+++ /dev/null
@@ -1,109 +0,0 @@
-# [978. Longest Turbulent Subarray](https://leetcode.com/problems/longest-turbulent-subarray/)
-
-## 题目
-
-A subarray `A[i], A[i+1], ..., A[j]` of `A` is said to be *turbulent* if and only if:
-
-- For `i <= k < j`, `A[k] > A[k+1]` when `k` is odd, and `A[k] < A[k+1]` when `k` is even;
-- **OR**, for `i <= k < j`, `A[k] > A[k+1]` when `k` is even, and `A[k] < A[k+1]` when `k` is odd.
-
-That is, the subarray is turbulent if the comparison sign flips between each adjacent pair of elements in the subarray.
-
-Return the **length** of a maximum size turbulent subarray of A.
-
-**Example 1**:
-
- Input: [9,4,2,10,7,8,8,1,9]
- Output: 5
- Explanation: (A[1] > A[2] < A[3] > A[4] < A[5])
-
-**Example 2**:
-
- Input: [4,8,12,16]
- Output: 2
-
-**Example 3**:
-
- Input: [100]
- Output: 1
-
-**Note**:
-
-1. `1 <= A.length <= 40000`
-2. `0 <= A[i] <= 10^9`
-
-
-## 题目大意
-
-
-当 A 的子数组 A[i], A[i+1], ..., A[j] 满足下列条件时，我们称其为湍流子数组：
-
-若 i <= k < j，当 k 为奇数时， A[k] > A[k+1]，且当 k 为偶数时，A[k] < A[k+1]；
-或 若 i <= k < j，当 k 为偶数时，A[k] > A[k+1] ，且当 k 为奇数时， A[k] < A[k+1]。
-也就是说，如果比较符号在子数组中的每个相邻元素对之间翻转，则该子数组是湍流子数组。
-
-返回 A 的最大湍流子数组的长度。
-
-提示：
-
-- 1 <= A.length <= 40000
-- 0 <= A[i] <= 10^9
-
-
-
-## 解题思路
-
-
-- 给出一个数组，要求找出“摆动数组”的最大长度。所谓“摆动数组”的意思是，元素一大一小间隔的。
-- 这一题可以用滑动窗口来解答。用一个变量记住下次出现的元素需要大于还是需要小于前一个元素。也可以用模拟的方法，用两个变量分别记录上升和下降数字的长度。一旦元素相等了，上升和下降数字长度都置为 1，其他时候按照上升和下降的关系增加队列长度即可，最后输出动态维护的最长长度。
-
-
-## 代码
-
-```go
-
-package leetcode
-
-// 解法一 模拟法
-func maxTurbulenceSize(A []int) int {
- inc, dec := 1, 1
- maxLen := min(1, len(A))
- for i := 1; i < len(A); i++ {
- if A[i-1] < A[i] {
- inc = dec + 1
- dec = 1
- } else if A[i-1] > A[i] {
- dec = inc + 1
- inc = 1
- } else {
- inc = 1
- dec = 1
- }
- maxLen = max(maxLen, max(inc, dec))
- }
- return maxLen
-}
-
-// 解法二 滑动窗口
-func maxTurbulenceSize1(A []int) int {
- if len(A) == 1 {
- return 1
- }
- // flag > 0 代表下一个数要大于前一个数，flag < 0 代表下一个数要小于前一个数
- res, left, right, flag, lastNum := 0, 0, 0, A[1]-A[0], A[0]
- for left < len(A) {
- if right < len(A)-1 && ((A[right+1] > lastNum && flag > 0) || (A[right+1] < lastNum && flag < 0) || (right == left)) {
- right++
- flag = lastNum - A[right]
- lastNum = A[right]
- } else {
- if right != left && flag != 0 {
- res = max(res, right-left+1)
- }
- left++
- }
- }
- return max(res, 1)
-}
-
-```
\ No newline at end of file
diff --git a/website/content/ChapterFour/1002.Find-Common-Characters.md b/website/content/ChapterFour/1000~1099/1002.Find-Common-Characters.md
similarity index 85%
rename from website/content/ChapterFour/1002.Find-Common-Characters.md
rename to website/content/ChapterFour/1000~1099/1002.Find-Common-Characters.md
index 9b61e2050..2e1f62b4d 100755
--- a/website/content/ChapterFour/1002.Find-Common-Characters.md
+++ b/website/content/ChapterFour/1000~1099/1002.Find-Common-Characters.md
@@ -71,4 +71,11 @@ func commonChars(A []string) []string {
return result
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0900~0999/0999.Available-Captures-for-Rook/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1000~1099/1003.Check-If-Word-Is-Valid-After-Substitutions/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/1003.Check-If-Word-Is-Valid-After-Substitutions.md b/website/content/ChapterFour/1000~1099/1003.Check-If-Word-Is-Valid-After-Substitutions.md
similarity index 88%
rename from website/content/ChapterFour/1003.Check-If-Word-Is-Valid-After-Substitutions.md
rename to website/content/ChapterFour/1000~1099/1003.Check-If-Word-Is-Valid-After-Substitutions.md
index b423f1dc5..69a4c6786 100644
--- a/website/content/ChapterFour/1003.Check-If-Word-Is-Valid-After-Substitutions.md
+++ b/website/content/ChapterFour/1000~1099/1003.Check-If-Word-Is-Valid-After-Substitutions.md
@@ -104,4 +104,11 @@ func isValid1003(S string) bool {
return len(stack) == 0
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1000~1099/1002.Find-Common-Characters/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1000~1099/1004.Max-Consecutive-Ones-III/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/1004.Max-Consecutive-Ones-III.md b/website/content/ChapterFour/1000~1099/1004.Max-Consecutive-Ones-III.md
similarity index 75%
rename from website/content/ChapterFour/1004.Max-Consecutive-Ones-III.md
rename to website/content/ChapterFour/1000~1099/1004.Max-Consecutive-Ones-III.md
index ba6eb873d..8731490ef 100644
--- a/website/content/ChapterFour/1004.Max-Consecutive-Ones-III.md
+++ b/website/content/ChapterFour/1000~1099/1004.Max-Consecutive-Ones-III.md
@@ -77,4 +77,18 @@ func longestOnes(A []int, K int) int {
return res
}
-```
\ No newline at end of file
+func max(a int, b int) int {
+ if a > b {
+ return a
+ }
+ return b
+}
+
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1000~1099/1003.Check-If-Word-Is-Valid-After-Substitutions/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1000~1099/1005.Maximize-Sum-Of-Array-After-K-Negations/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/1005.Maximize-Sum-Of-Array-After-K-Negations.md b/website/content/ChapterFour/1000~1099/1005.Maximize-Sum-Of-Array-After-K-Negations.md
similarity index 84%
rename from website/content/ChapterFour/1005.Maximize-Sum-Of-Array-After-K-Negations.md
rename to website/content/ChapterFour/1000~1099/1005.Maximize-Sum-Of-Array-After-K-Negations.md
index 1293b74f0..7cb38aaab 100644
--- a/website/content/ChapterFour/1005.Maximize-Sum-Of-Array-After-K-Negations.md
+++ b/website/content/ChapterFour/1000~1099/1005.Maximize-Sum-Of-Array-After-K-Negations.md
@@ -80,4 +80,11 @@ func largestSumAfterKNegations(A []int, K int) int {
return sum
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1000~1099/1004.Max-Consecutive-Ones-III/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1000~1099/1006.Clumsy-Factorial/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/1000~1099/1006.Clumsy-Factorial.md b/website/content/ChapterFour/1000~1099/1006.Clumsy-Factorial.md
new file mode 100644
index 000000000..737ec2205
--- /dev/null
+++ b/website/content/ChapterFour/1000~1099/1006.Clumsy-Factorial.md
@@ -0,0 +1,82 @@
+# [1006. Clumsy Factorial](https://leetcode.com/problems/clumsy-factorial/)
+
+
+## 题目
+
+Normally, the factorial of a positive integer `n` is the product of all positive integers less than or equal to `n`. For example, `factorial(10) = 10 * 9 * 8 * 7 * 6 * 5 * 4 * 3 * 2 * 1`.
+
+We instead make a *clumsy factorial:* using the integers in decreasing order, we swap out the multiply operations for a fixed rotation of operations: multiply (*), divide (/), add (+) and subtract (-) in this order.
+
+For example, `clumsy(10) = 10 * 9 / 8 + 7 - 6 * 5 / 4 + 3 - 2 * 1`. However, these operations are still applied using the usual order of operations of arithmetic: we do all multiplication and division steps before any addition or subtraction steps, and multiplication and division steps are processed left to right.
+
+Additionally, the division that we use is *floor division* such that `10 * 9 / 8` equals `11`. This guarantees the result is an integer.
+
+`Implement the clumsy` function as defined above: given an integer `N`, it returns the clumsy factorial of `N`.
+
+**Example 1:**
+
+```
+Input:4
+Output: 7
+Explanation: 7 = 4 * 3 / 2 + 1
+```
+
+**Example 2:**
+
+```
+Input:10
+Output:12
+Explanation:12 = 10 * 9 / 8 + 7 - 6 * 5 / 4 + 3 - 2 * 1
+```
+
+**Note:**
+
+1. `1 <= N <= 10000`
+2. `2^31 <= answer <= 2^31 - 1` (The answer is guaranteed to fit within a 32-bit integer.)
+
+## 题目大意
+
+通常，正整数 n 的阶乘是所有小于或等于 n 的正整数的乘积。例如，factorial(10) = 10 * 9 * 8 * 7 * 6 * 5 * 4 * 3 * 2 * 1。相反，我们设计了一个笨阶乘 clumsy：在整数的递减序列中，我们以一个固定顺序的操作符序列来依次替换原有的乘法操作符：乘法(*)，除法(/)，加法(+)和减法(-)。例如，clumsy(10) = 10 * 9 / 8 + 7 - 6 * 5 / 4 + 3 - 2 * 1。然而，这些运算仍然使用通常的算术运算顺序：我们在任何加、减步骤之前执行所有的乘法和除法步骤，并且按从左到右处理乘法和除法步骤。另外，我们使用的除法是地板除法（floor division），所以 10 * 9 / 8 等于 11。这保证结果是一个整数。实现上面定义的笨函数：给定一个整数 N，它返回 N 的笨阶乘。
+
+## 解题思路
+
+- 按照题意，由于本题没有括号，所以先乘除后加减。4 个操作一组，先算乘法，再算除法，再算加法，最后算减法。减法也可以看成是加法，只是带负号的加法。
+
+## 代码
+
+```go
+package leetcode
+
+func clumsy(N int) int {
+ res, count, tmp, flag := 0, 1, N, false
+ for i := N - 1; i > 0; i-- {
+ count = count % 4
+ switch count {
+ case 1:
+ tmp = tmp * i
+ case 2:
+ tmp = tmp / i
+ case 3:
+ res = res + tmp
+ flag = true
+ tmp = -1
+ res = res + i
+ case 0:
+ flag = false
+ tmp = tmp * (i)
+ }
+ count++
+ }
+ if !flag {
+ res = res + tmp
+ }
+ return res
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1000~1099/1005.Maximize-Sum-Of-Array-After-K-Negations/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1000~1099/1009.Complement-of-Base-10-Integer/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/1000~1099/1009.Complement-of-Base-10-Integer.md b/website/content/ChapterFour/1000~1099/1009.Complement-of-Base-10-Integer.md
new file mode 100644
index 000000000..b448d6c2b
--- /dev/null
+++ b/website/content/ChapterFour/1000~1099/1009.Complement-of-Base-10-Integer.md
@@ -0,0 +1,74 @@
+# [1009. Complement of Base 10 Integer](https://leetcode.com/problems/complement-of-base-10-integer/)
+
+
+## 题目
+
+The **complement** of an integer is the integer you get when you flip all the `0`'s to `1`'s and all the `1`'s to `0`'s in its binary representation.
+
+- For example, The integer `5` is `"101"` in binary and its **complement** is `"010"` which is the integer `2`.
+
+Given an integer `n`, return *its complement*.
+
+**Example 1:**
+
+```
+Input: n = 5
+Output: 2
+Explanation: 5 is "101" in binary, with complement "010" in binary, which is 2 in base-10.
+
+```
+
+**Example 2:**
+
+```
+Input: n = 7
+Output: 0
+Explanation: 7 is "111" in binary, with complement "000" in binary, which is 0 in base-10.
+
+```
+
+**Example 3:**
+
+```
+Input: n = 10
+Output: 5
+Explanation: 10 is "1010" in binary, with complement "0101" in binary, which is 5 in base-10.
+
+```
+
+**Constraints:**
+
+- `0 <= n < 109`
+
+## 题目大意
+
+每个非负整数 N 都有其二进制表示。例如， 5 可以被表示为二进制 "101"，11 可以用二进制 "1011" 表示，依此类推。注意，除 N = 0 外，任何二进制表示中都不含前导零。
+
+二进制的反码表示是将每个 1 改为 0 且每个 0 变为 1。例如，二进制数 "101" 的二进制反码为 "010"。
+
+给你一个十进制数 N，请你返回其二进制表示的反码所对应的十进制整数。
+
+## 解题思路
+
+- 简单题。求一个十进制数的反码，只需要让该数和全 1 的数进行异或计算即可。所以本题重点在如何构造 mask 上。
+
+## 代码
+
+```go
+package leetcode
+
+func bitwiseComplement(n int) int {
+ mask := 1
+ for mask < n {
+ mask = (mask << 1) + 1
+ }
+ return mask ^ n
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1000~1099/1006.Clumsy-Factorial/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1000~1099/1010.Pairs-of-Songs-With-Total-Durations-Divisible-by-60/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/1000~1099/1010.Pairs-of-Songs-With-Total-Durations-Divisible-by-60.md b/website/content/ChapterFour/1000~1099/1010.Pairs-of-Songs-With-Total-Durations-Divisible-by-60.md
new file mode 100644
index 000000000..b8edb0ebb
--- /dev/null
+++ b/website/content/ChapterFour/1000~1099/1010.Pairs-of-Songs-With-Total-Durations-Divisible-by-60.md
@@ -0,0 +1,70 @@
+# [1010. Pairs of Songs With Total Durations Divisible by 60](https://leetcode.com/problems/pairs-of-songs-with-total-durations-divisible-by-60/)
+
+
+## 题目
+
+You are given a list of songs where the ith song has a duration of `time[i]` seconds.
+
+Return *the number of pairs of songs for which their total duration in seconds is divisible by* `60`. Formally, we want the number of indices `i`, `j` such that `i < j` with `(time[i] + time[j]) % 60 == 0`.
+
+**Example 1:**
+
+```
+Input: time = [30,20,150,100,40]
+Output: 3
+Explanation: Three pairs have a total duration divisible by 60:
+(time[0] = 30, time[2] = 150): total duration 180
+(time[1] = 20, time[3] = 100): total duration 120
+(time[1] = 20, time[4] = 40): total duration 60
+
+```
+
+**Example 2:**
+
+```
+Input: time = [60,60,60]
+Output: 3
+Explanation: All three pairs have a total duration of 120, which is divisible by 60.
+
+```
+
+**Constraints:**
+
+- `1 <= time.length <= 6 * 104`
+- `1 <= time[i] <= 500`
+
+## 题目大意
+
+在歌曲列表中，第 i 首歌曲的持续时间为 time[i] 秒。
+
+返回其总持续时间（以秒为单位）可被 60 整除的歌曲对的数量。形式上，我们希望下标数字 i 和 j 满足 i < j 且有 (time[i] + time[j]) % 60 == 0。
+
+## 解题思路
+
+- 简单题。先将数组每个元素对 60 取余，将它们都转换到 [0,59] 之间。然后在数组中找两两元素之和等于 60 的数对。可以在 0-30 之内对半查找符合条件的数对。对 0 和 30 单独计算。因为多个 0 相加，余数还为 0 。2 个 30 相加之和为 60。
+
+## 代码
+
+```go
+func numPairsDivisibleBy60(time []int) int {
+ counts := make([]int, 60)
+ for _, v := range time {
+ v %= 60
+ counts[v]++
+ }
+ res := 0
+ for i := 1; i < len(counts)/2; i++ {
+ res += counts[i] * counts[60-i]
+ }
+ res += (counts[0] * (counts[0] - 1)) / 2
+ res += (counts[30] * (counts[30] - 1)) / 2
+ return res
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1000~1099/1009.Complement-of-Base-10-Integer/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1000~1099/1011.Capacity-To-Ship-Packages-Within-D-Days/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/1011.Capacity-To-Ship-Packages-Within-D-Days.md b/website/content/ChapterFour/1000~1099/1011.Capacity-To-Ship-Packages-Within-D-Days.md
similarity index 80%
rename from website/content/ChapterFour/1011.Capacity-To-Ship-Packages-Within-D-Days.md
rename to website/content/ChapterFour/1000~1099/1011.Capacity-To-Ship-Packages-Within-D-Days.md
index 774c53d14..c812630ac 100755
--- a/website/content/ChapterFour/1011.Capacity-To-Ship-Packages-Within-D-Days.md
+++ b/website/content/ChapterFour/1000~1099/1011.Capacity-To-Ship-Packages-Within-D-Days.md
@@ -73,8 +73,6 @@ Return the least weight capacity of the ship that will result in all the package
```go
-package leetcode
-
func shipWithinDays(weights []int, D int) int {
maxNum, sum := 0, 0
for _, num := range weights {
@@ -98,4 +96,27 @@ func shipWithinDays(weights []int, D int) int {
return low
}
-```
\ No newline at end of file
+func calSum(mid, m int, nums []int) bool {
+ sum, count := 0, 0
+ for _, v := range nums {
+ sum += v
+ if sum > mid {
+ sum = v
+ count++
+ // 分成 m 块，只需要插桩 m -1 个
+ if count > m-1 {
+ return false
+ }
+ }
+ }
+ return true
+}
+
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1000~1099/1010.Pairs-of-Songs-With-Total-Durations-Divisible-by-60/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1000~1099/1017.Convert-to-Base-2/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/1000~1099/1017.Convert-to-Base-2.md b/website/content/ChapterFour/1000~1099/1017.Convert-to-Base-2.md
new file mode 100755
index 000000000..d6aaa9ade
--- /dev/null
+++ b/website/content/ChapterFour/1000~1099/1017.Convert-to-Base-2.md
@@ -0,0 +1,82 @@
+# [1017. Convert to Base -2](https://leetcode.com/problems/convert-to-base-2/)
+
+
+## 题目
+
+Given a number `N`, return a string consisting of `"0"`s and `"1"`s that represents its value in base **`-2`** (negative two).
+
+The returned string must have no leading zeroes, unless the string is `"0"`.
+
+**Example 1**:
+
+ Input: 2
+ Output: "110"
+ Explantion: (-2) ^ 2 + (-2) ^ 1 = 2
+
+**Example 2**:
+
+ Input: 3
+ Output: "111"
+ Explantion: (-2) ^ 2 + (-2) ^ 1 + (-2) ^ 0 = 3
+
+**Example 3**:
+
+ Input: 4
+ Output: "100"
+ Explantion: (-2) ^ 2 = 4
+
+**Note**:
+
+1. `0 <= N <= 10^9`
+
+
+## 题目大意
+
+给出数字 N，返回由若干 "0" 和 "1"组成的字符串，该字符串为 N 的负二进制（base -2）表示。除非字符串就是 "0"，否则返回的字符串中不能含有前导零。
+
+提示：
+
+- 0 <= N <= 10^9
+
+
+
+## 解题思路
+
+- 给出一个十进制的数，要求转换成 -2 进制的数
+- 这一题仿造十进制转二进制的思路，短除法即可。
+
+
+
+## 代码
+
+```go
+
+package leetcode
+
+import "strconv"
+
+func baseNeg2(N int) string {
+ if N == 0 {
+ return "0"
+ }
+ res := ""
+ for N != 0 {
+ remainder := N % (-2)
+ N = N / (-2)
+ if remainder < 0 {
+ remainder += 2
+ N++
+ }
+ res = strconv.Itoa(remainder) + res
+ }
+ return res
+}
+
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1000~1099/1011.Capacity-To-Ship-Packages-Within-D-Days/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1000~1099/1018.Binary-Prefix-Divisible-By-5/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/1000~1099/1018.Binary-Prefix-Divisible-By-5.md b/website/content/ChapterFour/1000~1099/1018.Binary-Prefix-Divisible-By-5.md
new file mode 100644
index 000000000..5afbdaa2a
--- /dev/null
+++ b/website/content/ChapterFour/1000~1099/1018.Binary-Prefix-Divisible-By-5.md
@@ -0,0 +1,77 @@
+# [1018. Binary Prefix Divisible By 5](https://leetcode.com/problems/binary-prefix-divisible-by-5/)
+
+
+## 题目
+
+Given an array `A` of `0`s and `1`s, consider `N_i`: the i-th subarray from `A[0]` to `A[i]` interpreted as a binary number (from most-significant-bit to least-significant-bit.)
+
+Return a list of booleans `answer`, where `answer[i]` is `true` if and only if `N_i` is divisible by 5.
+
+**Example 1**:
+
+```
+Input: [0,1,1]
+Output: [true,false,false]
+Explanation:
+The input numbers in binary are 0, 01, 011; which are 0, 1, and 3 in base-10. Only the first number is divisible by 5, so answer[0] is true.
+
+```
+
+**Example 2**:
+
+```
+Input: [1,1,1]
+Output: [false,false,false]
+
+```
+
+**Example 3**:
+
+```
+Input: [0,1,1,1,1,1]
+Output: [true,false,false,false,true,false]
+
+```
+
+**Example 4**:
+
+```
+Input: [1,1,1,0,1]
+Output: [false,false,false,false,false]
+
+```
+
+**Note**:
+
+1. `1 <= A.length <= 30000`
+2. `A[i]` is `0` or `1`
+
+## 题目大意
+
+给定由若干 0 和 1 组成的数组 A。我们定义 N_i：从 A[0] 到 A[i] 的第 i 个子数组被解释为一个二进制数（从最高有效位到最低有效位）。返回布尔值列表 answer，只有当 N_i 可以被 5 整除时，答案 answer[i] 为 true，否则为 false。
+
+## 解题思路
+
+- 简单题。每扫描数组中的一个数字，累计转换成二进制数对 5 取余，如果余数为 0，则存入 true，否则存入 false。
+
+## 代码
+
+```go
+package leetcode
+
+func prefixesDivBy5(a []int) []bool {
+ res, num := make([]bool, len(a)), 0
+ for i, v := range a {
+ num = (num<<1 | v) % 5
+ res[i] = num == 0
+ }
+ return res
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1000~1099/1017.Convert-to-Base-2/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1000~1099/1019.Next-Greater-Node-In-Linked-List/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/1000~1099/1019.Next-Greater-Node-In-Linked-List.md b/website/content/ChapterFour/1000~1099/1019.Next-Greater-Node-In-Linked-List.md
new file mode 100644
index 000000000..a4f1ec424
--- /dev/null
+++ b/website/content/ChapterFour/1000~1099/1019.Next-Greater-Node-In-Linked-List.md
@@ -0,0 +1,101 @@
+# [1019. Next Greater Node In Linked List](https://leetcode.com/problems/next-greater-node-in-linked-list/)
+
+## 题目
+
+We are given a linked list with head as the first node. Let's number the nodes in the list: node\_1, node\_2, node\_3, ... etc.
+
+Each node may have a next larger value: for node_i, next\_larger(node\_i) is the node\_j.val such that j > i, node\_j.val > node\_i.val, and j is the smallest possible choice. If such a j does not exist, the next larger value is 0.
+
+Return an array of integers answer, where answer[i] = next\_larger(node\_{i+1}).
+
+Note that in the example inputs (not outputs) below, arrays such as [2,1,5] represent the serialization of a linked list with a head node value of 2, second node value of 1, and third node value of 5.
+
+
+
+**Example 1**:
+
+```
+
+Input: [2,1,5]
+Output: [5,5,0]
+
+```
+
+**Example 2**:
+
+```
+
+Input: [2,7,4,3,5]
+Output: [7,0,5,5,0]
+
+```
+
+**Example 3**:
+
+```
+
+Input: [1,7,5,1,9,2,5,1]
+Output: [7,9,9,9,0,5,0,0]
+
+```
+
+**Note**:
+
+- 1 <= node.val <= 10^9 for each node in the linked list.
+- The given list has length in the range [0, 10000].
+
+
+## 题目大意
+
+给出一个链表，要求找出每个结点后面比该结点值大的第一个结点，如果找不到这个结点，则输出 0 。
+
+
+## 解题思路
+
+这一题和第 739 题、第 496 题、第 503 题类似。也有 2 种解题方法。先把链表中的数字存到数组中，整道题的思路就和第 739 题完全一致了。普通做法就是 2 层循环。优化的做法就是用单调栈，维护一个单调递减的栈即可。
+
+
+
+
+## 代码
+
+```go
+
+package leetcode
+
+/**
+ * Definition for singly-linked list.
+ * type ListNode struct {
+ * Val int
+ * Next *ListNode
+ * }
+ */
+
+// 解法一 单调栈
+func nextLargerNodes(head *ListNode) []int {
+ type node struct {
+ index, val int
+ }
+ var monoStack []node
+ var res []int
+ for head != nil {
+ for len(monoStack) > 0 && monoStack[len(monoStack)-1].val < head.Val {
+ res[monoStack[len(monoStack)-1].index] = head.Val
+ monoStack = monoStack[:len(monoStack)-1]
+ }
+ monoStack = append(monoStack, node{len(res), head.Val})
+ res = append(res, 0)
+ head = head.Next
+ }
+ return res
+}
+
+
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1000~1099/1018.Binary-Prefix-Divisible-By-5/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1000~1099/1020.Number-of-Enclaves/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/1020.Number-of-Enclaves.md b/website/content/ChapterFour/1000~1099/1020.Number-of-Enclaves.md
similarity index 86%
rename from website/content/ChapterFour/1020.Number-of-Enclaves.md
rename to website/content/ChapterFour/1000~1099/1020.Number-of-Enclaves.md
index 34b72b3de..85dcb5ff9 100644
--- a/website/content/ChapterFour/1020.Number-of-Enclaves.md
+++ b/website/content/ChapterFour/1000~1099/1020.Number-of-Enclaves.md
@@ -90,4 +90,11 @@ func dfsNumEnclaves(A [][]int, x, y int) {
}
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1000~1099/1019.Next-Greater-Node-In-Linked-List/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1000~1099/1021.Remove-Outermost-Parentheses/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/1021.Remove-Outermost-Parentheses.md b/website/content/ChapterFour/1000~1099/1021.Remove-Outermost-Parentheses.md
similarity index 86%
rename from website/content/ChapterFour/1021.Remove-Outermost-Parentheses.md
rename to website/content/ChapterFour/1000~1099/1021.Remove-Outermost-Parentheses.md
index d43d1b224..7742aec2c 100644
--- a/website/content/ChapterFour/1021.Remove-Outermost-Parentheses.md
+++ b/website/content/ChapterFour/1000~1099/1021.Remove-Outermost-Parentheses.md
@@ -120,4 +120,11 @@ func removeOuterParentheses1(S string) string {
return res
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1000~1099/1020.Number-of-Enclaves/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1000~1099/1022.Sum-of-Root-To-Leaf-Binary-Numbers/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/1000~1099/1022.Sum-of-Root-To-Leaf-Binary-Numbers.md b/website/content/ChapterFour/1000~1099/1022.Sum-of-Root-To-Leaf-Binary-Numbers.md
new file mode 100644
index 000000000..299a22219
--- /dev/null
+++ b/website/content/ChapterFour/1000~1099/1022.Sum-of-Root-To-Leaf-Binary-Numbers.md
@@ -0,0 +1,61 @@
+# [1022. Sum of Root To Leaf Binary Numbers](https://leetcode.com/problems/sum-of-root-to-leaf-binary-numbers/)
+
+## 题目
+
+You are given the root of a binary tree where each node has a value 0 or 1. Each root-to-leaf path represents a binary number starting with the most significant bit.
+
+For example, if the path is 0 -> 1 -> 1 -> 0 -> 1, then this could represent 01101 in binary, which is 13.
+For all leaves in the tree, consider the numbers represented by the path from the root to that leaf. Return the sum of these numbers.
+
+The test cases are generated so that the answer fits in a 32-bits integer.
+
+**Example 1:**
+
+```c
+Input: root = [1,0,1,0,1,0,1]
+Output: 22
+Explanation: (100) + (101) + (110) + (111) = 4 + 5 + 6 + 7 = 22
+```
+
+**Example 2:**
+
+```c
+Input: root = [0]
+Output: 0
+```
+
+**Constraints:**
+
+- The number of nodes in the tree is in the range `[1, 1000]`.
+
+- `Node.val` is `0` or `1`.
+
+
+## 题目大意
+
+给定一棵结点值都是`0`或`1`的二叉树，每条从根结点到叶结点的路径都代表一个从最高有效位开始的二进制数。
+
+返回从根节点到所有叶结点的路径所表示的数字之和。
+
+
+## 解题思路
+
+采用递归的方式对根结点`root`进行后序遍历（左子树-右子树-根结点）。
+
+**递归函数的返回值**：
+
+递归遍历每个结点时，计算从根结点到当前访问结点的所表示数值`sum`都用到了上次的计算结果，所以递归函数的返回值是当前访问结点的计算结果值。
+
+**递归函数的逻辑**：
+
+- 当前遍历结点为`nil`，表示本层递归结束了，直接`return 0`。
+
+- 如果当前访问结点是叶结点，则返回从根结点到该结点所表示的数值`sum`。
+- 如果当前访问结点不是叶结点，则返回左子树和右子树所对应的结果之和。
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1000~1099/1021.Remove-Outermost-Parentheses/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1000~1099/1025.Divisor-Game/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/1025.Divisor-Game.md b/website/content/ChapterFour/1000~1099/1025.Divisor-Game.md
similarity index 87%
rename from website/content/ChapterFour/1025.Divisor-Game.md
rename to website/content/ChapterFour/1000~1099/1025.Divisor-Game.md
index e6a45211d..868900959 100755
--- a/website/content/ChapterFour/1025.Divisor-Game.md
+++ b/website/content/ChapterFour/1000~1099/1025.Divisor-Game.md
@@ -59,4 +59,11 @@ func divisorGame(N int) bool {
return N%2 == 0
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1000~1099/1022.Sum-of-Root-To-Leaf-Binary-Numbers/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1000~1099/1026.Maximum-Difference-Between-Node-and-Ancestor/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/1026.Maximum-Difference-Between-Node-and-Ancestor.md b/website/content/ChapterFour/1000~1099/1026.Maximum-Difference-Between-Node-and-Ancestor.md
similarity index 86%
rename from website/content/ChapterFour/1026.Maximum-Difference-Between-Node-and-Ancestor.md
rename to website/content/ChapterFour/1000~1099/1026.Maximum-Difference-Between-Node-and-Ancestor.md
index b2c946172..325536b0d 100644
--- a/website/content/ChapterFour/1026.Maximum-Difference-Between-Node-and-Ancestor.md
+++ b/website/content/ChapterFour/1000~1099/1026.Maximum-Difference-Between-Node-and-Ancestor.md
@@ -71,4 +71,11 @@ func dfsAncestorDiff(root *TreeNode, res *int) (int, int) {
*res = max(*res, max(abs(root.Val-min(leftMin, rightMin)), abs(root.Val-max(leftMax, rightMax))))
return max(leftMax, max(rightMax, root.Val)), min(leftMin, min(rightMin, root.Val))
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1000~1099/1025.Divisor-Game/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1000~1099/1028.Recover-a-Tree-From-Preorder-Traversal/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/1028.Recover-a-Tree-From-Preorder-Traversal.md b/website/content/ChapterFour/1000~1099/1028.Recover-a-Tree-From-Preorder-Traversal.md
similarity index 91%
rename from website/content/ChapterFour/1028.Recover-a-Tree-From-Preorder-Traversal.md
rename to website/content/ChapterFour/1000~1099/1028.Recover-a-Tree-From-Preorder-Traversal.md
index f9c25238e..a7195a543 100755
--- a/website/content/ChapterFour/1028.Recover-a-Tree-From-Preorder-Traversal.md
+++ b/website/content/ChapterFour/1000~1099/1028.Recover-a-Tree-From-Preorder-Traversal.md
@@ -132,4 +132,11 @@ func dfsBuildPreorderTree(S string, index, level *int, cur *TreeNode) (newIndex
return index
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1000~1099/1026.Maximum-Difference-Between-Node-and-Ancestor/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1000~1099/1030.Matrix-Cells-in-Distance-Order/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/1030.Matrix-Cells-in-Distance-Order.md b/website/content/ChapterFour/1000~1099/1030.Matrix-Cells-in-Distance-Order.md
similarity index 87%
rename from website/content/ChapterFour/1030.Matrix-Cells-in-Distance-Order.md
rename to website/content/ChapterFour/1000~1099/1030.Matrix-Cells-in-Distance-Order.md
index ba60ec4dc..a54d2fddd 100755
--- a/website/content/ChapterFour/1030.Matrix-Cells-in-Distance-Order.md
+++ b/website/content/ChapterFour/1000~1099/1030.Matrix-Cells-in-Distance-Order.md
@@ -81,4 +81,11 @@ func allCellsDistOrder(R int, C int, r0 int, c0 int) [][]int {
return result
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1000~1099/1028.Recover-a-Tree-From-Preorder-Traversal/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1000~1099/1034.Coloring-A-Border/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/1000~1099/1034.Coloring-A-Border.md b/website/content/ChapterFour/1000~1099/1034.Coloring-A-Border.md
new file mode 100644
index 000000000..cfcb67675
--- /dev/null
+++ b/website/content/ChapterFour/1000~1099/1034.Coloring-A-Border.md
@@ -0,0 +1,115 @@
+# [1034. Coloring A Border](https://leetcode.com/problems/coloring-a-border/)
+
+## 题目
+
+You are given an m x n integer matrix grid, and three integers row, col, and color. Each value in the grid represents the color of the grid square at that location.
+
+Two squares belong to the same connected component if they have the same color and are next to each other in any of the 4 directions.
+
+The border of a connected component is all the squares in the connected component that are either 4-directionally adjacent to a square not in the component, or on the boundary of the grid (the first or last row or column).
+
+You should color the border of the connected component that contains the square grid[row][col] with color.
+
+Return the final grid.
+
+**Example 1**:
+
+ Input: grid = [[1,1],[1,2]], row = 0, col = 0, color = 3
+ Output: [[3,3],[3,2]]
+
+**Example 2**:
+
+ Input: grid = [[1,2,2],[2,3,2]], row = 0, col = 1, color = 3
+ Output: [[1,3,3],[2,3,3]]
+
+**Example 3**:
+
+ Input: grid = [[1,1,1],[1,1,1],[1,1,1]], row = 1, col = 1, color = 2
+ Output: [[2,2,2],[2,1,2],[2,2,2]]
+
+**Constraints:**
+
+- m == grid.length
+- n == grid[i].length
+- 1 <= m, n <= 50
+- 1 <= grid[i][j], color <= 1000
+- 0 <= row < m
+- 0 <= col < n
+
+## 题目大意
+
+给你一个大小为 m x n 的整数矩阵 grid ，表示一个网格。另给你三个整数 row、col 和 color 。网格中的每个值表示该位置处的网格块的颜色。
+
+当两个网格块的颜色相同，而且在四个方向中任意一个方向上相邻时，它们属于同一连通分量
+
+边界：在连通分量的块中（前提）并且满足以下条件之一：
+（1）要么上下左右存在一个块不在连通分量里面
+（2）要么这个块的位置在整个grid的边框上
+
+请你使用指定颜色 color 为所有包含网格块 grid[row][col] 的连通分量的边界进行着色，并返回最终的网格 grid 。
+
+## 解题思路
+
+- 用 bfs 进行遍历选出边界，使用 color 给边界着色
+
+## 代码
+
+```go
+package leetcode
+
+type point struct {
+ x int
+ y int
+}
+
+type gridInfo struct {
+ m int
+ n int
+ grid [][]int
+ originalColor int
+}
+
+func colorBorder(grid [][]int, row, col, color int) [][]int {
+ m, n := len(grid), len(grid[0])
+ dirs := []point{{1, 0}, {-1, 0}, {0, 1}, {0, -1}}
+ vis := make([][]bool, m)
+ for i := range vis {
+ vis[i] = make([]bool, n)
+ }
+ var borders []point
+ gInfo := gridInfo{
+ m: m,
+ n: n,
+ grid: grid,
+ originalColor: grid[row][col],
+ }
+ dfs(row, col, gInfo, dirs, vis, &borders)
+ for _, p := range borders {
+ grid[p.x][p.y] = color
+ }
+ return grid
+}
+
+func dfs(x, y int, gInfo gridInfo, dirs []point, vis [][]bool, borders *[]point) {
+ vis[x][y] = true
+ isBorder := false
+ for _, dir := range dirs {
+ nx, ny := x+dir.x, y+dir.y
+ if !(0 <= nx && nx < gInfo.m && 0 <= ny && ny < gInfo.n && gInfo.grid[nx][ny] == gInfo.originalColor) {
+ isBorder = true
+ } else if !vis[nx][ny] {
+ dfs(nx, ny, gInfo, dirs, vis, borders)
+ }
+ }
+ if isBorder {
+ *borders = append(*borders, point{x, y})
+ }
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1000~1099/1030.Matrix-Cells-in-Distance-Order/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1000~1099/1037.Valid-Boomerang/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/1037.Valid-Boomerang.md b/website/content/ChapterFour/1000~1099/1037.Valid-Boomerang.md
similarity index 75%
rename from website/content/ChapterFour/1037.Valid-Boomerang.md
rename to website/content/ChapterFour/1000~1099/1037.Valid-Boomerang.md
index 89a4000db..d01462887 100644
--- a/website/content/ChapterFour/1037.Valid-Boomerang.md
+++ b/website/content/ChapterFour/1000~1099/1037.Valid-Boomerang.md
@@ -46,4 +46,11 @@ func isBoomerang(points [][]int) bool {
return (points[0][0]-points[1][0])*(points[0][1]-points[2][1]) != (points[0][0]-points[2][0])*(points[0][1]-points[1][1])
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1000~1099/1034.Coloring-A-Border/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1000~1099/1038.Binary-Search-Tree-to-Greater-Sum-Tree/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/1000~1099/1038.Binary-Search-Tree-to-Greater-Sum-Tree.md b/website/content/ChapterFour/1000~1099/1038.Binary-Search-Tree-to-Greater-Sum-Tree.md
new file mode 100644
index 000000000..31c0a5142
--- /dev/null
+++ b/website/content/ChapterFour/1000~1099/1038.Binary-Search-Tree-to-Greater-Sum-Tree.md
@@ -0,0 +1,114 @@
+# [1038. Binary Search Tree to Greater Sum Tree](https://leetcode.com/problems/binary-search-tree-to-greater-sum-tree/)
+
+
+## 题目
+
+Given the `root` of a Binary Search Tree (BST), convert it to a Greater Tree such that every key of the original BST is changed to the original key plus sum of all keys greater than the original key in BST.
+
+As a reminder, a *binary search tree* is a tree that satisfies these constraints:
+
+- The left subtree of a node contains only nodes with keys **less than** the node's key.
+- The right subtree of a node contains only nodes with keys **greater than** the node's key.
+- Both the left and right subtrees must also be binary search trees.
+
+**Note:** This question is the same as 538: [https://leetcode.com/problems/convert-bst-to-greater-tree/](https://leetcode.com/problems/convert-bst-to-greater-tree/)
+
+**Example 1:**
+
+
+
+```
+Input: root = [4,1,6,0,2,5,7,null,null,null,3,null,null,null,8]
+Output: [30,36,21,36,35,26,15,null,null,null,33,null,null,null,8]
+```
+
+**Example 2:**
+
+```
+Input: root = [0,null,1]
+Output: [1,null,1]
+```
+
+**Example 3:**
+
+```
+Input: root = [1,0,2]
+Output: [3,3,2]
+```
+
+**Example 4:**
+
+```
+Input: root = [3,2,4,1]
+Output: [7,9,4,10]
+```
+
+**Constraints:**
+
+- The number of nodes in the tree is in the range `[1, 100]`.
+- `0 <= Node.val <= 100`
+- All the values in the tree are **unique**.
+- `root` is guaranteed to be a valid binary search tree.
+
+## 题目大意
+
+给出二叉 搜索 树的根节点，该树的节点值各不相同，请你将其转换为累加树（Greater Sum Tree），使每个节点 node 的新值等于原树中大于或等于 node.val 的值之和。
+
+提醒一下，二叉搜索树满足下列约束条件：
+
+- 节点的左子树仅包含键 小于 节点键的节点。
+- 节点的右子树仅包含键 大于 节点键的节点。
+- 左右子树也必须是二叉搜索树。
+
+## 解题思路
+
+- 根据二叉搜索树的有序性，想要将其转换为累加树，只需按照 右节点 - 根节点 - 左节点的顺序遍历，并累加和即可。
+- 此题同第 538 题。
+
+## 代码
+
+```go
+package leetcode
+
+import (
+ "github.com/halfrost/leetcode-go/structures"
+)
+
+// TreeNode define
+type TreeNode = structures.TreeNode
+
+/**
+ * Definition for a binary tree node.
+ * type TreeNode struct {
+ * Val int
+ * Left *TreeNode
+ * Right *TreeNode
+ * }
+ */
+
+func bstToGst(root *TreeNode) *TreeNode {
+ if root == nil {
+ return root
+ }
+ sum := 0
+ dfs1038(root, &sum)
+ return root
+}
+
+func dfs1038(root *TreeNode, sum *int) {
+ if root == nil {
+ return
+ }
+ dfs1038(root.Right, sum)
+ root.Val += *sum
+ *sum = root.Val
+ dfs1038(root.Left, sum)
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1000~1099/1037.Valid-Boomerang/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1000~1099/1040.Moving-Stones-Until-Consecutive-II/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/1040.Moving-Stones-Until-Consecutive-II.md b/website/content/ChapterFour/1000~1099/1040.Moving-Stones-Until-Consecutive-II.md
similarity index 94%
rename from website/content/ChapterFour/1040.Moving-Stones-Until-Consecutive-II.md
rename to website/content/ChapterFour/1000~1099/1040.Moving-Stones-Until-Consecutive-II.md
index 9c41121ef..9d03de77e 100755
--- a/website/content/ChapterFour/1040.Moving-Stones-Until-Consecutive-II.md
+++ b/website/content/ChapterFour/1000~1099/1040.Moving-Stones-Until-Consecutive-II.md
@@ -118,4 +118,11 @@ func numMovesStonesII(stones []int) []int {
return []int{minStep, maxStep}
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1000~1099/1038.Binary-Search-Tree-to-Greater-Sum-Tree/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1000~1099/1047.Remove-All-Adjacent-Duplicates-In-String/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/1047.Remove-All-Adjacent-Duplicates-In-String.md b/website/content/ChapterFour/1000~1099/1047.Remove-All-Adjacent-Duplicates-In-String.md
similarity index 80%
rename from website/content/ChapterFour/1047.Remove-All-Adjacent-Duplicates-In-String.md
rename to website/content/ChapterFour/1000~1099/1047.Remove-All-Adjacent-Duplicates-In-String.md
index 1166355f8..5508dc6ff 100644
--- a/website/content/ChapterFour/1047.Remove-All-Adjacent-Duplicates-In-String.md
+++ b/website/content/ChapterFour/1000~1099/1047.Remove-All-Adjacent-Duplicates-In-String.md
@@ -54,4 +54,11 @@ func removeDuplicates1047(S string) string {
return string(stack)
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1000~1099/1040.Moving-Stones-Until-Consecutive-II/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1000~1099/1048.Longest-String-Chain/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/1000~1099/1048.Longest-String-Chain.md b/website/content/ChapterFour/1000~1099/1048.Longest-String-Chain.md
new file mode 100644
index 000000000..703bf3794
--- /dev/null
+++ b/website/content/ChapterFour/1000~1099/1048.Longest-String-Chain.md
@@ -0,0 +1,103 @@
+# [1048. Longest String Chain](https://leetcode.com/problems/longest-string-chain/)
+
+
+## 题目
+
+Given a list of words, each word consists of English lowercase letters.
+
+Let's say `word1` is a predecessor of `word2` if and only if we can add exactly one letter anywhere in `word1` to make it equal to `word2`. For example, `"abc"` is a predecessor of `"abac"`.
+
+A *word chain* is a sequence of words `[word_1, word_2, ..., word_k]` with `k >= 1`, where `word_1` is a predecessor of `word_2`, `word_2` is a predecessor of `word_3`, and so on.
+
+Return the longest possible length of a word chain with words chosen from the given list of `words`.
+
+**Example 1:**
+
+```
+Input: words = ["a","b","ba","bca","bda","bdca"]
+Output: 4
+Explanation: One of the longest word chain is "a","ba","bda","bdca".
+```
+
+**Example 2:**
+
+```
+Input: words = ["xbc","pcxbcf","xb","cxbc","pcxbc"]
+Output: 5
+```
+
+**Constraints:**
+
+- `1 <= words.length <= 1000`
+- `1 <= words[i].length <= 16`
+- `words[i]` only consists of English lowercase letters.
+
+## 题目大意
+
+给出一个单词列表，其中每个单词都由小写英文字母组成。如果我们可以在 word1 的任何地方添加一个字母使其变成 word2，那么我们认为 word1 是 word2 的前身。例如，"abc" 是 "abac" 的前身。词链是单词 [word_1, word_2, ..., word_k] 组成的序列，k >= 1，其中 word_1 是 word_2 的前身，word_2 是 word_3 的前身，依此类推。从给定单词列表 words 中选择单词组成词链，返回词链的最长可能长度。
+
+## 解题思路
+
+- 从这题的数据规模上分析，可以猜出此题是 DFS 或者 DP 的题。简单暴力的方法是以每个字符串为链条的起点开始枚举之后的字符串，两两判断能否构成满足题意的前身字符串。这种做法包含很多重叠子问题，例如 a 和 b 能构成前身字符串，以 c 为起点的字符串链条可能用到 a 和 b，以 d 为起点的字符串链条也可能用到 a 和 b。顺其自然，考虑用 DP 的思路解题。
+- 先将 words 字符串数组排序，然后用 poss 数组记录下每种长度字符串的在排序数组中的起始下标。然后逆序往前递推。因为初始条件只能得到以最长字符串为起始的字符串链长度为 1 。每选择一个起始字符串，从它的长度 + 1 的每个字符串 j 开始比较，是否能为其前身字符串。如果能构成前身字符串，那么 dp[i] = max(dp[i], 1+dp[j])。最终递推到下标为 0 的字符串。最终输出整个递推过程中的最大长度即为所求。
+
+## 代码
+
+```go
+package leetcode
+
+import "sort"
+
+func longestStrChain(words []string) int {
+ sort.Slice(words, func(i, j int) bool { return len(words[i]) < len(words[j]) })
+ poss, res := make([]int, 16+2), 0
+ for i, w := range words {
+ if poss[len(w)] == 0 {
+ poss[len(w)] = i
+ }
+ }
+ dp := make([]int, len(words))
+ for i := len(words) - 1; i >= 0; i-- {
+ dp[i] = 1
+ for j := poss[len(words[i])+1]; j < len(words) && len(words[j]) == len(words[i])+1; j++ {
+ if isPredecessor(words[j], words[i]) {
+ dp[i] = max(dp[i], 1+dp[j])
+ }
+ }
+ res = max(res, dp[i])
+ }
+ return res
+}
+
+func max(a, b int) int {
+ if a > b {
+ return a
+ }
+ return b
+}
+
+func isPredecessor(long, short string) bool {
+ i, j := 0, 0
+ wasMismatch := false
+ for j < len(short) {
+ if long[i] != short[j] {
+ if wasMismatch {
+ return false
+ }
+ wasMismatch = true
+ i++
+ continue
+ }
+ i++
+ j++
+ }
+ return true
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1000~1099/1047.Remove-All-Adjacent-Duplicates-In-String/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1000~1099/1049.Last-Stone-Weight-II/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/1049.Last-Stone-Weight-II.md b/website/content/ChapterFour/1000~1099/1049.Last-Stone-Weight-II.md
similarity index 89%
rename from website/content/ChapterFour/1049.Last-Stone-Weight-II.md
rename to website/content/ChapterFour/1000~1099/1049.Last-Stone-Weight-II.md
index 4159bb504..4645224f1 100755
--- a/website/content/ChapterFour/1049.Last-Stone-Weight-II.md
+++ b/website/content/ChapterFour/1000~1099/1049.Last-Stone-Weight-II.md
@@ -76,4 +76,11 @@ func lastStoneWeightII(stones []int) int {
return sum - 2*dp[C]
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1000~1099/1048.Longest-String-Chain/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1000~1099/1051.Height-Checker/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/1051.Height-Checker.md b/website/content/ChapterFour/1000~1099/1051.Height-Checker.md
similarity index 83%
rename from website/content/ChapterFour/1051.Height-Checker.md
rename to website/content/ChapterFour/1000~1099/1051.Height-Checker.md
index 10653f21f..cb5879d46 100644
--- a/website/content/ChapterFour/1051.Height-Checker.md
+++ b/website/content/ChapterFour/1000~1099/1051.Height-Checker.md
@@ -69,4 +69,11 @@ func heightChecker(heights []int) int {
return result
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1000~1099/1049.Last-Stone-Weight-II/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1000~1099/1052.Grumpy-Bookstore-Owner/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/1052.Grumpy-Bookstore-Owner.md b/website/content/ChapterFour/1000~1099/1052.Grumpy-Bookstore-Owner.md
similarity index 92%
rename from website/content/ChapterFour/1052.Grumpy-Bookstore-Owner.md
rename to website/content/ChapterFour/1000~1099/1052.Grumpy-Bookstore-Owner.md
index b63f9479f..4e48b5af8 100755
--- a/website/content/ChapterFour/1052.Grumpy-Bookstore-Owner.md
+++ b/website/content/ChapterFour/1000~1099/1052.Grumpy-Bookstore-Owner.md
@@ -103,4 +103,11 @@ func sumSatisfied(customers []int, grumpy []int, start, end int) int {
return sum
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1000~1099/1051.Height-Checker/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1000~1099/1054.Distant-Barcodes/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/1054.Distant-Barcodes.md b/website/content/ChapterFour/1000~1099/1054.Distant-Barcodes.md
similarity index 84%
rename from website/content/ChapterFour/1054.Distant-Barcodes.md
rename to website/content/ChapterFour/1000~1099/1054.Distant-Barcodes.md
index 522c4e835..ea71fd103 100755
--- a/website/content/ChapterFour/1054.Distant-Barcodes.md
+++ b/website/content/ChapterFour/1000~1099/1054.Distant-Barcodes.md
@@ -89,4 +89,11 @@ func barcodesFrequencySort(s []int) []int {
return res
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1000~1099/1052.Grumpy-Bookstore-Owner/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1000~1099/1073.Adding-Two-Negabinary-Numbers/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/1073.Adding-Two-Negabinary-Numbers.md b/website/content/ChapterFour/1000~1099/1073.Adding-Two-Negabinary-Numbers.md
similarity index 93%
rename from website/content/ChapterFour/1073.Adding-Two-Negabinary-Numbers.md
rename to website/content/ChapterFour/1000~1099/1073.Adding-Two-Negabinary-Numbers.md
index b8380b335..ef540b112 100755
--- a/website/content/ChapterFour/1073.Adding-Two-Negabinary-Numbers.md
+++ b/website/content/ChapterFour/1000~1099/1073.Adding-Two-Negabinary-Numbers.md
@@ -143,4 +143,11 @@ func intToNegabinary(num int) []int {
return res
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1000~1099/1054.Distant-Barcodes/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1000~1099/1074.Number-of-Submatrices-That-Sum-to-Target/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/1074.Number-of-Submatrices-That-Sum-to-Target.md b/website/content/ChapterFour/1000~1099/1074.Number-of-Submatrices-That-Sum-to-Target.md
similarity index 91%
rename from website/content/ChapterFour/1074.Number-of-Submatrices-That-Sum-to-Target.md
rename to website/content/ChapterFour/1000~1099/1074.Number-of-Submatrices-That-Sum-to-Target.md
index a9a66a85e..82fa07ba8 100755
--- a/website/content/ChapterFour/1074.Number-of-Submatrices-That-Sum-to-Target.md
+++ b/website/content/ChapterFour/1000~1099/1074.Number-of-Submatrices-That-Sum-to-Target.md
@@ -11,6 +11,8 @@ Two submatrices `(x1, y1, x2, y2)` and `(x1', y1', x2', y2')` are different
**Example 1**:
+
+
Input: matrix = [[0,1,0],[1,1,1],[0,1,0]], target = 0
Output: 4
Explanation: The four 1x1 submatrices that only contain 0.
@@ -53,8 +55,9 @@ Two submatrices `(x1, y1, x2, y2)` and `(x1', y1', x2', y2')` are different
- 给出一个矩阵，要求在这个矩阵中找出子矩阵的和等于 target 的矩阵个数。
- 这一题读完题感觉是滑动窗口的二维版本。如果把它拍扁，在一维数组中，求连续的子数组和为 target，这样就很好做。如果这题不降维，纯暴力解是 O(n^6)。如何优化降低时间复杂度呢？
- 联想到第 1 题 Two Sum 问题，可以把 2 个数求和的问题优化到 O(n)。这里也用类似的思想，用一个 map 来保存行方向上曾经出现过的累加和，相减就可以得到本行的和。这里可能读者会有疑惑，为什么不能每一行都单独保存呢？为什么一定要用累加和相减的方式来获取每一行的和呢？因为这一题要求子矩阵所有解，如果只单独保存每一行的和，只能求得小的子矩阵，子矩阵和子矩阵组成的大矩阵的情况会漏掉(当然再循环一遍，把子矩阵累加起来也可以，但是这样就多了一层循环了)，例如子矩阵是 1*4 的，但是 2 个这样的子矩阵摞在一起形成 2 * 4 也能满足条件，如果不用累加和的办法，只单独存每一行的和，最终还要有组合的步骤。经过这样的优化，可以从 O(n^6) 优化到 O(n^4)，能 AC 这道题，但是时间复杂度太高了。如何优化？
-- 首先，子矩阵需要上下左右 4 个边界，4 个变量控制循环就需要 O(n^4)，行和列的区间累加还需要 O(n^2)。行和列的区间累加可以通过 preSum 来解决。例如 `sum[i,j] = sum[j] - sum[i - 1]`，其中 sum[k] 中存的是从 0 到 K 的累加和： 
-
+- 首先，子矩阵需要上下左右 4 个边界，4 个变量控制循环就需要 O(n^4)，行和列的区间累加还需要 O(n^2)。行和列的区间累加可以通过 preSum 来解决。例如 `sum[i,j] = sum[j] - sum[i - 1]`，其中 sum[k] 中存的是从 0 到 K 的累加和： {{< katex display >}}
+\sum_{0}^{k} matrix[i]
+{{< /katex >}}
那么一个区间内的累加和可以由这个区间的右边界减去区间左边界左边的那个累加和得到(由于是闭区间，所需要取左边界左边的和)。经过这样的处理，列方向的维度就被我们拍扁了。
- 再来看看行方向的和，现在每一列的和都可以通过区间相减的方法得到。那么这道题就变成了第 1 题 Two Sum 的问题了。Two Sum 问题只需要 O(n) 的时间复杂度求解，这一题由于是二维的，所以两个列的边界还需要循环，所以最终优化下来的时间复杂度是 O(n^3)。计算 presum 可以直接用原数组，所以空间复杂度只有一个 O(n) 的字典。
@@ -140,4 +143,11 @@ func sumSubmatrix(matrix [][]int, startx, starty, endx, endy int) int {
return sum
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1000~1099/1073.Adding-Two-Negabinary-Numbers/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1000~1099/1078.Occurrences-After-Bigram/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/1078.Occurrences-After-Bigram.md b/website/content/ChapterFour/1000~1099/1078.Occurrences-After-Bigram.md
similarity index 82%
rename from website/content/ChapterFour/1078.Occurrences-After-Bigram.md
rename to website/content/ChapterFour/1000~1099/1078.Occurrences-After-Bigram.md
index 6d1806e02..877eeff77 100755
--- a/website/content/ChapterFour/1078.Occurrences-After-Bigram.md
+++ b/website/content/ChapterFour/1000~1099/1078.Occurrences-After-Bigram.md
@@ -61,4 +61,11 @@ func findOcurrences(text string, first string, second string) []string {
return res
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1000~1099/1074.Number-of-Submatrices-That-Sum-to-Target/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1000~1099/1079.Letter-Tile-Possibilities/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/1079.Letter-Tile-Possibilities.md b/website/content/ChapterFour/1000~1099/1079.Letter-Tile-Possibilities.md
similarity index 87%
rename from website/content/ChapterFour/1079.Letter-Tile-Possibilities.md
rename to website/content/ChapterFour/1000~1099/1079.Letter-Tile-Possibilities.md
index 41a7ecfa5..1227f74ca 100755
--- a/website/content/ChapterFour/1079.Letter-Tile-Possibilities.md
+++ b/website/content/ChapterFour/1000~1099/1079.Letter-Tile-Possibilities.md
@@ -33,7 +33,8 @@ You have a set of `tiles`, where each tile has one letter `tiles[i]` printed
- 题目要求输出所有非空字母序列的数目。这一题是排列和组合的结合题目。组合是可以选择一个字母，二个字母，…… n 个字母。每个组合内是排列问题。比如选择 2 个字母，字母之间相互排序不同是影响最终结果的，不同的排列顺序是不同的解。
- 这道题目由于不需要输出所有解，所以解法可以优化，例如我们在递归计算解的时候，不需要真的遍历原字符串，只需要累加一些字母的频次就可以。当然如果要输出所有解，就需要真实遍历原字符串了(见解法二)。简单的做法是每次递归按照频次累加。因为每次增加一个字母一定是 26 个大写字母中的一个。这里需要注意的是，增加的只能是 26 个字母里面还能取出“机会”的字母，例如递归到到第 3 轮了，A 用完了，这个时候只能取频次还不为 0 的字母拼上去。
-
+
+
## 代码
@@ -103,4 +104,11 @@ func findTile(tiles, tmp []byte, used *[]bool, index int, res *int, tMap map[str
}
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1000~1099/1078.Occurrences-After-Bigram/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1000~1099/1089.Duplicate-Zeros/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/1089.Duplicate-Zeros.md b/website/content/ChapterFour/1000~1099/1089.Duplicate-Zeros.md
similarity index 79%
rename from website/content/ChapterFour/1089.Duplicate-Zeros.md
rename to website/content/ChapterFour/1000~1099/1089.Duplicate-Zeros.md
index 3c8224749..1bc3b7757 100644
--- a/website/content/ChapterFour/1089.Duplicate-Zeros.md
+++ b/website/content/ChapterFour/1000~1099/1089.Duplicate-Zeros.md
@@ -55,4 +55,11 @@ func duplicateZeros(arr []int) {
}
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1000~1099/1079.Letter-Tile-Possibilities/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1000~1099/1091.Shortest-Path-in-Binary-Matrix/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/1000~1099/1091.Shortest-Path-in-Binary-Matrix.md b/website/content/ChapterFour/1000~1099/1091.Shortest-Path-in-Binary-Matrix.md
new file mode 100644
index 000000000..849bb15e4
--- /dev/null
+++ b/website/content/ChapterFour/1000~1099/1091.Shortest-Path-in-Binary-Matrix.md
@@ -0,0 +1,121 @@
+# [1091. Shortest Path in Binary Matrix](https://leetcode.com/problems/shortest-path-in-binary-matrix/)
+
+
+## 题目
+
+In an N by N square grid, each cell is either empty (0) or blocked (1).
+
+A *clear path from top-left to bottom-right* has length `k` if and only if it is composed of cells `C_1, C_2, ..., C_k` such that:
+
+- Adjacent cells `C_i` and `C_{i+1}` are connected 8-directionally (ie., they are different and share an edge or corner)
+- `C_1` is at location `(0, 0)` (ie. has value `grid[0][0]`)
+- `C_k` is at location `(N-1, N-1)` (ie. has value `grid[N-1][N-1]`)
+- If `C_i` is located at `(r, c)`, then `grid[r][c]` is empty (ie. `grid[r][c] == 0`).
+
+Return the length of the shortest such clear path from top-left to bottom-right. If such a path does not exist, return -1.
+
+**Example 1:**
+
+```
+Input: [[0,1],[1,0]]
+Output: 2
+```
+
+
+
+
+
+**Example 2:**
+
+```
+Input: [[0,0,0],[1,1,0],[1,1,0]]
+Output: 4
+```
+
+
+
+
+
+**Note:**
+
+1. `1 <= grid.length == grid[0].length <= 100`
+2. `grid[r][c]` is `0` or `1`
+
+## 题目大意
+
+在一个 N × N 的方形网格中，每个单元格有两种状态：空（0）或者阻塞（1）。一条从左上角到右下角、长度为 k 的畅通路径，由满足下述条件的单元格 C_1, C_2, ..., C_k 组成：
+
+- 相邻单元格 C_i 和 C_{i+1} 在八个方向之一上连通（此时，C_i 和 C_{i+1} 不同且共享边或角）
+- C_1 位于 (0, 0)（即，值为 grid[0][0]）
+- C_k 位于 (N-1, N-1)（即，值为 grid[N-1][N-1]）
+- 如果 C_i 位于 (r, c)，则 grid[r][c] 为空（即，grid[r][c] == 0）
+
+返回这条从左上角到右下角的最短畅通路径的长度。如果不存在这样的路径，返回 -1 。
+
+## 解题思路
+
+- 这一题是简单的找最短路径。利用 BFS 从左上角逐步扩展到右下角，便可以很容易求解。注意每轮扩展需要考虑 8 个方向。
+
+## 代码
+
+```go
+var dir = [][]int{
+ {-1, -1},
+ {-1, 0},
+ {-1, 1},
+ {0, 1},
+ {0, -1},
+ {1, -1},
+ {1, 0},
+ {1, 1},
+}
+
+func shortestPathBinaryMatrix(grid [][]int) int {
+ visited := make([][]bool, 0)
+ for range make([]int, len(grid)) {
+ visited = append(visited, make([]bool, len(grid[0])))
+ }
+ dis := make([][]int, 0)
+ for range make([]int, len(grid)) {
+ dis = append(dis, make([]int, len(grid[0])))
+ }
+ if grid[0][0] == 1 {
+ return -1
+ }
+ if len(grid) == 1 && len(grid[0]) == 1 {
+ return 1
+ }
+
+ queue := []int{0}
+ visited[0][0], dis[0][0] = true, 1
+ for len(queue) > 0 {
+ cur := queue[0]
+ queue = queue[1:]
+ curx, cury := cur/len(grid[0]), cur%len(grid[0])
+ for d := 0; d < 8; d++ {
+ nextx := curx + dir[d][0]
+ nexty := cury + dir[d][1]
+ if isInBoard(grid, nextx, nexty) && !visited[nextx][nexty] && grid[nextx][nexty] == 0 {
+ queue = append(queue, nextx*len(grid[0])+nexty)
+ visited[nextx][nexty] = true
+ dis[nextx][nexty] = dis[curx][cury] + 1
+ if nextx == len(grid)-1 && nexty == len(grid[0])-1 {
+ return dis[nextx][nexty]
+ }
+ }
+ }
+ }
+ return -1
+}
+
+func isInBoard(board [][]int, x, y int) bool {
+ return x >= 0 && x < len(board) && y >= 0 && y < len(board[0])
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1000~1099/1089.Duplicate-Zeros/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1000~1099/1093.Statistics-from-a-Large-Sample/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/1093.Statistics-from-a-Large-Sample.md b/website/content/ChapterFour/1000~1099/1093.Statistics-from-a-Large-Sample.md
similarity index 89%
rename from website/content/ChapterFour/1093.Statistics-from-a-Large-Sample.md
rename to website/content/ChapterFour/1000~1099/1093.Statistics-from-a-Large-Sample.md
index 7ebf2a326..39779662f 100755
--- a/website/content/ChapterFour/1093.Statistics-from-a-Large-Sample.md
+++ b/website/content/ChapterFour/1000~1099/1093.Statistics-from-a-Large-Sample.md
@@ -22,7 +22,7 @@ Return the minimum, maximum, mean, median, and mode of the sample respectively,
Input: count = [0,4,3,2,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0]
Output: [1.00000,4.00000,2.18182,2.00000,1.00000]
-**Constraints:**
+**Constraints**:
1. `count.length == 256`
2. `1 <= sum(count) <= 10^9`
@@ -45,7 +45,10 @@ Return the minimum, maximum, mean, median, and mode of the sample respectively,
- 这个问题的关键需要理解题目的意思，什么是采样？`count[k]` 就是整数 `k` 的采样个数。
-- 题目要求返回样本的最小值、最大值、平均值、中位数和众数。最大值和最小值就很好处理，只需要遍历 count 判断最小的非 0 的 index 就是最小值，最大的非 0 的 index 就是最大值。平均值也非常好处理，对于所有非 0 的 count，我们通过累加 count[k] * index 得到所有数的和，然后除上所有非 0 的 count 的和。)
+- 题目要求返回样本的最小值、最大值、平均值、中位数和众数。最大值和最小值就很好处理，只需要遍历 count 判断最小的非 0 的 index 就是最小值，最大的非 0 的 index 就是最大值。平均值也非常好处理，对于所有非 0 的 count，我们通过累加 count[k] * index 得到所有数的和，然后除上所有非 0 的 count 的和。
+ {{< katex display >}}
+ \sum_{n=0}^{256}count[n],count[n]!=0
+ {{< /katex>}}
- 众数也非常容易，只需统计 count 值最大时的 index 即可。
- 中位数的处理相对麻烦一些，因为需要分非 0 的 count 之和是奇数还是偶数两种情况。先假设非 0 的 count 和为 cnt，那么如果 cnt 是奇数的话，只需要找到 cnt/2 的位置即可，通过不断累加 count 的值，直到累加和超过 ≥ cnt/2。如果 cnt 是偶数的话，需要找到 cnt/2 + 1 和 cnt/2 的位置，找法和奇数情况相同，不过需要找两次(可以放到一个循环中做两次判断)。
@@ -92,4 +95,11 @@ func sampleStats(count []int) []float64 {
return res
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1000~1099/1091.Shortest-Path-in-Binary-Matrix/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1100~1199/1104.Path-In-Zigzag-Labelled-Binary-Tree/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/1000~1099/_index.md b/website/content/ChapterFour/1000~1099/_index.md
new file mode 100644
index 000000000..d2021683f
--- /dev/null
+++ b/website/content/ChapterFour/1000~1099/_index.md
@@ -0,0 +1,5 @@
+---
+bookCollapseSection: true
+weight: 20
+---
+
diff --git a/website/content/ChapterFour/1017.Convert-to-Base--2.md b/website/content/ChapterFour/1017.Convert-to-Base--2.md
deleted file mode 100755
index 77eec60f0..000000000
--- a/website/content/ChapterFour/1017.Convert-to-Base--2.md
+++ /dev/null
@@ -1,75 +0,0 @@
-# [1017. Convert to Base -2](https://leetcode.com/problems/convert-to-base-2/)
-
-
-## 题目
-
-Given a number `N`, return a string consisting of `"0"`s and `"1"`s that represents its value in base **`-2`** (negative two).
-
-The returned string must have no leading zeroes, unless the string is `"0"`.
-
-**Example 1**:
-
- Input: 2
- Output: "110"
- Explantion: (-2) ^ 2 + (-2) ^ 1 = 2
-
-**Example 2**:
-
- Input: 3
- Output: "111"
- Explantion: (-2) ^ 2 + (-2) ^ 1 + (-2) ^ 0 = 3
-
-**Example 3**:
-
- Input: 4
- Output: "100"
- Explantion: (-2) ^ 2 = 4
-
-**Note**:
-
-1. `0 <= N <= 10^9`
-
-
-## 题目大意
-
-给出数字 N，返回由若干 "0" 和 "1"组成的字符串，该字符串为 N 的负二进制（base -2）表示。除非字符串就是 "0"，否则返回的字符串中不能含有前导零。
-
-提示：
-
-- 0 <= N <= 10^9
-
-
-
-## 解题思路
-
-- 给出一个十进制的数，要求转换成 -2 进制的数
-- 这一题仿造十进制转二进制的思路，短除法即可。
-
-
-
-## 代码
-
-```go
-
-package leetcode
-
-import "strconv"
-
-func baseNeg2(N int) string {
- if N == 0 {
- return "0"
- }
- res := ""
- for N != 0 {
- remainder := N % (-2)
- N = N / (-2)
- if remainder < 0 {
- remainder += 2
- N++
- }
- res = strconv.Itoa(remainder) + res
- }
- return res
-}
-
-```
\ No newline at end of file
diff --git a/website/content/ChapterFour/1019.Next-Greater-Node-In-Linked-List.md b/website/content/ChapterFour/1019.Next-Greater-Node-In-Linked-List.md
deleted file mode 100644
index 944ca8e32..000000000
--- a/website/content/ChapterFour/1019.Next-Greater-Node-In-Linked-List.md
+++ /dev/null
@@ -1,96 +0,0 @@
-# [1019. Next Greater Node In Linked List](https://leetcode.com/problems/next-greater-node-in-linked-list/)
-
-## 题目
-
-We are given a linked list with head as the first node. Let's number the nodes in the list: node\_1, node\_2, node\_3, ... etc.
-
-Each node may have a next larger value: for node_i, next\_larger(node\_i) is the node\_j.val such that j > i, node\_j.val > node\_i.val, and j is the smallest possible choice. If such a j does not exist, the next larger value is 0.
-
-Return an array of integers answer, where answer[i] = next\_larger(node\_{i+1}).
-
-Note that in the example inputs (not outputs) below, arrays such as [2,1,5] represent the serialization of a linked list with a head node value of 2, second node value of 1, and third node value of 5.
-
-
-
-**Example 1**:
-
-```
-
-Input: [2,1,5]
-Output: [5,5,0]
-
-```
-
-**Example 2**:
-
-```
-
-Input: [2,7,4,3,5]
-Output: [7,0,5,5,0]
-
-```
-
-**Example 3**:
-
-```
-
-Input: [1,7,5,1,9,2,5,1]
-Output: [7,9,9,9,0,5,0,0]
-
-```
-
-**Note**:
-
-- 1 <= node.val <= 10^9 for each node in the linked list.
-- The given list has length in the range [0, 10000].
-
-
-## 题目大意
-
-给出一个链表，要求找出每个结点后面比该结点值大的第一个结点，如果找不到这个结点，则输出 0 。
-
-
-## 解题思路
-
-这一题和第 739 题、第 496 题、第 503 题类似。也有 2 种解题方法。先把链表中的数字存到数组中，整道题的思路就和第 739 题完全一致了。普通做法就是 2 层循环。优化的做法就是用单调栈，维护一个单调递减的栈即可。
-
-
-
-
-## 代码
-
-```go
-
-package leetcode
-
-/**
- * Definition for singly-linked list.
- * type ListNode struct {
- * Val int
- * Next *ListNode
- * }
- */
-// 解法一 单调栈
-func nextLargerNodes(head *ListNode) []int {
- res, indexes, nums := make([]int, 0), make([]int, 0), make([]int, 0)
- p := head
- for p != nil {
- nums = append(nums, p.Val)
- p = p.Next
- }
- for i := 0; i < len(nums); i++ {
- res = append(res, 0)
- }
- for i := 0; i < len(nums); i++ {
- num := nums[i]
- for len(indexes) > 0 && nums[indexes[len(indexes)-1]] < num {
- index := indexes[len(indexes)-1]
- res[index] = num
- indexes = indexes[:len(indexes)-1]
- }
- indexes = append(indexes, i)
- }
- return res
-}
-
-```
\ No newline at end of file
diff --git a/website/content/ChapterFour/1100~1199/1104.Path-In-Zigzag-Labelled-Binary-Tree.md b/website/content/ChapterFour/1100~1199/1104.Path-In-Zigzag-Labelled-Binary-Tree.md
new file mode 100644
index 000000000..05076ee8d
--- /dev/null
+++ b/website/content/ChapterFour/1100~1199/1104.Path-In-Zigzag-Labelled-Binary-Tree.md
@@ -0,0 +1,99 @@
+# [1104. Path In Zigzag Labelled Binary Tree](https://leetcode.com/problems/path-in-zigzag-labelled-binary-tree/)
+
+
+## 题目
+
+In an infinite binary tree where every node has two children, the nodes are labelled in row order.
+
+In the odd numbered rows (ie., the first, third, fifth,...), the labelling is left to right, while in the even numbered rows (second, fourth, sixth,...), the labelling is right to left.
+
+
+
+Given the `label` of a node in this tree, return the labels in the path from the root of the tree to the node with that `label`.
+
+**Example 1:**
+
+```
+Input: label = 14
+Output: [1,3,4,14]
+
+```
+
+**Example 2:**
+
+```
+Input: label = 26
+Output: [1,2,6,10,26]
+
+```
+
+**Constraints:**
+
+- `1 <= label <= 10^6`
+
+## 题目大意
+
+在一棵无限的二叉树上，每个节点都有两个子节点，树中的节点 逐行 依次按 “之” 字形进行标记。如下图所示，在奇数行（即，第一行、第三行、第五行……）中，按从左到右的顺序进行标记；而偶数行（即，第二行、第四行、第六行……）中，按从右到左的顺序进行标记。
+
+给你树上某一个节点的标号 label，请你返回从根节点到该标号为 label 节点的路径，该路径是由途经的节点标号所组成的。
+
+## 解题思路
+
+- 计算出 label 所在的 level 和 index。
+- 根据 index 和 level 计算出父节点的 index 和 value。
+- level 减一，循环计算出对应的父节点直到根节点。
+
+## 代码
+
+```go
+package leetcode
+
+func pathInZigZagTree(label int) []int {
+ level := getLevel(label)
+ ans := []int{label}
+ curIndex := label - (1 << level)
+ parent := 0
+ for level >= 1 {
+ parent, curIndex = getParent(curIndex, level)
+ ans = append(ans, parent)
+ level--
+ }
+ ans = reverse(ans)
+ return ans
+}
+
+func getLevel(label int) int {
+ level := 0
+ nums := 0
+ for {
+ nums += 1 << level
+ if nums >= label {
+ return level
+ }
+ level++
+ }
+}
+
+func getParent(index int, level int) (parent int, parentIndex int) {
+ parentIndex = 1<<(level-1) - 1 + (index/2)*(-1)
+ parent = 1<<(level-1) + parentIndex
+ return
+}
+
+func reverse(nums []int) []int {
+ left, right := 0, len(nums)-1
+ for left < right {
+ nums[left], nums[right] = nums[right], nums[left]
+ left++
+ right--
+ }
+ return nums
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1000~1099/1093.Statistics-from-a-Large-Sample/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1100~1199/1105.Filling-Bookcase-Shelves/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/1105.Filling-Bookcase-Shelves.md b/website/content/ChapterFour/1100~1199/1105.Filling-Bookcase-Shelves.md
similarity index 90%
rename from website/content/ChapterFour/1105.Filling-Bookcase-Shelves.md
rename to website/content/ChapterFour/1100~1199/1105.Filling-Bookcase-Shelves.md
index 5c248f89c..8a914c8d0 100755
--- a/website/content/ChapterFour/1105.Filling-Bookcase-Shelves.md
+++ b/website/content/ChapterFour/1100~1199/1105.Filling-Bookcase-Shelves.md
@@ -23,7 +23,7 @@ Return the minimum possible height that the total bookshelf can be after placing
The sum of the heights of the 3 shelves are 1 + 3 + 2 = 6.
Notice that book number 2 does not have to be on the first shelf.
-**Constraints:**
+**Constraints**:
- `1 <= books.length <= 1000`
- `1 <= books[i][0] <= shelf_width <= 1000`
@@ -65,4 +65,11 @@ func minHeightShelves(books [][]int, shelfWidth int) int {
return dp[len(books)]
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1100~1199/1104.Path-In-Zigzag-Labelled-Binary-Tree/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1100~1199/1108.Defanging-an-IP-Address/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/1100~1199/1108.Defanging-an-IP-Address.md b/website/content/ChapterFour/1100~1199/1108.Defanging-an-IP-Address.md
new file mode 100755
index 000000000..90724672f
--- /dev/null
+++ b/website/content/ChapterFour/1100~1199/1108.Defanging-an-IP-Address.md
@@ -0,0 +1,61 @@
+# [1108. Defanging an IP Address](https://leetcode.com/problems/defanging-an-ip-address/)
+
+
+## 题目
+
+Given a valid (IPv4) IP `address`, return a defanged version of that IP address.
+
+A *defanged IP address* replaces every period `"."` with `"[.]"`.
+
+**Example 1**:
+
+ Input: address = "1.1.1.1"
+ Output: "1[.]1[.]1[.]1"
+
+**Example 2**:
+
+ Input: address = "255.100.50.0"
+ Output: "255[.]100[.]50[.]0"
+
+**Constraints**:
+
+- The given `address` is a valid IPv4 address.
+
+## 题目大意
+
+
+给你一个有效的 IPv4 地址 address，返回这个 IP 地址的无效化版本。所谓无效化 IP 地址，其实就是用 "[.]" 代替了每个 "."。
+
+
+提示：
+
+- 给出的 address 是一个有效的 IPv4 地址
+
+
+
+## 解题思路
+
+- 给出一个 IP 地址，要求把点替换成 `[.]`。
+- 简单题，按照题意替换即可。
+
+
+## 代码
+
+```go
+
+package leetcode
+
+import "strings"
+
+func defangIPaddr(address string) string {
+ return strings.Replace(address, ".", "[.]", -1)
+}
+
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1100~1199/1105.Filling-Bookcase-Shelves/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1100~1199/1110.Delete-Nodes-And-Return-Forest/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/1110.Delete-Nodes-And-Return-Forest.md b/website/content/ChapterFour/1100~1199/1110.Delete-Nodes-And-Return-Forest.md
similarity index 86%
rename from website/content/ChapterFour/1110.Delete-Nodes-And-Return-Forest.md
rename to website/content/ChapterFour/1100~1199/1110.Delete-Nodes-And-Return-Forest.md
index 9d3c214c6..7b317cc4f 100644
--- a/website/content/ChapterFour/1110.Delete-Nodes-And-Return-Forest.md
+++ b/website/content/ChapterFour/1100~1199/1110.Delete-Nodes-And-Return-Forest.md
@@ -79,4 +79,11 @@ func dfsDelNodes(root *TreeNode, toDel map[int]bool, isRoot bool, res *[]*TreeNo
}
return isRoot
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1100~1199/1108.Defanging-an-IP-Address/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1100~1199/1111.Maximum-Nesting-Depth-of-Two-Valid-Parentheses-Strings/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/1111.Maximum-Nesting-Depth-of-Two-Valid-Parentheses-Strings.md b/website/content/ChapterFour/1100~1199/1111.Maximum-Nesting-Depth-of-Two-Valid-Parentheses-Strings.md
similarity index 91%
rename from website/content/ChapterFour/1111.Maximum-Nesting-Depth-of-Two-Valid-Parentheses-Strings.md
rename to website/content/ChapterFour/1100~1199/1111.Maximum-Nesting-Depth-of-Two-Valid-Parentheses-Strings.md
index 8f4d8f59d..4289e982c 100755
--- a/website/content/ChapterFour/1111.Maximum-Nesting-Depth-of-Two-Valid-Parentheses-Strings.md
+++ b/website/content/ChapterFour/1100~1199/1111.Maximum-Nesting-Depth-of-Two-Valid-Parentheses-Strings.md
@@ -33,7 +33,7 @@ Return an `answer` array (of length `seq.length`) that encodes such a choice
Input: seq = "()(())()"
Output: [0,0,0,1,1,0,1,1]
-**Constraints:**
+**Constraints**:
- `1 <= seq.size <= 10000`
@@ -129,4 +129,11 @@ func maxDepthAfterSplit1(seq string) []int {
return res
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1100~1199/1110.Delete-Nodes-And-Return-Forest/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1100~1199/1122.Relative-Sort-Array/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/1122.Relative-Sort-Array.md b/website/content/ChapterFour/1100~1199/1122.Relative-Sort-Array.md
similarity index 86%
rename from website/content/ChapterFour/1122.Relative-Sort-Array.md
rename to website/content/ChapterFour/1100~1199/1122.Relative-Sort-Array.md
index 7a536881f..c36c2f10e 100755
--- a/website/content/ChapterFour/1122.Relative-Sort-Array.md
+++ b/website/content/ChapterFour/1100~1199/1122.Relative-Sort-Array.md
@@ -12,7 +12,7 @@ Sort the elements of `arr1` such that the relative ordering of items in `arr1
Input: arr1 = [2,3,1,3,2,4,6,7,9,2,19], arr2 = [2,1,4,3,9,6]
Output: [2,2,2,1,4,3,3,9,6,7,19]
-**Constraints:**
+**Constraints**:
- `arr1.length, arr2.length <= 1000`
- `0 <= arr1[i], arr2[i] <= 1000`
@@ -98,4 +98,11 @@ func relativeSortArray1(arr1 []int, arr2 []int) []int {
return res
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1100~1199/1111.Maximum-Nesting-Depth-of-Two-Valid-Parentheses-Strings/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1100~1199/1123.Lowest-Common-Ancestor-of-Deepest-Leaves/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/1123.Lowest-Common-Ancestor-of-Deepest-Leaves.md b/website/content/ChapterFour/1100~1199/1123.Lowest-Common-Ancestor-of-Deepest-Leaves.md
similarity index 84%
rename from website/content/ChapterFour/1123.Lowest-Common-Ancestor-of-Deepest-Leaves.md
rename to website/content/ChapterFour/1100~1199/1123.Lowest-Common-Ancestor-of-Deepest-Leaves.md
index f2838c9d5..af07abcaf 100755
--- a/website/content/ChapterFour/1123.Lowest-Common-Ancestor-of-Deepest-Leaves.md
+++ b/website/content/ChapterFour/1100~1199/1123.Lowest-Common-Ancestor-of-Deepest-Leaves.md
@@ -30,7 +30,7 @@ Recall that:
Input: root = [1,2,3,4,5]
Output: [2,4,5]
-**Constraints:**
+**Constraints**:
- The given tree will have between 1 and 1000 nodes.
- Each node of the tree will have a distinct value between 1 and 1000.
@@ -45,7 +45,7 @@ Recall that:
- 叶节点 是二叉树中没有子节点的节点
- 树的根节点的 深度 为 0，如果某一节点的深度为 d，那它的子节点的深度就是 d+1
-- 如果我们假定 A 是一组节点 S 的 最近公共祖先，<font color="#c7254e" face="Menlo, Monaco, Consolas, Courier New, monospace">S</font> 中的每个节点都在以 A 为根节点的子树中，且 A 的深度达到此条件下可能的最大值。
+- 如果我们假定 A 是一组节点 S 的 最近公共祖先，S 中的每个节点都在以 A 为根节点的子树中，且 A 的深度达到此条件下可能的最大值。
提示：
@@ -98,4 +98,11 @@ func lcaDeepestLeavesDFS(lca **TreeNode, maxLevel *int, depth int, root *TreeNod
return max(depthLeft, depthRight)
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1100~1199/1122.Relative-Sort-Array/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1100~1199/1128.Number-of-Equivalent-Domino-Pairs/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/1128.Number-of-Equivalent-Domino-Pairs.md b/website/content/ChapterFour/1100~1199/1128.Number-of-Equivalent-Domino-Pairs.md
similarity index 83%
rename from website/content/ChapterFour/1128.Number-of-Equivalent-Domino-Pairs.md
rename to website/content/ChapterFour/1100~1199/1128.Number-of-Equivalent-Domino-Pairs.md
index cc946659c..396e61e1e 100755
--- a/website/content/ChapterFour/1128.Number-of-Equivalent-Domino-Pairs.md
+++ b/website/content/ChapterFour/1100~1199/1128.Number-of-Equivalent-Domino-Pairs.md
@@ -12,7 +12,7 @@ Return the number of pairs `(i, j)` for which `0 <= i < j < dominoes.length`,
Input: dominoes = [[1,2],[2,1],[3,4],[5,6]]
Output: 1
-**Constraints:**
+**Constraints**:
- `1 <= dominoes.length <= 40000`
- `1 <= dominoes[i][j] <= 9`
@@ -65,4 +65,11 @@ func numEquivDominoPairs(dominoes [][]int) int {
return result
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1100~1199/1123.Lowest-Common-Ancestor-of-Deepest-Leaves/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1100~1199/1137.N-th-Tribonacci-Number/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/1100~1199/1137.N-th-Tribonacci-Number.md b/website/content/ChapterFour/1100~1199/1137.N-th-Tribonacci-Number.md
new file mode 100755
index 000000000..74c1b0ed9
--- /dev/null
+++ b/website/content/ChapterFour/1100~1199/1137.N-th-Tribonacci-Number.md
@@ -0,0 +1,78 @@
+# [1137. N-th Tribonacci Number](https://leetcode.com/problems/n-th-tribonacci-number/)
+
+
+## 题目
+
+The Tribonacci sequence Tn is defined as follows:
+
+T0 = 0, T1 = 1, T2 = 1, and Tn+3 = Tn + Tn+1 + Tn+2 for n >= 0.
+
+Given `n`, return the value of Tn.
+
+**Example 1**:
+
+ Input: n = 4
+ Output: 4
+ Explanation:
+ T_3 = 0 + 1 + 1 = 2
+ T_4 = 1 + 1 + 2 = 4
+
+**Example 2**:
+
+ Input: n = 25
+ Output: 1389537
+
+**Constraints**:
+
+- `0 <= n <= 37`
+- The answer is guaranteed to fit within a 32-bit integer, ie. `answer <= 2^31 - 1`.
+
+
+## 题目大意
+
+
+泰波那契序列 Tn 定义如下：
+
+T0 = 0, T1 = 1, T2 = 1, 且在 n >= 0 的条件下 Tn+3 = Tn + Tn+1 + Tn+2
+
+给你整数 n，请返回第 n 个泰波那契数 Tn 的值。
+
+提示：
+
+- 0 <= n <= 37
+- 答案保证是一个 32 位整数，即 answer <= 2^31 - 1。
+
+
+
+## 解题思路
+
+- 求泰波那契数列中的第 n 个数。
+- 简单题，按照题意定义计算即可。
+
+
+## 代码
+
+```go
+
+package leetcode
+
+func tribonacci(n int) int {
+ if n < 2 {
+ return n
+ }
+ trib, prev, prev2 := 1, 1, 0
+ for n > 2 {
+ trib, prev, prev2 = trib+prev+prev2, trib, prev
+ n--
+ }
+ return trib
+}
+
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1100~1199/1128.Number-of-Equivalent-Domino-Pairs/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1100~1199/1143.Longest-Common-Subsequence/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/1100~1199/1143.Longest-Common-Subsequence.md b/website/content/ChapterFour/1100~1199/1143.Longest-Common-Subsequence.md
new file mode 100644
index 000000000..01e8b2fb8
--- /dev/null
+++ b/website/content/ChapterFour/1100~1199/1143.Longest-Common-Subsequence.md
@@ -0,0 +1,95 @@
+# [1143. Longest Common Subsequence](https://leetcode.com/problems/longest-common-subsequence/)
+
+## 题目
+
+Given two strings `text1` and `text2`, return *the length of their longest **common subsequence**.* If there is no **common subsequence**, return `0`.
+
+A **subsequence** of a string is a new string generated from the original string with some characters (can be none) deleted without changing the relative order of the remaining characters.
+
+- For example, `"ace"` is a subsequence of `"abcde"`.
+
+A **common subsequence** of two strings is a subsequence that is common to both strings.
+
+**Example 1:**
+
+```
+Input: text1 = "abcde", text2 = "ace"
+Output: 3
+Explanation: The longest common subsequence is "ace" and its length is 3.
+```
+
+**Example 2:**
+
+```
+Input: text1 = "abc", text2 = "abc"
+Output: 3
+Explanation: The longest common subsequence is "abc" and its length is 3.
+```
+
+**Example 3:**
+
+```
+Input: text1 = "abc", text2 = "def"
+Output: 0
+Explanation: There is no such common subsequence, so the result is 0.
+```
+
+**Constraints:**
+
+- `1 <= text1.length, text2.length <= 1000`
+- `text1` and `text2` consist of only lowercase English characters.
+
+## 题目大意
+
+给定两个字符串 text1 和 text2，返回这两个字符串的最长 公共子序列 的长度。如果不存在 公共子序列 ，返回 0 。一个字符串的 子序列 是指这样一个新的字符串：它是由原字符串在不改变字符的相对顺序的情况下删除某些字符（也可以不删除任何字符）后组成的新字符串。例如，"ace" 是 "abcde" 的子序列，但 "aec" 不是 "abcde" 的子序列。两个字符串的 公共子序列 是这两个字符串所共同拥有的子序列。
+
+## 解题思路
+
+- 这一题是经典的最长公共子序列的问题。解题思路是二维动态规划。假设字符串 `text1` 和 `text2` 的长度分别为 `m` 和 `n`，创建 `m+1` 行 `n+1` 列的二维数组 `dp`，定义 `dp[i][j]` 表示长度为 i 的 `text1[0:i-1]` 和长度为 j 的 `text2[0:j-1]` 的最长公共子序列的长度。先考虑边界条件。当 `i = 0` 时，`text1[]` 为空字符串，它与任何字符串的最长公共子序列的长度都是 `0`，所以 `dp[0][j] = 0`。同理当 `j = 0` 时，`text2[]` 为空字符串，它与任何字符串的最长公共子序列的长度都是 `0`，所以 `dp[i][0] = 0`。由于二维数组的大小特意增加了 `1`，即 `m+1` 和 `n+1`，并且默认值是 `0`，所以不需要再初始化赋值了。
+- 当 `text1[i−1] = text2[j−1]` 时，将这两个相同的字符称为公共字符，考虑 `text1[0:i−1]` 和 `text2[0:j−1]` 的最长公共子序列，再增加一个字符（即公共字符）即可得到 `text1[0:i]` 和 `text2[0:j]` 的最长公共子序列，所以 `dp[i][j]=dp[i−1][j−1]+1`。当 `text1[i−1] != text2[j−1]` 时，最长公共子序列一定在 `text[0:i-1], text2[0:j]` 和 `text[0:i], text2[0:j-1]` 中取得。即 `dp[i][j] = max(dp[i-1][j], dp[i][j-1])`。所以状态转移方程如下：
+
+ {{< katex display >}}
+ dp[i][j] = \left\{\begin{matrix}dp[i-1][j-1]+1 &,text1[i-1]=text2[j-1]\\max(dp[i-1][j],dp[i][j-1])&,text1[i-1]\neq text2[j-1]\end{matrix}\right.
+ {{< /katex >}}
+
+- 最终结果存储在 `dp[len(text1)][len(text2)]` 中。时间复杂度 `O(mn)`，空间复杂度 `O(mn)`，其中 `m` 和 `n` 分别是 `text1` 和 `text2` 的长度。
+
+## 代码
+
+```go
+package leetcode
+
+func longestCommonSubsequence(text1 string, text2 string) int {
+ if len(text1) == 0 || len(text2) == 0 {
+ return 0
+ }
+ dp := make([][]int, len(text1)+1)
+ for i := range dp {
+ dp[i] = make([]int, len(text2)+1)
+ }
+ for i := 1; i < len(text1)+1; i++ {
+ for j := 1; j < len(text2)+1; j++ {
+ if text1[i-1] == text2[j-1] {
+ dp[i][j] = dp[i-1][j-1] + 1
+ } else {
+ dp[i][j] = max(dp[i][j-1], dp[i-1][j])
+ }
+ }
+ }
+ return dp[len(text1)][len(text2)]
+}
+
+func max(a, b int) int {
+ if a > b {
+ return a
+ }
+ return b
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1100~1199/1137.N-th-Tribonacci-Number/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1100~1199/1145.Binary-Tree-Coloring-Game/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/1145.Binary-Tree-Coloring-Game.md b/website/content/ChapterFour/1100~1199/1145.Binary-Tree-Coloring-Game.md
similarity index 93%
rename from website/content/ChapterFour/1145.Binary-Tree-Coloring-Game.md
rename to website/content/ChapterFour/1100~1199/1145.Binary-Tree-Coloring-Game.md
index 02fbc6824..f04cc161c 100644
--- a/website/content/ChapterFour/1145.Binary-Tree-Coloring-Game.md
+++ b/website/content/ChapterFour/1100~1199/1145.Binary-Tree-Coloring-Game.md
@@ -79,4 +79,11 @@ func dfsBtreeGameWinningMove(node *TreeNode, left, right *int, x int) int {
}
return l + r + 1
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1100~1199/1143.Longest-Common-Subsequence/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1100~1199/1154.Day-of-the-Year/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/1154.Day-of-the-Year.md b/website/content/ChapterFour/1100~1199/1154.Day-of-the-Year.md
similarity index 82%
rename from website/content/ChapterFour/1154.Day-of-the-Year.md
rename to website/content/ChapterFour/1100~1199/1154.Day-of-the-Year.md
index 6b1bc846b..98e392d01 100755
--- a/website/content/ChapterFour/1154.Day-of-the-Year.md
+++ b/website/content/ChapterFour/1100~1199/1154.Day-of-the-Year.md
@@ -26,7 +26,7 @@ Given a string `date` representing a [Gregorian calendar](https://en.wikiped
Input: date = "2004-03-01"
Output: 61
-**Constraints:**
+**Constraints**:
- `date.length == 10`
- `date[4] == date[7] == '-'`, and all other `date[i]`'s are digits
@@ -78,4 +78,11 @@ func dayOfYear(date string) int {
return int(duration.Hours())/24 + 1
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1100~1199/1145.Binary-Tree-Coloring-Game/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1100~1199/1157.Online-Majority-Element-In-Subarray/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/1157.Online-Majority-Element-In-Subarray.md b/website/content/ChapterFour/1100~1199/1157.Online-Majority-Element-In-Subarray.md
similarity index 95%
rename from website/content/ChapterFour/1157.Online-Majority-Element-In-Subarray.md
rename to website/content/ChapterFour/1100~1199/1157.Online-Majority-Element-In-Subarray.md
index ac7d539b9..0fd147e49 100755
--- a/website/content/ChapterFour/1157.Online-Majority-Element-In-Subarray.md
+++ b/website/content/ChapterFour/1100~1199/1157.Online-Majority-Element-In-Subarray.md
@@ -19,7 +19,7 @@ Each `query(...)` returns the element in `arr[left], arr[left+1], ..., arr[ri
majorityChecker.query(0,3,3); // returns -1
majorityChecker.query(2,3,2); // returns 2
-**Constraints:**
+**Constraints**:
- `1 <= arr.length <= 20000`
- `1 <= arr[i] <= 20000`
@@ -193,4 +193,11 @@ func (mc *MajorityChecker) Query(left int, right int, threshold int) int {
* param_1 := obj.Query(left,right,threshold);
*/
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1100~1199/1154.Day-of-the-Year/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1100~1199/1160.Find-Words-That-Can-Be-Formed-by-Characters/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/1160.Find-Words-That-Can-Be-Formed-by-Characters.md b/website/content/ChapterFour/1100~1199/1160.Find-Words-That-Can-Be-Formed-by-Characters.md
similarity index 84%
rename from website/content/ChapterFour/1160.Find-Words-That-Can-Be-Formed-by-Characters.md
rename to website/content/ChapterFour/1100~1199/1160.Find-Words-That-Can-Be-Formed-by-Characters.md
index 5a73172da..a0e7603d9 100755
--- a/website/content/ChapterFour/1160.Find-Words-That-Can-Be-Formed-by-Characters.md
+++ b/website/content/ChapterFour/1100~1199/1160.Find-Words-That-Can-Be-Formed-by-Characters.md
@@ -78,4 +78,11 @@ func canBeFormed(w string, c []int) bool {
return true
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1100~1199/1157.Online-Majority-Element-In-Subarray/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1100~1199/1170.Compare-Strings-by-Frequency-of-the-Smallest-Character/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/1170.Compare-Strings-by-Frequency-of-the-Smallest-Character.md b/website/content/ChapterFour/1100~1199/1170.Compare-Strings-by-Frequency-of-the-Smallest-Character.md
similarity index 87%
rename from website/content/ChapterFour/1170.Compare-Strings-by-Frequency-of-the-Smallest-Character.md
rename to website/content/ChapterFour/1100~1199/1170.Compare-Strings-by-Frequency-of-the-Smallest-Character.md
index be6dfc0d6..987a39a81 100755
--- a/website/content/ChapterFour/1170.Compare-Strings-by-Frequency-of-the-Smallest-Character.md
+++ b/website/content/ChapterFour/1100~1199/1170.Compare-Strings-by-Frequency-of-the-Smallest-Character.md
@@ -18,7 +18,7 @@ Now, given string arrays `queries` and `words`, return an integer array `ans
Output: [1,2]
Explanation: On the first query only f("bbb") < f("aaaa"). On the second query both f("aaa") and f("aaaa") are both > f("cc").
-**Constraints:**
+**Constraints**:
- `1 <= queries.length <= 2000`
- `1 <= words.length <= 2000`
@@ -83,4 +83,11 @@ func countFunc(s string) int {
return count[i]
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1100~1199/1160.Find-Words-That-Can-Be-Formed-by-Characters/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1100~1199/1171.Remove-Zero-Sum-Consecutive-Nodes-from-Linked-List/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/1171.Remove-Zero-Sum-Consecutive-Nodes-from-Linked-List.md b/website/content/ChapterFour/1100~1199/1171.Remove-Zero-Sum-Consecutive-Nodes-from-Linked-List.md
similarity index 90%
rename from website/content/ChapterFour/1171.Remove-Zero-Sum-Consecutive-Nodes-from-Linked-List.md
rename to website/content/ChapterFour/1100~1199/1171.Remove-Zero-Sum-Consecutive-Nodes-from-Linked-List.md
index b71ad63b7..49e9862b9 100755
--- a/website/content/ChapterFour/1171.Remove-Zero-Sum-Consecutive-Nodes-from-Linked-List.md
+++ b/website/content/ChapterFour/1100~1199/1171.Remove-Zero-Sum-Consecutive-Nodes-from-Linked-List.md
@@ -25,7 +25,7 @@ After doing so, return the head of the final linked list. You may return any suc
Input: head = [1,2,3,-3,-2]
Output: [1]
-**Constraints:**
+**Constraints**:
- The given linked list will contain between `1` and `1000` nodes.
- Each node in the linked list has `-1000 <= node.val <= 1000`.
@@ -137,4 +137,11 @@ func removeZeroSumSublists1(head *ListNode) *ListNode {
return head
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1100~1199/1170.Compare-Strings-by-Frequency-of-the-Smallest-Character/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1100~1199/1175.Prime-Arrangements/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/1175.Prime-Arrangements.md b/website/content/ChapterFour/1100~1199/1175.Prime-Arrangements.md
similarity index 81%
rename from website/content/ChapterFour/1175.Prime-Arrangements.md
rename to website/content/ChapterFour/1100~1199/1175.Prime-Arrangements.md
index e5550e67a..a147da041 100755
--- a/website/content/ChapterFour/1175.Prime-Arrangements.md
+++ b/website/content/ChapterFour/1100~1199/1175.Prime-Arrangements.md
@@ -20,7 +20,7 @@ Since the answer may be large, return the answer **modulo `10^9 + 7`**.
Input: n = 100
Output: 682289015
-**Constraints:**
+**Constraints**:
- `1 <= n <= 100`
@@ -62,4 +62,11 @@ func factorial(n int) int {
return n * factorial(n-1) % 1000000007
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1100~1199/1171.Remove-Zero-Sum-Consecutive-Nodes-from-Linked-List/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1100~1199/1178.Number-of-Valid-Words-for-Each-Puzzle/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/1100~1199/1178.Number-of-Valid-Words-for-Each-Puzzle.md b/website/content/ChapterFour/1100~1199/1178.Number-of-Valid-Words-for-Each-Puzzle.md
new file mode 100644
index 000000000..bf708bb7d
--- /dev/null
+++ b/website/content/ChapterFour/1100~1199/1178.Number-of-Valid-Words-for-Each-Puzzle.md
@@ -0,0 +1,126 @@
+# [1178. Number of Valid Words for Each Puzzle](https://leetcode.com/problems/number-of-valid-words-for-each-puzzle/)
+
+
+## 题目
+
+With respect to a given `puzzle` string, a `word` is *valid* if both the following conditions are satisfied:
+
+- `word` contains the first letter of `puzzle`.
+- For each letter in `word`, that letter is in `puzzle`.For example, if the puzzle is "abcdefg", then valid words are "faced", "cabbage", and "baggage"; while invalid words are "beefed" (doesn't include "a") and "based" (includes "s" which isn't in the puzzle).
+
+Return an array `answer`, where `answer[i]` is the number of words in the given word list `words` that are valid with respect to the puzzle `puzzles[i]`.
+
+**Example :**
+
+```
+Input:
+words = ["aaaa","asas","able","ability","actt","actor","access"],
+puzzles = ["aboveyz","abrodyz","abslute","absoryz","actresz","gaswxyz"]
+Output: [1,1,3,2,4,0]
+Explanation:
+1 valid word for "aboveyz" : "aaaa"
+1 valid word for "abrodyz" : "aaaa"
+3 valid words for "abslute" : "aaaa", "asas", "able"
+2 valid words for "absoryz" : "aaaa", "asas"
+4 valid words for "actresz" : "aaaa", "asas", "actt", "access"
+There're no valid words for "gaswxyz" cause none of the words in the list contains letter 'g'.
+
+```
+
+**Constraints:**
+
+- `1 <= words.length <= 10^5`
+- `4 <= words[i].length <= 50`
+- `1 <= puzzles.length <= 10^4`
+- `puzzles[i].length == 7`
+- `words[i][j]`, `puzzles[i][j]` are English lowercase letters.
+- Each `puzzles[i]` doesn't contain repeated characters.
+
+## 题目大意
+
+外国友人仿照中国字谜设计了一个英文版猜字谜小游戏，请你来猜猜看吧。
+
+字谜的迷面 puzzle 按字符串形式给出，如果一个单词 word 符合下面两个条件，那么它就可以算作谜底：
+
+- 单词 word 中包含谜面 puzzle 的第一个字母。
+- 单词 word 中的每一个字母都可以在谜面 puzzle 中找到。
+例如，如果字谜的谜面是 "abcdefg"，那么可以作为谜底的单词有 "faced", "cabbage", 和 "baggage"；而 "beefed"（不含字母 "a"）以及 "based"（其中的 "s" 没有出现在谜面中）都不能作为谜底。
+
+返回一个答案数组 answer，数组中的每个元素 answer[i] 是在给出的单词列表 words 中可以作为字谜迷面 puzzles[i] 所对应的谜底的单词数目。
+
+提示：
+
+- 1 <= words.length <= 10^5
+- 4 <= words[i].length <= 50
+- 1 <= puzzles.length <= 10^4
+- puzzles[i].length == 7
+- words[i][j], puzzles[i][j] 都是小写英文字母。
+- 每个 puzzles[i] 所包含的字符都不重复。
+
+## 解题思路
+
+- 首先题目中两个限制条件非常关键：**puzzles[i].length == 7**，**每个 puzzles[i] 所包含的字符都不重复**。也就是说穷举每个puzzle的子串的搜索空间就是2^7=128，而且不用考虑去重问题。
+- 因为谜底的判断只跟字符是否出现有关，跟字符的个数无关，另外都是小写的英文字母，所以可以用 `bitmap` 来表示单词(word)。
+- 利用 `map` 记录不同状态的单词(word)的个数。
+- 根据题意，如果某个单词(word)是某个字谜(puzzle)的谜底，那么 `word` 的 `bitmap` 肯定对应于 `puzzle` 某个子串的 `bitmap` 表示，且 `bitmap` 中包含 `puzzle` 的第一个字母的 `bit` 占用。
+- 问题就转换为：求每一个 `puzzle` 的每一个子串，然后求和这个子串具有相同 `bitmap` 表示且 `word` 中包含 `puzzle` 的第一个字母的 `word` 的个数。
+
+## 代码
+
+```go
+
+package leetcode
+
+/*
+ 匹配跟单词中的字母顺序，字母个数都无关，可以用 bitmap 压缩
+ 1. 记录 word 中 利用 map 记录各种 bit 标示的个数
+ 2. puzzles 中各个字母都不相同! 记录 bitmap，然后搜索子空间中各种 bit 标识的个数的和
+ 因为 puzzles 长度最长是7，所以搜索空间 2^7
+*/
+func findNumOfValidWords(words []string, puzzles []string) []int {
+ wordBitStatusMap, res := make(map[uint32]int, 0), []int{}
+ for _, w := range words {
+ wordBitStatusMap[toBitMap([]byte(w))]++
+ }
+ for _, p := range puzzles {
+ var bitMap uint32
+ var totalNum int
+ bitMap |= (1 << (p[0] - 'a')) //work 中要包含 p 的第一个字母 所以这个 bit 位上必须是 1
+ findNum([]byte(p)[1:], bitMap, &totalNum, wordBitStatusMap)
+ res = append(res, totalNum)
+ }
+ return res
+}
+
+func toBitMap(word []byte) uint32 {
+ var res uint32
+ for _, b := range word {
+ res |= (1 << (b - 'a'))
+ }
+ return res
+}
+
+//利用 dfs 搜索 puzzles 的子空间
+func findNum(puzzles []byte, bitMap uint32, totalNum *int, m map[uint32]int) {
+ if len(puzzles) == 0 {
+ *totalNum = *totalNum + m[bitMap]
+ return
+ }
+ //不包含 puzzles[0],即 puzzles[0] 对应 bit 是 0
+ findNum(puzzles[1:], bitMap, totalNum, m)
+ //包含 puzzles[0],即 puzzles[0] 对应 bit 是 1
+ bitMap |= (1 << (puzzles[0] - 'a'))
+ findNum(puzzles[1:], bitMap, totalNum, m)
+ bitMap ^= (1 << (puzzles[0] - 'a')) //异或 清零
+ return
+}
+
+
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1100~1199/1175.Prime-Arrangements/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1100~1199/1184.Distance-Between-Bus-Stops/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/1184.Distance-Between-Bus-Stops.md b/website/content/ChapterFour/1100~1199/1184.Distance-Between-Bus-Stops.md
similarity index 86%
rename from website/content/ChapterFour/1184.Distance-Between-Bus-Stops.md
rename to website/content/ChapterFour/1100~1199/1184.Distance-Between-Bus-Stops.md
index 4f5f6c64a..6dbf09a27 100755
--- a/website/content/ChapterFour/1184.Distance-Between-Bus-Stops.md
+++ b/website/content/ChapterFour/1100~1199/1184.Distance-Between-Bus-Stops.md
@@ -32,7 +32,7 @@ Return the shortest distance between the given `start` and `destination` sto
Output: 4
Explanation: Distance between 0 and 3 is 6 or 4, minimum is 4.
-**Constraints:**
+**Constraints**:
- `1 <= n <= 10^4`
- `distance.length == n`
@@ -79,4 +79,11 @@ func distanceBetweenBusStops(distance []int, start int, destination int) int {
return counterclockwiseDis
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1100~1199/1178.Number-of-Valid-Words-for-Each-Puzzle/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1100~1199/1185.Day-of-the-Week/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/1185.Day-of-the-Week.md b/website/content/ChapterFour/1100~1199/1185.Day-of-the-Week.md
similarity index 77%
rename from website/content/ChapterFour/1185.Day-of-the-Week.md
rename to website/content/ChapterFour/1100~1199/1185.Day-of-the-Week.md
index 0eef0bcf8..e7489d101 100755
--- a/website/content/ChapterFour/1185.Day-of-the-Week.md
+++ b/website/content/ChapterFour/1100~1199/1185.Day-of-the-Week.md
@@ -24,7 +24,7 @@ Return the answer as one of the following values `{"Sunday", "Monday", "Tuesday
Input: day = 15, month = 8, year = 1993
Output: "Sunday"
-**Constraints:**
+**Constraints**:
- The given dates are valid dates between the years `1971` and `2100`.
@@ -58,4 +58,11 @@ func dayOfTheWeek(day int, month int, year int) string {
return time.Date(year, time.Month(month), day, 0, 0, 0, 0, time.Local).Weekday().String()
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1100~1199/1184.Distance-Between-Bus-Stops/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1100~1199/1189.Maximum-Number-of-Balloons/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/1189.Maximum-Number-of-Balloons.md b/website/content/ChapterFour/1100~1199/1189.Maximum-Number-of-Balloons.md
similarity index 82%
rename from website/content/ChapterFour/1189.Maximum-Number-of-Balloons.md
rename to website/content/ChapterFour/1100~1199/1189.Maximum-Number-of-Balloons.md
index 9fdae8753..ed9b096d8 100755
--- a/website/content/ChapterFour/1189.Maximum-Number-of-Balloons.md
+++ b/website/content/ChapterFour/1100~1199/1189.Maximum-Number-of-Balloons.md
@@ -26,7 +26,7 @@ You can use each character in `text` **at most once**. Return the maximum numb
Input: text = "leetcode"
Output: 0
-**Constraints:**
+**Constraints**:
- `1 <= text.length <= 10^4`
- `text` consists of lower case English letters only.
@@ -67,4 +67,11 @@ func maxNumberOfBalloons(text string) int {
return min(fre[1], min(fre[0], min(fre[11]/2, min(fre[14]/2, fre[13]))))
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1100~1199/1185.Day-of-the-Week/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1100~1199/1190.Reverse-Substrings-Between-Each-Pair-of-Parentheses/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/1100~1199/1190.Reverse-Substrings-Between-Each-Pair-of-Parentheses.md b/website/content/ChapterFour/1100~1199/1190.Reverse-Substrings-Between-Each-Pair-of-Parentheses.md
new file mode 100644
index 000000000..0e9fdafc6
--- /dev/null
+++ b/website/content/ChapterFour/1100~1199/1190.Reverse-Substrings-Between-Each-Pair-of-Parentheses.md
@@ -0,0 +1,91 @@
+# [1190. Reverse Substrings Between Each Pair of Parentheses](https://leetcode.com/problems/reverse-substrings-between-each-pair-of-parentheses/)
+
+
+## 题目
+
+You are given a string `s` that consists of lower case English letters and brackets.
+
+Reverse the strings in each pair of matching parentheses, starting from the innermost one.
+
+Your result should **not** contain any brackets.
+
+**Example 1:**
+
+```
+Input: s = "(abcd)"
+Output: "dcba"
+```
+
+**Example 2:**
+
+```
+Input: s = "(u(love)i)"
+Output: "iloveu"
+Explanation: The substring "love" is reversed first, then the whole string is reversed.
+```
+
+**Example 3:**
+
+```
+Input: s = "(ed(et(oc))el)"
+Output: "leetcode"
+Explanation: First, we reverse the substring "oc", then "etco", and finally, the whole string.
+```
+
+**Example 4:**
+
+```
+Input: s = "a(bcdefghijkl(mno)p)q"
+Output: "apmnolkjihgfedcbq"
+```
+
+**Constraints:**
+
+- `0 <= s.length <= 2000`
+- `s` only contains lower case English characters and parentheses.
+- It's guaranteed that all parentheses are balanced.
+
+## 题目大意
+
+给出一个字符串 s（仅含有小写英文字母和括号）。请你按照从括号内到外的顺序，逐层反转每对匹配括号中的字符串，并返回最终的结果。注意，您的结果中 不应 包含任何括号。
+
+## 解题思路
+
+- 本题最容易想到的思路是利用栈将每对括号里面的字符串入栈，当遇到 ")" 括号时出栈并逆序。由于用到了栈的数据结构，多层括号嵌套的问题也不用担心。这种边入栈出栈，逆序字符串的方法，时间复杂度是 O(n^2)，有没有可能进一步降低时间复杂度呢？
+- 上述解法中，存在重复遍历的情况。扫描原字符串的时候，入栈出栈已经扫描了一次，在 ")" 括号出栈时，逆序又会扫一遍已经入栈的字符串。这部分重复遍历的过程可以优化掉。第一次循环先标记出逆序区间。例如遇到 "(" 的时候，入栈并记录下它的下标，当遇到 ")" 的时候，意味着这一对括号匹配上了，所以将 ")" 的下标和之前入栈 "(" 的下标交换。此次遍历将逆序区间标记出来了。再遍历一次，根据逆序区间逆序字符串。不在逆序区间的字符串正常 append。如果在逆序区间内的，逆序遍历，添加到最终结果字符串中。这样做，时间复杂度仅为 O(n)。具体实现见下面代码。
+
+## 代码
+
+```go
+package leetcode
+
+func reverseParentheses(s string) string {
+ pair, stack := make([]int, len(s)), []int{}
+ for i, b := range s {
+ if b == '(' {
+ stack = append(stack, i)
+ } else if b == ')' {
+ j := stack[len(stack)-1]
+ stack = stack[:len(stack)-1]
+ pair[i], pair[j] = j, i
+ }
+ }
+ res := []byte{}
+ for i, step := 0, 1; i < len(s); i += step {
+ if s[i] == '(' || s[i] == ')' {
+ i = pair[i]
+ step = -step
+ } else {
+ res = append(res, s[i])
+ }
+ }
+ return string(res)
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1100~1199/1189.Maximum-Number-of-Balloons/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1200~1299/1200.Minimum-Absolute-Difference/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/1100~1199/_index.md b/website/content/ChapterFour/1100~1199/_index.md
new file mode 100644
index 000000000..d2021683f
--- /dev/null
+++ b/website/content/ChapterFour/1100~1199/_index.md
@@ -0,0 +1,5 @@
+---
+bookCollapseSection: true
+weight: 20
+---
+
diff --git a/website/content/ChapterFour/1108.Defanging-an-IP-Address.md b/website/content/ChapterFour/1108.Defanging-an-IP-Address.md
deleted file mode 100755
index 0eb4a7f90..000000000
--- a/website/content/ChapterFour/1108.Defanging-an-IP-Address.md
+++ /dev/null
@@ -1,54 +0,0 @@
-# [1108. Defanging an IP Address](https://leetcode.com/problems/defanging-an-ip-address/)
-
-
-## 题目
-
-Given a valid (IPv4) IP `address`, return a defanged version of that IP address.
-
-A *defanged IP address* replaces every period `"."` with `"[.]"`.
-
-**Example 1**:
-
- Input: address = "1.1.1.1"
- Output: "1[.]1[.]1[.]1"
-
-**Example 2**:
-
- Input: address = "255.100.50.0"
- Output: "255[.]100[.]50[.]0"
-
-**Constraints:**
-
-- The given `address` is a valid IPv4 address.
-
-## 题目大意
-
-
-给你一个有效的 IPv4 地址 address，返回这个 IP 地址的无效化版本。所谓无效化 IP 地址，其实就是用 "[.]" 代替了每个 "."。
-
-
-提示：
-
-- 给出的 address 是一个有效的 IPv4 地址
-
-
-
-## 解题思路
-
-- 给出一个 IP 地址，要求把点替换成 `[.]`。
-- 简单题，按照题意替换即可。
-
-
-## 代码
-
-```go
-
-package leetcode
-
-import "strings"
-
-func defangIPaddr(address string) string {
- return strings.Replace(address, ".", "[.]", -1)
-}
-
-```
\ No newline at end of file
diff --git a/website/content/ChapterFour/1137.N-th-Tribonacci-Number.md b/website/content/ChapterFour/1137.N-th-Tribonacci-Number.md
deleted file mode 100755
index f897528da..000000000
--- a/website/content/ChapterFour/1137.N-th-Tribonacci-Number.md
+++ /dev/null
@@ -1,71 +0,0 @@
-# [1137. N-th Tribonacci Number](https://leetcode.com/problems/n-th-tribonacci-number/)
-
-
-## 题目
-
-The Tribonacci sequence Tn is defined as follows:
-
-T0 = 0, T1 = 1, T2 = 1, and Tn+3 = Tn + Tn+1 + Tn+2 for n >= 0.
-
-Given `n`, return the value of Tn.
-
-**Example 1**:
-
- Input: n = 4
- Output: 4
- Explanation:
- T_3 = 0 + 1 + 1 = 2
- T_4 = 1 + 1 + 2 = 4
-
-**Example 2**:
-
- Input: n = 25
- Output: 1389537
-
-**Constraints:**
-
-- `0 <= n <= 37`
-- The answer is guaranteed to fit within a 32-bit integer, ie. `answer <= 2^31 - 1`.
-
-
-## 题目大意
-
-
-泰波那契序列 Tn 定义如下：
-
-T0 = 0, T1 = 1, T2 = 1, 且在 n >= 0 的条件下 Tn+3 = Tn + Tn+1 + Tn+2
-
-给你整数 n，请返回第 n 个泰波那契数 Tn 的值。
-
-提示：
-
-- 0 <= n <= 37
-- 答案保证是一个 32 位整数，即 answer <= 2^31 - 1。
-
-
-
-## 解题思路
-
-- 求泰波那契数列中的第 n 个数。
-- 简单题，按照题意定义计算即可。
-
-
-## 代码
-
-```go
-
-package leetcode
-
-func tribonacci(n int) int {
- if n < 2 {
- return n
- }
- trib, prev, prev2 := 1, 1, 0
- for n > 2 {
- trib, prev, prev2 = trib+prev+prev2, trib, prev
- n--
- }
- return trib
-}
-
-```
\ No newline at end of file
diff --git a/website/content/ChapterFour/1200.Minimum-Absolute-Difference.md b/website/content/ChapterFour/1200~1299/1200.Minimum-Absolute-Difference.md
similarity index 81%
rename from website/content/ChapterFour/1200.Minimum-Absolute-Difference.md
rename to website/content/ChapterFour/1200~1299/1200.Minimum-Absolute-Difference.md
index c52b77995..cfc42996d 100755
--- a/website/content/ChapterFour/1200.Minimum-Absolute-Difference.md
+++ b/website/content/ChapterFour/1200~1299/1200.Minimum-Absolute-Difference.md
@@ -27,7 +27,7 @@ Return a list of pairs in ascending order(with respect to pairs), each pair `[a
Input: arr = [3,8,-10,23,19,-4,-14,27]
Output: [[-14,-10],[19,23],[23,27]]
-**Constraints:**
+**Constraints**:
- `2 <= arr.length <= 10^5`
- `-10^6 <= arr[i] <= 10^6`
@@ -74,4 +74,11 @@ func minimumAbsDifference(arr []int) [][]int {
return res
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1100~1199/1190.Reverse-Substrings-Between-Each-Pair-of-Parentheses/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1200~1299/1201.Ugly-Number-III/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/1201.Ugly-Number-III.md b/website/content/ChapterFour/1200~1299/1201.Ugly-Number-III.md
similarity index 85%
rename from website/content/ChapterFour/1201.Ugly-Number-III.md
rename to website/content/ChapterFour/1200~1299/1201.Ugly-Number-III.md
index 171ebe8bf..a4a3299d5 100755
--- a/website/content/ChapterFour/1201.Ugly-Number-III.md
+++ b/website/content/ChapterFour/1200~1299/1201.Ugly-Number-III.md
@@ -30,7 +30,7 @@ Ugly numbers are **positive integers** which are divisible by `a` **or** `b
Input: n = 1000000000, a = 2, b = 217983653, c = 336916467
Output: 1999999984
-**Constraints:**
+**Constraints**:
- `1 <= n, a, b, c <= 10^9`
- `1 <= a * b * c <= 10^18`
@@ -89,4 +89,11 @@ func gcd(a, b int64) int64 {
return a
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1200~1299/1200.Minimum-Absolute-Difference/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1200~1299/1202.Smallest-String-With-Swaps/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/1202.Smallest-String-With-Swaps.md b/website/content/ChapterFour/1200~1299/1202.Smallest-String-With-Swaps.md
similarity index 85%
rename from website/content/ChapterFour/1202.Smallest-String-With-Swaps.md
rename to website/content/ChapterFour/1200~1299/1202.Smallest-String-With-Swaps.md
index 18527ba9d..da9f6cc3b 100755
--- a/website/content/ChapterFour/1202.Smallest-String-With-Swaps.md
+++ b/website/content/ChapterFour/1200~1299/1202.Smallest-String-With-Swaps.md
@@ -35,7 +35,7 @@ Return the lexicographically smallest string that `s` can be changed to after
Swap s[1] and s[2], s = "bac"
Swap s[0] and s[1], s = "abc"
-**Constraints:**
+**Constraints**:
- `1 <= s.length <= 10^5`
- `0 <= pairs.length <= 10^5`
@@ -72,7 +72,7 @@ package leetcode
import (
"sort"
- "github.com/halfrost/LeetCode-Go/template"
+ "github.com/halfrost/leetcode-go/template"
)
func smallestStringWithSwaps(s string, pairs [][]int) string {
@@ -99,4 +99,11 @@ func smallestStringWithSwaps(s string, pairs [][]int) string {
return string(res)
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1200~1299/1201.Ugly-Number-III/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1200~1299/1203.Sort-Items-by-Groups-Respecting-Dependencies/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/1200~1299/1203.Sort-Items-by-Groups-Respecting-Dependencies.md b/website/content/ChapterFour/1200~1299/1203.Sort-Items-by-Groups-Respecting-Dependencies.md
new file mode 100644
index 000000000..6cbdc8ced
--- /dev/null
+++ b/website/content/ChapterFour/1200~1299/1203.Sort-Items-by-Groups-Respecting-Dependencies.md
@@ -0,0 +1,198 @@
+# [1203. Sort Items by Groups Respecting Dependencies](https://leetcode.com/problems/sort-items-by-groups-respecting-dependencies/)
+
+
+## 题目
+
+There are `n` items each belonging to zero or one of `m` groups where `group[i]` is the group that the `i`-th item belongs to and it's equal to `-1` if the `i`-th item belongs to no group. The items and the groups are zero indexed. A group can have no item belonging to it.
+
+Return a sorted list of the items such that:
+
+- The items that belong to the same group are next to each other in the sorted list.
+- There are some relations between these items where `beforeItems[i]` is a list containing all the items that should come before the `i`th item in the sorted array (to the left of the `i`th item).
+
+Return any solution if there is more than one solution and return an **empty list** if there is no solution.
+
+**Example 1:**
+
+
+
+```
+Input: n = 8, m = 2, group = [-1,-1,1,0,0,1,0,-1], beforeItems = [[],[6],[5],[6],[3,6],[],[],[]]
+Output: [6,3,4,1,5,2,0,7]
+
+```
+
+**Example 2:**
+
+```
+Input: n = 8, m = 2, group = [-1,-1,1,0,0,1,0,-1], beforeItems = [[],[6],[5],[6],[3],[],[4],[]]
+Output: []
+Explanation: This is the same as example 1 except that 4 needs to be before 6 in the sorted list.
+
+```
+
+**Constraints:**
+
+- `1 <= m <= n <= 3 * 104`
+- `group.length == beforeItems.length == n`
+- `1 <= group[i] <= m - 1`
+- `0 <= beforeItems[i].length <= n - 1`
+- `0 <= beforeItems[i][j] <= n - 1`
+- `i != beforeItems[i][j]`
+- `beforeItems[i]` does not contain duplicates elements.
+
+## 题目大意
+
+有 n 个项目，每个项目或者不属于任何小组，或者属于 m 个小组之一。group[i] 表示第 i 个小组所属的小组，如果第 i 个项目不属于任何小组，则 group[i] 等于 -1。项目和小组都是从零开始编号的。可能存在小组不负责任何项目，即没有任何项目属于这个小组。
+
+请你帮忙按要求安排这些项目的进度，并返回排序后的项目列表：
+
+- 同一小组的项目，排序后在列表中彼此相邻。
+- 项目之间存在一定的依赖关系，我们用一个列表 beforeItems 来表示，其中 beforeItems[i] 表示在进行第 i 个项目前（位于第 i 个项目左侧）应该完成的所有项目。
+
+如果存在多个解决方案，只需要返回其中任意一个即可。如果没有合适的解决方案，就请返回一个 空列表 。
+
+## 解题思路
+
+- 读完题能确定这一题是拓扑排序。但是和单纯的拓扑排序有区别的是，同一小组内的项目需要彼此相邻。用 2 次拓扑排序即可解决。第一次拓扑排序排出组间的顺序，第二次拓扑排序排出组内的顺序。为了实现方便，用 map 给虚拟分组标记编号。如下图，将 3，4，6 三个任务打包到 0 号分组里面，将 2，5 两个任务打包到 1 号分组里面，其他任务单独各自为一组。组间的依赖是 6 号任务依赖 1 号任务。由于 6 号任务封装在 0 号分组里，所以 3 号分组依赖 0 号分组。先组间排序，确定分组顺序，再组内拓扑排序，排出最终顺序。
+
+ 
+
+- 上面的解法可以 AC，但是时间太慢了。因为做了一些不必要的操作。有没有可能只用一次拓扑排序呢？将必须要在一起的结点统一依赖一个虚拟结点，例如下图中的虚拟结点 8 和 9 。3，4，6 都依赖 8 号任务，2 和 5 都依赖 9 号任务。1 号任务本来依赖 6 号任务，由于 6 由依赖 8 ，所以添加 1 依赖 8 的边。通过增加虚拟结点，增加了需要打包在一起结点的入度。构建出以上关系以后，按照入度为 0 的原则，依次进行 DFS。8 号和 9 号两个虚拟结点的入度都为 0 ，对它们进行 DFS，必定会使得与它关联的节点都被安排在一起，这样就满足了题意：同一小组的项目，排序后在列表中彼此相邻。一遍扫完，满足题意的顺序就排出来了。这个解法 beat 100%！
+
+ 
+
+## 代码
+
+```go
+package leetcode
+
+// 解法一 拓扑排序版的 DFS
+func sortItems(n int, m int, group []int, beforeItems [][]int) []int {
+ groups, inDegrees := make([][]int, n+m), make([]int, n+m)
+ for i, g := range group {
+ if g > -1 {
+ g += n
+ groups[g] = append(groups[g], i)
+ inDegrees[i]++
+ }
+ }
+ for i, ancestors := range beforeItems {
+ gi := group[i]
+ if gi == -1 {
+ gi = i
+ } else {
+ gi += n
+ }
+ for _, ancestor := range ancestors {
+ ga := group[ancestor]
+ if ga == -1 {
+ ga = ancestor
+ } else {
+ ga += n
+ }
+ if gi == ga {
+ groups[ancestor] = append(groups[ancestor], i)
+ inDegrees[i]++
+ } else {
+ groups[ga] = append(groups[ga], gi)
+ inDegrees[gi]++
+ }
+ }
+ }
+ res := []int{}
+ for i, d := range inDegrees {
+ if d == 0 {
+ sortItemsDFS(i, n, &res, &inDegrees, &groups)
+ }
+ }
+ if len(res) != n {
+ return nil
+ }
+ return res
+}
+
+func sortItemsDFS(i, n int, res, inDegrees *[]int, groups *[][]int) {
+ if i < n {
+ *res = append(*res, i)
+ }
+ (*inDegrees)[i] = -1
+ for _, ch := range (*groups)[i] {
+ if (*inDegrees)[ch]--; (*inDegrees)[ch] == 0 {
+ sortItemsDFS(ch, n, res, inDegrees, groups)
+ }
+ }
+}
+
+// 解法二 二维拓扑排序 时间复杂度 O(m+n)，空间复杂度 O(m+n)
+func sortItems1(n int, m int, group []int, beforeItems [][]int) []int {
+ groupItems, res := map[int][]int{}, []int{}
+ for i := 0; i < len(group); i++ {
+ if group[i] == -1 {
+ group[i] = m + i
+ }
+ groupItems[group[i]] = append(groupItems[group[i]], i)
+ }
+ groupGraph, groupDegree, itemGraph, itemDegree := make([][]int, m+n), make([]int, m+n), make([][]int, n), make([]int, n)
+ for i := 0; i < len(beforeItems); i++ {
+ for j := 0; j < len(beforeItems[i]); j++ {
+ if group[beforeItems[i][j]] != group[i] {
+ // 不同组项目，确定组间依赖关系
+ groupGraph[group[beforeItems[i][j]]] = append(groupGraph[group[beforeItems[i][j]]], group[i])
+ groupDegree[group[i]]++
+ } else {
+ // 同组项目，确定组内依赖关系
+ itemGraph[beforeItems[i][j]] = append(itemGraph[beforeItems[i][j]], i)
+ itemDegree[i]++
+ }
+ }
+ }
+ items := []int{}
+ for i := 0; i < m+n; i++ {
+ items = append(items, i)
+ }
+ // 组间拓扑
+ groupOrders := topSort(groupGraph, groupDegree, items)
+ if len(groupOrders) < len(items) {
+ return nil
+ }
+ for i := 0; i < len(groupOrders); i++ {
+ items := groupItems[groupOrders[i]]
+ // 组内拓扑
+ orders := topSort(itemGraph, itemDegree, items)
+ if len(orders) < len(items) {
+ return nil
+ }
+ res = append(res, orders...)
+ }
+ return res
+}
+
+func topSort(graph [][]int, deg, items []int) (orders []int) {
+ q := []int{}
+ for _, i := range items {
+ if deg[i] == 0 {
+ q = append(q, i)
+ }
+ }
+ for len(q) > 0 {
+ from := q[0]
+ q = q[1:]
+ orders = append(orders, from)
+ for _, to := range graph[from] {
+ deg[to]--
+ if deg[to] == 0 {
+ q = append(q, to)
+ }
+ }
+ }
+ return
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1200~1299/1202.Smallest-String-With-Swaps/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1200~1299/1207.Unique-Number-of-Occurrences/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/1207.Unique-Number-of-Occurrences.md b/website/content/ChapterFour/1200~1299/1207.Unique-Number-of-Occurrences.md
similarity index 76%
rename from website/content/ChapterFour/1207.Unique-Number-of-Occurrences.md
rename to website/content/ChapterFour/1200~1299/1207.Unique-Number-of-Occurrences.md
index 43e3c6f83..acd4c99da 100755
--- a/website/content/ChapterFour/1207.Unique-Number-of-Occurrences.md
+++ b/website/content/ChapterFour/1200~1299/1207.Unique-Number-of-Occurrences.md
@@ -21,7 +21,7 @@ Given an array of integers `arr`, write a function that returns `true` if an
Input: arr = [-3,0,1,-3,1,1,1,-3,10,0]
Output: true
-**Constraints:**
+**Constraints**:
- `1 <= arr.length <= 1000`
- `-1000 <= arr[i] <= 1000`
@@ -65,4 +65,11 @@ func uniqueOccurrences(arr []int) bool {
return true
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1200~1299/1203.Sort-Items-by-Groups-Respecting-Dependencies/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1200~1299/1208.Get-Equal-Substrings-Within-Budget/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/1208.Get-Equal-Substrings-Within-Budget.md b/website/content/ChapterFour/1200~1299/1208.Get-Equal-Substrings-Within-Budget.md
similarity index 87%
rename from website/content/ChapterFour/1208.Get-Equal-Substrings-Within-Budget.md
rename to website/content/ChapterFour/1200~1299/1208.Get-Equal-Substrings-Within-Budget.md
index 5d0474f57..24435f65d 100755
--- a/website/content/ChapterFour/1208.Get-Equal-Substrings-Within-Budget.md
+++ b/website/content/ChapterFour/1200~1299/1208.Get-Equal-Substrings-Within-Budget.md
@@ -29,7 +29,7 @@ If there is no substring from `s` that can be changed to its corresponding sub
Output: 1
Explanation: You can't make any change, so the maximum length is 1.
-**Constraints:**
+**Constraints**:
- `1 <= s.length, t.length <= 10^5`
- `0 <= maxCost <= 10^6`
@@ -74,4 +74,11 @@ func equalSubstring(s string, t string, maxCost int) int {
return res
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1200~1299/1207.Unique-Number-of-Occurrences/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1200~1299/1209.Remove-All-Adjacent-Duplicates-in-String-II/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/1200~1299/1209.Remove-All-Adjacent-Duplicates-in-String-II.md b/website/content/ChapterFour/1200~1299/1209.Remove-All-Adjacent-Duplicates-in-String-II.md
new file mode 100644
index 000000000..6a59f20e9
--- /dev/null
+++ b/website/content/ChapterFour/1200~1299/1209.Remove-All-Adjacent-Duplicates-in-String-II.md
@@ -0,0 +1,113 @@
+# [1209. Remove All Adjacent Duplicates in String II](https://leetcode.com/problems/remove-all-adjacent-duplicates-in-string-ii/)
+
+
+## 题目
+
+Given a string `s`, a *k* *duplicate removal* consists of choosing `k` adjacent and equal letters from `s` and removing them causing the left and the right side of the deleted substring to concatenate together.
+
+We repeatedly make `k` duplicate removals on `s` until we no longer can.
+
+Return the final string after all such duplicate removals have been made.
+
+It is guaranteed that the answer is unique.
+
+**Example 1:**
+
+```
+Input: s = "abcd", k = 2
+Output: "abcd"
+Explanation:There's nothing to delete.
+```
+
+**Example 2:**
+
+```
+Input: s = "deeedbbcccbdaa", k = 3
+Output: "aa"
+Explanation:
+First delete "eee" and "ccc", get "ddbbbdaa"
+Then delete "bbb", get "dddaa"
+Finally delete "ddd", get "aa"
+```
+
+**Example 3:**
+
+```
+Input: s = "pbbcggttciiippooaais", k = 2
+Output: "ps"
+```
+
+**Constraints:**
+
+- `1 <= s.length <= 10^5`
+- `2 <= k <= 10^4`
+- `s` only contains lower case English letters.
+
+## 题目大意
+
+给你一个字符串 s，「k 倍重复项删除操作」将会从 s 中选择 k 个相邻且相等的字母，并删除它们，使被删去的字符串的左侧和右侧连在一起。你需要对 s 重复进行无限次这样的删除操作，直到无法继续为止。在执行完所有删除操作后，返回最终得到的字符串。本题答案保证唯一。
+
+## 解题思路
+
+- 暴力解法。每增加一个字符，就往前扫描 `k` 位，判断是否存在 `k` 个连续相同的字符。消除了 `k` 个相同字符后，重新组成的字符串还可能再次产出 `k` 位相同的字符，（类似消消乐，`k` 个相同的字符碰到一起就“消除”），还需要继续消除。最差情况要再次扫描一次字符串。时间复杂度 O(n^2)，空间复杂度 O(n)。
+- 暴力解法的低效在于重复统计字符频次，如果每个字符的频次统计一次就好了。按照这个思路，利用 stack ，每个栈元素存 2 个值，一个是字符，一个是该字符对应的频次。有了栈顶字符频次信息，就不需要重复往前扫描了。只要栈顶字符频次到达了 `k`，就弹出该字符。如此反复，最终剩下的字符串为所求。时间复杂度 O(n)，空间复杂度 O(n)。
+
+## 代码
+
+```go
+package leetcode
+
+// 解法一 stack
+func removeDuplicates(s string, k int) string {
+ stack, arr := [][2]int{}, []byte{}
+ for _, c := range s {
+ i := int(c - 'a')
+ if len(stack) > 0 && stack[len(stack)-1][0] == i {
+ stack[len(stack)-1][1]++
+ if stack[len(stack)-1][1] == k {
+ stack = stack[:len(stack)-1]
+ }
+ } else {
+ stack = append(stack, [2]int{i, 1})
+ }
+ }
+ for _, pair := range stack {
+ c := byte(pair[0] + 'a')
+ for i := 0; i < pair[1]; i++ {
+ arr = append(arr, c)
+ }
+ }
+ return string(arr)
+}
+
+// 解法二 暴力
+func removeDuplicates1(s string, k int) string {
+ arr, count, tmp := []rune{}, 0, '#'
+ for _, v := range s {
+ arr = append(arr, v)
+ for len(arr) > 0 {
+ count = 0
+ tmp = arr[len(arr)-1]
+ for i := len(arr) - 1; i >= 0; i-- {
+ if arr[i] != tmp {
+ break
+ }
+ count++
+ }
+ if count == k {
+ arr = arr[:len(arr)-k]
+ } else {
+ break
+ }
+ }
+ }
+ return string(arr)
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1200~1299/1208.Get-Equal-Substrings-Within-Budget/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1200~1299/1217.Minimum-Cost-to-Move-Chips-to-The-Same-Position/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/1200~1299/1217.Minimum-Cost-to-Move-Chips-to-The-Same-Position.md b/website/content/ChapterFour/1200~1299/1217.Minimum-Cost-to-Move-Chips-to-The-Same-Position.md
new file mode 100755
index 000000000..feea53ba6
--- /dev/null
+++ b/website/content/ChapterFour/1200~1299/1217.Minimum-Cost-to-Move-Chips-to-The-Same-Position.md
@@ -0,0 +1,83 @@
+# [1217. Minimum Cost to Move Chips to The Same Position](https://leetcode.com/problems/minimum-cost-to-move-chips-to-the-same-position/)
+
+
+## 题目
+
+There are some chips, and the i-th chip is at position `chips[i]`.
+
+You can perform any of the two following types of moves **any number of times** (possibly zero) **on any chip**:
+
+- Move the `i`-th chip by 2 units to the left or to the right with a cost of **0**.
+- Move the `i`-th chip by 1 unit to the left or to the right with a cost of **1**.
+
+There can be two or more chips at the same position initially.
+
+Return the minimum cost needed to move all the chips to the same position (any position).
+
+**Example 1**:
+
+ Input: chips = [1,2,3]
+ Output: 1
+ Explanation: Second chip will be moved to positon 3 with cost 1. First chip will be moved to position 3 with cost 0. Total cost is 1.
+
+**Example 2**:
+
+ Input: chips = [2,2,2,3,3]
+ Output: 2
+ Explanation: Both fourth and fifth chip will be moved to position two with cost 1. Total minimum cost will be 2.
+
+**Constraints**:
+
+- `1 <= chips.length <= 100`
+- `1 <= chips[i] <= 10^9`
+
+
+## 题目大意
+
+
+数轴上放置了一些筹码，每个筹码的位置存在数组 chips 当中。你可以对 任何筹码 执行下面两种操作之一（不限操作次数，0 次也可以）：
+
+- 将第 i 个筹码向左或者右移动 2 个单位，代价为 0。
+- 将第 i 个筹码向左或者右移动 1 个单位，代价为 1。
+
+最开始的时候，同一位置上也可能放着两个或者更多的筹码。返回将所有筹码移动到同一位置（任意位置）上所需要的最小代价。
+
+
+提示：
+
+- 1 <= chips.length <= 100
+- 1 <= chips[i] <= 10^9
+
+
+## 解题思路
+
+- 给出一个数组，数组的下标代表的是数轴上的坐标点，数组的元素代表的是砝码大小。砝码移动规则，左右移动 2 格，没有代价，左右移动 1 个，代价是 1 。问最终把砝码都移动到一个格子上，最小代价是多少。
+- 先解读砝码移动规则：偶数位置的到偶数位置的没有代价，奇数到奇数位置的没有代价。利用这个规则，我们可以把所有的砝码**无代价**的摞在一个奇数的位置上和一个偶数的位置上。这样我们只用关心这两个位置了。并且这两个位置可以连续在一起。最后一步即将相邻的这两摞砝码合并到一起。由于左右移动一个代价是 1，所以最小代价的操作是移动最少砝码的那一边。奇数位置上砝码少就移动奇数位置上的，偶数位置上砝码少就移动偶数位置上的。所以这道题解法变的异常简单，遍历一次数组，找到其中有多少个奇数和偶数位置的砝码，取其中比较少的，就是最终答案。
+
+
+## 代码
+
+```go
+
+package leetcode
+
+func minCostToMoveChips(chips []int) int {
+ odd, even := 0, 0
+ for _, c := range chips {
+ if c%2 == 0 {
+ even++
+ } else {
+ odd++
+ }
+ }
+ return min(odd, even)
+}
+
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1200~1299/1209.Remove-All-Adjacent-Duplicates-in-String-II/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1200~1299/1221.Split-a-String-in-Balanced-Strings/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/1221.Split-a-String-in-Balanced-Strings.md b/website/content/ChapterFour/1200~1299/1221.Split-a-String-in-Balanced-Strings.md
similarity index 79%
rename from website/content/ChapterFour/1221.Split-a-String-in-Balanced-Strings.md
rename to website/content/ChapterFour/1200~1299/1221.Split-a-String-in-Balanced-Strings.md
index 5a50681b3..d17358657 100755
--- a/website/content/ChapterFour/1221.Split-a-String-in-Balanced-Strings.md
+++ b/website/content/ChapterFour/1200~1299/1221.Split-a-String-in-Balanced-Strings.md
@@ -27,7 +27,7 @@ Return the maximum amount of splitted balanced strings.
Output: 1
Explanation: s can be split into "LLLLRRRR".
-**Constraints:**
+**Constraints**:
- `1 <= s.length <= 1000`
- `s[i] = 'L' or 'R'`
@@ -70,4 +70,11 @@ func balancedStringSplit(s string) int {
return res
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1200~1299/1217.Minimum-Cost-to-Move-Chips-to-The-Same-Position/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1200~1299/1232.Check-If-It-Is-a-Straight-Line/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/1232.Check-If-It-Is-a-Straight-Line.md b/website/content/ChapterFour/1200~1299/1232.Check-If-It-Is-a-Straight-Line.md
similarity index 81%
rename from website/content/ChapterFour/1232.Check-If-It-Is-a-Straight-Line.md
rename to website/content/ChapterFour/1200~1299/1232.Check-If-It-Is-a-Straight-Line.md
index a6bdd744c..07ad32d47 100755
--- a/website/content/ChapterFour/1232.Check-If-It-Is-a-Straight-Line.md
+++ b/website/content/ChapterFour/1200~1299/1232.Check-If-It-Is-a-Straight-Line.md
@@ -20,7 +20,7 @@ You are given an array `coordinates`, `coordinates[i] = [x, y]`, where `[x, y
Input: coordinates = [[1,1],[2,2],[3,4],[4,5],[5,6],[7,7]]
Output: false
-**Constraints:**
+**Constraints**:
- `2 <= coordinates.length <= 1000`
- `coordinates[i].length == 2`
@@ -68,4 +68,11 @@ func checkStraightLine(coordinates [][]int) bool {
return true
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1200~1299/1221.Split-a-String-in-Balanced-Strings/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1200~1299/1234.Replace-the-Substring-for-Balanced-String/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/1234.Replace-the-Substring-for-Balanced-String.md b/website/content/ChapterFour/1200~1299/1234.Replace-the-Substring-for-Balanced-String.md
similarity index 90%
rename from website/content/ChapterFour/1234.Replace-the-Substring-for-Balanced-String.md
rename to website/content/ChapterFour/1200~1299/1234.Replace-the-Substring-for-Balanced-String.md
index f5584b74f..50847fe1e 100755
--- a/website/content/ChapterFour/1234.Replace-the-Substring-for-Balanced-String.md
+++ b/website/content/ChapterFour/1200~1299/1234.Replace-the-Substring-for-Balanced-String.md
@@ -35,7 +35,7 @@ Return 0 if the string is already **balanced**.
Output: 3
Explanation: We can replace the last 3 'Q' to make s = "QWER".
-**Constraints:**
+**Constraints**:
- `1 <= s.length <= 10^5`
- `s.length` is a multiple of `4`
@@ -90,4 +90,11 @@ func balancedString(s string) int {
return res
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1200~1299/1232.Check-If-It-Is-a-Straight-Line/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1200~1299/1235.Maximum-Profit-in-Job-Scheduling/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/1235.Maximum-Profit-in-Job-Scheduling.md b/website/content/ChapterFour/1200~1299/1235.Maximum-Profit-in-Job-Scheduling.md
similarity index 90%
rename from website/content/ChapterFour/1235.Maximum-Profit-in-Job-Scheduling.md
rename to website/content/ChapterFour/1200~1299/1235.Maximum-Profit-in-Job-Scheduling.md
index 915b54335..ca4826f49 100755
--- a/website/content/ChapterFour/1235.Maximum-Profit-in-Job-Scheduling.md
+++ b/website/content/ChapterFour/1200~1299/1235.Maximum-Profit-in-Job-Scheduling.md
@@ -34,7 +34,7 @@ If you choose a job that ends at time `X` you will be able to start another j
Input: startTime = [1,1,1], endTime = [2,3,4], profit = [5,6,4]
Output: 6
-**Constraints:**
+**Constraints**:
- `1 <= startTime.length == endTime.length == profit.length <= 5 * 10^4`
- `1 <= startTime[i] < endTime[i] <= 10^9`
@@ -115,4 +115,11 @@ func (s sortJobs) Swap(i, j int) {
s[i], s[j] = s[j], s[i]
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1200~1299/1234.Replace-the-Substring-for-Balanced-String/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1200~1299/1239.Maximum-Length-of-a-Concatenated-String-with-Unique-Characters/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/1200~1299/1239.Maximum-Length-of-a-Concatenated-String-with-Unique-Characters.md b/website/content/ChapterFour/1200~1299/1239.Maximum-Length-of-a-Concatenated-String-with-Unique-Characters.md
new file mode 100644
index 000000000..86d530b44
--- /dev/null
+++ b/website/content/ChapterFour/1200~1299/1239.Maximum-Length-of-a-Concatenated-String-with-Unique-Characters.md
@@ -0,0 +1,95 @@
+# [1239. Maximum Length of a Concatenated String with Unique Characters](https://leetcode.com/problems/maximum-length-of-a-concatenated-string-with-unique-characters/)
+
+## 题目
+
+Given an array of strings `arr`. String `s` is a concatenation of a sub-sequence of `arr` which have **unique characters**.
+
+Return *the maximum possible length* of `s`.
+
+**Example 1:**
+
+```
+Input: arr = ["un","iq","ue"]
+Output: 4
+Explanation: All possible concatenations are "","un","iq","ue","uniq" and "ique".
+Maximum length is 4.
+```
+
+**Example 2:**
+
+```
+Input: arr = ["cha","r","act","ers"]
+Output: 6
+Explanation: Possible solutions are "chaers" and "acters".
+```
+
+**Example 3:**
+
+```
+Input: arr = ["abcdefghijklmnopqrstuvwxyz"]
+Output: 26
+```
+
+**Constraints:**
+
+- `1 <= arr.length <= 16`
+- `1 <= arr[i].length <= 26`
+- `arr[i]` contains only lower case English letters.
+
+## 题目大意
+
+给定一个字符串数组 arr，字符串 s 是将 arr 某一子序列字符串连接所得的字符串，如果 s 中的每一个字符都只出现过一次，那么它就是一个可行解。请返回所有可行解 s 中最长长度。
+
+## 解题思路
+
+- 每个字符串数组可以想象为 26 位的 0101 二进制串。出现的字符对应的位上标记为 1，没有出现的字符对应的位上标记为 0 。如果一个字符串中包含重复的字符，那么它所有 1 的个数一定不等于字符串的长度。如果 2 个字符串每个字母都只出现了一次，那么它们俩对应的二进制串 mask 相互与运算的结果一定为 0 ，即 0，1 互补了。利用这个特点，深搜所有解，保存出最长可行解的长度即可。
+
+## 代码
+
+```go
+package leetcode
+
+import (
+ "math/bits"
+)
+
+func maxLength(arr []string) int {
+ c, res := []uint32{}, 0
+ for _, s := range arr {
+ var mask uint32
+ for _, c := range s {
+ mask = mask | 1<<(c-'a')
+ }
+ if len(s) != bits.OnesCount32(mask) { // 如果字符串本身带有重复的字符，需要排除
+ continue
+ }
+ c = append(c, mask)
+ }
+ dfs(c, 0, 0, &res)
+ return res
+}
+
+func dfs(c []uint32, index int, mask uint32, res *int) {
+ *res = max(*res, bits.OnesCount32(mask))
+ for i := index; i < len(c); i++ {
+ if mask&c[i] == 0 {
+ dfs(c, i+1, mask|c[i], res)
+ }
+ }
+ return
+}
+
+func max(a, b int) int {
+ if a > b {
+ return a
+ }
+ return b
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1200~1299/1235.Maximum-Profit-in-Job-Scheduling/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1200~1299/1249.Minimum-Remove-to-Make-Valid-Parentheses/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/1200~1299/1249.Minimum-Remove-to-Make-Valid-Parentheses.md b/website/content/ChapterFour/1200~1299/1249.Minimum-Remove-to-Make-Valid-Parentheses.md
new file mode 100644
index 000000000..c1936b889
--- /dev/null
+++ b/website/content/ChapterFour/1200~1299/1249.Minimum-Remove-to-Make-Valid-Parentheses.md
@@ -0,0 +1,102 @@
+# [1249. Minimum Remove to Make Valid Parentheses](https://leetcode.com/problems/minimum-remove-to-make-valid-parentheses/)
+
+
+## 题目
+
+Given a string s of `'('` , `')'` and lowercase English characters.
+
+Your task is to remove the minimum number of parentheses ( `'('` or `')'`, in any positions ) so that the resulting *parentheses string* is valid and return **any** valid string.
+
+Formally, a *parentheses string* is valid if and only if:
+
+- It is the empty string, contains only lowercase characters, or
+- It can be written as `AB` (`A` concatenated with `B`), where `A` and `B` are valid strings, or
+- It can be written as `(A)`, where `A` is a valid string.
+
+**Example 1:**
+
+```
+Input: s = "lee(t(c)o)de)"
+Output: "lee(t(c)o)de"
+Explanation: "lee(t(co)de)" , "lee(t(c)ode)" would also be accepted.
+
+```
+
+**Example 2:**
+
+```
+Input: s = "a)b(c)d"
+Output: "ab(c)d"
+
+```
+
+**Example 3:**
+
+```
+Input: s = "))(("
+Output: ""
+Explanation: An empty string is also valid.
+
+```
+
+**Example 4:**
+
+```
+Input: s = "(a(b(c)d)"
+Output: "a(b(c)d)"
+
+```
+
+**Constraints:**
+
+- `1 <= s.length <= 10^5`
+- `s[i]` is one of `'('` , `')'` and lowercase English letters`.`
+
+## 题目大意
+
+给你一个由 '('、')' 和小写字母组成的字符串 s。你需要从字符串中删除最少数目的 '(' 或者 ')' （可以删除任意位置的括号)，使得剩下的「括号字符串」有效。请返回任意一个合法字符串。有效「括号字符串」应当符合以下 任意一条 要求：
+
+- 空字符串或只包含小写字母的字符串
+- 可以被写作 AB（A 连接 B）的字符串，其中 A 和 B 都是有效「括号字符串」
+- 可以被写作 (A) 的字符串，其中 A 是一个有效的「括号字符串」
+
+## 解题思路
+
+- 最容易想到的思路是利用栈判断括号匹配是否有效。这个思路可行，时间复杂度也只是 O(n)。
+- 不用栈，可以 2 次循环遍历，正向遍历一次，标记出多余的 `'('` ，逆向遍历一次，再标记出多余的 `')'`，最后将所有这些标记多余的字符删掉即可。这种解法写出来的代码也很简洁，时间复杂度也是 O(n)。
+- 针对上面的解法再改进一点。正向遍历的时候不仅标记出多余的 `'('`，还可以顺手把多余的 `')'` 删除。这样只用循环一次。最后再删除掉多余的 `'('` 即可。时间复杂度还是 O(n)。
+
+## 代码
+
+```go
+package leetcode
+
+func minRemoveToMakeValid(s string) string {
+ res, opens := []byte{}, 0
+ for i := 0; i < len(s); i++ {
+ if s[i] == '(' {
+ opens++
+ } else if s[i] == ')' {
+ if opens == 0 {
+ continue
+ }
+ opens--
+ }
+ res = append(res, s[i])
+ }
+ for i := len(res) - 1; i >= 0; i-- {
+ if res[i] == '(' && opens > 0 {
+ opens--
+ res = append(res[:i], res[i+1:]...)
+ }
+ }
+ return string(res)
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1200~1299/1239.Maximum-Length-of-a-Concatenated-String-with-Unique-Characters/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1200~1299/1252.Cells-with-Odd-Values-in-a-Matrix/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/1252.Cells-with-Odd-Values-in-a-Matrix.md b/website/content/ChapterFour/1200~1299/1252.Cells-with-Odd-Values-in-a-Matrix.md
similarity index 87%
rename from website/content/ChapterFour/1252.Cells-with-Odd-Values-in-a-Matrix.md
rename to website/content/ChapterFour/1200~1299/1252.Cells-with-Odd-Values-in-a-Matrix.md
index 14db287ae..61913d739 100755
--- a/website/content/ChapterFour/1252.Cells-with-Odd-Values-in-a-Matrix.md
+++ b/website/content/ChapterFour/1200~1299/1252.Cells-with-Odd-Values-in-a-Matrix.md
@@ -25,7 +25,7 @@ Return *the number of cells with odd values* in the matrix after applying the
Output: 0
Explanation: Final matrix = [[2,2],[2,2]]. There is no odd number in the final matrix.
-**Constraints:**
+**Constraints**:
- `1 <= n <= 50`
- `1 <= m <= 50`
@@ -100,4 +100,11 @@ func oddCells1(n int, m int, indices [][]int) int {
return count
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1200~1299/1249.Minimum-Remove-to-Make-Valid-Parentheses/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1200~1299/1254.Number-of-Closed-Islands/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/1254.Number-of-Closed-Islands.md b/website/content/ChapterFour/1200~1299/1254.Number-of-Closed-Islands.md
similarity index 89%
rename from website/content/ChapterFour/1254.Number-of-Closed-Islands.md
rename to website/content/ChapterFour/1200~1299/1254.Number-of-Closed-Islands.md
index 3ff8da1a2..96e175c9a 100755
--- a/website/content/ChapterFour/1254.Number-of-Closed-Islands.md
+++ b/website/content/ChapterFour/1200~1299/1254.Number-of-Closed-Islands.md
@@ -107,4 +107,11 @@ func isIntInBoard(board [][]int, x, y int) bool {
return x >= 0 && x < len(board) && y >= 0 && y < len(board[0])
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1200~1299/1252.Cells-with-Odd-Values-in-a-Matrix/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1200~1299/1260.Shift-2D-Grid/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/1260.Shift-2D-Grid.md b/website/content/ChapterFour/1200~1299/1260.Shift-2D-Grid.md
similarity index 85%
rename from website/content/ChapterFour/1260.Shift-2D-Grid.md
rename to website/content/ChapterFour/1200~1299/1260.Shift-2D-Grid.md
index a63d3e771..83fcdef1d 100644
--- a/website/content/ChapterFour/1260.Shift-2D-Grid.md
+++ b/website/content/ChapterFour/1200~1299/1260.Shift-2D-Grid.md
@@ -87,4 +87,11 @@ func shiftGrid(grid [][]int, k int) [][]int {
return newGrid
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1200~1299/1254.Number-of-Closed-Islands/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1200~1299/1266.Minimum-Time-Visiting-All-Points/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/1266.Minimum-Time-Visiting-All-Points.md b/website/content/ChapterFour/1200~1299/1266.Minimum-Time-Visiting-All-Points.md
similarity index 85%
rename from website/content/ChapterFour/1266.Minimum-Time-Visiting-All-Points.md
rename to website/content/ChapterFour/1200~1299/1266.Minimum-Time-Visiting-All-Points.md
index 5fe48f070..5b20c53a1 100755
--- a/website/content/ChapterFour/1266.Minimum-Time-Visiting-All-Points.md
+++ b/website/content/ChapterFour/1200~1299/1266.Minimum-Time-Visiting-All-Points.md
@@ -26,7 +26,7 @@ You can move according to the next rules:
Input: points = [[3,2],[-2,2]]
Output: 5
-**Constraints:**
+**Constraints**:
- `points.length == n`
- `1 <= n <= 100`
@@ -72,4 +72,11 @@ func minTimeToVisitAllPoints(points [][]int) int {
return res
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1200~1299/1260.Shift-2D-Grid/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1200~1299/1268.Search-Suggestions-System/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/1200~1299/1268.Search-Suggestions-System.md b/website/content/ChapterFour/1200~1299/1268.Search-Suggestions-System.md
new file mode 100644
index 000000000..759f58221
--- /dev/null
+++ b/website/content/ChapterFour/1200~1299/1268.Search-Suggestions-System.md
@@ -0,0 +1,96 @@
+# [1268. Search Suggestions System](https://leetcode.com/problems/search-suggestions-system/)
+
+## 题目
+
+Given an array of strings `products` and a string `searchWord`. We want to design a system that suggests at most three product names from `products` after each character of `searchWord` is typed. Suggested products should have common prefix with the searchWord. If there are more than three products with a common prefix return the three lexicographically minimums products.
+
+Return *list of lists* of the suggested `products` after each character of `searchWord` is typed.
+
+**Example 1:**
+
+```
+Input: products = ["mobile","mouse","moneypot","monitor","mousepad"], searchWord = "mouse"
+Output: [
+["mobile","moneypot","monitor"],
+["mobile","moneypot","monitor"],
+["mouse","mousepad"],
+["mouse","mousepad"],
+["mouse","mousepad"]
+]
+Explanation: products sorted lexicographically = ["mobile","moneypot","monitor","mouse","mousepad"]
+After typing m and mo all products match and we show user ["mobile","moneypot","monitor"]
+After typing mou, mous and mouse the system suggests ["mouse","mousepad"]
+
+```
+
+**Example 2:**
+
+```
+Input: products = ["havana"], searchWord = "havana"
+Output: [["havana"],["havana"],["havana"],["havana"],["havana"],["havana"]]
+```
+
+**Example 3:**
+
+```
+Input: products = ["bags","baggage","banner","box","cloths"], searchWord = "bags"
+Output: [["baggage","bags","banner"],["baggage","bags","banner"],["baggage","bags"],["bags"]]
+```
+
+**Example 4:**
+
+```
+Input: products = ["havana"], searchWord = "tatiana"
+Output: [[],[],[],[],[],[],[]]
+```
+
+**Constraints:**
+
+- `1 <= products.length <= 1000`
+- There are no repeated elements in `products`.
+- `1 <= Σ products[i].length <= 2 * 10^4`
+- All characters of `products[i]` are lower-case English letters.
+- `1 <= searchWord.length <= 1000`
+- All characters of `searchWord` are lower-case English letters.
+
+## 题目大意
+
+给你一个产品数组 products 和一个字符串 searchWord ，products 数组中每个产品都是一个字符串。请你设计一个推荐系统，在依次输入单词 searchWord 的每一个字母后，推荐 products 数组中前缀与 searchWord 相同的最多三个产品。如果前缀相同的可推荐产品超过三个，请按字典序返回最小的三个。请你以二维列表的形式，返回在输入 searchWord 每个字母后相应的推荐产品的列表。
+
+## 解题思路
+
+- 由于题目要求返回的答案要按照字典序输出，所以先排序。有序字符串又满足了二分搜索的条件，于是可以用二分搜索。sort.SearchStrings 返回的是满足搜索条件的第一个起始下标。末尾不满足条件的字符串要切掉。所以要搜 2 次，第一次二分搜索先将不满足目标串前缀的字符串筛掉。第二次二分搜索再搜索出最终满足题意的字符串。
+
+## 代码
+
+```go
+package leetcode
+
+import (
+ "sort"
+)
+
+func suggestedProducts(products []string, searchWord string) [][]string {
+ sort.Strings(products)
+ searchWordBytes, result := []byte(searchWord), make([][]string, 0, len(searchWord))
+ for i := 1; i <= len(searchWord); i++ {
+ searchWordBytes[i-1]++
+ products = products[:sort.SearchStrings(products, string(searchWordBytes[:i]))]
+ searchWordBytes[i-1]--
+ products = products[sort.SearchStrings(products, searchWord[:i]):]
+ if len(products) > 3 {
+ result = append(result, products[:3])
+ } else {
+ result = append(result, products)
+ }
+ }
+ return result
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1200~1299/1266.Minimum-Time-Visiting-All-Points/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1200~1299/1275.Find-Winner-on-a-Tic-Tac-Toe-Game/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/1275.Find-Winner-on-a-Tic-Tac-Toe-Game.md b/website/content/ChapterFour/1200~1299/1275.Find-Winner-on-a-Tic-Tac-Toe-Game.md
similarity index 92%
rename from website/content/ChapterFour/1275.Find-Winner-on-a-Tic-Tac-Toe-Game.md
rename to website/content/ChapterFour/1200~1299/1275.Find-Winner-on-a-Tic-Tac-Toe-Game.md
index d019be1cb..eda51cd07 100644
--- a/website/content/ChapterFour/1275.Find-Winner-on-a-Tic-Tac-Toe-Game.md
+++ b/website/content/ChapterFour/1200~1299/1275.Find-Winner-on-a-Tic-Tac-Toe-Game.md
@@ -68,7 +68,7 @@ Explanation: The game has not finished yet.
```
-**Constraints:**
+**Constraints**:
- `1 <= moves.length <= 9`
- `moves[i].length == 2`
@@ -151,4 +151,11 @@ func tictactoe(moves [][]int) string {
return "Draw"
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1200~1299/1268.Search-Suggestions-System/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1200~1299/1281.Subtract-the-Product-and-Sum-of-Digits-of-an-Integer/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/1200~1299/1281.Subtract-the-Product-and-Sum-of-Digits-of-an-Integer.md b/website/content/ChapterFour/1200~1299/1281.Subtract-the-Product-and-Sum-of-Digits-of-an-Integer.md
new file mode 100644
index 000000000..f512f8476
--- /dev/null
+++ b/website/content/ChapterFour/1200~1299/1281.Subtract-the-Product-and-Sum-of-Digits-of-an-Integer.md
@@ -0,0 +1,66 @@
+# [1281. Subtract the Product and Sum of Digits of an Integer](https://leetcode.com/problems/subtract-the-product-and-sum-of-digits-of-an-integer/)
+
+
+
+## 题目
+
+Given an integer number `n`, return the difference between the product of its digits and the sum of its digits.
+
+**Example 1**:
+
+```
+Input: n = 234
+Output: 15
+Explanation:
+Product of digits = 2 * 3 * 4 = 24
+Sum of digits = 2 + 3 + 4 = 9
+Result = 24 - 9 = 15
+```
+
+**Example 2**:
+
+```
+Input: n = 4421
+Output: 21
+Explanation:
+Product of digits = 4 * 4 * 2 * 1 = 32
+Sum of digits = 4 + 4 + 2 + 1 = 11
+Result = 32 - 11 = 21
+```
+
+**Constraints**:
+
+- `1 <= n <= 10^5`
+
+## 题目大意
+
+给你一个整数 n，请你帮忙计算并返回该整数「各位数字之积」与「各位数字之和」的差。
+
+提示：
+
+- 1 <= n <= 10^5
+
+## 解题思路
+
+- 给出一个数，计算这个数每位数字乘积减去每位数字累加的差值。
+- 简单题，按照题意输入输出即可。
+
+## 代码
+
+```go
+func subtractProductAndSum(n int) int {
+ sum, product := 0, 1
+ for ; n > 0; n /= 10 {
+ sum += n % 10
+ product *= n % 10
+ }
+ return product - sum
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1200~1299/1275.Find-Winner-on-a-Tic-Tac-Toe-Game/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1200~1299/1283.Find-the-Smallest-Divisor-Given-a-Threshold/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/1283.Find-the-Smallest-Divisor-Given-a-Threshold.md b/website/content/ChapterFour/1200~1299/1283.Find-the-Smallest-Divisor-Given-a-Threshold.md
similarity index 85%
rename from website/content/ChapterFour/1283.Find-the-Smallest-Divisor-Given-a-Threshold.md
rename to website/content/ChapterFour/1200~1299/1283.Find-the-Smallest-Divisor-Given-a-Threshold.md
index f0359723b..044a91c7b 100644
--- a/website/content/ChapterFour/1283.Find-the-Smallest-Divisor-Given-a-Threshold.md
+++ b/website/content/ChapterFour/1200~1299/1283.Find-the-Smallest-Divisor-Given-a-Threshold.md
@@ -84,4 +84,11 @@ func calDivisor(nums []int, mid, threshold int) bool {
}
return false
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1200~1299/1281.Subtract-the-Product-and-Sum-of-Digits-of-an-Integer/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1200~1299/1287.Element-Appearing-More-Than-25-In-Sorted-Array/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/1200~1299/1287.Element-Appearing-More-Than-25-In-Sorted-Array.md b/website/content/ChapterFour/1200~1299/1287.Element-Appearing-More-Than-25-In-Sorted-Array.md
new file mode 100644
index 000000000..03294b899
--- /dev/null
+++ b/website/content/ChapterFour/1200~1299/1287.Element-Appearing-More-Than-25-In-Sorted-Array.md
@@ -0,0 +1,56 @@
+# [1287. Element Appearing More Than 25% In Sorted Array](https://leetcode.com/problems/element-appearing-more-than-25-in-sorted-array/)
+
+
+
+## 题目
+
+Given an integer array **sorted** in non-decreasing order, there is exactly one integer in the array that occurs more than 25% of the time.
+
+Return that integer.
+
+**Example 1**:
+
+```
+Input: arr = [1,2,2,6,6,6,6,7,10]
+Output: 6
+```
+
+**Constraints**:
+
+- `1 <= arr.length <= 10^4`
+- `0 <= arr[i] <= 10^5`
+
+## 题目大意
+
+给你一个非递减的 有序 整数数组，已知这个数组中恰好有一个整数，它的出现次数超过数组元素总数的 25%。请你找到并返回这个整数。
+
+提示：
+
+- 1 <= arr.length <= 10^4
+- 0 <= arr[i] <= 10^5
+
+## 解题思路
+
+- 给出一个非递减的有序数组，要求输出出现次数超过数组元素总数 25% 的元素。
+- 简单题，由于已经非递减有序了，所以只需要判断 `arr[i] == arr[i+n/4]` 是否相等即可。
+
+## 代码
+
+```go
+func findSpecialInteger(arr []int) int {
+ n := len(arr)
+ for i := 0; i < n-n/4; i++ {
+ if arr[i] == arr[i+n/4] {
+ return arr[i]
+ }
+ }
+ return -1
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1200~1299/1283.Find-the-Smallest-Divisor-Given-a-Threshold/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1200~1299/1290.Convert-Binary-Number-in-a-Linked-List-to-Integer/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/1290.Convert-Binary-Number-in-a-Linked-List-to-Integer.md b/website/content/ChapterFour/1200~1299/1290.Convert-Binary-Number-in-a-Linked-List-to-Integer.md
similarity index 79%
rename from website/content/ChapterFour/1290.Convert-Binary-Number-in-a-Linked-List-to-Integer.md
rename to website/content/ChapterFour/1200~1299/1290.Convert-Binary-Number-in-a-Linked-List-to-Integer.md
index 1c0f9be17..af3a2ca0a 100644
--- a/website/content/ChapterFour/1290.Convert-Binary-Number-in-a-Linked-List-to-Integer.md
+++ b/website/content/ChapterFour/1200~1299/1290.Convert-Binary-Number-in-a-Linked-List-to-Integer.md
@@ -78,4 +78,11 @@ func getDecimalValue(head *ListNode) int {
}
return sum
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1200~1299/1287.Element-Appearing-More-Than-25-In-Sorted-Array/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1200~1299/1293.Shortest-Path-in-a-Grid-with-Obstacles-Elimination/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/1200~1299/1293.Shortest-Path-in-a-Grid-with-Obstacles-Elimination.md b/website/content/ChapterFour/1200~1299/1293.Shortest-Path-in-a-Grid-with-Obstacles-Elimination.md
new file mode 100644
index 000000000..f4cebe1fa
--- /dev/null
+++ b/website/content/ChapterFour/1200~1299/1293.Shortest-Path-in-a-Grid-with-Obstacles-Elimination.md
@@ -0,0 +1,138 @@
+# [1293. Shortest Path in a Grid with Obstacles Elimination](https://leetcode.com/problems/shortest-path-in-a-grid-with-obstacles-elimination/)
+
+
+
+## 题目
+
+You are given an m x n integer matrix grid where each cell is either 0 (empty) or 1 (obstacle). You can move up, down, left, or right from and to an empty cell in one step.
+
+Return the minimum number of steps to walk from the upper left corner (0, 0) to the lower right corner (m - 1, n - 1) given that you can eliminate at most k obstacles. If it is not possible to find such walk return -1.
+
+
+
+Example 1:
+
+
+
+
+
+```
+Input: grid = [[0,0,0],[1,1,0],[0,0,0],[0,1,1],[0,0,0]], k = 1
+Output: 6
+Explanation:
+The shortest path without eliminating any obstacle is 10.
+The shortest path with one obstacle elimination at position (3,2) is 6. Such path is (0,0) -> (0,1) -> (0,2) -> (1,2) -> (2,2) -> (3,2) -> (4,2).
+```
+
+Example 2:
+
+
+
+```
+Input: grid = [[0,1,1],[1,1,1],[1,0,0]], k = 1
+Output: -1
+Explanation: We need to eliminate at least two obstacles to find such a walk.
+```
+
+Constraints:
+
+- m == grid.length
+- n == grid[i].length
+- 1 <= m, n <= 40
+- 1 <= k <= m * n
+- grid[i][j] is either 0 or 1.
+- grid[0][0] == grid[m - 1][n - 1] == 0
+
+
+
+## 题目大意
+
+给你一个 m * n 的网格，其中每个单元格不是 0（空）就是 1（障碍物）。每一步，您都可以在空白单元格中上、下、左、右移动。
+
+如果您 最多 可以消除 k 个障碍物，请找出从左上角 (0, 0) 到右下角 (m-1, n-1) 的最短路径，并返回通过该路径所需的步数。如果找不到这样的路径，则返回 -1 。
+
+
+## 解题思路
+
+使用 BFS 遍历棋盘。这题比普通可达性问题多了一个障碍物的限制。这个也不难。每个点往周边四个方向扩展的时候，如果遇到障碍物，先算上这个障碍物，障碍物累积总个数小于 K 的时候，从障碍物的这个格子继续开始遍历。如果没有遇到障碍物，判断当前累积障碍物个数是否已经小于 K 个，如果小于 K 便继续遍历。如果大于 K，便终止此轮遍历。
+
+## 代码
+
+```go
+var dir = [][]int{
+ {-1, 0},
+ {0, 1},
+ {1, 0},
+ {0, -1},
+}
+
+type pos struct {
+ x, y int
+ obstacle int
+ step int
+}
+
+func shortestPath(grid [][]int, k int) int {
+ queue, m, n := []pos{}, len(grid), len(grid[0])
+ visitor := make([][][]int, m)
+ if len(grid) == 1 && len(grid[0]) == 1 {
+ return 0
+ }
+ for i := 0; i < m; i++ {
+ visitor[i] = make([][]int, n)
+ for j := 0; j < n; j++ {
+ visitor[i][j] = make([]int, k+1)
+ }
+ }
+ visitor[0][0][0] = 1
+ queue = append(queue, pos{x: 0, y: 0, obstacle: 0, step: 0})
+ for len(queue) > 0 {
+ size := len(queue)
+ for size > 0 {
+ size--
+ node := queue[0]
+ queue = queue[1:]
+ for i := 0; i < len(dir); i++ {
+ newX := node.x + dir[i][0]
+ newY := node.y + dir[i][1]
+ if newX == m-1 && newY == n-1 {
+ if node.obstacle != 0 {
+ if node.obstacle <= k {
+ return node.step + 1
+ } else {
+ continue
+ }
+ }
+ return node.step + 1
+ }
+ if isInBoard(grid, newX, newY) {
+ if grid[newX][newY] == 1 {
+ if node.obstacle+1 <= k && visitor[newX][newY][node.obstacle+1] != 1 {
+ queue = append(queue, pos{x: newX, y: newY, obstacle: node.obstacle + 1, step: node.step + 1})
+ visitor[newX][newY][node.obstacle+1] = 1
+ }
+ } else {
+ if node.obstacle <= k && visitor[newX][newY][node.obstacle] != 1 {
+ queue = append(queue, pos{x: newX, y: newY, obstacle: node.obstacle, step: node.step + 1})
+ visitor[newX][newY][node.obstacle] = 1
+ }
+ }
+
+ }
+ }
+ }
+ }
+ return -1
+}
+
+func isInBoard(board [][]int, x, y int) bool {
+ return x >= 0 && x < len(board) && y >= 0 && y < len(board[0])
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1200~1299/1290.Convert-Binary-Number-in-a-Linked-List-to-Integer/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1200~1299/1295.Find-Numbers-with-Even-Number-of-Digits/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/1200~1299/1295.Find-Numbers-with-Even-Number-of-Digits.md b/website/content/ChapterFour/1200~1299/1295.Find-Numbers-with-Even-Number-of-Digits.md
new file mode 100644
index 000000000..afb613611
--- /dev/null
+++ b/website/content/ChapterFour/1200~1299/1295.Find-Numbers-with-Even-Number-of-Digits.md
@@ -0,0 +1,70 @@
+# [1295. Find Numbers with Even Number of Digits](https://leetcode.com/problems/find-numbers-with-even-number-of-digits/)
+
+
+
+## 题目
+
+Given an array `nums` of integers, return how many of them contain an **even number** of digits.
+
+**Example 1**:
+
+```
+Input: nums = [12,345,2,6,7896]
+Output: 2
+Explanation:
+12 contains 2 digits (even number of digits).
+345 contains 3 digits (odd number of digits).
+2 contains 1 digit (odd number of digits).
+6 contains 1 digit (odd number of digits).
+7896 contains 4 digits (even number of digits).
+Therefore only 12 and 7896 contain an even number of digits.
+```
+
+**Example 2**:
+
+```
+Input: nums = [555,901,482,1771]
+Output: 1
+Explanation:
+Only 1771 contains an even number of digits.
+```
+
+**Constraints**:
+
+- `1 <= nums.length <= 500`
+- `1 <= nums[i] <= 10^5`
+
+## 题目大意
+
+给你一个整数数组 nums，请你返回其中位数为 偶数 的数字的个数。
+
+提示：
+
+- 1 <= nums.length <= 500
+- 1 <= nums[i] <= 10^5
+
+
+
+## 解题思路
+
+- 给你一个整数数组，要求输出位数为偶数的数字的个数。
+- 简单题，把每个数字转换为字符串判断长度是否是偶数即可。
+
+## 代码
+
+```go
+func findNumbers(nums []int) int {
+ res := 0
+ for _, n := range nums {
+ res += 1 - len(strconv.Itoa(n))%2
+ }
+ return res
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1200~1299/1293.Shortest-Path-in-a-Grid-with-Obstacles-Elimination/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1200~1299/1296.Divide-Array-in-Sets-of-K-Consecutive-Numbers/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/1200~1299/1296.Divide-Array-in-Sets-of-K-Consecutive-Numbers.md b/website/content/ChapterFour/1200~1299/1296.Divide-Array-in-Sets-of-K-Consecutive-Numbers.md
new file mode 100644
index 000000000..ea345986c
--- /dev/null
+++ b/website/content/ChapterFour/1200~1299/1296.Divide-Array-in-Sets-of-K-Consecutive-Numbers.md
@@ -0,0 +1,79 @@
+# [1296. Divide Array in Sets of K Consecutive Numbers](https://leetcode.com/problems/divide-array-in-sets-of-k-consecutive-numbers/)
+
+## 题目
+
+Given an array of integers nums and a positive integer k, check whether it is possible to divide this array into sets of k consecutive numbers.
+
+Return true if it is possible. Otherwise, return false.
+
+**Example 1**:
+
+ Input: nums = [1,2,3,3,4,4,5,6], k = 4
+ Output: true
+ Explanation: Array can be divided into [1,2,3,4] and [3,4,5,6].
+
+**Example 2**:
+
+ Input: nums = [3,2,1,2,3,4,3,4,5,9,10,11], k = 3
+ Output: true
+ Explanation: Array can be divided into [1,2,3] , [2,3,4] , [3,4,5] and [9,10,11].
+
+**Example 3**:
+
+ Input: nums = [1,2,3,4], k = 3
+ Output: false
+ Explanation: Each array should be divided in subarrays of size 3.
+
+**Constraints:**
+
+- 1 <= k <= nums.length <= 100000
+- 1 <= nums[i] <= 1000000000
+
+## 题目大意
+
+给你一个整数数组 nums 和一个正整数 k，请你判断是否可以把这个数组划分成一些由 k 个连续数字组成的集合。
+如果可以，请返回 true；否则，返回 false。
+
+## 解题思路
+
+贪心算法
+
+- 对nums升序排序
+- 对nums内数字进行哈希计数（key:数字，value:数量）
+- 遍历nums中的数字，以数量大于1的数字作为连续数字开头，寻找连续数字后续元素，若无法找到 k 个连续数字则返回false
+- 所有数字都能找到 k 个连续数字返回true
+
+##代码
+
+```go
+package leetcode
+
+import "sort"
+
+func isPossibleDivide(nums []int, k int) bool {
+ mp := make(map[int]int)
+ for _, v := range nums {
+ mp[v] += 1
+ }
+ sort.Ints(nums)
+ for _, num := range nums {
+ if mp[num] == 0 {
+ continue
+ }
+ for diff := 0; diff < k; diff++ {
+ if mp[num+diff] == 0 {
+ return false
+ }
+ mp[num+diff] -= 1
+ }
+ }
+ return true
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1200~1299/1295.Find-Numbers-with-Even-Number-of-Digits/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1200~1299/1299.Replace-Elements-with-Greatest-Element-on-Right-Side/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/1200~1299/1299.Replace-Elements-with-Greatest-Element-on-Right-Side.md b/website/content/ChapterFour/1200~1299/1299.Replace-Elements-with-Greatest-Element-on-Right-Side.md
new file mode 100644
index 000000000..ea964e728
--- /dev/null
+++ b/website/content/ChapterFour/1200~1299/1299.Replace-Elements-with-Greatest-Element-on-Right-Side.md
@@ -0,0 +1,58 @@
+# [1299. Replace Elements with Greatest Element on Right Side](https://leetcode.com/problems/replace-elements-with-greatest-element-on-right-side/)
+
+
+
+## 题目
+
+Given an array `arr`, replace every element in that array with the greatest element among the elements to its right, and replace the last element with `-1`.
+
+After doing so, return the array.
+
+**Example 1**:
+
+```
+Input: arr = [17,18,5,4,6,1]
+Output: [18,6,6,6,1,-1]
+```
+
+**Constraints**:
+
+- `1 <= arr.length <= 10^4`
+- `1 <= arr[i] <= 10^5`
+
+
+## 题目大意
+
+给你一个数组 arr ，请你将每个元素用它右边最大的元素替换，如果是最后一个元素，用 -1 替换。完成所有替换操作后，请你返回这个数组。
+
+提示：
+
+- 1 <= arr.length <= 10^4
+- 1 <= arr[i] <= 10^5
+
+
+## 解题思路
+
+- 给出一个数组，要求把所有元素都替换成自己右边最大的元素，最后一位补上 -1 。最后输出变化以后的数组。
+- 简单题，按照题意操作即可。
+
+## 代码
+
+```go
+func replaceElements(arr []int) []int {
+ j, temp := -1, 0
+ for i := len(arr) - 1; i >= 0; i-- {
+ temp = arr[i]
+ arr[i] = j
+ j = max(j, temp)
+ }
+ return arr
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1200~1299/1296.Divide-Array-in-Sets-of-K-Consecutive-Numbers/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1300~1399/1300.Sum-of-Mutated-Array-Closest-to-Target/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/1200~1299/_index.md b/website/content/ChapterFour/1200~1299/_index.md
new file mode 100644
index 000000000..d2021683f
--- /dev/null
+++ b/website/content/ChapterFour/1200~1299/_index.md
@@ -0,0 +1,5 @@
+---
+bookCollapseSection: true
+weight: 20
+---
+
diff --git a/website/content/ChapterFour/1217.Play-with-Chips.md b/website/content/ChapterFour/1217.Play-with-Chips.md
deleted file mode 100755
index 29eec710c..000000000
--- a/website/content/ChapterFour/1217.Play-with-Chips.md
+++ /dev/null
@@ -1,76 +0,0 @@
-# [1217. Play with Chips](https://leetcode.com/problems/play-with-chips/)
-
-
-## 题目
-
-There are some chips, and the i-th chip is at position `chips[i]`.
-
-You can perform any of the two following types of moves **any number of times** (possibly zero) **on any chip**:
-
-- Move the `i`-th chip by 2 units to the left or to the right with a cost of **0**.
-- Move the `i`-th chip by 1 unit to the left or to the right with a cost of **1**.
-
-There can be two or more chips at the same position initially.
-
-Return the minimum cost needed to move all the chips to the same position (any position).
-
-**Example 1**:
-
- Input: chips = [1,2,3]
- Output: 1
- Explanation: Second chip will be moved to positon 3 with cost 1. First chip will be moved to position 3 with cost 0. Total cost is 1.
-
-**Example 2**:
-
- Input: chips = [2,2,2,3,3]
- Output: 2
- Explanation: Both fourth and fifth chip will be moved to position two with cost 1. Total minimum cost will be 2.
-
-**Constraints:**
-
-- `1 <= chips.length <= 100`
-- `1 <= chips[i] <= 10^9`
-
-
-## 题目大意
-
-
-数轴上放置了一些筹码，每个筹码的位置存在数组 chips 当中。你可以对 任何筹码 执行下面两种操作之一（不限操作次数，0 次也可以）：
-
-- 将第 i 个筹码向左或者右移动 2 个单位，代价为 0。
-- 将第 i 个筹码向左或者右移动 1 个单位，代价为 1。
-
-最开始的时候，同一位置上也可能放着两个或者更多的筹码。返回将所有筹码移动到同一位置（任意位置）上所需要的最小代价。
-
-
-提示：
-
-- 1 <= chips.length <= 100
-- 1 <= chips[i] <= 10^9
-
-
-## 解题思路
-
-- 给出一个数组，数组的下标代表的是数轴上的坐标点，数组的元素代表的是砝码大小。砝码移动规则，左右移动 2 格，没有代价，左右移动 1 个，代价是 1 。问最终把砝码都移动到一个格子上，最小代价是多少。
-- 先解读砝码移动规则：偶数位置的到偶数位置的没有代价，奇数到奇数位置的没有代价。利用这个规则，我们可以把所有的砝码**无代价**的摞在一个奇数的位置上和一个偶数的位置上。这样我们只用关心这两个位置了。并且这两个位置可以连续在一起。最后一步即将相邻的这两摞砝码合并到一起。由于左右移动一个代价是 1，所以最小代价的操作是移动最少砝码的那一边。奇数位置上砝码少就移动奇数位置上的，偶数位置上砝码少就移动偶数位置上的。所以这道题解法变的异常简单，遍历一次数组，找到其中有多少个奇数和偶数位置的砝码，取其中比较少的，就是最终答案。
-
-
-## 代码
-
-```go
-
-package leetcode
-
-func minCostToMoveChips(chips []int) int {
- odd, even := 0, 0
- for _, c := range chips {
- if c%2 == 0 {
- even++
- } else {
- odd++
- }
- }
- return min(odd, even)
-}
-
-```
\ No newline at end of file
diff --git a/website/content/ChapterFour/1281.Subtract-the-Product-and-Sum-of-Digits-of-an-Integer.md b/website/content/ChapterFour/1281.Subtract-the-Product-and-Sum-of-Digits-of-an-Integer.md
deleted file mode 100644
index 96cc347d9..000000000
--- a/website/content/ChapterFour/1281.Subtract-the-Product-and-Sum-of-Digits-of-an-Integer.md
+++ /dev/null
@@ -1,59 +0,0 @@
-# [1281. Subtract the Product and Sum of Digits of an Integer](https://leetcode.com/problems/subtract-the-product-and-sum-of-digits-of-an-integer/)
-
-
-
-## 题目
-
-Given an integer number `n`, return the difference between the product of its digits and the sum of its digits.
-
-**Example 1**:
-
-```
-Input: n = 234
-Output: 15
-Explanation:
-Product of digits = 2 * 3 * 4 = 24
-Sum of digits = 2 + 3 + 4 = 9
-Result = 24 - 9 = 15
-```
-
-**Example 2**:
-
-```
-Input: n = 4421
-Output: 21
-Explanation:
-Product of digits = 4 * 4 * 2 * 1 = 32
-Sum of digits = 4 + 4 + 2 + 1 = 11
-Result = 32 - 11 = 21
-```
-
-**Constraints**:
-
-- `1 <= n <= 10^5`
-
-## 题目大意
-
-给你一个整数 n，请你帮忙计算并返回该整数「各位数字之积」与「各位数字之和」的差。
-
-提示：
-
-- 1 <= n <= 10^5
-
-## 解题思路
-
-- 给出一个数，计算这个数每位数字乘积减去每位数字累加的差值。
-- 简单题，按照题意输入输出即可。
-
-## 代码
-
-```go
-func subtractProductAndSum(n int) int {
- sum, product := 0, 1
- for ; n > 0; n /= 10 {
- sum += n % 10
- product *= n % 10
- }
- return product - sum
-}
-```
\ No newline at end of file
diff --git a/website/content/ChapterFour/1287.Element-Appearing-More-Than-25-In-Sorted-Array.md b/website/content/ChapterFour/1287.Element-Appearing-More-Than-25-In-Sorted-Array.md
deleted file mode 100644
index f9714a4dd..000000000
--- a/website/content/ChapterFour/1287.Element-Appearing-More-Than-25-In-Sorted-Array.md
+++ /dev/null
@@ -1,49 +0,0 @@
-# [1287. Element Appearing More Than 25% In Sorted Array](https://leetcode.com/problems/element-appearing-more-than-25-in-sorted-array/)
-
-
-
-## 题目
-
-Given an integer array **sorted** in non-decreasing order, there is exactly one integer in the array that occurs more than 25% of the time.
-
-Return that integer.
-
-**Example 1**:
-
-```
-Input: arr = [1,2,2,6,6,6,6,7,10]
-Output: 6
-```
-
-**Constraints**:
-
-- `1 <= arr.length <= 10^4`
-- `0 <= arr[i] <= 10^5`
-
-## 题目大意
-
-给你一个非递减的 有序 整数数组，已知这个数组中恰好有一个整数，它的出现次数超过数组元素总数的 25%。请你找到并返回这个整数。
-
-提示：
-
-- 1 <= arr.length <= 10^4
-- 0 <= arr[i] <= 10^5
-
-## 解题思路
-
-- 给出一个非递减的有序数组，要求输出出现次数超过数组元素总数 25% 的元素。
-- 简单题，由于已经非递减有序了，所以只需要判断 `arr[i] == arr[i+n/4]` 是否相等即可。
-
-## 代码
-
-```go
-func findSpecialInteger(arr []int) int {
- n := len(arr)
- for i := 0; i < n-n/4; i++ {
- if arr[i] == arr[i+n/4] {
- return arr[i]
- }
- }
- return -1
-}
-```
\ No newline at end of file
diff --git a/website/content/ChapterFour/1295.Find-Numbers-with-Even-Number-of-Digits.md b/website/content/ChapterFour/1295.Find-Numbers-with-Even-Number-of-Digits.md
deleted file mode 100644
index ccaa6c492..000000000
--- a/website/content/ChapterFour/1295.Find-Numbers-with-Even-Number-of-Digits.md
+++ /dev/null
@@ -1,63 +0,0 @@
-# [1295. Find Numbers with Even Number of Digits](https://leetcode.com/problems/find-numbers-with-even-number-of-digits/)
-
-
-
-## 题目
-
-Given an array `nums` of integers, return how many of them contain an **even number** of digits.
-
-**Example 1**:
-
-```
-Input: nums = [12,345,2,6,7896]
-Output: 2
-Explanation:
-12 contains 2 digits (even number of digits).
-345 contains 3 digits (odd number of digits).
-2 contains 1 digit (odd number of digits).
-6 contains 1 digit (odd number of digits).
-7896 contains 4 digits (even number of digits).
-Therefore only 12 and 7896 contain an even number of digits.
-```
-
-**Example 2**:
-
-```
-Input: nums = [555,901,482,1771]
-Output: 1
-Explanation:
-Only 1771 contains an even number of digits.
-```
-
-**Constraints**:
-
-- `1 <= nums.length <= 500`
-- `1 <= nums[i] <= 10^5`
-
-## 题目大意
-
-给你一个整数数组 nums，请你返回其中位数为 偶数 的数字的个数。
-
-提示：
-
-- 1 <= nums.length <= 500
-- 1 <= nums[i] <= 10^5
-
-
-
-## 解题思路
-
-- 给你一个整数数组，要求输出位数为偶数的数字的个数。
-- 简单题，把每个数字转换为字符串判断长度是否是偶数即可。
-
-## 代码
-
-```go
-func findNumbers(nums []int) int {
- res := 0
- for _, n := range nums {
- res += 1 - len(strconv.Itoa(n))%2
- }
- return res
-}
-```
\ No newline at end of file
diff --git a/website/content/ChapterFour/1299.Replace-Elements-with-Greatest-Element-on-Right-Side.md b/website/content/ChapterFour/1299.Replace-Elements-with-Greatest-Element-on-Right-Side.md
deleted file mode 100644
index 633c65761..000000000
--- a/website/content/ChapterFour/1299.Replace-Elements-with-Greatest-Element-on-Right-Side.md
+++ /dev/null
@@ -1,51 +0,0 @@
-# [1299. Replace Elements with Greatest Element on Right Side](https://leetcode.com/problems/replace-elements-with-greatest-element-on-right-side/)
-
-
-
-## 题目
-
-Given an array `arr`, replace every element in that array with the greatest element among the elements to its right, and replace the last element with `-1`.
-
-After doing so, return the array.
-
-**Example 1**:
-
-```
-Input: arr = [17,18,5,4,6,1]
-Output: [18,6,6,6,1,-1]
-```
-
-**Constraints**:
-
-- `1 <= arr.length <= 10^4`
-- `1 <= arr[i] <= 10^5`
-
-
-## 题目大意
-
-给你一个数组 arr ，请你将每个元素用它右边最大的元素替换，如果是最后一个元素，用 -1 替换。完成所有替换操作后，请你返回这个数组。
-
-提示：
-
-- 1 <= arr.length <= 10^4
-- 1 <= arr[i] <= 10^5
-
-
-## 解题思路
-
-- 给出一个数组，要求把所有元素都替换成自己右边最大的元素，最后一位补上 -1 。最后输出变化以后的数组。
-- 简单题，按照题意操作即可。
-
-## 代码
-
-```go
-func replaceElements(arr []int) []int {
- j, temp := -1, 0
- for i := len(arr) - 1; i >= 0; i-- {
- temp = arr[i]
- arr[i] = j
- j = max(j, temp)
- }
- return arr
-}
-```
\ No newline at end of file
diff --git a/website/content/ChapterFour/1300.Sum-of-Mutated-Array-Closest-to-Target.md b/website/content/ChapterFour/1300~1399/1300.Sum-of-Mutated-Array-Closest-to-Target.md
similarity index 88%
rename from website/content/ChapterFour/1300.Sum-of-Mutated-Array-Closest-to-Target.md
rename to website/content/ChapterFour/1300~1399/1300.Sum-of-Mutated-Array-Closest-to-Target.md
index 15c7d5d7c..3e13fe77b 100644
--- a/website/content/ChapterFour/1300.Sum-of-Mutated-Array-Closest-to-Target.md
+++ b/website/content/ChapterFour/1300~1399/1300.Sum-of-Mutated-Array-Closest-to-Target.md
@@ -100,4 +100,11 @@ func min(a int, b int) int {
return a
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1200~1299/1299.Replace-Elements-with-Greatest-Element-on-Right-Side/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1300~1399/1302.Deepest-Leaves-Sum/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/1302.Deepest-Leaves-Sum.md b/website/content/ChapterFour/1300~1399/1302.Deepest-Leaves-Sum.md
similarity index 76%
rename from website/content/ChapterFour/1302.Deepest-Leaves-Sum.md
rename to website/content/ChapterFour/1300~1399/1302.Deepest-Leaves-Sum.md
index 70482634f..6037e30c5 100644
--- a/website/content/ChapterFour/1302.Deepest-Leaves-Sum.md
+++ b/website/content/ChapterFour/1300~1399/1302.Deepest-Leaves-Sum.md
@@ -55,4 +55,11 @@ func dfsDeepestLeavesSum(root *TreeNode, level int, maxLevel, sum *int) {
dfsDeepestLeavesSum(root.Left, level+1, maxLevel, sum)
dfsDeepestLeavesSum(root.Right, level+1, maxLevel, sum)
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1300~1399/1300.Sum-of-Mutated-Array-Closest-to-Target/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1300~1399/1304.Find-N-Unique-Integers-Sum-up-to-Zero/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/1300~1399/1304.Find-N-Unique-Integers-Sum-up-to-Zero.md b/website/content/ChapterFour/1300~1399/1304.Find-N-Unique-Integers-Sum-up-to-Zero.md
new file mode 100644
index 000000000..35a82147a
--- /dev/null
+++ b/website/content/ChapterFour/1300~1399/1304.Find-N-Unique-Integers-Sum-up-to-Zero.md
@@ -0,0 +1,69 @@
+# [1304. Find N Unique Integers Sum up to Zero](https://leetcode.com/problems/find-n-unique-integers-sum-up-to-zero/)
+
+
+
+## 题目
+
+Given an integer `n`, return **any** array containing `n` **unique** integers such that they add up to 0.
+
+**Example 1**:
+
+```
+Input: n = 5
+Output: [-7,-1,1,3,4]
+Explanation: These arrays also are accepted [-5,-1,1,2,3] , [-3,-1,2,-2,4].
+```
+
+**Example 2**:
+
+```
+Input: n = 3
+Output: [-1,0,1]
+```
+
+**Example 3**:
+
+```
+Input: n = 1
+Output: [0]
+```
+
+**Constraints**:
+
+- `1 <= n <= 1000`
+
+## 题目大意
+
+给你一个整数 n，请你返回 任意 一个由 n 个 各不相同 的整数组成的数组，并且这 n 个数相加和为 0 。
+
+提示：
+
+- 1 <= n <= 1000
+
+## 解题思路
+
+- 给出一个数 n，输出一个有 n 个数的数组，里面元素之和为 0 。
+- 简单题，简单循环即可。
+
+## 代码
+
+```go
+func sumZero(n int) []int {
+ res, left, right, start := make([]int, n), 0, n-1, 1
+ for left < right {
+ res[left] = start
+ res[right] = -start
+ start++
+ left = left + 1
+ right = right - 1
+ }
+ return res
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1300~1399/1302.Deepest-Leaves-Sum/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1300~1399/1305.All-Elements-in-Two-Binary-Search-Trees/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/1305.All-Elements-in-Two-Binary-Search-Trees.md b/website/content/ChapterFour/1300~1399/1305.All-Elements-in-Two-Binary-Search-Trees.md
similarity index 86%
rename from website/content/ChapterFour/1305.All-Elements-in-Two-Binary-Search-Trees.md
rename to website/content/ChapterFour/1300~1399/1305.All-Elements-in-Two-Binary-Search-Trees.md
index 247bbfbbe..a29b324c2 100644
--- a/website/content/ChapterFour/1305.All-Elements-in-Two-Binary-Search-Trees.md
+++ b/website/content/ChapterFour/1300~1399/1305.All-Elements-in-Two-Binary-Search-Trees.md
@@ -87,4 +87,11 @@ func getAllElements1(root1 *TreeNode, root2 *TreeNode) []int {
sort.Ints(arr)
return arr
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1300~1399/1304.Find-N-Unique-Integers-Sum-up-to-Zero/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1300~1399/1306.Jump-Game-III/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/1306.Jump-Game-III.md b/website/content/ChapterFour/1300~1399/1306.Jump-Game-III.md
similarity index 86%
rename from website/content/ChapterFour/1306.Jump-Game-III.md
rename to website/content/ChapterFour/1300~1399/1306.Jump-Game-III.md
index 63f26345a..e34767f0e 100644
--- a/website/content/ChapterFour/1306.Jump-Game-III.md
+++ b/website/content/ChapterFour/1300~1399/1306.Jump-Game-III.md
@@ -77,4 +77,11 @@ func canReach(arr []int, start int) bool {
}
return false
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1300~1399/1305.All-Elements-in-Two-Binary-Search-Trees/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1300~1399/1310.XOR-Queries-of-a-Subarray/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/1300~1399/1310.XOR-Queries-of-a-Subarray.md b/website/content/ChapterFour/1300~1399/1310.XOR-Queries-of-a-Subarray.md
new file mode 100644
index 000000000..4c90917b3
--- /dev/null
+++ b/website/content/ChapterFour/1300~1399/1310.XOR-Queries-of-a-Subarray.md
@@ -0,0 +1,84 @@
+# [1310. XOR Queries of a Subarray](https://leetcode.com/problems/xor-queries-of-a-subarray/)
+
+
+## 题目
+
+Given the array `arr` of positive integers and the array `queries` where `queries[i] = [Li,Ri]`, for each query `i` compute the **XOR** of elements from `Li` to `Ri` (that is, `arr[Li]xor arr[Li+1]xor ...xor arr[Ri]`). Return an array containing the result for the given `queries`.
+
+**Example 1:**
+
+```
+Input: arr = [1,3,4,8], queries = [[0,1],[1,2],[0,3],[3,3]]
+Output: [2,7,14,8]
+Explanation:
+The binary representation of the elements in the array are:
+1 = 0001
+3 = 0011
+4 = 0100
+8 = 1000
+The XOR values for queries are:
+[0,1] = 1 xor 3 = 2
+[1,2] = 3 xor 4 = 7
+[0,3] = 1 xor 3 xor 4 xor 8 = 14
+[3,3] = 8
+
+```
+
+**Example 2:**
+
+```
+Input: arr = [4,8,2,10], queries = [[2,3],[1,3],[0,0],[0,3]]
+Output: [8,0,4,4]
+
+```
+
+**Constraints:**
+
+- `1 <= arr.length <= 3 * 10^4`
+- `1 <= arr[i] <= 10^9`
+- `1 <= queries.length <= 3 * 10^4`
+- `queries[i].length == 2`
+- `0 <= queries[i][0] <= queries[i][1] < arr.length`
+
+## 题目大意
+
+有一个正整数数组 arr，现给你一个对应的查询数组 queries，其中 queries[i] = [Li, Ri]。对于每个查询 i，请你计算从 Li 到 Ri 的 XOR 值（即 arr[Li] xor arr[Li+1] xor ... xor arr[Ri]）作为本次查询的结果。并返回一个包含给定查询 queries 所有结果的数组。
+
+## 解题思路
+
+- 此题求区间异或，很容易让人联想到区间求和。区间求和利用前缀和，可以使得 query 从 O(n) 降为 O(1)。区间异或能否也用类似前缀和的思想呢？答案是肯定的。利用异或的两个性质，x ^ x = 0，x ^ 0 = x。那么有：（由于 LaTeX 中异或符号 ^ 是特殊字符，笔者用 {{< katex >}} \oplus {{< /katex >}} 代替异或）
+
+ {{< katex display >}}
+ \begin{aligned}Query(left,right) &=arr[left] \oplus \cdots \oplus arr[right]\\&=(arr[0] \oplus \cdots \oplus arr[left-1]) \oplus (arr[0] \oplus \cdots \oplus arr[left-1]) \oplus (arr[left] \oplus \cdots \oplus arr[right])\\ &=(arr[0] \oplus \cdots \oplus arr[left-1]) \oplus (arr[0] \oplus \cdots \oplus arr[right])\\ &=xors[left] \oplus xors[right+1]\\ \end{aligned}
+ {{< /katex >}}
+
+ 按照这个思路解题，便可以将 query 从 O(n) 降为 O(1)，总的时间复杂度为 O(n)。
+
+## 代码
+
+```go
+package leetcode
+
+func xorQueries(arr []int, queries [][]int) []int {
+ xors := make([]int, len(arr))
+ xors[0] = arr[0]
+ for i := 1; i < len(arr); i++ {
+ xors[i] = arr[i] ^ xors[i-1]
+ }
+ res := make([]int, len(queries))
+ for i, q := range queries {
+ res[i] = xors[q[1]]
+ if q[0] > 0 {
+ res[i] ^= xors[q[0]-1]
+ }
+ }
+ return res
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1300~1399/1306.Jump-Game-III/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1300~1399/1313.Decompress-Run-Length-Encoded-List/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/1313.Decompress-Run-Length-Encoded-List.md b/website/content/ChapterFour/1300~1399/1313.Decompress-Run-Length-Encoded-List.md
similarity index 81%
rename from website/content/ChapterFour/1313.Decompress-Run-Length-Encoded-List.md
rename to website/content/ChapterFour/1300~1399/1313.Decompress-Run-Length-Encoded-List.md
index 645d90578..4d56280fb 100644
--- a/website/content/ChapterFour/1313.Decompress-Run-Length-Encoded-List.md
+++ b/website/content/ChapterFour/1300~1399/1313.Decompress-Run-Length-Encoded-List.md
@@ -57,4 +57,11 @@ func decompressRLElist(nums []int) []int {
return res
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1300~1399/1310.XOR-Queries-of-a-Subarray/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1300~1399/1317.Convert-Integer-to-the-Sum-of-Two-No-Zero-Integers/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/1317.Convert-Integer-to-the-Sum-of-Two-No-Zero-Integers.md b/website/content/ChapterFour/1300~1399/1317.Convert-Integer-to-the-Sum-of-Two-No-Zero-Integers.md
similarity index 82%
rename from website/content/ChapterFour/1317.Convert-Integer-to-the-Sum-of-Two-No-Zero-Integers.md
rename to website/content/ChapterFour/1300~1399/1317.Convert-Integer-to-the-Sum-of-Two-No-Zero-Integers.md
index b7871908f..889849408 100644
--- a/website/content/ChapterFour/1317.Convert-Integer-to-the-Sum-of-Two-No-Zero-Integers.md
+++ b/website/content/ChapterFour/1300~1399/1317.Convert-Integer-to-the-Sum-of-Two-No-Zero-Integers.md
@@ -93,4 +93,11 @@ func isNoZero(n int) bool {
return true
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1300~1399/1313.Decompress-Run-Length-Encoded-List/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1300~1399/1319.Number-of-Operations-to-Make-Network-Connected/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/1300~1399/1319.Number-of-Operations-to-Make-Network-Connected.md b/website/content/ChapterFour/1300~1399/1319.Number-of-Operations-to-Make-Network-Connected.md
new file mode 100644
index 000000000..2adf943ce
--- /dev/null
+++ b/website/content/ChapterFour/1300~1399/1319.Number-of-Operations-to-Make-Network-Connected.md
@@ -0,0 +1,97 @@
+# [1319. Number of Operations to Make Network Connected](https://leetcode.com/problems/number-of-operations-to-make-network-connected/)
+
+
+## 题目
+
+There are `n` computers numbered from `0` to `n-1` connected by ethernet cables `connections` forming a network where `connections[i] = [a, b]` represents a connection between computers `a` and `b`. Any computer can reach any other computer directly or indirectly through the network.
+
+Given an initial computer network `connections`. You can extract certain cables between two directly connected computers, and place them between any pair of disconnected computers to make them directly connected. Return the *minimum number of times* you need to do this in order to make all the computers connected. If it's not possible, return -1.
+
+**Example 1:**
+
+
+
+```
+Input: n = 4, connections = [[0,1],[0,2],[1,2]]
+Output: 1
+Explanation: Remove cable between computer 1 and 2 and place between computers 1 and 3.
+```
+
+**Example 2:**
+
+
+
+```
+Input: n = 6, connections = [[0,1],[0,2],[0,3],[1,2],[1,3]]
+Output: 2
+```
+
+**Example 3:**
+
+```
+Input: n = 6, connections = [[0,1],[0,2],[0,3],[1,2]]
+Output: -1
+Explanation: There are not enough cables.
+```
+
+**Example 4:**
+
+```
+Input: n = 5, connections = [[0,1],[0,2],[3,4],[2,3]]
+Output: 0
+```
+
+**Constraints:**
+
+- `1 <= n <= 10^5`
+- `1 <= connections.length <= min(n*(n-1)/2, 10^5)`
+- `connections[i].length == 2`
+- `0 <= connections[i][0], connections[i][1] < n`
+- `connections[i][0] != connections[i][1]`
+- There are no repeated connections.
+- No two computers are connected by more than one cable.
+
+## 题目大意
+
+用以太网线缆将 n 台计算机连接成一个网络，计算机的编号从 0 到 n-1。线缆用 connections 表示，其中 connections[i] = [a, b] 连接了计算机 a 和 b。网络中的任何一台计算机都可以通过网络直接或者间接访问同一个网络中其他任意一台计算机。给你这个计算机网络的初始布线 connections，你可以拔开任意两台直连计算机之间的线缆，并用它连接一对未直连的计算机。请你计算并返回使所有计算机都连通所需的最少操作次数。如果不可能，则返回 -1 。
+
+## 解题思路
+
+- 很明显这题的解题思路是并查集。先将每个 connections 构建出并查集。构建中需要累加冗余的连接。例如 2 个节点已经连通，再连接这个集合中的任意 2 个节点就算冗余连接。冗余连接的线都可以移动，去连接还没有连通的节点。计算出冗余连接数，再根据并查集的集合总数，即可得出答案。
+- 这一题答案有 3 种可能。第一种，所有点都在一个集合内，即全部连通，这时输出 0 。第二种，冗余的连接不够串起所有点，这时输出 -1 。第三种情况是可以连通的情况。 m 个集合需要连通，最少需要 m - 1 条线。如果冗余连接数大于 m - 1，则输出 m - 1 即可。
+
+## 代码
+
+```go
+package leetcode
+
+import (
+ "github.com/halfrost/leetcode-go/template"
+)
+
+func makeConnected(n int, connections [][]int) int {
+ if n-1 > len(connections) {
+ return -1
+ }
+ uf, redundance := template.UnionFind{}, 0
+ uf.Init(n)
+ for _, connection := range connections {
+ if uf.Find(connection[0]) == uf.Find(connection[1]) {
+ redundance++
+ } else {
+ uf.Union(connection[0], connection[1])
+ }
+ }
+ if uf.TotalCount() == 1 || redundance < uf.TotalCount()-1 {
+ return 0
+ }
+ return uf.TotalCount() - 1
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1300~1399/1317.Convert-Integer-to-the-Sum-of-Two-No-Zero-Integers/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1300~1399/1329.Sort-the-Matrix-Diagonally/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/1300~1399/1329.Sort-the-Matrix-Diagonally.md b/website/content/ChapterFour/1300~1399/1329.Sort-the-Matrix-Diagonally.md
new file mode 100644
index 000000000..7389fe3a5
--- /dev/null
+++ b/website/content/ChapterFour/1300~1399/1329.Sort-the-Matrix-Diagonally.md
@@ -0,0 +1,64 @@
+# [1329. Sort the Matrix Diagonally](https://leetcode.com/problems/sort-the-matrix-diagonally/)
+
+
+## 题目
+
+A **matrix diagonal** is a diagonal line of cells starting from some cell in either the topmost row or leftmost column and going in the bottom-right direction until reaching the matrix's end. For example, the **matrix diagonal** starting from `mat[2][0]`, where `mat` is a `6 x 3` matrix, includes cells `mat[2][0]`, `mat[3][1]`, and `mat[4][2]`.
+
+Given an `m x n` matrix `mat` of integers, sort each **matrix diagonal** in ascending order and return *the resulting matrix*.
+
+**Example 1:**
+
+
+
+```
+Input: mat = [[3,3,1,1],[2,2,1,2],[1,1,1,2]]
+Output: [[1,1,1,1],[1,2,2,2],[1,2,3,3]]
+```
+
+**Constraints:**
+
+- `m == mat.length`
+- `n == mat[i].length`
+- `1 <= m, n <= 100`
+- `1 <= mat[i][j] <= 100`
+
+## 题目大意
+
+给你一个 m * n 的整数矩阵 mat ，请你将同一条对角线上的元素（从左上到右下）按升序排序后，返回排好序的矩阵。
+
+## 解题思路
+
+- 这道题思路很简单。按照对角线，把每条对角线的元素读取出来放在数组中。这里可以利用 map 保存这些数组。再将这些数组排序。最后按照对角线还原矩阵即可。
+
+## 代码
+
+```go
+package leetcode
+
+func diagonalSort(mat [][]int) [][]int {
+ m, n, diagonalsMap := len(mat), len(mat[0]), make(map[int][]int)
+ for i := 0; i < m; i++ {
+ for j := 0; j < n; j++ {
+ diagonalsMap[i-j] = append(diagonalsMap[i-j], mat[i][j])
+ }
+ }
+ for _, v := range diagonalsMap {
+ sort.Ints(v)
+ }
+ for i := 0; i < m; i++ {
+ for j := 0; j < n; j++ {
+ mat[i][j] = diagonalsMap[i-j][0]
+ diagonalsMap[i-j] = diagonalsMap[i-j][1:]
+ }
+ }
+ return mat
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1300~1399/1319.Number-of-Operations-to-Make-Network-Connected/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1300~1399/1332.Remove-Palindromic-Subsequences/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/1300~1399/1332.Remove-Palindromic-Subsequences.md b/website/content/ChapterFour/1300~1399/1332.Remove-Palindromic-Subsequences.md
new file mode 100644
index 000000000..7814cbb69
--- /dev/null
+++ b/website/content/ChapterFour/1300~1399/1332.Remove-Palindromic-Subsequences.md
@@ -0,0 +1,88 @@
+# [1332. Remove Palindromic Subsequences](https://leetcode.com/problems/remove-palindromic-subsequences/)
+
+
+## 题目
+
+Given a string `s` consisting only of letters `'a'` and `'b'`. In a single step you can remove one palindromic **subsequence** from `s`.
+
+Return the minimum number of steps to make the given string empty.
+
+A string is a subsequence of a given string, if it is generated by deleting some characters of a given string without changing its order.
+
+A string is called palindrome if is one that reads the same backward as well as forward.
+
+**Example 1:**
+
+```
+Input: s = "ababa"
+Output: 1
+Explanation: String is already palindrome
+```
+
+**Example 2:**
+
+```
+Input: s = "abb"
+Output: 2
+Explanation: "abb" -> "bb" -> "".
+Remove palindromic subsequence "a" then "bb".
+```
+
+**Example 3:**
+
+```
+Input: s = "baabb"
+Output: 2
+Explanation: "baabb" -> "b" -> "".
+Remove palindromic subsequence "baab" then "b".
+```
+
+**Example 4:**
+
+```
+Input: s = ""
+Output: 0
+```
+
+**Constraints:**
+
+- `0 <= s.length <= 1000`
+- `s` only consists of letters 'a' and 'b'
+
+## 题目大意
+
+给你一个字符串 s，它仅由字母 'a' 和 'b' 组成。每一次删除操作都可以从 s 中删除一个回文 子序列。返回删除给定字符串中所有字符（字符串为空）的最小删除次数。
+
+「子序列」定义：如果一个字符串可以通过删除原字符串某些字符而不改变原字符顺序得到，那么这个字符串就是原字符串的一个子序列。
+
+「回文」定义：如果一个字符串向后和向前读是一致的，那么这个字符串就是一个回文。
+
+## 解题思路
+
+- 笔者读完题以为是第 5 题的加强版。在字符串中每次都找到最长的回文子串删除，一直删除到找不到回文子串结束，删除的总次数 + 剩余字母数 = 最小删除次数。提交以后 `wrong answer` 了，在 `bbaabaaa` 这组测试用例出错了。如果按照找最长回文字符串的思路，先找到最长回文子串 `aabaa`，剩余 `bba`，还需要再删除 2 次，`bb` 和 `a`。总共删除次数是 3 。为什么出错误了呢？仔细再读题，题目中说的是子序列，这不是连续的，再加上这道题是 `easy` 难度，其实很简单。
+- 这道题的答案只可能是 0，1，2 。空串对应的 0 。如果有一个字母，单个字母可以构成回文，所以是 1，如果字符串长度大于等于 2，即 `a` 和 `b` 都有，第一步先删除所有 `a`，因为所有的 `a` 构成了回文子序列。第二步删除所有的 `b`，因为所有的 `b` 构成了回文子序列。经过这样两步，一定能删除所有字符。
+
+## 代码
+
+```go
+package leetcode
+
+func removePalindromeSub(s string) int {
+ if len(s) == 0 {
+ return 0
+ }
+ for i := 0; i < len(s)/2; i++ {
+ if s[i] != s[len(s)-1-i] {
+ return 2
+ }
+ }
+ return 1
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1300~1399/1329.Sort-the-Matrix-Diagonally/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1300~1399/1337.The-K-Weakest-Rows-in-a-Matrix/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/1300~1399/1337.The-K-Weakest-Rows-in-a-Matrix.md b/website/content/ChapterFour/1300~1399/1337.The-K-Weakest-Rows-in-a-Matrix.md
new file mode 100644
index 000000000..a00d8d9b0
--- /dev/null
+++ b/website/content/ChapterFour/1300~1399/1337.The-K-Weakest-Rows-in-a-Matrix.md
@@ -0,0 +1,97 @@
+# [1337. The K Weakest Rows in a Matrix](https://leetcode.com/problems/the-k-weakest-rows-in-a-matrix/)
+
+
+## 题目
+
+Given a `m * n` matrix `mat` of *ones* (representing soldiers) and *zeros* (representing civilians), return the indexes of the `k` weakest rows in the matrix ordered from the weakest to the strongest.
+
+A row ***i*** is weaker than row ***j***, if the number of soldiers in row ***i*** is less than the number of soldiers in row ***j***, or they have the same number of soldiers but ***i*** is less than ***j***. Soldiers are **always** stand in the frontier of a row, that is, always *ones* may appear first and then *zeros*.
+
+**Example 1:**
+
+```
+Input: mat =
+[[1,1,0,0,0],
+ [1,1,1,1,0],
+ [1,0,0,0,0],
+ [1,1,0,0,0],
+ [1,1,1,1,1]],
+k = 3
+Output: [2,0,3]
+Explanation:
+The number of soldiers for each row is:
+row 0 -> 2
+row 1 -> 4
+row 2 -> 1
+row 3 -> 2
+row 4 -> 5
+Rows ordered from the weakest to the strongest are [2,0,3,1,4]
+
+```
+
+**Example 2:**
+
+```
+Input: mat =
+[[1,0,0,0],
+ [1,1,1,1],
+ [1,0,0,0],
+ [1,0,0,0]],
+k = 2
+Output: [0,2]
+Explanation:
+The number of soldiers for each row is:
+row 0 -> 1
+row 1 -> 4
+row 2 -> 1
+row 3 -> 1
+Rows ordered from the weakest to the strongest are [0,2,3,1]
+
+```
+
+**Constraints:**
+
+- `m == mat.length`
+- `n == mat[i].length`
+- `2 <= n, m <= 100`
+- `1 <= k <= m`
+- `matrix[i][j]` is either 0 **or** 1.
+
+## 题目大意
+
+给你一个大小为 m * n 的矩阵 mat，矩阵由若干军人和平民组成，分别用 1 和 0 表示。请你返回矩阵中战斗力最弱的 k 行的索引，按从最弱到最强排序。如果第 i 行的军人数量少于第 j 行，或者两行军人数量相同但 i 小于 j，那么我们认为第 i 行的战斗力比第 j 行弱。军人 总是 排在一行中的靠前位置，也就是说 1 总是出现在 0 之前。
+
+## 解题思路
+
+- 简单题。第一个能想到的解题思路是，先统计每一行 1 的个数，然后将结果进行排序，按照 1 的个数从小到大排序，如果 1 的个数相同，再按照行号从小到大排序。排好序的数组取出前 K 位即为答案。
+- 此题还有第二种解法。在第一种解法中，并没有用到题目中“军人 总是 排在一行中的靠前位置，也就是说 1 总是出现在 0 之前。”这一条件。由于有了这个条件，使得如果按照列去遍历，最先出现 0 的行，则是最弱的行。行号小的先被遍历到，所以相同数量 1 的行，行号小的会排在前面。最后记得再添加上全 1 的行。同样，最终输出取出前 K 位即为答案。此题解法二才是最优雅最高效的解法。
+
+## 代码
+
+```go
+package leetcode
+
+func kWeakestRows(mat [][]int, k int) []int {
+ res := []int{}
+ for j := 0; j < len(mat[0]); j++ {
+ for i := 0; i < len(mat); i++ {
+ if mat[i][j] == 0 && ((j == 0) || (mat[i][j-1] != 0)) {
+ res = append(res, i)
+ }
+ }
+ }
+ for i := 0; i < len(mat); i++ {
+ if mat[i][len(mat[0])-1] == 1 {
+ res = append(res, i)
+ }
+ }
+ return res[:k]
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1300~1399/1332.Remove-Palindromic-Subsequences/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1300~1399/1353.Maximum-Number-of-Events-That-Can-Be-Attended/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/1300~1399/1353.Maximum-Number-of-Events-That-Can-Be-Attended.md b/website/content/ChapterFour/1300~1399/1353.Maximum-Number-of-Events-That-Can-Be-Attended.md
new file mode 100644
index 000000000..c0929cfa3
--- /dev/null
+++ b/website/content/ChapterFour/1300~1399/1353.Maximum-Number-of-Events-That-Can-Be-Attended.md
@@ -0,0 +1,120 @@
+# [1353. Maximum Number of Events That Can Be Attended](https://leetcode.com/problems/maximum-number-of-events-that-can-be-attended/)
+
+
+## 题目
+
+Given an array of `events` where `events[i] = [startDayi, endDayi]`. Every event `i` starts at `startDayi` and ends at `endDayi`.
+
+You can attend an event `i` at any day `d` where `startTimei <= d <= endTimei`. Notice that you can only attend one event at any time `d`.
+
+Return *the maximum number of events* you can attend.
+
+**Example 1:**
+
+
+
+```
+Input: events = [[1,2],[2,3],[3,4]]
+Output: 3
+Explanation: You can attend all the three events.
+One way to attend them all is as shown.
+Attend the first event on day 1.
+Attend the second event on day 2.
+Attend the third event on day 3.
+
+```
+
+**Example 2:**
+
+```
+Input: events= [[1,2],[2,3],[3,4],[1,2]]
+Output: 4
+
+```
+
+**Example 3:**
+
+```
+Input: events = [[1,4],[4,4],[2,2],[3,4],[1,1]]
+Output: 4
+
+```
+
+**Example 4:**
+
+```
+Input: events = [[1,100000]]
+Output: 1
+
+```
+
+**Example 5:**
+
+```
+Input: events = [[1,1],[1,2],[1,3],[1,4],[1,5],[1,6],[1,7]]
+Output: 7
+
+```
+
+**Constraints:**
+
+- `1 <= events.length <= 10^5`
+- `events[i].length == 2`
+- `1 <= startDayi <= endDayi <= 10^5`
+
+## 题目大意
+
+给你一个数组 events，其中 events[i] = [startDayi, endDayi] ，表示会议 i 开始于 startDayi ，结束于 endDayi 。你可以在满足 startDayi <= d <= endDayi 中的任意一天 d 参加会议 i 。注意，一天只能参加一个会议。请你返回你可以参加的 最大 会议数目。
+
+## 解题思路
+
+- 关于会议安排，活动安排这类题，第一直觉是贪心问题。先按照会议开始时间从小到大排序，如果开始时间相同，再按照结束时间从小到大排序。贪心策略是，优先选择参加早结束的会议。因为一个结束时间晚的会议，代表这个会议持续时间长，先参加马上要结束的会议，这样可以参加更多的会议。
+- 注意题目给的数据代表的是天数。比较大小的时候最好转换成坐标轴上的坐标点。例如 [1,2] 代表这个会议持续 2 天，如果在坐标轴上表示，是 [0,2]，0-1 表示第一天，1-2 表示第二天。所以比较会议时需要把开始时间减一。选定了这个会议以后记得要把这一天排除，例如选择了第二天，那么下次对比起始时间需要从坐标 2 开始，因为第二天的时间范围是 1-2，所以下一轮比较会议前需要把开始时间加一。从左往右依次扫描各个会议时间段，选择结束时间大于起始时间的会议，不断累加次数，扫描完所有会议，最终结果即为可参加的最大会议数。
+- 测试数据中有一组很恶心的数据，见 test 文件中最后一组数据。这组数据在同一天叠加了多个会议，并且起始时间完全一致。这种特殊情况需要加判断条件排除，见下面代码 continue 条件。
+
+## 代码
+
+```go
+package leetcode
+
+import (
+ "sort"
+)
+
+func maxEvents(events [][]int) int {
+ sort.Slice(events, func(i, j int) bool {
+ if events[i][0] == events[j][0] {
+ return events[i][1] < events[j][1]
+ }
+ return events[i][0] < events[j][0]
+ })
+ attended, current := 1, events[0]
+ for i := 1; i < len(events); i++ {
+ prev, event := events[i-1], events[i]
+ if event[0] == prev[0] && event[1] == prev[1] && event[1] == event[0] {
+ continue
+ }
+ start, end := max(current[0], event[0]-1), max(current[1], event[1])
+ if end-start > 0 {
+ current[0] = start + 1
+ current[1] = end
+ attended++
+ }
+ }
+ return attended
+}
+
+func max(a, b int) int {
+ if a > b {
+ return a
+ }
+ return b
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1300~1399/1337.The-K-Weakest-Rows-in-a-Matrix/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1300~1399/1380.Lucky-Numbers-in-a-Matrix/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/1380.Lucky-Numbers-in-a-Matrix.md b/website/content/ChapterFour/1300~1399/1380.Lucky-Numbers-in-a-Matrix.md
similarity index 82%
rename from website/content/ChapterFour/1380.Lucky-Numbers-in-a-Matrix.md
rename to website/content/ChapterFour/1300~1399/1380.Lucky-Numbers-in-a-Matrix.md
index 01d97eb82..e17321058 100644
--- a/website/content/ChapterFour/1380.Lucky-Numbers-in-a-Matrix.md
+++ b/website/content/ChapterFour/1300~1399/1380.Lucky-Numbers-in-a-Matrix.md
@@ -84,4 +84,11 @@ func luckyNumbers(matrix [][]int) []int {
return res
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1300~1399/1353.Maximum-Number-of-Events-That-Can-Be-Attended/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1300~1399/1383.Maximum-Performance-of-a-Team/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/1300~1399/1383.Maximum-Performance-of-a-Team.md b/website/content/ChapterFour/1300~1399/1383.Maximum-Performance-of-a-Team.md
new file mode 100644
index 000000000..d4a3be6d2
--- /dev/null
+++ b/website/content/ChapterFour/1300~1399/1383.Maximum-Performance-of-a-Team.md
@@ -0,0 +1,112 @@
+# [1383. Maximum Performance of a Team](https://leetcode.com/problems/maximum-performance-of-a-team/)
+
+## 题目
+
+You are given two integers `n` and `k` and two integer arrays `speed` and `efficiency` both of length `n`. There are `n` engineers numbered from `1` to `n`. `speed[i]` and `efficiency[i]` represent the speed and efficiency of the `ith` engineer respectively.
+
+Choose **at most** `k` different engineers out of the `n` engineers to form a team with the maximum **performance**.
+
+The performance of a team is the sum of their engineers' speeds multiplied by the minimum efficiency among their engineers.
+
+Return *the maximum performance of this team*. Since the answer can be a huge number, return it **modulo** `109 + 7`.
+
+**Example 1:**
+
+```
+Input: n = 6, speed = [2,10,3,1,5,8], efficiency = [5,4,3,9,7,2], k = 2
+Output: 60
+Explanation:
+We have the maximum performance of the team by selecting engineer 2 (with speed=10 and efficiency=4) and engineer 5 (with speed=5 and efficiency=7). That is, performance = (10 + 5) * min(4, 7) = 60.
+```
+
+**Example 2:**
+
+```
+Input: n = 6, speed = [2,10,3,1,5,8], efficiency = [5,4,3,9,7,2], k = 3
+Output: 68
+Explanation:
+This is the same example as the first but k = 3. We can select engineer 1, engineer 2 and engineer 5 to get the maximum performance of the team. That is, performance = (2 + 10 + 5) * min(5, 4, 7) = 68.
+```
+
+**Example 3:**
+
+```
+Input: n = 6, speed = [2,10,3,1,5,8], efficiency = [5,4,3,9,7,2], k = 4
+Output: 72
+```
+
+**Constraints:**
+
+- `1 <= <= k <= n <= 105`
+- `speed.length == n`
+- `efficiency.length == n`
+- `1 <= speed[i] <= 105`
+- `1 <= efficiency[i] <= 108`
+
+## 题目大意
+
+公司有编号为 1 到 n 的 n 个工程师，给你两个数组 speed 和 efficiency ，其中 speed[i] 和 efficiency[i] 分别代表第 i 位工程师的速度和效率。请你返回由最多 k 个工程师组成的 最大团队表现值 ，由于答案可能很大，请你返回结果对 10^9 + 7 取余后的结果。团队表现值 的定义为：一个团队中「所有工程师速度的和」乘以他们「效率值中的最小值」。
+
+## 解题思路
+
+- 题目要求返回最大团队表现值，表现值需要考虑速度的累加和，和效率的最小值。即使速度快，效率的最小值很小，总的表现值还是很小。先将效率从大到小排序。从效率高的工程师开始选起，遍历过程中维护一个大小为 k 的速度最小堆。每次遍历都计算一次团队最大表现值。扫描完成，最大团队表现值也筛选出来了。具体实现见下面的代码。
+
+## 代码
+
+```go
+package leetcode
+
+import (
+ "container/heap"
+ "sort"
+)
+
+func maxPerformance(n int, speed []int, efficiency []int, k int) int {
+ indexes := make([]int, n)
+ for i := range indexes {
+ indexes[i] = i
+ }
+ sort.Slice(indexes, func(i, j int) bool {
+ return efficiency[indexes[i]] > efficiency[indexes[j]]
+ })
+ ph := speedHeap{}
+ heap.Init(&ph)
+ speedSum := 0
+ var max int64
+ for _, index := range indexes {
+ if ph.Len() == k {
+ speedSum -= heap.Pop(&ph).(int)
+ }
+ speedSum += speed[index]
+ heap.Push(&ph, speed[index])
+ max = Max(max, int64(speedSum)*int64(efficiency[index]))
+ }
+ return int(max % (1e9 + 7))
+}
+
+type speedHeap []int
+
+func (h speedHeap) Less(i, j int) bool { return h[i] < h[j] }
+func (h speedHeap) Swap(i, j int) { h[i], h[j] = h[j], h[i] }
+func (h speedHeap) Len() int { return len(h) }
+func (h *speedHeap) Push(x interface{}) { *h = append(*h, x.(int)) }
+func (h *speedHeap) Pop() interface{} {
+ res := (*h)[len(*h)-1]
+ *h = (*h)[:h.Len()-1]
+ return res
+}
+
+func Max(a, b int64) int64 {
+ if a > b {
+ return a
+ }
+ return b
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1300~1399/1380.Lucky-Numbers-in-a-Matrix/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1300~1399/1385.Find-the-Distance-Value-Between-Two-Arrays/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/1385.Find-the-Distance-Value-Between-Two-Arrays.md b/website/content/ChapterFour/1300~1399/1385.Find-the-Distance-Value-Between-Two-Arrays.md
similarity index 83%
rename from website/content/ChapterFour/1385.Find-the-Distance-Value-Between-Two-Arrays.md
rename to website/content/ChapterFour/1300~1399/1385.Find-the-Distance-Value-Between-Two-Arrays.md
index 9d6042469..02541558a 100644
--- a/website/content/ChapterFour/1385.Find-the-Distance-Value-Between-Two-Arrays.md
+++ b/website/content/ChapterFour/1300~1399/1385.Find-the-Distance-Value-Between-Two-Arrays.md
@@ -95,4 +95,11 @@ func abs(a int) int {
return a
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1300~1399/1383.Maximum-Performance-of-a-Team/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1300~1399/1389.Create-Target-Array-in-the-Given-Order/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/1389.Create-Target-Array-in-the-Given-Order.md b/website/content/ChapterFour/1300~1399/1389.Create-Target-Array-in-the-Given-Order.md
similarity index 84%
rename from website/content/ChapterFour/1389.Create-Target-Array-in-the-Given-Order.md
rename to website/content/ChapterFour/1300~1399/1389.Create-Target-Array-in-the-Given-Order.md
index 45f4acf6a..678e8f053 100644
--- a/website/content/ChapterFour/1389.Create-Target-Array-in-the-Given-Order.md
+++ b/website/content/ChapterFour/1300~1399/1389.Create-Target-Array-in-the-Given-Order.md
@@ -87,4 +87,11 @@ func createTargetArray(nums []int, index []int) []int {
return result
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1300~1399/1385.Find-the-Distance-Value-Between-Two-Arrays/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1300~1399/1396.Design-Underground-System/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/1300~1399/1396.Design-Underground-System.md b/website/content/ChapterFour/1300~1399/1396.Design-Underground-System.md
new file mode 100644
index 000000000..883a83945
--- /dev/null
+++ b/website/content/ChapterFour/1300~1399/1396.Design-Underground-System.md
@@ -0,0 +1,162 @@
+# [1396. Design Underground System](https://leetcode.com/problems/design-underground-system/)
+
+
+## 题目
+
+Implement the `UndergroundSystem` class:
+
+- `void checkIn(int id, string stationName, int t)`
+ - A customer with a card id equal to `id`, gets in the station `stationName` at time `t`.
+ - A customer can only be checked into one place at a time.
+- `void checkOut(int id, string stationName, int t)`
+ - A customer with a card id equal to `id`, gets out from the station `stationName` at time `t`.
+- `double getAverageTime(string startStation, string endStation)`
+ - Returns the average time to travel between the `startStation` and the `endStation`.
+ - The average time is computed from all the previous traveling from `startStation` to `endStation` that happened **directly**.
+ - Call to `getAverageTime` is always valid.
+
+You can assume all calls to `checkIn` and `checkOut` methods are consistent. If a customer gets in at time **t1** at some station, they get out at time **t2** with **t2 > t1**. All events happen in chronological order.
+
+**Example 1:**
+
+```
+Input
+["UndergroundSystem","checkIn","checkIn","checkIn","checkOut","checkOut","checkOut","getAverageTime","getAverageTime","checkIn","getAverageTime","checkOut","getAverageTime"]
+[[],[45,"Leyton",3],[32,"Paradise",8],[27,"Leyton",10],[45,"Waterloo",15],[27,"Waterloo",20],[32,"Cambridge",22],["Paradise","Cambridge"],["Leyton","Waterloo"],[10,"Leyton",24],["Leyton","Waterloo"],[10,"Waterloo",38],["Leyton","Waterloo"]]
+
+Output
+[null,null,null,null,null,null,null,14.00000,11.00000,null,11.00000,null,12.00000]
+
+Explanation
+UndergroundSystem undergroundSystem = new UndergroundSystem();
+undergroundSystem.checkIn(45, "Leyton", 3);
+undergroundSystem.checkIn(32, "Paradise", 8);
+undergroundSystem.checkIn(27, "Leyton", 10);
+undergroundSystem.checkOut(45, "Waterloo", 15);
+undergroundSystem.checkOut(27, "Waterloo", 20);
+undergroundSystem.checkOut(32, "Cambridge", 22);
+undergroundSystem.getAverageTime("Paradise", "Cambridge"); // return 14.00000. There was only one travel from "Paradise" (at time 8) to "Cambridge" (at time 22)
+undergroundSystem.getAverageTime("Leyton", "Waterloo"); // return 11.00000. There were two travels from "Leyton" to "Waterloo", a customer with id=45 from time=3 to time=15 and a customer with id=27 from time=10 to time=20. So the average time is ( (15-3) + (20-10) ) / 2 = 11.00000
+undergroundSystem.checkIn(10, "Leyton", 24);
+undergroundSystem.getAverageTime("Leyton", "Waterloo"); // return 11.00000
+undergroundSystem.checkOut(10, "Waterloo", 38);
+undergroundSystem.getAverageTime("Leyton", "Waterloo"); // return 12.00000
+```
+
+**Example 2:**
+
+```
+Input
+["UndergroundSystem","checkIn","checkOut","getAverageTime","checkIn","checkOut","getAverageTime","checkIn","checkOut","getAverageTime"]
+[[],[10,"Leyton",3],[10,"Paradise",8],["Leyton","Paradise"],[5,"Leyton",10],[5,"Paradise",16],["Leyton","Paradise"],[2,"Leyton",21],[2,"Paradise",30],["Leyton","Paradise"]]
+
+Output
+[null,null,null,5.00000,null,null,5.50000,null,null,6.66667]
+
+Explanation
+UndergroundSystem undergroundSystem = new UndergroundSystem();
+undergroundSystem.checkIn(10, "Leyton", 3);
+undergroundSystem.checkOut(10, "Paradise", 8);
+undergroundSystem.getAverageTime("Leyton", "Paradise"); // return 5.00000
+undergroundSystem.checkIn(5, "Leyton", 10);
+undergroundSystem.checkOut(5, "Paradise", 16);
+undergroundSystem.getAverageTime("Leyton", "Paradise"); // return 5.50000
+undergroundSystem.checkIn(2, "Leyton", 21);
+undergroundSystem.checkOut(2, "Paradise", 30);
+undergroundSystem.getAverageTime("Leyton", "Paradise"); // return 6.66667
+```
+
+**Constraints:**
+
+- There will be at most `20000` operations.
+- `1 <= id, t <= 106`
+- All strings consist of uppercase and lowercase English letters, and digits.
+- `1 <= stationName.length <= 10`
+- Answers within `105` of the actual value will be accepted as correct.
+
+## 题目大意
+
+请你实现一个类 UndergroundSystem ，它支持以下 3 种方法：
+
+- 1. checkIn(int id, string stationName, int t)
+ - 编号为 id 的乘客在 t 时刻进入地铁站 stationName 。
+ - 一个乘客在同一时间只能在一个地铁站进入或者离开。
+- 2. checkOut(int id, string stationName, int t)
+ - 编号为 id 的乘客在 t 时刻离开地铁站 stationName 。
+- 3. getAverageTime(string startStation, string endStation)
+ - 返回从地铁站 startStation 到地铁站 endStation 的平均花费时间。
+ - 平均时间计算的行程包括当前为止所有从 startStation 直接到达 endStation 的行程。
+ - 调用 getAverageTime 时，询问的路线至少包含一趟行程。
+
+你可以假设所有对 checkIn 和 checkOut 的调用都是符合逻辑的。也就是说，如果一个顾客在 t1 时刻到达某个地铁站，那么他离开的时间 t2 一定满足 t2 > t1 。所有的事件都按时间顺序给出。
+
+## 解题思路
+
+- 维护 2 个 `map`。一个 `mapA` 内部存储的是乘客 `id` 与（入站时间，站名）的对应关系。另外一个 `mapB` 存储的是起点站与终点站花费总时间与人数总数的关系。每当有人 `checkin()`，就更新 `mapA` 中的信息。每当有人 `checkout()`，就更新 `mapB` 中的信息，并删除 `mapA` 对应乘客 `id` 的键值对。最后调用 `getAverageTime()` 函数的时候根据 `mapB` 中存储的信息计算即可。
+
+## 代码
+
+```go
+package leetcode
+
+type checkin struct {
+ station string
+ time int
+}
+
+type stationTime struct {
+ sum, count float64
+}
+
+type UndergroundSystem struct {
+ checkins map[int]*checkin
+ stationTimes map[string]map[string]*stationTime
+}
+
+func Constructor() UndergroundSystem {
+ return UndergroundSystem{
+ make(map[int]*checkin),
+ make(map[string]map[string]*stationTime),
+ }
+}
+
+func (s *UndergroundSystem) CheckIn(id int, stationName string, t int) {
+ s.checkins[id] = &checkin{stationName, t}
+}
+
+func (s *UndergroundSystem) CheckOut(id int, stationName string, t int) {
+ checkin := s.checkins[id]
+ destination := s.stationTimes[checkin.station]
+ if destination == nil {
+ s.stationTimes[checkin.station] = make(map[string]*stationTime)
+ }
+ st := s.stationTimes[checkin.station][stationName]
+ if st == nil {
+ st = new(stationTime)
+ s.stationTimes[checkin.station][stationName] = st
+ }
+ st.sum += float64(t - checkin.time)
+ st.count++
+ delete(s.checkins, id)
+}
+
+func (s *UndergroundSystem) GetAverageTime(startStation string, endStation string) float64 {
+ st := s.stationTimes[startStation][endStation]
+ return st.sum / st.count
+}
+
+/**
+ * Your UndergroundSystem object will be instantiated and called as such:
+ * obj := Constructor();
+ * obj.CheckIn(id,stationName,t);
+ * obj.CheckOut(id,stationName,t);
+ * param_3 := obj.GetAverageTime(startStation,endStation);
+ */
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1300~1399/1389.Create-Target-Array-in-the-Given-Order/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1400~1499/1423.Maximum-Points-You-Can-Obtain-from-Cards/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/1300~1399/_index.md b/website/content/ChapterFour/1300~1399/_index.md
new file mode 100644
index 000000000..d2021683f
--- /dev/null
+++ b/website/content/ChapterFour/1300~1399/_index.md
@@ -0,0 +1,5 @@
+---
+bookCollapseSection: true
+weight: 20
+---
+
diff --git a/website/content/ChapterFour/1304.Find-N-Unique-Integers-Sum-up-to-Zero.md b/website/content/ChapterFour/1304.Find-N-Unique-Integers-Sum-up-to-Zero.md
deleted file mode 100644
index 1e15836e3..000000000
--- a/website/content/ChapterFour/1304.Find-N-Unique-Integers-Sum-up-to-Zero.md
+++ /dev/null
@@ -1,62 +0,0 @@
-# [1304. Find N Unique Integers Sum up to Zero](https://leetcode.com/problems/find-n-unique-integers-sum-up-to-zero/)
-
-
-
-## 题目
-
-Given an integer `n`, return **any** array containing `n` **unique** integers such that they add up to 0.
-
-**Example 1**:
-
-```
-Input: n = 5
-Output: [-7,-1,1,3,4]
-Explanation: These arrays also are accepted [-5,-1,1,2,3] , [-3,-1,2,-2,4].
-```
-
-**Example 2**:
-
-```
-Input: n = 3
-Output: [-1,0,1]
-```
-
-**Example 3**:
-
-```
-Input: n = 1
-Output: [0]
-```
-
-**Constraints**:
-
-- `1 <= n <= 1000`
-
-## 题目大意
-
-给你一个整数 n，请你返回 任意 一个由 n 个 各不相同 的整数组成的数组，并且这 n 个数相加和为 0 。
-
-提示：
-
-- 1 <= n <= 1000
-
-## 解题思路
-
-- 给出一个数 n，输出一个有 n 个数的数组，里面元素之和为 0 。
-- 简单题，简单循环即可。
-
-## 代码
-
-```go
-func sumZero(n int) []int {
- res, left, right, start := make([]int, n), 0, n-1, 1
- for left < right {
- res[left] = start
- res[right] = -start
- start++
- left = left + 1
- right = right - 1
- }
- return res
-}
-```
\ No newline at end of file
diff --git a/website/content/ChapterFour/1400~1499/1423.Maximum-Points-You-Can-Obtain-from-Cards.md b/website/content/ChapterFour/1400~1499/1423.Maximum-Points-You-Can-Obtain-from-Cards.md
new file mode 100644
index 000000000..ecf600ef1
--- /dev/null
+++ b/website/content/ChapterFour/1400~1499/1423.Maximum-Points-You-Can-Obtain-from-Cards.md
@@ -0,0 +1,97 @@
+# [1423. Maximum Points You Can Obtain from Cards](https://leetcode.com/problems/maximum-points-you-can-obtain-from-cards/)
+
+
+## 题目
+
+There are several cards **arranged in a row**, and each card has an associated number of points The points are given in the integer array `cardPoints`.
+
+In one step, you can take one card from the beginning or from the end of the row. You have to take exactly `k` cards.
+
+Your score is the sum of the points of the cards you have taken.
+
+Given the integer array `cardPoints` and the integer `k`, return the *maximum score* you can obtain.
+
+**Example 1:**
+
+```
+Input: cardPoints = [1,2,3,4,5,6,1], k = 3
+Output: 12
+Explanation: After the first step, your score will always be 1. However, choosing the rightmost card first will maximize your total score. The optimal strategy is to take the three cards on the right, giving a final score of 1 + 6 + 5 = 12.
+```
+
+**Example 2:**
+
+```
+Input: cardPoints = [2,2,2], k = 2
+Output: 4
+Explanation: Regardless of which two cards you take, your score will always be 4.
+```
+
+**Example 3:**
+
+```
+Input: cardPoints = [9,7,7,9,7,7,9], k = 7
+Output: 55
+Explanation: You have to take all the cards. Your score is the sum of points of all cards.
+```
+
+**Example 4:**
+
+```
+Input: cardPoints = [1,1000,1], k = 1
+Output: 1
+Explanation: You cannot take the card in the middle. Your best score is 1.
+```
+
+**Example 5:**
+
+```
+Input: cardPoints = [1,79,80,1,1,1,200,1], k = 3
+Output: 202
+```
+
+**Constraints:**
+
+- `1 <= cardPoints.length <= 10^5`
+- `1 <= cardPoints[i] <= 10^4`
+- `1 <= k <= cardPoints.length`
+
+## 题目大意
+
+几张卡牌 排成一行，每张卡牌都有一个对应的点数。点数由整数数组 cardPoints 给出。每次行动，你可以从行的开头或者末尾拿一张卡牌，最终你必须正好拿 k 张卡牌。你的点数就是你拿到手中的所有卡牌的点数之和。给你一个整数数组 cardPoints 和整数 k，请你返回可以获得的最大点数。
+
+## 解题思路
+
+- 这一题是滑动窗口题的简化题。从卡牌两边取 K 张牌，可以转换成在中间连续取 n-K 张牌。从两边取牌的点数最大，意味着剩下来中间牌的点数最小。扫描一遍数组，在每一个窗口大小为 n-K 的窗口内计算累加和，记录下最小的累加和。题目最终求的最大点数等于牌的总和减去中间最小的累加和。
+
+## 代码
+
+```go
+package leetcode
+
+func maxScore(cardPoints []int, k int) int {
+ windowSize, sum := len(cardPoints)-k, 0
+ for _, val := range cardPoints[:windowSize] {
+ sum += val
+ }
+ minSum := sum
+ for i := windowSize; i < len(cardPoints); i++ {
+ sum += cardPoints[i] - cardPoints[i-windowSize]
+ if sum < minSum {
+ minSum = sum
+ }
+ }
+ total := 0
+ for _, pt := range cardPoints {
+ total += pt
+ }
+ return total - minSum
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1300~1399/1396.Design-Underground-System/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1400~1499/1437.Check-If-All-1s-Are-at-Least-Length-K-Places-Away/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/1400~1499/1437.Check-If-All-1s-Are-at-Least-Length-K-Places-Away.md b/website/content/ChapterFour/1400~1499/1437.Check-If-All-1s-Are-at-Least-Length-K-Places-Away.md
new file mode 100644
index 000000000..430eb24bc
--- /dev/null
+++ b/website/content/ChapterFour/1400~1499/1437.Check-If-All-1s-Are-at-Least-Length-K-Places-Away.md
@@ -0,0 +1,80 @@
+# [1437. Check If All 1's Are at Least Length K Places Away](https://leetcode.com/problems/check-if-all-1s-are-at-least-length-k-places-away/)
+
+
+## 题目
+
+Given an array `nums` of 0s and 1s and an integer `k`, return `True` if all 1's are at least `k` places away from each other, otherwise return `False`.
+
+**Example 1:**
+
+
+
+```
+Input: nums = [1,0,0,0,1,0,0,1], k = 2
+Output: true
+Explanation: Each of the 1s are at least 2 places away from each other.
+```
+
+**Example 2:**
+
+
+
+```
+Input: nums = [1,0,0,1,0,1], k = 2
+Output: false
+Explanation: The second 1 and third 1 are only one apart from each other.
+```
+
+**Example 3:**
+
+```
+Input: nums = [1,1,1,1,1], k = 0
+Output: true
+```
+
+**Example 4:**
+
+```
+Input: nums = [0,1,0,1], k = 1
+Output: true
+```
+
+**Constraints:**
+
+- `1 <= nums.length <= 10^5`
+- `0 <= k <= nums.length`
+- `nums[i]` is `0` or `1`
+
+## 题目大意
+
+给你一个由若干 0 和 1 组成的数组 nums 以及整数 k。如果所有 1 都至少相隔 k 个元素，则返回 True ；否则，返回 False 。
+
+## 解题思路
+
+- 简单题。扫描一遍数组，遇到 1 的时候比较前一个 1 的下标索引，如果相隔小于 k 则返回 false。如果大于等于 k 就更新下标索引，继续循环。循环结束输出 true 即可。
+
+## 代码
+
+```go
+package leetcode
+
+func kLengthApart(nums []int, k int) bool {
+ prevIndex := -1
+ for i, num := range nums {
+ if num == 1 {
+ if prevIndex != -1 && i-prevIndex-1 < k {
+ return false
+ }
+ prevIndex = i
+ }
+ }
+ return true
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1400~1499/1423.Maximum-Points-You-Can-Obtain-from-Cards/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1400~1499/1438.Longest-Continuous-Subarray-With-Absolute-Diff-Less-Than-or-Equal-to-Limit/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/1400~1499/1438.Longest-Continuous-Subarray-With-Absolute-Diff-Less-Than-or-Equal-to-Limit.md b/website/content/ChapterFour/1400~1499/1438.Longest-Continuous-Subarray-With-Absolute-Diff-Less-Than-or-Equal-to-Limit.md
new file mode 100644
index 000000000..38a8e77ad
--- /dev/null
+++ b/website/content/ChapterFour/1400~1499/1438.Longest-Continuous-Subarray-With-Absolute-Diff-Less-Than-or-Equal-to-Limit.md
@@ -0,0 +1,96 @@
+# [1438. Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit](https://leetcode.com/problems/longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit/)
+
+
+## 题目
+
+Given an array of integers `nums` and an integer `limit`, return the size of the longest **non-empty** subarray such that the absolute difference between any two elements of this subarray is less than or equal to `limit`*.*
+
+**Example 1:**
+
+```
+Input: nums = [8,2,4,7], limit = 4
+Output: 2
+Explanation: All subarrays are:
+[8] with maximum absolute diff |8-8| = 0 <= 4.
+[8,2] with maximum absolute diff |8-2| = 6 > 4.
+[8,2,4] with maximum absolute diff |8-2| = 6 > 4.
+[8,2,4,7] with maximum absolute diff |8-2| = 6 > 4.
+[2] with maximum absolute diff |2-2| = 0 <= 4.
+[2,4] with maximum absolute diff |2-4| = 2 <= 4.
+[2,4,7] with maximum absolute diff |2-7| = 5 > 4.
+[4] with maximum absolute diff |4-4| = 0 <= 4.
+[4,7] with maximum absolute diff |4-7| = 3 <= 4.
+[7] with maximum absolute diff |7-7| = 0 <= 4.
+Therefore, the size of the longest subarray is 2.
+```
+
+**Example 2:**
+
+```
+Input: nums = [10,1,2,4,7,2], limit = 5
+Output: 4
+Explanation: The subarray [2,4,7,2] is the longest since the maximum absolute diff is |2-7| = 5 <= 5.
+```
+
+**Example 3:**
+
+```
+Input: nums = [4,2,2,2,4,4,2,2], limit = 0
+Output: 3
+```
+
+**Constraints:**
+
+- `1 <= nums.length <= 10^5`
+- `1 <= nums[i] <= 10^9`
+- `0 <= limit <= 10^9`
+
+## 题目大意
+
+给你一个整数数组 nums ，和一个表示限制的整数 limit，请你返回最长连续子数组的长度，该子数组中的任意两个元素之间的绝对差必须小于或者等于 limit 。如果不存在满足条件的子数组，则返回 0 。
+
+## 解题思路
+
+- 最开始想到的思路是利用滑动窗口遍历一遍数组，每个窗口内排序，取出最大最小值。滑动窗口遍历一次的时间复杂度是 O(n)，所以此题时间复杂度是否高效落在了排序算法上了。由于前后 2 个窗口数据是有关联的，仅仅只变动了 2 个数据（左窗口移出的数据和右窗口移进的数据），所以排序没有必要每次都重新排序。这里利用二叉排序树来排序，添加和删除元素时间复杂度是 O(log n)，这种方法总的时间复杂度是 O(n log n)。空间复杂度 O(n)。
+- 二叉排序树的思路是否还有再优化的空间？答案是有。二叉排序树内维护了所有结点的有序关系，但是这个关系是多余的。此题只需要找到最大值和最小值，并不需要除此以外节点的有序信息。所以用二叉排序树是大材小用了。可以换成 2 个单调队列，一个维护窗口内的最大值，另一个维护窗口内的最小值。这样优化以后，时间复杂度降低到 O(n)，空间复杂度 O(n)。具体实现见代码。
+- 单调栈的题还有第 42 题，第 84 题，第 496 题，第 503 题，第 739 题，第 856 题，第 901 题，第 907 题，第 1130 题，第 1425 题，第 1673 题。
+
+## 代码
+
+```go
+package leetcode
+
+func longestSubarray(nums []int, limit int) int {
+ minStack, maxStack, left, res := []int{}, []int{}, 0, 0
+ for right, num := range nums {
+ for len(minStack) > 0 && nums[minStack[len(minStack)-1]] > num {
+ minStack = minStack[:len(minStack)-1]
+ }
+ minStack = append(minStack, right)
+ for len(maxStack) > 0 && nums[maxStack[len(maxStack)-1]] < num {
+ maxStack = maxStack[:len(maxStack)-1]
+ }
+ maxStack = append(maxStack, right)
+ if len(minStack) > 0 && len(maxStack) > 0 && nums[maxStack[0]]-nums[minStack[0]] > limit {
+ if left == minStack[0] {
+ minStack = minStack[1:]
+ }
+ if left == maxStack[0] {
+ maxStack = maxStack[1:]
+ }
+ left++
+ }
+ if right-left+1 > res {
+ res = right - left + 1
+ }
+ }
+ return res
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1400~1499/1437.Check-If-All-1s-Are-at-Least-Length-K-Places-Away/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1400~1499/1439.Find-the-Kth-Smallest-Sum-of-a-Matrix-With-Sorted-Rows/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/1400~1499/1439.Find-the-Kth-Smallest-Sum-of-a-Matrix-With-Sorted-Rows.md b/website/content/ChapterFour/1400~1499/1439.Find-the-Kth-Smallest-Sum-of-a-Matrix-With-Sorted-Rows.md
new file mode 100644
index 000000000..574a8f3a3
--- /dev/null
+++ b/website/content/ChapterFour/1400~1499/1439.Find-the-Kth-Smallest-Sum-of-a-Matrix-With-Sorted-Rows.md
@@ -0,0 +1,151 @@
+# [1439. Find the Kth Smallest Sum of a Matrix With Sorted Rows](https://leetcode.com/problems/find-the-kth-smallest-sum-of-a-matrix-with-sorted-rows/)
+
+
+## 题目
+
+You are given an `m * n` matrix, `mat`, and an integer `k`, which has its rows sorted in non-decreasing order.
+
+You are allowed to choose exactly 1 element from each row to form an array. Return the Kth **smallest** array sum among all possible arrays.
+
+**Example 1:**
+
+```
+Input: mat = [[1,3,11],[2,4,6]], k = 5
+Output: 7
+Explanation: Choosing one element from each row, the first k smallest sum are:
+[1,2], [1,4], [3,2], [3,4], [1,6]. Where the 5th sum is 7.
+```
+
+**Example 2:**
+
+```
+Input: mat = [[1,3,11],[2,4,6]], k = 9
+Output: 17
+```
+
+**Example 3:**
+
+```
+Input: mat = [[1,10,10],[1,4,5],[2,3,6]], k = 7
+Output: 9
+Explanation: Choosing one element from each row, the first k smallest sum are:
+[1,1,2], [1,1,3], [1,4,2], [1,4,3], [1,1,6], [1,5,2], [1,5,3]. Where the 7th sum is 9.
+```
+
+**Example 4:**
+
+```
+Input: mat = [[1,1,10],[2,2,9]], k = 7
+Output: 12
+```
+
+**Constraints:**
+
+- `m == mat.length`
+- `n == mat.length[i]`
+- `1 <= m, n <= 40`
+- `1 <= k <= min(200, n ^ m)`
+- `1 <= mat[i][j] <= 5000`
+- `mat[i]` is a non decreasing array.
+
+## 题目大意
+
+给你一个 m * n 的矩阵 mat，以及一个整数 k ，矩阵中的每一行都以非递减的顺序排列。你可以从每一行中选出 1 个元素形成一个数组。返回所有可能数组中的第 k 个 最小数组和。
+
+## 解题思路
+
+- 这一题是第 373 题的升级版。在第 373 题中，给定 2 个有序数组，要求分别从这 2 个数组中选出一个数组成一个数对，最终输出和最小的 K 组。这一题中给出的是 m*n 的矩阵。其实是将第 373 题的 2 个数组升级为了 m 个数组。无非外层多了一层循环。这层循环依次从每一行中选出一个数，先从第 0 行和第 1 行取数，找到前 K 小的组合以后，再从第 2 行取数，以此类推。其他做法和第 373 题一致。维护一个长度为 k 的最小堆。每次从堆中 pop 出最小的数组和 sum 和对应的下标 index，然后依次将下标向后移动一位，生成新的 sum，加入堆中。
+
+## 代码
+
+```go
+package leetcode
+
+import "container/heap"
+
+func kthSmallest(mat [][]int, k int) int {
+ if len(mat) == 0 || len(mat[0]) == 0 || k == 0 {
+ return 0
+ }
+ prev := mat[0]
+ for i := 1; i < len(mat); i++ {
+ prev = kSmallestPairs(prev, mat[i], k)
+ }
+ if k < len(prev) {
+ return -1
+ }
+ return prev[k-1]
+}
+
+func kSmallestPairs(nums1 []int, nums2 []int, k int) []int {
+ res := []int{}
+ if len(nums2) == 0 {
+ return res
+ }
+ pq := newPriorityQueue()
+ for i := 0; i < len(nums1) && i < k; i++ {
+ heap.Push(pq, &pddata{
+ n1: nums1[i],
+ n2: nums2[0],
+ n2Idx: 0,
+ })
+ }
+ for pq.Len() > 0 {
+ i := heap.Pop(pq)
+ data := i.(*pddata)
+ res = append(res, data.n1+data.n2)
+ k--
+ if k <= 0 {
+ break
+ }
+ idx := data.n2Idx
+ idx++
+ if idx >= len(nums2) {
+ continue
+ }
+ heap.Push(pq, &pddata{
+ n1: data.n1,
+ n2: nums2[idx],
+ n2Idx: idx,
+ })
+ }
+ return res
+}
+
+type pddata struct {
+ n1 int
+ n2 int
+ n2Idx int
+}
+
+type priorityQueue []*pddata
+
+func newPriorityQueue() *priorityQueue {
+ pq := priorityQueue([]*pddata{})
+ heap.Init(&pq)
+ return &pq
+}
+
+func (pq priorityQueue) Len() int { return len(pq) }
+func (pq priorityQueue) Swap(i, j int) { pq[i], pq[j] = pq[j], pq[i] }
+func (pq priorityQueue) Less(i, j int) bool { return pq[i].n1+pq[i].n2 < pq[j].n1+pq[j].n2 }
+func (pq *priorityQueue) Pop() interface{} {
+ old := *pq
+ val := old[len(old)-1]
+ old[len(old)-1] = nil
+ *pq = old[0 : len(old)-1]
+ return val
+}
+
+func (pq *priorityQueue) Push(i interface{}) {
+ val := i.(*pddata)
+ *pq = append(*pq, val)
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1400~1499/1438.Longest-Continuous-Subarray-With-Absolute-Diff-Less-Than-or-Equal-to-Limit/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1400~1499/1442.Count-Triplets-That-Can-Form-Two-Arrays-of-Equal-XOR/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/1400~1499/1442.Count-Triplets-That-Can-Form-Two-Arrays-of-Equal-XOR.md b/website/content/ChapterFour/1400~1499/1442.Count-Triplets-That-Can-Form-Two-Arrays-of-Equal-XOR.md
new file mode 100644
index 000000000..e8fcfcce1
--- /dev/null
+++ b/website/content/ChapterFour/1400~1499/1442.Count-Triplets-That-Can-Form-Two-Arrays-of-Equal-XOR.md
@@ -0,0 +1,104 @@
+# [1442. Count Triplets That Can Form Two Arrays of Equal XOR](https://leetcode.com/problems/count-triplets-that-can-form-two-arrays-of-equal-xor/)
+
+
+## 题目
+
+Given an array of integers `arr`.
+
+We want to select three indices `i`, `j` and `k` where `(0 <= i < j <= k < arr.length)`.
+
+Let's define `a` and `b` as follows:
+
+- `a = arr[i] ^ arr[i + 1] ^ ... ^ arr[j - 1]`
+- `b = arr[j] ^ arr[j + 1] ^ ... ^ arr[k]`
+
+Note that **^** denotes the **bitwise-xor** operation.
+
+Return *the number of triplets* (`i`, `j` and `k`) Where `a == b`.
+
+**Example 1:**
+
+```
+Input: arr = [2,3,1,6,7]
+Output: 4
+Explanation: The triplets are (0,1,2), (0,2,2), (2,3,4) and (2,4,4)
+```
+
+**Example 2:**
+
+```
+Input: arr = [1,1,1,1,1]
+Output: 10
+```
+
+**Example 3:**
+
+```
+Input: arr = [2,3]
+Output: 0
+```
+
+**Example 4:**
+
+```
+Input: arr = [1,3,5,7,9]
+Output: 3
+```
+
+**Example 5:**
+
+```
+Input: arr = [7,11,12,9,5,2,7,17,22]
+Output: 8
+```
+
+**Constraints:**
+
+- `1 <= arr.length <= 300`
+- `1 <= arr[i] <= 10^8`
+
+## 题目大意
+
+给你一个整数数组 arr 。现需要从数组中取三个下标 i、j 和 k ，其中 (0 <= i < j <= k < arr.length) 。a 和 b 定义如下：
+
+- a = arr[i] ^ arr[i + 1] ^ ... ^ arr[j - 1]
+- b = arr[j] ^ arr[j + 1] ^ ... ^ arr[k]
+
+注意：^ 表示 按位异或 操作。请返回能够令 a == b 成立的三元组 (i, j , k) 的数目。
+
+## 解题思路
+
+- 这一题需要用到 `x^x = 0` 这个异或特性。题目要求 `a == b`，可以等效转化为 `arr[i] ^ arr[i + 1] ^ ... ^ arr[j - 1] ^ arr[j] ^ arr[j + 1] ^ ... ^ arr[k] = 0`，这样 j 相当于可以“忽略”，专注找到所有元素异或结果为 0 的区间 [i,k] 即为答案。利用前缀和的思想，只不过此题非累加和，而是异或。又由 `x^x = 0` 这个异或特性，相同部分异或相当于消除，于是有 `prefix[i,k] = prefix[0,k] ^ prefix[0,i-1]`，找到每一个 `prefix[i,k] = 0` 的 i，k 组合，i < j <= k，那么满足条件的三元组 (i,j,k) 的个数完全取决于 j 的取值范围，(因为 i 和 k 已经固定了)，j 的取值范围为 k-i，所以累加所有满足条件的 k-i，输出即为最终答案。
+
+## 代码
+
+```go
+package leetcode
+
+func countTriplets(arr []int) int {
+ prefix, num, count, total := make([]int, len(arr)), 0, 0, 0
+ for i, v := range arr {
+ num ^= v
+ prefix[i] = num
+ }
+ for i := 0; i < len(prefix)-1; i++ {
+ for k := i + 1; k < len(prefix); k++ {
+ total = prefix[k]
+ if i > 0 {
+ total ^= prefix[i-1]
+ }
+ if total == 0 {
+ count += k - i
+ }
+ }
+ }
+ return count
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1400~1499/1439.Find-the-Kth-Smallest-Sum-of-a-Matrix-With-Sorted-Rows/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1400~1499/1446.Consecutive-Characters/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/1400~1499/1446.Consecutive-Characters.md b/website/content/ChapterFour/1400~1499/1446.Consecutive-Characters.md
new file mode 100644
index 000000000..1d1beb7ff
--- /dev/null
+++ b/website/content/ChapterFour/1400~1499/1446.Consecutive-Characters.md
@@ -0,0 +1,82 @@
+# [1446. Consecutive Characters](https://leetcode.com/problems/consecutive-characters/)
+
+## 题目
+
+The power of the string is the maximum length of a non-empty substring that contains only one unique character.
+
+Given a string s, return the power of s.
+
+**Example 1**:
+
+ Input: s = "leetcode"
+ Output: 2
+ Explanation: The substring "ee" is of length 2 with the character 'e' only.
+
+**Example 2**:
+
+ Input: s = "abbcccddddeeeeedcba"
+ Output: 5
+ Explanation: The substring "eeeee" is of length 5 with the character 'e' only.
+
+**Example 3**:
+
+ Input: s = "triplepillooooow"
+ Output: 5
+
+**Example 4**:
+
+ Input: s = "hooraaaaaaaaaaay"
+ Output: 11
+
+**Example 5**:
+
+ Input: s = "tourist"
+ Output: 1
+
+**Constraints:**
+
+- 1 <= s.length <= 500
+- s consists of only lowercase English letters.
+
+## 题目大意
+
+给你一个字符串 s ，字符串的「能量」定义为：只包含一种字符的最长非空子字符串的长度。
+
+请你返回字符串的能量。
+
+## 解题思路
+
+- 顺序遍历进行统计
+
+## 代码
+
+```go
+package leetcode
+
+func maxPower(s string) int {
+ cur, cnt, ans := s[0], 1, 1
+ for i := 1; i < len(s); i++ {
+ if cur == s[i] {
+ cnt++
+ } else {
+ if cnt > ans {
+ ans = cnt
+ }
+ cur = s[i]
+ cnt = 1
+ }
+ }
+ if cnt > ans {
+ ans = cnt
+ }
+ return ans
+}
+
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1400~1499/1442.Count-Triplets-That-Can-Form-Two-Arrays-of-Equal-XOR/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1400~1499/1455.Check-If-a-Word-Occurs-As-a-Prefix-of-Any-Word-in-a-Sentence/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/1455.Check-If-a-Word-Occurs-As-a-Prefix-of-Any-Word-in-a-Sentence.md b/website/content/ChapterFour/1400~1499/1455.Check-If-a-Word-Occurs-As-a-Prefix-of-Any-Word-in-a-Sentence.md
similarity index 87%
rename from website/content/ChapterFour/1455.Check-If-a-Word-Occurs-As-a-Prefix-of-Any-Word-in-a-Sentence.md
rename to website/content/ChapterFour/1400~1499/1455.Check-If-a-Word-Occurs-As-a-Prefix-of-Any-Word-in-a-Sentence.md
index c8081e82b..3bba6e43b 100644
--- a/website/content/ChapterFour/1455.Check-If-a-Word-Occurs-As-a-Prefix-of-Any-Word-in-a-Sentence.md
+++ b/website/content/ChapterFour/1400~1499/1455.Check-If-a-Word-Occurs-As-a-Prefix-of-Any-Word-in-a-Sentence.md
@@ -95,4 +95,11 @@ func isPrefixOfWord(sentence string, searchWord string) int {
return -1
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1400~1499/1446.Consecutive-Characters/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1400~1499/1461.Check-If-a-String-Contains-All-Binary-Codes-of-Size-K/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/1400~1499/1461.Check-If-a-String-Contains-All-Binary-Codes-of-Size-K.md b/website/content/ChapterFour/1400~1499/1461.Check-If-a-String-Contains-All-Binary-Codes-of-Size-K.md
new file mode 100644
index 000000000..606ccb6dd
--- /dev/null
+++ b/website/content/ChapterFour/1400~1499/1461.Check-If-a-String-Contains-All-Binary-Codes-of-Size-K.md
@@ -0,0 +1,93 @@
+# [1461. Check If a String Contains All Binary Codes of Size K](https://leetcode.com/problems/check-if-a-string-contains-all-binary-codes-of-size-k/)
+
+
+## 题目
+
+Given a binary string `s` and an integer `k`.
+
+Return *True* if every binary code of length `k` is a substring of `s`. Otherwise, return *False*.
+
+**Example 1:**
+
+```
+Input: s = "00110110", k = 2
+Output: true
+Explanation: The binary codes of length 2 are "00", "01", "10" and "11". They can be all found as substrings at indicies 0, 1, 3 and 2 respectively.
+```
+
+**Example 2:**
+
+```
+Input: s = "00110", k = 2
+Output: true
+```
+
+**Example 3:**
+
+```
+Input: s = "0110", k = 1
+Output: true
+Explanation: The binary codes of length 1 are "0" and "1", it is clear that both exist as a substring.
+```
+
+**Example 4:**
+
+```
+Input: s = "0110", k = 2
+Output: false
+Explanation: The binary code "00" is of length 2 and doesn't exist in the array.
+```
+
+**Example 5:**
+
+```
+Input: s = "0000000001011100", k = 4
+Output: false
+```
+
+**Constraints:**
+
+- `1 <= s.length <= 5 * 10^5`
+- `s` consists of 0's and 1's only.
+- `1 <= k <= 20`
+
+## 题目大意
+
+给你一个二进制字符串 `s` 和一个整数 `k` 。如果所有长度为 `k` 的二进制字符串都是 `s` 的子串，请返回 `True` ，否则请返回 `False` 。
+
+## 解题思路
+
+- 构造一个 `mask` 遮罩，依次划过整个二进制字符串，每次滑动即取出遮罩遮住的 `k` 位二进制字符。可以用 `map` 存储不同的二进制转换成的十进制数，最后判断 `len(map)` 是否等于 `k` 即可。但是用 `map` 存比较慢，此处换成 `bool` 数组。先构造一个长度为 `k` 的数组，然后每次通过 `mask` 更新这个 `bool` 数组对应十进制的 `bool` 值，并且记录剩余还缺几个二进制数。等剩余的等于 0 的时候，说明所有二进制字符串都出现了，直接输出 `true`，否则循环完以后输出 `false`。
+
+## 代码
+
+```go
+package leetcode
+
+import "math"
+
+func hasAllCodes(s string, k int) bool {
+ need := int(math.Pow(2.0, float64(k)))
+ visited, mask, curr := make([]bool, need), (1<<k)-1, 0
+ for i := 0; i < len(s); i++ {
+ curr = ((curr << 1) | int(s[i]-'0')) & mask
+ if i >= k-1 { // mask 有效位达到了 k 位
+ if !visited[curr] {
+ need--
+ visited[curr] = true
+ if need == 0 {
+ return true
+ }
+ }
+ }
+ }
+ return false
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1400~1499/1455.Check-If-a-Word-Occurs-As-a-Prefix-of-Any-Word-in-a-Sentence/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1400~1499/1463.Cherry-Pickup-II/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/1400~1499/1463.Cherry-Pickup-II.md b/website/content/ChapterFour/1400~1499/1463.Cherry-Pickup-II.md
new file mode 100644
index 000000000..bf04d0caf
--- /dev/null
+++ b/website/content/ChapterFour/1400~1499/1463.Cherry-Pickup-II.md
@@ -0,0 +1,156 @@
+# [1463. Cherry Pickup II](https://leetcode.com/problems/cherry-pickup-ii/)
+
+## 题目
+
+Given a `rows x cols` matrix `grid` representing a field of cherries. Each cell in `grid` represents the number of cherries that you can collect.
+
+You have two robots that can collect cherries for you, Robot #1 is located at the top-left corner (0,0) , and Robot #2 is located at the top-right corner (0, cols-1) of the grid.
+
+Return the maximum number of cherries collection using both robots by following the rules below:
+
+- From a cell (i,j), robots can move to cell (i+1, j-1) , (i+1, j) or (i+1, j+1).
+- When any robot is passing through a cell, It picks it up all cherries, and the cell becomes an empty cell (0).
+- When both robots stay on the same cell, only one of them takes the cherries.
+- Both robots cannot move outside of the grid at any moment.
+- Both robots should reach the bottom row in the `grid`.
+
+**Example 1:**
+
+
+
+```
+Input: grid = [[3,1,1],[2,5,1],[1,5,5],[2,1,1]]
+Output: 24
+Explanation: Path of robot #1 and #2 are described in color green and blue respectively.
+Cherries taken by Robot #1, (3 + 2 + 5 + 2) = 12.
+Cherries taken by Robot #2, (1 + 5 + 5 + 1) = 12.
+Total of cherries: 12 + 12 = 24.
+```
+
+**Example 2:**
+
+
+
+```
+Input: grid = [[1,0,0,0,0,0,1],[2,0,0,0,0,3,0],[2,0,9,0,0,0,0],[0,3,0,5,4,0,0],[1,0,2,3,0,0,6]]
+Output: 28
+Explanation: Path of robot #1 and #2 are described in color green and blue respectively.
+Cherries taken by Robot #1, (1 + 9 + 5 + 2) = 17.
+Cherries taken by Robot #2, (1 + 3 + 4 + 3) = 11.
+Total of cherries: 17 + 11 = 28.
+```
+
+**Example 3:**
+
+```
+Input: grid = [[1,0,0,3],[0,0,0,3],[0,0,3,3],[9,0,3,3]]
+Output: 22
+```
+
+**Example 4:**
+
+```
+Input: grid = [[1,1],[1,1]]
+Output: 4
+```
+
+**Constraints:**
+
+- `rows == grid.length`
+- `cols == grid[i].length`
+- `2 <= rows, cols <= 70`
+- `0 <= grid[i][j] <= 100`
+
+## 题目大意
+
+给你一个 rows x cols 的矩阵 grid 来表示一块樱桃地。 grid 中每个格子的数字表示你能获得的樱桃数目。你有两个机器人帮你收集樱桃，机器人 1 从左上角格子 (0,0) 出发，机器人 2 从右上角格子 (0, cols-1) 出发。请你按照如下规则，返回两个机器人能收集的最多樱桃数目：
+
+- 从格子 (i,j) 出发，机器人可以移动到格子 (i+1, j-1)，(i+1, j) 或者 (i+1, j+1) 。
+- 当一个机器人经过某个格子时，它会把该格子内所有的樱桃都摘走，然后这个位置会变成空格子，即没有樱桃的格子。
+- 当两个机器人同时到达同一个格子时，它们中只有一个可以摘到樱桃。
+- 两个机器人在任意时刻都不能移动到 grid 外面。
+- 两个机器人最后都要到达 grid 最底下一行。
+
+## 解题思路
+
+- 如果没有思路可以先用暴力解法 DFS 尝试。读完题可以分析出求最多樱桃数目，里面包含了很多重叠子问题，于是乎自然而然思路是用动态规划。数据规模上看，100 的数据规模最多能保证 O(n^3) 时间复杂度的算法不超时。
+- 这一题的变量有 2 个，一个是行号，另外一个是机器人所在的列。具体来说，机器人每走一步的移动范围只能往下走，不能往上走，所以 2 个机器人所在行号一定相同。两个机器人的列号不同。综上，变量有 3 个，1 个行号和2 个列号。定义 `dp[i][j][k]` 代表第一个机器人从 (0,0) 走到 (i,k) 坐标，第二个机器人从 (0,n-1) 走到 (i,k) 坐标，两者最多能收集樱桃的数目。状态转移方程为 ：
+
+ {{< katex display >}}
+ dp[i][j][k] = max \begin{pmatrix}\begin{array}{lr} dp[i-1][f(j_1))][f(j_2)] + grid[i][j_1] + grid[i][j_2], j_1\neq j_2 \\ dp[i-1][f(j_1))][f(j_2)] + grid[i][j_1], j_1 = j_2 \end{array} \end{pmatrix}
+ {{< /katex>}}
+
+ 其中：
+
+ {{< katex display >}}
+ \left\{\begin{matrix}f(j_1) \in [0,n), f(j_1) - j_1 \in [-1,0,1]\\ f(j_2) \in [0,n), f(j_2) - j_2 \in [-1,0,1]\end{matrix}\right.
+ {{< /katex>}}
+
+ 即状态转移过程中需要在 `[j1 - 1, j1, j1 + 1]` 中枚举 `j1`，同理，在 在 `[j2 - 1, j2, j2 + 1]` 中枚举 `j2`，每个状态转移需要枚举这 3*3 = 9 种状态。
+
+- 边界条件 `dp[i][0][n-1] = grid[0][0] + grid[0][n-1]`，最终答案存储在 `dp[m-1]` 行中，循环找出 `dp[m-1][j1][j2]` 中的最大值，到此该题得解。
+
+## 代码
+
+```go
+package leetcode
+
+func cherryPickup(grid [][]int) int {
+ rows, cols := len(grid), len(grid[0])
+ dp := make([][][]int, rows)
+ for i := 0; i < rows; i++ {
+ dp[i] = make([][]int, cols)
+ for j := 0; j < cols; j++ {
+ dp[i][j] = make([]int, cols)
+ }
+ }
+ for i := 0; i < rows; i++ {
+ for j := 0; j <= i && j < cols; j++ {
+ for k := cols - 1; k >= cols-1-i && k >= 0; k-- {
+ max := 0
+ for a := j - 1; a <= j+1; a++ {
+ for b := k - 1; b <= k+1; b++ {
+ sum := isInBoard(dp, i-1, a, b)
+ if a == b && i > 0 && a >= 0 && a < cols {
+ sum -= grid[i-1][a]
+ }
+ if sum > max {
+ max = sum
+ }
+ }
+ }
+ if j == k {
+ max += grid[i][j]
+ } else {
+ max += grid[i][j] + grid[i][k]
+ }
+ dp[i][j][k] = max
+ }
+ }
+ }
+ count := 0
+ for j := 0; j < cols && j < rows; j++ {
+ for k := cols - 1; k >= 0 && k >= cols-rows; k-- {
+ if dp[rows-1][j][k] > count {
+ count = dp[rows-1][j][k]
+ }
+ }
+ }
+ return count
+}
+
+func isInBoard(dp [][][]int, i, j, k int) int {
+ if i < 0 || j < 0 || j >= len(dp[0]) || k < 0 || k >= len(dp[0]) {
+ return 0
+ }
+ return dp[i][j][k]
+}
+```
+
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1400~1499/1461.Check-If-a-String-Contains-All-Binary-Codes-of-Size-K/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1400~1499/1464.Maximum-Product-of-Two-Elements-in-an-Array/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/1464.Maximum-Product-of-Two-Elements-in-an-Array.md b/website/content/ChapterFour/1400~1499/1464.Maximum-Product-of-Two-Elements-in-an-Array.md
similarity index 77%
rename from website/content/ChapterFour/1464.Maximum-Product-of-Two-Elements-in-an-Array.md
rename to website/content/ChapterFour/1400~1499/1464.Maximum-Product-of-Two-Elements-in-an-Array.md
index 04dbf134b..d318eb25b 100644
--- a/website/content/ChapterFour/1464.Maximum-Product-of-Two-Elements-in-an-Array.md
+++ b/website/content/ChapterFour/1400~1499/1464.Maximum-Product-of-Two-Elements-in-an-Array.md
@@ -63,4 +63,11 @@ func maxProduct(nums []int) int {
return (max1 - 1) * (max2 - 1)
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1400~1499/1463.Cherry-Pickup-II/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1400~1499/1465.Maximum-Area-of-a-Piece-of-Cake-After-Horizontal-and-Vertical-Cuts/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/1400~1499/1465.Maximum-Area-of-a-Piece-of-Cake-After-Horizontal-and-Vertical-Cuts.md b/website/content/ChapterFour/1400~1499/1465.Maximum-Area-of-a-Piece-of-Cake-After-Horizontal-and-Vertical-Cuts.md
new file mode 100644
index 000000000..9a4a4bf64
--- /dev/null
+++ b/website/content/ChapterFour/1400~1499/1465.Maximum-Area-of-a-Piece-of-Cake-After-Horizontal-and-Vertical-Cuts.md
@@ -0,0 +1,96 @@
+# [1465. Maximum Area of a Piece of Cake After Horizontal and Vertical Cuts](https://leetcode.com/problems/maximum-area-of-a-piece-of-cake-after-horizontal-and-vertical-cuts/)
+
+
+## 题目
+
+Given a rectangular cake with height `h` and width `w`, and two arrays of integers `horizontalCuts` and `verticalCuts` where `horizontalCuts[i]` is the distance from the top of the rectangular cake to the `ith` horizontal cut and similarly, `verticalCuts[j]` is the distance from the left of the rectangular cake to the `jth` vertical cut.
+
+*Return the maximum area of a piece of cake after you cut at each horizontal and vertical position provided in the arrays `horizontalCuts` and `verticalCuts`.* Since the answer can be a huge number, return this modulo 10^9 + 7.
+
+**Example 1:**
+
+
+
+```
+Input: h = 5, w = 4, horizontalCuts = [1,2,4], verticalCuts = [1,3]
+Output: 4
+Explanation: The figure above represents the given rectangular cake. Red lines are the horizontal and vertical cuts. After you cut the cake, the green piece of cake has the maximum area.
+
+```
+
+**Example 2:**
+
+
+
+```
+Input: h = 5, w = 4, horizontalCuts = [3,1], verticalCuts = [1]
+Output: 6
+Explanation: The figure above represents the given rectangular cake. Red lines are the horizontal and vertical cuts. After you cut the cake, the green and yellow pieces of cake have the maximum area.
+
+```
+
+**Example 3:**
+
+```
+Input: h = 5, w = 4, horizontalCuts = [3], verticalCuts = [3]
+Output: 9
+
+```
+
+**Constraints:**
+
+- `2 <= h, w <= 10^9`
+- `1 <= horizontalCuts.length < min(h, 10^5)`
+- `1 <= verticalCuts.length < min(w, 10^5)`
+- `1 <= horizontalCuts[i] < h`
+- `1 <= verticalCuts[i] < w`
+- It is guaranteed that all elements in `horizontalCuts` are distinct.
+- It is guaranteed that all elements in `verticalCuts` are distinct.
+
+## 题目大意
+
+矩形蛋糕的高度为 h 且宽度为 w，给你两个整数数组 horizontalCuts 和 verticalCuts，其中 horizontalCuts[i] 是从矩形蛋糕顶部到第 i 个水平切口的距离，类似地， verticalCuts[j] 是从矩形蛋糕的左侧到第 j 个竖直切口的距离。请你按数组 horizontalCuts 和 verticalCuts 中提供的水平和竖直位置切割后，请你找出 面积最大 的那份蛋糕，并返回其 面积 。由于答案可能是一个很大的数字，因此需要将结果对 10^9 + 7 取余后返回。
+
+## 解题思路
+
+- 读完题比较容易想到解题思路。找到水平切口最大的差值和竖直切口最大的差值，这 4 条边构成的矩形即为最大矩形。不过有特殊情况需要判断，切口除了题目给的切口坐标以外，默认还有 4 个切口，即蛋糕原始的 4 条边。如下图二，最大的矩形其实在切口之外。所以找水平切口最大差值和竖直切口最大差值需要考虑到蛋糕原始的 4 条边。
+
+
+
+## 代码
+
+```go
+package leetcode
+
+import "sort"
+
+func maxArea(h int, w int, hcuts []int, vcuts []int) int {
+ sort.Ints(hcuts)
+ sort.Ints(vcuts)
+ maxw, maxl := hcuts[0], vcuts[0]
+ for i, c := range hcuts[1:] {
+ if c-hcuts[i] > maxw {
+ maxw = c - hcuts[i]
+ }
+ }
+ if h-hcuts[len(hcuts)-1] > maxw {
+ maxw = h - hcuts[len(hcuts)-1]
+ }
+ for i, c := range vcuts[1:] {
+ if c-vcuts[i] > maxl {
+ maxl = c - vcuts[i]
+ }
+ }
+ if w-vcuts[len(vcuts)-1] > maxl {
+ maxl = w - vcuts[len(vcuts)-1]
+ }
+ return (maxw * maxl) % (1000000007)
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1400~1499/1464.Maximum-Product-of-Two-Elements-in-an-Array/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1400~1499/1470.Shuffle-the-Array/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/1400~1499/1470.Shuffle-the-Array.md b/website/content/ChapterFour/1400~1499/1470.Shuffle-the-Array.md
new file mode 100644
index 000000000..fc653d637
--- /dev/null
+++ b/website/content/ChapterFour/1400~1499/1470.Shuffle-the-Array.md
@@ -0,0 +1,71 @@
+# [1470. Shuffle the Array](https://leetcode.com/problems/shuffle-the-array/)
+
+## 题目
+
+Given the array `nums` consisting of `2n` elements in the form `[x1,x2,...,xn,y1,y2,...,yn]`.
+
+*Return the array in the form* `[x1,y1,x2,y2,...,xn,yn]`.
+
+**Example 1**:
+
+```
+Input: nums = [2,5,1,3,4,7], n = 3
+Output: [2,3,5,4,1,7]
+Explanation: Since x1=2, x2=5, x3=1, y1=3, y2=4, y3=7 then the answer is [2,3,5,4,1,7].
+
+```
+
+**Example 2**:
+
+```
+Input: nums = [1,2,3,4,4,3,2,1], n = 4
+Output: [1,4,2,3,3,2,4,1]
+
+```
+
+**Example 3**:
+
+```
+Input: nums = [1,1,2,2], n = 2
+Output: [1,2,1,2]
+
+```
+
+**Constraints**:
+
+- `1 <= n <= 500`
+- `nums.length == 2n`
+- `1 <= nums[i] <= 10^3`
+
+## 题目大意
+
+给你一个数组 nums ，数组中有 2n 个元素，按 [x1,x2,...,xn,y1,y2,...,yn] 的格式排列。请你将数组按 [x1,y1,x2,y2,...,xn,yn] 格式重新排列，返回重排后的数组。
+
+## 解题思路
+
+- 给定一个 2n 的数组，把后 n 个元素插空放到前 n 个元素里面。输出最终完成的数组。
+- 简单题，按照题意插空即可。
+
+## 代码
+
+```go
+
+package leetcode
+
+func shuffle(nums []int, n int) []int {
+ result := make([]int, 0)
+ for i := 0; i < n; i++ {
+ result = append(result, nums[i])
+ result = append(result, nums[n+i])
+ }
+ return result
+}
+
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1400~1499/1465.Maximum-Area-of-a-Piece-of-Cake-After-Horizontal-and-Vertical-Cuts/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1400~1499/1480.Running-Sum-of-1d-Array/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/1400~1499/1480.Running-Sum-of-1d-Array.md b/website/content/ChapterFour/1400~1499/1480.Running-Sum-of-1d-Array.md
new file mode 100644
index 000000000..6398e56a0
--- /dev/null
+++ b/website/content/ChapterFour/1400~1499/1480.Running-Sum-of-1d-Array.md
@@ -0,0 +1,71 @@
+# [1480. Running Sum of 1d Array](https://leetcode.com/problems/running-sum-of-1d-array/)
+
+## 题目
+
+Given an array `nums`. We define a running sum of an array as `runningSum[i] = sum(nums[0]…nums[i])`.
+
+Return the running sum of `nums`.
+
+**Example 1**:
+
+```
+Input: nums = [1,2,3,4]
+Output: [1,3,6,10]
+Explanation: Running sum is obtained as follows: [1, 1+2, 1+2+3, 1+2+3+4].
+
+```
+
+**Example 2**:
+
+```
+Input: nums = [1,1,1,1,1]
+Output: [1,2,3,4,5]
+Explanation: Running sum is obtained as follows: [1, 1+1, 1+1+1, 1+1+1+1, 1+1+1+1+1].
+
+```
+
+**Example 3**:
+
+```
+Input: nums = [3,1,2,10,1]
+Output: [3,4,6,16,17]
+
+```
+
+
+**Constraints**:
+
+- `1 <= nums.length <= 1000`
+- `-10^6 <= nums[i] <= 10^6`
+
+## 题目大意
+
+给你一个数组 nums 。数组「动态和」的计算公式为：runningSum[i] = sum(nums[0]…nums[i]) 。请返回 nums 的动态和。
+
+
+## 解题思路
+
+- 简单题，按照题意依次循环计算前缀和即可。
+
+## 代码
+
+```go
+package leetcode
+
+func runningSum(nums []int) []int {
+ dp := make([]int, len(nums)+1)
+ dp[0] = 0
+ for i := 1; i <= len(nums); i++ {
+ dp[i] = dp[i-1] + nums[i-1]
+ }
+ return dp[1:]
+}
+
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1400~1499/1470.Shuffle-the-Array/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1400~1499/1482.Minimum-Number-of-Days-to-Make-m-Bouquets/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/1400~1499/1482.Minimum-Number-of-Days-to-Make-m-Bouquets.md b/website/content/ChapterFour/1400~1499/1482.Minimum-Number-of-Days-to-Make-m-Bouquets.md
new file mode 100644
index 000000000..92c3ba07c
--- /dev/null
+++ b/website/content/ChapterFour/1400~1499/1482.Minimum-Number-of-Days-to-Make-m-Bouquets.md
@@ -0,0 +1,117 @@
+# [1482. Minimum Number of Days to Make m Bouquets](https://leetcode.com/problems/minimum-number-of-days-to-make-m-bouquets/)
+
+## 题目
+
+Given an integer array `bloomDay`, an integer `m` and an integer `k`.
+
+We need to make `m` bouquets. To make a bouquet, you need to use `k` **adjacent flowers** from the garden.
+
+The garden consists of `n` flowers, the `ith` flower will bloom in the `bloomDay[i]` and then can be used in **exactly one** bouquet.
+
+Return *the minimum number of days* you need to wait to be able to make `m` bouquets from the garden. If it is impossible to make `m` bouquets return **-1**.
+
+**Example 1:**
+
+```
+Input: bloomDay = [1,10,3,10,2], m = 3, k = 1
+Output: 3
+Explanation: Let's see what happened in the first three days. x means flower bloomed and _ means flower didn't bloom in the garden.
+We need 3 bouquets each should contain 1 flower.
+After day 1: [x, _, _, _, _] // we can only make one bouquet.
+After day 2: [x, _, _, _, x] // we can only make two bouquets.
+After day 3: [x, _, x, _, x] // we can make 3 bouquets. The answer is 3.
+```
+
+**Example 2:**
+
+```
+Input: bloomDay = [1,10,3,10,2], m = 3, k = 2
+Output: -1
+Explanation: We need 3 bouquets each has 2 flowers, that means we need 6 flowers. We only have 5 flowers so it is impossible to get the needed bouquets and we return -1.
+```
+
+**Example 3:**
+
+```
+Input: bloomDay = [7,7,7,7,12,7,7], m = 2, k = 3
+Output: 12
+Explanation: We need 2 bouquets each should have 3 flowers.
+Here's the garden after the 7 and 12 days:
+After day 7: [x, x, x, x, _, x, x]
+We can make one bouquet of the first three flowers that bloomed. We cannot make another bouquet from the last three flowers that bloomed because they are not adjacent.
+After day 12: [x, x, x, x, x, x, x]
+It is obvious that we can make two bouquets in different ways.
+```
+
+**Example 4:**
+
+```
+Input: bloomDay = [1000000000,1000000000], m = 1, k = 1
+Output: 1000000000
+Explanation: You need to wait 1000000000 days to have a flower ready for a bouquet.
+```
+
+**Example 5:**
+
+```
+Input: bloomDay = [1,10,2,9,3,8,4,7,5,6], m = 4, k = 2
+Output: 9
+```
+
+**Constraints:**
+
+- `bloomDay.length == n`
+- `1 <= n <= 10^5`
+- `1 <= bloomDay[i] <= 10^9`
+- `1 <= m <= 10^6`
+- `1 <= k <= n`
+
+## 题目大意
+
+给你一个整数数组 bloomDay，以及两个整数 m 和 k 。现需要制作 m 束花。制作花束时，需要使用花园中 相邻的 k 朵花 。花园中有 n 朵花，第 i 朵花会在 bloomDay[i] 时盛开，恰好 可以用于 一束 花中。请你返回从花园中摘 m 束花需要等待的最少的天数。如果不能摘到 m 束花则返回 -1 。
+
+## 解题思路
+
+- 本题是二分搜索提醒。题目解空间固定，答案区间一定在 [0, maxDay] 中。这是单调增且有序区间，所以可以在这个解空间内使用二分搜索。在区间 [0, maxDay] 中找到第一个能满足 m 束花的解。二分搜索判断是否为 true 的条件为：从左往右遍历数组，依次统计当前日期下，花是否开了，如果连续开花 k 朵，便为 1 束，数组遍历结束如果花束总数 ≥ k 即为答案。二分搜索会返回最小的下标，即对应满足题意的最少天数。
+
+## 代码
+
+```go
+package leetcode
+
+import "sort"
+
+func minDays(bloomDay []int, m int, k int) int {
+ if m*k > len(bloomDay) {
+ return -1
+ }
+ maxDay := 0
+ for _, day := range bloomDay {
+ if day > maxDay {
+ maxDay = day
+ }
+ }
+ return sort.Search(maxDay, func(days int) bool {
+ flowers, bouquets := 0, 0
+ for _, d := range bloomDay {
+ if d > days {
+ flowers = 0
+ } else {
+ flowers++
+ if flowers == k {
+ bouquets++
+ flowers = 0
+ }
+ }
+ }
+ return bouquets >= m
+ })
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1400~1499/1480.Running-Sum-of-1d-Array/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1400~1499/1486.XOR-Operation-in-an-Array/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/1400~1499/1486.XOR-Operation-in-an-Array.md b/website/content/ChapterFour/1400~1499/1486.XOR-Operation-in-an-Array.md
new file mode 100644
index 000000000..5536755fb
--- /dev/null
+++ b/website/content/ChapterFour/1400~1499/1486.XOR-Operation-in-an-Array.md
@@ -0,0 +1,76 @@
+# [1486. XOR Operation in an Array](https://leetcode.com/problems/xor-operation-in-an-array/)
+
+
+## 题目
+
+Given an integer `n` and an integer `start`.
+
+Define an array `nums` where `nums[i] = start + 2*i` (0-indexed) and `n == nums.length`.
+
+Return the bitwise XOR of all elements of `nums`.
+
+**Example 1:**
+
+```
+Input: n = 5, start = 0
+Output: 8
+Explanation:Array nums is equal to [0, 2, 4, 6, 8] where (0 ^ 2 ^ 4 ^ 6 ^ 8) = 8.
+Where "^" corresponds to bitwise XOR operator.
+```
+
+**Example 2:**
+
+```
+Input: n = 4, start = 3
+Output: 8
+Explanation:Array nums is equal to [3, 5, 7, 9] where (3 ^ 5 ^ 7 ^ 9) = 8.
+```
+
+**Example 3:**
+
+```
+Input: n = 1, start = 7
+Output: 7
+```
+
+**Example 4:**
+
+```
+Input: n = 10, start = 5
+Output: 2
+```
+
+**Constraints:**
+
+- `1 <= n <= 1000`
+- `0 <= start <= 1000`
+- `n == nums.length`
+
+## 题目大意
+
+给你两个整数，n 和 start 。数组 nums 定义为：nums[i] = start + 2*i（下标从 0 开始）且 n == nums.length 。请返回 nums 中所有元素按位异或（XOR）后得到的结果。
+
+## 解题思路
+
+- 简单题。按照题意，一层循环依次累积异或数组中每个元素。
+
+## 代码
+
+```go
+package leetcode
+
+func xorOperation(n int, start int) int {
+ res := 0
+ for i := 0; i < n; i++ {
+ res ^= start + 2*i
+ }
+ return res
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1400~1499/1482.Minimum-Number-of-Days-to-Make-m-Bouquets/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1500~1599/1512.Number-of-Good-Pairs/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/1400~1499/_index.md b/website/content/ChapterFour/1400~1499/_index.md
new file mode 100644
index 000000000..d2021683f
--- /dev/null
+++ b/website/content/ChapterFour/1400~1499/_index.md
@@ -0,0 +1,5 @@
+---
+bookCollapseSection: true
+weight: 20
+---
+
diff --git a/website/content/ChapterFour/1470.Shuffle-the-Array.md b/website/content/ChapterFour/1470.Shuffle-the-Array.md
deleted file mode 100644
index 961d200c4..000000000
--- a/website/content/ChapterFour/1470.Shuffle-the-Array.md
+++ /dev/null
@@ -1,64 +0,0 @@
-# [1470. Shuffle the Array](https://leetcode.com/problems/shuffle-the-array/)
-
-## 题目
-
-Given the array `nums` consisting of `2n` elements in the form `[x1,x2,...,xn,y1,y2,...,yn]`.
-
-*Return the array in the form* `[x1,y1,x2,y2,...,xn,yn]`.
-
-**Example 1**:
-
-```
-Input: nums = [2,5,1,3,4,7], n = 3
-Output: [2,3,5,4,1,7]
-Explanation: Since x1=2, x2=5, x3=1, y1=3, y2=4, y3=7 then the answer is [2,3,5,4,1,7].
-
-```
-
-**Example 2**:
-
-```
-Input: nums = [1,2,3,4,4,3,2,1], n = 4
-Output: [1,4,2,3,3,2,4,1]
-
-```
-
-**Example 3**:
-
-```
-Input: nums = [1,1,2,2], n = 2
-Output: [1,2,1,2]
-
-```
-
-**Constraints**:
-
-- `1 <= n <= 500`
-- `nums.length == 2n`
-- `1 <= nums[i] <= 10^3`
-
-## 题目大意
-
-给你一个数组 nums ，数组中有 2n 个元素，按 [x1,x2,...,xn,y1,y2,...,yn] 的格式排列。请你将数组按 [x1,y1,x2,y2,...,xn,yn] 格式重新排列，返回重排后的数组。
-
-## 解题思路
-
-- 给定一个 2n 的数组，把后 n 个元素插空放到前 n 个元素里面。输出最终完成的数组。
-- 简单题，按照题意插空即可。
-
-## 代码
-
-```go
-
-package leetcode
-
-func shuffle(nums []int, n int) []int {
- result := make([]int, 0)
- for i := 0; i < n; i++ {
- result = append(result, nums[i])
- result = append(result, nums[n+i])
- }
- return result
-}
-
-```
\ No newline at end of file
diff --git a/website/content/ChapterFour/1500~1599/1512.Number-of-Good-Pairs.md b/website/content/ChapterFour/1500~1599/1512.Number-of-Good-Pairs.md
new file mode 100644
index 000000000..009b74b35
--- /dev/null
+++ b/website/content/ChapterFour/1500~1599/1512.Number-of-Good-Pairs.md
@@ -0,0 +1,74 @@
+# [1512. Number of Good Pairs](https://leetcode.com/problems/number-of-good-pairs/)
+
+## 题目
+
+Given an array of integers `nums`.
+
+A pair `(i,j)` is called good if `nums[i] == nums[j]` and `i < j`.
+
+Return the number of good pairs.
+
+**Example 1**:
+
+```
+Input: nums = [1,2,3,1,1,3]
+Output: 4
+Explanation: There are 4 good pairs (0,3), (0,4), (3,4), (2,5) 0-indexed.
+
+```
+
+**Example 2**:
+
+```
+Input: nums = [1,1,1,1]
+Output: 6
+Explanation: Each pair in the array are good.
+
+```
+
+**Example 3**:
+
+```
+Input: nums = [1,2,3]
+Output: 0
+
+```
+
+**Constraints**:
+
+- `1 <= nums.length <= 1000`
+- `1 <= nums[i] <= 100`
+
+## 题目大意
+
+给你一个整数数组 nums。如果一组数字 (i,j) 满足 nums[i] == nums[j] 且 i < j ，就可以认为这是一组好数对。返回好数对的数目。
+
+## 解题思路
+
+- 简单题，按照题目中好数对的定义，循环遍历判断两数是否相等，累加计数即可。
+
+## 代码
+
+```go
+package leetcode
+
+func numIdenticalPairs(nums []int) int {
+ total := 0
+ for x := 0; x < len(nums); x++ {
+ for y := x + 1; y < len(nums); y++ {
+ if nums[x] == nums[y] {
+ total++
+ }
+ }
+ }
+ return total
+}
+
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1400~1499/1486.XOR-Operation-in-an-Array/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1500~1599/1518.Water-Bottles/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/1500~1599/1518.Water-Bottles.md b/website/content/ChapterFour/1500~1599/1518.Water-Bottles.md
new file mode 100644
index 000000000..e7817708c
--- /dev/null
+++ b/website/content/ChapterFour/1500~1599/1518.Water-Bottles.md
@@ -0,0 +1,81 @@
+# [1518. Water Bottles](https://leetcode.com/problems/water-bottles/)
+
+## 题目
+
+Given numBottles full water bottles, you can exchange numExchange empty water bottles for one full water bottle.
+
+The operation of drinking a full water bottle turns it into an empty bottle.
+
+Return the maximum number of water bottles you can drink.
+
+**Example 1**:
+
+
+
+ Input: numBottles = 9, numExchange = 3
+ Output: 13
+ Explanation: You can exchange 3 empty bottles to get 1 full water bottle.
+ Number of water bottles you can drink: 9 + 3 + 1 = 13.
+
+**Example 2**:
+
+
+
+ Input: numBottles = 15, numExchange = 4
+ Output: 19
+ Explanation: You can exchange 4 empty bottles to get 1 full water bottle.
+ Number of water bottles you can drink: 15 + 3 + 1 = 19.
+
+**Example 3**:
+
+ Input: numBottles = 5, numExchange = 5
+ Output: 6
+
+**Example 4**:
+
+ Input: numBottles = 2, numExchange = 3
+ Output: 2
+
+**Constraints:**
+
+- 1 <= numBottles <= 100
+- 2 <= numExchange <= 100
+
+## 题目大意
+
+小区便利店正在促销，用 numExchange 个空酒瓶可以兑换一瓶新酒。你购入了 numBottles 瓶酒。
+
+如果喝掉了酒瓶中的酒，那么酒瓶就会变成空的。
+
+请你计算 最多 能喝到多少瓶酒。
+
+## 解题思路
+
+- 模拟。首先我们一定可以喝到 numBottles 瓶酒，剩下 numBottles 个空瓶。接下来我们可以拿空瓶子换酒，每次拿出 numExchange 个瓶子换一瓶酒，然后再喝完这瓶酒，得到一个空瓶。这样模拟下去，直到所有的空瓶子小于numExchange结束。
+
+## 代码
+
+```go
+package leetcode
+
+func numWaterBottles(numBottles int, numExchange int) int {
+ if numBottles < numExchange {
+ return numBottles
+ }
+ quotient := numBottles / numExchange
+ reminder := numBottles % numExchange
+ ans := numBottles + quotient
+ for quotient+reminder >= numExchange {
+ quotient, reminder = (quotient+reminder)/numExchange, (quotient+reminder)%numExchange
+ ans += quotient
+ }
+ return ans
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1500~1599/1512.Number-of-Good-Pairs/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1500~1599/1539.Kth-Missing-Positive-Number/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/1500~1599/1539.Kth-Missing-Positive-Number.md b/website/content/ChapterFour/1500~1599/1539.Kth-Missing-Positive-Number.md
new file mode 100644
index 000000000..c22e07e0c
--- /dev/null
+++ b/website/content/ChapterFour/1500~1599/1539.Kth-Missing-Positive-Number.md
@@ -0,0 +1,70 @@
+# [1539. Kth Missing Positive Number](https://leetcode.com/problems/kth-missing-positive-number/)
+
+## 题目
+
+Given an array `arr` of positive integers sorted in a **strictly increasing order**, and an integer `k`.
+
+*Find the* `kth` *positive integer that is missing from this array.*
+
+**Example 1**:
+
+```
+Input: arr = [2,3,4,7,11], k = 5
+Output: 9
+Explanation: The missing positive integers are [1,5,6,8,9,10,12,13,...]. The 5th missing positive integer is 9.
+```
+
+**Example 2**:
+
+```
+Input: arr = [1,2,3,4], k = 2
+Output: 6
+Explanation: The missing positive integers are [5,6,7,...]. The 2nd missing positive integer is 6.
+```
+
+**Constraints**:
+
+- `1 <= arr.length <= 1000`
+- `1 <= arr[i] <= 1000`
+- `1 <= k <= 1000`
+- `arr[i] < arr[j]` for `1 <= i < j <= arr.length`
+
+## 题目大意
+
+给你一个 **严格升序排列** 的正整数数组 `arr` 和一个整数 `k` 。请你找到这个数组里第 `k` 个缺失的正整数。
+
+## 解题思路
+
+- 简单题。用一个变量从 1 开始累加，依次比对数组中是否存在，不存在的话就把 k - -，直到 k 为 0 的时候即是要输出的值。特殊情况，missing positive 都在数组之外，如例子 2 。
+
+## 代码
+
+```go
+package leetcode
+
+func findKthPositive(arr []int, k int) int {
+ positive, index := 1, 0
+ for index < len(arr) {
+ if arr[index] != positive {
+ k--
+ } else {
+ index++
+ }
+ if k == 0 {
+ break
+ }
+ positive++
+ }
+ if k != 0 {
+ positive += k - 1
+ }
+ return positive
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1500~1599/1518.Water-Bottles/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1500~1599/1551.Minimum-Operations-to-Make-Array-Equal/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/1500~1599/1551.Minimum-Operations-to-Make-Array-Equal.md b/website/content/ChapterFour/1500~1599/1551.Minimum-Operations-to-Make-Array-Equal.md
new file mode 100644
index 000000000..74ef1db9e
--- /dev/null
+++ b/website/content/ChapterFour/1500~1599/1551.Minimum-Operations-to-Make-Array-Equal.md
@@ -0,0 +1,69 @@
+# [1551. Minimum Operations to Make Array Equal](https://leetcode.com/problems/minimum-operations-to-make-array-equal/)
+
+
+## 题目
+
+You have an array `arr` of length `n` where `arr[i] = (2 * i) + 1` for all valid values of `i` (i.e. `0 <= i < n`).
+
+In one operation, you can select two indices `x` and `y` where `0 <= x, y < n` and subtract `1` from `arr[x]` and add `1` to `arr[y]` (i.e. perform `arr[x] -=1` and `arr[y] += 1`). The goal is to make all the elements of the array **equal**. It is **guaranteed** that all the elements of the array can be made equal using some operations.
+
+Given an integer `n`, the length of the array. Return *the minimum number of operations* needed to make all the elements of arr equal.
+
+**Example 1:**
+
+```
+Input: n = 3
+Output: 2
+Explanation: arr = [1, 3, 5]
+First operation choose x = 2 and y = 0, this leads arr to be [2, 3, 4]
+In the second operation choose x = 2 and y = 0 again, thus arr = [3, 3, 3].
+```
+
+**Example 2:**
+
+```
+Input: n = 6
+Output: 9
+```
+
+**Constraints:**
+
+- `1 <= n <= 10^4`
+
+## 题目大意
+
+存在一个长度为 n 的数组 arr ，其中 arr[i] = (2 * i) + 1 （ 0 <= i < n ）。一次操作中，你可以选出两个下标，记作 x 和 y （ 0 <= x, y < n ）并使 arr[x] 减去 1 、arr[y] 加上 1 （即 arr[x] -=1 且 arr[y] += 1 ）。最终的目标是使数组中的所有元素都 相等 。题目测试用例将会 保证 ：在执行若干步操作后，数组中的所有元素最终可以全部相等。给你一个整数 n，即数组的长度。请你返回使数组 arr 中所有元素相等所需的 最小操作数 。
+
+## 解题思路
+
+- 这一题是数学题。题目给定的操作并不会使数组中所有元素之和变化，最终让所有元素相等，那么数组中所有元素的平均值即为最后数组中每一个元素的值。最少操作数的策略应该是以平均数为中心，中心右边的数减小，对称的中心左边的数增大。由于原数组是等差数列，两两元素之间相差 2，利用数学方法可以算出操作数。
+- 数组长度分为奇数和偶数分别讨论。如果数组长度为奇数，所需要的操作数是：
+
+ {{< katex display >}}
+ \begin{aligned} &\quad 2 + 4 + \cdots + 2\cdot\left\lfloor\frac{n}{2}\right\rfloor \\ &= \frac{1}{2}\left\lfloor\frac{n}{2}\right\rfloor\left(2\cdot\left\lfloor\frac{n}{2}\right\rfloor + 2\right) \\ &= \left\lfloor\frac{n}{2}\right\rfloor \left(\left\lfloor\frac{n}{2}\right\rfloor + 1\right) \\ &= \frac{n-1}{2}\left(\frac{n-1}{2} + 1\right) \\ &= \frac{n-1}{2}\cdot\frac{n+1}{2} \\ &= \frac{n^2-1}{4} \\ &= \left\lfloor\frac{n^2}{4}\right\rfloor \end{aligned}
+ {{< /katex >}}
+
+ 数组长度是偶数，所需要的操作数是：
+
+ {{< katex display >}}
+ \begin{aligned} &\quad 1 + 3 + \cdots + \left(2\cdot\left\lfloor\frac{n}{2}\right\rfloor - 1\right) \\ &= \frac{1}{2}\left\lfloor\frac{n}{2}\right\rfloor\left(2\cdot\left\lfloor\frac{n}{2}\right\rfloor - 1 + 1\right)\\ &= \left(\left\lfloor\frac{n}{2}\right\rfloor\right)^2 \\ &= \frac{n^2}{4} \end{aligned}
+ {{< /katex >}}
+
+ 综上所述，最小操作数是 n^2/4
+
+## 代码
+
+```go
+package leetcode
+
+func minOperations(n int) int {
+ return n * n / 4
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1500~1599/1539.Kth-Missing-Positive-Number/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1500~1599/1572.Matrix-Diagonal-Sum/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/1500~1599/1572.Matrix-Diagonal-Sum.md b/website/content/ChapterFour/1500~1599/1572.Matrix-Diagonal-Sum.md
new file mode 100644
index 000000000..c0fe7ee41
--- /dev/null
+++ b/website/content/ChapterFour/1500~1599/1572.Matrix-Diagonal-Sum.md
@@ -0,0 +1,84 @@
+# [1572. Matrix Diagonal Sum](https://leetcode.com/problems/matrix-diagonal-sum/)
+
+
+## 题目
+
+Given a square matrix `mat`, return the sum of the matrix diagonals.
+
+Only include the sum of all the elements on the primary diagonal and all the elements on the secondary diagonal that are not part of the primary diagonal.
+
+**Example 1:**
+
+
+
+```
+Input: mat = [[1,2,3],
+ [4,5,6],
+ [7,8,9]]
+Output: 25
+Explanation:Diagonals sum: 1 + 5 + 9 + 3 + 7 = 25
+Notice that element mat[1][1] = 5 is counted only once.
+
+```
+
+**Example 2:**
+
+```
+Input: mat = [[1,1,1,1],
+ [1,1,1,1],
+ [1,1,1,1],
+ [1,1,1,1]]
+Output: 8
+
+```
+
+**Example 3:**
+
+```
+Input: mat = [[5]]
+Output: 5
+
+```
+
+**Constraints:**
+
+- `n == mat.length == mat[i].length`
+- `1 <= n <= 100`
+- `1 <= mat[i][j] <= 100`
+
+## 题目大意
+
+给你一个正方形矩阵 mat，请你返回矩阵对角线元素的和。请你返回在矩阵主对角线上的元素和副对角线上且不在主对角线上元素的和。
+
+## 解题思路
+
+- 简单题。根据题意，把主对角线和副对角线上的元素相加。
+- 如果正方形矩阵的长度 n 为奇数，相加的结果需要减去 mat[n/2][n/2]。
+
+## 代码
+
+```go
+package leetcode
+
+func diagonalSum(mat [][]int) int {
+ n := len(mat)
+ ans := 0
+ for pi := 0; pi < n; pi++ {
+ ans += mat[pi][pi]
+ }
+ for si, sj := n-1, 0; sj < n; si, sj = si-1, sj+1 {
+ ans += mat[si][sj]
+ }
+ if n%2 == 0 {
+ return ans
+ }
+ return ans - mat[n/2][n/2]
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1500~1599/1551.Minimum-Operations-to-Make-Array-Equal/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1500~1599/1573.Number-of-Ways-to-Split-a-String/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/1500~1599/1573.Number-of-Ways-to-Split-a-String.md b/website/content/ChapterFour/1500~1599/1573.Number-of-Ways-to-Split-a-String.md
new file mode 100644
index 000000000..916d942a9
--- /dev/null
+++ b/website/content/ChapterFour/1500~1599/1573.Number-of-Ways-to-Split-a-String.md
@@ -0,0 +1,115 @@
+# [1573. Number of Ways to Split a String](https://leetcode.com/problems/number-of-ways-to-split-a-string/)
+
+
+## 题目
+
+Given a binary string `s` (a string consisting only of '0's and '1's), we can split `s` into 3 **non-empty** strings s1, s2, s3 (s1+ s2+ s3 = s).
+
+Return the number of ways `s` can be split such that the number of characters '1' is the same in s1, s2, and s3.
+
+Since the answer may be too large, return it modulo 10^9 + 7.
+
+**Example 1**:
+
+```
+Input: s = "10101"
+Output: 4
+Explanation: There are four ways to split s in 3 parts where each part contain the same number of letters '1'.
+"1|010|1"
+"1|01|01"
+"10|10|1"
+"10|1|01"
+
+```
+
+**Example 2**:
+
+```
+Input: s = "1001"
+Output: 0
+
+```
+
+**Example 3**:
+
+```
+Input: s = "0000"
+Output: 3
+Explanation: There are three ways to split s in 3 parts.
+"0|0|00"
+"0|00|0"
+"00|0|0"
+
+```
+
+**Example 4**:
+
+```
+Input: s = "100100010100110"
+Output: 12
+
+```
+
+**Constraints**:
+
+- `3 <= s.length <= 10^5`
+- `s[i]` is `'0'` or `'1'`.
+
+## 题目大意
+
+给你一个二进制串 s （一个只包含 0 和 1 的字符串），我们可以将 s 分割成 3 个 非空 字符串 s1, s2, s3 （s1 + s2 + s3 = s）。请你返回分割 s 的方案数，满足 s1，s2 和 s3 中字符 '1' 的数目相同。由于答案可能很大，请将它对 10^9 + 7 取余后返回。
+
+## 解题思路
+
+- 这一题是考察的排列组合的知识。根据题意，如果 1 的个数不是 3 的倍数，直接返回 -1。如果字符串里面没有 1，那么切分的方案就是组合，在 n-1 个字母里面选出 2 个位置。利用组合的计算方法，组合数是 (n-1) * (n-2) / 2 。
+- 剩下的是 3 的倍数的情况。在字符串中选 2 个位置隔成 3 段。从第一段最后一个 1 到第二段第一个 1 之间的 0 的个数为 m1，从第二段最后一个 1 到第三段第一个 1 之间的 0 的个数为 m2。利用乘法原理，方案数为 m1 * m2。
+
+## 代码
+
+```go
+package leetcode
+
+func numWays(s string) int {
+ ones := 0
+ for _, c := range s {
+ if c == '1' {
+ ones++
+ }
+ }
+ if ones%3 != 0 {
+ return 0
+ }
+ if ones == 0 {
+ return (len(s) - 1) * (len(s) - 2) / 2 % 1000000007
+ }
+ N, a, b, c, d, count := ones/3, 0, 0, 0, 0, 0
+ for i, letter := range s {
+ if letter == '0' {
+ continue
+ }
+ if letter == '1' {
+ count++
+ }
+ if count == N {
+ a = i
+ }
+ if count == N+1 {
+ b = i
+ }
+ if count == 2*N {
+ c = i
+ }
+ if count == 2*N+1 {
+ d = i
+ }
+ }
+ return (b - a) * (d - c) % 1000000007
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1500~1599/1572.Matrix-Diagonal-Sum/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1500~1599/1576.Replace-All-s-to-Avoid-Consecutive-Repeating-Characters/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/1500~1599/1576.Replace-All-s-to-Avoid-Consecutive-Repeating-Characters.md b/website/content/ChapterFour/1500~1599/1576.Replace-All-s-to-Avoid-Consecutive-Repeating-Characters.md
new file mode 100644
index 000000000..7d57d2b0a
--- /dev/null
+++ b/website/content/ChapterFour/1500~1599/1576.Replace-All-s-to-Avoid-Consecutive-Repeating-Characters.md
@@ -0,0 +1,70 @@
+# [1576. Replace All ?'s to Avoid Consecutive Repeating Characters](https://leetcode.com/problems/replace-all-s-to-avoid-consecutive-repeating-characters/)
+
+## 题目
+
+Given a string `s` containing only lowercase English letters and the `'?'` character, convert **all** the `'?'` characters into lowercase letters such that the final string does not contain any **consecutive repeating** characters. You **cannot** modify the non `'?'` characters.
+
+It is **guaranteed** that there are no consecutive repeating characters in the given string **except** for `'?'`.
+
+Return *the final string after all the conversions (possibly zero) have been made*. If there is more than one solution, return **any of them**. It can be shown that an answer is always possible with the given constraints.
+
+**Example 1:**
+
+```
+Input: s = "?zs"
+Output: "azs"
+Explanation: There are 25 solutions for this problem. From "azs" to "yzs", all are valid. Only "z" is an invalid modification as the string will consist of consecutive repeating characters in "zzs".
+
+```
+
+**Example 2:**
+
+```
+Input: s = "ubv?w"
+Output: "ubvaw"
+Explanation: There are 24 solutions for this problem. Only "v" and "w" are invalid modifications as the strings will consist of consecutive repeating characters in "ubvvw" and "ubvww".
+
+```
+
+**Constraints:**
+
+- `1 <= s.length <= 100`
+- `s` consist of lowercase English letters and `'?'`.
+
+## 题目大意
+
+给你一个仅包含小写英文字母和 '?' 字符的字符串 s，请你将所有的 '?' 转换为若干小写字母，使最终的字符串不包含任何 连续重复 的字符。注意：你 不能 修改非 '?' 字符。
+
+题目测试用例保证 除 '?' 字符 之外，不存在连续重复的字符。在完成所有转换（可能无需转换）后返回最终的字符串。如果有多个解决方案，请返回其中任何一个。可以证明，在给定的约束条件下，答案总是存在的。
+
+## 解题思路
+
+- 简单题。找到源字符串中 ‘?’ 字符的位置，然后依次用 a ~ z 字符去替换，替换进去的字符不能和前后字符相同即可。
+
+## 代码
+
+```go
+package leetcode
+
+func modifyString(s string) string {
+ res := []byte(s)
+ for i, ch := range res {
+ if ch == '?' {
+ for b := byte('a'); b <= 'z'; b++ {
+ if !(i > 0 && res[i-1] == b || i < len(res)-1 && res[i+1] == b) {
+ res[i] = b
+ break
+ }
+ }
+ }
+ }
+ return string(res)
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1500~1599/1573.Number-of-Ways-to-Split-a-String/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1500~1599/1579.Remove-Max-Number-of-Edges-to-Keep-Graph-Fully-Traversable/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/1500~1599/1579.Remove-Max-Number-of-Edges-to-Keep-Graph-Fully-Traversable.md b/website/content/ChapterFour/1500~1599/1579.Remove-Max-Number-of-Edges-to-Keep-Graph-Fully-Traversable.md
new file mode 100644
index 000000000..8806ed95d
--- /dev/null
+++ b/website/content/ChapterFour/1500~1599/1579.Remove-Max-Number-of-Edges-to-Keep-Graph-Fully-Traversable.md
@@ -0,0 +1,110 @@
+# [1579. Remove Max Number of Edges to Keep Graph Fully Traversable](https://leetcode.com/problems/remove-max-number-of-edges-to-keep-graph-fully-traversable/)
+
+
+## 题目
+
+Alice and Bob have an undirected graph of `n` nodes and 3 types of edges:
+
+- Type 1: Can be traversed by Alice only.
+- Type 2: Can be traversed by Bob only.
+- Type 3: Can by traversed by both Alice and Bob.
+
+Given an array `edges` where `edges[i] = [typei, ui, vi]` represents a bidirectional edge of type `typei` between nodes `ui` and `vi`, find the maximum number of edges you can remove so that after removing the edges, the graph can still be fully traversed by both Alice and Bob. The graph is fully traversed by Alice and Bob if starting from any node, they can reach all other nodes.
+
+Return *the maximum number of edges you can remove, or return* `-1` *if it's impossible for the graph to be fully traversed by Alice and Bob.*
+
+**Example 1:**
+
+
+
+```
+Input: n = 4, edges = [[3,1,2],[3,2,3],[1,1,3],[1,2,4],[1,1,2],[2,3,4]]
+Output: 2
+Explanation: If we remove the 2 edges [1,1,2] and [1,1,3]. The graph will still be fully traversable by Alice and Bob. Removing any additional edge will not make it so. So the maximum number of edges we can remove is 2.
+```
+
+**Example 2:**
+
+
+
+```
+Input: n = 4, edges = [[3,1,2],[3,2,3],[1,1,4],[2,1,4]]
+Output: 0
+Explanation: Notice that removing any edge will not make the graph fully traversable by Alice and Bob.
+```
+
+**Example 3:**
+
+
+
+```
+Input: n = 4, edges = [[3,2,3],[1,1,2],[2,3,4]]
+Output: -1
+Explanation: In the current graph, Alice cannot reach node 4 from the other nodes. Likewise, Bob cannot reach 1. Therefore it's impossible to make the graph fully traversable.
+```
+
+**Constraints:**
+
+- `1 <= n <= 10^5`
+- `1 <= edges.length <= min(10^5, 3 * n * (n-1) / 2)`
+- `edges[i].length == 3`
+- `1 <= edges[i][0] <= 3`
+- `1 <= edges[i][1] < edges[i][2] <= n`
+- All tuples `(typei, ui, vi)` are distinct.
+
+## 题目大意
+
+Alice 和 Bob 共有一个无向图，其中包含 n 个节点和 3 种类型的边：
+
+- 类型 1：只能由 Alice 遍历。
+- 类型 2：只能由 Bob 遍历。
+- 类型 3：Alice 和 Bob 都可以遍历。
+
+给你一个数组 edges ，其中 edges[i] = [typei, ui, vi] 表示节点 ui 和 vi 之间存在类型为 typei 的双向边。请你在保证图仍能够被 Alice和 Bob 完全遍历的前提下，找出可以删除的最大边数。如果从任何节点开始，Alice 和 Bob 都可以到达所有其他节点，则认为图是可以完全遍历的。返回可以删除的最大边数，如果 Alice 和 Bob 无法完全遍历图，则返回 -1 。
+
+## 解题思路
+
+- 本题是第 1319 题的加强版。在第 1319 题中只有一个人，同样也是判断在保证图可连通的基础上，删掉最多边的条数。这一题只不过变成了 2 个人。解题思路依旧是并查集。
+- 初始化 2 个并查集，分别表示 Alice 和 Bob。先合并公共边，每合并一条边，可删除的最大总边数便减少 1 。再合并 2 人各自的单独的边，同样是每合并一条边，每合并一条边，可删除的最大总边数便减少 1 。合并完所有的边，2 人的并查集内部集合数仍大于 1，那么则代表 2 人无法完全遍历图，则输出 -1。如果 2 人的并查集内部集合都是 1，代表整个图都连通了。输出可以删除的最大边数。
+
+## 代码
+
+```go
+package leetcode
+
+import (
+ "github.com/halfrost/leetcode-go/template"
+)
+
+func maxNumEdgesToRemove(n int, edges [][]int) int {
+ alice, bob, res := template.UnionFind{}, template.UnionFind{}, len(edges)
+ alice.Init(n)
+ bob.Init(n)
+ for _, e := range edges {
+ x, y := e[1]-1, e[2]-1
+ if e[0] == 3 && (!(alice.Find(x) == alice.Find(y)) || !(bob.Find(x) == bob.Find(y))) {
+ alice.Union(x, y)
+ bob.Union(x, y)
+ res--
+ }
+ }
+ ufs := [2]*template.UnionFind{&alice, &bob}
+ for _, e := range edges {
+ if tp := e[0]; tp < 3 && !(ufs[tp-1].Find(e[1]-1) == ufs[tp-1].Find(e[2]-1)) {
+ ufs[tp-1].Union(e[1]-1, e[2]-1)
+ res--
+ }
+ }
+ if alice.TotalCount() > 1 || bob.TotalCount() > 1 {
+ return -1
+ }
+ return res
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1500~1599/1576.Replace-All-s-to-Avoid-Consecutive-Repeating-Characters/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1600~1699/1600.Throne-Inheritance/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/1500~1599/_index.md b/website/content/ChapterFour/1500~1599/_index.md
new file mode 100644
index 000000000..d2021683f
--- /dev/null
+++ b/website/content/ChapterFour/1500~1599/_index.md
@@ -0,0 +1,5 @@
+---
+bookCollapseSection: true
+weight: 20
+---
+
diff --git a/website/content/ChapterFour/1600~1699/1600.Throne-Inheritance.md b/website/content/ChapterFour/1600~1699/1600.Throne-Inheritance.md
new file mode 100644
index 000000000..c20245511
--- /dev/null
+++ b/website/content/ChapterFour/1600~1699/1600.Throne-Inheritance.md
@@ -0,0 +1,127 @@
+# [1600. Throne Inheritance](https://leetcode.com/problems/throne-inheritance/)
+
+
+## 题目
+
+A kingdom consists of a king, his children, his grandchildren, and so on. Every once in a while, someone in the family dies or a child is born.
+
+The kingdom has a well-defined order of inheritance that consists of the king as the first member. Let's define the recursive function `Successor(x, curOrder)`, which given a person `x` and the inheritance order so far, returns who should be the next person after `x` in the order of inheritance.
+
+```
+Successor(x, curOrder):
+ if x has no children or all of x's children are in curOrder:
+ if x is the king return null
+ else return Successor(x's parent, curOrder)
+ else return x's oldest child who's not in curOrder
+```
+
+For example, assume we have a kingdom that consists of the king, his children Alice and Bob (Alice is older than Bob), and finally Alice's son Jack.
+
+1. In the beginning, `curOrder` will be `["king"]`.
+2. Calling `Successor(king, curOrder)` will return Alice, so we append to `curOrder` to get `["king", "Alice"]`.
+3. Calling `Successor(Alice, curOrder)` will return Jack, so we append to `curOrder` to get `["king", "Alice", "Jack"]`.
+4. Calling `Successor(Jack, curOrder)` will return Bob, so we append to `curOrder` to get `["king", "Alice", "Jack", "Bob"]`.
+5. Calling `Successor(Bob, curOrder)` will return `null`. Thus the order of inheritance will be `["king", "Alice", "Jack", "Bob"]`.
+
+Using the above function, we can always obtain a unique order of inheritance.
+
+Implement the `ThroneInheritance` class:
+
+- `ThroneInheritance(string kingName)` Initializes an object of the `ThroneInheritance` class. The name of the king is given as part of the constructor.
+- `void birth(string parentName, string childName)` Indicates that `parentName` gave birth to `childName`.
+- `void death(string name)` Indicates the death of `name`. The death of the person doesn't affect the `Successor` function nor the current inheritance order. You can treat it as just marking the person as dead.
+- `string[] getInheritanceOrder()` Returns a list representing the current order of inheritance **excluding** dead people.
+
+**Example 1:**
+
+```
+Input
+["ThroneInheritance", "birth", "birth", "birth", "birth", "birth", "birth", "getInheritanceOrder", "death", "getInheritanceOrder"]
+[["king"], ["king", "andy"], ["king", "bob"], ["king", "catherine"], ["andy", "matthew"], ["bob", "alex"], ["bob", "asha"], [null], ["bob"], [null]]
+Output
+[null, null, null, null, null, null, null, ["king", "andy", "matthew", "bob", "alex", "asha", "catherine"], null, ["king", "andy", "matthew", "alex", "asha", "catherine"]]
+
+Explanation
+ThroneInheritance t= new ThroneInheritance("king"); // order:king
+t.birth("king", "andy"); // order: king >andy
+t.birth("king", "bob"); // order: king > andy >bob
+t.birth("king", "catherine"); // order: king > andy > bob >catherine
+t.birth("andy", "matthew"); // order: king > andy >matthew > bob > catherine
+t.birth("bob", "alex"); // order: king > andy > matthew > bob >alex > catherine
+t.birth("bob", "asha"); // order: king > andy > matthew > bob > alex >asha > catherine
+t.getInheritanceOrder(); // return ["king", "andy", "matthew", "bob", "alex", "asha", "catherine"]
+t.death("bob"); // order: king > andy > matthew >bob > alex > asha > catherine
+t.getInheritanceOrder(); // return ["king", "andy", "matthew", "alex", "asha", "catherine"]
+
+```
+
+**Constraints:**
+
+- `1 <= kingName.length, parentName.length, childName.length, name.length <= 15`
+- `kingName`, `parentName`, `childName`, and `name` consist of lowercase English letters only.
+- All arguments `childName` and `kingName` are **distinct**.
+- All `name` arguments of `death` will be passed to either the constructor or as `childName` to `birth` first.
+- For each call to `birth(parentName, childName)`, it is guaranteed that `parentName` is alive.
+- At most `105` calls will be made to `birth` and `death`.
+- At most `10` calls will be made to `getInheritanceOrder`.
+
+## 题目大意
+
+一个王国里住着国王、他的孩子们、他的孙子们等等。每一个时间点，这个家庭里有人出生也有人死亡。这个王国有一个明确规定的皇位继承顺序，第一继承人总是国王自己。我们定义递归函数 Successor(x, curOrder) ，给定一个人 x 和当前的继承顺序，该函数返回 x 的下一继承人。
+
+## 解题思路
+
+- 这道题思路不难。先将国王每个孩子按照顺序存在一个 map 中，然后每个国王的孩子还存在父子关系，同理也按顺序存在 map 中。执行 GetInheritanceOrder() 函数时，将国王的孩子按顺序遍历，如果每个孩子还有孩子，递归遍历到底。如果把继承关系看成一棵树，此题便是多叉树的先根遍历的问题。
+
+## 代码
+
+```go
+package leetcode
+
+type ThroneInheritance struct {
+ king string
+ edges map[string][]string
+ dead map[string]bool
+}
+
+func Constructor(kingName string) (t ThroneInheritance) {
+ return ThroneInheritance{kingName, map[string][]string{}, map[string]bool{}}
+}
+
+func (t *ThroneInheritance) Birth(parentName, childName string) {
+ t.edges[parentName] = append(t.edges[parentName], childName)
+}
+
+func (t *ThroneInheritance) Death(name string) {
+ t.dead[name] = true
+}
+
+func (t *ThroneInheritance) GetInheritanceOrder() (res []string) {
+ var preorder func(string)
+ preorder = func(name string) {
+ if !t.dead[name] {
+ res = append(res, name)
+ }
+ for _, childName := range t.edges[name] {
+ preorder(childName)
+ }
+ }
+ preorder(t.king)
+ return
+}
+
+/**
+ * Your ThroneInheritance object will be instantiated and called as such:
+ * obj := Constructor(kingName);
+ * obj.Birth(parentName,childName);
+ * obj.Death(name);
+ * param_3 := obj.GetInheritanceOrder();
+ */
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1500~1599/1579.Remove-Max-Number-of-Edges-to-Keep-Graph-Fully-Traversable/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1600~1699/1603.Design-Parking-System/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/1600~1699/1603.Design-Parking-System.md b/website/content/ChapterFour/1600~1699/1603.Design-Parking-System.md
new file mode 100644
index 000000000..274894e60
--- /dev/null
+++ b/website/content/ChapterFour/1600~1699/1603.Design-Parking-System.md
@@ -0,0 +1,110 @@
+# [1603. Design Parking System](https://leetcode.com/problems/design-parking-system/)
+
+
+## 题目
+
+Design a parking system for a parking lot. The parking lot has three kinds of parking spaces: big, medium, and small, with a fixed number of slots for each size.
+
+Implement the `ParkingSystem` class:
+
+- `ParkingSystem(int big, int medium, int small)` Initializes object of the `ParkingSystem` class. The number of slots for each parking space are given as part of the constructor.
+- `bool addCar(int carType)` Checks whether there is a parking space of `carType` for the car that wants to get into the parking lot. `carType` can be of three kinds: big, medium, or small, which are represented by `1`, `2`, and `3` respectively. **A car can only park in a parking space of its** `carType`. If there is no space available, return `false`, else park the car in that size space and return `true`.
+
+**Example 1:**
+
+```
+Input
+["ParkingSystem", "addCar", "addCar", "addCar", "addCar"]
+[[1, 1, 0], [1], [2], [3], [1]]
+Output
+[null, true, true, false, false]
+
+Explanation
+ParkingSystem parkingSystem = new ParkingSystem(1, 1, 0);
+parkingSystem.addCar(1); // return true because there is 1 available slot for a big car
+parkingSystem.addCar(2); // return true because there is 1 available slot for a medium car
+parkingSystem.addCar(3); // return false because there is no available slot for a small car
+parkingSystem.addCar(1); // return false because there is no available slot for a big car. It is already occupied.
+```
+
+**Constraints:**
+
+- `0 <= big, medium, small <= 1000`
+- `carType` is `1`, `2`, or `3`
+- At most `1000` calls will be made to `addCar`
+
+## 题目大意
+
+请你给一个停车场设计一个停车系统。停车场总共有三种不同大小的车位：大，中和小，每种尺寸分别有固定数目的车位。
+
+请你实现 ParkingSystem 类：
+
+- ParkingSystem(int big, int medium, int small) 初始化 ParkingSystem 类，三个参数分别对应每种停车位的数目。
+- bool addCar(int carType) 检查是否有 carType 对应的停车位。 carType 有三种类型：大，中，小，分别用数字 1， 2 和 3 表示。一辆车只能停在 carType 对应尺寸的停车位中。如果没有空车位，请返回 false ，否则将该车停入车位并返回 true 。
+
+## 解题思路
+
+- 简单题。分别用 3 个变量表示大，中和小车位。`addCar()` 判断这 3 个变量是否还有空车位即可。
+
+## 代码
+
+```go
+package leetcode
+
+type ParkingSystem struct {
+ Big int
+ Medium int
+ Small int
+}
+
+func Constructor(big int, medium int, small int) ParkingSystem {
+ return ParkingSystem{
+ Big: big,
+ Medium: medium,
+ Small: small,
+ }
+}
+
+func (this *ParkingSystem) AddCar(carType int) bool {
+ switch carType {
+ case 1:
+ {
+ if this.Big > 0 {
+ this.Big--
+ return true
+ }
+ return false
+ }
+ case 2:
+ {
+ if this.Medium > 0 {
+ this.Medium--
+ return true
+ }
+ return false
+ }
+ case 3:
+ {
+ if this.Small > 0 {
+ this.Small--
+ return true
+ }
+ return false
+ }
+ }
+ return false
+}
+
+/**
+ * Your ParkingSystem object will be instantiated and called as such:
+ * obj := Constructor(big, medium, small);
+ * param_1 := obj.AddCar(carType);
+ */
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1600~1699/1600.Throne-Inheritance/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1600~1699/1608.Special-Array-With-X-Elements-Greater-Than-or-Equal-X/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/1600~1699/1608.Special-Array-With-X-Elements-Greater-Than-or-Equal-X.md b/website/content/ChapterFour/1600~1699/1608.Special-Array-With-X-Elements-Greater-Than-or-Equal-X.md
new file mode 100644
index 000000000..447f61cc5
--- /dev/null
+++ b/website/content/ChapterFour/1600~1699/1608.Special-Array-With-X-Elements-Greater-Than-or-Equal-X.md
@@ -0,0 +1,87 @@
+# [1608. Special Array With X Elements Greater Than or Equal X](https://leetcode.com/problems/special-array-with-x-elements-greater-than-or-equal-x/)
+
+## 题目
+
+You are given an array `nums` of non-negative integers. `nums` is considered **special** if there exists a number `x` such that there are **exactly** `x` numbers in `nums` that are **greater than or equal to** `x`.
+
+Notice that `x` **does not** have to be an element in `nums`.
+
+Return `x` *if the array is **special**, otherwise, return* `-1`. It can be proven that if `nums` is special, the value for `x` is **unique**.
+
+**Example 1:**
+
+```
+Input: nums = [3,5]
+Output: 2
+Explanation: There are 2 values (3 and 5) that are greater than or equal to 2.
+```
+
+**Example 2:**
+
+```
+Input: nums = [0,0]
+Output: -1
+Explanation: No numbers fit the criteria for x.
+If x = 0, there should be 0 numbers >= x, but there are 2.
+If x = 1, there should be 1 number >= x, but there are 0.
+If x = 2, there should be 2 numbers >= x, but there are 0.
+x cannot be greater since there are only 2 numbers in nums.
+```
+
+**Example 3:**
+
+```
+Input: nums = [0,4,3,0,4]
+Output: 3
+Explanation: There are 3 values that are greater than or equal to 3.
+```
+
+**Example 4:**
+
+```
+Input: nums = [3,6,7,7,0]
+Output: -1
+```
+
+**Constraints:**
+
+- `1 <= nums.length <= 100`
+- `0 <= nums[i] <= 1000`
+
+## 题目大意
+
+给你一个非负整数数组 nums 。如果存在一个数 x ，使得 nums 中恰好有 x 个元素 大于或者等于 x ，那么就称 nums 是一个 特殊数组 ，而 x 是该数组的 特征值 。（注意： x 不必 是 nums 的中的元素。）如果数组 nums 是一个 特殊数组 ，请返回它的特征值 x 。否则，返回 -1 。可以证明的是，如果 nums 是特殊数组，那么其特征值 x 是 唯一的 。
+
+## 解题思路
+
+- 简单题。抓住题干中给的证明，特征值是唯一的。先将数组从小到大排序，下标的含义与特征值就等价了。下标 `i` 代表大于等于 `nums[i]` 的元素有 `len(nums) - i` 个，那么从第 0 个下标的元素开始遍历，如果这个元素都大于 `len(nums)`，那么后面 `len(nums)` 个元素也都大于等于它，特征值就找到了。如果特征值减一以后，仍然满足 `nums[i] >= x`，说明满足条件的值有多个，这一点不满足特征值唯一性，可以直接返回 -1 了。下标继续右移，特征值继续减一。如果最终循环结束依旧找不到特征值，返回 -1 。
+
+## 代码
+
+```go
+package leetcode
+
+import "sort"
+
+func specialArray(nums []int) int {
+ sort.Ints(nums)
+ x := len(nums)
+ for _, num := range nums {
+ if num >= x {
+ return x
+ }
+ x--
+ if num >= x {
+ return -1
+ }
+ }
+ return -1
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1600~1699/1603.Design-Parking-System/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1600~1699/1609.Even-Odd-Tree/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/1600~1699/1609.Even-Odd-Tree.md b/website/content/ChapterFour/1600~1699/1609.Even-Odd-Tree.md
new file mode 100644
index 000000000..66be442a9
--- /dev/null
+++ b/website/content/ChapterFour/1600~1699/1609.Even-Odd-Tree.md
@@ -0,0 +1,157 @@
+# [1609. Even Odd Tree](https://leetcode.com/problems/even-odd-tree/)
+
+## 题目
+
+A binary tree is named Even-Odd if it meets the following conditions:
+
+- The root of the binary tree is at level index 0, its children are at level index 1, their children are at level index 2, etc.
+- For every even-indexed level, all nodes at the level have odd integer values in strictly increasing order (from left to right).
+- For every odd-indexed level, all nodes at the level have even integer values in strictly decreasing order (from left to right).
+
+Given the root of a binary tree, return true if the binary tree is Even-Odd, otherwise return false.
+
+**Example 1**:
+
+
+
+ Input: root = [1,10,4,3,null,7,9,12,8,6,null,null,2]
+ Output: true
+ Explanation: The node values on each level are:
+ Level 0: [1]
+ Level 1: [10,4]
+ Level 2: [3,7,9]
+ Level 3: [12,8,6,2]
+ Since levels 0 and 2 are all odd and increasing and levels 1 and 3 are all even and decreasing, the tree is Even-Odd.
+
+**Example 2**:
+
+
+
+ Input: root = [5,4,2,3,3,7]
+ Output: false
+ Explanation: The node values on each level are:
+ Level 0: [5]
+ Level 1: [4,2]
+ Level 2: [3,3,7]
+ Node values in level 2 must be in strictly increasing order, so the tree is not Even-Odd.
+
+**Example 3**:
+
+
+
+ Input: root = [5,9,1,3,5,7]
+ Output: false
+ Explanation: Node values in the level 1 should be even integers.
+
+**Example 4**:
+
+ Input: root = [1]
+ Output: true
+
+**Example 5**:
+
+ Input: root = [11,8,6,1,3,9,11,30,20,18,16,12,10,4,2,17]
+ Output: True
+
+**Constraints:**
+
+- The number of nodes in the tree is in the range [1, 100000].
+- 1 <= Node.val <= 1000000
+
+## 题目大意
+
+如果一棵二叉树满足下述几个条件，则可以称为 奇偶树 ：
+
+- 二叉树根节点所在层下标为 0 ，根的子节点所在层下标为 1 ，根的孙节点所在层下标为 2 ，依此类推。
+- 偶数下标 层上的所有节点的值都是 奇 整数，从左到右按顺序 严格递增
+- 奇数下标 层上的所有节点的值都是 偶 整数，从左到右按顺序 严格递减
+
+给你二叉树的根节点，如果二叉树为 奇偶树 ，则返回 true ，否则返回 false 。
+
+## 解题思路
+
+- 广度优先遍历(分别判断奇数层和偶数层)
+
+## 代码
+
+```go
+package leetcode
+
+type TreeNode struct {
+ Val int
+ Left *TreeNode
+ Right *TreeNode
+}
+
+func isEvenOddTree(root *TreeNode) bool {
+ level := 0
+ queue := []*TreeNode{root}
+ for len(queue) != 0 {
+ length := len(queue)
+ var nums []int
+ for i := 0; i < length; i++ {
+ node := queue[i]
+ if node.Left != nil {
+ queue = append(queue, node.Left)
+ }
+ if node.Right != nil {
+ queue = append(queue, node.Right)
+ }
+ nums = append(nums, node.Val)
+ }
+ if level%2 == 0 {
+ if !even(nums) {
+ return false
+ }
+ } else {
+ if !odd(nums) {
+ return false
+ }
+ }
+ queue = queue[length:]
+ level++
+ }
+ return true
+}
+
+func odd(nums []int) bool {
+ cur := nums[0]
+ if cur%2 != 0 {
+ return false
+ }
+ for _, num := range nums[1:] {
+ if num >= cur {
+ return false
+ }
+ if num%2 != 0 {
+ return false
+ }
+ cur = num
+ }
+ return true
+}
+
+func even(nums []int) bool {
+ cur := nums[0]
+ if cur%2 == 0 {
+ return false
+ }
+ for _, num := range nums[1:] {
+ if num <= cur {
+ return false
+ }
+ if num%2 == 0 {
+ return false
+ }
+ cur = num
+ }
+ return true
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1600~1699/1608.Special-Array-With-X-Elements-Greater-Than-or-Equal-X/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1600~1699/1614.Maximum-Nesting-Depth-of-the-Parentheses/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/1600~1699/1614.Maximum-Nesting-Depth-of-the-Parentheses.md b/website/content/ChapterFour/1600~1699/1614.Maximum-Nesting-Depth-of-the-Parentheses.md
new file mode 100644
index 000000000..6800959bc
--- /dev/null
+++ b/website/content/ChapterFour/1600~1699/1614.Maximum-Nesting-Depth-of-the-Parentheses.md
@@ -0,0 +1,109 @@
+# [1614. Maximum Nesting Depth of the Parentheses](https://leetcode.com/problems/maximum-nesting-depth-of-the-parentheses/)
+
+## 题目
+
+A string is a **valid parentheses string** (denoted **VPS**) if it meets one of the following:
+
+- It is an empty string `""`, or a single character not equal to `"("` or `")"`,
+- It can be written as `AB` (`A` concatenated with `B`), where `A` and `B` are **VPS**'s, or
+- It can be written as `(A)`, where `A` is a **VPS**.
+
+We can similarly define the **nesting depth** `depth(S)` of any VPS `S` as follows:
+
+- `depth("") = 0`
+- `depth(C) = 0`, where `C` is a string with a single character not equal to `"("` or `")"`.
+- `depth(A + B) = max(depth(A), depth(B))`, where `A` and `B` are **VPS**'s.
+- `depth("(" + A + ")") = 1 + depth(A)`, where `A` is a **VPS**.
+
+For example, `""`, `"()()"`, and `"()(()())"` are **VPS**'s (with nesting depths 0, 1, and 2), and `")("` and `"(()"` are not **VPS**'s.
+
+Given a **VPS** represented as string `s`, return *the **nesting depth** of* `s`.
+
+**Example 1:**
+
+```
+Input: s = "(1+(2*3)+((8)/4))+1"
+Output: 3
+Explanation: Digit 8 is inside of 3 nested parentheses in the string.
+```
+
+**Example 2:**
+
+```
+Input: s = "(1)+((2))+(((3)))"
+Output: 3
+```
+
+**Example 3:**
+
+```
+Input: s = "1+(2*3)/(2-1)"
+Output: 1
+```
+
+**Example 4:**
+
+```
+Input: s = "1"
+Output: 0
+```
+
+**Constraints:**
+
+- `1 <= s.length <= 100`
+- `s` consists of digits `0-9` and characters `'+'`, `'-'`, `'*'`, `'/'`, `'('`, and `')'`.
+- It is guaranteed that parentheses expression `s` is a **VPS**.
+
+## 题目大意
+
+如果字符串满足以下条件之一，则可以称之为 有效括号字符串（valid parentheses string，可以简写为 VPS）：
+
+- 字符串是一个空字符串 ""，或者是一个不为 "(" 或 ")" 的单字符。
+- 字符串可以写为 AB（A 与 B 字符串连接），其中 A 和 B 都是 有效括号字符串 。
+- 字符串可以写为 (A)，其中 A 是一个 有效括号字符串 。
+
+类似地，可以定义任何有效括号字符串 S 的 嵌套深度 depth(S)：
+
+- depth("") = 0
+- depth(C) = 0，其中 C 是单个字符的字符串，且该字符不是 "(" 或者 ")"
+- depth(A + B) = max(depth(A), depth(B))，其中 A 和 B 都是 有效括号字符串
+- depth("(" + A + ")") = 1 + depth(A)，其中 A 是一个 有效括号字符串
+
+例如：""、"()()"、"()(()())" 都是 有效括号字符串（嵌套深度分别为 0、1、2），而 ")(" 、"(()" 都不是 有效括号字符串 。给你一个 有效括号字符串 s，返回该字符串的 s 嵌套深度 。
+
+## 解题思路
+
+- 简单题。求一个括号字符串的嵌套深度。题目给的括号字符串都是有效的，所以不需要考虑非法的情况。扫描一遍括号字符串，遇到 `(` 可以无脑 ++，并动态维护最大值，遇到 `)` 可以无脑 - - 。最后输出最大值即可。
+
+## 代码
+
+```go
+package leetcode
+
+func maxDepth(s string) int {
+ res, cur := 0, 0
+ for _, c := range s {
+ if c == '(' {
+ cur++
+ res = max(res, cur)
+ } else if c == ')' {
+ cur--
+ }
+ }
+ return res
+}
+
+func max(a, b int) int {
+ if a > b {
+ return a
+ }
+ return b
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1600~1699/1609.Even-Odd-Tree/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1600~1699/1619.Mean-of-Array-After-Removing-Some-Elements/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/1600~1699/1619.Mean-of-Array-After-Removing-Some-Elements.md b/website/content/ChapterFour/1600~1699/1619.Mean-of-Array-After-Removing-Some-Elements.md
new file mode 100644
index 000000000..27feadef2
--- /dev/null
+++ b/website/content/ChapterFour/1600~1699/1619.Mean-of-Array-After-Removing-Some-Elements.md
@@ -0,0 +1,81 @@
+# [1619. Mean of Array After Removing Some Elements](https://leetcode.com/problems/mean-of-array-after-removing-some-elements/)
+
+## 题目
+
+Given an integer array `arr`, return *the mean of the remaining integers after removing the smallest `5%` and the largest `5%` of the elements.*
+
+Answers within `10-5` of the **actual answer** will be considered accepted.
+
+**Example 1:**
+
+```
+Input: arr = [1,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,3]
+Output: 2.00000
+Explanation: After erasing the minimum and the maximum values of this array, all elements are equal to 2, so the mean is 2.
+```
+
+**Example 2:**
+
+```
+Input: arr = [6,2,7,5,1,2,0,3,10,2,5,0,5,5,0,8,7,6,8,0]
+Output: 4.00000
+```
+
+**Example 3:**
+
+```
+Input: arr = [6,0,7,0,7,5,7,8,3,4,0,7,8,1,6,8,1,1,2,4,8,1,9,5,4,3,8,5,10,8,6,6,1,0,6,10,8,2,3,4]
+Output: 4.77778
+```
+
+**Example 4:**
+
+```
+Input: arr = [9,7,8,7,7,8,4,4,6,8,8,7,6,8,8,9,2,6,0,0,1,10,8,6,3,3,5,1,10,9,0,7,10,0,10,4,1,10,6,9,3,6,0,0,2,7,0,6,7,2,9,7,7,3,0,1,6,1,10,3]
+Output: 5.27778
+```
+
+**Example 5:**
+
+```
+Input: arr = [4,8,4,10,0,7,1,3,7,8,8,3,4,1,6,2,1,1,8,0,9,8,0,3,9,10,3,10,1,10,7,3,2,1,4,9,10,7,6,4,0,8,5,1,2,1,6,2,5,0,7,10,9,10,3,7,10,5,8,5,7,6,7,6,10,9,5,10,5,5,7,2,10,7,7,8,2,0,1,1]
+Output: 5.29167
+```
+
+**Constraints:**
+
+- `20 <= arr.length <= 1000`
+- `arr.length` **is a multiple** of `20`.
+- `0 <= arr[i] <= 10^5`
+
+## 题目大意
+
+给你一个整数数组 `arr` ，请你删除最小 `5%` 的数字和最大 `5%` 的数字后，剩余数字的平均值。与 **标准答案** 误差在 `10-5` 的结果都被视为正确结果。
+
+## 解题思路
+
+- 简单题。先将数组排序，然后累加中间 90% 的元素，最后计算平均值。
+
+## 代码
+
+```go
+package leetcode
+
+import "sort"
+
+func trimMean(arr []int) float64 {
+ sort.Ints(arr)
+ n, sum := len(arr), 0
+ for i := n / 20; i < n-(n/20); i++ {
+ sum += arr[i]
+ }
+ return float64(sum) / float64((n - (n / 10)))
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1600~1699/1614.Maximum-Nesting-Depth-of-the-Parentheses/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1600~1699/1624.Largest-Substring-Between-Two-Equal-Characters/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/1600~1699/1624.Largest-Substring-Between-Two-Equal-Characters.md b/website/content/ChapterFour/1600~1699/1624.Largest-Substring-Between-Two-Equal-Characters.md
new file mode 100644
index 000000000..0699f7d7a
--- /dev/null
+++ b/website/content/ChapterFour/1600~1699/1624.Largest-Substring-Between-Two-Equal-Characters.md
@@ -0,0 +1,80 @@
+# [1624. Largest Substring Between Two Equal Characters](https://leetcode.com/problems/largest-substring-between-two-equal-characters/)
+
+## 题目
+
+Given a string `s`, return *the length of the longest substring between two equal characters, excluding the two characters.* If there is no such substring return `-1`.
+
+A **substring** is a contiguous sequence of characters within a string.
+
+**Example 1:**
+
+```
+Input: s = "aa"
+Output: 0
+Explanation: The optimal substring here is an empty substring between the two 'a's.
+```
+
+**Example 2:**
+
+```
+Input: s = "abca"
+Output: 2
+Explanation: The optimal substring here is "bc".
+```
+
+**Example 3:**
+
+```
+Input: s = "cbzxy"
+Output: -1
+Explanation: There are no characters that appear twice in s.
+```
+
+**Example 4:**
+
+```
+Input: s = "cabbac"
+Output: 4
+Explanation: The optimal substring here is "abba". Other non-optimal substrings include "bb" and "".
+```
+
+**Constraints:**
+
+- `1 <= s.length <= 300`
+- `s` contains only lowercase English letters.
+
+## 题目大意
+
+给你一个字符串 s，请你返回 两个相同字符之间的最长子字符串的长度 ，计算长度时不含这两个字符。如果不存在这样的子字符串，返回 -1 。子字符串 是字符串中的一个连续字符序列。
+
+## 解题思路
+
+- 简单题。取每个字符，扫描一次字符串，如果在字符串中还能找到相同的字符，则返回最末尾的那个字符，计算这两个字符之间的距离。取最末尾的字符是为了让两个相同的字符距离最长。扫描字符串过程中动态维护最长长度。如果字符串中不存在 2 个相同的字符，则返回 -1 。
+
+## 代码
+
+```go
+package leetcode
+
+import "strings"
+
+func maxLengthBetweenEqualCharacters(s string) int {
+ res := -1
+ for k, v := range s {
+ tmp := strings.LastIndex(s, string(v))
+ if tmp > 0 {
+ if res < tmp-k-1 {
+ res = tmp - k - 1
+ }
+ }
+ }
+ return res
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1600~1699/1619.Mean-of-Array-After-Removing-Some-Elements/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1600~1699/1629.Slowest-Key/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/1600~1699/1629.Slowest-Key.md b/website/content/ChapterFour/1600~1699/1629.Slowest-Key.md
new file mode 100644
index 000000000..3134c791a
--- /dev/null
+++ b/website/content/ChapterFour/1600~1699/1629.Slowest-Key.md
@@ -0,0 +1,90 @@
+# [1629. Slowest Key](https://leetcode.com/problems/slowest-key/)
+
+
+## 题目
+
+A newly designed keypad was tested, where a tester pressed a sequence of `n` keys, one at a time.
+
+You are given a string `keysPressed` of length `n`, where `keysPressed[i]` was the `ith` key pressed in the testing sequence, and a sorted list `releaseTimes`, where `releaseTimes[i]` was the time the `ith` key was released. Both arrays are **0-indexed**. The `0th` key was pressed at the time `0`, and every subsequent key was pressed at the **exact** time the previous key was released.
+
+The tester wants to know the key of the keypress that had the **longest duration**. The `ith` keypress had a **duration** of `releaseTimes[i] - releaseTimes[i - 1]`, and the `0th` keypress had a duration of `releaseTimes[0]`.
+
+Note that the same key could have been pressed multiple times during the test, and these multiple presses of the same key **may not** have had the same **duration**.
+
+*Return the key of the keypress that had the **longest duration**. If there are multiple such keypresses, return the lexicographically largest key of the keypresses.*
+
+**Example 1:**
+
+```
+Input: releaseTimes = [9,29,49,50], keysPressed = "cbcd"
+Output: "c"
+Explanation: The keypresses were as follows:
+Keypress for 'c' had a duration of 9 (pressed at time 0 and released at time 9).
+Keypress for 'b' had a duration of 29 - 9 = 20 (pressed at time 9 right after the release of the previous character and released at time 29).
+Keypress for 'c' had a duration of 49 - 29 = 20 (pressed at time 29 right after the release of the previous character and released at time 49).
+Keypress for 'd' had a duration of 50 - 49 = 1 (pressed at time 49 right after the release of the previous character and released at time 50).
+The longest of these was the keypress for 'b' and the second keypress for 'c', both with duration 20.
+'c' is lexicographically larger than 'b', so the answer is 'c'.
+```
+
+**Example 2:**
+
+```
+Input: releaseTimes = [12,23,36,46,62], keysPressed = "spuda"
+Output: "a"
+Explanation: The keypresses were as follows:
+Keypress for 's' had a duration of 12.
+Keypress for 'p' had a duration of 23 - 12 = 11.
+Keypress for 'u' had a duration of 36 - 23 = 13.
+Keypress for 'd' had a duration of 46 - 36 = 10.
+Keypress for 'a' had a duration of 62 - 46 = 16.
+The longest of these was the keypress for 'a' with duration 16.
+```
+
+**Constraints:**
+
+- `releaseTimes.length == n`
+- `keysPressed.length == n`
+- `2 <= n <= 1000`
+- `1 <= releaseTimes[i] <= 109`
+- `releaseTimes[i] < releaseTimes[i+1]`
+- `keysPressed` contains only lowercase English letters.
+
+## 题目大意
+
+LeetCode 设计了一款新式键盘，正在测试其可用性。测试人员将会点击一系列键（总计 n 个），每次一个。
+
+给你一个长度为 n 的字符串 keysPressed ，其中 keysPressed[i] 表示测试序列中第 i 个被按下的键。releaseTimes 是一个升序排列的列表，其中 releaseTimes[i] 表示松开第 i 个键的时间。字符串和数组的 下标都从 0 开始 。第 0 个键在时间为 0 时被按下，接下来每个键都 恰好 在前一个键松开时被按下。测试人员想要找出按键 持续时间最长 的键。第 i 次按键的持续时间为 releaseTimes[i] - releaseTimes[i - 1] ，第 0 次按键的持续时间为 releaseTimes[0] 。
+
+注意，测试期间，同一个键可以在不同时刻被多次按下，而每次的持续时间都可能不同。请返回按键 持续时间最长 的键，如果有多个这样的键，则返回 按字母顺序排列最大 的那个键。
+
+## 解题思路
+
+- 题干很长，不过还是简单题。循环扫描一遍数组，计算出每个按键的持续时间。动态更新按键最长时间的键。如果持续时间最长的有多个键，需要返回字母序最大的那一个键。
+
+## 代码
+
+```go
+package leetcode
+
+func slowestKey(releaseTimes []int, keysPressed string) byte {
+ longestDuration, key := releaseTimes[0], keysPressed[0]
+ for i := 1; i < len(releaseTimes); i++ {
+ duration := releaseTimes[i] - releaseTimes[i-1]
+ if duration > longestDuration {
+ longestDuration = duration
+ key = keysPressed[i]
+ } else if duration == longestDuration && keysPressed[i] > key {
+ key = keysPressed[i]
+ }
+ }
+ return key
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1600~1699/1624.Largest-Substring-Between-Two-Equal-Characters/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1600~1699/1631.Path-With-Minimum-Effort/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/1600~1699/1631.Path-With-Minimum-Effort.md b/website/content/ChapterFour/1600~1699/1631.Path-With-Minimum-Effort.md
new file mode 100644
index 000000000..e219d8c62
--- /dev/null
+++ b/website/content/ChapterFour/1600~1699/1631.Path-With-Minimum-Effort.md
@@ -0,0 +1,177 @@
+# [1631. Path With Minimum Effort](https://leetcode.com/problems/path-with-minimum-effort/)
+
+## 题目
+
+You are a hiker preparing for an upcoming hike. You are given `heights`, a 2D array of size `rows x columns`, where `heights[row][col]` represents the height of cell `(row, col)`. You are situated in the top-left cell, `(0, 0)`, and you hope to travel to the bottom-right cell, `(rows-1, columns-1)` (i.e., **0-indexed**). You can move **up**, **down**, **left**, or **right**, and you wish to find a route that requires the minimum **effort**.
+
+A route's **effort** is the **maximum absolute difference** in heights between two consecutive cells of the route.
+
+Return *the minimum **effort** required to travel from the top-left cell to the bottom-right cell.*
+
+**Example 1:**
+
+
+
+```
+Input: heights = [[1,2,2],[3,8,2],[5,3,5]]
+Output: 2
+Explanation: The route of [1,3,5,3,5] has a maximum absolute difference of 2 in consecutive cells.
+This is better than the route of [1,2,2,2,5], where the maximum absolute difference is 3.
+```
+
+**Example 2:**
+
+
+
+```
+Input: heights = [[1,2,3],[3,8,4],[5,3,5]]
+Output: 1
+Explanation: The route of [1,2,3,4,5] has a maximum absolute difference of 1 in consecutive cells, which is better than route [1,3,5,3,5].
+```
+
+**Example 3:**
+
+
+
+```
+Input: heights = [[1,2,1,1,1],[1,2,1,2,1],[1,2,1,2,1],[1,2,1,2,1],[1,1,1,2,1]]
+Output: 0
+Explanation: This route does not require any effort.
+```
+
+**Constraints:**
+
+- `rows == heights.length`
+- `columns == heights[i].length`
+- `1 <= rows, columns <= 100`
+- `1 <= heights[i][j] <= 10^6`
+
+## 题目大意
+
+你准备参加一场远足活动。给你一个二维 `rows x columns` 的地图 `heights` ，其中 `heights[row][col]` 表示格子 `(row, col)` 的高度。一开始你在最左上角的格子 `(0, 0)` ，且你希望去最右下角的格子 `(rows-1, columns-1)` （注意下标从 0 开始编号）。你每次可以往 上，下，左，右 四个方向之一移动，你想要找到耗费 体力 最小的一条路径。一条路径耗费的 体力值 是路径上相邻格子之间 高度差绝对值 的 最大值 决定的。请你返回从左上角走到右下角的最小 体力消耗值 。
+
+## 解题思路
+
+- 此题和第 778 题解题思路完全一致。在第 778 题中求的是最短连通时间。此题求的是连通路径下的最小体力值。都是求的最小值，只是 2 个值的意义不同罢了。
+- 按照第 778 题的思路，本题也有多种解法。第一种解法是 DFS + 二分。先将题目变换一个等价问法。题目要求找到最小体力消耗值，也相当于问是否存在一个体力消耗值 x，只要大于等于 x，一定能连通。利用二分搜索来找到这个临界值。体力消耗值是有序的，此处满足二分搜索的条件。题目给定柱子高度是 [1,10^6]，所以体力值一定在 [0,10^6-1] 这个区间内。判断是否取中值的条件是用 DFS 或者 BFS 搜索 (0,0) 点和 (N-1, N-1) 点之间是否连通。时间复杂度：O(mnlogC)，其中 m 和 n 分别是地图的行数和列数，C 是格子的最大高度。C 最大为 10^6，所以 logC 常数也很小。空间复杂度 O(mn)。
+- 第二种解法是并查集。将图中所有边按照权值从小到大进行排序，并依次加入并查集中。直到加入一条权值为 x 的边以后，左上角到右下角连通了。最小体力消耗值也就找到了。注意加入边的时候，只加入 `i-1` 和 `i` ，`j-1` 和 `j` 这 2 类相邻的边。因为最小体力消耗意味着不走回头路。上下左右四个方向到达一个节点，只可能从上边和左边走过来。从下边和右边走过来肯定是浪费体力了。时间复杂度：O(mnlog(mn))，其中 m 和 n 分别是地图的行数和列数，图中的边数为 O(mn)。空间复杂度 O(mn)，即为存储所有边以及并查集需要的空间。
+
+## 代码
+
+```go
+package leetcode
+
+import (
+ "sort"
+
+ "github.com/halfrost/leetcode-go/template"
+)
+
+var dir = [4][2]int{
+ {0, 1},
+ {1, 0},
+ {0, -1},
+ {-1, 0},
+}
+
+// 解法一 DFS + 二分
+func minimumEffortPath(heights [][]int) int {
+ n, m := len(heights), len(heights[0])
+ visited := make([][]bool, n)
+ for i := range visited {
+ visited[i] = make([]bool, m)
+ }
+ low, high := 0, 1000000
+ for low < high {
+ threshold := low + (high-low)>>1
+ if !hasPath(heights, visited, 0, 0, threshold) {
+ low = threshold + 1
+ } else {
+ high = threshold
+ }
+ for i := range visited {
+ for j := range visited[i] {
+ visited[i][j] = false
+ }
+ }
+ }
+ return low
+}
+
+func hasPath(heights [][]int, visited [][]bool, i, j, threshold int) bool {
+ n, m := len(heights), len(heights[0])
+ if i == n-1 && j == m-1 {
+ return true
+ }
+ visited[i][j] = true
+ res := false
+ for _, d := range dir {
+ ni, nj := i+d[0], j+d[1]
+ if ni < 0 || ni >= n || nj < 0 || nj >= m || visited[ni][nj] || res {
+ continue
+ }
+ diff := abs(heights[i][j] - heights[ni][nj])
+ if diff <= threshold && hasPath(heights, visited, ni, nj, threshold) {
+ res = true
+ }
+ }
+ return res
+}
+
+func abs(a int) int {
+ if a < 0 {
+ a = -a
+ }
+ return a
+}
+
+func min(a, b int) int {
+ if a < b {
+ return a
+ }
+ return b
+}
+
+func max(a, b int) int {
+ if a < b {
+ return b
+ }
+ return a
+}
+
+// 解法二 并查集
+func minimumEffortPath1(heights [][]int) int {
+ n, m, edges, uf := len(heights), len(heights[0]), []edge{}, template.UnionFind{}
+ uf.Init(n * m)
+ for i, row := range heights {
+ for j, h := range row {
+ id := i*m + j
+ if i > 0 {
+ edges = append(edges, edge{id - m, id, abs(h - heights[i-1][j])})
+ }
+ if j > 0 {
+ edges = append(edges, edge{id - 1, id, abs(h - heights[i][j-1])})
+ }
+ }
+ }
+ sort.Slice(edges, func(i, j int) bool { return edges[i].diff < edges[j].diff })
+ for _, e := range edges {
+ uf.Union(e.v, e.w)
+ if uf.Find(0) == uf.Find(n*m-1) {
+ return e.diff
+ }
+ }
+ return 0
+}
+
+type edge struct {
+ v, w, diff int
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1600~1699/1629.Slowest-Key/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1600~1699/1636.Sort-Array-by-Increasing-Frequency/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/1600~1699/1636.Sort-Array-by-Increasing-Frequency.md b/website/content/ChapterFour/1600~1699/1636.Sort-Array-by-Increasing-Frequency.md
new file mode 100644
index 000000000..517e4a895
--- /dev/null
+++ b/website/content/ChapterFour/1600~1699/1636.Sort-Array-by-Increasing-Frequency.md
@@ -0,0 +1,73 @@
+# [1636. Sort Array by Increasing Frequency](https://leetcode.com/problems/sort-array-by-increasing-frequency/)
+
+
+## 题目
+
+Given an array of integers `nums`, sort the array in **increasing** order based on the frequency of the values. If multiple values have the same frequency, sort them in **decreasing** order.
+
+Return the *sorted array*.
+
+**Example 1:**
+
+```
+Input: nums = [1,1,2,2,2,3]
+Output: [3,1,1,2,2,2]
+Explanation: '3' has a frequency of 1, '1' has a frequency of 2, and '2' has a frequency of 3.
+```
+
+**Example 2:**
+
+```
+Input: nums = [2,3,1,3,2]
+Output: [1,3,3,2,2]
+Explanation: '2' and '3' both have a frequency of 2, so they are sorted in decreasing order.
+```
+
+**Example 3:**
+
+```
+Input: nums = [-1,1,-6,4,5,-6,1,4,1]
+Output: [5,-1,4,4,-6,-6,1,1,1]
+```
+
+**Constraints:**
+
+- `1 <= nums.length <= 100`
+- `100 <= nums[i] <= 100`
+
+## 题目大意
+
+给你一个整数数组 `nums` ，请你将数组按照每个值的频率 **升序** 排序。如果有多个值的频率相同，请你按照数值本身将它们 **降序** 排序。请你返回排序后的数组。
+
+## 解题思路
+
+- 简单题。先统计每个值的频率，然后按照频率从小到大排序，相同频率的按照值的大小，从大到小排序。
+
+## 代码
+
+```go
+package leetcode
+
+import "sort"
+
+func frequencySort(nums []int) []int {
+ freq := map[int]int{}
+ for _, v := range nums {
+ freq[v]++
+ }
+ sort.Slice(nums, func(i, j int) bool {
+ if freq[nums[i]] == freq[nums[j]] {
+ return nums[j] < nums[i]
+ }
+ return freq[nums[i]] < freq[nums[j]]
+ })
+ return nums
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1600~1699/1631.Path-With-Minimum-Effort/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1600~1699/1640.Check-Array-Formation-Through-Concatenation/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/1600~1699/1640.Check-Array-Formation-Through-Concatenation.md b/website/content/ChapterFour/1600~1699/1640.Check-Array-Formation-Through-Concatenation.md
new file mode 100644
index 000000000..6b85c7d2f
--- /dev/null
+++ b/website/content/ChapterFour/1600~1699/1640.Check-Array-Formation-Through-Concatenation.md
@@ -0,0 +1,102 @@
+# [1640. Check Array Formation Through Concatenation](https://leetcode.com/problems/check-array-formation-through-concatenation/)
+
+
+## 题目
+
+You are given an array of **distinct** integers `arr` and an array of integer arrays `pieces`, where the integers in `pieces` are **distinct**. Your goal is to form `arr` by concatenating the arrays in `pieces` **in any order**. However, you are **not** allowed to reorder the integers in each array `pieces[i]`.
+
+Return `true` *if it is possible to form the array* `arr` *from* `pieces`. Otherwise, return `false`.
+
+**Example 1**:
+
+```
+Input: arr = [85], pieces = [[85]]
+Output: true
+```
+
+**Example 2**:
+
+```
+Input: arr = [15,88], pieces = [[88],[15]]
+Output: true
+Explanation: Concatenate [15] then [88]
+```
+
+**Example 3**:
+
+```
+Input: arr = [49,18,16], pieces = [[16,18,49]]
+Output: false
+Explanation: Even though the numbers match, we cannot reorder pieces[0].
+```
+
+**Example 4**:
+
+```
+Input: arr = [91,4,64,78], pieces = [[78],[4,64],[91]]
+Output: true
+Explanation: Concatenate [91] then [4,64] then [78]
+```
+
+**Example 5**:
+
+```
+Input: arr = [1,3,5,7], pieces = [[2,4,6,8]]
+Output: false
+
+```
+
+**Constraints**:
+
+- `1 <= pieces.length <= arr.length <= 100`
+- `sum(pieces[i].length) == arr.length`
+- `1 <= pieces[i].length <= arr.length`
+- `1 <= arr[i], pieces[i][j] <= 100`
+- The integers in `arr` are **distinct**.
+- The integers in `pieces` are **distinct** (i.e., If we flatten pieces in a 1D array, all the integers in this array are distinct).
+
+## 题目大意
+
+给你一个整数数组 arr ，数组中的每个整数 互不相同 。另有一个由整数数组构成的数组 pieces，其中的整数也 互不相同 。请你以 任意顺序 连接 pieces 中的数组以形成 arr 。但是，不允许 对每个数组 pieces[i] 中的整数重新排序。如果可以连接 pieces 中的数组形成 arr ，返回 true ；否则，返回 false 。
+
+## 解题思路
+
+- 简单题。题目保证了 arr 中的元素唯一，所以可以用 map 把每个元素的 index 存起来，方便查找。遍历 pieces 数组，在每个一维数组中判断元素顺序是否和原 arr 元素相对顺序一致。这个时候就用 map 查找，如果顺序是一一相连的，那么就是正确的。有一个顺序不是一一相连，或者出现了 arr 不存在的元素，都返回 false。
+
+## 代码
+
+```go
+package leetcode
+
+func canFormArray(arr []int, pieces [][]int) bool {
+ arrMap := map[int]int{}
+ for i, v := range arr {
+ arrMap[v] = i
+ }
+ for i := 0; i < len(pieces); i++ {
+ order := -1
+ for j := 0; j < len(pieces[i]); j++ {
+ if _, ok := arrMap[pieces[i][j]]; !ok {
+ return false
+ }
+ if order == -1 {
+ order = arrMap[pieces[i][j]]
+ } else {
+ if arrMap[pieces[i][j]] == order+1 {
+ order = arrMap[pieces[i][j]]
+ } else {
+ return false
+ }
+ }
+ }
+ }
+ return true
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1600~1699/1636.Sort-Array-by-Increasing-Frequency/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1600~1699/1641.Count-Sorted-Vowel-Strings/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/1600~1699/1641.Count-Sorted-Vowel-Strings.md b/website/content/ChapterFour/1600~1699/1641.Count-Sorted-Vowel-Strings.md
new file mode 100644
index 000000000..3967392c4
--- /dev/null
+++ b/website/content/ChapterFour/1600~1699/1641.Count-Sorted-Vowel-Strings.md
@@ -0,0 +1,97 @@
+# [1641. Count Sorted Vowel Strings](https://leetcode.com/problems/count-sorted-vowel-strings/)
+
+
+## 题目
+
+Given an integer `n`, return *the number of strings of length* `n` *that consist only of vowels (*`a`*,* `e`*,* `i`*,* `o`*,* `u`*) and are **lexicographically sorted**.*
+
+A string `s` is **lexicographically sorted** if for all valid `i`, `s[i]` is the same as or comes before `s[i+1]` in the alphabet.
+
+**Example 1:**
+
+```
+Input: n = 1
+Output: 5
+Explanation: The 5 sorted strings that consist of vowels only are ["a","e","i","o","u"].
+```
+
+**Example 2:**
+
+```
+Input: n = 2
+Output: 15
+Explanation: The 15 sorted strings that consist of vowels only are
+["aa","ae","ai","ao","au","ee","ei","eo","eu","ii","io","iu","oo","ou","uu"].
+Note that "ea" is not a valid string since 'e' comes after 'a' in the alphabet.
+
+```
+
+**Example 3:**
+
+```
+Input: n = 33
+Output: 66045
+
+```
+
+**Constraints:**
+
+- `1 <= n <= 50`
+
+## 题目大意
+
+给你一个整数 n，请返回长度为 n 、仅由元音 (a, e, i, o, u) 组成且按 字典序排列 的字符串数量。
+
+字符串 s 按 字典序排列 需要满足：对于所有有效的 i，s[i] 在字母表中的位置总是与 s[i+1] 相同或在 s[i+1] 之前。
+
+## 解题思路
+
+- 题目给的数据量并不大，第一个思路是利用 DFS 遍历打表法。时间复杂度 O(1)，空间复杂度 O(1)。
+- 第二个思路是利用数学中的组合公式计算结果。题目等价于假设现在有 n 个字母，要求取 4 次球（可以选择不取）将字母分为 5 堆，问有几种取法。确定了取法以后，`a`，`e`，`i`，`o`，`u`，每个字母的个数就确定了，据题意要求按照字母序排序，那么最终字符串也就确定了。现在关注解决这个组合问题就可以了。把问题再转化一次，等价于，有 n+4 个字母，取 4 次，问有几种取法。+4 代表 4 个空操作，取走它们意味着不取。根据组合的数学定义，答案为 C(n+4,4)。
+
+## 代码
+
+```go
+package leetcode
+
+// 解法一 打表
+func countVowelStrings(n int) int {
+ res := []int{1, 5, 15, 35, 70, 126, 210, 330, 495, 715, 1001, 1365, 1820, 2380, 3060, 3876, 4845, 5985, 7315, 8855, 10626, 12650, 14950, 17550, 20475, 23751, 27405, 31465, 35960, 40920, 46376, 52360, 58905, 66045, 73815, 82251, 91390, 101270, 111930, 123410, 135751, 148995, 163185, 178365, 194580, 211876, 230300, 249900, 270725, 292825, 316251}
+ return res[n]
+}
+
+func makeTable() []int {
+ res, array := 0, []int{}
+ for i := 0; i < 51; i++ {
+ countVowelStringsDFS(i, 0, []string{}, []string{"a", "e", "i", "o", "u"}, &res)
+ array = append(array, res)
+ res = 0
+ }
+ return array
+}
+
+func countVowelStringsDFS(n, index int, cur []string, vowels []string, res *int) {
+ vowels = vowels[index:]
+ if len(cur) == n {
+ (*res)++
+ return
+ }
+ for i := 0; i < len(vowels); i++ {
+ cur = append(cur, vowels[i])
+ countVowelStringsDFS(n, i, cur, vowels, res)
+ cur = cur[:len(cur)-1]
+ }
+}
+
+// 解法二 数学方法 —— 组合
+func countVowelStrings1(n int) int {
+ return (n + 1) * (n + 2) * (n + 3) * (n + 4) / 24
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1600~1699/1640.Check-Array-Formation-Through-Concatenation/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1600~1699/1642.Furthest-Building-You-Can-Reach/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/1600~1699/1642.Furthest-Building-You-Can-Reach.md b/website/content/ChapterFour/1600~1699/1642.Furthest-Building-You-Can-Reach.md
new file mode 100644
index 000000000..25a330745
--- /dev/null
+++ b/website/content/ChapterFour/1600~1699/1642.Furthest-Building-You-Can-Reach.md
@@ -0,0 +1,120 @@
+# [1642. Furthest Building You Can Reach](https://leetcode.com/problems/furthest-building-you-can-reach/)
+
+
+## 题目
+
+You are given an integer array `heights` representing the heights of buildings, some `bricks`, and some `ladders`.
+
+You start your journey from building `0` and move to the next building by possibly using bricks or ladders.
+
+While moving from building `i` to building `i+1` (**0-indexed**),
+
+- If the current building's height is **greater than or equal** to the next building's height, you do **not** need a ladder or bricks.
+- If the current building's height is **less than** the next building's height, you can either use **one ladder** or `(h[i+1] - h[i])` **bricks**.
+
+*Return the furthest building index (0-indexed) you can reach if you use the given ladders and bricks optimally.*
+
+**Example 1:**
+
+
+
+```
+Input: heights = [4,2,7,6,9,14,12], bricks = 5, ladders = 1
+Output: 4
+Explanation: Starting at building 0, you can follow these steps:
+- Go to building 1 without using ladders nor bricks since 4 >= 2.
+- Go to building 2 using 5 bricks. You must use either bricks or ladders because 2 < 7.
+- Go to building 3 without using ladders nor bricks since 7 >= 6.
+- Go to building 4 using your only ladder. You must use either bricks or ladders because 6 < 9.
+It is impossible to go beyond building 4 because you do not have any more bricks or ladders.
+
+```
+
+**Example 2:**
+
+```
+Input: heights = [4,12,2,7,3,18,20,3,19], bricks = 10, ladders = 2
+Output: 7
+
+```
+
+**Example 3:**
+
+```
+Input: heights = [14,3,19,3], bricks = 17, ladders = 0
+Output: 3
+
+```
+
+**Constraints:**
+
+- `1 <= heights.length <= 10^5`
+- `1 <= heights[i] <= 10^6`
+- `0 <= bricks <= 10^9`
+- `0 <= ladders <= heights.length`
+
+## 题目大意
+
+给你一个整数数组 heights ，表示建筑物的高度。另有一些砖块 bricks 和梯子 ladders 。你从建筑物 0 开始旅程，不断向后面的建筑物移动，期间可能会用到砖块或梯子。当从建筑物 i 移动到建筑物 i+1（下标 从 0 开始 ）时：
+
+- 如果当前建筑物的高度 大于或等于 下一建筑物的高度，则不需要梯子或砖块。
+- 如果当前建筑的高度 小于 下一个建筑的高度，您可以使用 一架梯子 或 (h[i+1] - h[i]) 个砖块
+
+如果以最佳方式使用给定的梯子和砖块，返回你可以到达的最远建筑物的下标（下标 从 0 开始 ）。
+
+## 解题思路
+
+- 这一题可能会想到贪心算法。梯子很厉害，可以无限长，所以梯子用来跨越最高的楼。遇到非最高的距离差，先用砖头。这样贪心的话不正确。例如，[1, 5, 1, 2, 3, 4, 10000] 这组数据，梯子有 1 个，4 块砖头。最大的差距在 10000 和 4 之间，贪心选择在此处用梯子。但是砖头不足以让我们走到最后两栋楼。贪心得到的结果是 3，正确的结果是 5，先用梯子，再用砖头走过 3，4，5 号楼。
+- 上面的贪心解法错误在于没有“动态”的贪心，使用梯子应该选择能爬过楼里面最高的 2 个。于是顺理成章的想到了优先队列。维护一个长度为梯子个数的最小堆，当队列中元素超过梯子个数，便将队首最小值出队，出队的这个楼与楼的差距用砖头填补。所有砖头用完了，即是可以到达的最远楼号。
+
+## 代码
+
+```go
+package leetcode
+
+import (
+ "container/heap"
+)
+
+func furthestBuilding(heights []int, bricks int, ladder int) int {
+ usedLadder := &heightDiffPQ{}
+ for i := 1; i < len(heights); i++ {
+ needbricks := heights[i] - heights[i-1]
+ if needbricks < 0 {
+ continue
+ }
+ if ladder > 0 {
+ heap.Push(usedLadder, needbricks)
+ ladder--
+ } else {
+ if len(*usedLadder) > 0 && needbricks > (*usedLadder)[0] {
+ needbricks, (*usedLadder)[0] = (*usedLadder)[0], needbricks
+ heap.Fix(usedLadder, 0)
+ }
+ if bricks -= needbricks; bricks < 0 {
+ return i - 1
+ }
+ }
+ }
+ return len(heights) - 1
+}
+
+type heightDiffPQ []int
+
+func (pq heightDiffPQ) Len() int { return len(pq) }
+func (pq heightDiffPQ) Less(i, j int) bool { return pq[i] < pq[j] }
+func (pq heightDiffPQ) Swap(i, j int) { pq[i], pq[j] = pq[j], pq[i] }
+func (pq *heightDiffPQ) Push(x interface{}) { *pq = append(*pq, x.(int)) }
+func (pq *heightDiffPQ) Pop() interface{} {
+ x := (*pq)[len(*pq)-1]
+ *pq = (*pq)[:len(*pq)-1]
+ return x
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1600~1699/1641.Count-Sorted-Vowel-Strings/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1600~1699/1646.Get-Maximum-in-Generated-Array/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/1600~1699/1646.Get-Maximum-in-Generated-Array.md b/website/content/ChapterFour/1600~1699/1646.Get-Maximum-in-Generated-Array.md
new file mode 100644
index 000000000..05c63906c
--- /dev/null
+++ b/website/content/ChapterFour/1600~1699/1646.Get-Maximum-in-Generated-Array.md
@@ -0,0 +1,103 @@
+# [1646. Get Maximum in Generated Array](https://leetcode.com/problems/get-maximum-in-generated-array/)
+
+
+## 题目
+
+You are given an integer `n`. An array `nums` of length `n + 1` is generated in the following way:
+
+- `nums[0] = 0`
+- `nums[1] = 1`
+- `nums[2 * i] = nums[i]` when `2 <= 2 * i <= n`
+- `nums[2 * i + 1] = nums[i] + nums[i + 1]` when `2 <= 2 * i + 1 <= n`
+
+Return *****the **maximum** integer in the array* `nums`.
+
+**Example 1**:
+
+```
+Input: n = 7
+Output: 3
+Explanation: According to the given rules:
+ nums[0] = 0
+ nums[1] = 1
+ nums[(1 * 2) = 2] = nums[1] = 1
+ nums[(1 * 2) + 1 = 3] = nums[1] + nums[2] = 1 + 1 = 2
+ nums[(2 * 2) = 4] = nums[2] = 1
+ nums[(2 * 2) + 1 = 5] = nums[2] + nums[3] = 1 + 2 = 3
+ nums[(3 * 2) = 6] = nums[3] = 2
+ nums[(3 * 2) + 1 = 7] = nums[3] + nums[4] = 2 + 1 = 3
+Hence, nums = [0,1,1,2,1,3,2,3], and the maximum is 3.
+
+```
+
+**Example 2**:
+
+```
+Input: n = 2
+Output: 1
+Explanation: According to the given rules, the maximum between nums[0], nums[1], and nums[2] is 1.
+
+```
+
+**Example 3**:
+
+```
+Input: n = 3
+Output: 2
+Explanation: According to the given rules, the maximum between nums[0], nums[1], nums[2], and nums[3] is 2.
+
+```
+
+**Constraints**:
+
+- `0 <= n <= 100`
+
+## 题目大意
+
+给你一个整数 n 。按下述规则生成一个长度为 n + 1 的数组 nums ：
+
+- nums[0] = 0
+- nums[1] = 1
+- 当 2 <= 2 * i <= n 时，nums[2 * i] = nums[i]
+- 当 2 <= 2 * i + 1 <= n 时，nums[2 * i + 1] = nums[i] + nums[i + 1]
+
+返回生成数组 nums 中的 最大值。
+
+## 解题思路
+
+- 给出一个 n + 1 的数组，并按照生成规则生成这个数组，求出这个数组中的最大值。
+- 简单题，按照题意生成数组，边生成边记录和更新最大值即可。
+- 注意边界条件，当 n 为 0 的时候，数组里面只有一个元素 0 。
+
+## 代码
+
+```go
+package leetcode
+
+func getMaximumGenerated(n int) int {
+ if n == 0 {
+ return 0
+ }
+ nums, max := make([]int, n+1), 0
+ nums[0], nums[1] = 0, 1
+ for i := 0; i <= n; i++ {
+ if nums[i] > max {
+ max = nums[i]
+ }
+ if 2*i >= 2 && 2*i <= n {
+ nums[2*i] = nums[i]
+ }
+ if 2*i+1 >= 2 && 2*i+1 <= n {
+ nums[2*i+1] = nums[i] + nums[i+1]
+ }
+ }
+ return max
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1600~1699/1642.Furthest-Building-You-Can-Reach/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1600~1699/1647.Minimum-Deletions-to-Make-Character-Frequencies-Unique/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/1600~1699/1647.Minimum-Deletions-to-Make-Character-Frequencies-Unique.md b/website/content/ChapterFour/1600~1699/1647.Minimum-Deletions-to-Make-Character-Frequencies-Unique.md
new file mode 100644
index 000000000..738cb9175
--- /dev/null
+++ b/website/content/ChapterFour/1600~1699/1647.Minimum-Deletions-to-Make-Character-Frequencies-Unique.md
@@ -0,0 +1,96 @@
+# [1647. Minimum Deletions to Make Character Frequencies Unique](https://leetcode.com/problems/minimum-deletions-to-make-character-frequencies-unique/)
+
+
+## 题目
+
+A string `s` is called **good** if there are no two different characters in `s` that have the same **frequency**.
+
+Given a string `s`, return *the **minimum** number of characters you need to delete to make* `s` ***good**.*
+
+The **frequency** of a character in a string is the number of times it appears in the string. For example, in the string `"aab"`, the **frequency** of `'a'` is `2`, while the **frequency** of `'b'` is `1`.
+
+**Example 1**:
+
+```
+Input: s = "aab"
+Output: 0
+Explanation: s is already good.
+
+```
+
+**Example 2**:
+
+```
+Input: s = "aaabbbcc"
+Output: 2
+Explanation: You can delete two 'b's resulting in the good string "aaabcc".
+Another way it to delete one 'b' and one 'c' resulting in the good string "aaabbc".
+```
+
+**Example 3**:
+
+```
+Input: s = "ceabaacb"
+Output: 2
+Explanation: You can delete both 'c's resulting in the good string "eabaab".
+Note that we only care about characters that are still in the string at the end (i.e. frequency of 0 is ignored).
+
+```
+
+**Constraints**:
+
+- `1 <= s.length <= 105`
+- `s` contains only lowercase English letters.
+
+## 题目大意
+
+如果字符串 s 中 不存在 两个不同字符 频次 相同的情况，就称 s 是 优质字符串 。
+
+给你一个字符串 s，返回使 s 成为优质字符串需要删除的最小字符数。
+
+字符串中字符的 频次 是该字符在字符串中的出现次数。例如，在字符串 "aab" 中，'a' 的频次是 2，而 'b' 的频次是 1 。
+
+**提示：**
+
+- `1 <= s.length <= 105`
+- `s` 仅含小写英文字母
+
+## 解题思路
+
+- 给出一个字符串 s，要求输出使 s 变成“优质字符串”需要删除的最小字符数。“优质字符串”的定义是：字符串 s 中不存在频次相同的两个不同字符。
+- 首先将 26 个字母在字符串中的频次分别统计出来，然后把频次从大到小排列，从频次大的开始，依次调整：例如，假设前一个和后一个频次相等，就把前一个字符删除一个，频次减一，再次排序，如果频次还相等，继续调整，如果频次不同了，游标往后移，继续调整后面的频次。直到所有的频次都不同了，就可以输出最终结果了。
+- 这里需要注意频次为 0 的情况，即字母都被删光了。频次为 0 以后，就不需要再比较了。
+
+## 代码
+
+```go
+package leetcode
+
+import (
+ "sort"
+)
+
+func minDeletions(s string) int {
+ frequency, res := make([]int, 26), 0
+ for i := 0; i < len(s); i++ {
+ frequency[s[i]-'a']++
+ }
+ sort.Sort(sort.Reverse(sort.IntSlice(frequency)))
+ for i := 1; i <= 25; i++ {
+ if frequency[i] == frequency[i-1] && frequency[i] != 0 {
+ res++
+ frequency[i]--
+ sort.Sort(sort.Reverse(sort.IntSlice(frequency)))
+ i--
+ }
+ }
+ return res
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1600~1699/1646.Get-Maximum-in-Generated-Array/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1600~1699/1648.Sell-Diminishing-Valued-Colored-Balls/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/1600~1699/1648.Sell-Diminishing-Valued-Colored-Balls.md b/website/content/ChapterFour/1600~1699/1648.Sell-Diminishing-Valued-Colored-Balls.md
new file mode 100644
index 000000000..a341c7c9e
--- /dev/null
+++ b/website/content/ChapterFour/1600~1699/1648.Sell-Diminishing-Valued-Colored-Balls.md
@@ -0,0 +1,138 @@
+# [1648. Sell Diminishing-Valued Colored Balls](https://leetcode.com/problems/sell-diminishing-valued-colored-balls/)
+
+
+## 题目
+
+You have an `inventory` of different colored balls, and there is a customer that wants `orders` balls of **any** color.
+
+The customer weirdly values the colored balls. Each colored ball's value is the number of balls **of that color** you currently have in your `inventory`. For example, if you own `6` yellow balls, the customer would pay `6` for the first yellow ball. After the transaction, there are only `5` yellow balls left, so the next yellow ball is then valued at `5` (i.e., the value of the balls decreases as you sell more to the customer).
+
+You are given an integer array, `inventory`, where `inventory[i]` represents the number of balls of the `ith` color that you initially own. You are also given an integer `orders`, which represents the total number of balls that the customer wants. You can sell the balls **in any order**.
+
+Return *the **maximum** total value that you can attain after selling* `orders` *colored balls*. As the answer may be too large, return it **modulo** `109 + 7`.
+
+**Example 1**:
+
+
+
+```
+Input: inventory = [2,5], orders = 4
+Output: 14
+Explanation: Sell the 1st color 1 time (2) and the 2nd color 3 times (5 + 4 + 3).
+The maximum total value is 2 + 5 + 4 + 3 = 14.
+
+```
+
+**Example 2**:
+
+```
+Input: inventory = [3,5], orders = 6
+Output: 19
+Explanation: Sell the 1st color 2 times (3 + 2) and the 2nd color 4 times (5 + 4 + 3 + 2).
+The maximum total value is 3 + 2 + 5 + 4 + 3 + 2 = 19.
+```
+
+**Example 3**:
+
+```
+Input: inventory = [2,8,4,10,6], orders = 20
+Output: 110
+```
+
+**Example 4**:
+
+```
+Input: inventory = [1000000000], orders = 1000000000
+Output: 21
+Explanation: Sell the 1st color 1000000000 times for a total value of 500000000500000000. 500000000500000000 modulo 109 + 7 = 21.
+```
+
+**Constraints**:
+
+- `1 <= inventory.length <= 10^5`
+- `1 <= inventory[i] <= 10^9`
+- `1 <= orders <= min(sum(inventory[i]), 10^9)`
+
+## 题目大意
+
+你有一些球的库存 inventory ，里面包含着不同颜色的球。一个顾客想要 任意颜色 总数为 orders 的球。这位顾客有一种特殊的方式衡量球的价值：每个球的价值是目前剩下的 同色球 的数目。比方说还剩下 6 个黄球，那么顾客买第一个黄球的时候该黄球的价值为 6 。这笔交易以后，只剩下 5 个黄球了，所以下一个黄球的价值为 5 （也就是球的价值随着顾客购买同色球是递减的）
+
+给你整数数组 inventory ，其中 inventory[i] 表示第 i 种颜色球一开始的数目。同时给你整数 orders ，表示顾客总共想买的球数目。你可以按照 任意顺序 卖球。请你返回卖了 orders 个球以后 最大 总价值之和。由于答案可能会很大，请你返回答案对 109 + 7 取余数 的结果。
+
+提示：
+
+- 1 <= inventory.length <= 10^5
+- 1 <= inventory[i] <= 10^9
+- 1 <= orders <= min(sum(inventory[i]), 10^9)
+
+## 解题思路
+
+- 给出一个 `inventory` 数组和 `orders` 次操作，要求输出数组中前 `orders` 大个元素累加和。需要注意的是，每累加一个元素 `inventory[i]`，这个元素都会减一，下次再累加的时候，需要选取更新以后的数组的最大值。
+- 拿到这个题目以后很容易想到优先队列，建立大根堆以后，`pop` 出当前最大值 `maxItem`，累加，以后把 `maxItem` 减一再 `push` 回去。循环执行 `orders` 次以后即是最终结果。题目是这个意思，但是我们不能这么写代码，因为题目条件里面给出了 `orders` 的数据大小。orders 最大为 10^9。按照优先队列的这个方法一定会超时，时间复杂度为 O(orders⋅logn)。那就换一个思路。优先队列这个思路中，重复操作了 `orders` 次，其实在这些操作中，有一些是没有必要的废操作。这些大量的“废”操作导致了超时。试想，在 `orders` 次操作中，能否合并 `n` 个 `pop` 操作，一口气先 `pop` 掉 `n` 个前 `n` 大的数呢？这个是可行的，因为每次 `pop` 出去，元素都只会减一，这个是非常有规律的。
+- 为了接下来的描述更加清晰易懂，还需要再定义 1 个值， `thresholdValue` 为操作 `n` 次以后，当前 `inventory` 数组的最大值。关于 `thresholdValue` 的理解，这里要说明一下。 `thresholdValue` 的来源有 2 种，一种是本来数组里面就有这个值，还有一种来源是 `inventory[i]` 元素减少到了 `thresholdValue` 这个值。举个例子：原始数组是 [2,3,3,4,5]，`orders` = 4，取 4 次以后，剩下的数组是 [2,2,3,3,3]。3 个 3 里面其中一个 3 就来自于 `4-1=3`，或者 `5-2=3`。
+- 用二分搜索在 [0，max(`inventory`)] 区间内找到这个 `thresholdValue` 值，能满足下列不等式的最小 `thresholdValue` 值：
+ {{< katex display >}}
+ \sum_{inventory[i]\geqslant thresholdValue}^{} \left ( inventory[i] - thresholdValue \right )\leqslant orders
+ {{< /katex >}}
+ `thresholdValue` 越小，不等式左边的值越大，随着 `thresholdValue` 的增大，不等式左边的值越来越小，直到刚刚能小于等于 `orders`。求出了 `thresholdValue` 值以后，还需要再判断有多少值等于 `thresholdValue - 1` 值了。
+
+ 
+
+- 还是举上面的例子，原始数组是 [2,3,3,4,5]，`orders` = 4，我们可以求得 `thresholdValue` = 3 。`inventory[i]` > `thresholdValue` 的那部分 100% 的要取走，`thresholdValue` 就像一个水平面，突出水平面的那些都要拿走，每列的值按照等差数列求和公式计算即可。但是 `orders` - `thresholdValue` = 1，说明水平面以下还要拿走一个，即 `thresholdValue` 线下的虚线框里面的那 4 个球，还需要任意取走一个。最后总的结果是这 2 部分的总和，( ( 5 + 4 ) + 4 ) + 3 = 16 。
+
+## 代码
+
+```go
+package leetcode
+
+import (
+ "container/heap"
+)
+
+// 解法一 贪心 + 二分搜索
+func maxProfit(inventory []int, orders int) int {
+ maxItem, thresholdValue, count, res, mod := 0, -1, 0, 0, 1000000007
+ for i := 0; i < len(inventory); i++ {
+ if inventory[i] > maxItem {
+ maxItem = inventory[i]
+ }
+ }
+ low, high := 0, maxItem
+ for low <= high {
+ mid := low + ((high - low) >> 1)
+ for i := 0; i < len(inventory); i++ {
+ count += max(inventory[i]-mid, 0)
+ }
+ if count <= orders {
+ thresholdValue = mid
+ high = mid - 1
+ } else {
+ low = mid + 1
+ }
+ count = 0
+ }
+ count = 0
+ for i := 0; i < len(inventory); i++ {
+ count += max(inventory[i]-thresholdValue, 0)
+ }
+ count = orders - count
+ for i := 0; i < len(inventory); i++ {
+ if inventory[i] >= thresholdValue {
+ if count > 0 {
+ res += (thresholdValue + inventory[i]) * (inventory[i] - thresholdValue + 1) / 2
+ count--
+ } else {
+ res += (thresholdValue + 1 + inventory[i]) * (inventory[i] - thresholdValue) / 2
+ }
+ }
+ }
+ return res % mod
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1600~1699/1647.Minimum-Deletions-to-Make-Character-Frequencies-Unique/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1600~1699/1649.Create-Sorted-Array-through-Instructions/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/1600~1699/1649.Create-Sorted-Array-through-Instructions.md b/website/content/ChapterFour/1600~1699/1649.Create-Sorted-Array-through-Instructions.md
new file mode 100644
index 000000000..cdd804681
--- /dev/null
+++ b/website/content/ChapterFour/1600~1699/1649.Create-Sorted-Array-through-Instructions.md
@@ -0,0 +1,156 @@
+# [1649. Create Sorted Array through Instructions](https://leetcode.com/problems/create-sorted-array-through-instructions/)
+
+## 题目
+
+Given an integer array `instructions`, you are asked to create a sorted array from the elements in `instructions`. You start with an empty container `nums`. For each element from **left to right** in `instructions`, insert it into `nums`. The **cost** of each insertion is the **minimum** of the following:
+
+- The number of elements currently in `nums` that are **strictly less than** `instructions[i]`.
+- The number of elements currently in `nums` that are **strictly greater than** `instructions[i]`.
+
+For example, if inserting element `3` into `nums = [1,2,3,5]`, the **cost** of insertion is `min(2, 1)` (elements `1` and `2` are less than `3`, element `5` is greater than `3`) and `nums` will become `[1,2,3,3,5]`.
+
+Return *the **total cost** to insert all elements from* `instructions` *into* `nums`. Since the answer may be large, return it **modulo** `10^9 + 7`
+
+**Example 1**:
+
+```
+Input: instructions = [1,5,6,2]
+Output: 1
+Explanation: Begin with nums = [].
+Insert 1 with cost min(0, 0) = 0, now nums = [1].
+Insert 5 with cost min(1, 0) = 0, now nums = [1,5].
+Insert 6 with cost min(2, 0) = 0, now nums = [1,5,6].
+Insert 2 with cost min(1, 2) = 1, now nums = [1,2,5,6].
+The total cost is 0 + 0 + 0 + 1 = 1.
+```
+
+**Example 2**:
+
+```
+Input: instructions = [1,2,3,6,5,4]
+Output: 3
+Explanation: Begin with nums = [].
+Insert 1 with cost min(0, 0) = 0, now nums = [1].
+Insert 2 with cost min(1, 0) = 0, now nums = [1,2].
+Insert 3 with cost min(2, 0) = 0, now nums = [1,2,3].
+Insert 6 with cost min(3, 0) = 0, now nums = [1,2,3,6].
+Insert 5 with cost min(3, 1) = 1, now nums = [1,2,3,5,6].
+Insert 4 with cost min(3, 2) = 2, now nums = [1,2,3,4,5,6].
+The total cost is 0 + 0 + 0 + 0 + 1 + 2 = 3.
+```
+
+**Example 3**:
+
+```
+Input: instructions = [1,3,3,3,2,4,2,1,2]
+Output: 4
+Explanation: Begin with nums = [].
+Insert 1 with cost min(0, 0) = 0, now nums = [1].
+Insert 3 with cost min(1, 0) = 0, now nums = [1,3].
+Insert 3 with cost min(1, 0) = 0, now nums = [1,3,3].
+Insert 3 with cost min(1, 0) = 0, now nums = [1,3,3,3].
+Insert 2 with cost min(1, 3) = 1, now nums = [1,2,3,3,3].
+Insert 4 with cost min(5, 0) = 0, now nums = [1,2,3,3,3,4].
+Insert 2 with cost min(1, 4) = 1, now nums = [1,2,2,3,3,3,4].
+Insert 1 with cost min(0, 6) = 0, now nums = [1,1,2,2,3,3,3,4].
+Insert 2 with cost min(2, 4) = 2, now nums = [1,1,2,2,2,3,3,3,4].
+The total cost is 0 + 0 + 0 + 0 + 1 + 0 + 1 + 0 + 2 = 4.
+```
+
+**Constraints**:
+
+- `1 <= instructions.length <= 105`
+- `1 <= instructions[i] <= 105`
+
+## 题目大意
+
+给你一个整数数组 instructions ，你需要根据 instructions 中的元素创建一个有序数组。一开始你有一个空的数组 nums ，你需要 从左到右 遍历 instructions 中的元素，将它们依次插入 nums 数组中。每一次插入操作的 代价 是以下两者的 较小值 ：
+
+- nums 中 严格小于 instructions[i] 的数字数目。
+- nums 中 严格大于 instructions[i] 的数字数目。
+
+比方说，如果要将 3 插入到 nums = [1,2,3,5] ，那么插入操作的 代价 为 min(2, 1) (元素 1 和 2 小于 3 ，元素 5 大于 3 ），插入后 nums 变成 [1,2,3,3,5] 。请你返回将 instructions 中所有元素依次插入 nums 后的 总最小代价 。由于答案会很大，请将它对 10^9 + 7 取余 后返回。
+
+## 解题思路
+
+- 给出一个数组，要求将其中的元素从头开始往另外一个空数组中插入，每次插入前，累加代价值 cost = min(**strictly less than**, **strictly greater than**)。最后输出累加值。
+- 这一题虽然是 Hard 题，但是读完题以后就可以判定这是模板题了。可以用线段树和树状数组来解决。这里简单说说线段树的思路吧，先将待插入的数组排序，获得总的区间。每次循环做 4 步：2 次 `query` 分别得到 `strictlyLessThan` 和 `strictlyGreaterThan` ，再比较出两者中的最小值累加，最后一步就是 `update`。
+- 由于题目给的数据比较大，所以建立线段树之前记得要先离散化。这一题核心代码不超过 10 行，其他的都是模板代码。具体实现见代码。
+
+## 代码
+
+```go
+package leetcode
+
+import (
+ "sort"
+
+ "github.com/halfrost/leetcode-go/template"
+)
+
+// 解法一 树状数组 Binary Indexed Tree
+func createSortedArray(instructions []int) int {
+ bit, res := template.BinaryIndexedTree{}, 0
+ bit.Init(100001)
+ for i, v := range instructions {
+ less := bit.Query(v - 1)
+ greater := i - bit.Query(v)
+ res = (res + min(less, greater)) % (1e9 + 7)
+ bit.Add(v, 1)
+ }
+ return res
+}
+
+// 解法二 线段树 SegmentTree
+func createSortedArray1(instructions []int) int {
+ if len(instructions) == 0 {
+ return 0
+ }
+ st, res, mod := template.SegmentCountTree{}, 0, 1000000007
+ numsMap, numsArray, tmpArray := discretization1649(instructions)
+ // 初始化线段树，节点内的值都赋值为 0，即计数为 0
+ st.Init(tmpArray, func(i, j int) int {
+ return 0
+ })
+ for i := 0; i < len(instructions); i++ {
+ strictlyLessThan := st.Query(0, numsMap[instructions[i]]-1)
+ strictlyGreaterThan := st.Query(numsMap[instructions[i]]+1, numsArray[len(numsArray)-1])
+ res = (res + min(strictlyLessThan, strictlyGreaterThan)) % mod
+ st.UpdateCount(numsMap[instructions[i]])
+ }
+ return res
+}
+
+func discretization1649(instructions []int) (map[int]int, []int, []int) {
+ tmpArray, numsArray, numsMap := []int{}, []int{}, map[int]int{}
+ for i := 0; i < len(instructions); i++ {
+ numsMap[instructions[i]] = instructions[i]
+ }
+ for _, v := range numsMap {
+ numsArray = append(numsArray, v)
+ }
+ sort.Ints(numsArray)
+ for i, num := range numsArray {
+ numsMap[num] = i
+ }
+ for i := range numsArray {
+ tmpArray = append(tmpArray, i)
+ }
+ return numsMap, numsArray, tmpArray
+}
+
+func min(a int, b int) int {
+ if a > b {
+ return b
+ }
+ return a
+}
+
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1600~1699/1648.Sell-Diminishing-Valued-Colored-Balls/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1600~1699/1652.Defuse-the-Bomb/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/1600~1699/1652.Defuse-the-Bomb.md b/website/content/ChapterFour/1600~1699/1652.Defuse-the-Bomb.md
new file mode 100644
index 000000000..8f5dc35f7
--- /dev/null
+++ b/website/content/ChapterFour/1600~1699/1652.Defuse-the-Bomb.md
@@ -0,0 +1,132 @@
+# [1652. Defuse the Bomb](https://leetcode.com/problems/defuse-the-bomb/)
+
+
+## 题目
+
+You have a bomb to defuse, and your time is running out! Your informer will provide you with a **circular** array `code` of length of `n` and a key `k`.
+
+To decrypt the code, you must replace every number. All the numbers are replaced **simultaneously**.
+
+- If `k > 0`, replace the `ith` number with the sum of the **next** `k` numbers.
+- If `k < 0`, replace the `ith` number with the sum of the **previous** `k` numbers.
+- If `k == 0`, replace the `ith` number with `0`.
+
+As `code` is circular, the next element of `code[n-1]` is `code[0]`, and the previous element of `code[0]` is `code[n-1]`.
+
+Given the **circular** array `code` and an integer key `k`, return *the decrypted code to defuse the bomb*!
+
+**Example 1**:
+
+```
+Input: code = [5,7,1,4], k = 3
+Output: [12,10,16,13]
+Explanation: Each number is replaced by the sum of the next 3 numbers. The decrypted code is [7+1+4, 1+4+5, 4+5+7, 5+7+1]. Notice that the numbers wrap around.
+```
+
+**Example 2**:
+
+```
+Input: code = [1,2,3,4], k = 0
+Output: [0,0,0,0]
+Explanation: When k is zero, the numbers are replaced by 0.
+```
+
+**Example 3**:
+
+```
+Input: code = [2,4,9,3], k = -2
+Output: [12,5,6,13]
+Explanation: The decrypted code is [3+9, 2+3, 4+2, 9+4]. Notice that the numbers wrap around again. If k is negative, the sum is of the previous numbers.
+```
+
+**Constraints**:
+
+- `n == code.length`
+- `1 <= n <= 100`
+- `1 <= code[i] <= 100`
+- `(n - 1) <= k <= n - 1`
+
+## 题目大意
+
+你有一个炸弹需要拆除，时间紧迫！你的情报员会给你一个长度为 n 的 循环 数组 code 以及一个密钥 k 。为了获得正确的密码，你需要替换掉每一个数字。所有数字会 同时 被替换。
+
+- 如果 k > 0 ，将第 i 个数字用 接下来 k 个数字之和替换。
+- 如果 k < 0 ，将第 i 个数字用 之前 k 个数字之和替换。
+- 如果 k == 0 ，将第 i 个数字用 0 替换。
+
+由于 code 是循环的， code[n-1] 下一个元素是 code[0] ，且 code[0] 前一个元素是 code[n-1] 。
+
+给你 循环 数组 code 和整数密钥 k ，请你返回解密后的结果来拆除炸弹！
+
+## 解题思路
+
+- 给出一个 code 数组，要求按照规则替换每个字母。
+- 简单题，按照题意描述循环即可。
+
+## 代码
+
+```go
+package leetcode
+
+func decrypt(code []int, k int) []int {
+ if k == 0 {
+ for i := 0; i < len(code); i++ {
+ code[i] = 0
+ }
+ return code
+ }
+ count, sum, res := k, 0, make([]int, len(code))
+ if k > 0 {
+ for i := 0; i < len(code); i++ {
+ for j := i + 1; j < len(code); j++ {
+ if count == 0 {
+ break
+ }
+ sum += code[j]
+ count--
+ }
+ if count > 0 {
+ for j := 0; j < len(code); j++ {
+ if count == 0 {
+ break
+ }
+ sum += code[j]
+ count--
+ }
+ }
+ res[i] = sum
+ sum, count = 0, k
+ }
+ }
+ if k < 0 {
+ for i := 0; i < len(code); i++ {
+ for j := i - 1; j >= 0; j-- {
+ if count == 0 {
+ break
+ }
+ sum += code[j]
+ count++
+ }
+ if count < 0 {
+ for j := len(code) - 1; j >= 0; j-- {
+ if count == 0 {
+ break
+ }
+ sum += code[j]
+ count++
+ }
+ }
+ res[i] = sum
+ sum, count = 0, k
+ }
+ }
+ return res
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1600~1699/1649.Create-Sorted-Array-through-Instructions/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1600~1699/1653.Minimum-Deletions-to-Make-String-Balanced/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/1600~1699/1653.Minimum-Deletions-to-Make-String-Balanced.md b/website/content/ChapterFour/1600~1699/1653.Minimum-Deletions-to-Make-String-Balanced.md
new file mode 100644
index 000000000..15d8427ea
--- /dev/null
+++ b/website/content/ChapterFour/1600~1699/1653.Minimum-Deletions-to-Make-String-Balanced.md
@@ -0,0 +1,97 @@
+# [1653. Minimum Deletions to Make String Balanced](https://leetcode.com/problems/minimum-deletions-to-make-string-balanced/)
+
+
+## 题目
+
+You are given a string `s` consisting only of characters `'a'` and `'b'`.
+
+You can delete any number of characters in `s` to make `s` **balanced**. `s` is **balanced** if there is no pair of indices `(i,j)` such that `i < j` and `s[i] = 'b'` and `s[j]= 'a'`.
+
+Return *the **minimum** number of deletions needed to make* `s` ***balanced***.
+
+**Example 1**:
+
+```
+Input: s = "aababbab"
+Output: 2
+Explanation: You can either:
+Delete the characters at 0-indexed positions 2 and 6 ("aababbab" -> "aaabbb"), or
+Delete the characters at 0-indexed positions 3 and 6 ("aababbab" -> "aabbbb").
+```
+
+**Example 2**:
+
+```
+Input: s = "bbaaaaabb"
+Output: 2
+Explanation: The only solution is to delete the first two characters.
+```
+
+**Constraints**:
+
+- `1 <= s.length <= 105`
+- `s[i]` is `'a'` or `'b'`.
+
+## 题目大意
+
+给你一个字符串 s ，它仅包含字符 'a' 和 'b' 。你可以删除 s 中任意数目的字符，使得 s 平衡 。我们称 s 平衡的 当不存在下标对 (i,j) 满足 i < j 且 s[i] = 'b' 同时 s[j]= 'a' 。请你返回使 s 平衡 的 最少 删除次数。
+
+## 解题思路
+
+- 给定一个字符串，要求删除最少次数，使得字母 a 都排在字母 b 的前面。
+- 很容易想到的一个解题思路是 DP。定义 `dp[i]` 为字符串下标 [ 0, i ] 这个区间内使得字符串平衡的最少删除次数。当 `s[i] == 'a'` 的时候，有 2 种情况，一种是 `s[i]` 前面全是 `[aa……aa]` 的情况，这个时候只需要把其中的所有的字母 `b` 删除即可。还有一种情况是 `s[i]` 前面有字母 `a` 也有字母 `b`，即 `[aaa……abb……b]`，这种情况就需要考虑 `dp[i-1]` 了。当前字母是 `a`，那么肯定要删除字母 `a`，来维持前面有一段字母 `b` 的情况。当 `s[i] == 'b'` 的时候，不管是 `[aa……aa]` 这种情况，还是 `[aaa……abb……b]` 这种情况，当前字母 `b` 都可以直接附加在后面，也能保证整个字符串是平衡的。所以状态转移方程为 `dp[i+1] = min(dp[i] + 1, bCount), s[i] == 'a'`，`dp[i+1] = dp[i], s[i] == 'b'`。最终答案存在 `dp[n]` 中。由于前后项的递推关系中只用到一次前一项，所以我们还可以优化一下空间，用一个变量保存前一项的结果。优化以后的代码见解法一。
+- 这一题还有一个模拟的思路。题目要求找到最小删除字数，那么就是要找到一个“临界点”，在这个临界点的左边删除所有的字母 b，在这个临界点的右边删除所有的字母 a。在所有的“临界点”中找到删除最少的次数。代码实现见解法二。
+
+## 代码
+
+```go
+package leetcode
+
+// 解法一 DP
+func minimumDeletions(s string) int {
+ prev, res, bCount := 0, 0, 0
+ for _, c := range s {
+ if c == 'a' {
+ res = min(prev+1, bCount)
+ prev = res
+ } else {
+ bCount++
+ }
+ }
+ return res
+}
+
+func min(a, b int) int {
+ if a < b {
+ return a
+ }
+ return b
+}
+
+// 解法二 模拟
+func minimumDeletions1(s string) int {
+ aCount, bCount, res := 0, 0, 0
+ for i := 0; i < len(s); i++ {
+ if s[i] == 'a' {
+ aCount++
+ }
+ }
+ res = aCount
+ for i := 0; i < len(s); i++ {
+ if s[i] == 'a' {
+ aCount--
+ } else {
+ bCount++
+ }
+ res = min(res, aCount+bCount)
+ }
+ return res
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1600~1699/1652.Defuse-the-Bomb/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1600~1699/1654.Minimum-Jumps-to-Reach-Home/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/1600~1699/1654.Minimum-Jumps-to-Reach-Home.md b/website/content/ChapterFour/1600~1699/1654.Minimum-Jumps-to-Reach-Home.md
new file mode 100644
index 000000000..bc5f9a413
--- /dev/null
+++ b/website/content/ChapterFour/1600~1699/1654.Minimum-Jumps-to-Reach-Home.md
@@ -0,0 +1,108 @@
+# [1654. Minimum Jumps to Reach Home](https://leetcode.com/problems/minimum-jumps-to-reach-home/)
+
+
+## 题目
+
+A certain bug's home is on the x-axis at position `x`. Help them get there from position `0`.
+
+The bug jumps according to the following rules:
+
+- It can jump exactly `a` positions **forward** (to the right).
+- It can jump exactly `b` positions **backward** (to the left).
+- It cannot jump backward twice in a row.
+- It cannot jump to any `forbidden` positions.
+
+The bug may jump forward **beyond** its home, but it **cannot jump** to positions numbered with **negative** integers.
+
+Given an array of integers `forbidden`, where `forbidden[i]` means that the bug cannot jump to the position `forbidden[i]`, and integers `a`, `b`, and `x`, return *the minimum number of jumps needed for the bug to reach its home*. If there is no possible sequence of jumps that lands the bug on position `x`, return `1.`
+
+**Example 1**:
+
+```
+Input: forbidden = [14,4,18,1,15], a = 3, b = 15, x = 9
+Output: 3
+Explanation: 3 jumps forward (0 -> 3 -> 6 -> 9) will get the bug home.
+```
+
+**Example 2**:
+
+```
+Input: forbidden = [8,3,16,6,12,20], a = 15, b = 13, x = 11
+Output: -1
+```
+
+**Example 3**:
+
+```
+Input: forbidden = [1,6,2,14,5,17,4], a = 16, b = 9, x = 7
+Output: 2
+Explanation: One jump forward (0 -> 16) then one jump backward (16 -> 7) will get the bug home.
+
+```
+
+**Constraints**:
+
+- `1 <= forbidden.length <= 1000`
+- `1 <= a, b, forbidden[i] <= 2000`
+- `0 <= x <= 2000`
+- All the elements in `forbidden` are distinct.
+- Position `x` is not forbidden.
+
+## 题目大意
+
+有一只跳蚤的家在数轴上的位置 x 处。请你帮助它从位置 0 出发，到达它的家。
+
+跳蚤跳跃的规则如下：
+
+- 它可以 往前 跳恰好 a 个位置（即往右跳）。
+- 它可以 往后 跳恰好 b 个位置（即往左跳）。
+- 它不能 连续 往后跳 2 次。
+- 它不能跳到任何 forbidden 数组中的位置。
+
+跳蚤可以往前跳 超过 它的家的位置，但是它 不能跳到负整数 的位置。给你一个整数数组 forbidden ，其中 forbidden[i] 是跳蚤不能跳到的位置，同时给你整数 a， b 和 x ，请你返回跳蚤到家的最少跳跃次数。如果没有恰好到达 x 的可行方案，请你返回 -1 。
+
+## 解题思路
+
+- 给出坐标 x ，可以往前跳的步长 a，往后跳的步长 b。要求输出能跳回家的最少跳跃次数。
+- 求最少跳跃次数，思路用 BFS 求解，最先到达坐标 x 的方案即是最少跳跃次数。对`forbidden` 的处理是把记忆化数组里面把他们标记为 true。禁止连续往后跳 2 次的限制，要求我们在 BFS 入队的时候再记录一下跳跃方向，每次往后跳的时候判断前一跳是否是往后跳，如果是往后跳，此次就不能往后跳了。
+
+## 代码
+
+```go
+package leetcode
+
+func minimumJumps(forbidden []int, a int, b int, x int) int {
+ visited := make([]bool, 6000)
+ for i := range forbidden {
+ visited[forbidden[i]] = true
+ }
+ queue, res := [][2]int{{0, 0}}, -1
+ for len(queue) > 0 {
+ length := len(queue)
+ res++
+ for i := 0; i < length; i++ {
+ cur, isBack := queue[i][0], queue[i][1]
+ if cur == x {
+ return res
+ }
+ if isBack == 0 && cur-b > 0 && !visited[cur-b] {
+ visited[cur-b] = true
+ queue = append(queue, [2]int{cur - b, 1})
+ }
+ if cur+a < len(visited) && !visited[cur+a] {
+ visited[cur+a] = true
+ queue = append(queue, [2]int{cur + a, 0})
+ }
+ }
+ queue = queue[length:]
+ }
+ return -1
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1600~1699/1653.Minimum-Deletions-to-Make-String-Balanced/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1600~1699/1655.Distribute-Repeating-Integers/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/1600~1699/1655.Distribute-Repeating-Integers.md b/website/content/ChapterFour/1600~1699/1655.Distribute-Repeating-Integers.md
new file mode 100644
index 000000000..ca4122a86
--- /dev/null
+++ b/website/content/ChapterFour/1600~1699/1655.Distribute-Repeating-Integers.md
@@ -0,0 +1,119 @@
+# [1655. Distribute Repeating Integers](https://leetcode.com/problems/distribute-repeating-integers/)
+
+
+## 题目
+
+You are given an array of `n` integers, `nums`, where there are at most `50` unique values in the array. You are also given an array of `m` customer order quantities, `quantity`, where `quantity[i]` is the amount of integers the `ith` customer ordered. Determine if it is possible to distribute `nums` such that:
+
+- The `ith` customer gets **exactly** `quantity[i]` integers,
+- The integers the `ith` customer gets are **all equal**, and
+- Every customer is satisfied.
+
+Return `true` *if it is possible to distribute* `nums` *according to the above conditions*.
+
+**Example 1**:
+
+```
+Input: nums = [1,2,3,4], quantity = [2]
+Output: false
+Explanation: The 0th customer cannot be given two different integers.
+```
+
+**Example 2**:
+
+```
+Input: nums = [1,2,3,3], quantity = [2]
+Output: true
+Explanation: The 0th customer is given [3,3]. The integers [1,2] are not used.
+```
+
+**Example 3**:
+
+```
+Input: nums = [1,1,2,2], quantity = [2,2]
+Output: true
+Explanation: The 0th customer is given [1,1], and the 1st customer is given [2,2].
+```
+
+**Example 4**:
+
+```
+Input: nums = [1,1,2,3], quantity = [2,2]
+Output: false
+Explanation: Although the 0th customer could be given [1,1], the 1st customer cannot be satisfied.
+```
+
+**Example 5**:
+
+```
+Input: nums = [1,1,1,1,1], quantity = [2,3]
+Output: true
+Explanation: The 0th customer is given [1,1], and the 1st customer is given [1,1,1].
+```
+
+**Constraints**:
+
+- `n == nums.length`
+- `1 <= n <= 105`
+- `1 <= nums[i] <= 1000`
+- `m == quantity.length`
+- `1 <= m <= 10`
+- `1 <= quantity[i] <= 105`
+- There are at most `50` unique values in `nums`.
+
+## 题目大意
+
+给你一个长度为 n 的整数数组 nums ，这个数组中至多有 50 个不同的值。同时你有 m 个顾客的订单 quantity ，其中，整数 quantity[i] 是第 i 位顾客订单的数目。请你判断是否能将 nums 中的整数分配给这些顾客，且满足：
+
+- 第 i 位顾客 恰好 有 quantity[i] 个整数。
+- 第 i 位顾客拿到的整数都是 相同的 。
+- 每位顾客都满足上述两个要求。
+
+如果你可以分配 nums 中的整数满足上面的要求，那么请返回 true ，否则返回 false 。
+
+## 解题思路
+
+- 给定一个数组 nums，订单数组 quantity，要求按照订单满足顾客的需求。如果能满足输出 true，不能满足输出 false。
+- 用 DFS 记忆化暴力搜索。代码实现不难。（不知道此题为什么是 Hard）
+
+## 代码
+
+```go
+package leetcode
+
+func canDistribute(nums []int, quantity []int) bool {
+ freq := make(map[int]int)
+ for _, n := range nums {
+ freq[n]++
+ }
+ return dfs(freq, quantity)
+}
+
+func dfs(freq map[int]int, quantity []int) bool {
+ if len(quantity) == 0 {
+ return true
+ }
+ visited := make(map[int]bool)
+ for i := range freq {
+ if visited[freq[i]] {
+ continue
+ }
+ visited[freq[i]] = true
+ if freq[i] >= quantity[0] {
+ freq[i] -= quantity[0]
+ if dfs(freq, quantity[1:]) {
+ return true
+ }
+ freq[i] += quantity[0]
+ }
+ }
+ return false
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1600~1699/1654.Minimum-Jumps-to-Reach-Home/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1600~1699/1656.Design-an-Ordered-Stream/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/1600~1699/1656.Design-an-Ordered-Stream.md b/website/content/ChapterFour/1600~1699/1656.Design-an-Ordered-Stream.md
new file mode 100644
index 000000000..d71767f07
--- /dev/null
+++ b/website/content/ChapterFour/1600~1699/1656.Design-an-Ordered-Stream.md
@@ -0,0 +1,113 @@
+# [1656. Design an Ordered Stream](https://leetcode.com/problems/design-an-ordered-stream/)
+
+## 题目
+
+There is a stream of `n` `(id, value)` pairs arriving in an **arbitrary** order, where `id` is an integer between `1` and `n` and `value` is a string. No two pairs have the same `id`.
+
+Design a stream that returns the values in **increasing order of their IDs** by returning a **chunk** (list) of values after each insertion. The concatenation of all the **chunks** should result in a list of the sorted values.
+
+Implement the `OrderedStream` class:
+
+- `OrderedStream(int n)` Constructs the stream to take `n` values.
+- `String[] insert(int id, String value)` Inserts the pair `(id, value)` into the stream, then returns the **largest possible chunk** of currently inserted values that appear next in the order.
+
+**Example**:
+
+
+
+```
+Input
+["OrderedStream", "insert", "insert", "insert", "insert", "insert"]
+[[5], [3, "ccccc"], [1, "aaaaa"], [2, "bbbbb"], [5, "eeeee"], [4, "ddddd"]]
+Output
+[null, [], ["aaaaa"], ["bbbbb", "ccccc"], [], ["ddddd", "eeeee"]]
+
+Explanation
+// Note that the values ordered by ID is ["aaaaa", "bbbbb", "ccccc", "ddddd", "eeeee"].
+OrderedStream os = new OrderedStream(5);
+os.insert(3, "ccccc"); // Inserts (3, "ccccc"), returns [].
+os.insert(1, "aaaaa"); // Inserts (1, "aaaaa"), returns ["aaaaa"].
+os.insert(2, "bbbbb"); // Inserts (2, "bbbbb"), returns ["bbbbb", "ccccc"].
+os.insert(5, "eeeee"); // Inserts (5, "eeeee"), returns [].
+os.insert(4, "ddddd"); // Inserts (4, "ddddd"), returns ["ddddd", "eeeee"].
+// Concatentating all the chunks returned:
+// [] + ["aaaaa"] + ["bbbbb", "ccccc"] + [] + ["ddddd", "eeeee"] = ["aaaaa", "bbbbb", "ccccc", "ddddd", "eeeee"]
+// The resulting order is the same as the order above.
+
+```
+
+**Constraints**:
+
+- `1 <= n <= 1000`
+- `1 <= id <= n`
+- `value.length == 5`
+- `value` consists only of lowercase letters.
+- Each call to `insert` will have a unique `id.`
+- Exactly `n` calls will be made to `insert`.
+
+## 题目大意
+
+有 n 个 (id, value) 对，其中 id 是 1 到 n 之间的一个整数，value 是一个字符串。不存在 id 相同的两个 (id, value) 对。
+
+设计一个流，以 任意 顺序获取 n 个 (id, value) 对，并在多次调用时 按 id 递增的顺序 返回一些值。
+
+实现 OrderedStream 类：
+
+- OrderedStream(int n) 构造一个能接收 n 个值的流，并将当前指针 ptr 设为 1 。
+- String[] insert(int id, String value) 向流中存储新的 (id, value) 对。存储后：
+如果流存储有 id = ptr 的 (id, value) 对，则找出从 id = ptr 开始的 最长 id 连续递增序列 ，并 按顺序 返回与这些 id 关联的值的列表。然后，将 ptr 更新为最后那个 id + 1 。
+否则，返回一个空列表。
+
+## 解题思路
+
+- 设计一个具有插入操作的 Ordered Stream。insert 操作先在指定位置插入 value，然后返回当前指针 ptr 到最近一个空位置的最长连续递增字符串。如果字符串不为空，ptr 移动到非空 value 的后一个下标位置处。
+- 简单题。按照题目描述模拟即可。注意控制好 ptr 的位置。
+
+## 代码
+
+```go
+package leetcode
+
+type OrderedStream struct {
+ ptr int
+ stream []string
+}
+
+func Constructor(n int) OrderedStream {
+ ptr, stream := 1, make([]string, n+1)
+ return OrderedStream{ptr: ptr, stream: stream}
+}
+
+func (this *OrderedStream) Insert(id int, value string) []string {
+ this.stream[id] = value
+ res := []string{}
+ if this.ptr == id || this.stream[this.ptr] != "" {
+ res = append(res, this.stream[this.ptr])
+ for i := id + 1; i < len(this.stream); i++ {
+ if this.stream[i] != "" {
+ res = append(res, this.stream[i])
+ } else {
+ this.ptr = i
+ return res
+ }
+ }
+ }
+ if len(res) > 0 {
+ return res
+ }
+ return []string{}
+}
+
+/**
+ * Your OrderedStream object will be instantiated and called as such:
+ * obj := Constructor(n);
+ * param_1 := obj.Insert(id,value);
+ */
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1600~1699/1655.Distribute-Repeating-Integers/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1600~1699/1657.Determine-if-Two-Strings-Are-Close/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/1600~1699/1657.Determine-if-Two-Strings-Are-Close.md b/website/content/ChapterFour/1600~1699/1657.Determine-if-Two-Strings-Are-Close.md
new file mode 100644
index 000000000..c36f7fa20
--- /dev/null
+++ b/website/content/ChapterFour/1600~1699/1657.Determine-if-Two-Strings-Are-Close.md
@@ -0,0 +1,121 @@
+# [1657. Determine if Two Strings Are Close](https://leetcode.com/problems/determine-if-two-strings-are-close/)
+
+
+## 题目
+
+Two strings are considered **close** if you can attain one from the other using the following operations:
+
+- Operation 1: Swap any two **existing** characters.
+ - For example, `abcde -> aecdb`
+- Operation 2: Transform **every** occurrence of one **existing** character into another **existing** character, and do the same with the other character.
+ - For example, `aacabb -> bbcbaa` (all `a`'s turn into `b`'s, and all `b`'s turn into `a`'s)
+
+You can use the operations on either string as many times as necessary.
+
+Given two strings, `word1` and `word2`, return `true` *if* `word1` *and* `word2` *are **close**, and* `false` *otherwise.*
+
+**Example 1**:
+
+```
+Input: word1 = "abc", word2 = "bca"
+Output: true
+Explanation: You can attain word2 from word1 in 2 operations.
+Apply Operation 1: "abc" -> "acb"
+Apply Operation 1: "acb" -> "bca"
+
+```
+
+**Example 2**:
+
+```
+Input: word1 = "a", word2 = "aa"
+Output: false
+Explanation: It is impossible to attain word2 from word1, or vice versa, in any number of operations.
+
+```
+
+**Example 3**:
+
+```
+Input: word1 = "cabbba", word2 = "abbccc"
+Output: true
+Explanation: You can attain word2 from word1 in 3 operations.
+Apply Operation 1: "cabbba" -> "caabbb"
+Apply Operation 2: "caabbb" -> "baaccc"
+Apply Operation 2: "baaccc" -> "abbccc"
+
+```
+
+**Example 4**:
+
+```
+Input: word1 = "cabbba", word2 = "aabbss"
+Output: false
+Explanation: It is impossible to attain word2 from word1, or vice versa, in any amount of operations.
+
+```
+
+**Constraints**:
+
+- `1 <= word1.length, word2.length <= 105`
+- `word1` and `word2` contain only lowercase English letters.
+
+## 题目大意
+
+如果可以使用以下操作从一个字符串得到另一个字符串，则认为两个字符串 接近 ：
+
+- 操作 1：交换任意两个 现有 字符。例如，abcde -> aecdb
+- 操作 2：将一个 现有 字符的每次出现转换为另一个 现有 字符，并对另一个字符执行相同的操作。例如，aacabb -> bbcbaa（所有 a 转化为 b ，而所有的 b 转换为 a ）
+
+你可以根据需要对任意一个字符串多次使用这两种操作。给你两个字符串，word1 和 word2 。如果 word1 和 word2 接近 ，就返回 true ；否则，返回 false 。
+
+## 解题思路
+
+- 判断 2 个字符串是否“接近”。“接近”的定义是能否通过交换 2 个字符或者 2 个字母互换，从一个字符串变换成另外一个字符串，如果存在这样的变换，即是“接近”。
+- 先统计 2 个字符串的 26 个字母的频次，如果频次有不相同的，直接返回 false。在频次相同的情况下，再从小到大排序，再次扫描判断频次是否相同。
+- 注意几种特殊情况：频次相同，再判断字母交换是否合法存在，如果字母不存在，输出 false。例如测试文件中的 case 5 。出现频次个数相同，但是频次不同。例如测试文件中的 case 6 。
+
+## 代码
+
+```go
+package leetcode
+
+import (
+ "sort"
+)
+
+func closeStrings(word1 string, word2 string) bool {
+ if len(word1) != len(word2) {
+ return false
+ }
+ freqCount1, freqCount2 := make([]int, 26), make([]int, 26)
+ for _, c := range word1 {
+ freqCount1[c-97]++
+ }
+ for _, c := range word2 {
+ freqCount2[c-97]++
+ }
+ for i := 0; i < 26; i++ {
+ if (freqCount1[i] == freqCount2[i]) ||
+ (freqCount1[i] > 0 && freqCount2[i] > 0) {
+ continue
+ }
+ return false
+ }
+ sort.Ints(freqCount1)
+ sort.Ints(freqCount2)
+ for i := 0; i < 26; i++ {
+ if freqCount1[i] != freqCount2[i] {
+ return false
+ }
+ }
+ return true
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1600~1699/1656.Design-an-Ordered-Stream/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1600~1699/1658.Minimum-Operations-to-Reduce-X-to-Zero/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/1600~1699/1658.Minimum-Operations-to-Reduce-X-to-Zero.md b/website/content/ChapterFour/1600~1699/1658.Minimum-Operations-to-Reduce-X-to-Zero.md
new file mode 100644
index 000000000..021824d22
--- /dev/null
+++ b/website/content/ChapterFour/1600~1699/1658.Minimum-Operations-to-Reduce-X-to-Zero.md
@@ -0,0 +1,103 @@
+# [1658. Minimum Operations to Reduce X to Zero](https://leetcode.com/problems/minimum-operations-to-reduce-x-to-zero/)
+
+
+## 题目
+
+You are given an integer array `nums` and an integer `x`. In one operation, you can either remove the leftmost or the rightmost element from the array `nums` and subtract its value from `x`. Note that this **modifies** the array for future operations.
+
+Return *the **minimum number** of operations to reduce* `x` *to **exactly*** `0` *if it's possible, otherwise, return* `1`.
+
+**Example 1**:
+
+```
+Input: nums = [1,1,4,2,3], x = 5
+Output: 2
+Explanation: The optimal solution is to remove the last two elements to reduce x to zero.
+
+```
+
+**Example 2**:
+
+```
+Input: nums = [5,6,7,8,9], x = 4
+Output: -1
+
+```
+
+**Example 3**:
+
+```
+Input: nums = [3,2,20,1,1,3], x = 10
+Output: 5
+Explanation: The optimal solution is to remove the last three elements and the first two elements (5 operations in total) to reduce x to zero.
+
+```
+
+**Constraints**:
+
+- `1 <= nums.length <= 105`
+- `1 <= nums[i] <= 104`
+- `1 <= x <= 109`
+
+## 题目大意
+
+给你一个整数数组 nums 和一个整数 x 。每一次操作时，你应当移除数组 nums 最左边或最右边的元素，然后从 x 中减去该元素的值。请注意，需要 修改 数组以供接下来的操作使用。如果可以将 x 恰好 减到 0 ，返回 最小操作数 ；否则，返回 -1 。
+
+## 解题思路
+
+- 给定一个数组 nums 和一个整数 x，要求从数组两端分别移除一些数，使得这些数加起来正好等于整数 x，要求输出最小操作数。
+- 要求输出最小操作数，即数组两头的数字个数最少，并且加起来和正好等于整数 x。由于在数组的两头，用 2 个指针分别操作不太方便。我当时解题的时候的思路是把它变成循环数组，这样两边的指针就在一个区间内了。利用滑动窗口找到一个最小的窗口，使得窗口内的累加和等于整数 k。这个方法可行，但是代码挺多的。
+- 有没有更优美的方法呢？有的。要想两头的长度最少，也就是中间这段的长度最大。这样就转换成直接在数组上使用滑动窗口求解，累加和等于一个固定值的连续最长的子数组。
+- 和这道题类似思路的题目，209，1040(循环数组)，325。强烈推荐这 3 题。
+
+## 代码
+
+```go
+package leetcode
+
+func minOperations(nums []int, x int) int {
+ total := 0
+ for _, n := range nums {
+ total += n
+ }
+ target := total - x
+ if target < 0 {
+ return -1
+ }
+ if target == 0 {
+ return len(nums)
+ }
+ left, right, sum, res := 0, 0, 0, -1
+ for right < len(nums) {
+ if sum < target {
+ sum += nums[right]
+ right++
+ }
+ for sum >= target {
+ if sum == target {
+ res = max(res, right-left)
+ }
+ sum -= nums[left]
+ left++
+ }
+ }
+ if res == -1 {
+ return -1
+ }
+ return len(nums) - res
+}
+
+func max(a, b int) int {
+ if a > b {
+ return a
+ }
+ return b
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1600~1699/1657.Determine-if-Two-Strings-Are-Close/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1600~1699/1659.Maximize-Grid-Happiness/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/1600~1699/1659.Maximize-Grid-Happiness.md b/website/content/ChapterFour/1600~1699/1659.Maximize-Grid-Happiness.md
new file mode 100644
index 000000000..049e5fcf1
--- /dev/null
+++ b/website/content/ChapterFour/1600~1699/1659.Maximize-Grid-Happiness.md
@@ -0,0 +1,192 @@
+# [1659. Maximize Grid Happiness](https://leetcode.com/problems/maximize-grid-happiness/)
+
+## 题目
+
+You are given four integers, `m`, `n`, `introvertsCount`, and `extrovertsCount`. You have an `m x n` grid, and there are two types of people: introverts and extroverts. There are `introvertsCount` introverts and `extrovertsCount` extroverts.
+
+You should decide how many people you want to live in the grid and assign each of them one grid cell. Note that you **do not** have to have all the people living in the grid.
+
+The **happiness** of each person is calculated as follows:
+
+- Introverts **start** with `120` happiness and **lose** `30` happiness for each neighbor (introvert or extrovert).
+- Extroverts **start** with `40` happiness and **gain** `20` happiness for each neighbor (introvert or extrovert).
+
+Neighbors live in the directly adjacent cells north, east, south, and west of a person's cell.
+
+The **grid happiness** is the **sum** of each person's happiness. Return *the **maximum possible grid happiness**.*
+
+**Example 1**:
+
+
+
+```
+Input: m = 2, n = 3, introvertsCount = 1, extrovertsCount = 2
+Output: 240
+Explanation: Assume the grid is 1-indexed with coordinates (row, column).
+We can put the introvert in cell (1,1) and put the extroverts in cells (1,3) and (2,3).
+- Introvert at (1,1) happiness: 120 (starting happiness) - (0 * 30) (0 neighbors) = 120
+- Extrovert at (1,3) happiness: 40 (starting happiness) + (1 * 20) (1 neighbor) = 60
+- Extrovert at (2,3) happiness: 40 (starting happiness) + (1 * 20) (1 neighbor) = 60
+The grid happiness is 120 + 60 + 60 = 240.
+The above figure shows the grid in this example with each person's happiness. The introvert stays in the light green cell while the extroverts live on the light purple cells.
+```
+
+**Example 2**:
+
+```
+Input: m = 3, n = 1, introvertsCount = 2, extrovertsCount = 1
+Output: 260
+Explanation: Place the two introverts in (1,1) and (3,1) and the extrovert at (2,1).
+- Introvert at (1,1) happiness: 120 (starting happiness) - (1 * 30) (1 neighbor) = 90
+- Extrovert at (2,1) happiness: 40 (starting happiness) + (2 * 20) (2 neighbors) = 80
+- Introvert at (3,1) happiness: 120 (starting happiness) - (1 * 30) (1 neighbor) = 90
+The grid happiness is 90 + 80 + 90 = 260.
+```
+
+**Example 3**:
+
+```
+Input: m = 2, n = 2, introvertsCount = 4, extrovertsCount = 0
+Output: 240
+```
+
+**Constraints**:
+
+- `1 <= m, n <= 5`
+- `0 <= introvertsCount, extrovertsCount <= min(m * n, 6)`
+
+## 题目大意
+
+给你四个整数 m、n、introvertsCount 和 extrovertsCount 。有一个 m x n 网格，和两种类型的人：内向的人和外向的人。总共有 introvertsCount 个内向的人和 extrovertsCount 个外向的人。请你决定网格中应当居住多少人，并为每个人分配一个网格单元。 注意，不必 让所有人都生活在网格中。每个人的 幸福感 计算如下：
+
+- 内向的人 开始 时有 120 个幸福感，但每存在一个邻居（内向的或外向的）他都会 失去 30 个幸福感。
+- 外向的人 开始 时有 40 个幸福感，每存在一个邻居（内向的或外向的）他都会 得到 20 个幸福感。
+
+邻居是指居住在一个人所在单元的上、下、左、右四个直接相邻的单元中的其他人。网格幸福感 是每个人幸福感的 总和 。 返回 最大可能的网格幸福感 。
+
+## 解题思路
+
+- 给出 `m` x `n` 网格和两种人，要求如何安排这两种人能使得网格的得分最大。两种人有各自的初始分，相邻可能会加分也有可能减分。
+- 这一题状态很多。首先每个格子有 3 种状态，那么每一行有 3^6 = 729 种不同的状态。每行行内分数变化值可能是 -60(两个内向)，+40(两个外向)，-10(一个内向一个外向)。两行行间分数变化值可能是 -60(两个内向)，+40(两个外向)，-10(一个内向一个外向)。那么我们可以把每行的状态压缩成一个三进制，那么网格就变成了一维，每两个三进制之间的关系是行间关系，每个三进制内部还需要根据内向和外向的人数决定行内最终分数。定义 `dp[lineStatusLast][row][introvertsCount][extrovertsCount]` 代表在上一行 `row - 1` 的状态是 `lineStatusLast` 的情况下，当前枚举到了第 `row` 行，内向还有 `introvertsCount` 个人，外向还有 `extrovertsCount` 个人能获得的最大分数。状态转移方程是 `dp[lineStatusLast(row-1)][row][introvertsCount][extrovertsCount] = max{dp[lineStatusLast(row)][row+1][introvertsCount - countIC(lineStatusLast(row)) ][extrovertsCount - countEC(lineStatusLast(row)) ] + scoreInner(lineStatusLast(row)) + scoreOuter(lineStatusLast(row-1),lineStatusLast(row))}` ，这里有 2 个统计函数，`countIC` 是统计当前行状态三进制里面有多少个内向人。`countEC` 是统计当前行状态三进制里面有多少个外向人。`scoreInner` 是计算当前行状态三进制的行内分数。`scoreOuter` 是计算 `row -1` 行和 `row` 行之间的行间分数。
+- 由于这个状态转移方程的计算量是巨大的。所以需要预先初始化一些计算结果。比如把 729 中行状态分别对应的行内、行间的分数都计算好，在动态规划状态转移的时候，直接查表获取分数即可。这样我们在深搜的时候，利用 dp 的记忆化，可以大幅减少时间复杂度。
+- 题目中还提到，人数可以不用完。如果 `introvertsCount = 0`, `extrovertsCount = 0` ，即人数都用完了的情况，这时候 `dp = 0`。如果 `row = m`，即已经枚举完了所有行，那么不管剩下多少人，这一行的 `dp = 0` 。
+- 初始化的时候，注意，特殊处理 0 的情况，0 行 0 列都初始化为 -1 。
+
+## 代码
+
+```go
+package leetcode
+
+import (
+ "math"
+)
+
+func getMaxGridHappiness(m int, n int, introvertsCount int, extrovertsCount int) int {
+ // lineStatus 将每一行中 3 种状态进行编码，空白 - 0，内向人 - 1，外向人 - 2，每行状态用三进制表示
+ // lineStatusList[729][6] 每一行的三进制表示
+ // introvertsCountInner[729] 每一个 lineStatus 包含的内向人数
+ // extrovertsCountInner[729] 每一个 lineStatus 包含的外向人数
+ // scoreInner[729] 每一个 lineStatus 包含的行内得分（只统计 lineStatus 本身的得分，不包括它与上一行的）
+ // scoreOuter[729][729] 每一个 lineStatus 包含的行外得分
+ // dp[上一行的 lineStatus][当前处理到的行][剩余的内向人数][剩余的外向人数]
+ n3, lineStatus, introvertsCountInner, extrovertsCountInner, scoreInner, scoreOuter, lineStatusList, dp := math.Pow(3.0, float64(n)), 0, [729]int{}, [729]int{}, [729]int{}, [729][729]int{}, [729][6]int{}, [729][6][7][7]int{}
+ for i := 0; i < 729; i++ {
+ lineStatusList[i] = [6]int{}
+ }
+ for i := 0; i < 729; i++ {
+ dp[i] = [6][7][7]int{}
+ for j := 0; j < 6; j++ {
+ dp[i][j] = [7][7]int{}
+ for k := 0; k < 7; k++ {
+ dp[i][j][k] = [7]int{-1, -1, -1, -1, -1, -1, -1}
+ }
+ }
+ }
+ // 预处理
+ for lineStatus = 0; lineStatus < int(n3); lineStatus++ {
+ tmp := lineStatus
+ for i := 0; i < n; i++ {
+ lineStatusList[lineStatus][i] = tmp % 3
+ tmp /= 3
+ }
+ introvertsCountInner[lineStatus], extrovertsCountInner[lineStatus], scoreInner[lineStatus] = 0, 0, 0
+ for i := 0; i < n; i++ {
+ if lineStatusList[lineStatus][i] != 0 {
+ // 个人分数
+ if lineStatusList[lineStatus][i] == 1 {
+ introvertsCountInner[lineStatus]++
+ scoreInner[lineStatus] += 120
+ } else if lineStatusList[lineStatus][i] == 2 {
+ extrovertsCountInner[lineStatus]++
+ scoreInner[lineStatus] += 40
+ }
+ // 行内分数
+ if i-1 >= 0 {
+ scoreInner[lineStatus] += closeScore(lineStatusList[lineStatus][i], lineStatusList[lineStatus][i-1])
+ }
+ }
+ }
+ }
+ // 行外分数
+ for lineStatus0 := 0; lineStatus0 < int(n3); lineStatus0++ {
+ for lineStatus1 := 0; lineStatus1 < int(n3); lineStatus1++ {
+ scoreOuter[lineStatus0][lineStatus1] = 0
+ for i := 0; i < n; i++ {
+ scoreOuter[lineStatus0][lineStatus1] += closeScore(lineStatusList[lineStatus0][i], lineStatusList[lineStatus1][i])
+ }
+ }
+ }
+ return dfs(0, 0, introvertsCount, extrovertsCount, m, int(n3), &dp, &introvertsCountInner, &extrovertsCountInner, &scoreInner, &scoreOuter)
+}
+
+// 如果 x 和 y 相邻，需要加上的分数
+func closeScore(x, y int) int {
+ if x == 0 || y == 0 {
+ return 0
+ }
+ // 两个内向的人，每个人要 -30，一共 -60
+ if x == 1 && y == 1 {
+ return -60
+ }
+ if x == 2 && y == 2 {
+ return 40
+ }
+ return -10
+}
+
+// dfs(上一行的 lineStatus，当前处理到的行，剩余的内向人数，剩余的外向人数）
+func dfs(lineStatusLast, row, introvertsCount, extrovertsCount, m, n3 int, dp *[729][6][7][7]int, introvertsCountInner, extrovertsCountInner, scoreInner *[729]int, scoreOuter *[729][729]int) int {
+ // 边界条件：如果已经处理完，或者没有人了
+ if row == m || introvertsCount+extrovertsCount == 0 {
+ return 0
+ }
+ // 记忆化
+ if dp[lineStatusLast][row][introvertsCount][extrovertsCount] != -1 {
+ return dp[lineStatusLast][row][introvertsCount][extrovertsCount]
+ }
+ best := 0
+ for lineStatus := 0; lineStatus < n3; lineStatus++ {
+ if introvertsCountInner[lineStatus] > introvertsCount || extrovertsCountInner[lineStatus] > extrovertsCount {
+ continue
+ }
+ score := scoreInner[lineStatus] + scoreOuter[lineStatus][lineStatusLast]
+ best = max(best, score+dfs(lineStatus, row+1, introvertsCount-introvertsCountInner[lineStatus], extrovertsCount-extrovertsCountInner[lineStatus], m, n3, dp, introvertsCountInner, extrovertsCountInner, scoreInner, scoreOuter))
+ }
+ dp[lineStatusLast][row][introvertsCount][extrovertsCount] = best
+ return best
+}
+
+func max(a int, b int) int {
+ if a > b {
+ return a
+ }
+ return b
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1600~1699/1658.Minimum-Operations-to-Reduce-X-to-Zero/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1600~1699/1662.Check-If-Two-String-Arrays-are-Equivalent/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/1600~1699/1662.Check-If-Two-String-Arrays-are-Equivalent.md b/website/content/ChapterFour/1600~1699/1662.Check-If-Two-String-Arrays-are-Equivalent.md
new file mode 100644
index 000000000..4b99dc3eb
--- /dev/null
+++ b/website/content/ChapterFour/1600~1699/1662.Check-If-Two-String-Arrays-are-Equivalent.md
@@ -0,0 +1,72 @@
+# [1662. Check If Two String Arrays are Equivalent](https://leetcode.com/problems/check-if-two-string-arrays-are-equivalent/)
+
+
+## 题目
+
+Given two string arrays `word1` and `word2`, return **`true` *if the two arrays **represent** the same string, and* `false` *otherwise.*
+
+A string is **represented** by an array if the array elements concatenated **in order** forms the string.
+
+**Example 1**:
+
+```
+Input: word1 = ["ab", "c"], word2 = ["a", "bc"]
+Output: true
+Explanation:
+word1 represents string "ab" + "c" -> "abc"
+word2 represents string "a" + "bc" -> "abc"
+The strings are the same, so return true.
+```
+
+**Example 2**:
+
+```
+Input: word1 = ["a", "cb"], word2 = ["ab", "c"]
+Output: false
+```
+
+**Example 3**:
+
+```
+Input: word1 = ["abc", "d", "defg"], word2 = ["abcddefg"]
+Output: true
+```
+
+**Constraints**:
+
+- `1 <= word1.length, word2.length <= 103`
+- `1 <= word1[i].length, word2[i].length <= 103`
+- `1 <= sum(word1[i].length), sum(word2[i].length) <= 103`
+- `word1[i]` and `word2[i]` consist of lowercase letters.
+
+## 题目大意
+
+给你两个字符串数组 word1 和 word2 。如果两个数组表示的字符串相同，返回 true ；否则，返回 false 。数组表示的字符串 是由数组中的所有元素 按顺序 连接形成的字符串。
+
+## 解题思路
+
+- 简单题，依次拼接 2 个数组内的字符串，然后比较 str1 和 str2 是否相同即可。
+
+## 代码
+
+```go
+package leetcode
+
+func arrayStringsAreEqual(word1 []string, word2 []string) bool {
+ str1, str2 := "", ""
+ for i := 0; i < len(word1); i++ {
+ str1 += word1[i]
+ }
+ for i := 0; i < len(word2); i++ {
+ str2 += word2[i]
+ }
+ return str1 == str2
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1600~1699/1659.Maximize-Grid-Happiness/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1600~1699/1663.Smallest-String-With-A-Given-Numeric-Value/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/1600~1699/1663.Smallest-String-With-A-Given-Numeric-Value.md b/website/content/ChapterFour/1600~1699/1663.Smallest-String-With-A-Given-Numeric-Value.md
new file mode 100644
index 000000000..b373c410f
--- /dev/null
+++ b/website/content/ChapterFour/1600~1699/1663.Smallest-String-With-A-Given-Numeric-Value.md
@@ -0,0 +1,109 @@
+# [1663. Smallest String With A Given Numeric Value](https://leetcode.com/problems/smallest-string-with-a-given-numeric-value/)
+
+## 题目
+
+The **numeric value** of a **lowercase character** is defined as its position `(1-indexed)` in the alphabet, so the numeric value of `a` is `1`, the numeric value of `b` is `2`, the numeric value of `c` is `3`, and so on.
+
+The **numeric value** of a **string** consisting of lowercase characters is defined as the sum of its characters' numeric values. For example, the numeric value of the string `"abe"` is equal to `1 + 2 + 5 = 8`.
+
+You are given two integers `n` and `k`. Return *the **lexicographically smallest string** with **length** equal to `n` and **numeric value** equal to `k`.*
+
+Note that a string `x` is lexicographically smaller than string `y` if `x` comes before `y` in dictionary order, that is, either `x` is a prefix of `y`, or if `i` is the first position such that `x[i] != y[i]`, then `x[i]` comes before `y[i]` in alphabetic order.
+
+**Example 1**:
+
+```
+Input: n = 3, k = 27
+Output: "aay"
+Explanation: The numeric value of the string is 1 + 1 + 25 = 27, and it is the smallest string with such a value and length equal to 3.
+```
+
+**Example 2**:
+
+```
+Input: n = 5, k = 73
+Output: "aaszz"
+```
+
+**Constraints**:
+
+- `1 <= n <= 105`
+- `n <= k <= 26 * n`
+
+## 题目大意
+
+小写字符 的 数值 是它在字母表中的位置（从 1 开始），因此 a 的数值为 1 ，b 的数值为 2 ，c 的数值为 3 ，以此类推。字符串由若干小写字符组成，字符串的数值 为各字符的数值之和。例如，字符串 "abe" 的数值等于 1 + 2 + 5 = 8 。给你两个整数 n 和 k 。返回 长度 等于 n 且 数值 等于 k 的 字典序最小 的字符串。注意，如果字符串 x 在字典排序中位于 y 之前，就认为 x 字典序比 y 小，有以下两种情况：
+
+- x 是 y 的一个前缀；
+- 如果 i 是 x[i] != y[i] 的第一个位置，且 x[i] 在字母表中的位置比 y[i] 靠前。
+
+## 解题思路
+
+- 给出 n 和 k，要求找到字符串长度为 n，字母在字母表内位置总和为 k 的最小字典序字符串。
+- 这一题笔者读完题，比赛的时候直接用 DFS 撸了一版。赛后看了时间复杂度马马虎虎，感觉还有优化的空间。DFS 会遍历出所有的解，实际上这一题只要求最小字典序，所以 DFS 剪枝的时候要加上判断字典序的判断，如果新添加进来的字母比已经保存的字符串的相应位置上的字母字典序大，那么就直接 return，这个答案一定不会是最小字典序。代码见解法二
+- 想到这里，其实 DFS 不必要，直接用 for 循环就可找到最小字典序的字符串。代码见解法一。
+
+## 代码
+
+```go
+package leetcode
+
+// 解法一 贪心
+func getSmallestString(n int, k int) string {
+ str, i, j := make([]byte, n), 0, 0
+ for i = n-1; i <= k-26; i, k = i-1, k-26 {
+ str[i] = 'z'
+ }
+ if i >= 0 {
+ str[i] = byte('a' + k-1-i)
+ for ; j < i; j++ {
+ str[j] = 'a'
+ }
+ }
+ return string(str)
+}
+
+// 解法二 DFS
+func getSmallestString1(n int, k int) string {
+ if n == 0 {
+ return ""
+ }
+ res, c := "", []byte{}
+ findSmallestString(0, n, k, 0, c, &res)
+ return res
+}
+
+func findSmallestString(value int, length, k, index int, str []byte, res *string) {
+ if len(str) == length && value == k {
+ tmp := string(str)
+ if (*res) == "" {
+ *res = tmp
+ }
+ if tmp < *res && *res != "" {
+ *res = tmp
+ }
+ return
+ }
+ if len(str) >= index && (*res) != "" && str[index-1] > (*res)[index-1] {
+ return
+ }
+ for j := 0; j < 26; j++ {
+ if k-value > (length-len(str))*26 || value > k {
+ return
+ }
+ str = append(str, byte(int('a')+j))
+ value += j + 1
+ findSmallestString(value, length, k, index+1, str, res)
+ str = str[:len(str)-1]
+ value -= j + 1
+
+ }
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1600~1699/1662.Check-If-Two-String-Arrays-are-Equivalent/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1600~1699/1664.Ways-to-Make-a-Fair-Array/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/1600~1699/1664.Ways-to-Make-a-Fair-Array.md b/website/content/ChapterFour/1600~1699/1664.Ways-to-Make-a-Fair-Array.md
new file mode 100644
index 000000000..1c6076177
--- /dev/null
+++ b/website/content/ChapterFour/1600~1699/1664.Ways-to-Make-a-Fair-Array.md
@@ -0,0 +1,123 @@
+# [1664. Ways to Make a Fair Array](https://leetcode.com/problems/ways-to-make-a-fair-array/)
+
+
+## 题目
+
+You are given an integer array `nums`. You can choose **exactly one** index (**0-indexed**) and remove the element. Notice that the index of the elements may change after the removal.
+
+For example, if `nums = [6,1,7,4,1]`:
+
+- Choosing to remove index `1` results in `nums = [6,7,4,1]`.
+- Choosing to remove index `2` results in `nums = [6,1,4,1]`.
+- Choosing to remove index `4` results in `nums = [6,1,7,4]`.
+
+An array is **fair** if the sum of the odd-indexed values equals the sum of the even-indexed values.
+
+Return the ***number** of indices that you could choose such that after the removal,* `nums` *is **fair**.*
+
+**Example 1**:
+
+```
+Input: nums = [2,1,6,4]
+Output: 1
+Explanation:
+Remove index 0: [1,6,4] -> Even sum: 1 + 4 = 5. Odd sum: 6. Not fair.
+Remove index 1: [2,6,4] -> Even sum: 2 + 4 = 6. Odd sum: 6. Fair.
+Remove index 2: [2,1,4] -> Even sum: 2 + 4 = 6. Odd sum: 1. Not fair.
+Remove index 3: [2,1,6] -> Even sum: 2 + 6 = 8. Odd sum: 1. Not fair.
+There is 1 index that you can remove to make nums fair.
+```
+
+**Example 2**:
+
+```
+Input: nums = [1,1,1]
+Output: 3
+Explanation: You can remove any index and the remaining array is fair.
+```
+
+**Example 3**:
+
+```
+Input: nums = [1,2,3]
+Output: 0
+Explanation: You cannot make a fair array after removing any index.
+```
+
+**Constraints**:
+
+- `1 <= nums.length <= 105`
+- `1 <= nums[i] <= 104`
+
+## 题目大意
+
+给你一个整数数组 nums 。你需要选择 恰好 一个下标（下标从 0 开始）并删除对应的元素。请注意剩下元素的下标可能会因为删除操作而发生改变。
+
+比方说，如果 nums = [6,1,7,4,1] ，那么：
+
+- 选择删除下标 1 ，剩下的数组为 nums = [6,7,4,1] 。
+- 选择删除下标 2 ，剩下的数组为 nums = [6,1,4,1] 。
+- 选择删除下标 4 ，剩下的数组为 nums = [6,1,7,4] 。
+
+如果一个数组满足奇数下标元素的和与偶数下标元素的和相等，该数组就是一个 平衡数组 。请你返回删除操作后，剩下的数组 nums 是 平衡数组 的 方案数 。
+
+## 解题思路
+
+- 给定一个数组 nums，要求输出仅删除一个元素以后能使得整个数组平衡的方案数。平衡的定义是奇数下标元素总和等于偶数下标元素总和。
+- 这一题如果暴力解答，会超时。原因是每次删除元素以后，都重新计算奇偶数位总和比较耗时。应该利用前面计算过的累加和，推导出此次删除元素以后的情况。这样修改以后就不超时了。具体的，如果删除的是元素是奇数位，这个下标的前缀和不变，要变化的是后面的。删除元素后面，原来偶数位的总和变成了奇数位了，原来奇数位的总和变成偶数位了。删除元素后面这半段的总和可以用前缀和计算出来，奇数位的总和减去删除元素的前缀和，就得到了删除元素后面的后缀和。通过这个办法就可以得到删除元素后面的，奇数位总和，偶数位总和。注意这个后缀和是包含了删除元素的。所以最后需要判断删除元素是奇数位还是偶数位，如果是奇数位，那么在计算出来的偶数和上再减去这个删除元素；如果是偶数位，就在计算出来的奇数和上再减去这个删除元素。代码见解法二。
+- 这一题还有一种更简洁的写法，就是解法一了。通过了解法二的思考，我们可以知道，每次变换以后的操作可以抽象出来，即三步，减去一个数，判断是否相等，再加上一个数。只不过这三步在解法二中都去判断了奇偶性。如果我们不判断奇偶性，那么代码就可以写成解法一的样子。为什么可以不用管奇偶性呢？因为每次删除一个元素以后，下次再删除，奇偶就发生颠倒了，上次的奇数和到了下次就是偶数和了。想通这一点就可以把代码写成解法一的样子。
+
+## 代码
+
+```go
+// 解法一 超简洁写法
+func waysToMakeFair(nums []int) int {
+ sum, res := [2]int{}, 0
+ for i := 0; i < len(nums); i++ {
+ sum[i%2] += nums[i]
+ }
+ for i := 0; i < len(nums); i++ {
+ sum[i%2] -= nums[i]
+ if sum[i%2] == sum[1-(i%2)] {
+ res++
+ }
+ sum[1-(i%2)] += nums[i]
+ }
+ return res
+}
+
+// 解法二 前缀和，后缀和
+func waysToMakeFair1(nums []int) int {
+ evenPrefix, oddPrefix, evenSuffix, oddSuffix, res := 0, 0, 0, 0, 0
+ for i := 0; i < len(nums); i++ {
+ if i%2 == 0 {
+ evenSuffix += nums[i]
+ } else {
+ oddSuffix += nums[i]
+ }
+ }
+ for i := 0; i < len(nums); i++ {
+ if i%2 == 0 {
+ evenSuffix -= nums[i]
+ } else {
+ oddSuffix -= nums[i]
+ }
+ if (evenPrefix + oddSuffix) == (oddPrefix + evenSuffix) {
+ res++
+ }
+ if i%2 == 0 {
+ evenPrefix += nums[i]
+ } else {
+ oddPrefix += nums[i]
+ }
+ }
+ return res
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1600~1699/1663.Smallest-String-With-A-Given-Numeric-Value/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1600~1699/1665.Minimum-Initial-Energy-to-Finish-Tasks/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/1600~1699/1665.Minimum-Initial-Energy-to-Finish-Tasks.md b/website/content/ChapterFour/1600~1699/1665.Minimum-Initial-Energy-to-Finish-Tasks.md
new file mode 100644
index 000000000..e201a20d5
--- /dev/null
+++ b/website/content/ChapterFour/1600~1699/1665.Minimum-Initial-Energy-to-Finish-Tasks.md
@@ -0,0 +1,135 @@
+# [1665. Minimum Initial Energy to Finish Tasks](https://leetcode.com/problems/minimum-initial-energy-to-finish-tasks/)
+
+## 题目
+
+You are given an array `tasks` where `tasks[i] = [actuali, minimumi]`:
+
+- `actuali` is the actual amount of energy you **spend to finish** the `ith` task.
+- `minimumi` is the minimum amount of energy you **require to begin** the `ith` task.
+
+For example, if the task is `[10, 12]` and your current energy is `11`, you cannot start this task. However, if your current energy is `13`, you can complete this task, and your energy will be `3` after finishing it.
+
+You can finish the tasks in **any order** you like.
+
+Return *the **minimum** initial amount of energy you will need* *to finish all the tasks*.
+
+**Example 1**:
+
+```
+Input: tasks = [[1,2],[2,4],[4,8]]
+Output: 8
+Explanation:
+Starting with 8 energy, we finish the tasks in the following order:
+ - 3rd task. Now energy = 8 - 4 = 4.
+ - 2nd task. Now energy = 4 - 2 = 2.
+ - 1st task. Now energy = 2 - 1 = 1.
+Notice that even though we have leftover energy, starting with 7 energy does not work because we cannot do the 3rd task.
+```
+
+**Example 2**:
+
+```
+Input: tasks = [[1,3],[2,4],[10,11],[10,12],[8,9]]
+Output: 32
+Explanation:
+Starting with 32 energy, we finish the tasks in the following order:
+ - 1st task. Now energy = 32 - 1 = 31.
+ - 2nd task. Now energy = 31 - 2 = 29.
+ - 3rd task. Now energy = 29 - 10 = 19.
+ - 4th task. Now energy = 19 - 10 = 9.
+ - 5th task. Now energy = 9 - 8 = 1.
+```
+
+**Example 3**:
+
+```
+Input: tasks = [[1,7],[2,8],[3,9],[4,10],[5,11],[6,12]]
+Output: 27
+Explanation:
+Starting with 27 energy, we finish the tasks in the following order:
+ - 5th task. Now energy = 27 - 5 = 22.
+ - 2nd task. Now energy = 22 - 2 = 20.
+ - 3rd task. Now energy = 20 - 3 = 17.
+ - 1st task. Now energy = 17 - 1 = 16.
+ - 4th task. Now energy = 16 - 4 = 12.
+ - 6th task. Now energy = 12 - 6 = 6.
+
+```
+
+**Constraints**:
+
+- `1 <= tasks.length <= 105`
+- `1 <= actuali <= minimumi <= 104`
+
+## 题目大意
+
+给你一个任务数组 tasks ，其中 tasks[i] = [actuali, minimumi] ：
+
+- actual i 是完成第 i 个任务 需要耗费 的实际能量。
+- minimum i 是开始第 i 个任务前需要达到的最低能量。
+
+比方说，如果任务为 [10, 12] 且你当前的能量为 11 ，那么你不能开始这个任务。如果你当前的能量为 13 ，你可以完成这个任务，且完成它后剩余能量为 3 。你可以按照 任意顺序 完成任务。请你返回完成所有任务的 最少 初始能量。
+
+## 解题思路
+
+- 给出一个 task 数组，每个元素代表一个任务，每个任务有实际消费能量值和开始这个任务需要的最低能量。要求输出能完成所有任务的最少初始能量。
+- 这一题直觉是贪心。先将任务按照 `minimum - actual` 进行排序。先完成差值大的任务，那么接下来的能量能最大限度的满足接下来的任务。这样可能完成所有任务的可能性越大。循环任务数组的时候，保存当前能量在 `cur` 中，如果当前能量不够开启下一个任务，那么这个差值就是需要弥补的，这些能量就是最少初始能量中的，所以加上这些差值能量。如果当前能量可以开启下一个任务，那么就更新当前能量，减去实际消耗的能量以后，再继续循环。循环结束就能得到最少初始能量了。
+
+## 代码
+
+```go
+package leetcode
+
+import (
+ "sort"
+)
+
+func minimumEffort(tasks [][]int) int {
+ sort.Sort(Task(tasks))
+ res, cur := 0, 0
+ for _, t := range tasks {
+ if t[1] > cur {
+ res += t[1] - cur
+ cur = t[1] - t[0]
+ } else {
+ cur -= t[0]
+ }
+ }
+ return res
+}
+
+func max(a, b int) int {
+ if a > b {
+ return a
+ }
+ return b
+}
+
+// Task define
+type Task [][]int
+
+func (task Task) Len() int {
+ return len(task)
+}
+
+func (task Task) Less(i, j int) bool {
+ t1, t2 := task[i][1]-task[i][0], task[j][1]-task[j][0]
+ if t1 != t2 {
+ return t2 < t1
+ }
+ return task[j][1] < task[i][1]
+}
+
+func (task Task) Swap(i, j int) {
+ t := task[i]
+ task[i] = task[j]
+ task[j] = t
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1600~1699/1664.Ways-to-Make-a-Fair-Array/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1600~1699/1668.Maximum-Repeating-Substring/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/1600~1699/1668.Maximum-Repeating-Substring.md b/website/content/ChapterFour/1600~1699/1668.Maximum-Repeating-Substring.md
new file mode 100644
index 000000000..f86e6bc16
--- /dev/null
+++ b/website/content/ChapterFour/1600~1699/1668.Maximum-Repeating-Substring.md
@@ -0,0 +1,76 @@
+# [1668. Maximum Repeating Substring](https://leetcode.com/problems/maximum-repeating-substring/)
+
+
+## 题目
+
+For a string `sequence`, a string `word` is **`k`-repeating** if `word` concatenated `k` times is a substring of `sequence`. The `word`'s **maximum `k`-repeating value** is the highest value `k` where `word` is `k`-repeating in `sequence`. If `word` is not a substring of `sequence`, `word`'s maximum `k`-repeating value is `0`.
+
+Given strings `sequence` and `word`, return *the **maximum `k`-repeating value** of `word` in `sequence`*.
+
+**Example 1**:
+
+```
+Input: sequence = "ababc", word = "ab"
+Output: 2
+Explanation: "abab" is a substring in "ababc".
+```
+
+**Example 2**:
+
+```
+Input: sequence = "ababc", word = "ba"
+Output: 1
+Explanation: "ba" is a substring in "ababc". "baba" is not a substring in "ababc".
+```
+
+**Example 3**:
+
+```
+Input: sequence = "ababc", word = "ac"
+Output: 0
+Explanation: "ac" is not a substring in "ababc".
+```
+
+**Constraints**:
+
+- `1 <= sequence.length <= 100`
+- `1 <= word.length <= 100`
+- `sequence` and `word` contains only lowercase English letters.
+
+## 题目大意
+
+给你一个字符串 sequence ，如果字符串 word 连续重复 k 次形成的字符串是 sequence 的一个子字符串，那么单词 word 的 重复值为 k 。单词 word 的 最大重复值 是单词 word 在 sequence 中最大的重复值。如果 word 不是 sequence 的子串，那么重复值 k 为 0 。给你一个字符串 sequence 和 word ，请你返回 最大重复值 k 。
+
+## 解题思路
+
+- 循环叠加构造 `word`，每次构造出新的 `word` 都在 `sequence` 查找一次，如果找到就输出叠加次数，否则继续叠加构造，直到字符串长度和 `sequence` 一样长，最终都没有找到则输出 0 。
+
+## 代码
+
+```go
+package leetcode
+
+import (
+ "strings"
+)
+
+func maxRepeating(sequence string, word string) int {
+ for i := len(sequence) / len(word); i >= 0; i-- {
+ tmp := ""
+ for j := 0; j < i; j++ {
+ tmp += word
+ }
+ if strings.Contains(sequence, tmp) {
+ return i
+ }
+ }
+ return 0
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1600~1699/1665.Minimum-Initial-Energy-to-Finish-Tasks/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1600~1699/1669.Merge-In-Between-Linked-Lists/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/1600~1699/1669.Merge-In-Between-Linked-Lists.md b/website/content/ChapterFour/1600~1699/1669.Merge-In-Between-Linked-Lists.md
new file mode 100644
index 000000000..05e4afc49
--- /dev/null
+++ b/website/content/ChapterFour/1600~1699/1669.Merge-In-Between-Linked-Lists.md
@@ -0,0 +1,82 @@
+# [1669. Merge In Between Linked Lists](https://leetcode.com/problems/merge-in-between-linked-lists/)
+
+
+## 题目
+
+You are given two linked lists: `list1` and `list2` of sizes `n` and `m` respectively.
+
+Remove `list1`'s nodes from the `ath` node to the `bth` node, and put `list2` in their place.
+
+The blue edges and nodes in the following figure incidate the result:
+
+
+
+*Build the result list and return its head.*
+
+**Example 1**:
+
+
+
+```
+Input: list1 = [0,1,2,3,4,5], a = 3, b = 4, list2 = [1000000,1000001,1000002]
+Output: [0,1,2,1000000,1000001,1000002,5]
+Explanation: We remove the nodes 3 and 4 and put the entire list2 in their place. The blue edges and nodes in the above figure indicate the result.
+
+```
+
+**Example 2**:
+
+
+
+```
+Input: list1 = [0,1,2,3,4,5,6], a = 2, b = 5, list2 = [1000000,1000001,1000002,1000003,1000004]
+Output: [0,1,1000000,1000001,1000002,1000003,1000004,6]
+Explanation: The blue edges and nodes in the above figure indicate the result.
+
+```
+
+**Constraints**:
+
+- `3 <= list1.length <= 104`
+- `1 <= a <= b < list1.length - 1`
+- `1 <= list2.length <= 104`
+
+## 题目大意
+
+给你两个链表 list1 和 list2 ，它们包含的元素分别为 n 个和 m 个。请你将 list1 中第 a 个节点到第 b 个节点删除，并将list2 接在被删除节点的位置。
+
+## 解题思路
+
+- 简单题，考查链表的基本操作。此题注意 a == b 的情况。
+
+## 代码
+
+```go
+func mergeInBetween(list1 *ListNode, a int, b int, list2 *ListNode) *ListNode {
+ n := list1
+ var startRef, endRef *ListNode
+ for i := 0; i <= b; i++ {
+ if i == a-1 {
+ startRef = n
+ }
+ if i == b {
+ endRef = n
+ }
+ n = n.Next
+ }
+ startRef.Next = list2
+ n = list2
+ for n.Next != nil {
+ n = n.Next
+ }
+ n.Next = endRef.Next
+ return list1
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1600~1699/1668.Maximum-Repeating-Substring/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1600~1699/1670.Design-Front-Middle-Back-Queue/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/1600~1699/1670.Design-Front-Middle-Back-Queue.md b/website/content/ChapterFour/1600~1699/1670.Design-Front-Middle-Back-Queue.md
new file mode 100644
index 000000000..db98ab366
--- /dev/null
+++ b/website/content/ChapterFour/1600~1699/1670.Design-Front-Middle-Back-Queue.md
@@ -0,0 +1,179 @@
+# [1670. Design Front Middle Back Queue](https://leetcode.com/problems/design-front-middle-back-queue/)
+
+
+## 题目
+
+Design a queue that supports `push` and `pop` operations in the front, middle, and back.
+
+Implement the `FrontMiddleBack` class:
+
+- `FrontMiddleBack()` Initializes the queue.
+- `void pushFront(int val)` Adds `val` to the **front** of the queue.
+- `void pushMiddle(int val)` Adds `val` to the **middle** of the queue.
+- `void pushBack(int val)` Adds `val` to the **back** of the queue.
+- `int popFront()` Removes the **front** element of the queue and returns it. If the queue is empty, return `1`.
+- `int popMiddle()` Removes the **middle** element of the queue and returns it. If the queue is empty, return `1`.
+- `int popBack()` Removes the **back** element of the queue and returns it. If the queue is empty, return `1`.
+
+**Notice** that when there are **two** middle position choices, the operation is performed on the **frontmost** middle position choice. For example:
+
+- Pushing `6` into the middle of `[1, 2, 3, 4, 5]` results in `[1, 2, 6, 3, 4, 5]`.
+- Popping the middle from `[1, 2, 3, 4, 5, 6]` returns `3` and results in `[1, 2, 4, 5, 6]`.
+
+**Example 1**:
+
+```
+Input:
+["FrontMiddleBackQueue", "pushFront", "pushBack", "pushMiddle", "pushMiddle", "popFront", "popMiddle", "popMiddle", "popBack", "popFront"]
+[[], [1], [2], [3], [4], [], [], [], [], []]
+Output:
+[null, null, null, null, null, 1, 3, 4, 2, -1]
+
+Explanation:
+FrontMiddleBackQueue q = new FrontMiddleBackQueue();
+q.pushFront(1); // [1]
+q.pushBack(2); // [1, 2]
+q.pushMiddle(3); // [1, 3, 2]
+q.pushMiddle(4); // [1, 4, 3, 2]
+q.popFront(); // return 1 -> [4, 3, 2]
+q.popMiddle(); // return 3 -> [4, 2]
+q.popMiddle(); // return 4 -> [2]
+q.popBack(); // return 2 -> []
+q.popFront(); // return -1 -> [] (The queue is empty)
+
+```
+
+**Constraints**:
+
+- `1 <= val <= 109`
+- At most `1000` calls will be made to `pushFront`, `pushMiddle`, `pushBack`, `popFront`, `popMiddle`, and `popBack`.
+
+## 题目大意
+
+请你设计一个队列，支持在前，中，后三个位置的 push 和 pop 操作。
+
+请你完成 FrontMiddleBack 类：
+
+- FrontMiddleBack() 初始化队列。
+- void pushFront(int val) 将 val 添加到队列的 最前面 。
+- void pushMiddle(int val) 将 val 添加到队列的 正中间 。
+- void pushBack(int val) 将 val 添加到队里的 最后面 。
+- int popFront() 将 最前面 的元素从队列中删除并返回值，如果删除之前队列为空，那么返回 -1 。
+- int popMiddle() 将 正中间 的元素从队列中删除并返回值，如果删除之前队列为空，那么返回 -1 。
+- int popBack() 将 最后面 的元素从队列中删除并返回值，如果删除之前队列为空，那么返回 -1 。
+
+请注意当有 两个 中间位置的时候，选择靠前面的位置进行操作。比方说：
+
+- 将 6 添加到 [1, 2, 3, 4, 5] 的中间位置，结果数组为 [1, 2, 6, 3, 4, 5] 。
+- 从 [1, 2, 3, 4, 5, 6] 的中间位置弹出元素，返回 3 ，数组变为 [1, 2, 4, 5, 6] 。
+
+## 解题思路
+
+- 简单题，利用 go 原生的双向队列 list 的实现，可以轻松实现这个“前中后队列”。
+- 具体实现见代码，几组特殊测试用例见测试文件。
+
+## 代码
+
+```go
+package leetcode
+
+import (
+ "container/list"
+)
+
+type FrontMiddleBackQueue struct {
+ list *list.List
+ middle *list.Element
+}
+
+func Constructor() FrontMiddleBackQueue {
+ return FrontMiddleBackQueue{list: list.New()}
+}
+
+func (this *FrontMiddleBackQueue) PushFront(val int) {
+ e := this.list.PushFront(val)
+ if this.middle == nil {
+ this.middle = e
+ } else if this.list.Len()%2 == 0 && this.middle.Prev() != nil {
+ this.middle = this.middle.Prev()
+ }
+}
+
+func (this *FrontMiddleBackQueue) PushMiddle(val int) {
+ if this.middle == nil {
+ this.PushFront(val)
+ } else {
+ if this.list.Len()%2 != 0 {
+ this.middle = this.list.InsertBefore(val, this.middle)
+ } else {
+ this.middle = this.list.InsertAfter(val, this.middle)
+ }
+ }
+}
+
+func (this *FrontMiddleBackQueue) PushBack(val int) {
+ e := this.list.PushBack(val)
+ if this.middle == nil {
+ this.middle = e
+ } else if this.list.Len()%2 != 0 && this.middle.Next() != nil {
+ this.middle = this.middle.Next()
+ }
+}
+
+func (this *FrontMiddleBackQueue) PopFront() int {
+ if this.list.Len() == 0 {
+ return -1
+ }
+ e := this.list.Front()
+ if this.list.Len() == 1 {
+ this.middle = nil
+ } else if this.list.Len()%2 == 0 && this.middle.Next() != nil {
+ this.middle = this.middle.Next()
+ }
+ return this.list.Remove(e).(int)
+}
+
+func (this *FrontMiddleBackQueue) PopMiddle() int {
+ if this.middle == nil {
+ return -1
+ }
+ e := this.middle
+ if this.list.Len()%2 != 0 {
+ this.middle = e.Prev()
+ } else {
+ this.middle = e.Next()
+ }
+ return this.list.Remove(e).(int)
+}
+
+func (this *FrontMiddleBackQueue) PopBack() int {
+ if this.list.Len() == 0 {
+ return -1
+ }
+ e := this.list.Back()
+ if this.list.Len() == 1 {
+ this.middle = nil
+ } else if this.list.Len()%2 != 0 && this.middle.Prev() != nil {
+ this.middle = this.middle.Prev()
+ }
+ return this.list.Remove(e).(int)
+}
+
+/**
+ * Your FrontMiddleBackQueue object will be instantiated and called as such:
+ * obj := Constructor();
+ * obj.PushFront(val);
+ * obj.PushMiddle(val);
+ * obj.PushBack(val);
+ * param_4 := obj.PopFront();
+ * param_5 := obj.PopMiddle();
+ * param_6 := obj.PopBack();
+ */
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1600~1699/1669.Merge-In-Between-Linked-Lists/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1600~1699/1672.Richest-Customer-Wealth/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/1600~1699/1672.Richest-Customer-Wealth.md b/website/content/ChapterFour/1600~1699/1672.Richest-Customer-Wealth.md
new file mode 100644
index 000000000..72e287b64
--- /dev/null
+++ b/website/content/ChapterFour/1600~1699/1672.Richest-Customer-Wealth.md
@@ -0,0 +1,79 @@
+# [1672. Richest Customer Wealth](https://leetcode.com/problems/richest-customer-wealth/)
+
+
+## 题目
+
+You are given an `m x n` integer grid `accounts` where `accounts[i][j]` is the amount of money the `ith` customer has in the `jth` bank. Return *the **wealth** that the richest customer has.*
+
+A customer's **wealth** is the amount of money they have in all their bank accounts. The richest customer is the customer that has the maximum **wealth**.
+
+**Example 1**:
+
+```
+Input: accounts = [[1,2,3],[3,2,1]]
+Output: 6
+Explanation:1st customer has wealth = 1 + 2 + 3 = 6
+2nd customer has wealth = 3 + 2 + 1 = 6
+Both customers are considered the richest with a wealth of 6 each, so return 6.
+```
+
+**Example 2**:
+
+```
+Input: accounts = [[1,5],[7,3],[3,5]]
+Output: 10
+Explanation:
+1st customer has wealth = 6
+2nd customer has wealth = 10
+3rd customer has wealth = 8
+The 2nd customer is the richest with a wealth of 10.
+```
+
+**Example 3**:
+
+```
+Input: accounts = [[2,8,7],[7,1,3],[1,9,5]]
+Output: 17
+```
+
+**Constraints**:
+
+- `m == accounts.length`
+- `n == accounts[i].length`
+- `1 <= m, n <= 50`
+- `1 <= accounts[i][j] <= 100`
+
+## 题目大意
+
+给你一个 m x n 的整数网格 accounts ，其中 accounts[i][j] 是第 i 位客户在第 j 家银行托管的资产数量。返回最富有客户所拥有的 资产总量 。客户的 资产总量 就是他们在各家银行托管的资产数量之和。最富有客户就是 资产总量 最大的客户。
+
+## 解题思路
+
+- 简单题。计算二维数组中每个一位数组的元素总和，然后动态维护这些一位数组和的最大值即可。
+
+## 代码
+
+```go
+package leetcode
+
+func maximumWealth(accounts [][]int) int {
+ res := 0
+ for _, banks := range accounts {
+ sAmount := 0
+ for _, amount := range banks {
+ sAmount += amount
+ }
+ if sAmount > res {
+ res = sAmount
+ }
+ }
+ return res
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1600~1699/1670.Design-Front-Middle-Back-Queue/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1600~1699/1673.Find-the-Most-Competitive-Subsequence/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/1600~1699/1673.Find-the-Most-Competitive-Subsequence.md b/website/content/ChapterFour/1600~1699/1673.Find-the-Most-Competitive-Subsequence.md
new file mode 100644
index 000000000..02292dd4f
--- /dev/null
+++ b/website/content/ChapterFour/1600~1699/1673.Find-the-Most-Competitive-Subsequence.md
@@ -0,0 +1,69 @@
+# [1673. Find the Most Competitive Subsequence](https://leetcode.com/problems/find-the-most-competitive-subsequence/)
+
+
+## 题目
+
+Given an integer array `nums` and a positive integer `k`, return *the most **competitive** subsequence of* `nums` *of size* `k`.
+
+An array's subsequence is a resulting sequence obtained by erasing some (possibly zero) elements from the array.
+
+We define that a subsequence `a` is more **competitive** than a subsequence `b` (of the same length) if in the first position where `a` and `b` differ, subsequence `a` has a number **less** than the corresponding number in `b`. For example, `[1,3,4]` is more competitive than `[1,3,5]` because the first position they differ is at the final number, and `4` is less than `5`.
+
+**Example 1**:
+
+```
+Input: nums = [3,5,2,6], k = 2
+Output: [2,6]
+Explanation: Among the set of every possible subsequence: {[3,5], [3,2], [3,6], [5,2], [5,6], [2,6]}, [2,6] is the most competitive.
+
+```
+
+**Example 2**:
+
+```
+Input: nums = [2,4,3,3,5,4,9,6], k = 4
+Output: [2,3,3,4]
+
+```
+
+**Constraints**:
+
+- `1 <= nums.length <= 105`
+- `0 <= nums[i] <= 109`
+- `1 <= k <= nums.length`
+
+## 题目大意
+
+给你一个整数数组 nums 和一个正整数 k ，返回长度为 k 且最具 竞争力 的 nums 子序列。数组的子序列是从数组中删除一些元素（可能不删除元素）得到的序列。
+
+在子序列 a 和子序列 b 第一个不相同的位置上，如果 a 中的数字小于 b 中对应的数字，那么我们称子序列 a 比子序列 b（相同长度下）更具 竞争力 。 例如，[1,3,4] 比 [1,3,5] 更具竞争力，在第一个不相同的位置，也就是最后一个位置上， 4 小于 5 。
+
+## 解题思路
+
+- 这一题是单调栈的典型题型。利用单调栈，可以保证原数组中元素相对位置不变，这满足题意中删除元素但不移动元素的要求。单调栈又能保证每次进栈，元素是最小的。
+- 类似的题目还有第 42 题，第 84 题，第 496 题，第 503 题，第 856 题，第 901 题，第 907 题，第 1130 题，第 1425 题，第 1673 题。
+
+## 代码
+
+```go
+package leetcode
+
+// 单调栈
+func mostCompetitive(nums []int, k int) []int {
+ stack := make([]int, 0, len(nums))
+ for i := 0; i < len(nums); i++ {
+ for len(stack)+len(nums)-i > k && len(stack) > 0 && nums[i] < stack[len(stack)-1] {
+ stack = stack[:len(stack)-1]
+ }
+ stack = append(stack, nums[i])
+ }
+ return stack[:k]
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1600~1699/1672.Richest-Customer-Wealth/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1600~1699/1674.Minimum-Moves-to-Make-Array-Complementary/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/1600~1699/1674.Minimum-Moves-to-Make-Array-Complementary.md b/website/content/ChapterFour/1600~1699/1674.Minimum-Moves-to-Make-Array-Complementary.md
new file mode 100644
index 000000000..32997f177
--- /dev/null
+++ b/website/content/ChapterFour/1600~1699/1674.Minimum-Moves-to-Make-Array-Complementary.md
@@ -0,0 +1,104 @@
+# [1674. Minimum Moves to Make Array Complementary](https://leetcode.com/problems/minimum-moves-to-make-array-complementary/)
+
+## 题目
+
+You are given an integer array `nums` of **even** length `n` and an integer `limit`. In one move, you can replace any integer from `nums` with another integer between `1` and `limit`, inclusive.
+
+The array `nums` is **complementary** if for all indices `i` (**0-indexed**), `nums[i] + nums[n - 1 - i]` equals the same number. For example, the array `[1,2,3,4]` is complementary because for all indices `i`, `nums[i] + nums[n - 1 - i] = 5`.
+
+Return the ***minimum** number of moves required to make* `nums` ***complementary***.
+
+**Example 1**:
+
+```
+Input: nums = [1,2,4,3], limit = 4
+Output: 1
+Explanation: In 1 move, you can change nums to [1,2,2,3] (underlined elements are changed).
+nums[0] + nums[3] = 1 + 3 = 4.
+nums[1] + nums[2] = 2 + 2 = 4.
+nums[2] + nums[1] = 2 + 2 = 4.
+nums[3] + nums[0] = 3 + 1 = 4.
+Therefore, nums[i] + nums[n-1-i] = 4 for every i, so nums is complementary.
+```
+
+**Example 2**:
+
+```
+Input: nums = [1,2,2,1], limit = 2
+Output: 2
+Explanation: In 2 moves, you can change nums to [2,2,2,2]. You cannot change any number to 3 since 3 > limit.
+```
+
+**Example 3**:
+
+```
+Input: nums = [1,2,1,2], limit = 2
+Output: 0
+Explanation: nums is already complementary.
+```
+
+**Constraints**:
+
+- `n == nums.length`
+- `2 <= n <= 105`
+- `1 <= nums[i] <= limit <= 105`
+- `n` is even.
+
+## 题目大意
+
+给你一个长度为 偶数 n 的整数数组 nums 和一个整数 limit 。每一次操作，你可以将 nums 中的任何整数替换为 1 到 limit 之间的另一个整数。
+
+如果对于所有下标 i（下标从 0 开始），nums[i] + nums[n - 1 - i] 都等于同一个数，则数组 nums 是 互补的 。例如，数组 [1,2,3,4] 是互补的，因为对于所有下标 i ，nums[i] + nums[n - 1 - i] = 5 。
+
+返回使数组 互补 的 最少 操作次数。
+
+## 解题思路
+
+- 这一题考察的是差分数组。通过分析题意，可以得出，针对每一个 `sum` 的取值范围是 `[2, 2* limt]`，定义 `a = min(nums[i], nums[n - i - 1])`，`b = max(nums[i], nums[n - i - 1])`，在这个区间内，又可以细分成 5 个区间，`[2, a + 1)`，`[a + 1, a + b)`，`[a + b + 1, a + b + 1)`，`[a + b + 1, b + limit + 1)`，`[b + limit + 1, 2 * limit)`，在这 5 个区间内使得数组互补的最小操作次数分别是 `2(减少 a, 减少 b)`，`1(减少 b)`，`0(不用操作)`，`1(增大 a)`，`+2(增大 a, 增大 b)`，换个表达方式，按照扫描线从左往右扫描，在这 5 个区间内使得数组互补的最小操作次数叠加变化分别是 `+2(减少 a, 减少 b)`，`-1(减少 a)`，`-1(不用操作)`，`+1(增大 a)`，`+1(增大 a, 增大 b)`，利用这前后两个区间的关系，就可以构造一个差分数组。差分数组反应的是前后两者的关系。如果想求得 0 ~ n 的总关系，只需要求一次前缀和即可。
+- 这道题要求输出最少的操作次数，所以利用差分数组 + 前缀和，累加前缀和的同时维护最小值。从左往右扫描完一遍以后，输出最小值即可。
+
+## 代码
+
+```go
+package leetcode
+
+func minMoves(nums []int, limit int) int {
+ diff := make([]int, limit*2+2) // nums[i] <= limit, b+limit+1 is maximum limit+limit+1
+ for j := 0; j < len(nums)/2; j++ {
+ a, b := min(nums[j], nums[len(nums)-j-1]), max(nums[j], nums[len(nums)-j-1])
+ // using prefix sum: most interesting point, and is the key to reduce complexity
+ diff[2] += 2
+ diff[a+1]--
+ diff[a+b]--
+ diff[a+b+1]++
+ diff[b+limit+1]++
+ }
+ cur, res := 0, len(nums)
+ for i := 2; i <= 2*limit; i++ {
+ cur += diff[i]
+ res = min(res, cur)
+ }
+ return res
+}
+
+func min(a, b int) int {
+ if a < b {
+ return a
+ }
+ return b
+}
+
+func max(a, b int) int {
+ if a > b {
+ return a
+ }
+ return b
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1600~1699/1673.Find-the-Most-Competitive-Subsequence/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1600~1699/1675.Minimize-Deviation-in-Array/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/1600~1699/1675.Minimize-Deviation-in-Array.md b/website/content/ChapterFour/1600~1699/1675.Minimize-Deviation-in-Array.md
new file mode 100644
index 000000000..974e444a2
--- /dev/null
+++ b/website/content/ChapterFour/1600~1699/1675.Minimize-Deviation-in-Array.md
@@ -0,0 +1,112 @@
+# [1675. Minimize Deviation in Array](https://leetcode.com/problems/minimize-deviation-in-array/)
+
+## 题目
+
+You are given an array `nums` of `n` positive integers.
+
+You can perform two types of operations on any element of the array any number of times:
+
+- If the element is **even**, **divide** it by `2`.
+ - For example, if the array is `[1,2,3,4]`, then you can do this operation on the last element, and the array will be `[1,2,3,2].`
+- If the element is **odd**, **multiply** it by `2`.
+ - For example, if the array is `[1,2,3,4]`, then you can do this operation on the first element, and the array will be `[2,2,3,4].`
+
+The **deviation** of the array is the **maximum difference** between any two elements in the array.
+
+Return *the **minimum deviation** the array can have after performing some number of operations.*
+
+**Example 1:**
+
+```
+Input: nums = [1,2,3,4]
+Output: 1
+Explanation: You can transform the array to [1,2,3,2], then to [2,2,3,2], then the deviation will be 3 - 2 = 1.
+```
+
+**Example 2:**
+
+```
+Input: nums = [4,1,5,20,3]
+Output: 3
+Explanation: You can transform the array after two operations to [4,2,5,5,3], then the deviation will be 5 - 2 = 3.
+```
+
+**Example 3:**
+
+```
+Input: nums = [2,10,8]
+Output: 3
+```
+
+**Constraints:**
+
+- `n == nums.length`
+- `2 <= n <= 105`
+- `1 <= nums[i] <= 10^9`
+
+## 题目大意
+
+给你一个由 n 个正整数组成的数组 nums 。你可以对数组的任意元素执行任意次数的两类操作：
+
+- 如果元素是 偶数 ，除以 2。例如，如果数组是 [1,2,3,4] ，那么你可以对最后一个元素执行此操作，使其变成 [1,2,3,2]
+- 如果元素是 奇数 ，乘上 2。例如，如果数组是 [1,2,3,4] ，那么你可以对第一个元素执行此操作，使其变成 [2,2,3,4]
+数组的 偏移量 是数组中任意两个元素之间的 最大差值 。
+
+返回数组在执行某些操作之后可以拥有的 最小偏移量 。
+
+## 解题思路
+
+- 要找到最小偏移量，即需要令最大值变小，最小值变大。要想达到这个要求，需要对奇数偶数做乘法和除法。这里特殊的是，奇数一旦乘以 2 以后，就变成偶数了。偶数除以 2 以后可能是奇数也可能是偶数。所以可以先将所有的奇数都乘以 2 统一变成偶数。
+- 第二轮不断的将最大值除 2，直到最大值为奇数，不能再操作了。每轮循环中把比 min 值大的偶数也都除以 2 。这里除以 2 有 2 个目的，一个目的是将第一步奇数乘 2 还原回去，另一个目的是将本来的偶数除以 2 。可能有人有疑问，为什么只把最大值变小，没有将最小值变大呢？如果最小值是奇数，那么它一定是由上一个偶数除以 2 变过来的，我们在上一个状态已经计算过这个偶数了，因此没必要扩大它；如果最小值是偶数，那么它一定会在某一轮的除 2 操作中，不操作，即它不会满足 `min <= nums[i]/2` 这个条件。每次循环都更新该次循环的最大值和最小值，并记录偏移量。不断的循环，直到最大值为奇数，退出循环。最终输出最小偏移量。
+
+## 代码
+
+```go
+package leetcode
+
+func minimumDeviation(nums []int) int {
+ min, max := 0, 0
+ for i := range nums {
+ if nums[i]%2 == 1 {
+ nums[i] *= 2
+ }
+ if i == 0 {
+ min = nums[i]
+ max = nums[i]
+ } else if nums[i] < min {
+ min = nums[i]
+ } else if max < nums[i] {
+ max = nums[i]
+ }
+ }
+ res := max - min
+ for max%2 == 0 {
+ tmax, tmin := 0, 0
+ for i := range nums {
+ if nums[i] == max || (nums[i]%2 == 0 && min <= nums[i]/2) {
+ nums[i] /= 2
+ }
+ if i == 0 {
+ tmin = nums[i]
+ tmax = nums[i]
+ } else if nums[i] < tmin {
+ tmin = nums[i]
+ } else if tmax < nums[i] {
+ tmax = nums[i]
+ }
+ }
+ if tmax-tmin < res {
+ res = tmax - tmin
+ }
+ min, max = tmin, tmax
+ }
+ return res
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1600~1699/1674.Minimum-Moves-to-Make-Array-Complementary/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1600~1699/1678.Goal-Parser-Interpretation/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/1600~1699/1678.Goal-Parser-Interpretation.md b/website/content/ChapterFour/1600~1699/1678.Goal-Parser-Interpretation.md
new file mode 100644
index 000000000..54cd358bd
--- /dev/null
+++ b/website/content/ChapterFour/1600~1699/1678.Goal-Parser-Interpretation.md
@@ -0,0 +1,80 @@
+# [1678. Goal Parser Interpretation](https://leetcode.com/problems/goal-parser-interpretation/)
+
+## 题目
+
+You own a **Goal Parser** that can interpret a string `command`. The `command` consists of an alphabet of `"G"`, `"()"` and/or `"(al)"` in some order. The Goal Parser will interpret `"G"` as the string `"G"`, `"()"` as the string `"o"`, and `"(al)"` as the string `"al"`. The interpreted strings are then concatenated in the original order.
+
+Given the string `command`, return *the **Goal Parser**'s interpretation of* `command`.
+
+**Example 1**:
+
+```
+Input: command = "G()(al)"
+Output: "Goal"
+Explanation: The Goal Parser interprets the command as follows:
+G -> G
+() -> o
+(al) -> al
+The final concatenated result is "Goal".
+```
+
+**Example 2**:
+
+```
+Input: command = "G()()()()(al)"
+Output: "Gooooal"
+```
+
+**Example 3**:
+
+```
+Input: command = "(al)G(al)()()G"
+Output: "alGalooG"
+```
+
+**Constraints**:
+
+- `1 <= command.length <= 100`
+- `command` consists of `"G"`, `"()"`, and/or `"(al)"` in some order.
+
+## 题目大意
+
+请你设计一个可以解释字符串 command 的 Goal 解析器 。command 由 "G"、"()" 和/或 "(al)" 按某种顺序组成。Goal 解析器会将 "G" 解释为字符串 "G"、"()" 解释为字符串 "o" ，"(al)" 解释为字符串 "al" 。然后，按原顺序将经解释得到的字符串连接成一个字符串。给你字符串 command ，返回 Goal 解析器 对 command 的解释结果。
+
+## 解题思路
+
+- 简单题，按照题意修改字符串即可。由于是简单题，这一题也不用考虑嵌套的情况。
+
+## 代码
+
+```go
+package leetcode
+
+func interpret(command string) string {
+ if command == "" {
+ return ""
+ }
+ res := ""
+ for i := 0; i < len(command); i++ {
+ if command[i] == 'G' {
+ res += "G"
+ } else {
+ if command[i] == '(' && command[i+1] == 'a' {
+ res += "al"
+ i += 3
+ } else {
+ res += "o"
+ i ++
+ }
+ }
+ }
+ return res
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1600~1699/1675.Minimize-Deviation-in-Array/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1600~1699/1679.Max-Number-of-K-Sum-Pairs/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/1600~1699/1679.Max-Number-of-K-Sum-Pairs.md b/website/content/ChapterFour/1600~1699/1679.Max-Number-of-K-Sum-Pairs.md
new file mode 100644
index 000000000..f95055aa9
--- /dev/null
+++ b/website/content/ChapterFour/1600~1699/1679.Max-Number-of-K-Sum-Pairs.md
@@ -0,0 +1,105 @@
+# [1679. Max Number of K-Sum Pairs](https://leetcode.com/problems/max-number-of-k-sum-pairs/)
+
+
+## 题目
+
+You are given an integer array `nums` and an integer `k`.
+
+In one operation, you can pick two numbers from the array whose sum equals `k` and remove them from the array.
+
+Return *the maximum number of operations you can perform on the array*.
+
+**Example 1**:
+
+```
+Input: nums = [1,2,3,4], k = 5
+Output: 2
+Explanation: Starting with nums = [1,2,3,4]:
+- Remove numbers 1 and 4, then nums = [2,3]
+- Remove numbers 2 and 3, then nums = []
+There are no more pairs that sum up to 5, hence a total of 2 operations.
+```
+
+**Example 2**:
+
+```
+Input: nums = [3,1,3,4,3], k = 6
+Output: 1
+Explanation: Starting with nums = [3,1,3,4,3]:
+- Remove the first two 3's, then nums = [1,4,3]
+There are no more pairs that sum up to 6, hence a total of 1 operation.
+```
+
+**Constraints**:
+
+- `1 <= nums.length <= 105`
+- `1 <= nums[i] <= 109`
+- `1 <= k <= 109`
+
+## 题目大意
+
+给你一个整数数组 nums 和一个整数 k 。每一步操作中，你需要从数组中选出和为 k 的两个整数，并将它们移出数组。返回你可以对数组执行的最大操作数。
+
+## 解题思路
+
+- 读完题第一感觉这道题是 TWO SUM 题目的加强版。需要找到所有满足和是 k 的数对。先考虑能不能找到两个数都是 k/2 ，如果能找到多个这样的数，可以先移除他们。其次在利用 TWO SUM 的思路，找出和为 k 的数对。利用 TWO SUM 里面 map 的做法，时间复杂度 O(n)。
+
+## 代码
+
+```go
+package leetcode
+
+// 解法一 优化版
+func maxOperations(nums []int, k int) int {
+ counter, res := make(map[int]int), 0
+ for _, n := range nums {
+ counter[n]++
+ }
+ if (k & 1) == 0 {
+ res += counter[k>>1] >> 1
+ // 能够由 2 个相同的数构成 k 的组合已经都排除出去了，剩下的一个单独的也不能组成 k 了
+ // 所以这里要把它的频次置为 0 。如果这里不置为 0，下面代码判断逻辑还需要考虑重复使用数字的情况
+ counter[k>>1] = 0
+ }
+ for num, freq := range counter {
+ if num <= k/2 {
+ remain := k - num
+ if counter[remain] < freq {
+ res += counter[remain]
+ } else {
+ res += freq
+ }
+ }
+ }
+ return res
+}
+
+// 解法二
+func maxOperations_(nums []int, k int) int {
+ counter, res := make(map[int]int), 0
+ for _, num := range nums {
+ counter[num]++
+ remain := k - num
+ if num == remain {
+ if counter[num] >= 2 {
+ res++
+ counter[num] -= 2
+ }
+ } else {
+ if counter[remain] > 0 {
+ res++
+ counter[remain]--
+ counter[num]--
+ }
+ }
+ }
+ return res
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1600~1699/1678.Goal-Parser-Interpretation/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1600~1699/1680.Concatenation-of-Consecutive-Binary-Numbers/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/1600~1699/1680.Concatenation-of-Consecutive-Binary-Numbers.md b/website/content/ChapterFour/1600~1699/1680.Concatenation-of-Consecutive-Binary-Numbers.md
new file mode 100644
index 000000000..085376b2c
--- /dev/null
+++ b/website/content/ChapterFour/1600~1699/1680.Concatenation-of-Consecutive-Binary-Numbers.md
@@ -0,0 +1,102 @@
+# [1680. Concatenation of Consecutive Binary Numbers](https://leetcode.com/problems/concatenation-of-consecutive-binary-numbers/)
+
+
+## 题目
+
+Given an integer `n`, return *the **decimal value** of the binary string formed by concatenating the binary representations of* `1` *to* `n` *in order, **modulo*** `109 + 7`.
+
+**Example 1**:
+
+```
+Input: n = 1
+Output: 1
+Explanation: "1" in binary corresponds to the decimal value 1.
+```
+
+**Example 2**:
+
+```
+Input: n = 3
+Output: 27
+Explanation: In binary, 1, 2, and 3 corresponds to "1", "10", and "11".
+After concatenating them, we have "11011", which corresponds to the decimal value 27.
+```
+
+**Example 3**:
+
+```
+Input: n = 12
+Output: 505379714
+Explanation: The concatenation results in "1101110010111011110001001101010111100".
+The decimal value of that is 118505380540.
+After modulo 109 + 7, the result is 505379714.
+```
+
+**Constraints**:
+
+- `1 <= n <= 10^5`
+
+## 题目大意
+
+给你一个整数 n ，请你将 1 到 n 的二进制表示连接起来，并返回连接结果对应的 十进制 数字对 10^9 + 7 取余的结果。
+
+## 解题思路
+
+- 理解题意以后，先找到如何拼接最终二进制数的规律。假设 `f(n)` 为最终变换以后的十进制数。那么根据题意，`f(n) = f(n-1) << shift + n` 这是一个递推公式。`shift` 左移的位数就是 `n` 的二进制对应的长度。`shift` 的值是随着 `n` 变化而变化的。由二进制进位规律可以知道，2 的整数次幂的时候，对应的二进制长度会增加 1 位。这里可以利用位运算来判断是否是 2 的整数次幂。
+- 这道题另外一个需要处理的是模运算的法则。此题需要用到模运算的加法法则。
+
+ ```go
+ 模运算与基本四则运算有些相似，但是除法例外。
+ (a + b) % p = (a % p + b % p) % p （1）
+ (a - b) % p = (a % p - b % p) % p （2）
+ (a * b) % p = (a % p * b % p) % p （3）
+ a ^ b % p = ((a % p)^b) % p （4）
+ 结合律：
+ ((a+b) % p + c) % p = (a + (b+c) % p) % p （5）
+ ((a*b) % p * c)% p = (a * (b*c) % p) % p （6）
+ 交换律：
+ (a + b) % p = (b+a) % p （7）
+ (a * b) % p = (b * a) % p （8）
+ 分配律：
+ ((a +b)% p * c) % p = ((a * c) % p + (b * c) % p) % p （9）
+ ```
+
+ 这一题需要用到模运算的加法运算法则。
+
+## 代码
+
+```go
+package leetcode
+
+import (
+ "math/bits"
+)
+
+// 解法一 模拟
+func concatenatedBinary(n int) int {
+ res, mod, shift := 0, 1000000007, 0
+ for i := 1; i <= n; i++ {
+ if (i & (i - 1)) == 0 {
+ shift++
+ }
+ res = ((res << shift) + i) % mod
+ }
+ return res
+}
+
+// 解法二 位运算
+func concatenatedBinary1(n int) int {
+ res := 0
+ for i := 1; i <= n; i++ {
+ res = (res<<bits.Len(uint(i)) | i) % (1e9 + 7)
+ }
+ return res
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1600~1699/1679.Max-Number-of-K-Sum-Pairs/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1600~1699/1681.Minimum-Incompatibility/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/1600~1699/1681.Minimum-Incompatibility.md b/website/content/ChapterFour/1600~1699/1681.Minimum-Incompatibility.md
new file mode 100644
index 000000000..e8a267e6b
--- /dev/null
+++ b/website/content/ChapterFour/1600~1699/1681.Minimum-Incompatibility.md
@@ -0,0 +1,129 @@
+# [1681. Minimum Incompatibility](https://leetcode.com/problems/minimum-incompatibility/)
+
+
+## 题目
+
+You are given an integer array `nums` and an integer `k`. You are asked to distribute this array into `k` subsets of **equal size** such that there are no two equal elements in the same subset.
+
+A subset's **incompatibility** is the difference between the maximum and minimum elements in that array.
+
+Return *the **minimum possible sum of incompatibilities** of the* `k` *subsets after distributing the array optimally, or return* `-1` *if it is not possible.*
+
+A subset is a group integers that appear in the array with no particular order.
+
+**Example 1**:
+
+```
+Input: nums = [1,2,1,4], k = 2
+Output: 4
+Explanation: The optimal distribution of subsets is [1,2] and [1,4].
+The incompatibility is (2-1) + (4-1) = 4.
+Note that [1,1] and [2,4] would result in a smaller sum, but the first subset contains 2 equal elements.
+```
+
+**Example 2**:
+
+```
+Input: nums = [6,3,8,1,3,1,2,2], k = 4
+Output: 6
+Explanation: The optimal distribution of subsets is [1,2], [2,3], [6,8], and [1,3].
+The incompatibility is (2-1) + (3-2) + (8-6) + (3-1) = 6.
+
+```
+
+**Example 3**:
+
+```
+Input: nums = [5,3,3,6,3,3], k = 3
+Output: -1
+Explanation: It is impossible to distribute nums into 3 subsets where no two elements are equal in the same subset.
+
+```
+
+**Constraints**:
+
+- `1 <= k <= nums.length <= 16`
+- `nums.length` is divisible by `k`
+- `1 <= nums[i] <= nums.length`
+
+## 题目大意
+
+给你一个整数数组 nums 和一个整数 k 。你需要将这个数组划分到 k 个相同大小的子集中，使得同一个子集里面没有两个相同的元素。一个子集的 不兼容性 是该子集里面最大值和最小值的差。
+
+请你返回将数组分成 k 个子集后，各子集 **不兼容性** 的 **和** 的 **最小值** ，如果无法分成分成 k 个子集，返回 -1 。子集的定义是数组中一些数字的集合，对数字顺序没有要求。
+
+## 解题思路
+
+- 读完题最直白的思路就是 DFS。做法类似第 77 题。这里就不赘述了。可以见第 77 题题解。
+- 这一题还需要用到贪心的思想。每次取数都取最小的数。这样可以不会让最大数和最小数在一个集合中。由于每次取数都是取最小的，那么能保证不兼容性每次都尽量最小。于是在 order 数组中定义取数的顺序。然后再把数组从小到大排列。这样每次按照 order 顺序取数，都是取的最小值。
+- 正常的 DFS 写完提交，耗时是很长的。大概是 1532ms。如何优化到极致呢？这里需要加上 2 个剪枝条件。第一个剪枝条件比较简单，如果累计 sum 比之前存储的 res 大，那么直接 return，不需要继续递归了。第二个剪枝条件就非常重要了，可以一下子减少很多次递归。每次取数产生新的集合的时候，要从第一个最小数开始取，一旦取了，后面就不需要再循环递归了。举个例子，[1,2,3,4]，第一个数如果取 2，集合可以是 [[2,3],[1,4]] 或 [[2,4], [1,3]], 这个集合和[[1,3],[2,4]]、[[1,4], [2,3]] 情况一样。可以看到如果取出第一个最小值以后，后面的循环是不必要的了。所以在取下标为 0 的数的时候，递归到底层以后，返回就可以直接 break，不用接下去的循环了，接下去的循环和递归是不必要的。每组组内的顺序我们并不关心，只要最大值和最小值在分组内即可。另外组间顺序我们也不关心。所以可以把排列问题 O(n!) 时间复杂度降低到组合问题 O(2^n)。加了这 2 个剪枝条件以后，耗时就变成了 0ms 了。beats 100%
+
+## 代码
+
+```go
+package leetcode
+
+import (
+ "math"
+ "sort"
+)
+
+func minimumIncompatibility(nums []int, k int) int {
+ sort.Ints(nums)
+ eachSize, counts := len(nums)/k, make([]int, len(nums)+1)
+ for i := range nums {
+ counts[nums[i]]++
+ if counts[nums[i]] > k {
+ return -1
+ }
+ }
+ orders := []int{}
+ for i := range counts {
+ orders = append(orders, i)
+ }
+ sort.Ints(orders)
+ res := math.MaxInt32
+ generatePermutation1681(nums, counts, orders, 0, 0, eachSize, &res, []int{})
+ if res == math.MaxInt32 {
+ return -1
+ }
+ return res
+}
+
+func generatePermutation1681(nums, counts, order []int, index, sum, eachSize int, res *int, current []int) {
+ if len(current) > 0 && len(current)%eachSize == 0 {
+ sum += current[len(current)-1] - current[len(current)-eachSize]
+ index = 0
+ }
+ if sum >= *res {
+ return
+ }
+ if len(current) == len(nums) {
+ if sum < *res {
+ *res = sum
+ }
+ return
+ }
+ for i := index; i < len(counts); i++ {
+ if counts[order[i]] == 0 {
+ continue
+ }
+ counts[order[i]]--
+ current = append(current, order[i])
+ generatePermutation1681(nums, counts, order, i+1, sum, eachSize, res, current)
+ current = current[:len(current)-1]
+ counts[order[i]]++
+ // 这里是关键的剪枝
+ if index == 0 {
+ break
+ }
+ }
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1600~1699/1680.Concatenation-of-Consecutive-Binary-Numbers/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1600~1699/1684.Count-the-Number-of-Consistent-Strings/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/1600~1699/1684.Count-the-Number-of-Consistent-Strings.md b/website/content/ChapterFour/1600~1699/1684.Count-the-Number-of-Consistent-Strings.md
new file mode 100644
index 000000000..afe034b5c
--- /dev/null
+++ b/website/content/ChapterFour/1600~1699/1684.Count-the-Number-of-Consistent-Strings.md
@@ -0,0 +1,86 @@
+# [1684. Count the Number of Consistent Strings](https://leetcode.com/problems/count-the-number-of-consistent-strings/)
+
+
+## 题目
+
+You are given a string `allowed` consisting of **distinct** characters and an array of strings `words`. A string is **consistent** if all characters in the string appear in the string `allowed`.
+
+Return *the number of **consistent** strings in the array* `words`.
+
+**Example 1**:
+
+```
+Input: allowed = "ab", words = ["ad","bd","aaab","baa","badab"]
+Output: 2
+Explanation: Strings "aaab" and "baa" are consistent since they only contain characters 'a' and 'b'.
+
+```
+
+**Example 2**:
+
+```
+Input: allowed = "abc", words = ["a","b","c","ab","ac","bc","abc"]
+Output: 7
+Explanation: All strings are consistent.
+
+```
+
+**Example 3**:
+
+```
+Input: allowed = "cad", words = ["cc","acd","b","ba","bac","bad","ac","d"]
+Output: 4
+Explanation: Strings "cc", "acd", "ac", and "d" are consistent.
+
+```
+
+**Constraints**:
+
+- `1 <= words.length <= 104`
+- `1 <= allowed.length <= 26`
+- `1 <= words[i].length <= 10`
+- The characters in `allowed` are **distinct**.
+- `words[i]` and `allowed` contain only lowercase English letters.
+
+## 题目大意
+
+给你一个由不同字符组成的字符串 `allowed` 和一个字符串数组 `words` 。如果一个字符串的每一个字符都在 `allowed` 中，就称这个字符串是 一致字符串 。
+
+请你返回 `words` 数组中 一致字符串 的数目。
+
+## 解题思路
+
+- 简单题。先将 `allowed` 转化成 map。将 `words` 数组中每个单词的字符都在 map 中查找一遍，如果都存在就累加 res。如果有不存在的字母，不累加。最终输出 res 即可。
+
+## 代码
+
+```go
+package leetcode
+
+func countConsistentStrings(allowed string, words []string) int {
+ allowedMap, res, flag := map[rune]int{}, 0, true
+ for _, str := range allowed {
+ allowedMap[str]++
+ }
+ for i := 0; i < len(words); i++ {
+ flag = true
+ for j := 0; j < len(words[i]); j++ {
+ if _, ok := allowedMap[rune(words[i][j])]; !ok {
+ flag = false
+ break
+ }
+ }
+ if flag {
+ res++
+ }
+ }
+ return res
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1600~1699/1681.Minimum-Incompatibility/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1600~1699/1685.Sum-of-Absolute-Differences-in-a-Sorted-Array/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/1600~1699/1685.Sum-of-Absolute-Differences-in-a-Sorted-Array.md b/website/content/ChapterFour/1600~1699/1685.Sum-of-Absolute-Differences-in-a-Sorted-Array.md
new file mode 100644
index 000000000..4ab16dc75
--- /dev/null
+++ b/website/content/ChapterFour/1600~1699/1685.Sum-of-Absolute-Differences-in-a-Sorted-Array.md
@@ -0,0 +1,95 @@
+# [1685. Sum of Absolute Differences in a Sorted Array](https://leetcode.com/problems/sum-of-absolute-differences-in-a-sorted-array/)
+
+
+## 题目
+
+You are given an integer array `nums` sorted in **non-decreasing** order.
+
+Build and return *an integer array* `result` *with the same length as* `nums` *such that* `result[i]` *is equal to the **summation of absolute differences** between* `nums[i]` *and all the other elements in the array.*
+
+In other words, `result[i]` is equal to `sum(|nums[i]-nums[j]|)` where `0 <= j < nums.length` and `j != i` (**0-indexed**).
+
+**Example 1**:
+
+```
+Input: nums = [2,3,5]
+Output: [4,3,5]
+Explanation: Assuming the arrays are 0-indexed, then
+result[0] = |2-2| + |2-3| + |2-5| = 0 + 1 + 3 = 4,
+result[1] = |3-2| + |3-3| + |3-5| = 1 + 0 + 2 = 3,
+result[2] = |5-2| + |5-3| + |5-5| = 3 + 2 + 0 = 5.
+```
+
+**Example 2**:
+
+```
+Input: nums = [1,4,6,8,10]
+Output: [24,15,13,15,21]
+```
+
+**Constraints**:
+
+- `2 <= nums.length <= 105`
+- `1 <= nums[i] <= nums[i + 1] <= 104`
+
+## 题目大意
+
+给你一个 非递减 有序整数数组 `nums` 。请你建立并返回一个整数数组 `result`，它跟 `nums` 长度相同，且`result[i]` 等于 `nums[i]` 与数组中所有其他元素差的绝对值之和。换句话说， `result[i]` 等于 `sum(|nums[i]-nums[j]|)` ，其中 `0 <= j < nums.length` 且 `j != i` （下标从 0 开始）。
+
+## 解题思路
+
+- 利用前缀和思路解题。题目中说明了是有序数组，所以在计算绝对值的时候可以拆开绝对值符号。假设要计算当前 `result[i]`，以 `i` 为界，把原数组 `nums` 分成了 3 段。`nums[0 ~ i-1]` 和 `nums[i+1 ~ n]`，前面一段 `nums[0 ~ i-1]` 中的每个元素都比 `nums[i]` 小，拆掉绝对值以后，`sum(|nums[i]-nums[j]|) = nums[i] * i - prefixSum[0 ~ i-1]`，后面一段 `nums[i+1 ~ n]` 中的每个元素都比 `nums[i]` 大，拆掉绝对值以后，`sum(|nums[i]-nums[j]|) = prefixSum[i+1 ~ n] - nums[i] * (n - 1 - i)`。特殊的情况，`i = 0` 和 `i = n` 的情况特殊处理一下就行。
+
+## 代码
+
+```go
+package leetcode
+
+//解法一 优化版 prefixSum + sufixSum
+func getSumAbsoluteDifferences(nums []int) []int {
+ size := len(nums)
+ sufixSum := make([]int, size)
+ sufixSum[size-1] = nums[size-1]
+ for i := size - 2; i >= 0; i-- {
+ sufixSum[i] = sufixSum[i+1] + nums[i]
+ }
+ ans, preSum := make([]int, size), 0
+ for i := 0; i < size; i++ {
+ // 后面可以加到的值
+ res, sum := 0, sufixSum[i]-nums[i]
+ res += (sum - (size-i-1)*nums[i])
+ // 前面可以加到的值
+ res += (i*nums[i] - preSum)
+ ans[i] = res
+ preSum += nums[i]
+ }
+ return ans
+}
+
+// 解法二 prefixSum
+func getSumAbsoluteDifferences1(nums []int) []int {
+ preSum, res, sum := []int{}, []int{}, nums[0]
+ preSum = append(preSum, nums[0])
+ for i := 1; i < len(nums); i++ {
+ sum += nums[i]
+ preSum = append(preSum, sum)
+ }
+ for i := 0; i < len(nums); i++ {
+ if i == 0 {
+ res = append(res, preSum[len(nums)-1]-preSum[0]-nums[i]*(len(nums)-1))
+ } else if i > 0 && i < len(nums)-1 {
+ res = append(res, preSum[len(nums)-1]-preSum[i]-preSum[i-1]+nums[i]*i-nums[i]*(len(nums)-1-i))
+ } else {
+ res = append(res, nums[i]*len(nums)-preSum[len(nums)-1])
+ }
+ }
+ return res
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1600~1699/1684.Count-the-Number-of-Consistent-Strings/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1600~1699/1688.Count-of-Matches-in-Tournament/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/1600~1699/1688.Count-of-Matches-in-Tournament.md b/website/content/ChapterFour/1600~1699/1688.Count-of-Matches-in-Tournament.md
new file mode 100644
index 000000000..e8a8c3921
--- /dev/null
+++ b/website/content/ChapterFour/1600~1699/1688.Count-of-Matches-in-Tournament.md
@@ -0,0 +1,87 @@
+# [1688. Count of Matches in Tournament](https://leetcode.com/problems/count-of-matches-in-tournament/)
+
+
+## 题目
+
+You are given an integer `n`, the number of teams in a tournament that has strange rules:
+
+- If the current number of teams is **even**, each team gets paired with another team. A total of `n / 2` matches are played, and `n / 2` teams advance to the next round.
+- If the current number of teams is **odd**, one team randomly advances in the tournament, and the rest gets paired. A total of `(n - 1) / 2` matches are played, and `(n - 1) / 2 + 1` teams advance to the next round.
+
+Return *the number of matches played in the tournament until a winner is decided.*
+
+**Example 1**:
+
+```
+Input: n = 7
+Output: 6
+Explanation: Details of the tournament:
+- 1st Round: Teams = 7, Matches = 3, and 4 teams advance.
+- 2nd Round: Teams = 4, Matches = 2, and 2 teams advance.
+- 3rd Round: Teams = 2, Matches = 1, and 1 team is declared the winner.
+Total number of matches = 3 + 2 + 1 = 6.
+```
+
+**Example 2**:
+
+```
+Input: n = 14
+Output: 13
+Explanation: Details of the tournament:
+- 1st Round: Teams = 14, Matches = 7, and 7 teams advance.
+- 2nd Round: Teams = 7, Matches = 3, and 4 teams advance.
+- 3rd Round: Teams = 4, Matches = 2, and 2 teams advance.
+- 4th Round: Teams = 2, Matches = 1, and 1 team is declared the winner.
+Total number of matches = 7 + 3 + 2 + 1 = 13.
+```
+
+**Constraints**:
+
+- `1 <= n <= 200`
+
+## 题目大意
+
+给你一个整数 n ，表示比赛中的队伍数。比赛遵循一种独特的赛制：
+
+- 如果当前队伍数是 偶数 ，那么每支队伍都会与另一支队伍配对。总共进行 n / 2 场比赛，且产生 n / 2 支队伍进入下一轮。
+- 如果当前队伍数为 奇数 ，那么将会随机轮空并晋级一支队伍，其余的队伍配对。总共进行 (n - 1) / 2 场比赛，且产生 (n - 1) / 2 + 1 支队伍进入下一轮。
+
+返回在比赛中进行的配对次数，直到决出获胜队伍为止。
+
+## 解题思路
+
+- 简单题，按照题目的规则模拟。
+- 这一题还有更加简洁的代码，见解法一。n 个队伍，一个冠军，需要淘汰 n-1 个队伍。每一场比赛淘汰一个队伍，因此进行了 n-1 场比赛。所以共有 n-1 个配对。
+
+## 代码
+
+```go
+package leetcode
+
+// 解法一
+func numberOfMatches(n int) int {
+ return n - 1
+}
+
+// 解法二 模拟
+func numberOfMatches1(n int) int {
+ sum := 0
+ for n != 1 {
+ if n&1 == 0 {
+ sum += n / 2
+ n = n / 2
+ } else {
+ sum += (n - 1) / 2
+ n = (n-1)/2 + 1
+ }
+ }
+ return sum
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1600~1699/1685.Sum-of-Absolute-Differences-in-a-Sorted-Array/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1600~1699/1689.Partitioning-Into-Minimum-Number-Of-Deci-Binary-Numbers/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/1600~1699/1689.Partitioning-Into-Minimum-Number-Of-Deci-Binary-Numbers.md b/website/content/ChapterFour/1600~1699/1689.Partitioning-Into-Minimum-Number-Of-Deci-Binary-Numbers.md
new file mode 100644
index 000000000..f3494ed47
--- /dev/null
+++ b/website/content/ChapterFour/1600~1699/1689.Partitioning-Into-Minimum-Number-Of-Deci-Binary-Numbers.md
@@ -0,0 +1,67 @@
+# [1689. Partitioning Into Minimum Number Of Deci-Binary Numbers](https://leetcode.com/problems/partitioning-into-minimum-number-of-deci-binary-numbers/)
+
+## 题目
+
+A decimal number is called **deci-binary** if each of its digits is either `0` or `1` without any leading zeros. For example, `101` and `1100` are **deci-binary**, while `112` and `3001` are not.
+
+Given a string `n` that represents a positive decimal integer, return *the **minimum** number of positive **deci-binary** numbers needed so that they sum up to* `n`*.*
+
+**Example 1**:
+
+```
+Input: n = "32"
+Output: 3
+Explanation: 10 + 11 + 11 = 32
+```
+
+**Example 2**:
+
+```
+Input: n = "82734"
+Output: 8
+```
+
+**Example 3**:
+
+```
+Input: n = "27346209830709182346"
+Output: 9
+```
+
+**Constraints**:
+
+- `1 <= n.length <= 105`
+- `n` consists of only digits.
+- `n` does not contain any leading zeros and represents a positive integer.
+
+## 题目大意
+
+如果一个十进制数字不含任何前导零，且每一位上的数字不是 0 就是 1 ，那么该数字就是一个 十-二进制数 。例如，101 和 1100 都是 十-二进制数，而 112 和 3001 不是。给你一个表示十进制整数的字符串 n ，返回和为 n 的 十-二进制数 的最少数目。
+
+## 解题思路
+
+- 这一题也算是简单题，相通了以后，代码就 3 行。
+- 要想由 01 组成的十进制数组成 n，只需要在 n 这个数的各个数位上依次排上 0 和 1 即可。例如 n = 23423723，这是一个 8 位数。最大数字是 7，所以至少需要 7 个数累加能得到这个 n。这 7 个数的百位都为 1，其他数位按需求取 0 和 1 即可。例如万位是 2，那么这 7 个数中任找 2 个数的万位是 1 ，其他 5 个数的万位是 0 即可。
+
+## 代码
+
+```go
+package leetcode
+
+func minPartitions(n string) int {
+ res := 0
+ for i := 0; i < len(n); i++ {
+ if int(n[i]-'0') > res {
+ res = int(n[i] - '0')
+ }
+ }
+ return res
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1600~1699/1688.Count-of-Matches-in-Tournament/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1600~1699/1690.Stone-Game-VII/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/1600~1699/1690.Stone-Game-VII.md b/website/content/ChapterFour/1600~1699/1690.Stone-Game-VII.md
new file mode 100644
index 000000000..c81e0619f
--- /dev/null
+++ b/website/content/ChapterFour/1600~1699/1690.Stone-Game-VII.md
@@ -0,0 +1,137 @@
+# [1690. Stone Game VII](https://leetcode.com/problems/stone-game-vii/)
+
+## 题目
+
+Alice and Bob take turns playing a game, with **Alice starting first**.
+
+There are `n` stones arranged in a row. On each player's turn, they can **remove** either the leftmost stone or the rightmost stone from the row and receive points equal to the **sum** of the remaining stones' values in the row. The winner is the one with the higher score when there are no stones left to remove.
+
+Bob found that he will always lose this game (poor Bob, he always loses), so he decided to **minimize the score's difference**. Alice's goal is to **maximize the difference** in the score.
+
+Given an array of integers `stones` where `stones[i]` represents the value of the `ith` stone **from the left**, return *the **difference** in Alice and Bob's score if they both play **optimally**.*
+
+**Example 1**:
+
+```
+Input: stones = [5,3,1,4,2]
+Output: 6
+Explanation:
+- Alice removes 2 and gets 5 + 3 + 1 + 4 = 13 points. Alice = 13, Bob = 0, stones = [5,3,1,4].
+- Bob removes 5 and gets 3 + 1 + 4 = 8 points. Alice = 13, Bob = 8, stones = [3,1,4].
+- Alice removes 3 and gets 1 + 4 = 5 points. Alice = 18, Bob = 8, stones = [1,4].
+- Bob removes 1 and gets 4 points. Alice = 18, Bob = 12, stones = [4].
+- Alice removes 4 and gets 0 points. Alice = 18, Bob = 12, stones = [].
+The score difference is 18 - 12 = 6.
+```
+
+**Example 2**:
+
+```
+Input: stones = [7,90,5,1,100,10,10,2]
+Output: 122
+```
+
+**Constraints**:
+
+- `n == stones.length`
+- `2 <= n <= 1000`
+- `1 <= stones[i] <= 1000`
+
+## 题目大意
+
+石子游戏中，爱丽丝和鲍勃轮流进行自己的回合，爱丽丝先开始 。有 n 块石子排成一排。每个玩家的回合中，可以从行中 移除 最左边的石头或最右边的石头，并获得与该行中剩余石头值之 和 相等的得分。当没有石头可移除时，得分较高者获胜。鲍勃发现他总是输掉游戏（可怜的鲍勃，他总是输），所以他决定尽力 减小得分的差值 。爱丽丝的目标是最大限度地 扩大得分的差值 。
+
+给你一个整数数组 stones ，其中 stones[i] 表示 从左边开始 的第 i 个石头的值，如果爱丽丝和鲍勃都 发挥出最佳水平 ，请返回他们 得分的差值 。
+
+## 解题思路
+
+- 首先考虑 Bob 缩小分值差距意味着什么，意味着他想让他和 Alice 相对分数最小。Bob 已经明确肯定是输，所以他的分数一定比 Alice 小，那么 Bob - Alice 分数相减一定是负数。相对分数越小，意味着差值越大。负数越大，差值越小。-50 和 -10，-10 数值大，相差小。所以 Bob 的操作是让相对分数越大。Alice 的目的也是这样，要让 Alice - Bob 的相对分数越大，这里是正数的越大。综上，两者的目的相同，都是让相对分数最大化。
+- 定义 `dp[i][j]` 代表在当前 `stone[i ~ j]` 区间内能获得的最大分差。状态转移方程为：
+
+ ```go
+ dp[i][j] = max(
+ sum(i + 1, j) - dp[i + 1][j], // 这一局取走 `stone[i]`，获得 sum(i + 1, j) 分数，再减去剩下对手能获得的分数，即是此局能获得的最大分差。
+ sum(i, j - 1) - dp[i][j - 1] // 这一局取走 `stone[j]`，获得 sum(i, j - 1) 分数，再减去剩下对手能获得的分数，即是此局能获得的最大分差。
+ )
+ ```
+
+ 计算 `sum(i + 1, j) = stone[i + 1] + stone[i + 2] + …… + stone[j]` 利用前缀和计算区间和。
+
+- 解法二是正常思路解答出来的代码。解法一是压缩了 DP 数组，在 DP 状态转移的时候，生成下一个 `dp[j]` 实际上是有规律的。利用这个规律可以少存一维数据，压缩空间。解法一的代码直接写出来，比较难想。先写出解法二的代码，然后找到递推规律，优化空间压缩一维，再写出解法一的代码。
+
+## 代码
+
+```go
+package leetcode
+
+// 解法一 优化空间版 DP
+func stoneGameVII(stones []int) int {
+ n := len(stones)
+ sum := make([]int, n)
+ dp := make([]int, n)
+ for i, d := range stones {
+ sum[i] = d
+ }
+ for i := 1; i < n; i++ {
+ for j := 0; j+i < n; j++ {
+ if (n-i)%2 == 1 {
+ d0 := dp[j] + sum[j]
+ d1 := dp[j+1] + sum[j+1]
+ if d0 > d1 {
+ dp[j] = d0
+ } else {
+ dp[j] = d1
+ }
+ } else {
+ d0 := dp[j] - sum[j]
+ d1 := dp[j+1] - sum[j+1]
+ if d0 < d1 {
+ dp[j] = d0
+ } else {
+ dp[j] = d1
+ }
+ }
+ sum[j] = sum[j] + stones[i+j]
+ }
+ }
+ return dp[0]
+}
+
+// 解法二 常规 DP
+func stoneGameVII1(stones []int) int {
+ prefixSum := make([]int, len(stones))
+ for i := 0; i < len(stones); i++ {
+ if i == 0 {
+ prefixSum[i] = stones[i]
+ } else {
+ prefixSum[i] = prefixSum[i-1] + stones[i]
+ }
+ }
+ dp := make([][]int, len(stones))
+ for i := range dp {
+ dp[i] = make([]int, len(stones))
+ dp[i][i] = 0
+ }
+ n := len(stones)
+ for l := 2; l <= n; l++ {
+ for i := 0; i+l <= n; i++ {
+ dp[i][i+l-1] = max(prefixSum[i+l-1]-prefixSum[i+1]+stones[i+1]-dp[i+1][i+l-1], prefixSum[i+l-2]-prefixSum[i]+stones[i]-dp[i][i+l-2])
+ }
+ }
+ return dp[0][n-1]
+}
+
+func max(a, b int) int {
+ if a > b {
+ return a
+ }
+ return b
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1600~1699/1689.Partitioning-Into-Minimum-Number-Of-Deci-Binary-Numbers/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1600~1699/1691.Maximum-Height-by-Stacking-Cuboids/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/1600~1699/1691.Maximum-Height-by-Stacking-Cuboids.md b/website/content/ChapterFour/1600~1699/1691.Maximum-Height-by-Stacking-Cuboids.md
new file mode 100644
index 000000000..623ab35ec
--- /dev/null
+++ b/website/content/ChapterFour/1600~1699/1691.Maximum-Height-by-Stacking-Cuboids.md
@@ -0,0 +1,113 @@
+# [1691. Maximum Height by Stacking Cuboids](https://leetcode.com/problems/maximum-height-by-stacking-cuboids/)
+
+## 题目
+
+Given `n` `cuboids` where the dimensions of the `ith` cuboid is `cuboids[i] = [widthi, lengthi, heighti]` (**0-indexed**). Choose a **subset** of `cuboids` and place them on each other.
+
+You can place cuboid `i` on cuboid `j` if `widthi <= widthj` and `lengthi <= lengthj` and `heighti <= heightj`. You can rearrange any cuboid's dimensions by rotating it to put it on another cuboid.
+
+Return *the **maximum height** of the stacked* `cuboids`.
+
+**Example 1:**
+
+
+
+```
+Input: cuboids = [[50,45,20],[95,37,53],[45,23,12]]
+Output: 190
+Explanation:
+Cuboid 1 is placed on the bottom with the 53x37 side facing down with height 95.
+Cuboid 0 is placed next with the 45x20 side facing down with height 50.
+Cuboid 2 is placed next with the 23x12 side facing down with height 45.
+The total height is 95 + 50 + 45 = 190.
+```
+
+**Example 2:**
+
+```
+Input: cuboids = [[38,25,45],[76,35,3]]
+Output: 76
+Explanation:
+You can't place any of the cuboids on the other.
+We choose cuboid 1 and rotate it so that the 35x3 side is facing down and its height is 76.
+```
+
+**Example 3:**
+
+```
+Input: cuboids = [[7,11,17],[7,17,11],[11,7,17],[11,17,7],[17,7,11],[17,11,7]]
+Output: 102
+Explanation:
+After rearranging the cuboids, you can see that all cuboids have the same dimension.
+You can place the 11x7 side down on all cuboids so their heights are 17.
+The maximum height of stacked cuboids is 6 * 17 = 102.
+```
+
+**Constraints:**
+
+- `n == cuboids.length`
+- `1 <= n <= 100`
+- `1 <= widthi, lengthi, heighti <= 100`
+
+## 题目大意
+
+给你 n 个长方体 cuboids ，其中第 i 个长方体的长宽高表示为 cuboids[i] = [widthi, lengthi, heighti]（下标从 0 开始）。请你从 cuboids 选出一个 子集 ，并将它们堆叠起来。如果 widthi <= widthj 且 lengthi <= lengthj 且 heighti <= heightj ，你就可以将长方体 i 堆叠在长方体 j 上。你可以通过旋转把长方体的长宽高重新排列，以将它放在另一个长方体上。返回 堆叠长方体 cuboids 可以得到的 最大高度 。
+
+## 解题思路
+
+- 这一题是 LIS 最长递增子序列系列问题的延续。一维 LIS 问题是第 300 题。二维 LIS 问题是 354 题。这一题是三维的 LIS 问题。
+- 题目要求最终摞起来的长方体尽可能的高，那么把长宽高中最大的值旋转为高。这是针对单个方块的排序。多个方块间还要排序，因为他们摞起来有要求，大的方块必须放在下面。所以针对多个方块，按照长，宽，高的顺序进行排序。两次排序完成以后，可以用动态规划找出最大值了。定义 `dp[i]` 为以 `i` 为最后一块砖块所能堆叠的最高高度。由于长和宽已经排好序了。所以只需要在 [0, i - 1] 这个区间内动态更新 dp 最大值。
+
+## 代码
+
+```go
+package leetcode
+
+import "sort"
+
+func maxHeight(cuboids [][]int) int {
+ n := len(cuboids)
+ for i := 0; i < n; i++ {
+ sort.Ints(cuboids[i]) // 立方体三边内部排序
+ }
+ // 立方体排序，先按最短边，再到最长边
+ sort.Slice(cuboids, func(i, j int) bool {
+ if cuboids[i][0] != cuboids[j][0] {
+ return cuboids[i][0] < cuboids[j][0]
+ }
+ if cuboids[i][1] != cuboids[j][1] {
+ return cuboids[i][1] < cuboids[j][1]
+ }
+ return cuboids[i][2] < cuboids[j][2]
+ })
+ res := 0
+ dp := make([]int, n)
+ for i := 0; i < n; i++ {
+ dp[i] = cuboids[i][2]
+ res = max(res, dp[i])
+ }
+ for i := 1; i < n; i++ {
+ for j := 0; j < i; j++ {
+ if cuboids[j][0] <= cuboids[i][0] && cuboids[j][1] <= cuboids[i][1] && cuboids[j][2] <= cuboids[i][2] {
+ dp[i] = max(dp[i], dp[j]+cuboids[i][2])
+ }
+ }
+ res = max(res, dp[i])
+ }
+ return res
+}
+
+func max(x, y int) int {
+ if x > y {
+ return x
+ }
+ return y
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1600~1699/1690.Stone-Game-VII/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1600~1699/1694.Reformat-Phone-Number/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/1600~1699/1694.Reformat-Phone-Number.md b/website/content/ChapterFour/1600~1699/1694.Reformat-Phone-Number.md
new file mode 100644
index 000000000..d2705b8a9
--- /dev/null
+++ b/website/content/ChapterFour/1600~1699/1694.Reformat-Phone-Number.md
@@ -0,0 +1,142 @@
+# [1694. Reformat Phone Number](https://leetcode.com/problems/reformat-phone-number/)
+
+
+## 题目
+
+You are given a phone number as a string `number`. `number` consists of digits, spaces `' '`, and/or dashes `'-'`.
+
+You would like to reformat the phone number in a certain manner. Firstly, **remove** all spaces and dashes. Then, **group** the digits from left to right into blocks of length 3 **until** there are 4 or fewer digits. The final digits are then grouped as follows:
+
+- 2 digits: A single block of length 2.
+- 3 digits: A single block of length 3.
+- 4 digits: Two blocks of length 2 each.
+
+The blocks are then joined by dashes. Notice that the reformatting process should **never** produce any blocks of length 1 and produce **at most** two blocks of length 2.
+
+Return *the phone number after formatting.*
+
+**Example 1**:
+
+```
+Input: number = "1-23-45 6"
+Output: "123-456"
+Explanation: The digits are "123456".
+Step 1: There are more than 4 digits, so group the next 3 digits. The 1st block is "123".
+Step 2: There are 3 digits remaining, so put them in a single block of length 3. The 2nd block is "456".
+Joining the blocks gives "123-456".
+
+```
+
+**Example 2**:
+
+```
+Input: number = "123 4-567"
+Output: "123-45-67"
+Explanation: The digits are "1234567".
+Step 1: There are more than 4 digits, so group the next 3 digits. The 1st block is "123".
+Step 2: There are 4 digits left, so split them into two blocks of length 2. The blocks are "45" and "67".
+Joining the blocks gives "123-45-67".
+
+```
+
+**Example 3**:
+
+```
+Input: number = "123 4-5678"
+Output: "123-456-78"
+Explanation: The digits are "12345678".
+Step 1: The 1st block is "123".
+Step 2: The 2nd block is "456".
+Step 3: There are 2 digits left, so put them in a single block of length 2. The 3rd block is "78".
+Joining the blocks gives "123-456-78".
+
+```
+
+**Example 4**:
+
+```
+Input: number = "12"
+Output: "12"
+
+```
+
+**Example 5**:
+
+```
+Input: number = "--17-5 229 35-39475 "
+Output: "175-229-353-94-75"
+
+```
+
+**Constraints**:
+
+- `2 <= number.length <= 100`
+- `number` consists of digits and the characters `'-'` and `' '`.
+- There are at least **two** digits in `number`.
+
+## 题目大意
+
+给你一个字符串形式的电话号码 number 。number 由数字、空格 ' '、和破折号 '-' 组成。
+
+请你按下述方式重新格式化电话号码。
+
+- 首先，删除 所有的空格和破折号。
+- 其次，将数组从左到右 每 3 个一组 分块，直到 剩下 4 个或更少数字。剩下的数字将按下述规定再分块：
+ - 2 个数字：单个含 2 个数字的块。
+ - 3 个数字：单个含 3 个数字的块。
+ - 4 个数字：两个分别含 2 个数字的块。
+
+最后用破折号将这些块连接起来。注意，重新格式化过程中 不应该 生成仅含 1 个数字的块，并且 最多 生成两个含 2 个数字的块。返回格式化后的电话号码。
+
+## 解题思路
+
+- 简单题。先判断号码是不是 2 位和 4 位，如果是，单独输出这 2 种情况。剩下的都是 3 位以上了，取余，判断剩余的数字是 2 个还是 4 个。这时不可能存在剩 1 位数的情况。除 3 余 1，即剩 4 位的情况，末尾 4 位需要 2 个一组输出。除 3 余 2，即剩 2 位的情况。处理好末尾，再逆序每 3 个一组连接 "-" 即可。可能需要注意的 case 见 test 文件。
+
+## 代码
+
+```go
+package leetcode
+
+import (
+ "strings"
+)
+
+func reformatNumber(number string) string {
+ parts, nums := []string{}, []rune{}
+ for _, r := range number {
+ if r != '-' && r != ' ' {
+ nums = append(nums, r)
+ }
+ }
+ threeDigits, twoDigits := len(nums)/3, 0
+ switch len(nums) % 3 {
+ case 1:
+ threeDigits--
+ twoDigits = 2
+ case 2:
+ twoDigits = 1
+ default:
+ twoDigits = 0
+ }
+ for i := 0; i < threeDigits; i++ {
+ s := ""
+ s += string(nums[0:3])
+ nums = nums[3:]
+ parts = append(parts, s)
+ }
+ for i := 0; i < twoDigits; i++ {
+ s := ""
+ s += string(nums[0:2])
+ nums = nums[2:]
+ parts = append(parts, s)
+ }
+ return strings.Join(parts, "-")
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1600~1699/1691.Maximum-Height-by-Stacking-Cuboids/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1600~1699/1695.Maximum-Erasure-Value/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/1600~1699/1695.Maximum-Erasure-Value.md b/website/content/ChapterFour/1600~1699/1695.Maximum-Erasure-Value.md
new file mode 100644
index 000000000..7ca5b8842
--- /dev/null
+++ b/website/content/ChapterFour/1600~1699/1695.Maximum-Erasure-Value.md
@@ -0,0 +1,82 @@
+# [1695. Maximum Erasure Value](https://leetcode.com/problems/maximum-erasure-value/)
+
+
+## 题目
+
+You are given an array of positive integers `nums` and want to erase a subarray containing **unique elements**. The **score** you get by erasing the subarray is equal to the **sum** of its elements.
+
+Return *the **maximum score** you can get by erasing **exactly one** subarray.*
+
+An array `b` is called to be a subarray of `a` if it forms a contiguous subsequence of `a`, that is, if it is equal to `a[l],a[l+1],...,a[r]` for some `(l,r)`.
+
+**Example 1**:
+
+```
+Input: nums = [4,2,4,5,6]
+Output: 17
+Explanation: The optimal subarray here is [2,4,5,6].
+```
+
+**Example 2**:
+
+```
+Input: nums = [5,2,1,2,5,2,1,2,5]
+Output: 8
+Explanation: The optimal subarray here is [5,2,1] or [1,2,5].
+```
+
+**Constraints**:
+
+- `1 <= nums.length <= 105`
+- `1 <= nums[i] <= 104`
+
+## 题目大意
+
+给你一个正整数数组 nums ，请你从中删除一个含有 若干不同元素 的子数组。删除子数组的 得分 就是子数组各元素之 和 。返回 只删除一个 子数组可获得的 最大得分 。如果数组 b 是数组 a 的一个连续子序列，即如果它等于 a[l],a[l+1],...,a[r] ，那么它就是 a 的一个子数组。
+
+## 解题思路
+
+- 读完题立马能识别出这是经典的滑动窗口题。利用滑动窗口从左往右滑动窗口，滑动过程中统计频次，如果是不同元素，右边界窗口又移，否则左边窗口缩小。每次移动更新 max 值。最终扫完一遍以后，max 值即为所求。
+
+## 代码
+
+```go
+package leetcode
+
+func maximumUniqueSubarray(nums []int) int {
+ if len(nums) == 0 {
+ return 0
+ }
+ result, left, right, freq := 0, 0, -1, map[int]int{}
+ for left < len(nums) {
+ if right+1 < len(nums) && freq[nums[right+1]] == 0 {
+ freq[nums[right+1]]++
+ right++
+ } else {
+ freq[nums[left]]--
+ left++
+ }
+ sum := 0
+ for i := left; i <= right; i++ {
+ sum += nums[i]
+ }
+ result = max(result, sum)
+ }
+ return result
+}
+
+func max(a int, b int) int {
+ if a > b {
+ return a
+ }
+ return b
+}
+```
+
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1600~1699/1694.Reformat-Phone-Number/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1600~1699/1696.Jump-Game-VI/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/1600~1699/1696.Jump-Game-VI.md b/website/content/ChapterFour/1600~1699/1696.Jump-Game-VI.md
new file mode 100644
index 000000000..155af11ea
--- /dev/null
+++ b/website/content/ChapterFour/1600~1699/1696.Jump-Game-VI.md
@@ -0,0 +1,118 @@
+# [1696. Jump Game VI](https://leetcode.com/problems/jump-game-vi/)
+
+## 题目
+
+You are given a **0-indexed** integer array `nums` and an integer `k`.
+
+You are initially standing at index `0`. In one move, you can jump at most `k` steps forward without going outside the boundaries of the array. That is, you can jump from index `i` to any index in the range `[i + 1, min(n - 1, i + k)]` **inclusive**.
+
+You want to reach the last index of the array (index `n - 1`). Your **score** is the **sum** of all `nums[j]` for each index `j` you visited in the array.
+
+Return *the **maximum score** you can get*.
+
+**Example 1:**
+
+```
+Input: nums = [1,-1,-2,4,-7,3], k = 2
+Output: 7
+Explanation: You can choose your jumps forming the subsequence [1,-1,4,3] (underlined above). The sum is 7.
+
+```
+
+**Example 2:**
+
+```
+Input: nums = [10,-5,-2,4,0,3], k = 3
+Output: 17
+Explanation: You can choose your jumps forming the subsequence [10,4,3] (underlined above). The sum is 17.
+
+```
+
+**Example 3:**
+
+```
+Input: nums = [1,-5,-20,4,-1,3,-6,-3], k = 2
+Output: 0
+
+```
+
+**Constraints:**
+
+- `1 <= nums.length, k <= 10^5`
+- `10^4 <= nums[i] <= 10^4`
+
+## 题目大意
+
+给你一个下标从 0 开始的整数数组 nums 和一个整数 k 。一开始你在下标 0 处。每一步，你最多可以往前跳 k 步，但你不能跳出数组的边界。也就是说，你可以从下标 i 跳到 [i + 1， min(n - 1, i + k)] 包含 两个端点的任意位置。你的目标是到达数组最后一个位置（下标为 n - 1 ），你的 得分 为经过的所有数字之和。请你返回你能得到的 最大得分 。
+
+## 解题思路
+
+- 首先能想到的解题思路是动态规划。定义 `dp[i]` 为跳到第 `i` 个位子能获得的最大分数。题目要求的是 `dp[n-1]`，状态转移方程是：`dp[i] = nums[i] + max(dp[j]), max(0, i - k ) <= j < i`，这里需要注意 `j` 的下界，题目中说到不能跳到负数区间，所以左边界下界为 0 。求 `max(dp[j])` 需要遍历一次求得最大值，所以这个解法整体时间复杂度是 O((n - k) * k)，但是提交以后提示超时了。
+- 分析一下超时原因。每次都要在 `[max(0, i - k ), i)` 区间内扫描找到最大值，下一轮的区间是 `[max(0, i - k + 1), i + 1)`，前后这两轮扫描的区间存在大量重合部分 `[max(0, i - k + 1), i)`，正是这部分反反复复的扫描导致算法低效。如何高效的在一个区间内找到最大值是本题的关键。利用单调队列可以完成此题。单调队列里面存一个区间内最大值的下标。这里单调队列有 2 个性质。性质一，队列的队首永远都是最大值，队列从大到小降序排列。如果来了一个比队首更大的值的下标，需要将单调队列清空，只存这个新的最大值的下标。性质二，队列的长度为 k。从队尾插入新值，并把队头的最大值“挤”出队首。拥有了这个单调队列以后，再进行 DP 状态转移，效率就很高了。每次只需取出队首的最大值即可。具体代码见下面。
+
+## 代码
+
+```go
+package leetcode
+
+import (
+ "math"
+)
+
+// 单调队列
+func maxResult(nums []int, k int) int {
+ dp := make([]int, len(nums))
+ dp[0] = nums[0]
+ for i := 1; i < len(dp); i++ {
+ dp[i] = math.MinInt32
+ }
+ window := make([]int, k)
+ for i := 1; i < len(nums); i++ {
+ dp[i] = nums[i] + dp[window[0]]
+ for len(window) > 0 && dp[window[len(window)-1]] <= dp[i] {
+ window = window[:len(window)-1]
+ }
+ for len(window) > 0 && i-k >= window[0] {
+ window = window[1:]
+ }
+ window = append(window, i)
+ }
+ return dp[len(nums)-1]
+}
+
+// 超时
+func maxResult1(nums []int, k int) int {
+ dp := make([]int, len(nums))
+ if k > len(nums) {
+ k = len(nums)
+ }
+ dp[0] = nums[0]
+ for i := 1; i < len(dp); i++ {
+ dp[i] = math.MinInt32
+ }
+ for i := 1; i < len(nums); i++ {
+ left, tmp := max(0, i-k), math.MinInt32
+ for j := left; j < i; j++ {
+ tmp = max(tmp, dp[j])
+ }
+ dp[i] = nums[i] + tmp
+ }
+ return dp[len(nums)-1]
+}
+
+func max(a, b int) int {
+ if a > b {
+ return a
+ }
+ return b
+}
+```
+
+
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1600~1699/1695.Maximum-Erasure-Value/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1700~1799/1700.Number-of-Students-Unable-to-Eat-Lunch/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/1600~1699/_index.md b/website/content/ChapterFour/1600~1699/_index.md
new file mode 100644
index 000000000..d2021683f
--- /dev/null
+++ b/website/content/ChapterFour/1600~1699/_index.md
@@ -0,0 +1,5 @@
+---
+bookCollapseSection: true
+weight: 20
+---
+
diff --git a/website/content/ChapterFour/1700~1799/1700.Number-of-Students-Unable-to-Eat-Lunch.md b/website/content/ChapterFour/1700~1799/1700.Number-of-Students-Unable-to-Eat-Lunch.md
new file mode 100644
index 000000000..8ba364f7c
--- /dev/null
+++ b/website/content/ChapterFour/1700~1799/1700.Number-of-Students-Unable-to-Eat-Lunch.md
@@ -0,0 +1,86 @@
+# [1700. Number of Students Unable to Eat Lunch](https://leetcode.com/problems/number-of-students-unable-to-eat-lunch/)
+
+
+## 题目
+
+The school cafeteria offers circular and square sandwiches at lunch break, referred to by numbers `0` and `1` respectively. All students stand in a queue. Each student either prefers square or circular sandwiches.
+
+The number of sandwiches in the cafeteria is equal to the number of students. The sandwiches are placed in a **stack**. At each step:
+
+- If the student at the front of the queue **prefers** the sandwich on the top of the stack, they will **take it** and leave the queue.
+- Otherwise, they will **leave it** and go to the queue's end.
+
+This continues until none of the queue students want to take the top sandwich and are thus unable to eat.
+
+You are given two integer arrays `students` and `sandwiches` where `sandwiches[i]` is the type of the `ith` sandwich in the stack (`i = 0` is the top of the stack) and `students[j]` is the preference of the `jth` student in the initial queue (`j = 0` is the front of the queue). Return *the number of students that are unable to eat.*
+
+**Example 1:**
+
+```
+Input: students = [1,1,0,0], sandwiches = [0,1,0,1]
+Output: 0
+Explanation:
+- Front student leaves the top sandwich and returns to the end of the line making students = [1,0,0,1].
+- Front student leaves the top sandwich and returns to the end of the line making students = [0,0,1,1].
+- Front student takes the top sandwich and leaves the line making students = [0,1,1] and sandwiches = [1,0,1].
+- Front student leaves the top sandwich and returns to the end of the line making students = [1,1,0].
+- Front student takes the top sandwich and leaves the line making students = [1,0] and sandwiches = [0,1].
+- Front student leaves the top sandwich and returns to the end of the line making students = [0,1].
+- Front student takes the top sandwich and leaves the line making students = [1] and sandwiches = [1].
+- Front student takes the top sandwich and leaves the line making students = [] and sandwiches = [].
+Hence all students are able to eat.
+```
+
+**Example 2:**
+
+```
+Input: students = [1,1,1,0,0,1], sandwiches = [1,0,0,0,1,1]
+Output: 3
+```
+
+**Constraints:**
+
+- `1 <= students.length, sandwiches.length <= 100`
+- `students.length == sandwiches.length`
+- `sandwiches[i]` is `0` or `1`.
+- `students[i]` is `0` or `1`.
+
+## 题目大意
+
+学校的自助午餐提供圆形和方形的三明治，分别用数字 0 和 1 表示。所有学生站在一个队列里，每个学生要么喜欢圆形的要么喜欢方形的。
+餐厅里三明治的数量与学生的数量相同。所有三明治都放在一个 栈 里，每一轮：
+
+- 如果队列最前面的学生 喜欢 栈顶的三明治，那么会 拿走它 并离开队列。
+- 否则，这名学生会 放弃这个三明治 并回到队列的尾部。
+这个过程会一直持续到队列里所有学生都不喜欢栈顶的三明治为止。
+
+给你两个整数数组 students 和 sandwiches ，其中 sandwiches[i] 是栈里面第 i 个三明治的类型（i = 0 是栈的顶部）， students[j] 是初始队列里第 j 名学生对三明治的喜好（j = 0 是队列的最开始位置）。请你返回无法吃午餐的学生数量。
+
+## 解题思路
+
+- 简单题。按照题意，学生不管怎么轮流领三明治，如果数量够，经过多轮循环，总能领到。问题可以等价为，学生依次到队列前面领取三明治。2 个种类的三明治都摆好放在那里了。最终领不到三明治的学生都是因为喜欢的三明治不够发放了。按照这个思路，先统计 2 种三明治的总个数，然后减去学生对三明治的需求总数，剩下的学生即都是无法满足的。
+
+## 代码
+
+```go
+package leetcode
+
+func countStudents(students []int, sandwiches []int) int {
+ tmp, n, i := [2]int{}, len(students), 0
+ for _, v := range students {
+ tmp[v]++
+ }
+ for i < n && tmp[sandwiches[i]] > 0 {
+ tmp[sandwiches[i]]--
+ i++
+ }
+ return n - i
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1600~1699/1696.Jump-Game-VI/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1700~1799/1704.Determine-if-String-Halves-Are-Alike/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/1700~1799/1704.Determine-if-String-Halves-Are-Alike.md b/website/content/ChapterFour/1700~1799/1704.Determine-if-String-Halves-Are-Alike.md
new file mode 100644
index 000000000..e3e454298
--- /dev/null
+++ b/website/content/ChapterFour/1700~1799/1704.Determine-if-String-Halves-Are-Alike.md
@@ -0,0 +1,82 @@
+# [1704. Determine if String Halves Are Alike](https://leetcode.com/problems/determine-if-string-halves-are-alike/)
+
+## 题目
+
+You are given a string `s` of even length. Split this string into two halves of equal lengths, and let `a` be the first half and `b` be the second half.
+
+Two strings are **alike** if they have the same number of vowels (`'a'`, `'e'`, `'i'`, `'o'`, `'u'`, `'A'`, `'E'`, `'I'`, `'O'`, `'U'`). Notice that `s` contains uppercase and lowercase letters.
+
+Return `true` *if* `a` *and* `b` *are **alike***. Otherwise, return `false`.
+
+**Example 1:**
+
+```
+Input: s = "book"
+Output: true
+Explanation: a = "bo" and b = "ok". a has 1 vowel and b has 1 vowel. Therefore, they are alike.
+```
+
+**Example 2:**
+
+```
+Input: s = "textbook"
+Output: false
+Explanation: a = "text" and b = "book". a has 1 vowel whereas b has 2. Therefore, they are not alike.
+Notice that the vowel o is counted twice.
+```
+
+**Example 3:**
+
+```
+Input: s = "MerryChristmas"
+Output: false
+```
+
+**Example 4:**
+
+```
+Input: s = "AbCdEfGh"
+Output: true
+```
+
+**Constraints:**
+
+- `2 <= s.length <= 1000`
+- `s.length` is even.
+- `s` consists of **uppercase and lowercase** letters.
+
+## 题目大意
+
+给你一个偶数长度的字符串 s 。将其拆分成长度相同的两半，前一半为 a ，后一半为 b 。两个字符串 相似 的前提是它们都含有相同数目的元音（'a'，'e'，'i'，'o'，'u'，'A'，'E'，'I'，'O'，'U'）。注意，s 可能同时含有大写和小写字母。如果 a 和 b 相似，返回 true ；否则，返回 false 。
+
+## 解题思路
+
+- 简单题。依题意，分别统计前半段元音字母的个数和后半段元音字母的个数，个数相同则输出 true，不同就输出 false。
+
+## 代码
+
+```go
+package leetcode
+
+func halvesAreAlike(s string) bool {
+ return numVowels(s[len(s)/2:]) == numVowels(s[:len(s)/2])
+}
+
+func numVowels(x string) int {
+ res := 0
+ for _, c := range x {
+ switch c {
+ case 'a', 'e', 'i', 'o', 'u', 'A', 'E', 'I', 'O', 'U':
+ res++
+ }
+ }
+ return res
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1700~1799/1700.Number-of-Students-Unable-to-Eat-Lunch/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1700~1799/1705.Maximum-Number-of-Eaten-Apples/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/1700~1799/1705.Maximum-Number-of-Eaten-Apples.md b/website/content/ChapterFour/1700~1799/1705.Maximum-Number-of-Eaten-Apples.md
new file mode 100644
index 000000000..fb4094c33
--- /dev/null
+++ b/website/content/ChapterFour/1700~1799/1705.Maximum-Number-of-Eaten-Apples.md
@@ -0,0 +1,131 @@
+# [1705. Maximum Number of Eaten Apples](https://leetcode.com/problems/maximum-number-of-eaten-apples/)
+
+## 题目
+
+There is a special kind of apple tree that grows apples every day for n days. On the ith day, the tree grows apples[i] apples that will rot after days[i] days, that is on day i + days[i] the apples will be rotten and cannot be eaten. On some days, the apple tree does not grow any apples, which are denoted by apples[i] == 0 and days[i] == 0.
+
+You decided to eat at most one apple a day (to keep the doctors away). Note that you can keep eating after the first n days.
+
+Given two integer arrays days and apples of length n, return the maximum number of apples you can eat.
+
+**Example 1**:
+
+ Input: apples = [1,2,3,5,2], days = [3,2,1,4,2]
+ Output: 7
+ Explanation: You can eat 7 apples:
+ - On the first day, you eat an apple that grew on the first day.
+ - On the second day, you eat an apple that grew on the second day.
+ - On the third day, you eat an apple that grew on the second day. After this day, the apples that grew on the third day rot.
+ - On the fourth to the seventh days, you eat apples that grew on the fourth day.
+
+**Example 2**:
+
+ Input: apples = [3,0,0,0,0,2], days = [3,0,0,0,0,2]
+ Output: 5
+ Explanation: You can eat 5 apples:
+ - On the first to the third day you eat apples that grew on the first day.
+ - Do nothing on the fouth and fifth days.
+ - On the sixth and seventh days you eat apples that grew on the sixth day.
+
+**Constraints:**
+
+- apples.length == n
+- days.length == n
+- 1 <= n <= 2 * 10000
+- 0 <= apples[i], days[i] <= 2 * 10000
+- days[i] = 0 if and only if apples[i] = 0.
+
+## 题目大意
+
+有一棵特殊的苹果树，一连 n 天，每天都可以长出若干个苹果。在第 i 天，树上会长出 apples[i] 个苹果，这些苹果将会在 days[i] 天后（也就是说，第 i + days[i] 天时）腐烂，变得无法食用。也可能有那么几天，树上不会长出新的苹果，此时用 apples[i] == 0 且 days[i] == 0 表示。
+
+你打算每天 最多 吃一个苹果来保证营养均衡。注意，你可以在这 n 天之后继续吃苹果。
+
+给你两个长度为 n 的整数数组 days 和 apples ，返回你可以吃掉的苹果的最大数目。
+
+## 解题思路
+
+贪心算法和最小堆
+
+ - data中的end表示腐烂的日期，left表示拥有的苹果数量
+ - 贪心:每天吃掉end最小但没有腐烂的苹果
+ - 最小堆:构造类型为数组(数组中元素的类型为data)的最小堆
+
+## 代码
+
+```go
+package leetcode
+
+import "container/heap"
+
+func eatenApples(apples []int, days []int) int {
+ h := hp{}
+ i := 0
+ var ans int
+ for ; i < len(apples); i++ {
+ for len(h) > 0 && h[0].end <= i {
+ heap.Pop(&h)
+ }
+ if apples[i] > 0 {
+ heap.Push(&h, data{apples[i], i + days[i]})
+ }
+ if len(h) > 0 {
+ minData := heap.Pop(&h).(data)
+ ans++
+ if minData.left > 1 {
+ heap.Push(&h, data{minData.left - 1, minData.end})
+ }
+ }
+ }
+ for len(h) > 0 {
+ for len(h) > 0 && h[0].end <= i {
+ heap.Pop(&h)
+ }
+ if len(h) == 0 {
+ break
+ }
+ minData := heap.Pop(&h).(data)
+ nums := min(minData.left, minData.end-i)
+ ans += nums
+ i += nums
+ }
+ return ans
+}
+
+func min(a, b int) int {
+ if a < b {
+ return a
+ }
+ return b
+}
+
+type data struct {
+ left int
+ end int
+}
+
+type hp []data
+
+func (h hp) Len() int { return len(h) }
+func (h hp) Less(i, j int) bool { return h[i].end < h[j].end }
+func (h hp) Swap(i, j int) { h[i], h[j] = h[j], h[i] }
+
+func (h *hp) Push(x interface{}) {
+ *h = append(*h, x.(data))
+}
+
+func (h *hp) Pop() interface{} {
+ old := *h
+ n := len(old)
+ x := old[n-1]
+ *h = old[0 : n-1]
+ return x
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1700~1799/1704.Determine-if-String-Halves-Are-Alike/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1700~1799/1710.Maximum-Units-on-a-Truck/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/1700~1799/1710.Maximum-Units-on-a-Truck.md b/website/content/ChapterFour/1700~1799/1710.Maximum-Units-on-a-Truck.md
new file mode 100644
index 000000000..2b311d0c0
--- /dev/null
+++ b/website/content/ChapterFour/1700~1799/1710.Maximum-Units-on-a-Truck.md
@@ -0,0 +1,84 @@
+# [1710. Maximum Units on a Truck](https://leetcode.com/problems/maximum-units-on-a-truck/)
+
+
+## 题目
+
+You are assigned to put some amount of boxes onto **one truck**. You are given a 2D array `boxTypes`, where `boxTypes[i] = [numberOfBoxesi, numberOfUnitsPerBoxi]`:
+
+- `numberOfBoxesi` is the number of boxes of type `i`.
+- `numberOfUnitsPerBoxi`is the number of units in each box of the type `i`.
+
+You are also given an integer `truckSize`, which is the **maximum** number of **boxes** that can be put on the truck. You can choose any boxes to put on the truck as long as the number of boxes does not exceed `truckSize`.
+
+Return *the **maximum** total number of **units** that can be put on the truck.*
+
+**Example 1:**
+
+```
+Input: boxTypes = [[1,3],[2,2],[3,1]], truckSize = 4
+Output: 8
+Explanation: There are:
+- 1 box of the first type that contains 3 units.
+- 2 boxes of the second type that contain 2 units each.
+- 3 boxes of the third type that contain 1 unit each.
+You can take all the boxes of the first and second types, and one box of the third type.
+The total number of units will be = (1 * 3) + (2 * 2) + (1 * 1) = 8.
+```
+
+**Example 2:**
+
+```
+Input: boxTypes = [[5,10],[2,5],[4,7],[3,9]], truckSize = 10
+Output: 91
+```
+
+**Constraints:**
+
+- `1 <= boxTypes.length <= 1000`
+- `1 <= numberOfBoxesi, numberOfUnitsPerBoxi <= 1000`
+- `1 <= truckSize <= 106`
+
+## 题目大意
+
+请你将一些箱子装在 一辆卡车 上。给你一个二维数组 boxTypes ，其中 boxTypes[i] = [numberOfBoxesi, numberOfUnitsPerBoxi] ：
+
+- numberOfBoxesi 是类型 i 的箱子的数量。-
+- numberOfUnitsPerBoxi 是类型 i 每个箱子可以装载的单元数量。
+
+整数 truckSize 表示卡车上可以装载 箱子 的 最大数量 。只要箱子数量不超过 truckSize ，你就可以选择任意箱子装到卡车上。返回卡车可以装载 单元 的 最大 总数。
+
+## 解题思路
+
+- 简单题。先将箱子按照单元数量从大到小排序。要想卡车装载单元数最大，那么需要尽量装单元数多的箱子。所以排序以后从单元数量多的箱子开始取。一直取至 truckSize 没有空间。累积的单元数即最大总数。
+
+## 代码
+
+```go
+package leetcode
+
+import "sort"
+
+func maximumUnits(boxTypes [][]int, truckSize int) int {
+ sort.Slice(boxTypes, func(i, j int) bool {
+ return boxTypes[i][1] > boxTypes[j][1]
+ })
+ res := 0
+ for i := 0; truckSize > 0 && i < len(boxTypes); i++ {
+ if truckSize >= boxTypes[i][0] {
+ truckSize -= boxTypes[i][0]
+ res += (boxTypes[i][1] * boxTypes[i][0])
+ } else {
+ res += (truckSize * boxTypes[i][1])
+ truckSize = 0
+ }
+ }
+ return res
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1700~1799/1705.Maximum-Number-of-Eaten-Apples/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1700~1799/1716.Calculate-Money-in-Leetcode-Bank/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/1700~1799/1716.Calculate-Money-in-Leetcode-Bank.md b/website/content/ChapterFour/1700~1799/1716.Calculate-Money-in-Leetcode-Bank.md
new file mode 100644
index 000000000..48256ac74
--- /dev/null
+++ b/website/content/ChapterFour/1700~1799/1716.Calculate-Money-in-Leetcode-Bank.md
@@ -0,0 +1,71 @@
+# [1716. Calculate Money in Leetcode Bank](https://leetcode.com/problems/calculate-money-in-leetcode-bank/)
+
+
+## 题目
+
+Hercy wants to save money for his first car. He puts money in the Leetcode bank **every day**.
+
+He starts by putting in `$1` on Monday, the first day. Every day from Tuesday to Sunday, he will put in `$1` more than the day before. On every subsequent Monday, he will put in `$1` more than the **previous Monday**.
+
+Given `n`, return *the total amount of money he will have in the Leetcode bank at the end of the* `nth` *day.*
+
+**Example 1:**
+
+```
+Input: n = 4
+Output: 10
+Explanation: After the 4th day, the total is 1 + 2 + 3 + 4 = 10.
+```
+
+**Example 2:**
+
+```
+Input: n = 10
+Output: 37
+Explanation: After the 10th day, the total is (1 + 2 + 3 + 4 + 5 + 6 + 7) + (2 + 3 + 4) = 37. Notice that on the 2nd Monday, Hercy only puts in $2.
+```
+
+**Example 3:**
+
+```
+Input: n = 20
+Output: 96
+Explanation: After the 20th day, the total is (1 + 2 + 3 + 4 + 5 + 6 + 7) + (2 + 3 + 4 + 5 + 6 + 7 + 8) + (3 + 4 + 5 + 6 + 7 + 8) = 96.
+```
+
+**Constraints:**
+
+- `1 <= n <= 1000`
+
+## 题目大意
+
+Hercy 想要为购买第一辆车存钱。他 每天 都往力扣银行里存钱。最开始，他在周一的时候存入 1 块钱。从周二到周日，他每天都比前一天多存入 1 块钱。在接下来每一个周一，他都会比 前一个周一 多存入 1 块钱。给你 n ，请你返回在第 n 天结束的时候他在力扣银行总共存了多少块钱。
+
+## 解题思路
+
+- 简单题。按照题意写 2 层循环即可。
+
+## 代码
+
+```go
+package leetcode
+
+func totalMoney(n int) int {
+ res := 0
+ for tmp, count := 1, 7; n > 0; tmp, count = tmp+1, 7 {
+ for m := tmp; n > 0 && count > 0; m++ {
+ res += m
+ n--
+ count--
+ }
+ }
+ return res
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1700~1799/1710.Maximum-Units-on-a-Truck/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1700~1799/1720.Decode-XORed-Array/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/1700~1799/1720.Decode-XORed-Array.md b/website/content/ChapterFour/1700~1799/1720.Decode-XORed-Array.md
new file mode 100644
index 000000000..130eb3d4f
--- /dev/null
+++ b/website/content/ChapterFour/1700~1799/1720.Decode-XORed-Array.md
@@ -0,0 +1,66 @@
+# [1720. Decode XORed Array](https://leetcode.com/problems/decode-xored-array/)
+
+
+## 题目
+
+There is a **hidden** integer array `arr` that consists of `n` non-negative integers.
+
+It was encoded into another integer array `encoded` of length `n - 1`, such that `encoded[i] = arr[i] XOR arr[i + 1]`. For example, if `arr = [1,0,2,1]`, then `encoded = [1,2,3]`.
+
+You are given the `encoded` array. You are also given an integer `first`, that is the first element of `arr`, i.e. `arr[0]`.
+
+Return *the original array* `arr`. It can be proved that the answer exists and is unique.
+
+**Example 1:**
+
+```
+Input: encoded = [1,2,3], first = 1
+Output: [1,0,2,1]
+Explanation: If arr = [1,0,2,1], then first = 1 and encoded = [1 XOR 0, 0 XOR 2, 2 XOR 1] = [1,2,3]
+
+```
+
+**Example 2:**
+
+```
+Input: encoded = [6,2,7,3], first = 4
+Output: [4,2,0,7,4]
+
+```
+
+**Constraints:**
+
+- `2 <= n <= 104`
+- `encoded.length == n - 1`
+- `0 <= encoded[i] <= 105`
+- `0 <= first <= 10^5`
+
+## 题目大意
+
+未知 整数数组 arr 由 n 个非负整数组成。经编码后变为长度为 n - 1 的另一个整数数组 encoded ，其中 encoded[i] = arr[i] XOR arr[i + 1] 。例如，arr = [1,0,2,1] 经编码后得到 encoded = [1,2,3] 。给你编码后的数组 encoded 和原数组 arr 的第一个元素 first（arr[0]）。请解码返回原数组 arr 。可以证明答案存在并且是唯一的。
+
+## 解题思路
+
+- 简单题。按照题意，求返回解码以后的原数组，即将编码后的数组前后两两元素依次做异或 `XOR` 运算。
+
+## 代码
+
+```go
+package leetcode
+
+func decode(encoded []int, first int) []int {
+ arr := make([]int, len(encoded)+1)
+ arr[0] = first
+ for i, val := range encoded {
+ arr[i+1] = arr[i] ^ val
+ }
+ return arr
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1700~1799/1716.Calculate-Money-in-Leetcode-Bank/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1700~1799/1721.Swapping-Nodes-in-a-Linked-List/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/1700~1799/1721.Swapping-Nodes-in-a-Linked-List.md b/website/content/ChapterFour/1700~1799/1721.Swapping-Nodes-in-a-Linked-List.md
new file mode 100644
index 000000000..70e7b2412
--- /dev/null
+++ b/website/content/ChapterFour/1700~1799/1721.Swapping-Nodes-in-a-Linked-List.md
@@ -0,0 +1,107 @@
+# [1721. Swapping Nodes in a Linked List](https://leetcode.com/problems/swapping-nodes-in-a-linked-list/)
+
+
+## 题目
+
+You are given the `head` of a linked list, and an integer `k`.
+
+Return *the head of the linked list after **swapping** the values of the* `kth` *node from the beginning and the* `kth` *node from the end (the list is **1-indexed**).*
+
+**Example 1:**
+
+
+
+```
+Input: head = [1,2,3,4,5], k = 2
+Output: [1,4,3,2,5]
+```
+
+**Example 2:**
+
+```
+Input: head = [7,9,6,6,7,8,3,0,9,5], k = 5
+Output: [7,9,6,6,8,7,3,0,9,5]
+```
+
+**Example 3:**
+
+```
+Input: head = [1], k = 1
+Output: [1]
+```
+
+**Example 4:**
+
+```
+Input: head = [1,2], k = 1
+Output: [2,1]
+```
+
+**Example 5:**
+
+```
+Input: head = [1,2,3], k = 2
+Output: [1,2,3]
+```
+
+**Constraints:**
+
+- The number of nodes in the list is `n`.
+- `1 <= k <= n <= 10^5`
+- `0 <= Node.val <= 100`
+
+## 题目大意
+
+给你链表的头节点 `head` 和一个整数 `k` 。**交换** 链表正数第 `k` 个节点和倒数第 `k` 个节点的值后，返回链表的头节点（链表 **从 1 开始索引**）。
+
+## 解题思路
+
+- 这道题虽然是 medium，但是实际非常简单。题目要求链表中 2 个节点的值，无非是先找到这 2 个节点，然后再交换即可。链表查询节点需要 O(n)，2 次循环找到对应的 2 个节点，交换值即可。
+
+## 代码
+
+```go
+package leetcode
+
+import (
+ "github.com/halfrost/leetcode-go/structures"
+)
+
+// ListNode define
+type ListNode = structures.ListNode
+
+/**
+ * Definition for singly-linked list.
+ * type ListNode struct {
+ * Val int
+ * Next *ListNode
+ * }
+ */
+func swapNodes(head *ListNode, k int) *ListNode {
+ count := 1
+ var a, b *ListNode
+ for node := head; node != nil; node = node.Next {
+ if count == k {
+ a = node
+ }
+ count++
+ }
+ length := count
+ count = 1
+ for node := head; node != nil; node = node.Next {
+ if count == length-k {
+ b = node
+ }
+ count++
+ }
+ a.Val, b.Val = b.Val, a.Val
+ return head
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1700~1799/1720.Decode-XORed-Array/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1700~1799/1725.Number-Of-Rectangles-That-Can-Form-The-Largest-Square/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/1700~1799/1725.Number-Of-Rectangles-That-Can-Form-The-Largest-Square.md b/website/content/ChapterFour/1700~1799/1725.Number-Of-Rectangles-That-Can-Form-The-Largest-Square.md
new file mode 100644
index 000000000..05bb9b25d
--- /dev/null
+++ b/website/content/ChapterFour/1700~1799/1725.Number-Of-Rectangles-That-Can-Form-The-Largest-Square.md
@@ -0,0 +1,75 @@
+# [1725. Number Of Rectangles That Can Form The Largest Square](https://leetcode.com/problems/number-of-rectangles-that-can-form-the-largest-square/)
+
+
+## 题目
+
+You are given an array `rectangles` where `rectangles[i] = [li, wi]` represents the `ith` rectangle of length `li` and width `wi`.
+
+You can cut the `ith` rectangle to form a square with a side length of `k` if both `k <= li` and `k <= wi`. For example, if you have a rectangle `[4,6]`, you can cut it to get a square with a side length of at most `4`.
+
+Let `maxLen` be the side length of the **largest** square you can obtain from any of the given rectangles.
+
+Return *the **number** of rectangles that can make a square with a side length of* `maxLen`.
+
+**Example 1:**
+
+```
+Input: rectangles = [[5,8],[3,9],[5,12],[16,5]]
+Output: 3
+Explanation: The largest squares you can get from each rectangle are of lengths [5,3,5,5].
+The largest possible square is of length 5, and you can get it out of 3 rectangles.
+```
+
+**Example 2:**
+
+```
+Input: rectangles = [[2,3],[3,7],[4,3],[3,7]]
+Output: 3
+```
+
+**Constraints:**
+
+- `1 <= rectangles.length <= 1000`
+- `rectangles[i].length == 2`
+- `1 <= li, wi <= 10^9`
+- `li != wi`
+
+## 题目大意
+
+给你一个数组 rectangles ，其中 rectangles[i] = [li, wi] 表示第 i 个矩形的长度为 li 、宽度为 wi 。如果存在 k 同时满足 k <= li 和 k <= wi ，就可以将第 i 个矩形切成边长为 k 的正方形。例如，矩形 [4,6] 可以切成边长最大为 4 的正方形。设 maxLen 为可以从矩形数组 rectangles 切分得到的 最大正方形 的边长。返回可以切出边长为 maxLen 的正方形的矩形 数目 。
+
+## 解题思路
+
+- 简单题。扫描数组中的每一个矩形，先找到边长较小的那条边，作为正方形的边长。扫描过程中动态更新最大的正方形边长，并累加计数。循环一遍结束，输出最终计数值即可。
+
+## 代码
+
+```go
+package leetcode
+
+func countGoodRectangles(rectangles [][]int) int {
+ minLength, count := 0, 0
+ for i, _ := range rectangles {
+ minSide := 0
+ if rectangles[i][0] <= rectangles[i][1] {
+ minSide = rectangles[i][0]
+ } else {
+ minSide = rectangles[i][1]
+ }
+ if minSide > minLength {
+ minLength = minSide
+ count = 1
+ } else if minSide == minLength {
+ count++
+ }
+ }
+ return count
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1700~1799/1721.Swapping-Nodes-in-a-Linked-List/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1700~1799/1732.Find-the-Highest-Altitude/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/1700~1799/1732.Find-the-Highest-Altitude.md b/website/content/ChapterFour/1700~1799/1732.Find-the-Highest-Altitude.md
new file mode 100644
index 000000000..7ff314990
--- /dev/null
+++ b/website/content/ChapterFour/1700~1799/1732.Find-the-Highest-Altitude.md
@@ -0,0 +1,62 @@
+# [1732. Find the Highest Altitude](https://leetcode.com/problems/find-the-highest-altitude/)
+
+
+## 题目
+
+There is a biker going on a road trip. The road trip consists of `n + 1` points at different altitudes. The biker starts his trip on point `0` with altitude equal `0`.
+
+You are given an integer array `gain` of length `n` where `gain[i]` is the **net gain in altitude** between points `i` and `i + 1` for all (`0 <= i < n)`. Return *the **highest altitude** of a point.*
+
+**Example 1:**
+
+```
+Input: gain = [-5,1,5,0,-7]
+Output: 1
+Explanation: The altitudes are [0,-5,-4,1,1,-6]. The highest is 1.
+```
+
+**Example 2:**
+
+```
+Input: gain = [-4,-3,-2,-1,4,3,2]
+Output: 0
+Explanation: The altitudes are [0,-4,-7,-9,-10,-6,-3,-1]. The highest is 0.
+```
+
+**Constraints:**
+
+- `n == gain.length`
+- `1 <= n <= 100`
+- `100 <= gain[i] <= 100`
+
+## 题目大意
+
+有一个自行车手打算进行一场公路骑行，这条路线总共由 n + 1 个不同海拔的点组成。自行车手从海拔为 0 的点 0 开始骑行。给你一个长度为 n 的整数数组 gain ，其中 gain[i] 是点 i 和点 i + 1 的 净海拔高度差（0 <= i < n）。请你返回 最高点的海拔 。
+
+## 解题思路
+
+- 简单题。循环数组依次从第一个海拔点开始还原每个海拔点，动态记录最大高度。循环结束输出最大高度即可。
+
+## 代码
+
+```go
+package leetcode
+
+func largestAltitude(gain []int) int {
+ max, height := 0, 0
+ for _, g := range gain {
+ height += g
+ if height > max {
+ max = height
+ }
+ }
+ return max
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1700~1799/1725.Number-Of-Rectangles-That-Can-Form-The-Largest-Square/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1700~1799/1734.Decode-XORed-Permutation/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/1700~1799/1734.Decode-XORed-Permutation.md b/website/content/ChapterFour/1700~1799/1734.Decode-XORed-Permutation.md
new file mode 100644
index 000000000..eef845b91
--- /dev/null
+++ b/website/content/ChapterFour/1700~1799/1734.Decode-XORed-Permutation.md
@@ -0,0 +1,82 @@
+# [1734. Decode XORed Permutation](https://leetcode.com/problems/decode-xored-permutation/)
+
+
+## 题目
+
+There is an integer array `perm` that is a permutation of the first `n` positive integers, where `n` is always **odd**.
+
+It was encoded into another integer array `encoded` of length `n - 1`, such that `encoded[i] = perm[i] XOR perm[i + 1]`. For example, if `perm = [1,3,2]`, then `encoded = [2,1]`.
+
+Given the `encoded` array, return *the original array* `perm`. It is guaranteed that the answer exists and is unique.
+
+**Example 1:**
+
+```
+Input: encoded = [3,1]
+Output: [1,2,3]
+Explanation: If perm = [1,2,3], then encoded = [1 XOR 2,2 XOR 3] = [3,1]
+
+```
+
+**Example 2:**
+
+```
+Input: encoded = [6,5,4,6]
+Output: [2,4,1,5,3]
+
+```
+
+**Constraints:**
+
+- `3 <= n < 10^5`
+- `n` is odd.
+- `encoded.length == n - 1`
+
+## 题目大意
+
+给你一个整数数组 perm ，它是前 n 个正整数的排列，且 n 是个奇数 。它被加密成另一个长度为 n - 1 的整数数组 encoded ，满足 encoded[i] = perm[i] XOR perm[i + 1] 。比方说，如果 perm = [1,3,2] ，那么 encoded = [2,1] 。给你 encoded 数组，请你返回原始数组 perm 。题目保证答案存在且唯一。
+
+## 解题思路
+
+- 这一题与第 136 题和第 137 题思路类似，借用 `x ^ x = 0` 这个性质解题。依题意，原数组 perm 是 n 个正整数，即取值在 `[1,n+1]` 区间内，但是排列顺序未知。可以考虑先将 `[1,n+1]` 区间内的所有数异或得到 total。再将 encoded 数组中奇数下标的元素异或得到 odd：
+
+ {{< katex display >}}
+ \begin{aligned}odd &= encoded[1] + encoded[3] + ... + encoded[n-1]\\&= (perm[1] \,\, XOR \,\, perm[2]) + (perm[3] \,\, XOR \,\, perm[4]) + ... + (perm[n-1] \,\, XOR \,\, perm[n])\end{aligned}
+ {{< /katex >}}
+
+ total 是 n 个正整数异或全集，odd 是 `n-1` 个正整数异或集。两者异或 `total ^ odd` 得到的值必定是 perm[0]，因为 `x ^ x = 0`，那么重复出现的元素被异或以后消失了。算出 perm[0] 就好办了。
+
+ {{< katex display >}}
+ \begin{aligned}encoded[0] &= perm[0] \,\, XOR \,\, perm[1]\\perm[0] \,\, XOR \,\, encoded[0] &= perm[0] \,\, XOR \,\, perm[0] \,\, XOR \,\, perm[1] = perm[1]\\perm[1] \,\, XOR \,\, encoded[1] &= perm[1] \,\, XOR \,\, perm[1] \,\, XOR \,\, perm[2] = perm[2]\\...\\perm[n-1] \,\, XOR \,\, encoded[n-1] &= perm[n-1] \,\, XOR \,\, perm[n-1] \,\, XOR \,\, perm[n] = perm[n]\\\end{aligned}
+ {{< /katex >}}
+
+ 依次类推，便可以推出原数组 perm 中的所有数。
+
+## 代码
+
+```go
+package leetcode
+
+func decode(encoded []int) []int {
+ n, total, odd := len(encoded), 0, 0
+ for i := 1; i <= n+1; i++ {
+ total ^= i
+ }
+ for i := 1; i < n; i += 2 {
+ odd ^= encoded[i]
+ }
+ perm := make([]int, n+1)
+ perm[0] = total ^ odd
+ for i, v := range encoded {
+ perm[i+1] = perm[i] ^ v
+ }
+ return perm
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1700~1799/1732.Find-the-Highest-Altitude/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1700~1799/1736.Latest-Time-by-Replacing-Hidden-Digits/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/1700~1799/1736.Latest-Time-by-Replacing-Hidden-Digits.md b/website/content/ChapterFour/1700~1799/1736.Latest-Time-by-Replacing-Hidden-Digits.md
new file mode 100644
index 000000000..c8d3cf920
--- /dev/null
+++ b/website/content/ChapterFour/1700~1799/1736.Latest-Time-by-Replacing-Hidden-Digits.md
@@ -0,0 +1,82 @@
+# [1736. Latest Time by Replacing Hidden Digits](https://leetcode.com/problems/latest-time-by-replacing-hidden-digits/)
+
+
+## 题目
+
+You are given a string `time` in the form of `hh:mm`, where some of the digits in the string are hidden (represented by `?`).
+
+The valid times are those inclusively between `00:00` and `23:59`.
+
+Return *the latest valid time you can get from* `time` *by replacing the hidden* *digits*.
+
+**Example 1:**
+
+```
+Input: time = "2?:?0"
+Output: "23:50"
+Explanation: The latest hour beginning with the digit '2' is 23 and the latest minute ending with the digit '0' is 50.
+```
+
+**Example 2:**
+
+```
+Input: time = "0?:3?"
+Output: "09:39"
+```
+
+**Example 3:**
+
+```
+Input: time = "1?:22"
+Output: "19:22"
+```
+
+**Constraints:**
+
+- `time` is in the format `hh:mm`.
+- It is guaranteed that you can produce a valid time from the given string.
+
+## 题目大意
+
+给你一个字符串 time ，格式为 hh:mm（小时：分钟），其中某几位数字被隐藏（用 ? 表示）。有效的时间为 00:00 到 23:59 之间的所有时间，包括 00:00 和 23:59 。替换 time 中隐藏的数字，返回你可以得到的最晚有效时间。
+
+## 解题思路
+
+- 简单题。根据题意，需要找到最晚的有效时间。枚举时间 4 个位置即可。如果第 3 个位置是 ？，那么它最晚时间是 5；如果第 4 个位置是 ？，那么它最晚时间是 9；如果第 2 个位置是 ？，那么它最晚时间是 9；如果第 1 个位置是 ？，根据第 2 个位置判断，如果第 2 个位置是大于 3 的数，那么第一个位置最晚时间是 1，如果第 2 个位置是小于 3 的数那么第一个位置最晚时间是 2 。按照上述规则即可还原最晚时间。
+
+## 代码
+
+```go
+package leetcode
+
+func maximumTime(time string) string {
+ timeb := []byte(time)
+ if timeb[3] == '?' {
+ timeb[3] = '5'
+ }
+ if timeb[4] == '?' {
+ timeb[4] = '9'
+ }
+ if timeb[0] == '?' {
+ if int(timeb[1]-'0') > 3 && int(timeb[1]-'0') < 10 {
+ timeb[0] = '1'
+ } else {
+ timeb[0] = '2'
+ }
+ }
+ if timeb[1] == '?' {
+ timeb[1] = '9'
+ }
+ if timeb[0] == '2' && timeb[1] == '9' {
+ timeb[1] = '3'
+ }
+ return string(timeb)
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1700~1799/1734.Decode-XORed-Permutation/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1700~1799/1738.Find-Kth-Largest-XOR-Coordinate-Value/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/1700~1799/1738.Find-Kth-Largest-XOR-Coordinate-Value.md b/website/content/ChapterFour/1700~1799/1738.Find-Kth-Largest-XOR-Coordinate-Value.md
new file mode 100644
index 000000000..c5d0cc20b
--- /dev/null
+++ b/website/content/ChapterFour/1700~1799/1738.Find-Kth-Largest-XOR-Coordinate-Value.md
@@ -0,0 +1,118 @@
+# [1738. Find Kth Largest XOR Coordinate Value](https://leetcode.com/problems/find-kth-largest-xor-coordinate-value/)
+
+
+## 题目
+
+You are given a 2D `matrix` of size `m x n`, consisting of non-negative integers. You are also given an integer `k`.
+
+The **value** of coordinate `(a, b)` of the matrix is the XOR of all `matrix[i][j]` where `0 <= i <= a < m` and `0 <= j <= b < n` **(0-indexed)**.
+
+Find the `kth` largest value **(1-indexed)** of all the coordinates of `matrix`.
+
+**Example 1:**
+
+```
+Input: matrix = [[5,2],[1,6]], k = 1
+Output: 7
+Explanation: The value of coordinate (0,1) is 5 XOR 2 = 7, which is the largest value.
+```
+
+**Example 2:**
+
+```
+Input: matrix = [[5,2],[1,6]], k = 2
+Output: 5
+Explanation:The value of coordinate (0,0) is 5 = 5, which is the 2nd largest value.
+```
+
+**Example 3:**
+
+```
+Input: matrix = [[5,2],[1,6]], k = 3
+Output: 4
+Explanation: The value of coordinate (1,0) is 5 XOR 1 = 4, which is the 3rd largest value.
+```
+
+**Example 4:**
+
+```
+Input: matrix = [[5,2],[1,6]], k = 4
+Output: 0
+Explanation: The value of coordinate (1,1) is 5 XOR 2 XOR 1 XOR 6 = 0, which is the 4th largest value.
+```
+
+**Constraints:**
+
+- `m == matrix.length`
+- `n == matrix[i].length`
+- `1 <= m, n <= 1000`
+- `0 <= matrix[i][j] <= 10^6`
+- `1 <= k <= m * n`
+
+## 题目大意
+
+给你一个二维矩阵 matrix 和一个整数 k ，矩阵大小为 m x n 由非负整数组成。矩阵中坐标 (a, b) 的 值 可由对所有满足 0 <= i <= a < m 且 0 <= j <= b < n 的元素 matrix[i][j]（下标从 0 开始计数）执行异或运算得到。请你找出 matrix 的所有坐标中第 k 大的值（k 的值从 1 开始计数）。
+
+## 解题思路
+
+- 区间异或结果类比于区间二维前缀和。只不过需要注意 x^x = 0 这一性质。举例：
+
+ 
+
+ 通过简单推理，可以得出区间二维前缀和 preSum 的递推式。具体代码见解法二。
+
+- 上面的解法中，preSum 用二维数组计算的。能否再优化空间复杂度，降低成 O(n)？答案是可以的。通过观察可以发现。preSum 可以按照一行一行来生成。先生成 preSum 前一行，下一行生成过程中会用到前一行的信息，异或计算以后，可以覆盖原数据(前一行的信息)，对之后的计算没有影响。这个优化空间复杂度的方法和优化 DP 空间复杂度是完全一样的思路和方法。
+
+ 
+
+ 具体代码见解法一。
+
+- 计算出了 preSum，还需要考虑如何输出第 k 大的值。有 3 种做法，第一种是排序，第二种是优先队列，第三种是第 215 题中的 O(n) 的 partition 方法。时间复杂度最低的当然是 O(n)。但是经过实际测试，runtime 最优的是排序的方法。所以笔者以下两种方法均采用了排序的方法。
+
+## 代码
+
+```go
+package leetcode
+
+import "sort"
+
+// 解法一 压缩版的前缀和
+func kthLargestValue(matrix [][]int, k int) int {
+ if len(matrix) == 0 || len(matrix[0]) == 0 {
+ return 0
+ }
+ res, prefixSum := make([]int, 0, len(matrix)*len(matrix[0])), make([]int, len(matrix[0]))
+ for i := range matrix {
+ line := 0
+ for j, v := range matrix[i] {
+ line ^= v
+ prefixSum[j] ^= line
+ res = append(res, prefixSum[j])
+ }
+ }
+ sort.Ints(res)
+ return res[len(res)-k]
+}
+
+// 解法二 前缀和
+func kthLargestValue1(matrix [][]int, k int) int {
+ nums, prefixSum := []int{}, make([][]int, len(matrix)+1)
+ prefixSum[0] = make([]int, len(matrix[0])+1)
+ for i, row := range matrix {
+ prefixSum[i+1] = make([]int, len(matrix[0])+1)
+ for j, val := range row {
+ prefixSum[i+1][j+1] = prefixSum[i+1][j] ^ prefixSum[i][j+1] ^ prefixSum[i][j] ^ val
+ nums = append(nums, prefixSum[i+1][j+1])
+ }
+ }
+ sort.Ints(nums)
+ return nums[len(nums)-k]
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1700~1799/1736.Latest-Time-by-Replacing-Hidden-Digits/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1700~1799/1742.Maximum-Number-of-Balls-in-a-Box/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/1700~1799/1742.Maximum-Number-of-Balls-in-a-Box.md b/website/content/ChapterFour/1700~1799/1742.Maximum-Number-of-Balls-in-a-Box.md
new file mode 100644
index 000000000..188f72959
--- /dev/null
+++ b/website/content/ChapterFour/1700~1799/1742.Maximum-Number-of-Balls-in-a-Box.md
@@ -0,0 +1,88 @@
+# [1742. Maximum Number of Balls in a Box](https://leetcode.com/problems/maximum-number-of-balls-in-a-box/)
+
+
+## 题目
+
+You are working in a ball factory where you have `n` balls numbered from `lowLimit` up to `highLimit` **inclusive** (i.e., `n == highLimit - lowLimit + 1`), and an infinite number of boxes numbered from `1` to `infinity`.
+
+Your job at this factory is to put each ball in the box with a number equal to the sum of digits of the ball's number. For example, the ball number `321` will be put in the box number `3 + 2 + 1 = 6` and the ball number `10` will be put in the box number `1 + 0 = 1`.
+
+Given two integers `lowLimit` and `highLimit`, return *the number of balls in the box with the most balls.*
+
+**Example 1:**
+
+```
+Input: lowLimit = 1, highLimit = 10
+Output: 2
+Explanation:
+Box Number: 1 2 3 4 5 6 7 8 9 10 11 ...
+Ball Count: 2 1 1 1 1 1 1 1 1 0 0 ...
+Box 1 has the most number of balls with 2 balls.
+```
+
+**Example 2:**
+
+```
+Input: lowLimit = 5, highLimit = 15
+Output: 2
+Explanation:
+Box Number: 1 2 3 4 5 6 7 8 9 10 11 ...
+Ball Count: 1 1 1 1 2 2 1 1 1 0 0 ...
+Boxes 5 and 6 have the most number of balls with 2 balls in each.
+
+```
+
+**Example 3:**
+
+```
+Input: lowLimit = 19, highLimit = 28
+Output: 2
+Explanation:
+Box Number: 1 2 3 4 5 6 7 8 9 10 11 12 ...
+Ball Count: 0 1 1 1 1 1 1 1 1 2 0 0 ...
+Box 10 has the most number of balls with 2 balls.
+
+```
+
+**Constraints:**
+
+- `1 <= lowLimit <= highLimit <= 10^5`
+
+## 题目大意
+
+你在一家生产小球的玩具厂工作，有 n 个小球，编号从 lowLimit 开始，到 highLimit 结束（包括 lowLimit 和 highLimit ，即 n == highLimit - lowLimit + 1）。另有无限数量的盒子，编号从 1 到 infinity 。你的工作是将每个小球放入盒子中，其中盒子的编号应当等于小球编号上每位数字的和。例如，编号 321 的小球应当放入编号 3 + 2 + 1 = 6 的盒子，而编号 10 的小球应当放入编号 1 + 0 = 1 的盒子。
+
+给你两个整数 lowLimit 和 highLimit ，返回放有最多小球的盒子中的小球数量。如果有多个盒子都满足放有最多小球，只需返回其中任一盒子的小球数量。
+
+## 解题思路
+
+- 简单题。循环遍历一遍数组，依次计算出所有小球的编号各位数字累加和，并且动态维护放有小球最多的数目。循环结束，输出最多小球个数即可。
+
+## 代码
+
+```go
+package leetcode
+
+func countBalls(lowLimit int, highLimit int) int {
+ buckets, maxBall := [46]int{}, 0
+ for i := lowLimit; i <= highLimit; i++ {
+ t := 0
+ for j := i; j > 0; {
+ t += j % 10
+ j = j / 10
+ }
+ buckets[t]++
+ if buckets[t] > maxBall {
+ maxBall = buckets[t]
+ }
+ }
+ return maxBall
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1700~1799/1738.Find-Kth-Largest-XOR-Coordinate-Value/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1700~1799/1744.Can-You-Eat-Your-Favorite-Candy-on-Your-Favorite-Day/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/1700~1799/1744.Can-You-Eat-Your-Favorite-Candy-on-Your-Favorite-Day.md b/website/content/ChapterFour/1700~1799/1744.Can-You-Eat-Your-Favorite-Candy-on-Your-Favorite-Day.md
new file mode 100644
index 000000000..1be8f7864
--- /dev/null
+++ b/website/content/ChapterFour/1700~1799/1744.Can-You-Eat-Your-Favorite-Candy-on-Your-Favorite-Day.md
@@ -0,0 +1,95 @@
+# [1744. Can You Eat Your Favorite Candy on Your Favorite Day?](https://leetcode.com/problems/can-you-eat-your-favorite-candy-on-your-favorite-day/)
+
+## 题目
+
+You are given a **(0-indexed)** array of positive integers `candiesCount` where `candiesCount[i]` represents the number of candies of the `ith` type you have. You are also given a 2D array `queries` where `queries[i] = [favoriteTypei, favoriteDayi, dailyCapi]`.
+
+You play a game with the following rules:
+
+- You start eating candies on day **`0`**.
+- You **cannot** eat **any** candy of type `i` unless you have eaten **all** candies of type `i - 1`.
+- You must eat **at least** **one** candy per day until you have eaten all the candies.
+
+Construct a boolean array `answer` such that `answer.length == queries.length` and `answer[i]` is `true` if you can eat a candy of type `favoriteTypei` on day `favoriteDayi` without eating **more than** `dailyCapi` candies on **any** day, and `false` otherwise. Note that you can eat different types of candy on the same day, provided that you follow rule 2.
+
+Return *the constructed array* `answer`.
+
+**Example 1:**
+
+```
+Input: candiesCount = [7,4,5,3,8], queries = [[0,2,2],[4,2,4],[2,13,1000000000]]
+Output: [true,false,true]
+Explanation:
+1- If you eat 2 candies (type 0) on day 0 and 2 candies (type 0) on day 1, you will eat a candy of type 0 on day 2.
+2- You can eat at most 4 candies each day.
+ If you eat 4 candies every day, you will eat 4 candies (type 0) on day 0 and 4 candies (type 0 and type 1) on day 1.
+ On day 2, you can only eat 4 candies (type 1 and type 2), so you cannot eat a candy of type 4 on day 2.
+3- If you eat 1 candy each day, you will eat a candy of type 2 on day 13.
+```
+
+**Example 2:**
+
+```
+Input: candiesCount = [5,2,6,4,1], queries = [[3,1,2],[4,10,3],[3,10,100],[4,100,30],[1,3,1]]
+Output: [false,true,true,false,false]
+```
+
+**Constraints:**
+
+- `1 <= candiesCount.length <= 105`
+- `1 <= candiesCount[i] <= 105`
+- `1 <= queries.length <= 105`
+- `queries[i].length == 3`
+- `0 <= favoriteTypei < candiesCount.length`
+- `0 <= favoriteDayi <= 109`
+- `1 <= dailyCapi <= 109`
+
+## 题目大意
+
+给你一个下标从 0 开始的正整数数组 candiesCount ，其中 candiesCount[i] 表示你拥有的第 i 类糖果的数目。同时给你一个二维数组 queries ，其中 queries[i] = [favoriteTypei, favoriteDayi, dailyCapi] 。你按照如下规则进行一场游戏：
+
+- 你从第 0 天开始吃糖果。
+- 你在吃完 所有 第 i - 1 类糖果之前，不能 吃任何一颗第 i 类糖果。
+- 在吃完所有糖果之前，你必须每天 至少 吃 一颗 糖果。
+
+请你构建一个布尔型数组 answer ，满足 answer.length == queries.length 。answer[i] 为 true 的条件是：在每天吃 不超过 dailyCapi 颗糖果的前提下，你可以在第 favoriteDayi 天吃到第 favoriteTypei 类糖果；否则 answer[i] 为 false 。注意，只要满足上面 3 条规则中的第二条规则，你就可以在同一天吃不同类型的糖果。请你返回得到的数组 answer 。
+
+## 解题思路
+
+- 每天吃糖个数的下限是 1 颗，上限是 dailyCap。针对每一个 query 查询在第 i 天能否吃到 i 类型的糖果，要想吃到 i 类型的糖果，必须吃完 i-1 类型的糖果。意味着在 [favoriteDayi + 1, (favoriteDayi+1)×dailyCapi] 区间内能否包含一颗第 favoriteTypei 类型的糖果。如果能包含则输出 true，不能包含则输出 false。吃的糖果数是累积的，所以这里利用前缀和计算出累积吃糖果数所在区间 [sum[favoriteTypei−1]+1, sum[favoriteTypei]]。最后判断 query 区间和累积吃糖果数的区间是否有重叠即可。如果重叠即输出 true。
+- 判断两个区间是否重合，情况有好几种：内包含，全包含，半包含等等。没有交集的情况比较少，所以可以用排除法。对于区间 [x1, y1] 以及 [x2, y2]，它们没有交集当且仅当 x1 > y2 或者 y1 < x2。
+
+## 代码
+
+```go
+package leetcode
+
+func canEat(candiesCount []int, queries [][]int) []bool {
+ n := len(candiesCount)
+ prefixSum := make([]int, n)
+ prefixSum[0] = candiesCount[0]
+ for i := 1; i < n; i++ {
+ prefixSum[i] = prefixSum[i-1] + candiesCount[i]
+ }
+ res := make([]bool, len(queries))
+ for i, q := range queries {
+ favoriteType, favoriteDay, dailyCap := q[0], q[1], q[2]
+ x1 := favoriteDay + 1
+ y1 := (favoriteDay + 1) * dailyCap
+ x2 := 1
+ if favoriteType > 0 {
+ x2 = prefixSum[favoriteType-1] + 1
+ }
+ y2 := prefixSum[favoriteType]
+ res[i] = !(x1 > y2 || y1 < x2)
+ }
+ return res
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1700~1799/1742.Maximum-Number-of-Balls-in-a-Box/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1700~1799/1748.Sum-of-Unique-Elements/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/1700~1799/1748.Sum-of-Unique-Elements.md b/website/content/ChapterFour/1700~1799/1748.Sum-of-Unique-Elements.md
new file mode 100644
index 000000000..27fade95e
--- /dev/null
+++ b/website/content/ChapterFour/1700~1799/1748.Sum-of-Unique-Elements.md
@@ -0,0 +1,74 @@
+# [1748. Sum of Unique Elements](https://leetcode.com/problems/sum-of-unique-elements/)
+
+
+## 题目
+
+You are given an integer array `nums`. The unique elements of an array are the elements that appear **exactly once** in the array.
+
+Return *the **sum** of all the unique elements of* `nums`.
+
+**Example 1:**
+
+```
+Input: nums = [1,2,3,2]
+Output: 4
+Explanation: The unique elements are [1,3], and the sum is 4.
+```
+
+**Example 2:**
+
+```
+Input: nums = [1,1,1,1,1]
+Output: 0
+Explanation: There are no unique elements, and the sum is 0.
+```
+
+**Example 3:**
+
+```
+Input: nums = [1,2,3,4,5]
+Output: 15
+Explanation: The unique elements are [1,2,3,4,5], and the sum is 15.
+```
+
+**Constraints:**
+
+- `1 <= nums.length <= 100`
+- `1 <= nums[i] <= 100`
+
+## 题目大意
+
+给你一个整数数组 `nums` 。数组中唯一元素是那些只出现 **恰好一次** 的元素。请你返回 `nums` 中唯一元素的 **和** 。
+
+## 解题思路
+
+- 简单题。利用 map 统计出每个元素出现的频次。再累加所有频次为 1 的元素，最后输出累加和即可。
+
+## 代码
+
+```go
+package leetcode
+
+func sumOfUnique(nums []int) int {
+ freq, res := make(map[int]int), 0
+ for _, v := range nums {
+ if _, ok := freq[v]; !ok {
+ freq[v] = 0
+ }
+ freq[v]++
+ }
+ for k, v := range freq {
+ if v == 1 {
+ res += k
+ }
+ }
+ return res
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1700~1799/1744.Can-You-Eat-Your-Favorite-Candy-on-Your-Favorite-Day/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1700~1799/1752.Check-if-Array-Is-Sorted-and-Rotated/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/1700~1799/1752.Check-if-Array-Is-Sorted-and-Rotated.md b/website/content/ChapterFour/1700~1799/1752.Check-if-Array-Is-Sorted-and-Rotated.md
new file mode 100644
index 000000000..b72e4ff6e
--- /dev/null
+++ b/website/content/ChapterFour/1700~1799/1752.Check-if-Array-Is-Sorted-and-Rotated.md
@@ -0,0 +1,93 @@
+# [1752. Check if Array Is Sorted and Rotated](https://leetcode.com/problems/check-if-array-is-sorted-and-rotated/)
+
+
+## 题目
+
+Given an array `nums`, return `true` *if the array was originally sorted in non-decreasing order, then rotated **some** number of positions (including zero)*. Otherwise, return `false`.
+
+There may be **duplicates** in the original array.
+
+**Note:** An array `A` rotated by `x` positions results in an array `B` of the same length such that `A[i] == B[(i+x) % A.length]`, where `%` is the modulo operation.
+
+**Example 1:**
+
+```
+Input: nums = [3,4,5,1,2]
+Output: true
+Explanation: [1,2,3,4,5] is the original sorted array.
+You can rotate the array by x = 3 positions to begin on the the element of value 3: [3,4,5,1,2].
+```
+
+**Example 2:**
+
+```
+Input: nums = [2,1,3,4]
+Output: false
+Explanation: There is no sorted array once rotated that can make nums.
+```
+
+**Example 3:**
+
+```
+Input: nums = [1,2,3]
+Output: true
+Explanation: [1,2,3] is the original sorted array.
+You can rotate the array by x = 0 positions (i.e. no rotation) to make nums.
+```
+
+**Example 4:**
+
+```
+Input: nums = [1,1,1]
+Output: true
+Explanation: [1,1,1] is the original sorted array.
+You can rotate any number of positions to make nums.
+```
+
+**Example 5:**
+
+```
+Input: nums = [2,1]
+Output: true
+Explanation: [1,2] is the original sorted array.
+You can rotate the array by x = 5 positions to begin on the element of value 2: [2,1].
+```
+
+**Constraints:**
+
+- `1 <= nums.length <= 100`
+- `1 <= nums[i] <= 100`
+
+## 题目大意
+
+给你一个数组 nums 。nums 的源数组中，所有元素与 nums 相同，但按非递减顺序排列。如果 nums 能够由源数组轮转若干位置（包括 0 个位置）得到，则返回 true ；否则，返回 false 。源数组中可能存在 重复项 。
+
+## 解题思路
+
+- 简单题。从头扫描一遍数组，找出相邻两个元素递减的数对。如果递减的数对只有 1 个，则有可能是轮转得来的，超过 1 个，则返回 false。题干里面还提到可能有多个重复元素，针对这一情况还需要判断一下 `nums[0]` 和 `nums[len(nums)-1]` 。如果是相同元素，`nums[0] < nums[len(nums)-1]`，并且数组中间还存在一对递减的数对，这时候也是 false。判断好上述这 2 种情况，本题得解。
+
+## 代码
+
+```go
+package leetcode
+
+func check(nums []int) bool {
+ count := 0
+ for i := 0; i < len(nums)-1; i++ {
+ if nums[i] > nums[i+1] {
+ count++
+ if count > 1 || nums[0] < nums[len(nums)-1] {
+ return false
+ }
+ }
+ }
+ return true
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1700~1799/1748.Sum-of-Unique-Elements/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1700~1799/1758.Minimum-Changes-To-Make-Alternating-Binary-String/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/1700~1799/1758.Minimum-Changes-To-Make-Alternating-Binary-String.md b/website/content/ChapterFour/1700~1799/1758.Minimum-Changes-To-Make-Alternating-Binary-String.md
new file mode 100644
index 000000000..7e06a4478
--- /dev/null
+++ b/website/content/ChapterFour/1700~1799/1758.Minimum-Changes-To-Make-Alternating-Binary-String.md
@@ -0,0 +1,77 @@
+# [1758. Minimum Changes To Make Alternating Binary String](https://leetcode.com/problems/minimum-changes-to-make-alternating-binary-string/)
+
+
+## 题目
+
+You are given a string `s` consisting only of the characters `'0'` and `'1'`. In one operation, you can change any `'0'` to `'1'` or vice versa.
+
+The string is called alternating if no two adjacent characters are equal. For example, the string `"010"` is alternating, while the string `"0100"` is not.
+
+Return *the **minimum** number of operations needed to make* `s` *alternating*.
+
+**Example 1:**
+
+```
+Input: s = "0100"
+Output: 1
+Explanation: If you change the last character to '1', s will be "0101", which is alternating.
+```
+
+**Example 2:**
+
+```
+Input: s = "10"
+Output: 0
+Explanation: s is already alternating.
+```
+
+**Example 3:**
+
+```
+Input: s = "1111"
+Output: 2
+Explanation: You need two operations to reach "0101" or "1010".
+```
+
+**Constraints:**
+
+- `1 <= s.length <= 104`
+- `s[i]` is either `'0'` or `'1'`.
+
+## 题目大意
+
+你将得到一个仅包含字符“ 0”和“ 1”的字符串 `s`。 在一项操作中，你可以将任何 `'0'` 更改为 `'1'`，反之亦然。 如果两个相邻字符都不相等，则该字符串称为交替字符串。 例如，字符串“ 010”是交替的，而字符串“ 0100”则不是。 返回使 `s` 交替所需的最小操作数。
+
+## 解题思路
+
+- 简单题。利用数组下标奇偶交替性来判断交替字符串。交替字符串有 2 种，一个是 `'01010101……'` 还有一个是 `'1010101010……'`，这两个只需要计算出一个即可，另外一个利用 `len(s) - res` 就是答案。
+
+## 代码
+
+```go
+package leetcode
+
+func minOperations(s string) int {
+ res := 0
+ for i := 0; i < len(s); i++ {
+ if int(s[i]-'0') != i%2 {
+ res++
+ }
+ }
+ return min(res, len(s)-res)
+}
+
+func min(a, b int) int {
+ if a > b {
+ return b
+ }
+ return a
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1700~1799/1752.Check-if-Array-Is-Sorted-and-Rotated/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1700~1799/1763.Longest-Nice-Substring/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/1700~1799/1763.Longest-Nice-Substring.md b/website/content/ChapterFour/1700~1799/1763.Longest-Nice-Substring.md
new file mode 100644
index 000000000..4b574b199
--- /dev/null
+++ b/website/content/ChapterFour/1700~1799/1763.Longest-Nice-Substring.md
@@ -0,0 +1,147 @@
+# [1763. Longest Nice Substring](https://leetcode.com/problems/longest-nice-substring/)
+
+
+## 题目
+
+A string `s` is **nice** if, for every letter of the alphabet that `s` contains, it appears **both** in uppercase and lowercase. For example, `"abABB"` is nice because `'A'` and `'a'` appear, and `'B'` and `'b'` appear. However, `"abA"` is not because `'b'` appears, but `'B'` does not.
+
+Given a string `s`, return *the longest **substring** of `s` that is **nice**. If there are multiple, return the substring of the **earliest** occurrence. If there are none, return an empty string*.
+
+**Example 1:**
+
+```
+Input: s = "YazaAay"
+Output: "aAa"
+Explanation:"aAa" is a nice string because 'A/a' is the only letter of the alphabet in s, and both 'A' and 'a' appear.
+"aAa" is the longest nice substring.
+
+```
+
+**Example 2:**
+
+```
+Input: s = "Bb"
+Output: "Bb"
+Explanation: "Bb" is a nice string because both 'B' and 'b' appear. The whole string is a substring.
+
+```
+
+**Example 3:**
+
+```
+Input: s = "c"
+Output: ""
+Explanation: There are no nice substrings.
+
+```
+
+**Constraints:**
+
+- `1 <= s.length <= 100`
+- `s` consists of uppercase and lowercase English letters.
+
+## 题目大意
+
+当一个字符串 s 包含的每一种字母的大写和小写形式 同时 出现在 s 中，就称这个字符串 s 是 美好 字符串。比方说，"abABB" 是美好字符串，因为 'A' 和 'a' 同时出现了，且 'B' 和 'b' 也同时出现了。然而，"abA" 不是美好字符串因为 'b' 出现了，而 'B' 没有出现。
+
+给你一个字符串 s ，请你返回 s 最长的 美好子字符串 。如果有多个答案，请你返回 最早 出现的一个。如果不存在美好子字符串，请你返回一个空字符串。
+
+## 解题思路
+
+- 解法一，暴力解法。枚举每一段字符串，判断这个子字符串内是否满足美好字符串的定义，即字母的大小写是否同时出现。
+- 解法二，这个解法是解法一的小幅优化版，利用二进制记录状态。先构造二进制状态串，再利用直接比较这个二进制串。
+- 解法三，分治。以 `i` 为分割点依次切开字符串。左右两个字符串分别判断是否满足美好字符串的定义。左右分开的字符串还可以继续划分。直至分到一个字母为止。在这个过程中记录最早出现的字符串。
+
+## 代码
+
+```go
+package leetcode
+
+import "unicode"
+
+// 解法一 分治，时间复杂度 O(n)
+func longestNiceSubstring(s string) string {
+ if len(s) < 2 {
+ return ""
+ }
+
+ chars := map[rune]int{}
+ for _, r := range s {
+ chars[r]++
+ }
+
+ for i := 0; i < len(s); i++ {
+ r := rune(s[i])
+ _, u := chars[unicode.ToUpper(r)]
+ _, l := chars[unicode.ToLower(r)]
+ if u && l {
+ continue
+ }
+ left := longestNiceSubstring(s[:i])
+ right := longestNiceSubstring(s[i+1:])
+ if len(left) >= len(right) {
+ return left
+ } else {
+ return right
+ }
+ }
+ return s
+}
+
+// 解法二 用二进制表示状态
+func longestNiceSubstring1(s string) (ans string) {
+ for i := range s {
+ lower, upper := 0, 0
+ for j := i; j < len(s); j++ {
+ if unicode.IsLower(rune(s[j])) {
+ lower |= 1 << (s[j] - 'a')
+ } else {
+ upper |= 1 << (s[j] - 'A')
+ }
+ if lower == upper && j-i+1 > len(ans) {
+ ans = s[i : j+1]
+ }
+ }
+ }
+ return
+}
+
+// 解法三 暴力枚举，时间复杂度 O(n^2)
+func longestNiceSubstring2(s string) string {
+ res := ""
+ for i := 0; i < len(s); i++ {
+ m := map[byte]int{}
+ m[s[i]]++
+ for j := i + 1; j < len(s); j++ {
+ m[s[j]]++
+ if checkNiceString(m) && (j-i+1 > len(res)) {
+ res = s[i : j+1]
+ }
+ }
+ }
+ return res
+}
+
+func checkNiceString(m map[byte]int) bool {
+ for k := range m {
+ if k >= 97 && k <= 122 {
+ if _, ok := m[k-32]; !ok {
+ return false
+ }
+ }
+ if k >= 65 && k <= 90 {
+ if _, ok := m[k+32]; !ok {
+ return false
+ }
+ }
+ }
+ return true
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1700~1799/1758.Minimum-Changes-To-Make-Alternating-Binary-String/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1700~1799/1791.Find-Center-of-Star-Graph/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/1700~1799/1791.Find-Center-of-Star-Graph.md b/website/content/ChapterFour/1700~1799/1791.Find-Center-of-Star-Graph.md
new file mode 100644
index 000000000..6e91c8abc
--- /dev/null
+++ b/website/content/ChapterFour/1700~1799/1791.Find-Center-of-Star-Graph.md
@@ -0,0 +1,59 @@
+# [1791.Find Center of Star Graph](https://leetcode.com/problems/find-center-of-star-graph/)
+
+## 题目
+
+There is an undirected star graph consisting of n nodes labeled from 1 to n. A star graph is a graph where there is one center node and exactly n - 1 edges that connect the center node with every other node.
+
+You are given a 2D integer array edges where each edges[i] = [ui, vi] indicates that there is an edge between the nodes ui and vi. Return the center of the given star graph.
+
+**Example 1:**
+
+
+
+ Input: edges = [[1,2],[2,3],[4,2]]
+ Output: 2
+ Explanation: As shown in the figure above, node 2 is connected to every other node, so 2 is the center.
+
+**Example 2:**
+
+ Input: edges = [[1,2],[5,1],[1,3],[1,4]]
+ Output: 1
+
+**Constraints:**
+
+- 3 <= n <= 100000
+- edges.length == n - 1
+- edges[i].length == 2
+- 1 <= ui, vi <= n
+- ui != vi
+- The given edges represent a valid star graph.
+
+## 题目大意
+
+有一个无向的 星型 图，由 n 个编号从 1 到 n 的节点组成。星型图有一个 中心 节点，并且恰有 n - 1 条边将中心节点与其他每个节点连接起来。
+
+给你一个二维整数数组 edges ，其中 edges[i] = [ui, vi] 表示在节点 ui 和 vi 之间存在一条边。请你找出并返回 edges 所表示星型图的中心节点。
+
+## 解题思路
+
+- 求出edges中前两个元素的共同值，即是中心节点
+
+## 代码
+
+```go
+package leetcode
+
+func findCenter(edges [][]int) int {
+ if edges[0][0] == edges[1][0] || edges[0][0] == edges[1][1] {
+ return edges[0][0]
+ }
+ return edges[0][1]
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1700~1799/1763.Longest-Nice-Substring/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1800~1899/1816.Truncate-Sentence/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/1700~1799/_index.md b/website/content/ChapterFour/1700~1799/_index.md
new file mode 100644
index 000000000..e954f0877
--- /dev/null
+++ b/website/content/ChapterFour/1700~1799/_index.md
@@ -0,0 +1,4 @@
+---
+bookCollapseSection: true
+weight: 20
+---
diff --git a/website/content/ChapterFour/1800~1899/1816.Truncate-Sentence.md b/website/content/ChapterFour/1800~1899/1816.Truncate-Sentence.md
new file mode 100644
index 000000000..74b52d890
--- /dev/null
+++ b/website/content/ChapterFour/1800~1899/1816.Truncate-Sentence.md
@@ -0,0 +1,83 @@
+# [1816. Truncate Sentence](https://leetcode.com/problems/truncate-sentence/)
+
+## 题目
+
+A sentence is a list of words that are separated by a single space with no leading or trailing spaces. Each of the words consists of only uppercase and lowercase English letters (no punctuation).
+
+- For example, "Hello World", "HELLO", and "hello world hello world" are all sentences.
+
+You are given a sentence s and an integer k. You want to truncate s such that it contains only the first k words. Return s after truncating it.
+
+**Example 1**:
+
+ Input: s = "Hello how are you Contestant", k = 4
+ Output: "Hello how are you"
+ Explanation:
+ The words in s are ["Hello", "how" "are", "you", "Contestant"].
+ The first 4 words are ["Hello", "how", "are", "you"].
+ Hence, you should return "Hello how are you".
+
+**Example 2**:
+
+ Input: s = "What is the solution to this problem", k = 4
+ Output: "What is the solution"
+ Explanation:
+ The words in s are ["What", "is" "the", "solution", "to", "this", "problem"].
+ The first 4 words are ["What", "is", "the", "solution"].
+ Hence, you should return "What is the solution".
+
+**Example 3**:
+
+ Input: s = "chopper is not a tanuki", k = 5
+ Output: "chopper is not a tanuki"
+
+**Constraints:**
+
+- 1 <= s.length <= 500
+- k is in the range [1, the number of words in s].
+- s consist of only lowercase and uppercase English letters and spaces.
+- The words in s are separated by a single space.
+- There are no leading or trailing spaces.
+
+## 题目大意
+
+句子 是一个单词列表，列表中的单词之间用单个空格隔开，且不存在前导或尾随空格。每个单词仅由大小写英文字母组成（不含标点符号）。
+
+- 例如，"Hello World"、"HELLO" 和 "hello world hello world" 都是句子。
+
+给你一个句子 s 和一个整数 k ，请你将 s 截断使截断后的句子仅含前 k 个单词。返回截断 s 后得到的句子。
+
+## 解题思路
+
+- 遍历字符串 s，找到最后一个空格的下标 end
+- 如果 end 为 0，直接返回 s,否则返回 s[:end]
+
+## 代码
+
+```go
+package leetcode
+
+func truncateSentence(s string, k int) string {
+ end := 0
+ for i := range s {
+ if k > 0 && s[i] == ' ' {
+ k--
+ }
+ if k == 0 {
+ end = i
+ break
+ }
+ }
+ if end == 0 {
+ return s
+ }
+ return s[:end]
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1700~1799/1791.Find-Center-of-Star-Graph/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1800~1899/1818.Minimum-Absolute-Sum-Difference/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/1800~1899/1818.Minimum-Absolute-Sum-Difference.md b/website/content/ChapterFour/1800~1899/1818.Minimum-Absolute-Sum-Difference.md
new file mode 100644
index 000000000..204e09c1a
--- /dev/null
+++ b/website/content/ChapterFour/1800~1899/1818.Minimum-Absolute-Sum-Difference.md
@@ -0,0 +1,115 @@
+# [1818. Minimum Absolute Sum Difference](https://leetcode.com/problems/minimum-absolute-sum-difference/)
+
+## 题目
+
+You are given two positive integer arrays `nums1` and `nums2`, both of length `n`.
+
+The **absolute sum difference** of arrays `nums1` and `nums2` is defined as the **sum** of `|nums1[i] - nums2[i]|` for each `0 <= i < n` (**0-indexed**).
+
+You can replace **at most one** element of `nums1` with **any** other element in `nums1` to **minimize** the absolute sum difference.
+
+Return the *minimum absolute sum difference **after** replacing at most one ****element in the array `nums1`.* Since the answer may be large, return it **modulo** `109 + 7`.
+
+`|x|` is defined as:
+
+- `x` if `x >= 0`, or
+- `x` if `x < 0`.
+
+**Example 1:**
+
+```
+Input: nums1 = [1,7,5], nums2 = [2,3,5]
+Output: 3
+Explanation:There are two possible optimal solutions:
+- Replace the second element with the first: [1,7,5] => [1,1,5], or
+- Replace the second element with the third: [1,7,5] => [1,5,5].
+Both will yield an absolute sum difference of|1-2| + (|1-3| or |5-3|) + |5-5| =3.
+
+```
+
+**Example 2:**
+
+```
+Input: nums1 = [2,4,6,8,10], nums2 = [2,4,6,8,10]
+Output: 0
+Explanation:nums1 is equal to nums2 so no replacement is needed. This will result in an
+absolute sum difference of 0.
+
+```
+
+**Example 3:**
+
+```
+Input: nums1 = [1,10,4,4,2,7], nums2 = [9,3,5,1,7,4]
+Output: 20
+Explanation:Replace the first element with the second: [1,10,4,4,2,7] => [10,10,4,4,2,7].
+This yields an absolute sum difference of|10-9| + |10-3| + |4-5| + |4-1| + |2-7| + |7-4| = 20
+```
+
+**Constraints:**
+
+- `n == nums1.length`
+- `n == nums2.length`
+- `1 <= n <= 10^5`
+- `1 <= nums1[i], nums2[i] <= 10^5`
+
+## 题目大意
+
+给你两个正整数数组 nums1 和 nums2 ，数组的长度都是 n 。数组 nums1 和 nums2 的 绝对差值和 定义为所有 |nums1[i] - nums2[i]|（0 <= i < n）的 总和（下标从 0 开始）。你可以选用 nums1 中的 任意一个 元素来替换 nums1 中的 至多 一个元素，以 最小化 绝对差值和。在替换数组 nums1 中最多一个元素 之后 ，返回最小绝对差值和。因为答案可能很大，所以需要对 10^9 + 7 取余 后返回。
+
+## 解题思路
+
+- 如果不改变任何元素，绝对差值和为 {{< katex >}} \sum \left | nums1[i] - nums2[i] \right | {{< /katex >}}。如果改变一个元素后，那么绝对差值和为
+ {{< katex display>}} \begin{aligned}&\sum \left | nums1[i] - nums2[i] \right | - \left ( \left | nums1[i] - nums2[i] \right | - \left | nums1[j] - nums2[i] \right |\right )\\= &\sum \left | nums1[i] - nums2[i] \right | - \Delta \end{aligned} {{< /katex >}}
+
+ 题目要求返回最小绝对差值和，即求 {{< katex >}}\Delta {{< /katex >}} 的最大值。暴力枚举 nums1 和 nums2 中两两差值，找到 maxdiff，即 {{< katex >}}\Delta {{< /katex >}} 的最大值，此题得到解。
+
+## 代码
+
+```go
+package leetcode
+
+func minAbsoluteSumDiff(nums1 []int, nums2 []int) int {
+ diff := 0
+ maxDiff := 0
+ for i, n2 := range nums2 {
+ d := abs(nums1[i] - n2)
+ diff += d
+ if maxDiff < d {
+ t := 100001
+ for _, n1 := range nums1 {
+ maxDiff = max(maxDiff, d-min(t, abs(n1-n2)))
+ }
+ }
+ }
+ return (diff - maxDiff) % (1e9 + 7)
+}
+
+func max(a, b int) int {
+ if a > b {
+ return a
+ }
+ return b
+}
+
+func abs(a int) int {
+ if a > 0 {
+ return a
+ }
+ return -a
+}
+
+func min(a, b int) int {
+ if a > b {
+ return b
+ }
+ return a
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1800~1899/1816.Truncate-Sentence/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1800~1899/1846.Maximum-Element-After-Decreasing-and-Rearranging/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/1800~1899/1846.Maximum-Element-After-Decreasing-and-Rearranging.md b/website/content/ChapterFour/1800~1899/1846.Maximum-Element-After-Decreasing-and-Rearranging.md
new file mode 100644
index 000000000..8b68e57ac
--- /dev/null
+++ b/website/content/ChapterFour/1800~1899/1846.Maximum-Element-After-Decreasing-and-Rearranging.md
@@ -0,0 +1,110 @@
+# [1846. Maximum Element After Decreasing and Rearranging](https://leetcode.com/problems/maximum-element-after-decreasing-and-rearranging/)
+
+
+## 题目
+
+You are given an array of positive integers `arr`. Perform some operations (possibly none) on `arr` so that it satisfies these conditions:
+
+- The value of the **first** element in `arr` must be `1`.
+- The absolute difference between any 2 adjacent elements must be **less than or equal to** `1`. In other words, `abs(arr[i] - arr[i - 1]) <= 1` for each `i` where `1 <= i < arr.length` (**0-indexed**). `abs(x)` is the absolute value of `x`.
+
+There are 2 types of operations that you can perform any number of times:
+
+- **Decrease** the value of any element of `arr` to a **smaller positive integer**.
+- **Rearrange** the elements of `arr` to be in any order.
+
+Return *the **maximum** possible value of an element in* `arr` *after performing the operations to satisfy the conditions*.
+
+**Example 1:**
+
+```
+Input: arr = [2,2,1,2,1]
+Output: 2
+Explanation:
+We can satisfy the conditions by rearrangingarr so it becomes[1,2,2,2,1].
+The largest element inarr is 2.
+
+```
+
+**Example 2:**
+
+```
+Input: arr = [100,1,1000]
+Output: 3
+Explanation:
+One possible way to satisfy the conditions is by doing the following:
+1. Rearrangearr so it becomes[1,100,1000].
+2. Decrease the value of the second element to 2.
+3. Decrease the value of the third element to 3.
+Nowarr = [1,2,3], whichsatisfies the conditions.
+The largest element inarr is 3.
+```
+
+**Example 3:**
+
+```
+Input: arr = [1,2,3,4,5]
+Output: 5
+Explanation: The array already satisfies the conditions, and the largest element is 5.
+
+```
+
+**Constraints:**
+
+- `1 <= arr.length <= 10^5`
+- `1 <= arr[i] <= 10^9`
+
+## 题目大意
+
+给你一个正整数数组 arr 。请你对 arr 执行一些操作（也可以不进行任何操作），使得数组满足以下条件：
+
+- arr 中 第一个 元素必须为 1 。
+- 任意相邻两个元素的差的绝对值 小于等于 1 ，也就是说，对于任意的 1 <= i < arr.length （数组下标从 0 开始），都满足 abs(arr[i] - arr[i - 1]) <= 1 。abs(x) 为 x 的绝对值。
+
+你可以执行以下 2 种操作任意次：
+
+- 减小 arr 中任意元素的值，使其变为一个 更小的正整数 。
+- 重新排列 arr 中的元素，你可以以任意顺序重新排列。
+
+请你返回执行以上操作后，在满足前文所述的条件下，arr 中可能的 最大值 。
+
+## 解题思路
+
+- 正整数数组 arr 第一个元素必须为 1，且两两元素绝对值小于等于 1，那么 arr 最大值肯定不大于 n。采用贪心的策略，先统计所有元素出现的次数，大于 n 的元素出现次数都累加到 n 上。然后从 1 扫描到 n，遇到“空隙”（出现次数为 0 的元素），便将最近一个出现次数大于 1 的元素“挪”过来填补“空隙”。题目所求最大值出现在，“填补空隙”之后，数组从左往右连续的最右端。
+
+## 代码
+
+```go
+package leetcode
+
+func maximumElementAfterDecrementingAndRearranging(arr []int) int {
+ n := len(arr)
+ count := make([]int, n+1)
+ for _, v := range arr {
+ count[min(v, n)]++
+ }
+ miss := 0
+ for _, c := range count[1:] {
+ if c == 0 {
+ miss++
+ } else {
+ miss -= min(c-1, miss)
+ }
+ }
+ return n - miss
+}
+
+func min(a, b int) int {
+ if a < b {
+ return a
+ }
+ return b
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1800~1899/1818.Minimum-Absolute-Sum-Difference/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1800~1899/1877.Minimize-Maximum-Pair-Sum-in-Array/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/1800~1899/1877.Minimize-Maximum-Pair-Sum-in-Array.md b/website/content/ChapterFour/1800~1899/1877.Minimize-Maximum-Pair-Sum-in-Array.md
new file mode 100644
index 000000000..26bc64c66
--- /dev/null
+++ b/website/content/ChapterFour/1800~1899/1877.Minimize-Maximum-Pair-Sum-in-Array.md
@@ -0,0 +1,87 @@
+# [1877. Minimize Maximum Pair Sum in Array](https://leetcode.com/problems/minimize-maximum-pair-sum-in-array/)
+
+
+## 题目
+
+The **pair sum** of a pair `(a,b)` is equal to `a + b`. The **maximum pair sum** is the largest **pair sum** in a list of pairs.
+
+- For example, if we have pairs `(1,5)`, `(2,3)`, and `(4,4)`, the **maximum pair sum** would be `max(1+5, 2+3, 4+4) = max(6, 5, 8) = 8`.
+
+Given an array `nums` of **even** length `n`, pair up the elements of `nums` into `n / 2` pairs such that:
+
+- Each element of `nums` is in **exactly one** pair, and
+- The **maximum pair sum** is **minimized**.
+
+Return *the minimized **maximum pair sum** after optimally pairing up the elements*.
+
+**Example 1:**
+
+```
+Input: nums = [3,5,2,3]
+Output: 7
+Explanation: The elements can be paired up into pairs (3,3) and (5,2).
+The maximum pair sum is max(3+3, 5+2) = max(6, 7) = 7.
+```
+
+**Example 2:**
+
+```
+Input: nums = [3,5,4,2,4,6]
+Output: 8
+Explanation: The elements can be paired up into pairs (3,5), (4,4), and (6,2).
+The maximum pair sum is max(3+5, 4+4, 6+2) = max(8, 8, 8) = 8.
+```
+
+**Constraints:**
+
+- `n == nums.length`
+- `2 <= n <= 105`
+- `n` is **even**.
+- `1 <= nums[i] <= 105`
+
+## 题目大意
+
+一个数对 (a,b) 的 **数对和** 等于 a + b 。**最大数对和** 是一个数对数组中最大的 数对和 。
+
+- 比方说，如果我们有数对 (1,5) ，(2,3) 和 (4,4)，**最大数对和** 为 max(1+5, 2+3, 4+4) = max(6, 5, 8) = 8 。
+
+给你一个长度为 **偶数** n 的数组 nums ，请你将 nums 中的元素分成 n / 2 个数对，使得：
+
+- nums 中每个元素 **恰好** 在 一个 数对中，且
+- **最大数对和** 的值 **最小** 。
+
+请你在最优数对划分的方案下，返回最小的 最大数对和 。
+
+## 解题思路
+
+- 要想最大数对和最小，那么最大的元素一定只能和最小的元素组合在一起，不然一定不是最小。当最大元素和最小元素组合在一起了，剩下的次最大元素也应该和次最小元素组合在一起。按照这个思路，先将数组从小到大排序，然后依次取出首尾元素，两两组合在一起。输出这些数对的最大值即为所求。
+
+## 代码
+
+```go
+package leetcode
+
+import "sort"
+
+func minPairSum(nums []int) int {
+ sort.Ints(nums)
+ n, res := len(nums), 0
+ for i, val := range nums[:n/2] {
+ res = max(res, val+nums[n-1-i])
+ }
+ return res
+}
+
+func max(a, b int) int {
+ if a > b {
+ return a
+ }
+ return b
+}
+```
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1800~1899/1846.Maximum-Element-After-Decreasing-and-Rearranging/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1900~1999/1984.Minimum-Difference-Between-Highest-and-Lowest-of-K-Scores/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/1800~1899/_index.md b/website/content/ChapterFour/1800~1899/_index.md
new file mode 100644
index 000000000..e954f0877
--- /dev/null
+++ b/website/content/ChapterFour/1800~1899/_index.md
@@ -0,0 +1,4 @@
+---
+bookCollapseSection: true
+weight: 20
+---
diff --git a/website/content/ChapterFour/1900~1999/1984.Minimum-Difference-Between-Highest-and-Lowest-of-K-Scores.md b/website/content/ChapterFour/1900~1999/1984.Minimum-Difference-Between-Highest-and-Lowest-of-K-Scores.md
new file mode 100644
index 000000000..31ce16d63
--- /dev/null
+++ b/website/content/ChapterFour/1900~1999/1984.Minimum-Difference-Between-Highest-and-Lowest-of-K-Scores.md
@@ -0,0 +1,78 @@
+# [1984. Minimum Difference Between Highest and Lowest of K Scores](https://leetcode.com/problems/minimum-difference-between-highest-and-lowest-of-k-scores/)
+
+## 题目
+
+You are given a 0-indexed integer array nums, where nums[i] represents the score of the ith student. You are also given an integer k.
+
+Pick the scores of any k students from the array so that the difference between the highest and the lowest of the k scores is minimized.
+
+Return the minimum possible difference.
+
+**Example 1:**
+
+ Input: nums = [90], k = 1
+ Output: 0
+ Explanation: There is one way to pick score(s) of one student:
+ - [90]. The difference between the highest and lowest score is 90 - 90 = 0.
+ The minimum possible difference is 0.
+
+**Example 2:**
+
+ Input: nums = [9,4,1,7], k = 2
+ Output: 2
+ Explanation: There are six ways to pick score(s) of two students:
+ - [9,4,1,7]. The difference between the highest and lowest score is 9 - 4 = 5.
+ - [9,4,1,7]. The difference between the highest and lowest score is 9 - 1 = 8.
+ - [9,4,1,7]. The difference between the highest and lowest score is 9 - 7 = 2.
+ - [9,4,1,7]. The difference between the highest and lowest score is 4 - 1 = 3.
+ - [9,4,1,7]. The difference between the highest and lowest score is 7 - 4 = 3.
+ - [9,4,1,7]. The difference between the highest and lowest score is 7 - 1 = 6.
+ The minimum possible difference is 2.
+
+**Constraints:**
+
+- 1 <= k <= nums.length <= 1000
+- 0 <= nums[i] <= 100000
+
+## 题目大意
+
+给你一个下标从 0 开始的整数数组 nums ，其中 nums[i] 表示第 i 名学生的分数。另给你一个整数 k 。
+
+从数组中选出任意 k 名学生的分数，使这 k 个分数间最高分和最低分的差值达到最小化 。
+
+返回可能的最小差值 。
+
+## 解题思路
+
+- nums 排序
+- 求出nums[i+k-1] - nums[i]中的最小差值
+
+## 代码
+
+```go
+package leetcode
+
+import "sort"
+
+func minimumDifference(nums []int, k int) int {
+ sort.Ints(nums)
+ minDiff := 100000 + 1
+ for i := 0; i < len(nums); i++ {
+ if i+k-1 >= len(nums) {
+ break
+ }
+ diff := nums[i+k-1] - nums[i]
+ if diff < minDiff {
+ minDiff = diff
+ }
+ }
+ return minDiff
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1800~1899/1877.Minimize-Maximum-Pair-Sum-in-Array/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/2000~2099/2021.Brightest-Position-on-Street/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/1900~1999/_index.md b/website/content/ChapterFour/1900~1999/_index.md
new file mode 100644
index 000000000..e954f0877
--- /dev/null
+++ b/website/content/ChapterFour/1900~1999/_index.md
@@ -0,0 +1,4 @@
+---
+bookCollapseSection: true
+weight: 20
+---
diff --git a/website/content/ChapterFour/2000~2099/2021.Brightest-Position-on-Street.md b/website/content/ChapterFour/2000~2099/2021.Brightest-Position-on-Street.md
new file mode 100644
index 000000000..d223af086
--- /dev/null
+++ b/website/content/ChapterFour/2000~2099/2021.Brightest-Position-on-Street.md
@@ -0,0 +1,116 @@
+# [2021. Brightest Position on Street](https://leetcode.com/problems/brightest-position-on-street/)
+
+
+## 题目
+
+A perfectly straight street is represented by a number line. The street has street lamp(s) on it and is represented by a 2D integer array `lights`. Each `lights[i] = [positioni, rangei]` indicates that there is a street lamp at position `positioni` that lights up the area from `[positioni - rangei, positioni + rangei]` (**inclusive**).
+
+The **brightness** of a position `p` is defined as the number of street lamp that light up the position `p`.
+
+Given `lights`, return *the **brightest** position on the street. If there are multiple brightest positions, return the **smallest** one.*
+
+**Example 1:**
+
+
+
+```
+Input: lights = [[-3,2],[1,2],[3,3]]
+Output: -1
+Explanation:
+The first street lamp lights up the area from [(-3) - 2, (-3) + 2] = [-5, -1].
+The second street lamp lights up the area from [1 - 2, 1 + 2] = [-1, 3].
+The third street lamp lights up the area from [3 - 3, 3 + 3] = [0, 6].
+
+Position -1 has a brightness of 2, illuminated by the first and second street light.
+Positions 0, 1, 2, and 3 have a brightness of 2, illuminated by the second and third street light.
+Out of all these positions, -1 is the smallest, so return it.
+
+```
+
+**Example 2:**
+
+```
+Input: lights = [[1,0],[0,1]]
+Output: 1
+Explanation:
+The first street lamp lights up the area from [1 - 0, 1 + 0] = [1, 1].
+The second street lamp lights up the area from [0 - 1, 0 + 1] = [-1, 1].
+
+Position 1 has a brightness of 2, illuminated by the first and second street light.
+Return 1 because it is the brightest position on the street.
+
+```
+
+**Example 3:**
+
+```
+Input: lights = [[1,2]]
+Output: -1
+Explanation:
+The first street lamp lights up the area from [1 - 2, 1 + 2] = [-1, 3].
+
+Positions -1, 0, 1, 2, and 3 have a brightness of 1, illuminated by the first street light.
+Out of all these positions, -1 is the smallest, so return it.
+
+```
+
+**Constraints:**
+
+- `1 <= lights.length <= 105`
+- `lights[i].length == 2`
+- `108 <= positioni <= 108`
+- `0 <= rangei <= 108`
+
+## 题目大意
+
+一条完全笔直的街道由一条数字线表示。街道上有路灯，由二维数据表示。每个 `lights[i] = [positioni, rangei]` 表示位置 `i` 处有一盏路灯，灯可以照亮从 `[positioni - rangei, positioni + rangei]` （含）的区域。 位置 `p` 的亮度定义为点亮位置 `p` 的路灯数量。 给定路灯，返回街道上最亮的位置。如果有多个最亮的位置，则返回最小的一个。
+
+## 解题思路
+
+- 先将每个路灯的起始和终点位置计算出来。这样我们得到了一堆坐标点。假设灯照亮的范围是 [A, B]，那么在坐标轴上 A 坐标点处 + 1， B + 1 坐标点处 -1 。这样处理的含义是：坐标点 A 可以被一盏灯照亮，所以它照亮次数加一，坐标点 B + 1 出了灯照亮的范围了，所以照亮次数减一。那么从坐标轴坐标开始扫一遍，每次遇到 + 1 的时候就 + 1，遇到 - 1 的地方就 - 1。如此可以算出某个坐标点处，可以被灯照亮的总次数。
+- 需要注意的点是，题目给的测试数据可能会有单点照亮的情况，即某一盏灯只照亮一个坐标点，灯照范围为 0。同一个坐标点也可能是多个灯的起点。用一个 map 去重坐标点即可。
+
+## 代码
+
+```go
+package leetcode
+
+import (
+ "sort"
+)
+
+type lightItem struct {
+ index int
+ sign int
+}
+
+func brightestPosition(lights [][]int) int {
+ lightMap, lightItems := map[int]int{}, []lightItem{}
+ for _, light := range lights {
+ lightMap[light[0]-light[1]] += 1
+ lightMap[light[0]+light[1]+1] -= 1
+ }
+ for k, v := range lightMap {
+ lightItems = append(lightItems, lightItem{index: k, sign: v})
+ }
+ sort.SliceStable(lightItems, func(i, j int) bool {
+ return lightItems[i].index < lightItems[j].index
+ })
+ res, border, tmp := 0, 0, 0
+ for _, v := range lightItems {
+ tmp += v.sign
+ if border < tmp {
+ res = v.index
+ border = tmp
+ }
+ }
+ return res
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1900~1999/1984.Minimum-Difference-Between-Highest-and-Lowest-of-K-Scores/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/2000~2099/2022.Convert-1D-Array-Into-2D-Array/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/2000~2099/2022.Convert-1D-Array-Into-2D-Array.md b/website/content/ChapterFour/2000~2099/2022.Convert-1D-Array-Into-2D-Array.md
new file mode 100644
index 000000000..29646b4a0
--- /dev/null
+++ b/website/content/ChapterFour/2000~2099/2022.Convert-1D-Array-Into-2D-Array.md
@@ -0,0 +1,84 @@
+# [2022. Convert 1D Array Into 2D Array](https://leetcode.com/problems/convert-1d-array-into-2d-array/)
+
+## 题目
+
+You are given a **0-indexed** 1-dimensional (1D) integer array `original`, and two integers, `m` and `n`. You are tasked with creating a 2-dimensional (2D) array with `m` rows and `n` columns using **all** the elements from `original`.
+
+The elements from indices `0` to `n - 1` (**inclusive**) of `original` should form the first row of the constructed 2D array, the elements from indices `n` to `2 * n - 1` (**inclusive**) should form the second row of the constructed 2D array, and so on.
+
+Return *an* `m x n` *2D array constructed according to the above procedure, or an empty 2D array if it is impossible*.
+
+**Example 1:**
+
+
+
+```
+Input: original = [1,2,3,4], m = 2, n = 2
+Output: [[1,2],[3,4]]
+Explanation: The constructed 2D array should contain 2 rows and 2 columns.
+The first group of n=2 elements in original, [1,2], becomes the first row in the constructed 2D array.
+The second group of n=2 elements in original, [3,4], becomes the second row in the constructed 2D array.
+
+```
+
+**Example 2:**
+
+```
+Input: original = [1,2,3], m = 1, n = 3
+Output: [[1,2,3]]
+Explanation: The constructed 2D array should contain 1 row and 3 columns.
+Put all three elements in original into the first row of the constructed 2D array.
+
+```
+
+**Example 3:**
+
+```
+Input: original = [1,2], m = 1, n = 1
+Output: []
+Explanation: There are 2 elements in original.
+It is impossible to fit 2 elements in a 1x1 2D array, so return an empty 2D array.
+
+```
+
+**Constraints:**
+
+- `1 <= original.length <= 5 * 104`
+- `1 <= original[i] <= 105`
+- `1 <= m, n <= 4 * 104`
+
+## 题目大意
+
+给你一个下标从 0 开始的一维整数数组 original 和两个整数 m 和 n 。你需要使用 original 中 所有 元素创建一个 m 行 n 列的二维数组。
+
+original 中下标从 0 到 n - 1 （都 包含 ）的元素构成二维数组的第一行，下标从 n 到 2 * n - 1 （都 包含 ）的元素构成二维数组的第二行，依此类推。
+
+请你根据上述过程返回一个 m x n 的二维数组。如果无法构成这样的二维数组，请你返回一个空的二维数组。
+
+## 解题思路
+
+- 简单题。从一维数组 original 中依次取出每行 n 个元素，顺序放到 m 行中。此题中，如果 m*n 大于或者小于 original 的长度，都输出空数组。
+
+## 代码
+
+```go
+package leetcode
+
+func construct2DArray(original []int, m int, n int) [][]int {
+ if m*n != len(original) {
+ return [][]int{}
+ }
+ res := make([][]int, m)
+ for i := 0; i < m; i++ {
+ res[i] = original[n*i : n*(i+1)]
+ }
+ return res
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/2000~2099/2021.Brightest-Position-on-Street/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/2000~2099/2037.Minimum-Number-of-Moves-to-Seat-Everyone/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/2000~2099/2037.Minimum-Number-of-Moves-to-Seat-Everyone.md b/website/content/ChapterFour/2000~2099/2037.Minimum-Number-of-Moves-to-Seat-Everyone.md
new file mode 100644
index 000000000..8f7878c44
--- /dev/null
+++ b/website/content/ChapterFour/2000~2099/2037.Minimum-Number-of-Moves-to-Seat-Everyone.md
@@ -0,0 +1,101 @@
+# [2037. Minimum Number of Moves to Seat Everyone](https://leetcode.com/problems/minimum-number-of-moves-to-seat-everyone/)
+
+## 题目
+
+There are n seats and n students in a room. You are given an array seats of length n, where seats[i] is the position of the ith seat. You are also given the array students of length n, where students[j] is the position of the jth student.
+
+You may perform the following move any number of times:
+
+- Increase or decrease the position of the ith student by 1 (i.e., moving the ith student from position x to x + 1 or x - 1)
+
+Return the minimum number of moves required to move each student to a seat such that no two students are in the same seat.
+
+Note that there may be multiple seats or students in the same position at the beginning.
+
+**Example 1:**
+
+ Input: seats = [3,1,5], students = [2,7,4]
+ Output: 4
+ Explanation: The students are moved as follows:
+ - The first student is moved from from position 2 to position 1 using 1 move.
+ - The second student is moved from from position 7 to position 5 using 2 moves.
+ - The third student is moved from from position 4 to position 3 using 1 move.
+ In total, 1 + 2 + 1 = 4 moves were used.
+
+**Example 2:**
+
+ Input: seats = [4,1,5,9], students = [1,3,2,6]
+ Output: 7
+ Explanation: The students are moved as follows:
+ - The first student is not moved.
+ - The second student is moved from from position 3 to position 4 using 1 move.
+ - The third student is moved from from position 2 to position 5 using 3 moves.
+ - The fourth student is moved from from position 6 to position 9 using 3 moves.
+ In total, 0 + 1 + 3 + 3 = 7 moves were used.
+
+**Example 3:**
+
+ Input: seats = [2,2,6,6], students = [1,3,2,6]
+ Output: 4
+ Explanation: Note that there are two seats at position 2 and two seats at position 6.
+ The students are moved as follows:
+ - The first student is moved from from position 1 to position 2 using 1 move.
+ - The second student is moved from from position 3 to position 6 using 3 moves.
+ - The third student is not moved.
+ - The fourth student is not moved.
+ In total, 1 + 3 + 0 + 0 = 4 moves were used.
+
+**Constraints:**
+
+- n == seats.length == students.length
+- 1 <= n <= 100
+- 1 <= seats[i], students[j] <= 100
+
+## 题目大意
+
+一个房间里有 n 个座位和 n 名学生，房间用一个数轴表示。给你一个长度为 n 的数组 seats，其中 seats[i] 是第 i 个座位的位置。同时给你一个长度为 n 的数组 students ，其中 students[j] 是第 j 位学生的位置。
+
+你可以执行以下操作任意次：
+
+增加或者减少第 i 位学生的位置，每次变化量为 1（也就是将第 i 位学生从位置 x 移动到 x + 1或者 x - 1）
+
+请你返回使所有学生都有座位坐的最少移动次数，并确保没有两位学生的座位相同。
+
+请注意，初始时有可能有多个座位或者多位学生在 同一位置。
+
+## 解题思路
+
+- 排序+模拟计算
+
+# 代码
+
+```go
+package leetcode
+
+import "sort"
+
+func minMovesToSeat(seats []int, students []int) int {
+ sort.Ints(seats)
+ sort.Ints(students)
+ n := len(students)
+ moves := 0
+ for i := 0; i < n; i++ {
+ moves += abs(seats[i], students[i])
+ }
+ return moves
+}
+
+func abs(a, b int) int {
+ if a > b {
+ return a - b
+ }
+ return b - a
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/2000~2099/2022.Convert-1D-Array-Into-2D-Array/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/2000~2099/2038.Remove-Colored-Pieces-if-Both-Neighbors-are-the-Same-Color/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/2000~2099/2038.Remove-Colored-Pieces-if-Both-Neighbors-are-the-Same-Color.md b/website/content/ChapterFour/2000~2099/2038.Remove-Colored-Pieces-if-Both-Neighbors-are-the-Same-Color.md
new file mode 100644
index 000000000..09091fcc8
--- /dev/null
+++ b/website/content/ChapterFour/2000~2099/2038.Remove-Colored-Pieces-if-Both-Neighbors-are-the-Same-Color.md
@@ -0,0 +1,112 @@
+# [2038. Remove Colored Pieces if Both Neighbors are the Same Color](https://leetcode.com/problems/remove-colored-pieces-if-both-neighbors-are-the-same-color/)
+
+## 题目
+
+There are n pieces arranged in a line, and each piece is colored either by 'A' or by 'B'. You are given a string colors of length n where colors[i] is the color of the ith piece.
+
+Alice and Bob are playing a game where they take alternating turns removing pieces from the line. In this game, Alice moves first.
+
+- Alice is only allowed to remove a piece colored 'A' if both its neighbors are also colored 'A'. She is not allowed to remove pieces that are colored 'B'.
+- Bob is only allowed to remove a piece colored 'B' if both its neighbors are also colored 'B'. He is not allowed to remove pieces that are colored 'A'.
+- Alice and Bob cannot remove pieces from the edge of the line.
+- If a player cannot make a move on their turn, that player loses and the other player wins.
+
+Assuming Alice and Bob play optimally, return true if Alice wins, or return false if Bob wins.
+
+**Example 1:**
+
+ Input: colors = "AAABABB"
+ Output: true
+ Explanation:
+ AAABABB -> AABABB
+ Alice moves first.
+ She removes the second 'A' from the left since that is the only 'A' whose neighbors are both 'A'.
+
+ Now it's Bob's turn.
+ Bob cannot make a move on his turn since there are no 'B's whose neighbors are both 'B'.
+ Thus, Alice wins, so return true.
+
+**Example 2:**
+
+ Input: colors = "AA"
+ Output: false
+ Explanation:
+ Alice has her turn first.
+ There are only two 'A's and both are on the edge of the line, so she cannot move on her turn.
+ Thus, Bob wins, so return false.
+
+**Example 3:**
+
+ Input: colors = "ABBBBBBBAAA"
+ Output: false
+ Explanation:
+ ABBBBBBBAAA -> ABBBBBBBAA
+ Alice moves first.
+ Her only option is to remove the second to last 'A' from the right.
+
+ ABBBBBBBAA -> ABBBBBBAA
+ Next is Bob's turn.
+ He has many options for which 'B' piece to remove. He can pick any.
+
+ On Alice's second turn, she has no more pieces that she can remove.
+ Thus, Bob wins, so return false.
+
+**Constraints:**
+
+- 1 <= colors.length <= 100000
+- colors consists of only the letters 'A' and 'B'
+
+## 题目大意
+
+总共有 n 个颜色片段排成一列，每个颜色片段要么是 'A' 要么是 'B' 。给你一个长度为 n 的字符串 colors ，其中 colors[i] 表示第 i 个颜色片段的颜色。
+
+Alice 和 Bob 在玩一个游戏，他们轮流从这个字符串中删除颜色。Alice 先手。
+
+- 如果一个颜色片段为 'A' 且相邻两个颜色都是颜色 'A'，那么 Alice 可以删除该颜色片段。Alice不可以删除任何颜色 'B' 片段。
+- 如果一个颜色片段为 'B'且相邻两个颜色都是颜色 'B' ，那么 Bob 可以删除该颜色片段。Bob 不可以删除任何颜色 'A' 片段。
+- Alice 和 Bob 不能从字符串两端删除颜色片段。
+- 如果其中一人无法继续操作，则该玩家 输掉游戏且另一玩家 获胜。
+
+假设 Alice 和 Bob 都采用最优策略，如果 Alice 获胜，请返回true，否则 Bob 获胜，返回false。
+
+## 解题思路
+
+- 统计 Alice 和 Bob 分别可以操作的次数记为 As，Bs
+- 因为 Alice 先手，所以只要 As 大于 Bs，Alice 获胜返回 true，否则 Bob 获胜返回 false
+
+# 代码
+
+```go
+package leetcode
+
+func winnerOfGame(colors string) bool {
+ As, Bs := 0, 0
+ Acont, Bcont := 0, 0
+ for _, color := range colors {
+ if color == 'A' {
+ Acont += 1
+ Bcont = 0
+ } else {
+ Bcont += 1
+ Acont = 0
+ }
+ if Acont >= 3 {
+ As += Acont - 2
+ }
+ if Bcont >= 3 {
+ Bs += Bcont - 2
+ }
+ }
+ if As > Bs {
+ return true
+ }
+ return false
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/2000~2099/2037.Minimum-Number-of-Moves-to-Seat-Everyone/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/2000~2099/2043.Simple-Bank-System/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/2000~2099/2043.Simple-Bank-System.md b/website/content/ChapterFour/2000~2099/2043.Simple-Bank-System.md
new file mode 100644
index 000000000..b756eb8e0
--- /dev/null
+++ b/website/content/ChapterFour/2000~2099/2043.Simple-Bank-System.md
@@ -0,0 +1,120 @@
+# [2043. Simple Bank System](https://leetcode.com/problems/simple-bank-system/)
+
+## 题目
+
+You have been tasked with writing a program for a popular bank that will automate all its incoming transactions (transfer, deposit, and withdraw). The bank has n accounts numbered from 1 to n. The initial balance of each account is stored in a 0-indexed integer array balance, with the (i + 1)th account having an initial balance of balance[i].
+
+Execute all the valid transactions. A transaction is valid if:
+
+- The given account number(s) are between 1 and n, and
+- The amount of money withdrawn or transferred from is less than or equal to the balance of the account.
+
+Implement the Bank class:
+
+- Bank(long[] balance) Initializes the object with the 0-indexed integer array balance.
+- boolean transfer(int account1, int account2, long money) Transfers money dollars from the account numbered account1 to the account numbered account2. Return true if the transaction was successful, false otherwise.
+- boolean deposit(int account, long money) Deposit money dollars into the account numbered account. Return true if the transaction was successful, false otherwise.
+- boolean withdraw(int account, long money) Withdraw money dollars from the account numbered account. Return true if the transaction was successful, false otherwise.
+
+**Example 1:**
+
+ Input
+ ["Bank", "withdraw", "transfer", "deposit", "transfer", "withdraw"]
+ [[[10, 100, 20, 50, 30]], [3, 10], [5, 1, 20], [5, 20], [3, 4, 15], [10, 50]]
+ Output
+ [null, true, true, true, false, false]
+
+ Explanation
+ Bank bank = new Bank([10, 100, 20, 50, 30]);
+ bank.withdraw(3, 10); // return true, account 3 has a balance of $20, so it is valid to withdraw $10.
+ // Account 3 has $20 - $10 = $10.
+ bank.transfer(5, 1, 20); // return true, account 5 has a balance of $30, so it is valid to transfer $20.
+ // Account 5 has $30 - $20 = $10, and account 1 has $10 + $20 = $30.
+ bank.deposit(5, 20); // return true, it is valid to deposit $20 to account 5.
+ // Account 5 has $10 + $20 = $30.
+ bank.transfer(3, 4, 15); // return false, the current balance of account 3 is $10,
+ // so it is invalid to transfer $15 from it.
+ bank.withdraw(10, 50); // return false, it is invalid because account 10 does not exist.
+
+**Constraints:**
+
+- n == balance.length
+- 1 <= n, account, account1, account2 <= 100000
+- 0 <= balance[i], money <= 1000000000000
+- At most 104 calls will be made to each function transfer, deposit, withdraw.
+
+## 题目大意
+
+你的任务是为一个很受欢迎的银行设计一款程序，以自动化执行所有传入的交易（转账，存款和取款）。银行共有 n 个账户，编号从 1 到 n 。每个账号的初始余额存储在一个下标从 0 开始的整数数组 balance 中，其中第 (i + 1) 个账户的初始余额是 balance[i] 。
+
+请你执行所有 有效的 交易。如果满足下面全部条件，则交易 有效 ：
+
+- 指定的账户数量在 1 和 n 之间，且
+- 取款或者转账需要的钱的总数 小于或者等于 账户余额。
+
+实现 Bank 类：
+
+- Bank(long[] balance) 使用下标从 0 开始的整数数组 balance 初始化该对象。
+- boolean transfer(int account1, int account2, long money) 从编号为 account1 的账户向编号为 account2 的账户转帐 money 美元。如果交易成功，返回 true ，否则，返回 false 。
+- boolean deposit(int account, long money) 向编号为 account 的账户存款 money 美元。如果交易成功，返回 true ；否则，返回 false 。
+- boolean withdraw(int account, long money) 从编号为 account 的账户取款 money 美元。如果交易成功，返回 true ；否则，返回 false 。
+
+## 解题思路
+
+ 根据题意进行简单模拟
+
+# 代码
+
+```go
+package leetcode
+
+type Bank struct {
+ accounts []int64
+ n int
+}
+
+func Constructor(balance []int64) Bank {
+ return Bank{
+ accounts: balance,
+ n: len(balance),
+ }
+}
+
+func (this *Bank) Transfer(account1 int, account2 int, money int64) bool {
+ if account1 > this.n || account2 > this.n {
+ return false
+ }
+ if this.accounts[account1-1] < money {
+ return false
+ }
+ this.accounts[account1-1] -= money
+ this.accounts[account2-1] += money
+ return true
+}
+
+func (this *Bank) Deposit(account int, money int64) bool {
+ if account > this.n {
+ return false
+ }
+ this.accounts[account-1] += money
+ return true
+}
+
+func (this *Bank) Withdraw(account int, money int64) bool {
+ if account > this.n {
+ return false
+ }
+ if this.accounts[account-1] < money {
+ return false
+ }
+ this.accounts[account-1] -= money
+ return true
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/2000~2099/2038.Remove-Colored-Pieces-if-Both-Neighbors-are-the-Same-Color/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/2000~2099/2096.Step-By-Step-Directions-From-a-Binary-Tree-Node-to-Another/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/2000~2099/2096.Step-By-Step-Directions-From-a-Binary-Tree-Node-to-Another.md b/website/content/ChapterFour/2000~2099/2096.Step-By-Step-Directions-From-a-Binary-Tree-Node-to-Another.md
new file mode 100644
index 000000000..65dcf54fb
--- /dev/null
+++ b/website/content/ChapterFour/2000~2099/2096.Step-By-Step-Directions-From-a-Binary-Tree-Node-to-Another.md
@@ -0,0 +1,152 @@
+# [2096. Step-By-Step Directions From a Binary Tree Node to Another](https://leetcode.com/problems/step-by-step-directions-from-a-binary-tree-node-to-another/)
+
+
+## 题目
+
+You are given the `root` of a **binary tree** with `n` nodes. Each node is uniquely assigned a value from `1` to `n`. You are also given an integer `startValue` representing the value of the start node `s`, and a different integer `destValue` representing the value of the destination node `t`.
+
+Find the **shortest path** starting from node `s` and ending at node `t`. Generate step-by-step directions of such path as a string consisting of only the **uppercase** letters `'L'`, `'R'`, and `'U'`. Each letter indicates a specific direction:
+
+- `'L'` means to go from a node to its **left child** node.
+- `'R'` means to go from a node to its **right child** node.
+- `'U'` means to go from a node to its **parent** node.
+
+Return *the step-by-step directions of the **shortest path** from node* `s` *to node* `t`.
+
+**Example 1:**
+
+
+
+```
+Input: root = [5,1,2,3,null,6,4], startValue = 3, destValue = 6
+Output: "UURL"
+Explanation: The shortest path is: 3 → 1 → 5 → 2 → 6.
+
+```
+
+**Example 2:**
+
+
+
+```
+Input: root = [2,1], startValue = 2, destValue = 1
+Output: "L"
+Explanation: The shortest path is: 2 → 1.
+
+```
+
+**Constraints:**
+
+- The number of nodes in the tree is `n`.
+- `2 <= n <= 105`
+- `1 <= Node.val <= n`
+- All the values in the tree are **unique**.
+- `1 <= startValue, destValue <= n`
+- `startValue != destValue`
+
+## 题目大意
+
+给你一棵 二叉树 的根节点 root ，这棵二叉树总共有 n 个节点。每个节点的值为 1 到 n 中的一个整数，且互不相同。给你一个整数 startValue ，表示起点节点 s 的值，和另一个不同的整数 destValue ，表示终点节点 t 的值。
+
+请找到从节点 s 到节点 t 的 最短路径 ，并以字符串的形式返回每一步的方向。每一步用 大写 字母 'L' ，'R' 和 'U' 分别表示一种方向：
+
+- 'L' 表示从一个节点前往它的 左孩子 节点。
+- 'R' 表示从一个节点前往它的 右孩子 节点。
+- 'U' 表示从一个节点前往它的 父 节点。
+
+请你返回从 s 到 t 最短路径 每一步的方向。
+
+## 解题思路
+
+- 二叉树中一个节点到另一个节点的最短路径一定可以分为两个部分（可能为空）：从起点节点向上到两个节点的**最近公共祖先**，再从最近公共祖先向下到达终点节点。
+- 首先需要找到起点 s 与公共祖先的节点之间的 path1，公共祖先节点与终点 t 的 path2。再删掉 2 个 path 的公共前缀。如果起点 s 和终点 t 在不同的分支上，不存在公共前缀。如果他们在相同的分支上，那么最终答案要去掉这个公共前缀。
+- 删除掉公共前缀以后，需要再整理一下最终答案的输出格式。由于题目要求，起点到公共祖先节点需要输出 U，所以把这段 path1 全部改成 U，然后再拼接上 path2 字符串，即可得到的字符串即为待求 ss 到 tt 每一步的最短路径。
+
+## 代码
+
+```go
+package leetcode
+
+import (
+ "github.com/halfrost/leetcode-go/structures"
+)
+
+// TreeNode define
+type TreeNode = structures.TreeNode
+
+/**
+ * Definition for a binary tree node.
+ * type TreeNode struct {
+ * Val int
+ * Left *TreeNode
+ * Right *TreeNode
+ * }
+ */
+
+func getDirections(root *TreeNode, startValue int, destValue int) string {
+ sPath, dPath := make([]byte, 0), make([]byte, 0)
+ findPath(root, startValue, &sPath)
+ findPath(root, destValue, &dPath)
+ size, i := min(len(sPath), len(dPath)), 0
+ for i < size {
+ if sPath[len(sPath)-1-i] == dPath[len(dPath)-1-i] {
+ i++
+ } else {
+ break
+ }
+ }
+ sPath = sPath[:len(sPath)-i]
+ replace(sPath)
+ dPath = dPath[:len(dPath)-i]
+ reverse(dPath)
+ sPath = append(sPath, dPath...)
+ return string(sPath)
+}
+
+func findPath(root *TreeNode, value int, path *[]byte) bool {
+ if root.Val == value {
+ return true
+ }
+
+ if root.Left != nil && findPath(root.Left, value, path) {
+ *path = append(*path, 'L')
+ return true
+ }
+
+ if root.Right != nil && findPath(root.Right, value, path) {
+ *path = append(*path, 'R')
+ return true
+ }
+
+ return false
+}
+
+func reverse(path []byte) {
+ left, right := 0, len(path)-1
+ for left < right {
+ path[left], path[right] = path[right], path[left]
+ left++
+ right--
+ }
+}
+
+func replace(path []byte) {
+ for i := 0; i < len(path); i++ {
+ path[i] = 'U'
+ }
+}
+
+func min(i, j int) int {
+ if i < j {
+ return i
+ }
+ return j
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/2000~2099/2043.Simple-Bank-System/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/2100~2199/2164.Sort-Even-and-Odd-Indices-Independently/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/2000~2099/_index.md b/website/content/ChapterFour/2000~2099/_index.md
new file mode 100644
index 000000000..e954f0877
--- /dev/null
+++ b/website/content/ChapterFour/2000~2099/_index.md
@@ -0,0 +1,4 @@
+---
+bookCollapseSection: true
+weight: 20
+---
diff --git a/website/content/ChapterFour/2100~2199/2164.Sort-Even-and-Odd-Indices-Independently.md b/website/content/ChapterFour/2100~2199/2164.Sort-Even-and-Odd-Indices-Independently.md
new file mode 100644
index 000000000..bb3a1e28c
--- /dev/null
+++ b/website/content/ChapterFour/2100~2199/2164.Sort-Even-and-Odd-Indices-Independently.md
@@ -0,0 +1,100 @@
+# [2164. Sort Even and Odd Indices Independently](https://leetcode.com/problems/sort-even-and-odd-indices-independently/)
+
+
+## 题目
+
+You are given a **0-indexed** integer array `nums`. Rearrange the values of `nums` according to the following rules:
+
+1. Sort the values at **odd indices** of `nums` in **non-increasing** order.
+ - For example, if `nums = [4,**1**,2,**3**]` before this step, it becomes `[4,**3**,2,**1**]` after. The values at odd indices `1` and `3` are sorted in non-increasing order.
+2. Sort the values at **even indices** of `nums` in **non-decreasing** order.
+ - For example, if `nums = [**4**,1,**2**,3]` before this step, it becomes `[**2**,1,**4**,3]` after. The values at even indices `0` and `2` are sorted in non-decreasing order.
+
+Return *the array formed after rearranging the values of* `nums`.
+
+**Example 1:**
+
+```
+Input: nums = [4,1,2,3]
+Output: [2,3,4,1]
+Explanation:
+First, we sort the values present at odd indices (1 and 3) in non-increasing order.
+So, nums changes from [4,1,2,3] to [4,3,2,1].
+Next, we sort the values present at even indices (0 and 2) in non-decreasing order.
+So, nums changes from [4,1,2,3] to [2,3,4,1].
+Thus, the array formed after rearranging the values is [2,3,4,1].
+
+```
+
+**Example 2:**
+
+```
+Input: nums = [2,1]
+Output: [2,1]
+Explanation:
+Since there is exactly one odd index and one even index, no rearrangement of values takes place.
+The resultant array formed is [2,1], which is the same as the initial array.
+
+```
+
+**Constraints:**
+
+- `1 <= nums.length <= 100`
+- `1 <= nums[i] <= 100`
+
+## 题目大意
+
+给你一个下标从 0 开始的整数数组 nums 。根据下述规则重排 nums 中的值：
+
+1. 按 非递增 顺序排列 nums 奇数下标 上的所有值。
+举个例子，如果排序前 nums = [4,1,2,3] ，对奇数下标的值排序后变为 [4,3,2,1] 。奇数下标 1 和 3 的值按照非递增顺序重排。
+2. 按 非递减 顺序排列 nums 偶数下标 上的所有值。
+举个例子，如果排序前 nums = [4,1,2,3] ，对偶数下标的值排序后变为 [2,1,4,3] 。偶数下标 0 和 2 的值按照非递减顺序重排。
+
+返回重排 nums 的值之后形成的数组。
+
+## 解题思路
+
+- 简单题。分别将奇数和偶数位上的数字排序，奇数位的数从大到小，偶数位的数从小到大。最后将他们组合成一个数组。
+
+## 代码
+
+```go
+package leetcode
+
+import (
+ "sort"
+)
+
+func sortEvenOdd(nums []int) []int {
+ odd, even, res := []int{}, []int{}, []int{}
+ for index, v := range nums {
+ if index%2 == 0 {
+ even = append(even, v)
+ } else {
+ odd = append(odd, v)
+ }
+ }
+ sort.Ints(even)
+ sort.Sort(sort.Reverse(sort.IntSlice(odd)))
+
+ indexO, indexE := 0, 0
+ for i := 0; i < len(nums); i++ {
+ if i%2 == 0 {
+ res = append(res, even[indexE])
+ indexE++
+ } else {
+ res = append(res, odd[indexO])
+ indexO++
+ }
+ }
+ return res
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/2000~2099/2096.Step-By-Step-Directions-From-a-Binary-Tree-Node-to-Another/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/2100~2199/2165.Smallest-Value-of-the-Rearranged-Number/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/2100~2199/2165.Smallest-Value-of-the-Rearranged-Number.md b/website/content/ChapterFour/2100~2199/2165.Smallest-Value-of-the-Rearranged-Number.md
new file mode 100644
index 000000000..d2ce438b0
--- /dev/null
+++ b/website/content/ChapterFour/2100~2199/2165.Smallest-Value-of-the-Rearranged-Number.md
@@ -0,0 +1,108 @@
+# [2165. Smallest Value of the Rearranged Number](https://leetcode.com/problems/smallest-value-of-the-rearranged-number/)
+
+
+## 题目
+
+You are given an integer `num.` **Rearrange** the digits of `num` such that its value is **minimized** and it does not contain **any** leading zeros.
+
+Return *the rearranged number with minimal value*.
+
+Note that the sign of the number does not change after rearranging the digits.
+
+**Example 1:**
+
+```
+Input: num = 310
+Output: 103
+Explanation: The possible arrangements for the digits of 310 are 013, 031, 103, 130, 301, 310.
+The arrangement with the smallest value that does not contain any leading zeros is 103.
+
+```
+
+**Example 2:**
+
+```
+Input: num = -7605
+Output: -7650
+Explanation: Some possible arrangements for the digits of -7605 are -7650, -6705, -5076, -0567.
+The arrangement with the smallest value that does not contain any leading zeros is -7650.
+
+```
+
+**Constraints:**
+
+- `10^15 <= num <= 10^15`
+
+## 题目大意
+
+给你一个整数 num 。重排 num 中的各位数字，使其值 最小化 且不含 任何 前导零。
+
+返回不含前导零且值最小的重排数字。注意，重排各位数字后，num 的符号不会改变。
+
+## 解题思路
+
+- 先将每个数字出现次数统计出来。然后将数字大小从小到大排序。如果原数是正数，当出现有数字 0 的情况的时候，需先将第二小的数字排列到第一个，再把 0 排列完。再继续排列第二小，第三小。。。
+- 如果原数是负数。那么就逆序排列，即先排列最大的数字，然后次大的数字，直到排列最小的数字。因为数字越大，对应的这个数的负数就越小。
+
+## 代码
+
+```go
+package leetcode
+
+import "sort"
+
+func smallestNumber(num int64) int64 {
+ pos := true
+ if num < 0 {
+ pos = false
+ num *= -1
+ }
+ nums, m, res := []int{}, map[int]int{}, 0
+ for num != 0 {
+ tmp := int(num % 10)
+ m[tmp]++
+ num = num / 10
+ }
+
+ for k := range m {
+ nums = append(nums, k)
+ }
+ if pos {
+ sort.Ints(nums)
+ } else {
+ sort.Sort(sort.Reverse(sort.IntSlice(nums)))
+ }
+
+ if nums[0] == 0 && len(nums) > 1 {
+ res += nums[1]
+ m[nums[1]]--
+ }
+
+ for _, v := range nums {
+ if res != 0 {
+ for j := m[v]; j > 0; j-- {
+ res = res * 10
+ res += v
+ }
+ } else {
+ res += v
+ tmp := m[v] - 1
+ for j := tmp; j > 0; j-- {
+ res = res * 10
+ res += v
+ }
+ }
+ }
+ if !pos {
+ return -1 * int64(res)
+ }
+ return int64(res)
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/2100~2199/2164.Sort-Even-and-Odd-Indices-Independently/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/2100~2199/2166.Design-Bitset/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/2100~2199/2166.Design-Bitset.md b/website/content/ChapterFour/2100~2199/2166.Design-Bitset.md
new file mode 100644
index 000000000..8fbc2a786
--- /dev/null
+++ b/website/content/ChapterFour/2100~2199/2166.Design-Bitset.md
@@ -0,0 +1,163 @@
+# [2166. Design Bitset](https://leetcode.com/problems/design-bitset/)
+
+
+## 题目
+
+A **Bitset** is a data structure that compactly stores bits.
+
+Implement the `Bitset` class:
+
+- `Bitset(int size)` Initializes the Bitset with `size` bits, all of which are `0`.
+- `void fix(int idx)` Updates the value of the bit at the index `idx` to `1`. If the value was already `1`, no change occurs.
+- `void unfix(int idx)` Updates the value of the bit at the index `idx` to `0`. If the value was already `0`, no change occurs.
+- `void flip()` Flips the values of each bit in the Bitset. In other words, all bits with value `0` will now have value `1` and vice versa.
+- `boolean all()` Checks if the value of **each** bit in the Bitset is `1`. Returns `true` if it satisfies the condition, `false` otherwise.
+- `boolean one()` Checks if there is **at least one** bit in the Bitset with value `1`. Returns `true` if it satisfies the condition, `false` otherwise.
+- `int count()` Returns the **total number** of bits in the Bitset which have value `1`.
+- `String toString()` Returns the current composition of the Bitset. Note that in the resultant string, the character at the `ith` index should coincide with the value at the `ith` bit of the Bitset.
+
+**Example 1:**
+
+```
+Input
+["Bitset", "fix", "fix", "flip", "all", "unfix", "flip", "one", "unfix", "count", "toString"]
+[[5], [3], [1], [], [], [0], [], [], [0], [], []]
+Output
+[null, null, null, null, false, null, null, true, null, 2, "01010"]
+
+Explanation
+Bitset bs = new Bitset(5); // bitset = "00000".
+bs.fix(3); // the value at idx = 3 is updated to 1, so bitset = "00010".
+bs.fix(1); // the value at idx = 1 is updated to 1, so bitset = "01010".
+bs.flip(); // the value of each bit is flipped, so bitset = "10101".
+bs.all(); // return False, as not all values of the bitset are 1.
+bs.unfix(0); // the value at idx = 0 is updated to 0, so bitset = "00101".
+bs.flip(); // the value of each bit is flipped, so bitset = "11010".
+bs.one(); // return True, as there is at least 1 index with value 1.
+bs.unfix(0); // the value at idx = 0 is updated to 0, so bitset = "01010".
+bs.count(); // return 2, as there are 2 bits with value 1.
+bs.toString(); // return "01010", which is the composition of bitset.
+
+```
+
+**Constraints:**
+
+- `1 <= size <= 10^5`
+- `0 <= idx <= size - 1`
+- At most `10^5` calls will be made **in total** to `fix`, `unfix`, `flip`, `all`, `one`, `count`, and `toString`.
+- At least one call will be made to `all`, `one`, `count`, or `toString`.
+- At most `5` calls will be made to `toString`.
+
+## 题目大意
+
+位集 Bitset 是一种能以紧凑形式存储位的数据结构。
+
+请你实现 Bitset 类。
+
+- Bitset(int size) 用 size 个位初始化 Bitset ，所有位都是 0 。
+- void fix(int idx) 将下标为 idx 的位上的值更新为 1 。如果值已经是 1 ，则不会发生任何改变。
+- void unfix(int idx) 将下标为 idx 的位上的值更新为 0 。如果值已经是 0 ，则不会发生任何改变。
+- void flip() 翻转 Bitset 中每一位上的值。换句话说，所有值为 0 的位将会变成 1 ，反之亦然。
+- boolean all() 检查 Bitset 中 每一位 的值是否都是 1 。如果满足此条件，返回 true ；否则，返回 false 。
+- boolean one() 检查 Bitset 中 是否 至少一位 的值是 1 。如果满足此条件，返回 true ；否则，返回 false 。
+- int count() 返回 Bitset 中值为 1 的位的 总数 。
+- String toString() 返回 Bitset 的当前组成情况。注意，在结果字符串中，第 i 个下标处的字符应该与 Bitset 中的第 i 位一致。
+
+提示：
+
+- 1 <= size <= 10^5
+- 0 <= idx <= size - 1
+- 至多调用 fix、unfix、flip、all、one、count 和 toString 方法 总共 10^5 次
+- 至少调用 all、one、count 或 toString 方法一次
+- 至多调用 toString 方法 5 次
+
+## 解题思路
+
+- 题目中给出了 size 大小，10^5 位二进制。所以不能用 int64 数据类型。
+- 用数组模拟二进制位的一系列操作。flip 操作并不需要每次去翻转，偶数次翻转等于没有翻转，奇数次翻转记下标记，同时更新 1 的个数。这次懒操作在调用 fix 和 unfix 时，更新到原来数组中。
+- fix 和 unfix 根据懒数组中的标记对应更新二进制位。同时更新 1 的个数。
+- all，one，count 都是判断 1 的个数。toString 输出即可。
+
+## 代码
+
+```go
+package leetcode
+
+type Bitset struct {
+ set []byte
+ flipped []byte
+ oneCount int
+ size int
+}
+
+func Constructor(size int) Bitset {
+ set := make([]byte, size)
+ flipped := make([]byte, size)
+ for i := 0; i < size; i++ {
+ set[i] = byte('0')
+ flipped[i] = byte('1')
+ }
+ return Bitset{
+ set: set,
+ flipped: flipped,
+ oneCount: 0,
+ size: size,
+ }
+}
+
+func (this *Bitset) Fix(idx int) {
+ if this.set[idx] == byte('0') {
+ this.set[idx] = byte('1')
+ this.flipped[idx] = byte('0')
+ this.oneCount++
+ }
+}
+
+func (this *Bitset) Unfix(idx int) {
+ if this.set[idx] == byte('1') {
+ this.set[idx] = byte('0')
+ this.flipped[idx] = byte('1')
+ this.oneCount--
+ }
+}
+
+func (this *Bitset) Flip() {
+ this.set, this.flipped = this.flipped, this.set
+ this.oneCount = this.size - this.oneCount
+}
+
+func (this *Bitset) All() bool {
+ return this.oneCount == this.size
+}
+
+func (this *Bitset) One() bool {
+ return this.oneCount != 0
+}
+
+func (this *Bitset) Count() int {
+ return this.oneCount
+}
+
+func (this *Bitset) ToString() string {
+ return string(this.set)
+}
+
+/**
+ * Your Bitset object will be instantiated and called as such:
+ * obj := Constructor(size);
+ * obj.Fix(idx);
+ * obj.Unfix(idx);
+ * obj.Flip();
+ * param_4 := obj.All();
+ * param_5 := obj.One();
+ * param_6 := obj.Count();
+ * param_7 := obj.ToString();
+ */
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/2100~2199/2165.Smallest-Value-of-the-Rearranged-Number/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/2100~2199/2167.Minimum-Time-to-Remove-All-Cars-Containing-Illegal-Goods/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/2100~2199/2167.Minimum-Time-to-Remove-All-Cars-Containing-Illegal-Goods.md b/website/content/ChapterFour/2100~2199/2167.Minimum-Time-to-Remove-All-Cars-Containing-Illegal-Goods.md
new file mode 100644
index 000000000..867f7fc8e
--- /dev/null
+++ b/website/content/ChapterFour/2100~2199/2167.Minimum-Time-to-Remove-All-Cars-Containing-Illegal-Goods.md
@@ -0,0 +1,156 @@
+# [2167. Minimum Time to Remove All Cars Containing Illegal Goods](https://leetcode.com/problems/minimum-time-to-remove-all-cars-containing-illegal-goods/)
+
+
+## 题目
+
+You are given a **0-indexed** binary string `s` which represents a sequence of train cars. `s[i] = '0'` denotes that the `ith` car does **not** contain illegal goods and `s[i] = '1'` denotes that the `ith` car does contain illegal goods.
+
+As the train conductor, you would like to get rid of all the cars containing illegal goods. You can do any of the following three operations **any** number of times:
+
+1. Remove a train car from the **left** end (i.e., remove `s[0]`) which takes 1 unit of time.
+2. Remove a train car from the **right** end (i.e., remove `s[s.length - 1]`) which takes 1 unit of time.
+3. Remove a train car from **anywhere** in the sequence which takes 2 units of time.
+
+Return *the **minimum** time to remove all the cars containing illegal goods*.
+
+Note that an empty sequence of cars is considered to have no cars containing illegal goods.
+
+**Example 1:**
+
+```
+Input: s = "1100101"
+Output: 5
+Explanation:
+One way to remove all the cars containing illegal goods from the sequence is to
+- remove a car from the left end 2 times. Time taken is 2 * 1 = 2.
+- remove a car from the right end. Time taken is 1.
+- remove the car containing illegal goods found in the middle. Time taken is 2.
+This obtains a total time of 2 + 1 + 2 = 5.
+
+An alternative way is to
+- remove a car from the left end 2 times. Time taken is 2 * 1 = 2.
+- remove a car from the right end 3 times. Time taken is 3 * 1 = 3.
+This also obtains a total time of 2 + 3 = 5.
+
+5 is the minimum time taken to remove all the cars containing illegal goods.
+There are no other ways to remove them with less time.
+
+```
+
+**Example 2:**
+
+```
+Input: s = "0010"
+Output: 2
+Explanation:
+One way to remove all the cars containing illegal goods from the sequence is to
+- remove a car from the left end 3 times. Time taken is 3 * 1 = 3.
+This obtains a total time of 3.
+
+Another way to remove all the cars containing illegal goods from the sequence is to
+- remove the car containing illegal goods found in the middle. Time taken is 2.
+This obtains a total time of 2.
+
+Another way to remove all the cars containing illegal goods from the sequence is to
+- remove a car from the right end 2 times. Time taken is 2 * 1 = 2.
+This obtains a total time of 2.
+
+2 is the minimum time taken to remove all the cars containing illegal goods.
+There are no other ways to remove them with less time.
+```
+
+**Constraints:**
+
+- `1 <= s.length <= 2 * 10^5`
+- `s[i]` is either `'0'` or `'1'`.
+
+## 题目大意
+
+给你一个下标从 0 开始的二进制字符串 s ，表示一个列车车厢序列。s[i] = '0' 表示第 i 节车厢 不 含违禁货物，而 s[i] = '1' 表示第 i 节车厢含违禁货物。
+
+作为列车长，你需要清理掉所有载有违禁货物的车厢。你可以不限次数执行下述三种操作中的任意一个：
+
+1. 从列车 左 端移除一节车厢（即移除 s[0]），用去 1 单位时间。
+2. 从列车 右 端移除一节车厢（即移除 s[s.length - 1]），用去 1 单位时间。
+3. 从列车车厢序列的 任意位置 移除一节车厢，用去 2 单位时间。
+
+返回移除所有载有违禁货物车厢所需要的 最少 单位时间数。注意，空的列车车厢序列视为没有车厢含违禁货物。
+
+## 解题思路
+
+- 这道题求最少单位时间数，最少时间数一定是尽量少使用 2 个单位时间的操作，多用 1 个时间的操作。从列车两头移除车厢，只需要移除和旁边车厢的金属连接处即可。由于列车位于两边，所以与其他车厢的金属连接处只有 1 个，故只需要 1 个单位时间；当车厢在中间，该车厢与两边的车厢有 2 个金属连接处，移除它需要断开与两边车厢的连接。所以需要 2 个单位时间。
+- 断开中间一节车厢以后，列车会被断成 2 部分。2 部分列车分别有 2 个头 2 个尾。举例：`1100111101`，如果把它从第 5 节开始断开，剩下的列车为 `11001 (1)` 和 `1101`。剩下的 1 都位于 2 边，移除他们都只需要 1 个单位时间。那么移除所有违禁品最少时间是 2 * 1 + 1 * 6 = 8。
+- 左半部分，定义 prefixSum[i] 表示移除前 i 节车厢所花费的最少时间。状态转移方程为：
+
+ {{< katex display >}}
+ prefixSum[i] =\left\{\begin{matrix}prefixSum[i-1],s[i]=0\\ min(prefixSum[i-1]+2, i+1), s[i]=1\end{matrix}\right.
+ {{< /katex >}}
+
+- 同理，右半部分定义 suffixSum[i] 表示移除后 i 节车厢所花费的最少时间。状态转移方程为：
+
+ {{< katex display >}}
+ suffixSum[i] =\left\{\begin{matrix} suffixSum[i+1],s[i]=0\\ min(suffixSum[i+1]+2, n-i), s[i]=1\end{matrix}\right.
+ {{< /katex >}}
+
+- 最后一层循环枚举 prefixSum[i] + suffixSum[i+1] 的最小值即为答案。
+- 这一题在解法一的基础上还可以再简化。当 s[i] = 1 时，prefixSum 和 suffixSum 是两种计算方法。我们可以假设中间断开的部分在 prefixSum 中。于是可以合并上面两个状态转移方程。简化以后的代码见解法二。
+
+## 代码
+
+```go
+package leetcode
+
+import "runtime/debug"
+
+// 解法一 DP
+func minimumTime(s string) int {
+ suffixSum, prefixSum, res := make([]int, len(s)+1), make([]int, len(s)+1), 0
+ for i := len(s) - 1; i >= 0; i-- {
+ if s[i] == '0' {
+ suffixSum[i] = suffixSum[i+1]
+ } else {
+ suffixSum[i] = min(suffixSum[i+1]+2, len(s)-i)
+ }
+ }
+ res = suffixSum[0]
+ if s[0] == '1' {
+ prefixSum[0] = 1
+ }
+ for i := 1; i < len(s); i++ {
+ if s[i] == '0' {
+ prefixSum[i] = prefixSum[i-1]
+ } else {
+ prefixSum[i] = min(prefixSum[i-1]+2, i+1)
+ }
+ res = min(res, prefixSum[i]+suffixSum[i+1])
+ }
+ return res
+}
+
+func init() { debug.SetGCPercent(-1) }
+
+// 解法二 小幅优化时间和空间复杂度
+func minimumTime1(s string) int {
+ res, count := len(s), 0
+ for i := 0; i < len(s); i++ {
+ count = min(count+int(s[i]-'0')*2, i+1)
+ res = min(res, count+len(s)-i-1)
+ }
+ return res
+}
+
+func min(a, b int) int {
+ if a < b {
+ return a
+ } else {
+ return b
+ }
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/2100~2199/2166.Design-Bitset/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/2100~2199/2169.Count-Operations-to-Obtain-Zero/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/2100~2199/2169.Count-Operations-to-Obtain-Zero.md b/website/content/ChapterFour/2100~2199/2169.Count-Operations-to-Obtain-Zero.md
new file mode 100644
index 000000000..588a18794
--- /dev/null
+++ b/website/content/ChapterFour/2100~2199/2169.Count-Operations-to-Obtain-Zero.md
@@ -0,0 +1,80 @@
+# [2169. Count Operations to Obtain Zero](https://leetcode.com/problems/count-operations-to-obtain-zero/)
+
+
+## 题目
+
+You are given two **non-negative** integers `num1` and `num2`.
+
+In one **operation**, if `num1 >= num2`, you must subtract `num2` from `num1`, otherwise subtract `num1` from `num2`.
+
+- For example, if `num1 = 5` and `num2 = 4`, subtract `num2` from `num1`, thus obtaining `num1 = 1` and `num2 = 4`. However, if `num1 = 4` and `num2 = 5`, after one operation, `num1 = 4` and `num2 = 1`.
+
+Return *the **number of operations** required to make either* `num1 = 0` *or* `num2 = 0`.
+
+**Example 1:**
+
+```
+Input: num1 = 2, num2 = 3
+Output: 3
+Explanation:
+- Operation 1: num1 = 2, num2 = 3. Since num1 < num2, we subtract num1 from num2 and get num1 = 2, num2 = 3 - 2 = 1.
+- Operation 2: num1 = 2, num2 = 1. Since num1 > num2, we subtract num2 from num1.
+- Operation 3: num1 = 1, num2 = 1. Since num1 == num2, we subtract num2 from num1.
+Now num1 = 0 and num2 = 1. Since num1 == 0, we do not need to perform any further operations.
+So the total number of operations required is 3.
+
+```
+
+**Example 2:**
+
+```
+Input: num1 = 10, num2 = 10
+Output: 1
+Explanation:
+- Operation 1: num1 = 10, num2 = 10. Since num1 == num2, we subtract num2 from num1 and get num1 = 10 - 10 = 0.
+Now num1 = 0 and num2 = 10. Since num1 == 0, we are done.
+So the total number of operations required is 1.
+
+```
+
+**Constraints:**
+
+- `0 <= num1, num2 <= 10^5`
+
+## 题目大意
+
+给你两个 非负 整数 num1 和 num2 。每一步 操作 中，如果 num1 >= num2 ，你必须用 num1 减 num2 ；否则，你必须用 num2 减 num1 。
+
+- 例如，num1 = 5 且 num2 = 4 ，应该用 num1 减 num2 ，因此，得到 num1 = 1 和 num2 = 4 。然而，如果 num1 = 4且 num2 = 5 ，一步操作后，得到 num1 = 4 和 num2 = 1 。
+
+返回使 num1 = 0 或 num2 = 0 的 操作数 。
+
+## 解题思路
+
+- 简单题，按照题意模拟，每次两个数字相减，便累加操作次数。当某个数字变为 0 时，输出操作次数。
+
+## 代码
+
+```go
+package leetcode
+
+func countOperations(num1 int, num2 int) int {
+ res := 0
+ for num1 != 0 && num2 != 0 {
+ if num1 >= num2 {
+ num1 -= num2
+ } else {
+ num2 -= num1
+ }
+ res++
+ }
+ return res
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/2100~2199/2167.Minimum-Time-to-Remove-All-Cars-Containing-Illegal-Goods/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/2100~2199/2170.Minimum-Operations-to-Make-the-Array-Alternating/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/2100~2199/2170.Minimum-Operations-to-Make-the-Array-Alternating.md b/website/content/ChapterFour/2100~2199/2170.Minimum-Operations-to-Make-the-Array-Alternating.md
new file mode 100644
index 000000000..e41c64ec8
--- /dev/null
+++ b/website/content/ChapterFour/2100~2199/2170.Minimum-Operations-to-Make-the-Array-Alternating.md
@@ -0,0 +1,137 @@
+# [2170. Minimum Operations to Make the Array Alternating](https://leetcode.com/problems/minimum-operations-to-make-the-array-alternating/)
+
+
+## 题目
+
+You are given a **0-indexed** array `nums` consisting of `n` positive integers.
+
+The array `nums` is called **alternating** if:
+
+- `nums[i - 2] == nums[i]`, where `2 <= i <= n - 1`.
+- `nums[i - 1] != nums[i]`, where `1 <= i <= n - 1`.
+
+In one **operation**, you can choose an index `i` and **change** `nums[i]` into **any** positive integer.
+
+Return *the **minimum number of operations** required to make the array alternating*.
+
+**Example 1:**
+
+```
+Input: nums = [3,1,3,2,4,3]
+Output: 3
+Explanation:
+One way to make the array alternating is by converting it to [3,1,3,1,3,1].
+The number of operations required in this case is 3.
+It can be proven that it is not possible to make the array alternating in less than 3 operations.
+
+```
+
+**Example 2:**
+
+```
+Input: nums = [1,2,2,2,2]
+Output: 2
+Explanation:
+One way to make the array alternating is by converting it to [1,2,1,2,1].
+The number of operations required in this case is 2.
+Note that the array cannot be converted to [2,2,2,2,2] because in this case nums[0] == nums[1] which violates the conditions of an alternating array.
+
+```
+
+**Constraints:**
+
+- `1 <= nums.length <= 10^5`
+- `1 <= nums[i] <= 10^5`
+
+## 题目大意
+
+给你一个下标从 0 开始的数组 nums ，该数组由 n 个正整数组成。
+
+如果满足下述条件，则数组 nums 是一个 交替数组 ：
+
+- nums[i - 2] == nums[i] ，其中 2 <= i <= n - 1 。
+- nums[i - 1] != nums[i] ，其中 1 <= i <= n - 1 。
+
+在一步 操作 中，你可以选择下标 i 并将 nums[i] 更改 为 任一 正整数。返回使数组变成交替数组的 最少操作数 。
+
+**提示：**
+
+- `1 <= nums.length <= 10^5`
+- `1 <= nums[i] <= 10^5`
+
+## 解题思路
+
+- 题目要求最少操作数，即留下出现频次最多的数字，剩下的数字都替换成这个数字。先将每个数字出现的频次统计出来，然后按照频次从大到小排序。优先选择出现频次高的数字。
+- 有几种“特殊”情况需要处理：当奇数下标的数字频次最大的数字和偶数下标的数字频次最大的数字相同（数字相同，频次不同），这时应选取频次大的数字留下；当数字相同，频次也相同，这时要看奇数下标和偶数下标的数字分别有几个。 如果其中一个只有一种数字，那么另外一组数字则需都变成该组频次第二大的数字，例如奇数下标的数字全是 1，频次是 3，偶数下标的数字是 1，最大频次是 2。第二频次的数字是 9，频次是 1 。那么这种情况下，选择奇数下标的数字 1，和偶数下标数字 9 。将偶数下标不是 9 的数字改变成 9 ；更近一步，如果奇数下标和偶数下标都只有一个数字，频次相同，那么只能改变奇数下标或者偶数下标的所有数字。
+
+## 代码
+
+```go
+package leetcode
+
+import (
+ "sort"
+)
+
+type node struct {
+ value int
+ count int
+}
+
+func minimumOperations(nums []int) int {
+ if len(nums) == 1 {
+ return 0
+ }
+ res, odd, even, oddMap, evenMap := 0, []node{}, []node{}, map[int]int{}, map[int]int{}
+
+ for i := 0; i < len(nums); i += 2 {
+ evenMap[nums[i]]++
+ }
+ for k, v := range evenMap {
+ even = append(even, node{value: k, count: v})
+ }
+ sort.Slice(even, func(i, j int) bool {
+ return even[i].count > even[j].count
+ })
+
+ for i := 1; i < len(nums); i += 2 {
+ oddMap[nums[i]]++
+ }
+ for k, v := range oddMap {
+ odd = append(odd, node{value: k, count: v})
+ }
+ sort.Slice(odd, func(i, j int) bool {
+ return odd[i].count > odd[j].count
+ })
+
+ if even[0].value == odd[0].value {
+ if len(even) == 1 && len(odd) != 1 {
+ res = len(nums) - even[0].count - odd[1].count
+ } else if len(odd) == 1 && len(even) != 1 {
+ res = len(nums) - odd[0].count - even[1].count
+ } else if len(odd) == 1 && len(even) == 1 {
+ res = len(nums) / 2
+ } else {
+ // both != 1
+ res = min(len(nums)-odd[0].count-even[1].count, len(nums)-odd[1].count-even[0].count)
+ }
+ } else {
+ res = len(nums) - even[0].count - odd[0].count
+ }
+ return res
+}
+
+func min(a, b int) int {
+ if a > b {
+ return b
+ }
+ return a
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/2100~2199/2169.Count-Operations-to-Obtain-Zero/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/2100~2199/2171.Removing-Minimum-Number-of-Magic-Beans/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/2100~2199/2171.Removing-Minimum-Number-of-Magic-Beans.md b/website/content/ChapterFour/2100~2199/2171.Removing-Minimum-Number-of-Magic-Beans.md
new file mode 100644
index 000000000..410c13c7c
--- /dev/null
+++ b/website/content/ChapterFour/2100~2199/2171.Removing-Minimum-Number-of-Magic-Beans.md
@@ -0,0 +1,97 @@
+# [2171. Removing Minimum Number of Magic Beans](https://leetcode.com/problems/removing-minimum-number-of-magic-beans/)
+
+
+## 题目
+
+You are given an array of **positive** integers `beans`, where each integer represents the number of magic beans found in a particular magic bag.
+
+**Remove** any number of beans (**possibly none**) from each bag such that the number of beans in each remaining **non-empty** bag (still containing **at least one** bean) is **equal**. Once a bean has been removed from a bag, you are **not** allowed to return it to any of the bags.
+
+Return *the **minimum** number of magic beans that you have to remove*.
+
+**Example 1:**
+
+```
+Input: beans = [4,1,6,5]
+Output: 4
+Explanation:
+- We remove 1 bean from the bag with only 1 bean.
+ This results in the remaining bags: [4,0,6,5]
+- Then we remove 2 beans from the bag with 6 beans.
+ This results in the remaining bags: [4,0,4,5]
+- Then we remove 1 bean from the bag with 5 beans.
+ This results in the remaining bags: [4,0,4,4]
+We removed a total of 1 + 2 + 1 = 4 beans to make the remaining non-empty bags have an equal number of beans.
+There are no other solutions that remove 4 beans or fewer.
+
+```
+
+**Example 2:**
+
+```
+Input: beans = [2,10,3,2]
+Output: 7
+Explanation:
+- We remove 2 beans from one of the bags with 2 beans.
+ This results in the remaining bags: [0,10,3,2]
+- Then we remove 2 beans from the other bag with 2 beans.
+ This results in the remaining bags: [0,10,3,0]
+- Then we remove 3 beans from the bag with 3 beans.
+ This results in the remaining bags: [0,10,0,0]
+We removed a total of 2 + 2 + 3 = 7 beans to make the remaining non-empty bags have an equal number of beans.
+There are no other solutions that removes 7 beans or fewer.
+
+```
+
+**Constraints:**
+
+- `1 <= beans.length <= 10^5`
+- `1 <= beans[i] <= 10^5`
+
+## 题目大意
+
+给你一个 正 整数数组 beans ，其中每个整数表示一个袋子里装的魔法豆的数目。
+
+请你从每个袋子中 拿出 一些豆子（也可以 不拿出），使得剩下的 非空 袋子中（即 至少 还有 一颗 魔法豆的袋子）魔法豆的数目 相等 。一旦魔法豆从袋子中取出，你不能将它放到任何其他的袋子中。请你返回你需要拿出魔法豆的 最少数目。
+
+**提示：**
+
+- `1 <= beans.length <= 10^5`
+- `1 <= beans[i] <= 10^5`
+
+## 解题思路
+
+- 这一题没有特别巧妙的方法。最初思路来源于暴力解法。从第一个袋子开始，依次以每个袋子中的豆子为基准，改变其他袋子里面的豆子数，使得其他袋子里面的豆子都和基准袋子中豆子一样多。
+- 如果从下标为 0 扫到下标 n-1 ，这中间会有大量重复计算。有些计算区间和的操作，反复计算了很多遍，导致算法不高效。由于移除豆子数量多少和基准袋豆子数量强相关，所以先排序。如果袋子内豆子数目小于基准袋的豆子，`0 ≤ j < i`，那么这些袋子内的豆子数量会归零。需要移除 `beans[0] + beans[1] + ... + beans[i-1]` 个豆子；如果袋子内豆子数目大于等于基准袋的豆子，`j ≥ i` ，那么这些袋子内的豆子需要调整为 `beans[i]` 个。需要移除 `(beans[i] - beans[i]) + (beans[i+1] - beans[i]) + (beans[i+2] - beans[i]) + ... + (beans[n-1] - beans[i]) = beans[i]+ ... + beans[n-1] - (n-i) * beans[i]` 个豆子。将这 2 种情况综合起来，那么总共需要移除 `sum(beans) - (N - i) * beans[i]` 个豆子。综上，先排序，然后从小到大扫一遍数组，动态维护最少移除豆子的个数即可。
+
+## 代码
+
+```go
+package leetcode
+
+import "sort"
+
+func minimumRemoval(beans []int) int64 {
+ sort.Ints(beans)
+ sum, mx := 0, 0
+ for i, v := range beans {
+ sum += v
+ mx = max(mx, (len(beans)-i)*v)
+ }
+ return int64(sum - mx)
+}
+
+func max(a, b int) int {
+ if b > a {
+ return b
+ }
+ return a
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/2100~2199/2170.Minimum-Operations-to-Make-the-Array-Alternating/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/2100~2199/2180.Count-Integers-With-Even-Digit-Sum/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/2100~2199/2180.Count-Integers-With-Even-Digit-Sum.md b/website/content/ChapterFour/2100~2199/2180.Count-Integers-With-Even-Digit-Sum.md
new file mode 100644
index 000000000..4685d7d37
--- /dev/null
+++ b/website/content/ChapterFour/2100~2199/2180.Count-Integers-With-Even-Digit-Sum.md
@@ -0,0 +1,76 @@
+# [2180. Count Integers With Even Digit Sum](https://leetcode.com/problems/count-integers-with-even-digit-sum/)
+
+
+## 题目
+
+Given a positive integer `num`, return *the number of positive integers **less than or equal to*** `num` *whose digit sums are **even***.
+
+The **digit sum** of a positive integer is the sum of all its digits.
+
+**Example 1:**
+
+```
+Input: num = 4
+Output: 2
+Explanation:
+The only integers less than or equal to 4 whose digit sums are even are 2 and 4.
+
+```
+
+**Example 2:**
+
+```
+Input: num = 30
+Output: 14
+Explanation:
+The 14 integers less than or equal to 30 whose digit sums are even are
+2, 4, 6, 8, 11, 13, 15, 17, 19, 20, 22, 24, 26, and 28.
+
+```
+
+**Constraints:**
+
+- `1 <= num <= 1000`
+
+## 题目大意
+
+给你一个正整数 num ，请你统计并返回 小于或等于 num 且各位数字之和为 偶数 的正整数的数目。
+
+正整数的 各位数字之和 是其所有位上的对应数字相加的结果。
+
+## 解题思路
+
+- 简单题。依照题意，计算每个数的各位数字之和，如何和为偶数，则统计结果加一。最后输出统计结果即可。
+
+## 代码
+
+```go
+package leetcode
+
+func countEven(num int) int {
+ count := 0
+ for i := 1; i <= num; i++ {
+ if addSum(i)%2 == 0 {
+ count++
+ }
+ }
+ return count
+}
+
+func addSum(num int) int {
+ sum := 0
+ tmp := num
+ for tmp != 0 {
+ sum += tmp % 10
+ tmp = tmp / 10
+ }
+ return sum
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/2100~2199/2171.Removing-Minimum-Number-of-Magic-Beans/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/2100~2199/2181.Merge-Nodes-in-Between-Zeros/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/2100~2199/2181.Merge-Nodes-in-Between-Zeros.md b/website/content/ChapterFour/2100~2199/2181.Merge-Nodes-in-Between-Zeros.md
new file mode 100644
index 000000000..35ef63ea0
--- /dev/null
+++ b/website/content/ChapterFour/2100~2199/2181.Merge-Nodes-in-Between-Zeros.md
@@ -0,0 +1,103 @@
+# [2181. Merge Nodes in Between Zeros](https://leetcode.com/problems/merge-nodes-in-between-zeros/)
+
+## 题目
+
+You are given the `head` of a linked list, which contains a series of integers **separated** by `0`'s. The **beginning** and **end** of the linked list will have `Node.val == 0`.
+
+For **every** two consecutive `0`'s, **merge** all the nodes lying in between them into a single node whose value is the **sum** of all the merged nodes. The modified list should not contain any `0`'s.
+
+Return *the* `head` *of the modified linked list*.
+
+**Example 1:**
+
+
+
+```
+Input: head = [0,3,1,0,4,5,2,0]
+Output: [4,11]
+Explanation:
+The above figure represents the given linked list. The modified list contains
+- The sum of the nodes marked in green: 3 + 1 = 4.
+- The sum of the nodes marked in red: 4 + 5 + 2 = 11.
+
+```
+
+**Example 2:**
+
+
+
+```
+Input: head = [0,1,0,3,0,2,2,0]
+Output: [1,3,4]
+Explanation:
+The above figure represents the given linked list. The modified list contains
+- The sum of the nodes marked in green: 1 = 1.
+- The sum of the nodes marked in red: 3 = 3.
+- The sum of the nodes marked in yellow: 2 + 2 = 4.
+
+```
+
+**Constraints:**
+
+- The number of nodes in the list is in the range `[3, 2 * 10^5]`.
+- `0 <= Node.val <= 1000`
+- There are **no** two consecutive nodes with `Node.val == 0`.
+- The **beginning** and **end** of the linked list have `Node.val == 0`.
+
+## 题目大意
+
+给你一个链表的头节点 head ，该链表包含由 0 分隔开的一连串整数。链表的 开端 和 末尾 的节点都满足 Node.val == 0 。对于每两个相邻的 0 ，请你将它们之间的所有节点合并成一个节点，其值是所有已合并节点的值之和。然后将所有 0 移除，修改后的链表不应该含有任何 0 。
+
+返回修改后链表的头节点 head 。
+
+## 解题思路
+
+- 简单题。合并链表中两个值为 0 的节点。从头开始遍历链表，遇到节点值不为 0 的节点便累加；遇到节点值为 0 的节点，将累加值转换成结果链表要输出的节点值，然后继续遍历。
+
+## 代码
+
+```go
+package leetcode
+
+import (
+ "github.com/halfrost/leetcode-go/structures"
+)
+
+// ListNode define
+type ListNode = structures.ListNode
+
+/**
+ * Definition for singly-linked list.
+ * type ListNode struct {
+ * Val int
+ * Next *ListNode
+ * }
+ */
+func mergeNodes(head *ListNode) *ListNode {
+ res := &ListNode{}
+ h := res
+ if head.Next == nil {
+ return &structures.ListNode{}
+ }
+ cur := head
+ sum := 0
+ for cur.Next != nil {
+ if cur.Next.Val != 0 {
+ sum += cur.Next.Val
+ } else {
+ h.Next = &ListNode{Val: sum, Next: nil}
+ h = h.Next
+ sum = 0
+ }
+ cur = cur.Next
+ }
+ return res.Next
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/2100~2199/2180.Count-Integers-With-Even-Digit-Sum/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/2100~2199/2182.Construct-String-With-Repeat-Limit/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/2100~2199/2182.Construct-String-With-Repeat-Limit.md b/website/content/ChapterFour/2100~2199/2182.Construct-String-With-Repeat-Limit.md
new file mode 100644
index 000000000..0507b90ee
--- /dev/null
+++ b/website/content/ChapterFour/2100~2199/2182.Construct-String-With-Repeat-Limit.md
@@ -0,0 +1,105 @@
+# [2182. Construct String With Repeat Limit](https://leetcode.com/problems/construct-string-with-repeat-limit/)
+
+
+## 题目
+
+You are given a string `s` and an integer `repeatLimit`. Construct a new string `repeatLimitedString` using the characters of `s` such that no letter appears **more than** `repeatLimit` times **in a row**. You do **not** have to use all characters from `s`.
+
+Return *the **lexicographically largest*** `repeatLimitedString` *possible*.
+
+A string `a` is **lexicographically larger** than a string `b` if in the first position where `a` and `b` differ, string `a` has a letter that appears later in the alphabet than the corresponding letter in `b`. If the first `min(a.length, b.length)` characters do not differ, then the longer string is the lexicographically larger one.
+
+**Example 1:**
+
+```
+Input: s = "cczazcc", repeatLimit = 3
+Output: "zzcccac"
+Explanation: We use all of the characters from s to construct the repeatLimitedString "zzcccac".
+The letter 'a' appears at most 1 time in a row.
+The letter 'c' appears at most 3 times in a row.
+The letter 'z' appears at most 2 times in a row.
+Hence, no letter appears more than repeatLimit times in a row and the string is a valid repeatLimitedString.
+The string is the lexicographically largest repeatLimitedString possible so we return "zzcccac".
+Note that the string "zzcccca" is lexicographically larger but the letter 'c' appears more than 3 times in a row, so it is not a valid repeatLimitedString.
+
+```
+
+**Example 2:**
+
+```
+Input: s = "aababab", repeatLimit = 2
+Output: "bbabaa"
+Explanation: We use only some of the characters from s to construct the repeatLimitedString "bbabaa".
+The letter 'a' appears at most 2 times in a row.
+The letter 'b' appears at most 2 times in a row.
+Hence, no letter appears more than repeatLimit times in a row and the string is a valid repeatLimitedString.
+The string is the lexicographically largest repeatLimitedString possible so we return "bbabaa".
+Note that the string "bbabaaa" is lexicographically larger but the letter 'a' appears more than 2 times in a row, so it is not a valid repeatLimitedString.
+
+```
+
+**Constraints:**
+
+- `1 <= repeatLimit <= s.length <= 10^5`
+- `s` consists of lowercase English letters.
+
+## 题目大意
+
+给你一个字符串 s 和一个整数 repeatLimit ，用 s 中的字符构造一个新字符串 repeatLimitedString ，使任何字母 连续 出现的次数都不超过 repeatLimit 次。你不必使用 s 中的全部字符。
+
+返回 字典序最大的 repeatLimitedString 。
+
+如果在字符串 a 和 b 不同的第一个位置，字符串 a 中的字母在字母表中出现时间比字符串 b 对应的字母晚，则认为字符串 a 比字符串 b 字典序更大 。如果字符串中前 min(a.length, b.length) 个字符都相同，那么较长的字符串字典序更大。
+
+## 解题思路
+
+- 利用贪心的思想，由于题意要求返回字典序最大的字符串，所以先从字典序最大的字母开始选起。然后选择当前字典序最大的字母个数和 limit 的最小值。如果当前字典序最大的字母比较多，多于 limit，不能一直选择它。选完 limit 个以后，需要选一个字典序次大的字母，选完这个字母以后再次选择字典序最大的字母。因为 limit 限制字母不能连续多于 limit 个。如此循环，直到所有的字母都选完。这样的策略排列出来的字母串为最大字典序。
+
+## 代码
+
+```go
+package leetcode
+
+func repeatLimitedString(s string, repeatLimit int) string {
+ cnt := make([]int, 26)
+ for _, c := range s {
+ cnt[int(c-'a')]++
+ }
+ var ns []byte
+ for i := 25; i >= 0; {
+ k := i - 1
+ for cnt[i] > 0 {
+ for j := 0; j < min(cnt[i], repeatLimit); j++ {
+ ns = append(ns, byte(i)+'a')
+ }
+ cnt[i] -= repeatLimit
+ if cnt[i] > 0 {
+ for ; k >= 0 && cnt[k] == 0; k-- {
+ }
+ if k < 0 {
+ break
+ } else {
+ ns = append(ns, byte(k)+'a')
+ cnt[k]--
+ }
+ }
+ }
+ i = k
+ }
+ return string(ns)
+}
+func min(a, b int) int {
+ if a < b {
+ return a
+ } else {
+ return b
+ }
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/2100~2199/2181.Merge-Nodes-in-Between-Zeros/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/2100~2199/2183.Count-Array-Pairs-Divisible-by-K/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/2100~2199/2183.Count-Array-Pairs-Divisible-by-K.md b/website/content/ChapterFour/2100~2199/2183.Count-Array-Pairs-Divisible-by-K.md
new file mode 100644
index 000000000..71d925113
--- /dev/null
+++ b/website/content/ChapterFour/2100~2199/2183.Count-Array-Pairs-Divisible-by-K.md
@@ -0,0 +1,90 @@
+# [2183. Count Array Pairs Divisible by K](https://leetcode.com/problems/count-array-pairs-divisible-by-k/)
+
+
+## 题目
+
+Given a **0-indexed** integer array `nums` of length `n` and an integer `k`, return *the **number of pairs*** `(i, j)` *such that:*
+
+- `0 <= i < j <= n - 1` *and*
+- `nums[i] * nums[j]` *is divisible by* `k`.
+
+**Example 1:**
+
+```
+Input: nums = [1,2,3,4,5], k = 2
+Output: 7
+Explanation:
+The 7 pairs of indices whose corresponding products are divisible by 2 are
+(0, 1), (0, 3), (1, 2), (1, 3), (1, 4), (2, 3), and (3, 4).
+Their products are 2, 4, 6, 8, 10, 12, and 20 respectively.
+Other pairs such as (0, 2) and (2, 4) have products 3 and 15 respectively, which are not divisible by 2.
+
+```
+
+**Example 2:**
+
+```
+Input: nums = [1,2,3,4], k = 5
+Output: 0
+Explanation: There does not exist any pair of indices whose corresponding product is divisible by 5.
+
+```
+
+**Constraints:**
+
+- `1 <= nums.length <= 10^5`
+- `1 <= nums[i], k <= 10^5`
+
+## 题目大意
+
+给你一个下标从 0 开始、长度为 n 的整数数组 nums 和一个整数 k ，返回满足下述条件的下标对 (i, j) 的数目：
+
+- 0 <= i < j <= n - 1 且
+- nums[i] * nums[j] 能被 k 整除。
+
+## 解题思路
+
+- 先找出 num 中每个元素与 k 的最大公约数。并统计这些公约数出现的频次，将数据保存在 map 中。在计算过程中，循环可以只需算到 {{< katex >}}{O(\sqrt {k})}{{< /katex >}} , 因为每一个 gcd[i] 一定是 k 的因数，而它出现的频次不会超过 {{< katex >}}{O(\sqrt {k})}{{< /katex >}}。简单证明一下：假设因子 v 和 k/v 这两个因数为 k 的因子。v 和 k/v 必至少有 1 个小于等于 {{< katex >}}\sqrt {k}{{< /katex >}}。所以 k 的因子也不会超过 2 * {{< katex >}}\sqrt {k}{{< /katex >}} = {{< katex >}}{O(\sqrt {k})}{{< /katex >}} 个。
+- 算出上述的 map 以后，2 层循环暴力遍历 key 值，如果 a * b 能被 k 整除，并且 a 和 b 不相同，那么 a 和 b 对应的 value 值相乘即为满足条件的下标对数；如果 a 和 b 相同，那么下标对数为 {{< katex >}}C_{n}^{2}{{< /katex >}}。最后累加结果即可。
+
+## 代码
+
+```go
+package leetcode
+
+import "math"
+
+func countPairs(nums []int, k int) int64 {
+ n := int(math.Sqrt(float64(k)))
+ gcds, res := make(map[int]int, n), 0
+ for _, num := range nums {
+ gcds[gcd(num, k)]++
+ }
+
+ for a, n1 := range gcds {
+ for b, n2 := range gcds {
+ if a > b || (a*b)%k != 0 {
+ continue
+ }
+ if a != b {
+ res += n1 * n2
+ } else { // a == b
+ res += n1 * (n1 - 1) / 2
+ }
+ }
+ }
+ return int64(res)
+}
+
+func gcd(a, b int) int {
+ for a%b != 0 {
+ a, b = b, a%b
+ }
+ return b
+}
+```
+
+
+----------------------------------------------
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/2100~2199/2182.Construct-String-With-Repeat-Limit/">⬅️上一页</a></p>
+
diff --git a/website/content/ChapterFour/2100~2199/_index.md b/website/content/ChapterFour/2100~2199/_index.md
new file mode 100644
index 000000000..e954f0877
--- /dev/null
+++ b/website/content/ChapterFour/2100~2199/_index.md
@@ -0,0 +1,4 @@
+---
+bookCollapseSection: true
+weight: 20
+---
diff --git a/website/content/ChapterFour/2200~2299/_index.md b/website/content/ChapterFour/2200~2299/_index.md
new file mode 100644
index 000000000..e954f0877
--- /dev/null
+++ b/website/content/ChapterFour/2200~2299/_index.md
@@ -0,0 +1,4 @@
+---
+bookCollapseSection: true
+weight: 20
+---
diff --git a/website/content/ChapterFour/_index.md b/website/content/ChapterFour/_index.md
index 3daf13a7b..b3eaba6b8 100644
--- a/website/content/ChapterFour/_index.md
+++ b/website/content/ChapterFour/_index.md
@@ -1,9 +1,10 @@
---
-title: 第四章
+title: 第四章 LeetCode 题解
type: docs
+weight: 4
---
-# 第四章 Leetcode 题解
+# 第四章 LeetCode 题解
<p align='center'>
<img src='https://img.halfrost.com/Leetcode/GOPHERCON_.png'>
@@ -14,4 +15,11 @@ type: docs
题解慢慢更新中，欢迎大家提出更好的解法。点击页面下方的 edit，会跳转到 github 对应的页面 markdown 中，可以提交你的最优解 PR。
-让我们在题解的太空遨游吧~
\ No newline at end of file
+让我们在题解的太空遨游吧~
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterThree/LFUCache/">⬅️上一章</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0001~0099/0001.Two-Sum/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterOne/Algorithm.md b/website/content/ChapterOne/Algorithm.md
index bd0947838..45b4f74ff 100644
--- a/website/content/ChapterOne/Algorithm.md
+++ b/website/content/ChapterOne/Algorithm.md
@@ -1,6 +1,7 @@
---
-title: 算法知识
+title: 1.2 算法知识
type: docs
+weight: 2
---
# 算法知识
@@ -22,5 +23,12 @@ type: docs
|数论||1. 最大公约数<br> 2. 最小公倍数<br>3. 分解质因数<br>4. 素数判定<br>5. 进制转换<br>6. 高精度计算<br>7. 整除问题<br>8. 同余问题<br>9. 欧拉函数<br>10. 扩展欧几里得<br>11. 置换群<br>12. 母函数<br>13. 离散变换<br>14. 康托展开<br>15. 矩阵<br>16. 向量<br>17. 线性方程组<br>18. 线性规划<br> ||
|几何||1. 凸包 - Gift wrapping<br>2. 凸包 - Graham scan<br>3. 线段问题<br> 4. 多边形和多面体相关问题<br>||
|NP 完全|1. 计算模型<br>2. P 类与 NP 类问题<br>3. NP 完全问题<br>4. NP 完全问题的近似算法<br>|1. 随机存取机 RAM<br>2. 随机存取存储程序机 RASP<br>3. 图灵机<br>4. 非确定性图灵机<br>5. P 类与 NP 类语言<br>6. 多项式时间验证<br>7. 多项式时间变换<br>8. Cook定理<br>9. 合取范式的可满足性问题 CNF-SAT<br>10. 3 元合取范式的可满足性问题 3-SAT<br>11. 团问题 CLIQUE<br>12. 顶点覆盖问题 VERTEX-COVER<br>13. 子集和问题 SUBSET-SUM<br>14. 哈密顿回路问题 HAM-CYCLE<br>15. 旅行售货员问题 TSP<br>16. 顶点覆盖问题的近似算法<br>17. 旅行售货员问题近似算法<br>18. 具有三角不等式性质的旅行售货员问题<br>19. 一般的旅行售货员问题<br>20. 集合覆盖问题的近似算法<br>21. 子集和问题的近似算法<br>22. 子集和问题的指数时间算法<br>23. 子集和问题的多项式时间近似格式<br>||
-|位运算| 位操作包括：<br> 1. 取反（NOT）<br> 2. 按位或（OR） <br> 3. 按位异或（XOR） <br> 4. 按位与（AND） <br> 5. 移位: 是一个二元运算符，用来将一个二进制数中的每一位全部都向一个方向移动指定位，溢出的部分将被舍弃，而空缺的部分填入一定的值。<br> | 1.数字范围按位与<br> 2.UTF-8 编码验证<br> 3.数字转换为十六进制数<br> 4.找出最长的超赞子字符串<br> 5.数组异或操作<br> 6.幂集<br> 7.位1的个数<br> 8.二进制表示中质数个计算置位<br> 9.子数组异或查询<br>| [力扣：位运算](https://leetcode-cn.com/tag/bit-manipulation/)
-|------------|------------------------------------------------------------------|-----------------------------------------------------------------|--------------------|
\ No newline at end of file
+|位运算| 位操作包括：<br> 1. 取反（NOT）<br> 2. 按位或（OR） <br> 3. 按位异或（XOR） <br> 4. 按位与（AND） <br> 5. 移位: 是一个二元运算符，用来将一个二进制数中的每一位全部都向一个方向移动指定位，溢出的部分将被舍弃，而空缺的部分填入一定的值。<br> | 1.数字范围按位与<br> 2.UTF-8 编码验证<br> 3.数字转换为十六进制数<br> 4.找出最长的超赞子字符串<br> 5.数组异或操作<br> 6.幂集<br> 7.位1的个数<br> 8.二进制表示中质数个计算置位<br> 9.子数组异或查询<br>| [力扣：位运算](https://leetcode-cn.com/tag/bit-manipulation/)|
+|------------|------------------------------------------------------------------|-----------------------------------------------------------------|--------------------|
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterOne/Data_Structure/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterOne/Time_Complexity/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterOne/Data_Structure.md b/website/content/ChapterOne/Data_Structure.md
index f4aec542e..7ccb955e7 100644
--- a/website/content/ChapterOne/Data_Structure.md
+++ b/website/content/ChapterOne/Data_Structure.md
@@ -1,6 +1,7 @@
---
-title: 数据结构知识
+title: 1.1 数据结构知识
type: docs
+weight: 1
---
# 数据结构知识
@@ -11,14 +12,21 @@ type: docs
| 数据结构 | 变种 | 相关题目 | 讲解文章 |
|:-------:|:-------|:------|:------|
-|顺序线性表：向量||||
-|单链表|1. 双向链表<br>2. 静态链表<br>3. 对称矩阵<br>4. 稀疏矩阵|||
-|哈希表|1. 散列函数<br>2. 解决碰撞/填充因子<br>|||
-|栈和队列|1. 广义栈<br>2. 双端队列<br>|||
-|队列|1. 链表实现<br>2. 循环数组实现<br>3. 双端队列|||
-|字符串|1. KMP算法<br>2. 有限状态自动机<br>3. 模式匹配有限状态自动机<br>4. BM 模式匹配算法<br>5. BM-KMP 算法<br>6. BF 算法|||
-|树|1. 二叉树<br>2. 并查集<br>3. Huffman 树|||
-|数组实现的堆|1. 极大堆和极小堆<br>2. 极大极小堆<br>3. 双端堆<br>4. d 叉堆|||
-|树实现的堆|1. 左堆<br>2. 扁堆<br>3. 二项式堆<br>4. 斐波那契堆<br>5. 配对堆|||
-|查找|1. 哈希表<br>2. 跳跃表<br>3. 排序二叉树<br>4. AVL 树<br>5. B 树 / B+ 树 / B* 树<br>6. AA 树<br>7. 红黑树<br>8. 排序二叉堆<br>9. Splay 树<br>10. 双链树<br>11. Trie 树<br>12. R 树|||
-|--------------------------------------------|--------------------------------------------------------------------------------------------|---------------------------|-----------------------------------|
\ No newline at end of file
+|顺序线性表：向量 <br>Vector||||
+|单链表<br>Singly Linked List|1. 双向链表 Double Linked Lists<br>2. 静态链表 Static List<br>3. 对称矩阵 Symmetric Matrix<br>4. 稀疏矩阵 Sparse Matrix|||
+|哈希表<br>Hash Table|1. 散列函数 Hash Function<br>2. 解决碰撞/填充因子 Collision Resolution<br>|||
+|栈和队列<br>Stack & Queue|1. 广义表 Generalized List/GList<br>2. 双端队列 Deque<br>|||
+|队列<br>Queue|1. 链表实现 Linked List Implementation<br>2. 循环数组实现 ArrayQueue<br>3. 双端队列 Deque<br>4. 优先队列 Priority Queue<br>5. 循环队列 Circular Queue|||
+|字符串<br>String|1. KMP 算法<br>2. 有限状态自动机<br>3. 模式匹配有限状态自动机<br>4. BM 模式匹配算法<br>5. BM-KMP 算法<br>6. BF 算法|||
+|树<br>Tree|1. 二叉树 Binary Tree<br>2. 并查集 Union-Find<br>3. Huffman 树|||
+|数组实现的堆<br>Heap|1. 极大堆和极小堆 Max Heap and Min Heap<br>2. 极大极小堆<br>3. 双端堆 Deap<br>4. d 叉堆|||
+|树实现的堆<br>Heap|1. 左堆 Leftist Tree/Leftist Heap<br>2. 扁堆<br>3. 二项式堆<br>4. 斐波那契堆 Fibonacco Heap<br>5. 配对堆 Pairing Heap|||
+|查找<br>Search|1. 哈希表 Hash<br>2. 跳跃表 Skip List<br>3. 排序二叉树 Binary Sort Tree<br>4. AVL 树<br>5. B 树 / B+ 树 / B* 树<br>6. AA 树<br>7. 红黑树 Red Black Tree<br>8. 排序二叉堆 Binary Heap<br>9. Splay 树<br>10. 双链树 Double Chained Tree<br>11. Trie 树<br>12. R 树|||
+|--------------------------------------------|--------------------------------------------------------------------------------------------|---------------------------|-----------------------------------|
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterOne/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterOne/Algorithm/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterOne/Time_Complexity.md b/website/content/ChapterOne/Time_Complexity.md
new file mode 100644
index 000000000..b68708bb2
--- /dev/null
+++ b/website/content/ChapterOne/Time_Complexity.md
@@ -0,0 +1,139 @@
+---
+title: 1.3 时间复杂度
+type: docs
+weight: 3
+---
+
+# 时间复杂度和空间复杂度
+
+
+## 一. 时间复杂度数据规模
+
+1s 内能解决问题的数据规模：10^6 ~ 10^7
+
+- O(n^2) 算法可以处理 10^4 级别的数据规模(保守估计，处理 1000 级别的问题肯定没问题)
+- O(n) 算法可以处理 10^8 级别的数据规模(保守估计，处理 10^7 级别的问题肯定没问题)
+- O(nlog n) 算法可以处理 10^7 级别的数据规模(保守估计，处理 10^6 级别的问题肯定没问题)
+
+| | 数据规模|时间复杂度 | 算法举例|
+|:------:|:------:|:------:|:------:|
+|1|10|O(n!)|permutation 排列|
+|2|20~30|O(2^n)|combination 组合|
+|3|50|O(n^4)|DFS 搜索、DP 动态规划|
+|4|100|O(n^3)|任意两点最短路径、DP 动态规划|
+|5|1000|O(n^2)|稠密图、DP 动态规划|
+|6|10^6|O(nlog n)|排序，堆，递归与分治|
+|7|10^7|O(n)|DP 动态规划、图遍历、拓扑排序、树遍历|
+|8|10^9|O(sqrt(n))|筛素数、求平方根|
+|9|10^10|O(log n)|二分搜索|
+|10|+∞|O(1)|数学相关算法|
+|------------------------------|------------------------------|------------------------------------------------------------------|------------------------------------------------------------------|
+
+
+一些具有迷惑性的例子：
+
+```c
+void hello (int n){
+ for( int sz = 1 ; sz < n ; sz += sz )
+ for( int i = 1 ; i < n ; i ++ )
+ cout << "Hello" << endl;
+}
+```
+
+上面这段代码的时间复杂度是 O(nlog n) 而不是 O(n^2)
+
+```c
+bool isPrime (int n){
+ if (num <= 1) return false;
+ for( int x = 2 ; x * x <= n ; x ++ )
+ if( n % x == 0 )
+ return false;
+ return true;
+}
+```
+
+上面这段代码的时间复杂度是 O(sqrt(n)) 而不是 O(n)。
+
+再举一个例子，有一个字符串数组，将数组中的每一个字符串按照字母序排序，之后再将整个字符串数组按照字典序排序。两步操作的整体时间复杂度是多少呢？
+
+如果回答是 O(n*nlog n + nlog n) = O(n^2log n)，这个答案是错误的。字符串的长度和数组的长度是没有关系的，所以这两个变量应该单独计算。假设最长的字符串长度为 s，数组中有 n 个字符串。对每个字符串排序的时间复杂度是 O(slog s)，将数组中每个字符串都按照字母序排序的时间复杂度是 O(n * slog s)。
+
+将整个字符串数组按照字典序排序的时间复杂度是 O(s * nlog n)。排序算法中的 O(nlog n) 是比较的次数，由于比较的是整型数字，所以每次比较是 O(1)。但是字符串按照字典序比较，时间复杂度是 O(s)。所以字符串数组按照字典序排序的时间复杂度是 O(s * nlog n)。所以整体复杂度是 O(n * slog s) + O(s * nlog n) = O(n\*slog s + s\*nlogn) = O(n\*s\*(log s + log n)) = O(n\*s\*log(n\*s)）。
+
+## 二. 空间复杂度
+
+递归调用是有空间代价的，递归算法需要保存递归栈信息，所以花费的空间复杂度会比非递归算法要高。
+
+```c
+int sum( int n ){
+ assert( n >= 0 )
+ int ret = 0;
+ for ( int i = 0 ; i <= n ; i ++ )
+ ret += i;
+ return ret;
+}
+```
+
+上面算法的时间复杂度为 O(n)，空间复杂度 O(1)。
+
+```c
+int sum( int n ){
+ assert( n >= 0 )
+ if ( n == 0 )
+ return 0;
+ return n + sum( n - 1 );
+}
+```
+
+上面算法的时间复杂度为 O(n)，空间复杂度 O(n)。
+
+## 三. 递归的时间复杂度
+
+### 1. 只有一次递归调用
+
+如果递归函数中，只进行了一次递归调用，且递归深度为 depth，在每个递归函数中，时间复杂度为 T，那么总体的时间复杂度为 O(T * depth)
+
+举个例子：
+
+```c
+int binarySearch(int arr[], int l, int r, int target){
+ if( l > r )
+ return -1;
+ int mid = l + ( r - l ) / 2; // 防溢出
+ if(arr[mid] == target)
+ return mid;
+ else if (arr[mid] > target)
+ return binarySearch(arr,l,mid-1,target);
+ else
+ return binarySearch(arr,mid+1,r,target);
+}
+
+```
+
+在二分查找的递归实现中，只递归调用了自身。递归深度是 log n ，每次递归里面的复杂度是 O(1) 的，所以二分查找的递归实现的时间复杂度为 O(log n) 的。
+
+
+### 2. 只有多次递归调用
+
+针对多次递归调用的情况，就需要看它的计算调用的次数了。通常可以画一颗递归树来看。举例：
+
+```c
+int f(int n){
+ assert( n >= 0 );
+ if( n == 0 )
+ return 1;
+ return f( n - 1 ) + f ( n - 1 );
+}
+```
+
+上述这次递归调用的次数为 2^0^ + 2^1^ + 2^2^ + …… + 2^n^ = 2^n+1^ - 1 = O(2^n)
+
+
+> 关于更加复杂的递归的复杂度分析，请参考主定理。主定理中针对各种复杂情况都给出了正确的结论。
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterOne/Algorithm/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterTwo/">下一章➡️</a></p>
+</div>
diff --git a/website/content/ChapterOne/_index.md b/website/content/ChapterOne/_index.md
index 1016b57c0..6d535294a 100644
--- a/website/content/ChapterOne/_index.md
+++ b/website/content/ChapterOne/_index.md
@@ -1,6 +1,7 @@
---
-title: 第一章
+title: 第一章 序章
type: docs
+weight: 1
---
# 第一章 序章
@@ -34,7 +35,7 @@ type: docs
## 关于作者
-笔者是一个刚刚入行一年半的 gopher 新人，还请各位大佬多多指点小弟我。大学参加了 3 年 ACM-ICPC，但是由于资质不高，没有拿到一块金牌。所以在算法方面，我对自己的评价算是新手吧。参加 ACM-ICPC 最大的收获是训练了思维能力，这种能力也会运用到生活中。其次是认识了很多国内很聪明的选手，看到了自己和他们的差距。最后，就是那 200 多页，有些自己都没有完全理解的，打印的密密麻麻的[算法模板](https://github.com/halfrost/LeetCode-Go/releases/tag/Special)。知识学会了，终身都是自己的，没有学会，那些知识都是身外之物。
+笔者是一个刚刚入行一年半的 gopher 新人，还请各位大佬多多指点小弟我。大学参加了 3 年 ACM-ICPC，但是由于资质不高，没有拿到一块金牌。所以在算法方面，我对自己的评价算是新手吧。参加 ACM-ICPC 最大的收获是训练了思维能力，这种能力也会运用到生活中。其次是认识了很多国内很聪明的选手，看到了自己和他们的差距。最后，就是那 200 多页，有些自己都没有完全理解的，打印的密密麻麻的[算法模板](https://github.com/halfrost/leetcode-go/releases/tag/Special)。知识学会了，终身都是自己的，没有学会，那些知识都是身外之物。
笔者从 2019 年 3 月 25 号开始刷题，到 2020 年 3 月 25 号，整整一年的时间。原计划是每天一题。实际上每天有时候不止一题，最终完成了 600+：
@@ -48,7 +49,7 @@ type: docs
## 关于书中的代码
-代码都放在 [github repo](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode) 中，按题号可以搜索到题目。
+代码都放在 [github repo](https://github.com/halfrost/leetcode-go/tree/master/leetcode) 中，按题号可以搜索到题目。
本书题目的代码都已经 beats 100% 了。没有 beats 100% 题解就没有放到本书中了。那些题目笔者会继续优化到 100% 再放进来。
有可能读者会问，为何要追求 beats 100%。笔者认为优化到 beats 100% 才算是把这题做出感觉了。有好几道 Hard 题，笔者都用暴力解法 AC 了，然后只 beats 了 5%。这题就如同没做一样。而且面试中如果给了这样的答案，面试官也不会满意，“还有没有更优解？”。如果通过自己的思考能给出更优解，面试官会更满意一些。
@@ -86,4 +87,9 @@ LeetCode 统计代码运行时长会有波动的，相同的代码提交 10 次
本作品采用 [知识署名-非商业性使用-禁止演绎 （BY-NC-ND） 4.0 国际许可协议](https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode.zh-Hans) 进行许可。
-题解里面的所有题目版权均归 [LeetCode](https://leetcode.com/) 和 [力扣中国](https://leetcode-cn.com/) 所有
\ No newline at end of file
+题解里面的所有题目版权均归 [LeetCode](https://leetcode.com/) 和 [力扣中国](https://leetcode-cn.com/) 所有
+
+
+----------------------------------------------
+<p align = "right"><a href="https://books.halfrost.com/leetcode/ChapterOne/Data_Structure/">下一页➡️</a></p>
+
diff --git a/website/content/ChapterThree/Binary_Indexed_Tree.md b/website/content/ChapterThree/Binary_Indexed_Tree.md
new file mode 100644
index 000000000..1d58fdeed
--- /dev/null
+++ b/website/content/ChapterThree/Binary_Indexed_Tree.md
@@ -0,0 +1,637 @@
+---
+title: 3.5 Binary Indexed Tree
+type: docs
+weight: 5
+---
+
+# 树状数组 Binary Indexed Tree (二叉索引树)
+
+树状数组或二叉索引树（Binary Indexed Tree），又以其发明者命名为 Fenwick 树，最早由 Peter M. Fenwick 于 1994 年以 A New Data Structure for Cumulative Frequency Tables 为题发表在 SOFTWARE PRACTICE AND EXPERIENCE 上。其初衷是解决数据压缩里的累积频率（Cumulative Frequency）的计算问题，现多用于高效计算数列的前缀和，区间和。针对区间问题，除了常见的线段树解法，还可以考虑树状数组。它可以以 O(log n) 的时间得到任意前缀和{{< katex >}} \sum_{i=1}^{j}A[i],1<=j<=N {{< /katex >}}，并同时支持在 O(log n)时间内支持动态单点值的修改(增加或者减少)。空间复杂度 O(n)。
+
+> 利用数组实现前缀和，查询本来是 O(1)，但是对于频繁更新的数组，每次重新计算前缀和，时间复杂度 O(n)。此时树状数组的优势便立即显现。
+
+## 一. 一维树状数组概念
+
+
+
+
+树状数组名字虽然又有树，又有数组，但是它实际上物理形式还是数组，不过每个节点的含义是树的关系，如上图。树状数组中父子节点下标关系是 {{< katex >}}parent = son + 2^{k}{{< /katex >}}，其中 k 是子节点下标对应二进制末尾 0 的个数。
+
+例如上图中 A 和 B 都是数组。A 数组正常存储数据，B 数组是树状数组。B4，B6，B7 是 B8 的子节点。4 的二进制是 100，4 + {{< katex >}}2^{2}{{< /katex >}} = 8，所以 8 是 4 的父节点。同理，7 的二进制 111，7 + {{< katex >}}2^{0}{{< /katex >}} = 8，8 也是 7 的父节点。
+
+
+### 1. 节点意义
+
+在树状数组中，所有的奇数下标的节点的含义是叶子节点，表示单点，它存的值是原数组相同下标存的值。例如上图中 B1，B3，B5，B7 分别存的值是 A1，A3，A5，A7。所有的偶数下标的节点均是父节点。父节点内存的是区间和。例如 B4 内存的是 B1 + B2 + B3 + A4 = A1 + A2 + A3 + A4。这个区间的左边界是该父节点最左边叶子节点对应的下标，右边界就是自己的下标。例如 B8 表示的区间左边界是 B1，右边界是 B8，所以它表示的区间和是 A1 + A2 + …… + A8。
+
+{{< katex display >}}
+\begin{aligned}
+B_{1} &= A_{1} \\
+B_{2} &= B_{1} + A_{2} = A_{1} + A_{2} \\
+B_{3} &= A_{3} \\
+B_{4} &= B_{2} + B_{3} + A_{4} = A_{1} + A_{2} + A_{3} + A_{4} \\
+B_{5} &= A_{5} \\
+B_{6} &= B_{5} + A_{6} = A_{5} + A_{6} \\
+B_{7} &= A_{7} \\
+B_{8} &= B_{4} + B_{6} + B_{7} + A_{8} = A_{1} + A_{2} + A_{3} + A_{4} + A_{5} + A_{6} + A_{7} + A_{8} \\
+\end{aligned}
+{{< /katex >}}
+
+
+由数学归纳法可以得出，左边界的下标一定是 {{< katex >}}i - 2^{k} + 1{{< /katex >}}，其中 i 为父节点的下标，k 为 i 的二进制中末尾 0 的个数。用数学方式表达偶数节点的区间和：
+
+{{< katex display >}}
+B_{i} = \sum_{j = i - 2^{k} + 1}^{i} A_{j}
+{{< /katex >}}
+
+初始化树状数组的代码如下：
+
+```go
+// BinaryIndexedTree define
+type BinaryIndexedTree struct {
+ tree []int
+ capacity int
+}
+
+// Init define
+func (bit *BinaryIndexedTree) Init(nums []int) {
+ bit.tree, bit.capacity = make([]int, len(nums)+1), len(nums)+1
+ for i := 1; i <= len(nums); i++ {
+ bit.tree[i] += nums[i-1]
+ for j := i - 2; j >= i-lowbit(i); j-- {
+ bit.tree[i] += nums[j]
+ }
+ }
+}
+```
+
+lowbit(i) 函数返回 i 转换成二进制以后，末尾最后一个 1 代表的数值，即 {{< katex >}}2^{k}{{< /katex >}}，k 为 i 末尾 0 的个数。我们都知道，在计算机系统中，数值一律用补码来表示和存储。原因在于，使用补码，可以将符号位和数值域统一处理；同时，加法和减法也可以统一处理。利用补码，可以 O(1) 算出 lowbit(i)。负数的补码等于正数的原码每位取反再 + 1，加一会使得负数的补码末尾的 0 和正数原码末尾的 0 一样。这两个数进行 & 运算以后，结果即为 lowbit(i)：
+
+```go
+func lowbit(x int) int {
+ return x & -x
+}
+```
+
+如果还想不通的读者，可以看这个例子，34 的二进制是 {{< katex >}}(0010 0010)_{2} {{< /katex >}}，它的补码是 {{< katex >}}(1101 1110)_{2} {{< /katex >}}。
+
+{{< katex display >}}
+(0010 0010)_{2} \& (1101 1110)_{2} = (0000 0010)_{2}
+{{< /katex >}}
+
+lowbit(34) 结果是 {{< katex >}}2^{k} = 2^{1} = 2 {{< /katex >}}
+
+### 2. 插入操作
+
+树状数组上的父子的下标满足 {{< katex >}}parent = son + 2^{k}{{< /katex >}} 关系，所以可以通过这个公式从叶子结点不断往上递归，直到访问到最大节点值为止，祖先结点最多为 logn 个。插入操作可以实现节点值的增加或者减少，代码实现如下：
+
+```go
+// Add define
+func (bit *BinaryIndexedTree) Add(index int, val int) {
+ for index <= bit.capacity {
+ bit.tree[index] += val
+ index += lowbit(index)
+ }
+}
+```
+
+
+
+
+### 3. 查询操作
+
+
+树状数组中查询 [1, i] 区间内的和。按照节点的含义，可以得出下面的关系：
+
+{{< katex display >}}
+\begin{aligned}
+Query(i) &= A_{1} + A_{2} + ...... + A_{i} \\
+&= A_{1} + A_{2} + A_{i-2^{k}} + A_{i-2^{k}+1} + ...... + A_{i} \\
+&= A_{1} + A_{2} + A_{i-2^{k}} + B_{i} \\
+&= Query(i-2^{k}) + B_{i} \\
+&= Query(i-lowbit(i)) + B_{i} \\
+\end{aligned}
+{{< /katex >}}
+
+{{< katex >}}B_{i}{{< /katex >}} 是树状数组存的值。Query 操作实际是一个递归的过程。lowbit(i) 表示 {{< katex >}}2^{k}{{< /katex >}}，其中 k 是 i 的二进制表示中末尾 0 的个数。i - lowbit(i) 将 i 的二进制中末尾的 1 去掉，最多有 {{< katex >}}log(i){{< /katex >}} 个 1，所以查询操作最坏的时间复杂度是 O(log n)。查询操作实现代码如下：
+
+```go
+// Query define
+func (bit *BinaryIndexedTree) Query(index int) int {
+ sum := 0
+ for index >= 1 {
+ sum += bit.tree[index]
+ index -= lowbit(index)
+ }
+ return sum
+}
+```
+
+## 二. 不同场景下树状数组的功能
+
+根据节点维护的数据含义不同，树状数组可以提供不同的功能来满足各种各样的区间场景。下面我们先以上例中讲述的区间和为例，进而引出 RMQ 的使用场景。
+
+### 1. 单点增减 + 区间求和
+
+这种场景是树状数组最经典的场景。单点增减分别调用 add(i,v) 和 add(i,-v)。区间求和，利用前缀和的思想，求 [m,n] 区间和，即 query(n) - query(m-1)。query(n) 代表 [1,n] 区间内的和，query(m-1) 代表 [1,m-1] 区间内的和，两者相减，即 [m,n] 区间内的和。
+
+> LeetCode 对应题目是 [307. Range Sum Query - Mutable](https://books.halfrost.com/leetcode/ChapterFour/0300~0399/0307.Range-Sum-Query-Mutable/)、[327. Count of Range Sum](https://books.halfrost.com/leetcode/ChapterFour/0300~0399/0327.Count-of-Range-Sum/)
+
+### 2. 区间增减 + 单点查询
+
+这种情况需要做一下转化。定义差分数组 {{< katex >}}C_{i}{{< /katex >}} 代表 {{< katex >}}C_{i} = A_{i} - A_{i-1}{{< /katex >}}。那么：
+
+{{< katex display >}}
+\begin{aligned}
+C_{0} &= A_{0} \\
+C_{1} &= A_{1} - A_{0}\\
+C_{2} &= A_{2} - A_{1}\\
+......\\
+C_{n} &= A_{n} - A_{n-1}\\
+\sum_{j=1}^{n}C_{j} &= A_{n}\\
+\end{aligned}
+{{< /katex >}}
+
+区间增减：在 [m,n] 区间内每一个数都增加 v，只影响 2 个单点的值：
+
+{{< katex display >}}
+\begin{aligned}
+C_{m} &= (A_{m} + v) - A_{m-1}\\
+C_{m+1} &= (A_{m+1} + v) - (A_{m} + v)\\
+C_{m+2} &= (A_{m+2} + v) - (A_{m+1} + v)\\
+......\\
+C_{n} &= (A_{n} + v) - (A_{n-1} + v)\\
+C_{n+1} &= A_{n+1} - (A_{n} + v)\\
+\end{aligned}
+{{< /katex >}}
+
+
+可以观察看，{{< katex >}}C_{m+1}, C_{m+2}, ......, C_{n}{{< /katex >}} 值都不变，变化的是 {{< katex >}}C_{m}, C_{n+1}{{< /katex >}}。所以在这种情况下，区间增加只需要执行 add(m,v) 和 add(n+1,-v) 即可。
+
+单点查询这时就是求前缀和了，{{< katex >}}A_{n} = \sum_{j=1}^{n}C_{j}{{< /katex >}}，即 query(n)。
+
+### 3. 区间增减 + 区间求和
+
+这种情况是上面一种情况的增强版。区间增减的做法和上面做法一致，构造差分数组。这里主要说明区间查询怎么做。先来看 [1,n] 区间和如何求：
+
+
+
+{{< katex display >}}
+A_{1} + A_{2} + A_{3} + ...... + A_{n}\\
+\begin{aligned}
+ &= (C_{1}) + (C_{1} + C_{2}) + (C_{1} + C_{2} + C_{3}) + ...... + \sum_{1}^{n}C_{n}\\
+&= n * C_{1} + (n-1) * C_{2} + ...... + C_{n}\\
+&= n * (C_{1} + C_{2} + C_{3} + ...... + C_{n}) - (0 * C_{1} + 1 * C_{2} + 2 * C_{3} + ...... + (n - 1) * C_{n})\\
+&= n * \sum_{1}^{n}C_{n} - (D_{1} + D_{2} + D_{3} + ...... + D_{n})\\
+&= n * \sum_{1}^{n}C_{n} - \sum_{1}^{n}D_{n}\\
+\end{aligned}
+{{< /katex >}}
+
+其中 {{< katex >}}D_{n} = (n - 1) * C_{n}{{< /katex >}}
+
+所以求区间和，只需要再构造一个 {{< katex >}}D_{n}{{< /katex >}} 即可。
+
+{{< katex display >}}
+\begin{aligned}
+\sum_{1}^{n}A_{n} &= A_{1} + A_{2} + A_{3} + ...... + A_{n} \\
+&= n * \sum_{1}^{n}C_{n} - \sum_{1}^{n}D_{n}\\
+\end{aligned}
+{{< /katex >}}
+
+以此类推，推到更一般的情况：
+
+{{< katex display >}}
+\begin{aligned}
+\sum_{m}^{n}A_{n} &= A_{m} + A_{m+1} + A_{m+2} + ...... + A_{n} \\
+&= \sum_{1}^{n}A_{n} - \sum_{1}^{m-1}A_{n}\\
+&= (n * \sum_{1}^{n}C_{n} - \sum_{1}^{n}D_{n}) - ((m-1) * \sum_{1}^{m-1}C_{m-1} - \sum_{1}^{m-1}D_{m-1})\\
+\end{aligned}
+{{< /katex >}}
+
+至此区间查询问题得解。
+
+### 4. 单点增减 + 区间最值
+
+线段树最基础的运用是区间求和，但是将 sum 操作换成 max 操作以后，也可以求区间最值，并且时间复杂度完全没有变。那树状数组呢？也可以实现相同的功能么？答案是可以的，不过时间复杂度会下降一点。
+
+线段树求区间和，把每个小区间的和计算好，然后依次 pushUp，往上更新。把 sum 换成 max 操作，含义完全相同：取出小区间的最大值，然后依次 pushUp 得到整个区间的最大值。
+
+树状数组求区间和，是将单点增减的增量影响更新到固定区间 {{< katex >}}[i-2^{k}+1, i]{{< /katex >}}。但是把 sum 换成 max 操作，含义就变了。此时单点的增量和区间 max 值并无直接联系。暴力的方式是将该点与区间内所有值比较大小，取出最大值，时间复杂度 O(n * log n)。仔细观察树状数组的结构，可以发现不必枚举所有区间。例如更新 {{< katex >}}A_{i}{{< /katex >}} 的值，那么受到影响的树状数组下标为 {{< katex >}}i-2^{0}, i-2^{1}, i-2^{2}, i-2^{3}, ......, i-2^{k}{{< /katex >}}，其中 {{< katex >}}2^{k} < lowbit(i) \leqslant 2^{k+1}{{< /katex >}}。需要更新至多 k 个下标，外层循环由 O(n) 降为了 O(log n)。区间内部每次都需要重新比较，需要 O(log n) 的复杂度，总的时间复杂度为 {{< katex >}}(O(log n))^2 {{< /katex >}}。
+
+```go
+func (bit *BinaryIndexedTree) Add(index int, val int) {
+ for index <= bit.capacity {
+ bit.tree[index] = val
+ for i := 1; i < lowbit(index); i = i << 1 {
+ bit.tree[index] = max(bit.tree[index], bit.tree[index-i])
+ }
+ index += lowbit(index)
+ }
+}
+```
+
+上面解决了单点更新的问题，再来看区间最值。线段树划分区间是均分，对半分，而树状数组不是均分。在树状数组中 {{< katex >}}B_{i} {{< /katex >}} 表示的区间是 {{< katex >}}[i-2^{k}+1, i]{{< /katex >}}，据此划分“不规则区间”。对于树状数组求 [m,n] 区间内最值，
+
+- 如果 {{< katex >}} m < n - 2^{k} {{< /katex >}}，那么 {{< katex >}} query(m,n) = max(query(m,n-2^{k}), B_{n}){{< /katex >}}
+- 如果 {{< katex >}} m >= n - 2^{k} {{< /katex >}}，那么 {{< katex >}} query(m,n) = max(query(m,n-1), A_{n}){{< /katex >}}
+
+
+```go
+func (bit *BinaryIndexedTree) Query(m, n int) int {
+ res := 0
+ for n >= m {
+ res = max(nums[n], res)
+ n--
+ for ; n-lowbit(n) >= m; n -= lowbit(n) {
+ res = max(bit.tree[n], res)
+ }
+ }
+ return res
+}
+```
+
+n 最多经过 {{< katex >}}(O(log n))^2 {{< /katex >}} 变化，最终 n < m。时间复杂度为 {{< katex >}}(O(log n))^2 {{< /katex >}}。
+
+针对这类问题放一道经典例题[《HDU 1754 I Hate It》](http://acm.hdu.edu.cn/showproblem.php?pid=1754)：
+
+Problem Description
+很多学校流行一种比较的习惯。老师们很喜欢询问，从某某到某某当中，分数最高的是多少。这让很多学生很反感。不管你喜不喜欢，现在需要你做的是，就是按照老师的要求，写一个程序，模拟老师的询问。当然，老师有时候需要更新某位同学的成绩。
+
+
+Input
+本题目包含多组测试，请处理到文件结束。
+在每个测试的第一行，有两个正整数 N 和 M ( 0<N<=200000,0<M<5000 )，分别代表学生的数目和操作的数目。学生 ID 编号分别从 1 编到 N。第二行包含 N 个整数，代表这 N 个学生的初始成绩，其中第 i 个数代表 ID 为 i 的学生的成绩。接下来有 M 行。每一行有一个字符 C (只取'Q'或'U') ，和两个正整数 A，B。当 C 为 'Q' 的时候，表示这是一条询问操作，它询问 ID 从 A 到 B(包括 A,B)的学生当中，成绩最高的是多少。当 C 为 'U' 的时候，表示这是一条更新操作，要求把 ID 为 A 的学生的成绩更改为 B。
+
+
+Output
+对于每一次询问操作，在一行里面输出最高成绩。
+
+
+ Sample Input
+ 5 6
+ 1 2 3 4 5
+ Q 1 5
+ U 3 6
+ Q 3 4
+ Q 4 5
+ U 2 9
+ Q 1 5
+
+
+ Sample Output
+ 5
+ 6
+ 5
+ 9
+
+读完题可以很快反应是单点增减 + 区间最大值的题。利用上面讲解的思想写出代码：
+
+> 由于 OJ 不支持 Go，所以此处用 C 代码实现。这里还有一个 Hint，对于超大量的输入，scanf() 的性能明显优于 cin。
+
+```c
+#include <iostream>
+#include <stdio.h>
+#include <stdlib.h>
+using namespace std;
+
+const int MAXN = 3e5;
+int a[MAXN], h[MAXN];
+int n, m;
+
+int lowbit(int x)
+{
+ return x & (-x);
+}
+void updata(int x)
+{
+ int lx, i;
+ while (x <= n)
+ {
+ h[x] = a[x];
+ lx = lowbit(x);
+ for (i=1; i<lx; i<<=1)
+ h[x] = max(h[x], h[x-i]);
+ x += lowbit(x);
+ }
+}
+int query(int x, int y)
+{
+ int ans = 0;
+ while (y >= x)
+ {
+ ans = max(a[y], ans);
+ y --;
+ for (; y-lowbit(y) >= x; y -= lowbit(y))
+ ans = max(h[y], ans);
+ }
+ return ans;
+}
+int main()
+{
+ int i, j, x, y, ans;
+ char c;
+ while (scanf("%d%d",&n,&m)!=EOF)
+ {
+ for (i=1; i<=n; i++)
+ h[i] = 0;
+ for (i=1; i<=n; i++)
+ {
+ scanf("%d",&a[i]);
+ updata(i);
+ }
+ for (i=1; i<=m; i++)
+ {
+ scanf("%c",&c);
+ scanf("%c",&c);
+ if (c == 'Q')
+ {
+ scanf("%d%d",&x,&y);
+ ans = query(x, y);
+ printf("%d\n",ans);
+ }
+ else if (c == 'U')
+ {
+ scanf("%d%d",&x,&y);
+ a[x] = y;
+ updata(x);
+ }
+ }
+ }
+ return 0;
+}
+```
+
+上述代码已 AC。感兴趣的读者可以自己做一做这道 ACM 的简单题。
+
+### 5. 区间叠加 + 单点最值
+
+看到这里可能有细心的读者疑惑，这一类题不就是第二类“区间增减 + 单点查询”类似么？可以考虑用第二类题的思路解决这一类题。不过麻烦点在于，区间叠加以后，每个单点的更新不是直接告诉增减变化，而是需要我们自己维护一个最值。例如在 [5,7] 区间当前值是 7，接下来区间 [1,9] 区间内增加了一个 2 的值。正确的做法是把 [1,4] 区间内增加 2，[8,9] 区间增加 2，[5,7] 区间维持不变，因为 7 > 2。这仅仅是 2 个区间叠加的情况，如果区间叠加的越多，需要拆分的区间也越多了。看到这里有些读者可能会考虑线段树的解法了。线段树确实是解决区间叠加问题的利器。笔者这里只讨论树状数组的解法。
+
+
+
+当前 LeetCode 有 1836 题，Binary Indexed Tree tag 下面只有 7 题，[218. The Skyline Problem](https://leetcode.com/problems/the-skyline-problem/) 这一题算是 7 道 BIT 里面最“难”的。这道天际线的题就属于区间叠加 + 单点最值的题。笔者以这道题为例，讲讲此类题的常用解法。
+
+
+
+要求天际线，即找到楼与楼重叠区间外边缘的线，说白了是维护各个区间内的最值。这有 2 个需要解决的问题。
+
+1. 如何维护最值。当一个高楼的右边界消失，剩下的各个小楼间还需要选出最大值作为天际线。剩下重重叠叠的小楼很多，树状数组如何维护区间最值是解决此类题的关键。
+2. 如何维护天际线的转折点。有些楼与楼并非完全重叠，重叠一半的情况导致天际线出现转折点。如上图中标记的红色转折点。树状数组如何维护这些点呢？
+
+
+先解决第一个问题(维护最值)。树状数组只有 2 个操作，一个是 Add() 一个是 Query()。从上面关于这 2 个操作的讲解中可以知道这 2 个操作都不能满足我们的需求。Add() 操作可以改成维护区间内 max() 的操作。但是 max() 容易获得却很难“去除”。如上图 [3,7] 这个区间内的最大值是 15。根据树状数组的定义，[3,12] 这个区间内最值还是 15。观察上图可以看到 [5,12] 区间内最值其实是 12。树状数组如何维护这种最值呢？最大值既然难以“去除”，那么需要考虑如何让最大值“来的晚一点”。解决办法是将 Query() 操作含义从前缀含义改成后缀含义。Query(i) 查询区间是 [1,i]，现在查询区间变成 {{< katex >}}[i,+\infty){{< /katex >}}。例如：[i,j] 区间内最值是 {{< katex >}}max_{i...j}{{< /katex >}}，Query(j+1) 的结果不会包含 {{< katex >}}max_{i...j}{{< /katex >}}，因为它查询的区间是 {{< katex >}}[j+1,+\infty){{< /katex >}}。这样更改以后，可以有效避免前驱高楼对后面楼的累积 max() 最值的影响。
+
+具体做法，将 x 轴上的各个区间排序，按照 x 值大小从小到大排序。从左往右依次遍历各个区间。Add() 操作含义是加入每个区间右边界代表后缀区间的最值。这样不需要考虑“移除”最值的问题了。细心的读者可能又有疑问了：能否从右往左遍历区间，Query() 的含义继续延续前缀区间？这样做是可行的，解决第一个问题(维护最值)是可以的。但是这种处理办法解决第二个问题(维护转折点)会遇到麻烦。
+
+再解决第二个问题(维护转折点)。如果用前缀含义的 Query()，在单点 i 上除了考虑以这个点为结束点的区间，还需要考虑以这个单点 i 为起点的区间。如果是后缀含义的 Query() 就没有这个问题了，{{< katex >}}[i+1,+\infty){{< /katex >}} 这个区间内不用考虑以单点 i 为结束点的区间。此题用树状数组代码实现如下：
+
+
+```go
+const LEFTSIDE = 1
+const RIGHTSIDE = 2
+
+type Point struct {
+ xAxis int
+ side int
+ index int
+}
+
+func getSkyline3(buildings [][]int) [][]int {
+ res := [][]int{}
+ if len(buildings) == 0 {
+ return res
+ }
+ allPoints, bit := make([]Point, 0), BinaryIndexedTree{}
+ // [x-axis (value), [1 (left) | 2 (right)], index (building number)]
+ for i, b := range buildings {
+ allPoints = append(allPoints, Point{xAxis: b[0], side: LEFTSIDE, index: i})
+ allPoints = append(allPoints, Point{xAxis: b[1], side: RIGHTSIDE, index: i})
+ }
+ sort.Slice(allPoints, func(i, j int) bool {
+ if allPoints[i].xAxis == allPoints[j].xAxis {
+ return allPoints[i].side < allPoints[j].side
+ }
+ return allPoints[i].xAxis < allPoints[j].xAxis
+ })
+ bit.Init(len(allPoints))
+ kth := make(map[Point]int)
+ for i := 0; i < len(allPoints); i++ {
+ kth[allPoints[i]] = i
+ }
+ for i := 0; i < len(allPoints); i++ {
+ pt := allPoints[i]
+ if pt.side == LEFTSIDE {
+ bit.Add(kth[Point{xAxis: buildings[pt.index][1], side: RIGHTSIDE, index: pt.index}], buildings[pt.index][2])
+ }
+ currHeight := bit.Query(kth[pt] + 1)
+ if len(res) == 0 || res[len(res)-1][1] != currHeight {
+ if len(res) > 0 && res[len(res)-1][0] == pt.xAxis {
+ res[len(res)-1][1] = currHeight
+ } else {
+ res = append(res, []int{pt.xAxis, currHeight})
+ }
+ }
+ }
+ return res
+}
+
+type BinaryIndexedTree struct {
+ tree []int
+ capacity int
+}
+
+// Init define
+func (bit *BinaryIndexedTree) Init(capacity int) {
+ bit.tree, bit.capacity = make([]int, capacity+1), capacity
+}
+
+// Add define
+func (bit *BinaryIndexedTree) Add(index int, val int) {
+ for ; index > 0; index -= index & -index {
+ bit.tree[index] = max(bit.tree[index], val)
+ }
+}
+
+// Query define
+func (bit *BinaryIndexedTree) Query(index int) int {
+ sum := 0
+ for ; index <= bit.capacity; index += index & -index {
+ sum = max(sum, bit.tree[index])
+ }
+ return sum
+}
+
+```
+
+> 此题还可以用线段树和扫描线解答。扫描线和树状数组解答此题，非常快。线段树稍微慢一些。
+
+
+## 三. 常见应用
+
+这一章节来谈谈树状数组的常见应用。
+
+### 1. 求逆序对
+
+给定 {{< katex >}} n {{< /katex >}} 个数 {{< katex >}} A[n] \in [1,n] {{< /katex >}} 的排列 P，求满足 {{< katex >}}i < j {{< /katex >}} 且 {{< katex >}} A[i] > A[j] {{< /katex >}} 的数对 {{< katex >}} (i,j) {{< /katex >}} 的个数。
+
+
+这个问题就是经典的逆序数问题，如果采用朴素算法，就是枚举 i 和 j，并且判断 A[i] 和 A[j] 的值进行数值统计，如果 A[i] > A[j] 则计数器加一，统计完后计数器的值就是答案。时间复杂度为 {{< katex >}} O(n^{2}) {{< /katex >}}，这个时间复杂度太高，是否存在 {{< katex >}} O(log n) {{< /katex >}} 的解法呢？
+
+> 如果题目换成 {{< katex >}} A[n] \in [1,10^{10}] {{< /katex >}}，解题思路不变，只不过一开始再多加一步，离散化的操作。
+
+假设第一步需要离散化。先把数列中的数按大小顺序转化成 1 到 n 的整数，将重复的数据编相同的号，将空缺的数据编上连续的号。使得原数列映射成为一个 1,2,...,n 的数组 B。注意，数组 B 中存的元素也是乱序的，是根据原数组映射而来的。例如原数组是 int[9,8,5,4,6,2,3,8,7,0]，数组中 8 是重复的，且少了数字 1，将这个数组映射到 [1,9] 区间内，调整后的数组 B 为 int[9,8,5,4,6,2,3,8,7,1]。
+
+再创建一个树状数组，用来记录这样一个数组 C（下标从1算起）的前缀和：若 [1, N] 这个排列中的数 i 当前已经出现，则 C[i] 的值为 1 ，否则为 0。初始时数组 C 的值均为 0。从数组 B 第一个元素开始遍历，对树状数组执行修改数组 C 的第 B[j] 个数值加 1 的操作。再在树状数组中查询有多少个数小于等于当前的数 B[j]（即用树状数组查询数组 C 中的 [1,B[j]] 区间前缀和），当前插入总数 i 减去小于等于 B[j] 元素总数，差值即为大于 B[j] 元素的个数，并加入计数器。
+
+```go
+func reversePairs(nums []int) int {
+ if len(nums) <= 1 {
+ return 0
+ }
+ arr, newPermutation, bit, res := make([]Element, len(nums)), make([]int, len(nums)), template.BinaryIndexedTree{}, 0
+ for i := 0; i < len(nums); i++ {
+ arr[i].data = nums[i]
+ arr[i].pos = i
+ }
+ sort.Slice(arr, func(i, j int) bool {
+ if arr[i].data == arr[j].data {
+ if arr[i].pos < arr[j].pos {
+ return true
+ } else {
+ return false
+ }
+ }
+ return arr[i].data < arr[j].data
+ })
+ id := 1
+ newPermutation[arr[0].pos] = 1
+ for i := 1; i < len(arr); i++ {
+ if arr[i].data == arr[i-1].data {
+ newPermutation[arr[i].pos] = id
+ } else {
+ id++
+ newPermutation[arr[i].pos] = id
+ }
+ }
+ bit.Init(id)
+ for i := 0; i < len(newPermutation); i++ {
+ bit.Add(newPermutation[i], 1)
+ res += (i + 1) - bit.Query(newPermutation[i])
+ }
+ return res
+}
+```
+
+上述代码中的 newPermutation 就是映射调整后的数组 B。遍历数组 B，按顺序把元素插入到树状数组中。例如数组 B 是 int[9,8,5,4,6,2,3,8,7,1]，现在往树状数组中插入 6，代表 6 这个元素出现了。query() 查询 [1,6] 区间内是否有元素出现，区间前缀和代表区间内元素出现次数和。如果有 k 个元素出现，且当前插入了 5 个元素，那么 5-k 的差值即是逆序的元素个数，这些元素一定比 6 大。这种方法是正序构造树状数组。
+
+
+还有一种方法是倒序构造树状数组。例如下面代码：
+
+```go
+ for i := len(s) - 1; i > 0; i-- {
+ bit.Add(newPermutation[i], 1)
+ res += bit.Query(newPermutation[i] - 1)
+ }
+```
+
+由于是倒序插入，每次 Query 之前的元素下标一定比当前 i 要大。下标比 i 大，元素值比 A[i] 小，这样的元素和 i 可以构成逆序对。Query 查找 [1, B[j]] 区间内元素总个数，即为逆序对的总数。
+
+> 注意，计算逆序对的时候不要算重复了。比如，计算当前 j 下标前面比 B[j] 值大的数，又算上 j 下标后面比 B[j] 值小的数。这样计算出现了很多重复。因为 j 下标前面的下标 k，也会寻找 k 下标后面比 B[k] 值小的数，重复计算了。那么统一找比自己下标小，但是值大的元素，那么统一找比自己下标大，但是值小的元素。切勿交叉计算。
+
+
+> LeetCode 对应题目是 [315. Count of Smaller Numbers After Self](https://books.halfrost.com/leetcode/ChapterFour/0300~0399/0315.Count-of-Smaller-Numbers-After-Self/)、[493. Reverse Pairs](https://books.halfrost.com/leetcode/ChapterFour/0400~0499/0493.Reverse-Pairs/)、[1649. Create Sorted Array through Instructions](https://books.halfrost.com/leetcode/ChapterFour/1600~1699/1649.Create-Sorted-Array-through-Instructions/)
+
+
+
+### 2. 求区间逆序对
+
+给定 {{< katex >}} n {{< /katex >}} 个数的序列 {{< katex >}} A[n] \in [1,2^{31}-1] {{< /katex >}}，然后给出 {{< katex >}} n \in [1,10^{5}] {{< /katex >}} 次询问 {{< katex >}} [L,R] {{< /katex >}}，每次询问区间 {{< katex >}} [L,R] {{< /katex >}} 中满足 {{< katex >}} L \leqslant i < j \leqslant R {{< /katex >}} 且 {{< katex >}} A[i] > A[j] {{< /katex >}} 的下标 {{< katex >}} (i,j) {{< /katex >}} 的对数。
+
+这个问题比上一题多了一个区间限制。这个区间的限制影响对逆序对的选择。例如：[1,3,5,2,1,1,8,9,8,6,5,3,7,7,2]，求在 [3,7] 区间内的逆序数。元素 2 在区间内，比元素 2 大的元素只有 2 个。元素 3 和 5 在区间外，所以 3 和 5 不能参与逆序数的统计。比元素 2 小的元素也只有 2 个，黄色标识的 3 个 1 都比 2 小，但是第一个 1 不能算在内，因为它在区间外。
+
+先将所有查询区间按照右端点单调不减排序，如下图所示。
+
+> 这里也可以按照查询区间左端点单调不增排序。如果这样排序，下面构建树状数组需要倒序插入。并且查找的是下标靠后但是元素值小的逆序对。两者方法都可以实现，这里讲解选其中一种。
+
+
+
+总的区间覆盖的范围决定了树状数组待插入数字的范围。如上图，总的区间位于 [1,12]，那么下标为 0，13，14 的元素不需要理会，它们不会被用到，所以也不用插入到树状数组中。
+
+
+求区间逆序对的过程中还需要利用到一个辅助数组 C[k]，这个数组的含义是下标为 k 的元素，在插入到树状数组之前，比 A[k] 值小的元素有几个。举个例子，例如下标为 7 的元素值为 9 。C[7] = 6，因为当前比 9 小的元素是 3，5，2，1，1，8。这个辅助数组 C[k] 的意义是找到下标比它小，且元素值也比它小的元素个数。
+
+由于这里选择区间右区间排序，所以构造树状数组插入是顺序插入。这样区间从左有右的查询可以依次得到结果。如上图中最下一行的图示，假设当前查询到了第 4 个区间。第 4 个区间包含元素值 1,8,9,8,6,5 。当前从左往右插入构造树状数组，已经插入了下标为 [1,10] 区间的元素值，即如图显示插入的数值。现在遍历查询区间内所有元素，Query(A[i] - 1) - C[i] 即为下标 i 在当前查询区间内的逆序对总个数。例如元素 9：
+
+
+{{< katex display >}}
+\begin{aligned}
+Query(A[i] - 1) - C[i] &= Query(A[7] - 1) - C[7] \\
+&= Query(9 - 1) - C[7] = Query(8) - C[7]\\
+&= 9 - 6 = 3\\
+\end{aligned}
+{{< /katex >}}
+
+插入 A[i] 元素构造树状数组在先，Query() 查询针对当前全局情况，即查询下标 [1,10] 区间内所有比元素 9 小的元素总数，不难发现所有元素都比元素 9 小，那么 Query(A[i] - 1) 得到的结果是 9。C[7] 是元素 9 插入到树状数组之前比元素 9 小的元素总数，是 6。两者相减，最终结果是 9 - 6 = 3。看上图也很容易看出来结果是正确的，在区间内比 9 下标值大且元素值比 9 小的只有 3 个，分别对应的下标是 8，9，10，对应的元素值是 8，6，5。
+
+总结：
+
+1. 离散化数组 A[i]
+2. 对所有区间按照右端点单调不减排序
+3. 按照区间排序后的结果，从左往右依次遍历每个区间。依照从左往右的区间覆盖元素范围，从左往右将 A[i] 插入至树状数组中，每个元素插入之前计算辅助数组 C[i]。
+4. 依次遍历每个区间内的所有元素，对每个元素计算 Query(A[i] - 1) - C[i]，累加逆序对的结果即是这个区间所有逆序对的总数。
+
+### 3. 求树上逆序对
+
+给定 {{< katex >}} n \in [0,10^{5}] {{< /katex >}} 个结点的树，求每个结点的子树中结点编号比它小的数的个数。
+
+
+树上逆序对的问题可以通过树的先序遍历可以将树转换成数组，令树上的某个结点 i，先序遍历到的顺序为 pre[i]，i 的子结点个数为 a[i]，则转换成数组后 i 管理的区间为 [pre[i], pre[i] + a[i] - 1]，然后就可以转换成区间逆序对问题进行求解了。
+
+
+## 四. 二维树状数组
+
+树状数组可以扩展到二维、三维或者更高维。二维树状数组可以解决离散平面上的统计问题。
+
+```go
+// BinaryIndexedTree2D define
+type BinaryIndexedTree2D struct {
+ tree [][]int
+ row int
+ col int
+}
+
+// Add define
+func (bit2 *BinaryIndexedTree2D) Add(i, j int, val int) {
+ for i <= bit2.row {
+ k := j
+ for k <= bit2.col {
+ bit2.tree[i][k] += val
+ k += lowbit(k)
+ }
+ i += lowbit(i)
+ }
+}
+
+// Query define
+func (bit2 *BinaryIndexedTree2D) Query(i, j int) int {
+ sum := 0
+ for i >= 1 {
+ k := j
+ for k >= 1 {
+ sum += bit2.tree[i][k]
+ k -= lowbit(k)
+ }
+ i -= lowbit(i)
+ }
+ return sum
+}
+```
+
+如果把一维树状数组维护的是数轴上的统计问题，
+
+
+
+
+那么二维数组维护的是二维坐标系下的统计问题。X 和 Y 分别都满足一维树状数组的性质。
+
+
diff --git a/website/content/ChapterThree/LFUCache.md b/website/content/ChapterThree/LFUCache.md
new file mode 100644
index 000000000..95dfb6a75
--- /dev/null
+++ b/website/content/ChapterThree/LFUCache.md
@@ -0,0 +1,368 @@
+---
+title: 3.4 LFUCache
+type: docs
+weight: 4
+---
+
+# 最不经常最少使用 LFUCache
+
+
+
+LFU 是 Least Frequently Used 的缩写，即最不经常最少使用，也是一种常用的页面置换算法，选择访问计数器最小的页面予以淘汰。如下图，缓存中每个页面带一个访问计数器。
+
+
+
+
+根据 LFU 的策略，每访问一次都要更新访问计数器。当插入 B 的时候，发现缓存中有 B，所以增加访问计数器的计数，并把 B 移动到访问计数器从大到小排序的地方。再插入 D，同理先更新计数器，再移动到它排序以后的位置。当插入 F 的时候，缓存中不存在 F，所以淘汰计数器最小的页面的页面，所以淘汰 A 页面。此时 F 排在最下面，计数为 1。
+
+
+
+这里有一个比 LRU 特别的地方。如果淘汰的页面访问次数有多个相同的访问次数，选择最靠尾部的。如上图中，A、B、C 三者的访问次数相同，都是 1 次。要插入 F，F 不在缓存中，此时要淘汰 A 页面。F 是新插入的页面，访问次数为 1，排在 C 的前面。也就是说相同的访问次数，按照新旧顺序排列，淘汰掉最旧的页面。这一点是和 LRU 最大的不同的地方。
+
+可以发现，**LFU 更新和插入新页面可以发生在链表中任意位置，删除页面都发生在表尾**。
+
+
+## 解法一 Get O(1) / Put O(1)
+
+LFU 同样要求查询尽量高效，O(1) 内查询。依旧选用 map 查询。修改和删除也需要 O(1) 完成，依旧选用双向链表，继续复用 container 包中的 list 数据结构。LFU 需要记录访问次数，所以每个结点除了存储 key，value，需要再多存储 frequency 访问次数。
+
+还有 1 个问题需要考虑，一个是如何按频次排序？相同频次，按照先后顺序排序。如果你开始考虑排序算法的话，思考方向就偏离最佳答案了。排序至少 O(nlogn)。重新回看 LFU 的工作原理，会发现它只关心最小频次。其他频次之间的顺序并不关心。所以不需要排序。用一个 min 变量保存最小频次，淘汰时读取这个最小值能找到要删除的结点。相同频次按照先后顺序排列，这个需求还是用双向链表实现，双向链表插入的顺序体现了结点的先后顺序。相同频次对应一个双向链表，可能有多个相同频次，所以可能有多个双向链表。用一个 map 维护访问频次和双向链表的对应关系。删除最小频次时，通过 min 找到最小频次，然后再这个 map 中找到这个频次对应的双向链表，在双向链表中找到最旧的那个结点删除。这就解决了 LFU 删除操作。
+
+LFU 的更新操作和 LRU 类似，也需要用一个 map 保存 key 和双向链表结点的映射关系。这个双向链表结点中存储的是 key-value-frequency 三个元素的元组。这样通过结点中的 key 和 frequency 可以反过来删除 map 中的 key。
+
+定义 LFUCache 的数据结构如下：
+
+```go
+
+import "container/list"
+
+type LFUCache struct {
+ nodes map[int]*list.Element
+ lists map[int]*list.List
+ capacity int
+ min int
+}
+
+type node struct {
+ key int
+ value int
+ frequency int
+}
+
+func Constructor(capacity int) LFUCache {
+ return LFUCache{nodes: make(map[int]*list.Element),
+ lists: make(map[int]*list.List),
+ capacity: capacity,
+ min: 0,
+ }
+}
+
+```
+
+LFUCache 的 Get 操作涉及更新 frequency 值和 2 个 map。在 nodes map 中通过 key 获取到结点信息。在 lists 删除结点当前 frequency 结点。删完以后 frequency ++。新的 frequency 如果在 lists 中存在，添加到双向链表表首，如果不存在，需要新建一个双向链表并把当前结点加到表首。再更新双向链表结点作为 value 的 map。最后更新 min 值，判断老的 frequency 对应的双向链表中是否已经为空，如果空了，min++。
+
+```go
+func (this *LFUCache) Get(key int) int {
+ value, ok := this.nodes[key]
+ if !ok {
+ return -1
+ }
+ currentNode := value.Value.(*node)
+ this.lists[currentNode.frequency].Remove(value)
+ currentNode.frequency++
+ if _, ok := this.lists[currentNode.frequency]; !ok {
+ this.lists[currentNode.frequency] = list.New()
+ }
+ newList := this.lists[currentNode.frequency]
+ newNode := newList.PushFront(currentNode)
+ this.nodes[key] = newNode
+ if currentNode.frequency-1 == this.min && this.lists[currentNode.frequency-1].Len() == 0 {
+ this.min++
+ }
+ return currentNode.value
+}
+
+```
+
+LFU 的 Put 操作逻辑稍微多一点。先在 nodes map 中查询 key 是否存在，如果存在，获取这个结点，更新它的 value 值，然后手动调用一次 Get 操作，因为下面的更新逻辑和 Get 操作一致。如果 map 中不存在，接下来进行插入或者删除操作。判断 capacity 是否装满，如果装满，执行删除操作。在 min 对应的双向链表中删除表尾的结点，对应的也要删除 nodes map 中的键值。
+
+由于新插入的页面访问次数一定为 1，所以 min 此时置为 1。新建结点，插入到 2 个 map 中。
+
+```go
+
+func (this *LFUCache) Put(key int, value int) {
+ if this.capacity == 0 {
+ return
+ }
+ // 如果存在，更新访问次数
+ if currentValue, ok := this.nodes[key]; ok {
+ currentNode := currentValue.Value.(*node)
+ currentNode.value = value
+ this.Get(key)
+ return
+ }
+ // 如果不存在且缓存满了，需要删除
+ if this.capacity == len(this.nodes) {
+ currentList := this.lists[this.min]
+ backNode := currentList.Back()
+ delete(this.nodes, backNode.Value.(*node).key)
+ currentList.Remove(backNode)
+ }
+ // 新建结点，插入到 2 个 map 中
+ this.min = 1
+ currentNode := &node{
+ key: key,
+ value: value,
+ frequency: 1,
+ }
+ if _, ok := this.lists[1]; !ok {
+ this.lists[1] = list.New()
+ }
+ newList := this.lists[1]
+ newNode := newList.PushFront(currentNode)
+ this.nodes[key] = newNode
+}
+
+```
+
+总结，LFU 是由两个 map 和一个 min 指针组成的数据结构。一个 map 中 key 存的是访问次数，对应的 value 是一个个的双向链表，此处双向链表的作用是在相同频次的情况下，淘汰表尾最旧的那个页面。另一个 map 中 key 对应的 value 是双向链表的结点，结点中比 LRU 多存储了一个访问次数的值，即结点中存储 key-value-frequency 的元组。此处双向链表的作用和 LRU 是类似的，可以根据 map 中的 key 更新双向链表结点中的 value 和 frequency 的值，也可以根据双向链表结点中的 key 和 frequency 反向更新 map 中的对应关系。如下图：
+
+
+
+提交代码以后，成功通过所有测试用例。
+
+
+
+
+
+## 解法二 Get O(capacity) / Put O(capacity)
+
+LFU 的另外一个思路是利用 [Index Priority Queue](https://algs4.cs.princeton.edu/24pq/) 这个数据结构。别被名字吓到，Index Priority Queue = map + Priority Queue，仅此而已。
+
+利用 Priority Queue 维护一个最小堆，堆顶是访问次数最小的元素。map 中的 value 存储的是优先队列中结点。
+
+```go
+import "container/heap"
+
+type LFUCache struct {
+ capacity int
+ pq PriorityQueue
+ hash map[int]*Item
+ counter int
+}
+
+func Constructor(capacity int) LFUCache {
+ lfu := LFUCache{
+ pq: PriorityQueue{},
+ hash: make(map[int]*Item, capacity),
+ capacity: capacity,
+ }
+ return lfu
+}
+
+```
+
+Get 和 Put 操作要尽量的快，有 2 个问题需要解决。当访问次数相同时，如何删除掉最久的元素？当元素的访问次数发生变化时，如何快速调整堆？为了解决这 2 个问题，定义如下的数据结构：
+
+```go
+// An Item is something we manage in a priority queue.
+type Item struct {
+ value int // The value of the item; arbitrary.
+ key int
+ frequency int // The priority of the item in the queue.
+ count int // use for evicting the oldest element
+ // The index is needed by update and is maintained by the heap.Interface methods.
+ index int // The index of the item in the heap.
+}
+
+```
+
+堆中的结点存储这 5 个值。count 值用来决定哪个是最老的元素，类似一个操作时间戳。index 值用来 re-heapify 调整堆的。接下来实现 PriorityQueue 的方法。
+
+```go
+// A PriorityQueue implements heap.Interface and holds Items.
+type PriorityQueue []*Item
+
+func (pq PriorityQueue) Len() int { return len(pq) }
+
+func (pq PriorityQueue) Less(i, j int) bool {
+ // We want Pop to give us the highest, not lowest, priority so we use greater than here.
+ if pq[i].frequency == pq[j].frequency {
+ return pq[i].count < pq[j].count
+ }
+ return pq[i].frequency < pq[j].frequency
+}
+
+func (pq PriorityQueue) Swap(i, j int) {
+ pq[i], pq[j] = pq[j], pq[i]
+ pq[i].index = i
+ pq[j].index = j
+}
+
+func (pq *PriorityQueue) Push(x interface{}) {
+ n := len(*pq)
+ item := x.(*Item)
+ item.index = n
+ *pq = append(*pq, item)
+}
+
+func (pq *PriorityQueue) Pop() interface{} {
+ old := *pq
+ n := len(old)
+ item := old[n-1]
+ old[n-1] = nil // avoid memory leak
+ item.index = -1 // for safety
+ *pq = old[0 : n-1]
+ return item
+}
+
+// update modifies the priority and value of an Item in the queue.
+func (pq *PriorityQueue) update(item *Item, value int, frequency int, count int) {
+ item.value = value
+ item.count = count
+ item.frequency = frequency
+ heap.Fix(pq, item.index)
+}
+```
+
+在 Less() 方法中，frequency 从小到大排序，frequency 相同的，按 count 从小到大排序。按照优先队列建堆规则，可以得到，frequency 最小的在堆顶，相同的 frequency，count 最小的越靠近堆顶。
+
+在 Swap() 方法中，记得要更新 index 值。在 Push() 方法中，插入时队列的长度即是该元素的 index 值，此处也要记得更新 index 值。update() 方法调用 Fix() 函数。Fix() 函数比先 Remove() 再 Push() 一个新的值，花销要小。所以此处调用 Fix() 函数，这个操作的时间复杂度是 O(log n)。
+
+这样就维护了最小 Index Priority Queue。Get 操作非常简单：
+
+```go
+func (this *LFUCache) Get(key int) int {
+ if this.capacity == 0 {
+ return -1
+ }
+ if item, ok := this.hash[key]; ok {
+ this.counter++
+ this.pq.update(item, item.value, item.frequency+1, this.counter)
+ return item.value
+ }
+ return -1
+}
+
+```
+
+在 hashmap 中查询 key，如果存在，counter 时间戳累加，调用 Priority Queue 的 update 方法，调整堆。
+
+```go
+func (this *LFUCache) Put(key int, value int) {
+ if this.capacity == 0 {
+ return
+ }
+ this.counter++
+ // 如果存在，增加 frequency，再调整堆
+ if item, ok := this.hash[key]; ok {
+ this.pq.update(item, value, item.frequency+1, this.counter)
+ return
+ }
+ // 如果不存在且缓存满了，需要删除。在 hashmap 和 pq 中删除。
+ if len(this.pq) == this.capacity {
+ item := heap.Pop(&this.pq).(*Item)
+ delete(this.hash, item.key)
+ }
+ // 新建结点，在 hashmap 和 pq 中添加。
+ item := &Item{
+ value: value,
+ key: key,
+ count: this.counter,
+ }
+ heap.Push(&this.pq, item)
+ this.hash[key] = item
+}
+```
+
+
+用最小堆实现的 LFU，Put 时间复杂度是 O(capacity)，Get 时间复杂度是 O(capacity)，不及 2 个 map 实现的版本。巧的是最小堆的版本居然打败了 100%。
+
+
+
+
+## 模板
+
+
+```go
+import "container/list"
+
+type LFUCache struct {
+ nodes map[int]*list.Element
+ lists map[int]*list.List
+ capacity int
+ min int
+}
+
+type node struct {
+ key int
+ value int
+ frequency int
+}
+
+func Constructor(capacity int) LFUCache {
+ return LFUCache{nodes: make(map[int]*list.Element),
+ lists: make(map[int]*list.List),
+ capacity: capacity,
+ min: 0,
+ }
+}
+
+func (this *LFUCache) Get(key int) int {
+ value, ok := this.nodes[key]
+ if !ok {
+ return -1
+ }
+ currentNode := value.Value.(*node)
+ this.lists[currentNode.frequency].Remove(value)
+ currentNode.frequency++
+ if _, ok := this.lists[currentNode.frequency]; !ok {
+ this.lists[currentNode.frequency] = list.New()
+ }
+ newList := this.lists[currentNode.frequency]
+ newNode := newList.PushBack(currentNode)
+ this.nodes[key] = newNode
+ if currentNode.frequency-1 == this.min && this.lists[currentNode.frequency-1].Len() == 0 {
+ this.min++
+ }
+ return currentNode.value
+}
+
+func (this *LFUCache) Put(key int, value int) {
+ if this.capacity == 0 {
+ return
+ }
+ if currentValue, ok := this.nodes[key]; ok {
+ currentNode := currentValue.Value.(*node)
+ currentNode.value = value
+ this.Get(key)
+ return
+ }
+ if this.capacity == len(this.nodes) {
+ currentList := this.lists[this.min]
+ frontNode := currentList.Front()
+ delete(this.nodes, frontNode.Value.(*node).key)
+ currentList.Remove(frontNode)
+ }
+ this.min = 1
+ currentNode := &node{
+ key: key,
+ value: value,
+ frequency: 1,
+ }
+ if _, ok := this.lists[1]; !ok {
+ this.lists[1] = list.New()
+ }
+ newList := this.lists[1]
+ newNode := newList.PushBack(currentNode)
+ this.nodes[key] = newNode
+}
+
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterThree/LRUCache/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/">下一章➡️</a></p>
+</div>
diff --git a/website/content/ChapterThree/LRUCache.md b/website/content/ChapterThree/LRUCache.md
new file mode 100644
index 000000000..272748971
--- /dev/null
+++ b/website/content/ChapterThree/LRUCache.md
@@ -0,0 +1,280 @@
+---
+title: 3.3 LRUCache
+type: docs
+weight: 3
+---
+
+# 最近最少使用 LRUCache
+
+
+
+LRU 是 Least Recently Used 的缩写，即最近最少使用，是一种常用的页面置换算法，选择最近最久未使用的页面予以淘汰。如上图，要插入 F 的时候，此时需要淘汰掉原来的一个页面。
+
+
+
+根据 LRU 的策略，每次都淘汰最近最久未使用的页面，所以先淘汰 A 页面。再插入 C 的时候，发现缓存中有 C 页面，这个时候需要把 C 页面放到首位，因为它被使用了。以此类推，插入 G 页面，G 页面是新页面，不在缓存中，所以淘汰掉 B 页面。插入 H 页面，H 页面是新页面，不在缓存中，所以淘汰掉 D 页面。插入 E 的时候，发现缓存中有 E 页面，这个时候需要把 E 页面放到首位。插入 I 页面，I 页面是新页面，不在缓存中，所以淘汰掉 F 页面。
+
+可以发现，**LRU 更新和插入新页面都发生在链表首，删除页面都发生在链表尾**。
+
+## 解法一 Get O(1) / Put O(1)
+
+LRU 要求查询尽量高效，O(1) 内查询。那肯定选用 map 查询。修改，删除也要尽量 O(1) 完成。搜寻常见的数据结构，链表，栈，队列，树，图。树和图排除，栈和队列无法任意查询中间的元素，也排除。所以选用链表来实现。但是如果选用单链表，删除这个结点，需要 O(n) 遍历一遍找到前驱结点。所以选用双向链表，在删除的时候也能 O(1) 完成。
+
+由于 Go 的 container 包中的 list 底层实现是双向链表，所以可以直接复用这个数据结构。定义 LRUCache 的数据结构如下：
+
+```go
+import "container/list"
+
+type LRUCache struct {
+ Cap int
+ Keys map[int]*list.Element
+ List *list.List
+}
+
+type pair struct {
+ K, V int
+}
+
+func Constructor(capacity int) LRUCache {
+ return LRUCache{
+ Cap: capacity,
+ Keys: make(map[int]*list.Element),
+ List: list.New(),
+ }
+}
+
+```
+
+这里需要解释 2 个问题，list 中的值存的是什么？pair 这个结构体有什么用？
+
+```go
+type Element struct {
+ // Next and previous pointers in the doubly-linked list of elements.
+ // To simplify the implementation, internally a list l is implemented
+ // as a ring, such that &l.root is both the next element of the last
+ // list element (l.Back()) and the previous element of the first list
+ // element (l.Front()).
+ next, prev *Element
+
+ // The list to which this element belongs.
+ list *List
+
+ // The value stored with this element.
+ Value interface{}
+}
+```
+
+在 container/list 中，这个双向链表的每个结点的类型是 Element。Element 中存了 4 个值，前驱和后继结点，双向链表的头结点，value 值。这里的 value 是 interface 类型。笔者在这个 value 里面存了 pair 这个结构体。这就解释了 list 里面存的是什么数据。
+
+为什么要存 pair 呢？单单只存 v 不行么，为什么还要存一份 key ？原因是在 LRUCache 执行删除操作的时候，需要维护 2 个数据结构，一个是 map，一个是双向链表。在双向链表中删除淘汰出去的 value，在 map 中删除淘汰出去 value 对应的 key。如果在双向链表的 value 中不存储 key，那么再删除 map 中的 key 的时候有点麻烦。如果硬要实现，需要先获取到双向链表这个结点 Element 的地址。然后遍历 map，在 map 中找到存有这个 Element 元素地址对应的 key，再删除。这样做时间复杂度是 O(n)，做不到 O(1)。所以双向链表中的 Value 需要存储这个 pair。
+
+LRUCache 的 Get 操作很简单，在 map 中直接读取双向链表的结点。如果 map 中存在，将它移动到双向链表的表头，并返回它的 value 值，如果 map 中不存在，返回 -1。
+
+```go
+func (c *LRUCache) Get(key int) int {
+ if el, ok := c.Keys[key]; ok {
+ c.List.MoveToFront(el)
+ return el.Value.(pair).V
+ }
+ return -1
+}
+```
+
+LRUCache 的 Put 操作也不难。先查询 map 中是否存在 key，如果存在，更新它的 value，并且把该结点移到双向链表的表头。如果 map 中不存在，新建这个结点加入到双向链表和 map 中。最后别忘记还需要维护双向链表的 cap，如果超过 cap，需要淘汰最后一个结点，双向链表中删除这个结点，map 中删掉这个结点对应的 key。
+
+```go
+func (c *LRUCache) Put(key int, value int) {
+ if el, ok := c.Keys[key]; ok {
+ el.Value = pair{K: key, V: value}
+ c.List.MoveToFront(el)
+ } else {
+ el := c.List.PushFront(pair{K: key, V: value})
+ c.Keys[key] = el
+ }
+ if c.List.Len() > c.Cap {
+ el := c.List.Back()
+ c.List.Remove(el)
+ delete(c.Keys, el.Value.(pair).K)
+ }
+}
+
+```
+
+总结，LRU 是由一个 map 和一个双向链表组成的数据结构。map 中 key 对应的 value 是双向链表的结点。双向链表中存储 key-value 的 pair。双向链表表首更新缓存，表尾淘汰缓存。如下图：
+
+
+
+提交代码以后，成功通过所有测试用例。
+
+
+
+
+## 解法二 Get O(1) / Put O(1)
+
+数据结构上想不到其他解法了，但从打败的百分比上，看似还有常数的优化空间。笔者反复思考，觉得可能导致运行时间变长的地方是在 interface{} 类型推断，其他地方已无优化的空间。手写一个双向链表提交试试，代码如下：
+
+```go
+
+type LRUCache struct {
+ head, tail *Node
+ keys map[int]*Node
+ capacity int
+}
+
+type Node struct {
+ key, val int
+ prev, next *Node
+}
+
+func ConstructorLRU(capacity int) LRUCache {
+ return LRUCache{keys: make(map[int]*Node), capacity: capacity}
+}
+
+func (this *LRUCache) Get(key int) int {
+ if node, ok := this.keys[key]; ok {
+ this.Remove(node)
+ this.Add(node)
+ return node.val
+ }
+ return -1
+}
+
+func (this *LRUCache) Put(key int, value int) {
+ if node, ok := this.keys[key]; ok {
+ node.val = value
+ this.Remove(node)
+ this.Add(node)
+ return
+ } else {
+ node = &Node{key: key, val: value}
+ this.keys[key] = node
+ this.Add(node)
+ }
+ if len(this.keys) > this.capacity {
+ delete(this.keys, this.tail.key)
+ this.Remove(this.tail)
+ }
+}
+
+func (this *LRUCache) Add(node *Node) {
+ node.prev = nil
+ node.next = this.head
+ if this.head != nil {
+ this.head.prev = node
+ }
+ this.head = node
+ if this.tail == nil {
+ this.tail = node
+ this.tail.next = nil
+ }
+}
+
+func (this *LRUCache) Remove(node *Node) {
+ if node == this.head {
+ this.head = node.next
+ if node.next != nil {
+ node.next.prev = nil
+ }
+ node.next = nil
+ return
+ }
+ if node == this.tail {
+ this.tail = node.prev
+ node.prev.next = nil
+ node.prev = nil
+ return
+ }
+ node.prev.next = node.next
+ node.next.prev = node.prev
+}
+
+```
+
+提交以后还真的 100% 了。
+
+
+
+上述代码实现的 LRU 本质并没有优化，只是换了一个写法，没有用 container 包而已。
+
+
+## 模板
+
+```go
+type LRUCache struct {
+ head, tail *Node
+ Keys map[int]*Node
+ Cap int
+}
+
+type Node struct {
+ Key, Val int
+ Prev, Next *Node
+}
+
+func Constructor(capacity int) LRUCache {
+ return LRUCache{Keys: make(map[int]*Node), Cap: capacity}
+}
+
+func (this *LRUCache) Get(key int) int {
+ if node, ok := this.Keys[key]; ok {
+ this.Remove(node)
+ this.Add(node)
+ return node.Val
+ }
+ return -1
+}
+
+func (this *LRUCache) Put(key int, value int) {
+ if node, ok := this.Keys[key]; ok {
+ node.Val = value
+ this.Remove(node)
+ this.Add(node)
+ return
+ } else {
+ node = &Node{Key: key, Val: value}
+ this.Keys[key] = node
+ this.Add(node)
+ }
+ if len(this.Keys) > this.Cap {
+ delete(this.Keys, this.tail.Key)
+ this.Remove(this.tail)
+ }
+}
+
+func (this *LRUCache) Add(node *Node) {
+ node.Prev = nil
+ node.Next = this.head
+ if this.head != nil {
+ this.head.Prev = node
+ }
+ this.head = node
+ if this.tail == nil {
+ this.tail = node
+ this.tail.Next = nil
+ }
+}
+
+func (this *LRUCache) Remove(node *Node) {
+ if node == this.head {
+ this.head = node.Next
+ node.Next = nil
+ return
+ }
+ if node == this.tail {
+ this.tail = node.Prev
+ node.Prev.Next = nil
+ node.Prev = nil
+ return
+ }
+ node.Prev.Next = node.Next
+ node.Next.Prev = node.Prev
+}
+
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterThree/UnionFind/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterThree/LFUCache/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterThree/Segment_Tree.md b/website/content/ChapterThree/Segment_Tree.md
index 96160509e..162d7e6b6 100644
--- a/website/content/ChapterThree/Segment_Tree.md
+++ b/website/content/ChapterThree/Segment_Tree.md
@@ -1,13 +1,83 @@
---
-title: 线段树
+title: 3.1 Segment Tree
type: docs
+weight: 1
---
# 线段树 Segment Tree
-```go
-package template
+线段树 Segment tree 是一种二叉树形数据结构，1977年由 Jon Louis Bentley 发明，用以存储区间或线段，并且允许快速查询结构内包含某一点的所有区间。
+
+一个包含 {{< katex >}}n {{< /katex >}}个区间的线段树，空间复杂度为 {{< katex >}} O(n) {{< /katex >}}，查询的时间复杂度则为{{< katex >}}O(log n+k) {{< /katex >}}，其中 {{< katex >}} k {{< /katex >}} 是符合条件的区间数量。线段树的数据结构也可推广到高维度。
+
+## 一. 什么是线段树
+
+以一维的线段树为例。
+
+
+
+
+令 S 是一维线段的集合。将这些线段的端点坐标由小到大排序，令其为{{< katex >}}x_{1},x_{2},\cdots ,x_{m} {{< /katex >}}。我们将被这些端点切分的每一个区间称为“单位区间”（每个端点所在的位置会单独成为一个单位区间），从左到右包含：
+
+{{< katex display>}}
+(-\infty ,x_{1}),[x_{1},x_{1}],(x_{1},x_{2}),[x_{2},x_{2}],...,(x_{m-1},x_{m}),[x_{m},x_{m}],(x_{m},+\infty )
+{{< /katex >}}
+
+线段树的结构为一个二叉树，每个节点都代表一个坐标区间，节点 N 所代表的区间记为 Int(N)，则其需符合以下条件：
+
+- 其每一个叶节点，从左到右代表每个单位区间。
+- 其内部节点代表的区间是其两个儿子代表的区间之并集。
+- 每个节点（包含叶子）中有一个存储线段的数据结构。若一个线段 S 的坐标区间包含 Int(N) 但不包含 Int(parent(N))，则节点 N 中会存储线段 S。
+
+
+
+
+
+线段树是二叉树，其中每个节点代表一个区间。通常，一个节点将存储一个或多个合并的区间的数据，以便可以执行查询操作。
+
+
+## 二. 为什么需要这种数据结构
+
+许多问题要求我们基于对可用数据范围或区间的查询来给出结果。这可能是一个繁琐而缓慢的过程，尤其是在查询数量众多且重复的情况下。线段树让我们以对数时间复杂度有效地处理此类查询。
+
+线段树可用于计算几何和[地理信息系统领域](https://en.wikipedia.org/wiki/Geographic_information_systems)。例如，距中心参考点/原点一定距离的空间中可能会有大量点。假设我们要查找距原点一定距离范围内的点。一个普通的查找表将需要对所有可能的点或所有可能的距离进行线性扫描（假设是散列图）。线段树使我们能够以对数时间实现这一需求，而所需空间却少得多。这样的问题称为[平面范围搜索](https://en.wikipedia.org/wiki/Range_searching)。有效地解决此类问题至关重要，尤其是在处理动态数据且瞬息万变的情况下（例如，用于空中交通的雷达系统）。下文会以线段树解决 Range Sum Query problem 为例。
+
+
+
+
+上图即作为范围查询的线段树。
+
+## 三. 构造线段树
+
+
+假设数据存在 size 为 n 的 arr[] 中。
+
+1. 线段树的根通常代表整个数据区间。这里是 arr[0：n-1]。
+2. 树的每个叶子代表一个范围，其中仅包含一个元素。 因此，叶子代表 arr[0]，arr[1] 等等，直到 arr[n-1]。
+3. 树的内部节点将代表其子节点的合并或并集结果。
+4. 每个子节点可代表其父节点所代表范围的大约一半。(二分的思想)
+
+使用大小为 {{< katex >}}\approx 4 \ast n {{< /katex >}} 的数组可以轻松表示 n 个元素范围的线段树。（[Stack Overflow](http://stackoverflow.com/q/28470692/2844164) 对原因进行了很好的讨论。如果你还不确定，请不要担心。本文将在稍后进行讨论。）
+
+下标为 i 的节点有两个节点，下标分别为 {{< katex >}}(2 \ast i + 1) {{< /katex >}}和 {{< katex >}}(2 \ast i + 2){{< /katex >}}。
+
+
+
+线段树看上去很直观并且非常适合递归构造。
+
+我们将使用数组 tree[] 来存储线段树的节点（初始化为全零）。 下标从 0 开始。
+- 树的节点在下标 0 处。因此 tree[0] 是树的根。
+- tree[i] 的孩子存在 tree[2 * i + 1] 和 tree[2 * i + 2] 中。
+- 用额外的 0 或 null 值填充 arr[]，使得 {{< katex >}}n = 2^{k} {{< /katex >}}（其中 n 是 arr[] 的总长度，而 k 是非负整数。）
+- 叶子节点的下标取值范围在 {{< katex >}} \in [2^{k}-1, 2^{k+1}-2]{{< /katex >}}
+
+
+
+构造线段树的代码如下：
+
+
+```go
// SegmentTree define
type SegmentTree struct {
data, tree, lazy []int
@@ -47,7 +117,35 @@ func (st *SegmentTree) leftChild(index int) int {
func (st *SegmentTree) rightChild(index int) int {
return 2*index + 2
}
+```
+
+笔者将线段树合并的操作变成了一个函数。合并操作根据题意变化，常见的有加法，取 max，min 等等。
+
+我们以 arr[] = [18, 17, 13, 19, 15, 11, 20, 12, 33, 25 ] 为例构造线段树：
+
+
+
+线段树构造好以后，数组里面的数据是：
+
+```c
+tree[] = [ 183, 82, 101, 48, 34, 43, 58, 35, 13, 19, 15, 31, 12, 33, 25, 18, 17, 0, 0, 0, 0, 0, 0, 11, 20, 0, 0, 0, 0, 0, 0 ]
+```
+
+线段树用 0 填充到 4*n 个元素。
+
+
+> LeetCode 对应题目是 [218. The Skyline Problem](https://books.halfrost.com/leetcode/ChapterFour/0200~0299/0218.The-Skyline-Problem/)、[303. Range Sum Query - Immutable](https://books.halfrost.com/leetcode/ChapterFour/0300~0399/0303.Range-Sum-Query-Immutable/)、[307. Range Sum Query - Mutable](https://books.halfrost.com/leetcode/ChapterFour/0300~0399/0307.Range-Sum-Query-Mutable/)、[699. Falling Squares](https://books.halfrost.com/leetcode/ChapterFour/0600~0699/0699.Falling-Squares/)
+
+## 四. 线段树的查询
+
+线段树的查询方法有两种，一种是直接查询，另外一种是懒查询。
+### 1. 直接查询
+
+当查询范围与当前节点表示的范围完全匹配时，该方法返回结果。否则，它会更深入地遍历线段树树，以找到与节点的一部分完全匹配的节点。
+
+
+```go
// 查询 [left....right] 区间内的值
// Query define
@@ -72,7 +170,28 @@ func (st *SegmentTree) queryInTree(treeIndex, left, right, queryLeft, queryRight
return st.merge(st.queryInTree(leftTreeIndex, left, midTreeIndex, queryLeft, midTreeIndex),
st.queryInTree(rightTreeIndex, midTreeIndex+1, right, midTreeIndex+1, queryRight))
}
+```
+
+
+
+
+
+在上面的示例中，查询的区间范围为[2，8] 的元素之和。没有任何线段可以完全代表[2，8] 范围。但是可以观察到，可以使用范围 [2，2]，[3，4]，[5，7]，[8，8] 这 4 个区间构成 [8，8]。快速验证 [2,8] 处的输入元素之和为 13 + 19 + 15 + 11 + 20 + 12 + 33 = 123。[2，2]，[3，4]，[5，7] 和 [8，8] 的节点总和是 13 + 34 + 43 + 33 = 123。答案正确。
+
+
+
+### 2. 懒查询
+
+懒查询对应懒更新，两者是配套操作。在区间更新时，并不直接更新区间内所有节点，而是把区间内节点增减变化的值存在 lazy 数组中。等到下次查询的时候再把增减应用到具体的节点上。这样做也是为了分摊时间复杂度，保证查询和更新的时间复杂度在 O(log n) 级别，不会退化成 O(n) 级别。
+
+懒查询节点的步骤：
+
+1. 先判断当前节点是否是懒节点。通过查询 lazy[i] 是否为 0 判断。如果是懒节点，将它的增减变化应用到该节点上。并且更新它的孩子节点。这一步和更新操作的第一步完全一样。
+2. 递归查询子节点，以找到适合的查询节点。
+具体代码如下：
+
+```go
// 查询 [left....right] 区间内的值
// QueryLazy define
@@ -113,7 +232,17 @@ func (st *SegmentTree) queryLazyInTree(treeIndex, left, right, queryLeft, queryR
return st.merge(st.queryLazyInTree(leftTreeIndex, left, midTreeIndex, queryLeft, midTreeIndex),
st.queryLazyInTree(rightTreeIndex, midTreeIndex+1, right, midTreeIndex+1, queryRight))
}
+```
+
+
+## 五. 线段树的更新
+### 1. 单点更新
+
+单点更新类似于 `buildSegTree`。更新树的叶子节点的值，该值与更新后的元素相对应。这些更新的值会通过树的上层节点把影响传播到根。
+
+
+```go
// 更新 index 位置的值
// Update define
@@ -137,6 +266,34 @@ func (st *SegmentTree) updateInTree(treeIndex, left, right, index, val int) {
}
st.tree[treeIndex] = st.merge(st.tree[leftTreeIndex], st.tree[rightTreeIndex])
}
+```
+
+
+
+在此示例中，下标为（在原始输入数据中）1、3 和 6 处的元素分别增加了 +3，-1 和 +2。可以看到更改如何沿树传播，一直到根。
+
+
+### 2. 区间更新
+
+
+线段树仅更新单个元素，非常有效，时间复杂度 O(log n)。 但是，如果我们要更新一系列元素怎么办？按照当前的方法，每个元素都必须独立更新，每个元素都会花费一些时间。分别更新每一个叶子节点意味着要多次处理它们的共同祖先。祖先节点可能被更新多次。如果想要减少这种重复计算，该怎么办？
+
+
+
+
+在上面的示例中，根节点被更新了三次，而编号为 82 的节点被更新了两次。这是因为更新叶子节点对上层父亲节点有影响。最差的情况，查询的区间内不包含频繁更新的元素，于是需要花费很多时间更新不怎么访问的节点。增加额外的 lazy 数组，可以减少不必要的计算，并且能按需处理节点。
+
+使用另一个数组 lazy[]，它的大小与我们的线段树 array tree[] 完全相同，代表一个惰性节点。当访问或查询该节点时，lazy[i] 中保留需要增加或者减少该节点 tree[i] 的数量。 当 lazy[i] 为 0 时，表示 tree[i] 该节点不是惰性的，并且没有缓存的更新。
+
+更新区间内节点的步骤：
+
+1. 先判断当前节点是否是懒节点。通过查询 lazy[i] 是否为 0 判断。如果是懒节点，将它的增减变化应用到该节点上。并且更新它的孩子节点。
+2. 如果当前节点代表的区间位于更新范围内，则将当前更新操作应用于当前节点。
+3. 递归更新子节点。
+
+具体代码如下：
+
+```go
// 更新 [updateLeft....updateRight] 位置的值
// 注意这里的更新值是在原来值的基础上增加或者减少，而不是把这个区间内的值都赋值为 x，区间更新和单点更新不同
@@ -189,6 +346,67 @@ func (st *SegmentTree) updateLazyInTree(treeIndex, left, right, updateLeft, upda
st.tree[treeIndex] = st.merge(st.tree[leftTreeIndex], st.tree[rightTreeIndex])
}
+```
+
+> LeetCode 对应题目是 [218. The Skyline Problem](https://books.halfrost.com/leetcode/ChapterFour/0200~0299/0218.The-Skyline-Problem/)、[699. Falling Squares](https://books.halfrost.com/leetcode/ChapterFour/0600~0699/0699.Falling-Squares/)
+
+## 六. 时间复杂度分析
+
+让我们看一下构建过程。我们访问了线段树的每个叶子（对应于数组 arr[] 中的每个元素）。因此，我们处理大约 2 * n 个节点。这使构建过程时间复杂度为 O(n)。对于每个递归更新的过程都将丢弃区间范围的一半，以到达树中的叶子节点。这类似于二分搜索，只需要对数时间。更新叶子后，将更新树的每个级别上的直接祖先。这花费时间与树的高度成线性关系。
+
+
+
+
+4\*n 个节点可以确保将线段树构建为完整的二叉树，从而树的高度为 log(4\*n + 1) 向上取整。线段树读取和更新的时间复杂度都为 O(log n)。
+
+## 七. 常见题型
+
+
+### 1. Range Sum Queries
+
+
+
+
+Range Sum Queries 是 [Range Queries](https://en.wikipedia.org/wiki/Range_query_(data_structures)) 问题的子集。给定一个数据元素数组或序列，需要处理由元素范围组成的读取和更新查询。线段树 Segment Tree 和树状数组 Binary Indexed Tree (a.k.a. Fenwick Tree)) 都能很快的解决这类问题。
+
+Range Sum Query 问题专门处理查询范围内的元素总和。这个问题存在许多变体，包括[不可变数据](https://leetcode.com/problems/range-sum-query-immutable/)，[可变数据](https://leetcode.com/problems/range-sum-query-mutable/)，[多次更新，单次查询](https://leetcode.com/problems/range-addition/) 和 [多次更新，多次查询](https://leetcode.com/problems/range-sum-query-2d-mutable/)。
+
+
+
+### 2. 单点更新
+- [HDU 1166 敌兵布阵](http://acm.hdu.edu.cn/showproblem.php?pid=1166) update:单点增减 query:区间求和
+- [HDU 1754 I Hate It](http://acm.hdu.edu.cn/showproblem.php?pid=1754) update:单点替换 query:区间最值
+- [HDU 1394 Minimum Inversion Number](http://acm.hdu.edu.cn/showproblem.php?pid=1394) update:单点增减 query:区间求和
+- [HDU 2795 Billboard](http://acm.hdu.edu.cn/showproblem.php?pid=2795) query:区间求最大值的位子(直接把update的操作在query里做了)
+
+### 3. 区间更新
+
+- [HDU 1698 Just a Hook](http://acm.hdu.edu.cn/showproblem.php?pid=1698) update:成段替换 (由于只query一次总区间,所以可以直接输出 1 结点的信息)
+- [POJ 3468 A Simple Problem with Integers](http://poj.org/problem?id=3468) update:成段增减 query:区间求和
+- [POJ 2528 Mayor’s posters](http://poj.org/problem?id=2528) 离散化 + update:成段替换 query:简单hash
+- [POJ 3225 Help with Intervals](http://poj.org/problem?id=3225) update:成段替换,区间异或 query:简单hash
+
+### 4. 区间合并
+
+这类题目会询问区间中满足条件的连续最长区间,所以PushUp的时候需要对左右儿子的区间进行合并
+
+- [POJ 3667 Hotel](http://poj.org/problem?id=3667) update:区间替换 query:询问满足条件的最左端点
+
+### 5. 扫描线
+
+这类题目需要将一些操作排序,然后从左到右用一根扫描线扫过去最典型的就是矩形面积并,周长并等题
+
+- [HDU 1542 Atlantis](http://acm.hdu.edu.cn/showproblem.php?pid=1542) update:区间增减 query:直接取根节点的值
+- [HDU 1828 Picture](http://acm.hdu.edu.cn/showproblem.php?pid=1828) update:区间增减 query:直接取根节点的值
+
+
+### 6. 计数问题
+
+在 LeetCode 中还有一类问题涉及到计数的。[315. Count of Smaller Numbers After Self](https://books.halfrost.com/leetcode/ChapterFour/0300~0399/0315.Count-of-Smaller-Numbers-After-Self/)，[327. Count of Range Sum](https://books.halfrost.com/leetcode/ChapterFour/0300~0399/0327.Count-of-Range-Sum/)，[493. Reverse Pairs](https://books.halfrost.com/leetcode/ChapterFour/0400~0499/0493.Reverse-Pairs/) 这类问题可以用下面的套路解决。线段树的每个节点存的是区间计数。
+
+
+
+```go
// SegmentCountTree define
type SegmentCountTree struct {
data, tree []int
@@ -272,4 +490,13 @@ func (st *SegmentCountTree) updateCountInTree(treeIndex, left, right, val int) {
}
}
-```
\ No newline at end of file
+```
+
+
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterThree/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterThree/UnionFind/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterThree/UnionFind.md b/website/content/ChapterThree/UnionFind.md
index e49101319..c1e2009b0 100644
--- a/website/content/ChapterThree/UnionFind.md
+++ b/website/content/ChapterThree/UnionFind.md
@@ -1,6 +1,7 @@
---
-title: 并查集
+title: 3.2 UnionFind
type: docs
+weight: 2
---
# 并查集 UnionFind
@@ -141,4 +142,11 @@ func max(a int, b int) int {
return b
}
-```
\ No newline at end of file
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterThree/Segment_Tree/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterThree/LRUCache/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterThree/_index.md b/website/content/ChapterThree/_index.md
index 30eec94af..b078b1d66 100644
--- a/website/content/ChapterThree/_index.md
+++ b/website/content/ChapterThree/_index.md
@@ -1,6 +1,7 @@
---
-title: 第三章
+title: 第三章 一些模板
type: docs
+weight: 3
---
# 第三章 一些模板
@@ -10,4 +11,11 @@ type: docs
</p>
-这一章会罗列一些整理好的模板。一起来看看吧。
\ No newline at end of file
+这一章会罗列一些整理好的模板。一起来看看吧。
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterTwo/Binary_Indexed_Tree/">⬅️上一章</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterThree/Segment_Tree/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterTwo/Array.md b/website/content/ChapterTwo/Array.md
index 59dfa8f18..1ef86606b 100644
--- a/website/content/ChapterTwo/Array.md
+++ b/website/content/ChapterTwo/Array.md
@@ -1,62 +1,434 @@
---
-title: Array
+title: 2.01 Array
type: docs
+weight: 1
---
# Array
-| Title | Solution | Difficulty | Time | Space |收藏|
-| ----- | :--------: | :----------: | :----: | :-----: | :-----: |
-|1. Two Sum| [Go]({{< relref "/ChapterFour/0001.Two-Sum.md" >}})| Easy | O(n)| O(n)||
-|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)|❤️|
-|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)||
-|39. Combination Sum | [Go]({{< relref "/ChapterFour/0039.Combination-Sum.md" >}})| Medium | O(n log n)| O(n)||
-|40. Combination Sum II | [Go]({{< relref "/ChapterFour/0040.Combination-Sum-II.md" >}})| Medium | O(n log n)| O(n)||
-|41. First Missing Positive | [Go]({{< relref "/ChapterFour/0041.First-Missing-Positive.md" >}})| Hard | O(n)| O(n)||
-|42. Trapping Rain Water | [Go]({{< relref "/ChapterFour/0042.Trapping-Rain-Water.md" >}})| Hard | O(n)| O(1)|❤️|
-|48. Rotate Image | [Go]({{< relref "/ChapterFour/0048.Rotate-Image.md" >}})| Medium | O(n)| O(1)||
-|53. Maximum Subarray| [Go]({{< relref "/ChapterFour/0053.Maximum-Subarray.md" >}})| Easy | O(n)| O(n)||
-|54. Spiral Matrix| [Go]({{< relref "/ChapterFour/0054.Spiral-Matrix.md" >}})| Medium | O(n)| O(n^2)||
-|56. Merge Intervals | [Go]({{< relref "/ChapterFour/0056.Merge-Intervals.md" >}})| Medium | O(n log n)| O(1)||
-|57. Insert Interval | [Go]({{< relref "/ChapterFour/0057.Insert-Interval.md" >}})| Hard | O(n)| O(1)||
-|59. Spiral Matrix II | [Go]({{< relref "/ChapterFour/0059.Spiral-Matrix-II.md" >}})| Medium | O(n)| O(n^2)||
-|62. Unique Paths | [Go]({{< relref "/ChapterFour/0062.Unique-Paths.md" >}})| Medium | O(n^2)| O(n^2)||
-|63. Unique Paths II | [Go]({{< relref "/ChapterFour/0063.Unique-Paths-II.md" >}})| Medium | O(n^2)| O(n^2)||
-|64. Minimum Path Sum | [Go]({{< relref "/ChapterFour/0064.Minimum-Path-Sum.md" >}})| Medium | O(n^2)| O(n^2)||
-|75. Sort Colors | [Go]({{< relref "/ChapterFour/0075.Sort-Colors.md" >}})| Medium| O(n)| O(1)|❤️|
-|78. Subsets| [Go]({{< relref "/ChapterFour/0078.Subsets.md" >}})| Medium | O(n^2)| O(n)|❤️|
-|79. Word Search | [Go]({{< relref "/ChapterFour/0079.Word-Search.md" >}})| Medium | O(n^2)| O(n^2)|❤️|
-|80. Remove Duplicates from Sorted Array II| [Go]({{< relref "/ChapterFour/0080.Remove-Duplicates-from-Sorted-Array-II.md" >}})| Medium | O(n)| O(1||
-|84. Largest Rectangle in Histogram | [Go]({{< relref "/ChapterFour/0084.Largest-Rectangle-in-Histogram.md" >}})| Medium | O(n)| O(n)|❤️|
-|88. Merge Sorted Array | [Go]({{< relref "/ChapterFour/0088.Merge-Sorted-Array.md" >}})| Easy | O(n)| O(1)|❤️|
-|90. Subsets II | [Go]({{< relref "/ChapterFour/0090.Subsets-II.md" >}})| Medium | O(n^2)| O(n)|❤️|
-|120. Triangle | [Go]({{< relref "/ChapterFour/0120.Triangle.md" >}})| Medium | O(n^2)| O(n)||
-|121. Best Time to Buy and Sell Stock | [Go]({{< relref "/ChapterFour/0121.Best-Time-to-Buy-and-Sell-Stock.md" >}})| Easy | O(n)| O(1)||
-|122. Best Time to Buy and Sell Stock II | [Go]({{< relref "/ChapterFour/0122.Best-Time-to-Buy-and-Sell-Stock-II.md" >}})| Easy | O(n)| O(1)||
-|126. Word Ladder II | [Go]({{< relref "/ChapterFour/0126.Word-Ladder-II.md" >}})| Hard | O(n)| O(n^2)|❤️|
-|152. Maximum Product Subarray | [Go]({{< relref "/ChapterFour/0152.Maximum-Product-Subarray.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)||
-|216. Combination Sum III | [Go]({{< relref "/ChapterFour/0216.Combination-Sum-III.md" >}})| Medium | O(n)| O(1)|❤️|
-|217. Contains Duplicate | [Go]({{< relref "/ChapterFour/0217.Contains-Duplicate.md" >}})| Easy | O(n)| O(n)||
-|219. Contains Duplicate II | [Go]({{< relref "/ChapterFour/0219.Contains-Duplicate-II.md" >}})| Easy | O(n)| O(n)||
-|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)|❤️|
-|532. K-diff Pairs in an Array | [Go]({{< relref "/ChapterFour/0532.K-diff-Pairs-in-an-Array.md" >}})| Easy | O(n)| O(n)||
-|566. Reshape the Matrix | [Go]({{< relref "/ChapterFour/0566.Reshape-the-Matrix.md" >}})| Easy | O(n^2)| O(n^2)||
-|628. Maximum Product of Three Numbers | [Go]({{< relref "/ChapterFour/0628.Maximum-Product-of-Three-Numbers.md" >}})| Easy | 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)||
-|714. Best Time to Buy and Sell Stock with Transaction Fee| [Go]({{< relref "/ChapterFour/0714.Best-Time-to-Buy-and-Sell-Stock-with-Transaction-Fee.md" >}})| Medium | O(n)| O(1)||
-|746. Min Cost Climbing Stairs | [Go]({{< relref "/ChapterFour/0746.Min-Cost-Climbing-Stairs.md" >}})| Easy | O(n)| O(1)||
-|766. Toeplitz Matrix | [Go]({{< relref "/ChapterFour/0766.Toeplitz-Matrix.md" >}})| Easy | O(n)| O(1)||
-|867. Transpose Matrix | [Go]({{< relref "/ChapterFour/0867.Transpose-Matrix.md" >}})| Easy | O(n)| O(1)||
-|891. Sum of Subsequence Widths | [Go]({{< relref "/ChapterFour/0891.Sum-of-Subsequence-Widths.md" >}})| Hard | O(n log n)| O(1)||
-|907. Sum of Subarray Minimums | [Go]({{< relref "/ChapterFour/0907.Sum-of-Subarray-Minimums.md" >}})| Medium | O(n)| O(n)|❤️|
-|922. Sort Array By Parity II | [Go]({{< relref "/ChapterFour/0922.Sort-Array-By-Parity-II.md" >}})| Medium | O(n)| O(1)||
-|969. Pancake Sorting | [Go]({{< relref "/ChapterFour/0969.Pancake-Sorting.md" >}})| Medium | O(n)| O(1)|❤️|
-|977. Squares of a Sorted Array | [Go]({{< relref "/ChapterFour/0977.Squares-of-a-Sorted-Array.md" >}})| Easy | O(n)| O(1)||
-|---------------------------------------|---------------------------------|--------------------------|-----------------------|-----------|--------|
\ No newline at end of file
+| No. | Title | Solution | Difficulty | TimeComplexity | SpaceComplexity |Favorite| Acceptance |
+|:--------:|:------- | :--------: | :----------: | :----: | :-----: | :-----: |:-----: |
+|0001|Two Sum|[Go]({{< relref "/ChapterFour/0001~0099/0001.Two-Sum.md" >}})|Easy| O(n)| O(n)||49.7%|
+|0004|Median of Two Sorted Arrays|[Go]({{< relref "/ChapterFour/0001~0099/0004.Median-of-Two-Sorted-Arrays.md" >}})|Hard||||36.2%|
+|0011|Container With Most Water|[Go]({{< relref "/ChapterFour/0001~0099/0011.Container-With-Most-Water.md" >}})|Medium| O(n)| O(1)||54.0%|
+|0015|3Sum|[Go]({{< relref "/ChapterFour/0001~0099/0015.3Sum.md" >}})|Medium| O(n^2)| O(n)|❤️|32.6%|
+|0016|3Sum Closest|[Go]({{< relref "/ChapterFour/0001~0099/0016.3Sum-Closest.md" >}})|Medium| O(n^2)| O(1)|❤️|45.7%|
+|0018|4Sum|[Go]({{< relref "/ChapterFour/0001~0099/0018.4Sum.md" >}})|Medium| O(n^3)| O(n^2)|❤️|35.9%|
+|0026|Remove Duplicates from Sorted Array|[Go]({{< relref "/ChapterFour/0001~0099/0026.Remove-Duplicates-from-Sorted-Array.md" >}})|Easy| O(n)| O(1)||51.6%|
+|0027|Remove Element|[Go]({{< relref "/ChapterFour/0001~0099/0027.Remove-Element.md" >}})|Easy| O(n)| O(1)||53.0%|
+|0031|Next Permutation|[Go]({{< relref "/ChapterFour/0001~0099/0031.Next-Permutation.md" >}})|Medium||||37.6%|
+|0033|Search in Rotated Sorted Array|[Go]({{< relref "/ChapterFour/0001~0099/0033.Search-in-Rotated-Sorted-Array.md" >}})|Medium||||39.0%|
+|0034|Find First and Last Position of Element in Sorted Array|[Go]({{< relref "/ChapterFour/0001~0099/0034.Find-First-and-Last-Position-of-Element-in-Sorted-Array.md" >}})|Medium||||41.9%|
+|0035|Search Insert Position|[Go]({{< relref "/ChapterFour/0001~0099/0035.Search-Insert-Position.md" >}})|Easy||||43.4%|
+|0036|Valid Sudoku|[Go]({{< relref "/ChapterFour/0001~0099/0036.Valid-Sudoku.md" >}})|Medium||||58.1%|
+|0037|Sudoku Solver|[Go]({{< relref "/ChapterFour/0001~0099/0037.Sudoku-Solver.md" >}})|Hard||||57.7%|
+|0039|Combination Sum|[Go]({{< relref "/ChapterFour/0001~0099/0039.Combination-Sum.md" >}})|Medium| O(n log n)| O(n)||68.6%|
+|0040|Combination Sum II|[Go]({{< relref "/ChapterFour/0001~0099/0040.Combination-Sum-II.md" >}})|Medium| O(n log n)| O(n)||53.4%|
+|0041|First Missing Positive|[Go]({{< relref "/ChapterFour/0001~0099/0041.First-Missing-Positive.md" >}})|Hard| O(n)| O(n)||36.7%|
+|0042|Trapping Rain Water|[Go]({{< relref "/ChapterFour/0001~0099/0042.Trapping-Rain-Water.md" >}})|Hard| O(n)| O(1)|❤️|59.3%|
+|0045|Jump Game II|[Go]({{< relref "/ChapterFour/0001~0099/0045.Jump-Game-II.md" >}})|Medium||||39.8%|
+|0046|Permutations|[Go]({{< relref "/ChapterFour/0001~0099/0046.Permutations.md" >}})|Medium||||75.7%|
+|0047|Permutations II|[Go]({{< relref "/ChapterFour/0001~0099/0047.Permutations-II.md" >}})|Medium||||57.4%|
+|0048|Rotate Image|[Go]({{< relref "/ChapterFour/0001~0099/0048.Rotate-Image.md" >}})|Medium| O(n)| O(1)||71.0%|
+|0049|Group Anagrams|[Go]({{< relref "/ChapterFour/0001~0099/0049.Group-Anagrams.md" >}})|Medium||||66.8%|
+|0051|N-Queens|[Go]({{< relref "/ChapterFour/0001~0099/0051.N-Queens.md" >}})|Hard||||64.2%|
+|0053|Maximum Subarray|[Go]({{< relref "/ChapterFour/0001~0099/0053.Maximum-Subarray.md" >}})|Medium| O(n)| O(n)||50.2%|
+|0054|Spiral Matrix|[Go]({{< relref "/ChapterFour/0001~0099/0054.Spiral-Matrix.md" >}})|Medium| O(n)| O(n^2)||45.0%|
+|0055|Jump Game|[Go]({{< relref "/ChapterFour/0001~0099/0055.Jump-Game.md" >}})|Medium||||38.9%|
+|0056|Merge Intervals|[Go]({{< relref "/ChapterFour/0001~0099/0056.Merge-Intervals.md" >}})|Medium| O(n log n)| O(1)||46.2%|
+|0057|Insert Interval|[Go]({{< relref "/ChapterFour/0001~0099/0057.Insert-Interval.md" >}})|Medium| O(n)| O(1)||39.0%|
+|0059|Spiral Matrix II|[Go]({{< relref "/ChapterFour/0001~0099/0059.Spiral-Matrix-II.md" >}})|Medium| O(n)| O(n^2)||67.4%|
+|0063|Unique Paths II|[Go]({{< relref "/ChapterFour/0001~0099/0063.Unique-Paths-II.md" >}})|Medium| O(n^2)| O(n^2)||39.4%|
+|0064|Minimum Path Sum|[Go]({{< relref "/ChapterFour/0001~0099/0064.Minimum-Path-Sum.md" >}})|Medium| O(n^2)| O(n^2)||62.0%|
+|0066|Plus One|[Go]({{< relref "/ChapterFour/0001~0099/0066.Plus-One.md" >}})|Easy||||43.7%|
+|0073|Set Matrix Zeroes|[Go]({{< relref "/ChapterFour/0001~0099/0073.Set-Matrix-Zeroes.md" >}})|Medium||||51.3%|
+|0074|Search a 2D Matrix|[Go]({{< relref "/ChapterFour/0001~0099/0074.Search-a-2D-Matrix.md" >}})|Medium||||47.7%|
+|0075|Sort Colors|[Go]({{< relref "/ChapterFour/0001~0099/0075.Sort-Colors.md" >}})|Medium| O(n)| O(1)|❤️|58.6%|
+|0078|Subsets|[Go]({{< relref "/ChapterFour/0001~0099/0078.Subsets.md" >}})|Medium| O(n^2)| O(n)|❤️|74.9%|
+|0079|Word Search|[Go]({{< relref "/ChapterFour/0001~0099/0079.Word-Search.md" >}})|Medium| O(n^2)| O(n^2)|❤️|40.2%|
+|0080|Remove Duplicates from Sorted Array II|[Go]({{< relref "/ChapterFour/0001~0099/0080.Remove-Duplicates-from-Sorted-Array-II.md" >}})|Medium| O(n)| O(1||52.3%|
+|0081|Search in Rotated Sorted Array II|[Go]({{< relref "/ChapterFour/0001~0099/0081.Search-in-Rotated-Sorted-Array-II.md" >}})|Medium||||35.7%|
+|0084|Largest Rectangle in Histogram|[Go]({{< relref "/ChapterFour/0001~0099/0084.Largest-Rectangle-in-Histogram.md" >}})|Hard| O(n)| O(n)|❤️|42.6%|
+|0088|Merge Sorted Array|[Go]({{< relref "/ChapterFour/0001~0099/0088.Merge-Sorted-Array.md" >}})|Easy| O(n)| O(1)|❤️|46.6%|
+|0090|Subsets II|[Go]({{< relref "/ChapterFour/0001~0099/0090.Subsets-II.md" >}})|Medium| O(n^2)| O(n)|❤️|55.9%|
+|0105|Construct Binary Tree from Preorder and Inorder Traversal|[Go]({{< relref "/ChapterFour/0100~0199/0105.Construct-Binary-Tree-from-Preorder-and-Inorder-Traversal.md" >}})|Medium||||61.6%|
+|0106|Construct Binary Tree from Inorder and Postorder Traversal|[Go]({{< relref "/ChapterFour/0100~0199/0106.Construct-Binary-Tree-from-Inorder-and-Postorder-Traversal.md" >}})|Medium||||60.0%|
+|0108|Convert Sorted Array to Binary Search Tree|[Go]({{< relref "/ChapterFour/0100~0199/0108.Convert-Sorted-Array-to-Binary-Search-Tree.md" >}})|Easy||||69.9%|
+|0118|Pascal's Triangle|[Go]({{< relref "/ChapterFour/0100~0199/0118.Pascals-Triangle.md" >}})|Easy||||70.8%|
+|0119|Pascal's Triangle II|[Go]({{< relref "/ChapterFour/0100~0199/0119.Pascals-Triangle-II.md" >}})|Easy||||60.8%|
+|0120|Triangle|[Go]({{< relref "/ChapterFour/0100~0199/0120.Triangle.md" >}})|Medium| O(n^2)| O(n)||54.5%|
+|0121|Best Time to Buy and Sell Stock|[Go]({{< relref "/ChapterFour/0100~0199/0121.Best-Time-to-Buy-and-Sell-Stock.md" >}})|Easy| O(n)| O(1)||54.3%|
+|0122|Best Time to Buy and Sell Stock II|[Go]({{< relref "/ChapterFour/0100~0199/0122.Best-Time-to-Buy-and-Sell-Stock-II.md" >}})|Medium| O(n)| O(1)||63.9%|
+|0128|Longest Consecutive Sequence|[Go]({{< relref "/ChapterFour/0100~0199/0128.Longest-Consecutive-Sequence.md" >}})|Medium||||48.5%|
+|0130|Surrounded Regions|[Go]({{< relref "/ChapterFour/0100~0199/0130.Surrounded-Regions.md" >}})|Medium||||36.8%|
+|0135|Candy|[Go]({{< relref "/ChapterFour/0100~0199/0135.Candy.md" >}})|Hard||||41.0%|
+|0136|Single Number|[Go]({{< relref "/ChapterFour/0100~0199/0136.Single-Number.md" >}})|Easy||||70.7%|
+|0137|Single Number II|[Go]({{< relref "/ChapterFour/0100~0199/0137.Single-Number-II.md" >}})|Medium||||58.5%|
+|0150|Evaluate Reverse Polish Notation|[Go]({{< relref "/ChapterFour/0100~0199/0150.Evaluate-Reverse-Polish-Notation.md" >}})|Medium||||45.8%|
+|0152|Maximum Product Subarray|[Go]({{< relref "/ChapterFour/0100~0199/0152.Maximum-Product-Subarray.md" >}})|Medium| O(n)| O(1)||34.9%|
+|0153|Find Minimum in Rotated Sorted Array|[Go]({{< relref "/ChapterFour/0100~0199/0153.Find-Minimum-in-Rotated-Sorted-Array.md" >}})|Medium||||48.9%|
+|0154|Find Minimum in Rotated Sorted Array II|[Go]({{< relref "/ChapterFour/0100~0199/0154.Find-Minimum-in-Rotated-Sorted-Array-II.md" >}})|Hard||||43.5%|
+|0162|Find Peak Element|[Go]({{< relref "/ChapterFour/0100~0199/0162.Find-Peak-Element.md" >}})|Medium||||46.0%|
+|0164|Maximum Gap|[Go]({{< relref "/ChapterFour/0100~0199/0164.Maximum-Gap.md" >}})|Hard||||43.4%|
+|0167|Two Sum II - Input Array Is Sorted|[Go]({{< relref "/ChapterFour/0100~0199/0167.Two-Sum-II-Input-Array-Is-Sorted.md" >}})|Medium| O(n)| O(1)||60.0%|
+|0169|Majority Element|[Go]({{< relref "/ChapterFour/0100~0199/0169.Majority-Element.md" >}})|Easy||||63.9%|
+|0174|Dungeon Game|[Go]({{< relref "/ChapterFour/0100~0199/0174.Dungeon-Game.md" >}})|Hard||||37.5%|
+|0179|Largest Number|[Go]({{< relref "/ChapterFour/0100~0199/0179.Largest-Number.md" >}})|Medium||||34.6%|
+|0189|Rotate Array|[Go]({{< relref "/ChapterFour/0100~0199/0189.Rotate-Array.md" >}})|Medium||||39.4%|
+|0198|House Robber|[Go]({{< relref "/ChapterFour/0100~0199/0198.House-Robber.md" >}})|Medium||||49.4%|
+|0200|Number of Islands|[Go]({{< relref "/ChapterFour/0200~0299/0200.Number-of-Islands.md" >}})|Medium||||57.0%|
+|0204|Count Primes|[Go]({{< relref "/ChapterFour/0200~0299/0204.Count-Primes.md" >}})|Medium||||33.1%|
+|0209|Minimum Size Subarray Sum|[Go]({{< relref "/ChapterFour/0200~0299/0209.Minimum-Size-Subarray-Sum.md" >}})|Medium| O(n)| O(1)||45.0%|
+|0212|Word Search II|[Go]({{< relref "/ChapterFour/0200~0299/0212.Word-Search-II.md" >}})|Hard||||36.4%|
+|0213|House Robber II|[Go]({{< relref "/ChapterFour/0200~0299/0213.House-Robber-II.md" >}})|Medium||||41.0%|
+|0215|Kth Largest Element in an Array|[Go]({{< relref "/ChapterFour/0200~0299/0215.Kth-Largest-Element-in-an-Array.md" >}})|Medium||||66.2%|
+|0216|Combination Sum III|[Go]({{< relref "/ChapterFour/0200~0299/0216.Combination-Sum-III.md" >}})|Medium| O(n)| O(1)|❤️|67.6%|
+|0217|Contains Duplicate|[Go]({{< relref "/ChapterFour/0200~0299/0217.Contains-Duplicate.md" >}})|Easy| O(n)| O(n)||61.4%|
+|0218|The Skyline Problem|[Go]({{< relref "/ChapterFour/0200~0299/0218.The-Skyline-Problem.md" >}})|Hard||||41.9%|
+|0219|Contains Duplicate II|[Go]({{< relref "/ChapterFour/0200~0299/0219.Contains-Duplicate-II.md" >}})|Easy| O(n)| O(n)||42.6%|
+|0220|Contains Duplicate III|[Go]({{< relref "/ChapterFour/0200~0299/0220.Contains-Duplicate-III.md" >}})|Hard||||22.1%|
+|0228|Summary Ranges|[Go]({{< relref "/ChapterFour/0200~0299/0228.Summary-Ranges.md" >}})|Easy||||47.2%|
+|0229|Majority Element II|[Go]({{< relref "/ChapterFour/0200~0299/0229.Majority-Element-II.md" >}})|Medium||||45.1%|
+|0239|Sliding Window Maximum|[Go]({{< relref "/ChapterFour/0200~0299/0239.Sliding-Window-Maximum.md" >}})|Hard||||46.3%|
+|0240|Search a 2D Matrix II|[Go]({{< relref "/ChapterFour/0200~0299/0240.Search-a-2D-Matrix-II.md" >}})|Medium||||51.0%|
+|0260|Single Number III|[Go]({{< relref "/ChapterFour/0200~0299/0260.Single-Number-III.md" >}})|Medium||||67.7%|
+|0268|Missing Number|[Go]({{< relref "/ChapterFour/0200~0299/0268.Missing-Number.md" >}})|Easy||||62.6%|
+|0274|H-Index|[Go]({{< relref "/ChapterFour/0200~0299/0274.H-Index.md" >}})|Medium||||38.3%|
+|0275|H-Index II|[Go]({{< relref "/ChapterFour/0200~0299/0275.H-Index-II.md" >}})|Medium||||37.5%|
+|0283|Move Zeroes|[Go]({{< relref "/ChapterFour/0200~0299/0283.Move-Zeroes.md" >}})|Easy| O(n)| O(1)||61.4%|
+|0284|Peeking Iterator|[Go]({{< relref "/ChapterFour/0200~0299/0284.Peeking-Iterator.md" >}})|Medium||||58.7%|
+|0287|Find the Duplicate Number|[Go]({{< relref "/ChapterFour/0200~0299/0287.Find-the-Duplicate-Number.md" >}})|Medium| O(n)| O(1)|❤️|59.1%|
+|0300|Longest Increasing Subsequence|[Go]({{< relref "/ChapterFour/0300~0399/0300.Longest-Increasing-Subsequence.md" >}})|Medium||||52.2%|
+|0303|Range Sum Query - Immutable|[Go]({{< relref "/ChapterFour/0300~0399/0303.Range-Sum-Query-Immutable.md" >}})|Easy||||59.5%|
+|0304|Range Sum Query 2D - Immutable|[Go]({{< relref "/ChapterFour/0300~0399/0304.Range-Sum-Query-2D-Immutable.md" >}})|Medium||||52.9%|
+|0307|Range Sum Query - Mutable|[Go]({{< relref "/ChapterFour/0300~0399/0307.Range-Sum-Query-Mutable.md" >}})|Medium||||40.7%|
+|0309|Best Time to Buy and Sell Stock with Cooldown|[Go]({{< relref "/ChapterFour/0300~0399/0309.Best-Time-to-Buy-and-Sell-Stock-with-Cooldown.md" >}})|Medium||||56.2%|
+|0315|Count of Smaller Numbers After Self|[Go]({{< relref "/ChapterFour/0300~0399/0315.Count-of-Smaller-Numbers-After-Self.md" >}})|Hard||||42.6%|
+|0318|Maximum Product of Word Lengths|[Go]({{< relref "/ChapterFour/0300~0399/0318.Maximum-Product-of-Word-Lengths.md" >}})|Medium||||59.9%|
+|0322|Coin Change|[Go]({{< relref "/ChapterFour/0300~0399/0322.Coin-Change.md" >}})|Medium||||42.1%|
+|0324|Wiggle Sort II|[Go]({{< relref "/ChapterFour/0300~0399/0324.Wiggle-Sort-II.md" >}})|Medium||||33.3%|
+|0327|Count of Range Sum|[Go]({{< relref "/ChapterFour/0300~0399/0327.Count-of-Range-Sum.md" >}})|Hard||||35.8%|
+|0329|Longest Increasing Path in a Matrix|[Go]({{< relref "/ChapterFour/0300~0399/0329.Longest-Increasing-Path-in-a-Matrix.md" >}})|Hard||||52.4%|
+|0347|Top K Frequent Elements|[Go]({{< relref "/ChapterFour/0300~0399/0347.Top-K-Frequent-Elements.md" >}})|Medium||||64.2%|
+|0349|Intersection of Two Arrays|[Go]({{< relref "/ChapterFour/0300~0399/0349.Intersection-of-Two-Arrays.md" >}})|Easy||||70.9%|
+|0350|Intersection of Two Arrays II|[Go]({{< relref "/ChapterFour/0300~0399/0350.Intersection-of-Two-Arrays-II.md" >}})|Easy||||56.0%|
+|0354|Russian Doll Envelopes|[Go]({{< relref "/ChapterFour/0300~0399/0354.Russian-Doll-Envelopes.md" >}})|Hard||||37.9%|
+|0368|Largest Divisible Subset|[Go]({{< relref "/ChapterFour/0300~0399/0368.Largest-Divisible-Subset.md" >}})|Medium||||41.6%|
+|0373|Find K Pairs with Smallest Sums|[Go]({{< relref "/ChapterFour/0300~0399/0373.Find-K-Pairs-with-Smallest-Sums.md" >}})|Medium||||38.3%|
+|0376|Wiggle Subsequence|[Go]({{< relref "/ChapterFour/0300~0399/0376.Wiggle-Subsequence.md" >}})|Medium||||48.3%|
+|0377|Combination Sum IV|[Go]({{< relref "/ChapterFour/0300~0399/0377.Combination-Sum-IV.md" >}})|Medium||||52.2%|
+|0378|Kth Smallest Element in a Sorted Matrix|[Go]({{< relref "/ChapterFour/0300~0399/0378.Kth-Smallest-Element-in-a-Sorted-Matrix.md" >}})|Medium||||61.8%|
+|0384|Shuffle an Array|[Go]({{< relref "/ChapterFour/0300~0399/0384.Shuffle-an-Array.md" >}})|Medium||||57.8%|
+|0391|Perfect Rectangle|[Go]({{< relref "/ChapterFour/0300~0399/0391.Perfect-Rectangle.md" >}})|Hard||||32.8%|
+|0393|UTF-8 Validation|[Go]({{< relref "/ChapterFour/0300~0399/0393.UTF-8-Validation.md" >}})|Medium||||45.1%|
+|0396|Rotate Function|[Go]({{< relref "/ChapterFour/0300~0399/0396.Rotate-Function.md" >}})|Medium||||41.1%|
+|0399|Evaluate Division|[Go]({{< relref "/ChapterFour/0300~0399/0399.Evaluate-Division.md" >}})|Medium||||59.7%|
+|0410|Split Array Largest Sum|[Go]({{< relref "/ChapterFour/0400~0499/0410.Split-Array-Largest-Sum.md" >}})|Hard||||53.5%|
+|0413|Arithmetic Slices|[Go]({{< relref "/ChapterFour/0400~0499/0413.Arithmetic-Slices.md" >}})|Medium||||65.1%|
+|0414|Third Maximum Number|[Go]({{< relref "/ChapterFour/0400~0499/0414.Third-Maximum-Number.md" >}})|Easy||||33.2%|
+|0416|Partition Equal Subset Sum|[Go]({{< relref "/ChapterFour/0400~0499/0416.Partition-Equal-Subset-Sum.md" >}})|Medium||||46.3%|
+|0417|Pacific Atlantic Water Flow|[Go]({{< relref "/ChapterFour/0400~0499/0417.Pacific-Atlantic-Water-Flow.md" >}})|Medium||||54.4%|
+|0419|Battleships in a Board|[Go]({{< relref "/ChapterFour/0400~0499/0419.Battleships-in-a-Board.md" >}})|Medium||||74.8%|
+|0421|Maximum XOR of Two Numbers in an Array|[Go]({{< relref "/ChapterFour/0400~0499/0421.Maximum-XOR-of-Two-Numbers-in-an-Array.md" >}})|Medium||||54.0%|
+|0435|Non-overlapping Intervals|[Go]({{< relref "/ChapterFour/0400~0499/0435.Non-overlapping-Intervals.md" >}})|Medium||||50.3%|
+|0436|Find Right Interval|[Go]({{< relref "/ChapterFour/0400~0499/0436.Find-Right-Interval.md" >}})|Medium||||50.8%|
+|0447|Number of Boomerangs|[Go]({{< relref "/ChapterFour/0400~0499/0447.Number-of-Boomerangs.md" >}})|Medium||||54.9%|
+|0448|Find All Numbers Disappeared in an Array|[Go]({{< relref "/ChapterFour/0400~0499/0448.Find-All-Numbers-Disappeared-in-an-Array.md" >}})|Easy||||59.9%|
+|0453|Minimum Moves to Equal Array Elements|[Go]({{< relref "/ChapterFour/0400~0499/0453.Minimum-Moves-to-Equal-Array-Elements.md" >}})|Medium||||56.0%|
+|0454|4Sum II|[Go]({{< relref "/ChapterFour/0400~0499/0454.4Sum-II.md" >}})|Medium||||57.2%|
+|0455|Assign Cookies|[Go]({{< relref "/ChapterFour/0400~0499/0455.Assign-Cookies.md" >}})|Easy||||49.9%|
+|0456|132 Pattern|[Go]({{< relref "/ChapterFour/0400~0499/0456.132-Pattern.md" >}})|Medium||||32.4%|
+|0457|Circular Array Loop|[Go]({{< relref "/ChapterFour/0400~0499/0457.Circular-Array-Loop.md" >}})|Medium||||32.6%|
+|0462|Minimum Moves to Equal Array Elements II|[Go]({{< relref "/ChapterFour/0400~0499/0462.Minimum-Moves-to-Equal-Array-Elements-II.md" >}})|Medium||||60.0%|
+|0463|Island Perimeter|[Go]({{< relref "/ChapterFour/0400~0499/0463.Island-Perimeter.md" >}})|Easy||||69.7%|
+|0473|Matchsticks to Square|[Go]({{< relref "/ChapterFour/0400~0499/0473.Matchsticks-to-Square.md" >}})|Medium||||40.2%|
+|0474|Ones and Zeroes|[Go]({{< relref "/ChapterFour/0400~0499/0474.Ones-and-Zeroes.md" >}})|Medium||||46.8%|
+|0475|Heaters|[Go]({{< relref "/ChapterFour/0400~0499/0475.Heaters.md" >}})|Medium||||36.5%|
+|0477|Total Hamming Distance|[Go]({{< relref "/ChapterFour/0400~0499/0477.Total-Hamming-Distance.md" >}})|Medium||||52.2%|
+|0480|Sliding Window Median|[Go]({{< relref "/ChapterFour/0400~0499/0480.Sliding-Window-Median.md" >}})|Hard||||41.1%|
+|0485|Max Consecutive Ones|[Go]({{< relref "/ChapterFour/0400~0499/0485.Max-Consecutive-Ones.md" >}})|Easy||||56.6%|
+|0491|Non-decreasing Subsequences|[Go]({{< relref "/ChapterFour/0400~0499/0491.Non-decreasing-Subsequences.md" >}})|Medium||||60.2%|
+|0493|Reverse Pairs|[Go]({{< relref "/ChapterFour/0400~0499/0493.Reverse-Pairs.md" >}})|Hard||||30.9%|
+|0494|Target Sum|[Go]({{< relref "/ChapterFour/0400~0499/0494.Target-Sum.md" >}})|Medium||||45.7%|
+|0495|Teemo Attacking|[Go]({{< relref "/ChapterFour/0400~0499/0495.Teemo-Attacking.md" >}})|Easy||||56.8%|
+|0496|Next Greater Element I|[Go]({{< relref "/ChapterFour/0400~0499/0496.Next-Greater-Element-I.md" >}})|Easy||||71.4%|
+|0497|Random Point in Non-overlapping Rectangles|[Go]({{< relref "/ChapterFour/0400~0499/0497.Random-Point-in-Non-overlapping-Rectangles.md" >}})|Medium||||39.4%|
+|0498|Diagonal Traverse|[Go]({{< relref "/ChapterFour/0400~0499/0498.Diagonal-Traverse.md" >}})|Medium||||58.3%|
+|0500|Keyboard Row|[Go]({{< relref "/ChapterFour/0500~0599/0500.Keyboard-Row.md" >}})|Easy||||69.6%|
+|0503|Next Greater Element II|[Go]({{< relref "/ChapterFour/0500~0599/0503.Next-Greater-Element-II.md" >}})|Medium||||63.2%|
+|0506|Relative Ranks|[Go]({{< relref "/ChapterFour/0500~0599/0506.Relative-Ranks.md" >}})|Easy||||60.6%|
+|0518|Coin Change II|[Go]({{< relref "/ChapterFour/0500~0599/0518.Coin-Change-II.md" >}})|Medium||||60.6%|
+|0523|Continuous Subarray Sum|[Go]({{< relref "/ChapterFour/0500~0599/0523.Continuous-Subarray-Sum.md" >}})|Medium||||28.5%|
+|0524|Longest Word in Dictionary through Deleting|[Go]({{< relref "/ChapterFour/0500~0599/0524.Longest-Word-in-Dictionary-through-Deleting.md" >}})|Medium||||51.0%|
+|0525|Contiguous Array|[Go]({{< relref "/ChapterFour/0500~0599/0525.Contiguous-Array.md" >}})|Medium||||46.8%|
+|0526|Beautiful Arrangement|[Go]({{< relref "/ChapterFour/0500~0599/0526.Beautiful-Arrangement.md" >}})|Medium||||64.4%|
+|0528|Random Pick with Weight|[Go]({{< relref "/ChapterFour/0500~0599/0528.Random-Pick-with-Weight.md" >}})|Medium||||46.1%|
+|0529|Minesweeper|[Go]({{< relref "/ChapterFour/0500~0599/0529.Minesweeper.md" >}})|Medium||||65.7%|
+|0532|K-diff Pairs in an Array|[Go]({{< relref "/ChapterFour/0500~0599/0532.K-diff-Pairs-in-an-Array.md" >}})|Medium| O(n)| O(n)||41.2%|
+|0540|Single Element in a Sorted Array|[Go]({{< relref "/ChapterFour/0500~0599/0540.Single-Element-in-a-Sorted-Array.md" >}})|Medium||||59.1%|
+|0542|01 Matrix|[Go]({{< relref "/ChapterFour/0500~0599/0542.01-Matrix.md" >}})|Medium||||44.8%|
+|0554|Brick Wall|[Go]({{< relref "/ChapterFour/0500~0599/0554.Brick-Wall.md" >}})|Medium||||53.6%|
+|0560|Subarray Sum Equals K|[Go]({{< relref "/ChapterFour/0500~0599/0560.Subarray-Sum-Equals-K.md" >}})|Medium||||43.7%|
+|0561|Array Partition|[Go]({{< relref "/ChapterFour/0500~0599/0561.Array-Partition.md" >}})|Easy||||77.2%|
+|0566|Reshape the Matrix|[Go]({{< relref "/ChapterFour/0500~0599/0566.Reshape-the-Matrix.md" >}})|Easy| O(n^2)| O(n^2)||62.9%|
+|0575|Distribute Candies|[Go]({{< relref "/ChapterFour/0500~0599/0575.Distribute-Candies.md" >}})|Easy||||66.5%|
+|0581|Shortest Unsorted Continuous Subarray|[Go]({{< relref "/ChapterFour/0500~0599/0581.Shortest-Unsorted-Continuous-Subarray.md" >}})|Medium||||36.4%|
+|0594|Longest Harmonious Subsequence|[Go]({{< relref "/ChapterFour/0500~0599/0594.Longest-Harmonious-Subsequence.md" >}})|Easy||||53.5%|
+|0598|Range Addition II|[Go]({{< relref "/ChapterFour/0500~0599/0598.Range-Addition-II.md" >}})|Easy||||55.3%|
+|0599|Minimum Index Sum of Two Lists|[Go]({{< relref "/ChapterFour/0500~0599/0599.Minimum-Index-Sum-of-Two-Lists.md" >}})|Easy||||53.4%|
+|0605|Can Place Flowers|[Go]({{< relref "/ChapterFour/0600~0699/0605.Can-Place-Flowers.md" >}})|Easy||||32.8%|
+|0609|Find Duplicate File in System|[Go]({{< relref "/ChapterFour/0600~0699/0609.Find-Duplicate-File-in-System.md" >}})|Medium||||67.7%|
+|0611|Valid Triangle Number|[Go]({{< relref "/ChapterFour/0600~0699/0611.Valid-Triangle-Number.md" >}})|Medium||||50.6%|
+|0622|Design Circular Queue|[Go]({{< relref "/ChapterFour/0600~0699/0622.Design-Circular-Queue.md" >}})|Medium||||51.5%|
+|0628|Maximum Product of Three Numbers|[Go]({{< relref "/ChapterFour/0600~0699/0628.Maximum-Product-of-Three-Numbers.md" >}})|Easy| O(n)| O(1)||45.9%|
+|0630|Course Schedule III|[Go]({{< relref "/ChapterFour/0600~0699/0630.Course-Schedule-III.md" >}})|Hard||||40.1%|
+|0632|Smallest Range Covering Elements from K Lists|[Go]({{< relref "/ChapterFour/0600~0699/0632.Smallest-Range-Covering-Elements-from-K-Lists.md" >}})|Hard||||61.0%|
+|0636|Exclusive Time of Functions|[Go]({{< relref "/ChapterFour/0600~0699/0636.Exclusive-Time-of-Functions.md" >}})|Medium||||61.2%|
+|0638|Shopping Offers|[Go]({{< relref "/ChapterFour/0600~0699/0638.Shopping-Offers.md" >}})|Medium||||53.3%|
+|0643|Maximum Average Subarray I|[Go]({{< relref "/ChapterFour/0600~0699/0643.Maximum-Average-Subarray-I.md" >}})|Easy||||43.7%|
+|0645|Set Mismatch|[Go]({{< relref "/ChapterFour/0600~0699/0645.Set-Mismatch.md" >}})|Easy||||42.7%|
+|0648|Replace Words|[Go]({{< relref "/ChapterFour/0600~0699/0648.Replace-Words.md" >}})|Medium||||62.7%|
+|0658|Find K Closest Elements|[Go]({{< relref "/ChapterFour/0600~0699/0658.Find-K-Closest-Elements.md" >}})|Medium||||46.8%|
+|0661|Image Smoother|[Go]({{< relref "/ChapterFour/0600~0699/0661.Image-Smoother.md" >}})|Easy||||55.4%|
+|0665|Non-decreasing Array|[Go]({{< relref "/ChapterFour/0600~0699/0665.Non-decreasing-Array.md" >}})|Medium||||24.3%|
+|0667|Beautiful Arrangement II|[Go]({{< relref "/ChapterFour/0600~0699/0667.Beautiful-Arrangement-II.md" >}})|Medium||||59.8%|
+|0674|Longest Continuous Increasing Subsequence|[Go]({{< relref "/ChapterFour/0600~0699/0674.Longest-Continuous-Increasing-Subsequence.md" >}})|Easy||||49.3%|
+|0682|Baseball Game|[Go]({{< relref "/ChapterFour/0600~0699/0682.Baseball-Game.md" >}})|Easy||||74.3%|
+|0695|Max Area of Island|[Go]({{< relref "/ChapterFour/0600~0699/0695.Max-Area-of-Island.md" >}})|Medium||||71.8%|
+|0697|Degree of an Array|[Go]({{< relref "/ChapterFour/0600~0699/0697.Degree-of-an-Array.md" >}})|Easy||||56.0%|
+|0699|Falling Squares|[Go]({{< relref "/ChapterFour/0600~0699/0699.Falling-Squares.md" >}})|Hard||||44.7%|
+|0704|Binary Search|[Go]({{< relref "/ChapterFour/0700~0799/0704.Binary-Search.md" >}})|Easy||||56.1%|
+|0705|Design HashSet|[Go]({{< relref "/ChapterFour/0700~0799/0705.Design-HashSet.md" >}})|Easy||||65.6%|
+|0706|Design HashMap|[Go]({{< relref "/ChapterFour/0700~0799/0706.Design-HashMap.md" >}})|Easy||||64.7%|
+|0710|Random Pick with Blacklist|[Go]({{< relref "/ChapterFour/0700~0799/0710.Random-Pick-with-Blacklist.md" >}})|Hard||||33.5%|
+|0713|Subarray Product Less Than K|[Go]({{< relref "/ChapterFour/0700~0799/0713.Subarray-Product-Less-Than-K.md" >}})|Medium| O(n)| O(1)||45.8%|
+|0714|Best Time to Buy and Sell Stock with Transaction Fee|[Go]({{< relref "/ChapterFour/0700~0799/0714.Best-Time-to-Buy-and-Sell-Stock-with-Transaction-Fee.md" >}})|Medium| O(n)| O(1)||65.2%|
+|0717|1-bit and 2-bit Characters|[Go]({{< relref "/ChapterFour/0700~0799/0717.1-bit-and-2-bit-Characters.md" >}})|Easy||||45.7%|
+|0718|Maximum Length of Repeated Subarray|[Go]({{< relref "/ChapterFour/0700~0799/0718.Maximum-Length-of-Repeated-Subarray.md" >}})|Medium||||51.3%|
+|0719|Find K-th Smallest Pair Distance|[Go]({{< relref "/ChapterFour/0700~0799/0719.Find-K-th-Smallest-Pair-Distance.md" >}})|Hard||||36.7%|
+|0720|Longest Word in Dictionary|[Go]({{< relref "/ChapterFour/0700~0799/0720.Longest-Word-in-Dictionary.md" >}})|Medium||||52.0%|
+|0721|Accounts Merge|[Go]({{< relref "/ChapterFour/0700~0799/0721.Accounts-Merge.md" >}})|Medium||||56.3%|
+|0724|Find Pivot Index|[Go]({{< relref "/ChapterFour/0700~0799/0724.Find-Pivot-Index.md" >}})|Easy||||54.7%|
+|0733|Flood Fill|[Go]({{< relref "/ChapterFour/0700~0799/0733.Flood-Fill.md" >}})|Easy||||62.0%|
+|0735|Asteroid Collision|[Go]({{< relref "/ChapterFour/0700~0799/0735.Asteroid-Collision.md" >}})|Medium||||44.4%|
+|0739|Daily Temperatures|[Go]({{< relref "/ChapterFour/0700~0799/0739.Daily-Temperatures.md" >}})|Medium||||66.3%|
+|0744|Find Smallest Letter Greater Than Target|[Go]({{< relref "/ChapterFour/0700~0799/0744.Find-Smallest-Letter-Greater-Than-Target.md" >}})|Easy||||45.8%|
+|0746|Min Cost Climbing Stairs|[Go]({{< relref "/ChapterFour/0700~0799/0746.Min-Cost-Climbing-Stairs.md" >}})|Easy| O(n)| O(1)||63.2%|
+|0747|Largest Number At Least Twice of Others|[Go]({{< relref "/ChapterFour/0700~0799/0747.Largest-Number-At-Least-Twice-of-Others.md" >}})|Easy||||47.1%|
+|0748|Shortest Completing Word|[Go]({{< relref "/ChapterFour/0700~0799/0748.Shortest-Completing-Word.md" >}})|Easy||||59.3%|
+|0752|Open the Lock|[Go]({{< relref "/ChapterFour/0700~0799/0752.Open-the-Lock.md" >}})|Medium||||55.6%|
+|0766|Toeplitz Matrix|[Go]({{< relref "/ChapterFour/0700~0799/0766.Toeplitz-Matrix.md" >}})|Easy| O(n)| O(1)||68.6%|
+|0775|Global and Local Inversions|[Go]({{< relref "/ChapterFour/0700~0799/0775.Global-and-Local-Inversions.md" >}})|Medium||||43.3%|
+|0778|Swim in Rising Water|[Go]({{< relref "/ChapterFour/0700~0799/0778.Swim-in-Rising-Water.md" >}})|Hard||||59.8%|
+|0781|Rabbits in Forest|[Go]({{< relref "/ChapterFour/0700~0799/0781.Rabbits-in-Forest.md" >}})|Medium||||54.7%|
+|0786|K-th Smallest Prime Fraction|[Go]({{< relref "/ChapterFour/0700~0799/0786.K-th-Smallest-Prime-Fraction.md" >}})|Medium||||51.7%|
+|0794|Valid Tic-Tac-Toe State|[Go]({{< relref "/ChapterFour/0700~0799/0794.Valid-Tic-Tac-Toe-State.md" >}})|Medium||||35.1%|
+|0795|Number of Subarrays with Bounded Maximum|[Go]({{< relref "/ChapterFour/0700~0799/0795.Number-of-Subarrays-with-Bounded-Maximum.md" >}})|Medium||||52.8%|
+|0803|Bricks Falling When Hit|[Go]({{< relref "/ChapterFour/0800~0899/0803.Bricks-Falling-When-Hit.md" >}})|Hard||||34.4%|
+|0807|Max Increase to Keep City Skyline|[Go]({{< relref "/ChapterFour/0800~0899/0807.Max-Increase-to-Keep-City-Skyline.md" >}})|Medium||||85.9%|
+|0810|Chalkboard XOR Game|[Go]({{< relref "/ChapterFour/0800~0899/0810.Chalkboard-XOR-Game.md" >}})|Hard||||55.8%|
+|0811|Subdomain Visit Count|[Go]({{< relref "/ChapterFour/0800~0899/0811.Subdomain-Visit-Count.md" >}})|Medium||||75.5%|
+|0812|Largest Triangle Area|[Go]({{< relref "/ChapterFour/0800~0899/0812.Largest-Triangle-Area.md" >}})|Easy||||59.9%|
+|0815|Bus Routes|[Go]({{< relref "/ChapterFour/0800~0899/0815.Bus-Routes.md" >}})|Hard||||45.6%|
+|0817|Linked List Components|[Go]({{< relref "/ChapterFour/0800~0899/0817.Linked-List-Components.md" >}})|Medium||||57.7%|
+|0820|Short Encoding of Words|[Go]({{< relref "/ChapterFour/0800~0899/0820.Short-Encoding-of-Words.md" >}})|Medium||||60.6%|
+|0821|Shortest Distance to a Character|[Go]({{< relref "/ChapterFour/0800~0899/0821.Shortest-Distance-to-a-Character.md" >}})|Easy||||71.3%|
+|0823|Binary Trees With Factors|[Go]({{< relref "/ChapterFour/0800~0899/0823.Binary-Trees-With-Factors.md" >}})|Medium||||49.7%|
+|0825|Friends Of Appropriate Ages|[Go]({{< relref "/ChapterFour/0800~0899/0825.Friends-Of-Appropriate-Ages.md" >}})|Medium||||46.3%|
+|0826|Most Profit Assigning Work|[Go]({{< relref "/ChapterFour/0800~0899/0826.Most-Profit-Assigning-Work.md" >}})|Medium||||44.9%|
+|0832|Flipping an Image|[Go]({{< relref "/ChapterFour/0800~0899/0832.Flipping-an-Image.md" >}})|Easy||||80.8%|
+|0839|Similar String Groups|[Go]({{< relref "/ChapterFour/0800~0899/0839.Similar-String-Groups.md" >}})|Hard||||48.0%|
+|0845|Longest Mountain in Array|[Go]({{< relref "/ChapterFour/0800~0899/0845.Longest-Mountain-in-Array.md" >}})|Medium||||40.2%|
+|0846|Hand of Straights|[Go]({{< relref "/ChapterFour/0800~0899/0846.Hand-of-Straights.md" >}})|Medium||||56.2%|
+|0850|Rectangle Area II|[Go]({{< relref "/ChapterFour/0800~0899/0850.Rectangle-Area-II.md" >}})|Hard||||53.9%|
+|0851|Loud and Rich|[Go]({{< relref "/ChapterFour/0800~0899/0851.Loud-and-Rich.md" >}})|Medium||||58.4%|
+|0852|Peak Index in a Mountain Array|[Go]({{< relref "/ChapterFour/0800~0899/0852.Peak-Index-in-a-Mountain-Array.md" >}})|Medium||||69.0%|
+|0853|Car Fleet|[Go]({{< relref "/ChapterFour/0800~0899/0853.Car-Fleet.md" >}})|Medium||||50.3%|
+|0862|Shortest Subarray with Sum at Least K|[Go]({{< relref "/ChapterFour/0800~0899/0862.Shortest-Subarray-with-Sum-at-Least-K.md" >}})|Hard||||26.0%|
+|0864|Shortest Path to Get All Keys|[Go]({{< relref "/ChapterFour/0800~0899/0864.Shortest-Path-to-Get-All-Keys.md" >}})|Hard||||45.6%|
+|0867|Transpose Matrix|[Go]({{< relref "/ChapterFour/0800~0899/0867.Transpose-Matrix.md" >}})|Easy| O(n)| O(1)||64.3%|
+|0870|Advantage Shuffle|[Go]({{< relref "/ChapterFour/0800~0899/0870.Advantage-Shuffle.md" >}})|Medium||||51.9%|
+|0874|Walking Robot Simulation|[Go]({{< relref "/ChapterFour/0800~0899/0874.Walking-Robot-Simulation.md" >}})|Medium||||39.0%|
+|0875|Koko Eating Bananas|[Go]({{< relref "/ChapterFour/0800~0899/0875.Koko-Eating-Bananas.md" >}})|Medium||||52.1%|
+|0877|Stone Game|[Go]({{< relref "/ChapterFour/0800~0899/0877.Stone-Game.md" >}})|Medium||||69.7%|
+|0881|Boats to Save People|[Go]({{< relref "/ChapterFour/0800~0899/0881.Boats-to-Save-People.md" >}})|Medium||||55.8%|
+|0885|Spiral Matrix III|[Go]({{< relref "/ChapterFour/0800~0899/0885.Spiral-Matrix-III.md" >}})|Medium||||73.5%|
+|0888|Fair Candy Swap|[Go]({{< relref "/ChapterFour/0800~0899/0888.Fair-Candy-Swap.md" >}})|Easy||||60.7%|
+|0890|Find and Replace Pattern|[Go]({{< relref "/ChapterFour/0800~0899/0890.Find-and-Replace-Pattern.md" >}})|Medium||||77.6%|
+|0891|Sum of Subsequence Widths|[Go]({{< relref "/ChapterFour/0800~0899/0891.Sum-of-Subsequence-Widths.md" >}})|Hard| O(n log n)| O(1)||36.7%|
+|0892|Surface Area of 3D Shapes|[Go]({{< relref "/ChapterFour/0800~0899/0892.Surface-Area-of-3D-Shapes.md" >}})|Easy||||64.0%|
+|0896|Monotonic Array|[Go]({{< relref "/ChapterFour/0800~0899/0896.Monotonic-Array.md" >}})|Easy||||58.4%|
+|0898|Bitwise ORs of Subarrays|[Go]({{< relref "/ChapterFour/0800~0899/0898.Bitwise-ORs-of-Subarrays.md" >}})|Medium||||37.2%|
+|0904|Fruit Into Baskets|[Go]({{< relref "/ChapterFour/0900~0999/0904.Fruit-Into-Baskets.md" >}})|Medium||||43.7%|
+|0907|Sum of Subarray Minimums|[Go]({{< relref "/ChapterFour/0900~0999/0907.Sum-of-Subarray-Minimums.md" >}})|Medium| O(n)| O(n)|❤️|35.8%|
+|0909|Snakes and Ladders|[Go]({{< relref "/ChapterFour/0900~0999/0909.Snakes-and-Ladders.md" >}})|Medium||||45.1%|
+|0910|Smallest Range II|[Go]({{< relref "/ChapterFour/0900~0999/0910.Smallest-Range-II.md" >}})|Medium||||35.2%|
+|0911|Online Election|[Go]({{< relref "/ChapterFour/0900~0999/0911.Online-Election.md" >}})|Medium||||52.2%|
+|0914|X of a Kind in a Deck of Cards|[Go]({{< relref "/ChapterFour/0900~0999/0914.X-of-a-Kind-in-a-Deck-of-Cards.md" >}})|Easy||||31.2%|
+|0916|Word Subsets|[Go]({{< relref "/ChapterFour/0900~0999/0916.Word-Subsets.md" >}})|Medium||||53.7%|
+|0918|Maximum Sum Circular Subarray|[Go]({{< relref "/ChapterFour/0900~0999/0918.Maximum-Sum-Circular-Subarray.md" >}})|Medium||||43.0%|
+|0922|Sort Array By Parity II|[Go]({{< relref "/ChapterFour/0900~0999/0922.Sort-Array-By-Parity-II.md" >}})|Easy| O(n)| O(1)||70.7%|
+|0923|3Sum With Multiplicity|[Go]({{< relref "/ChapterFour/0900~0999/0923.3Sum-With-Multiplicity.md" >}})|Medium||||45.3%|
+|0924|Minimize Malware Spread|[Go]({{< relref "/ChapterFour/0900~0999/0924.Minimize-Malware-Spread.md" >}})|Hard||||42.1%|
+|0927|Three Equal Parts|[Go]({{< relref "/ChapterFour/0900~0999/0927.Three-Equal-Parts.md" >}})|Hard||||39.6%|
+|0928|Minimize Malware Spread II|[Go]({{< relref "/ChapterFour/0900~0999/0928.Minimize-Malware-Spread-II.md" >}})|Hard||||42.8%|
+|0930|Binary Subarrays With Sum|[Go]({{< relref "/ChapterFour/0900~0999/0930.Binary-Subarrays-With-Sum.md" >}})|Medium||||52.2%|
+|0942|DI String Match|[Go]({{< relref "/ChapterFour/0900~0999/0942.DI-String-Match.md" >}})|Easy||||77.3%|
+|0946|Validate Stack Sequences|[Go]({{< relref "/ChapterFour/0900~0999/0946.Validate-Stack-Sequences.md" >}})|Medium||||67.7%|
+|0952|Largest Component Size by Common Factor|[Go]({{< relref "/ChapterFour/0900~0999/0952.Largest-Component-Size-by-Common-Factor.md" >}})|Hard||||40.0%|
+|0953|Verifying an Alien Dictionary|[Go]({{< relref "/ChapterFour/0900~0999/0953.Verifying-an-Alien-Dictionary.md" >}})|Easy||||54.5%|
+|0961|N-Repeated Element in Size 2N Array|[Go]({{< relref "/ChapterFour/0900~0999/0961.N-Repeated-Element-in-Size-2N-Array.md" >}})|Easy||||76.1%|
+|0966|Vowel Spellchecker|[Go]({{< relref "/ChapterFour/0900~0999/0966.Vowel-Spellchecker.md" >}})|Medium||||51.4%|
+|0969|Pancake Sorting|[Go]({{< relref "/ChapterFour/0900~0999/0969.Pancake-Sorting.md" >}})|Medium| O(n)| O(1)|❤️|70.1%|
+|0973|K Closest Points to Origin|[Go]({{< relref "/ChapterFour/0900~0999/0973.K-Closest-Points-to-Origin.md" >}})|Medium||||65.7%|
+|0976|Largest Perimeter Triangle|[Go]({{< relref "/ChapterFour/0900~0999/0976.Largest-Perimeter-Triangle.md" >}})|Easy||||54.7%|
+|0977|Squares of a Sorted Array|[Go]({{< relref "/ChapterFour/0900~0999/0977.Squares-of-a-Sorted-Array.md" >}})|Easy| O(n)| O(1)||71.9%|
+|0978|Longest Turbulent Subarray|[Go]({{< relref "/ChapterFour/0900~0999/0978.Longest-Turbulent-Subarray.md" >}})|Medium||||47.2%|
+|0980|Unique Paths III|[Go]({{< relref "/ChapterFour/0900~0999/0980.Unique-Paths-III.md" >}})|Hard||||81.7%|
+|0985|Sum of Even Numbers After Queries|[Go]({{< relref "/ChapterFour/0900~0999/0985.Sum-of-Even-Numbers-After-Queries.md" >}})|Medium||||68.1%|
+|0986|Interval List Intersections|[Go]({{< relref "/ChapterFour/0900~0999/0986.Interval-List-Intersections.md" >}})|Medium||||71.3%|
+|0989|Add to Array-Form of Integer|[Go]({{< relref "/ChapterFour/0900~0999/0989.Add-to-Array-Form-of-Integer.md" >}})|Easy||||47.1%|
+|0990|Satisfiability of Equality Equations|[Go]({{< relref "/ChapterFour/0900~0999/0990.Satisfiability-of-Equality-Equations.md" >}})|Medium||||50.5%|
+|0992|Subarrays with K Different Integers|[Go]({{< relref "/ChapterFour/0900~0999/0992.Subarrays-with-K-Different-Integers.md" >}})|Hard||||54.6%|
+|0995|Minimum Number of K Consecutive Bit Flips|[Go]({{< relref "/ChapterFour/0900~0999/0995.Minimum-Number-of-K-Consecutive-Bit-Flips.md" >}})|Hard||||51.2%|
+|0996|Number of Squareful Arrays|[Go]({{< relref "/ChapterFour/0900~0999/0996.Number-of-Squareful-Arrays.md" >}})|Hard||||49.2%|
+|0997|Find the Town Judge|[Go]({{< relref "/ChapterFour/0900~0999/0997.Find-the-Town-Judge.md" >}})|Easy||||49.5%|
+|0999|Available Captures for Rook|[Go]({{< relref "/ChapterFour/0900~0999/0999.Available-Captures-for-Rook.md" >}})|Easy||||68.2%|
+|1002|Find Common Characters|[Go]({{< relref "/ChapterFour/1000~1099/1002.Find-Common-Characters.md" >}})|Easy||||68.5%|
+|1004|Max Consecutive Ones III|[Go]({{< relref "/ChapterFour/1000~1099/1004.Max-Consecutive-Ones-III.md" >}})|Medium||||63.2%|
+|1005|Maximize Sum Of Array After K Negations|[Go]({{< relref "/ChapterFour/1000~1099/1005.Maximize-Sum-Of-Array-After-K-Negations.md" >}})|Easy||||50.8%|
+|1010|Pairs of Songs With Total Durations Divisible by 60|[Go]({{< relref "/ChapterFour/1000~1099/1010.Pairs-of-Songs-With-Total-Durations-Divisible-by-60.md" >}})|Medium||||52.8%|
+|1011|Capacity To Ship Packages Within D Days|[Go]({{< relref "/ChapterFour/1000~1099/1011.Capacity-To-Ship-Packages-Within-D-Days.md" >}})|Medium||||67.7%|
+|1018|Binary Prefix Divisible By 5|[Go]({{< relref "/ChapterFour/1000~1099/1018.Binary-Prefix-Divisible-By-5.md" >}})|Easy||||46.9%|
+|1019|Next Greater Node In Linked List|[Go]({{< relref "/ChapterFour/1000~1099/1019.Next-Greater-Node-In-Linked-List.md" >}})|Medium||||59.9%|
+|1020|Number of Enclaves|[Go]({{< relref "/ChapterFour/1000~1099/1020.Number-of-Enclaves.md" >}})|Medium||||65.6%|
+|1030|Matrix Cells in Distance Order|[Go]({{< relref "/ChapterFour/1000~1099/1030.Matrix-Cells-in-Distance-Order.md" >}})|Easy||||69.7%|
+|1034|Coloring A Border|[Go]({{< relref "/ChapterFour/1000~1099/1034.Coloring-A-Border.md" >}})|Medium||||49.2%|
+|1037|Valid Boomerang|[Go]({{< relref "/ChapterFour/1000~1099/1037.Valid-Boomerang.md" >}})|Easy||||37.0%|
+|1040|Moving Stones Until Consecutive II|[Go]({{< relref "/ChapterFour/1000~1099/1040.Moving-Stones-Until-Consecutive-II.md" >}})|Medium||||55.9%|
+|1048|Longest String Chain|[Go]({{< relref "/ChapterFour/1000~1099/1048.Longest-String-Chain.md" >}})|Medium||||59.3%|
+|1049|Last Stone Weight II|[Go]({{< relref "/ChapterFour/1000~1099/1049.Last-Stone-Weight-II.md" >}})|Medium||||53.2%|
+|1051|Height Checker|[Go]({{< relref "/ChapterFour/1000~1099/1051.Height-Checker.md" >}})|Easy||||75.6%|
+|1052|Grumpy Bookstore Owner|[Go]({{< relref "/ChapterFour/1000~1099/1052.Grumpy-Bookstore-Owner.md" >}})|Medium||||57.1%|
+|1054|Distant Barcodes|[Go]({{< relref "/ChapterFour/1000~1099/1054.Distant-Barcodes.md" >}})|Medium||||45.9%|
+|1073|Adding Two Negabinary Numbers|[Go]({{< relref "/ChapterFour/1000~1099/1073.Adding-Two-Negabinary-Numbers.md" >}})|Medium||||36.5%|
+|1074|Number of Submatrices That Sum to Target|[Go]({{< relref "/ChapterFour/1000~1099/1074.Number-of-Submatrices-That-Sum-to-Target.md" >}})|Hard||||69.5%|
+|1089|Duplicate Zeros|[Go]({{< relref "/ChapterFour/1000~1099/1089.Duplicate-Zeros.md" >}})|Easy||||51.5%|
+|1091|Shortest Path in Binary Matrix|[Go]({{< relref "/ChapterFour/1000~1099/1091.Shortest-Path-in-Binary-Matrix.md" >}})|Medium||||44.7%|
+|1093|Statistics from a Large Sample|[Go]({{< relref "/ChapterFour/1000~1099/1093.Statistics-from-a-Large-Sample.md" >}})|Medium||||43.5%|
+|1105|Filling Bookcase Shelves|[Go]({{< relref "/ChapterFour/1100~1199/1105.Filling-Bookcase-Shelves.md" >}})|Medium||||59.3%|
+|1122|Relative Sort Array|[Go]({{< relref "/ChapterFour/1100~1199/1122.Relative-Sort-Array.md" >}})|Easy||||68.6%|
+|1128|Number of Equivalent Domino Pairs|[Go]({{< relref "/ChapterFour/1100~1199/1128.Number-of-Equivalent-Domino-Pairs.md" >}})|Easy||||47.1%|
+|1157|Online Majority Element In Subarray|[Go]({{< relref "/ChapterFour/1100~1199/1157.Online-Majority-Element-In-Subarray.md" >}})|Hard||||41.8%|
+|1160|Find Words That Can Be Formed by Characters|[Go]({{< relref "/ChapterFour/1100~1199/1160.Find-Words-That-Can-Be-Formed-by-Characters.md" >}})|Easy||||67.5%|
+|1170|Compare Strings by Frequency of the Smallest Character|[Go]({{< relref "/ChapterFour/1100~1199/1170.Compare-Strings-by-Frequency-of-the-Smallest-Character.md" >}})|Medium||||61.5%|
+|1178|Number of Valid Words for Each Puzzle|[Go]({{< relref "/ChapterFour/1100~1199/1178.Number-of-Valid-Words-for-Each-Puzzle.md" >}})|Hard||||46.3%|
+|1184|Distance Between Bus Stops|[Go]({{< relref "/ChapterFour/1100~1199/1184.Distance-Between-Bus-Stops.md" >}})|Easy||||54.0%|
+|1200|Minimum Absolute Difference|[Go]({{< relref "/ChapterFour/1200~1299/1200.Minimum-Absolute-Difference.md" >}})|Easy||||69.6%|
+|1207|Unique Number of Occurrences|[Go]({{< relref "/ChapterFour/1200~1299/1207.Unique-Number-of-Occurrences.md" >}})|Easy||||73.5%|
+|1217|Minimum Cost to Move Chips to The Same Position|[Go]({{< relref "/ChapterFour/1200~1299/1217.Minimum-Cost-to-Move-Chips-to-The-Same-Position.md" >}})|Easy||||71.9%|
+|1232|Check If It Is a Straight Line|[Go]({{< relref "/ChapterFour/1200~1299/1232.Check-If-It-Is-a-Straight-Line.md" >}})|Easy||||40.3%|
+|1235|Maximum Profit in Job Scheduling|[Go]({{< relref "/ChapterFour/1200~1299/1235.Maximum-Profit-in-Job-Scheduling.md" >}})|Hard||||53.4%|
+|1239|Maximum Length of a Concatenated String with Unique Characters|[Go]({{< relref "/ChapterFour/1200~1299/1239.Maximum-Length-of-a-Concatenated-String-with-Unique-Characters.md" >}})|Medium||||52.2%|
+|1252|Cells with Odd Values in a Matrix|[Go]({{< relref "/ChapterFour/1200~1299/1252.Cells-with-Odd-Values-in-a-Matrix.md" >}})|Easy||||78.5%|
+|1254|Number of Closed Islands|[Go]({{< relref "/ChapterFour/1200~1299/1254.Number-of-Closed-Islands.md" >}})|Medium||||66.9%|
+|1260|Shift 2D Grid|[Go]({{< relref "/ChapterFour/1200~1299/1260.Shift-2D-Grid.md" >}})|Easy||||67.8%|
+|1266|Minimum Time Visiting All Points|[Go]({{< relref "/ChapterFour/1200~1299/1266.Minimum-Time-Visiting-All-Points.md" >}})|Easy||||79.1%|
+|1268|Search Suggestions System|[Go]({{< relref "/ChapterFour/1200~1299/1268.Search-Suggestions-System.md" >}})|Medium||||66.2%|
+|1275|Find Winner on a Tic Tac Toe Game|[Go]({{< relref "/ChapterFour/1200~1299/1275.Find-Winner-on-a-Tic-Tac-Toe-Game.md" >}})|Easy||||54.2%|
+|1283|Find the Smallest Divisor Given a Threshold|[Go]({{< relref "/ChapterFour/1200~1299/1283.Find-the-Smallest-Divisor-Given-a-Threshold.md" >}})|Medium||||56.2%|
+|1287|Element Appearing More Than 25% In Sorted Array|[Go]({{< relref "/ChapterFour/1200~1299/1287.Element-Appearing-More-Than-25-In-Sorted-Array.md" >}})|Easy||||59.4%|
+|1293|Shortest Path in a Grid with Obstacles Elimination|[Go]({{< relref "/ChapterFour/1200~1299/1293.Shortest-Path-in-a-Grid-with-Obstacles-Elimination.md" >}})|Hard||||45.3%|
+|1295|Find Numbers with Even Number of Digits|[Go]({{< relref "/ChapterFour/1200~1299/1295.Find-Numbers-with-Even-Number-of-Digits.md" >}})|Easy||||77.0%|
+|1296|Divide Array in Sets of K Consecutive Numbers|[Go]({{< relref "/ChapterFour/1200~1299/1296.Divide-Array-in-Sets-of-K-Consecutive-Numbers.md" >}})|Medium||||56.5%|
+|1299|Replace Elements with Greatest Element on Right Side|[Go]({{< relref "/ChapterFour/1200~1299/1299.Replace-Elements-with-Greatest-Element-on-Right-Side.md" >}})|Easy||||73.3%|
+|1300|Sum of Mutated Array Closest to Target|[Go]({{< relref "/ChapterFour/1300~1399/1300.Sum-of-Mutated-Array-Closest-to-Target.md" >}})|Medium||||43.6%|
+|1304|Find N Unique Integers Sum up to Zero|[Go]({{< relref "/ChapterFour/1300~1399/1304.Find-N-Unique-Integers-Sum-up-to-Zero.md" >}})|Easy||||76.9%|
+|1306|Jump Game III|[Go]({{< relref "/ChapterFour/1300~1399/1306.Jump-Game-III.md" >}})|Medium||||63.5%|
+|1310|XOR Queries of a Subarray|[Go]({{< relref "/ChapterFour/1300~1399/1310.XOR-Queries-of-a-Subarray.md" >}})|Medium||||72.3%|
+|1313|Decompress Run-Length Encoded List|[Go]({{< relref "/ChapterFour/1300~1399/1313.Decompress-Run-Length-Encoded-List.md" >}})|Easy||||85.8%|
+|1329|Sort the Matrix Diagonally|[Go]({{< relref "/ChapterFour/1300~1399/1329.Sort-the-Matrix-Diagonally.md" >}})|Medium||||83.3%|
+|1337|The K Weakest Rows in a Matrix|[Go]({{< relref "/ChapterFour/1300~1399/1337.The-K-Weakest-Rows-in-a-Matrix.md" >}})|Easy||||72.1%|
+|1353|Maximum Number of Events That Can Be Attended|[Go]({{< relref "/ChapterFour/1300~1399/1353.Maximum-Number-of-Events-That-Can-Be-Attended.md" >}})|Medium||||32.5%|
+|1380|Lucky Numbers in a Matrix|[Go]({{< relref "/ChapterFour/1300~1399/1380.Lucky-Numbers-in-a-Matrix.md" >}})|Easy||||70.7%|
+|1383|Maximum Performance of a Team|[Go]({{< relref "/ChapterFour/1300~1399/1383.Maximum-Performance-of-a-Team.md" >}})|Hard||||48.5%|
+|1385|Find the Distance Value Between Two Arrays|[Go]({{< relref "/ChapterFour/1300~1399/1385.Find-the-Distance-Value-Between-Two-Arrays.md" >}})|Easy||||66.6%|
+|1389|Create Target Array in the Given Order|[Go]({{< relref "/ChapterFour/1300~1399/1389.Create-Target-Array-in-the-Given-Order.md" >}})|Easy||||85.8%|
+|1423|Maximum Points You Can Obtain from Cards|[Go]({{< relref "/ChapterFour/1400~1499/1423.Maximum-Points-You-Can-Obtain-from-Cards.md" >}})|Medium||||52.2%|
+|1437|Check If All 1's Are at Least Length K Places Away|[Go]({{< relref "/ChapterFour/1400~1499/1437.Check-If-All-1s-Are-at-Least-Length-K-Places-Away.md" >}})|Easy||||58.7%|
+|1438|Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit|[Go]({{< relref "/ChapterFour/1400~1499/1438.Longest-Continuous-Subarray-With-Absolute-Diff-Less-Than-or-Equal-to-Limit.md" >}})|Medium||||48.3%|
+|1439|Find the Kth Smallest Sum of a Matrix With Sorted Rows|[Go]({{< relref "/ChapterFour/1400~1499/1439.Find-the-Kth-Smallest-Sum-of-a-Matrix-With-Sorted-Rows.md" >}})|Hard||||61.4%|
+|1442|Count Triplets That Can Form Two Arrays of Equal XOR|[Go]({{< relref "/ChapterFour/1400~1499/1442.Count-Triplets-That-Can-Form-Two-Arrays-of-Equal-XOR.md" >}})|Medium||||76.1%|
+|1463|Cherry Pickup II|[Go]({{< relref "/ChapterFour/1400~1499/1463.Cherry-Pickup-II.md" >}})|Hard||||69.5%|
+|1464|Maximum Product of Two Elements in an Array|[Go]({{< relref "/ChapterFour/1400~1499/1464.Maximum-Product-of-Two-Elements-in-an-Array.md" >}})|Easy||||80.0%|
+|1465|Maximum Area of a Piece of Cake After Horizontal and Vertical Cuts|[Go]({{< relref "/ChapterFour/1400~1499/1465.Maximum-Area-of-a-Piece-of-Cake-After-Horizontal-and-Vertical-Cuts.md" >}})|Medium||||40.9%|
+|1470|Shuffle the Array|[Go]({{< relref "/ChapterFour/1400~1499/1470.Shuffle-the-Array.md" >}})|Easy||||89.0%|
+|1480|Running Sum of 1d Array|[Go]({{< relref "/ChapterFour/1400~1499/1480.Running-Sum-of-1d-Array.md" >}})|Easy||||87.4%|
+|1482|Minimum Number of Days to Make m Bouquets|[Go]({{< relref "/ChapterFour/1400~1499/1482.Minimum-Number-of-Days-to-Make-m-Bouquets.md" >}})|Medium||||54.0%|
+|1512|Number of Good Pairs|[Go]({{< relref "/ChapterFour/1500~1599/1512.Number-of-Good-Pairs.md" >}})|Easy||||88.2%|
+|1539|Kth Missing Positive Number|[Go]({{< relref "/ChapterFour/1500~1599/1539.Kth-Missing-Positive-Number.md" >}})|Easy||||58.6%|
+|1572|Matrix Diagonal Sum|[Go]({{< relref "/ChapterFour/1500~1599/1572.Matrix-Diagonal-Sum.md" >}})|Easy||||80.3%|
+|1608|Special Array With X Elements Greater Than or Equal X|[Go]({{< relref "/ChapterFour/1600~1699/1608.Special-Array-With-X-Elements-Greater-Than-or-Equal-X.md" >}})|Easy||||60.5%|
+|1619|Mean of Array After Removing Some Elements|[Go]({{< relref "/ChapterFour/1600~1699/1619.Mean-of-Array-After-Removing-Some-Elements.md" >}})|Easy||||65.8%|
+|1629|Slowest Key|[Go]({{< relref "/ChapterFour/1600~1699/1629.Slowest-Key.md" >}})|Easy||||59.2%|
+|1631|Path With Minimum Effort|[Go]({{< relref "/ChapterFour/1600~1699/1631.Path-With-Minimum-Effort.md" >}})|Medium||||55.7%|
+|1636|Sort Array by Increasing Frequency|[Go]({{< relref "/ChapterFour/1600~1699/1636.Sort-Array-by-Increasing-Frequency.md" >}})|Easy||||69.5%|
+|1640|Check Array Formation Through Concatenation|[Go]({{< relref "/ChapterFour/1600~1699/1640.Check-Array-Formation-Through-Concatenation.md" >}})|Easy||||56.2%|
+|1642|Furthest Building You Can Reach|[Go]({{< relref "/ChapterFour/1600~1699/1642.Furthest-Building-You-Can-Reach.md" >}})|Medium||||48.3%|
+|1646|Get Maximum in Generated Array|[Go]({{< relref "/ChapterFour/1600~1699/1646.Get-Maximum-in-Generated-Array.md" >}})|Easy||||50.2%|
+|1648|Sell Diminishing-Valued Colored Balls|[Go]({{< relref "/ChapterFour/1600~1699/1648.Sell-Diminishing-Valued-Colored-Balls.md" >}})|Medium||||30.4%|
+|1649|Create Sorted Array through Instructions|[Go]({{< relref "/ChapterFour/1600~1699/1649.Create-Sorted-Array-through-Instructions.md" >}})|Hard||||37.5%|
+|1652|Defuse the Bomb|[Go]({{< relref "/ChapterFour/1600~1699/1652.Defuse-the-Bomb.md" >}})|Easy||||62.4%|
+|1654|Minimum Jumps to Reach Home|[Go]({{< relref "/ChapterFour/1600~1699/1654.Minimum-Jumps-to-Reach-Home.md" >}})|Medium||||29.1%|
+|1655|Distribute Repeating Integers|[Go]({{< relref "/ChapterFour/1600~1699/1655.Distribute-Repeating-Integers.md" >}})|Hard||||39.3%|
+|1656|Design an Ordered Stream|[Go]({{< relref "/ChapterFour/1600~1699/1656.Design-an-Ordered-Stream.md" >}})|Easy||||85.2%|
+|1658|Minimum Operations to Reduce X to Zero|[Go]({{< relref "/ChapterFour/1600~1699/1658.Minimum-Operations-to-Reduce-X-to-Zero.md" >}})|Medium||||37.6%|
+|1662|Check If Two String Arrays are Equivalent|[Go]({{< relref "/ChapterFour/1600~1699/1662.Check-If-Two-String-Arrays-are-Equivalent.md" >}})|Easy||||83.5%|
+|1664|Ways to Make a Fair Array|[Go]({{< relref "/ChapterFour/1600~1699/1664.Ways-to-Make-a-Fair-Array.md" >}})|Medium||||63.3%|
+|1665|Minimum Initial Energy to Finish Tasks|[Go]({{< relref "/ChapterFour/1600~1699/1665.Minimum-Initial-Energy-to-Finish-Tasks.md" >}})|Hard||||56.4%|
+|1670|Design Front Middle Back Queue|[Go]({{< relref "/ChapterFour/1600~1699/1670.Design-Front-Middle-Back-Queue.md" >}})|Medium||||57.2%|
+|1672|Richest Customer Wealth|[Go]({{< relref "/ChapterFour/1600~1699/1672.Richest-Customer-Wealth.md" >}})|Easy||||87.9%|
+|1673|Find the Most Competitive Subsequence|[Go]({{< relref "/ChapterFour/1600~1699/1673.Find-the-Most-Competitive-Subsequence.md" >}})|Medium||||49.3%|
+|1674|Minimum Moves to Make Array Complementary|[Go]({{< relref "/ChapterFour/1600~1699/1674.Minimum-Moves-to-Make-Array-Complementary.md" >}})|Medium||||38.7%|
+|1675|Minimize Deviation in Array|[Go]({{< relref "/ChapterFour/1600~1699/1675.Minimize-Deviation-in-Array.md" >}})|Hard||||54.6%|
+|1679|Max Number of K-Sum Pairs|[Go]({{< relref "/ChapterFour/1600~1699/1679.Max-Number-of-K-Sum-Pairs.md" >}})|Medium||||57.3%|
+|1681|Minimum Incompatibility|[Go]({{< relref "/ChapterFour/1600~1699/1681.Minimum-Incompatibility.md" >}})|Hard||||37.8%|
+|1684|Count the Number of Consistent Strings|[Go]({{< relref "/ChapterFour/1600~1699/1684.Count-the-Number-of-Consistent-Strings.md" >}})|Easy||||82.3%|
+|1685|Sum of Absolute Differences in a Sorted Array|[Go]({{< relref "/ChapterFour/1600~1699/1685.Sum-of-Absolute-Differences-in-a-Sorted-Array.md" >}})|Medium||||63.5%|
+|1690|Stone Game VII|[Go]({{< relref "/ChapterFour/1600~1699/1690.Stone-Game-VII.md" >}})|Medium||||58.1%|
+|1691|Maximum Height by Stacking Cuboids|[Go]({{< relref "/ChapterFour/1600~1699/1691.Maximum-Height-by-Stacking-Cuboids.md" >}})|Hard||||54.6%|
+|1695|Maximum Erasure Value|[Go]({{< relref "/ChapterFour/1600~1699/1695.Maximum-Erasure-Value.md" >}})|Medium||||57.6%|
+|1696|Jump Game VI|[Go]({{< relref "/ChapterFour/1600~1699/1696.Jump-Game-VI.md" >}})|Medium||||46.1%|
+|1700|Number of Students Unable to Eat Lunch|[Go]({{< relref "/ChapterFour/1700~1799/1700.Number-of-Students-Unable-to-Eat-Lunch.md" >}})|Easy||||68.8%|
+|1705|Maximum Number of Eaten Apples|[Go]({{< relref "/ChapterFour/1700~1799/1705.Maximum-Number-of-Eaten-Apples.md" >}})|Medium||||38.0%|
+|1710|Maximum Units on a Truck|[Go]({{< relref "/ChapterFour/1700~1799/1710.Maximum-Units-on-a-Truck.md" >}})|Easy||||73.8%|
+|1720|Decode XORed Array|[Go]({{< relref "/ChapterFour/1700~1799/1720.Decode-XORed-Array.md" >}})|Easy||||85.8%|
+|1725|Number Of Rectangles That Can Form The Largest Square|[Go]({{< relref "/ChapterFour/1700~1799/1725.Number-Of-Rectangles-That-Can-Form-The-Largest-Square.md" >}})|Easy||||78.6%|
+|1732|Find the Highest Altitude|[Go]({{< relref "/ChapterFour/1700~1799/1732.Find-the-Highest-Altitude.md" >}})|Easy||||78.9%|
+|1734|Decode XORed Permutation|[Go]({{< relref "/ChapterFour/1700~1799/1734.Decode-XORed-Permutation.md" >}})|Medium||||63.0%|
+|1738|Find Kth Largest XOR Coordinate Value|[Go]({{< relref "/ChapterFour/1700~1799/1738.Find-Kth-Largest-XOR-Coordinate-Value.md" >}})|Medium||||61.0%|
+|1744|Can You Eat Your Favorite Candy on Your Favorite Day?|[Go]({{< relref "/ChapterFour/1700~1799/1744.Can-You-Eat-Your-Favorite-Candy-on-Your-Favorite-Day.md" >}})|Medium||||33.1%|
+|1748|Sum of Unique Elements|[Go]({{< relref "/ChapterFour/1700~1799/1748.Sum-of-Unique-Elements.md" >}})|Easy||||76.3%|
+|1752|Check if Array Is Sorted and Rotated|[Go]({{< relref "/ChapterFour/1700~1799/1752.Check-if-Array-Is-Sorted-and-Rotated.md" >}})|Easy||||50.1%|
+|1816|Truncate Sentence|[Go]({{< relref "/ChapterFour/1800~1899/1816.Truncate-Sentence.md" >}})|Easy||||83.1%|
+|1818|Minimum Absolute Sum Difference|[Go]({{< relref "/ChapterFour/1800~1899/1818.Minimum-Absolute-Sum-Difference.md" >}})|Medium||||30.4%|
+|1846|Maximum Element After Decreasing and Rearranging|[Go]({{< relref "/ChapterFour/1800~1899/1846.Maximum-Element-After-Decreasing-and-Rearranging.md" >}})|Medium||||58.9%|
+|1877|Minimize Maximum Pair Sum in Array|[Go]({{< relref "/ChapterFour/1800~1899/1877.Minimize-Maximum-Pair-Sum-in-Array.md" >}})|Medium||||79.9%|
+|1984|Minimum Difference Between Highest and Lowest of K Scores|[Go]({{< relref "/ChapterFour/1900~1999/1984.Minimum-Difference-Between-Highest-and-Lowest-of-K-Scores.md" >}})|Easy||||54.5%|
+|2021|Brightest Position on Street|[Go]({{< relref "/ChapterFour/2000~2099/2021.Brightest-Position-on-Street.md" >}})|Medium||||62.1%|
+|2022|Convert 1D Array Into 2D Array|[Go]({{< relref "/ChapterFour/2000~2099/2022.Convert-1D-Array-Into-2D-Array.md" >}})|Easy||||59.1%|
+|2037|Minimum Number of Moves to Seat Everyone|[Go]({{< relref "/ChapterFour/2000~2099/2037.Minimum-Number-of-Moves-to-Seat-Everyone.md" >}})|Easy||||82.1%|
+|2043|Simple Bank System|[Go]({{< relref "/ChapterFour/2000~2099/2043.Simple-Bank-System.md" >}})|Medium||||65.2%|
+|2164|Sort Even and Odd Indices Independently|[Go]({{< relref "/ChapterFour/2100~2199/2164.Sort-Even-and-Odd-Indices-Independently.md" >}})|Easy||||64.9%|
+|2166|Design Bitset|[Go]({{< relref "/ChapterFour/2100~2199/2166.Design-Bitset.md" >}})|Medium||||31.8%|
+|2170|Minimum Operations to Make the Array Alternating|[Go]({{< relref "/ChapterFour/2100~2199/2170.Minimum-Operations-to-Make-the-Array-Alternating.md" >}})|Medium||||33.2%|
+|2171|Removing Minimum Number of Magic Beans|[Go]({{< relref "/ChapterFour/2100~2199/2171.Removing-Minimum-Number-of-Magic-Beans.md" >}})|Medium||||42.1%|
+|2183|Count Array Pairs Divisible by K|[Go]({{< relref "/ChapterFour/2100~2199/2183.Count-Array-Pairs-Divisible-by-K.md" >}})|Hard||||28.3%|
+|------------|-------------------------------------------------------|-------| ----------------| ---------------|-------------|-------------|-------------|
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterTwo/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterTwo/String/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterTwo/Backtracking.md b/website/content/ChapterTwo/Backtracking.md
index 74f112a07..fd1b61831 100644
--- a/website/content/ChapterTwo/Backtracking.md
+++ b/website/content/ChapterTwo/Backtracking.md
@@ -1,6 +1,7 @@
---
-title: Backtracking
+title: 2.08 ✅ Backtracking
type: docs
+weight: 8
---
# Backtracking
@@ -97,36 +98,52 @@ func updateMatrix_BFS(matrix [][]int) [][]int {
}
```
-| Title | Solution | Difficulty | Time | Space |收藏|
-| ----- | :--------: | :----------: | :----: | :-----: | :-----: |
-|17. Letter Combinations of a Phone Number | [Go]({{< relref "/ChapterFour/0017.Letter-Combinations-of-a-Phone-Number.md" >}})| Medium | O(log n)| O(1)||
-|22. Generate Parentheses| [Go]({{< relref "/ChapterFour/0022.Generate-Parentheses.md" >}})| Medium | O(log n)| O(1)||
-|37. Sudoku Solver | [Go]({{< relref "/ChapterFour/0037.Sudoku-Solver.md" >}})| Hard | O(n^2)| O(n^2)|❤️|
-|39. Combination Sum | [Go]({{< relref "/ChapterFour/0039.Combination-Sum.md" >}})| Medium | O(n log n)| O(n)||
-|40. Combination Sum II | [Go]({{< relref "/ChapterFour/0040.Combination-Sum-II.md" >}})| Medium | O(n log n)| O(n)||
-|46. Permutations | [Go]({{< relref "/ChapterFour/0046.Permutations.md" >}})| Medium | O(n)| O(n)|❤️|
-|47. Permutations II | [Go]({{< relref "/ChapterFour/0047.Permutations-II.md" >}})| Medium | O(n^2)| O(n)|❤️|
-|51. N-Queens | [Go]({{< relref "/ChapterFour/0051.N-Queens.md" >}})| Hard | O(n^2)| O(n)|❤️|
-|52. N-Queens II | [Go]({{< relref "/ChapterFour/0052.N-Queens-II.md" >}})| Hard | O(n^2)| O(n)|❤️|
-|60. Permutation Sequence | [Go]({{< relref "/ChapterFour/0060.Permutation-Sequence.md" >}})| Medium | O(n log n)| O(1)||
-|77. Combinations | [Go]({{< relref "/ChapterFour/0077.Combinations.md" >}})| Medium | O(n)| O(n)|❤️|
-|78. Subsets | [Go]({{< relref "/ChapterFour/0078.Subsets.md" >}})| Medium | O(n^2)| O(n)|❤️|
-|79. Word Search | [Go]({{< relref "/ChapterFour/0079.Word-Search.md" >}})| Medium | O(n^2)| O(n^2)|❤️|
-|89. Gray Codes | [Go]({{< relref "/ChapterFour/0089.Gray-Code.md" >}})| Medium | O(n)| O(1)||
-|90. Subsets II | [Go]({{< relref "/ChapterFour/0090.Subsets-II.md" >}})| Medium | O(n^2)| O(n)|❤️|
-|93. Restore IP Addresses | [Go]({{< relref "/ChapterFour/0093.Restore-IP-Addresses.md" >}})| Medium | O(n)| O(n)|❤️|
-|126. Word Ladder II | [Go]({{< relref "/ChapterFour/0126.Word-Ladder-II.md" >}})| Hard | O(n)| O(n^2)|❤️|
-|131. Palindrome Partitioning | [Go]({{< relref "/ChapterFour/0131.Palindrome-Partitioning.md" >}})| Medium | O(n)| O(n^2)|❤️|
-|211. Add and Search Word - Data structure design | [Go]({{< relref "/ChapterFour/0211.Add-and-Search-Word---Data-structure-design.md" >}})| Medium | O(n)| O(n)|❤️|
-|212. Word Search II | [Go]({{< relref "/ChapterFour/0212.Word-Search-II.md" >}})| Hard | O(n^2)| O(n^2)|❤️|
-|216. Combination Sum III | [Go]({{< relref "/ChapterFour/0216.Combination-Sum-III.md" >}})| Medium | O(n)| O(1)|❤️|
-|306. Additive Number | [Go]({{< relref "/ChapterFour/0306.Additive-Number.md" >}})| Medium | O(n^2)| O(1)|❤️|
-|357. Count Numbers with Unique Digits | [Go]({{< relref "/ChapterFour/0357.Count-Numbers-with-Unique-Digits.md" >}})| Medium | O(1)| O(1)||
-|401. Binary Watch | [Go]({{< relref "/ChapterFour/0401.Binary-Watch.md" >}})| Easy | O(1)| O(1)||
-|526. Beautiful Arrangement | [Go]({{< relref "/ChapterFour/0526.Beautiful-Arrangement.md" >}})| Medium | O(n^2)| O(1)|❤️|
-|784. Letter Case Permutation | [Go]({{< relref "/ChapterFour/0784.Letter-Case-Permutation.md" >}})| Easy | O(n)| O(n)||
-|842. Split Array into Fibonacci Sequence | [Go]({{< relref "/ChapterFour/0842.Split-Array-into-Fibonacci-Sequence.md" >}})| Medium | O(n^2)| O(1)|❤️|
-|980. Unique Paths III | [Go]({{< relref "/ChapterFour/0980.Unique-Paths-III.md" >}})| Hard | O(n log n)| O(n)||
-|996. Number of Squareful Arrays | [Go]({{< relref "/ChapterFour/0996.Number-of-Squareful-Arrays.md" >}})| Hard | O(n log n)| O(n) ||
-|1079. Letter Tile Possibilities | [Go]({{< relref "/ChapterFour/1079.Letter-Tile-Possibilities.md" >}})| Medium | O(n^2)| O(1)|❤️|
-|---------------------------------------|---------------------------------|--------------------------|-----------------------|-----------|--------|
\ No newline at end of file
+| No. | Title | Solution | Difficulty | TimeComplexity | SpaceComplexity |Favorite| Acceptance |
+|:--------:|:------- | :--------: | :----------: | :----: | :-----: | :-----: |:-----: |
+|0017|Letter Combinations of a Phone Number|[Go]({{< relref "/ChapterFour/0001~0099/0017.Letter-Combinations-of-a-Phone-Number.md" >}})|Medium| O(log n)| O(1)||56.6%|
+|0022|Generate Parentheses|[Go]({{< relref "/ChapterFour/0001~0099/0022.Generate-Parentheses.md" >}})|Medium| O(log n)| O(1)||72.5%|
+|0037|Sudoku Solver|[Go]({{< relref "/ChapterFour/0001~0099/0037.Sudoku-Solver.md" >}})|Hard| O(n^2)| O(n^2)|❤️|57.7%|
+|0039|Combination Sum|[Go]({{< relref "/ChapterFour/0001~0099/0039.Combination-Sum.md" >}})|Medium| O(n log n)| O(n)||68.6%|
+|0040|Combination Sum II|[Go]({{< relref "/ChapterFour/0001~0099/0040.Combination-Sum-II.md" >}})|Medium| O(n log n)| O(n)||53.4%|
+|0046|Permutations|[Go]({{< relref "/ChapterFour/0001~0099/0046.Permutations.md" >}})|Medium| O(n)| O(n)|❤️|75.7%|
+|0047|Permutations II|[Go]({{< relref "/ChapterFour/0001~0099/0047.Permutations-II.md" >}})|Medium| O(n^2)| O(n)|❤️|57.4%|
+|0051|N-Queens|[Go]({{< relref "/ChapterFour/0001~0099/0051.N-Queens.md" >}})|Hard| O(n!)| O(n)|❤️|64.2%|
+|0052|N-Queens II|[Go]({{< relref "/ChapterFour/0001~0099/0052.N-Queens-II.md" >}})|Hard| O(n!)| O(n)|❤️|71.6%|
+|0077|Combinations|[Go]({{< relref "/ChapterFour/0001~0099/0077.Combinations.md" >}})|Medium| O(n)| O(n)|❤️|67.0%|
+|0078|Subsets|[Go]({{< relref "/ChapterFour/0001~0099/0078.Subsets.md" >}})|Medium| O(n^2)| O(n)|❤️|74.9%|
+|0079|Word Search|[Go]({{< relref "/ChapterFour/0001~0099/0079.Word-Search.md" >}})|Medium| O(n^2)| O(n^2)|❤️|40.2%|
+|0089|Gray Code|[Go]({{< relref "/ChapterFour/0001~0099/0089.Gray-Code.md" >}})|Medium| O(n)| O(1)||57.2%|
+|0090|Subsets II|[Go]({{< relref "/ChapterFour/0001~0099/0090.Subsets-II.md" >}})|Medium| O(n^2)| O(n)|❤️|55.9%|
+|0093|Restore IP Addresses|[Go]({{< relref "/ChapterFour/0001~0099/0093.Restore-IP-Addresses.md" >}})|Medium| O(n)| O(n)|❤️|47.4%|
+|0095|Unique Binary Search Trees II|[Go]({{< relref "/ChapterFour/0001~0099/0095.Unique-Binary-Search-Trees-II.md" >}})|Medium||||52.4%|
+|0113|Path Sum II|[Go]({{< relref "/ChapterFour/0100~0199/0113.Path-Sum-II.md" >}})|Medium||||57.1%|
+|0126|Word Ladder II|[Go]({{< relref "/ChapterFour/0100~0199/0126.Word-Ladder-II.md" >}})|Hard| O(n)| O(n^2)|❤️|27.5%|
+|0131|Palindrome Partitioning|[Go]({{< relref "/ChapterFour/0100~0199/0131.Palindrome-Partitioning.md" >}})|Medium| O(n)| O(n^2)|❤️|64.9%|
+|0212|Word Search II|[Go]({{< relref "/ChapterFour/0200~0299/0212.Word-Search-II.md" >}})|Hard| O(n^2)| O(n^2)|❤️|36.4%|
+|0216|Combination Sum III|[Go]({{< relref "/ChapterFour/0200~0299/0216.Combination-Sum-III.md" >}})|Medium| O(n)| O(1)|❤️|67.6%|
+|0257|Binary Tree Paths|[Go]({{< relref "/ChapterFour/0200~0299/0257.Binary-Tree-Paths.md" >}})|Easy||||61.4%|
+|0301|Remove Invalid Parentheses|[Go]({{< relref "/ChapterFour/0300~0399/0301.Remove-Invalid-Parentheses.md" >}})|Hard||||47.2%|
+|0306|Additive Number|[Go]({{< relref "/ChapterFour/0300~0399/0306.Additive-Number.md" >}})|Medium| O(n^2)| O(1)|❤️|31.1%|
+|0357|Count Numbers with Unique Digits|[Go]({{< relref "/ChapterFour/0300~0399/0357.Count-Numbers-with-Unique-Digits.md" >}})|Medium| O(1)| O(1)||51.9%|
+|0401|Binary Watch|[Go]({{< relref "/ChapterFour/0400~0499/0401.Binary-Watch.md" >}})|Easy| O(1)| O(1)||52.3%|
+|0473|Matchsticks to Square|[Go]({{< relref "/ChapterFour/0400~0499/0473.Matchsticks-to-Square.md" >}})|Medium||||40.2%|
+|0491|Non-decreasing Subsequences|[Go]({{< relref "/ChapterFour/0400~0499/0491.Non-decreasing-Subsequences.md" >}})|Medium||||60.2%|
+|0494|Target Sum|[Go]({{< relref "/ChapterFour/0400~0499/0494.Target-Sum.md" >}})|Medium||||45.7%|
+|0526|Beautiful Arrangement|[Go]({{< relref "/ChapterFour/0500~0599/0526.Beautiful-Arrangement.md" >}})|Medium| O(n^2)| O(1)|❤️|64.4%|
+|0638|Shopping Offers|[Go]({{< relref "/ChapterFour/0600~0699/0638.Shopping-Offers.md" >}})|Medium||||53.3%|
+|0784|Letter Case Permutation|[Go]({{< relref "/ChapterFour/0700~0799/0784.Letter-Case-Permutation.md" >}})|Medium| O(n)| O(n)||73.8%|
+|0816|Ambiguous Coordinates|[Go]({{< relref "/ChapterFour/0800~0899/0816.Ambiguous-Coordinates.md" >}})|Medium||||56.4%|
+|0842|Split Array into Fibonacci Sequence|[Go]({{< relref "/ChapterFour/0800~0899/0842.Split-Array-into-Fibonacci-Sequence.md" >}})|Medium| O(n^2)| O(1)|❤️|38.4%|
+|0980|Unique Paths III|[Go]({{< relref "/ChapterFour/0900~0999/0980.Unique-Paths-III.md" >}})|Hard| O(n log n)| O(n)||81.7%|
+|0996|Number of Squareful Arrays|[Go]({{< relref "/ChapterFour/0900~0999/0996.Number-of-Squareful-Arrays.md" >}})|Hard| O(n log n)| O(n) ||49.2%|
+|1079|Letter Tile Possibilities|[Go]({{< relref "/ChapterFour/1000~1099/1079.Letter-Tile-Possibilities.md" >}})|Medium| O(n^2)| O(1)|❤️|76.0%|
+|1239|Maximum Length of a Concatenated String with Unique Characters|[Go]({{< relref "/ChapterFour/1200~1299/1239.Maximum-Length-of-a-Concatenated-String-with-Unique-Characters.md" >}})|Medium||||52.2%|
+|1655|Distribute Repeating Integers|[Go]({{< relref "/ChapterFour/1600~1699/1655.Distribute-Repeating-Integers.md" >}})|Hard||||39.3%|
+|------------|-------------------------------------------------------|-------| ----------------| ---------------|-------------|-------------|-------------|
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterTwo/Dynamic_Programming/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterTwo/Depth_First_Search/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterTwo/Binary_Indexed_Tree.md b/website/content/ChapterTwo/Binary_Indexed_Tree.md
index 7fbc2dfca..6a988987e 100644
--- a/website/content/ChapterTwo/Binary_Indexed_Tree.md
+++ b/website/content/ChapterTwo/Binary_Indexed_Tree.md
@@ -1,8 +1,27 @@
---
-title: Binary Indexed Tree
+title: 2.19 ✅ Binary Indexed Tree
type: docs
+weight: 19
---
# Binary Indexed Tree
+
+| No. | Title | Solution | Difficulty | TimeComplexity | SpaceComplexity |Favorite| Acceptance |
+|:--------:|:------- | :--------: | :----------: | :----: | :-----: | :-----: |:-----: |
+|0218|The Skyline Problem|[Go]({{< relref "/ChapterFour/0200~0299/0218.The-Skyline-Problem.md" >}})|Hard||||41.9%|
+|0307|Range Sum Query - Mutable|[Go]({{< relref "/ChapterFour/0300~0399/0307.Range-Sum-Query-Mutable.md" >}})|Medium||||40.7%|
+|0315|Count of Smaller Numbers After Self|[Go]({{< relref "/ChapterFour/0300~0399/0315.Count-of-Smaller-Numbers-After-Self.md" >}})|Hard||||42.6%|
+|0327|Count of Range Sum|[Go]({{< relref "/ChapterFour/0300~0399/0327.Count-of-Range-Sum.md" >}})|Hard||||35.8%|
+|0493|Reverse Pairs|[Go]({{< relref "/ChapterFour/0400~0499/0493.Reverse-Pairs.md" >}})|Hard||||30.9%|
+|1157|Online Majority Element In Subarray|[Go]({{< relref "/ChapterFour/1100~1199/1157.Online-Majority-Element-In-Subarray.md" >}})|Hard||||41.8%|
+|1649|Create Sorted Array through Instructions|[Go]({{< relref "/ChapterFour/1600~1699/1649.Create-Sorted-Array-through-Instructions.md" >}})|Hard||||37.5%|
+|------------|-------------------------------------------------------|-------| ----------------| ---------------|-------------|-------------|-------------|
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterTwo/Segment_Tree/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterThree/">下一章➡️</a></p>
+</div>
diff --git a/website/content/ChapterTwo/Binary_Search.md b/website/content/ChapterTwo/Binary_Search.md
index 2c71c30df..bbfa80272 100644
--- a/website/content/ChapterTwo/Binary_Search.md
+++ b/website/content/ChapterTwo/Binary_Search.md
@@ -1,6 +1,7 @@
---
-title: Binary Search
+title: 2.11 Binary Search
type: docs
+weight: 11
---
# Binary Search
@@ -127,19 +128,98 @@ func peakIndexInMountainArray(A []int) int {
- max-min 最大值最小化问题。求在最小满足条件的情况下的最大值。第 410 题，第 875 题，第 1011 题，第 1283 题。
-| Title | Solution | Difficulty | Time | Space |收藏|
-| ----- | :--------: | :----------: | :----: | :-----: | :-----: |
-|50. Pow(x, n) | [Go]({{< relref "/ChapterFour/0050.Powx-n.md" >}})| Medium | O(log n)| O(1)||
-|69. Sqrt(x) | [Go]({{< relref "/ChapterFour/0069.Sqrtx.md" >}})| Easy | O(log 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)||
-|222. Count Complete Tree Nodes | [Go]({{< relref "/ChapterFour/0222.Count-Complete-Tree-Nodes.md" >}})| Medium | 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)||
-|287. Find the Duplicate Number | [Go]({{< relref "/ChapterFour/0287.Find-the-Duplicate-Number.md" >}})| Easy | O(n)| O(1)|❤️|
-|300. Longest Increasing Subsequence | [Go]({{< relref "/ChapterFour/0300.Longest-Increasing-Subsequence.md" >}})| Medium | O(n log 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) ||
-|392. Is Subsequence | [Go]({{< relref "/ChapterFour/0392.Is-Subsequence.md" >}})| Medium | O(n)| O(1)||
-|454. 4Sum II | [Go]({{< relref "/ChapterFour/0454.4Sum-II.md" >}})| Medium | O(n^2)| O(n) ||
-|710. Random Pick with Blacklist | [Go]({{< relref "/ChapterFour/0710.Random-Pick-with-Blacklist.md" >}})| Hard | O(n)| O(n) ||
-|-----------------------------------------------|---------------------------------|--------------------------|-----------------------|-----------|--------|
\ No newline at end of file
+
+| No. | Title | Solution | Difficulty | TimeComplexity | SpaceComplexity |Favorite| Acceptance |
+|:--------:|:------- | :--------: | :----------: | :----: | :-----: | :-----: |:-----: |
+|0004|Median of Two Sorted Arrays|[Go]({{< relref "/ChapterFour/0001~0099/0004.Median-of-Two-Sorted-Arrays.md" >}})|Hard||||36.2%|
+|0033|Search in Rotated Sorted Array|[Go]({{< relref "/ChapterFour/0001~0099/0033.Search-in-Rotated-Sorted-Array.md" >}})|Medium||||39.0%|
+|0034|Find First and Last Position of Element in Sorted Array|[Go]({{< relref "/ChapterFour/0001~0099/0034.Find-First-and-Last-Position-of-Element-in-Sorted-Array.md" >}})|Medium||||41.9%|
+|0035|Search Insert Position|[Go]({{< relref "/ChapterFour/0001~0099/0035.Search-Insert-Position.md" >}})|Easy||||43.4%|
+|0069|Sqrt(x)|[Go]({{< relref "/ChapterFour/0001~0099/0069.Sqrtx.md" >}})|Easy| O(log n)| O(1)||37.4%|
+|0074|Search a 2D Matrix|[Go]({{< relref "/ChapterFour/0001~0099/0074.Search-a-2D-Matrix.md" >}})|Medium||||47.7%|
+|0081|Search in Rotated Sorted Array II|[Go]({{< relref "/ChapterFour/0001~0099/0081.Search-in-Rotated-Sorted-Array-II.md" >}})|Medium||||35.7%|
+|0153|Find Minimum in Rotated Sorted Array|[Go]({{< relref "/ChapterFour/0100~0199/0153.Find-Minimum-in-Rotated-Sorted-Array.md" >}})|Medium||||48.9%|
+|0154|Find Minimum in Rotated Sorted Array II|[Go]({{< relref "/ChapterFour/0100~0199/0154.Find-Minimum-in-Rotated-Sorted-Array-II.md" >}})|Hard||||43.5%|
+|0162|Find Peak Element|[Go]({{< relref "/ChapterFour/0100~0199/0162.Find-Peak-Element.md" >}})|Medium||||46.0%|
+|0167|Two Sum II - Input Array Is Sorted|[Go]({{< relref "/ChapterFour/0100~0199/0167.Two-Sum-II-Input-Array-Is-Sorted.md" >}})|Medium| O(n)| O(1)||60.0%|
+|0209|Minimum Size Subarray Sum|[Go]({{< relref "/ChapterFour/0200~0299/0209.Minimum-Size-Subarray-Sum.md" >}})|Medium| O(n)| O(1)||45.0%|
+|0222|Count Complete Tree Nodes|[Go]({{< relref "/ChapterFour/0200~0299/0222.Count-Complete-Tree-Nodes.md" >}})|Medium| O(n)| O(1)||60.6%|
+|0240|Search a 2D Matrix II|[Go]({{< relref "/ChapterFour/0200~0299/0240.Search-a-2D-Matrix-II.md" >}})|Medium||||51.0%|
+|0268|Missing Number|[Go]({{< relref "/ChapterFour/0200~0299/0268.Missing-Number.md" >}})|Easy||||62.6%|
+|0275|H-Index II|[Go]({{< relref "/ChapterFour/0200~0299/0275.H-Index-II.md" >}})|Medium||||37.5%|
+|0278|First Bad Version|[Go]({{< relref "/ChapterFour/0200~0299/0278.First-Bad-Version.md" >}})|Easy||||43.3%|
+|0287|Find the Duplicate Number|[Go]({{< relref "/ChapterFour/0200~0299/0287.Find-the-Duplicate-Number.md" >}})|Medium| O(n)| O(1)|❤️|59.1%|
+|0300|Longest Increasing Subsequence|[Go]({{< relref "/ChapterFour/0300~0399/0300.Longest-Increasing-Subsequence.md" >}})|Medium| O(n log n)| O(n)||52.2%|
+|0315|Count of Smaller Numbers After Self|[Go]({{< relref "/ChapterFour/0300~0399/0315.Count-of-Smaller-Numbers-After-Self.md" >}})|Hard||||42.6%|
+|0327|Count of Range Sum|[Go]({{< relref "/ChapterFour/0300~0399/0327.Count-of-Range-Sum.md" >}})|Hard||||35.8%|
+|0349|Intersection of Two Arrays|[Go]({{< relref "/ChapterFour/0300~0399/0349.Intersection-of-Two-Arrays.md" >}})|Easy| O(n)| O(n) ||70.9%|
+|0350|Intersection of Two Arrays II|[Go]({{< relref "/ChapterFour/0300~0399/0350.Intersection-of-Two-Arrays-II.md" >}})|Easy| O(n)| O(n) ||56.0%|
+|0352|Data Stream as Disjoint Intervals|[Go]({{< relref "/ChapterFour/0300~0399/0352.Data-Stream-as-Disjoint-Intervals.md" >}})|Hard||||59.7%|
+|0354|Russian Doll Envelopes|[Go]({{< relref "/ChapterFour/0300~0399/0354.Russian-Doll-Envelopes.md" >}})|Hard||||37.9%|
+|0367|Valid Perfect Square|[Go]({{< relref "/ChapterFour/0300~0399/0367.Valid-Perfect-Square.md" >}})|Easy||||43.3%|
+|0374|Guess Number Higher or Lower|[Go]({{< relref "/ChapterFour/0300~0399/0374.Guess-Number-Higher-or-Lower.md" >}})|Easy||||51.9%|
+|0378|Kth Smallest Element in a Sorted Matrix|[Go]({{< relref "/ChapterFour/0300~0399/0378.Kth-Smallest-Element-in-a-Sorted-Matrix.md" >}})|Medium||||61.8%|
+|0400|Nth Digit|[Go]({{< relref "/ChapterFour/0400~0499/0400.Nth-Digit.md" >}})|Medium||||34.1%|
+|0410|Split Array Largest Sum|[Go]({{< relref "/ChapterFour/0400~0499/0410.Split-Array-Largest-Sum.md" >}})|Hard||||53.5%|
+|0436|Find Right Interval|[Go]({{< relref "/ChapterFour/0400~0499/0436.Find-Right-Interval.md" >}})|Medium||||50.8%|
+|0441|Arranging Coins|[Go]({{< relref "/ChapterFour/0400~0499/0441.Arranging-Coins.md" >}})|Easy||||46.2%|
+|0456|132 Pattern|[Go]({{< relref "/ChapterFour/0400~0499/0456.132-Pattern.md" >}})|Medium||||32.4%|
+|0475|Heaters|[Go]({{< relref "/ChapterFour/0400~0499/0475.Heaters.md" >}})|Medium||||36.5%|
+|0483|Smallest Good Base|[Go]({{< relref "/ChapterFour/0400~0499/0483.Smallest-Good-Base.md" >}})|Hard||||38.8%|
+|0493|Reverse Pairs|[Go]({{< relref "/ChapterFour/0400~0499/0493.Reverse-Pairs.md" >}})|Hard||||30.9%|
+|0497|Random Point in Non-overlapping Rectangles|[Go]({{< relref "/ChapterFour/0400~0499/0497.Random-Point-in-Non-overlapping-Rectangles.md" >}})|Medium||||39.4%|
+|0528|Random Pick with Weight|[Go]({{< relref "/ChapterFour/0500~0599/0528.Random-Pick-with-Weight.md" >}})|Medium||||46.1%|
+|0532|K-diff Pairs in an Array|[Go]({{< relref "/ChapterFour/0500~0599/0532.K-diff-Pairs-in-an-Array.md" >}})|Medium||||41.2%|
+|0540|Single Element in a Sorted Array|[Go]({{< relref "/ChapterFour/0500~0599/0540.Single-Element-in-a-Sorted-Array.md" >}})|Medium||||59.1%|
+|0611|Valid Triangle Number|[Go]({{< relref "/ChapterFour/0600~0699/0611.Valid-Triangle-Number.md" >}})|Medium||||50.6%|
+|0633|Sum of Square Numbers|[Go]({{< relref "/ChapterFour/0600~0699/0633.Sum-of-Square-Numbers.md" >}})|Medium||||34.4%|
+|0658|Find K Closest Elements|[Go]({{< relref "/ChapterFour/0600~0699/0658.Find-K-Closest-Elements.md" >}})|Medium||||46.8%|
+|0668|Kth Smallest Number in Multiplication Table|[Go]({{< relref "/ChapterFour/0600~0699/0668.Kth-Smallest-Number-in-Multiplication-Table.md" >}})|Hard||||51.4%|
+|0704|Binary Search|[Go]({{< relref "/ChapterFour/0700~0799/0704.Binary-Search.md" >}})|Easy||||56.1%|
+|0710|Random Pick with Blacklist|[Go]({{< relref "/ChapterFour/0700~0799/0710.Random-Pick-with-Blacklist.md" >}})|Hard| O(n)| O(n) ||33.5%|
+|0718|Maximum Length of Repeated Subarray|[Go]({{< relref "/ChapterFour/0700~0799/0718.Maximum-Length-of-Repeated-Subarray.md" >}})|Medium||||51.3%|
+|0719|Find K-th Smallest Pair Distance|[Go]({{< relref "/ChapterFour/0700~0799/0719.Find-K-th-Smallest-Pair-Distance.md" >}})|Hard||||36.7%|
+|0729|My Calendar I|[Go]({{< relref "/ChapterFour/0700~0799/0729.My-Calendar-I.md" >}})|Medium||||56.8%|
+|0732|My Calendar III|[Go]({{< relref "/ChapterFour/0700~0799/0732.My-Calendar-III.md" >}})|Hard||||71.5%|
+|0744|Find Smallest Letter Greater Than Target|[Go]({{< relref "/ChapterFour/0700~0799/0744.Find-Smallest-Letter-Greater-Than-Target.md" >}})|Easy||||45.8%|
+|0778|Swim in Rising Water|[Go]({{< relref "/ChapterFour/0700~0799/0778.Swim-in-Rising-Water.md" >}})|Hard||||59.8%|
+|0786|K-th Smallest Prime Fraction|[Go]({{< relref "/ChapterFour/0700~0799/0786.K-th-Smallest-Prime-Fraction.md" >}})|Medium||||51.7%|
+|0793|Preimage Size of Factorial Zeroes Function|[Go]({{< relref "/ChapterFour/0700~0799/0793.Preimage-Size-of-Factorial-Zeroes-Function.md" >}})|Hard||||43.2%|
+|0825|Friends Of Appropriate Ages|[Go]({{< relref "/ChapterFour/0800~0899/0825.Friends-Of-Appropriate-Ages.md" >}})|Medium||||46.3%|
+|0826|Most Profit Assigning Work|[Go]({{< relref "/ChapterFour/0800~0899/0826.Most-Profit-Assigning-Work.md" >}})|Medium||||44.9%|
+|0852|Peak Index in a Mountain Array|[Go]({{< relref "/ChapterFour/0800~0899/0852.Peak-Index-in-a-Mountain-Array.md" >}})|Medium||||69.0%|
+|0862|Shortest Subarray with Sum at Least K|[Go]({{< relref "/ChapterFour/0800~0899/0862.Shortest-Subarray-with-Sum-at-Least-K.md" >}})|Hard||||26.0%|
+|0875|Koko Eating Bananas|[Go]({{< relref "/ChapterFour/0800~0899/0875.Koko-Eating-Bananas.md" >}})|Medium||||52.1%|
+|0878|Nth Magical Number|[Go]({{< relref "/ChapterFour/0800~0899/0878.Nth-Magical-Number.md" >}})|Hard||||35.4%|
+|0887|Super Egg Drop|[Go]({{< relref "/ChapterFour/0800~0899/0887.Super-Egg-Drop.md" >}})|Hard||||27.1%|
+|0888|Fair Candy Swap|[Go]({{< relref "/ChapterFour/0800~0899/0888.Fair-Candy-Swap.md" >}})|Easy||||60.7%|
+|0911|Online Election|[Go]({{< relref "/ChapterFour/0900~0999/0911.Online-Election.md" >}})|Medium||||52.2%|
+|0981|Time Based Key-Value Store|[Go]({{< relref "/ChapterFour/0900~0999/0981.Time-Based-Key-Value-Store.md" >}})|Medium||||52.2%|
+|1004|Max Consecutive Ones III|[Go]({{< relref "/ChapterFour/1000~1099/1004.Max-Consecutive-Ones-III.md" >}})|Medium||||63.2%|
+|1011|Capacity To Ship Packages Within D Days|[Go]({{< relref "/ChapterFour/1000~1099/1011.Capacity-To-Ship-Packages-Within-D-Days.md" >}})|Medium||||67.7%|
+|1157|Online Majority Element In Subarray|[Go]({{< relref "/ChapterFour/1100~1199/1157.Online-Majority-Element-In-Subarray.md" >}})|Hard||||41.8%|
+|1170|Compare Strings by Frequency of the Smallest Character|[Go]({{< relref "/ChapterFour/1100~1199/1170.Compare-Strings-by-Frequency-of-the-Smallest-Character.md" >}})|Medium||||61.5%|
+|1201|Ugly Number III|[Go]({{< relref "/ChapterFour/1200~1299/1201.Ugly-Number-III.md" >}})|Medium||||28.9%|
+|1208|Get Equal Substrings Within Budget|[Go]({{< relref "/ChapterFour/1200~1299/1208.Get-Equal-Substrings-Within-Budget.md" >}})|Medium||||48.6%|
+|1235|Maximum Profit in Job Scheduling|[Go]({{< relref "/ChapterFour/1200~1299/1235.Maximum-Profit-in-Job-Scheduling.md" >}})|Hard||||53.4%|
+|1283|Find the Smallest Divisor Given a Threshold|[Go]({{< relref "/ChapterFour/1200~1299/1283.Find-the-Smallest-Divisor-Given-a-Threshold.md" >}})|Medium||||56.2%|
+|1300|Sum of Mutated Array Closest to Target|[Go]({{< relref "/ChapterFour/1300~1399/1300.Sum-of-Mutated-Array-Closest-to-Target.md" >}})|Medium||||43.6%|
+|1337|The K Weakest Rows in a Matrix|[Go]({{< relref "/ChapterFour/1300~1399/1337.The-K-Weakest-Rows-in-a-Matrix.md" >}})|Easy||||72.1%|
+|1385|Find the Distance Value Between Two Arrays|[Go]({{< relref "/ChapterFour/1300~1399/1385.Find-the-Distance-Value-Between-Two-Arrays.md" >}})|Easy||||66.6%|
+|1439|Find the Kth Smallest Sum of a Matrix With Sorted Rows|[Go]({{< relref "/ChapterFour/1400~1499/1439.Find-the-Kth-Smallest-Sum-of-a-Matrix-With-Sorted-Rows.md" >}})|Hard||||61.4%|
+|1482|Minimum Number of Days to Make m Bouquets|[Go]({{< relref "/ChapterFour/1400~1499/1482.Minimum-Number-of-Days-to-Make-m-Bouquets.md" >}})|Medium||||54.0%|
+|1539|Kth Missing Positive Number|[Go]({{< relref "/ChapterFour/1500~1599/1539.Kth-Missing-Positive-Number.md" >}})|Easy||||58.6%|
+|1608|Special Array With X Elements Greater Than or Equal X|[Go]({{< relref "/ChapterFour/1600~1699/1608.Special-Array-With-X-Elements-Greater-Than-or-Equal-X.md" >}})|Easy||||60.5%|
+|1631|Path With Minimum Effort|[Go]({{< relref "/ChapterFour/1600~1699/1631.Path-With-Minimum-Effort.md" >}})|Medium||||55.7%|
+|1648|Sell Diminishing-Valued Colored Balls|[Go]({{< relref "/ChapterFour/1600~1699/1648.Sell-Diminishing-Valued-Colored-Balls.md" >}})|Medium||||30.4%|
+|1649|Create Sorted Array through Instructions|[Go]({{< relref "/ChapterFour/1600~1699/1649.Create-Sorted-Array-through-Instructions.md" >}})|Hard||||37.5%|
+|1658|Minimum Operations to Reduce X to Zero|[Go]({{< relref "/ChapterFour/1600~1699/1658.Minimum-Operations-to-Reduce-X-to-Zero.md" >}})|Medium||||37.6%|
+|1818|Minimum Absolute Sum Difference|[Go]({{< relref "/ChapterFour/1800~1899/1818.Minimum-Absolute-Sum-Difference.md" >}})|Medium||||30.4%|
+|------------|-------------------------------------------------------|-------| ----------------| ---------------|-------------|-------------|-------------|
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterTwo/Breadth_First_Search/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterTwo/Math/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterTwo/Bit_Manipulation.md b/website/content/ChapterTwo/Bit_Manipulation.md
index 4dbc87050..e1c9ac95d 100644
--- a/website/content/ChapterTwo/Bit_Manipulation.md
+++ b/website/content/ChapterTwo/Bit_Manipulation.md
@@ -1,6 +1,7 @@
---
-title: Bit Manipulation
+title: 2.15 ✅ Bit Manipulation
type: docs
+weight: 15
---
# Bit Manipulation
@@ -40,35 +41,73 @@ X & ~X = 0
```
-| Title | Solution | Difficulty | Time | Space | 收藏 |
-| ----- | :--------: | :----------: | :----: | :-----: |:-----: |
-|78. Subsets | [Go]({{< relref "/ChapterFour/0078.Subsets.md" >}})| Medium | O(n^2)| O(n)|❤️|
-|136. Single Number | [Go]({{< relref "/ChapterFour/0136.Single-Number.md" >}})| Easy | O(n)| O(1)||
-|137. Single Number II | [Go]({{< relref "/ChapterFour/0137.Single-Number-II.md" >}})| Medium | O(n)| O(1)|❤️|
-|169. Majority Element | [Go]({{< relref "/ChapterFour/0169.Majority-Element.md" >}})| Easy | O(n)| O(1)|❤️|
-|187. Repeated DNA Sequences | [Go]({{< relref "/ChapterFour/0187.Repeated-DNA-Sequences.md" >}})| Medium | O(n)| O(1)||
-|190. Reverse Bits | [Go]({{< relref "/ChapterFour/0190.Reverse-Bits.md" >}})| Easy | O(n)| O(1)|❤️|
-|191. Number of 1 Bits | [Go]({{< relref "/ChapterFour/0191.Number-of-1-Bits.md" >}})| Easy | O(n)| O(1)||
-|201. Bitwise AND of Numbers Range | [Go]({{< relref "/ChapterFour/0201.Bitwise-AND-of-Numbers-Range.md" >}})| Medium | O(n)| O(1)|❤️|
-|231. Power of Two | [Go]({{< relref "/ChapterFour/0231.Power-of-Two.md" >}})| Easy | O(1)| O(1)||
-|260. Single Number III | [Go]({{< relref "/ChapterFour/0260.Single-Number-III.md" >}})| Medium | O(n)| O(1)|❤️|
-|268. Missing Number | [Go]({{< relref "/ChapterFour/0268.Missing-Number.md" >}})| Easy | O(n)| O(1)||
-|318. Maximum Product of Word Lengths | [Go]({{< relref "/ChapterFour/0318.Maximum-Product-of-Word-Lengths.md" >}})| Medium | O(n)| O(1)||
-|338. Counting Bits | [Go]({{< relref "/ChapterFour/0338.Counting-Bits.md" >}})| Medium | O(n)| O(n)||
-|342. Power of Four | [Go]({{< relref "/ChapterFour/0342.Power-of-Four.md" >}})| Easy | O(n)| O(1)||
-|371. Sum of Two Integers | [Go]({{< relref "/ChapterFour/0371.Sum-of-Two-Integers.md" >}})| Easy | O(n)| O(1)||
-|389. Find the Difference | [Go]({{< relref "/ChapterFour/0389.Find-the-Difference.md" >}})| Easy | O(n)| O(1)||
-|393. UTF-8 Validation | [Go]({{< relref "/ChapterFour/0393.UTF-8-Validation.md" >}})| Medium | O(n)| O(1)||
-|397. Integer Replacement | [Go]({{< relref "/ChapterFour/0397.Integer-Replacement.md" >}})| Medium | O(n)| O(1)||
-|401. Binary Watch | [Go]({{< relref "/ChapterFour/0401.Binary-Watch.md" >}})| Easy | O(1)| O(1)||
-|405. Convert a Number to Hexadecimal | [Go]({{< relref "/ChapterFour/0405.Convert-a-Number-to-Hexadecimal.md" >}})| Easy | O(n)| O(1)||
-|421. Maximum XOR of Two Numbers in an Array | [Go]({{< relref "/ChapterFour/0421.Maximum-XOR-of-Two-Numbers-in-an-Array.md" >}})| Medium | O(n)| O(1)|❤️|
-|461. Hamming Distance | [Go]({{< relref "/ChapterFour/0461.Hamming-Distance.md" >}})| Easy | O(n)| O(1)||
-|476. Number Complement | [Go]({{< relref "/ChapterFour/0476.Number-Complement.md" >}})| Easy | O(n)| O(1)||
-|477. Total Hamming Distance | [Go]({{< relref "/ChapterFour/0477.Total-Hamming-Distance.md" >}})| Medium | O(n)| O(1)||
-|693. Binary Number with Alternating Bits | [Go]({{< relref "/ChapterFour/0693.Binary-Number-with-Alternating-Bits.md" >}})| Easy | O(n)| O(1)|❤️|
-|756. Pyramid Transition Matrix | [Go]({{< relref "/ChapterFour/0756.Pyramid-Transition-Matrix.md" >}})| Medium | O(n log n)| O(n)||
-|762. Prime Number of Set Bits in Binary Representation | [Go]({{< relref "/ChapterFour/0762.Prime-Number-of-Set-Bits-in-Binary-Representation.md" >}})| Easy | O(n)| O(1)||
-|784. Letter Case Permutation | [Go]({{< relref "/ChapterFour/0784.Letter-Case-Permutation.md" >}})| Easy | O(n)| O(1)||
-|898. Bitwise ORs of Subarrays | [Go]({{< relref "/ChapterFour/0898.Bitwise-ORs-of-Subarrays.md" >}})| Medium | O(n)| O(1)||
-|---------------------------------------|---------------------------------|--------------------------|-----------------------|-----------|--------|
\ No newline at end of file
+
+| No. | Title | Solution | Difficulty | TimeComplexity | SpaceComplexity |Favorite| Acceptance |
+|:--------:|:------- | :--------: | :----------: | :----: | :-----: | :-----: |:-----: |
+|0029|Divide Two Integers|[Go]({{< relref "/ChapterFour/0001~0099/0029.Divide-Two-Integers.md" >}})|Medium||||17.2%|
+|0067|Add Binary|[Go]({{< relref "/ChapterFour/0001~0099/0067.Add-Binary.md" >}})|Easy||||52.4%|
+|0078|Subsets|[Go]({{< relref "/ChapterFour/0001~0099/0078.Subsets.md" >}})|Medium| O(n^2)| O(n)|❤️|74.9%|
+|0089|Gray Code|[Go]({{< relref "/ChapterFour/0001~0099/0089.Gray-Code.md" >}})|Medium||||57.2%|
+|0090|Subsets II|[Go]({{< relref "/ChapterFour/0001~0099/0090.Subsets-II.md" >}})|Medium||||55.9%|
+|0136|Single Number|[Go]({{< relref "/ChapterFour/0100~0199/0136.Single-Number.md" >}})|Easy| O(n)| O(1)||70.7%|
+|0137|Single Number II|[Go]({{< relref "/ChapterFour/0100~0199/0137.Single-Number-II.md" >}})|Medium| O(n)| O(1)|❤️|58.5%|
+|0187|Repeated DNA Sequences|[Go]({{< relref "/ChapterFour/0100~0199/0187.Repeated-DNA-Sequences.md" >}})|Medium| O(n)| O(1)||47.0%|
+|0190|Reverse Bits|[Go]({{< relref "/ChapterFour/0100~0199/0190.Reverse-Bits.md" >}})|Easy| O(n)| O(1)|❤️|54.0%|
+|0191|Number of 1 Bits|[Go]({{< relref "/ChapterFour/0100~0199/0191.Number-of-1-Bits.md" >}})|Easy| O(n)| O(1)||66.6%|
+|0201|Bitwise AND of Numbers Range|[Go]({{< relref "/ChapterFour/0200~0299/0201.Bitwise-AND-of-Numbers-Range.md" >}})|Medium| O(n)| O(1)|❤️|42.5%|
+|0231|Power of Two|[Go]({{< relref "/ChapterFour/0200~0299/0231.Power-of-Two.md" >}})|Easy| O(1)| O(1)||46.0%|
+|0260|Single Number III|[Go]({{< relref "/ChapterFour/0200~0299/0260.Single-Number-III.md" >}})|Medium| O(n)| O(1)|❤️|67.7%|
+|0268|Missing Number|[Go]({{< relref "/ChapterFour/0200~0299/0268.Missing-Number.md" >}})|Easy| O(n)| O(1)||62.6%|
+|0287|Find the Duplicate Number|[Go]({{< relref "/ChapterFour/0200~0299/0287.Find-the-Duplicate-Number.md" >}})|Medium||||59.1%|
+|0318|Maximum Product of Word Lengths|[Go]({{< relref "/ChapterFour/0300~0399/0318.Maximum-Product-of-Word-Lengths.md" >}})|Medium| O(n)| O(1)||59.9%|
+|0338|Counting Bits|[Go]({{< relref "/ChapterFour/0300~0399/0338.Counting-Bits.md" >}})|Easy| O(n)| O(n)||75.8%|
+|0342|Power of Four|[Go]({{< relref "/ChapterFour/0300~0399/0342.Power-of-Four.md" >}})|Easy| O(n)| O(1)||46.2%|
+|0371|Sum of Two Integers|[Go]({{< relref "/ChapterFour/0300~0399/0371.Sum-of-Two-Integers.md" >}})|Medium| O(n)| O(1)||50.7%|
+|0389|Find the Difference|[Go]({{< relref "/ChapterFour/0300~0399/0389.Find-the-Difference.md" >}})|Easy| O(n)| O(1)||59.9%|
+|0393|UTF-8 Validation|[Go]({{< relref "/ChapterFour/0300~0399/0393.UTF-8-Validation.md" >}})|Medium| O(n)| O(1)||45.1%|
+|0397|Integer Replacement|[Go]({{< relref "/ChapterFour/0300~0399/0397.Integer-Replacement.md" >}})|Medium| O(n)| O(1)||35.2%|
+|0401|Binary Watch|[Go]({{< relref "/ChapterFour/0400~0499/0401.Binary-Watch.md" >}})|Easy| O(1)| O(1)||52.3%|
+|0405|Convert a Number to Hexadecimal|[Go]({{< relref "/ChapterFour/0400~0499/0405.Convert-a-Number-to-Hexadecimal.md" >}})|Easy| O(n)| O(1)||46.8%|
+|0421|Maximum XOR of Two Numbers in an Array|[Go]({{< relref "/ChapterFour/0400~0499/0421.Maximum-XOR-of-Two-Numbers-in-an-Array.md" >}})|Medium| O(n)| O(1)|❤️|54.0%|
+|0461|Hamming Distance|[Go]({{< relref "/ChapterFour/0400~0499/0461.Hamming-Distance.md" >}})|Easy| O(n)| O(1)||75.0%|
+|0473|Matchsticks to Square|[Go]({{< relref "/ChapterFour/0400~0499/0473.Matchsticks-to-Square.md" >}})|Medium||||40.2%|
+|0476|Number Complement|[Go]({{< relref "/ChapterFour/0400~0499/0476.Number-Complement.md" >}})|Easy| O(n)| O(1)||67.4%|
+|0477|Total Hamming Distance|[Go]({{< relref "/ChapterFour/0400~0499/0477.Total-Hamming-Distance.md" >}})|Medium| O(n)| O(1)||52.2%|
+|0491|Non-decreasing Subsequences|[Go]({{< relref "/ChapterFour/0400~0499/0491.Non-decreasing-Subsequences.md" >}})|Medium||||60.2%|
+|0526|Beautiful Arrangement|[Go]({{< relref "/ChapterFour/0500~0599/0526.Beautiful-Arrangement.md" >}})|Medium||||64.4%|
+|0638|Shopping Offers|[Go]({{< relref "/ChapterFour/0600~0699/0638.Shopping-Offers.md" >}})|Medium||||53.3%|
+|0645|Set Mismatch|[Go]({{< relref "/ChapterFour/0600~0699/0645.Set-Mismatch.md" >}})|Easy||||42.7%|
+|0693|Binary Number with Alternating Bits|[Go]({{< relref "/ChapterFour/0600~0699/0693.Binary-Number-with-Alternating-Bits.md" >}})|Easy| O(n)| O(1)|❤️|61.6%|
+|0756|Pyramid Transition Matrix|[Go]({{< relref "/ChapterFour/0700~0799/0756.Pyramid-Transition-Matrix.md" >}})|Medium| O(n log n)| O(n)||52.7%|
+|0762|Prime Number of Set Bits in Binary Representation|[Go]({{< relref "/ChapterFour/0700~0799/0762.Prime-Number-of-Set-Bits-in-Binary-Representation.md" >}})|Easy| O(n)| O(1)||68.0%|
+|0784|Letter Case Permutation|[Go]({{< relref "/ChapterFour/0700~0799/0784.Letter-Case-Permutation.md" >}})|Medium| O(n)| O(1)||73.8%|
+|0810|Chalkboard XOR Game|[Go]({{< relref "/ChapterFour/0800~0899/0810.Chalkboard-XOR-Game.md" >}})|Hard||||55.8%|
+|0864|Shortest Path to Get All Keys|[Go]({{< relref "/ChapterFour/0800~0899/0864.Shortest-Path-to-Get-All-Keys.md" >}})|Hard||||45.6%|
+|0898|Bitwise ORs of Subarrays|[Go]({{< relref "/ChapterFour/0800~0899/0898.Bitwise-ORs-of-Subarrays.md" >}})|Medium| O(n)| O(1)||37.2%|
+|0980|Unique Paths III|[Go]({{< relref "/ChapterFour/0900~0999/0980.Unique-Paths-III.md" >}})|Hard||||81.7%|
+|0995|Minimum Number of K Consecutive Bit Flips|[Go]({{< relref "/ChapterFour/0900~0999/0995.Minimum-Number-of-K-Consecutive-Bit-Flips.md" >}})|Hard||||51.2%|
+|0996|Number of Squareful Arrays|[Go]({{< relref "/ChapterFour/0900~0999/0996.Number-of-Squareful-Arrays.md" >}})|Hard||||49.2%|
+|1009|Complement of Base 10 Integer|[Go]({{< relref "/ChapterFour/1000~1099/1009.Complement-of-Base-10-Integer.md" >}})|Easy||||61.5%|
+|1178|Number of Valid Words for Each Puzzle|[Go]({{< relref "/ChapterFour/1100~1199/1178.Number-of-Valid-Words-for-Each-Puzzle.md" >}})|Hard||||46.3%|
+|1239|Maximum Length of a Concatenated String with Unique Characters|[Go]({{< relref "/ChapterFour/1200~1299/1239.Maximum-Length-of-a-Concatenated-String-with-Unique-Characters.md" >}})|Medium||||52.2%|
+|1310|XOR Queries of a Subarray|[Go]({{< relref "/ChapterFour/1300~1399/1310.XOR-Queries-of-a-Subarray.md" >}})|Medium||||72.3%|
+|1442|Count Triplets That Can Form Two Arrays of Equal XOR|[Go]({{< relref "/ChapterFour/1400~1499/1442.Count-Triplets-That-Can-Form-Two-Arrays-of-Equal-XOR.md" >}})|Medium||||76.1%|
+|1461|Check If a String Contains All Binary Codes of Size K|[Go]({{< relref "/ChapterFour/1400~1499/1461.Check-If-a-String-Contains-All-Binary-Codes-of-Size-K.md" >}})|Medium||||56.6%|
+|1486|XOR Operation in an Array|[Go]({{< relref "/ChapterFour/1400~1499/1486.XOR-Operation-in-an-Array.md" >}})|Easy||||84.6%|
+|1655|Distribute Repeating Integers|[Go]({{< relref "/ChapterFour/1600~1699/1655.Distribute-Repeating-Integers.md" >}})|Hard||||39.3%|
+|1659|Maximize Grid Happiness|[Go]({{< relref "/ChapterFour/1600~1699/1659.Maximize-Grid-Happiness.md" >}})|Hard||||38.8%|
+|1680|Concatenation of Consecutive Binary Numbers|[Go]({{< relref "/ChapterFour/1600~1699/1680.Concatenation-of-Consecutive-Binary-Numbers.md" >}})|Medium||||57.0%|
+|1681|Minimum Incompatibility|[Go]({{< relref "/ChapterFour/1600~1699/1681.Minimum-Incompatibility.md" >}})|Hard||||37.8%|
+|1684|Count the Number of Consistent Strings|[Go]({{< relref "/ChapterFour/1600~1699/1684.Count-the-Number-of-Consistent-Strings.md" >}})|Easy||||82.3%|
+|1720|Decode XORed Array|[Go]({{< relref "/ChapterFour/1700~1799/1720.Decode-XORed-Array.md" >}})|Easy||||85.8%|
+|1734|Decode XORed Permutation|[Go]({{< relref "/ChapterFour/1700~1799/1734.Decode-XORed-Permutation.md" >}})|Medium||||63.0%|
+|1738|Find Kth Largest XOR Coordinate Value|[Go]({{< relref "/ChapterFour/1700~1799/1738.Find-Kth-Largest-XOR-Coordinate-Value.md" >}})|Medium||||61.0%|
+|1763|Longest Nice Substring|[Go]({{< relref "/ChapterFour/1700~1799/1763.Longest-Nice-Substring.md" >}})|Easy||||61.5%|
+|------------|-------------------------------------------------------|-------| ----------------| ---------------|-------------|-------------|-------------|
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterTwo/Sorting/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterTwo/Union_Find/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterTwo/Breadth_First_Search.md b/website/content/ChapterTwo/Breadth_First_Search.md
index f5ff7c731..631b6dff9 100644
--- a/website/content/ChapterTwo/Breadth_First_Search.md
+++ b/website/content/ChapterTwo/Breadth_First_Search.md
@@ -1,24 +1,99 @@
---
-title: Breadth First Search
+title: 2.10 Breadth First Search
type: docs
+weight: 10
---
# Breadth First Search
-| Title | Solution | Difficulty | Time | Space |收藏|
-| ----- | :--------: | :----------: | :----: | :-----: | :-----: |
-|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)||
-|107. Binary Tree Level Order Traversal II | [Go]({{< relref "/ChapterFour/0107.Binary-Tree-Level-Order-Traversal-II.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)||
-|126. Word Ladder II | [Go]({{< relref "/ChapterFour/0126.Word-Ladder-II.md" >}})| Hard | O(n)| O(n^2)|❤️|
-|127. Word Ladder | [Go]({{< relref "/ChapterFour/0127.Word-Ladder.md" >}})| Medium | O(n)| O(n)||
-|199. Binary Tree Right Side View | [Go]({{< relref "/ChapterFour/0199.Binary-Tree-Right-Side-View.md" >}})| Medium | O(n)| O(1)||
-|200. Number of Islands | [Go]({{< relref "/ChapterFour/0200.Number-of-Islands.md" >}})| Medium | O(n^2)| O(n^2)||
-|207. Course Schedule | [Go]({{< relref "/ChapterFour/0207.Course-Schedule.md" >}})| Medium | O(n^2)| O(n^2)||
-|210. Course Schedule II | [Go]({{< relref "/ChapterFour/0210.Course-Schedule-II.md" >}})| Medium | O(n^2)| O(n^2)||
-|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)||
-|542. 01 Matrix | [Go]({{< relref "/ChapterFour/0542.01-Matrix.md" >}})| Medium | O(n)| O(1)||
-|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
+
+| No. | Title | Solution | Difficulty | TimeComplexity | SpaceComplexity |Favorite| Acceptance |
+|:--------:|:------- | :--------: | :----------: | :----: | :-----: | :-----: |:-----: |
+|0100|Same Tree|[Go]({{< relref "/ChapterFour/0100~0199/0100.Same-Tree.md" >}})|Easy||||58.2%|
+|0101|Symmetric Tree|[Go]({{< relref "/ChapterFour/0100~0199/0101.Symmetric-Tree.md" >}})|Easy| O(n)| O(1)||54.3%|
+|0102|Binary Tree Level Order Traversal|[Go]({{< relref "/ChapterFour/0100~0199/0102.Binary-Tree-Level-Order-Traversal.md" >}})|Medium| O(n)| O(1)||64.4%|
+|0103|Binary Tree Zigzag Level Order Traversal|[Go]({{< relref "/ChapterFour/0100~0199/0103.Binary-Tree-Zigzag-Level-Order-Traversal.md" >}})|Medium| O(n)| O(n)||56.9%|
+|0104|Maximum Depth of Binary Tree|[Go]({{< relref "/ChapterFour/0100~0199/0104.Maximum-Depth-of-Binary-Tree.md" >}})|Easy||||73.9%|
+|0107|Binary Tree Level Order Traversal II|[Go]({{< relref "/ChapterFour/0100~0199/0107.Binary-Tree-Level-Order-Traversal-II.md" >}})|Medium| O(n)| O(1)||61.2%|
+|0111|Minimum Depth of Binary Tree|[Go]({{< relref "/ChapterFour/0100~0199/0111.Minimum-Depth-of-Binary-Tree.md" >}})|Easy| O(n)| O(1)||44.5%|
+|0112|Path Sum|[Go]({{< relref "/ChapterFour/0100~0199/0112.Path-Sum.md" >}})|Easy||||48.3%|
+|0116|Populating Next Right Pointers in Each Node|[Go]({{< relref "/ChapterFour/0100~0199/0116.Populating-Next-Right-Pointers-in-Each-Node.md" >}})|Medium||||60.4%|
+|0126|Word Ladder II|[Go]({{< relref "/ChapterFour/0100~0199/0126.Word-Ladder-II.md" >}})|Hard| O(n)| O(n^2)|❤️|27.5%|
+|0127|Word Ladder|[Go]({{< relref "/ChapterFour/0100~0199/0127.Word-Ladder.md" >}})|Hard| O(n)| O(n)||37.2%|
+|0130|Surrounded Regions|[Go]({{< relref "/ChapterFour/0100~0199/0130.Surrounded-Regions.md" >}})|Medium||||36.8%|
+|0199|Binary Tree Right Side View|[Go]({{< relref "/ChapterFour/0100~0199/0199.Binary-Tree-Right-Side-View.md" >}})|Medium| O(n)| O(1)||61.6%|
+|0200|Number of Islands|[Go]({{< relref "/ChapterFour/0200~0299/0200.Number-of-Islands.md" >}})|Medium| O(n^2)| O(n^2)||57.0%|
+|0207|Course Schedule|[Go]({{< relref "/ChapterFour/0200~0299/0207.Course-Schedule.md" >}})|Medium| O(n^2)| O(n^2)||45.4%|
+|0210|Course Schedule II|[Go]({{< relref "/ChapterFour/0200~0299/0210.Course-Schedule-II.md" >}})|Medium| O(n^2)| O(n^2)||48.5%|
+|0226|Invert Binary Tree|[Go]({{< relref "/ChapterFour/0200~0299/0226.Invert-Binary-Tree.md" >}})|Easy||||74.7%|
+|0279|Perfect Squares|[Go]({{< relref "/ChapterFour/0200~0299/0279.Perfect-Squares.md" >}})|Medium||||52.7%|
+|0297|Serialize and Deserialize Binary Tree|[Go]({{< relref "/ChapterFour/0200~0299/0297.Serialize-and-Deserialize-Binary-Tree.md" >}})|Hard||||55.4%|
+|0301|Remove Invalid Parentheses|[Go]({{< relref "/ChapterFour/0300~0399/0301.Remove-Invalid-Parentheses.md" >}})|Hard||||47.2%|
+|0322|Coin Change|[Go]({{< relref "/ChapterFour/0300~0399/0322.Coin-Change.md" >}})|Medium||||42.1%|
+|0329|Longest Increasing Path in a Matrix|[Go]({{< relref "/ChapterFour/0300~0399/0329.Longest-Increasing-Path-in-a-Matrix.md" >}})|Hard||||52.4%|
+|0399|Evaluate Division|[Go]({{< relref "/ChapterFour/0300~0399/0399.Evaluate-Division.md" >}})|Medium||||59.7%|
+|0404|Sum of Left Leaves|[Go]({{< relref "/ChapterFour/0400~0499/0404.Sum-of-Left-Leaves.md" >}})|Easy||||56.7%|
+|0417|Pacific Atlantic Water Flow|[Go]({{< relref "/ChapterFour/0400~0499/0417.Pacific-Atlantic-Water-Flow.md" >}})|Medium||||54.4%|
+|0429|N-ary Tree Level Order Traversal|[Go]({{< relref "/ChapterFour/0400~0499/0429.N-ary-Tree-Level-Order-Traversal.md" >}})|Medium||||70.7%|
+|0433|Minimum Genetic Mutation|[Go]({{< relref "/ChapterFour/0400~0499/0433.Minimum-Genetic-Mutation.md" >}})|Medium||||52.4%|
+|0463|Island Perimeter|[Go]({{< relref "/ChapterFour/0400~0499/0463.Island-Perimeter.md" >}})|Easy||||69.7%|
+|0488|Zuma Game|[Go]({{< relref "/ChapterFour/0400~0499/0488.Zuma-Game.md" >}})|Hard||||33.9%|
+|0513|Find Bottom Left Tree Value|[Go]({{< relref "/ChapterFour/0500~0599/0513.Find-Bottom-Left-Tree-Value.md" >}})|Medium||||66.9%|
+|0515|Find Largest Value in Each Tree Row|[Go]({{< relref "/ChapterFour/0500~0599/0515.Find-Largest-Value-in-Each-Tree-Row.md" >}})|Medium| O(n)| O(n)||64.6%|
+|0529|Minesweeper|[Go]({{< relref "/ChapterFour/0500~0599/0529.Minesweeper.md" >}})|Medium||||65.7%|
+|0530|Minimum Absolute Difference in BST|[Go]({{< relref "/ChapterFour/0500~0599/0530.Minimum-Absolute-Difference-in-BST.md" >}})|Easy||||57.3%|
+|0542|01 Matrix|[Go]({{< relref "/ChapterFour/0500~0599/0542.01-Matrix.md" >}})|Medium| O(n)| O(1)||44.8%|
+|0547|Number of Provinces|[Go]({{< relref "/ChapterFour/0500~0599/0547.Number-of-Provinces.md" >}})|Medium||||63.8%|
+|0559|Maximum Depth of N-ary Tree|[Go]({{< relref "/ChapterFour/0500~0599/0559.Maximum-Depth-of-N-ary-Tree.md" >}})|Easy||||71.7%|
+|0617|Merge Two Binary Trees|[Go]({{< relref "/ChapterFour/0600~0699/0617.Merge-Two-Binary-Trees.md" >}})|Easy||||78.7%|
+|0623|Add One Row to Tree|[Go]({{< relref "/ChapterFour/0600~0699/0623.Add-One-Row-to-Tree.md" >}})|Medium||||59.5%|
+|0637|Average of Levels in Binary Tree|[Go]({{< relref "/ChapterFour/0600~0699/0637.Average-of-Levels-in-Binary-Tree.md" >}})|Easy||||71.7%|
+|0653|Two Sum IV - Input is a BST|[Go]({{< relref "/ChapterFour/0600~0699/0653.Two-Sum-IV-Input-is-a-BST.md" >}})|Easy||||61.0%|
+|0662|Maximum Width of Binary Tree|[Go]({{< relref "/ChapterFour/0600~0699/0662.Maximum-Width-of-Binary-Tree.md" >}})|Medium||||40.7%|
+|0684|Redundant Connection|[Go]({{< relref "/ChapterFour/0600~0699/0684.Redundant-Connection.md" >}})|Medium||||62.2%|
+|0685|Redundant Connection II|[Go]({{< relref "/ChapterFour/0600~0699/0685.Redundant-Connection-II.md" >}})|Hard||||34.1%|
+|0690|Employee Importance|[Go]({{< relref "/ChapterFour/0600~0699/0690.Employee-Importance.md" >}})|Medium||||65.6%|
+|0695|Max Area of Island|[Go]({{< relref "/ChapterFour/0600~0699/0695.Max-Area-of-Island.md" >}})|Medium||||71.8%|
+|0721|Accounts Merge|[Go]({{< relref "/ChapterFour/0700~0799/0721.Accounts-Merge.md" >}})|Medium||||56.3%|
+|0733|Flood Fill|[Go]({{< relref "/ChapterFour/0700~0799/0733.Flood-Fill.md" >}})|Easy||||62.0%|
+|0752|Open the Lock|[Go]({{< relref "/ChapterFour/0700~0799/0752.Open-the-Lock.md" >}})|Medium||||55.6%|
+|0756|Pyramid Transition Matrix|[Go]({{< relref "/ChapterFour/0700~0799/0756.Pyramid-Transition-Matrix.md" >}})|Medium||||52.7%|
+|0765|Couples Holding Hands|[Go]({{< relref "/ChapterFour/0700~0799/0765.Couples-Holding-Hands.md" >}})|Hard||||56.6%|
+|0778|Swim in Rising Water|[Go]({{< relref "/ChapterFour/0700~0799/0778.Swim-in-Rising-Water.md" >}})|Hard||||59.8%|
+|0783|Minimum Distance Between BST Nodes|[Go]({{< relref "/ChapterFour/0700~0799/0783.Minimum-Distance-Between-BST-Nodes.md" >}})|Easy||||59.3%|
+|0785|Is Graph Bipartite?|[Go]({{< relref "/ChapterFour/0700~0799/0785.Is-Graph-Bipartite.md" >}})|Medium||||53.1%|
+|0802|Find Eventual Safe States|[Go]({{< relref "/ChapterFour/0800~0899/0802.Find-Eventual-Safe-States.md" >}})|Medium||||56.6%|
+|0815|Bus Routes|[Go]({{< relref "/ChapterFour/0800~0899/0815.Bus-Routes.md" >}})|Hard||||45.6%|
+|0839|Similar String Groups|[Go]({{< relref "/ChapterFour/0800~0899/0839.Similar-String-Groups.md" >}})|Hard||||48.0%|
+|0841|Keys and Rooms|[Go]({{< relref "/ChapterFour/0800~0899/0841.Keys-and-Rooms.md" >}})|Medium||||71.5%|
+|0863|All Nodes Distance K in Binary Tree|[Go]({{< relref "/ChapterFour/0800~0899/0863.All-Nodes-Distance-K-in-Binary-Tree.md" >}})|Medium||||62.3%|
+|0864|Shortest Path to Get All Keys|[Go]({{< relref "/ChapterFour/0800~0899/0864.Shortest-Path-to-Get-All-Keys.md" >}})|Hard||||45.6%|
+|0909|Snakes and Ladders|[Go]({{< relref "/ChapterFour/0900~0999/0909.Snakes-and-Ladders.md" >}})|Medium||||45.1%|
+|0924|Minimize Malware Spread|[Go]({{< relref "/ChapterFour/0900~0999/0924.Minimize-Malware-Spread.md" >}})|Hard||||42.1%|
+|0928|Minimize Malware Spread II|[Go]({{< relref "/ChapterFour/0900~0999/0928.Minimize-Malware-Spread-II.md" >}})|Hard||||42.8%|
+|0958|Check Completeness of a Binary Tree|[Go]({{< relref "/ChapterFour/0900~0999/0958.Check-Completeness-of-a-Binary-Tree.md" >}})|Medium||||56.2%|
+|0959|Regions Cut By Slashes|[Go]({{< relref "/ChapterFour/0900~0999/0959.Regions-Cut-By-Slashes.md" >}})|Medium||||69.1%|
+|0987|Vertical Order Traversal of a Binary Tree|[Go]({{< relref "/ChapterFour/0900~0999/0987.Vertical-Order-Traversal-of-a-Binary-Tree.md" >}})|Hard||||45.1%|
+|0993|Cousins in Binary Tree|[Go]({{< relref "/ChapterFour/0900~0999/0993.Cousins-in-Binary-Tree.md" >}})|Easy| O(n)| O(1)||54.6%|
+|1020|Number of Enclaves|[Go]({{< relref "/ChapterFour/1000~1099/1020.Number-of-Enclaves.md" >}})|Medium||||65.6%|
+|1034|Coloring A Border|[Go]({{< relref "/ChapterFour/1000~1099/1034.Coloring-A-Border.md" >}})|Medium||||49.2%|
+|1091|Shortest Path in Binary Matrix|[Go]({{< relref "/ChapterFour/1000~1099/1091.Shortest-Path-in-Binary-Matrix.md" >}})|Medium||||44.7%|
+|1123|Lowest Common Ancestor of Deepest Leaves|[Go]({{< relref "/ChapterFour/1100~1199/1123.Lowest-Common-Ancestor-of-Deepest-Leaves.md" >}})|Medium||||70.9%|
+|1202|Smallest String With Swaps|[Go]({{< relref "/ChapterFour/1200~1299/1202.Smallest-String-With-Swaps.md" >}})|Medium||||57.7%|
+|1203|Sort Items by Groups Respecting Dependencies|[Go]({{< relref "/ChapterFour/1200~1299/1203.Sort-Items-by-Groups-Respecting-Dependencies.md" >}})|Hard||||51.2%|
+|1254|Number of Closed Islands|[Go]({{< relref "/ChapterFour/1200~1299/1254.Number-of-Closed-Islands.md" >}})|Medium||||66.9%|
+|1293|Shortest Path in a Grid with Obstacles Elimination|[Go]({{< relref "/ChapterFour/1200~1299/1293.Shortest-Path-in-a-Grid-with-Obstacles-Elimination.md" >}})|Hard||||45.3%|
+|1302|Deepest Leaves Sum|[Go]({{< relref "/ChapterFour/1300~1399/1302.Deepest-Leaves-Sum.md" >}})|Medium||||86.6%|
+|1306|Jump Game III|[Go]({{< relref "/ChapterFour/1300~1399/1306.Jump-Game-III.md" >}})|Medium||||63.5%|
+|1319|Number of Operations to Make Network Connected|[Go]({{< relref "/ChapterFour/1300~1399/1319.Number-of-Operations-to-Make-Network-Connected.md" >}})|Medium||||62.1%|
+|1609|Even Odd Tree|[Go]({{< relref "/ChapterFour/1600~1699/1609.Even-Odd-Tree.md" >}})|Medium||||54.4%|
+|1631|Path With Minimum Effort|[Go]({{< relref "/ChapterFour/1600~1699/1631.Path-With-Minimum-Effort.md" >}})|Medium||||55.7%|
+|1654|Minimum Jumps to Reach Home|[Go]({{< relref "/ChapterFour/1600~1699/1654.Minimum-Jumps-to-Reach-Home.md" >}})|Medium||||29.1%|
+|------------|-------------------------------------------------------|-------| ----------------| ---------------|-------------|-------------|-------------|
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterTwo/Depth_First_Search/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterTwo/Binary_Search/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterTwo/Depth_First_Search.md b/website/content/ChapterTwo/Depth_First_Search.md
index 41d8ac37e..ac15634e1 100644
--- a/website/content/ChapterTwo/Depth_First_Search.md
+++ b/website/content/ChapterTwo/Depth_First_Search.md
@@ -1,33 +1,126 @@
---
-title: Depth First Search
+title: 2.09 Depth First Search
type: docs
+weight: 9
---
# Depth First Search
-| Title | Solution | Difficulty | Time | Space |收藏|
-| ----- | :--------: | :----------: | :----: | :-----: | :-----: |
-|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)||
-|104. Maximum Depth of Binary Tree | [Go]({{< relref "/ChapterFour/0104.Maximum-Depth-of-Binary-Tree.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)||
-|109. Convert Sorted List to Binary Search Tree | [Go]({{< relref "/ChapterFour/0109.Convert-Sorted-List-to-Binary-Search-Tree.md" >}})| Medium | O(log n)| O(n)||
-|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)||
-|199. Binary Tree Right Side View | [Go]({{< relref "/ChapterFour/0199.Binary-Tree-Right-Side-View.md" >}})| Medium | O(n)| O(1)||
-|200. Number of Islands | [Go]({{< relref "/ChapterFour/0200.Number-of-Islands.md" >}})| Medium | O(n^2)| O(n^2)||
-|207. Course Schedule | [Go]({{< relref "/ChapterFour/0207.Course-Schedule.md" >}})| Medium | O(n^2)| O(n^2)||
-|210. Course Schedule II | [Go]({{< relref "/ChapterFour/0210.Course-Schedule-II.md" >}})| Medium | O(n^2)| O(n^2)||
-|257. Binary Tree Paths | [Go]({{< relref "/ChapterFour/0257.Binary-Tree-Paths.md" >}})| Easy | O(n)| O(1)||
-|394. Decode String | [Go]({{< relref "/ChapterFour/0394.Decode-String.md" >}})| Medium | O(n)| O(n)||
-|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)||
-|542. 01 Matrix | [Go]({{< relref "/ChapterFour/0542.01-Matrix.md" >}})| Medium | O(n)| O(1)||
-|980. Unique Paths III | [Go]({{< relref "/ChapterFour/0980.Unique-Paths-III.md" >}})| Hard | O(n log n)| O(n)||
-|---------------------------------------|---------------------------------|--------------------------|-----------------------|-----------|--------|
\ No newline at end of file
+
+| No. | Title | Solution | Difficulty | TimeComplexity | SpaceComplexity |Favorite| Acceptance |
+|:--------:|:------- | :--------: | :----------: | :----: | :-----: | :-----: |:-----: |
+|0094|Binary Tree Inorder Traversal|[Go]({{< relref "/ChapterFour/0001~0099/0094.Binary-Tree-Inorder-Traversal.md" >}})|Easy||||73.8%|
+|0098|Validate Binary Search Tree|[Go]({{< relref "/ChapterFour/0001~0099/0098.Validate-Binary-Search-Tree.md" >}})|Medium| O(n)| O(1)||32.0%|
+|0099|Recover Binary Search Tree|[Go]({{< relref "/ChapterFour/0001~0099/0099.Recover-Binary-Search-Tree.md" >}})|Medium| O(n)| O(1)||51.0%|
+|0100|Same Tree|[Go]({{< relref "/ChapterFour/0100~0199/0100.Same-Tree.md" >}})|Easy| O(n)| O(1)||58.2%|
+|0101|Symmetric Tree|[Go]({{< relref "/ChapterFour/0100~0199/0101.Symmetric-Tree.md" >}})|Easy| O(n)| O(1)||54.3%|
+|0104|Maximum Depth of Binary Tree|[Go]({{< relref "/ChapterFour/0100~0199/0104.Maximum-Depth-of-Binary-Tree.md" >}})|Easy| O(n)| O(1)||73.9%|
+|0110|Balanced Binary Tree|[Go]({{< relref "/ChapterFour/0100~0199/0110.Balanced-Binary-Tree.md" >}})|Easy| O(n)| O(1)||49.1%|
+|0111|Minimum Depth of Binary Tree|[Go]({{< relref "/ChapterFour/0100~0199/0111.Minimum-Depth-of-Binary-Tree.md" >}})|Easy| O(n)| O(1)||44.5%|
+|0112|Path Sum|[Go]({{< relref "/ChapterFour/0100~0199/0112.Path-Sum.md" >}})|Easy| O(n)| O(1)||48.3%|
+|0113|Path Sum II|[Go]({{< relref "/ChapterFour/0100~0199/0113.Path-Sum-II.md" >}})|Medium| O(n)| O(1)||57.1%|
+|0114|Flatten Binary Tree to Linked List|[Go]({{< relref "/ChapterFour/0100~0199/0114.Flatten-Binary-Tree-to-Linked-List.md" >}})|Medium| O(n)| O(1)||61.8%|
+|0116|Populating Next Right Pointers in Each Node|[Go]({{< relref "/ChapterFour/0100~0199/0116.Populating-Next-Right-Pointers-in-Each-Node.md" >}})|Medium||||60.4%|
+|0124|Binary Tree Maximum Path Sum|[Go]({{< relref "/ChapterFour/0100~0199/0124.Binary-Tree-Maximum-Path-Sum.md" >}})|Hard| O(n)| O(1)||39.2%|
+|0129|Sum Root to Leaf Numbers|[Go]({{< relref "/ChapterFour/0100~0199/0129.Sum-Root-to-Leaf-Numbers.md" >}})|Medium| O(n)| O(1)||61.0%|
+|0130|Surrounded Regions|[Go]({{< relref "/ChapterFour/0100~0199/0130.Surrounded-Regions.md" >}})|Medium||||36.8%|
+|0144|Binary Tree Preorder Traversal|[Go]({{< relref "/ChapterFour/0100~0199/0144.Binary-Tree-Preorder-Traversal.md" >}})|Easy||||66.9%|
+|0145|Binary Tree Postorder Traversal|[Go]({{< relref "/ChapterFour/0100~0199/0145.Binary-Tree-Postorder-Traversal.md" >}})|Easy||||68.0%|
+|0199|Binary Tree Right Side View|[Go]({{< relref "/ChapterFour/0100~0199/0199.Binary-Tree-Right-Side-View.md" >}})|Medium| O(n)| O(1)||61.6%|
+|0200|Number of Islands|[Go]({{< relref "/ChapterFour/0200~0299/0200.Number-of-Islands.md" >}})|Medium| O(n^2)| O(n^2)||57.0%|
+|0207|Course Schedule|[Go]({{< relref "/ChapterFour/0200~0299/0207.Course-Schedule.md" >}})|Medium| O(n^2)| O(n^2)||45.4%|
+|0210|Course Schedule II|[Go]({{< relref "/ChapterFour/0200~0299/0210.Course-Schedule-II.md" >}})|Medium| O(n^2)| O(n^2)||48.5%|
+|0211|Design Add and Search Words Data Structure|[Go]({{< relref "/ChapterFour/0200~0299/0211.Design-Add-and-Search-Words-Data-Structure.md" >}})|Medium||||44.0%|
+|0222|Count Complete Tree Nodes|[Go]({{< relref "/ChapterFour/0200~0299/0222.Count-Complete-Tree-Nodes.md" >}})|Medium||||60.6%|
+|0226|Invert Binary Tree|[Go]({{< relref "/ChapterFour/0200~0299/0226.Invert-Binary-Tree.md" >}})|Easy||||74.7%|
+|0230|Kth Smallest Element in a BST|[Go]({{< relref "/ChapterFour/0200~0299/0230.Kth-Smallest-Element-in-a-BST.md" >}})|Medium||||70.2%|
+|0235|Lowest Common Ancestor of a Binary Search Tree|[Go]({{< relref "/ChapterFour/0200~0299/0235.Lowest-Common-Ancestor-of-a-Binary-Search-Tree.md" >}})|Medium||||61.6%|
+|0236|Lowest Common Ancestor of a Binary Tree|[Go]({{< relref "/ChapterFour/0200~0299/0236.Lowest-Common-Ancestor-of-a-Binary-Tree.md" >}})|Medium||||58.8%|
+|0257|Binary Tree Paths|[Go]({{< relref "/ChapterFour/0200~0299/0257.Binary-Tree-Paths.md" >}})|Easy| O(n)| O(1)||61.4%|
+|0297|Serialize and Deserialize Binary Tree|[Go]({{< relref "/ChapterFour/0200~0299/0297.Serialize-and-Deserialize-Binary-Tree.md" >}})|Hard||||55.4%|
+|0329|Longest Increasing Path in a Matrix|[Go]({{< relref "/ChapterFour/0300~0399/0329.Longest-Increasing-Path-in-a-Matrix.md" >}})|Hard||||52.4%|
+|0337|House Robber III|[Go]({{< relref "/ChapterFour/0300~0399/0337.House-Robber-III.md" >}})|Medium||||53.9%|
+|0341|Flatten Nested List Iterator|[Go]({{< relref "/ChapterFour/0300~0399/0341.Flatten-Nested-List-Iterator.md" >}})|Medium||||61.8%|
+|0385|Mini Parser|[Go]({{< relref "/ChapterFour/0300~0399/0385.Mini-Parser.md" >}})|Medium||||36.9%|
+|0386|Lexicographical Numbers|[Go]({{< relref "/ChapterFour/0300~0399/0386.Lexicographical-Numbers.md" >}})|Medium||||61.6%|
+|0399|Evaluate Division|[Go]({{< relref "/ChapterFour/0300~0399/0399.Evaluate-Division.md" >}})|Medium||||59.7%|
+|0404|Sum of Left Leaves|[Go]({{< relref "/ChapterFour/0400~0499/0404.Sum-of-Left-Leaves.md" >}})|Easy||||56.7%|
+|0417|Pacific Atlantic Water Flow|[Go]({{< relref "/ChapterFour/0400~0499/0417.Pacific-Atlantic-Water-Flow.md" >}})|Medium||||54.4%|
+|0419|Battleships in a Board|[Go]({{< relref "/ChapterFour/0400~0499/0419.Battleships-in-a-Board.md" >}})|Medium||||74.8%|
+|0437|Path Sum III|[Go]({{< relref "/ChapterFour/0400~0499/0437.Path-Sum-III.md" >}})|Medium||||48.0%|
+|0463|Island Perimeter|[Go]({{< relref "/ChapterFour/0400~0499/0463.Island-Perimeter.md" >}})|Easy||||69.7%|
+|0508|Most Frequent Subtree Sum|[Go]({{< relref "/ChapterFour/0500~0599/0508.Most-Frequent-Subtree-Sum.md" >}})|Medium||||64.9%|
+|0513|Find Bottom Left Tree Value|[Go]({{< relref "/ChapterFour/0500~0599/0513.Find-Bottom-Left-Tree-Value.md" >}})|Medium||||66.9%|
+|0515|Find Largest Value in Each Tree Row|[Go]({{< relref "/ChapterFour/0500~0599/0515.Find-Largest-Value-in-Each-Tree-Row.md" >}})|Medium| O(n)| O(n)||64.6%|
+|0529|Minesweeper|[Go]({{< relref "/ChapterFour/0500~0599/0529.Minesweeper.md" >}})|Medium||||65.7%|
+|0530|Minimum Absolute Difference in BST|[Go]({{< relref "/ChapterFour/0500~0599/0530.Minimum-Absolute-Difference-in-BST.md" >}})|Easy||||57.3%|
+|0538|Convert BST to Greater Tree|[Go]({{< relref "/ChapterFour/0500~0599/0538.Convert-BST-to-Greater-Tree.md" >}})|Medium||||67.8%|
+|0543|Diameter of Binary Tree|[Go]({{< relref "/ChapterFour/0500~0599/0543.Diameter-of-Binary-Tree.md" >}})|Easy||||56.8%|
+|0547|Number of Provinces|[Go]({{< relref "/ChapterFour/0500~0599/0547.Number-of-Provinces.md" >}})|Medium||||63.8%|
+|0559|Maximum Depth of N-ary Tree|[Go]({{< relref "/ChapterFour/0500~0599/0559.Maximum-Depth-of-N-ary-Tree.md" >}})|Easy||||71.7%|
+|0563|Binary Tree Tilt|[Go]({{< relref "/ChapterFour/0500~0599/0563.Binary-Tree-Tilt.md" >}})|Easy||||60.1%|
+|0572|Subtree of Another Tree|[Go]({{< relref "/ChapterFour/0500~0599/0572.Subtree-of-Another-Tree.md" >}})|Easy||||46.4%|
+|0589|N-ary Tree Preorder Traversal|[Go]({{< relref "/ChapterFour/0500~0599/0589.N-ary-Tree-Preorder-Traversal.md" >}})|Easy||||75.8%|
+|0617|Merge Two Binary Trees|[Go]({{< relref "/ChapterFour/0600~0699/0617.Merge-Two-Binary-Trees.md" >}})|Easy||||78.7%|
+|0623|Add One Row to Tree|[Go]({{< relref "/ChapterFour/0600~0699/0623.Add-One-Row-to-Tree.md" >}})|Medium||||59.5%|
+|0637|Average of Levels in Binary Tree|[Go]({{< relref "/ChapterFour/0600~0699/0637.Average-of-Levels-in-Binary-Tree.md" >}})|Easy||||71.7%|
+|0653|Two Sum IV - Input is a BST|[Go]({{< relref "/ChapterFour/0600~0699/0653.Two-Sum-IV-Input-is-a-BST.md" >}})|Easy||||61.0%|
+|0662|Maximum Width of Binary Tree|[Go]({{< relref "/ChapterFour/0600~0699/0662.Maximum-Width-of-Binary-Tree.md" >}})|Medium||||40.7%|
+|0669|Trim a Binary Search Tree|[Go]({{< relref "/ChapterFour/0600~0699/0669.Trim-a-Binary-Search-Tree.md" >}})|Medium||||66.4%|
+|0684|Redundant Connection|[Go]({{< relref "/ChapterFour/0600~0699/0684.Redundant-Connection.md" >}})|Medium||||62.2%|
+|0685|Redundant Connection II|[Go]({{< relref "/ChapterFour/0600~0699/0685.Redundant-Connection-II.md" >}})|Hard||||34.1%|
+|0690|Employee Importance|[Go]({{< relref "/ChapterFour/0600~0699/0690.Employee-Importance.md" >}})|Medium||||65.6%|
+|0695|Max Area of Island|[Go]({{< relref "/ChapterFour/0600~0699/0695.Max-Area-of-Island.md" >}})|Medium||||71.8%|
+|0721|Accounts Merge|[Go]({{< relref "/ChapterFour/0700~0799/0721.Accounts-Merge.md" >}})|Medium||||56.3%|
+|0733|Flood Fill|[Go]({{< relref "/ChapterFour/0700~0799/0733.Flood-Fill.md" >}})|Easy||||62.0%|
+|0753|Cracking the Safe|[Go]({{< relref "/ChapterFour/0700~0799/0753.Cracking-the-Safe.md" >}})|Hard||||55.8%|
+|0756|Pyramid Transition Matrix|[Go]({{< relref "/ChapterFour/0700~0799/0756.Pyramid-Transition-Matrix.md" >}})|Medium||||52.7%|
+|0765|Couples Holding Hands|[Go]({{< relref "/ChapterFour/0700~0799/0765.Couples-Holding-Hands.md" >}})|Hard||||56.6%|
+|0778|Swim in Rising Water|[Go]({{< relref "/ChapterFour/0700~0799/0778.Swim-in-Rising-Water.md" >}})|Hard||||59.8%|
+|0783|Minimum Distance Between BST Nodes|[Go]({{< relref "/ChapterFour/0700~0799/0783.Minimum-Distance-Between-BST-Nodes.md" >}})|Easy||||59.3%|
+|0785|Is Graph Bipartite?|[Go]({{< relref "/ChapterFour/0700~0799/0785.Is-Graph-Bipartite.md" >}})|Medium||||53.1%|
+|0802|Find Eventual Safe States|[Go]({{< relref "/ChapterFour/0800~0899/0802.Find-Eventual-Safe-States.md" >}})|Medium||||56.6%|
+|0834|Sum of Distances in Tree|[Go]({{< relref "/ChapterFour/0800~0899/0834.Sum-of-Distances-in-Tree.md" >}})|Hard||||59.1%|
+|0839|Similar String Groups|[Go]({{< relref "/ChapterFour/0800~0899/0839.Similar-String-Groups.md" >}})|Hard||||48.0%|
+|0841|Keys and Rooms|[Go]({{< relref "/ChapterFour/0800~0899/0841.Keys-and-Rooms.md" >}})|Medium||||71.5%|
+|0851|Loud and Rich|[Go]({{< relref "/ChapterFour/0800~0899/0851.Loud-and-Rich.md" >}})|Medium||||58.4%|
+|0863|All Nodes Distance K in Binary Tree|[Go]({{< relref "/ChapterFour/0800~0899/0863.All-Nodes-Distance-K-in-Binary-Tree.md" >}})|Medium||||62.3%|
+|0872|Leaf-Similar Trees|[Go]({{< relref "/ChapterFour/0800~0899/0872.Leaf-Similar-Trees.md" >}})|Easy||||67.6%|
+|0897|Increasing Order Search Tree|[Go]({{< relref "/ChapterFour/0800~0899/0897.Increasing-Order-Search-Tree.md" >}})|Easy||||78.4%|
+|0924|Minimize Malware Spread|[Go]({{< relref "/ChapterFour/0900~0999/0924.Minimize-Malware-Spread.md" >}})|Hard||||42.1%|
+|0928|Minimize Malware Spread II|[Go]({{< relref "/ChapterFour/0900~0999/0928.Minimize-Malware-Spread-II.md" >}})|Hard||||42.8%|
+|0938|Range Sum of BST|[Go]({{< relref "/ChapterFour/0900~0999/0938.Range-Sum-of-BST.md" >}})|Easy||||85.9%|
+|0947|Most Stones Removed with Same Row or Column|[Go]({{< relref "/ChapterFour/0900~0999/0947.Most-Stones-Removed-with-Same-Row-or-Column.md" >}})|Medium||||58.9%|
+|0959|Regions Cut By Slashes|[Go]({{< relref "/ChapterFour/0900~0999/0959.Regions-Cut-By-Slashes.md" >}})|Medium||||69.1%|
+|0968|Binary Tree Cameras|[Go]({{< relref "/ChapterFour/0900~0999/0968.Binary-Tree-Cameras.md" >}})|Hard||||46.6%|
+|0971|Flip Binary Tree To Match Preorder Traversal|[Go]({{< relref "/ChapterFour/0900~0999/0971.Flip-Binary-Tree-To-Match-Preorder-Traversal.md" >}})|Medium||||50.0%|
+|0979|Distribute Coins in Binary Tree|[Go]({{< relref "/ChapterFour/0900~0999/0979.Distribute-Coins-in-Binary-Tree.md" >}})|Medium||||72.2%|
+|0987|Vertical Order Traversal of a Binary Tree|[Go]({{< relref "/ChapterFour/0900~0999/0987.Vertical-Order-Traversal-of-a-Binary-Tree.md" >}})|Hard||||45.1%|
+|0993|Cousins in Binary Tree|[Go]({{< relref "/ChapterFour/0900~0999/0993.Cousins-in-Binary-Tree.md" >}})|Easy||||54.6%|
+|1020|Number of Enclaves|[Go]({{< relref "/ChapterFour/1000~1099/1020.Number-of-Enclaves.md" >}})|Medium||||65.6%|
+|1022|Sum of Root To Leaf Binary Numbers|[Go]({{< relref "/ChapterFour/1000~1099/1022.Sum-of-Root-To-Leaf-Binary-Numbers.md" >}})|Easy||||73.5%|
+|1026|Maximum Difference Between Node and Ancestor|[Go]({{< relref "/ChapterFour/1000~1099/1026.Maximum-Difference-Between-Node-and-Ancestor.md" >}})|Medium||||75.8%|
+|1028|Recover a Tree From Preorder Traversal|[Go]({{< relref "/ChapterFour/1000~1099/1028.Recover-a-Tree-From-Preorder-Traversal.md" >}})|Hard||||73.3%|
+|1034|Coloring A Border|[Go]({{< relref "/ChapterFour/1000~1099/1034.Coloring-A-Border.md" >}})|Medium||||49.2%|
+|1038|Binary Search Tree to Greater Sum Tree|[Go]({{< relref "/ChapterFour/1000~1099/1038.Binary-Search-Tree-to-Greater-Sum-Tree.md" >}})|Medium||||85.5%|
+|1110|Delete Nodes And Return Forest|[Go]({{< relref "/ChapterFour/1100~1199/1110.Delete-Nodes-And-Return-Forest.md" >}})|Medium||||69.3%|
+|1123|Lowest Common Ancestor of Deepest Leaves|[Go]({{< relref "/ChapterFour/1100~1199/1123.Lowest-Common-Ancestor-of-Deepest-Leaves.md" >}})|Medium||||70.9%|
+|1145|Binary Tree Coloring Game|[Go]({{< relref "/ChapterFour/1100~1199/1145.Binary-Tree-Coloring-Game.md" >}})|Medium||||51.7%|
+|1202|Smallest String With Swaps|[Go]({{< relref "/ChapterFour/1200~1299/1202.Smallest-String-With-Swaps.md" >}})|Medium||||57.7%|
+|1203|Sort Items by Groups Respecting Dependencies|[Go]({{< relref "/ChapterFour/1200~1299/1203.Sort-Items-by-Groups-Respecting-Dependencies.md" >}})|Hard||||51.2%|
+|1254|Number of Closed Islands|[Go]({{< relref "/ChapterFour/1200~1299/1254.Number-of-Closed-Islands.md" >}})|Medium||||66.9%|
+|1302|Deepest Leaves Sum|[Go]({{< relref "/ChapterFour/1300~1399/1302.Deepest-Leaves-Sum.md" >}})|Medium||||86.6%|
+|1305|All Elements in Two Binary Search Trees|[Go]({{< relref "/ChapterFour/1300~1399/1305.All-Elements-in-Two-Binary-Search-Trees.md" >}})|Medium||||79.8%|
+|1306|Jump Game III|[Go]({{< relref "/ChapterFour/1300~1399/1306.Jump-Game-III.md" >}})|Medium||||63.5%|
+|1319|Number of Operations to Make Network Connected|[Go]({{< relref "/ChapterFour/1300~1399/1319.Number-of-Operations-to-Make-Network-Connected.md" >}})|Medium||||62.1%|
+|1600|Throne Inheritance|[Go]({{< relref "/ChapterFour/1600~1699/1600.Throne-Inheritance.md" >}})|Medium||||63.6%|
+|1631|Path With Minimum Effort|[Go]({{< relref "/ChapterFour/1600~1699/1631.Path-With-Minimum-Effort.md" >}})|Medium||||55.7%|
+|2096|Step-By-Step Directions From a Binary Tree Node to Another|[Go]({{< relref "/ChapterFour/2000~2099/2096.Step-By-Step-Directions-From-a-Binary-Tree-Node-to-Another.md" >}})|Medium||||48.5%|
+|------------|-------------------------------------------------------|-------| ----------------| ---------------|-------------|-------------|-------------|
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterTwo/Backtracking/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterTwo/Breadth_First_Search/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterTwo/Dynamic_Programming.md b/website/content/ChapterTwo/Dynamic_Programming.md
index 2baddaa93..79c094207 100644
--- a/website/content/ChapterTwo/Dynamic_Programming.md
+++ b/website/content/ChapterTwo/Dynamic_Programming.md
@@ -1,36 +1,117 @@
---
-title: Dynamic Programming
+title: 2.07 Dynamic Programming
type: docs
+weight: 7
---
# Dynamic Programming
-| Title | Solution | Difficulty | Time | Space |收藏|
-| ----- | :--------: | :----------: | :----: | :-----: | :-----: |
-|53. Maximum Subarray| [Go]({{< relref "/ChapterFour/0053.Maximum-Subarray.md" >}})| Easy | O(n)| O(n)||
-|62. Unique Paths | [Go]({{< relref "/ChapterFour/0062.Unique-Paths.md" >}})| Medium | O(n^2)| O(n^2)||
-|63. Unique Paths II | [Go]({{< relref "/ChapterFour/0063.Unique-Paths-II.md" >}})| Medium | O(n^2)| O(n^2)||
-|64. Minimum Path Sum | [Go]({{< relref "/ChapterFour/0064.Minimum-Path-Sum.md" >}})| Medium | O(n^2)| O(n^2)||
-|70. Climbing Stairs | [Go]({{< relref "/ChapterFour/0070.Climbing-Stairs.md" >}})| Easy | O(n)| O(n)||
-|91. Decode Ways | [Go]({{< relref "/ChapterFour/0091.Decode-Ways.md" >}})| Medium | O(n)| O(n)||
-|96. Unique Binary Search Trees | [Go]({{< relref "/ChapterFour/0096.Unique-Binary-Search-Trees.md" >}})| Medium | O(n)| O(n)||
-|120. Triangle | [Go]({{< relref "/ChapterFour/0120.Triangle.md" >}})| Medium | O(n^2)| O(n)||
-|121. Best Time to Buy and Sell Stock | [Go]({{< relref "/ChapterFour/0121.Best-Time-to-Buy-and-Sell-Stock.md" >}})| Easy | O(n)| O(1)||
-|152. Maximum Product Subarray | [Go]({{< relref "/ChapterFour/0152.Maximum-Product-Subarray.md" >}})| Medium | O(n)| O(1)||
-|198. House Robber | [Go]({{< relref "/ChapterFour/0198.House-Robber.md" >}})| Easy | O(n)| O(n)||
-|213. House Robber II | [Go]({{< relref "/ChapterFour/0213.House-Robber-II.md" >}})| Medium | O(n)| O(n)||
-|300. Longest Increasing Subsequence | [Go]({{< relref "/ChapterFour/0300.Longest-Increasing-Subsequence.md" >}})| Medium | O(n log n)| O(n)||
-|309. Best Time to Buy and Sell Stock with Cooldown | [Go]({{< relref "/ChapterFour/0309.Best-Time-to-Buy-and-Sell-Stock-with-Cooldown.md" >}})| Medium | O(n)| O(n)||
-|322. Coin Change | [Go]({{< relref "/ChapterFour/0322.Coin-Change.md" >}})| Medium | O(n)| O(n)||
-|338. Counting Bits | [Go]({{< relref "/ChapterFour/0338.Counting-Bits.md" >}})| Medium | O(n)| O(n)||
-|343. Integer Break | [Go]({{< relref "/ChapterFour/0343.Integer-Break.md" >}})| Medium | O(n^2)| O(n)||
-|357. Count Numbers with Unique Digits | [Go]({{< relref "/ChapterFour/0357.Count-Numbers-with-Unique-Digits.md" >}})| Medium | O(1)| O(1)||
-|392. Is Subsequence | [Go]({{< relref "/ChapterFour/0392.Is-Subsequence.md" >}})| Medium | O(n)| O(1)||
-|416. Partition Equal Subset Sum | [Go]({{< relref "/ChapterFour/0416.Partition-Equal-Subset-Sum.md" >}})| Medium | O(n^2)| O(n)||
-|714. Best Time to Buy and Sell Stock with Transaction Fee | [Go]({{< relref "/ChapterFour/0714.Best-Time-to-Buy-and-Sell-Stock-with-Transaction-Fee.md" >}})| Medium | O(n)| O(1)||
-|746. Min Cost Climbing Stairs | [Go]({{< relref "/ChapterFour/0746.Min-Cost-Climbing-Stairs.md" >}})| Easy | O(n)| O(1)||
-|838. Push Dominoes | [Go]({{< relref "/ChapterFour/0838.Push-Dominoes.md" >}})| Medium | O(n)| O(n)||
-|1025. Divisor Game | [Go]({{< relref "/ChapterFour/1025.Divisor-Game.md" >}})| Easy | O(1)| O(1)||
-|891. Sum of Subsequence Widths | [Go]({{< relref "/ChapterFour/0891.Sum-of-Subsequence-Widths.md" >}})| Hard | O(n log n)| O(1)||
-|942. DI String Match | [Go]({{< relref "/ChapterFour/0942.DI-String-Match.md" >}})| Easy | O(n)| O(1)||
-|---------------------------------------|---------------------------------|--------------------------|-----------------------|-----------|--------|
\ No newline at end of file
+
+| No. | Title | Solution | Difficulty | TimeComplexity | SpaceComplexity |Favorite| Acceptance |
+|:--------:|:------- | :--------: | :----------: | :----: | :-----: | :-----: |:-----: |
+|0005|Longest Palindromic Substring|[Go]({{< relref "/ChapterFour/0001~0099/0005.Longest-Palindromic-Substring.md" >}})|Medium||||32.4%|
+|0022|Generate Parentheses|[Go]({{< relref "/ChapterFour/0001~0099/0022.Generate-Parentheses.md" >}})|Medium||||72.5%|
+|0032|Longest Valid Parentheses|[Go]({{< relref "/ChapterFour/0001~0099/0032.Longest-Valid-Parentheses.md" >}})|Hard||||32.8%|
+|0042|Trapping Rain Water|[Go]({{< relref "/ChapterFour/0001~0099/0042.Trapping-Rain-Water.md" >}})|Hard||||59.3%|
+|0045|Jump Game II|[Go]({{< relref "/ChapterFour/0001~0099/0045.Jump-Game-II.md" >}})|Medium||||39.8%|
+|0053|Maximum Subarray|[Go]({{< relref "/ChapterFour/0001~0099/0053.Maximum-Subarray.md" >}})|Medium| O(n)| O(n)||50.2%|
+|0055|Jump Game|[Go]({{< relref "/ChapterFour/0001~0099/0055.Jump-Game.md" >}})|Medium||||38.9%|
+|0062|Unique Paths|[Go]({{< relref "/ChapterFour/0001~0099/0062.Unique-Paths.md" >}})|Medium| O(n^2)| O(n^2)||62.7%|
+|0063|Unique Paths II|[Go]({{< relref "/ChapterFour/0001~0099/0063.Unique-Paths-II.md" >}})|Medium| O(n^2)| O(n^2)||39.4%|
+|0064|Minimum Path Sum|[Go]({{< relref "/ChapterFour/0001~0099/0064.Minimum-Path-Sum.md" >}})|Medium| O(n^2)| O(n^2)||62.0%|
+|0070|Climbing Stairs|[Go]({{< relref "/ChapterFour/0001~0099/0070.Climbing-Stairs.md" >}})|Easy| O(n)| O(n)||52.2%|
+|0091|Decode Ways|[Go]({{< relref "/ChapterFour/0001~0099/0091.Decode-Ways.md" >}})|Medium| O(n)| O(n)||32.7%|
+|0095|Unique Binary Search Trees II|[Go]({{< relref "/ChapterFour/0001~0099/0095.Unique-Binary-Search-Trees-II.md" >}})|Medium||||52.4%|
+|0096|Unique Binary Search Trees|[Go]({{< relref "/ChapterFour/0001~0099/0096.Unique-Binary-Search-Trees.md" >}})|Medium| O(n)| O(n)||59.7%|
+|0097|Interleaving String|[Go]({{< relref "/ChapterFour/0001~0099/0097.Interleaving-String.md" >}})|Medium||||37.3%|
+|0115|Distinct Subsequences|[Go]({{< relref "/ChapterFour/0100~0199/0115.Distinct-Subsequences.md" >}})|Hard||||44.5%|
+|0118|Pascal's Triangle|[Go]({{< relref "/ChapterFour/0100~0199/0118.Pascals-Triangle.md" >}})|Easy||||70.8%|
+|0119|Pascal's Triangle II|[Go]({{< relref "/ChapterFour/0100~0199/0119.Pascals-Triangle-II.md" >}})|Easy||||60.8%|
+|0120|Triangle|[Go]({{< relref "/ChapterFour/0100~0199/0120.Triangle.md" >}})|Medium| O(n^2)| O(n)||54.5%|
+|0121|Best Time to Buy and Sell Stock|[Go]({{< relref "/ChapterFour/0100~0199/0121.Best-Time-to-Buy-and-Sell-Stock.md" >}})|Easy| O(n)| O(1)||54.3%|
+|0122|Best Time to Buy and Sell Stock II|[Go]({{< relref "/ChapterFour/0100~0199/0122.Best-Time-to-Buy-and-Sell-Stock-II.md" >}})|Medium||||63.9%|
+|0124|Binary Tree Maximum Path Sum|[Go]({{< relref "/ChapterFour/0100~0199/0124.Binary-Tree-Maximum-Path-Sum.md" >}})|Hard||||39.2%|
+|0131|Palindrome Partitioning|[Go]({{< relref "/ChapterFour/0100~0199/0131.Palindrome-Partitioning.md" >}})|Medium||||64.9%|
+|0152|Maximum Product Subarray|[Go]({{< relref "/ChapterFour/0100~0199/0152.Maximum-Product-Subarray.md" >}})|Medium| O(n)| O(1)||34.9%|
+|0174|Dungeon Game|[Go]({{< relref "/ChapterFour/0100~0199/0174.Dungeon-Game.md" >}})|Hard||||37.5%|
+|0198|House Robber|[Go]({{< relref "/ChapterFour/0100~0199/0198.House-Robber.md" >}})|Medium| O(n)| O(n)||49.4%|
+|0213|House Robber II|[Go]({{< relref "/ChapterFour/0200~0299/0213.House-Robber-II.md" >}})|Medium| O(n)| O(n)||41.0%|
+|0264|Ugly Number II|[Go]({{< relref "/ChapterFour/0200~0299/0264.Ugly-Number-II.md" >}})|Medium||||46.2%|
+|0279|Perfect Squares|[Go]({{< relref "/ChapterFour/0200~0299/0279.Perfect-Squares.md" >}})|Medium||||52.7%|
+|0300|Longest Increasing Subsequence|[Go]({{< relref "/ChapterFour/0300~0399/0300.Longest-Increasing-Subsequence.md" >}})|Medium| O(n log n)| O(n)||52.2%|
+|0309|Best Time to Buy and Sell Stock with Cooldown|[Go]({{< relref "/ChapterFour/0300~0399/0309.Best-Time-to-Buy-and-Sell-Stock-with-Cooldown.md" >}})|Medium| O(n)| O(n)||56.2%|
+|0322|Coin Change|[Go]({{< relref "/ChapterFour/0300~0399/0322.Coin-Change.md" >}})|Medium| O(n)| O(n)||42.1%|
+|0329|Longest Increasing Path in a Matrix|[Go]({{< relref "/ChapterFour/0300~0399/0329.Longest-Increasing-Path-in-a-Matrix.md" >}})|Hard||||52.4%|
+|0337|House Robber III|[Go]({{< relref "/ChapterFour/0300~0399/0337.House-Robber-III.md" >}})|Medium||||53.9%|
+|0338|Counting Bits|[Go]({{< relref "/ChapterFour/0300~0399/0338.Counting-Bits.md" >}})|Easy| O(n)| O(n)||75.8%|
+|0343|Integer Break|[Go]({{< relref "/ChapterFour/0300~0399/0343.Integer-Break.md" >}})|Medium| O(n^2)| O(n)||56.1%|
+|0354|Russian Doll Envelopes|[Go]({{< relref "/ChapterFour/0300~0399/0354.Russian-Doll-Envelopes.md" >}})|Hard||||37.9%|
+|0357|Count Numbers with Unique Digits|[Go]({{< relref "/ChapterFour/0300~0399/0357.Count-Numbers-with-Unique-Digits.md" >}})|Medium| O(1)| O(1)||51.9%|
+|0368|Largest Divisible Subset|[Go]({{< relref "/ChapterFour/0300~0399/0368.Largest-Divisible-Subset.md" >}})|Medium||||41.6%|
+|0376|Wiggle Subsequence|[Go]({{< relref "/ChapterFour/0300~0399/0376.Wiggle-Subsequence.md" >}})|Medium||||48.3%|
+|0377|Combination Sum IV|[Go]({{< relref "/ChapterFour/0300~0399/0377.Combination-Sum-IV.md" >}})|Medium||||52.2%|
+|0392|Is Subsequence|[Go]({{< relref "/ChapterFour/0300~0399/0392.Is-Subsequence.md" >}})|Easy| O(n)| O(1)||47.5%|
+|0396|Rotate Function|[Go]({{< relref "/ChapterFour/0300~0399/0396.Rotate-Function.md" >}})|Medium||||41.1%|
+|0397|Integer Replacement|[Go]({{< relref "/ChapterFour/0300~0399/0397.Integer-Replacement.md" >}})|Medium||||35.2%|
+|0410|Split Array Largest Sum|[Go]({{< relref "/ChapterFour/0400~0499/0410.Split-Array-Largest-Sum.md" >}})|Hard||||53.5%|
+|0413|Arithmetic Slices|[Go]({{< relref "/ChapterFour/0400~0499/0413.Arithmetic-Slices.md" >}})|Medium||||65.1%|
+|0416|Partition Equal Subset Sum|[Go]({{< relref "/ChapterFour/0400~0499/0416.Partition-Equal-Subset-Sum.md" >}})|Medium| O(n^2)| O(n)||46.3%|
+|0435|Non-overlapping Intervals|[Go]({{< relref "/ChapterFour/0400~0499/0435.Non-overlapping-Intervals.md" >}})|Medium||||50.3%|
+|0458|Poor Pigs|[Go]({{< relref "/ChapterFour/0400~0499/0458.Poor-Pigs.md" >}})|Hard||||62.8%|
+|0473|Matchsticks to Square|[Go]({{< relref "/ChapterFour/0400~0499/0473.Matchsticks-to-Square.md" >}})|Medium||||40.2%|
+|0474|Ones and Zeroes|[Go]({{< relref "/ChapterFour/0400~0499/0474.Ones-and-Zeroes.md" >}})|Medium||||46.8%|
+|0488|Zuma Game|[Go]({{< relref "/ChapterFour/0400~0499/0488.Zuma-Game.md" >}})|Hard||||33.9%|
+|0494|Target Sum|[Go]({{< relref "/ChapterFour/0400~0499/0494.Target-Sum.md" >}})|Medium||||45.7%|
+|0509|Fibonacci Number|[Go]({{< relref "/ChapterFour/0500~0599/0509.Fibonacci-Number.md" >}})|Easy||||69.8%|
+|0518|Coin Change II|[Go]({{< relref "/ChapterFour/0500~0599/0518.Coin-Change-II.md" >}})|Medium||||60.6%|
+|0526|Beautiful Arrangement|[Go]({{< relref "/ChapterFour/0500~0599/0526.Beautiful-Arrangement.md" >}})|Medium||||64.4%|
+|0542|01 Matrix|[Go]({{< relref "/ChapterFour/0500~0599/0542.01-Matrix.md" >}})|Medium||||44.8%|
+|0576|Out of Boundary Paths|[Go]({{< relref "/ChapterFour/0500~0599/0576.Out-of-Boundary-Paths.md" >}})|Medium||||44.3%|
+|0583|Delete Operation for Two Strings|[Go]({{< relref "/ChapterFour/0500~0599/0583.Delete-Operation-for-Two-Strings.md" >}})|Medium||||59.8%|
+|0638|Shopping Offers|[Go]({{< relref "/ChapterFour/0600~0699/0638.Shopping-Offers.md" >}})|Medium||||53.3%|
+|0647|Palindromic Substrings|[Go]({{< relref "/ChapterFour/0600~0699/0647.Palindromic-Substrings.md" >}})|Medium||||66.9%|
+|0714|Best Time to Buy and Sell Stock with Transaction Fee|[Go]({{< relref "/ChapterFour/0700~0799/0714.Best-Time-to-Buy-and-Sell-Stock-with-Transaction-Fee.md" >}})|Medium| O(n)| O(1)||65.2%|
+|0718|Maximum Length of Repeated Subarray|[Go]({{< relref "/ChapterFour/0700~0799/0718.Maximum-Length-of-Repeated-Subarray.md" >}})|Medium||||51.3%|
+|0746|Min Cost Climbing Stairs|[Go]({{< relref "/ChapterFour/0700~0799/0746.Min-Cost-Climbing-Stairs.md" >}})|Easy| O(n)| O(1)||63.2%|
+|0823|Binary Trees With Factors|[Go]({{< relref "/ChapterFour/0800~0899/0823.Binary-Trees-With-Factors.md" >}})|Medium||||49.7%|
+|0828|Count Unique Characters of All Substrings of a Given String|[Go]({{< relref "/ChapterFour/0800~0899/0828.Count-Unique-Characters-of-All-Substrings-of-a-Given-String.md" >}})|Hard||||51.6%|
+|0834|Sum of Distances in Tree|[Go]({{< relref "/ChapterFour/0800~0899/0834.Sum-of-Distances-in-Tree.md" >}})|Hard||||59.1%|
+|0838|Push Dominoes|[Go]({{< relref "/ChapterFour/0800~0899/0838.Push-Dominoes.md" >}})|Medium| O(n)| O(n)||57.0%|
+|0845|Longest Mountain in Array|[Go]({{< relref "/ChapterFour/0800~0899/0845.Longest-Mountain-in-Array.md" >}})|Medium||||40.2%|
+|0877|Stone Game|[Go]({{< relref "/ChapterFour/0800~0899/0877.Stone-Game.md" >}})|Medium||||69.7%|
+|0887|Super Egg Drop|[Go]({{< relref "/ChapterFour/0800~0899/0887.Super-Egg-Drop.md" >}})|Hard||||27.1%|
+|0898|Bitwise ORs of Subarrays|[Go]({{< relref "/ChapterFour/0800~0899/0898.Bitwise-ORs-of-Subarrays.md" >}})|Medium||||37.2%|
+|0907|Sum of Subarray Minimums|[Go]({{< relref "/ChapterFour/0900~0999/0907.Sum-of-Subarray-Minimums.md" >}})|Medium||||35.8%|
+|0918|Maximum Sum Circular Subarray|[Go]({{< relref "/ChapterFour/0900~0999/0918.Maximum-Sum-Circular-Subarray.md" >}})|Medium||||43.0%|
+|0920|Number of Music Playlists|[Go]({{< relref "/ChapterFour/0900~0999/0920.Number-of-Music-Playlists.md" >}})|Hard||||50.7%|
+|0968|Binary Tree Cameras|[Go]({{< relref "/ChapterFour/0900~0999/0968.Binary-Tree-Cameras.md" >}})|Hard||||46.6%|
+|0978|Longest Turbulent Subarray|[Go]({{< relref "/ChapterFour/0900~0999/0978.Longest-Turbulent-Subarray.md" >}})|Medium||||47.2%|
+|0996|Number of Squareful Arrays|[Go]({{< relref "/ChapterFour/0900~0999/0996.Number-of-Squareful-Arrays.md" >}})|Hard||||49.2%|
+|1025|Divisor Game|[Go]({{< relref "/ChapterFour/1000~1099/1025.Divisor-Game.md" >}})|Easy| O(1)| O(1)||67.6%|
+|1048|Longest String Chain|[Go]({{< relref "/ChapterFour/1000~1099/1048.Longest-String-Chain.md" >}})|Medium||||59.3%|
+|1049|Last Stone Weight II|[Go]({{< relref "/ChapterFour/1000~1099/1049.Last-Stone-Weight-II.md" >}})|Medium||||53.2%|
+|1105|Filling Bookcase Shelves|[Go]({{< relref "/ChapterFour/1100~1199/1105.Filling-Bookcase-Shelves.md" >}})|Medium||||59.3%|
+|1137|N-th Tribonacci Number|[Go]({{< relref "/ChapterFour/1100~1199/1137.N-th-Tribonacci-Number.md" >}})|Easy||||63.7%|
+|1143|Longest Common Subsequence|[Go]({{< relref "/ChapterFour/1100~1199/1143.Longest-Common-Subsequence.md" >}})|Medium||||58.4%|
+|1235|Maximum Profit in Job Scheduling|[Go]({{< relref "/ChapterFour/1200~1299/1235.Maximum-Profit-in-Job-Scheduling.md" >}})|Hard||||53.4%|
+|1463|Cherry Pickup II|[Go]({{< relref "/ChapterFour/1400~1499/1463.Cherry-Pickup-II.md" >}})|Hard||||69.5%|
+|1641|Count Sorted Vowel Strings|[Go]({{< relref "/ChapterFour/1600~1699/1641.Count-Sorted-Vowel-Strings.md" >}})|Medium||||77.4%|
+|1646|Get Maximum in Generated Array|[Go]({{< relref "/ChapterFour/1600~1699/1646.Get-Maximum-in-Generated-Array.md" >}})|Easy||||50.2%|
+|1653|Minimum Deletions to Make String Balanced|[Go]({{< relref "/ChapterFour/1600~1699/1653.Minimum-Deletions-to-Make-String-Balanced.md" >}})|Medium||||58.9%|
+|1654|Minimum Jumps to Reach Home|[Go]({{< relref "/ChapterFour/1600~1699/1654.Minimum-Jumps-to-Reach-Home.md" >}})|Medium||||29.1%|
+|1655|Distribute Repeating Integers|[Go]({{< relref "/ChapterFour/1600~1699/1655.Distribute-Repeating-Integers.md" >}})|Hard||||39.3%|
+|1659|Maximize Grid Happiness|[Go]({{< relref "/ChapterFour/1600~1699/1659.Maximize-Grid-Happiness.md" >}})|Hard||||38.8%|
+|1664|Ways to Make a Fair Array|[Go]({{< relref "/ChapterFour/1600~1699/1664.Ways-to-Make-a-Fair-Array.md" >}})|Medium||||63.3%|
+|1681|Minimum Incompatibility|[Go]({{< relref "/ChapterFour/1600~1699/1681.Minimum-Incompatibility.md" >}})|Hard||||37.8%|
+|1690|Stone Game VII|[Go]({{< relref "/ChapterFour/1600~1699/1690.Stone-Game-VII.md" >}})|Medium||||58.1%|
+|1691|Maximum Height by Stacking Cuboids|[Go]({{< relref "/ChapterFour/1600~1699/1691.Maximum-Height-by-Stacking-Cuboids.md" >}})|Hard||||54.6%|
+|1696|Jump Game VI|[Go]({{< relref "/ChapterFour/1600~1699/1696.Jump-Game-VI.md" >}})|Medium||||46.1%|
+|2167|Minimum Time to Remove All Cars Containing Illegal Goods|[Go]({{< relref "/ChapterFour/2100~2199/2167.Minimum-Time-to-Remove-All-Cars-Containing-Illegal-Goods.md" >}})|Hard||||40.8%|
+|------------|-------------------------------------------------------|-------| ----------------| ---------------|-------------|-------------|-------------|
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterTwo/Tree/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterTwo/Backtracking/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterTwo/Hash_Table.md b/website/content/ChapterTwo/Hash_Table.md
index ae4d23865..d0dc53572 100644
--- a/website/content/ChapterTwo/Hash_Table.md
+++ b/website/content/ChapterTwo/Hash_Table.md
@@ -1,43 +1,180 @@
---
-title: Hash Table
+title: 2.13 Hash Table
type: docs
+weight: 13
---
# Hash Table
-| Title | Solution | Difficulty | Time | Space |收藏|
-| ----- | :--------: | :----------: | :----: | :-----: | :-----: |
-|1. Two Sum | [Go]({{< relref "/ChapterFour/0001.Two-Sum.md" >}})| Easy | O(n)| O(n)||
-|3. Longest Substring Without Repeating Characters | [Go]({{< relref "/ChapterFour/0003.Longest-Substring-Without-Repeating-Characters.md" >}})| Medium | O(n)| O(1)|❤️|
-|18. 4Sum | [Go]({{< relref "/ChapterFour/0018.4Sum.md" >}})| Medium | O(n^3)| O(n^2)|❤️|
-|30. Substring with Concatenation of All Words | [Go]({{< relref "/ChapterFour/0030.Substring-with-Concatenation-of-All-Words.md" >}})| Hard | O(n)| O(n)|❤️|
-|36. Valid Sudoku | [Go]({{< relref "/ChapterFour/0036.Valid-Sudoku.md" >}})| Medium | O(n^2)| O(n^2)||
-|37. Sudoku Solver | [Go]({{< relref "/ChapterFour/0037.Sudoku-Solver.md" >}})| Hard | O(n^2)| O(n^2)|❤️|
-|49. Group Anagrams | [Go]({{< relref "/ChapterFour/0049.Group-Anagrams.md" >}})| Medium | O(n log n)| O(n)||
-|76. Minimum Window Substring | [Go]({{< relref "/ChapterFour/0076.Minimum-Window-Substring.md" >}})| Hard | O(n)| O(n)|❤️|
-|94. Binary Tree Inorder Traversal | [Go]({{< relref "/ChapterFour/0094.Binary-Tree-Inorder-Traversal.md" >}})| Medium | O(n)| O(1)||
-|138. Copy List with Random Pointer | [Go]()| Medium | O(n)| O(1)||
-|202. Happy Number | [Go]({{< relref "/ChapterFour/0202.Happy-Number.md" >}})| Easy | O(log n)| O(1)||
-|205. Isomorphic Strings | [Go]({{< relref "/ChapterFour/0205.Isomorphic-Strings.md" >}})| Easy | O(log n)| O(n)||
-|217. Contains Duplicate | [Go]({{< relref "/ChapterFour/0217.Contains-Duplicate.md" >}})| Easy | O(n)| O(n)||
-|219. Contains Duplicate II | [Go]({{< relref "/ChapterFour/0219.Contains-Duplicate-II.md" >}})| Easy | O(n)| O(n)||
-|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) ||
-|290. Word Pattern | [Go]({{< relref "/ChapterFour/0290.Word-Pattern.md" >}})| Easy | O(n)| O(n) ||
-|347. Top K Frequent Elements | [Go]({{< relref "/ChapterFour/0347.Top-K-Frequent-Elements.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) ||
-|438. Find All Anagrams in a String | [Go]({{< relref "/ChapterFour/0438.Find-All-Anagrams-in-a-String.md" >}})| Easy | O(n)| O(1) ||
-|447. Number of Boomerangs | [Go]({{< relref "/ChapterFour/0447.Number-of-Boomerangs.md" >}})| Easy | O(n)| O(1) ||
-|451. Sort Characters By Frequency | [Go]({{< relref "/ChapterFour/0451.Sort-Characters-By-Frequency.md" >}})| Medium | O(n log n)| O(1) ||
-|454. 4Sum II | [Go]({{< relref "/ChapterFour/0454.4Sum-II.md" >}})| Medium | O(n^2)| O(n) ||
-|648. Replace Words | [Go]({{< relref "/ChapterFour/0648.Replace-Words.md" >}})| Medium | O(n)| O(n) ||
-|676. Implement Magic Dictionary | [Go]({{< relref "/ChapterFour/0676.Implement-Magic-Dictionary.md" >}})| Medium | O(n)| O(n) ||
-|720. Longest Word in Dictionary | [Go]({{< relref "/ChapterFour/0720.Longest-Word-in-Dictionary.md" >}})| Easy | O(n)| O(n) ||
-|726. Number of Atoms | [Go]({{< relref "/ChapterFour/0726.Number-of-Atoms.md" >}})| Hard | O(n)| O(n) |❤️|
-|739. Daily Temperatures | [Go]({{< relref "/ChapterFour/0739.Daily-Temperatures.md" >}})| Medium | O(n)| O(n) ||
-|710. Random Pick with Blacklist | [Go]({{< relref "/ChapterFour/0710.Random-Pick-with-Blacklist.md" >}})| Hard | O(n)| O(n) ||
-|895. Maximum Frequency Stack | [Go]({{< relref "/ChapterFour/0895.Maximum-Frequency-Stack.md" >}})| Hard | O(n)| O(n) ||
-|930. Binary Subarrays With Sum | [Go]({{< relref "/ChapterFour/0930.Binary-Subarrays-With-Sum.md" >}})| Medium | O(n)| O(n) |❤️|
-|992. Subarrays with K Different Integers | [Go]({{< relref "/ChapterFour/0992.Subarrays-with-K-Different-Integers.md" >}})| Hard | O(n)| O(n) |❤️|
-|---------------------------------------|---------------------------------|--------------------------|-----------------------|-----------|--------|
\ No newline at end of file
+
+| No. | Title | Solution | Difficulty | TimeComplexity | SpaceComplexity |Favorite| Acceptance |
+|:--------:|:------- | :--------: | :----------: | :----: | :-----: | :-----: |:-----: |
+|0001|Two Sum|[Go]({{< relref "/ChapterFour/0001~0099/0001.Two-Sum.md" >}})|Easy| O(n)| O(n)||49.7%|
+|0003|Longest Substring Without Repeating Characters|[Go]({{< relref "/ChapterFour/0001~0099/0003.Longest-Substring-Without-Repeating-Characters.md" >}})|Medium| O(n)| O(1)|❤️|33.8%|
+|0012|Integer to Roman|[Go]({{< relref "/ChapterFour/0001~0099/0012.Integer-to-Roman.md" >}})|Medium||||62.0%|
+|0013|Roman to Integer|[Go]({{< relref "/ChapterFour/0001~0099/0013.Roman-to-Integer.md" >}})|Easy||||58.6%|
+|0017|Letter Combinations of a Phone Number|[Go]({{< relref "/ChapterFour/0001~0099/0017.Letter-Combinations-of-a-Phone-Number.md" >}})|Medium||||56.6%|
+|0030|Substring with Concatenation of All Words|[Go]({{< relref "/ChapterFour/0001~0099/0030.Substring-with-Concatenation-of-All-Words.md" >}})|Hard| O(n)| O(n)|❤️|31.2%|
+|0036|Valid Sudoku|[Go]({{< relref "/ChapterFour/0001~0099/0036.Valid-Sudoku.md" >}})|Medium| O(n^2)| O(n^2)||58.1%|
+|0037|Sudoku Solver|[Go]({{< relref "/ChapterFour/0001~0099/0037.Sudoku-Solver.md" >}})|Hard| O(n^2)| O(n^2)|❤️|57.7%|
+|0041|First Missing Positive|[Go]({{< relref "/ChapterFour/0001~0099/0041.First-Missing-Positive.md" >}})|Hard||||36.7%|
+|0049|Group Anagrams|[Go]({{< relref "/ChapterFour/0001~0099/0049.Group-Anagrams.md" >}})|Medium| O(n log n)| O(n)||66.8%|
+|0073|Set Matrix Zeroes|[Go]({{< relref "/ChapterFour/0001~0099/0073.Set-Matrix-Zeroes.md" >}})|Medium||||51.3%|
+|0076|Minimum Window Substring|[Go]({{< relref "/ChapterFour/0001~0099/0076.Minimum-Window-Substring.md" >}})|Hard| O(n)| O(n)|❤️|40.9%|
+|0105|Construct Binary Tree from Preorder and Inorder Traversal|[Go]({{< relref "/ChapterFour/0100~0199/0105.Construct-Binary-Tree-from-Preorder-and-Inorder-Traversal.md" >}})|Medium||||61.6%|
+|0106|Construct Binary Tree from Inorder and Postorder Traversal|[Go]({{< relref "/ChapterFour/0100~0199/0106.Construct-Binary-Tree-from-Inorder-and-Postorder-Traversal.md" >}})|Medium||||60.0%|
+|0126|Word Ladder II|[Go]({{< relref "/ChapterFour/0100~0199/0126.Word-Ladder-II.md" >}})|Hard||||27.5%|
+|0127|Word Ladder|[Go]({{< relref "/ChapterFour/0100~0199/0127.Word-Ladder.md" >}})|Hard||||37.2%|
+|0128|Longest Consecutive Sequence|[Go]({{< relref "/ChapterFour/0100~0199/0128.Longest-Consecutive-Sequence.md" >}})|Medium||||48.5%|
+|0138|Copy List with Random Pointer|[Go]({{< relref "/ChapterFour/0100~0199/0138.Copy-List-with-Random-Pointer.md" >}})|Medium| O(n)| O(1)||51.4%|
+|0141|Linked List Cycle|[Go]({{< relref "/ChapterFour/0100~0199/0141.Linked-List-Cycle.md" >}})|Easy||||47.5%|
+|0142|Linked List Cycle II|[Go]({{< relref "/ChapterFour/0100~0199/0142.Linked-List-Cycle-II.md" >}})|Medium||||48.8%|
+|0146|LRU Cache|[Go]({{< relref "/ChapterFour/0100~0199/0146.LRU-Cache.md" >}})|Medium||||40.7%|
+|0160|Intersection of Two Linked Lists|[Go]({{< relref "/ChapterFour/0100~0199/0160.Intersection-of-Two-Linked-Lists.md" >}})|Easy||||54.4%|
+|0169|Majority Element|[Go]({{< relref "/ChapterFour/0100~0199/0169.Majority-Element.md" >}})|Easy||||63.9%|
+|0187|Repeated DNA Sequences|[Go]({{< relref "/ChapterFour/0100~0199/0187.Repeated-DNA-Sequences.md" >}})|Medium||||47.0%|
+|0202|Happy Number|[Go]({{< relref "/ChapterFour/0200~0299/0202.Happy-Number.md" >}})|Easy| O(log n)| O(1)||54.8%|
+|0205|Isomorphic Strings|[Go]({{< relref "/ChapterFour/0200~0299/0205.Isomorphic-Strings.md" >}})|Easy| O(log n)| O(n)||42.9%|
+|0208|Implement Trie (Prefix Tree)|[Go]({{< relref "/ChapterFour/0200~0299/0208.Implement-Trie-Prefix-Tree.md" >}})|Medium||||62.8%|
+|0217|Contains Duplicate|[Go]({{< relref "/ChapterFour/0200~0299/0217.Contains-Duplicate.md" >}})|Easy| O(n)| O(n)||61.4%|
+|0219|Contains Duplicate II|[Go]({{< relref "/ChapterFour/0200~0299/0219.Contains-Duplicate-II.md" >}})|Easy| O(n)| O(n)||42.6%|
+|0229|Majority Element II|[Go]({{< relref "/ChapterFour/0200~0299/0229.Majority-Element-II.md" >}})|Medium||||45.1%|
+|0242|Valid Anagram|[Go]({{< relref "/ChapterFour/0200~0299/0242.Valid-Anagram.md" >}})|Easy| O(n)| O(n) ||63.1%|
+|0264|Ugly Number II|[Go]({{< relref "/ChapterFour/0200~0299/0264.Ugly-Number-II.md" >}})|Medium||||46.2%|
+|0268|Missing Number|[Go]({{< relref "/ChapterFour/0200~0299/0268.Missing-Number.md" >}})|Easy||||62.6%|
+|0290|Word Pattern|[Go]({{< relref "/ChapterFour/0200~0299/0290.Word-Pattern.md" >}})|Easy| O(n)| O(n) ||41.7%|
+|0299|Bulls and Cows|[Go]({{< relref "/ChapterFour/0200~0299/0299.Bulls-and-Cows.md" >}})|Medium||||49.4%|
+|0347|Top K Frequent Elements|[Go]({{< relref "/ChapterFour/0300~0399/0347.Top-K-Frequent-Elements.md" >}})|Medium| O(n)| O(n) ||64.2%|
+|0349|Intersection of Two Arrays|[Go]({{< relref "/ChapterFour/0300~0399/0349.Intersection-of-Two-Arrays.md" >}})|Easy| O(n)| O(n) ||70.9%|
+|0350|Intersection of Two Arrays II|[Go]({{< relref "/ChapterFour/0300~0399/0350.Intersection-of-Two-Arrays-II.md" >}})|Easy| O(n)| O(n) ||56.0%|
+|0383|Ransom Note|[Go]({{< relref "/ChapterFour/0300~0399/0383.Ransom-Note.md" >}})|Easy||||58.3%|
+|0387|First Unique Character in a String|[Go]({{< relref "/ChapterFour/0300~0399/0387.First-Unique-Character-in-a-String.md" >}})|Easy||||59.6%|
+|0389|Find the Difference|[Go]({{< relref "/ChapterFour/0300~0399/0389.Find-the-Difference.md" >}})|Easy||||59.9%|
+|0395|Longest Substring with At Least K Repeating Characters|[Go]({{< relref "/ChapterFour/0300~0399/0395.Longest-Substring-with-At-Least-K-Repeating-Characters.md" >}})|Medium||||44.8%|
+|0409|Longest Palindrome|[Go]({{< relref "/ChapterFour/0400~0499/0409.Longest-Palindrome.md" >}})|Easy||||54.2%|
+|0421|Maximum XOR of Two Numbers in an Array|[Go]({{< relref "/ChapterFour/0400~0499/0421.Maximum-XOR-of-Two-Numbers-in-an-Array.md" >}})|Medium||||54.0%|
+|0423|Reconstruct Original Digits from English|[Go]({{< relref "/ChapterFour/0400~0499/0423.Reconstruct-Original-Digits-from-English.md" >}})|Medium||||51.2%|
+|0424|Longest Repeating Character Replacement|[Go]({{< relref "/ChapterFour/0400~0499/0424.Longest-Repeating-Character-Replacement.md" >}})|Medium||||52.0%|
+|0433|Minimum Genetic Mutation|[Go]({{< relref "/ChapterFour/0400~0499/0433.Minimum-Genetic-Mutation.md" >}})|Medium||||52.4%|
+|0438|Find All Anagrams in a String|[Go]({{< relref "/ChapterFour/0400~0499/0438.Find-All-Anagrams-in-a-String.md" >}})|Medium| O(n)| O(1) ||50.2%|
+|0447|Number of Boomerangs|[Go]({{< relref "/ChapterFour/0400~0499/0447.Number-of-Boomerangs.md" >}})|Medium| O(n)| O(1) ||54.9%|
+|0448|Find All Numbers Disappeared in an Array|[Go]({{< relref "/ChapterFour/0400~0499/0448.Find-All-Numbers-Disappeared-in-an-Array.md" >}})|Easy||||59.9%|
+|0451|Sort Characters By Frequency|[Go]({{< relref "/ChapterFour/0400~0499/0451.Sort-Characters-By-Frequency.md" >}})|Medium| O(n log n)| O(1) ||70.1%|
+|0454|4Sum II|[Go]({{< relref "/ChapterFour/0400~0499/0454.4Sum-II.md" >}})|Medium| O(n^2)| O(n) ||57.2%|
+|0457|Circular Array Loop|[Go]({{< relref "/ChapterFour/0400~0499/0457.Circular-Array-Loop.md" >}})|Medium||||32.6%|
+|0460|LFU Cache|[Go]({{< relref "/ChapterFour/0400~0499/0460.LFU-Cache.md" >}})|Hard||||43.0%|
+|0480|Sliding Window Median|[Go]({{< relref "/ChapterFour/0400~0499/0480.Sliding-Window-Median.md" >}})|Hard||||41.1%|
+|0491|Non-decreasing Subsequences|[Go]({{< relref "/ChapterFour/0400~0499/0491.Non-decreasing-Subsequences.md" >}})|Medium||||60.2%|
+|0496|Next Greater Element I|[Go]({{< relref "/ChapterFour/0400~0499/0496.Next-Greater-Element-I.md" >}})|Easy||||71.4%|
+|0500|Keyboard Row|[Go]({{< relref "/ChapterFour/0500~0599/0500.Keyboard-Row.md" >}})|Easy||||69.6%|
+|0508|Most Frequent Subtree Sum|[Go]({{< relref "/ChapterFour/0500~0599/0508.Most-Frequent-Subtree-Sum.md" >}})|Medium||||64.9%|
+|0519|Random Flip Matrix|[Go]({{< relref "/ChapterFour/0500~0599/0519.Random-Flip-Matrix.md" >}})|Medium||||40.0%|
+|0523|Continuous Subarray Sum|[Go]({{< relref "/ChapterFour/0500~0599/0523.Continuous-Subarray-Sum.md" >}})|Medium||||28.5%|
+|0525|Contiguous Array|[Go]({{< relref "/ChapterFour/0500~0599/0525.Contiguous-Array.md" >}})|Medium||||46.8%|
+|0532|K-diff Pairs in an Array|[Go]({{< relref "/ChapterFour/0500~0599/0532.K-diff-Pairs-in-an-Array.md" >}})|Medium||||41.2%|
+|0535|Encode and Decode TinyURL|[Go]({{< relref "/ChapterFour/0500~0599/0535.Encode-and-Decode-TinyURL.md" >}})|Medium||||86.0%|
+|0554|Brick Wall|[Go]({{< relref "/ChapterFour/0500~0599/0554.Brick-Wall.md" >}})|Medium||||53.6%|
+|0560|Subarray Sum Equals K|[Go]({{< relref "/ChapterFour/0500~0599/0560.Subarray-Sum-Equals-K.md" >}})|Medium||||43.7%|
+|0567|Permutation in String|[Go]({{< relref "/ChapterFour/0500~0599/0567.Permutation-in-String.md" >}})|Medium||||44.3%|
+|0575|Distribute Candies|[Go]({{< relref "/ChapterFour/0500~0599/0575.Distribute-Candies.md" >}})|Easy||||66.5%|
+|0594|Longest Harmonious Subsequence|[Go]({{< relref "/ChapterFour/0500~0599/0594.Longest-Harmonious-Subsequence.md" >}})|Easy||||53.5%|
+|0599|Minimum Index Sum of Two Lists|[Go]({{< relref "/ChapterFour/0500~0599/0599.Minimum-Index-Sum-of-Two-Lists.md" >}})|Easy||||53.4%|
+|0609|Find Duplicate File in System|[Go]({{< relref "/ChapterFour/0600~0699/0609.Find-Duplicate-File-in-System.md" >}})|Medium||||67.7%|
+|0632|Smallest Range Covering Elements from K Lists|[Go]({{< relref "/ChapterFour/0600~0699/0632.Smallest-Range-Covering-Elements-from-K-Lists.md" >}})|Hard||||61.0%|
+|0645|Set Mismatch|[Go]({{< relref "/ChapterFour/0600~0699/0645.Set-Mismatch.md" >}})|Easy||||42.7%|
+|0648|Replace Words|[Go]({{< relref "/ChapterFour/0600~0699/0648.Replace-Words.md" >}})|Medium| O(n)| O(n) ||62.7%|
+|0653|Two Sum IV - Input is a BST|[Go]({{< relref "/ChapterFour/0600~0699/0653.Two-Sum-IV-Input-is-a-BST.md" >}})|Easy||||61.0%|
+|0676|Implement Magic Dictionary|[Go]({{< relref "/ChapterFour/0600~0699/0676.Implement-Magic-Dictionary.md" >}})|Medium| O(n)| O(n) ||56.9%|
+|0677|Map Sum Pairs|[Go]({{< relref "/ChapterFour/0600~0699/0677.Map-Sum-Pairs.md" >}})|Medium||||56.8%|
+|0690|Employee Importance|[Go]({{< relref "/ChapterFour/0600~0699/0690.Employee-Importance.md" >}})|Medium||||65.6%|
+|0692|Top K Frequent Words|[Go]({{< relref "/ChapterFour/0600~0699/0692.Top-K-Frequent-Words.md" >}})|Medium||||57.2%|
+|0697|Degree of an Array|[Go]({{< relref "/ChapterFour/0600~0699/0697.Degree-of-an-Array.md" >}})|Easy||||56.0%|
+|0705|Design HashSet|[Go]({{< relref "/ChapterFour/0700~0799/0705.Design-HashSet.md" >}})|Easy||||65.6%|
+|0706|Design HashMap|[Go]({{< relref "/ChapterFour/0700~0799/0706.Design-HashMap.md" >}})|Easy||||64.7%|
+|0710|Random Pick with Blacklist|[Go]({{< relref "/ChapterFour/0700~0799/0710.Random-Pick-with-Blacklist.md" >}})|Hard| O(n)| O(n) ||33.5%|
+|0720|Longest Word in Dictionary|[Go]({{< relref "/ChapterFour/0700~0799/0720.Longest-Word-in-Dictionary.md" >}})|Medium| O(n)| O(n) ||52.0%|
+|0726|Number of Atoms|[Go]({{< relref "/ChapterFour/0700~0799/0726.Number-of-Atoms.md" >}})|Hard| O(n)| O(n) |❤️|52.2%|
+|0745|Prefix and Suffix Search|[Go]({{< relref "/ChapterFour/0700~0799/0745.Prefix-and-Suffix-Search.md" >}})|Hard||||41.2%|
+|0748|Shortest Completing Word|[Go]({{< relref "/ChapterFour/0700~0799/0748.Shortest-Completing-Word.md" >}})|Easy||||59.3%|
+|0752|Open the Lock|[Go]({{< relref "/ChapterFour/0700~0799/0752.Open-the-Lock.md" >}})|Medium||||55.6%|
+|0763|Partition Labels|[Go]({{< relref "/ChapterFour/0700~0799/0763.Partition-Labels.md" >}})|Medium||||79.7%|
+|0767|Reorganize String|[Go]({{< relref "/ChapterFour/0700~0799/0767.Reorganize-String.md" >}})|Medium||||52.9%|
+|0771|Jewels and Stones|[Go]({{< relref "/ChapterFour/0700~0799/0771.Jewels-and-Stones.md" >}})|Easy||||88.2%|
+|0781|Rabbits in Forest|[Go]({{< relref "/ChapterFour/0700~0799/0781.Rabbits-in-Forest.md" >}})|Medium||||54.7%|
+|0791|Custom Sort String|[Go]({{< relref "/ChapterFour/0700~0799/0791.Custom-Sort-String.md" >}})|Medium||||69.1%|
+|0792|Number of Matching Subsequences|[Go]({{< relref "/ChapterFour/0700~0799/0792.Number-of-Matching-Subsequences.md" >}})|Medium||||51.6%|
+|0811|Subdomain Visit Count|[Go]({{< relref "/ChapterFour/0800~0899/0811.Subdomain-Visit-Count.md" >}})|Medium||||75.5%|
+|0815|Bus Routes|[Go]({{< relref "/ChapterFour/0800~0899/0815.Bus-Routes.md" >}})|Hard||||45.6%|
+|0817|Linked List Components|[Go]({{< relref "/ChapterFour/0800~0899/0817.Linked-List-Components.md" >}})|Medium||||57.7%|
+|0819|Most Common Word|[Go]({{< relref "/ChapterFour/0800~0899/0819.Most-Common-Word.md" >}})|Easy||||44.7%|
+|0820|Short Encoding of Words|[Go]({{< relref "/ChapterFour/0800~0899/0820.Short-Encoding-of-Words.md" >}})|Medium||||60.6%|
+|0823|Binary Trees With Factors|[Go]({{< relref "/ChapterFour/0800~0899/0823.Binary-Trees-With-Factors.md" >}})|Medium||||49.7%|
+|0828|Count Unique Characters of All Substrings of a Given String|[Go]({{< relref "/ChapterFour/0800~0899/0828.Count-Unique-Characters-of-All-Substrings-of-a-Given-String.md" >}})|Hard||||51.6%|
+|0846|Hand of Straights|[Go]({{< relref "/ChapterFour/0800~0899/0846.Hand-of-Straights.md" >}})|Medium||||56.2%|
+|0859|Buddy Strings|[Go]({{< relref "/ChapterFour/0800~0899/0859.Buddy-Strings.md" >}})|Easy||||29.2%|
+|0884|Uncommon Words from Two Sentences|[Go]({{< relref "/ChapterFour/0800~0899/0884.Uncommon-Words-from-Two-Sentences.md" >}})|Easy||||66.4%|
+|0888|Fair Candy Swap|[Go]({{< relref "/ChapterFour/0800~0899/0888.Fair-Candy-Swap.md" >}})|Easy||||60.7%|
+|0890|Find and Replace Pattern|[Go]({{< relref "/ChapterFour/0800~0899/0890.Find-and-Replace-Pattern.md" >}})|Medium||||77.6%|
+|0895|Maximum Frequency Stack|[Go]({{< relref "/ChapterFour/0800~0899/0895.Maximum-Frequency-Stack.md" >}})|Hard| O(n)| O(n) ||66.6%|
+|0904|Fruit Into Baskets|[Go]({{< relref "/ChapterFour/0900~0999/0904.Fruit-Into-Baskets.md" >}})|Medium||||43.7%|
+|0911|Online Election|[Go]({{< relref "/ChapterFour/0900~0999/0911.Online-Election.md" >}})|Medium||||52.2%|
+|0914|X of a Kind in a Deck of Cards|[Go]({{< relref "/ChapterFour/0900~0999/0914.X-of-a-Kind-in-a-Deck-of-Cards.md" >}})|Easy||||31.2%|
+|0916|Word Subsets|[Go]({{< relref "/ChapterFour/0900~0999/0916.Word-Subsets.md" >}})|Medium||||53.7%|
+|0923|3Sum With Multiplicity|[Go]({{< relref "/ChapterFour/0900~0999/0923.3Sum-With-Multiplicity.md" >}})|Medium||||45.3%|
+|0930|Binary Subarrays With Sum|[Go]({{< relref "/ChapterFour/0900~0999/0930.Binary-Subarrays-With-Sum.md" >}})|Medium| O(n)| O(n) |❤️|52.2%|
+|0953|Verifying an Alien Dictionary|[Go]({{< relref "/ChapterFour/0900~0999/0953.Verifying-an-Alien-Dictionary.md" >}})|Easy||||54.5%|
+|0961|N-Repeated Element in Size 2N Array|[Go]({{< relref "/ChapterFour/0900~0999/0961.N-Repeated-Element-in-Size-2N-Array.md" >}})|Easy||||76.1%|
+|0966|Vowel Spellchecker|[Go]({{< relref "/ChapterFour/0900~0999/0966.Vowel-Spellchecker.md" >}})|Medium||||51.4%|
+|0970|Powerful Integers|[Go]({{< relref "/ChapterFour/0900~0999/0970.Powerful-Integers.md" >}})|Medium||||43.6%|
+|0981|Time Based Key-Value Store|[Go]({{< relref "/ChapterFour/0900~0999/0981.Time-Based-Key-Value-Store.md" >}})|Medium||||52.2%|
+|0987|Vertical Order Traversal of a Binary Tree|[Go]({{< relref "/ChapterFour/0900~0999/0987.Vertical-Order-Traversal-of-a-Binary-Tree.md" >}})|Hard||||45.1%|
+|0992|Subarrays with K Different Integers|[Go]({{< relref "/ChapterFour/0900~0999/0992.Subarrays-with-K-Different-Integers.md" >}})|Hard| O(n)| O(n) |❤️|54.6%|
+|0997|Find the Town Judge|[Go]({{< relref "/ChapterFour/0900~0999/0997.Find-the-Town-Judge.md" >}})|Easy||||49.5%|
+|1002|Find Common Characters|[Go]({{< relref "/ChapterFour/1000~1099/1002.Find-Common-Characters.md" >}})|Easy||||68.5%|
+|1010|Pairs of Songs With Total Durations Divisible by 60|[Go]({{< relref "/ChapterFour/1000~1099/1010.Pairs-of-Songs-With-Total-Durations-Divisible-by-60.md" >}})|Medium||||52.8%|
+|1048|Longest String Chain|[Go]({{< relref "/ChapterFour/1000~1099/1048.Longest-String-Chain.md" >}})|Medium||||59.3%|
+|1054|Distant Barcodes|[Go]({{< relref "/ChapterFour/1000~1099/1054.Distant-Barcodes.md" >}})|Medium||||45.9%|
+|1074|Number of Submatrices That Sum to Target|[Go]({{< relref "/ChapterFour/1000~1099/1074.Number-of-Submatrices-That-Sum-to-Target.md" >}})|Hard||||69.5%|
+|1079|Letter Tile Possibilities|[Go]({{< relref "/ChapterFour/1000~1099/1079.Letter-Tile-Possibilities.md" >}})|Medium||||76.0%|
+|1122|Relative Sort Array|[Go]({{< relref "/ChapterFour/1100~1199/1122.Relative-Sort-Array.md" >}})|Easy||||68.6%|
+|1123|Lowest Common Ancestor of Deepest Leaves|[Go]({{< relref "/ChapterFour/1100~1199/1123.Lowest-Common-Ancestor-of-Deepest-Leaves.md" >}})|Medium||||70.9%|
+|1128|Number of Equivalent Domino Pairs|[Go]({{< relref "/ChapterFour/1100~1199/1128.Number-of-Equivalent-Domino-Pairs.md" >}})|Easy||||47.1%|
+|1160|Find Words That Can Be Formed by Characters|[Go]({{< relref "/ChapterFour/1100~1199/1160.Find-Words-That-Can-Be-Formed-by-Characters.md" >}})|Easy||||67.5%|
+|1170|Compare Strings by Frequency of the Smallest Character|[Go]({{< relref "/ChapterFour/1100~1199/1170.Compare-Strings-by-Frequency-of-the-Smallest-Character.md" >}})|Medium||||61.5%|
+|1171|Remove Zero Sum Consecutive Nodes from Linked List|[Go]({{< relref "/ChapterFour/1100~1199/1171.Remove-Zero-Sum-Consecutive-Nodes-from-Linked-List.md" >}})|Medium||||43.2%|
+|1178|Number of Valid Words for Each Puzzle|[Go]({{< relref "/ChapterFour/1100~1199/1178.Number-of-Valid-Words-for-Each-Puzzle.md" >}})|Hard||||46.3%|
+|1189|Maximum Number of Balloons|[Go]({{< relref "/ChapterFour/1100~1199/1189.Maximum-Number-of-Balloons.md" >}})|Easy||||61.0%|
+|1202|Smallest String With Swaps|[Go]({{< relref "/ChapterFour/1200~1299/1202.Smallest-String-With-Swaps.md" >}})|Medium||||57.7%|
+|1207|Unique Number of Occurrences|[Go]({{< relref "/ChapterFour/1200~1299/1207.Unique-Number-of-Occurrences.md" >}})|Easy||||73.5%|
+|1275|Find Winner on a Tic Tac Toe Game|[Go]({{< relref "/ChapterFour/1200~1299/1275.Find-Winner-on-a-Tic-Tac-Toe-Game.md" >}})|Easy||||54.2%|
+|1296|Divide Array in Sets of K Consecutive Numbers|[Go]({{< relref "/ChapterFour/1200~1299/1296.Divide-Array-in-Sets-of-K-Consecutive-Numbers.md" >}})|Medium||||56.5%|
+|1396|Design Underground System|[Go]({{< relref "/ChapterFour/1300~1399/1396.Design-Underground-System.md" >}})|Medium||||73.6%|
+|1442|Count Triplets That Can Form Two Arrays of Equal XOR|[Go]({{< relref "/ChapterFour/1400~1499/1442.Count-Triplets-That-Can-Form-Two-Arrays-of-Equal-XOR.md" >}})|Medium||||76.1%|
+|1461|Check If a String Contains All Binary Codes of Size K|[Go]({{< relref "/ChapterFour/1400~1499/1461.Check-If-a-String-Contains-All-Binary-Codes-of-Size-K.md" >}})|Medium||||56.6%|
+|1512|Number of Good Pairs|[Go]({{< relref "/ChapterFour/1500~1599/1512.Number-of-Good-Pairs.md" >}})|Easy||||88.2%|
+|1600|Throne Inheritance|[Go]({{< relref "/ChapterFour/1600~1699/1600.Throne-Inheritance.md" >}})|Medium||||63.6%|
+|1624|Largest Substring Between Two Equal Characters|[Go]({{< relref "/ChapterFour/1600~1699/1624.Largest-Substring-Between-Two-Equal-Characters.md" >}})|Easy||||59.1%|
+|1636|Sort Array by Increasing Frequency|[Go]({{< relref "/ChapterFour/1600~1699/1636.Sort-Array-by-Increasing-Frequency.md" >}})|Easy||||69.5%|
+|1640|Check Array Formation Through Concatenation|[Go]({{< relref "/ChapterFour/1600~1699/1640.Check-Array-Formation-Through-Concatenation.md" >}})|Easy||||56.2%|
+|1647|Minimum Deletions to Make Character Frequencies Unique|[Go]({{< relref "/ChapterFour/1600~1699/1647.Minimum-Deletions-to-Make-Character-Frequencies-Unique.md" >}})|Medium||||59.1%|
+|1656|Design an Ordered Stream|[Go]({{< relref "/ChapterFour/1600~1699/1656.Design-an-Ordered-Stream.md" >}})|Easy||||85.2%|
+|1657|Determine if Two Strings Are Close|[Go]({{< relref "/ChapterFour/1600~1699/1657.Determine-if-Two-Strings-Are-Close.md" >}})|Medium||||56.3%|
+|1658|Minimum Operations to Reduce X to Zero|[Go]({{< relref "/ChapterFour/1600~1699/1658.Minimum-Operations-to-Reduce-X-to-Zero.md" >}})|Medium||||37.6%|
+|1674|Minimum Moves to Make Array Complementary|[Go]({{< relref "/ChapterFour/1600~1699/1674.Minimum-Moves-to-Make-Array-Complementary.md" >}})|Medium||||38.7%|
+|1679|Max Number of K-Sum Pairs|[Go]({{< relref "/ChapterFour/1600~1699/1679.Max-Number-of-K-Sum-Pairs.md" >}})|Medium||||57.3%|
+|1684|Count the Number of Consistent Strings|[Go]({{< relref "/ChapterFour/1600~1699/1684.Count-the-Number-of-Consistent-Strings.md" >}})|Easy||||82.3%|
+|1695|Maximum Erasure Value|[Go]({{< relref "/ChapterFour/1600~1699/1695.Maximum-Erasure-Value.md" >}})|Medium||||57.6%|
+|1742|Maximum Number of Balls in a Box|[Go]({{< relref "/ChapterFour/1700~1799/1742.Maximum-Number-of-Balls-in-a-Box.md" >}})|Easy||||73.6%|
+|1748|Sum of Unique Elements|[Go]({{< relref "/ChapterFour/1700~1799/1748.Sum-of-Unique-Elements.md" >}})|Easy||||76.3%|
+|1763|Longest Nice Substring|[Go]({{< relref "/ChapterFour/1700~1799/1763.Longest-Nice-Substring.md" >}})|Easy||||61.5%|
+|2043|Simple Bank System|[Go]({{< relref "/ChapterFour/2000~2099/2043.Simple-Bank-System.md" >}})|Medium||||65.2%|
+|2166|Design Bitset|[Go]({{< relref "/ChapterFour/2100~2199/2166.Design-Bitset.md" >}})|Medium||||31.8%|
+|2170|Minimum Operations to Make the Array Alternating|[Go]({{< relref "/ChapterFour/2100~2199/2170.Minimum-Operations-to-Make-the-Array-Alternating.md" >}})|Medium||||33.2%|
+|------------|-------------------------------------------------------|-------| ----------------| ---------------|-------------|-------------|-------------|
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterTwo/Math/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterTwo/Sorting/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterTwo/Linked_List.md b/website/content/ChapterTwo/Linked_List.md
index d786f4665..aa72c67ec 100644
--- a/website/content/ChapterTwo/Linked_List.md
+++ b/website/content/ChapterTwo/Linked_List.md
@@ -1,6 +1,7 @@
---
-title: Linked List
+title: 2.04 ✅ Linked List
type: docs
+weight: 4
---
# Linked List
@@ -19,35 +20,58 @@ type: docs
-| Title | Solution | Difficulty | Time | Space |收藏|
-| ----- | :--------: | :----------: | :----: | :-----: | :-----: |
-|2. Add Two Numbers | [Go]({{< relref "/ChapterFour/0002.Add-Two-Numbers.md" >}})| Medium | O(n)| O(1)||
-|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)||
-|21. Merge Two Sorted Lists | [Go]({{< relref "/ChapterFour/0021.Merge-Two-Sorted-Lists.md" >}})| Easy | O(log n)| O(1)||
-|23. Merge k Sorted Lists| [Go]({{< relref "/ChapterFour/0023.Merge-k-Sorted-Lists.md" >}})| Hard | O(log n)| O(1)|❤️|
-|24. Swap Nodes in Pairs | [Go]({{< relref "/ChapterFour/0024.Swap-Nodes-in-Pairs.md" >}})| Medium | O(n)| O(1)||
-|25. Reverse Nodes in k-Group | [Go]({{< relref "/ChapterFour/0025.Reverse-Nodes-in-k-Group.md" >}})| Hard | O(log n)| O(1)|❤️|
-|61. Rotate List | [Go]({{< relref "/ChapterFour/0061.Rotate-List.md" >}})| Medium | O(n)| O(1)||
-|82. Remove Duplicates from Sorted List II | [Go]({{< relref "/ChapterFour/0082.Remove-Duplicates-from-Sorted-List-II.md" >}})| Medium | O(n)| O(1)||
-|83. Remove Duplicates from Sorted List | [Go]({{< relref "/ChapterFour/0083.Remove-Duplicates-from-Sorted-List.md" >}})| Easy | O(n)| O(1)||
-|86. Partition List | [Go]({{< relref "/ChapterFour/0086.Partition-List.md" >}})| Medium | O(n)| O(1)|❤️|
-|92. Reverse Linked List II | [Go]({{< relref "/ChapterFour/0092.Reverse-Linked-List-II.md" >}})| Medium | O(n)| O(1)|❤️|
-|109. Convert Sorted List to Binary Search Tree | [Go]({{< relref "/ChapterFour/0109.Convert-Sorted-List-to-Binary-Search-Tree.md" >}})| Medium | O(log n)| O(n)||
-|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)|❤️|
-|143. Reorder List | [Go]({{< relref "/ChapterFour/0143.Reorder-List.md" >}})| Medium | O(n)| O(1)|❤️|
-|147. Insertion Sort List | [Go]({{< relref "/ChapterFour/0147.Insertion-Sort-List.md" >}})| Medium | O(n)| O(1)|❤️|
-|148. Sort List | [Go]({{< relref "/ChapterFour/0148.Sort-List.md" >}})| Medium | O(n log n)| O(n)|❤️|
-|160. Intersection of Two Linked Lists | [Go]({{< relref "/ChapterFour/0160.Intersection-of-Two-Linked-Lists.md" >}})| Easy | O(n)| O(1)|❤️|
-|203. Remove Linked List Elements | [Go]({{< relref "/ChapterFour/0203.Remove-Linked-List-Elements.md" >}})| Easy | O(n)| O(1)||
-|206. Reverse Linked List | [Go]({{< relref "/ChapterFour/0206.Reverse-Linked-List.md" >}})| Easy | O(n)| O(1)||
-|234. Palindrome Linked List | [Go]({{< relref "/ChapterFour/0234.Palindrome-Linked-List.md" >}})| Easy | O(n)| O(1)||
-|237. Delete Node in a Linked List | [Go]({{< relref "/ChapterFour/0237.Delete-Node-in-a-Linked-List.md" >}})| Easy | O(n)| O(1)||
-|328. Odd Even Linked List | [Go]({{< relref "/ChapterFour/0328.Odd-Even-Linked-List.md" >}})| Medium | O(n)| O(1)||
-|445. Add Two Numbers II | [Go]({{< relref "/ChapterFour/0445.Add-Two-Numbers-II.md" >}})| Medium | O(n)| O(n)||
-|725. Split Linked List in Parts | [Go]({{< relref "/ChapterFour/0725.Split-Linked-List-in-Parts.md" >}})| Medium | O(n)| O(1)||
-|817. Linked List Components | [Go]({{< relref "/ChapterFour/0817.Linked-List-Components.md" >}})| Medium | O(n)| O(1)||
-|707. Design Linked List | [Go]({{< relref "/ChapterFour/0707.Design-Linked-List.md" >}})| Easy | O(n)| O(1)||
-|876. Middle of the Linked List | [Go]({{< relref "/ChapterFour/0876.Middle-of-the-Linked-List.md" >}})| Easy | 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)||
-|---------------------------------------------|---------------------------------|--------------------------|-----------------------|-----------|--------|
\ No newline at end of file
+
+| No. | Title | Solution | Difficulty | TimeComplexity | SpaceComplexity |Favorite| Acceptance |
+|:--------:|:------- | :--------: | :----------: | :----: | :-----: | :-----: |:-----: |
+|0002|Add Two Numbers|[Go]({{< relref "/ChapterFour/0001~0099/0002.Add-Two-Numbers.md" >}})|Medium| O(n)| O(1)||40.4%|
+|0019|Remove Nth Node From End of List|[Go]({{< relref "/ChapterFour/0001~0099/0019.Remove-Nth-Node-From-End-of-List.md" >}})|Medium| O(n)| O(1)||41.1%|
+|0021|Merge Two Sorted Lists|[Go]({{< relref "/ChapterFour/0001~0099/0021.Merge-Two-Sorted-Lists.md" >}})|Easy| O(log n)| O(1)||62.5%|
+|0023|Merge k Sorted Lists|[Go]({{< relref "/ChapterFour/0001~0099/0023.Merge-k-Sorted-Lists.md" >}})|Hard| O(log n)| O(1)|❤️|49.8%|
+|0024|Swap Nodes in Pairs|[Go]({{< relref "/ChapterFour/0001~0099/0024.Swap-Nodes-in-Pairs.md" >}})|Medium| O(n)| O(1)||61.3%|
+|0025|Reverse Nodes in k-Group|[Go]({{< relref "/ChapterFour/0001~0099/0025.Reverse-Nodes-in-k-Group.md" >}})|Hard| O(log n)| O(1)|❤️|54.7%|
+|0061|Rotate List|[Go]({{< relref "/ChapterFour/0001~0099/0061.Rotate-List.md" >}})|Medium| O(n)| O(1)||36.1%|
+|0082|Remove Duplicates from Sorted List II|[Go]({{< relref "/ChapterFour/0001~0099/0082.Remove-Duplicates-from-Sorted-List-II.md" >}})|Medium| O(n)| O(1)||45.9%|
+|0083|Remove Duplicates from Sorted List|[Go]({{< relref "/ChapterFour/0001~0099/0083.Remove-Duplicates-from-Sorted-List.md" >}})|Easy| O(n)| O(1)||50.6%|
+|0086|Partition List|[Go]({{< relref "/ChapterFour/0001~0099/0086.Partition-List.md" >}})|Medium| O(n)| O(1)|❤️|52.0%|
+|0092|Reverse Linked List II|[Go]({{< relref "/ChapterFour/0001~0099/0092.Reverse-Linked-List-II.md" >}})|Medium| O(n)| O(1)|❤️|45.4%|
+|0109|Convert Sorted List to Binary Search Tree|[Go]({{< relref "/ChapterFour/0100~0199/0109.Convert-Sorted-List-to-Binary-Search-Tree.md" >}})|Medium| O(log n)| O(n)||60.2%|
+|0114|Flatten Binary Tree to Linked List|[Go]({{< relref "/ChapterFour/0100~0199/0114.Flatten-Binary-Tree-to-Linked-List.md" >}})|Medium||||61.8%|
+|0116|Populating Next Right Pointers in Each Node|[Go]({{< relref "/ChapterFour/0100~0199/0116.Populating-Next-Right-Pointers-in-Each-Node.md" >}})|Medium||||60.4%|
+|0138|Copy List with Random Pointer|[Go]({{< relref "/ChapterFour/0100~0199/0138.Copy-List-with-Random-Pointer.md" >}})|Medium||||51.4%|
+|0141|Linked List Cycle|[Go]({{< relref "/ChapterFour/0100~0199/0141.Linked-List-Cycle.md" >}})|Easy| O(n)| O(1)|❤️|47.5%|
+|0142|Linked List Cycle II|[Go]({{< relref "/ChapterFour/0100~0199/0142.Linked-List-Cycle-II.md" >}})|Medium| O(n)| O(1)|❤️|48.8%|
+|0143|Reorder List|[Go]({{< relref "/ChapterFour/0100~0199/0143.Reorder-List.md" >}})|Medium| O(n)| O(1)|❤️|52.6%|
+|0146|LRU Cache|[Go]({{< relref "/ChapterFour/0100~0199/0146.LRU-Cache.md" >}})|Medium||||40.7%|
+|0147|Insertion Sort List|[Go]({{< relref "/ChapterFour/0100~0199/0147.Insertion-Sort-List.md" >}})|Medium| O(n)| O(1)|❤️|51.1%|
+|0148|Sort List|[Go]({{< relref "/ChapterFour/0100~0199/0148.Sort-List.md" >}})|Medium| O(n log n)| O(n)|❤️|55.1%|
+|0160|Intersection of Two Linked Lists|[Go]({{< relref "/ChapterFour/0100~0199/0160.Intersection-of-Two-Linked-Lists.md" >}})|Easy| O(n)| O(1)|❤️|54.4%|
+|0203|Remove Linked List Elements|[Go]({{< relref "/ChapterFour/0200~0299/0203.Remove-Linked-List-Elements.md" >}})|Easy| O(n)| O(1)||46.0%|
+|0206|Reverse Linked List|[Go]({{< relref "/ChapterFour/0200~0299/0206.Reverse-Linked-List.md" >}})|Easy| O(n)| O(1)||73.6%|
+|0234|Palindrome Linked List|[Go]({{< relref "/ChapterFour/0200~0299/0234.Palindrome-Linked-List.md" >}})|Easy| O(n)| O(1)||50.2%|
+|0237|Delete Node in a Linked List|[Go]({{< relref "/ChapterFour/0200~0299/0237.Delete-Node-in-a-Linked-List.md" >}})|Medium| O(n)| O(1)||76.0%|
+|0328|Odd Even Linked List|[Go]({{< relref "/ChapterFour/0300~0399/0328.Odd-Even-Linked-List.md" >}})|Medium| O(n)| O(1)||61.3%|
+|0382|Linked List Random Node|[Go]({{< relref "/ChapterFour/0300~0399/0382.Linked-List-Random-Node.md" >}})|Medium||||62.8%|
+|0445|Add Two Numbers II|[Go]({{< relref "/ChapterFour/0400~0499/0445.Add-Two-Numbers-II.md" >}})|Medium| O(n)| O(n)||59.6%|
+|0460|LFU Cache|[Go]({{< relref "/ChapterFour/0400~0499/0460.LFU-Cache.md" >}})|Hard||||43.0%|
+|0622|Design Circular Queue|[Go]({{< relref "/ChapterFour/0600~0699/0622.Design-Circular-Queue.md" >}})|Medium||||51.5%|
+|0705|Design HashSet|[Go]({{< relref "/ChapterFour/0700~0799/0705.Design-HashSet.md" >}})|Easy||||65.6%|
+|0706|Design HashMap|[Go]({{< relref "/ChapterFour/0700~0799/0706.Design-HashMap.md" >}})|Easy||||64.7%|
+|0707|Design Linked List|[Go]({{< relref "/ChapterFour/0700~0799/0707.Design-Linked-List.md" >}})|Medium| O(n)| O(1)||27.7%|
+|0725|Split Linked List in Parts|[Go]({{< relref "/ChapterFour/0700~0799/0725.Split-Linked-List-in-Parts.md" >}})|Medium| O(n)| O(1)||57.2%|
+|0817|Linked List Components|[Go]({{< relref "/ChapterFour/0800~0899/0817.Linked-List-Components.md" >}})|Medium| O(n)| O(1)||57.7%|
+|0876|Middle of the Linked List|[Go]({{< relref "/ChapterFour/0800~0899/0876.Middle-of-the-Linked-List.md" >}})|Easy| O(n)| O(1)|❤️|75.7%|
+|1019|Next Greater Node In Linked List|[Go]({{< relref "/ChapterFour/1000~1099/1019.Next-Greater-Node-In-Linked-List.md" >}})|Medium| O(n)| O(1)||59.9%|
+|1171|Remove Zero Sum Consecutive Nodes from Linked List|[Go]({{< relref "/ChapterFour/1100~1199/1171.Remove-Zero-Sum-Consecutive-Nodes-from-Linked-List.md" >}})|Medium||||43.2%|
+|1290|Convert Binary Number in a Linked List to Integer|[Go]({{< relref "/ChapterFour/1200~1299/1290.Convert-Binary-Number-in-a-Linked-List-to-Integer.md" >}})|Easy||||82.1%|
+|1669|Merge In Between Linked Lists|[Go]({{< relref "/ChapterFour/1600~1699/1669.Merge-In-Between-Linked-Lists.md" >}})|Medium||||73.7%|
+|1670|Design Front Middle Back Queue|[Go]({{< relref "/ChapterFour/1600~1699/1670.Design-Front-Middle-Back-Queue.md" >}})|Medium||||57.2%|
+|1721|Swapping Nodes in a Linked List|[Go]({{< relref "/ChapterFour/1700~1799/1721.Swapping-Nodes-in-a-Linked-List.md" >}})|Medium||||67.1%|
+|2181|Merge Nodes in Between Zeros|[Go]({{< relref "/ChapterFour/2100~2199/2181.Merge-Nodes-in-Between-Zeros.md" >}})|Medium||||86.3%|
+|------------|-------------------------------------------------------|-------| ----------------| ---------------|-------------|-------------|-------------|
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterTwo/Two_Pointers/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterTwo/Stack/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterTwo/Math.md b/website/content/ChapterTwo/Math.md
index b20da7a36..20e6ba342 100644
--- a/website/content/ChapterTwo/Math.md
+++ b/website/content/ChapterTwo/Math.md
@@ -1,28 +1,160 @@
---
-title: Math
+title: 2.12 Math
type: docs
+weight: 12
---
# Math
-| Title | Solution | Difficulty | Time | Space |收藏|
-| ----- | :--------: | :----------: | :----: | :-----: | :-----: |
-|2. Add Two Numbers | [Go]({{< relref "/ChapterFour/0002.Add-Two-Numbers.md" >}})| Medium | O(n)| O(1)||
-|50. Pow(x, n) | [Go]({{< relref "/ChapterFour/0050.Powx-n.md" >}})| Medium | O(log n)| O(1)||
-|60. Permutation Sequence | [Go]({{< relref "/ChapterFour/0060.Permutation-Sequence.md" >}})| Medium | O(n log n)| O(1)||
-|69. Sqrt(x) | [Go]({{< relref "/ChapterFour/0069.Sqrtx.md" >}})| Easy | O(log n)| O(1)||
-|202. Happy Number | [Go]({{< relref "/ChapterFour/0202.Happy-Number.md" >}})| Easy | O(log n)| O(1)||
-|224. Basic Calculator | [Go]({{< relref "/ChapterFour/0224.Basic-Calculator.md" >}})| Hard | O(n)| O(n)||
-|231. Power of Two | [Go]({{< relref "/ChapterFour/0231.Power-of-Two.md" >}})| Easy | O(1)| O(1)||
-|263. Ugly Number | [Go]({{< relref "/ChapterFour/0263.Ugly-Number.md" >}})| Easy | O(log n)| O(1)||
-|326. Power of Three | [Go]({{< relref "/ChapterFour/0326.Power-of-Three.md" >}})| Easy | O(1)| O(1)||
-|343. Integer Break | [Go]({{< relref "/ChapterFour/0343.Integer-Break.md" >}})| Medium | O(n^2)| O(n)||
-|357. Count Numbers with Unique Digits | [Go]({{< relref "/ChapterFour/0357.Count-Numbers-with-Unique-Digits.md" >}})| Medium | O(1)| O(1)||
-|628. Maximum Product of Three Numbers | [Go]({{< relref "/ChapterFour/0628.Maximum-Product-of-Three-Numbers.md" >}})| Easy | O(n)| O(1)||
-|885. Spiral Matrix III | [Go]({{< relref "/ChapterFour/0885.Spiral-Matrix-III.md" >}})| Medium | O(n^2)| O(1)||
-|891. Sum of Subsequence Widths | [Go]({{< relref "/ChapterFour/0891.Sum-of-Subsequence-Widths.md" >}})| Hard | O(n log n)| O(1)||
-|942. DI String Match | [Go]({{< relref "/ChapterFour/0942.DI-String-Match.md" >}})| Easy | O(n)| O(1)||
-|976. Largest Perimeter Triangle | [Go]({{< relref "/ChapterFour/0976.Largest-Perimeter-Triangle.md" >}})| Easy | O(n log n)| O(log n) ||
-|996. Number of Squareful Arrays | [Go]({{< relref "/ChapterFour/0996.Number-of-Squareful-Arrays.md" >}})| Hard | O(n log n)| O(n) ||
-|1025. Divisor Game | [Go]({{< relref "/ChapterFour/1025.Divisor-Game.md" >}})| Easy | O(1)| O(1)||
-|---------------------------------------|---------------------------------|--------------------------|-----------------------|-----------|--------|
\ No newline at end of file
+
+| No. | Title | Solution | Difficulty | TimeComplexity | SpaceComplexity |Favorite| Acceptance |
+|:--------:|:------- | :--------: | :----------: | :----: | :-----: | :-----: |:-----: |
+|0002|Add Two Numbers|[Go]({{< relref "/ChapterFour/0001~0099/0002.Add-Two-Numbers.md" >}})|Medium| O(n)| O(1)||40.4%|
+|0007|Reverse Integer|[Go]({{< relref "/ChapterFour/0001~0099/0007.Reverse-Integer.md" >}})|Medium||||27.5%|
+|0009|Palindrome Number|[Go]({{< relref "/ChapterFour/0001~0099/0009.Palindrome-Number.md" >}})|Easy||||53.5%|
+|0012|Integer to Roman|[Go]({{< relref "/ChapterFour/0001~0099/0012.Integer-to-Roman.md" >}})|Medium||||62.0%|
+|0013|Roman to Integer|[Go]({{< relref "/ChapterFour/0001~0099/0013.Roman-to-Integer.md" >}})|Easy||||58.6%|
+|0029|Divide Two Integers|[Go]({{< relref "/ChapterFour/0001~0099/0029.Divide-Two-Integers.md" >}})|Medium||||17.2%|
+|0043|Multiply Strings|[Go]({{< relref "/ChapterFour/0001~0099/0043.Multiply-Strings.md" >}})|Medium||||39.2%|
+|0048|Rotate Image|[Go]({{< relref "/ChapterFour/0001~0099/0048.Rotate-Image.md" >}})|Medium||||71.0%|
+|0050|Pow(x, n)|[Go]({{< relref "/ChapterFour/0001~0099/0050.Powx-n.md" >}})|Medium| O(log n)| O(1)||33.0%|
+|0060|Permutation Sequence|[Go]({{< relref "/ChapterFour/0001~0099/0060.Permutation-Sequence.md" >}})|Hard| O(n log n)| O(1)||44.4%|
+|0062|Unique Paths|[Go]({{< relref "/ChapterFour/0001~0099/0062.Unique-Paths.md" >}})|Medium||||62.7%|
+|0066|Plus One|[Go]({{< relref "/ChapterFour/0001~0099/0066.Plus-One.md" >}})|Easy||||43.7%|
+|0067|Add Binary|[Go]({{< relref "/ChapterFour/0001~0099/0067.Add-Binary.md" >}})|Easy||||52.4%|
+|0069|Sqrt(x)|[Go]({{< relref "/ChapterFour/0001~0099/0069.Sqrtx.md" >}})|Easy| O(log n)| O(1)||37.4%|
+|0070|Climbing Stairs|[Go]({{< relref "/ChapterFour/0001~0099/0070.Climbing-Stairs.md" >}})|Easy||||52.2%|
+|0089|Gray Code|[Go]({{< relref "/ChapterFour/0001~0099/0089.Gray-Code.md" >}})|Medium||||57.2%|
+|0096|Unique Binary Search Trees|[Go]({{< relref "/ChapterFour/0001~0099/0096.Unique-Binary-Search-Trees.md" >}})|Medium||||59.7%|
+|0150|Evaluate Reverse Polish Notation|[Go]({{< relref "/ChapterFour/0100~0199/0150.Evaluate-Reverse-Polish-Notation.md" >}})|Medium||||45.8%|
+|0168|Excel Sheet Column Title|[Go]({{< relref "/ChapterFour/0100~0199/0168.Excel-Sheet-Column-Title.md" >}})|Easy||||35.5%|
+|0171|Excel Sheet Column Number|[Go]({{< relref "/ChapterFour/0100~0199/0171.Excel-Sheet-Column-Number.md" >}})|Easy||||62.1%|
+|0172|Factorial Trailing Zeroes|[Go]({{< relref "/ChapterFour/0100~0199/0172.Factorial-Trailing-Zeroes.md" >}})|Medium||||42.2%|
+|0189|Rotate Array|[Go]({{< relref "/ChapterFour/0100~0199/0189.Rotate-Array.md" >}})|Medium||||39.4%|
+|0202|Happy Number|[Go]({{< relref "/ChapterFour/0200~0299/0202.Happy-Number.md" >}})|Easy| O(log n)| O(1)||54.8%|
+|0204|Count Primes|[Go]({{< relref "/ChapterFour/0200~0299/0204.Count-Primes.md" >}})|Medium||||33.1%|
+|0223|Rectangle Area|[Go]({{< relref "/ChapterFour/0200~0299/0223.Rectangle-Area.md" >}})|Medium||||45.1%|
+|0224|Basic Calculator|[Go]({{< relref "/ChapterFour/0200~0299/0224.Basic-Calculator.md" >}})|Hard| O(n)| O(n)||42.4%|
+|0227|Basic Calculator II|[Go]({{< relref "/ChapterFour/0200~0299/0227.Basic-Calculator-II.md" >}})|Medium||||42.4%|
+|0231|Power of Two|[Go]({{< relref "/ChapterFour/0200~0299/0231.Power-of-Two.md" >}})|Easy| O(1)| O(1)||46.0%|
+|0258|Add Digits|[Go]({{< relref "/ChapterFour/0200~0299/0258.Add-Digits.md" >}})|Easy||||64.0%|
+|0263|Ugly Number|[Go]({{< relref "/ChapterFour/0200~0299/0263.Ugly-Number.md" >}})|Easy| O(log n)| O(1)||42.3%|
+|0264|Ugly Number II|[Go]({{< relref "/ChapterFour/0200~0299/0264.Ugly-Number-II.md" >}})|Medium||||46.2%|
+|0268|Missing Number|[Go]({{< relref "/ChapterFour/0200~0299/0268.Missing-Number.md" >}})|Easy||||62.6%|
+|0279|Perfect Squares|[Go]({{< relref "/ChapterFour/0200~0299/0279.Perfect-Squares.md" >}})|Medium||||52.7%|
+|0319|Bulb Switcher|[Go]({{< relref "/ChapterFour/0300~0399/0319.Bulb-Switcher.md" >}})|Medium||||48.3%|
+|0326|Power of Three|[Go]({{< relref "/ChapterFour/0300~0399/0326.Power-of-Three.md" >}})|Easy| O(1)| O(1)||45.5%|
+|0342|Power of Four|[Go]({{< relref "/ChapterFour/0300~0399/0342.Power-of-Four.md" >}})|Easy||||46.2%|
+|0343|Integer Break|[Go]({{< relref "/ChapterFour/0300~0399/0343.Integer-Break.md" >}})|Medium| O(n^2)| O(n)||56.1%|
+|0357|Count Numbers with Unique Digits|[Go]({{< relref "/ChapterFour/0300~0399/0357.Count-Numbers-with-Unique-Digits.md" >}})|Medium| O(1)| O(1)||51.9%|
+|0367|Valid Perfect Square|[Go]({{< relref "/ChapterFour/0300~0399/0367.Valid-Perfect-Square.md" >}})|Easy||||43.3%|
+|0368|Largest Divisible Subset|[Go]({{< relref "/ChapterFour/0300~0399/0368.Largest-Divisible-Subset.md" >}})|Medium||||41.6%|
+|0371|Sum of Two Integers|[Go]({{< relref "/ChapterFour/0300~0399/0371.Sum-of-Two-Integers.md" >}})|Medium||||50.7%|
+|0372|Super Pow|[Go]({{< relref "/ChapterFour/0300~0399/0372.Super-Pow.md" >}})|Medium||||36.3%|
+|0382|Linked List Random Node|[Go]({{< relref "/ChapterFour/0300~0399/0382.Linked-List-Random-Node.md" >}})|Medium||||62.8%|
+|0384|Shuffle an Array|[Go]({{< relref "/ChapterFour/0300~0399/0384.Shuffle-an-Array.md" >}})|Medium||||57.8%|
+|0390|Elimination Game|[Go]({{< relref "/ChapterFour/0300~0399/0390.Elimination-Game.md" >}})|Medium||||46.1%|
+|0396|Rotate Function|[Go]({{< relref "/ChapterFour/0300~0399/0396.Rotate-Function.md" >}})|Medium||||41.1%|
+|0400|Nth Digit|[Go]({{< relref "/ChapterFour/0400~0499/0400.Nth-Digit.md" >}})|Medium||||34.1%|
+|0405|Convert a Number to Hexadecimal|[Go]({{< relref "/ChapterFour/0400~0499/0405.Convert-a-Number-to-Hexadecimal.md" >}})|Easy||||46.8%|
+|0412|Fizz Buzz|[Go]({{< relref "/ChapterFour/0400~0499/0412.Fizz-Buzz.md" >}})|Easy||||70.0%|
+|0423|Reconstruct Original Digits from English|[Go]({{< relref "/ChapterFour/0400~0499/0423.Reconstruct-Original-Digits-from-English.md" >}})|Medium||||51.2%|
+|0441|Arranging Coins|[Go]({{< relref "/ChapterFour/0400~0499/0441.Arranging-Coins.md" >}})|Easy||||46.2%|
+|0445|Add Two Numbers II|[Go]({{< relref "/ChapterFour/0400~0499/0445.Add-Two-Numbers-II.md" >}})|Medium||||59.6%|
+|0447|Number of Boomerangs|[Go]({{< relref "/ChapterFour/0400~0499/0447.Number-of-Boomerangs.md" >}})|Medium||||54.9%|
+|0453|Minimum Moves to Equal Array Elements|[Go]({{< relref "/ChapterFour/0400~0499/0453.Minimum-Moves-to-Equal-Array-Elements.md" >}})|Medium||||56.0%|
+|0458|Poor Pigs|[Go]({{< relref "/ChapterFour/0400~0499/0458.Poor-Pigs.md" >}})|Hard||||62.8%|
+|0462|Minimum Moves to Equal Array Elements II|[Go]({{< relref "/ChapterFour/0400~0499/0462.Minimum-Moves-to-Equal-Array-Elements-II.md" >}})|Medium||||60.0%|
+|0470|Implement Rand10() Using Rand7()|[Go]({{< relref "/ChapterFour/0400~0499/0470.Implement-Rand10-Using-Rand7.md" >}})|Medium||||46.4%|
+|0477|Total Hamming Distance|[Go]({{< relref "/ChapterFour/0400~0499/0477.Total-Hamming-Distance.md" >}})|Medium||||52.2%|
+|0478|Generate Random Point in a Circle|[Go]({{< relref "/ChapterFour/0400~0499/0478.Generate-Random-Point-in-a-Circle.md" >}})|Medium||||39.6%|
+|0483|Smallest Good Base|[Go]({{< relref "/ChapterFour/0400~0499/0483.Smallest-Good-Base.md" >}})|Hard||||38.8%|
+|0492|Construct the Rectangle|[Go]({{< relref "/ChapterFour/0400~0499/0492.Construct-the-Rectangle.md" >}})|Easy||||54.8%|
+|0497|Random Point in Non-overlapping Rectangles|[Go]({{< relref "/ChapterFour/0400~0499/0497.Random-Point-in-Non-overlapping-Rectangles.md" >}})|Medium||||39.4%|
+|0504|Base 7|[Go]({{< relref "/ChapterFour/0500~0599/0504.Base-7.md" >}})|Easy||||48.5%|
+|0507|Perfect Number|[Go]({{< relref "/ChapterFour/0500~0599/0507.Perfect-Number.md" >}})|Easy||||37.7%|
+|0509|Fibonacci Number|[Go]({{< relref "/ChapterFour/0500~0599/0509.Fibonacci-Number.md" >}})|Easy||||69.8%|
+|0519|Random Flip Matrix|[Go]({{< relref "/ChapterFour/0500~0599/0519.Random-Flip-Matrix.md" >}})|Medium||||40.0%|
+|0523|Continuous Subarray Sum|[Go]({{< relref "/ChapterFour/0500~0599/0523.Continuous-Subarray-Sum.md" >}})|Medium||||28.5%|
+|0528|Random Pick with Weight|[Go]({{< relref "/ChapterFour/0500~0599/0528.Random-Pick-with-Weight.md" >}})|Medium||||46.1%|
+|0537|Complex Number Multiplication|[Go]({{< relref "/ChapterFour/0500~0599/0537.Complex-Number-Multiplication.md" >}})|Medium||||71.4%|
+|0598|Range Addition II|[Go]({{< relref "/ChapterFour/0500~0599/0598.Range-Addition-II.md" >}})|Easy||||55.3%|
+|0628|Maximum Product of Three Numbers|[Go]({{< relref "/ChapterFour/0600~0699/0628.Maximum-Product-of-Three-Numbers.md" >}})|Easy| O(n)| O(1)||45.9%|
+|0633|Sum of Square Numbers|[Go]({{< relref "/ChapterFour/0600~0699/0633.Sum-of-Square-Numbers.md" >}})|Medium||||34.4%|
+|0667|Beautiful Arrangement II|[Go]({{< relref "/ChapterFour/0600~0699/0667.Beautiful-Arrangement-II.md" >}})|Medium||||59.8%|
+|0668|Kth Smallest Number in Multiplication Table|[Go]({{< relref "/ChapterFour/0600~0699/0668.Kth-Smallest-Number-in-Multiplication-Table.md" >}})|Hard||||51.4%|
+|0710|Random Pick with Blacklist|[Go]({{< relref "/ChapterFour/0700~0799/0710.Random-Pick-with-Blacklist.md" >}})|Hard||||33.5%|
+|0728|Self Dividing Numbers|[Go]({{< relref "/ChapterFour/0700~0799/0728.Self-Dividing-Numbers.md" >}})|Easy||||77.9%|
+|0762|Prime Number of Set Bits in Binary Representation|[Go]({{< relref "/ChapterFour/0700~0799/0762.Prime-Number-of-Set-Bits-in-Binary-Representation.md" >}})|Easy||||68.0%|
+|0775|Global and Local Inversions|[Go]({{< relref "/ChapterFour/0700~0799/0775.Global-and-Local-Inversions.md" >}})|Medium||||43.3%|
+|0781|Rabbits in Forest|[Go]({{< relref "/ChapterFour/0700~0799/0781.Rabbits-in-Forest.md" >}})|Medium||||54.7%|
+|0793|Preimage Size of Factorial Zeroes Function|[Go]({{< relref "/ChapterFour/0700~0799/0793.Preimage-Size-of-Factorial-Zeroes-Function.md" >}})|Hard||||43.2%|
+|0810|Chalkboard XOR Game|[Go]({{< relref "/ChapterFour/0800~0899/0810.Chalkboard-XOR-Game.md" >}})|Hard||||55.8%|
+|0812|Largest Triangle Area|[Go]({{< relref "/ChapterFour/0800~0899/0812.Largest-Triangle-Area.md" >}})|Easy||||59.9%|
+|0836|Rectangle Overlap|[Go]({{< relref "/ChapterFour/0800~0899/0836.Rectangle-Overlap.md" >}})|Easy||||43.9%|
+|0869|Reordered Power of 2|[Go]({{< relref "/ChapterFour/0800~0899/0869.Reordered-Power-of-2.md" >}})|Medium||||63.5%|
+|0877|Stone Game|[Go]({{< relref "/ChapterFour/0800~0899/0877.Stone-Game.md" >}})|Medium||||69.7%|
+|0878|Nth Magical Number|[Go]({{< relref "/ChapterFour/0800~0899/0878.Nth-Magical-Number.md" >}})|Hard||||35.4%|
+|0887|Super Egg Drop|[Go]({{< relref "/ChapterFour/0800~0899/0887.Super-Egg-Drop.md" >}})|Hard||||27.1%|
+|0891|Sum of Subsequence Widths|[Go]({{< relref "/ChapterFour/0800~0899/0891.Sum-of-Subsequence-Widths.md" >}})|Hard| O(n log n)| O(1)||36.7%|
+|0892|Surface Area of 3D Shapes|[Go]({{< relref "/ChapterFour/0800~0899/0892.Surface-Area-of-3D-Shapes.md" >}})|Easy||||64.0%|
+|0910|Smallest Range II|[Go]({{< relref "/ChapterFour/0900~0999/0910.Smallest-Range-II.md" >}})|Medium||||35.2%|
+|0914|X of a Kind in a Deck of Cards|[Go]({{< relref "/ChapterFour/0900~0999/0914.X-of-a-Kind-in-a-Deck-of-Cards.md" >}})|Easy||||31.2%|
+|0920|Number of Music Playlists|[Go]({{< relref "/ChapterFour/0900~0999/0920.Number-of-Music-Playlists.md" >}})|Hard||||50.7%|
+|0927|Three Equal Parts|[Go]({{< relref "/ChapterFour/0900~0999/0927.Three-Equal-Parts.md" >}})|Hard||||39.6%|
+|0952|Largest Component Size by Common Factor|[Go]({{< relref "/ChapterFour/0900~0999/0952.Largest-Component-Size-by-Common-Factor.md" >}})|Hard||||40.0%|
+|0970|Powerful Integers|[Go]({{< relref "/ChapterFour/0900~0999/0970.Powerful-Integers.md" >}})|Medium||||43.6%|
+|0973|K Closest Points to Origin|[Go]({{< relref "/ChapterFour/0900~0999/0973.K-Closest-Points-to-Origin.md" >}})|Medium||||65.7%|
+|0976|Largest Perimeter Triangle|[Go]({{< relref "/ChapterFour/0900~0999/0976.Largest-Perimeter-Triangle.md" >}})|Easy| O(n log n)| O(log n) ||54.7%|
+|0989|Add to Array-Form of Integer|[Go]({{< relref "/ChapterFour/0900~0999/0989.Add-to-Array-Form-of-Integer.md" >}})|Easy||||47.1%|
+|0991|Broken Calculator|[Go]({{< relref "/ChapterFour/0900~0999/0991.Broken-Calculator.md" >}})|Medium||||54.1%|
+|0996|Number of Squareful Arrays|[Go]({{< relref "/ChapterFour/0900~0999/0996.Number-of-Squareful-Arrays.md" >}})|Hard| O(n log n)| O(n) ||49.2%|
+|1006|Clumsy Factorial|[Go]({{< relref "/ChapterFour/1000~1099/1006.Clumsy-Factorial.md" >}})|Medium||||55.5%|
+|1017|Convert to Base -2|[Go]({{< relref "/ChapterFour/1000~1099/1017.Convert-to-Base-2.md" >}})|Medium||||60.9%|
+|1025|Divisor Game|[Go]({{< relref "/ChapterFour/1000~1099/1025.Divisor-Game.md" >}})|Easy| O(1)| O(1)||67.6%|
+|1030|Matrix Cells in Distance Order|[Go]({{< relref "/ChapterFour/1000~1099/1030.Matrix-Cells-in-Distance-Order.md" >}})|Easy||||69.7%|
+|1037|Valid Boomerang|[Go]({{< relref "/ChapterFour/1000~1099/1037.Valid-Boomerang.md" >}})|Easy||||37.0%|
+|1040|Moving Stones Until Consecutive II|[Go]({{< relref "/ChapterFour/1000~1099/1040.Moving-Stones-Until-Consecutive-II.md" >}})|Medium||||55.9%|
+|1073|Adding Two Negabinary Numbers|[Go]({{< relref "/ChapterFour/1000~1099/1073.Adding-Two-Negabinary-Numbers.md" >}})|Medium||||36.5%|
+|1093|Statistics from a Large Sample|[Go]({{< relref "/ChapterFour/1000~1099/1093.Statistics-from-a-Large-Sample.md" >}})|Medium||||43.5%|
+|1104|Path In Zigzag Labelled Binary Tree|[Go]({{< relref "/ChapterFour/1100~1199/1104.Path-In-Zigzag-Labelled-Binary-Tree.md" >}})|Medium||||75.1%|
+|1137|N-th Tribonacci Number|[Go]({{< relref "/ChapterFour/1100~1199/1137.N-th-Tribonacci-Number.md" >}})|Easy||||63.7%|
+|1154|Day of the Year|[Go]({{< relref "/ChapterFour/1100~1199/1154.Day-of-the-Year.md" >}})|Easy||||49.6%|
+|1175|Prime Arrangements|[Go]({{< relref "/ChapterFour/1100~1199/1175.Prime-Arrangements.md" >}})|Easy||||54.7%|
+|1185|Day of the Week|[Go]({{< relref "/ChapterFour/1100~1199/1185.Day-of-the-Week.md" >}})|Easy||||57.4%|
+|1201|Ugly Number III|[Go]({{< relref "/ChapterFour/1200~1299/1201.Ugly-Number-III.md" >}})|Medium||||28.9%|
+|1217|Minimum Cost to Move Chips to The Same Position|[Go]({{< relref "/ChapterFour/1200~1299/1217.Minimum-Cost-to-Move-Chips-to-The-Same-Position.md" >}})|Easy||||71.9%|
+|1232|Check If It Is a Straight Line|[Go]({{< relref "/ChapterFour/1200~1299/1232.Check-If-It-Is-a-Straight-Line.md" >}})|Easy||||40.3%|
+|1252|Cells with Odd Values in a Matrix|[Go]({{< relref "/ChapterFour/1200~1299/1252.Cells-with-Odd-Values-in-a-Matrix.md" >}})|Easy||||78.5%|
+|1266|Minimum Time Visiting All Points|[Go]({{< relref "/ChapterFour/1200~1299/1266.Minimum-Time-Visiting-All-Points.md" >}})|Easy||||79.1%|
+|1281|Subtract the Product and Sum of Digits of an Integer|[Go]({{< relref "/ChapterFour/1200~1299/1281.Subtract-the-Product-and-Sum-of-Digits-of-an-Integer.md" >}})|Easy||||86.6%|
+|1290|Convert Binary Number in a Linked List to Integer|[Go]({{< relref "/ChapterFour/1200~1299/1290.Convert-Binary-Number-in-a-Linked-List-to-Integer.md" >}})|Easy||||82.1%|
+|1304|Find N Unique Integers Sum up to Zero|[Go]({{< relref "/ChapterFour/1300~1399/1304.Find-N-Unique-Integers-Sum-up-to-Zero.md" >}})|Easy||||76.9%|
+|1317|Convert Integer to the Sum of Two No-Zero Integers|[Go]({{< relref "/ChapterFour/1300~1399/1317.Convert-Integer-to-the-Sum-of-Two-No-Zero-Integers.md" >}})|Easy||||55.4%|
+|1442|Count Triplets That Can Form Two Arrays of Equal XOR|[Go]({{< relref "/ChapterFour/1400~1499/1442.Count-Triplets-That-Can-Form-Two-Arrays-of-Equal-XOR.md" >}})|Medium||||76.1%|
+|1486|XOR Operation in an Array|[Go]({{< relref "/ChapterFour/1400~1499/1486.XOR-Operation-in-an-Array.md" >}})|Easy||||84.6%|
+|1512|Number of Good Pairs|[Go]({{< relref "/ChapterFour/1500~1599/1512.Number-of-Good-Pairs.md" >}})|Easy||||88.2%|
+|1518|Water Bottles|[Go]({{< relref "/ChapterFour/1500~1599/1518.Water-Bottles.md" >}})|Easy||||60.5%|
+|1551|Minimum Operations to Make Array Equal|[Go]({{< relref "/ChapterFour/1500~1599/1551.Minimum-Operations-to-Make-Array-Equal.md" >}})|Medium||||81.5%|
+|1573|Number of Ways to Split a String|[Go]({{< relref "/ChapterFour/1500~1599/1573.Number-of-Ways-to-Split-a-String.md" >}})|Medium||||32.5%|
+|1641|Count Sorted Vowel Strings|[Go]({{< relref "/ChapterFour/1600~1699/1641.Count-Sorted-Vowel-Strings.md" >}})|Medium||||77.4%|
+|1648|Sell Diminishing-Valued Colored Balls|[Go]({{< relref "/ChapterFour/1600~1699/1648.Sell-Diminishing-Valued-Colored-Balls.md" >}})|Medium||||30.4%|
+|1680|Concatenation of Consecutive Binary Numbers|[Go]({{< relref "/ChapterFour/1600~1699/1680.Concatenation-of-Consecutive-Binary-Numbers.md" >}})|Medium||||57.0%|
+|1685|Sum of Absolute Differences in a Sorted Array|[Go]({{< relref "/ChapterFour/1600~1699/1685.Sum-of-Absolute-Differences-in-a-Sorted-Array.md" >}})|Medium||||63.5%|
+|1688|Count of Matches in Tournament|[Go]({{< relref "/ChapterFour/1600~1699/1688.Count-of-Matches-in-Tournament.md" >}})|Easy||||83.1%|
+|1690|Stone Game VII|[Go]({{< relref "/ChapterFour/1600~1699/1690.Stone-Game-VII.md" >}})|Medium||||58.1%|
+|1716|Calculate Money in Leetcode Bank|[Go]({{< relref "/ChapterFour/1700~1799/1716.Calculate-Money-in-Leetcode-Bank.md" >}})|Easy||||66.1%|
+|1742|Maximum Number of Balls in a Box|[Go]({{< relref "/ChapterFour/1700~1799/1742.Maximum-Number-of-Balls-in-a-Box.md" >}})|Easy||||73.6%|
+|2038|Remove Colored Pieces if Both Neighbors are the Same Color|[Go]({{< relref "/ChapterFour/2000~2099/2038.Remove-Colored-Pieces-if-Both-Neighbors-are-the-Same-Color.md" >}})|Medium||||57.9%|
+|2165|Smallest Value of the Rearranged Number|[Go]({{< relref "/ChapterFour/2100~2199/2165.Smallest-Value-of-the-Rearranged-Number.md" >}})|Medium||||51.4%|
+|2169|Count Operations to Obtain Zero|[Go]({{< relref "/ChapterFour/2100~2199/2169.Count-Operations-to-Obtain-Zero.md" >}})|Easy||||75.2%|
+|2180|Count Integers With Even Digit Sum|[Go]({{< relref "/ChapterFour/2100~2199/2180.Count-Integers-With-Even-Digit-Sum.md" >}})|Easy||||65.5%|
+|2183|Count Array Pairs Divisible by K|[Go]({{< relref "/ChapterFour/2100~2199/2183.Count-Array-Pairs-Divisible-by-K.md" >}})|Hard||||28.3%|
+|------------|-------------------------------------------------------|-------| ----------------| ---------------|-------------|-------------|-------------|
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterTwo/Binary_Search/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterTwo/Hash_Table/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterTwo/Segment_Tree.md b/website/content/ChapterTwo/Segment_Tree.md
index fb0c06b9e..85d41ea58 100644
--- a/website/content/ChapterTwo/Segment_Tree.md
+++ b/website/content/ChapterTwo/Segment_Tree.md
@@ -1,6 +1,7 @@
---
-title: Segment Tree
+title: 2.18 ✅ Segment Tree
type: docs
+weight: 18
---
# Segment Tree
@@ -33,16 +34,26 @@ type: docs
[HDU 1542 Atlantis](http://acm.hdu.edu.cn/showproblem.php?pid=1542) update:区间增减 query:直接取根节点的值
[HDU 1828 Picture](http://acm.hdu.edu.cn/showproblem.php?pid=1828) update:区间增减 query:直接取根节点的值
-| Title | Solution | Difficulty | Time | Space | 收藏 |
-| ----- | :--------: | :----------: | :----: | :-----: |:-----: |
-|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
+
+| No. | Title | Solution | Difficulty | TimeComplexity | SpaceComplexity |Favorite| Acceptance |
+|:--------:|:------- | :--------: | :----------: | :----: | :-----: | :-----: |:-----: |
+|0218|The Skyline Problem|[Go]({{< relref "/ChapterFour/0200~0299/0218.The-Skyline-Problem.md" >}})|Hard| O(n log n)| O(n)|❤️|41.9%|
+|0307|Range Sum Query - Mutable|[Go]({{< relref "/ChapterFour/0300~0399/0307.Range-Sum-Query-Mutable.md" >}})|Medium| O(1)| O(n)||40.7%|
+|0315|Count of Smaller Numbers After Self|[Go]({{< relref "/ChapterFour/0300~0399/0315.Count-of-Smaller-Numbers-After-Self.md" >}})|Hard| O(n log n)| O(n)||42.6%|
+|0327|Count of Range Sum|[Go]({{< relref "/ChapterFour/0300~0399/0327.Count-of-Range-Sum.md" >}})|Hard| O(n log n)| O(n)|❤️|35.8%|
+|0493|Reverse Pairs|[Go]({{< relref "/ChapterFour/0400~0499/0493.Reverse-Pairs.md" >}})|Hard| O(n log n)| O(n)||30.9%|
+|0699|Falling Squares|[Go]({{< relref "/ChapterFour/0600~0699/0699.Falling-Squares.md" >}})|Hard| O(n log n)| O(n)|❤️|44.7%|
+|0715|Range Module|[Go]({{< relref "/ChapterFour/0700~0799/0715.Range-Module.md" >}})|Hard| O(log n)| O(n)|❤️|44.6%|
+|0729|My Calendar I|[Go]({{< relref "/ChapterFour/0700~0799/0729.My-Calendar-I.md" >}})|Medium||||56.8%|
+|0732|My Calendar III|[Go]({{< relref "/ChapterFour/0700~0799/0732.My-Calendar-III.md" >}})|Hard| O(log n)| O(n)|❤️|71.5%|
+|0850|Rectangle Area II|[Go]({{< relref "/ChapterFour/0800~0899/0850.Rectangle-Area-II.md" >}})|Hard| O(n log n)| O(n)|❤️|53.9%|
+|1157|Online Majority Element In Subarray|[Go]({{< relref "/ChapterFour/1100~1199/1157.Online-Majority-Element-In-Subarray.md" >}})|Hard| O(log n)| O(n)|❤️|41.8%|
+|1649|Create Sorted Array through Instructions|[Go]({{< relref "/ChapterFour/1600~1699/1649.Create-Sorted-Array-through-Instructions.md" >}})|Hard||||37.5%|
+|------------|-------------------------------------------------------|-------| ----------------| ---------------|-------------|-------------|-------------|
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterTwo/Sliding_Window/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterTwo/Binary_Indexed_Tree/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterTwo/Sliding_Window.md b/website/content/ChapterTwo/Sliding_Window.md
index 2ffd90d7e..f0e75b163 100644
--- a/website/content/ChapterTwo/Sliding_Window.md
+++ b/website/content/ChapterTwo/Sliding_Window.md
@@ -1,6 +1,7 @@
---
-title: Sliding Window
+title: 2.17 ✅ Sliding Window
type: docs
+weight: 17
---
# Sliding Window
@@ -25,19 +26,49 @@ type: docs
```
- 滑动窗口经典题。第 239 题，第 480 题。
-| Title | Solution | Difficulty | Time | Space | 收藏 |
-| ----- | :--------: | :----------: | :----: | :-----: |:-----: |
-|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
+
+| No. | Title | Solution | Difficulty | TimeComplexity | SpaceComplexity |Favorite| Acceptance |
+|:--------:|:------- | :--------: | :----------: | :----: | :-----: | :-----: |:-----: |
+|0003|Longest Substring Without Repeating Characters|[Go]({{< relref "/ChapterFour/0001~0099/0003.Longest-Substring-Without-Repeating-Characters.md" >}})|Medium| O(n)| O(1)|❤️|33.8%|
+|0030|Substring with Concatenation of All Words|[Go]({{< relref "/ChapterFour/0001~0099/0030.Substring-with-Concatenation-of-All-Words.md" >}})|Hard||||31.2%|
+|0076|Minimum Window Substring|[Go]({{< relref "/ChapterFour/0001~0099/0076.Minimum-Window-Substring.md" >}})|Hard| O(n)| O(n)|❤️|40.9%|
+|0187|Repeated DNA Sequences|[Go]({{< relref "/ChapterFour/0100~0199/0187.Repeated-DNA-Sequences.md" >}})|Medium||||47.0%|
+|0209|Minimum Size Subarray Sum|[Go]({{< relref "/ChapterFour/0200~0299/0209.Minimum-Size-Subarray-Sum.md" >}})|Medium||||45.0%|
+|0219|Contains Duplicate II|[Go]({{< relref "/ChapterFour/0200~0299/0219.Contains-Duplicate-II.md" >}})|Easy||||42.6%|
+|0220|Contains Duplicate III|[Go]({{< relref "/ChapterFour/0200~0299/0220.Contains-Duplicate-III.md" >}})|Hard||||22.1%|
+|0239|Sliding Window Maximum|[Go]({{< relref "/ChapterFour/0200~0299/0239.Sliding-Window-Maximum.md" >}})|Hard| O(n * k)| O(n)|❤️|46.3%|
+|0395|Longest Substring with At Least K Repeating Characters|[Go]({{< relref "/ChapterFour/0300~0399/0395.Longest-Substring-with-At-Least-K-Repeating-Characters.md" >}})|Medium||||44.8%|
+|0424|Longest Repeating Character Replacement|[Go]({{< relref "/ChapterFour/0400~0499/0424.Longest-Repeating-Character-Replacement.md" >}})|Medium| O(n)| O(1) ||52.0%|
+|0438|Find All Anagrams in a String|[Go]({{< relref "/ChapterFour/0400~0499/0438.Find-All-Anagrams-in-a-String.md" >}})|Medium||||50.2%|
+|0480|Sliding Window Median|[Go]({{< relref "/ChapterFour/0400~0499/0480.Sliding-Window-Median.md" >}})|Hard| O(n * log k)| O(k)|❤️|41.1%|
+|0567|Permutation in String|[Go]({{< relref "/ChapterFour/0500~0599/0567.Permutation-in-String.md" >}})|Medium| O(n)| O(1)|❤️|44.3%|
+|0632|Smallest Range Covering Elements from K Lists|[Go]({{< relref "/ChapterFour/0600~0699/0632.Smallest-Range-Covering-Elements-from-K-Lists.md" >}})|Hard||||61.0%|
+|0643|Maximum Average Subarray I|[Go]({{< relref "/ChapterFour/0600~0699/0643.Maximum-Average-Subarray-I.md" >}})|Easy||||43.7%|
+|0658|Find K Closest Elements|[Go]({{< relref "/ChapterFour/0600~0699/0658.Find-K-Closest-Elements.md" >}})|Medium||||46.8%|
+|0713|Subarray Product Less Than K|[Go]({{< relref "/ChapterFour/0700~0799/0713.Subarray-Product-Less-Than-K.md" >}})|Medium||||45.8%|
+|0718|Maximum Length of Repeated Subarray|[Go]({{< relref "/ChapterFour/0700~0799/0718.Maximum-Length-of-Repeated-Subarray.md" >}})|Medium||||51.3%|
+|0862|Shortest Subarray with Sum at Least K|[Go]({{< relref "/ChapterFour/0800~0899/0862.Shortest-Subarray-with-Sum-at-Least-K.md" >}})|Hard||||26.0%|
+|0904|Fruit Into Baskets|[Go]({{< relref "/ChapterFour/0900~0999/0904.Fruit-Into-Baskets.md" >}})|Medium||||43.7%|
+|0930|Binary Subarrays With Sum|[Go]({{< relref "/ChapterFour/0900~0999/0930.Binary-Subarrays-With-Sum.md" >}})|Medium||||52.2%|
+|0978|Longest Turbulent Subarray|[Go]({{< relref "/ChapterFour/0900~0999/0978.Longest-Turbulent-Subarray.md" >}})|Medium| O(n)| O(1)|❤️|47.2%|
+|0992|Subarrays with K Different Integers|[Go]({{< relref "/ChapterFour/0900~0999/0992.Subarrays-with-K-Different-Integers.md" >}})|Hard| O(n)| O(n)|❤️|54.6%|
+|0995|Minimum Number of K Consecutive Bit Flips|[Go]({{< relref "/ChapterFour/0900~0999/0995.Minimum-Number-of-K-Consecutive-Bit-Flips.md" >}})|Hard| O(n)| O(1)|❤️|51.2%|
+|1004|Max Consecutive Ones III|[Go]({{< relref "/ChapterFour/1000~1099/1004.Max-Consecutive-Ones-III.md" >}})|Medium| O(n)| O(1) ||63.2%|
+|1052|Grumpy Bookstore Owner|[Go]({{< relref "/ChapterFour/1000~1099/1052.Grumpy-Bookstore-Owner.md" >}})|Medium| O(n log n)| O(1) ||57.1%|
+|1208|Get Equal Substrings Within Budget|[Go]({{< relref "/ChapterFour/1200~1299/1208.Get-Equal-Substrings-Within-Budget.md" >}})|Medium||||48.6%|
+|1234|Replace the Substring for Balanced String|[Go]({{< relref "/ChapterFour/1200~1299/1234.Replace-the-Substring-for-Balanced-String.md" >}})|Medium||||37.2%|
+|1423|Maximum Points You Can Obtain from Cards|[Go]({{< relref "/ChapterFour/1400~1499/1423.Maximum-Points-You-Can-Obtain-from-Cards.md" >}})|Medium||||52.2%|
+|1438|Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit|[Go]({{< relref "/ChapterFour/1400~1499/1438.Longest-Continuous-Subarray-With-Absolute-Diff-Less-Than-or-Equal-to-Limit.md" >}})|Medium||||48.3%|
+|1658|Minimum Operations to Reduce X to Zero|[Go]({{< relref "/ChapterFour/1600~1699/1658.Minimum-Operations-to-Reduce-X-to-Zero.md" >}})|Medium||||37.6%|
+|1695|Maximum Erasure Value|[Go]({{< relref "/ChapterFour/1600~1699/1695.Maximum-Erasure-Value.md" >}})|Medium||||57.6%|
+|1696|Jump Game VI|[Go]({{< relref "/ChapterFour/1600~1699/1696.Jump-Game-VI.md" >}})|Medium||||46.1%|
+|1763|Longest Nice Substring|[Go]({{< relref "/ChapterFour/1700~1799/1763.Longest-Nice-Substring.md" >}})|Easy||||61.5%|
+|1984|Minimum Difference Between Highest and Lowest of K Scores|[Go]({{< relref "/ChapterFour/1900~1999/1984.Minimum-Difference-Between-Highest-and-Lowest-of-K-Scores.md" >}})|Easy||||54.5%|
+|------------|-------------------------------------------------------|-------| ----------------| ---------------|-------------|-------------|-------------|
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterTwo/Union_Find/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterTwo/Segment_Tree/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterTwo/Sort.md b/website/content/ChapterTwo/Sort.md
deleted file mode 100644
index f759edf86..000000000
--- a/website/content/ChapterTwo/Sort.md
+++ /dev/null
@@ -1,42 +0,0 @@
----
-title: Sort
-type: docs
----
-
-# Sort
-
-
-
-- 深刻的理解多路快排。第 75 题。
-- 链表的排序，插入排序(第 147 题)和归并排序(第 148 题)
-- 桶排序和基数排序。第 164 题。
-- "摆动排序"。第 324 题。
-- 两两不相邻的排序。第 767 题，第 1054 题。
-- "饼子排序"。第 969 题。
-
-| Title | Solution | Difficulty | Time | Space | 收藏 |
-| ----- | :--------: | :----------: | :----: | :-----: |:-----: |
-|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)| 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/website/content/ChapterTwo/Sorting.md b/website/content/ChapterTwo/Sorting.md
new file mode 100755
index 000000000..f50ce2687
--- /dev/null
+++ b/website/content/ChapterTwo/Sorting.md
@@ -0,0 +1,136 @@
+---
+title: 2.14 ✅ Sorting
+type: docs
+weight: 14
+---
+
+# Sorting
+
+
+
+- 深刻的理解多路快排。第 75 题。
+- 链表的排序，插入排序(第 147 题)和归并排序(第 148 题)
+- 桶排序和基数排序。第 164 题。
+- "摆动排序"。第 324 题。
+- 两两不相邻的排序。第 767 题，第 1054 题。
+- "饼子排序"。第 969 题。
+
+
+| No. | Title | Solution | Difficulty | TimeComplexity | SpaceComplexity |Favorite| Acceptance |
+|:--------:|:------- | :--------: | :----------: | :----: | :-----: | :-----: |:-----: |
+|0015|3Sum|[Go]({{< relref "/ChapterFour/0001~0099/0015.3Sum.md" >}})|Medium||||32.6%|
+|0016|3Sum Closest|[Go]({{< relref "/ChapterFour/0001~0099/0016.3Sum-Closest.md" >}})|Medium||||45.8%|
+|0018|4Sum|[Go]({{< relref "/ChapterFour/0001~0099/0018.4Sum.md" >}})|Medium||||35.9%|
+|0049|Group Anagrams|[Go]({{< relref "/ChapterFour/0001~0099/0049.Group-Anagrams.md" >}})|Medium||||66.7%|
+|0056|Merge Intervals|[Go]({{< relref "/ChapterFour/0001~0099/0056.Merge-Intervals.md" >}})|Medium| O(n log n)| O(log n)||46.2%|
+|0075|Sort Colors|[Go]({{< relref "/ChapterFour/0001~0099/0075.Sort-Colors.md" >}})|Medium| O(n)| O(1)|❤️|58.5%|
+|0088|Merge Sorted Array|[Go]({{< relref "/ChapterFour/0001~0099/0088.Merge-Sorted-Array.md" >}})|Easy||||46.6%|
+|0147|Insertion Sort List|[Go]({{< relref "/ChapterFour/0100~0199/0147.Insertion-Sort-List.md" >}})|Medium| O(n^2)| O(1) |❤️|51.0%|
+|0148|Sort List|[Go]({{< relref "/ChapterFour/0100~0199/0148.Sort-List.md" >}})|Medium|O(n log n)| O(log n)|❤️|55.1%|
+|0164|Maximum Gap|[Go]({{< relref "/ChapterFour/0100~0199/0164.Maximum-Gap.md" >}})|Hard| O(n log n)| O(log n) |❤️|43.3%|
+|0169|Majority Element|[Go]({{< relref "/ChapterFour/0100~0199/0169.Majority-Element.md" >}})|Easy||||63.9%|
+|0179|Largest Number|[Go]({{< relref "/ChapterFour/0100~0199/0179.Largest-Number.md" >}})|Medium| O(n log n)| O(log n) |❤️|34.5%|
+|0215|Kth Largest Element in an Array|[Go]({{< relref "/ChapterFour/0200~0299/0215.Kth-Largest-Element-in-an-Array.md" >}})|Medium||||66.1%|
+|0217|Contains Duplicate|[Go]({{< relref "/ChapterFour/0200~0299/0217.Contains-Duplicate.md" >}})|Easy||||61.4%|
+|0220|Contains Duplicate III|[Go]({{< relref "/ChapterFour/0200~0299/0220.Contains-Duplicate-III.md" >}})|Hard| O(n log n)| O(1) |❤️|22.1%|
+|0229|Majority Element II|[Go]({{< relref "/ChapterFour/0200~0299/0229.Majority-Element-II.md" >}})|Medium||||45.0%|
+|0242|Valid Anagram|[Go]({{< relref "/ChapterFour/0200~0299/0242.Valid-Anagram.md" >}})|Easy| O(n)| O(n) ||63.0%|
+|0268|Missing Number|[Go]({{< relref "/ChapterFour/0200~0299/0268.Missing-Number.md" >}})|Easy||||62.5%|
+|0274|H-Index|[Go]({{< relref "/ChapterFour/0200~0299/0274.H-Index.md" >}})|Medium| O(n)| O(n) ||38.3%|
+|0324|Wiggle Sort II|[Go]({{< relref "/ChapterFour/0300~0399/0324.Wiggle-Sort-II.md" >}})|Medium| O(n)| O(n)|❤️|33.3%|
+|0347|Top K Frequent Elements|[Go]({{< relref "/ChapterFour/0300~0399/0347.Top-K-Frequent-Elements.md" >}})|Medium||||64.2%|
+|0349|Intersection of Two Arrays|[Go]({{< relref "/ChapterFour/0300~0399/0349.Intersection-of-Two-Arrays.md" >}})|Easy| O(n)| O(n) ||70.9%|
+|0350|Intersection of Two Arrays II|[Go]({{< relref "/ChapterFour/0300~0399/0350.Intersection-of-Two-Arrays-II.md" >}})|Easy| O(n)| O(n) ||56.0%|
+|0354|Russian Doll Envelopes|[Go]({{< relref "/ChapterFour/0300~0399/0354.Russian-Doll-Envelopes.md" >}})|Hard||||38.0%|
+|0368|Largest Divisible Subset|[Go]({{< relref "/ChapterFour/0300~0399/0368.Largest-Divisible-Subset.md" >}})|Medium||||41.5%|
+|0378|Kth Smallest Element in a Sorted Matrix|[Go]({{< relref "/ChapterFour/0300~0399/0378.Kth-Smallest-Element-in-a-Sorted-Matrix.md" >}})|Medium||||61.7%|
+|0389|Find the Difference|[Go]({{< relref "/ChapterFour/0300~0399/0389.Find-the-Difference.md" >}})|Easy||||59.9%|
+|0414|Third Maximum Number|[Go]({{< relref "/ChapterFour/0400~0499/0414.Third-Maximum-Number.md" >}})|Easy||||33.2%|
+|0435|Non-overlapping Intervals|[Go]({{< relref "/ChapterFour/0400~0499/0435.Non-overlapping-Intervals.md" >}})|Medium||||50.3%|
+|0436|Find Right Interval|[Go]({{< relref "/ChapterFour/0400~0499/0436.Find-Right-Interval.md" >}})|Medium||||50.8%|
+|0451|Sort Characters By Frequency|[Go]({{< relref "/ChapterFour/0400~0499/0451.Sort-Characters-By-Frequency.md" >}})|Medium||||70.1%|
+|0455|Assign Cookies|[Go]({{< relref "/ChapterFour/0400~0499/0455.Assign-Cookies.md" >}})|Easy||||49.9%|
+|0462|Minimum Moves to Equal Array Elements II|[Go]({{< relref "/ChapterFour/0400~0499/0462.Minimum-Moves-to-Equal-Array-Elements-II.md" >}})|Medium||||60.0%|
+|0475|Heaters|[Go]({{< relref "/ChapterFour/0400~0499/0475.Heaters.md" >}})|Medium||||36.5%|
+|0506|Relative Ranks|[Go]({{< relref "/ChapterFour/0500~0599/0506.Relative-Ranks.md" >}})|Easy||||60.5%|
+|0524|Longest Word in Dictionary through Deleting|[Go]({{< relref "/ChapterFour/0500~0599/0524.Longest-Word-in-Dictionary-through-Deleting.md" >}})|Medium| O(n)| O(1) ||51.0%|
+|0532|K-diff Pairs in an Array|[Go]({{< relref "/ChapterFour/0500~0599/0532.K-diff-Pairs-in-an-Array.md" >}})|Medium||||41.2%|
+|0561|Array Partition|[Go]({{< relref "/ChapterFour/0500~0599/0561.Array-Partition.md" >}})|Easy||||77.2%|
+|0581|Shortest Unsorted Continuous Subarray|[Go]({{< relref "/ChapterFour/0500~0599/0581.Shortest-Unsorted-Continuous-Subarray.md" >}})|Medium||||36.4%|
+|0594|Longest Harmonious Subsequence|[Go]({{< relref "/ChapterFour/0500~0599/0594.Longest-Harmonious-Subsequence.md" >}})|Easy||||53.5%|
+|0611|Valid Triangle Number|[Go]({{< relref "/ChapterFour/0600~0699/0611.Valid-Triangle-Number.md" >}})|Medium||||50.5%|
+|0628|Maximum Product of Three Numbers|[Go]({{< relref "/ChapterFour/0600~0699/0628.Maximum-Product-of-Three-Numbers.md" >}})|Easy||||45.9%|
+|0632|Smallest Range Covering Elements from K Lists|[Go]({{< relref "/ChapterFour/0600~0699/0632.Smallest-Range-Covering-Elements-from-K-Lists.md" >}})|Hard||||61.0%|
+|0645|Set Mismatch|[Go]({{< relref "/ChapterFour/0600~0699/0645.Set-Mismatch.md" >}})|Easy||||42.7%|
+|0658|Find K Closest Elements|[Go]({{< relref "/ChapterFour/0600~0699/0658.Find-K-Closest-Elements.md" >}})|Medium||||46.8%|
+|0692|Top K Frequent Words|[Go]({{< relref "/ChapterFour/0600~0699/0692.Top-K-Frequent-Words.md" >}})|Medium||||57.2%|
+|0710|Random Pick with Blacklist|[Go]({{< relref "/ChapterFour/0700~0799/0710.Random-Pick-with-Blacklist.md" >}})|Hard| O(n)| O(n) ||33.5%|
+|0719|Find K-th Smallest Pair Distance|[Go]({{< relref "/ChapterFour/0700~0799/0719.Find-K-th-Smallest-Pair-Distance.md" >}})|Hard||||36.7%|
+|0720|Longest Word in Dictionary|[Go]({{< relref "/ChapterFour/0700~0799/0720.Longest-Word-in-Dictionary.md" >}})|Medium||||52.0%|
+|0726|Number of Atoms|[Go]({{< relref "/ChapterFour/0700~0799/0726.Number-of-Atoms.md" >}})|Hard||||52.1%|
+|0747|Largest Number At Least Twice of Others|[Go]({{< relref "/ChapterFour/0700~0799/0747.Largest-Number-At-Least-Twice-of-Others.md" >}})|Easy||||47.1%|
+|0767|Reorganize String|[Go]({{< relref "/ChapterFour/0700~0799/0767.Reorganize-String.md" >}})|Medium| O(n log n)| O(log n) |❤️|52.9%|
+|0786|K-th Smallest Prime Fraction|[Go]({{< relref "/ChapterFour/0700~0799/0786.K-th-Smallest-Prime-Fraction.md" >}})|Medium||||51.6%|
+|0791|Custom Sort String|[Go]({{< relref "/ChapterFour/0700~0799/0791.Custom-Sort-String.md" >}})|Medium||||69.1%|
+|0792|Number of Matching Subsequences|[Go]({{< relref "/ChapterFour/0700~0799/0792.Number-of-Matching-Subsequences.md" >}})|Medium||||51.6%|
+|0825|Friends Of Appropriate Ages|[Go]({{< relref "/ChapterFour/0800~0899/0825.Friends-Of-Appropriate-Ages.md" >}})|Medium||||46.3%|
+|0826|Most Profit Assigning Work|[Go]({{< relref "/ChapterFour/0800~0899/0826.Most-Profit-Assigning-Work.md" >}})|Medium||||44.9%|
+|0846|Hand of Straights|[Go]({{< relref "/ChapterFour/0800~0899/0846.Hand-of-Straights.md" >}})|Medium||||56.2%|
+|0853|Car Fleet|[Go]({{< relref "/ChapterFour/0800~0899/0853.Car-Fleet.md" >}})|Medium| O(n log n)| O(log n) ||50.3%|
+|0869|Reordered Power of 2|[Go]({{< relref "/ChapterFour/0800~0899/0869.Reordered-Power-of-2.md" >}})|Medium||||63.5%|
+|0870|Advantage Shuffle|[Go]({{< relref "/ChapterFour/0800~0899/0870.Advantage-Shuffle.md" >}})|Medium||||51.8%|
+|0881|Boats to Save People|[Go]({{< relref "/ChapterFour/0800~0899/0881.Boats-to-Save-People.md" >}})|Medium||||53.1%|
+|0888|Fair Candy Swap|[Go]({{< relref "/ChapterFour/0800~0899/0888.Fair-Candy-Swap.md" >}})|Easy||||60.7%|
+|0891|Sum of Subsequence Widths|[Go]({{< relref "/ChapterFour/0800~0899/0891.Sum-of-Subsequence-Widths.md" >}})|Hard||||36.6%|
+|0910|Smallest Range II|[Go]({{< relref "/ChapterFour/0900~0999/0910.Smallest-Range-II.md" >}})|Medium||||35.1%|
+|0922|Sort Array By Parity II|[Go]({{< relref "/ChapterFour/0900~0999/0922.Sort-Array-By-Parity-II.md" >}})|Easy| O(n)| O(1) ||70.7%|
+|0923|3Sum With Multiplicity|[Go]({{< relref "/ChapterFour/0900~0999/0923.3Sum-With-Multiplicity.md" >}})|Medium||||45.3%|
+|0969|Pancake Sorting|[Go]({{< relref "/ChapterFour/0900~0999/0969.Pancake-Sorting.md" >}})|Medium| O(n log n)| O(log n) |❤️|70.1%|
+|0973|K Closest Points to Origin|[Go]({{< relref "/ChapterFour/0900~0999/0973.K-Closest-Points-to-Origin.md" >}})|Medium| O(n log n)| O(log n) ||65.7%|
+|0976|Largest Perimeter Triangle|[Go]({{< relref "/ChapterFour/0900~0999/0976.Largest-Perimeter-Triangle.md" >}})|Easy| O(n log n)| O(log n) ||54.6%|
+|0977|Squares of a Sorted Array|[Go]({{< relref "/ChapterFour/0900~0999/0977.Squares-of-a-Sorted-Array.md" >}})|Easy||||71.9%|
+|1005|Maximize Sum Of Array After K Negations|[Go]({{< relref "/ChapterFour/1000~1099/1005.Maximize-Sum-Of-Array-After-K-Negations.md" >}})|Easy||||50.9%|
+|1030|Matrix Cells in Distance Order|[Go]({{< relref "/ChapterFour/1000~1099/1030.Matrix-Cells-in-Distance-Order.md" >}})|Easy| O(n^2)| O(1) ||69.7%|
+|1040|Moving Stones Until Consecutive II|[Go]({{< relref "/ChapterFour/1000~1099/1040.Moving-Stones-Until-Consecutive-II.md" >}})|Medium||||55.9%|
+|1051|Height Checker|[Go]({{< relref "/ChapterFour/1000~1099/1051.Height-Checker.md" >}})|Easy||||75.6%|
+|1054|Distant Barcodes|[Go]({{< relref "/ChapterFour/1000~1099/1054.Distant-Barcodes.md" >}})|Medium| O(n log n)| O(log n) |❤️|45.8%|
+|1122|Relative Sort Array|[Go]({{< relref "/ChapterFour/1100~1199/1122.Relative-Sort-Array.md" >}})|Easy||||68.6%|
+|1170|Compare Strings by Frequency of the Smallest Character|[Go]({{< relref "/ChapterFour/1100~1199/1170.Compare-Strings-by-Frequency-of-the-Smallest-Character.md" >}})|Medium||||61.5%|
+|1200|Minimum Absolute Difference|[Go]({{< relref "/ChapterFour/1200~1299/1200.Minimum-Absolute-Difference.md" >}})|Easy||||69.6%|
+|1235|Maximum Profit in Job Scheduling|[Go]({{< relref "/ChapterFour/1200~1299/1235.Maximum-Profit-in-Job-Scheduling.md" >}})|Hard||||53.4%|
+|1296|Divide Array in Sets of K Consecutive Numbers|[Go]({{< relref "/ChapterFour/1200~1299/1296.Divide-Array-in-Sets-of-K-Consecutive-Numbers.md" >}})|Medium||||56.5%|
+|1300|Sum of Mutated Array Closest to Target|[Go]({{< relref "/ChapterFour/1300~1399/1300.Sum-of-Mutated-Array-Closest-to-Target.md" >}})|Medium||||43.6%|
+|1305|All Elements in Two Binary Search Trees|[Go]({{< relref "/ChapterFour/1300~1399/1305.All-Elements-in-Two-Binary-Search-Trees.md" >}})|Medium||||79.8%|
+|1329|Sort the Matrix Diagonally|[Go]({{< relref "/ChapterFour/1300~1399/1329.Sort-the-Matrix-Diagonally.md" >}})|Medium||||83.3%|
+|1337|The K Weakest Rows in a Matrix|[Go]({{< relref "/ChapterFour/1300~1399/1337.The-K-Weakest-Rows-in-a-Matrix.md" >}})|Easy||||72.1%|
+|1353|Maximum Number of Events That Can Be Attended|[Go]({{< relref "/ChapterFour/1300~1399/1353.Maximum-Number-of-Events-That-Can-Be-Attended.md" >}})|Medium||||32.5%|
+|1383|Maximum Performance of a Team|[Go]({{< relref "/ChapterFour/1300~1399/1383.Maximum-Performance-of-a-Team.md" >}})|Hard||||48.5%|
+|1385|Find the Distance Value Between Two Arrays|[Go]({{< relref "/ChapterFour/1300~1399/1385.Find-the-Distance-Value-Between-Two-Arrays.md" >}})|Easy||||66.5%|
+|1464|Maximum Product of Two Elements in an Array|[Go]({{< relref "/ChapterFour/1400~1499/1464.Maximum-Product-of-Two-Elements-in-an-Array.md" >}})|Easy||||79.9%|
+|1465|Maximum Area of a Piece of Cake After Horizontal and Vertical Cuts|[Go]({{< relref "/ChapterFour/1400~1499/1465.Maximum-Area-of-a-Piece-of-Cake-After-Horizontal-and-Vertical-Cuts.md" >}})|Medium||||40.9%|
+|1608|Special Array With X Elements Greater Than or Equal X|[Go]({{< relref "/ChapterFour/1600~1699/1608.Special-Array-With-X-Elements-Greater-Than-or-Equal-X.md" >}})|Easy||||60.5%|
+|1619|Mean of Array After Removing Some Elements|[Go]({{< relref "/ChapterFour/1600~1699/1619.Mean-of-Array-After-Removing-Some-Elements.md" >}})|Easy||||65.7%|
+|1636|Sort Array by Increasing Frequency|[Go]({{< relref "/ChapterFour/1600~1699/1636.Sort-Array-by-Increasing-Frequency.md" >}})|Easy||||69.5%|
+|1647|Minimum Deletions to Make Character Frequencies Unique|[Go]({{< relref "/ChapterFour/1600~1699/1647.Minimum-Deletions-to-Make-Character-Frequencies-Unique.md" >}})|Medium||||59.1%|
+|1648|Sell Diminishing-Valued Colored Balls|[Go]({{< relref "/ChapterFour/1600~1699/1648.Sell-Diminishing-Valued-Colored-Balls.md" >}})|Medium||||30.5%|
+|1657|Determine if Two Strings Are Close|[Go]({{< relref "/ChapterFour/1600~1699/1657.Determine-if-Two-Strings-Are-Close.md" >}})|Medium||||56.3%|
+|1665|Minimum Initial Energy to Finish Tasks|[Go]({{< relref "/ChapterFour/1600~1699/1665.Minimum-Initial-Energy-to-Finish-Tasks.md" >}})|Hard||||56.3%|
+|1679|Max Number of K-Sum Pairs|[Go]({{< relref "/ChapterFour/1600~1699/1679.Max-Number-of-K-Sum-Pairs.md" >}})|Medium||||57.3%|
+|1691|Maximum Height by Stacking Cuboids|[Go]({{< relref "/ChapterFour/1600~1699/1691.Maximum-Height-by-Stacking-Cuboids.md" >}})|Hard||||54.4%|
+|1710|Maximum Units on a Truck|[Go]({{< relref "/ChapterFour/1700~1799/1710.Maximum-Units-on-a-Truck.md" >}})|Easy||||73.8%|
+|1818|Minimum Absolute Sum Difference|[Go]({{< relref "/ChapterFour/1800~1899/1818.Minimum-Absolute-Sum-Difference.md" >}})|Medium||||30.4%|
+|1846|Maximum Element After Decreasing and Rearranging|[Go]({{< relref "/ChapterFour/1800~1899/1846.Maximum-Element-After-Decreasing-and-Rearranging.md" >}})|Medium||||58.9%|
+|1877|Minimize Maximum Pair Sum in Array|[Go]({{< relref "/ChapterFour/1800~1899/1877.Minimize-Maximum-Pair-Sum-in-Array.md" >}})|Medium||||79.9%|
+|1984|Minimum Difference Between Highest and Lowest of K Scores|[Go]({{< relref "/ChapterFour/1900~1999/1984.Minimum-Difference-Between-Highest-and-Lowest-of-K-Scores.md" >}})|Easy||||54.4%|
+|2037|Minimum Number of Moves to Seat Everyone|[Go]({{< relref "/ChapterFour/2000~2099/2037.Minimum-Number-of-Moves-to-Seat-Everyone.md" >}})|Easy||||82.1%|
+|2164|Sort Even and Odd Indices Independently|[Go]({{< relref "/ChapterFour/2100~2199/2164.Sort-Even-and-Odd-Indices-Independently.md" >}})|Easy||||65.0%|
+|2165|Smallest Value of the Rearranged Number|[Go]({{< relref "/ChapterFour/2100~2199/2165.Smallest-Value-of-the-Rearranged-Number.md" >}})|Medium||||51.4%|
+|2171|Removing Minimum Number of Magic Beans|[Go]({{< relref "/ChapterFour/2100~2199/2171.Removing-Minimum-Number-of-Magic-Beans.md" >}})|Medium||||42.1%|
+|------------|-------------------------------------------------------|-------| ----------------| ---------------|-------------|-------------|-------------|
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterTwo/Hash_Table/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterTwo/Bit_Manipulation/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterTwo/Stack.md b/website/content/ChapterTwo/Stack.md
index cae1b29c9..5b5c28b9a 100644
--- a/website/content/ChapterTwo/Stack.md
+++ b/website/content/ChapterTwo/Stack.md
@@ -1,6 +1,7 @@
---
-title: Stack
+title: 2.05 ✅ Stack
type: docs
+weight: 5
---
# Stack
@@ -12,43 +13,72 @@ type: docs
- 利用栈进行编码问题。第 394 题，第 682 题，第 856 题，第 880 题。
- **单调栈**。**利用栈维护一个单调递增或者递减的下标数组**。第 84 题，第 456 题，第 496 题，第 503 题，第 739 题，第 901 题，第 907 题，第 1019 题。
-| Title | Solution | Difficulty | Time | Space |收藏|
-| ----- | :--------: | :----------: | :----: | :-----: | :-----: |
-|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
+
+
+| No. | Title | Solution | Difficulty | TimeComplexity | SpaceComplexity |Favorite| Acceptance |
+|:--------:|:------- | :--------: | :----------: | :----: | :-----: | :-----: |:-----: |
+|0020|Valid Parentheses|[Go]({{< relref "/ChapterFour/0001~0099/0020.Valid-Parentheses.md" >}})|Easy| O(log n)| O(1)||40.2%|
+|0032|Longest Valid Parentheses|[Go]({{< relref "/ChapterFour/0001~0099/0032.Longest-Valid-Parentheses.md" >}})|Hard||||32.8%|
+|0042|Trapping Rain Water|[Go]({{< relref "/ChapterFour/0001~0099/0042.Trapping-Rain-Water.md" >}})|Hard| O(n)| O(1)|❤️|59.2%|
+|0071|Simplify Path|[Go]({{< relref "/ChapterFour/0001~0099/0071.Simplify-Path.md" >}})|Medium| O(n)| O(n)|❤️|39.3%|
+|0084|Largest Rectangle in Histogram|[Go]({{< relref "/ChapterFour/0001~0099/0084.Largest-Rectangle-in-Histogram.md" >}})|Hard| O(n)| O(n)|❤️|42.6%|
+|0094|Binary Tree Inorder Traversal|[Go]({{< relref "/ChapterFour/0001~0099/0094.Binary-Tree-Inorder-Traversal.md" >}})|Easy| O(n)| O(1)||73.8%|
+|0114|Flatten Binary Tree to Linked List|[Go]({{< relref "/ChapterFour/0100~0199/0114.Flatten-Binary-Tree-to-Linked-List.md" >}})|Medium||||61.8%|
+|0143|Reorder List|[Go]({{< relref "/ChapterFour/0100~0199/0143.Reorder-List.md" >}})|Medium||||52.5%|
+|0144|Binary Tree Preorder Traversal|[Go]({{< relref "/ChapterFour/0100~0199/0144.Binary-Tree-Preorder-Traversal.md" >}})|Easy| O(n)| O(1)||66.8%|
+|0145|Binary Tree Postorder Traversal|[Go]({{< relref "/ChapterFour/0100~0199/0145.Binary-Tree-Postorder-Traversal.md" >}})|Easy| O(n)| O(1)||67.9%|
+|0150|Evaluate Reverse Polish Notation|[Go]({{< relref "/ChapterFour/0100~0199/0150.Evaluate-Reverse-Polish-Notation.md" >}})|Medium| O(n)| O(1)||45.7%|
+|0155|Min Stack|[Go]({{< relref "/ChapterFour/0100~0199/0155.Min-Stack.md" >}})|Medium| O(n)| O(n)||52.3%|
+|0173|Binary Search Tree Iterator|[Go]({{< relref "/ChapterFour/0100~0199/0173.Binary-Search-Tree-Iterator.md" >}})|Medium| O(n)| O(1)||69.7%|
+|0224|Basic Calculator|[Go]({{< relref "/ChapterFour/0200~0299/0224.Basic-Calculator.md" >}})|Hard| O(n)| O(n)||42.4%|
+|0225|Implement Stack using Queues|[Go]({{< relref "/ChapterFour/0200~0299/0225.Implement-Stack-using-Queues.md" >}})|Easy| O(n)| O(n)||58.6%|
+|0227|Basic Calculator II|[Go]({{< relref "/ChapterFour/0200~0299/0227.Basic-Calculator-II.md" >}})|Medium||||42.4%|
+|0232|Implement Queue using Stacks|[Go]({{< relref "/ChapterFour/0200~0299/0232.Implement-Queue-using-Stacks.md" >}})|Easy| O(n)| O(n)||63.2%|
+|0234|Palindrome Linked List|[Go]({{< relref "/ChapterFour/0200~0299/0234.Palindrome-Linked-List.md" >}})|Easy||||50.2%|
+|0331|Verify Preorder Serialization of a Binary Tree|[Go]({{< relref "/ChapterFour/0300~0399/0331.Verify-Preorder-Serialization-of-a-Binary-Tree.md" >}})|Medium| O(n)| O(1)||44.6%|
+|0341|Flatten Nested List Iterator|[Go]({{< relref "/ChapterFour/0300~0399/0341.Flatten-Nested-List-Iterator.md" >}})|Medium||||61.8%|
+|0385|Mini Parser|[Go]({{< relref "/ChapterFour/0300~0399/0385.Mini-Parser.md" >}})|Medium||||36.9%|
+|0394|Decode String|[Go]({{< relref "/ChapterFour/0300~0399/0394.Decode-String.md" >}})|Medium| O(n)| O(n)||57.9%|
+|0402|Remove K Digits|[Go]({{< relref "/ChapterFour/0400~0499/0402.Remove-K-Digits.md" >}})|Medium| O(n)| O(1)||30.6%|
+|0445|Add Two Numbers II|[Go]({{< relref "/ChapterFour/0400~0499/0445.Add-Two-Numbers-II.md" >}})|Medium||||59.6%|
+|0456|132 Pattern|[Go]({{< relref "/ChapterFour/0400~0499/0456.132-Pattern.md" >}})|Medium| O(n)| O(n)||32.4%|
+|0496|Next Greater Element I|[Go]({{< relref "/ChapterFour/0400~0499/0496.Next-Greater-Element-I.md" >}})|Easy| O(n)| O(n)||71.4%|
+|0503|Next Greater Element II|[Go]({{< relref "/ChapterFour/0500~0599/0503.Next-Greater-Element-II.md" >}})|Medium| O(n)| O(n)||63.2%|
+|0581|Shortest Unsorted Continuous Subarray|[Go]({{< relref "/ChapterFour/0500~0599/0581.Shortest-Unsorted-Continuous-Subarray.md" >}})|Medium||||36.4%|
+|0589|N-ary Tree Preorder Traversal|[Go]({{< relref "/ChapterFour/0500~0599/0589.N-ary-Tree-Preorder-Traversal.md" >}})|Easy||||75.9%|
+|0636|Exclusive Time of Functions|[Go]({{< relref "/ChapterFour/0600~0699/0636.Exclusive-Time-of-Functions.md" >}})|Medium| O(n)| O(n)||61.2%|
+|0682|Baseball Game|[Go]({{< relref "/ChapterFour/0600~0699/0682.Baseball-Game.md" >}})|Easy| O(n)| O(n)||74.3%|
+|0726|Number of Atoms|[Go]({{< relref "/ChapterFour/0700~0799/0726.Number-of-Atoms.md" >}})|Hard| O(n)| O(n) |❤️|52.1%|
+|0735|Asteroid Collision|[Go]({{< relref "/ChapterFour/0700~0799/0735.Asteroid-Collision.md" >}})|Medium| O(n)| O(n) ||44.4%|
+|0739|Daily Temperatures|[Go]({{< relref "/ChapterFour/0700~0799/0739.Daily-Temperatures.md" >}})|Medium| O(n)| O(n) ||66.3%|
+|0844|Backspace String Compare|[Go]({{< relref "/ChapterFour/0800~0899/0844.Backspace-String-Compare.md" >}})|Easy| O(n)| O(n) ||48.1%|
+|0853|Car Fleet|[Go]({{< relref "/ChapterFour/0800~0899/0853.Car-Fleet.md" >}})|Medium||||50.3%|
+|0856|Score of Parentheses|[Go]({{< relref "/ChapterFour/0800~0899/0856.Score-of-Parentheses.md" >}})|Medium| O(n)| O(n)||64.8%|
+|0880|Decoded String at Index|[Go]({{< relref "/ChapterFour/0800~0899/0880.Decoded-String-at-Index.md" >}})|Medium| O(n)| O(n)||28.3%|
+|0895|Maximum Frequency Stack|[Go]({{< relref "/ChapterFour/0800~0899/0895.Maximum-Frequency-Stack.md" >}})|Hard| O(n)| O(n) ||66.6%|
+|0897|Increasing Order Search Tree|[Go]({{< relref "/ChapterFour/0800~0899/0897.Increasing-Order-Search-Tree.md" >}})|Easy||||78.4%|
+|0901|Online Stock Span|[Go]({{< relref "/ChapterFour/0900~0999/0901.Online-Stock-Span.md" >}})|Medium| O(n)| O(n) ||65.2%|
+|0907|Sum of Subarray Minimums|[Go]({{< relref "/ChapterFour/0900~0999/0907.Sum-of-Subarray-Minimums.md" >}})|Medium| O(n)| O(n)|❤️|35.8%|
+|0921|Minimum Add to Make Parentheses Valid|[Go]({{< relref "/ChapterFour/0900~0999/0921.Minimum-Add-to-Make-Parentheses-Valid.md" >}})|Medium| O(n)| O(n)||75.8%|
+|0946|Validate Stack Sequences|[Go]({{< relref "/ChapterFour/0900~0999/0946.Validate-Stack-Sequences.md" >}})|Medium| O(n)| O(n)||67.7%|
+|1003|Check If Word Is Valid After Substitutions|[Go]({{< relref "/ChapterFour/1000~1099/1003.Check-If-Word-Is-Valid-After-Substitutions.md" >}})|Medium| O(n)| O(1)||58.2%|
+|1006|Clumsy Factorial|[Go]({{< relref "/ChapterFour/1000~1099/1006.Clumsy-Factorial.md" >}})|Medium||||55.4%|
+|1019|Next Greater Node In Linked List|[Go]({{< relref "/ChapterFour/1000~1099/1019.Next-Greater-Node-In-Linked-List.md" >}})|Medium| O(n)| O(1)||59.9%|
+|1021|Remove Outermost Parentheses|[Go]({{< relref "/ChapterFour/1000~1099/1021.Remove-Outermost-Parentheses.md" >}})|Easy| O(n)| O(1)||80.6%|
+|1047|Remove All Adjacent Duplicates In String|[Go]({{< relref "/ChapterFour/1000~1099/1047.Remove-All-Adjacent-Duplicates-In-String.md" >}})|Easy| O(n)| O(1)||69.7%|
+|1111|Maximum Nesting Depth of Two Valid Parentheses Strings|[Go]({{< relref "/ChapterFour/1100~1199/1111.Maximum-Nesting-Depth-of-Two-Valid-Parentheses-Strings.md" >}})|Medium||||73.0%|
+|1190|Reverse Substrings Between Each Pair of Parentheses|[Go]({{< relref "/ChapterFour/1100~1199/1190.Reverse-Substrings-Between-Each-Pair-of-Parentheses.md" >}})|Medium||||65.9%|
+|1209|Remove All Adjacent Duplicates in String II|[Go]({{< relref "/ChapterFour/1200~1299/1209.Remove-All-Adjacent-Duplicates-in-String-II.md" >}})|Medium||||56.2%|
+|1249|Minimum Remove to Make Valid Parentheses|[Go]({{< relref "/ChapterFour/1200~1299/1249.Minimum-Remove-to-Make-Valid-Parentheses.md" >}})|Medium||||65.8%|
+|1614|Maximum Nesting Depth of the Parentheses|[Go]({{< relref "/ChapterFour/1600~1699/1614.Maximum-Nesting-Depth-of-the-Parentheses.md" >}})|Easy||||82.3%|
+|1653|Minimum Deletions to Make String Balanced|[Go]({{< relref "/ChapterFour/1600~1699/1653.Minimum-Deletions-to-Make-String-Balanced.md" >}})|Medium||||58.9%|
+|1673|Find the Most Competitive Subsequence|[Go]({{< relref "/ChapterFour/1600~1699/1673.Find-the-Most-Competitive-Subsequence.md" >}})|Medium||||49.3%|
+|1700|Number of Students Unable to Eat Lunch|[Go]({{< relref "/ChapterFour/1700~1799/1700.Number-of-Students-Unable-to-Eat-Lunch.md" >}})|Easy||||68.7%|
+|------------|-------------------------------------------------------|-------| ----------------| ---------------|-------------|-------------|-------------|
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterTwo/Linked_List/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterTwo/Tree/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterTwo/String.md b/website/content/ChapterTwo/String.md
index 1ea29de57..240b6b1ac 100644
--- a/website/content/ChapterTwo/String.md
+++ b/website/content/ChapterTwo/String.md
@@ -1,30 +1,199 @@
---
-title: String
+title: 2.02 String
type: docs
+weight: 2
---
# String
-| Title | Solution | Difficulty | Time | Space |收藏|
-| ----- | :--------: | :----------: | :----: | :-----: | :-----: |
-|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
+
+| No. | Title | Solution | Difficulty | TimeComplexity | SpaceComplexity |Favorite| Acceptance |
+|:--------:|:------- | :--------: | :----------: | :----: | :-----: | :-----: |:-----: |
+|0003|Longest Substring Without Repeating Characters|[Go]({{< relref "/ChapterFour/0001~0099/0003.Longest-Substring-Without-Repeating-Characters.md" >}})|Medium| O(n)| O(1)|❤️|33.8%|
+|0005|Longest Palindromic Substring|[Go]({{< relref "/ChapterFour/0001~0099/0005.Longest-Palindromic-Substring.md" >}})|Medium||||32.4%|
+|0006|Zigzag Conversion|[Go]({{< relref "/ChapterFour/0001~0099/0006.Zigzag-Conversion.md" >}})|Medium||||44.8%|
+|0008|String to Integer (atoi)|[Go]({{< relref "/ChapterFour/0001~0099/0008.String-to-Integer-atoi.md" >}})|Medium||||16.6%|
+|0012|Integer to Roman|[Go]({{< relref "/ChapterFour/0001~0099/0012.Integer-to-Roman.md" >}})|Medium||||62.0%|
+|0013|Roman to Integer|[Go]({{< relref "/ChapterFour/0001~0099/0013.Roman-to-Integer.md" >}})|Easy||||58.5%|
+|0014|Longest Common Prefix|[Go]({{< relref "/ChapterFour/0001~0099/0014.Longest-Common-Prefix.md" >}})|Easy||||40.9%|
+|0017|Letter Combinations of a Phone Number|[Go]({{< relref "/ChapterFour/0001~0099/0017.Letter-Combinations-of-a-Phone-Number.md" >}})|Medium| O(log n)| O(1)||56.5%|
+|0020|Valid Parentheses|[Go]({{< relref "/ChapterFour/0001~0099/0020.Valid-Parentheses.md" >}})|Easy| O(log n)| O(1)||40.2%|
+|0022|Generate Parentheses|[Go]({{< relref "/ChapterFour/0001~0099/0022.Generate-Parentheses.md" >}})|Medium| O(log n)| O(1)||72.5%|
+|0028|Find the Index of the First Occurrence in a String|[Go]({{< relref "/ChapterFour/0001~0099/0028.Find-the-Index-of-the-First-Occurrence-in-a-String.md" >}})|Easy| O(n)| O(1)||39.0%|
+|0030|Substring with Concatenation of All Words|[Go]({{< relref "/ChapterFour/0001~0099/0030.Substring-with-Concatenation-of-All-Words.md" >}})|Hard| O(n)| O(n)|❤️|31.2%|
+|0032|Longest Valid Parentheses|[Go]({{< relref "/ChapterFour/0001~0099/0032.Longest-Valid-Parentheses.md" >}})|Hard||||32.8%|
+|0043|Multiply Strings|[Go]({{< relref "/ChapterFour/0001~0099/0043.Multiply-Strings.md" >}})|Medium||||39.2%|
+|0049|Group Anagrams|[Go]({{< relref "/ChapterFour/0001~0099/0049.Group-Anagrams.md" >}})|Medium| O(n log n)| O(n)||66.7%|
+|0058|Length of Last Word|[Go]({{< relref "/ChapterFour/0001~0099/0058.Length-of-Last-Word.md" >}})|Easy||||42.8%|
+|0065|Valid Number|[Go]({{< relref "/ChapterFour/0001~0099/0065.Valid-Number.md" >}})|Hard||||18.7%|
+|0067|Add Binary|[Go]({{< relref "/ChapterFour/0001~0099/0067.Add-Binary.md" >}})|Easy||||52.4%|
+|0071|Simplify Path|[Go]({{< relref "/ChapterFour/0001~0099/0071.Simplify-Path.md" >}})|Medium| O(n)| O(n)||39.3%|
+|0076|Minimum Window Substring|[Go]({{< relref "/ChapterFour/0001~0099/0076.Minimum-Window-Substring.md" >}})|Hard| O(n)| O(n)|❤️|40.9%|
+|0091|Decode Ways|[Go]({{< relref "/ChapterFour/0001~0099/0091.Decode-Ways.md" >}})|Medium| O(n)| O(n)||32.7%|
+|0093|Restore IP Addresses|[Go]({{< relref "/ChapterFour/0001~0099/0093.Restore-IP-Addresses.md" >}})|Medium| O(n)| O(n)|❤️|47.4%|
+|0097|Interleaving String|[Go]({{< relref "/ChapterFour/0001~0099/0097.Interleaving-String.md" >}})|Medium||||37.3%|
+|0115|Distinct Subsequences|[Go]({{< relref "/ChapterFour/0100~0199/0115.Distinct-Subsequences.md" >}})|Hard||||44.4%|
+|0125|Valid Palindrome|[Go]({{< relref "/ChapterFour/0100~0199/0125.Valid-Palindrome.md" >}})|Easy| O(n)| O(1)||44.3%|
+|0126|Word Ladder II|[Go]({{< relref "/ChapterFour/0100~0199/0126.Word-Ladder-II.md" >}})|Hard| O(n)| O(n^2)|❤️|27.5%|
+|0127|Word Ladder|[Go]({{< relref "/ChapterFour/0100~0199/0127.Word-Ladder.md" >}})|Hard||||37.1%|
+|0131|Palindrome Partitioning|[Go]({{< relref "/ChapterFour/0100~0199/0131.Palindrome-Partitioning.md" >}})|Medium||||64.8%|
+|0151|Reverse Words in a String|[Go]({{< relref "/ChapterFour/0100~0199/0151.Reverse-Words-in-a-String.md" >}})|Medium||||32.7%|
+|0168|Excel Sheet Column Title|[Go]({{< relref "/ChapterFour/0100~0199/0168.Excel-Sheet-Column-Title.md" >}})|Easy||||35.5%|
+|0171|Excel Sheet Column Number|[Go]({{< relref "/ChapterFour/0100~0199/0171.Excel-Sheet-Column-Number.md" >}})|Easy||||62.0%|
+|0179|Largest Number|[Go]({{< relref "/ChapterFour/0100~0199/0179.Largest-Number.md" >}})|Medium||||34.5%|
+|0187|Repeated DNA Sequences|[Go]({{< relref "/ChapterFour/0100~0199/0187.Repeated-DNA-Sequences.md" >}})|Medium||||46.9%|
+|0205|Isomorphic Strings|[Go]({{< relref "/ChapterFour/0200~0299/0205.Isomorphic-Strings.md" >}})|Easy||||42.9%|
+|0208|Implement Trie (Prefix Tree)|[Go]({{< relref "/ChapterFour/0200~0299/0208.Implement-Trie-Prefix-Tree.md" >}})|Medium||||62.7%|
+|0211|Design Add and Search Words Data Structure|[Go]({{< relref "/ChapterFour/0200~0299/0211.Design-Add-and-Search-Words-Data-Structure.md" >}})|Medium||||44.0%|
+|0212|Word Search II|[Go]({{< relref "/ChapterFour/0200~0299/0212.Word-Search-II.md" >}})|Hard||||36.4%|
+|0224|Basic Calculator|[Go]({{< relref "/ChapterFour/0200~0299/0224.Basic-Calculator.md" >}})|Hard||||42.4%|
+|0227|Basic Calculator II|[Go]({{< relref "/ChapterFour/0200~0299/0227.Basic-Calculator-II.md" >}})|Medium||||42.4%|
+|0242|Valid Anagram|[Go]({{< relref "/ChapterFour/0200~0299/0242.Valid-Anagram.md" >}})|Easy||||63.0%|
+|0257|Binary Tree Paths|[Go]({{< relref "/ChapterFour/0200~0299/0257.Binary-Tree-Paths.md" >}})|Easy||||61.4%|
+|0290|Word Pattern|[Go]({{< relref "/ChapterFour/0200~0299/0290.Word-Pattern.md" >}})|Easy||||41.7%|
+|0297|Serialize and Deserialize Binary Tree|[Go]({{< relref "/ChapterFour/0200~0299/0297.Serialize-and-Deserialize-Binary-Tree.md" >}})|Hard||||55.4%|
+|0299|Bulls and Cows|[Go]({{< relref "/ChapterFour/0200~0299/0299.Bulls-and-Cows.md" >}})|Medium||||49.4%|
+|0301|Remove Invalid Parentheses|[Go]({{< relref "/ChapterFour/0300~0399/0301.Remove-Invalid-Parentheses.md" >}})|Hard||||47.2%|
+|0306|Additive Number|[Go]({{< relref "/ChapterFour/0300~0399/0306.Additive-Number.md" >}})|Medium||||31.1%|
+|0318|Maximum Product of Word Lengths|[Go]({{< relref "/ChapterFour/0300~0399/0318.Maximum-Product-of-Word-Lengths.md" >}})|Medium||||59.9%|
+|0331|Verify Preorder Serialization of a Binary Tree|[Go]({{< relref "/ChapterFour/0300~0399/0331.Verify-Preorder-Serialization-of-a-Binary-Tree.md" >}})|Medium||||44.6%|
+|0344|Reverse String|[Go]({{< relref "/ChapterFour/0300~0399/0344.Reverse-String.md" >}})|Easy| O(n)| O(1)||76.7%|
+|0345|Reverse Vowels of a String|[Go]({{< relref "/ChapterFour/0300~0399/0345.Reverse-Vowels-of-a-String.md" >}})|Easy| O(n)| O(1)||50.1%|
+|0383|Ransom Note|[Go]({{< relref "/ChapterFour/0300~0399/0383.Ransom-Note.md" >}})|Easy||||58.2%|
+|0385|Mini Parser|[Go]({{< relref "/ChapterFour/0300~0399/0385.Mini-Parser.md" >}})|Medium||||36.9%|
+|0387|First Unique Character in a String|[Go]({{< relref "/ChapterFour/0300~0399/0387.First-Unique-Character-in-a-String.md" >}})|Easy||||59.6%|
+|0389|Find the Difference|[Go]({{< relref "/ChapterFour/0300~0399/0389.Find-the-Difference.md" >}})|Easy||||59.9%|
+|0392|Is Subsequence|[Go]({{< relref "/ChapterFour/0300~0399/0392.Is-Subsequence.md" >}})|Easy||||47.6%|
+|0394|Decode String|[Go]({{< relref "/ChapterFour/0300~0399/0394.Decode-String.md" >}})|Medium||||57.9%|
+|0395|Longest Substring with At Least K Repeating Characters|[Go]({{< relref "/ChapterFour/0300~0399/0395.Longest-Substring-with-At-Least-K-Repeating-Characters.md" >}})|Medium||||44.8%|
+|0402|Remove K Digits|[Go]({{< relref "/ChapterFour/0400~0499/0402.Remove-K-Digits.md" >}})|Medium||||30.6%|
+|0409|Longest Palindrome|[Go]({{< relref "/ChapterFour/0400~0499/0409.Longest-Palindrome.md" >}})|Easy||||54.2%|
+|0412|Fizz Buzz|[Go]({{< relref "/ChapterFour/0400~0499/0412.Fizz-Buzz.md" >}})|Easy||||69.9%|
+|0423|Reconstruct Original Digits from English|[Go]({{< relref "/ChapterFour/0400~0499/0423.Reconstruct-Original-Digits-from-English.md" >}})|Medium||||51.3%|
+|0424|Longest Repeating Character Replacement|[Go]({{< relref "/ChapterFour/0400~0499/0424.Longest-Repeating-Character-Replacement.md" >}})|Medium||||51.9%|
+|0433|Minimum Genetic Mutation|[Go]({{< relref "/ChapterFour/0400~0499/0433.Minimum-Genetic-Mutation.md" >}})|Medium||||52.3%|
+|0434|Number of Segments in a String|[Go]({{< relref "/ChapterFour/0400~0499/0434.Number-of-Segments-in-a-String.md" >}})|Easy||||37.2%|
+|0438|Find All Anagrams in a String|[Go]({{< relref "/ChapterFour/0400~0499/0438.Find-All-Anagrams-in-a-String.md" >}})|Medium||||50.2%|
+|0451|Sort Characters By Frequency|[Go]({{< relref "/ChapterFour/0400~0499/0451.Sort-Characters-By-Frequency.md" >}})|Medium||||70.1%|
+|0474|Ones and Zeroes|[Go]({{< relref "/ChapterFour/0400~0499/0474.Ones-and-Zeroes.md" >}})|Medium||||46.8%|
+|0488|Zuma Game|[Go]({{< relref "/ChapterFour/0400~0499/0488.Zuma-Game.md" >}})|Hard||||33.9%|
+|0500|Keyboard Row|[Go]({{< relref "/ChapterFour/0500~0599/0500.Keyboard-Row.md" >}})|Easy||||69.5%|
+|0520|Detect Capital|[Go]({{< relref "/ChapterFour/0500~0599/0520.Detect-Capital.md" >}})|Easy||||57.0%|
+|0524|Longest Word in Dictionary through Deleting|[Go]({{< relref "/ChapterFour/0500~0599/0524.Longest-Word-in-Dictionary-through-Deleting.md" >}})|Medium||||51.0%|
+|0535|Encode and Decode TinyURL|[Go]({{< relref "/ChapterFour/0500~0599/0535.Encode-and-Decode-TinyURL.md" >}})|Medium||||85.9%|
+|0537|Complex Number Multiplication|[Go]({{< relref "/ChapterFour/0500~0599/0537.Complex-Number-Multiplication.md" >}})|Medium||||71.4%|
+|0541|Reverse String II|[Go]({{< relref "/ChapterFour/0500~0599/0541.Reverse-String-II.md" >}})|Easy||||50.5%|
+|0551|Student Attendance Record I|[Go]({{< relref "/ChapterFour/0500~0599/0551.Student-Attendance-Record-I.md" >}})|Easy||||48.2%|
+|0557|Reverse Words in a String III|[Go]({{< relref "/ChapterFour/0500~0599/0557.Reverse-Words-in-a-String-III.md" >}})|Easy||||81.9%|
+|0567|Permutation in String|[Go]({{< relref "/ChapterFour/0500~0599/0567.Permutation-in-String.md" >}})|Medium||||44.3%|
+|0583|Delete Operation for Two Strings|[Go]({{< relref "/ChapterFour/0500~0599/0583.Delete-Operation-for-Two-Strings.md" >}})|Medium||||59.8%|
+|0599|Minimum Index Sum of Two Lists|[Go]({{< relref "/ChapterFour/0500~0599/0599.Minimum-Index-Sum-of-Two-Lists.md" >}})|Easy||||53.4%|
+|0609|Find Duplicate File in System|[Go]({{< relref "/ChapterFour/0600~0699/0609.Find-Duplicate-File-in-System.md" >}})|Medium||||67.7%|
+|0647|Palindromic Substrings|[Go]({{< relref "/ChapterFour/0600~0699/0647.Palindromic-Substrings.md" >}})|Medium||||66.8%|
+|0648|Replace Words|[Go]({{< relref "/ChapterFour/0600~0699/0648.Replace-Words.md" >}})|Medium||||62.7%|
+|0676|Implement Magic Dictionary|[Go]({{< relref "/ChapterFour/0600~0699/0676.Implement-Magic-Dictionary.md" >}})|Medium||||57.0%|
+|0677|Map Sum Pairs|[Go]({{< relref "/ChapterFour/0600~0699/0677.Map-Sum-Pairs.md" >}})|Medium||||56.8%|
+|0692|Top K Frequent Words|[Go]({{< relref "/ChapterFour/0600~0699/0692.Top-K-Frequent-Words.md" >}})|Medium||||57.2%|
+|0696|Count Binary Substrings|[Go]({{< relref "/ChapterFour/0600~0699/0696.Count-Binary-Substrings.md" >}})|Easy||||65.5%|
+|0709|To Lower Case|[Go]({{< relref "/ChapterFour/0700~0799/0709.To-Lower-Case.md" >}})|Easy||||82.4%|
+|0720|Longest Word in Dictionary|[Go]({{< relref "/ChapterFour/0700~0799/0720.Longest-Word-in-Dictionary.md" >}})|Medium||||52.0%|
+|0721|Accounts Merge|[Go]({{< relref "/ChapterFour/0700~0799/0721.Accounts-Merge.md" >}})|Medium||||56.3%|
+|0726|Number of Atoms|[Go]({{< relref "/ChapterFour/0700~0799/0726.Number-of-Atoms.md" >}})|Hard||||52.1%|
+|0745|Prefix and Suffix Search|[Go]({{< relref "/ChapterFour/0700~0799/0745.Prefix-and-Suffix-Search.md" >}})|Hard||||41.2%|
+|0748|Shortest Completing Word|[Go]({{< relref "/ChapterFour/0700~0799/0748.Shortest-Completing-Word.md" >}})|Easy||||59.3%|
+|0752|Open the Lock|[Go]({{< relref "/ChapterFour/0700~0799/0752.Open-the-Lock.md" >}})|Medium||||55.6%|
+|0763|Partition Labels|[Go]({{< relref "/ChapterFour/0700~0799/0763.Partition-Labels.md" >}})|Medium||||79.7%|
+|0767|Reorganize String|[Go]({{< relref "/ChapterFour/0700~0799/0767.Reorganize-String.md" >}})|Medium| O(n log n)| O(log n) |❤️|52.9%|
+|0771|Jewels and Stones|[Go]({{< relref "/ChapterFour/0700~0799/0771.Jewels-and-Stones.md" >}})|Easy||||88.2%|
+|0784|Letter Case Permutation|[Go]({{< relref "/ChapterFour/0700~0799/0784.Letter-Case-Permutation.md" >}})|Medium||||73.8%|
+|0791|Custom Sort String|[Go]({{< relref "/ChapterFour/0700~0799/0791.Custom-Sort-String.md" >}})|Medium||||69.1%|
+|0792|Number of Matching Subsequences|[Go]({{< relref "/ChapterFour/0700~0799/0792.Number-of-Matching-Subsequences.md" >}})|Medium||||51.6%|
+|0794|Valid Tic-Tac-Toe State|[Go]({{< relref "/ChapterFour/0700~0799/0794.Valid-Tic-Tac-Toe-State.md" >}})|Medium||||35.1%|
+|0811|Subdomain Visit Count|[Go]({{< relref "/ChapterFour/0800~0899/0811.Subdomain-Visit-Count.md" >}})|Medium||||75.5%|
+|0816|Ambiguous Coordinates|[Go]({{< relref "/ChapterFour/0800~0899/0816.Ambiguous-Coordinates.md" >}})|Medium||||56.3%|
+|0819|Most Common Word|[Go]({{< relref "/ChapterFour/0800~0899/0819.Most-Common-Word.md" >}})|Easy||||44.8%|
+|0820|Short Encoding of Words|[Go]({{< relref "/ChapterFour/0800~0899/0820.Short-Encoding-of-Words.md" >}})|Medium||||60.6%|
+|0821|Shortest Distance to a Character|[Go]({{< relref "/ChapterFour/0800~0899/0821.Shortest-Distance-to-a-Character.md" >}})|Easy||||71.3%|
+|0828|Count Unique Characters of All Substrings of a Given String|[Go]({{< relref "/ChapterFour/0800~0899/0828.Count-Unique-Characters-of-All-Substrings-of-a-Given-String.md" >}})|Hard||||51.6%|
+|0830|Positions of Large Groups|[Go]({{< relref "/ChapterFour/0800~0899/0830.Positions-of-Large-Groups.md" >}})|Easy||||51.8%|
+|0838|Push Dominoes|[Go]({{< relref "/ChapterFour/0800~0899/0838.Push-Dominoes.md" >}})|Medium||||57.0%|
+|0839|Similar String Groups|[Go]({{< relref "/ChapterFour/0800~0899/0839.Similar-String-Groups.md" >}})|Hard||||48.0%|
+|0842|Split Array into Fibonacci Sequence|[Go]({{< relref "/ChapterFour/0800~0899/0842.Split-Array-into-Fibonacci-Sequence.md" >}})|Medium| O(n^2)| O(1)|❤️|38.4%|
+|0844|Backspace String Compare|[Go]({{< relref "/ChapterFour/0800~0899/0844.Backspace-String-Compare.md" >}})|Easy||||48.1%|
+|0856|Score of Parentheses|[Go]({{< relref "/ChapterFour/0800~0899/0856.Score-of-Parentheses.md" >}})|Medium| O(n)| O(n)||64.8%|
+|0859|Buddy Strings|[Go]({{< relref "/ChapterFour/0800~0899/0859.Buddy-Strings.md" >}})|Easy||||29.2%|
+|0880|Decoded String at Index|[Go]({{< relref "/ChapterFour/0800~0899/0880.Decoded-String-at-Index.md" >}})|Medium||||28.3%|
+|0884|Uncommon Words from Two Sentences|[Go]({{< relref "/ChapterFour/0800~0899/0884.Uncommon-Words-from-Two-Sentences.md" >}})|Easy||||66.3%|
+|0890|Find and Replace Pattern|[Go]({{< relref "/ChapterFour/0800~0899/0890.Find-and-Replace-Pattern.md" >}})|Medium||||77.6%|
+|0916|Word Subsets|[Go]({{< relref "/ChapterFour/0900~0999/0916.Word-Subsets.md" >}})|Medium||||53.7%|
+|0921|Minimum Add to Make Parentheses Valid|[Go]({{< relref "/ChapterFour/0900~0999/0921.Minimum-Add-to-Make-Parentheses-Valid.md" >}})|Medium||||75.8%|
+|0925|Long Pressed Name|[Go]({{< relref "/ChapterFour/0900~0999/0925.Long-Pressed-Name.md" >}})|Easy| O(n)| O(1)||33.1%|
+|0942|DI String Match|[Go]({{< relref "/ChapterFour/0900~0999/0942.DI-String-Match.md" >}})|Easy||||77.3%|
+|0949|Largest Time for Given Digits|[Go]({{< relref "/ChapterFour/0900~0999/0949.Largest-Time-for-Given-Digits.md" >}})|Medium||||35.2%|
+|0953|Verifying an Alien Dictionary|[Go]({{< relref "/ChapterFour/0900~0999/0953.Verifying-an-Alien-Dictionary.md" >}})|Easy||||54.5%|
+|0966|Vowel Spellchecker|[Go]({{< relref "/ChapterFour/0900~0999/0966.Vowel-Spellchecker.md" >}})|Medium||||51.4%|
+|0981|Time Based Key-Value Store|[Go]({{< relref "/ChapterFour/0900~0999/0981.Time-Based-Key-Value-Store.md" >}})|Medium||||52.3%|
+|0984|String Without AAA or BBB|[Go]({{< relref "/ChapterFour/0900~0999/0984.String-Without-AAA-or-BBB.md" >}})|Medium||||43.1%|
+|0990|Satisfiability of Equality Equations|[Go]({{< relref "/ChapterFour/0900~0999/0990.Satisfiability-of-Equality-Equations.md" >}})|Medium||||50.5%|
+|1002|Find Common Characters|[Go]({{< relref "/ChapterFour/1000~1099/1002.Find-Common-Characters.md" >}})|Easy||||68.5%|
+|1003|Check If Word Is Valid After Substitutions|[Go]({{< relref "/ChapterFour/1000~1099/1003.Check-If-Word-Is-Valid-After-Substitutions.md" >}})|Medium| O(n)| O(1)||58.2%|
+|1021|Remove Outermost Parentheses|[Go]({{< relref "/ChapterFour/1000~1099/1021.Remove-Outermost-Parentheses.md" >}})|Easy||||80.6%|
+|1028|Recover a Tree From Preorder Traversal|[Go]({{< relref "/ChapterFour/1000~1099/1028.Recover-a-Tree-From-Preorder-Traversal.md" >}})|Hard||||73.3%|
+|1047|Remove All Adjacent Duplicates In String|[Go]({{< relref "/ChapterFour/1000~1099/1047.Remove-All-Adjacent-Duplicates-In-String.md" >}})|Easy||||69.7%|
+|1048|Longest String Chain|[Go]({{< relref "/ChapterFour/1000~1099/1048.Longest-String-Chain.md" >}})|Medium||||59.2%|
+|1078|Occurrences After Bigram|[Go]({{< relref "/ChapterFour/1000~1099/1078.Occurrences-After-Bigram.md" >}})|Easy||||63.6%|
+|1079|Letter Tile Possibilities|[Go]({{< relref "/ChapterFour/1000~1099/1079.Letter-Tile-Possibilities.md" >}})|Medium||||76.0%|
+|1108|Defanging an IP Address|[Go]({{< relref "/ChapterFour/1100~1199/1108.Defanging-an-IP-Address.md" >}})|Easy||||89.1%|
+|1111|Maximum Nesting Depth of Two Valid Parentheses Strings|[Go]({{< relref "/ChapterFour/1100~1199/1111.Maximum-Nesting-Depth-of-Two-Valid-Parentheses-Strings.md" >}})|Medium||||73.0%|
+|1143|Longest Common Subsequence|[Go]({{< relref "/ChapterFour/1100~1199/1143.Longest-Common-Subsequence.md" >}})|Medium||||58.4%|
+|1154|Day of the Year|[Go]({{< relref "/ChapterFour/1100~1199/1154.Day-of-the-Year.md" >}})|Easy||||49.6%|
+|1160|Find Words That Can Be Formed by Characters|[Go]({{< relref "/ChapterFour/1100~1199/1160.Find-Words-That-Can-Be-Formed-by-Characters.md" >}})|Easy||||67.5%|
+|1170|Compare Strings by Frequency of the Smallest Character|[Go]({{< relref "/ChapterFour/1100~1199/1170.Compare-Strings-by-Frequency-of-the-Smallest-Character.md" >}})|Medium||||61.5%|
+|1178|Number of Valid Words for Each Puzzle|[Go]({{< relref "/ChapterFour/1100~1199/1178.Number-of-Valid-Words-for-Each-Puzzle.md" >}})|Hard||||46.3%|
+|1189|Maximum Number of Balloons|[Go]({{< relref "/ChapterFour/1100~1199/1189.Maximum-Number-of-Balloons.md" >}})|Easy||||61.0%|
+|1190|Reverse Substrings Between Each Pair of Parentheses|[Go]({{< relref "/ChapterFour/1100~1199/1190.Reverse-Substrings-Between-Each-Pair-of-Parentheses.md" >}})|Medium||||65.9%|
+|1202|Smallest String With Swaps|[Go]({{< relref "/ChapterFour/1200~1299/1202.Smallest-String-With-Swaps.md" >}})|Medium||||57.7%|
+|1208|Get Equal Substrings Within Budget|[Go]({{< relref "/ChapterFour/1200~1299/1208.Get-Equal-Substrings-Within-Budget.md" >}})|Medium||||48.5%|
+|1209|Remove All Adjacent Duplicates in String II|[Go]({{< relref "/ChapterFour/1200~1299/1209.Remove-All-Adjacent-Duplicates-in-String-II.md" >}})|Medium||||56.2%|
+|1221|Split a String in Balanced Strings|[Go]({{< relref "/ChapterFour/1200~1299/1221.Split-a-String-in-Balanced-Strings.md" >}})|Easy||||85.1%|
+|1234|Replace the Substring for Balanced String|[Go]({{< relref "/ChapterFour/1200~1299/1234.Replace-the-Substring-for-Balanced-String.md" >}})|Medium||||37.2%|
+|1239|Maximum Length of a Concatenated String with Unique Characters|[Go]({{< relref "/ChapterFour/1200~1299/1239.Maximum-Length-of-a-Concatenated-String-with-Unique-Characters.md" >}})|Medium||||52.2%|
+|1249|Minimum Remove to Make Valid Parentheses|[Go]({{< relref "/ChapterFour/1200~1299/1249.Minimum-Remove-to-Make-Valid-Parentheses.md" >}})|Medium||||65.8%|
+|1268|Search Suggestions System|[Go]({{< relref "/ChapterFour/1200~1299/1268.Search-Suggestions-System.md" >}})|Medium||||66.2%|
+|1332|Remove Palindromic Subsequences|[Go]({{< relref "/ChapterFour/1300~1399/1332.Remove-Palindromic-Subsequences.md" >}})|Easy||||76.2%|
+|1396|Design Underground System|[Go]({{< relref "/ChapterFour/1300~1399/1396.Design-Underground-System.md" >}})|Medium||||73.6%|
+|1446|Consecutive Characters|[Go]({{< relref "/ChapterFour/1400~1499/1446.Consecutive-Characters.md" >}})|Easy||||61.2%|
+|1455|Check If a Word Occurs As a Prefix of Any Word in a Sentence|[Go]({{< relref "/ChapterFour/1400~1499/1455.Check-If-a-Word-Occurs-As-a-Prefix-of-Any-Word-in-a-Sentence.md" >}})|Easy||||64.2%|
+|1461|Check If a String Contains All Binary Codes of Size K|[Go]({{< relref "/ChapterFour/1400~1499/1461.Check-If-a-String-Contains-All-Binary-Codes-of-Size-K.md" >}})|Medium||||56.6%|
+|1573|Number of Ways to Split a String|[Go]({{< relref "/ChapterFour/1500~1599/1573.Number-of-Ways-to-Split-a-String.md" >}})|Medium||||32.5%|
+|1576|Replace All ?'s to Avoid Consecutive Repeating Characters|[Go]({{< relref "/ChapterFour/1500~1599/1576.Replace-All-s-to-Avoid-Consecutive-Repeating-Characters.md" >}})|Easy||||48.3%|
+|1614|Maximum Nesting Depth of the Parentheses|[Go]({{< relref "/ChapterFour/1600~1699/1614.Maximum-Nesting-Depth-of-the-Parentheses.md" >}})|Easy||||82.3%|
+|1624|Largest Substring Between Two Equal Characters|[Go]({{< relref "/ChapterFour/1600~1699/1624.Largest-Substring-Between-Two-Equal-Characters.md" >}})|Easy||||59.1%|
+|1629|Slowest Key|[Go]({{< relref "/ChapterFour/1600~1699/1629.Slowest-Key.md" >}})|Easy||||59.2%|
+|1647|Minimum Deletions to Make Character Frequencies Unique|[Go]({{< relref "/ChapterFour/1600~1699/1647.Minimum-Deletions-to-Make-Character-Frequencies-Unique.md" >}})|Medium||||59.1%|
+|1653|Minimum Deletions to Make String Balanced|[Go]({{< relref "/ChapterFour/1600~1699/1653.Minimum-Deletions-to-Make-String-Balanced.md" >}})|Medium||||58.9%|
+|1657|Determine if Two Strings Are Close|[Go]({{< relref "/ChapterFour/1600~1699/1657.Determine-if-Two-Strings-Are-Close.md" >}})|Medium||||56.3%|
+|1662|Check If Two String Arrays are Equivalent|[Go]({{< relref "/ChapterFour/1600~1699/1662.Check-If-Two-String-Arrays-are-Equivalent.md" >}})|Easy||||83.5%|
+|1663|Smallest String With A Given Numeric Value|[Go]({{< relref "/ChapterFour/1600~1699/1663.Smallest-String-With-A-Given-Numeric-Value.md" >}})|Medium||||66.8%|
+|1668|Maximum Repeating Substring|[Go]({{< relref "/ChapterFour/1600~1699/1668.Maximum-Repeating-Substring.md" >}})|Easy||||39.5%|
+|1678|Goal Parser Interpretation|[Go]({{< relref "/ChapterFour/1600~1699/1678.Goal-Parser-Interpretation.md" >}})|Easy||||86.5%|
+|1684|Count the Number of Consistent Strings|[Go]({{< relref "/ChapterFour/1600~1699/1684.Count-the-Number-of-Consistent-Strings.md" >}})|Easy||||82.2%|
+|1689|Partitioning Into Minimum Number Of Deci-Binary Numbers|[Go]({{< relref "/ChapterFour/1600~1699/1689.Partitioning-Into-Minimum-Number-Of-Deci-Binary-Numbers.md" >}})|Medium||||89.2%|
+|1694|Reformat Phone Number|[Go]({{< relref "/ChapterFour/1600~1699/1694.Reformat-Phone-Number.md" >}})|Easy||||65.1%|
+|1704|Determine if String Halves Are Alike|[Go]({{< relref "/ChapterFour/1700~1799/1704.Determine-if-String-Halves-Are-Alike.md" >}})|Easy||||77.7%|
+|1736|Latest Time by Replacing Hidden Digits|[Go]({{< relref "/ChapterFour/1700~1799/1736.Latest-Time-by-Replacing-Hidden-Digits.md" >}})|Easy||||42.4%|
+|1758|Minimum Changes To Make Alternating Binary String|[Go]({{< relref "/ChapterFour/1700~1799/1758.Minimum-Changes-To-Make-Alternating-Binary-String.md" >}})|Easy||||58.3%|
+|1763|Longest Nice Substring|[Go]({{< relref "/ChapterFour/1700~1799/1763.Longest-Nice-Substring.md" >}})|Easy||||61.6%|
+|1816|Truncate Sentence|[Go]({{< relref "/ChapterFour/1800~1899/1816.Truncate-Sentence.md" >}})|Easy||||83.0%|
+|2038|Remove Colored Pieces if Both Neighbors are the Same Color|[Go]({{< relref "/ChapterFour/2000~2099/2038.Remove-Colored-Pieces-if-Both-Neighbors-are-the-Same-Color.md" >}})|Medium||||57.9%|
+|2096|Step-By-Step Directions From a Binary Tree Node to Another|[Go]({{< relref "/ChapterFour/2000~2099/2096.Step-By-Step-Directions-From-a-Binary-Tree-Node-to-Another.md" >}})|Medium||||48.4%|
+|2167|Minimum Time to Remove All Cars Containing Illegal Goods|[Go]({{< relref "/ChapterFour/2100~2199/2167.Minimum-Time-to-Remove-All-Cars-Containing-Illegal-Goods.md" >}})|Hard||||40.7%|
+|2182|Construct String With Repeat Limit|[Go]({{< relref "/ChapterFour/2100~2199/2182.Construct-String-With-Repeat-Limit.md" >}})|Medium||||52.2%|
+|------------|-------------------------------------------------------|-------| ----------------| ---------------|-------------|-------------|-------------|
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterTwo/Array/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterTwo/Two_Pointers/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterTwo/Tree.md b/website/content/ChapterTwo/Tree.md
index d8a1267e5..ebd6b5b9b 100644
--- a/website/content/ChapterTwo/Tree.md
+++ b/website/content/ChapterTwo/Tree.md
@@ -1,43 +1,103 @@
---
-title: Tree
+title: 2.06 Tree
type: docs
+weight: 6
---
# Tree
-| Title | Solution | Difficulty | Time | Space |收藏|
-| ----- | :--------: | :----------: | :----: | :-----: | :-----: |
-|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
+
+| No. | Title | Solution | Difficulty | TimeComplexity | SpaceComplexity |Favorite| Acceptance |
+|:--------:|:------- | :--------: | :----------: | :----: | :-----: | :-----: |:-----: |
+|0094|Binary Tree Inorder Traversal|[Go]({{< relref "/ChapterFour/0001~0099/0094.Binary-Tree-Inorder-Traversal.md" >}})|Easy| O(n)| O(1)||73.8%|
+|0095|Unique Binary Search Trees II|[Go]({{< relref "/ChapterFour/0001~0099/0095.Unique-Binary-Search-Trees-II.md" >}})|Medium||||52.3%|
+|0096|Unique Binary Search Trees|[Go]({{< relref "/ChapterFour/0001~0099/0096.Unique-Binary-Search-Trees.md" >}})|Medium| O(n^2)| O(n)||59.6%|
+|0098|Validate Binary Search Tree|[Go]({{< relref "/ChapterFour/0001~0099/0098.Validate-Binary-Search-Tree.md" >}})|Medium| O(n)| O(1)||32.0%|
+|0099|Recover Binary Search Tree|[Go]({{< relref "/ChapterFour/0001~0099/0099.Recover-Binary-Search-Tree.md" >}})|Medium| O(n)| O(1)||51.0%|
+|0100|Same Tree|[Go]({{< relref "/ChapterFour/0100~0199/0100.Same-Tree.md" >}})|Easy| O(n)| O(1)||58.1%|
+|0101|Symmetric Tree|[Go]({{< relref "/ChapterFour/0100~0199/0101.Symmetric-Tree.md" >}})|Easy| O(n)| O(1)||54.3%|
+|0102|Binary Tree Level Order Traversal|[Go]({{< relref "/ChapterFour/0100~0199/0102.Binary-Tree-Level-Order-Traversal.md" >}})|Medium| O(n)| O(1)||64.3%|
+|0103|Binary Tree Zigzag Level Order Traversal|[Go]({{< relref "/ChapterFour/0100~0199/0103.Binary-Tree-Zigzag-Level-Order-Traversal.md" >}})|Medium| O(n)| O(n)||56.9%|
+|0104|Maximum Depth of Binary Tree|[Go]({{< relref "/ChapterFour/0100~0199/0104.Maximum-Depth-of-Binary-Tree.md" >}})|Easy| O(n)| O(1)||73.9%|
+|0105|Construct Binary Tree from Preorder and Inorder Traversal|[Go]({{< relref "/ChapterFour/0100~0199/0105.Construct-Binary-Tree-from-Preorder-and-Inorder-Traversal.md" >}})|Medium||||61.5%|
+|0106|Construct Binary Tree from Inorder and Postorder Traversal|[Go]({{< relref "/ChapterFour/0100~0199/0106.Construct-Binary-Tree-from-Inorder-and-Postorder-Traversal.md" >}})|Medium||||60.0%|
+|0107|Binary Tree Level Order Traversal II|[Go]({{< relref "/ChapterFour/0100~0199/0107.Binary-Tree-Level-Order-Traversal-II.md" >}})|Medium| O(n)| O(1)||61.1%|
+|0108|Convert Sorted Array to Binary Search Tree|[Go]({{< relref "/ChapterFour/0100~0199/0108.Convert-Sorted-Array-to-Binary-Search-Tree.md" >}})|Easy| O(n)| O(1)||69.8%|
+|0109|Convert Sorted List to Binary Search Tree|[Go]({{< relref "/ChapterFour/0100~0199/0109.Convert-Sorted-List-to-Binary-Search-Tree.md" >}})|Medium||||60.2%|
+|0110|Balanced Binary Tree|[Go]({{< relref "/ChapterFour/0100~0199/0110.Balanced-Binary-Tree.md" >}})|Easy| O(n)| O(1)||49.0%|
+|0111|Minimum Depth of Binary Tree|[Go]({{< relref "/ChapterFour/0100~0199/0111.Minimum-Depth-of-Binary-Tree.md" >}})|Easy| O(n)| O(1)||44.4%|
+|0112|Path Sum|[Go]({{< relref "/ChapterFour/0100~0199/0112.Path-Sum.md" >}})|Easy| O(n)| O(1)||48.2%|
+|0113|Path Sum II|[Go]({{< relref "/ChapterFour/0100~0199/0113.Path-Sum-II.md" >}})|Medium| O(n)| O(1)||57.1%|
+|0114|Flatten Binary Tree to Linked List|[Go]({{< relref "/ChapterFour/0100~0199/0114.Flatten-Binary-Tree-to-Linked-List.md" >}})|Medium| O(n)| O(1)||61.8%|
+|0116|Populating Next Right Pointers in Each Node|[Go]({{< relref "/ChapterFour/0100~0199/0116.Populating-Next-Right-Pointers-in-Each-Node.md" >}})|Medium||||60.4%|
+|0124|Binary Tree Maximum Path Sum|[Go]({{< relref "/ChapterFour/0100~0199/0124.Binary-Tree-Maximum-Path-Sum.md" >}})|Hard| O(n)| O(1)||39.2%|
+|0129|Sum Root to Leaf Numbers|[Go]({{< relref "/ChapterFour/0100~0199/0129.Sum-Root-to-Leaf-Numbers.md" >}})|Medium| O(n)| O(1)||61.0%|
+|0144|Binary Tree Preorder Traversal|[Go]({{< relref "/ChapterFour/0100~0199/0144.Binary-Tree-Preorder-Traversal.md" >}})|Easy| O(n)| O(1)||66.8%|
+|0145|Binary Tree Postorder Traversal|[Go]({{< relref "/ChapterFour/0100~0199/0145.Binary-Tree-Postorder-Traversal.md" >}})|Easy| O(n)| O(1)||67.9%|
+|0173|Binary Search Tree Iterator|[Go]({{< relref "/ChapterFour/0100~0199/0173.Binary-Search-Tree-Iterator.md" >}})|Medium| O(n)| O(1)||69.7%|
+|0199|Binary Tree Right Side View|[Go]({{< relref "/ChapterFour/0100~0199/0199.Binary-Tree-Right-Side-View.md" >}})|Medium| O(n)| O(1)||61.6%|
+|0222|Count Complete Tree Nodes|[Go]({{< relref "/ChapterFour/0200~0299/0222.Count-Complete-Tree-Nodes.md" >}})|Medium| O(n)| O(1)||60.5%|
+|0226|Invert Binary Tree|[Go]({{< relref "/ChapterFour/0200~0299/0226.Invert-Binary-Tree.md" >}})|Easy| O(n)| O(1)||74.7%|
+|0230|Kth Smallest Element in a BST|[Go]({{< relref "/ChapterFour/0200~0299/0230.Kth-Smallest-Element-in-a-BST.md" >}})|Medium| O(n)| O(1)||70.1%|
+|0235|Lowest Common Ancestor of a Binary Search Tree|[Go]({{< relref "/ChapterFour/0200~0299/0235.Lowest-Common-Ancestor-of-a-Binary-Search-Tree.md" >}})|Medium| O(n)| O(1)||61.5%|
+|0236|Lowest Common Ancestor of a Binary Tree|[Go]({{< relref "/ChapterFour/0200~0299/0236.Lowest-Common-Ancestor-of-a-Binary-Tree.md" >}})|Medium| O(n)| O(1)||58.8%|
+|0257|Binary Tree Paths|[Go]({{< relref "/ChapterFour/0200~0299/0257.Binary-Tree-Paths.md" >}})|Easy| O(n)| O(1)||61.4%|
+|0297|Serialize and Deserialize Binary Tree|[Go]({{< relref "/ChapterFour/0200~0299/0297.Serialize-and-Deserialize-Binary-Tree.md" >}})|Hard||||55.4%|
+|0331|Verify Preorder Serialization of a Binary Tree|[Go]({{< relref "/ChapterFour/0300~0399/0331.Verify-Preorder-Serialization-of-a-Binary-Tree.md" >}})|Medium||||44.6%|
+|0337|House Robber III|[Go]({{< relref "/ChapterFour/0300~0399/0337.House-Robber-III.md" >}})|Medium||||53.9%|
+|0341|Flatten Nested List Iterator|[Go]({{< relref "/ChapterFour/0300~0399/0341.Flatten-Nested-List-Iterator.md" >}})|Medium||||61.8%|
+|0404|Sum of Left Leaves|[Go]({{< relref "/ChapterFour/0400~0499/0404.Sum-of-Left-Leaves.md" >}})|Easy| O(n)| O(1)||56.7%|
+|0429|N-ary Tree Level Order Traversal|[Go]({{< relref "/ChapterFour/0400~0499/0429.N-ary-Tree-Level-Order-Traversal.md" >}})|Medium||||70.7%|
+|0437|Path Sum III|[Go]({{< relref "/ChapterFour/0400~0499/0437.Path-Sum-III.md" >}})|Medium| O(n)| O(1)||48.0%|
+|0508|Most Frequent Subtree Sum|[Go]({{< relref "/ChapterFour/0500~0599/0508.Most-Frequent-Subtree-Sum.md" >}})|Medium||||64.9%|
+|0513|Find Bottom Left Tree Value|[Go]({{< relref "/ChapterFour/0500~0599/0513.Find-Bottom-Left-Tree-Value.md" >}})|Medium||||66.9%|
+|0515|Find Largest Value in Each Tree Row|[Go]({{< relref "/ChapterFour/0500~0599/0515.Find-Largest-Value-in-Each-Tree-Row.md" >}})|Medium| O(n)| O(n)||64.6%|
+|0530|Minimum Absolute Difference in BST|[Go]({{< relref "/ChapterFour/0500~0599/0530.Minimum-Absolute-Difference-in-BST.md" >}})|Easy||||57.3%|
+|0538|Convert BST to Greater Tree|[Go]({{< relref "/ChapterFour/0500~0599/0538.Convert-BST-to-Greater-Tree.md" >}})|Medium||||67.8%|
+|0543|Diameter of Binary Tree|[Go]({{< relref "/ChapterFour/0500~0599/0543.Diameter-of-Binary-Tree.md" >}})|Easy||||56.8%|
+|0559|Maximum Depth of N-ary Tree|[Go]({{< relref "/ChapterFour/0500~0599/0559.Maximum-Depth-of-N-ary-Tree.md" >}})|Easy||||71.7%|
+|0563|Binary Tree Tilt|[Go]({{< relref "/ChapterFour/0500~0599/0563.Binary-Tree-Tilt.md" >}})|Easy||||60.0%|
+|0572|Subtree of Another Tree|[Go]({{< relref "/ChapterFour/0500~0599/0572.Subtree-of-Another-Tree.md" >}})|Easy||||46.4%|
+|0589|N-ary Tree Preorder Traversal|[Go]({{< relref "/ChapterFour/0500~0599/0589.N-ary-Tree-Preorder-Traversal.md" >}})|Easy||||75.9%|
+|0617|Merge Two Binary Trees|[Go]({{< relref "/ChapterFour/0600~0699/0617.Merge-Two-Binary-Trees.md" >}})|Easy||||78.6%|
+|0623|Add One Row to Tree|[Go]({{< relref "/ChapterFour/0600~0699/0623.Add-One-Row-to-Tree.md" >}})|Medium||||59.5%|
+|0637|Average of Levels in Binary Tree|[Go]({{< relref "/ChapterFour/0600~0699/0637.Average-of-Levels-in-Binary-Tree.md" >}})|Easy| O(n)| O(n)||71.8%|
+|0653|Two Sum IV - Input is a BST|[Go]({{< relref "/ChapterFour/0600~0699/0653.Two-Sum-IV-Input-is-a-BST.md" >}})|Easy||||61.0%|
+|0662|Maximum Width of Binary Tree|[Go]({{< relref "/ChapterFour/0600~0699/0662.Maximum-Width-of-Binary-Tree.md" >}})|Medium||||40.7%|
+|0669|Trim a Binary Search Tree|[Go]({{< relref "/ChapterFour/0600~0699/0669.Trim-a-Binary-Search-Tree.md" >}})|Medium||||66.4%|
+|0700|Search in a Binary Search Tree|[Go]({{< relref "/ChapterFour/0700~0799/0700.Search-in-a-Binary-Search-Tree.md" >}})|Easy||||77.7%|
+|0701|Insert into a Binary Search Tree|[Go]({{< relref "/ChapterFour/0700~0799/0701.Insert-into-a-Binary-Search-Tree.md" >}})|Medium||||74.3%|
+|0703|Kth Largest Element in a Stream|[Go]({{< relref "/ChapterFour/0700~0799/0703.Kth-Largest-Element-in-a-Stream.md" >}})|Easy||||55.5%|
+|0783|Minimum Distance Between BST Nodes|[Go]({{< relref "/ChapterFour/0700~0799/0783.Minimum-Distance-Between-BST-Nodes.md" >}})|Easy||||59.3%|
+|0834|Sum of Distances in Tree|[Go]({{< relref "/ChapterFour/0800~0899/0834.Sum-of-Distances-in-Tree.md" >}})|Hard||||59.1%|
+|0863|All Nodes Distance K in Binary Tree|[Go]({{< relref "/ChapterFour/0800~0899/0863.All-Nodes-Distance-K-in-Binary-Tree.md" >}})|Medium||||62.2%|
+|0872|Leaf-Similar Trees|[Go]({{< relref "/ChapterFour/0800~0899/0872.Leaf-Similar-Trees.md" >}})|Easy||||67.6%|
+|0897|Increasing Order Search Tree|[Go]({{< relref "/ChapterFour/0800~0899/0897.Increasing-Order-Search-Tree.md" >}})|Easy||||78.4%|
+|0938|Range Sum of BST|[Go]({{< relref "/ChapterFour/0900~0999/0938.Range-Sum-of-BST.md" >}})|Easy||||85.9%|
+|0958|Check Completeness of a Binary Tree|[Go]({{< relref "/ChapterFour/0900~0999/0958.Check-Completeness-of-a-Binary-Tree.md" >}})|Medium||||56.2%|
+|0968|Binary Tree Cameras|[Go]({{< relref "/ChapterFour/0900~0999/0968.Binary-Tree-Cameras.md" >}})|Hard||||46.6%|
+|0971|Flip Binary Tree To Match Preorder Traversal|[Go]({{< relref "/ChapterFour/0900~0999/0971.Flip-Binary-Tree-To-Match-Preorder-Traversal.md" >}})|Medium||||50.0%|
+|0979|Distribute Coins in Binary Tree|[Go]({{< relref "/ChapterFour/0900~0999/0979.Distribute-Coins-in-Binary-Tree.md" >}})|Medium||||72.2%|
+|0987|Vertical Order Traversal of a Binary Tree|[Go]({{< relref "/ChapterFour/0900~0999/0987.Vertical-Order-Traversal-of-a-Binary-Tree.md" >}})|Hard||||45.1%|
+|0993|Cousins in Binary Tree|[Go]({{< relref "/ChapterFour/0900~0999/0993.Cousins-in-Binary-Tree.md" >}})|Easy| O(n)| O(1)||54.6%|
+|1022|Sum of Root To Leaf Binary Numbers|[Go]({{< relref "/ChapterFour/1000~1099/1022.Sum-of-Root-To-Leaf-Binary-Numbers.md" >}})|Easy||||73.6%|
+|1026|Maximum Difference Between Node and Ancestor|[Go]({{< relref "/ChapterFour/1000~1099/1026.Maximum-Difference-Between-Node-and-Ancestor.md" >}})|Medium||||75.8%|
+|1028|Recover a Tree From Preorder Traversal|[Go]({{< relref "/ChapterFour/1000~1099/1028.Recover-a-Tree-From-Preorder-Traversal.md" >}})|Hard||||73.3%|
+|1038|Binary Search Tree to Greater Sum Tree|[Go]({{< relref "/ChapterFour/1000~1099/1038.Binary-Search-Tree-to-Greater-Sum-Tree.md" >}})|Medium||||85.5%|
+|1104|Path In Zigzag Labelled Binary Tree|[Go]({{< relref "/ChapterFour/1100~1199/1104.Path-In-Zigzag-Labelled-Binary-Tree.md" >}})|Medium||||75.1%|
+|1110|Delete Nodes And Return Forest|[Go]({{< relref "/ChapterFour/1100~1199/1110.Delete-Nodes-And-Return-Forest.md" >}})|Medium||||69.3%|
+|1123|Lowest Common Ancestor of Deepest Leaves|[Go]({{< relref "/ChapterFour/1100~1199/1123.Lowest-Common-Ancestor-of-Deepest-Leaves.md" >}})|Medium||||70.9%|
+|1145|Binary Tree Coloring Game|[Go]({{< relref "/ChapterFour/1100~1199/1145.Binary-Tree-Coloring-Game.md" >}})|Medium||||51.7%|
+|1302|Deepest Leaves Sum|[Go]({{< relref "/ChapterFour/1300~1399/1302.Deepest-Leaves-Sum.md" >}})|Medium||||86.7%|
+|1305|All Elements in Two Binary Search Trees|[Go]({{< relref "/ChapterFour/1300~1399/1305.All-Elements-in-Two-Binary-Search-Trees.md" >}})|Medium||||79.8%|
+|1600|Throne Inheritance|[Go]({{< relref "/ChapterFour/1600~1699/1600.Throne-Inheritance.md" >}})|Medium||||63.6%|
+|1609|Even Odd Tree|[Go]({{< relref "/ChapterFour/1600~1699/1609.Even-Odd-Tree.md" >}})|Medium||||54.3%|
+|2096|Step-By-Step Directions From a Binary Tree Node to Another|[Go]({{< relref "/ChapterFour/2000~2099/2096.Step-By-Step-Directions-From-a-Binary-Tree-Node-to-Another.md" >}})|Medium||||48.4%|
+|------------|-------------------------------------------------------|-------| ----------------| ---------------|-------------|-------------|-------------|
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterTwo/Stack/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterTwo/Dynamic_Programming/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterTwo/Two_Pointers.md b/website/content/ChapterTwo/Two_Pointers.md
index ece49e88d..6959d5ff8 100644
--- a/website/content/ChapterTwo/Two_Pointers.md
+++ b/website/content/ChapterTwo/Two_Pointers.md
@@ -1,6 +1,7 @@
---
-title: Two Pointers
+title: 2.03 ✅ Two Pointers
type: docs
+weight: 3
---
# Two Pointers
@@ -28,56 +29,90 @@ type: docs
- 替换字母以后，相同字母能出现连续最长的长度。第 424 题。
- SUM 问题集。第 1 题，第 15 题，第 16 题，第 18 题，第 167 题，第 923 题，第 1074 题。
-| Title | Solution | Difficulty | Time | Space |收藏|
-| ----- | :--------: | :----------: | :----: | :-----: | :-----: |
-|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. Unique Letter String | [Go]({{< relref "/ChapterFour/0828.COPYRIGHT-PROBLEM-XXX.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
+
+| No. | Title | Solution | Difficulty | TimeComplexity | SpaceComplexity |Favorite| Acceptance |
+|:--------:|:------- | :--------: | :----------: | :----: | :-----: | :-----: |:-----: |
+|0011|Container With Most Water|[Go]({{< relref "/ChapterFour/0001~0099/0011.Container-With-Most-Water.md" >}})|Medium| O(n)| O(1)||54.0%|
+|0015|3Sum|[Go]({{< relref "/ChapterFour/0001~0099/0015.3Sum.md" >}})|Medium| O(n^2)| O(n)|❤️|32.6%|
+|0016|3Sum Closest|[Go]({{< relref "/ChapterFour/0001~0099/0016.3Sum-Closest.md" >}})|Medium| O(n^2)| O(1)|❤️|45.8%|
+|0018|4Sum|[Go]({{< relref "/ChapterFour/0001~0099/0018.4Sum.md" >}})|Medium| O(n^3)| O(n^2)|❤️|35.9%|
+|0019|Remove Nth Node From End of List|[Go]({{< relref "/ChapterFour/0001~0099/0019.Remove-Nth-Node-From-End-of-List.md" >}})|Medium| O(n)| O(1)||41.0%|
+|0026|Remove Duplicates from Sorted Array|[Go]({{< relref "/ChapterFour/0001~0099/0026.Remove-Duplicates-from-Sorted-Array.md" >}})|Easy| O(n)| O(1)||51.5%|
+|0027|Remove Element|[Go]({{< relref "/ChapterFour/0001~0099/0027.Remove-Element.md" >}})|Easy| O(n)| O(1)||53.0%|
+|0028|Find the Index of the First Occurrence in a String|[Go]({{< relref "/ChapterFour/0001~0099/0028.Find-the-Index-of-the-First-Occurrence-in-a-String.md" >}})|Easy| O(n)| O(1)||39.0%|
+|0031|Next Permutation|[Go]({{< relref "/ChapterFour/0001~0099/0031.Next-Permutation.md" >}})|Medium||||37.5%|
+|0042|Trapping Rain Water|[Go]({{< relref "/ChapterFour/0001~0099/0042.Trapping-Rain-Water.md" >}})|Hard| O(n)| O(1)|❤️|59.2%|
+|0061|Rotate List|[Go]({{< relref "/ChapterFour/0001~0099/0061.Rotate-List.md" >}})|Medium| O(n)| O(1)||36.1%|
+|0075|Sort Colors|[Go]({{< relref "/ChapterFour/0001~0099/0075.Sort-Colors.md" >}})|Medium| O(n)| O(1)|❤️|58.5%|
+|0080|Remove Duplicates from Sorted Array II|[Go]({{< relref "/ChapterFour/0001~0099/0080.Remove-Duplicates-from-Sorted-Array-II.md" >}})|Medium| O(n)| O(1||52.3%|
+|0082|Remove Duplicates from Sorted List II|[Go]({{< relref "/ChapterFour/0001~0099/0082.Remove-Duplicates-from-Sorted-List-II.md" >}})|Medium||||45.9%|
+|0086|Partition List|[Go]({{< relref "/ChapterFour/0001~0099/0086.Partition-List.md" >}})|Medium| O(n)| O(1)|❤️|52.0%|
+|0088|Merge Sorted Array|[Go]({{< relref "/ChapterFour/0001~0099/0088.Merge-Sorted-Array.md" >}})|Easy| O(n)| O(1)|❤️|46.6%|
+|0125|Valid Palindrome|[Go]({{< relref "/ChapterFour/0100~0199/0125.Valid-Palindrome.md" >}})|Easy| O(n)| O(1)||44.3%|
+|0141|Linked List Cycle|[Go]({{< relref "/ChapterFour/0100~0199/0141.Linked-List-Cycle.md" >}})|Easy| O(n)| O(1)|❤️|47.4%|
+|0142|Linked List Cycle II|[Go]({{< relref "/ChapterFour/0100~0199/0142.Linked-List-Cycle-II.md" >}})|Medium| O(n)| O(1)|❤️|48.7%|
+|0143|Reorder List|[Go]({{< relref "/ChapterFour/0100~0199/0143.Reorder-List.md" >}})|Medium||||52.5%|
+|0148|Sort List|[Go]({{< relref "/ChapterFour/0100~0199/0148.Sort-List.md" >}})|Medium||||55.1%|
+|0151|Reverse Words in a String|[Go]({{< relref "/ChapterFour/0100~0199/0151.Reverse-Words-in-a-String.md" >}})|Medium||||32.7%|
+|0160|Intersection of Two Linked Lists|[Go]({{< relref "/ChapterFour/0100~0199/0160.Intersection-of-Two-Linked-Lists.md" >}})|Easy||||54.3%|
+|0167|Two Sum II - Input Array Is Sorted|[Go]({{< relref "/ChapterFour/0100~0199/0167.Two-Sum-II-Input-Array-Is-Sorted.md" >}})|Medium| O(n)| O(1)||60.0%|
+|0189|Rotate Array|[Go]({{< relref "/ChapterFour/0100~0199/0189.Rotate-Array.md" >}})|Medium||||39.4%|
+|0202|Happy Number|[Go]({{< relref "/ChapterFour/0200~0299/0202.Happy-Number.md" >}})|Easy||||54.8%|
+|0234|Palindrome Linked List|[Go]({{< relref "/ChapterFour/0200~0299/0234.Palindrome-Linked-List.md" >}})|Easy| O(n)| O(1)||50.2%|
+|0283|Move Zeroes|[Go]({{< relref "/ChapterFour/0200~0299/0283.Move-Zeroes.md" >}})|Easy| O(n)| O(1)||61.4%|
+|0287|Find the Duplicate Number|[Go]({{< relref "/ChapterFour/0200~0299/0287.Find-the-Duplicate-Number.md" >}})|Medium| O(n)| O(1)|❤️|59.1%|
+|0344|Reverse String|[Go]({{< relref "/ChapterFour/0300~0399/0344.Reverse-String.md" >}})|Easy| O(n)| O(1)||76.7%|
+|0345|Reverse Vowels of a String|[Go]({{< relref "/ChapterFour/0300~0399/0345.Reverse-Vowels-of-a-String.md" >}})|Easy| O(n)| O(1)||50.1%|
+|0349|Intersection of Two Arrays|[Go]({{< relref "/ChapterFour/0300~0399/0349.Intersection-of-Two-Arrays.md" >}})|Easy| O(n)| O(n) ||70.9%|
+|0350|Intersection of Two Arrays II|[Go]({{< relref "/ChapterFour/0300~0399/0350.Intersection-of-Two-Arrays-II.md" >}})|Easy| O(n)| O(n) ||56.0%|
+|0392|Is Subsequence|[Go]({{< relref "/ChapterFour/0300~0399/0392.Is-Subsequence.md" >}})|Easy||||47.6%|
+|0455|Assign Cookies|[Go]({{< relref "/ChapterFour/0400~0499/0455.Assign-Cookies.md" >}})|Easy||||49.9%|
+|0457|Circular Array Loop|[Go]({{< relref "/ChapterFour/0400~0499/0457.Circular-Array-Loop.md" >}})|Medium||||32.6%|
+|0475|Heaters|[Go]({{< relref "/ChapterFour/0400~0499/0475.Heaters.md" >}})|Medium||||36.5%|
+|0524|Longest Word in Dictionary through Deleting|[Go]({{< relref "/ChapterFour/0500~0599/0524.Longest-Word-in-Dictionary-through-Deleting.md" >}})|Medium| O(n)| O(1) ||51.0%|
+|0532|K-diff Pairs in an Array|[Go]({{< relref "/ChapterFour/0500~0599/0532.K-diff-Pairs-in-an-Array.md" >}})|Medium| O(n)| O(n)||41.2%|
+|0541|Reverse String II|[Go]({{< relref "/ChapterFour/0500~0599/0541.Reverse-String-II.md" >}})|Easy||||50.5%|
+|0557|Reverse Words in a String III|[Go]({{< relref "/ChapterFour/0500~0599/0557.Reverse-Words-in-a-String-III.md" >}})|Easy||||81.9%|
+|0567|Permutation in String|[Go]({{< relref "/ChapterFour/0500~0599/0567.Permutation-in-String.md" >}})|Medium| O(n)| O(1)|❤️|44.3%|
+|0581|Shortest Unsorted Continuous Subarray|[Go]({{< relref "/ChapterFour/0500~0599/0581.Shortest-Unsorted-Continuous-Subarray.md" >}})|Medium||||36.4%|
+|0611|Valid Triangle Number|[Go]({{< relref "/ChapterFour/0600~0699/0611.Valid-Triangle-Number.md" >}})|Medium||||50.5%|
+|0633|Sum of Square Numbers|[Go]({{< relref "/ChapterFour/0600~0699/0633.Sum-of-Square-Numbers.md" >}})|Medium||||34.4%|
+|0653|Two Sum IV - Input is a BST|[Go]({{< relref "/ChapterFour/0600~0699/0653.Two-Sum-IV-Input-is-a-BST.md" >}})|Easy||||61.0%|
+|0658|Find K Closest Elements|[Go]({{< relref "/ChapterFour/0600~0699/0658.Find-K-Closest-Elements.md" >}})|Medium||||46.8%|
+|0696|Count Binary Substrings|[Go]({{< relref "/ChapterFour/0600~0699/0696.Count-Binary-Substrings.md" >}})|Easy||||65.5%|
+|0719|Find K-th Smallest Pair Distance|[Go]({{< relref "/ChapterFour/0700~0799/0719.Find-K-th-Smallest-Pair-Distance.md" >}})|Hard||||36.7%|
+|0763|Partition Labels|[Go]({{< relref "/ChapterFour/0700~0799/0763.Partition-Labels.md" >}})|Medium| O(n)| O(1)|❤️|79.7%|
+|0795|Number of Subarrays with Bounded Maximum|[Go]({{< relref "/ChapterFour/0700~0799/0795.Number-of-Subarrays-with-Bounded-Maximum.md" >}})|Medium||||52.8%|
+|0821|Shortest Distance to a Character|[Go]({{< relref "/ChapterFour/0800~0899/0821.Shortest-Distance-to-a-Character.md" >}})|Easy||||71.3%|
+|0825|Friends Of Appropriate Ages|[Go]({{< relref "/ChapterFour/0800~0899/0825.Friends-Of-Appropriate-Ages.md" >}})|Medium||||46.3%|
+|0826|Most Profit Assigning Work|[Go]({{< relref "/ChapterFour/0800~0899/0826.Most-Profit-Assigning-Work.md" >}})|Medium| O(n log n)| O(n)||44.9%|
+|0832|Flipping an Image|[Go]({{< relref "/ChapterFour/0800~0899/0832.Flipping-an-Image.md" >}})|Easy||||80.8%|
+|0838|Push Dominoes|[Go]({{< relref "/ChapterFour/0800~0899/0838.Push-Dominoes.md" >}})|Medium| O(n)| O(n)||57.0%|
+|0844|Backspace String Compare|[Go]({{< relref "/ChapterFour/0800~0899/0844.Backspace-String-Compare.md" >}})|Easy| O(n)| O(n) ||48.1%|
+|0845|Longest Mountain in Array|[Go]({{< relref "/ChapterFour/0800~0899/0845.Longest-Mountain-in-Array.md" >}})|Medium| O(n)| O(1) ||40.2%|
+|0870|Advantage Shuffle|[Go]({{< relref "/ChapterFour/0800~0899/0870.Advantage-Shuffle.md" >}})|Medium||||51.8%|
+|0876|Middle of the Linked List|[Go]({{< relref "/ChapterFour/0800~0899/0876.Middle-of-the-Linked-List.md" >}})|Easy||||75.6%|
+|0881|Boats to Save People|[Go]({{< relref "/ChapterFour/0800~0899/0881.Boats-to-Save-People.md" >}})|Medium| O(n log n)| O(1) ||53.1%|
+|0922|Sort Array By Parity II|[Go]({{< relref "/ChapterFour/0900~0999/0922.Sort-Array-By-Parity-II.md" >}})|Easy||||70.7%|
+|0923|3Sum With Multiplicity|[Go]({{< relref "/ChapterFour/0900~0999/0923.3Sum-With-Multiplicity.md" >}})|Medium| O(n^2)| O(n) ||45.3%|
+|0925|Long Pressed Name|[Go]({{< relref "/ChapterFour/0900~0999/0925.Long-Pressed-Name.md" >}})|Easy| O(n)| O(1)||33.1%|
+|0942|DI String Match|[Go]({{< relref "/ChapterFour/0900~0999/0942.DI-String-Match.md" >}})|Easy||||77.3%|
+|0969|Pancake Sorting|[Go]({{< relref "/ChapterFour/0900~0999/0969.Pancake-Sorting.md" >}})|Medium||||70.1%|
+|0977|Squares of a Sorted Array|[Go]({{< relref "/ChapterFour/0900~0999/0977.Squares-of-a-Sorted-Array.md" >}})|Easy| O(n)| O(1)||71.9%|
+|0986|Interval List Intersections|[Go]({{< relref "/ChapterFour/0900~0999/0986.Interval-List-Intersections.md" >}})|Medium| O(n)| O(1)||71.3%|
+|1040|Moving Stones Until Consecutive II|[Go]({{< relref "/ChapterFour/1000~1099/1040.Moving-Stones-Until-Consecutive-II.md" >}})|Medium||||55.9%|
+|1048|Longest String Chain|[Go]({{< relref "/ChapterFour/1000~1099/1048.Longest-String-Chain.md" >}})|Medium||||59.2%|
+|1089|Duplicate Zeros|[Go]({{< relref "/ChapterFour/1000~1099/1089.Duplicate-Zeros.md" >}})|Easy||||51.5%|
+|1332|Remove Palindromic Subsequences|[Go]({{< relref "/ChapterFour/1300~1399/1332.Remove-Palindromic-Subsequences.md" >}})|Easy||||76.2%|
+|1385|Find the Distance Value Between Two Arrays|[Go]({{< relref "/ChapterFour/1300~1399/1385.Find-the-Distance-Value-Between-Two-Arrays.md" >}})|Easy||||66.5%|
+|1679|Max Number of K-Sum Pairs|[Go]({{< relref "/ChapterFour/1600~1699/1679.Max-Number-of-K-Sum-Pairs.md" >}})|Medium||||57.3%|
+|1721|Swapping Nodes in a Linked List|[Go]({{< relref "/ChapterFour/1700~1799/1721.Swapping-Nodes-in-a-Linked-List.md" >}})|Medium||||67.2%|
+|1877|Minimize Maximum Pair Sum in Array|[Go]({{< relref "/ChapterFour/1800~1899/1877.Minimize-Maximum-Pair-Sum-in-Array.md" >}})|Medium||||79.9%|
+|------------|-------------------------------------------------------|-------| ----------------| ---------------|-------------|-------------|-------------|
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterTwo/String/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterTwo/Linked_List/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterTwo/Union_Find.md b/website/content/ChapterTwo/Union_Find.md
index 79b693d5f..391edabe5 100644
--- a/website/content/ChapterTwo/Union_Find.md
+++ b/website/content/ChapterTwo/Union_Find.md
@@ -1,6 +1,7 @@
---
-title: Union Find
+title: 2.16 ✅ Union Find
type: docs
+weight: 16
---
# Union Find
@@ -15,24 +16,40 @@ type: docs
- 能用并查集的题目，一般也可以用 DFS 和 BFS 解答，只不过时间复杂度会高一点。
-| Title | Solution | Difficulty | Time | Space | 收藏 |
-| ----- | :--------: | :----------: | :----: | :-----: |:-----: |
-|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. Friend Circles | [Go]({{< relref "/ChapterFour/0547.Friend-Circles.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
+
+| No. | Title | Solution | Difficulty | TimeComplexity | SpaceComplexity |Favorite| Acceptance |
+|:--------:|:------- | :--------: | :----------: | :----: | :-----: | :-----: |:-----: |
+|0128|Longest Consecutive Sequence|[Go]({{< relref "/ChapterFour/0100~0199/0128.Longest-Consecutive-Sequence.md" >}})|Medium| O(n)| O(n)|❤️|48.5%|
+|0130|Surrounded Regions|[Go]({{< relref "/ChapterFour/0100~0199/0130.Surrounded-Regions.md" >}})|Medium| O(m\*n)| O(m\*n)||36.7%|
+|0200|Number of Islands|[Go]({{< relref "/ChapterFour/0200~0299/0200.Number-of-Islands.md" >}})|Medium| O(m\*n)| O(m\*n)||57.0%|
+|0399|Evaluate Division|[Go]({{< relref "/ChapterFour/0300~0399/0399.Evaluate-Division.md" >}})|Medium| O(n)| O(n)||59.6%|
+|0547|Number of Provinces|[Go]({{< relref "/ChapterFour/0500~0599/0547.Number-of-Provinces.md" >}})|Medium| O(n^2)| O(n)||63.7%|
+|0684|Redundant Connection|[Go]({{< relref "/ChapterFour/0600~0699/0684.Redundant-Connection.md" >}})|Medium| O(n)| O(n)||62.2%|
+|0685|Redundant Connection II|[Go]({{< relref "/ChapterFour/0600~0699/0685.Redundant-Connection-II.md" >}})|Hard| O(n)| O(n)||34.1%|
+|0695|Max Area of Island|[Go]({{< relref "/ChapterFour/0600~0699/0695.Max-Area-of-Island.md" >}})|Medium||||71.8%|
+|0721|Accounts Merge|[Go]({{< relref "/ChapterFour/0700~0799/0721.Accounts-Merge.md" >}})|Medium| O(n)| O(n)|❤️|56.3%|
+|0765|Couples Holding Hands|[Go]({{< relref "/ChapterFour/0700~0799/0765.Couples-Holding-Hands.md" >}})|Hard| O(n)| O(n)|❤️|56.6%|
+|0778|Swim in Rising Water|[Go]({{< relref "/ChapterFour/0700~0799/0778.Swim-in-Rising-Water.md" >}})|Hard| O(n^2)| O(n)|❤️|59.8%|
+|0785|Is Graph Bipartite?|[Go]({{< relref "/ChapterFour/0700~0799/0785.Is-Graph-Bipartite.md" >}})|Medium||||53.1%|
+|0803|Bricks Falling When Hit|[Go]({{< relref "/ChapterFour/0800~0899/0803.Bricks-Falling-When-Hit.md" >}})|Hard| O(n^2)| O(n)|❤️|34.4%|
+|0839|Similar String Groups|[Go]({{< relref "/ChapterFour/0800~0899/0839.Similar-String-Groups.md" >}})|Hard| O(n^2)| O(n)||48.0%|
+|0924|Minimize Malware Spread|[Go]({{< relref "/ChapterFour/0900~0999/0924.Minimize-Malware-Spread.md" >}})|Hard| O(m\*n)| O(n)||42.1%|
+|0928|Minimize Malware Spread II|[Go]({{< relref "/ChapterFour/0900~0999/0928.Minimize-Malware-Spread-II.md" >}})|Hard| O(m\*n)| O(n)|❤️|42.7%|
+|0947|Most Stones Removed with Same Row or Column|[Go]({{< relref "/ChapterFour/0900~0999/0947.Most-Stones-Removed-with-Same-Row-or-Column.md" >}})|Medium| O(n)| O(n)||58.9%|
+|0952|Largest Component Size by Common Factor|[Go]({{< relref "/ChapterFour/0900~0999/0952.Largest-Component-Size-by-Common-Factor.md" >}})|Hard| O(n)| O(n)|❤️|40.0%|
+|0959|Regions Cut By Slashes|[Go]({{< relref "/ChapterFour/0900~0999/0959.Regions-Cut-By-Slashes.md" >}})|Medium| O(n^2)| O(n^2)|❤️|69.1%|
+|0990|Satisfiability of Equality Equations|[Go]({{< relref "/ChapterFour/0900~0999/0990.Satisfiability-of-Equality-Equations.md" >}})|Medium| O(n)| O(n)||50.5%|
+|1020|Number of Enclaves|[Go]({{< relref "/ChapterFour/1000~1099/1020.Number-of-Enclaves.md" >}})|Medium||||65.5%|
+|1202|Smallest String With Swaps|[Go]({{< relref "/ChapterFour/1200~1299/1202.Smallest-String-With-Swaps.md" >}})|Medium||||57.7%|
+|1254|Number of Closed Islands|[Go]({{< relref "/ChapterFour/1200~1299/1254.Number-of-Closed-Islands.md" >}})|Medium||||64.1%|
+|1319|Number of Operations to Make Network Connected|[Go]({{< relref "/ChapterFour/1300~1399/1319.Number-of-Operations-to-Make-Network-Connected.md" >}})|Medium||||62.1%|
+|1579|Remove Max Number of Edges to Keep Graph Fully Traversable|[Go]({{< relref "/ChapterFour/1500~1599/1579.Remove-Max-Number-of-Edges-to-Keep-Graph-Fully-Traversable.md" >}})|Hard||||53.2%|
+|1631|Path With Minimum Effort|[Go]({{< relref "/ChapterFour/1600~1699/1631.Path-With-Minimum-Effort.md" >}})|Medium||||55.7%|
+|------------|-------------------------------------------------------|-------| ----------------| ---------------|-------------|-------------|-------------|
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterTwo/Bit_Manipulation/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterTwo/Sliding_Window/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterTwo/_index.md b/website/content/ChapterTwo/_index.md
index c28b73c5b..6aa84542e 100644
--- a/website/content/ChapterTwo/_index.md
+++ b/website/content/ChapterTwo/_index.md
@@ -1,6 +1,7 @@
---
-title: 第二章
+title: 第二章 算法专题
type: docs
+weight: 2
---
# 第二章 算法专题
@@ -19,3 +20,10 @@ type: docs
做到目前为止，笔者认为动态规划是最灵活的类型，这类题目没有一个模板可以给你套用，它也是算法之优雅的地方。笔者认为称它为算法的艺术不为过。动态规划这类型，笔者也还没有刷完，只刷了一部分，还在学习中。
那么就分享一下笔者目前刷过的题，和有相似点的题目吧。
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterOne/Time_Complexity/">⬅️上一章</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterTwo/Array/">下一页➡️</a></p>
+</div>
diff --git a/website/content/_index.md b/website/content/_index.md
index e9a44e0b5..50500e868 100644
--- a/website/content/_index.md
+++ b/website/content/_index.md
@@ -34,7 +34,7 @@ type: docs
## 关于作者
-笔者是一个刚刚入行一年半的 gopher 新人，还请各位大佬多多指点小弟我。大学参加了 3 年 ACM-ICPC，但是由于资质不高，没有拿到一块金牌。所以在算法方面，我对自己的评价算是新手吧。参加 ACM-ICPC 最大的收获是训练了思维能力，这种能力也会运用到生活中。其次是认识了很多国内很聪明的选手，看到了自己和他们的差距。最后，就是那 200 多页，有些自己都没有完全理解的，打印的密密麻麻的[算法模板](https://github.com/halfrost/LeetCode-Go/releases/tag/Special)。知识学会了，终身都是自己的，没有学会，那些知识都是身外之物。
+笔者是一个刚刚入行一年半的 gopher 新人，还请各位大佬多多指点小弟我。大学参加了 3 年 ACM-ICPC，但是由于资质不高，没有拿到一块金牌。所以在算法方面，我对自己的评价算是新手吧。参加 ACM-ICPC 最大的收获是训练了思维能力，这种能力也会运用到生活中。其次是认识了很多国内很聪明的选手，看到了自己和他们的差距。最后，就是那 200 多页，有些自己都没有完全理解的，打印的密密麻麻的[算法模板](https://github.com/halfrost/leetcode-go/releases/tag/Special)。知识学会了，终身都是自己的，没有学会，那些知识都是身外之物。
笔者从 2019 年 3 月 25 号开始刷题，到 2020 年 3 月 25 号，整整一年的时间。原计划是每天一题。实际上每天有时候不止一题，最终完成了 600+：
@@ -48,7 +48,7 @@ type: docs
## 关于书中的代码
-代码都放在 [github repo](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode) 中，按题号可以搜索到题目。
+代码都放在 [github repo](https://github.com/halfrost/leetcode-go/tree/master/leetcode) 中，按题号可以搜索到题目。
本书题目的代码都已经 beats 100% 了。没有 beats 100% 题解就没有放到本书中了。那些题目笔者会继续优化到 100% 再放进来。
有可能读者会问，为何要追求 beats 100%。笔者认为优化到 beats 100% 才算是把这题做出感觉了。有好几道 Hard 题，笔者都用暴力解法 AC 了，然后只 beats 了 5%。这题就如同没做一样。而且面试中如果给了这样的答案，面试官也不会满意，“还有没有更优解？”。如果通过自己的思考能给出更优解，面试官会更满意一些。
diff --git a/website/content/docs/example/_index.md b/website/content/docs/example/_index.md
deleted file mode 100644
index 4835b7ca0..000000000
--- a/website/content/docs/example/_index.md
+++ /dev/null
@@ -1,71 +0,0 @@
----
-weight: 1
-bookFlatSection: true
-title: "Example Site"
----
-
-# Introduction
-
-## Ferre hinnitibus erat accipitrem dixi Troiae tollens
-
-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](http://pastor-ad.io/questussilvas) quascumque nescio
-solebat [litore](http://lacrimas-ab.net/); noctes. *Hostem haerentem* circuit
-[plenaque tamen](http://www.sine.io/in).
-
-- Pedum ne indigenae finire invergens carpebat
-- Velit posses summoque
-- De fumos illa foret
-
-## Est simul fameque tauri qua ad
-
-Locum nullus nisi vomentes. Ab Persea sermone vela, miratur aratro; eandem
-Argolicas gener.
-
-## Me sol
-
-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](http://www.late.net/alimentavirides) 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;
-
-## Trepident sitimque
-
-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.
diff --git a/website/content/docs/example/collapsed/3rd-level/4th-level.md b/website/content/docs/example/collapsed/3rd-level/4th-level.md
deleted file mode 100644
index aa451f19e..000000000
--- a/website/content/docs/example/collapsed/3rd-level/4th-level.md
+++ /dev/null
@@ -1,12 +0,0 @@
-# 4th Level of Menu
-
-## Caesorum illa tu sentit micat vestes papyriferi
-
-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](http://www.creveratnon.net/apricaaetheriis), Assyrii. Cupiens auctoribus
-pariter rubet, profana magni super nocens. Vos ius sibilat inpar turba visae
-iusto! Sedes ante dum superest **extrema**.
diff --git a/website/content/docs/example/collapsed/3rd-level/_index.md b/website/content/docs/example/collapsed/3rd-level/_index.md
deleted file mode 100644
index cc0100f3c..000000000
--- a/website/content/docs/example/collapsed/3rd-level/_index.md
+++ /dev/null
@@ -1,26 +0,0 @@
-# 3rd Level of Menu
-
-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);
diff --git a/website/content/docs/example/collapsed/_index.md b/website/content/docs/example/collapsed/_index.md
deleted file mode 100644
index 806bc2efa..000000000
--- a/website/content/docs/example/collapsed/_index.md
+++ /dev/null
@@ -1,23 +0,0 @@
----
-bookCollapseSection: true
-weight: 20
----
-
-# Collapsed Level of Menu
-
-## Cognita laeva illo fracta
-
-Lorem markdownum pavent auras, surgit nunc cingentibus libet **Laomedonque que**
-est. Pastor [An](http://est.org/ire.aspx) arbor filia foedat, ne [fugit
-aliter](http://www.indiciumturbam.org/moramquid.php), per. Helicona illas et
-callida neptem est *Oresitrophos* caput, dentibus est venit. Tenet reddite
-[famuli](http://www.antro-et.net/) praesentem fortibus, quaeque vis foret si
-frondes *gelidos* gravidae circumtulit [inpulit armenta
-nativum](http://incurvasustulit.io/illi-virtute.html).
-
-1. Te at cruciabere vides rubentis manebo
-2. Maturuit in praetemptat ruborem ignara postquam habitasse
-3. Subitarum supplevit quoque fontesque venabula spretis modo
-4. Montis tot est mali quasque gravis
-5. Quinquennem domus arsit ipse
-6. Pellem turis pugnabant locavit
diff --git a/website/content/docs/example/hidden.md b/website/content/docs/example/hidden.md
deleted file mode 100644
index df7cb9ebb..000000000
--- a/website/content/docs/example/hidden.md
+++ /dev/null
@@ -1,52 +0,0 @@
----
-bookHidden: true
----
-
-# This page is hidden in menu
-
-# Quondam non pater est dignior ille Eurotas
-
-## Latent te facies
-
-Lorem markdownum arma ignoscas vocavit quoque ille texit mandata mentis ultimus,
-frementes, qui in vel. Hippotades Peleus [pennas
-conscia](http://gratia.net/tot-qua.php) cuiquam Caeneus quas.
-
-- Pater demittere evincitque reddunt
-- Maxime adhuc pressit huc Danaas quid freta
-- Soror ego
-- Luctus linguam saxa ultroque prior Tatiumque inquit
-- Saepe liquitur subita superata dederat Anius sudor
-
-## Cum honorum Latona
-
-O fallor [in sustinui
-iussorum](http://www.spectataharundine.org/aquas-relinquit.html) 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);
- }
-
-## Fronde cetera dextrae sequens pennis voce muneris
-
-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));
\ No newline at end of file
diff --git a/website/content/docs/example/table-of-contents/_index.md b/website/content/docs/example/table-of-contents/_index.md
deleted file mode 100644
index c7ee0d872..000000000
--- a/website/content/docs/example/table-of-contents/_index.md
+++ /dev/null
@@ -1,85 +0,0 @@
----
-weight: 10
----
-
-# Ubi loqui
-
-## Mentem genus facietque salire tempus bracchia
-
-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.
-
-## Rapit vocant si hunc siste adspice
-
-Ora precari Patraeque Neptunia, dixit Danae [Cithaeron
-armaque](http://mersis-an.org/litoristum) 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](http://tutum.io/me) sine ferrea iuncta quam!
-
-## Locus fuit caecis
-
-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);
-
-## Placabilis coactis nega ingemuit ignoscat nimia non
-
-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;
- }
-
-## Caesorum illa tu sentit micat vestes papyriferi
-
-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](http://www.creveratnon.net/apricaaetheriis), Assyrii. Cupiens auctoribus
-pariter rubet, profana magni super nocens. Vos ius sibilat inpar turba visae
-iusto! Sedes ante dum superest **extrema**.
diff --git a/website/content/docs/example/table-of-contents/with-toc.md b/website/content/docs/example/table-of-contents/with-toc.md
deleted file mode 100644
index 5345c668a..000000000
--- a/website/content/docs/example/table-of-contents/with-toc.md
+++ /dev/null
@@ -1,64 +0,0 @@
----
-title: With ToC
-weight: 1
----
-# Caput vino delphine in tamen vias
-
-## Cognita laeva illo fracta
-
-Lorem markdownum pavent auras, surgit nunc cingentibus libet **Laomedonque que**
-est. Pastor [An](http://est.org/ire.aspx) arbor filia foedat, ne [fugit
-aliter](http://www.indiciumturbam.org/moramquid.php), per. Helicona illas et
-callida neptem est *Oresitrophos* caput, dentibus est venit. Tenet reddite
-[famuli](http://www.antro-et.net/) praesentem fortibus, quaeque vis foret si
-frondes *gelidos* gravidae circumtulit [inpulit armenta
-nativum](http://incurvasustulit.io/illi-virtute.html).
-
-1. Te at cruciabere vides rubentis manebo
-2. Maturuit in praetemptat ruborem ignara postquam habitasse
-3. Subitarum supplevit quoque fontesque venabula spretis modo
-4. Montis tot est mali quasque gravis
-5. Quinquennem domus arsit ipse
-6. Pellem turis pugnabant locavit
-
-## Natus quaerere
-
-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](http://iuvat.org/eundem.php) fama vergit summaque meus clarissimus
-> artesque tinguebat successor nominis cervice caelicolae.
-
-## Limitibus misere sit
-
-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](http://www.amnem.io/pervenit.aspx) ubera. Coercet gelidumque manus,
-doluit volvitur induta?
-
-## Enim sua
-
-Iuvenilior filia inlustre templa quidem herbis permittat trahens huic. In
-cruribus proceres sole crescitque *fata*, quos quos; merui maris se non tamen
-in, mea.
-
-## Germana aves pignus tecta
-
-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!
diff --git a/website/content/docs/example/table-of-contents/without-toc.md b/website/content/docs/example/table-of-contents/without-toc.md
deleted file mode 100644
index 9b1631883..000000000
--- a/website/content/docs/example/table-of-contents/without-toc.md
+++ /dev/null
@@ -1,59 +0,0 @@
----
-title: Without ToC
-weight: 2
-bookToc: false
----
-
-# At me ipso nepotibus nunc celebratior genus
-
-## Tanto oblite
-
-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.
-
-## Summe promissa supple vadit lenius
-
-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.
-
-1. Remansit notam Stygia feroxque
-2. Et dabit materna
-3. Vipereas Phrygiaeque umbram sollicito cruore conlucere suus
-4. Quarum Elis corniger
-5. Nec ieiunia dixit
-
-Vertitur mos ortu ramosam contudit dumque; placabat ac lumen. Coniunx Amoris
-spatium poenamque cavernis Thebae Pleiadasque ponunt, rapiare cum quae parum
-nimium rima.
-
-## Quidem resupinus inducto solebat una facinus quae
-
-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.
-
-1. Baculum mandataque ne addere capiti violentior
-2. Altera duas quam hoc ille tenues inquit
-3. Sicula sidereus latrantis domoque ratae polluit comites
-4. Possit oro clausura namque se nunc iuvenisque
-5. Faciem posuit
-6. Quodque cum ponunt novercae nata vestrae aratra
-
-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](http://mihiferre.net/iuvenes-peto.html). Per lupi pars foliis,
-porreximus humum negant sunt subposuere Sidone steterant auro. Memoraverit sine:
-ferrum idem Orion caelum heres gerebat fixis?
diff --git a/website/content/docs/shortcodes/_index.md b/website/content/docs/shortcodes/_index.md
deleted file mode 100644
index 9bb0430cb..000000000
--- a/website/content/docs/shortcodes/_index.md
+++ /dev/null
@@ -1,3 +0,0 @@
----
-bookFlatSection: true
----
diff --git a/website/content/docs/shortcodes/buttons.md b/website/content/docs/shortcodes/buttons.md
deleted file mode 100644
index c2ef1e755..000000000
--- a/website/content/docs/shortcodes/buttons.md
+++ /dev/null
@@ -1,13 +0,0 @@
-# Buttons
-
-Buttons are styled links that can lead to local page or external link.
-
-## Example
-
-```tpl
-{{</* button relref="/" [class="..."] */>}}Get Home{{</* /button */>}}
-{{</* button href="https://github.com/alex-shpak/hugo-book" */>}}Contribute{{</* /button */>}}
-```
-
-{{< button relref="/" >}}Get Home{{< /button >}}
-{{< button href="https://github.com/alex-shpak/hugo-book" >}}Contribute{{< /button >}}
diff --git a/website/content/docs/shortcodes/columns.md b/website/content/docs/shortcodes/columns.md
deleted file mode 100644
index 4df396a67..000000000
--- a/website/content/docs/shortcodes/columns.md
+++ /dev/null
@@ -1,45 +0,0 @@
-# Columns
-
-Columns help organize shorter pieces of content horizontally for readability.
-
-
-```html
-{{</* 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 */>}}
-```
-
-## Example
-
-{{< columns >}}
-## Left 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.
-
-<--->
-
-## Mid Content
-Lorem markdownum insigne. Olympo signis Delphis! Retexi Nereius nova develat
-stringit, frustra Saturnius uteroque inter!
-
-<--->
-
-## Right 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.
-{{< /columns >}}
diff --git a/website/content/docs/shortcodes/details.md b/website/content/docs/shortcodes/details.md
deleted file mode 100644
index 248bafd97..000000000
--- a/website/content/docs/shortcodes/details.md
+++ /dev/null
@@ -1,22 +0,0 @@
-# Details
-
-Details shortcode is a helper for `details` html5 element. It is going to replace `expand` shortcode.
-
-## Example
-```tpl
-{{</* details "Title" [open] */>}}
-## Markdown content
-Lorem markdownum insigne...
-{{</* /details */>}}
-```
-```tpl
-{{</* details title="Title" open=true */>}}
-## Markdown content
-Lorem markdownum insigne...
-{{</* /details */>}}
-```
-
-{{< details "Title" open >}}
-## Markdown content
-Lorem markdownum insigne...
-{{< /details >}}
diff --git a/website/content/docs/shortcodes/expand.md b/website/content/docs/shortcodes/expand.md
deleted file mode 100644
index c62520f3f..000000000
--- a/website/content/docs/shortcodes/expand.md
+++ /dev/null
@@ -1,35 +0,0 @@
-# Expand
-
-Expand shortcode can help to decrease clutter on screen by hiding part of text. Expand content by clicking on it.
-
-## Example
-### Default
-
-```tpl
-{{</* expand */>}}
-## Markdown content
-Lorem markdownum insigne...
-{{</* /expand */>}}
-```
-
-{{< expand >}}
-## Markdown content
-Lorem markdownum insigne...
-{{< /expand >}}
-
-### With Custom Label
-
-```tpl
-{{</* expand "Custom Label" "..." */>}}
-## Markdown content
-Lorem markdownum insigne...
-{{</* /expand */>}}
-```
-
-{{< expand "Custom Label" "..." >}}
-## Markdown 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.
-{{< /expand >}}
diff --git a/website/content/docs/shortcodes/hints.md b/website/content/docs/shortcodes/hints.md
deleted file mode 100644
index 3477113de..000000000
--- a/website/content/docs/shortcodes/hints.md
+++ /dev/null
@@ -1,32 +0,0 @@
-# Hints
-
-Hint shortcode can be used as hint/alerts/notification block.
-There are 3 colors to choose: `info`, `warning` and `danger`.
-
-```tpl
-{{</* 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 */>}}
-```
-
-## Example
-
-{{< hint info >}}
-**Markdown content**
-Lorem markdownum insigne. Olympo signis Delphis! Retexi Nereius nova develat
-stringit, frustra Saturnius uteroque inter! Oculis non ritibus Telethusa
-{{< /hint >}}
-
-{{< hint warning >}}
-**Markdown content**
-Lorem markdownum insigne. Olympo signis Delphis! Retexi Nereius nova develat
-stringit, frustra Saturnius uteroque inter! Oculis non ritibus Telethusa
-{{< /hint >}}
-
-{{< hint danger >}}
-**Markdown content**
-Lorem markdownum insigne. Olympo signis Delphis! Retexi Nereius nova develat
-stringit, frustra Saturnius uteroque inter! Oculis non ritibus Telethusa
-{{< /hint >}}
diff --git a/website/content/docs/shortcodes/katex.md b/website/content/docs/shortcodes/katex.md
deleted file mode 100644
index 4beeaa004..000000000
--- a/website/content/docs/shortcodes/katex.md
+++ /dev/null
@@ -1,28 +0,0 @@
-# KaTeX
-
-KaTeX shortcode let you render math typesetting in markdown document. See [KaTeX](https://katex.org/)
-
-## Example
-{{< columns >}}
-
-```latex
-{{</* katex [display] [class="text-center"] */>}}
-f(x) = \int_{-\infty}^\infty\hat f(\xi)\,e^{2 \pi i \xi x}\,d\xi
-{{</* /katex */>}}
-```
-
-<--->
-
-{{< katex display >}}
-f(x) = \int_{-\infty}^\infty\hat f(\xi)\,e^{2 \pi i \xi x}\,d\xi
-{{< /katex >}}
-
-{{< /columns >}}
-
-## Display Mode Example
-
-Here is some inline example: {{< katex >}}\pi(x){{< /katex >}}, rendered in the same line. And below is `display` example, having `display: block`
-{{< katex display >}}
-f(x) = \int_{-\infty}^\infty\hat f(\xi)\,e^{2 \pi i \xi x}\,d\xi
-{{< /katex >}}
-Text continues here.
diff --git a/website/content/docs/shortcodes/mermaid.md b/website/content/docs/shortcodes/mermaid.md
deleted file mode 100644
index 3a617bcc0..000000000
--- a/website/content/docs/shortcodes/mermaid.md
+++ /dev/null
@@ -1,38 +0,0 @@
-# Mermaid Chart
-
-[Mermaid](https://mermaidjs.github.io/) is library for generating svg charts and diagrams from text.
-
-## Example
-
-{{< columns >}}
-```tpl
-{{</* 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 */>}}
-```
-
-<--->
-
-{{< 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
-{{< /mermaid >}}
-
-{{< /columns >}}
diff --git a/website/content/docs/shortcodes/section/_index.md b/website/content/docs/shortcodes/section/_index.md
deleted file mode 100644
index bd5db38b3..000000000
--- a/website/content/docs/shortcodes/section/_index.md
+++ /dev/null
@@ -1,15 +0,0 @@
----
-bookCollapseSection: true
----
-
-# Section
-
-Section renders pages in section as definition list, using title and description.
-
-## Example
-
-```tpl
-{{</* section */>}}
-```
-
-{{<section>}}
diff --git a/website/content/docs/shortcodes/section/page1.md b/website/content/docs/shortcodes/section/page1.md
deleted file mode 100644
index 960800143..000000000
--- a/website/content/docs/shortcodes/section/page1.md
+++ /dev/null
@@ -1 +0,0 @@
-# Page 1
diff --git a/website/content/docs/shortcodes/section/page2.md b/website/content/docs/shortcodes/section/page2.md
deleted file mode 100644
index f310be332..000000000
--- a/website/content/docs/shortcodes/section/page2.md
+++ /dev/null
@@ -1 +0,0 @@
-# Page 2
diff --git a/website/content/docs/shortcodes/tabs.md b/website/content/docs/shortcodes/tabs.md
deleted file mode 100644
index 096892c67..000000000
--- a/website/content/docs/shortcodes/tabs.md
+++ /dev/null
@@ -1,50 +0,0 @@
-# Tabs
-
-Tabs let you organize content by context, for example installation instructions for each supported platform.
-
-```tpl
-{{</* tabs "uniqueid" */>}}
-{{</* tab "MacOS" */>}} # MacOS Content {{</* /tab */>}}
-{{</* tab "Linux" */>}} # Linux Content {{</* /tab */>}}
-{{</* tab "Windows" */>}} # Windows Content {{</* /tab */>}}
-{{</* /tabs */>}}
-```
-
-## Example
-
-{{< tabs "uniqueid" >}}
-{{< tab "MacOS" >}}
-# MacOS
-
-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.
-{{< /tab >}}
-
-{{< tab "Linux" >}}
-
-# Linux
-
-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.
-{{< /tab >}}
-
-{{< tab "Windows" >}}
-
-# Windows
-
-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.
-{{< /tab >}}
-{{< /tabs >}}
diff --git a/website/content/menu/index.md b/website/content/menu/index.md
deleted file mode 100644
index e9832e085..000000000
--- a/website/content/menu/index.md
+++ /dev/null
@@ -1,548 +0,0 @@
----
-headless: true
----
-
-<hr>
-
-- [第一章 序章]({{< relref "/ChapterOne/_index.md" >}})
- - [1.1 关于作者]({{< relref "/ChapterOne/#关于作者" >}})
- - [1.2 数据结构知识]({{< relref "/ChapterOne/Data_Structure.md" >}})
- - [1.3 算法知识]({{< relref "/ChapterOne/Algorithm.md" >}})
-- [第二章 算法专题]({{< relref "/ChapterTwo/_index.md" >}})
- - [2.01 Array]({{< relref "/ChapterTwo/Array.md" >}})
- - [2.02 String]({{< relref "/ChapterTwo/String.md" >}})
- - [2.03 ✅ Two Pointers]({{< relref "/ChapterTwo/Two_Pointers.md" >}})
- - [2.04 ✅ Linked List]({{< relref "/ChapterTwo/Linked_List.md" >}})
- - [2.05 ✅ Stack]({{< relref "/ChapterTwo/Stack.md" >}})
- - [2.06 Tree]({{< relref "/ChapterTwo/Tree.md" >}})
- - [2.07 Dynamic Programming]({{< relref "/ChapterTwo/Dynamic_Programming.md" >}})
- - [2.08 ✅ Backtracking]({{< relref "/ChapterTwo/Backtracking.md" >}})
- - [2.09 Depth First Search]({{< relref "/ChapterTwo/Depth_First_Search.md" >}})
- - [2.10 Breadth First Search]({{< relref "/ChapterTwo/Breadth_First_Search.md" >}})
- - [2.11 Binary Search]({{< relref "/ChapterTwo/Binary_Search.md" >}})
- - [2.12 Math]({{< relref "/ChapterTwo/Math.md" >}})
- - [2.13 Hash Table]({{< relref "/ChapterTwo/Hash_Table.md" >}})
- - [2.14 ✅ Sort]({{< relref "/ChapterTwo/Sort.md" >}})
- - [2.15 ✅ Bit Manipulation]({{< relref "/ChapterTwo/Bit_Manipulation.md" >}})
- - [2.16 ✅ Union Find]({{< relref "/ChapterTwo/Union_Find.md" >}})
- - [2.17 ✅ Sliding Window]({{< relref "/ChapterTwo/Sliding_Window.md" >}})
- - [2.18 ✅ Segment Tree]({{< relref "/ChapterTwo/Segment_Tree.md" >}})
- - [2.19 ✅ Binary Indexed Tree]({{< relref "/ChapterTwo/Binary_Indexed_Tree.md" >}})
-- [第三章 一些模板]({{< relref "/ChapterThree/_index.md" >}})
- - [3.1 Segment Tree]({{< relref "/ChapterThree/Segment_Tree.md" >}})
- - [3.2 UnionFind]({{< relref "/ChapterThree/UnionFind.md" >}})
-- [第四章 Leetcode 题解]({{< relref "/ChapterFour/_index.md" >}})
- - [0001.Two-Sum]({{< relref "/ChapterFour/0001.Two-Sum.md" >}})
- - [0002.Add-Two-Numbers]({{< relref "/ChapterFour/0002.Add-Two-Numbers.md" >}})
- - [0003.Longest-Substring-Without-Repeating-Characters]({{< relref "/ChapterFour/0003.Longest-Substring-Without-Repeating-Characters.md" >}})
- - [0004.Median-of-Two-Sorted-Arrays]({{< relref "/ChapterFour/0004.Median-of-Two-Sorted-Arrays.md" >}})
- - [0007.Reverse-Integer]({{< relref "/ChapterFour/0007.Reverse-Integer.md" >}})
- - [0009.Palindrome-Number]({{< relref "/ChapterFour/0009.Palindrome-Number.md" >}})
- - [0011.Container-With-Most-Water]({{< relref "/ChapterFour/0011.Container-With-Most-Water.md" >}})
- - [0013.Roman-to-Integer]({{< relref "/ChapterFour/0013.Roman-to-Integer.md" >}})
- - [0015.3Sum]({{< relref "/ChapterFour/0015.3Sum.md" >}})
- - [0016.3Sum-Closest]({{< relref "/ChapterFour/0016.3Sum-Closest.md" >}})
- - [0017.Letter-Combinations-of-a-Phone-Number]({{< relref "/ChapterFour/0017.Letter-Combinations-of-a-Phone-Number.md" >}})
- - [0018.4Sum]({{< relref "/ChapterFour/0018.4Sum.md" >}})
- - [0019.Remove-Nth-Node-From-End-of-List]({{< relref "/ChapterFour/0019.Remove-Nth-Node-From-End-of-List.md" >}})
- - [0020.Valid-Parentheses]({{< relref "/ChapterFour/0020.Valid-Parentheses.md" >}})
- - [0021.Merge-Two-Sorted-Lists]({{< relref "/ChapterFour/0021.Merge-Two-Sorted-Lists.md" >}})
- - [0022.Generate-Parentheses]({{< relref "/ChapterFour/0022.Generate-Parentheses.md" >}})
- - [0023.Merge-k-Sorted-Lists]({{< relref "/ChapterFour/0023.Merge-k-Sorted-Lists.md" >}})
- - [0024.Swap-Nodes-in-Pairs]({{< relref "/ChapterFour/0024.Swap-Nodes-in-Pairs.md" >}})
- - [0025.Reverse-Nodes-in-k-Group]({{< relref "/ChapterFour/0025.Reverse-Nodes-in-k-Group.md" >}})
- - [0026.Remove-Duplicates-from-Sorted-Array]({{< relref "/ChapterFour/0026.Remove-Duplicates-from-Sorted-Array.md" >}})
- - [0027.Remove-Element]({{< relref "/ChapterFour/0027.Remove-Element.md" >}})
- - [0028.Implement-strStr]({{< relref "/ChapterFour/0028.Implement-strStr.md" >}})
- - [0029.Divide-Two-Integers]({{< relref "/ChapterFour/0029.Divide-Two-Integers.md" >}})
- - [0030.Substring-with-Concatenation-of-All-Words]({{< relref "/ChapterFour/0030.Substring-with-Concatenation-of-All-Words.md" >}})
- - [0033.Search-in-Rotated-Sorted-Array]({{< relref "/ChapterFour/0033.Search-in-Rotated-Sorted-Array.md" >}})
- - [0034.Find-First-and-Last-Position-of-Element-in-Sorted-Array]({{< relref "/ChapterFour/0034.Find-First-and-Last-Position-of-Element-in-Sorted-Array.md" >}})
- - [0035.Search-Insert-Position]({{< relref "/ChapterFour/0035.Search-Insert-Position.md" >}})
- - [0036.Valid-Sudoku]({{< relref "/ChapterFour/0036.Valid-Sudoku.md" >}})
- - [0037.Sudoku-Solver]({{< relref "/ChapterFour/0037.Sudoku-Solver.md" >}})
- - [0039.Combination-Sum]({{< relref "/ChapterFour/0039.Combination-Sum.md" >}})
- - [0040.Combination-Sum-II]({{< relref "/ChapterFour/0040.Combination-Sum-II.md" >}})
- - [0041.First-Missing-Positive]({{< relref "/ChapterFour/0041.First-Missing-Positive.md" >}})
- - [0042.Trapping-Rain-Water]({{< relref "/ChapterFour/0042.Trapping-Rain-Water.md" >}})
- - [0046.Permutations]({{< relref "/ChapterFour/0046.Permutations.md" >}})
- - [0047.Permutations-II]({{< relref "/ChapterFour/0047.Permutations-II.md" >}})
- - [0048.Rotate-Image]({{< relref "/ChapterFour/0048.Rotate-Image.md" >}})
- - [0049.Group-Anagrams]({{< relref "/ChapterFour/0049.Group-Anagrams.md" >}})
- - [0050.Powx-n]({{< relref "/ChapterFour/0050.Powx-n.md" >}})
- - [0051.N-Queens]({{< relref "/ChapterFour/0051.N-Queens.md" >}})
- - [0052.N-Queens-II]({{< relref "/ChapterFour/0052.N-Queens-II.md" >}})
- - [0053.Maximum-Subarray]({{< relref "/ChapterFour/0053.Maximum-Subarray.md" >}})
- - [0054.Spiral-Matrix]({{< relref "/ChapterFour/0054.Spiral-Matrix.md" >}})
- - [0055.Jump-Game]({{< relref "/ChapterFour/0055.Jump-Game.md" >}})
- - [0056.Merge-Intervals]({{< relref "/ChapterFour/0056.Merge-Intervals.md" >}})
- - [0057.Insert-Interval]({{< relref "/ChapterFour/0057.Insert-Interval.md" >}})
- - [0059.Spiral-Matrix-II]({{< relref "/ChapterFour/0059.Spiral-Matrix-II.md" >}})
- - [0060.Permutation-Sequence]({{< relref "/ChapterFour/0060.Permutation-Sequence.md" >}})
- - [0061.Rotate-List]({{< relref "/ChapterFour/0061.Rotate-List.md" >}})
- - [0062.Unique-Paths]({{< relref "/ChapterFour/0062.Unique-Paths.md" >}})
- - [0063.Unique-Paths-II]({{< relref "/ChapterFour/0063.Unique-Paths-II.md" >}})
- - [0064.Minimum-Path-Sum]({{< relref "/ChapterFour/0064.Minimum-Path-Sum.md" >}})
- - [0066.Plus-One]({{< relref "/ChapterFour/0066.Plus-One.md" >}})
- - [0067.Add-Binary]({{< relref "/ChapterFour/0067.Add-Binary.md" >}})
- - [0069.Sqrtx]({{< relref "/ChapterFour/0069.Sqrtx.md" >}})
- - [0070.Climbing-Stairs]({{< relref "/ChapterFour/0070.Climbing-Stairs.md" >}})
- - [0071.Simplify-Path]({{< relref "/ChapterFour/0071.Simplify-Path.md" >}})
- - [0074.Search-a-2D-Matrix]({{< relref "/ChapterFour/0074.Search-a-2D-Matrix.md" >}})
- - [0075.Sort-Colors]({{< relref "/ChapterFour/0075.Sort-Colors.md" >}})
- - [0076.Minimum-Window-Substring]({{< relref "/ChapterFour/0076.Minimum-Window-Substring.md" >}})
- - [0077.Combinations]({{< relref "/ChapterFour/0077.Combinations.md" >}})
- - [0078.Subsets]({{< relref "/ChapterFour/0078.Subsets.md" >}})
- - [0079.Word-Search]({{< relref "/ChapterFour/0079.Word-Search.md" >}})
- - [0080.Remove-Duplicates-from-Sorted-Array-II]({{< relref "/ChapterFour/0080.Remove-Duplicates-from-Sorted-Array-II.md" >}})
- - [0081.Search-in-Rotated-Sorted-Array-II]({{< relref "/ChapterFour/0081.Search-in-Rotated-Sorted-Array-II.md" >}})
- - [0082.Remove-Duplicates-from-Sorted-List-II]({{< relref "/ChapterFour/0082.Remove-Duplicates-from-Sorted-List-II.md" >}})
- - [0083.Remove-Duplicates-from-Sorted-List]({{< relref "/ChapterFour/0083.Remove-Duplicates-from-Sorted-List.md" >}})
- - [0084.Largest-Rectangle-in-Histogram]({{< relref "/ChapterFour/0084.Largest-Rectangle-in-Histogram.md" >}})
- - [0086.Partition-List]({{< relref "/ChapterFour/0086.Partition-List.md" >}})
- - [0088.Merge-Sorted-Array]({{< relref "/ChapterFour/0088.Merge-Sorted-Array.md" >}})
- - [0089.Gray-Code]({{< relref "/ChapterFour/0089.Gray-Code.md" >}})
- - [0090.Subsets-II]({{< relref "/ChapterFour/0090.Subsets-II.md" >}})
- - [0091.Decode-Ways]({{< relref "/ChapterFour/0091.Decode-Ways.md" >}})
- - [0092.Reverse-Linked-List-II]({{< relref "/ChapterFour/0092.Reverse-Linked-List-II.md" >}})
- - [0093.Restore-IP-Addresses]({{< relref "/ChapterFour/0093.Restore-IP-Addresses.md" >}})
- - [0094.Binary-Tree-Inorder-Traversal]({{< relref "/ChapterFour/0094.Binary-Tree-Inorder-Traversal.md" >}})
- - [0095.Unique-Binary-Search-Trees-II]({{< relref "/ChapterFour/0095.Unique-Binary-Search-Trees-II.md" >}})
- - [0096.Unique-Binary-Search-Trees]({{< relref "/ChapterFour/0096.Unique-Binary-Search-Trees.md" >}})
- - [0098.Validate-Binary-Search-Tree]({{< relref "/ChapterFour/0098.Validate-Binary-Search-Tree.md" >}})
- - [0099.Recover-Binary-Search-Tree]({{< relref "/ChapterFour/0099.Recover-Binary-Search-Tree.md" >}})
- - [0100.Same-Tree]({{< relref "/ChapterFour/0100.Same-Tree.md" >}})
- - [0101.Symmetric-Tree]({{< relref "/ChapterFour/0101.Symmetric-Tree.md" >}})
- - [0102.Binary-Tree-Level-Order-Traversal]({{< relref "/ChapterFour/0102.Binary-Tree-Level-Order-Traversal.md" >}})
- - [0103.Binary-Tree-Zigzag-Level-Order-Traversal]({{< relref "/ChapterFour/0103.Binary-Tree-Zigzag-Level-Order-Traversal.md" >}})
- - [0104.Maximum-Depth-of-Binary-Tree]({{< relref "/ChapterFour/0104.Maximum-Depth-of-Binary-Tree.md" >}})
- - [0105.Construct-Binary-Tree-from-Preorder-and-Inorder-Traversal]({{< relref "/ChapterFour/0105.Construct-Binary-Tree-from-Preorder-and-Inorder-Traversal.md" >}})
- - [0106.Construct-Binary-Tree-from-Inorder-and-Postorder-Traversal]({{< relref "/ChapterFour/0106.Construct-Binary-Tree-from-Inorder-and-Postorder-Traversal.md" >}})
- - [0107.Binary-Tree-Level-Order-Traversal-II]({{< relref "/ChapterFour/0107.Binary-Tree-Level-Order-Traversal-II.md" >}})
- - [0108.Convert-Sorted-Array-to-Binary-Search-Tree]({{< relref "/ChapterFour/0108.Convert-Sorted-Array-to-Binary-Search-Tree.md" >}})
- - [0109.Convert-Sorted-List-to-Binary-Search-Tree]({{< relref "/ChapterFour/0109.Convert-Sorted-List-to-Binary-Search-Tree.md" >}})
- - [0110.Balanced-Binary-Tree]({{< relref "/ChapterFour/0110.Balanced-Binary-Tree.md" >}})
- - [0111.Minimum-Depth-of-Binary-Tree]({{< relref "/ChapterFour/0111.Minimum-Depth-of-Binary-Tree.md" >}})
- - [0112.Path-Sum]({{< relref "/ChapterFour/0112.Path-Sum.md" >}})
- - [0113.Path-Sum-II]({{< relref "/ChapterFour/0113.Path-Sum-II.md" >}})
- - [0114.Flatten-Binary-Tree-to-Linked-List]({{< relref "/ChapterFour/0114.Flatten-Binary-Tree-to-Linked-List.md" >}})
- - [0118.Pascals-Triangle]({{< relref "/ChapterFour/0118.Pascals-Triangle.md" >}})
- - [0120.Triangle]({{< relref "/ChapterFour/0120.Triangle.md" >}})
- - [0121.Best-Time-to-Buy-and-Sell-Stock]({{< relref "/ChapterFour/0121.Best-Time-to-Buy-and-Sell-Stock.md" >}})
- - [0122.Best-Time-to-Buy-and-Sell-Stock-II]({{< relref "/ChapterFour/0122.Best-Time-to-Buy-and-Sell-Stock-II.md" >}})
- - [0124.Binary-Tree-Maximum-Path-Sum]({{< relref "/ChapterFour/0124.Binary-Tree-Maximum-Path-Sum.md" >}})
- - [0125.Valid-Palindrome]({{< relref "/ChapterFour/0125.Valid-Palindrome.md" >}})
- - [0126.Word-Ladder-II]({{< relref "/ChapterFour/0126.Word-Ladder-II.md" >}})
- - [0127.Word-Ladder]({{< relref "/ChapterFour/0127.Word-Ladder.md" >}})
- - [0128.Longest-Consecutive-Sequence]({{< relref "/ChapterFour/0128.Longest-Consecutive-Sequence.md" >}})
- - [0129.Sum-Root-to-Leaf-Numbers]({{< relref "/ChapterFour/0129.Sum-Root-to-Leaf-Numbers.md" >}})
- - [0130.Surrounded-Regions]({{< relref "/ChapterFour/0130.Surrounded-Regions.md" >}})
- - [0131.Palindrome-Partitioning]({{< relref "/ChapterFour/0131.Palindrome-Partitioning.md" >}})
- - [0136.Single-Number]({{< relref "/ChapterFour/0136.Single-Number.md" >}})
- - [0137.Single-Number-II]({{< relref "/ChapterFour/0137.Single-Number-II.md" >}})
- - [0141.Linked-List-Cycle]({{< relref "/ChapterFour/0141.Linked-List-Cycle.md" >}})
- - [0142.Linked-List-Cycle-II]({{< relref "/ChapterFour/0142.Linked-List-Cycle-II.md" >}})
- - [0143.Reorder-List]({{< relref "/ChapterFour/0143.Reorder-List.md" >}})
- - [0144.Binary-Tree-Preorder-Traversal]({{< relref "/ChapterFour/0144.Binary-Tree-Preorder-Traversal.md" >}})
- - [0145.Binary-Tree-Postorder-Traversal]({{< relref "/ChapterFour/0145.Binary-Tree-Postorder-Traversal.md" >}})
- - [0147.Insertion-Sort-List]({{< relref "/ChapterFour/0147.Insertion-Sort-List.md" >}})
- - [0148.Sort-List]({{< relref "/ChapterFour/0148.Sort-List.md" >}})
- - [0150.Evaluate-Reverse-Polish-Notation]({{< relref "/ChapterFour/0150.Evaluate-Reverse-Polish-Notation.md" >}})
- - [0151.Reverse-Words-in-a-String]({{< relref "/ChapterFour/0151.Reverse-Words-in-a-String.md" >}})
- - [0152.Maximum-Product-Subarray]({{< relref "/ChapterFour/0152.Maximum-Product-Subarray.md" >}})
- - [0153.Find-Minimum-in-Rotated-Sorted-Array]({{< relref "/ChapterFour/0153.Find-Minimum-in-Rotated-Sorted-Array.md" >}})
- - [0154.Find-Minimum-in-Rotated-Sorted-Array-II]({{< relref "/ChapterFour/0154.Find-Minimum-in-Rotated-Sorted-Array-II.md" >}})
- - [0155.Min-Stack]({{< relref "/ChapterFour/0155.Min-Stack.md" >}})
- - [0160.Intersection-of-Two-Linked-Lists]({{< relref "/ChapterFour/0160.Intersection-of-Two-Linked-Lists.md" >}})
- - [0162.Find-Peak-Element]({{< relref "/ChapterFour/0162.Find-Peak-Element.md" >}})
- - [0164.Maximum-Gap]({{< relref "/ChapterFour/0164.Maximum-Gap.md" >}})
- - [0167.Two-Sum-II---Input-array-is-sorted]({{< relref "/ChapterFour/0167.Two-Sum-II---Input-array-is-sorted.md" >}})
- - [0168.Excel-Sheet-Column-Title]({{< relref "/ChapterFour/0168.Excel-Sheet-Column-Title.md" >}})
- - [0169.Majority-Element]({{< relref "/ChapterFour/0169.Majority-Element.md" >}})
- - [0171.Excel-Sheet-Column-Number]({{< relref "/ChapterFour/0171.Excel-Sheet-Column-Number.md" >}})
- - [0172.Factorial-Trailing-Zeroes]({{< relref "/ChapterFour/0172.Factorial-Trailing-Zeroes.md" >}})
- - [0173.Binary-Search-Tree-Iterator]({{< relref "/ChapterFour/0173.Binary-Search-Tree-Iterator.md" >}})
- - [0174.Dungeon-Game]({{< relref "/ChapterFour/0174.Dungeon-Game.md" >}})
- - [0179.Largest-Number]({{< relref "/ChapterFour/0179.Largest-Number.md" >}})
- - [0187.Repeated-DNA-Sequences]({{< relref "/ChapterFour/0187.Repeated-DNA-Sequences.md" >}})
- - [0190.Reverse-Bits]({{< relref "/ChapterFour/0190.Reverse-Bits.md" >}})
- - [0191.Number-of-1-Bits]({{< relref "/ChapterFour/0191.Number-of-1-Bits.md" >}})
- - [0198.House-Robber]({{< relref "/ChapterFour/0198.House-Robber.md" >}})
- - [0199.Binary-Tree-Right-Side-View]({{< relref "/ChapterFour/0199.Binary-Tree-Right-Side-View.md" >}})
- - [0200.Number-of-Islands]({{< relref "/ChapterFour/0200.Number-of-Islands.md" >}})
- - [0201.Bitwise-AND-of-Numbers-Range]({{< relref "/ChapterFour/0201.Bitwise-AND-of-Numbers-Range.md" >}})
- - [0202.Happy-Number]({{< relref "/ChapterFour/0202.Happy-Number.md" >}})
- - [0203.Remove-Linked-List-Elements]({{< relref "/ChapterFour/0203.Remove-Linked-List-Elements.md" >}})
- - [0204.Count-Primes]({{< relref "/ChapterFour/0204.Count-Primes.md" >}})
- - [0205.Isomorphic-Strings]({{< relref "/ChapterFour/0205.Isomorphic-Strings.md" >}})
- - [0206.Reverse-Linked-List]({{< relref "/ChapterFour/0206.Reverse-Linked-List.md" >}})
- - [0207.Course-Schedule]({{< relref "/ChapterFour/0207.Course-Schedule.md" >}})
- - [0208.Implement-Trie-Prefix-Tree]({{< relref "/ChapterFour/0208.Implement-Trie-Prefix-Tree.md" >}})
- - [0209.Minimum-Size-Subarray-Sum]({{< relref "/ChapterFour/0209.Minimum-Size-Subarray-Sum.md" >}})
- - [0210.Course-Schedule-II]({{< relref "/ChapterFour/0210.Course-Schedule-II.md" >}})
- - [0211.Add-and-Search-Word---Data-structure-design]({{< relref "/ChapterFour/0211.Add-and-Search-Word---Data-structure-design.md" >}})
- - [0212.Word-Search-II]({{< relref "/ChapterFour/0212.Word-Search-II.md" >}})
- - [0213.House-Robber-II]({{< relref "/ChapterFour/0213.House-Robber-II.md" >}})
- - [0215.Kth-Largest-Element-in-an-Array]({{< relref "/ChapterFour/0215.Kth-Largest-Element-in-an-Array.md" >}})
- - [0216.Combination-Sum-III]({{< relref "/ChapterFour/0216.Combination-Sum-III.md" >}})
- - [0217.Contains-Duplicate]({{< relref "/ChapterFour/0217.Contains-Duplicate.md" >}})
- - [0218.The-Skyline-Problem]({{< relref "/ChapterFour/0218.The-Skyline-Problem.md" >}})
- - [0219.Contains-Duplicate-II]({{< relref "/ChapterFour/0219.Contains-Duplicate-II.md" >}})
- - [0220.Contains-Duplicate-III]({{< relref "/ChapterFour/0220.Contains-Duplicate-III.md" >}})
- - [0222.Count-Complete-Tree-Nodes]({{< relref "/ChapterFour/0222.Count-Complete-Tree-Nodes.md" >}})
- - [0223.Rectangle-Area]({{< relref "/ChapterFour/0223.Rectangle-Area.md" >}})
- - [0224.Basic-Calculator]({{< relref "/ChapterFour/0224.Basic-Calculator.md" >}})
- - [0225.Implement-Stack-using-Queues]({{< relref "/ChapterFour/0225.Implement-Stack-using-Queues.md" >}})
- - [0226.Invert-Binary-Tree]({{< relref "/ChapterFour/0226.Invert-Binary-Tree.md" >}})
- - [0229.Majority-Element-II]({{< relref "/ChapterFour/0229.Majority-Element-II.md" >}})
- - [0230.Kth-Smallest-Element-in-a-BST]({{< relref "/ChapterFour/0230.Kth-Smallest-Element-in-a-BST.md" >}})
- - [0231.Power-of-Two]({{< relref "/ChapterFour/0231.Power-of-Two.md" >}})
- - [0232.Implement-Queue-using-Stacks]({{< relref "/ChapterFour/0232.Implement-Queue-using-Stacks.md" >}})
- - [0234.Palindrome-Linked-List]({{< relref "/ChapterFour/0234.Palindrome-Linked-List.md" >}})
- - [0235.Lowest-Common-Ancestor-of-a-Binary-Search-Tree]({{< relref "/ChapterFour/0235.Lowest-Common-Ancestor-of-a-Binary-Search-Tree.md" >}})
- - [0236.Lowest-Common-Ancestor-of-a-Binary-Tree]({{< relref "/ChapterFour/0236.Lowest-Common-Ancestor-of-a-Binary-Tree.md" >}})
- - [0237.Delete-Node-in-a-Linked-List]({{< relref "/ChapterFour/0237.Delete-Node-in-a-Linked-List.md" >}})
- - [0239.Sliding-Window-Maximum]({{< relref "/ChapterFour/0239.Sliding-Window-Maximum.md" >}})
- - [0240.Search-a-2D-Matrix-II]({{< relref "/ChapterFour/0240.Search-a-2D-Matrix-II.md" >}})
- - [0242.Valid-Anagram]({{< relref "/ChapterFour/0242.Valid-Anagram.md" >}})
- - [0257.Binary-Tree-Paths]({{< relref "/ChapterFour/0257.Binary-Tree-Paths.md" >}})
- - [0258.Add-Digits]({{< relref "/ChapterFour/0258.Add-Digits.md" >}})
- - [0260.Single-Number-III]({{< relref "/ChapterFour/0260.Single-Number-III.md" >}})
- - [0263.Ugly-Number]({{< relref "/ChapterFour/0263.Ugly-Number.md" >}})
- - [0268.Missing-Number]({{< relref "/ChapterFour/0268.Missing-Number.md" >}})
- - [0274.H-Index]({{< relref "/ChapterFour/0274.H-Index.md" >}})
- - [0275.H-Index-II]({{< relref "/ChapterFour/0275.H-Index-II.md" >}})
- - [0283.Move-Zeroes]({{< relref "/ChapterFour/0283.Move-Zeroes.md" >}})
- - [0287.Find-the-Duplicate-Number]({{< relref "/ChapterFour/0287.Find-the-Duplicate-Number.md" >}})
- - [0290.Word-Pattern]({{< relref "/ChapterFour/0290.Word-Pattern.md" >}})
- - [0300.Longest-Increasing-Subsequence]({{< relref "/ChapterFour/0300.Longest-Increasing-Subsequence.md" >}})
- - [0303.Range-Sum-Query---Immutable]({{< relref "/ChapterFour/0303.Range-Sum-Query---Immutable.md" >}})
- - [0306.Additive-Number]({{< relref "/ChapterFour/0306.Additive-Number.md" >}})
- - [0307.Range-Sum-Query---Mutable]({{< relref "/ChapterFour/0307.Range-Sum-Query---Mutable.md" >}})
- - [0309.Best-Time-to-Buy-and-Sell-Stock-with-Cooldown]({{< relref "/ChapterFour/0309.Best-Time-to-Buy-and-Sell-Stock-with-Cooldown.md" >}})
- - [0315.Count-of-Smaller-Numbers-After-Self]({{< relref "/ChapterFour/0315.Count-of-Smaller-Numbers-After-Self.md" >}})
- - [0318.Maximum-Product-of-Word-Lengths]({{< relref "/ChapterFour/0318.Maximum-Product-of-Word-Lengths.md" >}})
- - [0322.Coin-Change]({{< relref "/ChapterFour/0322.Coin-Change.md" >}})
- - [0324.Wiggle-Sort-II]({{< relref "/ChapterFour/0324.Wiggle-Sort-II.md" >}})
- - [0326.Power-of-Three]({{< relref "/ChapterFour/0326.Power-of-Three.md" >}})
- - [0327.Count-of-Range-Sum]({{< relref "/ChapterFour/0327.Count-of-Range-Sum.md" >}})
- - [0328.Odd-Even-Linked-List]({{< relref "/ChapterFour/0328.Odd-Even-Linked-List.md" >}})
- - [0329.Longest-Increasing-Path-in-a-Matrix]({{< relref "/ChapterFour/0329.Longest-Increasing-Path-in-a-Matrix.md" >}})
- - [0331.Verify-Preorder-Serialization-of-a-Binary-Tree]({{< relref "/ChapterFour/0331.Verify-Preorder-Serialization-of-a-Binary-Tree.md" >}})
- - [0337.House-Robber-III]({{< relref "/ChapterFour/0337.House-Robber-III.md" >}})
- - [0338.Counting-Bits]({{< relref "/ChapterFour/0338.Counting-Bits.md" >}})
- - [0342.Power-of-Four]({{< relref "/ChapterFour/0342.Power-of-Four.md" >}})
- - [0343.Integer-Break]({{< relref "/ChapterFour/0343.Integer-Break.md" >}})
- - [0344.Reverse-String]({{< relref "/ChapterFour/0344.Reverse-String.md" >}})
- - [0345.Reverse-Vowels-of-a-String]({{< relref "/ChapterFour/0345.Reverse-Vowels-of-a-String.md" >}})
- - [0347.Top-K-Frequent-Elements]({{< relref "/ChapterFour/0347.Top-K-Frequent-Elements.md" >}})
- - [0349.Intersection-of-Two-Arrays]({{< relref "/ChapterFour/0349.Intersection-of-Two-Arrays.md" >}})
- - [0350.Intersection-of-Two-Arrays-II]({{< relref "/ChapterFour/0350.Intersection-of-Two-Arrays-II.md" >}})
- - [0354.Russian-Doll-Envelopes]({{< relref "/ChapterFour/0354.Russian-Doll-Envelopes.md" >}})
- - [0357.Count-Numbers-with-Unique-Digits]({{< relref "/ChapterFour/0357.Count-Numbers-with-Unique-Digits.md" >}})
- - [0367.Valid-Perfect-Square]({{< relref "/ChapterFour/0367.Valid-Perfect-Square.md" >}})
- - [0371.Sum-of-Two-Integers]({{< relref "/ChapterFour/0371.Sum-of-Two-Integers.md" >}})
- - [0372.Super-Pow]({{< relref "/ChapterFour/0372.Super-Pow.md" >}})
- - [0373.Find-K-Pairs-with-Smallest-Sums]({{< relref "/ChapterFour/0373.Find-K-Pairs-with-Smallest-Sums.md" >}})
- - [0378.Kth-Smallest-Element-in-a-Sorted-Matrix]({{< relref "/ChapterFour/0378.Kth-Smallest-Element-in-a-Sorted-Matrix.md" >}})
- - [0385.Mini-Parser]({{< relref "/ChapterFour/0385.Mini-Parser.md" >}})
- - [0386.Lexicographical-Numbers]({{< relref "/ChapterFour/0386.Lexicographical-Numbers.md" >}})
- - [0387.First-Unique-Character-in-a-String]({{< relref "/ChapterFour/0387.First-Unique-Character-in-a-String.md" >}})
- - [0389.Find-the-Difference]({{< relref "/ChapterFour/0389.Find-the-Difference.md" >}})
- - [0392.Is-Subsequence]({{< relref "/ChapterFour/0392.Is-Subsequence.md" >}})
- - [0393.UTF-8-Validation]({{< relref "/ChapterFour/0393.UTF-8-Validation.md" >}})
- - [0394.Decode-String]({{< relref "/ChapterFour/0394.Decode-String.md" >}})
- - [0397.Integer-Replacement]({{< relref "/ChapterFour/0397.Integer-Replacement.md" >}})
- - [0399.Evaluate-Division]({{< relref "/ChapterFour/0399.Evaluate-Division.md" >}})
- - [0401.Binary-Watch]({{< relref "/ChapterFour/0401.Binary-Watch.md" >}})
- - [0402.Remove-K-Digits]({{< relref "/ChapterFour/0402.Remove-K-Digits.md" >}})
- - [0404.Sum-of-Left-Leaves]({{< relref "/ChapterFour/0404.Sum-of-Left-Leaves.md" >}})
- - [0405.Convert-a-Number-to-Hexadecimal]({{< relref "/ChapterFour/0405.Convert-a-Number-to-Hexadecimal.md" >}})
- - [0409.Longest-Palindrome]({{< relref "/ChapterFour/0409.Longest-Palindrome.md" >}})
- - [0410.Split-Array-Largest-Sum]({{< relref "/ChapterFour/0410.Split-Array-Largest-Sum.md" >}})
- - [0412.Fizz-Buzz]({{< relref "/ChapterFour/0412.Fizz-Buzz.md" >}})
- - [0414.Third-Maximum-Number]({{< relref "/ChapterFour/0414.Third-Maximum-Number.md" >}})
- - [0416.Partition-Equal-Subset-Sum]({{< relref "/ChapterFour/0416.Partition-Equal-Subset-Sum.md" >}})
- - [0421.Maximum-XOR-of-Two-Numbers-in-an-Array]({{< relref "/ChapterFour/0421.Maximum-XOR-of-Two-Numbers-in-an-Array.md" >}})
- - [0424.Longest-Repeating-Character-Replacement]({{< relref "/ChapterFour/0424.Longest-Repeating-Character-Replacement.md" >}})
- - [0433.Minimum-Genetic-Mutation]({{< relref "/ChapterFour/0433.Minimum-Genetic-Mutation.md" >}})
- - [0435.Non-overlapping-Intervals]({{< relref "/ChapterFour/0435.Non-overlapping-Intervals.md" >}})
- - [0436.Find-Right-Interval]({{< relref "/ChapterFour/0436.Find-Right-Interval.md" >}})
- - [0437.Path-Sum-III]({{< relref "/ChapterFour/0437.Path-Sum-III.md" >}})
- - [0438.Find-All-Anagrams-in-a-String]({{< relref "/ChapterFour/0438.Find-All-Anagrams-in-a-String.md" >}})
- - [0441.Arranging-Coins]({{< relref "/ChapterFour/0441.Arranging-Coins.md" >}})
- - [0445.Add-Two-Numbers-II]({{< relref "/ChapterFour/0445.Add-Two-Numbers-II.md" >}})
- - [0447.Number-of-Boomerangs]({{< relref "/ChapterFour/0447.Number-of-Boomerangs.md" >}})
- - [0448.Find-All-Numbers-Disappeared-in-an-Array]({{< relref "/ChapterFour/0448.Find-All-Numbers-Disappeared-in-an-Array.md" >}})
- - [0451.Sort-Characters-By-Frequency]({{< relref "/ChapterFour/0451.Sort-Characters-By-Frequency.md" >}})
- - [0453.Minimum-Moves-to-Equal-Array-Elements]({{< relref "/ChapterFour/0453.Minimum-Moves-to-Equal-Array-Elements.md" >}})
- - [0454.4Sum-II]({{< relref "/ChapterFour/0454.4Sum-II.md" >}})
- - [0455.Assign-Cookies]({{< relref "/ChapterFour/0455.Assign-Cookies.md" >}})
- - [0456.132-Pattern]({{< relref "/ChapterFour/0456.132-Pattern.md" >}})
- - [0457.Circular-Array-Loop]({{< relref "/ChapterFour/0457.Circular-Array-Loop.md" >}})
- - [0461.Hamming-Distance]({{< relref "/ChapterFour/0461.Hamming-Distance.md" >}})
- - [0463.Island-Perimeter]({{< relref "/ChapterFour/0463.Island-Perimeter.md" >}})
- - [0470.Implement-Rand10-Using-Rand7]({{< relref "/ChapterFour/0470.Implement-Rand10-Using-Rand7.md" >}})
- - [0474.Ones-and-Zeroes]({{< relref "/ChapterFour/0474.Ones-and-Zeroes.md" >}})
- - [0475.Heaters]({{< relref "/ChapterFour/0475.Heaters.md" >}})
- - [0476.Number-Complement]({{< relref "/ChapterFour/0476.Number-Complement.md" >}})
- - [0477.Total-Hamming-Distance]({{< relref "/ChapterFour/0477.Total-Hamming-Distance.md" >}})
- - [0480.Sliding-Window-Median]({{< relref "/ChapterFour/0480.Sliding-Window-Median.md" >}})
- - [0483.Smallest-Good-Base]({{< relref "/ChapterFour/0483.Smallest-Good-Base.md" >}})
- - [0485.Max-Consecutive-Ones]({{< relref "/ChapterFour/0485.Max-Consecutive-Ones.md" >}})
- - [0491.Increasing-Subsequences]({{< relref "/ChapterFour/0491.Increasing-Subsequences.md" >}})
- - [0493.Reverse-Pairs]({{< relref "/ChapterFour/0493.Reverse-Pairs.md" >}})
- - [0494.Target-Sum]({{< relref "/ChapterFour/0494.Target-Sum.md" >}})
- - [0496.Next-Greater-Element-I]({{< relref "/ChapterFour/0496.Next-Greater-Element-I.md" >}})
- - [0497.Random-Point-in-Non-overlapping-Rectangles]({{< relref "/ChapterFour/0497.Random-Point-in-Non-overlapping-Rectangles.md" >}})
- - [0498.Diagonal-Traverse]({{< relref "/ChapterFour/0498.Diagonal-Traverse.md" >}})
- - [0500.Keyboard-Row]({{< relref "/ChapterFour/0500.Keyboard-Row.md" >}})
- - [0503.Next-Greater-Element-II]({{< relref "/ChapterFour/0503.Next-Greater-Element-II.md" >}})
- - [0507.Perfect-Number]({{< relref "/ChapterFour/0507.Perfect-Number.md" >}})
- - [0508.Most-Frequent-Subtree-Sum]({{< relref "/ChapterFour/0508.Most-Frequent-Subtree-Sum.md" >}})
- - [0509.Fibonacci-Number]({{< relref "/ChapterFour/0509.Fibonacci-Number.md" >}})
- - [0513.Find-Bottom-Left-Tree-Value]({{< relref "/ChapterFour/0513.Find-Bottom-Left-Tree-Value.md" >}})
- - [0515.Find-Largest-Value-in-Each-Tree-Row]({{< relref "/ChapterFour/0515.Find-Largest-Value-in-Each-Tree-Row.md" >}})
- - [0524.Longest-Word-in-Dictionary-through-Deleting]({{< relref "/ChapterFour/0524.Longest-Word-in-Dictionary-through-Deleting.md" >}})
- - [0526.Beautiful-Arrangement]({{< relref "/ChapterFour/0526.Beautiful-Arrangement.md" >}})
- - [0528.Random-Pick-with-Weight]({{< relref "/ChapterFour/0528.Random-Pick-with-Weight.md" >}})
- - [0529.Minesweeper]({{< relref "/ChapterFour/0529.Minesweeper.md" >}})
- - [0532.K-diff-Pairs-in-an-Array]({{< relref "/ChapterFour/0532.K-diff-Pairs-in-an-Array.md" >}})
- - [0537.Complex-Number-Multiplication]({{< relref "/ChapterFour/0537.Complex-Number-Multiplication.md" >}})
- - [0541.Reverse-String-II]({{< relref "/ChapterFour/0541.Reverse-String-II.md" >}})
- - [0542.01-Matrix]({{< relref "/ChapterFour/0542.01-Matrix.md" >}})
- - [0547.Friend-Circles]({{< relref "/ChapterFour/0547.Friend-Circles.md" >}})
- - [0557.Reverse-Words-in-a-String-III]({{< relref "/ChapterFour/0557.Reverse-Words-in-a-String-III.md" >}})
- - [0561.Array-Partition-I]({{< relref "/ChapterFour/0561.Array-Partition-I.md" >}})
- - [0563.Binary-Tree-Tilt]({{< relref "/ChapterFour/0563.Binary-Tree-Tilt.md" >}})
- - [0566.Reshape-the-Matrix]({{< relref "/ChapterFour/0566.Reshape-the-Matrix.md" >}})
- - [0567.Permutation-in-String]({{< relref "/ChapterFour/0567.Permutation-in-String.md" >}})
- - [0572.Subtree-of-Another-Tree]({{< relref "/ChapterFour/0572.Subtree-of-Another-Tree.md" >}})
- - [0575.Distribute-Candies]({{< relref "/ChapterFour/0575.Distribute-Candies.md" >}})
- - [0594.Longest-Harmonious-Subsequence]({{< relref "/ChapterFour/0594.Longest-Harmonious-Subsequence.md" >}})
- - [0598.Range-Addition-II]({{< relref "/ChapterFour/0598.Range-Addition-II.md" >}})
- - [0599.Minimum-Index-Sum-of-Two-Lists]({{< relref "/ChapterFour/0599.Minimum-Index-Sum-of-Two-Lists.md" >}})
- - [0628.Maximum-Product-of-Three-Numbers]({{< relref "/ChapterFour/0628.Maximum-Product-of-Three-Numbers.md" >}})
- - [0632.Smallest-Range-Covering-Elements-from-K-Lists]({{< relref "/ChapterFour/0632.Smallest-Range-Covering-Elements-from-K-Lists.md" >}})
- - [0633.Sum-of-Square-Numbers]({{< relref "/ChapterFour/0633.Sum-of-Square-Numbers.md" >}})
- - [0636.Exclusive-Time-of-Functions]({{< relref "/ChapterFour/0636.Exclusive-Time-of-Functions.md" >}})
- - [0637.Average-of-Levels-in-Binary-Tree]({{< relref "/ChapterFour/0637.Average-of-Levels-in-Binary-Tree.md" >}})
- - [0638.Shopping-Offers]({{< relref "/ChapterFour/0638.Shopping-Offers.md" >}})
- - [0645.Set-Mismatch]({{< relref "/ChapterFour/0645.Set-Mismatch.md" >}})
- - [0648.Replace-Words]({{< relref "/ChapterFour/0648.Replace-Words.md" >}})
- - [0653.Two-Sum-IV---Input-is-a-BST]({{< relref "/ChapterFour/0653.Two-Sum-IV---Input-is-a-BST.md" >}})
- - [0658.Find-K-Closest-Elements]({{< relref "/ChapterFour/0658.Find-K-Closest-Elements.md" >}})
- - [0661.Image-Smoother]({{< relref "/ChapterFour/0661.Image-Smoother.md" >}})
- - [0662.Maximum-Width-of-Binary-Tree]({{< relref "/ChapterFour/0662.Maximum-Width-of-Binary-Tree.md" >}})
- - [0668.Kth-Smallest-Number-in-Multiplication-Table]({{< relref "/ChapterFour/0668.Kth-Smallest-Number-in-Multiplication-Table.md" >}})
- - [0676.Implement-Magic-Dictionary]({{< relref "/ChapterFour/0676.Implement-Magic-Dictionary.md" >}})
- - [0682.Baseball-Game]({{< relref "/ChapterFour/0682.Baseball-Game.md" >}})
- - [0684.Redundant-Connection]({{< relref "/ChapterFour/0684.Redundant-Connection.md" >}})
- - [0685.Redundant-Connection-II]({{< relref "/ChapterFour/0685.Redundant-Connection-II.md" >}})
- - [0693.Binary-Number-with-Alternating-Bits]({{< relref "/ChapterFour/0693.Binary-Number-with-Alternating-Bits.md" >}})
- - [0695.Max-Area-of-Island]({{< relref "/ChapterFour/0695.Max-Area-of-Island.md" >}})
- - [0697.Degree-of-an-Array]({{< relref "/ChapterFour/0697.Degree-of-an-Array.md" >}})
- - [0699.Falling-Squares]({{< relref "/ChapterFour/0699.Falling-Squares.md" >}})
- - [0704.Binary-Search]({{< relref "/ChapterFour/0704.Binary-Search.md" >}})
- - [0705.Design-HashSet]({{< relref "/ChapterFour/0705.Design-HashSet.md" >}})
- - [0706.Design-HashMap]({{< relref "/ChapterFour/0706.Design-HashMap.md" >}})
- - [0707.Design-Linked-List]({{< relref "/ChapterFour/0707.Design-Linked-List.md" >}})
- - [0710.Random-Pick-with-Blacklist]({{< relref "/ChapterFour/0710.Random-Pick-with-Blacklist.md" >}})
- - [0713.Subarray-Product-Less-Than-K]({{< relref "/ChapterFour/0713.Subarray-Product-Less-Than-K.md" >}})
- - [0714.Best-Time-to-Buy-and-Sell-Stock-with-Transaction-Fee]({{< relref "/ChapterFour/0714.Best-Time-to-Buy-and-Sell-Stock-with-Transaction-Fee.md" >}})
- - [0715.Range-Module]({{< relref "/ChapterFour/0715.Range-Module.md" >}})
- - [0717.1-bit-and-2-bit-Characters]({{< relref "/ChapterFour/0717.1-bit-and-2-bit-Characters.md" >}})
- - [0718.Maximum-Length-of-Repeated-Subarray]({{< relref "/ChapterFour/0718.Maximum-Length-of-Repeated-Subarray.md" >}})
- - [0719.Find-K-th-Smallest-Pair-Distance]({{< relref "/ChapterFour/0719.Find-K-th-Smallest-Pair-Distance.md" >}})
- - [0720.Longest-Word-in-Dictionary]({{< relref "/ChapterFour/0720.Longest-Word-in-Dictionary.md" >}})
- - [0721.Accounts-Merge]({{< relref "/ChapterFour/0721.Accounts-Merge.md" >}})
- - [0724.Find-Pivot-Index]({{< relref "/ChapterFour/0724.Find-Pivot-Index.md" >}})
- - [0725.Split-Linked-List-in-Parts]({{< relref "/ChapterFour/0725.Split-Linked-List-in-Parts.md" >}})
- - [0726.Number-of-Atoms]({{< relref "/ChapterFour/0726.Number-of-Atoms.md" >}})
- - [0729.My-Calendar-I]({{< relref "/ChapterFour/0729.My-Calendar-I.md" >}})
- - [0732.My-Calendar-III]({{< relref "/ChapterFour/0732.My-Calendar-III.md" >}})
- - [0733.Flood-Fill]({{< relref "/ChapterFour/0733.Flood-Fill.md" >}})
- - [0735.Asteroid-Collision]({{< relref "/ChapterFour/0735.Asteroid-Collision.md" >}})
- - [0739.Daily-Temperatures]({{< relref "/ChapterFour/0739.Daily-Temperatures.md" >}})
- - [0744.Find-Smallest-Letter-Greater-Than-Target]({{< relref "/ChapterFour/0744.Find-Smallest-Letter-Greater-Than-Target.md" >}})
- - [0745.Prefix-and-Suffix-Search]({{< relref "/ChapterFour/0745.Prefix-and-Suffix-Search.md" >}})
- - [0746.Min-Cost-Climbing-Stairs]({{< relref "/ChapterFour/0746.Min-Cost-Climbing-Stairs.md" >}})
- - [0748.Shortest-Completing-Word]({{< relref "/ChapterFour/0748.Shortest-Completing-Word.md" >}})
- - [0753.Cracking-the-Safe]({{< relref "/ChapterFour/0753.Cracking-the-Safe.md" >}})
- - [0756.Pyramid-Transition-Matrix]({{< relref "/ChapterFour/0756.Pyramid-Transition-Matrix.md" >}})
- - [0762.Prime-Number-of-Set-Bits-in-Binary-Representation]({{< relref "/ChapterFour/0762.Prime-Number-of-Set-Bits-in-Binary-Representation.md" >}})
- - [0763.Partition-Labels]({{< relref "/ChapterFour/0763.Partition-Labels.md" >}})
- - [0765.Couples-Holding-Hands]({{< relref "/ChapterFour/0765.Couples-Holding-Hands.md" >}})
- - [0766.Toeplitz-Matrix]({{< relref "/ChapterFour/0766.Toeplitz-Matrix.md" >}})
- - [0767.Reorganize-String]({{< relref "/ChapterFour/0767.Reorganize-String.md" >}})
- - [0771.Jewels-and-Stones]({{< relref "/ChapterFour/0771.Jewels-and-Stones.md" >}})
- - [0778.Swim-in-Rising-Water]({{< relref "/ChapterFour/0778.Swim-in-Rising-Water.md" >}})
- - [0781.Rabbits-in-Forest]({{< relref "/ChapterFour/0781.Rabbits-in-Forest.md" >}})
- - [0784.Letter-Case-Permutation]({{< relref "/ChapterFour/0784.Letter-Case-Permutation.md" >}})
- - [0786.K-th-Smallest-Prime-Fraction]({{< relref "/ChapterFour/0786.K-th-Smallest-Prime-Fraction.md" >}})
- - [0793.Preimage-Size-of-Factorial-Zeroes-Function]({{< relref "/ChapterFour/0793.Preimage-Size-of-Factorial-Zeroes-Function.md" >}})
- - [0802.Find-Eventual-Safe-States]({{< relref "/ChapterFour/0802.Find-Eventual-Safe-States.md" >}})
- - [0803.Bricks-Falling-When-Hit]({{< relref "/ChapterFour/0803.Bricks-Falling-When-Hit.md" >}})
- - [0811.Subdomain-Visit-Count]({{< relref "/ChapterFour/0811.Subdomain-Visit-Count.md" >}})
- - [0812.Largest-Triangle-Area]({{< relref "/ChapterFour/0812.Largest-Triangle-Area.md" >}})
- - [0815.Bus-Routes]({{< relref "/ChapterFour/0815.Bus-Routes.md" >}})
- - [0817.Linked-List-Components]({{< relref "/ChapterFour/0817.Linked-List-Components.md" >}})
- - [0819.Most-Common-Word]({{< relref "/ChapterFour/0819.Most-Common-Word.md" >}})
- - [0826.Most-Profit-Assigning-Work]({{< relref "/ChapterFour/0826.Most-Profit-Assigning-Work.md" >}})
- - [0828.COPYRIGHT-PROBLEM-XXX]({{< relref "/ChapterFour/0828.COPYRIGHT-PROBLEM-XXX.md" >}})
- - [0832.Flipping-an-Image]({{< relref "/ChapterFour/0832.Flipping-an-Image.md" >}})
- - [0834.Sum-of-Distances-in-Tree]({{< relref "/ChapterFour/0834.Sum-of-Distances-in-Tree.md" >}})
- - [0836.Rectangle-Overlap]({{< relref "/ChapterFour/0836.Rectangle-Overlap.md" >}})
- - [0838.Push-Dominoes]({{< relref "/ChapterFour/0838.Push-Dominoes.md" >}})
- - [0839.Similar-String-Groups]({{< relref "/ChapterFour/0839.Similar-String-Groups.md" >}})
- - [0841.Keys-and-Rooms]({{< relref "/ChapterFour/0841.Keys-and-Rooms.md" >}})
- - [0842.Split-Array-into-Fibonacci-Sequence]({{< relref "/ChapterFour/0842.Split-Array-into-Fibonacci-Sequence.md" >}})
- - [0844.Backspace-String-Compare]({{< relref "/ChapterFour/0844.Backspace-String-Compare.md" >}})
- - [0845.Longest-Mountain-in-Array]({{< relref "/ChapterFour/0845.Longest-Mountain-in-Array.md" >}})
- - [0850.Rectangle-Area-II]({{< relref "/ChapterFour/0850.Rectangle-Area-II.md" >}})
- - [0851.Loud-and-Rich]({{< relref "/ChapterFour/0851.Loud-and-Rich.md" >}})
- - [0852.Peak-Index-in-a-Mountain-Array]({{< relref "/ChapterFour/0852.Peak-Index-in-a-Mountain-Array.md" >}})
- - [0853.Car-Fleet]({{< relref "/ChapterFour/0853.Car-Fleet.md" >}})
- - [0856.Score-of-Parentheses]({{< relref "/ChapterFour/0856.Score-of-Parentheses.md" >}})
- - [0862.Shortest-Subarray-with-Sum-at-Least-K]({{< relref "/ChapterFour/0862.Shortest-Subarray-with-Sum-at-Least-K.md" >}})
- - [0863.All-Nodes-Distance-K-in-Binary-Tree]({{< relref "/ChapterFour/0863.All-Nodes-Distance-K-in-Binary-Tree.md" >}})
- - [0864.Shortest-Path-to-Get-All-Keys]({{< relref "/ChapterFour/0864.Shortest-Path-to-Get-All-Keys.md" >}})
- - [0867.Transpose-Matrix]({{< relref "/ChapterFour/0867.Transpose-Matrix.md" >}})
- - [0872.Leaf-Similar-Trees]({{< relref "/ChapterFour/0872.Leaf-Similar-Trees.md" >}})
- - [0875.Koko-Eating-Bananas]({{< relref "/ChapterFour/0875.Koko-Eating-Bananas.md" >}})
- - [0876.Middle-of-the-Linked-List]({{< relref "/ChapterFour/0876.Middle-of-the-Linked-List.md" >}})
- - [0878.Nth-Magical-Number]({{< relref "/ChapterFour/0878.Nth-Magical-Number.md" >}})
- - [0880.Decoded-String-at-Index]({{< relref "/ChapterFour/0880.Decoded-String-at-Index.md" >}})
- - [0881.Boats-to-Save-People]({{< relref "/ChapterFour/0881.Boats-to-Save-People.md" >}})
- - [0884.Uncommon-Words-from-Two-Sentences]({{< relref "/ChapterFour/0884.Uncommon-Words-from-Two-Sentences.md" >}})
- - [0885.Spiral-Matrix-III]({{< relref "/ChapterFour/0885.Spiral-Matrix-III.md" >}})
- - [0887.Super-Egg-Drop]({{< relref "/ChapterFour/0887.Super-Egg-Drop.md" >}})
- - [0888.Fair-Candy-Swap]({{< relref "/ChapterFour/0888.Fair-Candy-Swap.md" >}})
- - [0891.Sum-of-Subsequence-Widths]({{< relref "/ChapterFour/0891.Sum-of-Subsequence-Widths.md" >}})
- - [0892.Surface-Area-of-3D-Shapes]({{< relref "/ChapterFour/0892.Surface-Area-of-3D-Shapes.md" >}})
- - [0895.Maximum-Frequency-Stack]({{< relref "/ChapterFour/0895.Maximum-Frequency-Stack.md" >}})
- - [0896.Monotonic-Array]({{< relref "/ChapterFour/0896.Monotonic-Array.md" >}})
- - [0897.Increasing-Order-Search-Tree]({{< relref "/ChapterFour/0897.Increasing-Order-Search-Tree.md" >}})
- - [0898.Bitwise-ORs-of-Subarrays]({{< relref "/ChapterFour/0898.Bitwise-ORs-of-Subarrays.md" >}})
- - [0901.Online-Stock-Span]({{< relref "/ChapterFour/0901.Online-Stock-Span.md" >}})
- - [0904.Fruit-Into-Baskets]({{< relref "/ChapterFour/0904.Fruit-Into-Baskets.md" >}})
- - [0907.Sum-of-Subarray-Minimums]({{< relref "/ChapterFour/0907.Sum-of-Subarray-Minimums.md" >}})
- - [0911.Online-Election]({{< relref "/ChapterFour/0911.Online-Election.md" >}})
- - [0914.X-of-a-Kind-in-a-Deck-of-Cards]({{< relref "/ChapterFour/0914.X-of-a-Kind-in-a-Deck-of-Cards.md" >}})
- - [0918.Maximum-Sum-Circular-Subarray]({{< relref "/ChapterFour/0918.Maximum-Sum-Circular-Subarray.md" >}})
- - [0920.Number-of-Music-Playlists]({{< relref "/ChapterFour/0920.Number-of-Music-Playlists.md" >}})
- - [0921.Minimum-Add-to-Make-Parentheses-Valid]({{< relref "/ChapterFour/0921.Minimum-Add-to-Make-Parentheses-Valid.md" >}})
- - [0922.Sort-Array-By-Parity-II]({{< relref "/ChapterFour/0922.Sort-Array-By-Parity-II.md" >}})
- - [0923.3Sum-With-Multiplicity]({{< relref "/ChapterFour/0923.3Sum-With-Multiplicity.md" >}})
- - [0924.Minimize-Malware-Spread]({{< relref "/ChapterFour/0924.Minimize-Malware-Spread.md" >}})
- - [0925.Long-Pressed-Name]({{< relref "/ChapterFour/0925.Long-Pressed-Name.md" >}})
- - [0927.Three-Equal-Parts]({{< relref "/ChapterFour/0927.Three-Equal-Parts.md" >}})
- - [0928.Minimize-Malware-Spread-II]({{< relref "/ChapterFour/0928.Minimize-Malware-Spread-II.md" >}})
- - [0930.Binary-Subarrays-With-Sum]({{< relref "/ChapterFour/0930.Binary-Subarrays-With-Sum.md" >}})
- - [0933.Number-of-Recent-Calls]({{< relref "/ChapterFour/0933.Number-of-Recent-Calls.md" >}})
- - [0942.DI-String-Match]({{< relref "/ChapterFour/0942.DI-String-Match.md" >}})
- - [0946.Validate-Stack-Sequences]({{< relref "/ChapterFour/0946.Validate-Stack-Sequences.md" >}})
- - [0947.Most-Stones-Removed-with-Same-Row-or-Column]({{< relref "/ChapterFour/0947.Most-Stones-Removed-with-Same-Row-or-Column.md" >}})
- - [0949.Largest-Time-for-Given-Digits]({{< relref "/ChapterFour/0949.Largest-Time-for-Given-Digits.md" >}})
- - [0952.Largest-Component-Size-by-Common-Factor]({{< relref "/ChapterFour/0952.Largest-Component-Size-by-Common-Factor.md" >}})
- - [0953.Verifying-an-Alien-Dictionary]({{< relref "/ChapterFour/0953.Verifying-an-Alien-Dictionary.md" >}})
- - [0959.Regions-Cut-By-Slashes]({{< relref "/ChapterFour/0959.Regions-Cut-By-Slashes.md" >}})
- - [0961.N-Repeated-Element-in-Size-2N-Array]({{< relref "/ChapterFour/0961.N-Repeated-Element-in-Size-2N-Array.md" >}})
- - [0968.Binary-Tree-Cameras]({{< relref "/ChapterFour/0968.Binary-Tree-Cameras.md" >}})
- - [0969.Pancake-Sorting]({{< relref "/ChapterFour/0969.Pancake-Sorting.md" >}})
- - [0970.Powerful-Integers]({{< relref "/ChapterFour/0970.Powerful-Integers.md" >}})
- - [0973.K-Closest-Points-to-Origin]({{< relref "/ChapterFour/0973.K-Closest-Points-to-Origin.md" >}})
- - [0976.Largest-Perimeter-Triangle]({{< relref "/ChapterFour/0976.Largest-Perimeter-Triangle.md" >}})
- - [0977.Squares-of-a-Sorted-Array]({{< relref "/ChapterFour/0977.Squares-of-a-Sorted-Array.md" >}})
- - [0978.Longest-Turbulent-Subarray]({{< relref "/ChapterFour/0978.Longest-Turbulent-Subarray.md" >}})
- - [0979.Distribute-Coins-in-Binary-Tree]({{< relref "/ChapterFour/0979.Distribute-Coins-in-Binary-Tree.md" >}})
- - [0980.Unique-Paths-III]({{< relref "/ChapterFour/0980.Unique-Paths-III.md" >}})
- - [0981.Time-Based-Key-Value-Store]({{< relref "/ChapterFour/0981.Time-Based-Key-Value-Store.md" >}})
- - [0984.String-Without-AAA-or-BBB]({{< relref "/ChapterFour/0984.String-Without-AAA-or-BBB.md" >}})
- - [0985.Sum-of-Even-Numbers-After-Queries]({{< relref "/ChapterFour/0985.Sum-of-Even-Numbers-After-Queries.md" >}})
- - [0986.Interval-List-Intersections]({{< relref "/ChapterFour/0986.Interval-List-Intersections.md" >}})
- - [0990.Satisfiability-of-Equality-Equations]({{< relref "/ChapterFour/0990.Satisfiability-of-Equality-Equations.md" >}})
- - [0992.Subarrays-with-K-Different-Integers]({{< relref "/ChapterFour/0992.Subarrays-with-K-Different-Integers.md" >}})
- - [0993.Cousins-in-Binary-Tree]({{< relref "/ChapterFour/0993.Cousins-in-Binary-Tree.md" >}})
- - [0995.Minimum-Number-of-K-Consecutive-Bit-Flips]({{< relref "/ChapterFour/0995.Minimum-Number-of-K-Consecutive-Bit-Flips.md" >}})
- - [0996.Number-of-Squareful-Arrays]({{< relref "/ChapterFour/0996.Number-of-Squareful-Arrays.md" >}})
- - [0999.Available-Captures-for-Rook]({{< relref "/ChapterFour/0999.Available-Captures-for-Rook.md" >}})
- - [1002.Find-Common-Characters]({{< relref "/ChapterFour/1002.Find-Common-Characters.md" >}})
- - [1003.Check-If-Word-Is-Valid-After-Substitutions]({{< relref "/ChapterFour/1003.Check-If-Word-Is-Valid-After-Substitutions.md" >}})
- - [1004.Max-Consecutive-Ones-III]({{< relref "/ChapterFour/1004.Max-Consecutive-Ones-III.md" >}})
- - [1005.Maximize-Sum-Of-Array-After-K-Negations]({{< relref "/ChapterFour/1005.Maximize-Sum-Of-Array-After-K-Negations.md" >}})
- - [1011.Capacity-To-Ship-Packages-Within-D-Days]({{< relref "/ChapterFour/1011.Capacity-To-Ship-Packages-Within-D-Days.md" >}})
- - [1017.Convert-to-Base--2]({{< relref "/ChapterFour/1017.Convert-to-Base--2.md" >}})
- - [1019.Next-Greater-Node-In-Linked-List]({{< relref "/ChapterFour/1019.Next-Greater-Node-In-Linked-List.md" >}})
- - [1020.Number-of-Enclaves]({{< relref "/ChapterFour/1020.Number-of-Enclaves.md" >}})
- - [1021.Remove-Outermost-Parentheses]({{< relref "/ChapterFour/1021.Remove-Outermost-Parentheses.md" >}})
- - [1025.Divisor-Game]({{< relref "/ChapterFour/1025.Divisor-Game.md" >}})
- - [1026.Maximum-Difference-Between-Node-and-Ancestor]({{< relref "/ChapterFour/1026.Maximum-Difference-Between-Node-and-Ancestor.md" >}})
- - [1028.Recover-a-Tree-From-Preorder-Traversal]({{< relref "/ChapterFour/1028.Recover-a-Tree-From-Preorder-Traversal.md" >}})
- - [1030.Matrix-Cells-in-Distance-Order]({{< relref "/ChapterFour/1030.Matrix-Cells-in-Distance-Order.md" >}})
- - [1037.Valid-Boomerang]({{< relref "/ChapterFour/1037.Valid-Boomerang.md" >}})
- - [1040.Moving-Stones-Until-Consecutive-II]({{< relref "/ChapterFour/1040.Moving-Stones-Until-Consecutive-II.md" >}})
- - [1047.Remove-All-Adjacent-Duplicates-In-String]({{< relref "/ChapterFour/1047.Remove-All-Adjacent-Duplicates-In-String.md" >}})
- - [1049.Last-Stone-Weight-II]({{< relref "/ChapterFour/1049.Last-Stone-Weight-II.md" >}})
- - [1051.Height-Checker]({{< relref "/ChapterFour/1051.Height-Checker.md" >}})
- - [1052.Grumpy-Bookstore-Owner]({{< relref "/ChapterFour/1052.Grumpy-Bookstore-Owner.md" >}})
- - [1054.Distant-Barcodes]({{< relref "/ChapterFour/1054.Distant-Barcodes.md" >}})
- - [1073.Adding-Two-Negabinary-Numbers]({{< relref "/ChapterFour/1073.Adding-Two-Negabinary-Numbers.md" >}})
- - [1074.Number-of-Submatrices-That-Sum-to-Target]({{< relref "/ChapterFour/1074.Number-of-Submatrices-That-Sum-to-Target.md" >}})
- - [1078.Occurrences-After-Bigram]({{< relref "/ChapterFour/1078.Occurrences-After-Bigram.md" >}})
- - [1079.Letter-Tile-Possibilities]({{< relref "/ChapterFour/1079.Letter-Tile-Possibilities.md" >}})
- - [1089.Duplicate-Zeros]({{< relref "/ChapterFour/1089.Duplicate-Zeros.md" >}})
- - [1093.Statistics-from-a-Large-Sample]({{< relref "/ChapterFour/1093.Statistics-from-a-Large-Sample.md" >}})
- - [1105.Filling-Bookcase-Shelves]({{< relref "/ChapterFour/1105.Filling-Bookcase-Shelves.md" >}})
- - [1108.Defanging-an-IP-Address]({{< relref "/ChapterFour/1108.Defanging-an-IP-Address.md" >}})
- - [1110.Delete-Nodes-And-Return-Forest]({{< relref "/ChapterFour/1110.Delete-Nodes-And-Return-Forest.md" >}})
- - [1111.Maximum-Nesting-Depth-of-Two-Valid-Parentheses-Strings]({{< relref "/ChapterFour/1111.Maximum-Nesting-Depth-of-Two-Valid-Parentheses-Strings.md" >}})
- - [1122.Relative-Sort-Array]({{< relref "/ChapterFour/1122.Relative-Sort-Array.md" >}})
- - [1123.Lowest-Common-Ancestor-of-Deepest-Leaves]({{< relref "/ChapterFour/1123.Lowest-Common-Ancestor-of-Deepest-Leaves.md" >}})
- - [1128.Number-of-Equivalent-Domino-Pairs]({{< relref "/ChapterFour/1128.Number-of-Equivalent-Domino-Pairs.md" >}})
- - [1137.N-th-Tribonacci-Number]({{< relref "/ChapterFour/1137.N-th-Tribonacci-Number.md" >}})
- - [1145.Binary-Tree-Coloring-Game]({{< relref "/ChapterFour/1145.Binary-Tree-Coloring-Game.md" >}})
- - [1154.Day-of-the-Year]({{< relref "/ChapterFour/1154.Day-of-the-Year.md" >}})
- - [1157.Online-Majority-Element-In-Subarray]({{< relref "/ChapterFour/1157.Online-Majority-Element-In-Subarray.md" >}})
- - [1160.Find-Words-That-Can-Be-Formed-by-Characters]({{< relref "/ChapterFour/1160.Find-Words-That-Can-Be-Formed-by-Characters.md" >}})
- - [1170.Compare-Strings-by-Frequency-of-the-Smallest-Character]({{< relref "/ChapterFour/1170.Compare-Strings-by-Frequency-of-the-Smallest-Character.md" >}})
- - [1171.Remove-Zero-Sum-Consecutive-Nodes-from-Linked-List]({{< relref "/ChapterFour/1171.Remove-Zero-Sum-Consecutive-Nodes-from-Linked-List.md" >}})
- - [1175.Prime-Arrangements]({{< relref "/ChapterFour/1175.Prime-Arrangements.md" >}})
- - [1184.Distance-Between-Bus-Stops]({{< relref "/ChapterFour/1184.Distance-Between-Bus-Stops.md" >}})
- - [1185.Day-of-the-Week]({{< relref "/ChapterFour/1185.Day-of-the-Week.md" >}})
- - [1189.Maximum-Number-of-Balloons]({{< relref "/ChapterFour/1189.Maximum-Number-of-Balloons.md" >}})
- - [1200.Minimum-Absolute-Difference]({{< relref "/ChapterFour/1200.Minimum-Absolute-Difference.md" >}})
- - [1201.Ugly-Number-III]({{< relref "/ChapterFour/1201.Ugly-Number-III.md" >}})
- - [1202.Smallest-String-With-Swaps]({{< relref "/ChapterFour/1202.Smallest-String-With-Swaps.md" >}})
- - [1207.Unique-Number-of-Occurrences]({{< relref "/ChapterFour/1207.Unique-Number-of-Occurrences.md" >}})
- - [1208.Get-Equal-Substrings-Within-Budget]({{< relref "/ChapterFour/1208.Get-Equal-Substrings-Within-Budget.md" >}})
- - [1217.Play-with-Chips]({{< relref "/ChapterFour/1217.Play-with-Chips.md" >}})
- - [1221.Split-a-String-in-Balanced-Strings]({{< relref "/ChapterFour/1221.Split-a-String-in-Balanced-Strings.md" >}})
- - [1232.Check-If-It-Is-a-Straight-Line]({{< relref "/ChapterFour/1232.Check-If-It-Is-a-Straight-Line.md" >}})
- - [1234.Replace-the-Substring-for-Balanced-String]({{< relref "/ChapterFour/1234.Replace-the-Substring-for-Balanced-String.md" >}})
- - [1235.Maximum-Profit-in-Job-Scheduling]({{< relref "/ChapterFour/1235.Maximum-Profit-in-Job-Scheduling.md" >}})
- - [1252.Cells-with-Odd-Values-in-a-Matrix]({{< relref "/ChapterFour/1252.Cells-with-Odd-Values-in-a-Matrix.md" >}})
- - [1254.Number-of-Closed-Islands]({{< relref "/ChapterFour/1254.Number-of-Closed-Islands.md" >}})
- - [1260.Shift-2D-Grid]({{< relref "/ChapterFour/1260.Shift-2D-Grid.md" >}})
- - [1266.Minimum-Time-Visiting-All-Points]({{< relref "/ChapterFour/1266.Minimum-Time-Visiting-All-Points.md" >}})
- - [1275.Find-Winner-on-a-Tic-Tac-Toe-Game]({{< relref "/ChapterFour/1275.Find-Winner-on-a-Tic-Tac-Toe-Game.md" >}})
- - [1281.Subtract-the-Product-and-Sum-of-Digits-of-an-Integer]({{< relref "/ChapterFour/1281.Subtract-the-Product-and-Sum-of-Digits-of-an-Integer.md" >}})
- - [1283.Find-the-Smallest-Divisor-Given-a-Threshold]({{< relref "/ChapterFour/1283.Find-the-Smallest-Divisor-Given-a-Threshold.md" >}})
- - [1287.Element-Appearing-More-Than-25-In-Sorted-Array]({{< relref "/ChapterFour/1287.Element-Appearing-More-Than-25-In-Sorted-Array.md" >}})
- - [1290.Convert-Binary-Number-in-a-Linked-List-to-Integer]({{< relref "/ChapterFour/1290.Convert-Binary-Number-in-a-Linked-List-to-Integer.md" >}})
- - [1295.Find-Numbers-with-Even-Number-of-Digits]({{< relref "/ChapterFour/1295.Find-Numbers-with-Even-Number-of-Digits.md" >}})
- - [1299.Replace-Elements-with-Greatest-Element-on-Right-Side]({{< relref "/ChapterFour/1299.Replace-Elements-with-Greatest-Element-on-Right-Side.md" >}})
- - [1300.Sum-of-Mutated-Array-Closest-to-Target]({{< relref "/ChapterFour/1300.Sum-of-Mutated-Array-Closest-to-Target.md" >}})
- - [1302.Deepest-Leaves-Sum]({{< relref "/ChapterFour/1302.Deepest-Leaves-Sum.md" >}})
- - [1304.Find-N-Unique-Integers-Sum-up-to-Zero]({{< relref "/ChapterFour/1304.Find-N-Unique-Integers-Sum-up-to-Zero.md" >}})
- - [1305.All-Elements-in-Two-Binary-Search-Trees]({{< relref "/ChapterFour/1305.All-Elements-in-Two-Binary-Search-Trees.md" >}})
- - [1306.Jump-Game-III]({{< relref "/ChapterFour/1306.Jump-Game-III.md" >}})
- - [1313.Decompress-Run-Length-Encoded-List]({{< relref "/ChapterFour/1313.Decompress-Run-Length-Encoded-List.md" >}})
- - [1317.Convert-Integer-to-the-Sum-of-Two-No-Zero-Integers]({{< relref "/ChapterFour/1317.Convert-Integer-to-the-Sum-of-Two-No-Zero-Integers.md" >}})
- - [1380.Lucky-Numbers-in-a-Matrix]({{< relref "/ChapterFour/1380.Lucky-Numbers-in-a-Matrix.md" >}})
- - [1385.Find-the-Distance-Value-Between-Two-Arrays]({{< relref "/ChapterFour/1385.Find-the-Distance-Value-Between-Two-Arrays.md" >}})
- - [1389.Create-Target-Array-in-the-Given-Order]({{< relref "/ChapterFour/1389.Create-Target-Array-in-the-Given-Order.md" >}})
- - [1455.Check-If-a-Word-Occurs-As-a-Prefix-of-Any-Word-in-a-Sentence]({{< relref "/ChapterFour/1455.Check-If-a-Word-Occurs-As-a-Prefix-of-Any-Word-in-a-Sentence.md" >}})
- - [1464.Maximum-Product-of-Two-Elements-in-an-Array]({{< relref "/ChapterFour/1464.Maximum-Product-of-Two-Elements-in-an-Array.md" >}})
- - [1470.Shuffle-the-Array]({{< relref "/ChapterFour/1470.Shuffle-the-Array.md" >}})
-<br />
diff --git a/website/resources/_gen/assets/scss/leetcode/book.scss_50fc8c04e12a2f59027287995557ceff.content b/website/resources/_gen/assets/scss/leetcode/book.scss_50fc8c04e12a2f59027287995557ceff.content
index 03259f330..a30d53838 100644
--- a/website/resources/_gen/assets/scss/leetcode/book.scss_50fc8c04e12a2f59027287995557ceff.content
+++ b/website/resources/_gen/assets/scss/leetcode/book.scss_50fc8c04e12a2f59027287995557ceff.content
@@ -1 +1 @@
-@charset "UTF-8";/*!normalize.css v8.0.1 | MIT License | github.com/necolas/normalize.css*/html{line-height:1.15;-webkit-text-size-adjust:100%}body{margin:0}main{display:block}h1{font-size:2em;margin:.67em 0}hr{box-sizing:content-box;height:0;overflow:visible}pre{font-family:monospace,monospace;font-size:1em}a{background-color:transparent}abbr[title]{border-bottom:none;text-decoration:underline;text-decoration:underline dotted}b,strong{font-weight:bolder}code,kbd,samp{font-family:monospace,monospace;font-size:1em}small{font-size:80%}sub,sup{font-size:75%;line-height:0;position:relative;vertical-align:baseline}sub{bottom:-.25em}sup{top:-.5em}img{border-style:none}button,input,optgroup,select,textarea{font-family:inherit;font-size:100%;line-height:1.15;margin:0}button,input{overflow:visible}button,select{text-transform:none}button,[type=button],[type=reset],[type=submit]{-webkit-appearance:button}button::-moz-focus-inner,[type=button]::-moz-focus-inner,[type=reset]::-moz-focus-inner,[type=submit]::-moz-focus-inner{border-style:none;padding:0}button:-moz-focusring,[type=button]:-moz-focusring,[type=reset]:-moz-focusring,[type=submit]:-moz-focusring{outline:1px dotted ButtonText}fieldset{padding:.35em .75em .625em}legend{box-sizing:border-box;color:inherit;display:table;max-width:100%;padding:0;white-space:normal}progress{vertical-align:baseline}textarea{overflow:auto}[type=checkbox],[type=radio]{box-sizing:border-box;padding:0}[type=number]::-webkit-inner-spin-button,[type=number]::-webkit-outer-spin-button{height:auto}[type=search]{-webkit-appearance:textfield;outline-offset:-2px}[type=search]::-webkit-search-decoration{-webkit-appearance:none}::-webkit-file-upload-button{-webkit-appearance:button;font:inherit}details{display:block}summary{display:list-item}template{display:none}[hidden]{display:none}.flex{display:flex}.flex-auto{flex:1 1 auto}.flex-even{flex:1 1}.flex-wrap{flex-wrap:wrap}.justify-start{justify-content:flex-start}.justify-end{justify-content:flex-end}.justify-center{justify-content:center}.justify-between{justify-content:space-between}.align-center{align-items:center}.mx-auto{margin:0 auto}.text-center{text-align:center}.text-left{text-align:left}.text-right{text-align:right}.hidden{display:none}input.toggle{height:0;width:0;overflow:hidden;opacity:0;position:absolute}.clearfix::after{content:"";display:table;clear:both}html{font-size:16px;scroll-behavior:smooth;touch-action:manipulation}body{min-width:20rem;color:var(--body-font-color);background:var(--body-background);letter-spacing:.33px;font-weight:400;text-rendering:optimizeLegibility;-webkit-font-smoothing:antialiased;-moz-osx-font-smoothing:grayscale;box-sizing:border-box}body *{box-sizing:inherit}h1,h2,h3,h4,h5{font-weight:400}a{text-decoration:none;color:var(--color-link)}img{vertical-align:baseline}:focus{outline-style:auto;outline-color:currentColor;outline-color:-webkit-focus-ring-color}aside nav ul{padding:0;margin:0;list-style:none}aside nav ul li{margin:1em 0;position:relative}aside nav ul a{display:block}aside nav ul a:hover{opacity:.5}aside nav ul ul{padding-inline-start:1rem}ul.pagination{display:flex;justify-content:center;list-style-type:none}ul.pagination .page-item a{padding:1rem}.container{max-width:80rem;margin:0 auto}.book-icon{filter:var(--icon-filter)}.book-brand{margin-top:0}.book-brand img{height:1.5em;width:auto;vertical-align:middle;margin-inline-end:.5rem}.book-menu{flex:0 0 16rem;font-size:.875rem}.book-menu nav{width:16rem;padding:1rem;background:var(--body-background);position:fixed;top:0;bottom:0;overflow-x:hidden;overflow-y:auto}.book-menu a{color:inherit;word-wrap:break-word}.book-menu a.active{color:var(--color-link)}.book-menu a.collapsed{display:flex;justify-content:space-between}.book-menu a.collapsed::after{content:"▸"}.book-section-flat{margin-bottom:2rem}.book-section-flat:not(:first-child){margin-top:2rem}.book-section-flat>a,.book-section-flat>span{font-weight:bolder}.book-section-flat>ul{padding-inline-start:0}.book-page{min-width:20rem;flex-grow:1;padding:1rem}.book-post{margin-bottom:3rem}.book-header{display:none;margin-bottom:1rem}.book-header label{line-height:0}.book-search{position:relative;margin:1rem 0;border-bottom:1px solid transparent}.book-search input{width:100%;padding:.5rem;border:0;border-radius:.25rem;background:var(--gray-100);color:var(--body-font-color)}.book-search input:required+.book-search-spinner{display:block}.book-search .book-search-spinner{position:absolute;top:0;margin:.5rem;margin-inline-start:calc(100% - 1.5rem);width:1rem;height:1rem;border:1px solid transparent;border-top-color:var(--body-font-color);border-radius:50%;animation:spin 1s ease infinite}@keyframes spin{100%{transform:rotate(360deg)}}.book-search small{opacity:.5}.book-toc{flex:0 0 16rem;font-size:.75rem}.book-toc nav{width:16rem;padding:1rem;position:fixed;top:0;bottom:0;overflow-x:hidden;overflow-y:auto}.book-toc img{height:1em}.book-toc nav>ul>li:first-child{margin-top:0}.book-footer{padding-top:1rem;font-size:.875rem}.book-footer img{height:1em;margin-inline-end:.5rem}.book-comments{margin-top:1rem}.book-languages{position:relative;overflow:visible;padding:1rem;margin:-1rem}.book-languages ul{margin:0;padding:0;list-style:none}.book-languages ul li{white-space:nowrap;cursor:pointer}.book-languages:hover .book-languages-list,.book-languages:focus .book-languages-list,.book-languages:focus-within .book-languages-list{display:block}.book-languages .book-languages-list{display:none;position:absolute;bottom:100%;left:0;padding:.5rem 0;background:var(--body-background);box-shadow:0 0 .25rem rgba(0,0,0,.1)}.book-languages .book-languages-list li img{opacity:.25}.book-languages .book-languages-list li.active img,.book-languages .book-languages-list li:hover img{opacity:initial}.book-languages .book-languages-list a{color:inherit;padding:.5rem 1rem}.book-home{padding:1rem}aside nav,.book-page,.book-header aside,.markdown{transition:.2s ease-in-out;transition-property:transform,margin,opacity,visibility;will-change:transform,margin,opacity}@media screen and (max-width:56rem){#menu-control,#toc-control{display:inline}.book-menu{visibility:hidden;margin-inline-start:-16rem;font-size:16px;z-index:1}.book-toc{display:none}.book-header{display:block}#menu-control:focus~main label[for=menu-control]{outline-style:auto;outline-color:currentColor;outline-color:-webkit-focus-ring-color}#menu-control:checked~main .book-menu{visibility:initial}#menu-control:checked~main .book-menu nav{transform:translateX(16rem);box-shadow:0 0 .5rem rgba(0,0,0,.1)}#menu-control:checked~main .book-page{opacity:.25}#menu-control:checked~main .book-menu-overlay{display:block;position:absolute;top:0;bottom:0;left:0;right:0}#toc-control:focus~main label[for=toc-control]{outline-style:auto;outline-color:currentColor;outline-color:-webkit-focus-ring-color}#toc-control:checked~main .book-header aside{display:block}body[dir=rtl] #menu-control:checked+main .book-menu nav{transform:translateX(-16rem)}}@media screen and (min-width:80rem){.book-page,.book-menu nav,.book-toc nav{padding:2rem 1rem}}@font-face{font-family:roboto;font-style:italic;font-weight:300;font-display:swap;src:local("Roboto Light Italic"),local("Roboto-LightItalic"),url(fonts/roboto-v19-latin-300italic.woff2)format("woff2"),url(fonts/roboto-v19-latin-300italic.woff)format("woff")}@font-face{font-family:roboto;font-style:normal;font-weight:400;font-display:swap;src:local("Roboto"),local("Roboto-Regular"),url(fonts/roboto-v19-latin-regular.woff2)format("woff2"),url(fonts/roboto-v19-latin-regular.woff)format("woff")}@font-face{font-family:roboto;font-style:normal;font-weight:700;font-display:swap;src:local("Roboto Bold"),local("Roboto-Bold"),url(fonts/roboto-v19-latin-700.woff2)format("woff2"),url(fonts/roboto-v19-latin-700.woff)format("woff")}@font-face{font-family:roboto mono;font-style:normal;font-weight:400;font-display:swap;src:local("Roboto Mono"),local("RobotoMono-Regular"),url(fonts/roboto-mono-v6-latin-regular.woff2)format("woff2"),url(fonts/roboto-mono-v6-latin-regular.woff)format("woff")}body{font-family:roboto,sans-serif}code{font-family:roboto mono,monospace}@media print{.book-menu,.book-footer,.book-toc{display:none}.book-header,.book-header aside{display:block}main{display:block!important}}.markdown{line-height:1.6}.markdown>:first-child{margin-top:0}.markdown h1,.markdown h2,.markdown h3,.markdown h4,.markdown h5,.markdown h6{font-weight:400;line-height:1;margin-top:1.5em;margin-bottom:1rem}.markdown h1 a.anchor,.markdown h2 a.anchor,.markdown h3 a.anchor,.markdown h4 a.anchor,.markdown h5 a.anchor,.markdown h6 a.anchor{opacity:0;font-size:.75em;vertical-align:middle;text-decoration:none}.markdown h1:hover a.anchor,.markdown h1 a.anchor:focus,.markdown h2:hover a.anchor,.markdown h2 a.anchor:focus,.markdown h3:hover a.anchor,.markdown h3 a.anchor:focus,.markdown h4:hover a.anchor,.markdown h4 a.anchor:focus,.markdown h5:hover a.anchor,.markdown h5 a.anchor:focus,.markdown h6:hover a.anchor,.markdown h6 a.anchor:focus{opacity:initial}.markdown h4,.markdown h5,.markdown h6{font-weight:bolder}.markdown h5{font-size:.875em}.markdown h6{font-size:.75em}.markdown b,.markdown optgroup,.markdown strong{font-weight:bolder}.markdown a{text-decoration:none}.markdown a:hover{text-decoration:underline}.markdown a:visited{color:var(--color-visited-link)}.markdown img{max-width:100%}.markdown code{padding:0 .25rem;background:var(--gray-200);border-radius:.25rem;font-size:.875em}.markdown pre{padding:1rem;background:var(--gray-100);border-radius:.25rem;overflow-x:auto}.markdown pre code{padding:0;background:0 0}.markdown blockquote{margin:1rem 0;padding:.5rem 1rem .5rem .75rem;border-inline-start:.25rem solid var(--gray-200);border-radius:.25rem}.markdown blockquote :first-child{margin-top:0}.markdown blockquote :last-child{margin-bottom:0}.markdown table{overflow:auto;display:block;border-spacing:0;border-collapse:collapse;margin-top:1rem;margin-bottom:1rem}.markdown table tr th,.markdown table tr td{padding:.5rem 1rem;border:1px solid var(--gray-200)}.markdown table tr:nth-child(2n){background:var(--gray-100)}.markdown hr{height:1px;border:none;background:var(--gray-200)}.markdown ul,.markdown ol{padding-inline-start:2rem}.markdown dl dt{font-weight:bolder;margin-top:1rem}.markdown dl dd{margin-inline-start:1rem;margin-bottom:1rem}.markdown .highlight table tr td:nth-child(1) pre{margin:0;padding-inline-end:0}.markdown .highlight table tr td:nth-child(2) pre{margin:0;padding-inline-start:0}.markdown details{padding:1rem;border:1px solid var(--gray-200);border-radius:.25rem}.markdown details summary{line-height:1;padding:1rem;margin:-1rem;cursor:pointer}.markdown details[open] summary{margin-bottom:0}.markdown figure{margin:1rem 0}.markdown figure figcaption p{margin-top:0}.markdown-inner>:first-child{margin-top:0}.markdown-inner>:last-child{margin-bottom:0}.markdown .book-expand{margin-top:1rem;margin-bottom:1rem;border:1px solid var(--gray-200);border-radius:.25rem;overflow:hidden}.markdown .book-expand .book-expand-head{background:var(--gray-100);padding:.5rem 1rem;cursor:pointer}.markdown .book-expand .book-expand-content{display:none;padding:1rem}.markdown .book-expand input[type=checkbox]:checked+.book-expand-content{display:block}.markdown .book-tabs{margin-top:1rem;margin-bottom:1rem;border:1px solid var(--gray-200);border-radius:.25rem;overflow:hidden;display:flex;flex-wrap:wrap}.markdown .book-tabs label{display:inline-block;padding:.5rem 1rem;border-bottom:1px transparent;cursor:pointer}.markdown .book-tabs .book-tabs-content{order:999;width:100%;border-top:1px solid var(--gray-100);padding:1rem;display:none}.markdown .book-tabs input[type=radio]:checked+label{border-bottom:1px solid var(--color-link)}.markdown .book-tabs input[type=radio]:checked+label+.book-tabs-content{display:block}.markdown .book-tabs input[type=radio]:focus+label{outline-style:auto;outline-color:currentColor;outline-color:-webkit-focus-ring-color}.markdown .book-columns{margin-left:-1rem;margin-right:-1rem}.markdown .book-columns>div{margin:1rem 0;min-width:10rem;padding:0 1rem}.markdown a.book-btn{display:inline-block;font-size:.875rem;color:var(--color-link);line-height:2rem;padding:0 1rem;border:1px solid var(--color-link);border-radius:.25rem;cursor:pointer}.markdown a.book-btn:hover{text-decoration:none}.markdown .book-hint.info{border-color:#6bf;background-color:rgba(102,187,255,.1)}.markdown .book-hint.warning{border-color:#fd6;background-color:rgba(255,221,102,.1)}.markdown .book-hint.danger{border-color:#f66;background-color:rgba(255,102,102,.1)}.js-toggle-wrapper{display:table;margin:1rem 0 0 5px;flex:1}.js-toggle{touch-action:pan-x;display:inline-block;position:relative;cursor:pointer;background-color:transparent;border:0;padding:0;-webkit-touch-callout:none;user-select:none;-webkit-tap-highlight-color:transparent;-webkit-tap-highlight-color:transparent}.js-toggle-screenreader-only{border:0;clip:rect(0 0 0 0);height:1px;margin:-1px;overflow:hidden;padding:0;position:absolute;width:1px}.js-toggle-track{width:60px;height:34px;padding:0;transition:all .2s ease}.js-toggle-track-check{position:absolute;width:17px;height:17px;left:5px;top:0;bottom:0;margin-top:auto;margin-bottom:auto;line-height:0;opacity:0;transition:opacity .25s ease}.js-toggle--checked .js-toggle-track-check{opacity:1;transition:opacity .25s ease}.js-toggle-track-x{position:absolute;width:17px;height:17px;right:5px;top:0;bottom:0;margin-top:auto;margin-bottom:auto;line-height:0;opacity:1;transition:opacity .25s ease}.js-toggle--checked .js-toggle-track-x{opacity:0}.js-toggle-thumb{position:absolute;top:1px;left:1px;width:30px;height:32px;box-sizing:border-box;transition:all .5s cubic-bezier(0.23,1,0.32,1)0ms;transform:translateX(0)}.js-toggle--checked .js-toggle-thumb{transform:translateX(26px);border-color:#19ab27}.magic{display:flex}body.dark-mode,body.dark-mode main *{background:#2d2d2d;color:#f5f5f5}[data-theme=dark]{--gray-100: rgba(255, 255, 255, 0.1);--gray-200: rgba(255, 255, 255, 0.2);--body-background: #343a40;--body-font-color: #e9ecef;--color-link: #84b2ff;--color-visited-link: #b88dff;--icon-filter: brightness(0) invert(1)}[data-theme=light]{--gray-100: #f8f9fa;--gray-200: #e9ecef;--body-background: white;--body-font-color: black;--color-link: #05b;--color-visited-link: #8440f1;--icon-filter: none}
\ No newline at end of file
+@charset "UTF-8";:root{--gray-100: #f8f9fa;--gray-200: #e9ecef;--gray-500: #adb5bd;--color-link: #0055bb;--color-visited-link: #8440f1;--body-background: white;--body-font-color: black;--icon-filter: none;--hint-color-info: #6bf;--hint-color-warning: #fd6;--hint-color-danger: #f66}/*!normalize.css v8.0.1 | MIT License | github.com/necolas/normalize.css*/html{line-height:1.15;-webkit-text-size-adjust:100%}body{margin:0}main{display:block}h1{font-size:2em;margin:.67em 0}hr{box-sizing:content-box;height:0;overflow:visible}pre{font-family:monospace,monospace;font-size:1em}a{background-color:transparent}abbr[title]{border-bottom:none;text-decoration:underline;text-decoration:underline dotted}b,strong{font-weight:bolder}code,kbd,samp{font-family:monospace,monospace;font-size:1em}small{font-size:80%}sub,sup{font-size:75%;line-height:0;position:relative;vertical-align:baseline}sub{bottom:-.25em}sup{top:-.5em}img{border-style:none}button,input,optgroup,select,textarea{font-family:inherit;font-size:100%;line-height:1.15;margin:0}button,input{overflow:visible}button,select{text-transform:none}button,[type=button],[type=reset],[type=submit]{-webkit-appearance:button}button::-moz-focus-inner,[type=button]::-moz-focus-inner,[type=reset]::-moz-focus-inner,[type=submit]::-moz-focus-inner{border-style:none;padding:0}button:-moz-focusring,[type=button]:-moz-focusring,[type=reset]:-moz-focusring,[type=submit]:-moz-focusring{outline:1px dotted ButtonText}fieldset{padding:.35em .75em .625em}legend{box-sizing:border-box;color:inherit;display:table;max-width:100%;padding:0;white-space:normal}progress{vertical-align:baseline}textarea{overflow:auto}[type=checkbox],[type=radio]{box-sizing:border-box;padding:0}[type=number]::-webkit-inner-spin-button,[type=number]::-webkit-outer-spin-button{height:auto}[type=search]{-webkit-appearance:textfield;outline-offset:-2px}[type=search]::-webkit-search-decoration{-webkit-appearance:none}::-webkit-file-upload-button{-webkit-appearance:button;font:inherit}details{display:block}summary{display:list-item}template{display:none}[hidden]{display:none}.flex{display:flex}.flex-auto{flex:1 1 auto}.flex-even{flex:1 1}.flex-wrap{flex-wrap:wrap}.justify-start{justify-content:flex-start}.justify-end{justify-content:flex-end}.justify-center{justify-content:center}.justify-between{justify-content:space-between}.align-center{align-items:center}.mx-auto{margin:0 auto}.text-center{text-align:center}.text-left{text-align:left}.text-right{text-align:right}.hidden{display:none}input.toggle{height:0;width:0;overflow:hidden;opacity:0;position:absolute}.clearfix::after{content:"";display:table;clear:both}html{font-size:16px;scroll-behavior:smooth;touch-action:manipulation}body{min-width:20rem;color:var(--body-font-color);background:var(--body-background);letter-spacing:.33px;font-weight:400;text-rendering:optimizeLegibility;-webkit-font-smoothing:antialiased;-moz-osx-font-smoothing:grayscale;box-sizing:border-box}body *{box-sizing:inherit}h1,h2,h3,h4,h5{font-weight:400}a{text-decoration:none;color:var(--color-link)}img{vertical-align:baseline}:focus{outline-style:auto;outline-color:currentColor;outline-color:-webkit-focus-ring-color}aside nav ul{padding:0;margin:0;list-style:none}aside nav ul li{margin:1em 0;position:relative}aside nav ul a{display:block}aside nav ul a:hover{opacity:.5}aside nav ul ul{padding-inline-start:1rem}ul.pagination{display:flex;justify-content:center;list-style-type:none}ul.pagination .page-item a{padding:1rem}.container{max-width:80rem;margin:0 auto}.book-icon{filter:var(--icon-filter)}.book-brand{margin-top:0}.book-brand img{height:1.5em;width:auto;vertical-align:middle;margin-inline-end:.5rem}.book-menu{flex:0 0 16rem;font-size:.875rem}.book-menu .book-menu-content{width:16rem;padding:1rem;background:var(--body-background);position:fixed;top:0;bottom:0;overflow-x:hidden;overflow-y:auto}.book-menu a,.book-menu label{color:inherit;cursor:pointer;word-wrap:break-word}.book-menu a.active{color:var(--color-link)}.book-menu input.toggle+label+ul{display:none}.book-menu input.toggle:checked+label+ul{display:block}.book-menu input.toggle+label::after{content:"▸"}.book-menu input.toggle:checked+label::after{content:"▾"}.book-section-flat{margin-bottom:2rem}.book-section-flat:not(:first-child){margin-top:2rem}.book-section-flat>a,.book-section-flat>span,.book-section-flat>label{font-weight:bolder}.book-section-flat>ul{padding-inline-start:0}.book-page{min-width:20rem;flex-grow:1;padding:1rem}.book-post{margin-bottom:3rem}.book-header{display:none;margin-bottom:1rem}.book-header label{line-height:0}.book-search{position:relative;margin:1rem 0;border-bottom:1px solid transparent}.book-search input{width:100%;padding:.5rem;border:0;border-radius:.25rem;background:var(--gray-100);color:var(--body-font-color)}.book-search input:required+.book-search-spinner{display:block}.book-search .book-search-spinner{position:absolute;top:0;margin:.5rem;margin-inline-start:calc(100% - 1.5rem);width:1rem;height:1rem;border:1px solid transparent;border-top-color:var(--body-font-color);border-radius:50%;animation:spin 1s ease infinite}@keyframes spin{100%{transform:rotate(360deg)}}.book-search small{opacity:.5}.book-toc{font-size:.75rem}.book-toc .book-toc-content{width:16rem;padding:1rem;position:fixed;top:0;bottom:0;overflow-x:hidden;overflow-y:auto}.book-toc img{height:1em}.book-toc nav>ul>li:first-child{margin-top:0}.book-footer{padding-top:1rem;font-size:.875rem}.book-footer img{height:1em;margin-inline-end:.5rem}.book-comments{margin-top:1rem}.book-languages{position:relative;overflow:visible;padding:1rem;margin:-1rem}.book-languages ul{margin:0;padding:0;list-style:none}.book-languages ul li{white-space:nowrap;cursor:pointer}.book-languages:hover .book-languages-list,.book-languages:focus .book-languages-list,.book-languages:focus-within .book-languages-list{display:block}.book-languages .book-languages-list{display:none;position:absolute;bottom:100%;left:0;padding:.5rem 0;background:var(--body-background);box-shadow:0 0 .25rem rgba(0,0,0,.1)}.book-languages .book-languages-list li img{opacity:.25}.book-languages .book-languages-list li.active img,.book-languages .book-languages-list li:hover img{opacity:initial}.book-languages .book-languages-list a{color:inherit;padding:.5rem 1rem}.book-home{padding:1rem}.book-menu-content,.book-toc-content,.book-page,.book-header aside,.markdown{transition:.2s ease-in-out;transition-property:transform,margin,opacity,visibility;will-change:transform,margin,opacity}@media screen and (max-width:56rem){#menu-control,#toc-control{display:inline}.book-menu{visibility:hidden;margin-inline-start:-16rem;font-size:16px;z-index:1}.book-toc{display:none}.book-header{display:block}#menu-control:focus~main label[for=menu-control]{outline-style:auto;outline-color:currentColor;outline-color:-webkit-focus-ring-color}#menu-control:checked~main .book-menu{visibility:initial}#menu-control:checked~main .book-menu .book-menu-content{transform:translateX(16rem);box-shadow:0 0 .5rem rgba(0,0,0,.1)}#menu-control:checked~main .book-page{opacity:.25}#menu-control:checked~main .book-menu-overlay{display:block;position:absolute;top:0;bottom:0;left:0;right:0}#toc-control:focus~main label[for=toc-control]{outline-style:auto;outline-color:currentColor;outline-color:-webkit-focus-ring-color}#toc-control:checked~main .book-header aside{display:block}body[dir=rtl] #menu-control:checked+main .book-menu .book-menu-content{transform:translateX(-16rem)}}@media screen and (min-width:80rem){.book-page,.book-menu .book-menu-content,.book-toc .book-toc-content{padding:2rem 1rem}}@font-face{font-family:roboto;font-style:italic;font-weight:300;font-display:swap;src:local("Roboto Light Italic"),local("Roboto-LightItalic"),url(fonts/roboto-v19-latin-300italic.woff2)format("woff2"),url(fonts/roboto-v19-latin-300italic.woff)format("woff")}@font-face{font-family:roboto;font-style:normal;font-weight:400;font-display:swap;src:local("Roboto"),local("Roboto-Regular"),url(fonts/roboto-v19-latin-regular.woff2)format("woff2"),url(fonts/roboto-v19-latin-regular.woff)format("woff")}@font-face{font-family:roboto;font-style:normal;font-weight:700;font-display:swap;src:local("Roboto Bold"),local("Roboto-Bold"),url(fonts/roboto-v19-latin-700.woff2)format("woff2"),url(fonts/roboto-v19-latin-700.woff)format("woff")}@font-face{font-family:roboto mono;font-style:normal;font-weight:400;font-display:swap;src:local("Roboto Mono"),local("RobotoMono-Regular"),url(fonts/roboto-mono-v6-latin-regular.woff2)format("woff2"),url(fonts/roboto-mono-v6-latin-regular.woff)format("woff")}body{font-family:roboto,sans-serif}code{font-family:roboto mono,monospace}@media print{.book-menu,.book-footer,.book-toc{display:none}.book-header,.book-header aside{display:block}main{display:block!important}}.markdown{line-height:1.6}.markdown>:first-child{margin-top:0}.markdown h1,.markdown h2,.markdown h3,.markdown h4,.markdown h5,.markdown h6{font-weight:400;line-height:1;margin-top:1.5em;margin-bottom:1rem}.markdown h1 a.anchor,.markdown h2 a.anchor,.markdown h3 a.anchor,.markdown h4 a.anchor,.markdown h5 a.anchor,.markdown h6 a.anchor{opacity:0;font-size:.75em;vertical-align:middle;text-decoration:none}.markdown h1:hover a.anchor,.markdown h1 a.anchor:focus,.markdown h2:hover a.anchor,.markdown h2 a.anchor:focus,.markdown h3:hover a.anchor,.markdown h3 a.anchor:focus,.markdown h4:hover a.anchor,.markdown h4 a.anchor:focus,.markdown h5:hover a.anchor,.markdown h5 a.anchor:focus,.markdown h6:hover a.anchor,.markdown h6 a.anchor:focus{opacity:initial}.markdown h4,.markdown h5,.markdown h6{font-weight:bolder}.markdown h5{font-size:.875em}.markdown h6{font-size:.75em}.markdown b,.markdown optgroup,.markdown strong{font-weight:bolder}.markdown a{text-decoration:none}.markdown a:hover{text-decoration:underline}.markdown a:visited{color:var(--color-visited-link)}.markdown img{max-width:100%}.markdown code{padding:0 .25rem;background:var(--gray-200);border-radius:.25rem;font-size:.875em}.markdown pre{padding:1rem;background:var(--gray-100);border-radius:.25rem;overflow-x:auto}.markdown pre code{padding:0;background:0 0}.markdown blockquote{margin:1rem 0;padding:.5rem 1rem .5rem .75rem;border-inline-start:.25rem solid var(--gray-200);border-radius:.25rem}.markdown blockquote :first-child{margin-top:0}.markdown blockquote :last-child{margin-bottom:0}.markdown table{overflow:auto;display:block;border-spacing:0;border-collapse:collapse;margin-top:1rem;margin-bottom:1rem}.markdown table tr th,.markdown table tr td{padding:.5rem 1rem;border:1px solid var(--gray-200)}.markdown table tr:nth-child(2n){background:var(--gray-100)}.markdown hr{height:1px;border:none;background:var(--gray-200)}.markdown ul,.markdown ol{padding-inline-start:2rem}.markdown dl dt{font-weight:bolder;margin-top:1rem}.markdown dl dd{margin-inline-start:1rem;margin-bottom:1rem}.markdown .highlight table tr td:nth-child(1) pre{margin:0;padding-inline-end:0}.markdown .highlight table tr td:nth-child(2) pre{margin:0;padding-inline-start:0}.markdown details{padding:1rem;border:1px solid var(--gray-200);border-radius:.25rem}.markdown details summary{line-height:1;padding:1rem;margin:-1rem;cursor:pointer}.markdown details[open] summary{margin-bottom:0}.markdown figure{margin:1rem 0}.markdown figure figcaption p{margin-top:0}.markdown-inner>:first-child{margin-top:0}.markdown-inner>:last-child{margin-bottom:0}.markdown .book-expand{margin-top:1rem;margin-bottom:1rem;border:1px solid var(--gray-200);border-radius:.25rem;overflow:hidden}.markdown .book-expand .book-expand-head{background:var(--gray-100);padding:.5rem 1rem;cursor:pointer}.markdown .book-expand .book-expand-content{display:none;padding:1rem}.markdown .book-expand input[type=checkbox]:checked+.book-expand-content{display:block}.markdown .book-tabs{margin-top:1rem;margin-bottom:1rem;border:1px solid var(--gray-200);border-radius:.25rem;overflow:hidden;display:flex;flex-wrap:wrap}.markdown .book-tabs label{display:inline-block;padding:.5rem 1rem;border-bottom:1px transparent;cursor:pointer}.markdown .book-tabs .book-tabs-content{order:999;width:100%;border-top:1px solid var(--gray-100);padding:1rem;display:none}.markdown .book-tabs input[type=radio]:checked+label{border-bottom:1px solid var(--color-link)}.markdown .book-tabs input[type=radio]:checked+label+.book-tabs-content{display:block}.markdown .book-tabs input[type=radio]:focus+label{outline-style:auto;outline-color:currentColor;outline-color:-webkit-focus-ring-color}.markdown .book-columns{margin-left:-1rem;margin-right:-1rem}.markdown .book-columns>div{margin:1rem 0;min-width:10rem;padding:0 1rem}.markdown a.book-btn{display:inline-block;font-size:.875rem;color:var(--color-link);line-height:2rem;padding:0 1rem;border:1px solid var(--color-link);border-radius:.25rem;cursor:pointer}.markdown a.book-btn:hover{text-decoration:none}.markdown .book-hint.info{border-color:#6bf;background-color:rgba(102,187,255,.1)}.markdown .book-hint.warning{border-color:#fd6;background-color:rgba(255,221,102,.1)}.markdown .book-hint.danger{border-color:#f66;background-color:rgba(255,102,102,.1)}.js-toggle-wrapper{display:table;margin:1rem 0 0 5px;flex:1}.js-toggle{touch-action:pan-x;display:inline-block;position:relative;cursor:pointer;background-color:transparent;border:0;padding:0;-webkit-touch-callout:none;user-select:none;-webkit-tap-highlight-color:transparent;-webkit-tap-highlight-color:transparent}.js-toggle-screenreader-only{border:0;clip:rect(0 0 0 0);height:1px;margin:-1px;overflow:hidden;padding:0;position:absolute;width:1px}.js-toggle-track{width:60px;height:34px;padding:0;transition:all .2s ease}.js-toggle-track-check{position:absolute;width:17px;height:17px;left:5px;top:0;bottom:0;margin-top:auto;margin-bottom:auto;line-height:0;opacity:0;transition:opacity .25s ease}.js-toggle--checked .js-toggle-track-check{opacity:1;transition:opacity .25s ease}.js-toggle-track-x{position:absolute;width:17px;height:17px;right:5px;top:0;bottom:0;margin-top:auto;margin-bottom:auto;line-height:0;opacity:1;transition:opacity .25s ease}.js-toggle--checked .js-toggle-track-x{opacity:0}.js-toggle-thumb{position:absolute;top:1px;left:1px;width:30px;height:32px;box-sizing:border-box;transition:all .5s cubic-bezier(0.23,1,0.32,1)0ms;transform:translateX(0)}.js-toggle--checked .js-toggle-thumb{transform:translateX(26px);border-color:#19ab27}.magic{display:flex}body.dark-mode,body.dark-mode main *{background:#2d2d2d;color:#f5f5f5}[data-theme=dark]{--gray-100: rgba(255, 255, 255, 0.1);--gray-200: rgba(255, 255, 255, 0.2);--body-background: #343a40;--body-font-color: #e9ecef;--color-link: #84b2ff;--color-visited-link: #b88dff;--icon-filter: brightness(0) invert(1)}[data-theme=light]{--gray-100: #f8f9fa;--gray-200: #e9ecef;--body-background: white;--body-font-color: black;--color-link: #05b;--color-visited-link: #8440f1;--icon-filter: none}
\ No newline at end of file
diff --git a/website/resources/_gen/assets/scss/leetcode/book.scss_50fc8c04e12a2f59027287995557ceff.json b/website/resources/_gen/assets/scss/leetcode/book.scss_50fc8c04e12a2f59027287995557ceff.json
index aa178522f..7a885da44 100644
--- a/website/resources/_gen/assets/scss/leetcode/book.scss_50fc8c04e12a2f59027287995557ceff.json
+++ b/website/resources/_gen/assets/scss/leetcode/book.scss_50fc8c04e12a2f59027287995557ceff.json
@@ -1 +1 @@
-{"Target":"book.min.1cf8e09514d081e98d59a10c37d68862354c1b636fbdab1bfc1053e747f15b4c.css","MediaType":"text/css","Data":{"Integrity":"sha256-HPjglRTQgemNWaEMN9aIYjVMG2Nvvasb/BBT50fxW0w="}}
\ No newline at end of file
+{"Target":"book.min.fcdb1f07040371dc4d234f40698d15b7fb50f2dc9982bcd0898d9806ff4e07f8.css","MediaType":"text/css","Data":{"Integrity":"sha256-/NsfBwQDcdxNI09AaY0Vt/tQ8tyZgrzQiY2YBv9OB/g="}}
\ No newline at end of file
diff --git a/website/static/wechat-qr-code.png b/website/static/wechat-qr-code.png
new file mode 100644
index 000000000..c604e7331
Binary files /dev/null and b/website/static/wechat-qr-code.png differ
diff --git a/website/themes/book/README.md b/website/themes/book/README.md
index 7b925676d..052730c5d 100644
--- a/website/themes/book/README.md
+++ b/website/themes/book/README.md
@@ -137,39 +137,50 @@ enableGitInfo = true
# (Optional) Theme is intended for documentation use, therefore it doesn't render taxonomy.
# You can remove related files with config below
disableKinds = ['taxonomy', 'taxonomyTerm']
-
+
[params]
+ # (Optional, default light) Sets color theme: light, dark or auto.
+ # Theme 'auto' switches between dark and light modes based on browser/os preferences
+ BookTheme = 'light'
+
# (Optional, default true) Controls table of contents visibility on right side of pages.
# Start and end levels can be controlled with markup.tableOfContents setting.
# You can also specify this parameter per page in front matter.
BookToC = true
-
+
# (Optional, default none) Set the path to a logo for the book. If the logo is
# /static/logo.png then the path would be 'logo.png'
BookLogo = 'logo.png'
-
+
# (Optional, default none) Set leaf bundle to render as side menu
# When not specified file structure and weights will be used
BookMenuBundle = '/menu'
-
+
# (Optional, default docs) Specify section of content to render as menu
# You can also set value to "*" to render all sections to menu
BookSection = 'docs'
-
+
# Set source repository location.
# Used for 'Last Modified' and 'Edit this page' links.
BookRepo = 'https://github.com/alex-shpak/hugo-book'
+ # Specifies commit portion of the link to the page's last modified commit hash for 'doc' page
+ # type.
+ # Required if 'BookRepo' param is set.
+ # Value used to construct a URL consisting of BookRepo/BookCommitPath/<commit-hash>
+ # Github uses 'commit', Bitbucket uses 'commits'
+ BookCommitPath = 'commit'
+
# Enable 'Edit this page' links for 'doc' page type.
# Disabled by default. Uncomment to enable. Requires 'BookRepo' param.
# Path must point to the site directory.
BookEditPath = 'edit/master/exampleSite'
-
+
# (Optional, default January 2, 2006) Configure the date format used on the pages
# - In git information
# - In blog posts
BookDateFormat = 'Jan 2, 2006'
-
+
# (Optional, default true) Enables search function with flexsearch,
# Index is built on fly, therefore it might slowdown your website.
# Configuration for indexing can be adjusted in i18n folder per language.
@@ -207,35 +218,40 @@ type = 'docs'
# Set page weight to re-arrange items in file-tree menu (if BookMenuBundle not set)
weight = 10
-# (Optional) Set to mark page as flat section in file-tree menu (if BookMenuBundle not set)
-bookFlatSection = true
+# (Optional) Set to 'true' to mark page as flat section in file-tree menu (if BookMenuBundle not set)
+bookFlatSection = false
-# (Optional, Experimental) Set to hide nested sections or pages at that level. Works only with file-tree menu mode
+# (Optional) Set to hide nested sections or pages at that level. Works only with file-tree menu mode
bookCollapseSection = true
# (Optional) Set true to hide page or section from side menu (if BookMenuBundle not set)
-bookHidden = true
+bookHidden = false
# (Optional) Set 'false' to hide ToC from page
bookToC = true
# (Optional) If you have enabled BookComments for the site, you can disable it for specific pages.
bookComments = true
+
+# (Optional) Set to 'false' to exclude page from search index.
+bookSearchExclude = true
```
### Partials
There are few empty partials you can override in `layouts/partials/`
-| Partial | Placement |
-| -------------------------------------------------- | -------------------------------------- |
-| `layouts/partials/docs/inject/head.html` | Before closing `<head>` tag |
-| `layouts/partials/docs/inject/body.html` | Before closing `<body>` tag |
-| `layouts/partials/docs/inject/footer.html` | After page footer content |
-| `layouts/partials/docs/inject/menu-before.html` | At the beginning of `<nav>` menu block |
-| `layouts/partials/docs/inject/menu-after.html` | At the end of `<nav>` menu block |
-| `layouts/partials/docs/inject/content-before.html` | Before page content |
-| `layouts/partials/docs/inject/content-after.html` | After page content |
+| Partial | Placement |
+| -------------------------------------------------- | ------------------------------------------- |
+| `layouts/partials/docs/inject/head.html` | Before closing `<head>` tag |
+| `layouts/partials/docs/inject/body.html` | Before closing `<body>` tag |
+| `layouts/partials/docs/inject/footer.html` | After page footer content |
+| `layouts/partials/docs/inject/menu-before.html` | At the beginning of `<nav>` menu block |
+| `layouts/partials/docs/inject/menu-after.html` | At the end of `<nav>` menu block |
+| `layouts/partials/docs/inject/content-before.html` | Before page content |
+| `layouts/partials/docs/inject/content-after.html` | After page content |
+| `layouts/partials/docs/inject/toc-before.html` | At the beginning of table of contents block |
+| `layouts/partials/docs/inject/toc-after.html` | At the end of table of contents block |
### Extra Customisation
@@ -245,6 +261,7 @@ There are few empty partials you can override in `layouts/partials/`
| `assets/_custom.scss` | Customise or override scss styles |
| `assets/_variables.scss` | Override default SCSS variables |
| `assets/_fonts.scss` | Replace default font with custom fonts (e.g. local files or remote like google fonts) |
+| `assets/mermaid.json` | Replace Mermaid initialization config |
### Plugins
@@ -252,11 +269,10 @@ There are a few features implemented as plugable `scss` styles. Usually these ar
| Plugin | Description |
| --------------------------------- | ----------------------------------------------------------- |
-| `assets/plugins/_dark.scss` | Switches site to dark mode |
| `assets/plugins/_numbered.scss` | Makes headings in markdown numbered, e.g. `1.1`, `1.2` |
| `assets/plugins/_scrollbars.scss` | Overrides scrollbar styles to look similar across platforms |
-To enable plugins, add `@import "plugins/{name}";` to `assets/_custom.scss` in your website root. One exception is `_dark.scss` which contains variables only and should be added to `assets/_variables.scss`.
+To enable plugins, add `@import "plugins/{name}";` to `assets/_custom.scss` in your website root.
### Hugo Internal Templates
@@ -267,21 +283,22 @@ There are a few hugo templates inserted in `<head>`
## Shortcodes
- - [Buttons](https://themes.gohugo.io/theme/hugo-book/docs/shortcodes/buttons/)
- - [Columns](https://themes.gohugo.io/theme/hugo-book/docs/shortcodes/columns/)
- - [Expand](https://themes.gohugo.io/theme/hugo-book/docs/shortcodes/expand/)
- - [Hints](https://themes.gohugo.io/theme/hugo-book/docs/shortcodes/hints/)
- - [KaTeX](https://themes.gohugo.io/theme/hugo-book/docs/shortcodes/katex/)
- - [Mermaid](https://themes.gohugo.io/theme/hugo-book/docs/shortcodes/mermaid/)
- - [Tabs](https://themes.gohugo.io/theme/hugo-book/docs/shortcodes/tabs/)
-
+- [Buttons](https://themes.gohugo.io/theme/hugo-book/docs/shortcodes/buttons/)
+- [Columns](https://themes.gohugo.io/theme/hugo-book/docs/shortcodes/columns/)
+- [Expand](https://themes.gohugo.io/theme/hugo-book/docs/shortcodes/expand/)
+- [Hints](https://themes.gohugo.io/theme/hugo-book/docs/shortcodes/hints/)
+- [KaTeX](https://themes.gohugo.io/theme/hugo-book/docs/shortcodes/katex/)
+- [Mermaid](https://themes.gohugo.io/theme/hugo-book/docs/shortcodes/mermaid/)
+- [Tabs](https://themes.gohugo.io/theme/hugo-book/docs/shortcodes/tabs/)
+
By default, Goldmark trims unsafe outputs which might prevent some shortcodes from rendering. It is recommended to set `markup.goldmark.renderer.unsafe=true` if you encounter problems.
```toml
[markup.goldmark.renderer]
unsafe = true
```
-If you are using ```config.yaml``` or ```config.json```, consult the [configuration markup](https://gohugo.io/getting-started/configuration-markup/)
+
+If you are using `config.yaml` or `config.json`, consult the [configuration markup](https://gohugo.io/getting-started/configuration-markup/)
## Versioning
diff --git a/website/themes/book/assets/_defaults.scss b/website/themes/book/assets/_defaults.scss
index b17ee11ba..4c8669736 100644
--- a/website/themes/book/assets/_defaults.scss
+++ b/website/themes/book/assets/_defaults.scss
@@ -1,50 +1,66 @@
// Used in layout
-$padding-1: 1px ;
-$padding-4: 0.25rem ;
-$padding-8: 0.5rem ;
-$padding-16: 1rem ;
-
-$font-size-base: 16px ;
-$font-size-12: 0.75rem ;
-$font-size-14: 0.875rem ;
-$font-size-16: 1rem ;
-
-$border-radius: $padding-4 ;
-
-// Grayscale
-$white: #ffffff ;
-$gray-100: #f8f9fa ;
-$gray-200: #e9ecef ;
-$gray-300: #dee2e6 ;
-$gray-400: #ced4da ;
-$gray-500: #adb5bd ;
-$gray-600: #868e96 ;
-$gray-700: #495057 ;
-$gray-800: #343a40 ;
-$gray-900: #212529 ;
-$black: #000 ;
-
-$color-link: #05b ;
-$color-visited-link: #8440f1 ;
-
-$body-background: white ;
-$body-font-color: $black ;
-$body-font-weight: normal ;
-
-$body-min-width: 20rem ;
-$container-max-width: 80rem ;
-
-$header-height: 3.5rem ;
-$menu-width: 16rem ;
-$toc-width: 16rem ;
-
-$mobile-breakpoint: $menu-width + $body-min-width * 1.2 + $toc-width ;
-
-// Hint colors
+$padding-1: 1px !default;
+$padding-4: 0.25rem !default;
+$padding-8: 0.5rem !default;
+$padding-16: 1rem !default;
+
+$font-size-base: 16px !default;
+$font-size-12: 0.75rem !default;
+$font-size-14: 0.875rem !default;
+$font-size-16: 1rem !default;
+
+$border-radius: $padding-4 !default;
+
+$body-font-weight: normal !default;
+
+$body-min-width: 20rem !default;
+$container-max-width: 80rem !default;
+
+$header-height: 3.5rem !default;
+$menu-width: 16rem !default;
+$toc-width: 16rem !default;
+
+$mobile-breakpoint: $menu-width + $body-min-width * 1.2 + $toc-width !default;
+
$hint-colors: (
info: #6bf,
warning: #fd6,
- danger: #f66
-) ;
+ danger: #f66,
+) !default;
+
+// Themes
+@mixin theme-light {
+ --gray-100: #f8f9fa;
+ --gray-200: #e9ecef;
+ --gray-500: #adb5bd;
+
+ --color-link: #0055bb;
+ --color-visited-link: #8440f1;
+
+ --body-background: white;
+ --body-font-color: black;
+
+ --icon-filter: none;
+
+ --hint-color-info: #6bf;
+ --hint-color-warning: #fd6;
+ --hint-color-danger: #f66;
+}
+
+@mixin theme-dark {
+ --gray-100: rgba(255, 255, 255, 0.1);
+ --gray-200: rgba(255, 255, 255, 0.2);
+ --gray-500: rgba(255, 255, 255, 0.5);
+
+ --color-link: #84b2ff;
+ --color-visited-link: #b88dff;
+
+ --body-background: #343a40;
+ --body-font-color: #e9ecef;
+
+ --icon-filter: brightness(0) invert(1);
-$icon-filter: none ;
+ --hint-color-info: #6bf;
+ --hint-color-warning: #fd6;
+ --hint-color-danger: #f66;
+}
diff --git a/website/themes/book/assets/_main.scss b/website/themes/book/assets/_main.scss
index 5cf81d0a0..7085e3648 100644
--- a/website/themes/book/assets/_main.scss
+++ b/website/themes/book/assets/_main.scss
@@ -99,7 +99,7 @@ ul.pagination {
flex: 0 0 $menu-width;
font-size: $font-size-14;
- nav {
+ .book-menu-content {
width: $menu-width;
padding: $padding-16;
background: var(--body-background);
@@ -107,8 +107,10 @@ ul.pagination {
@include fixed;
}
- a {
+ a,
+ label {
color: inherit;
+ cursor: pointer;
word-wrap: break-word;
}
@@ -116,13 +118,20 @@ ul.pagination {
color: var(--color-link);
}
- a.collapsed {
- display: flex;
- justify-content: space-between;
+ input.toggle + label + ul {
+ display: none;
+ }
- &::after {
- content: "▸";
- }
+ input.toggle:checked + label + ul {
+ display: block;
+ }
+
+ input.toggle + label::after {
+ content: "▸";
+ }
+
+ input.toggle:checked + label::after {
+ content: "▾";
}
}
@@ -134,7 +143,8 @@ ul.pagination {
}
> a,
- > span {
+ > span,
+ > label {
font-weight: bolder;
}
@@ -204,10 +214,10 @@ ul.pagination {
}
.book-toc {
- flex: 0 0 $toc-width;
+ // flex: 0 0 $toc-width; // 使 toc 靠右贴边
font-size: $font-size-12;
- nav {
+ .book-toc-content {
width: $toc-width;
padding: $padding-16;
@@ -295,7 +305,8 @@ ul.pagination {
}
// Responsive styles
-aside nav,
+.book-menu-content,
+.book-toc-content,
.book-page,
.book-header aside,
.markdown {
@@ -334,7 +345,7 @@ aside nav,
visibility: initial;
}
- .book-menu nav {
+ .book-menu .book-menu-content {
transform: translateX($menu-width);
box-shadow: 0 0 $padding-8 rgba(0, 0, 0, 0.1);
}
@@ -365,7 +376,7 @@ aside nav,
//for RTL support
body[dir="rtl"] #menu-control:checked + main {
- .book-menu nav {
+ .book-menu .book-menu-content {
transform: translateX(-$menu-width);
}
}
@@ -374,8 +385,8 @@ aside nav,
// Extra space for big screens
@media screen and (min-width: $container-max-width) {
.book-page,
- .book-menu nav,
- .book-toc nav {
+ .book-menu .book-menu-content,
+ .book-toc .book-toc-content {
padding: $padding-16 * 2 $padding-16;
}
}
diff --git a/website/themes/book/assets/_markdown.scss b/website/themes/book/assets/_markdown.scss
index a97d76faa..e71de431d 100644
--- a/website/themes/book/assets/_markdown.scss
+++ b/website/themes/book/assets/_markdown.scss
@@ -21,12 +21,13 @@
a.anchor {
opacity: 0;
- font-size: .75em;
+ font-size: 0.75em;
vertical-align: middle;
text-decoration: none;
}
- &:hover a.anchor, a.anchor:focus {
+ &:hover a.anchor,
+ a.anchor:focus {
opacity: initial;
}
}
diff --git a/website/themes/book/assets/_shortcodes.scss b/website/themes/book/assets/_shortcodes.scss
index 06463dd91..714de2ae3 100644
--- a/website/themes/book/assets/_shortcodes.scss
+++ b/website/themes/book/assets/_shortcodes.scss
@@ -60,7 +60,7 @@
display: block;
}
input[type="radio"]:focus + label {
- @include outline
+ @include outline;
}
}
diff --git a/website/themes/book/assets/book.scss b/website/themes/book/assets/book.scss
index 68f6318bc..59369fabd 100644
--- a/website/themes/book/assets/book.scss
+++ b/website/themes/book/assets/book.scss
@@ -1,5 +1,6 @@
@import "defaults";
@import "variables";
+@import "themes/{{ default "light" .Site.Params.BookTheme }}";
@import "normalize";
@import "utils";
diff --git a/website/themes/book/assets/mermaid.json b/website/themes/book/assets/mermaid.json
new file mode 100644
index 000000000..0a3f4fbad
--- /dev/null
+++ b/website/themes/book/assets/mermaid.json
@@ -0,0 +1,6 @@
+{
+ "flowchart": {
+ "useMaxWidth":true
+ },
+ "theme": "default"
+}
diff --git a/website/themes/book/assets/plugins/_scrollbars.scss b/website/themes/book/assets/plugins/_scrollbars.scss
index fb465439b..00625827b 100644
--- a/website/themes/book/assets/plugins/_scrollbars.scss
+++ b/website/themes/book/assets/plugins/_scrollbars.scss
@@ -12,15 +12,15 @@
}
:hover::-webkit-scrollbar-thumb {
- background: $gray-500;
+ background: var(--gray-500);
}
// MS
body {
- -ms-overflow-style: -ms-autohiding-scrollbar
+ -ms-overflow-style: -ms-autohiding-scrollbar;
}
// Future
.book-menu nav {
- scrollbar-color: transparent $gray-500;
+ scrollbar-color: transparent var(--gray-500);
}
diff --git a/website/themes/book/assets/search-data.js b/website/themes/book/assets/search-data.js
index f3242819c..a93664ec0 100644
--- a/website/themes/book/assets/search-data.js
+++ b/website/themes/book/assets/search-data.js
@@ -16,8 +16,11 @@
const index = FlexSearch.create('balance', indexCfg);
window.bookSearchIndex = index;
- {{ range $index, $page := where .Site.Pages "Kind" "in" (slice "page" "section") }}
- {{ if $page.Content }}
+ {{- $pages := where .Site.Pages "Kind" "in" (slice "page" "section") -}}
+ {{- $pages = where $pages "Params.booksearchexclude" "!=" true -}}
+ {{- $pages = where $pages "Content" "not in" (slice nil "") -}}
+
+ {{ range $index, $page := $pages }}
index.add({
'id': {{ $index }},
'href': '{{ $page.RelPermalink }}',
@@ -26,5 +29,4 @@
'content': {{ $page.Plain | jsonify }}
});
{{- end -}}
- {{- end -}}
})();
diff --git a/website/themes/book/assets/serviceworker-v1.js b/website/themes/book/assets/serviceworker-v1.js
new file mode 100644
index 000000000..dd7ef6600
--- /dev/null
+++ b/website/themes/book/assets/serviceworker-v1.js
@@ -0,0 +1,86 @@
+'use strict';
+(function () {
+ 'use strict';
+ /**
+ * Service Worker Toolbox caching
+ */
+ var cacheVersion = '-toolbox-v1';
+ var dynamicVendorCacheName = 'dynamic-vendor' + cacheVersion;
+ var staticVendorCacheName = 'static-vendor' + cacheVersion;
+ var staticAssetsCacheName = 'static-assets' + cacheVersion;
+ var contentCacheName = 'content' + cacheVersion;
+ var maxEntries = 50;
+ self.importScripts("/leetcode/js/sw-toolbox.js");
+ self.toolbox.options.debug = false;
+
+ // Cache own static assets
+ self.toolbox.router.get('/(.*)', self.toolbox.cacheFirst, {
+ cache: {
+ name: staticAssetsCacheName,
+ maxEntries: maxEntries
+ }
+ });
+ // cache dynamic vendor assets, things which have no other update mechanism like filename change/version hash
+ self.toolbox.router.get('/css', self.toolbox.fastest, {
+ origin: /fonts\.googleapis\.com/,
+ cache: {
+ name: dynamicVendorCacheName,
+ maxEntries: maxEntries
+ }
+ });
+ // Do not cache disqus
+ self.toolbox.router.get('/(.*)', self.toolbox.networkOnly, {
+ origin: /disqus\.com/
+ });
+ self.toolbox.router.get('/(.*)', self.toolbox.networkOnly, {
+ origin: /disquscdn\.com/
+ });
+ // Cache all static vendor assets, e.g. fonts whose version is bind to the according url
+ self.toolbox.router.get('/(.*)', self.toolbox.cacheFirst, {
+ origin: /(fonts\.gstatic\.com|www\.google-analytics\.com|www\.googletagmanager\.com|cdnjs\.cloudflare\.com)/,
+ cache: {
+ name: staticVendorCacheName,
+ maxEntries: maxEntries
+ }
+ });
+ self.toolbox.router.get('/(.*)', self.toolbox.cacheFirst, {
+ origin: /(img\.halfrost\.com)/,
+ cache: {
+ name: staticAssetsCacheName,
+ maxEntries: maxEntries
+ }
+ });
+ self.toolbox.router.get('/content/(.*)', self.toolbox.fastest, {
+ cache: {
+ name: contentCacheName,
+ maxEntries: maxEntries
+ }
+ });
+ self.toolbox.router.get('/*', function (request, values, options) {
+ if (!request.url.match(/(\/ghost\/|\/page\/)/) && request.headers.get('accept').includes('text/html')) {
+ return self.toolbox.fastest(request, values, options);
+ } else {
+ // DevTools opening will trigger these o-i-c requests, which this SW can't handle.
+ // There's probaly more going on here, but I'd rather just ignore this problem. :)
+ // https://github.com/paulirish/caltrainschedule.io/issues/49
+ if (request.cache === 'only-if-cached' && request.mode !== 'same-origin'){
+ return;
+ } else {
+ return self.toolbox.networkOnly(request, values, options);
+ }
+ }
+ }, {
+ cache: {
+ name: contentCacheName,
+ maxEntries: maxEntries
+ }
+ });
+ // immediately activate this serviceworker
+ self.addEventListener('install', function (event) {
+ return event.waitUntil(self.skipWaiting());
+ });
+ self.addEventListener('activate', function (event) {
+ return event.waitUntil(self.clients.claim());
+ });
+})();
+//# sourceMappingURL=serviceworker-v1.js.map
diff --git a/website/themes/book/assets/themes/_auto.scss b/website/themes/book/assets/themes/_auto.scss
new file mode 100644
index 000000000..31d7f9ac4
--- /dev/null
+++ b/website/themes/book/assets/themes/_auto.scss
@@ -0,0 +1,9 @@
+:root {
+ @include theme-light;
+}
+
+@media (prefers-color-scheme: dark) {
+ :root {
+ @include theme-dark;
+ }
+}
diff --git a/website/themes/book/assets/themes/_dark.scss b/website/themes/book/assets/themes/_dark.scss
new file mode 100644
index 000000000..e00e38ef6
--- /dev/null
+++ b/website/themes/book/assets/themes/_dark.scss
@@ -0,0 +1,3 @@
+:root {
+ @include theme-dark;
+}
diff --git a/website/themes/book/assets/themes/_light.scss b/website/themes/book/assets/themes/_light.scss
new file mode 100644
index 000000000..8c0e34653
--- /dev/null
+++ b/website/themes/book/assets/themes/_light.scss
@@ -0,0 +1,3 @@
+:root {
+ @include theme-light;
+}
diff --git a/website/themes/book/exampleSite/config.toml b/website/themes/book/exampleSite/config.toml
index 424d3204b..dfd9a31cc 100644
--- a/website/themes/book/exampleSite/config.toml
+++ b/website/themes/book/exampleSite/config.toml
@@ -49,6 +49,10 @@ enableGitInfo = true
weight = 20
[params]
+ # (Optional, default light) Sets color theme: light, dark or auto.
+ # Theme 'auto' switches between dark and light modes based on browser/os preferences
+ BookTheme = 'light'
+
# (Optional, default true) Controls table of contents visibility on right side of pages.
# Start and end levels can be controlled with markup.tableOfContents setting.
# You can also specify this parameter per page in front matter.
@@ -71,10 +75,17 @@ enableGitInfo = true
# Used for 'Last Modified' and 'Edit this page' links.
BookRepo = 'https://github.com/alex-shpak/hugo-book'
+ # (Optional, default 'commit') Specifies commit portion of the link to the page's last modified
+ # commit hash for 'doc' page type.
+ # Requires 'BookRepo' param.
+ # Value used to construct a URL consisting of BookRepo/BookCommitPath/<commit-hash>
+ # Github uses 'commit', Bitbucket uses 'commits'
+ # BookCommitPath = 'commit'
+
# Enable "Edit this page" links for 'doc' page type.
# Disabled by default. Uncomment to enable. Requires 'BookRepo' param.
# Edit path must point to root directory of repo.
- BookEditPath = 'edit/master/exampleSite'
+ BookEditPath = 'edit/main/exampleSite'
# Configure the date format used on the pages
# - In git information
@@ -101,3 +112,7 @@ enableGitInfo = true
# /!\ This is an experimental feature, might be removed or changed at any time
# (Optional, experimental, default false) Enables service worker that caches visited pages and resources for offline use.
BookServiceWorker = true
+
+ # /!\ This is an experimental feature, might be removed or changed at any time
+ # (Optional, experimental, default false) Enables a drop-down menu for translations only if a translation is present.
+ BookTranslatedOnly = false
diff --git a/website/themes/book/exampleSite/config.yaml b/website/themes/book/exampleSite/config.yaml
index 2a4bc335b..4f439c689 100644
--- a/website/themes/book/exampleSite/config.yaml
+++ b/website/themes/book/exampleSite/config.yaml
@@ -45,6 +45,10 @@ menu:
weight: 20
params:
+ # (Optional, default light) Sets color theme: light, dark or auto.
+ # Theme 'auto' switches between dark and light modes based on browser/os preferences
+ BookTheme: "light"
+
# (Optional, default true) Controls table of contents visibility on right side of pages.
# Start and end levels can be controlled with markup.tableOfContents setting.
# You can also specify this parameter per page in front matter.
@@ -67,10 +71,17 @@ params:
# Used for 'Last Modified' and 'Edit this page' links.
BookRepo: https://github.com/alex-shpak/hugo-book
+ # (Optional, default 'commit') Specifies commit portion of the link to the page's last modified
+ # commit hash for 'doc' page type.
+ # Requires 'BookRepo' param.
+ # Value used to construct a URL consisting of BookRepo/BookCommitPath/<commit-hash>
+ # Github uses 'commit', Bitbucket uses 'commits'
+ # BookCommitPath: commit
+
# Enable "Edit this page" links for 'doc' page type.
# Disabled by default. Uncomment to enable. Requires 'BookRepo' param.
# Edit path must point to root directory of repo.
- BookEditPath: edit/master/exampleSite
+ BookEditPath: edit/main/exampleSite
# Configure the date format used on the pages
# - In git information
@@ -97,3 +108,7 @@ params:
# /!\ This is an experimental feature, might be removed or changed at any time
# (Optional, experimental, default false) Enables service worker that caches visited pages and resources for offline use.
BookServiceWorker: true
+
+ # /!\ This is an experimental feature, might be removed or changed at any time
+ # (Optional, experimental, default false) Enables a drop-down menu for translations only if a translation is present.
+ BookTranslatedOnly: false
diff --git a/website/themes/book/exampleSite/content.bn/_index.md b/website/themes/book/exampleSite/content.bn/_index.md
new file mode 100644
index 000000000..85c03e006
--- /dev/null
+++ b/website/themes/book/exampleSite/content.bn/_index.md
@@ -0,0 +1,79 @@
+---
+title: ভূমিকা
+type: docs
+---
+
+# বাংলা ভাষায় শুরু করুন
+
+{{< columns >}}
+## অস্ট্রিস চিপসে ফুর্তিভা
+
+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.
+{{< /columns >}}
+
+
+## টেম্পোরার নিশি
+
+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));
+ }
+ public_keyboard_docking += error.controller_gibibyte_plug.ip(4,
+ asciiPetaflops, software(supercomputer_compatible_status + 4));
+ dynamic_disk.indexModeLaptop = bufferTftpReality;
+ var export_vlog_sequence = trinitron_flowchart + supercomputer_cluster_rj(
+ -1, toolbar_powerpoint_query, -2 / multiprocessing_impression);
+
+## Locis suis novi cum suoque decidit eadem
+
+Idmoniae ripis, at aves, ali missa adest, ut _et autem_, et ab? Venit spes
+versus finis sermonibus patefecit murum nec est sine oculis. _Ille_ inmota
+macies domoque caelestia cadit tantummodo scelus procul, corde!
+
+1. Dolentem capi parte rostro alvum habentem pudor
+2. Fulgentia sanguine paret
+3. E punior consurgit lentus
+4. Vox hasta eras micantes
+
+## Facibus pharetrae indetonsusque indulsit sic incurrite foliis
+
+Nefandam et prisci palmas! Blandita cutis flectitur montis macies, te _nati_
+Latiis; turbaque inferias. Virginis tibi peracta avidusque facies caper nec, e
+at ademptae, mira.
+
+ direct *= font(inputScareware(sliHome), crossplatform.byte(
+ ppl_encryption.excel_e_rte(integratedModelModifier), timeVirtual,
+ floating_speakers.media_printer(us, yahoo, primaryPhp)));
+ friendly_metal_flatbed(cd, isoPrimaryStorage(reader), dmaMirrored);
+ if (parse_flash_cron.metalGif(1, adServiceDevice, utility)) {
+ adf -= operation_cdma_samba;
+ imapGif.switch += torrent;
+ } else {
+ pmu.disk_captcha = digital_ppp_pci + recursionTransistor(5, dram);
+ ajax_service += grayscalePythonLock;
+ google_scroll_capacity = ftp + engine_dslam_sidebar / tape - 1;
+ }
+ drive_rw = zipTftp;
+ var suffix = software_router_extension.dimm_ddr(-5,
+ kernel_digital_minisite);
+
+Vocavit toto; alas **mitis** maestus in liquidarum ab legi finitimosque dominam
+tibi subitus; Orionis vertitur nota. Currere alti etiam seroque cernitis
+innumeris miraturus amplectique collo sustinet quemque! Litora ante turba?
diff --git a/website/themes/book/exampleSite/content/docs/example/collapsed/_index.md b/website/themes/book/exampleSite/content/docs/example/collapsed/_index.md
index 806bc2efa..e954f0877 100644
--- a/website/themes/book/exampleSite/content/docs/example/collapsed/_index.md
+++ b/website/themes/book/exampleSite/content/docs/example/collapsed/_index.md
@@ -2,22 +2,3 @@
bookCollapseSection: true
weight: 20
---
-
-# Collapsed Level of Menu
-
-## Cognita laeva illo fracta
-
-Lorem markdownum pavent auras, surgit nunc cingentibus libet **Laomedonque que**
-est. Pastor [An](http://est.org/ire.aspx) arbor filia foedat, ne [fugit
-aliter](http://www.indiciumturbam.org/moramquid.php), per. Helicona illas et
-callida neptem est *Oresitrophos* caput, dentibus est venit. Tenet reddite
-[famuli](http://www.antro-et.net/) praesentem fortibus, quaeque vis foret si
-frondes *gelidos* gravidae circumtulit [inpulit armenta
-nativum](http://incurvasustulit.io/illi-virtute.html).
-
-1. Te at cruciabere vides rubentis manebo
-2. Maturuit in praetemptat ruborem ignara postquam habitasse
-3. Subitarum supplevit quoque fontesque venabula spretis modo
-4. Montis tot est mali quasque gravis
-5. Quinquennem domus arsit ipse
-6. Pellem turis pugnabant locavit
diff --git a/website/themes/book/exampleSite/content/docs/shortcodes/columns.md b/website/themes/book/exampleSite/content/docs/shortcodes/columns.md
index 4df396a67..0b8fde836 100644
--- a/website/themes/book/exampleSite/content/docs/shortcodes/columns.md
+++ b/website/themes/book/exampleSite/content/docs/shortcodes/columns.md
@@ -8,12 +8,12 @@ Columns help organize shorter pieces of content horizontally for readability.
# Left Content
Lorem markdownum insigne...
-<---> <!-- magic sparator, between columns -->
+<---> <!-- magic separator, between columns -->
# Mid Content
Lorem markdownum insigne...
-<---> <!-- magic sparator, between columns -->
+<---> <!-- magic separator, between columns -->
# Right Content
Lorem markdownum insigne...
diff --git a/website/themes/book/exampleSite/content/docs/shortcodes/mermaid.md b/website/themes/book/exampleSite/content/docs/shortcodes/mermaid.md
index 3a617bcc0..c37e6b20e 100644
--- a/website/themes/book/exampleSite/content/docs/shortcodes/mermaid.md
+++ b/website/themes/book/exampleSite/content/docs/shortcodes/mermaid.md
@@ -2,6 +2,13 @@
[Mermaid](https://mermaidjs.github.io/) is library for generating svg charts and diagrams from text.
+{{< hint info >}}
+**Override Mermaid Initialization Config**
+
+To override the [initialization config](https://mermaid-js.github.io/mermaid/#/Setup) for Mermaid,
+create a `mermaid.json` file in your `assets` folder!
+{{< /hint >}}
+
## Example
{{< columns >}}
@@ -36,3 +43,4 @@ sequenceDiagram
{{< /mermaid >}}
{{< /columns >}}
+
diff --git a/website/themes/book/exampleSite/resources/_gen/assets/scss/book.scss_50fc8c04e12a2f59027287995557ceff.content b/website/themes/book/exampleSite/resources/_gen/assets/scss/book.scss_50fc8c04e12a2f59027287995557ceff.content
index 99d483a2f..d6ea2eecc 100644
--- a/website/themes/book/exampleSite/resources/_gen/assets/scss/book.scss_50fc8c04e12a2f59027287995557ceff.content
+++ b/website/themes/book/exampleSite/resources/_gen/assets/scss/book.scss_50fc8c04e12a2f59027287995557ceff.content
@@ -1 +1 @@
-@charset "UTF-8";/*!normalize.css v8.0.1 | MIT License | github.com/necolas/normalize.css*/html{line-height:1.15;-webkit-text-size-adjust:100%}body{margin:0}main{display:block}h1{font-size:2em;margin:.67em 0}hr{box-sizing:content-box;height:0;overflow:visible}pre{font-family:monospace,monospace;font-size:1em}a{background-color:transparent}abbr[title]{border-bottom:none;text-decoration:underline;text-decoration:underline dotted}b,strong{font-weight:bolder}code,kbd,samp{font-family:monospace,monospace;font-size:1em}small{font-size:80%}sub,sup{font-size:75%;line-height:0;position:relative;vertical-align:baseline}sub{bottom:-.25em}sup{top:-.5em}img{border-style:none}button,input,optgroup,select,textarea{font-family:inherit;font-size:100%;line-height:1.15;margin:0}button,input{overflow:visible}button,select{text-transform:none}button,[type=button],[type=reset],[type=submit]{-webkit-appearance:button}button::-moz-focus-inner,[type=button]::-moz-focus-inner,[type=reset]::-moz-focus-inner,[type=submit]::-moz-focus-inner{border-style:none;padding:0}button:-moz-focusring,[type=button]:-moz-focusring,[type=reset]:-moz-focusring,[type=submit]:-moz-focusring{outline:1px dotted ButtonText}fieldset{padding:.35em .75em .625em}legend{box-sizing:border-box;color:inherit;display:table;max-width:100%;padding:0;white-space:normal}progress{vertical-align:baseline}textarea{overflow:auto}[type=checkbox],[type=radio]{box-sizing:border-box;padding:0}[type=number]::-webkit-inner-spin-button,[type=number]::-webkit-outer-spin-button{height:auto}[type=search]{-webkit-appearance:textfield;outline-offset:-2px}[type=search]::-webkit-search-decoration{-webkit-appearance:none}::-webkit-file-upload-button{-webkit-appearance:button;font:inherit}details{display:block}summary{display:list-item}template{display:none}[hidden]{display:none}.flex{display:flex}.flex-auto{flex:1 1 auto}.flex-even{flex:1 1}.flex-wrap{flex-wrap:wrap}.justify-start{justify-content:flex-start}.justify-end{justify-content:flex-end}.justify-center{justify-content:center}.justify-between{justify-content:space-between}.align-center{align-items:center}.mx-auto{margin:0 auto}.text-center{text-align:center}.text-left{text-align:left}.text-right{text-align:right}.hidden{display:none}input.toggle{height:0;width:0;overflow:hidden;opacity:0;position:absolute}.clearfix::after{content:"";display:table;clear:both}html{font-size:16px;scroll-behavior:smooth;touch-action:manipulation}body{min-width:20rem;color:#000;background:#fff;letter-spacing:.33px;font-weight:400;text-rendering:optimizeLegibility;-webkit-font-smoothing:antialiased;-moz-osx-font-smoothing:grayscale;box-sizing:border-box}body *{box-sizing:inherit}h1,h2,h3,h4,h5{font-weight:400}a{text-decoration:none;color:#05b}img{vertical-align:baseline}:focus{outline-style:auto;outline-color:currentColor;outline-color:-webkit-focus-ring-color}aside nav ul{padding:0;margin:0;list-style:none}aside nav ul li{margin:1em 0;position:relative}aside nav ul a{display:block}aside nav ul a:hover{opacity:.5}aside nav ul ul{padding-inline-start:1rem}ul.pagination{display:flex;justify-content:center;list-style-type:none}ul.pagination .page-item a{padding:1rem}.container{max-width:80rem;margin:0 auto}.book-icon{filter:none}.book-brand{margin-top:0}.book-brand img{height:1.5em;width:auto;vertical-align:middle;margin-inline-end:.5rem}.book-menu{flex:0 0 16rem;font-size:.875rem}.book-menu nav{width:16rem;padding:1rem;background:#fff;position:fixed;top:0;bottom:0;overflow-x:hidden;overflow-y:auto}.book-menu a{color:inherit;word-wrap:break-word}.book-menu a.active{color:#05b}.book-menu a.collapsed{display:flex;justify-content:space-between}.book-menu a.collapsed::after{content:"▸"}.book-section-flat{margin-bottom:2rem}.book-section-flat:not(:first-child){margin-top:2rem}.book-section-flat>a,.book-section-flat>span{font-weight:bolder}.book-section-flat>ul{padding-inline-start:0}.book-page{min-width:20rem;flex-grow:1;padding:1rem}.book-post{margin-bottom:3rem}.book-header{display:none;margin-bottom:1rem}.book-header label{line-height:0}.book-search{position:relative;margin:1rem 0;border-bottom:1px solid transparent}.book-search input{width:100%;padding:.5rem;border:0;border-radius:.25rem;background:#f8f9fa;color:#000}.book-search input:required+.book-search-spinner{display:block}.book-search .book-search-spinner{position:absolute;top:0;margin:.5rem;margin-inline-start:calc(100% - 1.5rem);width:1rem;height:1rem;border:1px solid transparent;border-top-color:#000;border-radius:50%;animation:spin 1s ease infinite}@keyframes spin{100%{transform:rotate(360deg)}}.book-search small{opacity:.5}.book-toc{flex:0 0 16rem;font-size:.75rem}.book-toc nav{width:16rem;padding:1rem;position:fixed;top:0;bottom:0;overflow-x:hidden;overflow-y:auto}.book-toc img{height:1em}.book-toc nav>ul>li:first-child{margin-top:0}.book-footer{padding-top:1rem;font-size:.875rem}.book-footer img{height:1em;margin-inline-end:.5rem}.book-comments{margin-top:1rem}.book-languages{position:relative;overflow:visible;padding:1rem;margin:-1rem}.book-languages ul{margin:0;padding:0;list-style:none}.book-languages ul li{white-space:nowrap;cursor:pointer}.book-languages:hover .book-languages-list,.book-languages:focus .book-languages-list,.book-languages:focus-within .book-languages-list{display:block}.book-languages .book-languages-list{display:none;position:absolute;bottom:100%;left:0;padding:.5rem 0;background:#fff;box-shadow:0 0 .25rem rgba(0,0,0,.1)}.book-languages .book-languages-list li img{opacity:.25}.book-languages .book-languages-list li.active img,.book-languages .book-languages-list li:hover img{opacity:initial}.book-languages .book-languages-list a{color:inherit;padding:.5rem 1rem}.book-home{padding:1rem}aside nav,.book-page,.book-header aside,.markdown{transition:.2s ease-in-out;transition-property:transform,margin,opacity,visibility;will-change:transform,margin,opacity}@media screen and (max-width:56rem){#menu-control,#toc-control{display:inline}.book-menu{visibility:hidden;margin-inline-start:-16rem;font-size:16px;z-index:1}.book-toc{display:none}.book-header{display:block}#menu-control:focus~main label[for=menu-control]{outline-style:auto;outline-color:currentColor;outline-color:-webkit-focus-ring-color}#menu-control:checked~main .book-menu{visibility:initial}#menu-control:checked~main .book-menu nav{transform:translateX(16rem);box-shadow:0 0 .5rem rgba(0,0,0,.1)}#menu-control:checked~main .book-page{opacity:.25}#menu-control:checked~main .book-menu-overlay{display:block;position:absolute;top:0;bottom:0;left:0;right:0}#toc-control:focus~main label[for=toc-control]{outline-style:auto;outline-color:currentColor;outline-color:-webkit-focus-ring-color}#toc-control:checked~main .book-header aside{display:block}body[dir=rtl] #menu-control:checked+main .book-menu nav{transform:translateX(-16rem)}}@media screen and (min-width:80rem){.book-page,.book-menu nav,.book-toc nav{padding:2rem 1rem}}@font-face{font-family:roboto;font-style:italic;font-weight:300;font-display:swap;src:local("Roboto Light Italic"),local("Roboto-LightItalic"),url(fonts/roboto-v19-latin-300italic.woff2)format("woff2"),url(fonts/roboto-v19-latin-300italic.woff)format("woff")}@font-face{font-family:roboto;font-style:normal;font-weight:400;font-display:swap;src:local("Roboto"),local("Roboto-Regular"),url(fonts/roboto-v19-latin-regular.woff2)format("woff2"),url(fonts/roboto-v19-latin-regular.woff)format("woff")}@font-face{font-family:roboto;font-style:normal;font-weight:700;font-display:swap;src:local("Roboto Bold"),local("Roboto-Bold"),url(fonts/roboto-v19-latin-700.woff2)format("woff2"),url(fonts/roboto-v19-latin-700.woff)format("woff")}@font-face{font-family:roboto mono;font-style:normal;font-weight:400;font-display:swap;src:local("Roboto Mono"),local("RobotoMono-Regular"),url(fonts/roboto-mono-v6-latin-regular.woff2)format("woff2"),url(fonts/roboto-mono-v6-latin-regular.woff)format("woff")}body{font-family:roboto,sans-serif}code{font-family:roboto mono,monospace}@media print{.book-menu,.book-footer,.book-toc{display:none}.book-header,.book-header aside{display:block}main{display:block!important}}.markdown{line-height:1.6}.markdown>:first-child{margin-top:0}.markdown h1,.markdown h2,.markdown h3,.markdown h4,.markdown h5,.markdown h6{font-weight:400;line-height:1;margin-top:1.5em;margin-bottom:1rem}.markdown h1 a.anchor,.markdown h2 a.anchor,.markdown h3 a.anchor,.markdown h4 a.anchor,.markdown h5 a.anchor,.markdown h6 a.anchor{opacity:0;font-size:.75em;vertical-align:middle;text-decoration:none}.markdown h1:hover a.anchor,.markdown h1 a.anchor:focus,.markdown h2:hover a.anchor,.markdown h2 a.anchor:focus,.markdown h3:hover a.anchor,.markdown h3 a.anchor:focus,.markdown h4:hover a.anchor,.markdown h4 a.anchor:focus,.markdown h5:hover a.anchor,.markdown h5 a.anchor:focus,.markdown h6:hover a.anchor,.markdown h6 a.anchor:focus{opacity:initial}.markdown h4,.markdown h5,.markdown h6{font-weight:bolder}.markdown h5{font-size:.875em}.markdown h6{font-size:.75em}.markdown b,.markdown optgroup,.markdown strong{font-weight:bolder}.markdown a{text-decoration:none}.markdown a:hover{text-decoration:underline}.markdown a:visited{color:#8440f1}.markdown img{max-width:100%}.markdown code{padding:0 .25rem;background:#e9ecef;border-radius:.25rem;font-size:.875em}.markdown pre{padding:1rem;background:#f8f9fa;border-radius:.25rem;overflow-x:auto}.markdown pre code{padding:0;background:0 0}.markdown blockquote{margin:1rem 0;padding:.5rem 1rem .5rem .75rem;border-inline-start:.25rem solid #e9ecef;border-radius:.25rem}.markdown blockquote :first-child{margin-top:0}.markdown blockquote :last-child{margin-bottom:0}.markdown table{overflow:auto;display:block;border-spacing:0;border-collapse:collapse;margin-top:1rem;margin-bottom:1rem}.markdown table tr th,.markdown table tr td{padding:.5rem 1rem;border:1px solid #e9ecef}.markdown table tr:nth-child(2n){background:#f8f9fa}.markdown hr{height:1px;border:none;background:#e9ecef}.markdown ul,.markdown ol{padding-inline-start:2rem}.markdown dl dt{font-weight:bolder;margin-top:1rem}.markdown dl dd{margin-inline-start:1rem;margin-bottom:1rem}.markdown .highlight table tr td:nth-child(1) pre{margin:0;padding-inline-end:0}.markdown .highlight table tr td:nth-child(2) pre{margin:0;padding-inline-start:0}.markdown details{padding:1rem;border:1px solid #e9ecef;border-radius:.25rem}.markdown details summary{line-height:1;padding:1rem;margin:-1rem;cursor:pointer}.markdown details[open] summary{margin-bottom:0}.markdown figure{margin:1rem 0}.markdown figure figcaption p{margin-top:0}.markdown-inner>:first-child{margin-top:0}.markdown-inner>:last-child{margin-bottom:0}.markdown .book-expand{margin-top:1rem;margin-bottom:1rem;border:1px solid #e9ecef;border-radius:.25rem;overflow:hidden}.markdown .book-expand .book-expand-head{background:#f8f9fa;padding:.5rem 1rem;cursor:pointer}.markdown .book-expand .book-expand-content{display:none;padding:1rem}.markdown .book-expand input[type=checkbox]:checked+.book-expand-content{display:block}.markdown .book-tabs{margin-top:1rem;margin-bottom:1rem;border:1px solid #e9ecef;border-radius:.25rem;overflow:hidden;display:flex;flex-wrap:wrap}.markdown .book-tabs label{display:inline-block;padding:.5rem 1rem;border-bottom:1px transparent;cursor:pointer}.markdown .book-tabs .book-tabs-content{order:999;width:100%;border-top:1px solid #f8f9fa;padding:1rem;display:none}.markdown .book-tabs input[type=radio]:checked+label{border-bottom:1px solid #05b}.markdown .book-tabs input[type=radio]:checked+label+.book-tabs-content{display:block}.markdown .book-tabs input[type=radio]:focus+label{outline-style:auto;outline-color:currentColor;outline-color:-webkit-focus-ring-color}.markdown .book-columns{margin-left:-1rem;margin-right:-1rem}.markdown .book-columns>div{margin:1rem 0;min-width:10rem;padding:0 1rem}.markdown a.book-btn{display:inline-block;font-size:.875rem;color:#05b;line-height:2rem;padding:0 1rem;border:1px solid #05b;border-radius:.25rem;cursor:pointer}.markdown a.book-btn:hover{text-decoration:none}.markdown .book-hint.info{border-color:#6bf;background-color:rgba(102,187,255,.1)}.markdown .book-hint.warning{border-color:#fd6;background-color:rgba(255,221,102,.1)}.markdown .book-hint.danger{border-color:#f66;background-color:rgba(255,102,102,.1)}
\ No newline at end of file
+@charset "UTF-8";:root{--gray-100:#f8f9fa;--gray-200:#e9ecef;--gray-500:#adb5bd;--color-link:#0055bb;--color-visited-link:#8440f1;--body-background:white;--body-font-color:black;--icon-filter:none;--hint-color-info:#6bf;--hint-color-warning:#fd6;--hint-color-danger:#f66}/*!normalize.css v8.0.1 | MIT License | github.com/necolas/normalize.css*/html{line-height:1.15;-webkit-text-size-adjust:100%}body{margin:0}main{display:block}h1{font-size:2em;margin:.67em 0}hr{box-sizing:content-box;height:0;overflow:visible}pre{font-family:monospace,monospace;font-size:1em}a{background-color:initial}abbr[title]{border-bottom:none;text-decoration:underline;text-decoration:underline dotted}b,strong{font-weight:bolder}code,kbd,samp{font-family:monospace,monospace;font-size:1em}small{font-size:80%}sub,sup{font-size:75%;line-height:0;position:relative;vertical-align:baseline}sub{bottom:-.25em}sup{top:-.5em}img{border-style:none}button,input,optgroup,select,textarea{font-family:inherit;font-size:100%;line-height:1.15;margin:0}button,input{overflow:visible}button,select{text-transform:none}button,[type=button],[type=reset],[type=submit]{-webkit-appearance:button}button::-moz-focus-inner,[type=button]::-moz-focus-inner,[type=reset]::-moz-focus-inner,[type=submit]::-moz-focus-inner{border-style:none;padding:0}button:-moz-focusring,[type=button]:-moz-focusring,[type=reset]:-moz-focusring,[type=submit]:-moz-focusring{outline:1px dotted ButtonText}fieldset{padding:.35em .75em .625em}legend{box-sizing:border-box;color:inherit;display:table;max-width:100%;padding:0;white-space:normal}progress{vertical-align:baseline}textarea{overflow:auto}[type=checkbox],[type=radio]{box-sizing:border-box;padding:0}[type=number]::-webkit-inner-spin-button,[type=number]::-webkit-outer-spin-button{height:auto}[type=search]{-webkit-appearance:textfield;outline-offset:-2px}[type=search]::-webkit-search-decoration{-webkit-appearance:none}::-webkit-file-upload-button{-webkit-appearance:button;font:inherit}details{display:block}summary{display:list-item}template{display:none}[hidden]{display:none}.flex{display:flex}.flex-auto{flex:auto}.flex-even{flex:1 1}.flex-wrap{flex-wrap:wrap}.justify-start{justify-content:flex-start}.justify-end{justify-content:flex-end}.justify-center{justify-content:center}.justify-between{justify-content:space-between}.align-center{align-items:center}.mx-auto{margin:0 auto}.text-center{text-align:center}.text-left{text-align:left}.text-right{text-align:right}.hidden{display:none}input.toggle{height:0;width:0;overflow:hidden;opacity:0;position:absolute}.clearfix::after{content:"";display:table;clear:both}html{font-size:16px;scroll-behavior:smooth;touch-action:manipulation}body{min-width:20rem;color:var(--body-font-color);background:var(--body-background);letter-spacing:.33px;font-weight:400;text-rendering:optimizeLegibility;-webkit-font-smoothing:antialiased;-moz-osx-font-smoothing:grayscale;box-sizing:border-box}body *{box-sizing:inherit}h1,h2,h3,h4,h5{font-weight:400}a{text-decoration:none;color:var(--color-link)}img{vertical-align:baseline}:focus{outline-style:auto;outline-color:currentColor;outline-color:-webkit-focus-ring-color}aside nav ul{padding:0;margin:0;list-style:none}aside nav ul li{margin:1em 0;position:relative}aside nav ul a{display:block}aside nav ul a:hover{opacity:.5}aside nav ul ul{padding-inline-start:1rem}ul.pagination{display:flex;justify-content:center;list-style-type:none}ul.pagination .page-item a{padding:1rem}.container{max-width:80rem;margin:0 auto}.book-icon{filter:var(--icon-filter)}.book-brand{margin-top:0}.book-brand img{height:1.5em;width:auto;vertical-align:middle;margin-inline-end:.5rem}.book-menu{flex:0 0 16rem;font-size:.875rem}.book-menu .book-menu-content{width:16rem;padding:1rem;background:var(--body-background);position:fixed;top:0;bottom:0;overflow-x:hidden;overflow-y:auto}.book-menu a,.book-menu label{color:inherit;cursor:pointer;word-wrap:break-word}.book-menu a.active{color:var(--color-link)}.book-menu input.toggle+label+ul{display:none}.book-menu input.toggle:checked+label+ul{display:block}.book-menu input.toggle+label::after{content:"▸"}.book-menu input.toggle:checked+label::after{content:"▾"}.book-section-flat{margin-bottom:2rem}.book-section-flat:not(:first-child){margin-top:2rem}.book-section-flat>a,.book-section-flat>span,.book-section-flat>label{font-weight:bolder}.book-section-flat>ul{padding-inline-start:0}.book-page{min-width:20rem;flex-grow:1;padding:1rem}.book-post{margin-bottom:3rem}.book-header{display:none;margin-bottom:1rem}.book-header label{line-height:0}.book-search{position:relative;margin:1rem 0;border-bottom:1px solid transparent}.book-search input{width:100%;padding:.5rem;border:0;border-radius:.25rem;background:var(--gray-100);color:var(--body-font-color)}.book-search input:required+.book-search-spinner{display:block}.book-search .book-search-spinner{position:absolute;top:0;margin:.5rem;margin-inline-start:calc(100% - 1.5rem);width:1rem;height:1rem;border:1px solid transparent;border-top-color:var(--body-font-color);border-radius:50%;animation:spin 1s ease infinite}@keyframes spin{100%{transform:rotate(360deg)}}.book-search small{opacity:.5}.book-toc{flex:0 0 16rem;font-size:.75rem}.book-toc .book-toc-content{width:16rem;padding:1rem;position:fixed;top:0;bottom:0;overflow-x:hidden;overflow-y:auto}.book-toc img{height:1em}.book-toc nav>ul>li:first-child{margin-top:0}.book-footer{padding-top:1rem;font-size:.875rem}.book-footer img{height:1em;margin-inline-end:.5rem}.book-comments{margin-top:1rem}.book-languages{position:relative;overflow:visible;padding:1rem;margin:-1rem}.book-languages ul{margin:0;padding:0;list-style:none}.book-languages ul li{white-space:nowrap;cursor:pointer}.book-languages:hover .book-languages-list,.book-languages:focus .book-languages-list,.book-languages:focus-within .book-languages-list{display:block}.book-languages .book-languages-list{display:none;position:absolute;bottom:100%;left:0;padding:.5rem 0;background:var(--body-background);box-shadow:0 0 .25rem rgba(0,0,0,.1)}.book-languages .book-languages-list li img{opacity:.25}.book-languages .book-languages-list li.active img,.book-languages .book-languages-list li:hover img{opacity:initial}.book-languages .book-languages-list a{color:inherit;padding:.5rem 1rem}.book-home{padding:1rem}.book-menu-content,.book-toc-content,.book-page,.book-header aside,.markdown{transition:.2s ease-in-out;transition-property:transform,margin,opacity,visibility;will-change:transform,margin,opacity}@media screen and (max-width:56rem){#menu-control,#toc-control{display:inline}.book-menu{visibility:hidden;margin-inline-start:-16rem;font-size:16px;z-index:1}.book-toc{display:none}.book-header{display:block}#menu-control:focus~main label[for=menu-control]{outline-style:auto;outline-color:currentColor;outline-color:-webkit-focus-ring-color}#menu-control:checked~main .book-menu{visibility:initial}#menu-control:checked~main .book-menu .book-menu-content{transform:translateX(16rem);box-shadow:0 0 .5rem rgba(0,0,0,.1)}#menu-control:checked~main .book-page{opacity:.25}#menu-control:checked~main .book-menu-overlay{display:block;position:absolute;top:0;bottom:0;left:0;right:0}#toc-control:focus~main label[for=toc-control]{outline-style:auto;outline-color:currentColor;outline-color:-webkit-focus-ring-color}#toc-control:checked~main .book-header aside{display:block}body[dir=rtl] #menu-control:checked+main .book-menu .book-menu-content{transform:translateX(-16rem)}}@media screen and (min-width:80rem){.book-page,.book-menu .book-menu-content,.book-toc .book-toc-content{padding:2rem 1rem}}@font-face{font-family:roboto;font-style:italic;font-weight:300;font-display:swap;src:local("Roboto Light Italic"),local("Roboto-LightItalic"),url(fonts/roboto-v19-latin-300italic.woff2)format("woff2"),url(fonts/roboto-v19-latin-300italic.woff)format("woff")}@font-face{font-family:roboto;font-style:normal;font-weight:400;font-display:swap;src:local("Roboto"),local("Roboto-Regular"),url(fonts/roboto-v19-latin-regular.woff2)format("woff2"),url(fonts/roboto-v19-latin-regular.woff)format("woff")}@font-face{font-family:roboto;font-style:normal;font-weight:700;font-display:swap;src:local("Roboto Bold"),local("Roboto-Bold"),url(fonts/roboto-v19-latin-700.woff2)format("woff2"),url(fonts/roboto-v19-latin-700.woff)format("woff")}@font-face{font-family:roboto mono;font-style:normal;font-weight:400;font-display:swap;src:local("Roboto Mono"),local("RobotoMono-Regular"),url(fonts/roboto-mono-v6-latin-regular.woff2)format("woff2"),url(fonts/roboto-mono-v6-latin-regular.woff)format("woff")}body{font-family:roboto,sans-serif}code{font-family:roboto mono,monospace}@media print{.book-menu,.book-footer,.book-toc{display:none}.book-header,.book-header aside{display:block}main{display:block!important}}.markdown{line-height:1.6}.markdown>:first-child{margin-top:0}.markdown h1,.markdown h2,.markdown h3,.markdown h4,.markdown h5,.markdown h6{font-weight:400;line-height:1;margin-top:1.5em;margin-bottom:1rem}.markdown h1 a.anchor,.markdown h2 a.anchor,.markdown h3 a.anchor,.markdown h4 a.anchor,.markdown h5 a.anchor,.markdown h6 a.anchor{opacity:0;font-size:.75em;vertical-align:middle;text-decoration:none}.markdown h1:hover a.anchor,.markdown h1 a.anchor:focus,.markdown h2:hover a.anchor,.markdown h2 a.anchor:focus,.markdown h3:hover a.anchor,.markdown h3 a.anchor:focus,.markdown h4:hover a.anchor,.markdown h4 a.anchor:focus,.markdown h5:hover a.anchor,.markdown h5 a.anchor:focus,.markdown h6:hover a.anchor,.markdown h6 a.anchor:focus{opacity:initial}.markdown h4,.markdown h5,.markdown h6{font-weight:bolder}.markdown h5{font-size:.875em}.markdown h6{font-size:.75em}.markdown b,.markdown optgroup,.markdown strong{font-weight:bolder}.markdown a{text-decoration:none}.markdown a:hover{text-decoration:underline}.markdown a:visited{color:var(--color-visited-link)}.markdown img{max-width:100%}.markdown code{padding:0 .25rem;background:var(--gray-200);border-radius:.25rem;font-size:.875em}.markdown pre{padding:1rem;background:var(--gray-100);border-radius:.25rem;overflow-x:auto}.markdown pre code{padding:0;background:0 0}.markdown blockquote{margin:1rem 0;padding:.5rem 1rem .5rem .75rem;border-inline-start:.25rem solid var(--gray-200);border-radius:.25rem}.markdown blockquote :first-child{margin-top:0}.markdown blockquote :last-child{margin-bottom:0}.markdown table{overflow:auto;display:block;border-spacing:0;border-collapse:collapse;margin-top:1rem;margin-bottom:1rem}.markdown table tr th,.markdown table tr td{padding:.5rem 1rem;border:1px solid var(--gray-200)}.markdown table tr:nth-child(2n){background:var(--gray-100)}.markdown hr{height:1px;border:none;background:var(--gray-200)}.markdown ul,.markdown ol{padding-inline-start:2rem}.markdown dl dt{font-weight:bolder;margin-top:1rem}.markdown dl dd{margin-inline-start:1rem;margin-bottom:1rem}.markdown .highlight table tr td:nth-child(1) pre{margin:0;padding-inline-end:0}.markdown .highlight table tr td:nth-child(2) pre{margin:0;padding-inline-start:0}.markdown details{padding:1rem;border:1px solid var(--gray-200);border-radius:.25rem}.markdown details summary{line-height:1;padding:1rem;margin:-1rem;cursor:pointer}.markdown details[open] summary{margin-bottom:0}.markdown figure{margin:1rem 0}.markdown figure figcaption p{margin-top:0}.markdown-inner>:first-child{margin-top:0}.markdown-inner>:last-child{margin-bottom:0}.markdown .book-expand{margin-top:1rem;margin-bottom:1rem;border:1px solid var(--gray-200);border-radius:.25rem;overflow:hidden}.markdown .book-expand .book-expand-head{background:var(--gray-100);padding:.5rem 1rem;cursor:pointer}.markdown .book-expand .book-expand-content{display:none;padding:1rem}.markdown .book-expand input[type=checkbox]:checked+.book-expand-content{display:block}.markdown .book-tabs{margin-top:1rem;margin-bottom:1rem;border:1px solid var(--gray-200);border-radius:.25rem;overflow:hidden;display:flex;flex-wrap:wrap}.markdown .book-tabs label{display:inline-block;padding:.5rem 1rem;border-bottom:1px transparent;cursor:pointer}.markdown .book-tabs .book-tabs-content{order:999;width:100%;border-top:1px solid var(--gray-100);padding:1rem;display:none}.markdown .book-tabs input[type=radio]:checked+label{border-bottom:1px solid var(--color-link)}.markdown .book-tabs input[type=radio]:checked+label+.book-tabs-content{display:block}.markdown .book-tabs input[type=radio]:focus+label{outline-style:auto;outline-color:currentColor;outline-color:-webkit-focus-ring-color}.markdown .book-columns{margin-left:-1rem;margin-right:-1rem}.markdown .book-columns>div{margin:1rem 0;min-width:10rem;padding:0 1rem}.markdown a.book-btn{display:inline-block;font-size:.875rem;color:var(--color-link);line-height:2rem;padding:0 1rem;border:1px solid var(--color-link);border-radius:.25rem;cursor:pointer}.markdown a.book-btn:hover{text-decoration:none}.markdown .book-hint.info{border-color:#6bf;background-color:rgba(102,187,255,.1)}.markdown .book-hint.warning{border-color:#fd6;background-color:rgba(255,221,102,.1)}.markdown .book-hint.danger{border-color:#f66;background-color:rgba(255,102,102,.1)}
\ No newline at end of file
diff --git a/website/themes/book/exampleSite/resources/_gen/assets/scss/book.scss_50fc8c04e12a2f59027287995557ceff.json b/website/themes/book/exampleSite/resources/_gen/assets/scss/book.scss_50fc8c04e12a2f59027287995557ceff.json
index fe66a39d0..f22fdaa76 100644
--- a/website/themes/book/exampleSite/resources/_gen/assets/scss/book.scss_50fc8c04e12a2f59027287995557ceff.json
+++ b/website/themes/book/exampleSite/resources/_gen/assets/scss/book.scss_50fc8c04e12a2f59027287995557ceff.json
@@ -1 +1 @@
-{"Target":"book.min.6cd8553a6854f4812343f0f0c8baca31271e686434f381fbe3c7226f66639176.css","MediaType":"text/css","Data":{"Integrity":"sha256-bNhVOmhU9IEjQ/DwyLrKMSceaGQ084H748cib2ZjkXY="}}
\ No newline at end of file
+{"Target":"book.min.5ac6c2989f0943405962be6800b442aef429ef26ade26545ecf0617a21d1197a.css","MediaType":"text/css","Data":{"Integrity":"sha256-WsbCmJ8JQ0BZYr5oALRCrvQp7yat4mVF7PBheiHRGXo="}}
\ No newline at end of file
diff --git a/website/themes/book/exampleSite/resources/_gen/assets/scss/example/book.scss_50fc8c04e12a2f59027287995557ceff.content b/website/themes/book/exampleSite/resources/_gen/assets/scss/example/book.scss_50fc8c04e12a2f59027287995557ceff.content
deleted file mode 100644
index 33ab91412..000000000
--- a/website/themes/book/exampleSite/resources/_gen/assets/scss/example/book.scss_50fc8c04e12a2f59027287995557ceff.content
+++ /dev/null
@@ -1 +0,0 @@
-@charset "UTF-8";/*!normalize.css v8.0.1 | MIT License | github.com/necolas/normalize.css*/html{line-height:1.15;-webkit-text-size-adjust:100%}body{margin:0}main{display:block}h1{font-size:2em;margin:.67em 0}hr{box-sizing:content-box;height:0;overflow:visible}pre{font-family:monospace,monospace;font-size:1em}a{background-color:transparent}abbr[title]{border-bottom:none;text-decoration:underline;text-decoration:underline dotted}b,strong{font-weight:bolder}code,kbd,samp{font-family:monospace,monospace;font-size:1em}small{font-size:80%}sub,sup{font-size:75%;line-height:0;position:relative;vertical-align:baseline}sub{bottom:-.25em}sup{top:-.5em}img{border-style:none}button,input,optgroup,select,textarea{font-family:inherit;font-size:100%;line-height:1.15;margin:0}button,input{overflow:visible}button,select{text-transform:none}button,[type=button],[type=reset],[type=submit]{-webkit-appearance:button}button::-moz-focus-inner,[type=button]::-moz-focus-inner,[type=reset]::-moz-focus-inner,[type=submit]::-moz-focus-inner{border-style:none;padding:0}button:-moz-focusring,[type=button]:-moz-focusring,[type=reset]:-moz-focusring,[type=submit]:-moz-focusring{outline:1px dotted ButtonText}fieldset{padding:.35em .75em .625em}legend{box-sizing:border-box;color:inherit;display:table;max-width:100%;padding:0;white-space:normal}progress{vertical-align:baseline}textarea{overflow:auto}[type=checkbox],[type=radio]{box-sizing:border-box;padding:0}[type=number]::-webkit-inner-spin-button,[type=number]::-webkit-outer-spin-button{height:auto}[type=search]{-webkit-appearance:textfield;outline-offset:-2px}[type=search]::-webkit-search-decoration{-webkit-appearance:none}::-webkit-file-upload-button{-webkit-appearance:button;font:inherit}details{display:block}summary{display:list-item}template{display:none}[hidden]{display:none}.flex{display:flex}.flex-auto{flex:1 1 auto}.flex-even{flex:1 1}.flex-wrap{flex-wrap:wrap}.justify-start{justify-content:flex-start}.justify-end{justify-content:flex-end}.justify-center{justify-content:center}.justify-between{justify-content:space-between}.align-center{align-items:center}.mx-auto{margin:0 auto}.text-center{text-align:center}.hidden{display:none}.clearfix::after{content:"";display:table;clear:both}html{font-size:16px;letter-spacing:.33px;scroll-behavior:smooth;touch-action:manipulation}html,body{min-width:20rem;overflow-x:hidden}body{color:#000;background:#fff;font-weight:400;text-rendering:optimizeLegibility;-webkit-font-smoothing:antialiased;-moz-osx-font-smoothing:grayscale;box-sizing:border-box}body *{box-sizing:inherit}h1,h2,h3,h4,h5{font-weight:400}a{text-decoration:none;color:#05b}img{vertical-align:baseline}aside nav ul{padding:0;margin:0;list-style:none}aside nav ul li{margin:1em 0;position:relative}aside nav ul a{display:block}aside nav ul a:hover{opacity:.5}aside nav ul ul{padding-left:1rem}ul.pagination{display:flex;justify-content:center;list-style-type:none}ul.pagination .page-item a{padding:1rem}.container{max-width:80rem;margin:0 auto}.book-icon{filter:none}.book-brand{margin-top:0}.book-brand img{height:1.5em;width:auto;vertical-align:middle;margin-right:.5rem}.book-menu{flex:0 0 16rem;font-size:.875rem}.book-menu nav{width:16rem;padding:1rem;position:fixed;top:0;bottom:0;overflow-x:hidden;overflow-y:auto}.book-menu a{color:inherit;word-wrap:break-word}.book-menu a.active{color:#05b}.book-menu a.collapsed::after{content:"▸";position:absolute;right:0}.book-section-flat{margin-bottom:2rem}.book-section-flat:not(:first-child){margin-top:2rem}.book-section-flat>a,.book-section-flat>span{font-weight:bolder}.book-section-flat>ul{padding-left:0}.book-page{min-width:20rem;flex-grow:1;padding:1rem}.book-post{margin-bottom:3rem}.book-header{display:none;margin-bottom:1rem}.book-header label{line-height:0}.book-search{position:relative;margin:1rem 0;border-bottom:1px solid transparent}.book-search::after{display:block;content:"";clear:both}.book-search input{width:100%;padding:.5rem;border:0;border-radius:.25rem;background:#f8f9fa;color:#000}.book-search input:required+.book-search-spinner{display:block}.book-search .book-search-spinner{position:absolute;margin:.5rem;right:0;top:0;width:1rem;height:1rem;border:1px solid transparent;border-top-color:#000;border-radius:50%;animation:spin 1s ease infinite}@keyframes spin{100%{transform:rotate(360deg)}}.book-toc{flex:0 0 16rem;font-size:.75rem}.book-toc nav{width:16rem;padding:1rem;position:fixed;top:0;bottom:0;overflow-x:hidden;overflow-y:auto}.book-toc img{height:1em}.book-toc nav>ul>li:first-child{margin-top:0}.book-footer{padding-top:1rem;font-size:.875rem}.book-footer img{height:1em;margin-right:.5rem}.book-comments{margin-top:1rem}.book-languages{position:relative;overflow:visible;padding:1rem;margin:-1rem}.book-languages ul{margin:0;padding:0;list-style:none}.book-languages ul li{white-space:nowrap;cursor:pointer}.book-languages:hover .book-languages-list,.book-languages:focus .book-languages-list,.book-languages:focus-within .book-languages-list{display:block}.book-languages .book-languages-list{display:none;position:absolute;bottom:100%;left:0;padding:.5rem 0;background:#fff;box-shadow:0 0 .25rem rgba(0,0,0,.1)}.book-languages .book-languages-list li img{opacity:.25}.book-languages .book-languages-list li.active img,.book-languages .book-languages-list li:hover img{opacity:1}.book-languages .book-languages-list a{color:inherit;padding:.5rem 1rem}.book-home{padding:1rem}aside nav,.book-page,.book-header aside,.markdown{transition:.2s ease-in-out;transition-property:transform,margin,opacity;will-change:transform,margin}@media screen and (max-width:56rem){.book-menu{margin-left:-16rem;font-size:16px}.book-toc{display:none}.book-header{display:block}#menu-control:checked+main .book-menu nav,#menu-control:checked+main .book-page{transform:translateX(16rem)}#menu-control:checked+main .book-header aside,#menu-control:checked+main .markdown{opacity:.25}#menu-control:checked+main .book-menu-overlay{display:block;position:absolute;top:0;bottom:0;left:0;right:0}#toc-control:checked+aside{display:block}}@media screen and (min-width:80rem){.book-page,.book-menu nav,.book-toc nav{padding:2rem 1rem}}@font-face{font-family:roboto;font-style:italic;font-weight:300;font-display:swap;src:local("Roboto Light Italic"),local("Roboto-LightItalic"),url(fonts/roboto-v19-latin-300italic.woff2)format("woff2"),url(fonts/roboto-v19-latin-300italic.woff)format("woff")}@font-face{font-family:roboto;font-style:normal;font-weight:400;font-display:swap;src:local("Roboto"),local("Roboto-Regular"),url(fonts/roboto-v19-latin-regular.woff2)format("woff2"),url(fonts/roboto-v19-latin-regular.woff)format("woff")}@font-face{font-family:roboto;font-style:normal;font-weight:700;font-display:swap;src:local("Roboto Bold"),local("Roboto-Bold"),url(fonts/roboto-v19-latin-700.woff2)format("woff2"),url(fonts/roboto-v19-latin-700.woff)format("woff")}@font-face{font-family:roboto mono;font-style:normal;font-weight:400;font-display:swap;src:local("Roboto Mono"),local("RobotoMono-Regular"),url(fonts/roboto-mono-v6-latin-regular.woff2)format("woff2"),url(fonts/roboto-mono-v6-latin-regular.woff)format("woff")}body{font-family:roboto,sans-serif}code{font-family:roboto mono,monospace}@media print{.book-menu,.book-footer,.book-toc{display:none}.book-header,.book-header aside{display:block}main{display:block!important}}.markdown{line-height:1.6em}.markdown>:first-child{margin-top:0}.markdown h1,.markdown h2,.markdown h3,.markdown h4,.markdown h5,.markdown h6{font-weight:400;line-height:1em;margin-top:1.5em;margin-bottom:1rem}.markdown h4,.markdown h5,.markdown h6{font-weight:bolder}.markdown h5{font-size:.875em}.markdown h6{font-size:.75em}.markdown b,.markdown optgroup,.markdown strong{font-weight:bolder}.markdown a{text-decoration:none}.markdown a:hover{text-decoration:underline}.markdown a:visited{color:#8440f1}.markdown img{max-width:100%}.markdown code{padding:0 .25rem;background:#e9ecef;border-radius:.25rem;font-size:.875em}.markdown pre{padding:1rem;background:#f8f9fa;border-radius:.25rem;overflow-x:auto}.markdown pre code{padding:0;background:0 0}.markdown blockquote{margin:1rem 0;padding:.5rem 1rem .5rem .75rem;border-left:.25rem solid #e9ecef;border-radius:.25rem}.markdown blockquote :first-child{margin-top:0}.markdown blockquote :last-child{margin-bottom:0}.markdown table{overflow:auto;display:block;border-spacing:0;border-collapse:collapse;margin-top:1rem;margin-bottom:1rem}.markdown table tr th,.markdown table tr td{padding:.5rem 1rem;border:1px solid #e9ecef}.markdown table tr:nth-child(2n){background:#f8f9fa}.markdown hr{height:1px;border:none;background:#e9ecef}.markdown ul,.markdown ol{padding-left:2rem}.markdown dl dt{font-weight:bolder;margin-top:1rem}.markdown dl dd{margin-left:2rem}.markdown .highlight table tr td:nth-child(1) pre{margin:0;padding-right:0}.markdown .highlight table tr td:nth-child(2) pre{margin:0;padding-left:0}.markdown details{padding:1rem;border:1px solid #e9ecef;border-radius:.25rem}.markdown details summary{line-height:1;cursor:pointer}.markdown-inner>:first-child{margin-top:0}.markdown-inner>:last-child{margin-bottom:0}.markdown .book-expand{margin-top:1rem;margin-bottom:1rem;border:1px solid #e9ecef;border-radius:.25rem;overflow:hidden}.markdown .book-expand .book-expand-head{background:#f8f9fa;padding:.5rem 1rem;cursor:pointer}.markdown .book-expand .book-expand-content{display:none;padding:1rem}.markdown .book-expand input[type=checkbox]:checked+.book-expand-content{display:block}.markdown .book-tabs{margin-top:1rem;margin-bottom:1rem;border:1px solid #e9ecef;border-radius:.25rem;overflow:hidden;display:flex;flex-wrap:wrap}.markdown .book-tabs label{display:inline-block;padding:.5rem 1rem;border-bottom:1px transparent;cursor:pointer}.markdown .book-tabs .book-tabs-content{order:999;width:100%;border-top:1px solid #f8f9fa;padding:1rem;display:none}.markdown .book-tabs input[type=radio]:checked+label{border-bottom:1px solid #05b}.markdown .book-tabs input[type=radio]:checked+label+.book-tabs-content{display:block}.markdown .book-columns{margin-left:-1rem;margin-right:-1rem}.markdown .book-columns>div{margin:1rem 0;min-width:10rem;padding:0 1rem}.markdown a.book-btn{display:inline-block;font-size:.875rem;color:#05b;line-height:2rem;padding:0 1rem;border:1px solid #05b;border-radius:.25rem;cursor:pointer}.markdown a.book-btn:hover{text-decoration:none}.markdown .book-hint.info{border-left-color:#6bf;background-color:rgba(102,187,255,.1)}.markdown .book-hint.warning{border-left-color:#fd6;background-color:rgba(255,221,102,.1)}.markdown .book-hint.danger{border-left-color:#f66;background-color:rgba(255,102,102,.1)}
\ No newline at end of file
diff --git a/website/themes/book/exampleSite/resources/_gen/assets/scss/example/book.scss_50fc8c04e12a2f59027287995557ceff.json b/website/themes/book/exampleSite/resources/_gen/assets/scss/example/book.scss_50fc8c04e12a2f59027287995557ceff.json
deleted file mode 100644
index 293c3d66a..000000000
--- a/website/themes/book/exampleSite/resources/_gen/assets/scss/example/book.scss_50fc8c04e12a2f59027287995557ceff.json
+++ /dev/null
@@ -1 +0,0 @@
-{"Target":"book.min.284c8fc21ced13c579d9027a9d14893c56b243c6045001180391cebb4cc36ab8.css","MediaType":"text/css","Data":{"Integrity":"sha256-KEyPwhztE8V52QJ6nRSJPFayQ8YEUAEYA5HOu0zDarg="}}
\ No newline at end of file
diff --git a/website/themes/book/i18n/bn.yaml b/website/themes/book/i18n/bn.yaml
new file mode 100644
index 000000000..853b72745
--- /dev/null
+++ b/website/themes/book/i18n/bn.yaml
@@ -0,0 +1,14 @@
+- id: Search
+ translation: অনুসন্ধান
+
+- id: Edit this page
+ translation: এই পৃষ্ঠাটি সম্পাদনা করুন
+
+- id: Last modified by
+ translation: সর্বশেষ সম্পাদনা করেছেন
+
+- id: Expand
+ translation: বিস্তৃত করা
+
+- id: bookSearchConfig
+ translation: '{ cache: true }'
diff --git a/website/themes/book/i18n/tr.yaml b/website/themes/book/i18n/tr.yaml
new file mode 100644
index 000000000..518c84190
--- /dev/null
+++ b/website/themes/book/i18n/tr.yaml
@@ -0,0 +1,14 @@
+- id: Search
+ translation: Arama
+
+- id: Edit this page
+ translation: Bu sayfayı düzenle
+
+- id: Last modified by
+ translation: Son düzenleyen
+
+- id: Expand
+ translation: Genişlet
+
+- id: bookSearchConfig
+ translation: '{ cache: true }'
diff --git a/website/themes/book/i18n/zh-TW.yaml b/website/themes/book/i18n/zh-TW.yaml
new file mode 100644
index 000000000..7ed7f3af5
--- /dev/null
+++ b/website/themes/book/i18n/zh-TW.yaml
@@ -0,0 +1,20 @@
+- id: Search
+ translation: 搜索
+
+- id: Edit this page
+ translation: 編輯頁面
+
+- id: Last modified by
+ translation: 最後修改者
+
+- id: Expand
+ translation: 展開
+
+- id: bookSearchConfig
+ translation: |
+ {
+ encode: false,
+ tokenize: function(str) {
+ return str.replace(/[\x00-\x7F]/g, '').split('');
+ }
+ }
diff --git a/website/themes/book/layouts/_default/baseof.html b/website/themes/book/layouts/_default/baseof.html
index 8108c39f6..b30c0bee4 100644
--- a/website/themes/book/layouts/_default/baseof.html
+++ b/website/themes/book/layouts/_default/baseof.html
@@ -1,12 +1,13 @@
<!DOCTYPE html>
-<html lang="{{ .Site.Language.Lang }}" dir={{ .Site.Language.LanguageDirection }}>
+<html lang="{{ .Site.Language.Lang }}" dir="{{ .Site.Language.LanguageDirection | default "ltr" }}">
<head>
+ {{ hugo.Generator }}
{{ partial "docs/html-head" . }}
{{ partial "docs/inject/head" . }}
</head>
-<body dir={{ .Site.Language.LanguageDirection }}>
+<body dir="{{ .Site.Language.LanguageDirection | default "ltr" }}">
<input type="checkbox" class="hidden toggle" id="menu-control" />
<input type="checkbox" class="hidden toggle" id="toc-control" />
@@ -14,7 +15,9 @@
<main class="container flex">
<aside class="book-menu">
- {{ template "menu" . }} <!-- Left menu Content -->
+ <div class="book-menu-content">
+ {{ template "menu" . }} <!-- Left menu Content -->
+ </div>
</aside>
<div class="book-page">
@@ -38,7 +41,9 @@
{{ if default true (default .Site.Params.BookToC .Params.BookToC) }}
<aside class="book-toc">
- {{ template "toc" . }} <!-- Table of Contents -->
+ <div class="book-toc-content">
+ {{ template "toc" . }} <!-- Table of Contents -->
+ </div>
</aside>
{{ end }}
</main>
diff --git a/website/themes/book/layouts/partials/docs/footer.html b/website/themes/book/layouts/partials/docs/footer.html
index 048e2bba9..b506f18c5 100644
--- a/website/themes/book/layouts/partials/docs/footer.html
+++ b/website/themes/book/layouts/partials/docs/footer.html
@@ -6,7 +6,8 @@
{{ if and .GitInfo .Site.Params.BookRepo }}
<div>
{{- $date := partial "docs/date" (dict "Date" .GitInfo.AuthorDate.Local "Format" .Site.Params.BookDateFormat) -}}
- <a class="flex align-center" href="{{ .Site.Params.BookRepo }}/commit/{{ .GitInfo.Hash }}" title='{{ i18n "Last modified by" }} {{ .GitInfo.AuthorName }} | {{ $date }}' target="_blank" rel="noopener">
+ {{- $commitPath := default "commit" .Site.Params.BookCommitPath -}}
+ <a class="flex align-center" href="{{ .Site.Params.BookRepo }}/{{ $commitPath }}/{{ .GitInfo.Hash }}" title='{{ i18n "Last modified by" }} {{ .GitInfo.AuthorName }} | {{ $date }}' target="_blank" rel="noopener">
<img src="{{ "svg/calendar.svg" | relURL }}" class="book-icon" alt="Calendar" />
<span>{{ $date }}</span>
</a>
@@ -15,13 +16,13 @@
{{ if and .File .Site.Params.BookRepo .Site.Params.BookEditPath }}
<div>
- <a class="flex align-center" href="{{ .Site.Params.BookRepo }}/{{ .Site.Params.BookEditPath }}/{{ .Site.Params.contentDir }}/{{ replace .File.Path "\\" "/" }}" target="_blank" rel="noopener">
+ <a class="flex align-center" href="{{ .Site.Params.BookRepo }}/{{ .Site.Params.BookEditPath }}/{{ .Site.Params.contentDir | default "content" }}/{{ replace .File.Path "\\" "/" }}" target="_blank" rel="noopener">
<img src="{{ "svg/edit.svg" | relURL }}" class="book-icon" alt="Edit" />
<span>{{ i18n "Edit this page" }}</span>
</a>
</div>
{{ end }}
{{ partial "docs/gitalk.html" . }}
-<span id="busuanzi_container_site_pv">本站总访问量: <span id="busuanzi_value_site_pv"></span> 次</span>
-<span id="busuanzi_container_site_uv">您是本站第 <span id="busuanzi_value_site_uv"></span> 位访问者</span>
+<span id="busuanzi_container_site_pv">本站总访问量: <span id="busuanzi_value_site_pv"></span> 次</span>
+<span id="busuanzi_container_site_uv">您是本站第 <span id="busuanzi_value_site_uv"></span> 位访问者</span>
</div>
diff --git a/website/themes/book/layouts/partials/docs/gitalk.html b/website/themes/book/layouts/partials/docs/gitalk.html
index 28927cfab..0bd80aa0c 100644
--- a/website/themes/book/layouts/partials/docs/gitalk.html
+++ b/website/themes/book/layouts/partials/docs/gitalk.html
@@ -12,7 +12,8 @@
admin: ['{{ .Site.Params.Gitalk.owner }}'],
id: md5(location.pathname), // Ensure uniqueness and length less than 50
distractionFreeMode: false, // Facebook-like distraction free mode
- body: location.href // GitHub issue body.
+ body: location.href, // GitHub issue body.
+ proxy: '{{ .Site.Params.Gitalk.proxy }}' // Gitalke proxy
});
(function() {
if (["localhost", "127.0.0.1"].indexOf(window.location.hostname) != -1) {
diff --git a/website/themes/book/layouts/partials/docs/header.html b/website/themes/book/layouts/partials/docs/header.html
index abc4e0b3a..089859cc0 100644
--- a/website/themes/book/layouts/partials/docs/header.html
+++ b/website/themes/book/layouts/partials/docs/header.html
@@ -10,5 +10,4 @@
<img src="{{ "svg/toc.svg" | relURL }}" class="book-icon" alt="Table of Contents" />
{{ end }}
</label>
-
</div>
diff --git a/website/themes/book/layouts/partials/docs/html-head.html b/website/themes/book/layouts/partials/docs/html-head.html
index bc6a9d51d..cc915d0ef 100644
--- a/website/themes/book/layouts/partials/docs/html-head.html
+++ b/website/themes/book/layouts/partials/docs/html-head.html
@@ -26,8 +26,24 @@
{{ end -}}
{{- if .Site.Params.BookServiceWorker }}
-{{- $swJS := resources.Get "sw-register.js" | resources.ExecuteAsTemplate "sw.js" . | resources.Minify | resources.Fingerprint }}
-<script defer src="{{ $swJS.RelPermalink }}" integrity="{{ $swJS.Data.Integrity }}"></script>
+<!-- {{- $swJS := resources.Get "sw-register.js" | resources.ExecuteAsTemplate "sw.js" . | resources.Minify | resources.Fingerprint }}
+<script defer src="{{ $swJS.RelPermalink }}" integrity="{{ $swJS.Data.Integrity }}"></script> -->
+{{- $swJS := resources.Get "serviceworker-v1.js" | resources.Minify | resources.Fingerprint }}
+<script async>
+ if ('serviceWorker' in navigator) {
+ navigator.serviceWorker.register("{{ $swJS.RelPermalink }}").then(function() {
+ if (navigator.serviceWorker.controller) {
+ console.log('Assets cached by the controlling service worker.');
+ } else {
+ console.log('Please reload this page to allow the service worker to handle network operations.');
+ }
+ }).catch(function(error) {
+ console.log('ERROR: ' + error);
+ });
+ } else {
+ console.log('Service workers are not supported in the current browser.');
+ }
+</script>
{{ end -}}
<script async src="//busuanzi.ibruce.info/busuanzi/2.3/busuanzi.pure.mini.js"></script>
diff --git a/website/themes/book/layouts/partials/docs/inject/head.html b/website/themes/book/layouts/partials/docs/inject/head.html
index edca74ec8..83617b7fc 100644
--- a/website/themes/book/layouts/partials/docs/inject/head.html
+++ b/website/themes/book/layouts/partials/docs/inject/head.html
@@ -1,9 +1,11 @@
<link rel="stylesheet" href="/leetcode/prism.css"/>
-<link href="{{ "apple-touch-icon.png" | relURL }}"rel="apple-touch-icon" />
+<link href="{{ "apple-touch-icon-60x60.png" | relURL }}" rel="apple-touch-icon" sizes="60x60" />
<link href="{{ "apple-touch-icon-76x76.png" | relURL }}" rel="apple-touch-icon" sizes="76x76" />
<link href="{{ "apple-touch-icon-120x120.png" | relURL }}" rel="apple-touch-icon" sizes="120x120" />
<link href="{{ "apple-touch-icon-152x152.png" | relURL }}" rel="apple-touch-icon" sizes="152x152" />
+<link href="{{ "apple-touch-icon-180x180.png" | relURL }}" rel="apple-touch-icon" sizes="180x180"/>
<link href="{{ "apple-touch-icon-512x512.png" | relURL }}" rel="apple-touch-icon" sizes="512x512" />
+<link href="{{ "apple-touch-icon-1024x1024.png" | relURL }}" rel="apple-touch-icon" sizes="1024x1024" />
<script>
var html = document.documentElement;
diff --git a/website/themes/book/layouts/partials/docs/inject/toc-after.html b/website/themes/book/layouts/partials/docs/inject/toc-after.html
new file mode 100644
index 000000000..e69de29bb
diff --git a/website/themes/book/layouts/partials/docs/inject/toc-before.html b/website/themes/book/layouts/partials/docs/inject/toc-before.html
new file mode 100644
index 000000000..e69de29bb
diff --git a/website/themes/book/layouts/partials/docs/languages.html b/website/themes/book/layouts/partials/docs/languages.html
index 14e0e2c4b..402027566 100644
--- a/website/themes/book/layouts/partials/docs/languages.html
+++ b/website/themes/book/layouts/partials/docs/languages.html
@@ -1,7 +1,10 @@
<!-- Merge home and current page translations -->
+{{ $bookTranslatedOnly := default false .Site.Params.BookTranslatedOnly }}
{{ $translations := dict }}
-{{ range .Site.Home.AllTranslations }}
- {{ $translations = merge $translations (dict .Language.Lang .) }}
+{{ if (eq $bookTranslatedOnly false ) }}
+ {{ range .Site.Home.AllTranslations }}
+ {{ $translations = merge $translations (dict .Language.Lang .) }}
+ {{ end }}
{{ end }}
{{ range .Translations }}
{{ $translations = merge $translations (dict .Language.Lang .) }}
diff --git a/website/themes/book/layouts/partials/docs/menu-filetree.html b/website/themes/book/layouts/partials/docs/menu-filetree.html
index fcde91e5a..a4835b214 100644
--- a/website/themes/book/layouts/partials/docs/menu-filetree.html
+++ b/website/themes/book/layouts/partials/docs/menu-filetree.html
@@ -8,11 +8,6 @@
{{ end }}
{{ define "book-section-children" }}{{/* (dict "Section" .Section "CurrentPage" .CurrentPage) */}}
- {{ $self := eq .CurrentPage .Section }}
- {{ $ancestor := .Section.IsAncestor .CurrentPage }}
- {{ $collapsed := .Section.Params.bookCollapseSection }}
-
- {{ if or $self $ancestor (not $collapsed) }}
<ul>
{{ range (where .Section.Pages "Params.bookhidden" "ne" true) }}
{{ if .IsSection }}
@@ -27,14 +22,21 @@
{{ end }}
{{ end }}
</ul>
- {{ end }}
{{ end }}
{{ define "book-page-link" }}{{/* (dict "Page" .Page "CurrentPage" .CurrentPage) */}}
- {{ if .Page.Content }}
- <a href="{{ .Page.RelPermalink }}" class="
- {{- if and .Page.Params.bookCollapseSection .Page.IsSection }}collapsed {{ end }}
- {{- if eq .CurrentPage .Page }}active{{ end }}">
+ {{ $current := eq .CurrentPage .Page }}
+ {{ $ancestor := .Page.IsAncestor .CurrentPage }}
+
+ {{ if .Page.Params.bookCollapseSection }}
+ <input type="checkbox" id="section-{{ md5 .Page }}" class="toggle" {{ if or $current $ancestor }}checked{{ end }} />
+ <label for="section-{{ md5 .Page }}" class="flex justify-between">
+ <a {{ if .Page.Content }}href="{{ .Page.Permalink }}"{{ end }} class="{{ if $current }}active{{ end }}">
+ {{- partial "docs/title" .Page -}}
+ </a>
+ </label>
+ {{ else if .Page.Content }}
+ <a href="{{ .Page.Permalink }}" class="{{ if $current }} active{{ end }}">
{{- partial "docs/title" .Page -}}
</a>
{{ else }}
diff --git a/website/themes/book/layouts/partials/docs/menu.html b/website/themes/book/layouts/partials/docs/menu.html
index 3a71f42da..ee76e8739 100644
--- a/website/themes/book/layouts/partials/docs/menu.html
+++ b/website/themes/book/layouts/partials/docs/menu.html
@@ -5,6 +5,8 @@
{{ partial "docs/inject/menu-before" . }}
{{ partial "docs/menu-hugo" .Site.Menus.before }}
+<hr>
+
{{ if .Site.Params.BookMenuBundle }}
{{ partial "docs/menu-bundle" . }}
{{ else }}
diff --git a/website/themes/book/layouts/partials/docs/post-meta.html b/website/themes/book/layouts/partials/docs/post-meta.html
index c56a52814..01adf8b7c 100644
--- a/website/themes/book/layouts/partials/docs/post-meta.html
+++ b/website/themes/book/layouts/partials/docs/post-meta.html
@@ -1,4 +1,4 @@
-{{ with .Date}}
+{{ with .Date }}
<h5>{{ partial "docs/date" (dict "Date" . "Format" $.Site.Params.BookDateFormat) }}</h5>
{{ end }}
@@ -11,3 +11,13 @@ <h5>{{ partial "docs/date" (dict "Date" . "Format" $.Site.Params.BookDateFormat)
</div>
{{ end }}
{{ end }}
+
+{{ if .Params.image }}
+<p>
+ {{ with .Resources.GetMatch .Params.image }}
+ <img src={{ .RelPermalink }} />
+ {{ else }}
+ <img src={{ .Params.image | relURL }} />
+ {{ end }}
+</p>
+{{ end }}
diff --git a/website/themes/book/layouts/partials/docs/toc.html b/website/themes/book/layouts/partials/docs/toc.html
index 64546ec06..64697a470 100644
--- a/website/themes/book/layouts/partials/docs/toc.html
+++ b/website/themes/book/layouts/partials/docs/toc.html
@@ -1 +1,3 @@
+{{ partial "docs/inject/toc-before" . }}
{{ .TableOfContents }}
+{{ partial "docs/inject/toc-after" . }}
diff --git a/website/themes/book/layouts/posts/list.html b/website/themes/book/layouts/posts/list.html
index 12207c861..badf0f618 100644
--- a/website/themes/book/layouts/posts/list.html
+++ b/website/themes/book/layouts/posts/list.html
@@ -2,7 +2,7 @@
{{ range sort .Paginator.Pages }}
<article class="markdown book-post">
<h2>
- <a href="{{ .RelPermalink }}">{{ .Title }}</a>
+ <a href="{{ .RelPermalink }}">{{ partial "docs/title.html" . }}</a>
</h2>
{{ partial "docs/post-meta" . }}
<p>
diff --git a/website/themes/book/layouts/posts/single.html b/website/themes/book/layouts/posts/single.html
index 00df69702..301ca1eee 100644
--- a/website/themes/book/layouts/posts/single.html
+++ b/website/themes/book/layouts/posts/single.html
@@ -1,12 +1,10 @@
{{ define "main" }}
<article class="markdown">
<h1>
- <a href="{{ .RelPermalink }}">{{ .Title }}</a>
+ <a href="{{ .RelPermalink }}">{{ partial "docs/title.html" . }}</a>
</h1>
{{ partial "docs/post-meta" . }}
- <p>
- {{- .Content -}}
- </p>
+ {{- .Content -}}
</article>
{{ end }}
diff --git a/website/themes/book/layouts/shortcodes/button.html b/website/themes/book/layouts/shortcodes/button.html
index 98d2cdda4..337a50f42 100644
--- a/website/themes/book/layouts/shortcodes/button.html
+++ b/website/themes/book/layouts/shortcodes/button.html
@@ -8,5 +8,5 @@
{{ $ref = relref $ . }}
{{ end }}
<a {{ with $ref }} href="{{.}}" {{ end }} {{ with $target }} target="{{.}}" {{ end }} class="book-btn{{ with .Get "class" }} {{ . }}{{ end }}">
- {{ $.Inner }}
+ {{ $.Inner | markdownify }}
</a>
diff --git a/website/themes/book/layouts/shortcodes/mermaid.html b/website/themes/book/layouts/shortcodes/mermaid.html
index 9a9436f61..ff9033503 100644
--- a/website/themes/book/layouts/shortcodes/mermaid.html
+++ b/website/themes/book/layouts/shortcodes/mermaid.html
@@ -1,11 +1,9 @@
{{ if not (.Page.Scratch.Get "mermaid") }}
<!-- Include mermaid only first time -->
<script src="{{ "mermaid.min.js" | relURL }}"></script>
-<script>
-mermaid.initialize({
- flowchart: { useMaxWidth:true }
-});
-</script>
+{{ with resources.Get "mermaid.json" }}
+ <script>mermaid.initialize({{ .Content | safeJS }})</script>
+{{ end }}
{{ .Page.Scratch.Set "mermaid" true }}
{{ end }}
diff --git a/website/themes/book/layouts/taxonomy/taxonomy.html b/website/themes/book/layouts/taxonomy/taxonomy.html
index 12207c861..badf0f618 100644
--- a/website/themes/book/layouts/taxonomy/taxonomy.html
+++ b/website/themes/book/layouts/taxonomy/taxonomy.html
@@ -2,7 +2,7 @@
{{ range sort .Paginator.Pages }}
<article class="markdown book-post">
<h2>
- <a href="{{ .RelPermalink }}">{{ .Title }}</a>
+ <a href="{{ .RelPermalink }}">{{ partial "docs/title.html" . }}</a>
</h2>
{{ partial "docs/post-meta" . }}
<p>
diff --git a/website/themes/book/static/js/sw-toolbox.js b/website/themes/book/static/js/sw-toolbox.js
new file mode 100644
index 000000000..dacb8553a
--- /dev/null
+++ b/website/themes/book/static/js/sw-toolbox.js
@@ -0,0 +1,16 @@
+/*
+ Copyright 2016 Google Inc. All Rights Reserved.
+
+ Licensed under the Apache License, Version 2.0 (the "License");
+ you may not use this file except in compliance with the License.
+ You may obtain a copy of the License at
+
+ http://www.apache.org/licenses/LICENSE-2.0
+
+ Unless required by applicable law or agreed to in writing, software
+ distributed under the License is distributed on an "AS IS" BASIS,
+ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ See the License for the specific language governing permissions and
+ limitations under the License.
+*/!function(e){if("object"==typeof exports&&"undefined"!=typeof module)module.exports=e();else if("function"==typeof define&&define.amd)define([],e);else{var t;t="undefined"!=typeof window?window:"undefined"!=typeof global?global:"undefined"!=typeof self?self:this,t.toolbox=e()}}(function(){return function e(t,n,r){function o(c,s){if(!n[c]){if(!t[c]){var a="function"==typeof require&&require;if(!s&&a)return a(c,!0);if(i)return i(c,!0);var u=new Error("Cannot find module '"+c+"'");throw u.code="MODULE_NOT_FOUND",u}var f=n[c]={exports:{}};t[c][0].call(f.exports,function(e){var n=t[c][1][e];return o(n||e)},f,f.exports,e,t,n,r)}return n[c].exports}for(var i="function"==typeof require&&require,c=0;c<r.length;c++)o(r[c]);return o}({1:[function(e,t,n){"use strict";function r(e,t){t=t||{},(t.debug||m.debug)&&console.log("[sw-toolbox] "+e)}function o(e){var t;return e&&e.cache&&(t=e.cache.name),t=t||m.cache.name,caches.open(t)}function i(e,t){t=t||{};var n=t.successResponses||m.successResponses;return fetch(e.clone()).then(function(r){return"GET"===e.method&&n.test(r.status)&&o(t).then(function(n){n.put(e,r).then(function(){var r=t.cache||m.cache;(r.maxEntries||r.maxAgeSeconds)&&r.name&&c(e,n,r)})}),r.clone()})}function c(e,t,n){var r=s.bind(null,e,t,n);d=d?d.then(r):r()}function s(e,t,n){var o=e.url,i=n.maxAgeSeconds,c=n.maxEntries,s=n.name,a=Date.now();return r("Updating LRU order for "+o+". Max entries is "+c+", max age is "+i),g.getDb(s).then(function(e){return g.setTimestampForUrl(e,o,a)}).then(function(e){return g.expireEntries(e,c,i,a)}).then(function(e){r("Successfully updated IDB.");var n=e.map(function(e){return t.delete(e)});return Promise.all(n).then(function(){r("Done with cache cleanup.")})}).catch(function(e){r(e)})}function a(e,t,n){return r("Renaming cache: ["+e+"] to ["+t+"]",n),caches.delete(t).then(function(){return Promise.all([caches.open(e),caches.open(t)]).then(function(t){var n=t[0],r=t[1];return n.keys().then(function(e){return Promise.all(e.map(function(e){return n.match(e).then(function(t){return r.put(e,t)})}))}).then(function(){return caches.delete(e)})})})}function u(e,t){return o(t).then(function(t){return t.add(e)})}function f(e,t){return o(t).then(function(t){return t.delete(e)})}function h(e){e instanceof Promise||p(e),m.preCacheItems=m.preCacheItems.concat(e)}function p(e){var t=Array.isArray(e);if(t&&e.forEach(function(e){"string"==typeof e||e instanceof Request||(t=!1)}),!t)throw new TypeError("The precache method expects either an array of strings and/or Requests or a Promise that resolves to an array of strings and/or Requests.");return e}function l(e,t,n){if(!e)return!1;if(t){var r=e.headers.get("date");if(r){if(new Date(r).getTime()+1e3*t<n)return!1}}return!0}var d,m=e("./options"),g=e("./idb-cache-expiration");t.exports={debug:r,fetchAndCache:i,openCache:o,renameCache:a,cache:u,uncache:f,precache:h,validatePrecacheInput:p,isResponseFresh:l}},{"./idb-cache-expiration":2,"./options":4}],2:[function(e,t,n){"use strict";function r(e){return new Promise(function(t,n){var r=indexedDB.open(u+e,f);r.onupgradeneeded=function(){r.result.createObjectStore(h,{keyPath:p}).createIndex(l,l,{unique:!1})},r.onsuccess=function(){t(r.result)},r.onerror=function(){n(r.error)}})}function o(e){return e in d||(d[e]=r(e)),d[e]}function i(e,t,n){return new Promise(function(r,o){var i=e.transaction(h,"readwrite");i.objectStore(h).put({url:t,timestamp:n}),i.oncomplete=function(){r(e)},i.onabort=function(){o(i.error)}})}function c(e,t,n){return t?new Promise(function(r,o){var i=1e3*t,c=[],s=e.transaction(h,"readwrite"),a=s.objectStore(h);a.index(l).openCursor().onsuccess=function(e){var t=e.target.result;if(t&&n-i>t.value[l]){var r=t.value[p];c.push(r),a.delete(r),t.continue()}},s.oncomplete=function(){r(c)},s.onabort=o}):Promise.resolve([])}function s(e,t){return t?new Promise(function(n,r){var o=[],i=e.transaction(h,"readwrite"),c=i.objectStore(h),s=c.index(l),a=s.count();s.count().onsuccess=function(){var e=a.result;e>t&&(s.openCursor().onsuccess=function(n){var r=n.target.result;if(r){var i=r.value[p];o.push(i),c.delete(i),e-o.length>t&&r.continue()}})},i.oncomplete=function(){n(o)},i.onabort=r}):Promise.resolve([])}function a(e,t,n,r){return c(e,n,r).then(function(n){return s(e,t).then(function(e){return n.concat(e)})})}var u="sw-toolbox-",f=1,h="store",p="url",l="timestamp",d={};t.exports={getDb:o,setTimestampForUrl:i,expireEntries:a}},{}],3:[function(e,t,n){"use strict";function r(e){var t=a.match(e.request);t?e.respondWith(t(e.request)):a.default&&"GET"===e.request.method&&0===e.request.url.indexOf("http")&&e.respondWith(a.default(e.request))}function o(e){s.debug("activate event fired");var t=u.cache.name+"$$$inactive$$$";e.waitUntil(s.renameCache(t,u.cache.name))}function i(e){return e.reduce(function(e,t){return e.concat(t)},[])}function c(e){var t=u.cache.name+"$$$inactive$$$";s.debug("install event fired"),s.debug("creating cache ["+t+"]"),e.waitUntil(s.openCache({cache:{name:t}}).then(function(e){return Promise.all(u.preCacheItems).then(i).then(s.validatePrecacheInput).then(function(t){return s.debug("preCache list: "+(t.join(", ")||"(none)")),e.addAll(t)})}))}e("serviceworker-cache-polyfill");var s=e("./helpers"),a=e("./router"),u=e("./options");t.exports={fetchListener:r,activateListener:o,installListener:c}},{"./helpers":1,"./options":4,"./router":6,"serviceworker-cache-polyfill":16}],4:[function(e,t,n){"use strict";var r;r=self.registration?self.registration.scope:self.scope||new URL("./",self.location).href,t.exports={cache:{name:"$$$toolbox-cache$$$"+r+"$$$",maxAgeSeconds:null,maxEntries:null,queryOptions:null},debug:!1,networkTimeoutSeconds:null,preCacheItems:[],successResponses:/^0|([123]\d\d)|(40[14567])|410$/}},{}],5:[function(e,t,n){"use strict";var r=new URL("./",self.location),o=r.pathname,i=e("path-to-regexp"),c=function(e,t,n,r){t instanceof RegExp?this.fullUrlRegExp=t:(0!==t.indexOf("/")&&(t=o+t),this.keys=[],this.regexp=i(t,this.keys)),this.method=e,this.options=r,this.handler=n};c.prototype.makeHandler=function(e){var t;if(this.regexp){var n=this.regexp.exec(e);t={},this.keys.forEach(function(e,r){t[e.name]=n[r+1]})}return function(e){return this.handler(e,t,this.options)}.bind(this)},t.exports=c},{"path-to-regexp":15}],6:[function(e,t,n){"use strict";function r(e){return e.replace(/[-\/\\^$*+?.()|[\]{}]/g,"\\$&")}var o=e("./route"),i=e("./helpers"),c=function(e,t){for(var n=e.entries(),r=n.next(),o=[];!r.done;){new RegExp(r.value[0]).test(t)&&o.push(r.value[1]),r=n.next()}return o},s=function(){this.routes=new Map,this.routes.set(RegExp,new Map),this.default=null};["get","post","put","delete","head","any"].forEach(function(e){s.prototype[e]=function(t,n,r){return this.add(e,t,n,r)}}),s.prototype.add=function(e,t,n,c){c=c||{};var s;t instanceof RegExp?s=RegExp:(s=c.origin||self.location.origin,s=s instanceof RegExp?s.source:r(s)),e=e.toLowerCase();var a=new o(e,t,n,c);this.routes.has(s)||this.routes.set(s,new Map);var u=this.routes.get(s);u.has(e)||u.set(e,new Map);var f=u.get(e),h=a.regexp||a.fullUrlRegExp;f.has(h.source)&&i.debug('"'+t+'" resolves to same regex as existing route.'),f.set(h.source,a)},s.prototype.matchMethod=function(e,t){var n=new URL(t),r=n.origin,o=n.pathname;return this._match(e,c(this.routes,r),o)||this._match(e,[this.routes.get(RegExp)],t)},s.prototype._match=function(e,t,n){if(0===t.length)return null;for(var r=0;r<t.length;r++){var o=t[r],i=o&&o.get(e.toLowerCase());if(i){var s=c(i,n);if(s.length>0)return s[0].makeHandler(n)}}return null},s.prototype.match=function(e){return this.matchMethod(e.method,e.url)||this.matchMethod("any",e.url)},t.exports=new s},{"./helpers":1,"./route":5}],7:[function(e,t,n){"use strict";function r(e,t,n){n=n||{};var r=n.cache||o.cache,c=r.queryOptions;return i.debug("Strategy: cache first ["+e.url+"]",n),i.openCache(n).then(function(t){return t.match(e,c).then(function(t){var o=Date.now();return i.isResponseFresh(t,r.maxAgeSeconds,o)?t:i.fetchAndCache(e,n)})})}var o=e("../options"),i=e("../helpers");t.exports=r},{"../helpers":1,"../options":4}],8:[function(e,t,n){"use strict";function r(e,t,n){n=n||{};var r=n.cache||o.cache,c=r.queryOptions;return i.debug("Strategy: cache only ["+e.url+"]",n),i.openCache(n).then(function(t){return t.match(e,c).then(function(e){var t=Date.now();if(i.isResponseFresh(e,r.maxAgeSeconds,t))return e})})}var o=e("../options"),i=e("../helpers");t.exports=r},{"../helpers":1,"../options":4}],9:[function(e,t,n){"use strict";function r(e,t,n){return o.debug("Strategy: fastest ["+e.url+"]",n),new Promise(function(r,c){var s=!1,a=[],u=function(e){a.push(e.toString()),s?c(new Error('Both cache and network failed: "'+a.join('", "')+'"')):s=!0},f=function(e){e instanceof Response?r(e):u("No result returned")};o.fetchAndCache(e.clone(),n).then(f,u),i(e,t,n).then(f,u)})}var o=e("../helpers"),i=e("./cacheOnly");t.exports=r},{"../helpers":1,"./cacheOnly":8}],10:[function(e,t,n){t.exports={networkOnly:e("./networkOnly"),networkFirst:e("./networkFirst"),cacheOnly:e("./cacheOnly"),cacheFirst:e("./cacheFirst"),fastest:e("./fastest")}},{"./cacheFirst":7,"./cacheOnly":8,"./fastest":9,"./networkFirst":11,"./networkOnly":12}],11:[function(e,t,n){"use strict";function r(e,t,n){n=n||{};var r=n.cache||o.cache,c=r.queryOptions,s=n.successResponses||o.successResponses,a=n.networkTimeoutSeconds||o.networkTimeoutSeconds;return i.debug("Strategy: network first ["+e.url+"]",n),i.openCache(n).then(function(t){var o,u,f=[];if(a){var h=new Promise(function(n){o=setTimeout(function(){t.match(e,c).then(function(e){var t=Date.now(),o=r.maxAgeSeconds;i.isResponseFresh(e,o,t)&&n(e)})},1e3*a)});f.push(h)}var p=i.fetchAndCache(e,n).then(function(e){if(o&&clearTimeout(o),s.test(e.status))return e;throw i.debug("Response was an HTTP error: "+e.statusText,n),u=e,new Error("Bad response")}).catch(function(r){return i.debug("Network or response error, fallback to cache ["+e.url+"]",n),t.match(e,c).then(function(e){if(e)return e;if(u)return u;throw r})});return f.push(p),Promise.race(f)})}var o=e("../options"),i=e("../helpers");t.exports=r},{"../helpers":1,"../options":4}],12:[function(e,t,n){"use strict";function r(e,t,n){return o.debug("Strategy: network only ["+e.url+"]",n),fetch(e)}var o=e("../helpers");t.exports=r},{"../helpers":1}],13:[function(e,t,n){"use strict";var r=e("./options"),o=e("./router"),i=e("./helpers"),c=e("./strategies"),s=e("./listeners");i.debug("Service Worker Toolbox is loading"),self.addEventListener("install",s.installListener),self.addEventListener("activate",s.activateListener),self.addEventListener("fetch",s.fetchListener),t.exports={networkOnly:c.networkOnly,networkFirst:c.networkFirst,cacheOnly:c.cacheOnly,cacheFirst:c.cacheFirst,fastest:c.fastest,router:o,options:r,cache:i.cache,uncache:i.uncache,precache:i.precache}},{"./helpers":1,"./listeners":3,"./options":4,"./router":6,"./strategies":10}],14:[function(e,t,n){t.exports=Array.isArray||function(e){return"[object Array]"==Object.prototype.toString.call(e)}},{}],15:[function(e,t,n){function r(e,t){for(var n,r=[],o=0,i=0,c="",s=t&&t.delimiter||"/";null!=(n=x.exec(e));){var f=n[0],h=n[1],p=n.index;if(c+=e.slice(i,p),i=p+f.length,h)c+=h[1];else{var l=e[i],d=n[2],m=n[3],g=n[4],v=n[5],w=n[6],y=n[7];c&&(r.push(c),c="");var b=null!=d&&null!=l&&l!==d,E="+"===w||"*"===w,R="?"===w||"*"===w,k=n[2]||s,$=g||v;r.push({name:m||o++,prefix:d||"",delimiter:k,optional:R,repeat:E,partial:b,asterisk:!!y,pattern:$?u($):y?".*":"[^"+a(k)+"]+?"})}}return i<e.length&&(c+=e.substr(i)),c&&r.push(c),r}function o(e,t){return s(r(e,t))}function i(e){return encodeURI(e).replace(/[\/?#]/g,function(e){return"%"+e.charCodeAt(0).toString(16).toUpperCase()})}function c(e){return encodeURI(e).replace(/[?#]/g,function(e){return"%"+e.charCodeAt(0).toString(16).toUpperCase()})}function s(e){for(var t=new Array(e.length),n=0;n<e.length;n++)"object"==typeof e[n]&&(t[n]=new RegExp("^(?:"+e[n].pattern+")$"));return function(n,r){for(var o="",s=n||{},a=r||{},u=a.pretty?i:encodeURIComponent,f=0;f<e.length;f++){var h=e[f];if("string"!=typeof h){var p,l=s[h.name];if(null==l){if(h.optional){h.partial&&(o+=h.prefix);continue}throw new TypeError('Expected "'+h.name+'" to be defined')}if(v(l)){if(!h.repeat)throw new TypeError('Expected "'+h.name+'" to not repeat, but received `'+JSON.stringify(l)+"`");if(0===l.length){if(h.optional)continue;throw new TypeError('Expected "'+h.name+'" to not be empty')}for(var d=0;d<l.length;d++){if(p=u(l[d]),!t[f].test(p))throw new TypeError('Expected all "'+h.name+'" to match "'+h.pattern+'", but received `'+JSON.stringify(p)+"`");o+=(0===d?h.prefix:h.delimiter)+p}}else{if(p=h.asterisk?c(l):u(l),!t[f].test(p))throw new TypeError('Expected "'+h.name+'" to match "'+h.pattern+'", but received "'+p+'"');o+=h.prefix+p}}else o+=h}return o}}function a(e){return e.replace(/([.+*?=^!:${}()[\]|\/\\])/g,"\\$1")}function u(e){return e.replace(/([=!:$\/()])/g,"\\$1")}function f(e,t){return e.keys=t,e}function h(e){return e.sensitive?"":"i"}function p(e,t){var n=e.source.match(/\((?!\?)/g);if(n)for(var r=0;r<n.length;r++)t.push({name:r,prefix:null,delimiter:null,optional:!1,repeat:!1,partial:!1,asterisk:!1,pattern:null});return f(e,t)}function l(e,t,n){for(var r=[],o=0;o<e.length;o++)r.push(g(e[o],t,n).source);return f(new RegExp("(?:"+r.join("|")+")",h(n)),t)}function d(e,t,n){return m(r(e,n),t,n)}function m(e,t,n){v(t)||(n=t||n,t=[]),n=n||{};for(var r=n.strict,o=!1!==n.end,i="",c=0;c<e.length;c++){var s=e[c];if("string"==typeof s)i+=a(s);else{var u=a(s.prefix),p="(?:"+s.pattern+")";t.push(s),s.repeat&&(p+="(?:"+u+p+")*"),p=s.optional?s.partial?u+"("+p+")?":"(?:"+u+"("+p+"))?":u+"("+p+")",i+=p}}var l=a(n.delimiter||"/"),d=i.slice(-l.length)===l;return r||(i=(d?i.slice(0,-l.length):i)+"(?:"+l+"(?=$))?"),i+=o?"$":r&&d?"":"(?="+l+"|$)",f(new RegExp("^"+i,h(n)),t)}function g(e,t,n){return v(t)||(n=t||n,t=[]),n=n||{},e instanceof RegExp?p(e,t):v(e)?l(e,t,n):d(e,t,n)}var v=e("isarray");t.exports=g,t.exports.parse=r,t.exports.compile=o,t.exports.tokensToFunction=s,t.exports.tokensToRegExp=m;var x=new RegExp(["(\\\\.)","([\\/.])?(?:(?:\\:(\\w+)(?:\\(((?:\\\\.|[^\\\\()])+)\\))?|\\(((?:\\\\.|[^\\\\()])+)\\))([+*?])?|(\\*))"].join("|"),"g")},{isarray:14}],16:[function(e,t,n){!function(){var e=Cache.prototype.addAll,t=navigator.userAgent.match(/(Firefox|Chrome)\/(\d+\.)/);if(t)var n=t[1],r=parseInt(t[2]);e&&(!t||"Firefox"===n&&r>=46||"Chrome"===n&&r>=50)||(Cache.prototype.addAll=function(e){function t(e){this.name="NetworkError",this.code=19,this.message=e}var n=this;return t.prototype=Object.create(Error.prototype),Promise.resolve().then(function(){if(arguments.length<1)throw new TypeError;return e=e.map(function(e){return e instanceof Request?e:String(e)}),Promise.all(e.map(function(e){"string"==typeof e&&(e=new Request(e));var n=new URL(e.url).protocol;if("http:"!==n&&"https:"!==n)throw new t("Invalid scheme");return fetch(e.clone())}))}).then(function(r){if(r.some(function(e){return!e.ok}))throw new t("Incorrect response status");return Promise.all(r.map(function(t,r){return n.put(e[r],t)}))}).then(function(){})},Cache.prototype.add=function(e){return this.addAll([e])})}()},{}]},{},[13])(13)});
+//# sourceMappingURL=sw-toolbox.js.map
diff --git a/website/themes/book/static/mermaid.min.js b/website/themes/book/static/mermaid.min.js
index 89f3721e4..48da6d6cc 100644
--- a/website/themes/book/static/mermaid.min.js
+++ b/website/themes/book/static/mermaid.min.js
@@ -1,11 +1,4 @@
-!function(t,e){"object"==typeof exports&&"object"==typeof module?module.exports=e():"function"==typeof define&&define.amd?define([],e):"object"==typeof exports?exports.mermaid=e():t.mermaid=e()}("undefined"!=typeof self?self:this,(function(){return function(t){var e={};function n(r){if(e[r])return e[r].exports;var i=e[r]={i:r,l:!1,exports:{}};return t[r].call(i.exports,i,i.exports,n),i.l=!0,i.exports}return n.m=t,n.c=e,n.d=function(t,e,r){n.o(t,e)||Object.defineProperty(t,e,{enumerable:!0,get:r})},n.r=function(t){"undefined"!=typeof Symbol&&Symbol.toStringTag&&Object.defineProperty(t,Symbol.toStringTag,{value:"Module"}),Object.defineProperty(t,"__esModule",{value:!0})},n.t=function(t,e){if(1&e&&(t=n(t)),8&e)return t;if(4&e&&"object"==typeof t&&t&&t.__esModule)return t;var r=Object.create(null);if(n.r(r),Object.defineProperty(r,"default",{enumerable:!0,value:t}),2&e&&"string"!=typeof t)for(var i in t)n.d(r,i,function(e){return t[e]}.bind(null,i));return r},n.n=function(t){var e=t&&t.__esModule?function(){return t.default}:function(){return t};return n.d(e,"a",e),e},n.o=function(t,e){return Object.prototype.hasOwnProperty.call(t,e)},n.p="",n(n.s=509)}([function(t,e,n){"use strict";n.r(e);var r=function(t,e){return t<e?-1:t>e?1:t>=e?0:NaN},i=function(t){var e;return 1===t.length&&(e=t,t=function(t,n){return r(e(t),n)}),{left:function(e,n,r,i){for(null==r&&(r=0),null==i&&(i=e.length);r<i;){var a=r+i>>>1;t(e[a],n)<0?r=a+1:i=a}return r},right:function(e,n,r,i){for(null==r&&(r=0),null==i&&(i=e.length);r<i;){var a=r+i>>>1;t(e[a],n)>0?i=a:r=a+1}return r}}};var a=i(r),o=a.right,s=a.left,u=o,c=function(t,e){null==e&&(e=f);for(var n=0,r=t.length-1,i=t[0],a=new Array(r<0?0:r);n<r;)a[n]=e(i,i=t[++n]);return a};function f(t,e){return[t,e]}var l=function(t,e,n){var r,i,a,o,s=t.length,u=e.length,c=new Array(s*u);for(null==n&&(n=f),r=a=0;r<s;++r)for(o=t[r],i=0;i<u;++i,++a)c[a]=n(o,e[i]);return c},h=function(t,e){return e<t?-1:e>t?1:e>=t?0:NaN},d=function(t){return null===t?NaN:+t},p=function(t,e){var n,r,i=t.length,a=0,o=-1,s=0,u=0;if(null==e)for(;++o<i;)isNaN(n=d(t[o]))||(u+=(r=n-s)*(n-(s+=r/++a)));else for(;++o<i;)isNaN(n=d(e(t[o],o,t)))||(u+=(r=n-s)*(n-(s+=r/++a)));if(a>1)return u/(a-1)},g=function(t,e){var n=p(t,e);return n?Math.sqrt(n):n},y=function(t,e){var n,r,i,a=t.length,o=-1;if(null==e){for(;++o<a;)if(null!=(n=t[o])&&n>=n)for(r=i=n;++o<a;)null!=(n=t[o])&&(r>n&&(r=n),i<n&&(i=n))}else for(;++o<a;)if(null!=(n=e(t[o],o,t))&&n>=n)for(r=i=n;++o<a;)null!=(n=e(t[o],o,t))&&(r>n&&(r=n),i<n&&(i=n));return[r,i]},b=Array.prototype,v=b.slice,m=b.map,_=function(t){return function(){return t}},w=function(t){return t},x=function(t,e,n){t=+t,e=+e,n=(i=arguments.length)<2?(e=t,t=0,1):i<3?1:+n;for(var r=-1,i=0|Math.max(0,Math.ceil((e-t)/n)),a=new Array(i);++r<i;)a[r]=t+r*n;return a},k=Math.sqrt(50),E=Math.sqrt(10),A=Math.sqrt(2),S=function(t,e,n){var r,i,a,o,s=-1;if(n=+n,(t=+t)===(e=+e)&&n>0)return[t];if((r=e<t)&&(i=t,t=e,e=i),0===(o=M(t,e,n))||!isFinite(o))return[];if(o>0)for(t=Math.ceil(t/o),e=Math.floor(e/o),a=new Array(i=Math.ceil(e-t+1));++s<i;)a[s]=(t+s)*o;else for(t=Math.floor(t*o),e=Math.ceil(e*o),a=new Array(i=Math.ceil(t-e+1));++s<i;)a[s]=(t-s)/o;return r&&a.reverse(),a};function M(t,e,n){var r=(e-t)/Math.max(0,n),i=Math.floor(Math.log(r)/Math.LN10),a=r/Math.pow(10,i);return i>=0?(a>=k?10:a>=E?5:a>=A?2:1)*Math.pow(10,i):-Math.pow(10,-i)/(a>=k?10:a>=E?5:a>=A?2:1)}function T(t,e,n){var r=Math.abs(e-t)/Math.max(0,n),i=Math.pow(10,Math.floor(Math.log(r)/Math.LN10)),a=r/i;return a>=k?i*=10:a>=E?i*=5:a>=A&&(i*=2),e<t?-i:i}var D=function(t){return Math.ceil(Math.log(t.length)/Math.LN2)+1},C=function(){var t=w,e=y,n=D;function r(r){var i,a,o=r.length,s=new Array(o);for(i=0;i<o;++i)s[i]=t(r[i],i,r);var c=e(s),f=c[0],l=c[1],h=n(s,f,l);Array.isArray(h)||(h=T(f,l,h),h=x(Math.ceil(f/h)*h,l,h));for(var d=h.length;h[0]<=f;)h.shift(),--d;for(;h[d-1]>l;)h.pop(),--d;var p,g=new Array(d+1);for(i=0;i<=d;++i)(p=g[i]=[]).x0=i>0?h[i-1]:f,p.x1=i<d?h[i]:l;for(i=0;i<o;++i)f<=(a=s[i])&&a<=l&&g[u(h,a,0,d)].push(r[i]);return g}return r.value=function(e){return arguments.length?(t="function"==typeof e?e:_(e),r):t},r.domain=function(t){return arguments.length?(e="function"==typeof t?t:_([t[0],t[1]]),r):e},r.thresholds=function(t){return arguments.length?(n="function"==typeof t?t:Array.isArray(t)?_(v.call(t)):_(t),r):n},r},N=function(t,e,n){if(null==n&&(n=d),r=t.length){if((e=+e)<=0||r<2)return+n(t[0],0,t);if(e>=1)return+n(t[r-1],r-1,t);var r,i=(r-1)*e,a=Math.floor(i),o=+n(t[a],a,t);return o+(+n(t[a+1],a+1,t)-o)*(i-a)}},I=function(t,e,n){return t=m.call(t,d).sort(r),Math.ceil((n-e)/(2*(N(t,.75)-N(t,.25))*Math.pow(t.length,-1/3)))},L=function(t,e,n){return Math.ceil((n-e)/(3.5*g(t)*Math.pow(t.length,-1/3)))},B=function(t,e){var n,r,i=t.length,a=-1;if(null==e){for(;++a<i;)if(null!=(n=t[a])&&n>=n)for(r=n;++a<i;)null!=(n=t[a])&&n>r&&(r=n)}else for(;++a<i;)if(null!=(n=e(t[a],a,t))&&n>=n)for(r=n;++a<i;)null!=(n=e(t[a],a,t))&&n>r&&(r=n);return r},O=function(t,e){var n,r=t.length,i=r,a=-1,o=0;if(null==e)for(;++a<r;)isNaN(n=d(t[a]))?--i:o+=n;else for(;++a<r;)isNaN(n=d(e(t[a],a,t)))?--i:o+=n;if(i)return o/i},R=function(t,e){var n,i=t.length,a=-1,o=[];if(null==e)for(;++a<i;)isNaN(n=d(t[a]))||o.push(n);else for(;++a<i;)isNaN(n=d(e(t[a],a,t)))||o.push(n);return N(o.sort(r),.5)},P=function(t){for(var e,n,r,i=t.length,a=-1,o=0;++a<i;)o+=t[a].length;for(n=new Array(o);--i>=0;)for(e=(r=t[i]).length;--e>=0;)n[--o]=r[e];return n},F=function(t,e){var n,r,i=t.length,a=-1;if(null==e){for(;++a<i;)if(null!=(n=t[a])&&n>=n)for(r=n;++a<i;)null!=(n=t[a])&&r>n&&(r=n)}else for(;++a<i;)if(null!=(n=e(t[a],a,t))&&n>=n)for(r=n;++a<i;)null!=(n=e(t[a],a,t))&&r>n&&(r=n);return r},q=function(t,e){for(var n=e.length,r=new Array(n);n--;)r[n]=t[e[n]];return r},j=function(t,e){if(n=t.length){var n,i,a=0,o=0,s=t[o];for(null==e&&(e=r);++a<n;)(e(i=t[a],s)<0||0!==e(s,s))&&(s=i,o=a);return 0===e(s,s)?o:void 0}},U=function(t,e,n){for(var r,i,a=(null==n?t.length:n)-(e=null==e?0:+e);a;)i=Math.random()*a--|0,r=t[a+e],t[a+e]=t[i+e],t[i+e]=r;return t},z=function(t,e){var n,r=t.length,i=-1,a=0;if(null==e)for(;++i<r;)(n=+t[i])&&(a+=n);else for(;++i<r;)(n=+e(t[i],i,t))&&(a+=n);return a},Y=function(t){if(!(i=t.length))return[];for(var e=-1,n=F(t,V),r=new Array(n);++e<n;)for(var i,a=-1,o=r[e]=new Array(i);++a<i;)o[a]=t[a][e];return r};function V(t){return t.length}var H=function(){return Y(arguments)},G=Array.prototype.slice,$=function(t){return t};function W(t){return"translate("+(t+.5)+",0)"}function K(t){return"translate(0,"+(t+.5)+")"}function X(t){return function(e){return+t(e)}}function Z(t){var e=Math.max(0,t.bandwidth()-1)/2;return t.round()&&(e=Math.round(e)),function(n){return+t(n)+e}}function J(){return!this.__axis}function Q(t,e){var n=[],r=null,i=null,a=6,o=6,s=3,u=1===t||4===t?-1:1,c=4===t||2===t?"x":"y",f=1===t||3===t?W:K;function l(l){var h=null==r?e.ticks?e.ticks.apply(e,n):e.domain():r,d=null==i?e.tickFormat?e.tickFormat.apply(e,n):$:i,p=Math.max(a,0)+s,g=e.range(),y=+g[0]+.5,b=+g[g.length-1]+.5,v=(e.bandwidth?Z:X)(e.copy()),m=l.selection?l.selection():l,_=m.selectAll(".domain").data([null]),w=m.selectAll(".tick").data(h,e).order(),x=w.exit(),k=w.enter().append("g").attr("class","tick"),E=w.select("line"),A=w.select("text");_=_.merge(_.enter().insert("path",".tick").attr("class","domain").attr("stroke","currentColor")),w=w.merge(k),E=E.merge(k.append("line").attr("stroke","currentColor").attr(c+"2",u*a)),A=A.merge(k.append("text").attr("fill","currentColor").attr(c,u*p).attr("dy",1===t?"0em":3===t?"0.71em":"0.32em")),l!==m&&(_=_.transition(l),w=w.transition(l),E=E.transition(l),A=A.transition(l),x=x.transition(l).attr("opacity",1e-6).attr("transform",(function(t){return isFinite(t=v(t))?f(t):this.getAttribute("transform")})),k.attr("opacity",1e-6).attr("transform",(function(t){var e=this.parentNode.__axis;return f(e&&isFinite(e=e(t))?e:v(t))}))),x.remove(),_.attr("d",4===t||2==t?o?"M"+u*o+","+y+"H0.5V"+b+"H"+u*o:"M0.5,"+y+"V"+b:o?"M"+y+","+u*o+"V0.5H"+b+"V"+u*o:"M"+y+",0.5H"+b),w.attr("opacity",1).attr("transform",(function(t){return f(v(t))})),E.attr(c+"2",u*a),A.attr(c,u*p).text(d),m.filter(J).attr("fill","none").attr("font-size",10).attr("font-family","sans-serif").attr("text-anchor",2===t?"start":4===t?"end":"middle"),m.each((function(){this.__axis=v}))}return l.scale=function(t){return arguments.length?(e=t,l):e},l.ticks=function(){return n=G.call(arguments),l},l.tickArguments=function(t){return arguments.length?(n=null==t?[]:G.call(t),l):n.slice()},l.tickValues=function(t){return arguments.length?(r=null==t?null:G.call(t),l):r&&r.slice()},l.tickFormat=function(t){return arguments.length?(i=t,l):i},l.tickSize=function(t){return arguments.length?(a=o=+t,l):a},l.tickSizeInner=function(t){return arguments.length?(a=+t,l):a},l.tickSizeOuter=function(t){return arguments.length?(o=+t,l):o},l.tickPadding=function(t){return arguments.length?(s=+t,l):s},l}function tt(t){return Q(1,t)}function et(t){return Q(2,t)}function nt(t){return Q(3,t)}function rt(t){return Q(4,t)}var it={value:function(){}};function at(){for(var t,e=0,n=arguments.length,r={};e<n;++e){if(!(t=arguments[e]+"")||t in r||/[\s.]/.test(t))throw new Error("illegal type: "+t);r[t]=[]}return new ot(r)}function ot(t){this._=t}function st(t,e){return t.trim().split(/^|\s+/).map((function(t){var n="",r=t.indexOf(".");if(r>=0&&(n=t.slice(r+1),t=t.slice(0,r)),t&&!e.hasOwnProperty(t))throw new Error("unknown type: "+t);return{type:t,name:n}}))}function ut(t,e){for(var n,r=0,i=t.length;r<i;++r)if((n=t[r]).name===e)return n.value}function ct(t,e,n){for(var r=0,i=t.length;r<i;++r)if(t[r].name===e){t[r]=it,t=t.slice(0,r).concat(t.slice(r+1));break}return null!=n&&t.push({name:e,value:n}),t}ot.prototype=at.prototype={constructor:ot,on:function(t,e){var n,r=this._,i=st(t+"",r),a=-1,o=i.length;if(!(arguments.length<2)){if(null!=e&&"function"!=typeof e)throw new Error("invalid callback: "+e);for(;++a<o;)if(n=(t=i[a]).type)r[n]=ct(r[n],t.name,e);else if(null==e)for(n in r)r[n]=ct(r[n],t.name,null);return this}for(;++a<o;)if((n=(t=i[a]).type)&&(n=ut(r[n],t.name)))return n},copy:function(){var t={},e=this._;for(var n in e)t[n]=e[n].slice();return new ot(t)},call:function(t,e){if((n=arguments.length-2)>0)for(var n,r,i=new Array(n),a=0;a<n;++a)i[a]=arguments[a+2];if(!this._.hasOwnProperty(t))throw new Error("unknown type: "+t);for(a=0,n=(r=this._[t]).length;a<n;++a)r[a].value.apply(e,i)},apply:function(t,e,n){if(!this._.hasOwnProperty(t))throw new Error("unknown type: "+t);for(var r=this._[t],i=0,a=r.length;i<a;++i)r[i].value.apply(e,n)}};var ft=at;function lt(){}var ht=function(t){return null==t?lt:function(){return this.querySelector(t)}};function dt(){return[]}var pt=function(t){return null==t?dt:function(){return this.querySelectorAll(t)}},gt=function(t){return function(){return this.matches(t)}},yt=function(t){return new Array(t.length)};function bt(t,e){this.ownerDocument=t.ownerDocument,this.namespaceURI=t.namespaceURI,this._next=null,this._parent=t,this.__data__=e}bt.prototype={constructor:bt,appendChild:function(t){return this._parent.insertBefore(t,this._next)},insertBefore:function(t,e){return this._parent.insertBefore(t,e)},querySelector:function(t){return this._parent.querySelector(t)},querySelectorAll:function(t){return this._parent.querySelectorAll(t)}};function vt(t,e,n,r,i,a){for(var o,s=0,u=e.length,c=a.length;s<c;++s)(o=e[s])?(o.__data__=a[s],r[s]=o):n[s]=new bt(t,a[s]);for(;s<u;++s)(o=e[s])&&(i[s]=o)}function mt(t,e,n,r,i,a,o){var s,u,c,f={},l=e.length,h=a.length,d=new Array(l);for(s=0;s<l;++s)(u=e[s])&&(d[s]=c="$"+o.call(u,u.__data__,s,e),c in f?i[s]=u:f[c]=u);for(s=0;s<h;++s)(u=f[c="$"+o.call(t,a[s],s,a)])?(r[s]=u,u.__data__=a[s],f[c]=null):n[s]=new bt(t,a[s]);for(s=0;s<l;++s)(u=e[s])&&f[d[s]]===u&&(i[s]=u)}function _t(t,e){return t<e?-1:t>e?1:t>=e?0:NaN}var wt="http://www.w3.org/1999/xhtml",xt={svg:"http://www.w3.org/2000/svg",xhtml:wt,xlink:"http://www.w3.org/1999/xlink",xml:"http://www.w3.org/XML/1998/namespace",xmlns:"http://www.w3.org/2000/xmlns/"},kt=function(t){var e=t+="",n=e.indexOf(":");return n>=0&&"xmlns"!==(e=t.slice(0,n))&&(t=t.slice(n+1)),xt.hasOwnProperty(e)?{space:xt[e],local:t}:t};function Et(t){return function(){this.removeAttribute(t)}}function At(t){return function(){this.removeAttributeNS(t.space,t.local)}}function St(t,e){return function(){this.setAttribute(t,e)}}function Mt(t,e){return function(){this.setAttributeNS(t.space,t.local,e)}}function Tt(t,e){return function(){var n=e.apply(this,arguments);null==n?this.removeAttribute(t):this.setAttribute(t,n)}}function Dt(t,e){return function(){var n=e.apply(this,arguments);null==n?this.removeAttributeNS(t.space,t.local):this.setAttributeNS(t.space,t.local,n)}}var Ct=function(t){return t.ownerDocument&&t.ownerDocument.defaultView||t.document&&t||t.defaultView};function Nt(t){return function(){this.style.removeProperty(t)}}function It(t,e,n){return function(){this.style.setProperty(t,e,n)}}function Lt(t,e,n){return function(){var r=e.apply(this,arguments);null==r?this.style.removeProperty(t):this.style.setProperty(t,r,n)}}function Bt(t,e){return t.style.getPropertyValue(e)||Ct(t).getComputedStyle(t,null).getPropertyValue(e)}function Ot(t){return function(){delete this[t]}}function Rt(t,e){return function(){this[t]=e}}function Pt(t,e){return function(){var n=e.apply(this,arguments);null==n?delete this[t]:this[t]=n}}function Ft(t){return t.trim().split(/^|\s+/)}function qt(t){return t.classList||new jt(t)}function jt(t){this._node=t,this._names=Ft(t.getAttribute("class")||"")}function Ut(t,e){for(var n=qt(t),r=-1,i=e.length;++r<i;)n.add(e[r])}function zt(t,e){for(var n=qt(t),r=-1,i=e.length;++r<i;)n.remove(e[r])}function Yt(t){return function(){Ut(this,t)}}function Vt(t){return function(){zt(this,t)}}function Ht(t,e){return function(){(e.apply(this,arguments)?Ut:zt)(this,t)}}jt.prototype={add:function(t){this._names.indexOf(t)<0&&(this._names.push(t),this._node.setAttribute("class",this._names.join(" ")))},remove:function(t){var e=this._names.indexOf(t);e>=0&&(this._names.splice(e,1),this._node.setAttribute("class",this._names.join(" ")))},contains:function(t){return this._names.indexOf(t)>=0}};function Gt(){this.textContent=""}function $t(t){return function(){this.textContent=t}}function Wt(t){return function(){var e=t.apply(this,arguments);this.textContent=null==e?"":e}}function Kt(){this.innerHTML=""}function Xt(t){return function(){this.innerHTML=t}}function Zt(t){return function(){var e=t.apply(this,arguments);this.innerHTML=null==e?"":e}}function Jt(){this.nextSibling&&this.parentNode.appendChild(this)}function Qt(){this.previousSibling&&this.parentNode.insertBefore(this,this.parentNode.firstChild)}function te(t){return function(){var e=this.ownerDocument,n=this.namespaceURI;return n===wt&&e.documentElement.namespaceURI===wt?e.createElement(t):e.createElementNS(n,t)}}function ee(t){return function(){return this.ownerDocument.createElementNS(t.space,t.local)}}var ne=function(t){var e=kt(t);return(e.local?ee:te)(e)};function re(){return null}function ie(){var t=this.parentNode;t&&t.removeChild(this)}function ae(){var t=this.cloneNode(!1),e=this.parentNode;return e?e.insertBefore(t,this.nextSibling):t}function oe(){var t=this.cloneNode(!0),e=this.parentNode;return e?e.insertBefore(t,this.nextSibling):t}var se={},ue=null;"undefined"!=typeof document&&("onmouseenter"in document.documentElement||(se={mouseenter:"mouseover",mouseleave:"mouseout"}));function ce(t,e,n){return t=fe(t,e,n),function(e){var n=e.relatedTarget;n&&(n===this||8&n.compareDocumentPosition(this))||t.call(this,e)}}function fe(t,e,n){return function(r){var i=ue;ue=r;try{t.call(this,this.__data__,e,n)}finally{ue=i}}}function le(t){return t.trim().split(/^|\s+/).map((function(t){var e="",n=t.indexOf(".");return n>=0&&(e=t.slice(n+1),t=t.slice(0,n)),{type:t,name:e}}))}function he(t){return function(){var e=this.__on;if(e){for(var n,r=0,i=-1,a=e.length;r<a;++r)n=e[r],t.type&&n.type!==t.type||n.name!==t.name?e[++i]=n:this.removeEventListener(n.type,n.listener,n.capture);++i?e.length=i:delete this.__on}}}function de(t,e,n){var r=se.hasOwnProperty(t.type)?ce:fe;return function(i,a,o){var s,u=this.__on,c=r(e,a,o);if(u)for(var f=0,l=u.length;f<l;++f)if((s=u[f]).type===t.type&&s.name===t.name)return this.removeEventListener(s.type,s.listener,s.capture),this.addEventListener(s.type,s.listener=c,s.capture=n),void(s.value=e);this.addEventListener(t.type,c,n),s={type:t.type,name:t.name,value:e,listener:c,capture:n},u?u.push(s):this.__on=[s]}}function pe(t,e,n,r){var i=ue;t.sourceEvent=ue,ue=t;try{return e.apply(n,r)}finally{ue=i}}function ge(t,e,n){var r=Ct(t),i=r.CustomEvent;"function"==typeof i?i=new i(e,n):(i=r.document.createEvent("Event"),n?(i.initEvent(e,n.bubbles,n.cancelable),i.detail=n.detail):i.initEvent(e,!1,!1)),t.dispatchEvent(i)}function ye(t,e){return function(){return ge(this,t,e)}}function be(t,e){return function(){return ge(this,t,e.apply(this,arguments))}}var ve=[null];function me(t,e){this._groups=t,this._parents=e}function _e(){return new me([[document.documentElement]],ve)}me.prototype=_e.prototype={constructor:me,select:function(t){"function"!=typeof t&&(t=ht(t));for(var e=this._groups,n=e.length,r=new Array(n),i=0;i<n;++i)for(var a,o,s=e[i],u=s.length,c=r[i]=new Array(u),f=0;f<u;++f)(a=s[f])&&(o=t.call(a,a.__data__,f,s))&&("__data__"in a&&(o.__data__=a.__data__),c[f]=o);return new me(r,this._parents)},selectAll:function(t){"function"!=typeof t&&(t=pt(t));for(var e=this._groups,n=e.length,r=[],i=[],a=0;a<n;++a)for(var o,s=e[a],u=s.length,c=0;c<u;++c)(o=s[c])&&(r.push(t.call(o,o.__data__,c,s)),i.push(o));return new me(r,i)},filter:function(t){"function"!=typeof t&&(t=gt(t));for(var e=this._groups,n=e.length,r=new Array(n),i=0;i<n;++i)for(var a,o=e[i],s=o.length,u=r[i]=[],c=0;c<s;++c)(a=o[c])&&t.call(a,a.__data__,c,o)&&u.push(a);return new me(r,this._parents)},data:function(t,e){if(!t)return p=new Array(this.size()),f=-1,this.each((function(t){p[++f]=t})),p;var n,r=e?mt:vt,i=this._parents,a=this._groups;"function"!=typeof t&&(n=t,t=function(){return n});for(var o=a.length,s=new Array(o),u=new Array(o),c=new Array(o),f=0;f<o;++f){var l=i[f],h=a[f],d=h.length,p=t.call(l,l&&l.__data__,f,i),g=p.length,y=u[f]=new Array(g),b=s[f]=new Array(g);r(l,h,y,b,c[f]=new Array(d),p,e);for(var v,m,_=0,w=0;_<g;++_)if(v=y[_]){for(_>=w&&(w=_+1);!(m=b[w])&&++w<g;);v._next=m||null}}return(s=new me(s,i))._enter=u,s._exit=c,s},enter:function(){return new me(this._enter||this._groups.map(yt),this._parents)},exit:function(){return new me(this._exit||this._groups.map(yt),this._parents)},join:function(t,e,n){var r=this.enter(),i=this,a=this.exit();return r="function"==typeof t?t(r):r.append(t+""),null!=e&&(i=e(i)),null==n?a.remove():n(a),r&&i?r.merge(i).order():i},merge:function(t){for(var e=this._groups,n=t._groups,r=e.length,i=n.length,a=Math.min(r,i),o=new Array(r),s=0;s<a;++s)for(var u,c=e[s],f=n[s],l=c.length,h=o[s]=new Array(l),d=0;d<l;++d)(u=c[d]||f[d])&&(h[d]=u);for(;s<r;++s)o[s]=e[s];return new me(o,this._parents)},order:function(){for(var t=this._groups,e=-1,n=t.length;++e<n;)for(var r,i=t[e],a=i.length-1,o=i[a];--a>=0;)(r=i[a])&&(o&&4^r.compareDocumentPosition(o)&&o.parentNode.insertBefore(r,o),o=r);return this},sort:function(t){function e(e,n){return e&&n?t(e.__data__,n.__data__):!e-!n}t||(t=_t);for(var n=this._groups,r=n.length,i=new Array(r),a=0;a<r;++a){for(var o,s=n[a],u=s.length,c=i[a]=new Array(u),f=0;f<u;++f)(o=s[f])&&(c[f]=o);c.sort(e)}return new me(i,this._parents).order()},call:function(){var t=arguments[0];return arguments[0]=this,t.apply(null,arguments),this},nodes:function(){var t=new Array(this.size()),e=-1;return this.each((function(){t[++e]=this})),t},node:function(){for(var t=this._groups,e=0,n=t.length;e<n;++e)for(var r=t[e],i=0,a=r.length;i<a;++i){var o=r[i];if(o)return o}return null},size:function(){var t=0;return this.each((function(){++t})),t},empty:function(){return!this.node()},each:function(t){for(var e=this._groups,n=0,r=e.length;n<r;++n)for(var i,a=e[n],o=0,s=a.length;o<s;++o)(i=a[o])&&t.call(i,i.__data__,o,a);return this},attr:function(t,e){var n=kt(t);if(arguments.length<2){var r=this.node();return n.local?r.getAttributeNS(n.space,n.local):r.getAttribute(n)}return this.each((null==e?n.local?At:Et:"function"==typeof e?n.local?Dt:Tt:n.local?Mt:St)(n,e))},style:function(t,e,n){return arguments.length>1?this.each((null==e?Nt:"function"==typeof e?Lt:It)(t,e,null==n?"":n)):Bt(this.node(),t)},property:function(t,e){return arguments.length>1?this.each((null==e?Ot:"function"==typeof e?Pt:Rt)(t,e)):this.node()[t]},classed:function(t,e){var n=Ft(t+"");if(arguments.length<2){for(var r=qt(this.node()),i=-1,a=n.length;++i<a;)if(!r.contains(n[i]))return!1;return!0}return this.each(("function"==typeof e?Ht:e?Yt:Vt)(n,e))},text:function(t){return arguments.length?this.each(null==t?Gt:("function"==typeof t?Wt:$t)(t)):this.node().textContent},html:function(t){return arguments.length?this.each(null==t?Kt:("function"==typeof t?Zt:Xt)(t)):this.node().innerHTML},raise:function(){return this.each(Jt)},lower:function(){return this.each(Qt)},append:function(t){var e="function"==typeof t?t:ne(t);return this.select((function(){return this.appendChild(e.apply(this,arguments))}))},insert:function(t,e){var n="function"==typeof t?t:ne(t),r=null==e?re:"function"==typeof e?e:ht(e);return this.select((function(){return this.insertBefore(n.apply(this,arguments),r.apply(this,arguments)||null)}))},remove:function(){return this.each(ie)},clone:function(t){return this.select(t?oe:ae)},datum:function(t){return arguments.length?this.property("__data__",t):this.node().__data__},on:function(t,e,n){var r,i,a=le(t+""),o=a.length;if(!(arguments.length<2)){for(s=e?de:he,null==n&&(n=!1),r=0;r<o;++r)this.each(s(a[r],e,n));return this}var s=this.node().__on;if(s)for(var u,c=0,f=s.length;c<f;++c)for(r=0,u=s[c];r<o;++r)if((i=a[r]).type===u.type&&i.name===u.name)return u.value},dispatch:function(t,e){return this.each(("function"==typeof e?be:ye)(t,e))}};var we=_e,xe=function(t){return"string"==typeof t?new me([[document.querySelector(t)]],[document.documentElement]):new me([[t]],ve)};function ke(){ue.stopImmediatePropagation()}var Ee=function(){ue.preventDefault(),ue.stopImmediatePropagation()},Ae=function(t){var e=t.document.documentElement,n=xe(t).on("dragstart.drag",Ee,!0);"onselectstart"in e?n.on("selectstart.drag",Ee,!0):(e.__noselect=e.style.MozUserSelect,e.style.MozUserSelect="none")};function Se(t,e){var n=t.document.documentElement,r=xe(t).on("dragstart.drag",null);e&&(r.on("click.drag",Ee,!0),setTimeout((function(){r.on("click.drag",null)}),0)),"onselectstart"in n?r.on("selectstart.drag",null):(n.style.MozUserSelect=n.__noselect,delete n.__noselect)}var Me=function(t,e,n){t.prototype=e.prototype=n,n.constructor=t};function Te(t,e){var n=Object.create(t.prototype);for(var r in e)n[r]=e[r];return n}function De(){}var Ce="\\s*([+-]?\\d+)\\s*",Ne="\\s*([+-]?\\d*\\.?\\d+(?:[eE][+-]?\\d+)?)\\s*",Ie="\\s*([+-]?\\d*\\.?\\d+(?:[eE][+-]?\\d+)?)%\\s*",Le=/^#([0-9a-f]{3,8})$/,Be=new RegExp("^rgb\\("+[Ce,Ce,Ce]+"\\)$"),Oe=new RegExp("^rgb\\("+[Ie,Ie,Ie]+"\\)$"),Re=new RegExp("^rgba\\("+[Ce,Ce,Ce,Ne]+"\\)$"),Pe=new RegExp("^rgba\\("+[Ie,Ie,Ie,Ne]+"\\)$"),Fe=new RegExp("^hsl\\("+[Ne,Ie,Ie]+"\\)$"),qe=new RegExp("^hsla\\("+[Ne,Ie,Ie,Ne]+"\\)$"),je={aliceblue:15792383,antiquewhite:16444375,aqua:65535,aquamarine:8388564,azure:15794175,beige:16119260,bisque:16770244,black:0,blanchedalmond:16772045,blue:255,blueviolet:9055202,brown:10824234,burlywood:14596231,cadetblue:6266528,chartreuse:8388352,chocolate:13789470,coral:16744272,cornflowerblue:6591981,cornsilk:16775388,crimson:14423100,cyan:65535,darkblue:139,darkcyan:35723,darkgoldenrod:12092939,darkgray:11119017,darkgreen:25600,darkgrey:11119017,darkkhaki:12433259,darkmagenta:9109643,darkolivegreen:5597999,darkorange:16747520,darkorchid:10040012,darkred:9109504,darksalmon:15308410,darkseagreen:9419919,darkslateblue:4734347,darkslategray:3100495,darkslategrey:3100495,darkturquoise:52945,darkviolet:9699539,deeppink:16716947,deepskyblue:49151,dimgray:6908265,dimgrey:6908265,dodgerblue:2003199,firebrick:11674146,floralwhite:16775920,forestgreen:2263842,fuchsia:16711935,gainsboro:14474460,ghostwhite:16316671,gold:16766720,goldenrod:14329120,gray:8421504,green:32768,greenyellow:11403055,grey:8421504,honeydew:15794160,hotpink:16738740,indianred:13458524,indigo:4915330,ivory:16777200,khaki:15787660,lavender:15132410,lavenderblush:16773365,lawngreen:8190976,lemonchiffon:16775885,lightblue:11393254,lightcoral:15761536,lightcyan:14745599,lightgoldenrodyellow:16448210,lightgray:13882323,lightgreen:9498256,lightgrey:13882323,lightpink:16758465,lightsalmon:16752762,lightseagreen:2142890,lightskyblue:8900346,lightslategray:7833753,lightslategrey:7833753,lightsteelblue:11584734,lightyellow:16777184,lime:65280,limegreen:3329330,linen:16445670,magenta:16711935,maroon:8388608,mediumaquamarine:6737322,mediumblue:205,mediumorchid:12211667,mediumpurple:9662683,mediumseagreen:3978097,mediumslateblue:8087790,mediumspringgreen:64154,mediumturquoise:4772300,mediumvioletred:13047173,midnightblue:1644912,mintcream:16121850,mistyrose:16770273,moccasin:16770229,navajowhite:16768685,navy:128,oldlace:16643558,olive:8421376,olivedrab:7048739,orange:16753920,orangered:16729344,orchid:14315734,palegoldenrod:15657130,palegreen:10025880,paleturquoise:11529966,palevioletred:14381203,papayawhip:16773077,peachpuff:16767673,peru:13468991,pink:16761035,plum:14524637,powderblue:11591910,purple:8388736,rebeccapurple:6697881,red:16711680,rosybrown:12357519,royalblue:4286945,saddlebrown:9127187,salmon:16416882,sandybrown:16032864,seagreen:3050327,seashell:16774638,sienna:10506797,silver:12632256,skyblue:8900331,slateblue:6970061,slategray:7372944,slategrey:7372944,snow:16775930,springgreen:65407,steelblue:4620980,tan:13808780,teal:32896,thistle:14204888,tomato:16737095,turquoise:4251856,violet:15631086,wheat:16113331,white:16777215,whitesmoke:16119285,yellow:16776960,yellowgreen:10145074};function Ue(){return this.rgb().formatHex()}function ze(){return this.rgb().formatRgb()}function Ye(t){var e,n;return t=(t+"").trim().toLowerCase(),(e=Le.exec(t))?(n=e[1].length,e=parseInt(e[1],16),6===n?Ve(e):3===n?new We(e>>8&15|e>>4&240,e>>4&15|240&e,(15&e)<<4|15&e,1):8===n?new We(e>>24&255,e>>16&255,e>>8&255,(255&e)/255):4===n?new We(e>>12&15|e>>8&240,e>>8&15|e>>4&240,e>>4&15|240&e,((15&e)<<4|15&e)/255):null):(e=Be.exec(t))?new We(e[1],e[2],e[3],1):(e=Oe.exec(t))?new We(255*e[1]/100,255*e[2]/100,255*e[3]/100,1):(e=Re.exec(t))?He(e[1],e[2],e[3],e[4]):(e=Pe.exec(t))?He(255*e[1]/100,255*e[2]/100,255*e[3]/100,e[4]):(e=Fe.exec(t))?Je(e[1],e[2]/100,e[3]/100,1):(e=qe.exec(t))?Je(e[1],e[2]/100,e[3]/100,e[4]):je.hasOwnProperty(t)?Ve(je[t]):"transparent"===t?new We(NaN,NaN,NaN,0):null}function Ve(t){return new We(t>>16&255,t>>8&255,255&t,1)}function He(t,e,n,r){return r<=0&&(t=e=n=NaN),new We(t,e,n,r)}function Ge(t){return t instanceof De||(t=Ye(t)),t?new We((t=t.rgb()).r,t.g,t.b,t.opacity):new We}function $e(t,e,n,r){return 1===arguments.length?Ge(t):new We(t,e,n,null==r?1:r)}function We(t,e,n,r){this.r=+t,this.g=+e,this.b=+n,this.opacity=+r}function Ke(){return"#"+Ze(this.r)+Ze(this.g)+Ze(this.b)}function Xe(){var t=this.opacity;return(1===(t=isNaN(t)?1:Math.max(0,Math.min(1,t)))?"rgb(":"rgba(")+Math.max(0,Math.min(255,Math.round(this.r)||0))+", "+Math.max(0,Math.min(255,Math.round(this.g)||0))+", "+Math.max(0,Math.min(255,Math.round(this.b)||0))+(1===t?")":", "+t+")")}function Ze(t){return((t=Math.max(0,Math.min(255,Math.round(t)||0)))<16?"0":"")+t.toString(16)}function Je(t,e,n,r){return r<=0?t=e=n=NaN:n<=0||n>=1?t=e=NaN:e<=0&&(t=NaN),new en(t,e,n,r)}function Qe(t){if(t instanceof en)return new en(t.h,t.s,t.l,t.opacity);if(t instanceof De||(t=Ye(t)),!t)return new en;if(t instanceof en)return t;var e=(t=t.rgb()).r/255,n=t.g/255,r=t.b/255,i=Math.min(e,n,r),a=Math.max(e,n,r),o=NaN,s=a-i,u=(a+i)/2;return s?(o=e===a?(n-r)/s+6*(n<r):n===a?(r-e)/s+2:(e-n)/s+4,s/=u<.5?a+i:2-a-i,o*=60):s=u>0&&u<1?0:o,new en(o,s,u,t.opacity)}function tn(t,e,n,r){return 1===arguments.length?Qe(t):new en(t,e,n,null==r?1:r)}function en(t,e,n,r){this.h=+t,this.s=+e,this.l=+n,this.opacity=+r}function nn(t,e,n){return 255*(t<60?e+(n-e)*t/60:t<180?n:t<240?e+(n-e)*(240-t)/60:e)}function rn(t,e,n,r,i){var a=t*t,o=a*t;return((1-3*t+3*a-o)*e+(4-6*a+3*o)*n+(1+3*t+3*a-3*o)*r+o*i)/6}Me(De,Ye,{copy:function(t){return Object.assign(new this.constructor,this,t)},displayable:function(){return this.rgb().displayable()},hex:Ue,formatHex:Ue,formatHsl:function(){return Qe(this).formatHsl()},formatRgb:ze,toString:ze}),Me(We,$e,Te(De,{brighter:function(t){return t=null==t?1/.7:Math.pow(1/.7,t),new We(this.r*t,this.g*t,this.b*t,this.opacity)},darker:function(t){return t=null==t?.7:Math.pow(.7,t),new We(this.r*t,this.g*t,this.b*t,this.opacity)},rgb:function(){return this},displayable:function(){return-.5<=this.r&&this.r<255.5&&-.5<=this.g&&this.g<255.5&&-.5<=this.b&&this.b<255.5&&0<=this.opacity&&this.opacity<=1},hex:Ke,formatHex:Ke,formatRgb:Xe,toString:Xe})),Me(en,tn,Te(De,{brighter:function(t){return t=null==t?1/.7:Math.pow(1/.7,t),new en(this.h,this.s,this.l*t,this.opacity)},darker:function(t){return t=null==t?.7:Math.pow(.7,t),new en(this.h,this.s,this.l*t,this.opacity)},rgb:function(){var t=this.h%360+360*(this.h<0),e=isNaN(t)||isNaN(this.s)?0:this.s,n=this.l,r=n+(n<.5?n:1-n)*e,i=2*n-r;return new We(nn(t>=240?t-240:t+120,i,r),nn(t,i,r),nn(t<120?t+240:t-120,i,r),this.opacity)},displayable:function(){return(0<=this.s&&this.s<=1||isNaN(this.s))&&0<=this.l&&this.l<=1&&0<=this.opacity&&this.opacity<=1},formatHsl:function(){var t=this.opacity;return(1===(t=isNaN(t)?1:Math.max(0,Math.min(1,t)))?"hsl(":"hsla(")+(this.h||0)+", "+100*(this.s||0)+"%, "+100*(this.l||0)+"%"+(1===t?")":", "+t+")")}}));var an=function(t){var e=t.length-1;return function(n){var r=n<=0?n=0:n>=1?(n=1,e-1):Math.floor(n*e),i=t[r],a=t[r+1],o=r>0?t[r-1]:2*i-a,s=r<e-1?t[r+2]:2*a-i;return rn((n-r/e)*e,o,i,a,s)}},on=function(t){var e=t.length;return function(n){var r=Math.floor(((n%=1)<0?++n:n)*e),i=t[(r+e-1)%e],a=t[r%e],o=t[(r+1)%e],s=t[(r+2)%e];return rn((n-r/e)*e,i,a,o,s)}},sn=function(t){return function(){return t}};function un(t,e){return function(n){return t+n*e}}function cn(t,e){var n=e-t;return n?un(t,n>180||n<-180?n-360*Math.round(n/360):n):sn(isNaN(t)?e:t)}function fn(t){return 1==(t=+t)?ln:function(e,n){return n-e?function(t,e,n){return t=Math.pow(t,n),e=Math.pow(e,n)-t,n=1/n,function(r){return Math.pow(t+r*e,n)}}(e,n,t):sn(isNaN(e)?n:e)}}function ln(t,e){var n=e-t;return n?un(t,n):sn(isNaN(t)?e:t)}var hn=function t(e){var n=fn(e);function r(t,e){var r=n((t=$e(t)).r,(e=$e(e)).r),i=n(t.g,e.g),a=n(t.b,e.b),o=ln(t.opacity,e.opacity);return function(e){return t.r=r(e),t.g=i(e),t.b=a(e),t.opacity=o(e),t+""}}return r.gamma=t,r}(1);function dn(t){return function(e){var n,r,i=e.length,a=new Array(i),o=new Array(i),s=new Array(i);for(n=0;n<i;++n)r=$e(e[n]),a[n]=r.r||0,o[n]=r.g||0,s[n]=r.b||0;return a=t(a),o=t(o),s=t(s),r.opacity=1,function(t){return r.r=a(t),r.g=o(t),r.b=s(t),r+""}}}var pn=dn(an),gn=dn(on),yn=function(t,e){e||(e=[]);var n,r=t?Math.min(e.length,t.length):0,i=e.slice();return function(a){for(n=0;n<r;++n)i[n]=t[n]*(1-a)+e[n]*a;return i}};function bn(t){return ArrayBuffer.isView(t)&&!(t instanceof DataView)}var vn=function(t,e){return(bn(e)?yn:mn)(t,e)};function mn(t,e){var n,r=e?e.length:0,i=t?Math.min(r,t.length):0,a=new Array(i),o=new Array(r);for(n=0;n<i;++n)a[n]=Tn(t[n],e[n]);for(;n<r;++n)o[n]=e[n];return function(t){for(n=0;n<i;++n)o[n]=a[n](t);return o}}var _n=function(t,e){var n=new Date;return t=+t,e=+e,function(r){return n.setTime(t*(1-r)+e*r),n}},wn=function(t,e){return t=+t,e=+e,function(n){return t*(1-n)+e*n}},xn=function(t,e){var n,r={},i={};for(n in null!==t&&"object"==typeof t||(t={}),null!==e&&"object"==typeof e||(e={}),e)n in t?r[n]=Tn(t[n],e[n]):i[n]=e[n];return function(t){for(n in r)i[n]=r[n](t);return i}},kn=/[-+]?(?:\d+\.?\d*|\.?\d+)(?:[eE][-+]?\d+)?/g,En=new RegExp(kn.source,"g");var An,Sn,Mn=function(t,e){var n,r,i,a=kn.lastIndex=En.lastIndex=0,o=-1,s=[],u=[];for(t+="",e+="";(n=kn.exec(t))&&(r=En.exec(e));)(i=r.index)>a&&(i=e.slice(a,i),s[o]?s[o]+=i:s[++o]=i),(n=n[0])===(r=r[0])?s[o]?s[o]+=r:s[++o]=r:(s[++o]=null,u.push({i:o,x:wn(n,r)})),a=En.lastIndex;return a<e.length&&(i=e.slice(a),s[o]?s[o]+=i:s[++o]=i),s.length<2?u[0]?function(t){return function(e){return t(e)+""}}(u[0].x):function(t){return function(){return t}}(e):(e=u.length,function(t){for(var n,r=0;r<e;++r)s[(n=u[r]).i]=n.x(t);return s.join("")})},Tn=function(t,e){var n,r=typeof e;return null==e||"boolean"===r?sn(e):("number"===r?wn:"string"===r?(n=Ye(e))?(e=n,hn):Mn:e instanceof Ye?hn:e instanceof Date?_n:bn(e)?yn:Array.isArray(e)?mn:"function"!=typeof e.valueOf&&"function"!=typeof e.toString||isNaN(e)?xn:wn)(t,e)},Dn=function(){for(var t,e=ue;t=e.sourceEvent;)e=t;return e},Cn=function(t,e){var n=t.ownerSVGElement||t;if(n.createSVGPoint){var r=n.createSVGPoint();return r.x=e.clientX,r.y=e.clientY,[(r=r.matrixTransform(t.getScreenCTM().inverse())).x,r.y]}var i=t.getBoundingClientRect();return[e.clientX-i.left-t.clientLeft,e.clientY-i.top-t.clientTop]},Nn=function(t,e,n){arguments.length<3&&(n=e,e=Dn().changedTouches);for(var r,i=0,a=e?e.length:0;i<a;++i)if((r=e[i]).identifier===n)return Cn(t,r);return null},In=function(t){var e=Dn();return e.changedTouches&&(e=e.changedTouches[0]),Cn(t,e)},Ln=0,Bn=0,On=0,Rn=0,Pn=0,Fn=0,qn="object"==typeof performance&&performance.now?performance:Date,jn="object"==typeof window&&window.requestAnimationFrame?window.requestAnimationFrame.bind(window):function(t){setTimeout(t,17)};function Un(){return Pn||(jn(zn),Pn=qn.now()+Fn)}function zn(){Pn=0}function Yn(){this._call=this._time=this._next=null}function Vn(t,e,n){var r=new Yn;return r.restart(t,e,n),r}function Hn(){Un(),++Ln;for(var t,e=An;e;)(t=Pn-e._time)>=0&&e._call.call(null,t),e=e._next;--Ln}function Gn(){Pn=(Rn=qn.now())+Fn,Ln=Bn=0;try{Hn()}finally{Ln=0,function(){var t,e,n=An,r=1/0;for(;n;)n._call?(r>n._time&&(r=n._time),t=n,n=n._next):(e=n._next,n._next=null,n=t?t._next=e:An=e);Sn=t,Wn(r)}(),Pn=0}}function $n(){var t=qn.now(),e=t-Rn;e>1e3&&(Fn-=e,Rn=t)}function Wn(t){Ln||(Bn&&(Bn=clearTimeout(Bn)),t-Pn>24?(t<1/0&&(Bn=setTimeout(Gn,t-qn.now()-Fn)),On&&(On=clearInterval(On))):(On||(Rn=qn.now(),On=setInterval($n,1e3)),Ln=1,jn(Gn)))}Yn.prototype=Vn.prototype={constructor:Yn,restart:function(t,e,n){if("function"!=typeof t)throw new TypeError("callback is not a function");n=(null==n?Un():+n)+(null==e?0:+e),this._next||Sn===this||(Sn?Sn._next=this:An=this,Sn=this),this._call=t,this._time=n,Wn()},stop:function(){this._call&&(this._call=null,this._time=1/0,Wn())}};var Kn=function(t,e,n){var r=new Yn;return e=null==e?0:+e,r.restart((function(n){r.stop(),t(n+e)}),e,n),r},Xn=ft("start","end","cancel","interrupt"),Zn=[],Jn=function(t,e,n,r,i,a){var o=t.__transition;if(o){if(n in o)return}else t.__transition={};!function(t,e,n){var r,i=t.__transition;function a(u){var c,f,l,h;if(1!==n.state)return s();for(c in i)if((h=i[c]).name===n.name){if(3===h.state)return Kn(a);4===h.state?(h.state=6,h.timer.stop(),h.on.call("interrupt",t,t.__data__,h.index,h.group),delete i[c]):+c<e&&(h.state=6,h.timer.stop(),h.on.call("cancel",t,t.__data__,h.index,h.group),delete i[c])}if(Kn((function(){3===n.state&&(n.state=4,n.timer.restart(o,n.delay,n.time),o(u))})),n.state=2,n.on.call("start",t,t.__data__,n.index,n.group),2===n.state){for(n.state=3,r=new Array(l=n.tween.length),c=0,f=-1;c<l;++c)(h=n.tween[c].value.call(t,t.__data__,n.index,n.group))&&(r[++f]=h);r.length=f+1}}function o(e){for(var i=e<n.duration?n.ease.call(null,e/n.duration):(n.timer.restart(s),n.state=5,1),a=-1,o=r.length;++a<o;)r[a].call(t,i);5===n.state&&(n.on.call("end",t,t.__data__,n.index,n.group),s())}function s(){for(var r in n.state=6,n.timer.stop(),delete i[e],i)return;delete t.__transition}i[e]=n,n.timer=Vn((function(t){n.state=1,n.timer.restart(a,n.delay,n.time),n.delay<=t&&a(t-n.delay)}),0,n.time)}(t,n,{name:e,index:r,group:i,on:Xn,tween:Zn,time:a.time,delay:a.delay,duration:a.duration,ease:a.ease,timer:null,state:0})};function Qn(t,e){var n=er(t,e);if(n.state>0)throw new Error("too late; already scheduled");return n}function tr(t,e){var n=er(t,e);if(n.state>3)throw new Error("too late; already running");return n}function er(t,e){var n=t.__transition;if(!n||!(n=n[e]))throw new Error("transition not found");return n}var nr,rr,ir,ar,or=function(t,e){var n,r,i,a=t.__transition,o=!0;if(a){for(i in e=null==e?null:e+"",a)(n=a[i]).name===e?(r=n.state>2&&n.state<5,n.state=6,n.timer.stop(),n.on.call(r?"interrupt":"cancel",t,t.__data__,n.index,n.group),delete a[i]):o=!1;o&&delete t.__transition}},sr=180/Math.PI,ur={translateX:0,translateY:0,rotate:0,skewX:0,scaleX:1,scaleY:1},cr=function(t,e,n,r,i,a){var o,s,u;return(o=Math.sqrt(t*t+e*e))&&(t/=o,e/=o),(u=t*n+e*r)&&(n-=t*u,r-=e*u),(s=Math.sqrt(n*n+r*r))&&(n/=s,r/=s,u/=s),t*r<e*n&&(t=-t,e=-e,u=-u,o=-o),{translateX:i,translateY:a,rotate:Math.atan2(e,t)*sr,skewX:Math.atan(u)*sr,scaleX:o,scaleY:s}};function fr(t,e,n,r){function i(t){return t.length?t.pop()+" ":""}return function(a,o){var s=[],u=[];return a=t(a),o=t(o),function(t,r,i,a,o,s){if(t!==i||r!==a){var u=o.push("translate(",null,e,null,n);s.push({i:u-4,x:wn(t,i)},{i:u-2,x:wn(r,a)})}else(i||a)&&o.push("translate("+i+e+a+n)}(a.translateX,a.translateY,o.translateX,o.translateY,s,u),function(t,e,n,a){t!==e?(t-e>180?e+=360:e-t>180&&(t+=360),a.push({i:n.push(i(n)+"rotate(",null,r)-2,x:wn(t,e)})):e&&n.push(i(n)+"rotate("+e+r)}(a.rotate,o.rotate,s,u),function(t,e,n,a){t!==e?a.push({i:n.push(i(n)+"skewX(",null,r)-2,x:wn(t,e)}):e&&n.push(i(n)+"skewX("+e+r)}(a.skewX,o.skewX,s,u),function(t,e,n,r,a,o){if(t!==n||e!==r){var s=a.push(i(a)+"scale(",null,",",null,")");o.push({i:s-4,x:wn(t,n)},{i:s-2,x:wn(e,r)})}else 1===n&&1===r||a.push(i(a)+"scale("+n+","+r+")")}(a.scaleX,a.scaleY,o.scaleX,o.scaleY,s,u),a=o=null,function(t){for(var e,n=-1,r=u.length;++n<r;)s[(e=u[n]).i]=e.x(t);return s.join("")}}}var lr=fr((function(t){return"none"===t?ur:(nr||(nr=document.createElement("DIV"),rr=document.documentElement,ir=document.defaultView),nr.style.transform=t,t=ir.getComputedStyle(rr.appendChild(nr),null).getPropertyValue("transform"),rr.removeChild(nr),t=t.slice(7,-1).split(","),cr(+t[0],+t[1],+t[2],+t[3],+t[4],+t[5]))}),"px, ","px)","deg)"),hr=fr((function(t){return null==t?ur:(ar||(ar=document.createElementNS("http://www.w3.org/2000/svg","g")),ar.setAttribute("transform",t),(t=ar.transform.baseVal.consolidate())?(t=t.matrix,cr(t.a,t.b,t.c,t.d,t.e,t.f)):ur)}),", ",")",")");function dr(t,e){var n,r;return function(){var i=tr(this,t),a=i.tween;if(a!==n)for(var o=0,s=(r=n=a).length;o<s;++o)if(r[o].name===e){(r=r.slice()).splice(o,1);break}i.tween=r}}function pr(t,e,n){var r,i;if("function"!=typeof n)throw new Error;return function(){var a=tr(this,t),o=a.tween;if(o!==r){i=(r=o).slice();for(var s={name:e,value:n},u=0,c=i.length;u<c;++u)if(i[u].name===e){i[u]=s;break}u===c&&i.push(s)}a.tween=i}}function gr(t,e,n){var r=t._id;return t.each((function(){var t=tr(this,r);(t.value||(t.value={}))[e]=n.apply(this,arguments)})),function(t){return er(t,r).value[e]}}var yr=function(t,e){var n;return("number"==typeof e?wn:e instanceof Ye?hn:(n=Ye(e))?(e=n,hn):Mn)(t,e)};function br(t){return function(){this.removeAttribute(t)}}function vr(t){return function(){this.removeAttributeNS(t.space,t.local)}}function mr(t,e,n){var r,i,a=n+"";return function(){var o=this.getAttribute(t);return o===a?null:o===r?i:i=e(r=o,n)}}function _r(t,e,n){var r,i,a=n+"";return function(){var o=this.getAttributeNS(t.space,t.local);return o===a?null:o===r?i:i=e(r=o,n)}}function wr(t,e,n){var r,i,a;return function(){var o,s,u=n(this);if(null!=u)return(o=this.getAttribute(t))===(s=u+"")?null:o===r&&s===i?a:(i=s,a=e(r=o,u));this.removeAttribute(t)}}function xr(t,e,n){var r,i,a;return function(){var o,s,u=n(this);if(null!=u)return(o=this.getAttributeNS(t.space,t.local))===(s=u+"")?null:o===r&&s===i?a:(i=s,a=e(r=o,u));this.removeAttributeNS(t.space,t.local)}}function kr(t,e){return function(n){this.setAttribute(t,e.call(this,n))}}function Er(t,e){return function(n){this.setAttributeNS(t.space,t.local,e.call(this,n))}}function Ar(t,e){var n,r;function i(){var i=e.apply(this,arguments);return i!==r&&(n=(r=i)&&Er(t,i)),n}return i._value=e,i}function Sr(t,e){var n,r;function i(){var i=e.apply(this,arguments);return i!==r&&(n=(r=i)&&kr(t,i)),n}return i._value=e,i}function Mr(t,e){return function(){Qn(this,t).delay=+e.apply(this,arguments)}}function Tr(t,e){return e=+e,function(){Qn(this,t).delay=e}}function Dr(t,e){return function(){tr(this,t).duration=+e.apply(this,arguments)}}function Cr(t,e){return e=+e,function(){tr(this,t).duration=e}}function Nr(t,e){if("function"!=typeof e)throw new Error;return function(){tr(this,t).ease=e}}function Ir(t,e,n){var r,i,a=function(t){return(t+"").trim().split(/^|\s+/).every((function(t){var e=t.indexOf(".");return e>=0&&(t=t.slice(0,e)),!t||"start"===t}))}(e)?Qn:tr;return function(){var o=a(this,t),s=o.on;s!==r&&(i=(r=s).copy()).on(e,n),o.on=i}}var Lr=we.prototype.constructor;function Br(t){return function(){this.style.removeProperty(t)}}function Or(t,e,n){return function(r){this.style.setProperty(t,e.call(this,r),n)}}function Rr(t,e,n){var r,i;function a(){var a=e.apply(this,arguments);return a!==i&&(r=(i=a)&&Or(t,a,n)),r}return a._value=e,a}function Pr(t){return function(e){this.textContent=t.call(this,e)}}function Fr(t){var e,n;function r(){var r=t.apply(this,arguments);return r!==n&&(e=(n=r)&&Pr(r)),e}return r._value=t,r}var qr=0;function jr(t,e,n,r){this._groups=t,this._parents=e,this._name=n,this._id=r}function Ur(t){return we().transition(t)}function zr(){return++qr}var Yr=we.prototype;function Vr(t){return t*t*t}function Hr(t){return--t*t*t+1}function Gr(t){return((t*=2)<=1?t*t*t:(t-=2)*t*t+2)/2}jr.prototype=Ur.prototype={constructor:jr,select:function(t){var e=this._name,n=this._id;"function"!=typeof t&&(t=ht(t));for(var r=this._groups,i=r.length,a=new Array(i),o=0;o<i;++o)for(var s,u,c=r[o],f=c.length,l=a[o]=new Array(f),h=0;h<f;++h)(s=c[h])&&(u=t.call(s,s.__data__,h,c))&&("__data__"in s&&(u.__data__=s.__data__),l[h]=u,Jn(l[h],e,n,h,l,er(s,n)));return new jr(a,this._parents,e,n)},selectAll:function(t){var e=this._name,n=this._id;"function"!=typeof t&&(t=pt(t));for(var r=this._groups,i=r.length,a=[],o=[],s=0;s<i;++s)for(var u,c=r[s],f=c.length,l=0;l<f;++l)if(u=c[l]){for(var h,d=t.call(u,u.__data__,l,c),p=er(u,n),g=0,y=d.length;g<y;++g)(h=d[g])&&Jn(h,e,n,g,d,p);a.push(d),o.push(u)}return new jr(a,o,e,n)},filter:function(t){"function"!=typeof t&&(t=gt(t));for(var e=this._groups,n=e.length,r=new Array(n),i=0;i<n;++i)for(var a,o=e[i],s=o.length,u=r[i]=[],c=0;c<s;++c)(a=o[c])&&t.call(a,a.__data__,c,o)&&u.push(a);return new jr(r,this._parents,this._name,this._id)},merge:function(t){if(t._id!==this._id)throw new Error;for(var e=this._groups,n=t._groups,r=e.length,i=n.length,a=Math.min(r,i),o=new Array(r),s=0;s<a;++s)for(var u,c=e[s],f=n[s],l=c.length,h=o[s]=new Array(l),d=0;d<l;++d)(u=c[d]||f[d])&&(h[d]=u);for(;s<r;++s)o[s]=e[s];return new jr(o,this._parents,this._name,this._id)},selection:function(){return new Lr(this._groups,this._parents)},transition:function(){for(var t=this._name,e=this._id,n=zr(),r=this._groups,i=r.length,a=0;a<i;++a)for(var o,s=r[a],u=s.length,c=0;c<u;++c)if(o=s[c]){var f=er(o,e);Jn(o,t,n,c,s,{time:f.time+f.delay+f.duration,delay:0,duration:f.duration,ease:f.ease})}return new jr(r,this._parents,t,n)},call:Yr.call,nodes:Yr.nodes,node:Yr.node,size:Yr.size,empty:Yr.empty,each:Yr.each,on:function(t,e){var n=this._id;return arguments.length<2?er(this.node(),n).on.on(t):this.each(Ir(n,t,e))},attr:function(t,e){var n=kt(t),r="transform"===n?hr:yr;return this.attrTween(t,"function"==typeof e?(n.local?xr:wr)(n,r,gr(this,"attr."+t,e)):null==e?(n.local?vr:br)(n):(n.local?_r:mr)(n,r,e))},attrTween:function(t,e){var n="attr."+t;if(arguments.length<2)return(n=this.tween(n))&&n._value;if(null==e)return this.tween(n,null);if("function"!=typeof e)throw new Error;var r=kt(t);return this.tween(n,(r.local?Ar:Sr)(r,e))},style:function(t,e,n){var r="transform"==(t+="")?lr:yr;return null==e?this.styleTween(t,function(t,e){var n,r,i;return function(){var a=Bt(this,t),o=(this.style.removeProperty(t),Bt(this,t));return a===o?null:a===n&&o===r?i:i=e(n=a,r=o)}}(t,r)).on("end.style."+t,Br(t)):"function"==typeof e?this.styleTween(t,function(t,e,n){var r,i,a;return function(){var o=Bt(this,t),s=n(this),u=s+"";return null==s&&(this.style.removeProperty(t),u=s=Bt(this,t)),o===u?null:o===r&&u===i?a:(i=u,a=e(r=o,s))}}(t,r,gr(this,"style."+t,e))).each(function(t,e){var n,r,i,a,o="style."+e,s="end."+o;return function(){var u=tr(this,t),c=u.on,f=null==u.value[o]?a||(a=Br(e)):void 0;c===n&&i===f||(r=(n=c).copy()).on(s,i=f),u.on=r}}(this._id,t)):this.styleTween(t,function(t,e,n){var r,i,a=n+"";return function(){var o=Bt(this,t);return o===a?null:o===r?i:i=e(r=o,n)}}(t,r,e),n).on("end.style."+t,null)},styleTween:function(t,e,n){var r="style."+(t+="");if(arguments.length<2)return(r=this.tween(r))&&r._value;if(null==e)return this.tween(r,null);if("function"!=typeof e)throw new Error;return this.tween(r,Rr(t,e,null==n?"":n))},text:function(t){return this.tween("text","function"==typeof t?function(t){return function(){var e=t(this);this.textContent=null==e?"":e}}(gr(this,"text",t)):function(t){return function(){this.textContent=t}}(null==t?"":t+""))},textTween:function(t){var e="text";if(arguments.length<1)return(e=this.tween(e))&&e._value;if(null==t)return this.tween(e,null);if("function"!=typeof t)throw new Error;return this.tween(e,Fr(t))},remove:function(){return this.on("end.remove",(t=this._id,function(){var e=this.parentNode;for(var n in this.__transition)if(+n!==t)return;e&&e.removeChild(this)}));var t},tween:function(t,e){var n=this._id;if(t+="",arguments.length<2){for(var r,i=er(this.node(),n).tween,a=0,o=i.length;a<o;++a)if((r=i[a]).name===t)return r.value;return null}return this.each((null==e?dr:pr)(n,t,e))},delay:function(t){var e=this._id;return arguments.length?this.each(("function"==typeof t?Mr:Tr)(e,t)):er(this.node(),e).delay},duration:function(t){var e=this._id;return arguments.length?this.each(("function"==typeof t?Dr:Cr)(e,t)):er(this.node(),e).duration},ease:function(t){var e=this._id;return arguments.length?this.each(Nr(e,t)):er(this.node(),e).ease},end:function(){var t,e,n=this,r=n._id,i=n.size();return new Promise((function(a,o){var s={value:o},u={value:function(){0==--i&&a()}};n.each((function(){var n=tr(this,r),i=n.on;i!==t&&((e=(t=i).copy())._.cancel.push(s),e._.interrupt.push(s),e._.end.push(u)),n.on=e}))}))}};var $r={time:null,delay:0,duration:250,ease:Gr};function Wr(t,e){for(var n;!(n=t.__transition)||!(n=n[e]);)if(!(t=t.parentNode))return $r.time=Un(),$r;return n}we.prototype.interrupt=function(t){return this.each((function(){or(this,t)}))},we.prototype.transition=function(t){var e,n;t instanceof jr?(e=t._id,t=t._name):(e=zr(),(n=$r).time=Un(),t=null==t?null:t+"");for(var r=this._groups,i=r.length,a=0;a<i;++a)for(var o,s=r[a],u=s.length,c=0;c<u;++c)(o=s[c])&&Jn(o,t,e,c,s,n||Wr(o,e));return new jr(r,this._parents,t,e)};var Kr=[null],Xr=function(t,e){var n,r,i=t.__transition;if(i)for(r in e=null==e?null:e+"",i)if((n=i[r]).state>1&&n.name===e)return new jr([[t]],Kr,e,+r);return null},Zr=function(t){return function(){return t}},Jr=function(t,e,n){this.target=t,this.type=e,this.selection=n};function Qr(){ue.stopImmediatePropagation()}var ti=function(){ue.preventDefault(),ue.stopImmediatePropagation()},ei={name:"drag"},ni={name:"space"},ri={name:"handle"},ii={name:"center"};function ai(t){return[+t[0],+t[1]]}function oi(t){return[ai(t[0]),ai(t[1])]}function si(t){return function(e){return Nn(e,ue.touches,t)}}var ui={name:"x",handles:["w","e"].map(yi),input:function(t,e){return null==t?null:[[+t[0],e[0][1]],[+t[1],e[1][1]]]},output:function(t){return t&&[t[0][0],t[1][0]]}},ci={name:"y",handles:["n","s"].map(yi),input:function(t,e){return null==t?null:[[e[0][0],+t[0]],[e[1][0],+t[1]]]},output:function(t){return t&&[t[0][1],t[1][1]]}},fi={name:"xy",handles:["n","w","e","s","nw","ne","sw","se"].map(yi),input:function(t){return null==t?null:oi(t)},output:function(t){return t}},li={overlay:"crosshair",selection:"move",n:"ns-resize",e:"ew-resize",s:"ns-resize",w:"ew-resize",nw:"nwse-resize",ne:"nesw-resize",se:"nwse-resize",sw:"nesw-resize"},hi={e:"w",w:"e",nw:"ne",ne:"nw",se:"sw",sw:"se"},di={n:"s",s:"n",nw:"sw",ne:"se",se:"ne",sw:"nw"},pi={overlay:1,selection:1,n:null,e:1,s:null,w:-1,nw:-1,ne:1,se:1,sw:-1},gi={overlay:1,selection:1,n:-1,e:null,s:1,w:null,nw:-1,ne:-1,se:1,sw:1};function yi(t){return{type:t}}function bi(){return!ue.ctrlKey&&!ue.button}function vi(){var t=this.ownerSVGElement||this;return t.hasAttribute("viewBox")?[[(t=t.viewBox.baseVal).x,t.y],[t.x+t.width,t.y+t.height]]:[[0,0],[t.width.baseVal.value,t.height.baseVal.value]]}function mi(){return navigator.maxTouchPoints||"ontouchstart"in this}function _i(t){for(;!t.__brush;)if(!(t=t.parentNode))return;return t.__brush}function wi(t){return t[0][0]===t[1][0]||t[0][1]===t[1][1]}function xi(t){var e=t.__brush;return e?e.dim.output(e.selection):null}function ki(){return Si(ui)}function Ei(){return Si(ci)}var Ai=function(){return Si(fi)};function Si(t){var e,n=vi,r=bi,i=mi,a=!0,o=ft("start","brush","end"),s=6;function u(e){var n=e.property("__brush",g).selectAll(".overlay").data([yi("overlay")]);n.enter().append("rect").attr("class","overlay").attr("pointer-events","all").attr("cursor",li.overlay).merge(n).each((function(){var t=_i(this).extent;xe(this).attr("x",t[0][0]).attr("y",t[0][1]).attr("width",t[1][0]-t[0][0]).attr("height",t[1][1]-t[0][1])})),e.selectAll(".selection").data([yi("selection")]).enter().append("rect").attr("class","selection").attr("cursor",li.selection).attr("fill","#777").attr("fill-opacity",.3).attr("stroke","#fff").attr("shape-rendering","crispEdges");var r=e.selectAll(".handle").data(t.handles,(function(t){return t.type}));r.exit().remove(),r.enter().append("rect").attr("class",(function(t){return"handle handle--"+t.type})).attr("cursor",(function(t){return li[t.type]})),e.each(c).attr("fill","none").attr("pointer-events","all").on("mousedown.brush",h).filter(i).on("touchstart.brush",h).on("touchmove.brush",d).on("touchend.brush touchcancel.brush",p).style("touch-action","none").style("-webkit-tap-highlight-color","rgba(0,0,0,0)")}function c(){var t=xe(this),e=_i(this).selection;e?(t.selectAll(".selection").style("display",null).attr("x",e[0][0]).attr("y",e[0][1]).attr("width",e[1][0]-e[0][0]).attr("height",e[1][1]-e[0][1]),t.selectAll(".handle").style("display",null).attr("x",(function(t){return"e"===t.type[t.type.length-1]?e[1][0]-s/2:e[0][0]-s/2})).attr("y",(function(t){return"s"===t.type[0]?e[1][1]-s/2:e[0][1]-s/2})).attr("width",(function(t){return"n"===t.type||"s"===t.type?e[1][0]-e[0][0]+s:s})).attr("height",(function(t){return"e"===t.type||"w"===t.type?e[1][1]-e[0][1]+s:s}))):t.selectAll(".selection,.handle").style("display","none").attr("x",null).attr("y",null).attr("width",null).attr("height",null)}function f(t,e,n){return!n&&t.__brush.emitter||new l(t,e)}function l(t,e){this.that=t,this.args=e,this.state=t.__brush,this.active=0}function h(){if((!e||ue.touches)&&r.apply(this,arguments)){var n,i,o,s,u,l,h,d,p,g,y,b=this,v=ue.target.__data__.type,m="selection"===(a&&ue.metaKey?v="overlay":v)?ei:a&&ue.altKey?ii:ri,_=t===ci?null:pi[v],w=t===ui?null:gi[v],x=_i(b),k=x.extent,E=x.selection,A=k[0][0],S=k[0][1],M=k[1][0],T=k[1][1],D=0,C=0,N=_&&w&&a&&ue.shiftKey,I=ue.touches?si(ue.changedTouches[0].identifier):In,L=I(b),B=L,O=f(b,arguments,!0).beforestart();"overlay"===v?(E&&(p=!0),x.selection=E=[[n=t===ci?A:L[0],o=t===ui?S:L[1]],[u=t===ci?M:n,h=t===ui?T:o]]):(n=E[0][0],o=E[0][1],u=E[1][0],h=E[1][1]),i=n,s=o,l=u,d=h;var R=xe(b).attr("pointer-events","none"),P=R.selectAll(".overlay").attr("cursor",li[v]);if(ue.touches)O.moved=q,O.ended=U;else{var F=xe(ue.view).on("mousemove.brush",q,!0).on("mouseup.brush",U,!0);a&&F.on("keydown.brush",z,!0).on("keyup.brush",Y,!0),Ae(ue.view)}Qr(),or(b),c.call(b),O.start()}function q(){var t=I(b);!N||g||y||(Math.abs(t[0]-B[0])>Math.abs(t[1]-B[1])?y=!0:g=!0),B=t,p=!0,ti(),j()}function j(){var t;switch(D=B[0]-L[0],C=B[1]-L[1],m){case ni:case ei:_&&(D=Math.max(A-n,Math.min(M-u,D)),i=n+D,l=u+D),w&&(C=Math.max(S-o,Math.min(T-h,C)),s=o+C,d=h+C);break;case ri:_<0?(D=Math.max(A-n,Math.min(M-n,D)),i=n+D,l=u):_>0&&(D=Math.max(A-u,Math.min(M-u,D)),i=n,l=u+D),w<0?(C=Math.max(S-o,Math.min(T-o,C)),s=o+C,d=h):w>0&&(C=Math.max(S-h,Math.min(T-h,C)),s=o,d=h+C);break;case ii:_&&(i=Math.max(A,Math.min(M,n-D*_)),l=Math.max(A,Math.min(M,u+D*_))),w&&(s=Math.max(S,Math.min(T,o-C*w)),d=Math.max(S,Math.min(T,h+C*w)))}l<i&&(_*=-1,t=n,n=u,u=t,t=i,i=l,l=t,v in hi&&P.attr("cursor",li[v=hi[v]])),d<s&&(w*=-1,t=o,o=h,h=t,t=s,s=d,d=t,v in di&&P.attr("cursor",li[v=di[v]])),x.selection&&(E=x.selection),g&&(i=E[0][0],l=E[1][0]),y&&(s=E[0][1],d=E[1][1]),E[0][0]===i&&E[0][1]===s&&E[1][0]===l&&E[1][1]===d||(x.selection=[[i,s],[l,d]],c.call(b),O.brush())}function U(){if(Qr(),ue.touches){if(ue.touches.length)return;e&&clearTimeout(e),e=setTimeout((function(){e=null}),500)}else Se(ue.view,p),F.on("keydown.brush keyup.brush mousemove.brush mouseup.brush",null);R.attr("pointer-events","all"),P.attr("cursor",li.overlay),x.selection&&(E=x.selection),wi(E)&&(x.selection=null,c.call(b)),O.end()}function z(){switch(ue.keyCode){case 16:N=_&&w;break;case 18:m===ri&&(_&&(u=l-D*_,n=i+D*_),w&&(h=d-C*w,o=s+C*w),m=ii,j());break;case 32:m!==ri&&m!==ii||(_<0?u=l-D:_>0&&(n=i-D),w<0?h=d-C:w>0&&(o=s-C),m=ni,P.attr("cursor",li.selection),j());break;default:return}ti()}function Y(){switch(ue.keyCode){case 16:N&&(g=y=N=!1,j());break;case 18:m===ii&&(_<0?u=l:_>0&&(n=i),w<0?h=d:w>0&&(o=s),m=ri,j());break;case 32:m===ni&&(ue.altKey?(_&&(u=l-D*_,n=i+D*_),w&&(h=d-C*w,o=s+C*w),m=ii):(_<0?u=l:_>0&&(n=i),w<0?h=d:w>0&&(o=s),m=ri),P.attr("cursor",li[v]),j());break;default:return}ti()}}function d(){f(this,arguments).moved()}function p(){f(this,arguments).ended()}function g(){var e=this.__brush||{selection:null};return e.extent=oi(n.apply(this,arguments)),e.dim=t,e}return u.move=function(e,n){e.selection?e.on("start.brush",(function(){f(this,arguments).beforestart().start()})).on("interrupt.brush end.brush",(function(){f(this,arguments).end()})).tween("brush",(function(){var e=this,r=e.__brush,i=f(e,arguments),a=r.selection,o=t.input("function"==typeof n?n.apply(this,arguments):n,r.extent),s=Tn(a,o);function u(t){r.selection=1===t&&null===o?null:s(t),c.call(e),i.brush()}return null!==a&&null!==o?u:u(1)})):e.each((function(){var e=this,r=arguments,i=e.__brush,a=t.input("function"==typeof n?n.apply(e,r):n,i.extent),o=f(e,r).beforestart();or(e),i.selection=null===a?null:a,c.call(e),o.start().brush().end()}))},u.clear=function(t){u.move(t,null)},l.prototype={beforestart:function(){return 1==++this.active&&(this.state.emitter=this,this.starting=!0),this},start:function(){return this.starting?(this.starting=!1,this.emit("start")):this.emit("brush"),this},brush:function(){return this.emit("brush"),this},end:function(){return 0==--this.active&&(delete this.state.emitter,this.emit("end")),this},emit:function(e){pe(new Jr(u,e,t.output(this.state.selection)),o.apply,o,[e,this.that,this.args])}},u.extent=function(t){return arguments.length?(n="function"==typeof t?t:Zr(oi(t)),u):n},u.filter=function(t){return arguments.length?(r="function"==typeof t?t:Zr(!!t),u):r},u.touchable=function(t){return arguments.length?(i="function"==typeof t?t:Zr(!!t),u):i},u.handleSize=function(t){return arguments.length?(s=+t,u):s},u.keyModifiers=function(t){return arguments.length?(a=!!t,u):a},u.on=function(){var t=o.on.apply(o,arguments);return t===o?u:t},u}var Mi=Math.cos,Ti=Math.sin,Di=Math.PI,Ci=Di/2,Ni=2*Di,Ii=Math.max;function Li(t){return function(e,n){return t(e.source.value+e.target.value,n.source.value+n.target.value)}}var Bi=function(){var t=0,e=null,n=null,r=null;function i(i){var a,o,s,u,c,f,l=i.length,h=[],d=x(l),p=[],g=[],y=g.groups=new Array(l),b=new Array(l*l);for(a=0,c=-1;++c<l;){for(o=0,f=-1;++f<l;)o+=i[c][f];h.push(o),p.push(x(l)),a+=o}for(e&&d.sort((function(t,n){return e(h[t],h[n])})),n&&p.forEach((function(t,e){t.sort((function(t,r){return n(i[e][t],i[e][r])}))})),u=(a=Ii(0,Ni-t*l)/a)?t:Ni/l,o=0,c=-1;++c<l;){for(s=o,f=-1;++f<l;){var v=d[c],m=p[v][f],_=i[v][m],w=o,k=o+=_*a;b[m*l+v]={index:v,subindex:m,startAngle:w,endAngle:k,value:_}}y[v]={index:v,startAngle:s,endAngle:o,value:h[v]},o+=u}for(c=-1;++c<l;)for(f=c-1;++f<l;){var E=b[f*l+c],A=b[c*l+f];(E.value||A.value)&&g.push(E.value<A.value?{source:A,target:E}:{source:E,target:A})}return r?g.sort(r):g}return i.padAngle=function(e){return arguments.length?(t=Ii(0,e),i):t},i.sortGroups=function(t){return arguments.length?(e=t,i):e},i.sortSubgroups=function(t){return arguments.length?(n=t,i):n},i.sortChords=function(t){return arguments.length?(null==t?r=null:(r=Li(t))._=t,i):r&&r._},i},Oi=Array.prototype.slice,Ri=function(t){return function(){return t}},Pi=Math.PI,Fi=2*Pi,qi=Fi-1e-6;function ji(){this._x0=this._y0=this._x1=this._y1=null,this._=""}function Ui(){return new ji}ji.prototype=Ui.prototype={constructor:ji,moveTo:function(t,e){this._+="M"+(this._x0=this._x1=+t)+","+(this._y0=this._y1=+e)},closePath:function(){null!==this._x1&&(this._x1=this._x0,this._y1=this._y0,this._+="Z")},lineTo:function(t,e){this._+="L"+(this._x1=+t)+","+(this._y1=+e)},quadraticCurveTo:function(t,e,n,r){this._+="Q"+ +t+","+ +e+","+(this._x1=+n)+","+(this._y1=+r)},bezierCurveTo:function(t,e,n,r,i,a){this._+="C"+ +t+","+ +e+","+ +n+","+ +r+","+(this._x1=+i)+","+(this._y1=+a)},arcTo:function(t,e,n,r,i){t=+t,e=+e,n=+n,r=+r,i=+i;var a=this._x1,o=this._y1,s=n-t,u=r-e,c=a-t,f=o-e,l=c*c+f*f;if(i<0)throw new Error("negative radius: "+i);if(null===this._x1)this._+="M"+(this._x1=t)+","+(this._y1=e);else if(l>1e-6)if(Math.abs(f*s-u*c)>1e-6&&i){var h=n-a,d=r-o,p=s*s+u*u,g=h*h+d*d,y=Math.sqrt(p),b=Math.sqrt(l),v=i*Math.tan((Pi-Math.acos((p+l-g)/(2*y*b)))/2),m=v/b,_=v/y;Math.abs(m-1)>1e-6&&(this._+="L"+(t+m*c)+","+(e+m*f)),this._+="A"+i+","+i+",0,0,"+ +(f*h>c*d)+","+(this._x1=t+_*s)+","+(this._y1=e+_*u)}else this._+="L"+(this._x1=t)+","+(this._y1=e);else;},arc:function(t,e,n,r,i,a){t=+t,e=+e,a=!!a;var o=(n=+n)*Math.cos(r),s=n*Math.sin(r),u=t+o,c=e+s,f=1^a,l=a?r-i:i-r;if(n<0)throw new Error("negative radius: "+n);null===this._x1?this._+="M"+u+","+c:(Math.abs(this._x1-u)>1e-6||Math.abs(this._y1-c)>1e-6)&&(this._+="L"+u+","+c),n&&(l<0&&(l=l%Fi+Fi),l>qi?this._+="A"+n+","+n+",0,1,"+f+","+(t-o)+","+(e-s)+"A"+n+","+n+",0,1,"+f+","+(this._x1=u)+","+(this._y1=c):l>1e-6&&(this._+="A"+n+","+n+",0,"+ +(l>=Pi)+","+f+","+(this._x1=t+n*Math.cos(i))+","+(this._y1=e+n*Math.sin(i))))},rect:function(t,e,n,r){this._+="M"+(this._x0=this._x1=+t)+","+(this._y0=this._y1=+e)+"h"+ +n+"v"+ +r+"h"+-n+"Z"},toString:function(){return this._}};var zi=Ui;function Yi(t){return t.source}function Vi(t){return t.target}function Hi(t){return t.radius}function Gi(t){return t.startAngle}function $i(t){return t.endAngle}var Wi=function(){var t=Yi,e=Vi,n=Hi,r=Gi,i=$i,a=null;function o(){var o,s=Oi.call(arguments),u=t.apply(this,s),c=e.apply(this,s),f=+n.apply(this,(s[0]=u,s)),l=r.apply(this,s)-Ci,h=i.apply(this,s)-Ci,d=f*Mi(l),p=f*Ti(l),g=+n.apply(this,(s[0]=c,s)),y=r.apply(this,s)-Ci,b=i.apply(this,s)-Ci;if(a||(a=o=zi()),a.moveTo(d,p),a.arc(0,0,f,l,h),l===y&&h===b||(a.quadraticCurveTo(0,0,g*Mi(y),g*Ti(y)),a.arc(0,0,g,y,b)),a.quadraticCurveTo(0,0,d,p),a.closePath(),o)return a=null,o+""||null}return o.radius=function(t){return arguments.length?(n="function"==typeof t?t:Ri(+t),o):n},o.startAngle=function(t){return arguments.length?(r="function"==typeof t?t:Ri(+t),o):r},o.endAngle=function(t){return arguments.length?(i="function"==typeof t?t:Ri(+t),o):i},o.source=function(e){return arguments.length?(t=e,o):t},o.target=function(t){return arguments.length?(e=t,o):e},o.context=function(t){return arguments.length?(a=null==t?null:t,o):a},o};function Ki(){}function Xi(t,e){var n=new Ki;if(t instanceof Ki)t.each((function(t,e){n.set(e,t)}));else if(Array.isArray(t)){var r,i=-1,a=t.length;if(null==e)for(;++i<a;)n.set(i,t[i]);else for(;++i<a;)n.set(e(r=t[i],i,t),r)}else if(t)for(var o in t)n.set(o,t[o]);return n}Ki.prototype=Xi.prototype={constructor:Ki,has:function(t){return"$"+t in this},get:function(t){return this["$"+t]},set:function(t,e){return this["$"+t]=e,this},remove:function(t){var e="$"+t;return e in this&&delete this[e]},clear:function(){for(var t in this)"$"===t[0]&&delete this[t]},keys:function(){var t=[];for(var e in this)"$"===e[0]&&t.push(e.slice(1));return t},values:function(){var t=[];for(var e in this)"$"===e[0]&&t.push(this[e]);return t},entries:function(){var t=[];for(var e in this)"$"===e[0]&&t.push({key:e.slice(1),value:this[e]});return t},size:function(){var t=0;for(var e in this)"$"===e[0]&&++t;return t},empty:function(){for(var t in this)if("$"===t[0])return!1;return!0},each:function(t){for(var e in this)"$"===e[0]&&t(this[e],e.slice(1),this)}};var Zi=Xi,Ji=function(){var t,e,n,r=[],i=[];function a(n,i,o,s){if(i>=r.length)return null!=t&&n.sort(t),null!=e?e(n):n;for(var u,c,f,l=-1,h=n.length,d=r[i++],p=Zi(),g=o();++l<h;)(f=p.get(u=d(c=n[l])+""))?f.push(c):p.set(u,[c]);return p.each((function(t,e){s(g,e,a(t,i,o,s))})),g}return n={object:function(t){return a(t,0,Qi,ta)},map:function(t){return a(t,0,ea,na)},entries:function(t){return function t(n,a){if(++a>r.length)return n;var o,s=i[a-1];return null!=e&&a>=r.length?o=n.entries():(o=[],n.each((function(e,n){o.push({key:n,values:t(e,a)})}))),null!=s?o.sort((function(t,e){return s(t.key,e.key)})):o}(a(t,0,ea,na),0)},key:function(t){return r.push(t),n},sortKeys:function(t){return i[r.length-1]=t,n},sortValues:function(e){return t=e,n},rollup:function(t){return e=t,n}}};function Qi(){return{}}function ta(t,e,n){t[e]=n}function ea(){return Zi()}function na(t,e,n){t.set(e,n)}function ra(){}var ia=Zi.prototype;function aa(t,e){var n=new ra;if(t instanceof ra)t.each((function(t){n.add(t)}));else if(t){var r=-1,i=t.length;if(null==e)for(;++r<i;)n.add(t[r]);else for(;++r<i;)n.add(e(t[r],r,t))}return n}ra.prototype=aa.prototype={constructor:ra,has:ia.has,add:function(t){return this["$"+(t+="")]=t,this},remove:ia.remove,clear:ia.clear,values:ia.keys,size:ia.size,empty:ia.empty,each:ia.each};var oa=aa,sa=function(t){var e=[];for(var n in t)e.push(n);return e},ua=function(t){var e=[];for(var n in t)e.push(t[n]);return e},ca=function(t){var e=[];for(var n in t)e.push({key:n,value:t[n]});return e},fa=Math.PI/180,la=180/Math.PI;function ha(t){if(t instanceof ga)return new ga(t.l,t.a,t.b,t.opacity);if(t instanceof ka)return Ea(t);t instanceof We||(t=Ge(t));var e,n,r=ma(t.r),i=ma(t.g),a=ma(t.b),o=ya((.2225045*r+.7168786*i+.0606169*a)/1);return r===i&&i===a?e=n=o:(e=ya((.4360747*r+.3850649*i+.1430804*a)/.96422),n=ya((.0139322*r+.0971045*i+.7141733*a)/.82521)),new ga(116*o-16,500*(e-o),200*(o-n),t.opacity)}function da(t,e){return new ga(t,0,0,null==e?1:e)}function pa(t,e,n,r){return 1===arguments.length?ha(t):new ga(t,e,n,null==r?1:r)}function ga(t,e,n,r){this.l=+t,this.a=+e,this.b=+n,this.opacity=+r}function ya(t){return t>6/29*(6/29)*(6/29)?Math.pow(t,1/3):t/(6/29*3*(6/29))+4/29}function ba(t){return t>6/29?t*t*t:6/29*3*(6/29)*(t-4/29)}function va(t){return 255*(t<=.0031308?12.92*t:1.055*Math.pow(t,1/2.4)-.055)}function ma(t){return(t/=255)<=.04045?t/12.92:Math.pow((t+.055)/1.055,2.4)}function _a(t){if(t instanceof ka)return new ka(t.h,t.c,t.l,t.opacity);if(t instanceof ga||(t=ha(t)),0===t.a&&0===t.b)return new ka(NaN,0<t.l&&t.l<100?0:NaN,t.l,t.opacity);var e=Math.atan2(t.b,t.a)*la;return new ka(e<0?e+360:e,Math.sqrt(t.a*t.a+t.b*t.b),t.l,t.opacity)}function wa(t,e,n,r){return 1===arguments.length?_a(t):new ka(n,e,t,null==r?1:r)}function xa(t,e,n,r){return 1===arguments.length?_a(t):new ka(t,e,n,null==r?1:r)}function ka(t,e,n,r){this.h=+t,this.c=+e,this.l=+n,this.opacity=+r}function Ea(t){if(isNaN(t.h))return new ga(t.l,0,0,t.opacity);var e=t.h*fa;return new ga(t.l,Math.cos(e)*t.c,Math.sin(e)*t.c,t.opacity)}Me(ga,pa,Te(De,{brighter:function(t){return new ga(this.l+18*(null==t?1:t),this.a,this.b,this.opacity)},darker:function(t){return new ga(this.l-18*(null==t?1:t),this.a,this.b,this.opacity)},rgb:function(){var t=(this.l+16)/116,e=isNaN(this.a)?t:t+this.a/500,n=isNaN(this.b)?t:t-this.b/200;return new We(va(3.1338561*(e=.96422*ba(e))-1.6168667*(t=1*ba(t))-.4906146*(n=.82521*ba(n))),va(-.9787684*e+1.9161415*t+.033454*n),va(.0719453*e-.2289914*t+1.4052427*n),this.opacity)}})),Me(ka,xa,Te(De,{brighter:function(t){return new ka(this.h,this.c,this.l+18*(null==t?1:t),this.opacity)},darker:function(t){return new ka(this.h,this.c,this.l-18*(null==t?1:t),this.opacity)},rgb:function(){return Ea(this).rgb()}}));var Aa=-.29227,Sa=-1.7884503806,Ma=3.5172982438,Ta=-.6557636667999999;function Da(t){if(t instanceof Na)return new Na(t.h,t.s,t.l,t.opacity);t instanceof We||(t=Ge(t));var e=t.r/255,n=t.g/255,r=t.b/255,i=(Ta*r+Sa*e-Ma*n)/(Ta+Sa-Ma),a=r-i,o=(1.97294*(n-i)-Aa*a)/-.90649,s=Math.sqrt(o*o+a*a)/(1.97294*i*(1-i)),u=s?Math.atan2(o,a)*la-120:NaN;return new Na(u<0?u+360:u,s,i,t.opacity)}function Ca(t,e,n,r){return 1===arguments.length?Da(t):new Na(t,e,n,null==r?1:r)}function Na(t,e,n,r){this.h=+t,this.s=+e,this.l=+n,this.opacity=+r}Me(Na,Ca,Te(De,{brighter:function(t){return t=null==t?1/.7:Math.pow(1/.7,t),new Na(this.h,this.s,this.l*t,this.opacity)},darker:function(t){return t=null==t?.7:Math.pow(.7,t),new Na(this.h,this.s,this.l*t,this.opacity)},rgb:function(){var t=isNaN(this.h)?0:(this.h+120)*fa,e=+this.l,n=isNaN(this.s)?0:this.s*e*(1-e),r=Math.cos(t),i=Math.sin(t);return new We(255*(e+n*(-.14861*r+1.78277*i)),255*(e+n*(Aa*r+-.90649*i)),255*(e+n*(1.97294*r)),this.opacity)}}));var Ia=Array.prototype.slice,La=function(t,e){return t-e},Ba=function(t){return function(){return t}},Oa=function(t,e){for(var n,r=-1,i=e.length;++r<i;)if(n=Ra(t,e[r]))return n;return 0};function Ra(t,e){for(var n=e[0],r=e[1],i=-1,a=0,o=t.length,s=o-1;a<o;s=a++){var u=t[a],c=u[0],f=u[1],l=t[s],h=l[0],d=l[1];if(Pa(u,l,e))return 0;f>r!=d>r&&n<(h-c)*(r-f)/(d-f)+c&&(i=-i)}return i}function Pa(t,e,n){var r,i,a,o;return function(t,e,n){return(e[0]-t[0])*(n[1]-t[1])==(n[0]-t[0])*(e[1]-t[1])}(t,e,n)&&(i=t[r=+(t[0]===e[0])],a=n[r],o=e[r],i<=a&&a<=o||o<=a&&a<=i)}var Fa=function(){},qa=[[],[[[1,1.5],[.5,1]]],[[[1.5,1],[1,1.5]]],[[[1.5,1],[.5,1]]],[[[1,.5],[1.5,1]]],[[[1,1.5],[.5,1]],[[1,.5],[1.5,1]]],[[[1,.5],[1,1.5]]],[[[1,.5],[.5,1]]],[[[.5,1],[1,.5]]],[[[1,1.5],[1,.5]]],[[[.5,1],[1,.5]],[[1.5,1],[1,1.5]]],[[[1.5,1],[1,.5]]],[[[.5,1],[1.5,1]]],[[[1,1.5],[1.5,1]]],[[[.5,1],[1,1.5]]],[]],ja=function(){var t=1,e=1,n=D,r=s;function i(t){var e=n(t);if(Array.isArray(e))e=e.slice().sort(La);else{var r=y(t),i=r[0],o=r[1];e=T(i,o,e),e=x(Math.floor(i/e)*e,Math.floor(o/e)*e,e)}return e.map((function(e){return a(t,e)}))}function a(n,i){var a=[],s=[];return function(n,r,i){var a,s,u,c,f,l,h=new Array,d=new Array;a=s=-1,c=n[0]>=r,qa[c<<1].forEach(p);for(;++a<t-1;)u=c,c=n[a+1]>=r,qa[u|c<<1].forEach(p);qa[c<<0].forEach(p);for(;++s<e-1;){for(a=-1,c=n[s*t+t]>=r,f=n[s*t]>=r,qa[c<<1|f<<2].forEach(p);++a<t-1;)u=c,c=n[s*t+t+a+1]>=r,l=f,f=n[s*t+a+1]>=r,qa[u|c<<1|f<<2|l<<3].forEach(p);qa[c|f<<3].forEach(p)}a=-1,f=n[s*t]>=r,qa[f<<2].forEach(p);for(;++a<t-1;)l=f,f=n[s*t+a+1]>=r,qa[f<<2|l<<3].forEach(p);function p(t){var e,n,r=[t[0][0]+a,t[0][1]+s],u=[t[1][0]+a,t[1][1]+s],c=o(r),f=o(u);(e=d[c])?(n=h[f])?(delete d[e.end],delete h[n.start],e===n?(e.ring.push(u),i(e.ring)):h[e.start]=d[n.end]={start:e.start,end:n.end,ring:e.ring.concat(n.ring)}):(delete d[e.end],e.ring.push(u),d[e.end=f]=e):(e=h[f])?(n=d[c])?(delete h[e.start],delete d[n.end],e===n?(e.ring.push(u),i(e.ring)):h[n.start]=d[e.end]={start:n.start,end:e.end,ring:n.ring.concat(e.ring)}):(delete h[e.start],e.ring.unshift(r),h[e.start=c]=e):h[c]=d[f]={start:c,end:f,ring:[r,u]}}qa[f<<3].forEach(p)}(n,i,(function(t){r(t,n,i),function(t){for(var e=0,n=t.length,r=t[n-1][1]*t[0][0]-t[n-1][0]*t[0][1];++e<n;)r+=t[e-1][1]*t[e][0]-t[e-1][0]*t[e][1];return r}(t)>0?a.push([t]):s.push(t)})),s.forEach((function(t){for(var e,n=0,r=a.length;n<r;++n)if(-1!==Oa((e=a[n])[0],t))return void e.push(t)})),{type:"MultiPolygon",value:i,coordinates:a}}function o(e){return 2*e[0]+e[1]*(t+1)*4}function s(n,r,i){n.forEach((function(n){var a,o=n[0],s=n[1],u=0|o,c=0|s,f=r[c*t+u];o>0&&o<t&&u===o&&(a=r[c*t+u-1],n[0]=o+(i-a)/(f-a)-.5),s>0&&s<e&&c===s&&(a=r[(c-1)*t+u],n[1]=s+(i-a)/(f-a)-.5)}))}return i.contour=a,i.size=function(n){if(!arguments.length)return[t,e];var r=Math.ceil(n[0]),a=Math.ceil(n[1]);if(!(r>0&&a>0))throw new Error("invalid size");return t=r,e=a,i},i.thresholds=function(t){return arguments.length?(n="function"==typeof t?t:Array.isArray(t)?Ba(Ia.call(t)):Ba(t),i):n},i.smooth=function(t){return arguments.length?(r=t?s:Fa,i):r===s},i};function Ua(t,e,n){for(var r=t.width,i=t.height,a=1+(n<<1),o=0;o<i;++o)for(var s=0,u=0;s<r+n;++s)s<r&&(u+=t.data[s+o*r]),s>=n&&(s>=a&&(u-=t.data[s-a+o*r]),e.data[s-n+o*r]=u/Math.min(s+1,r-1+a-s,a))}function za(t,e,n){for(var r=t.width,i=t.height,a=1+(n<<1),o=0;o<r;++o)for(var s=0,u=0;s<i+n;++s)s<i&&(u+=t.data[o+s*r]),s>=n&&(s>=a&&(u-=t.data[o+(s-a)*r]),e.data[o+(s-n)*r]=u/Math.min(s+1,i-1+a-s,a))}function Ya(t){return t[0]}function Va(t){return t[1]}function Ha(){return 1}var Ga=function(){var t=Ya,e=Va,n=Ha,r=960,i=500,a=20,o=2,s=3*a,u=r+2*s>>o,c=i+2*s>>o,f=Ba(20);function l(r){var i=new Float32Array(u*c),l=new Float32Array(u*c);r.forEach((function(r,a,f){var l=+t(r,a,f)+s>>o,h=+e(r,a,f)+s>>o,d=+n(r,a,f);l>=0&&l<u&&h>=0&&h<c&&(i[l+h*u]+=d)})),Ua({width:u,height:c,data:i},{width:u,height:c,data:l},a>>o),za({width:u,height:c,data:l},{width:u,height:c,data:i},a>>o),Ua({width:u,height:c,data:i},{width:u,height:c,data:l},a>>o),za({width:u,height:c,data:l},{width:u,height:c,data:i},a>>o),Ua({width:u,height:c,data:i},{width:u,height:c,data:l},a>>o),za({width:u,height:c,data:l},{width:u,height:c,data:i},a>>o);var d=f(i);if(!Array.isArray(d)){var p=B(i);d=T(0,p,d),(d=x(0,Math.floor(p/d)*d,d)).shift()}return ja().thresholds(d).size([u,c])(i).map(h)}function h(t){return t.value*=Math.pow(2,-2*o),t.coordinates.forEach(d),t}function d(t){t.forEach(p)}function p(t){t.forEach(g)}function g(t){t[0]=t[0]*Math.pow(2,o)-s,t[1]=t[1]*Math.pow(2,o)-s}function y(){return u=r+2*(s=3*a)>>o,c=i+2*s>>o,l}return l.x=function(e){return arguments.length?(t="function"==typeof e?e:Ba(+e),l):t},l.y=function(t){return arguments.length?(e="function"==typeof t?t:Ba(+t),l):e},l.weight=function(t){return arguments.length?(n="function"==typeof t?t:Ba(+t),l):n},l.size=function(t){if(!arguments.length)return[r,i];var e=Math.ceil(t[0]),n=Math.ceil(t[1]);if(!(e>=0||e>=0))throw new Error("invalid size");return r=e,i=n,y()},l.cellSize=function(t){if(!arguments.length)return 1<<o;if(!((t=+t)>=1))throw new Error("invalid cell size");return o=Math.floor(Math.log(t)/Math.LN2),y()},l.thresholds=function(t){return arguments.length?(f="function"==typeof t?t:Array.isArray(t)?Ba(Ia.call(t)):Ba(t),l):f},l.bandwidth=function(t){if(!arguments.length)return Math.sqrt(a*(a+1));if(!((t=+t)>=0))throw new Error("invalid bandwidth");return a=Math.round((Math.sqrt(4*t*t+1)-1)/2),y()},l},$a=function(t){return function(){return t}};function Wa(t,e,n,r,i,a,o,s,u,c){this.target=t,this.type=e,this.subject=n,this.identifier=r,this.active=i,this.x=a,this.y=o,this.dx=s,this.dy=u,this._=c}function Ka(){return!ue.ctrlKey&&!ue.button}function Xa(){return this.parentNode}function Za(t){return null==t?{x:ue.x,y:ue.y}:t}function Ja(){return navigator.maxTouchPoints||"ontouchstart"in this}Wa.prototype.on=function(){var t=this._.on.apply(this._,arguments);return t===this._?this:t};var Qa=function(){var t,e,n,r,i=Ka,a=Xa,o=Za,s=Ja,u={},c=ft("start","drag","end"),f=0,l=0;function h(t){t.on("mousedown.drag",d).filter(s).on("touchstart.drag",y).on("touchmove.drag",b).on("touchend.drag touchcancel.drag",v).style("touch-action","none").style("-webkit-tap-highlight-color","rgba(0,0,0,0)")}function d(){if(!r&&i.apply(this,arguments)){var o=m("mouse",a.apply(this,arguments),In,this,arguments);o&&(xe(ue.view).on("mousemove.drag",p,!0).on("mouseup.drag",g,!0),Ae(ue.view),ke(),n=!1,t=ue.clientX,e=ue.clientY,o("start"))}}function p(){if(Ee(),!n){var r=ue.clientX-t,i=ue.clientY-e;n=r*r+i*i>l}u.mouse("drag")}function g(){xe(ue.view).on("mousemove.drag mouseup.drag",null),Se(ue.view,n),Ee(),u.mouse("end")}function y(){if(i.apply(this,arguments)){var t,e,n=ue.changedTouches,r=a.apply(this,arguments),o=n.length;for(t=0;t<o;++t)(e=m(n[t].identifier,r,Nn,this,arguments))&&(ke(),e("start"))}}function b(){var t,e,n=ue.changedTouches,r=n.length;for(t=0;t<r;++t)(e=u[n[t].identifier])&&(Ee(),e("drag"))}function v(){var t,e,n=ue.changedTouches,i=n.length;for(r&&clearTimeout(r),r=setTimeout((function(){r=null}),500),t=0;t<i;++t)(e=u[n[t].identifier])&&(ke(),e("end"))}function m(t,e,n,r,i){var a,s,l,d=n(e,t),p=c.copy();if(pe(new Wa(h,"beforestart",a,t,f,d[0],d[1],0,0,p),(function(){return null!=(ue.subject=a=o.apply(r,i))&&(s=a.x-d[0]||0,l=a.y-d[1]||0,!0)})))return function o(c){var g,y=d;switch(c){case"start":u[t]=o,g=f++;break;case"end":delete u[t],--f;case"drag":d=n(e,t),g=f}pe(new Wa(h,c,a,t,g,d[0]+s,d[1]+l,d[0]-y[0],d[1]-y[1],p),p.apply,p,[c,r,i])}}return h.filter=function(t){return arguments.length?(i="function"==typeof t?t:$a(!!t),h):i},h.container=function(t){return arguments.length?(a="function"==typeof t?t:$a(t),h):a},h.subject=function(t){return arguments.length?(o="function"==typeof t?t:$a(t),h):o},h.touchable=function(t){return arguments.length?(s="function"==typeof t?t:$a(!!t),h):s},h.on=function(){var t=c.on.apply(c,arguments);return t===c?h:t},h.clickDistance=function(t){return arguments.length?(l=(t=+t)*t,h):Math.sqrt(l)},h},to={},eo={};function no(t){return new Function("d","return {"+t.map((function(t,e){return JSON.stringify(t)+": d["+e+'] || ""'})).join(",")+"}")}function ro(t){var e=Object.create(null),n=[];return t.forEach((function(t){for(var r in t)r in e||n.push(e[r]=r)})),n}function io(t,e){var n=t+"",r=n.length;return r<e?new Array(e-r+1).join(0)+n:n}function ao(t){var e,n=t.getUTCHours(),r=t.getUTCMinutes(),i=t.getUTCSeconds(),a=t.getUTCMilliseconds();return isNaN(t)?"Invalid Date":((e=t.getUTCFullYear())<0?"-"+io(-e,6):e>9999?"+"+io(e,6):io(e,4))+"-"+io(t.getUTCMonth()+1,2)+"-"+io(t.getUTCDate(),2)+(a?"T"+io(n,2)+":"+io(r,2)+":"+io(i,2)+"."+io(a,3)+"Z":i?"T"+io(n,2)+":"+io(r,2)+":"+io(i,2)+"Z":r||n?"T"+io(n,2)+":"+io(r,2)+"Z":"")}var oo=function(t){var e=new RegExp('["'+t+"\n\r]"),n=t.charCodeAt(0);function r(t,e){var r,i=[],a=t.length,o=0,s=0,u=a<=0,c=!1;function f(){if(u)return eo;if(c)return c=!1,to;var e,r,i=o;if(34===t.charCodeAt(i)){for(;o++<a&&34!==t.charCodeAt(o)||34===t.charCodeAt(++o););return(e=o)>=a?u=!0:10===(r=t.charCodeAt(o++))?c=!0:13===r&&(c=!0,10===t.charCodeAt(o)&&++o),t.slice(i+1,e-1).replace(/""/g,'"')}for(;o<a;){if(10===(r=t.charCodeAt(e=o++)))c=!0;else if(13===r)c=!0,10===t.charCodeAt(o)&&++o;else if(r!==n)continue;return t.slice(i,e)}return u=!0,t.slice(i,a)}for(10===t.charCodeAt(a-1)&&--a,13===t.charCodeAt(a-1)&&--a;(r=f())!==eo;){for(var l=[];r!==to&&r!==eo;)l.push(r),r=f();e&&null==(l=e(l,s++))||i.push(l)}return i}function i(e,n){return e.map((function(e){return n.map((function(t){return o(e[t])})).join(t)}))}function a(e){return e.map(o).join(t)}function o(t){return null==t?"":t instanceof Date?ao(t):e.test(t+="")?'"'+t.replace(/"/g,'""')+'"':t}return{parse:function(t,e){var n,i,a=r(t,(function(t,r){if(n)return n(t,r-1);i=t,n=e?function(t,e){var n=no(t);return function(r,i){return e(n(r),i,t)}}(t,e):no(t)}));return a.columns=i||[],a},parseRows:r,format:function(e,n){return null==n&&(n=ro(e)),[n.map(o).join(t)].concat(i(e,n)).join("\n")},formatBody:function(t,e){return null==e&&(e=ro(t)),i(t,e).join("\n")},formatRows:function(t){return t.map(a).join("\n")},formatRow:a,formatValue:o}},so=oo(","),uo=so.parse,co=so.parseRows,fo=so.format,lo=so.formatBody,ho=so.formatRows,po=so.formatRow,go=so.formatValue,yo=oo("\t"),bo=yo.parse,vo=yo.parseRows,mo=yo.format,_o=yo.formatBody,wo=yo.formatRows,xo=yo.formatRow,ko=yo.formatValue;function Eo(t){for(var e in t){var n,r,i=t[e].trim();if(i)if("true"===i)i=!0;else if("false"===i)i=!1;else if("NaN"===i)i=NaN;else if(isNaN(n=+i)){if(!(r=i.match(/^([-+]\d{2})?\d{4}(-\d{2}(-\d{2})?)?(T\d{2}:\d{2}(:\d{2}(\.\d{3})?)?(Z|[-+]\d{2}:\d{2})?)?$/)))continue;Ao&&r[4]&&!r[7]&&(i=i.replace(/-/g,"/").replace(/T/," ")),i=new Date(i)}else i=n;else i=null;t[e]=i}return t}var Ao=new Date("2019-01-01T00:00").getHours()||new Date("2019-07-01T00:00").getHours();function So(t){return+t}function Mo(t){return t*t}function To(t){return t*(2-t)}function Do(t){return((t*=2)<=1?t*t:--t*(2-t)+1)/2}var Co=function t(e){function n(t){return Math.pow(t,e)}return e=+e,n.exponent=t,n}(3),No=function t(e){function n(t){return 1-Math.pow(1-t,e)}return e=+e,n.exponent=t,n}(3),Io=function t(e){function n(t){return((t*=2)<=1?Math.pow(t,e):2-Math.pow(2-t,e))/2}return e=+e,n.exponent=t,n}(3),Lo=Math.PI,Bo=Lo/2;function Oo(t){return 1-Math.cos(t*Bo)}function Ro(t){return Math.sin(t*Bo)}function Po(t){return(1-Math.cos(Lo*t))/2}function Fo(t){return Math.pow(2,10*t-10)}function qo(t){return 1-Math.pow(2,-10*t)}function jo(t){return((t*=2)<=1?Math.pow(2,10*t-10):2-Math.pow(2,10-10*t))/2}function Uo(t){return 1-Math.sqrt(1-t*t)}function zo(t){return Math.sqrt(1- --t*t)}function Yo(t){return((t*=2)<=1?1-Math.sqrt(1-t*t):Math.sqrt(1-(t-=2)*t)+1)/2}function Vo(t){return 1-Ho(1-t)}function Ho(t){return(t=+t)<4/11?7.5625*t*t:t<8/11?7.5625*(t-=6/11)*t+.75:t<10/11?7.5625*(t-=9/11)*t+.9375:7.5625*(t-=21/22)*t+63/64}function Go(t){return((t*=2)<=1?1-Ho(1-t):Ho(t-1)+1)/2}var $o=function t(e){function n(t){return t*t*((e+1)*t-e)}return e=+e,n.overshoot=t,n}(1.70158),Wo=function t(e){function n(t){return--t*t*((e+1)*t+e)+1}return e=+e,n.overshoot=t,n}(1.70158),Ko=function t(e){function n(t){return((t*=2)<1?t*t*((e+1)*t-e):(t-=2)*t*((e+1)*t+e)+2)/2}return e=+e,n.overshoot=t,n}(1.70158),Xo=2*Math.PI,Zo=function t(e,n){var r=Math.asin(1/(e=Math.max(1,e)))*(n/=Xo);function i(t){return e*Math.pow(2,10*--t)*Math.sin((r-t)/n)}return i.amplitude=function(e){return t(e,n*Xo)},i.period=function(n){return t(e,n)},i}(1,.3),Jo=function t(e,n){var r=Math.asin(1/(e=Math.max(1,e)))*(n/=Xo);function i(t){return 1-e*Math.pow(2,-10*(t=+t))*Math.sin((t+r)/n)}return i.amplitude=function(e){return t(e,n*Xo)},i.period=function(n){return t(e,n)},i}(1,.3),Qo=function t(e,n){var r=Math.asin(1/(e=Math.max(1,e)))*(n/=Xo);function i(t){return((t=2*t-1)<0?e*Math.pow(2,10*t)*Math.sin((r-t)/n):2-e*Math.pow(2,-10*t)*Math.sin((r+t)/n))/2}return i.amplitude=function(e){return t(e,n*Xo)},i.period=function(n){return t(e,n)},i}(1,.3);function ts(t){if(!t.ok)throw new Error(t.status+" "+t.statusText);return t.blob()}var es=function(t,e){return fetch(t,e).then(ts)};function ns(t){if(!t.ok)throw new Error(t.status+" "+t.statusText);return t.arrayBuffer()}var rs=function(t,e){return fetch(t,e).then(ns)};function is(t){if(!t.ok)throw new Error(t.status+" "+t.statusText);return t.text()}var as=function(t,e){return fetch(t,e).then(is)};function os(t){return function(e,n,r){return 2===arguments.length&&"function"==typeof n&&(r=n,n=void 0),as(e,n).then((function(e){return t(e,r)}))}}function ss(t,e,n,r){3===arguments.length&&"function"==typeof n&&(r=n,n=void 0);var i=oo(t);return as(e,n).then((function(t){return i.parse(t,r)}))}var us=os(uo),cs=os(bo),fs=function(t,e){return new Promise((function(n,r){var i=new Image;for(var a in e)i[a]=e[a];i.onerror=r,i.onload=function(){n(i)},i.src=t}))};function ls(t){if(!t.ok)throw new Error(t.status+" "+t.statusText);return t.json()}var hs=function(t,e){return fetch(t,e).then(ls)};function ds(t){return function(e,n){return as(e,n).then((function(e){return(new DOMParser).parseFromString(e,t)}))}}var ps=ds("application/xml"),gs=ds("text/html"),ys=ds("image/svg+xml"),bs=function(t,e){var n;function r(){var r,i,a=n.length,o=0,s=0;for(r=0;r<a;++r)o+=(i=n[r]).x,s+=i.y;for(o=o/a-t,s=s/a-e,r=0;r<a;++r)(i=n[r]).x-=o,i.y-=s}return null==t&&(t=0),null==e&&(e=0),r.initialize=function(t){n=t},r.x=function(e){return arguments.length?(t=+e,r):t},r.y=function(t){return arguments.length?(e=+t,r):e},r},vs=function(t){return function(){return t}},ms=function(){return 1e-6*(Math.random()-.5)};function _s(t,e,n,r){if(isNaN(e)||isNaN(n))return t;var i,a,o,s,u,c,f,l,h,d=t._root,p={data:r},g=t._x0,y=t._y0,b=t._x1,v=t._y1;if(!d)return t._root=p,t;for(;d.length;)if((c=e>=(a=(g+b)/2))?g=a:b=a,(f=n>=(o=(y+v)/2))?y=o:v=o,i=d,!(d=d[l=f<<1|c]))return i[l]=p,t;if(s=+t._x.call(null,d.data),u=+t._y.call(null,d.data),e===s&&n===u)return p.next=d,i?i[l]=p:t._root=p,t;do{i=i?i[l]=new Array(4):t._root=new Array(4),(c=e>=(a=(g+b)/2))?g=a:b=a,(f=n>=(o=(y+v)/2))?y=o:v=o}while((l=f<<1|c)==(h=(u>=o)<<1|s>=a));return i[h]=d,i[l]=p,t}var ws=function(t,e,n,r,i){this.node=t,this.x0=e,this.y0=n,this.x1=r,this.y1=i};function xs(t){return t[0]}function ks(t){return t[1]}function Es(t,e,n){var r=new As(null==e?xs:e,null==n?ks:n,NaN,NaN,NaN,NaN);return null==t?r:r.addAll(t)}function As(t,e,n,r,i,a){this._x=t,this._y=e,this._x0=n,this._y0=r,this._x1=i,this._y1=a,this._root=void 0}function Ss(t){for(var e={data:t.data},n=e;t=t.next;)n=n.next={data:t.data};return e}var Ms=Es.prototype=As.prototype;function Ts(t){return t.x+t.vx}function Ds(t){return t.y+t.vy}Ms.copy=function(){var t,e,n=new As(this._x,this._y,this._x0,this._y0,this._x1,this._y1),r=this._root;if(!r)return n;if(!r.length)return n._root=Ss(r),n;for(t=[{source:r,target:n._root=new Array(4)}];r=t.pop();)for(var i=0;i<4;++i)(e=r.source[i])&&(e.length?t.push({source:e,target:r.target[i]=new Array(4)}):r.target[i]=Ss(e));return n},Ms.add=function(t){var e=+this._x.call(null,t),n=+this._y.call(null,t);return _s(this.cover(e,n),e,n,t)},Ms.addAll=function(t){var e,n,r,i,a=t.length,o=new Array(a),s=new Array(a),u=1/0,c=1/0,f=-1/0,l=-1/0;for(n=0;n<a;++n)isNaN(r=+this._x.call(null,e=t[n]))||isNaN(i=+this._y.call(null,e))||(o[n]=r,s[n]=i,r<u&&(u=r),r>f&&(f=r),i<c&&(c=i),i>l&&(l=i));if(u>f||c>l)return this;for(this.cover(u,c).cover(f,l),n=0;n<a;++n)_s(this,o[n],s[n],t[n]);return this},Ms.cover=function(t,e){if(isNaN(t=+t)||isNaN(e=+e))return this;var n=this._x0,r=this._y0,i=this._x1,a=this._y1;if(isNaN(n))i=(n=Math.floor(t))+1,a=(r=Math.floor(e))+1;else{for(var o,s,u=i-n,c=this._root;n>t||t>=i||r>e||e>=a;)switch(s=(e<r)<<1|t<n,(o=new Array(4))[s]=c,c=o,u*=2,s){case 0:i=n+u,a=r+u;break;case 1:n=i-u,a=r+u;break;case 2:i=n+u,r=a-u;break;case 3:n=i-u,r=a-u}this._root&&this._root.length&&(this._root=c)}return this._x0=n,this._y0=r,this._x1=i,this._y1=a,this},Ms.data=function(){var t=[];return this.visit((function(e){if(!e.length)do{t.push(e.data)}while(e=e.next)})),t},Ms.extent=function(t){return arguments.length?this.cover(+t[0][0],+t[0][1]).cover(+t[1][0],+t[1][1]):isNaN(this._x0)?void 0:[[this._x0,this._y0],[this._x1,this._y1]]},Ms.find=function(t,e,n){var r,i,a,o,s,u,c,f=this._x0,l=this._y0,h=this._x1,d=this._y1,p=[],g=this._root;for(g&&p.push(new ws(g,f,l,h,d)),null==n?n=1/0:(f=t-n,l=e-n,h=t+n,d=e+n,n*=n);u=p.pop();)if(!(!(g=u.node)||(i=u.x0)>h||(a=u.y0)>d||(o=u.x1)<f||(s=u.y1)<l))if(g.length){var y=(i+o)/2,b=(a+s)/2;p.push(new ws(g[3],y,b,o,s),new ws(g[2],i,b,y,s),new ws(g[1],y,a,o,b),new ws(g[0],i,a,y,b)),(c=(e>=b)<<1|t>=y)&&(u=p[p.length-1],p[p.length-1]=p[p.length-1-c],p[p.length-1-c]=u)}else{var v=t-+this._x.call(null,g.data),m=e-+this._y.call(null,g.data),_=v*v+m*m;if(_<n){var w=Math.sqrt(n=_);f=t-w,l=e-w,h=t+w,d=e+w,r=g.data}}return r},Ms.remove=function(t){if(isNaN(a=+this._x.call(null,t))||isNaN(o=+this._y.call(null,t)))return this;var e,n,r,i,a,o,s,u,c,f,l,h,d=this._root,p=this._x0,g=this._y0,y=this._x1,b=this._y1;if(!d)return this;if(d.length)for(;;){if((c=a>=(s=(p+y)/2))?p=s:y=s,(f=o>=(u=(g+b)/2))?g=u:b=u,e=d,!(d=d[l=f<<1|c]))return this;if(!d.length)break;(e[l+1&3]||e[l+2&3]||e[l+3&3])&&(n=e,h=l)}for(;d.data!==t;)if(r=d,!(d=d.next))return this;return(i=d.next)&&delete d.next,r?(i?r.next=i:delete r.next,this):e?(i?e[l]=i:delete e[l],(d=e[0]||e[1]||e[2]||e[3])&&d===(e[3]||e[2]||e[1]||e[0])&&!d.length&&(n?n[h]=d:this._root=d),this):(this._root=i,this)},Ms.removeAll=function(t){for(var e=0,n=t.length;e<n;++e)this.remove(t[e]);return this},Ms.root=function(){return this._root},Ms.size=function(){var t=0;return this.visit((function(e){if(!e.length)do{++t}while(e=e.next)})),t},Ms.visit=function(t){var e,n,r,i,a,o,s=[],u=this._root;for(u&&s.push(new ws(u,this._x0,this._y0,this._x1,this._y1));e=s.pop();)if(!t(u=e.node,r=e.x0,i=e.y0,a=e.x1,o=e.y1)&&u.length){var c=(r+a)/2,f=(i+o)/2;(n=u[3])&&s.push(new ws(n,c,f,a,o)),(n=u[2])&&s.push(new ws(n,r,f,c,o)),(n=u[1])&&s.push(new ws(n,c,i,a,f)),(n=u[0])&&s.push(new ws(n,r,i,c,f))}return this},Ms.visitAfter=function(t){var e,n=[],r=[];for(this._root&&n.push(new ws(this._root,this._x0,this._y0,this._x1,this._y1));e=n.pop();){var i=e.node;if(i.length){var a,o=e.x0,s=e.y0,u=e.x1,c=e.y1,f=(o+u)/2,l=(s+c)/2;(a=i[0])&&n.push(new ws(a,o,s,f,l)),(a=i[1])&&n.push(new ws(a,f,s,u,l)),(a=i[2])&&n.push(new ws(a,o,l,f,c)),(a=i[3])&&n.push(new ws(a,f,l,u,c))}r.push(e)}for(;e=r.pop();)t(e.node,e.x0,e.y0,e.x1,e.y1);return this},Ms.x=function(t){return arguments.length?(this._x=t,this):this._x},Ms.y=function(t){return arguments.length?(this._y=t,this):this._y};var Cs=function(t){var e,n,r=1,i=1;function a(){for(var t,a,s,u,c,f,l,h=e.length,d=0;d<i;++d)for(a=Es(e,Ts,Ds).visitAfter(o),t=0;t<h;++t)s=e[t],f=n[s.index],l=f*f,u=s.x+s.vx,c=s.y+s.vy,a.visit(p);function p(t,e,n,i,a){var o=t.data,h=t.r,d=f+h;if(!o)return e>u+d||i<u-d||n>c+d||a<c-d;if(o.index>s.index){var p=u-o.x-o.vx,g=c-o.y-o.vy,y=p*p+g*g;y<d*d&&(0===p&&(y+=(p=ms())*p),0===g&&(y+=(g=ms())*g),y=(d-(y=Math.sqrt(y)))/y*r,s.vx+=(p*=y)*(d=(h*=h)/(l+h)),s.vy+=(g*=y)*d,o.vx-=p*(d=1-d),o.vy-=g*d)}}}function o(t){if(t.data)return t.r=n[t.data.index];for(var e=t.r=0;e<4;++e)t[e]&&t[e].r>t.r&&(t.r=t[e].r)}function s(){if(e){var r,i,a=e.length;for(n=new Array(a),r=0;r<a;++r)i=e[r],n[i.index]=+t(i,r,e)}}return"function"!=typeof t&&(t=vs(null==t?1:+t)),a.initialize=function(t){e=t,s()},a.iterations=function(t){return arguments.length?(i=+t,a):i},a.strength=function(t){return arguments.length?(r=+t,a):r},a.radius=function(e){return arguments.length?(t="function"==typeof e?e:vs(+e),s(),a):t},a};function Ns(t){return t.index}function Is(t,e){var n=t.get(e);if(!n)throw new Error("missing: "+e);return n}var Ls=function(t){var e,n,r,i,a,o=Ns,s=function(t){return 1/Math.min(i[t.source.index],i[t.target.index])},u=vs(30),c=1;function f(r){for(var i=0,o=t.length;i<c;++i)for(var s,u,f,l,h,d,p,g=0;g<o;++g)u=(s=t[g]).source,l=(f=s.target).x+f.vx-u.x-u.vx||ms(),h=f.y+f.vy-u.y-u.vy||ms(),l*=d=((d=Math.sqrt(l*l+h*h))-n[g])/d*r*e[g],h*=d,f.vx-=l*(p=a[g]),f.vy-=h*p,u.vx+=l*(p=1-p),u.vy+=h*p}function l(){if(r){var s,u,c=r.length,f=t.length,l=Zi(r,o);for(s=0,i=new Array(c);s<f;++s)(u=t[s]).index=s,"object"!=typeof u.source&&(u.source=Is(l,u.source)),"object"!=typeof u.target&&(u.target=Is(l,u.target)),i[u.source.index]=(i[u.source.index]||0)+1,i[u.target.index]=(i[u.target.index]||0)+1;for(s=0,a=new Array(f);s<f;++s)u=t[s],a[s]=i[u.source.index]/(i[u.source.index]+i[u.target.index]);e=new Array(f),h(),n=new Array(f),d()}}function h(){if(r)for(var n=0,i=t.length;n<i;++n)e[n]=+s(t[n],n,t)}function d(){if(r)for(var e=0,i=t.length;e<i;++e)n[e]=+u(t[e],e,t)}return null==t&&(t=[]),f.initialize=function(t){r=t,l()},f.links=function(e){return arguments.length?(t=e,l(),f):t},f.id=function(t){return arguments.length?(o=t,f):o},f.iterations=function(t){return arguments.length?(c=+t,f):c},f.strength=function(t){return arguments.length?(s="function"==typeof t?t:vs(+t),h(),f):s},f.distance=function(t){return arguments.length?(u="function"==typeof t?t:vs(+t),d(),f):u},f};function Bs(t){return t.x}function Os(t){return t.y}var Rs=Math.PI*(3-Math.sqrt(5)),Ps=function(t){var e,n=1,r=.001,i=1-Math.pow(r,1/300),a=0,o=.6,s=Zi(),u=Vn(f),c=ft("tick","end");function f(){l(),c.call("tick",e),n<r&&(u.stop(),c.call("end",e))}function l(r){var u,c,f=t.length;void 0===r&&(r=1);for(var l=0;l<r;++l)for(n+=(a-n)*i,s.each((function(t){t(n)})),u=0;u<f;++u)null==(c=t[u]).fx?c.x+=c.vx*=o:(c.x=c.fx,c.vx=0),null==c.fy?c.y+=c.vy*=o:(c.y=c.fy,c.vy=0);return e}function h(){for(var e,n=0,r=t.length;n<r;++n){if((e=t[n]).index=n,null!=e.fx&&(e.x=e.fx),null!=e.fy&&(e.y=e.fy),isNaN(e.x)||isNaN(e.y)){var i=10*Math.sqrt(n),a=n*Rs;e.x=i*Math.cos(a),e.y=i*Math.sin(a)}(isNaN(e.vx)||isNaN(e.vy))&&(e.vx=e.vy=0)}}function d(e){return e.initialize&&e.initialize(t),e}return null==t&&(t=[]),h(),e={tick:l,restart:function(){return u.restart(f),e},stop:function(){return u.stop(),e},nodes:function(n){return arguments.length?(t=n,h(),s.each(d),e):t},alpha:function(t){return arguments.length?(n=+t,e):n},alphaMin:function(t){return arguments.length?(r=+t,e):r},alphaDecay:function(t){return arguments.length?(i=+t,e):+i},alphaTarget:function(t){return arguments.length?(a=+t,e):a},velocityDecay:function(t){return arguments.length?(o=1-t,e):1-o},force:function(t,n){return arguments.length>1?(null==n?s.remove(t):s.set(t,d(n)),e):s.get(t)},find:function(e,n,r){var i,a,o,s,u,c=0,f=t.length;for(null==r?r=1/0:r*=r,c=0;c<f;++c)(o=(i=e-(s=t[c]).x)*i+(a=n-s.y)*a)<r&&(u=s,r=o);return u},on:function(t,n){return arguments.length>1?(c.on(t,n),e):c.on(t)}}},Fs=function(){var t,e,n,r,i=vs(-30),a=1,o=1/0,s=.81;function u(r){var i,a=t.length,o=Es(t,Bs,Os).visitAfter(f);for(n=r,i=0;i<a;++i)e=t[i],o.visit(l)}function c(){if(t){var e,n,a=t.length;for(r=new Array(a),e=0;e<a;++e)n=t[e],r[n.index]=+i(n,e,t)}}function f(t){var e,n,i,a,o,s=0,u=0;if(t.length){for(i=a=o=0;o<4;++o)(e=t[o])&&(n=Math.abs(e.value))&&(s+=e.value,u+=n,i+=n*e.x,a+=n*e.y);t.x=i/u,t.y=a/u}else{(e=t).x=e.data.x,e.y=e.data.y;do{s+=r[e.data.index]}while(e=e.next)}t.value=s}function l(t,i,u,c){if(!t.value)return!0;var f=t.x-e.x,l=t.y-e.y,h=c-i,d=f*f+l*l;if(h*h/s<d)return d<o&&(0===f&&(d+=(f=ms())*f),0===l&&(d+=(l=ms())*l),d<a&&(d=Math.sqrt(a*d)),e.vx+=f*t.value*n/d,e.vy+=l*t.value*n/d),!0;if(!(t.length||d>=o)){(t.data!==e||t.next)&&(0===f&&(d+=(f=ms())*f),0===l&&(d+=(l=ms())*l),d<a&&(d=Math.sqrt(a*d)));do{t.data!==e&&(h=r[t.data.index]*n/d,e.vx+=f*h,e.vy+=l*h)}while(t=t.next)}}return u.initialize=function(e){t=e,c()},u.strength=function(t){return arguments.length?(i="function"==typeof t?t:vs(+t),c(),u):i},u.distanceMin=function(t){return arguments.length?(a=t*t,u):Math.sqrt(a)},u.distanceMax=function(t){return arguments.length?(o=t*t,u):Math.sqrt(o)},u.theta=function(t){return arguments.length?(s=t*t,u):Math.sqrt(s)},u},qs=function(t,e,n){var r,i,a,o=vs(.1);function s(t){for(var o=0,s=r.length;o<s;++o){var u=r[o],c=u.x-e||1e-6,f=u.y-n||1e-6,l=Math.sqrt(c*c+f*f),h=(a[o]-l)*i[o]*t/l;u.vx+=c*h,u.vy+=f*h}}function u(){if(r){var e,n=r.length;for(i=new Array(n),a=new Array(n),e=0;e<n;++e)a[e]=+t(r[e],e,r),i[e]=isNaN(a[e])?0:+o(r[e],e,r)}}return"function"!=typeof t&&(t=vs(+t)),null==e&&(e=0),null==n&&(n=0),s.initialize=function(t){r=t,u()},s.strength=function(t){return arguments.length?(o="function"==typeof t?t:vs(+t),u(),s):o},s.radius=function(e){return arguments.length?(t="function"==typeof e?e:vs(+e),u(),s):t},s.x=function(t){return arguments.length?(e=+t,s):e},s.y=function(t){return arguments.length?(n=+t,s):n},s},js=function(t){var e,n,r,i=vs(.1);function a(t){for(var i,a=0,o=e.length;a<o;++a)(i=e[a]).vx+=(r[a]-i.x)*n[a]*t}function o(){if(e){var a,o=e.length;for(n=new Array(o),r=new Array(o),a=0;a<o;++a)n[a]=isNaN(r[a]=+t(e[a],a,e))?0:+i(e[a],a,e)}}return"function"!=typeof t&&(t=vs(null==t?0:+t)),a.initialize=function(t){e=t,o()},a.strength=function(t){return arguments.length?(i="function"==typeof t?t:vs(+t),o(),a):i},a.x=function(e){return arguments.length?(t="function"==typeof e?e:vs(+e),o(),a):t},a},Us=function(t){var e,n,r,i=vs(.1);function a(t){for(var i,a=0,o=e.length;a<o;++a)(i=e[a]).vy+=(r[a]-i.y)*n[a]*t}function o(){if(e){var a,o=e.length;for(n=new Array(o),r=new Array(o),a=0;a<o;++a)n[a]=isNaN(r[a]=+t(e[a],a,e))?0:+i(e[a],a,e)}}return"function"!=typeof t&&(t=vs(null==t?0:+t)),a.initialize=function(t){e=t,o()},a.strength=function(t){return arguments.length?(i="function"==typeof t?t:vs(+t),o(),a):i},a.y=function(e){return arguments.length?(t="function"==typeof e?e:vs(+e),o(),a):t},a},zs=function(t,e){if((n=(t=e?t.toExponential(e-1):t.toExponential()).indexOf("e"))<0)return null;var n,r=t.slice(0,n);return[r.length>1?r[0]+r.slice(2):r,+t.slice(n+1)]},Ys=function(t){return(t=zs(Math.abs(t)))?t[1]:NaN},Vs=/^(?:(.)?([<>=^]))?([+\-( ])?([$#])?(0)?(\d+)?(,)?(\.\d+)?(~)?([a-z%])?$/i;function Hs(t){if(!(e=Vs.exec(t)))throw new Error("invalid format: "+t);var e;return new Gs({fill:e[1],align:e[2],sign:e[3],symbol:e[4],zero:e[5],width:e[6],comma:e[7],precision:e[8]&&e[8].slice(1),trim:e[9],type:e[10]})}function Gs(t){this.fill=void 0===t.fill?" ":t.fill+"",this.align=void 0===t.align?">":t.align+"",this.sign=void 0===t.sign?"-":t.sign+"",this.symbol=void 0===t.symbol?"":t.symbol+"",this.zero=!!t.zero,this.width=void 0===t.width?void 0:+t.width,this.comma=!!t.comma,this.precision=void 0===t.precision?void 0:+t.precision,this.trim=!!t.trim,this.type=void 0===t.type?"":t.type+""}Hs.prototype=Gs.prototype,Gs.prototype.toString=function(){return this.fill+this.align+this.sign+this.symbol+(this.zero?"0":"")+(void 0===this.width?"":Math.max(1,0|this.width))+(this.comma?",":"")+(void 0===this.precision?"":"."+Math.max(0,0|this.precision))+(this.trim?"~":"")+this.type};var $s,Ws,Ks,Xs,Zs=function(t,e){var n=zs(t,e);if(!n)return t+"";var r=n[0],i=n[1];return i<0?"0."+new Array(-i).join("0")+r:r.length>i+1?r.slice(0,i+1)+"."+r.slice(i+1):r+new Array(i-r.length+2).join("0")},Js={"%":function(t,e){return(100*t).toFixed(e)},b:function(t){return Math.round(t).toString(2)},c:function(t){return t+""},d:function(t){return Math.round(t).toString(10)},e:function(t,e){return t.toExponential(e)},f:function(t,e){return t.toFixed(e)},g:function(t,e){return t.toPrecision(e)},o:function(t){return Math.round(t).toString(8)},p:function(t,e){return Zs(100*t,e)},r:Zs,s:function(t,e){var n=zs(t,e);if(!n)return t+"";var r=n[0],i=n[1],a=i-($s=3*Math.max(-8,Math.min(8,Math.floor(i/3))))+1,o=r.length;return a===o?r:a>o?r+new Array(a-o+1).join("0"):a>0?r.slice(0,a)+"."+r.slice(a):"0."+new Array(1-a).join("0")+zs(t,Math.max(0,e+a-1))[0]},X:function(t){return Math.round(t).toString(16).toUpperCase()},x:function(t){return Math.round(t).toString(16)}},Qs=function(t){return t},tu=Array.prototype.map,eu=["y","z","a","f","p","n","µ","m","","k","M","G","T","P","E","Z","Y"],nu=function(t){var e,n,r=void 0===t.grouping||void 0===t.thousands?Qs:(e=tu.call(t.grouping,Number),n=t.thousands+"",function(t,r){for(var i=t.length,a=[],o=0,s=e[0],u=0;i>0&&s>0&&(u+s+1>r&&(s=Math.max(1,r-u)),a.push(t.substring(i-=s,i+s)),!((u+=s+1)>r));)s=e[o=(o+1)%e.length];return a.reverse().join(n)}),i=void 0===t.currency?"":t.currency[0]+"",a=void 0===t.currency?"":t.currency[1]+"",o=void 0===t.decimal?".":t.decimal+"",s=void 0===t.numerals?Qs:function(t){return function(e){return e.replace(/[0-9]/g,(function(e){return t[+e]}))}}(tu.call(t.numerals,String)),u=void 0===t.percent?"%":t.percent+"",c=void 0===t.minus?"-":t.minus+"",f=void 0===t.nan?"NaN":t.nan+"";function l(t){var e=(t=Hs(t)).fill,n=t.align,l=t.sign,h=t.symbol,d=t.zero,p=t.width,g=t.comma,y=t.precision,b=t.trim,v=t.type;"n"===v?(g=!0,v="g"):Js[v]||(void 0===y&&(y=12),b=!0,v="g"),(d||"0"===e&&"="===n)&&(d=!0,e="0",n="=");var m="$"===h?i:"#"===h&&/[boxX]/.test(v)?"0"+v.toLowerCase():"",_="$"===h?a:/[%p]/.test(v)?u:"",w=Js[v],x=/[defgprs%]/.test(v);function k(t){var i,a,u,h=m,k=_;if("c"===v)k=w(t)+k,t="";else{var E=(t=+t)<0;if(t=isNaN(t)?f:w(Math.abs(t),y),b&&(t=function(t){t:for(var e,n=t.length,r=1,i=-1;r<n;++r)switch(t[r]){case".":i=e=r;break;case"0":0===i&&(i=r),e=r;break;default:if(!+t[r])break t;i>0&&(i=0)}return i>0?t.slice(0,i)+t.slice(e+1):t}(t)),E&&0==+t&&(E=!1),h=(E?"("===l?l:c:"-"===l||"("===l?"":l)+h,k=("s"===v?eu[8+$s/3]:"")+k+(E&&"("===l?")":""),x)for(i=-1,a=t.length;++i<a;)if(48>(u=t.charCodeAt(i))||u>57){k=(46===u?o+t.slice(i+1):t.slice(i))+k,t=t.slice(0,i);break}}g&&!d&&(t=r(t,1/0));var A=h.length+t.length+k.length,S=A<p?new Array(p-A+1).join(e):"";switch(g&&d&&(t=r(S+t,S.length?p-k.length:1/0),S=""),n){case"<":t=h+t+k+S;break;case"=":t=h+S+t+k;break;case"^":t=S.slice(0,A=S.length>>1)+h+t+k+S.slice(A);break;default:t=S+h+t+k}return s(t)}return y=void 0===y?6:/[gprs]/.test(v)?Math.max(1,Math.min(21,y)):Math.max(0,Math.min(20,y)),k.toString=function(){return t+""},k}return{format:l,formatPrefix:function(t,e){var n=l(((t=Hs(t)).type="f",t)),r=3*Math.max(-8,Math.min(8,Math.floor(Ys(e)/3))),i=Math.pow(10,-r),a=eu[8+r/3];return function(t){return n(i*t)+a}}}};function ru(t){return Ws=nu(t),Ks=Ws.format,Xs=Ws.formatPrefix,Ws}ru({decimal:".",thousands:",",grouping:[3],currency:["$",""],minus:"-"});var iu=function(t){return Math.max(0,-Ys(Math.abs(t)))},au=function(t,e){return Math.max(0,3*Math.max(-8,Math.min(8,Math.floor(Ys(e)/3)))-Ys(Math.abs(t)))},ou=function(t,e){return t=Math.abs(t),e=Math.abs(e)-t,Math.max(0,Ys(e)-Ys(t))+1},su=function(){return new uu};function uu(){this.reset()}uu.prototype={constructor:uu,reset:function(){this.s=this.t=0},add:function(t){fu(cu,t,this.t),fu(this,cu.s,this.s),this.s?this.t+=cu.t:this.s=cu.t},valueOf:function(){return this.s}};var cu=new uu;function fu(t,e,n){var r=t.s=e+n,i=r-e,a=r-i;t.t=e-a+(n-i)}var lu=Math.PI,hu=lu/2,du=lu/4,pu=2*lu,gu=180/lu,yu=lu/180,bu=Math.abs,vu=Math.atan,mu=Math.atan2,_u=Math.cos,wu=Math.ceil,xu=Math.exp,ku=(Math.floor,Math.log),Eu=Math.pow,Au=Math.sin,Su=Math.sign||function(t){return t>0?1:t<0?-1:0},Mu=Math.sqrt,Tu=Math.tan;function Du(t){return t>1?0:t<-1?lu:Math.acos(t)}function Cu(t){return t>1?hu:t<-1?-hu:Math.asin(t)}function Nu(t){return(t=Au(t/2))*t}function Iu(){}function Lu(t,e){t&&Ou.hasOwnProperty(t.type)&&Ou[t.type](t,e)}var Bu={Feature:function(t,e){Lu(t.geometry,e)},FeatureCollection:function(t,e){for(var n=t.features,r=-1,i=n.length;++r<i;)Lu(n[r].geometry,e)}},Ou={Sphere:function(t,e){e.sphere()},Point:function(t,e){t=t.coordinates,e.point(t[0],t[1],t[2])},MultiPoint:function(t,e){for(var n=t.coordinates,r=-1,i=n.length;++r<i;)t=n[r],e.point(t[0],t[1],t[2])},LineString:function(t,e){Ru(t.coordinates,e,0)},MultiLineString:function(t,e){for(var n=t.coordinates,r=-1,i=n.length;++r<i;)Ru(n[r],e,0)},Polygon:function(t,e){Pu(t.coordinates,e)},MultiPolygon:function(t,e){for(var n=t.coordinates,r=-1,i=n.length;++r<i;)Pu(n[r],e)},GeometryCollection:function(t,e){for(var n=t.geometries,r=-1,i=n.length;++r<i;)Lu(n[r],e)}};function Ru(t,e,n){var r,i=-1,a=t.length-n;for(e.lineStart();++i<a;)r=t[i],e.point(r[0],r[1],r[2]);e.lineEnd()}function Pu(t,e){var n=-1,r=t.length;for(e.polygonStart();++n<r;)Ru(t[n],e,1);e.polygonEnd()}var Fu,qu,ju,Uu,zu,Yu=function(t,e){t&&Bu.hasOwnProperty(t.type)?Bu[t.type](t,e):Lu(t,e)},Vu=su(),Hu=su(),Gu={point:Iu,lineStart:Iu,lineEnd:Iu,polygonStart:function(){Vu.reset(),Gu.lineStart=$u,Gu.lineEnd=Wu},polygonEnd:function(){var t=+Vu;Hu.add(t<0?pu+t:t),this.lineStart=this.lineEnd=this.point=Iu},sphere:function(){Hu.add(pu)}};function $u(){Gu.point=Ku}function Wu(){Xu(Fu,qu)}function Ku(t,e){Gu.point=Xu,Fu=t,qu=e,ju=t*=yu,Uu=_u(e=(e*=yu)/2+du),zu=Au(e)}function Xu(t,e){var n=(t*=yu)-ju,r=n>=0?1:-1,i=r*n,a=_u(e=(e*=yu)/2+du),o=Au(e),s=zu*o,u=Uu*a+s*_u(i),c=s*r*Au(i);Vu.add(mu(c,u)),ju=t,Uu=a,zu=o}var Zu=function(t){return Hu.reset(),Yu(t,Gu),2*Hu};function Ju(t){return[mu(t[1],t[0]),Cu(t[2])]}function Qu(t){var e=t[0],n=t[1],r=_u(n);return[r*_u(e),r*Au(e),Au(n)]}function tc(t,e){return t[0]*e[0]+t[1]*e[1]+t[2]*e[2]}function ec(t,e){return[t[1]*e[2]-t[2]*e[1],t[2]*e[0]-t[0]*e[2],t[0]*e[1]-t[1]*e[0]]}function nc(t,e){t[0]+=e[0],t[1]+=e[1],t[2]+=e[2]}function rc(t,e){return[t[0]*e,t[1]*e,t[2]*e]}function ic(t){var e=Mu(t[0]*t[0]+t[1]*t[1]+t[2]*t[2]);t[0]/=e,t[1]/=e,t[2]/=e}var ac,oc,sc,uc,cc,fc,lc,hc,dc,pc,gc=su(),yc={point:bc,lineStart:mc,lineEnd:_c,polygonStart:function(){yc.point=wc,yc.lineStart=xc,yc.lineEnd=kc,gc.reset(),Gu.polygonStart()},polygonEnd:function(){Gu.polygonEnd(),yc.point=bc,yc.lineStart=mc,yc.lineEnd=_c,Vu<0?(ac=-(sc=180),oc=-(uc=90)):gc>1e-6?uc=90:gc<-1e-6&&(oc=-90),pc[0]=ac,pc[1]=sc},sphere:function(){ac=-(sc=180),oc=-(uc=90)}};function bc(t,e){dc.push(pc=[ac=t,sc=t]),e<oc&&(oc=e),e>uc&&(uc=e)}function vc(t,e){var n=Qu([t*yu,e*yu]);if(hc){var r=ec(hc,n),i=ec([r[1],-r[0],0],r);ic(i),i=Ju(i);var a,o=t-cc,s=o>0?1:-1,u=i[0]*gu*s,c=bu(o)>180;c^(s*cc<u&&u<s*t)?(a=i[1]*gu)>uc&&(uc=a):c^(s*cc<(u=(u+360)%360-180)&&u<s*t)?(a=-i[1]*gu)<oc&&(oc=a):(e<oc&&(oc=e),e>uc&&(uc=e)),c?t<cc?Ec(ac,t)>Ec(ac,sc)&&(sc=t):Ec(t,sc)>Ec(ac,sc)&&(ac=t):sc>=ac?(t<ac&&(ac=t),t>sc&&(sc=t)):t>cc?Ec(ac,t)>Ec(ac,sc)&&(sc=t):Ec(t,sc)>Ec(ac,sc)&&(ac=t)}else dc.push(pc=[ac=t,sc=t]);e<oc&&(oc=e),e>uc&&(uc=e),hc=n,cc=t}function mc(){yc.point=vc}function _c(){pc[0]=ac,pc[1]=sc,yc.point=bc,hc=null}function wc(t,e){if(hc){var n=t-cc;gc.add(bu(n)>180?n+(n>0?360:-360):n)}else fc=t,lc=e;Gu.point(t,e),vc(t,e)}function xc(){Gu.lineStart()}function kc(){wc(fc,lc),Gu.lineEnd(),bu(gc)>1e-6&&(ac=-(sc=180)),pc[0]=ac,pc[1]=sc,hc=null}function Ec(t,e){return(e-=t)<0?e+360:e}function Ac(t,e){return t[0]-e[0]}function Sc(t,e){return t[0]<=t[1]?t[0]<=e&&e<=t[1]:e<t[0]||t[1]<e}var Mc,Tc,Dc,Cc,Nc,Ic,Lc,Bc,Oc,Rc,Pc,Fc,qc,jc,Uc,zc,Yc=function(t){var e,n,r,i,a,o,s;if(uc=sc=-(ac=oc=1/0),dc=[],Yu(t,yc),n=dc.length){for(dc.sort(Ac),e=1,a=[r=dc[0]];e<n;++e)Sc(r,(i=dc[e])[0])||Sc(r,i[1])?(Ec(r[0],i[1])>Ec(r[0],r[1])&&(r[1]=i[1]),Ec(i[0],r[1])>Ec(r[0],r[1])&&(r[0]=i[0])):a.push(r=i);for(o=-1/0,e=0,r=a[n=a.length-1];e<=n;r=i,++e)i=a[e],(s=Ec(r[1],i[0]))>o&&(o=s,ac=i[0],sc=r[1])}return dc=pc=null,ac===1/0||oc===1/0?[[NaN,NaN],[NaN,NaN]]:[[ac,oc],[sc,uc]]},Vc={sphere:Iu,point:Hc,lineStart:$c,lineEnd:Xc,polygonStart:function(){Vc.lineStart=Zc,Vc.lineEnd=Jc},polygonEnd:function(){Vc.lineStart=$c,Vc.lineEnd=Xc}};function Hc(t,e){t*=yu;var n=_u(e*=yu);Gc(n*_u(t),n*Au(t),Au(e))}function Gc(t,e,n){++Mc,Dc+=(t-Dc)/Mc,Cc+=(e-Cc)/Mc,Nc+=(n-Nc)/Mc}function $c(){Vc.point=Wc}function Wc(t,e){t*=yu;var n=_u(e*=yu);jc=n*_u(t),Uc=n*Au(t),zc=Au(e),Vc.point=Kc,Gc(jc,Uc,zc)}function Kc(t,e){t*=yu;var n=_u(e*=yu),r=n*_u(t),i=n*Au(t),a=Au(e),o=mu(Mu((o=Uc*a-zc*i)*o+(o=zc*r-jc*a)*o+(o=jc*i-Uc*r)*o),jc*r+Uc*i+zc*a);Tc+=o,Ic+=o*(jc+(jc=r)),Lc+=o*(Uc+(Uc=i)),Bc+=o*(zc+(zc=a)),Gc(jc,Uc,zc)}function Xc(){Vc.point=Hc}function Zc(){Vc.point=Qc}function Jc(){tf(Fc,qc),Vc.point=Hc}function Qc(t,e){Fc=t,qc=e,t*=yu,e*=yu,Vc.point=tf;var n=_u(e);jc=n*_u(t),Uc=n*Au(t),zc=Au(e),Gc(jc,Uc,zc)}function tf(t,e){t*=yu;var n=_u(e*=yu),r=n*_u(t),i=n*Au(t),a=Au(e),o=Uc*a-zc*i,s=zc*r-jc*a,u=jc*i-Uc*r,c=Mu(o*o+s*s+u*u),f=Cu(c),l=c&&-f/c;Oc+=l*o,Rc+=l*s,Pc+=l*u,Tc+=f,Ic+=f*(jc+(jc=r)),Lc+=f*(Uc+(Uc=i)),Bc+=f*(zc+(zc=a)),Gc(jc,Uc,zc)}var ef=function(t){Mc=Tc=Dc=Cc=Nc=Ic=Lc=Bc=Oc=Rc=Pc=0,Yu(t,Vc);var e=Oc,n=Rc,r=Pc,i=e*e+n*n+r*r;return i<1e-12&&(e=Ic,n=Lc,r=Bc,Tc<1e-6&&(e=Dc,n=Cc,r=Nc),(i=e*e+n*n+r*r)<1e-12)?[NaN,NaN]:[mu(n,e)*gu,Cu(r/Mu(i))*gu]},nf=function(t){return function(){return t}},rf=function(t,e){function n(n,r){return n=t(n,r),e(n[0],n[1])}return t.invert&&e.invert&&(n.invert=function(n,r){return(n=e.invert(n,r))&&t.invert(n[0],n[1])}),n};function af(t,e){return[bu(t)>lu?t+Math.round(-t/pu)*pu:t,e]}function of(t,e,n){return(t%=pu)?e||n?rf(uf(t),cf(e,n)):uf(t):e||n?cf(e,n):af}function sf(t){return function(e,n){return[(e+=t)>lu?e-pu:e<-lu?e+pu:e,n]}}function uf(t){var e=sf(t);return e.invert=sf(-t),e}function cf(t,e){var n=_u(t),r=Au(t),i=_u(e),a=Au(e);function o(t,e){var o=_u(e),s=_u(t)*o,u=Au(t)*o,c=Au(e),f=c*n+s*r;return[mu(u*i-f*a,s*n-c*r),Cu(f*i+u*a)]}return o.invert=function(t,e){var o=_u(e),s=_u(t)*o,u=Au(t)*o,c=Au(e),f=c*i-u*a;return[mu(u*i+c*a,s*n+f*r),Cu(f*n-s*r)]},o}af.invert=af;var ff=function(t){function e(e){return(e=t(e[0]*yu,e[1]*yu))[0]*=gu,e[1]*=gu,e}return t=of(t[0]*yu,t[1]*yu,t.length>2?t[2]*yu:0),e.invert=function(e){return(e=t.invert(e[0]*yu,e[1]*yu))[0]*=gu,e[1]*=gu,e},e};function lf(t,e,n,r,i,a){if(n){var o=_u(e),s=Au(e),u=r*n;null==i?(i=e+r*pu,a=e-u/2):(i=hf(o,i),a=hf(o,a),(r>0?i<a:i>a)&&(i+=r*pu));for(var c,f=i;r>0?f>a:f<a;f-=u)c=Ju([o,-s*_u(f),-s*Au(f)]),t.point(c[0],c[1])}}function hf(t,e){(e=Qu(e))[0]-=t,ic(e);var n=Du(-e[1]);return((-e[2]<0?-n:n)+pu-1e-6)%pu}var df=function(){var t,e,n=nf([0,0]),r=nf(90),i=nf(6),a={point:function(n,r){t.push(n=e(n,r)),n[0]*=gu,n[1]*=gu}};function o(){var o=n.apply(this,arguments),s=r.apply(this,arguments)*yu,u=i.apply(this,arguments)*yu;return t=[],e=of(-o[0]*yu,-o[1]*yu,0).invert,lf(a,s,u,1),o={type:"Polygon",coordinates:[t]},t=e=null,o}return o.center=function(t){return arguments.length?(n="function"==typeof t?t:nf([+t[0],+t[1]]),o):n},o.radius=function(t){return arguments.length?(r="function"==typeof t?t:nf(+t),o):r},o.precision=function(t){return arguments.length?(i="function"==typeof t?t:nf(+t),o):i},o},pf=function(){var t,e=[];return{point:function(e,n){t.push([e,n])},lineStart:function(){e.push(t=[])},lineEnd:Iu,rejoin:function(){e.length>1&&e.push(e.pop().concat(e.shift()))},result:function(){var n=e;return e=[],t=null,n}}},gf=function(t,e){return bu(t[0]-e[0])<1e-6&&bu(t[1]-e[1])<1e-6};function yf(t,e,n,r){this.x=t,this.z=e,this.o=n,this.e=r,this.v=!1,this.n=this.p=null}var bf=function(t,e,n,r,i){var a,o,s=[],u=[];if(t.forEach((function(t){if(!((e=t.length-1)<=0)){var e,n,r=t[0],o=t[e];if(gf(r,o)){for(i.lineStart(),a=0;a<e;++a)i.point((r=t[a])[0],r[1]);i.lineEnd()}else s.push(n=new yf(r,t,null,!0)),u.push(n.o=new yf(r,null,n,!1)),s.push(n=new yf(o,t,null,!1)),u.push(n.o=new yf(o,null,n,!0))}})),s.length){for(u.sort(e),vf(s),vf(u),a=0,o=u.length;a<o;++a)u[a].e=n=!n;for(var c,f,l=s[0];;){for(var h=l,d=!0;h.v;)if((h=h.n)===l)return;c=h.z,i.lineStart();do{if(h.v=h.o.v=!0,h.e){if(d)for(a=0,o=c.length;a<o;++a)i.point((f=c[a])[0],f[1]);else r(h.x,h.n.x,1,i);h=h.n}else{if(d)for(c=h.p.z,a=c.length-1;a>=0;--a)i.point((f=c[a])[0],f[1]);else r(h.x,h.p.x,-1,i);h=h.p}c=(h=h.o).z,d=!d}while(!h.v);i.lineEnd()}}};function vf(t){if(e=t.length){for(var e,n,r=0,i=t[0];++r<e;)i.n=n=t[r],n.p=i,i=n;i.n=n=t[0],n.p=i}}var mf=su();function _f(t){return bu(t[0])<=lu?t[0]:Su(t[0])*((bu(t[0])+lu)%pu-lu)}var wf=function(t,e){var n=_f(e),r=e[1],i=Au(r),a=[Au(n),-_u(n),0],o=0,s=0;mf.reset(),1===i?r=hu+1e-6:-1===i&&(r=-hu-1e-6);for(var u=0,c=t.length;u<c;++u)if(l=(f=t[u]).length)for(var f,l,h=f[l-1],d=_f(h),p=h[1]/2+du,g=Au(p),y=_u(p),b=0;b<l;++b,d=m,g=w,y=x,h=v){var v=f[b],m=_f(v),_=v[1]/2+du,w=Au(_),x=_u(_),k=m-d,E=k>=0?1:-1,A=E*k,S=A>lu,M=g*w;if(mf.add(mu(M*E*Au(A),y*x+M*_u(A))),o+=S?k+E*pu:k,S^d>=n^m>=n){var T=ec(Qu(h),Qu(v));ic(T);var D=ec(a,T);ic(D);var C=(S^k>=0?-1:1)*Cu(D[2]);(r>C||r===C&&(T[0]||T[1]))&&(s+=S^k>=0?1:-1)}}return(o<-1e-6||o<1e-6&&mf<-1e-6)^1&s},xf=function(t,e,n,r){return function(i){var a,o,s,u=e(i),c=pf(),f=e(c),l=!1,h={point:d,lineStart:g,lineEnd:y,polygonStart:function(){h.point=b,h.lineStart=v,h.lineEnd=m,o=[],a=[]},polygonEnd:function(){h.point=d,h.lineStart=g,h.lineEnd=y,o=P(o);var t=wf(a,r);o.length?(l||(i.polygonStart(),l=!0),bf(o,Ef,t,n,i)):t&&(l||(i.polygonStart(),l=!0),i.lineStart(),n(null,null,1,i),i.lineEnd()),l&&(i.polygonEnd(),l=!1),o=a=null},sphere:function(){i.polygonStart(),i.lineStart(),n(null,null,1,i),i.lineEnd(),i.polygonEnd()}};function d(e,n){t(e,n)&&i.point(e,n)}function p(t,e){u.point(t,e)}function g(){h.point=p,u.lineStart()}function y(){h.point=d,u.lineEnd()}function b(t,e){s.push([t,e]),f.point(t,e)}function v(){f.lineStart(),s=[]}function m(){b(s[0][0],s[0][1]),f.lineEnd();var t,e,n,r,u=f.clean(),h=c.result(),d=h.length;if(s.pop(),a.push(s),s=null,d)if(1&u){if((e=(n=h[0]).length-1)>0){for(l||(i.polygonStart(),l=!0),i.lineStart(),t=0;t<e;++t)i.point((r=n[t])[0],r[1]);i.lineEnd()}}else d>1&&2&u&&h.push(h.pop().concat(h.shift())),o.push(h.filter(kf))}return h}};function kf(t){return t.length>1}function Ef(t,e){return((t=t.x)[0]<0?t[1]-hu-1e-6:hu-t[1])-((e=e.x)[0]<0?e[1]-hu-1e-6:hu-e[1])}var Af=xf((function(){return!0}),(function(t){var e,n=NaN,r=NaN,i=NaN;return{lineStart:function(){t.lineStart(),e=1},point:function(a,o){var s=a>0?lu:-lu,u=bu(a-n);bu(u-lu)<1e-6?(t.point(n,r=(r+o)/2>0?hu:-hu),t.point(i,r),t.lineEnd(),t.lineStart(),t.point(s,r),t.point(a,r),e=0):i!==s&&u>=lu&&(bu(n-i)<1e-6&&(n-=1e-6*i),bu(a-s)<1e-6&&(a-=1e-6*s),r=function(t,e,n,r){var i,a,o=Au(t-n);return bu(o)>1e-6?vu((Au(e)*(a=_u(r))*Au(n)-Au(r)*(i=_u(e))*Au(t))/(i*a*o)):(e+r)/2}(n,r,a,o),t.point(i,r),t.lineEnd(),t.lineStart(),t.point(s,r),e=0),t.point(n=a,r=o),i=s},lineEnd:function(){t.lineEnd(),n=r=NaN},clean:function(){return 2-e}}}),(function(t,e,n,r){var i;if(null==t)i=n*hu,r.point(-lu,i),r.point(0,i),r.point(lu,i),r.point(lu,0),r.point(lu,-i),r.point(0,-i),r.point(-lu,-i),r.point(-lu,0),r.point(-lu,i);else if(bu(t[0]-e[0])>1e-6){var a=t[0]<e[0]?lu:-lu;i=n*a/2,r.point(-a,i),r.point(0,i),r.point(a,i)}else r.point(e[0],e[1])}),[-lu,-hu]);var Sf=function(t){var e=_u(t),n=6*yu,r=e>0,i=bu(e)>1e-6;function a(t,n){return _u(t)*_u(n)>e}function o(t,n,r){var i=[1,0,0],a=ec(Qu(t),Qu(n)),o=tc(a,a),s=a[0],u=o-s*s;if(!u)return!r&&t;var c=e*o/u,f=-e*s/u,l=ec(i,a),h=rc(i,c);nc(h,rc(a,f));var d=l,p=tc(h,d),g=tc(d,d),y=p*p-g*(tc(h,h)-1);if(!(y<0)){var b=Mu(y),v=rc(d,(-p-b)/g);if(nc(v,h),v=Ju(v),!r)return v;var m,_=t[0],w=n[0],x=t[1],k=n[1];w<_&&(m=_,_=w,w=m);var E=w-_,A=bu(E-lu)<1e-6;if(!A&&k<x&&(m=x,x=k,k=m),A||E<1e-6?A?x+k>0^v[1]<(bu(v[0]-_)<1e-6?x:k):x<=v[1]&&v[1]<=k:E>lu^(_<=v[0]&&v[0]<=w)){var S=rc(d,(-p+b)/g);return nc(S,h),[v,Ju(S)]}}}function s(e,n){var i=r?t:lu-t,a=0;return e<-i?a|=1:e>i&&(a|=2),n<-i?a|=4:n>i&&(a|=8),a}return xf(a,(function(t){var e,n,u,c,f;return{lineStart:function(){c=u=!1,f=1},point:function(l,h){var d,p=[l,h],g=a(l,h),y=r?g?0:s(l,h):g?s(l+(l<0?lu:-lu),h):0;if(!e&&(c=u=g)&&t.lineStart(),g!==u&&(!(d=o(e,p))||gf(e,d)||gf(p,d))&&(p[0]+=1e-6,p[1]+=1e-6,g=a(p[0],p[1])),g!==u)f=0,g?(t.lineStart(),d=o(p,e),t.point(d[0],d[1])):(d=o(e,p),t.point(d[0],d[1]),t.lineEnd()),e=d;else if(i&&e&&r^g){var b;y&n||!(b=o(p,e,!0))||(f=0,r?(t.lineStart(),t.point(b[0][0],b[0][1]),t.point(b[1][0],b[1][1]),t.lineEnd()):(t.point(b[1][0],b[1][1]),t.lineEnd(),t.lineStart(),t.point(b[0][0],b[0][1])))}!g||e&&gf(e,p)||t.point(p[0],p[1]),e=p,u=g,n=y},lineEnd:function(){u&&t.lineEnd(),e=null},clean:function(){return f|(c&&u)<<1}}}),(function(e,r,i,a){lf(a,t,n,i,e,r)}),r?[0,-t]:[-lu,t-lu])};function Mf(t,e,n,r){function i(i,a){return t<=i&&i<=n&&e<=a&&a<=r}function a(i,a,s,c){var f=0,l=0;if(null==i||(f=o(i,s))!==(l=o(a,s))||u(i,a)<0^s>0)do{c.point(0===f||3===f?t:n,f>1?r:e)}while((f=(f+s+4)%4)!==l);else c.point(a[0],a[1])}function o(r,i){return bu(r[0]-t)<1e-6?i>0?0:3:bu(r[0]-n)<1e-6?i>0?2:1:bu(r[1]-e)<1e-6?i>0?1:0:i>0?3:2}function s(t,e){return u(t.x,e.x)}function u(t,e){var n=o(t,1),r=o(e,1);return n!==r?n-r:0===n?e[1]-t[1]:1===n?t[0]-e[0]:2===n?t[1]-e[1]:e[0]-t[0]}return function(o){var u,c,f,l,h,d,p,g,y,b,v,m=o,_=pf(),w={point:x,lineStart:function(){w.point=k,c&&c.push(f=[]);b=!0,y=!1,p=g=NaN},lineEnd:function(){u&&(k(l,h),d&&y&&_.rejoin(),u.push(_.result()));w.point=x,y&&m.lineEnd()},polygonStart:function(){m=_,u=[],c=[],v=!0},polygonEnd:function(){var e=function(){for(var e=0,n=0,i=c.length;n<i;++n)for(var a,o,s=c[n],u=1,f=s.length,l=s[0],h=l[0],d=l[1];u<f;++u)a=h,o=d,l=s[u],h=l[0],d=l[1],o<=r?d>r&&(h-a)*(r-o)>(d-o)*(t-a)&&++e:d<=r&&(h-a)*(r-o)<(d-o)*(t-a)&&--e;return e}(),n=v&&e,i=(u=P(u)).length;(n||i)&&(o.polygonStart(),n&&(o.lineStart(),a(null,null,1,o),o.lineEnd()),i&&bf(u,s,e,a,o),o.polygonEnd());m=o,u=c=f=null}};function x(t,e){i(t,e)&&m.point(t,e)}function k(a,o){var s=i(a,o);if(c&&f.push([a,o]),b)l=a,h=o,d=s,b=!1,s&&(m.lineStart(),m.point(a,o));else if(s&&y)m.point(a,o);else{var u=[p=Math.max(-1e9,Math.min(1e9,p)),g=Math.max(-1e9,Math.min(1e9,g))],_=[a=Math.max(-1e9,Math.min(1e9,a)),o=Math.max(-1e9,Math.min(1e9,o))];!function(t,e,n,r,i,a){var o,s=t[0],u=t[1],c=0,f=1,l=e[0]-s,h=e[1]-u;if(o=n-s,l||!(o>0)){if(o/=l,l<0){if(o<c)return;o<f&&(f=o)}else if(l>0){if(o>f)return;o>c&&(c=o)}if(o=i-s,l||!(o<0)){if(o/=l,l<0){if(o>f)return;o>c&&(c=o)}else if(l>0){if(o<c)return;o<f&&(f=o)}if(o=r-u,h||!(o>0)){if(o/=h,h<0){if(o<c)return;o<f&&(f=o)}else if(h>0){if(o>f)return;o>c&&(c=o)}if(o=a-u,h||!(o<0)){if(o/=h,h<0){if(o>f)return;o>c&&(c=o)}else if(h>0){if(o<c)return;o<f&&(f=o)}return c>0&&(t[0]=s+c*l,t[1]=u+c*h),f<1&&(e[0]=s+f*l,e[1]=u+f*h),!0}}}}}(u,_,t,e,n,r)?s&&(m.lineStart(),m.point(a,o),v=!1):(y||(m.lineStart(),m.point(u[0],u[1])),m.point(_[0],_[1]),s||m.lineEnd(),v=!1)}p=a,g=o,y=s}return w}}var Tf,Df,Cf,Nf=function(){var t,e,n,r=0,i=0,a=960,o=500;return n={stream:function(n){return t&&e===n?t:t=Mf(r,i,a,o)(e=n)},extent:function(s){return arguments.length?(r=+s[0][0],i=+s[0][1],a=+s[1][0],o=+s[1][1],t=e=null,n):[[r,i],[a,o]]}}},If=su(),Lf={sphere:Iu,point:Iu,lineStart:function(){Lf.point=Of,Lf.lineEnd=Bf},lineEnd:Iu,polygonStart:Iu,polygonEnd:Iu};function Bf(){Lf.point=Lf.lineEnd=Iu}function Of(t,e){Tf=t*=yu,Df=Au(e*=yu),Cf=_u(e),Lf.point=Rf}function Rf(t,e){t*=yu;var n=Au(e*=yu),r=_u(e),i=bu(t-Tf),a=_u(i),o=r*Au(i),s=Cf*n-Df*r*a,u=Df*n+Cf*r*a;If.add(mu(Mu(o*o+s*s),u)),Tf=t,Df=n,Cf=r}var Pf=function(t){return If.reset(),Yu(t,Lf),+If},Ff=[null,null],qf={type:"LineString",coordinates:Ff},jf=function(t,e){return Ff[0]=t,Ff[1]=e,Pf(qf)},Uf={Feature:function(t,e){return Yf(t.geometry,e)},FeatureCollection:function(t,e){for(var n=t.features,r=-1,i=n.length;++r<i;)if(Yf(n[r].geometry,e))return!0;return!1}},zf={Sphere:function(){return!0},Point:function(t,e){return Vf(t.coordinates,e)},MultiPoint:function(t,e){for(var n=t.coordinates,r=-1,i=n.length;++r<i;)if(Vf(n[r],e))return!0;return!1},LineString:function(t,e){return Hf(t.coordinates,e)},MultiLineString:function(t,e){for(var n=t.coordinates,r=-1,i=n.length;++r<i;)if(Hf(n[r],e))return!0;return!1},Polygon:function(t,e){return Gf(t.coordinates,e)},MultiPolygon:function(t,e){for(var n=t.coordinates,r=-1,i=n.length;++r<i;)if(Gf(n[r],e))return!0;return!1},GeometryCollection:function(t,e){for(var n=t.geometries,r=-1,i=n.length;++r<i;)if(Yf(n[r],e))return!0;return!1}};function Yf(t,e){return!(!t||!zf.hasOwnProperty(t.type))&&zf[t.type](t,e)}function Vf(t,e){return 0===jf(t,e)}function Hf(t,e){for(var n,r,i,a=0,o=t.length;a<o;a++){if(0===(r=jf(t[a],e)))return!0;if(a>0&&(i=jf(t[a],t[a-1]))>0&&n<=i&&r<=i&&(n+r-i)*(1-Math.pow((n-r)/i,2))<1e-12*i)return!0;n=r}return!1}function Gf(t,e){return!!wf(t.map($f),Wf(e))}function $f(t){return(t=t.map(Wf)).pop(),t}function Wf(t){return[t[0]*yu,t[1]*yu]}var Kf=function(t,e){return(t&&Uf.hasOwnProperty(t.type)?Uf[t.type]:Yf)(t,e)};function Xf(t,e,n){var r=x(t,e-1e-6,n).concat(e);return function(t){return r.map((function(e){return[t,e]}))}}function Zf(t,e,n){var r=x(t,e-1e-6,n).concat(e);return function(t){return r.map((function(e){return[e,t]}))}}function Jf(){var t,e,n,r,i,a,o,s,u,c,f,l,h=10,d=h,p=90,g=360,y=2.5;function b(){return{type:"MultiLineString",coordinates:v()}}function v(){return x(wu(r/p)*p,n,p).map(f).concat(x(wu(s/g)*g,o,g).map(l)).concat(x(wu(e/h)*h,t,h).filter((function(t){return bu(t%p)>1e-6})).map(u)).concat(x(wu(a/d)*d,i,d).filter((function(t){return bu(t%g)>1e-6})).map(c))}return b.lines=function(){return v().map((function(t){return{type:"LineString",coordinates:t}}))},b.outline=function(){return{type:"Polygon",coordinates:[f(r).concat(l(o).slice(1),f(n).reverse().slice(1),l(s).reverse().slice(1))]}},b.extent=function(t){return arguments.length?b.extentMajor(t).extentMinor(t):b.extentMinor()},b.extentMajor=function(t){return arguments.length?(r=+t[0][0],n=+t[1][0],s=+t[0][1],o=+t[1][1],r>n&&(t=r,r=n,n=t),s>o&&(t=s,s=o,o=t),b.precision(y)):[[r,s],[n,o]]},b.extentMinor=function(n){return arguments.length?(e=+n[0][0],t=+n[1][0],a=+n[0][1],i=+n[1][1],e>t&&(n=e,e=t,t=n),a>i&&(n=a,a=i,i=n),b.precision(y)):[[e,a],[t,i]]},b.step=function(t){return arguments.length?b.stepMajor(t).stepMinor(t):b.stepMinor()},b.stepMajor=function(t){return arguments.length?(p=+t[0],g=+t[1],b):[p,g]},b.stepMinor=function(t){return arguments.length?(h=+t[0],d=+t[1],b):[h,d]},b.precision=function(h){return arguments.length?(y=+h,u=Xf(a,i,90),c=Zf(e,t,y),f=Xf(s,o,90),l=Zf(r,n,y),b):y},b.extentMajor([[-180,1e-6-90],[180,90-1e-6]]).extentMinor([[-180,-80-1e-6],[180,80+1e-6]])}function Qf(){return Jf()()}var tl,el,nl,rl,il=function(t,e){var n=t[0]*yu,r=t[1]*yu,i=e[0]*yu,a=e[1]*yu,o=_u(r),s=Au(r),u=_u(a),c=Au(a),f=o*_u(n),l=o*Au(n),h=u*_u(i),d=u*Au(i),p=2*Cu(Mu(Nu(a-r)+o*u*Nu(i-n))),g=Au(p),y=p?function(t){var e=Au(t*=p)/g,n=Au(p-t)/g,r=n*f+e*h,i=n*l+e*d,a=n*s+e*c;return[mu(i,r)*gu,mu(a,Mu(r*r+i*i))*gu]}:function(){return[n*gu,r*gu]};return y.distance=p,y},al=function(t){return t},ol=su(),sl=su(),ul={point:Iu,lineStart:Iu,lineEnd:Iu,polygonStart:function(){ul.lineStart=cl,ul.lineEnd=hl},polygonEnd:function(){ul.lineStart=ul.lineEnd=ul.point=Iu,ol.add(bu(sl)),sl.reset()},result:function(){var t=ol/2;return ol.reset(),t}};function cl(){ul.point=fl}function fl(t,e){ul.point=ll,tl=nl=t,el=rl=e}function ll(t,e){sl.add(rl*t-nl*e),nl=t,rl=e}function hl(){ll(tl,el)}var dl=ul,pl=1/0,gl=pl,yl=-pl,bl=yl;var vl,ml,_l,wl,xl={point:function(t,e){t<pl&&(pl=t);t>yl&&(yl=t);e<gl&&(gl=e);e>bl&&(bl=e)},lineStart:Iu,lineEnd:Iu,polygonStart:Iu,polygonEnd:Iu,result:function(){var t=[[pl,gl],[yl,bl]];return yl=bl=-(gl=pl=1/0),t}},kl=0,El=0,Al=0,Sl=0,Ml=0,Tl=0,Dl=0,Cl=0,Nl=0,Il={point:Ll,lineStart:Bl,lineEnd:Pl,polygonStart:function(){Il.lineStart=Fl,Il.lineEnd=ql},polygonEnd:function(){Il.point=Ll,Il.lineStart=Bl,Il.lineEnd=Pl},result:function(){var t=Nl?[Dl/Nl,Cl/Nl]:Tl?[Sl/Tl,Ml/Tl]:Al?[kl/Al,El/Al]:[NaN,NaN];return kl=El=Al=Sl=Ml=Tl=Dl=Cl=Nl=0,t}};function Ll(t,e){kl+=t,El+=e,++Al}function Bl(){Il.point=Ol}function Ol(t,e){Il.point=Rl,Ll(_l=t,wl=e)}function Rl(t,e){var n=t-_l,r=e-wl,i=Mu(n*n+r*r);Sl+=i*(_l+t)/2,Ml+=i*(wl+e)/2,Tl+=i,Ll(_l=t,wl=e)}function Pl(){Il.point=Ll}function Fl(){Il.point=jl}function ql(){Ul(vl,ml)}function jl(t,e){Il.point=Ul,Ll(vl=_l=t,ml=wl=e)}function Ul(t,e){var n=t-_l,r=e-wl,i=Mu(n*n+r*r);Sl+=i*(_l+t)/2,Ml+=i*(wl+e)/2,Tl+=i,Dl+=(i=wl*t-_l*e)*(_l+t),Cl+=i*(wl+e),Nl+=3*i,Ll(_l=t,wl=e)}var zl=Il;function Yl(t){this._context=t}Yl.prototype={_radius:4.5,pointRadius:function(t){return this._radius=t,this},polygonStart:function(){this._line=0},polygonEnd:function(){this._line=NaN},lineStart:function(){this._point=0},lineEnd:function(){0===this._line&&this._context.closePath(),this._point=NaN},point:function(t,e){switch(this._point){case 0:this._context.moveTo(t,e),this._point=1;break;case 1:this._context.lineTo(t,e);break;default:this._context.moveTo(t+this._radius,e),this._context.arc(t,e,this._radius,0,pu)}},result:Iu};var Vl,Hl,Gl,$l,Wl,Kl=su(),Xl={point:Iu,lineStart:function(){Xl.point=Zl},lineEnd:function(){Vl&&Jl(Hl,Gl),Xl.point=Iu},polygonStart:function(){Vl=!0},polygonEnd:function(){Vl=null},result:function(){var t=+Kl;return Kl.reset(),t}};function Zl(t,e){Xl.point=Jl,Hl=$l=t,Gl=Wl=e}function Jl(t,e){$l-=t,Wl-=e,Kl.add(Mu($l*$l+Wl*Wl)),$l=t,Wl=e}var Ql=Xl;function th(){this._string=[]}function eh(t){return"m0,"+t+"a"+t+","+t+" 0 1,1 0,"+-2*t+"a"+t+","+t+" 0 1,1 0,"+2*t+"z"}th.prototype={_radius:4.5,_circle:eh(4.5),pointRadius:function(t){return(t=+t)!==this._radius&&(this._radius=t,this._circle=null),this},polygonStart:function(){this._line=0},polygonEnd:function(){this._line=NaN},lineStart:function(){this._point=0},lineEnd:function(){0===this._line&&this._string.push("Z"),this._point=NaN},point:function(t,e){switch(this._point){case 0:this._string.push("M",t,",",e),this._point=1;break;case 1:this._string.push("L",t,",",e);break;default:null==this._circle&&(this._circle=eh(this._radius)),this._string.push("M",t,",",e,this._circle)}},result:function(){if(this._string.length){var t=this._string.join("");return this._string=[],t}return null}};var nh=function(t,e){var n,r,i=4.5;function a(t){return t&&("function"==typeof i&&r.pointRadius(+i.apply(this,arguments)),Yu(t,n(r))),r.result()}return a.area=function(t){return Yu(t,n(dl)),dl.result()},a.measure=function(t){return Yu(t,n(Ql)),Ql.result()},a.bounds=function(t){return Yu(t,n(xl)),xl.result()},a.centroid=function(t){return Yu(t,n(zl)),zl.result()},a.projection=function(e){return arguments.length?(n=null==e?(t=null,al):(t=e).stream,a):t},a.context=function(t){return arguments.length?(r=null==t?(e=null,new th):new Yl(e=t),"function"!=typeof i&&r.pointRadius(i),a):e},a.pointRadius=function(t){return arguments.length?(i="function"==typeof t?t:(r.pointRadius(+t),+t),a):i},a.projection(t).context(e)},rh=function(t){return{stream:ih(t)}};function ih(t){return function(e){var n=new ah;for(var r in t)n[r]=t[r];return n.stream=e,n}}function ah(){}function oh(t,e,n){var r=t.clipExtent&&t.clipExtent();return t.scale(150).translate([0,0]),null!=r&&t.clipExtent(null),Yu(n,t.stream(xl)),e(xl.result()),null!=r&&t.clipExtent(r),t}function sh(t,e,n){return oh(t,(function(n){var r=e[1][0]-e[0][0],i=e[1][1]-e[0][1],a=Math.min(r/(n[1][0]-n[0][0]),i/(n[1][1]-n[0][1])),o=+e[0][0]+(r-a*(n[1][0]+n[0][0]))/2,s=+e[0][1]+(i-a*(n[1][1]+n[0][1]))/2;t.scale(150*a).translate([o,s])}),n)}function uh(t,e,n){return sh(t,[[0,0],e],n)}function ch(t,e,n){return oh(t,(function(n){var r=+e,i=r/(n[1][0]-n[0][0]),a=(r-i*(n[1][0]+n[0][0]))/2,o=-i*n[0][1];t.scale(150*i).translate([a,o])}),n)}function fh(t,e,n){return oh(t,(function(n){var r=+e,i=r/(n[1][1]-n[0][1]),a=-i*n[0][0],o=(r-i*(n[1][1]+n[0][1]))/2;t.scale(150*i).translate([a,o])}),n)}ah.prototype={constructor:ah,point:function(t,e){this.stream.point(t,e)},sphere:function(){this.stream.sphere()},lineStart:function(){this.stream.lineStart()},lineEnd:function(){this.stream.lineEnd()},polygonStart:function(){this.stream.polygonStart()},polygonEnd:function(){this.stream.polygonEnd()}};var lh=_u(30*yu),hh=function(t,e){return+e?function(t,e){function n(r,i,a,o,s,u,c,f,l,h,d,p,g,y){var b=c-r,v=f-i,m=b*b+v*v;if(m>4*e&&g--){var _=o+h,w=s+d,x=u+p,k=Mu(_*_+w*w+x*x),E=Cu(x/=k),A=bu(bu(x)-1)<1e-6||bu(a-l)<1e-6?(a+l)/2:mu(w,_),S=t(A,E),M=S[0],T=S[1],D=M-r,C=T-i,N=v*D-b*C;(N*N/m>e||bu((b*D+v*C)/m-.5)>.3||o*h+s*d+u*p<lh)&&(n(r,i,a,o,s,u,M,T,A,_/=k,w/=k,x,g,y),y.point(M,T),n(M,T,A,_,w,x,c,f,l,h,d,p,g,y))}}return function(e){var r,i,a,o,s,u,c,f,l,h,d,p,g={point:y,lineStart:b,lineEnd:m,polygonStart:function(){e.polygonStart(),g.lineStart=_},polygonEnd:function(){e.polygonEnd(),g.lineStart=b}};function y(n,r){n=t(n,r),e.point(n[0],n[1])}function b(){f=NaN,g.point=v,e.lineStart()}function v(r,i){var a=Qu([r,i]),o=t(r,i);n(f,l,c,h,d,p,f=o[0],l=o[1],c=r,h=a[0],d=a[1],p=a[2],16,e),e.point(f,l)}function m(){g.point=y,e.lineEnd()}function _(){b(),g.point=w,g.lineEnd=x}function w(t,e){v(r=t,e),i=f,a=l,o=h,s=d,u=p,g.point=v}function x(){n(f,l,c,h,d,p,i,a,r,o,s,u,16,e),g.lineEnd=m,m()}return g}}(t,e):function(t){return ih({point:function(e,n){e=t(e,n),this.stream.point(e[0],e[1])}})}(t)};var dh=ih({point:function(t,e){this.stream.point(t*yu,e*yu)}});function ph(t,e,n){function r(r,i){return[e+t*r,n-t*i]}return r.invert=function(r,i){return[(r-e)/t,(n-i)/t]},r}function gh(t,e,n,r){var i=_u(r),a=Au(r),o=i*t,s=a*t,u=i/t,c=a/t,f=(a*n-i*e)/t,l=(a*e+i*n)/t;function h(t,r){return[o*t-s*r+e,n-s*t-o*r]}return h.invert=function(t,e){return[u*t-c*e+f,l-c*t-u*e]},h}function yh(t){return bh((function(){return t}))()}function bh(t){var e,n,r,i,a,o,s,u,c,f,l=150,h=480,d=250,p=0,g=0,y=0,b=0,v=0,m=0,_=null,w=Af,x=null,k=al,E=.5;function A(t){return u(t[0]*yu,t[1]*yu)}function S(t){return(t=u.invert(t[0],t[1]))&&[t[0]*gu,t[1]*gu]}function M(){var t=gh(l,0,0,m).apply(null,e(p,g)),r=(m?gh:ph)(l,h-t[0],d-t[1],m);return n=of(y,b,v),s=rf(e,r),u=rf(n,s),o=hh(s,E),T()}function T(){return c=f=null,A}return A.stream=function(t){return c&&f===t?c:c=dh(function(t){return ih({point:function(e,n){var r=t(e,n);return this.stream.point(r[0],r[1])}})}(n)(w(o(k(f=t)))))},A.preclip=function(t){return arguments.length?(w=t,_=void 0,T()):w},A.postclip=function(t){return arguments.length?(k=t,x=r=i=a=null,T()):k},A.clipAngle=function(t){return arguments.length?(w=+t?Sf(_=t*yu):(_=null,Af),T()):_*gu},A.clipExtent=function(t){return arguments.length?(k=null==t?(x=r=i=a=null,al):Mf(x=+t[0][0],r=+t[0][1],i=+t[1][0],a=+t[1][1]),T()):null==x?null:[[x,r],[i,a]]},A.scale=function(t){return arguments.length?(l=+t,M()):l},A.translate=function(t){return arguments.length?(h=+t[0],d=+t[1],M()):[h,d]},A.center=function(t){return arguments.length?(p=t[0]%360*yu,g=t[1]%360*yu,M()):[p*gu,g*gu]},A.rotate=function(t){return arguments.length?(y=t[0]%360*yu,b=t[1]%360*yu,v=t.length>2?t[2]%360*yu:0,M()):[y*gu,b*gu,v*gu]},A.angle=function(t){return arguments.length?(m=t%360*yu,M()):m*gu},A.precision=function(t){return arguments.length?(o=hh(s,E=t*t),T()):Mu(E)},A.fitExtent=function(t,e){return sh(A,t,e)},A.fitSize=function(t,e){return uh(A,t,e)},A.fitWidth=function(t,e){return ch(A,t,e)},A.fitHeight=function(t,e){return fh(A,t,e)},function(){return e=t.apply(this,arguments),A.invert=e.invert&&S,M()}}function vh(t){var e=0,n=lu/3,r=bh(t),i=r(e,n);return i.parallels=function(t){return arguments.length?r(e=t[0]*yu,n=t[1]*yu):[e*gu,n*gu]},i}function mh(t,e){var n=Au(t),r=(n+Au(e))/2;if(bu(r)<1e-6)return function(t){var e=_u(t);function n(t,n){return[t*e,Au(n)/e]}return n.invert=function(t,n){return[t/e,Cu(n*e)]},n}(t);var i=1+n*(2*r-n),a=Mu(i)/r;function o(t,e){var n=Mu(i-2*r*Au(e))/r;return[n*Au(t*=r),a-n*_u(t)]}return o.invert=function(t,e){var n=a-e;return[mu(t,bu(n))/r*Su(n),Cu((i-(t*t+n*n)*r*r)/(2*r))]},o}var _h=function(){return vh(mh).scale(155.424).center([0,33.6442])},wh=function(){return _h().parallels([29.5,45.5]).scale(1070).translate([480,250]).rotate([96,0]).center([-.6,38.7])};var xh=function(){var t,e,n,r,i,a,o=wh(),s=_h().rotate([154,0]).center([-2,58.5]).parallels([55,65]),u=_h().rotate([157,0]).center([-3,19.9]).parallels([8,18]),c={point:function(t,e){a=[t,e]}};function f(t){var e=t[0],o=t[1];return a=null,n.point(e,o),a||(r.point(e,o),a)||(i.point(e,o),a)}function l(){return t=e=null,f}return f.invert=function(t){var e=o.scale(),n=o.translate(),r=(t[0]-n[0])/e,i=(t[1]-n[1])/e;return(i>=.12&&i<.234&&r>=-.425&&r<-.214?s:i>=.166&&i<.234&&r>=-.214&&r<-.115?u:o).invert(t)},f.stream=function(n){return t&&e===n?t:(r=[o.stream(e=n),s.stream(n),u.stream(n)],i=r.length,t={point:function(t,e){for(var n=-1;++n<i;)r[n].point(t,e)},sphere:function(){for(var t=-1;++t<i;)r[t].sphere()},lineStart:function(){for(var t=-1;++t<i;)r[t].lineStart()},lineEnd:function(){for(var t=-1;++t<i;)r[t].lineEnd()},polygonStart:function(){for(var t=-1;++t<i;)r[t].polygonStart()},polygonEnd:function(){for(var t=-1;++t<i;)r[t].polygonEnd()}});var r,i},f.precision=function(t){return arguments.length?(o.precision(t),s.precision(t),u.precision(t),l()):o.precision()},f.scale=function(t){return arguments.length?(o.scale(t),s.scale(.35*t),u.scale(t),f.translate(o.translate())):o.scale()},f.translate=function(t){if(!arguments.length)return o.translate();var e=o.scale(),a=+t[0],f=+t[1];return n=o.translate(t).clipExtent([[a-.455*e,f-.238*e],[a+.455*e,f+.238*e]]).stream(c),r=s.translate([a-.307*e,f+.201*e]).clipExtent([[a-.425*e+1e-6,f+.12*e+1e-6],[a-.214*e-1e-6,f+.234*e-1e-6]]).stream(c),i=u.translate([a-.205*e,f+.212*e]).clipExtent([[a-.214*e+1e-6,f+.166*e+1e-6],[a-.115*e-1e-6,f+.234*e-1e-6]]).stream(c),l()},f.fitExtent=function(t,e){return sh(f,t,e)},f.fitSize=function(t,e){return uh(f,t,e)},f.fitWidth=function(t,e){return ch(f,t,e)},f.fitHeight=function(t,e){return fh(f,t,e)},f.scale(1070)};function kh(t){return function(e,n){var r=_u(e),i=_u(n),a=t(r*i);return[a*i*Au(e),a*Au(n)]}}function Eh(t){return function(e,n){var r=Mu(e*e+n*n),i=t(r),a=Au(i),o=_u(i);return[mu(e*a,r*o),Cu(r&&n*a/r)]}}var Ah=kh((function(t){return Mu(2/(1+t))}));Ah.invert=Eh((function(t){return 2*Cu(t/2)}));var Sh=function(){return yh(Ah).scale(124.75).clipAngle(179.999)},Mh=kh((function(t){return(t=Du(t))&&t/Au(t)}));Mh.invert=Eh((function(t){return t}));var Th=function(){return yh(Mh).scale(79.4188).clipAngle(179.999)};function Dh(t,e){return[t,ku(Tu((hu+e)/2))]}Dh.invert=function(t,e){return[t,2*vu(xu(e))-hu]};var Ch=function(){return Nh(Dh).scale(961/pu)};function Nh(t){var e,n,r,i=yh(t),a=i.center,o=i.scale,s=i.translate,u=i.clipExtent,c=null;function f(){var a=lu*o(),s=i(ff(i.rotate()).invert([0,0]));return u(null==c?[[s[0]-a,s[1]-a],[s[0]+a,s[1]+a]]:t===Dh?[[Math.max(s[0]-a,c),e],[Math.min(s[0]+a,n),r]]:[[c,Math.max(s[1]-a,e)],[n,Math.min(s[1]+a,r)]])}return i.scale=function(t){return arguments.length?(o(t),f()):o()},i.translate=function(t){return arguments.length?(s(t),f()):s()},i.center=function(t){return arguments.length?(a(t),f()):a()},i.clipExtent=function(t){return arguments.length?(null==t?c=e=n=r=null:(c=+t[0][0],e=+t[0][1],n=+t[1][0],r=+t[1][1]),f()):null==c?null:[[c,e],[n,r]]},f()}function Ih(t){return Tu((hu+t)/2)}function Lh(t,e){var n=_u(t),r=t===e?Au(t):ku(n/_u(e))/ku(Ih(e)/Ih(t)),i=n*Eu(Ih(t),r)/r;if(!r)return Dh;function a(t,e){i>0?e<1e-6-hu&&(e=1e-6-hu):e>hu-1e-6&&(e=hu-1e-6);var n=i/Eu(Ih(e),r);return[n*Au(r*t),i-n*_u(r*t)]}return a.invert=function(t,e){var n=i-e,a=Su(r)*Mu(t*t+n*n);return[mu(t,bu(n))/r*Su(n),2*vu(Eu(i/a,1/r))-hu]},a}var Bh=function(){return vh(Lh).scale(109.5).parallels([30,30])};function Oh(t,e){return[t,e]}Oh.invert=Oh;var Rh=function(){return yh(Oh).scale(152.63)};function Ph(t,e){var n=_u(t),r=t===e?Au(t):(n-_u(e))/(e-t),i=n/r+t;if(bu(r)<1e-6)return Oh;function a(t,e){var n=i-e,a=r*t;return[n*Au(a),i-n*_u(a)]}return a.invert=function(t,e){var n=i-e;return[mu(t,bu(n))/r*Su(n),i-Su(r)*Mu(t*t+n*n)]},a}var Fh=function(){return vh(Ph).scale(131.154).center([0,13.9389])},qh=1.340264,jh=-.081106,Uh=893e-6,zh=.003796,Yh=Mu(3)/2;function Vh(t,e){var n=Cu(Yh*Au(e)),r=n*n,i=r*r*r;return[t*_u(n)/(Yh*(qh+3*jh*r+i*(7*Uh+9*zh*r))),n*(qh+jh*r+i*(Uh+zh*r))]}Vh.invert=function(t,e){for(var n,r=e,i=r*r,a=i*i*i,o=0;o<12&&(a=(i=(r-=n=(r*(qh+jh*i+a*(Uh+zh*i))-e)/(qh+3*jh*i+a*(7*Uh+9*zh*i)))*r)*i*i,!(bu(n)<1e-12));++o);return[Yh*t*(qh+3*jh*i+a*(7*Uh+9*zh*i))/_u(r),Cu(Au(r)/Yh)]};var Hh=function(){return yh(Vh).scale(177.158)};function Gh(t,e){var n=_u(e),r=_u(t)*n;return[n*Au(t)/r,Au(e)/r]}Gh.invert=Eh(vu);var $h=function(){return yh(Gh).scale(144.049).clipAngle(60)};function Wh(t,e,n,r){return 1===t&&1===e&&0===n&&0===r?al:ih({point:function(i,a){this.stream.point(i*t+n,a*e+r)}})}var Kh=function(){var t,e,n,r,i,a,o=1,s=0,u=0,c=1,f=1,l=al,h=null,d=al;function p(){return r=i=null,a}return a={stream:function(t){return r&&i===t?r:r=l(d(i=t))},postclip:function(r){return arguments.length?(d=r,h=t=e=n=null,p()):d},clipExtent:function(r){return arguments.length?(d=null==r?(h=t=e=n=null,al):Mf(h=+r[0][0],t=+r[0][1],e=+r[1][0],n=+r[1][1]),p()):null==h?null:[[h,t],[e,n]]},scale:function(t){return arguments.length?(l=Wh((o=+t)*c,o*f,s,u),p()):o},translate:function(t){return arguments.length?(l=Wh(o*c,o*f,s=+t[0],u=+t[1]),p()):[s,u]},reflectX:function(t){return arguments.length?(l=Wh(o*(c=t?-1:1),o*f,s,u),p()):c<0},reflectY:function(t){return arguments.length?(l=Wh(o*c,o*(f=t?-1:1),s,u),p()):f<0},fitExtent:function(t,e){return sh(a,t,e)},fitSize:function(t,e){return uh(a,t,e)},fitWidth:function(t,e){return ch(a,t,e)},fitHeight:function(t,e){return fh(a,t,e)}}};function Xh(t,e){var n=e*e,r=n*n;return[t*(.8707-.131979*n+r*(r*(.003971*n-.001529*r)-.013791)),e*(1.007226+n*(.015085+r*(.028874*n-.044475-.005916*r)))]}Xh.invert=function(t,e){var n,r=e,i=25;do{var a=r*r,o=a*a;r-=n=(r*(1.007226+a*(.015085+o*(.028874*a-.044475-.005916*o)))-e)/(1.007226+a*(.045255+o*(.259866*a-.311325-.005916*11*o)))}while(bu(n)>1e-6&&--i>0);return[t/(.8707+(a=r*r)*(a*(a*a*a*(.003971-.001529*a)-.013791)-.131979)),r]};var Zh=function(){return yh(Xh).scale(175.295)};function Jh(t,e){return[_u(e)*Au(t),Au(e)]}Jh.invert=Eh(Cu);var Qh=function(){return yh(Jh).scale(249.5).clipAngle(90+1e-6)};function td(t,e){var n=_u(e),r=1+_u(t)*n;return[n*Au(t)/r,Au(e)/r]}td.invert=Eh((function(t){return 2*vu(t)}));var ed=function(){return yh(td).scale(250).clipAngle(142)};function nd(t,e){return[ku(Tu((hu+e)/2)),-t]}nd.invert=function(t,e){return[-e,2*vu(xu(t))-hu]};var rd=function(){var t=Nh(nd),e=t.center,n=t.rotate;return t.center=function(t){return arguments.length?e([-t[1],t[0]]):[(t=e())[1],-t[0]]},t.rotate=function(t){return arguments.length?n([t[0],t[1],t.length>2?t[2]+90:90]):[(t=n())[0],t[1],t[2]-90]},n([0,0,90]).scale(159.155)};function id(t,e){return t.parent===e.parent?1:2}function ad(t,e){return t+e.x}function od(t,e){return Math.max(t,e.y)}var sd=function(){var t=id,e=1,n=1,r=!1;function i(i){var a,o=0;i.eachAfter((function(e){var n=e.children;n?(e.x=function(t){return t.reduce(ad,0)/t.length}(n),e.y=function(t){return 1+t.reduce(od,0)}(n)):(e.x=a?o+=t(e,a):0,e.y=0,a=e)}));var s=function(t){for(var e;e=t.children;)t=e[0];return t}(i),u=function(t){for(var e;e=t.children;)t=e[e.length-1];return t}(i),c=s.x-t(s,u)/2,f=u.x+t(u,s)/2;return i.eachAfter(r?function(t){t.x=(t.x-i.x)*e,t.y=(i.y-t.y)*n}:function(t){t.x=(t.x-c)/(f-c)*e,t.y=(1-(i.y?t.y/i.y:1))*n})}return i.separation=function(e){return arguments.length?(t=e,i):t},i.size=function(t){return arguments.length?(r=!1,e=+t[0],n=+t[1],i):r?null:[e,n]},i.nodeSize=function(t){return arguments.length?(r=!0,e=+t[0],n=+t[1],i):r?[e,n]:null},i};function ud(t){var e=0,n=t.children,r=n&&n.length;if(r)for(;--r>=0;)e+=n[r].value;else e=1;t.value=e}function cd(t,e){var n,r,i,a,o,s=new dd(t),u=+t.value&&(s.value=t.value),c=[s];for(null==e&&(e=fd);n=c.pop();)if(u&&(n.value=+n.data.value),(i=e(n.data))&&(o=i.length))for(n.children=new Array(o),a=o-1;a>=0;--a)c.push(r=n.children[a]=new dd(i[a])),r.parent=n,r.depth=n.depth+1;return s.eachBefore(hd)}function fd(t){return t.children}function ld(t){t.data=t.data.data}function hd(t){var e=0;do{t.height=e}while((t=t.parent)&&t.height<++e)}function dd(t){this.data=t,this.depth=this.height=0,this.parent=null}dd.prototype=cd.prototype={constructor:dd,count:function(){return this.eachAfter(ud)},each:function(t){var e,n,r,i,a=this,o=[a];do{for(e=o.reverse(),o=[];a=e.pop();)if(t(a),n=a.children)for(r=0,i=n.length;r<i;++r)o.push(n[r])}while(o.length);return this},eachAfter:function(t){for(var e,n,r,i=this,a=[i],o=[];i=a.pop();)if(o.push(i),e=i.children)for(n=0,r=e.length;n<r;++n)a.push(e[n]);for(;i=o.pop();)t(i);return this},eachBefore:function(t){for(var e,n,r=this,i=[r];r=i.pop();)if(t(r),e=r.children)for(n=e.length-1;n>=0;--n)i.push(e[n]);return this},sum:function(t){return this.eachAfter((function(e){for(var n=+t(e.data)||0,r=e.children,i=r&&r.length;--i>=0;)n+=r[i].value;e.value=n}))},sort:function(t){return this.eachBefore((function(e){e.children&&e.children.sort(t)}))},path:function(t){for(var e=this,n=function(t,e){if(t===e)return t;var n=t.ancestors(),r=e.ancestors(),i=null;t=n.pop(),e=r.pop();for(;t===e;)i=t,t=n.pop(),e=r.pop();return i}(e,t),r=[e];e!==n;)e=e.parent,r.push(e);for(var i=r.length;t!==n;)r.splice(i,0,t),t=t.parent;return r},ancestors:function(){for(var t=this,e=[t];t=t.parent;)e.push(t);return e},descendants:function(){var t=[];return this.each((function(e){t.push(e)})),t},leaves:function(){var t=[];return this.eachBefore((function(e){e.children||t.push(e)})),t},links:function(){var t=this,e=[];return t.each((function(n){n!==t&&e.push({source:n.parent,target:n})})),e},copy:function(){return cd(this).eachBefore(ld)}};var pd=Array.prototype.slice;var gd=function(t){for(var e,n,r=0,i=(t=function(t){for(var e,n,r=t.length;r;)n=Math.random()*r--|0,e=t[r],t[r]=t[n],t[n]=e;return t}(pd.call(t))).length,a=[];r<i;)e=t[r],n&&vd(n,e)?++r:(n=_d(a=yd(a,e)),r=0);return n};function yd(t,e){var n,r;if(md(e,t))return[e];for(n=0;n<t.length;++n)if(bd(e,t[n])&&md(wd(t[n],e),t))return[t[n],e];for(n=0;n<t.length-1;++n)for(r=n+1;r<t.length;++r)if(bd(wd(t[n],t[r]),e)&&bd(wd(t[n],e),t[r])&&bd(wd(t[r],e),t[n])&&md(xd(t[n],t[r],e),t))return[t[n],t[r],e];throw new Error}function bd(t,e){var n=t.r-e.r,r=e.x-t.x,i=e.y-t.y;return n<0||n*n<r*r+i*i}function vd(t,e){var n=t.r-e.r+1e-6,r=e.x-t.x,i=e.y-t.y;return n>0&&n*n>r*r+i*i}function md(t,e){for(var n=0;n<e.length;++n)if(!vd(t,e[n]))return!1;return!0}function _d(t){switch(t.length){case 1:return{x:(e=t[0]).x,y:e.y,r:e.r};case 2:return wd(t[0],t[1]);case 3:return xd(t[0],t[1],t[2])}var e}function wd(t,e){var n=t.x,r=t.y,i=t.r,a=e.x,o=e.y,s=e.r,u=a-n,c=o-r,f=s-i,l=Math.sqrt(u*u+c*c);return{x:(n+a+u/l*f)/2,y:(r+o+c/l*f)/2,r:(l+i+s)/2}}function xd(t,e,n){var r=t.x,i=t.y,a=t.r,o=e.x,s=e.y,u=e.r,c=n.x,f=n.y,l=n.r,h=r-o,d=r-c,p=i-s,g=i-f,y=u-a,b=l-a,v=r*r+i*i-a*a,m=v-o*o-s*s+u*u,_=v-c*c-f*f+l*l,w=d*p-h*g,x=(p*_-g*m)/(2*w)-r,k=(g*y-p*b)/w,E=(d*m-h*_)/(2*w)-i,A=(h*b-d*y)/w,S=k*k+A*A-1,M=2*(a+x*k+E*A),T=x*x+E*E-a*a,D=-(S?(M+Math.sqrt(M*M-4*S*T))/(2*S):T/M);return{x:r+x+k*D,y:i+E+A*D,r:D}}function kd(t,e,n){var r,i,a,o,s=t.x-e.x,u=t.y-e.y,c=s*s+u*u;c?(i=e.r+n.r,i*=i,o=t.r+n.r,i>(o*=o)?(r=(c+o-i)/(2*c),a=Math.sqrt(Math.max(0,o/c-r*r)),n.x=t.x-r*s-a*u,n.y=t.y-r*u+a*s):(r=(c+i-o)/(2*c),a=Math.sqrt(Math.max(0,i/c-r*r)),n.x=e.x+r*s-a*u,n.y=e.y+r*u+a*s)):(n.x=e.x+n.r,n.y=e.y)}function Ed(t,e){var n=t.r+e.r-1e-6,r=e.x-t.x,i=e.y-t.y;return n>0&&n*n>r*r+i*i}function Ad(t){var e=t._,n=t.next._,r=e.r+n.r,i=(e.x*n.r+n.x*e.r)/r,a=(e.y*n.r+n.y*e.r)/r;return i*i+a*a}function Sd(t){this._=t,this.next=null,this.previous=null}function Md(t){if(!(i=t.length))return 0;var e,n,r,i,a,o,s,u,c,f,l;if((e=t[0]).x=0,e.y=0,!(i>1))return e.r;if(n=t[1],e.x=-n.r,n.x=e.r,n.y=0,!(i>2))return e.r+n.r;kd(n,e,r=t[2]),e=new Sd(e),n=new Sd(n),r=new Sd(r),e.next=r.previous=n,n.next=e.previous=r,r.next=n.previous=e;t:for(s=3;s<i;++s){kd(e._,n._,r=t[s]),r=new Sd(r),u=n.next,c=e.previous,f=n._.r,l=e._.r;do{if(f<=l){if(Ed(u._,r._)){n=u,e.next=n,n.previous=e,--s;continue t}f+=u._.r,u=u.next}else{if(Ed(c._,r._)){(e=c).next=n,n.previous=e,--s;continue t}l+=c._.r,c=c.previous}}while(u!==c.next);for(r.previous=e,r.next=n,e.next=n.previous=n=r,a=Ad(e);(r=r.next)!==n;)(o=Ad(r))<a&&(e=r,a=o);n=e.next}for(e=[n._],r=n;(r=r.next)!==n;)e.push(r._);for(r=gd(e),s=0;s<i;++s)(e=t[s]).x-=r.x,e.y-=r.y;return r.r}var Td=function(t){return Md(t),t};function Dd(t){return null==t?null:Cd(t)}function Cd(t){if("function"!=typeof t)throw new Error;return t}function Nd(){return 0}var Id=function(t){return function(){return t}};function Ld(t){return Math.sqrt(t.value)}var Bd=function(){var t=null,e=1,n=1,r=Nd;function i(i){return i.x=e/2,i.y=n/2,t?i.eachBefore(Od(t)).eachAfter(Rd(r,.5)).eachBefore(Pd(1)):i.eachBefore(Od(Ld)).eachAfter(Rd(Nd,1)).eachAfter(Rd(r,i.r/Math.min(e,n))).eachBefore(Pd(Math.min(e,n)/(2*i.r))),i}return i.radius=function(e){return arguments.length?(t=Dd(e),i):t},i.size=function(t){return arguments.length?(e=+t[0],n=+t[1],i):[e,n]},i.padding=function(t){return arguments.length?(r="function"==typeof t?t:Id(+t),i):r},i};function Od(t){return function(e){e.children||(e.r=Math.max(0,+t(e)||0))}}function Rd(t,e){return function(n){if(r=n.children){var r,i,a,o=r.length,s=t(n)*e||0;if(s)for(i=0;i<o;++i)r[i].r+=s;if(a=Md(r),s)for(i=0;i<o;++i)r[i].r-=s;n.r=a+s}}}function Pd(t){return function(e){var n=e.parent;e.r*=t,n&&(e.x=n.x+t*e.x,e.y=n.y+t*e.y)}}var Fd=function(t){t.x0=Math.round(t.x0),t.y0=Math.round(t.y0),t.x1=Math.round(t.x1),t.y1=Math.round(t.y1)},qd=function(t,e,n,r,i){for(var a,o=t.children,s=-1,u=o.length,c=t.value&&(r-e)/t.value;++s<u;)(a=o[s]).y0=n,a.y1=i,a.x0=e,a.x1=e+=a.value*c},jd=function(){var t=1,e=1,n=0,r=!1;function i(i){var a=i.height+1;return i.x0=i.y0=n,i.x1=t,i.y1=e/a,i.eachBefore(function(t,e){return function(r){r.children&&qd(r,r.x0,t*(r.depth+1)/e,r.x1,t*(r.depth+2)/e);var i=r.x0,a=r.y0,o=r.x1-n,s=r.y1-n;o<i&&(i=o=(i+o)/2),s<a&&(a=s=(a+s)/2),r.x0=i,r.y0=a,r.x1=o,r.y1=s}}(e,a)),r&&i.eachBefore(Fd),i}return i.round=function(t){return arguments.length?(r=!!t,i):r},i.size=function(n){return arguments.length?(t=+n[0],e=+n[1],i):[t,e]},i.padding=function(t){return arguments.length?(n=+t,i):n},i},Ud={depth:-1},zd={};function Yd(t){return t.id}function Vd(t){return t.parentId}var Hd=function(){var t=Yd,e=Vd;function n(n){var r,i,a,o,s,u,c,f=n.length,l=new Array(f),h={};for(i=0;i<f;++i)r=n[i],s=l[i]=new dd(r),null!=(u=t(r,i,n))&&(u+="")&&(h[c="$"+(s.id=u)]=c in h?zd:s);for(i=0;i<f;++i)if(s=l[i],null!=(u=e(n[i],i,n))&&(u+="")){if(!(o=h["$"+u]))throw new Error("missing: "+u);if(o===zd)throw new Error("ambiguous: "+u);o.children?o.children.push(s):o.children=[s],s.parent=o}else{if(a)throw new Error("multiple roots");a=s}if(!a)throw new Error("no root");if(a.parent=Ud,a.eachBefore((function(t){t.depth=t.parent.depth+1,--f})).eachBefore(hd),a.parent=null,f>0)throw new Error("cycle");return a}return n.id=function(e){return arguments.length?(t=Cd(e),n):t},n.parentId=function(t){return arguments.length?(e=Cd(t),n):e},n};function Gd(t,e){return t.parent===e.parent?1:2}function $d(t){var e=t.children;return e?e[0]:t.t}function Wd(t){var e=t.children;return e?e[e.length-1]:t.t}function Kd(t,e,n){var r=n/(e.i-t.i);e.c-=r,e.s+=n,t.c+=r,e.z+=n,e.m+=n}function Xd(t,e,n){return t.a.parent===e.parent?t.a:n}function Zd(t,e){this._=t,this.parent=null,this.children=null,this.A=null,this.a=this,this.z=0,this.m=0,this.c=0,this.s=0,this.t=null,this.i=e}Zd.prototype=Object.create(dd.prototype);var Jd=function(){var t=Gd,e=1,n=1,r=null;function i(i){var u=function(t){for(var e,n,r,i,a,o=new Zd(t,0),s=[o];e=s.pop();)if(r=e._.children)for(e.children=new Array(a=r.length),i=a-1;i>=0;--i)s.push(n=e.children[i]=new Zd(r[i],i)),n.parent=e;return(o.parent=new Zd(null,0)).children=[o],o}(i);if(u.eachAfter(a),u.parent.m=-u.z,u.eachBefore(o),r)i.eachBefore(s);else{var c=i,f=i,l=i;i.eachBefore((function(t){t.x<c.x&&(c=t),t.x>f.x&&(f=t),t.depth>l.depth&&(l=t)}));var h=c===f?1:t(c,f)/2,d=h-c.x,p=e/(f.x+h+d),g=n/(l.depth||1);i.eachBefore((function(t){t.x=(t.x+d)*p,t.y=t.depth*g}))}return i}function a(e){var n=e.children,r=e.parent.children,i=e.i?r[e.i-1]:null;if(n){!function(t){for(var e,n=0,r=0,i=t.children,a=i.length;--a>=0;)(e=i[a]).z+=n,e.m+=n,n+=e.s+(r+=e.c)}(e);var a=(n[0].z+n[n.length-1].z)/2;i?(e.z=i.z+t(e._,i._),e.m=e.z-a):e.z=a}else i&&(e.z=i.z+t(e._,i._));e.parent.A=function(e,n,r){if(n){for(var i,a=e,o=e,s=n,u=a.parent.children[0],c=a.m,f=o.m,l=s.m,h=u.m;s=Wd(s),a=$d(a),s&&a;)u=$d(u),(o=Wd(o)).a=e,(i=s.z+l-a.z-c+t(s._,a._))>0&&(Kd(Xd(s,e,r),e,i),c+=i,f+=i),l+=s.m,c+=a.m,h+=u.m,f+=o.m;s&&!Wd(o)&&(o.t=s,o.m+=l-f),a&&!$d(u)&&(u.t=a,u.m+=c-h,r=e)}return r}(e,i,e.parent.A||r[0])}function o(t){t._.x=t.z+t.parent.m,t.m+=t.parent.m}function s(t){t.x*=e,t.y=t.depth*n}return i.separation=function(e){return arguments.length?(t=e,i):t},i.size=function(t){return arguments.length?(r=!1,e=+t[0],n=+t[1],i):r?null:[e,n]},i.nodeSize=function(t){return arguments.length?(r=!0,e=+t[0],n=+t[1],i):r?[e,n]:null},i},Qd=function(t,e,n,r,i){for(var a,o=t.children,s=-1,u=o.length,c=t.value&&(i-n)/t.value;++s<u;)(a=o[s]).x0=e,a.x1=r,a.y0=n,a.y1=n+=a.value*c},tp=(1+Math.sqrt(5))/2;function ep(t,e,n,r,i,a){for(var o,s,u,c,f,l,h,d,p,g,y,b=[],v=e.children,m=0,_=0,w=v.length,x=e.value;m<w;){u=i-n,c=a-r;do{f=v[_++].value}while(!f&&_<w);for(l=h=f,y=f*f*(g=Math.max(c/u,u/c)/(x*t)),p=Math.max(h/y,y/l);_<w;++_){if(f+=s=v[_].value,s<l&&(l=s),s>h&&(h=s),y=f*f*g,(d=Math.max(h/y,y/l))>p){f-=s;break}p=d}b.push(o={value:f,dice:u<c,children:v.slice(m,_)}),o.dice?qd(o,n,r,i,x?r+=c*f/x:a):Qd(o,n,r,x?n+=u*f/x:i,a),x-=f,m=_}return b}var np=function t(e){function n(t,n,r,i,a){ep(e,t,n,r,i,a)}return n.ratio=function(e){return t((e=+e)>1?e:1)},n}(tp),rp=function(){var t=np,e=!1,n=1,r=1,i=[0],a=Nd,o=Nd,s=Nd,u=Nd,c=Nd;function f(t){return t.x0=t.y0=0,t.x1=n,t.y1=r,t.eachBefore(l),i=[0],e&&t.eachBefore(Fd),t}function l(e){var n=i[e.depth],r=e.x0+n,f=e.y0+n,l=e.x1-n,h=e.y1-n;l<r&&(r=l=(r+l)/2),h<f&&(f=h=(f+h)/2),e.x0=r,e.y0=f,e.x1=l,e.y1=h,e.children&&(n=i[e.depth+1]=a(e)/2,r+=c(e)-n,f+=o(e)-n,(l-=s(e)-n)<r&&(r=l=(r+l)/2),(h-=u(e)-n)<f&&(f=h=(f+h)/2),t(e,r,f,l,h))}return f.round=function(t){return arguments.length?(e=!!t,f):e},f.size=function(t){return arguments.length?(n=+t[0],r=+t[1],f):[n,r]},f.tile=function(e){return arguments.length?(t=Cd(e),f):t},f.padding=function(t){return arguments.length?f.paddingInner(t).paddingOuter(t):f.paddingInner()},f.paddingInner=function(t){return arguments.length?(a="function"==typeof t?t:Id(+t),f):a},f.paddingOuter=function(t){return arguments.length?f.paddingTop(t).paddingRight(t).paddingBottom(t).paddingLeft(t):f.paddingTop()},f.paddingTop=function(t){return arguments.length?(o="function"==typeof t?t:Id(+t),f):o},f.paddingRight=function(t){return arguments.length?(s="function"==typeof t?t:Id(+t),f):s},f.paddingBottom=function(t){return arguments.length?(u="function"==typeof t?t:Id(+t),f):u},f.paddingLeft=function(t){return arguments.length?(c="function"==typeof t?t:Id(+t),f):c},f},ip=function(t,e,n,r,i){var a,o,s=t.children,u=s.length,c=new Array(u+1);for(c[0]=o=a=0;a<u;++a)c[a+1]=o+=s[a].value;!function t(e,n,r,i,a,o,u){if(e>=n-1){var f=s[e];return f.x0=i,f.y0=a,f.x1=o,void(f.y1=u)}var l=c[e],h=r/2+l,d=e+1,p=n-1;for(;d<p;){var g=d+p>>>1;c[g]<h?d=g+1:p=g}h-c[d-1]<c[d]-h&&e+1<d&&--d;var y=c[d]-l,b=r-y;if(o-i>u-a){var v=(i*b+o*y)/r;t(e,d,y,i,a,v,u),t(d,n,b,v,a,o,u)}else{var m=(a*b+u*y)/r;t(e,d,y,i,a,o,m),t(d,n,b,i,m,o,u)}}(0,u,t.value,e,n,r,i)},ap=function(t,e,n,r,i){(1&t.depth?Qd:qd)(t,e,n,r,i)},op=function t(e){function n(t,n,r,i,a){if((o=t._squarify)&&o.ratio===e)for(var o,s,u,c,f,l=-1,h=o.length,d=t.value;++l<h;){for(u=(s=o[l]).children,c=s.value=0,f=u.length;c<f;++c)s.value+=u[c].value;s.dice?qd(s,n,r,i,r+=(a-r)*s.value/d):Qd(s,n,r,n+=(i-n)*s.value/d,a),d-=s.value}else t._squarify=o=ep(e,t,n,r,i,a),o.ratio=e}return n.ratio=function(e){return t((e=+e)>1?e:1)},n}(tp),sp=function(t){var e=t.length;return function(n){return t[Math.max(0,Math.min(e-1,Math.floor(n*e)))]}},up=function(t,e){var n=cn(+t,+e);return function(t){var e=n(t);return e-360*Math.floor(e/360)}},cp=function(t,e){return t=+t,e=+e,function(n){return Math.round(t*(1-n)+e*n)}},fp=Math.SQRT2;function lp(t){return((t=Math.exp(t))+1/t)/2}var hp=function(t,e){var n,r,i=t[0],a=t[1],o=t[2],s=e[0],u=e[1],c=e[2],f=s-i,l=u-a,h=f*f+l*l;if(h<1e-12)r=Math.log(c/o)/fp,n=function(t){return[i+t*f,a+t*l,o*Math.exp(fp*t*r)]};else{var d=Math.sqrt(h),p=(c*c-o*o+4*h)/(2*o*2*d),g=(c*c-o*o-4*h)/(2*c*2*d),y=Math.log(Math.sqrt(p*p+1)-p),b=Math.log(Math.sqrt(g*g+1)-g);r=(b-y)/fp,n=function(t){var e,n=t*r,s=lp(y),u=o/(2*d)*(s*(e=fp*n+y,((e=Math.exp(2*e))-1)/(e+1))-function(t){return((t=Math.exp(t))-1/t)/2}(y));return[i+u*f,a+u*l,o*s/lp(fp*n+y)]}}return n.duration=1e3*r,n};function dp(t){return function(e,n){var r=t((e=tn(e)).h,(n=tn(n)).h),i=ln(e.s,n.s),a=ln(e.l,n.l),o=ln(e.opacity,n.opacity);return function(t){return e.h=r(t),e.s=i(t),e.l=a(t),e.opacity=o(t),e+""}}}var pp=dp(cn),gp=dp(ln);function yp(t,e){var n=ln((t=pa(t)).l,(e=pa(e)).l),r=ln(t.a,e.a),i=ln(t.b,e.b),a=ln(t.opacity,e.opacity);return function(e){return t.l=n(e),t.a=r(e),t.b=i(e),t.opacity=a(e),t+""}}function bp(t){return function(e,n){var r=t((e=xa(e)).h,(n=xa(n)).h),i=ln(e.c,n.c),a=ln(e.l,n.l),o=ln(e.opacity,n.opacity);return function(t){return e.h=r(t),e.c=i(t),e.l=a(t),e.opacity=o(t),e+""}}}var vp=bp(cn),mp=bp(ln);function _p(t){return function e(n){function r(e,r){var i=t((e=Ca(e)).h,(r=Ca(r)).h),a=ln(e.s,r.s),o=ln(e.l,r.l),s=ln(e.opacity,r.opacity);return function(t){return e.h=i(t),e.s=a(t),e.l=o(Math.pow(t,n)),e.opacity=s(t),e+""}}return n=+n,r.gamma=e,r}(1)}var wp=_p(cn),xp=_p(ln);function kp(t,e){for(var n=0,r=e.length-1,i=e[0],a=new Array(r<0?0:r);n<r;)a[n]=t(i,i=e[++n]);return function(t){var e=Math.max(0,Math.min(r-1,Math.floor(t*=r)));return a[e](t-e)}}var Ep=function(t,e){for(var n=new Array(e),r=0;r<e;++r)n[r]=t(r/(e-1));return n},Ap=function(t){for(var e,n=-1,r=t.length,i=t[r-1],a=0;++n<r;)e=i,i=t[n],a+=e[1]*i[0]-e[0]*i[1];return a/2},Sp=function(t){for(var e,n,r=-1,i=t.length,a=0,o=0,s=t[i-1],u=0;++r<i;)e=s,s=t[r],u+=n=e[0]*s[1]-s[0]*e[1],a+=(e[0]+s[0])*n,o+=(e[1]+s[1])*n;return[a/(u*=3),o/u]};function Mp(t,e){return t[0]-e[0]||t[1]-e[1]}function Tp(t){for(var e,n,r,i=t.length,a=[0,1],o=2,s=2;s<i;++s){for(;o>1&&(e=t[a[o-2]],n=t[a[o-1]],r=t[s],(n[0]-e[0])*(r[1]-e[1])-(n[1]-e[1])*(r[0]-e[0])<=0);)--o;a[o++]=s}return a.slice(0,o)}var Dp=function(t){if((n=t.length)<3)return null;var e,n,r=new Array(n),i=new Array(n);for(e=0;e<n;++e)r[e]=[+t[e][0],+t[e][1],e];for(r.sort(Mp),e=0;e<n;++e)i[e]=[r[e][0],-r[e][1]];var a=Tp(r),o=Tp(i),s=o[0]===a[0],u=o[o.length-1]===a[a.length-1],c=[];for(e=a.length-1;e>=0;--e)c.push(t[r[a[e]][2]]);for(e=+s;e<o.length-u;++e)c.push(t[r[o[e]][2]]);return c},Cp=function(t,e){for(var n,r,i=t.length,a=t[i-1],o=e[0],s=e[1],u=a[0],c=a[1],f=!1,l=0;l<i;++l)n=(a=t[l])[0],(r=a[1])>s!=c>s&&o<(u-n)*(s-r)/(c-r)+n&&(f=!f),u=n,c=r;return f},Np=function(t){for(var e,n,r=-1,i=t.length,a=t[i-1],o=a[0],s=a[1],u=0;++r<i;)e=o,n=s,e-=o=(a=t[r])[0],n-=s=a[1],u+=Math.sqrt(e*e+n*n);return u},Ip=function(){return Math.random()},Lp=function t(e){function n(t,n){return t=null==t?0:+t,n=null==n?1:+n,1===arguments.length?(n=t,t=0):n-=t,function(){return e()*n+t}}return n.source=t,n}(Ip),Bp=function t(e){function n(t,n){var r,i;return t=null==t?0:+t,n=null==n?1:+n,function(){var a;if(null!=r)a=r,r=null;else do{r=2*e()-1,a=2*e()-1,i=r*r+a*a}while(!i||i>1);return t+n*a*Math.sqrt(-2*Math.log(i)/i)}}return n.source=t,n}(Ip),Op=function t(e){function n(){var t=Bp.source(e).apply(this,arguments);return function(){return Math.exp(t())}}return n.source=t,n}(Ip),Rp=function t(e){function n(t){return function(){for(var n=0,r=0;r<t;++r)n+=e();return n}}return n.source=t,n}(Ip),Pp=function t(e){function n(t){var n=Rp.source(e)(t);return function(){return n()/t}}return n.source=t,n}(Ip),Fp=function t(e){function n(t){return function(){return-Math.log(1-e())/t}}return n.source=t,n}(Ip);function qp(t,e){switch(arguments.length){case 0:break;case 1:this.range(t);break;default:this.range(e).domain(t)}return this}function jp(t,e){switch(arguments.length){case 0:break;case 1:this.interpolator(t);break;default:this.interpolator(e).domain(t)}return this}var Up=Array.prototype,zp=Up.map,Yp=Up.slice,Vp={name:"implicit"};function Hp(){var t=Zi(),e=[],n=[],r=Vp;function i(i){var a=i+"",o=t.get(a);if(!o){if(r!==Vp)return r;t.set(a,o=e.push(i))}return n[(o-1)%n.length]}return i.domain=function(n){if(!arguments.length)return e.slice();e=[],t=Zi();for(var r,a,o=-1,s=n.length;++o<s;)t.has(a=(r=n[o])+"")||t.set(a,e.push(r));return i},i.range=function(t){return arguments.length?(n=Yp.call(t),i):n.slice()},i.unknown=function(t){return arguments.length?(r=t,i):r},i.copy=function(){return Hp(e,n).unknown(r)},qp.apply(i,arguments),i}function Gp(){var t,e,n=Hp().unknown(void 0),r=n.domain,i=n.range,a=[0,1],o=!1,s=0,u=0,c=.5;function f(){var n=r().length,f=a[1]<a[0],l=a[f-0],h=a[1-f];t=(h-l)/Math.max(1,n-s+2*u),o&&(t=Math.floor(t)),l+=(h-l-t*(n-s))*c,e=t*(1-s),o&&(l=Math.round(l),e=Math.round(e));var d=x(n).map((function(e){return l+t*e}));return i(f?d.reverse():d)}return delete n.unknown,n.domain=function(t){return arguments.length?(r(t),f()):r()},n.range=function(t){return arguments.length?(a=[+t[0],+t[1]],f()):a.slice()},n.rangeRound=function(t){return a=[+t[0],+t[1]],o=!0,f()},n.bandwidth=function(){return e},n.step=function(){return t},n.round=function(t){return arguments.length?(o=!!t,f()):o},n.padding=function(t){return arguments.length?(s=Math.min(1,u=+t),f()):s},n.paddingInner=function(t){return arguments.length?(s=Math.min(1,t),f()):s},n.paddingOuter=function(t){return arguments.length?(u=+t,f()):u},n.align=function(t){return arguments.length?(c=Math.max(0,Math.min(1,t)),f()):c},n.copy=function(){return Gp(r(),a).round(o).paddingInner(s).paddingOuter(u).align(c)},qp.apply(f(),arguments)}function $p(t){var e=t.copy;return t.padding=t.paddingOuter,delete t.paddingInner,delete t.paddingOuter,t.copy=function(){return $p(e())},t}function Wp(){return $p(Gp.apply(null,arguments).paddingInner(1))}var Kp=function(t){return+t},Xp=[0,1];function Zp(t){return t}function Jp(t,e){return(e-=t=+t)?function(n){return(n-t)/e}:(n=isNaN(e)?NaN:.5,function(){return n});var n}function Qp(t){var e,n=t[0],r=t[t.length-1];return n>r&&(e=n,n=r,r=e),function(t){return Math.max(n,Math.min(r,t))}}function tg(t,e,n){var r=t[0],i=t[1],a=e[0],o=e[1];return i<r?(r=Jp(i,r),a=n(o,a)):(r=Jp(r,i),a=n(a,o)),function(t){return a(r(t))}}function eg(t,e,n){var r=Math.min(t.length,e.length)-1,i=new Array(r),a=new Array(r),o=-1;for(t[r]<t[0]&&(t=t.slice().reverse(),e=e.slice().reverse());++o<r;)i[o]=Jp(t[o],t[o+1]),a[o]=n(e[o],e[o+1]);return function(e){var n=u(t,e,1,r)-1;return a[n](i[n](e))}}function ng(t,e){return e.domain(t.domain()).range(t.range()).interpolate(t.interpolate()).clamp(t.clamp()).unknown(t.unknown())}function rg(){var t,e,n,r,i,a,o=Xp,s=Xp,u=Tn,c=Zp;function f(){return r=Math.min(o.length,s.length)>2?eg:tg,i=a=null,l}function l(e){return isNaN(e=+e)?n:(i||(i=r(o.map(t),s,u)))(t(c(e)))}return l.invert=function(n){return c(e((a||(a=r(s,o.map(t),wn)))(n)))},l.domain=function(t){return arguments.length?(o=zp.call(t,Kp),c===Zp||(c=Qp(o)),f()):o.slice()},l.range=function(t){return arguments.length?(s=Yp.call(t),f()):s.slice()},l.rangeRound=function(t){return s=Yp.call(t),u=cp,f()},l.clamp=function(t){return arguments.length?(c=t?Qp(o):Zp,l):c!==Zp},l.interpolate=function(t){return arguments.length?(u=t,f()):u},l.unknown=function(t){return arguments.length?(n=t,l):n},function(n,r){return t=n,e=r,f()}}function ig(t,e){return rg()(t,e)}var ag=function(t,e,n,r){var i,a=T(t,e,n);switch((r=Hs(null==r?",f":r)).type){case"s":var o=Math.max(Math.abs(t),Math.abs(e));return null!=r.precision||isNaN(i=au(a,o))||(r.precision=i),Xs(r,o);case"":case"e":case"g":case"p":case"r":null!=r.precision||isNaN(i=ou(a,Math.max(Math.abs(t),Math.abs(e))))||(r.precision=i-("e"===r.type));break;case"f":case"%":null!=r.precision||isNaN(i=iu(a))||(r.precision=i-2*("%"===r.type))}return Ks(r)};function og(t){var e=t.domain;return t.ticks=function(t){var n=e();return S(n[0],n[n.length-1],null==t?10:t)},t.tickFormat=function(t,n){var r=e();return ag(r[0],r[r.length-1],null==t?10:t,n)},t.nice=function(n){null==n&&(n=10);var r,i=e(),a=0,o=i.length-1,s=i[a],u=i[o];return u<s&&(r=s,s=u,u=r,r=a,a=o,o=r),(r=M(s,u,n))>0?r=M(s=Math.floor(s/r)*r,u=Math.ceil(u/r)*r,n):r<0&&(r=M(s=Math.ceil(s*r)/r,u=Math.floor(u*r)/r,n)),r>0?(i[a]=Math.floor(s/r)*r,i[o]=Math.ceil(u/r)*r,e(i)):r<0&&(i[a]=Math.ceil(s*r)/r,i[o]=Math.floor(u*r)/r,e(i)),t},t}function sg(){var t=ig(Zp,Zp);return t.copy=function(){return ng(t,sg())},qp.apply(t,arguments),og(t)}function ug(t){var e;function n(t){return isNaN(t=+t)?e:t}return n.invert=n,n.domain=n.range=function(e){return arguments.length?(t=zp.call(e,Kp),n):t.slice()},n.unknown=function(t){return arguments.length?(e=t,n):e},n.copy=function(){return ug(t).unknown(e)},t=arguments.length?zp.call(t,Kp):[0,1],og(n)}var cg=function(t,e){var n,r=0,i=(t=t.slice()).length-1,a=t[r],o=t[i];return o<a&&(n=r,r=i,i=n,n=a,a=o,o=n),t[r]=e.floor(a),t[i]=e.ceil(o),t};function fg(t){return Math.log(t)}function lg(t){return Math.exp(t)}function hg(t){return-Math.log(-t)}function dg(t){return-Math.exp(-t)}function pg(t){return isFinite(t)?+("1e"+t):t<0?0:t}function gg(t){return function(e){return-t(-e)}}function yg(t){var e,n,r=t(fg,lg),i=r.domain,a=10;function o(){return e=function(t){return t===Math.E?Math.log:10===t&&Math.log10||2===t&&Math.log2||(t=Math.log(t),function(e){return Math.log(e)/t})}(a),n=function(t){return 10===t?pg:t===Math.E?Math.exp:function(e){return Math.pow(t,e)}}(a),i()[0]<0?(e=gg(e),n=gg(n),t(hg,dg)):t(fg,lg),r}return r.base=function(t){return arguments.length?(a=+t,o()):a},r.domain=function(t){return arguments.length?(i(t),o()):i()},r.ticks=function(t){var r,o=i(),s=o[0],u=o[o.length-1];(r=u<s)&&(h=s,s=u,u=h);var c,f,l,h=e(s),d=e(u),p=null==t?10:+t,g=[];if(!(a%1)&&d-h<p){if(h=Math.round(h)-1,d=Math.round(d)+1,s>0){for(;h<d;++h)for(f=1,c=n(h);f<a;++f)if(!((l=c*f)<s)){if(l>u)break;g.push(l)}}else for(;h<d;++h)for(f=a-1,c=n(h);f>=1;--f)if(!((l=c*f)<s)){if(l>u)break;g.push(l)}}else g=S(h,d,Math.min(d-h,p)).map(n);return r?g.reverse():g},r.tickFormat=function(t,i){if(null==i&&(i=10===a?".0e":","),"function"!=typeof i&&(i=Ks(i)),t===1/0)return i;null==t&&(t=10);var o=Math.max(1,a*t/r.ticks().length);return function(t){var r=t/n(Math.round(e(t)));return r*a<a-.5&&(r*=a),r<=o?i(t):""}},r.nice=function(){return i(cg(i(),{floor:function(t){return n(Math.floor(e(t)))},ceil:function(t){return n(Math.ceil(e(t)))}}))},r}function bg(){var t=yg(rg()).domain([1,10]);return t.copy=function(){return ng(t,bg()).base(t.base())},qp.apply(t,arguments),t}function vg(t){return function(e){return Math.sign(e)*Math.log1p(Math.abs(e/t))}}function mg(t){return function(e){return Math.sign(e)*Math.expm1(Math.abs(e))*t}}function _g(t){var e=1,n=t(vg(e),mg(e));return n.constant=function(n){return arguments.length?t(vg(e=+n),mg(e)):e},og(n)}function wg(){var t=_g(rg());return t.copy=function(){return ng(t,wg()).constant(t.constant())},qp.apply(t,arguments)}function xg(t){return function(e){return e<0?-Math.pow(-e,t):Math.pow(e,t)}}function kg(t){return t<0?-Math.sqrt(-t):Math.sqrt(t)}function Eg(t){return t<0?-t*t:t*t}function Ag(t){var e=t(Zp,Zp),n=1;function r(){return 1===n?t(Zp,Zp):.5===n?t(kg,Eg):t(xg(n),xg(1/n))}return e.exponent=function(t){return arguments.length?(n=+t,r()):n},og(e)}function Sg(){var t=Ag(rg());return t.copy=function(){return ng(t,Sg()).exponent(t.exponent())},qp.apply(t,arguments),t}function Mg(){return Sg.apply(null,arguments).exponent(.5)}function Tg(){var t,e=[],n=[],i=[];function a(){var t=0,r=Math.max(1,n.length);for(i=new Array(r-1);++t<r;)i[t-1]=N(e,t/r);return o}function o(e){return isNaN(e=+e)?t:n[u(i,e)]}return o.invertExtent=function(t){var r=n.indexOf(t);return r<0?[NaN,NaN]:[r>0?i[r-1]:e[0],r<i.length?i[r]:e[e.length-1]]},o.domain=function(t){if(!arguments.length)return e.slice();e=[];for(var n,i=0,o=t.length;i<o;++i)null==(n=t[i])||isNaN(n=+n)||e.push(n);return e.sort(r),a()},o.range=function(t){return arguments.length?(n=Yp.call(t),a()):n.slice()},o.unknown=function(e){return arguments.length?(t=e,o):t},o.quantiles=function(){return i.slice()},o.copy=function(){return Tg().domain(e).range(n).unknown(t)},qp.apply(o,arguments)}function Dg(){var t,e=0,n=1,r=1,i=[.5],a=[0,1];function o(e){return e<=e?a[u(i,e,0,r)]:t}function s(){var t=-1;for(i=new Array(r);++t<r;)i[t]=((t+1)*n-(t-r)*e)/(r+1);return o}return o.domain=function(t){return arguments.length?(e=+t[0],n=+t[1],s()):[e,n]},o.range=function(t){return arguments.length?(r=(a=Yp.call(t)).length-1,s()):a.slice()},o.invertExtent=function(t){var o=a.indexOf(t);return o<0?[NaN,NaN]:o<1?[e,i[0]]:o>=r?[i[r-1],n]:[i[o-1],i[o]]},o.unknown=function(e){return arguments.length?(t=e,o):o},o.thresholds=function(){return i.slice()},o.copy=function(){return Dg().domain([e,n]).range(a).unknown(t)},qp.apply(og(o),arguments)}function Cg(){var t,e=[.5],n=[0,1],r=1;function i(i){return i<=i?n[u(e,i,0,r)]:t}return i.domain=function(t){return arguments.length?(e=Yp.call(t),r=Math.min(e.length,n.length-1),i):e.slice()},i.range=function(t){return arguments.length?(n=Yp.call(t),r=Math.min(e.length,n.length-1),i):n.slice()},i.invertExtent=function(t){var r=n.indexOf(t);return[e[r-1],e[r]]},i.unknown=function(e){return arguments.length?(t=e,i):t},i.copy=function(){return Cg().domain(e).range(n).unknown(t)},qp.apply(i,arguments)}var Ng=new Date,Ig=new Date;function Lg(t,e,n,r){function i(e){return t(e=0===arguments.length?new Date:new Date(+e)),e}return i.floor=function(e){return t(e=new Date(+e)),e},i.ceil=function(n){return t(n=new Date(n-1)),e(n,1),t(n),n},i.round=function(t){var e=i(t),n=i.ceil(t);return t-e<n-t?e:n},i.offset=function(t,n){return e(t=new Date(+t),null==n?1:Math.floor(n)),t},i.range=function(n,r,a){var o,s=[];if(n=i.ceil(n),a=null==a?1:Math.floor(a),!(n<r&&a>0))return s;do{s.push(o=new Date(+n)),e(n,a),t(n)}while(o<n&&n<r);return s},i.filter=function(n){return Lg((function(e){if(e>=e)for(;t(e),!n(e);)e.setTime(e-1)}),(function(t,r){if(t>=t)if(r<0)for(;++r<=0;)for(;e(t,-1),!n(t););else for(;--r>=0;)for(;e(t,1),!n(t););}))},n&&(i.count=function(e,r){return Ng.setTime(+e),Ig.setTime(+r),t(Ng),t(Ig),Math.floor(n(Ng,Ig))},i.every=function(t){return t=Math.floor(t),isFinite(t)&&t>0?t>1?i.filter(r?function(e){return r(e)%t==0}:function(e){return i.count(0,e)%t==0}):i:null}),i}var Bg=Lg((function(t){t.setMonth(0,1),t.setHours(0,0,0,0)}),(function(t,e){t.setFullYear(t.getFullYear()+e)}),(function(t,e){return e.getFullYear()-t.getFullYear()}),(function(t){return t.getFullYear()}));Bg.every=function(t){return isFinite(t=Math.floor(t))&&t>0?Lg((function(e){e.setFullYear(Math.floor(e.getFullYear()/t)*t),e.setMonth(0,1),e.setHours(0,0,0,0)}),(function(e,n){e.setFullYear(e.getFullYear()+n*t)})):null};var Og=Bg,Rg=Bg.range,Pg=Lg((function(t){t.setDate(1),t.setHours(0,0,0,0)}),(function(t,e){t.setMonth(t.getMonth()+e)}),(function(t,e){return e.getMonth()-t.getMonth()+12*(e.getFullYear()-t.getFullYear())}),(function(t){return t.getMonth()})),Fg=Pg,qg=Pg.range;function jg(t){return Lg((function(e){e.setDate(e.getDate()-(e.getDay()+7-t)%7),e.setHours(0,0,0,0)}),(function(t,e){t.setDate(t.getDate()+7*e)}),(function(t,e){return(e-t-6e4*(e.getTimezoneOffset()-t.getTimezoneOffset()))/6048e5}))}var Ug=jg(0),zg=jg(1),Yg=jg(2),Vg=jg(3),Hg=jg(4),Gg=jg(5),$g=jg(6),Wg=Ug.range,Kg=zg.range,Xg=Yg.range,Zg=Vg.range,Jg=Hg.range,Qg=Gg.range,ty=$g.range,ey=Lg((function(t){t.setHours(0,0,0,0)}),(function(t,e){t.setDate(t.getDate()+e)}),(function(t,e){return(e-t-6e4*(e.getTimezoneOffset()-t.getTimezoneOffset()))/864e5}),(function(t){return t.getDate()-1})),ny=ey,ry=ey.range,iy=Lg((function(t){t.setTime(t-t.getMilliseconds()-1e3*t.getSeconds()-6e4*t.getMinutes())}),(function(t,e){t.setTime(+t+36e5*e)}),(function(t,e){return(e-t)/36e5}),(function(t){return t.getHours()})),ay=iy,oy=iy.range,sy=Lg((function(t){t.setTime(t-t.getMilliseconds()-1e3*t.getSeconds())}),(function(t,e){t.setTime(+t+6e4*e)}),(function(t,e){return(e-t)/6e4}),(function(t){return t.getMinutes()})),uy=sy,cy=sy.range,fy=Lg((function(t){t.setTime(t-t.getMilliseconds())}),(function(t,e){t.setTime(+t+1e3*e)}),(function(t,e){return(e-t)/1e3}),(function(t){return t.getUTCSeconds()})),ly=fy,hy=fy.range,dy=Lg((function(){}),(function(t,e){t.setTime(+t+e)}),(function(t,e){return e-t}));dy.every=function(t){return t=Math.floor(t),isFinite(t)&&t>0?t>1?Lg((function(e){e.setTime(Math.floor(e/t)*t)}),(function(e,n){e.setTime(+e+n*t)}),(function(e,n){return(n-e)/t})):dy:null};var py=dy,gy=dy.range;function yy(t){return Lg((function(e){e.setUTCDate(e.getUTCDate()-(e.getUTCDay()+7-t)%7),e.setUTCHours(0,0,0,0)}),(function(t,e){t.setUTCDate(t.getUTCDate()+7*e)}),(function(t,e){return(e-t)/6048e5}))}var by=yy(0),vy=yy(1),my=yy(2),_y=yy(3),wy=yy(4),xy=yy(5),ky=yy(6),Ey=by.range,Ay=vy.range,Sy=my.range,My=_y.range,Ty=wy.range,Dy=xy.range,Cy=ky.range,Ny=Lg((function(t){t.setUTCHours(0,0,0,0)}),(function(t,e){t.setUTCDate(t.getUTCDate()+e)}),(function(t,e){return(e-t)/864e5}),(function(t){return t.getUTCDate()-1})),Iy=Ny,Ly=Ny.range,By=Lg((function(t){t.setUTCMonth(0,1),t.setUTCHours(0,0,0,0)}),(function(t,e){t.setUTCFullYear(t.getUTCFullYear()+e)}),(function(t,e){return e.getUTCFullYear()-t.getUTCFullYear()}),(function(t){return t.getUTCFullYear()}));By.every=function(t){return isFinite(t=Math.floor(t))&&t>0?Lg((function(e){e.setUTCFullYear(Math.floor(e.getUTCFullYear()/t)*t),e.setUTCMonth(0,1),e.setUTCHours(0,0,0,0)}),(function(e,n){e.setUTCFullYear(e.getUTCFullYear()+n*t)})):null};var Oy=By,Ry=By.range;function Py(t){if(0<=t.y&&t.y<100){var e=new Date(-1,t.m,t.d,t.H,t.M,t.S,t.L);return e.setFullYear(t.y),e}return new Date(t.y,t.m,t.d,t.H,t.M,t.S,t.L)}function Fy(t){if(0<=t.y&&t.y<100){var e=new Date(Date.UTC(-1,t.m,t.d,t.H,t.M,t.S,t.L));return e.setUTCFullYear(t.y),e}return new Date(Date.UTC(t.y,t.m,t.d,t.H,t.M,t.S,t.L))}function qy(t,e,n){return{y:t,m:e,d:n,H:0,M:0,S:0,L:0}}function jy(t){var e=t.dateTime,n=t.date,r=t.time,i=t.periods,a=t.days,o=t.shortDays,s=t.months,u=t.shortMonths,c=Jy(i),f=Qy(i),l=Jy(a),h=Qy(a),d=Jy(o),p=Qy(o),g=Jy(s),y=Qy(s),b=Jy(u),v=Qy(u),m={a:function(t){return o[t.getDay()]},A:function(t){return a[t.getDay()]},b:function(t){return u[t.getMonth()]},B:function(t){return s[t.getMonth()]},c:null,d:_b,e:_b,f:Ab,H:wb,I:xb,j:kb,L:Eb,m:Sb,M:Mb,p:function(t){return i[+(t.getHours()>=12)]},q:function(t){return 1+~~(t.getMonth()/3)},Q:ev,s:nv,S:Tb,u:Db,U:Cb,V:Nb,w:Ib,W:Lb,x:null,X:null,y:Bb,Y:Ob,Z:Rb,"%":tv},_={a:function(t){return o[t.getUTCDay()]},A:function(t){return a[t.getUTCDay()]},b:function(t){return u[t.getUTCMonth()]},B:function(t){return s[t.getUTCMonth()]},c:null,d:Pb,e:Pb,f:zb,H:Fb,I:qb,j:jb,L:Ub,m:Yb,M:Vb,p:function(t){return i[+(t.getUTCHours()>=12)]},q:function(t){return 1+~~(t.getUTCMonth()/3)},Q:ev,s:nv,S:Hb,u:Gb,U:$b,V:Wb,w:Kb,W:Xb,x:null,X:null,y:Zb,Y:Jb,Z:Qb,"%":tv},w={a:function(t,e,n){var r=d.exec(e.slice(n));return r?(t.w=p[r[0].toLowerCase()],n+r[0].length):-1},A:function(t,e,n){var r=l.exec(e.slice(n));return r?(t.w=h[r[0].toLowerCase()],n+r[0].length):-1},b:function(t,e,n){var r=b.exec(e.slice(n));return r?(t.m=v[r[0].toLowerCase()],n+r[0].length):-1},B:function(t,e,n){var r=g.exec(e.slice(n));return r?(t.m=y[r[0].toLowerCase()],n+r[0].length):-1},c:function(t,n,r){return E(t,e,n,r)},d:fb,e:fb,f:yb,H:hb,I:hb,j:lb,L:gb,m:cb,M:db,p:function(t,e,n){var r=c.exec(e.slice(n));return r?(t.p=f[r[0].toLowerCase()],n+r[0].length):-1},q:ub,Q:vb,s:mb,S:pb,u:eb,U:nb,V:rb,w:tb,W:ib,x:function(t,e,r){return E(t,n,e,r)},X:function(t,e,n){return E(t,r,e,n)},y:ob,Y:ab,Z:sb,"%":bb};function x(t,e){return function(n){var r,i,a,o=[],s=-1,u=0,c=t.length;for(n instanceof Date||(n=new Date(+n));++s<c;)37===t.charCodeAt(s)&&(o.push(t.slice(u,s)),null!=(i=Gy[r=t.charAt(++s)])?r=t.charAt(++s):i="e"===r?" ":"0",(a=e[r])&&(r=a(n,i)),o.push(r),u=s+1);return o.push(t.slice(u,s)),o.join("")}}function k(t,e){return function(n){var r,i,a=qy(1900,void 0,1);if(E(a,t,n+="",0)!=n.length)return null;if("Q"in a)return new Date(a.Q);if("s"in a)return new Date(1e3*a.s+("L"in a?a.L:0));if(!e||"Z"in a||(a.Z=0),"p"in a&&(a.H=a.H%12+12*a.p),void 0===a.m&&(a.m="q"in a?a.q:0),"V"in a){if(a.V<1||a.V>53)return null;"w"in a||(a.w=1),"Z"in a?(i=(r=Fy(qy(a.y,0,1))).getUTCDay(),r=i>4||0===i?vy.ceil(r):vy(r),r=Iy.offset(r,7*(a.V-1)),a.y=r.getUTCFullYear(),a.m=r.getUTCMonth(),a.d=r.getUTCDate()+(a.w+6)%7):(i=(r=Py(qy(a.y,0,1))).getDay(),r=i>4||0===i?zg.ceil(r):zg(r),r=ny.offset(r,7*(a.V-1)),a.y=r.getFullYear(),a.m=r.getMonth(),a.d=r.getDate()+(a.w+6)%7)}else("W"in a||"U"in a)&&("w"in a||(a.w="u"in a?a.u%7:"W"in a?1:0),i="Z"in a?Fy(qy(a.y,0,1)).getUTCDay():Py(qy(a.y,0,1)).getDay(),a.m=0,a.d="W"in a?(a.w+6)%7+7*a.W-(i+5)%7:a.w+7*a.U-(i+6)%7);return"Z"in a?(a.H+=a.Z/100|0,a.M+=a.Z%100,Fy(a)):Py(a)}}function E(t,e,n,r){for(var i,a,o=0,s=e.length,u=n.length;o<s;){if(r>=u)return-1;if(37===(i=e.charCodeAt(o++))){if(i=e.charAt(o++),!(a=w[i in Gy?e.charAt(o++):i])||(r=a(t,n,r))<0)return-1}else if(i!=n.charCodeAt(r++))return-1}return r}return(m.x=x(n,m),m.X=x(r,m),m.c=x(e,m),_.x=x(n,_),_.X=x(r,_),_.c=x(e,_),{format:function(t){var e=x(t+="",m);return e.toString=function(){return t},e},parse:function(t){var e=k(t+="",!1);return e.toString=function(){return t},e},utcFormat:function(t){var e=x(t+="",_);return e.toString=function(){return t},e},utcParse:function(t){var e=k(t+="",!0);return e.toString=function(){return t},e}})}var Uy,zy,Yy,Vy,Hy,Gy={"-":"",_:" ",0:"0"},$y=/^\s*\d+/,Wy=/^%/,Ky=/[\\^$*+?|[\]().{}]/g;function Xy(t,e,n){var r=t<0?"-":"",i=(r?-t:t)+"",a=i.length;return r+(a<n?new Array(n-a+1).join(e)+i:i)}function Zy(t){return t.replace(Ky,"\\$&")}function Jy(t){return new RegExp("^(?:"+t.map(Zy).join("|")+")","i")}function Qy(t){for(var e={},n=-1,r=t.length;++n<r;)e[t[n].toLowerCase()]=n;return e}function tb(t,e,n){var r=$y.exec(e.slice(n,n+1));return r?(t.w=+r[0],n+r[0].length):-1}function eb(t,e,n){var r=$y.exec(e.slice(n,n+1));return r?(t.u=+r[0],n+r[0].length):-1}function nb(t,e,n){var r=$y.exec(e.slice(n,n+2));return r?(t.U=+r[0],n+r[0].length):-1}function rb(t,e,n){var r=$y.exec(e.slice(n,n+2));return r?(t.V=+r[0],n+r[0].length):-1}function ib(t,e,n){var r=$y.exec(e.slice(n,n+2));return r?(t.W=+r[0],n+r[0].length):-1}function ab(t,e,n){var r=$y.exec(e.slice(n,n+4));return r?(t.y=+r[0],n+r[0].length):-1}function ob(t,e,n){var r=$y.exec(e.slice(n,n+2));return r?(t.y=+r[0]+(+r[0]>68?1900:2e3),n+r[0].length):-1}function sb(t,e,n){var r=/^(Z)|([+-]\d\d)(?::?(\d\d))?/.exec(e.slice(n,n+6));return r?(t.Z=r[1]?0:-(r[2]+(r[3]||"00")),n+r[0].length):-1}function ub(t,e,n){var r=$y.exec(e.slice(n,n+1));return r?(t.q=3*r[0]-3,n+r[0].length):-1}function cb(t,e,n){var r=$y.exec(e.slice(n,n+2));return r?(t.m=r[0]-1,n+r[0].length):-1}function fb(t,e,n){var r=$y.exec(e.slice(n,n+2));return r?(t.d=+r[0],n+r[0].length):-1}function lb(t,e,n){var r=$y.exec(e.slice(n,n+3));return r?(t.m=0,t.d=+r[0],n+r[0].length):-1}function hb(t,e,n){var r=$y.exec(e.slice(n,n+2));return r?(t.H=+r[0],n+r[0].length):-1}function db(t,e,n){var r=$y.exec(e.slice(n,n+2));return r?(t.M=+r[0],n+r[0].length):-1}function pb(t,e,n){var r=$y.exec(e.slice(n,n+2));return r?(t.S=+r[0],n+r[0].length):-1}function gb(t,e,n){var r=$y.exec(e.slice(n,n+3));return r?(t.L=+r[0],n+r[0].length):-1}function yb(t,e,n){var r=$y.exec(e.slice(n,n+6));return r?(t.L=Math.floor(r[0]/1e3),n+r[0].length):-1}function bb(t,e,n){var r=Wy.exec(e.slice(n,n+1));return r?n+r[0].length:-1}function vb(t,e,n){var r=$y.exec(e.slice(n));return r?(t.Q=+r[0],n+r[0].length):-1}function mb(t,e,n){var r=$y.exec(e.slice(n));return r?(t.s=+r[0],n+r[0].length):-1}function _b(t,e){return Xy(t.getDate(),e,2)}function wb(t,e){return Xy(t.getHours(),e,2)}function xb(t,e){return Xy(t.getHours()%12||12,e,2)}function kb(t,e){return Xy(1+ny.count(Og(t),t),e,3)}function Eb(t,e){return Xy(t.getMilliseconds(),e,3)}function Ab(t,e){return Eb(t,e)+"000"}function Sb(t,e){return Xy(t.getMonth()+1,e,2)}function Mb(t,e){return Xy(t.getMinutes(),e,2)}function Tb(t,e){return Xy(t.getSeconds(),e,2)}function Db(t){var e=t.getDay();return 0===e?7:e}function Cb(t,e){return Xy(Ug.count(Og(t)-1,t),e,2)}function Nb(t,e){var n=t.getDay();return t=n>=4||0===n?Hg(t):Hg.ceil(t),Xy(Hg.count(Og(t),t)+(4===Og(t).getDay()),e,2)}function Ib(t){return t.getDay()}function Lb(t,e){return Xy(zg.count(Og(t)-1,t),e,2)}function Bb(t,e){return Xy(t.getFullYear()%100,e,2)}function Ob(t,e){return Xy(t.getFullYear()%1e4,e,4)}function Rb(t){var e=t.getTimezoneOffset();return(e>0?"-":(e*=-1,"+"))+Xy(e/60|0,"0",2)+Xy(e%60,"0",2)}function Pb(t,e){return Xy(t.getUTCDate(),e,2)}function Fb(t,e){return Xy(t.getUTCHours(),e,2)}function qb(t,e){return Xy(t.getUTCHours()%12||12,e,2)}function jb(t,e){return Xy(1+Iy.count(Oy(t),t),e,3)}function Ub(t,e){return Xy(t.getUTCMilliseconds(),e,3)}function zb(t,e){return Ub(t,e)+"000"}function Yb(t,e){return Xy(t.getUTCMonth()+1,e,2)}function Vb(t,e){return Xy(t.getUTCMinutes(),e,2)}function Hb(t,e){return Xy(t.getUTCSeconds(),e,2)}function Gb(t){var e=t.getUTCDay();return 0===e?7:e}function $b(t,e){return Xy(by.count(Oy(t)-1,t),e,2)}function Wb(t,e){var n=t.getUTCDay();return t=n>=4||0===n?wy(t):wy.ceil(t),Xy(wy.count(Oy(t),t)+(4===Oy(t).getUTCDay()),e,2)}function Kb(t){return t.getUTCDay()}function Xb(t,e){return Xy(vy.count(Oy(t)-1,t),e,2)}function Zb(t,e){return Xy(t.getUTCFullYear()%100,e,2)}function Jb(t,e){return Xy(t.getUTCFullYear()%1e4,e,4)}function Qb(){return"+0000"}function tv(){return"%"}function ev(t){return+t}function nv(t){return Math.floor(+t/1e3)}function rv(t){return Uy=jy(t),zy=Uy.format,Yy=Uy.parse,Vy=Uy.utcFormat,Hy=Uy.utcParse,Uy}rv({dateTime:"%x, %X",date:"%-m/%-d/%Y",time:"%-I:%M:%S %p",periods:["AM","PM"],days:["Sunday","Monday","Tuesday","Wednesday","Thursday","Friday","Saturday"],shortDays:["Sun","Mon","Tue","Wed","Thu","Fri","Sat"],months:["January","February","March","April","May","June","July","August","September","October","November","December"],shortMonths:["Jan","Feb","Mar","Apr","May","Jun","Jul","Aug","Sep","Oct","Nov","Dec"]});function iv(t){return new Date(t)}function av(t){return t instanceof Date?+t:+new Date(+t)}function ov(t,e,n,r,a,o,s,u,c){var f=ig(Zp,Zp),l=f.invert,h=f.domain,d=c(".%L"),p=c(":%S"),g=c("%I:%M"),y=c("%I %p"),b=c("%a %d"),v=c("%b %d"),m=c("%B"),_=c("%Y"),w=[[s,1,1e3],[s,5,5e3],[s,15,15e3],[s,30,3e4],[o,1,6e4],[o,5,3e5],[o,15,9e5],[o,30,18e5],[a,1,36e5],[a,3,108e5],[a,6,216e5],[a,12,432e5],[r,1,864e5],[r,2,1728e5],[n,1,6048e5],[e,1,2592e6],[e,3,7776e6],[t,1,31536e6]];function x(i){return(s(i)<i?d:o(i)<i?p:a(i)<i?g:r(i)<i?y:e(i)<i?n(i)<i?b:v:t(i)<i?m:_)(i)}function k(e,n,r,a){if(null==e&&(e=10),"number"==typeof e){var o=Math.abs(r-n)/e,s=i((function(t){return t[2]})).right(w,o);s===w.length?(a=T(n/31536e6,r/31536e6,e),e=t):s?(a=(s=w[o/w[s-1][2]<w[s][2]/o?s-1:s])[1],e=s[0]):(a=Math.max(T(n,r,e),1),e=u)}return null==a?e:e.every(a)}return f.invert=function(t){return new Date(l(t))},f.domain=function(t){return arguments.length?h(zp.call(t,av)):h().map(iv)},f.ticks=function(t,e){var n,r=h(),i=r[0],a=r[r.length-1],o=a<i;return o&&(n=i,i=a,a=n),n=(n=k(t,i,a,e))?n.range(i,a+1):[],o?n.reverse():n},f.tickFormat=function(t,e){return null==e?x:c(e)},f.nice=function(t,e){var n=h();return(t=k(t,n[0],n[n.length-1],e))?h(cg(n,t)):f},f.copy=function(){return ng(f,ov(t,e,n,r,a,o,s,u,c))},f}var sv=function(){return qp.apply(ov(Og,Fg,Ug,ny,ay,uy,ly,py,zy).domain([new Date(2e3,0,1),new Date(2e3,0,2)]),arguments)},uv=Lg((function(t){t.setUTCDate(1),t.setUTCHours(0,0,0,0)}),(function(t,e){t.setUTCMonth(t.getUTCMonth()+e)}),(function(t,e){return e.getUTCMonth()-t.getUTCMonth()+12*(e.getUTCFullYear()-t.getUTCFullYear())}),(function(t){return t.getUTCMonth()})),cv=uv,fv=uv.range,lv=Lg((function(t){t.setUTCMinutes(0,0,0)}),(function(t,e){t.setTime(+t+36e5*e)}),(function(t,e){return(e-t)/36e5}),(function(t){return t.getUTCHours()})),hv=lv,dv=lv.range,pv=Lg((function(t){t.setUTCSeconds(0,0)}),(function(t,e){t.setTime(+t+6e4*e)}),(function(t,e){return(e-t)/6e4}),(function(t){return t.getUTCMinutes()})),gv=pv,yv=pv.range,bv=function(){return qp.apply(ov(Oy,cv,by,Iy,hv,gv,ly,py,Vy).domain([Date.UTC(2e3,0,1),Date.UTC(2e3,0,2)]),arguments)};function vv(){var t,e,n,r,i,a=0,o=1,s=Zp,u=!1;function c(e){return isNaN(e=+e)?i:s(0===n?.5:(e=(r(e)-t)*n,u?Math.max(0,Math.min(1,e)):e))}return c.domain=function(i){return arguments.length?(t=r(a=+i[0]),e=r(o=+i[1]),n=t===e?0:1/(e-t),c):[a,o]},c.clamp=function(t){return arguments.length?(u=!!t,c):u},c.interpolator=function(t){return arguments.length?(s=t,c):s},c.unknown=function(t){return arguments.length?(i=t,c):i},function(i){return r=i,t=i(a),e=i(o),n=t===e?0:1/(e-t),c}}function mv(t,e){return e.domain(t.domain()).interpolator(t.interpolator()).clamp(t.clamp()).unknown(t.unknown())}function _v(){var t=og(vv()(Zp));return t.copy=function(){return mv(t,_v())},jp.apply(t,arguments)}function wv(){var t=yg(vv()).domain([1,10]);return t.copy=function(){return mv(t,wv()).base(t.base())},jp.apply(t,arguments)}function xv(){var t=_g(vv());return t.copy=function(){return mv(t,xv()).constant(t.constant())},jp.apply(t,arguments)}function kv(){var t=Ag(vv());return t.copy=function(){return mv(t,kv()).exponent(t.exponent())},jp.apply(t,arguments)}function Ev(){return kv.apply(null,arguments).exponent(.5)}function Av(){var t=[],e=Zp;function n(n){if(!isNaN(n=+n))return e((u(t,n)-1)/(t.length-1))}return n.domain=function(e){if(!arguments.length)return t.slice();t=[];for(var i,a=0,o=e.length;a<o;++a)null==(i=e[a])||isNaN(i=+i)||t.push(i);return t.sort(r),n},n.interpolator=function(t){return arguments.length?(e=t,n):e},n.copy=function(){return Av(e).domain(t)},jp.apply(n,arguments)}function Sv(){var t,e,n,r,i,a,o,s=0,u=.5,c=1,f=Zp,l=!1;function h(t){return isNaN(t=+t)?o:(t=.5+((t=+a(t))-e)*(t<e?r:i),f(l?Math.max(0,Math.min(1,t)):t))}return h.domain=function(o){return arguments.length?(t=a(s=+o[0]),e=a(u=+o[1]),n=a(c=+o[2]),r=t===e?0:.5/(e-t),i=e===n?0:.5/(n-e),h):[s,u,c]},h.clamp=function(t){return arguments.length?(l=!!t,h):l},h.interpolator=function(t){return arguments.length?(f=t,h):f},h.unknown=function(t){return arguments.length?(o=t,h):o},function(o){return a=o,t=o(s),e=o(u),n=o(c),r=t===e?0:.5/(e-t),i=e===n?0:.5/(n-e),h}}function Mv(){var t=og(Sv()(Zp));return t.copy=function(){return mv(t,Mv())},jp.apply(t,arguments)}function Tv(){var t=yg(Sv()).domain([.1,1,10]);return t.copy=function(){return mv(t,Tv()).base(t.base())},jp.apply(t,arguments)}function Dv(){var t=_g(Sv());return t.copy=function(){return mv(t,Dv()).constant(t.constant())},jp.apply(t,arguments)}function Cv(){var t=Ag(Sv());return t.copy=function(){return mv(t,Cv()).exponent(t.exponent())},jp.apply(t,arguments)}function Nv(){return Cv.apply(null,arguments).exponent(.5)}var Iv=function(t){for(var e=t.length/6|0,n=new Array(e),r=0;r<e;)n[r]="#"+t.slice(6*r,6*++r);return n},Lv=Iv("1f77b4ff7f0e2ca02cd627289467bd8c564be377c27f7f7fbcbd2217becf"),Bv=Iv("7fc97fbeaed4fdc086ffff99386cb0f0027fbf5b17666666"),Ov=Iv("1b9e77d95f027570b3e7298a66a61ee6ab02a6761d666666"),Rv=Iv("a6cee31f78b4b2df8a33a02cfb9a99e31a1cfdbf6fff7f00cab2d66a3d9affff99b15928"),Pv=Iv("fbb4aeb3cde3ccebc5decbe4fed9a6ffffcce5d8bdfddaecf2f2f2"),Fv=Iv("b3e2cdfdcdaccbd5e8f4cae4e6f5c9fff2aef1e2cccccccc"),qv=Iv("e41a1c377eb84daf4a984ea3ff7f00ffff33a65628f781bf999999"),jv=Iv("66c2a5fc8d628da0cbe78ac3a6d854ffd92fe5c494b3b3b3"),Uv=Iv("8dd3c7ffffb3bebadafb807280b1d3fdb462b3de69fccde5d9d9d9bc80bdccebc5ffed6f"),zv=Iv("4e79a7f28e2ce1575976b7b259a14fedc949af7aa1ff9da79c755fbab0ab"),Yv=function(t){return pn(t[t.length-1])},Vv=new Array(3).concat("d8b365f5f5f55ab4ac","a6611adfc27d80cdc1018571","a6611adfc27df5f5f580cdc1018571","8c510ad8b365f6e8c3c7eae55ab4ac01665e","8c510ad8b365f6e8c3f5f5f5c7eae55ab4ac01665e","8c510abf812ddfc27df6e8c3c7eae580cdc135978f01665e","8c510abf812ddfc27df6e8c3f5f5f5c7eae580cdc135978f01665e","5430058c510abf812ddfc27df6e8c3c7eae580cdc135978f01665e003c30","5430058c510abf812ddfc27df6e8c3f5f5f5c7eae580cdc135978f01665e003c30").map(Iv),Hv=Yv(Vv),Gv=new Array(3).concat("af8dc3f7f7f77fbf7b","7b3294c2a5cfa6dba0008837","7b3294c2a5cff7f7f7a6dba0008837","762a83af8dc3e7d4e8d9f0d37fbf7b1b7837","762a83af8dc3e7d4e8f7f7f7d9f0d37fbf7b1b7837","762a839970abc2a5cfe7d4e8d9f0d3a6dba05aae611b7837","762a839970abc2a5cfe7d4e8f7f7f7d9f0d3a6dba05aae611b7837","40004b762a839970abc2a5cfe7d4e8d9f0d3a6dba05aae611b783700441b","40004b762a839970abc2a5cfe7d4e8f7f7f7d9f0d3a6dba05aae611b783700441b").map(Iv),$v=Yv(Gv),Wv=new Array(3).concat("e9a3c9f7f7f7a1d76a","d01c8bf1b6dab8e1864dac26","d01c8bf1b6daf7f7f7b8e1864dac26","c51b7de9a3c9fde0efe6f5d0a1d76a4d9221","c51b7de9a3c9fde0eff7f7f7e6f5d0a1d76a4d9221","c51b7dde77aef1b6dafde0efe6f5d0b8e1867fbc414d9221","c51b7dde77aef1b6dafde0eff7f7f7e6f5d0b8e1867fbc414d9221","8e0152c51b7dde77aef1b6dafde0efe6f5d0b8e1867fbc414d9221276419","8e0152c51b7dde77aef1b6dafde0eff7f7f7e6f5d0b8e1867fbc414d9221276419").map(Iv),Kv=Yv(Wv),Xv=new Array(3).concat("998ec3f7f7f7f1a340","5e3c99b2abd2fdb863e66101","5e3c99b2abd2f7f7f7fdb863e66101","542788998ec3d8daebfee0b6f1a340b35806","542788998ec3d8daebf7f7f7fee0b6f1a340b35806","5427888073acb2abd2d8daebfee0b6fdb863e08214b35806","5427888073acb2abd2d8daebf7f7f7fee0b6fdb863e08214b35806","2d004b5427888073acb2abd2d8daebfee0b6fdb863e08214b358067f3b08","2d004b5427888073acb2abd2d8daebf7f7f7fee0b6fdb863e08214b358067f3b08").map(Iv),Zv=Yv(Xv),Jv=new Array(3).concat("ef8a62f7f7f767a9cf","ca0020f4a58292c5de0571b0","ca0020f4a582f7f7f792c5de0571b0","b2182bef8a62fddbc7d1e5f067a9cf2166ac","b2182bef8a62fddbc7f7f7f7d1e5f067a9cf2166ac","b2182bd6604df4a582fddbc7d1e5f092c5de4393c32166ac","b2182bd6604df4a582fddbc7f7f7f7d1e5f092c5de4393c32166ac","67001fb2182bd6604df4a582fddbc7d1e5f092c5de4393c32166ac053061","67001fb2182bd6604df4a582fddbc7f7f7f7d1e5f092c5de4393c32166ac053061").map(Iv),Qv=Yv(Jv),tm=new Array(3).concat("ef8a62ffffff999999","ca0020f4a582bababa404040","ca0020f4a582ffffffbababa404040","b2182bef8a62fddbc7e0e0e09999994d4d4d","b2182bef8a62fddbc7ffffffe0e0e09999994d4d4d","b2182bd6604df4a582fddbc7e0e0e0bababa8787874d4d4d","b2182bd6604df4a582fddbc7ffffffe0e0e0bababa8787874d4d4d","67001fb2182bd6604df4a582fddbc7e0e0e0bababa8787874d4d4d1a1a1a","67001fb2182bd6604df4a582fddbc7ffffffe0e0e0bababa8787874d4d4d1a1a1a").map(Iv),em=Yv(tm),nm=new Array(3).concat("fc8d59ffffbf91bfdb","d7191cfdae61abd9e92c7bb6","d7191cfdae61ffffbfabd9e92c7bb6","d73027fc8d59fee090e0f3f891bfdb4575b4","d73027fc8d59fee090ffffbfe0f3f891bfdb4575b4","d73027f46d43fdae61fee090e0f3f8abd9e974add14575b4","d73027f46d43fdae61fee090ffffbfe0f3f8abd9e974add14575b4","a50026d73027f46d43fdae61fee090e0f3f8abd9e974add14575b4313695","a50026d73027f46d43fdae61fee090ffffbfe0f3f8abd9e974add14575b4313695").map(Iv),rm=Yv(nm),im=new Array(3).concat("fc8d59ffffbf91cf60","d7191cfdae61a6d96a1a9641","d7191cfdae61ffffbfa6d96a1a9641","d73027fc8d59fee08bd9ef8b91cf601a9850","d73027fc8d59fee08bffffbfd9ef8b91cf601a9850","d73027f46d43fdae61fee08bd9ef8ba6d96a66bd631a9850","d73027f46d43fdae61fee08bffffbfd9ef8ba6d96a66bd631a9850","a50026d73027f46d43fdae61fee08bd9ef8ba6d96a66bd631a9850006837","a50026d73027f46d43fdae61fee08bffffbfd9ef8ba6d96a66bd631a9850006837").map(Iv),am=Yv(im),om=new Array(3).concat("fc8d59ffffbf99d594","d7191cfdae61abdda42b83ba","d7191cfdae61ffffbfabdda42b83ba","d53e4ffc8d59fee08be6f59899d5943288bd","d53e4ffc8d59fee08bffffbfe6f59899d5943288bd","d53e4ff46d43fdae61fee08be6f598abdda466c2a53288bd","d53e4ff46d43fdae61fee08bffffbfe6f598abdda466c2a53288bd","9e0142d53e4ff46d43fdae61fee08be6f598abdda466c2a53288bd5e4fa2","9e0142d53e4ff46d43fdae61fee08bffffbfe6f598abdda466c2a53288bd5e4fa2").map(Iv),sm=Yv(om),um=new Array(3).concat("e5f5f999d8c92ca25f","edf8fbb2e2e266c2a4238b45","edf8fbb2e2e266c2a42ca25f006d2c","edf8fbccece699d8c966c2a42ca25f006d2c","edf8fbccece699d8c966c2a441ae76238b45005824","f7fcfde5f5f9ccece699d8c966c2a441ae76238b45005824","f7fcfde5f5f9ccece699d8c966c2a441ae76238b45006d2c00441b").map(Iv),cm=Yv(um),fm=new Array(3).concat("e0ecf49ebcda8856a7","edf8fbb3cde38c96c688419d","edf8fbb3cde38c96c68856a7810f7c","edf8fbbfd3e69ebcda8c96c68856a7810f7c","edf8fbbfd3e69ebcda8c96c68c6bb188419d6e016b","f7fcfde0ecf4bfd3e69ebcda8c96c68c6bb188419d6e016b","f7fcfde0ecf4bfd3e69ebcda8c96c68c6bb188419d810f7c4d004b").map(Iv),lm=Yv(fm),hm=new Array(3).concat("e0f3dba8ddb543a2ca","f0f9e8bae4bc7bccc42b8cbe","f0f9e8bae4bc7bccc443a2ca0868ac","f0f9e8ccebc5a8ddb57bccc443a2ca0868ac","f0f9e8ccebc5a8ddb57bccc44eb3d32b8cbe08589e","f7fcf0e0f3dbccebc5a8ddb57bccc44eb3d32b8cbe08589e","f7fcf0e0f3dbccebc5a8ddb57bccc44eb3d32b8cbe0868ac084081").map(Iv),dm=Yv(hm),pm=new Array(3).concat("fee8c8fdbb84e34a33","fef0d9fdcc8afc8d59d7301f","fef0d9fdcc8afc8d59e34a33b30000","fef0d9fdd49efdbb84fc8d59e34a33b30000","fef0d9fdd49efdbb84fc8d59ef6548d7301f990000","fff7ecfee8c8fdd49efdbb84fc8d59ef6548d7301f990000","fff7ecfee8c8fdd49efdbb84fc8d59ef6548d7301fb300007f0000").map(Iv),gm=Yv(pm),ym=new Array(3).concat("ece2f0a6bddb1c9099","f6eff7bdc9e167a9cf02818a","f6eff7bdc9e167a9cf1c9099016c59","f6eff7d0d1e6a6bddb67a9cf1c9099016c59","f6eff7d0d1e6a6bddb67a9cf3690c002818a016450","fff7fbece2f0d0d1e6a6bddb67a9cf3690c002818a016450","fff7fbece2f0d0d1e6a6bddb67a9cf3690c002818a016c59014636").map(Iv),bm=Yv(ym),vm=new Array(3).concat("ece7f2a6bddb2b8cbe","f1eef6bdc9e174a9cf0570b0","f1eef6bdc9e174a9cf2b8cbe045a8d","f1eef6d0d1e6a6bddb74a9cf2b8cbe045a8d","f1eef6d0d1e6a6bddb74a9cf3690c00570b0034e7b","fff7fbece7f2d0d1e6a6bddb74a9cf3690c00570b0034e7b","fff7fbece7f2d0d1e6a6bddb74a9cf3690c00570b0045a8d023858").map(Iv),mm=Yv(vm),_m=new Array(3).concat("e7e1efc994c7dd1c77","f1eef6d7b5d8df65b0ce1256","f1eef6d7b5d8df65b0dd1c77980043","f1eef6d4b9dac994c7df65b0dd1c77980043","f1eef6d4b9dac994c7df65b0e7298ace125691003f","f7f4f9e7e1efd4b9dac994c7df65b0e7298ace125691003f","f7f4f9e7e1efd4b9dac994c7df65b0e7298ace125698004367001f").map(Iv),wm=Yv(_m),xm=new Array(3).concat("fde0ddfa9fb5c51b8a","feebe2fbb4b9f768a1ae017e","feebe2fbb4b9f768a1c51b8a7a0177","feebe2fcc5c0fa9fb5f768a1c51b8a7a0177","feebe2fcc5c0fa9fb5f768a1dd3497ae017e7a0177","fff7f3fde0ddfcc5c0fa9fb5f768a1dd3497ae017e7a0177","fff7f3fde0ddfcc5c0fa9fb5f768a1dd3497ae017e7a017749006a").map(Iv),km=Yv(xm),Em=new Array(3).concat("edf8b17fcdbb2c7fb8","ffffcca1dab441b6c4225ea8","ffffcca1dab441b6c42c7fb8253494","ffffccc7e9b47fcdbb41b6c42c7fb8253494","ffffccc7e9b47fcdbb41b6c41d91c0225ea80c2c84","ffffd9edf8b1c7e9b47fcdbb41b6c41d91c0225ea80c2c84","ffffd9edf8b1c7e9b47fcdbb41b6c41d91c0225ea8253494081d58").map(Iv),Am=Yv(Em),Sm=new Array(3).concat("f7fcb9addd8e31a354","ffffccc2e69978c679238443","ffffccc2e69978c67931a354006837","ffffccd9f0a3addd8e78c67931a354006837","ffffccd9f0a3addd8e78c67941ab5d238443005a32","ffffe5f7fcb9d9f0a3addd8e78c67941ab5d238443005a32","ffffe5f7fcb9d9f0a3addd8e78c67941ab5d238443006837004529").map(Iv),Mm=Yv(Sm),Tm=new Array(3).concat("fff7bcfec44fd95f0e","ffffd4fed98efe9929cc4c02","ffffd4fed98efe9929d95f0e993404","ffffd4fee391fec44ffe9929d95f0e993404","ffffd4fee391fec44ffe9929ec7014cc4c028c2d04","ffffe5fff7bcfee391fec44ffe9929ec7014cc4c028c2d04","ffffe5fff7bcfee391fec44ffe9929ec7014cc4c02993404662506").map(Iv),Dm=Yv(Tm),Cm=new Array(3).concat("ffeda0feb24cf03b20","ffffb2fecc5cfd8d3ce31a1c","ffffb2fecc5cfd8d3cf03b20bd0026","ffffb2fed976feb24cfd8d3cf03b20bd0026","ffffb2fed976feb24cfd8d3cfc4e2ae31a1cb10026","ffffccffeda0fed976feb24cfd8d3cfc4e2ae31a1cb10026","ffffccffeda0fed976feb24cfd8d3cfc4e2ae31a1cbd0026800026").map(Iv),Nm=Yv(Cm),Im=new Array(3).concat("deebf79ecae13182bd","eff3ffbdd7e76baed62171b5","eff3ffbdd7e76baed63182bd08519c","eff3ffc6dbef9ecae16baed63182bd08519c","eff3ffc6dbef9ecae16baed64292c62171b5084594","f7fbffdeebf7c6dbef9ecae16baed64292c62171b5084594","f7fbffdeebf7c6dbef9ecae16baed64292c62171b508519c08306b").map(Iv),Lm=Yv(Im),Bm=new Array(3).concat("e5f5e0a1d99b31a354","edf8e9bae4b374c476238b45","edf8e9bae4b374c47631a354006d2c","edf8e9c7e9c0a1d99b74c47631a354006d2c","edf8e9c7e9c0a1d99b74c47641ab5d238b45005a32","f7fcf5e5f5e0c7e9c0a1d99b74c47641ab5d238b45005a32","f7fcf5e5f5e0c7e9c0a1d99b74c47641ab5d238b45006d2c00441b").map(Iv),Om=Yv(Bm),Rm=new Array(3).concat("f0f0f0bdbdbd636363","f7f7f7cccccc969696525252","f7f7f7cccccc969696636363252525","f7f7f7d9d9d9bdbdbd969696636363252525","f7f7f7d9d9d9bdbdbd969696737373525252252525","fffffff0f0f0d9d9d9bdbdbd969696737373525252252525","fffffff0f0f0d9d9d9bdbdbd969696737373525252252525000000").map(Iv),Pm=Yv(Rm),Fm=new Array(3).concat("efedf5bcbddc756bb1","f2f0f7cbc9e29e9ac86a51a3","f2f0f7cbc9e29e9ac8756bb154278f","f2f0f7dadaebbcbddc9e9ac8756bb154278f","f2f0f7dadaebbcbddc9e9ac8807dba6a51a34a1486","fcfbfdefedf5dadaebbcbddc9e9ac8807dba6a51a34a1486","fcfbfdefedf5dadaebbcbddc9e9ac8807dba6a51a354278f3f007d").map(Iv),qm=Yv(Fm),jm=new Array(3).concat("fee0d2fc9272de2d26","fee5d9fcae91fb6a4acb181d","fee5d9fcae91fb6a4ade2d26a50f15","fee5d9fcbba1fc9272fb6a4ade2d26a50f15","fee5d9fcbba1fc9272fb6a4aef3b2ccb181d99000d","fff5f0fee0d2fcbba1fc9272fb6a4aef3b2ccb181d99000d","fff5f0fee0d2fcbba1fc9272fb6a4aef3b2ccb181da50f1567000d").map(Iv),Um=Yv(jm),zm=new Array(3).concat("fee6cefdae6be6550d","feeddefdbe85fd8d3cd94701","feeddefdbe85fd8d3ce6550da63603","feeddefdd0a2fdae6bfd8d3ce6550da63603","feeddefdd0a2fdae6bfd8d3cf16913d948018c2d04","fff5ebfee6cefdd0a2fdae6bfd8d3cf16913d948018c2d04","fff5ebfee6cefdd0a2fdae6bfd8d3cf16913d94801a636037f2704").map(Iv),Ym=Yv(zm),Vm=function(t){return t=Math.max(0,Math.min(1,t)),"rgb("+Math.max(0,Math.min(255,Math.round(-4.54-t*(35.34-t*(2381.73-t*(6402.7-t*(7024.72-2710.57*t)))))))+", "+Math.max(0,Math.min(255,Math.round(32.49+t*(170.73+t*(52.82-t*(131.46-t*(176.58-67.37*t)))))))+", "+Math.max(0,Math.min(255,Math.round(81.24+t*(442.36-t*(2482.43-t*(6167.24-t*(6614.94-2475.67*t)))))))+")"},Hm=xp(Ca(300,.5,0),Ca(-240,.5,1)),Gm=xp(Ca(-100,.75,.35),Ca(80,1.5,.8)),$m=xp(Ca(260,.75,.35),Ca(80,1.5,.8)),Wm=Ca(),Km=function(t){(t<0||t>1)&&(t-=Math.floor(t));var e=Math.abs(t-.5);return Wm.h=360*t-100,Wm.s=1.5-1.5*e,Wm.l=.8-.9*e,Wm+""},Xm=$e(),Zm=Math.PI/3,Jm=2*Math.PI/3,Qm=function(t){var e;return t=(.5-t)*Math.PI,Xm.r=255*(e=Math.sin(t))*e,Xm.g=255*(e=Math.sin(t+Zm))*e,Xm.b=255*(e=Math.sin(t+Jm))*e,Xm+""},t_=function(t){return t=Math.max(0,Math.min(1,t)),"rgb("+Math.max(0,Math.min(255,Math.round(34.61+t*(1172.33-t*(10793.56-t*(33300.12-t*(38394.49-14825.05*t)))))))+", "+Math.max(0,Math.min(255,Math.round(23.31+t*(557.33+t*(1225.33-t*(3574.96-t*(1073.77+707.56*t)))))))+", "+Math.max(0,Math.min(255,Math.round(27.2+t*(3211.1-t*(15327.97-t*(27814-t*(22569.18-6838.66*t)))))))+")"};function e_(t){var e=t.length;return function(n){return t[Math.max(0,Math.min(e-1,Math.floor(n*e)))]}}var n_=e_(Iv("44015444025645045745055946075a46085c460a5d460b5e470d60470e6147106347116447136548146748166848176948186a481a6c481b6d481c6e481d6f481f70482071482173482374482475482576482677482878482979472a7a472c7a472d7b472e7c472f7d46307e46327e46337f463480453581453781453882443983443a83443b84433d84433e85423f854240864241864142874144874045884046883f47883f48893e49893e4a893e4c8a3d4d8a3d4e8a3c4f8a3c508b3b518b3b528b3a538b3a548c39558c39568c38588c38598c375a8c375b8d365c8d365d8d355e8d355f8d34608d34618d33628d33638d32648e32658e31668e31678e31688e30698e306a8e2f6b8e2f6c8e2e6d8e2e6e8e2e6f8e2d708e2d718e2c718e2c728e2c738e2b748e2b758e2a768e2a778e2a788e29798e297a8e297b8e287c8e287d8e277e8e277f8e27808e26818e26828e26828e25838e25848e25858e24868e24878e23888e23898e238a8d228b8d228c8d228d8d218e8d218f8d21908d21918c20928c20928c20938c1f948c1f958b1f968b1f978b1f988b1f998a1f9a8a1e9b8a1e9c891e9d891f9e891f9f881fa0881fa1881fa1871fa28720a38620a48621a58521a68522a78522a88423a98324aa8325ab8225ac8226ad8127ad8128ae8029af7f2ab07f2cb17e2db27d2eb37c2fb47c31b57b32b67a34b67935b77937b87838b9773aba763bbb753dbc743fbc7340bd7242be7144bf7046c06f48c16e4ac16d4cc26c4ec36b50c46a52c56954c56856c66758c7655ac8645cc8635ec96260ca6063cb5f65cb5e67cc5c69cd5b6ccd5a6ece5870cf5773d05675d05477d1537ad1517cd2507fd34e81d34d84d44b86d54989d5488bd6468ed64590d74393d74195d84098d83e9bd93c9dd93ba0da39a2da37a5db36a8db34aadc32addc30b0dd2fb2dd2db5de2bb8de29bade28bddf26c0df25c2df23c5e021c8e020cae11fcde11dd0e11cd2e21bd5e21ad8e219dae319dde318dfe318e2e418e5e419e7e419eae51aece51befe51cf1e51df4e61ef6e620f8e621fbe723fde725")),r_=e_(Iv("00000401000501010601010802010902020b02020d03030f03031204041405041606051806051a07061c08071e0907200a08220b09240c09260d0a290e0b2b100b2d110c2f120d31130d34140e36150e38160f3b180f3d19103f1a10421c10441d11471e114920114b21114e22115024125325125527125829115a2a115c2c115f2d11612f116331116533106734106936106b38106c390f6e3b0f703d0f713f0f72400f74420f75440f764510774710784910784a10794c117a4e117b4f127b51127c52137c54137d56147d57157e59157e5a167e5c167f5d177f5f187f601880621980641a80651a80671b80681c816a1c816b1d816d1d816e1e81701f81721f817320817521817621817822817922827b23827c23827e24828025828125818326818426818627818827818928818b29818c29818e2a81902a81912b81932b80942c80962c80982d80992d809b2e7f9c2e7f9e2f7fa02f7fa1307ea3307ea5317ea6317da8327daa337dab337cad347cae347bb0357bb2357bb3367ab5367ab73779b83779ba3878bc3978bd3977bf3a77c03a76c23b75c43c75c53c74c73d73c83e73ca3e72cc3f71cd4071cf4070d0416fd2426fd3436ed5446dd6456cd8456cd9466bdb476adc4869de4968df4a68e04c67e24d66e34e65e44f64e55064e75263e85362e95462ea5661eb5760ec5860ed5a5fee5b5eef5d5ef05f5ef1605df2625df2645cf3655cf4675cf4695cf56b5cf66c5cf66e5cf7705cf7725cf8745cf8765cf9785df9795df97b5dfa7d5efa7f5efa815ffb835ffb8560fb8761fc8961fc8a62fc8c63fc8e64fc9065fd9266fd9467fd9668fd9869fd9a6afd9b6bfe9d6cfe9f6dfea16efea36ffea571fea772fea973feaa74feac76feae77feb078feb27afeb47bfeb67cfeb77efeb97ffebb81febd82febf84fec185fec287fec488fec68afec88cfeca8dfecc8ffecd90fecf92fed194fed395fed597fed799fed89afdda9cfddc9efddea0fde0a1fde2a3fde3a5fde5a7fde7a9fde9aafdebacfcecaefceeb0fcf0b2fcf2b4fcf4b6fcf6b8fcf7b9fcf9bbfcfbbdfcfdbf")),i_=e_(Iv("00000401000501010601010802010a02020c02020e03021004031204031405041706041907051b08051d09061f0a07220b07240c08260d08290e092b10092d110a30120a32140b34150b37160b39180c3c190c3e1b0c411c0c431e0c451f0c48210c4a230c4c240c4f260c51280b53290b552b0b572d0b592f0a5b310a5c320a5e340a5f3609613809623909633b09643d09653e0966400a67420a68440a68450a69470b6a490b6a4a0c6b4c0c6b4d0d6c4f0d6c510e6c520e6d540f6d550f6d57106e59106e5a116e5c126e5d126e5f136e61136e62146e64156e65156e67166e69166e6a176e6c186e6d186e6f196e71196e721a6e741a6e751b6e771c6d781c6d7a1d6d7c1d6d7d1e6d7f1e6c801f6c82206c84206b85216b87216b88226a8a226a8c23698d23698f24699025689225689326679526679727669827669a28659b29649d29649f2a63a02a63a22b62a32c61a52c60a62d60a82e5fa92e5eab2f5ead305dae305cb0315bb1325ab3325ab43359b63458b73557b93556ba3655bc3754bd3853bf3952c03a51c13a50c33b4fc43c4ec63d4dc73e4cc83f4bca404acb4149cc4248ce4347cf4446d04545d24644d34743d44842d54a41d74b3fd84c3ed94d3dda4e3cdb503bdd513ade5238df5337e05536e15635e25734e35933e45a31e55c30e65d2fe75e2ee8602de9612bea632aeb6429eb6628ec6726ed6925ee6a24ef6c23ef6e21f06f20f1711ff1731df2741cf3761bf37819f47918f57b17f57d15f67e14f68013f78212f78410f8850ff8870ef8890cf98b0bf98c0af98e09fa9008fa9207fa9407fb9606fb9706fb9906fb9b06fb9d07fc9f07fca108fca309fca50afca60cfca80dfcaa0ffcac11fcae12fcb014fcb216fcb418fbb61afbb81dfbba1ffbbc21fbbe23fac026fac228fac42afac62df9c72ff9c932f9cb35f8cd37f8cf3af7d13df7d340f6d543f6d746f5d949f5db4cf4dd4ff4df53f4e156f3e35af3e55df2e661f2e865f2ea69f1ec6df1ed71f1ef75f1f179f2f27df2f482f3f586f3f68af4f88ef5f992f6fa96f8fb9af9fc9dfafda1fcffa4")),a_=e_(Iv("0d088710078813078916078a19068c1b068d1d068e20068f2206902406912605912805922a05932c05942e05952f059631059733059735049837049938049a3a049a3c049b3e049c3f049c41049d43039e44039e46039f48039f4903a04b03a14c02a14e02a25002a25102a35302a35502a45601a45801a45901a55b01a55c01a65e01a66001a66100a76300a76400a76600a76700a86900a86a00a86c00a86e00a86f00a87100a87201a87401a87501a87701a87801a87a02a87b02a87d03a87e03a88004a88104a78305a78405a78606a68707a68808a68a09a58b0aa58d0ba58e0ca48f0da4910ea3920fa39410a29511a19613a19814a099159f9a169f9c179e9d189d9e199da01a9ca11b9ba21d9aa31e9aa51f99a62098a72197a82296aa2395ab2494ac2694ad2793ae2892b02991b12a90b22b8fb32c8eb42e8db52f8cb6308bb7318ab83289ba3388bb3488bc3587bd3786be3885bf3984c03a83c13b82c23c81c33d80c43e7fc5407ec6417dc7427cc8437bc9447aca457acb4679cc4778cc4977cd4a76ce4b75cf4c74d04d73d14e72d24f71d35171d45270d5536fd5546ed6556dd7566cd8576bd9586ada5a6ada5b69db5c68dc5d67dd5e66de5f65de6164df6263e06363e16462e26561e26660e3685fe4695ee56a5de56b5de66c5ce76e5be76f5ae87059e97158e97257ea7457eb7556eb7655ec7754ed7953ed7a52ee7b51ef7c51ef7e50f07f4ff0804ef1814df1834cf2844bf3854bf3874af48849f48948f58b47f58c46f68d45f68f44f79044f79143f79342f89441f89540f9973ff9983ef99a3efa9b3dfa9c3cfa9e3bfb9f3afba139fba238fca338fca537fca636fca835fca934fdab33fdac33fdae32fdaf31fdb130fdb22ffdb42ffdb52efeb72dfeb82cfeba2cfebb2bfebd2afebe2afec029fdc229fdc328fdc527fdc627fdc827fdca26fdcb26fccd25fcce25fcd025fcd225fbd324fbd524fbd724fad824fada24f9dc24f9dd25f8df25f8e125f7e225f7e425f6e626f6e826f5e926f5eb27f4ed27f3ee27f3f027f2f227f1f426f1f525f0f724f0f921")),o_=function(t){return xe(ne(t).call(document.documentElement))},s_=0;function u_(){return new c_}function c_(){this._="@"+(++s_).toString(36)}c_.prototype=u_.prototype={constructor:c_,get:function(t){for(var e=this._;!(e in t);)if(!(t=t.parentNode))return;return t[e]},set:function(t,e){return t[this._]=e},remove:function(t){return this._ in t&&delete t[this._]},toString:function(){return this._}};var f_=function(t){return"string"==typeof t?new me([document.querySelectorAll(t)],[document.documentElement]):new me([null==t?[]:t],ve)},l_=function(t,e){null==e&&(e=Dn().touches);for(var n=0,r=e?e.length:0,i=new Array(r);n<r;++n)i[n]=Cn(t,e[n]);return i},h_=function(t){return function(){return t}},d_=Math.abs,p_=Math.atan2,g_=Math.cos,y_=Math.max,b_=Math.min,v_=Math.sin,m_=Math.sqrt,__=Math.PI,w_=__/2,x_=2*__;function k_(t){return t>1?0:t<-1?__:Math.acos(t)}function E_(t){return t>=1?w_:t<=-1?-w_:Math.asin(t)}function A_(t){return t.innerRadius}function S_(t){return t.outerRadius}function M_(t){return t.startAngle}function T_(t){return t.endAngle}function D_(t){return t&&t.padAngle}function C_(t,e,n,r,i,a,o,s){var u=n-t,c=r-e,f=o-i,l=s-a,h=l*u-f*c;if(!(h*h<1e-12))return[t+(h=(f*(e-a)-l*(t-i))/h)*u,e+h*c]}function N_(t,e,n,r,i,a,o){var s=t-n,u=e-r,c=(o?a:-a)/m_(s*s+u*u),f=c*u,l=-c*s,h=t+f,d=e+l,p=n+f,g=r+l,y=(h+p)/2,b=(d+g)/2,v=p-h,m=g-d,_=v*v+m*m,w=i-a,x=h*g-p*d,k=(m<0?-1:1)*m_(y_(0,w*w*_-x*x)),E=(x*m-v*k)/_,A=(-x*v-m*k)/_,S=(x*m+v*k)/_,M=(-x*v+m*k)/_,T=E-y,D=A-b,C=S-y,N=M-b;return T*T+D*D>C*C+N*N&&(E=S,A=M),{cx:E,cy:A,x01:-f,y01:-l,x11:E*(i/w-1),y11:A*(i/w-1)}}var I_=function(){var t=A_,e=S_,n=h_(0),r=null,i=M_,a=T_,o=D_,s=null;function u(){var u,c,f=+t.apply(this,arguments),l=+e.apply(this,arguments),h=i.apply(this,arguments)-w_,d=a.apply(this,arguments)-w_,p=d_(d-h),g=d>h;if(s||(s=u=zi()),l<f&&(c=l,l=f,f=c),l>1e-12)if(p>x_-1e-12)s.moveTo(l*g_(h),l*v_(h)),s.arc(0,0,l,h,d,!g),f>1e-12&&(s.moveTo(f*g_(d),f*v_(d)),s.arc(0,0,f,d,h,g));else{var y,b,v=h,m=d,_=h,w=d,x=p,k=p,E=o.apply(this,arguments)/2,A=E>1e-12&&(r?+r.apply(this,arguments):m_(f*f+l*l)),S=b_(d_(l-f)/2,+n.apply(this,arguments)),M=S,T=S;if(A>1e-12){var D=E_(A/f*v_(E)),C=E_(A/l*v_(E));(x-=2*D)>1e-12?(_+=D*=g?1:-1,w-=D):(x=0,_=w=(h+d)/2),(k-=2*C)>1e-12?(v+=C*=g?1:-1,m-=C):(k=0,v=m=(h+d)/2)}var N=l*g_(v),I=l*v_(v),L=f*g_(w),B=f*v_(w);if(S>1e-12){var O,R=l*g_(m),P=l*v_(m),F=f*g_(_),q=f*v_(_);if(p<__&&(O=C_(N,I,F,q,R,P,L,B))){var j=N-O[0],U=I-O[1],z=R-O[0],Y=P-O[1],V=1/v_(k_((j*z+U*Y)/(m_(j*j+U*U)*m_(z*z+Y*Y)))/2),H=m_(O[0]*O[0]+O[1]*O[1]);M=b_(S,(f-H)/(V-1)),T=b_(S,(l-H)/(V+1))}}k>1e-12?T>1e-12?(y=N_(F,q,N,I,l,T,g),b=N_(R,P,L,B,l,T,g),s.moveTo(y.cx+y.x01,y.cy+y.y01),T<S?s.arc(y.cx,y.cy,T,p_(y.y01,y.x01),p_(b.y01,b.x01),!g):(s.arc(y.cx,y.cy,T,p_(y.y01,y.x01),p_(y.y11,y.x11),!g),s.arc(0,0,l,p_(y.cy+y.y11,y.cx+y.x11),p_(b.cy+b.y11,b.cx+b.x11),!g),s.arc(b.cx,b.cy,T,p_(b.y11,b.x11),p_(b.y01,b.x01),!g))):(s.moveTo(N,I),s.arc(0,0,l,v,m,!g)):s.moveTo(N,I),f>1e-12&&x>1e-12?M>1e-12?(y=N_(L,B,R,P,f,-M,g),b=N_(N,I,F,q,f,-M,g),s.lineTo(y.cx+y.x01,y.cy+y.y01),M<S?s.arc(y.cx,y.cy,M,p_(y.y01,y.x01),p_(b.y01,b.x01),!g):(s.arc(y.cx,y.cy,M,p_(y.y01,y.x01),p_(y.y11,y.x11),!g),s.arc(0,0,f,p_(y.cy+y.y11,y.cx+y.x11),p_(b.cy+b.y11,b.cx+b.x11),g),s.arc(b.cx,b.cy,M,p_(b.y11,b.x11),p_(b.y01,b.x01),!g))):s.arc(0,0,f,w,_,g):s.lineTo(L,B)}else s.moveTo(0,0);if(s.closePath(),u)return s=null,u+""||null}return u.centroid=function(){var n=(+t.apply(this,arguments)+ +e.apply(this,arguments))/2,r=(+i.apply(this,arguments)+ +a.apply(this,arguments))/2-__/2;return[g_(r)*n,v_(r)*n]},u.innerRadius=function(e){return arguments.length?(t="function"==typeof e?e:h_(+e),u):t},u.outerRadius=function(t){return arguments.length?(e="function"==typeof t?t:h_(+t),u):e},u.cornerRadius=function(t){return arguments.length?(n="function"==typeof t?t:h_(+t),u):n},u.padRadius=function(t){return arguments.length?(r=null==t?null:"function"==typeof t?t:h_(+t),u):r},u.startAngle=function(t){return arguments.length?(i="function"==typeof t?t:h_(+t),u):i},u.endAngle=function(t){return arguments.length?(a="function"==typeof t?t:h_(+t),u):a},u.padAngle=function(t){return arguments.length?(o="function"==typeof t?t:h_(+t),u):o},u.context=function(t){return arguments.length?(s=null==t?null:t,u):s},u};function L_(t){this._context=t}L_.prototype={areaStart:function(){this._line=0},areaEnd:function(){this._line=NaN},lineStart:function(){this._point=0},lineEnd:function(){(this._line||0!==this._line&&1===this._point)&&this._context.closePath(),this._line=1-this._line},point:function(t,e){switch(t=+t,e=+e,this._point){case 0:this._point=1,this._line?this._context.lineTo(t,e):this._context.moveTo(t,e);break;case 1:this._point=2;default:this._context.lineTo(t,e)}}};var B_=function(t){return new L_(t)};function O_(t){return t[0]}function R_(t){return t[1]}var P_=function(){var t=O_,e=R_,n=h_(!0),r=null,i=B_,a=null;function o(o){var s,u,c,f=o.length,l=!1;for(null==r&&(a=i(c=zi())),s=0;s<=f;++s)!(s<f&&n(u=o[s],s,o))===l&&((l=!l)?a.lineStart():a.lineEnd()),l&&a.point(+t(u,s,o),+e(u,s,o));if(c)return a=null,c+""||null}return o.x=function(e){return arguments.length?(t="function"==typeof e?e:h_(+e),o):t},o.y=function(t){return arguments.length?(e="function"==typeof t?t:h_(+t),o):e},o.defined=function(t){return arguments.length?(n="function"==typeof t?t:h_(!!t),o):n},o.curve=function(t){return arguments.length?(i=t,null!=r&&(a=i(r)),o):i},o.context=function(t){return arguments.length?(null==t?r=a=null:a=i(r=t),o):r},o},F_=function(){var t=O_,e=null,n=h_(0),r=R_,i=h_(!0),a=null,o=B_,s=null;function u(u){var c,f,l,h,d,p=u.length,g=!1,y=new Array(p),b=new Array(p);for(null==a&&(s=o(d=zi())),c=0;c<=p;++c){if(!(c<p&&i(h=u[c],c,u))===g)if(g=!g)f=c,s.areaStart(),s.lineStart();else{for(s.lineEnd(),s.lineStart(),l=c-1;l>=f;--l)s.point(y[l],b[l]);s.lineEnd(),s.areaEnd()}g&&(y[c]=+t(h,c,u),b[c]=+n(h,c,u),s.point(e?+e(h,c,u):y[c],r?+r(h,c,u):b[c]))}if(d)return s=null,d+""||null}function c(){return P_().defined(i).curve(o).context(a)}return u.x=function(n){return arguments.length?(t="function"==typeof n?n:h_(+n),e=null,u):t},u.x0=function(e){return arguments.length?(t="function"==typeof e?e:h_(+e),u):t},u.x1=function(t){return arguments.length?(e=null==t?null:"function"==typeof t?t:h_(+t),u):e},u.y=function(t){return arguments.length?(n="function"==typeof t?t:h_(+t),r=null,u):n},u.y0=function(t){return arguments.length?(n="function"==typeof t?t:h_(+t),u):n},u.y1=function(t){return arguments.length?(r=null==t?null:"function"==typeof t?t:h_(+t),u):r},u.lineX0=u.lineY0=function(){return c().x(t).y(n)},u.lineY1=function(){return c().x(t).y(r)},u.lineX1=function(){return c().x(e).y(n)},u.defined=function(t){return arguments.length?(i="function"==typeof t?t:h_(!!t),u):i},u.curve=function(t){return arguments.length?(o=t,null!=a&&(s=o(a)),u):o},u.context=function(t){return arguments.length?(null==t?a=s=null:s=o(a=t),u):a},u},q_=function(t,e){return e<t?-1:e>t?1:e>=t?0:NaN},j_=function(t){return t},U_=function(){var t=j_,e=q_,n=null,r=h_(0),i=h_(x_),a=h_(0);function o(o){var s,u,c,f,l,h=o.length,d=0,p=new Array(h),g=new Array(h),y=+r.apply(this,arguments),b=Math.min(x_,Math.max(-x_,i.apply(this,arguments)-y)),v=Math.min(Math.abs(b)/h,a.apply(this,arguments)),m=v*(b<0?-1:1);for(s=0;s<h;++s)(l=g[p[s]=s]=+t(o[s],s,o))>0&&(d+=l);for(null!=e?p.sort((function(t,n){return e(g[t],g[n])})):null!=n&&p.sort((function(t,e){return n(o[t],o[e])})),s=0,c=d?(b-h*m)/d:0;s<h;++s,y=f)u=p[s],f=y+((l=g[u])>0?l*c:0)+m,g[u]={data:o[u],index:s,value:l,startAngle:y,endAngle:f,padAngle:v};return g}return o.value=function(e){return arguments.length?(t="function"==typeof e?e:h_(+e),o):t},o.sortValues=function(t){return arguments.length?(e=t,n=null,o):e},o.sort=function(t){return arguments.length?(n=t,e=null,o):n},o.startAngle=function(t){return arguments.length?(r="function"==typeof t?t:h_(+t),o):r},o.endAngle=function(t){return arguments.length?(i="function"==typeof t?t:h_(+t),o):i},o.padAngle=function(t){return arguments.length?(a="function"==typeof t?t:h_(+t),o):a},o},z_=V_(B_);function Y_(t){this._curve=t}function V_(t){function e(e){return new Y_(t(e))}return e._curve=t,e}function H_(t){var e=t.curve;return t.angle=t.x,delete t.x,t.radius=t.y,delete t.y,t.curve=function(t){return arguments.length?e(V_(t)):e()._curve},t}Y_.prototype={areaStart:function(){this._curve.areaStart()},areaEnd:function(){this._curve.areaEnd()},lineStart:function(){this._curve.lineStart()},lineEnd:function(){this._curve.lineEnd()},point:function(t,e){this._curve.point(e*Math.sin(t),e*-Math.cos(t))}};var G_=function(){return H_(P_().curve(z_))},$_=function(){var t=F_().curve(z_),e=t.curve,n=t.lineX0,r=t.lineX1,i=t.lineY0,a=t.lineY1;return t.angle=t.x,delete t.x,t.startAngle=t.x0,delete t.x0,t.endAngle=t.x1,delete t.x1,t.radius=t.y,delete t.y,t.innerRadius=t.y0,delete t.y0,t.outerRadius=t.y1,delete t.y1,t.lineStartAngle=function(){return H_(n())},delete t.lineX0,t.lineEndAngle=function(){return H_(r())},delete t.lineX1,t.lineInnerRadius=function(){return H_(i())},delete t.lineY0,t.lineOuterRadius=function(){return H_(a())},delete t.lineY1,t.curve=function(t){return arguments.length?e(V_(t)):e()._curve},t},W_=function(t,e){return[(e=+e)*Math.cos(t-=Math.PI/2),e*Math.sin(t)]},K_=Array.prototype.slice;function X_(t){return t.source}function Z_(t){return t.target}function J_(t){var e=X_,n=Z_,r=O_,i=R_,a=null;function o(){var o,s=K_.call(arguments),u=e.apply(this,s),c=n.apply(this,s);if(a||(a=o=zi()),t(a,+r.apply(this,(s[0]=u,s)),+i.apply(this,s),+r.apply(this,(s[0]=c,s)),+i.apply(this,s)),o)return a=null,o+""||null}return o.source=function(t){return arguments.length?(e=t,o):e},o.target=function(t){return arguments.length?(n=t,o):n},o.x=function(t){return arguments.length?(r="function"==typeof t?t:h_(+t),o):r},o.y=function(t){return arguments.length?(i="function"==typeof t?t:h_(+t),o):i},o.context=function(t){return arguments.length?(a=null==t?null:t,o):a},o}function Q_(t,e,n,r,i){t.moveTo(e,n),t.bezierCurveTo(e=(e+r)/2,n,e,i,r,i)}function tw(t,e,n,r,i){t.moveTo(e,n),t.bezierCurveTo(e,n=(n+i)/2,r,n,r,i)}function ew(t,e,n,r,i){var a=W_(e,n),o=W_(e,n=(n+i)/2),s=W_(r,n),u=W_(r,i);t.moveTo(a[0],a[1]),t.bezierCurveTo(o[0],o[1],s[0],s[1],u[0],u[1])}function nw(){return J_(Q_)}function rw(){return J_(tw)}function iw(){var t=J_(ew);return t.angle=t.x,delete t.x,t.radius=t.y,delete t.y,t}var aw={draw:function(t,e){var n=Math.sqrt(e/__);t.moveTo(n,0),t.arc(0,0,n,0,x_)}},ow={draw:function(t,e){var n=Math.sqrt(e/5)/2;t.moveTo(-3*n,-n),t.lineTo(-n,-n),t.lineTo(-n,-3*n),t.lineTo(n,-3*n),t.lineTo(n,-n),t.lineTo(3*n,-n),t.lineTo(3*n,n),t.lineTo(n,n),t.lineTo(n,3*n),t.lineTo(-n,3*n),t.lineTo(-n,n),t.lineTo(-3*n,n),t.closePath()}},sw=Math.sqrt(1/3),uw=2*sw,cw={draw:function(t,e){var n=Math.sqrt(e/uw),r=n*sw;t.moveTo(0,-n),t.lineTo(r,0),t.lineTo(0,n),t.lineTo(-r,0),t.closePath()}},fw=Math.sin(__/10)/Math.sin(7*__/10),lw=Math.sin(x_/10)*fw,hw=-Math.cos(x_/10)*fw,dw={draw:function(t,e){var n=Math.sqrt(.8908130915292852*e),r=lw*n,i=hw*n;t.moveTo(0,-n),t.lineTo(r,i);for(var a=1;a<5;++a){var o=x_*a/5,s=Math.cos(o),u=Math.sin(o);t.lineTo(u*n,-s*n),t.lineTo(s*r-u*i,u*r+s*i)}t.closePath()}},pw={draw:function(t,e){var n=Math.sqrt(e),r=-n/2;t.rect(r,r,n,n)}},gw=Math.sqrt(3),yw={draw:function(t,e){var n=-Math.sqrt(e/(3*gw));t.moveTo(0,2*n),t.lineTo(-gw*n,-n),t.lineTo(gw*n,-n),t.closePath()}},bw=Math.sqrt(3)/2,vw=1/Math.sqrt(12),mw=3*(vw/2+1),_w={draw:function(t,e){var n=Math.sqrt(e/mw),r=n/2,i=n*vw,a=r,o=n*vw+n,s=-a,u=o;t.moveTo(r,i),t.lineTo(a,o),t.lineTo(s,u),t.lineTo(-.5*r-bw*i,bw*r+-.5*i),t.lineTo(-.5*a-bw*o,bw*a+-.5*o),t.lineTo(-.5*s-bw*u,bw*s+-.5*u),t.lineTo(-.5*r+bw*i,-.5*i-bw*r),t.lineTo(-.5*a+bw*o,-.5*o-bw*a),t.lineTo(-.5*s+bw*u,-.5*u-bw*s),t.closePath()}},ww=[aw,ow,cw,pw,dw,yw,_w],xw=function(){var t=h_(aw),e=h_(64),n=null;function r(){var r;if(n||(n=r=zi()),t.apply(this,arguments).draw(n,+e.apply(this,arguments)),r)return n=null,r+""||null}return r.type=function(e){return arguments.length?(t="function"==typeof e?e:h_(e),r):t},r.size=function(t){return arguments.length?(e="function"==typeof t?t:h_(+t),r):e},r.context=function(t){return arguments.length?(n=null==t?null:t,r):n},r},kw=function(){};function Ew(t,e,n){t._context.bezierCurveTo((2*t._x0+t._x1)/3,(2*t._y0+t._y1)/3,(t._x0+2*t._x1)/3,(t._y0+2*t._y1)/3,(t._x0+4*t._x1+e)/6,(t._y0+4*t._y1+n)/6)}function Aw(t){this._context=t}Aw.prototype={areaStart:function(){this._line=0},areaEnd:function(){this._line=NaN},lineStart:function(){this._x0=this._x1=this._y0=this._y1=NaN,this._point=0},lineEnd:function(){switch(this._point){case 3:Ew(this,this._x1,this._y1);case 2:this._context.lineTo(this._x1,this._y1)}(this._line||0!==this._line&&1===this._point)&&this._context.closePath(),this._line=1-this._line},point:function(t,e){switch(t=+t,e=+e,this._point){case 0:this._point=1,this._line?this._context.lineTo(t,e):this._context.moveTo(t,e);break;case 1:this._point=2;break;case 2:this._point=3,this._context.lineTo((5*this._x0+this._x1)/6,(5*this._y0+this._y1)/6);default:Ew(this,t,e)}this._x0=this._x1,this._x1=t,this._y0=this._y1,this._y1=e}};var Sw=function(t){return new Aw(t)};function Mw(t){this._context=t}Mw.prototype={areaStart:kw,areaEnd:kw,lineStart:function(){this._x0=this._x1=this._x2=this._x3=this._x4=this._y0=this._y1=this._y2=this._y3=this._y4=NaN,this._point=0},lineEnd:function(){switch(this._point){case 1:this._context.moveTo(this._x2,this._y2),this._context.closePath();break;case 2:this._context.moveTo((this._x2+2*this._x3)/3,(this._y2+2*this._y3)/3),this._context.lineTo((this._x3+2*this._x2)/3,(this._y3+2*this._y2)/3),this._context.closePath();break;case 3:this.point(this._x2,this._y2),this.point(this._x3,this._y3),this.point(this._x4,this._y4)}},point:function(t,e){switch(t=+t,e=+e,this._point){case 0:this._point=1,this._x2=t,this._y2=e;break;case 1:this._point=2,this._x3=t,this._y3=e;break;case 2:this._point=3,this._x4=t,this._y4=e,this._context.moveTo((this._x0+4*this._x1+t)/6,(this._y0+4*this._y1+e)/6);break;default:Ew(this,t,e)}this._x0=this._x1,this._x1=t,this._y0=this._y1,this._y1=e}};var Tw=function(t){return new Mw(t)};function Dw(t){this._context=t}Dw.prototype={areaStart:function(){this._line=0},areaEnd:function(){this._line=NaN},lineStart:function(){this._x0=this._x1=this._y0=this._y1=NaN,this._point=0},lineEnd:function(){(this._line||0!==this._line&&3===this._point)&&this._context.closePath(),this._line=1-this._line},point:function(t,e){switch(t=+t,e=+e,this._point){case 0:this._point=1;break;case 1:this._point=2;break;case 2:this._point=3;var n=(this._x0+4*this._x1+t)/6,r=(this._y0+4*this._y1+e)/6;this._line?this._context.lineTo(n,r):this._context.moveTo(n,r);break;case 3:this._point=4;default:Ew(this,t,e)}this._x0=this._x1,this._x1=t,this._y0=this._y1,this._y1=e}};var Cw=function(t){return new Dw(t)};function Nw(t,e){this._basis=new Aw(t),this._beta=e}Nw.prototype={lineStart:function(){this._x=[],this._y=[],this._basis.lineStart()},lineEnd:function(){var t=this._x,e=this._y,n=t.length-1;if(n>0)for(var r,i=t[0],a=e[0],o=t[n]-i,s=e[n]-a,u=-1;++u<=n;)r=u/n,this._basis.point(this._beta*t[u]+(1-this._beta)*(i+r*o),this._beta*e[u]+(1-this._beta)*(a+r*s));this._x=this._y=null,this._basis.lineEnd()},point:function(t,e){this._x.push(+t),this._y.push(+e)}};var Iw=function t(e){function n(t){return 1===e?new Aw(t):new Nw(t,e)}return n.beta=function(e){return t(+e)},n}(.85);function Lw(t,e,n){t._context.bezierCurveTo(t._x1+t._k*(t._x2-t._x0),t._y1+t._k*(t._y2-t._y0),t._x2+t._k*(t._x1-e),t._y2+t._k*(t._y1-n),t._x2,t._y2)}function Bw(t,e){this._context=t,this._k=(1-e)/6}Bw.prototype={areaStart:function(){this._line=0},areaEnd:function(){this._line=NaN},lineStart:function(){this._x0=this._x1=this._x2=this._y0=this._y1=this._y2=NaN,this._point=0},lineEnd:function(){switch(this._point){case 2:this._context.lineTo(this._x2,this._y2);break;case 3:Lw(this,this._x1,this._y1)}(this._line||0!==this._line&&1===this._point)&&this._context.closePath(),this._line=1-this._line},point:function(t,e){switch(t=+t,e=+e,this._point){case 0:this._point=1,this._line?this._context.lineTo(t,e):this._context.moveTo(t,e);break;case 1:this._point=2,this._x1=t,this._y1=e;break;case 2:this._point=3;default:Lw(this,t,e)}this._x0=this._x1,this._x1=this._x2,this._x2=t,this._y0=this._y1,this._y1=this._y2,this._y2=e}};var Ow=function t(e){function n(t){return new Bw(t,e)}return n.tension=function(e){return t(+e)},n}(0);function Rw(t,e){this._context=t,this._k=(1-e)/6}Rw.prototype={areaStart:kw,areaEnd:kw,lineStart:function(){this._x0=this._x1=this._x2=this._x3=this._x4=this._x5=this._y0=this._y1=this._y2=this._y3=this._y4=this._y5=NaN,this._point=0},lineEnd:function(){switch(this._point){case 1:this._context.moveTo(this._x3,this._y3),this._context.closePath();break;case 2:this._context.lineTo(this._x3,this._y3),this._context.closePath();break;case 3:this.point(this._x3,this._y3),this.point(this._x4,this._y4),this.point(this._x5,this._y5)}},point:function(t,e){switch(t=+t,e=+e,this._point){case 0:this._point=1,this._x3=t,this._y3=e;break;case 1:this._point=2,this._context.moveTo(this._x4=t,this._y4=e);break;case 2:this._point=3,this._x5=t,this._y5=e;break;default:Lw(this,t,e)}this._x0=this._x1,this._x1=this._x2,this._x2=t,this._y0=this._y1,this._y1=this._y2,this._y2=e}};var Pw=function t(e){function n(t){return new Rw(t,e)}return n.tension=function(e){return t(+e)},n}(0);function Fw(t,e){this._context=t,this._k=(1-e)/6}Fw.prototype={areaStart:function(){this._line=0},areaEnd:function(){this._line=NaN},lineStart:function(){this._x0=this._x1=this._x2=this._y0=this._y1=this._y2=NaN,this._point=0},lineEnd:function(){(this._line||0!==this._line&&3===this._point)&&this._context.closePath(),this._line=1-this._line},point:function(t,e){switch(t=+t,e=+e,this._point){case 0:this._point=1;break;case 1:this._point=2;break;case 2:this._point=3,this._line?this._context.lineTo(this._x2,this._y2):this._context.moveTo(this._x2,this._y2);break;case 3:this._point=4;default:Lw(this,t,e)}this._x0=this._x1,this._x1=this._x2,this._x2=t,this._y0=this._y1,this._y1=this._y2,this._y2=e}};var qw=function t(e){function n(t){return new Fw(t,e)}return n.tension=function(e){return t(+e)},n}(0);function jw(t,e,n){var r=t._x1,i=t._y1,a=t._x2,o=t._y2;if(t._l01_a>1e-12){var s=2*t._l01_2a+3*t._l01_a*t._l12_a+t._l12_2a,u=3*t._l01_a*(t._l01_a+t._l12_a);r=(r*s-t._x0*t._l12_2a+t._x2*t._l01_2a)/u,i=(i*s-t._y0*t._l12_2a+t._y2*t._l01_2a)/u}if(t._l23_a>1e-12){var c=2*t._l23_2a+3*t._l23_a*t._l12_a+t._l12_2a,f=3*t._l23_a*(t._l23_a+t._l12_a);a=(a*c+t._x1*t._l23_2a-e*t._l12_2a)/f,o=(o*c+t._y1*t._l23_2a-n*t._l12_2a)/f}t._context.bezierCurveTo(r,i,a,o,t._x2,t._y2)}function Uw(t,e){this._context=t,this._alpha=e}Uw.prototype={areaStart:function(){this._line=0},areaEnd:function(){this._line=NaN},lineStart:function(){this._x0=this._x1=this._x2=this._y0=this._y1=this._y2=NaN,this._l01_a=this._l12_a=this._l23_a=this._l01_2a=this._l12_2a=this._l23_2a=this._point=0},lineEnd:function(){switch(this._point){case 2:this._context.lineTo(this._x2,this._y2);break;case 3:this.point(this._x2,this._y2)}(this._line||0!==this._line&&1===this._point)&&this._context.closePath(),this._line=1-this._line},point:function(t,e){if(t=+t,e=+e,this._point){var n=this._x2-t,r=this._y2-e;this._l23_a=Math.sqrt(this._l23_2a=Math.pow(n*n+r*r,this._alpha))}switch(this._point){case 0:this._point=1,this._line?this._context.lineTo(t,e):this._context.moveTo(t,e);break;case 1:this._point=2;break;case 2:this._point=3;default:jw(this,t,e)}this._l01_a=this._l12_a,this._l12_a=this._l23_a,this._l01_2a=this._l12_2a,this._l12_2a=this._l23_2a,this._x0=this._x1,this._x1=this._x2,this._x2=t,this._y0=this._y1,this._y1=this._y2,this._y2=e}};var zw=function t(e){function n(t){return e?new Uw(t,e):new Bw(t,0)}return n.alpha=function(e){return t(+e)},n}(.5);function Yw(t,e){this._context=t,this._alpha=e}Yw.prototype={areaStart:kw,areaEnd:kw,lineStart:function(){this._x0=this._x1=this._x2=this._x3=this._x4=this._x5=this._y0=this._y1=this._y2=this._y3=this._y4=this._y5=NaN,this._l01_a=this._l12_a=this._l23_a=this._l01_2a=this._l12_2a=this._l23_2a=this._point=0},lineEnd:function(){switch(this._point){case 1:this._context.moveTo(this._x3,this._y3),this._context.closePath();break;case 2:this._context.lineTo(this._x3,this._y3),this._context.closePath();break;case 3:this.point(this._x3,this._y3),this.point(this._x4,this._y4),this.point(this._x5,this._y5)}},point:function(t,e){if(t=+t,e=+e,this._point){var n=this._x2-t,r=this._y2-e;this._l23_a=Math.sqrt(this._l23_2a=Math.pow(n*n+r*r,this._alpha))}switch(this._point){case 0:this._point=1,this._x3=t,this._y3=e;break;case 1:this._point=2,this._context.moveTo(this._x4=t,this._y4=e);break;case 2:this._point=3,this._x5=t,this._y5=e;break;default:jw(this,t,e)}this._l01_a=this._l12_a,this._l12_a=this._l23_a,this._l01_2a=this._l12_2a,this._l12_2a=this._l23_2a,this._x0=this._x1,this._x1=this._x2,this._x2=t,this._y0=this._y1,this._y1=this._y2,this._y2=e}};var Vw=function t(e){function n(t){return e?new Yw(t,e):new Rw(t,0)}return n.alpha=function(e){return t(+e)},n}(.5);function Hw(t,e){this._context=t,this._alpha=e}Hw.prototype={areaStart:function(){this._line=0},areaEnd:function(){this._line=NaN},lineStart:function(){this._x0=this._x1=this._x2=this._y0=this._y1=this._y2=NaN,this._l01_a=this._l12_a=this._l23_a=this._l01_2a=this._l12_2a=this._l23_2a=this._point=0},lineEnd:function(){(this._line||0!==this._line&&3===this._point)&&this._context.closePath(),this._line=1-this._line},point:function(t,e){if(t=+t,e=+e,this._point){var n=this._x2-t,r=this._y2-e;this._l23_a=Math.sqrt(this._l23_2a=Math.pow(n*n+r*r,this._alpha))}switch(this._point){case 0:this._point=1;break;case 1:this._point=2;break;case 2:this._point=3,this._line?this._context.lineTo(this._x2,this._y2):this._context.moveTo(this._x2,this._y2);break;case 3:this._point=4;default:jw(this,t,e)}this._l01_a=this._l12_a,this._l12_a=this._l23_a,this._l01_2a=this._l12_2a,this._l12_2a=this._l23_2a,this._x0=this._x1,this._x1=this._x2,this._x2=t,this._y0=this._y1,this._y1=this._y2,this._y2=e}};var Gw=function t(e){function n(t){return e?new Hw(t,e):new Fw(t,0)}return n.alpha=function(e){return t(+e)},n}(.5);function $w(t){this._context=t}$w.prototype={areaStart:kw,areaEnd:kw,lineStart:function(){this._point=0},lineEnd:function(){this._point&&this._context.closePath()},point:function(t,e){t=+t,e=+e,this._point?this._context.lineTo(t,e):(this._point=1,this._context.moveTo(t,e))}};var Ww=function(t){return new $w(t)};function Kw(t){return t<0?-1:1}function Xw(t,e,n){var r=t._x1-t._x0,i=e-t._x1,a=(t._y1-t._y0)/(r||i<0&&-0),o=(n-t._y1)/(i||r<0&&-0),s=(a*i+o*r)/(r+i);return(Kw(a)+Kw(o))*Math.min(Math.abs(a),Math.abs(o),.5*Math.abs(s))||0}function Zw(t,e){var n=t._x1-t._x0;return n?(3*(t._y1-t._y0)/n-e)/2:e}function Jw(t,e,n){var r=t._x0,i=t._y0,a=t._x1,o=t._y1,s=(a-r)/3;t._context.bezierCurveTo(r+s,i+s*e,a-s,o-s*n,a,o)}function Qw(t){this._context=t}function tx(t){this._context=new ex(t)}function ex(t){this._context=t}function nx(t){return new Qw(t)}function rx(t){return new tx(t)}function ix(t){this._context=t}function ax(t){var e,n,r=t.length-1,i=new Array(r),a=new Array(r),o=new Array(r);for(i[0]=0,a[0]=2,o[0]=t[0]+2*t[1],e=1;e<r-1;++e)i[e]=1,a[e]=4,o[e]=4*t[e]+2*t[e+1];for(i[r-1]=2,a[r-1]=7,o[r-1]=8*t[r-1]+t[r],e=1;e<r;++e)n=i[e]/a[e-1],a[e]-=n,o[e]-=n*o[e-1];for(i[r-1]=o[r-1]/a[r-1],e=r-2;e>=0;--e)i[e]=(o[e]-i[e+1])/a[e];for(a[r-1]=(t[r]+i[r-1])/2,e=0;e<r-1;++e)a[e]=2*t[e+1]-i[e+1];return[i,a]}Qw.prototype={areaStart:function(){this._line=0},areaEnd:function(){this._line=NaN},lineStart:function(){this._x0=this._x1=this._y0=this._y1=this._t0=NaN,this._point=0},lineEnd:function(){switch(this._point){case 2:this._context.lineTo(this._x1,this._y1);break;case 3:Jw(this,this._t0,Zw(this,this._t0))}(this._line||0!==this._line&&1===this._point)&&this._context.closePath(),this._line=1-this._line},point:function(t,e){var n=NaN;if(e=+e,(t=+t)!==this._x1||e!==this._y1){switch(this._point){case 0:this._point=1,this._line?this._context.lineTo(t,e):this._context.moveTo(t,e);break;case 1:this._point=2;break;case 2:this._point=3,Jw(this,Zw(this,n=Xw(this,t,e)),n);break;default:Jw(this,this._t0,n=Xw(this,t,e))}this._x0=this._x1,this._x1=t,this._y0=this._y1,this._y1=e,this._t0=n}}},(tx.prototype=Object.create(Qw.prototype)).point=function(t,e){Qw.prototype.point.call(this,e,t)},ex.prototype={moveTo:function(t,e){this._context.moveTo(e,t)},closePath:function(){this._context.closePath()},lineTo:function(t,e){this._context.lineTo(e,t)},bezierCurveTo:function(t,e,n,r,i,a){this._context.bezierCurveTo(e,t,r,n,a,i)}},ix.prototype={areaStart:function(){this._line=0},areaEnd:function(){this._line=NaN},lineStart:function(){this._x=[],this._y=[]},lineEnd:function(){var t=this._x,e=this._y,n=t.length;if(n)if(this._line?this._context.lineTo(t[0],e[0]):this._context.moveTo(t[0],e[0]),2===n)this._context.lineTo(t[1],e[1]);else for(var r=ax(t),i=ax(e),a=0,o=1;o<n;++a,++o)this._context.bezierCurveTo(r[0][a],i[0][a],r[1][a],i[1][a],t[o],e[o]);(this._line||0!==this._line&&1===n)&&this._context.closePath(),this._line=1-this._line,this._x=this._y=null},point:function(t,e){this._x.push(+t),this._y.push(+e)}};var ox=function(t){return new ix(t)};function sx(t,e){this._context=t,this._t=e}sx.prototype={areaStart:function(){this._line=0},areaEnd:function(){this._line=NaN},lineStart:function(){this._x=this._y=NaN,this._point=0},lineEnd:function(){0<this._t&&this._t<1&&2===this._point&&this._context.lineTo(this._x,this._y),(this._line||0!==this._line&&1===this._point)&&this._context.closePath(),this._line>=0&&(this._t=1-this._t,this._line=1-this._line)},point:function(t,e){switch(t=+t,e=+e,this._point){case 0:this._point=1,this._line?this._context.lineTo(t,e):this._context.moveTo(t,e);break;case 1:this._point=2;default:if(this._t<=0)this._context.lineTo(this._x,e),this._context.lineTo(t,e);else{var n=this._x*(1-this._t)+t*this._t;this._context.lineTo(n,this._y),this._context.lineTo(n,e)}}this._x=t,this._y=e}};var ux=function(t){return new sx(t,.5)};function cx(t){return new sx(t,0)}function fx(t){return new sx(t,1)}var lx=function(t,e){if((i=t.length)>1)for(var n,r,i,a=1,o=t[e[0]],s=o.length;a<i;++a)for(r=o,o=t[e[a]],n=0;n<s;++n)o[n][1]+=o[n][0]=isNaN(r[n][1])?r[n][0]:r[n][1]},hx=function(t){for(var e=t.length,n=new Array(e);--e>=0;)n[e]=e;return n};function dx(t,e){return t[e]}var px=function(){var t=h_([]),e=hx,n=lx,r=dx;function i(i){var a,o,s=t.apply(this,arguments),u=i.length,c=s.length,f=new Array(c);for(a=0;a<c;++a){for(var l,h=s[a],d=f[a]=new Array(u),p=0;p<u;++p)d[p]=l=[0,+r(i[p],h,p,i)],l.data=i[p];d.key=h}for(a=0,o=e(f);a<c;++a)f[o[a]].index=a;return n(f,o),f}return i.keys=function(e){return arguments.length?(t="function"==typeof e?e:h_(K_.call(e)),i):t},i.value=function(t){return arguments.length?(r="function"==typeof t?t:h_(+t),i):r},i.order=function(t){return arguments.length?(e=null==t?hx:"function"==typeof t?t:h_(K_.call(t)),i):e},i.offset=function(t){return arguments.length?(n=null==t?lx:t,i):n},i},gx=function(t,e){if((r=t.length)>0){for(var n,r,i,a=0,o=t[0].length;a<o;++a){for(i=n=0;n<r;++n)i+=t[n][a][1]||0;if(i)for(n=0;n<r;++n)t[n][a][1]/=i}lx(t,e)}},yx=function(t,e){if((s=t.length)>0)for(var n,r,i,a,o,s,u=0,c=t[e[0]].length;u<c;++u)for(a=o=0,n=0;n<s;++n)(i=(r=t[e[n]][u])[1]-r[0])>0?(r[0]=a,r[1]=a+=i):i<0?(r[1]=o,r[0]=o+=i):(r[0]=0,r[1]=i)},bx=function(t,e){if((n=t.length)>0){for(var n,r=0,i=t[e[0]],a=i.length;r<a;++r){for(var o=0,s=0;o<n;++o)s+=t[o][r][1]||0;i[r][1]+=i[r][0]=-s/2}lx(t,e)}},vx=function(t,e){if((i=t.length)>0&&(r=(n=t[e[0]]).length)>0){for(var n,r,i,a=0,o=1;o<r;++o){for(var s=0,u=0,c=0;s<i;++s){for(var f=t[e[s]],l=f[o][1]||0,h=(l-(f[o-1][1]||0))/2,d=0;d<s;++d){var p=t[e[d]];h+=(p[o][1]||0)-(p[o-1][1]||0)}u+=l,c+=h*l}n[o-1][1]+=n[o-1][0]=a,u&&(a-=c/u)}n[o-1][1]+=n[o-1][0]=a,lx(t,e)}},mx=function(t){var e=t.map(_x);return hx(t).sort((function(t,n){return e[t]-e[n]}))};function _x(t){for(var e,n=-1,r=0,i=t.length,a=-1/0;++n<i;)(e=+t[n][1])>a&&(a=e,r=n);return r}var wx=function(t){var e=t.map(xx);return hx(t).sort((function(t,n){return e[t]-e[n]}))};function xx(t){for(var e,n=0,r=-1,i=t.length;++r<i;)(e=+t[r][1])&&(n+=e);return n}var kx=function(t){return wx(t).reverse()},Ex=function(t){var e,n,r=t.length,i=t.map(xx),a=mx(t),o=0,s=0,u=[],c=[];for(e=0;e<r;++e)n=a[e],o<s?(o+=i[n],u.push(n)):(s+=i[n],c.push(n));return c.reverse().concat(u)},Ax=function(t){return hx(t).reverse()};var Sx=Date.prototype.toISOString?function(t){return t.toISOString()}:Vy("%Y-%m-%dT%H:%M:%S.%LZ");var Mx=+new Date("2000-01-01T00:00:00.000Z")?function(t){var e=new Date(t);return isNaN(e)?null:e}:Hy("%Y-%m-%dT%H:%M:%S.%LZ"),Tx=function(t,e,n){var r=new Yn,i=e;return null==e?(r.restart(t,e,n),r):(e=+e,n=null==n?Un():+n,r.restart((function a(o){o+=i,r.restart(a,i+=e,n),t(o)}),e,n),r)},Dx=function(t){return function(){return t}};function Cx(t){return t[0]}function Nx(t){return t[1]}function Ix(){this._=null}function Lx(t){t.U=t.C=t.L=t.R=t.P=t.N=null}function Bx(t,e){var n=e,r=e.R,i=n.U;i?i.L===n?i.L=r:i.R=r:t._=r,r.U=i,n.U=r,n.R=r.L,n.R&&(n.R.U=n),r.L=n}function Ox(t,e){var n=e,r=e.L,i=n.U;i?i.L===n?i.L=r:i.R=r:t._=r,r.U=i,n.U=r,n.L=r.R,n.L&&(n.L.U=n),r.R=n}function Rx(t){for(;t.L;)t=t.L;return t}Ix.prototype={constructor:Ix,insert:function(t,e){var n,r,i;if(t){if(e.P=t,e.N=t.N,t.N&&(t.N.P=e),t.N=e,t.R){for(t=t.R;t.L;)t=t.L;t.L=e}else t.R=e;n=t}else this._?(t=Rx(this._),e.P=null,e.N=t,t.P=t.L=e,n=t):(e.P=e.N=null,this._=e,n=null);for(e.L=e.R=null,e.U=n,e.C=!0,t=e;n&&n.C;)n===(r=n.U).L?(i=r.R)&&i.C?(n.C=i.C=!1,r.C=!0,t=r):(t===n.R&&(Bx(this,n),n=(t=n).U),n.C=!1,r.C=!0,Ox(this,r)):(i=r.L)&&i.C?(n.C=i.C=!1,r.C=!0,t=r):(t===n.L&&(Ox(this,n),n=(t=n).U),n.C=!1,r.C=!0,Bx(this,r)),n=t.U;this._.C=!1},remove:function(t){t.N&&(t.N.P=t.P),t.P&&(t.P.N=t.N),t.N=t.P=null;var e,n,r,i=t.U,a=t.L,o=t.R;if(n=a?o?Rx(o):a:o,i?i.L===t?i.L=n:i.R=n:this._=n,a&&o?(r=n.C,n.C=t.C,n.L=a,a.U=n,n!==o?(i=n.U,n.U=t.U,t=n.R,i.L=t,n.R=o,o.U=n):(n.U=i,i=n,t=n.R)):(r=t.C,t=n),t&&(t.U=i),!r)if(t&&t.C)t.C=!1;else{do{if(t===this._)break;if(t===i.L){if((e=i.R).C&&(e.C=!1,i.C=!0,Bx(this,i),e=i.R),e.L&&e.L.C||e.R&&e.R.C){e.R&&e.R.C||(e.L.C=!1,e.C=!0,Ox(this,e),e=i.R),e.C=i.C,i.C=e.R.C=!1,Bx(this,i),t=this._;break}}else if((e=i.L).C&&(e.C=!1,i.C=!0,Ox(this,i),e=i.L),e.L&&e.L.C||e.R&&e.R.C){e.L&&e.L.C||(e.R.C=!1,e.C=!0,Bx(this,e),e=i.L),e.C=i.C,i.C=e.L.C=!1,Ox(this,i),t=this._;break}e.C=!0,t=i,i=i.U}while(!t.C);t&&(t.C=!1)}}};var Px=Ix;function Fx(t,e,n,r){var i=[null,null],a=uk.push(i)-1;return i.left=t,i.right=e,n&&jx(i,t,e,n),r&&jx(i,e,t,r),ok[t.index].halfedges.push(a),ok[e.index].halfedges.push(a),i}function qx(t,e,n){var r=[e,n];return r.left=t,r}function jx(t,e,n,r){t[0]||t[1]?t.left===n?t[1]=r:t[0]=r:(t[0]=r,t.left=e,t.right=n)}function Ux(t,e,n,r,i){var a,o=t[0],s=t[1],u=o[0],c=o[1],f=0,l=1,h=s[0]-u,d=s[1]-c;if(a=e-u,h||!(a>0)){if(a/=h,h<0){if(a<f)return;a<l&&(l=a)}else if(h>0){if(a>l)return;a>f&&(f=a)}if(a=r-u,h||!(a<0)){if(a/=h,h<0){if(a>l)return;a>f&&(f=a)}else if(h>0){if(a<f)return;a<l&&(l=a)}if(a=n-c,d||!(a>0)){if(a/=d,d<0){if(a<f)return;a<l&&(l=a)}else if(d>0){if(a>l)return;a>f&&(f=a)}if(a=i-c,d||!(a<0)){if(a/=d,d<0){if(a>l)return;a>f&&(f=a)}else if(d>0){if(a<f)return;a<l&&(l=a)}return!(f>0||l<1)||(f>0&&(t[0]=[u+f*h,c+f*d]),l<1&&(t[1]=[u+l*h,c+l*d]),!0)}}}}}function zx(t,e,n,r,i){var a=t[1];if(a)return!0;var o,s,u=t[0],c=t.left,f=t.right,l=c[0],h=c[1],d=f[0],p=f[1],g=(l+d)/2,y=(h+p)/2;if(p===h){if(g<e||g>=r)return;if(l>d){if(u){if(u[1]>=i)return}else u=[g,n];a=[g,i]}else{if(u){if(u[1]<n)return}else u=[g,i];a=[g,n]}}else if(s=y-(o=(l-d)/(p-h))*g,o<-1||o>1)if(l>d){if(u){if(u[1]>=i)return}else u=[(n-s)/o,n];a=[(i-s)/o,i]}else{if(u){if(u[1]<n)return}else u=[(i-s)/o,i];a=[(n-s)/o,n]}else if(h<p){if(u){if(u[0]>=r)return}else u=[e,o*e+s];a=[r,o*r+s]}else{if(u){if(u[0]<e)return}else u=[r,o*r+s];a=[e,o*e+s]}return t[0]=u,t[1]=a,!0}function Yx(t,e){var n=t.site,r=e.left,i=e.right;return n===i&&(i=r,r=n),i?Math.atan2(i[1]-r[1],i[0]-r[0]):(n===r?(r=e[1],i=e[0]):(r=e[0],i=e[1]),Math.atan2(r[0]-i[0],i[1]-r[1]))}function Vx(t,e){return e[+(e.left!==t.site)]}function Hx(t,e){return e[+(e.left===t.site)]}var Gx,$x=[];function Wx(){Lx(this),this.x=this.y=this.arc=this.site=this.cy=null}function Kx(t){var e=t.P,n=t.N;if(e&&n){var r=e.site,i=t.site,a=n.site;if(r!==a){var o=i[0],s=i[1],u=r[0]-o,c=r[1]-s,f=a[0]-o,l=a[1]-s,h=2*(u*l-c*f);if(!(h>=-fk)){var d=u*u+c*c,p=f*f+l*l,g=(l*d-c*p)/h,y=(u*p-f*d)/h,b=$x.pop()||new Wx;b.arc=t,b.site=i,b.x=g+o,b.y=(b.cy=y+s)+Math.sqrt(g*g+y*y),t.circle=b;for(var v=null,m=sk._;m;)if(b.y<m.y||b.y===m.y&&b.x<=m.x){if(!m.L){v=m.P;break}m=m.L}else{if(!m.R){v=m;break}m=m.R}sk.insert(v,b),v||(Gx=b)}}}}function Xx(t){var e=t.circle;e&&(e.P||(Gx=e.N),sk.remove(e),$x.push(e),Lx(e),t.circle=null)}var Zx=[];function Jx(){Lx(this),this.edge=this.site=this.circle=null}function Qx(t){var e=Zx.pop()||new Jx;return e.site=t,e}function tk(t){Xx(t),ak.remove(t),Zx.push(t),Lx(t)}function ek(t){var e=t.circle,n=e.x,r=e.cy,i=[n,r],a=t.P,o=t.N,s=[t];tk(t);for(var u=a;u.circle&&Math.abs(n-u.circle.x)<ck&&Math.abs(r-u.circle.cy)<ck;)a=u.P,s.unshift(u),tk(u),u=a;s.unshift(u),Xx(u);for(var c=o;c.circle&&Math.abs(n-c.circle.x)<ck&&Math.abs(r-c.circle.cy)<ck;)o=c.N,s.push(c),tk(c),c=o;s.push(c),Xx(c);var f,l=s.length;for(f=1;f<l;++f)c=s[f],u=s[f-1],jx(c.edge,u.site,c.site,i);u=s[0],(c=s[l-1]).edge=Fx(u.site,c.site,null,i),Kx(u),Kx(c)}function nk(t){for(var e,n,r,i,a=t[0],o=t[1],s=ak._;s;)if((r=rk(s,o)-a)>ck)s=s.L;else{if(!((i=a-ik(s,o))>ck)){r>-ck?(e=s.P,n=s):i>-ck?(e=s,n=s.N):e=n=s;break}if(!s.R){e=s;break}s=s.R}!function(t){ok[t.index]={site:t,halfedges:[]}}(t);var u=Qx(t);if(ak.insert(e,u),e||n){if(e===n)return Xx(e),n=Qx(e.site),ak.insert(u,n),u.edge=n.edge=Fx(e.site,u.site),Kx(e),void Kx(n);if(n){Xx(e),Xx(n);var c=e.site,f=c[0],l=c[1],h=t[0]-f,d=t[1]-l,p=n.site,g=p[0]-f,y=p[1]-l,b=2*(h*y-d*g),v=h*h+d*d,m=g*g+y*y,_=[(y*v-d*m)/b+f,(h*m-g*v)/b+l];jx(n.edge,c,p,_),u.edge=Fx(c,t,null,_),n.edge=Fx(t,p,null,_),Kx(e),Kx(n)}else u.edge=Fx(e.site,u.site)}}function rk(t,e){var n=t.site,r=n[0],i=n[1],a=i-e;if(!a)return r;var o=t.P;if(!o)return-1/0;var s=(n=o.site)[0],u=n[1],c=u-e;if(!c)return s;var f=s-r,l=1/a-1/c,h=f/c;return l?(-h+Math.sqrt(h*h-2*l*(f*f/(-2*c)-u+c/2+i-a/2)))/l+r:(r+s)/2}function ik(t,e){var n=t.N;if(n)return rk(n,e);var r=t.site;return r[1]===e?r[0]:1/0}var ak,ok,sk,uk,ck=1e-6,fk=1e-12;function lk(t,e){return e[1]-t[1]||e[0]-t[0]}function hk(t,e){var n,r,i,a=t.sort(lk).pop();for(uk=[],ok=new Array(t.length),ak=new Px,sk=new Px;;)if(i=Gx,a&&(!i||a[1]<i.y||a[1]===i.y&&a[0]<i.x))a[0]===n&&a[1]===r||(nk(a),n=a[0],r=a[1]),a=t.pop();else{if(!i)break;ek(i.arc)}if(function(){for(var t,e,n,r,i=0,a=ok.length;i<a;++i)if((t=ok[i])&&(r=(e=t.halfedges).length)){var o=new Array(r),s=new Array(r);for(n=0;n<r;++n)o[n]=n,s[n]=Yx(t,uk[e[n]]);for(o.sort((function(t,e){return s[e]-s[t]})),n=0;n<r;++n)s[n]=e[o[n]];for(n=0;n<r;++n)e[n]=s[n]}}(),e){var o=+e[0][0],s=+e[0][1],u=+e[1][0],c=+e[1][1];!function(t,e,n,r){for(var i,a=uk.length;a--;)zx(i=uk[a],t,e,n,r)&&Ux(i,t,e,n,r)&&(Math.abs(i[0][0]-i[1][0])>ck||Math.abs(i[0][1]-i[1][1])>ck)||delete uk[a]}(o,s,u,c),function(t,e,n,r){var i,a,o,s,u,c,f,l,h,d,p,g,y=ok.length,b=!0;for(i=0;i<y;++i)if(a=ok[i]){for(o=a.site,s=(u=a.halfedges).length;s--;)uk[u[s]]||u.splice(s,1);for(s=0,c=u.length;s<c;)p=(d=Hx(a,uk[u[s]]))[0],g=d[1],l=(f=Vx(a,uk[u[++s%c]]))[0],h=f[1],(Math.abs(p-l)>ck||Math.abs(g-h)>ck)&&(u.splice(s,0,uk.push(qx(o,d,Math.abs(p-t)<ck&&r-g>ck?[t,Math.abs(l-t)<ck?h:r]:Math.abs(g-r)<ck&&n-p>ck?[Math.abs(h-r)<ck?l:n,r]:Math.abs(p-n)<ck&&g-e>ck?[n,Math.abs(l-n)<ck?h:e]:Math.abs(g-e)<ck&&p-t>ck?[Math.abs(h-e)<ck?l:t,e]:null))-1),++c);c&&(b=!1)}if(b){var v,m,_,w=1/0;for(i=0,b=null;i<y;++i)(a=ok[i])&&(_=(v=(o=a.site)[0]-t)*v+(m=o[1]-e)*m)<w&&(w=_,b=a);if(b){var x=[t,e],k=[t,r],E=[n,r],A=[n,e];b.halfedges.push(uk.push(qx(o=b.site,x,k))-1,uk.push(qx(o,k,E))-1,uk.push(qx(o,E,A))-1,uk.push(qx(o,A,x))-1)}}for(i=0;i<y;++i)(a=ok[i])&&(a.halfedges.length||delete ok[i])}(o,s,u,c)}this.edges=uk,this.cells=ok,ak=sk=uk=ok=null}hk.prototype={constructor:hk,polygons:function(){var t=this.edges;return this.cells.map((function(e){var n=e.halfedges.map((function(n){return Vx(e,t[n])}));return n.data=e.site.data,n}))},triangles:function(){var t=[],e=this.edges;return this.cells.forEach((function(n,r){if(a=(i=n.halfedges).length)for(var i,a,o,s,u,c,f=n.site,l=-1,h=e[i[a-1]],d=h.left===f?h.right:h.left;++l<a;)o=d,d=(h=e[i[l]]).left===f?h.right:h.left,o&&d&&r<o.index&&r<d.index&&(u=o,c=d,((s=f)[0]-c[0])*(u[1]-s[1])-(s[0]-u[0])*(c[1]-s[1])<0)&&t.push([f.data,o.data,d.data])})),t},links:function(){return this.edges.filter((function(t){return t.right})).map((function(t){return{source:t.left.data,target:t.right.data}}))},find:function(t,e,n){for(var r,i,a=this,o=a._found||0,s=a.cells.length;!(i=a.cells[o]);)if(++o>=s)return null;var u=t-i.site[0],c=e-i.site[1],f=u*u+c*c;do{i=a.cells[r=o],o=null,i.halfedges.forEach((function(n){var r=a.edges[n],s=r.left;if(s!==i.site&&s||(s=r.right)){var u=t-s[0],c=e-s[1],l=u*u+c*c;l<f&&(f=l,o=s.index)}}))}while(null!==o);return a._found=r,null==n||f<=n*n?i.site:null}};var dk=function(){var t=Cx,e=Nx,n=null;function r(r){return new hk(r.map((function(n,i){var a=[Math.round(t(n,i,r)/ck)*ck,Math.round(e(n,i,r)/ck)*ck];return a.index=i,a.data=n,a})),n)}return r.polygons=function(t){return r(t).polygons()},r.links=function(t){return r(t).links()},r.triangles=function(t){return r(t).triangles()},r.x=function(e){return arguments.length?(t="function"==typeof e?e:Dx(+e),r):t},r.y=function(t){return arguments.length?(e="function"==typeof t?t:Dx(+t),r):e},r.extent=function(t){return arguments.length?(n=null==t?null:[[+t[0][0],+t[0][1]],[+t[1][0],+t[1][1]]],r):n&&[[n[0][0],n[0][1]],[n[1][0],n[1][1]]]},r.size=function(t){return arguments.length?(n=null==t?null:[[0,0],[+t[0],+t[1]]],r):n&&[n[1][0]-n[0][0],n[1][1]-n[0][1]]},r},pk=function(t){return function(){return t}};function gk(t,e,n){this.target=t,this.type=e,this.transform=n}function yk(t,e,n){this.k=t,this.x=e,this.y=n}yk.prototype={constructor:yk,scale:function(t){return 1===t?this:new yk(this.k*t,this.x,this.y)},translate:function(t,e){return 0===t&0===e?this:new yk(this.k,this.x+this.k*t,this.y+this.k*e)},apply:function(t){return[t[0]*this.k+this.x,t[1]*this.k+this.y]},applyX:function(t){return t*this.k+this.x},applyY:function(t){return t*this.k+this.y},invert:function(t){return[(t[0]-this.x)/this.k,(t[1]-this.y)/this.k]},invertX:function(t){return(t-this.x)/this.k},invertY:function(t){return(t-this.y)/this.k},rescaleX:function(t){return t.copy().domain(t.range().map(this.invertX,this).map(t.invert,t))},rescaleY:function(t){return t.copy().domain(t.range().map(this.invertY,this).map(t.invert,t))},toString:function(){return"translate("+this.x+","+this.y+") scale("+this.k+")"}};var bk=new yk(1,0,0);function vk(t){for(;!t.__zoom;)if(!(t=t.parentNode))return bk;return t.__zoom}function mk(){ue.stopImmediatePropagation()}vk.prototype=yk.prototype;var _k=function(){ue.preventDefault(),ue.stopImmediatePropagation()};function wk(){return!ue.ctrlKey&&!ue.button}function xk(){var t=this;return t instanceof SVGElement?(t=t.ownerSVGElement||t).hasAttribute("viewBox")?[[(t=t.viewBox.baseVal).x,t.y],[t.x+t.width,t.y+t.height]]:[[0,0],[t.width.baseVal.value,t.height.baseVal.value]]:[[0,0],[t.clientWidth,t.clientHeight]]}function kk(){return this.__zoom||bk}function Ek(){return-ue.deltaY*(1===ue.deltaMode?.05:ue.deltaMode?1:.002)}function Ak(){return navigator.maxTouchPoints||"ontouchstart"in this}function Sk(t,e,n){var r=t.invertX(e[0][0])-n[0][0],i=t.invertX(e[1][0])-n[1][0],a=t.invertY(e[0][1])-n[0][1],o=t.invertY(e[1][1])-n[1][1];return t.translate(i>r?(r+i)/2:Math.min(0,r)||Math.max(0,i),o>a?(a+o)/2:Math.min(0,a)||Math.max(0,o))}var Mk=function(){var t,e,n=wk,r=xk,i=Sk,a=Ek,o=Ak,s=[0,1/0],u=[[-1/0,-1/0],[1/0,1/0]],c=250,f=hp,l=ft("start","zoom","end"),h=0;function d(t){t.property("__zoom",kk).on("wheel.zoom",_).on("mousedown.zoom",w).on("dblclick.zoom",x).filter(o).on("touchstart.zoom",k).on("touchmove.zoom",E).on("touchend.zoom touchcancel.zoom",A).style("touch-action","none").style("-webkit-tap-highlight-color","rgba(0,0,0,0)")}function p(t,e){return(e=Math.max(s[0],Math.min(s[1],e)))===t.k?t:new yk(e,t.x,t.y)}function g(t,e,n){var r=e[0]-n[0]*t.k,i=e[1]-n[1]*t.k;return r===t.x&&i===t.y?t:new yk(t.k,r,i)}function y(t){return[(+t[0][0]+ +t[1][0])/2,(+t[0][1]+ +t[1][1])/2]}function b(t,e,n){t.on("start.zoom",(function(){v(this,arguments).start()})).on("interrupt.zoom end.zoom",(function(){v(this,arguments).end()})).tween("zoom",(function(){var t=this,i=arguments,a=v(t,i),o=r.apply(t,i),s=null==n?y(o):"function"==typeof n?n.apply(t,i):n,u=Math.max(o[1][0]-o[0][0],o[1][1]-o[0][1]),c=t.__zoom,l="function"==typeof e?e.apply(t,i):e,h=f(c.invert(s).concat(u/c.k),l.invert(s).concat(u/l.k));return function(t){if(1===t)t=l;else{var e=h(t),n=u/e[2];t=new yk(n,s[0]-e[0]*n,s[1]-e[1]*n)}a.zoom(null,t)}}))}function v(t,e,n){return!n&&t.__zooming||new m(t,e)}function m(t,e){this.that=t,this.args=e,this.active=0,this.extent=r.apply(t,e),this.taps=0}function _(){if(n.apply(this,arguments)){var t=v(this,arguments),e=this.__zoom,r=Math.max(s[0],Math.min(s[1],e.k*Math.pow(2,a.apply(this,arguments)))),o=In(this);if(t.wheel)t.mouse[0][0]===o[0]&&t.mouse[0][1]===o[1]||(t.mouse[1]=e.invert(t.mouse[0]=o)),clearTimeout(t.wheel);else{if(e.k===r)return;t.mouse=[o,e.invert(o)],or(this),t.start()}_k(),t.wheel=setTimeout(c,150),t.zoom("mouse",i(g(p(e,r),t.mouse[0],t.mouse[1]),t.extent,u))}function c(){t.wheel=null,t.end()}}function w(){if(!e&&n.apply(this,arguments)){var t=v(this,arguments,!0),r=xe(ue.view).on("mousemove.zoom",c,!0).on("mouseup.zoom",f,!0),a=In(this),o=ue.clientX,s=ue.clientY;Ae(ue.view),mk(),t.mouse=[a,this.__zoom.invert(a)],or(this),t.start()}function c(){if(_k(),!t.moved){var e=ue.clientX-o,n=ue.clientY-s;t.moved=e*e+n*n>h}t.zoom("mouse",i(g(t.that.__zoom,t.mouse[0]=In(t.that),t.mouse[1]),t.extent,u))}function f(){r.on("mousemove.zoom mouseup.zoom",null),Se(ue.view,t.moved),_k(),t.end()}}function x(){if(n.apply(this,arguments)){var t=this.__zoom,e=In(this),a=t.invert(e),o=t.k*(ue.shiftKey?.5:2),s=i(g(p(t,o),e,a),r.apply(this,arguments),u);_k(),c>0?xe(this).transition().duration(c).call(b,s,e):xe(this).call(d.transform,s)}}function k(){if(n.apply(this,arguments)){var e,r,i,a,o=ue.touches,s=o.length,u=v(this,arguments,ue.changedTouches.length===s);for(mk(),r=0;r<s;++r)i=o[r],a=[a=Nn(this,o,i.identifier),this.__zoom.invert(a),i.identifier],u.touch0?u.touch1||u.touch0[2]===a[2]||(u.touch1=a,u.taps=0):(u.touch0=a,e=!0,u.taps=1+!!t);t&&(t=clearTimeout(t)),e&&(u.taps<2&&(t=setTimeout((function(){t=null}),500)),or(this),u.start())}}function E(){if(this.__zooming){var e,n,r,a,o=v(this,arguments),s=ue.changedTouches,c=s.length;for(_k(),t&&(t=clearTimeout(t)),o.taps=0,e=0;e<c;++e)n=s[e],r=Nn(this,s,n.identifier),o.touch0&&o.touch0[2]===n.identifier?o.touch0[0]=r:o.touch1&&o.touch1[2]===n.identifier&&(o.touch1[0]=r);if(n=o.that.__zoom,o.touch1){var f=o.touch0[0],l=o.touch0[1],h=o.touch1[0],d=o.touch1[1],y=(y=h[0]-f[0])*y+(y=h[1]-f[1])*y,b=(b=d[0]-l[0])*b+(b=d[1]-l[1])*b;n=p(n,Math.sqrt(y/b)),r=[(f[0]+h[0])/2,(f[1]+h[1])/2],a=[(l[0]+d[0])/2,(l[1]+d[1])/2]}else{if(!o.touch0)return;r=o.touch0[0],a=o.touch0[1]}o.zoom("touch",i(g(n,r,a),o.extent,u))}}function A(){if(this.__zooming){var t,n,r=v(this,arguments),i=ue.changedTouches,a=i.length;for(mk(),e&&clearTimeout(e),e=setTimeout((function(){e=null}),500),t=0;t<a;++t)n=i[t],r.touch0&&r.touch0[2]===n.identifier?delete r.touch0:r.touch1&&r.touch1[2]===n.identifier&&delete r.touch1;if(r.touch1&&!r.touch0&&(r.touch0=r.touch1,delete r.touch1),r.touch0)r.touch0[1]=this.__zoom.invert(r.touch0[0]);else if(r.end(),2===r.taps){var o=xe(this).on("dblclick.zoom");o&&o.apply(this,arguments)}}}return d.transform=function(t,e,n){var r=t.selection?t.selection():t;r.property("__zoom",kk),t!==r?b(t,e,n):r.interrupt().each((function(){v(this,arguments).start().zoom(null,"function"==typeof e?e.apply(this,arguments):e).end()}))},d.scaleBy=function(t,e,n){d.scaleTo(t,(function(){var t=this.__zoom.k,n="function"==typeof e?e.apply(this,arguments):e;return t*n}),n)},d.scaleTo=function(t,e,n){d.transform(t,(function(){var t=r.apply(this,arguments),a=this.__zoom,o=null==n?y(t):"function"==typeof n?n.apply(this,arguments):n,s=a.invert(o),c="function"==typeof e?e.apply(this,arguments):e;return i(g(p(a,c),o,s),t,u)}),n)},d.translateBy=function(t,e,n){d.transform(t,(function(){return i(this.__zoom.translate("function"==typeof e?e.apply(this,arguments):e,"function"==typeof n?n.apply(this,arguments):n),r.apply(this,arguments),u)}))},d.translateTo=function(t,e,n,a){d.transform(t,(function(){var t=r.apply(this,arguments),o=this.__zoom,s=null==a?y(t):"function"==typeof a?a.apply(this,arguments):a;return i(bk.translate(s[0],s[1]).scale(o.k).translate("function"==typeof e?-e.apply(this,arguments):-e,"function"==typeof n?-n.apply(this,arguments):-n),t,u)}),a)},m.prototype={start:function(){return 1==++this.active&&(this.that.__zooming=this,this.emit("start")),this},zoom:function(t,e){return this.mouse&&"mouse"!==t&&(this.mouse[1]=e.invert(this.mouse[0])),this.touch0&&"touch"!==t&&(this.touch0[1]=e.invert(this.touch0[0])),this.touch1&&"touch"!==t&&(this.touch1[1]=e.invert(this.touch1[0])),this.that.__zoom=e,this.emit("zoom"),this},end:function(){return 0==--this.active&&(delete this.that.__zooming,this.emit("end")),this},emit:function(t){pe(new gk(d,t,this.that.__zoom),l.apply,l,[t,this.that,this.args])}},d.wheelDelta=function(t){return arguments.length?(a="function"==typeof t?t:pk(+t),d):a},d.filter=function(t){return arguments.length?(n="function"==typeof t?t:pk(!!t),d):n},d.touchable=function(t){return arguments.length?(o="function"==typeof t?t:pk(!!t),d):o},d.extent=function(t){return arguments.length?(r="function"==typeof t?t:pk([[+t[0][0],+t[0][1]],[+t[1][0],+t[1][1]]]),d):r},d.scaleExtent=function(t){return arguments.length?(s[0]=+t[0],s[1]=+t[1],d):[s[0],s[1]]},d.translateExtent=function(t){return arguments.length?(u[0][0]=+t[0][0],u[1][0]=+t[1][0],u[0][1]=+t[0][1],u[1][1]=+t[1][1],d):[[u[0][0],u[0][1]],[u[1][0],u[1][1]]]},d.constrain=function(t){return arguments.length?(i=t,d):i},d.duration=function(t){return arguments.length?(c=+t,d):c},d.interpolate=function(t){return arguments.length?(f=t,d):f},d.on=function(){var t=l.on.apply(l,arguments);return t===l?d:t},d.clickDistance=function(t){return arguments.length?(h=(t=+t)*t,d):Math.sqrt(h)},d};n.d(e,"version",(function(){return"5.15.0"})),n.d(e,"bisect",(function(){return u})),n.d(e,"bisectRight",(function(){return o})),n.d(e,"bisectLeft",(function(){return s})),n.d(e,"ascending",(function(){return r})),n.d(e,"bisector",(function(){return i})),n.d(e,"cross",(function(){return l})),n.d(e,"descending",(function(){return h})),n.d(e,"deviation",(function(){return g})),n.d(e,"extent",(function(){return y})),n.d(e,"histogram",(function(){return C})),n.d(e,"thresholdFreedmanDiaconis",(function(){return I})),n.d(e,"thresholdScott",(function(){return L})),n.d(e,"thresholdSturges",(function(){return D})),n.d(e,"max",(function(){return B})),n.d(e,"mean",(function(){return O})),n.d(e,"median",(function(){return R})),n.d(e,"merge",(function(){return P})),n.d(e,"min",(function(){return F})),n.d(e,"pairs",(function(){return c})),n.d(e,"permute",(function(){return q})),n.d(e,"quantile",(function(){return N})),n.d(e,"range",(function(){return x})),n.d(e,"scan",(function(){return j})),n.d(e,"shuffle",(function(){return U})),n.d(e,"sum",(function(){return z})),n.d(e,"ticks",(function(){return S})),n.d(e,"tickIncrement",(function(){return M})),n.d(e,"tickStep",(function(){return T})),n.d(e,"transpose",(function(){return Y})),n.d(e,"variance",(function(){return p})),n.d(e,"zip",(function(){return H})),n.d(e,"axisTop",(function(){return tt})),n.d(e,"axisRight",(function(){return et})),n.d(e,"axisBottom",(function(){return nt})),n.d(e,"axisLeft",(function(){return rt})),n.d(e,"brush",(function(){return Ai})),n.d(e,"brushX",(function(){return ki})),n.d(e,"brushY",(function(){return Ei})),n.d(e,"brushSelection",(function(){return xi})),n.d(e,"chord",(function(){return Bi})),n.d(e,"ribbon",(function(){return Wi})),n.d(e,"nest",(function(){return Ji})),n.d(e,"set",(function(){return oa})),n.d(e,"map",(function(){return Zi})),n.d(e,"keys",(function(){return sa})),n.d(e,"values",(function(){return ua})),n.d(e,"entries",(function(){return ca})),n.d(e,"color",(function(){return Ye})),n.d(e,"rgb",(function(){return $e})),n.d(e,"hsl",(function(){return tn})),n.d(e,"lab",(function(){return pa})),n.d(e,"hcl",(function(){return xa})),n.d(e,"lch",(function(){return wa})),n.d(e,"gray",(function(){return da})),n.d(e,"cubehelix",(function(){return Ca})),n.d(e,"contours",(function(){return ja})),n.d(e,"contourDensity",(function(){return Ga})),n.d(e,"dispatch",(function(){return ft})),n.d(e,"drag",(function(){return Qa})),n.d(e,"dragDisable",(function(){return Ae})),n.d(e,"dragEnable",(function(){return Se})),n.d(e,"dsvFormat",(function(){return oo})),n.d(e,"csvParse",(function(){return uo})),n.d(e,"csvParseRows",(function(){return co})),n.d(e,"csvFormat",(function(){return fo})),n.d(e,"csvFormatBody",(function(){return lo})),n.d(e,"csvFormatRows",(function(){return ho})),n.d(e,"csvFormatRow",(function(){return po})),n.d(e,"csvFormatValue",(function(){return go})),n.d(e,"tsvParse",(function(){return bo})),n.d(e,"tsvParseRows",(function(){return vo})),n.d(e,"tsvFormat",(function(){return mo})),n.d(e,"tsvFormatBody",(function(){return _o})),n.d(e,"tsvFormatRows",(function(){return wo})),n.d(e,"tsvFormatRow",(function(){return xo})),n.d(e,"tsvFormatValue",(function(){return ko})),n.d(e,"autoType",(function(){return Eo})),n.d(e,"easeLinear",(function(){return So})),n.d(e,"easeQuad",(function(){return Do})),n.d(e,"easeQuadIn",(function(){return Mo})),n.d(e,"easeQuadOut",(function(){return To})),n.d(e,"easeQuadInOut",(function(){return Do})),n.d(e,"easeCubic",(function(){return Gr})),n.d(e,"easeCubicIn",(function(){return Vr})),n.d(e,"easeCubicOut",(function(){return Hr})),n.d(e,"easeCubicInOut",(function(){return Gr})),n.d(e,"easePoly",(function(){return Io})),n.d(e,"easePolyIn",(function(){return Co})),n.d(e,"easePolyOut",(function(){return No})),n.d(e,"easePolyInOut",(function(){return Io})),n.d(e,"easeSin",(function(){return Po})),n.d(e,"easeSinIn",(function(){return Oo})),n.d(e,"easeSinOut",(function(){return Ro})),n.d(e,"easeSinInOut",(function(){return Po})),n.d(e,"easeExp",(function(){return jo})),n.d(e,"easeExpIn",(function(){return Fo})),n.d(e,"easeExpOut",(function(){return qo})),n.d(e,"easeExpInOut",(function(){return jo})),n.d(e,"easeCircle",(function(){return Yo})),n.d(e,"easeCircleIn",(function(){return Uo})),n.d(e,"easeCircleOut",(function(){return zo})),n.d(e,"easeCircleInOut",(function(){return Yo})),n.d(e,"easeBounce",(function(){return Ho})),n.d(e,"easeBounceIn",(function(){return Vo})),n.d(e,"easeBounceOut",(function(){return Ho})),n.d(e,"easeBounceInOut",(function(){return Go})),n.d(e,"easeBack",(function(){return Ko})),n.d(e,"easeBackIn",(function(){return $o})),n.d(e,"easeBackOut",(function(){return Wo})),n.d(e,"easeBackInOut",(function(){return Ko})),n.d(e,"easeElastic",(function(){return Jo})),n.d(e,"easeElasticIn",(function(){return Zo})),n.d(e,"easeElasticOut",(function(){return Jo})),n.d(e,"easeElasticInOut",(function(){return Qo})),n.d(e,"blob",(function(){return es})),n.d(e,"buffer",(function(){return rs})),n.d(e,"dsv",(function(){return ss})),n.d(e,"csv",(function(){return us})),n.d(e,"tsv",(function(){return cs})),n.d(e,"image",(function(){return fs})),n.d(e,"json",(function(){return hs})),n.d(e,"text",(function(){return as})),n.d(e,"xml",(function(){return ps})),n.d(e,"html",(function(){return gs})),n.d(e,"svg",(function(){return ys})),n.d(e,"forceCenter",(function(){return bs})),n.d(e,"forceCollide",(function(){return Cs})),n.d(e,"forceLink",(function(){return Ls})),n.d(e,"forceManyBody",(function(){return Fs})),n.d(e,"forceRadial",(function(){return qs})),n.d(e,"forceSimulation",(function(){return Ps})),n.d(e,"forceX",(function(){return js})),n.d(e,"forceY",(function(){return Us})),n.d(e,"formatDefaultLocale",(function(){return ru})),n.d(e,"format",(function(){return Ks})),n.d(e,"formatPrefix",(function(){return Xs})),n.d(e,"formatLocale",(function(){return nu})),n.d(e,"formatSpecifier",(function(){return Hs})),n.d(e,"FormatSpecifier",(function(){return Gs})),n.d(e,"precisionFixed",(function(){return iu})),n.d(e,"precisionPrefix",(function(){return au})),n.d(e,"precisionRound",(function(){return ou})),n.d(e,"geoArea",(function(){return Zu})),n.d(e,"geoBounds",(function(){return Yc})),n.d(e,"geoCentroid",(function(){return ef})),n.d(e,"geoCircle",(function(){return df})),n.d(e,"geoClipAntimeridian",(function(){return Af})),n.d(e,"geoClipCircle",(function(){return Sf})),n.d(e,"geoClipExtent",(function(){return Nf})),n.d(e,"geoClipRectangle",(function(){return Mf})),n.d(e,"geoContains",(function(){return Kf})),n.d(e,"geoDistance",(function(){return jf})),n.d(e,"geoGraticule",(function(){return Jf})),n.d(e,"geoGraticule10",(function(){return Qf})),n.d(e,"geoInterpolate",(function(){return il})),n.d(e,"geoLength",(function(){return Pf})),n.d(e,"geoPath",(function(){return nh})),n.d(e,"geoAlbers",(function(){return wh})),n.d(e,"geoAlbersUsa",(function(){return xh})),n.d(e,"geoAzimuthalEqualArea",(function(){return Sh})),n.d(e,"geoAzimuthalEqualAreaRaw",(function(){return Ah})),n.d(e,"geoAzimuthalEquidistant",(function(){return Th})),n.d(e,"geoAzimuthalEquidistantRaw",(function(){return Mh})),n.d(e,"geoConicConformal",(function(){return Bh})),n.d(e,"geoConicConformalRaw",(function(){return Lh})),n.d(e,"geoConicEqualArea",(function(){return _h})),n.d(e,"geoConicEqualAreaRaw",(function(){return mh})),n.d(e,"geoConicEquidistant",(function(){return Fh})),n.d(e,"geoConicEquidistantRaw",(function(){return Ph})),n.d(e,"geoEqualEarth",(function(){return Hh})),n.d(e,"geoEqualEarthRaw",(function(){return Vh})),n.d(e,"geoEquirectangular",(function(){return Rh})),n.d(e,"geoEquirectangularRaw",(function(){return Oh})),n.d(e,"geoGnomonic",(function(){return $h})),n.d(e,"geoGnomonicRaw",(function(){return Gh})),n.d(e,"geoIdentity",(function(){return Kh})),n.d(e,"geoProjection",(function(){return yh})),n.d(e,"geoProjectionMutator",(function(){return bh})),n.d(e,"geoMercator",(function(){return Ch})),n.d(e,"geoMercatorRaw",(function(){return Dh})),n.d(e,"geoNaturalEarth1",(function(){return Zh})),n.d(e,"geoNaturalEarth1Raw",(function(){return Xh})),n.d(e,"geoOrthographic",(function(){return Qh})),n.d(e,"geoOrthographicRaw",(function(){return Jh})),n.d(e,"geoStereographic",(function(){return ed})),n.d(e,"geoStereographicRaw",(function(){return td})),n.d(e,"geoTransverseMercator",(function(){return rd})),n.d(e,"geoTransverseMercatorRaw",(function(){return nd})),n.d(e,"geoRotation",(function(){return ff})),n.d(e,"geoStream",(function(){return Yu})),n.d(e,"geoTransform",(function(){return rh})),n.d(e,"cluster",(function(){return sd})),n.d(e,"hierarchy",(function(){return cd})),n.d(e,"pack",(function(){return Bd})),n.d(e,"packSiblings",(function(){return Td})),n.d(e,"packEnclose",(function(){return gd})),n.d(e,"partition",(function(){return jd})),n.d(e,"stratify",(function(){return Hd})),n.d(e,"tree",(function(){return Jd})),n.d(e,"treemap",(function(){return rp})),n.d(e,"treemapBinary",(function(){return ip})),n.d(e,"treemapDice",(function(){return qd})),n.d(e,"treemapSlice",(function(){return Qd})),n.d(e,"treemapSliceDice",(function(){return ap})),n.d(e,"treemapSquarify",(function(){return np})),n.d(e,"treemapResquarify",(function(){return op})),n.d(e,"interpolate",(function(){return Tn})),n.d(e,"interpolateArray",(function(){return vn})),n.d(e,"interpolateBasis",(function(){return an})),n.d(e,"interpolateBasisClosed",(function(){return on})),n.d(e,"interpolateDate",(function(){return _n})),n.d(e,"interpolateDiscrete",(function(){return sp})),n.d(e,"interpolateHue",(function(){return up})),n.d(e,"interpolateNumber",(function(){return wn})),n.d(e,"interpolateNumberArray",(function(){return yn})),n.d(e,"interpolateObject",(function(){return xn})),n.d(e,"interpolateRound",(function(){return cp})),n.d(e,"interpolateString",(function(){return Mn})),n.d(e,"interpolateTransformCss",(function(){return lr})),n.d(e,"interpolateTransformSvg",(function(){return hr})),n.d(e,"interpolateZoom",(function(){return hp})),n.d(e,"interpolateRgb",(function(){return hn})),n.d(e,"interpolateRgbBasis",(function(){return pn})),n.d(e,"interpolateRgbBasisClosed",(function(){return gn})),n.d(e,"interpolateHsl",(function(){return pp})),n.d(e,"interpolateHslLong",(function(){return gp})),n.d(e,"interpolateLab",(function(){return yp})),n.d(e,"interpolateHcl",(function(){return vp})),n.d(e,"interpolateHclLong",(function(){return mp})),n.d(e,"interpolateCubehelix",(function(){return wp})),n.d(e,"interpolateCubehelixLong",(function(){return xp})),n.d(e,"piecewise",(function(){return kp})),n.d(e,"quantize",(function(){return Ep})),n.d(e,"path",(function(){return zi})),n.d(e,"polygonArea",(function(){return Ap})),n.d(e,"polygonCentroid",(function(){return Sp})),n.d(e,"polygonHull",(function(){return Dp})),n.d(e,"polygonContains",(function(){return Cp})),n.d(e,"polygonLength",(function(){return Np})),n.d(e,"quadtree",(function(){return Es})),n.d(e,"randomUniform",(function(){return Lp})),n.d(e,"randomNormal",(function(){return Bp})),n.d(e,"randomLogNormal",(function(){return Op})),n.d(e,"randomBates",(function(){return Pp})),n.d(e,"randomIrwinHall",(function(){return Rp})),n.d(e,"randomExponential",(function(){return Fp})),n.d(e,"scaleBand",(function(){return Gp})),n.d(e,"scalePoint",(function(){return Wp})),n.d(e,"scaleIdentity",(function(){return ug})),n.d(e,"scaleLinear",(function(){return sg})),n.d(e,"scaleLog",(function(){return bg})),n.d(e,"scaleSymlog",(function(){return wg})),n.d(e,"scaleOrdinal",(function(){return Hp})),n.d(e,"scaleImplicit",(function(){return Vp})),n.d(e,"scalePow",(function(){return Sg})),n.d(e,"scaleSqrt",(function(){return Mg})),n.d(e,"scaleQuantile",(function(){return Tg})),n.d(e,"scaleQuantize",(function(){return Dg})),n.d(e,"scaleThreshold",(function(){return Cg})),n.d(e,"scaleTime",(function(){return sv})),n.d(e,"scaleUtc",(function(){return bv})),n.d(e,"scaleSequential",(function(){return _v})),n.d(e,"scaleSequentialLog",(function(){return wv})),n.d(e,"scaleSequentialPow",(function(){return kv})),n.d(e,"scaleSequentialSqrt",(function(){return Ev})),n.d(e,"scaleSequentialSymlog",(function(){return xv})),n.d(e,"scaleSequentialQuantile",(function(){return Av})),n.d(e,"scaleDiverging",(function(){return Mv})),n.d(e,"scaleDivergingLog",(function(){return Tv})),n.d(e,"scaleDivergingPow",(function(){return Cv})),n.d(e,"scaleDivergingSqrt",(function(){return Nv})),n.d(e,"scaleDivergingSymlog",(function(){return Dv})),n.d(e,"tickFormat",(function(){return ag})),n.d(e,"schemeCategory10",(function(){return Lv})),n.d(e,"schemeAccent",(function(){return Bv})),n.d(e,"schemeDark2",(function(){return Ov})),n.d(e,"schemePaired",(function(){return Rv})),n.d(e,"schemePastel1",(function(){return Pv})),n.d(e,"schemePastel2",(function(){return Fv})),n.d(e,"schemeSet1",(function(){return qv})),n.d(e,"schemeSet2",(function(){return jv})),n.d(e,"schemeSet3",(function(){return Uv})),n.d(e,"schemeTableau10",(function(){return zv})),n.d(e,"interpolateBrBG",(function(){return Hv})),n.d(e,"schemeBrBG",(function(){return Vv})),n.d(e,"interpolatePRGn",(function(){return $v})),n.d(e,"schemePRGn",(function(){return Gv})),n.d(e,"interpolatePiYG",(function(){return Kv})),n.d(e,"schemePiYG",(function(){return Wv})),n.d(e,"interpolatePuOr",(function(){return Zv})),n.d(e,"schemePuOr",(function(){return Xv})),n.d(e,"interpolateRdBu",(function(){return Qv})),n.d(e,"schemeRdBu",(function(){return Jv})),n.d(e,"interpolateRdGy",(function(){return em})),n.d(e,"schemeRdGy",(function(){return tm})),n.d(e,"interpolateRdYlBu",(function(){return rm})),n.d(e,"schemeRdYlBu",(function(){return nm})),n.d(e,"interpolateRdYlGn",(function(){return am})),n.d(e,"schemeRdYlGn",(function(){return im})),n.d(e,"interpolateSpectral",(function(){return sm})),n.d(e,"schemeSpectral",(function(){return om})),n.d(e,"interpolateBuGn",(function(){return cm})),n.d(e,"schemeBuGn",(function(){return um})),n.d(e,"interpolateBuPu",(function(){return lm})),n.d(e,"schemeBuPu",(function(){return fm})),n.d(e,"interpolateGnBu",(function(){return dm})),n.d(e,"schemeGnBu",(function(){return hm})),n.d(e,"interpolateOrRd",(function(){return gm})),n.d(e,"schemeOrRd",(function(){return pm})),n.d(e,"interpolatePuBuGn",(function(){return bm})),n.d(e,"schemePuBuGn",(function(){return ym})),n.d(e,"interpolatePuBu",(function(){return mm})),n.d(e,"schemePuBu",(function(){return vm})),n.d(e,"interpolatePuRd",(function(){return wm})),n.d(e,"schemePuRd",(function(){return _m})),n.d(e,"interpolateRdPu",(function(){return km})),n.d(e,"schemeRdPu",(function(){return xm})),n.d(e,"interpolateYlGnBu",(function(){return Am})),n.d(e,"schemeYlGnBu",(function(){return Em})),n.d(e,"interpolateYlGn",(function(){return Mm})),n.d(e,"schemeYlGn",(function(){return Sm})),n.d(e,"interpolateYlOrBr",(function(){return Dm})),n.d(e,"schemeYlOrBr",(function(){return Tm})),n.d(e,"interpolateYlOrRd",(function(){return Nm})),n.d(e,"schemeYlOrRd",(function(){return Cm})),n.d(e,"interpolateBlues",(function(){return Lm})),n.d(e,"schemeBlues",(function(){return Im})),n.d(e,"interpolateGreens",(function(){return Om})),n.d(e,"schemeGreens",(function(){return Bm})),n.d(e,"interpolateGreys",(function(){return Pm})),n.d(e,"schemeGreys",(function(){return Rm})),n.d(e,"interpolatePurples",(function(){return qm})),n.d(e,"schemePurples",(function(){return Fm})),n.d(e,"interpolateReds",(function(){return Um})),n.d(e,"schemeReds",(function(){return jm})),n.d(e,"interpolateOranges",(function(){return Ym})),n.d(e,"schemeOranges",(function(){return zm})),n.d(e,"interpolateCividis",(function(){return Vm})),n.d(e,"interpolateCubehelixDefault",(function(){return Hm})),n.d(e,"interpolateRainbow",(function(){return Km})),n.d(e,"interpolateWarm",(function(){return Gm})),n.d(e,"interpolateCool",(function(){return $m})),n.d(e,"interpolateSinebow",(function(){return Qm})),n.d(e,"interpolateTurbo",(function(){return t_})),n.d(e,"interpolateViridis",(function(){return n_})),n.d(e,"interpolateMagma",(function(){return r_})),n.d(e,"interpolateInferno",(function(){return i_})),n.d(e,"interpolatePlasma",(function(){return a_})),n.d(e,"create",(function(){return o_})),n.d(e,"creator",(function(){return ne})),n.d(e,"local",(function(){return u_})),n.d(e,"matcher",(function(){return gt})),n.d(e,"mouse",(function(){return In})),n.d(e,"namespace",(function(){return kt})),n.d(e,"namespaces",(function(){return xt})),n.d(e,"clientPoint",(function(){return Cn})),n.d(e,"select",(function(){return xe})),n.d(e,"selectAll",(function(){return f_})),n.d(e,"selection",(function(){return we})),n.d(e,"selector",(function(){return ht})),n.d(e,"selectorAll",(function(){return pt})),n.d(e,"style",(function(){return Bt})),n.d(e,"touch",(function(){return Nn})),n.d(e,"touches",(function(){return l_})),n.d(e,"window",(function(){return Ct})),n.d(e,"event",(function(){return ue})),n.d(e,"customEvent",(function(){return pe})),n.d(e,"arc",(function(){return I_})),n.d(e,"area",(function(){return F_})),n.d(e,"line",(function(){return P_})),n.d(e,"pie",(function(){return U_})),n.d(e,"areaRadial",(function(){return $_})),n.d(e,"radialArea",(function(){return $_})),n.d(e,"lineRadial",(function(){return G_})),n.d(e,"radialLine",(function(){return G_})),n.d(e,"pointRadial",(function(){return W_})),n.d(e,"linkHorizontal",(function(){return nw})),n.d(e,"linkVertical",(function(){return rw})),n.d(e,"linkRadial",(function(){return iw})),n.d(e,"symbol",(function(){return xw})),n.d(e,"symbols",(function(){return ww})),n.d(e,"symbolCircle",(function(){return aw})),n.d(e,"symbolCross",(function(){return ow})),n.d(e,"symbolDiamond",(function(){return cw})),n.d(e,"symbolSquare",(function(){return pw})),n.d(e,"symbolStar",(function(){return dw})),n.d(e,"symbolTriangle",(function(){return yw})),n.d(e,"symbolWye",(function(){return _w})),n.d(e,"curveBasisClosed",(function(){return Tw})),n.d(e,"curveBasisOpen",(function(){return Cw})),n.d(e,"curveBasis",(function(){return Sw})),n.d(e,"curveBundle",(function(){return Iw})),n.d(e,"curveCardinalClosed",(function(){return Pw})),n.d(e,"curveCardinalOpen",(function(){return qw})),n.d(e,"curveCardinal",(function(){return Ow})),n.d(e,"curveCatmullRomClosed",(function(){return Vw})),n.d(e,"curveCatmullRomOpen",(function(){return Gw})),n.d(e,"curveCatmullRom",(function(){return zw})),n.d(e,"curveLinearClosed",(function(){return Ww})),n.d(e,"curveLinear",(function(){return B_})),n.d(e,"curveMonotoneX",(function(){return nx})),n.d(e,"curveMonotoneY",(function(){return rx})),n.d(e,"curveNatural",(function(){return ox})),n.d(e,"curveStep",(function(){return ux})),n.d(e,"curveStepAfter",(function(){return fx})),n.d(e,"curveStepBefore",(function(){return cx})),n.d(e,"stack",(function(){return px})),n.d(e,"stackOffsetExpand",(function(){return gx})),n.d(e,"stackOffsetDiverging",(function(){return yx})),n.d(e,"stackOffsetNone",(function(){return lx})),n.d(e,"stackOffsetSilhouette",(function(){return bx})),n.d(e,"stackOffsetWiggle",(function(){return vx})),n.d(e,"stackOrderAppearance",(function(){return mx})),n.d(e,"stackOrderAscending",(function(){return wx})),n.d(e,"stackOrderDescending",(function(){return kx})),n.d(e,"stackOrderInsideOut",(function(){return Ex})),n.d(e,"stackOrderNone",(function(){return hx})),n.d(e,"stackOrderReverse",(function(){return Ax})),n.d(e,"timeInterval",(function(){return Lg})),n.d(e,"timeMillisecond",(function(){return py})),n.d(e,"timeMilliseconds",(function(){return gy})),n.d(e,"utcMillisecond",(function(){return py})),n.d(e,"utcMilliseconds",(function(){return gy})),n.d(e,"timeSecond",(function(){return ly})),n.d(e,"timeSeconds",(function(){return hy})),n.d(e,"utcSecond",(function(){return ly})),n.d(e,"utcSeconds",(function(){return hy})),n.d(e,"timeMinute",(function(){return uy})),n.d(e,"timeMinutes",(function(){return cy})),n.d(e,"timeHour",(function(){return ay})),n.d(e,"timeHours",(function(){return oy})),n.d(e,"timeDay",(function(){return ny})),n.d(e,"timeDays",(function(){return ry})),n.d(e,"timeWeek",(function(){return Ug})),n.d(e,"timeWeeks",(function(){return Wg})),n.d(e,"timeSunday",(function(){return Ug})),n.d(e,"timeSundays",(function(){return Wg})),n.d(e,"timeMonday",(function(){return zg})),n.d(e,"timeMondays",(function(){return Kg})),n.d(e,"timeTuesday",(function(){return Yg})),n.d(e,"timeTuesdays",(function(){return Xg})),n.d(e,"timeWednesday",(function(){return Vg})),n.d(e,"timeWednesdays",(function(){return Zg})),n.d(e,"timeThursday",(function(){return Hg})),n.d(e,"timeThursdays",(function(){return Jg})),n.d(e,"timeFriday",(function(){return Gg})),n.d(e,"timeFridays",(function(){return Qg})),n.d(e,"timeSaturday",(function(){return $g})),n.d(e,"timeSaturdays",(function(){return ty})),n.d(e,"timeMonth",(function(){return Fg})),n.d(e,"timeMonths",(function(){return qg})),n.d(e,"timeYear",(function(){return Og})),n.d(e,"timeYears",(function(){return Rg})),n.d(e,"utcMinute",(function(){return gv})),n.d(e,"utcMinutes",(function(){return yv})),n.d(e,"utcHour",(function(){return hv})),n.d(e,"utcHours",(function(){return dv})),n.d(e,"utcDay",(function(){return Iy})),n.d(e,"utcDays",(function(){return Ly})),n.d(e,"utcWeek",(function(){return by})),n.d(e,"utcWeeks",(function(){return Ey})),n.d(e,"utcSunday",(function(){return by})),n.d(e,"utcSundays",(function(){return Ey})),n.d(e,"utcMonday",(function(){return vy})),n.d(e,"utcMondays",(function(){return Ay})),n.d(e,"utcTuesday",(function(){return my})),n.d(e,"utcTuesdays",(function(){return Sy})),n.d(e,"utcWednesday",(function(){return _y})),n.d(e,"utcWednesdays",(function(){return My})),n.d(e,"utcThursday",(function(){return wy})),n.d(e,"utcThursdays",(function(){return Ty})),n.d(e,"utcFriday",(function(){return xy})),n.d(e,"utcFridays",(function(){return Dy})),n.d(e,"utcSaturday",(function(){return ky})),n.d(e,"utcSaturdays",(function(){return Cy})),n.d(e,"utcMonth",(function(){return cv})),n.d(e,"utcMonths",(function(){return fv})),n.d(e,"utcYear",(function(){return Oy})),n.d(e,"utcYears",(function(){return Ry})),n.d(e,"timeFormatDefaultLocale",(function(){return rv})),n.d(e,"timeFormat",(function(){return zy})),n.d(e,"timeParse",(function(){return Yy})),n.d(e,"utcFormat",(function(){return Vy})),n.d(e,"utcParse",(function(){return Hy})),n.d(e,"timeFormatLocale",(function(){return jy})),n.d(e,"isoFormat",(function(){return Sx})),n.d(e,"isoParse",(function(){return Mx})),n.d(e,"now",(function(){return Un})),n.d(e,"timer",(function(){return Vn})),n.d(e,"timerFlush",(function(){return Hn})),n.d(e,"timeout",(function(){return Kn})),n.d(e,"interval",(function(){return Tx})),n.d(e,"transition",(function(){return Ur})),n.d(e,"active",(function(){return Xr})),n.d(e,"interrupt",(function(){return or})),n.d(e,"voronoi",(function(){return dk})),n.d(e,"zoom",(function(){return Mk})),n.d(e,"zoomTransform",(function(){return vk})),n.d(e,"zoomIdentity",(function(){return bk}))},function(t,e,n){(function(t,r){var i=function(){var t=function(t,e,n,r){for(n=n||{},r=t.length;r--;n[t[r]]=e);return n},e=[1,2],n=[1,3],r=[1,4],i=[2,4],a=[1,9],o=[1,11],s=[1,12],u=[1,14],c=[1,15],f=[1,16],l=[1,18],h=[1,19],d=[1,20],p=[1,21],g=[1,22],y=[1,23],b=[1,25],v=[1,26],m=[1,4,5,10,15,16,17,19,21,22,23,24,25,27,29,30,31,42],_=[1,34],w=[4,5,10,15,16,17,19,21,22,23,24,25,27,31,42],x=[4,5,10,15,16,17,19,21,22,23,24,25,27,30,31,42],k=[4,5,10,15,16,17,19,21,22,23,24,25,27,29,31,42],E=[40,41,42],A={trace:function(){},yy:{},symbols_:{error:2,start:3,SPACE:4,NL:5,SD:6,document:7,line:8,statement:9,participant:10,actor:11,AS:12,restOfLine:13,signal:14,autonumber:15,activate:16,deactivate:17,note_statement:18,title:19,text2:20,loop:21,end:22,rect:23,opt:24,alt:25,else_sections:26,par:27,par_sections:28,and:29,else:30,note:31,placement:32,over:33,actor_pair:34,spaceList:35,",":36,left_of:37,right_of:38,signaltype:39,"+":40,"-":41,ACTOR:42,SOLID_OPEN_ARROW:43,DOTTED_OPEN_ARROW:44,SOLID_ARROW:45,DOTTED_ARROW:46,SOLID_CROSS:47,DOTTED_CROSS:48,TXT:49,$accept:0,$end:1},terminals_:{2:"error",4:"SPACE",5:"NL",6:"SD",10:"participant",12:"AS",13:"restOfLine",15:"autonumber",16:"activate",17:"deactivate",19:"title",21:"loop",22:"end",23:"rect",24:"opt",25:"alt",27:"par",29:"and",30:"else",31:"note",33:"over",36:",",37:"left_of",38:"right_of",40:"+",41:"-",42:"ACTOR",43:"SOLID_OPEN_ARROW",44:"DOTTED_OPEN_ARROW",45:"SOLID_ARROW",46:"DOTTED_ARROW",47:"SOLID_CROSS",48:"DOTTED_CROSS",49:"TXT"},productions_:[0,[3,2],[3,2],[3,2],[7,0],[7,2],[8,2],[8,1],[8,1],[9,5],[9,3],[9,2],[9,1],[9,3],[9,3],[9,2],[9,3],[9,4],[9,4],[9,4],[9,4],[9,4],[28,1],[28,4],[26,1],[26,4],[18,4],[18,4],[35,2],[35,1],[34,3],[34,1],[32,1],[32,1],[14,5],[14,5],[14,4],[11,1],[39,1],[39,1],[39,1],[39,1],[39,1],[39,1],[20,1]],performAction:function(t,e,n,r,i,a,o){var s=a.length-1;switch(i){case 3:return r.apply(a[s]),a[s];case 4:this.$=[];break;case 5:a[s-1].push(a[s]),this.$=a[s-1];break;case 6:case 7:this.$=a[s];break;case 8:this.$=[];break;case 9:a[s-3].description=a[s-1],this.$=a[s-3];break;case 10:this.$=a[s-1];break;case 12:r.enableSequenceNumbers();break;case 13:this.$={type:"activeStart",signalType:r.LINETYPE.ACTIVE_START,actor:a[s-1]};break;case 14:this.$={type:"activeEnd",signalType:r.LINETYPE.ACTIVE_END,actor:a[s-1]};break;case 16:this.$=[{type:"setTitle",text:a[s-1]}];break;case 17:a[s-1].unshift({type:"loopStart",loopText:a[s-2],signalType:r.LINETYPE.LOOP_START}),a[s-1].push({type:"loopEnd",loopText:a[s-2],signalType:r.LINETYPE.LOOP_END}),this.$=a[s-1];break;case 18:a[s-1].unshift({type:"rectStart",color:a[s-2],signalType:r.LINETYPE.RECT_START}),a[s-1].push({type:"rectEnd",color:a[s-2],signalType:r.LINETYPE.RECT_END}),this.$=a[s-1];break;case 19:a[s-1].unshift({type:"optStart",optText:a[s-2],signalType:r.LINETYPE.OPT_START}),a[s-1].push({type:"optEnd",optText:a[s-2],signalType:r.LINETYPE.OPT_END}),this.$=a[s-1];break;case 20:a[s-1].unshift({type:"altStart",altText:a[s-2],signalType:r.LINETYPE.ALT_START}),a[s-1].push({type:"altEnd",signalType:r.LINETYPE.ALT_END}),this.$=a[s-1];break;case 21:a[s-1].unshift({type:"parStart",parText:a[s-2],signalType:r.LINETYPE.PAR_START}),a[s-1].push({type:"parEnd",signalType:r.LINETYPE.PAR_END}),this.$=a[s-1];break;case 23:this.$=a[s-3].concat([{type:"and",parText:a[s-1],signalType:r.LINETYPE.PAR_AND},a[s]]);break;case 25:this.$=a[s-3].concat([{type:"else",altText:a[s-1],signalType:r.LINETYPE.ALT_ELSE},a[s]]);break;case 26:this.$=[a[s-1],{type:"addNote",placement:a[s-2],actor:a[s-1].actor,text:a[s]}];break;case 27:a[s-2]=[].concat(a[s-1],a[s-1]).slice(0,2),a[s-2][0]=a[s-2][0].actor,a[s-2][1]=a[s-2][1].actor,this.$=[a[s-1],{type:"addNote",placement:r.PLACEMENT.OVER,actor:a[s-2].slice(0,2),text:a[s]}];break;case 30:this.$=[a[s-2],a[s]];break;case 31:this.$=a[s];break;case 32:this.$=r.PLACEMENT.LEFTOF;break;case 33:this.$=r.PLACEMENT.RIGHTOF;break;case 34:this.$=[a[s-4],a[s-1],{type:"addMessage",from:a[s-4].actor,to:a[s-1].actor,signalType:a[s-3],msg:a[s]},{type:"activeStart",signalType:r.LINETYPE.ACTIVE_START,actor:a[s-1]}];break;case 35:this.$=[a[s-4],a[s-1],{type:"addMessage",from:a[s-4].actor,to:a[s-1].actor,signalType:a[s-3],msg:a[s]},{type:"activeEnd",signalType:r.LINETYPE.ACTIVE_END,actor:a[s-4]}];break;case 36:this.$=[a[s-3],a[s-1],{type:"addMessage",from:a[s-3].actor,to:a[s-1].actor,signalType:a[s-2],msg:a[s]}];break;case 37:this.$={type:"addActor",actor:a[s]};break;case 38:this.$=r.LINETYPE.SOLID_OPEN;break;case 39:this.$=r.LINETYPE.DOTTED_OPEN;break;case 40:this.$=r.LINETYPE.SOLID;break;case 41:this.$=r.LINETYPE.DOTTED;break;case 42:this.$=r.LINETYPE.SOLID_CROSS;break;case 43:this.$=r.LINETYPE.DOTTED_CROSS;break;case 44:this.$=a[s].substring(1).trim().replace(/\\n/gm,"\n")}},table:[{3:1,4:e,5:n,6:r},{1:[3]},{3:5,4:e,5:n,6:r},{3:6,4:e,5:n,6:r},t([1,4,5,10,15,16,17,19,21,23,24,25,27,31,42],i,{7:7}),{1:[2,1]},{1:[2,2]},{1:[2,3],4:a,5:o,8:8,9:10,10:s,11:24,14:13,15:u,16:c,17:f,18:17,19:l,21:h,23:d,24:p,25:g,27:y,31:b,42:v},t(m,[2,5]),{9:27,10:s,11:24,14:13,15:u,16:c,17:f,18:17,19:l,21:h,23:d,24:p,25:g,27:y,31:b,42:v},t(m,[2,7]),t(m,[2,8]),{11:28,42:v},{5:[1,29]},t(m,[2,12]),{11:30,42:v},{11:31,42:v},{5:[1,32]},{20:33,49:_},{13:[1,35]},{13:[1,36]},{13:[1,37]},{13:[1,38]},{13:[1,39]},{39:40,43:[1,41],44:[1,42],45:[1,43],46:[1,44],47:[1,45],48:[1,46]},{32:47,33:[1,48],37:[1,49],38:[1,50]},t([5,12,36,43,44,45,46,47,48,49],[2,37]),t(m,[2,6]),{5:[1,52],12:[1,51]},t(m,[2,11]),{5:[1,53]},{5:[1,54]},t(m,[2,15]),{5:[1,55]},{5:[2,44]},t(w,i,{7:56}),t(w,i,{7:57}),t(w,i,{7:58}),t(x,i,{26:59,7:60}),t(k,i,{28:61,7:62}),{11:65,40:[1,63],41:[1,64],42:v},t(E,[2,38]),t(E,[2,39]),t(E,[2,40]),t(E,[2,41]),t(E,[2,42]),t(E,[2,43]),{11:66,42:v},{11:68,34:67,42:v},{42:[2,32]},{42:[2,33]},{13:[1,69]},t(m,[2,10]),t(m,[2,13]),t(m,[2,14]),t(m,[2,16]),{4:a,5:o,8:8,9:10,10:s,11:24,14:13,15:u,16:c,17:f,18:17,19:l,21:h,22:[1,70],23:d,24:p,25:g,27:y,31:b,42:v},{4:a,5:o,8:8,9:10,10:s,11:24,14:13,15:u,16:c,17:f,18:17,19:l,21:h,22:[1,71],23:d,24:p,25:g,27:y,31:b,42:v},{4:a,5:o,8:8,9:10,10:s,11:24,14:13,15:u,16:c,17:f,18:17,19:l,21:h,22:[1,72],23:d,24:p,25:g,27:y,31:b,42:v},{22:[1,73]},{4:a,5:o,8:8,9:10,10:s,11:24,14:13,15:u,16:c,17:f,18:17,19:l,21:h,22:[2,24],23:d,24:p,25:g,27:y,30:[1,74],31:b,42:v},{22:[1,75]},{4:a,5:o,8:8,9:10,10:s,11:24,14:13,15:u,16:c,17:f,18:17,19:l,21:h,22:[2,22],23:d,24:p,25:g,27:y,29:[1,76],31:b,42:v},{11:77,42:v},{11:78,42:v},{20:79,49:_},{20:80,49:_},{20:81,49:_},{36:[1,82],49:[2,31]},{5:[1,83]},t(m,[2,17]),t(m,[2,18]),t(m,[2,19]),t(m,[2,20]),{13:[1,84]},t(m,[2,21]),{13:[1,85]},{20:86,49:_},{20:87,49:_},{5:[2,36]},{5:[2,26]},{5:[2,27]},{11:88,42:v},t(m,[2,9]),t(x,i,{7:60,26:89}),t(k,i,{7:62,28:90}),{5:[2,34]},{5:[2,35]},{49:[2,30]},{22:[2,25]},{22:[2,23]}],defaultActions:{5:[2,1],6:[2,2],34:[2,44],49:[2,32],50:[2,33],79:[2,36],80:[2,26],81:[2,27],86:[2,34],87:[2,35],88:[2,30],89:[2,25],90:[2,23]},parseError:function(t,e){if(!e.recoverable){var n=new Error(t);throw n.hash=e,n}this.trace(t)},parse:function(t){var e=this,n=[0],r=[],i=[null],a=[],o=this.table,s="",u=0,c=0,f=0,l=2,h=1,d=a.slice.call(arguments,1),p=Object.create(this.lexer),g={yy:{}};for(var y in this.yy)Object.prototype.hasOwnProperty.call(this.yy,y)&&(g.yy[y]=this.yy[y]);p.setInput(t,g.yy),g.yy.lexer=p,g.yy.parser=this,void 0===p.yylloc&&(p.yylloc={});var b=p.yylloc;a.push(b);var v=p.options&&p.options.ranges;function m(){var t;return"number"!=typeof(t=r.pop()||p.lex()||h)&&(t instanceof Array&&(t=(r=t).pop()),t=e.symbols_[t]||t),t}"function"==typeof g.yy.parseError?this.parseError=g.yy.parseError:this.parseError=Object.getPrototypeOf(this).parseError;for(var _,w,x,k,E,A,S,M,T,D={};;){if(x=n[n.length-1],this.defaultActions[x]?k=this.defaultActions[x]:(null==_&&(_=m()),k=o[x]&&o[x][_]),void 0===k||!k.length||!k[0]){var C="";for(A in T=[],o[x])this.terminals_[A]&&A>l&&T.push("'"+this.terminals_[A]+"'");C=p.showPosition?"Parse error on line "+(u+1)+":\n"+p.showPosition()+"\nExpecting "+T.join(", ")+", got '"+(this.terminals_[_]||_)+"'":"Parse error on line "+(u+1)+": Unexpected "+(_==h?"end of input":"'"+(this.terminals_[_]||_)+"'"),this.parseError(C,{text:p.match,token:this.terminals_[_]||_,line:p.yylineno,loc:b,expected:T})}if(k[0]instanceof Array&&k.length>1)throw new Error("Parse Error: multiple actions possible at state: "+x+", token: "+_);switch(k[0]){case 1:n.push(_),i.push(p.yytext),a.push(p.yylloc),n.push(k[1]),_=null,w?(_=w,w=null):(c=p.yyleng,s=p.yytext,u=p.yylineno,b=p.yylloc,f>0&&f--);break;case 2:if(S=this.productions_[k[1]][1],D.$=i[i.length-S],D._$={first_line:a[a.length-(S||1)].first_line,last_line:a[a.length-1].last_line,first_column:a[a.length-(S||1)].first_column,last_column:a[a.length-1].last_column},v&&(D._$.range=[a[a.length-(S||1)].range[0],a[a.length-1].range[1]]),void 0!==(E=this.performAction.apply(D,[s,c,u,g.yy,k[1],i,a].concat(d))))return E;S&&(n=n.slice(0,-1*S*2),i=i.slice(0,-1*S),a=a.slice(0,-1*S)),n.push(this.productions_[k[1]][0]),i.push(D.$),a.push(D._$),M=o[n[n.length-2]][n[n.length-1]],n.push(M);break;case 3:return!0}}return!0}},S={EOF:1,parseError:function(t,e){if(!this.yy.parser)throw new Error(t);this.yy.parser.parseError(t,e)},setInput:function(t,e){return this.yy=e||this.yy||{},this._input=t,this._more=this._backtrack=this.done=!1,this.yylineno=this.yyleng=0,this.yytext=this.matched=this.match="",this.conditionStack=["INITIAL"],this.yylloc={first_line:1,first_column:0,last_line:1,last_column:0},this.options.ranges&&(this.yylloc.range=[0,0]),this.offset=0,this},input:function(){var t=this._input[0];return this.yytext+=t,this.yyleng++,this.offset++,this.match+=t,this.matched+=t,t.match(/(?:\r\n?|\n).*/g)?(this.yylineno++,this.yylloc.last_line++):this.yylloc.last_column++,this.options.ranges&&this.yylloc.range[1]++,this._input=this._input.slice(1),t},unput:function(t){var e=t.length,n=t.split(/(?:\r\n?|\n)/g);this._input=t+this._input,this.yytext=this.yytext.substr(0,this.yytext.length-e),this.offset-=e;var r=this.match.split(/(?:\r\n?|\n)/g);this.match=this.match.substr(0,this.match.length-1),this.matched=this.matched.substr(0,this.matched.length-1),n.length-1&&(this.yylineno-=n.length-1);var i=this.yylloc.range;return this.yylloc={first_line:this.yylloc.first_line,last_line:this.yylineno+1,first_column:this.yylloc.first_column,last_column:n?(n.length===r.length?this.yylloc.first_column:0)+r[r.length-n.length].length-n[0].length:this.yylloc.first_column-e},this.options.ranges&&(this.yylloc.range=[i[0],i[0]+this.yyleng-e]),this.yyleng=this.yytext.length,this},more:function(){return this._more=!0,this},reject:function(){return this.options.backtrack_lexer?(this._backtrack=!0,this):this.parseError("Lexical error on line "+(this.yylineno+1)+". You can only invoke reject() in the lexer when the lexer is of the backtracking persuasion (options.backtrack_lexer = true).\n"+this.showPosition(),{text:"",token:null,line:this.yylineno})},less:function(t){this.unput(this.match.slice(t))},pastInput:function(){var t=this.matched.substr(0,this.matched.length-this.match.length);return(t.length>20?"...":"")+t.substr(-20).replace(/\n/g,"")},upcomingInput:function(){var t=this.match;return t.length<20&&(t+=this._input.substr(0,20-t.length)),(t.substr(0,20)+(t.length>20?"...":"")).replace(/\n/g,"")},showPosition:function(){var t=this.pastInput(),e=new Array(t.length+1).join("-");return t+this.upcomingInput()+"\n"+e+"^"},test_match:function(t,e){var n,r,i;if(this.options.backtrack_lexer&&(i={yylineno:this.yylineno,yylloc:{first_line:this.yylloc.first_line,last_line:this.last_line,first_column:this.yylloc.first_column,last_column:this.yylloc.last_column},yytext:this.yytext,match:this.match,matches:this.matches,matched:this.matched,yyleng:this.yyleng,offset:this.offset,_more:this._more,_input:this._input,yy:this.yy,conditionStack:this.conditionStack.slice(0),done:this.done},this.options.ranges&&(i.yylloc.range=this.yylloc.range.slice(0))),(r=t[0].match(/(?:\r\n?|\n).*/g))&&(this.yylineno+=r.length),this.yylloc={first_line:this.yylloc.last_line,last_line:this.yylineno+1,first_column:this.yylloc.last_column,last_column:r?r[r.length-1].length-r[r.length-1].match(/\r?\n?/)[0].length:this.yylloc.last_column+t[0].length},this.yytext+=t[0],this.match+=t[0],this.matches=t,this.yyleng=this.yytext.length,this.options.ranges&&(this.yylloc.range=[this.offset,this.offset+=this.yyleng]),this._more=!1,this._backtrack=!1,this._input=this._input.slice(t[0].length),this.matched+=t[0],n=this.performAction.call(this,this.yy,this,e,this.conditionStack[this.conditionStack.length-1]),this.done&&this._input&&(this.done=!1),n)return n;if(this._backtrack){for(var a in i)this[a]=i[a];return!1}return!1},next:function(){if(this.done)return this.EOF;var t,e,n,r;this._input||(this.done=!0),this._more||(this.yytext="",this.match="");for(var i=this._currentRules(),a=0;a<i.length;a++)if((n=this._input.match(this.rules[i[a]]))&&(!e||n[0].length>e[0].length)){if(e=n,r=a,this.options.backtrack_lexer){if(!1!==(t=this.test_match(n,i[a])))return t;if(this._backtrack){e=!1;continue}return!1}if(!this.options.flex)break}return e?!1!==(t=this.test_match(e,i[r]))&&t:""===this._input?this.EOF:this.parseError("Lexical error on line "+(this.yylineno+1)+". Unrecognized text.\n"+this.showPosition(),{text:"",token:null,line:this.yylineno})},lex:function(){var t=this.next();return t||this.lex()},begin:function(t){this.conditionStack.push(t)},popState:function(){return this.conditionStack.length-1>0?this.conditionStack.pop():this.conditionStack[0]},_currentRules:function(){return this.conditionStack.length&&this.conditionStack[this.conditionStack.length-1]?this.conditions[this.conditionStack[this.conditionStack.length-1]].rules:this.conditions.INITIAL.rules},topState:function(t){return(t=this.conditionStack.length-1-Math.abs(t||0))>=0?this.conditionStack[t]:"INITIAL"},pushState:function(t){this.begin(t)},stateStackSize:function(){return this.conditionStack.length},options:{"case-insensitive":!0},performAction:function(t,e,n,r){switch(n){case 0:return 5;case 1:case 2:case 3:case 4:break;case 5:return this.begin("ID"),10;case 6:return e.yytext=e.yytext.trim(),this.begin("ALIAS"),42;case 7:return this.popState(),this.popState(),this.begin("LINE"),12;case 8:return this.popState(),this.popState(),5;case 9:return this.begin("LINE"),21;case 10:return this.begin("LINE"),23;case 11:return this.begin("LINE"),24;case 12:return this.begin("LINE"),25;case 13:return this.begin("LINE"),30;case 14:return this.begin("LINE"),27;case 15:return this.begin("LINE"),29;case 16:return this.popState(),13;case 17:return 22;case 18:return 37;case 19:return 38;case 20:return 33;case 21:return 31;case 22:return this.begin("ID"),16;case 23:return this.begin("ID"),17;case 24:return 19;case 25:return 6;case 26:return 15;case 27:return 36;case 28:return 5;case 29:return e.yytext=e.yytext.trim(),42;case 30:return 45;case 31:return 46;case 32:return 43;case 33:return 44;case 34:return 47;case 35:return 48;case 36:return 49;case 37:return 40;case 38:return 41;case 39:return 5;case 40:return"INVALID"}},rules:[/^(?:[\n]+)/i,/^(?:\s+)/i,/^(?:((?!\n)\s)+)/i,/^(?:#[^\n]*)/i,/^(?:%[^\n]*)/i,/^(?:participant\b)/i,/^(?:[^\->:\n,;]+?(?=((?!\n)\s)+as(?!\n)\s|[#\n;]|$))/i,/^(?:as\b)/i,/^(?:(?:))/i,/^(?:loop\b)/i,/^(?:rect\b)/i,/^(?:opt\b)/i,/^(?:alt\b)/i,/^(?:else\b)/i,/^(?:par\b)/i,/^(?:and\b)/i,/^(?:[^#\n;]*)/i,/^(?:end\b)/i,/^(?:left of\b)/i,/^(?:right of\b)/i,/^(?:over\b)/i,/^(?:note\b)/i,/^(?:activate\b)/i,/^(?:deactivate\b)/i,/^(?:title\b)/i,/^(?:sequenceDiagram\b)/i,/^(?:autonumber\b)/i,/^(?:,)/i,/^(?:;)/i,/^(?:[^\+\->:\n,;]+)/i,/^(?:->>)/i,/^(?:-->>)/i,/^(?:->)/i,/^(?:-->)/i,/^(?:-[x])/i,/^(?:--[x])/i,/^(?::[^#\n;]+)/i,/^(?:\+)/i,/^(?:-)/i,/^(?:$)/i,/^(?:.)/i],conditions:{LINE:{rules:[2,3,16],inclusive:!1},ALIAS:{rules:[2,3,7,8],inclusive:!1},ID:{rules:[2,3,6],inclusive:!1},INITIAL:{rules:[0,1,3,4,5,9,10,11,12,13,14,15,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36,37,38,39,40],inclusive:!0}}};function M(){this.yy={}}return A.lexer=S,M.prototype=A,A.Parser=M,new M}();e.parser=i,e.Parser=i.Parser,e.parse=function(){return i.parse.apply(i,arguments)},e.main=function(r){r[1]||(console.log("Usage: "+r[0]+" FILE"),t.exit(1));var i=n(28).readFileSync(n(29).normalize(r[1]),"utf8");return e.parser.parse(i)},n.c[n.s]===r&&e.main(t.argv.slice(1))}).call(this,n(7),n(9)(t))},function(t,e){"function"==typeof Object.create?t.exports=function(t,e){e&&(t.super_=e,t.prototype=Object.create(e.prototype,{constructor:{value:t,enumerable:!1,writable:!0,configurable:!0}}))}:t.exports=function(t,e){if(e){t.super_=e;var n=function(){};n.prototype=e.prototype,t.prototype=new n,t.prototype.constructor=t}}},function(t,e,n){var r=n(8),i=r.Buffer;function a(t,e){for(var n in t)e[n]=t[n]}function o(t,e,n){return i(t,e,n)}i.from&&i.alloc&&i.allocUnsafe&&i.allocUnsafeSlow?t.exports=r:(a(r,e),e.Buffer=o),o.prototype=Object.create(i.prototype),a(i,o),o.from=function(t,e,n){if("number"==typeof t)throw new TypeError("Argument must not be a number");return i(t,e,n)},o.alloc=function(t,e,n){if("number"!=typeof t)throw new TypeError("Argument must be a number");var r=i(t);return void 0!==e?"string"==typeof n?r.fill(e,n):r.fill(e):r.fill(0),r},o.allocUnsafe=function(t){if("number"!=typeof t)throw new TypeError("Argument must be a number");return i(t)},o.allocUnsafeSlow=function(t){if("number"!=typeof t)throw new TypeError("Argument must be a number");return r.SlowBuffer(t)}},function(t,e,n){var r;try{r={cloneDeep:n(350),constant:n(99),defaults:n(176),each:n(100),filter:n(150),find:n(351),flatten:n(178),forEach:n(148),forIn:n(356),has:n(106),isUndefined:n(161),last:n(357),map:n(162),mapValues:n(358),max:n(359),merge:n(361),min:n(366),minBy:n(367),now:n(368),pick:n(183),range:n(184),reduce:n(164),sortBy:n(375),uniqueId:n(185),values:n(169),zipObject:n(380)}}catch(t){}r||(r=window._),t.exports=r},function(t,e,n){(function(t){!function(t,e){"use strict";function r(t,e){if(!t)throw new Error(e||"Assertion failed")}function i(t,e){t.super_=e;var n=function(){};n.prototype=e.prototype,t.prototype=new n,t.prototype.constructor=t}function a(t,e,n){if(a.isBN(t))return t;this.negative=0,this.words=null,this.length=0,this.red=null,null!==t&&("le"!==e&&"be"!==e||(n=e,e=10),this._init(t||0,e||10,n||"be"))}var o;"object"==typeof t?t.exports=a:e.BN=a,a.BN=a,a.wordSize=26;try{o=n(457).Buffer}catch(t){}function s(t,e,n){for(var r=0,i=Math.min(t.length,n),a=e;a<i;a++){var o=t.charCodeAt(a)-48;r<<=4,r|=o>=49&&o<=54?o-49+10:o>=17&&o<=22?o-17+10:15&o}return r}function u(t,e,n,r){for(var i=0,a=Math.min(t.length,n),o=e;o<a;o++){var s=t.charCodeAt(o)-48;i*=r,i+=s>=49?s-49+10:s>=17?s-17+10:s}return i}a.isBN=function(t){return t instanceof a||null!==t&&"object"==typeof t&&t.constructor.wordSize===a.wordSize&&Array.isArray(t.words)},a.max=function(t,e){return t.cmp(e)>0?t:e},a.min=function(t,e){return t.cmp(e)<0?t:e},a.prototype._init=function(t,e,n){if("number"==typeof t)return this._initNumber(t,e,n);if("object"==typeof t)return this._initArray(t,e,n);"hex"===e&&(e=16),r(e===(0|e)&&e>=2&&e<=36);var i=0;"-"===(t=t.toString().replace(/\s+/g,""))[0]&&i++,16===e?this._parseHex(t,i):this._parseBase(t,e,i),"-"===t[0]&&(this.negative=1),this.strip(),"le"===n&&this._initArray(this.toArray(),e,n)},a.prototype._initNumber=function(t,e,n){t<0&&(this.negative=1,t=-t),t<67108864?(this.words=[67108863&t],this.length=1):t<4503599627370496?(this.words=[67108863&t,t/67108864&67108863],this.length=2):(r(t<9007199254740992),this.words=[67108863&t,t/67108864&67108863,1],this.length=3),"le"===n&&this._initArray(this.toArray(),e,n)},a.prototype._initArray=function(t,e,n){if(r("number"==typeof t.length),t.length<=0)return this.words=[0],this.length=1,this;this.length=Math.ceil(t.length/3),this.words=new Array(this.length);for(var i=0;i<this.length;i++)this.words[i]=0;var a,o,s=0;if("be"===n)for(i=t.length-1,a=0;i>=0;i-=3)o=t[i]|t[i-1]<<8|t[i-2]<<16,this.words[a]|=o<<s&67108863,this.words[a+1]=o>>>26-s&67108863,(s+=24)>=26&&(s-=26,a++);else if("le"===n)for(i=0,a=0;i<t.length;i+=3)o=t[i]|t[i+1]<<8|t[i+2]<<16,this.words[a]|=o<<s&67108863,this.words[a+1]=o>>>26-s&67108863,(s+=24)>=26&&(s-=26,a++);return this.strip()},a.prototype._parseHex=function(t,e){this.length=Math.ceil((t.length-e)/6),this.words=new Array(this.length);for(var n=0;n<this.length;n++)this.words[n]=0;var r,i,a=0;for(n=t.length-6,r=0;n>=e;n-=6)i=s(t,n,n+6),this.words[r]|=i<<a&67108863,this.words[r+1]|=i>>>26-a&4194303,(a+=24)>=26&&(a-=26,r++);n+6!==e&&(i=s(t,e,n+6),this.words[r]|=i<<a&67108863,this.words[r+1]|=i>>>26-a&4194303),this.strip()},a.prototype._parseBase=function(t,e,n){this.words=[0],this.length=1;for(var r=0,i=1;i<=67108863;i*=e)r++;r--,i=i/e|0;for(var a=t.length-n,o=a%r,s=Math.min(a,a-o)+n,c=0,f=n;f<s;f+=r)c=u(t,f,f+r,e),this.imuln(i),this.words[0]+c<67108864?this.words[0]+=c:this._iaddn(c);if(0!==o){var l=1;for(c=u(t,f,t.length,e),f=0;f<o;f++)l*=e;this.imuln(l),this.words[0]+c<67108864?this.words[0]+=c:this._iaddn(c)}},a.prototype.copy=function(t){t.words=new Array(this.length);for(var e=0;e<this.length;e++)t.words[e]=this.words[e];t.length=this.length,t.negative=this.negative,t.red=this.red},a.prototype.clone=function(){var t=new a(null);return this.copy(t),t},a.prototype._expand=function(t){for(;this.length<t;)this.words[this.length++]=0;return this},a.prototype.strip=function(){for(;this.length>1&&0===this.words[this.length-1];)this.length--;return this._normSign()},a.prototype._normSign=function(){return 1===this.length&&0===this.words[0]&&(this.negative=0),this},a.prototype.inspect=function(){return(this.red?"<BN-R: ":"<BN: ")+this.toString(16)+">"};var c=["","0","00","000","0000","00000","000000","0000000","00000000","000000000","0000000000","00000000000","000000000000","0000000000000","00000000000000","000000000000000","0000000000000000","00000000000000000","000000000000000000","0000000000000000000","00000000000000000000","000000000000000000000","0000000000000000000000","00000000000000000000000","000000000000000000000000","0000000000000000000000000"],f=[0,0,25,16,12,11,10,9,8,8,7,7,7,7,6,6,6,6,6,6,6,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5],l=[0,0,33554432,43046721,16777216,48828125,60466176,40353607,16777216,43046721,1e7,19487171,35831808,62748517,7529536,11390625,16777216,24137569,34012224,47045881,64e6,4084101,5153632,6436343,7962624,9765625,11881376,14348907,17210368,20511149,243e5,28629151,33554432,39135393,45435424,52521875,60466176];function h(t,e,n){n.negative=e.negative^t.negative;var r=t.length+e.length|0;n.length=r,r=r-1|0;var i=0|t.words[0],a=0|e.words[0],o=i*a,s=67108863&o,u=o/67108864|0;n.words[0]=s;for(var c=1;c<r;c++){for(var f=u>>>26,l=67108863&u,h=Math.min(c,e.length-1),d=Math.max(0,c-t.length+1);d<=h;d++){var p=c-d|0;f+=(o=(i=0|t.words[p])*(a=0|e.words[d])+l)/67108864|0,l=67108863&o}n.words[c]=0|l,u=0|f}return 0!==u?n.words[c]=0|u:n.length--,n.strip()}a.prototype.toString=function(t,e){var n;if(e=0|e||1,16===(t=t||10)||"hex"===t){n="";for(var i=0,a=0,o=0;o<this.length;o++){var s=this.words[o],u=(16777215&(s<<i|a)).toString(16);n=0!==(a=s>>>24-i&16777215)||o!==this.length-1?c[6-u.length]+u+n:u+n,(i+=2)>=26&&(i-=26,o--)}for(0!==a&&(n=a.toString(16)+n);n.length%e!=0;)n="0"+n;return 0!==this.negative&&(n="-"+n),n}if(t===(0|t)&&t>=2&&t<=36){var h=f[t],d=l[t];n="";var p=this.clone();for(p.negative=0;!p.isZero();){var g=p.modn(d).toString(t);n=(p=p.idivn(d)).isZero()?g+n:c[h-g.length]+g+n}for(this.isZero()&&(n="0"+n);n.length%e!=0;)n="0"+n;return 0!==this.negative&&(n="-"+n),n}r(!1,"Base should be between 2 and 36")},a.prototype.toNumber=function(){var t=this.words[0];return 2===this.length?t+=67108864*this.words[1]:3===this.length&&1===this.words[2]?t+=4503599627370496+67108864*this.words[1]:this.length>2&&r(!1,"Number can only safely store up to 53 bits"),0!==this.negative?-t:t},a.prototype.toJSON=function(){return this.toString(16)},a.prototype.toBuffer=function(t,e){return r(void 0!==o),this.toArrayLike(o,t,e)},a.prototype.toArray=function(t,e){return this.toArrayLike(Array,t,e)},a.prototype.toArrayLike=function(t,e,n){var i=this.byteLength(),a=n||Math.max(1,i);r(i<=a,"byte array longer than desired length"),r(a>0,"Requested array length <= 0"),this.strip();var o,s,u="le"===e,c=new t(a),f=this.clone();if(u){for(s=0;!f.isZero();s++)o=f.andln(255),f.iushrn(8),c[s]=o;for(;s<a;s++)c[s]=0}else{for(s=0;s<a-i;s++)c[s]=0;for(s=0;!f.isZero();s++)o=f.andln(255),f.iushrn(8),c[a-s-1]=o}return c},Math.clz32?a.prototype._countBits=function(t){return 32-Math.clz32(t)}:a.prototype._countBits=function(t){var e=t,n=0;return e>=4096&&(n+=13,e>>>=13),e>=64&&(n+=7,e>>>=7),e>=8&&(n+=4,e>>>=4),e>=2&&(n+=2,e>>>=2),n+e},a.prototype._zeroBits=function(t){if(0===t)return 26;var e=t,n=0;return 0==(8191&e)&&(n+=13,e>>>=13),0==(127&e)&&(n+=7,e>>>=7),0==(15&e)&&(n+=4,e>>>=4),0==(3&e)&&(n+=2,e>>>=2),0==(1&e)&&n++,n},a.prototype.bitLength=function(){var t=this.words[this.length-1],e=this._countBits(t);return 26*(this.length-1)+e},a.prototype.zeroBits=function(){if(this.isZero())return 0;for(var t=0,e=0;e<this.length;e++){var n=this._zeroBits(this.words[e]);if(t+=n,26!==n)break}return t},a.prototype.byteLength=function(){return Math.ceil(this.bitLength()/8)},a.prototype.toTwos=function(t){return 0!==this.negative?this.abs().inotn(t).iaddn(1):this.clone()},a.prototype.fromTwos=function(t){return this.testn(t-1)?this.notn(t).iaddn(1).ineg():this.clone()},a.prototype.isNeg=function(){return 0!==this.negative},a.prototype.neg=function(){return this.clone().ineg()},a.prototype.ineg=function(){return this.isZero()||(this.negative^=1),this},a.prototype.iuor=function(t){for(;this.length<t.length;)this.words[this.length++]=0;for(var e=0;e<t.length;e++)this.words[e]=this.words[e]|t.words[e];return this.strip()},a.prototype.ior=function(t){return r(0==(this.negative|t.negative)),this.iuor(t)},a.prototype.or=function(t){return this.length>t.length?this.clone().ior(t):t.clone().ior(this)},a.prototype.uor=function(t){return this.length>t.length?this.clone().iuor(t):t.clone().iuor(this)},a.prototype.iuand=function(t){var e;e=this.length>t.length?t:this;for(var n=0;n<e.length;n++)this.words[n]=this.words[n]&t.words[n];return this.length=e.length,this.strip()},a.prototype.iand=function(t){return r(0==(this.negative|t.negative)),this.iuand(t)},a.prototype.and=function(t){return this.length>t.length?this.clone().iand(t):t.clone().iand(this)},a.prototype.uand=function(t){return this.length>t.length?this.clone().iuand(t):t.clone().iuand(this)},a.prototype.iuxor=function(t){var e,n;this.length>t.length?(e=this,n=t):(e=t,n=this);for(var r=0;r<n.length;r++)this.words[r]=e.words[r]^n.words[r];if(this!==e)for(;r<e.length;r++)this.words[r]=e.words[r];return this.length=e.length,this.strip()},a.prototype.ixor=function(t){return r(0==(this.negative|t.negative)),this.iuxor(t)},a.prototype.xor=function(t){return this.length>t.length?this.clone().ixor(t):t.clone().ixor(this)},a.prototype.uxor=function(t){return this.length>t.length?this.clone().iuxor(t):t.clone().iuxor(this)},a.prototype.inotn=function(t){r("number"==typeof t&&t>=0);var e=0|Math.ceil(t/26),n=t%26;this._expand(e),n>0&&e--;for(var i=0;i<e;i++)this.words[i]=67108863&~this.words[i];return n>0&&(this.words[i]=~this.words[i]&67108863>>26-n),this.strip()},a.prototype.notn=function(t){return this.clone().inotn(t)},a.prototype.setn=function(t,e){r("number"==typeof t&&t>=0);var n=t/26|0,i=t%26;return this._expand(n+1),this.words[n]=e?this.words[n]|1<<i:this.words[n]&~(1<<i),this.strip()},a.prototype.iadd=function(t){var e,n,r;if(0!==this.negative&&0===t.negative)return this.negative=0,e=this.isub(t),this.negative^=1,this._normSign();if(0===this.negative&&0!==t.negative)return t.negative=0,e=this.isub(t),t.negative=1,e._normSign();this.length>t.length?(n=this,r=t):(n=t,r=this);for(var i=0,a=0;a<r.length;a++)e=(0|n.words[a])+(0|r.words[a])+i,this.words[a]=67108863&e,i=e>>>26;for(;0!==i&&a<n.length;a++)e=(0|n.words[a])+i,this.words[a]=67108863&e,i=e>>>26;if(this.length=n.length,0!==i)this.words[this.length]=i,this.length++;else if(n!==this)for(;a<n.length;a++)this.words[a]=n.words[a];return this},a.prototype.add=function(t){var e;return 0!==t.negative&&0===this.negative?(t.negative=0,e=this.sub(t),t.negative^=1,e):0===t.negative&&0!==this.negative?(this.negative=0,e=t.sub(this),this.negative=1,e):this.length>t.length?this.clone().iadd(t):t.clone().iadd(this)},a.prototype.isub=function(t){if(0!==t.negative){t.negative=0;var e=this.iadd(t);return t.negative=1,e._normSign()}if(0!==this.negative)return this.negative=0,this.iadd(t),this.negative=1,this._normSign();var n,r,i=this.cmp(t);if(0===i)return this.negative=0,this.length=1,this.words[0]=0,this;i>0?(n=this,r=t):(n=t,r=this);for(var a=0,o=0;o<r.length;o++)a=(e=(0|n.words[o])-(0|r.words[o])+a)>>26,this.words[o]=67108863&e;for(;0!==a&&o<n.length;o++)a=(e=(0|n.words[o])+a)>>26,this.words[o]=67108863&e;if(0===a&&o<n.length&&n!==this)for(;o<n.length;o++)this.words[o]=n.words[o];return this.length=Math.max(this.length,o),n!==this&&(this.negative=1),this.strip()},a.prototype.sub=function(t){return this.clone().isub(t)};var d=function(t,e,n){var r,i,a,o=t.words,s=e.words,u=n.words,c=0,f=0|o[0],l=8191&f,h=f>>>13,d=0|o[1],p=8191&d,g=d>>>13,y=0|o[2],b=8191&y,v=y>>>13,m=0|o[3],_=8191&m,w=m>>>13,x=0|o[4],k=8191&x,E=x>>>13,A=0|o[5],S=8191&A,M=A>>>13,T=0|o[6],D=8191&T,C=T>>>13,N=0|o[7],I=8191&N,L=N>>>13,B=0|o[8],O=8191&B,R=B>>>13,P=0|o[9],F=8191&P,q=P>>>13,j=0|s[0],U=8191&j,z=j>>>13,Y=0|s[1],V=8191&Y,H=Y>>>13,G=0|s[2],$=8191&G,W=G>>>13,K=0|s[3],X=8191&K,Z=K>>>13,J=0|s[4],Q=8191&J,tt=J>>>13,et=0|s[5],nt=8191&et,rt=et>>>13,it=0|s[6],at=8191&it,ot=it>>>13,st=0|s[7],ut=8191&st,ct=st>>>13,ft=0|s[8],lt=8191&ft,ht=ft>>>13,dt=0|s[9],pt=8191&dt,gt=dt>>>13;n.negative=t.negative^e.negative,n.length=19;var yt=(c+(r=Math.imul(l,U))|0)+((8191&(i=(i=Math.imul(l,z))+Math.imul(h,U)|0))<<13)|0;c=((a=Math.imul(h,z))+(i>>>13)|0)+(yt>>>26)|0,yt&=67108863,r=Math.imul(p,U),i=(i=Math.imul(p,z))+Math.imul(g,U)|0,a=Math.imul(g,z);var bt=(c+(r=r+Math.imul(l,V)|0)|0)+((8191&(i=(i=i+Math.imul(l,H)|0)+Math.imul(h,V)|0))<<13)|0;c=((a=a+Math.imul(h,H)|0)+(i>>>13)|0)+(bt>>>26)|0,bt&=67108863,r=Math.imul(b,U),i=(i=Math.imul(b,z))+Math.imul(v,U)|0,a=Math.imul(v,z),r=r+Math.imul(p,V)|0,i=(i=i+Math.imul(p,H)|0)+Math.imul(g,V)|0,a=a+Math.imul(g,H)|0;var vt=(c+(r=r+Math.imul(l,$)|0)|0)+((8191&(i=(i=i+Math.imul(l,W)|0)+Math.imul(h,$)|0))<<13)|0;c=((a=a+Math.imul(h,W)|0)+(i>>>13)|0)+(vt>>>26)|0,vt&=67108863,r=Math.imul(_,U),i=(i=Math.imul(_,z))+Math.imul(w,U)|0,a=Math.imul(w,z),r=r+Math.imul(b,V)|0,i=(i=i+Math.imul(b,H)|0)+Math.imul(v,V)|0,a=a+Math.imul(v,H)|0,r=r+Math.imul(p,$)|0,i=(i=i+Math.imul(p,W)|0)+Math.imul(g,$)|0,a=a+Math.imul(g,W)|0;var mt=(c+(r=r+Math.imul(l,X)|0)|0)+((8191&(i=(i=i+Math.imul(l,Z)|0)+Math.imul(h,X)|0))<<13)|0;c=((a=a+Math.imul(h,Z)|0)+(i>>>13)|0)+(mt>>>26)|0,mt&=67108863,r=Math.imul(k,U),i=(i=Math.imul(k,z))+Math.imul(E,U)|0,a=Math.imul(E,z),r=r+Math.imul(_,V)|0,i=(i=i+Math.imul(_,H)|0)+Math.imul(w,V)|0,a=a+Math.imul(w,H)|0,r=r+Math.imul(b,$)|0,i=(i=i+Math.imul(b,W)|0)+Math.imul(v,$)|0,a=a+Math.imul(v,W)|0,r=r+Math.imul(p,X)|0,i=(i=i+Math.imul(p,Z)|0)+Math.imul(g,X)|0,a=a+Math.imul(g,Z)|0;var _t=(c+(r=r+Math.imul(l,Q)|0)|0)+((8191&(i=(i=i+Math.imul(l,tt)|0)+Math.imul(h,Q)|0))<<13)|0;c=((a=a+Math.imul(h,tt)|0)+(i>>>13)|0)+(_t>>>26)|0,_t&=67108863,r=Math.imul(S,U),i=(i=Math.imul(S,z))+Math.imul(M,U)|0,a=Math.imul(M,z),r=r+Math.imul(k,V)|0,i=(i=i+Math.imul(k,H)|0)+Math.imul(E,V)|0,a=a+Math.imul(E,H)|0,r=r+Math.imul(_,$)|0,i=(i=i+Math.imul(_,W)|0)+Math.imul(w,$)|0,a=a+Math.imul(w,W)|0,r=r+Math.imul(b,X)|0,i=(i=i+Math.imul(b,Z)|0)+Math.imul(v,X)|0,a=a+Math.imul(v,Z)|0,r=r+Math.imul(p,Q)|0,i=(i=i+Math.imul(p,tt)|0)+Math.imul(g,Q)|0,a=a+Math.imul(g,tt)|0;var wt=(c+(r=r+Math.imul(l,nt)|0)|0)+((8191&(i=(i=i+Math.imul(l,rt)|0)+Math.imul(h,nt)|0))<<13)|0;c=((a=a+Math.imul(h,rt)|0)+(i>>>13)|0)+(wt>>>26)|0,wt&=67108863,r=Math.imul(D,U),i=(i=Math.imul(D,z))+Math.imul(C,U)|0,a=Math.imul(C,z),r=r+Math.imul(S,V)|0,i=(i=i+Math.imul(S,H)|0)+Math.imul(M,V)|0,a=a+Math.imul(M,H)|0,r=r+Math.imul(k,$)|0,i=(i=i+Math.imul(k,W)|0)+Math.imul(E,$)|0,a=a+Math.imul(E,W)|0,r=r+Math.imul(_,X)|0,i=(i=i+Math.imul(_,Z)|0)+Math.imul(w,X)|0,a=a+Math.imul(w,Z)|0,r=r+Math.imul(b,Q)|0,i=(i=i+Math.imul(b,tt)|0)+Math.imul(v,Q)|0,a=a+Math.imul(v,tt)|0,r=r+Math.imul(p,nt)|0,i=(i=i+Math.imul(p,rt)|0)+Math.imul(g,nt)|0,a=a+Math.imul(g,rt)|0;var xt=(c+(r=r+Math.imul(l,at)|0)|0)+((8191&(i=(i=i+Math.imul(l,ot)|0)+Math.imul(h,at)|0))<<13)|0;c=((a=a+Math.imul(h,ot)|0)+(i>>>13)|0)+(xt>>>26)|0,xt&=67108863,r=Math.imul(I,U),i=(i=Math.imul(I,z))+Math.imul(L,U)|0,a=Math.imul(L,z),r=r+Math.imul(D,V)|0,i=(i=i+Math.imul(D,H)|0)+Math.imul(C,V)|0,a=a+Math.imul(C,H)|0,r=r+Math.imul(S,$)|0,i=(i=i+Math.imul(S,W)|0)+Math.imul(M,$)|0,a=a+Math.imul(M,W)|0,r=r+Math.imul(k,X)|0,i=(i=i+Math.imul(k,Z)|0)+Math.imul(E,X)|0,a=a+Math.imul(E,Z)|0,r=r+Math.imul(_,Q)|0,i=(i=i+Math.imul(_,tt)|0)+Math.imul(w,Q)|0,a=a+Math.imul(w,tt)|0,r=r+Math.imul(b,nt)|0,i=(i=i+Math.imul(b,rt)|0)+Math.imul(v,nt)|0,a=a+Math.imul(v,rt)|0,r=r+Math.imul(p,at)|0,i=(i=i+Math.imul(p,ot)|0)+Math.imul(g,at)|0,a=a+Math.imul(g,ot)|0;var kt=(c+(r=r+Math.imul(l,ut)|0)|0)+((8191&(i=(i=i+Math.imul(l,ct)|0)+Math.imul(h,ut)|0))<<13)|0;c=((a=a+Math.imul(h,ct)|0)+(i>>>13)|0)+(kt>>>26)|0,kt&=67108863,r=Math.imul(O,U),i=(i=Math.imul(O,z))+Math.imul(R,U)|0,a=Math.imul(R,z),r=r+Math.imul(I,V)|0,i=(i=i+Math.imul(I,H)|0)+Math.imul(L,V)|0,a=a+Math.imul(L,H)|0,r=r+Math.imul(D,$)|0,i=(i=i+Math.imul(D,W)|0)+Math.imul(C,$)|0,a=a+Math.imul(C,W)|0,r=r+Math.imul(S,X)|0,i=(i=i+Math.imul(S,Z)|0)+Math.imul(M,X)|0,a=a+Math.imul(M,Z)|0,r=r+Math.imul(k,Q)|0,i=(i=i+Math.imul(k,tt)|0)+Math.imul(E,Q)|0,a=a+Math.imul(E,tt)|0,r=r+Math.imul(_,nt)|0,i=(i=i+Math.imul(_,rt)|0)+Math.imul(w,nt)|0,a=a+Math.imul(w,rt)|0,r=r+Math.imul(b,at)|0,i=(i=i+Math.imul(b,ot)|0)+Math.imul(v,at)|0,a=a+Math.imul(v,ot)|0,r=r+Math.imul(p,ut)|0,i=(i=i+Math.imul(p,ct)|0)+Math.imul(g,ut)|0,a=a+Math.imul(g,ct)|0;var Et=(c+(r=r+Math.imul(l,lt)|0)|0)+((8191&(i=(i=i+Math.imul(l,ht)|0)+Math.imul(h,lt)|0))<<13)|0;c=((a=a+Math.imul(h,ht)|0)+(i>>>13)|0)+(Et>>>26)|0,Et&=67108863,r=Math.imul(F,U),i=(i=Math.imul(F,z))+Math.imul(q,U)|0,a=Math.imul(q,z),r=r+Math.imul(O,V)|0,i=(i=i+Math.imul(O,H)|0)+Math.imul(R,V)|0,a=a+Math.imul(R,H)|0,r=r+Math.imul(I,$)|0,i=(i=i+Math.imul(I,W)|0)+Math.imul(L,$)|0,a=a+Math.imul(L,W)|0,r=r+Math.imul(D,X)|0,i=(i=i+Math.imul(D,Z)|0)+Math.imul(C,X)|0,a=a+Math.imul(C,Z)|0,r=r+Math.imul(S,Q)|0,i=(i=i+Math.imul(S,tt)|0)+Math.imul(M,Q)|0,a=a+Math.imul(M,tt)|0,r=r+Math.imul(k,nt)|0,i=(i=i+Math.imul(k,rt)|0)+Math.imul(E,nt)|0,a=a+Math.imul(E,rt)|0,r=r+Math.imul(_,at)|0,i=(i=i+Math.imul(_,ot)|0)+Math.imul(w,at)|0,a=a+Math.imul(w,ot)|0,r=r+Math.imul(b,ut)|0,i=(i=i+Math.imul(b,ct)|0)+Math.imul(v,ut)|0,a=a+Math.imul(v,ct)|0,r=r+Math.imul(p,lt)|0,i=(i=i+Math.imul(p,ht)|0)+Math.imul(g,lt)|0,a=a+Math.imul(g,ht)|0;var At=(c+(r=r+Math.imul(l,pt)|0)|0)+((8191&(i=(i=i+Math.imul(l,gt)|0)+Math.imul(h,pt)|0))<<13)|0;c=((a=a+Math.imul(h,gt)|0)+(i>>>13)|0)+(At>>>26)|0,At&=67108863,r=Math.imul(F,V),i=(i=Math.imul(F,H))+Math.imul(q,V)|0,a=Math.imul(q,H),r=r+Math.imul(O,$)|0,i=(i=i+Math.imul(O,W)|0)+Math.imul(R,$)|0,a=a+Math.imul(R,W)|0,r=r+Math.imul(I,X)|0,i=(i=i+Math.imul(I,Z)|0)+Math.imul(L,X)|0,a=a+Math.imul(L,Z)|0,r=r+Math.imul(D,Q)|0,i=(i=i+Math.imul(D,tt)|0)+Math.imul(C,Q)|0,a=a+Math.imul(C,tt)|0,r=r+Math.imul(S,nt)|0,i=(i=i+Math.imul(S,rt)|0)+Math.imul(M,nt)|0,a=a+Math.imul(M,rt)|0,r=r+Math.imul(k,at)|0,i=(i=i+Math.imul(k,ot)|0)+Math.imul(E,at)|0,a=a+Math.imul(E,ot)|0,r=r+Math.imul(_,ut)|0,i=(i=i+Math.imul(_,ct)|0)+Math.imul(w,ut)|0,a=a+Math.imul(w,ct)|0,r=r+Math.imul(b,lt)|0,i=(i=i+Math.imul(b,ht)|0)+Math.imul(v,lt)|0,a=a+Math.imul(v,ht)|0;var St=(c+(r=r+Math.imul(p,pt)|0)|0)+((8191&(i=(i=i+Math.imul(p,gt)|0)+Math.imul(g,pt)|0))<<13)|0;c=((a=a+Math.imul(g,gt)|0)+(i>>>13)|0)+(St>>>26)|0,St&=67108863,r=Math.imul(F,$),i=(i=Math.imul(F,W))+Math.imul(q,$)|0,a=Math.imul(q,W),r=r+Math.imul(O,X)|0,i=(i=i+Math.imul(O,Z)|0)+Math.imul(R,X)|0,a=a+Math.imul(R,Z)|0,r=r+Math.imul(I,Q)|0,i=(i=i+Math.imul(I,tt)|0)+Math.imul(L,Q)|0,a=a+Math.imul(L,tt)|0,r=r+Math.imul(D,nt)|0,i=(i=i+Math.imul(D,rt)|0)+Math.imul(C,nt)|0,a=a+Math.imul(C,rt)|0,r=r+Math.imul(S,at)|0,i=(i=i+Math.imul(S,ot)|0)+Math.imul(M,at)|0,a=a+Math.imul(M,ot)|0,r=r+Math.imul(k,ut)|0,i=(i=i+Math.imul(k,ct)|0)+Math.imul(E,ut)|0,a=a+Math.imul(E,ct)|0,r=r+Math.imul(_,lt)|0,i=(i=i+Math.imul(_,ht)|0)+Math.imul(w,lt)|0,a=a+Math.imul(w,ht)|0;var Mt=(c+(r=r+Math.imul(b,pt)|0)|0)+((8191&(i=(i=i+Math.imul(b,gt)|0)+Math.imul(v,pt)|0))<<13)|0;c=((a=a+Math.imul(v,gt)|0)+(i>>>13)|0)+(Mt>>>26)|0,Mt&=67108863,r=Math.imul(F,X),i=(i=Math.imul(F,Z))+Math.imul(q,X)|0,a=Math.imul(q,Z),r=r+Math.imul(O,Q)|0,i=(i=i+Math.imul(O,tt)|0)+Math.imul(R,Q)|0,a=a+Math.imul(R,tt)|0,r=r+Math.imul(I,nt)|0,i=(i=i+Math.imul(I,rt)|0)+Math.imul(L,nt)|0,a=a+Math.imul(L,rt)|0,r=r+Math.imul(D,at)|0,i=(i=i+Math.imul(D,ot)|0)+Math.imul(C,at)|0,a=a+Math.imul(C,ot)|0,r=r+Math.imul(S,ut)|0,i=(i=i+Math.imul(S,ct)|0)+Math.imul(M,ut)|0,a=a+Math.imul(M,ct)|0,r=r+Math.imul(k,lt)|0,i=(i=i+Math.imul(k,ht)|0)+Math.imul(E,lt)|0,a=a+Math.imul(E,ht)|0;var Tt=(c+(r=r+Math.imul(_,pt)|0)|0)+((8191&(i=(i=i+Math.imul(_,gt)|0)+Math.imul(w,pt)|0))<<13)|0;c=((a=a+Math.imul(w,gt)|0)+(i>>>13)|0)+(Tt>>>26)|0,Tt&=67108863,r=Math.imul(F,Q),i=(i=Math.imul(F,tt))+Math.imul(q,Q)|0,a=Math.imul(q,tt),r=r+Math.imul(O,nt)|0,i=(i=i+Math.imul(O,rt)|0)+Math.imul(R,nt)|0,a=a+Math.imul(R,rt)|0,r=r+Math.imul(I,at)|0,i=(i=i+Math.imul(I,ot)|0)+Math.imul(L,at)|0,a=a+Math.imul(L,ot)|0,r=r+Math.imul(D,ut)|0,i=(i=i+Math.imul(D,ct)|0)+Math.imul(C,ut)|0,a=a+Math.imul(C,ct)|0,r=r+Math.imul(S,lt)|0,i=(i=i+Math.imul(S,ht)|0)+Math.imul(M,lt)|0,a=a+Math.imul(M,ht)|0;var Dt=(c+(r=r+Math.imul(k,pt)|0)|0)+((8191&(i=(i=i+Math.imul(k,gt)|0)+Math.imul(E,pt)|0))<<13)|0;c=((a=a+Math.imul(E,gt)|0)+(i>>>13)|0)+(Dt>>>26)|0,Dt&=67108863,r=Math.imul(F,nt),i=(i=Math.imul(F,rt))+Math.imul(q,nt)|0,a=Math.imul(q,rt),r=r+Math.imul(O,at)|0,i=(i=i+Math.imul(O,ot)|0)+Math.imul(R,at)|0,a=a+Math.imul(R,ot)|0,r=r+Math.imul(I,ut)|0,i=(i=i+Math.imul(I,ct)|0)+Math.imul(L,ut)|0,a=a+Math.imul(L,ct)|0,r=r+Math.imul(D,lt)|0,i=(i=i+Math.imul(D,ht)|0)+Math.imul(C,lt)|0,a=a+Math.imul(C,ht)|0;var Ct=(c+(r=r+Math.imul(S,pt)|0)|0)+((8191&(i=(i=i+Math.imul(S,gt)|0)+Math.imul(M,pt)|0))<<13)|0;c=((a=a+Math.imul(M,gt)|0)+(i>>>13)|0)+(Ct>>>26)|0,Ct&=67108863,r=Math.imul(F,at),i=(i=Math.imul(F,ot))+Math.imul(q,at)|0,a=Math.imul(q,ot),r=r+Math.imul(O,ut)|0,i=(i=i+Math.imul(O,ct)|0)+Math.imul(R,ut)|0,a=a+Math.imul(R,ct)|0,r=r+Math.imul(I,lt)|0,i=(i=i+Math.imul(I,ht)|0)+Math.imul(L,lt)|0,a=a+Math.imul(L,ht)|0;var Nt=(c+(r=r+Math.imul(D,pt)|0)|0)+((8191&(i=(i=i+Math.imul(D,gt)|0)+Math.imul(C,pt)|0))<<13)|0;c=((a=a+Math.imul(C,gt)|0)+(i>>>13)|0)+(Nt>>>26)|0,Nt&=67108863,r=Math.imul(F,ut),i=(i=Math.imul(F,ct))+Math.imul(q,ut)|0,a=Math.imul(q,ct),r=r+Math.imul(O,lt)|0,i=(i=i+Math.imul(O,ht)|0)+Math.imul(R,lt)|0,a=a+Math.imul(R,ht)|0;var It=(c+(r=r+Math.imul(I,pt)|0)|0)+((8191&(i=(i=i+Math.imul(I,gt)|0)+Math.imul(L,pt)|0))<<13)|0;c=((a=a+Math.imul(L,gt)|0)+(i>>>13)|0)+(It>>>26)|0,It&=67108863,r=Math.imul(F,lt),i=(i=Math.imul(F,ht))+Math.imul(q,lt)|0,a=Math.imul(q,ht);var Lt=(c+(r=r+Math.imul(O,pt)|0)|0)+((8191&(i=(i=i+Math.imul(O,gt)|0)+Math.imul(R,pt)|0))<<13)|0;c=((a=a+Math.imul(R,gt)|0)+(i>>>13)|0)+(Lt>>>26)|0,Lt&=67108863;var Bt=(c+(r=Math.imul(F,pt))|0)+((8191&(i=(i=Math.imul(F,gt))+Math.imul(q,pt)|0))<<13)|0;return c=((a=Math.imul(q,gt))+(i>>>13)|0)+(Bt>>>26)|0,Bt&=67108863,u[0]=yt,u[1]=bt,u[2]=vt,u[3]=mt,u[4]=_t,u[5]=wt,u[6]=xt,u[7]=kt,u[8]=Et,u[9]=At,u[10]=St,u[11]=Mt,u[12]=Tt,u[13]=Dt,u[14]=Ct,u[15]=Nt,u[16]=It,u[17]=Lt,u[18]=Bt,0!==c&&(u[19]=c,n.length++),n};function p(t,e,n){return(new g).mulp(t,e,n)}function g(t,e){this.x=t,this.y=e}Math.imul||(d=h),a.prototype.mulTo=function(t,e){var n=this.length+t.length;return 10===this.length&&10===t.length?d(this,t,e):n<63?h(this,t,e):n<1024?function(t,e,n){n.negative=e.negative^t.negative,n.length=t.length+e.length;for(var r=0,i=0,a=0;a<n.length-1;a++){var o=i;i=0;for(var s=67108863&r,u=Math.min(a,e.length-1),c=Math.max(0,a-t.length+1);c<=u;c++){var f=a-c,l=(0|t.words[f])*(0|e.words[c]),h=67108863&l;s=67108863&(h=h+s|0),i+=(o=(o=o+(l/67108864|0)|0)+(h>>>26)|0)>>>26,o&=67108863}n.words[a]=s,r=o,o=i}return 0!==r?n.words[a]=r:n.length--,n.strip()}(this,t,e):p(this,t,e)},g.prototype.makeRBT=function(t){for(var e=new Array(t),n=a.prototype._countBits(t)-1,r=0;r<t;r++)e[r]=this.revBin(r,n,t);return e},g.prototype.revBin=function(t,e,n){if(0===t||t===n-1)return t;for(var r=0,i=0;i<e;i++)r|=(1&t)<<e-i-1,t>>=1;return r},g.prototype.permute=function(t,e,n,r,i,a){for(var o=0;o<a;o++)r[o]=e[t[o]],i[o]=n[t[o]]},g.prototype.transform=function(t,e,n,r,i,a){this.permute(a,t,e,n,r,i);for(var o=1;o<i;o<<=1)for(var s=o<<1,u=Math.cos(2*Math.PI/s),c=Math.sin(2*Math.PI/s),f=0;f<i;f+=s)for(var l=u,h=c,d=0;d<o;d++){var p=n[f+d],g=r[f+d],y=n[f+d+o],b=r[f+d+o],v=l*y-h*b;b=l*b+h*y,y=v,n[f+d]=p+y,r[f+d]=g+b,n[f+d+o]=p-y,r[f+d+o]=g-b,d!==s&&(v=u*l-c*h,h=u*h+c*l,l=v)}},g.prototype.guessLen13b=function(t,e){var n=1|Math.max(e,t),r=1&n,i=0;for(n=n/2|0;n;n>>>=1)i++;return 1<<i+1+r},g.prototype.conjugate=function(t,e,n){if(!(n<=1))for(var r=0;r<n/2;r++){var i=t[r];t[r]=t[n-r-1],t[n-r-1]=i,i=e[r],e[r]=-e[n-r-1],e[n-r-1]=-i}},g.prototype.normalize13b=function(t,e){for(var n=0,r=0;r<e/2;r++){var i=8192*Math.round(t[2*r+1]/e)+Math.round(t[2*r]/e)+n;t[r]=67108863&i,n=i<67108864?0:i/67108864|0}return t},g.prototype.convert13b=function(t,e,n,i){for(var a=0,o=0;o<e;o++)a+=0|t[o],n[2*o]=8191&a,a>>>=13,n[2*o+1]=8191&a,a>>>=13;for(o=2*e;o<i;++o)n[o]=0;r(0===a),r(0==(-8192&a))},g.prototype.stub=function(t){for(var e=new Array(t),n=0;n<t;n++)e[n]=0;return e},g.prototype.mulp=function(t,e,n){var r=2*this.guessLen13b(t.length,e.length),i=this.makeRBT(r),a=this.stub(r),o=new Array(r),s=new Array(r),u=new Array(r),c=new Array(r),f=new Array(r),l=new Array(r),h=n.words;h.length=r,this.convert13b(t.words,t.length,o,r),this.convert13b(e.words,e.length,c,r),this.transform(o,a,s,u,r,i),this.transform(c,a,f,l,r,i);for(var d=0;d<r;d++){var p=s[d]*f[d]-u[d]*l[d];u[d]=s[d]*l[d]+u[d]*f[d],s[d]=p}return this.conjugate(s,u,r),this.transform(s,u,h,a,r,i),this.conjugate(h,a,r),this.normalize13b(h,r),n.negative=t.negative^e.negative,n.length=t.length+e.length,n.strip()},a.prototype.mul=function(t){var e=new a(null);return e.words=new Array(this.length+t.length),this.mulTo(t,e)},a.prototype.mulf=function(t){var e=new a(null);return e.words=new Array(this.length+t.length),p(this,t,e)},a.prototype.imul=function(t){return this.clone().mulTo(t,this)},a.prototype.imuln=function(t){r("number"==typeof t),r(t<67108864);for(var e=0,n=0;n<this.length;n++){var i=(0|this.words[n])*t,a=(67108863&i)+(67108863&e);e>>=26,e+=i/67108864|0,e+=a>>>26,this.words[n]=67108863&a}return 0!==e&&(this.words[n]=e,this.length++),this},a.prototype.muln=function(t){return this.clone().imuln(t)},a.prototype.sqr=function(){return this.mul(this)},a.prototype.isqr=function(){return this.imul(this.clone())},a.prototype.pow=function(t){var e=function(t){for(var e=new Array(t.bitLength()),n=0;n<e.length;n++){var r=n/26|0,i=n%26;e[n]=(t.words[r]&1<<i)>>>i}return e}(t);if(0===e.length)return new a(1);for(var n=this,r=0;r<e.length&&0===e[r];r++,n=n.sqr());if(++r<e.length)for(var i=n.sqr();r<e.length;r++,i=i.sqr())0!==e[r]&&(n=n.mul(i));return n},a.prototype.iushln=function(t){r("number"==typeof t&&t>=0);var e,n=t%26,i=(t-n)/26,a=67108863>>>26-n<<26-n;if(0!==n){var o=0;for(e=0;e<this.length;e++){var s=this.words[e]&a,u=(0|this.words[e])-s<<n;this.words[e]=u|o,o=s>>>26-n}o&&(this.words[e]=o,this.length++)}if(0!==i){for(e=this.length-1;e>=0;e--)this.words[e+i]=this.words[e];for(e=0;e<i;e++)this.words[e]=0;this.length+=i}return this.strip()},a.prototype.ishln=function(t){return r(0===this.negative),this.iushln(t)},a.prototype.iushrn=function(t,e,n){var i;r("number"==typeof t&&t>=0),i=e?(e-e%26)/26:0;var a=t%26,o=Math.min((t-a)/26,this.length),s=67108863^67108863>>>a<<a,u=n;if(i-=o,i=Math.max(0,i),u){for(var c=0;c<o;c++)u.words[c]=this.words[c];u.length=o}if(0===o);else if(this.length>o)for(this.length-=o,c=0;c<this.length;c++)this.words[c]=this.words[c+o];else this.words[0]=0,this.length=1;var f=0;for(c=this.length-1;c>=0&&(0!==f||c>=i);c--){var l=0|this.words[c];this.words[c]=f<<26-a|l>>>a,f=l&s}return u&&0!==f&&(u.words[u.length++]=f),0===this.length&&(this.words[0]=0,this.length=1),this.strip()},a.prototype.ishrn=function(t,e,n){return r(0===this.negative),this.iushrn(t,e,n)},a.prototype.shln=function(t){return this.clone().ishln(t)},a.prototype.ushln=function(t){return this.clone().iushln(t)},a.prototype.shrn=function(t){return this.clone().ishrn(t)},a.prototype.ushrn=function(t){return this.clone().iushrn(t)},a.prototype.testn=function(t){r("number"==typeof t&&t>=0);var e=t%26,n=(t-e)/26,i=1<<e;return!(this.length<=n)&&!!(this.words[n]&i)},a.prototype.imaskn=function(t){r("number"==typeof t&&t>=0);var e=t%26,n=(t-e)/26;if(r(0===this.negative,"imaskn works only with positive numbers"),this.length<=n)return this;if(0!==e&&n++,this.length=Math.min(n,this.length),0!==e){var i=67108863^67108863>>>e<<e;this.words[this.length-1]&=i}return this.strip()},a.prototype.maskn=function(t){return this.clone().imaskn(t)},a.prototype.iaddn=function(t){return r("number"==typeof t),r(t<67108864),t<0?this.isubn(-t):0!==this.negative?1===this.length&&(0|this.words[0])<t?(this.words[0]=t-(0|this.words[0]),this.negative=0,this):(this.negative=0,this.isubn(t),this.negative=1,this):this._iaddn(t)},a.prototype._iaddn=function(t){this.words[0]+=t;for(var e=0;e<this.length&&this.words[e]>=67108864;e++)this.words[e]-=67108864,e===this.length-1?this.words[e+1]=1:this.words[e+1]++;return this.length=Math.max(this.length,e+1),this},a.prototype.isubn=function(t){if(r("number"==typeof t),r(t<67108864),t<0)return this.iaddn(-t);if(0!==this.negative)return this.negative=0,this.iaddn(t),this.negative=1,this;if(this.words[0]-=t,1===this.length&&this.words[0]<0)this.words[0]=-this.words[0],this.negative=1;else for(var e=0;e<this.length&&this.words[e]<0;e++)this.words[e]+=67108864,this.words[e+1]-=1;return this.strip()},a.prototype.addn=function(t){return this.clone().iaddn(t)},a.prototype.subn=function(t){return this.clone().isubn(t)},a.prototype.iabs=function(){return this.negative=0,this},a.prototype.abs=function(){return this.clone().iabs()},a.prototype._ishlnsubmul=function(t,e,n){var i,a,o=t.length+n;this._expand(o);var s=0;for(i=0;i<t.length;i++){a=(0|this.words[i+n])+s;var u=(0|t.words[i])*e;s=((a-=67108863&u)>>26)-(u/67108864|0),this.words[i+n]=67108863&a}for(;i<this.length-n;i++)s=(a=(0|this.words[i+n])+s)>>26,this.words[i+n]=67108863&a;if(0===s)return this.strip();for(r(-1===s),s=0,i=0;i<this.length;i++)s=(a=-(0|this.words[i])+s)>>26,this.words[i]=67108863&a;return this.negative=1,this.strip()},a.prototype._wordDiv=function(t,e){var n=(this.length,t.length),r=this.clone(),i=t,o=0|i.words[i.length-1];0!==(n=26-this._countBits(o))&&(i=i.ushln(n),r.iushln(n),o=0|i.words[i.length-1]);var s,u=r.length-i.length;if("mod"!==e){(s=new a(null)).length=u+1,s.words=new Array(s.length);for(var c=0;c<s.length;c++)s.words[c]=0}var f=r.clone()._ishlnsubmul(i,1,u);0===f.negative&&(r=f,s&&(s.words[u]=1));for(var l=u-1;l>=0;l--){var h=67108864*(0|r.words[i.length+l])+(0|r.words[i.length+l-1]);for(h=Math.min(h/o|0,67108863),r._ishlnsubmul(i,h,l);0!==r.negative;)h--,r.negative=0,r._ishlnsubmul(i,1,l),r.isZero()||(r.negative^=1);s&&(s.words[l]=h)}return s&&s.strip(),r.strip(),"div"!==e&&0!==n&&r.iushrn(n),{div:s||null,mod:r}},a.prototype.divmod=function(t,e,n){return r(!t.isZero()),this.isZero()?{div:new a(0),mod:new a(0)}:0!==this.negative&&0===t.negative?(s=this.neg().divmod(t,e),"mod"!==e&&(i=s.div.neg()),"div"!==e&&(o=s.mod.neg(),n&&0!==o.negative&&o.iadd(t)),{div:i,mod:o}):0===this.negative&&0!==t.negative?(s=this.divmod(t.neg(),e),"mod"!==e&&(i=s.div.neg()),{div:i,mod:s.mod}):0!=(this.negative&t.negative)?(s=this.neg().divmod(t.neg(),e),"div"!==e&&(o=s.mod.neg(),n&&0!==o.negative&&o.isub(t)),{div:s.div,mod:o}):t.length>this.length||this.cmp(t)<0?{div:new a(0),mod:this}:1===t.length?"div"===e?{div:this.divn(t.words[0]),mod:null}:"mod"===e?{div:null,mod:new a(this.modn(t.words[0]))}:{div:this.divn(t.words[0]),mod:new a(this.modn(t.words[0]))}:this._wordDiv(t,e);var i,o,s},a.prototype.div=function(t){return this.divmod(t,"div",!1).div},a.prototype.mod=function(t){return this.divmod(t,"mod",!1).mod},a.prototype.umod=function(t){return this.divmod(t,"mod",!0).mod},a.prototype.divRound=function(t){var e=this.divmod(t);if(e.mod.isZero())return e.div;var n=0!==e.div.negative?e.mod.isub(t):e.mod,r=t.ushrn(1),i=t.andln(1),a=n.cmp(r);return a<0||1===i&&0===a?e.div:0!==e.div.negative?e.div.isubn(1):e.div.iaddn(1)},a.prototype.modn=function(t){r(t<=67108863);for(var e=(1<<26)%t,n=0,i=this.length-1;i>=0;i--)n=(e*n+(0|this.words[i]))%t;return n},a.prototype.idivn=function(t){r(t<=67108863);for(var e=0,n=this.length-1;n>=0;n--){var i=(0|this.words[n])+67108864*e;this.words[n]=i/t|0,e=i%t}return this.strip()},a.prototype.divn=function(t){return this.clone().idivn(t)},a.prototype.egcd=function(t){r(0===t.negative),r(!t.isZero());var e=this,n=t.clone();e=0!==e.negative?e.umod(t):e.clone();for(var i=new a(1),o=new a(0),s=new a(0),u=new a(1),c=0;e.isEven()&&n.isEven();)e.iushrn(1),n.iushrn(1),++c;for(var f=n.clone(),l=e.clone();!e.isZero();){for(var h=0,d=1;0==(e.words[0]&d)&&h<26;++h,d<<=1);if(h>0)for(e.iushrn(h);h-- >0;)(i.isOdd()||o.isOdd())&&(i.iadd(f),o.isub(l)),i.iushrn(1),o.iushrn(1);for(var p=0,g=1;0==(n.words[0]&g)&&p<26;++p,g<<=1);if(p>0)for(n.iushrn(p);p-- >0;)(s.isOdd()||u.isOdd())&&(s.iadd(f),u.isub(l)),s.iushrn(1),u.iushrn(1);e.cmp(n)>=0?(e.isub(n),i.isub(s),o.isub(u)):(n.isub(e),s.isub(i),u.isub(o))}return{a:s,b:u,gcd:n.iushln(c)}},a.prototype._invmp=function(t){r(0===t.negative),r(!t.isZero());var e=this,n=t.clone();e=0!==e.negative?e.umod(t):e.clone();for(var i,o=new a(1),s=new a(0),u=n.clone();e.cmpn(1)>0&&n.cmpn(1)>0;){for(var c=0,f=1;0==(e.words[0]&f)&&c<26;++c,f<<=1);if(c>0)for(e.iushrn(c);c-- >0;)o.isOdd()&&o.iadd(u),o.iushrn(1);for(var l=0,h=1;0==(n.words[0]&h)&&l<26;++l,h<<=1);if(l>0)for(n.iushrn(l);l-- >0;)s.isOdd()&&s.iadd(u),s.iushrn(1);e.cmp(n)>=0?(e.isub(n),o.isub(s)):(n.isub(e),s.isub(o))}return(i=0===e.cmpn(1)?o:s).cmpn(0)<0&&i.iadd(t),i},a.prototype.gcd=function(t){if(this.isZero())return t.abs();if(t.isZero())return this.abs();var e=this.clone(),n=t.clone();e.negative=0,n.negative=0;for(var r=0;e.isEven()&&n.isEven();r++)e.iushrn(1),n.iushrn(1);for(;;){for(;e.isEven();)e.iushrn(1);for(;n.isEven();)n.iushrn(1);var i=e.cmp(n);if(i<0){var a=e;e=n,n=a}else if(0===i||0===n.cmpn(1))break;e.isub(n)}return n.iushln(r)},a.prototype.invm=function(t){return this.egcd(t).a.umod(t)},a.prototype.isEven=function(){return 0==(1&this.words[0])},a.prototype.isOdd=function(){return 1==(1&this.words[0])},a.prototype.andln=function(t){return this.words[0]&t},a.prototype.bincn=function(t){r("number"==typeof t);var e=t%26,n=(t-e)/26,i=1<<e;if(this.length<=n)return this._expand(n+1),this.words[n]|=i,this;for(var a=i,o=n;0!==a&&o<this.length;o++){var s=0|this.words[o];a=(s+=a)>>>26,s&=67108863,this.words[o]=s}return 0!==a&&(this.words[o]=a,this.length++),this},a.prototype.isZero=function(){return 1===this.length&&0===this.words[0]},a.prototype.cmpn=function(t){var e,n=t<0;if(0!==this.negative&&!n)return-1;if(0===this.negative&&n)return 1;if(this.strip(),this.length>1)e=1;else{n&&(t=-t),r(t<=67108863,"Number is too big");var i=0|this.words[0];e=i===t?0:i<t?-1:1}return 0!==this.negative?0|-e:e},a.prototype.cmp=function(t){if(0!==this.negative&&0===t.negative)return-1;if(0===this.negative&&0!==t.negative)return 1;var e=this.ucmp(t);return 0!==this.negative?0|-e:e},a.prototype.ucmp=function(t){if(this.length>t.length)return 1;if(this.length<t.length)return-1;for(var e=0,n=this.length-1;n>=0;n--){var r=0|this.words[n],i=0|t.words[n];if(r!==i){r<i?e=-1:r>i&&(e=1);break}}return e},a.prototype.gtn=function(t){return 1===this.cmpn(t)},a.prototype.gt=function(t){return 1===this.cmp(t)},a.prototype.gten=function(t){return this.cmpn(t)>=0},a.prototype.gte=function(t){return this.cmp(t)>=0},a.prototype.ltn=function(t){return-1===this.cmpn(t)},a.prototype.lt=function(t){return-1===this.cmp(t)},a.prototype.lten=function(t){return this.cmpn(t)<=0},a.prototype.lte=function(t){return this.cmp(t)<=0},a.prototype.eqn=function(t){return 0===this.cmpn(t)},a.prototype.eq=function(t){return 0===this.cmp(t)},a.red=function(t){return new x(t)},a.prototype.toRed=function(t){return r(!this.red,"Already a number in reduction context"),r(0===this.negative,"red works only with positives"),t.convertTo(this)._forceRed(t)},a.prototype.fromRed=function(){return r(this.red,"fromRed works only with numbers in reduction context"),this.red.convertFrom(this)},a.prototype._forceRed=function(t){return this.red=t,this},a.prototype.forceRed=function(t){return r(!this.red,"Already a number in reduction context"),this._forceRed(t)},a.prototype.redAdd=function(t){return r(this.red,"redAdd works only with red numbers"),this.red.add(this,t)},a.prototype.redIAdd=function(t){return r(this.red,"redIAdd works only with red numbers"),this.red.iadd(this,t)},a.prototype.redSub=function(t){return r(this.red,"redSub works only with red numbers"),this.red.sub(this,t)},a.prototype.redISub=function(t){return r(this.red,"redISub works only with red numbers"),this.red.isub(this,t)},a.prototype.redShl=function(t){return r(this.red,"redShl works only with red numbers"),this.red.shl(this,t)},a.prototype.redMul=function(t){return r(this.red,"redMul works only with red numbers"),this.red._verify2(this,t),this.red.mul(this,t)},a.prototype.redIMul=function(t){return r(this.red,"redMul works only with red numbers"),this.red._verify2(this,t),this.red.imul(this,t)},a.prototype.redSqr=function(){return r(this.red,"redSqr works only with red numbers"),this.red._verify1(this),this.red.sqr(this)},a.prototype.redISqr=function(){return r(this.red,"redISqr works only with red numbers"),this.red._verify1(this),this.red.isqr(this)},a.prototype.redSqrt=function(){return r(this.red,"redSqrt works only with red numbers"),this.red._verify1(this),this.red.sqrt(this)},a.prototype.redInvm=function(){return r(this.red,"redInvm works only with red numbers"),this.red._verify1(this),this.red.invm(this)},a.prototype.redNeg=function(){return r(this.red,"redNeg works only with red numbers"),this.red._verify1(this),this.red.neg(this)},a.prototype.redPow=function(t){return r(this.red&&!t.red,"redPow(normalNum)"),this.red._verify1(this),this.red.pow(this,t)};var y={k256:null,p224:null,p192:null,p25519:null};function b(t,e){this.name=t,this.p=new a(e,16),this.n=this.p.bitLength(),this.k=new a(1).iushln(this.n).isub(this.p),this.tmp=this._tmp()}function v(){b.call(this,"k256","ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff fffffffe fffffc2f")}function m(){b.call(this,"p224","ffffffff ffffffff ffffffff ffffffff 00000000 00000000 00000001")}function _(){b.call(this,"p192","ffffffff ffffffff ffffffff fffffffe ffffffff ffffffff")}function w(){b.call(this,"25519","7fffffffffffffff ffffffffffffffff ffffffffffffffff ffffffffffffffed")}function x(t){if("string"==typeof t){var e=a._prime(t);this.m=e.p,this.prime=e}else r(t.gtn(1),"modulus must be greater than 1"),this.m=t,this.prime=null}function k(t){x.call(this,t),this.shift=this.m.bitLength(),this.shift%26!=0&&(this.shift+=26-this.shift%26),this.r=new a(1).iushln(this.shift),this.r2=this.imod(this.r.sqr()),this.rinv=this.r._invmp(this.m),this.minv=this.rinv.mul(this.r).isubn(1).div(this.m),this.minv=this.minv.umod(this.r),this.minv=this.r.sub(this.minv)}b.prototype._tmp=function(){var t=new a(null);return t.words=new Array(Math.ceil(this.n/13)),t},b.prototype.ireduce=function(t){var e,n=t;do{this.split(n,this.tmp),e=(n=(n=this.imulK(n)).iadd(this.tmp)).bitLength()}while(e>this.n);var r=e<this.n?-1:n.ucmp(this.p);return 0===r?(n.words[0]=0,n.length=1):r>0?n.isub(this.p):n.strip(),n},b.prototype.split=function(t,e){t.iushrn(this.n,0,e)},b.prototype.imulK=function(t){return t.imul(this.k)},i(v,b),v.prototype.split=function(t,e){for(var n=Math.min(t.length,9),r=0;r<n;r++)e.words[r]=t.words[r];if(e.length=n,t.length<=9)return t.words[0]=0,void(t.length=1);var i=t.words[9];for(e.words[e.length++]=4194303&i,r=10;r<t.length;r++){var a=0|t.words[r];t.words[r-10]=(4194303&a)<<4|i>>>22,i=a}i>>>=22,t.words[r-10]=i,0===i&&t.length>10?t.length-=10:t.length-=9},v.prototype.imulK=function(t){t.words[t.length]=0,t.words[t.length+1]=0,t.length+=2;for(var e=0,n=0;n<t.length;n++){var r=0|t.words[n];e+=977*r,t.words[n]=67108863&e,e=64*r+(e/67108864|0)}return 0===t.words[t.length-1]&&(t.length--,0===t.words[t.length-1]&&t.length--),t},i(m,b),i(_,b),i(w,b),w.prototype.imulK=function(t){for(var e=0,n=0;n<t.length;n++){var r=19*(0|t.words[n])+e,i=67108863&r;r>>>=26,t.words[n]=i,e=r}return 0!==e&&(t.words[t.length++]=e),t},a._prime=function(t){if(y[t])return y[t];var e;if("k256"===t)e=new v;else if("p224"===t)e=new m;else if("p192"===t)e=new _;else{if("p25519"!==t)throw new Error("Unknown prime "+t);e=new w}return y[t]=e,e},x.prototype._verify1=function(t){r(0===t.negative,"red works only with positives"),r(t.red,"red works only with red numbers")},x.prototype._verify2=function(t,e){r(0==(t.negative|e.negative),"red works only with positives"),r(t.red&&t.red===e.red,"red works only with red numbers")},x.prototype.imod=function(t){return this.prime?this.prime.ireduce(t)._forceRed(this):t.umod(this.m)._forceRed(this)},x.prototype.neg=function(t){return t.isZero()?t.clone():this.m.sub(t)._forceRed(this)},x.prototype.add=function(t,e){this._verify2(t,e);var n=t.add(e);return n.cmp(this.m)>=0&&n.isub(this.m),n._forceRed(this)},x.prototype.iadd=function(t,e){this._verify2(t,e);var n=t.iadd(e);return n.cmp(this.m)>=0&&n.isub(this.m),n},x.prototype.sub=function(t,e){this._verify2(t,e);var n=t.sub(e);return n.cmpn(0)<0&&n.iadd(this.m),n._forceRed(this)},x.prototype.isub=function(t,e){this._verify2(t,e);var n=t.isub(e);return n.cmpn(0)<0&&n.iadd(this.m),n},x.prototype.shl=function(t,e){return this._verify1(t),this.imod(t.ushln(e))},x.prototype.imul=function(t,e){return this._verify2(t,e),this.imod(t.imul(e))},x.prototype.mul=function(t,e){return this._verify2(t,e),this.imod(t.mul(e))},x.prototype.isqr=function(t){return this.imul(t,t.clone())},x.prototype.sqr=function(t){return this.mul(t,t)},x.prototype.sqrt=function(t){if(t.isZero())return t.clone();var e=this.m.andln(3);if(r(e%2==1),3===e){var n=this.m.add(new a(1)).iushrn(2);return this.pow(t,n)}for(var i=this.m.subn(1),o=0;!i.isZero()&&0===i.andln(1);)o++,i.iushrn(1);r(!i.isZero());var s=new a(1).toRed(this),u=s.redNeg(),c=this.m.subn(1).iushrn(1),f=this.m.bitLength();for(f=new a(2*f*f).toRed(this);0!==this.pow(f,c).cmp(u);)f.redIAdd(u);for(var l=this.pow(f,i),h=this.pow(t,i.addn(1).iushrn(1)),d=this.pow(t,i),p=o;0!==d.cmp(s);){for(var g=d,y=0;0!==g.cmp(s);y++)g=g.redSqr();r(y<p);var b=this.pow(l,new a(1).iushln(p-y-1));h=h.redMul(b),l=b.redSqr(),d=d.redMul(l),p=y}return h},x.prototype.invm=function(t){var e=t._invmp(this.m);return 0!==e.negative?(e.negative=0,this.imod(e).redNeg()):this.imod(e)},x.prototype.pow=function(t,e){if(e.isZero())return new a(1).toRed(this);if(0===e.cmpn(1))return t.clone();var n=new Array(16);n[0]=new a(1).toRed(this),n[1]=t;for(var r=2;r<n.length;r++)n[r]=this.mul(n[r-1],t);var i=n[0],o=0,s=0,u=e.bitLength()%26;for(0===u&&(u=26),r=e.length-1;r>=0;r--){for(var c=e.words[r],f=u-1;f>=0;f--){var l=c>>f&1;i!==n[0]&&(i=this.sqr(i)),0!==l||0!==o?(o<<=1,o|=l,(4===++s||0===r&&0===f)&&(i=this.mul(i,n[o]),s=0,o=0)):s=0}u=26}return i},x.prototype.convertTo=function(t){var e=t.umod(this.m);return e===t?e.clone():e},x.prototype.convertFrom=function(t){var e=t.clone();return e.red=null,e},a.mont=function(t){return new k(t)},i(k,x),k.prototype.convertTo=function(t){return this.imod(t.ushln(this.shift))},k.prototype.convertFrom=function(t){var e=this.imod(t.mul(this.rinv));return e.red=null,e},k.prototype.imul=function(t,e){if(t.isZero()||e.isZero())return t.words[0]=0,t.length=1,t;var n=t.imul(e),r=n.maskn(this.shift).mul(this.minv).imaskn(this.shift).mul(this.m),i=n.isub(r).iushrn(this.shift),a=i;return i.cmp(this.m)>=0?a=i.isub(this.m):i.cmpn(0)<0&&(a=i.iadd(this.m)),a._forceRed(this)},k.prototype.mul=function(t,e){if(t.isZero()||e.isZero())return new a(0)._forceRed(this);var n=t.mul(e),r=n.maskn(this.shift).mul(this.minv).imaskn(this.shift).mul(this.m),i=n.isub(r).iushrn(this.shift),o=i;return i.cmp(this.m)>=0?o=i.isub(this.m):i.cmpn(0)<0&&(o=i.iadd(this.m)),o._forceRed(this)},k.prototype.invm=function(t){return this.imod(t._invmp(this.m).mul(this.r2))._forceRed(this)}}(t,this)}).call(this,n(9)(t))},function(t,e){var n=Array.isArray;t.exports=n},function(t,e){var n,r,i=t.exports={};function a(){throw new Error("setTimeout has not been defined")}function o(){throw new Error("clearTimeout has not been defined")}function s(t){if(n===setTimeout)return setTimeout(t,0);if((n===a||!n)&&setTimeout)return n=setTimeout,setTimeout(t,0);try{return n(t,0)}catch(e){try{return n.call(null,t,0)}catch(e){return n.call(this,t,0)}}}!function(){try{n="function"==typeof setTimeout?setTimeout:a}catch(t){n=a}try{r="function"==typeof clearTimeout?clearTimeout:o}catch(t){r=o}}();var u,c=[],f=!1,l=-1;function h(){f&&u&&(f=!1,u.length?c=u.concat(c):l=-1,c.length&&d())}function d(){if(!f){var t=s(h);f=!0;for(var e=c.length;e;){for(u=c,c=[];++l<e;)u&&u[l].run();l=-1,e=c.length}u=null,f=!1,function(t){if(r===clearTimeout)return clearTimeout(t);if((r===o||!r)&&clearTimeout)return r=clearTimeout,clearTimeout(t);try{r(t)}catch(e){try{return r.call(null,t)}catch(e){return r.call(this,t)}}}(t)}}function p(t,e){this.fun=t,this.array=e}function g(){}i.nextTick=function(t){var e=new Array(arguments.length-1);if(arguments.length>1)for(var n=1;n<arguments.length;n++)e[n-1]=arguments[n];c.push(new p(t,e)),1!==c.length||f||s(d)},p.prototype.run=function(){this.fun.apply(null,this.array)},i.title="browser",i.browser=!0,i.env={},i.argv=[],i.version="",i.versions={},i.on=g,i.addListener=g,i.once=g,i.off=g,i.removeListener=g,i.removeAllListeners=g,i.emit=g,i.prependListener=g,i.prependOnceListener=g,i.listeners=function(t){return[]},i.binding=function(t){throw new Error("process.binding is not supported")},i.cwd=function(){return"/"},i.chdir=function(t){throw new Error("process.chdir is not supported")},i.umask=function(){return 0}},function(t,e,n){"use strict";(function(t){
-/*!
- * The buffer module from node.js, for the browser.
- *
- * @author Feross Aboukhadijeh <http://feross.org>
- * @license MIT
- */
-var r=n(421),i=n(422),a=n(191);function o(){return u.TYPED_ARRAY_SUPPORT?2147483647:1073741823}function s(t,e){if(o()<e)throw new RangeError("Invalid typed array length");return u.TYPED_ARRAY_SUPPORT?(t=new Uint8Array(e)).__proto__=u.prototype:(null===t&&(t=new u(e)),t.length=e),t}function u(t,e,n){if(!(u.TYPED_ARRAY_SUPPORT||this instanceof u))return new u(t,e,n);if("number"==typeof t){if("string"==typeof e)throw new Error("If encoding is specified then the first argument must be a string");return l(this,t)}return c(this,t,e,n)}function c(t,e,n,r){if("number"==typeof e)throw new TypeError('"value" argument must not be a number');return"undefined"!=typeof ArrayBuffer&&e instanceof ArrayBuffer?function(t,e,n,r){if(e.byteLength,n<0||e.byteLength<n)throw new RangeError("'offset' is out of bounds");if(e.byteLength<n+(r||0))throw new RangeError("'length' is out of bounds");e=void 0===n&&void 0===r?new Uint8Array(e):void 0===r?new Uint8Array(e,n):new Uint8Array(e,n,r);u.TYPED_ARRAY_SUPPORT?(t=e).__proto__=u.prototype:t=h(t,e);return t}(t,e,n,r):"string"==typeof e?function(t,e,n){"string"==typeof n&&""!==n||(n="utf8");if(!u.isEncoding(n))throw new TypeError('"encoding" must be a valid string encoding');var r=0|p(e,n),i=(t=s(t,r)).write(e,n);i!==r&&(t=t.slice(0,i));return t}(t,e,n):function(t,e){if(u.isBuffer(e)){var n=0|d(e.length);return 0===(t=s(t,n)).length?t:(e.copy(t,0,0,n),t)}if(e){if("undefined"!=typeof ArrayBuffer&&e.buffer instanceof ArrayBuffer||"length"in e)return"number"!=typeof e.length||(r=e.length)!=r?s(t,0):h(t,e);if("Buffer"===e.type&&a(e.data))return h(t,e.data)}var r;throw new TypeError("First argument must be a string, Buffer, ArrayBuffer, Array, or array-like object.")}(t,e)}function f(t){if("number"!=typeof t)throw new TypeError('"size" argument must be a number');if(t<0)throw new RangeError('"size" argument must not be negative')}function l(t,e){if(f(e),t=s(t,e<0?0:0|d(e)),!u.TYPED_ARRAY_SUPPORT)for(var n=0;n<e;++n)t[n]=0;return t}function h(t,e){var n=e.length<0?0:0|d(e.length);t=s(t,n);for(var r=0;r<n;r+=1)t[r]=255&e[r];return t}function d(t){if(t>=o())throw new RangeError("Attempt to allocate Buffer larger than maximum size: 0x"+o().toString(16)+" bytes");return 0|t}function p(t,e){if(u.isBuffer(t))return t.length;if("undefined"!=typeof ArrayBuffer&&"function"==typeof ArrayBuffer.isView&&(ArrayBuffer.isView(t)||t instanceof ArrayBuffer))return t.byteLength;"string"!=typeof t&&(t=""+t);var n=t.length;if(0===n)return 0;for(var r=!1;;)switch(e){case"ascii":case"latin1":case"binary":return n;case"utf8":case"utf-8":case void 0:return j(t).length;case"ucs2":case"ucs-2":case"utf16le":case"utf-16le":return 2*n;case"hex":return n>>>1;case"base64":return U(t).length;default:if(r)return j(t).length;e=(""+e).toLowerCase(),r=!0}}function g(t,e,n){var r=!1;if((void 0===e||e<0)&&(e=0),e>this.length)return"";if((void 0===n||n>this.length)&&(n=this.length),n<=0)return"";if((n>>>=0)<=(e>>>=0))return"";for(t||(t="utf8");;)switch(t){case"hex":return D(this,e,n);case"utf8":case"utf-8":return S(this,e,n);case"ascii":return M(this,e,n);case"latin1":case"binary":return T(this,e,n);case"base64":return A(this,e,n);case"ucs2":case"ucs-2":case"utf16le":case"utf-16le":return C(this,e,n);default:if(r)throw new TypeError("Unknown encoding: "+t);t=(t+"").toLowerCase(),r=!0}}function y(t,e,n){var r=t[e];t[e]=t[n],t[n]=r}function b(t,e,n,r,i){if(0===t.length)return-1;if("string"==typeof n?(r=n,n=0):n>2147483647?n=2147483647:n<-2147483648&&(n=-2147483648),n=+n,isNaN(n)&&(n=i?0:t.length-1),n<0&&(n=t.length+n),n>=t.length){if(i)return-1;n=t.length-1}else if(n<0){if(!i)return-1;n=0}if("string"==typeof e&&(e=u.from(e,r)),u.isBuffer(e))return 0===e.length?-1:v(t,e,n,r,i);if("number"==typeof e)return e&=255,u.TYPED_ARRAY_SUPPORT&&"function"==typeof Uint8Array.prototype.indexOf?i?Uint8Array.prototype.indexOf.call(t,e,n):Uint8Array.prototype.lastIndexOf.call(t,e,n):v(t,[e],n,r,i);throw new TypeError("val must be string, number or Buffer")}function v(t,e,n,r,i){var a,o=1,s=t.length,u=e.length;if(void 0!==r&&("ucs2"===(r=String(r).toLowerCase())||"ucs-2"===r||"utf16le"===r||"utf-16le"===r)){if(t.length<2||e.length<2)return-1;o=2,s/=2,u/=2,n/=2}function c(t,e){return 1===o?t[e]:t.readUInt16BE(e*o)}if(i){var f=-1;for(a=n;a<s;a++)if(c(t,a)===c(e,-1===f?0:a-f)){if(-1===f&&(f=a),a-f+1===u)return f*o}else-1!==f&&(a-=a-f),f=-1}else for(n+u>s&&(n=s-u),a=n;a>=0;a--){for(var l=!0,h=0;h<u;h++)if(c(t,a+h)!==c(e,h)){l=!1;break}if(l)return a}return-1}function m(t,e,n,r){n=Number(n)||0;var i=t.length-n;r?(r=Number(r))>i&&(r=i):r=i;var a=e.length;if(a%2!=0)throw new TypeError("Invalid hex string");r>a/2&&(r=a/2);for(var o=0;o<r;++o){var s=parseInt(e.substr(2*o,2),16);if(isNaN(s))return o;t[n+o]=s}return o}function _(t,e,n,r){return z(j(e,t.length-n),t,n,r)}function w(t,e,n,r){return z(function(t){for(var e=[],n=0;n<t.length;++n)e.push(255&t.charCodeAt(n));return e}(e),t,n,r)}function x(t,e,n,r){return w(t,e,n,r)}function k(t,e,n,r){return z(U(e),t,n,r)}function E(t,e,n,r){return z(function(t,e){for(var n,r,i,a=[],o=0;o<t.length&&!((e-=2)<0);++o)n=t.charCodeAt(o),r=n>>8,i=n%256,a.push(i),a.push(r);return a}(e,t.length-n),t,n,r)}function A(t,e,n){return 0===e&&n===t.length?r.fromByteArray(t):r.fromByteArray(t.slice(e,n))}function S(t,e,n){n=Math.min(t.length,n);for(var r=[],i=e;i<n;){var a,o,s,u,c=t[i],f=null,l=c>239?4:c>223?3:c>191?2:1;if(i+l<=n)switch(l){case 1:c<128&&(f=c);break;case 2:128==(192&(a=t[i+1]))&&(u=(31&c)<<6|63&a)>127&&(f=u);break;case 3:a=t[i+1],o=t[i+2],128==(192&a)&&128==(192&o)&&(u=(15&c)<<12|(63&a)<<6|63&o)>2047&&(u<55296||u>57343)&&(f=u);break;case 4:a=t[i+1],o=t[i+2],s=t[i+3],128==(192&a)&&128==(192&o)&&128==(192&s)&&(u=(15&c)<<18|(63&a)<<12|(63&o)<<6|63&s)>65535&&u<1114112&&(f=u)}null===f?(f=65533,l=1):f>65535&&(f-=65536,r.push(f>>>10&1023|55296),f=56320|1023&f),r.push(f),i+=l}return function(t){var e=t.length;if(e<=4096)return String.fromCharCode.apply(String,t);var n="",r=0;for(;r<e;)n+=String.fromCharCode.apply(String,t.slice(r,r+=4096));return n}(r)}e.Buffer=u,e.SlowBuffer=function(t){+t!=t&&(t=0);return u.alloc(+t)},e.INSPECT_MAX_BYTES=50,u.TYPED_ARRAY_SUPPORT=void 0!==t.TYPED_ARRAY_SUPPORT?t.TYPED_ARRAY_SUPPORT:function(){try{var t=new Uint8Array(1);return t.__proto__={__proto__:Uint8Array.prototype,foo:function(){return 42}},42===t.foo()&&"function"==typeof t.subarray&&0===t.subarray(1,1).byteLength}catch(t){return!1}}(),e.kMaxLength=o(),u.poolSize=8192,u._augment=function(t){return t.__proto__=u.prototype,t},u.from=function(t,e,n){return c(null,t,e,n)},u.TYPED_ARRAY_SUPPORT&&(u.prototype.__proto__=Uint8Array.prototype,u.__proto__=Uint8Array,"undefined"!=typeof Symbol&&Symbol.species&&u[Symbol.species]===u&&Object.defineProperty(u,Symbol.species,{value:null,configurable:!0})),u.alloc=function(t,e,n){return function(t,e,n,r){return f(e),e<=0?s(t,e):void 0!==n?"string"==typeof r?s(t,e).fill(n,r):s(t,e).fill(n):s(t,e)}(null,t,e,n)},u.allocUnsafe=function(t){return l(null,t)},u.allocUnsafeSlow=function(t){return l(null,t)},u.isBuffer=function(t){return!(null==t||!t._isBuffer)},u.compare=function(t,e){if(!u.isBuffer(t)||!u.isBuffer(e))throw new TypeError("Arguments must be Buffers");if(t===e)return 0;for(var n=t.length,r=e.length,i=0,a=Math.min(n,r);i<a;++i)if(t[i]!==e[i]){n=t[i],r=e[i];break}return n<r?-1:r<n?1:0},u.isEncoding=function(t){switch(String(t).toLowerCase()){case"hex":case"utf8":case"utf-8":case"ascii":case"latin1":case"binary":case"base64":case"ucs2":case"ucs-2":case"utf16le":case"utf-16le":return!0;default:return!1}},u.concat=function(t,e){if(!a(t))throw new TypeError('"list" argument must be an Array of Buffers');if(0===t.length)return u.alloc(0);var n;if(void 0===e)for(e=0,n=0;n<t.length;++n)e+=t[n].length;var r=u.allocUnsafe(e),i=0;for(n=0;n<t.length;++n){var o=t[n];if(!u.isBuffer(o))throw new TypeError('"list" argument must be an Array of Buffers');o.copy(r,i),i+=o.length}return r},u.byteLength=p,u.prototype._isBuffer=!0,u.prototype.swap16=function(){var t=this.length;if(t%2!=0)throw new RangeError("Buffer size must be a multiple of 16-bits");for(var e=0;e<t;e+=2)y(this,e,e+1);return this},u.prototype.swap32=function(){var t=this.length;if(t%4!=0)throw new RangeError("Buffer size must be a multiple of 32-bits");for(var e=0;e<t;e+=4)y(this,e,e+3),y(this,e+1,e+2);return this},u.prototype.swap64=function(){var t=this.length;if(t%8!=0)throw new RangeError("Buffer size must be a multiple of 64-bits");for(var e=0;e<t;e+=8)y(this,e,e+7),y(this,e+1,e+6),y(this,e+2,e+5),y(this,e+3,e+4);return this},u.prototype.toString=function(){var t=0|this.length;return 0===t?"":0===arguments.length?S(this,0,t):g.apply(this,arguments)},u.prototype.equals=function(t){if(!u.isBuffer(t))throw new TypeError("Argument must be a Buffer");return this===t||0===u.compare(this,t)},u.prototype.inspect=function(){var t="",n=e.INSPECT_MAX_BYTES;return this.length>0&&(t=this.toString("hex",0,n).match(/.{2}/g).join(" "),this.length>n&&(t+=" ... ")),"<Buffer "+t+">"},u.prototype.compare=function(t,e,n,r,i){if(!u.isBuffer(t))throw new TypeError("Argument must be a Buffer");if(void 0===e&&(e=0),void 0===n&&(n=t?t.length:0),void 0===r&&(r=0),void 0===i&&(i=this.length),e<0||n>t.length||r<0||i>this.length)throw new RangeError("out of range index");if(r>=i&&e>=n)return 0;if(r>=i)return-1;if(e>=n)return 1;if(this===t)return 0;for(var a=(i>>>=0)-(r>>>=0),o=(n>>>=0)-(e>>>=0),s=Math.min(a,o),c=this.slice(r,i),f=t.slice(e,n),l=0;l<s;++l)if(c[l]!==f[l]){a=c[l],o=f[l];break}return a<o?-1:o<a?1:0},u.prototype.includes=function(t,e,n){return-1!==this.indexOf(t,e,n)},u.prototype.indexOf=function(t,e,n){return b(this,t,e,n,!0)},u.prototype.lastIndexOf=function(t,e,n){return b(this,t,e,n,!1)},u.prototype.write=function(t,e,n,r){if(void 0===e)r="utf8",n=this.length,e=0;else if(void 0===n&&"string"==typeof e)r=e,n=this.length,e=0;else{if(!isFinite(e))throw new Error("Buffer.write(string, encoding, offset[, length]) is no longer supported");e|=0,isFinite(n)?(n|=0,void 0===r&&(r="utf8")):(r=n,n=void 0)}var i=this.length-e;if((void 0===n||n>i)&&(n=i),t.length>0&&(n<0||e<0)||e>this.length)throw new RangeError("Attempt to write outside buffer bounds");r||(r="utf8");for(var a=!1;;)switch(r){case"hex":return m(this,t,e,n);case"utf8":case"utf-8":return _(this,t,e,n);case"ascii":return w(this,t,e,n);case"latin1":case"binary":return x(this,t,e,n);case"base64":return k(this,t,e,n);case"ucs2":case"ucs-2":case"utf16le":case"utf-16le":return E(this,t,e,n);default:if(a)throw new TypeError("Unknown encoding: "+r);r=(""+r).toLowerCase(),a=!0}},u.prototype.toJSON=function(){return{type:"Buffer",data:Array.prototype.slice.call(this._arr||this,0)}};function M(t,e,n){var r="";n=Math.min(t.length,n);for(var i=e;i<n;++i)r+=String.fromCharCode(127&t[i]);return r}function T(t,e,n){var r="";n=Math.min(t.length,n);for(var i=e;i<n;++i)r+=String.fromCharCode(t[i]);return r}function D(t,e,n){var r=t.length;(!e||e<0)&&(e=0),(!n||n<0||n>r)&&(n=r);for(var i="",a=e;a<n;++a)i+=q(t[a]);return i}function C(t,e,n){for(var r=t.slice(e,n),i="",a=0;a<r.length;a+=2)i+=String.fromCharCode(r[a]+256*r[a+1]);return i}function N(t,e,n){if(t%1!=0||t<0)throw new RangeError("offset is not uint");if(t+e>n)throw new RangeError("Trying to access beyond buffer length")}function I(t,e,n,r,i,a){if(!u.isBuffer(t))throw new TypeError('"buffer" argument must be a Buffer instance');if(e>i||e<a)throw new RangeError('"value" argument is out of bounds');if(n+r>t.length)throw new RangeError("Index out of range")}function L(t,e,n,r){e<0&&(e=65535+e+1);for(var i=0,a=Math.min(t.length-n,2);i<a;++i)t[n+i]=(e&255<<8*(r?i:1-i))>>>8*(r?i:1-i)}function B(t,e,n,r){e<0&&(e=4294967295+e+1);for(var i=0,a=Math.min(t.length-n,4);i<a;++i)t[n+i]=e>>>8*(r?i:3-i)&255}function O(t,e,n,r,i,a){if(n+r>t.length)throw new RangeError("Index out of range");if(n<0)throw new RangeError("Index out of range")}function R(t,e,n,r,a){return a||O(t,0,n,4),i.write(t,e,n,r,23,4),n+4}function P(t,e,n,r,a){return a||O(t,0,n,8),i.write(t,e,n,r,52,8),n+8}u.prototype.slice=function(t,e){var n,r=this.length;if((t=~~t)<0?(t+=r)<0&&(t=0):t>r&&(t=r),(e=void 0===e?r:~~e)<0?(e+=r)<0&&(e=0):e>r&&(e=r),e<t&&(e=t),u.TYPED_ARRAY_SUPPORT)(n=this.subarray(t,e)).__proto__=u.prototype;else{var i=e-t;n=new u(i,void 0);for(var a=0;a<i;++a)n[a]=this[a+t]}return n},u.prototype.readUIntLE=function(t,e,n){t|=0,e|=0,n||N(t,e,this.length);for(var r=this[t],i=1,a=0;++a<e&&(i*=256);)r+=this[t+a]*i;return r},u.prototype.readUIntBE=function(t,e,n){t|=0,e|=0,n||N(t,e,this.length);for(var r=this[t+--e],i=1;e>0&&(i*=256);)r+=this[t+--e]*i;return r},u.prototype.readUInt8=function(t,e){return e||N(t,1,this.length),this[t]},u.prototype.readUInt16LE=function(t,e){return e||N(t,2,this.length),this[t]|this[t+1]<<8},u.prototype.readUInt16BE=function(t,e){return e||N(t,2,this.length),this[t]<<8|this[t+1]},u.prototype.readUInt32LE=function(t,e){return e||N(t,4,this.length),(this[t]|this[t+1]<<8|this[t+2]<<16)+16777216*this[t+3]},u.prototype.readUInt32BE=function(t,e){return e||N(t,4,this.length),16777216*this[t]+(this[t+1]<<16|this[t+2]<<8|this[t+3])},u.prototype.readIntLE=function(t,e,n){t|=0,e|=0,n||N(t,e,this.length);for(var r=this[t],i=1,a=0;++a<e&&(i*=256);)r+=this[t+a]*i;return r>=(i*=128)&&(r-=Math.pow(2,8*e)),r},u.prototype.readIntBE=function(t,e,n){t|=0,e|=0,n||N(t,e,this.length);for(var r=e,i=1,a=this[t+--r];r>0&&(i*=256);)a+=this[t+--r]*i;return a>=(i*=128)&&(a-=Math.pow(2,8*e)),a},u.prototype.readInt8=function(t,e){return e||N(t,1,this.length),128&this[t]?-1*(255-this[t]+1):this[t]},u.prototype.readInt16LE=function(t,e){e||N(t,2,this.length);var n=this[t]|this[t+1]<<8;return 32768&n?4294901760|n:n},u.prototype.readInt16BE=function(t,e){e||N(t,2,this.length);var n=this[t+1]|this[t]<<8;return 32768&n?4294901760|n:n},u.prototype.readInt32LE=function(t,e){return e||N(t,4,this.length),this[t]|this[t+1]<<8|this[t+2]<<16|this[t+3]<<24},u.prototype.readInt32BE=function(t,e){return e||N(t,4,this.length),this[t]<<24|this[t+1]<<16|this[t+2]<<8|this[t+3]},u.prototype.readFloatLE=function(t,e){return e||N(t,4,this.length),i.read(this,t,!0,23,4)},u.prototype.readFloatBE=function(t,e){return e||N(t,4,this.length),i.read(this,t,!1,23,4)},u.prototype.readDoubleLE=function(t,e){return e||N(t,8,this.length),i.read(this,t,!0,52,8)},u.prototype.readDoubleBE=function(t,e){return e||N(t,8,this.length),i.read(this,t,!1,52,8)},u.prototype.writeUIntLE=function(t,e,n,r){(t=+t,e|=0,n|=0,r)||I(this,t,e,n,Math.pow(2,8*n)-1,0);var i=1,a=0;for(this[e]=255&t;++a<n&&(i*=256);)this[e+a]=t/i&255;return e+n},u.prototype.writeUIntBE=function(t,e,n,r){(t=+t,e|=0,n|=0,r)||I(this,t,e,n,Math.pow(2,8*n)-1,0);var i=n-1,a=1;for(this[e+i]=255&t;--i>=0&&(a*=256);)this[e+i]=t/a&255;return e+n},u.prototype.writeUInt8=function(t,e,n){return t=+t,e|=0,n||I(this,t,e,1,255,0),u.TYPED_ARRAY_SUPPORT||(t=Math.floor(t)),this[e]=255&t,e+1},u.prototype.writeUInt16LE=function(t,e,n){return t=+t,e|=0,n||I(this,t,e,2,65535,0),u.TYPED_ARRAY_SUPPORT?(this[e]=255&t,this[e+1]=t>>>8):L(this,t,e,!0),e+2},u.prototype.writeUInt16BE=function(t,e,n){return t=+t,e|=0,n||I(this,t,e,2,65535,0),u.TYPED_ARRAY_SUPPORT?(this[e]=t>>>8,this[e+1]=255&t):L(this,t,e,!1),e+2},u.prototype.writeUInt32LE=function(t,e,n){return t=+t,e|=0,n||I(this,t,e,4,4294967295,0),u.TYPED_ARRAY_SUPPORT?(this[e+3]=t>>>24,this[e+2]=t>>>16,this[e+1]=t>>>8,this[e]=255&t):B(this,t,e,!0),e+4},u.prototype.writeUInt32BE=function(t,e,n){return t=+t,e|=0,n||I(this,t,e,4,4294967295,0),u.TYPED_ARRAY_SUPPORT?(this[e]=t>>>24,this[e+1]=t>>>16,this[e+2]=t>>>8,this[e+3]=255&t):B(this,t,e,!1),e+4},u.prototype.writeIntLE=function(t,e,n,r){if(t=+t,e|=0,!r){var i=Math.pow(2,8*n-1);I(this,t,e,n,i-1,-i)}var a=0,o=1,s=0;for(this[e]=255&t;++a<n&&(o*=256);)t<0&&0===s&&0!==this[e+a-1]&&(s=1),this[e+a]=(t/o>>0)-s&255;return e+n},u.prototype.writeIntBE=function(t,e,n,r){if(t=+t,e|=0,!r){var i=Math.pow(2,8*n-1);I(this,t,e,n,i-1,-i)}var a=n-1,o=1,s=0;for(this[e+a]=255&t;--a>=0&&(o*=256);)t<0&&0===s&&0!==this[e+a+1]&&(s=1),this[e+a]=(t/o>>0)-s&255;return e+n},u.prototype.writeInt8=function(t,e,n){return t=+t,e|=0,n||I(this,t,e,1,127,-128),u.TYPED_ARRAY_SUPPORT||(t=Math.floor(t)),t<0&&(t=255+t+1),this[e]=255&t,e+1},u.prototype.writeInt16LE=function(t,e,n){return t=+t,e|=0,n||I(this,t,e,2,32767,-32768),u.TYPED_ARRAY_SUPPORT?(this[e]=255&t,this[e+1]=t>>>8):L(this,t,e,!0),e+2},u.prototype.writeInt16BE=function(t,e,n){return t=+t,e|=0,n||I(this,t,e,2,32767,-32768),u.TYPED_ARRAY_SUPPORT?(this[e]=t>>>8,this[e+1]=255&t):L(this,t,e,!1),e+2},u.prototype.writeInt32LE=function(t,e,n){return t=+t,e|=0,n||I(this,t,e,4,2147483647,-2147483648),u.TYPED_ARRAY_SUPPORT?(this[e]=255&t,this[e+1]=t>>>8,this[e+2]=t>>>16,this[e+3]=t>>>24):B(this,t,e,!0),e+4},u.prototype.writeInt32BE=function(t,e,n){return t=+t,e|=0,n||I(this,t,e,4,2147483647,-2147483648),t<0&&(t=4294967295+t+1),u.TYPED_ARRAY_SUPPORT?(this[e]=t>>>24,this[e+1]=t>>>16,this[e+2]=t>>>8,this[e+3]=255&t):B(this,t,e,!1),e+4},u.prototype.writeFloatLE=function(t,e,n){return R(this,t,e,!0,n)},u.prototype.writeFloatBE=function(t,e,n){return R(this,t,e,!1,n)},u.prototype.writeDoubleLE=function(t,e,n){return P(this,t,e,!0,n)},u.prototype.writeDoubleBE=function(t,e,n){return P(this,t,e,!1,n)},u.prototype.copy=function(t,e,n,r){if(n||(n=0),r||0===r||(r=this.length),e>=t.length&&(e=t.length),e||(e=0),r>0&&r<n&&(r=n),r===n)return 0;if(0===t.length||0===this.length)return 0;if(e<0)throw new RangeError("targetStart out of bounds");if(n<0||n>=this.length)throw new RangeError("sourceStart out of bounds");if(r<0)throw new RangeError("sourceEnd out of bounds");r>this.length&&(r=this.length),t.length-e<r-n&&(r=t.length-e+n);var i,a=r-n;if(this===t&&n<e&&e<r)for(i=a-1;i>=0;--i)t[i+e]=this[i+n];else if(a<1e3||!u.TYPED_ARRAY_SUPPORT)for(i=0;i<a;++i)t[i+e]=this[i+n];else Uint8Array.prototype.set.call(t,this.subarray(n,n+a),e);return a},u.prototype.fill=function(t,e,n,r){if("string"==typeof t){if("string"==typeof e?(r=e,e=0,n=this.length):"string"==typeof n&&(r=n,n=this.length),1===t.length){var i=t.charCodeAt(0);i<256&&(t=i)}if(void 0!==r&&"string"!=typeof r)throw new TypeError("encoding must be a string");if("string"==typeof r&&!u.isEncoding(r))throw new TypeError("Unknown encoding: "+r)}else"number"==typeof t&&(t&=255);if(e<0||this.length<e||this.length<n)throw new RangeError("Out of range index");if(n<=e)return this;var a;if(e>>>=0,n=void 0===n?this.length:n>>>0,t||(t=0),"number"==typeof t)for(a=e;a<n;++a)this[a]=t;else{var o=u.isBuffer(t)?t:j(new u(t,r).toString()),s=o.length;for(a=0;a<n-e;++a)this[a+e]=o[a%s]}return this};var F=/[^+\/0-9A-Za-z-_]/g;function q(t){return t<16?"0"+t.toString(16):t.toString(16)}function j(t,e){var n;e=e||1/0;for(var r=t.length,i=null,a=[],o=0;o<r;++o){if((n=t.charCodeAt(o))>55295&&n<57344){if(!i){if(n>56319){(e-=3)>-1&&a.push(239,191,189);continue}if(o+1===r){(e-=3)>-1&&a.push(239,191,189);continue}i=n;continue}if(n<56320){(e-=3)>-1&&a.push(239,191,189),i=n;continue}n=65536+(i-55296<<10|n-56320)}else i&&(e-=3)>-1&&a.push(239,191,189);if(i=null,n<128){if((e-=1)<0)break;a.push(n)}else if(n<2048){if((e-=2)<0)break;a.push(n>>6|192,63&n|128)}else if(n<65536){if((e-=3)<0)break;a.push(n>>12|224,n>>6&63|128,63&n|128)}else{if(!(n<1114112))throw new Error("Invalid code point");if((e-=4)<0)break;a.push(n>>18|240,n>>12&63|128,n>>6&63|128,63&n|128)}}return a}function U(t){return r.toByteArray(function(t){if((t=function(t){return t.trim?t.trim():t.replace(/^\s+|\s+$/g,"")}(t).replace(F,"")).length<2)return"";for(;t.length%4!=0;)t+="=";return t}(t))}function z(t,e,n,r){for(var i=0;i<r&&!(i+n>=e.length||i>=t.length);++i)e[i+n]=t[i];return i}}).call(this,n(12))},function(t,e){t.exports=function(t){return t.webpackPolyfill||(t.deprecate=function(){},t.paths=[],t.children||(t.children=[]),Object.defineProperty(t,"loaded",{enumerable:!0,get:function(){return t.l}}),Object.defineProperty(t,"id",{enumerable:!0,get:function(){return t.i}}),t.webpackPolyfill=1),t}},function(t,e,n){"use strict";var r=n(4),i=n(19).Graph;function a(t,e,n,i){var a;do{a=r.uniqueId(i)}while(t.hasNode(a));return n.dummy=e,t.setNode(a,n),a}function o(t){return r.max(r.map(t.nodes(),(function(e){var n=t.node(e).rank;if(!r.isUndefined(n))return n})))}t.exports={addDummyNode:a,simplify:function(t){var e=(new i).setGraph(t.graph());return r.forEach(t.nodes(),(function(n){e.setNode(n,t.node(n))})),r.forEach(t.edges(),(function(n){var r=e.edge(n.v,n.w)||{weight:0,minlen:1},i=t.edge(n);e.setEdge(n.v,n.w,{weight:r.weight+i.weight,minlen:Math.max(r.minlen,i.minlen)})})),e},asNonCompoundGraph:function(t){var e=new i({multigraph:t.isMultigraph()}).setGraph(t.graph());return r.forEach(t.nodes(),(function(n){t.children(n).length||e.setNode(n,t.node(n))})),r.forEach(t.edges(),(function(n){e.setEdge(n,t.edge(n))})),e},successorWeights:function(t){var e=r.map(t.nodes(),(function(e){var n={};return r.forEach(t.outEdges(e),(function(e){n[e.w]=(n[e.w]||0)+t.edge(e).weight})),n}));return r.zipObject(t.nodes(),e)},predecessorWeights:function(t){var e=r.map(t.nodes(),(function(e){var n={};return r.forEach(t.inEdges(e),(function(e){n[e.v]=(n[e.v]||0)+t.edge(e).weight})),n}));return r.zipObject(t.nodes(),e)},intersectRect:function(t,e){var n,r,i=t.x,a=t.y,o=e.x-i,s=e.y-a,u=t.width/2,c=t.height/2;if(!o&&!s)throw new Error("Not possible to find intersection inside of the rectangle");Math.abs(s)*u>Math.abs(o)*c?(s<0&&(c=-c),n=c*o/s,r=c):(o<0&&(u=-u),n=u,r=u*s/o);return{x:i+n,y:a+r}},buildLayerMatrix:function(t){var e=r.map(r.range(o(t)+1),(function(){return[]}));return r.forEach(t.nodes(),(function(n){var i=t.node(n),a=i.rank;r.isUndefined(a)||(e[a][i.order]=n)})),e},normalizeRanks:function(t){var e=r.min(r.map(t.nodes(),(function(e){return t.node(e).rank})));r.forEach(t.nodes(),(function(n){var i=t.node(n);r.has(i,"rank")&&(i.rank-=e)}))},removeEmptyRanks:function(t){var e=r.min(r.map(t.nodes(),(function(e){return t.node(e).rank}))),n=[];r.forEach(t.nodes(),(function(r){var i=t.node(r).rank-e;n[i]||(n[i]=[]),n[i].push(r)}));var i=0,a=t.graph().nodeRankFactor;r.forEach(n,(function(e,n){r.isUndefined(e)&&n%a!=0?--i:i&&r.forEach(e,(function(e){t.node(e).rank+=i}))}))},addBorderNode:function(t,e,n,r){var i={width:0,height:0};arguments.length>=4&&(i.rank=n,i.order=r);return a(t,"border",i,e)},maxRank:o,partition:function(t,e){var n={lhs:[],rhs:[]};return r.forEach(t,(function(t){e(t)?n.lhs.push(t):n.rhs.push(t)})),n},time:function(t,e){var n=r.now();try{return e()}finally{console.log(t+" time: "+(r.now()-n)+"ms")}},notime:function(t,e){return e()}}},function(t,e,n){
+!function(t,e){"object"==typeof exports&&"object"==typeof module?module.exports=e():"function"==typeof define&&define.amd?define([],e):"object"==typeof exports?exports.mermaid=e():t.mermaid=e()}("undefined"!=typeof self?self:this,(function(){return function(t){var e={};function n(r){if(e[r])return e[r].exports;var i=e[r]={i:r,l:!1,exports:{}};return t[r].call(i.exports,i,i.exports,n),i.l=!0,i.exports}return n.m=t,n.c=e,n.d=function(t,e,r){n.o(t,e)||Object.defineProperty(t,e,{enumerable:!0,get:r})},n.r=function(t){"undefined"!=typeof Symbol&&Symbol.toStringTag&&Object.defineProperty(t,Symbol.toStringTag,{value:"Module"}),Object.defineProperty(t,"__esModule",{value:!0})},n.t=function(t,e){if(1&e&&(t=n(t)),8&e)return t;if(4&e&&"object"==typeof t&&t&&t.__esModule)return t;var r=Object.create(null);if(n.r(r),Object.defineProperty(r,"default",{enumerable:!0,value:t}),2&e&&"string"!=typeof t)for(var i in t)n.d(r,i,function(e){return t[e]}.bind(null,i));return r},n.n=function(t){var e=t&&t.__esModule?function(){return t.default}:function(){return t};return n.d(e,"a",e),e},n.o=function(t,e){return Object.prototype.hasOwnProperty.call(t,e)},n.p="",n(n.s=383)}([function(t,e,n){"use strict";n.r(e);var r=function(t,e){return t<e?-1:t>e?1:t>=e?0:NaN},i=function(t){var e;return 1===t.length&&(e=t,t=function(t,n){return r(e(t),n)}),{left:function(e,n,r,i){for(null==r&&(r=0),null==i&&(i=e.length);r<i;){var a=r+i>>>1;t(e[a],n)<0?r=a+1:i=a}return r},right:function(e,n,r,i){for(null==r&&(r=0),null==i&&(i=e.length);r<i;){var a=r+i>>>1;t(e[a],n)>0?i=a:r=a+1}return r}}};var a=i(r),o=a.right,s=a.left,c=o,u=function(t,e){null==e&&(e=l);for(var n=0,r=t.length-1,i=t[0],a=new Array(r<0?0:r);n<r;)a[n]=e(i,i=t[++n]);return a};function l(t,e){return[t,e]}var h=function(t,e,n){var r,i,a,o,s=t.length,c=e.length,u=new Array(s*c);for(null==n&&(n=l),r=a=0;r<s;++r)for(o=t[r],i=0;i<c;++i,++a)u[a]=n(o,e[i]);return u},f=function(t,e){return e<t?-1:e>t?1:e>=t?0:NaN},d=function(t){return null===t?NaN:+t},p=function(t,e){var n,r,i=t.length,a=0,o=-1,s=0,c=0;if(null==e)for(;++o<i;)isNaN(n=d(t[o]))||(c+=(r=n-s)*(n-(s+=r/++a)));else for(;++o<i;)isNaN(n=d(e(t[o],o,t)))||(c+=(r=n-s)*(n-(s+=r/++a)));if(a>1)return c/(a-1)},g=function(t,e){var n=p(t,e);return n?Math.sqrt(n):n},y=function(t,e){var n,r,i,a=t.length,o=-1;if(null==e){for(;++o<a;)if(null!=(n=t[o])&&n>=n)for(r=i=n;++o<a;)null!=(n=t[o])&&(r>n&&(r=n),i<n&&(i=n))}else for(;++o<a;)if(null!=(n=e(t[o],o,t))&&n>=n)for(r=i=n;++o<a;)null!=(n=e(t[o],o,t))&&(r>n&&(r=n),i<n&&(i=n));return[r,i]},v=Array.prototype,m=v.slice,b=v.map,x=function(t){return function(){return t}},_=function(t){return t},k=function(t,e,n){t=+t,e=+e,n=(i=arguments.length)<2?(e=t,t=0,1):i<3?1:+n;for(var r=-1,i=0|Math.max(0,Math.ceil((e-t)/n)),a=new Array(i);++r<i;)a[r]=t+r*n;return a},w=Math.sqrt(50),E=Math.sqrt(10),T=Math.sqrt(2),C=function(t,e,n){var r,i,a,o,s=-1;if(n=+n,(t=+t)===(e=+e)&&n>0)return[t];if((r=e<t)&&(i=t,t=e,e=i),0===(o=A(t,e,n))||!isFinite(o))return[];if(o>0)for(t=Math.ceil(t/o),e=Math.floor(e/o),a=new Array(i=Math.ceil(e-t+1));++s<i;)a[s]=(t+s)*o;else for(t=Math.floor(t*o),e=Math.ceil(e*o),a=new Array(i=Math.ceil(t-e+1));++s<i;)a[s]=(t-s)/o;return r&&a.reverse(),a};function A(t,e,n){var r=(e-t)/Math.max(0,n),i=Math.floor(Math.log(r)/Math.LN10),a=r/Math.pow(10,i);return i>=0?(a>=w?10:a>=E?5:a>=T?2:1)*Math.pow(10,i):-Math.pow(10,-i)/(a>=w?10:a>=E?5:a>=T?2:1)}function S(t,e,n){var r=Math.abs(e-t)/Math.max(0,n),i=Math.pow(10,Math.floor(Math.log(r)/Math.LN10)),a=r/i;return a>=w?i*=10:a>=E?i*=5:a>=T&&(i*=2),e<t?-i:i}var M=function(t){return Math.ceil(Math.log(t.length)/Math.LN2)+1},O=function(){var t=_,e=y,n=M;function r(r){var i,a,o=r.length,s=new Array(o);for(i=0;i<o;++i)s[i]=t(r[i],i,r);var u=e(s),l=u[0],h=u[1],f=n(s,l,h);Array.isArray(f)||(f=S(l,h,f),f=k(Math.ceil(l/f)*f,h,f));for(var d=f.length;f[0]<=l;)f.shift(),--d;for(;f[d-1]>h;)f.pop(),--d;var p,g=new Array(d+1);for(i=0;i<=d;++i)(p=g[i]=[]).x0=i>0?f[i-1]:l,p.x1=i<d?f[i]:h;for(i=0;i<o;++i)l<=(a=s[i])&&a<=h&&g[c(f,a,0,d)].push(r[i]);return g}return r.value=function(e){return arguments.length?(t="function"==typeof e?e:x(e),r):t},r.domain=function(t){return arguments.length?(e="function"==typeof t?t:x([t[0],t[1]]),r):e},r.thresholds=function(t){return arguments.length?(n="function"==typeof t?t:Array.isArray(t)?x(m.call(t)):x(t),r):n},r},D=function(t,e,n){if(null==n&&(n=d),r=t.length){if((e=+e)<=0||r<2)return+n(t[0],0,t);if(e>=1)return+n(t[r-1],r-1,t);var r,i=(r-1)*e,a=Math.floor(i),o=+n(t[a],a,t);return o+(+n(t[a+1],a+1,t)-o)*(i-a)}},N=function(t,e,n){return t=b.call(t,d).sort(r),Math.ceil((n-e)/(2*(D(t,.75)-D(t,.25))*Math.pow(t.length,-1/3)))},B=function(t,e,n){return Math.ceil((n-e)/(3.5*g(t)*Math.pow(t.length,-1/3)))},L=function(t,e){var n,r,i=t.length,a=-1;if(null==e){for(;++a<i;)if(null!=(n=t[a])&&n>=n)for(r=n;++a<i;)null!=(n=t[a])&&n>r&&(r=n)}else for(;++a<i;)if(null!=(n=e(t[a],a,t))&&n>=n)for(r=n;++a<i;)null!=(n=e(t[a],a,t))&&n>r&&(r=n);return r},P=function(t,e){var n,r=t.length,i=r,a=-1,o=0;if(null==e)for(;++a<r;)isNaN(n=d(t[a]))?--i:o+=n;else for(;++a<r;)isNaN(n=d(e(t[a],a,t)))?--i:o+=n;if(i)return o/i},I=function(t,e){var n,i=t.length,a=-1,o=[];if(null==e)for(;++a<i;)isNaN(n=d(t[a]))||o.push(n);else for(;++a<i;)isNaN(n=d(e(t[a],a,t)))||o.push(n);return D(o.sort(r),.5)},F=function(t){for(var e,n,r,i=t.length,a=-1,o=0;++a<i;)o+=t[a].length;for(n=new Array(o);--i>=0;)for(e=(r=t[i]).length;--e>=0;)n[--o]=r[e];return n},j=function(t,e){var n,r,i=t.length,a=-1;if(null==e){for(;++a<i;)if(null!=(n=t[a])&&n>=n)for(r=n;++a<i;)null!=(n=t[a])&&r>n&&(r=n)}else for(;++a<i;)if(null!=(n=e(t[a],a,t))&&n>=n)for(r=n;++a<i;)null!=(n=e(t[a],a,t))&&r>n&&(r=n);return r},R=function(t,e){for(var n=e.length,r=new Array(n);n--;)r[n]=t[e[n]];return r},Y=function(t,e){if(n=t.length){var n,i,a=0,o=0,s=t[o];for(null==e&&(e=r);++a<n;)(e(i=t[a],s)<0||0!==e(s,s))&&(s=i,o=a);return 0===e(s,s)?o:void 0}},z=function(t,e,n){for(var r,i,a=(null==n?t.length:n)-(e=null==e?0:+e);a;)i=Math.random()*a--|0,r=t[a+e],t[a+e]=t[i+e],t[i+e]=r;return t},U=function(t,e){var n,r=t.length,i=-1,a=0;if(null==e)for(;++i<r;)(n=+t[i])&&(a+=n);else for(;++i<r;)(n=+e(t[i],i,t))&&(a+=n);return a},$=function(t){if(!(i=t.length))return[];for(var e=-1,n=j(t,W),r=new Array(n);++e<n;)for(var i,a=-1,o=r[e]=new Array(i);++a<i;)o[a]=t[a][e];return r};function W(t){return t.length}var H=function(){return $(arguments)},V=Array.prototype.slice,G=function(t){return t};function q(t){return"translate("+(t+.5)+",0)"}function X(t){return"translate(0,"+(t+.5)+")"}function Z(t){return function(e){return+t(e)}}function J(t){var e=Math.max(0,t.bandwidth()-1)/2;return t.round()&&(e=Math.round(e)),function(n){return+t(n)+e}}function K(){return!this.__axis}function Q(t,e){var n=[],r=null,i=null,a=6,o=6,s=3,c=1===t||4===t?-1:1,u=4===t||2===t?"x":"y",l=1===t||3===t?q:X;function h(h){var f=null==r?e.ticks?e.ticks.apply(e,n):e.domain():r,d=null==i?e.tickFormat?e.tickFormat.apply(e,n):G:i,p=Math.max(a,0)+s,g=e.range(),y=+g[0]+.5,v=+g[g.length-1]+.5,m=(e.bandwidth?J:Z)(e.copy()),b=h.selection?h.selection():h,x=b.selectAll(".domain").data([null]),_=b.selectAll(".tick").data(f,e).order(),k=_.exit(),w=_.enter().append("g").attr("class","tick"),E=_.select("line"),T=_.select("text");x=x.merge(x.enter().insert("path",".tick").attr("class","domain").attr("stroke","currentColor")),_=_.merge(w),E=E.merge(w.append("line").attr("stroke","currentColor").attr(u+"2",c*a)),T=T.merge(w.append("text").attr("fill","currentColor").attr(u,c*p).attr("dy",1===t?"0em":3===t?"0.71em":"0.32em")),h!==b&&(x=x.transition(h),_=_.transition(h),E=E.transition(h),T=T.transition(h),k=k.transition(h).attr("opacity",1e-6).attr("transform",(function(t){return isFinite(t=m(t))?l(t):this.getAttribute("transform")})),w.attr("opacity",1e-6).attr("transform",(function(t){var e=this.parentNode.__axis;return l(e&&isFinite(e=e(t))?e:m(t))}))),k.remove(),x.attr("d",4===t||2==t?o?"M"+c*o+","+y+"H0.5V"+v+"H"+c*o:"M0.5,"+y+"V"+v:o?"M"+y+","+c*o+"V0.5H"+v+"V"+c*o:"M"+y+",0.5H"+v),_.attr("opacity",1).attr("transform",(function(t){return l(m(t))})),E.attr(u+"2",c*a),T.attr(u,c*p).text(d),b.filter(K).attr("fill","none").attr("font-size",10).attr("font-family","sans-serif").attr("text-anchor",2===t?"start":4===t?"end":"middle"),b.each((function(){this.__axis=m}))}return h.scale=function(t){return arguments.length?(e=t,h):e},h.ticks=function(){return n=V.call(arguments),h},h.tickArguments=function(t){return arguments.length?(n=null==t?[]:V.call(t),h):n.slice()},h.tickValues=function(t){return arguments.length?(r=null==t?null:V.call(t),h):r&&r.slice()},h.tickFormat=function(t){return arguments.length?(i=t,h):i},h.tickSize=function(t){return arguments.length?(a=o=+t,h):a},h.tickSizeInner=function(t){return arguments.length?(a=+t,h):a},h.tickSizeOuter=function(t){return arguments.length?(o=+t,h):o},h.tickPadding=function(t){return arguments.length?(s=+t,h):s},h}function tt(t){return Q(1,t)}function et(t){return Q(2,t)}function nt(t){return Q(3,t)}function rt(t){return Q(4,t)}var it={value:function(){}};function at(){for(var t,e=0,n=arguments.length,r={};e<n;++e){if(!(t=arguments[e]+"")||t in r||/[\s.]/.test(t))throw new Error("illegal type: "+t);r[t]=[]}return new ot(r)}function ot(t){this._=t}function st(t,e){return t.trim().split(/^|\s+/).map((function(t){var n="",r=t.indexOf(".");if(r>=0&&(n=t.slice(r+1),t=t.slice(0,r)),t&&!e.hasOwnProperty(t))throw new Error("unknown type: "+t);return{type:t,name:n}}))}function ct(t,e){for(var n,r=0,i=t.length;r<i;++r)if((n=t[r]).name===e)return n.value}function ut(t,e,n){for(var r=0,i=t.length;r<i;++r)if(t[r].name===e){t[r]=it,t=t.slice(0,r).concat(t.slice(r+1));break}return null!=n&&t.push({name:e,value:n}),t}ot.prototype=at.prototype={constructor:ot,on:function(t,e){var n,r=this._,i=st(t+"",r),a=-1,o=i.length;if(!(arguments.length<2)){if(null!=e&&"function"!=typeof e)throw new Error("invalid callback: "+e);for(;++a<o;)if(n=(t=i[a]).type)r[n]=ut(r[n],t.name,e);else if(null==e)for(n in r)r[n]=ut(r[n],t.name,null);return this}for(;++a<o;)if((n=(t=i[a]).type)&&(n=ct(r[n],t.name)))return n},copy:function(){var t={},e=this._;for(var n in e)t[n]=e[n].slice();return new ot(t)},call:function(t,e){if((n=arguments.length-2)>0)for(var n,r,i=new Array(n),a=0;a<n;++a)i[a]=arguments[a+2];if(!this._.hasOwnProperty(t))throw new Error("unknown type: "+t);for(a=0,n=(r=this._[t]).length;a<n;++a)r[a].value.apply(e,i)},apply:function(t,e,n){if(!this._.hasOwnProperty(t))throw new Error("unknown type: "+t);for(var r=this._[t],i=0,a=r.length;i<a;++i)r[i].value.apply(e,n)}};var lt=at;function ht(){}var ft=function(t){return null==t?ht:function(){return this.querySelector(t)}};function dt(){return[]}var pt=function(t){return null==t?dt:function(){return this.querySelectorAll(t)}},gt=function(t){return function(){return this.matches(t)}},yt=function(t){return new Array(t.length)};function vt(t,e){this.ownerDocument=t.ownerDocument,this.namespaceURI=t.namespaceURI,this._next=null,this._parent=t,this.__data__=e}vt.prototype={constructor:vt,appendChild:function(t){return this._parent.insertBefore(t,this._next)},insertBefore:function(t,e){return this._parent.insertBefore(t,e)},querySelector:function(t){return this._parent.querySelector(t)},querySelectorAll:function(t){return this._parent.querySelectorAll(t)}};function mt(t,e,n,r,i,a){for(var o,s=0,c=e.length,u=a.length;s<u;++s)(o=e[s])?(o.__data__=a[s],r[s]=o):n[s]=new vt(t,a[s]);for(;s<c;++s)(o=e[s])&&(i[s]=o)}function bt(t,e,n,r,i,a,o){var s,c,u,l={},h=e.length,f=a.length,d=new Array(h);for(s=0;s<h;++s)(c=e[s])&&(d[s]=u="$"+o.call(c,c.__data__,s,e),u in l?i[s]=c:l[u]=c);for(s=0;s<f;++s)(c=l[u="$"+o.call(t,a[s],s,a)])?(r[s]=c,c.__data__=a[s],l[u]=null):n[s]=new vt(t,a[s]);for(s=0;s<h;++s)(c=e[s])&&l[d[s]]===c&&(i[s]=c)}function xt(t,e){return t<e?-1:t>e?1:t>=e?0:NaN}var _t="http://www.w3.org/1999/xhtml",kt={svg:"http://www.w3.org/2000/svg",xhtml:_t,xlink:"http://www.w3.org/1999/xlink",xml:"http://www.w3.org/XML/1998/namespace",xmlns:"http://www.w3.org/2000/xmlns/"},wt=function(t){var e=t+="",n=e.indexOf(":");return n>=0&&"xmlns"!==(e=t.slice(0,n))&&(t=t.slice(n+1)),kt.hasOwnProperty(e)?{space:kt[e],local:t}:t};function Et(t){return function(){this.removeAttribute(t)}}function Tt(t){return function(){this.removeAttributeNS(t.space,t.local)}}function Ct(t,e){return function(){this.setAttribute(t,e)}}function At(t,e){return function(){this.setAttributeNS(t.space,t.local,e)}}function St(t,e){return function(){var n=e.apply(this,arguments);null==n?this.removeAttribute(t):this.setAttribute(t,n)}}function Mt(t,e){return function(){var n=e.apply(this,arguments);null==n?this.removeAttributeNS(t.space,t.local):this.setAttributeNS(t.space,t.local,n)}}var Ot=function(t){return t.ownerDocument&&t.ownerDocument.defaultView||t.document&&t||t.defaultView};function Dt(t){return function(){this.style.removeProperty(t)}}function Nt(t,e,n){return function(){this.style.setProperty(t,e,n)}}function Bt(t,e,n){return function(){var r=e.apply(this,arguments);null==r?this.style.removeProperty(t):this.style.setProperty(t,r,n)}}function Lt(t,e){return t.style.getPropertyValue(e)||Ot(t).getComputedStyle(t,null).getPropertyValue(e)}function Pt(t){return function(){delete this[t]}}function It(t,e){return function(){this[t]=e}}function Ft(t,e){return function(){var n=e.apply(this,arguments);null==n?delete this[t]:this[t]=n}}function jt(t){return t.trim().split(/^|\s+/)}function Rt(t){return t.classList||new Yt(t)}function Yt(t){this._node=t,this._names=jt(t.getAttribute("class")||"")}function zt(t,e){for(var n=Rt(t),r=-1,i=e.length;++r<i;)n.add(e[r])}function Ut(t,e){for(var n=Rt(t),r=-1,i=e.length;++r<i;)n.remove(e[r])}function $t(t){return function(){zt(this,t)}}function Wt(t){return function(){Ut(this,t)}}function Ht(t,e){return function(){(e.apply(this,arguments)?zt:Ut)(this,t)}}Yt.prototype={add:function(t){this._names.indexOf(t)<0&&(this._names.push(t),this._node.setAttribute("class",this._names.join(" ")))},remove:function(t){var e=this._names.indexOf(t);e>=0&&(this._names.splice(e,1),this._node.setAttribute("class",this._names.join(" ")))},contains:function(t){return this._names.indexOf(t)>=0}};function Vt(){this.textContent=""}function Gt(t){return function(){this.textContent=t}}function qt(t){return function(){var e=t.apply(this,arguments);this.textContent=null==e?"":e}}function Xt(){this.innerHTML=""}function Zt(t){return function(){this.innerHTML=t}}function Jt(t){return function(){var e=t.apply(this,arguments);this.innerHTML=null==e?"":e}}function Kt(){this.nextSibling&&this.parentNode.appendChild(this)}function Qt(){this.previousSibling&&this.parentNode.insertBefore(this,this.parentNode.firstChild)}function te(t){return function(){var e=this.ownerDocument,n=this.namespaceURI;return n===_t&&e.documentElement.namespaceURI===_t?e.createElement(t):e.createElementNS(n,t)}}function ee(t){return function(){return this.ownerDocument.createElementNS(t.space,t.local)}}var ne=function(t){var e=wt(t);return(e.local?ee:te)(e)};function re(){return null}function ie(){var t=this.parentNode;t&&t.removeChild(this)}function ae(){var t=this.cloneNode(!1),e=this.parentNode;return e?e.insertBefore(t,this.nextSibling):t}function oe(){var t=this.cloneNode(!0),e=this.parentNode;return e?e.insertBefore(t,this.nextSibling):t}var se={},ce=null;"undefined"!=typeof document&&("onmouseenter"in document.documentElement||(se={mouseenter:"mouseover",mouseleave:"mouseout"}));function ue(t,e,n){return t=le(t,e,n),function(e){var n=e.relatedTarget;n&&(n===this||8&n.compareDocumentPosition(this))||t.call(this,e)}}function le(t,e,n){return function(r){var i=ce;ce=r;try{t.call(this,this.__data__,e,n)}finally{ce=i}}}function he(t){return t.trim().split(/^|\s+/).map((function(t){var e="",n=t.indexOf(".");return n>=0&&(e=t.slice(n+1),t=t.slice(0,n)),{type:t,name:e}}))}function fe(t){return function(){var e=this.__on;if(e){for(var n,r=0,i=-1,a=e.length;r<a;++r)n=e[r],t.type&&n.type!==t.type||n.name!==t.name?e[++i]=n:this.removeEventListener(n.type,n.listener,n.capture);++i?e.length=i:delete this.__on}}}function de(t,e,n){var r=se.hasOwnProperty(t.type)?ue:le;return function(i,a,o){var s,c=this.__on,u=r(e,a,o);if(c)for(var l=0,h=c.length;l<h;++l)if((s=c[l]).type===t.type&&s.name===t.name)return this.removeEventListener(s.type,s.listener,s.capture),this.addEventListener(s.type,s.listener=u,s.capture=n),void(s.value=e);this.addEventListener(t.type,u,n),s={type:t.type,name:t.name,value:e,listener:u,capture:n},c?c.push(s):this.__on=[s]}}function pe(t,e,n,r){var i=ce;t.sourceEvent=ce,ce=t;try{return e.apply(n,r)}finally{ce=i}}function ge(t,e,n){var r=Ot(t),i=r.CustomEvent;"function"==typeof i?i=new i(e,n):(i=r.document.createEvent("Event"),n?(i.initEvent(e,n.bubbles,n.cancelable),i.detail=n.detail):i.initEvent(e,!1,!1)),t.dispatchEvent(i)}function ye(t,e){return function(){return ge(this,t,e)}}function ve(t,e){return function(){return ge(this,t,e.apply(this,arguments))}}var me=[null];function be(t,e){this._groups=t,this._parents=e}function xe(){return new be([[document.documentElement]],me)}be.prototype=xe.prototype={constructor:be,select:function(t){"function"!=typeof t&&(t=ft(t));for(var e=this._groups,n=e.length,r=new Array(n),i=0;i<n;++i)for(var a,o,s=e[i],c=s.length,u=r[i]=new Array(c),l=0;l<c;++l)(a=s[l])&&(o=t.call(a,a.__data__,l,s))&&("__data__"in a&&(o.__data__=a.__data__),u[l]=o);return new be(r,this._parents)},selectAll:function(t){"function"!=typeof t&&(t=pt(t));for(var e=this._groups,n=e.length,r=[],i=[],a=0;a<n;++a)for(var o,s=e[a],c=s.length,u=0;u<c;++u)(o=s[u])&&(r.push(t.call(o,o.__data__,u,s)),i.push(o));return new be(r,i)},filter:function(t){"function"!=typeof t&&(t=gt(t));for(var e=this._groups,n=e.length,r=new Array(n),i=0;i<n;++i)for(var a,o=e[i],s=o.length,c=r[i]=[],u=0;u<s;++u)(a=o[u])&&t.call(a,a.__data__,u,o)&&c.push(a);return new be(r,this._parents)},data:function(t,e){if(!t)return p=new Array(this.size()),l=-1,this.each((function(t){p[++l]=t})),p;var n,r=e?bt:mt,i=this._parents,a=this._groups;"function"!=typeof t&&(n=t,t=function(){return n});for(var o=a.length,s=new Array(o),c=new Array(o),u=new Array(o),l=0;l<o;++l){var h=i[l],f=a[l],d=f.length,p=t.call(h,h&&h.__data__,l,i),g=p.length,y=c[l]=new Array(g),v=s[l]=new Array(g);r(h,f,y,v,u[l]=new Array(d),p,e);for(var m,b,x=0,_=0;x<g;++x)if(m=y[x]){for(x>=_&&(_=x+1);!(b=v[_])&&++_<g;);m._next=b||null}}return(s=new be(s,i))._enter=c,s._exit=u,s},enter:function(){return new be(this._enter||this._groups.map(yt),this._parents)},exit:function(){return new be(this._exit||this._groups.map(yt),this._parents)},join:function(t,e,n){var r=this.enter(),i=this,a=this.exit();return r="function"==typeof t?t(r):r.append(t+""),null!=e&&(i=e(i)),null==n?a.remove():n(a),r&&i?r.merge(i).order():i},merge:function(t){for(var e=this._groups,n=t._groups,r=e.length,i=n.length,a=Math.min(r,i),o=new Array(r),s=0;s<a;++s)for(var c,u=e[s],l=n[s],h=u.length,f=o[s]=new Array(h),d=0;d<h;++d)(c=u[d]||l[d])&&(f[d]=c);for(;s<r;++s)o[s]=e[s];return new be(o,this._parents)},order:function(){for(var t=this._groups,e=-1,n=t.length;++e<n;)for(var r,i=t[e],a=i.length-1,o=i[a];--a>=0;)(r=i[a])&&(o&&4^r.compareDocumentPosition(o)&&o.parentNode.insertBefore(r,o),o=r);return this},sort:function(t){function e(e,n){return e&&n?t(e.__data__,n.__data__):!e-!n}t||(t=xt);for(var n=this._groups,r=n.length,i=new Array(r),a=0;a<r;++a){for(var o,s=n[a],c=s.length,u=i[a]=new Array(c),l=0;l<c;++l)(o=s[l])&&(u[l]=o);u.sort(e)}return new be(i,this._parents).order()},call:function(){var t=arguments[0];return arguments[0]=this,t.apply(null,arguments),this},nodes:function(){var t=new Array(this.size()),e=-1;return this.each((function(){t[++e]=this})),t},node:function(){for(var t=this._groups,e=0,n=t.length;e<n;++e)for(var r=t[e],i=0,a=r.length;i<a;++i){var o=r[i];if(o)return o}return null},size:function(){var t=0;return this.each((function(){++t})),t},empty:function(){return!this.node()},each:function(t){for(var e=this._groups,n=0,r=e.length;n<r;++n)for(var i,a=e[n],o=0,s=a.length;o<s;++o)(i=a[o])&&t.call(i,i.__data__,o,a);return this},attr:function(t,e){var n=wt(t);if(arguments.length<2){var r=this.node();return n.local?r.getAttributeNS(n.space,n.local):r.getAttribute(n)}return this.each((null==e?n.local?Tt:Et:"function"==typeof e?n.local?Mt:St:n.local?At:Ct)(n,e))},style:function(t,e,n){return arguments.length>1?this.each((null==e?Dt:"function"==typeof e?Bt:Nt)(t,e,null==n?"":n)):Lt(this.node(),t)},property:function(t,e){return arguments.length>1?this.each((null==e?Pt:"function"==typeof e?Ft:It)(t,e)):this.node()[t]},classed:function(t,e){var n=jt(t+"");if(arguments.length<2){for(var r=Rt(this.node()),i=-1,a=n.length;++i<a;)if(!r.contains(n[i]))return!1;return!0}return this.each(("function"==typeof e?Ht:e?$t:Wt)(n,e))},text:function(t){return arguments.length?this.each(null==t?Vt:("function"==typeof t?qt:Gt)(t)):this.node().textContent},html:function(t){return arguments.length?this.each(null==t?Xt:("function"==typeof t?Jt:Zt)(t)):this.node().innerHTML},raise:function(){return this.each(Kt)},lower:function(){return this.each(Qt)},append:function(t){var e="function"==typeof t?t:ne(t);return this.select((function(){return this.appendChild(e.apply(this,arguments))}))},insert:function(t,e){var n="function"==typeof t?t:ne(t),r=null==e?re:"function"==typeof e?e:ft(e);return this.select((function(){return this.insertBefore(n.apply(this,arguments),r.apply(this,arguments)||null)}))},remove:function(){return this.each(ie)},clone:function(t){return this.select(t?oe:ae)},datum:function(t){return arguments.length?this.property("__data__",t):this.node().__data__},on:function(t,e,n){var r,i,a=he(t+""),o=a.length;if(!(arguments.length<2)){for(s=e?de:fe,null==n&&(n=!1),r=0;r<o;++r)this.each(s(a[r],e,n));return this}var s=this.node().__on;if(s)for(var c,u=0,l=s.length;u<l;++u)for(r=0,c=s[u];r<o;++r)if((i=a[r]).type===c.type&&i.name===c.name)return c.value},dispatch:function(t,e){return this.each(("function"==typeof e?ve:ye)(t,e))}};var _e=xe,ke=function(t){return"string"==typeof t?new be([[document.querySelector(t)]],[document.documentElement]):new be([[t]],me)};function we(){ce.stopImmediatePropagation()}var Ee=function(){ce.preventDefault(),ce.stopImmediatePropagation()},Te=function(t){var e=t.document.documentElement,n=ke(t).on("dragstart.drag",Ee,!0);"onselectstart"in e?n.on("selectstart.drag",Ee,!0):(e.__noselect=e.style.MozUserSelect,e.style.MozUserSelect="none")};function Ce(t,e){var n=t.document.documentElement,r=ke(t).on("dragstart.drag",null);e&&(r.on("click.drag",Ee,!0),setTimeout((function(){r.on("click.drag",null)}),0)),"onselectstart"in n?r.on("selectstart.drag",null):(n.style.MozUserSelect=n.__noselect,delete n.__noselect)}var Ae=function(t,e,n){t.prototype=e.prototype=n,n.constructor=t};function Se(t,e){var n=Object.create(t.prototype);for(var r in e)n[r]=e[r];return n}function Me(){}var Oe="\\s*([+-]?\\d+)\\s*",De="\\s*([+-]?\\d*\\.?\\d+(?:[eE][+-]?\\d+)?)\\s*",Ne="\\s*([+-]?\\d*\\.?\\d+(?:[eE][+-]?\\d+)?)%\\s*",Be=/^#([0-9a-f]{3,8})$/,Le=new RegExp("^rgb\\("+[Oe,Oe,Oe]+"\\)$"),Pe=new RegExp("^rgb\\("+[Ne,Ne,Ne]+"\\)$"),Ie=new RegExp("^rgba\\("+[Oe,Oe,Oe,De]+"\\)$"),Fe=new RegExp("^rgba\\("+[Ne,Ne,Ne,De]+"\\)$"),je=new RegExp("^hsl\\("+[De,Ne,Ne]+"\\)$"),Re=new RegExp("^hsla\\("+[De,Ne,Ne,De]+"\\)$"),Ye={aliceblue:15792383,antiquewhite:16444375,aqua:65535,aquamarine:8388564,azure:15794175,beige:16119260,bisque:16770244,black:0,blanchedalmond:16772045,blue:255,blueviolet:9055202,brown:10824234,burlywood:14596231,cadetblue:6266528,chartreuse:8388352,chocolate:13789470,coral:16744272,cornflowerblue:6591981,cornsilk:16775388,crimson:14423100,cyan:65535,darkblue:139,darkcyan:35723,darkgoldenrod:12092939,darkgray:11119017,darkgreen:25600,darkgrey:11119017,darkkhaki:12433259,darkmagenta:9109643,darkolivegreen:5597999,darkorange:16747520,darkorchid:10040012,darkred:9109504,darksalmon:15308410,darkseagreen:9419919,darkslateblue:4734347,darkslategray:3100495,darkslategrey:3100495,darkturquoise:52945,darkviolet:9699539,deeppink:16716947,deepskyblue:49151,dimgray:6908265,dimgrey:6908265,dodgerblue:2003199,firebrick:11674146,floralwhite:16775920,forestgreen:2263842,fuchsia:16711935,gainsboro:14474460,ghostwhite:16316671,gold:16766720,goldenrod:14329120,gray:8421504,green:32768,greenyellow:11403055,grey:8421504,honeydew:15794160,hotpink:16738740,indianred:13458524,indigo:4915330,ivory:16777200,khaki:15787660,lavender:15132410,lavenderblush:16773365,lawngreen:8190976,lemonchiffon:16775885,lightblue:11393254,lightcoral:15761536,lightcyan:14745599,lightgoldenrodyellow:16448210,lightgray:13882323,lightgreen:9498256,lightgrey:13882323,lightpink:16758465,lightsalmon:16752762,lightseagreen:2142890,lightskyblue:8900346,lightslategray:7833753,lightslategrey:7833753,lightsteelblue:11584734,lightyellow:16777184,lime:65280,limegreen:3329330,linen:16445670,magenta:16711935,maroon:8388608,mediumaquamarine:6737322,mediumblue:205,mediumorchid:12211667,mediumpurple:9662683,mediumseagreen:3978097,mediumslateblue:8087790,mediumspringgreen:64154,mediumturquoise:4772300,mediumvioletred:13047173,midnightblue:1644912,mintcream:16121850,mistyrose:16770273,moccasin:16770229,navajowhite:16768685,navy:128,oldlace:16643558,olive:8421376,olivedrab:7048739,orange:16753920,orangered:16729344,orchid:14315734,palegoldenrod:15657130,palegreen:10025880,paleturquoise:11529966,palevioletred:14381203,papayawhip:16773077,peachpuff:16767673,peru:13468991,pink:16761035,plum:14524637,powderblue:11591910,purple:8388736,rebeccapurple:6697881,red:16711680,rosybrown:12357519,royalblue:4286945,saddlebrown:9127187,salmon:16416882,sandybrown:16032864,seagreen:3050327,seashell:16774638,sienna:10506797,silver:12632256,skyblue:8900331,slateblue:6970061,slategray:7372944,slategrey:7372944,snow:16775930,springgreen:65407,steelblue:4620980,tan:13808780,teal:32896,thistle:14204888,tomato:16737095,turquoise:4251856,violet:15631086,wheat:16113331,white:16777215,whitesmoke:16119285,yellow:16776960,yellowgreen:10145074};function ze(){return this.rgb().formatHex()}function Ue(){return this.rgb().formatRgb()}function $e(t){var e,n;return t=(t+"").trim().toLowerCase(),(e=Be.exec(t))?(n=e[1].length,e=parseInt(e[1],16),6===n?We(e):3===n?new qe(e>>8&15|e>>4&240,e>>4&15|240&e,(15&e)<<4|15&e,1):8===n?new qe(e>>24&255,e>>16&255,e>>8&255,(255&e)/255):4===n?new qe(e>>12&15|e>>8&240,e>>8&15|e>>4&240,e>>4&15|240&e,((15&e)<<4|15&e)/255):null):(e=Le.exec(t))?new qe(e[1],e[2],e[3],1):(e=Pe.exec(t))?new qe(255*e[1]/100,255*e[2]/100,255*e[3]/100,1):(e=Ie.exec(t))?He(e[1],e[2],e[3],e[4]):(e=Fe.exec(t))?He(255*e[1]/100,255*e[2]/100,255*e[3]/100,e[4]):(e=je.exec(t))?Ke(e[1],e[2]/100,e[3]/100,1):(e=Re.exec(t))?Ke(e[1],e[2]/100,e[3]/100,e[4]):Ye.hasOwnProperty(t)?We(Ye[t]):"transparent"===t?new qe(NaN,NaN,NaN,0):null}function We(t){return new qe(t>>16&255,t>>8&255,255&t,1)}function He(t,e,n,r){return r<=0&&(t=e=n=NaN),new qe(t,e,n,r)}function Ve(t){return t instanceof Me||(t=$e(t)),t?new qe((t=t.rgb()).r,t.g,t.b,t.opacity):new qe}function Ge(t,e,n,r){return 1===arguments.length?Ve(t):new qe(t,e,n,null==r?1:r)}function qe(t,e,n,r){this.r=+t,this.g=+e,this.b=+n,this.opacity=+r}function Xe(){return"#"+Je(this.r)+Je(this.g)+Je(this.b)}function Ze(){var t=this.opacity;return(1===(t=isNaN(t)?1:Math.max(0,Math.min(1,t)))?"rgb(":"rgba(")+Math.max(0,Math.min(255,Math.round(this.r)||0))+", "+Math.max(0,Math.min(255,Math.round(this.g)||0))+", "+Math.max(0,Math.min(255,Math.round(this.b)||0))+(1===t?")":", "+t+")")}function Je(t){return((t=Math.max(0,Math.min(255,Math.round(t)||0)))<16?"0":"")+t.toString(16)}function Ke(t,e,n,r){return r<=0?t=e=n=NaN:n<=0||n>=1?t=e=NaN:e<=0&&(t=NaN),new en(t,e,n,r)}function Qe(t){if(t instanceof en)return new en(t.h,t.s,t.l,t.opacity);if(t instanceof Me||(t=$e(t)),!t)return new en;if(t instanceof en)return t;var e=(t=t.rgb()).r/255,n=t.g/255,r=t.b/255,i=Math.min(e,n,r),a=Math.max(e,n,r),o=NaN,s=a-i,c=(a+i)/2;return s?(o=e===a?(n-r)/s+6*(n<r):n===a?(r-e)/s+2:(e-n)/s+4,s/=c<.5?a+i:2-a-i,o*=60):s=c>0&&c<1?0:o,new en(o,s,c,t.opacity)}function tn(t,e,n,r){return 1===arguments.length?Qe(t):new en(t,e,n,null==r?1:r)}function en(t,e,n,r){this.h=+t,this.s=+e,this.l=+n,this.opacity=+r}function nn(t,e,n){return 255*(t<60?e+(n-e)*t/60:t<180?n:t<240?e+(n-e)*(240-t)/60:e)}function rn(t,e,n,r,i){var a=t*t,o=a*t;return((1-3*t+3*a-o)*e+(4-6*a+3*o)*n+(1+3*t+3*a-3*o)*r+o*i)/6}Ae(Me,$e,{copy:function(t){return Object.assign(new this.constructor,this,t)},displayable:function(){return this.rgb().displayable()},hex:ze,formatHex:ze,formatHsl:function(){return Qe(this).formatHsl()},formatRgb:Ue,toString:Ue}),Ae(qe,Ge,Se(Me,{brighter:function(t){return t=null==t?1/.7:Math.pow(1/.7,t),new qe(this.r*t,this.g*t,this.b*t,this.opacity)},darker:function(t){return t=null==t?.7:Math.pow(.7,t),new qe(this.r*t,this.g*t,this.b*t,this.opacity)},rgb:function(){return this},displayable:function(){return-.5<=this.r&&this.r<255.5&&-.5<=this.g&&this.g<255.5&&-.5<=this.b&&this.b<255.5&&0<=this.opacity&&this.opacity<=1},hex:Xe,formatHex:Xe,formatRgb:Ze,toString:Ze})),Ae(en,tn,Se(Me,{brighter:function(t){return t=null==t?1/.7:Math.pow(1/.7,t),new en(this.h,this.s,this.l*t,this.opacity)},darker:function(t){return t=null==t?.7:Math.pow(.7,t),new en(this.h,this.s,this.l*t,this.opacity)},rgb:function(){var t=this.h%360+360*(this.h<0),e=isNaN(t)||isNaN(this.s)?0:this.s,n=this.l,r=n+(n<.5?n:1-n)*e,i=2*n-r;return new qe(nn(t>=240?t-240:t+120,i,r),nn(t,i,r),nn(t<120?t+240:t-120,i,r),this.opacity)},displayable:function(){return(0<=this.s&&this.s<=1||isNaN(this.s))&&0<=this.l&&this.l<=1&&0<=this.opacity&&this.opacity<=1},formatHsl:function(){var t=this.opacity;return(1===(t=isNaN(t)?1:Math.max(0,Math.min(1,t)))?"hsl(":"hsla(")+(this.h||0)+", "+100*(this.s||0)+"%, "+100*(this.l||0)+"%"+(1===t?")":", "+t+")")}}));var an=function(t){var e=t.length-1;return function(n){var r=n<=0?n=0:n>=1?(n=1,e-1):Math.floor(n*e),i=t[r],a=t[r+1],o=r>0?t[r-1]:2*i-a,s=r<e-1?t[r+2]:2*a-i;return rn((n-r/e)*e,o,i,a,s)}},on=function(t){var e=t.length;return function(n){var r=Math.floor(((n%=1)<0?++n:n)*e),i=t[(r+e-1)%e],a=t[r%e],o=t[(r+1)%e],s=t[(r+2)%e];return rn((n-r/e)*e,i,a,o,s)}},sn=function(t){return function(){return t}};function cn(t,e){return function(n){return t+n*e}}function un(t,e){var n=e-t;return n?cn(t,n>180||n<-180?n-360*Math.round(n/360):n):sn(isNaN(t)?e:t)}function ln(t){return 1==(t=+t)?hn:function(e,n){return n-e?function(t,e,n){return t=Math.pow(t,n),e=Math.pow(e,n)-t,n=1/n,function(r){return Math.pow(t+r*e,n)}}(e,n,t):sn(isNaN(e)?n:e)}}function hn(t,e){var n=e-t;return n?cn(t,n):sn(isNaN(t)?e:t)}var fn=function t(e){var n=ln(e);function r(t,e){var r=n((t=Ge(t)).r,(e=Ge(e)).r),i=n(t.g,e.g),a=n(t.b,e.b),o=hn(t.opacity,e.opacity);return function(e){return t.r=r(e),t.g=i(e),t.b=a(e),t.opacity=o(e),t+""}}return r.gamma=t,r}(1);function dn(t){return function(e){var n,r,i=e.length,a=new Array(i),o=new Array(i),s=new Array(i);for(n=0;n<i;++n)r=Ge(e[n]),a[n]=r.r||0,o[n]=r.g||0,s[n]=r.b||0;return a=t(a),o=t(o),s=t(s),r.opacity=1,function(t){return r.r=a(t),r.g=o(t),r.b=s(t),r+""}}}var pn=dn(an),gn=dn(on),yn=function(t,e){e||(e=[]);var n,r=t?Math.min(e.length,t.length):0,i=e.slice();return function(a){for(n=0;n<r;++n)i[n]=t[n]*(1-a)+e[n]*a;return i}};function vn(t){return ArrayBuffer.isView(t)&&!(t instanceof DataView)}var mn=function(t,e){return(vn(e)?yn:bn)(t,e)};function bn(t,e){var n,r=e?e.length:0,i=t?Math.min(r,t.length):0,a=new Array(i),o=new Array(r);for(n=0;n<i;++n)a[n]=Sn(t[n],e[n]);for(;n<r;++n)o[n]=e[n];return function(t){for(n=0;n<i;++n)o[n]=a[n](t);return o}}var xn=function(t,e){var n=new Date;return t=+t,e=+e,function(r){return n.setTime(t*(1-r)+e*r),n}},_n=function(t,e){return t=+t,e=+e,function(n){return t*(1-n)+e*n}},kn=function(t,e){var n,r={},i={};for(n in null!==t&&"object"==typeof t||(t={}),null!==e&&"object"==typeof e||(e={}),e)n in t?r[n]=Sn(t[n],e[n]):i[n]=e[n];return function(t){for(n in r)i[n]=r[n](t);return i}},wn=/[-+]?(?:\d+\.?\d*|\.?\d+)(?:[eE][-+]?\d+)?/g,En=new RegExp(wn.source,"g");var Tn,Cn,An=function(t,e){var n,r,i,a=wn.lastIndex=En.lastIndex=0,o=-1,s=[],c=[];for(t+="",e+="";(n=wn.exec(t))&&(r=En.exec(e));)(i=r.index)>a&&(i=e.slice(a,i),s[o]?s[o]+=i:s[++o]=i),(n=n[0])===(r=r[0])?s[o]?s[o]+=r:s[++o]=r:(s[++o]=null,c.push({i:o,x:_n(n,r)})),a=En.lastIndex;return a<e.length&&(i=e.slice(a),s[o]?s[o]+=i:s[++o]=i),s.length<2?c[0]?function(t){return function(e){return t(e)+""}}(c[0].x):function(t){return function(){return t}}(e):(e=c.length,function(t){for(var n,r=0;r<e;++r)s[(n=c[r]).i]=n.x(t);return s.join("")})},Sn=function(t,e){var n,r=typeof e;return null==e||"boolean"===r?sn(e):("number"===r?_n:"string"===r?(n=$e(e))?(e=n,fn):An:e instanceof $e?fn:e instanceof Date?xn:vn(e)?yn:Array.isArray(e)?bn:"function"!=typeof e.valueOf&&"function"!=typeof e.toString||isNaN(e)?kn:_n)(t,e)},Mn=function(){for(var t,e=ce;t=e.sourceEvent;)e=t;return e},On=function(t,e){var n=t.ownerSVGElement||t;if(n.createSVGPoint){var r=n.createSVGPoint();return r.x=e.clientX,r.y=e.clientY,[(r=r.matrixTransform(t.getScreenCTM().inverse())).x,r.y]}var i=t.getBoundingClientRect();return[e.clientX-i.left-t.clientLeft,e.clientY-i.top-t.clientTop]},Dn=function(t,e,n){arguments.length<3&&(n=e,e=Mn().changedTouches);for(var r,i=0,a=e?e.length:0;i<a;++i)if((r=e[i]).identifier===n)return On(t,r);return null},Nn=function(t){var e=Mn();return e.changedTouches&&(e=e.changedTouches[0]),On(t,e)},Bn=0,Ln=0,Pn=0,In=0,Fn=0,jn=0,Rn="object"==typeof performance&&performance.now?performance:Date,Yn="object"==typeof window&&window.requestAnimationFrame?window.requestAnimationFrame.bind(window):function(t){setTimeout(t,17)};function zn(){return Fn||(Yn(Un),Fn=Rn.now()+jn)}function Un(){Fn=0}function $n(){this._call=this._time=this._next=null}function Wn(t,e,n){var r=new $n;return r.restart(t,e,n),r}function Hn(){zn(),++Bn;for(var t,e=Tn;e;)(t=Fn-e._time)>=0&&e._call.call(null,t),e=e._next;--Bn}function Vn(){Fn=(In=Rn.now())+jn,Bn=Ln=0;try{Hn()}finally{Bn=0,function(){var t,e,n=Tn,r=1/0;for(;n;)n._call?(r>n._time&&(r=n._time),t=n,n=n._next):(e=n._next,n._next=null,n=t?t._next=e:Tn=e);Cn=t,qn(r)}(),Fn=0}}function Gn(){var t=Rn.now(),e=t-In;e>1e3&&(jn-=e,In=t)}function qn(t){Bn||(Ln&&(Ln=clearTimeout(Ln)),t-Fn>24?(t<1/0&&(Ln=setTimeout(Vn,t-Rn.now()-jn)),Pn&&(Pn=clearInterval(Pn))):(Pn||(In=Rn.now(),Pn=setInterval(Gn,1e3)),Bn=1,Yn(Vn)))}$n.prototype=Wn.prototype={constructor:$n,restart:function(t,e,n){if("function"!=typeof t)throw new TypeError("callback is not a function");n=(null==n?zn():+n)+(null==e?0:+e),this._next||Cn===this||(Cn?Cn._next=this:Tn=this,Cn=this),this._call=t,this._time=n,qn()},stop:function(){this._call&&(this._call=null,this._time=1/0,qn())}};var Xn=function(t,e,n){var r=new $n;return e=null==e?0:+e,r.restart((function(n){r.stop(),t(n+e)}),e,n),r},Zn=lt("start","end","cancel","interrupt"),Jn=[],Kn=function(t,e,n,r,i,a){var o=t.__transition;if(o){if(n in o)return}else t.__transition={};!function(t,e,n){var r,i=t.__transition;function a(c){var u,l,h,f;if(1!==n.state)return s();for(u in i)if((f=i[u]).name===n.name){if(3===f.state)return Xn(a);4===f.state?(f.state=6,f.timer.stop(),f.on.call("interrupt",t,t.__data__,f.index,f.group),delete i[u]):+u<e&&(f.state=6,f.timer.stop(),f.on.call("cancel",t,t.__data__,f.index,f.group),delete i[u])}if(Xn((function(){3===n.state&&(n.state=4,n.timer.restart(o,n.delay,n.time),o(c))})),n.state=2,n.on.call("start",t,t.__data__,n.index,n.group),2===n.state){for(n.state=3,r=new Array(h=n.tween.length),u=0,l=-1;u<h;++u)(f=n.tween[u].value.call(t,t.__data__,n.index,n.group))&&(r[++l]=f);r.length=l+1}}function o(e){for(var i=e<n.duration?n.ease.call(null,e/n.duration):(n.timer.restart(s),n.state=5,1),a=-1,o=r.length;++a<o;)r[a].call(t,i);5===n.state&&(n.on.call("end",t,t.__data__,n.index,n.group),s())}function s(){for(var r in n.state=6,n.timer.stop(),delete i[e],i)return;delete t.__transition}i[e]=n,n.timer=Wn((function(t){n.state=1,n.timer.restart(a,n.delay,n.time),n.delay<=t&&a(t-n.delay)}),0,n.time)}(t,n,{name:e,index:r,group:i,on:Zn,tween:Jn,time:a.time,delay:a.delay,duration:a.duration,ease:a.ease,timer:null,state:0})};function Qn(t,e){var n=er(t,e);if(n.state>0)throw new Error("too late; already scheduled");return n}function tr(t,e){var n=er(t,e);if(n.state>3)throw new Error("too late; already running");return n}function er(t,e){var n=t.__transition;if(!n||!(n=n[e]))throw new Error("transition not found");return n}var nr,rr,ir,ar,or=function(t,e){var n,r,i,a=t.__transition,o=!0;if(a){for(i in e=null==e?null:e+"",a)(n=a[i]).name===e?(r=n.state>2&&n.state<5,n.state=6,n.timer.stop(),n.on.call(r?"interrupt":"cancel",t,t.__data__,n.index,n.group),delete a[i]):o=!1;o&&delete t.__transition}},sr=180/Math.PI,cr={translateX:0,translateY:0,rotate:0,skewX:0,scaleX:1,scaleY:1},ur=function(t,e,n,r,i,a){var o,s,c;return(o=Math.sqrt(t*t+e*e))&&(t/=o,e/=o),(c=t*n+e*r)&&(n-=t*c,r-=e*c),(s=Math.sqrt(n*n+r*r))&&(n/=s,r/=s,c/=s),t*r<e*n&&(t=-t,e=-e,c=-c,o=-o),{translateX:i,translateY:a,rotate:Math.atan2(e,t)*sr,skewX:Math.atan(c)*sr,scaleX:o,scaleY:s}};function lr(t,e,n,r){function i(t){return t.length?t.pop()+" ":""}return function(a,o){var s=[],c=[];return a=t(a),o=t(o),function(t,r,i,a,o,s){if(t!==i||r!==a){var c=o.push("translate(",null,e,null,n);s.push({i:c-4,x:_n(t,i)},{i:c-2,x:_n(r,a)})}else(i||a)&&o.push("translate("+i+e+a+n)}(a.translateX,a.translateY,o.translateX,o.translateY,s,c),function(t,e,n,a){t!==e?(t-e>180?e+=360:e-t>180&&(t+=360),a.push({i:n.push(i(n)+"rotate(",null,r)-2,x:_n(t,e)})):e&&n.push(i(n)+"rotate("+e+r)}(a.rotate,o.rotate,s,c),function(t,e,n,a){t!==e?a.push({i:n.push(i(n)+"skewX(",null,r)-2,x:_n(t,e)}):e&&n.push(i(n)+"skewX("+e+r)}(a.skewX,o.skewX,s,c),function(t,e,n,r,a,o){if(t!==n||e!==r){var s=a.push(i(a)+"scale(",null,",",null,")");o.push({i:s-4,x:_n(t,n)},{i:s-2,x:_n(e,r)})}else 1===n&&1===r||a.push(i(a)+"scale("+n+","+r+")")}(a.scaleX,a.scaleY,o.scaleX,o.scaleY,s,c),a=o=null,function(t){for(var e,n=-1,r=c.length;++n<r;)s[(e=c[n]).i]=e.x(t);return s.join("")}}}var hr=lr((function(t){return"none"===t?cr:(nr||(nr=document.createElement("DIV"),rr=document.documentElement,ir=document.defaultView),nr.style.transform=t,t=ir.getComputedStyle(rr.appendChild(nr),null).getPropertyValue("transform"),rr.removeChild(nr),t=t.slice(7,-1).split(","),ur(+t[0],+t[1],+t[2],+t[3],+t[4],+t[5]))}),"px, ","px)","deg)"),fr=lr((function(t){return null==t?cr:(ar||(ar=document.createElementNS("http://www.w3.org/2000/svg","g")),ar.setAttribute("transform",t),(t=ar.transform.baseVal.consolidate())?(t=t.matrix,ur(t.a,t.b,t.c,t.d,t.e,t.f)):cr)}),", ",")",")");function dr(t,e){var n,r;return function(){var i=tr(this,t),a=i.tween;if(a!==n)for(var o=0,s=(r=n=a).length;o<s;++o)if(r[o].name===e){(r=r.slice()).splice(o,1);break}i.tween=r}}function pr(t,e,n){var r,i;if("function"!=typeof n)throw new Error;return function(){var a=tr(this,t),o=a.tween;if(o!==r){i=(r=o).slice();for(var s={name:e,value:n},c=0,u=i.length;c<u;++c)if(i[c].name===e){i[c]=s;break}c===u&&i.push(s)}a.tween=i}}function gr(t,e,n){var r=t._id;return t.each((function(){var t=tr(this,r);(t.value||(t.value={}))[e]=n.apply(this,arguments)})),function(t){return er(t,r).value[e]}}var yr=function(t,e){var n;return("number"==typeof e?_n:e instanceof $e?fn:(n=$e(e))?(e=n,fn):An)(t,e)};function vr(t){return function(){this.removeAttribute(t)}}function mr(t){return function(){this.removeAttributeNS(t.space,t.local)}}function br(t,e,n){var r,i,a=n+"";return function(){var o=this.getAttribute(t);return o===a?null:o===r?i:i=e(r=o,n)}}function xr(t,e,n){var r,i,a=n+"";return function(){var o=this.getAttributeNS(t.space,t.local);return o===a?null:o===r?i:i=e(r=o,n)}}function _r(t,e,n){var r,i,a;return function(){var o,s,c=n(this);if(null!=c)return(o=this.getAttribute(t))===(s=c+"")?null:o===r&&s===i?a:(i=s,a=e(r=o,c));this.removeAttribute(t)}}function kr(t,e,n){var r,i,a;return function(){var o,s,c=n(this);if(null!=c)return(o=this.getAttributeNS(t.space,t.local))===(s=c+"")?null:o===r&&s===i?a:(i=s,a=e(r=o,c));this.removeAttributeNS(t.space,t.local)}}function wr(t,e){return function(n){this.setAttribute(t,e.call(this,n))}}function Er(t,e){return function(n){this.setAttributeNS(t.space,t.local,e.call(this,n))}}function Tr(t,e){var n,r;function i(){var i=e.apply(this,arguments);return i!==r&&(n=(r=i)&&Er(t,i)),n}return i._value=e,i}function Cr(t,e){var n,r;function i(){var i=e.apply(this,arguments);return i!==r&&(n=(r=i)&&wr(t,i)),n}return i._value=e,i}function Ar(t,e){return function(){Qn(this,t).delay=+e.apply(this,arguments)}}function Sr(t,e){return e=+e,function(){Qn(this,t).delay=e}}function Mr(t,e){return function(){tr(this,t).duration=+e.apply(this,arguments)}}function Or(t,e){return e=+e,function(){tr(this,t).duration=e}}function Dr(t,e){if("function"!=typeof e)throw new Error;return function(){tr(this,t).ease=e}}function Nr(t,e,n){var r,i,a=function(t){return(t+"").trim().split(/^|\s+/).every((function(t){var e=t.indexOf(".");return e>=0&&(t=t.slice(0,e)),!t||"start"===t}))}(e)?Qn:tr;return function(){var o=a(this,t),s=o.on;s!==r&&(i=(r=s).copy()).on(e,n),o.on=i}}var Br=_e.prototype.constructor;function Lr(t){return function(){this.style.removeProperty(t)}}function Pr(t,e,n){return function(r){this.style.setProperty(t,e.call(this,r),n)}}function Ir(t,e,n){var r,i;function a(){var a=e.apply(this,arguments);return a!==i&&(r=(i=a)&&Pr(t,a,n)),r}return a._value=e,a}function Fr(t){return function(e){this.textContent=t.call(this,e)}}function jr(t){var e,n;function r(){var r=t.apply(this,arguments);return r!==n&&(e=(n=r)&&Fr(r)),e}return r._value=t,r}var Rr=0;function Yr(t,e,n,r){this._groups=t,this._parents=e,this._name=n,this._id=r}function zr(t){return _e().transition(t)}function Ur(){return++Rr}var $r=_e.prototype;function Wr(t){return t*t*t}function Hr(t){return--t*t*t+1}function Vr(t){return((t*=2)<=1?t*t*t:(t-=2)*t*t+2)/2}Yr.prototype=zr.prototype={constructor:Yr,select:function(t){var e=this._name,n=this._id;"function"!=typeof t&&(t=ft(t));for(var r=this._groups,i=r.length,a=new Array(i),o=0;o<i;++o)for(var s,c,u=r[o],l=u.length,h=a[o]=new Array(l),f=0;f<l;++f)(s=u[f])&&(c=t.call(s,s.__data__,f,u))&&("__data__"in s&&(c.__data__=s.__data__),h[f]=c,Kn(h[f],e,n,f,h,er(s,n)));return new Yr(a,this._parents,e,n)},selectAll:function(t){var e=this._name,n=this._id;"function"!=typeof t&&(t=pt(t));for(var r=this._groups,i=r.length,a=[],o=[],s=0;s<i;++s)for(var c,u=r[s],l=u.length,h=0;h<l;++h)if(c=u[h]){for(var f,d=t.call(c,c.__data__,h,u),p=er(c,n),g=0,y=d.length;g<y;++g)(f=d[g])&&Kn(f,e,n,g,d,p);a.push(d),o.push(c)}return new Yr(a,o,e,n)},filter:function(t){"function"!=typeof t&&(t=gt(t));for(var e=this._groups,n=e.length,r=new Array(n),i=0;i<n;++i)for(var a,o=e[i],s=o.length,c=r[i]=[],u=0;u<s;++u)(a=o[u])&&t.call(a,a.__data__,u,o)&&c.push(a);return new Yr(r,this._parents,this._name,this._id)},merge:function(t){if(t._id!==this._id)throw new Error;for(var e=this._groups,n=t._groups,r=e.length,i=n.length,a=Math.min(r,i),o=new Array(r),s=0;s<a;++s)for(var c,u=e[s],l=n[s],h=u.length,f=o[s]=new Array(h),d=0;d<h;++d)(c=u[d]||l[d])&&(f[d]=c);for(;s<r;++s)o[s]=e[s];return new Yr(o,this._parents,this._name,this._id)},selection:function(){return new Br(this._groups,this._parents)},transition:function(){for(var t=this._name,e=this._id,n=Ur(),r=this._groups,i=r.length,a=0;a<i;++a)for(var o,s=r[a],c=s.length,u=0;u<c;++u)if(o=s[u]){var l=er(o,e);Kn(o,t,n,u,s,{time:l.time+l.delay+l.duration,delay:0,duration:l.duration,ease:l.ease})}return new Yr(r,this._parents,t,n)},call:$r.call,nodes:$r.nodes,node:$r.node,size:$r.size,empty:$r.empty,each:$r.each,on:function(t,e){var n=this._id;return arguments.length<2?er(this.node(),n).on.on(t):this.each(Nr(n,t,e))},attr:function(t,e){var n=wt(t),r="transform"===n?fr:yr;return this.attrTween(t,"function"==typeof e?(n.local?kr:_r)(n,r,gr(this,"attr."+t,e)):null==e?(n.local?mr:vr)(n):(n.local?xr:br)(n,r,e))},attrTween:function(t,e){var n="attr."+t;if(arguments.length<2)return(n=this.tween(n))&&n._value;if(null==e)return this.tween(n,null);if("function"!=typeof e)throw new Error;var r=wt(t);return this.tween(n,(r.local?Tr:Cr)(r,e))},style:function(t,e,n){var r="transform"==(t+="")?hr:yr;return null==e?this.styleTween(t,function(t,e){var n,r,i;return function(){var a=Lt(this,t),o=(this.style.removeProperty(t),Lt(this,t));return a===o?null:a===n&&o===r?i:i=e(n=a,r=o)}}(t,r)).on("end.style."+t,Lr(t)):"function"==typeof e?this.styleTween(t,function(t,e,n){var r,i,a;return function(){var o=Lt(this,t),s=n(this),c=s+"";return null==s&&(this.style.removeProperty(t),c=s=Lt(this,t)),o===c?null:o===r&&c===i?a:(i=c,a=e(r=o,s))}}(t,r,gr(this,"style."+t,e))).each(function(t,e){var n,r,i,a,o="style."+e,s="end."+o;return function(){var c=tr(this,t),u=c.on,l=null==c.value[o]?a||(a=Lr(e)):void 0;u===n&&i===l||(r=(n=u).copy()).on(s,i=l),c.on=r}}(this._id,t)):this.styleTween(t,function(t,e,n){var r,i,a=n+"";return function(){var o=Lt(this,t);return o===a?null:o===r?i:i=e(r=o,n)}}(t,r,e),n).on("end.style."+t,null)},styleTween:function(t,e,n){var r="style."+(t+="");if(arguments.length<2)return(r=this.tween(r))&&r._value;if(null==e)return this.tween(r,null);if("function"!=typeof e)throw new Error;return this.tween(r,Ir(t,e,null==n?"":n))},text:function(t){return this.tween("text","function"==typeof t?function(t){return function(){var e=t(this);this.textContent=null==e?"":e}}(gr(this,"text",t)):function(t){return function(){this.textContent=t}}(null==t?"":t+""))},textTween:function(t){var e="text";if(arguments.length<1)return(e=this.tween(e))&&e._value;if(null==t)return this.tween(e,null);if("function"!=typeof t)throw new Error;return this.tween(e,jr(t))},remove:function(){return this.on("end.remove",(t=this._id,function(){var e=this.parentNode;for(var n in this.__transition)if(+n!==t)return;e&&e.removeChild(this)}));var t},tween:function(t,e){var n=this._id;if(t+="",arguments.length<2){for(var r,i=er(this.node(),n).tween,a=0,o=i.length;a<o;++a)if((r=i[a]).name===t)return r.value;return null}return this.each((null==e?dr:pr)(n,t,e))},delay:function(t){var e=this._id;return arguments.length?this.each(("function"==typeof t?Ar:Sr)(e,t)):er(this.node(),e).delay},duration:function(t){var e=this._id;return arguments.length?this.each(("function"==typeof t?Mr:Or)(e,t)):er(this.node(),e).duration},ease:function(t){var e=this._id;return arguments.length?this.each(Dr(e,t)):er(this.node(),e).ease},end:function(){var t,e,n=this,r=n._id,i=n.size();return new Promise((function(a,o){var s={value:o},c={value:function(){0==--i&&a()}};n.each((function(){var n=tr(this,r),i=n.on;i!==t&&((e=(t=i).copy())._.cancel.push(s),e._.interrupt.push(s),e._.end.push(c)),n.on=e}))}))}};var Gr={time:null,delay:0,duration:250,ease:Vr};function qr(t,e){for(var n;!(n=t.__transition)||!(n=n[e]);)if(!(t=t.parentNode))return Gr.time=zn(),Gr;return n}_e.prototype.interrupt=function(t){return this.each((function(){or(this,t)}))},_e.prototype.transition=function(t){var e,n;t instanceof Yr?(e=t._id,t=t._name):(e=Ur(),(n=Gr).time=zn(),t=null==t?null:t+"");for(var r=this._groups,i=r.length,a=0;a<i;++a)for(var o,s=r[a],c=s.length,u=0;u<c;++u)(o=s[u])&&Kn(o,t,e,u,s,n||qr(o,e));return new Yr(r,this._parents,t,e)};var Xr=[null],Zr=function(t,e){var n,r,i=t.__transition;if(i)for(r in e=null==e?null:e+"",i)if((n=i[r]).state>1&&n.name===e)return new Yr([[t]],Xr,e,+r);return null},Jr=function(t){return function(){return t}},Kr=function(t,e,n){this.target=t,this.type=e,this.selection=n};function Qr(){ce.stopImmediatePropagation()}var ti=function(){ce.preventDefault(),ce.stopImmediatePropagation()},ei={name:"drag"},ni={name:"space"},ri={name:"handle"},ii={name:"center"};function ai(t){return[+t[0],+t[1]]}function oi(t){return[ai(t[0]),ai(t[1])]}function si(t){return function(e){return Dn(e,ce.touches,t)}}var ci={name:"x",handles:["w","e"].map(yi),input:function(t,e){return null==t?null:[[+t[0],e[0][1]],[+t[1],e[1][1]]]},output:function(t){return t&&[t[0][0],t[1][0]]}},ui={name:"y",handles:["n","s"].map(yi),input:function(t,e){return null==t?null:[[e[0][0],+t[0]],[e[1][0],+t[1]]]},output:function(t){return t&&[t[0][1],t[1][1]]}},li={name:"xy",handles:["n","w","e","s","nw","ne","sw","se"].map(yi),input:function(t){return null==t?null:oi(t)},output:function(t){return t}},hi={overlay:"crosshair",selection:"move",n:"ns-resize",e:"ew-resize",s:"ns-resize",w:"ew-resize",nw:"nwse-resize",ne:"nesw-resize",se:"nwse-resize",sw:"nesw-resize"},fi={e:"w",w:"e",nw:"ne",ne:"nw",se:"sw",sw:"se"},di={n:"s",s:"n",nw:"sw",ne:"se",se:"ne",sw:"nw"},pi={overlay:1,selection:1,n:null,e:1,s:null,w:-1,nw:-1,ne:1,se:1,sw:-1},gi={overlay:1,selection:1,n:-1,e:null,s:1,w:null,nw:-1,ne:-1,se:1,sw:1};function yi(t){return{type:t}}function vi(){return!ce.ctrlKey&&!ce.button}function mi(){var t=this.ownerSVGElement||this;return t.hasAttribute("viewBox")?[[(t=t.viewBox.baseVal).x,t.y],[t.x+t.width,t.y+t.height]]:[[0,0],[t.width.baseVal.value,t.height.baseVal.value]]}function bi(){return navigator.maxTouchPoints||"ontouchstart"in this}function xi(t){for(;!t.__brush;)if(!(t=t.parentNode))return;return t.__brush}function _i(t){return t[0][0]===t[1][0]||t[0][1]===t[1][1]}function ki(t){var e=t.__brush;return e?e.dim.output(e.selection):null}function wi(){return Ci(ci)}function Ei(){return Ci(ui)}var Ti=function(){return Ci(li)};function Ci(t){var e,n=mi,r=vi,i=bi,a=!0,o=lt("start","brush","end"),s=6;function c(e){var n=e.property("__brush",g).selectAll(".overlay").data([yi("overlay")]);n.enter().append("rect").attr("class","overlay").attr("pointer-events","all").attr("cursor",hi.overlay).merge(n).each((function(){var t=xi(this).extent;ke(this).attr("x",t[0][0]).attr("y",t[0][1]).attr("width",t[1][0]-t[0][0]).attr("height",t[1][1]-t[0][1])})),e.selectAll(".selection").data([yi("selection")]).enter().append("rect").attr("class","selection").attr("cursor",hi.selection).attr("fill","#777").attr("fill-opacity",.3).attr("stroke","#fff").attr("shape-rendering","crispEdges");var r=e.selectAll(".handle").data(t.handles,(function(t){return t.type}));r.exit().remove(),r.enter().append("rect").attr("class",(function(t){return"handle handle--"+t.type})).attr("cursor",(function(t){return hi[t.type]})),e.each(u).attr("fill","none").attr("pointer-events","all").on("mousedown.brush",f).filter(i).on("touchstart.brush",f).on("touchmove.brush",d).on("touchend.brush touchcancel.brush",p).style("touch-action","none").style("-webkit-tap-highlight-color","rgba(0,0,0,0)")}function u(){var t=ke(this),e=xi(this).selection;e?(t.selectAll(".selection").style("display",null).attr("x",e[0][0]).attr("y",e[0][1]).attr("width",e[1][0]-e[0][0]).attr("height",e[1][1]-e[0][1]),t.selectAll(".handle").style("display",null).attr("x",(function(t){return"e"===t.type[t.type.length-1]?e[1][0]-s/2:e[0][0]-s/2})).attr("y",(function(t){return"s"===t.type[0]?e[1][1]-s/2:e[0][1]-s/2})).attr("width",(function(t){return"n"===t.type||"s"===t.type?e[1][0]-e[0][0]+s:s})).attr("height",(function(t){return"e"===t.type||"w"===t.type?e[1][1]-e[0][1]+s:s}))):t.selectAll(".selection,.handle").style("display","none").attr("x",null).attr("y",null).attr("width",null).attr("height",null)}function l(t,e,n){return!n&&t.__brush.emitter||new h(t,e)}function h(t,e){this.that=t,this.args=e,this.state=t.__brush,this.active=0}function f(){if((!e||ce.touches)&&r.apply(this,arguments)){var n,i,o,s,c,h,f,d,p,g,y,v=this,m=ce.target.__data__.type,b="selection"===(a&&ce.metaKey?m="overlay":m)?ei:a&&ce.altKey?ii:ri,x=t===ui?null:pi[m],_=t===ci?null:gi[m],k=xi(v),w=k.extent,E=k.selection,T=w[0][0],C=w[0][1],A=w[1][0],S=w[1][1],M=0,O=0,D=x&&_&&a&&ce.shiftKey,N=ce.touches?si(ce.changedTouches[0].identifier):Nn,B=N(v),L=B,P=l(v,arguments,!0).beforestart();"overlay"===m?(E&&(p=!0),k.selection=E=[[n=t===ui?T:B[0],o=t===ci?C:B[1]],[c=t===ui?A:n,f=t===ci?S:o]]):(n=E[0][0],o=E[0][1],c=E[1][0],f=E[1][1]),i=n,s=o,h=c,d=f;var I=ke(v).attr("pointer-events","none"),F=I.selectAll(".overlay").attr("cursor",hi[m]);if(ce.touches)P.moved=R,P.ended=z;else{var j=ke(ce.view).on("mousemove.brush",R,!0).on("mouseup.brush",z,!0);a&&j.on("keydown.brush",U,!0).on("keyup.brush",$,!0),Te(ce.view)}Qr(),or(v),u.call(v),P.start()}function R(){var t=N(v);!D||g||y||(Math.abs(t[0]-L[0])>Math.abs(t[1]-L[1])?y=!0:g=!0),L=t,p=!0,ti(),Y()}function Y(){var t;switch(M=L[0]-B[0],O=L[1]-B[1],b){case ni:case ei:x&&(M=Math.max(T-n,Math.min(A-c,M)),i=n+M,h=c+M),_&&(O=Math.max(C-o,Math.min(S-f,O)),s=o+O,d=f+O);break;case ri:x<0?(M=Math.max(T-n,Math.min(A-n,M)),i=n+M,h=c):x>0&&(M=Math.max(T-c,Math.min(A-c,M)),i=n,h=c+M),_<0?(O=Math.max(C-o,Math.min(S-o,O)),s=o+O,d=f):_>0&&(O=Math.max(C-f,Math.min(S-f,O)),s=o,d=f+O);break;case ii:x&&(i=Math.max(T,Math.min(A,n-M*x)),h=Math.max(T,Math.min(A,c+M*x))),_&&(s=Math.max(C,Math.min(S,o-O*_)),d=Math.max(C,Math.min(S,f+O*_)))}h<i&&(x*=-1,t=n,n=c,c=t,t=i,i=h,h=t,m in fi&&F.attr("cursor",hi[m=fi[m]])),d<s&&(_*=-1,t=o,o=f,f=t,t=s,s=d,d=t,m in di&&F.attr("cursor",hi[m=di[m]])),k.selection&&(E=k.selection),g&&(i=E[0][0],h=E[1][0]),y&&(s=E[0][1],d=E[1][1]),E[0][0]===i&&E[0][1]===s&&E[1][0]===h&&E[1][1]===d||(k.selection=[[i,s],[h,d]],u.call(v),P.brush())}function z(){if(Qr(),ce.touches){if(ce.touches.length)return;e&&clearTimeout(e),e=setTimeout((function(){e=null}),500)}else Ce(ce.view,p),j.on("keydown.brush keyup.brush mousemove.brush mouseup.brush",null);I.attr("pointer-events","all"),F.attr("cursor",hi.overlay),k.selection&&(E=k.selection),_i(E)&&(k.selection=null,u.call(v)),P.end()}function U(){switch(ce.keyCode){case 16:D=x&&_;break;case 18:b===ri&&(x&&(c=h-M*x,n=i+M*x),_&&(f=d-O*_,o=s+O*_),b=ii,Y());break;case 32:b!==ri&&b!==ii||(x<0?c=h-M:x>0&&(n=i-M),_<0?f=d-O:_>0&&(o=s-O),b=ni,F.attr("cursor",hi.selection),Y());break;default:return}ti()}function $(){switch(ce.keyCode){case 16:D&&(g=y=D=!1,Y());break;case 18:b===ii&&(x<0?c=h:x>0&&(n=i),_<0?f=d:_>0&&(o=s),b=ri,Y());break;case 32:b===ni&&(ce.altKey?(x&&(c=h-M*x,n=i+M*x),_&&(f=d-O*_,o=s+O*_),b=ii):(x<0?c=h:x>0&&(n=i),_<0?f=d:_>0&&(o=s),b=ri),F.attr("cursor",hi[m]),Y());break;default:return}ti()}}function d(){l(this,arguments).moved()}function p(){l(this,arguments).ended()}function g(){var e=this.__brush||{selection:null};return e.extent=oi(n.apply(this,arguments)),e.dim=t,e}return c.move=function(e,n){e.selection?e.on("start.brush",(function(){l(this,arguments).beforestart().start()})).on("interrupt.brush end.brush",(function(){l(this,arguments).end()})).tween("brush",(function(){var e=this,r=e.__brush,i=l(e,arguments),a=r.selection,o=t.input("function"==typeof n?n.apply(this,arguments):n,r.extent),s=Sn(a,o);function c(t){r.selection=1===t&&null===o?null:s(t),u.call(e),i.brush()}return null!==a&&null!==o?c:c(1)})):e.each((function(){var e=this,r=arguments,i=e.__brush,a=t.input("function"==typeof n?n.apply(e,r):n,i.extent),o=l(e,r).beforestart();or(e),i.selection=null===a?null:a,u.call(e),o.start().brush().end()}))},c.clear=function(t){c.move(t,null)},h.prototype={beforestart:function(){return 1==++this.active&&(this.state.emitter=this,this.starting=!0),this},start:function(){return this.starting?(this.starting=!1,this.emit("start")):this.emit("brush"),this},brush:function(){return this.emit("brush"),this},end:function(){return 0==--this.active&&(delete this.state.emitter,this.emit("end")),this},emit:function(e){pe(new Kr(c,e,t.output(this.state.selection)),o.apply,o,[e,this.that,this.args])}},c.extent=function(t){return arguments.length?(n="function"==typeof t?t:Jr(oi(t)),c):n},c.filter=function(t){return arguments.length?(r="function"==typeof t?t:Jr(!!t),c):r},c.touchable=function(t){return arguments.length?(i="function"==typeof t?t:Jr(!!t),c):i},c.handleSize=function(t){return arguments.length?(s=+t,c):s},c.keyModifiers=function(t){return arguments.length?(a=!!t,c):a},c.on=function(){var t=o.on.apply(o,arguments);return t===o?c:t},c}var Ai=Math.cos,Si=Math.sin,Mi=Math.PI,Oi=Mi/2,Di=2*Mi,Ni=Math.max;function Bi(t){return function(e,n){return t(e.source.value+e.target.value,n.source.value+n.target.value)}}var Li=function(){var t=0,e=null,n=null,r=null;function i(i){var a,o,s,c,u,l,h=i.length,f=[],d=k(h),p=[],g=[],y=g.groups=new Array(h),v=new Array(h*h);for(a=0,u=-1;++u<h;){for(o=0,l=-1;++l<h;)o+=i[u][l];f.push(o),p.push(k(h)),a+=o}for(e&&d.sort((function(t,n){return e(f[t],f[n])})),n&&p.forEach((function(t,e){t.sort((function(t,r){return n(i[e][t],i[e][r])}))})),c=(a=Ni(0,Di-t*h)/a)?t:Di/h,o=0,u=-1;++u<h;){for(s=o,l=-1;++l<h;){var m=d[u],b=p[m][l],x=i[m][b],_=o,w=o+=x*a;v[b*h+m]={index:m,subindex:b,startAngle:_,endAngle:w,value:x}}y[m]={index:m,startAngle:s,endAngle:o,value:f[m]},o+=c}for(u=-1;++u<h;)for(l=u-1;++l<h;){var E=v[l*h+u],T=v[u*h+l];(E.value||T.value)&&g.push(E.value<T.value?{source:T,target:E}:{source:E,target:T})}return r?g.sort(r):g}return i.padAngle=function(e){return arguments.length?(t=Ni(0,e),i):t},i.sortGroups=function(t){return arguments.length?(e=t,i):e},i.sortSubgroups=function(t){return arguments.length?(n=t,i):n},i.sortChords=function(t){return arguments.length?(null==t?r=null:(r=Bi(t))._=t,i):r&&r._},i},Pi=Array.prototype.slice,Ii=function(t){return function(){return t}},Fi=Math.PI,ji=2*Fi,Ri=ji-1e-6;function Yi(){this._x0=this._y0=this._x1=this._y1=null,this._=""}function zi(){return new Yi}Yi.prototype=zi.prototype={constructor:Yi,moveTo:function(t,e){this._+="M"+(this._x0=this._x1=+t)+","+(this._y0=this._y1=+e)},closePath:function(){null!==this._x1&&(this._x1=this._x0,this._y1=this._y0,this._+="Z")},lineTo:function(t,e){this._+="L"+(this._x1=+t)+","+(this._y1=+e)},quadraticCurveTo:function(t,e,n,r){this._+="Q"+ +t+","+ +e+","+(this._x1=+n)+","+(this._y1=+r)},bezierCurveTo:function(t,e,n,r,i,a){this._+="C"+ +t+","+ +e+","+ +n+","+ +r+","+(this._x1=+i)+","+(this._y1=+a)},arcTo:function(t,e,n,r,i){t=+t,e=+e,n=+n,r=+r,i=+i;var a=this._x1,o=this._y1,s=n-t,c=r-e,u=a-t,l=o-e,h=u*u+l*l;if(i<0)throw new Error("negative radius: "+i);if(null===this._x1)this._+="M"+(this._x1=t)+","+(this._y1=e);else if(h>1e-6)if(Math.abs(l*s-c*u)>1e-6&&i){var f=n-a,d=r-o,p=s*s+c*c,g=f*f+d*d,y=Math.sqrt(p),v=Math.sqrt(h),m=i*Math.tan((Fi-Math.acos((p+h-g)/(2*y*v)))/2),b=m/v,x=m/y;Math.abs(b-1)>1e-6&&(this._+="L"+(t+b*u)+","+(e+b*l)),this._+="A"+i+","+i+",0,0,"+ +(l*f>u*d)+","+(this._x1=t+x*s)+","+(this._y1=e+x*c)}else this._+="L"+(this._x1=t)+","+(this._y1=e);else;},arc:function(t,e,n,r,i,a){t=+t,e=+e,a=!!a;var o=(n=+n)*Math.cos(r),s=n*Math.sin(r),c=t+o,u=e+s,l=1^a,h=a?r-i:i-r;if(n<0)throw new Error("negative radius: "+n);null===this._x1?this._+="M"+c+","+u:(Math.abs(this._x1-c)>1e-6||Math.abs(this._y1-u)>1e-6)&&(this._+="L"+c+","+u),n&&(h<0&&(h=h%ji+ji),h>Ri?this._+="A"+n+","+n+",0,1,"+l+","+(t-o)+","+(e-s)+"A"+n+","+n+",0,1,"+l+","+(this._x1=c)+","+(this._y1=u):h>1e-6&&(this._+="A"+n+","+n+",0,"+ +(h>=Fi)+","+l+","+(this._x1=t+n*Math.cos(i))+","+(this._y1=e+n*Math.sin(i))))},rect:function(t,e,n,r){this._+="M"+(this._x0=this._x1=+t)+","+(this._y0=this._y1=+e)+"h"+ +n+"v"+ +r+"h"+-n+"Z"},toString:function(){return this._}};var Ui=zi;function $i(t){return t.source}function Wi(t){return t.target}function Hi(t){return t.radius}function Vi(t){return t.startAngle}function Gi(t){return t.endAngle}var qi=function(){var t=$i,e=Wi,n=Hi,r=Vi,i=Gi,a=null;function o(){var o,s=Pi.call(arguments),c=t.apply(this,s),u=e.apply(this,s),l=+n.apply(this,(s[0]=c,s)),h=r.apply(this,s)-Oi,f=i.apply(this,s)-Oi,d=l*Ai(h),p=l*Si(h),g=+n.apply(this,(s[0]=u,s)),y=r.apply(this,s)-Oi,v=i.apply(this,s)-Oi;if(a||(a=o=Ui()),a.moveTo(d,p),a.arc(0,0,l,h,f),h===y&&f===v||(a.quadraticCurveTo(0,0,g*Ai(y),g*Si(y)),a.arc(0,0,g,y,v)),a.quadraticCurveTo(0,0,d,p),a.closePath(),o)return a=null,o+""||null}return o.radius=function(t){return arguments.length?(n="function"==typeof t?t:Ii(+t),o):n},o.startAngle=function(t){return arguments.length?(r="function"==typeof t?t:Ii(+t),o):r},o.endAngle=function(t){return arguments.length?(i="function"==typeof t?t:Ii(+t),o):i},o.source=function(e){return arguments.length?(t=e,o):t},o.target=function(t){return arguments.length?(e=t,o):e},o.context=function(t){return arguments.length?(a=null==t?null:t,o):a},o};function Xi(){}function Zi(t,e){var n=new Xi;if(t instanceof Xi)t.each((function(t,e){n.set(e,t)}));else if(Array.isArray(t)){var r,i=-1,a=t.length;if(null==e)for(;++i<a;)n.set(i,t[i]);else for(;++i<a;)n.set(e(r=t[i],i,t),r)}else if(t)for(var o in t)n.set(o,t[o]);return n}Xi.prototype=Zi.prototype={constructor:Xi,has:function(t){return"$"+t in this},get:function(t){return this["$"+t]},set:function(t,e){return this["$"+t]=e,this},remove:function(t){var e="$"+t;return e in this&&delete this[e]},clear:function(){for(var t in this)"$"===t[0]&&delete this[t]},keys:function(){var t=[];for(var e in this)"$"===e[0]&&t.push(e.slice(1));return t},values:function(){var t=[];for(var e in this)"$"===e[0]&&t.push(this[e]);return t},entries:function(){var t=[];for(var e in this)"$"===e[0]&&t.push({key:e.slice(1),value:this[e]});return t},size:function(){var t=0;for(var e in this)"$"===e[0]&&++t;return t},empty:function(){for(var t in this)if("$"===t[0])return!1;return!0},each:function(t){for(var e in this)"$"===e[0]&&t(this[e],e.slice(1),this)}};var Ji=Zi,Ki=function(){var t,e,n,r=[],i=[];function a(n,i,o,s){if(i>=r.length)return null!=t&&n.sort(t),null!=e?e(n):n;for(var c,u,l,h=-1,f=n.length,d=r[i++],p=Ji(),g=o();++h<f;)(l=p.get(c=d(u=n[h])+""))?l.push(u):p.set(c,[u]);return p.each((function(t,e){s(g,e,a(t,i,o,s))})),g}return n={object:function(t){return a(t,0,Qi,ta)},map:function(t){return a(t,0,ea,na)},entries:function(t){return function t(n,a){if(++a>r.length)return n;var o,s=i[a-1];return null!=e&&a>=r.length?o=n.entries():(o=[],n.each((function(e,n){o.push({key:n,values:t(e,a)})}))),null!=s?o.sort((function(t,e){return s(t.key,e.key)})):o}(a(t,0,ea,na),0)},key:function(t){return r.push(t),n},sortKeys:function(t){return i[r.length-1]=t,n},sortValues:function(e){return t=e,n},rollup:function(t){return e=t,n}}};function Qi(){return{}}function ta(t,e,n){t[e]=n}function ea(){return Ji()}function na(t,e,n){t.set(e,n)}function ra(){}var ia=Ji.prototype;function aa(t,e){var n=new ra;if(t instanceof ra)t.each((function(t){n.add(t)}));else if(t){var r=-1,i=t.length;if(null==e)for(;++r<i;)n.add(t[r]);else for(;++r<i;)n.add(e(t[r],r,t))}return n}ra.prototype=aa.prototype={constructor:ra,has:ia.has,add:function(t){return this["$"+(t+="")]=t,this},remove:ia.remove,clear:ia.clear,values:ia.keys,size:ia.size,empty:ia.empty,each:ia.each};var oa=aa,sa=function(t){var e=[];for(var n in t)e.push(n);return e},ca=function(t){var e=[];for(var n in t)e.push(t[n]);return e},ua=function(t){var e=[];for(var n in t)e.push({key:n,value:t[n]});return e},la=Math.PI/180,ha=180/Math.PI;function fa(t){if(t instanceof ga)return new ga(t.l,t.a,t.b,t.opacity);if(t instanceof wa)return Ea(t);t instanceof qe||(t=Ve(t));var e,n,r=ba(t.r),i=ba(t.g),a=ba(t.b),o=ya((.2225045*r+.7168786*i+.0606169*a)/1);return r===i&&i===a?e=n=o:(e=ya((.4360747*r+.3850649*i+.1430804*a)/.96422),n=ya((.0139322*r+.0971045*i+.7141733*a)/.82521)),new ga(116*o-16,500*(e-o),200*(o-n),t.opacity)}function da(t,e){return new ga(t,0,0,null==e?1:e)}function pa(t,e,n,r){return 1===arguments.length?fa(t):new ga(t,e,n,null==r?1:r)}function ga(t,e,n,r){this.l=+t,this.a=+e,this.b=+n,this.opacity=+r}function ya(t){return t>6/29*(6/29)*(6/29)?Math.pow(t,1/3):t/(6/29*3*(6/29))+4/29}function va(t){return t>6/29?t*t*t:6/29*3*(6/29)*(t-4/29)}function ma(t){return 255*(t<=.0031308?12.92*t:1.055*Math.pow(t,1/2.4)-.055)}function ba(t){return(t/=255)<=.04045?t/12.92:Math.pow((t+.055)/1.055,2.4)}function xa(t){if(t instanceof wa)return new wa(t.h,t.c,t.l,t.opacity);if(t instanceof ga||(t=fa(t)),0===t.a&&0===t.b)return new wa(NaN,0<t.l&&t.l<100?0:NaN,t.l,t.opacity);var e=Math.atan2(t.b,t.a)*ha;return new wa(e<0?e+360:e,Math.sqrt(t.a*t.a+t.b*t.b),t.l,t.opacity)}function _a(t,e,n,r){return 1===arguments.length?xa(t):new wa(n,e,t,null==r?1:r)}function ka(t,e,n,r){return 1===arguments.length?xa(t):new wa(t,e,n,null==r?1:r)}function wa(t,e,n,r){this.h=+t,this.c=+e,this.l=+n,this.opacity=+r}function Ea(t){if(isNaN(t.h))return new ga(t.l,0,0,t.opacity);var e=t.h*la;return new ga(t.l,Math.cos(e)*t.c,Math.sin(e)*t.c,t.opacity)}Ae(ga,pa,Se(Me,{brighter:function(t){return new ga(this.l+18*(null==t?1:t),this.a,this.b,this.opacity)},darker:function(t){return new ga(this.l-18*(null==t?1:t),this.a,this.b,this.opacity)},rgb:function(){var t=(this.l+16)/116,e=isNaN(this.a)?t:t+this.a/500,n=isNaN(this.b)?t:t-this.b/200;return new qe(ma(3.1338561*(e=.96422*va(e))-1.6168667*(t=1*va(t))-.4906146*(n=.82521*va(n))),ma(-.9787684*e+1.9161415*t+.033454*n),ma(.0719453*e-.2289914*t+1.4052427*n),this.opacity)}})),Ae(wa,ka,Se(Me,{brighter:function(t){return new wa(this.h,this.c,this.l+18*(null==t?1:t),this.opacity)},darker:function(t){return new wa(this.h,this.c,this.l-18*(null==t?1:t),this.opacity)},rgb:function(){return Ea(this).rgb()}}));var Ta=-.29227,Ca=-1.7884503806,Aa=3.5172982438,Sa=-.6557636667999999;function Ma(t){if(t instanceof Da)return new Da(t.h,t.s,t.l,t.opacity);t instanceof qe||(t=Ve(t));var e=t.r/255,n=t.g/255,r=t.b/255,i=(Sa*r+Ca*e-Aa*n)/(Sa+Ca-Aa),a=r-i,o=(1.97294*(n-i)-Ta*a)/-.90649,s=Math.sqrt(o*o+a*a)/(1.97294*i*(1-i)),c=s?Math.atan2(o,a)*ha-120:NaN;return new Da(c<0?c+360:c,s,i,t.opacity)}function Oa(t,e,n,r){return 1===arguments.length?Ma(t):new Da(t,e,n,null==r?1:r)}function Da(t,e,n,r){this.h=+t,this.s=+e,this.l=+n,this.opacity=+r}Ae(Da,Oa,Se(Me,{brighter:function(t){return t=null==t?1/.7:Math.pow(1/.7,t),new Da(this.h,this.s,this.l*t,this.opacity)},darker:function(t){return t=null==t?.7:Math.pow(.7,t),new Da(this.h,this.s,this.l*t,this.opacity)},rgb:function(){var t=isNaN(this.h)?0:(this.h+120)*la,e=+this.l,n=isNaN(this.s)?0:this.s*e*(1-e),r=Math.cos(t),i=Math.sin(t);return new qe(255*(e+n*(-.14861*r+1.78277*i)),255*(e+n*(Ta*r+-.90649*i)),255*(e+n*(1.97294*r)),this.opacity)}}));var Na=Array.prototype.slice,Ba=function(t,e){return t-e},La=function(t){return function(){return t}},Pa=function(t,e){for(var n,r=-1,i=e.length;++r<i;)if(n=Ia(t,e[r]))return n;return 0};function Ia(t,e){for(var n=e[0],r=e[1],i=-1,a=0,o=t.length,s=o-1;a<o;s=a++){var c=t[a],u=c[0],l=c[1],h=t[s],f=h[0],d=h[1];if(Fa(c,h,e))return 0;l>r!=d>r&&n<(f-u)*(r-l)/(d-l)+u&&(i=-i)}return i}function Fa(t,e,n){var r,i,a,o;return function(t,e,n){return(e[0]-t[0])*(n[1]-t[1])==(n[0]-t[0])*(e[1]-t[1])}(t,e,n)&&(i=t[r=+(t[0]===e[0])],a=n[r],o=e[r],i<=a&&a<=o||o<=a&&a<=i)}var ja=function(){},Ra=[[],[[[1,1.5],[.5,1]]],[[[1.5,1],[1,1.5]]],[[[1.5,1],[.5,1]]],[[[1,.5],[1.5,1]]],[[[1,1.5],[.5,1]],[[1,.5],[1.5,1]]],[[[1,.5],[1,1.5]]],[[[1,.5],[.5,1]]],[[[.5,1],[1,.5]]],[[[1,1.5],[1,.5]]],[[[.5,1],[1,.5]],[[1.5,1],[1,1.5]]],[[[1.5,1],[1,.5]]],[[[.5,1],[1.5,1]]],[[[1,1.5],[1.5,1]]],[[[.5,1],[1,1.5]]],[]],Ya=function(){var t=1,e=1,n=M,r=s;function i(t){var e=n(t);if(Array.isArray(e))e=e.slice().sort(Ba);else{var r=y(t),i=r[0],o=r[1];e=S(i,o,e),e=k(Math.floor(i/e)*e,Math.floor(o/e)*e,e)}return e.map((function(e){return a(t,e)}))}function a(n,i){var a=[],s=[];return function(n,r,i){var a,s,c,u,l,h,f=new Array,d=new Array;a=s=-1,u=n[0]>=r,Ra[u<<1].forEach(p);for(;++a<t-1;)c=u,u=n[a+1]>=r,Ra[c|u<<1].forEach(p);Ra[u<<0].forEach(p);for(;++s<e-1;){for(a=-1,u=n[s*t+t]>=r,l=n[s*t]>=r,Ra[u<<1|l<<2].forEach(p);++a<t-1;)c=u,u=n[s*t+t+a+1]>=r,h=l,l=n[s*t+a+1]>=r,Ra[c|u<<1|l<<2|h<<3].forEach(p);Ra[u|l<<3].forEach(p)}a=-1,l=n[s*t]>=r,Ra[l<<2].forEach(p);for(;++a<t-1;)h=l,l=n[s*t+a+1]>=r,Ra[l<<2|h<<3].forEach(p);function p(t){var e,n,r=[t[0][0]+a,t[0][1]+s],c=[t[1][0]+a,t[1][1]+s],u=o(r),l=o(c);(e=d[u])?(n=f[l])?(delete d[e.end],delete f[n.start],e===n?(e.ring.push(c),i(e.ring)):f[e.start]=d[n.end]={start:e.start,end:n.end,ring:e.ring.concat(n.ring)}):(delete d[e.end],e.ring.push(c),d[e.end=l]=e):(e=f[l])?(n=d[u])?(delete f[e.start],delete d[n.end],e===n?(e.ring.push(c),i(e.ring)):f[n.start]=d[e.end]={start:n.start,end:e.end,ring:n.ring.concat(e.ring)}):(delete f[e.start],e.ring.unshift(r),f[e.start=u]=e):f[u]=d[l]={start:u,end:l,ring:[r,c]}}Ra[l<<3].forEach(p)}(n,i,(function(t){r(t,n,i),function(t){for(var e=0,n=t.length,r=t[n-1][1]*t[0][0]-t[n-1][0]*t[0][1];++e<n;)r+=t[e-1][1]*t[e][0]-t[e-1][0]*t[e][1];return r}(t)>0?a.push([t]):s.push(t)})),s.forEach((function(t){for(var e,n=0,r=a.length;n<r;++n)if(-1!==Pa((e=a[n])[0],t))return void e.push(t)})),{type:"MultiPolygon",value:i,coordinates:a}}function o(e){return 2*e[0]+e[1]*(t+1)*4}function s(n,r,i){n.forEach((function(n){var a,o=n[0],s=n[1],c=0|o,u=0|s,l=r[u*t+c];o>0&&o<t&&c===o&&(a=r[u*t+c-1],n[0]=o+(i-a)/(l-a)-.5),s>0&&s<e&&u===s&&(a=r[(u-1)*t+c],n[1]=s+(i-a)/(l-a)-.5)}))}return i.contour=a,i.size=function(n){if(!arguments.length)return[t,e];var r=Math.ceil(n[0]),a=Math.ceil(n[1]);if(!(r>0&&a>0))throw new Error("invalid size");return t=r,e=a,i},i.thresholds=function(t){return arguments.length?(n="function"==typeof t?t:Array.isArray(t)?La(Na.call(t)):La(t),i):n},i.smooth=function(t){return arguments.length?(r=t?s:ja,i):r===s},i};function za(t,e,n){for(var r=t.width,i=t.height,a=1+(n<<1),o=0;o<i;++o)for(var s=0,c=0;s<r+n;++s)s<r&&(c+=t.data[s+o*r]),s>=n&&(s>=a&&(c-=t.data[s-a+o*r]),e.data[s-n+o*r]=c/Math.min(s+1,r-1+a-s,a))}function Ua(t,e,n){for(var r=t.width,i=t.height,a=1+(n<<1),o=0;o<r;++o)for(var s=0,c=0;s<i+n;++s)s<i&&(c+=t.data[o+s*r]),s>=n&&(s>=a&&(c-=t.data[o+(s-a)*r]),e.data[o+(s-n)*r]=c/Math.min(s+1,i-1+a-s,a))}function $a(t){return t[0]}function Wa(t){return t[1]}function Ha(){return 1}var Va=function(){var t=$a,e=Wa,n=Ha,r=960,i=500,a=20,o=2,s=3*a,c=r+2*s>>o,u=i+2*s>>o,l=La(20);function h(r){var i=new Float32Array(c*u),h=new Float32Array(c*u);r.forEach((function(r,a,l){var h=+t(r,a,l)+s>>o,f=+e(r,a,l)+s>>o,d=+n(r,a,l);h>=0&&h<c&&f>=0&&f<u&&(i[h+f*c]+=d)})),za({width:c,height:u,data:i},{width:c,height:u,data:h},a>>o),Ua({width:c,height:u,data:h},{width:c,height:u,data:i},a>>o),za({width:c,height:u,data:i},{width:c,height:u,data:h},a>>o),Ua({width:c,height:u,data:h},{width:c,height:u,data:i},a>>o),za({width:c,height:u,data:i},{width:c,height:u,data:h},a>>o),Ua({width:c,height:u,data:h},{width:c,height:u,data:i},a>>o);var d=l(i);if(!Array.isArray(d)){var p=L(i);d=S(0,p,d),(d=k(0,Math.floor(p/d)*d,d)).shift()}return Ya().thresholds(d).size([c,u])(i).map(f)}function f(t){return t.value*=Math.pow(2,-2*o),t.coordinates.forEach(d),t}function d(t){t.forEach(p)}function p(t){t.forEach(g)}function g(t){t[0]=t[0]*Math.pow(2,o)-s,t[1]=t[1]*Math.pow(2,o)-s}function y(){return c=r+2*(s=3*a)>>o,u=i+2*s>>o,h}return h.x=function(e){return arguments.length?(t="function"==typeof e?e:La(+e),h):t},h.y=function(t){return arguments.length?(e="function"==typeof t?t:La(+t),h):e},h.weight=function(t){return arguments.length?(n="function"==typeof t?t:La(+t),h):n},h.size=function(t){if(!arguments.length)return[r,i];var e=Math.ceil(t[0]),n=Math.ceil(t[1]);if(!(e>=0||e>=0))throw new Error("invalid size");return r=e,i=n,y()},h.cellSize=function(t){if(!arguments.length)return 1<<o;if(!((t=+t)>=1))throw new Error("invalid cell size");return o=Math.floor(Math.log(t)/Math.LN2),y()},h.thresholds=function(t){return arguments.length?(l="function"==typeof t?t:Array.isArray(t)?La(Na.call(t)):La(t),h):l},h.bandwidth=function(t){if(!arguments.length)return Math.sqrt(a*(a+1));if(!((t=+t)>=0))throw new Error("invalid bandwidth");return a=Math.round((Math.sqrt(4*t*t+1)-1)/2),y()},h},Ga=function(t){return function(){return t}};function qa(t,e,n,r,i,a,o,s,c,u){this.target=t,this.type=e,this.subject=n,this.identifier=r,this.active=i,this.x=a,this.y=o,this.dx=s,this.dy=c,this._=u}function Xa(){return!ce.ctrlKey&&!ce.button}function Za(){return this.parentNode}function Ja(t){return null==t?{x:ce.x,y:ce.y}:t}function Ka(){return navigator.maxTouchPoints||"ontouchstart"in this}qa.prototype.on=function(){var t=this._.on.apply(this._,arguments);return t===this._?this:t};var Qa=function(){var t,e,n,r,i=Xa,a=Za,o=Ja,s=Ka,c={},u=lt("start","drag","end"),l=0,h=0;function f(t){t.on("mousedown.drag",d).filter(s).on("touchstart.drag",y).on("touchmove.drag",v).on("touchend.drag touchcancel.drag",m).style("touch-action","none").style("-webkit-tap-highlight-color","rgba(0,0,0,0)")}function d(){if(!r&&i.apply(this,arguments)){var o=b("mouse",a.apply(this,arguments),Nn,this,arguments);o&&(ke(ce.view).on("mousemove.drag",p,!0).on("mouseup.drag",g,!0),Te(ce.view),we(),n=!1,t=ce.clientX,e=ce.clientY,o("start"))}}function p(){if(Ee(),!n){var r=ce.clientX-t,i=ce.clientY-e;n=r*r+i*i>h}c.mouse("drag")}function g(){ke(ce.view).on("mousemove.drag mouseup.drag",null),Ce(ce.view,n),Ee(),c.mouse("end")}function y(){if(i.apply(this,arguments)){var t,e,n=ce.changedTouches,r=a.apply(this,arguments),o=n.length;for(t=0;t<o;++t)(e=b(n[t].identifier,r,Dn,this,arguments))&&(we(),e("start"))}}function v(){var t,e,n=ce.changedTouches,r=n.length;for(t=0;t<r;++t)(e=c[n[t].identifier])&&(Ee(),e("drag"))}function m(){var t,e,n=ce.changedTouches,i=n.length;for(r&&clearTimeout(r),r=setTimeout((function(){r=null}),500),t=0;t<i;++t)(e=c[n[t].identifier])&&(we(),e("end"))}function b(t,e,n,r,i){var a,s,h,d=n(e,t),p=u.copy();if(pe(new qa(f,"beforestart",a,t,l,d[0],d[1],0,0,p),(function(){return null!=(ce.subject=a=o.apply(r,i))&&(s=a.x-d[0]||0,h=a.y-d[1]||0,!0)})))return function o(u){var g,y=d;switch(u){case"start":c[t]=o,g=l++;break;case"end":delete c[t],--l;case"drag":d=n(e,t),g=l}pe(new qa(f,u,a,t,g,d[0]+s,d[1]+h,d[0]-y[0],d[1]-y[1],p),p.apply,p,[u,r,i])}}return f.filter=function(t){return arguments.length?(i="function"==typeof t?t:Ga(!!t),f):i},f.container=function(t){return arguments.length?(a="function"==typeof t?t:Ga(t),f):a},f.subject=function(t){return arguments.length?(o="function"==typeof t?t:Ga(t),f):o},f.touchable=function(t){return arguments.length?(s="function"==typeof t?t:Ga(!!t),f):s},f.on=function(){var t=u.on.apply(u,arguments);return t===u?f:t},f.clickDistance=function(t){return arguments.length?(h=(t=+t)*t,f):Math.sqrt(h)},f},to={},eo={};function no(t){return new Function("d","return {"+t.map((function(t,e){return JSON.stringify(t)+": d["+e+'] || ""'})).join(",")+"}")}function ro(t){var e=Object.create(null),n=[];return t.forEach((function(t){for(var r in t)r in e||n.push(e[r]=r)})),n}function io(t,e){var n=t+"",r=n.length;return r<e?new Array(e-r+1).join(0)+n:n}function ao(t){var e,n=t.getUTCHours(),r=t.getUTCMinutes(),i=t.getUTCSeconds(),a=t.getUTCMilliseconds();return isNaN(t)?"Invalid Date":((e=t.getUTCFullYear())<0?"-"+io(-e,6):e>9999?"+"+io(e,6):io(e,4))+"-"+io(t.getUTCMonth()+1,2)+"-"+io(t.getUTCDate(),2)+(a?"T"+io(n,2)+":"+io(r,2)+":"+io(i,2)+"."+io(a,3)+"Z":i?"T"+io(n,2)+":"+io(r,2)+":"+io(i,2)+"Z":r||n?"T"+io(n,2)+":"+io(r,2)+"Z":"")}var oo=function(t){var e=new RegExp('["'+t+"\n\r]"),n=t.charCodeAt(0);function r(t,e){var r,i=[],a=t.length,o=0,s=0,c=a<=0,u=!1;function l(){if(c)return eo;if(u)return u=!1,to;var e,r,i=o;if(34===t.charCodeAt(i)){for(;o++<a&&34!==t.charCodeAt(o)||34===t.charCodeAt(++o););return(e=o)>=a?c=!0:10===(r=t.charCodeAt(o++))?u=!0:13===r&&(u=!0,10===t.charCodeAt(o)&&++o),t.slice(i+1,e-1).replace(/""/g,'"')}for(;o<a;){if(10===(r=t.charCodeAt(e=o++)))u=!0;else if(13===r)u=!0,10===t.charCodeAt(o)&&++o;else if(r!==n)continue;return t.slice(i,e)}return c=!0,t.slice(i,a)}for(10===t.charCodeAt(a-1)&&--a,13===t.charCodeAt(a-1)&&--a;(r=l())!==eo;){for(var h=[];r!==to&&r!==eo;)h.push(r),r=l();e&&null==(h=e(h,s++))||i.push(h)}return i}function i(e,n){return e.map((function(e){return n.map((function(t){return o(e[t])})).join(t)}))}function a(e){return e.map(o).join(t)}function o(t){return null==t?"":t instanceof Date?ao(t):e.test(t+="")?'"'+t.replace(/"/g,'""')+'"':t}return{parse:function(t,e){var n,i,a=r(t,(function(t,r){if(n)return n(t,r-1);i=t,n=e?function(t,e){var n=no(t);return function(r,i){return e(n(r),i,t)}}(t,e):no(t)}));return a.columns=i||[],a},parseRows:r,format:function(e,n){return null==n&&(n=ro(e)),[n.map(o).join(t)].concat(i(e,n)).join("\n")},formatBody:function(t,e){return null==e&&(e=ro(t)),i(t,e).join("\n")},formatRows:function(t){return t.map(a).join("\n")},formatRow:a,formatValue:o}},so=oo(","),co=so.parse,uo=so.parseRows,lo=so.format,ho=so.formatBody,fo=so.formatRows,po=so.formatRow,go=so.formatValue,yo=oo("\t"),vo=yo.parse,mo=yo.parseRows,bo=yo.format,xo=yo.formatBody,_o=yo.formatRows,ko=yo.formatRow,wo=yo.formatValue;function Eo(t){for(var e in t){var n,r,i=t[e].trim();if(i)if("true"===i)i=!0;else if("false"===i)i=!1;else if("NaN"===i)i=NaN;else if(isNaN(n=+i)){if(!(r=i.match(/^([-+]\d{2})?\d{4}(-\d{2}(-\d{2})?)?(T\d{2}:\d{2}(:\d{2}(\.\d{3})?)?(Z|[-+]\d{2}:\d{2})?)?$/)))continue;To&&r[4]&&!r[7]&&(i=i.replace(/-/g,"/").replace(/T/," ")),i=new Date(i)}else i=n;else i=null;t[e]=i}return t}var To=new Date("2019-01-01T00:00").getHours()||new Date("2019-07-01T00:00").getHours();function Co(t){return+t}function Ao(t){return t*t}function So(t){return t*(2-t)}function Mo(t){return((t*=2)<=1?t*t:--t*(2-t)+1)/2}var Oo=function t(e){function n(t){return Math.pow(t,e)}return e=+e,n.exponent=t,n}(3),Do=function t(e){function n(t){return 1-Math.pow(1-t,e)}return e=+e,n.exponent=t,n}(3),No=function t(e){function n(t){return((t*=2)<=1?Math.pow(t,e):2-Math.pow(2-t,e))/2}return e=+e,n.exponent=t,n}(3),Bo=Math.PI,Lo=Bo/2;function Po(t){return 1-Math.cos(t*Lo)}function Io(t){return Math.sin(t*Lo)}function Fo(t){return(1-Math.cos(Bo*t))/2}function jo(t){return Math.pow(2,10*t-10)}function Ro(t){return 1-Math.pow(2,-10*t)}function Yo(t){return((t*=2)<=1?Math.pow(2,10*t-10):2-Math.pow(2,10-10*t))/2}function zo(t){return 1-Math.sqrt(1-t*t)}function Uo(t){return Math.sqrt(1- --t*t)}function $o(t){return((t*=2)<=1?1-Math.sqrt(1-t*t):Math.sqrt(1-(t-=2)*t)+1)/2}function Wo(t){return 1-Ho(1-t)}function Ho(t){return(t=+t)<4/11?7.5625*t*t:t<8/11?7.5625*(t-=6/11)*t+.75:t<10/11?7.5625*(t-=9/11)*t+.9375:7.5625*(t-=21/22)*t+63/64}function Vo(t){return((t*=2)<=1?1-Ho(1-t):Ho(t-1)+1)/2}var Go=function t(e){function n(t){return t*t*((e+1)*t-e)}return e=+e,n.overshoot=t,n}(1.70158),qo=function t(e){function n(t){return--t*t*((e+1)*t+e)+1}return e=+e,n.overshoot=t,n}(1.70158),Xo=function t(e){function n(t){return((t*=2)<1?t*t*((e+1)*t-e):(t-=2)*t*((e+1)*t+e)+2)/2}return e=+e,n.overshoot=t,n}(1.70158),Zo=2*Math.PI,Jo=function t(e,n){var r=Math.asin(1/(e=Math.max(1,e)))*(n/=Zo);function i(t){return e*Math.pow(2,10*--t)*Math.sin((r-t)/n)}return i.amplitude=function(e){return t(e,n*Zo)},i.period=function(n){return t(e,n)},i}(1,.3),Ko=function t(e,n){var r=Math.asin(1/(e=Math.max(1,e)))*(n/=Zo);function i(t){return 1-e*Math.pow(2,-10*(t=+t))*Math.sin((t+r)/n)}return i.amplitude=function(e){return t(e,n*Zo)},i.period=function(n){return t(e,n)},i}(1,.3),Qo=function t(e,n){var r=Math.asin(1/(e=Math.max(1,e)))*(n/=Zo);function i(t){return((t=2*t-1)<0?e*Math.pow(2,10*t)*Math.sin((r-t)/n):2-e*Math.pow(2,-10*t)*Math.sin((r+t)/n))/2}return i.amplitude=function(e){return t(e,n*Zo)},i.period=function(n){return t(e,n)},i}(1,.3);function ts(t){if(!t.ok)throw new Error(t.status+" "+t.statusText);return t.blob()}var es=function(t,e){return fetch(t,e).then(ts)};function ns(t){if(!t.ok)throw new Error(t.status+" "+t.statusText);return t.arrayBuffer()}var rs=function(t,e){return fetch(t,e).then(ns)};function is(t){if(!t.ok)throw new Error(t.status+" "+t.statusText);return t.text()}var as=function(t,e){return fetch(t,e).then(is)};function os(t){return function(e,n,r){return 2===arguments.length&&"function"==typeof n&&(r=n,n=void 0),as(e,n).then((function(e){return t(e,r)}))}}function ss(t,e,n,r){3===arguments.length&&"function"==typeof n&&(r=n,n=void 0);var i=oo(t);return as(e,n).then((function(t){return i.parse(t,r)}))}var cs=os(co),us=os(vo),ls=function(t,e){return new Promise((function(n,r){var i=new Image;for(var a in e)i[a]=e[a];i.onerror=r,i.onload=function(){n(i)},i.src=t}))};function hs(t){if(!t.ok)throw new Error(t.status+" "+t.statusText);return t.json()}var fs=function(t,e){return fetch(t,e).then(hs)};function ds(t){return function(e,n){return as(e,n).then((function(e){return(new DOMParser).parseFromString(e,t)}))}}var ps=ds("application/xml"),gs=ds("text/html"),ys=ds("image/svg+xml"),vs=function(t,e){var n;function r(){var r,i,a=n.length,o=0,s=0;for(r=0;r<a;++r)o+=(i=n[r]).x,s+=i.y;for(o=o/a-t,s=s/a-e,r=0;r<a;++r)(i=n[r]).x-=o,i.y-=s}return null==t&&(t=0),null==e&&(e=0),r.initialize=function(t){n=t},r.x=function(e){return arguments.length?(t=+e,r):t},r.y=function(t){return arguments.length?(e=+t,r):e},r},ms=function(t){return function(){return t}},bs=function(){return 1e-6*(Math.random()-.5)};function xs(t,e,n,r){if(isNaN(e)||isNaN(n))return t;var i,a,o,s,c,u,l,h,f,d=t._root,p={data:r},g=t._x0,y=t._y0,v=t._x1,m=t._y1;if(!d)return t._root=p,t;for(;d.length;)if((u=e>=(a=(g+v)/2))?g=a:v=a,(l=n>=(o=(y+m)/2))?y=o:m=o,i=d,!(d=d[h=l<<1|u]))return i[h]=p,t;if(s=+t._x.call(null,d.data),c=+t._y.call(null,d.data),e===s&&n===c)return p.next=d,i?i[h]=p:t._root=p,t;do{i=i?i[h]=new Array(4):t._root=new Array(4),(u=e>=(a=(g+v)/2))?g=a:v=a,(l=n>=(o=(y+m)/2))?y=o:m=o}while((h=l<<1|u)==(f=(c>=o)<<1|s>=a));return i[f]=d,i[h]=p,t}var _s=function(t,e,n,r,i){this.node=t,this.x0=e,this.y0=n,this.x1=r,this.y1=i};function ks(t){return t[0]}function ws(t){return t[1]}function Es(t,e,n){var r=new Ts(null==e?ks:e,null==n?ws:n,NaN,NaN,NaN,NaN);return null==t?r:r.addAll(t)}function Ts(t,e,n,r,i,a){this._x=t,this._y=e,this._x0=n,this._y0=r,this._x1=i,this._y1=a,this._root=void 0}function Cs(t){for(var e={data:t.data},n=e;t=t.next;)n=n.next={data:t.data};return e}var As=Es.prototype=Ts.prototype;function Ss(t){return t.x+t.vx}function Ms(t){return t.y+t.vy}As.copy=function(){var t,e,n=new Ts(this._x,this._y,this._x0,this._y0,this._x1,this._y1),r=this._root;if(!r)return n;if(!r.length)return n._root=Cs(r),n;for(t=[{source:r,target:n._root=new Array(4)}];r=t.pop();)for(var i=0;i<4;++i)(e=r.source[i])&&(e.length?t.push({source:e,target:r.target[i]=new Array(4)}):r.target[i]=Cs(e));return n},As.add=function(t){var e=+this._x.call(null,t),n=+this._y.call(null,t);return xs(this.cover(e,n),e,n,t)},As.addAll=function(t){var e,n,r,i,a=t.length,o=new Array(a),s=new Array(a),c=1/0,u=1/0,l=-1/0,h=-1/0;for(n=0;n<a;++n)isNaN(r=+this._x.call(null,e=t[n]))||isNaN(i=+this._y.call(null,e))||(o[n]=r,s[n]=i,r<c&&(c=r),r>l&&(l=r),i<u&&(u=i),i>h&&(h=i));if(c>l||u>h)return this;for(this.cover(c,u).cover(l,h),n=0;n<a;++n)xs(this,o[n],s[n],t[n]);return this},As.cover=function(t,e){if(isNaN(t=+t)||isNaN(e=+e))return this;var n=this._x0,r=this._y0,i=this._x1,a=this._y1;if(isNaN(n))i=(n=Math.floor(t))+1,a=(r=Math.floor(e))+1;else{for(var o,s,c=i-n,u=this._root;n>t||t>=i||r>e||e>=a;)switch(s=(e<r)<<1|t<n,(o=new Array(4))[s]=u,u=o,c*=2,s){case 0:i=n+c,a=r+c;break;case 1:n=i-c,a=r+c;break;case 2:i=n+c,r=a-c;break;case 3:n=i-c,r=a-c}this._root&&this._root.length&&(this._root=u)}return this._x0=n,this._y0=r,this._x1=i,this._y1=a,this},As.data=function(){var t=[];return this.visit((function(e){if(!e.length)do{t.push(e.data)}while(e=e.next)})),t},As.extent=function(t){return arguments.length?this.cover(+t[0][0],+t[0][1]).cover(+t[1][0],+t[1][1]):isNaN(this._x0)?void 0:[[this._x0,this._y0],[this._x1,this._y1]]},As.find=function(t,e,n){var r,i,a,o,s,c,u,l=this._x0,h=this._y0,f=this._x1,d=this._y1,p=[],g=this._root;for(g&&p.push(new _s(g,l,h,f,d)),null==n?n=1/0:(l=t-n,h=e-n,f=t+n,d=e+n,n*=n);c=p.pop();)if(!(!(g=c.node)||(i=c.x0)>f||(a=c.y0)>d||(o=c.x1)<l||(s=c.y1)<h))if(g.length){var y=(i+o)/2,v=(a+s)/2;p.push(new _s(g[3],y,v,o,s),new _s(g[2],i,v,y,s),new _s(g[1],y,a,o,v),new _s(g[0],i,a,y,v)),(u=(e>=v)<<1|t>=y)&&(c=p[p.length-1],p[p.length-1]=p[p.length-1-u],p[p.length-1-u]=c)}else{var m=t-+this._x.call(null,g.data),b=e-+this._y.call(null,g.data),x=m*m+b*b;if(x<n){var _=Math.sqrt(n=x);l=t-_,h=e-_,f=t+_,d=e+_,r=g.data}}return r},As.remove=function(t){if(isNaN(a=+this._x.call(null,t))||isNaN(o=+this._y.call(null,t)))return this;var e,n,r,i,a,o,s,c,u,l,h,f,d=this._root,p=this._x0,g=this._y0,y=this._x1,v=this._y1;if(!d)return this;if(d.length)for(;;){if((u=a>=(s=(p+y)/2))?p=s:y=s,(l=o>=(c=(g+v)/2))?g=c:v=c,e=d,!(d=d[h=l<<1|u]))return this;if(!d.length)break;(e[h+1&3]||e[h+2&3]||e[h+3&3])&&(n=e,f=h)}for(;d.data!==t;)if(r=d,!(d=d.next))return this;return(i=d.next)&&delete d.next,r?(i?r.next=i:delete r.next,this):e?(i?e[h]=i:delete e[h],(d=e[0]||e[1]||e[2]||e[3])&&d===(e[3]||e[2]||e[1]||e[0])&&!d.length&&(n?n[f]=d:this._root=d),this):(this._root=i,this)},As.removeAll=function(t){for(var e=0,n=t.length;e<n;++e)this.remove(t[e]);return this},As.root=function(){return this._root},As.size=function(){var t=0;return this.visit((function(e){if(!e.length)do{++t}while(e=e.next)})),t},As.visit=function(t){var e,n,r,i,a,o,s=[],c=this._root;for(c&&s.push(new _s(c,this._x0,this._y0,this._x1,this._y1));e=s.pop();)if(!t(c=e.node,r=e.x0,i=e.y0,a=e.x1,o=e.y1)&&c.length){var u=(r+a)/2,l=(i+o)/2;(n=c[3])&&s.push(new _s(n,u,l,a,o)),(n=c[2])&&s.push(new _s(n,r,l,u,o)),(n=c[1])&&s.push(new _s(n,u,i,a,l)),(n=c[0])&&s.push(new _s(n,r,i,u,l))}return this},As.visitAfter=function(t){var e,n=[],r=[];for(this._root&&n.push(new _s(this._root,this._x0,this._y0,this._x1,this._y1));e=n.pop();){var i=e.node;if(i.length){var a,o=e.x0,s=e.y0,c=e.x1,u=e.y1,l=(o+c)/2,h=(s+u)/2;(a=i[0])&&n.push(new _s(a,o,s,l,h)),(a=i[1])&&n.push(new _s(a,l,s,c,h)),(a=i[2])&&n.push(new _s(a,o,h,l,u)),(a=i[3])&&n.push(new _s(a,l,h,c,u))}r.push(e)}for(;e=r.pop();)t(e.node,e.x0,e.y0,e.x1,e.y1);return this},As.x=function(t){return arguments.length?(this._x=t,this):this._x},As.y=function(t){return arguments.length?(this._y=t,this):this._y};var Os=function(t){var e,n,r=1,i=1;function a(){for(var t,a,s,c,u,l,h,f=e.length,d=0;d<i;++d)for(a=Es(e,Ss,Ms).visitAfter(o),t=0;t<f;++t)s=e[t],l=n[s.index],h=l*l,c=s.x+s.vx,u=s.y+s.vy,a.visit(p);function p(t,e,n,i,a){var o=t.data,f=t.r,d=l+f;if(!o)return e>c+d||i<c-d||n>u+d||a<u-d;if(o.index>s.index){var p=c-o.x-o.vx,g=u-o.y-o.vy,y=p*p+g*g;y<d*d&&(0===p&&(y+=(p=bs())*p),0===g&&(y+=(g=bs())*g),y=(d-(y=Math.sqrt(y)))/y*r,s.vx+=(p*=y)*(d=(f*=f)/(h+f)),s.vy+=(g*=y)*d,o.vx-=p*(d=1-d),o.vy-=g*d)}}}function o(t){if(t.data)return t.r=n[t.data.index];for(var e=t.r=0;e<4;++e)t[e]&&t[e].r>t.r&&(t.r=t[e].r)}function s(){if(e){var r,i,a=e.length;for(n=new Array(a),r=0;r<a;++r)i=e[r],n[i.index]=+t(i,r,e)}}return"function"!=typeof t&&(t=ms(null==t?1:+t)),a.initialize=function(t){e=t,s()},a.iterations=function(t){return arguments.length?(i=+t,a):i},a.strength=function(t){return arguments.length?(r=+t,a):r},a.radius=function(e){return arguments.length?(t="function"==typeof e?e:ms(+e),s(),a):t},a};function Ds(t){return t.index}function Ns(t,e){var n=t.get(e);if(!n)throw new Error("missing: "+e);return n}var Bs=function(t){var e,n,r,i,a,o=Ds,s=function(t){return 1/Math.min(i[t.source.index],i[t.target.index])},c=ms(30),u=1;function l(r){for(var i=0,o=t.length;i<u;++i)for(var s,c,l,h,f,d,p,g=0;g<o;++g)c=(s=t[g]).source,h=(l=s.target).x+l.vx-c.x-c.vx||bs(),f=l.y+l.vy-c.y-c.vy||bs(),h*=d=((d=Math.sqrt(h*h+f*f))-n[g])/d*r*e[g],f*=d,l.vx-=h*(p=a[g]),l.vy-=f*p,c.vx+=h*(p=1-p),c.vy+=f*p}function h(){if(r){var s,c,u=r.length,l=t.length,h=Ji(r,o);for(s=0,i=new Array(u);s<l;++s)(c=t[s]).index=s,"object"!=typeof c.source&&(c.source=Ns(h,c.source)),"object"!=typeof c.target&&(c.target=Ns(h,c.target)),i[c.source.index]=(i[c.source.index]||0)+1,i[c.target.index]=(i[c.target.index]||0)+1;for(s=0,a=new Array(l);s<l;++s)c=t[s],a[s]=i[c.source.index]/(i[c.source.index]+i[c.target.index]);e=new Array(l),f(),n=new Array(l),d()}}function f(){if(r)for(var n=0,i=t.length;n<i;++n)e[n]=+s(t[n],n,t)}function d(){if(r)for(var e=0,i=t.length;e<i;++e)n[e]=+c(t[e],e,t)}return null==t&&(t=[]),l.initialize=function(t){r=t,h()},l.links=function(e){return arguments.length?(t=e,h(),l):t},l.id=function(t){return arguments.length?(o=t,l):o},l.iterations=function(t){return arguments.length?(u=+t,l):u},l.strength=function(t){return arguments.length?(s="function"==typeof t?t:ms(+t),f(),l):s},l.distance=function(t){return arguments.length?(c="function"==typeof t?t:ms(+t),d(),l):c},l};function Ls(t){return t.x}function Ps(t){return t.y}var Is=Math.PI*(3-Math.sqrt(5)),Fs=function(t){var e,n=1,r=.001,i=1-Math.pow(r,1/300),a=0,o=.6,s=Ji(),c=Wn(l),u=lt("tick","end");function l(){h(),u.call("tick",e),n<r&&(c.stop(),u.call("end",e))}function h(r){var c,u,l=t.length;void 0===r&&(r=1);for(var h=0;h<r;++h)for(n+=(a-n)*i,s.each((function(t){t(n)})),c=0;c<l;++c)null==(u=t[c]).fx?u.x+=u.vx*=o:(u.x=u.fx,u.vx=0),null==u.fy?u.y+=u.vy*=o:(u.y=u.fy,u.vy=0);return e}function f(){for(var e,n=0,r=t.length;n<r;++n){if((e=t[n]).index=n,null!=e.fx&&(e.x=e.fx),null!=e.fy&&(e.y=e.fy),isNaN(e.x)||isNaN(e.y)){var i=10*Math.sqrt(n),a=n*Is;e.x=i*Math.cos(a),e.y=i*Math.sin(a)}(isNaN(e.vx)||isNaN(e.vy))&&(e.vx=e.vy=0)}}function d(e){return e.initialize&&e.initialize(t),e}return null==t&&(t=[]),f(),e={tick:h,restart:function(){return c.restart(l),e},stop:function(){return c.stop(),e},nodes:function(n){return arguments.length?(t=n,f(),s.each(d),e):t},alpha:function(t){return arguments.length?(n=+t,e):n},alphaMin:function(t){return arguments.length?(r=+t,e):r},alphaDecay:function(t){return arguments.length?(i=+t,e):+i},alphaTarget:function(t){return arguments.length?(a=+t,e):a},velocityDecay:function(t){return arguments.length?(o=1-t,e):1-o},force:function(t,n){return arguments.length>1?(null==n?s.remove(t):s.set(t,d(n)),e):s.get(t)},find:function(e,n,r){var i,a,o,s,c,u=0,l=t.length;for(null==r?r=1/0:r*=r,u=0;u<l;++u)(o=(i=e-(s=t[u]).x)*i+(a=n-s.y)*a)<r&&(c=s,r=o);return c},on:function(t,n){return arguments.length>1?(u.on(t,n),e):u.on(t)}}},js=function(){var t,e,n,r,i=ms(-30),a=1,o=1/0,s=.81;function c(r){var i,a=t.length,o=Es(t,Ls,Ps).visitAfter(l);for(n=r,i=0;i<a;++i)e=t[i],o.visit(h)}function u(){if(t){var e,n,a=t.length;for(r=new Array(a),e=0;e<a;++e)n=t[e],r[n.index]=+i(n,e,t)}}function l(t){var e,n,i,a,o,s=0,c=0;if(t.length){for(i=a=o=0;o<4;++o)(e=t[o])&&(n=Math.abs(e.value))&&(s+=e.value,c+=n,i+=n*e.x,a+=n*e.y);t.x=i/c,t.y=a/c}else{(e=t).x=e.data.x,e.y=e.data.y;do{s+=r[e.data.index]}while(e=e.next)}t.value=s}function h(t,i,c,u){if(!t.value)return!0;var l=t.x-e.x,h=t.y-e.y,f=u-i,d=l*l+h*h;if(f*f/s<d)return d<o&&(0===l&&(d+=(l=bs())*l),0===h&&(d+=(h=bs())*h),d<a&&(d=Math.sqrt(a*d)),e.vx+=l*t.value*n/d,e.vy+=h*t.value*n/d),!0;if(!(t.length||d>=o)){(t.data!==e||t.next)&&(0===l&&(d+=(l=bs())*l),0===h&&(d+=(h=bs())*h),d<a&&(d=Math.sqrt(a*d)));do{t.data!==e&&(f=r[t.data.index]*n/d,e.vx+=l*f,e.vy+=h*f)}while(t=t.next)}}return c.initialize=function(e){t=e,u()},c.strength=function(t){return arguments.length?(i="function"==typeof t?t:ms(+t),u(),c):i},c.distanceMin=function(t){return arguments.length?(a=t*t,c):Math.sqrt(a)},c.distanceMax=function(t){return arguments.length?(o=t*t,c):Math.sqrt(o)},c.theta=function(t){return arguments.length?(s=t*t,c):Math.sqrt(s)},c},Rs=function(t,e,n){var r,i,a,o=ms(.1);function s(t){for(var o=0,s=r.length;o<s;++o){var c=r[o],u=c.x-e||1e-6,l=c.y-n||1e-6,h=Math.sqrt(u*u+l*l),f=(a[o]-h)*i[o]*t/h;c.vx+=u*f,c.vy+=l*f}}function c(){if(r){var e,n=r.length;for(i=new Array(n),a=new Array(n),e=0;e<n;++e)a[e]=+t(r[e],e,r),i[e]=isNaN(a[e])?0:+o(r[e],e,r)}}return"function"!=typeof t&&(t=ms(+t)),null==e&&(e=0),null==n&&(n=0),s.initialize=function(t){r=t,c()},s.strength=function(t){return arguments.length?(o="function"==typeof t?t:ms(+t),c(),s):o},s.radius=function(e){return arguments.length?(t="function"==typeof e?e:ms(+e),c(),s):t},s.x=function(t){return arguments.length?(e=+t,s):e},s.y=function(t){return arguments.length?(n=+t,s):n},s},Ys=function(t){var e,n,r,i=ms(.1);function a(t){for(var i,a=0,o=e.length;a<o;++a)(i=e[a]).vx+=(r[a]-i.x)*n[a]*t}function o(){if(e){var a,o=e.length;for(n=new Array(o),r=new Array(o),a=0;a<o;++a)n[a]=isNaN(r[a]=+t(e[a],a,e))?0:+i(e[a],a,e)}}return"function"!=typeof t&&(t=ms(null==t?0:+t)),a.initialize=function(t){e=t,o()},a.strength=function(t){return arguments.length?(i="function"==typeof t?t:ms(+t),o(),a):i},a.x=function(e){return arguments.length?(t="function"==typeof e?e:ms(+e),o(),a):t},a},zs=function(t){var e,n,r,i=ms(.1);function a(t){for(var i,a=0,o=e.length;a<o;++a)(i=e[a]).vy+=(r[a]-i.y)*n[a]*t}function o(){if(e){var a,o=e.length;for(n=new Array(o),r=new Array(o),a=0;a<o;++a)n[a]=isNaN(r[a]=+t(e[a],a,e))?0:+i(e[a],a,e)}}return"function"!=typeof t&&(t=ms(null==t?0:+t)),a.initialize=function(t){e=t,o()},a.strength=function(t){return arguments.length?(i="function"==typeof t?t:ms(+t),o(),a):i},a.y=function(e){return arguments.length?(t="function"==typeof e?e:ms(+e),o(),a):t},a},Us=function(t,e){if((n=(t=e?t.toExponential(e-1):t.toExponential()).indexOf("e"))<0)return null;var n,r=t.slice(0,n);return[r.length>1?r[0]+r.slice(2):r,+t.slice(n+1)]},$s=function(t){return(t=Us(Math.abs(t)))?t[1]:NaN},Ws=/^(?:(.)?([<>=^]))?([+\-( ])?([$#])?(0)?(\d+)?(,)?(\.\d+)?(~)?([a-z%])?$/i;function Hs(t){if(!(e=Ws.exec(t)))throw new Error("invalid format: "+t);var e;return new Vs({fill:e[1],align:e[2],sign:e[3],symbol:e[4],zero:e[5],width:e[6],comma:e[7],precision:e[8]&&e[8].slice(1),trim:e[9],type:e[10]})}function Vs(t){this.fill=void 0===t.fill?" ":t.fill+"",this.align=void 0===t.align?">":t.align+"",this.sign=void 0===t.sign?"-":t.sign+"",this.symbol=void 0===t.symbol?"":t.symbol+"",this.zero=!!t.zero,this.width=void 0===t.width?void 0:+t.width,this.comma=!!t.comma,this.precision=void 0===t.precision?void 0:+t.precision,this.trim=!!t.trim,this.type=void 0===t.type?"":t.type+""}Hs.prototype=Vs.prototype,Vs.prototype.toString=function(){return this.fill+this.align+this.sign+this.symbol+(this.zero?"0":"")+(void 0===this.width?"":Math.max(1,0|this.width))+(this.comma?",":"")+(void 0===this.precision?"":"."+Math.max(0,0|this.precision))+(this.trim?"~":"")+this.type};var Gs,qs,Xs,Zs,Js=function(t,e){var n=Us(t,e);if(!n)return t+"";var r=n[0],i=n[1];return i<0?"0."+new Array(-i).join("0")+r:r.length>i+1?r.slice(0,i+1)+"."+r.slice(i+1):r+new Array(i-r.length+2).join("0")},Ks={"%":function(t,e){return(100*t).toFixed(e)},b:function(t){return Math.round(t).toString(2)},c:function(t){return t+""},d:function(t){return Math.round(t).toString(10)},e:function(t,e){return t.toExponential(e)},f:function(t,e){return t.toFixed(e)},g:function(t,e){return t.toPrecision(e)},o:function(t){return Math.round(t).toString(8)},p:function(t,e){return Js(100*t,e)},r:Js,s:function(t,e){var n=Us(t,e);if(!n)return t+"";var r=n[0],i=n[1],a=i-(Gs=3*Math.max(-8,Math.min(8,Math.floor(i/3))))+1,o=r.length;return a===o?r:a>o?r+new Array(a-o+1).join("0"):a>0?r.slice(0,a)+"."+r.slice(a):"0."+new Array(1-a).join("0")+Us(t,Math.max(0,e+a-1))[0]},X:function(t){return Math.round(t).toString(16).toUpperCase()},x:function(t){return Math.round(t).toString(16)}},Qs=function(t){return t},tc=Array.prototype.map,ec=["y","z","a","f","p","n","µ","m","","k","M","G","T","P","E","Z","Y"],nc=function(t){var e,n,r=void 0===t.grouping||void 0===t.thousands?Qs:(e=tc.call(t.grouping,Number),n=t.thousands+"",function(t,r){for(var i=t.length,a=[],o=0,s=e[0],c=0;i>0&&s>0&&(c+s+1>r&&(s=Math.max(1,r-c)),a.push(t.substring(i-=s,i+s)),!((c+=s+1)>r));)s=e[o=(o+1)%e.length];return a.reverse().join(n)}),i=void 0===t.currency?"":t.currency[0]+"",a=void 0===t.currency?"":t.currency[1]+"",o=void 0===t.decimal?".":t.decimal+"",s=void 0===t.numerals?Qs:function(t){return function(e){return e.replace(/[0-9]/g,(function(e){return t[+e]}))}}(tc.call(t.numerals,String)),c=void 0===t.percent?"%":t.percent+"",u=void 0===t.minus?"-":t.minus+"",l=void 0===t.nan?"NaN":t.nan+"";function h(t){var e=(t=Hs(t)).fill,n=t.align,h=t.sign,f=t.symbol,d=t.zero,p=t.width,g=t.comma,y=t.precision,v=t.trim,m=t.type;"n"===m?(g=!0,m="g"):Ks[m]||(void 0===y&&(y=12),v=!0,m="g"),(d||"0"===e&&"="===n)&&(d=!0,e="0",n="=");var b="$"===f?i:"#"===f&&/[boxX]/.test(m)?"0"+m.toLowerCase():"",x="$"===f?a:/[%p]/.test(m)?c:"",_=Ks[m],k=/[defgprs%]/.test(m);function w(t){var i,a,c,f=b,w=x;if("c"===m)w=_(t)+w,t="";else{var E=(t=+t)<0;if(t=isNaN(t)?l:_(Math.abs(t),y),v&&(t=function(t){t:for(var e,n=t.length,r=1,i=-1;r<n;++r)switch(t[r]){case".":i=e=r;break;case"0":0===i&&(i=r),e=r;break;default:if(!+t[r])break t;i>0&&(i=0)}return i>0?t.slice(0,i)+t.slice(e+1):t}(t)),E&&0==+t&&(E=!1),f=(E?"("===h?h:u:"-"===h||"("===h?"":h)+f,w=("s"===m?ec[8+Gs/3]:"")+w+(E&&"("===h?")":""),k)for(i=-1,a=t.length;++i<a;)if(48>(c=t.charCodeAt(i))||c>57){w=(46===c?o+t.slice(i+1):t.slice(i))+w,t=t.slice(0,i);break}}g&&!d&&(t=r(t,1/0));var T=f.length+t.length+w.length,C=T<p?new Array(p-T+1).join(e):"";switch(g&&d&&(t=r(C+t,C.length?p-w.length:1/0),C=""),n){case"<":t=f+t+w+C;break;case"=":t=f+C+t+w;break;case"^":t=C.slice(0,T=C.length>>1)+f+t+w+C.slice(T);break;default:t=C+f+t+w}return s(t)}return y=void 0===y?6:/[gprs]/.test(m)?Math.max(1,Math.min(21,y)):Math.max(0,Math.min(20,y)),w.toString=function(){return t+""},w}return{format:h,formatPrefix:function(t,e){var n=h(((t=Hs(t)).type="f",t)),r=3*Math.max(-8,Math.min(8,Math.floor($s(e)/3))),i=Math.pow(10,-r),a=ec[8+r/3];return function(t){return n(i*t)+a}}}};function rc(t){return qs=nc(t),Xs=qs.format,Zs=qs.formatPrefix,qs}rc({decimal:".",thousands:",",grouping:[3],currency:["$",""],minus:"-"});var ic=function(t){return Math.max(0,-$s(Math.abs(t)))},ac=function(t,e){return Math.max(0,3*Math.max(-8,Math.min(8,Math.floor($s(e)/3)))-$s(Math.abs(t)))},oc=function(t,e){return t=Math.abs(t),e=Math.abs(e)-t,Math.max(0,$s(e)-$s(t))+1},sc=function(){return new cc};function cc(){this.reset()}cc.prototype={constructor:cc,reset:function(){this.s=this.t=0},add:function(t){lc(uc,t,this.t),lc(this,uc.s,this.s),this.s?this.t+=uc.t:this.s=uc.t},valueOf:function(){return this.s}};var uc=new cc;function lc(t,e,n){var r=t.s=e+n,i=r-e,a=r-i;t.t=e-a+(n-i)}var hc=Math.PI,fc=hc/2,dc=hc/4,pc=2*hc,gc=180/hc,yc=hc/180,vc=Math.abs,mc=Math.atan,bc=Math.atan2,xc=Math.cos,_c=Math.ceil,kc=Math.exp,wc=(Math.floor,Math.log),Ec=Math.pow,Tc=Math.sin,Cc=Math.sign||function(t){return t>0?1:t<0?-1:0},Ac=Math.sqrt,Sc=Math.tan;function Mc(t){return t>1?0:t<-1?hc:Math.acos(t)}function Oc(t){return t>1?fc:t<-1?-fc:Math.asin(t)}function Dc(t){return(t=Tc(t/2))*t}function Nc(){}function Bc(t,e){t&&Pc.hasOwnProperty(t.type)&&Pc[t.type](t,e)}var Lc={Feature:function(t,e){Bc(t.geometry,e)},FeatureCollection:function(t,e){for(var n=t.features,r=-1,i=n.length;++r<i;)Bc(n[r].geometry,e)}},Pc={Sphere:function(t,e){e.sphere()},Point:function(t,e){t=t.coordinates,e.point(t[0],t[1],t[2])},MultiPoint:function(t,e){for(var n=t.coordinates,r=-1,i=n.length;++r<i;)t=n[r],e.point(t[0],t[1],t[2])},LineString:function(t,e){Ic(t.coordinates,e,0)},MultiLineString:function(t,e){for(var n=t.coordinates,r=-1,i=n.length;++r<i;)Ic(n[r],e,0)},Polygon:function(t,e){Fc(t.coordinates,e)},MultiPolygon:function(t,e){for(var n=t.coordinates,r=-1,i=n.length;++r<i;)Fc(n[r],e)},GeometryCollection:function(t,e){for(var n=t.geometries,r=-1,i=n.length;++r<i;)Bc(n[r],e)}};function Ic(t,e,n){var r,i=-1,a=t.length-n;for(e.lineStart();++i<a;)r=t[i],e.point(r[0],r[1],r[2]);e.lineEnd()}function Fc(t,e){var n=-1,r=t.length;for(e.polygonStart();++n<r;)Ic(t[n],e,1);e.polygonEnd()}var jc,Rc,Yc,zc,Uc,$c=function(t,e){t&&Lc.hasOwnProperty(t.type)?Lc[t.type](t,e):Bc(t,e)},Wc=sc(),Hc=sc(),Vc={point:Nc,lineStart:Nc,lineEnd:Nc,polygonStart:function(){Wc.reset(),Vc.lineStart=Gc,Vc.lineEnd=qc},polygonEnd:function(){var t=+Wc;Hc.add(t<0?pc+t:t),this.lineStart=this.lineEnd=this.point=Nc},sphere:function(){Hc.add(pc)}};function Gc(){Vc.point=Xc}function qc(){Zc(jc,Rc)}function Xc(t,e){Vc.point=Zc,jc=t,Rc=e,Yc=t*=yc,zc=xc(e=(e*=yc)/2+dc),Uc=Tc(e)}function Zc(t,e){var n=(t*=yc)-Yc,r=n>=0?1:-1,i=r*n,a=xc(e=(e*=yc)/2+dc),o=Tc(e),s=Uc*o,c=zc*a+s*xc(i),u=s*r*Tc(i);Wc.add(bc(u,c)),Yc=t,zc=a,Uc=o}var Jc=function(t){return Hc.reset(),$c(t,Vc),2*Hc};function Kc(t){return[bc(t[1],t[0]),Oc(t[2])]}function Qc(t){var e=t[0],n=t[1],r=xc(n);return[r*xc(e),r*Tc(e),Tc(n)]}function tu(t,e){return t[0]*e[0]+t[1]*e[1]+t[2]*e[2]}function eu(t,e){return[t[1]*e[2]-t[2]*e[1],t[2]*e[0]-t[0]*e[2],t[0]*e[1]-t[1]*e[0]]}function nu(t,e){t[0]+=e[0],t[1]+=e[1],t[2]+=e[2]}function ru(t,e){return[t[0]*e,t[1]*e,t[2]*e]}function iu(t){var e=Ac(t[0]*t[0]+t[1]*t[1]+t[2]*t[2]);t[0]/=e,t[1]/=e,t[2]/=e}var au,ou,su,cu,uu,lu,hu,fu,du,pu,gu=sc(),yu={point:vu,lineStart:bu,lineEnd:xu,polygonStart:function(){yu.point=_u,yu.lineStart=ku,yu.lineEnd=wu,gu.reset(),Vc.polygonStart()},polygonEnd:function(){Vc.polygonEnd(),yu.point=vu,yu.lineStart=bu,yu.lineEnd=xu,Wc<0?(au=-(su=180),ou=-(cu=90)):gu>1e-6?cu=90:gu<-1e-6&&(ou=-90),pu[0]=au,pu[1]=su},sphere:function(){au=-(su=180),ou=-(cu=90)}};function vu(t,e){du.push(pu=[au=t,su=t]),e<ou&&(ou=e),e>cu&&(cu=e)}function mu(t,e){var n=Qc([t*yc,e*yc]);if(fu){var r=eu(fu,n),i=eu([r[1],-r[0],0],r);iu(i),i=Kc(i);var a,o=t-uu,s=o>0?1:-1,c=i[0]*gc*s,u=vc(o)>180;u^(s*uu<c&&c<s*t)?(a=i[1]*gc)>cu&&(cu=a):u^(s*uu<(c=(c+360)%360-180)&&c<s*t)?(a=-i[1]*gc)<ou&&(ou=a):(e<ou&&(ou=e),e>cu&&(cu=e)),u?t<uu?Eu(au,t)>Eu(au,su)&&(su=t):Eu(t,su)>Eu(au,su)&&(au=t):su>=au?(t<au&&(au=t),t>su&&(su=t)):t>uu?Eu(au,t)>Eu(au,su)&&(su=t):Eu(t,su)>Eu(au,su)&&(au=t)}else du.push(pu=[au=t,su=t]);e<ou&&(ou=e),e>cu&&(cu=e),fu=n,uu=t}function bu(){yu.point=mu}function xu(){pu[0]=au,pu[1]=su,yu.point=vu,fu=null}function _u(t,e){if(fu){var n=t-uu;gu.add(vc(n)>180?n+(n>0?360:-360):n)}else lu=t,hu=e;Vc.point(t,e),mu(t,e)}function ku(){Vc.lineStart()}function wu(){_u(lu,hu),Vc.lineEnd(),vc(gu)>1e-6&&(au=-(su=180)),pu[0]=au,pu[1]=su,fu=null}function Eu(t,e){return(e-=t)<0?e+360:e}function Tu(t,e){return t[0]-e[0]}function Cu(t,e){return t[0]<=t[1]?t[0]<=e&&e<=t[1]:e<t[0]||t[1]<e}var Au,Su,Mu,Ou,Du,Nu,Bu,Lu,Pu,Iu,Fu,ju,Ru,Yu,zu,Uu,$u=function(t){var e,n,r,i,a,o,s;if(cu=su=-(au=ou=1/0),du=[],$c(t,yu),n=du.length){for(du.sort(Tu),e=1,a=[r=du[0]];e<n;++e)Cu(r,(i=du[e])[0])||Cu(r,i[1])?(Eu(r[0],i[1])>Eu(r[0],r[1])&&(r[1]=i[1]),Eu(i[0],r[1])>Eu(r[0],r[1])&&(r[0]=i[0])):a.push(r=i);for(o=-1/0,e=0,r=a[n=a.length-1];e<=n;r=i,++e)i=a[e],(s=Eu(r[1],i[0]))>o&&(o=s,au=i[0],su=r[1])}return du=pu=null,au===1/0||ou===1/0?[[NaN,NaN],[NaN,NaN]]:[[au,ou],[su,cu]]},Wu={sphere:Nc,point:Hu,lineStart:Gu,lineEnd:Zu,polygonStart:function(){Wu.lineStart=Ju,Wu.lineEnd=Ku},polygonEnd:function(){Wu.lineStart=Gu,Wu.lineEnd=Zu}};function Hu(t,e){t*=yc;var n=xc(e*=yc);Vu(n*xc(t),n*Tc(t),Tc(e))}function Vu(t,e,n){++Au,Mu+=(t-Mu)/Au,Ou+=(e-Ou)/Au,Du+=(n-Du)/Au}function Gu(){Wu.point=qu}function qu(t,e){t*=yc;var n=xc(e*=yc);Yu=n*xc(t),zu=n*Tc(t),Uu=Tc(e),Wu.point=Xu,Vu(Yu,zu,Uu)}function Xu(t,e){t*=yc;var n=xc(e*=yc),r=n*xc(t),i=n*Tc(t),a=Tc(e),o=bc(Ac((o=zu*a-Uu*i)*o+(o=Uu*r-Yu*a)*o+(o=Yu*i-zu*r)*o),Yu*r+zu*i+Uu*a);Su+=o,Nu+=o*(Yu+(Yu=r)),Bu+=o*(zu+(zu=i)),Lu+=o*(Uu+(Uu=a)),Vu(Yu,zu,Uu)}function Zu(){Wu.point=Hu}function Ju(){Wu.point=Qu}function Ku(){tl(ju,Ru),Wu.point=Hu}function Qu(t,e){ju=t,Ru=e,t*=yc,e*=yc,Wu.point=tl;var n=xc(e);Yu=n*xc(t),zu=n*Tc(t),Uu=Tc(e),Vu(Yu,zu,Uu)}function tl(t,e){t*=yc;var n=xc(e*=yc),r=n*xc(t),i=n*Tc(t),a=Tc(e),o=zu*a-Uu*i,s=Uu*r-Yu*a,c=Yu*i-zu*r,u=Ac(o*o+s*s+c*c),l=Oc(u),h=u&&-l/u;Pu+=h*o,Iu+=h*s,Fu+=h*c,Su+=l,Nu+=l*(Yu+(Yu=r)),Bu+=l*(zu+(zu=i)),Lu+=l*(Uu+(Uu=a)),Vu(Yu,zu,Uu)}var el=function(t){Au=Su=Mu=Ou=Du=Nu=Bu=Lu=Pu=Iu=Fu=0,$c(t,Wu);var e=Pu,n=Iu,r=Fu,i=e*e+n*n+r*r;return i<1e-12&&(e=Nu,n=Bu,r=Lu,Su<1e-6&&(e=Mu,n=Ou,r=Du),(i=e*e+n*n+r*r)<1e-12)?[NaN,NaN]:[bc(n,e)*gc,Oc(r/Ac(i))*gc]},nl=function(t){return function(){return t}},rl=function(t,e){function n(n,r){return n=t(n,r),e(n[0],n[1])}return t.invert&&e.invert&&(n.invert=function(n,r){return(n=e.invert(n,r))&&t.invert(n[0],n[1])}),n};function il(t,e){return[vc(t)>hc?t+Math.round(-t/pc)*pc:t,e]}function al(t,e,n){return(t%=pc)?e||n?rl(sl(t),cl(e,n)):sl(t):e||n?cl(e,n):il}function ol(t){return function(e,n){return[(e+=t)>hc?e-pc:e<-hc?e+pc:e,n]}}function sl(t){var e=ol(t);return e.invert=ol(-t),e}function cl(t,e){var n=xc(t),r=Tc(t),i=xc(e),a=Tc(e);function o(t,e){var o=xc(e),s=xc(t)*o,c=Tc(t)*o,u=Tc(e),l=u*n+s*r;return[bc(c*i-l*a,s*n-u*r),Oc(l*i+c*a)]}return o.invert=function(t,e){var o=xc(e),s=xc(t)*o,c=Tc(t)*o,u=Tc(e),l=u*i-c*a;return[bc(c*i+u*a,s*n+l*r),Oc(l*n-s*r)]},o}il.invert=il;var ul=function(t){function e(e){return(e=t(e[0]*yc,e[1]*yc))[0]*=gc,e[1]*=gc,e}return t=al(t[0]*yc,t[1]*yc,t.length>2?t[2]*yc:0),e.invert=function(e){return(e=t.invert(e[0]*yc,e[1]*yc))[0]*=gc,e[1]*=gc,e},e};function ll(t,e,n,r,i,a){if(n){var o=xc(e),s=Tc(e),c=r*n;null==i?(i=e+r*pc,a=e-c/2):(i=hl(o,i),a=hl(o,a),(r>0?i<a:i>a)&&(i+=r*pc));for(var u,l=i;r>0?l>a:l<a;l-=c)u=Kc([o,-s*xc(l),-s*Tc(l)]),t.point(u[0],u[1])}}function hl(t,e){(e=Qc(e))[0]-=t,iu(e);var n=Mc(-e[1]);return((-e[2]<0?-n:n)+pc-1e-6)%pc}var fl=function(){var t,e,n=nl([0,0]),r=nl(90),i=nl(6),a={point:function(n,r){t.push(n=e(n,r)),n[0]*=gc,n[1]*=gc}};function o(){var o=n.apply(this,arguments),s=r.apply(this,arguments)*yc,c=i.apply(this,arguments)*yc;return t=[],e=al(-o[0]*yc,-o[1]*yc,0).invert,ll(a,s,c,1),o={type:"Polygon",coordinates:[t]},t=e=null,o}return o.center=function(t){return arguments.length?(n="function"==typeof t?t:nl([+t[0],+t[1]]),o):n},o.radius=function(t){return arguments.length?(r="function"==typeof t?t:nl(+t),o):r},o.precision=function(t){return arguments.length?(i="function"==typeof t?t:nl(+t),o):i},o},dl=function(){var t,e=[];return{point:function(e,n){t.push([e,n])},lineStart:function(){e.push(t=[])},lineEnd:Nc,rejoin:function(){e.length>1&&e.push(e.pop().concat(e.shift()))},result:function(){var n=e;return e=[],t=null,n}}},pl=function(t,e){return vc(t[0]-e[0])<1e-6&&vc(t[1]-e[1])<1e-6};function gl(t,e,n,r){this.x=t,this.z=e,this.o=n,this.e=r,this.v=!1,this.n=this.p=null}var yl=function(t,e,n,r,i){var a,o,s=[],c=[];if(t.forEach((function(t){if(!((e=t.length-1)<=0)){var e,n,r=t[0],o=t[e];if(pl(r,o)){for(i.lineStart(),a=0;a<e;++a)i.point((r=t[a])[0],r[1]);i.lineEnd()}else s.push(n=new gl(r,t,null,!0)),c.push(n.o=new gl(r,null,n,!1)),s.push(n=new gl(o,t,null,!1)),c.push(n.o=new gl(o,null,n,!0))}})),s.length){for(c.sort(e),vl(s),vl(c),a=0,o=c.length;a<o;++a)c[a].e=n=!n;for(var u,l,h=s[0];;){for(var f=h,d=!0;f.v;)if((f=f.n)===h)return;u=f.z,i.lineStart();do{if(f.v=f.o.v=!0,f.e){if(d)for(a=0,o=u.length;a<o;++a)i.point((l=u[a])[0],l[1]);else r(f.x,f.n.x,1,i);f=f.n}else{if(d)for(u=f.p.z,a=u.length-1;a>=0;--a)i.point((l=u[a])[0],l[1]);else r(f.x,f.p.x,-1,i);f=f.p}u=(f=f.o).z,d=!d}while(!f.v);i.lineEnd()}}};function vl(t){if(e=t.length){for(var e,n,r=0,i=t[0];++r<e;)i.n=n=t[r],n.p=i,i=n;i.n=n=t[0],n.p=i}}var ml=sc();function bl(t){return vc(t[0])<=hc?t[0]:Cc(t[0])*((vc(t[0])+hc)%pc-hc)}var xl=function(t,e){var n=bl(e),r=e[1],i=Tc(r),a=[Tc(n),-xc(n),0],o=0,s=0;ml.reset(),1===i?r=fc+1e-6:-1===i&&(r=-fc-1e-6);for(var c=0,u=t.length;c<u;++c)if(h=(l=t[c]).length)for(var l,h,f=l[h-1],d=bl(f),p=f[1]/2+dc,g=Tc(p),y=xc(p),v=0;v<h;++v,d=b,g=_,y=k,f=m){var m=l[v],b=bl(m),x=m[1]/2+dc,_=Tc(x),k=xc(x),w=b-d,E=w>=0?1:-1,T=E*w,C=T>hc,A=g*_;if(ml.add(bc(A*E*Tc(T),y*k+A*xc(T))),o+=C?w+E*pc:w,C^d>=n^b>=n){var S=eu(Qc(f),Qc(m));iu(S);var M=eu(a,S);iu(M);var O=(C^w>=0?-1:1)*Oc(M[2]);(r>O||r===O&&(S[0]||S[1]))&&(s+=C^w>=0?1:-1)}}return(o<-1e-6||o<1e-6&&ml<-1e-6)^1&s},_l=function(t,e,n,r){return function(i){var a,o,s,c=e(i),u=dl(),l=e(u),h=!1,f={point:d,lineStart:g,lineEnd:y,polygonStart:function(){f.point=v,f.lineStart=m,f.lineEnd=b,o=[],a=[]},polygonEnd:function(){f.point=d,f.lineStart=g,f.lineEnd=y,o=F(o);var t=xl(a,r);o.length?(h||(i.polygonStart(),h=!0),yl(o,wl,t,n,i)):t&&(h||(i.polygonStart(),h=!0),i.lineStart(),n(null,null,1,i),i.lineEnd()),h&&(i.polygonEnd(),h=!1),o=a=null},sphere:function(){i.polygonStart(),i.lineStart(),n(null,null,1,i),i.lineEnd(),i.polygonEnd()}};function d(e,n){t(e,n)&&i.point(e,n)}function p(t,e){c.point(t,e)}function g(){f.point=p,c.lineStart()}function y(){f.point=d,c.lineEnd()}function v(t,e){s.push([t,e]),l.point(t,e)}function m(){l.lineStart(),s=[]}function b(){v(s[0][0],s[0][1]),l.lineEnd();var t,e,n,r,c=l.clean(),f=u.result(),d=f.length;if(s.pop(),a.push(s),s=null,d)if(1&c){if((e=(n=f[0]).length-1)>0){for(h||(i.polygonStart(),h=!0),i.lineStart(),t=0;t<e;++t)i.point((r=n[t])[0],r[1]);i.lineEnd()}}else d>1&&2&c&&f.push(f.pop().concat(f.shift())),o.push(f.filter(kl))}return f}};function kl(t){return t.length>1}function wl(t,e){return((t=t.x)[0]<0?t[1]-fc-1e-6:fc-t[1])-((e=e.x)[0]<0?e[1]-fc-1e-6:fc-e[1])}var El=_l((function(){return!0}),(function(t){var e,n=NaN,r=NaN,i=NaN;return{lineStart:function(){t.lineStart(),e=1},point:function(a,o){var s=a>0?hc:-hc,c=vc(a-n);vc(c-hc)<1e-6?(t.point(n,r=(r+o)/2>0?fc:-fc),t.point(i,r),t.lineEnd(),t.lineStart(),t.point(s,r),t.point(a,r),e=0):i!==s&&c>=hc&&(vc(n-i)<1e-6&&(n-=1e-6*i),vc(a-s)<1e-6&&(a-=1e-6*s),r=function(t,e,n,r){var i,a,o=Tc(t-n);return vc(o)>1e-6?mc((Tc(e)*(a=xc(r))*Tc(n)-Tc(r)*(i=xc(e))*Tc(t))/(i*a*o)):(e+r)/2}(n,r,a,o),t.point(i,r),t.lineEnd(),t.lineStart(),t.point(s,r),e=0),t.point(n=a,r=o),i=s},lineEnd:function(){t.lineEnd(),n=r=NaN},clean:function(){return 2-e}}}),(function(t,e,n,r){var i;if(null==t)i=n*fc,r.point(-hc,i),r.point(0,i),r.point(hc,i),r.point(hc,0),r.point(hc,-i),r.point(0,-i),r.point(-hc,-i),r.point(-hc,0),r.point(-hc,i);else if(vc(t[0]-e[0])>1e-6){var a=t[0]<e[0]?hc:-hc;i=n*a/2,r.point(-a,i),r.point(0,i),r.point(a,i)}else r.point(e[0],e[1])}),[-hc,-fc]);var Tl=function(t){var e=xc(t),n=6*yc,r=e>0,i=vc(e)>1e-6;function a(t,n){return xc(t)*xc(n)>e}function o(t,n,r){var i=[1,0,0],a=eu(Qc(t),Qc(n)),o=tu(a,a),s=a[0],c=o-s*s;if(!c)return!r&&t;var u=e*o/c,l=-e*s/c,h=eu(i,a),f=ru(i,u);nu(f,ru(a,l));var d=h,p=tu(f,d),g=tu(d,d),y=p*p-g*(tu(f,f)-1);if(!(y<0)){var v=Ac(y),m=ru(d,(-p-v)/g);if(nu(m,f),m=Kc(m),!r)return m;var b,x=t[0],_=n[0],k=t[1],w=n[1];_<x&&(b=x,x=_,_=b);var E=_-x,T=vc(E-hc)<1e-6;if(!T&&w<k&&(b=k,k=w,w=b),T||E<1e-6?T?k+w>0^m[1]<(vc(m[0]-x)<1e-6?k:w):k<=m[1]&&m[1]<=w:E>hc^(x<=m[0]&&m[0]<=_)){var C=ru(d,(-p+v)/g);return nu(C,f),[m,Kc(C)]}}}function s(e,n){var i=r?t:hc-t,a=0;return e<-i?a|=1:e>i&&(a|=2),n<-i?a|=4:n>i&&(a|=8),a}return _l(a,(function(t){var e,n,c,u,l;return{lineStart:function(){u=c=!1,l=1},point:function(h,f){var d,p=[h,f],g=a(h,f),y=r?g?0:s(h,f):g?s(h+(h<0?hc:-hc),f):0;if(!e&&(u=c=g)&&t.lineStart(),g!==c&&(!(d=o(e,p))||pl(e,d)||pl(p,d))&&(p[0]+=1e-6,p[1]+=1e-6,g=a(p[0],p[1])),g!==c)l=0,g?(t.lineStart(),d=o(p,e),t.point(d[0],d[1])):(d=o(e,p),t.point(d[0],d[1]),t.lineEnd()),e=d;else if(i&&e&&r^g){var v;y&n||!(v=o(p,e,!0))||(l=0,r?(t.lineStart(),t.point(v[0][0],v[0][1]),t.point(v[1][0],v[1][1]),t.lineEnd()):(t.point(v[1][0],v[1][1]),t.lineEnd(),t.lineStart(),t.point(v[0][0],v[0][1])))}!g||e&&pl(e,p)||t.point(p[0],p[1]),e=p,c=g,n=y},lineEnd:function(){c&&t.lineEnd(),e=null},clean:function(){return l|(u&&c)<<1}}}),(function(e,r,i,a){ll(a,t,n,i,e,r)}),r?[0,-t]:[-hc,t-hc])};function Cl(t,e,n,r){function i(i,a){return t<=i&&i<=n&&e<=a&&a<=r}function a(i,a,s,u){var l=0,h=0;if(null==i||(l=o(i,s))!==(h=o(a,s))||c(i,a)<0^s>0)do{u.point(0===l||3===l?t:n,l>1?r:e)}while((l=(l+s+4)%4)!==h);else u.point(a[0],a[1])}function o(r,i){return vc(r[0]-t)<1e-6?i>0?0:3:vc(r[0]-n)<1e-6?i>0?2:1:vc(r[1]-e)<1e-6?i>0?1:0:i>0?3:2}function s(t,e){return c(t.x,e.x)}function c(t,e){var n=o(t,1),r=o(e,1);return n!==r?n-r:0===n?e[1]-t[1]:1===n?t[0]-e[0]:2===n?t[1]-e[1]:e[0]-t[0]}return function(o){var c,u,l,h,f,d,p,g,y,v,m,b=o,x=dl(),_={point:k,lineStart:function(){_.point=w,u&&u.push(l=[]);v=!0,y=!1,p=g=NaN},lineEnd:function(){c&&(w(h,f),d&&y&&x.rejoin(),c.push(x.result()));_.point=k,y&&b.lineEnd()},polygonStart:function(){b=x,c=[],u=[],m=!0},polygonEnd:function(){var e=function(){for(var e=0,n=0,i=u.length;n<i;++n)for(var a,o,s=u[n],c=1,l=s.length,h=s[0],f=h[0],d=h[1];c<l;++c)a=f,o=d,h=s[c],f=h[0],d=h[1],o<=r?d>r&&(f-a)*(r-o)>(d-o)*(t-a)&&++e:d<=r&&(f-a)*(r-o)<(d-o)*(t-a)&&--e;return e}(),n=m&&e,i=(c=F(c)).length;(n||i)&&(o.polygonStart(),n&&(o.lineStart(),a(null,null,1,o),o.lineEnd()),i&&yl(c,s,e,a,o),o.polygonEnd());b=o,c=u=l=null}};function k(t,e){i(t,e)&&b.point(t,e)}function w(a,o){var s=i(a,o);if(u&&l.push([a,o]),v)h=a,f=o,d=s,v=!1,s&&(b.lineStart(),b.point(a,o));else if(s&&y)b.point(a,o);else{var c=[p=Math.max(-1e9,Math.min(1e9,p)),g=Math.max(-1e9,Math.min(1e9,g))],x=[a=Math.max(-1e9,Math.min(1e9,a)),o=Math.max(-1e9,Math.min(1e9,o))];!function(t,e,n,r,i,a){var o,s=t[0],c=t[1],u=0,l=1,h=e[0]-s,f=e[1]-c;if(o=n-s,h||!(o>0)){if(o/=h,h<0){if(o<u)return;o<l&&(l=o)}else if(h>0){if(o>l)return;o>u&&(u=o)}if(o=i-s,h||!(o<0)){if(o/=h,h<0){if(o>l)return;o>u&&(u=o)}else if(h>0){if(o<u)return;o<l&&(l=o)}if(o=r-c,f||!(o>0)){if(o/=f,f<0){if(o<u)return;o<l&&(l=o)}else if(f>0){if(o>l)return;o>u&&(u=o)}if(o=a-c,f||!(o<0)){if(o/=f,f<0){if(o>l)return;o>u&&(u=o)}else if(f>0){if(o<u)return;o<l&&(l=o)}return u>0&&(t[0]=s+u*h,t[1]=c+u*f),l<1&&(e[0]=s+l*h,e[1]=c+l*f),!0}}}}}(c,x,t,e,n,r)?s&&(b.lineStart(),b.point(a,o),m=!1):(y||(b.lineStart(),b.point(c[0],c[1])),b.point(x[0],x[1]),s||b.lineEnd(),m=!1)}p=a,g=o,y=s}return _}}var Al,Sl,Ml,Ol=function(){var t,e,n,r=0,i=0,a=960,o=500;return n={stream:function(n){return t&&e===n?t:t=Cl(r,i,a,o)(e=n)},extent:function(s){return arguments.length?(r=+s[0][0],i=+s[0][1],a=+s[1][0],o=+s[1][1],t=e=null,n):[[r,i],[a,o]]}}},Dl=sc(),Nl={sphere:Nc,point:Nc,lineStart:function(){Nl.point=Ll,Nl.lineEnd=Bl},lineEnd:Nc,polygonStart:Nc,polygonEnd:Nc};function Bl(){Nl.point=Nl.lineEnd=Nc}function Ll(t,e){Al=t*=yc,Sl=Tc(e*=yc),Ml=xc(e),Nl.point=Pl}function Pl(t,e){t*=yc;var n=Tc(e*=yc),r=xc(e),i=vc(t-Al),a=xc(i),o=r*Tc(i),s=Ml*n-Sl*r*a,c=Sl*n+Ml*r*a;Dl.add(bc(Ac(o*o+s*s),c)),Al=t,Sl=n,Ml=r}var Il=function(t){return Dl.reset(),$c(t,Nl),+Dl},Fl=[null,null],jl={type:"LineString",coordinates:Fl},Rl=function(t,e){return Fl[0]=t,Fl[1]=e,Il(jl)},Yl={Feature:function(t,e){return Ul(t.geometry,e)},FeatureCollection:function(t,e){for(var n=t.features,r=-1,i=n.length;++r<i;)if(Ul(n[r].geometry,e))return!0;return!1}},zl={Sphere:function(){return!0},Point:function(t,e){return $l(t.coordinates,e)},MultiPoint:function(t,e){for(var n=t.coordinates,r=-1,i=n.length;++r<i;)if($l(n[r],e))return!0;return!1},LineString:function(t,e){return Wl(t.coordinates,e)},MultiLineString:function(t,e){for(var n=t.coordinates,r=-1,i=n.length;++r<i;)if(Wl(n[r],e))return!0;return!1},Polygon:function(t,e){return Hl(t.coordinates,e)},MultiPolygon:function(t,e){for(var n=t.coordinates,r=-1,i=n.length;++r<i;)if(Hl(n[r],e))return!0;return!1},GeometryCollection:function(t,e){for(var n=t.geometries,r=-1,i=n.length;++r<i;)if(Ul(n[r],e))return!0;return!1}};function Ul(t,e){return!(!t||!zl.hasOwnProperty(t.type))&&zl[t.type](t,e)}function $l(t,e){return 0===Rl(t,e)}function Wl(t,e){for(var n,r,i,a=0,o=t.length;a<o;a++){if(0===(r=Rl(t[a],e)))return!0;if(a>0&&(i=Rl(t[a],t[a-1]))>0&&n<=i&&r<=i&&(n+r-i)*(1-Math.pow((n-r)/i,2))<1e-12*i)return!0;n=r}return!1}function Hl(t,e){return!!xl(t.map(Vl),Gl(e))}function Vl(t){return(t=t.map(Gl)).pop(),t}function Gl(t){return[t[0]*yc,t[1]*yc]}var ql=function(t,e){return(t&&Yl.hasOwnProperty(t.type)?Yl[t.type]:Ul)(t,e)};function Xl(t,e,n){var r=k(t,e-1e-6,n).concat(e);return function(t){return r.map((function(e){return[t,e]}))}}function Zl(t,e,n){var r=k(t,e-1e-6,n).concat(e);return function(t){return r.map((function(e){return[e,t]}))}}function Jl(){var t,e,n,r,i,a,o,s,c,u,l,h,f=10,d=f,p=90,g=360,y=2.5;function v(){return{type:"MultiLineString",coordinates:m()}}function m(){return k(_c(r/p)*p,n,p).map(l).concat(k(_c(s/g)*g,o,g).map(h)).concat(k(_c(e/f)*f,t,f).filter((function(t){return vc(t%p)>1e-6})).map(c)).concat(k(_c(a/d)*d,i,d).filter((function(t){return vc(t%g)>1e-6})).map(u))}return v.lines=function(){return m().map((function(t){return{type:"LineString",coordinates:t}}))},v.outline=function(){return{type:"Polygon",coordinates:[l(r).concat(h(o).slice(1),l(n).reverse().slice(1),h(s).reverse().slice(1))]}},v.extent=function(t){return arguments.length?v.extentMajor(t).extentMinor(t):v.extentMinor()},v.extentMajor=function(t){return arguments.length?(r=+t[0][0],n=+t[1][0],s=+t[0][1],o=+t[1][1],r>n&&(t=r,r=n,n=t),s>o&&(t=s,s=o,o=t),v.precision(y)):[[r,s],[n,o]]},v.extentMinor=function(n){return arguments.length?(e=+n[0][0],t=+n[1][0],a=+n[0][1],i=+n[1][1],e>t&&(n=e,e=t,t=n),a>i&&(n=a,a=i,i=n),v.precision(y)):[[e,a],[t,i]]},v.step=function(t){return arguments.length?v.stepMajor(t).stepMinor(t):v.stepMinor()},v.stepMajor=function(t){return arguments.length?(p=+t[0],g=+t[1],v):[p,g]},v.stepMinor=function(t){return arguments.length?(f=+t[0],d=+t[1],v):[f,d]},v.precision=function(f){return arguments.length?(y=+f,c=Xl(a,i,90),u=Zl(e,t,y),l=Xl(s,o,90),h=Zl(r,n,y),v):y},v.extentMajor([[-180,1e-6-90],[180,90-1e-6]]).extentMinor([[-180,-80-1e-6],[180,80+1e-6]])}function Kl(){return Jl()()}var Ql,th,eh,nh,rh=function(t,e){var n=t[0]*yc,r=t[1]*yc,i=e[0]*yc,a=e[1]*yc,o=xc(r),s=Tc(r),c=xc(a),u=Tc(a),l=o*xc(n),h=o*Tc(n),f=c*xc(i),d=c*Tc(i),p=2*Oc(Ac(Dc(a-r)+o*c*Dc(i-n))),g=Tc(p),y=p?function(t){var e=Tc(t*=p)/g,n=Tc(p-t)/g,r=n*l+e*f,i=n*h+e*d,a=n*s+e*u;return[bc(i,r)*gc,bc(a,Ac(r*r+i*i))*gc]}:function(){return[n*gc,r*gc]};return y.distance=p,y},ih=function(t){return t},ah=sc(),oh=sc(),sh={point:Nc,lineStart:Nc,lineEnd:Nc,polygonStart:function(){sh.lineStart=ch,sh.lineEnd=hh},polygonEnd:function(){sh.lineStart=sh.lineEnd=sh.point=Nc,ah.add(vc(oh)),oh.reset()},result:function(){var t=ah/2;return ah.reset(),t}};function ch(){sh.point=uh}function uh(t,e){sh.point=lh,Ql=eh=t,th=nh=e}function lh(t,e){oh.add(nh*t-eh*e),eh=t,nh=e}function hh(){lh(Ql,th)}var fh=sh,dh=1/0,ph=dh,gh=-dh,yh=gh;var vh,mh,bh,xh,_h={point:function(t,e){t<dh&&(dh=t);t>gh&&(gh=t);e<ph&&(ph=e);e>yh&&(yh=e)},lineStart:Nc,lineEnd:Nc,polygonStart:Nc,polygonEnd:Nc,result:function(){var t=[[dh,ph],[gh,yh]];return gh=yh=-(ph=dh=1/0),t}},kh=0,wh=0,Eh=0,Th=0,Ch=0,Ah=0,Sh=0,Mh=0,Oh=0,Dh={point:Nh,lineStart:Bh,lineEnd:Ih,polygonStart:function(){Dh.lineStart=Fh,Dh.lineEnd=jh},polygonEnd:function(){Dh.point=Nh,Dh.lineStart=Bh,Dh.lineEnd=Ih},result:function(){var t=Oh?[Sh/Oh,Mh/Oh]:Ah?[Th/Ah,Ch/Ah]:Eh?[kh/Eh,wh/Eh]:[NaN,NaN];return kh=wh=Eh=Th=Ch=Ah=Sh=Mh=Oh=0,t}};function Nh(t,e){kh+=t,wh+=e,++Eh}function Bh(){Dh.point=Lh}function Lh(t,e){Dh.point=Ph,Nh(bh=t,xh=e)}function Ph(t,e){var n=t-bh,r=e-xh,i=Ac(n*n+r*r);Th+=i*(bh+t)/2,Ch+=i*(xh+e)/2,Ah+=i,Nh(bh=t,xh=e)}function Ih(){Dh.point=Nh}function Fh(){Dh.point=Rh}function jh(){Yh(vh,mh)}function Rh(t,e){Dh.point=Yh,Nh(vh=bh=t,mh=xh=e)}function Yh(t,e){var n=t-bh,r=e-xh,i=Ac(n*n+r*r);Th+=i*(bh+t)/2,Ch+=i*(xh+e)/2,Ah+=i,Sh+=(i=xh*t-bh*e)*(bh+t),Mh+=i*(xh+e),Oh+=3*i,Nh(bh=t,xh=e)}var zh=Dh;function Uh(t){this._context=t}Uh.prototype={_radius:4.5,pointRadius:function(t){return this._radius=t,this},polygonStart:function(){this._line=0},polygonEnd:function(){this._line=NaN},lineStart:function(){this._point=0},lineEnd:function(){0===this._line&&this._context.closePath(),this._point=NaN},point:function(t,e){switch(this._point){case 0:this._context.moveTo(t,e),this._point=1;break;case 1:this._context.lineTo(t,e);break;default:this._context.moveTo(t+this._radius,e),this._context.arc(t,e,this._radius,0,pc)}},result:Nc};var $h,Wh,Hh,Vh,Gh,qh=sc(),Xh={point:Nc,lineStart:function(){Xh.point=Zh},lineEnd:function(){$h&&Jh(Wh,Hh),Xh.point=Nc},polygonStart:function(){$h=!0},polygonEnd:function(){$h=null},result:function(){var t=+qh;return qh.reset(),t}};function Zh(t,e){Xh.point=Jh,Wh=Vh=t,Hh=Gh=e}function Jh(t,e){Vh-=t,Gh-=e,qh.add(Ac(Vh*Vh+Gh*Gh)),Vh=t,Gh=e}var Kh=Xh;function Qh(){this._string=[]}function tf(t){return"m0,"+t+"a"+t+","+t+" 0 1,1 0,"+-2*t+"a"+t+","+t+" 0 1,1 0,"+2*t+"z"}Qh.prototype={_radius:4.5,_circle:tf(4.5),pointRadius:function(t){return(t=+t)!==this._radius&&(this._radius=t,this._circle=null),this},polygonStart:function(){this._line=0},polygonEnd:function(){this._line=NaN},lineStart:function(){this._point=0},lineEnd:function(){0===this._line&&this._string.push("Z"),this._point=NaN},point:function(t,e){switch(this._point){case 0:this._string.push("M",t,",",e),this._point=1;break;case 1:this._string.push("L",t,",",e);break;default:null==this._circle&&(this._circle=tf(this._radius)),this._string.push("M",t,",",e,this._circle)}},result:function(){if(this._string.length){var t=this._string.join("");return this._string=[],t}return null}};var ef=function(t,e){var n,r,i=4.5;function a(t){return t&&("function"==typeof i&&r.pointRadius(+i.apply(this,arguments)),$c(t,n(r))),r.result()}return a.area=function(t){return $c(t,n(fh)),fh.result()},a.measure=function(t){return $c(t,n(Kh)),Kh.result()},a.bounds=function(t){return $c(t,n(_h)),_h.result()},a.centroid=function(t){return $c(t,n(zh)),zh.result()},a.projection=function(e){return arguments.length?(n=null==e?(t=null,ih):(t=e).stream,a):t},a.context=function(t){return arguments.length?(r=null==t?(e=null,new Qh):new Uh(e=t),"function"!=typeof i&&r.pointRadius(i),a):e},a.pointRadius=function(t){return arguments.length?(i="function"==typeof t?t:(r.pointRadius(+t),+t),a):i},a.projection(t).context(e)},nf=function(t){return{stream:rf(t)}};function rf(t){return function(e){var n=new af;for(var r in t)n[r]=t[r];return n.stream=e,n}}function af(){}function of(t,e,n){var r=t.clipExtent&&t.clipExtent();return t.scale(150).translate([0,0]),null!=r&&t.clipExtent(null),$c(n,t.stream(_h)),e(_h.result()),null!=r&&t.clipExtent(r),t}function sf(t,e,n){return of(t,(function(n){var r=e[1][0]-e[0][0],i=e[1][1]-e[0][1],a=Math.min(r/(n[1][0]-n[0][0]),i/(n[1][1]-n[0][1])),o=+e[0][0]+(r-a*(n[1][0]+n[0][0]))/2,s=+e[0][1]+(i-a*(n[1][1]+n[0][1]))/2;t.scale(150*a).translate([o,s])}),n)}function cf(t,e,n){return sf(t,[[0,0],e],n)}function uf(t,e,n){return of(t,(function(n){var r=+e,i=r/(n[1][0]-n[0][0]),a=(r-i*(n[1][0]+n[0][0]))/2,o=-i*n[0][1];t.scale(150*i).translate([a,o])}),n)}function lf(t,e,n){return of(t,(function(n){var r=+e,i=r/(n[1][1]-n[0][1]),a=-i*n[0][0],o=(r-i*(n[1][1]+n[0][1]))/2;t.scale(150*i).translate([a,o])}),n)}af.prototype={constructor:af,point:function(t,e){this.stream.point(t,e)},sphere:function(){this.stream.sphere()},lineStart:function(){this.stream.lineStart()},lineEnd:function(){this.stream.lineEnd()},polygonStart:function(){this.stream.polygonStart()},polygonEnd:function(){this.stream.polygonEnd()}};var hf=xc(30*yc),ff=function(t,e){return+e?function(t,e){function n(r,i,a,o,s,c,u,l,h,f,d,p,g,y){var v=u-r,m=l-i,b=v*v+m*m;if(b>4*e&&g--){var x=o+f,_=s+d,k=c+p,w=Ac(x*x+_*_+k*k),E=Oc(k/=w),T=vc(vc(k)-1)<1e-6||vc(a-h)<1e-6?(a+h)/2:bc(_,x),C=t(T,E),A=C[0],S=C[1],M=A-r,O=S-i,D=m*M-v*O;(D*D/b>e||vc((v*M+m*O)/b-.5)>.3||o*f+s*d+c*p<hf)&&(n(r,i,a,o,s,c,A,S,T,x/=w,_/=w,k,g,y),y.point(A,S),n(A,S,T,x,_,k,u,l,h,f,d,p,g,y))}}return function(e){var r,i,a,o,s,c,u,l,h,f,d,p,g={point:y,lineStart:v,lineEnd:b,polygonStart:function(){e.polygonStart(),g.lineStart=x},polygonEnd:function(){e.polygonEnd(),g.lineStart=v}};function y(n,r){n=t(n,r),e.point(n[0],n[1])}function v(){l=NaN,g.point=m,e.lineStart()}function m(r,i){var a=Qc([r,i]),o=t(r,i);n(l,h,u,f,d,p,l=o[0],h=o[1],u=r,f=a[0],d=a[1],p=a[2],16,e),e.point(l,h)}function b(){g.point=y,e.lineEnd()}function x(){v(),g.point=_,g.lineEnd=k}function _(t,e){m(r=t,e),i=l,a=h,o=f,s=d,c=p,g.point=m}function k(){n(l,h,u,f,d,p,i,a,r,o,s,c,16,e),g.lineEnd=b,b()}return g}}(t,e):function(t){return rf({point:function(e,n){e=t(e,n),this.stream.point(e[0],e[1])}})}(t)};var df=rf({point:function(t,e){this.stream.point(t*yc,e*yc)}});function pf(t,e,n){function r(r,i){return[e+t*r,n-t*i]}return r.invert=function(r,i){return[(r-e)/t,(n-i)/t]},r}function gf(t,e,n,r){var i=xc(r),a=Tc(r),o=i*t,s=a*t,c=i/t,u=a/t,l=(a*n-i*e)/t,h=(a*e+i*n)/t;function f(t,r){return[o*t-s*r+e,n-s*t-o*r]}return f.invert=function(t,e){return[c*t-u*e+l,h-u*t-c*e]},f}function yf(t){return vf((function(){return t}))()}function vf(t){var e,n,r,i,a,o,s,c,u,l,h=150,f=480,d=250,p=0,g=0,y=0,v=0,m=0,b=0,x=null,_=El,k=null,w=ih,E=.5;function T(t){return c(t[0]*yc,t[1]*yc)}function C(t){return(t=c.invert(t[0],t[1]))&&[t[0]*gc,t[1]*gc]}function A(){var t=gf(h,0,0,b).apply(null,e(p,g)),r=(b?gf:pf)(h,f-t[0],d-t[1],b);return n=al(y,v,m),s=rl(e,r),c=rl(n,s),o=ff(s,E),S()}function S(){return u=l=null,T}return T.stream=function(t){return u&&l===t?u:u=df(function(t){return rf({point:function(e,n){var r=t(e,n);return this.stream.point(r[0],r[1])}})}(n)(_(o(w(l=t)))))},T.preclip=function(t){return arguments.length?(_=t,x=void 0,S()):_},T.postclip=function(t){return arguments.length?(w=t,k=r=i=a=null,S()):w},T.clipAngle=function(t){return arguments.length?(_=+t?Tl(x=t*yc):(x=null,El),S()):x*gc},T.clipExtent=function(t){return arguments.length?(w=null==t?(k=r=i=a=null,ih):Cl(k=+t[0][0],r=+t[0][1],i=+t[1][0],a=+t[1][1]),S()):null==k?null:[[k,r],[i,a]]},T.scale=function(t){return arguments.length?(h=+t,A()):h},T.translate=function(t){return arguments.length?(f=+t[0],d=+t[1],A()):[f,d]},T.center=function(t){return arguments.length?(p=t[0]%360*yc,g=t[1]%360*yc,A()):[p*gc,g*gc]},T.rotate=function(t){return arguments.length?(y=t[0]%360*yc,v=t[1]%360*yc,m=t.length>2?t[2]%360*yc:0,A()):[y*gc,v*gc,m*gc]},T.angle=function(t){return arguments.length?(b=t%360*yc,A()):b*gc},T.precision=function(t){return arguments.length?(o=ff(s,E=t*t),S()):Ac(E)},T.fitExtent=function(t,e){return sf(T,t,e)},T.fitSize=function(t,e){return cf(T,t,e)},T.fitWidth=function(t,e){return uf(T,t,e)},T.fitHeight=function(t,e){return lf(T,t,e)},function(){return e=t.apply(this,arguments),T.invert=e.invert&&C,A()}}function mf(t){var e=0,n=hc/3,r=vf(t),i=r(e,n);return i.parallels=function(t){return arguments.length?r(e=t[0]*yc,n=t[1]*yc):[e*gc,n*gc]},i}function bf(t,e){var n=Tc(t),r=(n+Tc(e))/2;if(vc(r)<1e-6)return function(t){var e=xc(t);function n(t,n){return[t*e,Tc(n)/e]}return n.invert=function(t,n){return[t/e,Oc(n*e)]},n}(t);var i=1+n*(2*r-n),a=Ac(i)/r;function o(t,e){var n=Ac(i-2*r*Tc(e))/r;return[n*Tc(t*=r),a-n*xc(t)]}return o.invert=function(t,e){var n=a-e;return[bc(t,vc(n))/r*Cc(n),Oc((i-(t*t+n*n)*r*r)/(2*r))]},o}var xf=function(){return mf(bf).scale(155.424).center([0,33.6442])},_f=function(){return xf().parallels([29.5,45.5]).scale(1070).translate([480,250]).rotate([96,0]).center([-.6,38.7])};var kf=function(){var t,e,n,r,i,a,o=_f(),s=xf().rotate([154,0]).center([-2,58.5]).parallels([55,65]),c=xf().rotate([157,0]).center([-3,19.9]).parallels([8,18]),u={point:function(t,e){a=[t,e]}};function l(t){var e=t[0],o=t[1];return a=null,n.point(e,o),a||(r.point(e,o),a)||(i.point(e,o),a)}function h(){return t=e=null,l}return l.invert=function(t){var e=o.scale(),n=o.translate(),r=(t[0]-n[0])/e,i=(t[1]-n[1])/e;return(i>=.12&&i<.234&&r>=-.425&&r<-.214?s:i>=.166&&i<.234&&r>=-.214&&r<-.115?c:o).invert(t)},l.stream=function(n){return t&&e===n?t:(r=[o.stream(e=n),s.stream(n),c.stream(n)],i=r.length,t={point:function(t,e){for(var n=-1;++n<i;)r[n].point(t,e)},sphere:function(){for(var t=-1;++t<i;)r[t].sphere()},lineStart:function(){for(var t=-1;++t<i;)r[t].lineStart()},lineEnd:function(){for(var t=-1;++t<i;)r[t].lineEnd()},polygonStart:function(){for(var t=-1;++t<i;)r[t].polygonStart()},polygonEnd:function(){for(var t=-1;++t<i;)r[t].polygonEnd()}});var r,i},l.precision=function(t){return arguments.length?(o.precision(t),s.precision(t),c.precision(t),h()):o.precision()},l.scale=function(t){return arguments.length?(o.scale(t),s.scale(.35*t),c.scale(t),l.translate(o.translate())):o.scale()},l.translate=function(t){if(!arguments.length)return o.translate();var e=o.scale(),a=+t[0],l=+t[1];return n=o.translate(t).clipExtent([[a-.455*e,l-.238*e],[a+.455*e,l+.238*e]]).stream(u),r=s.translate([a-.307*e,l+.201*e]).clipExtent([[a-.425*e+1e-6,l+.12*e+1e-6],[a-.214*e-1e-6,l+.234*e-1e-6]]).stream(u),i=c.translate([a-.205*e,l+.212*e]).clipExtent([[a-.214*e+1e-6,l+.166*e+1e-6],[a-.115*e-1e-6,l+.234*e-1e-6]]).stream(u),h()},l.fitExtent=function(t,e){return sf(l,t,e)},l.fitSize=function(t,e){return cf(l,t,e)},l.fitWidth=function(t,e){return uf(l,t,e)},l.fitHeight=function(t,e){return lf(l,t,e)},l.scale(1070)};function wf(t){return function(e,n){var r=xc(e),i=xc(n),a=t(r*i);return[a*i*Tc(e),a*Tc(n)]}}function Ef(t){return function(e,n){var r=Ac(e*e+n*n),i=t(r),a=Tc(i),o=xc(i);return[bc(e*a,r*o),Oc(r&&n*a/r)]}}var Tf=wf((function(t){return Ac(2/(1+t))}));Tf.invert=Ef((function(t){return 2*Oc(t/2)}));var Cf=function(){return yf(Tf).scale(124.75).clipAngle(179.999)},Af=wf((function(t){return(t=Mc(t))&&t/Tc(t)}));Af.invert=Ef((function(t){return t}));var Sf=function(){return yf(Af).scale(79.4188).clipAngle(179.999)};function Mf(t,e){return[t,wc(Sc((fc+e)/2))]}Mf.invert=function(t,e){return[t,2*mc(kc(e))-fc]};var Of=function(){return Df(Mf).scale(961/pc)};function Df(t){var e,n,r,i=yf(t),a=i.center,o=i.scale,s=i.translate,c=i.clipExtent,u=null;function l(){var a=hc*o(),s=i(ul(i.rotate()).invert([0,0]));return c(null==u?[[s[0]-a,s[1]-a],[s[0]+a,s[1]+a]]:t===Mf?[[Math.max(s[0]-a,u),e],[Math.min(s[0]+a,n),r]]:[[u,Math.max(s[1]-a,e)],[n,Math.min(s[1]+a,r)]])}return i.scale=function(t){return arguments.length?(o(t),l()):o()},i.translate=function(t){return arguments.length?(s(t),l()):s()},i.center=function(t){return arguments.length?(a(t),l()):a()},i.clipExtent=function(t){return arguments.length?(null==t?u=e=n=r=null:(u=+t[0][0],e=+t[0][1],n=+t[1][0],r=+t[1][1]),l()):null==u?null:[[u,e],[n,r]]},l()}function Nf(t){return Sc((fc+t)/2)}function Bf(t,e){var n=xc(t),r=t===e?Tc(t):wc(n/xc(e))/wc(Nf(e)/Nf(t)),i=n*Ec(Nf(t),r)/r;if(!r)return Mf;function a(t,e){i>0?e<1e-6-fc&&(e=1e-6-fc):e>fc-1e-6&&(e=fc-1e-6);var n=i/Ec(Nf(e),r);return[n*Tc(r*t),i-n*xc(r*t)]}return a.invert=function(t,e){var n=i-e,a=Cc(r)*Ac(t*t+n*n);return[bc(t,vc(n))/r*Cc(n),2*mc(Ec(i/a,1/r))-fc]},a}var Lf=function(){return mf(Bf).scale(109.5).parallels([30,30])};function Pf(t,e){return[t,e]}Pf.invert=Pf;var If=function(){return yf(Pf).scale(152.63)};function Ff(t,e){var n=xc(t),r=t===e?Tc(t):(n-xc(e))/(e-t),i=n/r+t;if(vc(r)<1e-6)return Pf;function a(t,e){var n=i-e,a=r*t;return[n*Tc(a),i-n*xc(a)]}return a.invert=function(t,e){var n=i-e;return[bc(t,vc(n))/r*Cc(n),i-Cc(r)*Ac(t*t+n*n)]},a}var jf=function(){return mf(Ff).scale(131.154).center([0,13.9389])},Rf=1.340264,Yf=-.081106,zf=893e-6,Uf=.003796,$f=Ac(3)/2;function Wf(t,e){var n=Oc($f*Tc(e)),r=n*n,i=r*r*r;return[t*xc(n)/($f*(Rf+3*Yf*r+i*(7*zf+9*Uf*r))),n*(Rf+Yf*r+i*(zf+Uf*r))]}Wf.invert=function(t,e){for(var n,r=e,i=r*r,a=i*i*i,o=0;o<12&&(a=(i=(r-=n=(r*(Rf+Yf*i+a*(zf+Uf*i))-e)/(Rf+3*Yf*i+a*(7*zf+9*Uf*i)))*r)*i*i,!(vc(n)<1e-12));++o);return[$f*t*(Rf+3*Yf*i+a*(7*zf+9*Uf*i))/xc(r),Oc(Tc(r)/$f)]};var Hf=function(){return yf(Wf).scale(177.158)};function Vf(t,e){var n=xc(e),r=xc(t)*n;return[n*Tc(t)/r,Tc(e)/r]}Vf.invert=Ef(mc);var Gf=function(){return yf(Vf).scale(144.049).clipAngle(60)};function qf(t,e,n,r){return 1===t&&1===e&&0===n&&0===r?ih:rf({point:function(i,a){this.stream.point(i*t+n,a*e+r)}})}var Xf=function(){var t,e,n,r,i,a,o=1,s=0,c=0,u=1,l=1,h=ih,f=null,d=ih;function p(){return r=i=null,a}return a={stream:function(t){return r&&i===t?r:r=h(d(i=t))},postclip:function(r){return arguments.length?(d=r,f=t=e=n=null,p()):d},clipExtent:function(r){return arguments.length?(d=null==r?(f=t=e=n=null,ih):Cl(f=+r[0][0],t=+r[0][1],e=+r[1][0],n=+r[1][1]),p()):null==f?null:[[f,t],[e,n]]},scale:function(t){return arguments.length?(h=qf((o=+t)*u,o*l,s,c),p()):o},translate:function(t){return arguments.length?(h=qf(o*u,o*l,s=+t[0],c=+t[1]),p()):[s,c]},reflectX:function(t){return arguments.length?(h=qf(o*(u=t?-1:1),o*l,s,c),p()):u<0},reflectY:function(t){return arguments.length?(h=qf(o*u,o*(l=t?-1:1),s,c),p()):l<0},fitExtent:function(t,e){return sf(a,t,e)},fitSize:function(t,e){return cf(a,t,e)},fitWidth:function(t,e){return uf(a,t,e)},fitHeight:function(t,e){return lf(a,t,e)}}};function Zf(t,e){var n=e*e,r=n*n;return[t*(.8707-.131979*n+r*(r*(.003971*n-.001529*r)-.013791)),e*(1.007226+n*(.015085+r*(.028874*n-.044475-.005916*r)))]}Zf.invert=function(t,e){var n,r=e,i=25;do{var a=r*r,o=a*a;r-=n=(r*(1.007226+a*(.015085+o*(.028874*a-.044475-.005916*o)))-e)/(1.007226+a*(.045255+o*(.259866*a-.311325-.005916*11*o)))}while(vc(n)>1e-6&&--i>0);return[t/(.8707+(a=r*r)*(a*(a*a*a*(.003971-.001529*a)-.013791)-.131979)),r]};var Jf=function(){return yf(Zf).scale(175.295)};function Kf(t,e){return[xc(e)*Tc(t),Tc(e)]}Kf.invert=Ef(Oc);var Qf=function(){return yf(Kf).scale(249.5).clipAngle(90+1e-6)};function td(t,e){var n=xc(e),r=1+xc(t)*n;return[n*Tc(t)/r,Tc(e)/r]}td.invert=Ef((function(t){return 2*mc(t)}));var ed=function(){return yf(td).scale(250).clipAngle(142)};function nd(t,e){return[wc(Sc((fc+e)/2)),-t]}nd.invert=function(t,e){return[-e,2*mc(kc(t))-fc]};var rd=function(){var t=Df(nd),e=t.center,n=t.rotate;return t.center=function(t){return arguments.length?e([-t[1],t[0]]):[(t=e())[1],-t[0]]},t.rotate=function(t){return arguments.length?n([t[0],t[1],t.length>2?t[2]+90:90]):[(t=n())[0],t[1],t[2]-90]},n([0,0,90]).scale(159.155)};function id(t,e){return t.parent===e.parent?1:2}function ad(t,e){return t+e.x}function od(t,e){return Math.max(t,e.y)}var sd=function(){var t=id,e=1,n=1,r=!1;function i(i){var a,o=0;i.eachAfter((function(e){var n=e.children;n?(e.x=function(t){return t.reduce(ad,0)/t.length}(n),e.y=function(t){return 1+t.reduce(od,0)}(n)):(e.x=a?o+=t(e,a):0,e.y=0,a=e)}));var s=function(t){for(var e;e=t.children;)t=e[0];return t}(i),c=function(t){for(var e;e=t.children;)t=e[e.length-1];return t}(i),u=s.x-t(s,c)/2,l=c.x+t(c,s)/2;return i.eachAfter(r?function(t){t.x=(t.x-i.x)*e,t.y=(i.y-t.y)*n}:function(t){t.x=(t.x-u)/(l-u)*e,t.y=(1-(i.y?t.y/i.y:1))*n})}return i.separation=function(e){return arguments.length?(t=e,i):t},i.size=function(t){return arguments.length?(r=!1,e=+t[0],n=+t[1],i):r?null:[e,n]},i.nodeSize=function(t){return arguments.length?(r=!0,e=+t[0],n=+t[1],i):r?[e,n]:null},i};function cd(t){var e=0,n=t.children,r=n&&n.length;if(r)for(;--r>=0;)e+=n[r].value;else e=1;t.value=e}function ud(t,e){var n,r,i,a,o,s=new dd(t),c=+t.value&&(s.value=t.value),u=[s];for(null==e&&(e=ld);n=u.pop();)if(c&&(n.value=+n.data.value),(i=e(n.data))&&(o=i.length))for(n.children=new Array(o),a=o-1;a>=0;--a)u.push(r=n.children[a]=new dd(i[a])),r.parent=n,r.depth=n.depth+1;return s.eachBefore(fd)}function ld(t){return t.children}function hd(t){t.data=t.data.data}function fd(t){var e=0;do{t.height=e}while((t=t.parent)&&t.height<++e)}function dd(t){this.data=t,this.depth=this.height=0,this.parent=null}dd.prototype=ud.prototype={constructor:dd,count:function(){return this.eachAfter(cd)},each:function(t){var e,n,r,i,a=this,o=[a];do{for(e=o.reverse(),o=[];a=e.pop();)if(t(a),n=a.children)for(r=0,i=n.length;r<i;++r)o.push(n[r])}while(o.length);return this},eachAfter:function(t){for(var e,n,r,i=this,a=[i],o=[];i=a.pop();)if(o.push(i),e=i.children)for(n=0,r=e.length;n<r;++n)a.push(e[n]);for(;i=o.pop();)t(i);return this},eachBefore:function(t){for(var e,n,r=this,i=[r];r=i.pop();)if(t(r),e=r.children)for(n=e.length-1;n>=0;--n)i.push(e[n]);return this},sum:function(t){return this.eachAfter((function(e){for(var n=+t(e.data)||0,r=e.children,i=r&&r.length;--i>=0;)n+=r[i].value;e.value=n}))},sort:function(t){return this.eachBefore((function(e){e.children&&e.children.sort(t)}))},path:function(t){for(var e=this,n=function(t,e){if(t===e)return t;var n=t.ancestors(),r=e.ancestors(),i=null;t=n.pop(),e=r.pop();for(;t===e;)i=t,t=n.pop(),e=r.pop();return i}(e,t),r=[e];e!==n;)e=e.parent,r.push(e);for(var i=r.length;t!==n;)r.splice(i,0,t),t=t.parent;return r},ancestors:function(){for(var t=this,e=[t];t=t.parent;)e.push(t);return e},descendants:function(){var t=[];return this.each((function(e){t.push(e)})),t},leaves:function(){var t=[];return this.eachBefore((function(e){e.children||t.push(e)})),t},links:function(){var t=this,e=[];return t.each((function(n){n!==t&&e.push({source:n.parent,target:n})})),e},copy:function(){return ud(this).eachBefore(hd)}};var pd=Array.prototype.slice;var gd=function(t){for(var e,n,r=0,i=(t=function(t){for(var e,n,r=t.length;r;)n=Math.random()*r--|0,e=t[r],t[r]=t[n],t[n]=e;return t}(pd.call(t))).length,a=[];r<i;)e=t[r],n&&md(n,e)?++r:(n=xd(a=yd(a,e)),r=0);return n};function yd(t,e){var n,r;if(bd(e,t))return[e];for(n=0;n<t.length;++n)if(vd(e,t[n])&&bd(_d(t[n],e),t))return[t[n],e];for(n=0;n<t.length-1;++n)for(r=n+1;r<t.length;++r)if(vd(_d(t[n],t[r]),e)&&vd(_d(t[n],e),t[r])&&vd(_d(t[r],e),t[n])&&bd(kd(t[n],t[r],e),t))return[t[n],t[r],e];throw new Error}function vd(t,e){var n=t.r-e.r,r=e.x-t.x,i=e.y-t.y;return n<0||n*n<r*r+i*i}function md(t,e){var n=t.r-e.r+1e-6,r=e.x-t.x,i=e.y-t.y;return n>0&&n*n>r*r+i*i}function bd(t,e){for(var n=0;n<e.length;++n)if(!md(t,e[n]))return!1;return!0}function xd(t){switch(t.length){case 1:return{x:(e=t[0]).x,y:e.y,r:e.r};case 2:return _d(t[0],t[1]);case 3:return kd(t[0],t[1],t[2])}var e}function _d(t,e){var n=t.x,r=t.y,i=t.r,a=e.x,o=e.y,s=e.r,c=a-n,u=o-r,l=s-i,h=Math.sqrt(c*c+u*u);return{x:(n+a+c/h*l)/2,y:(r+o+u/h*l)/2,r:(h+i+s)/2}}function kd(t,e,n){var r=t.x,i=t.y,a=t.r,o=e.x,s=e.y,c=e.r,u=n.x,l=n.y,h=n.r,f=r-o,d=r-u,p=i-s,g=i-l,y=c-a,v=h-a,m=r*r+i*i-a*a,b=m-o*o-s*s+c*c,x=m-u*u-l*l+h*h,_=d*p-f*g,k=(p*x-g*b)/(2*_)-r,w=(g*y-p*v)/_,E=(d*b-f*x)/(2*_)-i,T=(f*v-d*y)/_,C=w*w+T*T-1,A=2*(a+k*w+E*T),S=k*k+E*E-a*a,M=-(C?(A+Math.sqrt(A*A-4*C*S))/(2*C):S/A);return{x:r+k+w*M,y:i+E+T*M,r:M}}function wd(t,e,n){var r,i,a,o,s=t.x-e.x,c=t.y-e.y,u=s*s+c*c;u?(i=e.r+n.r,i*=i,o=t.r+n.r,i>(o*=o)?(r=(u+o-i)/(2*u),a=Math.sqrt(Math.max(0,o/u-r*r)),n.x=t.x-r*s-a*c,n.y=t.y-r*c+a*s):(r=(u+i-o)/(2*u),a=Math.sqrt(Math.max(0,i/u-r*r)),n.x=e.x+r*s-a*c,n.y=e.y+r*c+a*s)):(n.x=e.x+n.r,n.y=e.y)}function Ed(t,e){var n=t.r+e.r-1e-6,r=e.x-t.x,i=e.y-t.y;return n>0&&n*n>r*r+i*i}function Td(t){var e=t._,n=t.next._,r=e.r+n.r,i=(e.x*n.r+n.x*e.r)/r,a=(e.y*n.r+n.y*e.r)/r;return i*i+a*a}function Cd(t){this._=t,this.next=null,this.previous=null}function Ad(t){if(!(i=t.length))return 0;var e,n,r,i,a,o,s,c,u,l,h;if((e=t[0]).x=0,e.y=0,!(i>1))return e.r;if(n=t[1],e.x=-n.r,n.x=e.r,n.y=0,!(i>2))return e.r+n.r;wd(n,e,r=t[2]),e=new Cd(e),n=new Cd(n),r=new Cd(r),e.next=r.previous=n,n.next=e.previous=r,r.next=n.previous=e;t:for(s=3;s<i;++s){wd(e._,n._,r=t[s]),r=new Cd(r),c=n.next,u=e.previous,l=n._.r,h=e._.r;do{if(l<=h){if(Ed(c._,r._)){n=c,e.next=n,n.previous=e,--s;continue t}l+=c._.r,c=c.next}else{if(Ed(u._,r._)){(e=u).next=n,n.previous=e,--s;continue t}h+=u._.r,u=u.previous}}while(c!==u.next);for(r.previous=e,r.next=n,e.next=n.previous=n=r,a=Td(e);(r=r.next)!==n;)(o=Td(r))<a&&(e=r,a=o);n=e.next}for(e=[n._],r=n;(r=r.next)!==n;)e.push(r._);for(r=gd(e),s=0;s<i;++s)(e=t[s]).x-=r.x,e.y-=r.y;return r.r}var Sd=function(t){return Ad(t),t};function Md(t){return null==t?null:Od(t)}function Od(t){if("function"!=typeof t)throw new Error;return t}function Dd(){return 0}var Nd=function(t){return function(){return t}};function Bd(t){return Math.sqrt(t.value)}var Ld=function(){var t=null,e=1,n=1,r=Dd;function i(i){return i.x=e/2,i.y=n/2,t?i.eachBefore(Pd(t)).eachAfter(Id(r,.5)).eachBefore(Fd(1)):i.eachBefore(Pd(Bd)).eachAfter(Id(Dd,1)).eachAfter(Id(r,i.r/Math.min(e,n))).eachBefore(Fd(Math.min(e,n)/(2*i.r))),i}return i.radius=function(e){return arguments.length?(t=Md(e),i):t},i.size=function(t){return arguments.length?(e=+t[0],n=+t[1],i):[e,n]},i.padding=function(t){return arguments.length?(r="function"==typeof t?t:Nd(+t),i):r},i};function Pd(t){return function(e){e.children||(e.r=Math.max(0,+t(e)||0))}}function Id(t,e){return function(n){if(r=n.children){var r,i,a,o=r.length,s=t(n)*e||0;if(s)for(i=0;i<o;++i)r[i].r+=s;if(a=Ad(r),s)for(i=0;i<o;++i)r[i].r-=s;n.r=a+s}}}function Fd(t){return function(e){var n=e.parent;e.r*=t,n&&(e.x=n.x+t*e.x,e.y=n.y+t*e.y)}}var jd=function(t){t.x0=Math.round(t.x0),t.y0=Math.round(t.y0),t.x1=Math.round(t.x1),t.y1=Math.round(t.y1)},Rd=function(t,e,n,r,i){for(var a,o=t.children,s=-1,c=o.length,u=t.value&&(r-e)/t.value;++s<c;)(a=o[s]).y0=n,a.y1=i,a.x0=e,a.x1=e+=a.value*u},Yd=function(){var t=1,e=1,n=0,r=!1;function i(i){var a=i.height+1;return i.x0=i.y0=n,i.x1=t,i.y1=e/a,i.eachBefore(function(t,e){return function(r){r.children&&Rd(r,r.x0,t*(r.depth+1)/e,r.x1,t*(r.depth+2)/e);var i=r.x0,a=r.y0,o=r.x1-n,s=r.y1-n;o<i&&(i=o=(i+o)/2),s<a&&(a=s=(a+s)/2),r.x0=i,r.y0=a,r.x1=o,r.y1=s}}(e,a)),r&&i.eachBefore(jd),i}return i.round=function(t){return arguments.length?(r=!!t,i):r},i.size=function(n){return arguments.length?(t=+n[0],e=+n[1],i):[t,e]},i.padding=function(t){return arguments.length?(n=+t,i):n},i},zd={depth:-1},Ud={};function $d(t){return t.id}function Wd(t){return t.parentId}var Hd=function(){var t=$d,e=Wd;function n(n){var r,i,a,o,s,c,u,l=n.length,h=new Array(l),f={};for(i=0;i<l;++i)r=n[i],s=h[i]=new dd(r),null!=(c=t(r,i,n))&&(c+="")&&(f[u="$"+(s.id=c)]=u in f?Ud:s);for(i=0;i<l;++i)if(s=h[i],null!=(c=e(n[i],i,n))&&(c+="")){if(!(o=f["$"+c]))throw new Error("missing: "+c);if(o===Ud)throw new Error("ambiguous: "+c);o.children?o.children.push(s):o.children=[s],s.parent=o}else{if(a)throw new Error("multiple roots");a=s}if(!a)throw new Error("no root");if(a.parent=zd,a.eachBefore((function(t){t.depth=t.parent.depth+1,--l})).eachBefore(fd),a.parent=null,l>0)throw new Error("cycle");return a}return n.id=function(e){return arguments.length?(t=Od(e),n):t},n.parentId=function(t){return arguments.length?(e=Od(t),n):e},n};function Vd(t,e){return t.parent===e.parent?1:2}function Gd(t){var e=t.children;return e?e[0]:t.t}function qd(t){var e=t.children;return e?e[e.length-1]:t.t}function Xd(t,e,n){var r=n/(e.i-t.i);e.c-=r,e.s+=n,t.c+=r,e.z+=n,e.m+=n}function Zd(t,e,n){return t.a.parent===e.parent?t.a:n}function Jd(t,e){this._=t,this.parent=null,this.children=null,this.A=null,this.a=this,this.z=0,this.m=0,this.c=0,this.s=0,this.t=null,this.i=e}Jd.prototype=Object.create(dd.prototype);var Kd=function(){var t=Vd,e=1,n=1,r=null;function i(i){var c=function(t){for(var e,n,r,i,a,o=new Jd(t,0),s=[o];e=s.pop();)if(r=e._.children)for(e.children=new Array(a=r.length),i=a-1;i>=0;--i)s.push(n=e.children[i]=new Jd(r[i],i)),n.parent=e;return(o.parent=new Jd(null,0)).children=[o],o}(i);if(c.eachAfter(a),c.parent.m=-c.z,c.eachBefore(o),r)i.eachBefore(s);else{var u=i,l=i,h=i;i.eachBefore((function(t){t.x<u.x&&(u=t),t.x>l.x&&(l=t),t.depth>h.depth&&(h=t)}));var f=u===l?1:t(u,l)/2,d=f-u.x,p=e/(l.x+f+d),g=n/(h.depth||1);i.eachBefore((function(t){t.x=(t.x+d)*p,t.y=t.depth*g}))}return i}function a(e){var n=e.children,r=e.parent.children,i=e.i?r[e.i-1]:null;if(n){!function(t){for(var e,n=0,r=0,i=t.children,a=i.length;--a>=0;)(e=i[a]).z+=n,e.m+=n,n+=e.s+(r+=e.c)}(e);var a=(n[0].z+n[n.length-1].z)/2;i?(e.z=i.z+t(e._,i._),e.m=e.z-a):e.z=a}else i&&(e.z=i.z+t(e._,i._));e.parent.A=function(e,n,r){if(n){for(var i,a=e,o=e,s=n,c=a.parent.children[0],u=a.m,l=o.m,h=s.m,f=c.m;s=qd(s),a=Gd(a),s&&a;)c=Gd(c),(o=qd(o)).a=e,(i=s.z+h-a.z-u+t(s._,a._))>0&&(Xd(Zd(s,e,r),e,i),u+=i,l+=i),h+=s.m,u+=a.m,f+=c.m,l+=o.m;s&&!qd(o)&&(o.t=s,o.m+=h-l),a&&!Gd(c)&&(c.t=a,c.m+=u-f,r=e)}return r}(e,i,e.parent.A||r[0])}function o(t){t._.x=t.z+t.parent.m,t.m+=t.parent.m}function s(t){t.x*=e,t.y=t.depth*n}return i.separation=function(e){return arguments.length?(t=e,i):t},i.size=function(t){return arguments.length?(r=!1,e=+t[0],n=+t[1],i):r?null:[e,n]},i.nodeSize=function(t){return arguments.length?(r=!0,e=+t[0],n=+t[1],i):r?[e,n]:null},i},Qd=function(t,e,n,r,i){for(var a,o=t.children,s=-1,c=o.length,u=t.value&&(i-n)/t.value;++s<c;)(a=o[s]).x0=e,a.x1=r,a.y0=n,a.y1=n+=a.value*u},tp=(1+Math.sqrt(5))/2;function ep(t,e,n,r,i,a){for(var o,s,c,u,l,h,f,d,p,g,y,v=[],m=e.children,b=0,x=0,_=m.length,k=e.value;b<_;){c=i-n,u=a-r;do{l=m[x++].value}while(!l&&x<_);for(h=f=l,y=l*l*(g=Math.max(u/c,c/u)/(k*t)),p=Math.max(f/y,y/h);x<_;++x){if(l+=s=m[x].value,s<h&&(h=s),s>f&&(f=s),y=l*l*g,(d=Math.max(f/y,y/h))>p){l-=s;break}p=d}v.push(o={value:l,dice:c<u,children:m.slice(b,x)}),o.dice?Rd(o,n,r,i,k?r+=u*l/k:a):Qd(o,n,r,k?n+=c*l/k:i,a),k-=l,b=x}return v}var np=function t(e){function n(t,n,r,i,a){ep(e,t,n,r,i,a)}return n.ratio=function(e){return t((e=+e)>1?e:1)},n}(tp),rp=function(){var t=np,e=!1,n=1,r=1,i=[0],a=Dd,o=Dd,s=Dd,c=Dd,u=Dd;function l(t){return t.x0=t.y0=0,t.x1=n,t.y1=r,t.eachBefore(h),i=[0],e&&t.eachBefore(jd),t}function h(e){var n=i[e.depth],r=e.x0+n,l=e.y0+n,h=e.x1-n,f=e.y1-n;h<r&&(r=h=(r+h)/2),f<l&&(l=f=(l+f)/2),e.x0=r,e.y0=l,e.x1=h,e.y1=f,e.children&&(n=i[e.depth+1]=a(e)/2,r+=u(e)-n,l+=o(e)-n,(h-=s(e)-n)<r&&(r=h=(r+h)/2),(f-=c(e)-n)<l&&(l=f=(l+f)/2),t(e,r,l,h,f))}return l.round=function(t){return arguments.length?(e=!!t,l):e},l.size=function(t){return arguments.length?(n=+t[0],r=+t[1],l):[n,r]},l.tile=function(e){return arguments.length?(t=Od(e),l):t},l.padding=function(t){return arguments.length?l.paddingInner(t).paddingOuter(t):l.paddingInner()},l.paddingInner=function(t){return arguments.length?(a="function"==typeof t?t:Nd(+t),l):a},l.paddingOuter=function(t){return arguments.length?l.paddingTop(t).paddingRight(t).paddingBottom(t).paddingLeft(t):l.paddingTop()},l.paddingTop=function(t){return arguments.length?(o="function"==typeof t?t:Nd(+t),l):o},l.paddingRight=function(t){return arguments.length?(s="function"==typeof t?t:Nd(+t),l):s},l.paddingBottom=function(t){return arguments.length?(c="function"==typeof t?t:Nd(+t),l):c},l.paddingLeft=function(t){return arguments.length?(u="function"==typeof t?t:Nd(+t),l):u},l},ip=function(t,e,n,r,i){var a,o,s=t.children,c=s.length,u=new Array(c+1);for(u[0]=o=a=0;a<c;++a)u[a+1]=o+=s[a].value;!function t(e,n,r,i,a,o,c){if(e>=n-1){var l=s[e];return l.x0=i,l.y0=a,l.x1=o,void(l.y1=c)}var h=u[e],f=r/2+h,d=e+1,p=n-1;for(;d<p;){var g=d+p>>>1;u[g]<f?d=g+1:p=g}f-u[d-1]<u[d]-f&&e+1<d&&--d;var y=u[d]-h,v=r-y;if(o-i>c-a){var m=(i*v+o*y)/r;t(e,d,y,i,a,m,c),t(d,n,v,m,a,o,c)}else{var b=(a*v+c*y)/r;t(e,d,y,i,a,o,b),t(d,n,v,i,b,o,c)}}(0,c,t.value,e,n,r,i)},ap=function(t,e,n,r,i){(1&t.depth?Qd:Rd)(t,e,n,r,i)},op=function t(e){function n(t,n,r,i,a){if((o=t._squarify)&&o.ratio===e)for(var o,s,c,u,l,h=-1,f=o.length,d=t.value;++h<f;){for(c=(s=o[h]).children,u=s.value=0,l=c.length;u<l;++u)s.value+=c[u].value;s.dice?Rd(s,n,r,i,r+=(a-r)*s.value/d):Qd(s,n,r,n+=(i-n)*s.value/d,a),d-=s.value}else t._squarify=o=ep(e,t,n,r,i,a),o.ratio=e}return n.ratio=function(e){return t((e=+e)>1?e:1)},n}(tp),sp=function(t){var e=t.length;return function(n){return t[Math.max(0,Math.min(e-1,Math.floor(n*e)))]}},cp=function(t,e){var n=un(+t,+e);return function(t){var e=n(t);return e-360*Math.floor(e/360)}},up=function(t,e){return t=+t,e=+e,function(n){return Math.round(t*(1-n)+e*n)}},lp=Math.SQRT2;function hp(t){return((t=Math.exp(t))+1/t)/2}var fp=function(t,e){var n,r,i=t[0],a=t[1],o=t[2],s=e[0],c=e[1],u=e[2],l=s-i,h=c-a,f=l*l+h*h;if(f<1e-12)r=Math.log(u/o)/lp,n=function(t){return[i+t*l,a+t*h,o*Math.exp(lp*t*r)]};else{var d=Math.sqrt(f),p=(u*u-o*o+4*f)/(2*o*2*d),g=(u*u-o*o-4*f)/(2*u*2*d),y=Math.log(Math.sqrt(p*p+1)-p),v=Math.log(Math.sqrt(g*g+1)-g);r=(v-y)/lp,n=function(t){var e,n=t*r,s=hp(y),c=o/(2*d)*(s*(e=lp*n+y,((e=Math.exp(2*e))-1)/(e+1))-function(t){return((t=Math.exp(t))-1/t)/2}(y));return[i+c*l,a+c*h,o*s/hp(lp*n+y)]}}return n.duration=1e3*r,n};function dp(t){return function(e,n){var r=t((e=tn(e)).h,(n=tn(n)).h),i=hn(e.s,n.s),a=hn(e.l,n.l),o=hn(e.opacity,n.opacity);return function(t){return e.h=r(t),e.s=i(t),e.l=a(t),e.opacity=o(t),e+""}}}var pp=dp(un),gp=dp(hn);function yp(t,e){var n=hn((t=pa(t)).l,(e=pa(e)).l),r=hn(t.a,e.a),i=hn(t.b,e.b),a=hn(t.opacity,e.opacity);return function(e){return t.l=n(e),t.a=r(e),t.b=i(e),t.opacity=a(e),t+""}}function vp(t){return function(e,n){var r=t((e=ka(e)).h,(n=ka(n)).h),i=hn(e.c,n.c),a=hn(e.l,n.l),o=hn(e.opacity,n.opacity);return function(t){return e.h=r(t),e.c=i(t),e.l=a(t),e.opacity=o(t),e+""}}}var mp=vp(un),bp=vp(hn);function xp(t){return function e(n){function r(e,r){var i=t((e=Oa(e)).h,(r=Oa(r)).h),a=hn(e.s,r.s),o=hn(e.l,r.l),s=hn(e.opacity,r.opacity);return function(t){return e.h=i(t),e.s=a(t),e.l=o(Math.pow(t,n)),e.opacity=s(t),e+""}}return n=+n,r.gamma=e,r}(1)}var _p=xp(un),kp=xp(hn);function wp(t,e){for(var n=0,r=e.length-1,i=e[0],a=new Array(r<0?0:r);n<r;)a[n]=t(i,i=e[++n]);return function(t){var e=Math.max(0,Math.min(r-1,Math.floor(t*=r)));return a[e](t-e)}}var Ep=function(t,e){for(var n=new Array(e),r=0;r<e;++r)n[r]=t(r/(e-1));return n},Tp=function(t){for(var e,n=-1,r=t.length,i=t[r-1],a=0;++n<r;)e=i,i=t[n],a+=e[1]*i[0]-e[0]*i[1];return a/2},Cp=function(t){for(var e,n,r=-1,i=t.length,a=0,o=0,s=t[i-1],c=0;++r<i;)e=s,s=t[r],c+=n=e[0]*s[1]-s[0]*e[1],a+=(e[0]+s[0])*n,o+=(e[1]+s[1])*n;return[a/(c*=3),o/c]};function Ap(t,e){return t[0]-e[0]||t[1]-e[1]}function Sp(t){for(var e,n,r,i=t.length,a=[0,1],o=2,s=2;s<i;++s){for(;o>1&&(e=t[a[o-2]],n=t[a[o-1]],r=t[s],(n[0]-e[0])*(r[1]-e[1])-(n[1]-e[1])*(r[0]-e[0])<=0);)--o;a[o++]=s}return a.slice(0,o)}var Mp=function(t){if((n=t.length)<3)return null;var e,n,r=new Array(n),i=new Array(n);for(e=0;e<n;++e)r[e]=[+t[e][0],+t[e][1],e];for(r.sort(Ap),e=0;e<n;++e)i[e]=[r[e][0],-r[e][1]];var a=Sp(r),o=Sp(i),s=o[0]===a[0],c=o[o.length-1]===a[a.length-1],u=[];for(e=a.length-1;e>=0;--e)u.push(t[r[a[e]][2]]);for(e=+s;e<o.length-c;++e)u.push(t[r[o[e]][2]]);return u},Op=function(t,e){for(var n,r,i=t.length,a=t[i-1],o=e[0],s=e[1],c=a[0],u=a[1],l=!1,h=0;h<i;++h)n=(a=t[h])[0],(r=a[1])>s!=u>s&&o<(c-n)*(s-r)/(u-r)+n&&(l=!l),c=n,u=r;return l},Dp=function(t){for(var e,n,r=-1,i=t.length,a=t[i-1],o=a[0],s=a[1],c=0;++r<i;)e=o,n=s,e-=o=(a=t[r])[0],n-=s=a[1],c+=Math.sqrt(e*e+n*n);return c},Np=function(){return Math.random()},Bp=function t(e){function n(t,n){return t=null==t?0:+t,n=null==n?1:+n,1===arguments.length?(n=t,t=0):n-=t,function(){return e()*n+t}}return n.source=t,n}(Np),Lp=function t(e){function n(t,n){var r,i;return t=null==t?0:+t,n=null==n?1:+n,function(){var a;if(null!=r)a=r,r=null;else do{r=2*e()-1,a=2*e()-1,i=r*r+a*a}while(!i||i>1);return t+n*a*Math.sqrt(-2*Math.log(i)/i)}}return n.source=t,n}(Np),Pp=function t(e){function n(){var t=Lp.source(e).apply(this,arguments);return function(){return Math.exp(t())}}return n.source=t,n}(Np),Ip=function t(e){function n(t){return function(){for(var n=0,r=0;r<t;++r)n+=e();return n}}return n.source=t,n}(Np),Fp=function t(e){function n(t){var n=Ip.source(e)(t);return function(){return n()/t}}return n.source=t,n}(Np),jp=function t(e){function n(t){return function(){return-Math.log(1-e())/t}}return n.source=t,n}(Np);function Rp(t,e){switch(arguments.length){case 0:break;case 1:this.range(t);break;default:this.range(e).domain(t)}return this}function Yp(t,e){switch(arguments.length){case 0:break;case 1:this.interpolator(t);break;default:this.interpolator(e).domain(t)}return this}var zp=Array.prototype,Up=zp.map,$p=zp.slice,Wp={name:"implicit"};function Hp(){var t=Ji(),e=[],n=[],r=Wp;function i(i){var a=i+"",o=t.get(a);if(!o){if(r!==Wp)return r;t.set(a,o=e.push(i))}return n[(o-1)%n.length]}return i.domain=function(n){if(!arguments.length)return e.slice();e=[],t=Ji();for(var r,a,o=-1,s=n.length;++o<s;)t.has(a=(r=n[o])+"")||t.set(a,e.push(r));return i},i.range=function(t){return arguments.length?(n=$p.call(t),i):n.slice()},i.unknown=function(t){return arguments.length?(r=t,i):r},i.copy=function(){return Hp(e,n).unknown(r)},Rp.apply(i,arguments),i}function Vp(){var t,e,n=Hp().unknown(void 0),r=n.domain,i=n.range,a=[0,1],o=!1,s=0,c=0,u=.5;function l(){var n=r().length,l=a[1]<a[0],h=a[l-0],f=a[1-l];t=(f-h)/Math.max(1,n-s+2*c),o&&(t=Math.floor(t)),h+=(f-h-t*(n-s))*u,e=t*(1-s),o&&(h=Math.round(h),e=Math.round(e));var d=k(n).map((function(e){return h+t*e}));return i(l?d.reverse():d)}return delete n.unknown,n.domain=function(t){return arguments.length?(r(t),l()):r()},n.range=function(t){return arguments.length?(a=[+t[0],+t[1]],l()):a.slice()},n.rangeRound=function(t){return a=[+t[0],+t[1]],o=!0,l()},n.bandwidth=function(){return e},n.step=function(){return t},n.round=function(t){return arguments.length?(o=!!t,l()):o},n.padding=function(t){return arguments.length?(s=Math.min(1,c=+t),l()):s},n.paddingInner=function(t){return arguments.length?(s=Math.min(1,t),l()):s},n.paddingOuter=function(t){return arguments.length?(c=+t,l()):c},n.align=function(t){return arguments.length?(u=Math.max(0,Math.min(1,t)),l()):u},n.copy=function(){return Vp(r(),a).round(o).paddingInner(s).paddingOuter(c).align(u)},Rp.apply(l(),arguments)}function Gp(t){var e=t.copy;return t.padding=t.paddingOuter,delete t.paddingInner,delete t.paddingOuter,t.copy=function(){return Gp(e())},t}function qp(){return Gp(Vp.apply(null,arguments).paddingInner(1))}var Xp=function(t){return+t},Zp=[0,1];function Jp(t){return t}function Kp(t,e){return(e-=t=+t)?function(n){return(n-t)/e}:(n=isNaN(e)?NaN:.5,function(){return n});var n}function Qp(t){var e,n=t[0],r=t[t.length-1];return n>r&&(e=n,n=r,r=e),function(t){return Math.max(n,Math.min(r,t))}}function tg(t,e,n){var r=t[0],i=t[1],a=e[0],o=e[1];return i<r?(r=Kp(i,r),a=n(o,a)):(r=Kp(r,i),a=n(a,o)),function(t){return a(r(t))}}function eg(t,e,n){var r=Math.min(t.length,e.length)-1,i=new Array(r),a=new Array(r),o=-1;for(t[r]<t[0]&&(t=t.slice().reverse(),e=e.slice().reverse());++o<r;)i[o]=Kp(t[o],t[o+1]),a[o]=n(e[o],e[o+1]);return function(e){var n=c(t,e,1,r)-1;return a[n](i[n](e))}}function ng(t,e){return e.domain(t.domain()).range(t.range()).interpolate(t.interpolate()).clamp(t.clamp()).unknown(t.unknown())}function rg(){var t,e,n,r,i,a,o=Zp,s=Zp,c=Sn,u=Jp;function l(){return r=Math.min(o.length,s.length)>2?eg:tg,i=a=null,h}function h(e){return isNaN(e=+e)?n:(i||(i=r(o.map(t),s,c)))(t(u(e)))}return h.invert=function(n){return u(e((a||(a=r(s,o.map(t),_n)))(n)))},h.domain=function(t){return arguments.length?(o=Up.call(t,Xp),u===Jp||(u=Qp(o)),l()):o.slice()},h.range=function(t){return arguments.length?(s=$p.call(t),l()):s.slice()},h.rangeRound=function(t){return s=$p.call(t),c=up,l()},h.clamp=function(t){return arguments.length?(u=t?Qp(o):Jp,h):u!==Jp},h.interpolate=function(t){return arguments.length?(c=t,l()):c},h.unknown=function(t){return arguments.length?(n=t,h):n},function(n,r){return t=n,e=r,l()}}function ig(t,e){return rg()(t,e)}var ag=function(t,e,n,r){var i,a=S(t,e,n);switch((r=Hs(null==r?",f":r)).type){case"s":var o=Math.max(Math.abs(t),Math.abs(e));return null!=r.precision||isNaN(i=ac(a,o))||(r.precision=i),Zs(r,o);case"":case"e":case"g":case"p":case"r":null!=r.precision||isNaN(i=oc(a,Math.max(Math.abs(t),Math.abs(e))))||(r.precision=i-("e"===r.type));break;case"f":case"%":null!=r.precision||isNaN(i=ic(a))||(r.precision=i-2*("%"===r.type))}return Xs(r)};function og(t){var e=t.domain;return t.ticks=function(t){var n=e();return C(n[0],n[n.length-1],null==t?10:t)},t.tickFormat=function(t,n){var r=e();return ag(r[0],r[r.length-1],null==t?10:t,n)},t.nice=function(n){null==n&&(n=10);var r,i=e(),a=0,o=i.length-1,s=i[a],c=i[o];return c<s&&(r=s,s=c,c=r,r=a,a=o,o=r),(r=A(s,c,n))>0?r=A(s=Math.floor(s/r)*r,c=Math.ceil(c/r)*r,n):r<0&&(r=A(s=Math.ceil(s*r)/r,c=Math.floor(c*r)/r,n)),r>0?(i[a]=Math.floor(s/r)*r,i[o]=Math.ceil(c/r)*r,e(i)):r<0&&(i[a]=Math.ceil(s*r)/r,i[o]=Math.floor(c*r)/r,e(i)),t},t}function sg(){var t=ig(Jp,Jp);return t.copy=function(){return ng(t,sg())},Rp.apply(t,arguments),og(t)}function cg(t){var e;function n(t){return isNaN(t=+t)?e:t}return n.invert=n,n.domain=n.range=function(e){return arguments.length?(t=Up.call(e,Xp),n):t.slice()},n.unknown=function(t){return arguments.length?(e=t,n):e},n.copy=function(){return cg(t).unknown(e)},t=arguments.length?Up.call(t,Xp):[0,1],og(n)}var ug=function(t,e){var n,r=0,i=(t=t.slice()).length-1,a=t[r],o=t[i];return o<a&&(n=r,r=i,i=n,n=a,a=o,o=n),t[r]=e.floor(a),t[i]=e.ceil(o),t};function lg(t){return Math.log(t)}function hg(t){return Math.exp(t)}function fg(t){return-Math.log(-t)}function dg(t){return-Math.exp(-t)}function pg(t){return isFinite(t)?+("1e"+t):t<0?0:t}function gg(t){return function(e){return-t(-e)}}function yg(t){var e,n,r=t(lg,hg),i=r.domain,a=10;function o(){return e=function(t){return t===Math.E?Math.log:10===t&&Math.log10||2===t&&Math.log2||(t=Math.log(t),function(e){return Math.log(e)/t})}(a),n=function(t){return 10===t?pg:t===Math.E?Math.exp:function(e){return Math.pow(t,e)}}(a),i()[0]<0?(e=gg(e),n=gg(n),t(fg,dg)):t(lg,hg),r}return r.base=function(t){return arguments.length?(a=+t,o()):a},r.domain=function(t){return arguments.length?(i(t),o()):i()},r.ticks=function(t){var r,o=i(),s=o[0],c=o[o.length-1];(r=c<s)&&(f=s,s=c,c=f);var u,l,h,f=e(s),d=e(c),p=null==t?10:+t,g=[];if(!(a%1)&&d-f<p){if(f=Math.round(f)-1,d=Math.round(d)+1,s>0){for(;f<d;++f)for(l=1,u=n(f);l<a;++l)if(!((h=u*l)<s)){if(h>c)break;g.push(h)}}else for(;f<d;++f)for(l=a-1,u=n(f);l>=1;--l)if(!((h=u*l)<s)){if(h>c)break;g.push(h)}}else g=C(f,d,Math.min(d-f,p)).map(n);return r?g.reverse():g},r.tickFormat=function(t,i){if(null==i&&(i=10===a?".0e":","),"function"!=typeof i&&(i=Xs(i)),t===1/0)return i;null==t&&(t=10);var o=Math.max(1,a*t/r.ticks().length);return function(t){var r=t/n(Math.round(e(t)));return r*a<a-.5&&(r*=a),r<=o?i(t):""}},r.nice=function(){return i(ug(i(),{floor:function(t){return n(Math.floor(e(t)))},ceil:function(t){return n(Math.ceil(e(t)))}}))},r}function vg(){var t=yg(rg()).domain([1,10]);return t.copy=function(){return ng(t,vg()).base(t.base())},Rp.apply(t,arguments),t}function mg(t){return function(e){return Math.sign(e)*Math.log1p(Math.abs(e/t))}}function bg(t){return function(e){return Math.sign(e)*Math.expm1(Math.abs(e))*t}}function xg(t){var e=1,n=t(mg(e),bg(e));return n.constant=function(n){return arguments.length?t(mg(e=+n),bg(e)):e},og(n)}function _g(){var t=xg(rg());return t.copy=function(){return ng(t,_g()).constant(t.constant())},Rp.apply(t,arguments)}function kg(t){return function(e){return e<0?-Math.pow(-e,t):Math.pow(e,t)}}function wg(t){return t<0?-Math.sqrt(-t):Math.sqrt(t)}function Eg(t){return t<0?-t*t:t*t}function Tg(t){var e=t(Jp,Jp),n=1;function r(){return 1===n?t(Jp,Jp):.5===n?t(wg,Eg):t(kg(n),kg(1/n))}return e.exponent=function(t){return arguments.length?(n=+t,r()):n},og(e)}function Cg(){var t=Tg(rg());return t.copy=function(){return ng(t,Cg()).exponent(t.exponent())},Rp.apply(t,arguments),t}function Ag(){return Cg.apply(null,arguments).exponent(.5)}function Sg(){var t,e=[],n=[],i=[];function a(){var t=0,r=Math.max(1,n.length);for(i=new Array(r-1);++t<r;)i[t-1]=D(e,t/r);return o}function o(e){return isNaN(e=+e)?t:n[c(i,e)]}return o.invertExtent=function(t){var r=n.indexOf(t);return r<0?[NaN,NaN]:[r>0?i[r-1]:e[0],r<i.length?i[r]:e[e.length-1]]},o.domain=function(t){if(!arguments.length)return e.slice();e=[];for(var n,i=0,o=t.length;i<o;++i)null==(n=t[i])||isNaN(n=+n)||e.push(n);return e.sort(r),a()},o.range=function(t){return arguments.length?(n=$p.call(t),a()):n.slice()},o.unknown=function(e){return arguments.length?(t=e,o):t},o.quantiles=function(){return i.slice()},o.copy=function(){return Sg().domain(e).range(n).unknown(t)},Rp.apply(o,arguments)}function Mg(){var t,e=0,n=1,r=1,i=[.5],a=[0,1];function o(e){return e<=e?a[c(i,e,0,r)]:t}function s(){var t=-1;for(i=new Array(r);++t<r;)i[t]=((t+1)*n-(t-r)*e)/(r+1);return o}return o.domain=function(t){return arguments.length?(e=+t[0],n=+t[1],s()):[e,n]},o.range=function(t){return arguments.length?(r=(a=$p.call(t)).length-1,s()):a.slice()},o.invertExtent=function(t){var o=a.indexOf(t);return o<0?[NaN,NaN]:o<1?[e,i[0]]:o>=r?[i[r-1],n]:[i[o-1],i[o]]},o.unknown=function(e){return arguments.length?(t=e,o):o},o.thresholds=function(){return i.slice()},o.copy=function(){return Mg().domain([e,n]).range(a).unknown(t)},Rp.apply(og(o),arguments)}function Og(){var t,e=[.5],n=[0,1],r=1;function i(i){return i<=i?n[c(e,i,0,r)]:t}return i.domain=function(t){return arguments.length?(e=$p.call(t),r=Math.min(e.length,n.length-1),i):e.slice()},i.range=function(t){return arguments.length?(n=$p.call(t),r=Math.min(e.length,n.length-1),i):n.slice()},i.invertExtent=function(t){var r=n.indexOf(t);return[e[r-1],e[r]]},i.unknown=function(e){return arguments.length?(t=e,i):t},i.copy=function(){return Og().domain(e).range(n).unknown(t)},Rp.apply(i,arguments)}var Dg=new Date,Ng=new Date;function Bg(t,e,n,r){function i(e){return t(e=0===arguments.length?new Date:new Date(+e)),e}return i.floor=function(e){return t(e=new Date(+e)),e},i.ceil=function(n){return t(n=new Date(n-1)),e(n,1),t(n),n},i.round=function(t){var e=i(t),n=i.ceil(t);return t-e<n-t?e:n},i.offset=function(t,n){return e(t=new Date(+t),null==n?1:Math.floor(n)),t},i.range=function(n,r,a){var o,s=[];if(n=i.ceil(n),a=null==a?1:Math.floor(a),!(n<r&&a>0))return s;do{s.push(o=new Date(+n)),e(n,a),t(n)}while(o<n&&n<r);return s},i.filter=function(n){return Bg((function(e){if(e>=e)for(;t(e),!n(e);)e.setTime(e-1)}),(function(t,r){if(t>=t)if(r<0)for(;++r<=0;)for(;e(t,-1),!n(t););else for(;--r>=0;)for(;e(t,1),!n(t););}))},n&&(i.count=function(e,r){return Dg.setTime(+e),Ng.setTime(+r),t(Dg),t(Ng),Math.floor(n(Dg,Ng))},i.every=function(t){return t=Math.floor(t),isFinite(t)&&t>0?t>1?i.filter(r?function(e){return r(e)%t==0}:function(e){return i.count(0,e)%t==0}):i:null}),i}var Lg=Bg((function(t){t.setMonth(0,1),t.setHours(0,0,0,0)}),(function(t,e){t.setFullYear(t.getFullYear()+e)}),(function(t,e){return e.getFullYear()-t.getFullYear()}),(function(t){return t.getFullYear()}));Lg.every=function(t){return isFinite(t=Math.floor(t))&&t>0?Bg((function(e){e.setFullYear(Math.floor(e.getFullYear()/t)*t),e.setMonth(0,1),e.setHours(0,0,0,0)}),(function(e,n){e.setFullYear(e.getFullYear()+n*t)})):null};var Pg=Lg,Ig=Lg.range,Fg=Bg((function(t){t.setDate(1),t.setHours(0,0,0,0)}),(function(t,e){t.setMonth(t.getMonth()+e)}),(function(t,e){return e.getMonth()-t.getMonth()+12*(e.getFullYear()-t.getFullYear())}),(function(t){return t.getMonth()})),jg=Fg,Rg=Fg.range;function Yg(t){return Bg((function(e){e.setDate(e.getDate()-(e.getDay()+7-t)%7),e.setHours(0,0,0,0)}),(function(t,e){t.setDate(t.getDate()+7*e)}),(function(t,e){return(e-t-6e4*(e.getTimezoneOffset()-t.getTimezoneOffset()))/6048e5}))}var zg=Yg(0),Ug=Yg(1),$g=Yg(2),Wg=Yg(3),Hg=Yg(4),Vg=Yg(5),Gg=Yg(6),qg=zg.range,Xg=Ug.range,Zg=$g.range,Jg=Wg.range,Kg=Hg.range,Qg=Vg.range,ty=Gg.range,ey=Bg((function(t){t.setHours(0,0,0,0)}),(function(t,e){t.setDate(t.getDate()+e)}),(function(t,e){return(e-t-6e4*(e.getTimezoneOffset()-t.getTimezoneOffset()))/864e5}),(function(t){return t.getDate()-1})),ny=ey,ry=ey.range,iy=Bg((function(t){t.setTime(t-t.getMilliseconds()-1e3*t.getSeconds()-6e4*t.getMinutes())}),(function(t,e){t.setTime(+t+36e5*e)}),(function(t,e){return(e-t)/36e5}),(function(t){return t.getHours()})),ay=iy,oy=iy.range,sy=Bg((function(t){t.setTime(t-t.getMilliseconds()-1e3*t.getSeconds())}),(function(t,e){t.setTime(+t+6e4*e)}),(function(t,e){return(e-t)/6e4}),(function(t){return t.getMinutes()})),cy=sy,uy=sy.range,ly=Bg((function(t){t.setTime(t-t.getMilliseconds())}),(function(t,e){t.setTime(+t+1e3*e)}),(function(t,e){return(e-t)/1e3}),(function(t){return t.getUTCSeconds()})),hy=ly,fy=ly.range,dy=Bg((function(){}),(function(t,e){t.setTime(+t+e)}),(function(t,e){return e-t}));dy.every=function(t){return t=Math.floor(t),isFinite(t)&&t>0?t>1?Bg((function(e){e.setTime(Math.floor(e/t)*t)}),(function(e,n){e.setTime(+e+n*t)}),(function(e,n){return(n-e)/t})):dy:null};var py=dy,gy=dy.range;function yy(t){return Bg((function(e){e.setUTCDate(e.getUTCDate()-(e.getUTCDay()+7-t)%7),e.setUTCHours(0,0,0,0)}),(function(t,e){t.setUTCDate(t.getUTCDate()+7*e)}),(function(t,e){return(e-t)/6048e5}))}var vy=yy(0),my=yy(1),by=yy(2),xy=yy(3),_y=yy(4),ky=yy(5),wy=yy(6),Ey=vy.range,Ty=my.range,Cy=by.range,Ay=xy.range,Sy=_y.range,My=ky.range,Oy=wy.range,Dy=Bg((function(t){t.setUTCHours(0,0,0,0)}),(function(t,e){t.setUTCDate(t.getUTCDate()+e)}),(function(t,e){return(e-t)/864e5}),(function(t){return t.getUTCDate()-1})),Ny=Dy,By=Dy.range,Ly=Bg((function(t){t.setUTCMonth(0,1),t.setUTCHours(0,0,0,0)}),(function(t,e){t.setUTCFullYear(t.getUTCFullYear()+e)}),(function(t,e){return e.getUTCFullYear()-t.getUTCFullYear()}),(function(t){return t.getUTCFullYear()}));Ly.every=function(t){return isFinite(t=Math.floor(t))&&t>0?Bg((function(e){e.setUTCFullYear(Math.floor(e.getUTCFullYear()/t)*t),e.setUTCMonth(0,1),e.setUTCHours(0,0,0,0)}),(function(e,n){e.setUTCFullYear(e.getUTCFullYear()+n*t)})):null};var Py=Ly,Iy=Ly.range;function Fy(t){if(0<=t.y&&t.y<100){var e=new Date(-1,t.m,t.d,t.H,t.M,t.S,t.L);return e.setFullYear(t.y),e}return new Date(t.y,t.m,t.d,t.H,t.M,t.S,t.L)}function jy(t){if(0<=t.y&&t.y<100){var e=new Date(Date.UTC(-1,t.m,t.d,t.H,t.M,t.S,t.L));return e.setUTCFullYear(t.y),e}return new Date(Date.UTC(t.y,t.m,t.d,t.H,t.M,t.S,t.L))}function Ry(t,e,n){return{y:t,m:e,d:n,H:0,M:0,S:0,L:0}}function Yy(t){var e=t.dateTime,n=t.date,r=t.time,i=t.periods,a=t.days,o=t.shortDays,s=t.months,c=t.shortMonths,u=Ky(i),l=Qy(i),h=Ky(a),f=Qy(a),d=Ky(o),p=Qy(o),g=Ky(s),y=Qy(s),v=Ky(c),m=Qy(c),b={a:function(t){return o[t.getDay()]},A:function(t){return a[t.getDay()]},b:function(t){return c[t.getMonth()]},B:function(t){return s[t.getMonth()]},c:null,d:xv,e:xv,f:Tv,H:_v,I:kv,j:wv,L:Ev,m:Cv,M:Av,p:function(t){return i[+(t.getHours()>=12)]},q:function(t){return 1+~~(t.getMonth()/3)},Q:em,s:nm,S:Sv,u:Mv,U:Ov,V:Dv,w:Nv,W:Bv,x:null,X:null,y:Lv,Y:Pv,Z:Iv,"%":tm},x={a:function(t){return o[t.getUTCDay()]},A:function(t){return a[t.getUTCDay()]},b:function(t){return c[t.getUTCMonth()]},B:function(t){return s[t.getUTCMonth()]},c:null,d:Fv,e:Fv,f:Uv,H:jv,I:Rv,j:Yv,L:zv,m:$v,M:Wv,p:function(t){return i[+(t.getUTCHours()>=12)]},q:function(t){return 1+~~(t.getUTCMonth()/3)},Q:em,s:nm,S:Hv,u:Vv,U:Gv,V:qv,w:Xv,W:Zv,x:null,X:null,y:Jv,Y:Kv,Z:Qv,"%":tm},_={a:function(t,e,n){var r=d.exec(e.slice(n));return r?(t.w=p[r[0].toLowerCase()],n+r[0].length):-1},A:function(t,e,n){var r=h.exec(e.slice(n));return r?(t.w=f[r[0].toLowerCase()],n+r[0].length):-1},b:function(t,e,n){var r=v.exec(e.slice(n));return r?(t.m=m[r[0].toLowerCase()],n+r[0].length):-1},B:function(t,e,n){var r=g.exec(e.slice(n));return r?(t.m=y[r[0].toLowerCase()],n+r[0].length):-1},c:function(t,n,r){return E(t,e,n,r)},d:lv,e:lv,f:yv,H:fv,I:fv,j:hv,L:gv,m:uv,M:dv,p:function(t,e,n){var r=u.exec(e.slice(n));return r?(t.p=l[r[0].toLowerCase()],n+r[0].length):-1},q:cv,Q:mv,s:bv,S:pv,u:ev,U:nv,V:rv,w:tv,W:iv,x:function(t,e,r){return E(t,n,e,r)},X:function(t,e,n){return E(t,r,e,n)},y:ov,Y:av,Z:sv,"%":vv};function k(t,e){return function(n){var r,i,a,o=[],s=-1,c=0,u=t.length;for(n instanceof Date||(n=new Date(+n));++s<u;)37===t.charCodeAt(s)&&(o.push(t.slice(c,s)),null!=(i=Vy[r=t.charAt(++s)])?r=t.charAt(++s):i="e"===r?" ":"0",(a=e[r])&&(r=a(n,i)),o.push(r),c=s+1);return o.push(t.slice(c,s)),o.join("")}}function w(t,e){return function(n){var r,i,a=Ry(1900,void 0,1);if(E(a,t,n+="",0)!=n.length)return null;if("Q"in a)return new Date(a.Q);if("s"in a)return new Date(1e3*a.s+("L"in a?a.L:0));if(!e||"Z"in a||(a.Z=0),"p"in a&&(a.H=a.H%12+12*a.p),void 0===a.m&&(a.m="q"in a?a.q:0),"V"in a){if(a.V<1||a.V>53)return null;"w"in a||(a.w=1),"Z"in a?(i=(r=jy(Ry(a.y,0,1))).getUTCDay(),r=i>4||0===i?my.ceil(r):my(r),r=Ny.offset(r,7*(a.V-1)),a.y=r.getUTCFullYear(),a.m=r.getUTCMonth(),a.d=r.getUTCDate()+(a.w+6)%7):(i=(r=Fy(Ry(a.y,0,1))).getDay(),r=i>4||0===i?Ug.ceil(r):Ug(r),r=ny.offset(r,7*(a.V-1)),a.y=r.getFullYear(),a.m=r.getMonth(),a.d=r.getDate()+(a.w+6)%7)}else("W"in a||"U"in a)&&("w"in a||(a.w="u"in a?a.u%7:"W"in a?1:0),i="Z"in a?jy(Ry(a.y,0,1)).getUTCDay():Fy(Ry(a.y,0,1)).getDay(),a.m=0,a.d="W"in a?(a.w+6)%7+7*a.W-(i+5)%7:a.w+7*a.U-(i+6)%7);return"Z"in a?(a.H+=a.Z/100|0,a.M+=a.Z%100,jy(a)):Fy(a)}}function E(t,e,n,r){for(var i,a,o=0,s=e.length,c=n.length;o<s;){if(r>=c)return-1;if(37===(i=e.charCodeAt(o++))){if(i=e.charAt(o++),!(a=_[i in Vy?e.charAt(o++):i])||(r=a(t,n,r))<0)return-1}else if(i!=n.charCodeAt(r++))return-1}return r}return(b.x=k(n,b),b.X=k(r,b),b.c=k(e,b),x.x=k(n,x),x.X=k(r,x),x.c=k(e,x),{format:function(t){var e=k(t+="",b);return e.toString=function(){return t},e},parse:function(t){var e=w(t+="",!1);return e.toString=function(){return t},e},utcFormat:function(t){var e=k(t+="",x);return e.toString=function(){return t},e},utcParse:function(t){var e=w(t+="",!0);return e.toString=function(){return t},e}})}var zy,Uy,$y,Wy,Hy,Vy={"-":"",_:" ",0:"0"},Gy=/^\s*\d+/,qy=/^%/,Xy=/[\\^$*+?|[\]().{}]/g;function Zy(t,e,n){var r=t<0?"-":"",i=(r?-t:t)+"",a=i.length;return r+(a<n?new Array(n-a+1).join(e)+i:i)}function Jy(t){return t.replace(Xy,"\\$&")}function Ky(t){return new RegExp("^(?:"+t.map(Jy).join("|")+")","i")}function Qy(t){for(var e={},n=-1,r=t.length;++n<r;)e[t[n].toLowerCase()]=n;return e}function tv(t,e,n){var r=Gy.exec(e.slice(n,n+1));return r?(t.w=+r[0],n+r[0].length):-1}function ev(t,e,n){var r=Gy.exec(e.slice(n,n+1));return r?(t.u=+r[0],n+r[0].length):-1}function nv(t,e,n){var r=Gy.exec(e.slice(n,n+2));return r?(t.U=+r[0],n+r[0].length):-1}function rv(t,e,n){var r=Gy.exec(e.slice(n,n+2));return r?(t.V=+r[0],n+r[0].length):-1}function iv(t,e,n){var r=Gy.exec(e.slice(n,n+2));return r?(t.W=+r[0],n+r[0].length):-1}function av(t,e,n){var r=Gy.exec(e.slice(n,n+4));return r?(t.y=+r[0],n+r[0].length):-1}function ov(t,e,n){var r=Gy.exec(e.slice(n,n+2));return r?(t.y=+r[0]+(+r[0]>68?1900:2e3),n+r[0].length):-1}function sv(t,e,n){var r=/^(Z)|([+-]\d\d)(?::?(\d\d))?/.exec(e.slice(n,n+6));return r?(t.Z=r[1]?0:-(r[2]+(r[3]||"00")),n+r[0].length):-1}function cv(t,e,n){var r=Gy.exec(e.slice(n,n+1));return r?(t.q=3*r[0]-3,n+r[0].length):-1}function uv(t,e,n){var r=Gy.exec(e.slice(n,n+2));return r?(t.m=r[0]-1,n+r[0].length):-1}function lv(t,e,n){var r=Gy.exec(e.slice(n,n+2));return r?(t.d=+r[0],n+r[0].length):-1}function hv(t,e,n){var r=Gy.exec(e.slice(n,n+3));return r?(t.m=0,t.d=+r[0],n+r[0].length):-1}function fv(t,e,n){var r=Gy.exec(e.slice(n,n+2));return r?(t.H=+r[0],n+r[0].length):-1}function dv(t,e,n){var r=Gy.exec(e.slice(n,n+2));return r?(t.M=+r[0],n+r[0].length):-1}function pv(t,e,n){var r=Gy.exec(e.slice(n,n+2));return r?(t.S=+r[0],n+r[0].length):-1}function gv(t,e,n){var r=Gy.exec(e.slice(n,n+3));return r?(t.L=+r[0],n+r[0].length):-1}function yv(t,e,n){var r=Gy.exec(e.slice(n,n+6));return r?(t.L=Math.floor(r[0]/1e3),n+r[0].length):-1}function vv(t,e,n){var r=qy.exec(e.slice(n,n+1));return r?n+r[0].length:-1}function mv(t,e,n){var r=Gy.exec(e.slice(n));return r?(t.Q=+r[0],n+r[0].length):-1}function bv(t,e,n){var r=Gy.exec(e.slice(n));return r?(t.s=+r[0],n+r[0].length):-1}function xv(t,e){return Zy(t.getDate(),e,2)}function _v(t,e){return Zy(t.getHours(),e,2)}function kv(t,e){return Zy(t.getHours()%12||12,e,2)}function wv(t,e){return Zy(1+ny.count(Pg(t),t),e,3)}function Ev(t,e){return Zy(t.getMilliseconds(),e,3)}function Tv(t,e){return Ev(t,e)+"000"}function Cv(t,e){return Zy(t.getMonth()+1,e,2)}function Av(t,e){return Zy(t.getMinutes(),e,2)}function Sv(t,e){return Zy(t.getSeconds(),e,2)}function Mv(t){var e=t.getDay();return 0===e?7:e}function Ov(t,e){return Zy(zg.count(Pg(t)-1,t),e,2)}function Dv(t,e){var n=t.getDay();return t=n>=4||0===n?Hg(t):Hg.ceil(t),Zy(Hg.count(Pg(t),t)+(4===Pg(t).getDay()),e,2)}function Nv(t){return t.getDay()}function Bv(t,e){return Zy(Ug.count(Pg(t)-1,t),e,2)}function Lv(t,e){return Zy(t.getFullYear()%100,e,2)}function Pv(t,e){return Zy(t.getFullYear()%1e4,e,4)}function Iv(t){var e=t.getTimezoneOffset();return(e>0?"-":(e*=-1,"+"))+Zy(e/60|0,"0",2)+Zy(e%60,"0",2)}function Fv(t,e){return Zy(t.getUTCDate(),e,2)}function jv(t,e){return Zy(t.getUTCHours(),e,2)}function Rv(t,e){return Zy(t.getUTCHours()%12||12,e,2)}function Yv(t,e){return Zy(1+Ny.count(Py(t),t),e,3)}function zv(t,e){return Zy(t.getUTCMilliseconds(),e,3)}function Uv(t,e){return zv(t,e)+"000"}function $v(t,e){return Zy(t.getUTCMonth()+1,e,2)}function Wv(t,e){return Zy(t.getUTCMinutes(),e,2)}function Hv(t,e){return Zy(t.getUTCSeconds(),e,2)}function Vv(t){var e=t.getUTCDay();return 0===e?7:e}function Gv(t,e){return Zy(vy.count(Py(t)-1,t),e,2)}function qv(t,e){var n=t.getUTCDay();return t=n>=4||0===n?_y(t):_y.ceil(t),Zy(_y.count(Py(t),t)+(4===Py(t).getUTCDay()),e,2)}function Xv(t){return t.getUTCDay()}function Zv(t,e){return Zy(my.count(Py(t)-1,t),e,2)}function Jv(t,e){return Zy(t.getUTCFullYear()%100,e,2)}function Kv(t,e){return Zy(t.getUTCFullYear()%1e4,e,4)}function Qv(){return"+0000"}function tm(){return"%"}function em(t){return+t}function nm(t){return Math.floor(+t/1e3)}function rm(t){return zy=Yy(t),Uy=zy.format,$y=zy.parse,Wy=zy.utcFormat,Hy=zy.utcParse,zy}rm({dateTime:"%x, %X",date:"%-m/%-d/%Y",time:"%-I:%M:%S %p",periods:["AM","PM"],days:["Sunday","Monday","Tuesday","Wednesday","Thursday","Friday","Saturday"],shortDays:["Sun","Mon","Tue","Wed","Thu","Fri","Sat"],months:["January","February","March","April","May","June","July","August","September","October","November","December"],shortMonths:["Jan","Feb","Mar","Apr","May","Jun","Jul","Aug","Sep","Oct","Nov","Dec"]});function im(t){return new Date(t)}function am(t){return t instanceof Date?+t:+new Date(+t)}function om(t,e,n,r,a,o,s,c,u){var l=ig(Jp,Jp),h=l.invert,f=l.domain,d=u(".%L"),p=u(":%S"),g=u("%I:%M"),y=u("%I %p"),v=u("%a %d"),m=u("%b %d"),b=u("%B"),x=u("%Y"),_=[[s,1,1e3],[s,5,5e3],[s,15,15e3],[s,30,3e4],[o,1,6e4],[o,5,3e5],[o,15,9e5],[o,30,18e5],[a,1,36e5],[a,3,108e5],[a,6,216e5],[a,12,432e5],[r,1,864e5],[r,2,1728e5],[n,1,6048e5],[e,1,2592e6],[e,3,7776e6],[t,1,31536e6]];function k(i){return(s(i)<i?d:o(i)<i?p:a(i)<i?g:r(i)<i?y:e(i)<i?n(i)<i?v:m:t(i)<i?b:x)(i)}function w(e,n,r,a){if(null==e&&(e=10),"number"==typeof e){var o=Math.abs(r-n)/e,s=i((function(t){return t[2]})).right(_,o);s===_.length?(a=S(n/31536e6,r/31536e6,e),e=t):s?(a=(s=_[o/_[s-1][2]<_[s][2]/o?s-1:s])[1],e=s[0]):(a=Math.max(S(n,r,e),1),e=c)}return null==a?e:e.every(a)}return l.invert=function(t){return new Date(h(t))},l.domain=function(t){return arguments.length?f(Up.call(t,am)):f().map(im)},l.ticks=function(t,e){var n,r=f(),i=r[0],a=r[r.length-1],o=a<i;return o&&(n=i,i=a,a=n),n=(n=w(t,i,a,e))?n.range(i,a+1):[],o?n.reverse():n},l.tickFormat=function(t,e){return null==e?k:u(e)},l.nice=function(t,e){var n=f();return(t=w(t,n[0],n[n.length-1],e))?f(ug(n,t)):l},l.copy=function(){return ng(l,om(t,e,n,r,a,o,s,c,u))},l}var sm=function(){return Rp.apply(om(Pg,jg,zg,ny,ay,cy,hy,py,Uy).domain([new Date(2e3,0,1),new Date(2e3,0,2)]),arguments)},cm=Bg((function(t){t.setUTCDate(1),t.setUTCHours(0,0,0,0)}),(function(t,e){t.setUTCMonth(t.getUTCMonth()+e)}),(function(t,e){return e.getUTCMonth()-t.getUTCMonth()+12*(e.getUTCFullYear()-t.getUTCFullYear())}),(function(t){return t.getUTCMonth()})),um=cm,lm=cm.range,hm=Bg((function(t){t.setUTCMinutes(0,0,0)}),(function(t,e){t.setTime(+t+36e5*e)}),(function(t,e){return(e-t)/36e5}),(function(t){return t.getUTCHours()})),fm=hm,dm=hm.range,pm=Bg((function(t){t.setUTCSeconds(0,0)}),(function(t,e){t.setTime(+t+6e4*e)}),(function(t,e){return(e-t)/6e4}),(function(t){return t.getUTCMinutes()})),gm=pm,ym=pm.range,vm=function(){return Rp.apply(om(Py,um,vy,Ny,fm,gm,hy,py,Wy).domain([Date.UTC(2e3,0,1),Date.UTC(2e3,0,2)]),arguments)};function mm(){var t,e,n,r,i,a=0,o=1,s=Jp,c=!1;function u(e){return isNaN(e=+e)?i:s(0===n?.5:(e=(r(e)-t)*n,c?Math.max(0,Math.min(1,e)):e))}return u.domain=function(i){return arguments.length?(t=r(a=+i[0]),e=r(o=+i[1]),n=t===e?0:1/(e-t),u):[a,o]},u.clamp=function(t){return arguments.length?(c=!!t,u):c},u.interpolator=function(t){return arguments.length?(s=t,u):s},u.unknown=function(t){return arguments.length?(i=t,u):i},function(i){return r=i,t=i(a),e=i(o),n=t===e?0:1/(e-t),u}}function bm(t,e){return e.domain(t.domain()).interpolator(t.interpolator()).clamp(t.clamp()).unknown(t.unknown())}function xm(){var t=og(mm()(Jp));return t.copy=function(){return bm(t,xm())},Yp.apply(t,arguments)}function _m(){var t=yg(mm()).domain([1,10]);return t.copy=function(){return bm(t,_m()).base(t.base())},Yp.apply(t,arguments)}function km(){var t=xg(mm());return t.copy=function(){return bm(t,km()).constant(t.constant())},Yp.apply(t,arguments)}function wm(){var t=Tg(mm());return t.copy=function(){return bm(t,wm()).exponent(t.exponent())},Yp.apply(t,arguments)}function Em(){return wm.apply(null,arguments).exponent(.5)}function Tm(){var t=[],e=Jp;function n(n){if(!isNaN(n=+n))return e((c(t,n)-1)/(t.length-1))}return n.domain=function(e){if(!arguments.length)return t.slice();t=[];for(var i,a=0,o=e.length;a<o;++a)null==(i=e[a])||isNaN(i=+i)||t.push(i);return t.sort(r),n},n.interpolator=function(t){return arguments.length?(e=t,n):e},n.copy=function(){return Tm(e).domain(t)},Yp.apply(n,arguments)}function Cm(){var t,e,n,r,i,a,o,s=0,c=.5,u=1,l=Jp,h=!1;function f(t){return isNaN(t=+t)?o:(t=.5+((t=+a(t))-e)*(t<e?r:i),l(h?Math.max(0,Math.min(1,t)):t))}return f.domain=function(o){return arguments.length?(t=a(s=+o[0]),e=a(c=+o[1]),n=a(u=+o[2]),r=t===e?0:.5/(e-t),i=e===n?0:.5/(n-e),f):[s,c,u]},f.clamp=function(t){return arguments.length?(h=!!t,f):h},f.interpolator=function(t){return arguments.length?(l=t,f):l},f.unknown=function(t){return arguments.length?(o=t,f):o},function(o){return a=o,t=o(s),e=o(c),n=o(u),r=t===e?0:.5/(e-t),i=e===n?0:.5/(n-e),f}}function Am(){var t=og(Cm()(Jp));return t.copy=function(){return bm(t,Am())},Yp.apply(t,arguments)}function Sm(){var t=yg(Cm()).domain([.1,1,10]);return t.copy=function(){return bm(t,Sm()).base(t.base())},Yp.apply(t,arguments)}function Mm(){var t=xg(Cm());return t.copy=function(){return bm(t,Mm()).constant(t.constant())},Yp.apply(t,arguments)}function Om(){var t=Tg(Cm());return t.copy=function(){return bm(t,Om()).exponent(t.exponent())},Yp.apply(t,arguments)}function Dm(){return Om.apply(null,arguments).exponent(.5)}var Nm=function(t){for(var e=t.length/6|0,n=new Array(e),r=0;r<e;)n[r]="#"+t.slice(6*r,6*++r);return n},Bm=Nm("1f77b4ff7f0e2ca02cd627289467bd8c564be377c27f7f7fbcbd2217becf"),Lm=Nm("7fc97fbeaed4fdc086ffff99386cb0f0027fbf5b17666666"),Pm=Nm("1b9e77d95f027570b3e7298a66a61ee6ab02a6761d666666"),Im=Nm("a6cee31f78b4b2df8a33a02cfb9a99e31a1cfdbf6fff7f00cab2d66a3d9affff99b15928"),Fm=Nm("fbb4aeb3cde3ccebc5decbe4fed9a6ffffcce5d8bdfddaecf2f2f2"),jm=Nm("b3e2cdfdcdaccbd5e8f4cae4e6f5c9fff2aef1e2cccccccc"),Rm=Nm("e41a1c377eb84daf4a984ea3ff7f00ffff33a65628f781bf999999"),Ym=Nm("66c2a5fc8d628da0cbe78ac3a6d854ffd92fe5c494b3b3b3"),zm=Nm("8dd3c7ffffb3bebadafb807280b1d3fdb462b3de69fccde5d9d9d9bc80bdccebc5ffed6f"),Um=Nm("4e79a7f28e2ce1575976b7b259a14fedc949af7aa1ff9da79c755fbab0ab"),$m=function(t){return pn(t[t.length-1])},Wm=new Array(3).concat("d8b365f5f5f55ab4ac","a6611adfc27d80cdc1018571","a6611adfc27df5f5f580cdc1018571","8c510ad8b365f6e8c3c7eae55ab4ac01665e","8c510ad8b365f6e8c3f5f5f5c7eae55ab4ac01665e","8c510abf812ddfc27df6e8c3c7eae580cdc135978f01665e","8c510abf812ddfc27df6e8c3f5f5f5c7eae580cdc135978f01665e","5430058c510abf812ddfc27df6e8c3c7eae580cdc135978f01665e003c30","5430058c510abf812ddfc27df6e8c3f5f5f5c7eae580cdc135978f01665e003c30").map(Nm),Hm=$m(Wm),Vm=new Array(3).concat("af8dc3f7f7f77fbf7b","7b3294c2a5cfa6dba0008837","7b3294c2a5cff7f7f7a6dba0008837","762a83af8dc3e7d4e8d9f0d37fbf7b1b7837","762a83af8dc3e7d4e8f7f7f7d9f0d37fbf7b1b7837","762a839970abc2a5cfe7d4e8d9f0d3a6dba05aae611b7837","762a839970abc2a5cfe7d4e8f7f7f7d9f0d3a6dba05aae611b7837","40004b762a839970abc2a5cfe7d4e8d9f0d3a6dba05aae611b783700441b","40004b762a839970abc2a5cfe7d4e8f7f7f7d9f0d3a6dba05aae611b783700441b").map(Nm),Gm=$m(Vm),qm=new Array(3).concat("e9a3c9f7f7f7a1d76a","d01c8bf1b6dab8e1864dac26","d01c8bf1b6daf7f7f7b8e1864dac26","c51b7de9a3c9fde0efe6f5d0a1d76a4d9221","c51b7de9a3c9fde0eff7f7f7e6f5d0a1d76a4d9221","c51b7dde77aef1b6dafde0efe6f5d0b8e1867fbc414d9221","c51b7dde77aef1b6dafde0eff7f7f7e6f5d0b8e1867fbc414d9221","8e0152c51b7dde77aef1b6dafde0efe6f5d0b8e1867fbc414d9221276419","8e0152c51b7dde77aef1b6dafde0eff7f7f7e6f5d0b8e1867fbc414d9221276419").map(Nm),Xm=$m(qm),Zm=new Array(3).concat("998ec3f7f7f7f1a340","5e3c99b2abd2fdb863e66101","5e3c99b2abd2f7f7f7fdb863e66101","542788998ec3d8daebfee0b6f1a340b35806","542788998ec3d8daebf7f7f7fee0b6f1a340b35806","5427888073acb2abd2d8daebfee0b6fdb863e08214b35806","5427888073acb2abd2d8daebf7f7f7fee0b6fdb863e08214b35806","2d004b5427888073acb2abd2d8daebfee0b6fdb863e08214b358067f3b08","2d004b5427888073acb2abd2d8daebf7f7f7fee0b6fdb863e08214b358067f3b08").map(Nm),Jm=$m(Zm),Km=new Array(3).concat("ef8a62f7f7f767a9cf","ca0020f4a58292c5de0571b0","ca0020f4a582f7f7f792c5de0571b0","b2182bef8a62fddbc7d1e5f067a9cf2166ac","b2182bef8a62fddbc7f7f7f7d1e5f067a9cf2166ac","b2182bd6604df4a582fddbc7d1e5f092c5de4393c32166ac","b2182bd6604df4a582fddbc7f7f7f7d1e5f092c5de4393c32166ac","67001fb2182bd6604df4a582fddbc7d1e5f092c5de4393c32166ac053061","67001fb2182bd6604df4a582fddbc7f7f7f7d1e5f092c5de4393c32166ac053061").map(Nm),Qm=$m(Km),tb=new Array(3).concat("ef8a62ffffff999999","ca0020f4a582bababa404040","ca0020f4a582ffffffbababa404040","b2182bef8a62fddbc7e0e0e09999994d4d4d","b2182bef8a62fddbc7ffffffe0e0e09999994d4d4d","b2182bd6604df4a582fddbc7e0e0e0bababa8787874d4d4d","b2182bd6604df4a582fddbc7ffffffe0e0e0bababa8787874d4d4d","67001fb2182bd6604df4a582fddbc7e0e0e0bababa8787874d4d4d1a1a1a","67001fb2182bd6604df4a582fddbc7ffffffe0e0e0bababa8787874d4d4d1a1a1a").map(Nm),eb=$m(tb),nb=new Array(3).concat("fc8d59ffffbf91bfdb","d7191cfdae61abd9e92c7bb6","d7191cfdae61ffffbfabd9e92c7bb6","d73027fc8d59fee090e0f3f891bfdb4575b4","d73027fc8d59fee090ffffbfe0f3f891bfdb4575b4","d73027f46d43fdae61fee090e0f3f8abd9e974add14575b4","d73027f46d43fdae61fee090ffffbfe0f3f8abd9e974add14575b4","a50026d73027f46d43fdae61fee090e0f3f8abd9e974add14575b4313695","a50026d73027f46d43fdae61fee090ffffbfe0f3f8abd9e974add14575b4313695").map(Nm),rb=$m(nb),ib=new Array(3).concat("fc8d59ffffbf91cf60","d7191cfdae61a6d96a1a9641","d7191cfdae61ffffbfa6d96a1a9641","d73027fc8d59fee08bd9ef8b91cf601a9850","d73027fc8d59fee08bffffbfd9ef8b91cf601a9850","d73027f46d43fdae61fee08bd9ef8ba6d96a66bd631a9850","d73027f46d43fdae61fee08bffffbfd9ef8ba6d96a66bd631a9850","a50026d73027f46d43fdae61fee08bd9ef8ba6d96a66bd631a9850006837","a50026d73027f46d43fdae61fee08bffffbfd9ef8ba6d96a66bd631a9850006837").map(Nm),ab=$m(ib),ob=new Array(3).concat("fc8d59ffffbf99d594","d7191cfdae61abdda42b83ba","d7191cfdae61ffffbfabdda42b83ba","d53e4ffc8d59fee08be6f59899d5943288bd","d53e4ffc8d59fee08bffffbfe6f59899d5943288bd","d53e4ff46d43fdae61fee08be6f598abdda466c2a53288bd","d53e4ff46d43fdae61fee08bffffbfe6f598abdda466c2a53288bd","9e0142d53e4ff46d43fdae61fee08be6f598abdda466c2a53288bd5e4fa2","9e0142d53e4ff46d43fdae61fee08bffffbfe6f598abdda466c2a53288bd5e4fa2").map(Nm),sb=$m(ob),cb=new Array(3).concat("e5f5f999d8c92ca25f","edf8fbb2e2e266c2a4238b45","edf8fbb2e2e266c2a42ca25f006d2c","edf8fbccece699d8c966c2a42ca25f006d2c","edf8fbccece699d8c966c2a441ae76238b45005824","f7fcfde5f5f9ccece699d8c966c2a441ae76238b45005824","f7fcfde5f5f9ccece699d8c966c2a441ae76238b45006d2c00441b").map(Nm),ub=$m(cb),lb=new Array(3).concat("e0ecf49ebcda8856a7","edf8fbb3cde38c96c688419d","edf8fbb3cde38c96c68856a7810f7c","edf8fbbfd3e69ebcda8c96c68856a7810f7c","edf8fbbfd3e69ebcda8c96c68c6bb188419d6e016b","f7fcfde0ecf4bfd3e69ebcda8c96c68c6bb188419d6e016b","f7fcfde0ecf4bfd3e69ebcda8c96c68c6bb188419d810f7c4d004b").map(Nm),hb=$m(lb),fb=new Array(3).concat("e0f3dba8ddb543a2ca","f0f9e8bae4bc7bccc42b8cbe","f0f9e8bae4bc7bccc443a2ca0868ac","f0f9e8ccebc5a8ddb57bccc443a2ca0868ac","f0f9e8ccebc5a8ddb57bccc44eb3d32b8cbe08589e","f7fcf0e0f3dbccebc5a8ddb57bccc44eb3d32b8cbe08589e","f7fcf0e0f3dbccebc5a8ddb57bccc44eb3d32b8cbe0868ac084081").map(Nm),db=$m(fb),pb=new Array(3).concat("fee8c8fdbb84e34a33","fef0d9fdcc8afc8d59d7301f","fef0d9fdcc8afc8d59e34a33b30000","fef0d9fdd49efdbb84fc8d59e34a33b30000","fef0d9fdd49efdbb84fc8d59ef6548d7301f990000","fff7ecfee8c8fdd49efdbb84fc8d59ef6548d7301f990000","fff7ecfee8c8fdd49efdbb84fc8d59ef6548d7301fb300007f0000").map(Nm),gb=$m(pb),yb=new Array(3).concat("ece2f0a6bddb1c9099","f6eff7bdc9e167a9cf02818a","f6eff7bdc9e167a9cf1c9099016c59","f6eff7d0d1e6a6bddb67a9cf1c9099016c59","f6eff7d0d1e6a6bddb67a9cf3690c002818a016450","fff7fbece2f0d0d1e6a6bddb67a9cf3690c002818a016450","fff7fbece2f0d0d1e6a6bddb67a9cf3690c002818a016c59014636").map(Nm),vb=$m(yb),mb=new Array(3).concat("ece7f2a6bddb2b8cbe","f1eef6bdc9e174a9cf0570b0","f1eef6bdc9e174a9cf2b8cbe045a8d","f1eef6d0d1e6a6bddb74a9cf2b8cbe045a8d","f1eef6d0d1e6a6bddb74a9cf3690c00570b0034e7b","fff7fbece7f2d0d1e6a6bddb74a9cf3690c00570b0034e7b","fff7fbece7f2d0d1e6a6bddb74a9cf3690c00570b0045a8d023858").map(Nm),bb=$m(mb),xb=new Array(3).concat("e7e1efc994c7dd1c77","f1eef6d7b5d8df65b0ce1256","f1eef6d7b5d8df65b0dd1c77980043","f1eef6d4b9dac994c7df65b0dd1c77980043","f1eef6d4b9dac994c7df65b0e7298ace125691003f","f7f4f9e7e1efd4b9dac994c7df65b0e7298ace125691003f","f7f4f9e7e1efd4b9dac994c7df65b0e7298ace125698004367001f").map(Nm),_b=$m(xb),kb=new Array(3).concat("fde0ddfa9fb5c51b8a","feebe2fbb4b9f768a1ae017e","feebe2fbb4b9f768a1c51b8a7a0177","feebe2fcc5c0fa9fb5f768a1c51b8a7a0177","feebe2fcc5c0fa9fb5f768a1dd3497ae017e7a0177","fff7f3fde0ddfcc5c0fa9fb5f768a1dd3497ae017e7a0177","fff7f3fde0ddfcc5c0fa9fb5f768a1dd3497ae017e7a017749006a").map(Nm),wb=$m(kb),Eb=new Array(3).concat("edf8b17fcdbb2c7fb8","ffffcca1dab441b6c4225ea8","ffffcca1dab441b6c42c7fb8253494","ffffccc7e9b47fcdbb41b6c42c7fb8253494","ffffccc7e9b47fcdbb41b6c41d91c0225ea80c2c84","ffffd9edf8b1c7e9b47fcdbb41b6c41d91c0225ea80c2c84","ffffd9edf8b1c7e9b47fcdbb41b6c41d91c0225ea8253494081d58").map(Nm),Tb=$m(Eb),Cb=new Array(3).concat("f7fcb9addd8e31a354","ffffccc2e69978c679238443","ffffccc2e69978c67931a354006837","ffffccd9f0a3addd8e78c67931a354006837","ffffccd9f0a3addd8e78c67941ab5d238443005a32","ffffe5f7fcb9d9f0a3addd8e78c67941ab5d238443005a32","ffffe5f7fcb9d9f0a3addd8e78c67941ab5d238443006837004529").map(Nm),Ab=$m(Cb),Sb=new Array(3).concat("fff7bcfec44fd95f0e","ffffd4fed98efe9929cc4c02","ffffd4fed98efe9929d95f0e993404","ffffd4fee391fec44ffe9929d95f0e993404","ffffd4fee391fec44ffe9929ec7014cc4c028c2d04","ffffe5fff7bcfee391fec44ffe9929ec7014cc4c028c2d04","ffffe5fff7bcfee391fec44ffe9929ec7014cc4c02993404662506").map(Nm),Mb=$m(Sb),Ob=new Array(3).concat("ffeda0feb24cf03b20","ffffb2fecc5cfd8d3ce31a1c","ffffb2fecc5cfd8d3cf03b20bd0026","ffffb2fed976feb24cfd8d3cf03b20bd0026","ffffb2fed976feb24cfd8d3cfc4e2ae31a1cb10026","ffffccffeda0fed976feb24cfd8d3cfc4e2ae31a1cb10026","ffffccffeda0fed976feb24cfd8d3cfc4e2ae31a1cbd0026800026").map(Nm),Db=$m(Ob),Nb=new Array(3).concat("deebf79ecae13182bd","eff3ffbdd7e76baed62171b5","eff3ffbdd7e76baed63182bd08519c","eff3ffc6dbef9ecae16baed63182bd08519c","eff3ffc6dbef9ecae16baed64292c62171b5084594","f7fbffdeebf7c6dbef9ecae16baed64292c62171b5084594","f7fbffdeebf7c6dbef9ecae16baed64292c62171b508519c08306b").map(Nm),Bb=$m(Nb),Lb=new Array(3).concat("e5f5e0a1d99b31a354","edf8e9bae4b374c476238b45","edf8e9bae4b374c47631a354006d2c","edf8e9c7e9c0a1d99b74c47631a354006d2c","edf8e9c7e9c0a1d99b74c47641ab5d238b45005a32","f7fcf5e5f5e0c7e9c0a1d99b74c47641ab5d238b45005a32","f7fcf5e5f5e0c7e9c0a1d99b74c47641ab5d238b45006d2c00441b").map(Nm),Pb=$m(Lb),Ib=new Array(3).concat("f0f0f0bdbdbd636363","f7f7f7cccccc969696525252","f7f7f7cccccc969696636363252525","f7f7f7d9d9d9bdbdbd969696636363252525","f7f7f7d9d9d9bdbdbd969696737373525252252525","fffffff0f0f0d9d9d9bdbdbd969696737373525252252525","fffffff0f0f0d9d9d9bdbdbd969696737373525252252525000000").map(Nm),Fb=$m(Ib),jb=new Array(3).concat("efedf5bcbddc756bb1","f2f0f7cbc9e29e9ac86a51a3","f2f0f7cbc9e29e9ac8756bb154278f","f2f0f7dadaebbcbddc9e9ac8756bb154278f","f2f0f7dadaebbcbddc9e9ac8807dba6a51a34a1486","fcfbfdefedf5dadaebbcbddc9e9ac8807dba6a51a34a1486","fcfbfdefedf5dadaebbcbddc9e9ac8807dba6a51a354278f3f007d").map(Nm),Rb=$m(jb),Yb=new Array(3).concat("fee0d2fc9272de2d26","fee5d9fcae91fb6a4acb181d","fee5d9fcae91fb6a4ade2d26a50f15","fee5d9fcbba1fc9272fb6a4ade2d26a50f15","fee5d9fcbba1fc9272fb6a4aef3b2ccb181d99000d","fff5f0fee0d2fcbba1fc9272fb6a4aef3b2ccb181d99000d","fff5f0fee0d2fcbba1fc9272fb6a4aef3b2ccb181da50f1567000d").map(Nm),zb=$m(Yb),Ub=new Array(3).concat("fee6cefdae6be6550d","feeddefdbe85fd8d3cd94701","feeddefdbe85fd8d3ce6550da63603","feeddefdd0a2fdae6bfd8d3ce6550da63603","feeddefdd0a2fdae6bfd8d3cf16913d948018c2d04","fff5ebfee6cefdd0a2fdae6bfd8d3cf16913d948018c2d04","fff5ebfee6cefdd0a2fdae6bfd8d3cf16913d94801a636037f2704").map(Nm),$b=$m(Ub),Wb=function(t){return t=Math.max(0,Math.min(1,t)),"rgb("+Math.max(0,Math.min(255,Math.round(-4.54-t*(35.34-t*(2381.73-t*(6402.7-t*(7024.72-2710.57*t)))))))+", "+Math.max(0,Math.min(255,Math.round(32.49+t*(170.73+t*(52.82-t*(131.46-t*(176.58-67.37*t)))))))+", "+Math.max(0,Math.min(255,Math.round(81.24+t*(442.36-t*(2482.43-t*(6167.24-t*(6614.94-2475.67*t)))))))+")"},Hb=kp(Oa(300,.5,0),Oa(-240,.5,1)),Vb=kp(Oa(-100,.75,.35),Oa(80,1.5,.8)),Gb=kp(Oa(260,.75,.35),Oa(80,1.5,.8)),qb=Oa(),Xb=function(t){(t<0||t>1)&&(t-=Math.floor(t));var e=Math.abs(t-.5);return qb.h=360*t-100,qb.s=1.5-1.5*e,qb.l=.8-.9*e,qb+""},Zb=Ge(),Jb=Math.PI/3,Kb=2*Math.PI/3,Qb=function(t){var e;return t=(.5-t)*Math.PI,Zb.r=255*(e=Math.sin(t))*e,Zb.g=255*(e=Math.sin(t+Jb))*e,Zb.b=255*(e=Math.sin(t+Kb))*e,Zb+""},tx=function(t){return t=Math.max(0,Math.min(1,t)),"rgb("+Math.max(0,Math.min(255,Math.round(34.61+t*(1172.33-t*(10793.56-t*(33300.12-t*(38394.49-14825.05*t)))))))+", "+Math.max(0,Math.min(255,Math.round(23.31+t*(557.33+t*(1225.33-t*(3574.96-t*(1073.77+707.56*t)))))))+", "+Math.max(0,Math.min(255,Math.round(27.2+t*(3211.1-t*(15327.97-t*(27814-t*(22569.18-6838.66*t)))))))+")"};function ex(t){var e=t.length;return function(n){return t[Math.max(0,Math.min(e-1,Math.floor(n*e)))]}}var nx=ex(Nm("44015444025645045745055946075a46085c460a5d460b5e470d60470e6147106347116447136548146748166848176948186a481a6c481b6d481c6e481d6f481f70482071482173482374482475482576482677482878482979472a7a472c7a472d7b472e7c472f7d46307e46327e46337f463480453581453781453882443983443a83443b84433d84433e85423f854240864241864142874144874045884046883f47883f48893e49893e4a893e4c8a3d4d8a3d4e8a3c4f8a3c508b3b518b3b528b3a538b3a548c39558c39568c38588c38598c375a8c375b8d365c8d365d8d355e8d355f8d34608d34618d33628d33638d32648e32658e31668e31678e31688e30698e306a8e2f6b8e2f6c8e2e6d8e2e6e8e2e6f8e2d708e2d718e2c718e2c728e2c738e2b748e2b758e2a768e2a778e2a788e29798e297a8e297b8e287c8e287d8e277e8e277f8e27808e26818e26828e26828e25838e25848e25858e24868e24878e23888e23898e238a8d228b8d228c8d228d8d218e8d218f8d21908d21918c20928c20928c20938c1f948c1f958b1f968b1f978b1f988b1f998a1f9a8a1e9b8a1e9c891e9d891f9e891f9f881fa0881fa1881fa1871fa28720a38620a48621a58521a68522a78522a88423a98324aa8325ab8225ac8226ad8127ad8128ae8029af7f2ab07f2cb17e2db27d2eb37c2fb47c31b57b32b67a34b67935b77937b87838b9773aba763bbb753dbc743fbc7340bd7242be7144bf7046c06f48c16e4ac16d4cc26c4ec36b50c46a52c56954c56856c66758c7655ac8645cc8635ec96260ca6063cb5f65cb5e67cc5c69cd5b6ccd5a6ece5870cf5773d05675d05477d1537ad1517cd2507fd34e81d34d84d44b86d54989d5488bd6468ed64590d74393d74195d84098d83e9bd93c9dd93ba0da39a2da37a5db36a8db34aadc32addc30b0dd2fb2dd2db5de2bb8de29bade28bddf26c0df25c2df23c5e021c8e020cae11fcde11dd0e11cd2e21bd5e21ad8e219dae319dde318dfe318e2e418e5e419e7e419eae51aece51befe51cf1e51df4e61ef6e620f8e621fbe723fde725")),rx=ex(Nm("00000401000501010601010802010902020b02020d03030f03031204041405041606051806051a07061c08071e0907200a08220b09240c09260d0a290e0b2b100b2d110c2f120d31130d34140e36150e38160f3b180f3d19103f1a10421c10441d11471e114920114b21114e22115024125325125527125829115a2a115c2c115f2d11612f116331116533106734106936106b38106c390f6e3b0f703d0f713f0f72400f74420f75440f764510774710784910784a10794c117a4e117b4f127b51127c52137c54137d56147d57157e59157e5a167e5c167f5d177f5f187f601880621980641a80651a80671b80681c816a1c816b1d816d1d816e1e81701f81721f817320817521817621817822817922827b23827c23827e24828025828125818326818426818627818827818928818b29818c29818e2a81902a81912b81932b80942c80962c80982d80992d809b2e7f9c2e7f9e2f7fa02f7fa1307ea3307ea5317ea6317da8327daa337dab337cad347cae347bb0357bb2357bb3367ab5367ab73779b83779ba3878bc3978bd3977bf3a77c03a76c23b75c43c75c53c74c73d73c83e73ca3e72cc3f71cd4071cf4070d0416fd2426fd3436ed5446dd6456cd8456cd9466bdb476adc4869de4968df4a68e04c67e24d66e34e65e44f64e55064e75263e85362e95462ea5661eb5760ec5860ed5a5fee5b5eef5d5ef05f5ef1605df2625df2645cf3655cf4675cf4695cf56b5cf66c5cf66e5cf7705cf7725cf8745cf8765cf9785df9795df97b5dfa7d5efa7f5efa815ffb835ffb8560fb8761fc8961fc8a62fc8c63fc8e64fc9065fd9266fd9467fd9668fd9869fd9a6afd9b6bfe9d6cfe9f6dfea16efea36ffea571fea772fea973feaa74feac76feae77feb078feb27afeb47bfeb67cfeb77efeb97ffebb81febd82febf84fec185fec287fec488fec68afec88cfeca8dfecc8ffecd90fecf92fed194fed395fed597fed799fed89afdda9cfddc9efddea0fde0a1fde2a3fde3a5fde5a7fde7a9fde9aafdebacfcecaefceeb0fcf0b2fcf2b4fcf4b6fcf6b8fcf7b9fcf9bbfcfbbdfcfdbf")),ix=ex(Nm("00000401000501010601010802010a02020c02020e03021004031204031405041706041907051b08051d09061f0a07220b07240c08260d08290e092b10092d110a30120a32140b34150b37160b39180c3c190c3e1b0c411c0c431e0c451f0c48210c4a230c4c240c4f260c51280b53290b552b0b572d0b592f0a5b310a5c320a5e340a5f3609613809623909633b09643d09653e0966400a67420a68440a68450a69470b6a490b6a4a0c6b4c0c6b4d0d6c4f0d6c510e6c520e6d540f6d550f6d57106e59106e5a116e5c126e5d126e5f136e61136e62146e64156e65156e67166e69166e6a176e6c186e6d186e6f196e71196e721a6e741a6e751b6e771c6d781c6d7a1d6d7c1d6d7d1e6d7f1e6c801f6c82206c84206b85216b87216b88226a8a226a8c23698d23698f24699025689225689326679526679727669827669a28659b29649d29649f2a63a02a63a22b62a32c61a52c60a62d60a82e5fa92e5eab2f5ead305dae305cb0315bb1325ab3325ab43359b63458b73557b93556ba3655bc3754bd3853bf3952c03a51c13a50c33b4fc43c4ec63d4dc73e4cc83f4bca404acb4149cc4248ce4347cf4446d04545d24644d34743d44842d54a41d74b3fd84c3ed94d3dda4e3cdb503bdd513ade5238df5337e05536e15635e25734e35933e45a31e55c30e65d2fe75e2ee8602de9612bea632aeb6429eb6628ec6726ed6925ee6a24ef6c23ef6e21f06f20f1711ff1731df2741cf3761bf37819f47918f57b17f57d15f67e14f68013f78212f78410f8850ff8870ef8890cf98b0bf98c0af98e09fa9008fa9207fa9407fb9606fb9706fb9906fb9b06fb9d07fc9f07fca108fca309fca50afca60cfca80dfcaa0ffcac11fcae12fcb014fcb216fcb418fbb61afbb81dfbba1ffbbc21fbbe23fac026fac228fac42afac62df9c72ff9c932f9cb35f8cd37f8cf3af7d13df7d340f6d543f6d746f5d949f5db4cf4dd4ff4df53f4e156f3e35af3e55df2e661f2e865f2ea69f1ec6df1ed71f1ef75f1f179f2f27df2f482f3f586f3f68af4f88ef5f992f6fa96f8fb9af9fc9dfafda1fcffa4")),ax=ex(Nm("0d088710078813078916078a19068c1b068d1d068e20068f2206902406912605912805922a05932c05942e05952f059631059733059735049837049938049a3a049a3c049b3e049c3f049c41049d43039e44039e46039f48039f4903a04b03a14c02a14e02a25002a25102a35302a35502a45601a45801a45901a55b01a55c01a65e01a66001a66100a76300a76400a76600a76700a86900a86a00a86c00a86e00a86f00a87100a87201a87401a87501a87701a87801a87a02a87b02a87d03a87e03a88004a88104a78305a78405a78606a68707a68808a68a09a58b0aa58d0ba58e0ca48f0da4910ea3920fa39410a29511a19613a19814a099159f9a169f9c179e9d189d9e199da01a9ca11b9ba21d9aa31e9aa51f99a62098a72197a82296aa2395ab2494ac2694ad2793ae2892b02991b12a90b22b8fb32c8eb42e8db52f8cb6308bb7318ab83289ba3388bb3488bc3587bd3786be3885bf3984c03a83c13b82c23c81c33d80c43e7fc5407ec6417dc7427cc8437bc9447aca457acb4679cc4778cc4977cd4a76ce4b75cf4c74d04d73d14e72d24f71d35171d45270d5536fd5546ed6556dd7566cd8576bd9586ada5a6ada5b69db5c68dc5d67dd5e66de5f65de6164df6263e06363e16462e26561e26660e3685fe4695ee56a5de56b5de66c5ce76e5be76f5ae87059e97158e97257ea7457eb7556eb7655ec7754ed7953ed7a52ee7b51ef7c51ef7e50f07f4ff0804ef1814df1834cf2844bf3854bf3874af48849f48948f58b47f58c46f68d45f68f44f79044f79143f79342f89441f89540f9973ff9983ef99a3efa9b3dfa9c3cfa9e3bfb9f3afba139fba238fca338fca537fca636fca835fca934fdab33fdac33fdae32fdaf31fdb130fdb22ffdb42ffdb52efeb72dfeb82cfeba2cfebb2bfebd2afebe2afec029fdc229fdc328fdc527fdc627fdc827fdca26fdcb26fccd25fcce25fcd025fcd225fbd324fbd524fbd724fad824fada24f9dc24f9dd25f8df25f8e125f7e225f7e425f6e626f6e826f5e926f5eb27f4ed27f3ee27f3f027f2f227f1f426f1f525f0f724f0f921")),ox=function(t){return ke(ne(t).call(document.documentElement))},sx=0;function cx(){return new ux}function ux(){this._="@"+(++sx).toString(36)}ux.prototype=cx.prototype={constructor:ux,get:function(t){for(var e=this._;!(e in t);)if(!(t=t.parentNode))return;return t[e]},set:function(t,e){return t[this._]=e},remove:function(t){return this._ in t&&delete t[this._]},toString:function(){return this._}};var lx=function(t){return"string"==typeof t?new be([document.querySelectorAll(t)],[document.documentElement]):new be([null==t?[]:t],me)},hx=function(t,e){null==e&&(e=Mn().touches);for(var n=0,r=e?e.length:0,i=new Array(r);n<r;++n)i[n]=On(t,e[n]);return i},fx=function(t){return function(){return t}},dx=Math.abs,px=Math.atan2,gx=Math.cos,yx=Math.max,vx=Math.min,mx=Math.sin,bx=Math.sqrt,xx=Math.PI,_x=xx/2,kx=2*xx;function wx(t){return t>1?0:t<-1?xx:Math.acos(t)}function Ex(t){return t>=1?_x:t<=-1?-_x:Math.asin(t)}function Tx(t){return t.innerRadius}function Cx(t){return t.outerRadius}function Ax(t){return t.startAngle}function Sx(t){return t.endAngle}function Mx(t){return t&&t.padAngle}function Ox(t,e,n,r,i,a,o,s){var c=n-t,u=r-e,l=o-i,h=s-a,f=h*c-l*u;if(!(f*f<1e-12))return[t+(f=(l*(e-a)-h*(t-i))/f)*c,e+f*u]}function Dx(t,e,n,r,i,a,o){var s=t-n,c=e-r,u=(o?a:-a)/bx(s*s+c*c),l=u*c,h=-u*s,f=t+l,d=e+h,p=n+l,g=r+h,y=(f+p)/2,v=(d+g)/2,m=p-f,b=g-d,x=m*m+b*b,_=i-a,k=f*g-p*d,w=(b<0?-1:1)*bx(yx(0,_*_*x-k*k)),E=(k*b-m*w)/x,T=(-k*m-b*w)/x,C=(k*b+m*w)/x,A=(-k*m+b*w)/x,S=E-y,M=T-v,O=C-y,D=A-v;return S*S+M*M>O*O+D*D&&(E=C,T=A),{cx:E,cy:T,x01:-l,y01:-h,x11:E*(i/_-1),y11:T*(i/_-1)}}var Nx=function(){var t=Tx,e=Cx,n=fx(0),r=null,i=Ax,a=Sx,o=Mx,s=null;function c(){var c,u,l=+t.apply(this,arguments),h=+e.apply(this,arguments),f=i.apply(this,arguments)-_x,d=a.apply(this,arguments)-_x,p=dx(d-f),g=d>f;if(s||(s=c=Ui()),h<l&&(u=h,h=l,l=u),h>1e-12)if(p>kx-1e-12)s.moveTo(h*gx(f),h*mx(f)),s.arc(0,0,h,f,d,!g),l>1e-12&&(s.moveTo(l*gx(d),l*mx(d)),s.arc(0,0,l,d,f,g));else{var y,v,m=f,b=d,x=f,_=d,k=p,w=p,E=o.apply(this,arguments)/2,T=E>1e-12&&(r?+r.apply(this,arguments):bx(l*l+h*h)),C=vx(dx(h-l)/2,+n.apply(this,arguments)),A=C,S=C;if(T>1e-12){var M=Ex(T/l*mx(E)),O=Ex(T/h*mx(E));(k-=2*M)>1e-12?(x+=M*=g?1:-1,_-=M):(k=0,x=_=(f+d)/2),(w-=2*O)>1e-12?(m+=O*=g?1:-1,b-=O):(w=0,m=b=(f+d)/2)}var D=h*gx(m),N=h*mx(m),B=l*gx(_),L=l*mx(_);if(C>1e-12){var P,I=h*gx(b),F=h*mx(b),j=l*gx(x),R=l*mx(x);if(p<xx&&(P=Ox(D,N,j,R,I,F,B,L))){var Y=D-P[0],z=N-P[1],U=I-P[0],$=F-P[1],W=1/mx(wx((Y*U+z*$)/(bx(Y*Y+z*z)*bx(U*U+$*$)))/2),H=bx(P[0]*P[0]+P[1]*P[1]);A=vx(C,(l-H)/(W-1)),S=vx(C,(h-H)/(W+1))}}w>1e-12?S>1e-12?(y=Dx(j,R,D,N,h,S,g),v=Dx(I,F,B,L,h,S,g),s.moveTo(y.cx+y.x01,y.cy+y.y01),S<C?s.arc(y.cx,y.cy,S,px(y.y01,y.x01),px(v.y01,v.x01),!g):(s.arc(y.cx,y.cy,S,px(y.y01,y.x01),px(y.y11,y.x11),!g),s.arc(0,0,h,px(y.cy+y.y11,y.cx+y.x11),px(v.cy+v.y11,v.cx+v.x11),!g),s.arc(v.cx,v.cy,S,px(v.y11,v.x11),px(v.y01,v.x01),!g))):(s.moveTo(D,N),s.arc(0,0,h,m,b,!g)):s.moveTo(D,N),l>1e-12&&k>1e-12?A>1e-12?(y=Dx(B,L,I,F,l,-A,g),v=Dx(D,N,j,R,l,-A,g),s.lineTo(y.cx+y.x01,y.cy+y.y01),A<C?s.arc(y.cx,y.cy,A,px(y.y01,y.x01),px(v.y01,v.x01),!g):(s.arc(y.cx,y.cy,A,px(y.y01,y.x01),px(y.y11,y.x11),!g),s.arc(0,0,l,px(y.cy+y.y11,y.cx+y.x11),px(v.cy+v.y11,v.cx+v.x11),g),s.arc(v.cx,v.cy,A,px(v.y11,v.x11),px(v.y01,v.x01),!g))):s.arc(0,0,l,_,x,g):s.lineTo(B,L)}else s.moveTo(0,0);if(s.closePath(),c)return s=null,c+""||null}return c.centroid=function(){var n=(+t.apply(this,arguments)+ +e.apply(this,arguments))/2,r=(+i.apply(this,arguments)+ +a.apply(this,arguments))/2-xx/2;return[gx(r)*n,mx(r)*n]},c.innerRadius=function(e){return arguments.length?(t="function"==typeof e?e:fx(+e),c):t},c.outerRadius=function(t){return arguments.length?(e="function"==typeof t?t:fx(+t),c):e},c.cornerRadius=function(t){return arguments.length?(n="function"==typeof t?t:fx(+t),c):n},c.padRadius=function(t){return arguments.length?(r=null==t?null:"function"==typeof t?t:fx(+t),c):r},c.startAngle=function(t){return arguments.length?(i="function"==typeof t?t:fx(+t),c):i},c.endAngle=function(t){return arguments.length?(a="function"==typeof t?t:fx(+t),c):a},c.padAngle=function(t){return arguments.length?(o="function"==typeof t?t:fx(+t),c):o},c.context=function(t){return arguments.length?(s=null==t?null:t,c):s},c};function Bx(t){this._context=t}Bx.prototype={areaStart:function(){this._line=0},areaEnd:function(){this._line=NaN},lineStart:function(){this._point=0},lineEnd:function(){(this._line||0!==this._line&&1===this._point)&&this._context.closePath(),this._line=1-this._line},point:function(t,e){switch(t=+t,e=+e,this._point){case 0:this._point=1,this._line?this._context.lineTo(t,e):this._context.moveTo(t,e);break;case 1:this._point=2;default:this._context.lineTo(t,e)}}};var Lx=function(t){return new Bx(t)};function Px(t){return t[0]}function Ix(t){return t[1]}var Fx=function(){var t=Px,e=Ix,n=fx(!0),r=null,i=Lx,a=null;function o(o){var s,c,u,l=o.length,h=!1;for(null==r&&(a=i(u=Ui())),s=0;s<=l;++s)!(s<l&&n(c=o[s],s,o))===h&&((h=!h)?a.lineStart():a.lineEnd()),h&&a.point(+t(c,s,o),+e(c,s,o));if(u)return a=null,u+""||null}return o.x=function(e){return arguments.length?(t="function"==typeof e?e:fx(+e),o):t},o.y=function(t){return arguments.length?(e="function"==typeof t?t:fx(+t),o):e},o.defined=function(t){return arguments.length?(n="function"==typeof t?t:fx(!!t),o):n},o.curve=function(t){return arguments.length?(i=t,null!=r&&(a=i(r)),o):i},o.context=function(t){return arguments.length?(null==t?r=a=null:a=i(r=t),o):r},o},jx=function(){var t=Px,e=null,n=fx(0),r=Ix,i=fx(!0),a=null,o=Lx,s=null;function c(c){var u,l,h,f,d,p=c.length,g=!1,y=new Array(p),v=new Array(p);for(null==a&&(s=o(d=Ui())),u=0;u<=p;++u){if(!(u<p&&i(f=c[u],u,c))===g)if(g=!g)l=u,s.areaStart(),s.lineStart();else{for(s.lineEnd(),s.lineStart(),h=u-1;h>=l;--h)s.point(y[h],v[h]);s.lineEnd(),s.areaEnd()}g&&(y[u]=+t(f,u,c),v[u]=+n(f,u,c),s.point(e?+e(f,u,c):y[u],r?+r(f,u,c):v[u]))}if(d)return s=null,d+""||null}function u(){return Fx().defined(i).curve(o).context(a)}return c.x=function(n){return arguments.length?(t="function"==typeof n?n:fx(+n),e=null,c):t},c.x0=function(e){return arguments.length?(t="function"==typeof e?e:fx(+e),c):t},c.x1=function(t){return arguments.length?(e=null==t?null:"function"==typeof t?t:fx(+t),c):e},c.y=function(t){return arguments.length?(n="function"==typeof t?t:fx(+t),r=null,c):n},c.y0=function(t){return arguments.length?(n="function"==typeof t?t:fx(+t),c):n},c.y1=function(t){return arguments.length?(r=null==t?null:"function"==typeof t?t:fx(+t),c):r},c.lineX0=c.lineY0=function(){return u().x(t).y(n)},c.lineY1=function(){return u().x(t).y(r)},c.lineX1=function(){return u().x(e).y(n)},c.defined=function(t){return arguments.length?(i="function"==typeof t?t:fx(!!t),c):i},c.curve=function(t){return arguments.length?(o=t,null!=a&&(s=o(a)),c):o},c.context=function(t){return arguments.length?(null==t?a=s=null:s=o(a=t),c):a},c},Rx=function(t,e){return e<t?-1:e>t?1:e>=t?0:NaN},Yx=function(t){return t},zx=function(){var t=Yx,e=Rx,n=null,r=fx(0),i=fx(kx),a=fx(0);function o(o){var s,c,u,l,h,f=o.length,d=0,p=new Array(f),g=new Array(f),y=+r.apply(this,arguments),v=Math.min(kx,Math.max(-kx,i.apply(this,arguments)-y)),m=Math.min(Math.abs(v)/f,a.apply(this,arguments)),b=m*(v<0?-1:1);for(s=0;s<f;++s)(h=g[p[s]=s]=+t(o[s],s,o))>0&&(d+=h);for(null!=e?p.sort((function(t,n){return e(g[t],g[n])})):null!=n&&p.sort((function(t,e){return n(o[t],o[e])})),s=0,u=d?(v-f*b)/d:0;s<f;++s,y=l)c=p[s],l=y+((h=g[c])>0?h*u:0)+b,g[c]={data:o[c],index:s,value:h,startAngle:y,endAngle:l,padAngle:m};return g}return o.value=function(e){return arguments.length?(t="function"==typeof e?e:fx(+e),o):t},o.sortValues=function(t){return arguments.length?(e=t,n=null,o):e},o.sort=function(t){return arguments.length?(n=t,e=null,o):n},o.startAngle=function(t){return arguments.length?(r="function"==typeof t?t:fx(+t),o):r},o.endAngle=function(t){return arguments.length?(i="function"==typeof t?t:fx(+t),o):i},o.padAngle=function(t){return arguments.length?(a="function"==typeof t?t:fx(+t),o):a},o},Ux=Wx(Lx);function $x(t){this._curve=t}function Wx(t){function e(e){return new $x(t(e))}return e._curve=t,e}function Hx(t){var e=t.curve;return t.angle=t.x,delete t.x,t.radius=t.y,delete t.y,t.curve=function(t){return arguments.length?e(Wx(t)):e()._curve},t}$x.prototype={areaStart:function(){this._curve.areaStart()},areaEnd:function(){this._curve.areaEnd()},lineStart:function(){this._curve.lineStart()},lineEnd:function(){this._curve.lineEnd()},point:function(t,e){this._curve.point(e*Math.sin(t),e*-Math.cos(t))}};var Vx=function(){return Hx(Fx().curve(Ux))},Gx=function(){var t=jx().curve(Ux),e=t.curve,n=t.lineX0,r=t.lineX1,i=t.lineY0,a=t.lineY1;return t.angle=t.x,delete t.x,t.startAngle=t.x0,delete t.x0,t.endAngle=t.x1,delete t.x1,t.radius=t.y,delete t.y,t.innerRadius=t.y0,delete t.y0,t.outerRadius=t.y1,delete t.y1,t.lineStartAngle=function(){return Hx(n())},delete t.lineX0,t.lineEndAngle=function(){return Hx(r())},delete t.lineX1,t.lineInnerRadius=function(){return Hx(i())},delete t.lineY0,t.lineOuterRadius=function(){return Hx(a())},delete t.lineY1,t.curve=function(t){return arguments.length?e(Wx(t)):e()._curve},t},qx=function(t,e){return[(e=+e)*Math.cos(t-=Math.PI/2),e*Math.sin(t)]},Xx=Array.prototype.slice;function Zx(t){return t.source}function Jx(t){return t.target}function Kx(t){var e=Zx,n=Jx,r=Px,i=Ix,a=null;function o(){var o,s=Xx.call(arguments),c=e.apply(this,s),u=n.apply(this,s);if(a||(a=o=Ui()),t(a,+r.apply(this,(s[0]=c,s)),+i.apply(this,s),+r.apply(this,(s[0]=u,s)),+i.apply(this,s)),o)return a=null,o+""||null}return o.source=function(t){return arguments.length?(e=t,o):e},o.target=function(t){return arguments.length?(n=t,o):n},o.x=function(t){return arguments.length?(r="function"==typeof t?t:fx(+t),o):r},o.y=function(t){return arguments.length?(i="function"==typeof t?t:fx(+t),o):i},o.context=function(t){return arguments.length?(a=null==t?null:t,o):a},o}function Qx(t,e,n,r,i){t.moveTo(e,n),t.bezierCurveTo(e=(e+r)/2,n,e,i,r,i)}function t_(t,e,n,r,i){t.moveTo(e,n),t.bezierCurveTo(e,n=(n+i)/2,r,n,r,i)}function e_(t,e,n,r,i){var a=qx(e,n),o=qx(e,n=(n+i)/2),s=qx(r,n),c=qx(r,i);t.moveTo(a[0],a[1]),t.bezierCurveTo(o[0],o[1],s[0],s[1],c[0],c[1])}function n_(){return Kx(Qx)}function r_(){return Kx(t_)}function i_(){var t=Kx(e_);return t.angle=t.x,delete t.x,t.radius=t.y,delete t.y,t}var a_={draw:function(t,e){var n=Math.sqrt(e/xx);t.moveTo(n,0),t.arc(0,0,n,0,kx)}},o_={draw:function(t,e){var n=Math.sqrt(e/5)/2;t.moveTo(-3*n,-n),t.lineTo(-n,-n),t.lineTo(-n,-3*n),t.lineTo(n,-3*n),t.lineTo(n,-n),t.lineTo(3*n,-n),t.lineTo(3*n,n),t.lineTo(n,n),t.lineTo(n,3*n),t.lineTo(-n,3*n),t.lineTo(-n,n),t.lineTo(-3*n,n),t.closePath()}},s_=Math.sqrt(1/3),c_=2*s_,u_={draw:function(t,e){var n=Math.sqrt(e/c_),r=n*s_;t.moveTo(0,-n),t.lineTo(r,0),t.lineTo(0,n),t.lineTo(-r,0),t.closePath()}},l_=Math.sin(xx/10)/Math.sin(7*xx/10),h_=Math.sin(kx/10)*l_,f_=-Math.cos(kx/10)*l_,d_={draw:function(t,e){var n=Math.sqrt(.8908130915292852*e),r=h_*n,i=f_*n;t.moveTo(0,-n),t.lineTo(r,i);for(var a=1;a<5;++a){var o=kx*a/5,s=Math.cos(o),c=Math.sin(o);t.lineTo(c*n,-s*n),t.lineTo(s*r-c*i,c*r+s*i)}t.closePath()}},p_={draw:function(t,e){var n=Math.sqrt(e),r=-n/2;t.rect(r,r,n,n)}},g_=Math.sqrt(3),y_={draw:function(t,e){var n=-Math.sqrt(e/(3*g_));t.moveTo(0,2*n),t.lineTo(-g_*n,-n),t.lineTo(g_*n,-n),t.closePath()}},v_=Math.sqrt(3)/2,m_=1/Math.sqrt(12),b_=3*(m_/2+1),x_={draw:function(t,e){var n=Math.sqrt(e/b_),r=n/2,i=n*m_,a=r,o=n*m_+n,s=-a,c=o;t.moveTo(r,i),t.lineTo(a,o),t.lineTo(s,c),t.lineTo(-.5*r-v_*i,v_*r+-.5*i),t.lineTo(-.5*a-v_*o,v_*a+-.5*o),t.lineTo(-.5*s-v_*c,v_*s+-.5*c),t.lineTo(-.5*r+v_*i,-.5*i-v_*r),t.lineTo(-.5*a+v_*o,-.5*o-v_*a),t.lineTo(-.5*s+v_*c,-.5*c-v_*s),t.closePath()}},__=[a_,o_,u_,p_,d_,y_,x_],k_=function(){var t=fx(a_),e=fx(64),n=null;function r(){var r;if(n||(n=r=Ui()),t.apply(this,arguments).draw(n,+e.apply(this,arguments)),r)return n=null,r+""||null}return r.type=function(e){return arguments.length?(t="function"==typeof e?e:fx(e),r):t},r.size=function(t){return arguments.length?(e="function"==typeof t?t:fx(+t),r):e},r.context=function(t){return arguments.length?(n=null==t?null:t,r):n},r},w_=function(){};function E_(t,e,n){t._context.bezierCurveTo((2*t._x0+t._x1)/3,(2*t._y0+t._y1)/3,(t._x0+2*t._x1)/3,(t._y0+2*t._y1)/3,(t._x0+4*t._x1+e)/6,(t._y0+4*t._y1+n)/6)}function T_(t){this._context=t}T_.prototype={areaStart:function(){this._line=0},areaEnd:function(){this._line=NaN},lineStart:function(){this._x0=this._x1=this._y0=this._y1=NaN,this._point=0},lineEnd:function(){switch(this._point){case 3:E_(this,this._x1,this._y1);case 2:this._context.lineTo(this._x1,this._y1)}(this._line||0!==this._line&&1===this._point)&&this._context.closePath(),this._line=1-this._line},point:function(t,e){switch(t=+t,e=+e,this._point){case 0:this._point=1,this._line?this._context.lineTo(t,e):this._context.moveTo(t,e);break;case 1:this._point=2;break;case 2:this._point=3,this._context.lineTo((5*this._x0+this._x1)/6,(5*this._y0+this._y1)/6);default:E_(this,t,e)}this._x0=this._x1,this._x1=t,this._y0=this._y1,this._y1=e}};var C_=function(t){return new T_(t)};function A_(t){this._context=t}A_.prototype={areaStart:w_,areaEnd:w_,lineStart:function(){this._x0=this._x1=this._x2=this._x3=this._x4=this._y0=this._y1=this._y2=this._y3=this._y4=NaN,this._point=0},lineEnd:function(){switch(this._point){case 1:this._context.moveTo(this._x2,this._y2),this._context.closePath();break;case 2:this._context.moveTo((this._x2+2*this._x3)/3,(this._y2+2*this._y3)/3),this._context.lineTo((this._x3+2*this._x2)/3,(this._y3+2*this._y2)/3),this._context.closePath();break;case 3:this.point(this._x2,this._y2),this.point(this._x3,this._y3),this.point(this._x4,this._y4)}},point:function(t,e){switch(t=+t,e=+e,this._point){case 0:this._point=1,this._x2=t,this._y2=e;break;case 1:this._point=2,this._x3=t,this._y3=e;break;case 2:this._point=3,this._x4=t,this._y4=e,this._context.moveTo((this._x0+4*this._x1+t)/6,(this._y0+4*this._y1+e)/6);break;default:E_(this,t,e)}this._x0=this._x1,this._x1=t,this._y0=this._y1,this._y1=e}};var S_=function(t){return new A_(t)};function M_(t){this._context=t}M_.prototype={areaStart:function(){this._line=0},areaEnd:function(){this._line=NaN},lineStart:function(){this._x0=this._x1=this._y0=this._y1=NaN,this._point=0},lineEnd:function(){(this._line||0!==this._line&&3===this._point)&&this._context.closePath(),this._line=1-this._line},point:function(t,e){switch(t=+t,e=+e,this._point){case 0:this._point=1;break;case 1:this._point=2;break;case 2:this._point=3;var n=(this._x0+4*this._x1+t)/6,r=(this._y0+4*this._y1+e)/6;this._line?this._context.lineTo(n,r):this._context.moveTo(n,r);break;case 3:this._point=4;default:E_(this,t,e)}this._x0=this._x1,this._x1=t,this._y0=this._y1,this._y1=e}};var O_=function(t){return new M_(t)};function D_(t,e){this._basis=new T_(t),this._beta=e}D_.prototype={lineStart:function(){this._x=[],this._y=[],this._basis.lineStart()},lineEnd:function(){var t=this._x,e=this._y,n=t.length-1;if(n>0)for(var r,i=t[0],a=e[0],o=t[n]-i,s=e[n]-a,c=-1;++c<=n;)r=c/n,this._basis.point(this._beta*t[c]+(1-this._beta)*(i+r*o),this._beta*e[c]+(1-this._beta)*(a+r*s));this._x=this._y=null,this._basis.lineEnd()},point:function(t,e){this._x.push(+t),this._y.push(+e)}};var N_=function t(e){function n(t){return 1===e?new T_(t):new D_(t,e)}return n.beta=function(e){return t(+e)},n}(.85);function B_(t,e,n){t._context.bezierCurveTo(t._x1+t._k*(t._x2-t._x0),t._y1+t._k*(t._y2-t._y0),t._x2+t._k*(t._x1-e),t._y2+t._k*(t._y1-n),t._x2,t._y2)}function L_(t,e){this._context=t,this._k=(1-e)/6}L_.prototype={areaStart:function(){this._line=0},areaEnd:function(){this._line=NaN},lineStart:function(){this._x0=this._x1=this._x2=this._y0=this._y1=this._y2=NaN,this._point=0},lineEnd:function(){switch(this._point){case 2:this._context.lineTo(this._x2,this._y2);break;case 3:B_(this,this._x1,this._y1)}(this._line||0!==this._line&&1===this._point)&&this._context.closePath(),this._line=1-this._line},point:function(t,e){switch(t=+t,e=+e,this._point){case 0:this._point=1,this._line?this._context.lineTo(t,e):this._context.moveTo(t,e);break;case 1:this._point=2,this._x1=t,this._y1=e;break;case 2:this._point=3;default:B_(this,t,e)}this._x0=this._x1,this._x1=this._x2,this._x2=t,this._y0=this._y1,this._y1=this._y2,this._y2=e}};var P_=function t(e){function n(t){return new L_(t,e)}return n.tension=function(e){return t(+e)},n}(0);function I_(t,e){this._context=t,this._k=(1-e)/6}I_.prototype={areaStart:w_,areaEnd:w_,lineStart:function(){this._x0=this._x1=this._x2=this._x3=this._x4=this._x5=this._y0=this._y1=this._y2=this._y3=this._y4=this._y5=NaN,this._point=0},lineEnd:function(){switch(this._point){case 1:this._context.moveTo(this._x3,this._y3),this._context.closePath();break;case 2:this._context.lineTo(this._x3,this._y3),this._context.closePath();break;case 3:this.point(this._x3,this._y3),this.point(this._x4,this._y4),this.point(this._x5,this._y5)}},point:function(t,e){switch(t=+t,e=+e,this._point){case 0:this._point=1,this._x3=t,this._y3=e;break;case 1:this._point=2,this._context.moveTo(this._x4=t,this._y4=e);break;case 2:this._point=3,this._x5=t,this._y5=e;break;default:B_(this,t,e)}this._x0=this._x1,this._x1=this._x2,this._x2=t,this._y0=this._y1,this._y1=this._y2,this._y2=e}};var F_=function t(e){function n(t){return new I_(t,e)}return n.tension=function(e){return t(+e)},n}(0);function j_(t,e){this._context=t,this._k=(1-e)/6}j_.prototype={areaStart:function(){this._line=0},areaEnd:function(){this._line=NaN},lineStart:function(){this._x0=this._x1=this._x2=this._y0=this._y1=this._y2=NaN,this._point=0},lineEnd:function(){(this._line||0!==this._line&&3===this._point)&&this._context.closePath(),this._line=1-this._line},point:function(t,e){switch(t=+t,e=+e,this._point){case 0:this._point=1;break;case 1:this._point=2;break;case 2:this._point=3,this._line?this._context.lineTo(this._x2,this._y2):this._context.moveTo(this._x2,this._y2);break;case 3:this._point=4;default:B_(this,t,e)}this._x0=this._x1,this._x1=this._x2,this._x2=t,this._y0=this._y1,this._y1=this._y2,this._y2=e}};var R_=function t(e){function n(t){return new j_(t,e)}return n.tension=function(e){return t(+e)},n}(0);function Y_(t,e,n){var r=t._x1,i=t._y1,a=t._x2,o=t._y2;if(t._l01_a>1e-12){var s=2*t._l01_2a+3*t._l01_a*t._l12_a+t._l12_2a,c=3*t._l01_a*(t._l01_a+t._l12_a);r=(r*s-t._x0*t._l12_2a+t._x2*t._l01_2a)/c,i=(i*s-t._y0*t._l12_2a+t._y2*t._l01_2a)/c}if(t._l23_a>1e-12){var u=2*t._l23_2a+3*t._l23_a*t._l12_a+t._l12_2a,l=3*t._l23_a*(t._l23_a+t._l12_a);a=(a*u+t._x1*t._l23_2a-e*t._l12_2a)/l,o=(o*u+t._y1*t._l23_2a-n*t._l12_2a)/l}t._context.bezierCurveTo(r,i,a,o,t._x2,t._y2)}function z_(t,e){this._context=t,this._alpha=e}z_.prototype={areaStart:function(){this._line=0},areaEnd:function(){this._line=NaN},lineStart:function(){this._x0=this._x1=this._x2=this._y0=this._y1=this._y2=NaN,this._l01_a=this._l12_a=this._l23_a=this._l01_2a=this._l12_2a=this._l23_2a=this._point=0},lineEnd:function(){switch(this._point){case 2:this._context.lineTo(this._x2,this._y2);break;case 3:this.point(this._x2,this._y2)}(this._line||0!==this._line&&1===this._point)&&this._context.closePath(),this._line=1-this._line},point:function(t,e){if(t=+t,e=+e,this._point){var n=this._x2-t,r=this._y2-e;this._l23_a=Math.sqrt(this._l23_2a=Math.pow(n*n+r*r,this._alpha))}switch(this._point){case 0:this._point=1,this._line?this._context.lineTo(t,e):this._context.moveTo(t,e);break;case 1:this._point=2;break;case 2:this._point=3;default:Y_(this,t,e)}this._l01_a=this._l12_a,this._l12_a=this._l23_a,this._l01_2a=this._l12_2a,this._l12_2a=this._l23_2a,this._x0=this._x1,this._x1=this._x2,this._x2=t,this._y0=this._y1,this._y1=this._y2,this._y2=e}};var U_=function t(e){function n(t){return e?new z_(t,e):new L_(t,0)}return n.alpha=function(e){return t(+e)},n}(.5);function $_(t,e){this._context=t,this._alpha=e}$_.prototype={areaStart:w_,areaEnd:w_,lineStart:function(){this._x0=this._x1=this._x2=this._x3=this._x4=this._x5=this._y0=this._y1=this._y2=this._y3=this._y4=this._y5=NaN,this._l01_a=this._l12_a=this._l23_a=this._l01_2a=this._l12_2a=this._l23_2a=this._point=0},lineEnd:function(){switch(this._point){case 1:this._context.moveTo(this._x3,this._y3),this._context.closePath();break;case 2:this._context.lineTo(this._x3,this._y3),this._context.closePath();break;case 3:this.point(this._x3,this._y3),this.point(this._x4,this._y4),this.point(this._x5,this._y5)}},point:function(t,e){if(t=+t,e=+e,this._point){var n=this._x2-t,r=this._y2-e;this._l23_a=Math.sqrt(this._l23_2a=Math.pow(n*n+r*r,this._alpha))}switch(this._point){case 0:this._point=1,this._x3=t,this._y3=e;break;case 1:this._point=2,this._context.moveTo(this._x4=t,this._y4=e);break;case 2:this._point=3,this._x5=t,this._y5=e;break;default:Y_(this,t,e)}this._l01_a=this._l12_a,this._l12_a=this._l23_a,this._l01_2a=this._l12_2a,this._l12_2a=this._l23_2a,this._x0=this._x1,this._x1=this._x2,this._x2=t,this._y0=this._y1,this._y1=this._y2,this._y2=e}};var W_=function t(e){function n(t){return e?new $_(t,e):new I_(t,0)}return n.alpha=function(e){return t(+e)},n}(.5);function H_(t,e){this._context=t,this._alpha=e}H_.prototype={areaStart:function(){this._line=0},areaEnd:function(){this._line=NaN},lineStart:function(){this._x0=this._x1=this._x2=this._y0=this._y1=this._y2=NaN,this._l01_a=this._l12_a=this._l23_a=this._l01_2a=this._l12_2a=this._l23_2a=this._point=0},lineEnd:function(){(this._line||0!==this._line&&3===this._point)&&this._context.closePath(),this._line=1-this._line},point:function(t,e){if(t=+t,e=+e,this._point){var n=this._x2-t,r=this._y2-e;this._l23_a=Math.sqrt(this._l23_2a=Math.pow(n*n+r*r,this._alpha))}switch(this._point){case 0:this._point=1;break;case 1:this._point=2;break;case 2:this._point=3,this._line?this._context.lineTo(this._x2,this._y2):this._context.moveTo(this._x2,this._y2);break;case 3:this._point=4;default:Y_(this,t,e)}this._l01_a=this._l12_a,this._l12_a=this._l23_a,this._l01_2a=this._l12_2a,this._l12_2a=this._l23_2a,this._x0=this._x1,this._x1=this._x2,this._x2=t,this._y0=this._y1,this._y1=this._y2,this._y2=e}};var V_=function t(e){function n(t){return e?new H_(t,e):new j_(t,0)}return n.alpha=function(e){return t(+e)},n}(.5);function G_(t){this._context=t}G_.prototype={areaStart:w_,areaEnd:w_,lineStart:function(){this._point=0},lineEnd:function(){this._point&&this._context.closePath()},point:function(t,e){t=+t,e=+e,this._point?this._context.lineTo(t,e):(this._point=1,this._context.moveTo(t,e))}};var q_=function(t){return new G_(t)};function X_(t){return t<0?-1:1}function Z_(t,e,n){var r=t._x1-t._x0,i=e-t._x1,a=(t._y1-t._y0)/(r||i<0&&-0),o=(n-t._y1)/(i||r<0&&-0),s=(a*i+o*r)/(r+i);return(X_(a)+X_(o))*Math.min(Math.abs(a),Math.abs(o),.5*Math.abs(s))||0}function J_(t,e){var n=t._x1-t._x0;return n?(3*(t._y1-t._y0)/n-e)/2:e}function K_(t,e,n){var r=t._x0,i=t._y0,a=t._x1,o=t._y1,s=(a-r)/3;t._context.bezierCurveTo(r+s,i+s*e,a-s,o-s*n,a,o)}function Q_(t){this._context=t}function tk(t){this._context=new ek(t)}function ek(t){this._context=t}function nk(t){return new Q_(t)}function rk(t){return new tk(t)}function ik(t){this._context=t}function ak(t){var e,n,r=t.length-1,i=new Array(r),a=new Array(r),o=new Array(r);for(i[0]=0,a[0]=2,o[0]=t[0]+2*t[1],e=1;e<r-1;++e)i[e]=1,a[e]=4,o[e]=4*t[e]+2*t[e+1];for(i[r-1]=2,a[r-1]=7,o[r-1]=8*t[r-1]+t[r],e=1;e<r;++e)n=i[e]/a[e-1],a[e]-=n,o[e]-=n*o[e-1];for(i[r-1]=o[r-1]/a[r-1],e=r-2;e>=0;--e)i[e]=(o[e]-i[e+1])/a[e];for(a[r-1]=(t[r]+i[r-1])/2,e=0;e<r-1;++e)a[e]=2*t[e+1]-i[e+1];return[i,a]}Q_.prototype={areaStart:function(){this._line=0},areaEnd:function(){this._line=NaN},lineStart:function(){this._x0=this._x1=this._y0=this._y1=this._t0=NaN,this._point=0},lineEnd:function(){switch(this._point){case 2:this._context.lineTo(this._x1,this._y1);break;case 3:K_(this,this._t0,J_(this,this._t0))}(this._line||0!==this._line&&1===this._point)&&this._context.closePath(),this._line=1-this._line},point:function(t,e){var n=NaN;if(e=+e,(t=+t)!==this._x1||e!==this._y1){switch(this._point){case 0:this._point=1,this._line?this._context.lineTo(t,e):this._context.moveTo(t,e);break;case 1:this._point=2;break;case 2:this._point=3,K_(this,J_(this,n=Z_(this,t,e)),n);break;default:K_(this,this._t0,n=Z_(this,t,e))}this._x0=this._x1,this._x1=t,this._y0=this._y1,this._y1=e,this._t0=n}}},(tk.prototype=Object.create(Q_.prototype)).point=function(t,e){Q_.prototype.point.call(this,e,t)},ek.prototype={moveTo:function(t,e){this._context.moveTo(e,t)},closePath:function(){this._context.closePath()},lineTo:function(t,e){this._context.lineTo(e,t)},bezierCurveTo:function(t,e,n,r,i,a){this._context.bezierCurveTo(e,t,r,n,a,i)}},ik.prototype={areaStart:function(){this._line=0},areaEnd:function(){this._line=NaN},lineStart:function(){this._x=[],this._y=[]},lineEnd:function(){var t=this._x,e=this._y,n=t.length;if(n)if(this._line?this._context.lineTo(t[0],e[0]):this._context.moveTo(t[0],e[0]),2===n)this._context.lineTo(t[1],e[1]);else for(var r=ak(t),i=ak(e),a=0,o=1;o<n;++a,++o)this._context.bezierCurveTo(r[0][a],i[0][a],r[1][a],i[1][a],t[o],e[o]);(this._line||0!==this._line&&1===n)&&this._context.closePath(),this._line=1-this._line,this._x=this._y=null},point:function(t,e){this._x.push(+t),this._y.push(+e)}};var ok=function(t){return new ik(t)};function sk(t,e){this._context=t,this._t=e}sk.prototype={areaStart:function(){this._line=0},areaEnd:function(){this._line=NaN},lineStart:function(){this._x=this._y=NaN,this._point=0},lineEnd:function(){0<this._t&&this._t<1&&2===this._point&&this._context.lineTo(this._x,this._y),(this._line||0!==this._line&&1===this._point)&&this._context.closePath(),this._line>=0&&(this._t=1-this._t,this._line=1-this._line)},point:function(t,e){switch(t=+t,e=+e,this._point){case 0:this._point=1,this._line?this._context.lineTo(t,e):this._context.moveTo(t,e);break;case 1:this._point=2;default:if(this._t<=0)this._context.lineTo(this._x,e),this._context.lineTo(t,e);else{var n=this._x*(1-this._t)+t*this._t;this._context.lineTo(n,this._y),this._context.lineTo(n,e)}}this._x=t,this._y=e}};var ck=function(t){return new sk(t,.5)};function uk(t){return new sk(t,0)}function lk(t){return new sk(t,1)}var hk=function(t,e){if((i=t.length)>1)for(var n,r,i,a=1,o=t[e[0]],s=o.length;a<i;++a)for(r=o,o=t[e[a]],n=0;n<s;++n)o[n][1]+=o[n][0]=isNaN(r[n][1])?r[n][0]:r[n][1]},fk=function(t){for(var e=t.length,n=new Array(e);--e>=0;)n[e]=e;return n};function dk(t,e){return t[e]}var pk=function(){var t=fx([]),e=fk,n=hk,r=dk;function i(i){var a,o,s=t.apply(this,arguments),c=i.length,u=s.length,l=new Array(u);for(a=0;a<u;++a){for(var h,f=s[a],d=l[a]=new Array(c),p=0;p<c;++p)d[p]=h=[0,+r(i[p],f,p,i)],h.data=i[p];d.key=f}for(a=0,o=e(l);a<u;++a)l[o[a]].index=a;return n(l,o),l}return i.keys=function(e){return arguments.length?(t="function"==typeof e?e:fx(Xx.call(e)),i):t},i.value=function(t){return arguments.length?(r="function"==typeof t?t:fx(+t),i):r},i.order=function(t){return arguments.length?(e=null==t?fk:"function"==typeof t?t:fx(Xx.call(t)),i):e},i.offset=function(t){return arguments.length?(n=null==t?hk:t,i):n},i},gk=function(t,e){if((r=t.length)>0){for(var n,r,i,a=0,o=t[0].length;a<o;++a){for(i=n=0;n<r;++n)i+=t[n][a][1]||0;if(i)for(n=0;n<r;++n)t[n][a][1]/=i}hk(t,e)}},yk=function(t,e){if((s=t.length)>0)for(var n,r,i,a,o,s,c=0,u=t[e[0]].length;c<u;++c)for(a=o=0,n=0;n<s;++n)(i=(r=t[e[n]][c])[1]-r[0])>0?(r[0]=a,r[1]=a+=i):i<0?(r[1]=o,r[0]=o+=i):(r[0]=0,r[1]=i)},vk=function(t,e){if((n=t.length)>0){for(var n,r=0,i=t[e[0]],a=i.length;r<a;++r){for(var o=0,s=0;o<n;++o)s+=t[o][r][1]||0;i[r][1]+=i[r][0]=-s/2}hk(t,e)}},mk=function(t,e){if((i=t.length)>0&&(r=(n=t[e[0]]).length)>0){for(var n,r,i,a=0,o=1;o<r;++o){for(var s=0,c=0,u=0;s<i;++s){for(var l=t[e[s]],h=l[o][1]||0,f=(h-(l[o-1][1]||0))/2,d=0;d<s;++d){var p=t[e[d]];f+=(p[o][1]||0)-(p[o-1][1]||0)}c+=h,u+=f*h}n[o-1][1]+=n[o-1][0]=a,c&&(a-=u/c)}n[o-1][1]+=n[o-1][0]=a,hk(t,e)}},bk=function(t){var e=t.map(xk);return fk(t).sort((function(t,n){return e[t]-e[n]}))};function xk(t){for(var e,n=-1,r=0,i=t.length,a=-1/0;++n<i;)(e=+t[n][1])>a&&(a=e,r=n);return r}var _k=function(t){var e=t.map(kk);return fk(t).sort((function(t,n){return e[t]-e[n]}))};function kk(t){for(var e,n=0,r=-1,i=t.length;++r<i;)(e=+t[r][1])&&(n+=e);return n}var wk=function(t){return _k(t).reverse()},Ek=function(t){var e,n,r=t.length,i=t.map(kk),a=bk(t),o=0,s=0,c=[],u=[];for(e=0;e<r;++e)n=a[e],o<s?(o+=i[n],c.push(n)):(s+=i[n],u.push(n));return u.reverse().concat(c)},Tk=function(t){return fk(t).reverse()};var Ck=Date.prototype.toISOString?function(t){return t.toISOString()}:Wy("%Y-%m-%dT%H:%M:%S.%LZ");var Ak=+new Date("2000-01-01T00:00:00.000Z")?function(t){var e=new Date(t);return isNaN(e)?null:e}:Hy("%Y-%m-%dT%H:%M:%S.%LZ"),Sk=function(t,e,n){var r=new $n,i=e;return null==e?(r.restart(t,e,n),r):(e=+e,n=null==n?zn():+n,r.restart((function a(o){o+=i,r.restart(a,i+=e,n),t(o)}),e,n),r)},Mk=function(t){return function(){return t}};function Ok(t){return t[0]}function Dk(t){return t[1]}function Nk(){this._=null}function Bk(t){t.U=t.C=t.L=t.R=t.P=t.N=null}function Lk(t,e){var n=e,r=e.R,i=n.U;i?i.L===n?i.L=r:i.R=r:t._=r,r.U=i,n.U=r,n.R=r.L,n.R&&(n.R.U=n),r.L=n}function Pk(t,e){var n=e,r=e.L,i=n.U;i?i.L===n?i.L=r:i.R=r:t._=r,r.U=i,n.U=r,n.L=r.R,n.L&&(n.L.U=n),r.R=n}function Ik(t){for(;t.L;)t=t.L;return t}Nk.prototype={constructor:Nk,insert:function(t,e){var n,r,i;if(t){if(e.P=t,e.N=t.N,t.N&&(t.N.P=e),t.N=e,t.R){for(t=t.R;t.L;)t=t.L;t.L=e}else t.R=e;n=t}else this._?(t=Ik(this._),e.P=null,e.N=t,t.P=t.L=e,n=t):(e.P=e.N=null,this._=e,n=null);for(e.L=e.R=null,e.U=n,e.C=!0,t=e;n&&n.C;)n===(r=n.U).L?(i=r.R)&&i.C?(n.C=i.C=!1,r.C=!0,t=r):(t===n.R&&(Lk(this,n),n=(t=n).U),n.C=!1,r.C=!0,Pk(this,r)):(i=r.L)&&i.C?(n.C=i.C=!1,r.C=!0,t=r):(t===n.L&&(Pk(this,n),n=(t=n).U),n.C=!1,r.C=!0,Lk(this,r)),n=t.U;this._.C=!1},remove:function(t){t.N&&(t.N.P=t.P),t.P&&(t.P.N=t.N),t.N=t.P=null;var e,n,r,i=t.U,a=t.L,o=t.R;if(n=a?o?Ik(o):a:o,i?i.L===t?i.L=n:i.R=n:this._=n,a&&o?(r=n.C,n.C=t.C,n.L=a,a.U=n,n!==o?(i=n.U,n.U=t.U,t=n.R,i.L=t,n.R=o,o.U=n):(n.U=i,i=n,t=n.R)):(r=t.C,t=n),t&&(t.U=i),!r)if(t&&t.C)t.C=!1;else{do{if(t===this._)break;if(t===i.L){if((e=i.R).C&&(e.C=!1,i.C=!0,Lk(this,i),e=i.R),e.L&&e.L.C||e.R&&e.R.C){e.R&&e.R.C||(e.L.C=!1,e.C=!0,Pk(this,e),e=i.R),e.C=i.C,i.C=e.R.C=!1,Lk(this,i),t=this._;break}}else if((e=i.L).C&&(e.C=!1,i.C=!0,Pk(this,i),e=i.L),e.L&&e.L.C||e.R&&e.R.C){e.L&&e.L.C||(e.R.C=!1,e.C=!0,Lk(this,e),e=i.L),e.C=i.C,i.C=e.L.C=!1,Pk(this,i),t=this._;break}e.C=!0,t=i,i=i.U}while(!t.C);t&&(t.C=!1)}}};var Fk=Nk;function jk(t,e,n,r){var i=[null,null],a=cw.push(i)-1;return i.left=t,i.right=e,n&&Yk(i,t,e,n),r&&Yk(i,e,t,r),ow[t.index].halfedges.push(a),ow[e.index].halfedges.push(a),i}function Rk(t,e,n){var r=[e,n];return r.left=t,r}function Yk(t,e,n,r){t[0]||t[1]?t.left===n?t[1]=r:t[0]=r:(t[0]=r,t.left=e,t.right=n)}function zk(t,e,n,r,i){var a,o=t[0],s=t[1],c=o[0],u=o[1],l=0,h=1,f=s[0]-c,d=s[1]-u;if(a=e-c,f||!(a>0)){if(a/=f,f<0){if(a<l)return;a<h&&(h=a)}else if(f>0){if(a>h)return;a>l&&(l=a)}if(a=r-c,f||!(a<0)){if(a/=f,f<0){if(a>h)return;a>l&&(l=a)}else if(f>0){if(a<l)return;a<h&&(h=a)}if(a=n-u,d||!(a>0)){if(a/=d,d<0){if(a<l)return;a<h&&(h=a)}else if(d>0){if(a>h)return;a>l&&(l=a)}if(a=i-u,d||!(a<0)){if(a/=d,d<0){if(a>h)return;a>l&&(l=a)}else if(d>0){if(a<l)return;a<h&&(h=a)}return!(l>0||h<1)||(l>0&&(t[0]=[c+l*f,u+l*d]),h<1&&(t[1]=[c+h*f,u+h*d]),!0)}}}}}function Uk(t,e,n,r,i){var a=t[1];if(a)return!0;var o,s,c=t[0],u=t.left,l=t.right,h=u[0],f=u[1],d=l[0],p=l[1],g=(h+d)/2,y=(f+p)/2;if(p===f){if(g<e||g>=r)return;if(h>d){if(c){if(c[1]>=i)return}else c=[g,n];a=[g,i]}else{if(c){if(c[1]<n)return}else c=[g,i];a=[g,n]}}else if(s=y-(o=(h-d)/(p-f))*g,o<-1||o>1)if(h>d){if(c){if(c[1]>=i)return}else c=[(n-s)/o,n];a=[(i-s)/o,i]}else{if(c){if(c[1]<n)return}else c=[(i-s)/o,i];a=[(n-s)/o,n]}else if(f<p){if(c){if(c[0]>=r)return}else c=[e,o*e+s];a=[r,o*r+s]}else{if(c){if(c[0]<e)return}else c=[r,o*r+s];a=[e,o*e+s]}return t[0]=c,t[1]=a,!0}function $k(t,e){var n=t.site,r=e.left,i=e.right;return n===i&&(i=r,r=n),i?Math.atan2(i[1]-r[1],i[0]-r[0]):(n===r?(r=e[1],i=e[0]):(r=e[0],i=e[1]),Math.atan2(r[0]-i[0],i[1]-r[1]))}function Wk(t,e){return e[+(e.left!==t.site)]}function Hk(t,e){return e[+(e.left===t.site)]}var Vk,Gk=[];function qk(){Bk(this),this.x=this.y=this.arc=this.site=this.cy=null}function Xk(t){var e=t.P,n=t.N;if(e&&n){var r=e.site,i=t.site,a=n.site;if(r!==a){var o=i[0],s=i[1],c=r[0]-o,u=r[1]-s,l=a[0]-o,h=a[1]-s,f=2*(c*h-u*l);if(!(f>=-lw)){var d=c*c+u*u,p=l*l+h*h,g=(h*d-u*p)/f,y=(c*p-l*d)/f,v=Gk.pop()||new qk;v.arc=t,v.site=i,v.x=g+o,v.y=(v.cy=y+s)+Math.sqrt(g*g+y*y),t.circle=v;for(var m=null,b=sw._;b;)if(v.y<b.y||v.y===b.y&&v.x<=b.x){if(!b.L){m=b.P;break}b=b.L}else{if(!b.R){m=b;break}b=b.R}sw.insert(m,v),m||(Vk=v)}}}}function Zk(t){var e=t.circle;e&&(e.P||(Vk=e.N),sw.remove(e),Gk.push(e),Bk(e),t.circle=null)}var Jk=[];function Kk(){Bk(this),this.edge=this.site=this.circle=null}function Qk(t){var e=Jk.pop()||new Kk;return e.site=t,e}function tw(t){Zk(t),aw.remove(t),Jk.push(t),Bk(t)}function ew(t){var e=t.circle,n=e.x,r=e.cy,i=[n,r],a=t.P,o=t.N,s=[t];tw(t);for(var c=a;c.circle&&Math.abs(n-c.circle.x)<uw&&Math.abs(r-c.circle.cy)<uw;)a=c.P,s.unshift(c),tw(c),c=a;s.unshift(c),Zk(c);for(var u=o;u.circle&&Math.abs(n-u.circle.x)<uw&&Math.abs(r-u.circle.cy)<uw;)o=u.N,s.push(u),tw(u),u=o;s.push(u),Zk(u);var l,h=s.length;for(l=1;l<h;++l)u=s[l],c=s[l-1],Yk(u.edge,c.site,u.site,i);c=s[0],(u=s[h-1]).edge=jk(c.site,u.site,null,i),Xk(c),Xk(u)}function nw(t){for(var e,n,r,i,a=t[0],o=t[1],s=aw._;s;)if((r=rw(s,o)-a)>uw)s=s.L;else{if(!((i=a-iw(s,o))>uw)){r>-uw?(e=s.P,n=s):i>-uw?(e=s,n=s.N):e=n=s;break}if(!s.R){e=s;break}s=s.R}!function(t){ow[t.index]={site:t,halfedges:[]}}(t);var c=Qk(t);if(aw.insert(e,c),e||n){if(e===n)return Zk(e),n=Qk(e.site),aw.insert(c,n),c.edge=n.edge=jk(e.site,c.site),Xk(e),void Xk(n);if(n){Zk(e),Zk(n);var u=e.site,l=u[0],h=u[1],f=t[0]-l,d=t[1]-h,p=n.site,g=p[0]-l,y=p[1]-h,v=2*(f*y-d*g),m=f*f+d*d,b=g*g+y*y,x=[(y*m-d*b)/v+l,(f*b-g*m)/v+h];Yk(n.edge,u,p,x),c.edge=jk(u,t,null,x),n.edge=jk(t,p,null,x),Xk(e),Xk(n)}else c.edge=jk(e.site,c.site)}}function rw(t,e){var n=t.site,r=n[0],i=n[1],a=i-e;if(!a)return r;var o=t.P;if(!o)return-1/0;var s=(n=o.site)[0],c=n[1],u=c-e;if(!u)return s;var l=s-r,h=1/a-1/u,f=l/u;return h?(-f+Math.sqrt(f*f-2*h*(l*l/(-2*u)-c+u/2+i-a/2)))/h+r:(r+s)/2}function iw(t,e){var n=t.N;if(n)return rw(n,e);var r=t.site;return r[1]===e?r[0]:1/0}var aw,ow,sw,cw,uw=1e-6,lw=1e-12;function hw(t,e){return e[1]-t[1]||e[0]-t[0]}function fw(t,e){var n,r,i,a=t.sort(hw).pop();for(cw=[],ow=new Array(t.length),aw=new Fk,sw=new Fk;;)if(i=Vk,a&&(!i||a[1]<i.y||a[1]===i.y&&a[0]<i.x))a[0]===n&&a[1]===r||(nw(a),n=a[0],r=a[1]),a=t.pop();else{if(!i)break;ew(i.arc)}if(function(){for(var t,e,n,r,i=0,a=ow.length;i<a;++i)if((t=ow[i])&&(r=(e=t.halfedges).length)){var o=new Array(r),s=new Array(r);for(n=0;n<r;++n)o[n]=n,s[n]=$k(t,cw[e[n]]);for(o.sort((function(t,e){return s[e]-s[t]})),n=0;n<r;++n)s[n]=e[o[n]];for(n=0;n<r;++n)e[n]=s[n]}}(),e){var o=+e[0][0],s=+e[0][1],c=+e[1][0],u=+e[1][1];!function(t,e,n,r){for(var i,a=cw.length;a--;)Uk(i=cw[a],t,e,n,r)&&zk(i,t,e,n,r)&&(Math.abs(i[0][0]-i[1][0])>uw||Math.abs(i[0][1]-i[1][1])>uw)||delete cw[a]}(o,s,c,u),function(t,e,n,r){var i,a,o,s,c,u,l,h,f,d,p,g,y=ow.length,v=!0;for(i=0;i<y;++i)if(a=ow[i]){for(o=a.site,s=(c=a.halfedges).length;s--;)cw[c[s]]||c.splice(s,1);for(s=0,u=c.length;s<u;)p=(d=Hk(a,cw[c[s]]))[0],g=d[1],h=(l=Wk(a,cw[c[++s%u]]))[0],f=l[1],(Math.abs(p-h)>uw||Math.abs(g-f)>uw)&&(c.splice(s,0,cw.push(Rk(o,d,Math.abs(p-t)<uw&&r-g>uw?[t,Math.abs(h-t)<uw?f:r]:Math.abs(g-r)<uw&&n-p>uw?[Math.abs(f-r)<uw?h:n,r]:Math.abs(p-n)<uw&&g-e>uw?[n,Math.abs(h-n)<uw?f:e]:Math.abs(g-e)<uw&&p-t>uw?[Math.abs(f-e)<uw?h:t,e]:null))-1),++u);u&&(v=!1)}if(v){var m,b,x,_=1/0;for(i=0,v=null;i<y;++i)(a=ow[i])&&(x=(m=(o=a.site)[0]-t)*m+(b=o[1]-e)*b)<_&&(_=x,v=a);if(v){var k=[t,e],w=[t,r],E=[n,r],T=[n,e];v.halfedges.push(cw.push(Rk(o=v.site,k,w))-1,cw.push(Rk(o,w,E))-1,cw.push(Rk(o,E,T))-1,cw.push(Rk(o,T,k))-1)}}for(i=0;i<y;++i)(a=ow[i])&&(a.halfedges.length||delete ow[i])}(o,s,c,u)}this.edges=cw,this.cells=ow,aw=sw=cw=ow=null}fw.prototype={constructor:fw,polygons:function(){var t=this.edges;return this.cells.map((function(e){var n=e.halfedges.map((function(n){return Wk(e,t[n])}));return n.data=e.site.data,n}))},triangles:function(){var t=[],e=this.edges;return this.cells.forEach((function(n,r){if(a=(i=n.halfedges).length)for(var i,a,o,s,c,u,l=n.site,h=-1,f=e[i[a-1]],d=f.left===l?f.right:f.left;++h<a;)o=d,d=(f=e[i[h]]).left===l?f.right:f.left,o&&d&&r<o.index&&r<d.index&&(c=o,u=d,((s=l)[0]-u[0])*(c[1]-s[1])-(s[0]-c[0])*(u[1]-s[1])<0)&&t.push([l.data,o.data,d.data])})),t},links:function(){return this.edges.filter((function(t){return t.right})).map((function(t){return{source:t.left.data,target:t.right.data}}))},find:function(t,e,n){for(var r,i,a=this,o=a._found||0,s=a.cells.length;!(i=a.cells[o]);)if(++o>=s)return null;var c=t-i.site[0],u=e-i.site[1],l=c*c+u*u;do{i=a.cells[r=o],o=null,i.halfedges.forEach((function(n){var r=a.edges[n],s=r.left;if(s!==i.site&&s||(s=r.right)){var c=t-s[0],u=e-s[1],h=c*c+u*u;h<l&&(l=h,o=s.index)}}))}while(null!==o);return a._found=r,null==n||l<=n*n?i.site:null}};var dw=function(){var t=Ok,e=Dk,n=null;function r(r){return new fw(r.map((function(n,i){var a=[Math.round(t(n,i,r)/uw)*uw,Math.round(e(n,i,r)/uw)*uw];return a.index=i,a.data=n,a})),n)}return r.polygons=function(t){return r(t).polygons()},r.links=function(t){return r(t).links()},r.triangles=function(t){return r(t).triangles()},r.x=function(e){return arguments.length?(t="function"==typeof e?e:Mk(+e),r):t},r.y=function(t){return arguments.length?(e="function"==typeof t?t:Mk(+t),r):e},r.extent=function(t){return arguments.length?(n=null==t?null:[[+t[0][0],+t[0][1]],[+t[1][0],+t[1][1]]],r):n&&[[n[0][0],n[0][1]],[n[1][0],n[1][1]]]},r.size=function(t){return arguments.length?(n=null==t?null:[[0,0],[+t[0],+t[1]]],r):n&&[n[1][0]-n[0][0],n[1][1]-n[0][1]]},r},pw=function(t){return function(){return t}};function gw(t,e,n){this.target=t,this.type=e,this.transform=n}function yw(t,e,n){this.k=t,this.x=e,this.y=n}yw.prototype={constructor:yw,scale:function(t){return 1===t?this:new yw(this.k*t,this.x,this.y)},translate:function(t,e){return 0===t&0===e?this:new yw(this.k,this.x+this.k*t,this.y+this.k*e)},apply:function(t){return[t[0]*this.k+this.x,t[1]*this.k+this.y]},applyX:function(t){return t*this.k+this.x},applyY:function(t){return t*this.k+this.y},invert:function(t){return[(t[0]-this.x)/this.k,(t[1]-this.y)/this.k]},invertX:function(t){return(t-this.x)/this.k},invertY:function(t){return(t-this.y)/this.k},rescaleX:function(t){return t.copy().domain(t.range().map(this.invertX,this).map(t.invert,t))},rescaleY:function(t){return t.copy().domain(t.range().map(this.invertY,this).map(t.invert,t))},toString:function(){return"translate("+this.x+","+this.y+") scale("+this.k+")"}};var vw=new yw(1,0,0);function mw(t){for(;!t.__zoom;)if(!(t=t.parentNode))return vw;return t.__zoom}function bw(){ce.stopImmediatePropagation()}mw.prototype=yw.prototype;var xw=function(){ce.preventDefault(),ce.stopImmediatePropagation()};function _w(){return!ce.ctrlKey&&!ce.button}function kw(){var t=this;return t instanceof SVGElement?(t=t.ownerSVGElement||t).hasAttribute("viewBox")?[[(t=t.viewBox.baseVal).x,t.y],[t.x+t.width,t.y+t.height]]:[[0,0],[t.width.baseVal.value,t.height.baseVal.value]]:[[0,0],[t.clientWidth,t.clientHeight]]}function ww(){return this.__zoom||vw}function Ew(){return-ce.deltaY*(1===ce.deltaMode?.05:ce.deltaMode?1:.002)}function Tw(){return navigator.maxTouchPoints||"ontouchstart"in this}function Cw(t,e,n){var r=t.invertX(e[0][0])-n[0][0],i=t.invertX(e[1][0])-n[1][0],a=t.invertY(e[0][1])-n[0][1],o=t.invertY(e[1][1])-n[1][1];return t.translate(i>r?(r+i)/2:Math.min(0,r)||Math.max(0,i),o>a?(a+o)/2:Math.min(0,a)||Math.max(0,o))}var Aw=function(){var t,e,n=_w,r=kw,i=Cw,a=Ew,o=Tw,s=[0,1/0],c=[[-1/0,-1/0],[1/0,1/0]],u=250,l=fp,h=lt("start","zoom","end"),f=0;function d(t){t.property("__zoom",ww).on("wheel.zoom",x).on("mousedown.zoom",_).on("dblclick.zoom",k).filter(o).on("touchstart.zoom",w).on("touchmove.zoom",E).on("touchend.zoom touchcancel.zoom",T).style("touch-action","none").style("-webkit-tap-highlight-color","rgba(0,0,0,0)")}function p(t,e){return(e=Math.max(s[0],Math.min(s[1],e)))===t.k?t:new yw(e,t.x,t.y)}function g(t,e,n){var r=e[0]-n[0]*t.k,i=e[1]-n[1]*t.k;return r===t.x&&i===t.y?t:new yw(t.k,r,i)}function y(t){return[(+t[0][0]+ +t[1][0])/2,(+t[0][1]+ +t[1][1])/2]}function v(t,e,n){t.on("start.zoom",(function(){m(this,arguments).start()})).on("interrupt.zoom end.zoom",(function(){m(this,arguments).end()})).tween("zoom",(function(){var t=this,i=arguments,a=m(t,i),o=r.apply(t,i),s=null==n?y(o):"function"==typeof n?n.apply(t,i):n,c=Math.max(o[1][0]-o[0][0],o[1][1]-o[0][1]),u=t.__zoom,h="function"==typeof e?e.apply(t,i):e,f=l(u.invert(s).concat(c/u.k),h.invert(s).concat(c/h.k));return function(t){if(1===t)t=h;else{var e=f(t),n=c/e[2];t=new yw(n,s[0]-e[0]*n,s[1]-e[1]*n)}a.zoom(null,t)}}))}function m(t,e,n){return!n&&t.__zooming||new b(t,e)}function b(t,e){this.that=t,this.args=e,this.active=0,this.extent=r.apply(t,e),this.taps=0}function x(){if(n.apply(this,arguments)){var t=m(this,arguments),e=this.__zoom,r=Math.max(s[0],Math.min(s[1],e.k*Math.pow(2,a.apply(this,arguments)))),o=Nn(this);if(t.wheel)t.mouse[0][0]===o[0]&&t.mouse[0][1]===o[1]||(t.mouse[1]=e.invert(t.mouse[0]=o)),clearTimeout(t.wheel);else{if(e.k===r)return;t.mouse=[o,e.invert(o)],or(this),t.start()}xw(),t.wheel=setTimeout(u,150),t.zoom("mouse",i(g(p(e,r),t.mouse[0],t.mouse[1]),t.extent,c))}function u(){t.wheel=null,t.end()}}function _(){if(!e&&n.apply(this,arguments)){var t=m(this,arguments,!0),r=ke(ce.view).on("mousemove.zoom",u,!0).on("mouseup.zoom",l,!0),a=Nn(this),o=ce.clientX,s=ce.clientY;Te(ce.view),bw(),t.mouse=[a,this.__zoom.invert(a)],or(this),t.start()}function u(){if(xw(),!t.moved){var e=ce.clientX-o,n=ce.clientY-s;t.moved=e*e+n*n>f}t.zoom("mouse",i(g(t.that.__zoom,t.mouse[0]=Nn(t.that),t.mouse[1]),t.extent,c))}function l(){r.on("mousemove.zoom mouseup.zoom",null),Ce(ce.view,t.moved),xw(),t.end()}}function k(){if(n.apply(this,arguments)){var t=this.__zoom,e=Nn(this),a=t.invert(e),o=t.k*(ce.shiftKey?.5:2),s=i(g(p(t,o),e,a),r.apply(this,arguments),c);xw(),u>0?ke(this).transition().duration(u).call(v,s,e):ke(this).call(d.transform,s)}}function w(){if(n.apply(this,arguments)){var e,r,i,a,o=ce.touches,s=o.length,c=m(this,arguments,ce.changedTouches.length===s);for(bw(),r=0;r<s;++r)i=o[r],a=[a=Dn(this,o,i.identifier),this.__zoom.invert(a),i.identifier],c.touch0?c.touch1||c.touch0[2]===a[2]||(c.touch1=a,c.taps=0):(c.touch0=a,e=!0,c.taps=1+!!t);t&&(t=clearTimeout(t)),e&&(c.taps<2&&(t=setTimeout((function(){t=null}),500)),or(this),c.start())}}function E(){if(this.__zooming){var e,n,r,a,o=m(this,arguments),s=ce.changedTouches,u=s.length;for(xw(),t&&(t=clearTimeout(t)),o.taps=0,e=0;e<u;++e)n=s[e],r=Dn(this,s,n.identifier),o.touch0&&o.touch0[2]===n.identifier?o.touch0[0]=r:o.touch1&&o.touch1[2]===n.identifier&&(o.touch1[0]=r);if(n=o.that.__zoom,o.touch1){var l=o.touch0[0],h=o.touch0[1],f=o.touch1[0],d=o.touch1[1],y=(y=f[0]-l[0])*y+(y=f[1]-l[1])*y,v=(v=d[0]-h[0])*v+(v=d[1]-h[1])*v;n=p(n,Math.sqrt(y/v)),r=[(l[0]+f[0])/2,(l[1]+f[1])/2],a=[(h[0]+d[0])/2,(h[1]+d[1])/2]}else{if(!o.touch0)return;r=o.touch0[0],a=o.touch0[1]}o.zoom("touch",i(g(n,r,a),o.extent,c))}}function T(){if(this.__zooming){var t,n,r=m(this,arguments),i=ce.changedTouches,a=i.length;for(bw(),e&&clearTimeout(e),e=setTimeout((function(){e=null}),500),t=0;t<a;++t)n=i[t],r.touch0&&r.touch0[2]===n.identifier?delete r.touch0:r.touch1&&r.touch1[2]===n.identifier&&delete r.touch1;if(r.touch1&&!r.touch0&&(r.touch0=r.touch1,delete r.touch1),r.touch0)r.touch0[1]=this.__zoom.invert(r.touch0[0]);else if(r.end(),2===r.taps){var o=ke(this).on("dblclick.zoom");o&&o.apply(this,arguments)}}}return d.transform=function(t,e,n){var r=t.selection?t.selection():t;r.property("__zoom",ww),t!==r?v(t,e,n):r.interrupt().each((function(){m(this,arguments).start().zoom(null,"function"==typeof e?e.apply(this,arguments):e).end()}))},d.scaleBy=function(t,e,n){d.scaleTo(t,(function(){var t=this.__zoom.k,n="function"==typeof e?e.apply(this,arguments):e;return t*n}),n)},d.scaleTo=function(t,e,n){d.transform(t,(function(){var t=r.apply(this,arguments),a=this.__zoom,o=null==n?y(t):"function"==typeof n?n.apply(this,arguments):n,s=a.invert(o),u="function"==typeof e?e.apply(this,arguments):e;return i(g(p(a,u),o,s),t,c)}),n)},d.translateBy=function(t,e,n){d.transform(t,(function(){return i(this.__zoom.translate("function"==typeof e?e.apply(this,arguments):e,"function"==typeof n?n.apply(this,arguments):n),r.apply(this,arguments),c)}))},d.translateTo=function(t,e,n,a){d.transform(t,(function(){var t=r.apply(this,arguments),o=this.__zoom,s=null==a?y(t):"function"==typeof a?a.apply(this,arguments):a;return i(vw.translate(s[0],s[1]).scale(o.k).translate("function"==typeof e?-e.apply(this,arguments):-e,"function"==typeof n?-n.apply(this,arguments):-n),t,c)}),a)},b.prototype={start:function(){return 1==++this.active&&(this.that.__zooming=this,this.emit("start")),this},zoom:function(t,e){return this.mouse&&"mouse"!==t&&(this.mouse[1]=e.invert(this.mouse[0])),this.touch0&&"touch"!==t&&(this.touch0[1]=e.invert(this.touch0[0])),this.touch1&&"touch"!==t&&(this.touch1[1]=e.invert(this.touch1[0])),this.that.__zoom=e,this.emit("zoom"),this},end:function(){return 0==--this.active&&(delete this.that.__zooming,this.emit("end")),this},emit:function(t){pe(new gw(d,t,this.that.__zoom),h.apply,h,[t,this.that,this.args])}},d.wheelDelta=function(t){return arguments.length?(a="function"==typeof t?t:pw(+t),d):a},d.filter=function(t){return arguments.length?(n="function"==typeof t?t:pw(!!t),d):n},d.touchable=function(t){return arguments.length?(o="function"==typeof t?t:pw(!!t),d):o},d.extent=function(t){return arguments.length?(r="function"==typeof t?t:pw([[+t[0][0],+t[0][1]],[+t[1][0],+t[1][1]]]),d):r},d.scaleExtent=function(t){return arguments.length?(s[0]=+t[0],s[1]=+t[1],d):[s[0],s[1]]},d.translateExtent=function(t){return arguments.length?(c[0][0]=+t[0][0],c[1][0]=+t[1][0],c[0][1]=+t[0][1],c[1][1]=+t[1][1],d):[[c[0][0],c[0][1]],[c[1][0],c[1][1]]]},d.constrain=function(t){return arguments.length?(i=t,d):i},d.duration=function(t){return arguments.length?(u=+t,d):u},d.interpolate=function(t){return arguments.length?(l=t,d):l},d.on=function(){var t=h.on.apply(h,arguments);return t===h?d:t},d.clickDistance=function(t){return arguments.length?(f=(t=+t)*t,d):Math.sqrt(f)},d};n.d(e,"version",(function(){return"5.15.0"})),n.d(e,"bisect",(function(){return c})),n.d(e,"bisectRight",(function(){return o})),n.d(e,"bisectLeft",(function(){return s})),n.d(e,"ascending",(function(){return r})),n.d(e,"bisector",(function(){return i})),n.d(e,"cross",(function(){return h})),n.d(e,"descending",(function(){return f})),n.d(e,"deviation",(function(){return g})),n.d(e,"extent",(function(){return y})),n.d(e,"histogram",(function(){return O})),n.d(e,"thresholdFreedmanDiaconis",(function(){return N})),n.d(e,"thresholdScott",(function(){return B})),n.d(e,"thresholdSturges",(function(){return M})),n.d(e,"max",(function(){return L})),n.d(e,"mean",(function(){return P})),n.d(e,"median",(function(){return I})),n.d(e,"merge",(function(){return F})),n.d(e,"min",(function(){return j})),n.d(e,"pairs",(function(){return u})),n.d(e,"permute",(function(){return R})),n.d(e,"quantile",(function(){return D})),n.d(e,"range",(function(){return k})),n.d(e,"scan",(function(){return Y})),n.d(e,"shuffle",(function(){return z})),n.d(e,"sum",(function(){return U})),n.d(e,"ticks",(function(){return C})),n.d(e,"tickIncrement",(function(){return A})),n.d(e,"tickStep",(function(){return S})),n.d(e,"transpose",(function(){return $})),n.d(e,"variance",(function(){return p})),n.d(e,"zip",(function(){return H})),n.d(e,"axisTop",(function(){return tt})),n.d(e,"axisRight",(function(){return et})),n.d(e,"axisBottom",(function(){return nt})),n.d(e,"axisLeft",(function(){return rt})),n.d(e,"brush",(function(){return Ti})),n.d(e,"brushX",(function(){return wi})),n.d(e,"brushY",(function(){return Ei})),n.d(e,"brushSelection",(function(){return ki})),n.d(e,"chord",(function(){return Li})),n.d(e,"ribbon",(function(){return qi})),n.d(e,"nest",(function(){return Ki})),n.d(e,"set",(function(){return oa})),n.d(e,"map",(function(){return Ji})),n.d(e,"keys",(function(){return sa})),n.d(e,"values",(function(){return ca})),n.d(e,"entries",(function(){return ua})),n.d(e,"color",(function(){return $e})),n.d(e,"rgb",(function(){return Ge})),n.d(e,"hsl",(function(){return tn})),n.d(e,"lab",(function(){return pa})),n.d(e,"hcl",(function(){return ka})),n.d(e,"lch",(function(){return _a})),n.d(e,"gray",(function(){return da})),n.d(e,"cubehelix",(function(){return Oa})),n.d(e,"contours",(function(){return Ya})),n.d(e,"contourDensity",(function(){return Va})),n.d(e,"dispatch",(function(){return lt})),n.d(e,"drag",(function(){return Qa})),n.d(e,"dragDisable",(function(){return Te})),n.d(e,"dragEnable",(function(){return Ce})),n.d(e,"dsvFormat",(function(){return oo})),n.d(e,"csvParse",(function(){return co})),n.d(e,"csvParseRows",(function(){return uo})),n.d(e,"csvFormat",(function(){return lo})),n.d(e,"csvFormatBody",(function(){return ho})),n.d(e,"csvFormatRows",(function(){return fo})),n.d(e,"csvFormatRow",(function(){return po})),n.d(e,"csvFormatValue",(function(){return go})),n.d(e,"tsvParse",(function(){return vo})),n.d(e,"tsvParseRows",(function(){return mo})),n.d(e,"tsvFormat",(function(){return bo})),n.d(e,"tsvFormatBody",(function(){return xo})),n.d(e,"tsvFormatRows",(function(){return _o})),n.d(e,"tsvFormatRow",(function(){return ko})),n.d(e,"tsvFormatValue",(function(){return wo})),n.d(e,"autoType",(function(){return Eo})),n.d(e,"easeLinear",(function(){return Co})),n.d(e,"easeQuad",(function(){return Mo})),n.d(e,"easeQuadIn",(function(){return Ao})),n.d(e,"easeQuadOut",(function(){return So})),n.d(e,"easeQuadInOut",(function(){return Mo})),n.d(e,"easeCubic",(function(){return Vr})),n.d(e,"easeCubicIn",(function(){return Wr})),n.d(e,"easeCubicOut",(function(){return Hr})),n.d(e,"easeCubicInOut",(function(){return Vr})),n.d(e,"easePoly",(function(){return No})),n.d(e,"easePolyIn",(function(){return Oo})),n.d(e,"easePolyOut",(function(){return Do})),n.d(e,"easePolyInOut",(function(){return No})),n.d(e,"easeSin",(function(){return Fo})),n.d(e,"easeSinIn",(function(){return Po})),n.d(e,"easeSinOut",(function(){return Io})),n.d(e,"easeSinInOut",(function(){return Fo})),n.d(e,"easeExp",(function(){return Yo})),n.d(e,"easeExpIn",(function(){return jo})),n.d(e,"easeExpOut",(function(){return Ro})),n.d(e,"easeExpInOut",(function(){return Yo})),n.d(e,"easeCircle",(function(){return $o})),n.d(e,"easeCircleIn",(function(){return zo})),n.d(e,"easeCircleOut",(function(){return Uo})),n.d(e,"easeCircleInOut",(function(){return $o})),n.d(e,"easeBounce",(function(){return Ho})),n.d(e,"easeBounceIn",(function(){return Wo})),n.d(e,"easeBounceOut",(function(){return Ho})),n.d(e,"easeBounceInOut",(function(){return Vo})),n.d(e,"easeBack",(function(){return Xo})),n.d(e,"easeBackIn",(function(){return Go})),n.d(e,"easeBackOut",(function(){return qo})),n.d(e,"easeBackInOut",(function(){return Xo})),n.d(e,"easeElastic",(function(){return Ko})),n.d(e,"easeElasticIn",(function(){return Jo})),n.d(e,"easeElasticOut",(function(){return Ko})),n.d(e,"easeElasticInOut",(function(){return Qo})),n.d(e,"blob",(function(){return es})),n.d(e,"buffer",(function(){return rs})),n.d(e,"dsv",(function(){return ss})),n.d(e,"csv",(function(){return cs})),n.d(e,"tsv",(function(){return us})),n.d(e,"image",(function(){return ls})),n.d(e,"json",(function(){return fs})),n.d(e,"text",(function(){return as})),n.d(e,"xml",(function(){return ps})),n.d(e,"html",(function(){return gs})),n.d(e,"svg",(function(){return ys})),n.d(e,"forceCenter",(function(){return vs})),n.d(e,"forceCollide",(function(){return Os})),n.d(e,"forceLink",(function(){return Bs})),n.d(e,"forceManyBody",(function(){return js})),n.d(e,"forceRadial",(function(){return Rs})),n.d(e,"forceSimulation",(function(){return Fs})),n.d(e,"forceX",(function(){return Ys})),n.d(e,"forceY",(function(){return zs})),n.d(e,"formatDefaultLocale",(function(){return rc})),n.d(e,"format",(function(){return Xs})),n.d(e,"formatPrefix",(function(){return Zs})),n.d(e,"formatLocale",(function(){return nc})),n.d(e,"formatSpecifier",(function(){return Hs})),n.d(e,"FormatSpecifier",(function(){return Vs})),n.d(e,"precisionFixed",(function(){return ic})),n.d(e,"precisionPrefix",(function(){return ac})),n.d(e,"precisionRound",(function(){return oc})),n.d(e,"geoArea",(function(){return Jc})),n.d(e,"geoBounds",(function(){return $u})),n.d(e,"geoCentroid",(function(){return el})),n.d(e,"geoCircle",(function(){return fl})),n.d(e,"geoClipAntimeridian",(function(){return El})),n.d(e,"geoClipCircle",(function(){return Tl})),n.d(e,"geoClipExtent",(function(){return Ol})),n.d(e,"geoClipRectangle",(function(){return Cl})),n.d(e,"geoContains",(function(){return ql})),n.d(e,"geoDistance",(function(){return Rl})),n.d(e,"geoGraticule",(function(){return Jl})),n.d(e,"geoGraticule10",(function(){return Kl})),n.d(e,"geoInterpolate",(function(){return rh})),n.d(e,"geoLength",(function(){return Il})),n.d(e,"geoPath",(function(){return ef})),n.d(e,"geoAlbers",(function(){return _f})),n.d(e,"geoAlbersUsa",(function(){return kf})),n.d(e,"geoAzimuthalEqualArea",(function(){return Cf})),n.d(e,"geoAzimuthalEqualAreaRaw",(function(){return Tf})),n.d(e,"geoAzimuthalEquidistant",(function(){return Sf})),n.d(e,"geoAzimuthalEquidistantRaw",(function(){return Af})),n.d(e,"geoConicConformal",(function(){return Lf})),n.d(e,"geoConicConformalRaw",(function(){return Bf})),n.d(e,"geoConicEqualArea",(function(){return xf})),n.d(e,"geoConicEqualAreaRaw",(function(){return bf})),n.d(e,"geoConicEquidistant",(function(){return jf})),n.d(e,"geoConicEquidistantRaw",(function(){return Ff})),n.d(e,"geoEqualEarth",(function(){return Hf})),n.d(e,"geoEqualEarthRaw",(function(){return Wf})),n.d(e,"geoEquirectangular",(function(){return If})),n.d(e,"geoEquirectangularRaw",(function(){return Pf})),n.d(e,"geoGnomonic",(function(){return Gf})),n.d(e,"geoGnomonicRaw",(function(){return Vf})),n.d(e,"geoIdentity",(function(){return Xf})),n.d(e,"geoProjection",(function(){return yf})),n.d(e,"geoProjectionMutator",(function(){return vf})),n.d(e,"geoMercator",(function(){return Of})),n.d(e,"geoMercatorRaw",(function(){return Mf})),n.d(e,"geoNaturalEarth1",(function(){return Jf})),n.d(e,"geoNaturalEarth1Raw",(function(){return Zf})),n.d(e,"geoOrthographic",(function(){return Qf})),n.d(e,"geoOrthographicRaw",(function(){return Kf})),n.d(e,"geoStereographic",(function(){return ed})),n.d(e,"geoStereographicRaw",(function(){return td})),n.d(e,"geoTransverseMercator",(function(){return rd})),n.d(e,"geoTransverseMercatorRaw",(function(){return nd})),n.d(e,"geoRotation",(function(){return ul})),n.d(e,"geoStream",(function(){return $c})),n.d(e,"geoTransform",(function(){return nf})),n.d(e,"cluster",(function(){return sd})),n.d(e,"hierarchy",(function(){return ud})),n.d(e,"pack",(function(){return Ld})),n.d(e,"packSiblings",(function(){return Sd})),n.d(e,"packEnclose",(function(){return gd})),n.d(e,"partition",(function(){return Yd})),n.d(e,"stratify",(function(){return Hd})),n.d(e,"tree",(function(){return Kd})),n.d(e,"treemap",(function(){return rp})),n.d(e,"treemapBinary",(function(){return ip})),n.d(e,"treemapDice",(function(){return Rd})),n.d(e,"treemapSlice",(function(){return Qd})),n.d(e,"treemapSliceDice",(function(){return ap})),n.d(e,"treemapSquarify",(function(){return np})),n.d(e,"treemapResquarify",(function(){return op})),n.d(e,"interpolate",(function(){return Sn})),n.d(e,"interpolateArray",(function(){return mn})),n.d(e,"interpolateBasis",(function(){return an})),n.d(e,"interpolateBasisClosed",(function(){return on})),n.d(e,"interpolateDate",(function(){return xn})),n.d(e,"interpolateDiscrete",(function(){return sp})),n.d(e,"interpolateHue",(function(){return cp})),n.d(e,"interpolateNumber",(function(){return _n})),n.d(e,"interpolateNumberArray",(function(){return yn})),n.d(e,"interpolateObject",(function(){return kn})),n.d(e,"interpolateRound",(function(){return up})),n.d(e,"interpolateString",(function(){return An})),n.d(e,"interpolateTransformCss",(function(){return hr})),n.d(e,"interpolateTransformSvg",(function(){return fr})),n.d(e,"interpolateZoom",(function(){return fp})),n.d(e,"interpolateRgb",(function(){return fn})),n.d(e,"interpolateRgbBasis",(function(){return pn})),n.d(e,"interpolateRgbBasisClosed",(function(){return gn})),n.d(e,"interpolateHsl",(function(){return pp})),n.d(e,"interpolateHslLong",(function(){return gp})),n.d(e,"interpolateLab",(function(){return yp})),n.d(e,"interpolateHcl",(function(){return mp})),n.d(e,"interpolateHclLong",(function(){return bp})),n.d(e,"interpolateCubehelix",(function(){return _p})),n.d(e,"interpolateCubehelixLong",(function(){return kp})),n.d(e,"piecewise",(function(){return wp})),n.d(e,"quantize",(function(){return Ep})),n.d(e,"path",(function(){return Ui})),n.d(e,"polygonArea",(function(){return Tp})),n.d(e,"polygonCentroid",(function(){return Cp})),n.d(e,"polygonHull",(function(){return Mp})),n.d(e,"polygonContains",(function(){return Op})),n.d(e,"polygonLength",(function(){return Dp})),n.d(e,"quadtree",(function(){return Es})),n.d(e,"randomUniform",(function(){return Bp})),n.d(e,"randomNormal",(function(){return Lp})),n.d(e,"randomLogNormal",(function(){return Pp})),n.d(e,"randomBates",(function(){return Fp})),n.d(e,"randomIrwinHall",(function(){return Ip})),n.d(e,"randomExponential",(function(){return jp})),n.d(e,"scaleBand",(function(){return Vp})),n.d(e,"scalePoint",(function(){return qp})),n.d(e,"scaleIdentity",(function(){return cg})),n.d(e,"scaleLinear",(function(){return sg})),n.d(e,"scaleLog",(function(){return vg})),n.d(e,"scaleSymlog",(function(){return _g})),n.d(e,"scaleOrdinal",(function(){return Hp})),n.d(e,"scaleImplicit",(function(){return Wp})),n.d(e,"scalePow",(function(){return Cg})),n.d(e,"scaleSqrt",(function(){return Ag})),n.d(e,"scaleQuantile",(function(){return Sg})),n.d(e,"scaleQuantize",(function(){return Mg})),n.d(e,"scaleThreshold",(function(){return Og})),n.d(e,"scaleTime",(function(){return sm})),n.d(e,"scaleUtc",(function(){return vm})),n.d(e,"scaleSequential",(function(){return xm})),n.d(e,"scaleSequentialLog",(function(){return _m})),n.d(e,"scaleSequentialPow",(function(){return wm})),n.d(e,"scaleSequentialSqrt",(function(){return Em})),n.d(e,"scaleSequentialSymlog",(function(){return km})),n.d(e,"scaleSequentialQuantile",(function(){return Tm})),n.d(e,"scaleDiverging",(function(){return Am})),n.d(e,"scaleDivergingLog",(function(){return Sm})),n.d(e,"scaleDivergingPow",(function(){return Om})),n.d(e,"scaleDivergingSqrt",(function(){return Dm})),n.d(e,"scaleDivergingSymlog",(function(){return Mm})),n.d(e,"tickFormat",(function(){return ag})),n.d(e,"schemeCategory10",(function(){return Bm})),n.d(e,"schemeAccent",(function(){return Lm})),n.d(e,"schemeDark2",(function(){return Pm})),n.d(e,"schemePaired",(function(){return Im})),n.d(e,"schemePastel1",(function(){return Fm})),n.d(e,"schemePastel2",(function(){return jm})),n.d(e,"schemeSet1",(function(){return Rm})),n.d(e,"schemeSet2",(function(){return Ym})),n.d(e,"schemeSet3",(function(){return zm})),n.d(e,"schemeTableau10",(function(){return Um})),n.d(e,"interpolateBrBG",(function(){return Hm})),n.d(e,"schemeBrBG",(function(){return Wm})),n.d(e,"interpolatePRGn",(function(){return Gm})),n.d(e,"schemePRGn",(function(){return Vm})),n.d(e,"interpolatePiYG",(function(){return Xm})),n.d(e,"schemePiYG",(function(){return qm})),n.d(e,"interpolatePuOr",(function(){return Jm})),n.d(e,"schemePuOr",(function(){return Zm})),n.d(e,"interpolateRdBu",(function(){return Qm})),n.d(e,"schemeRdBu",(function(){return Km})),n.d(e,"interpolateRdGy",(function(){return eb})),n.d(e,"schemeRdGy",(function(){return tb})),n.d(e,"interpolateRdYlBu",(function(){return rb})),n.d(e,"schemeRdYlBu",(function(){return nb})),n.d(e,"interpolateRdYlGn",(function(){return ab})),n.d(e,"schemeRdYlGn",(function(){return ib})),n.d(e,"interpolateSpectral",(function(){return sb})),n.d(e,"schemeSpectral",(function(){return ob})),n.d(e,"interpolateBuGn",(function(){return ub})),n.d(e,"schemeBuGn",(function(){return cb})),n.d(e,"interpolateBuPu",(function(){return hb})),n.d(e,"schemeBuPu",(function(){return lb})),n.d(e,"interpolateGnBu",(function(){return db})),n.d(e,"schemeGnBu",(function(){return fb})),n.d(e,"interpolateOrRd",(function(){return gb})),n.d(e,"schemeOrRd",(function(){return pb})),n.d(e,"interpolatePuBuGn",(function(){return vb})),n.d(e,"schemePuBuGn",(function(){return yb})),n.d(e,"interpolatePuBu",(function(){return bb})),n.d(e,"schemePuBu",(function(){return mb})),n.d(e,"interpolatePuRd",(function(){return _b})),n.d(e,"schemePuRd",(function(){return xb})),n.d(e,"interpolateRdPu",(function(){return wb})),n.d(e,"schemeRdPu",(function(){return kb})),n.d(e,"interpolateYlGnBu",(function(){return Tb})),n.d(e,"schemeYlGnBu",(function(){return Eb})),n.d(e,"interpolateYlGn",(function(){return Ab})),n.d(e,"schemeYlGn",(function(){return Cb})),n.d(e,"interpolateYlOrBr",(function(){return Mb})),n.d(e,"schemeYlOrBr",(function(){return Sb})),n.d(e,"interpolateYlOrRd",(function(){return Db})),n.d(e,"schemeYlOrRd",(function(){return Ob})),n.d(e,"interpolateBlues",(function(){return Bb})),n.d(e,"schemeBlues",(function(){return Nb})),n.d(e,"interpolateGreens",(function(){return Pb})),n.d(e,"schemeGreens",(function(){return Lb})),n.d(e,"interpolateGreys",(function(){return Fb})),n.d(e,"schemeGreys",(function(){return Ib})),n.d(e,"interpolatePurples",(function(){return Rb})),n.d(e,"schemePurples",(function(){return jb})),n.d(e,"interpolateReds",(function(){return zb})),n.d(e,"schemeReds",(function(){return Yb})),n.d(e,"interpolateOranges",(function(){return $b})),n.d(e,"schemeOranges",(function(){return Ub})),n.d(e,"interpolateCividis",(function(){return Wb})),n.d(e,"interpolateCubehelixDefault",(function(){return Hb})),n.d(e,"interpolateRainbow",(function(){return Xb})),n.d(e,"interpolateWarm",(function(){return Vb})),n.d(e,"interpolateCool",(function(){return Gb})),n.d(e,"interpolateSinebow",(function(){return Qb})),n.d(e,"interpolateTurbo",(function(){return tx})),n.d(e,"interpolateViridis",(function(){return nx})),n.d(e,"interpolateMagma",(function(){return rx})),n.d(e,"interpolateInferno",(function(){return ix})),n.d(e,"interpolatePlasma",(function(){return ax})),n.d(e,"create",(function(){return ox})),n.d(e,"creator",(function(){return ne})),n.d(e,"local",(function(){return cx})),n.d(e,"matcher",(function(){return gt})),n.d(e,"mouse",(function(){return Nn})),n.d(e,"namespace",(function(){return wt})),n.d(e,"namespaces",(function(){return kt})),n.d(e,"clientPoint",(function(){return On})),n.d(e,"select",(function(){return ke})),n.d(e,"selectAll",(function(){return lx})),n.d(e,"selection",(function(){return _e})),n.d(e,"selector",(function(){return ft})),n.d(e,"selectorAll",(function(){return pt})),n.d(e,"style",(function(){return Lt})),n.d(e,"touch",(function(){return Dn})),n.d(e,"touches",(function(){return hx})),n.d(e,"window",(function(){return Ot})),n.d(e,"event",(function(){return ce})),n.d(e,"customEvent",(function(){return pe})),n.d(e,"arc",(function(){return Nx})),n.d(e,"area",(function(){return jx})),n.d(e,"line",(function(){return Fx})),n.d(e,"pie",(function(){return zx})),n.d(e,"areaRadial",(function(){return Gx})),n.d(e,"radialArea",(function(){return Gx})),n.d(e,"lineRadial",(function(){return Vx})),n.d(e,"radialLine",(function(){return Vx})),n.d(e,"pointRadial",(function(){return qx})),n.d(e,"linkHorizontal",(function(){return n_})),n.d(e,"linkVertical",(function(){return r_})),n.d(e,"linkRadial",(function(){return i_})),n.d(e,"symbol",(function(){return k_})),n.d(e,"symbols",(function(){return __})),n.d(e,"symbolCircle",(function(){return a_})),n.d(e,"symbolCross",(function(){return o_})),n.d(e,"symbolDiamond",(function(){return u_})),n.d(e,"symbolSquare",(function(){return p_})),n.d(e,"symbolStar",(function(){return d_})),n.d(e,"symbolTriangle",(function(){return y_})),n.d(e,"symbolWye",(function(){return x_})),n.d(e,"curveBasisClosed",(function(){return S_})),n.d(e,"curveBasisOpen",(function(){return O_})),n.d(e,"curveBasis",(function(){return C_})),n.d(e,"curveBundle",(function(){return N_})),n.d(e,"curveCardinalClosed",(function(){return F_})),n.d(e,"curveCardinalOpen",(function(){return R_})),n.d(e,"curveCardinal",(function(){return P_})),n.d(e,"curveCatmullRomClosed",(function(){return W_})),n.d(e,"curveCatmullRomOpen",(function(){return V_})),n.d(e,"curveCatmullRom",(function(){return U_})),n.d(e,"curveLinearClosed",(function(){return q_})),n.d(e,"curveLinear",(function(){return Lx})),n.d(e,"curveMonotoneX",(function(){return nk})),n.d(e,"curveMonotoneY",(function(){return rk})),n.d(e,"curveNatural",(function(){return ok})),n.d(e,"curveStep",(function(){return ck})),n.d(e,"curveStepAfter",(function(){return lk})),n.d(e,"curveStepBefore",(function(){return uk})),n.d(e,"stack",(function(){return pk})),n.d(e,"stackOffsetExpand",(function(){return gk})),n.d(e,"stackOffsetDiverging",(function(){return yk})),n.d(e,"stackOffsetNone",(function(){return hk})),n.d(e,"stackOffsetSilhouette",(function(){return vk})),n.d(e,"stackOffsetWiggle",(function(){return mk})),n.d(e,"stackOrderAppearance",(function(){return bk})),n.d(e,"stackOrderAscending",(function(){return _k})),n.d(e,"stackOrderDescending",(function(){return wk})),n.d(e,"stackOrderInsideOut",(function(){return Ek})),n.d(e,"stackOrderNone",(function(){return fk})),n.d(e,"stackOrderReverse",(function(){return Tk})),n.d(e,"timeInterval",(function(){return Bg})),n.d(e,"timeMillisecond",(function(){return py})),n.d(e,"timeMilliseconds",(function(){return gy})),n.d(e,"utcMillisecond",(function(){return py})),n.d(e,"utcMilliseconds",(function(){return gy})),n.d(e,"timeSecond",(function(){return hy})),n.d(e,"timeSeconds",(function(){return fy})),n.d(e,"utcSecond",(function(){return hy})),n.d(e,"utcSeconds",(function(){return fy})),n.d(e,"timeMinute",(function(){return cy})),n.d(e,"timeMinutes",(function(){return uy})),n.d(e,"timeHour",(function(){return ay})),n.d(e,"timeHours",(function(){return oy})),n.d(e,"timeDay",(function(){return ny})),n.d(e,"timeDays",(function(){return ry})),n.d(e,"timeWeek",(function(){return zg})),n.d(e,"timeWeeks",(function(){return qg})),n.d(e,"timeSunday",(function(){return zg})),n.d(e,"timeSundays",(function(){return qg})),n.d(e,"timeMonday",(function(){return Ug})),n.d(e,"timeMondays",(function(){return Xg})),n.d(e,"timeTuesday",(function(){return $g})),n.d(e,"timeTuesdays",(function(){return Zg})),n.d(e,"timeWednesday",(function(){return Wg})),n.d(e,"timeWednesdays",(function(){return Jg})),n.d(e,"timeThursday",(function(){return Hg})),n.d(e,"timeThursdays",(function(){return Kg})),n.d(e,"timeFriday",(function(){return Vg})),n.d(e,"timeFridays",(function(){return Qg})),n.d(e,"timeSaturday",(function(){return Gg})),n.d(e,"timeSaturdays",(function(){return ty})),n.d(e,"timeMonth",(function(){return jg})),n.d(e,"timeMonths",(function(){return Rg})),n.d(e,"timeYear",(function(){return Pg})),n.d(e,"timeYears",(function(){return Ig})),n.d(e,"utcMinute",(function(){return gm})),n.d(e,"utcMinutes",(function(){return ym})),n.d(e,"utcHour",(function(){return fm})),n.d(e,"utcHours",(function(){return dm})),n.d(e,"utcDay",(function(){return Ny})),n.d(e,"utcDays",(function(){return By})),n.d(e,"utcWeek",(function(){return vy})),n.d(e,"utcWeeks",(function(){return Ey})),n.d(e,"utcSunday",(function(){return vy})),n.d(e,"utcSundays",(function(){return Ey})),n.d(e,"utcMonday",(function(){return my})),n.d(e,"utcMondays",(function(){return Ty})),n.d(e,"utcTuesday",(function(){return by})),n.d(e,"utcTuesdays",(function(){return Cy})),n.d(e,"utcWednesday",(function(){return xy})),n.d(e,"utcWednesdays",(function(){return Ay})),n.d(e,"utcThursday",(function(){return _y})),n.d(e,"utcThursdays",(function(){return Sy})),n.d(e,"utcFriday",(function(){return ky})),n.d(e,"utcFridays",(function(){return My})),n.d(e,"utcSaturday",(function(){return wy})),n.d(e,"utcSaturdays",(function(){return Oy})),n.d(e,"utcMonth",(function(){return um})),n.d(e,"utcMonths",(function(){return lm})),n.d(e,"utcYear",(function(){return Py})),n.d(e,"utcYears",(function(){return Iy})),n.d(e,"timeFormatDefaultLocale",(function(){return rm})),n.d(e,"timeFormat",(function(){return Uy})),n.d(e,"timeParse",(function(){return $y})),n.d(e,"utcFormat",(function(){return Wy})),n.d(e,"utcParse",(function(){return Hy})),n.d(e,"timeFormatLocale",(function(){return Yy})),n.d(e,"isoFormat",(function(){return Ck})),n.d(e,"isoParse",(function(){return Ak})),n.d(e,"now",(function(){return zn})),n.d(e,"timer",(function(){return Wn})),n.d(e,"timerFlush",(function(){return Hn})),n.d(e,"timeout",(function(){return Xn})),n.d(e,"interval",(function(){return Sk})),n.d(e,"transition",(function(){return zr})),n.d(e,"active",(function(){return Zr})),n.d(e,"interrupt",(function(){return or})),n.d(e,"voronoi",(function(){return dw})),n.d(e,"zoom",(function(){return Aw})),n.d(e,"zoomTransform",(function(){return mw})),n.d(e,"zoomIdentity",(function(){return vw}))},function(t,e,n){"use strict";Object.defineProperty(e,"__esModule",{value:!0}),function(t){for(var n in t)e.hasOwnProperty(n)||(e[n]=t[n])}(n(172))},function(t,e,n){(function(t,r){var i=function(){var t=function(t,e,n,r){for(n=n||{},r=t.length;r--;n[t[r]]=e);return n},e=[1,2],n=[1,3],r=[1,5],i=[1,7],a=[2,5],o=[1,15],s=[1,17],c=[1,18],u=[1,20],l=[1,21],h=[1,22],f=[1,24],d=[1,25],p=[1,26],g=[1,27],y=[1,28],v=[1,29],m=[1,32],b=[1,33],x=[1,36],_=[1,4,5,16,21,22,23,25,27,28,29,30,31,33,35,36,37,48,58],k=[1,44],w=[4,5,16,21,22,23,25,27,28,29,30,31,33,37,48,58],E=[4,5,16,21,22,23,25,27,28,29,30,31,33,36,37,48,58],T=[4,5,16,21,22,23,25,27,28,29,30,31,33,35,37,48,58],C=[46,47,48],A=[1,4,5,7,16,21,22,23,25,27,28,29,30,31,33,35,36,37,48,58],S={trace:function(){},yy:{},symbols_:{error:2,start:3,SPACE:4,NEWLINE:5,directive:6,SD:7,document:8,line:9,statement:10,openDirective:11,typeDirective:12,closeDirective:13,":":14,argDirective:15,participant:16,actor:17,AS:18,restOfLine:19,signal:20,autonumber:21,activate:22,deactivate:23,note_statement:24,title:25,text2:26,loop:27,end:28,rect:29,opt:30,alt:31,else_sections:32,par:33,par_sections:34,and:35,else:36,note:37,placement:38,over:39,actor_pair:40,spaceList:41,",":42,left_of:43,right_of:44,signaltype:45,"+":46,"-":47,ACTOR:48,SOLID_OPEN_ARROW:49,DOTTED_OPEN_ARROW:50,SOLID_ARROW:51,DOTTED_ARROW:52,SOLID_CROSS:53,DOTTED_CROSS:54,SOLID_POINT:55,DOTTED_POINT:56,TXT:57,open_directive:58,type_directive:59,arg_directive:60,close_directive:61,$accept:0,$end:1},terminals_:{2:"error",4:"SPACE",5:"NEWLINE",7:"SD",14:":",16:"participant",18:"AS",19:"restOfLine",21:"autonumber",22:"activate",23:"deactivate",25:"title",27:"loop",28:"end",29:"rect",30:"opt",31:"alt",33:"par",35:"and",36:"else",37:"note",39:"over",42:",",43:"left_of",44:"right_of",46:"+",47:"-",48:"ACTOR",49:"SOLID_OPEN_ARROW",50:"DOTTED_OPEN_ARROW",51:"SOLID_ARROW",52:"DOTTED_ARROW",53:"SOLID_CROSS",54:"DOTTED_CROSS",55:"SOLID_POINT",56:"DOTTED_POINT",57:"TXT",58:"open_directive",59:"type_directive",60:"arg_directive",61:"close_directive"},productions_:[0,[3,2],[3,2],[3,2],[3,2],[8,0],[8,2],[9,2],[9,1],[9,1],[6,4],[6,6],[10,5],[10,3],[10,2],[10,1],[10,3],[10,3],[10,2],[10,3],[10,4],[10,4],[10,4],[10,4],[10,4],[10,1],[34,1],[34,4],[32,1],[32,4],[24,4],[24,4],[41,2],[41,1],[40,3],[40,1],[38,1],[38,1],[20,5],[20,5],[20,4],[17,1],[45,1],[45,1],[45,1],[45,1],[45,1],[45,1],[45,1],[45,1],[26,1],[11,1],[12,1],[15,1],[13,1]],performAction:function(t,e,n,r,i,a,o){var s=a.length-1;switch(i){case 4:return r.apply(a[s]),a[s];case 5:this.$=[];break;case 6:a[s-1].push(a[s]),this.$=a[s-1];break;case 7:case 8:this.$=a[s];break;case 9:this.$=[];break;case 12:a[s-3].description=r.parseMessage(a[s-1]),this.$=a[s-3];break;case 13:this.$=a[s-1];break;case 15:r.enableSequenceNumbers();break;case 16:this.$={type:"activeStart",signalType:r.LINETYPE.ACTIVE_START,actor:a[s-1]};break;case 17:this.$={type:"activeEnd",signalType:r.LINETYPE.ACTIVE_END,actor:a[s-1]};break;case 19:this.$=[{type:"setTitle",text:a[s-1]}];break;case 20:a[s-1].unshift({type:"loopStart",loopText:r.parseMessage(a[s-2]),signalType:r.LINETYPE.LOOP_START}),a[s-1].push({type:"loopEnd",loopText:a[s-2],signalType:r.LINETYPE.LOOP_END}),this.$=a[s-1];break;case 21:a[s-1].unshift({type:"rectStart",color:r.parseMessage(a[s-2]),signalType:r.LINETYPE.RECT_START}),a[s-1].push({type:"rectEnd",color:r.parseMessage(a[s-2]),signalType:r.LINETYPE.RECT_END}),this.$=a[s-1];break;case 22:a[s-1].unshift({type:"optStart",optText:r.parseMessage(a[s-2]),signalType:r.LINETYPE.OPT_START}),a[s-1].push({type:"optEnd",optText:r.parseMessage(a[s-2]),signalType:r.LINETYPE.OPT_END}),this.$=a[s-1];break;case 23:a[s-1].unshift({type:"altStart",altText:r.parseMessage(a[s-2]),signalType:r.LINETYPE.ALT_START}),a[s-1].push({type:"altEnd",signalType:r.LINETYPE.ALT_END}),this.$=a[s-1];break;case 24:a[s-1].unshift({type:"parStart",parText:r.parseMessage(a[s-2]),signalType:r.LINETYPE.PAR_START}),a[s-1].push({type:"parEnd",signalType:r.LINETYPE.PAR_END}),this.$=a[s-1];break;case 27:this.$=a[s-3].concat([{type:"and",parText:r.parseMessage(a[s-1]),signalType:r.LINETYPE.PAR_AND},a[s]]);break;case 29:this.$=a[s-3].concat([{type:"else",altText:r.parseMessage(a[s-1]),signalType:r.LINETYPE.ALT_ELSE},a[s]]);break;case 30:this.$=[a[s-1],{type:"addNote",placement:a[s-2],actor:a[s-1].actor,text:a[s]}];break;case 31:a[s-2]=[].concat(a[s-1],a[s-1]).slice(0,2),a[s-2][0]=a[s-2][0].actor,a[s-2][1]=a[s-2][1].actor,this.$=[a[s-1],{type:"addNote",placement:r.PLACEMENT.OVER,actor:a[s-2].slice(0,2),text:a[s]}];break;case 34:this.$=[a[s-2],a[s]];break;case 35:this.$=a[s];break;case 36:this.$=r.PLACEMENT.LEFTOF;break;case 37:this.$=r.PLACEMENT.RIGHTOF;break;case 38:this.$=[a[s-4],a[s-1],{type:"addMessage",from:a[s-4].actor,to:a[s-1].actor,signalType:a[s-3],msg:a[s]},{type:"activeStart",signalType:r.LINETYPE.ACTIVE_START,actor:a[s-1]}];break;case 39:this.$=[a[s-4],a[s-1],{type:"addMessage",from:a[s-4].actor,to:a[s-1].actor,signalType:a[s-3],msg:a[s]},{type:"activeEnd",signalType:r.LINETYPE.ACTIVE_END,actor:a[s-4]}];break;case 40:this.$=[a[s-3],a[s-1],{type:"addMessage",from:a[s-3].actor,to:a[s-1].actor,signalType:a[s-2],msg:a[s]}];break;case 41:this.$={type:"addActor",actor:a[s]};break;case 42:this.$=r.LINETYPE.SOLID_OPEN;break;case 43:this.$=r.LINETYPE.DOTTED_OPEN;break;case 44:this.$=r.LINETYPE.SOLID;break;case 45:this.$=r.LINETYPE.DOTTED;break;case 46:this.$=r.LINETYPE.SOLID_CROSS;break;case 47:this.$=r.LINETYPE.DOTTED_CROSS;break;case 48:this.$=r.LINETYPE.SOLID_POINT;break;case 49:this.$=r.LINETYPE.DOTTED_POINT;break;case 50:this.$=r.parseMessage(a[s].trim().substring(1));break;case 51:r.parseDirective("%%{","open_directive");break;case 52:r.parseDirective(a[s],"type_directive");break;case 53:a[s]=a[s].trim().replace(/'/g,'"'),r.parseDirective(a[s],"arg_directive");break;case 54:r.parseDirective("}%%","close_directive","sequence")}},table:[{3:1,4:e,5:n,6:4,7:r,11:6,58:i},{1:[3]},{3:8,4:e,5:n,6:4,7:r,11:6,58:i},{3:9,4:e,5:n,6:4,7:r,11:6,58:i},{3:10,4:e,5:n,6:4,7:r,11:6,58:i},t([1,4,5,16,21,22,23,25,27,29,30,31,33,37,48,58],a,{8:11}),{12:12,59:[1,13]},{59:[2,51]},{1:[2,1]},{1:[2,2]},{1:[2,3]},{1:[2,4],4:o,5:s,6:30,9:14,10:16,11:6,16:c,17:31,20:19,21:u,22:l,23:h,24:23,25:f,27:d,29:p,30:g,31:y,33:v,37:m,48:b,58:i},{13:34,14:[1,35],61:x},t([14,61],[2,52]),t(_,[2,6]),{6:30,10:37,11:6,16:c,17:31,20:19,21:u,22:l,23:h,24:23,25:f,27:d,29:p,30:g,31:y,33:v,37:m,48:b,58:i},t(_,[2,8]),t(_,[2,9]),{17:38,48:b},{5:[1,39]},t(_,[2,15]),{17:40,48:b},{17:41,48:b},{5:[1,42]},{26:43,57:k},{19:[1,45]},{19:[1,46]},{19:[1,47]},{19:[1,48]},{19:[1,49]},t(_,[2,25]),{45:50,49:[1,51],50:[1,52],51:[1,53],52:[1,54],53:[1,55],54:[1,56],55:[1,57],56:[1,58]},{38:59,39:[1,60],43:[1,61],44:[1,62]},t([5,18,42,49,50,51,52,53,54,55,56,57],[2,41]),{5:[1,63]},{15:64,60:[1,65]},{5:[2,54]},t(_,[2,7]),{5:[1,67],18:[1,66]},t(_,[2,14]),{5:[1,68]},{5:[1,69]},t(_,[2,18]),{5:[1,70]},{5:[2,50]},t(w,a,{8:71}),t(w,a,{8:72}),t(w,a,{8:73}),t(E,a,{32:74,8:75}),t(T,a,{34:76,8:77}),{17:80,46:[1,78],47:[1,79],48:b},t(C,[2,42]),t(C,[2,43]),t(C,[2,44]),t(C,[2,45]),t(C,[2,46]),t(C,[2,47]),t(C,[2,48]),t(C,[2,49]),{17:81,48:b},{17:83,40:82,48:b},{48:[2,36]},{48:[2,37]},t(A,[2,10]),{13:84,61:x},{61:[2,53]},{19:[1,85]},t(_,[2,13]),t(_,[2,16]),t(_,[2,17]),t(_,[2,19]),{4:o,5:s,6:30,9:14,10:16,11:6,16:c,17:31,20:19,21:u,22:l,23:h,24:23,25:f,27:d,28:[1,86],29:p,30:g,31:y,33:v,37:m,48:b,58:i},{4:o,5:s,6:30,9:14,10:16,11:6,16:c,17:31,20:19,21:u,22:l,23:h,24:23,25:f,27:d,28:[1,87],29:p,30:g,31:y,33:v,37:m,48:b,58:i},{4:o,5:s,6:30,9:14,10:16,11:6,16:c,17:31,20:19,21:u,22:l,23:h,24:23,25:f,27:d,28:[1,88],29:p,30:g,31:y,33:v,37:m,48:b,58:i},{28:[1,89]},{4:o,5:s,6:30,9:14,10:16,11:6,16:c,17:31,20:19,21:u,22:l,23:h,24:23,25:f,27:d,28:[2,28],29:p,30:g,31:y,33:v,36:[1,90],37:m,48:b,58:i},{28:[1,91]},{4:o,5:s,6:30,9:14,10:16,11:6,16:c,17:31,20:19,21:u,22:l,23:h,24:23,25:f,27:d,28:[2,26],29:p,30:g,31:y,33:v,35:[1,92],37:m,48:b,58:i},{17:93,48:b},{17:94,48:b},{26:95,57:k},{26:96,57:k},{26:97,57:k},{42:[1,98],57:[2,35]},{5:[1,99]},{5:[1,100]},t(_,[2,20]),t(_,[2,21]),t(_,[2,22]),t(_,[2,23]),{19:[1,101]},t(_,[2,24]),{19:[1,102]},{26:103,57:k},{26:104,57:k},{5:[2,40]},{5:[2,30]},{5:[2,31]},{17:105,48:b},t(A,[2,11]),t(_,[2,12]),t(E,a,{8:75,32:106}),t(T,a,{8:77,34:107}),{5:[2,38]},{5:[2,39]},{57:[2,34]},{28:[2,29]},{28:[2,27]}],defaultActions:{7:[2,51],8:[2,1],9:[2,2],10:[2,3],36:[2,54],44:[2,50],61:[2,36],62:[2,37],65:[2,53],95:[2,40],96:[2,30],97:[2,31],103:[2,38],104:[2,39],105:[2,34],106:[2,29],107:[2,27]},parseError:function(t,e){if(!e.recoverable){var n=new Error(t);throw n.hash=e,n}this.trace(t)},parse:function(t){var e=this,n=[0],r=[],i=[null],a=[],o=this.table,s="",c=0,u=0,l=0,h=2,f=1,d=a.slice.call(arguments,1),p=Object.create(this.lexer),g={yy:{}};for(var y in this.yy)Object.prototype.hasOwnProperty.call(this.yy,y)&&(g.yy[y]=this.yy[y]);p.setInput(t,g.yy),g.yy.lexer=p,g.yy.parser=this,void 0===p.yylloc&&(p.yylloc={});var v=p.yylloc;a.push(v);var m=p.options&&p.options.ranges;function b(){var t;return"number"!=typeof(t=r.pop()||p.lex()||f)&&(t instanceof Array&&(t=(r=t).pop()),t=e.symbols_[t]||t),t}"function"==typeof g.yy.parseError?this.parseError=g.yy.parseError:this.parseError=Object.getPrototypeOf(this).parseError;for(var x,_,k,w,E,T,C,A,S,M={};;){if(k=n[n.length-1],this.defaultActions[k]?w=this.defaultActions[k]:(null==x&&(x=b()),w=o[k]&&o[k][x]),void 0===w||!w.length||!w[0]){var O="";for(T in S=[],o[k])this.terminals_[T]&&T>h&&S.push("'"+this.terminals_[T]+"'");O=p.showPosition?"Parse error on line "+(c+1)+":\n"+p.showPosition()+"\nExpecting "+S.join(", ")+", got '"+(this.terminals_[x]||x)+"'":"Parse error on line "+(c+1)+": Unexpected "+(x==f?"end of input":"'"+(this.terminals_[x]||x)+"'"),this.parseError(O,{text:p.match,token:this.terminals_[x]||x,line:p.yylineno,loc:v,expected:S})}if(w[0]instanceof Array&&w.length>1)throw new Error("Parse Error: multiple actions possible at state: "+k+", token: "+x);switch(w[0]){case 1:n.push(x),i.push(p.yytext),a.push(p.yylloc),n.push(w[1]),x=null,_?(x=_,_=null):(u=p.yyleng,s=p.yytext,c=p.yylineno,v=p.yylloc,l>0&&l--);break;case 2:if(C=this.productions_[w[1]][1],M.$=i[i.length-C],M._$={first_line:a[a.length-(C||1)].first_line,last_line:a[a.length-1].last_line,first_column:a[a.length-(C||1)].first_column,last_column:a[a.length-1].last_column},m&&(M._$.range=[a[a.length-(C||1)].range[0],a[a.length-1].range[1]]),void 0!==(E=this.performAction.apply(M,[s,u,c,g.yy,w[1],i,a].concat(d))))return E;C&&(n=n.slice(0,-1*C*2),i=i.slice(0,-1*C),a=a.slice(0,-1*C)),n.push(this.productions_[w[1]][0]),i.push(M.$),a.push(M._$),A=o[n[n.length-2]][n[n.length-1]],n.push(A);break;case 3:return!0}}return!0}},M={EOF:1,parseError:function(t,e){if(!this.yy.parser)throw new Error(t);this.yy.parser.parseError(t,e)},setInput:function(t,e){return this.yy=e||this.yy||{},this._input=t,this._more=this._backtrack=this.done=!1,this.yylineno=this.yyleng=0,this.yytext=this.matched=this.match="",this.conditionStack=["INITIAL"],this.yylloc={first_line:1,first_column:0,last_line:1,last_column:0},this.options.ranges&&(this.yylloc.range=[0,0]),this.offset=0,this},input:function(){var t=this._input[0];return this.yytext+=t,this.yyleng++,this.offset++,this.match+=t,this.matched+=t,t.match(/(?:\r\n?|\n).*/g)?(this.yylineno++,this.yylloc.last_line++):this.yylloc.last_column++,this.options.ranges&&this.yylloc.range[1]++,this._input=this._input.slice(1),t},unput:function(t){var e=t.length,n=t.split(/(?:\r\n?|\n)/g);this._input=t+this._input,this.yytext=this.yytext.substr(0,this.yytext.length-e),this.offset-=e;var r=this.match.split(/(?:\r\n?|\n)/g);this.match=this.match.substr(0,this.match.length-1),this.matched=this.matched.substr(0,this.matched.length-1),n.length-1&&(this.yylineno-=n.length-1);var i=this.yylloc.range;return this.yylloc={first_line:this.yylloc.first_line,last_line:this.yylineno+1,first_column:this.yylloc.first_column,last_column:n?(n.length===r.length?this.yylloc.first_column:0)+r[r.length-n.length].length-n[0].length:this.yylloc.first_column-e},this.options.ranges&&(this.yylloc.range=[i[0],i[0]+this.yyleng-e]),this.yyleng=this.yytext.length,this},more:function(){return this._more=!0,this},reject:function(){return this.options.backtrack_lexer?(this._backtrack=!0,this):this.parseError("Lexical error on line "+(this.yylineno+1)+". You can only invoke reject() in the lexer when the lexer is of the backtracking persuasion (options.backtrack_lexer = true).\n"+this.showPosition(),{text:"",token:null,line:this.yylineno})},less:function(t){this.unput(this.match.slice(t))},pastInput:function(){var t=this.matched.substr(0,this.matched.length-this.match.length);return(t.length>20?"...":"")+t.substr(-20).replace(/\n/g,"")},upcomingInput:function(){var t=this.match;return t.length<20&&(t+=this._input.substr(0,20-t.length)),(t.substr(0,20)+(t.length>20?"...":"")).replace(/\n/g,"")},showPosition:function(){var t=this.pastInput(),e=new Array(t.length+1).join("-");return t+this.upcomingInput()+"\n"+e+"^"},test_match:function(t,e){var n,r,i;if(this.options.backtrack_lexer&&(i={yylineno:this.yylineno,yylloc:{first_line:this.yylloc.first_line,last_line:this.last_line,first_column:this.yylloc.first_column,last_column:this.yylloc.last_column},yytext:this.yytext,match:this.match,matches:this.matches,matched:this.matched,yyleng:this.yyleng,offset:this.offset,_more:this._more,_input:this._input,yy:this.yy,conditionStack:this.conditionStack.slice(0),done:this.done},this.options.ranges&&(i.yylloc.range=this.yylloc.range.slice(0))),(r=t[0].match(/(?:\r\n?|\n).*/g))&&(this.yylineno+=r.length),this.yylloc={first_line:this.yylloc.last_line,last_line:this.yylineno+1,first_column:this.yylloc.last_column,last_column:r?r[r.length-1].length-r[r.length-1].match(/\r?\n?/)[0].length:this.yylloc.last_column+t[0].length},this.yytext+=t[0],this.match+=t[0],this.matches=t,this.yyleng=this.yytext.length,this.options.ranges&&(this.yylloc.range=[this.offset,this.offset+=this.yyleng]),this._more=!1,this._backtrack=!1,this._input=this._input.slice(t[0].length),this.matched+=t[0],n=this.performAction.call(this,this.yy,this,e,this.conditionStack[this.conditionStack.length-1]),this.done&&this._input&&(this.done=!1),n)return n;if(this._backtrack){for(var a in i)this[a]=i[a];return!1}return!1},next:function(){if(this.done)return this.EOF;var t,e,n,r;this._input||(this.done=!0),this._more||(this.yytext="",this.match="");for(var i=this._currentRules(),a=0;a<i.length;a++)if((n=this._input.match(this.rules[i[a]]))&&(!e||n[0].length>e[0].length)){if(e=n,r=a,this.options.backtrack_lexer){if(!1!==(t=this.test_match(n,i[a])))return t;if(this._backtrack){e=!1;continue}return!1}if(!this.options.flex)break}return e?!1!==(t=this.test_match(e,i[r]))&&t:""===this._input?this.EOF:this.parseError("Lexical error on line "+(this.yylineno+1)+". Unrecognized text.\n"+this.showPosition(),{text:"",token:null,line:this.yylineno})},lex:function(){var t=this.next();return t||this.lex()},begin:function(t){this.conditionStack.push(t)},popState:function(){return this.conditionStack.length-1>0?this.conditionStack.pop():this.conditionStack[0]},_currentRules:function(){return this.conditionStack.length&&this.conditionStack[this.conditionStack.length-1]?this.conditions[this.conditionStack[this.conditionStack.length-1]].rules:this.conditions.INITIAL.rules},topState:function(t){return(t=this.conditionStack.length-1-Math.abs(t||0))>=0?this.conditionStack[t]:"INITIAL"},pushState:function(t){this.begin(t)},stateStackSize:function(){return this.conditionStack.length},options:{"case-insensitive":!0},performAction:function(t,e,n,r){switch(n){case 0:return this.begin("open_directive"),58;case 1:return this.begin("type_directive"),59;case 2:return this.popState(),this.begin("arg_directive"),14;case 3:return this.popState(),this.popState(),61;case 4:return 60;case 5:return 5;case 6:case 7:case 8:case 9:case 10:break;case 11:return this.begin("ID"),16;case 12:return e.yytext=e.yytext.trim(),this.begin("ALIAS"),48;case 13:return this.popState(),this.popState(),this.begin("LINE"),18;case 14:return this.popState(),this.popState(),5;case 15:return this.begin("LINE"),27;case 16:return this.begin("LINE"),29;case 17:return this.begin("LINE"),30;case 18:return this.begin("LINE"),31;case 19:return this.begin("LINE"),36;case 20:return this.begin("LINE"),33;case 21:return this.begin("LINE"),35;case 22:return this.popState(),19;case 23:return 28;case 24:return 43;case 25:return 44;case 26:return 39;case 27:return 37;case 28:return this.begin("ID"),22;case 29:return this.begin("ID"),23;case 30:return 25;case 31:return 7;case 32:return 21;case 33:return 42;case 34:return 5;case 35:return e.yytext=e.yytext.trim(),48;case 36:return 51;case 37:return 52;case 38:return 49;case 39:return 50;case 40:return 53;case 41:return 54;case 42:return 55;case 43:return 56;case 44:return 57;case 45:return 46;case 46:return 47;case 47:return 5;case 48:return"INVALID"}},rules:[/^(?:%%\{)/i,/^(?:((?:(?!\}%%)[^:.])*))/i,/^(?::)/i,/^(?:\}%%)/i,/^(?:((?:(?!\}%%).|\n)*))/i,/^(?:[\n]+)/i,/^(?:\s+)/i,/^(?:((?!\n)\s)+)/i,/^(?:#[^\n]*)/i,/^(?:%(?!\{)[^\n]*)/i,/^(?:[^\}]%%[^\n]*)/i,/^(?:participant\b)/i,/^(?:[^\->:\n,;]+?(?=((?!\n)\s)+as(?!\n)\s|[#\n;]|$))/i,/^(?:as\b)/i,/^(?:(?:))/i,/^(?:loop\b)/i,/^(?:rect\b)/i,/^(?:opt\b)/i,/^(?:alt\b)/i,/^(?:else\b)/i,/^(?:par\b)/i,/^(?:and\b)/i,/^(?:(?:[:]?(?:no)?wrap)?[^#\n;]*)/i,/^(?:end\b)/i,/^(?:left of\b)/i,/^(?:right of\b)/i,/^(?:over\b)/i,/^(?:note\b)/i,/^(?:activate\b)/i,/^(?:deactivate\b)/i,/^(?:title\b)/i,/^(?:sequenceDiagram\b)/i,/^(?:autonumber\b)/i,/^(?:,)/i,/^(?:;)/i,/^(?:[^\+\->:\n,;]+((?!(-x|--x|-\)|--\)))[\-]*[^\+\->:\n,;]+)*)/i,/^(?:->>)/i,/^(?:-->>)/i,/^(?:->)/i,/^(?:-->)/i,/^(?:-[x])/i,/^(?:--[x])/i,/^(?:-[\)])/i,/^(?:--[\)])/i,/^(?::(?:(?:no)?wrap)?[^#\n;]+)/i,/^(?:\+)/i,/^(?:-)/i,/^(?:$)/i,/^(?:.)/i],conditions:{open_directive:{rules:[1,8],inclusive:!1},type_directive:{rules:[2,3,8],inclusive:!1},arg_directive:{rules:[3,4,8],inclusive:!1},ID:{rules:[7,8,12],inclusive:!1},ALIAS:{rules:[7,8,13,14],inclusive:!1},LINE:{rules:[7,8,22],inclusive:!1},INITIAL:{rules:[0,5,6,8,9,10,11,15,16,17,18,19,20,21,23,24,25,26,27,28,29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48],inclusive:!0}}};function O(){this.yy={}}return S.lexer=M,O.prototype=S,S.Parser=O,new O}();e.parser=i,e.Parser=i.Parser,e.parse=function(){return i.parse.apply(i,arguments)},e.main=function(r){r[1]||(console.log("Usage: "+r[0]+" FILE"),t.exit(1));var i=n(19).readFileSync(n(20).normalize(r[1]),"utf8");return e.parser.parse(i)},n.c[n.s]===r&&e.main(t.argv.slice(1))}).call(this,n(14),n(7)(t))},function(t,e,n){var r=n(198);t.exports={Graph:r.Graph,json:n(301),alg:n(302),version:r.version}},function(t,e,n){var r;try{r={cloneDeep:n(313),constant:n(86),defaults:n(154),each:n(87),filter:n(128),find:n(314),flatten:n(156),forEach:n(126),forIn:n(319),has:n(93),isUndefined:n(139),last:n(320),map:n(140),mapValues:n(321),max:n(322),merge:n(324),min:n(329),minBy:n(330),now:n(331),pick:n(161),range:n(162),reduce:n(142),sortBy:n(338),uniqueId:n(163),values:n(147),zipObject:n(343)}}catch(t){}r||(r=window._),t.exports=r},function(t,e){var n=Array.isArray;t.exports=n},function(t,e,n){
/**
* @license
* Copyright (c) 2012-2013 Chris Pettitt
@@ -28,22 +21,12 @@ var r=n(421),i=n(422),a=n(191);function o(){return u.TYPED_ARRAY_SUPPORT?2147483
* OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
* THE SOFTWARE.
*/
-t.exports={graphlib:n(348),dagre:n(175),intersect:n(405),render:n(407),util:n(15),version:n(419)}},function(t,e){var n;n=function(){return this}();try{n=n||new Function("return this")()}catch(t){"object"==typeof window&&(n=window)}t.exports=n},function(t,e,n){var r;try{r={clone:n(237),constant:n(99),each:n(100),filter:n(150),has:n(106),isArray:n(6),isEmpty:n(313),isFunction:n(37),isUndefined:n(161),keys:n(27),map:n(162),reduce:n(164),size:n(316),transform:n(322),union:n(323),values:n(169)}}catch(t){}r||(r=window._),t.exports=r},function(t,e){t.exports=function(t){var e=typeof t;return null!=t&&("object"==e||"function"==e)}},function(t,e,n){var r=n(43);t.exports={isSubgraph:function(t,e){return!!t.children(e).length},edgeToId:function(t){return a(t.v)+":"+a(t.w)+":"+a(t.name)},applyStyle:function(t,e){e&&t.attr("style",e)},applyClass:function(t,e,n){e&&t.attr("class",e).attr("class",n+" "+t.attr("class"))},applyTransition:function(t,e){var n=e.graph();if(r.isPlainObject(n)){var i=n.transition;if(r.isFunction(i))return i(t)}return t}};var i=/:/g;function a(t){return t?String(t).replace(i,"\\:"):""}},function(t,e){function n(t,e){if(!t)throw new Error(e||"Assertion failed")}t.exports=n,n.equal=function(t,e,n){if(t!=e)throw new Error(n||"Assertion failed: "+t+" != "+e)}},function(t,e,n){"use strict";var r=e,i=n(5),a=n(16),o=n(215);r.assert=a,r.toArray=o.toArray,r.zero2=o.zero2,r.toHex=o.toHex,r.encode=o.encode,r.getNAF=function(t,e,n){var r=new Array(Math.max(t.bitLength(),n)+1);r.fill(0);for(var i=1<<e+1,a=t.clone(),o=0;o<r.length;o++){var s,u=a.andln(i-1);a.isOdd()?(s=u>(i>>1)-1?(i>>1)-u:u,a.isubn(s)):s=0,r[o]=s,a.iushrn(1)}return r},r.getJSF=function(t,e){var n=[[],[]];t=t.clone(),e=e.clone();for(var r=0,i=0;t.cmpn(-r)>0||e.cmpn(-i)>0;){var a,o,s,u=t.andln(3)+r&3,c=e.andln(3)+i&3;if(3===u&&(u=-1),3===c&&(c=-1),0==(1&u))a=0;else a=3!==(s=t.andln(7)+r&7)&&5!==s||2!==c?u:-u;if(n[0].push(a),0==(1&c))o=0;else o=3!==(s=e.andln(7)+i&7)&&5!==s||2!==u?c:-c;n[1].push(o),2*r===a+1&&(r=1-r),2*i===o+1&&(i=1-i),t.iushrn(1),e.iushrn(1)}return n},r.cachedProperty=function(t,e,n){var r="_"+e;t.prototype[e]=function(){return void 0!==this[r]?this[r]:this[r]=n.call(this)}},r.parseBytes=function(t){return"string"==typeof t?r.toArray(t,"hex"):t},r.intFromLE=function(t){return new i(t,"hex","le")}},function(t,e,n){var r=n(131),i="object"==typeof self&&self&&self.Object===Object&&self,a=r||i||Function("return this")();t.exports=a},function(t,e,n){var r;try{r=n(25)}catch(t){}r||(r=window.graphlib),t.exports=r},function(t,e){t.exports=function(t){return null!=t&&"object"==typeof t}},function(t,e,n){"use strict";var r=n(16),i=n(2);function a(t,e){return 55296==(64512&t.charCodeAt(e))&&(!(e<0||e+1>=t.length)&&56320==(64512&t.charCodeAt(e+1)))}function o(t){return(t>>>24|t>>>8&65280|t<<8&16711680|(255&t)<<24)>>>0}function s(t){return 1===t.length?"0"+t:t}function u(t){return 7===t.length?"0"+t:6===t.length?"00"+t:5===t.length?"000"+t:4===t.length?"0000"+t:3===t.length?"00000"+t:2===t.length?"000000"+t:1===t.length?"0000000"+t:t}e.inherits=i,e.toArray=function(t,e){if(Array.isArray(t))return t.slice();if(!t)return[];var n=[];if("string"==typeof t)if(e){if("hex"===e)for((t=t.replace(/[^a-z0-9]+/gi,"")).length%2!=0&&(t="0"+t),i=0;i<t.length;i+=2)n.push(parseInt(t[i]+t[i+1],16))}else for(var r=0,i=0;i<t.length;i++){var o=t.charCodeAt(i);o<128?n[r++]=o:o<2048?(n[r++]=o>>6|192,n[r++]=63&o|128):a(t,i)?(o=65536+((1023&o)<<10)+(1023&t.charCodeAt(++i)),n[r++]=o>>18|240,n[r++]=o>>12&63|128,n[r++]=o>>6&63|128,n[r++]=63&o|128):(n[r++]=o>>12|224,n[r++]=o>>6&63|128,n[r++]=63&o|128)}else for(i=0;i<t.length;i++)n[i]=0|t[i];return n},e.toHex=function(t){for(var e="",n=0;n<t.length;n++)e+=s(t[n].toString(16));return e},e.htonl=o,e.toHex32=function(t,e){for(var n="",r=0;r<t.length;r++){var i=t[r];"little"===e&&(i=o(i)),n+=u(i.toString(16))}return n},e.zero2=s,e.zero8=u,e.join32=function(t,e,n,i){var a=n-e;r(a%4==0);for(var o=new Array(a/4),s=0,u=e;s<o.length;s++,u+=4){var c;c="big"===i?t[u]<<24|t[u+1]<<16|t[u+2]<<8|t[u+3]:t[u+3]<<24|t[u+2]<<16|t[u+1]<<8|t[u],o[s]=c>>>0}return o},e.split32=function(t,e){for(var n=new Array(4*t.length),r=0,i=0;r<t.length;r++,i+=4){var a=t[r];"big"===e?(n[i]=a>>>24,n[i+1]=a>>>16&255,n[i+2]=a>>>8&255,n[i+3]=255&a):(n[i+3]=a>>>24,n[i+2]=a>>>16&255,n[i+1]=a>>>8&255,n[i]=255&a)}return n},e.rotr32=function(t,e){return t>>>e|t<<32-e},e.rotl32=function(t,e){return t<<e|t>>>32-e},e.sum32=function(t,e){return t+e>>>0},e.sum32_3=function(t,e,n){return t+e+n>>>0},e.sum32_4=function(t,e,n,r){return t+e+n+r>>>0},e.sum32_5=function(t,e,n,r,i){return t+e+n+r+i>>>0},e.sum64=function(t,e,n,r){var i=t[e],a=r+t[e+1]>>>0,o=(a<r?1:0)+n+i;t[e]=o>>>0,t[e+1]=a},e.sum64_hi=function(t,e,n,r){return(e+r>>>0<e?1:0)+t+n>>>0},e.sum64_lo=function(t,e,n,r){return e+r>>>0},e.sum64_4_hi=function(t,e,n,r,i,a,o,s){var u=0,c=e;return u+=(c=c+r>>>0)<e?1:0,u+=(c=c+a>>>0)<a?1:0,t+n+i+o+(u+=(c=c+s>>>0)<s?1:0)>>>0},e.sum64_4_lo=function(t,e,n,r,i,a,o,s){return e+r+a+s>>>0},e.sum64_5_hi=function(t,e,n,r,i,a,o,s,u,c){var f=0,l=e;return f+=(l=l+r>>>0)<e?1:0,f+=(l=l+a>>>0)<a?1:0,f+=(l=l+s>>>0)<s?1:0,t+n+i+o+u+(f+=(l=l+c>>>0)<c?1:0)>>>0},e.sum64_5_lo=function(t,e,n,r,i,a,o,s,u,c){return e+r+a+s+c>>>0},e.rotr64_hi=function(t,e,n){return(e<<32-n|t>>>n)>>>0},e.rotr64_lo=function(t,e,n){return(t<<32-n|e>>>n)>>>0},e.shr64_hi=function(t,e,n){return t>>>n},e.shr64_lo=function(t,e,n){return(t<<32-n|e>>>n)>>>0}},function(t,e,n){(function(t){t.exports=function(){"use strict";var e,r;function i(){return e.apply(null,arguments)}function a(t){return t instanceof Array||"[object Array]"===Object.prototype.toString.call(t)}function o(t){return null!=t&&"[object Object]"===Object.prototype.toString.call(t)}function s(t){return void 0===t}function u(t){return"number"==typeof t||"[object Number]"===Object.prototype.toString.call(t)}function c(t){return t instanceof Date||"[object Date]"===Object.prototype.toString.call(t)}function f(t,e){var n,r=[];for(n=0;n<t.length;++n)r.push(e(t[n],n));return r}function l(t,e){return Object.prototype.hasOwnProperty.call(t,e)}function h(t,e){for(var n in e)l(e,n)&&(t[n]=e[n]);return l(e,"toString")&&(t.toString=e.toString),l(e,"valueOf")&&(t.valueOf=e.valueOf),t}function d(t,e,n,r){return me(t,e,n,r,!0).utc()}function p(t){return null==t._pf&&(t._pf={empty:!1,unusedTokens:[],unusedInput:[],overflow:-2,charsLeftOver:0,nullInput:!1,invalidMonth:null,invalidFormat:!1,userInvalidated:!1,iso:!1,parsedDateParts:[],meridiem:null,rfc2822:!1,weekdayMismatch:!1}),t._pf}function g(t){if(null==t._isValid){var e=p(t),n=r.call(e.parsedDateParts,(function(t){return null!=t})),i=!isNaN(t._d.getTime())&&e.overflow<0&&!e.empty&&!e.invalidMonth&&!e.invalidWeekday&&!e.weekdayMismatch&&!e.nullInput&&!e.invalidFormat&&!e.userInvalidated&&(!e.meridiem||e.meridiem&&n);if(t._strict&&(i=i&&0===e.charsLeftOver&&0===e.unusedTokens.length&&void 0===e.bigHour),null!=Object.isFrozen&&Object.isFrozen(t))return i;t._isValid=i}return t._isValid}function y(t){var e=d(NaN);return null!=t?h(p(e),t):p(e).userInvalidated=!0,e}r=Array.prototype.some?Array.prototype.some:function(t){for(var e=Object(this),n=e.length>>>0,r=0;r<n;r++)if(r in e&&t.call(this,e[r],r,e))return!0;return!1};var b=i.momentProperties=[];function v(t,e){var n,r,i;if(s(e._isAMomentObject)||(t._isAMomentObject=e._isAMomentObject),s(e._i)||(t._i=e._i),s(e._f)||(t._f=e._f),s(e._l)||(t._l=e._l),s(e._strict)||(t._strict=e._strict),s(e._tzm)||(t._tzm=e._tzm),s(e._isUTC)||(t._isUTC=e._isUTC),s(e._offset)||(t._offset=e._offset),s(e._pf)||(t._pf=p(e)),s(e._locale)||(t._locale=e._locale),0<b.length)for(n=0;n<b.length;n++)s(i=e[r=b[n]])||(t[r]=i);return t}var m=!1;function _(t){v(this,t),this._d=new Date(null!=t._d?t._d.getTime():NaN),this.isValid()||(this._d=new Date(NaN)),!1===m&&(m=!0,i.updateOffset(this),m=!1)}function w(t){return t instanceof _||null!=t&&null!=t._isAMomentObject}function x(t){return t<0?Math.ceil(t)||0:Math.floor(t)}function k(t){var e=+t,n=0;return 0!==e&&isFinite(e)&&(n=x(e)),n}function E(t,e,n){var r,i=Math.min(t.length,e.length),a=Math.abs(t.length-e.length),o=0;for(r=0;r<i;r++)(n&&t[r]!==e[r]||!n&&k(t[r])!==k(e[r]))&&o++;return o+a}function A(t){!1===i.suppressDeprecationWarnings&&"undefined"!=typeof console&&console.warn&&console.warn("Deprecation warning: "+t)}function S(t,e){var n=!0;return h((function(){if(null!=i.deprecationHandler&&i.deprecationHandler(null,t),n){for(var r,a=[],o=0;o<arguments.length;o++){if(r="","object"==typeof arguments[o]){for(var s in r+="\n["+o+"] ",arguments[0])r+=s+": "+arguments[0][s]+", ";r=r.slice(0,-2)}else r=arguments[o];a.push(r)}A(t+"\nArguments: "+Array.prototype.slice.call(a).join("")+"\n"+(new Error).stack),n=!1}return e.apply(this,arguments)}),e)}var M,T={};function D(t,e){null!=i.deprecationHandler&&i.deprecationHandler(t,e),T[t]||(A(e),T[t]=!0)}function C(t){return t instanceof Function||"[object Function]"===Object.prototype.toString.call(t)}function N(t,e){var n,r=h({},t);for(n in e)l(e,n)&&(o(t[n])&&o(e[n])?(r[n]={},h(r[n],t[n]),h(r[n],e[n])):null!=e[n]?r[n]=e[n]:delete r[n]);for(n in t)l(t,n)&&!l(e,n)&&o(t[n])&&(r[n]=h({},r[n]));return r}function I(t){null!=t&&this.set(t)}i.suppressDeprecationWarnings=!1,i.deprecationHandler=null,M=Object.keys?Object.keys:function(t){var e,n=[];for(e in t)l(t,e)&&n.push(e);return n};var L={};function B(t,e){var n=t.toLowerCase();L[n]=L[n+"s"]=L[e]=t}function O(t){return"string"==typeof t?L[t]||L[t.toLowerCase()]:void 0}function R(t){var e,n,r={};for(n in t)l(t,n)&&(e=O(n))&&(r[e]=t[n]);return r}var P={};function F(t,e){P[t]=e}function q(t,e,n){var r=""+Math.abs(t),i=e-r.length;return(0<=t?n?"+":"":"-")+Math.pow(10,Math.max(0,i)).toString().substr(1)+r}var j=/(\[[^\[]*\])|(\\)?([Hh]mm(ss)?|Mo|MM?M?M?|Do|DDDo|DD?D?D?|ddd?d?|do?|w[o|w]?|W[o|W]?|Qo?|YYYYYY|YYYYY|YYYY|YY|gg(ggg?)?|GG(GGG?)?|e|E|a|A|hh?|HH?|kk?|mm?|ss?|S{1,9}|x|X|zz?|ZZ?|.)/g,U=/(\[[^\[]*\])|(\\)?(LTS|LT|LL?L?L?|l{1,4})/g,z={},Y={};function V(t,e,n,r){var i=r;"string"==typeof r&&(i=function(){return this[r]()}),t&&(Y[t]=i),e&&(Y[e[0]]=function(){return q(i.apply(this,arguments),e[1],e[2])}),n&&(Y[n]=function(){return this.localeData().ordinal(i.apply(this,arguments),t)})}function H(t,e){return t.isValid()?(e=G(e,t.localeData()),z[e]=z[e]||function(t){var e,n,r,i=t.match(j);for(e=0,n=i.length;e<n;e++)Y[i[e]]?i[e]=Y[i[e]]:i[e]=(r=i[e]).match(/\[[\s\S]/)?r.replace(/^\[|\]$/g,""):r.replace(/\\/g,"");return function(e){var r,a="";for(r=0;r<n;r++)a+=C(i[r])?i[r].call(e,t):i[r];return a}}(e),z[e](t)):t.localeData().invalidDate()}function G(t,e){var n=5;function r(t){return e.longDateFormat(t)||t}for(U.lastIndex=0;0<=n&&U.test(t);)t=t.replace(U,r),U.lastIndex=0,n-=1;return t}var $=/\d/,W=/\d\d/,K=/\d{3}/,X=/\d{4}/,Z=/[+-]?\d{6}/,J=/\d\d?/,Q=/\d\d\d\d?/,tt=/\d\d\d\d\d\d?/,et=/\d{1,3}/,nt=/\d{1,4}/,rt=/[+-]?\d{1,6}/,it=/\d+/,at=/[+-]?\d+/,ot=/Z|[+-]\d\d:?\d\d/gi,st=/Z|[+-]\d\d(?::?\d\d)?/gi,ut=/[0-9]{0,256}['a-z\u00A0-\u05FF\u0700-\uD7FF\uF900-\uFDCF\uFDF0-\uFF07\uFF10-\uFFEF]{1,256}|[\u0600-\u06FF\/]{1,256}(\s*?[\u0600-\u06FF]{1,256}){1,2}/i,ct={};function ft(t,e,n){ct[t]=C(e)?e:function(t,r){return t&&n?n:e}}function lt(t,e){return l(ct,t)?ct[t](e._strict,e._locale):new RegExp(ht(t.replace("\\","").replace(/\\(\[)|\\(\])|\[([^\]\[]*)\]|\\(.)/g,(function(t,e,n,r,i){return e||n||r||i}))))}function ht(t){return t.replace(/[-\/\\^$*+?.()|[\]{}]/g,"\\$&")}var dt={};function pt(t,e){var n,r=e;for("string"==typeof t&&(t=[t]),u(e)&&(r=function(t,n){n[e]=k(t)}),n=0;n<t.length;n++)dt[t[n]]=r}function gt(t,e){pt(t,(function(t,n,r,i){r._w=r._w||{},e(t,r._w,r,i)}))}function yt(t){return bt(t)?366:365}function bt(t){return t%4==0&&t%100!=0||t%400==0}V("Y",0,0,(function(){var t=this.year();return t<=9999?""+t:"+"+t})),V(0,["YY",2],0,(function(){return this.year()%100})),V(0,["YYYY",4],0,"year"),V(0,["YYYYY",5],0,"year"),V(0,["YYYYYY",6,!0],0,"year"),B("year","y"),F("year",1),ft("Y",at),ft("YY",J,W),ft("YYYY",nt,X),ft("YYYYY",rt,Z),ft("YYYYYY",rt,Z),pt(["YYYYY","YYYYYY"],0),pt("YYYY",(function(t,e){e[0]=2===t.length?i.parseTwoDigitYear(t):k(t)})),pt("YY",(function(t,e){e[0]=i.parseTwoDigitYear(t)})),pt("Y",(function(t,e){e[0]=parseInt(t,10)})),i.parseTwoDigitYear=function(t){return k(t)+(68<k(t)?1900:2e3)};var vt,mt=_t("FullYear",!0);function _t(t,e){return function(n){return null!=n?(xt(this,t,n),i.updateOffset(this,e),this):wt(this,t)}}function wt(t,e){return t.isValid()?t._d["get"+(t._isUTC?"UTC":"")+e]():NaN}function xt(t,e,n){t.isValid()&&!isNaN(n)&&("FullYear"===e&&bt(t.year())&&1===t.month()&&29===t.date()?t._d["set"+(t._isUTC?"UTC":"")+e](n,t.month(),kt(n,t.month())):t._d["set"+(t._isUTC?"UTC":"")+e](n))}function kt(t,e){if(isNaN(t)||isNaN(e))return NaN;var n=(e%12+12)%12;return t+=(e-n)/12,1===n?bt(t)?29:28:31-n%7%2}vt=Array.prototype.indexOf?Array.prototype.indexOf:function(t){var e;for(e=0;e<this.length;++e)if(this[e]===t)return e;return-1},V("M",["MM",2],"Mo",(function(){return this.month()+1})),V("MMM",0,0,(function(t){return this.localeData().monthsShort(this,t)})),V("MMMM",0,0,(function(t){return this.localeData().months(this,t)})),B("month","M"),F("month",8),ft("M",J),ft("MM",J,W),ft("MMM",(function(t,e){return e.monthsShortRegex(t)})),ft("MMMM",(function(t,e){return e.monthsRegex(t)})),pt(["M","MM"],(function(t,e){e[1]=k(t)-1})),pt(["MMM","MMMM"],(function(t,e,n,r){var i=n._locale.monthsParse(t,r,n._strict);null!=i?e[1]=i:p(n).invalidMonth=t}));var Et=/D[oD]?(\[[^\[\]]*\]|\s)+MMMM?/,At="January_February_March_April_May_June_July_August_September_October_November_December".split("_"),St="Jan_Feb_Mar_Apr_May_Jun_Jul_Aug_Sep_Oct_Nov_Dec".split("_");function Mt(t,e){var n;if(!t.isValid())return t;if("string"==typeof e)if(/^\d+$/.test(e))e=k(e);else if(!u(e=t.localeData().monthsParse(e)))return t;return n=Math.min(t.date(),kt(t.year(),e)),t._d["set"+(t._isUTC?"UTC":"")+"Month"](e,n),t}function Tt(t){return null!=t?(Mt(this,t),i.updateOffset(this,!0),this):wt(this,"Month")}var Dt=ut,Ct=ut;function Nt(){function t(t,e){return e.length-t.length}var e,n,r=[],i=[],a=[];for(e=0;e<12;e++)n=d([2e3,e]),r.push(this.monthsShort(n,"")),i.push(this.months(n,"")),a.push(this.months(n,"")),a.push(this.monthsShort(n,""));for(r.sort(t),i.sort(t),a.sort(t),e=0;e<12;e++)r[e]=ht(r[e]),i[e]=ht(i[e]);for(e=0;e<24;e++)a[e]=ht(a[e]);this._monthsRegex=new RegExp("^("+a.join("|")+")","i"),this._monthsShortRegex=this._monthsRegex,this._monthsStrictRegex=new RegExp("^("+i.join("|")+")","i"),this._monthsShortStrictRegex=new RegExp("^("+r.join("|")+")","i")}function It(t){var e;if(t<100&&0<=t){var n=Array.prototype.slice.call(arguments);n[0]=t+400,e=new Date(Date.UTC.apply(null,n)),isFinite(e.getUTCFullYear())&&e.setUTCFullYear(t)}else e=new Date(Date.UTC.apply(null,arguments));return e}function Lt(t,e,n){var r=7+e-n;return-(7+It(t,0,r).getUTCDay()-e)%7+r-1}function Bt(t,e,n,r,i){var a,o,s=1+7*(e-1)+(7+n-r)%7+Lt(t,r,i);return o=s<=0?yt(a=t-1)+s:s>yt(t)?(a=t+1,s-yt(t)):(a=t,s),{year:a,dayOfYear:o}}function Ot(t,e,n){var r,i,a=Lt(t.year(),e,n),o=Math.floor((t.dayOfYear()-a-1)/7)+1;return o<1?r=o+Rt(i=t.year()-1,e,n):o>Rt(t.year(),e,n)?(r=o-Rt(t.year(),e,n),i=t.year()+1):(i=t.year(),r=o),{week:r,year:i}}function Rt(t,e,n){var r=Lt(t,e,n),i=Lt(t+1,e,n);return(yt(t)-r+i)/7}function Pt(t,e){return t.slice(e,7).concat(t.slice(0,e))}V("w",["ww",2],"wo","week"),V("W",["WW",2],"Wo","isoWeek"),B("week","w"),B("isoWeek","W"),F("week",5),F("isoWeek",5),ft("w",J),ft("ww",J,W),ft("W",J),ft("WW",J,W),gt(["w","ww","W","WW"],(function(t,e,n,r){e[r.substr(0,1)]=k(t)})),V("d",0,"do","day"),V("dd",0,0,(function(t){return this.localeData().weekdaysMin(this,t)})),V("ddd",0,0,(function(t){return this.localeData().weekdaysShort(this,t)})),V("dddd",0,0,(function(t){return this.localeData().weekdays(this,t)})),V("e",0,0,"weekday"),V("E",0,0,"isoWeekday"),B("day","d"),B("weekday","e"),B("isoWeekday","E"),F("day",11),F("weekday",11),F("isoWeekday",11),ft("d",J),ft("e",J),ft("E",J),ft("dd",(function(t,e){return e.weekdaysMinRegex(t)})),ft("ddd",(function(t,e){return e.weekdaysShortRegex(t)})),ft("dddd",(function(t,e){return e.weekdaysRegex(t)})),gt(["dd","ddd","dddd"],(function(t,e,n,r){var i=n._locale.weekdaysParse(t,r,n._strict);null!=i?e.d=i:p(n).invalidWeekday=t})),gt(["d","e","E"],(function(t,e,n,r){e[r]=k(t)}));var Ft="Sunday_Monday_Tuesday_Wednesday_Thursday_Friday_Saturday".split("_"),qt="Sun_Mon_Tue_Wed_Thu_Fri_Sat".split("_"),jt="Su_Mo_Tu_We_Th_Fr_Sa".split("_"),Ut=ut,zt=ut,Yt=ut;function Vt(){function t(t,e){return e.length-t.length}var e,n,r,i,a,o=[],s=[],u=[],c=[];for(e=0;e<7;e++)n=d([2e3,1]).day(e),r=this.weekdaysMin(n,""),i=this.weekdaysShort(n,""),a=this.weekdays(n,""),o.push(r),s.push(i),u.push(a),c.push(r),c.push(i),c.push(a);for(o.sort(t),s.sort(t),u.sort(t),c.sort(t),e=0;e<7;e++)s[e]=ht(s[e]),u[e]=ht(u[e]),c[e]=ht(c[e]);this._weekdaysRegex=new RegExp("^("+c.join("|")+")","i"),this._weekdaysShortRegex=this._weekdaysRegex,this._weekdaysMinRegex=this._weekdaysRegex,this._weekdaysStrictRegex=new RegExp("^("+u.join("|")+")","i"),this._weekdaysShortStrictRegex=new RegExp("^("+s.join("|")+")","i"),this._weekdaysMinStrictRegex=new RegExp("^("+o.join("|")+")","i")}function Ht(){return this.hours()%12||12}function Gt(t,e){V(t,0,0,(function(){return this.localeData().meridiem(this.hours(),this.minutes(),e)}))}function $t(t,e){return e._meridiemParse}V("H",["HH",2],0,"hour"),V("h",["hh",2],0,Ht),V("k",["kk",2],0,(function(){return this.hours()||24})),V("hmm",0,0,(function(){return""+Ht.apply(this)+q(this.minutes(),2)})),V("hmmss",0,0,(function(){return""+Ht.apply(this)+q(this.minutes(),2)+q(this.seconds(),2)})),V("Hmm",0,0,(function(){return""+this.hours()+q(this.minutes(),2)})),V("Hmmss",0,0,(function(){return""+this.hours()+q(this.minutes(),2)+q(this.seconds(),2)})),Gt("a",!0),Gt("A",!1),B("hour","h"),F("hour",13),ft("a",$t),ft("A",$t),ft("H",J),ft("h",J),ft("k",J),ft("HH",J,W),ft("hh",J,W),ft("kk",J,W),ft("hmm",Q),ft("hmmss",tt),ft("Hmm",Q),ft("Hmmss",tt),pt(["H","HH"],3),pt(["k","kk"],(function(t,e,n){var r=k(t);e[3]=24===r?0:r})),pt(["a","A"],(function(t,e,n){n._isPm=n._locale.isPM(t),n._meridiem=t})),pt(["h","hh"],(function(t,e,n){e[3]=k(t),p(n).bigHour=!0})),pt("hmm",(function(t,e,n){var r=t.length-2;e[3]=k(t.substr(0,r)),e[4]=k(t.substr(r)),p(n).bigHour=!0})),pt("hmmss",(function(t,e,n){var r=t.length-4,i=t.length-2;e[3]=k(t.substr(0,r)),e[4]=k(t.substr(r,2)),e[5]=k(t.substr(i)),p(n).bigHour=!0})),pt("Hmm",(function(t,e,n){var r=t.length-2;e[3]=k(t.substr(0,r)),e[4]=k(t.substr(r))})),pt("Hmmss",(function(t,e,n){var r=t.length-4,i=t.length-2;e[3]=k(t.substr(0,r)),e[4]=k(t.substr(r,2)),e[5]=k(t.substr(i))}));var Wt,Kt=_t("Hours",!0),Xt={calendar:{sameDay:"[Today at] LT",nextDay:"[Tomorrow at] LT",nextWeek:"dddd [at] LT",lastDay:"[Yesterday at] LT",lastWeek:"[Last] dddd [at] LT",sameElse:"L"},longDateFormat:{LTS:"h:mm:ss A",LT:"h:mm A",L:"MM/DD/YYYY",LL:"MMMM D, YYYY",LLL:"MMMM D, YYYY h:mm A",LLLL:"dddd, MMMM D, YYYY h:mm A"},invalidDate:"Invalid date",ordinal:"%d",dayOfMonthOrdinalParse:/\d{1,2}/,relativeTime:{future:"in %s",past:"%s ago",s:"a few seconds",ss:"%d seconds",m:"a minute",mm:"%d minutes",h:"an hour",hh:"%d hours",d:"a day",dd:"%d days",M:"a month",MM:"%d months",y:"a year",yy:"%d years"},months:At,monthsShort:St,week:{dow:0,doy:6},weekdays:Ft,weekdaysMin:jt,weekdaysShort:qt,meridiemParse:/[ap]\.?m?\.?/i},Zt={},Jt={};function Qt(t){return t?t.toLowerCase().replace("_","-"):t}function te(e){var r=null;if(!Zt[e]&&void 0!==t&&t&&t.exports)try{r=Wt._abbr,n(235)("./"+e),ee(r)}catch(e){}return Zt[e]}function ee(t,e){var n;return t&&((n=s(e)?re(t):ne(t,e))?Wt=n:"undefined"!=typeof console&&console.warn&&console.warn("Locale "+t+" not found. Did you forget to load it?")),Wt._abbr}function ne(t,e){if(null===e)return delete Zt[t],null;var n,r=Xt;if(e.abbr=t,null!=Zt[t])D("defineLocaleOverride","use moment.updateLocale(localeName, config) to change an existing locale. moment.defineLocale(localeName, config) should only be used for creating a new locale See http://momentjs.com/guides/#/warnings/define-locale/ for more info."),r=Zt[t]._config;else if(null!=e.parentLocale)if(null!=Zt[e.parentLocale])r=Zt[e.parentLocale]._config;else{if(null==(n=te(e.parentLocale)))return Jt[e.parentLocale]||(Jt[e.parentLocale]=[]),Jt[e.parentLocale].push({name:t,config:e}),null;r=n._config}return Zt[t]=new I(N(r,e)),Jt[t]&&Jt[t].forEach((function(t){ne(t.name,t.config)})),ee(t),Zt[t]}function re(t){var e;if(t&&t._locale&&t._locale._abbr&&(t=t._locale._abbr),!t)return Wt;if(!a(t)){if(e=te(t))return e;t=[t]}return function(t){for(var e,n,r,i,a=0;a<t.length;){for(e=(i=Qt(t[a]).split("-")).length,n=(n=Qt(t[a+1]))?n.split("-"):null;0<e;){if(r=te(i.slice(0,e).join("-")))return r;if(n&&n.length>=e&&E(i,n,!0)>=e-1)break;e--}a++}return Wt}(t)}function ie(t){var e,n=t._a;return n&&-2===p(t).overflow&&(e=n[1]<0||11<n[1]?1:n[2]<1||n[2]>kt(n[0],n[1])?2:n[3]<0||24<n[3]||24===n[3]&&(0!==n[4]||0!==n[5]||0!==n[6])?3:n[4]<0||59<n[4]?4:n[5]<0||59<n[5]?5:n[6]<0||999<n[6]?6:-1,p(t)._overflowDayOfYear&&(e<0||2<e)&&(e=2),p(t)._overflowWeeks&&-1===e&&(e=7),p(t)._overflowWeekday&&-1===e&&(e=8),p(t).overflow=e),t}function ae(t,e,n){return null!=t?t:null!=e?e:n}function oe(t){var e,n,r,a,o,s=[];if(!t._d){var u,c;for(u=t,c=new Date(i.now()),r=u._useUTC?[c.getUTCFullYear(),c.getUTCMonth(),c.getUTCDate()]:[c.getFullYear(),c.getMonth(),c.getDate()],t._w&&null==t._a[2]&&null==t._a[1]&&function(t){var e,n,r,i,a,o,s,u;if(null!=(e=t._w).GG||null!=e.W||null!=e.E)a=1,o=4,n=ae(e.GG,t._a[0],Ot(_e(),1,4).year),r=ae(e.W,1),((i=ae(e.E,1))<1||7<i)&&(u=!0);else{a=t._locale._week.dow,o=t._locale._week.doy;var c=Ot(_e(),a,o);n=ae(e.gg,t._a[0],c.year),r=ae(e.w,c.week),null!=e.d?((i=e.d)<0||6<i)&&(u=!0):null!=e.e?(i=e.e+a,(e.e<0||6<e.e)&&(u=!0)):i=a}r<1||r>Rt(n,a,o)?p(t)._overflowWeeks=!0:null!=u?p(t)._overflowWeekday=!0:(s=Bt(n,r,i,a,o),t._a[0]=s.year,t._dayOfYear=s.dayOfYear)}(t),null!=t._dayOfYear&&(o=ae(t._a[0],r[0]),(t._dayOfYear>yt(o)||0===t._dayOfYear)&&(p(t)._overflowDayOfYear=!0),n=It(o,0,t._dayOfYear),t._a[1]=n.getUTCMonth(),t._a[2]=n.getUTCDate()),e=0;e<3&&null==t._a[e];++e)t._a[e]=s[e]=r[e];for(;e<7;e++)t._a[e]=s[e]=null==t._a[e]?2===e?1:0:t._a[e];24===t._a[3]&&0===t._a[4]&&0===t._a[5]&&0===t._a[6]&&(t._nextDay=!0,t._a[3]=0),t._d=(t._useUTC?It:function(t,e,n,r,i,a,o){var s;return t<100&&0<=t?(s=new Date(t+400,e,n,r,i,a,o),isFinite(s.getFullYear())&&s.setFullYear(t)):s=new Date(t,e,n,r,i,a,o),s}).apply(null,s),a=t._useUTC?t._d.getUTCDay():t._d.getDay(),null!=t._tzm&&t._d.setUTCMinutes(t._d.getUTCMinutes()-t._tzm),t._nextDay&&(t._a[3]=24),t._w&&void 0!==t._w.d&&t._w.d!==a&&(p(t).weekdayMismatch=!0)}}var se=/^\s*((?:[+-]\d{6}|\d{4})-(?:\d\d-\d\d|W\d\d-\d|W\d\d|\d\d\d|\d\d))(?:(T| )(\d\d(?::\d\d(?::\d\d(?:[.,]\d+)?)?)?)([\+\-]\d\d(?::?\d\d)?|\s*Z)?)?$/,ue=/^\s*((?:[+-]\d{6}|\d{4})(?:\d\d\d\d|W\d\d\d|W\d\d|\d\d\d|\d\d))(?:(T| )(\d\d(?:\d\d(?:\d\d(?:[.,]\d+)?)?)?)([\+\-]\d\d(?::?\d\d)?|\s*Z)?)?$/,ce=/Z|[+-]\d\d(?::?\d\d)?/,fe=[["YYYYYY-MM-DD",/[+-]\d{6}-\d\d-\d\d/],["YYYY-MM-DD",/\d{4}-\d\d-\d\d/],["GGGG-[W]WW-E",/\d{4}-W\d\d-\d/],["GGGG-[W]WW",/\d{4}-W\d\d/,!1],["YYYY-DDD",/\d{4}-\d{3}/],["YYYY-MM",/\d{4}-\d\d/,!1],["YYYYYYMMDD",/[+-]\d{10}/],["YYYYMMDD",/\d{8}/],["GGGG[W]WWE",/\d{4}W\d{3}/],["GGGG[W]WW",/\d{4}W\d{2}/,!1],["YYYYDDD",/\d{7}/]],le=[["HH:mm:ss.SSSS",/\d\d:\d\d:\d\d\.\d+/],["HH:mm:ss,SSSS",/\d\d:\d\d:\d\d,\d+/],["HH:mm:ss",/\d\d:\d\d:\d\d/],["HH:mm",/\d\d:\d\d/],["HHmmss.SSSS",/\d\d\d\d\d\d\.\d+/],["HHmmss,SSSS",/\d\d\d\d\d\d,\d+/],["HHmmss",/\d\d\d\d\d\d/],["HHmm",/\d\d\d\d/],["HH",/\d\d/]],he=/^\/?Date\((\-?\d+)/i;function de(t){var e,n,r,i,a,o,s=t._i,u=se.exec(s)||ue.exec(s);if(u){for(p(t).iso=!0,e=0,n=fe.length;e<n;e++)if(fe[e][1].exec(u[1])){i=fe[e][0],r=!1!==fe[e][2];break}if(null==i)return void(t._isValid=!1);if(u[3]){for(e=0,n=le.length;e<n;e++)if(le[e][1].exec(u[3])){a=(u[2]||" ")+le[e][0];break}if(null==a)return void(t._isValid=!1)}if(!r&&null!=a)return void(t._isValid=!1);if(u[4]){if(!ce.exec(u[4]))return void(t._isValid=!1);o="Z"}t._f=i+(a||"")+(o||""),be(t)}else t._isValid=!1}var pe=/^(?:(Mon|Tue|Wed|Thu|Fri|Sat|Sun),?\s)?(\d{1,2})\s(Jan|Feb|Mar|Apr|May|Jun|Jul|Aug|Sep|Oct|Nov|Dec)\s(\d{2,4})\s(\d\d):(\d\d)(?::(\d\d))?\s(?:(UT|GMT|[ECMP][SD]T)|([Zz])|([+-]\d{4}))$/,ge={UT:0,GMT:0,EDT:-240,EST:-300,CDT:-300,CST:-360,MDT:-360,MST:-420,PDT:-420,PST:-480};function ye(t){var e,n,r,i=pe.exec(t._i.replace(/\([^)]*\)|[\n\t]/g," ").replace(/(\s\s+)/g," ").replace(/^\s\s*/,"").replace(/\s\s*$/,""));if(i){var a=function(t,e,n,r,i,a){var o=[function(t){var e=parseInt(t,10);return e<=49?2e3+e:e<=999?1900+e:e}(t),St.indexOf(e),parseInt(n,10),parseInt(r,10),parseInt(i,10)];return a&&o.push(parseInt(a,10)),o}(i[4],i[3],i[2],i[5],i[6],i[7]);if(n=a,r=t,(e=i[1])&&qt.indexOf(e)!==new Date(n[0],n[1],n[2]).getDay()&&(p(r).weekdayMismatch=!0,!(r._isValid=!1)))return;t._a=a,t._tzm=function(t,e,n){if(t)return ge[t];if(e)return 0;var r=parseInt(n,10),i=r%100;return(r-i)/100*60+i}(i[8],i[9],i[10]),t._d=It.apply(null,t._a),t._d.setUTCMinutes(t._d.getUTCMinutes()-t._tzm),p(t).rfc2822=!0}else t._isValid=!1}function be(t){if(t._f!==i.ISO_8601)if(t._f!==i.RFC_2822){t._a=[],p(t).empty=!0;var e,n,r,a,o,s,u,c,f=""+t._i,h=f.length,d=0;for(r=G(t._f,t._locale).match(j)||[],e=0;e<r.length;e++)a=r[e],(n=(f.match(lt(a,t))||[])[0])&&(0<(o=f.substr(0,f.indexOf(n))).length&&p(t).unusedInput.push(o),f=f.slice(f.indexOf(n)+n.length),d+=n.length),Y[a]?(n?p(t).empty=!1:p(t).unusedTokens.push(a),s=a,c=t,null!=(u=n)&&l(dt,s)&&dt[s](u,c._a,c,s)):t._strict&&!n&&p(t).unusedTokens.push(a);p(t).charsLeftOver=h-d,0<f.length&&p(t).unusedInput.push(f),t._a[3]<=12&&!0===p(t).bigHour&&0<t._a[3]&&(p(t).bigHour=void 0),p(t).parsedDateParts=t._a.slice(0),p(t).meridiem=t._meridiem,t._a[3]=function(t,e,n){var r;return null==n?e:null!=t.meridiemHour?t.meridiemHour(e,n):(null!=t.isPM&&((r=t.isPM(n))&&e<12&&(e+=12),r||12!==e||(e=0)),e)}(t._locale,t._a[3],t._meridiem),oe(t),ie(t)}else ye(t);else de(t)}function ve(t){var e,n,r,l,d=t._i,b=t._f;return t._locale=t._locale||re(t._l),null===d||void 0===b&&""===d?y({nullInput:!0}):("string"==typeof d&&(t._i=d=t._locale.preparse(d)),w(d)?new _(ie(d)):(c(d)?t._d=d:a(b)?function(t){var e,n,r,i,a;if(0===t._f.length)return p(t).invalidFormat=!0,t._d=new Date(NaN);for(i=0;i<t._f.length;i++)a=0,e=v({},t),null!=t._useUTC&&(e._useUTC=t._useUTC),e._f=t._f[i],be(e),g(e)&&(a+=p(e).charsLeftOver,a+=10*p(e).unusedTokens.length,p(e).score=a,(null==r||a<r)&&(r=a,n=e));h(t,n||e)}(t):b?be(t):s(n=(e=t)._i)?e._d=new Date(i.now()):c(n)?e._d=new Date(n.valueOf()):"string"==typeof n?(r=e,null===(l=he.exec(r._i))?(de(r),!1===r._isValid&&(delete r._isValid,ye(r),!1===r._isValid&&(delete r._isValid,i.createFromInputFallback(r)))):r._d=new Date(+l[1])):a(n)?(e._a=f(n.slice(0),(function(t){return parseInt(t,10)})),oe(e)):o(n)?function(t){if(!t._d){var e=R(t._i);t._a=f([e.year,e.month,e.day||e.date,e.hour,e.minute,e.second,e.millisecond],(function(t){return t&&parseInt(t,10)})),oe(t)}}(e):u(n)?e._d=new Date(n):i.createFromInputFallback(e),g(t)||(t._d=null),t))}function me(t,e,n,r,i){var s,u={};return!0!==n&&!1!==n||(r=n,n=void 0),(o(t)&&function(t){if(Object.getOwnPropertyNames)return 0===Object.getOwnPropertyNames(t).length;var e;for(e in t)if(t.hasOwnProperty(e))return!1;return!0}(t)||a(t)&&0===t.length)&&(t=void 0),u._isAMomentObject=!0,u._useUTC=u._isUTC=i,u._l=n,u._i=t,u._f=e,u._strict=r,(s=new _(ie(ve(u))))._nextDay&&(s.add(1,"d"),s._nextDay=void 0),s}function _e(t,e,n,r){return me(t,e,n,r,!1)}i.createFromInputFallback=S("value provided is not in a recognized RFC2822 or ISO format. moment construction falls back to js Date(), which is not reliable across all browsers and versions. Non RFC2822/ISO date formats are discouraged and will be removed in an upcoming major release. Please refer to http://momentjs.com/guides/#/warnings/js-date/ for more info.",(function(t){t._d=new Date(t._i+(t._useUTC?" UTC":""))})),i.ISO_8601=function(){},i.RFC_2822=function(){};var we=S("moment().min is deprecated, use moment.max instead. http://momentjs.com/guides/#/warnings/min-max/",(function(){var t=_e.apply(null,arguments);return this.isValid()&&t.isValid()?t<this?this:t:y()})),xe=S("moment().max is deprecated, use moment.min instead. http://momentjs.com/guides/#/warnings/min-max/",(function(){var t=_e.apply(null,arguments);return this.isValid()&&t.isValid()?this<t?this:t:y()}));function ke(t,e){var n,r;if(1===e.length&&a(e[0])&&(e=e[0]),!e.length)return _e();for(n=e[0],r=1;r<e.length;++r)e[r].isValid()&&!e[r][t](n)||(n=e[r]);return n}var Ee=["year","quarter","month","week","day","hour","minute","second","millisecond"];function Ae(t){var e=R(t),n=e.year||0,r=e.quarter||0,i=e.month||0,a=e.week||e.isoWeek||0,o=e.day||0,s=e.hour||0,u=e.minute||0,c=e.second||0,f=e.millisecond||0;this._isValid=function(t){for(var e in t)if(-1===vt.call(Ee,e)||null!=t[e]&&isNaN(t[e]))return!1;for(var n=!1,r=0;r<Ee.length;++r)if(t[Ee[r]]){if(n)return!1;parseFloat(t[Ee[r]])!==k(t[Ee[r]])&&(n=!0)}return!0}(e),this._milliseconds=+f+1e3*c+6e4*u+1e3*s*60*60,this._days=+o+7*a,this._months=+i+3*r+12*n,this._data={},this._locale=re(),this._bubble()}function Se(t){return t instanceof Ae}function Me(t){return t<0?-1*Math.round(-1*t):Math.round(t)}function Te(t,e){V(t,0,0,(function(){var t=this.utcOffset(),n="+";return t<0&&(t=-t,n="-"),n+q(~~(t/60),2)+e+q(~~t%60,2)}))}Te("Z",":"),Te("ZZ",""),ft("Z",st),ft("ZZ",st),pt(["Z","ZZ"],(function(t,e,n){n._useUTC=!0,n._tzm=Ce(st,t)}));var De=/([\+\-]|\d\d)/gi;function Ce(t,e){var n=(e||"").match(t);if(null===n)return null;var r=((n[n.length-1]||[])+"").match(De)||["-",0,0],i=60*r[1]+k(r[2]);return 0===i?0:"+"===r[0]?i:-i}function Ne(t,e){var n,r;return e._isUTC?(n=e.clone(),r=(w(t)||c(t)?t.valueOf():_e(t).valueOf())-n.valueOf(),n._d.setTime(n._d.valueOf()+r),i.updateOffset(n,!1),n):_e(t).local()}function Ie(t){return 15*-Math.round(t._d.getTimezoneOffset()/15)}function Le(){return!!this.isValid()&&this._isUTC&&0===this._offset}i.updateOffset=function(){};var Be=/^(\-|\+)?(?:(\d*)[. ])?(\d+)\:(\d+)(?:\:(\d+)(\.\d*)?)?$/,Oe=/^(-|\+)?P(?:([-+]?[0-9,.]*)Y)?(?:([-+]?[0-9,.]*)M)?(?:([-+]?[0-9,.]*)W)?(?:([-+]?[0-9,.]*)D)?(?:T(?:([-+]?[0-9,.]*)H)?(?:([-+]?[0-9,.]*)M)?(?:([-+]?[0-9,.]*)S)?)?$/;function Re(t,e){var n,r,i,a=t,o=null;return Se(t)?a={ms:t._milliseconds,d:t._days,M:t._months}:u(t)?(a={},e?a[e]=t:a.milliseconds=t):(o=Be.exec(t))?(n="-"===o[1]?-1:1,a={y:0,d:k(o[2])*n,h:k(o[3])*n,m:k(o[4])*n,s:k(o[5])*n,ms:k(Me(1e3*o[6]))*n}):(o=Oe.exec(t))?(n="-"===o[1]?-1:1,a={y:Pe(o[2],n),M:Pe(o[3],n),w:Pe(o[4],n),d:Pe(o[5],n),h:Pe(o[6],n),m:Pe(o[7],n),s:Pe(o[8],n)}):null==a?a={}:"object"==typeof a&&("from"in a||"to"in a)&&(i=function(t,e){var n;return t.isValid()&&e.isValid()?(e=Ne(e,t),t.isBefore(e)?n=Fe(t,e):((n=Fe(e,t)).milliseconds=-n.milliseconds,n.months=-n.months),n):{milliseconds:0,months:0}}(_e(a.from),_e(a.to)),(a={}).ms=i.milliseconds,a.M=i.months),r=new Ae(a),Se(t)&&l(t,"_locale")&&(r._locale=t._locale),r}function Pe(t,e){var n=t&&parseFloat(t.replace(",","."));return(isNaN(n)?0:n)*e}function Fe(t,e){var n={};return n.months=e.month()-t.month()+12*(e.year()-t.year()),t.clone().add(n.months,"M").isAfter(e)&&--n.months,n.milliseconds=+e-+t.clone().add(n.months,"M"),n}function qe(t,e){return function(n,r){var i;return null===r||isNaN(+r)||(D(e,"moment()."+e+"(period, number) is deprecated. Please use moment()."+e+"(number, period). See http://momentjs.com/guides/#/warnings/add-inverted-param/ for more info."),i=n,n=r,r=i),je(this,Re(n="string"==typeof n?+n:n,r),t),this}}function je(t,e,n,r){var a=e._milliseconds,o=Me(e._days),s=Me(e._months);t.isValid()&&(r=null==r||r,s&&Mt(t,wt(t,"Month")+s*n),o&&xt(t,"Date",wt(t,"Date")+o*n),a&&t._d.setTime(t._d.valueOf()+a*n),r&&i.updateOffset(t,o||s))}Re.fn=Ae.prototype,Re.invalid=function(){return Re(NaN)};var Ue=qe(1,"add"),ze=qe(-1,"subtract");function Ye(t,e){var n=12*(e.year()-t.year())+(e.month()-t.month()),r=t.clone().add(n,"months");return-(n+(e-r<0?(e-r)/(r-t.clone().add(n-1,"months")):(e-r)/(t.clone().add(n+1,"months")-r)))||0}function Ve(t){var e;return void 0===t?this._locale._abbr:(null!=(e=re(t))&&(this._locale=e),this)}i.defaultFormat="YYYY-MM-DDTHH:mm:ssZ",i.defaultFormatUtc="YYYY-MM-DDTHH:mm:ss[Z]";var He=S("moment().lang() is deprecated. Instead, use moment().localeData() to get the language configuration. Use moment().locale() to change languages.",(function(t){return void 0===t?this.localeData():this.locale(t)}));function Ge(){return this._locale}var $e=126227808e5;function We(t,e){return(t%e+e)%e}function Ke(t,e,n){return t<100&&0<=t?new Date(t+400,e,n)-$e:new Date(t,e,n).valueOf()}function Xe(t,e,n){return t<100&&0<=t?Date.UTC(t+400,e,n)-$e:Date.UTC(t,e,n)}function Ze(t,e){V(0,[t,t.length],0,e)}function Je(t,e,n,r,i){var a;return null==t?Ot(this,r,i).year:((a=Rt(t,r,i))<e&&(e=a),function(t,e,n,r,i){var a=Bt(t,e,n,r,i),o=It(a.year,0,a.dayOfYear);return this.year(o.getUTCFullYear()),this.month(o.getUTCMonth()),this.date(o.getUTCDate()),this}.call(this,t,e,n,r,i))}V(0,["gg",2],0,(function(){return this.weekYear()%100})),V(0,["GG",2],0,(function(){return this.isoWeekYear()%100})),Ze("gggg","weekYear"),Ze("ggggg","weekYear"),Ze("GGGG","isoWeekYear"),Ze("GGGGG","isoWeekYear"),B("weekYear","gg"),B("isoWeekYear","GG"),F("weekYear",1),F("isoWeekYear",1),ft("G",at),ft("g",at),ft("GG",J,W),ft("gg",J,W),ft("GGGG",nt,X),ft("gggg",nt,X),ft("GGGGG",rt,Z),ft("ggggg",rt,Z),gt(["gggg","ggggg","GGGG","GGGGG"],(function(t,e,n,r){e[r.substr(0,2)]=k(t)})),gt(["gg","GG"],(function(t,e,n,r){e[r]=i.parseTwoDigitYear(t)})),V("Q",0,"Qo","quarter"),B("quarter","Q"),F("quarter",7),ft("Q",$),pt("Q",(function(t,e){e[1]=3*(k(t)-1)})),V("D",["DD",2],"Do","date"),B("date","D"),F("date",9),ft("D",J),ft("DD",J,W),ft("Do",(function(t,e){return t?e._dayOfMonthOrdinalParse||e._ordinalParse:e._dayOfMonthOrdinalParseLenient})),pt(["D","DD"],2),pt("Do",(function(t,e){e[2]=k(t.match(J)[0])}));var Qe=_t("Date",!0);V("DDD",["DDDD",3],"DDDo","dayOfYear"),B("dayOfYear","DDD"),F("dayOfYear",4),ft("DDD",et),ft("DDDD",K),pt(["DDD","DDDD"],(function(t,e,n){n._dayOfYear=k(t)})),V("m",["mm",2],0,"minute"),B("minute","m"),F("minute",14),ft("m",J),ft("mm",J,W),pt(["m","mm"],4);var tn=_t("Minutes",!1);V("s",["ss",2],0,"second"),B("second","s"),F("second",15),ft("s",J),ft("ss",J,W),pt(["s","ss"],5);var en,nn=_t("Seconds",!1);for(V("S",0,0,(function(){return~~(this.millisecond()/100)})),V(0,["SS",2],0,(function(){return~~(this.millisecond()/10)})),V(0,["SSS",3],0,"millisecond"),V(0,["SSSS",4],0,(function(){return 10*this.millisecond()})),V(0,["SSSSS",5],0,(function(){return 100*this.millisecond()})),V(0,["SSSSSS",6],0,(function(){return 1e3*this.millisecond()})),V(0,["SSSSSSS",7],0,(function(){return 1e4*this.millisecond()})),V(0,["SSSSSSSS",8],0,(function(){return 1e5*this.millisecond()})),V(0,["SSSSSSSSS",9],0,(function(){return 1e6*this.millisecond()})),B("millisecond","ms"),F("millisecond",16),ft("S",et,$),ft("SS",et,W),ft("SSS",et,K),en="SSSS";en.length<=9;en+="S")ft(en,it);function rn(t,e){e[6]=k(1e3*("0."+t))}for(en="S";en.length<=9;en+="S")pt(en,rn);var an=_t("Milliseconds",!1);V("z",0,0,"zoneAbbr"),V("zz",0,0,"zoneName");var on=_.prototype;function sn(t){return t}on.add=Ue,on.calendar=function(t,e){var n=t||_e(),r=Ne(n,this).startOf("day"),a=i.calendarFormat(this,r)||"sameElse",o=e&&(C(e[a])?e[a].call(this,n):e[a]);return this.format(o||this.localeData().calendar(a,this,_e(n)))},on.clone=function(){return new _(this)},on.diff=function(t,e,n){var r,i,a;if(!this.isValid())return NaN;if(!(r=Ne(t,this)).isValid())return NaN;switch(i=6e4*(r.utcOffset()-this.utcOffset()),e=O(e)){case"year":a=Ye(this,r)/12;break;case"month":a=Ye(this,r);break;case"quarter":a=Ye(this,r)/3;break;case"second":a=(this-r)/1e3;break;case"minute":a=(this-r)/6e4;break;case"hour":a=(this-r)/36e5;break;case"day":a=(this-r-i)/864e5;break;case"week":a=(this-r-i)/6048e5;break;default:a=this-r}return n?a:x(a)},on.endOf=function(t){var e;if(void 0===(t=O(t))||"millisecond"===t||!this.isValid())return this;var n=this._isUTC?Xe:Ke;switch(t){case"year":e=n(this.year()+1,0,1)-1;break;case"quarter":e=n(this.year(),this.month()-this.month()%3+3,1)-1;break;case"month":e=n(this.year(),this.month()+1,1)-1;break;case"week":e=n(this.year(),this.month(),this.date()-this.weekday()+7)-1;break;case"isoWeek":e=n(this.year(),this.month(),this.date()-(this.isoWeekday()-1)+7)-1;break;case"day":case"date":e=n(this.year(),this.month(),this.date()+1)-1;break;case"hour":e=this._d.valueOf(),e+=36e5-We(e+(this._isUTC?0:6e4*this.utcOffset()),36e5)-1;break;case"minute":e=this._d.valueOf(),e+=6e4-We(e,6e4)-1;break;case"second":e=this._d.valueOf(),e+=1e3-We(e,1e3)-1}return this._d.setTime(e),i.updateOffset(this,!0),this},on.format=function(t){t||(t=this.isUtc()?i.defaultFormatUtc:i.defaultFormat);var e=H(this,t);return this.localeData().postformat(e)},on.from=function(t,e){return this.isValid()&&(w(t)&&t.isValid()||_e(t).isValid())?Re({to:this,from:t}).locale(this.locale()).humanize(!e):this.localeData().invalidDate()},on.fromNow=function(t){return this.from(_e(),t)},on.to=function(t,e){return this.isValid()&&(w(t)&&t.isValid()||_e(t).isValid())?Re({from:this,to:t}).locale(this.locale()).humanize(!e):this.localeData().invalidDate()},on.toNow=function(t){return this.to(_e(),t)},on.get=function(t){return C(this[t=O(t)])?this[t]():this},on.invalidAt=function(){return p(this).overflow},on.isAfter=function(t,e){var n=w(t)?t:_e(t);return!(!this.isValid()||!n.isValid())&&("millisecond"===(e=O(e)||"millisecond")?this.valueOf()>n.valueOf():n.valueOf()<this.clone().startOf(e).valueOf())},on.isBefore=function(t,e){var n=w(t)?t:_e(t);return!(!this.isValid()||!n.isValid())&&("millisecond"===(e=O(e)||"millisecond")?this.valueOf()<n.valueOf():this.clone().endOf(e).valueOf()<n.valueOf())},on.isBetween=function(t,e,n,r){var i=w(t)?t:_e(t),a=w(e)?e:_e(e);return!!(this.isValid()&&i.isValid()&&a.isValid())&&("("===(r=r||"()")[0]?this.isAfter(i,n):!this.isBefore(i,n))&&(")"===r[1]?this.isBefore(a,n):!this.isAfter(a,n))},on.isSame=function(t,e){var n,r=w(t)?t:_e(t);return!(!this.isValid()||!r.isValid())&&("millisecond"===(e=O(e)||"millisecond")?this.valueOf()===r.valueOf():(n=r.valueOf(),this.clone().startOf(e).valueOf()<=n&&n<=this.clone().endOf(e).valueOf()))},on.isSameOrAfter=function(t,e){return this.isSame(t,e)||this.isAfter(t,e)},on.isSameOrBefore=function(t,e){return this.isSame(t,e)||this.isBefore(t,e)},on.isValid=function(){return g(this)},on.lang=He,on.locale=Ve,on.localeData=Ge,on.max=xe,on.min=we,on.parsingFlags=function(){return h({},p(this))},on.set=function(t,e){if("object"==typeof t)for(var n=function(t){var e=[];for(var n in t)e.push({unit:n,priority:P[n]});return e.sort((function(t,e){return t.priority-e.priority})),e}(t=R(t)),r=0;r<n.length;r++)this[n[r].unit](t[n[r].unit]);else if(C(this[t=O(t)]))return this[t](e);return this},on.startOf=function(t){var e;if(void 0===(t=O(t))||"millisecond"===t||!this.isValid())return this;var n=this._isUTC?Xe:Ke;switch(t){case"year":e=n(this.year(),0,1);break;case"quarter":e=n(this.year(),this.month()-this.month()%3,1);break;case"month":e=n(this.year(),this.month(),1);break;case"week":e=n(this.year(),this.month(),this.date()-this.weekday());break;case"isoWeek":e=n(this.year(),this.month(),this.date()-(this.isoWeekday()-1));break;case"day":case"date":e=n(this.year(),this.month(),this.date());break;case"hour":e=this._d.valueOf(),e-=We(e+(this._isUTC?0:6e4*this.utcOffset()),36e5);break;case"minute":e=this._d.valueOf(),e-=We(e,6e4);break;case"second":e=this._d.valueOf(),e-=We(e,1e3)}return this._d.setTime(e),i.updateOffset(this,!0),this},on.subtract=ze,on.toArray=function(){var t=this;return[t.year(),t.month(),t.date(),t.hour(),t.minute(),t.second(),t.millisecond()]},on.toObject=function(){var t=this;return{years:t.year(),months:t.month(),date:t.date(),hours:t.hours(),minutes:t.minutes(),seconds:t.seconds(),milliseconds:t.milliseconds()}},on.toDate=function(){return new Date(this.valueOf())},on.toISOString=function(t){if(!this.isValid())return null;var e=!0!==t,n=e?this.clone().utc():this;return n.year()<0||9999<n.year()?H(n,e?"YYYYYY-MM-DD[T]HH:mm:ss.SSS[Z]":"YYYYYY-MM-DD[T]HH:mm:ss.SSSZ"):C(Date.prototype.toISOString)?e?this.toDate().toISOString():new Date(this.valueOf()+60*this.utcOffset()*1e3).toISOString().replace("Z",H(n,"Z")):H(n,e?"YYYY-MM-DD[T]HH:mm:ss.SSS[Z]":"YYYY-MM-DD[T]HH:mm:ss.SSSZ")},on.inspect=function(){if(!this.isValid())return"moment.invalid(/* "+this._i+" */)";var t="moment",e="";this.isLocal()||(t=0===this.utcOffset()?"moment.utc":"moment.parseZone",e="Z");var n="["+t+'("]',r=0<=this.year()&&this.year()<=9999?"YYYY":"YYYYYY",i=e+'[")]';return this.format(n+r+"-MM-DD[T]HH:mm:ss.SSS"+i)},on.toJSON=function(){return this.isValid()?this.toISOString():null},on.toString=function(){return this.clone().locale("en").format("ddd MMM DD YYYY HH:mm:ss [GMT]ZZ")},on.unix=function(){return Math.floor(this.valueOf()/1e3)},on.valueOf=function(){return this._d.valueOf()-6e4*(this._offset||0)},on.creationData=function(){return{input:this._i,format:this._f,locale:this._locale,isUTC:this._isUTC,strict:this._strict}},on.year=mt,on.isLeapYear=function(){return bt(this.year())},on.weekYear=function(t){return Je.call(this,t,this.week(),this.weekday(),this.localeData()._week.dow,this.localeData()._week.doy)},on.isoWeekYear=function(t){return Je.call(this,t,this.isoWeek(),this.isoWeekday(),1,4)},on.quarter=on.quarters=function(t){return null==t?Math.ceil((this.month()+1)/3):this.month(3*(t-1)+this.month()%3)},on.month=Tt,on.daysInMonth=function(){return kt(this.year(),this.month())},on.week=on.weeks=function(t){var e=this.localeData().week(this);return null==t?e:this.add(7*(t-e),"d")},on.isoWeek=on.isoWeeks=function(t){var e=Ot(this,1,4).week;return null==t?e:this.add(7*(t-e),"d")},on.weeksInYear=function(){var t=this.localeData()._week;return Rt(this.year(),t.dow,t.doy)},on.isoWeeksInYear=function(){return Rt(this.year(),1,4)},on.date=Qe,on.day=on.days=function(t){if(!this.isValid())return null!=t?this:NaN;var e,n,r=this._isUTC?this._d.getUTCDay():this._d.getDay();return null!=t?(e=t,n=this.localeData(),t="string"!=typeof e?e:isNaN(e)?"number"==typeof(e=n.weekdaysParse(e))?e:null:parseInt(e,10),this.add(t-r,"d")):r},on.weekday=function(t){if(!this.isValid())return null!=t?this:NaN;var e=(this.day()+7-this.localeData()._week.dow)%7;return null==t?e:this.add(t-e,"d")},on.isoWeekday=function(t){if(!this.isValid())return null!=t?this:NaN;if(null==t)return this.day()||7;var e,n,r=(e=t,n=this.localeData(),"string"==typeof e?n.weekdaysParse(e)%7||7:isNaN(e)?null:e);return this.day(this.day()%7?r:r-7)},on.dayOfYear=function(t){var e=Math.round((this.clone().startOf("day")-this.clone().startOf("year"))/864e5)+1;return null==t?e:this.add(t-e,"d")},on.hour=on.hours=Kt,on.minute=on.minutes=tn,on.second=on.seconds=nn,on.millisecond=on.milliseconds=an,on.utcOffset=function(t,e,n){var r,a=this._offset||0;if(!this.isValid())return null!=t?this:NaN;if(null==t)return this._isUTC?a:Ie(this);if("string"==typeof t){if(null===(t=Ce(st,t)))return this}else Math.abs(t)<16&&!n&&(t*=60);return!this._isUTC&&e&&(r=Ie(this)),this._offset=t,this._isUTC=!0,null!=r&&this.add(r,"m"),a!==t&&(!e||this._changeInProgress?je(this,Re(t-a,"m"),1,!1):this._changeInProgress||(this._changeInProgress=!0,i.updateOffset(this,!0),this._changeInProgress=null)),this},on.utc=function(t){return this.utcOffset(0,t)},on.local=function(t){return this._isUTC&&(this.utcOffset(0,t),this._isUTC=!1,t&&this.subtract(Ie(this),"m")),this},on.parseZone=function(){if(null!=this._tzm)this.utcOffset(this._tzm,!1,!0);else if("string"==typeof this._i){var t=Ce(ot,this._i);null!=t?this.utcOffset(t):this.utcOffset(0,!0)}return this},on.hasAlignedHourOffset=function(t){return!!this.isValid()&&(t=t?_e(t).utcOffset():0,(this.utcOffset()-t)%60==0)},on.isDST=function(){return this.utcOffset()>this.clone().month(0).utcOffset()||this.utcOffset()>this.clone().month(5).utcOffset()},on.isLocal=function(){return!!this.isValid()&&!this._isUTC},on.isUtcOffset=function(){return!!this.isValid()&&this._isUTC},on.isUtc=Le,on.isUTC=Le,on.zoneAbbr=function(){return this._isUTC?"UTC":""},on.zoneName=function(){return this._isUTC?"Coordinated Universal Time":""},on.dates=S("dates accessor is deprecated. Use date instead.",Qe),on.months=S("months accessor is deprecated. Use month instead",Tt),on.years=S("years accessor is deprecated. Use year instead",mt),on.zone=S("moment().zone is deprecated, use moment().utcOffset instead. http://momentjs.com/guides/#/warnings/zone/",(function(t,e){return null!=t?("string"!=typeof t&&(t=-t),this.utcOffset(t,e),this):-this.utcOffset()})),on.isDSTShifted=S("isDSTShifted is deprecated. See http://momentjs.com/guides/#/warnings/dst-shifted/ for more information",(function(){if(!s(this._isDSTShifted))return this._isDSTShifted;var t={};if(v(t,this),(t=ve(t))._a){var e=t._isUTC?d(t._a):_e(t._a);this._isDSTShifted=this.isValid()&&0<E(t._a,e.toArray())}else this._isDSTShifted=!1;return this._isDSTShifted}));var un=I.prototype;function cn(t,e,n,r){var i=re(),a=d().set(r,e);return i[n](a,t)}function fn(t,e,n){if(u(t)&&(e=t,t=void 0),t=t||"",null!=e)return cn(t,e,n,"month");var r,i=[];for(r=0;r<12;r++)i[r]=cn(t,r,n,"month");return i}function ln(t,e,n,r){"boolean"==typeof t?u(e)&&(n=e,e=void 0):(e=t,t=!1,u(n=e)&&(n=e,e=void 0)),e=e||"";var i,a=re(),o=t?a._week.dow:0;if(null!=n)return cn(e,(n+o)%7,r,"day");var s=[];for(i=0;i<7;i++)s[i]=cn(e,(i+o)%7,r,"day");return s}un.calendar=function(t,e,n){var r=this._calendar[t]||this._calendar.sameElse;return C(r)?r.call(e,n):r},un.longDateFormat=function(t){var e=this._longDateFormat[t],n=this._longDateFormat[t.toUpperCase()];return e||!n?e:(this._longDateFormat[t]=n.replace(/MMMM|MM|DD|dddd/g,(function(t){return t.slice(1)})),this._longDateFormat[t])},un.invalidDate=function(){return this._invalidDate},un.ordinal=function(t){return this._ordinal.replace("%d",t)},un.preparse=sn,un.postformat=sn,un.relativeTime=function(t,e,n,r){var i=this._relativeTime[n];return C(i)?i(t,e,n,r):i.replace(/%d/i,t)},un.pastFuture=function(t,e){var n=this._relativeTime[0<t?"future":"past"];return C(n)?n(e):n.replace(/%s/i,e)},un.set=function(t){var e,n;for(n in t)C(e=t[n])?this[n]=e:this["_"+n]=e;this._config=t,this._dayOfMonthOrdinalParseLenient=new RegExp((this._dayOfMonthOrdinalParse.source||this._ordinalParse.source)+"|"+/\d{1,2}/.source)},un.months=function(t,e){return t?a(this._months)?this._months[t.month()]:this._months[(this._months.isFormat||Et).test(e)?"format":"standalone"][t.month()]:a(this._months)?this._months:this._months.standalone},un.monthsShort=function(t,e){return t?a(this._monthsShort)?this._monthsShort[t.month()]:this._monthsShort[Et.test(e)?"format":"standalone"][t.month()]:a(this._monthsShort)?this._monthsShort:this._monthsShort.standalone},un.monthsParse=function(t,e,n){var r,i,a;if(this._monthsParseExact)return function(t,e,n){var r,i,a,o=t.toLocaleLowerCase();if(!this._monthsParse)for(this._monthsParse=[],this._longMonthsParse=[],this._shortMonthsParse=[],r=0;r<12;++r)a=d([2e3,r]),this._shortMonthsParse[r]=this.monthsShort(a,"").toLocaleLowerCase(),this._longMonthsParse[r]=this.months(a,"").toLocaleLowerCase();return n?"MMM"===e?-1!==(i=vt.call(this._shortMonthsParse,o))?i:null:-1!==(i=vt.call(this._longMonthsParse,o))?i:null:"MMM"===e?-1!==(i=vt.call(this._shortMonthsParse,o))?i:-1!==(i=vt.call(this._longMonthsParse,o))?i:null:-1!==(i=vt.call(this._longMonthsParse,o))?i:-1!==(i=vt.call(this._shortMonthsParse,o))?i:null}.call(this,t,e,n);for(this._monthsParse||(this._monthsParse=[],this._longMonthsParse=[],this._shortMonthsParse=[]),r=0;r<12;r++){if(i=d([2e3,r]),n&&!this._longMonthsParse[r]&&(this._longMonthsParse[r]=new RegExp("^"+this.months(i,"").replace(".","")+"$","i"),this._shortMonthsParse[r]=new RegExp("^"+this.monthsShort(i,"").replace(".","")+"$","i")),n||this._monthsParse[r]||(a="^"+this.months(i,"")+"|^"+this.monthsShort(i,""),this._monthsParse[r]=new RegExp(a.replace(".",""),"i")),n&&"MMMM"===e&&this._longMonthsParse[r].test(t))return r;if(n&&"MMM"===e&&this._shortMonthsParse[r].test(t))return r;if(!n&&this._monthsParse[r].test(t))return r}},un.monthsRegex=function(t){return this._monthsParseExact?(l(this,"_monthsRegex")||Nt.call(this),t?this._monthsStrictRegex:this._monthsRegex):(l(this,"_monthsRegex")||(this._monthsRegex=Ct),this._monthsStrictRegex&&t?this._monthsStrictRegex:this._monthsRegex)},un.monthsShortRegex=function(t){return this._monthsParseExact?(l(this,"_monthsRegex")||Nt.call(this),t?this._monthsShortStrictRegex:this._monthsShortRegex):(l(this,"_monthsShortRegex")||(this._monthsShortRegex=Dt),this._monthsShortStrictRegex&&t?this._monthsShortStrictRegex:this._monthsShortRegex)},un.week=function(t){return Ot(t,this._week.dow,this._week.doy).week},un.firstDayOfYear=function(){return this._week.doy},un.firstDayOfWeek=function(){return this._week.dow},un.weekdays=function(t,e){var n=a(this._weekdays)?this._weekdays:this._weekdays[t&&!0!==t&&this._weekdays.isFormat.test(e)?"format":"standalone"];return!0===t?Pt(n,this._week.dow):t?n[t.day()]:n},un.weekdaysMin=function(t){return!0===t?Pt(this._weekdaysMin,this._week.dow):t?this._weekdaysMin[t.day()]:this._weekdaysMin},un.weekdaysShort=function(t){return!0===t?Pt(this._weekdaysShort,this._week.dow):t?this._weekdaysShort[t.day()]:this._weekdaysShort},un.weekdaysParse=function(t,e,n){var r,i,a;if(this._weekdaysParseExact)return function(t,e,n){var r,i,a,o=t.toLocaleLowerCase();if(!this._weekdaysParse)for(this._weekdaysParse=[],this._shortWeekdaysParse=[],this._minWeekdaysParse=[],r=0;r<7;++r)a=d([2e3,1]).day(r),this._minWeekdaysParse[r]=this.weekdaysMin(a,"").toLocaleLowerCase(),this._shortWeekdaysParse[r]=this.weekdaysShort(a,"").toLocaleLowerCase(),this._weekdaysParse[r]=this.weekdays(a,"").toLocaleLowerCase();return n?"dddd"===e?-1!==(i=vt.call(this._weekdaysParse,o))?i:null:"ddd"===e?-1!==(i=vt.call(this._shortWeekdaysParse,o))?i:null:-1!==(i=vt.call(this._minWeekdaysParse,o))?i:null:"dddd"===e?-1!==(i=vt.call(this._weekdaysParse,o))?i:-1!==(i=vt.call(this._shortWeekdaysParse,o))?i:-1!==(i=vt.call(this._minWeekdaysParse,o))?i:null:"ddd"===e?-1!==(i=vt.call(this._shortWeekdaysParse,o))?i:-1!==(i=vt.call(this._weekdaysParse,o))?i:-1!==(i=vt.call(this._minWeekdaysParse,o))?i:null:-1!==(i=vt.call(this._minWeekdaysParse,o))?i:-1!==(i=vt.call(this._weekdaysParse,o))?i:-1!==(i=vt.call(this._shortWeekdaysParse,o))?i:null}.call(this,t,e,n);for(this._weekdaysParse||(this._weekdaysParse=[],this._minWeekdaysParse=[],this._shortWeekdaysParse=[],this._fullWeekdaysParse=[]),r=0;r<7;r++){if(i=d([2e3,1]).day(r),n&&!this._fullWeekdaysParse[r]&&(this._fullWeekdaysParse[r]=new RegExp("^"+this.weekdays(i,"").replace(".","\\.?")+"$","i"),this._shortWeekdaysParse[r]=new RegExp("^"+this.weekdaysShort(i,"").replace(".","\\.?")+"$","i"),this._minWeekdaysParse[r]=new RegExp("^"+this.weekdaysMin(i,"").replace(".","\\.?")+"$","i")),this._weekdaysParse[r]||(a="^"+this.weekdays(i,"")+"|^"+this.weekdaysShort(i,"")+"|^"+this.weekdaysMin(i,""),this._weekdaysParse[r]=new RegExp(a.replace(".",""),"i")),n&&"dddd"===e&&this._fullWeekdaysParse[r].test(t))return r;if(n&&"ddd"===e&&this._shortWeekdaysParse[r].test(t))return r;if(n&&"dd"===e&&this._minWeekdaysParse[r].test(t))return r;if(!n&&this._weekdaysParse[r].test(t))return r}},un.weekdaysRegex=function(t){return this._weekdaysParseExact?(l(this,"_weekdaysRegex")||Vt.call(this),t?this._weekdaysStrictRegex:this._weekdaysRegex):(l(this,"_weekdaysRegex")||(this._weekdaysRegex=Ut),this._weekdaysStrictRegex&&t?this._weekdaysStrictRegex:this._weekdaysRegex)},un.weekdaysShortRegex=function(t){return this._weekdaysParseExact?(l(this,"_weekdaysRegex")||Vt.call(this),t?this._weekdaysShortStrictRegex:this._weekdaysShortRegex):(l(this,"_weekdaysShortRegex")||(this._weekdaysShortRegex=zt),this._weekdaysShortStrictRegex&&t?this._weekdaysShortStrictRegex:this._weekdaysShortRegex)},un.weekdaysMinRegex=function(t){return this._weekdaysParseExact?(l(this,"_weekdaysRegex")||Vt.call(this),t?this._weekdaysMinStrictRegex:this._weekdaysMinRegex):(l(this,"_weekdaysMinRegex")||(this._weekdaysMinRegex=Yt),this._weekdaysMinStrictRegex&&t?this._weekdaysMinStrictRegex:this._weekdaysMinRegex)},un.isPM=function(t){return"p"===(t+"").toLowerCase().charAt(0)},un.meridiem=function(t,e,n){return 11<t?n?"pm":"PM":n?"am":"AM"},ee("en",{dayOfMonthOrdinalParse:/\d{1,2}(th|st|nd|rd)/,ordinal:function(t){var e=t%10;return t+(1===k(t%100/10)?"th":1===e?"st":2===e?"nd":3===e?"rd":"th")}}),i.lang=S("moment.lang is deprecated. Use moment.locale instead.",ee),i.langData=S("moment.langData is deprecated. Use moment.localeData instead.",re);var hn=Math.abs;function dn(t,e,n,r){var i=Re(e,n);return t._milliseconds+=r*i._milliseconds,t._days+=r*i._days,t._months+=r*i._months,t._bubble()}function pn(t){return t<0?Math.floor(t):Math.ceil(t)}function gn(t){return 4800*t/146097}function yn(t){return 146097*t/4800}function bn(t){return function(){return this.as(t)}}var vn=bn("ms"),mn=bn("s"),_n=bn("m"),wn=bn("h"),xn=bn("d"),kn=bn("w"),En=bn("M"),An=bn("Q"),Sn=bn("y");function Mn(t){return function(){return this.isValid()?this._data[t]:NaN}}var Tn=Mn("milliseconds"),Dn=Mn("seconds"),Cn=Mn("minutes"),Nn=Mn("hours"),In=Mn("days"),Ln=Mn("months"),Bn=Mn("years"),On=Math.round,Rn={ss:44,s:45,m:45,h:22,d:26,M:11},Pn=Math.abs;function Fn(t){return(0<t)-(t<0)||+t}function qn(){if(!this.isValid())return this.localeData().invalidDate();var t,e,n=Pn(this._milliseconds)/1e3,r=Pn(this._days),i=Pn(this._months);e=x((t=x(n/60))/60),n%=60,t%=60;var a=x(i/12),o=i%=12,s=r,u=e,c=t,f=n?n.toFixed(3).replace(/\.?0+$/,""):"",l=this.asSeconds();if(!l)return"P0D";var h=l<0?"-":"",d=Fn(this._months)!==Fn(l)?"-":"",p=Fn(this._days)!==Fn(l)?"-":"",g=Fn(this._milliseconds)!==Fn(l)?"-":"";return h+"P"+(a?d+a+"Y":"")+(o?d+o+"M":"")+(s?p+s+"D":"")+(u||c||f?"T":"")+(u?g+u+"H":"")+(c?g+c+"M":"")+(f?g+f+"S":"")}var jn=Ae.prototype;return jn.isValid=function(){return this._isValid},jn.abs=function(){var t=this._data;return this._milliseconds=hn(this._milliseconds),this._days=hn(this._days),this._months=hn(this._months),t.milliseconds=hn(t.milliseconds),t.seconds=hn(t.seconds),t.minutes=hn(t.minutes),t.hours=hn(t.hours),t.months=hn(t.months),t.years=hn(t.years),this},jn.add=function(t,e){return dn(this,t,e,1)},jn.subtract=function(t,e){return dn(this,t,e,-1)},jn.as=function(t){if(!this.isValid())return NaN;var e,n,r=this._milliseconds;if("month"===(t=O(t))||"quarter"===t||"year"===t)switch(e=this._days+r/864e5,n=this._months+gn(e),t){case"month":return n;case"quarter":return n/3;case"year":return n/12}else switch(e=this._days+Math.round(yn(this._months)),t){case"week":return e/7+r/6048e5;case"day":return e+r/864e5;case"hour":return 24*e+r/36e5;case"minute":return 1440*e+r/6e4;case"second":return 86400*e+r/1e3;case"millisecond":return Math.floor(864e5*e)+r;default:throw new Error("Unknown unit "+t)}},jn.asMilliseconds=vn,jn.asSeconds=mn,jn.asMinutes=_n,jn.asHours=wn,jn.asDays=xn,jn.asWeeks=kn,jn.asMonths=En,jn.asQuarters=An,jn.asYears=Sn,jn.valueOf=function(){return this.isValid()?this._milliseconds+864e5*this._days+this._months%12*2592e6+31536e6*k(this._months/12):NaN},jn._bubble=function(){var t,e,n,r,i,a=this._milliseconds,o=this._days,s=this._months,u=this._data;return 0<=a&&0<=o&&0<=s||a<=0&&o<=0&&s<=0||(a+=864e5*pn(yn(s)+o),s=o=0),u.milliseconds=a%1e3,t=x(a/1e3),u.seconds=t%60,e=x(t/60),u.minutes=e%60,n=x(e/60),u.hours=n%24,s+=i=x(gn(o+=x(n/24))),o-=pn(yn(i)),r=x(s/12),s%=12,u.days=o,u.months=s,u.years=r,this},jn.clone=function(){return Re(this)},jn.get=function(t){return t=O(t),this.isValid()?this[t+"s"]():NaN},jn.milliseconds=Tn,jn.seconds=Dn,jn.minutes=Cn,jn.hours=Nn,jn.days=In,jn.weeks=function(){return x(this.days()/7)},jn.months=Ln,jn.years=Bn,jn.humanize=function(t){if(!this.isValid())return this.localeData().invalidDate();var e,n,r,i,a,o,s,u,c,f,l=this.localeData(),h=(e=!t,n=l,r=Re(this).abs(),i=On(r.as("s")),a=On(r.as("m")),o=On(r.as("h")),s=On(r.as("d")),u=On(r.as("M")),c=On(r.as("y")),(f=i<=Rn.ss&&["s",i]||i<Rn.s&&["ss",i]||a<=1&&["m"]||a<Rn.m&&["mm",a]||o<=1&&["h"]||o<Rn.h&&["hh",o]||s<=1&&["d"]||s<Rn.d&&["dd",s]||u<=1&&["M"]||u<Rn.M&&["MM",u]||c<=1&&["y"]||["yy",c])[2]=e,f[3]=0<+this,f[4]=n,function(t,e,n,r,i){return i.relativeTime(e||1,!!n,t,r)}.apply(null,f));return t&&(h=l.pastFuture(+this,h)),l.postformat(h)},jn.toISOString=qn,jn.toString=qn,jn.toJSON=qn,jn.locale=Ve,jn.localeData=Ge,jn.toIsoString=S("toIsoString() is deprecated. Please use toISOString() instead (notice the capitals)",qn),jn.lang=He,V("X",0,0,"unix"),V("x",0,0,"valueOf"),ft("x",at),ft("X",/[+-]?\d+(\.\d{1,3})?/),pt("X",(function(t,e,n){n._d=new Date(1e3*parseFloat(t,10))})),pt("x",(function(t,e,n){n._d=new Date(k(t))})),i.version="2.24.0",e=_e,i.fn=on,i.min=function(){return ke("isBefore",[].slice.call(arguments,0))},i.max=function(){return ke("isAfter",[].slice.call(arguments,0))},i.now=function(){return Date.now?Date.now():+new Date},i.utc=d,i.unix=function(t){return _e(1e3*t)},i.months=function(t,e){return fn(t,e,"months")},i.isDate=c,i.locale=ee,i.invalid=y,i.duration=Re,i.isMoment=w,i.weekdays=function(t,e,n){return ln(t,e,n,"weekdays")},i.parseZone=function(){return _e.apply(null,arguments).parseZone()},i.localeData=re,i.isDuration=Se,i.monthsShort=function(t,e){return fn(t,e,"monthsShort")},i.weekdaysMin=function(t,e,n){return ln(t,e,n,"weekdaysMin")},i.defineLocale=ne,i.updateLocale=function(t,e){if(null!=e){var n,r,i=Xt;null!=(r=te(t))&&(i=r._config),(n=new I(e=N(i,e))).parentLocale=Zt[t],Zt[t]=n,ee(t)}else null!=Zt[t]&&(null!=Zt[t].parentLocale?Zt[t]=Zt[t].parentLocale:null!=Zt[t]&&delete Zt[t]);return Zt[t]},i.locales=function(){return M(Zt)},i.weekdaysShort=function(t,e,n){return ln(t,e,n,"weekdaysShort")},i.normalizeUnits=O,i.relativeTimeRounding=function(t){return void 0===t?On:"function"==typeof t&&(On=t,!0)},i.relativeTimeThreshold=function(t,e){return void 0!==Rn[t]&&(void 0===e?Rn[t]:(Rn[t]=e,"s"===t&&(Rn.ss=e-1),!0))},i.calendarFormat=function(t,e){var n=t.diff(e,"days",!0);return n<-6?"sameElse":n<-1?"lastWeek":n<0?"lastDay":n<1?"sameDay":n<2?"nextDay":n<7?"nextWeek":"sameElse"},i.prototype=on,i.HTML5_FMT={DATETIME_LOCAL:"YYYY-MM-DDTHH:mm",DATETIME_LOCAL_SECONDS:"YYYY-MM-DDTHH:mm:ss",DATETIME_LOCAL_MS:"YYYY-MM-DDTHH:mm:ss.SSS",DATE:"YYYY-MM-DD",TIME:"HH:mm",TIME_SECONDS:"HH:mm:ss",TIME_MS:"HH:mm:ss.SSS",WEEK:"GGGG-[W]WW",MONTH:"YYYY-MM"},i}()}).call(this,n(9)(t))},function(t,e,n){var r=n(37),i=n(93);t.exports=function(t){return null!=t&&i(t.length)&&!r(t)}},function(t,e,n){var r=n(293),i=n(303),a=n(34),o=n(6),s=n(310);t.exports=function(t){return"function"==typeof t?t:null==t?a:"object"==typeof t?o(t)?i(t[0],t[1]):r(t):s(t)}},function(t,e,n){var r=n(236);t.exports={Graph:r.Graph,json:n(338),alg:n(339),version:r.version}},function(t,e,n){(function(t,r){var i=function(){var t=function(t,e,n,r){for(n=n||{},r=t.length;r--;n[t[r]]=e);return n},e=[6,8,10,11,12,13,14,15,16,18,20],n=[1,9],r=[1,10],i=[1,11],a=[1,12],o=[1,13],s=[1,14],u=[1,16],c=[1,17],f={trace:function(){},yy:{},symbols_:{error:2,start:3,gantt:4,document:5,EOF:6,line:7,SPACE:8,statement:9,NL:10,dateFormat:11,inclusiveEndDates:12,axisFormat:13,excludes:14,title:15,section:16,clickStatement:17,taskTxt:18,taskData:19,click:20,callbackname:21,callbackargs:22,href:23,clickStatementDebug:24,$accept:0,$end:1},terminals_:{2:"error",4:"gantt",6:"EOF",8:"SPACE",10:"NL",11:"dateFormat",12:"inclusiveEndDates",13:"axisFormat",14:"excludes",15:"title",16:"section",18:"taskTxt",19:"taskData",20:"click",21:"callbackname",22:"callbackargs",23:"href"},productions_:[0,[3,3],[5,0],[5,2],[7,2],[7,1],[7,1],[7,1],[9,1],[9,1],[9,1],[9,1],[9,1],[9,1],[9,1],[9,2],[17,2],[17,3],[17,3],[17,4],[17,3],[17,4],[17,2],[24,2],[24,3],[24,3],[24,4],[24,3],[24,4],[24,2]],performAction:function(t,e,n,r,i,a,o){var s=a.length-1;switch(i){case 1:return a[s-1];case 2:this.$=[];break;case 3:a[s-1].push(a[s]),this.$=a[s-1];break;case 4:case 5:this.$=a[s];break;case 6:case 7:this.$=[];break;case 8:r.setDateFormat(a[s].substr(11)),this.$=a[s].substr(11);break;case 9:r.enableInclusiveEndDates(),this.$=a[s].substr(18);break;case 10:r.setAxisFormat(a[s].substr(11)),this.$=a[s].substr(11);break;case 11:r.setExcludes(a[s].substr(9)),this.$=a[s].substr(9);break;case 12:r.setTitle(a[s].substr(6)),this.$=a[s].substr(6);break;case 13:r.addSection(a[s].substr(8)),this.$=a[s].substr(8);break;case 15:r.addTask(a[s-1],a[s]),this.$="task";break;case 16:this.$=a[s-1],r.setClickEvent(a[s-1],a[s],null);break;case 17:this.$=a[s-2],r.setClickEvent(a[s-2],a[s-1],a[s]);break;case 18:this.$=a[s-2],r.setClickEvent(a[s-2],a[s-1],null),r.setLink(a[s-2],a[s]);break;case 19:this.$=a[s-3],r.setClickEvent(a[s-3],a[s-2],a[s-1]),r.setLink(a[s-3],a[s]);break;case 20:this.$=a[s-2],r.setClickEvent(a[s-2],a[s],null),r.setLink(a[s-2],a[s-1]);break;case 21:this.$=a[s-3],r.setClickEvent(a[s-3],a[s-1],a[s]),r.setLink(a[s-3],a[s-2]);break;case 22:this.$=a[s-1],r.setLink(a[s-1],a[s]);break;case 23:case 29:this.$=a[s-1]+" "+a[s];break;case 24:case 25:case 27:this.$=a[s-2]+" "+a[s-1]+" "+a[s];break;case 26:case 28:this.$=a[s-3]+" "+a[s-2]+" "+a[s-1]+" "+a[s]}},table:[{3:1,4:[1,2]},{1:[3]},t(e,[2,2],{5:3}),{6:[1,4],7:5,8:[1,6],9:7,10:[1,8],11:n,12:r,13:i,14:a,15:o,16:s,17:15,18:u,20:c},t(e,[2,7],{1:[2,1]}),t(e,[2,3]),{9:18,11:n,12:r,13:i,14:a,15:o,16:s,17:15,18:u,20:c},t(e,[2,5]),t(e,[2,6]),t(e,[2,8]),t(e,[2,9]),t(e,[2,10]),t(e,[2,11]),t(e,[2,12]),t(e,[2,13]),t(e,[2,14]),{19:[1,19]},{21:[1,20],23:[1,21]},t(e,[2,4]),t(e,[2,15]),t(e,[2,16],{22:[1,22],23:[1,23]}),t(e,[2,22],{21:[1,24]}),t(e,[2,17],{23:[1,25]}),t(e,[2,18]),t(e,[2,20],{22:[1,26]}),t(e,[2,19]),t(e,[2,21])],defaultActions:{},parseError:function(t,e){if(!e.recoverable){var n=new Error(t);throw n.hash=e,n}this.trace(t)},parse:function(t){var e=this,n=[0],r=[],i=[null],a=[],o=this.table,s="",u=0,c=0,f=0,l=2,h=1,d=a.slice.call(arguments,1),p=Object.create(this.lexer),g={yy:{}};for(var y in this.yy)Object.prototype.hasOwnProperty.call(this.yy,y)&&(g.yy[y]=this.yy[y]);p.setInput(t,g.yy),g.yy.lexer=p,g.yy.parser=this,void 0===p.yylloc&&(p.yylloc={});var b=p.yylloc;a.push(b);var v=p.options&&p.options.ranges;function m(){var t;return"number"!=typeof(t=r.pop()||p.lex()||h)&&(t instanceof Array&&(t=(r=t).pop()),t=e.symbols_[t]||t),t}"function"==typeof g.yy.parseError?this.parseError=g.yy.parseError:this.parseError=Object.getPrototypeOf(this).parseError;for(var _,w,x,k,E,A,S,M,T,D={};;){if(x=n[n.length-1],this.defaultActions[x]?k=this.defaultActions[x]:(null==_&&(_=m()),k=o[x]&&o[x][_]),void 0===k||!k.length||!k[0]){var C="";for(A in T=[],o[x])this.terminals_[A]&&A>l&&T.push("'"+this.terminals_[A]+"'");C=p.showPosition?"Parse error on line "+(u+1)+":\n"+p.showPosition()+"\nExpecting "+T.join(", ")+", got '"+(this.terminals_[_]||_)+"'":"Parse error on line "+(u+1)+": Unexpected "+(_==h?"end of input":"'"+(this.terminals_[_]||_)+"'"),this.parseError(C,{text:p.match,token:this.terminals_[_]||_,line:p.yylineno,loc:b,expected:T})}if(k[0]instanceof Array&&k.length>1)throw new Error("Parse Error: multiple actions possible at state: "+x+", token: "+_);switch(k[0]){case 1:n.push(_),i.push(p.yytext),a.push(p.yylloc),n.push(k[1]),_=null,w?(_=w,w=null):(c=p.yyleng,s=p.yytext,u=p.yylineno,b=p.yylloc,f>0&&f--);break;case 2:if(S=this.productions_[k[1]][1],D.$=i[i.length-S],D._$={first_line:a[a.length-(S||1)].first_line,last_line:a[a.length-1].last_line,first_column:a[a.length-(S||1)].first_column,last_column:a[a.length-1].last_column},v&&(D._$.range=[a[a.length-(S||1)].range[0],a[a.length-1].range[1]]),void 0!==(E=this.performAction.apply(D,[s,c,u,g.yy,k[1],i,a].concat(d))))return E;S&&(n=n.slice(0,-1*S*2),i=i.slice(0,-1*S),a=a.slice(0,-1*S)),n.push(this.productions_[k[1]][0]),i.push(D.$),a.push(D._$),M=o[n[n.length-2]][n[n.length-1]],n.push(M);break;case 3:return!0}}return!0}},l={EOF:1,parseError:function(t,e){if(!this.yy.parser)throw new Error(t);this.yy.parser.parseError(t,e)},setInput:function(t,e){return this.yy=e||this.yy||{},this._input=t,this._more=this._backtrack=this.done=!1,this.yylineno=this.yyleng=0,this.yytext=this.matched=this.match="",this.conditionStack=["INITIAL"],this.yylloc={first_line:1,first_column:0,last_line:1,last_column:0},this.options.ranges&&(this.yylloc.range=[0,0]),this.offset=0,this},input:function(){var t=this._input[0];return this.yytext+=t,this.yyleng++,this.offset++,this.match+=t,this.matched+=t,t.match(/(?:\r\n?|\n).*/g)?(this.yylineno++,this.yylloc.last_line++):this.yylloc.last_column++,this.options.ranges&&this.yylloc.range[1]++,this._input=this._input.slice(1),t},unput:function(t){var e=t.length,n=t.split(/(?:\r\n?|\n)/g);this._input=t+this._input,this.yytext=this.yytext.substr(0,this.yytext.length-e),this.offset-=e;var r=this.match.split(/(?:\r\n?|\n)/g);this.match=this.match.substr(0,this.match.length-1),this.matched=this.matched.substr(0,this.matched.length-1),n.length-1&&(this.yylineno-=n.length-1);var i=this.yylloc.range;return this.yylloc={first_line:this.yylloc.first_line,last_line:this.yylineno+1,first_column:this.yylloc.first_column,last_column:n?(n.length===r.length?this.yylloc.first_column:0)+r[r.length-n.length].length-n[0].length:this.yylloc.first_column-e},this.options.ranges&&(this.yylloc.range=[i[0],i[0]+this.yyleng-e]),this.yyleng=this.yytext.length,this},more:function(){return this._more=!0,this},reject:function(){return this.options.backtrack_lexer?(this._backtrack=!0,this):this.parseError("Lexical error on line "+(this.yylineno+1)+". You can only invoke reject() in the lexer when the lexer is of the backtracking persuasion (options.backtrack_lexer = true).\n"+this.showPosition(),{text:"",token:null,line:this.yylineno})},less:function(t){this.unput(this.match.slice(t))},pastInput:function(){var t=this.matched.substr(0,this.matched.length-this.match.length);return(t.length>20?"...":"")+t.substr(-20).replace(/\n/g,"")},upcomingInput:function(){var t=this.match;return t.length<20&&(t+=this._input.substr(0,20-t.length)),(t.substr(0,20)+(t.length>20?"...":"")).replace(/\n/g,"")},showPosition:function(){var t=this.pastInput(),e=new Array(t.length+1).join("-");return t+this.upcomingInput()+"\n"+e+"^"},test_match:function(t,e){var n,r,i;if(this.options.backtrack_lexer&&(i={yylineno:this.yylineno,yylloc:{first_line:this.yylloc.first_line,last_line:this.last_line,first_column:this.yylloc.first_column,last_column:this.yylloc.last_column},yytext:this.yytext,match:this.match,matches:this.matches,matched:this.matched,yyleng:this.yyleng,offset:this.offset,_more:this._more,_input:this._input,yy:this.yy,conditionStack:this.conditionStack.slice(0),done:this.done},this.options.ranges&&(i.yylloc.range=this.yylloc.range.slice(0))),(r=t[0].match(/(?:\r\n?|\n).*/g))&&(this.yylineno+=r.length),this.yylloc={first_line:this.yylloc.last_line,last_line:this.yylineno+1,first_column:this.yylloc.last_column,last_column:r?r[r.length-1].length-r[r.length-1].match(/\r?\n?/)[0].length:this.yylloc.last_column+t[0].length},this.yytext+=t[0],this.match+=t[0],this.matches=t,this.yyleng=this.yytext.length,this.options.ranges&&(this.yylloc.range=[this.offset,this.offset+=this.yyleng]),this._more=!1,this._backtrack=!1,this._input=this._input.slice(t[0].length),this.matched+=t[0],n=this.performAction.call(this,this.yy,this,e,this.conditionStack[this.conditionStack.length-1]),this.done&&this._input&&(this.done=!1),n)return n;if(this._backtrack){for(var a in i)this[a]=i[a];return!1}return!1},next:function(){if(this.done)return this.EOF;var t,e,n,r;this._input||(this.done=!0),this._more||(this.yytext="",this.match="");for(var i=this._currentRules(),a=0;a<i.length;a++)if((n=this._input.match(this.rules[i[a]]))&&(!e||n[0].length>e[0].length)){if(e=n,r=a,this.options.backtrack_lexer){if(!1!==(t=this.test_match(n,i[a])))return t;if(this._backtrack){e=!1;continue}return!1}if(!this.options.flex)break}return e?!1!==(t=this.test_match(e,i[r]))&&t:""===this._input?this.EOF:this.parseError("Lexical error on line "+(this.yylineno+1)+". Unrecognized text.\n"+this.showPosition(),{text:"",token:null,line:this.yylineno})},lex:function(){var t=this.next();return t||this.lex()},begin:function(t){this.conditionStack.push(t)},popState:function(){return this.conditionStack.length-1>0?this.conditionStack.pop():this.conditionStack[0]},_currentRules:function(){return this.conditionStack.length&&this.conditionStack[this.conditionStack.length-1]?this.conditions[this.conditionStack[this.conditionStack.length-1]].rules:this.conditions.INITIAL.rules},topState:function(t){return(t=this.conditionStack.length-1-Math.abs(t||0))>=0?this.conditionStack[t]:"INITIAL"},pushState:function(t){this.begin(t)},stateStackSize:function(){return this.conditionStack.length},options:{"case-insensitive":!0},performAction:function(t,e,n,r){switch(n){case 0:return 10;case 1:case 2:case 3:break;case 4:this.begin("href");break;case 5:this.popState();break;case 6:return 23;case 7:this.begin("callbackname");break;case 8:this.popState();break;case 9:this.popState(),this.begin("callbackargs");break;case 10:return 21;case 11:this.popState();break;case 12:return 22;case 13:this.begin("click");break;case 14:this.popState();break;case 15:return 20;case 16:return 4;case 17:return 11;case 18:return 12;case 19:return 13;case 20:return 14;case 21:return"date";case 22:return 15;case 23:return 16;case 24:return 18;case 25:return 19;case 26:return":";case 27:return 6;case 28:return"INVALID"}},rules:[/^(?:[\n]+)/i,/^(?:\s+)/i,/^(?:#[^\n]*)/i,/^(?:%[^\n]*)/i,/^(?:href[\s]+["])/i,/^(?:["])/i,/^(?:[^"]*)/i,/^(?:call[\s]+)/i,/^(?:\([\s]*\))/i,/^(?:\()/i,/^(?:[^(]*)/i,/^(?:\))/i,/^(?:[^)]*)/i,/^(?:click[\s]+)/i,/^(?:[\s\n])/i,/^(?:[^\s\n]*)/i,/^(?:gantt\b)/i,/^(?:dateFormat\s[^#\n;]+)/i,/^(?:inclusiveEndDates\b)/i,/^(?:axisFormat\s[^#\n;]+)/i,/^(?:excludes\s[^#\n;]+)/i,/^(?:\d\d\d\d-\d\d-\d\d\b)/i,/^(?:title\s[^#\n;]+)/i,/^(?:section\s[^#:\n;]+)/i,/^(?:[^#:\n;]+)/i,/^(?::[^#\n;]+)/i,/^(?::)/i,/^(?:$)/i,/^(?:.)/i],conditions:{callbackargs:{rules:[11,12],inclusive:!1},callbackname:{rules:[8,9,10],inclusive:!1},href:{rules:[5,6],inclusive:!1},click:{rules:[14,15],inclusive:!1},INITIAL:{rules:[0,1,2,3,4,7,13,16,17,18,19,20,21,22,23,24,25,26,27,28],inclusive:!0}}};function h(){this.yy={}}return f.lexer=l,h.prototype=f,f.Parser=h,new h}();e.parser=i,e.Parser=i.Parser,e.parse=function(){return i.parse.apply(i,arguments)},e.main=function(r){r[1]||(console.log("Usage: "+r[0]+" FILE"),t.exit(1));var i=n(28).readFileSync(n(29).normalize(r[1]),"utf8");return e.parser.parse(i)},n.c[n.s]===r&&e.main(t.argv.slice(1))}).call(this,n(7),n(9)(t))},function(t,e,n){var r=n(134),i=n(95),a=n(23);t.exports=function(t){return a(t)?r(t):i(t)}},function(t,e){},function(t,e,n){(function(t){function n(t,e){for(var n=0,r=t.length-1;r>=0;r--){var i=t[r];"."===i?t.splice(r,1):".."===i?(t.splice(r,1),n++):n&&(t.splice(r,1),n--)}if(e)for(;n--;n)t.unshift("..");return t}function r(t,e){if(t.filter)return t.filter(e);for(var n=[],r=0;r<t.length;r++)e(t[r],r,t)&&n.push(t[r]);return n}e.resolve=function(){for(var e="",i=!1,a=arguments.length-1;a>=-1&&!i;a--){var o=a>=0?arguments[a]:t.cwd();if("string"!=typeof o)throw new TypeError("Arguments to path.resolve must be strings");o&&(e=o+"/"+e,i="/"===o.charAt(0))}return(i?"/":"")+(e=n(r(e.split("/"),(function(t){return!!t})),!i).join("/"))||"."},e.normalize=function(t){var a=e.isAbsolute(t),o="/"===i(t,-1);return(t=n(r(t.split("/"),(function(t){return!!t})),!a).join("/"))||a||(t="."),t&&o&&(t+="/"),(a?"/":"")+t},e.isAbsolute=function(t){return"/"===t.charAt(0)},e.join=function(){var t=Array.prototype.slice.call(arguments,0);return e.normalize(r(t,(function(t,e){if("string"!=typeof t)throw new TypeError("Arguments to path.join must be strings");return t})).join("/"))},e.relative=function(t,n){function r(t){for(var e=0;e<t.length&&""===t[e];e++);for(var n=t.length-1;n>=0&&""===t[n];n--);return e>n?[]:t.slice(e,n-e+1)}t=e.resolve(t).substr(1),n=e.resolve(n).substr(1);for(var i=r(t.split("/")),a=r(n.split("/")),o=Math.min(i.length,a.length),s=o,u=0;u<o;u++)if(i[u]!==a[u]){s=u;break}var c=[];for(u=s;u<i.length;u++)c.push("..");return(c=c.concat(a.slice(s))).join("/")},e.sep="/",e.delimiter=":",e.dirname=function(t){if("string"!=typeof t&&(t+=""),0===t.length)return".";for(var e=t.charCodeAt(0),n=47===e,r=-1,i=!0,a=t.length-1;a>=1;--a)if(47===(e=t.charCodeAt(a))){if(!i){r=a;break}}else i=!1;return-1===r?n?"/":".":n&&1===r?"/":t.slice(0,r)},e.basename=function(t,e){var n=function(t){"string"!=typeof t&&(t+="");var e,n=0,r=-1,i=!0;for(e=t.length-1;e>=0;--e)if(47===t.charCodeAt(e)){if(!i){n=e+1;break}}else-1===r&&(i=!1,r=e+1);return-1===r?"":t.slice(n,r)}(t);return e&&n.substr(-1*e.length)===e&&(n=n.substr(0,n.length-e.length)),n},e.extname=function(t){"string"!=typeof t&&(t+="");for(var e=-1,n=0,r=-1,i=!0,a=0,o=t.length-1;o>=0;--o){var s=t.charCodeAt(o);if(47!==s)-1===r&&(i=!1,r=o+1),46===s?-1===e?e=o:1!==a&&(a=1):-1!==e&&(a=-1);else if(!i){n=o+1;break}}return-1===e||-1===r||0===a||1===a&&e===r-1&&e===n+1?"":t.slice(e,r)};var i="b"==="ab".substr(-1)?function(t,e,n){return t.substr(e,n)}:function(t,e,n){return e<0&&(e=t.length+e),t.substr(e,n)}}).call(this,n(7))},function(t,e,n){var r;if(!r)try{r=n(0)}catch(t){}r||(r=window.d3),t.exports=r},function(t,e,n){var r=n(3).Buffer,i=n(112).Transform,a=n(117).StringDecoder;function o(t){i.call(this),this.hashMode="string"==typeof t,this.hashMode?this[t]=this._finalOrDigest:this.final=this._finalOrDigest,this._final&&(this.__final=this._final,this._final=null),this._decoder=null,this._encoding=null}n(2)(o,i),o.prototype.update=function(t,e,n){"string"==typeof t&&(t=r.from(t,e));var i=this._update(t);return this.hashMode?this:(n&&(i=this._toString(i,n)),i)},o.prototype.setAutoPadding=function(){},o.prototype.getAuthTag=function(){throw new Error("trying to get auth tag in unsupported state")},o.prototype.setAuthTag=function(){throw new Error("trying to set auth tag in unsupported state")},o.prototype.setAAD=function(){throw new Error("trying to set aad in unsupported state")},o.prototype._transform=function(t,e,n){var r;try{this.hashMode?this._update(t):this.push(this._update(t))}catch(t){r=t}finally{n(r)}},o.prototype._flush=function(t){var e;try{this.push(this.__final())}catch(t){e=t}t(e)},o.prototype._finalOrDigest=function(t){var e=this.__final()||r.alloc(0);return t&&(e=this._toString(e,t,!0)),e},o.prototype._toString=function(t,e,n){if(this._decoder||(this._decoder=new a(e),this._encoding=e),this._encoding!==e)throw new Error("can't switch encodings");var r=this._decoder.write(t);return n&&(r+=this._decoder.end()),r},t.exports=o},function(t,e,n){var r=n(248),i=n(253);t.exports=function(t,e){var n=i(t,e);return r(n)?n:void 0}},function(t,e,n){var r=n(38),i=n(249),a=n(250),o=r?r.toStringTag:void 0;t.exports=function(t){return null==t?void 0===t?"[object Undefined]":"[object Null]":o&&o in Object(t)?i(t):a(t)}},function(t,e){t.exports=function(t){return t}},function(t,e,n){"use strict";var r=n(78),i=Object.keys||function(t){var e=[];for(var n in t)e.push(n);return e};t.exports=l;var a=Object.create(n(54));a.inherits=n(2);var o=n(193),s=n(116);a.inherits(l,o);for(var u=i(s.prototype),c=0;c<u.length;c++){var f=u[c];l.prototype[f]||(l.prototype[f]=s.prototype[f])}function l(t){if(!(this instanceof l))return new l(t);o.call(this,t),s.call(this,t),t&&!1===t.readable&&(this.readable=!1),t&&!1===t.writable&&(this.writable=!1),this.allowHalfOpen=!0,t&&!1===t.allowHalfOpen&&(this.allowHalfOpen=!1),this.once("end",h)}function h(){this.allowHalfOpen||this._writableState.ended||r.nextTick(d,this)}function d(t){t.end()}Object.defineProperty(l.prototype,"writableHighWaterMark",{enumerable:!1,get:function(){return this._writableState.highWaterMark}}),Object.defineProperty(l.prototype,"destroyed",{get:function(){return void 0!==this._readableState&&void 0!==this._writableState&&(this._readableState.destroyed&&this._writableState.destroyed)},set:function(t){void 0!==this._readableState&&void 0!==this._writableState&&(this._readableState.destroyed=t,this._writableState.destroyed=t)}}),l.prototype._destroy=function(t,e){this.push(null),this.end(),r.nextTick(e,t)}},function(t,e){t.exports=function(t,e){return t===e||t!=t&&e!=e}},function(t,e,n){var r=n(33),i=n(14);t.exports=function(t){if(!i(t))return!1;var e=r(t);return"[object Function]"==e||"[object GeneratorFunction]"==e||"[object AsyncFunction]"==e||"[object Proxy]"==e}},function(t,e,n){var r=n(18).Symbol;t.exports=r},function(t,e,n){(function(t){var r=n(18),i=n(269),a=e&&!e.nodeType&&e,o=a&&"object"==typeof t&&t&&!t.nodeType&&t,s=o&&o.exports===a?r.Buffer:void 0,u=(s?s.isBuffer:void 0)||i;t.exports=u}).call(this,n(9)(t))},function(t,e,n){var r=n(134),i=n(273),a=n(23);t.exports=function(t){return a(t)?r(t,!0):i(t)}},function(t,e,n){var r=n(278),i=n(90),a=n(279),o=n(143),s=n(280),u=n(33),c=n(132),f=c(r),l=c(i),h=c(a),d=c(o),p=c(s),g=u;(r&&"[object DataView]"!=g(new r(new ArrayBuffer(1)))||i&&"[object Map]"!=g(new i)||a&&"[object Promise]"!=g(a.resolve())||o&&"[object Set]"!=g(new o)||s&&"[object WeakMap]"!=g(new s))&&(g=function(t){var e=u(t),n="[object Object]"==e?t.constructor:void 0,r=n?c(n):"";if(r)switch(r){case f:return"[object DataView]";case l:return"[object Map]";case h:return"[object Promise]";case d:return"[object Set]";case p:return"[object WeakMap]"}return e}),t.exports=g},function(t,e,n){var r=n(33),i=n(20);t.exports=function(t){return"symbol"==typeof t||i(t)&&"[object Symbol]"==r(t)}},function(t,e,n){var r;try{r={defaults:n(176),each:n(100),isFunction:n(37),isPlainObject:n(180),pick:n(183),has:n(106),range:n(184),uniqueId:n(185)}}catch(t){}r||(r=window._),t.exports=r},function(t,e,n){"use strict";(function(e,r){var i=n(3).Buffer,a=e.crypto||e.msCrypto;a&&a.getRandomValues?t.exports=function(t,e){if(t>4294967295)throw new RangeError("requested too many random bytes");var n=i.allocUnsafe(t);if(t>0)if(t>65536)for(var o=0;o<t;o+=65536)a.getRandomValues(n.slice(o,o+65536));else a.getRandomValues(n);if("function"==typeof e)return r.nextTick((function(){e(null,n)}));return n}:t.exports=function(){throw new Error("Secure random number generation is not supported by this browser.\nUse Chrome, Firefox or Internet Explorer 11")}}).call(this,n(12),n(7))},function(t,e,n){var r=n(3).Buffer;function i(t,e){this._block=r.alloc(t),this._finalSize=e,this._blockSize=t,this._len=0}i.prototype.update=function(t,e){"string"==typeof t&&(e=e||"utf8",t=r.from(t,e));for(var n=this._block,i=this._blockSize,a=t.length,o=this._len,s=0;s<a;){for(var u=o%i,c=Math.min(a-s,i-u),f=0;f<c;f++)n[u+f]=t[s+f];s+=c,(o+=c)%i==0&&this._update(n)}return this._len+=a,this},i.prototype.digest=function(t){var e=this._len%this._blockSize;this._block[e]=128,this._block.fill(0,e+1),e>=this._finalSize&&(this._update(this._block),this._block.fill(0));var n=8*this._len;if(n<=4294967295)this._block.writeUInt32BE(n,this._blockSize-4);else{var r=(4294967295&n)>>>0,i=(n-r)/4294967296;this._block.writeUInt32BE(i,this._blockSize-8),this._block.writeUInt32BE(r,this._blockSize-4)}this._update(this._block);var a=this._hash();return t?a.toString(t):a},i.prototype._update=function(){throw new Error("_update must be implemented by subclass")},t.exports=i},function(t,e,n){(function(t,r){var i=function(){var t=function(t,e,n,r){for(n=n||{},r=t.length;r--;n[t[r]]=e);return n},e=[1,13],n=[1,16],r=[1,14],i=[1,15],a=[1,17],o=[1,18],s=[1,20],u=[1,21],c=[1,22],f=[6,8],l=[1,31],h=[1,32],d=[1,33],p=[1,34],g=[1,35],y=[1,36],b=[6,8,14,20,28,31,32,33,34,35,36],v=[6,8,12,14,20,24,28,31,32,33,34,35,36,52,53,54],m=[28,52,53,54],_=[28,35,36,52,53,54],w=[28,31,32,33,34,52,53,54],x=[6,8,14],k=[1,59],E={trace:function(){},yy:{},symbols_:{error:2,mermaidDoc:3,graphConfig:4,CLASS_DIAGRAM:5,NEWLINE:6,statements:7,EOF:8,statement:9,className:10,alphaNumToken:11,GENERICTYPE:12,relationStatement:13,LABEL:14,classStatement:15,methodStatement:16,annotationStatement:17,clickStatement:18,CLASS:19,STRUCT_START:20,members:21,STRUCT_STOP:22,ANNOTATION_START:23,ANNOTATION_END:24,MEMBER:25,SEPARATOR:26,relation:27,STR:28,relationType:29,lineType:30,AGGREGATION:31,EXTENSION:32,COMPOSITION:33,DEPENDENCY:34,LINE:35,DOTTED_LINE:36,CALLBACK:37,LINK:38,commentToken:39,textToken:40,graphCodeTokens:41,textNoTagsToken:42,TAGSTART:43,TAGEND:44,"==":45,"--":46,PCT:47,DEFAULT:48,SPACE:49,MINUS:50,keywords:51,UNICODE_TEXT:52,NUM:53,ALPHA:54,$accept:0,$end:1},terminals_:{2:"error",5:"CLASS_DIAGRAM",6:"NEWLINE",8:"EOF",12:"GENERICTYPE",14:"LABEL",19:"CLASS",20:"STRUCT_START",22:"STRUCT_STOP",23:"ANNOTATION_START",24:"ANNOTATION_END",25:"MEMBER",26:"SEPARATOR",28:"STR",31:"AGGREGATION",32:"EXTENSION",33:"COMPOSITION",34:"DEPENDENCY",35:"LINE",36:"DOTTED_LINE",37:"CALLBACK",38:"LINK",41:"graphCodeTokens",43:"TAGSTART",44:"TAGEND",45:"==",46:"--",47:"PCT",48:"DEFAULT",49:"SPACE",50:"MINUS",51:"keywords",52:"UNICODE_TEXT",53:"NUM",54:"ALPHA"},productions_:[0,[3,1],[4,4],[7,1],[7,2],[7,3],[10,2],[10,1],[10,3],[10,2],[9,1],[9,2],[9,1],[9,1],[9,1],[9,1],[15,2],[15,5],[17,4],[21,1],[21,2],[16,1],[16,2],[16,1],[16,1],[13,3],[13,4],[13,4],[13,5],[27,3],[27,2],[27,2],[27,1],[29,1],[29,1],[29,1],[29,1],[30,1],[30,1],[18,3],[18,4],[18,3],[18,4],[39,1],[39,1],[40,1],[40,1],[40,1],[40,1],[40,1],[40,1],[40,1],[42,1],[42,1],[42,1],[42,1],[11,1],[11,1],[11,1]],performAction:function(t,e,n,r,i,a,o){var s=a.length-1;switch(i){case 6:this.$=a[s-1]+a[s];break;case 7:this.$=a[s];break;case 8:this.$=a[s-2]+"~"+a[s-1]+a[s];break;case 9:this.$=a[s-1]+"~"+a[s];break;case 10:r.addRelation(a[s]);break;case 11:a[s-1].title=r.cleanupLabel(a[s]),r.addRelation(a[s-1]);break;case 16:r.addClass(a[s]);break;case 17:r.addClass(a[s-3]),r.addMembers(a[s-3],a[s-1]);break;case 18:r.addAnnotation(a[s],a[s-2]);break;case 19:this.$=[a[s]];break;case 20:a[s].push(a[s-1]),this.$=a[s];break;case 21:break;case 22:r.addMember(a[s-1],r.cleanupLabel(a[s]));break;case 23:case 24:break;case 25:this.$={id1:a[s-2],id2:a[s],relation:a[s-1],relationTitle1:"none",relationTitle2:"none"};break;case 26:this.$={id1:a[s-3],id2:a[s],relation:a[s-1],relationTitle1:a[s-2],relationTitle2:"none"};break;case 27:this.$={id1:a[s-3],id2:a[s],relation:a[s-2],relationTitle1:"none",relationTitle2:a[s-1]};break;case 28:this.$={id1:a[s-4],id2:a[s],relation:a[s-2],relationTitle1:a[s-3],relationTitle2:a[s-1]};break;case 29:this.$={type1:a[s-2],type2:a[s],lineType:a[s-1]};break;case 30:this.$={type1:"none",type2:a[s],lineType:a[s-1]};break;case 31:this.$={type1:a[s-1],type2:"none",lineType:a[s]};break;case 32:this.$={type1:"none",type2:"none",lineType:a[s]};break;case 33:this.$=r.relationType.AGGREGATION;break;case 34:this.$=r.relationType.EXTENSION;break;case 35:this.$=r.relationType.COMPOSITION;break;case 36:this.$=r.relationType.DEPENDENCY;break;case 37:this.$=r.lineType.LINE;break;case 38:this.$=r.lineType.DOTTED_LINE;break;case 39:this.$=a[s-2],r.setClickEvent(a[s-1],a[s],void 0);break;case 40:this.$=a[s-3],r.setClickEvent(a[s-2],a[s-1],a[s]);break;case 41:this.$=a[s-2],r.setLink(a[s-1],a[s],void 0);break;case 42:this.$=a[s-3],r.setLink(a[s-2],a[s-1],a[s])}},table:[{3:1,4:2,5:[1,3]},{1:[3]},{1:[2,1]},{6:[1,4]},{7:5,9:6,10:12,11:19,13:7,15:8,16:9,17:10,18:11,19:e,23:n,25:r,26:i,37:a,38:o,52:s,53:u,54:c},{8:[1,23]},{6:[1,24],8:[2,3]},t(f,[2,10],{14:[1,25]}),t(f,[2,12]),t(f,[2,13]),t(f,[2,14]),t(f,[2,15]),t(f,[2,21],{27:26,29:29,30:30,14:[1,28],28:[1,27],31:l,32:h,33:d,34:p,35:g,36:y}),{10:37,11:19,52:s,53:u,54:c},t(f,[2,23]),t(f,[2,24]),{11:38,52:s,53:u,54:c},{10:39,11:19,52:s,53:u,54:c},{10:40,11:19,52:s,53:u,54:c},t(b,[2,7],{11:19,10:41,12:[1,42],52:s,53:u,54:c}),t(v,[2,56]),t(v,[2,57]),t(v,[2,58]),{1:[2,2]},{7:43,8:[2,4],9:6,10:12,11:19,13:7,15:8,16:9,17:10,18:11,19:e,23:n,25:r,26:i,37:a,38:o,52:s,53:u,54:c},t(f,[2,11]),{10:44,11:19,28:[1,45],52:s,53:u,54:c},{27:46,29:29,30:30,31:l,32:h,33:d,34:p,35:g,36:y},t(f,[2,22]),{30:47,35:g,36:y},t(m,[2,32],{29:48,31:l,32:h,33:d,34:p}),t(_,[2,33]),t(_,[2,34]),t(_,[2,35]),t(_,[2,36]),t(w,[2,37]),t(w,[2,38]),t(f,[2,16],{20:[1,49]}),{24:[1,50]},{28:[1,51]},{28:[1,52]},t(b,[2,6]),t(b,[2,9],{11:19,10:53,52:s,53:u,54:c}),{8:[2,5]},t(x,[2,25]),{10:54,11:19,52:s,53:u,54:c},{10:55,11:19,28:[1,56],52:s,53:u,54:c},t(m,[2,31],{29:57,31:l,32:h,33:d,34:p}),t(m,[2,30]),{21:58,25:k},{10:60,11:19,52:s,53:u,54:c},t(f,[2,39],{28:[1,61]}),t(f,[2,41],{28:[1,62]}),t(b,[2,8]),t(x,[2,27]),t(x,[2,26]),{10:63,11:19,52:s,53:u,54:c},t(m,[2,29]),{22:[1,64]},{21:65,22:[2,19],25:k},t(f,[2,18]),t(f,[2,40]),t(f,[2,42]),t(x,[2,28]),t(f,[2,17]),{22:[2,20]}],defaultActions:{2:[2,1],23:[2,2],43:[2,5],65:[2,20]},parseError:function(t,e){if(!e.recoverable){var n=new Error(t);throw n.hash=e,n}this.trace(t)},parse:function(t){var e=this,n=[0],r=[],i=[null],a=[],o=this.table,s="",u=0,c=0,f=0,l=2,h=1,d=a.slice.call(arguments,1),p=Object.create(this.lexer),g={yy:{}};for(var y in this.yy)Object.prototype.hasOwnProperty.call(this.yy,y)&&(g.yy[y]=this.yy[y]);p.setInput(t,g.yy),g.yy.lexer=p,g.yy.parser=this,void 0===p.yylloc&&(p.yylloc={});var b=p.yylloc;a.push(b);var v=p.options&&p.options.ranges;function m(){var t;return"number"!=typeof(t=r.pop()||p.lex()||h)&&(t instanceof Array&&(t=(r=t).pop()),t=e.symbols_[t]||t),t}"function"==typeof g.yy.parseError?this.parseError=g.yy.parseError:this.parseError=Object.getPrototypeOf(this).parseError;for(var _,w,x,k,E,A,S,M,T,D={};;){if(x=n[n.length-1],this.defaultActions[x]?k=this.defaultActions[x]:(null==_&&(_=m()),k=o[x]&&o[x][_]),void 0===k||!k.length||!k[0]){var C="";for(A in T=[],o[x])this.terminals_[A]&&A>l&&T.push("'"+this.terminals_[A]+"'");C=p.showPosition?"Parse error on line "+(u+1)+":\n"+p.showPosition()+"\nExpecting "+T.join(", ")+", got '"+(this.terminals_[_]||_)+"'":"Parse error on line "+(u+1)+": Unexpected "+(_==h?"end of input":"'"+(this.terminals_[_]||_)+"'"),this.parseError(C,{text:p.match,token:this.terminals_[_]||_,line:p.yylineno,loc:b,expected:T})}if(k[0]instanceof Array&&k.length>1)throw new Error("Parse Error: multiple actions possible at state: "+x+", token: "+_);switch(k[0]){case 1:n.push(_),i.push(p.yytext),a.push(p.yylloc),n.push(k[1]),_=null,w?(_=w,w=null):(c=p.yyleng,s=p.yytext,u=p.yylineno,b=p.yylloc,f>0&&f--);break;case 2:if(S=this.productions_[k[1]][1],D.$=i[i.length-S],D._$={first_line:a[a.length-(S||1)].first_line,last_line:a[a.length-1].last_line,first_column:a[a.length-(S||1)].first_column,last_column:a[a.length-1].last_column},v&&(D._$.range=[a[a.length-(S||1)].range[0],a[a.length-1].range[1]]),void 0!==(E=this.performAction.apply(D,[s,c,u,g.yy,k[1],i,a].concat(d))))return E;S&&(n=n.slice(0,-1*S*2),i=i.slice(0,-1*S),a=a.slice(0,-1*S)),n.push(this.productions_[k[1]][0]),i.push(D.$),a.push(D._$),M=o[n[n.length-2]][n[n.length-1]],n.push(M);break;case 3:return!0}}return!0}},A={EOF:1,parseError:function(t,e){if(!this.yy.parser)throw new Error(t);this.yy.parser.parseError(t,e)},setInput:function(t,e){return this.yy=e||this.yy||{},this._input=t,this._more=this._backtrack=this.done=!1,this.yylineno=this.yyleng=0,this.yytext=this.matched=this.match="",this.conditionStack=["INITIAL"],this.yylloc={first_line:1,first_column:0,last_line:1,last_column:0},this.options.ranges&&(this.yylloc.range=[0,0]),this.offset=0,this},input:function(){var t=this._input[0];return this.yytext+=t,this.yyleng++,this.offset++,this.match+=t,this.matched+=t,t.match(/(?:\r\n?|\n).*/g)?(this.yylineno++,this.yylloc.last_line++):this.yylloc.last_column++,this.options.ranges&&this.yylloc.range[1]++,this._input=this._input.slice(1),t},unput:function(t){var e=t.length,n=t.split(/(?:\r\n?|\n)/g);this._input=t+this._input,this.yytext=this.yytext.substr(0,this.yytext.length-e),this.offset-=e;var r=this.match.split(/(?:\r\n?|\n)/g);this.match=this.match.substr(0,this.match.length-1),this.matched=this.matched.substr(0,this.matched.length-1),n.length-1&&(this.yylineno-=n.length-1);var i=this.yylloc.range;return this.yylloc={first_line:this.yylloc.first_line,last_line:this.yylineno+1,first_column:this.yylloc.first_column,last_column:n?(n.length===r.length?this.yylloc.first_column:0)+r[r.length-n.length].length-n[0].length:this.yylloc.first_column-e},this.options.ranges&&(this.yylloc.range=[i[0],i[0]+this.yyleng-e]),this.yyleng=this.yytext.length,this},more:function(){return this._more=!0,this},reject:function(){return this.options.backtrack_lexer?(this._backtrack=!0,this):this.parseError("Lexical error on line "+(this.yylineno+1)+". You can only invoke reject() in the lexer when the lexer is of the backtracking persuasion (options.backtrack_lexer = true).\n"+this.showPosition(),{text:"",token:null,line:this.yylineno})},less:function(t){this.unput(this.match.slice(t))},pastInput:function(){var t=this.matched.substr(0,this.matched.length-this.match.length);return(t.length>20?"...":"")+t.substr(-20).replace(/\n/g,"")},upcomingInput:function(){var t=this.match;return t.length<20&&(t+=this._input.substr(0,20-t.length)),(t.substr(0,20)+(t.length>20?"...":"")).replace(/\n/g,"")},showPosition:function(){var t=this.pastInput(),e=new Array(t.length+1).join("-");return t+this.upcomingInput()+"\n"+e+"^"},test_match:function(t,e){var n,r,i;if(this.options.backtrack_lexer&&(i={yylineno:this.yylineno,yylloc:{first_line:this.yylloc.first_line,last_line:this.last_line,first_column:this.yylloc.first_column,last_column:this.yylloc.last_column},yytext:this.yytext,match:this.match,matches:this.matches,matched:this.matched,yyleng:this.yyleng,offset:this.offset,_more:this._more,_input:this._input,yy:this.yy,conditionStack:this.conditionStack.slice(0),done:this.done},this.options.ranges&&(i.yylloc.range=this.yylloc.range.slice(0))),(r=t[0].match(/(?:\r\n?|\n).*/g))&&(this.yylineno+=r.length),this.yylloc={first_line:this.yylloc.last_line,last_line:this.yylineno+1,first_column:this.yylloc.last_column,last_column:r?r[r.length-1].length-r[r.length-1].match(/\r?\n?/)[0].length:this.yylloc.last_column+t[0].length},this.yytext+=t[0],this.match+=t[0],this.matches=t,this.yyleng=this.yytext.length,this.options.ranges&&(this.yylloc.range=[this.offset,this.offset+=this.yyleng]),this._more=!1,this._backtrack=!1,this._input=this._input.slice(t[0].length),this.matched+=t[0],n=this.performAction.call(this,this.yy,this,e,this.conditionStack[this.conditionStack.length-1]),this.done&&this._input&&(this.done=!1),n)return n;if(this._backtrack){for(var a in i)this[a]=i[a];return!1}return!1},next:function(){if(this.done)return this.EOF;var t,e,n,r;this._input||(this.done=!0),this._more||(this.yytext="",this.match="");for(var i=this._currentRules(),a=0;a<i.length;a++)if((n=this._input.match(this.rules[i[a]]))&&(!e||n[0].length>e[0].length)){if(e=n,r=a,this.options.backtrack_lexer){if(!1!==(t=this.test_match(n,i[a])))return t;if(this._backtrack){e=!1;continue}return!1}if(!this.options.flex)break}return e?!1!==(t=this.test_match(e,i[r]))&&t:""===this._input?this.EOF:this.parseError("Lexical error on line "+(this.yylineno+1)+". Unrecognized text.\n"+this.showPosition(),{text:"",token:null,line:this.yylineno})},lex:function(){var t=this.next();return t||this.lex()},begin:function(t){this.conditionStack.push(t)},popState:function(){return this.conditionStack.length-1>0?this.conditionStack.pop():this.conditionStack[0]},_currentRules:function(){return this.conditionStack.length&&this.conditionStack[this.conditionStack.length-1]?this.conditions[this.conditionStack[this.conditionStack.length-1]].rules:this.conditions.INITIAL.rules},topState:function(t){return(t=this.conditionStack.length-1-Math.abs(t||0))>=0?this.conditionStack[t]:"INITIAL"},pushState:function(t){this.begin(t)},stateStackSize:function(){return this.conditionStack.length},options:{},performAction:function(t,e,n,r){switch(n){case 0:break;case 1:return 6;case 2:break;case 3:return 5;case 4:return this.begin("struct"),20;case 5:return"EOF_IN_STRUCT";case 6:return"OPEN_IN_STRUCT";case 7:return this.popState(),22;case 8:break;case 9:return"MEMBER";case 10:return 19;case 11:return 37;case 12:return 38;case 13:return 23;case 14:return 24;case 15:this.begin("generic");break;case 16:this.popState();break;case 17:return"GENERICTYPE";case 18:this.begin("string");break;case 19:this.popState();break;case 20:return"STR";case 21:case 22:return 32;case 23:case 24:return 34;case 25:return 33;case 26:return 31;case 27:return 35;case 28:return 36;case 29:return 14;case 30:return 50;case 31:return"DOT";case 32:return"PLUS";case 33:return 47;case 34:case 35:return"EQUALS";case 36:return 54;case 37:return"PUNCTUATION";case 38:return 53;case 39:return 52;case 40:return 49;case 41:return 8}},rules:[/^(?:%%[^\n]*\n*)/,/^(?:\n+)/,/^(?:\s+)/,/^(?:classDiagram\b)/,/^(?:[\{])/,/^(?:$)/,/^(?:[\{])/,/^(?:\})/,/^(?:[\n])/,/^(?:[^\{\}\n]*)/,/^(?:class\b)/,/^(?:callback\b)/,/^(?:link\b)/,/^(?:<<)/,/^(?:>>)/,/^(?:[~])/,/^(?:[~])/,/^(?:[^~]*)/,/^(?:["])/,/^(?:["])/,/^(?:[^"]*)/,/^(?:\s*<\|)/,/^(?:\s*\|>)/,/^(?:\s*>)/,/^(?:\s*<)/,/^(?:\s*\*)/,/^(?:\s*o\b)/,/^(?:--)/,/^(?:\.\.)/,/^(?::[^\n;]+)/,/^(?:-)/,/^(?:\.)/,/^(?:\+)/,/^(?:%)/,/^(?:=)/,/^(?:=)/,/^(?:\w+)/,/^(?:[!"#$%&'*+,-.`?\\/])/,/^(?:[0-9]+)/,/^(?:[\u00AA\u00B5\u00BA\u00C0-\u00D6\u00D8-\u00F6]|[\u00F8-\u02C1\u02C6-\u02D1\u02E0-\u02E4\u02EC\u02EE\u0370-\u0374\u0376\u0377]|[\u037A-\u037D\u0386\u0388-\u038A\u038C\u038E-\u03A1\u03A3-\u03F5]|[\u03F7-\u0481\u048A-\u0527\u0531-\u0556\u0559\u0561-\u0587\u05D0-\u05EA]|[\u05F0-\u05F2\u0620-\u064A\u066E\u066F\u0671-\u06D3\u06D5\u06E5\u06E6\u06EE]|[\u06EF\u06FA-\u06FC\u06FF\u0710\u0712-\u072F\u074D-\u07A5\u07B1\u07CA-\u07EA]|[\u07F4\u07F5\u07FA\u0800-\u0815\u081A\u0824\u0828\u0840-\u0858\u08A0]|[\u08A2-\u08AC\u0904-\u0939\u093D\u0950\u0958-\u0961\u0971-\u0977]|[\u0979-\u097F\u0985-\u098C\u098F\u0990\u0993-\u09A8\u09AA-\u09B0\u09B2]|[\u09B6-\u09B9\u09BD\u09CE\u09DC\u09DD\u09DF-\u09E1\u09F0\u09F1\u0A05-\u0A0A]|[\u0A0F\u0A10\u0A13-\u0A28\u0A2A-\u0A30\u0A32\u0A33\u0A35\u0A36\u0A38\u0A39]|[\u0A59-\u0A5C\u0A5E\u0A72-\u0A74\u0A85-\u0A8D\u0A8F-\u0A91\u0A93-\u0AA8]|[\u0AAA-\u0AB0\u0AB2\u0AB3\u0AB5-\u0AB9\u0ABD\u0AD0\u0AE0\u0AE1\u0B05-\u0B0C]|[\u0B0F\u0B10\u0B13-\u0B28\u0B2A-\u0B30\u0B32\u0B33\u0B35-\u0B39\u0B3D\u0B5C]|[\u0B5D\u0B5F-\u0B61\u0B71\u0B83\u0B85-\u0B8A\u0B8E-\u0B90\u0B92-\u0B95\u0B99]|[\u0B9A\u0B9C\u0B9E\u0B9F\u0BA3\u0BA4\u0BA8-\u0BAA\u0BAE-\u0BB9\u0BD0]|[\u0C05-\u0C0C\u0C0E-\u0C10\u0C12-\u0C28\u0C2A-\u0C33\u0C35-\u0C39\u0C3D]|[\u0C58\u0C59\u0C60\u0C61\u0C85-\u0C8C\u0C8E-\u0C90\u0C92-\u0CA8\u0CAA-\u0CB3]|[\u0CB5-\u0CB9\u0CBD\u0CDE\u0CE0\u0CE1\u0CF1\u0CF2\u0D05-\u0D0C\u0D0E-\u0D10]|[\u0D12-\u0D3A\u0D3D\u0D4E\u0D60\u0D61\u0D7A-\u0D7F\u0D85-\u0D96\u0D9A-\u0DB1]|[\u0DB3-\u0DBB\u0DBD\u0DC0-\u0DC6\u0E01-\u0E30\u0E32\u0E33\u0E40-\u0E46\u0E81]|[\u0E82\u0E84\u0E87\u0E88\u0E8A\u0E8D\u0E94-\u0E97\u0E99-\u0E9F\u0EA1-\u0EA3]|[\u0EA5\u0EA7\u0EAA\u0EAB\u0EAD-\u0EB0\u0EB2\u0EB3\u0EBD\u0EC0-\u0EC4\u0EC6]|[\u0EDC-\u0EDF\u0F00\u0F40-\u0F47\u0F49-\u0F6C\u0F88-\u0F8C\u1000-\u102A]|[\u103F\u1050-\u1055\u105A-\u105D\u1061\u1065\u1066\u106E-\u1070\u1075-\u1081]|[\u108E\u10A0-\u10C5\u10C7\u10CD\u10D0-\u10FA\u10FC-\u1248\u124A-\u124D]|[\u1250-\u1256\u1258\u125A-\u125D\u1260-\u1288\u128A-\u128D\u1290-\u12B0]|[\u12B2-\u12B5\u12B8-\u12BE\u12C0\u12C2-\u12C5\u12C8-\u12D6\u12D8-\u1310]|[\u1312-\u1315\u1318-\u135A\u1380-\u138F\u13A0-\u13F4\u1401-\u166C]|[\u166F-\u167F\u1681-\u169A\u16A0-\u16EA\u1700-\u170C\u170E-\u1711]|[\u1720-\u1731\u1740-\u1751\u1760-\u176C\u176E-\u1770\u1780-\u17B3\u17D7]|[\u17DC\u1820-\u1877\u1880-\u18A8\u18AA\u18B0-\u18F5\u1900-\u191C]|[\u1950-\u196D\u1970-\u1974\u1980-\u19AB\u19C1-\u19C7\u1A00-\u1A16]|[\u1A20-\u1A54\u1AA7\u1B05-\u1B33\u1B45-\u1B4B\u1B83-\u1BA0\u1BAE\u1BAF]|[\u1BBA-\u1BE5\u1C00-\u1C23\u1C4D-\u1C4F\u1C5A-\u1C7D\u1CE9-\u1CEC]|[\u1CEE-\u1CF1\u1CF5\u1CF6\u1D00-\u1DBF\u1E00-\u1F15\u1F18-\u1F1D]|[\u1F20-\u1F45\u1F48-\u1F4D\u1F50-\u1F57\u1F59\u1F5B\u1F5D\u1F5F-\u1F7D]|[\u1F80-\u1FB4\u1FB6-\u1FBC\u1FBE\u1FC2-\u1FC4\u1FC6-\u1FCC\u1FD0-\u1FD3]|[\u1FD6-\u1FDB\u1FE0-\u1FEC\u1FF2-\u1FF4\u1FF6-\u1FFC\u2071\u207F]|[\u2090-\u209C\u2102\u2107\u210A-\u2113\u2115\u2119-\u211D\u2124\u2126\u2128]|[\u212A-\u212D\u212F-\u2139\u213C-\u213F\u2145-\u2149\u214E\u2183\u2184]|[\u2C00-\u2C2E\u2C30-\u2C5E\u2C60-\u2CE4\u2CEB-\u2CEE\u2CF2\u2CF3]|[\u2D00-\u2D25\u2D27\u2D2D\u2D30-\u2D67\u2D6F\u2D80-\u2D96\u2DA0-\u2DA6]|[\u2DA8-\u2DAE\u2DB0-\u2DB6\u2DB8-\u2DBE\u2DC0-\u2DC6\u2DC8-\u2DCE]|[\u2DD0-\u2DD6\u2DD8-\u2DDE\u2E2F\u3005\u3006\u3031-\u3035\u303B\u303C]|[\u3041-\u3096\u309D-\u309F\u30A1-\u30FA\u30FC-\u30FF\u3105-\u312D]|[\u3131-\u318E\u31A0-\u31BA\u31F0-\u31FF\u3400-\u4DB5\u4E00-\u9FCC]|[\uA000-\uA48C\uA4D0-\uA4FD\uA500-\uA60C\uA610-\uA61F\uA62A\uA62B]|[\uA640-\uA66E\uA67F-\uA697\uA6A0-\uA6E5\uA717-\uA71F\uA722-\uA788]|[\uA78B-\uA78E\uA790-\uA793\uA7A0-\uA7AA\uA7F8-\uA801\uA803-\uA805]|[\uA807-\uA80A\uA80C-\uA822\uA840-\uA873\uA882-\uA8B3\uA8F2-\uA8F7\uA8FB]|[\uA90A-\uA925\uA930-\uA946\uA960-\uA97C\uA984-\uA9B2\uA9CF\uAA00-\uAA28]|[\uAA40-\uAA42\uAA44-\uAA4B\uAA60-\uAA76\uAA7A\uAA80-\uAAAF\uAAB1\uAAB5]|[\uAAB6\uAAB9-\uAABD\uAAC0\uAAC2\uAADB-\uAADD\uAAE0-\uAAEA\uAAF2-\uAAF4]|[\uAB01-\uAB06\uAB09-\uAB0E\uAB11-\uAB16\uAB20-\uAB26\uAB28-\uAB2E]|[\uABC0-\uABE2\uAC00-\uD7A3\uD7B0-\uD7C6\uD7CB-\uD7FB\uF900-\uFA6D]|[\uFA70-\uFAD9\uFB00-\uFB06\uFB13-\uFB17\uFB1D\uFB1F-\uFB28\uFB2A-\uFB36]|[\uFB38-\uFB3C\uFB3E\uFB40\uFB41\uFB43\uFB44\uFB46-\uFBB1\uFBD3-\uFD3D]|[\uFD50-\uFD8F\uFD92-\uFDC7\uFDF0-\uFDFB\uFE70-\uFE74\uFE76-\uFEFC]|[\uFF21-\uFF3A\uFF41-\uFF5A\uFF66-\uFFBE\uFFC2-\uFFC7\uFFCA-\uFFCF]|[\uFFD2-\uFFD7\uFFDA-\uFFDC])/,/^(?:\s)/,/^(?:$)/],conditions:{string:{rules:[19,20],inclusive:!1},generic:{rules:[16,17],inclusive:!1},struct:{rules:[5,6,7,8,9],inclusive:!1},INITIAL:{rules:[0,1,2,3,4,10,11,12,13,14,15,18,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36,37,38,39,40,41],inclusive:!0}}};function S(){this.yy={}}return E.lexer=A,S.prototype=E,E.Parser=S,new S}();e.parser=i,e.Parser=i.Parser,e.parse=function(){return i.parse.apply(i,arguments)},e.main=function(r){r[1]||(console.log("Usage: "+r[0]+" FILE"),t.exit(1));var i=n(28).readFileSync(n(29).normalize(r[1]),"utf8");return e.parser.parse(i)},n.c[n.s]===r&&e.main(t.argv.slice(1))}).call(this,n(7),n(9)(t))},function(t,e,n){(function(t,r){var i=function(){var t=function(t,e,n,r){for(n=n||{},r=t.length;r--;n[t[r]]=e);return n},e=[1,2],n=[1,3],r=[1,4],i=[2,4],a=[1,9],o=[1,11],s=[1,13],u=[1,14],c=[1,15],f=[1,16],l=[1,21],h=[1,17],d=[1,18],p=[1,19],g=[1,20],y=[1,22],b=[1,4,5,13,14,16,18,19,21,22,23,24,25,28],v=[1,4,5,11,12,13,14,16,18,19,21,22,23,24,25,28],m=[4,5,13,14,16,18,19,21,22,23,24,25,28],_={trace:function(){},yy:{},symbols_:{error:2,start:3,SPACE:4,NL:5,SD:6,document:7,line:8,statement:9,idStatement:10,DESCR:11,"--\x3e":12,HIDE_EMPTY:13,scale:14,WIDTH:15,COMPOSIT_STATE:16,STRUCT_START:17,STRUCT_STOP:18,STATE_DESCR:19,AS:20,ID:21,FORK:22,JOIN:23,CONCURRENT:24,note:25,notePosition:26,NOTE_TEXT:27,EDGE_STATE:28,left_of:29,right_of:30,$accept:0,$end:1},terminals_:{2:"error",4:"SPACE",5:"NL",6:"SD",11:"DESCR",12:"--\x3e",13:"HIDE_EMPTY",14:"scale",15:"WIDTH",16:"COMPOSIT_STATE",17:"STRUCT_START",18:"STRUCT_STOP",19:"STATE_DESCR",20:"AS",21:"ID",22:"FORK",23:"JOIN",24:"CONCURRENT",25:"note",27:"NOTE_TEXT",28:"EDGE_STATE",29:"left_of",30:"right_of"},productions_:[0,[3,2],[3,2],[3,2],[7,0],[7,2],[8,2],[8,1],[8,1],[9,1],[9,2],[9,3],[9,4],[9,1],[9,2],[9,1],[9,4],[9,3],[9,6],[9,1],[9,1],[9,1],[9,4],[9,4],[10,1],[10,1],[26,1],[26,1]],performAction:function(t,e,n,r,i,a,o){var s=a.length-1;switch(i){case 3:return r.setRootDoc(a[s]),a[s];case 4:this.$=[];break;case 5:"nl"!=a[s]&&(a[s-1].push(a[s]),this.$=a[s-1]);break;case 6:case 7:this.$=a[s];break;case 8:this.$="nl";break;case 9:this.$={stmt:"state",id:a[s],type:"default",description:""};break;case 10:this.$={stmt:"state",id:a[s-1],type:"default",description:a[s].trim()};break;case 11:this.$={stmt:"relation",state1:{stmt:"state",id:a[s-2],type:"default",description:""},state2:{stmt:"state",id:a[s],type:"default",description:""}};break;case 12:this.$={stmt:"relation",state1:{stmt:"state",id:a[s-3],type:"default",description:""},state2:{stmt:"state",id:a[s-1],type:"default",description:""},description:a[s].substr(1).trim()};break;case 16:this.$={stmt:"state",id:a[s-3],type:"default",description:"",doc:a[s-1]};break;case 17:var u=a[s],c=a[s-2].trim();if(a[s].match(":")){var f=a[s].split(":");u=f[0],c=[c,f[1]]}this.$={stmt:"state",id:u,type:"default",description:c};break;case 18:this.$={stmt:"state",id:a[s-3],type:"default",description:a[s-5],doc:a[s-1]};break;case 19:this.$={stmt:"state",id:a[s],type:"fork"};break;case 20:this.$={stmt:"state",id:a[s],type:"join"};break;case 21:this.$={stmt:"state",id:r.getDividerId(),type:"divider"};break;case 22:this.$={stmt:"state",id:a[s-1].trim(),note:{position:a[s-2].trim(),text:a[s].trim()}};break;case 24:case 25:this.$=a[s]}},table:[{3:1,4:e,5:n,6:r},{1:[3]},{3:5,4:e,5:n,6:r},{3:6,4:e,5:n,6:r},t([1,4,5,13,14,16,19,21,22,23,24,25,28],i,{7:7}),{1:[2,1]},{1:[2,2]},{1:[2,3],4:a,5:o,8:8,9:10,10:12,13:s,14:u,16:c,19:f,21:l,22:h,23:d,24:p,25:g,28:y},t(b,[2,5]),{9:23,10:12,13:s,14:u,16:c,19:f,21:l,22:h,23:d,24:p,25:g,28:y},t(b,[2,7]),t(b,[2,8]),t(b,[2,9],{11:[1,24],12:[1,25]}),t(b,[2,13]),{15:[1,26]},t(b,[2,15],{17:[1,27]}),{20:[1,28]},t(b,[2,19]),t(b,[2,20]),t(b,[2,21]),{26:29,27:[1,30],29:[1,31],30:[1,32]},t(v,[2,24]),t(v,[2,25]),t(b,[2,6]),t(b,[2,10]),{10:33,21:l,28:y},t(b,[2,14]),t(m,i,{7:34}),{21:[1,35]},{21:[1,36]},{20:[1,37]},{21:[2,26]},{21:[2,27]},t(b,[2,11],{11:[1,38]}),{4:a,5:o,8:8,9:10,10:12,13:s,14:u,16:c,18:[1,39],19:f,21:l,22:h,23:d,24:p,25:g,28:y},t(b,[2,17],{17:[1,40]}),{27:[1,41]},{21:[1,42]},t(b,[2,12]),t(b,[2,16]),t(m,i,{7:43}),t(b,[2,22]),t(b,[2,23]),{4:a,5:o,8:8,9:10,10:12,13:s,14:u,16:c,18:[1,44],19:f,21:l,22:h,23:d,24:p,25:g,28:y},t(b,[2,18])],defaultActions:{5:[2,1],6:[2,2],31:[2,26],32:[2,27]},parseError:function(t,e){if(!e.recoverable){var n=new Error(t);throw n.hash=e,n}this.trace(t)},parse:function(t){var e=this,n=[0],r=[],i=[null],a=[],o=this.table,s="",u=0,c=0,f=0,l=2,h=1,d=a.slice.call(arguments,1),p=Object.create(this.lexer),g={yy:{}};for(var y in this.yy)Object.prototype.hasOwnProperty.call(this.yy,y)&&(g.yy[y]=this.yy[y]);p.setInput(t,g.yy),g.yy.lexer=p,g.yy.parser=this,void 0===p.yylloc&&(p.yylloc={});var b=p.yylloc;a.push(b);var v=p.options&&p.options.ranges;function m(){var t;return"number"!=typeof(t=r.pop()||p.lex()||h)&&(t instanceof Array&&(t=(r=t).pop()),t=e.symbols_[t]||t),t}"function"==typeof g.yy.parseError?this.parseError=g.yy.parseError:this.parseError=Object.getPrototypeOf(this).parseError;for(var _,w,x,k,E,A,S,M,T,D={};;){if(x=n[n.length-1],this.defaultActions[x]?k=this.defaultActions[x]:(null==_&&(_=m()),k=o[x]&&o[x][_]),void 0===k||!k.length||!k[0]){var C="";for(A in T=[],o[x])this.terminals_[A]&&A>l&&T.push("'"+this.terminals_[A]+"'");C=p.showPosition?"Parse error on line "+(u+1)+":\n"+p.showPosition()+"\nExpecting "+T.join(", ")+", got '"+(this.terminals_[_]||_)+"'":"Parse error on line "+(u+1)+": Unexpected "+(_==h?"end of input":"'"+(this.terminals_[_]||_)+"'"),this.parseError(C,{text:p.match,token:this.terminals_[_]||_,line:p.yylineno,loc:b,expected:T})}if(k[0]instanceof Array&&k.length>1)throw new Error("Parse Error: multiple actions possible at state: "+x+", token: "+_);switch(k[0]){case 1:n.push(_),i.push(p.yytext),a.push(p.yylloc),n.push(k[1]),_=null,w?(_=w,w=null):(c=p.yyleng,s=p.yytext,u=p.yylineno,b=p.yylloc,f>0&&f--);break;case 2:if(S=this.productions_[k[1]][1],D.$=i[i.length-S],D._$={first_line:a[a.length-(S||1)].first_line,last_line:a[a.length-1].last_line,first_column:a[a.length-(S||1)].first_column,last_column:a[a.length-1].last_column},v&&(D._$.range=[a[a.length-(S||1)].range[0],a[a.length-1].range[1]]),void 0!==(E=this.performAction.apply(D,[s,c,u,g.yy,k[1],i,a].concat(d))))return E;S&&(n=n.slice(0,-1*S*2),i=i.slice(0,-1*S),a=a.slice(0,-1*S)),n.push(this.productions_[k[1]][0]),i.push(D.$),a.push(D._$),M=o[n[n.length-2]][n[n.length-1]],n.push(M);break;case 3:return!0}}return!0}},w={EOF:1,parseError:function(t,e){if(!this.yy.parser)throw new Error(t);this.yy.parser.parseError(t,e)},setInput:function(t,e){return this.yy=e||this.yy||{},this._input=t,this._more=this._backtrack=this.done=!1,this.yylineno=this.yyleng=0,this.yytext=this.matched=this.match="",this.conditionStack=["INITIAL"],this.yylloc={first_line:1,first_column:0,last_line:1,last_column:0},this.options.ranges&&(this.yylloc.range=[0,0]),this.offset=0,this},input:function(){var t=this._input[0];return this.yytext+=t,this.yyleng++,this.offset++,this.match+=t,this.matched+=t,t.match(/(?:\r\n?|\n).*/g)?(this.yylineno++,this.yylloc.last_line++):this.yylloc.last_column++,this.options.ranges&&this.yylloc.range[1]++,this._input=this._input.slice(1),t},unput:function(t){var e=t.length,n=t.split(/(?:\r\n?|\n)/g);this._input=t+this._input,this.yytext=this.yytext.substr(0,this.yytext.length-e),this.offset-=e;var r=this.match.split(/(?:\r\n?|\n)/g);this.match=this.match.substr(0,this.match.length-1),this.matched=this.matched.substr(0,this.matched.length-1),n.length-1&&(this.yylineno-=n.length-1);var i=this.yylloc.range;return this.yylloc={first_line:this.yylloc.first_line,last_line:this.yylineno+1,first_column:this.yylloc.first_column,last_column:n?(n.length===r.length?this.yylloc.first_column:0)+r[r.length-n.length].length-n[0].length:this.yylloc.first_column-e},this.options.ranges&&(this.yylloc.range=[i[0],i[0]+this.yyleng-e]),this.yyleng=this.yytext.length,this},more:function(){return this._more=!0,this},reject:function(){return this.options.backtrack_lexer?(this._backtrack=!0,this):this.parseError("Lexical error on line "+(this.yylineno+1)+". You can only invoke reject() in the lexer when the lexer is of the backtracking persuasion (options.backtrack_lexer = true).\n"+this.showPosition(),{text:"",token:null,line:this.yylineno})},less:function(t){this.unput(this.match.slice(t))},pastInput:function(){var t=this.matched.substr(0,this.matched.length-this.match.length);return(t.length>20?"...":"")+t.substr(-20).replace(/\n/g,"")},upcomingInput:function(){var t=this.match;return t.length<20&&(t+=this._input.substr(0,20-t.length)),(t.substr(0,20)+(t.length>20?"...":"")).replace(/\n/g,"")},showPosition:function(){var t=this.pastInput(),e=new Array(t.length+1).join("-");return t+this.upcomingInput()+"\n"+e+"^"},test_match:function(t,e){var n,r,i;if(this.options.backtrack_lexer&&(i={yylineno:this.yylineno,yylloc:{first_line:this.yylloc.first_line,last_line:this.last_line,first_column:this.yylloc.first_column,last_column:this.yylloc.last_column},yytext:this.yytext,match:this.match,matches:this.matches,matched:this.matched,yyleng:this.yyleng,offset:this.offset,_more:this._more,_input:this._input,yy:this.yy,conditionStack:this.conditionStack.slice(0),done:this.done},this.options.ranges&&(i.yylloc.range=this.yylloc.range.slice(0))),(r=t[0].match(/(?:\r\n?|\n).*/g))&&(this.yylineno+=r.length),this.yylloc={first_line:this.yylloc.last_line,last_line:this.yylineno+1,first_column:this.yylloc.last_column,last_column:r?r[r.length-1].length-r[r.length-1].match(/\r?\n?/)[0].length:this.yylloc.last_column+t[0].length},this.yytext+=t[0],this.match+=t[0],this.matches=t,this.yyleng=this.yytext.length,this.options.ranges&&(this.yylloc.range=[this.offset,this.offset+=this.yyleng]),this._more=!1,this._backtrack=!1,this._input=this._input.slice(t[0].length),this.matched+=t[0],n=this.performAction.call(this,this.yy,this,e,this.conditionStack[this.conditionStack.length-1]),this.done&&this._input&&(this.done=!1),n)return n;if(this._backtrack){for(var a in i)this[a]=i[a];return!1}return!1},next:function(){if(this.done)return this.EOF;var t,e,n,r;this._input||(this.done=!0),this._more||(this.yytext="",this.match="");for(var i=this._currentRules(),a=0;a<i.length;a++)if((n=this._input.match(this.rules[i[a]]))&&(!e||n[0].length>e[0].length)){if(e=n,r=a,this.options.backtrack_lexer){if(!1!==(t=this.test_match(n,i[a])))return t;if(this._backtrack){e=!1;continue}return!1}if(!this.options.flex)break}return e?!1!==(t=this.test_match(e,i[r]))&&t:""===this._input?this.EOF:this.parseError("Lexical error on line "+(this.yylineno+1)+". Unrecognized text.\n"+this.showPosition(),{text:"",token:null,line:this.yylineno})},lex:function(){var t=this.next();return t||this.lex()},begin:function(t){this.conditionStack.push(t)},popState:function(){return this.conditionStack.length-1>0?this.conditionStack.pop():this.conditionStack[0]},_currentRules:function(){return this.conditionStack.length&&this.conditionStack[this.conditionStack.length-1]?this.conditions[this.conditionStack[this.conditionStack.length-1]].rules:this.conditions.INITIAL.rules},topState:function(t){return(t=this.conditionStack.length-1-Math.abs(t||0))>=0?this.conditionStack[t]:"INITIAL"},pushState:function(t){this.begin(t)},stateStackSize:function(){return this.conditionStack.length},options:{"case-insensitive":!0},performAction:function(t,e,n,r){switch(n){case 0:return 5;case 1:case 2:case 3:case 4:break;case 5:return this.pushState("SCALE"),14;case 6:return 15;case 7:this.popState();break;case 8:this.pushState("STATE");break;case 9:return this.popState(),e.yytext=e.yytext.slice(0,-8).trim(),22;case 10:return this.popState(),e.yytext=e.yytext.slice(0,-8).trim(),23;case 11:return this.popState(),e.yytext=e.yytext.slice(0,-8).trim(),22;case 12:return this.popState(),e.yytext=e.yytext.slice(0,-8).trim(),23;case 13:this.begin("STATE_STRING");break;case 14:return this.popState(),this.pushState("STATE_ID"),"AS";case 15:return this.popState(),"ID";case 16:this.popState();break;case 17:return"STATE_DESCR";case 18:return 16;case 19:this.popState();break;case 20:return this.popState(),this.pushState("struct"),17;case 21:return this.popState(),18;case 22:break;case 23:return this.begin("NOTE"),25;case 24:return this.popState(),this.pushState("NOTE_ID"),29;case 25:return this.popState(),this.pushState("NOTE_ID"),30;case 26:this.popState(),this.pushState("FLOATING_NOTE");break;case 27:return this.popState(),this.pushState("FLOATING_NOTE_ID"),"AS";case 28:break;case 29:return"NOTE_TEXT";case 30:return this.popState(),"ID";case 31:return this.popState(),this.pushState("NOTE_TEXT"),21;case 32:return this.popState(),e.yytext=e.yytext.substr(2).trim(),27;case 33:return this.popState(),e.yytext=e.yytext.slice(0,-8).trim(),27;case 34:return 6;case 35:return 13;case 36:return 28;case 37:return 21;case 38:return e.yytext=e.yytext.trim(),11;case 39:return 12;case 40:return 24;case 41:return 5;case 42:return"INVALID"}},rules:[/^(?:[\n]+)/i,/^(?:\s+)/i,/^(?:((?!\n)\s)+)/i,/^(?:#[^\n]*)/i,/^(?:%[^\n]*)/i,/^(?:scale\s+)/i,/^(?:\d+)/i,/^(?:\s+width\b)/i,/^(?:state\s+)/i,/^(?:.*<<fork>>)/i,/^(?:.*<<join>>)/i,/^(?:.*\[\[fork\]\])/i,/^(?:.*\[\[join\]\])/i,/^(?:["])/i,/^(?:\s*as\s+)/i,/^(?:[^\n\{]*)/i,/^(?:["])/i,/^(?:[^"]*)/i,/^(?:[^\n\s\{]+)/i,/^(?:\n)/i,/^(?:\{)/i,/^(?:\})/i,/^(?:[\n])/i,/^(?:note\s+)/i,/^(?:left of\b)/i,/^(?:right of\b)/i,/^(?:")/i,/^(?:\s*as\s*)/i,/^(?:["])/i,/^(?:[^"]*)/i,/^(?:[^\n]*)/i,/^(?:\s*[^:\n\s\-]+)/i,/^(?:\s*:[^:\n;]+)/i,/^(?:\s*[^:;]+end note\b)/i,/^(?:stateDiagram\s+)/i,/^(?:hide empty description\b)/i,/^(?:\[\*\])/i,/^(?:[^:\n\s\-\{]+)/i,/^(?:\s*:[^:\n;]+)/i,/^(?:-->)/i,/^(?:--)/i,/^(?:$)/i,/^(?:.)/i],conditions:{LINE:{rules:[2,3],inclusive:!1},struct:{rules:[2,3,8,21,22,23,36,37,38,39,40],inclusive:!1},FLOATING_NOTE_ID:{rules:[30],inclusive:!1},FLOATING_NOTE:{rules:[27,28,29],inclusive:!1},NOTE_TEXT:{rules:[32,33],inclusive:!1},NOTE_ID:{rules:[31],inclusive:!1},NOTE:{rules:[24,25,26],inclusive:!1},SCALE:{rules:[6,7],inclusive:!1},ALIAS:{rules:[],inclusive:!1},STATE_ID:{rules:[15],inclusive:!1},STATE_STRING:{rules:[16,17],inclusive:!1},FORK_STATE:{rules:[],inclusive:!1},STATE:{rules:[2,3,9,10,11,12,13,14,18,19,20],inclusive:!1},ID:{rules:[2,3],inclusive:!1},INITIAL:{rules:[0,1,3,4,5,8,20,23,34,35,36,37,38,39,41,42],inclusive:!0}}};function x(){this.yy={}}return _.lexer=w,x.prototype=_,_.Parser=x,new x}();e.parser=i,e.Parser=i.Parser,e.parse=function(){return i.parse.apply(i,arguments)},e.main=function(r){r[1]||(console.log("Usage: "+r[0]+" FILE"),t.exit(1));var i=n(28).readFileSync(n(29).normalize(r[1]),"utf8");return e.parser.parse(i)},n.c[n.s]===r&&e.main(t.argv.slice(1))}).call(this,n(7),n(9)(t))},function(t,e,n){(function(t,n){(function(){var r="Expected a function",i="__lodash_placeholder__",a=[["ary",128],["bind",1],["bindKey",2],["curry",8],["curryRight",16],["flip",512],["partial",32],["partialRight",64],["rearg",256]],o="[object Arguments]",s="[object Array]",u="[object Boolean]",c="[object Date]",f="[object Error]",l="[object Function]",h="[object GeneratorFunction]",d="[object Map]",p="[object Number]",g="[object Object]",y="[object RegExp]",b="[object Set]",v="[object String]",m="[object Symbol]",_="[object WeakMap]",w="[object ArrayBuffer]",x="[object DataView]",k="[object Float32Array]",E="[object Float64Array]",A="[object Int8Array]",S="[object Int16Array]",M="[object Int32Array]",T="[object Uint8Array]",D="[object Uint16Array]",C="[object Uint32Array]",N=/\b__p \+= '';/g,I=/\b(__p \+=) '' \+/g,L=/(__e\(.*?\)|\b__t\)) \+\n'';/g,B=/&(?:amp|lt|gt|quot|#39);/g,O=/[&<>"']/g,R=RegExp(B.source),P=RegExp(O.source),F=/<%-([\s\S]+?)%>/g,q=/<%([\s\S]+?)%>/g,j=/<%=([\s\S]+?)%>/g,U=/\.|\[(?:[^[\]]*|(["'])(?:(?!\1)[^\\]|\\.)*?\1)\]/,z=/^\w*$/,Y=/[^.[\]]+|\[(?:(-?\d+(?:\.\d+)?)|(["'])((?:(?!\2)[^\\]|\\.)*?)\2)\]|(?=(?:\.|\[\])(?:\.|\[\]|$))/g,V=/[\\^$.*+?()[\]{}|]/g,H=RegExp(V.source),G=/^\s+|\s+$/g,$=/^\s+/,W=/\s+$/,K=/\{(?:\n\/\* \[wrapped with .+\] \*\/)?\n?/,X=/\{\n\/\* \[wrapped with (.+)\] \*/,Z=/,? & /,J=/[^\x00-\x2f\x3a-\x40\x5b-\x60\x7b-\x7f]+/g,Q=/\\(\\)?/g,tt=/\$\{([^\\}]*(?:\\.[^\\}]*)*)\}/g,et=/\w*$/,nt=/^[-+]0x[0-9a-f]+$/i,rt=/^0b[01]+$/i,it=/^\[object .+?Constructor\]$/,at=/^0o[0-7]+$/i,ot=/^(?:0|[1-9]\d*)$/,st=/[\xc0-\xd6\xd8-\xf6\xf8-\xff\u0100-\u017f]/g,ut=/($^)/,ct=/['\n\r\u2028\u2029\\]/g,ft="\\u0300-\\u036f\\ufe20-\\ufe2f\\u20d0-\\u20ff",lt="\\xac\\xb1\\xd7\\xf7\\x00-\\x2f\\x3a-\\x40\\x5b-\\x60\\x7b-\\xbf\\u2000-\\u206f \\t\\x0b\\f\\xa0\\ufeff\\n\\r\\u2028\\u2029\\u1680\\u180e\\u2000\\u2001\\u2002\\u2003\\u2004\\u2005\\u2006\\u2007\\u2008\\u2009\\u200a\\u202f\\u205f\\u3000",ht="[\\ud800-\\udfff]",dt="["+lt+"]",pt="["+ft+"]",gt="\\d+",yt="[\\u2700-\\u27bf]",bt="[a-z\\xdf-\\xf6\\xf8-\\xff]",vt="[^\\ud800-\\udfff"+lt+gt+"\\u2700-\\u27bfa-z\\xdf-\\xf6\\xf8-\\xffA-Z\\xc0-\\xd6\\xd8-\\xde]",mt="\\ud83c[\\udffb-\\udfff]",_t="[^\\ud800-\\udfff]",wt="(?:\\ud83c[\\udde6-\\uddff]){2}",xt="[\\ud800-\\udbff][\\udc00-\\udfff]",kt="[A-Z\\xc0-\\xd6\\xd8-\\xde]",Et="(?:"+bt+"|"+vt+")",At="(?:"+kt+"|"+vt+")",St="(?:"+pt+"|"+mt+")"+"?",Mt="[\\ufe0e\\ufe0f]?"+St+("(?:\\u200d(?:"+[_t,wt,xt].join("|")+")[\\ufe0e\\ufe0f]?"+St+")*"),Tt="(?:"+[yt,wt,xt].join("|")+")"+Mt,Dt="(?:"+[_t+pt+"?",pt,wt,xt,ht].join("|")+")",Ct=RegExp("['’]","g"),Nt=RegExp(pt,"g"),It=RegExp(mt+"(?="+mt+")|"+Dt+Mt,"g"),Lt=RegExp([kt+"?"+bt+"+(?:['’](?:d|ll|m|re|s|t|ve))?(?="+[dt,kt,"$"].join("|")+")",At+"+(?:['’](?:D|LL|M|RE|S|T|VE))?(?="+[dt,kt+Et,"$"].join("|")+")",kt+"?"+Et+"+(?:['’](?:d|ll|m|re|s|t|ve))?",kt+"+(?:['’](?:D|LL|M|RE|S|T|VE))?","\\d*(?:1ST|2ND|3RD|(?![123])\\dTH)(?=\\b|[a-z_])","\\d*(?:1st|2nd|3rd|(?![123])\\dth)(?=\\b|[A-Z_])",gt,Tt].join("|"),"g"),Bt=RegExp("[\\u200d\\ud800-\\udfff"+ft+"\\ufe0e\\ufe0f]"),Ot=/[a-z][A-Z]|[A-Z]{2}[a-z]|[0-9][a-zA-Z]|[a-zA-Z][0-9]|[^a-zA-Z0-9 ]/,Rt=["Array","Buffer","DataView","Date","Error","Float32Array","Float64Array","Function","Int8Array","Int16Array","Int32Array","Map","Math","Object","Promise","RegExp","Set","String","Symbol","TypeError","Uint8Array","Uint8ClampedArray","Uint16Array","Uint32Array","WeakMap","_","clearTimeout","isFinite","parseInt","setTimeout"],Pt=-1,Ft={};Ft[k]=Ft[E]=Ft[A]=Ft[S]=Ft[M]=Ft[T]=Ft["[object Uint8ClampedArray]"]=Ft[D]=Ft[C]=!0,Ft[o]=Ft[s]=Ft[w]=Ft[u]=Ft[x]=Ft[c]=Ft[f]=Ft[l]=Ft[d]=Ft[p]=Ft[g]=Ft[y]=Ft[b]=Ft[v]=Ft[_]=!1;var qt={};qt[o]=qt[s]=qt[w]=qt[x]=qt[u]=qt[c]=qt[k]=qt[E]=qt[A]=qt[S]=qt[M]=qt[d]=qt[p]=qt[g]=qt[y]=qt[b]=qt[v]=qt[m]=qt[T]=qt["[object Uint8ClampedArray]"]=qt[D]=qt[C]=!0,qt[f]=qt[l]=qt[_]=!1;var jt={"\\":"\\","'":"'","\n":"n","\r":"r","\u2028":"u2028","\u2029":"u2029"},Ut=parseFloat,zt=parseInt,Yt="object"==typeof t&&t&&t.Object===Object&&t,Vt="object"==typeof self&&self&&self.Object===Object&&self,Ht=Yt||Vt||Function("return this")(),Gt=e&&!e.nodeType&&e,$t=Gt&&"object"==typeof n&&n&&!n.nodeType&&n,Wt=$t&&$t.exports===Gt,Kt=Wt&&Yt.process,Xt=function(){try{var t=$t&&$t.require&&$t.require("util").types;return t||Kt&&Kt.binding&&Kt.binding("util")}catch(t){}}(),Zt=Xt&&Xt.isArrayBuffer,Jt=Xt&&Xt.isDate,Qt=Xt&&Xt.isMap,te=Xt&&Xt.isRegExp,ee=Xt&&Xt.isSet,ne=Xt&&Xt.isTypedArray;function re(t,e,n){switch(n.length){case 0:return t.call(e);case 1:return t.call(e,n[0]);case 2:return t.call(e,n[0],n[1]);case 3:return t.call(e,n[0],n[1],n[2])}return t.apply(e,n)}function ie(t,e,n,r){for(var i=-1,a=null==t?0:t.length;++i<a;){var o=t[i];e(r,o,n(o),t)}return r}function ae(t,e){for(var n=-1,r=null==t?0:t.length;++n<r&&!1!==e(t[n],n,t););return t}function oe(t,e){for(var n=null==t?0:t.length;n--&&!1!==e(t[n],n,t););return t}function se(t,e){for(var n=-1,r=null==t?0:t.length;++n<r;)if(!e(t[n],n,t))return!1;return!0}function ue(t,e){for(var n=-1,r=null==t?0:t.length,i=0,a=[];++n<r;){var o=t[n];e(o,n,t)&&(a[i++]=o)}return a}function ce(t,e){return!!(null==t?0:t.length)&&me(t,e,0)>-1}function fe(t,e,n){for(var r=-1,i=null==t?0:t.length;++r<i;)if(n(e,t[r]))return!0;return!1}function le(t,e){for(var n=-1,r=null==t?0:t.length,i=Array(r);++n<r;)i[n]=e(t[n],n,t);return i}function he(t,e){for(var n=-1,r=e.length,i=t.length;++n<r;)t[i+n]=e[n];return t}function de(t,e,n,r){var i=-1,a=null==t?0:t.length;for(r&&a&&(n=t[++i]);++i<a;)n=e(n,t[i],i,t);return n}function pe(t,e,n,r){var i=null==t?0:t.length;for(r&&i&&(n=t[--i]);i--;)n=e(n,t[i],i,t);return n}function ge(t,e){for(var n=-1,r=null==t?0:t.length;++n<r;)if(e(t[n],n,t))return!0;return!1}var ye=ke("length");function be(t,e,n){var r;return n(t,(function(t,n,i){if(e(t,n,i))return r=n,!1})),r}function ve(t,e,n,r){for(var i=t.length,a=n+(r?1:-1);r?a--:++a<i;)if(e(t[a],a,t))return a;return-1}function me(t,e,n){return e==e?function(t,e,n){var r=n-1,i=t.length;for(;++r<i;)if(t[r]===e)return r;return-1}(t,e,n):ve(t,we,n)}function _e(t,e,n,r){for(var i=n-1,a=t.length;++i<a;)if(r(t[i],e))return i;return-1}function we(t){return t!=t}function xe(t,e){var n=null==t?0:t.length;return n?Se(t,e)/n:NaN}function ke(t){return function(e){return null==e?void 0:e[t]}}function Ee(t){return function(e){return null==t?void 0:t[e]}}function Ae(t,e,n,r,i){return i(t,(function(t,i,a){n=r?(r=!1,t):e(n,t,i,a)})),n}function Se(t,e){for(var n,r=-1,i=t.length;++r<i;){var a=e(t[r]);void 0!==a&&(n=void 0===n?a:n+a)}return n}function Me(t,e){for(var n=-1,r=Array(t);++n<t;)r[n]=e(n);return r}function Te(t){return function(e){return t(e)}}function De(t,e){return le(e,(function(e){return t[e]}))}function Ce(t,e){return t.has(e)}function Ne(t,e){for(var n=-1,r=t.length;++n<r&&me(e,t[n],0)>-1;);return n}function Ie(t,e){for(var n=t.length;n--&&me(e,t[n],0)>-1;);return n}function Le(t,e){for(var n=t.length,r=0;n--;)t[n]===e&&++r;return r}var Be=Ee({"À":"A","Á":"A","Â":"A","Ã":"A","Ä":"A","Å":"A","à":"a","á":"a","â":"a","ã":"a","ä":"a","å":"a","Ç":"C","ç":"c","Ð":"D","ð":"d","È":"E","É":"E","Ê":"E","Ë":"E","è":"e","é":"e","ê":"e","ë":"e","Ì":"I","Í":"I","Î":"I","Ï":"I","ì":"i","í":"i","î":"i","ï":"i","Ñ":"N","ñ":"n","Ò":"O","Ó":"O","Ô":"O","Õ":"O","Ö":"O","Ø":"O","ò":"o","ó":"o","ô":"o","õ":"o","ö":"o","ø":"o","Ù":"U","Ú":"U","Û":"U","Ü":"U","ù":"u","ú":"u","û":"u","ü":"u","Ý":"Y","ý":"y","ÿ":"y","Æ":"Ae","æ":"ae","Þ":"Th","þ":"th","ß":"ss","Ā":"A","Ă":"A","Ą":"A","ā":"a","ă":"a","ą":"a","Ć":"C","Ĉ":"C","Ċ":"C","Č":"C","ć":"c","ĉ":"c","ċ":"c","č":"c","Ď":"D","Đ":"D","ď":"d","đ":"d","Ē":"E","Ĕ":"E","Ė":"E","Ę":"E","Ě":"E","ē":"e","ĕ":"e","ė":"e","ę":"e","ě":"e","Ĝ":"G","Ğ":"G","Ġ":"G","Ģ":"G","ĝ":"g","ğ":"g","ġ":"g","ģ":"g","Ĥ":"H","Ħ":"H","ĥ":"h","ħ":"h","Ĩ":"I","Ī":"I","Ĭ":"I","Į":"I","İ":"I","ĩ":"i","ī":"i","ĭ":"i","į":"i","ı":"i","Ĵ":"J","ĵ":"j","Ķ":"K","ķ":"k","ĸ":"k","Ĺ":"L","Ļ":"L","Ľ":"L","Ŀ":"L","Ł":"L","ĺ":"l","ļ":"l","ľ":"l","ŀ":"l","ł":"l","Ń":"N","Ņ":"N","Ň":"N","Ŋ":"N","ń":"n","ņ":"n","ň":"n","ŋ":"n","Ō":"O","Ŏ":"O","Ő":"O","ō":"o","ŏ":"o","ő":"o","Ŕ":"R","Ŗ":"R","Ř":"R","ŕ":"r","ŗ":"r","ř":"r","Ś":"S","Ŝ":"S","Ş":"S","Š":"S","ś":"s","ŝ":"s","ş":"s","š":"s","Ţ":"T","Ť":"T","Ŧ":"T","ţ":"t","ť":"t","ŧ":"t","Ũ":"U","Ū":"U","Ŭ":"U","Ů":"U","Ű":"U","Ų":"U","ũ":"u","ū":"u","ŭ":"u","ů":"u","ű":"u","ų":"u","Ŵ":"W","ŵ":"w","Ŷ":"Y","ŷ":"y","Ÿ":"Y","Ź":"Z","Ż":"Z","Ž":"Z","ź":"z","ż":"z","ž":"z","IJ":"IJ","ij":"ij","Œ":"Oe","œ":"oe","ʼn":"'n","ſ":"s"}),Oe=Ee({"&":"&","<":"<",">":">",'"':""","'":"'"});function Re(t){return"\\"+jt[t]}function Pe(t){return Bt.test(t)}function Fe(t){var e=-1,n=Array(t.size);return t.forEach((function(t,r){n[++e]=[r,t]})),n}function qe(t,e){return function(n){return t(e(n))}}function je(t,e){for(var n=-1,r=t.length,a=0,o=[];++n<r;){var s=t[n];s!==e&&s!==i||(t[n]=i,o[a++]=n)}return o}function Ue(t){var e=-1,n=Array(t.size);return t.forEach((function(t){n[++e]=t})),n}function ze(t){var e=-1,n=Array(t.size);return t.forEach((function(t){n[++e]=[t,t]})),n}function Ye(t){return Pe(t)?function(t){var e=It.lastIndex=0;for(;It.test(t);)++e;return e}(t):ye(t)}function Ve(t){return Pe(t)?function(t){return t.match(It)||[]}(t):function(t){return t.split("")}(t)}var He=Ee({"&":"&","<":"<",">":">",""":'"',"'":"'"});var Ge=function t(e){var n,ft=(e=null==e?Ht:Ge.defaults(Ht.Object(),e,Ge.pick(Ht,Rt))).Array,lt=e.Date,ht=e.Error,dt=e.Function,pt=e.Math,gt=e.Object,yt=e.RegExp,bt=e.String,vt=e.TypeError,mt=ft.prototype,_t=dt.prototype,wt=gt.prototype,xt=e["__core-js_shared__"],kt=_t.toString,Et=wt.hasOwnProperty,At=0,St=(n=/[^.]+$/.exec(xt&&xt.keys&&xt.keys.IE_PROTO||""))?"Symbol(src)_1."+n:"",Mt=wt.toString,Tt=kt.call(gt),Dt=Ht._,It=yt("^"+kt.call(Et).replace(V,"\\$&").replace(/hasOwnProperty|(function).*?(?=\\\()| for .+?(?=\\\])/g,"$1.*?")+"$"),Bt=Wt?e.Buffer:void 0,jt=e.Symbol,Yt=e.Uint8Array,Vt=Bt?Bt.allocUnsafe:void 0,Gt=qe(gt.getPrototypeOf,gt),$t=gt.create,Kt=wt.propertyIsEnumerable,Xt=mt.splice,ye=jt?jt.isConcatSpreadable:void 0,Ee=jt?jt.iterator:void 0,$e=jt?jt.toStringTag:void 0,We=function(){try{var t=Qi(gt,"defineProperty");return t({},"",{}),t}catch(t){}}(),Ke=e.clearTimeout!==Ht.clearTimeout&&e.clearTimeout,Xe=lt&<.now!==Ht.Date.now&<.now,Ze=e.setTimeout!==Ht.setTimeout&&e.setTimeout,Je=pt.ceil,Qe=pt.floor,tn=gt.getOwnPropertySymbols,en=Bt?Bt.isBuffer:void 0,nn=e.isFinite,rn=mt.join,an=qe(gt.keys,gt),on=pt.max,sn=pt.min,un=lt.now,cn=e.parseInt,fn=pt.random,ln=mt.reverse,hn=Qi(e,"DataView"),dn=Qi(e,"Map"),pn=Qi(e,"Promise"),gn=Qi(e,"Set"),yn=Qi(e,"WeakMap"),bn=Qi(gt,"create"),vn=yn&&new yn,mn={},_n=Sa(hn),wn=Sa(dn),xn=Sa(pn),kn=Sa(gn),En=Sa(yn),An=jt?jt.prototype:void 0,Sn=An?An.valueOf:void 0,Mn=An?An.toString:void 0;function Tn(t){if(Vo(t)&&!Lo(t)&&!(t instanceof In)){if(t instanceof Nn)return t;if(Et.call(t,"__wrapped__"))return Ma(t)}return new Nn(t)}var Dn=function(){function t(){}return function(e){if(!Yo(e))return{};if($t)return $t(e);t.prototype=e;var n=new t;return t.prototype=void 0,n}}();function Cn(){}function Nn(t,e){this.__wrapped__=t,this.__actions__=[],this.__chain__=!!e,this.__index__=0,this.__values__=void 0}function In(t){this.__wrapped__=t,this.__actions__=[],this.__dir__=1,this.__filtered__=!1,this.__iteratees__=[],this.__takeCount__=4294967295,this.__views__=[]}function Ln(t){var e=-1,n=null==t?0:t.length;for(this.clear();++e<n;){var r=t[e];this.set(r[0],r[1])}}function Bn(t){var e=-1,n=null==t?0:t.length;for(this.clear();++e<n;){var r=t[e];this.set(r[0],r[1])}}function On(t){var e=-1,n=null==t?0:t.length;for(this.clear();++e<n;){var r=t[e];this.set(r[0],r[1])}}function Rn(t){var e=-1,n=null==t?0:t.length;for(this.__data__=new On;++e<n;)this.add(t[e])}function Pn(t){var e=this.__data__=new Bn(t);this.size=e.size}function Fn(t,e){var n=Lo(t),r=!n&&Io(t),i=!n&&!r&&Po(t),a=!n&&!r&&!i&&Jo(t),o=n||r||i||a,s=o?Me(t.length,bt):[],u=s.length;for(var c in t)!e&&!Et.call(t,c)||o&&("length"==c||i&&("offset"==c||"parent"==c)||a&&("buffer"==c||"byteLength"==c||"byteOffset"==c)||oa(c,u))||s.push(c);return s}function qn(t){var e=t.length;return e?t[Rr(0,e-1)]:void 0}function jn(t,e){return ka(bi(t),Kn(e,0,t.length))}function Un(t){return ka(bi(t))}function zn(t,e,n){(void 0===n||Do(t[e],n))&&(void 0!==n||e in t)||$n(t,e,n)}function Yn(t,e,n){var r=t[e];Et.call(t,e)&&Do(r,n)&&(void 0!==n||e in t)||$n(t,e,n)}function Vn(t,e){for(var n=t.length;n--;)if(Do(t[n][0],e))return n;return-1}function Hn(t,e,n,r){return tr(t,(function(t,i,a){e(r,t,n(t),a)})),r}function Gn(t,e){return t&&vi(e,_s(e),t)}function $n(t,e,n){"__proto__"==e&&We?We(t,e,{configurable:!0,enumerable:!0,value:n,writable:!0}):t[e]=n}function Wn(t,e){for(var n=-1,r=e.length,i=ft(r),a=null==t;++n<r;)i[n]=a?void 0:gs(t,e[n]);return i}function Kn(t,e,n){return t==t&&(void 0!==n&&(t=t<=n?t:n),void 0!==e&&(t=t>=e?t:e)),t}function Xn(t,e,n,r,i,a){var s,f=1&e,_=2&e,N=4&e;if(n&&(s=i?n(t,r,i,a):n(t)),void 0!==s)return s;if(!Yo(t))return t;var I=Lo(t);if(I){if(s=function(t){var e=t.length,n=new t.constructor(e);e&&"string"==typeof t[0]&&Et.call(t,"index")&&(n.index=t.index,n.input=t.input);return n}(t),!f)return bi(t,s)}else{var L=na(t),B=L==l||L==h;if(Po(t))return li(t,f);if(L==g||L==o||B&&!i){if(s=_||B?{}:ia(t),!f)return _?function(t,e){return vi(t,ea(t),e)}(t,function(t,e){return t&&vi(e,ws(e),t)}(s,t)):function(t,e){return vi(t,ta(t),e)}(t,Gn(s,t))}else{if(!qt[L])return i?t:{};s=function(t,e,n){var r=t.constructor;switch(e){case w:return hi(t);case u:case c:return new r(+t);case x:return function(t,e){var n=e?hi(t.buffer):t.buffer;return new t.constructor(n,t.byteOffset,t.byteLength)}(t,n);case k:case E:case A:case S:case M:case T:case"[object Uint8ClampedArray]":case D:case C:return di(t,n);case d:return new r;case p:case v:return new r(t);case y:return function(t){var e=new t.constructor(t.source,et.exec(t));return e.lastIndex=t.lastIndex,e}(t);case b:return new r;case m:return i=t,Sn?gt(Sn.call(i)):{}}var i}(t,L,f)}}a||(a=new Pn);var O=a.get(t);if(O)return O;a.set(t,s),Ko(t)?t.forEach((function(r){s.add(Xn(r,e,n,r,t,a))})):Ho(t)&&t.forEach((function(r,i){s.set(i,Xn(r,e,n,i,t,a))}));var R=I?void 0:(N?_?Gi:Hi:_?ws:_s)(t);return ae(R||t,(function(r,i){R&&(r=t[i=r]),Yn(s,i,Xn(r,e,n,i,t,a))})),s}function Zn(t,e,n){var r=n.length;if(null==t)return!r;for(t=gt(t);r--;){var i=n[r],a=e[i],o=t[i];if(void 0===o&&!(i in t)||!a(o))return!1}return!0}function Jn(t,e,n){if("function"!=typeof t)throw new vt(r);return ma((function(){t.apply(void 0,n)}),e)}function Qn(t,e,n,r){var i=-1,a=ce,o=!0,s=t.length,u=[],c=e.length;if(!s)return u;n&&(e=le(e,Te(n))),r?(a=fe,o=!1):e.length>=200&&(a=Ce,o=!1,e=new Rn(e));t:for(;++i<s;){var f=t[i],l=null==n?f:n(f);if(f=r||0!==f?f:0,o&&l==l){for(var h=c;h--;)if(e[h]===l)continue t;u.push(f)}else a(e,l,r)||u.push(f)}return u}Tn.templateSettings={escape:F,evaluate:q,interpolate:j,variable:"",imports:{_:Tn}},Tn.prototype=Cn.prototype,Tn.prototype.constructor=Tn,Nn.prototype=Dn(Cn.prototype),Nn.prototype.constructor=Nn,In.prototype=Dn(Cn.prototype),In.prototype.constructor=In,Ln.prototype.clear=function(){this.__data__=bn?bn(null):{},this.size=0},Ln.prototype.delete=function(t){var e=this.has(t)&&delete this.__data__[t];return this.size-=e?1:0,e},Ln.prototype.get=function(t){var e=this.__data__;if(bn){var n=e[t];return"__lodash_hash_undefined__"===n?void 0:n}return Et.call(e,t)?e[t]:void 0},Ln.prototype.has=function(t){var e=this.__data__;return bn?void 0!==e[t]:Et.call(e,t)},Ln.prototype.set=function(t,e){var n=this.__data__;return this.size+=this.has(t)?0:1,n[t]=bn&&void 0===e?"__lodash_hash_undefined__":e,this},Bn.prototype.clear=function(){this.__data__=[],this.size=0},Bn.prototype.delete=function(t){var e=this.__data__,n=Vn(e,t);return!(n<0)&&(n==e.length-1?e.pop():Xt.call(e,n,1),--this.size,!0)},Bn.prototype.get=function(t){var e=this.__data__,n=Vn(e,t);return n<0?void 0:e[n][1]},Bn.prototype.has=function(t){return Vn(this.__data__,t)>-1},Bn.prototype.set=function(t,e){var n=this.__data__,r=Vn(n,t);return r<0?(++this.size,n.push([t,e])):n[r][1]=e,this},On.prototype.clear=function(){this.size=0,this.__data__={hash:new Ln,map:new(dn||Bn),string:new Ln}},On.prototype.delete=function(t){var e=Zi(this,t).delete(t);return this.size-=e?1:0,e},On.prototype.get=function(t){return Zi(this,t).get(t)},On.prototype.has=function(t){return Zi(this,t).has(t)},On.prototype.set=function(t,e){var n=Zi(this,t),r=n.size;return n.set(t,e),this.size+=n.size==r?0:1,this},Rn.prototype.add=Rn.prototype.push=function(t){return this.__data__.set(t,"__lodash_hash_undefined__"),this},Rn.prototype.has=function(t){return this.__data__.has(t)},Pn.prototype.clear=function(){this.__data__=new Bn,this.size=0},Pn.prototype.delete=function(t){var e=this.__data__,n=e.delete(t);return this.size=e.size,n},Pn.prototype.get=function(t){return this.__data__.get(t)},Pn.prototype.has=function(t){return this.__data__.has(t)},Pn.prototype.set=function(t,e){var n=this.__data__;if(n instanceof Bn){var r=n.__data__;if(!dn||r.length<199)return r.push([t,e]),this.size=++n.size,this;n=this.__data__=new On(r)}return n.set(t,e),this.size=n.size,this};var tr=wi(ur),er=wi(cr,!0);function nr(t,e){var n=!0;return tr(t,(function(t,r,i){return n=!!e(t,r,i)})),n}function rr(t,e,n){for(var r=-1,i=t.length;++r<i;){var a=t[r],o=e(a);if(null!=o&&(void 0===s?o==o&&!Zo(o):n(o,s)))var s=o,u=a}return u}function ir(t,e){var n=[];return tr(t,(function(t,r,i){e(t,r,i)&&n.push(t)})),n}function ar(t,e,n,r,i){var a=-1,o=t.length;for(n||(n=aa),i||(i=[]);++a<o;){var s=t[a];e>0&&n(s)?e>1?ar(s,e-1,n,r,i):he(i,s):r||(i[i.length]=s)}return i}var or=xi(),sr=xi(!0);function ur(t,e){return t&&or(t,e,_s)}function cr(t,e){return t&&sr(t,e,_s)}function fr(t,e){return ue(e,(function(e){return jo(t[e])}))}function lr(t,e){for(var n=0,r=(e=si(e,t)).length;null!=t&&n<r;)t=t[Aa(e[n++])];return n&&n==r?t:void 0}function hr(t,e,n){var r=e(t);return Lo(t)?r:he(r,n(t))}function dr(t){return null==t?void 0===t?"[object Undefined]":"[object Null]":$e&&$e in gt(t)?function(t){var e=Et.call(t,$e),n=t[$e];try{t[$e]=void 0;var r=!0}catch(t){}var i=Mt.call(t);r&&(e?t[$e]=n:delete t[$e]);return i}(t):function(t){return Mt.call(t)}(t)}function pr(t,e){return t>e}function gr(t,e){return null!=t&&Et.call(t,e)}function yr(t,e){return null!=t&&e in gt(t)}function br(t,e,n){for(var r=n?fe:ce,i=t[0].length,a=t.length,o=a,s=ft(a),u=1/0,c=[];o--;){var f=t[o];o&&e&&(f=le(f,Te(e))),u=sn(f.length,u),s[o]=!n&&(e||i>=120&&f.length>=120)?new Rn(o&&f):void 0}f=t[0];var l=-1,h=s[0];t:for(;++l<i&&c.length<u;){var d=f[l],p=e?e(d):d;if(d=n||0!==d?d:0,!(h?Ce(h,p):r(c,p,n))){for(o=a;--o;){var g=s[o];if(!(g?Ce(g,p):r(t[o],p,n)))continue t}h&&h.push(p),c.push(d)}}return c}function vr(t,e,n){var r=null==(t=ga(t,e=si(e,t)))?t:t[Aa(Fa(e))];return null==r?void 0:re(r,t,n)}function mr(t){return Vo(t)&&dr(t)==o}function _r(t,e,n,r,i){return t===e||(null==t||null==e||!Vo(t)&&!Vo(e)?t!=t&&e!=e:function(t,e,n,r,i,a){var l=Lo(t),h=Lo(e),_=l?s:na(t),k=h?s:na(e),E=(_=_==o?g:_)==g,A=(k=k==o?g:k)==g,S=_==k;if(S&&Po(t)){if(!Po(e))return!1;l=!0,E=!1}if(S&&!E)return a||(a=new Pn),l||Jo(t)?Yi(t,e,n,r,i,a):function(t,e,n,r,i,a,o){switch(n){case x:if(t.byteLength!=e.byteLength||t.byteOffset!=e.byteOffset)return!1;t=t.buffer,e=e.buffer;case w:return!(t.byteLength!=e.byteLength||!a(new Yt(t),new Yt(e)));case u:case c:case p:return Do(+t,+e);case f:return t.name==e.name&&t.message==e.message;case y:case v:return t==e+"";case d:var s=Fe;case b:var l=1&r;if(s||(s=Ue),t.size!=e.size&&!l)return!1;var h=o.get(t);if(h)return h==e;r|=2,o.set(t,e);var g=Yi(s(t),s(e),r,i,a,o);return o.delete(t),g;case m:if(Sn)return Sn.call(t)==Sn.call(e)}return!1}(t,e,_,n,r,i,a);if(!(1&n)){var M=E&&Et.call(t,"__wrapped__"),T=A&&Et.call(e,"__wrapped__");if(M||T){var D=M?t.value():t,C=T?e.value():e;return a||(a=new Pn),i(D,C,n,r,a)}}if(!S)return!1;return a||(a=new Pn),function(t,e,n,r,i,a){var o=1&n,s=Hi(t),u=s.length,c=Hi(e).length;if(u!=c&&!o)return!1;var f=u;for(;f--;){var l=s[f];if(!(o?l in e:Et.call(e,l)))return!1}var h=a.get(t);if(h&&a.get(e))return h==e;var d=!0;a.set(t,e),a.set(e,t);var p=o;for(;++f<u;){l=s[f];var g=t[l],y=e[l];if(r)var b=o?r(y,g,l,e,t,a):r(g,y,l,t,e,a);if(!(void 0===b?g===y||i(g,y,n,r,a):b)){d=!1;break}p||(p="constructor"==l)}if(d&&!p){var v=t.constructor,m=e.constructor;v!=m&&"constructor"in t&&"constructor"in e&&!("function"==typeof v&&v instanceof v&&"function"==typeof m&&m instanceof m)&&(d=!1)}return a.delete(t),a.delete(e),d}(t,e,n,r,i,a)}(t,e,n,r,_r,i))}function wr(t,e,n,r){var i=n.length,a=i,o=!r;if(null==t)return!a;for(t=gt(t);i--;){var s=n[i];if(o&&s[2]?s[1]!==t[s[0]]:!(s[0]in t))return!1}for(;++i<a;){var u=(s=n[i])[0],c=t[u],f=s[1];if(o&&s[2]){if(void 0===c&&!(u in t))return!1}else{var l=new Pn;if(r)var h=r(c,f,u,t,e,l);if(!(void 0===h?_r(f,c,3,r,l):h))return!1}}return!0}function xr(t){return!(!Yo(t)||(e=t,St&&St in e))&&(jo(t)?It:it).test(Sa(t));var e}function kr(t){return"function"==typeof t?t:null==t?Gs:"object"==typeof t?Lo(t)?Dr(t[0],t[1]):Tr(t):eu(t)}function Er(t){if(!la(t))return an(t);var e=[];for(var n in gt(t))Et.call(t,n)&&"constructor"!=n&&e.push(n);return e}function Ar(t){if(!Yo(t))return function(t){var e=[];if(null!=t)for(var n in gt(t))e.push(n);return e}(t);var e=la(t),n=[];for(var r in t)("constructor"!=r||!e&&Et.call(t,r))&&n.push(r);return n}function Sr(t,e){return t<e}function Mr(t,e){var n=-1,r=Oo(t)?ft(t.length):[];return tr(t,(function(t,i,a){r[++n]=e(t,i,a)})),r}function Tr(t){var e=Ji(t);return 1==e.length&&e[0][2]?da(e[0][0],e[0][1]):function(n){return n===t||wr(n,t,e)}}function Dr(t,e){return ua(t)&&ha(e)?da(Aa(t),e):function(n){var r=gs(n,t);return void 0===r&&r===e?ys(n,t):_r(e,r,3)}}function Cr(t,e,n,r,i){t!==e&&or(e,(function(a,o){if(i||(i=new Pn),Yo(a))!function(t,e,n,r,i,a,o){var s=ba(t,n),u=ba(e,n),c=o.get(u);if(c)return void zn(t,n,c);var f=a?a(s,u,n+"",t,e,o):void 0,l=void 0===f;if(l){var h=Lo(u),d=!h&&Po(u),p=!h&&!d&&Jo(u);f=u,h||d||p?Lo(s)?f=s:Ro(s)?f=bi(s):d?(l=!1,f=li(u,!0)):p?(l=!1,f=di(u,!0)):f=[]:$o(u)||Io(u)?(f=s,Io(s)?f=os(s):Yo(s)&&!jo(s)||(f=ia(u))):l=!1}l&&(o.set(u,f),i(f,u,r,a,o),o.delete(u));zn(t,n,f)}(t,e,o,n,Cr,r,i);else{var s=r?r(ba(t,o),a,o+"",t,e,i):void 0;void 0===s&&(s=a),zn(t,o,s)}}),ws)}function Nr(t,e){var n=t.length;if(n)return oa(e+=e<0?n:0,n)?t[e]:void 0}function Ir(t,e,n){var r=-1;return e=le(e.length?e:[Gs],Te(Xi())),function(t,e){var n=t.length;for(t.sort(e);n--;)t[n]=t[n].value;return t}(Mr(t,(function(t,n,i){return{criteria:le(e,(function(e){return e(t)})),index:++r,value:t}})),(function(t,e){return function(t,e,n){var r=-1,i=t.criteria,a=e.criteria,o=i.length,s=n.length;for(;++r<o;){var u=pi(i[r],a[r]);if(u){if(r>=s)return u;var c=n[r];return u*("desc"==c?-1:1)}}return t.index-e.index}(t,e,n)}))}function Lr(t,e,n){for(var r=-1,i=e.length,a={};++r<i;){var o=e[r],s=lr(t,o);n(s,o)&&Ur(a,si(o,t),s)}return a}function Br(t,e,n,r){var i=r?_e:me,a=-1,o=e.length,s=t;for(t===e&&(e=bi(e)),n&&(s=le(t,Te(n)));++a<o;)for(var u=0,c=e[a],f=n?n(c):c;(u=i(s,f,u,r))>-1;)s!==t&&Xt.call(s,u,1),Xt.call(t,u,1);return t}function Or(t,e){for(var n=t?e.length:0,r=n-1;n--;){var i=e[n];if(n==r||i!==a){var a=i;oa(i)?Xt.call(t,i,1):Qr(t,i)}}return t}function Rr(t,e){return t+Qe(fn()*(e-t+1))}function Pr(t,e){var n="";if(!t||e<1||e>9007199254740991)return n;do{e%2&&(n+=t),(e=Qe(e/2))&&(t+=t)}while(e);return n}function Fr(t,e){return _a(pa(t,e,Gs),t+"")}function qr(t){return qn(Ds(t))}function jr(t,e){var n=Ds(t);return ka(n,Kn(e,0,n.length))}function Ur(t,e,n,r){if(!Yo(t))return t;for(var i=-1,a=(e=si(e,t)).length,o=a-1,s=t;null!=s&&++i<a;){var u=Aa(e[i]),c=n;if(i!=o){var f=s[u];void 0===(c=r?r(f,u,s):void 0)&&(c=Yo(f)?f:oa(e[i+1])?[]:{})}Yn(s,u,c),s=s[u]}return t}var zr=vn?function(t,e){return vn.set(t,e),t}:Gs,Yr=We?function(t,e){return We(t,"toString",{configurable:!0,enumerable:!1,value:Ys(e),writable:!0})}:Gs;function Vr(t){return ka(Ds(t))}function Hr(t,e,n){var r=-1,i=t.length;e<0&&(e=-e>i?0:i+e),(n=n>i?i:n)<0&&(n+=i),i=e>n?0:n-e>>>0,e>>>=0;for(var a=ft(i);++r<i;)a[r]=t[r+e];return a}function Gr(t,e){var n;return tr(t,(function(t,r,i){return!(n=e(t,r,i))})),!!n}function $r(t,e,n){var r=0,i=null==t?r:t.length;if("number"==typeof e&&e==e&&i<=2147483647){for(;r<i;){var a=r+i>>>1,o=t[a];null!==o&&!Zo(o)&&(n?o<=e:o<e)?r=a+1:i=a}return i}return Wr(t,e,Gs,n)}function Wr(t,e,n,r){e=n(e);for(var i=0,a=null==t?0:t.length,o=e!=e,s=null===e,u=Zo(e),c=void 0===e;i<a;){var f=Qe((i+a)/2),l=n(t[f]),h=void 0!==l,d=null===l,p=l==l,g=Zo(l);if(o)var y=r||p;else y=c?p&&(r||h):s?p&&h&&(r||!d):u?p&&h&&!d&&(r||!g):!d&&!g&&(r?l<=e:l<e);y?i=f+1:a=f}return sn(a,4294967294)}function Kr(t,e){for(var n=-1,r=t.length,i=0,a=[];++n<r;){var o=t[n],s=e?e(o):o;if(!n||!Do(s,u)){var u=s;a[i++]=0===o?0:o}}return a}function Xr(t){return"number"==typeof t?t:Zo(t)?NaN:+t}function Zr(t){if("string"==typeof t)return t;if(Lo(t))return le(t,Zr)+"";if(Zo(t))return Mn?Mn.call(t):"";var e=t+"";return"0"==e&&1/t==-1/0?"-0":e}function Jr(t,e,n){var r=-1,i=ce,a=t.length,o=!0,s=[],u=s;if(n)o=!1,i=fe;else if(a>=200){var c=e?null:Pi(t);if(c)return Ue(c);o=!1,i=Ce,u=new Rn}else u=e?[]:s;t:for(;++r<a;){var f=t[r],l=e?e(f):f;if(f=n||0!==f?f:0,o&&l==l){for(var h=u.length;h--;)if(u[h]===l)continue t;e&&u.push(l),s.push(f)}else i(u,l,n)||(u!==s&&u.push(l),s.push(f))}return s}function Qr(t,e){return null==(t=ga(t,e=si(e,t)))||delete t[Aa(Fa(e))]}function ti(t,e,n,r){return Ur(t,e,n(lr(t,e)),r)}function ei(t,e,n,r){for(var i=t.length,a=r?i:-1;(r?a--:++a<i)&&e(t[a],a,t););return n?Hr(t,r?0:a,r?a+1:i):Hr(t,r?a+1:0,r?i:a)}function ni(t,e){var n=t;return n instanceof In&&(n=n.value()),de(e,(function(t,e){return e.func.apply(e.thisArg,he([t],e.args))}),n)}function ri(t,e,n){var r=t.length;if(r<2)return r?Jr(t[0]):[];for(var i=-1,a=ft(r);++i<r;)for(var o=t[i],s=-1;++s<r;)s!=i&&(a[i]=Qn(a[i]||o,t[s],e,n));return Jr(ar(a,1),e,n)}function ii(t,e,n){for(var r=-1,i=t.length,a=e.length,o={};++r<i;){var s=r<a?e[r]:void 0;n(o,t[r],s)}return o}function ai(t){return Ro(t)?t:[]}function oi(t){return"function"==typeof t?t:Gs}function si(t,e){return Lo(t)?t:ua(t,e)?[t]:Ea(ss(t))}var ui=Fr;function ci(t,e,n){var r=t.length;return n=void 0===n?r:n,!e&&n>=r?t:Hr(t,e,n)}var fi=Ke||function(t){return Ht.clearTimeout(t)};function li(t,e){if(e)return t.slice();var n=t.length,r=Vt?Vt(n):new t.constructor(n);return t.copy(r),r}function hi(t){var e=new t.constructor(t.byteLength);return new Yt(e).set(new Yt(t)),e}function di(t,e){var n=e?hi(t.buffer):t.buffer;return new t.constructor(n,t.byteOffset,t.length)}function pi(t,e){if(t!==e){var n=void 0!==t,r=null===t,i=t==t,a=Zo(t),o=void 0!==e,s=null===e,u=e==e,c=Zo(e);if(!s&&!c&&!a&&t>e||a&&o&&u&&!s&&!c||r&&o&&u||!n&&u||!i)return 1;if(!r&&!a&&!c&&t<e||c&&n&&i&&!r&&!a||s&&n&&i||!o&&i||!u)return-1}return 0}function gi(t,e,n,r){for(var i=-1,a=t.length,o=n.length,s=-1,u=e.length,c=on(a-o,0),f=ft(u+c),l=!r;++s<u;)f[s]=e[s];for(;++i<o;)(l||i<a)&&(f[n[i]]=t[i]);for(;c--;)f[s++]=t[i++];return f}function yi(t,e,n,r){for(var i=-1,a=t.length,o=-1,s=n.length,u=-1,c=e.length,f=on(a-s,0),l=ft(f+c),h=!r;++i<f;)l[i]=t[i];for(var d=i;++u<c;)l[d+u]=e[u];for(;++o<s;)(h||i<a)&&(l[d+n[o]]=t[i++]);return l}function bi(t,e){var n=-1,r=t.length;for(e||(e=ft(r));++n<r;)e[n]=t[n];return e}function vi(t,e,n,r){var i=!n;n||(n={});for(var a=-1,o=e.length;++a<o;){var s=e[a],u=r?r(n[s],t[s],s,n,t):void 0;void 0===u&&(u=t[s]),i?$n(n,s,u):Yn(n,s,u)}return n}function mi(t,e){return function(n,r){var i=Lo(n)?ie:Hn,a=e?e():{};return i(n,t,Xi(r,2),a)}}function _i(t){return Fr((function(e,n){var r=-1,i=n.length,a=i>1?n[i-1]:void 0,o=i>2?n[2]:void 0;for(a=t.length>3&&"function"==typeof a?(i--,a):void 0,o&&sa(n[0],n[1],o)&&(a=i<3?void 0:a,i=1),e=gt(e);++r<i;){var s=n[r];s&&t(e,s,r,a)}return e}))}function wi(t,e){return function(n,r){if(null==n)return n;if(!Oo(n))return t(n,r);for(var i=n.length,a=e?i:-1,o=gt(n);(e?a--:++a<i)&&!1!==r(o[a],a,o););return n}}function xi(t){return function(e,n,r){for(var i=-1,a=gt(e),o=r(e),s=o.length;s--;){var u=o[t?s:++i];if(!1===n(a[u],u,a))break}return e}}function ki(t){return function(e){var n=Pe(e=ss(e))?Ve(e):void 0,r=n?n[0]:e.charAt(0),i=n?ci(n,1).join(""):e.slice(1);return r[t]()+i}}function Ei(t){return function(e){return de(js(Is(e).replace(Ct,"")),t,"")}}function Ai(t){return function(){var e=arguments;switch(e.length){case 0:return new t;case 1:return new t(e[0]);case 2:return new t(e[0],e[1]);case 3:return new t(e[0],e[1],e[2]);case 4:return new t(e[0],e[1],e[2],e[3]);case 5:return new t(e[0],e[1],e[2],e[3],e[4]);case 6:return new t(e[0],e[1],e[2],e[3],e[4],e[5]);case 7:return new t(e[0],e[1],e[2],e[3],e[4],e[5],e[6])}var n=Dn(t.prototype),r=t.apply(n,e);return Yo(r)?r:n}}function Si(t){return function(e,n,r){var i=gt(e);if(!Oo(e)){var a=Xi(n,3);e=_s(e),n=function(t){return a(i[t],t,i)}}var o=t(e,n,r);return o>-1?i[a?e[o]:o]:void 0}}function Mi(t){return Vi((function(e){var n=e.length,i=n,a=Nn.prototype.thru;for(t&&e.reverse();i--;){var o=e[i];if("function"!=typeof o)throw new vt(r);if(a&&!s&&"wrapper"==Wi(o))var s=new Nn([],!0)}for(i=s?i:n;++i<n;){var u=Wi(o=e[i]),c="wrapper"==u?$i(o):void 0;s=c&&ca(c[0])&&424==c[1]&&!c[4].length&&1==c[9]?s[Wi(c[0])].apply(s,c[3]):1==o.length&&ca(o)?s[u]():s.thru(o)}return function(){var t=arguments,r=t[0];if(s&&1==t.length&&Lo(r))return s.plant(r).value();for(var i=0,a=n?e[i].apply(this,t):r;++i<n;)a=e[i].call(this,a);return a}}))}function Ti(t,e,n,r,i,a,o,s,u,c){var f=128&e,l=1&e,h=2&e,d=24&e,p=512&e,g=h?void 0:Ai(t);return function y(){for(var b=arguments.length,v=ft(b),m=b;m--;)v[m]=arguments[m];if(d)var _=Ki(y),w=Le(v,_);if(r&&(v=gi(v,r,i,d)),a&&(v=yi(v,a,o,d)),b-=w,d&&b<c){var x=je(v,_);return Oi(t,e,Ti,y.placeholder,n,v,x,s,u,c-b)}var k=l?n:this,E=h?k[t]:t;return b=v.length,s?v=ya(v,s):p&&b>1&&v.reverse(),f&&u<b&&(v.length=u),this&&this!==Ht&&this instanceof y&&(E=g||Ai(E)),E.apply(k,v)}}function Di(t,e){return function(n,r){return function(t,e,n,r){return ur(t,(function(t,i,a){e(r,n(t),i,a)})),r}(n,t,e(r),{})}}function Ci(t,e){return function(n,r){var i;if(void 0===n&&void 0===r)return e;if(void 0!==n&&(i=n),void 0!==r){if(void 0===i)return r;"string"==typeof n||"string"==typeof r?(n=Zr(n),r=Zr(r)):(n=Xr(n),r=Xr(r)),i=t(n,r)}return i}}function Ni(t){return Vi((function(e){return e=le(e,Te(Xi())),Fr((function(n){var r=this;return t(e,(function(t){return re(t,r,n)}))}))}))}function Ii(t,e){var n=(e=void 0===e?" ":Zr(e)).length;if(n<2)return n?Pr(e,t):e;var r=Pr(e,Je(t/Ye(e)));return Pe(e)?ci(Ve(r),0,t).join(""):r.slice(0,t)}function Li(t){return function(e,n,r){return r&&"number"!=typeof r&&sa(e,n,r)&&(n=r=void 0),e=ns(e),void 0===n?(n=e,e=0):n=ns(n),function(t,e,n,r){for(var i=-1,a=on(Je((e-t)/(n||1)),0),o=ft(a);a--;)o[r?a:++i]=t,t+=n;return o}(e,n,r=void 0===r?e<n?1:-1:ns(r),t)}}function Bi(t){return function(e,n){return"string"==typeof e&&"string"==typeof n||(e=as(e),n=as(n)),t(e,n)}}function Oi(t,e,n,r,i,a,o,s,u,c){var f=8&e;e|=f?32:64,4&(e&=~(f?64:32))||(e&=-4);var l=[t,e,i,f?a:void 0,f?o:void 0,f?void 0:a,f?void 0:o,s,u,c],h=n.apply(void 0,l);return ca(t)&&va(h,l),h.placeholder=r,wa(h,t,e)}function Ri(t){var e=pt[t];return function(t,n){if(t=as(t),(n=null==n?0:sn(rs(n),292))&&nn(t)){var r=(ss(t)+"e").split("e");return+((r=(ss(e(r[0]+"e"+(+r[1]+n)))+"e").split("e"))[0]+"e"+(+r[1]-n))}return e(t)}}var Pi=gn&&1/Ue(new gn([,-0]))[1]==1/0?function(t){return new gn(t)}:Zs;function Fi(t){return function(e){var n=na(e);return n==d?Fe(e):n==b?ze(e):function(t,e){return le(e,(function(e){return[e,t[e]]}))}(e,t(e))}}function qi(t,e,n,a,o,s,u,c){var f=2&e;if(!f&&"function"!=typeof t)throw new vt(r);var l=a?a.length:0;if(l||(e&=-97,a=o=void 0),u=void 0===u?u:on(rs(u),0),c=void 0===c?c:rs(c),l-=o?o.length:0,64&e){var h=a,d=o;a=o=void 0}var p=f?void 0:$i(t),g=[t,e,n,a,o,h,d,s,u,c];if(p&&function(t,e){var n=t[1],r=e[1],a=n|r,o=a<131,s=128==r&&8==n||128==r&&256==n&&t[7].length<=e[8]||384==r&&e[7].length<=e[8]&&8==n;if(!o&&!s)return t;1&r&&(t[2]=e[2],a|=1&n?0:4);var u=e[3];if(u){var c=t[3];t[3]=c?gi(c,u,e[4]):u,t[4]=c?je(t[3],i):e[4]}(u=e[5])&&(c=t[5],t[5]=c?yi(c,u,e[6]):u,t[6]=c?je(t[5],i):e[6]);(u=e[7])&&(t[7]=u);128&r&&(t[8]=null==t[8]?e[8]:sn(t[8],e[8]));null==t[9]&&(t[9]=e[9]);t[0]=e[0],t[1]=a}(g,p),t=g[0],e=g[1],n=g[2],a=g[3],o=g[4],!(c=g[9]=void 0===g[9]?f?0:t.length:on(g[9]-l,0))&&24&e&&(e&=-25),e&&1!=e)y=8==e||16==e?function(t,e,n){var r=Ai(t);return function i(){for(var a=arguments.length,o=ft(a),s=a,u=Ki(i);s--;)o[s]=arguments[s];var c=a<3&&o[0]!==u&&o[a-1]!==u?[]:je(o,u);if((a-=c.length)<n)return Oi(t,e,Ti,i.placeholder,void 0,o,c,void 0,void 0,n-a);var f=this&&this!==Ht&&this instanceof i?r:t;return re(f,this,o)}}(t,e,c):32!=e&&33!=e||o.length?Ti.apply(void 0,g):function(t,e,n,r){var i=1&e,a=Ai(t);return function e(){for(var o=-1,s=arguments.length,u=-1,c=r.length,f=ft(c+s),l=this&&this!==Ht&&this instanceof e?a:t;++u<c;)f[u]=r[u];for(;s--;)f[u++]=arguments[++o];return re(l,i?n:this,f)}}(t,e,n,a);else var y=function(t,e,n){var r=1&e,i=Ai(t);return function e(){var a=this&&this!==Ht&&this instanceof e?i:t;return a.apply(r?n:this,arguments)}}(t,e,n);return wa((p?zr:va)(y,g),t,e)}function ji(t,e,n,r){return void 0===t||Do(t,wt[n])&&!Et.call(r,n)?e:t}function Ui(t,e,n,r,i,a){return Yo(t)&&Yo(e)&&(a.set(e,t),Cr(t,e,void 0,Ui,a),a.delete(e)),t}function zi(t){return $o(t)?void 0:t}function Yi(t,e,n,r,i,a){var o=1&n,s=t.length,u=e.length;if(s!=u&&!(o&&u>s))return!1;var c=a.get(t);if(c&&a.get(e))return c==e;var f=-1,l=!0,h=2&n?new Rn:void 0;for(a.set(t,e),a.set(e,t);++f<s;){var d=t[f],p=e[f];if(r)var g=o?r(p,d,f,e,t,a):r(d,p,f,t,e,a);if(void 0!==g){if(g)continue;l=!1;break}if(h){if(!ge(e,(function(t,e){if(!Ce(h,e)&&(d===t||i(d,t,n,r,a)))return h.push(e)}))){l=!1;break}}else if(d!==p&&!i(d,p,n,r,a)){l=!1;break}}return a.delete(t),a.delete(e),l}function Vi(t){return _a(pa(t,void 0,La),t+"")}function Hi(t){return hr(t,_s,ta)}function Gi(t){return hr(t,ws,ea)}var $i=vn?function(t){return vn.get(t)}:Zs;function Wi(t){for(var e=t.name+"",n=mn[e],r=Et.call(mn,e)?n.length:0;r--;){var i=n[r],a=i.func;if(null==a||a==t)return i.name}return e}function Ki(t){return(Et.call(Tn,"placeholder")?Tn:t).placeholder}function Xi(){var t=Tn.iteratee||$s;return t=t===$s?kr:t,arguments.length?t(arguments[0],arguments[1]):t}function Zi(t,e){var n,r,i=t.__data__;return("string"==(r=typeof(n=e))||"number"==r||"symbol"==r||"boolean"==r?"__proto__"!==n:null===n)?i["string"==typeof e?"string":"hash"]:i.map}function Ji(t){for(var e=_s(t),n=e.length;n--;){var r=e[n],i=t[r];e[n]=[r,i,ha(i)]}return e}function Qi(t,e){var n=function(t,e){return null==t?void 0:t[e]}(t,e);return xr(n)?n:void 0}var ta=tn?function(t){return null==t?[]:(t=gt(t),ue(tn(t),(function(e){return Kt.call(t,e)})))}:iu,ea=tn?function(t){for(var e=[];t;)he(e,ta(t)),t=Gt(t);return e}:iu,na=dr;function ra(t,e,n){for(var r=-1,i=(e=si(e,t)).length,a=!1;++r<i;){var o=Aa(e[r]);if(!(a=null!=t&&n(t,o)))break;t=t[o]}return a||++r!=i?a:!!(i=null==t?0:t.length)&&zo(i)&&oa(o,i)&&(Lo(t)||Io(t))}function ia(t){return"function"!=typeof t.constructor||la(t)?{}:Dn(Gt(t))}function aa(t){return Lo(t)||Io(t)||!!(ye&&t&&t[ye])}function oa(t,e){var n=typeof t;return!!(e=null==e?9007199254740991:e)&&("number"==n||"symbol"!=n&&ot.test(t))&&t>-1&&t%1==0&&t<e}function sa(t,e,n){if(!Yo(n))return!1;var r=typeof e;return!!("number"==r?Oo(n)&&oa(e,n.length):"string"==r&&e in n)&&Do(n[e],t)}function ua(t,e){if(Lo(t))return!1;var n=typeof t;return!("number"!=n&&"symbol"!=n&&"boolean"!=n&&null!=t&&!Zo(t))||(z.test(t)||!U.test(t)||null!=e&&t in gt(e))}function ca(t){var e=Wi(t),n=Tn[e];if("function"!=typeof n||!(e in In.prototype))return!1;if(t===n)return!0;var r=$i(n);return!!r&&t===r[0]}(hn&&na(new hn(new ArrayBuffer(1)))!=x||dn&&na(new dn)!=d||pn&&"[object Promise]"!=na(pn.resolve())||gn&&na(new gn)!=b||yn&&na(new yn)!=_)&&(na=function(t){var e=dr(t),n=e==g?t.constructor:void 0,r=n?Sa(n):"";if(r)switch(r){case _n:return x;case wn:return d;case xn:return"[object Promise]";case kn:return b;case En:return _}return e});var fa=xt?jo:au;function la(t){var e=t&&t.constructor;return t===("function"==typeof e&&e.prototype||wt)}function ha(t){return t==t&&!Yo(t)}function da(t,e){return function(n){return null!=n&&(n[t]===e&&(void 0!==e||t in gt(n)))}}function pa(t,e,n){return e=on(void 0===e?t.length-1:e,0),function(){for(var r=arguments,i=-1,a=on(r.length-e,0),o=ft(a);++i<a;)o[i]=r[e+i];i=-1;for(var s=ft(e+1);++i<e;)s[i]=r[i];return s[e]=n(o),re(t,this,s)}}function ga(t,e){return e.length<2?t:lr(t,Hr(e,0,-1))}function ya(t,e){for(var n=t.length,r=sn(e.length,n),i=bi(t);r--;){var a=e[r];t[r]=oa(a,n)?i[a]:void 0}return t}function ba(t,e){if(("constructor"!==e||"function"!=typeof t[e])&&"__proto__"!=e)return t[e]}var va=xa(zr),ma=Ze||function(t,e){return Ht.setTimeout(t,e)},_a=xa(Yr);function wa(t,e,n){var r=e+"";return _a(t,function(t,e){var n=e.length;if(!n)return t;var r=n-1;return e[r]=(n>1?"& ":"")+e[r],e=e.join(n>2?", ":" "),t.replace(K,"{\n/* [wrapped with "+e+"] */\n")}(r,function(t,e){return ae(a,(function(n){var r="_."+n[0];e&n[1]&&!ce(t,r)&&t.push(r)})),t.sort()}(function(t){var e=t.match(X);return e?e[1].split(Z):[]}(r),n)))}function xa(t){var e=0,n=0;return function(){var r=un(),i=16-(r-n);if(n=r,i>0){if(++e>=800)return arguments[0]}else e=0;return t.apply(void 0,arguments)}}function ka(t,e){var n=-1,r=t.length,i=r-1;for(e=void 0===e?r:e;++n<e;){var a=Rr(n,i),o=t[a];t[a]=t[n],t[n]=o}return t.length=e,t}var Ea=function(t){var e=ko(t,(function(t){return 500===n.size&&n.clear(),t})),n=e.cache;return e}((function(t){var e=[];return 46===t.charCodeAt(0)&&e.push(""),t.replace(Y,(function(t,n,r,i){e.push(r?i.replace(Q,"$1"):n||t)})),e}));function Aa(t){if("string"==typeof t||Zo(t))return t;var e=t+"";return"0"==e&&1/t==-1/0?"-0":e}function Sa(t){if(null!=t){try{return kt.call(t)}catch(t){}try{return t+""}catch(t){}}return""}function Ma(t){if(t instanceof In)return t.clone();var e=new Nn(t.__wrapped__,t.__chain__);return e.__actions__=bi(t.__actions__),e.__index__=t.__index__,e.__values__=t.__values__,e}var Ta=Fr((function(t,e){return Ro(t)?Qn(t,ar(e,1,Ro,!0)):[]})),Da=Fr((function(t,e){var n=Fa(e);return Ro(n)&&(n=void 0),Ro(t)?Qn(t,ar(e,1,Ro,!0),Xi(n,2)):[]})),Ca=Fr((function(t,e){var n=Fa(e);return Ro(n)&&(n=void 0),Ro(t)?Qn(t,ar(e,1,Ro,!0),void 0,n):[]}));function Na(t,e,n){var r=null==t?0:t.length;if(!r)return-1;var i=null==n?0:rs(n);return i<0&&(i=on(r+i,0)),ve(t,Xi(e,3),i)}function Ia(t,e,n){var r=null==t?0:t.length;if(!r)return-1;var i=r-1;return void 0!==n&&(i=rs(n),i=n<0?on(r+i,0):sn(i,r-1)),ve(t,Xi(e,3),i,!0)}function La(t){return(null==t?0:t.length)?ar(t,1):[]}function Ba(t){return t&&t.length?t[0]:void 0}var Oa=Fr((function(t){var e=le(t,ai);return e.length&&e[0]===t[0]?br(e):[]})),Ra=Fr((function(t){var e=Fa(t),n=le(t,ai);return e===Fa(n)?e=void 0:n.pop(),n.length&&n[0]===t[0]?br(n,Xi(e,2)):[]})),Pa=Fr((function(t){var e=Fa(t),n=le(t,ai);return(e="function"==typeof e?e:void 0)&&n.pop(),n.length&&n[0]===t[0]?br(n,void 0,e):[]}));function Fa(t){var e=null==t?0:t.length;return e?t[e-1]:void 0}var qa=Fr(ja);function ja(t,e){return t&&t.length&&e&&e.length?Br(t,e):t}var Ua=Vi((function(t,e){var n=null==t?0:t.length,r=Wn(t,e);return Or(t,le(e,(function(t){return oa(t,n)?+t:t})).sort(pi)),r}));function za(t){return null==t?t:ln.call(t)}var Ya=Fr((function(t){return Jr(ar(t,1,Ro,!0))})),Va=Fr((function(t){var e=Fa(t);return Ro(e)&&(e=void 0),Jr(ar(t,1,Ro,!0),Xi(e,2))})),Ha=Fr((function(t){var e=Fa(t);return e="function"==typeof e?e:void 0,Jr(ar(t,1,Ro,!0),void 0,e)}));function Ga(t){if(!t||!t.length)return[];var e=0;return t=ue(t,(function(t){if(Ro(t))return e=on(t.length,e),!0})),Me(e,(function(e){return le(t,ke(e))}))}function $a(t,e){if(!t||!t.length)return[];var n=Ga(t);return null==e?n:le(n,(function(t){return re(e,void 0,t)}))}var Wa=Fr((function(t,e){return Ro(t)?Qn(t,e):[]})),Ka=Fr((function(t){return ri(ue(t,Ro))})),Xa=Fr((function(t){var e=Fa(t);return Ro(e)&&(e=void 0),ri(ue(t,Ro),Xi(e,2))})),Za=Fr((function(t){var e=Fa(t);return e="function"==typeof e?e:void 0,ri(ue(t,Ro),void 0,e)})),Ja=Fr(Ga);var Qa=Fr((function(t){var e=t.length,n=e>1?t[e-1]:void 0;return n="function"==typeof n?(t.pop(),n):void 0,$a(t,n)}));function to(t){var e=Tn(t);return e.__chain__=!0,e}function eo(t,e){return e(t)}var no=Vi((function(t){var e=t.length,n=e?t[0]:0,r=this.__wrapped__,i=function(e){return Wn(e,t)};return!(e>1||this.__actions__.length)&&r instanceof In&&oa(n)?((r=r.slice(n,+n+(e?1:0))).__actions__.push({func:eo,args:[i],thisArg:void 0}),new Nn(r,this.__chain__).thru((function(t){return e&&!t.length&&t.push(void 0),t}))):this.thru(i)}));var ro=mi((function(t,e,n){Et.call(t,n)?++t[n]:$n(t,n,1)}));var io=Si(Na),ao=Si(Ia);function oo(t,e){return(Lo(t)?ae:tr)(t,Xi(e,3))}function so(t,e){return(Lo(t)?oe:er)(t,Xi(e,3))}var uo=mi((function(t,e,n){Et.call(t,n)?t[n].push(e):$n(t,n,[e])}));var co=Fr((function(t,e,n){var r=-1,i="function"==typeof e,a=Oo(t)?ft(t.length):[];return tr(t,(function(t){a[++r]=i?re(e,t,n):vr(t,e,n)})),a})),fo=mi((function(t,e,n){$n(t,n,e)}));function lo(t,e){return(Lo(t)?le:Mr)(t,Xi(e,3))}var ho=mi((function(t,e,n){t[n?0:1].push(e)}),(function(){return[[],[]]}));var po=Fr((function(t,e){if(null==t)return[];var n=e.length;return n>1&&sa(t,e[0],e[1])?e=[]:n>2&&sa(e[0],e[1],e[2])&&(e=[e[0]]),Ir(t,ar(e,1),[])})),go=Xe||function(){return Ht.Date.now()};function yo(t,e,n){return e=n?void 0:e,qi(t,128,void 0,void 0,void 0,void 0,e=t&&null==e?t.length:e)}function bo(t,e){var n;if("function"!=typeof e)throw new vt(r);return t=rs(t),function(){return--t>0&&(n=e.apply(this,arguments)),t<=1&&(e=void 0),n}}var vo=Fr((function(t,e,n){var r=1;if(n.length){var i=je(n,Ki(vo));r|=32}return qi(t,r,e,n,i)})),mo=Fr((function(t,e,n){var r=3;if(n.length){var i=je(n,Ki(mo));r|=32}return qi(e,r,t,n,i)}));function _o(t,e,n){var i,a,o,s,u,c,f=0,l=!1,h=!1,d=!0;if("function"!=typeof t)throw new vt(r);function p(e){var n=i,r=a;return i=a=void 0,f=e,s=t.apply(r,n)}function g(t){return f=t,u=ma(b,e),l?p(t):s}function y(t){var n=t-c;return void 0===c||n>=e||n<0||h&&t-f>=o}function b(){var t=go();if(y(t))return v(t);u=ma(b,function(t){var n=e-(t-c);return h?sn(n,o-(t-f)):n}(t))}function v(t){return u=void 0,d&&i?p(t):(i=a=void 0,s)}function m(){var t=go(),n=y(t);if(i=arguments,a=this,c=t,n){if(void 0===u)return g(c);if(h)return fi(u),u=ma(b,e),p(c)}return void 0===u&&(u=ma(b,e)),s}return e=as(e)||0,Yo(n)&&(l=!!n.leading,o=(h="maxWait"in n)?on(as(n.maxWait)||0,e):o,d="trailing"in n?!!n.trailing:d),m.cancel=function(){void 0!==u&&fi(u),f=0,i=c=a=u=void 0},m.flush=function(){return void 0===u?s:v(go())},m}var wo=Fr((function(t,e){return Jn(t,1,e)})),xo=Fr((function(t,e,n){return Jn(t,as(e)||0,n)}));function ko(t,e){if("function"!=typeof t||null!=e&&"function"!=typeof e)throw new vt(r);var n=function(){var r=arguments,i=e?e.apply(this,r):r[0],a=n.cache;if(a.has(i))return a.get(i);var o=t.apply(this,r);return n.cache=a.set(i,o)||a,o};return n.cache=new(ko.Cache||On),n}function Eo(t){if("function"!=typeof t)throw new vt(r);return function(){var e=arguments;switch(e.length){case 0:return!t.call(this);case 1:return!t.call(this,e[0]);case 2:return!t.call(this,e[0],e[1]);case 3:return!t.call(this,e[0],e[1],e[2])}return!t.apply(this,e)}}ko.Cache=On;var Ao=ui((function(t,e){var n=(e=1==e.length&&Lo(e[0])?le(e[0],Te(Xi())):le(ar(e,1),Te(Xi()))).length;return Fr((function(r){for(var i=-1,a=sn(r.length,n);++i<a;)r[i]=e[i].call(this,r[i]);return re(t,this,r)}))})),So=Fr((function(t,e){return qi(t,32,void 0,e,je(e,Ki(So)))})),Mo=Fr((function(t,e){return qi(t,64,void 0,e,je(e,Ki(Mo)))})),To=Vi((function(t,e){return qi(t,256,void 0,void 0,void 0,e)}));function Do(t,e){return t===e||t!=t&&e!=e}var Co=Bi(pr),No=Bi((function(t,e){return t>=e})),Io=mr(function(){return arguments}())?mr:function(t){return Vo(t)&&Et.call(t,"callee")&&!Kt.call(t,"callee")},Lo=ft.isArray,Bo=Zt?Te(Zt):function(t){return Vo(t)&&dr(t)==w};function Oo(t){return null!=t&&zo(t.length)&&!jo(t)}function Ro(t){return Vo(t)&&Oo(t)}var Po=en||au,Fo=Jt?Te(Jt):function(t){return Vo(t)&&dr(t)==c};function qo(t){if(!Vo(t))return!1;var e=dr(t);return e==f||"[object DOMException]"==e||"string"==typeof t.message&&"string"==typeof t.name&&!$o(t)}function jo(t){if(!Yo(t))return!1;var e=dr(t);return e==l||e==h||"[object AsyncFunction]"==e||"[object Proxy]"==e}function Uo(t){return"number"==typeof t&&t==rs(t)}function zo(t){return"number"==typeof t&&t>-1&&t%1==0&&t<=9007199254740991}function Yo(t){var e=typeof t;return null!=t&&("object"==e||"function"==e)}function Vo(t){return null!=t&&"object"==typeof t}var Ho=Qt?Te(Qt):function(t){return Vo(t)&&na(t)==d};function Go(t){return"number"==typeof t||Vo(t)&&dr(t)==p}function $o(t){if(!Vo(t)||dr(t)!=g)return!1;var e=Gt(t);if(null===e)return!0;var n=Et.call(e,"constructor")&&e.constructor;return"function"==typeof n&&n instanceof n&&kt.call(n)==Tt}var Wo=te?Te(te):function(t){return Vo(t)&&dr(t)==y};var Ko=ee?Te(ee):function(t){return Vo(t)&&na(t)==b};function Xo(t){return"string"==typeof t||!Lo(t)&&Vo(t)&&dr(t)==v}function Zo(t){return"symbol"==typeof t||Vo(t)&&dr(t)==m}var Jo=ne?Te(ne):function(t){return Vo(t)&&zo(t.length)&&!!Ft[dr(t)]};var Qo=Bi(Sr),ts=Bi((function(t,e){return t<=e}));function es(t){if(!t)return[];if(Oo(t))return Xo(t)?Ve(t):bi(t);if(Ee&&t[Ee])return function(t){for(var e,n=[];!(e=t.next()).done;)n.push(e.value);return n}(t[Ee]());var e=na(t);return(e==d?Fe:e==b?Ue:Ds)(t)}function ns(t){return t?(t=as(t))===1/0||t===-1/0?17976931348623157e292*(t<0?-1:1):t==t?t:0:0===t?t:0}function rs(t){var e=ns(t),n=e%1;return e==e?n?e-n:e:0}function is(t){return t?Kn(rs(t),0,4294967295):0}function as(t){if("number"==typeof t)return t;if(Zo(t))return NaN;if(Yo(t)){var e="function"==typeof t.valueOf?t.valueOf():t;t=Yo(e)?e+"":e}if("string"!=typeof t)return 0===t?t:+t;t=t.replace(G,"");var n=rt.test(t);return n||at.test(t)?zt(t.slice(2),n?2:8):nt.test(t)?NaN:+t}function os(t){return vi(t,ws(t))}function ss(t){return null==t?"":Zr(t)}var us=_i((function(t,e){if(la(e)||Oo(e))vi(e,_s(e),t);else for(var n in e)Et.call(e,n)&&Yn(t,n,e[n])})),cs=_i((function(t,e){vi(e,ws(e),t)})),fs=_i((function(t,e,n,r){vi(e,ws(e),t,r)})),ls=_i((function(t,e,n,r){vi(e,_s(e),t,r)})),hs=Vi(Wn);var ds=Fr((function(t,e){t=gt(t);var n=-1,r=e.length,i=r>2?e[2]:void 0;for(i&&sa(e[0],e[1],i)&&(r=1);++n<r;)for(var a=e[n],o=ws(a),s=-1,u=o.length;++s<u;){var c=o[s],f=t[c];(void 0===f||Do(f,wt[c])&&!Et.call(t,c))&&(t[c]=a[c])}return t})),ps=Fr((function(t){return t.push(void 0,Ui),re(ks,void 0,t)}));function gs(t,e,n){var r=null==t?void 0:lr(t,e);return void 0===r?n:r}function ys(t,e){return null!=t&&ra(t,e,yr)}var bs=Di((function(t,e,n){null!=e&&"function"!=typeof e.toString&&(e=Mt.call(e)),t[e]=n}),Ys(Gs)),vs=Di((function(t,e,n){null!=e&&"function"!=typeof e.toString&&(e=Mt.call(e)),Et.call(t,e)?t[e].push(n):t[e]=[n]}),Xi),ms=Fr(vr);function _s(t){return Oo(t)?Fn(t):Er(t)}function ws(t){return Oo(t)?Fn(t,!0):Ar(t)}var xs=_i((function(t,e,n){Cr(t,e,n)})),ks=_i((function(t,e,n,r){Cr(t,e,n,r)})),Es=Vi((function(t,e){var n={};if(null==t)return n;var r=!1;e=le(e,(function(e){return e=si(e,t),r||(r=e.length>1),e})),vi(t,Gi(t),n),r&&(n=Xn(n,7,zi));for(var i=e.length;i--;)Qr(n,e[i]);return n}));var As=Vi((function(t,e){return null==t?{}:function(t,e){return Lr(t,e,(function(e,n){return ys(t,n)}))}(t,e)}));function Ss(t,e){if(null==t)return{};var n=le(Gi(t),(function(t){return[t]}));return e=Xi(e),Lr(t,n,(function(t,n){return e(t,n[0])}))}var Ms=Fi(_s),Ts=Fi(ws);function Ds(t){return null==t?[]:De(t,_s(t))}var Cs=Ei((function(t,e,n){return e=e.toLowerCase(),t+(n?Ns(e):e)}));function Ns(t){return qs(ss(t).toLowerCase())}function Is(t){return(t=ss(t))&&t.replace(st,Be).replace(Nt,"")}var Ls=Ei((function(t,e,n){return t+(n?"-":"")+e.toLowerCase()})),Bs=Ei((function(t,e,n){return t+(n?" ":"")+e.toLowerCase()})),Os=ki("toLowerCase");var Rs=Ei((function(t,e,n){return t+(n?"_":"")+e.toLowerCase()}));var Ps=Ei((function(t,e,n){return t+(n?" ":"")+qs(e)}));var Fs=Ei((function(t,e,n){return t+(n?" ":"")+e.toUpperCase()})),qs=ki("toUpperCase");function js(t,e,n){return t=ss(t),void 0===(e=n?void 0:e)?function(t){return Ot.test(t)}(t)?function(t){return t.match(Lt)||[]}(t):function(t){return t.match(J)||[]}(t):t.match(e)||[]}var Us=Fr((function(t,e){try{return re(t,void 0,e)}catch(t){return qo(t)?t:new ht(t)}})),zs=Vi((function(t,e){return ae(e,(function(e){e=Aa(e),$n(t,e,vo(t[e],t))})),t}));function Ys(t){return function(){return t}}var Vs=Mi(),Hs=Mi(!0);function Gs(t){return t}function $s(t){return kr("function"==typeof t?t:Xn(t,1))}var Ws=Fr((function(t,e){return function(n){return vr(n,t,e)}})),Ks=Fr((function(t,e){return function(n){return vr(t,n,e)}}));function Xs(t,e,n){var r=_s(e),i=fr(e,r);null!=n||Yo(e)&&(i.length||!r.length)||(n=e,e=t,t=this,i=fr(e,_s(e)));var a=!(Yo(n)&&"chain"in n&&!n.chain),o=jo(t);return ae(i,(function(n){var r=e[n];t[n]=r,o&&(t.prototype[n]=function(){var e=this.__chain__;if(a||e){var n=t(this.__wrapped__),i=n.__actions__=bi(this.__actions__);return i.push({func:r,args:arguments,thisArg:t}),n.__chain__=e,n}return r.apply(t,he([this.value()],arguments))})})),t}function Zs(){}var Js=Ni(le),Qs=Ni(se),tu=Ni(ge);function eu(t){return ua(t)?ke(Aa(t)):function(t){return function(e){return lr(e,t)}}(t)}var nu=Li(),ru=Li(!0);function iu(){return[]}function au(){return!1}var ou=Ci((function(t,e){return t+e}),0),su=Ri("ceil"),uu=Ci((function(t,e){return t/e}),1),cu=Ri("floor");var fu,lu=Ci((function(t,e){return t*e}),1),hu=Ri("round"),du=Ci((function(t,e){return t-e}),0);return Tn.after=function(t,e){if("function"!=typeof e)throw new vt(r);return t=rs(t),function(){if(--t<1)return e.apply(this,arguments)}},Tn.ary=yo,Tn.assign=us,Tn.assignIn=cs,Tn.assignInWith=fs,Tn.assignWith=ls,Tn.at=hs,Tn.before=bo,Tn.bind=vo,Tn.bindAll=zs,Tn.bindKey=mo,Tn.castArray=function(){if(!arguments.length)return[];var t=arguments[0];return Lo(t)?t:[t]},Tn.chain=to,Tn.chunk=function(t,e,n){e=(n?sa(t,e,n):void 0===e)?1:on(rs(e),0);var r=null==t?0:t.length;if(!r||e<1)return[];for(var i=0,a=0,o=ft(Je(r/e));i<r;)o[a++]=Hr(t,i,i+=e);return o},Tn.compact=function(t){for(var e=-1,n=null==t?0:t.length,r=0,i=[];++e<n;){var a=t[e];a&&(i[r++]=a)}return i},Tn.concat=function(){var t=arguments.length;if(!t)return[];for(var e=ft(t-1),n=arguments[0],r=t;r--;)e[r-1]=arguments[r];return he(Lo(n)?bi(n):[n],ar(e,1))},Tn.cond=function(t){var e=null==t?0:t.length,n=Xi();return t=e?le(t,(function(t){if("function"!=typeof t[1])throw new vt(r);return[n(t[0]),t[1]]})):[],Fr((function(n){for(var r=-1;++r<e;){var i=t[r];if(re(i[0],this,n))return re(i[1],this,n)}}))},Tn.conforms=function(t){return function(t){var e=_s(t);return function(n){return Zn(n,t,e)}}(Xn(t,1))},Tn.constant=Ys,Tn.countBy=ro,Tn.create=function(t,e){var n=Dn(t);return null==e?n:Gn(n,e)},Tn.curry=function t(e,n,r){var i=qi(e,8,void 0,void 0,void 0,void 0,void 0,n=r?void 0:n);return i.placeholder=t.placeholder,i},Tn.curryRight=function t(e,n,r){var i=qi(e,16,void 0,void 0,void 0,void 0,void 0,n=r?void 0:n);return i.placeholder=t.placeholder,i},Tn.debounce=_o,Tn.defaults=ds,Tn.defaultsDeep=ps,Tn.defer=wo,Tn.delay=xo,Tn.difference=Ta,Tn.differenceBy=Da,Tn.differenceWith=Ca,Tn.drop=function(t,e,n){var r=null==t?0:t.length;return r?Hr(t,(e=n||void 0===e?1:rs(e))<0?0:e,r):[]},Tn.dropRight=function(t,e,n){var r=null==t?0:t.length;return r?Hr(t,0,(e=r-(e=n||void 0===e?1:rs(e)))<0?0:e):[]},Tn.dropRightWhile=function(t,e){return t&&t.length?ei(t,Xi(e,3),!0,!0):[]},Tn.dropWhile=function(t,e){return t&&t.length?ei(t,Xi(e,3),!0):[]},Tn.fill=function(t,e,n,r){var i=null==t?0:t.length;return i?(n&&"number"!=typeof n&&sa(t,e,n)&&(n=0,r=i),function(t,e,n,r){var i=t.length;for((n=rs(n))<0&&(n=-n>i?0:i+n),(r=void 0===r||r>i?i:rs(r))<0&&(r+=i),r=n>r?0:is(r);n<r;)t[n++]=e;return t}(t,e,n,r)):[]},Tn.filter=function(t,e){return(Lo(t)?ue:ir)(t,Xi(e,3))},Tn.flatMap=function(t,e){return ar(lo(t,e),1)},Tn.flatMapDeep=function(t,e){return ar(lo(t,e),1/0)},Tn.flatMapDepth=function(t,e,n){return n=void 0===n?1:rs(n),ar(lo(t,e),n)},Tn.flatten=La,Tn.flattenDeep=function(t){return(null==t?0:t.length)?ar(t,1/0):[]},Tn.flattenDepth=function(t,e){return(null==t?0:t.length)?ar(t,e=void 0===e?1:rs(e)):[]},Tn.flip=function(t){return qi(t,512)},Tn.flow=Vs,Tn.flowRight=Hs,Tn.fromPairs=function(t){for(var e=-1,n=null==t?0:t.length,r={};++e<n;){var i=t[e];r[i[0]]=i[1]}return r},Tn.functions=function(t){return null==t?[]:fr(t,_s(t))},Tn.functionsIn=function(t){return null==t?[]:fr(t,ws(t))},Tn.groupBy=uo,Tn.initial=function(t){return(null==t?0:t.length)?Hr(t,0,-1):[]},Tn.intersection=Oa,Tn.intersectionBy=Ra,Tn.intersectionWith=Pa,Tn.invert=bs,Tn.invertBy=vs,Tn.invokeMap=co,Tn.iteratee=$s,Tn.keyBy=fo,Tn.keys=_s,Tn.keysIn=ws,Tn.map=lo,Tn.mapKeys=function(t,e){var n={};return e=Xi(e,3),ur(t,(function(t,r,i){$n(n,e(t,r,i),t)})),n},Tn.mapValues=function(t,e){var n={};return e=Xi(e,3),ur(t,(function(t,r,i){$n(n,r,e(t,r,i))})),n},Tn.matches=function(t){return Tr(Xn(t,1))},Tn.matchesProperty=function(t,e){return Dr(t,Xn(e,1))},Tn.memoize=ko,Tn.merge=xs,Tn.mergeWith=ks,Tn.method=Ws,Tn.methodOf=Ks,Tn.mixin=Xs,Tn.negate=Eo,Tn.nthArg=function(t){return t=rs(t),Fr((function(e){return Nr(e,t)}))},Tn.omit=Es,Tn.omitBy=function(t,e){return Ss(t,Eo(Xi(e)))},Tn.once=function(t){return bo(2,t)},Tn.orderBy=function(t,e,n,r){return null==t?[]:(Lo(e)||(e=null==e?[]:[e]),Lo(n=r?void 0:n)||(n=null==n?[]:[n]),Ir(t,e,n))},Tn.over=Js,Tn.overArgs=Ao,Tn.overEvery=Qs,Tn.overSome=tu,Tn.partial=So,Tn.partialRight=Mo,Tn.partition=ho,Tn.pick=As,Tn.pickBy=Ss,Tn.property=eu,Tn.propertyOf=function(t){return function(e){return null==t?void 0:lr(t,e)}},Tn.pull=qa,Tn.pullAll=ja,Tn.pullAllBy=function(t,e,n){return t&&t.length&&e&&e.length?Br(t,e,Xi(n,2)):t},Tn.pullAllWith=function(t,e,n){return t&&t.length&&e&&e.length?Br(t,e,void 0,n):t},Tn.pullAt=Ua,Tn.range=nu,Tn.rangeRight=ru,Tn.rearg=To,Tn.reject=function(t,e){return(Lo(t)?ue:ir)(t,Eo(Xi(e,3)))},Tn.remove=function(t,e){var n=[];if(!t||!t.length)return n;var r=-1,i=[],a=t.length;for(e=Xi(e,3);++r<a;){var o=t[r];e(o,r,t)&&(n.push(o),i.push(r))}return Or(t,i),n},Tn.rest=function(t,e){if("function"!=typeof t)throw new vt(r);return Fr(t,e=void 0===e?e:rs(e))},Tn.reverse=za,Tn.sampleSize=function(t,e,n){return e=(n?sa(t,e,n):void 0===e)?1:rs(e),(Lo(t)?jn:jr)(t,e)},Tn.set=function(t,e,n){return null==t?t:Ur(t,e,n)},Tn.setWith=function(t,e,n,r){return r="function"==typeof r?r:void 0,null==t?t:Ur(t,e,n,r)},Tn.shuffle=function(t){return(Lo(t)?Un:Vr)(t)},Tn.slice=function(t,e,n){var r=null==t?0:t.length;return r?(n&&"number"!=typeof n&&sa(t,e,n)?(e=0,n=r):(e=null==e?0:rs(e),n=void 0===n?r:rs(n)),Hr(t,e,n)):[]},Tn.sortBy=po,Tn.sortedUniq=function(t){return t&&t.length?Kr(t):[]},Tn.sortedUniqBy=function(t,e){return t&&t.length?Kr(t,Xi(e,2)):[]},Tn.split=function(t,e,n){return n&&"number"!=typeof n&&sa(t,e,n)&&(e=n=void 0),(n=void 0===n?4294967295:n>>>0)?(t=ss(t))&&("string"==typeof e||null!=e&&!Wo(e))&&!(e=Zr(e))&&Pe(t)?ci(Ve(t),0,n):t.split(e,n):[]},Tn.spread=function(t,e){if("function"!=typeof t)throw new vt(r);return e=null==e?0:on(rs(e),0),Fr((function(n){var r=n[e],i=ci(n,0,e);return r&&he(i,r),re(t,this,i)}))},Tn.tail=function(t){var e=null==t?0:t.length;return e?Hr(t,1,e):[]},Tn.take=function(t,e,n){return t&&t.length?Hr(t,0,(e=n||void 0===e?1:rs(e))<0?0:e):[]},Tn.takeRight=function(t,e,n){var r=null==t?0:t.length;return r?Hr(t,(e=r-(e=n||void 0===e?1:rs(e)))<0?0:e,r):[]},Tn.takeRightWhile=function(t,e){return t&&t.length?ei(t,Xi(e,3),!1,!0):[]},Tn.takeWhile=function(t,e){return t&&t.length?ei(t,Xi(e,3)):[]},Tn.tap=function(t,e){return e(t),t},Tn.throttle=function(t,e,n){var i=!0,a=!0;if("function"!=typeof t)throw new vt(r);return Yo(n)&&(i="leading"in n?!!n.leading:i,a="trailing"in n?!!n.trailing:a),_o(t,e,{leading:i,maxWait:e,trailing:a})},Tn.thru=eo,Tn.toArray=es,Tn.toPairs=Ms,Tn.toPairsIn=Ts,Tn.toPath=function(t){return Lo(t)?le(t,Aa):Zo(t)?[t]:bi(Ea(ss(t)))},Tn.toPlainObject=os,Tn.transform=function(t,e,n){var r=Lo(t),i=r||Po(t)||Jo(t);if(e=Xi(e,4),null==n){var a=t&&t.constructor;n=i?r?new a:[]:Yo(t)&&jo(a)?Dn(Gt(t)):{}}return(i?ae:ur)(t,(function(t,r,i){return e(n,t,r,i)})),n},Tn.unary=function(t){return yo(t,1)},Tn.union=Ya,Tn.unionBy=Va,Tn.unionWith=Ha,Tn.uniq=function(t){return t&&t.length?Jr(t):[]},Tn.uniqBy=function(t,e){return t&&t.length?Jr(t,Xi(e,2)):[]},Tn.uniqWith=function(t,e){return e="function"==typeof e?e:void 0,t&&t.length?Jr(t,void 0,e):[]},Tn.unset=function(t,e){return null==t||Qr(t,e)},Tn.unzip=Ga,Tn.unzipWith=$a,Tn.update=function(t,e,n){return null==t?t:ti(t,e,oi(n))},Tn.updateWith=function(t,e,n,r){return r="function"==typeof r?r:void 0,null==t?t:ti(t,e,oi(n),r)},Tn.values=Ds,Tn.valuesIn=function(t){return null==t?[]:De(t,ws(t))},Tn.without=Wa,Tn.words=js,Tn.wrap=function(t,e){return So(oi(e),t)},Tn.xor=Ka,Tn.xorBy=Xa,Tn.xorWith=Za,Tn.zip=Ja,Tn.zipObject=function(t,e){return ii(t||[],e||[],Yn)},Tn.zipObjectDeep=function(t,e){return ii(t||[],e||[],Ur)},Tn.zipWith=Qa,Tn.entries=Ms,Tn.entriesIn=Ts,Tn.extend=cs,Tn.extendWith=fs,Xs(Tn,Tn),Tn.add=ou,Tn.attempt=Us,Tn.camelCase=Cs,Tn.capitalize=Ns,Tn.ceil=su,Tn.clamp=function(t,e,n){return void 0===n&&(n=e,e=void 0),void 0!==n&&(n=(n=as(n))==n?n:0),void 0!==e&&(e=(e=as(e))==e?e:0),Kn(as(t),e,n)},Tn.clone=function(t){return Xn(t,4)},Tn.cloneDeep=function(t){return Xn(t,5)},Tn.cloneDeepWith=function(t,e){return Xn(t,5,e="function"==typeof e?e:void 0)},Tn.cloneWith=function(t,e){return Xn(t,4,e="function"==typeof e?e:void 0)},Tn.conformsTo=function(t,e){return null==e||Zn(t,e,_s(e))},Tn.deburr=Is,Tn.defaultTo=function(t,e){return null==t||t!=t?e:t},Tn.divide=uu,Tn.endsWith=function(t,e,n){t=ss(t),e=Zr(e);var r=t.length,i=n=void 0===n?r:Kn(rs(n),0,r);return(n-=e.length)>=0&&t.slice(n,i)==e},Tn.eq=Do,Tn.escape=function(t){return(t=ss(t))&&P.test(t)?t.replace(O,Oe):t},Tn.escapeRegExp=function(t){return(t=ss(t))&&H.test(t)?t.replace(V,"\\$&"):t},Tn.every=function(t,e,n){var r=Lo(t)?se:nr;return n&&sa(t,e,n)&&(e=void 0),r(t,Xi(e,3))},Tn.find=io,Tn.findIndex=Na,Tn.findKey=function(t,e){return be(t,Xi(e,3),ur)},Tn.findLast=ao,Tn.findLastIndex=Ia,Tn.findLastKey=function(t,e){return be(t,Xi(e,3),cr)},Tn.floor=cu,Tn.forEach=oo,Tn.forEachRight=so,Tn.forIn=function(t,e){return null==t?t:or(t,Xi(e,3),ws)},Tn.forInRight=function(t,e){return null==t?t:sr(t,Xi(e,3),ws)},Tn.forOwn=function(t,e){return t&&ur(t,Xi(e,3))},Tn.forOwnRight=function(t,e){return t&&cr(t,Xi(e,3))},Tn.get=gs,Tn.gt=Co,Tn.gte=No,Tn.has=function(t,e){return null!=t&&ra(t,e,gr)},Tn.hasIn=ys,Tn.head=Ba,Tn.identity=Gs,Tn.includes=function(t,e,n,r){t=Oo(t)?t:Ds(t),n=n&&!r?rs(n):0;var i=t.length;return n<0&&(n=on(i+n,0)),Xo(t)?n<=i&&t.indexOf(e,n)>-1:!!i&&me(t,e,n)>-1},Tn.indexOf=function(t,e,n){var r=null==t?0:t.length;if(!r)return-1;var i=null==n?0:rs(n);return i<0&&(i=on(r+i,0)),me(t,e,i)},Tn.inRange=function(t,e,n){return e=ns(e),void 0===n?(n=e,e=0):n=ns(n),function(t,e,n){return t>=sn(e,n)&&t<on(e,n)}(t=as(t),e,n)},Tn.invoke=ms,Tn.isArguments=Io,Tn.isArray=Lo,Tn.isArrayBuffer=Bo,Tn.isArrayLike=Oo,Tn.isArrayLikeObject=Ro,Tn.isBoolean=function(t){return!0===t||!1===t||Vo(t)&&dr(t)==u},Tn.isBuffer=Po,Tn.isDate=Fo,Tn.isElement=function(t){return Vo(t)&&1===t.nodeType&&!$o(t)},Tn.isEmpty=function(t){if(null==t)return!0;if(Oo(t)&&(Lo(t)||"string"==typeof t||"function"==typeof t.splice||Po(t)||Jo(t)||Io(t)))return!t.length;var e=na(t);if(e==d||e==b)return!t.size;if(la(t))return!Er(t).length;for(var n in t)if(Et.call(t,n))return!1;return!0},Tn.isEqual=function(t,e){return _r(t,e)},Tn.isEqualWith=function(t,e,n){var r=(n="function"==typeof n?n:void 0)?n(t,e):void 0;return void 0===r?_r(t,e,void 0,n):!!r},Tn.isError=qo,Tn.isFinite=function(t){return"number"==typeof t&&nn(t)},Tn.isFunction=jo,Tn.isInteger=Uo,Tn.isLength=zo,Tn.isMap=Ho,Tn.isMatch=function(t,e){return t===e||wr(t,e,Ji(e))},Tn.isMatchWith=function(t,e,n){return n="function"==typeof n?n:void 0,wr(t,e,Ji(e),n)},Tn.isNaN=function(t){return Go(t)&&t!=+t},Tn.isNative=function(t){if(fa(t))throw new ht("Unsupported core-js use. Try https://npms.io/search?q=ponyfill.");return xr(t)},Tn.isNil=function(t){return null==t},Tn.isNull=function(t){return null===t},Tn.isNumber=Go,Tn.isObject=Yo,Tn.isObjectLike=Vo,Tn.isPlainObject=$o,Tn.isRegExp=Wo,Tn.isSafeInteger=function(t){return Uo(t)&&t>=-9007199254740991&&t<=9007199254740991},Tn.isSet=Ko,Tn.isString=Xo,Tn.isSymbol=Zo,Tn.isTypedArray=Jo,Tn.isUndefined=function(t){return void 0===t},Tn.isWeakMap=function(t){return Vo(t)&&na(t)==_},Tn.isWeakSet=function(t){return Vo(t)&&"[object WeakSet]"==dr(t)},Tn.join=function(t,e){return null==t?"":rn.call(t,e)},Tn.kebabCase=Ls,Tn.last=Fa,Tn.lastIndexOf=function(t,e,n){var r=null==t?0:t.length;if(!r)return-1;var i=r;return void 0!==n&&(i=(i=rs(n))<0?on(r+i,0):sn(i,r-1)),e==e?function(t,e,n){for(var r=n+1;r--;)if(t[r]===e)return r;return r}(t,e,i):ve(t,we,i,!0)},Tn.lowerCase=Bs,Tn.lowerFirst=Os,Tn.lt=Qo,Tn.lte=ts,Tn.max=function(t){return t&&t.length?rr(t,Gs,pr):void 0},Tn.maxBy=function(t,e){return t&&t.length?rr(t,Xi(e,2),pr):void 0},Tn.mean=function(t){return xe(t,Gs)},Tn.meanBy=function(t,e){return xe(t,Xi(e,2))},Tn.min=function(t){return t&&t.length?rr(t,Gs,Sr):void 0},Tn.minBy=function(t,e){return t&&t.length?rr(t,Xi(e,2),Sr):void 0},Tn.stubArray=iu,Tn.stubFalse=au,Tn.stubObject=function(){return{}},Tn.stubString=function(){return""},Tn.stubTrue=function(){return!0},Tn.multiply=lu,Tn.nth=function(t,e){return t&&t.length?Nr(t,rs(e)):void 0},Tn.noConflict=function(){return Ht._===this&&(Ht._=Dt),this},Tn.noop=Zs,Tn.now=go,Tn.pad=function(t,e,n){t=ss(t);var r=(e=rs(e))?Ye(t):0;if(!e||r>=e)return t;var i=(e-r)/2;return Ii(Qe(i),n)+t+Ii(Je(i),n)},Tn.padEnd=function(t,e,n){t=ss(t);var r=(e=rs(e))?Ye(t):0;return e&&r<e?t+Ii(e-r,n):t},Tn.padStart=function(t,e,n){t=ss(t);var r=(e=rs(e))?Ye(t):0;return e&&r<e?Ii(e-r,n)+t:t},Tn.parseInt=function(t,e,n){return n||null==e?e=0:e&&(e=+e),cn(ss(t).replace($,""),e||0)},Tn.random=function(t,e,n){if(n&&"boolean"!=typeof n&&sa(t,e,n)&&(e=n=void 0),void 0===n&&("boolean"==typeof e?(n=e,e=void 0):"boolean"==typeof t&&(n=t,t=void 0)),void 0===t&&void 0===e?(t=0,e=1):(t=ns(t),void 0===e?(e=t,t=0):e=ns(e)),t>e){var r=t;t=e,e=r}if(n||t%1||e%1){var i=fn();return sn(t+i*(e-t+Ut("1e-"+((i+"").length-1))),e)}return Rr(t,e)},Tn.reduce=function(t,e,n){var r=Lo(t)?de:Ae,i=arguments.length<3;return r(t,Xi(e,4),n,i,tr)},Tn.reduceRight=function(t,e,n){var r=Lo(t)?pe:Ae,i=arguments.length<3;return r(t,Xi(e,4),n,i,er)},Tn.repeat=function(t,e,n){return e=(n?sa(t,e,n):void 0===e)?1:rs(e),Pr(ss(t),e)},Tn.replace=function(){var t=arguments,e=ss(t[0]);return t.length<3?e:e.replace(t[1],t[2])},Tn.result=function(t,e,n){var r=-1,i=(e=si(e,t)).length;for(i||(i=1,t=void 0);++r<i;){var a=null==t?void 0:t[Aa(e[r])];void 0===a&&(r=i,a=n),t=jo(a)?a.call(t):a}return t},Tn.round=hu,Tn.runInContext=t,Tn.sample=function(t){return(Lo(t)?qn:qr)(t)},Tn.size=function(t){if(null==t)return 0;if(Oo(t))return Xo(t)?Ye(t):t.length;var e=na(t);return e==d||e==b?t.size:Er(t).length},Tn.snakeCase=Rs,Tn.some=function(t,e,n){var r=Lo(t)?ge:Gr;return n&&sa(t,e,n)&&(e=void 0),r(t,Xi(e,3))},Tn.sortedIndex=function(t,e){return $r(t,e)},Tn.sortedIndexBy=function(t,e,n){return Wr(t,e,Xi(n,2))},Tn.sortedIndexOf=function(t,e){var n=null==t?0:t.length;if(n){var r=$r(t,e);if(r<n&&Do(t[r],e))return r}return-1},Tn.sortedLastIndex=function(t,e){return $r(t,e,!0)},Tn.sortedLastIndexBy=function(t,e,n){return Wr(t,e,Xi(n,2),!0)},Tn.sortedLastIndexOf=function(t,e){if(null==t?0:t.length){var n=$r(t,e,!0)-1;if(Do(t[n],e))return n}return-1},Tn.startCase=Ps,Tn.startsWith=function(t,e,n){return t=ss(t),n=null==n?0:Kn(rs(n),0,t.length),e=Zr(e),t.slice(n,n+e.length)==e},Tn.subtract=du,Tn.sum=function(t){return t&&t.length?Se(t,Gs):0},Tn.sumBy=function(t,e){return t&&t.length?Se(t,Xi(e,2)):0},Tn.template=function(t,e,n){var r=Tn.templateSettings;n&&sa(t,e,n)&&(e=void 0),t=ss(t),e=fs({},e,r,ji);var i,a,o=fs({},e.imports,r.imports,ji),s=_s(o),u=De(o,s),c=0,f=e.interpolate||ut,l="__p += '",h=yt((e.escape||ut).source+"|"+f.source+"|"+(f===j?tt:ut).source+"|"+(e.evaluate||ut).source+"|$","g"),d="//# sourceURL="+(Et.call(e,"sourceURL")?(e.sourceURL+"").replace(/[\r\n]/g," "):"lodash.templateSources["+ ++Pt+"]")+"\n";t.replace(h,(function(e,n,r,o,s,u){return r||(r=o),l+=t.slice(c,u).replace(ct,Re),n&&(i=!0,l+="' +\n__e("+n+") +\n'"),s&&(a=!0,l+="';\n"+s+";\n__p += '"),r&&(l+="' +\n((__t = ("+r+")) == null ? '' : __t) +\n'"),c=u+e.length,e})),l+="';\n";var p=Et.call(e,"variable")&&e.variable;p||(l="with (obj) {\n"+l+"\n}\n"),l=(a?l.replace(N,""):l).replace(I,"$1").replace(L,"$1;"),l="function("+(p||"obj")+") {\n"+(p?"":"obj || (obj = {});\n")+"var __t, __p = ''"+(i?", __e = _.escape":"")+(a?", __j = Array.prototype.join;\nfunction print() { __p += __j.call(arguments, '') }\n":";\n")+l+"return __p\n}";var g=Us((function(){return dt(s,d+"return "+l).apply(void 0,u)}));if(g.source=l,qo(g))throw g;return g},Tn.times=function(t,e){if((t=rs(t))<1||t>9007199254740991)return[];var n=4294967295,r=sn(t,4294967295);t-=4294967295;for(var i=Me(r,e=Xi(e));++n<t;)e(n);return i},Tn.toFinite=ns,Tn.toInteger=rs,Tn.toLength=is,Tn.toLower=function(t){return ss(t).toLowerCase()},Tn.toNumber=as,Tn.toSafeInteger=function(t){return t?Kn(rs(t),-9007199254740991,9007199254740991):0===t?t:0},Tn.toString=ss,Tn.toUpper=function(t){return ss(t).toUpperCase()},Tn.trim=function(t,e,n){if((t=ss(t))&&(n||void 0===e))return t.replace(G,"");if(!t||!(e=Zr(e)))return t;var r=Ve(t),i=Ve(e);return ci(r,Ne(r,i),Ie(r,i)+1).join("")},Tn.trimEnd=function(t,e,n){if((t=ss(t))&&(n||void 0===e))return t.replace(W,"");if(!t||!(e=Zr(e)))return t;var r=Ve(t);return ci(r,0,Ie(r,Ve(e))+1).join("")},Tn.trimStart=function(t,e,n){if((t=ss(t))&&(n||void 0===e))return t.replace($,"");if(!t||!(e=Zr(e)))return t;var r=Ve(t);return ci(r,Ne(r,Ve(e))).join("")},Tn.truncate=function(t,e){var n=30,r="...";if(Yo(e)){var i="separator"in e?e.separator:i;n="length"in e?rs(e.length):n,r="omission"in e?Zr(e.omission):r}var a=(t=ss(t)).length;if(Pe(t)){var o=Ve(t);a=o.length}if(n>=a)return t;var s=n-Ye(r);if(s<1)return r;var u=o?ci(o,0,s).join(""):t.slice(0,s);if(void 0===i)return u+r;if(o&&(s+=u.length-s),Wo(i)){if(t.slice(s).search(i)){var c,f=u;for(i.global||(i=yt(i.source,ss(et.exec(i))+"g")),i.lastIndex=0;c=i.exec(f);)var l=c.index;u=u.slice(0,void 0===l?s:l)}}else if(t.indexOf(Zr(i),s)!=s){var h=u.lastIndexOf(i);h>-1&&(u=u.slice(0,h))}return u+r},Tn.unescape=function(t){return(t=ss(t))&&R.test(t)?t.replace(B,He):t},Tn.uniqueId=function(t){var e=++At;return ss(t)+e},Tn.upperCase=Fs,Tn.upperFirst=qs,Tn.each=oo,Tn.eachRight=so,Tn.first=Ba,Xs(Tn,(fu={},ur(Tn,(function(t,e){Et.call(Tn.prototype,e)||(fu[e]=t)})),fu),{chain:!1}),Tn.VERSION="4.17.15",ae(["bind","bindKey","curry","curryRight","partial","partialRight"],(function(t){Tn[t].placeholder=Tn})),ae(["drop","take"],(function(t,e){In.prototype[t]=function(n){n=void 0===n?1:on(rs(n),0);var r=this.__filtered__&&!e?new In(this):this.clone();return r.__filtered__?r.__takeCount__=sn(n,r.__takeCount__):r.__views__.push({size:sn(n,4294967295),type:t+(r.__dir__<0?"Right":"")}),r},In.prototype[t+"Right"]=function(e){return this.reverse()[t](e).reverse()}})),ae(["filter","map","takeWhile"],(function(t,e){var n=e+1,r=1==n||3==n;In.prototype[t]=function(t){var e=this.clone();return e.__iteratees__.push({iteratee:Xi(t,3),type:n}),e.__filtered__=e.__filtered__||r,e}})),ae(["head","last"],(function(t,e){var n="take"+(e?"Right":"");In.prototype[t]=function(){return this[n](1).value()[0]}})),ae(["initial","tail"],(function(t,e){var n="drop"+(e?"":"Right");In.prototype[t]=function(){return this.__filtered__?new In(this):this[n](1)}})),In.prototype.compact=function(){return this.filter(Gs)},In.prototype.find=function(t){return this.filter(t).head()},In.prototype.findLast=function(t){return this.reverse().find(t)},In.prototype.invokeMap=Fr((function(t,e){return"function"==typeof t?new In(this):this.map((function(n){return vr(n,t,e)}))})),In.prototype.reject=function(t){return this.filter(Eo(Xi(t)))},In.prototype.slice=function(t,e){t=rs(t);var n=this;return n.__filtered__&&(t>0||e<0)?new In(n):(t<0?n=n.takeRight(-t):t&&(n=n.drop(t)),void 0!==e&&(n=(e=rs(e))<0?n.dropRight(-e):n.take(e-t)),n)},In.prototype.takeRightWhile=function(t){return this.reverse().takeWhile(t).reverse()},In.prototype.toArray=function(){return this.take(4294967295)},ur(In.prototype,(function(t,e){var n=/^(?:filter|find|map|reject)|While$/.test(e),r=/^(?:head|last)$/.test(e),i=Tn[r?"take"+("last"==e?"Right":""):e],a=r||/^find/.test(e);i&&(Tn.prototype[e]=function(){var e=this.__wrapped__,o=r?[1]:arguments,s=e instanceof In,u=o[0],c=s||Lo(e),f=function(t){var e=i.apply(Tn,he([t],o));return r&&l?e[0]:e};c&&n&&"function"==typeof u&&1!=u.length&&(s=c=!1);var l=this.__chain__,h=!!this.__actions__.length,d=a&&!l,p=s&&!h;if(!a&&c){e=p?e:new In(this);var g=t.apply(e,o);return g.__actions__.push({func:eo,args:[f],thisArg:void 0}),new Nn(g,l)}return d&&p?t.apply(this,o):(g=this.thru(f),d?r?g.value()[0]:g.value():g)})})),ae(["pop","push","shift","sort","splice","unshift"],(function(t){var e=mt[t],n=/^(?:push|sort|unshift)$/.test(t)?"tap":"thru",r=/^(?:pop|shift)$/.test(t);Tn.prototype[t]=function(){var t=arguments;if(r&&!this.__chain__){var i=this.value();return e.apply(Lo(i)?i:[],t)}return this[n]((function(n){return e.apply(Lo(n)?n:[],t)}))}})),ur(In.prototype,(function(t,e){var n=Tn[e];if(n){var r=n.name+"";Et.call(mn,r)||(mn[r]=[]),mn[r].push({name:e,func:n})}})),mn[Ti(void 0,2).name]=[{name:"wrapper",func:void 0}],In.prototype.clone=function(){var t=new In(this.__wrapped__);return t.__actions__=bi(this.__actions__),t.__dir__=this.__dir__,t.__filtered__=this.__filtered__,t.__iteratees__=bi(this.__iteratees__),t.__takeCount__=this.__takeCount__,t.__views__=bi(this.__views__),t},In.prototype.reverse=function(){if(this.__filtered__){var t=new In(this);t.__dir__=-1,t.__filtered__=!0}else(t=this.clone()).__dir__*=-1;return t},In.prototype.value=function(){var t=this.__wrapped__.value(),e=this.__dir__,n=Lo(t),r=e<0,i=n?t.length:0,a=function(t,e,n){var r=-1,i=n.length;for(;++r<i;){var a=n[r],o=a.size;switch(a.type){case"drop":t+=o;break;case"dropRight":e-=o;break;case"take":e=sn(e,t+o);break;case"takeRight":t=on(t,e-o)}}return{start:t,end:e}}(0,i,this.__views__),o=a.start,s=a.end,u=s-o,c=r?s:o-1,f=this.__iteratees__,l=f.length,h=0,d=sn(u,this.__takeCount__);if(!n||!r&&i==u&&d==u)return ni(t,this.__actions__);var p=[];t:for(;u--&&h<d;){for(var g=-1,y=t[c+=e];++g<l;){var b=f[g],v=b.iteratee,m=b.type,_=v(y);if(2==m)y=_;else if(!_){if(1==m)continue t;break t}}p[h++]=y}return p},Tn.prototype.at=no,Tn.prototype.chain=function(){return to(this)},Tn.prototype.commit=function(){return new Nn(this.value(),this.__chain__)},Tn.prototype.next=function(){void 0===this.__values__&&(this.__values__=es(this.value()));var t=this.__index__>=this.__values__.length;return{done:t,value:t?void 0:this.__values__[this.__index__++]}},Tn.prototype.plant=function(t){for(var e,n=this;n instanceof Cn;){var r=Ma(n);r.__index__=0,r.__values__=void 0,e?i.__wrapped__=r:e=r;var i=r;n=n.__wrapped__}return i.__wrapped__=t,e},Tn.prototype.reverse=function(){var t=this.__wrapped__;if(t instanceof In){var e=t;return this.__actions__.length&&(e=new In(this)),(e=e.reverse()).__actions__.push({func:eo,args:[za],thisArg:void 0}),new Nn(e,this.__chain__)}return this.thru(za)},Tn.prototype.toJSON=Tn.prototype.valueOf=Tn.prototype.value=function(){return ni(this.__wrapped__,this.__actions__)},Tn.prototype.first=Tn.prototype.head,Ee&&(Tn.prototype[Ee]=function(){return this}),Tn}();"function"==typeof define&&"object"==typeof define.amd&&define.amd?(Ht._=Ge,define((function(){return Ge}))):$t?(($t.exports=Ge)._=Ge,Gt._=Ge):Ht._=Ge}).call(this)}).call(this,n(12),n(9)(t))},function(t,e,n){var r=n(66),i=n(67);t.exports=function(t,e,n,a){var o=!n;n||(n={});for(var s=-1,u=e.length;++s<u;){var c=e[s],f=a?a(n[c],t[c],c,n,t):void 0;void 0===f&&(f=t[c]),o?i(n,c,f):r(n,c,f)}return n}},function(t,e,n){var r=n(268),i=n(20),a=Object.prototype,o=a.hasOwnProperty,s=a.propertyIsEnumerable,u=r(function(){return arguments}())?r:function(t){return i(t)&&o.call(t,"callee")&&!s.call(t,"callee")};t.exports=u},function(t,e,n){var r=n(270),i=n(69),a=n(94),o=a&&a.isTypedArray,s=o?i(o):r;t.exports=s},function(t,e,n){var r=n(42);t.exports=function(t){if("string"==typeof t||r(t))return t;var e=t+"";return"0"==e&&1/t==-1/0?"-0":e}},function(t,e,n){"use strict";var r=n(2),i=n(111),a=n(118),o=n(119),s=n(31);function u(t){s.call(this,"digest"),this._hash=t}r(u,s),u.prototype._update=function(t){this._hash.update(t)},u.prototype._final=function(){return this._hash.digest()},t.exports=function(t){return"md5"===(t=t.toLowerCase())?new i:"rmd160"===t||"ripemd160"===t?new a:new u(o(t))}},function(t,e,n){(function(t){function n(t){return Object.prototype.toString.call(t)}e.isArray=function(t){return Array.isArray?Array.isArray(t):"[object Array]"===n(t)},e.isBoolean=function(t){return"boolean"==typeof t},e.isNull=function(t){return null===t},e.isNullOrUndefined=function(t){return null==t},e.isNumber=function(t){return"number"==typeof t},e.isString=function(t){return"string"==typeof t},e.isSymbol=function(t){return"symbol"==typeof t},e.isUndefined=function(t){return void 0===t},e.isRegExp=function(t){return"[object RegExp]"===n(t)},e.isObject=function(t){return"object"==typeof t&&null!==t},e.isDate=function(t){return"[object Date]"===n(t)},e.isError=function(t){return"[object Error]"===n(t)||t instanceof Error},e.isFunction=function(t){return"function"==typeof t},e.isPrimitive=function(t){return null===t||"boolean"==typeof t||"number"==typeof t||"string"==typeof t||"symbol"==typeof t||void 0===t},e.isBuffer=t.isBuffer}).call(this,n(8).Buffer)},function(t,e,n){(function(e){t.exports=function(t,n){for(var r=Math.min(t.length,n.length),i=new e(r),a=0;a<r;++a)i[a]=t[a]^n[a];return i}}).call(this,n(8).Buffer)},function(t,e,n){"use strict";var r=n(21),i=n(16);function a(){this.pending=null,this.pendingTotal=0,this.blockSize=this.constructor.blockSize,this.outSize=this.constructor.outSize,this.hmacStrength=this.constructor.hmacStrength,this.padLength=this.constructor.padLength/8,this.endian="big",this._delta8=this.blockSize/8,this._delta32=this.blockSize/32}e.BlockHash=a,a.prototype.update=function(t,e){if(t=r.toArray(t,e),this.pending?this.pending=this.pending.concat(t):this.pending=t,this.pendingTotal+=t.length,this.pending.length>=this._delta8){var n=(t=this.pending).length%this._delta8;this.pending=t.slice(t.length-n,t.length),0===this.pending.length&&(this.pending=null),t=r.join32(t,0,t.length-n,this.endian);for(var i=0;i<t.length;i+=this._delta32)this._update(t,i,i+this._delta32)}return this},a.prototype.digest=function(t){return this.update(this._pad()),i(null===this.pending),this._digest(t)},a.prototype._pad=function(){var t=this.pendingTotal,e=this._delta8,n=e-(t+this.padLength)%e,r=new Array(n+this.padLength);r[0]=128;for(var i=1;i<n;i++)r[i]=0;if(t<<=3,"big"===this.endian){for(var a=8;a<this.padLength;a++)r[i++]=0;r[i++]=0,r[i++]=0,r[i++]=0,r[i++]=0,r[i++]=t>>>24&255,r[i++]=t>>>16&255,r[i++]=t>>>8&255,r[i++]=255&t}else for(r[i++]=255&t,r[i++]=t>>>8&255,r[i++]=t>>>16&255,r[i++]=t>>>24&255,r[i++]=0,r[i++]=0,r[i++]=0,r[i++]=0,a=8;a<this.padLength;a++)r[i++]=0;return r}},function(t,e,n){var r=e;r.bignum=n(5),r.define=n(482).define,r.base=n(58),r.constants=n(221),r.decoders=n(487),r.encoders=n(489)},function(t,e,n){var r=e;r.Reporter=n(484).Reporter,r.DecoderBuffer=n(220).DecoderBuffer,r.EncoderBuffer=n(220).EncoderBuffer,r.Node=n(485)},function(t,e,n){t.exports={graphlib:n(19),layout:n(349),debug:n(403),util:{time:n(10).time,notime:n(10).notime},version:n(404)}},function(t,e,n){(function(t,r){var i=function(){var t=function(t,e,n,r){for(n=n||{},r=t.length;r--;n[t[r]]=e);return n},e=[1,4],n=[1,3],r=[1,5],i=[1,8,9,10,11,26,34,61,62,63,64,65,66,76,77,80,81,82,84,85,91,92,93,94,95,96],a=[2,2],o=[1,12],s=[1,13],u=[1,14],c=[1,15],f=[1,22],l=[1,46],h=[1,24],d=[1,25],p=[1,26],g=[1,27],y=[1,28],b=[1,40],v=[1,35],m=[1,37],_=[1,32],w=[1,36],x=[1,39],k=[1,43],E=[1,44],A=[1,45],S=[1,34],M=[1,38],T=[1,41],D=[1,42],C=[1,33],N=[1,51],I=[1,8,9,10,11,26,30,34,61,62,63,64,65,66,76,77,80,81,82,84,85,91,92,93,94,95,96],L=[1,55],B=[1,54],O=[1,56],R=[8,9,11,55,56],P=[8,9,10,11,55,56],F=[8,9,10,11,35,55,56],q=[8,9,10,11,28,34,35,37,39,41,43,45,47,48,50,55,56,66,76,77,80,81,82,84,85,91,92,93,94,95,96],j=[8,9,11,34,55,56,66,76,77,80,81,82,84,85,91,92,93,94,95,96],U=[34,66,76,77,80,81,82,84,85,91,92,93,94,95,96],z=[1,100],Y=[1,121],V=[1,122],H=[1,123],G=[1,124],$=[1,104],W=[1,95],K=[1,96],X=[1,92],Z=[1,116],J=[1,117],Q=[1,118],tt=[1,119],et=[1,120],nt=[1,125],rt=[1,126],it=[1,98],at=[1,106],ot=[1,109],st=[1,107],ut=[1,108],ct=[1,101],ft=[1,114],lt=[1,113],ht=[1,97],dt=[1,94],pt=[1,103],gt=[1,105],yt=[1,110],bt=[1,111],vt=[1,112],mt=[1,115],_t=[8,9,10,11,26,30,34,61,62,63,64,65,66,76,77,80,81,82,84,85,91,92,93,94,95,96],wt=[1,129],xt=[1,133],kt=[1,135],Et=[1,136],At=[8,9,10,11,12,13,26,28,29,30,34,38,40,42,44,46,47,49,51,55,56,57,61,62,63,64,65,66,67,70,76,77,80,81,82,84,85,86,87,91,92,93,94,95,96],St=[8,9,10,11,13,34,66,76,77,80,81,82,84,85,91,92,93,94,95,96],Mt=[10,77],Tt=[1,201],Dt=[1,205],Ct=[1,202],Nt=[1,199],It=[1,196],Lt=[1,197],Bt=[1,198],Ot=[1,200],Rt=[1,203],Pt=[1,204],Ft=[1,206],qt=[8,9,11],jt=[1,222],Ut=[8,9,11,77],zt=[8,9,10,11,61,73,76,77,80,81,82,83,84,85,86],Yt={trace:function(){},yy:{},symbols_:{error:2,mermaidDoc:3,graphConfig:4,document:5,line:6,statement:7,SEMI:8,NEWLINE:9,SPACE:10,EOF:11,GRAPH:12,DIR:13,FirstStmtSeperator:14,ending:15,endToken:16,spaceList:17,spaceListNewline:18,verticeStatement:19,separator:20,styleStatement:21,linkStyleStatement:22,classDefStatement:23,classStatement:24,clickStatement:25,subgraph:26,text:27,SQS:28,SQE:29,end:30,link:31,node:32,vertex:33,AMP:34,STYLE_SEPARATOR:35,idString:36,PS:37,PE:38,"(-":39,"-)":40,STADIUMSTART:41,STADIUMEND:42,CYLINDERSTART:43,CYLINDEREND:44,DIAMOND_START:45,DIAMOND_STOP:46,TAGEND:47,TRAPSTART:48,TRAPEND:49,INVTRAPSTART:50,INVTRAPEND:51,linkStatement:52,arrowText:53,TESTSTR:54,START_LINK:55,LINK:56,PIPE:57,textToken:58,STR:59,keywords:60,STYLE:61,LINKSTYLE:62,CLASSDEF:63,CLASS:64,CLICK:65,DOWN:66,UP:67,textNoTags:68,textNoTagsToken:69,DEFAULT:70,stylesOpt:71,alphaNum:72,HEX:73,numList:74,INTERPOLATE:75,NUM:76,COMMA:77,style:78,styleComponent:79,ALPHA:80,COLON:81,MINUS:82,UNIT:83,BRKT:84,DOT:85,PCT:86,TAGSTART:87,alphaNumToken:88,idStringToken:89,alphaNumStatement:90,PUNCTUATION:91,UNICODE_TEXT:92,PLUS:93,EQUALS:94,MULT:95,UNDERSCORE:96,graphCodeTokens:97,ARROW_CROSS:98,ARROW_POINT:99,ARROW_CIRCLE:100,ARROW_OPEN:101,QUOTE:102,$accept:0,$end:1},terminals_:{2:"error",8:"SEMI",9:"NEWLINE",10:"SPACE",11:"EOF",12:"GRAPH",13:"DIR",26:"subgraph",28:"SQS",29:"SQE",30:"end",34:"AMP",35:"STYLE_SEPARATOR",37:"PS",38:"PE",39:"(-",40:"-)",41:"STADIUMSTART",42:"STADIUMEND",43:"CYLINDERSTART",44:"CYLINDEREND",45:"DIAMOND_START",46:"DIAMOND_STOP",47:"TAGEND",48:"TRAPSTART",49:"TRAPEND",50:"INVTRAPSTART",51:"INVTRAPEND",54:"TESTSTR",55:"START_LINK",56:"LINK",57:"PIPE",59:"STR",61:"STYLE",62:"LINKSTYLE",63:"CLASSDEF",64:"CLASS",65:"CLICK",66:"DOWN",67:"UP",70:"DEFAULT",73:"HEX",75:"INTERPOLATE",76:"NUM",77:"COMMA",80:"ALPHA",81:"COLON",82:"MINUS",83:"UNIT",84:"BRKT",85:"DOT",86:"PCT",87:"TAGSTART",91:"PUNCTUATION",92:"UNICODE_TEXT",93:"PLUS",94:"EQUALS",95:"MULT",96:"UNDERSCORE",98:"ARROW_CROSS",99:"ARROW_POINT",100:"ARROW_CIRCLE",101:"ARROW_OPEN",102:"QUOTE"},productions_:[0,[3,2],[5,0],[5,2],[6,1],[6,1],[6,1],[6,1],[6,1],[4,2],[4,2],[4,3],[15,2],[15,1],[16,1],[16,1],[16,1],[14,1],[14,1],[14,2],[18,2],[18,2],[18,1],[18,1],[17,2],[17,1],[7,2],[7,2],[7,2],[7,2],[7,2],[7,2],[7,9],[7,6],[7,4],[20,1],[20,1],[20,1],[19,3],[19,4],[19,2],[19,1],[32,1],[32,5],[32,3],[33,4],[33,6],[33,4],[33,4],[33,4],[33,4],[33,4],[33,6],[33,4],[33,4],[33,4],[33,4],[33,4],[33,1],[31,2],[31,3],[31,3],[31,1],[31,3],[52,1],[53,3],[27,1],[27,2],[27,1],[60,1],[60,1],[60,1],[60,1],[60,1],[60,1],[60,1],[60,1],[60,1],[60,1],[60,1],[68,1],[68,2],[23,5],[23,5],[24,5],[25,5],[25,7],[25,5],[25,7],[21,5],[21,5],[22,5],[22,5],[22,9],[22,9],[22,7],[22,7],[74,1],[74,3],[71,1],[71,3],[78,1],[78,2],[79,1],[79,1],[79,1],[79,1],[79,1],[79,1],[79,1],[79,1],[79,1],[79,1],[79,1],[58,1],[58,1],[58,1],[58,1],[58,1],[58,1],[69,1],[69,1],[69,1],[69,1],[36,1],[36,2],[72,1],[72,2],[90,1],[90,1],[90,1],[90,1],[88,1],[88,1],[88,1],[88,1],[88,1],[88,1],[88,1],[88,1],[88,1],[88,1],[88,1],[88,1],[88,1],[89,1],[89,1],[89,1],[89,1],[89,1],[89,1],[89,1],[89,1],[89,1],[89,1],[89,1],[89,1],[89,1],[89,1],[89,1],[97,1],[97,1],[97,1],[97,1],[97,1],[97,1],[97,1],[97,1],[97,1],[97,1],[97,1],[97,1],[97,1],[97,1],[97,1],[97,1],[97,1],[97,1],[97,1],[97,1],[97,1],[97,1],[97,1]],performAction:function(t,e,n,r,i,a,o){var s=a.length-1;switch(i){case 2:this.$=[];break;case 3:a[s]!==[]&&a[s-1].push(a[s]),this.$=a[s-1];break;case 4:case 66:case 68:case 80:case 126:case 128:case 129:this.$=a[s];break;case 11:r.setDirection(a[s-1]),this.$=a[s-1];break;case 26:this.$=a[s-1].nodes;break;case 27:case 28:case 29:case 30:case 31:this.$=[];break;case 32:this.$=r.addSubGraph(a[s-6],a[s-1],a[s-4]);break;case 33:this.$=r.addSubGraph(a[s-3],a[s-1],a[s-3]);break;case 34:this.$=r.addSubGraph(void 0,a[s-1],void 0);break;case 38:r.addLink(a[s-2].stmt,a[s],a[s-1]),this.$={stmt:a[s],nodes:a[s].concat(a[s-2].nodes)};break;case 39:r.addLink(a[s-3].stmt,a[s-1],a[s-2]),this.$={stmt:a[s-1],nodes:a[s-1].concat(a[s-3].nodes)};break;case 40:this.$={stmt:a[s-1],nodes:a[s-1]};break;case 41:this.$={stmt:a[s],nodes:a[s]};break;case 42:this.$=[a[s]];break;case 43:this.$=a[s-4].concat(a[s]);break;case 44:this.$=[a[s-2]],r.setClass(a[s-2],a[s]);break;case 45:this.$=a[s-3],r.addVertex(a[s-3],a[s-1],"square");break;case 46:this.$=a[s-5],r.addVertex(a[s-5],a[s-2],"circle");break;case 47:this.$=a[s-3],r.addVertex(a[s-3],a[s-1],"ellipse");break;case 48:this.$=a[s-3],r.addVertex(a[s-3],a[s-1],"stadium");break;case 49:this.$=a[s-3],r.addVertex(a[s-3],a[s-1],"cylinder");break;case 50:this.$=a[s-3],r.addVertex(a[s-3],a[s-1],"round");break;case 51:this.$=a[s-3],r.addVertex(a[s-3],a[s-1],"diamond");break;case 52:this.$=a[s-5],r.addVertex(a[s-5],a[s-2],"hexagon");break;case 53:this.$=a[s-3],r.addVertex(a[s-3],a[s-1],"odd");break;case 54:this.$=a[s-3],r.addVertex(a[s-3],a[s-1],"trapezoid");break;case 55:this.$=a[s-3],r.addVertex(a[s-3],a[s-1],"inv_trapezoid");break;case 56:this.$=a[s-3],r.addVertex(a[s-3],a[s-1],"lean_right");break;case 57:this.$=a[s-3],r.addVertex(a[s-3],a[s-1],"lean_left");break;case 58:this.$=a[s],r.addVertex(a[s]);break;case 59:a[s-1].text=a[s],this.$=a[s-1];break;case 60:case 61:a[s-2].text=a[s-1],this.$=a[s-2];break;case 62:this.$=a[s];break;case 63:var u=r.destructLink(a[s],a[s-2]);this.$={type:u.type,stroke:u.stroke,text:a[s-1]};break;case 64:u=r.destructLink(a[s]);this.$={type:u.type,stroke:u.stroke};break;case 65:this.$=a[s-1];break;case 67:case 81:case 127:this.$=a[s-1]+""+a[s];break;case 82:case 83:this.$=a[s-4],r.addClass(a[s-2],a[s]);break;case 84:this.$=a[s-4],r.setClass(a[s-2],a[s]);break;case 85:this.$=a[s-4],r.setClickEvent(a[s-2],a[s],void 0);break;case 86:this.$=a[s-6],r.setClickEvent(a[s-4],a[s-2],a[s]);break;case 87:this.$=a[s-4],r.setLink(a[s-2],a[s],void 0);break;case 88:this.$=a[s-6],r.setLink(a[s-4],a[s-2],a[s]);break;case 89:this.$=a[s-4],r.addVertex(a[s-2],void 0,void 0,a[s]);break;case 90:case 92:this.$=a[s-4],r.updateLink(a[s-2],a[s]);break;case 91:this.$=a[s-4],r.updateLink([a[s-2]],a[s]);break;case 93:this.$=a[s-8],r.updateLinkInterpolate([a[s-6]],a[s-2]),r.updateLink([a[s-6]],a[s]);break;case 94:this.$=a[s-8],r.updateLinkInterpolate(a[s-6],a[s-2]),r.updateLink(a[s-6],a[s]);break;case 95:this.$=a[s-6],r.updateLinkInterpolate([a[s-4]],a[s]);break;case 96:this.$=a[s-6],r.updateLinkInterpolate(a[s-4],a[s]);break;case 97:case 99:this.$=[a[s]];break;case 98:case 100:a[s-2].push(a[s]),this.$=a[s-2];break;case 102:this.$=a[s-1]+a[s];break;case 124:this.$=a[s];break;case 125:this.$=a[s-1]+""+a[s];break;case 130:this.$="v";break;case 131:this.$="-"}},table:[{3:1,4:2,9:e,10:n,12:r},{1:[3]},t(i,a,{5:6}),{4:7,9:e,10:n,12:r},{4:8,9:e,10:n,12:r},{13:[1,9]},{1:[2,1],6:10,7:11,8:o,9:s,10:u,11:c,19:16,21:17,22:18,23:19,24:20,25:21,26:f,32:23,33:29,34:l,36:30,61:h,62:d,63:p,64:g,65:y,66:b,76:v,77:m,80:_,81:w,82:x,84:k,85:E,89:31,91:A,92:S,93:M,94:T,95:D,96:C},t(i,[2,9]),t(i,[2,10]),{8:[1,48],9:[1,49],10:N,14:47,17:50},t(I,[2,3]),t(I,[2,4]),t(I,[2,5]),t(I,[2,6]),t(I,[2,7]),t(I,[2,8]),{8:L,9:B,11:O,20:52,31:53,52:57,55:[1,58],56:[1,59]},{8:L,9:B,11:O,20:60},{8:L,9:B,11:O,20:61},{8:L,9:B,11:O,20:62},{8:L,9:B,11:O,20:63},{8:L,9:B,11:O,20:64},{8:L,9:B,10:[1,65],11:O,20:66},t(R,[2,41],{17:67,10:N}),{10:[1,68]},{10:[1,69]},{10:[1,70]},{10:[1,71]},{10:[1,72]},t(P,[2,42],{35:[1,73]}),t(F,[2,58],{89:83,28:[1,74],34:l,37:[1,75],39:[1,76],41:[1,77],43:[1,78],45:[1,79],47:[1,80],48:[1,81],50:[1,82],66:b,76:v,77:m,80:_,81:w,82:x,84:k,85:E,91:A,92:S,93:M,94:T,95:D,96:C}),t(q,[2,124]),t(q,[2,145]),t(q,[2,146]),t(q,[2,147]),t(q,[2,148]),t(q,[2,149]),t(q,[2,150]),t(q,[2,151]),t(q,[2,152]),t(q,[2,153]),t(q,[2,154]),t(q,[2,155]),t(q,[2,156]),t(q,[2,157]),t(q,[2,158]),t(q,[2,159]),t(i,[2,11]),t(i,[2,17]),t(i,[2,18]),{9:[1,84]},t(j,[2,25],{17:85,10:N}),t(I,[2,26]),{32:86,33:29,34:l,36:30,66:b,76:v,77:m,80:_,81:w,82:x,84:k,85:E,89:31,91:A,92:S,93:M,94:T,95:D,96:C},t(I,[2,35]),t(I,[2,36]),t(I,[2,37]),t(U,[2,62],{53:87,54:[1,88],57:[1,89]}),{10:z,12:Y,13:V,26:H,27:90,30:G,34:$,47:W,55:K,58:91,59:X,60:102,61:Z,62:J,63:Q,64:tt,65:et,66:nt,67:rt,69:93,70:it,76:at,77:ot,80:st,81:ut,82:ct,84:ft,85:lt,86:ht,87:dt,88:99,91:pt,92:gt,93:yt,94:bt,95:vt,96:mt},t([34,54,57,66,76,77,80,81,82,84,85,91,92,93,94,95,96],[2,64]),t(I,[2,27]),t(I,[2,28]),t(I,[2,29]),t(I,[2,30]),t(I,[2,31]),{10:z,12:Y,13:V,26:H,27:127,30:G,34:$,47:W,55:K,58:91,59:X,60:102,61:Z,62:J,63:Q,64:tt,65:et,66:nt,67:rt,69:93,70:it,76:at,77:ot,80:st,81:ut,82:ct,84:ft,85:lt,86:ht,87:dt,88:99,91:pt,92:gt,93:yt,94:bt,95:vt,96:mt},t(_t,a,{5:128}),t(R,[2,40],{34:wt}),{13:xt,34:$,66:kt,72:130,73:[1,131],76:at,77:ot,80:st,81:ut,82:Et,84:ft,85:lt,88:134,90:132,91:pt,92:gt,93:yt,94:bt,95:vt,96:mt},{70:[1,137],74:138,76:[1,139]},{13:xt,34:$,66:kt,70:[1,140],72:141,76:at,77:ot,80:st,81:ut,82:Et,84:ft,85:lt,88:134,90:132,91:pt,92:gt,93:yt,94:bt,95:vt,96:mt},{13:xt,34:$,66:kt,72:142,76:at,77:ot,80:st,81:ut,82:Et,84:ft,85:lt,88:134,90:132,91:pt,92:gt,93:yt,94:bt,95:vt,96:mt},{13:xt,34:$,66:kt,72:143,76:at,77:ot,80:st,81:ut,82:Et,84:ft,85:lt,88:134,90:132,91:pt,92:gt,93:yt,94:bt,95:vt,96:mt},{34:l,36:144,66:b,76:v,77:m,80:_,81:w,82:x,84:k,85:E,89:31,91:A,92:S,93:M,94:T,95:D,96:C},{10:z,12:Y,13:V,26:H,27:145,30:G,34:$,47:W,55:K,58:91,59:X,60:102,61:Z,62:J,63:Q,64:tt,65:et,66:nt,67:rt,69:93,70:it,76:at,77:ot,80:st,81:ut,82:ct,84:ft,85:lt,86:ht,87:dt,88:99,91:pt,92:gt,93:yt,94:bt,95:vt,96:mt},{10:z,12:Y,13:V,26:H,27:147,30:G,34:$,37:[1,146],47:W,55:K,58:91,59:X,60:102,61:Z,62:J,63:Q,64:tt,65:et,66:nt,67:rt,69:93,70:it,76:at,77:ot,80:st,81:ut,82:ct,84:ft,85:lt,86:ht,87:dt,88:99,91:pt,92:gt,93:yt,94:bt,95:vt,96:mt},{10:z,12:Y,13:V,26:H,27:148,30:G,34:$,47:W,55:K,58:91,59:X,60:102,61:Z,62:J,63:Q,64:tt,65:et,66:nt,67:rt,69:93,70:it,76:at,77:ot,80:st,81:ut,82:ct,84:ft,85:lt,86:ht,87:dt,88:99,91:pt,92:gt,93:yt,94:bt,95:vt,96:mt},{10:z,12:Y,13:V,26:H,27:149,30:G,34:$,47:W,55:K,58:91,59:X,60:102,61:Z,62:J,63:Q,64:tt,65:et,66:nt,67:rt,69:93,70:it,76:at,77:ot,80:st,81:ut,82:ct,84:ft,85:lt,86:ht,87:dt,88:99,91:pt,92:gt,93:yt,94:bt,95:vt,96:mt},{10:z,12:Y,13:V,26:H,27:150,30:G,34:$,47:W,55:K,58:91,59:X,60:102,61:Z,62:J,63:Q,64:tt,65:et,66:nt,67:rt,69:93,70:it,76:at,77:ot,80:st,81:ut,82:ct,84:ft,85:lt,86:ht,87:dt,88:99,91:pt,92:gt,93:yt,94:bt,95:vt,96:mt},{10:z,12:Y,13:V,26:H,27:151,30:G,34:$,45:[1,152],47:W,55:K,58:91,59:X,60:102,61:Z,62:J,63:Q,64:tt,65:et,66:nt,67:rt,69:93,70:it,76:at,77:ot,80:st,81:ut,82:ct,84:ft,85:lt,86:ht,87:dt,88:99,91:pt,92:gt,93:yt,94:bt,95:vt,96:mt},{10:z,12:Y,13:V,26:H,27:153,30:G,34:$,47:W,55:K,58:91,59:X,60:102,61:Z,62:J,63:Q,64:tt,65:et,66:nt,67:rt,69:93,70:it,76:at,77:ot,80:st,81:ut,82:ct,84:ft,85:lt,86:ht,87:dt,88:99,91:pt,92:gt,93:yt,94:bt,95:vt,96:mt},{10:z,12:Y,13:V,26:H,27:154,30:G,34:$,47:W,55:K,58:91,59:X,60:102,61:Z,62:J,63:Q,64:tt,65:et,66:nt,67:rt,69:93,70:it,76:at,77:ot,80:st,81:ut,82:ct,84:ft,85:lt,86:ht,87:dt,88:99,91:pt,92:gt,93:yt,94:bt,95:vt,96:mt},{10:z,12:Y,13:V,26:H,27:155,30:G,34:$,47:W,55:K,58:91,59:X,60:102,61:Z,62:J,63:Q,64:tt,65:et,66:nt,67:rt,69:93,70:it,76:at,77:ot,80:st,81:ut,82:ct,84:ft,85:lt,86:ht,87:dt,88:99,91:pt,92:gt,93:yt,94:bt,95:vt,96:mt},t(q,[2,125]),t(i,[2,19]),t(j,[2,24]),t(R,[2,38],{17:156,10:N}),t(U,[2,59],{10:[1,157]}),{10:[1,158]},{10:z,12:Y,13:V,26:H,27:159,30:G,34:$,47:W,55:K,58:91,59:X,60:102,61:Z,62:J,63:Q,64:tt,65:et,66:nt,67:rt,69:93,70:it,76:at,77:ot,80:st,81:ut,82:ct,84:ft,85:lt,86:ht,87:dt,88:99,91:pt,92:gt,93:yt,94:bt,95:vt,96:mt},{10:z,12:Y,13:V,26:H,30:G,34:$,47:W,55:K,56:[1,160],58:161,60:102,61:Z,62:J,63:Q,64:tt,65:et,66:nt,67:rt,69:93,70:it,76:at,77:ot,80:st,81:ut,82:ct,84:ft,85:lt,86:ht,87:dt,88:99,91:pt,92:gt,93:yt,94:bt,95:vt,96:mt},t(At,[2,66]),t(At,[2,68]),t(At,[2,114]),t(At,[2,115]),t(At,[2,116]),t(At,[2,117]),t(At,[2,118]),t(At,[2,119]),t(At,[2,120]),t(At,[2,121]),t(At,[2,122]),t(At,[2,123]),t(At,[2,132]),t(At,[2,133]),t(At,[2,134]),t(At,[2,135]),t(At,[2,136]),t(At,[2,137]),t(At,[2,138]),t(At,[2,139]),t(At,[2,140]),t(At,[2,141]),t(At,[2,142]),t(At,[2,143]),t(At,[2,144]),t(At,[2,69]),t(At,[2,70]),t(At,[2,71]),t(At,[2,72]),t(At,[2,73]),t(At,[2,74]),t(At,[2,75]),t(At,[2,76]),t(At,[2,77]),t(At,[2,78]),t(At,[2,79]),{8:L,9:B,10:z,11:O,12:Y,13:V,20:163,26:H,28:[1,162],30:G,34:$,47:W,55:K,58:161,60:102,61:Z,62:J,63:Q,64:tt,65:et,66:nt,67:rt,69:93,70:it,76:at,77:ot,80:st,81:ut,82:ct,84:ft,85:lt,86:ht,87:dt,88:99,91:pt,92:gt,93:yt,94:bt,95:vt,96:mt},{6:10,7:11,8:o,9:s,10:u,11:c,19:16,21:17,22:18,23:19,24:20,25:21,26:f,30:[1,164],32:23,33:29,34:l,36:30,61:h,62:d,63:p,64:g,65:y,66:b,76:v,77:m,80:_,81:w,82:x,84:k,85:E,89:31,91:A,92:S,93:M,94:T,95:D,96:C},{10:N,17:165},{10:[1,166],13:xt,34:$,66:kt,76:at,77:ot,80:st,81:ut,82:Et,84:ft,85:lt,88:134,90:167,91:pt,92:gt,93:yt,94:bt,95:vt,96:mt},{10:[1,168]},t(St,[2,126]),t(St,[2,128]),t(St,[2,129]),t(St,[2,130]),t(St,[2,131]),{10:[1,169]},{10:[1,170],77:[1,171]},t(Mt,[2,97]),{10:[1,172]},{10:[1,173],13:xt,34:$,66:kt,76:at,77:ot,80:st,81:ut,82:Et,84:ft,85:lt,88:134,90:167,91:pt,92:gt,93:yt,94:bt,95:vt,96:mt},{10:[1,174],13:xt,34:$,66:kt,76:at,77:ot,80:st,81:ut,82:Et,84:ft,85:lt,88:134,90:167,91:pt,92:gt,93:yt,94:bt,95:vt,96:mt},{10:[1,175],13:xt,34:$,66:kt,76:at,77:ot,80:st,81:ut,82:Et,84:ft,85:lt,88:134,90:167,91:pt,92:gt,93:yt,94:bt,95:vt,96:mt},t(P,[2,44],{89:83,34:l,66:b,76:v,77:m,80:_,81:w,82:x,84:k,85:E,91:A,92:S,93:M,94:T,95:D,96:C}),{10:z,12:Y,13:V,26:H,29:[1,176],30:G,34:$,47:W,55:K,58:161,60:102,61:Z,62:J,63:Q,64:tt,65:et,66:nt,67:rt,69:93,70:it,76:at,77:ot,80:st,81:ut,82:ct,84:ft,85:lt,86:ht,87:dt,88:99,91:pt,92:gt,93:yt,94:bt,95:vt,96:mt},{10:z,12:Y,13:V,26:H,27:177,30:G,34:$,47:W,55:K,58:91,59:X,60:102,61:Z,62:J,63:Q,64:tt,65:et,66:nt,67:rt,69:93,70:it,76:at,77:ot,80:st,81:ut,82:ct,84:ft,85:lt,86:ht,87:dt,88:99,91:pt,92:gt,93:yt,94:bt,95:vt,96:mt},{10:z,12:Y,13:V,26:H,30:G,34:$,38:[1,178],47:W,55:K,58:161,60:102,61:Z,62:J,63:Q,64:tt,65:et,66:nt,67:rt,69:93,70:it,76:at,77:ot,80:st,81:ut,82:ct,84:ft,85:lt,86:ht,87:dt,88:99,91:pt,92:gt,93:yt,94:bt,95:vt,96:mt},{10:z,12:Y,13:V,26:H,30:G,34:$,40:[1,179],47:W,55:K,58:161,60:102,61:Z,62:J,63:Q,64:tt,65:et,66:nt,67:rt,69:93,70:it,76:at,77:ot,80:st,81:ut,82:ct,84:ft,85:lt,86:ht,87:dt,88:99,91:pt,92:gt,93:yt,94:bt,95:vt,96:mt},{10:z,12:Y,13:V,26:H,30:G,34:$,42:[1,180],47:W,55:K,58:161,60:102,61:Z,62:J,63:Q,64:tt,65:et,66:nt,67:rt,69:93,70:it,76:at,77:ot,80:st,81:ut,82:ct,84:ft,85:lt,86:ht,87:dt,88:99,91:pt,92:gt,93:yt,94:bt,95:vt,96:mt},{10:z,12:Y,13:V,26:H,30:G,34:$,44:[1,181],47:W,55:K,58:161,60:102,61:Z,62:J,63:Q,64:tt,65:et,66:nt,67:rt,69:93,70:it,76:at,77:ot,80:st,81:ut,82:ct,84:ft,85:lt,86:ht,87:dt,88:99,91:pt,92:gt,93:yt,94:bt,95:vt,96:mt},{10:z,12:Y,13:V,26:H,30:G,34:$,46:[1,182],47:W,55:K,58:161,60:102,61:Z,62:J,63:Q,64:tt,65:et,66:nt,67:rt,69:93,70:it,76:at,77:ot,80:st,81:ut,82:ct,84:ft,85:lt,86:ht,87:dt,88:99,91:pt,92:gt,93:yt,94:bt,95:vt,96:mt},{10:z,12:Y,13:V,26:H,27:183,30:G,34:$,47:W,55:K,58:91,59:X,60:102,61:Z,62:J,63:Q,64:tt,65:et,66:nt,67:rt,69:93,70:it,76:at,77:ot,80:st,81:ut,82:ct,84:ft,85:lt,86:ht,87:dt,88:99,91:pt,92:gt,93:yt,94:bt,95:vt,96:mt},{10:z,12:Y,13:V,26:H,29:[1,184],30:G,34:$,47:W,55:K,58:161,60:102,61:Z,62:J,63:Q,64:tt,65:et,66:nt,67:rt,69:93,70:it,76:at,77:ot,80:st,81:ut,82:ct,84:ft,85:lt,86:ht,87:dt,88:99,91:pt,92:gt,93:yt,94:bt,95:vt,96:mt},{10:z,12:Y,13:V,26:H,30:G,34:$,47:W,49:[1,185],51:[1,186],55:K,58:161,60:102,61:Z,62:J,63:Q,64:tt,65:et,66:nt,67:rt,69:93,70:it,76:at,77:ot,80:st,81:ut,82:ct,84:ft,85:lt,86:ht,87:dt,88:99,91:pt,92:gt,93:yt,94:bt,95:vt,96:mt},{10:z,12:Y,13:V,26:H,30:G,34:$,47:W,49:[1,188],51:[1,187],55:K,58:161,60:102,61:Z,62:J,63:Q,64:tt,65:et,66:nt,67:rt,69:93,70:it,76:at,77:ot,80:st,81:ut,82:ct,84:ft,85:lt,86:ht,87:dt,88:99,91:pt,92:gt,93:yt,94:bt,95:vt,96:mt},t(R,[2,39],{34:wt}),t(U,[2,61]),t(U,[2,60]),{10:z,12:Y,13:V,26:H,30:G,34:$,47:W,55:K,57:[1,189],58:161,60:102,61:Z,62:J,63:Q,64:tt,65:et,66:nt,67:rt,69:93,70:it,76:at,77:ot,80:st,81:ut,82:ct,84:ft,85:lt,86:ht,87:dt,88:99,91:pt,92:gt,93:yt,94:bt,95:vt,96:mt},t(U,[2,63]),t(At,[2,67]),{10:z,12:Y,13:V,26:H,27:190,30:G,34:$,47:W,55:K,58:91,59:X,60:102,61:Z,62:J,63:Q,64:tt,65:et,66:nt,67:rt,69:93,70:it,76:at,77:ot,80:st,81:ut,82:ct,84:ft,85:lt,86:ht,87:dt,88:99,91:pt,92:gt,93:yt,94:bt,95:vt,96:mt},t(_t,a,{5:191}),t(I,[2,34]),{33:192,34:l,36:30,66:b,76:v,77:m,80:_,81:w,82:x,84:k,85:E,89:31,91:A,92:S,93:M,94:T,95:D,96:C},{10:Tt,61:Dt,71:193,73:Ct,76:Nt,78:194,79:195,80:It,81:Lt,82:Bt,83:Ot,84:Rt,85:Pt,86:Ft},t(St,[2,127]),{10:Tt,61:Dt,71:207,73:Ct,76:Nt,78:194,79:195,80:It,81:Lt,82:Bt,83:Ot,84:Rt,85:Pt,86:Ft},{10:Tt,61:Dt,71:208,73:Ct,75:[1,209],76:Nt,78:194,79:195,80:It,81:Lt,82:Bt,83:Ot,84:Rt,85:Pt,86:Ft},{10:Tt,61:Dt,71:210,73:Ct,75:[1,211],76:Nt,78:194,79:195,80:It,81:Lt,82:Bt,83:Ot,84:Rt,85:Pt,86:Ft},{76:[1,212]},{10:Tt,61:Dt,71:213,73:Ct,76:Nt,78:194,79:195,80:It,81:Lt,82:Bt,83:Ot,84:Rt,85:Pt,86:Ft},{10:Tt,61:Dt,71:214,73:Ct,76:Nt,78:194,79:195,80:It,81:Lt,82:Bt,83:Ot,84:Rt,85:Pt,86:Ft},{13:xt,34:$,66:kt,72:215,76:at,77:ot,80:st,81:ut,82:Et,84:ft,85:lt,88:134,90:132,91:pt,92:gt,93:yt,94:bt,95:vt,96:mt},{13:xt,34:$,59:[1,217],66:kt,72:216,76:at,77:ot,80:st,81:ut,82:Et,84:ft,85:lt,88:134,90:132,91:pt,92:gt,93:yt,94:bt,95:vt,96:mt},t(F,[2,45]),{10:z,12:Y,13:V,26:H,30:G,34:$,38:[1,218],47:W,55:K,58:161,60:102,61:Z,62:J,63:Q,64:tt,65:et,66:nt,67:rt,69:93,70:it,76:at,77:ot,80:st,81:ut,82:ct,84:ft,85:lt,86:ht,87:dt,88:99,91:pt,92:gt,93:yt,94:bt,95:vt,96:mt},t(F,[2,50]),t(F,[2,47]),t(F,[2,48]),t(F,[2,49]),t(F,[2,51]),{10:z,12:Y,13:V,26:H,30:G,34:$,46:[1,219],47:W,55:K,58:161,60:102,61:Z,62:J,63:Q,64:tt,65:et,66:nt,67:rt,69:93,70:it,76:at,77:ot,80:st,81:ut,82:ct,84:ft,85:lt,86:ht,87:dt,88:99,91:pt,92:gt,93:yt,94:bt,95:vt,96:mt},t(F,[2,53]),t(F,[2,54]),t(F,[2,56]),t(F,[2,55]),t(F,[2,57]),t([10,34,66,76,77,80,81,82,84,85,91,92,93,94,95,96],[2,65]),{10:z,12:Y,13:V,26:H,29:[1,220],30:G,34:$,47:W,55:K,58:161,60:102,61:Z,62:J,63:Q,64:tt,65:et,66:nt,67:rt,69:93,70:it,76:at,77:ot,80:st,81:ut,82:ct,84:ft,85:lt,86:ht,87:dt,88:99,91:pt,92:gt,93:yt,94:bt,95:vt,96:mt},{6:10,7:11,8:o,9:s,10:u,11:c,19:16,21:17,22:18,23:19,24:20,25:21,26:f,30:[1,221],32:23,33:29,34:l,36:30,61:h,62:d,63:p,64:g,65:y,66:b,76:v,77:m,80:_,81:w,82:x,84:k,85:E,89:31,91:A,92:S,93:M,94:T,95:D,96:C},t(P,[2,43]),t(qt,[2,89],{77:jt}),t(Ut,[2,99],{79:223,10:Tt,61:Dt,73:Ct,76:Nt,80:It,81:Lt,82:Bt,83:Ot,84:Rt,85:Pt,86:Ft}),t(zt,[2,101]),t(zt,[2,103]),t(zt,[2,104]),t(zt,[2,105]),t(zt,[2,106]),t(zt,[2,107]),t(zt,[2,108]),t(zt,[2,109]),t(zt,[2,110]),t(zt,[2,111]),t(zt,[2,112]),t(zt,[2,113]),t(qt,[2,90],{77:jt}),t(qt,[2,91],{77:jt}),{10:[1,224]},t(qt,[2,92],{77:jt}),{10:[1,225]},t(Mt,[2,98]),t(qt,[2,82],{77:jt}),t(qt,[2,83],{77:jt}),t(qt,[2,84],{88:134,90:167,13:xt,34:$,66:kt,76:at,77:ot,80:st,81:ut,82:Et,84:ft,85:lt,91:pt,92:gt,93:yt,94:bt,95:vt,96:mt}),t(qt,[2,85],{88:134,90:167,10:[1,226],13:xt,34:$,66:kt,76:at,77:ot,80:st,81:ut,82:Et,84:ft,85:lt,91:pt,92:gt,93:yt,94:bt,95:vt,96:mt}),t(qt,[2,87],{10:[1,227]}),{38:[1,228]},{46:[1,229]},{8:L,9:B,11:O,20:230},t(I,[2,33]),{10:Tt,61:Dt,73:Ct,76:Nt,78:231,79:195,80:It,81:Lt,82:Bt,83:Ot,84:Rt,85:Pt,86:Ft},t(zt,[2,102]),{13:xt,34:$,66:kt,72:232,76:at,77:ot,80:st,81:ut,82:Et,84:ft,85:lt,88:134,90:132,91:pt,92:gt,93:yt,94:bt,95:vt,96:mt},{13:xt,34:$,66:kt,72:233,76:at,77:ot,80:st,81:ut,82:Et,84:ft,85:lt,88:134,90:132,91:pt,92:gt,93:yt,94:bt,95:vt,96:mt},{59:[1,234]},{59:[1,235]},t(F,[2,46]),t(F,[2,52]),t(_t,a,{5:236}),t(Ut,[2,100],{79:223,10:Tt,61:Dt,73:Ct,76:Nt,80:It,81:Lt,82:Bt,83:Ot,84:Rt,85:Pt,86:Ft}),t(qt,[2,95],{88:134,90:167,10:[1,237],13:xt,34:$,66:kt,76:at,77:ot,80:st,81:ut,82:Et,84:ft,85:lt,91:pt,92:gt,93:yt,94:bt,95:vt,96:mt}),t(qt,[2,96],{88:134,90:167,10:[1,238],13:xt,34:$,66:kt,76:at,77:ot,80:st,81:ut,82:Et,84:ft,85:lt,91:pt,92:gt,93:yt,94:bt,95:vt,96:mt}),t(qt,[2,86]),t(qt,[2,88]),{6:10,7:11,8:o,9:s,10:u,11:c,19:16,21:17,22:18,23:19,24:20,25:21,26:f,30:[1,239],32:23,33:29,34:l,36:30,61:h,62:d,63:p,64:g,65:y,66:b,76:v,77:m,80:_,81:w,82:x,84:k,85:E,89:31,91:A,92:S,93:M,94:T,95:D,96:C},{10:Tt,61:Dt,71:240,73:Ct,76:Nt,78:194,79:195,80:It,81:Lt,82:Bt,83:Ot,84:Rt,85:Pt,86:Ft},{10:Tt,61:Dt,71:241,73:Ct,76:Nt,78:194,79:195,80:It,81:Lt,82:Bt,83:Ot,84:Rt,85:Pt,86:Ft},t(I,[2,32]),t(qt,[2,93],{77:jt}),t(qt,[2,94],{77:jt})],defaultActions:{},parseError:function(t,e){if(!e.recoverable){var n=new Error(t);throw n.hash=e,n}this.trace(t)},parse:function(t){var e=this,n=[0],r=[],i=[null],a=[],o=this.table,s="",u=0,c=0,f=0,l=2,h=1,d=a.slice.call(arguments,1),p=Object.create(this.lexer),g={yy:{}};for(var y in this.yy)Object.prototype.hasOwnProperty.call(this.yy,y)&&(g.yy[y]=this.yy[y]);p.setInput(t,g.yy),g.yy.lexer=p,g.yy.parser=this,void 0===p.yylloc&&(p.yylloc={});var b=p.yylloc;a.push(b);var v=p.options&&p.options.ranges;function m(){var t;return"number"!=typeof(t=r.pop()||p.lex()||h)&&(t instanceof Array&&(t=(r=t).pop()),t=e.symbols_[t]||t),t}"function"==typeof g.yy.parseError?this.parseError=g.yy.parseError:this.parseError=Object.getPrototypeOf(this).parseError;for(var _,w,x,k,E,A,S,M,T,D={};;){if(x=n[n.length-1],this.defaultActions[x]?k=this.defaultActions[x]:(null==_&&(_=m()),k=o[x]&&o[x][_]),void 0===k||!k.length||!k[0]){var C="";for(A in T=[],o[x])this.terminals_[A]&&A>l&&T.push("'"+this.terminals_[A]+"'");C=p.showPosition?"Parse error on line "+(u+1)+":\n"+p.showPosition()+"\nExpecting "+T.join(", ")+", got '"+(this.terminals_[_]||_)+"'":"Parse error on line "+(u+1)+": Unexpected "+(_==h?"end of input":"'"+(this.terminals_[_]||_)+"'"),this.parseError(C,{text:p.match,token:this.terminals_[_]||_,line:p.yylineno,loc:b,expected:T})}if(k[0]instanceof Array&&k.length>1)throw new Error("Parse Error: multiple actions possible at state: "+x+", token: "+_);switch(k[0]){case 1:n.push(_),i.push(p.yytext),a.push(p.yylloc),n.push(k[1]),_=null,w?(_=w,w=null):(c=p.yyleng,s=p.yytext,u=p.yylineno,b=p.yylloc,f>0&&f--);break;case 2:if(S=this.productions_[k[1]][1],D.$=i[i.length-S],D._$={first_line:a[a.length-(S||1)].first_line,last_line:a[a.length-1].last_line,first_column:a[a.length-(S||1)].first_column,last_column:a[a.length-1].last_column},v&&(D._$.range=[a[a.length-(S||1)].range[0],a[a.length-1].range[1]]),void 0!==(E=this.performAction.apply(D,[s,c,u,g.yy,k[1],i,a].concat(d))))return E;S&&(n=n.slice(0,-1*S*2),i=i.slice(0,-1*S),a=a.slice(0,-1*S)),n.push(this.productions_[k[1]][0]),i.push(D.$),a.push(D._$),M=o[n[n.length-2]][n[n.length-1]],n.push(M);break;case 3:return!0}}return!0}},Vt={EOF:1,parseError:function(t,e){if(!this.yy.parser)throw new Error(t);this.yy.parser.parseError(t,e)},setInput:function(t,e){return this.yy=e||this.yy||{},this._input=t,this._more=this._backtrack=this.done=!1,this.yylineno=this.yyleng=0,this.yytext=this.matched=this.match="",this.conditionStack=["INITIAL"],this.yylloc={first_line:1,first_column:0,last_line:1,last_column:0},this.options.ranges&&(this.yylloc.range=[0,0]),this.offset=0,this},input:function(){var t=this._input[0];return this.yytext+=t,this.yyleng++,this.offset++,this.match+=t,this.matched+=t,t.match(/(?:\r\n?|\n).*/g)?(this.yylineno++,this.yylloc.last_line++):this.yylloc.last_column++,this.options.ranges&&this.yylloc.range[1]++,this._input=this._input.slice(1),t},unput:function(t){var e=t.length,n=t.split(/(?:\r\n?|\n)/g);this._input=t+this._input,this.yytext=this.yytext.substr(0,this.yytext.length-e),this.offset-=e;var r=this.match.split(/(?:\r\n?|\n)/g);this.match=this.match.substr(0,this.match.length-1),this.matched=this.matched.substr(0,this.matched.length-1),n.length-1&&(this.yylineno-=n.length-1);var i=this.yylloc.range;return this.yylloc={first_line:this.yylloc.first_line,last_line:this.yylineno+1,first_column:this.yylloc.first_column,last_column:n?(n.length===r.length?this.yylloc.first_column:0)+r[r.length-n.length].length-n[0].length:this.yylloc.first_column-e},this.options.ranges&&(this.yylloc.range=[i[0],i[0]+this.yyleng-e]),this.yyleng=this.yytext.length,this},more:function(){return this._more=!0,this},reject:function(){return this.options.backtrack_lexer?(this._backtrack=!0,this):this.parseError("Lexical error on line "+(this.yylineno+1)+". You can only invoke reject() in the lexer when the lexer is of the backtracking persuasion (options.backtrack_lexer = true).\n"+this.showPosition(),{text:"",token:null,line:this.yylineno})},less:function(t){this.unput(this.match.slice(t))},pastInput:function(){var t=this.matched.substr(0,this.matched.length-this.match.length);return(t.length>20?"...":"")+t.substr(-20).replace(/\n/g,"")},upcomingInput:function(){var t=this.match;return t.length<20&&(t+=this._input.substr(0,20-t.length)),(t.substr(0,20)+(t.length>20?"...":"")).replace(/\n/g,"")},showPosition:function(){var t=this.pastInput(),e=new Array(t.length+1).join("-");return t+this.upcomingInput()+"\n"+e+"^"},test_match:function(t,e){var n,r,i;if(this.options.backtrack_lexer&&(i={yylineno:this.yylineno,yylloc:{first_line:this.yylloc.first_line,last_line:this.last_line,first_column:this.yylloc.first_column,last_column:this.yylloc.last_column},yytext:this.yytext,match:this.match,matches:this.matches,matched:this.matched,yyleng:this.yyleng,offset:this.offset,_more:this._more,_input:this._input,yy:this.yy,conditionStack:this.conditionStack.slice(0),done:this.done},this.options.ranges&&(i.yylloc.range=this.yylloc.range.slice(0))),(r=t[0].match(/(?:\r\n?|\n).*/g))&&(this.yylineno+=r.length),this.yylloc={first_line:this.yylloc.last_line,last_line:this.yylineno+1,first_column:this.yylloc.last_column,last_column:r?r[r.length-1].length-r[r.length-1].match(/\r?\n?/)[0].length:this.yylloc.last_column+t[0].length},this.yytext+=t[0],this.match+=t[0],this.matches=t,this.yyleng=this.yytext.length,this.options.ranges&&(this.yylloc.range=[this.offset,this.offset+=this.yyleng]),this._more=!1,this._backtrack=!1,this._input=this._input.slice(t[0].length),this.matched+=t[0],n=this.performAction.call(this,this.yy,this,e,this.conditionStack[this.conditionStack.length-1]),this.done&&this._input&&(this.done=!1),n)return n;if(this._backtrack){for(var a in i)this[a]=i[a];return!1}return!1},next:function(){if(this.done)return this.EOF;var t,e,n,r;this._input||(this.done=!0),this._more||(this.yytext="",this.match="");for(var i=this._currentRules(),a=0;a<i.length;a++)if((n=this._input.match(this.rules[i[a]]))&&(!e||n[0].length>e[0].length)){if(e=n,r=a,this.options.backtrack_lexer){if(!1!==(t=this.test_match(n,i[a])))return t;if(this._backtrack){e=!1;continue}return!1}if(!this.options.flex)break}return e?!1!==(t=this.test_match(e,i[r]))&&t:""===this._input?this.EOF:this.parseError("Lexical error on line "+(this.yylineno+1)+". Unrecognized text.\n"+this.showPosition(),{text:"",token:null,line:this.yylineno})},lex:function(){var t=this.next();return t||this.lex()},begin:function(t){this.conditionStack.push(t)},popState:function(){return this.conditionStack.length-1>0?this.conditionStack.pop():this.conditionStack[0]},_currentRules:function(){return this.conditionStack.length&&this.conditionStack[this.conditionStack.length-1]?this.conditions[this.conditionStack[this.conditionStack.length-1]].rules:this.conditions.INITIAL.rules},topState:function(t){return(t=this.conditionStack.length-1-Math.abs(t||0))>=0?this.conditionStack[t]:"INITIAL"},pushState:function(t){this.begin(t)},stateStackSize:function(){return this.conditionStack.length},options:{},performAction:function(t,e,n,r){switch(n){case 0:break;case 1:this.begin("string");break;case 2:this.popState();break;case 3:return"STR";case 4:return 61;case 5:return 70;case 6:return 62;case 7:return 75;case 8:return 63;case 9:return 64;case 10:return 65;case 11:return t.lex.firstGraph()&&this.begin("dir"),12;case 12:return 26;case 13:return 30;case 14:case 15:case 16:case 17:case 18:case 19:case 20:case 21:case 22:case 23:return this.popState(),13;case 24:return 76;case 25:return 84;case 26:return 35;case 27:return 81;case 28:return 34;case 29:return 8;case 30:return 77;case 31:return 95;case 32:case 33:case 34:case 35:case 36:case 37:case 38:case 39:case 40:case 41:case 42:case 43:case 44:case 45:case 46:case 47:case 48:case 49:case 50:case 51:case 52:case 53:case 54:case 55:case 56:case 57:case 58:case 59:return 56;case 60:case 61:case 62:case 63:case 64:case 65:case 66:case 67:case 68:case 69:case 70:case 71:return 55;case 72:return 39;case 73:return 40;case 74:return 41;case 75:return 42;case 76:return 43;case 77:return 44;case 78:return 82;case 79:return 85;case 80:return 96;case 81:return 93;case 82:return 86;case 83:case 84:return 94;case 85:return 87;case 86:return 47;case 87:return 67;case 88:return"SEP";case 89:return 66;case 90:return 80;case 91:return 49;case 92:return 48;case 93:return 51;case 94:return 50;case 95:return 91;case 96:return 92;case 97:return 57;case 98:return 37;case 99:return 38;case 100:return 28;case 101:return 29;case 102:return 45;case 103:return 46;case 104:return 102;case 105:return 9;case 106:return 10;case 107:return 11}},rules:[/^(?:%%[^\n]*\n*)/,/^(?:["])/,/^(?:["])/,/^(?:[^"]*)/,/^(?:style\b)/,/^(?:default\b)/,/^(?:linkStyle\b)/,/^(?:interpolate\b)/,/^(?:classDef\b)/,/^(?:class\b)/,/^(?:click\b)/,/^(?:graph\b)/,/^(?:subgraph\b)/,/^(?:end\b\s*)/,/^(?:\s*LR\b)/,/^(?:\s*RL\b)/,/^(?:\s*TB\b)/,/^(?:\s*BT\b)/,/^(?:\s*TD\b)/,/^(?:\s*BR\b)/,/^(?:\s*<)/,/^(?:\s*>)/,/^(?:\s*\^)/,/^(?:\s*v\b)/,/^(?:[0-9]+)/,/^(?:#)/,/^(?::::)/,/^(?::)/,/^(?:&)/,/^(?:;)/,/^(?:,)/,/^(?:\*)/,/^(?:\s*--[x]\s*)/,/^(?:\s*-->\s*)/,/^(?:\s*<-->\s*)/,/^(?:\s*[x]--[x]\s*)/,/^(?:\s*[o]--[o]\s*)/,/^(?:\s*[o]\.-[o]\s*)/,/^(?:\s*<==>\s*)/,/^(?:\s*[o]==[o]\s*)/,/^(?:\s*[x]==[x]\s*)/,/^(?:\s*[x].-[x]\s*)/,/^(?:\s*[x]-\.-[x]\s*)/,/^(?:\s*<\.->\s*)/,/^(?:\s*<-\.->\s*)/,/^(?:\s*[o]-\.-[o]\s*)/,/^(?:\s*--[o]\s*)/,/^(?:\s*---\s*)/,/^(?:\s*-\.-[x]\s*)/,/^(?:\s*-\.->\s*)/,/^(?:\s*-\.-[o]\s*)/,/^(?:\s*-\.-\s*)/,/^(?:\s*.-[x]\s*)/,/^(?:\s*\.->\s*)/,/^(?:\s*\.-[o]\s*)/,/^(?:\s*\.-\s*)/,/^(?:\s*==[x]\s*)/,/^(?:\s*==>\s*)/,/^(?:\s*==[o]\s*)/,/^(?:\s*==[\=]\s*)/,/^(?:\s*<--\s*)/,/^(?:\s*[x]--\s*)/,/^(?:\s*[o]--\s*)/,/^(?:\s*<-\.\s*)/,/^(?:\s*[x]-\.\s*)/,/^(?:\s*[o]-\.\s*)/,/^(?:\s*<==\s*)/,/^(?:\s*[x]==\s*)/,/^(?:\s*[o]==\s*)/,/^(?:\s*--\s*)/,/^(?:\s*-\.\s*)/,/^(?:\s*==\s*)/,/^(?:\(-)/,/^(?:-\))/,/^(?:\(\[)/,/^(?:\]\))/,/^(?:\[\()/,/^(?:\)\])/,/^(?:-)/,/^(?:\.)/,/^(?:[\_])/,/^(?:\+)/,/^(?:%)/,/^(?:=)/,/^(?:=)/,/^(?:<)/,/^(?:>)/,/^(?:\^)/,/^(?:\\\|)/,/^(?:v\b)/,/^(?:[A-Za-z]+)/,/^(?:\\\])/,/^(?:\[\/)/,/^(?:\/\])/,/^(?:\[\\)/,/^(?:[!"#$%&'*+,-.`?\\_/])/,/^(?:[\u00AA\u00B5\u00BA\u00C0-\u00D6\u00D8-\u00F6]|[\u00F8-\u02C1\u02C6-\u02D1\u02E0-\u02E4\u02EC\u02EE\u0370-\u0374\u0376\u0377]|[\u037A-\u037D\u0386\u0388-\u038A\u038C\u038E-\u03A1\u03A3-\u03F5]|[\u03F7-\u0481\u048A-\u0527\u0531-\u0556\u0559\u0561-\u0587\u05D0-\u05EA]|[\u05F0-\u05F2\u0620-\u064A\u066E\u066F\u0671-\u06D3\u06D5\u06E5\u06E6\u06EE]|[\u06EF\u06FA-\u06FC\u06FF\u0710\u0712-\u072F\u074D-\u07A5\u07B1\u07CA-\u07EA]|[\u07F4\u07F5\u07FA\u0800-\u0815\u081A\u0824\u0828\u0840-\u0858\u08A0]|[\u08A2-\u08AC\u0904-\u0939\u093D\u0950\u0958-\u0961\u0971-\u0977]|[\u0979-\u097F\u0985-\u098C\u098F\u0990\u0993-\u09A8\u09AA-\u09B0\u09B2]|[\u09B6-\u09B9\u09BD\u09CE\u09DC\u09DD\u09DF-\u09E1\u09F0\u09F1\u0A05-\u0A0A]|[\u0A0F\u0A10\u0A13-\u0A28\u0A2A-\u0A30\u0A32\u0A33\u0A35\u0A36\u0A38\u0A39]|[\u0A59-\u0A5C\u0A5E\u0A72-\u0A74\u0A85-\u0A8D\u0A8F-\u0A91\u0A93-\u0AA8]|[\u0AAA-\u0AB0\u0AB2\u0AB3\u0AB5-\u0AB9\u0ABD\u0AD0\u0AE0\u0AE1\u0B05-\u0B0C]|[\u0B0F\u0B10\u0B13-\u0B28\u0B2A-\u0B30\u0B32\u0B33\u0B35-\u0B39\u0B3D\u0B5C]|[\u0B5D\u0B5F-\u0B61\u0B71\u0B83\u0B85-\u0B8A\u0B8E-\u0B90\u0B92-\u0B95\u0B99]|[\u0B9A\u0B9C\u0B9E\u0B9F\u0BA3\u0BA4\u0BA8-\u0BAA\u0BAE-\u0BB9\u0BD0]|[\u0C05-\u0C0C\u0C0E-\u0C10\u0C12-\u0C28\u0C2A-\u0C33\u0C35-\u0C39\u0C3D]|[\u0C58\u0C59\u0C60\u0C61\u0C85-\u0C8C\u0C8E-\u0C90\u0C92-\u0CA8\u0CAA-\u0CB3]|[\u0CB5-\u0CB9\u0CBD\u0CDE\u0CE0\u0CE1\u0CF1\u0CF2\u0D05-\u0D0C\u0D0E-\u0D10]|[\u0D12-\u0D3A\u0D3D\u0D4E\u0D60\u0D61\u0D7A-\u0D7F\u0D85-\u0D96\u0D9A-\u0DB1]|[\u0DB3-\u0DBB\u0DBD\u0DC0-\u0DC6\u0E01-\u0E30\u0E32\u0E33\u0E40-\u0E46\u0E81]|[\u0E82\u0E84\u0E87\u0E88\u0E8A\u0E8D\u0E94-\u0E97\u0E99-\u0E9F\u0EA1-\u0EA3]|[\u0EA5\u0EA7\u0EAA\u0EAB\u0EAD-\u0EB0\u0EB2\u0EB3\u0EBD\u0EC0-\u0EC4\u0EC6]|[\u0EDC-\u0EDF\u0F00\u0F40-\u0F47\u0F49-\u0F6C\u0F88-\u0F8C\u1000-\u102A]|[\u103F\u1050-\u1055\u105A-\u105D\u1061\u1065\u1066\u106E-\u1070\u1075-\u1081]|[\u108E\u10A0-\u10C5\u10C7\u10CD\u10D0-\u10FA\u10FC-\u1248\u124A-\u124D]|[\u1250-\u1256\u1258\u125A-\u125D\u1260-\u1288\u128A-\u128D\u1290-\u12B0]|[\u12B2-\u12B5\u12B8-\u12BE\u12C0\u12C2-\u12C5\u12C8-\u12D6\u12D8-\u1310]|[\u1312-\u1315\u1318-\u135A\u1380-\u138F\u13A0-\u13F4\u1401-\u166C]|[\u166F-\u167F\u1681-\u169A\u16A0-\u16EA\u1700-\u170C\u170E-\u1711]|[\u1720-\u1731\u1740-\u1751\u1760-\u176C\u176E-\u1770\u1780-\u17B3\u17D7]|[\u17DC\u1820-\u1877\u1880-\u18A8\u18AA\u18B0-\u18F5\u1900-\u191C]|[\u1950-\u196D\u1970-\u1974\u1980-\u19AB\u19C1-\u19C7\u1A00-\u1A16]|[\u1A20-\u1A54\u1AA7\u1B05-\u1B33\u1B45-\u1B4B\u1B83-\u1BA0\u1BAE\u1BAF]|[\u1BBA-\u1BE5\u1C00-\u1C23\u1C4D-\u1C4F\u1C5A-\u1C7D\u1CE9-\u1CEC]|[\u1CEE-\u1CF1\u1CF5\u1CF6\u1D00-\u1DBF\u1E00-\u1F15\u1F18-\u1F1D]|[\u1F20-\u1F45\u1F48-\u1F4D\u1F50-\u1F57\u1F59\u1F5B\u1F5D\u1F5F-\u1F7D]|[\u1F80-\u1FB4\u1FB6-\u1FBC\u1FBE\u1FC2-\u1FC4\u1FC6-\u1FCC\u1FD0-\u1FD3]|[\u1FD6-\u1FDB\u1FE0-\u1FEC\u1FF2-\u1FF4\u1FF6-\u1FFC\u2071\u207F]|[\u2090-\u209C\u2102\u2107\u210A-\u2113\u2115\u2119-\u211D\u2124\u2126\u2128]|[\u212A-\u212D\u212F-\u2139\u213C-\u213F\u2145-\u2149\u214E\u2183\u2184]|[\u2C00-\u2C2E\u2C30-\u2C5E\u2C60-\u2CE4\u2CEB-\u2CEE\u2CF2\u2CF3]|[\u2D00-\u2D25\u2D27\u2D2D\u2D30-\u2D67\u2D6F\u2D80-\u2D96\u2DA0-\u2DA6]|[\u2DA8-\u2DAE\u2DB0-\u2DB6\u2DB8-\u2DBE\u2DC0-\u2DC6\u2DC8-\u2DCE]|[\u2DD0-\u2DD6\u2DD8-\u2DDE\u2E2F\u3005\u3006\u3031-\u3035\u303B\u303C]|[\u3041-\u3096\u309D-\u309F\u30A1-\u30FA\u30FC-\u30FF\u3105-\u312D]|[\u3131-\u318E\u31A0-\u31BA\u31F0-\u31FF\u3400-\u4DB5\u4E00-\u9FCC]|[\uA000-\uA48C\uA4D0-\uA4FD\uA500-\uA60C\uA610-\uA61F\uA62A\uA62B]|[\uA640-\uA66E\uA67F-\uA697\uA6A0-\uA6E5\uA717-\uA71F\uA722-\uA788]|[\uA78B-\uA78E\uA790-\uA793\uA7A0-\uA7AA\uA7F8-\uA801\uA803-\uA805]|[\uA807-\uA80A\uA80C-\uA822\uA840-\uA873\uA882-\uA8B3\uA8F2-\uA8F7\uA8FB]|[\uA90A-\uA925\uA930-\uA946\uA960-\uA97C\uA984-\uA9B2\uA9CF\uAA00-\uAA28]|[\uAA40-\uAA42\uAA44-\uAA4B\uAA60-\uAA76\uAA7A\uAA80-\uAAAF\uAAB1\uAAB5]|[\uAAB6\uAAB9-\uAABD\uAAC0\uAAC2\uAADB-\uAADD\uAAE0-\uAAEA\uAAF2-\uAAF4]|[\uAB01-\uAB06\uAB09-\uAB0E\uAB11-\uAB16\uAB20-\uAB26\uAB28-\uAB2E]|[\uABC0-\uABE2\uAC00-\uD7A3\uD7B0-\uD7C6\uD7CB-\uD7FB\uF900-\uFA6D]|[\uFA70-\uFAD9\uFB00-\uFB06\uFB13-\uFB17\uFB1D\uFB1F-\uFB28\uFB2A-\uFB36]|[\uFB38-\uFB3C\uFB3E\uFB40\uFB41\uFB43\uFB44\uFB46-\uFBB1\uFBD3-\uFD3D]|[\uFD50-\uFD8F\uFD92-\uFDC7\uFDF0-\uFDFB\uFE70-\uFE74\uFE76-\uFEFC]|[\uFF21-\uFF3A\uFF41-\uFF5A\uFF66-\uFFBE\uFFC2-\uFFC7\uFFCA-\uFFCF]|[\uFFD2-\uFFD7\uFFDA-\uFFDC])/,/^(?:\|)/,/^(?:\()/,/^(?:\))/,/^(?:\[)/,/^(?:\])/,/^(?:\{)/,/^(?:\})/,/^(?:")/,/^(?:(\r|\n|\r\n)+)/,/^(?:\s)/,/^(?:$)/],conditions:{vertex:{rules:[],inclusive:!1},dir:{rules:[14,15,16,17,18,19,20,21,22,23],inclusive:!1},string:{rules:[2,3],inclusive:!1},INITIAL:{rules:[0,1,4,5,6,7,8,9,10,11,12,13,24,25,26,27,28,29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48,49,50,51,52,53,54,55,56,57,58,59,60,61,62,63,64,65,66,67,68,69,70,71,72,73,74,75,76,77,78,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,94,95,96,97,98,99,100,101,102,103,104,105,106,107],inclusive:!0}}};function Ht(){this.yy={}}return Yt.lexer=Vt,Ht.prototype=Yt,Yt.Parser=Ht,new Ht}();e.parser=i,e.Parser=i.Parser,e.parse=function(){return i.parse.apply(i,arguments)},e.main=function(r){r[1]||(console.log("Usage: "+r[0]+" FILE"),t.exit(1));var i=n(28).readFileSync(n(29).normalize(r[1]),"utf8");return e.parser.parse(i)},n.c[n.s]===r&&e.main(t.argv.slice(1))}).call(this,n(7),n(9)(t))},function(t,e,n){var r=n(62),i=n(243),a=n(244),o=n(245),s=n(246),u=n(247);function c(t){var e=this.__data__=new r(t);this.size=e.size}c.prototype.clear=i,c.prototype.delete=a,c.prototype.get=o,c.prototype.has=s,c.prototype.set=u,t.exports=c},function(t,e,n){var r=n(238),i=n(239),a=n(240),o=n(241),s=n(242);function u(t){var e=-1,n=null==t?0:t.length;for(this.clear();++e<n;){var r=t[e];this.set(r[0],r[1])}}u.prototype.clear=r,u.prototype.delete=i,u.prototype.get=a,u.prototype.has=o,u.prototype.set=s,t.exports=u},function(t,e,n){var r=n(36);t.exports=function(t,e){for(var n=t.length;n--;)if(r(t[n][0],e))return n;return-1}},function(t,e,n){var r=n(32)(Object,"create");t.exports=r},function(t,e,n){var r=n(262);t.exports=function(t,e){var n=t.__data__;return r(e)?n["string"==typeof e?"string":"hash"]:n.map}},function(t,e,n){var r=n(67),i=n(36),a=Object.prototype.hasOwnProperty;t.exports=function(t,e,n){var o=t[e];a.call(t,e)&&i(o,n)&&(void 0!==n||e in t)||r(t,e,n)}},function(t,e,n){var r=n(133);t.exports=function(t,e,n){"__proto__"==e&&r?r(t,e,{configurable:!0,enumerable:!0,value:n,writable:!0}):t[e]=n}},function(t,e){var n=/^(?:0|[1-9]\d*)$/;t.exports=function(t,e){var r=typeof t;return!!(e=null==e?9007199254740991:e)&&("number"==r||"symbol"!=r&&n.test(t))&&t>-1&&t%1==0&&t<e}},function(t,e){t.exports=function(t){return function(e){return t(e)}}},function(t,e){var n=Object.prototype;t.exports=function(t){var e=t&&t.constructor;return t===("function"==typeof e&&e.prototype||n)}},function(t,e,n){var r=n(135)(Object.getPrototypeOf,Object);t.exports=r},function(t,e,n){var r=n(101),i=n(291)(r);t.exports=i},function(t,e,n){var r=n(6),i=n(105),a=n(305),o=n(157);t.exports=function(t,e){return r(t)?t:i(t,e)?[t]:a(o(t))}},function(t,e){t.exports=function(t,e){for(var n=-1,r=null==t?0:t.length,i=Array(r);++n<r;)i[n]=e(t[n],n,t);return i}},function(t,e,n){var r=n(34),i=n(165),a=n(166);t.exports=function(t,e){return a(i(t,e,r),t+"")}},function(t,e,n){var r=n(36),i=n(23),a=n(68),o=n(14);t.exports=function(t,e,n){if(!o(n))return!1;var s=typeof e;return!!("number"==s?i(n)&&a(e,n.length):"string"==s&&e in n)&&r(n[e],t)}},function(t,e,n){"use strict";var r=n(4);t.exports={longestPath:function(t){var e={};r.forEach(t.sources(),(function n(i){var a=t.node(i);if(r.has(e,i))return a.rank;e[i]=!0;var o=r.min(r.map(t.outEdges(i),(function(e){return n(e.w)-t.edge(e).minlen})));return o!==Number.POSITIVE_INFINITY&&null!=o||(o=0),a.rank=o}))},slack:function(t,e){return t.node(e.w).rank-t.node(e.v).rank-t.edge(e).minlen}}},function(t,e,n){"use strict";(function(e){void 0===e||!e.version||0===e.version.indexOf("v0.")||0===e.version.indexOf("v1.")&&0!==e.version.indexOf("v1.8.")?t.exports={nextTick:function(t,n,r,i){if("function"!=typeof t)throw new TypeError('"callback" argument must be a function');var a,o,s=arguments.length;switch(s){case 0:case 1:return e.nextTick(t);case 2:return e.nextTick((function(){t.call(null,n)}));case 3:return e.nextTick((function(){t.call(null,n,r)}));case 4:return e.nextTick((function(){t.call(null,n,r,i)}));default:for(a=new Array(s-1),o=0;o<a.length;)a[o++]=arguments[o];return e.nextTick((function(){t.apply(null,a)}))}}}:t.exports=e}).call(this,n(7))},function(t,e,n){var r=n(3).Buffer;function i(t){r.isBuffer(t)||(t=r.from(t));for(var e=t.length/4|0,n=new Array(e),i=0;i<e;i++)n[i]=t.readUInt32BE(4*i);return n}function a(t){for(;0<t.length;t++)t[0]=0}function o(t,e,n,r,i){for(var a,o,s,u,c=n[0],f=n[1],l=n[2],h=n[3],d=t[0]^e[0],p=t[1]^e[1],g=t[2]^e[2],y=t[3]^e[3],b=4,v=1;v<i;v++)a=c[d>>>24]^f[p>>>16&255]^l[g>>>8&255]^h[255&y]^e[b++],o=c[p>>>24]^f[g>>>16&255]^l[y>>>8&255]^h[255&d]^e[b++],s=c[g>>>24]^f[y>>>16&255]^l[d>>>8&255]^h[255&p]^e[b++],u=c[y>>>24]^f[d>>>16&255]^l[p>>>8&255]^h[255&g]^e[b++],d=a,p=o,g=s,y=u;return a=(r[d>>>24]<<24|r[p>>>16&255]<<16|r[g>>>8&255]<<8|r[255&y])^e[b++],o=(r[p>>>24]<<24|r[g>>>16&255]<<16|r[y>>>8&255]<<8|r[255&d])^e[b++],s=(r[g>>>24]<<24|r[y>>>16&255]<<16|r[d>>>8&255]<<8|r[255&p])^e[b++],u=(r[y>>>24]<<24|r[d>>>16&255]<<16|r[p>>>8&255]<<8|r[255&g])^e[b++],[a>>>=0,o>>>=0,s>>>=0,u>>>=0]}var s=[0,1,2,4,8,16,32,64,128,27,54],u=function(){for(var t=new Array(256),e=0;e<256;e++)t[e]=e<128?e<<1:e<<1^283;for(var n=[],r=[],i=[[],[],[],[]],a=[[],[],[],[]],o=0,s=0,u=0;u<256;++u){var c=s^s<<1^s<<2^s<<3^s<<4;c=c>>>8^255&c^99,n[o]=c,r[c]=o;var f=t[o],l=t[f],h=t[l],d=257*t[c]^16843008*c;i[0][o]=d<<24|d>>>8,i[1][o]=d<<16|d>>>16,i[2][o]=d<<8|d>>>24,i[3][o]=d,d=16843009*h^65537*l^257*f^16843008*o,a[0][c]=d<<24|d>>>8,a[1][c]=d<<16|d>>>16,a[2][c]=d<<8|d>>>24,a[3][c]=d,0===o?o=s=1:(o=f^t[t[t[h^f]]],s^=t[t[s]])}return{SBOX:n,INV_SBOX:r,SUB_MIX:i,INV_SUB_MIX:a}}();function c(t){this._key=i(t),this._reset()}c.blockSize=16,c.keySize=32,c.prototype.blockSize=c.blockSize,c.prototype.keySize=c.keySize,c.prototype._reset=function(){for(var t=this._key,e=t.length,n=e+6,r=4*(n+1),i=[],a=0;a<e;a++)i[a]=t[a];for(a=e;a<r;a++){var o=i[a-1];a%e==0?(o=o<<8|o>>>24,o=u.SBOX[o>>>24]<<24|u.SBOX[o>>>16&255]<<16|u.SBOX[o>>>8&255]<<8|u.SBOX[255&o],o^=s[a/e|0]<<24):e>6&&a%e==4&&(o=u.SBOX[o>>>24]<<24|u.SBOX[o>>>16&255]<<16|u.SBOX[o>>>8&255]<<8|u.SBOX[255&o]),i[a]=i[a-e]^o}for(var c=[],f=0;f<r;f++){var l=r-f,h=i[l-(f%4?0:4)];c[f]=f<4||l<=4?h:u.INV_SUB_MIX[0][u.SBOX[h>>>24]]^u.INV_SUB_MIX[1][u.SBOX[h>>>16&255]]^u.INV_SUB_MIX[2][u.SBOX[h>>>8&255]]^u.INV_SUB_MIX[3][u.SBOX[255&h]]}this._nRounds=n,this._keySchedule=i,this._invKeySchedule=c},c.prototype.encryptBlockRaw=function(t){return o(t=i(t),this._keySchedule,u.SUB_MIX,u.SBOX,this._nRounds)},c.prototype.encryptBlock=function(t){var e=this.encryptBlockRaw(t),n=r.allocUnsafe(16);return n.writeUInt32BE(e[0],0),n.writeUInt32BE(e[1],4),n.writeUInt32BE(e[2],8),n.writeUInt32BE(e[3],12),n},c.prototype.decryptBlock=function(t){var e=(t=i(t))[1];t[1]=t[3],t[3]=e;var n=o(t,this._invKeySchedule,u.INV_SUB_MIX,u.INV_SBOX,this._nRounds),a=r.allocUnsafe(16);return a.writeUInt32BE(n[0],0),a.writeUInt32BE(n[3],4),a.writeUInt32BE(n[2],8),a.writeUInt32BE(n[1],12),a},c.prototype.scrub=function(){a(this._keySchedule),a(this._invKeySchedule),a(this._key)},t.exports.AES=c},function(t,e,n){var r=n(3).Buffer,i=n(111);t.exports=function(t,e,n,a){if(r.isBuffer(t)||(t=r.from(t,"binary")),e&&(r.isBuffer(e)||(e=r.from(e,"binary")),8!==e.length))throw new RangeError("salt should be Buffer with 8 byte length");for(var o=n/8,s=r.alloc(o),u=r.alloc(a||0),c=r.alloc(0);o>0||a>0;){var f=new i;f.update(c),f.update(t),e&&f.update(e),c=f.digest();var l=0;if(o>0){var h=s.length-o;l=Math.min(o,c.length),c.copy(s,h,0,l),o-=l}if(l<c.length&&a>0){var d=u.length-a,p=Math.min(a,c.length-l);c.copy(u,d,l,l+p),a-=p}}return c.fill(0),{key:s,iv:u}}},function(t,e,n){"use strict";var r=n(5),i=n(17),a=i.getNAF,o=i.getJSF,s=i.assert;function u(t,e){this.type=t,this.p=new r(e.p,16),this.red=e.prime?r.red(e.prime):r.mont(this.p),this.zero=new r(0).toRed(this.red),this.one=new r(1).toRed(this.red),this.two=new r(2).toRed(this.red),this.n=e.n&&new r(e.n,16),this.g=e.g&&this.pointFromJSON(e.g,e.gRed),this._wnafT1=new Array(4),this._wnafT2=new Array(4),this._wnafT3=new Array(4),this._wnafT4=new Array(4),this._bitLength=this.n?this.n.bitLength():0;var n=this.n&&this.p.div(this.n);!n||n.cmpn(100)>0?this.redN=null:(this._maxwellTrick=!0,this.redN=this.n.toRed(this.red))}function c(t,e){this.curve=t,this.type=e,this.precomputed=null}t.exports=u,u.prototype.point=function(){throw new Error("Not implemented")},u.prototype.validate=function(){throw new Error("Not implemented")},u.prototype._fixedNafMul=function(t,e){s(t.precomputed);var n=t._getDoubles(),r=a(e,1,this._bitLength),i=(1<<n.step+1)-(n.step%2==0?2:1);i/=3;for(var o=[],u=0;u<r.length;u+=n.step){var c=0;for(e=u+n.step-1;e>=u;e--)c=(c<<1)+r[e];o.push(c)}for(var f=this.jpoint(null,null,null),l=this.jpoint(null,null,null),h=i;h>0;h--){for(u=0;u<o.length;u++){(c=o[u])===h?l=l.mixedAdd(n.points[u]):c===-h&&(l=l.mixedAdd(n.points[u].neg()))}f=f.add(l)}return f.toP()},u.prototype._wnafMul=function(t,e){var n=4,r=t._getNAFPoints(n);n=r.wnd;for(var i=r.points,o=a(e,n,this._bitLength),u=this.jpoint(null,null,null),c=o.length-1;c>=0;c--){for(e=0;c>=0&&0===o[c];c--)e++;if(c>=0&&e++,u=u.dblp(e),c<0)break;var f=o[c];s(0!==f),u="affine"===t.type?f>0?u.mixedAdd(i[f-1>>1]):u.mixedAdd(i[-f-1>>1].neg()):f>0?u.add(i[f-1>>1]):u.add(i[-f-1>>1].neg())}return"affine"===t.type?u.toP():u},u.prototype._wnafMulAdd=function(t,e,n,r,i){for(var s=this._wnafT1,u=this._wnafT2,c=this._wnafT3,f=0,l=0;l<r;l++){var h=(A=e[l])._getNAFPoints(t);s[l]=h.wnd,u[l]=h.points}for(l=r-1;l>=1;l-=2){var d=l-1,p=l;if(1===s[d]&&1===s[p]){var g=[e[d],null,null,e[p]];0===e[d].y.cmp(e[p].y)?(g[1]=e[d].add(e[p]),g[2]=e[d].toJ().mixedAdd(e[p].neg())):0===e[d].y.cmp(e[p].y.redNeg())?(g[1]=e[d].toJ().mixedAdd(e[p]),g[2]=e[d].add(e[p].neg())):(g[1]=e[d].toJ().mixedAdd(e[p]),g[2]=e[d].toJ().mixedAdd(e[p].neg()));var y=[-3,-1,-5,-7,0,7,5,1,3],b=o(n[d],n[p]);f=Math.max(b[0].length,f),c[d]=new Array(f),c[p]=new Array(f);for(var v=0;v<f;v++){var m=0|b[0][v],_=0|b[1][v];c[d][v]=y[3*(m+1)+(_+1)],c[p][v]=0,u[d]=g}}else c[d]=a(n[d],s[d],this._bitLength),c[p]=a(n[p],s[p],this._bitLength),f=Math.max(c[d].length,f),f=Math.max(c[p].length,f)}var w=this.jpoint(null,null,null),x=this._wnafT4;for(l=f;l>=0;l--){for(var k=0;l>=0;){var E=!0;for(v=0;v<r;v++)x[v]=0|c[v][l],0!==x[v]&&(E=!1);if(!E)break;k++,l--}if(l>=0&&k++,w=w.dblp(k),l<0)break;for(v=0;v<r;v++){var A,S=x[v];0!==S&&(S>0?A=u[v][S-1>>1]:S<0&&(A=u[v][-S-1>>1].neg()),w="affine"===A.type?w.mixedAdd(A):w.add(A))}}for(l=0;l<r;l++)u[l]=null;return i?w:w.toP()},u.BasePoint=c,c.prototype.eq=function(){throw new Error("Not implemented")},c.prototype.validate=function(){return this.curve.validate(this)},u.prototype.decodePoint=function(t,e){t=i.toArray(t,e);var n=this.p.byteLength();if((4===t[0]||6===t[0]||7===t[0])&&t.length-1==2*n)return 6===t[0]?s(t[t.length-1]%2==0):7===t[0]&&s(t[t.length-1]%2==1),this.point(t.slice(1,1+n),t.slice(1+n,1+2*n));if((2===t[0]||3===t[0])&&t.length-1===n)return this.pointFromX(t.slice(1,1+n),3===t[0]);throw new Error("Unknown point format")},c.prototype.encodeCompressed=function(t){return this.encode(t,!0)},c.prototype._encode=function(t){var e=this.curve.p.byteLength(),n=this.getX().toArray("be",e);return t?[this.getY().isEven()?2:3].concat(n):[4].concat(n,this.getY().toArray("be",e))},c.prototype.encode=function(t,e){return i.encode(this._encode(e),t)},c.prototype.precompute=function(t){if(this.precomputed)return this;var e={doubles:null,naf:null,beta:null};return e.naf=this._getNAFPoints(8),e.doubles=this._getDoubles(4,t),e.beta=this._getBeta(),this.precomputed=e,this},c.prototype._hasDoubles=function(t){if(!this.precomputed)return!1;var e=this.precomputed.doubles;return!!e&&e.points.length>=Math.ceil((t.bitLength()+1)/e.step)},c.prototype._getDoubles=function(t,e){if(this.precomputed&&this.precomputed.doubles)return this.precomputed.doubles;for(var n=[this],r=this,i=0;i<e;i+=t){for(var a=0;a<t;a++)r=r.dbl();n.push(r)}return{step:t,points:n}},c.prototype._getNAFPoints=function(t){if(this.precomputed&&this.precomputed.naf)return this.precomputed.naf;for(var e=[this],n=(1<<t)-1,r=1===n?null:this.dbl(),i=1;i<n;i++)e[i]=e[i-1].add(r);return{wnd:t,points:e}},c.prototype._getBeta=function(){return null},c.prototype.dblp=function(t){for(var e=this,n=0;n<t;n++)e=e.dbl();return e}},function(t,e,n){var r=n(481),i=n(492),a=n(493),o=n(121),s=n(202),u=n(3).Buffer;function c(t){var e;"object"!=typeof t||u.isBuffer(t)||(e=t.passphrase,t=t.key),"string"==typeof t&&(t=u.from(t));var n,c,f=a(t,e),l=f.tag,h=f.data;switch(l){case"CERTIFICATE":c=r.certificate.decode(h,"der").tbsCertificate.subjectPublicKeyInfo;case"PUBLIC KEY":switch(c||(c=r.PublicKey.decode(h,"der")),n=c.algorithm.algorithm.join(".")){case"1.2.840.113549.1.1.1":return r.RSAPublicKey.decode(c.subjectPublicKey.data,"der");case"1.2.840.10045.2.1":return c.subjectPrivateKey=c.subjectPublicKey,{type:"ec",data:c};case"1.2.840.10040.4.1":return c.algorithm.params.pub_key=r.DSAparam.decode(c.subjectPublicKey.data,"der"),{type:"dsa",data:c.algorithm.params};default:throw new Error("unknown key id "+n)}throw new Error("unknown key type "+l);case"ENCRYPTED PRIVATE KEY":h=function(t,e){var n=t.algorithm.decrypt.kde.kdeparams.salt,r=parseInt(t.algorithm.decrypt.kde.kdeparams.iters.toString(),10),a=i[t.algorithm.decrypt.cipher.algo.join(".")],c=t.algorithm.decrypt.cipher.iv,f=t.subjectPrivateKey,l=parseInt(a.split("-")[1],10)/8,h=s.pbkdf2Sync(e,n,r,l,"sha1"),d=o.createDecipheriv(a,h,c),p=[];return p.push(d.update(f)),p.push(d.final()),u.concat(p)}(h=r.EncryptedPrivateKey.decode(h,"der"),e);case"PRIVATE KEY":switch(n=(c=r.PrivateKey.decode(h,"der")).algorithm.algorithm.join(".")){case"1.2.840.113549.1.1.1":return r.RSAPrivateKey.decode(c.subjectPrivateKey,"der");case"1.2.840.10045.2.1":return{curve:c.algorithm.curve,privateKey:r.ECPrivateKey.decode(c.subjectPrivateKey,"der").privateKey};case"1.2.840.10040.4.1":return c.algorithm.params.priv_key=r.DSAparam.decode(c.subjectPrivateKey,"der"),{type:"dsa",params:c.algorithm.params};default:throw new Error("unknown key id "+n)}throw new Error("unknown key type "+l);case"RSA PUBLIC KEY":return r.RSAPublicKey.decode(h,"der");case"RSA PRIVATE KEY":return r.RSAPrivateKey.decode(h,"der");case"DSA PRIVATE KEY":return{type:"dsa",params:r.DSAPrivateKey.decode(h,"der")};case"EC PRIVATE KEY":return{curve:(h=r.ECPrivateKey.decode(h,"der")).parameters.value,privateKey:h.privateKey};default:throw new Error("unknown key type "+l)}}t.exports=c,c.signature=r.signature},function(t,e,n){"use strict";t.exports=function(t){var e=[];return e.toString=function(){return this.map((function(e){var n=function(t,e){var n=t[1]||"",r=t[3];if(!r)return n;if(e&&"function"==typeof btoa){var i=(o=r,"/*# sourceMappingURL=data:application/json;charset=utf-8;base64,"+btoa(unescape(encodeURIComponent(JSON.stringify(o))))+" */"),a=r.sources.map((function(t){return"/*# sourceURL="+r.sourceRoot+t+" */"}));return[n].concat(a).concat([i]).join("\n")}var o;return[n].join("\n")}(e,t);return e[2]?"@media "+e[2]+"{"+n+"}":n})).join("")},e.i=function(t,n){"string"==typeof t&&(t=[[null,t,""]]);for(var r={},i=0;i<this.length;i++){var a=this[i][0];null!=a&&(r[a]=!0)}for(i=0;i<t.length;i++){var o=t[i];null!=o[0]&&r[o[0]]||(n&&!o[2]?o[2]=n:n&&(o[2]="("+o[2]+") and ("+n+")"),e.push(o))}},e}},function(t,e,n){"use strict";var r=/^(%20|\s)*(javascript|data)/im,i=/[^\x20-\x7E]/gim,a=/^([^:]+):/gm,o=[".","/"];t.exports={sanitizeUrl:function(t){if(!t)return"about:blank";var e,n,s=t.replace(i,"").trim();return function(t){return o.indexOf(t[0])>-1}(s)?s:(n=s.match(a))?(e=n[0],r.test(e)?"about:blank":s):"about:blank"}}},function(t,e,n){(function(t,r){var i=function(){var t=function(t,e,n,r){for(n=n||{},r=t.length;r--;n[t[r]]=e);return n},e=[2,3],n=[1,7],r=[7,12,15,17,19,20,21],i=[7,11,12,15,17,19,20,21],a=[2,20],o=[1,32],s={trace:function(){},yy:{},symbols_:{error:2,start:3,GG:4,":":5,document:6,EOF:7,DIR:8,options:9,body:10,OPT:11,NL:12,line:13,statement:14,COMMIT:15,commit_arg:16,BRANCH:17,ID:18,CHECKOUT:19,MERGE:20,RESET:21,reset_arg:22,STR:23,HEAD:24,reset_parents:25,CARET:26,$accept:0,$end:1},terminals_:{2:"error",4:"GG",5:":",7:"EOF",8:"DIR",11:"OPT",12:"NL",15:"COMMIT",17:"BRANCH",18:"ID",19:"CHECKOUT",20:"MERGE",21:"RESET",23:"STR",24:"HEAD",26:"CARET"},productions_:[0,[3,4],[3,5],[6,0],[6,2],[9,2],[9,1],[10,0],[10,2],[13,2],[13,1],[14,2],[14,2],[14,2],[14,2],[14,2],[16,0],[16,1],[22,2],[22,2],[25,0],[25,2]],performAction:function(t,e,n,r,i,a,o){var s=a.length-1;switch(i){case 1:return a[s-1];case 2:return r.setDirection(a[s-3]),a[s-1];case 4:r.setOptions(a[s-1]),this.$=a[s];break;case 5:a[s-1]+=a[s],this.$=a[s-1];break;case 7:this.$=[];break;case 8:a[s-1].push(a[s]),this.$=a[s-1];break;case 9:this.$=a[s-1];break;case 11:r.commit(a[s]);break;case 12:r.branch(a[s]);break;case 13:r.checkout(a[s]);break;case 14:r.merge(a[s]);break;case 15:r.reset(a[s]);break;case 16:this.$="";break;case 17:this.$=a[s];break;case 18:this.$=a[s-1]+":"+a[s];break;case 19:this.$=a[s-1]+":"+r.count,r.count=0;break;case 20:r.count=0;break;case 21:r.count+=1}},table:[{3:1,4:[1,2]},{1:[3]},{5:[1,3],8:[1,4]},{6:5,7:e,9:6,12:n},{5:[1,8]},{7:[1,9]},t(r,[2,7],{10:10,11:[1,11]}),t(i,[2,6]),{6:12,7:e,9:6,12:n},{1:[2,1]},{7:[2,4],12:[1,15],13:13,14:14,15:[1,16],17:[1,17],19:[1,18],20:[1,19],21:[1,20]},t(i,[2,5]),{7:[1,21]},t(r,[2,8]),{12:[1,22]},t(r,[2,10]),{12:[2,16],16:23,23:[1,24]},{18:[1,25]},{18:[1,26]},{18:[1,27]},{18:[1,30],22:28,24:[1,29]},{1:[2,2]},t(r,[2,9]),{12:[2,11]},{12:[2,17]},{12:[2,12]},{12:[2,13]},{12:[2,14]},{12:[2,15]},{12:a,25:31,26:o},{12:a,25:33,26:o},{12:[2,18]},{12:a,25:34,26:o},{12:[2,19]},{12:[2,21]}],defaultActions:{9:[2,1],21:[2,2],23:[2,11],24:[2,17],25:[2,12],26:[2,13],27:[2,14],28:[2,15],31:[2,18],33:[2,19],34:[2,21]},parseError:function(t,e){if(!e.recoverable){var n=new Error(t);throw n.hash=e,n}this.trace(t)},parse:function(t){var e=this,n=[0],r=[],i=[null],a=[],o=this.table,s="",u=0,c=0,f=0,l=2,h=1,d=a.slice.call(arguments,1),p=Object.create(this.lexer),g={yy:{}};for(var y in this.yy)Object.prototype.hasOwnProperty.call(this.yy,y)&&(g.yy[y]=this.yy[y]);p.setInput(t,g.yy),g.yy.lexer=p,g.yy.parser=this,void 0===p.yylloc&&(p.yylloc={});var b=p.yylloc;a.push(b);var v=p.options&&p.options.ranges;function m(){var t;return"number"!=typeof(t=r.pop()||p.lex()||h)&&(t instanceof Array&&(t=(r=t).pop()),t=e.symbols_[t]||t),t}"function"==typeof g.yy.parseError?this.parseError=g.yy.parseError:this.parseError=Object.getPrototypeOf(this).parseError;for(var _,w,x,k,E,A,S,M,T,D={};;){if(x=n[n.length-1],this.defaultActions[x]?k=this.defaultActions[x]:(null==_&&(_=m()),k=o[x]&&o[x][_]),void 0===k||!k.length||!k[0]){var C="";for(A in T=[],o[x])this.terminals_[A]&&A>l&&T.push("'"+this.terminals_[A]+"'");C=p.showPosition?"Parse error on line "+(u+1)+":\n"+p.showPosition()+"\nExpecting "+T.join(", ")+", got '"+(this.terminals_[_]||_)+"'":"Parse error on line "+(u+1)+": Unexpected "+(_==h?"end of input":"'"+(this.terminals_[_]||_)+"'"),this.parseError(C,{text:p.match,token:this.terminals_[_]||_,line:p.yylineno,loc:b,expected:T})}if(k[0]instanceof Array&&k.length>1)throw new Error("Parse Error: multiple actions possible at state: "+x+", token: "+_);switch(k[0]){case 1:n.push(_),i.push(p.yytext),a.push(p.yylloc),n.push(k[1]),_=null,w?(_=w,w=null):(c=p.yyleng,s=p.yytext,u=p.yylineno,b=p.yylloc,f>0&&f--);break;case 2:if(S=this.productions_[k[1]][1],D.$=i[i.length-S],D._$={first_line:a[a.length-(S||1)].first_line,last_line:a[a.length-1].last_line,first_column:a[a.length-(S||1)].first_column,last_column:a[a.length-1].last_column},v&&(D._$.range=[a[a.length-(S||1)].range[0],a[a.length-1].range[1]]),void 0!==(E=this.performAction.apply(D,[s,c,u,g.yy,k[1],i,a].concat(d))))return E;S&&(n=n.slice(0,-1*S*2),i=i.slice(0,-1*S),a=a.slice(0,-1*S)),n.push(this.productions_[k[1]][0]),i.push(D.$),a.push(D._$),M=o[n[n.length-2]][n[n.length-1]],n.push(M);break;case 3:return!0}}return!0}},u={EOF:1,parseError:function(t,e){if(!this.yy.parser)throw new Error(t);this.yy.parser.parseError(t,e)},setInput:function(t,e){return this.yy=e||this.yy||{},this._input=t,this._more=this._backtrack=this.done=!1,this.yylineno=this.yyleng=0,this.yytext=this.matched=this.match="",this.conditionStack=["INITIAL"],this.yylloc={first_line:1,first_column:0,last_line:1,last_column:0},this.options.ranges&&(this.yylloc.range=[0,0]),this.offset=0,this},input:function(){var t=this._input[0];return this.yytext+=t,this.yyleng++,this.offset++,this.match+=t,this.matched+=t,t.match(/(?:\r\n?|\n).*/g)?(this.yylineno++,this.yylloc.last_line++):this.yylloc.last_column++,this.options.ranges&&this.yylloc.range[1]++,this._input=this._input.slice(1),t},unput:function(t){var e=t.length,n=t.split(/(?:\r\n?|\n)/g);this._input=t+this._input,this.yytext=this.yytext.substr(0,this.yytext.length-e),this.offset-=e;var r=this.match.split(/(?:\r\n?|\n)/g);this.match=this.match.substr(0,this.match.length-1),this.matched=this.matched.substr(0,this.matched.length-1),n.length-1&&(this.yylineno-=n.length-1);var i=this.yylloc.range;return this.yylloc={first_line:this.yylloc.first_line,last_line:this.yylineno+1,first_column:this.yylloc.first_column,last_column:n?(n.length===r.length?this.yylloc.first_column:0)+r[r.length-n.length].length-n[0].length:this.yylloc.first_column-e},this.options.ranges&&(this.yylloc.range=[i[0],i[0]+this.yyleng-e]),this.yyleng=this.yytext.length,this},more:function(){return this._more=!0,this},reject:function(){return this.options.backtrack_lexer?(this._backtrack=!0,this):this.parseError("Lexical error on line "+(this.yylineno+1)+". You can only invoke reject() in the lexer when the lexer is of the backtracking persuasion (options.backtrack_lexer = true).\n"+this.showPosition(),{text:"",token:null,line:this.yylineno})},less:function(t){this.unput(this.match.slice(t))},pastInput:function(){var t=this.matched.substr(0,this.matched.length-this.match.length);return(t.length>20?"...":"")+t.substr(-20).replace(/\n/g,"")},upcomingInput:function(){var t=this.match;return t.length<20&&(t+=this._input.substr(0,20-t.length)),(t.substr(0,20)+(t.length>20?"...":"")).replace(/\n/g,"")},showPosition:function(){var t=this.pastInput(),e=new Array(t.length+1).join("-");return t+this.upcomingInput()+"\n"+e+"^"},test_match:function(t,e){var n,r,i;if(this.options.backtrack_lexer&&(i={yylineno:this.yylineno,yylloc:{first_line:this.yylloc.first_line,last_line:this.last_line,first_column:this.yylloc.first_column,last_column:this.yylloc.last_column},yytext:this.yytext,match:this.match,matches:this.matches,matched:this.matched,yyleng:this.yyleng,offset:this.offset,_more:this._more,_input:this._input,yy:this.yy,conditionStack:this.conditionStack.slice(0),done:this.done},this.options.ranges&&(i.yylloc.range=this.yylloc.range.slice(0))),(r=t[0].match(/(?:\r\n?|\n).*/g))&&(this.yylineno+=r.length),this.yylloc={first_line:this.yylloc.last_line,last_line:this.yylineno+1,first_column:this.yylloc.last_column,last_column:r?r[r.length-1].length-r[r.length-1].match(/\r?\n?/)[0].length:this.yylloc.last_column+t[0].length},this.yytext+=t[0],this.match+=t[0],this.matches=t,this.yyleng=this.yytext.length,this.options.ranges&&(this.yylloc.range=[this.offset,this.offset+=this.yyleng]),this._more=!1,this._backtrack=!1,this._input=this._input.slice(t[0].length),this.matched+=t[0],n=this.performAction.call(this,this.yy,this,e,this.conditionStack[this.conditionStack.length-1]),this.done&&this._input&&(this.done=!1),n)return n;if(this._backtrack){for(var a in i)this[a]=i[a];return!1}return!1},next:function(){if(this.done)return this.EOF;var t,e,n,r;this._input||(this.done=!0),this._more||(this.yytext="",this.match="");for(var i=this._currentRules(),a=0;a<i.length;a++)if((n=this._input.match(this.rules[i[a]]))&&(!e||n[0].length>e[0].length)){if(e=n,r=a,this.options.backtrack_lexer){if(!1!==(t=this.test_match(n,i[a])))return t;if(this._backtrack){e=!1;continue}return!1}if(!this.options.flex)break}return e?!1!==(t=this.test_match(e,i[r]))&&t:""===this._input?this.EOF:this.parseError("Lexical error on line "+(this.yylineno+1)+". Unrecognized text.\n"+this.showPosition(),{text:"",token:null,line:this.yylineno})},lex:function(){var t=this.next();return t||this.lex()},begin:function(t){this.conditionStack.push(t)},popState:function(){return this.conditionStack.length-1>0?this.conditionStack.pop():this.conditionStack[0]},_currentRules:function(){return this.conditionStack.length&&this.conditionStack[this.conditionStack.length-1]?this.conditions[this.conditionStack[this.conditionStack.length-1]].rules:this.conditions.INITIAL.rules},topState:function(t){return(t=this.conditionStack.length-1-Math.abs(t||0))>=0?this.conditionStack[t]:"INITIAL"},pushState:function(t){this.begin(t)},stateStackSize:function(){return this.conditionStack.length},options:{"case-insensitive":!0},performAction:function(t,e,n,r){switch(n){case 0:return 12;case 1:case 2:case 3:break;case 4:return 4;case 5:return 15;case 6:return 17;case 7:return 20;case 8:return 21;case 9:return 19;case 10:case 11:return 8;case 12:return 5;case 13:return 26;case 14:this.begin("options");break;case 15:this.popState();break;case 16:return 11;case 17:this.begin("string");break;case 18:this.popState();break;case 19:return 23;case 20:return 18;case 21:return 7}},rules:[/^(?:(\r?\n)+)/i,/^(?:\s+)/i,/^(?:#[^\n]*)/i,/^(?:%[^\n]*)/i,/^(?:gitGraph\b)/i,/^(?:commit\b)/i,/^(?:branch\b)/i,/^(?:merge\b)/i,/^(?:reset\b)/i,/^(?:checkout\b)/i,/^(?:LR\b)/i,/^(?:BT\b)/i,/^(?::)/i,/^(?:\^)/i,/^(?:options\r?\n)/i,/^(?:end\r?\n)/i,/^(?:[^\n]+\r?\n)/i,/^(?:["])/i,/^(?:["])/i,/^(?:[^"]*)/i,/^(?:[a-zA-Z][a-zA-Z0-9_]+)/i,/^(?:$)/i],conditions:{options:{rules:[15,16],inclusive:!1},string:{rules:[18,19],inclusive:!1},INITIAL:{rules:[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,17,20,21],inclusive:!0}}};function c(){this.yy={}}return s.lexer=u,c.prototype=s,s.Parser=c,new c}();e.parser=i,e.Parser=i.Parser,e.parse=function(){return i.parse.apply(i,arguments)},e.main=function(r){r[1]||(console.log("Usage: "+r[0]+" FILE"),t.exit(1));var i=n(28).readFileSync(n(29).normalize(r[1]),"utf8");return e.parser.parse(i)},n.c[n.s]===r&&e.main(t.argv.slice(1))}).call(this,n(7),n(9)(t))},function(t,e,n){(function(t,r){var i=function(){var t=function(t,e,n,r){for(n=n||{},r=t.length;r--;n[t[r]]=e);return n},e=[6,9,10],n={trace:function(){},yy:{},symbols_:{error:2,start:3,info:4,document:5,EOF:6,line:7,statement:8,NL:9,showInfo:10,$accept:0,$end:1},terminals_:{2:"error",4:"info",6:"EOF",9:"NL",10:"showInfo"},productions_:[0,[3,3],[5,0],[5,2],[7,1],[7,1],[8,1]],performAction:function(t,e,n,r,i,a,o){a.length;switch(i){case 1:return r;case 4:break;case 6:r.setInfo(!0)}},table:[{3:1,4:[1,2]},{1:[3]},t(e,[2,2],{5:3}),{6:[1,4],7:5,8:6,9:[1,7],10:[1,8]},{1:[2,1]},t(e,[2,3]),t(e,[2,4]),t(e,[2,5]),t(e,[2,6])],defaultActions:{4:[2,1]},parseError:function(t,e){if(!e.recoverable){var n=new Error(t);throw n.hash=e,n}this.trace(t)},parse:function(t){var e=this,n=[0],r=[],i=[null],a=[],o=this.table,s="",u=0,c=0,f=0,l=2,h=1,d=a.slice.call(arguments,1),p=Object.create(this.lexer),g={yy:{}};for(var y in this.yy)Object.prototype.hasOwnProperty.call(this.yy,y)&&(g.yy[y]=this.yy[y]);p.setInput(t,g.yy),g.yy.lexer=p,g.yy.parser=this,void 0===p.yylloc&&(p.yylloc={});var b=p.yylloc;a.push(b);var v=p.options&&p.options.ranges;function m(){var t;return"number"!=typeof(t=r.pop()||p.lex()||h)&&(t instanceof Array&&(t=(r=t).pop()),t=e.symbols_[t]||t),t}"function"==typeof g.yy.parseError?this.parseError=g.yy.parseError:this.parseError=Object.getPrototypeOf(this).parseError;for(var _,w,x,k,E,A,S,M,T,D={};;){if(x=n[n.length-1],this.defaultActions[x]?k=this.defaultActions[x]:(null==_&&(_=m()),k=o[x]&&o[x][_]),void 0===k||!k.length||!k[0]){var C="";for(A in T=[],o[x])this.terminals_[A]&&A>l&&T.push("'"+this.terminals_[A]+"'");C=p.showPosition?"Parse error on line "+(u+1)+":\n"+p.showPosition()+"\nExpecting "+T.join(", ")+", got '"+(this.terminals_[_]||_)+"'":"Parse error on line "+(u+1)+": Unexpected "+(_==h?"end of input":"'"+(this.terminals_[_]||_)+"'"),this.parseError(C,{text:p.match,token:this.terminals_[_]||_,line:p.yylineno,loc:b,expected:T})}if(k[0]instanceof Array&&k.length>1)throw new Error("Parse Error: multiple actions possible at state: "+x+", token: "+_);switch(k[0]){case 1:n.push(_),i.push(p.yytext),a.push(p.yylloc),n.push(k[1]),_=null,w?(_=w,w=null):(c=p.yyleng,s=p.yytext,u=p.yylineno,b=p.yylloc,f>0&&f--);break;case 2:if(S=this.productions_[k[1]][1],D.$=i[i.length-S],D._$={first_line:a[a.length-(S||1)].first_line,last_line:a[a.length-1].last_line,first_column:a[a.length-(S||1)].first_column,last_column:a[a.length-1].last_column},v&&(D._$.range=[a[a.length-(S||1)].range[0],a[a.length-1].range[1]]),void 0!==(E=this.performAction.apply(D,[s,c,u,g.yy,k[1],i,a].concat(d))))return E;S&&(n=n.slice(0,-1*S*2),i=i.slice(0,-1*S),a=a.slice(0,-1*S)),n.push(this.productions_[k[1]][0]),i.push(D.$),a.push(D._$),M=o[n[n.length-2]][n[n.length-1]],n.push(M);break;case 3:return!0}}return!0}},r={EOF:1,parseError:function(t,e){if(!this.yy.parser)throw new Error(t);this.yy.parser.parseError(t,e)},setInput:function(t,e){return this.yy=e||this.yy||{},this._input=t,this._more=this._backtrack=this.done=!1,this.yylineno=this.yyleng=0,this.yytext=this.matched=this.match="",this.conditionStack=["INITIAL"],this.yylloc={first_line:1,first_column:0,last_line:1,last_column:0},this.options.ranges&&(this.yylloc.range=[0,0]),this.offset=0,this},input:function(){var t=this._input[0];return this.yytext+=t,this.yyleng++,this.offset++,this.match+=t,this.matched+=t,t.match(/(?:\r\n?|\n).*/g)?(this.yylineno++,this.yylloc.last_line++):this.yylloc.last_column++,this.options.ranges&&this.yylloc.range[1]++,this._input=this._input.slice(1),t},unput:function(t){var e=t.length,n=t.split(/(?:\r\n?|\n)/g);this._input=t+this._input,this.yytext=this.yytext.substr(0,this.yytext.length-e),this.offset-=e;var r=this.match.split(/(?:\r\n?|\n)/g);this.match=this.match.substr(0,this.match.length-1),this.matched=this.matched.substr(0,this.matched.length-1),n.length-1&&(this.yylineno-=n.length-1);var i=this.yylloc.range;return this.yylloc={first_line:this.yylloc.first_line,last_line:this.yylineno+1,first_column:this.yylloc.first_column,last_column:n?(n.length===r.length?this.yylloc.first_column:0)+r[r.length-n.length].length-n[0].length:this.yylloc.first_column-e},this.options.ranges&&(this.yylloc.range=[i[0],i[0]+this.yyleng-e]),this.yyleng=this.yytext.length,this},more:function(){return this._more=!0,this},reject:function(){return this.options.backtrack_lexer?(this._backtrack=!0,this):this.parseError("Lexical error on line "+(this.yylineno+1)+". You can only invoke reject() in the lexer when the lexer is of the backtracking persuasion (options.backtrack_lexer = true).\n"+this.showPosition(),{text:"",token:null,line:this.yylineno})},less:function(t){this.unput(this.match.slice(t))},pastInput:function(){var t=this.matched.substr(0,this.matched.length-this.match.length);return(t.length>20?"...":"")+t.substr(-20).replace(/\n/g,"")},upcomingInput:function(){var t=this.match;return t.length<20&&(t+=this._input.substr(0,20-t.length)),(t.substr(0,20)+(t.length>20?"...":"")).replace(/\n/g,"")},showPosition:function(){var t=this.pastInput(),e=new Array(t.length+1).join("-");return t+this.upcomingInput()+"\n"+e+"^"},test_match:function(t,e){var n,r,i;if(this.options.backtrack_lexer&&(i={yylineno:this.yylineno,yylloc:{first_line:this.yylloc.first_line,last_line:this.last_line,first_column:this.yylloc.first_column,last_column:this.yylloc.last_column},yytext:this.yytext,match:this.match,matches:this.matches,matched:this.matched,yyleng:this.yyleng,offset:this.offset,_more:this._more,_input:this._input,yy:this.yy,conditionStack:this.conditionStack.slice(0),done:this.done},this.options.ranges&&(i.yylloc.range=this.yylloc.range.slice(0))),(r=t[0].match(/(?:\r\n?|\n).*/g))&&(this.yylineno+=r.length),this.yylloc={first_line:this.yylloc.last_line,last_line:this.yylineno+1,first_column:this.yylloc.last_column,last_column:r?r[r.length-1].length-r[r.length-1].match(/\r?\n?/)[0].length:this.yylloc.last_column+t[0].length},this.yytext+=t[0],this.match+=t[0],this.matches=t,this.yyleng=this.yytext.length,this.options.ranges&&(this.yylloc.range=[this.offset,this.offset+=this.yyleng]),this._more=!1,this._backtrack=!1,this._input=this._input.slice(t[0].length),this.matched+=t[0],n=this.performAction.call(this,this.yy,this,e,this.conditionStack[this.conditionStack.length-1]),this.done&&this._input&&(this.done=!1),n)return n;if(this._backtrack){for(var a in i)this[a]=i[a];return!1}return!1},next:function(){if(this.done)return this.EOF;var t,e,n,r;this._input||(this.done=!0),this._more||(this.yytext="",this.match="");for(var i=this._currentRules(),a=0;a<i.length;a++)if((n=this._input.match(this.rules[i[a]]))&&(!e||n[0].length>e[0].length)){if(e=n,r=a,this.options.backtrack_lexer){if(!1!==(t=this.test_match(n,i[a])))return t;if(this._backtrack){e=!1;continue}return!1}if(!this.options.flex)break}return e?!1!==(t=this.test_match(e,i[r]))&&t:""===this._input?this.EOF:this.parseError("Lexical error on line "+(this.yylineno+1)+". Unrecognized text.\n"+this.showPosition(),{text:"",token:null,line:this.yylineno})},lex:function(){var t=this.next();return t||this.lex()},begin:function(t){this.conditionStack.push(t)},popState:function(){return this.conditionStack.length-1>0?this.conditionStack.pop():this.conditionStack[0]},_currentRules:function(){return this.conditionStack.length&&this.conditionStack[this.conditionStack.length-1]?this.conditions[this.conditionStack[this.conditionStack.length-1]].rules:this.conditions.INITIAL.rules},topState:function(t){return(t=this.conditionStack.length-1-Math.abs(t||0))>=0?this.conditionStack[t]:"INITIAL"},pushState:function(t){this.begin(t)},stateStackSize:function(){return this.conditionStack.length},options:{"case-insensitive":!0},performAction:function(t,e,n,r){switch(n){case 0:return 4;case 1:return 9;case 2:return"space";case 3:return 10;case 4:return 6;case 5:return"TXT"}},rules:[/^(?:info\b)/i,/^(?:[\s\n\r]+)/i,/^(?:[\s]+)/i,/^(?:showInfo\b)/i,/^(?:$)/i,/^(?:.)/i],conditions:{INITIAL:{rules:[0,1,2,3,4,5],inclusive:!0}}};function i(){this.yy={}}return n.lexer=r,i.prototype=n,n.Parser=i,new i}();e.parser=i,e.Parser=i.Parser,e.parse=function(){return i.parse.apply(i,arguments)},e.main=function(r){r[1]||(console.log("Usage: "+r[0]+" FILE"),t.exit(1));var i=n(28).readFileSync(n(29).normalize(r[1]),"utf8");return e.parser.parse(i)},n.c[n.s]===r&&e.main(t.argv.slice(1))}).call(this,n(7),n(9)(t))},function(t,e,n){(function(t,r){var i=function(){var t=function(t,e,n,r){for(n=n||{},r=t.length;r--;n[t[r]]=e);return n},e=[6,9,10,12],n={trace:function(){},yy:{},symbols_:{error:2,start:3,pie:4,document:5,EOF:6,line:7,statement:8,NL:9,STR:10,VALUE:11,title:12,$accept:0,$end:1},terminals_:{2:"error",4:"pie",6:"EOF",9:"NL",10:"STR",11:"VALUE",12:"title"},productions_:[0,[3,3],[5,0],[5,2],[7,1],[7,1],[8,2],[8,1]],performAction:function(t,e,n,r,i,a,o){var s=a.length-1;switch(i){case 4:break;case 6:r.addSection(a[s-1],r.cleanupValue(a[s]));break;case 7:r.setTitle(a[s].substr(6)),this.$=a[s].substr(6)}},table:[{3:1,4:[1,2]},{1:[3]},t(e,[2,2],{5:3}),{6:[1,4],7:5,8:6,9:[1,7],10:[1,8],12:[1,9]},{1:[2,1]},t(e,[2,3]),t(e,[2,4]),t(e,[2,5]),{11:[1,10]},t(e,[2,7]),t(e,[2,6])],defaultActions:{4:[2,1]},parseError:function(t,e){if(!e.recoverable){var n=new Error(t);throw n.hash=e,n}this.trace(t)},parse:function(t){var e=this,n=[0],r=[],i=[null],a=[],o=this.table,s="",u=0,c=0,f=0,l=2,h=1,d=a.slice.call(arguments,1),p=Object.create(this.lexer),g={yy:{}};for(var y in this.yy)Object.prototype.hasOwnProperty.call(this.yy,y)&&(g.yy[y]=this.yy[y]);p.setInput(t,g.yy),g.yy.lexer=p,g.yy.parser=this,void 0===p.yylloc&&(p.yylloc={});var b=p.yylloc;a.push(b);var v=p.options&&p.options.ranges;function m(){var t;return"number"!=typeof(t=r.pop()||p.lex()||h)&&(t instanceof Array&&(t=(r=t).pop()),t=e.symbols_[t]||t),t}"function"==typeof g.yy.parseError?this.parseError=g.yy.parseError:this.parseError=Object.getPrototypeOf(this).parseError;for(var _,w,x,k,E,A,S,M,T,D={};;){if(x=n[n.length-1],this.defaultActions[x]?k=this.defaultActions[x]:(null==_&&(_=m()),k=o[x]&&o[x][_]),void 0===k||!k.length||!k[0]){var C="";for(A in T=[],o[x])this.terminals_[A]&&A>l&&T.push("'"+this.terminals_[A]+"'");C=p.showPosition?"Parse error on line "+(u+1)+":\n"+p.showPosition()+"\nExpecting "+T.join(", ")+", got '"+(this.terminals_[_]||_)+"'":"Parse error on line "+(u+1)+": Unexpected "+(_==h?"end of input":"'"+(this.terminals_[_]||_)+"'"),this.parseError(C,{text:p.match,token:this.terminals_[_]||_,line:p.yylineno,loc:b,expected:T})}if(k[0]instanceof Array&&k.length>1)throw new Error("Parse Error: multiple actions possible at state: "+x+", token: "+_);switch(k[0]){case 1:n.push(_),i.push(p.yytext),a.push(p.yylloc),n.push(k[1]),_=null,w?(_=w,w=null):(c=p.yyleng,s=p.yytext,u=p.yylineno,b=p.yylloc,f>0&&f--);break;case 2:if(S=this.productions_[k[1]][1],D.$=i[i.length-S],D._$={first_line:a[a.length-(S||1)].first_line,last_line:a[a.length-1].last_line,first_column:a[a.length-(S||1)].first_column,last_column:a[a.length-1].last_column},v&&(D._$.range=[a[a.length-(S||1)].range[0],a[a.length-1].range[1]]),void 0!==(E=this.performAction.apply(D,[s,c,u,g.yy,k[1],i,a].concat(d))))return E;S&&(n=n.slice(0,-1*S*2),i=i.slice(0,-1*S),a=a.slice(0,-1*S)),n.push(this.productions_[k[1]][0]),i.push(D.$),a.push(D._$),M=o[n[n.length-2]][n[n.length-1]],n.push(M);break;case 3:return!0}}return!0}},r={EOF:1,parseError:function(t,e){if(!this.yy.parser)throw new Error(t);this.yy.parser.parseError(t,e)},setInput:function(t,e){return this.yy=e||this.yy||{},this._input=t,this._more=this._backtrack=this.done=!1,this.yylineno=this.yyleng=0,this.yytext=this.matched=this.match="",this.conditionStack=["INITIAL"],this.yylloc={first_line:1,first_column:0,last_line:1,last_column:0},this.options.ranges&&(this.yylloc.range=[0,0]),this.offset=0,this},input:function(){var t=this._input[0];return this.yytext+=t,this.yyleng++,this.offset++,this.match+=t,this.matched+=t,t.match(/(?:\r\n?|\n).*/g)?(this.yylineno++,this.yylloc.last_line++):this.yylloc.last_column++,this.options.ranges&&this.yylloc.range[1]++,this._input=this._input.slice(1),t},unput:function(t){var e=t.length,n=t.split(/(?:\r\n?|\n)/g);this._input=t+this._input,this.yytext=this.yytext.substr(0,this.yytext.length-e),this.offset-=e;var r=this.match.split(/(?:\r\n?|\n)/g);this.match=this.match.substr(0,this.match.length-1),this.matched=this.matched.substr(0,this.matched.length-1),n.length-1&&(this.yylineno-=n.length-1);var i=this.yylloc.range;return this.yylloc={first_line:this.yylloc.first_line,last_line:this.yylineno+1,first_column:this.yylloc.first_column,last_column:n?(n.length===r.length?this.yylloc.first_column:0)+r[r.length-n.length].length-n[0].length:this.yylloc.first_column-e},this.options.ranges&&(this.yylloc.range=[i[0],i[0]+this.yyleng-e]),this.yyleng=this.yytext.length,this},more:function(){return this._more=!0,this},reject:function(){return this.options.backtrack_lexer?(this._backtrack=!0,this):this.parseError("Lexical error on line "+(this.yylineno+1)+". You can only invoke reject() in the lexer when the lexer is of the backtracking persuasion (options.backtrack_lexer = true).\n"+this.showPosition(),{text:"",token:null,line:this.yylineno})},less:function(t){this.unput(this.match.slice(t))},pastInput:function(){var t=this.matched.substr(0,this.matched.length-this.match.length);return(t.length>20?"...":"")+t.substr(-20).replace(/\n/g,"")},upcomingInput:function(){var t=this.match;return t.length<20&&(t+=this._input.substr(0,20-t.length)),(t.substr(0,20)+(t.length>20?"...":"")).replace(/\n/g,"")},showPosition:function(){var t=this.pastInput(),e=new Array(t.length+1).join("-");return t+this.upcomingInput()+"\n"+e+"^"},test_match:function(t,e){var n,r,i;if(this.options.backtrack_lexer&&(i={yylineno:this.yylineno,yylloc:{first_line:this.yylloc.first_line,last_line:this.last_line,first_column:this.yylloc.first_column,last_column:this.yylloc.last_column},yytext:this.yytext,match:this.match,matches:this.matches,matched:this.matched,yyleng:this.yyleng,offset:this.offset,_more:this._more,_input:this._input,yy:this.yy,conditionStack:this.conditionStack.slice(0),done:this.done},this.options.ranges&&(i.yylloc.range=this.yylloc.range.slice(0))),(r=t[0].match(/(?:\r\n?|\n).*/g))&&(this.yylineno+=r.length),this.yylloc={first_line:this.yylloc.last_line,last_line:this.yylineno+1,first_column:this.yylloc.last_column,last_column:r?r[r.length-1].length-r[r.length-1].match(/\r?\n?/)[0].length:this.yylloc.last_column+t[0].length},this.yytext+=t[0],this.match+=t[0],this.matches=t,this.yyleng=this.yytext.length,this.options.ranges&&(this.yylloc.range=[this.offset,this.offset+=this.yyleng]),this._more=!1,this._backtrack=!1,this._input=this._input.slice(t[0].length),this.matched+=t[0],n=this.performAction.call(this,this.yy,this,e,this.conditionStack[this.conditionStack.length-1]),this.done&&this._input&&(this.done=!1),n)return n;if(this._backtrack){for(var a in i)this[a]=i[a];return!1}return!1},next:function(){if(this.done)return this.EOF;var t,e,n,r;this._input||(this.done=!0),this._more||(this.yytext="",this.match="");for(var i=this._currentRules(),a=0;a<i.length;a++)if((n=this._input.match(this.rules[i[a]]))&&(!e||n[0].length>e[0].length)){if(e=n,r=a,this.options.backtrack_lexer){if(!1!==(t=this.test_match(n,i[a])))return t;if(this._backtrack){e=!1;continue}return!1}if(!this.options.flex)break}return e?!1!==(t=this.test_match(e,i[r]))&&t:""===this._input?this.EOF:this.parseError("Lexical error on line "+(this.yylineno+1)+". Unrecognized text.\n"+this.showPosition(),{text:"",token:null,line:this.yylineno})},lex:function(){var t=this.next();return t||this.lex()},begin:function(t){this.conditionStack.push(t)},popState:function(){return this.conditionStack.length-1>0?this.conditionStack.pop():this.conditionStack[0]},_currentRules:function(){return this.conditionStack.length&&this.conditionStack[this.conditionStack.length-1]?this.conditions[this.conditionStack[this.conditionStack.length-1]].rules:this.conditions.INITIAL.rules},topState:function(t){return(t=this.conditionStack.length-1-Math.abs(t||0))>=0?this.conditionStack[t]:"INITIAL"},pushState:function(t){this.begin(t)},stateStackSize:function(){return this.conditionStack.length},options:{"case-insensitive":!0},performAction:function(t,e,n,r){switch(n){case 0:case 1:break;case 2:return 4;case 3:return 9;case 4:return"space";case 5:return 12;case 6:this.begin("string");break;case 7:this.popState();break;case 8:return"STR";case 9:return"VALUE";case 10:return 6}},rules:[/^(?:%%[^\n]*)/i,/^(?:\s+)/i,/^(?:pie\b)/i,/^(?:[\s\n\r]+)/i,/^(?:[\s]+)/i,/^(?:title\s[^#\n;]+)/i,/^(?:["])/i,/^(?:["])/i,/^(?:[^"]*)/i,/^(?::[\s]*[\d]+(?:\.[\d]+)?)/i,/^(?:$)/i],conditions:{string:{rules:[7,8],inclusive:!1},INITIAL:{rules:[0,1,2,3,4,5,6,9,10],inclusive:!0}}};function i(){this.yy={}}return n.lexer=r,i.prototype=n,n.Parser=i,new i}();e.parser=i,e.Parser=i.Parser,e.parse=function(){return i.parse.apply(i,arguments)},e.main=function(r){r[1]||(console.log("Usage: "+r[0]+" FILE"),t.exit(1));var i=n(28).readFileSync(n(29).normalize(r[1]),"utf8");return e.parser.parse(i)},n.c[n.s]===r&&e.main(t.argv.slice(1))}).call(this,n(7),n(9)(t))},function(t){t.exports=JSON.parse('{"name":"mermaid","version":"8.4.8","description":"Markdownish syntax for generating flowcharts, sequence diagrams, class diagrams, gantt charts and git graphs.","main":"dist/mermaid.core.js","keywords":["diagram","markdown","flowchart","sequence diagram","gantt","class diagram","git graph"],"scripts":{"build":"webpack --progress --colors","postbuild":"documentation build src/mermaidAPI.js --shallow -f md --markdown-toc false -o docs/mermaidAPI.md","build:watch":"yarn build --watch","minify":"minify ./dist/mermaid.js > ./dist/mermaid.min.js","release":"yarn build -p --config webpack.config.prod.babel.js","lint":"eslint src","e2e:depr":"yarn lint && jest e2e --config e2e/jest.config.js","cypress":"percy exec -- cypress run","e2e":"start-server-and-test dev http://localhost:9000/ cypress","e2e-upd":"yarn lint && jest e2e -u --config e2e/jest.config.js","dev":"webpack-dev-server --config webpack.config.e2e.js","test":"yarn lint && jest src/.*","test:watch":"jest --watch src","prepublishOnly":"yarn build && yarn release && yarn test && yarn e2e","prepush":"yarn test"},"repository":{"type":"git","url":"https://github.com/knsv/mermaid"},"author":"Knut Sveidqvist","license":"MIT","standard":{"ignore":["**/parser/*.js","dist/**/*.js","cypress/**/*.js"],"globals":["page"]},"dependencies":{"@braintree/sanitize-url":"^3.1.0","crypto-random-string":"^3.0.1","d3":"^5.7.0","dagre":"^0.8.4","dagre-d3":"^0.6.4","graphlib":"^2.1.7","he":"^1.2.0","lodash":"^4.17.11","minify":"^4.1.1","moment-mini":"^2.22.1","scope-css":"^1.2.1"},"devDependencies":{"@babel/core":"^7.2.2","@babel/preset-env":"^7.8.4","@babel/register":"^7.0.0","@percy/cypress":"*","babel-core":"7.0.0-bridge.0","babel-jest":"^24.9.0","babel-loader":"^8.0.4","coveralls":"^3.0.2","css-loader":"^2.0.1","css-to-string-loader":"^0.1.3","cypress":"4.0.1","documentation":"^12.0.1","eslint":"^6.3.0","eslint-config-prettier":"^6.3.0","eslint-plugin-prettier":"^3.1.0","husky":"^1.2.1","identity-obj-proxy":"^3.0.0","jest":"^24.9.0","jison":"^0.4.18","moment":"^2.23.0","node-sass":"^4.12.0","prettier":"^1.18.2","puppeteer":"^1.17.0","sass-loader":"^7.1.0","start-server-and-test":"^1.10.6","terser-webpack-plugin":"^2.2.2","webpack":"^4.41.2","webpack-cli":"^3.1.2","webpack-dev-server":"^3.4.1","webpack-node-externals":"^1.7.2","yarn-upgrade-all":"^0.5.0"},"files":["dist"],"yarn-upgrade-all":{"ignore":["babel-core"]}}')},function(t,e,n){"use strict";var r=n(13);t.exports=i;function i(t){this._isDirected=!r.has(t,"directed")||t.directed,this._isMultigraph=!!r.has(t,"multigraph")&&t.multigraph,this._isCompound=!!r.has(t,"compound")&&t.compound,this._label=void 0,this._defaultNodeLabelFn=r.constant(void 0),this._defaultEdgeLabelFn=r.constant(void 0),this._nodes={},this._isCompound&&(this._parent={},this._children={},this._children["\0"]={}),this._in={},this._preds={},this._out={},this._sucs={},this._edgeObjs={},this._edgeLabels={}}function a(t,e){t[e]?t[e]++:t[e]=1}function o(t,e){--t[e]||delete t[e]}function s(t,e,n,i){var a=""+e,o=""+n;if(!t&&a>o){var s=a;a=o,o=s}return a+""+o+""+(r.isUndefined(i)?"\0":i)}function u(t,e,n,r){var i=""+e,a=""+n;if(!t&&i>a){var o=i;i=a,a=o}var s={v:i,w:a};return r&&(s.name=r),s}function c(t,e){return s(t,e.v,e.w,e.name)}i.prototype._nodeCount=0,i.prototype._edgeCount=0,i.prototype.isDirected=function(){return this._isDirected},i.prototype.isMultigraph=function(){return this._isMultigraph},i.prototype.isCompound=function(){return this._isCompound},i.prototype.setGraph=function(t){return this._label=t,this},i.prototype.graph=function(){return this._label},i.prototype.setDefaultNodeLabel=function(t){return r.isFunction(t)||(t=r.constant(t)),this._defaultNodeLabelFn=t,this},i.prototype.nodeCount=function(){return this._nodeCount},i.prototype.nodes=function(){return r.keys(this._nodes)},i.prototype.sources=function(){var t=this;return r.filter(this.nodes(),(function(e){return r.isEmpty(t._in[e])}))},i.prototype.sinks=function(){var t=this;return r.filter(this.nodes(),(function(e){return r.isEmpty(t._out[e])}))},i.prototype.setNodes=function(t,e){var n=arguments,i=this;return r.each(t,(function(t){n.length>1?i.setNode(t,e):i.setNode(t)})),this},i.prototype.setNode=function(t,e){return r.has(this._nodes,t)?(arguments.length>1&&(this._nodes[t]=e),this):(this._nodes[t]=arguments.length>1?e:this._defaultNodeLabelFn(t),this._isCompound&&(this._parent[t]="\0",this._children[t]={},this._children["\0"][t]=!0),this._in[t]={},this._preds[t]={},this._out[t]={},this._sucs[t]={},++this._nodeCount,this)},i.prototype.node=function(t){return this._nodes[t]},i.prototype.hasNode=function(t){return r.has(this._nodes,t)},i.prototype.removeNode=function(t){var e=this;if(r.has(this._nodes,t)){var n=function(t){e.removeEdge(e._edgeObjs[t])};delete this._nodes[t],this._isCompound&&(this._removeFromParentsChildList(t),delete this._parent[t],r.each(this.children(t),(function(t){e.setParent(t)})),delete this._children[t]),r.each(r.keys(this._in[t]),n),delete this._in[t],delete this._preds[t],r.each(r.keys(this._out[t]),n),delete this._out[t],delete this._sucs[t],--this._nodeCount}return this},i.prototype.setParent=function(t,e){if(!this._isCompound)throw new Error("Cannot set parent in a non-compound graph");if(r.isUndefined(e))e="\0";else{for(var n=e+="";!r.isUndefined(n);n=this.parent(n))if(n===t)throw new Error("Setting "+e+" as parent of "+t+" would create a cycle");this.setNode(e)}return this.setNode(t),this._removeFromParentsChildList(t),this._parent[t]=e,this._children[e][t]=!0,this},i.prototype._removeFromParentsChildList=function(t){delete this._children[this._parent[t]][t]},i.prototype.parent=function(t){if(this._isCompound){var e=this._parent[t];if("\0"!==e)return e}},i.prototype.children=function(t){if(r.isUndefined(t)&&(t="\0"),this._isCompound){var e=this._children[t];if(e)return r.keys(e)}else{if("\0"===t)return this.nodes();if(this.hasNode(t))return[]}},i.prototype.predecessors=function(t){var e=this._preds[t];if(e)return r.keys(e)},i.prototype.successors=function(t){var e=this._sucs[t];if(e)return r.keys(e)},i.prototype.neighbors=function(t){var e=this.predecessors(t);if(e)return r.union(e,this.successors(t))},i.prototype.isLeaf=function(t){return 0===(this.isDirected()?this.successors(t):this.neighbors(t)).length},i.prototype.filterNodes=function(t){var e=new this.constructor({directed:this._isDirected,multigraph:this._isMultigraph,compound:this._isCompound});e.setGraph(this.graph());var n=this;r.each(this._nodes,(function(n,r){t(r)&&e.setNode(r,n)})),r.each(this._edgeObjs,(function(t){e.hasNode(t.v)&&e.hasNode(t.w)&&e.setEdge(t,n.edge(t))}));var i={};return this._isCompound&&r.each(e.nodes(),(function(t){e.setParent(t,function t(r){var a=n.parent(r);return void 0===a||e.hasNode(a)?(i[r]=a,a):a in i?i[a]:t(a)}(t))})),e},i.prototype.setDefaultEdgeLabel=function(t){return r.isFunction(t)||(t=r.constant(t)),this._defaultEdgeLabelFn=t,this},i.prototype.edgeCount=function(){return this._edgeCount},i.prototype.edges=function(){return r.values(this._edgeObjs)},i.prototype.setPath=function(t,e){var n=this,i=arguments;return r.reduce(t,(function(t,r){return i.length>1?n.setEdge(t,r,e):n.setEdge(t,r),r})),this},i.prototype.setEdge=function(){var t,e,n,i,o=!1,c=arguments[0];"object"==typeof c&&null!==c&&"v"in c?(t=c.v,e=c.w,n=c.name,2===arguments.length&&(i=arguments[1],o=!0)):(t=c,e=arguments[1],n=arguments[3],arguments.length>2&&(i=arguments[2],o=!0)),t=""+t,e=""+e,r.isUndefined(n)||(n=""+n);var f=s(this._isDirected,t,e,n);if(r.has(this._edgeLabels,f))return o&&(this._edgeLabels[f]=i),this;if(!r.isUndefined(n)&&!this._isMultigraph)throw new Error("Cannot set a named edge when isMultigraph = false");this.setNode(t),this.setNode(e),this._edgeLabels[f]=o?i:this._defaultEdgeLabelFn(t,e,n);var l=u(this._isDirected,t,e,n);return t=l.v,e=l.w,Object.freeze(l),this._edgeObjs[f]=l,a(this._preds[e],t),a(this._sucs[t],e),this._in[e][f]=l,this._out[t][f]=l,this._edgeCount++,this},i.prototype.edge=function(t,e,n){var r=1===arguments.length?c(this._isDirected,arguments[0]):s(this._isDirected,t,e,n);return this._edgeLabels[r]},i.prototype.hasEdge=function(t,e,n){var i=1===arguments.length?c(this._isDirected,arguments[0]):s(this._isDirected,t,e,n);return r.has(this._edgeLabels,i)},i.prototype.removeEdge=function(t,e,n){var r=1===arguments.length?c(this._isDirected,arguments[0]):s(this._isDirected,t,e,n),i=this._edgeObjs[r];return i&&(t=i.v,e=i.w,delete this._edgeLabels[r],delete this._edgeObjs[r],o(this._preds[e],t),o(this._sucs[t],e),delete this._in[e][r],delete this._out[t][r],this._edgeCount--),this},i.prototype.inEdges=function(t,e){var n=this._in[t];if(n){var i=r.values(n);return e?r.filter(i,(function(t){return t.v===e})):i}},i.prototype.outEdges=function(t,e){var n=this._out[t];if(n){var i=r.values(n);return e?r.filter(i,(function(t){return t.w===e})):i}},i.prototype.nodeEdges=function(t,e){var n=this.inEdges(t,e);if(n)return n.concat(this.outEdges(t,e))}},function(t,e,n){var r=n(32)(n(18),"Map");t.exports=r},function(t,e,n){var r=n(254),i=n(261),a=n(263),o=n(264),s=n(265);function u(t){var e=-1,n=null==t?0:t.length;for(this.clear();++e<n;){var r=t[e];this.set(r[0],r[1])}}u.prototype.clear=r,u.prototype.delete=i,u.prototype.get=a,u.prototype.has=o,u.prototype.set=s,t.exports=u},function(t,e){t.exports=function(t,e){for(var n=-1,r=null==t?0:t.length;++n<r&&!1!==e(t[n],n,t););return t}},function(t,e){t.exports=function(t){return"number"==typeof t&&t>-1&&t%1==0&&t<=9007199254740991}},function(t,e,n){(function(t){var r=n(131),i=e&&!e.nodeType&&e,a=i&&"object"==typeof t&&t&&!t.nodeType&&t,o=a&&a.exports===i&&r.process,s=function(){try{var t=a&&a.require&&a.require("util").types;return t||o&&o.binding&&o.binding("util")}catch(t){}}();t.exports=s}).call(this,n(9)(t))},function(t,e,n){var r=n(70),i=n(271),a=Object.prototype.hasOwnProperty;t.exports=function(t){if(!r(t))return i(t);var e=[];for(var n in Object(t))a.call(t,n)&&"constructor"!=n&&e.push(n);return e}},function(t,e,n){var r=n(138),i=n(139),a=Object.prototype.propertyIsEnumerable,o=Object.getOwnPropertySymbols,s=o?function(t){return null==t?[]:(t=Object(t),r(o(t),(function(e){return a.call(t,e)})))}:i;t.exports=s},function(t,e){t.exports=function(t,e){for(var n=-1,r=e.length,i=t.length;++n<r;)t[i+n]=e[n];return t}},function(t,e,n){var r=n(144);t.exports=function(t){var e=new t.constructor(t.byteLength);return new r(e).set(new r(t)),e}},function(t,e){t.exports=function(t){return function(){return t}}},function(t,e,n){t.exports=n(148)},function(t,e,n){var r=n(102),i=n(27);t.exports=function(t,e){return t&&r(t,e,i)}},function(t,e,n){var r=n(290)();t.exports=r},function(t,e){t.exports=function(t){var e=-1,n=Array(t.size);return t.forEach((function(t){n[++e]=t})),n}},function(t,e,n){var r=n(73),i=n(52);t.exports=function(t,e){for(var n=0,a=(e=r(e,t)).length;null!=t&&n<a;)t=t[i(e[n++])];return n&&n==a?t:void 0}},function(t,e,n){var r=n(6),i=n(42),a=/\.|\[(?:[^[\]]*|(["'])(?:(?!\1)[^\\]|\\.)*?\1)\]/,o=/^\w*$/;t.exports=function(t,e){if(r(t))return!1;var n=typeof t;return!("number"!=n&&"symbol"!=n&&"boolean"!=n&&null!=t&&!i(t))||(o.test(t)||!a.test(t)||null!=e&&t in Object(e))}},function(t,e,n){var r=n(312),i=n(159);t.exports=function(t,e){return null!=t&&i(t,e,r)}},function(t,e,n){var r=n(97),i=n(324);t.exports=function t(e,n,a,o,s){var u=-1,c=e.length;for(a||(a=i),s||(s=[]);++u<c;){var f=e[u];n>0&&a(f)?n>1?t(f,n-1,a,o,s):r(s,f):o||(s[s.length]=f)}return s}},function(t,e,n){var r=n(42);t.exports=function(t,e,n){for(var i=-1,a=t.length;++i<a;){var o=t[i],s=e(o);if(null!=s&&(void 0===u?s==s&&!r(s):n(s,u)))var u=s,c=o}return c}},function(t,e){t.exports=function(t,e,n,r){var i=t.x,a=t.y,o=i-r.x,s=a-r.y,u=Math.sqrt(e*e*s*s+n*n*o*o),c=Math.abs(e*n*o/u);r.x<i&&(c=-c);var f=Math.abs(e*n*s/u);r.y<a&&(f=-f);return{x:i+c,y:a+f}}},function(t,e,n){var r=n(409),i=n(128),a=n(410);t.exports=function(t,e,n){var o=e.label,s=t.append("g");"svg"===e.labelType?a(s,e):"string"!=typeof o||"html"===e.labelType?i(s,e):r(s,e);var u,c=s.node().getBBox();switch(n){case"top":u=-e.height/2;break;case"bottom":u=e.height/2-c.height;break;default:u=-c.height/2}return s.attr("transform","translate("+-c.width/2+","+u+")"),s}},function(t,e,n){"use strict";var r=n(2),i=n(192),a=n(3).Buffer,o=new Array(16);function s(){i.call(this,64),this._a=1732584193,this._b=4023233417,this._c=2562383102,this._d=271733878}function u(t,e){return t<<e|t>>>32-e}function c(t,e,n,r,i,a,o){return u(t+(e&n|~e&r)+i+a|0,o)+e|0}function f(t,e,n,r,i,a,o){return u(t+(e&r|n&~r)+i+a|0,o)+e|0}function l(t,e,n,r,i,a,o){return u(t+(e^n^r)+i+a|0,o)+e|0}function h(t,e,n,r,i,a,o){return u(t+(n^(e|~r))+i+a|0,o)+e|0}r(s,i),s.prototype._update=function(){for(var t=o,e=0;e<16;++e)t[e]=this._block.readInt32LE(4*e);var n=this._a,r=this._b,i=this._c,a=this._d;n=c(n,r,i,a,t[0],3614090360,7),a=c(a,n,r,i,t[1],3905402710,12),i=c(i,a,n,r,t[2],606105819,17),r=c(r,i,a,n,t[3],3250441966,22),n=c(n,r,i,a,t[4],4118548399,7),a=c(a,n,r,i,t[5],1200080426,12),i=c(i,a,n,r,t[6],2821735955,17),r=c(r,i,a,n,t[7],4249261313,22),n=c(n,r,i,a,t[8],1770035416,7),a=c(a,n,r,i,t[9],2336552879,12),i=c(i,a,n,r,t[10],4294925233,17),r=c(r,i,a,n,t[11],2304563134,22),n=c(n,r,i,a,t[12],1804603682,7),a=c(a,n,r,i,t[13],4254626195,12),i=c(i,a,n,r,t[14],2792965006,17),n=f(n,r=c(r,i,a,n,t[15],1236535329,22),i,a,t[1],4129170786,5),a=f(a,n,r,i,t[6],3225465664,9),i=f(i,a,n,r,t[11],643717713,14),r=f(r,i,a,n,t[0],3921069994,20),n=f(n,r,i,a,t[5],3593408605,5),a=f(a,n,r,i,t[10],38016083,9),i=f(i,a,n,r,t[15],3634488961,14),r=f(r,i,a,n,t[4],3889429448,20),n=f(n,r,i,a,t[9],568446438,5),a=f(a,n,r,i,t[14],3275163606,9),i=f(i,a,n,r,t[3],4107603335,14),r=f(r,i,a,n,t[8],1163531501,20),n=f(n,r,i,a,t[13],2850285829,5),a=f(a,n,r,i,t[2],4243563512,9),i=f(i,a,n,r,t[7],1735328473,14),n=l(n,r=f(r,i,a,n,t[12],2368359562,20),i,a,t[5],4294588738,4),a=l(a,n,r,i,t[8],2272392833,11),i=l(i,a,n,r,t[11],1839030562,16),r=l(r,i,a,n,t[14],4259657740,23),n=l(n,r,i,a,t[1],2763975236,4),a=l(a,n,r,i,t[4],1272893353,11),i=l(i,a,n,r,t[7],4139469664,16),r=l(r,i,a,n,t[10],3200236656,23),n=l(n,r,i,a,t[13],681279174,4),a=l(a,n,r,i,t[0],3936430074,11),i=l(i,a,n,r,t[3],3572445317,16),r=l(r,i,a,n,t[6],76029189,23),n=l(n,r,i,a,t[9],3654602809,4),a=l(a,n,r,i,t[12],3873151461,11),i=l(i,a,n,r,t[15],530742520,16),n=h(n,r=l(r,i,a,n,t[2],3299628645,23),i,a,t[0],4096336452,6),a=h(a,n,r,i,t[7],1126891415,10),i=h(i,a,n,r,t[14],2878612391,15),r=h(r,i,a,n,t[5],4237533241,21),n=h(n,r,i,a,t[12],1700485571,6),a=h(a,n,r,i,t[3],2399980690,10),i=h(i,a,n,r,t[10],4293915773,15),r=h(r,i,a,n,t[1],2240044497,21),n=h(n,r,i,a,t[8],1873313359,6),a=h(a,n,r,i,t[15],4264355552,10),i=h(i,a,n,r,t[6],2734768916,15),r=h(r,i,a,n,t[13],1309151649,21),n=h(n,r,i,a,t[4],4149444226,6),a=h(a,n,r,i,t[11],3174756917,10),i=h(i,a,n,r,t[2],718787259,15),r=h(r,i,a,n,t[9],3951481745,21),this._a=this._a+n|0,this._b=this._b+r|0,this._c=this._c+i|0,this._d=this._d+a|0},s.prototype._digest=function(){this._block[this._blockOffset++]=128,this._blockOffset>56&&(this._block.fill(0,this._blockOffset,64),this._update(),this._blockOffset=0),this._block.fill(0,this._blockOffset,56),this._block.writeUInt32LE(this._length[0],56),this._block.writeUInt32LE(this._length[1],60),this._update();var t=a.allocUnsafe(16);return t.writeInt32LE(this._a,0),t.writeInt32LE(this._b,4),t.writeInt32LE(this._c,8),t.writeInt32LE(this._d,12),t},t.exports=s},function(t,e,n){t.exports=i;var r=n(113).EventEmitter;function i(){r.call(this)}n(2)(i,r),i.Readable=n(114),i.Writable=n(430),i.Duplex=n(431),i.Transform=n(432),i.PassThrough=n(433),i.Stream=i,i.prototype.pipe=function(t,e){var n=this;function i(e){t.writable&&!1===t.write(e)&&n.pause&&n.pause()}function a(){n.readable&&n.resume&&n.resume()}n.on("data",i),t.on("drain",a),t._isStdio||e&&!1===e.end||(n.on("end",s),n.on("close",u));var o=!1;function s(){o||(o=!0,t.end())}function u(){o||(o=!0,"function"==typeof t.destroy&&t.destroy())}function c(t){if(f(),0===r.listenerCount(this,"error"))throw t}function f(){n.removeListener("data",i),t.removeListener("drain",a),n.removeListener("end",s),n.removeListener("close",u),n.removeListener("error",c),t.removeListener("error",c),n.removeListener("end",f),n.removeListener("close",f),t.removeListener("close",f)}return n.on("error",c),t.on("error",c),n.on("end",f),n.on("close",f),t.on("close",f),t.emit("pipe",n),t}},function(t,e,n){"use strict";var r,i="object"==typeof Reflect?Reflect:null,a=i&&"function"==typeof i.apply?i.apply:function(t,e,n){return Function.prototype.apply.call(t,e,n)};r=i&&"function"==typeof i.ownKeys?i.ownKeys:Object.getOwnPropertySymbols?function(t){return Object.getOwnPropertyNames(t).concat(Object.getOwnPropertySymbols(t))}:function(t){return Object.getOwnPropertyNames(t)};var o=Number.isNaN||function(t){return t!=t};function s(){s.init.call(this)}t.exports=s,s.EventEmitter=s,s.prototype._events=void 0,s.prototype._eventsCount=0,s.prototype._maxListeners=void 0;var u=10;function c(t){if("function"!=typeof t)throw new TypeError('The "listener" argument must be of type Function. Received type '+typeof t)}function f(t){return void 0===t._maxListeners?s.defaultMaxListeners:t._maxListeners}function l(t,e,n,r){var i,a,o,s;if(c(n),void 0===(a=t._events)?(a=t._events=Object.create(null),t._eventsCount=0):(void 0!==a.newListener&&(t.emit("newListener",e,n.listener?n.listener:n),a=t._events),o=a[e]),void 0===o)o=a[e]=n,++t._eventsCount;else if("function"==typeof o?o=a[e]=r?[n,o]:[o,n]:r?o.unshift(n):o.push(n),(i=f(t))>0&&o.length>i&&!o.warned){o.warned=!0;var u=new Error("Possible EventEmitter memory leak detected. "+o.length+" "+String(e)+" listeners added. Use emitter.setMaxListeners() to increase limit");u.name="MaxListenersExceededWarning",u.emitter=t,u.type=e,u.count=o.length,s=u,console&&console.warn&&console.warn(s)}return t}function h(){if(!this.fired)return this.target.removeListener(this.type,this.wrapFn),this.fired=!0,0===arguments.length?this.listener.call(this.target):this.listener.apply(this.target,arguments)}function d(t,e,n){var r={fired:!1,wrapFn:void 0,target:t,type:e,listener:n},i=h.bind(r);return i.listener=n,r.wrapFn=i,i}function p(t,e,n){var r=t._events;if(void 0===r)return[];var i=r[e];return void 0===i?[]:"function"==typeof i?n?[i.listener||i]:[i]:n?function(t){for(var e=new Array(t.length),n=0;n<e.length;++n)e[n]=t[n].listener||t[n];return e}(i):y(i,i.length)}function g(t){var e=this._events;if(void 0!==e){var n=e[t];if("function"==typeof n)return 1;if(void 0!==n)return n.length}return 0}function y(t,e){for(var n=new Array(e),r=0;r<e;++r)n[r]=t[r];return n}Object.defineProperty(s,"defaultMaxListeners",{enumerable:!0,get:function(){return u},set:function(t){if("number"!=typeof t||t<0||o(t))throw new RangeError('The value of "defaultMaxListeners" is out of range. It must be a non-negative number. Received '+t+".");u=t}}),s.init=function(){void 0!==this._events&&this._events!==Object.getPrototypeOf(this)._events||(this._events=Object.create(null),this._eventsCount=0),this._maxListeners=this._maxListeners||void 0},s.prototype.setMaxListeners=function(t){if("number"!=typeof t||t<0||o(t))throw new RangeError('The value of "n" is out of range. It must be a non-negative number. Received '+t+".");return this._maxListeners=t,this},s.prototype.getMaxListeners=function(){return f(this)},s.prototype.emit=function(t){for(var e=[],n=1;n<arguments.length;n++)e.push(arguments[n]);var r="error"===t,i=this._events;if(void 0!==i)r=r&&void 0===i.error;else if(!r)return!1;if(r){var o;if(e.length>0&&(o=e[0]),o instanceof Error)throw o;var s=new Error("Unhandled error."+(o?" ("+o.message+")":""));throw s.context=o,s}var u=i[t];if(void 0===u)return!1;if("function"==typeof u)a(u,this,e);else{var c=u.length,f=y(u,c);for(n=0;n<c;++n)a(f[n],this,e)}return!0},s.prototype.addListener=function(t,e){return l(this,t,e,!1)},s.prototype.on=s.prototype.addListener,s.prototype.prependListener=function(t,e){return l(this,t,e,!0)},s.prototype.once=function(t,e){return c(e),this.on(t,d(this,t,e)),this},s.prototype.prependOnceListener=function(t,e){return c(e),this.prependListener(t,d(this,t,e)),this},s.prototype.removeListener=function(t,e){var n,r,i,a,o;if(c(e),void 0===(r=this._events))return this;if(void 0===(n=r[t]))return this;if(n===e||n.listener===e)0==--this._eventsCount?this._events=Object.create(null):(delete r[t],r.removeListener&&this.emit("removeListener",t,n.listener||e));else if("function"!=typeof n){for(i=-1,a=n.length-1;a>=0;a--)if(n[a]===e||n[a].listener===e){o=n[a].listener,i=a;break}if(i<0)return this;0===i?n.shift():function(t,e){for(;e+1<t.length;e++)t[e]=t[e+1];t.pop()}(n,i),1===n.length&&(r[t]=n[0]),void 0!==r.removeListener&&this.emit("removeListener",t,o||e)}return this},s.prototype.off=s.prototype.removeListener,s.prototype.removeAllListeners=function(t){var e,n,r;if(void 0===(n=this._events))return this;if(void 0===n.removeListener)return 0===arguments.length?(this._events=Object.create(null),this._eventsCount=0):void 0!==n[t]&&(0==--this._eventsCount?this._events=Object.create(null):delete n[t]),this;if(0===arguments.length){var i,a=Object.keys(n);for(r=0;r<a.length;++r)"removeListener"!==(i=a[r])&&this.removeAllListeners(i);return this.removeAllListeners("removeListener"),this._events=Object.create(null),this._eventsCount=0,this}if("function"==typeof(e=n[t]))this.removeListener(t,e);else if(void 0!==e)for(r=e.length-1;r>=0;r--)this.removeListener(t,e[r]);return this},s.prototype.listeners=function(t){return p(this,t,!0)},s.prototype.rawListeners=function(t){return p(this,t,!1)},s.listenerCount=function(t,e){return"function"==typeof t.listenerCount?t.listenerCount(e):g.call(t,e)},s.prototype.listenerCount=g,s.prototype.eventNames=function(){return this._eventsCount>0?r(this._events):[]}},function(t,e,n){(e=t.exports=n(193)).Stream=e,e.Readable=e,e.Writable=n(116),e.Duplex=n(35),e.Transform=n(196),e.PassThrough=n(429)},function(t,e,n){var r=n(8),i=r.Buffer;function a(t,e){for(var n in t)e[n]=t[n]}function o(t,e,n){return i(t,e,n)}i.from&&i.alloc&&i.allocUnsafe&&i.allocUnsafeSlow?t.exports=r:(a(r,e),e.Buffer=o),a(i,o),o.from=function(t,e,n){if("number"==typeof t)throw new TypeError("Argument must not be a number");return i(t,e,n)},o.alloc=function(t,e,n){if("number"!=typeof t)throw new TypeError("Argument must be a number");var r=i(t);return void 0!==e?"string"==typeof n?r.fill(e,n):r.fill(e):r.fill(0),r},o.allocUnsafe=function(t){if("number"!=typeof t)throw new TypeError("Argument must be a number");return i(t)},o.allocUnsafeSlow=function(t){if("number"!=typeof t)throw new TypeError("Argument must be a number");return r.SlowBuffer(t)}},function(t,e,n){"use strict";(function(e,r,i){var a=n(78);function o(t){var e=this;this.next=null,this.entry=null,this.finish=function(){!function(t,e,n){var r=t.entry;t.entry=null;for(;r;){var i=r.callback;e.pendingcb--,i(n),r=r.next}e.corkedRequestsFree?e.corkedRequestsFree.next=t:e.corkedRequestsFree=t}(e,t)}}t.exports=v;var s,u=!e.browser&&["v0.10","v0.9."].indexOf(e.version.slice(0,5))>-1?r:a.nextTick;v.WritableState=b;var c=Object.create(n(54));c.inherits=n(2);var f={deprecate:n(428)},l=n(194),h=n(115).Buffer,d=i.Uint8Array||function(){};var p,g=n(195);function y(){}function b(t,e){s=s||n(35),t=t||{};var r=e instanceof s;this.objectMode=!!t.objectMode,r&&(this.objectMode=this.objectMode||!!t.writableObjectMode);var i=t.highWaterMark,c=t.writableHighWaterMark,f=this.objectMode?16:16384;this.highWaterMark=i||0===i?i:r&&(c||0===c)?c:f,this.highWaterMark=Math.floor(this.highWaterMark),this.finalCalled=!1,this.needDrain=!1,this.ending=!1,this.ended=!1,this.finished=!1,this.destroyed=!1;var l=!1===t.decodeStrings;this.decodeStrings=!l,this.defaultEncoding=t.defaultEncoding||"utf8",this.length=0,this.writing=!1,this.corked=0,this.sync=!0,this.bufferProcessing=!1,this.onwrite=function(t){!function(t,e){var n=t._writableState,r=n.sync,i=n.writecb;if(function(t){t.writing=!1,t.writecb=null,t.length-=t.writelen,t.writelen=0}(n),e)!function(t,e,n,r,i){--e.pendingcb,n?(a.nextTick(i,r),a.nextTick(E,t,e),t._writableState.errorEmitted=!0,t.emit("error",r)):(i(r),t._writableState.errorEmitted=!0,t.emit("error",r),E(t,e))}(t,n,r,e,i);else{var o=x(n);o||n.corked||n.bufferProcessing||!n.bufferedRequest||w(t,n),r?u(_,t,n,o,i):_(t,n,o,i)}}(e,t)},this.writecb=null,this.writelen=0,this.bufferedRequest=null,this.lastBufferedRequest=null,this.pendingcb=0,this.prefinished=!1,this.errorEmitted=!1,this.bufferedRequestCount=0,this.corkedRequestsFree=new o(this)}function v(t){if(s=s||n(35),!(p.call(v,this)||this instanceof s))return new v(t);this._writableState=new b(t,this),this.writable=!0,t&&("function"==typeof t.write&&(this._write=t.write),"function"==typeof t.writev&&(this._writev=t.writev),"function"==typeof t.destroy&&(this._destroy=t.destroy),"function"==typeof t.final&&(this._final=t.final)),l.call(this)}function m(t,e,n,r,i,a,o){e.writelen=r,e.writecb=o,e.writing=!0,e.sync=!0,n?t._writev(i,e.onwrite):t._write(i,a,e.onwrite),e.sync=!1}function _(t,e,n,r){n||function(t,e){0===e.length&&e.needDrain&&(e.needDrain=!1,t.emit("drain"))}(t,e),e.pendingcb--,r(),E(t,e)}function w(t,e){e.bufferProcessing=!0;var n=e.bufferedRequest;if(t._writev&&n&&n.next){var r=e.bufferedRequestCount,i=new Array(r),a=e.corkedRequestsFree;a.entry=n;for(var s=0,u=!0;n;)i[s]=n,n.isBuf||(u=!1),n=n.next,s+=1;i.allBuffers=u,m(t,e,!0,e.length,i,"",a.finish),e.pendingcb++,e.lastBufferedRequest=null,a.next?(e.corkedRequestsFree=a.next,a.next=null):e.corkedRequestsFree=new o(e),e.bufferedRequestCount=0}else{for(;n;){var c=n.chunk,f=n.encoding,l=n.callback;if(m(t,e,!1,e.objectMode?1:c.length,c,f,l),n=n.next,e.bufferedRequestCount--,e.writing)break}null===n&&(e.lastBufferedRequest=null)}e.bufferedRequest=n,e.bufferProcessing=!1}function x(t){return t.ending&&0===t.length&&null===t.bufferedRequest&&!t.finished&&!t.writing}function k(t,e){t._final((function(n){e.pendingcb--,n&&t.emit("error",n),e.prefinished=!0,t.emit("prefinish"),E(t,e)}))}function E(t,e){var n=x(e);return n&&(!function(t,e){e.prefinished||e.finalCalled||("function"==typeof t._final?(e.pendingcb++,e.finalCalled=!0,a.nextTick(k,t,e)):(e.prefinished=!0,t.emit("prefinish")))}(t,e),0===e.pendingcb&&(e.finished=!0,t.emit("finish"))),n}c.inherits(v,l),b.prototype.getBuffer=function(){for(var t=this.bufferedRequest,e=[];t;)e.push(t),t=t.next;return e},function(){try{Object.defineProperty(b.prototype,"buffer",{get:f.deprecate((function(){return this.getBuffer()}),"_writableState.buffer is deprecated. Use _writableState.getBuffer instead.","DEP0003")})}catch(t){}}(),"function"==typeof Symbol&&Symbol.hasInstance&&"function"==typeof Function.prototype[Symbol.hasInstance]?(p=Function.prototype[Symbol.hasInstance],Object.defineProperty(v,Symbol.hasInstance,{value:function(t){return!!p.call(this,t)||this===v&&(t&&t._writableState instanceof b)}})):p=function(t){return t instanceof this},v.prototype.pipe=function(){this.emit("error",new Error("Cannot pipe, not readable"))},v.prototype.write=function(t,e,n){var r,i=this._writableState,o=!1,s=!i.objectMode&&(r=t,h.isBuffer(r)||r instanceof d);return s&&!h.isBuffer(t)&&(t=function(t){return h.from(t)}(t)),"function"==typeof e&&(n=e,e=null),s?e="buffer":e||(e=i.defaultEncoding),"function"!=typeof n&&(n=y),i.ended?function(t,e){var n=new Error("write after end");t.emit("error",n),a.nextTick(e,n)}(this,n):(s||function(t,e,n,r){var i=!0,o=!1;return null===n?o=new TypeError("May not write null values to stream"):"string"==typeof n||void 0===n||e.objectMode||(o=new TypeError("Invalid non-string/buffer chunk")),o&&(t.emit("error",o),a.nextTick(r,o),i=!1),i}(this,i,t,n))&&(i.pendingcb++,o=function(t,e,n,r,i,a){if(!n){var o=function(t,e,n){t.objectMode||!1===t.decodeStrings||"string"!=typeof e||(e=h.from(e,n));return e}(e,r,i);r!==o&&(n=!0,i="buffer",r=o)}var s=e.objectMode?1:r.length;e.length+=s;var u=e.length<e.highWaterMark;u||(e.needDrain=!0);if(e.writing||e.corked){var c=e.lastBufferedRequest;e.lastBufferedRequest={chunk:r,encoding:i,isBuf:n,callback:a,next:null},c?c.next=e.lastBufferedRequest:e.bufferedRequest=e.lastBufferedRequest,e.bufferedRequestCount+=1}else m(t,e,!1,s,r,i,a);return u}(this,i,s,t,e,n)),o},v.prototype.cork=function(){this._writableState.corked++},v.prototype.uncork=function(){var t=this._writableState;t.corked&&(t.corked--,t.writing||t.corked||t.finished||t.bufferProcessing||!t.bufferedRequest||w(this,t))},v.prototype.setDefaultEncoding=function(t){if("string"==typeof t&&(t=t.toLowerCase()),!(["hex","utf8","utf-8","ascii","binary","base64","ucs2","ucs-2","utf16le","utf-16le","raw"].indexOf((t+"").toLowerCase())>-1))throw new TypeError("Unknown encoding: "+t);return this._writableState.defaultEncoding=t,this},Object.defineProperty(v.prototype,"writableHighWaterMark",{enumerable:!1,get:function(){return this._writableState.highWaterMark}}),v.prototype._write=function(t,e,n){n(new Error("_write() is not implemented"))},v.prototype._writev=null,v.prototype.end=function(t,e,n){var r=this._writableState;"function"==typeof t?(n=t,t=null,e=null):"function"==typeof e&&(n=e,e=null),null!=t&&this.write(t,e),r.corked&&(r.corked=1,this.uncork()),r.ending||r.finished||function(t,e,n){e.ending=!0,E(t,e),n&&(e.finished?a.nextTick(n):t.once("finish",n));e.ended=!0,t.writable=!1}(this,r,n)},Object.defineProperty(v.prototype,"destroyed",{get:function(){return void 0!==this._writableState&&this._writableState.destroyed},set:function(t){this._writableState&&(this._writableState.destroyed=t)}}),v.prototype.destroy=g.destroy,v.prototype._undestroy=g.undestroy,v.prototype._destroy=function(t,e){this.end(),e(t)}}).call(this,n(7),n(426).setImmediate,n(12))},function(t,e,n){"use strict";var r=n(3).Buffer,i=r.isEncoding||function(t){switch((t=""+t)&&t.toLowerCase()){case"hex":case"utf8":case"utf-8":case"ascii":case"binary":case"base64":case"ucs2":case"ucs-2":case"utf16le":case"utf-16le":case"raw":return!0;default:return!1}};function a(t){var e;switch(this.encoding=function(t){var e=function(t){if(!t)return"utf8";for(var e;;)switch(t){case"utf8":case"utf-8":return"utf8";case"ucs2":case"ucs-2":case"utf16le":case"utf-16le":return"utf16le";case"latin1":case"binary":return"latin1";case"base64":case"ascii":case"hex":return t;default:if(e)return;t=(""+t).toLowerCase(),e=!0}}(t);if("string"!=typeof e&&(r.isEncoding===i||!i(t)))throw new Error("Unknown encoding: "+t);return e||t}(t),this.encoding){case"utf16le":this.text=u,this.end=c,e=4;break;case"utf8":this.fillLast=s,e=4;break;case"base64":this.text=f,this.end=l,e=3;break;default:return this.write=h,void(this.end=d)}this.lastNeed=0,this.lastTotal=0,this.lastChar=r.allocUnsafe(e)}function o(t){return t<=127?0:t>>5==6?2:t>>4==14?3:t>>3==30?4:t>>6==2?-1:-2}function s(t){var e=this.lastTotal-this.lastNeed,n=function(t,e,n){if(128!=(192&e[0]))return t.lastNeed=0,"�";if(t.lastNeed>1&&e.length>1){if(128!=(192&e[1]))return t.lastNeed=1,"�";if(t.lastNeed>2&&e.length>2&&128!=(192&e[2]))return t.lastNeed=2,"�"}}(this,t);return void 0!==n?n:this.lastNeed<=t.length?(t.copy(this.lastChar,e,0,this.lastNeed),this.lastChar.toString(this.encoding,0,this.lastTotal)):(t.copy(this.lastChar,e,0,t.length),void(this.lastNeed-=t.length))}function u(t,e){if((t.length-e)%2==0){var n=t.toString("utf16le",e);if(n){var r=n.charCodeAt(n.length-1);if(r>=55296&&r<=56319)return this.lastNeed=2,this.lastTotal=4,this.lastChar[0]=t[t.length-2],this.lastChar[1]=t[t.length-1],n.slice(0,-1)}return n}return this.lastNeed=1,this.lastTotal=2,this.lastChar[0]=t[t.length-1],t.toString("utf16le",e,t.length-1)}function c(t){var e=t&&t.length?this.write(t):"";if(this.lastNeed){var n=this.lastTotal-this.lastNeed;return e+this.lastChar.toString("utf16le",0,n)}return e}function f(t,e){var n=(t.length-e)%3;return 0===n?t.toString("base64",e):(this.lastNeed=3-n,this.lastTotal=3,1===n?this.lastChar[0]=t[t.length-1]:(this.lastChar[0]=t[t.length-2],this.lastChar[1]=t[t.length-1]),t.toString("base64",e,t.length-n))}function l(t){var e=t&&t.length?this.write(t):"";return this.lastNeed?e+this.lastChar.toString("base64",0,3-this.lastNeed):e}function h(t){return t.toString(this.encoding)}function d(t){return t&&t.length?this.write(t):""}e.StringDecoder=a,a.prototype.write=function(t){if(0===t.length)return"";var e,n;if(this.lastNeed){if(void 0===(e=this.fillLast(t)))return"";n=this.lastNeed,this.lastNeed=0}else n=0;return n<t.length?e?e+this.text(t,n):this.text(t,n):e||""},a.prototype.end=function(t){var e=t&&t.length?this.write(t):"";return this.lastNeed?e+"�":e},a.prototype.text=function(t,e){var n=function(t,e,n){var r=e.length-1;if(r<n)return 0;var i=o(e[r]);if(i>=0)return i>0&&(t.lastNeed=i-1),i;if(--r<n||-2===i)return 0;if((i=o(e[r]))>=0)return i>0&&(t.lastNeed=i-2),i;if(--r<n||-2===i)return 0;if((i=o(e[r]))>=0)return i>0&&(2===i?i=0:t.lastNeed=i-3),i;return 0}(this,t,e);if(!this.lastNeed)return t.toString("utf8",e);this.lastTotal=n;var r=t.length-(n-this.lastNeed);return t.copy(this.lastChar,0,r),t.toString("utf8",e,r)},a.prototype.fillLast=function(t){if(this.lastNeed<=t.length)return t.copy(this.lastChar,this.lastTotal-this.lastNeed,0,this.lastNeed),this.lastChar.toString(this.encoding,0,this.lastTotal);t.copy(this.lastChar,this.lastTotal-this.lastNeed,0,t.length),this.lastNeed-=t.length}},function(t,e,n){"use strict";var r=n(8).Buffer,i=n(2),a=n(192),o=new Array(16),s=[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,7,4,13,1,10,6,15,3,12,0,9,5,2,14,11,8,3,10,14,4,9,15,8,1,2,7,0,6,13,11,5,12,1,9,11,10,0,8,12,4,13,3,7,15,14,5,6,2,4,0,5,9,7,12,2,10,14,1,3,8,11,6,15,13],u=[5,14,7,0,9,2,11,4,13,6,15,8,1,10,3,12,6,11,3,7,0,13,5,10,14,15,8,12,4,9,1,2,15,5,1,3,7,14,6,9,11,8,12,2,10,0,4,13,8,6,4,1,3,11,15,0,5,12,2,13,9,7,10,14,12,15,10,4,1,5,8,7,6,2,13,14,0,3,9,11],c=[11,14,15,12,5,8,7,9,11,13,14,15,6,7,9,8,7,6,8,13,11,9,7,15,7,12,15,9,11,7,13,12,11,13,6,7,14,9,13,15,14,8,13,6,5,12,7,5,11,12,14,15,14,15,9,8,9,14,5,6,8,6,5,12,9,15,5,11,6,8,13,12,5,12,13,14,11,8,5,6],f=[8,9,9,11,13,15,15,5,7,7,8,11,14,14,12,6,9,13,15,7,12,8,9,11,7,7,12,7,6,15,13,11,9,7,15,11,8,6,6,14,12,13,5,14,13,13,7,5,15,5,8,11,14,14,6,14,6,9,12,9,12,5,15,8,8,5,12,9,12,5,14,6,8,13,6,5,15,13,11,11],l=[0,1518500249,1859775393,2400959708,2840853838],h=[1352829926,1548603684,1836072691,2053994217,0];function d(){a.call(this,64),this._a=1732584193,this._b=4023233417,this._c=2562383102,this._d=271733878,this._e=3285377520}function p(t,e){return t<<e|t>>>32-e}function g(t,e,n,r,i,a,o,s){return p(t+(e^n^r)+a+o|0,s)+i|0}function y(t,e,n,r,i,a,o,s){return p(t+(e&n|~e&r)+a+o|0,s)+i|0}function b(t,e,n,r,i,a,o,s){return p(t+((e|~n)^r)+a+o|0,s)+i|0}function v(t,e,n,r,i,a,o,s){return p(t+(e&r|n&~r)+a+o|0,s)+i|0}function m(t,e,n,r,i,a,o,s){return p(t+(e^(n|~r))+a+o|0,s)+i|0}i(d,a),d.prototype._update=function(){for(var t=o,e=0;e<16;++e)t[e]=this._block.readInt32LE(4*e);for(var n=0|this._a,r=0|this._b,i=0|this._c,a=0|this._d,d=0|this._e,_=0|this._a,w=0|this._b,x=0|this._c,k=0|this._d,E=0|this._e,A=0;A<80;A+=1){var S,M;A<16?(S=g(n,r,i,a,d,t[s[A]],l[0],c[A]),M=m(_,w,x,k,E,t[u[A]],h[0],f[A])):A<32?(S=y(n,r,i,a,d,t[s[A]],l[1],c[A]),M=v(_,w,x,k,E,t[u[A]],h[1],f[A])):A<48?(S=b(n,r,i,a,d,t[s[A]],l[2],c[A]),M=b(_,w,x,k,E,t[u[A]],h[2],f[A])):A<64?(S=v(n,r,i,a,d,t[s[A]],l[3],c[A]),M=y(_,w,x,k,E,t[u[A]],h[3],f[A])):(S=m(n,r,i,a,d,t[s[A]],l[4],c[A]),M=g(_,w,x,k,E,t[u[A]],h[4],f[A])),n=d,d=a,a=p(i,10),i=r,r=S,_=E,E=k,k=p(x,10),x=w,w=M}var T=this._b+i+k|0;this._b=this._c+a+E|0,this._c=this._d+d+_|0,this._d=this._e+n+w|0,this._e=this._a+r+x|0,this._a=T},d.prototype._digest=function(){this._block[this._blockOffset++]=128,this._blockOffset>56&&(this._block.fill(0,this._blockOffset,64),this._update(),this._blockOffset=0),this._block.fill(0,this._blockOffset,56),this._block.writeUInt32LE(this._length[0],56),this._block.writeUInt32LE(this._length[1],60),this._update();var t=r.alloc?r.alloc(20):new r(20);return t.writeInt32LE(this._a,0),t.writeInt32LE(this._b,4),t.writeInt32LE(this._c,8),t.writeInt32LE(this._d,12),t.writeInt32LE(this._e,16),t},t.exports=d},function(t,e,n){(e=t.exports=function(t){t=t.toLowerCase();var n=e[t];if(!n)throw new Error(t+" is not supported (we accept pull requests)");return new n}).sha=n(434),e.sha1=n(435),e.sha224=n(436),e.sha256=n(197),e.sha384=n(437),e.sha512=n(198)},function(t,e,n){"use strict";var r=n(16);function i(t){this.options=t,this.type=this.options.type,this.blockSize=8,this._init(),this.buffer=new Array(this.blockSize),this.bufferOff=0}t.exports=i,i.prototype._init=function(){},i.prototype.update=function(t){return 0===t.length?[]:"decrypt"===this.type?this._updateDecrypt(t):this._updateEncrypt(t)},i.prototype._buffer=function(t,e){for(var n=Math.min(this.buffer.length-this.bufferOff,t.length-e),r=0;r<n;r++)this.buffer[this.bufferOff+r]=t[e+r];return this.bufferOff+=n,n},i.prototype._flushBuffer=function(t,e){return this._update(this.buffer,0,t,e),this.bufferOff=0,this.blockSize},i.prototype._updateEncrypt=function(t){var e=0,n=0,r=(this.bufferOff+t.length)/this.blockSize|0,i=new Array(r*this.blockSize);0!==this.bufferOff&&(e+=this._buffer(t,e),this.bufferOff===this.buffer.length&&(n+=this._flushBuffer(i,n)));for(var a=t.length-(t.length-e)%this.blockSize;e<a;e+=this.blockSize)this._update(t,e,i,n),n+=this.blockSize;for(;e<t.length;e++,this.bufferOff++)this.buffer[this.bufferOff]=t[e];return i},i.prototype._updateDecrypt=function(t){for(var e=0,n=0,r=Math.ceil((this.bufferOff+t.length)/this.blockSize)-1,i=new Array(r*this.blockSize);r>0;r--)e+=this._buffer(t,e),n+=this._flushBuffer(i,n);return e+=this._buffer(t,e),i},i.prototype.final=function(t){var e,n;return t&&(e=this.update(t)),n="encrypt"===this.type?this._finalEncrypt():this._finalDecrypt(),e?e.concat(n):n},i.prototype._pad=function(t,e){if(0===e)return!1;for(;e<t.length;)t[e++]=0;return!0},i.prototype._finalEncrypt=function(){if(!this._pad(this.buffer,this.bufferOff))return[];var t=new Array(this.blockSize);return this._update(this.buffer,0,t,0),t},i.prototype._unpad=function(t){return t},i.prototype._finalDecrypt=function(){r.equal(this.bufferOff,this.blockSize,"Not enough data to decrypt");var t=new Array(this.blockSize);return this._flushBuffer(t,0),this._unpad(t)}},function(t,e,n){var r=n(446),i=n(454),a=n(210);e.createCipher=e.Cipher=r.createCipher,e.createCipheriv=e.Cipheriv=r.createCipheriv,e.createDecipher=e.Decipher=i.createDecipher,e.createDecipheriv=e.Decipheriv=i.createDecipheriv,e.listCiphers=e.getCiphers=function(){return Object.keys(a)}},function(t,e,n){var r={ECB:n(447),CBC:n(448),CFB:n(449),CFB8:n(450),CFB1:n(451),OFB:n(452),CTR:n(208),GCM:n(208)},i=n(210);for(var a in i)i[a].module=r[i[a].mode];t.exports=i},function(t,e,n){var r;function i(t){this.rand=t}if(t.exports=function(t){return r||(r=new i(null)),r.generate(t)},t.exports.Rand=i,i.prototype.generate=function(t){return this._rand(t)},i.prototype._rand=function(t){if(this.rand.getBytes)return this.rand.getBytes(t);for(var e=new Uint8Array(t),n=0;n<e.length;n++)e[n]=this.rand.getByte();return e},"object"==typeof self)self.crypto&&self.crypto.getRandomValues?i.prototype._rand=function(t){var e=new Uint8Array(t);return self.crypto.getRandomValues(e),e}:self.msCrypto&&self.msCrypto.getRandomValues?i.prototype._rand=function(t){var e=new Uint8Array(t);return self.msCrypto.getRandomValues(e),e}:"object"==typeof window&&(i.prototype._rand=function(){throw new Error("Not implemented yet")});else try{var a=n(458);if("function"!=typeof a.randomBytes)throw new Error("Not supported");i.prototype._rand=function(t){return a.randomBytes(t)}}catch(t){}},function(t,e,n){(function(e){var r=n(5),i=n(44);function a(t,n){var i=function(t){var e=o(t);return{blinder:e.toRed(r.mont(t.modulus)).redPow(new r(t.publicExponent)).fromRed(),unblinder:e.invm(t.modulus)}}(n),a=n.modulus.byteLength(),s=(r.mont(n.modulus),new r(t).mul(i.blinder).umod(n.modulus)),u=s.toRed(r.mont(n.prime1)),c=s.toRed(r.mont(n.prime2)),f=n.coefficient,l=n.prime1,h=n.prime2,d=u.redPow(n.exponent1),p=c.redPow(n.exponent2);d=d.fromRed(),p=p.fromRed();var g=d.isub(p).imul(f).umod(l);return g.imul(h),p.iadd(g),new e(p.imul(i.unblinder).umod(n.modulus).toArray(!1,a))}function o(t){for(var e=t.modulus.byteLength(),n=new r(i(e));n.cmp(t.modulus)>=0||!n.umod(t.prime1)||!n.umod(t.prime2);)n=new r(i(e));return n}t.exports=a,a.getr=o}).call(this,n(8).Buffer)},function(t,e,n){"use strict";var r=e;r.version=n(463).version,r.utils=n(17),r.rand=n(123),r.curve=n(216),r.curves=n(126),r.ec=n(474),r.eddsa=n(478)},function(t,e,n){"use strict";var r,i=e,a=n(127),o=n(216),s=n(17).assert;function u(t){"short"===t.type?this.curve=new o.short(t):"edwards"===t.type?this.curve=new o.edwards(t):this.curve=new o.mont(t),this.g=this.curve.g,this.n=this.curve.n,this.hash=t.hash,s(this.g.validate(),"Invalid curve"),s(this.g.mul(this.n).isInfinity(),"Invalid curve, G*N != O")}function c(t,e){Object.defineProperty(i,t,{configurable:!0,enumerable:!0,get:function(){var n=new u(e);return Object.defineProperty(i,t,{configurable:!0,enumerable:!0,value:n}),n}})}i.PresetCurve=u,c("p192",{type:"short",prime:"p192",p:"ffffffff ffffffff ffffffff fffffffe ffffffff ffffffff",a:"ffffffff ffffffff ffffffff fffffffe ffffffff fffffffc",b:"64210519 e59c80e7 0fa7e9ab 72243049 feb8deec c146b9b1",n:"ffffffff ffffffff ffffffff 99def836 146bc9b1 b4d22831",hash:a.sha256,gRed:!1,g:["188da80e b03090f6 7cbf20eb 43a18800 f4ff0afd 82ff1012","07192b95 ffc8da78 631011ed 6b24cdd5 73f977a1 1e794811"]}),c("p224",{type:"short",prime:"p224",p:"ffffffff ffffffff ffffffff ffffffff 00000000 00000000 00000001",a:"ffffffff ffffffff ffffffff fffffffe ffffffff ffffffff fffffffe",b:"b4050a85 0c04b3ab f5413256 5044b0b7 d7bfd8ba 270b3943 2355ffb4",n:"ffffffff ffffffff ffffffff ffff16a2 e0b8f03e 13dd2945 5c5c2a3d",hash:a.sha256,gRed:!1,g:["b70e0cbd 6bb4bf7f 321390b9 4a03c1d3 56c21122 343280d6 115c1d21","bd376388 b5f723fb 4c22dfe6 cd4375a0 5a074764 44d58199 85007e34"]}),c("p256",{type:"short",prime:null,p:"ffffffff 00000001 00000000 00000000 00000000 ffffffff ffffffff ffffffff",a:"ffffffff 00000001 00000000 00000000 00000000 ffffffff ffffffff fffffffc",b:"5ac635d8 aa3a93e7 b3ebbd55 769886bc 651d06b0 cc53b0f6 3bce3c3e 27d2604b",n:"ffffffff 00000000 ffffffff ffffffff bce6faad a7179e84 f3b9cac2 fc632551",hash:a.sha256,gRed:!1,g:["6b17d1f2 e12c4247 f8bce6e5 63a440f2 77037d81 2deb33a0 f4a13945 d898c296","4fe342e2 fe1a7f9b 8ee7eb4a 7c0f9e16 2bce3357 6b315ece cbb64068 37bf51f5"]}),c("p384",{type:"short",prime:null,p:"ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff fffffffe ffffffff 00000000 00000000 ffffffff",a:"ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff fffffffe ffffffff 00000000 00000000 fffffffc",b:"b3312fa7 e23ee7e4 988e056b e3f82d19 181d9c6e fe814112 0314088f 5013875a c656398d 8a2ed19d 2a85c8ed d3ec2aef",n:"ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff c7634d81 f4372ddf 581a0db2 48b0a77a ecec196a ccc52973",hash:a.sha384,gRed:!1,g:["aa87ca22 be8b0537 8eb1c71e f320ad74 6e1d3b62 8ba79b98 59f741e0 82542a38 5502f25d bf55296c 3a545e38 72760ab7","3617de4a 96262c6f 5d9e98bf 9292dc29 f8f41dbd 289a147c e9da3113 b5f0b8c0 0a60b1ce 1d7e819d 7a431d7c 90ea0e5f"]}),c("p521",{type:"short",prime:null,p:"000001ff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff",a:"000001ff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff fffffffc",b:"00000051 953eb961 8e1c9a1f 929a21a0 b68540ee a2da725b 99b315f3 b8b48991 8ef109e1 56193951 ec7e937b 1652c0bd 3bb1bf07 3573df88 3d2c34f1 ef451fd4 6b503f00",n:"000001ff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff fffffffa 51868783 bf2f966b 7fcc0148 f709a5d0 3bb5c9b8 899c47ae bb6fb71e 91386409",hash:a.sha512,gRed:!1,g:["000000c6 858e06b7 0404e9cd 9e3ecb66 2395b442 9c648139 053fb521 f828af60 6b4d3dba a14b5e77 efe75928 fe1dc127 a2ffa8de 3348b3c1 856a429b f97e7e31 c2e5bd66","00000118 39296a78 9a3bc004 5c8a5fb4 2c7d1bd9 98f54449 579b4468 17afbd17 273e662c 97ee7299 5ef42640 c550b901 3fad0761 353c7086 a272c240 88be9476 9fd16650"]}),c("curve25519",{type:"mont",prime:"p25519",p:"7fffffffffffffff ffffffffffffffff ffffffffffffffff ffffffffffffffed",a:"76d06",b:"1",n:"1000000000000000 0000000000000000 14def9dea2f79cd6 5812631a5cf5d3ed",hash:a.sha256,gRed:!1,g:["9"]}),c("ed25519",{type:"edwards",prime:"p25519",p:"7fffffffffffffff ffffffffffffffff ffffffffffffffff ffffffffffffffed",a:"-1",c:"1",d:"52036cee2b6ffe73 8cc740797779e898 00700a4d4141d8ab 75eb4dca135978a3",n:"1000000000000000 0000000000000000 14def9dea2f79cd6 5812631a5cf5d3ed",hash:a.sha256,gRed:!1,g:["216936d3cd6e53fec0a4e231fdd6dc5c692cc7609525a7b2c9562d608f25d51a","6666666666666666666666666666666666666666666666666666666666666658"]});try{r=n(473)}catch(t){r=void 0}c("secp256k1",{type:"short",prime:"k256",p:"ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff fffffffe fffffc2f",a:"0",b:"7",n:"ffffffff ffffffff ffffffff fffffffe baaedce6 af48a03b bfd25e8c d0364141",h:"1",hash:a.sha256,beta:"7ae96a2b657c07106e64479eac3434e99cf0497512f58995c1396c28719501ee",lambda:"5363ad4cc05c30e0a5261c028812645a122e22ea20816678df02967c1b23bd72",basis:[{a:"3086d221a7d46bcde86c90e49284eb15",b:"-e4437ed6010e88286f547fa90abfe4c3"},{a:"114ca50f7a8e2f3f657c1108d9d44cfd8",b:"3086d221a7d46bcde86c90e49284eb15"}],gRed:!1,g:["79be667ef9dcbbac55a06295ce870b07029bfcdb2dce28d959f2815b16f81798","483ada7726a3c4655da4fbfc0e1108a8fd17b448a68554199c47d08ffb10d4b8",r]})},function(t,e,n){var r=e;r.utils=n(21),r.common=n(56),r.sha=n(467),r.ripemd=n(471),r.hmac=n(472),r.sha1=r.sha.sha1,r.sha256=r.sha.sha256,r.sha224=r.sha.sha224,r.sha384=r.sha.sha384,r.sha512=r.sha.sha512,r.ripemd160=r.ripemd.ripemd160},function(t,e,n){var r=n(15);t.exports=function(t,e){var n=t.append("foreignObject").attr("width","100000"),i=n.append("xhtml:div");i.attr("xmlns","http://www.w3.org/1999/xhtml");var a=e.label;switch(typeof a){case"function":i.insert(a);break;case"object":i.insert((function(){return a}));break;default:i.html(a)}r.applyStyle(i,e.labelStyle),i.style("display","inline-block"),i.style("white-space","nowrap");var o=i.node().getBoundingClientRect();return n.attr("width",o.width).attr("height",o.height),n}},function(t,e){},function(t,e,n){var r=n(61),i=n(92),a=n(66),o=n(266),s=n(272),u=n(136),c=n(137),f=n(275),l=n(276),h=n(141),d=n(277),p=n(41),g=n(281),y=n(282),b=n(146),v=n(6),m=n(39),_=n(286),w=n(14),x=n(288),k=n(27),E={};E["[object Arguments]"]=E["[object Array]"]=E["[object ArrayBuffer]"]=E["[object DataView]"]=E["[object Boolean]"]=E["[object Date]"]=E["[object Float32Array]"]=E["[object Float64Array]"]=E["[object Int8Array]"]=E["[object Int16Array]"]=E["[object Int32Array]"]=E["[object Map]"]=E["[object Number]"]=E["[object Object]"]=E["[object RegExp]"]=E["[object Set]"]=E["[object String]"]=E["[object Symbol]"]=E["[object Uint8Array]"]=E["[object Uint8ClampedArray]"]=E["[object Uint16Array]"]=E["[object Uint32Array]"]=!0,E["[object Error]"]=E["[object Function]"]=E["[object WeakMap]"]=!1,t.exports=function t(e,n,A,S,M,T){var D,C=1&n,N=2&n,I=4&n;if(A&&(D=M?A(e,S,M,T):A(e)),void 0!==D)return D;if(!w(e))return e;var L=v(e);if(L){if(D=g(e),!C)return c(e,D)}else{var B=p(e),O="[object Function]"==B||"[object GeneratorFunction]"==B;if(m(e))return u(e,C);if("[object Object]"==B||"[object Arguments]"==B||O&&!M){if(D=N||O?{}:b(e),!C)return N?l(e,s(D,e)):f(e,o(D,e))}else{if(!E[B])return M?e:{};D=y(e,B,C)}}T||(T=new r);var R=T.get(e);if(R)return R;T.set(e,D),x(e)?e.forEach((function(r){D.add(t(r,n,A,r,e,T))})):_(e)&&e.forEach((function(r,i){D.set(i,t(r,n,A,i,e,T))}));var P=I?N?d:h:N?keysIn:k,F=L?void 0:P(e);return i(F||e,(function(r,i){F&&(r=e[i=r]),a(D,i,t(r,n,A,i,e,T))})),D}},function(t,e,n){(function(e){var n="object"==typeof e&&e&&e.Object===Object&&e;t.exports=n}).call(this,n(12))},function(t,e){var n=Function.prototype.toString;t.exports=function(t){if(null!=t){try{return n.call(t)}catch(t){}try{return t+""}catch(t){}}return""}},function(t,e,n){var r=n(32),i=function(){try{var t=r(Object,"defineProperty");return t({},"",{}),t}catch(t){}}();t.exports=i},function(t,e,n){var r=n(267),i=n(50),a=n(6),o=n(39),s=n(68),u=n(51),c=Object.prototype.hasOwnProperty;t.exports=function(t,e){var n=a(t),f=!n&&i(t),l=!n&&!f&&o(t),h=!n&&!f&&!l&&u(t),d=n||f||l||h,p=d?r(t.length,String):[],g=p.length;for(var y in t)!e&&!c.call(t,y)||d&&("length"==y||l&&("offset"==y||"parent"==y)||h&&("buffer"==y||"byteLength"==y||"byteOffset"==y)||s(y,g))||p.push(y);return p}},function(t,e){t.exports=function(t,e){return function(n){return t(e(n))}}},function(t,e,n){(function(t){var r=n(18),i=e&&!e.nodeType&&e,a=i&&"object"==typeof t&&t&&!t.nodeType&&t,o=a&&a.exports===i?r.Buffer:void 0,s=o?o.allocUnsafe:void 0;t.exports=function(t,e){if(e)return t.slice();var n=t.length,r=s?s(n):new t.constructor(n);return t.copy(r),r}}).call(this,n(9)(t))},function(t,e){t.exports=function(t,e){var n=-1,r=t.length;for(e||(e=Array(r));++n<r;)e[n]=t[n];return e}},function(t,e){t.exports=function(t,e){for(var n=-1,r=null==t?0:t.length,i=0,a=[];++n<r;){var o=t[n];e(o,n,t)&&(a[i++]=o)}return a}},function(t,e){t.exports=function(){return[]}},function(t,e,n){var r=n(97),i=n(71),a=n(96),o=n(139),s=Object.getOwnPropertySymbols?function(t){for(var e=[];t;)r(e,a(t)),t=i(t);return e}:o;t.exports=s},function(t,e,n){var r=n(142),i=n(96),a=n(27);t.exports=function(t){return r(t,a,i)}},function(t,e,n){var r=n(97),i=n(6);t.exports=function(t,e,n){var a=e(t);return i(t)?a:r(a,n(t))}},function(t,e,n){var r=n(32)(n(18),"Set");t.exports=r},function(t,e,n){var r=n(18).Uint8Array;t.exports=r},function(t,e,n){var r=n(98);t.exports=function(t,e){var n=e?r(t.buffer):t.buffer;return new t.constructor(n,t.byteOffset,t.length)}},function(t,e,n){var r=n(147),i=n(71),a=n(70);t.exports=function(t){return"function"!=typeof t.constructor||a(t)?{}:r(i(t))}},function(t,e,n){var r=n(14),i=Object.create,a=function(){function t(){}return function(e){if(!r(e))return{};if(i)return i(e);t.prototype=e;var n=new t;return t.prototype=void 0,n}}();t.exports=a},function(t,e,n){var r=n(92),i=n(72),a=n(149),o=n(6);t.exports=function(t,e){return(o(t)?r:i)(t,a(e))}},function(t,e,n){var r=n(34);t.exports=function(t){return"function"==typeof t?t:r}},function(t,e,n){var r=n(138),i=n(292),a=n(24),o=n(6);t.exports=function(t,e){return(o(t)?r:i)(t,a(e,3))}},function(t,e,n){var r=n(295),i=n(20);t.exports=function t(e,n,a,o,s){return e===n||(null==e||null==n||!i(e)&&!i(n)?e!=e&&n!=n:r(e,n,a,o,t,s))}},function(t,e,n){var r=n(153),i=n(298),a=n(154);t.exports=function(t,e,n,o,s,u){var c=1&n,f=t.length,l=e.length;if(f!=l&&!(c&&l>f))return!1;var h=u.get(t);if(h&&u.get(e))return h==e;var d=-1,p=!0,g=2&n?new r:void 0;for(u.set(t,e),u.set(e,t);++d<f;){var y=t[d],b=e[d];if(o)var v=c?o(b,y,d,e,t,u):o(y,b,d,t,e,u);if(void 0!==v){if(v)continue;p=!1;break}if(g){if(!i(e,(function(t,e){if(!a(g,e)&&(y===t||s(y,t,n,o,u)))return g.push(e)}))){p=!1;break}}else if(y!==b&&!s(y,b,n,o,u)){p=!1;break}}return u.delete(t),u.delete(e),p}},function(t,e,n){var r=n(91),i=n(296),a=n(297);function o(t){var e=-1,n=null==t?0:t.length;for(this.__data__=new r;++e<n;)this.add(t[e])}o.prototype.add=o.prototype.push=i,o.prototype.has=a,t.exports=o},function(t,e){t.exports=function(t,e){return t.has(e)}},function(t,e,n){var r=n(14);t.exports=function(t){return t==t&&!r(t)}},function(t,e){t.exports=function(t,e){return function(n){return null!=n&&(n[t]===e&&(void 0!==e||t in Object(n)))}}},function(t,e,n){var r=n(308);t.exports=function(t){return null==t?"":r(t)}},function(t,e,n){var r=n(309),i=n(159);t.exports=function(t,e){return null!=t&&i(t,e,r)}},function(t,e,n){var r=n(73),i=n(50),a=n(6),o=n(68),s=n(93),u=n(52);t.exports=function(t,e,n){for(var c=-1,f=(e=r(e,t)).length,l=!1;++c<f;){var h=u(e[c]);if(!(l=null!=t&&n(t,h)))break;t=t[h]}return l||++c!=f?l:!!(f=null==t?0:t.length)&&s(f)&&o(h,f)&&(a(t)||i(t))}},function(t,e){t.exports=function(t){return function(e){return null==e?void 0:e[t]}}},function(t,e){t.exports=function(t){return void 0===t}},function(t,e,n){var r=n(74),i=n(24),a=n(163),o=n(6);t.exports=function(t,e){return(o(t)?r:a)(t,i(e,3))}},function(t,e,n){var r=n(72),i=n(23);t.exports=function(t,e){var n=-1,a=i(t)?Array(t.length):[];return r(t,(function(t,r,i){a[++n]=e(t,r,i)})),a}},function(t,e,n){var r=n(314),i=n(72),a=n(24),o=n(315),s=n(6);t.exports=function(t,e,n){var u=s(t)?r:o,c=arguments.length<3;return u(t,a(e,4),n,c,i)}},function(t,e,n){var r=n(325),i=Math.max;t.exports=function(t,e,n){return e=i(void 0===e?t.length-1:e,0),function(){for(var a=arguments,o=-1,s=i(a.length-e,0),u=Array(s);++o<s;)u[o]=a[e+o];o=-1;for(var c=Array(e+1);++o<e;)c[o]=a[o];return c[e]=n(u),r(t,this,c)}}},function(t,e,n){var r=n(326),i=n(327)(r);t.exports=i},function(t,e){t.exports=function(t,e,n,r){for(var i=t.length,a=n+(r?1:-1);r?a--:++a<i;)if(e(t[a],a,t))return a;return-1}},function(t,e,n){var r=n(23),i=n(20);t.exports=function(t){return i(t)&&r(t)}},function(t,e,n){var r=n(336),i=n(27);t.exports=function(t){return null==t?[]:r(t,i(t))}},function(t,e,n){var r=n(13),i=n(171);t.exports=function(t,e,n,r){return function(t,e,n,r){var a,o,s={},u=new i,c=function(t){var e=t.v!==a?t.v:t.w,r=s[e],i=n(t),c=o.distance+i;if(i<0)throw new Error("dijkstra does not allow negative edge weights. Bad edge: "+t+" Weight: "+i);c<r.distance&&(r.distance=c,r.predecessor=a,u.decrease(e,c))};t.nodes().forEach((function(t){var n=t===e?0:Number.POSITIVE_INFINITY;s[t]={distance:n},u.add(t,n)}));for(;u.size()>0&&(a=u.removeMin(),(o=s[a]).distance!==Number.POSITIVE_INFINITY);)r(a).forEach(c);return s}(t,String(e),n||a,r||function(e){return t.outEdges(e)})};var a=r.constant(1)},function(t,e,n){var r=n(13);function i(){this._arr=[],this._keyIndices={}}t.exports=i,i.prototype.size=function(){return this._arr.length},i.prototype.keys=function(){return this._arr.map((function(t){return t.key}))},i.prototype.has=function(t){return r.has(this._keyIndices,t)},i.prototype.priority=function(t){var e=this._keyIndices[t];if(void 0!==e)return this._arr[e].priority},i.prototype.min=function(){if(0===this.size())throw new Error("Queue underflow");return this._arr[0].key},i.prototype.add=function(t,e){var n=this._keyIndices;if(t=String(t),!r.has(n,t)){var i=this._arr,a=i.length;return n[t]=a,i.push({key:t,priority:e}),this._decrease(a),!0}return!1},i.prototype.removeMin=function(){this._swap(0,this._arr.length-1);var t=this._arr.pop();return delete this._keyIndices[t.key],this._heapify(0),t.key},i.prototype.decrease=function(t,e){var n=this._keyIndices[t];if(e>this._arr[n].priority)throw new Error("New priority is greater than current priority. Key: "+t+" Old: "+this._arr[n].priority+" New: "+e);this._arr[n].priority=e,this._decrease(n)},i.prototype._heapify=function(t){var e=this._arr,n=2*t,r=n+1,i=t;n<e.length&&(i=e[n].priority<e[i].priority?n:i,r<e.length&&(i=e[r].priority<e[i].priority?r:i),i!==t&&(this._swap(t,i),this._heapify(i)))},i.prototype._decrease=function(t){for(var e,n=this._arr,r=n[t].priority;0!==t&&!(n[e=t>>1].priority<r);)this._swap(t,e),t=e},i.prototype._swap=function(t,e){var n=this._arr,r=this._keyIndices,i=n[t],a=n[e];n[t]=a,n[e]=i,r[a.key]=t,r[i.key]=e}},function(t,e,n){var r=n(13);t.exports=function(t){var e=0,n=[],i={},a=[];return t.nodes().forEach((function(o){r.has(i,o)||function o(s){var u=i[s]={onStack:!0,lowlink:e,index:e++};if(n.push(s),t.successors(s).forEach((function(t){r.has(i,t)?i[t].onStack&&(u.lowlink=Math.min(u.lowlink,i[t].index)):(o(t),u.lowlink=Math.min(u.lowlink,i[t].lowlink))})),u.lowlink===u.index){var c,f=[];do{c=n.pop(),i[c].onStack=!1,f.push(c)}while(s!==c);a.push(f)}}(o)})),a}},function(t,e,n){var r=n(13);function i(t){var e={},n={},i=[];if(r.each(t.sinks(),(function o(s){if(r.has(n,s))throw new a;r.has(e,s)||(n[s]=!0,e[s]=!0,r.each(t.predecessors(s),o),delete n[s],i.push(s))})),r.size(e)!==t.nodeCount())throw new a;return i}function a(){}t.exports=i,i.CycleException=a,a.prototype=new Error},function(t,e,n){var r=n(13);t.exports=function(t,e,n){r.isArray(e)||(e=[e]);var i=(t.isDirected()?t.successors:t.neighbors).bind(t),a=[],o={};return r.each(e,(function(e){if(!t.hasNode(e))throw new Error("Graph does not have node: "+e);!function t(e,n,i,a,o,s){r.has(a,n)||(a[n]=!0,i||s.push(n),r.each(o(n),(function(n){t(e,n,i,a,o,s)})),i&&s.push(n))}(t,e,"post"===n,o,i,a)})),a}},function(t,e,n){var r;try{r=n(59)}catch(t){}r||(r=window.dagre),t.exports=r},function(t,e,n){var r=n(75),i=n(36),a=n(76),o=n(40),s=Object.prototype,u=s.hasOwnProperty,c=r((function(t,e){t=Object(t);var n=-1,r=e.length,c=r>2?e[2]:void 0;for(c&&a(e[0],e[1],c)&&(r=1);++n<r;)for(var f=e[n],l=o(f),h=-1,d=l.length;++h<d;){var p=l[h],g=t[p];(void 0===g||i(g,s[p])&&!u.call(t,p))&&(t[p]=f[p])}return t}));t.exports=c},function(t,e,n){var r=n(355);t.exports=function(t){return t?(t=r(t))===1/0||t===-1/0?17976931348623157e292*(t<0?-1:1):t==t?t:0:0===t?t:0}},function(t,e,n){var r=n(107);t.exports=function(t){return(null==t?0:t.length)?r(t,1):[]}},function(t,e,n){var r=n(67),i=n(36);t.exports=function(t,e,n){(void 0===n||i(t[e],n))&&(void 0!==n||e in t)||r(t,e,n)}},function(t,e,n){var r=n(33),i=n(71),a=n(20),o=Function.prototype,s=Object.prototype,u=o.toString,c=s.hasOwnProperty,f=u.call(Object);t.exports=function(t){if(!a(t)||"[object Object]"!=r(t))return!1;var e=i(t);if(null===e)return!0;var n=c.call(e,"constructor")&&e.constructor;return"function"==typeof n&&n instanceof n&&u.call(n)==f}},function(t,e){t.exports=function(t,e){if(("constructor"!==e||"function"!=typeof t[e])&&"__proto__"!=e)return t[e]}},function(t,e){t.exports=function(t,e){return t<e}},function(t,e,n){var r=n(369),i=n(372)((function(t,e){return null==t?{}:r(t,e)}));t.exports=i},function(t,e,n){var r=n(373)();t.exports=r},function(t,e,n){var r=n(157),i=0;t.exports=function(t){var e=++i;return r(t)+e}},function(t,e,n){"use strict";var r=n(4),i=n(19).Graph,a=n(77).slack;function o(t,e){return r.forEach(t.nodes(),(function n(i){r.forEach(e.nodeEdges(i),(function(r){var o=r.v,s=i===o?r.w:o;t.hasNode(s)||a(e,r)||(t.setNode(s,{}),t.setEdge(i,s,{}),n(s))}))})),t.nodeCount()}function s(t,e){return r.minBy(e.edges(),(function(n){if(t.hasNode(n.v)!==t.hasNode(n.w))return a(e,n)}))}function u(t,e,n){r.forEach(t.nodes(),(function(t){e.node(t).rank+=n}))}t.exports=function(t){var e,n,r=new i({directed:!1}),c=t.nodes()[0],f=t.nodeCount();r.setNode(c,{});for(;o(r,t)<f;)e=s(r,t),n=r.hasNode(e.v)?a(t,e):-a(t,e),u(r,t,n);return r}},function(t,e){t.exports=function(t,e){return t.intersect(e)}},function(t,e,n){var r=n(109);t.exports=function(t,e,n){return r(t,e,e,n)}},function(t,e,n){var r=n(406);t.exports=function(t,e,n){var i=t.x,a=t.y,o=[],s=Number.POSITIVE_INFINITY,u=Number.POSITIVE_INFINITY;e.forEach((function(t){s=Math.min(s,t.x),u=Math.min(u,t.y)}));for(var c=i-t.width/2-s,f=a-t.height/2-u,l=0;l<e.length;l++){var h=e[l],d=e[l<e.length-1?l+1:0],p=r(t,n,{x:c+h.x,y:f+h.y},{x:c+d.x,y:f+d.y});p&&o.push(p)}if(!o.length)return console.log("NO INTERSECTION FOUND, RETURN NODE CENTER",t),t;o.length>1&&o.sort((function(t,e){var r=t.x-n.x,i=t.y-n.y,a=Math.sqrt(r*r+i*i),o=e.x-n.x,s=e.y-n.y,u=Math.sqrt(o*o+s*s);return a<u?-1:a===u?0:1}));return o[0]}},function(t,e){t.exports=function(t,e){var n,r,i=t.x,a=t.y,o=e.x-i,s=e.y-a,u=t.width/2,c=t.height/2;Math.abs(s)*u>Math.abs(o)*c?(s<0&&(c=-c),n=0===s?0:c*o/s,r=c):(o<0&&(u=-u),n=u,r=0===o?0:u*s/o);return{x:i+n,y:a+r}}},function(t,e){var n={}.toString;t.exports=Array.isArray||function(t){return"[object Array]"==n.call(t)}},function(t,e,n){"use strict";var r=n(3).Buffer,i=n(112).Transform;function a(t){i.call(this),this._block=r.allocUnsafe(t),this._blockSize=t,this._blockOffset=0,this._length=[0,0,0,0],this._finalized=!1}n(2)(a,i),a.prototype._transform=function(t,e,n){var r=null;try{this.update(t,e)}catch(t){r=t}n(r)},a.prototype._flush=function(t){var e=null;try{this.push(this.digest())}catch(t){e=t}t(e)},a.prototype.update=function(t,e){if(function(t,e){if(!r.isBuffer(t)&&"string"!=typeof t)throw new TypeError(e+" must be a string or a buffer")}(t,"Data"),this._finalized)throw new Error("Digest already called");r.isBuffer(t)||(t=r.from(t,e));for(var n=this._block,i=0;this._blockOffset+t.length-i>=this._blockSize;){for(var a=this._blockOffset;a<this._blockSize;)n[a++]=t[i++];this._update(),this._blockOffset=0}for(;i<t.length;)n[this._blockOffset++]=t[i++];for(var o=0,s=8*t.length;s>0;++o)this._length[o]+=s,(s=this._length[o]/4294967296|0)>0&&(this._length[o]-=4294967296*s);return this},a.prototype._update=function(){throw new Error("_update is not implemented")},a.prototype.digest=function(t){if(this._finalized)throw new Error("Digest already called");this._finalized=!0;var e=this._digest();void 0!==t&&(e=e.toString(t)),this._block.fill(0),this._blockOffset=0;for(var n=0;n<4;++n)this._length[n]=0;return e},a.prototype._digest=function(){throw new Error("_digest is not implemented")},t.exports=a},function(t,e,n){"use strict";(function(e,r){var i=n(78);t.exports=m;var a,o=n(191);m.ReadableState=v;n(113).EventEmitter;var s=function(t,e){return t.listeners(e).length},u=n(194),c=n(115).Buffer,f=e.Uint8Array||function(){};var l=Object.create(n(54));l.inherits=n(2);var h=n(423),d=void 0;d=h&&h.debuglog?h.debuglog("stream"):function(){};var p,g=n(424),y=n(195);l.inherits(m,u);var b=["error","close","destroy","pause","resume"];function v(t,e){t=t||{};var r=e instanceof(a=a||n(35));this.objectMode=!!t.objectMode,r&&(this.objectMode=this.objectMode||!!t.readableObjectMode);var i=t.highWaterMark,o=t.readableHighWaterMark,s=this.objectMode?16:16384;this.highWaterMark=i||0===i?i:r&&(o||0===o)?o:s,this.highWaterMark=Math.floor(this.highWaterMark),this.buffer=new g,this.length=0,this.pipes=null,this.pipesCount=0,this.flowing=null,this.ended=!1,this.endEmitted=!1,this.reading=!1,this.sync=!0,this.needReadable=!1,this.emittedReadable=!1,this.readableListening=!1,this.resumeScheduled=!1,this.destroyed=!1,this.defaultEncoding=t.defaultEncoding||"utf8",this.awaitDrain=0,this.readingMore=!1,this.decoder=null,this.encoding=null,t.encoding&&(p||(p=n(117).StringDecoder),this.decoder=new p(t.encoding),this.encoding=t.encoding)}function m(t){if(a=a||n(35),!(this instanceof m))return new m(t);this._readableState=new v(t,this),this.readable=!0,t&&("function"==typeof t.read&&(this._read=t.read),"function"==typeof t.destroy&&(this._destroy=t.destroy)),u.call(this)}function _(t,e,n,r,i){var a,o=t._readableState;null===e?(o.reading=!1,function(t,e){if(e.ended)return;if(e.decoder){var n=e.decoder.end();n&&n.length&&(e.buffer.push(n),e.length+=e.objectMode?1:n.length)}e.ended=!0,k(t)}(t,o)):(i||(a=function(t,e){var n;r=e,c.isBuffer(r)||r instanceof f||"string"==typeof e||void 0===e||t.objectMode||(n=new TypeError("Invalid non-string/buffer chunk"));var r;return n}(o,e)),a?t.emit("error",a):o.objectMode||e&&e.length>0?("string"==typeof e||o.objectMode||Object.getPrototypeOf(e)===c.prototype||(e=function(t){return c.from(t)}(e)),r?o.endEmitted?t.emit("error",new Error("stream.unshift() after end event")):w(t,o,e,!0):o.ended?t.emit("error",new Error("stream.push() after EOF")):(o.reading=!1,o.decoder&&!n?(e=o.decoder.write(e),o.objectMode||0!==e.length?w(t,o,e,!1):A(t,o)):w(t,o,e,!1))):r||(o.reading=!1));return function(t){return!t.ended&&(t.needReadable||t.length<t.highWaterMark||0===t.length)}(o)}function w(t,e,n,r){e.flowing&&0===e.length&&!e.sync?(t.emit("data",n),t.read(0)):(e.length+=e.objectMode?1:n.length,r?e.buffer.unshift(n):e.buffer.push(n),e.needReadable&&k(t)),A(t,e)}Object.defineProperty(m.prototype,"destroyed",{get:function(){return void 0!==this._readableState&&this._readableState.destroyed},set:function(t){this._readableState&&(this._readableState.destroyed=t)}}),m.prototype.destroy=y.destroy,m.prototype._undestroy=y.undestroy,m.prototype._destroy=function(t,e){this.push(null),e(t)},m.prototype.push=function(t,e){var n,r=this._readableState;return r.objectMode?n=!0:"string"==typeof t&&((e=e||r.defaultEncoding)!==r.encoding&&(t=c.from(t,e),e=""),n=!0),_(this,t,e,!1,n)},m.prototype.unshift=function(t){return _(this,t,null,!0,!1)},m.prototype.isPaused=function(){return!1===this._readableState.flowing},m.prototype.setEncoding=function(t){return p||(p=n(117).StringDecoder),this._readableState.decoder=new p(t),this._readableState.encoding=t,this};function x(t,e){return t<=0||0===e.length&&e.ended?0:e.objectMode?1:t!=t?e.flowing&&e.length?e.buffer.head.data.length:e.length:(t>e.highWaterMark&&(e.highWaterMark=function(t){return t>=8388608?t=8388608:(t--,t|=t>>>1,t|=t>>>2,t|=t>>>4,t|=t>>>8,t|=t>>>16,t++),t}(t)),t<=e.length?t:e.ended?e.length:(e.needReadable=!0,0))}function k(t){var e=t._readableState;e.needReadable=!1,e.emittedReadable||(d("emitReadable",e.flowing),e.emittedReadable=!0,e.sync?i.nextTick(E,t):E(t))}function E(t){d("emit readable"),t.emit("readable"),D(t)}function A(t,e){e.readingMore||(e.readingMore=!0,i.nextTick(S,t,e))}function S(t,e){for(var n=e.length;!e.reading&&!e.flowing&&!e.ended&&e.length<e.highWaterMark&&(d("maybeReadMore read 0"),t.read(0),n!==e.length);)n=e.length;e.readingMore=!1}function M(t){d("readable nexttick read 0"),t.read(0)}function T(t,e){e.reading||(d("resume read 0"),t.read(0)),e.resumeScheduled=!1,e.awaitDrain=0,t.emit("resume"),D(t),e.flowing&&!e.reading&&t.read(0)}function D(t){var e=t._readableState;for(d("flow",e.flowing);e.flowing&&null!==t.read(););}function C(t,e){return 0===e.length?null:(e.objectMode?n=e.buffer.shift():!t||t>=e.length?(n=e.decoder?e.buffer.join(""):1===e.buffer.length?e.buffer.head.data:e.buffer.concat(e.length),e.buffer.clear()):n=function(t,e,n){var r;t<e.head.data.length?(r=e.head.data.slice(0,t),e.head.data=e.head.data.slice(t)):r=t===e.head.data.length?e.shift():n?function(t,e){var n=e.head,r=1,i=n.data;t-=i.length;for(;n=n.next;){var a=n.data,o=t>a.length?a.length:t;if(o===a.length?i+=a:i+=a.slice(0,t),0===(t-=o)){o===a.length?(++r,n.next?e.head=n.next:e.head=e.tail=null):(e.head=n,n.data=a.slice(o));break}++r}return e.length-=r,i}(t,e):function(t,e){var n=c.allocUnsafe(t),r=e.head,i=1;r.data.copy(n),t-=r.data.length;for(;r=r.next;){var a=r.data,o=t>a.length?a.length:t;if(a.copy(n,n.length-t,0,o),0===(t-=o)){o===a.length?(++i,r.next?e.head=r.next:e.head=e.tail=null):(e.head=r,r.data=a.slice(o));break}++i}return e.length-=i,n}(t,e);return r}(t,e.buffer,e.decoder),n);var n}function N(t){var e=t._readableState;if(e.length>0)throw new Error('"endReadable()" called on non-empty stream');e.endEmitted||(e.ended=!0,i.nextTick(I,e,t))}function I(t,e){t.endEmitted||0!==t.length||(t.endEmitted=!0,e.readable=!1,e.emit("end"))}function L(t,e){for(var n=0,r=t.length;n<r;n++)if(t[n]===e)return n;return-1}m.prototype.read=function(t){d("read",t),t=parseInt(t,10);var e=this._readableState,n=t;if(0!==t&&(e.emittedReadable=!1),0===t&&e.needReadable&&(e.length>=e.highWaterMark||e.ended))return d("read: emitReadable",e.length,e.ended),0===e.length&&e.ended?N(this):k(this),null;if(0===(t=x(t,e))&&e.ended)return 0===e.length&&N(this),null;var r,i=e.needReadable;return d("need readable",i),(0===e.length||e.length-t<e.highWaterMark)&&d("length less than watermark",i=!0),e.ended||e.reading?d("reading or ended",i=!1):i&&(d("do read"),e.reading=!0,e.sync=!0,0===e.length&&(e.needReadable=!0),this._read(e.highWaterMark),e.sync=!1,e.reading||(t=x(n,e))),null===(r=t>0?C(t,e):null)?(e.needReadable=!0,t=0):e.length-=t,0===e.length&&(e.ended||(e.needReadable=!0),n!==t&&e.ended&&N(this)),null!==r&&this.emit("data",r),r},m.prototype._read=function(t){this.emit("error",new Error("_read() is not implemented"))},m.prototype.pipe=function(t,e){var n=this,a=this._readableState;switch(a.pipesCount){case 0:a.pipes=t;break;case 1:a.pipes=[a.pipes,t];break;default:a.pipes.push(t)}a.pipesCount+=1,d("pipe count=%d opts=%j",a.pipesCount,e);var u=(!e||!1!==e.end)&&t!==r.stdout&&t!==r.stderr?f:m;function c(e,r){d("onunpipe"),e===n&&r&&!1===r.hasUnpiped&&(r.hasUnpiped=!0,d("cleanup"),t.removeListener("close",b),t.removeListener("finish",v),t.removeListener("drain",l),t.removeListener("error",y),t.removeListener("unpipe",c),n.removeListener("end",f),n.removeListener("end",m),n.removeListener("data",g),h=!0,!a.awaitDrain||t._writableState&&!t._writableState.needDrain||l())}function f(){d("onend"),t.end()}a.endEmitted?i.nextTick(u):n.once("end",u),t.on("unpipe",c);var l=function(t){return function(){var e=t._readableState;d("pipeOnDrain",e.awaitDrain),e.awaitDrain&&e.awaitDrain--,0===e.awaitDrain&&s(t,"data")&&(e.flowing=!0,D(t))}}(n);t.on("drain",l);var h=!1;var p=!1;function g(e){d("ondata"),p=!1,!1!==t.write(e)||p||((1===a.pipesCount&&a.pipes===t||a.pipesCount>1&&-1!==L(a.pipes,t))&&!h&&(d("false write response, pause",n._readableState.awaitDrain),n._readableState.awaitDrain++,p=!0),n.pause())}function y(e){d("onerror",e),m(),t.removeListener("error",y),0===s(t,"error")&&t.emit("error",e)}function b(){t.removeListener("finish",v),m()}function v(){d("onfinish"),t.removeListener("close",b),m()}function m(){d("unpipe"),n.unpipe(t)}return n.on("data",g),function(t,e,n){if("function"==typeof t.prependListener)return t.prependListener(e,n);t._events&&t._events[e]?o(t._events[e])?t._events[e].unshift(n):t._events[e]=[n,t._events[e]]:t.on(e,n)}(t,"error",y),t.once("close",b),t.once("finish",v),t.emit("pipe",n),a.flowing||(d("pipe resume"),n.resume()),t},m.prototype.unpipe=function(t){var e=this._readableState,n={hasUnpiped:!1};if(0===e.pipesCount)return this;if(1===e.pipesCount)return t&&t!==e.pipes?this:(t||(t=e.pipes),e.pipes=null,e.pipesCount=0,e.flowing=!1,t&&t.emit("unpipe",this,n),this);if(!t){var r=e.pipes,i=e.pipesCount;e.pipes=null,e.pipesCount=0,e.flowing=!1;for(var a=0;a<i;a++)r[a].emit("unpipe",this,n);return this}var o=L(e.pipes,t);return-1===o?this:(e.pipes.splice(o,1),e.pipesCount-=1,1===e.pipesCount&&(e.pipes=e.pipes[0]),t.emit("unpipe",this,n),this)},m.prototype.on=function(t,e){var n=u.prototype.on.call(this,t,e);if("data"===t)!1!==this._readableState.flowing&&this.resume();else if("readable"===t){var r=this._readableState;r.endEmitted||r.readableListening||(r.readableListening=r.needReadable=!0,r.emittedReadable=!1,r.reading?r.length&&k(this):i.nextTick(M,this))}return n},m.prototype.addListener=m.prototype.on,m.prototype.resume=function(){var t=this._readableState;return t.flowing||(d("resume"),t.flowing=!0,function(t,e){e.resumeScheduled||(e.resumeScheduled=!0,i.nextTick(T,t,e))}(this,t)),this},m.prototype.pause=function(){return d("call pause flowing=%j",this._readableState.flowing),!1!==this._readableState.flowing&&(d("pause"),this._readableState.flowing=!1,this.emit("pause")),this},m.prototype.wrap=function(t){var e=this,n=this._readableState,r=!1;for(var i in t.on("end",(function(){if(d("wrapped end"),n.decoder&&!n.ended){var t=n.decoder.end();t&&t.length&&e.push(t)}e.push(null)})),t.on("data",(function(i){(d("wrapped data"),n.decoder&&(i=n.decoder.write(i)),n.objectMode&&null==i)||(n.objectMode||i&&i.length)&&(e.push(i)||(r=!0,t.pause()))})),t)void 0===this[i]&&"function"==typeof t[i]&&(this[i]=function(e){return function(){return t[e].apply(t,arguments)}}(i));for(var a=0;a<b.length;a++)t.on(b[a],this.emit.bind(this,b[a]));return this._read=function(e){d("wrapped _read",e),r&&(r=!1,t.resume())},this},Object.defineProperty(m.prototype,"readableHighWaterMark",{enumerable:!1,get:function(){return this._readableState.highWaterMark}}),m._fromList=C}).call(this,n(12),n(7))},function(t,e,n){t.exports=n(113).EventEmitter},function(t,e,n){"use strict";var r=n(78);function i(t,e){t.emit("error",e)}t.exports={destroy:function(t,e){var n=this,a=this._readableState&&this._readableState.destroyed,o=this._writableState&&this._writableState.destroyed;return a||o?(e?e(t):!t||this._writableState&&this._writableState.errorEmitted||r.nextTick(i,this,t),this):(this._readableState&&(this._readableState.destroyed=!0),this._writableState&&(this._writableState.destroyed=!0),this._destroy(t||null,(function(t){!e&&t?(r.nextTick(i,n,t),n._writableState&&(n._writableState.errorEmitted=!0)):e&&e(t)})),this)},undestroy:function(){this._readableState&&(this._readableState.destroyed=!1,this._readableState.reading=!1,this._readableState.ended=!1,this._readableState.endEmitted=!1),this._writableState&&(this._writableState.destroyed=!1,this._writableState.ended=!1,this._writableState.ending=!1,this._writableState.finished=!1,this._writableState.errorEmitted=!1)}}},function(t,e,n){"use strict";t.exports=o;var r=n(35),i=Object.create(n(54));function a(t,e){var n=this._transformState;n.transforming=!1;var r=n.writecb;if(!r)return this.emit("error",new Error("write callback called multiple times"));n.writechunk=null,n.writecb=null,null!=e&&this.push(e),r(t);var i=this._readableState;i.reading=!1,(i.needReadable||i.length<i.highWaterMark)&&this._read(i.highWaterMark)}function o(t){if(!(this instanceof o))return new o(t);r.call(this,t),this._transformState={afterTransform:a.bind(this),needTransform:!1,transforming:!1,writecb:null,writechunk:null,writeencoding:null},this._readableState.needReadable=!0,this._readableState.sync=!1,t&&("function"==typeof t.transform&&(this._transform=t.transform),"function"==typeof t.flush&&(this._flush=t.flush)),this.on("prefinish",s)}function s(){var t=this;"function"==typeof this._flush?this._flush((function(e,n){u(t,e,n)})):u(this,null,null)}function u(t,e,n){if(e)return t.emit("error",e);if(null!=n&&t.push(n),t._writableState.length)throw new Error("Calling transform done when ws.length != 0");if(t._transformState.transforming)throw new Error("Calling transform done when still transforming");return t.push(null)}i.inherits=n(2),i.inherits(o,r),o.prototype.push=function(t,e){return this._transformState.needTransform=!1,r.prototype.push.call(this,t,e)},o.prototype._transform=function(t,e,n){throw new Error("_transform() is not implemented")},o.prototype._write=function(t,e,n){var r=this._transformState;if(r.writecb=n,r.writechunk=t,r.writeencoding=e,!r.transforming){var i=this._readableState;(r.needTransform||i.needReadable||i.length<i.highWaterMark)&&this._read(i.highWaterMark)}},o.prototype._read=function(t){var e=this._transformState;null!==e.writechunk&&e.writecb&&!e.transforming?(e.transforming=!0,this._transform(e.writechunk,e.writeencoding,e.afterTransform)):e.needTransform=!0},o.prototype._destroy=function(t,e){var n=this;r.prototype._destroy.call(this,t,(function(t){e(t),n.emit("close")}))}},function(t,e,n){var r=n(2),i=n(45),a=n(3).Buffer,o=[1116352408,1899447441,3049323471,3921009573,961987163,1508970993,2453635748,2870763221,3624381080,310598401,607225278,1426881987,1925078388,2162078206,2614888103,3248222580,3835390401,4022224774,264347078,604807628,770255983,1249150122,1555081692,1996064986,2554220882,2821834349,2952996808,3210313671,3336571891,3584528711,113926993,338241895,666307205,773529912,1294757372,1396182291,1695183700,1986661051,2177026350,2456956037,2730485921,2820302411,3259730800,3345764771,3516065817,3600352804,4094571909,275423344,430227734,506948616,659060556,883997877,958139571,1322822218,1537002063,1747873779,1955562222,2024104815,2227730452,2361852424,2428436474,2756734187,3204031479,3329325298],s=new Array(64);function u(){this.init(),this._w=s,i.call(this,64,56)}function c(t,e,n){return n^t&(e^n)}function f(t,e,n){return t&e|n&(t|e)}function l(t){return(t>>>2|t<<30)^(t>>>13|t<<19)^(t>>>22|t<<10)}function h(t){return(t>>>6|t<<26)^(t>>>11|t<<21)^(t>>>25|t<<7)}function d(t){return(t>>>7|t<<25)^(t>>>18|t<<14)^t>>>3}r(u,i),u.prototype.init=function(){return this._a=1779033703,this._b=3144134277,this._c=1013904242,this._d=2773480762,this._e=1359893119,this._f=2600822924,this._g=528734635,this._h=1541459225,this},u.prototype._update=function(t){for(var e,n=this._w,r=0|this._a,i=0|this._b,a=0|this._c,s=0|this._d,u=0|this._e,p=0|this._f,g=0|this._g,y=0|this._h,b=0;b<16;++b)n[b]=t.readInt32BE(4*b);for(;b<64;++b)n[b]=0|(((e=n[b-2])>>>17|e<<15)^(e>>>19|e<<13)^e>>>10)+n[b-7]+d(n[b-15])+n[b-16];for(var v=0;v<64;++v){var m=y+h(u)+c(u,p,g)+o[v]+n[v]|0,_=l(r)+f(r,i,a)|0;y=g,g=p,p=u,u=s+m|0,s=a,a=i,i=r,r=m+_|0}this._a=r+this._a|0,this._b=i+this._b|0,this._c=a+this._c|0,this._d=s+this._d|0,this._e=u+this._e|0,this._f=p+this._f|0,this._g=g+this._g|0,this._h=y+this._h|0},u.prototype._hash=function(){var t=a.allocUnsafe(32);return t.writeInt32BE(this._a,0),t.writeInt32BE(this._b,4),t.writeInt32BE(this._c,8),t.writeInt32BE(this._d,12),t.writeInt32BE(this._e,16),t.writeInt32BE(this._f,20),t.writeInt32BE(this._g,24),t.writeInt32BE(this._h,28),t},t.exports=u},function(t,e,n){var r=n(2),i=n(45),a=n(3).Buffer,o=[1116352408,3609767458,1899447441,602891725,3049323471,3964484399,3921009573,2173295548,961987163,4081628472,1508970993,3053834265,2453635748,2937671579,2870763221,3664609560,3624381080,2734883394,310598401,1164996542,607225278,1323610764,1426881987,3590304994,1925078388,4068182383,2162078206,991336113,2614888103,633803317,3248222580,3479774868,3835390401,2666613458,4022224774,944711139,264347078,2341262773,604807628,2007800933,770255983,1495990901,1249150122,1856431235,1555081692,3175218132,1996064986,2198950837,2554220882,3999719339,2821834349,766784016,2952996808,2566594879,3210313671,3203337956,3336571891,1034457026,3584528711,2466948901,113926993,3758326383,338241895,168717936,666307205,1188179964,773529912,1546045734,1294757372,1522805485,1396182291,2643833823,1695183700,2343527390,1986661051,1014477480,2177026350,1206759142,2456956037,344077627,2730485921,1290863460,2820302411,3158454273,3259730800,3505952657,3345764771,106217008,3516065817,3606008344,3600352804,1432725776,4094571909,1467031594,275423344,851169720,430227734,3100823752,506948616,1363258195,659060556,3750685593,883997877,3785050280,958139571,3318307427,1322822218,3812723403,1537002063,2003034995,1747873779,3602036899,1955562222,1575990012,2024104815,1125592928,2227730452,2716904306,2361852424,442776044,2428436474,593698344,2756734187,3733110249,3204031479,2999351573,3329325298,3815920427,3391569614,3928383900,3515267271,566280711,3940187606,3454069534,4118630271,4000239992,116418474,1914138554,174292421,2731055270,289380356,3203993006,460393269,320620315,685471733,587496836,852142971,1086792851,1017036298,365543100,1126000580,2618297676,1288033470,3409855158,1501505948,4234509866,1607167915,987167468,1816402316,1246189591],s=new Array(160);function u(){this.init(),this._w=s,i.call(this,128,112)}function c(t,e,n){return n^t&(e^n)}function f(t,e,n){return t&e|n&(t|e)}function l(t,e){return(t>>>28|e<<4)^(e>>>2|t<<30)^(e>>>7|t<<25)}function h(t,e){return(t>>>14|e<<18)^(t>>>18|e<<14)^(e>>>9|t<<23)}function d(t,e){return(t>>>1|e<<31)^(t>>>8|e<<24)^t>>>7}function p(t,e){return(t>>>1|e<<31)^(t>>>8|e<<24)^(t>>>7|e<<25)}function g(t,e){return(t>>>19|e<<13)^(e>>>29|t<<3)^t>>>6}function y(t,e){return(t>>>19|e<<13)^(e>>>29|t<<3)^(t>>>6|e<<26)}function b(t,e){return t>>>0<e>>>0?1:0}r(u,i),u.prototype.init=function(){return this._ah=1779033703,this._bh=3144134277,this._ch=1013904242,this._dh=2773480762,this._eh=1359893119,this._fh=2600822924,this._gh=528734635,this._hh=1541459225,this._al=4089235720,this._bl=2227873595,this._cl=4271175723,this._dl=1595750129,this._el=2917565137,this._fl=725511199,this._gl=4215389547,this._hl=327033209,this},u.prototype._update=function(t){for(var e=this._w,n=0|this._ah,r=0|this._bh,i=0|this._ch,a=0|this._dh,s=0|this._eh,u=0|this._fh,v=0|this._gh,m=0|this._hh,_=0|this._al,w=0|this._bl,x=0|this._cl,k=0|this._dl,E=0|this._el,A=0|this._fl,S=0|this._gl,M=0|this._hl,T=0;T<32;T+=2)e[T]=t.readInt32BE(4*T),e[T+1]=t.readInt32BE(4*T+4);for(;T<160;T+=2){var D=e[T-30],C=e[T-30+1],N=d(D,C),I=p(C,D),L=g(D=e[T-4],C=e[T-4+1]),B=y(C,D),O=e[T-14],R=e[T-14+1],P=e[T-32],F=e[T-32+1],q=I+R|0,j=N+O+b(q,I)|0;j=(j=j+L+b(q=q+B|0,B)|0)+P+b(q=q+F|0,F)|0,e[T]=j,e[T+1]=q}for(var U=0;U<160;U+=2){j=e[U],q=e[U+1];var z=f(n,r,i),Y=f(_,w,x),V=l(n,_),H=l(_,n),G=h(s,E),$=h(E,s),W=o[U],K=o[U+1],X=c(s,u,v),Z=c(E,A,S),J=M+$|0,Q=m+G+b(J,M)|0;Q=(Q=(Q=Q+X+b(J=J+Z|0,Z)|0)+W+b(J=J+K|0,K)|0)+j+b(J=J+q|0,q)|0;var tt=H+Y|0,et=V+z+b(tt,H)|0;m=v,M=S,v=u,S=A,u=s,A=E,s=a+Q+b(E=k+J|0,k)|0,a=i,k=x,i=r,x=w,r=n,w=_,n=Q+et+b(_=J+tt|0,J)|0}this._al=this._al+_|0,this._bl=this._bl+w|0,this._cl=this._cl+x|0,this._dl=this._dl+k|0,this._el=this._el+E|0,this._fl=this._fl+A|0,this._gl=this._gl+S|0,this._hl=this._hl+M|0,this._ah=this._ah+n+b(this._al,_)|0,this._bh=this._bh+r+b(this._bl,w)|0,this._ch=this._ch+i+b(this._cl,x)|0,this._dh=this._dh+a+b(this._dl,k)|0,this._eh=this._eh+s+b(this._el,E)|0,this._fh=this._fh+u+b(this._fl,A)|0,this._gh=this._gh+v+b(this._gl,S)|0,this._hh=this._hh+m+b(this._hl,M)|0},u.prototype._hash=function(){var t=a.allocUnsafe(64);function e(e,n,r){t.writeInt32BE(e,r),t.writeInt32BE(n,r+4)}return e(this._ah,this._al,0),e(this._bh,this._bl,8),e(this._ch,this._cl,16),e(this._dh,this._dl,24),e(this._eh,this._el,32),e(this._fh,this._fl,40),e(this._gh,this._gl,48),e(this._hh,this._hl,56),t},t.exports=u},function(t,e,n){"use strict";var r=n(2),i=n(438),a=n(31),o=n(3).Buffer,s=n(200),u=n(118),c=n(119),f=o.alloc(128);function l(t,e){a.call(this,"digest"),"string"==typeof e&&(e=o.from(e));var n="sha512"===t||"sha384"===t?128:64;(this._alg=t,this._key=e,e.length>n)?e=("rmd160"===t?new u:c(t)).update(e).digest():e.length<n&&(e=o.concat([e,f],n));for(var r=this._ipad=o.allocUnsafe(n),i=this._opad=o.allocUnsafe(n),s=0;s<n;s++)r[s]=54^e[s],i[s]=92^e[s];this._hash="rmd160"===t?new u:c(t),this._hash.update(r)}r(l,a),l.prototype._update=function(t){this._hash.update(t)},l.prototype._final=function(){var t=this._hash.digest();return("rmd160"===this._alg?new u:c(this._alg)).update(this._opad).update(t).digest()},t.exports=function(t,e){return"rmd160"===(t=t.toLowerCase())||"ripemd160"===t?new l("rmd160",e):"md5"===t?new i(s,e):new l(t,e)}},function(t,e,n){var r=n(111);t.exports=function(t){return(new r).update(t).digest()}},function(t){t.exports=JSON.parse('{"sha224WithRSAEncryption":{"sign":"rsa","hash":"sha224","id":"302d300d06096086480165030402040500041c"},"RSA-SHA224":{"sign":"ecdsa/rsa","hash":"sha224","id":"302d300d06096086480165030402040500041c"},"sha256WithRSAEncryption":{"sign":"rsa","hash":"sha256","id":"3031300d060960864801650304020105000420"},"RSA-SHA256":{"sign":"ecdsa/rsa","hash":"sha256","id":"3031300d060960864801650304020105000420"},"sha384WithRSAEncryption":{"sign":"rsa","hash":"sha384","id":"3041300d060960864801650304020205000430"},"RSA-SHA384":{"sign":"ecdsa/rsa","hash":"sha384","id":"3041300d060960864801650304020205000430"},"sha512WithRSAEncryption":{"sign":"rsa","hash":"sha512","id":"3051300d060960864801650304020305000440"},"RSA-SHA512":{"sign":"ecdsa/rsa","hash":"sha512","id":"3051300d060960864801650304020305000440"},"RSA-SHA1":{"sign":"rsa","hash":"sha1","id":"3021300906052b0e03021a05000414"},"ecdsa-with-SHA1":{"sign":"ecdsa","hash":"sha1","id":""},"sha256":{"sign":"ecdsa","hash":"sha256","id":""},"sha224":{"sign":"ecdsa","hash":"sha224","id":""},"sha384":{"sign":"ecdsa","hash":"sha384","id":""},"sha512":{"sign":"ecdsa","hash":"sha512","id":""},"DSA-SHA":{"sign":"dsa","hash":"sha1","id":""},"DSA-SHA1":{"sign":"dsa","hash":"sha1","id":""},"DSA":{"sign":"dsa","hash":"sha1","id":""},"DSA-WITH-SHA224":{"sign":"dsa","hash":"sha224","id":""},"DSA-SHA224":{"sign":"dsa","hash":"sha224","id":""},"DSA-WITH-SHA256":{"sign":"dsa","hash":"sha256","id":""},"DSA-SHA256":{"sign":"dsa","hash":"sha256","id":""},"DSA-WITH-SHA384":{"sign":"dsa","hash":"sha384","id":""},"DSA-SHA384":{"sign":"dsa","hash":"sha384","id":""},"DSA-WITH-SHA512":{"sign":"dsa","hash":"sha512","id":""},"DSA-SHA512":{"sign":"dsa","hash":"sha512","id":""},"DSA-RIPEMD160":{"sign":"dsa","hash":"rmd160","id":""},"ripemd160WithRSA":{"sign":"rsa","hash":"rmd160","id":"3021300906052b2403020105000414"},"RSA-RIPEMD160":{"sign":"rsa","hash":"rmd160","id":"3021300906052b2403020105000414"},"md5WithRSAEncryption":{"sign":"rsa","hash":"md5","id":"3020300c06082a864886f70d020505000410"},"RSA-MD5":{"sign":"rsa","hash":"md5","id":"3020300c06082a864886f70d020505000410"}}')},function(t,e,n){e.pbkdf2=n(440),e.pbkdf2Sync=n(205)},function(t,e,n){(function(e){var n=Math.pow(2,30)-1;function r(t,n){if("string"!=typeof t&&!e.isBuffer(t))throw new TypeError(n+" must be a buffer or string")}t.exports=function(t,e,i,a){if(r(t,"Password"),r(e,"Salt"),"number"!=typeof i)throw new TypeError("Iterations not a number");if(i<0)throw new TypeError("Bad iterations");if("number"!=typeof a)throw new TypeError("Key length not a number");if(a<0||a>n||a!=a)throw new TypeError("Bad key length")}}).call(this,n(8).Buffer)},function(t,e,n){(function(e){var n;e.browser?n="utf-8":n=parseInt(e.version.split(".")[0].slice(1),10)>=6?"utf-8":"binary";t.exports=n}).call(this,n(7))},function(t,e,n){var r=n(200),i=n(118),a=n(119),o=n(203),s=n(204),u=n(3).Buffer,c=u.alloc(128),f={md5:16,sha1:20,sha224:28,sha256:32,sha384:48,sha512:64,rmd160:20,ripemd160:20};function l(t,e,n){var o=function(t){function e(e){return a(t).update(e).digest()}return"rmd160"===t||"ripemd160"===t?function(t){return(new i).update(t).digest()}:"md5"===t?r:e}(t),s="sha512"===t||"sha384"===t?128:64;e.length>s?e=o(e):e.length<s&&(e=u.concat([e,c],s));for(var l=u.allocUnsafe(s+f[t]),h=u.allocUnsafe(s+f[t]),d=0;d<s;d++)l[d]=54^e[d],h[d]=92^e[d];var p=u.allocUnsafe(s+n+4);l.copy(p,0,0,s),this.ipad1=p,this.ipad2=l,this.opad=h,this.alg=t,this.blocksize=s,this.hash=o,this.size=f[t]}l.prototype.run=function(t,e){return t.copy(e,this.blocksize),this.hash(e).copy(this.opad,this.blocksize),this.hash(this.opad)},t.exports=function(t,e,n,r,i){o(t,e,n,r),u.isBuffer(t)||(t=u.from(t,s)),u.isBuffer(e)||(e=u.from(e,s));var a=new l(i=i||"sha1",t,e.length),c=u.allocUnsafe(r),h=u.allocUnsafe(e.length+4);e.copy(h,0,0,e.length);for(var d=0,p=f[i],g=Math.ceil(r/p),y=1;y<=g;y++){h.writeUInt32BE(y,e.length);for(var b=a.run(h,a.ipad1),v=b,m=1;m<n;m++){v=a.run(v,a.ipad2);for(var _=0;_<p;_++)b[_]^=v[_]}b.copy(c,d),d+=p}return c}},function(t,e,n){"use strict";e.readUInt32BE=function(t,e){return(t[0+e]<<24|t[1+e]<<16|t[2+e]<<8|t[3+e])>>>0},e.writeUInt32BE=function(t,e,n){t[0+n]=e>>>24,t[1+n]=e>>>16&255,t[2+n]=e>>>8&255,t[3+n]=255&e},e.ip=function(t,e,n,r){for(var i=0,a=0,o=6;o>=0;o-=2){for(var s=0;s<=24;s+=8)i<<=1,i|=e>>>s+o&1;for(s=0;s<=24;s+=8)i<<=1,i|=t>>>s+o&1}for(o=6;o>=0;o-=2){for(s=1;s<=25;s+=8)a<<=1,a|=e>>>s+o&1;for(s=1;s<=25;s+=8)a<<=1,a|=t>>>s+o&1}n[r+0]=i>>>0,n[r+1]=a>>>0},e.rip=function(t,e,n,r){for(var i=0,a=0,o=0;o<4;o++)for(var s=24;s>=0;s-=8)i<<=1,i|=e>>>s+o&1,i<<=1,i|=t>>>s+o&1;for(o=4;o<8;o++)for(s=24;s>=0;s-=8)a<<=1,a|=e>>>s+o&1,a<<=1,a|=t>>>s+o&1;n[r+0]=i>>>0,n[r+1]=a>>>0},e.pc1=function(t,e,n,r){for(var i=0,a=0,o=7;o>=5;o--){for(var s=0;s<=24;s+=8)i<<=1,i|=e>>s+o&1;for(s=0;s<=24;s+=8)i<<=1,i|=t>>s+o&1}for(s=0;s<=24;s+=8)i<<=1,i|=e>>s+o&1;for(o=1;o<=3;o++){for(s=0;s<=24;s+=8)a<<=1,a|=e>>s+o&1;for(s=0;s<=24;s+=8)a<<=1,a|=t>>s+o&1}for(s=0;s<=24;s+=8)a<<=1,a|=t>>s+o&1;n[r+0]=i>>>0,n[r+1]=a>>>0},e.r28shl=function(t,e){return t<<e&268435455|t>>>28-e};var r=[14,11,17,4,27,23,25,0,13,22,7,18,5,9,16,24,2,20,12,21,1,8,15,26,15,4,25,19,9,1,26,16,5,11,23,8,12,7,17,0,22,3,10,14,6,20,27,24];e.pc2=function(t,e,n,i){for(var a=0,o=0,s=r.length>>>1,u=0;u<s;u++)a<<=1,a|=t>>>r[u]&1;for(u=s;u<r.length;u++)o<<=1,o|=e>>>r[u]&1;n[i+0]=a>>>0,n[i+1]=o>>>0},e.expand=function(t,e,n){var r=0,i=0;r=(1&t)<<5|t>>>27;for(var a=23;a>=15;a-=4)r<<=6,r|=t>>>a&63;for(a=11;a>=3;a-=4)i|=t>>>a&63,i<<=6;i|=(31&t)<<1|t>>>31,e[n+0]=r>>>0,e[n+1]=i>>>0};var i=[14,0,4,15,13,7,1,4,2,14,15,2,11,13,8,1,3,10,10,6,6,12,12,11,5,9,9,5,0,3,7,8,4,15,1,12,14,8,8,2,13,4,6,9,2,1,11,7,15,5,12,11,9,3,7,14,3,10,10,0,5,6,0,13,15,3,1,13,8,4,14,7,6,15,11,2,3,8,4,14,9,12,7,0,2,1,13,10,12,6,0,9,5,11,10,5,0,13,14,8,7,10,11,1,10,3,4,15,13,4,1,2,5,11,8,6,12,7,6,12,9,0,3,5,2,14,15,9,10,13,0,7,9,0,14,9,6,3,3,4,15,6,5,10,1,2,13,8,12,5,7,14,11,12,4,11,2,15,8,1,13,1,6,10,4,13,9,0,8,6,15,9,3,8,0,7,11,4,1,15,2,14,12,3,5,11,10,5,14,2,7,12,7,13,13,8,14,11,3,5,0,6,6,15,9,0,10,3,1,4,2,7,8,2,5,12,11,1,12,10,4,14,15,9,10,3,6,15,9,0,0,6,12,10,11,1,7,13,13,8,15,9,1,4,3,5,14,11,5,12,2,7,8,2,4,14,2,14,12,11,4,2,1,12,7,4,10,7,11,13,6,1,8,5,5,0,3,15,15,10,13,3,0,9,14,8,9,6,4,11,2,8,1,12,11,7,10,1,13,14,7,2,8,13,15,6,9,15,12,0,5,9,6,10,3,4,0,5,14,3,12,10,1,15,10,4,15,2,9,7,2,12,6,9,8,5,0,6,13,1,3,13,4,14,14,0,7,11,5,3,11,8,9,4,14,3,15,2,5,12,2,9,8,5,12,15,3,10,7,11,0,14,4,1,10,7,1,6,13,0,11,8,6,13,4,13,11,0,2,11,14,7,15,4,0,9,8,1,13,10,3,14,12,3,9,5,7,12,5,2,10,15,6,8,1,6,1,6,4,11,11,13,13,8,12,1,3,4,7,10,14,7,10,9,15,5,6,0,8,15,0,14,5,2,9,3,2,12,13,1,2,15,8,13,4,8,6,10,15,3,11,7,1,4,10,12,9,5,3,6,14,11,5,0,0,14,12,9,7,2,7,2,11,1,4,14,1,7,9,4,12,10,14,8,2,13,0,15,6,12,10,9,13,0,15,3,3,5,5,6,8,11];e.substitute=function(t,e){for(var n=0,r=0;r<4;r++){n<<=4,n|=i[64*r+(t>>>18-6*r&63)]}for(r=0;r<4;r++){n<<=4,n|=i[256+64*r+(e>>>18-6*r&63)]}return n>>>0};var a=[16,25,12,11,3,20,4,15,31,17,9,6,27,14,1,22,30,24,8,18,0,5,29,23,13,19,2,26,10,21,28,7];e.permute=function(t){for(var e=0,n=0;n<a.length;n++)e<<=1,e|=t>>>a[n]&1;return e>>>0},e.padSplit=function(t,e,n){for(var r=t.toString(2);r.length<e;)r="0"+r;for(var i=[],a=0;a<e;a+=n)i.push(r.slice(a,a+n));return i.join(" ")}},function(t,e,n){"use strict";var r=n(16),i=n(2),a=n(206),o=n(120);function s(){this.tmp=new Array(2),this.keys=null}function u(t){o.call(this,t);var e=new s;this._desState=e,this.deriveKeys(e,t.key)}i(u,o),t.exports=u,u.create=function(t){return new u(t)};var c=[1,1,2,2,2,2,2,2,1,2,2,2,2,2,2,1];u.prototype.deriveKeys=function(t,e){t.keys=new Array(32),r.equal(e.length,this.blockSize,"Invalid key length");var n=a.readUInt32BE(e,0),i=a.readUInt32BE(e,4);a.pc1(n,i,t.tmp,0),n=t.tmp[0],i=t.tmp[1];for(var o=0;o<t.keys.length;o+=2){var s=c[o>>>1];n=a.r28shl(n,s),i=a.r28shl(i,s),a.pc2(n,i,t.keys,o)}},u.prototype._update=function(t,e,n,r){var i=this._desState,o=a.readUInt32BE(t,e),s=a.readUInt32BE(t,e+4);a.ip(o,s,i.tmp,0),o=i.tmp[0],s=i.tmp[1],"encrypt"===this.type?this._encrypt(i,o,s,i.tmp,0):this._decrypt(i,o,s,i.tmp,0),o=i.tmp[0],s=i.tmp[1],a.writeUInt32BE(n,o,r),a.writeUInt32BE(n,s,r+4)},u.prototype._pad=function(t,e){for(var n=t.length-e,r=e;r<t.length;r++)t[r]=n;return!0},u.prototype._unpad=function(t){for(var e=t[t.length-1],n=t.length-e;n<t.length;n++)r.equal(t[n],e);return t.slice(0,t.length-e)},u.prototype._encrypt=function(t,e,n,r,i){for(var o=e,s=n,u=0;u<t.keys.length;u+=2){var c=t.keys[u],f=t.keys[u+1];a.expand(s,t.tmp,0),c^=t.tmp[0],f^=t.tmp[1];var l=a.substitute(c,f),h=s;s=(o^a.permute(l))>>>0,o=h}a.rip(s,o,r,i)},u.prototype._decrypt=function(t,e,n,r,i){for(var o=n,s=e,u=t.keys.length-2;u>=0;u-=2){var c=t.keys[u],f=t.keys[u+1];a.expand(o,t.tmp,0),c^=t.tmp[0],f^=t.tmp[1];var l=a.substitute(c,f),h=o;o=(s^a.permute(l))>>>0,s=h}a.rip(o,s,r,i)}},function(t,e,n){var r=n(55),i=n(3).Buffer,a=n(209);function o(t){var e=t._cipher.encryptBlockRaw(t._prev);return a(t._prev),e}e.encrypt=function(t,e){var n=Math.ceil(e.length/16),a=t._cache.length;t._cache=i.concat([t._cache,i.allocUnsafe(16*n)]);for(var s=0;s<n;s++){var u=o(t),c=a+16*s;t._cache.writeUInt32BE(u[0],c+0),t._cache.writeUInt32BE(u[1],c+4),t._cache.writeUInt32BE(u[2],c+8),t._cache.writeUInt32BE(u[3],c+12)}var f=t._cache.slice(0,e.length);return t._cache=t._cache.slice(e.length),r(e,f)}},function(t,e){t.exports=function(t){for(var e,n=t.length;n--;){if(255!==(e=t.readUInt8(n))){e++,t.writeUInt8(e,n);break}t.writeUInt8(0,n)}}},function(t){t.exports=JSON.parse('{"aes-128-ecb":{"cipher":"AES","key":128,"iv":0,"mode":"ECB","type":"block"},"aes-192-ecb":{"cipher":"AES","key":192,"iv":0,"mode":"ECB","type":"block"},"aes-256-ecb":{"cipher":"AES","key":256,"iv":0,"mode":"ECB","type":"block"},"aes-128-cbc":{"cipher":"AES","key":128,"iv":16,"mode":"CBC","type":"block"},"aes-192-cbc":{"cipher":"AES","key":192,"iv":16,"mode":"CBC","type":"block"},"aes-256-cbc":{"cipher":"AES","key":256,"iv":16,"mode":"CBC","type":"block"},"aes128":{"cipher":"AES","key":128,"iv":16,"mode":"CBC","type":"block"},"aes192":{"cipher":"AES","key":192,"iv":16,"mode":"CBC","type":"block"},"aes256":{"cipher":"AES","key":256,"iv":16,"mode":"CBC","type":"block"},"aes-128-cfb":{"cipher":"AES","key":128,"iv":16,"mode":"CFB","type":"stream"},"aes-192-cfb":{"cipher":"AES","key":192,"iv":16,"mode":"CFB","type":"stream"},"aes-256-cfb":{"cipher":"AES","key":256,"iv":16,"mode":"CFB","type":"stream"},"aes-128-cfb8":{"cipher":"AES","key":128,"iv":16,"mode":"CFB8","type":"stream"},"aes-192-cfb8":{"cipher":"AES","key":192,"iv":16,"mode":"CFB8","type":"stream"},"aes-256-cfb8":{"cipher":"AES","key":256,"iv":16,"mode":"CFB8","type":"stream"},"aes-128-cfb1":{"cipher":"AES","key":128,"iv":16,"mode":"CFB1","type":"stream"},"aes-192-cfb1":{"cipher":"AES","key":192,"iv":16,"mode":"CFB1","type":"stream"},"aes-256-cfb1":{"cipher":"AES","key":256,"iv":16,"mode":"CFB1","type":"stream"},"aes-128-ofb":{"cipher":"AES","key":128,"iv":16,"mode":"OFB","type":"stream"},"aes-192-ofb":{"cipher":"AES","key":192,"iv":16,"mode":"OFB","type":"stream"},"aes-256-ofb":{"cipher":"AES","key":256,"iv":16,"mode":"OFB","type":"stream"},"aes-128-ctr":{"cipher":"AES","key":128,"iv":16,"mode":"CTR","type":"stream"},"aes-192-ctr":{"cipher":"AES","key":192,"iv":16,"mode":"CTR","type":"stream"},"aes-256-ctr":{"cipher":"AES","key":256,"iv":16,"mode":"CTR","type":"stream"},"aes-128-gcm":{"cipher":"AES","key":128,"iv":12,"mode":"GCM","type":"auth"},"aes-192-gcm":{"cipher":"AES","key":192,"iv":12,"mode":"GCM","type":"auth"},"aes-256-gcm":{"cipher":"AES","key":256,"iv":12,"mode":"GCM","type":"auth"}}')},function(t,e,n){var r=n(79),i=n(3).Buffer,a=n(31),o=n(2),s=n(453),u=n(55),c=n(209);function f(t,e,n,o){a.call(this);var u=i.alloc(4,0);this._cipher=new r.AES(e);var f=this._cipher.encryptBlock(u);this._ghash=new s(f),n=function(t,e,n){if(12===e.length)return t._finID=i.concat([e,i.from([0,0,0,1])]),i.concat([e,i.from([0,0,0,2])]);var r=new s(n),a=e.length,o=a%16;r.update(e),o&&(o=16-o,r.update(i.alloc(o,0))),r.update(i.alloc(8,0));var u=8*a,f=i.alloc(8);f.writeUIntBE(u,0,8),r.update(f),t._finID=r.state;var l=i.from(t._finID);return c(l),l}(this,n,f),this._prev=i.from(n),this._cache=i.allocUnsafe(0),this._secCache=i.allocUnsafe(0),this._decrypt=o,this._alen=0,this._len=0,this._mode=t,this._authTag=null,this._called=!1}o(f,a),f.prototype._update=function(t){if(!this._called&&this._alen){var e=16-this._alen%16;e<16&&(e=i.alloc(e,0),this._ghash.update(e))}this._called=!0;var n=this._mode.encrypt(this,t);return this._decrypt?this._ghash.update(t):this._ghash.update(n),this._len+=t.length,n},f.prototype._final=function(){if(this._decrypt&&!this._authTag)throw new Error("Unsupported state or unable to authenticate data");var t=u(this._ghash.final(8*this._alen,8*this._len),this._cipher.encryptBlock(this._finID));if(this._decrypt&&function(t,e){var n=0;t.length!==e.length&&n++;for(var r=Math.min(t.length,e.length),i=0;i<r;++i)n+=t[i]^e[i];return n}(t,this._authTag))throw new Error("Unsupported state or unable to authenticate data");this._authTag=t,this._cipher.scrub()},f.prototype.getAuthTag=function(){if(this._decrypt||!i.isBuffer(this._authTag))throw new Error("Attempting to get auth tag in unsupported state");return this._authTag},f.prototype.setAuthTag=function(t){if(!this._decrypt)throw new Error("Attempting to set auth tag in unsupported state");this._authTag=t},f.prototype.setAAD=function(t){if(this._called)throw new Error("Attempting to set AAD in unsupported state");this._ghash.update(t),this._alen+=t.length},t.exports=f},function(t,e,n){var r=n(79),i=n(3).Buffer,a=n(31);function o(t,e,n,o){a.call(this),this._cipher=new r.AES(e),this._prev=i.from(n),this._cache=i.allocUnsafe(0),this._secCache=i.allocUnsafe(0),this._decrypt=o,this._mode=t}n(2)(o,a),o.prototype._update=function(t){return this._mode.encrypt(this,t,this._decrypt)},o.prototype._final=function(){this._cipher.scrub()},t.exports=o},function(t,e,n){var r=n(44);t.exports=v,v.simpleSieve=y,v.fermatTest=b;var i=n(5),a=new i(24),o=new(n(214)),s=new i(1),u=new i(2),c=new i(5),f=(new i(16),new i(8),new i(10)),l=new i(3),h=(new i(7),new i(11)),d=new i(4),p=(new i(12),null);function g(){if(null!==p)return p;var t=[];t[0]=2;for(var e=1,n=3;n<1048576;n+=2){for(var r=Math.ceil(Math.sqrt(n)),i=0;i<e&&t[i]<=r&&n%t[i]!=0;i++);e!==i&&t[i]<=r||(t[e++]=n)}return p=t,t}function y(t){for(var e=g(),n=0;n<e.length;n++)if(0===t.modn(e[n]))return 0===t.cmpn(e[n]);return!0}function b(t){var e=i.mont(t);return 0===u.toRed(e).redPow(t.subn(1)).fromRed().cmpn(1)}function v(t,e){if(t<16)return new i(2===e||5===e?[140,123]:[140,39]);var n,p;for(e=new i(e);;){for(n=new i(r(Math.ceil(t/8)));n.bitLength()>t;)n.ishrn(1);if(n.isEven()&&n.iadd(s),n.testn(1)||n.iadd(u),e.cmp(u)){if(!e.cmp(c))for(;n.mod(f).cmp(l);)n.iadd(d)}else for(;n.mod(a).cmp(h);)n.iadd(d);if(y(p=n.shrn(1))&&y(n)&&b(p)&&b(n)&&o.test(p)&&o.test(n))return n}}},function(t,e,n){var r=n(5),i=n(123);function a(t){this.rand=t||new i.Rand}t.exports=a,a.create=function(t){return new a(t)},a.prototype._randbelow=function(t){var e=t.bitLength(),n=Math.ceil(e/8);do{var i=new r(this.rand.generate(n))}while(i.cmp(t)>=0);return i},a.prototype._randrange=function(t,e){var n=e.sub(t);return t.add(this._randbelow(n))},a.prototype.test=function(t,e,n){var i=t.bitLength(),a=r.mont(t),o=new r(1).toRed(a);e||(e=Math.max(1,i/48|0));for(var s=t.subn(1),u=0;!s.testn(u);u++);for(var c=t.shrn(u),f=s.toRed(a);e>0;e--){var l=this._randrange(new r(2),s);n&&n(l);var h=l.toRed(a).redPow(c);if(0!==h.cmp(o)&&0!==h.cmp(f)){for(var d=1;d<u;d++){if(0===(h=h.redSqr()).cmp(o))return!1;if(0===h.cmp(f))break}if(d===u)return!1}}return!0},a.prototype.getDivisor=function(t,e){var n=t.bitLength(),i=r.mont(t),a=new r(1).toRed(i);e||(e=Math.max(1,n/48|0));for(var o=t.subn(1),s=0;!o.testn(s);s++);for(var u=t.shrn(s),c=o.toRed(i);e>0;e--){var f=this._randrange(new r(2),o),l=t.gcd(f);if(0!==l.cmpn(1))return l;var h=f.toRed(i).redPow(u);if(0!==h.cmp(a)&&0!==h.cmp(c)){for(var d=1;d<s;d++){if(0===(h=h.redSqr()).cmp(a))return h.fromRed().subn(1).gcd(t);if(0===h.cmp(c))break}if(d===s)return(h=h.redSqr()).fromRed().subn(1).gcd(t)}}return!1}},function(t,e,n){"use strict";var r=e;function i(t){return 1===t.length?"0"+t:t}function a(t){for(var e="",n=0;n<t.length;n++)e+=i(t[n].toString(16));return e}r.toArray=function(t,e){if(Array.isArray(t))return t.slice();if(!t)return[];var n=[];if("string"!=typeof t){for(var r=0;r<t.length;r++)n[r]=0|t[r];return n}if("hex"===e){(t=t.replace(/[^a-z0-9]+/gi,"")).length%2!=0&&(t="0"+t);for(r=0;r<t.length;r+=2)n.push(parseInt(t[r]+t[r+1],16))}else for(r=0;r<t.length;r++){var i=t.charCodeAt(r),a=i>>8,o=255&i;a?n.push(a,o):n.push(o)}return n},r.zero2=i,r.toHex=a,r.encode=function(t,e){return"hex"===e?a(t):t}},function(t,e,n){"use strict";var r=e;r.base=n(81),r.short=n(464),r.mont=n(465),r.edwards=n(466)},function(t,e,n){"use strict";var r=n(21).rotr32;function i(t,e,n){return t&e^~t&n}function a(t,e,n){return t&e^t&n^e&n}function o(t,e,n){return t^e^n}e.ft_1=function(t,e,n,r){return 0===t?i(e,n,r):1===t||3===t?o(e,n,r):2===t?a(e,n,r):void 0},e.ch32=i,e.maj32=a,e.p32=o,e.s0_256=function(t){return r(t,2)^r(t,13)^r(t,22)},e.s1_256=function(t){return r(t,6)^r(t,11)^r(t,25)},e.g0_256=function(t){return r(t,7)^r(t,18)^t>>>3},e.g1_256=function(t){return r(t,17)^r(t,19)^t>>>10}},function(t,e,n){"use strict";var r=n(21),i=n(56),a=n(217),o=n(16),s=r.sum32,u=r.sum32_4,c=r.sum32_5,f=a.ch32,l=a.maj32,h=a.s0_256,d=a.s1_256,p=a.g0_256,g=a.g1_256,y=i.BlockHash,b=[1116352408,1899447441,3049323471,3921009573,961987163,1508970993,2453635748,2870763221,3624381080,310598401,607225278,1426881987,1925078388,2162078206,2614888103,3248222580,3835390401,4022224774,264347078,604807628,770255983,1249150122,1555081692,1996064986,2554220882,2821834349,2952996808,3210313671,3336571891,3584528711,113926993,338241895,666307205,773529912,1294757372,1396182291,1695183700,1986661051,2177026350,2456956037,2730485921,2820302411,3259730800,3345764771,3516065817,3600352804,4094571909,275423344,430227734,506948616,659060556,883997877,958139571,1322822218,1537002063,1747873779,1955562222,2024104815,2227730452,2361852424,2428436474,2756734187,3204031479,3329325298];function v(){if(!(this instanceof v))return new v;y.call(this),this.h=[1779033703,3144134277,1013904242,2773480762,1359893119,2600822924,528734635,1541459225],this.k=b,this.W=new Array(64)}r.inherits(v,y),t.exports=v,v.blockSize=512,v.outSize=256,v.hmacStrength=192,v.padLength=64,v.prototype._update=function(t,e){for(var n=this.W,r=0;r<16;r++)n[r]=t[e+r];for(;r<n.length;r++)n[r]=u(g(n[r-2]),n[r-7],p(n[r-15]),n[r-16]);var i=this.h[0],a=this.h[1],y=this.h[2],b=this.h[3],v=this.h[4],m=this.h[5],_=this.h[6],w=this.h[7];for(o(this.k.length===n.length),r=0;r<n.length;r++){var x=c(w,d(v),f(v,m,_),this.k[r],n[r]),k=s(h(i),l(i,a,y));w=_,_=m,m=v,v=s(b,x),b=y,y=a,a=i,i=s(x,k)}this.h[0]=s(this.h[0],i),this.h[1]=s(this.h[1],a),this.h[2]=s(this.h[2],y),this.h[3]=s(this.h[3],b),this.h[4]=s(this.h[4],v),this.h[5]=s(this.h[5],m),this.h[6]=s(this.h[6],_),this.h[7]=s(this.h[7],w)},v.prototype._digest=function(t){return"hex"===t?r.toHex32(this.h,"big"):r.split32(this.h,"big")}},function(t,e,n){"use strict";var r=n(21),i=n(56),a=n(16),o=r.rotr64_hi,s=r.rotr64_lo,u=r.shr64_hi,c=r.shr64_lo,f=r.sum64,l=r.sum64_hi,h=r.sum64_lo,d=r.sum64_4_hi,p=r.sum64_4_lo,g=r.sum64_5_hi,y=r.sum64_5_lo,b=i.BlockHash,v=[1116352408,3609767458,1899447441,602891725,3049323471,3964484399,3921009573,2173295548,961987163,4081628472,1508970993,3053834265,2453635748,2937671579,2870763221,3664609560,3624381080,2734883394,310598401,1164996542,607225278,1323610764,1426881987,3590304994,1925078388,4068182383,2162078206,991336113,2614888103,633803317,3248222580,3479774868,3835390401,2666613458,4022224774,944711139,264347078,2341262773,604807628,2007800933,770255983,1495990901,1249150122,1856431235,1555081692,3175218132,1996064986,2198950837,2554220882,3999719339,2821834349,766784016,2952996808,2566594879,3210313671,3203337956,3336571891,1034457026,3584528711,2466948901,113926993,3758326383,338241895,168717936,666307205,1188179964,773529912,1546045734,1294757372,1522805485,1396182291,2643833823,1695183700,2343527390,1986661051,1014477480,2177026350,1206759142,2456956037,344077627,2730485921,1290863460,2820302411,3158454273,3259730800,3505952657,3345764771,106217008,3516065817,3606008344,3600352804,1432725776,4094571909,1467031594,275423344,851169720,430227734,3100823752,506948616,1363258195,659060556,3750685593,883997877,3785050280,958139571,3318307427,1322822218,3812723403,1537002063,2003034995,1747873779,3602036899,1955562222,1575990012,2024104815,1125592928,2227730452,2716904306,2361852424,442776044,2428436474,593698344,2756734187,3733110249,3204031479,2999351573,3329325298,3815920427,3391569614,3928383900,3515267271,566280711,3940187606,3454069534,4118630271,4000239992,116418474,1914138554,174292421,2731055270,289380356,3203993006,460393269,320620315,685471733,587496836,852142971,1086792851,1017036298,365543100,1126000580,2618297676,1288033470,3409855158,1501505948,4234509866,1607167915,987167468,1816402316,1246189591];function m(){if(!(this instanceof m))return new m;b.call(this),this.h=[1779033703,4089235720,3144134277,2227873595,1013904242,4271175723,2773480762,1595750129,1359893119,2917565137,2600822924,725511199,528734635,4215389547,1541459225,327033209],this.k=v,this.W=new Array(160)}function _(t,e,n,r,i){var a=t&n^~t&i;return a<0&&(a+=4294967296),a}function w(t,e,n,r,i,a){var o=e&r^~e&a;return o<0&&(o+=4294967296),o}function x(t,e,n,r,i){var a=t&n^t&i^n&i;return a<0&&(a+=4294967296),a}function k(t,e,n,r,i,a){var o=e&r^e&a^r&a;return o<0&&(o+=4294967296),o}function E(t,e){var n=o(t,e,28)^o(e,t,2)^o(e,t,7);return n<0&&(n+=4294967296),n}function A(t,e){var n=s(t,e,28)^s(e,t,2)^s(e,t,7);return n<0&&(n+=4294967296),n}function S(t,e){var n=o(t,e,14)^o(t,e,18)^o(e,t,9);return n<0&&(n+=4294967296),n}function M(t,e){var n=s(t,e,14)^s(t,e,18)^s(e,t,9);return n<0&&(n+=4294967296),n}function T(t,e){var n=o(t,e,1)^o(t,e,8)^u(t,e,7);return n<0&&(n+=4294967296),n}function D(t,e){var n=s(t,e,1)^s(t,e,8)^c(t,e,7);return n<0&&(n+=4294967296),n}function C(t,e){var n=o(t,e,19)^o(e,t,29)^u(t,e,6);return n<0&&(n+=4294967296),n}function N(t,e){var n=s(t,e,19)^s(e,t,29)^c(t,e,6);return n<0&&(n+=4294967296),n}r.inherits(m,b),t.exports=m,m.blockSize=1024,m.outSize=512,m.hmacStrength=192,m.padLength=128,m.prototype._prepareBlock=function(t,e){for(var n=this.W,r=0;r<32;r++)n[r]=t[e+r];for(;r<n.length;r+=2){var i=C(n[r-4],n[r-3]),a=N(n[r-4],n[r-3]),o=n[r-14],s=n[r-13],u=T(n[r-30],n[r-29]),c=D(n[r-30],n[r-29]),f=n[r-32],l=n[r-31];n[r]=d(i,a,o,s,u,c,f,l),n[r+1]=p(i,a,o,s,u,c,f,l)}},m.prototype._update=function(t,e){this._prepareBlock(t,e);var n=this.W,r=this.h[0],i=this.h[1],o=this.h[2],s=this.h[3],u=this.h[4],c=this.h[5],d=this.h[6],p=this.h[7],b=this.h[8],v=this.h[9],m=this.h[10],T=this.h[11],D=this.h[12],C=this.h[13],N=this.h[14],I=this.h[15];a(this.k.length===n.length);for(var L=0;L<n.length;L+=2){var B=N,O=I,R=S(b,v),P=M(b,v),F=_(b,v,m,T,D),q=w(b,v,m,T,D,C),j=this.k[L],U=this.k[L+1],z=n[L],Y=n[L+1],V=g(B,O,R,P,F,q,j,U,z,Y),H=y(B,O,R,P,F,q,j,U,z,Y);B=E(r,i),O=A(r,i),R=x(r,i,o,s,u),P=k(r,i,o,s,u,c);var G=l(B,O,R,P),$=h(B,O,R,P);N=D,I=C,D=m,C=T,m=b,T=v,b=l(d,p,V,H),v=h(p,p,V,H),d=u,p=c,u=o,c=s,o=r,s=i,r=l(V,H,G,$),i=h(V,H,G,$)}f(this.h,0,r,i),f(this.h,2,o,s),f(this.h,4,u,c),f(this.h,6,d,p),f(this.h,8,b,v),f(this.h,10,m,T),f(this.h,12,D,C),f(this.h,14,N,I)},m.prototype._digest=function(t){return"hex"===t?r.toHex32(this.h,"big"):r.split32(this.h,"big")}},function(t,e,n){var r=n(2),i=n(58).Reporter,a=n(8).Buffer;function o(t,e){i.call(this,e),a.isBuffer(t)?(this.base=t,this.offset=0,this.length=t.length):this.error("Input not Buffer")}function s(t,e){if(Array.isArray(t))this.length=0,this.value=t.map((function(t){return t instanceof s||(t=new s(t,e)),this.length+=t.length,t}),this);else if("number"==typeof t){if(!(0<=t&&t<=255))return e.error("non-byte EncoderBuffer value");this.value=t,this.length=1}else if("string"==typeof t)this.value=t,this.length=a.byteLength(t);else{if(!a.isBuffer(t))return e.error("Unsupported type: "+typeof t);this.value=t,this.length=t.length}}r(o,i),e.DecoderBuffer=o,o.prototype.save=function(){return{offset:this.offset,reporter:i.prototype.save.call(this)}},o.prototype.restore=function(t){var e=new o(this.base);return e.offset=t.offset,e.length=this.offset,this.offset=t.offset,i.prototype.restore.call(this,t.reporter),e},o.prototype.isEmpty=function(){return this.offset===this.length},o.prototype.readUInt8=function(t){return this.offset+1<=this.length?this.base.readUInt8(this.offset++,!0):this.error(t||"DecoderBuffer overrun")},o.prototype.skip=function(t,e){if(!(this.offset+t<=this.length))return this.error(e||"DecoderBuffer overrun");var n=new o(this.base);return n._reporterState=this._reporterState,n.offset=this.offset,n.length=this.offset+t,this.offset+=t,n},o.prototype.raw=function(t){return this.base.slice(t?t.offset:this.offset,this.length)},e.EncoderBuffer=s,s.prototype.join=function(t,e){return t||(t=new a(this.length)),e||(e=0),0===this.length?t:(Array.isArray(this.value)?this.value.forEach((function(n){n.join(t,e),e+=n.length})):("number"==typeof this.value?t[e]=this.value:"string"==typeof this.value?t.write(this.value,e):a.isBuffer(this.value)&&this.value.copy(t,e),e+=this.length),t)}},function(t,e,n){var r=e;r._reverse=function(t){var e={};return Object.keys(t).forEach((function(n){(0|n)==n&&(n|=0);var r=t[n];e[r]=n})),e},r.der=n(486)},function(t,e,n){var r=n(2),i=n(57),a=i.base,o=i.bignum,s=i.constants.der;function u(t){this.enc="der",this.name=t.name,this.entity=t,this.tree=new c,this.tree._init(t.body)}function c(t){a.Node.call(this,"der",t)}function f(t,e){var n=t.readUInt8(e);if(t.isError(n))return n;var r=s.tagClass[n>>6],i=0==(32&n);if(31==(31&n)){var a=n;for(n=0;128==(128&a);){if(a=t.readUInt8(e),t.isError(a))return a;n<<=7,n|=127&a}}else n&=31;return{cls:r,primitive:i,tag:n,tagStr:s.tag[n]}}function l(t,e,n){var r=t.readUInt8(n);if(t.isError(r))return r;if(!e&&128===r)return null;if(0==(128&r))return r;var i=127&r;if(i>4)return t.error("length octect is too long");r=0;for(var a=0;a<i;a++){r<<=8;var o=t.readUInt8(n);if(t.isError(o))return o;r|=o}return r}t.exports=u,u.prototype.decode=function(t,e){return t instanceof a.DecoderBuffer||(t=new a.DecoderBuffer(t,e)),this.tree._decode(t,e)},r(c,a.Node),c.prototype._peekTag=function(t,e,n){if(t.isEmpty())return!1;var r=t.save(),i=f(t,'Failed to peek tag: "'+e+'"');return t.isError(i)?i:(t.restore(r),i.tag===e||i.tagStr===e||i.tagStr+"of"===e||n)},c.prototype._decodeTag=function(t,e,n){var r=f(t,'Failed to decode tag of "'+e+'"');if(t.isError(r))return r;var i=l(t,r.primitive,'Failed to get length of "'+e+'"');if(t.isError(i))return i;if(!n&&r.tag!==e&&r.tagStr!==e&&r.tagStr+"of"!==e)return t.error('Failed to match tag: "'+e+'"');if(r.primitive||null!==i)return t.skip(i,'Failed to match body of: "'+e+'"');var a=t.save(),o=this._skipUntilEnd(t,'Failed to skip indefinite length body: "'+this.tag+'"');return t.isError(o)?o:(i=t.offset-a.offset,t.restore(a),t.skip(i,'Failed to match body of: "'+e+'"'))},c.prototype._skipUntilEnd=function(t,e){for(;;){var n=f(t,e);if(t.isError(n))return n;var r,i=l(t,n.primitive,e);if(t.isError(i))return i;if(r=n.primitive||null!==i?t.skip(i):this._skipUntilEnd(t,e),t.isError(r))return r;if("end"===n.tagStr)break}},c.prototype._decodeList=function(t,e,n,r){for(var i=[];!t.isEmpty();){var a=this._peekTag(t,"end");if(t.isError(a))return a;var o=n.decode(t,"der",r);if(t.isError(o)&&a)break;i.push(o)}return i},c.prototype._decodeStr=function(t,e){if("bitstr"===e){var n=t.readUInt8();return t.isError(n)?n:{unused:n,data:t.raw()}}if("bmpstr"===e){var r=t.raw();if(r.length%2==1)return t.error("Decoding of string type: bmpstr length mismatch");for(var i="",a=0;a<r.length/2;a++)i+=String.fromCharCode(r.readUInt16BE(2*a));return i}if("numstr"===e){var o=t.raw().toString("ascii");return this._isNumstr(o)?o:t.error("Decoding of string type: numstr unsupported characters")}if("octstr"===e)return t.raw();if("objDesc"===e)return t.raw();if("printstr"===e){var s=t.raw().toString("ascii");return this._isPrintstr(s)?s:t.error("Decoding of string type: printstr unsupported characters")}return/str$/.test(e)?t.raw().toString():t.error("Decoding of string type: "+e+" unsupported")},c.prototype._decodeObjid=function(t,e,n){for(var r,i=[],a=0;!t.isEmpty();){var o=t.readUInt8();a<<=7,a|=127&o,0==(128&o)&&(i.push(a),a=0)}128&o&&i.push(a);var s=i[0]/40|0,u=i[0]%40;if(r=n?i:[s,u].concat(i.slice(1)),e){var c=e[r.join(" ")];void 0===c&&(c=e[r.join(".")]),void 0!==c&&(r=c)}return r},c.prototype._decodeTime=function(t,e){var n=t.raw().toString();if("gentime"===e)var r=0|n.slice(0,4),i=0|n.slice(4,6),a=0|n.slice(6,8),o=0|n.slice(8,10),s=0|n.slice(10,12),u=0|n.slice(12,14);else{if("utctime"!==e)return t.error("Decoding "+e+" time is not supported yet");r=0|n.slice(0,2),i=0|n.slice(2,4),a=0|n.slice(4,6),o=0|n.slice(6,8),s=0|n.slice(8,10),u=0|n.slice(10,12);r=r<70?2e3+r:1900+r}return Date.UTC(r,i-1,a,o,s,u,0)},c.prototype._decodeNull=function(t){return null},c.prototype._decodeBool=function(t){var e=t.readUInt8();return t.isError(e)?e:0!==e},c.prototype._decodeInt=function(t,e){var n=t.raw(),r=new o(n);return e&&(r=e[r.toString(10)]||r),r},c.prototype._use=function(t,e){return"function"==typeof t&&(t=t(e)),t._getDecoder("der").tree}},function(t,e,n){var r=n(2),i=n(8).Buffer,a=n(57),o=a.base,s=a.constants.der;function u(t){this.enc="der",this.name=t.name,this.entity=t,this.tree=new c,this.tree._init(t.body)}function c(t){o.Node.call(this,"der",t)}function f(t){return t<10?"0"+t:t}t.exports=u,u.prototype.encode=function(t,e){return this.tree._encode(t,e).join()},r(c,o.Node),c.prototype._encodeComposite=function(t,e,n,r){var a,o=function(t,e,n,r){var i;"seqof"===t?t="seq":"setof"===t&&(t="set");if(s.tagByName.hasOwnProperty(t))i=s.tagByName[t];else{if("number"!=typeof t||(0|t)!==t)return r.error("Unknown tag: "+t);i=t}if(i>=31)return r.error("Multi-octet tag encoding unsupported");e||(i|=32);return i|=s.tagClassByName[n||"universal"]<<6}(t,e,n,this.reporter);if(r.length<128)return(a=new i(2))[0]=o,a[1]=r.length,this._createEncoderBuffer([a,r]);for(var u=1,c=r.length;c>=256;c>>=8)u++;(a=new i(2+u))[0]=o,a[1]=128|u;c=1+u;for(var f=r.length;f>0;c--,f>>=8)a[c]=255&f;return this._createEncoderBuffer([a,r])},c.prototype._encodeStr=function(t,e){if("bitstr"===e)return this._createEncoderBuffer([0|t.unused,t.data]);if("bmpstr"===e){for(var n=new i(2*t.length),r=0;r<t.length;r++)n.writeUInt16BE(t.charCodeAt(r),2*r);return this._createEncoderBuffer(n)}return"numstr"===e?this._isNumstr(t)?this._createEncoderBuffer(t):this.reporter.error("Encoding of string type: numstr supports only digits and space"):"printstr"===e?this._isPrintstr(t)?this._createEncoderBuffer(t):this.reporter.error("Encoding of string type: printstr supports only latin upper and lower case letters, digits, space, apostrophe, left and rigth parenthesis, plus sign, comma, hyphen, dot, slash, colon, equal sign, question mark"):/str$/.test(e)?this._createEncoderBuffer(t):"objDesc"===e?this._createEncoderBuffer(t):this.reporter.error("Encoding of string type: "+e+" unsupported")},c.prototype._encodeObjid=function(t,e,n){if("string"==typeof t){if(!e)return this.reporter.error("string objid given, but no values map found");if(!e.hasOwnProperty(t))return this.reporter.error("objid not found in values map");t=e[t].split(/[\s\.]+/g);for(var r=0;r<t.length;r++)t[r]|=0}else if(Array.isArray(t)){t=t.slice();for(r=0;r<t.length;r++)t[r]|=0}if(!Array.isArray(t))return this.reporter.error("objid() should be either array or string, got: "+JSON.stringify(t));if(!n){if(t[1]>=40)return this.reporter.error("Second objid identifier OOB");t.splice(0,2,40*t[0]+t[1])}var a=0;for(r=0;r<t.length;r++){var o=t[r];for(a++;o>=128;o>>=7)a++}var s=new i(a),u=s.length-1;for(r=t.length-1;r>=0;r--){o=t[r];for(s[u--]=127&o;(o>>=7)>0;)s[u--]=128|127&o}return this._createEncoderBuffer(s)},c.prototype._encodeTime=function(t,e){var n,r=new Date(t);return"gentime"===e?n=[f(r.getFullYear()),f(r.getUTCMonth()+1),f(r.getUTCDate()),f(r.getUTCHours()),f(r.getUTCMinutes()),f(r.getUTCSeconds()),"Z"].join(""):"utctime"===e?n=[f(r.getFullYear()%100),f(r.getUTCMonth()+1),f(r.getUTCDate()),f(r.getUTCHours()),f(r.getUTCMinutes()),f(r.getUTCSeconds()),"Z"].join(""):this.reporter.error("Encoding "+e+" time is not supported yet"),this._encodeStr(n,"octstr")},c.prototype._encodeNull=function(){return this._createEncoderBuffer("")},c.prototype._encodeInt=function(t,e){if("string"==typeof t){if(!e)return this.reporter.error("String int or enum given, but no values map");if(!e.hasOwnProperty(t))return this.reporter.error("Values map doesn't contain: "+JSON.stringify(t));t=e[t]}if("number"!=typeof t&&!i.isBuffer(t)){var n=t.toArray();!t.sign&&128&n[0]&&n.unshift(0),t=new i(n)}if(i.isBuffer(t)){var r=t.length;0===t.length&&r++;var a=new i(r);return t.copy(a),0===t.length&&(a[0]=0),this._createEncoderBuffer(a)}if(t<128)return this._createEncoderBuffer(t);if(t<256)return this._createEncoderBuffer([0,t]);r=1;for(var o=t;o>=256;o>>=8)r++;for(o=(a=new Array(r)).length-1;o>=0;o--)a[o]=255&t,t>>=8;return 128&a[0]&&a.unshift(0),this._createEncoderBuffer(new i(a))},c.prototype._encodeBool=function(t){return this._createEncoderBuffer(t?255:0)},c.prototype._use=function(t,e){return"function"==typeof t&&(t=t(e)),t._getEncoder("der").tree},c.prototype._skipDefault=function(t,e,n){var r,i=this._baseState;if(null===i.default)return!1;var a=t.join();if(void 0===i.defaultBuffer&&(i.defaultBuffer=this._encodeValue(i.default,e,n).join()),a.length!==i.defaultBuffer.length)return!1;for(r=0;r<a.length;r++)if(a[r]!==i.defaultBuffer[r])return!1;return!0}},function(t){t.exports=JSON.parse('{"1.3.132.0.10":"secp256k1","1.3.132.0.33":"p224","1.2.840.10045.3.1.1":"p192","1.2.840.10045.3.1.7":"p256","1.3.132.0.34":"p384","1.3.132.0.35":"p521"}')},function(t,e,n){var r=n(53),i=n(3).Buffer;function a(t){var e=i.allocUnsafe(4);return e.writeUInt32BE(t,0),e}t.exports=function(t,e){for(var n,o=i.alloc(0),s=0;o.length<e;)n=a(s++),o=i.concat([o,r("sha1").update(t).update(n).digest()]);return o.slice(0,e)}},function(t,e){t.exports=function(t,e){for(var n=t.length,r=-1;++r<n;)t[r]^=e[r];return t}},function(t,e,n){var r=n(5),i=n(3).Buffer;t.exports=function(t,e){return i.from(t.toRed(r.mont(e.modulus)).redPow(new r(e.publicExponent)).fromRed().toArray())}},function(t,e,n){(function(t,n){!function(r){var i=e,a=t&&t.exports==i&&t,o="object"==typeof n&&n;o.global!==o&&o.window!==o||(r=o);var s=/[\uD800-\uDBFF][\uDC00-\uDFFF]/g,u=/[\x01-\x7F]/g,c=/[\x01-\t\x0B\f\x0E-\x1F\x7F\x81\x8D\x8F\x90\x9D\xA0-\uFFFF]/g,f=/<\u20D2|=\u20E5|>\u20D2|\u205F\u200A|\u219D\u0338|\u2202\u0338|\u2220\u20D2|\u2229\uFE00|\u222A\uFE00|\u223C\u20D2|\u223D\u0331|\u223E\u0333|\u2242\u0338|\u224B\u0338|\u224D\u20D2|\u224E\u0338|\u224F\u0338|\u2250\u0338|\u2261\u20E5|\u2264\u20D2|\u2265\u20D2|\u2266\u0338|\u2267\u0338|\u2268\uFE00|\u2269\uFE00|\u226A\u0338|\u226A\u20D2|\u226B\u0338|\u226B\u20D2|\u227F\u0338|\u2282\u20D2|\u2283\u20D2|\u228A\uFE00|\u228B\uFE00|\u228F\u0338|\u2290\u0338|\u2293\uFE00|\u2294\uFE00|\u22B4\u20D2|\u22B5\u20D2|\u22D8\u0338|\u22D9\u0338|\u22DA\uFE00|\u22DB\uFE00|\u22F5\u0338|\u22F9\u0338|\u2933\u0338|\u29CF\u0338|\u29D0\u0338|\u2A6D\u0338|\u2A70\u0338|\u2A7D\u0338|\u2A7E\u0338|\u2AA1\u0338|\u2AA2\u0338|\u2AAC\uFE00|\u2AAD\uFE00|\u2AAF\u0338|\u2AB0\u0338|\u2AC5\u0338|\u2AC6\u0338|\u2ACB\uFE00|\u2ACC\uFE00|\u2AFD\u20E5|[\xA0-\u0113\u0116-\u0122\u0124-\u012B\u012E-\u014D\u0150-\u017E\u0192\u01B5\u01F5\u0237\u02C6\u02C7\u02D8-\u02DD\u0311\u0391-\u03A1\u03A3-\u03A9\u03B1-\u03C9\u03D1\u03D2\u03D5\u03D6\u03DC\u03DD\u03F0\u03F1\u03F5\u03F6\u0401-\u040C\u040E-\u044F\u0451-\u045C\u045E\u045F\u2002-\u2005\u2007-\u2010\u2013-\u2016\u2018-\u201A\u201C-\u201E\u2020-\u2022\u2025\u2026\u2030-\u2035\u2039\u203A\u203E\u2041\u2043\u2044\u204F\u2057\u205F-\u2063\u20AC\u20DB\u20DC\u2102\u2105\u210A-\u2113\u2115-\u211E\u2122\u2124\u2127-\u2129\u212C\u212D\u212F-\u2131\u2133-\u2138\u2145-\u2148\u2153-\u215E\u2190-\u219B\u219D-\u21A7\u21A9-\u21AE\u21B0-\u21B3\u21B5-\u21B7\u21BA-\u21DB\u21DD\u21E4\u21E5\u21F5\u21FD-\u2205\u2207-\u2209\u220B\u220C\u220F-\u2214\u2216-\u2218\u221A\u221D-\u2238\u223A-\u2257\u2259\u225A\u225C\u225F-\u2262\u2264-\u228B\u228D-\u229B\u229D-\u22A5\u22A7-\u22B0\u22B2-\u22BB\u22BD-\u22DB\u22DE-\u22E3\u22E6-\u22F7\u22F9-\u22FE\u2305\u2306\u2308-\u2310\u2312\u2313\u2315\u2316\u231C-\u231F\u2322\u2323\u232D\u232E\u2336\u233D\u233F\u237C\u23B0\u23B1\u23B4-\u23B6\u23DC-\u23DF\u23E2\u23E7\u2423\u24C8\u2500\u2502\u250C\u2510\u2514\u2518\u251C\u2524\u252C\u2534\u253C\u2550-\u256C\u2580\u2584\u2588\u2591-\u2593\u25A1\u25AA\u25AB\u25AD\u25AE\u25B1\u25B3-\u25B5\u25B8\u25B9\u25BD-\u25BF\u25C2\u25C3\u25CA\u25CB\u25EC\u25EF\u25F8-\u25FC\u2605\u2606\u260E\u2640\u2642\u2660\u2663\u2665\u2666\u266A\u266D-\u266F\u2713\u2717\u2720\u2736\u2758\u2772\u2773\u27C8\u27C9\u27E6-\u27ED\u27F5-\u27FA\u27FC\u27FF\u2902-\u2905\u290C-\u2913\u2916\u2919-\u2920\u2923-\u292A\u2933\u2935-\u2939\u293C\u293D\u2945\u2948-\u294B\u294E-\u2976\u2978\u2979\u297B-\u297F\u2985\u2986\u298B-\u2996\u299A\u299C\u299D\u29A4-\u29B7\u29B9\u29BB\u29BC\u29BE-\u29C5\u29C9\u29CD-\u29D0\u29DC-\u29DE\u29E3-\u29E5\u29EB\u29F4\u29F6\u2A00-\u2A02\u2A04\u2A06\u2A0C\u2A0D\u2A10-\u2A17\u2A22-\u2A27\u2A29\u2A2A\u2A2D-\u2A31\u2A33-\u2A3C\u2A3F\u2A40\u2A42-\u2A4D\u2A50\u2A53-\u2A58\u2A5A-\u2A5D\u2A5F\u2A66\u2A6A\u2A6D-\u2A75\u2A77-\u2A9A\u2A9D-\u2AA2\u2AA4-\u2AB0\u2AB3-\u2AC8\u2ACB\u2ACC\u2ACF-\u2ADB\u2AE4\u2AE6-\u2AE9\u2AEB-\u2AF3\u2AFD\uFB00-\uFB04]|\uD835[\uDC9C\uDC9E\uDC9F\uDCA2\uDCA5\uDCA6\uDCA9-\uDCAC\uDCAE-\uDCB9\uDCBB\uDCBD-\uDCC3\uDCC5-\uDCCF\uDD04\uDD05\uDD07-\uDD0A\uDD0D-\uDD14\uDD16-\uDD1C\uDD1E-\uDD39\uDD3B-\uDD3E\uDD40-\uDD44\uDD46\uDD4A-\uDD50\uDD52-\uDD6B]/g,l={"":"shy","":"zwnj","":"zwj","":"lrm","":"ic","":"it","":"af","":"rlm","":"ZeroWidthSpace","":"NoBreak","̑":"DownBreve","⃛":"tdot","⃜":"DotDot","\t":"Tab","\n":"NewLine"," ":"puncsp"," ":"MediumSpace"," ":"thinsp"," ":"hairsp"," ":"emsp13"," ":"ensp"," ":"emsp14"," ":"emsp"," ":"numsp"," ":"nbsp"," ":"ThickSpace","‾":"oline",_:"lowbar","‐":"dash","–":"ndash","—":"mdash","―":"horbar",",":"comma",";":"semi","⁏":"bsemi",":":"colon","⩴":"Colone","!":"excl","¡":"iexcl","?":"quest","¿":"iquest",".":"period","‥":"nldr","…":"mldr","·":"middot","'":"apos","‘":"lsquo","’":"rsquo","‚":"sbquo","‹":"lsaquo","›":"rsaquo",'"':"quot","“":"ldquo","”":"rdquo","„":"bdquo","«":"laquo","»":"raquo","(":"lpar",")":"rpar","[":"lsqb","]":"rsqb","{":"lcub","}":"rcub","⌈":"lceil","⌉":"rceil","⌊":"lfloor","⌋":"rfloor","⦅":"lopar","⦆":"ropar","⦋":"lbrke","⦌":"rbrke","⦍":"lbrkslu","⦎":"rbrksld","⦏":"lbrksld","⦐":"rbrkslu","⦑":"langd","⦒":"rangd","⦓":"lparlt","⦔":"rpargt","⦕":"gtlPar","⦖":"ltrPar","⟦":"lobrk","⟧":"robrk","⟨":"lang","⟩":"rang","⟪":"Lang","⟫":"Rang","⟬":"loang","⟭":"roang","❲":"lbbrk","❳":"rbbrk","‖":"Vert","§":"sect","¶":"para","@":"commat","*":"ast","/":"sol",undefined:null,"&":"amp","#":"num","%":"percnt","‰":"permil","‱":"pertenk","†":"dagger","‡":"Dagger","•":"bull","⁃":"hybull","′":"prime","″":"Prime","‴":"tprime","⁗":"qprime","‵":"bprime","⁁":"caret","`":"grave","´":"acute","˜":"tilde","^":"Hat","¯":"macr","˘":"breve","˙":"dot","¨":"die","˚":"ring","˝":"dblac","¸":"cedil","˛":"ogon","ˆ":"circ","ˇ":"caron","°":"deg","©":"copy","®":"reg","℗":"copysr","℘":"wp","℞":"rx","℧":"mho","℩":"iiota","←":"larr","↚":"nlarr","→":"rarr","↛":"nrarr","↑":"uarr","↓":"darr","↔":"harr","↮":"nharr","↕":"varr","↖":"nwarr","↗":"nearr","↘":"searr","↙":"swarr","↝":"rarrw","↝̸":"nrarrw","↞":"Larr","↟":"Uarr","↠":"Rarr","↡":"Darr","↢":"larrtl","↣":"rarrtl","↤":"mapstoleft","↥":"mapstoup","↦":"map","↧":"mapstodown","↩":"larrhk","↪":"rarrhk","↫":"larrlp","↬":"rarrlp","↭":"harrw","↰":"lsh","↱":"rsh","↲":"ldsh","↳":"rdsh","↵":"crarr","↶":"cularr","↷":"curarr","↺":"olarr","↻":"orarr","↼":"lharu","↽":"lhard","↾":"uharr","↿":"uharl","⇀":"rharu","⇁":"rhard","⇂":"dharr","⇃":"dharl","⇄":"rlarr","⇅":"udarr","⇆":"lrarr","⇇":"llarr","⇈":"uuarr","⇉":"rrarr","⇊":"ddarr","⇋":"lrhar","⇌":"rlhar","⇐":"lArr","⇍":"nlArr","⇑":"uArr","⇒":"rArr","⇏":"nrArr","⇓":"dArr","⇔":"iff","⇎":"nhArr","⇕":"vArr","⇖":"nwArr","⇗":"neArr","⇘":"seArr","⇙":"swArr","⇚":"lAarr","⇛":"rAarr","⇝":"zigrarr","⇤":"larrb","⇥":"rarrb","⇵":"duarr","⇽":"loarr","⇾":"roarr","⇿":"hoarr","∀":"forall","∁":"comp","∂":"part","∂̸":"npart","∃":"exist","∄":"nexist","∅":"empty","∇":"Del","∈":"in","∉":"notin","∋":"ni","∌":"notni","϶":"bepsi","∏":"prod","∐":"coprod","∑":"sum","+":"plus","±":"pm","÷":"div","×":"times","<":"lt","≮":"nlt","<⃒":"nvlt","=":"equals","≠":"ne","=⃥":"bne","⩵":"Equal",">":"gt","≯":"ngt",">⃒":"nvgt","¬":"not","|":"vert","¦":"brvbar","−":"minus","∓":"mp","∔":"plusdo","⁄":"frasl","∖":"setmn","∗":"lowast","∘":"compfn","√":"Sqrt","∝":"prop","∞":"infin","∟":"angrt","∠":"ang","∠⃒":"nang","∡":"angmsd","∢":"angsph","∣":"mid","∤":"nmid","∥":"par","∦":"npar","∧":"and","∨":"or","∩":"cap","∩︀":"caps","∪":"cup","∪︀":"cups","∫":"int","∬":"Int","∭":"tint","⨌":"qint","∮":"oint","∯":"Conint","∰":"Cconint","∱":"cwint","∲":"cwconint","∳":"awconint","∴":"there4","∵":"becaus","∶":"ratio","∷":"Colon","∸":"minusd","∺":"mDDot","∻":"homtht","∼":"sim","≁":"nsim","∼⃒":"nvsim","∽":"bsim","∽̱":"race","∾":"ac","∾̳":"acE","∿":"acd","≀":"wr","≂":"esim","≂̸":"nesim","≃":"sime","≄":"nsime","≅":"cong","≇":"ncong","≆":"simne","≈":"ap","≉":"nap","≊":"ape","≋":"apid","≋̸":"napid","≌":"bcong","≍":"CupCap","≭":"NotCupCap","≍⃒":"nvap","≎":"bump","≎̸":"nbump","≏":"bumpe","≏̸":"nbumpe","≐":"doteq","≐̸":"nedot","≑":"eDot","≒":"efDot","≓":"erDot","≔":"colone","≕":"ecolon","≖":"ecir","≗":"cire","≙":"wedgeq","≚":"veeeq","≜":"trie","≟":"equest","≡":"equiv","≢":"nequiv","≡⃥":"bnequiv","≤":"le","≰":"nle","≤⃒":"nvle","≥":"ge","≱":"nge","≥⃒":"nvge","≦":"lE","≦̸":"nlE","≧":"gE","≧̸":"ngE","≨︀":"lvnE","≨":"lnE","≩":"gnE","≩︀":"gvnE","≪":"ll","≪̸":"nLtv","≪⃒":"nLt","≫":"gg","≫̸":"nGtv","≫⃒":"nGt","≬":"twixt","≲":"lsim","≴":"nlsim","≳":"gsim","≵":"ngsim","≶":"lg","≸":"ntlg","≷":"gl","≹":"ntgl","≺":"pr","⊀":"npr","≻":"sc","⊁":"nsc","≼":"prcue","⋠":"nprcue","≽":"sccue","⋡":"nsccue","≾":"prsim","≿":"scsim","≿̸":"NotSucceedsTilde","⊂":"sub","⊄":"nsub","⊂⃒":"vnsub","⊃":"sup","⊅":"nsup","⊃⃒":"vnsup","⊆":"sube","⊈":"nsube","⊇":"supe","⊉":"nsupe","⊊︀":"vsubne","⊊":"subne","⊋︀":"vsupne","⊋":"supne","⊍":"cupdot","⊎":"uplus","⊏":"sqsub","⊏̸":"NotSquareSubset","⊐":"sqsup","⊐̸":"NotSquareSuperset","⊑":"sqsube","⋢":"nsqsube","⊒":"sqsupe","⋣":"nsqsupe","⊓":"sqcap","⊓︀":"sqcaps","⊔":"sqcup","⊔︀":"sqcups","⊕":"oplus","⊖":"ominus","⊗":"otimes","⊘":"osol","⊙":"odot","⊚":"ocir","⊛":"oast","⊝":"odash","⊞":"plusb","⊟":"minusb","⊠":"timesb","⊡":"sdotb","⊢":"vdash","⊬":"nvdash","⊣":"dashv","⊤":"top","⊥":"bot","⊧":"models","⊨":"vDash","⊭":"nvDash","⊩":"Vdash","⊮":"nVdash","⊪":"Vvdash","⊫":"VDash","⊯":"nVDash","⊰":"prurel","⊲":"vltri","⋪":"nltri","⊳":"vrtri","⋫":"nrtri","⊴":"ltrie","⋬":"nltrie","⊴⃒":"nvltrie","⊵":"rtrie","⋭":"nrtrie","⊵⃒":"nvrtrie","⊶":"origof","⊷":"imof","⊸":"mumap","⊹":"hercon","⊺":"intcal","⊻":"veebar","⊽":"barvee","⊾":"angrtvb","⊿":"lrtri","⋀":"Wedge","⋁":"Vee","⋂":"xcap","⋃":"xcup","⋄":"diam","⋅":"sdot","⋆":"Star","⋇":"divonx","⋈":"bowtie","⋉":"ltimes","⋊":"rtimes","⋋":"lthree","⋌":"rthree","⋍":"bsime","⋎":"cuvee","⋏":"cuwed","⋐":"Sub","⋑":"Sup","⋒":"Cap","⋓":"Cup","⋔":"fork","⋕":"epar","⋖":"ltdot","⋗":"gtdot","⋘":"Ll","⋘̸":"nLl","⋙":"Gg","⋙̸":"nGg","⋚︀":"lesg","⋚":"leg","⋛":"gel","⋛︀":"gesl","⋞":"cuepr","⋟":"cuesc","⋦":"lnsim","⋧":"gnsim","⋨":"prnsim","⋩":"scnsim","⋮":"vellip","⋯":"ctdot","⋰":"utdot","⋱":"dtdot","⋲":"disin","⋳":"isinsv","⋴":"isins","⋵":"isindot","⋵̸":"notindot","⋶":"notinvc","⋷":"notinvb","⋹":"isinE","⋹̸":"notinE","⋺":"nisd","⋻":"xnis","⋼":"nis","⋽":"notnivc","⋾":"notnivb","⌅":"barwed","⌆":"Barwed","⌌":"drcrop","⌍":"dlcrop","⌎":"urcrop","⌏":"ulcrop","⌐":"bnot","⌒":"profline","⌓":"profsurf","⌕":"telrec","⌖":"target","⌜":"ulcorn","⌝":"urcorn","⌞":"dlcorn","⌟":"drcorn","⌢":"frown","⌣":"smile","⌭":"cylcty","⌮":"profalar","⌶":"topbot","⌽":"ovbar","⌿":"solbar","⍼":"angzarr","⎰":"lmoust","⎱":"rmoust","⎴":"tbrk","⎵":"bbrk","⎶":"bbrktbrk","⏜":"OverParenthesis","⏝":"UnderParenthesis","⏞":"OverBrace","⏟":"UnderBrace","⏢":"trpezium","⏧":"elinters","␣":"blank","─":"boxh","│":"boxv","┌":"boxdr","┐":"boxdl","└":"boxur","┘":"boxul","├":"boxvr","┤":"boxvl","┬":"boxhd","┴":"boxhu","┼":"boxvh","═":"boxH","║":"boxV","╒":"boxdR","╓":"boxDr","╔":"boxDR","╕":"boxdL","╖":"boxDl","╗":"boxDL","╘":"boxuR","╙":"boxUr","╚":"boxUR","╛":"boxuL","╜":"boxUl","╝":"boxUL","╞":"boxvR","╟":"boxVr","╠":"boxVR","╡":"boxvL","╢":"boxVl","╣":"boxVL","╤":"boxHd","╥":"boxhD","╦":"boxHD","╧":"boxHu","╨":"boxhU","╩":"boxHU","╪":"boxvH","╫":"boxVh","╬":"boxVH","▀":"uhblk","▄":"lhblk","█":"block","░":"blk14","▒":"blk12","▓":"blk34","□":"squ","▪":"squf","▫":"EmptyVerySmallSquare","▭":"rect","▮":"marker","▱":"fltns","△":"xutri","▴":"utrif","▵":"utri","▸":"rtrif","▹":"rtri","▽":"xdtri","▾":"dtrif","▿":"dtri","◂":"ltrif","◃":"ltri","◊":"loz","○":"cir","◬":"tridot","◯":"xcirc","◸":"ultri","◹":"urtri","◺":"lltri","◻":"EmptySmallSquare","◼":"FilledSmallSquare","★":"starf","☆":"star","☎":"phone","♀":"female","♂":"male","♠":"spades","♣":"clubs","♥":"hearts","♦":"diams","♪":"sung","✓":"check","✗":"cross","✠":"malt","✶":"sext","❘":"VerticalSeparator","⟈":"bsolhsub","⟉":"suphsol","⟵":"xlarr","⟶":"xrarr","⟷":"xharr","⟸":"xlArr","⟹":"xrArr","⟺":"xhArr","⟼":"xmap","⟿":"dzigrarr","⤂":"nvlArr","⤃":"nvrArr","⤄":"nvHarr","⤅":"Map","⤌":"lbarr","⤍":"rbarr","⤎":"lBarr","⤏":"rBarr","⤐":"RBarr","⤑":"DDotrahd","⤒":"UpArrowBar","⤓":"DownArrowBar","⤖":"Rarrtl","⤙":"latail","⤚":"ratail","⤛":"lAtail","⤜":"rAtail","⤝":"larrfs","⤞":"rarrfs","⤟":"larrbfs","⤠":"rarrbfs","⤣":"nwarhk","⤤":"nearhk","⤥":"searhk","⤦":"swarhk","⤧":"nwnear","⤨":"toea","⤩":"tosa","⤪":"swnwar","⤳":"rarrc","⤳̸":"nrarrc","⤵":"cudarrr","⤶":"ldca","⤷":"rdca","⤸":"cudarrl","⤹":"larrpl","⤼":"curarrm","⤽":"cularrp","⥅":"rarrpl","⥈":"harrcir","⥉":"Uarrocir","⥊":"lurdshar","⥋":"ldrushar","⥎":"LeftRightVector","⥏":"RightUpDownVector","⥐":"DownLeftRightVector","⥑":"LeftUpDownVector","⥒":"LeftVectorBar","⥓":"RightVectorBar","⥔":"RightUpVectorBar","⥕":"RightDownVectorBar","⥖":"DownLeftVectorBar","⥗":"DownRightVectorBar","⥘":"LeftUpVectorBar","⥙":"LeftDownVectorBar","⥚":"LeftTeeVector","⥛":"RightTeeVector","⥜":"RightUpTeeVector","⥝":"RightDownTeeVector","⥞":"DownLeftTeeVector","⥟":"DownRightTeeVector","⥠":"LeftUpTeeVector","⥡":"LeftDownTeeVector","⥢":"lHar","⥣":"uHar","⥤":"rHar","⥥":"dHar","⥦":"luruhar","⥧":"ldrdhar","⥨":"ruluhar","⥩":"rdldhar","⥪":"lharul","⥫":"llhard","⥬":"rharul","⥭":"lrhard","⥮":"udhar","⥯":"duhar","⥰":"RoundImplies","⥱":"erarr","⥲":"simrarr","⥳":"larrsim","⥴":"rarrsim","⥵":"rarrap","⥶":"ltlarr","⥸":"gtrarr","⥹":"subrarr","⥻":"suplarr","⥼":"lfisht","⥽":"rfisht","⥾":"ufisht","⥿":"dfisht","⦚":"vzigzag","⦜":"vangrt","⦝":"angrtvbd","⦤":"ange","⦥":"range","⦦":"dwangle","⦧":"uwangle","⦨":"angmsdaa","⦩":"angmsdab","⦪":"angmsdac","⦫":"angmsdad","⦬":"angmsdae","⦭":"angmsdaf","⦮":"angmsdag","⦯":"angmsdah","⦰":"bemptyv","⦱":"demptyv","⦲":"cemptyv","⦳":"raemptyv","⦴":"laemptyv","⦵":"ohbar","⦶":"omid","⦷":"opar","⦹":"operp","⦻":"olcross","⦼":"odsold","⦾":"olcir","⦿":"ofcir","⧀":"olt","⧁":"ogt","⧂":"cirscir","⧃":"cirE","⧄":"solb","⧅":"bsolb","⧉":"boxbox","⧍":"trisb","⧎":"rtriltri","⧏":"LeftTriangleBar","⧏̸":"NotLeftTriangleBar","⧐":"RightTriangleBar","⧐̸":"NotRightTriangleBar","⧜":"iinfin","⧝":"infintie","⧞":"nvinfin","⧣":"eparsl","⧤":"smeparsl","⧥":"eqvparsl","⧫":"lozf","⧴":"RuleDelayed","⧶":"dsol","⨀":"xodot","⨁":"xoplus","⨂":"xotime","⨄":"xuplus","⨆":"xsqcup","⨍":"fpartint","⨐":"cirfnint","⨑":"awint","⨒":"rppolint","⨓":"scpolint","⨔":"npolint","⨕":"pointint","⨖":"quatint","⨗":"intlarhk","⨢":"pluscir","⨣":"plusacir","⨤":"simplus","⨥":"plusdu","⨦":"plussim","⨧":"plustwo","⨩":"mcomma","⨪":"minusdu","⨭":"loplus","⨮":"roplus","⨯":"Cross","⨰":"timesd","⨱":"timesbar","⨳":"smashp","⨴":"lotimes","⨵":"rotimes","⨶":"otimesas","⨷":"Otimes","⨸":"odiv","⨹":"triplus","⨺":"triminus","⨻":"tritime","⨼":"iprod","⨿":"amalg","⩀":"capdot","⩂":"ncup","⩃":"ncap","⩄":"capand","⩅":"cupor","⩆":"cupcap","⩇":"capcup","⩈":"cupbrcap","⩉":"capbrcup","⩊":"cupcup","⩋":"capcap","⩌":"ccups","⩍":"ccaps","⩐":"ccupssm","⩓":"And","⩔":"Or","⩕":"andand","⩖":"oror","⩗":"orslope","⩘":"andslope","⩚":"andv","⩛":"orv","⩜":"andd","⩝":"ord","⩟":"wedbar","⩦":"sdote","⩪":"simdot","⩭":"congdot","⩭̸":"ncongdot","⩮":"easter","⩯":"apacir","⩰":"apE","⩰̸":"napE","⩱":"eplus","⩲":"pluse","⩳":"Esim","⩷":"eDDot","⩸":"equivDD","⩹":"ltcir","⩺":"gtcir","⩻":"ltquest","⩼":"gtquest","⩽":"les","⩽̸":"nles","⩾":"ges","⩾̸":"nges","⩿":"lesdot","⪀":"gesdot","⪁":"lesdoto","⪂":"gesdoto","⪃":"lesdotor","⪄":"gesdotol","⪅":"lap","⪆":"gap","⪇":"lne","⪈":"gne","⪉":"lnap","⪊":"gnap","⪋":"lEg","⪌":"gEl","⪍":"lsime","⪎":"gsime","⪏":"lsimg","⪐":"gsiml","⪑":"lgE","⪒":"glE","⪓":"lesges","⪔":"gesles","⪕":"els","⪖":"egs","⪗":"elsdot","⪘":"egsdot","⪙":"el","⪚":"eg","⪝":"siml","⪞":"simg","⪟":"simlE","⪠":"simgE","⪡":"LessLess","⪡̸":"NotNestedLessLess","⪢":"GreaterGreater","⪢̸":"NotNestedGreaterGreater","⪤":"glj","⪥":"gla","⪦":"ltcc","⪧":"gtcc","⪨":"lescc","⪩":"gescc","⪪":"smt","⪫":"lat","⪬":"smte","⪬︀":"smtes","⪭":"late","⪭︀":"lates","⪮":"bumpE","⪯":"pre","⪯̸":"npre","⪰":"sce","⪰̸":"nsce","⪳":"prE","⪴":"scE","⪵":"prnE","⪶":"scnE","⪷":"prap","⪸":"scap","⪹":"prnap","⪺":"scnap","⪻":"Pr","⪼":"Sc","⪽":"subdot","⪾":"supdot","⪿":"subplus","⫀":"supplus","⫁":"submult","⫂":"supmult","⫃":"subedot","⫄":"supedot","⫅":"subE","⫅̸":"nsubE","⫆":"supE","⫆̸":"nsupE","⫇":"subsim","⫈":"supsim","⫋︀":"vsubnE","⫋":"subnE","⫌︀":"vsupnE","⫌":"supnE","⫏":"csub","⫐":"csup","⫑":"csube","⫒":"csupe","⫓":"subsup","⫔":"supsub","⫕":"subsub","⫖":"supsup","⫗":"suphsub","⫘":"supdsub","⫙":"forkv","⫚":"topfork","⫛":"mlcp","⫤":"Dashv","⫦":"Vdashl","⫧":"Barv","⫨":"vBar","⫩":"vBarv","⫫":"Vbar","⫬":"Not","⫭":"bNot","⫮":"rnmid","⫯":"cirmid","⫰":"midcir","⫱":"topcir","⫲":"nhpar","⫳":"parsim","⫽":"parsl","⫽⃥":"nparsl","♭":"flat","♮":"natur","♯":"sharp","¤":"curren","¢":"cent",$:"dollar","£":"pound","¥":"yen","€":"euro","¹":"sup1","½":"half","⅓":"frac13","¼":"frac14","⅕":"frac15","⅙":"frac16","⅛":"frac18","²":"sup2","⅔":"frac23","⅖":"frac25","³":"sup3","¾":"frac34","⅗":"frac35","⅜":"frac38","⅘":"frac45","⅚":"frac56","⅝":"frac58","⅞":"frac78","𝒶":"ascr","𝕒":"aopf","𝔞":"afr","𝔸":"Aopf","𝔄":"Afr","𝒜":"Ascr","ª":"ordf","á":"aacute","Á":"Aacute","à":"agrave","À":"Agrave","ă":"abreve","Ă":"Abreve","â":"acirc","Â":"Acirc","å":"aring","Å":"angst","ä":"auml","Ä":"Auml","ã":"atilde","Ã":"Atilde","ą":"aogon","Ą":"Aogon","ā":"amacr","Ā":"Amacr","æ":"aelig","Æ":"AElig","𝒷":"bscr","𝕓":"bopf","𝔟":"bfr","𝔹":"Bopf","ℬ":"Bscr","𝔅":"Bfr","𝔠":"cfr","𝒸":"cscr","𝕔":"copf","ℭ":"Cfr","𝒞":"Cscr","ℂ":"Copf","ć":"cacute","Ć":"Cacute","ĉ":"ccirc","Ĉ":"Ccirc","č":"ccaron","Č":"Ccaron","ċ":"cdot","Ċ":"Cdot","ç":"ccedil","Ç":"Ccedil","℅":"incare","𝔡":"dfr","ⅆ":"dd","𝕕":"dopf","𝒹":"dscr","𝒟":"Dscr","𝔇":"Dfr","ⅅ":"DD","𝔻":"Dopf","ď":"dcaron","Ď":"Dcaron","đ":"dstrok","Đ":"Dstrok","ð":"eth","Ð":"ETH","ⅇ":"ee","ℯ":"escr","𝔢":"efr","𝕖":"eopf","ℰ":"Escr","𝔈":"Efr","𝔼":"Eopf","é":"eacute","É":"Eacute","è":"egrave","È":"Egrave","ê":"ecirc","Ê":"Ecirc","ě":"ecaron","Ě":"Ecaron","ë":"euml","Ë":"Euml","ė":"edot","Ė":"Edot","ę":"eogon","Ę":"Eogon","ē":"emacr","Ē":"Emacr","𝔣":"ffr","𝕗":"fopf","𝒻":"fscr","𝔉":"Ffr","𝔽":"Fopf","ℱ":"Fscr","ff":"fflig","ffi":"ffilig","ffl":"ffllig","fi":"filig",fj:"fjlig","fl":"fllig","ƒ":"fnof","ℊ":"gscr","𝕘":"gopf","𝔤":"gfr","𝒢":"Gscr","𝔾":"Gopf","𝔊":"Gfr","ǵ":"gacute","ğ":"gbreve","Ğ":"Gbreve","ĝ":"gcirc","Ĝ":"Gcirc","ġ":"gdot","Ġ":"Gdot","Ģ":"Gcedil","𝔥":"hfr","ℎ":"planckh","𝒽":"hscr","𝕙":"hopf","ℋ":"Hscr","ℌ":"Hfr","ℍ":"Hopf","ĥ":"hcirc","Ĥ":"Hcirc","ℏ":"hbar","ħ":"hstrok","Ħ":"Hstrok","𝕚":"iopf","𝔦":"ifr","𝒾":"iscr","ⅈ":"ii","𝕀":"Iopf","ℐ":"Iscr","ℑ":"Im","í":"iacute","Í":"Iacute","ì":"igrave","Ì":"Igrave","î":"icirc","Î":"Icirc","ï":"iuml","Ï":"Iuml","ĩ":"itilde","Ĩ":"Itilde","İ":"Idot","į":"iogon","Į":"Iogon","ī":"imacr","Ī":"Imacr","ij":"ijlig","IJ":"IJlig","ı":"imath","𝒿":"jscr","𝕛":"jopf","𝔧":"jfr","𝒥":"Jscr","𝔍":"Jfr","𝕁":"Jopf","ĵ":"jcirc","Ĵ":"Jcirc","ȷ":"jmath","𝕜":"kopf","𝓀":"kscr","𝔨":"kfr","𝒦":"Kscr","𝕂":"Kopf","𝔎":"Kfr","ķ":"kcedil","Ķ":"Kcedil","𝔩":"lfr","𝓁":"lscr","ℓ":"ell","𝕝":"lopf","ℒ":"Lscr","𝔏":"Lfr","𝕃":"Lopf","ĺ":"lacute","Ĺ":"Lacute","ľ":"lcaron","Ľ":"Lcaron","ļ":"lcedil","Ļ":"Lcedil","ł":"lstrok","Ł":"Lstrok","ŀ":"lmidot","Ŀ":"Lmidot","𝔪":"mfr","𝕞":"mopf","𝓂":"mscr","𝔐":"Mfr","𝕄":"Mopf","ℳ":"Mscr","𝔫":"nfr","𝕟":"nopf","𝓃":"nscr","ℕ":"Nopf","𝒩":"Nscr","𝔑":"Nfr","ń":"nacute","Ń":"Nacute","ň":"ncaron","Ň":"Ncaron","ñ":"ntilde","Ñ":"Ntilde","ņ":"ncedil","Ņ":"Ncedil","№":"numero","ŋ":"eng","Ŋ":"ENG","𝕠":"oopf","𝔬":"ofr","ℴ":"oscr","𝒪":"Oscr","𝔒":"Ofr","𝕆":"Oopf","º":"ordm","ó":"oacute","Ó":"Oacute","ò":"ograve","Ò":"Ograve","ô":"ocirc","Ô":"Ocirc","ö":"ouml","Ö":"Ouml","ő":"odblac","Ő":"Odblac","õ":"otilde","Õ":"Otilde","ø":"oslash","Ø":"Oslash","ō":"omacr","Ō":"Omacr","œ":"oelig","Œ":"OElig","𝔭":"pfr","𝓅":"pscr","𝕡":"popf","ℙ":"Popf","𝔓":"Pfr","𝒫":"Pscr","𝕢":"qopf","𝔮":"qfr","𝓆":"qscr","𝒬":"Qscr","𝔔":"Qfr","ℚ":"Qopf","ĸ":"kgreen","𝔯":"rfr","𝕣":"ropf","𝓇":"rscr","ℛ":"Rscr","ℜ":"Re","ℝ":"Ropf","ŕ":"racute","Ŕ":"Racute","ř":"rcaron","Ř":"Rcaron","ŗ":"rcedil","Ŗ":"Rcedil","𝕤":"sopf","𝓈":"sscr","𝔰":"sfr","𝕊":"Sopf","𝔖":"Sfr","𝒮":"Sscr","Ⓢ":"oS","ś":"sacute","Ś":"Sacute","ŝ":"scirc","Ŝ":"Scirc","š":"scaron","Š":"Scaron","ş":"scedil","Ş":"Scedil","ß":"szlig","𝔱":"tfr","𝓉":"tscr","𝕥":"topf","𝒯":"Tscr","𝔗":"Tfr","𝕋":"Topf","ť":"tcaron","Ť":"Tcaron","ţ":"tcedil","Ţ":"Tcedil","™":"trade","ŧ":"tstrok","Ŧ":"Tstrok","𝓊":"uscr","𝕦":"uopf","𝔲":"ufr","𝕌":"Uopf","𝔘":"Ufr","𝒰":"Uscr","ú":"uacute","Ú":"Uacute","ù":"ugrave","Ù":"Ugrave","ŭ":"ubreve","Ŭ":"Ubreve","û":"ucirc","Û":"Ucirc","ů":"uring","Ů":"Uring","ü":"uuml","Ü":"Uuml","ű":"udblac","Ű":"Udblac","ũ":"utilde","Ũ":"Utilde","ų":"uogon","Ų":"Uogon","ū":"umacr","Ū":"Umacr","𝔳":"vfr","𝕧":"vopf","𝓋":"vscr","𝔙":"Vfr","𝕍":"Vopf","𝒱":"Vscr","𝕨":"wopf","𝓌":"wscr","𝔴":"wfr","𝒲":"Wscr","𝕎":"Wopf","𝔚":"Wfr","ŵ":"wcirc","Ŵ":"Wcirc","𝔵":"xfr","𝓍":"xscr","𝕩":"xopf","𝕏":"Xopf","𝔛":"Xfr","𝒳":"Xscr","𝔶":"yfr","𝓎":"yscr","𝕪":"yopf","𝒴":"Yscr","𝔜":"Yfr","𝕐":"Yopf","ý":"yacute","Ý":"Yacute","ŷ":"ycirc","Ŷ":"Ycirc","ÿ":"yuml","Ÿ":"Yuml","𝓏":"zscr","𝔷":"zfr","𝕫":"zopf","ℨ":"Zfr","ℤ":"Zopf","𝒵":"Zscr","ź":"zacute","Ź":"Zacute","ž":"zcaron","Ž":"Zcaron","ż":"zdot","Ż":"Zdot","Ƶ":"imped","þ":"thorn","Þ":"THORN","ʼn":"napos","α":"alpha","Α":"Alpha","β":"beta","Β":"Beta","γ":"gamma","Γ":"Gamma","δ":"delta","Δ":"Delta","ε":"epsi","ϵ":"epsiv","Ε":"Epsilon","ϝ":"gammad","Ϝ":"Gammad","ζ":"zeta","Ζ":"Zeta","η":"eta","Η":"Eta","θ":"theta","ϑ":"thetav","Θ":"Theta","ι":"iota","Ι":"Iota","κ":"kappa","ϰ":"kappav","Κ":"Kappa","λ":"lambda","Λ":"Lambda","μ":"mu","µ":"micro","Μ":"Mu","ν":"nu","Ν":"Nu","ξ":"xi","Ξ":"Xi","ο":"omicron","Ο":"Omicron","π":"pi","ϖ":"piv","Π":"Pi","ρ":"rho","ϱ":"rhov","Ρ":"Rho","σ":"sigma","Σ":"Sigma","ς":"sigmaf","τ":"tau","Τ":"Tau","υ":"upsi","Υ":"Upsilon","ϒ":"Upsi","φ":"phi","ϕ":"phiv","Φ":"Phi","χ":"chi","Χ":"Chi","ψ":"psi","Ψ":"Psi","ω":"omega","Ω":"ohm","а":"acy","А":"Acy","б":"bcy","Б":"Bcy","в":"vcy","В":"Vcy","г":"gcy","Г":"Gcy","ѓ":"gjcy","Ѓ":"GJcy","д":"dcy","Д":"Dcy","ђ":"djcy","Ђ":"DJcy","е":"iecy","Е":"IEcy","ё":"iocy","Ё":"IOcy","є":"jukcy","Є":"Jukcy","ж":"zhcy","Ж":"ZHcy","з":"zcy","З":"Zcy","ѕ":"dscy","Ѕ":"DScy","и":"icy","И":"Icy","і":"iukcy","І":"Iukcy","ї":"yicy","Ї":"YIcy","й":"jcy","Й":"Jcy","ј":"jsercy","Ј":"Jsercy","к":"kcy","К":"Kcy","ќ":"kjcy","Ќ":"KJcy","л":"lcy","Л":"Lcy","љ":"ljcy","Љ":"LJcy","м":"mcy","М":"Mcy","н":"ncy","Н":"Ncy","њ":"njcy","Њ":"NJcy","о":"ocy","О":"Ocy","п":"pcy","П":"Pcy","р":"rcy","Р":"Rcy","с":"scy","С":"Scy","т":"tcy","Т":"Tcy","ћ":"tshcy","Ћ":"TSHcy","у":"ucy","У":"Ucy","ў":"ubrcy","Ў":"Ubrcy","ф":"fcy","Ф":"Fcy","х":"khcy","Х":"KHcy","ц":"tscy","Ц":"TScy","ч":"chcy","Ч":"CHcy","џ":"dzcy","Џ":"DZcy","ш":"shcy","Ш":"SHcy","щ":"shchcy","Щ":"SHCHcy","ъ":"hardcy","Ъ":"HARDcy","ы":"ycy","Ы":"Ycy","ь":"softcy","Ь":"SOFTcy","э":"ecy","Э":"Ecy","ю":"yucy","Ю":"YUcy","я":"yacy","Я":"YAcy","ℵ":"aleph","ℶ":"beth","ℷ":"gimel","ℸ":"daleth"},h=/["&'<>`]/g,d={'"':""","&":"&","'":"'","<":"<",">":">","`":"`"},p=/&#(?:[xX][^a-fA-F0-9]|[^0-9xX])/,g=/[\0-\x08\x0B\x0E-\x1F\x7F-\x9F\uFDD0-\uFDEF\uFFFE\uFFFF]|[\uD83F\uD87F\uD8BF\uD8FF\uD93F\uD97F\uD9BF\uD9FF\uDA3F\uDA7F\uDABF\uDAFF\uDB3F\uDB7F\uDBBF\uDBFF][\uDFFE\uDFFF]|[\uD800-\uDBFF](?![\uDC00-\uDFFF])|(?:[^\uD800-\uDBFF]|^)[\uDC00-\uDFFF]/,y=/&(CounterClockwiseContourIntegral|DoubleLongLeftRightArrow|ClockwiseContourIntegral|NotNestedGreaterGreater|NotSquareSupersetEqual|DiacriticalDoubleAcute|NotRightTriangleEqual|NotSucceedsSlantEqual|NotPrecedesSlantEqual|CloseCurlyDoubleQuote|NegativeVeryThinSpace|DoubleContourIntegral|FilledVerySmallSquare|CapitalDifferentialD|OpenCurlyDoubleQuote|EmptyVerySmallSquare|NestedGreaterGreater|DoubleLongRightArrow|NotLeftTriangleEqual|NotGreaterSlantEqual|ReverseUpEquilibrium|DoubleLeftRightArrow|NotSquareSubsetEqual|NotDoubleVerticalBar|RightArrowLeftArrow|NotGreaterFullEqual|NotRightTriangleBar|SquareSupersetEqual|DownLeftRightVector|DoubleLongLeftArrow|leftrightsquigarrow|LeftArrowRightArrow|NegativeMediumSpace|blacktriangleright|RightDownVectorBar|PrecedesSlantEqual|RightDoubleBracket|SucceedsSlantEqual|NotLeftTriangleBar|RightTriangleEqual|SquareIntersection|RightDownTeeVector|ReverseEquilibrium|NegativeThickSpace|longleftrightarrow|Longleftrightarrow|LongLeftRightArrow|DownRightTeeVector|DownRightVectorBar|GreaterSlantEqual|SquareSubsetEqual|LeftDownVectorBar|LeftDoubleBracket|VerticalSeparator|rightleftharpoons|NotGreaterGreater|NotSquareSuperset|blacktriangleleft|blacktriangledown|NegativeThinSpace|LeftDownTeeVector|NotLessSlantEqual|leftrightharpoons|DoubleUpDownArrow|DoubleVerticalBar|LeftTriangleEqual|FilledSmallSquare|twoheadrightarrow|NotNestedLessLess|DownLeftTeeVector|DownLeftVectorBar|RightAngleBracket|NotTildeFullEqual|NotReverseElement|RightUpDownVector|DiacriticalTilde|NotSucceedsTilde|circlearrowright|NotPrecedesEqual|rightharpoondown|DoubleRightArrow|NotSucceedsEqual|NonBreakingSpace|NotRightTriangle|LessEqualGreater|RightUpTeeVector|LeftAngleBracket|GreaterFullEqual|DownArrowUpArrow|RightUpVectorBar|twoheadleftarrow|GreaterEqualLess|downharpoonright|RightTriangleBar|ntrianglerighteq|NotSupersetEqual|LeftUpDownVector|DiacriticalAcute|rightrightarrows|vartriangleright|UpArrowDownArrow|DiacriticalGrave|UnderParenthesis|EmptySmallSquare|LeftUpVectorBar|leftrightarrows|DownRightVector|downharpoonleft|trianglerighteq|ShortRightArrow|OverParenthesis|DoubleLeftArrow|DoubleDownArrow|NotSquareSubset|bigtriangledown|ntrianglelefteq|UpperRightArrow|curvearrowright|vartriangleleft|NotLeftTriangle|nleftrightarrow|LowerRightArrow|NotHumpDownHump|NotGreaterTilde|rightthreetimes|LeftUpTeeVector|NotGreaterEqual|straightepsilon|LeftTriangleBar|rightsquigarrow|ContourIntegral|rightleftarrows|CloseCurlyQuote|RightDownVector|LeftRightVector|nLeftrightarrow|leftharpoondown|circlearrowleft|SquareSuperset|OpenCurlyQuote|hookrightarrow|HorizontalLine|DiacriticalDot|NotLessGreater|ntriangleright|DoubleRightTee|InvisibleComma|InvisibleTimes|LowerLeftArrow|DownLeftVector|NotSubsetEqual|curvearrowleft|trianglelefteq|NotVerticalBar|TildeFullEqual|downdownarrows|NotGreaterLess|RightTeeVector|ZeroWidthSpace|looparrowright|LongRightArrow|doublebarwedge|ShortLeftArrow|ShortDownArrow|RightVectorBar|GreaterGreater|ReverseElement|rightharpoonup|LessSlantEqual|leftthreetimes|upharpoonright|rightarrowtail|LeftDownVector|Longrightarrow|NestedLessLess|UpperLeftArrow|nshortparallel|leftleftarrows|leftrightarrow|Leftrightarrow|LeftRightArrow|longrightarrow|upharpoonleft|RightArrowBar|ApplyFunction|LeftTeeVector|leftarrowtail|NotEqualTilde|varsubsetneqq|varsupsetneqq|RightTeeArrow|SucceedsEqual|SucceedsTilde|LeftVectorBar|SupersetEqual|hookleftarrow|DifferentialD|VerticalTilde|VeryThinSpace|blacktriangle|bigtriangleup|LessFullEqual|divideontimes|leftharpoonup|UpEquilibrium|ntriangleleft|RightTriangle|measuredangle|shortparallel|longleftarrow|Longleftarrow|LongLeftArrow|DoubleLeftTee|Poincareplane|PrecedesEqual|triangleright|DoubleUpArrow|RightUpVector|fallingdotseq|looparrowleft|PrecedesTilde|NotTildeEqual|NotTildeTilde|smallsetminus|Proportional|triangleleft|triangledown|UnderBracket|NotHumpEqual|exponentiale|ExponentialE|NotLessTilde|HilbertSpace|RightCeiling|blacklozenge|varsupsetneq|HumpDownHump|GreaterEqual|VerticalLine|LeftTeeArrow|NotLessEqual|DownTeeArrow|LeftTriangle|varsubsetneq|Intersection|NotCongruent|DownArrowBar|LeftUpVector|LeftArrowBar|risingdotseq|GreaterTilde|RoundImplies|SquareSubset|ShortUpArrow|NotSuperset|quaternions|precnapprox|backepsilon|preccurlyeq|OverBracket|blacksquare|MediumSpace|VerticalBar|circledcirc|circleddash|CircleMinus|CircleTimes|LessGreater|curlyeqprec|curlyeqsucc|diamondsuit|UpDownArrow|Updownarrow|RuleDelayed|Rrightarrow|updownarrow|RightVector|nRightarrow|nrightarrow|eqslantless|LeftCeiling|Equilibrium|SmallCircle|expectation|NotSucceeds|thickapprox|GreaterLess|SquareUnion|NotPrecedes|NotLessLess|straightphi|succnapprox|succcurlyeq|SubsetEqual|sqsupseteq|Proportion|Laplacetrf|ImaginaryI|supsetneqq|NotGreater|gtreqqless|NotElement|ThickSpace|TildeEqual|TildeTilde|Fouriertrf|rmoustache|EqualTilde|eqslantgtr|UnderBrace|LeftVector|UpArrowBar|nLeftarrow|nsubseteqq|subsetneqq|nsupseteqq|nleftarrow|succapprox|lessapprox|UpTeeArrow|upuparrows|curlywedge|lesseqqgtr|varepsilon|varnothing|RightFloor|complement|CirclePlus|sqsubseteq|Lleftarrow|circledast|RightArrow|Rightarrow|rightarrow|lmoustache|Bernoullis|precapprox|mapstoleft|mapstodown|longmapsto|dotsquare|downarrow|DoubleDot|nsubseteq|supsetneq|leftarrow|nsupseteq|subsetneq|ThinSpace|ngeqslant|subseteqq|HumpEqual|NotSubset|triangleq|NotCupCap|lesseqgtr|heartsuit|TripleDot|Leftarrow|Coproduct|Congruent|varpropto|complexes|gvertneqq|LeftArrow|LessTilde|supseteqq|MinusPlus|CircleDot|nleqslant|NotExists|gtreqless|nparallel|UnionPlus|LeftFloor|checkmark|CenterDot|centerdot|Mellintrf|gtrapprox|bigotimes|OverBrace|spadesuit|therefore|pitchfork|rationals|PlusMinus|Backslash|Therefore|DownBreve|backsimeq|backprime|DownArrow|nshortmid|Downarrow|lvertneqq|eqvparsl|imagline|imagpart|infintie|integers|Integral|intercal|LessLess|Uarrocir|intlarhk|sqsupset|angmsdaf|sqsubset|llcorner|vartheta|cupbrcap|lnapprox|Superset|SuchThat|succnsim|succneqq|angmsdag|biguplus|curlyvee|trpezium|Succeeds|NotTilde|bigwedge|angmsdah|angrtvbd|triminus|cwconint|fpartint|lrcorner|smeparsl|subseteq|urcorner|lurdshar|laemptyv|DDotrahd|approxeq|ldrushar|awconint|mapstoup|backcong|shortmid|triangle|geqslant|gesdotol|timesbar|circledR|circledS|setminus|multimap|naturals|scpolint|ncongdot|RightTee|boxminus|gnapprox|boxtimes|andslope|thicksim|angmsdaa|varsigma|cirfnint|rtriltri|angmsdab|rppolint|angmsdac|barwedge|drbkarow|clubsuit|thetasym|bsolhsub|capbrcup|dzigrarr|doteqdot|DotEqual|dotminus|UnderBar|NotEqual|realpart|otimesas|ulcorner|hksearow|hkswarow|parallel|PartialD|elinters|emptyset|plusacir|bbrktbrk|angmsdad|pointint|bigoplus|angmsdae|Precedes|bigsqcup|varkappa|notindot|supseteq|precneqq|precnsim|profalar|profline|profsurf|leqslant|lesdotor|raemptyv|subplus|notnivb|notnivc|subrarr|zigrarr|vzigzag|submult|subedot|Element|between|cirscir|larrbfs|larrsim|lotimes|lbrksld|lbrkslu|lozenge|ldrdhar|dbkarow|bigcirc|epsilon|simrarr|simplus|ltquest|Epsilon|luruhar|gtquest|maltese|npolint|eqcolon|npreceq|bigodot|ddagger|gtrless|bnequiv|harrcir|ddotseq|equivDD|backsim|demptyv|nsqsube|nsqsupe|Upsilon|nsubset|upsilon|minusdu|nsucceq|swarrow|nsupset|coloneq|searrow|boxplus|napprox|natural|asympeq|alefsym|congdot|nearrow|bigstar|diamond|supplus|tritime|LeftTee|nvinfin|triplus|NewLine|nvltrie|nvrtrie|nwarrow|nexists|Diamond|ruluhar|Implies|supmult|angzarr|suplarr|suphsub|questeq|because|digamma|Because|olcross|bemptyv|omicron|Omicron|rotimes|NoBreak|intprod|angrtvb|orderof|uwangle|suphsol|lesdoto|orslope|DownTee|realine|cudarrl|rdldhar|OverBar|supedot|lessdot|supdsub|topfork|succsim|rbrkslu|rbrksld|pertenk|cudarrr|isindot|planckh|lessgtr|pluscir|gesdoto|plussim|plustwo|lesssim|cularrp|rarrsim|Cayleys|notinva|notinvb|notinvc|UpArrow|Uparrow|uparrow|NotLess|dwangle|precsim|Product|curarrm|Cconint|dotplus|rarrbfs|ccupssm|Cedilla|cemptyv|notniva|quatint|frac35|frac38|frac45|frac56|frac58|frac78|tridot|xoplus|gacute|gammad|Gammad|lfisht|lfloor|bigcup|sqsupe|gbreve|Gbreve|lharul|sqsube|sqcups|Gcedil|apacir|llhard|lmidot|Lmidot|lmoust|andand|sqcaps|approx|Abreve|spades|circeq|tprime|divide|topcir|Assign|topbot|gesdot|divonx|xuplus|timesd|gesles|atilde|solbar|SOFTcy|loplus|timesb|lowast|lowbar|dlcorn|dlcrop|softcy|dollar|lparlt|thksim|lrhard|Atilde|lsaquo|smashp|bigvee|thinsp|wreath|bkarow|lsquor|lstrok|Lstrok|lthree|ltimes|ltlarr|DotDot|simdot|ltrPar|weierp|xsqcup|angmsd|sigmav|sigmaf|zeetrf|Zcaron|zcaron|mapsto|vsupne|thetav|cirmid|marker|mcomma|Zacute|vsubnE|there4|gtlPar|vsubne|bottom|gtrarr|SHCHcy|shchcy|midast|midcir|middot|minusb|minusd|gtrdot|bowtie|sfrown|mnplus|models|colone|seswar|Colone|mstpos|searhk|gtrsim|nacute|Nacute|boxbox|telrec|hairsp|Tcedil|nbumpe|scnsim|ncaron|Ncaron|ncedil|Ncedil|hamilt|Scedil|nearhk|hardcy|HARDcy|tcedil|Tcaron|commat|nequiv|nesear|tcaron|target|hearts|nexist|varrho|scedil|Scaron|scaron|hellip|Sacute|sacute|hercon|swnwar|compfn|rtimes|rthree|rsquor|rsaquo|zacute|wedgeq|homtht|barvee|barwed|Barwed|rpargt|horbar|conint|swarhk|roplus|nltrie|hslash|hstrok|Hstrok|rmoust|Conint|bprime|hybull|hyphen|iacute|Iacute|supsup|supsub|supsim|varphi|coprod|brvbar|agrave|Supset|supset|igrave|Igrave|notinE|Agrave|iiiint|iinfin|copysr|wedbar|Verbar|vangrt|becaus|incare|verbar|inodot|bullet|drcorn|intcal|drcrop|cularr|vellip|Utilde|bumpeq|cupcap|dstrok|Dstrok|CupCap|cupcup|cupdot|eacute|Eacute|supdot|iquest|easter|ecaron|Ecaron|ecolon|isinsv|utilde|itilde|Itilde|curarr|succeq|Bumpeq|cacute|ulcrop|nparsl|Cacute|nprcue|egrave|Egrave|nrarrc|nrarrw|subsup|subsub|nrtrie|jsercy|nsccue|Jsercy|kappav|kcedil|Kcedil|subsim|ulcorn|nsimeq|egsdot|veebar|kgreen|capand|elsdot|Subset|subset|curren|aacute|lacute|Lacute|emptyv|ntilde|Ntilde|lagran|lambda|Lambda|capcap|Ugrave|langle|subdot|emsp13|numero|emsp14|nvdash|nvDash|nVdash|nVDash|ugrave|ufisht|nvHarr|larrfs|nvlArr|larrhk|larrlp|larrpl|nvrArr|Udblac|nwarhk|larrtl|nwnear|oacute|Oacute|latail|lAtail|sstarf|lbrace|odblac|Odblac|lbrack|udblac|odsold|eparsl|lcaron|Lcaron|ograve|Ograve|lcedil|Lcedil|Aacute|ssmile|ssetmn|squarf|ldquor|capcup|ominus|cylcty|rharul|eqcirc|dagger|rfloor|rfisht|Dagger|daleth|equals|origof|capdot|equest|dcaron|Dcaron|rdquor|oslash|Oslash|otilde|Otilde|otimes|Otimes|urcrop|Ubreve|ubreve|Yacute|Uacute|uacute|Rcedil|rcedil|urcorn|parsim|Rcaron|Vdashl|rcaron|Tstrok|percnt|period|permil|Exists|yacute|rbrack|rbrace|phmmat|ccaron|Ccaron|planck|ccedil|plankv|tstrok|female|plusdo|plusdu|ffilig|plusmn|ffllig|Ccedil|rAtail|dfisht|bernou|ratail|Rarrtl|rarrtl|angsph|rarrpl|rarrlp|rarrhk|xwedge|xotime|forall|ForAll|Vvdash|vsupnE|preceq|bigcap|frac12|frac13|frac14|primes|rarrfs|prnsim|frac15|Square|frac16|square|lesdot|frac18|frac23|propto|prurel|rarrap|rangle|puncsp|frac25|Racute|qprime|racute|lesges|frac34|abreve|AElig|eqsim|utdot|setmn|urtri|Equal|Uring|seArr|uring|searr|dashv|Dashv|mumap|nabla|iogon|Iogon|sdote|sdotb|scsim|napid|napos|equiv|natur|Acirc|dblac|erarr|nbump|iprod|erDot|ucirc|awint|esdot|angrt|ncong|isinE|scnap|Scirc|scirc|ndash|isins|Ubrcy|nearr|neArr|isinv|nedot|ubrcy|acute|Ycirc|iukcy|Iukcy|xutri|nesim|caret|jcirc|Jcirc|caron|twixt|ddarr|sccue|exist|jmath|sbquo|ngeqq|angst|ccaps|lceil|ngsim|UpTee|delta|Delta|rtrif|nharr|nhArr|nhpar|rtrie|jukcy|Jukcy|kappa|rsquo|Kappa|nlarr|nlArr|TSHcy|rrarr|aogon|Aogon|fflig|xrarr|tshcy|ccirc|nleqq|filig|upsih|nless|dharl|nlsim|fjlig|ropar|nltri|dharr|robrk|roarr|fllig|fltns|roang|rnmid|subnE|subne|lAarr|trisb|Ccirc|acirc|ccups|blank|VDash|forkv|Vdash|langd|cedil|blk12|blk14|laquo|strns|diams|notin|vDash|larrb|blk34|block|disin|uplus|vdash|vBarv|aelig|starf|Wedge|check|xrArr|lates|lbarr|lBarr|notni|lbbrk|bcong|frasl|lbrke|frown|vrtri|vprop|vnsup|gamma|Gamma|wedge|xodot|bdquo|srarr|doteq|ldquo|boxdl|boxdL|gcirc|Gcirc|boxDl|boxDL|boxdr|boxdR|boxDr|TRADE|trade|rlhar|boxDR|vnsub|npart|vltri|rlarr|boxhd|boxhD|nprec|gescc|nrarr|nrArr|boxHd|boxHD|boxhu|boxhU|nrtri|boxHu|clubs|boxHU|times|colon|Colon|gimel|xlArr|Tilde|nsime|tilde|nsmid|nspar|THORN|thorn|xlarr|nsube|nsubE|thkap|xhArr|comma|nsucc|boxul|boxuL|nsupe|nsupE|gneqq|gnsim|boxUl|boxUL|grave|boxur|boxuR|boxUr|boxUR|lescc|angle|bepsi|boxvh|varpi|boxvH|numsp|Theta|gsime|gsiml|theta|boxVh|boxVH|boxvl|gtcir|gtdot|boxvL|boxVl|boxVL|crarr|cross|Cross|nvsim|boxvr|nwarr|nwArr|sqsup|dtdot|Uogon|lhard|lharu|dtrif|ocirc|Ocirc|lhblk|duarr|odash|sqsub|Hacek|sqcup|llarr|duhar|oelig|OElig|ofcir|boxvR|uogon|lltri|boxVr|csube|uuarr|ohbar|csupe|ctdot|olarr|olcir|harrw|oline|sqcap|omacr|Omacr|omega|Omega|boxVR|aleph|lneqq|lnsim|loang|loarr|rharu|lobrk|hcirc|operp|oplus|rhard|Hcirc|orarr|Union|order|ecirc|Ecirc|cuepr|szlig|cuesc|breve|reals|eDDot|Breve|hoarr|lopar|utrif|rdquo|Umacr|umacr|efDot|swArr|ultri|alpha|rceil|ovbar|swarr|Wcirc|wcirc|smtes|smile|bsemi|lrarr|aring|parsl|lrhar|bsime|uhblk|lrtri|cupor|Aring|uharr|uharl|slarr|rbrke|bsolb|lsime|rbbrk|RBarr|lsimg|phone|rBarr|rbarr|icirc|lsquo|Icirc|emacr|Emacr|ratio|simne|plusb|simlE|simgE|simeq|pluse|ltcir|ltdot|empty|xharr|xdtri|iexcl|Alpha|ltrie|rarrw|pound|ltrif|xcirc|bumpe|prcue|bumpE|asymp|amacr|cuvee|Sigma|sigma|iiint|udhar|iiota|ijlig|IJlig|supnE|imacr|Imacr|prime|Prime|image|prnap|eogon|Eogon|rarrc|mdash|mDDot|cuwed|imath|supne|imped|Amacr|udarr|prsim|micro|rarrb|cwint|raquo|infin|eplus|range|rangd|Ucirc|radic|minus|amalg|veeeq|rAarr|epsiv|ycirc|quest|sharp|quot|zwnj|Qscr|race|qscr|Qopf|qopf|qint|rang|Rang|Zscr|zscr|Zopf|zopf|rarr|rArr|Rarr|Pscr|pscr|prop|prod|prnE|prec|ZHcy|zhcy|prap|Zeta|zeta|Popf|popf|Zdot|plus|zdot|Yuml|yuml|phiv|YUcy|yucy|Yscr|yscr|perp|Yopf|yopf|part|para|YIcy|Ouml|rcub|yicy|YAcy|rdca|ouml|osol|Oscr|rdsh|yacy|real|oscr|xvee|andd|rect|andv|Xscr|oror|ordm|ordf|xscr|ange|aopf|Aopf|rHar|Xopf|opar|Oopf|xopf|xnis|rhov|oopf|omid|xmap|oint|apid|apos|ogon|ascr|Ascr|odot|odiv|xcup|xcap|ocir|oast|nvlt|nvle|nvgt|nvge|nvap|Wscr|wscr|auml|ntlg|ntgl|nsup|nsub|nsim|Nscr|nscr|nsce|Wopf|ring|npre|wopf|npar|Auml|Barv|bbrk|Nopf|nopf|nmid|nLtv|beta|ropf|Ropf|Beta|beth|nles|rpar|nleq|bnot|bNot|nldr|NJcy|rscr|Rscr|Vscr|vscr|rsqb|njcy|bopf|nisd|Bopf|rtri|Vopf|nGtv|ngtr|vopf|boxh|boxH|boxv|nges|ngeq|boxV|bscr|scap|Bscr|bsim|Vert|vert|bsol|bull|bump|caps|cdot|ncup|scnE|ncap|nbsp|napE|Cdot|cent|sdot|Vbar|nang|vBar|chcy|Mscr|mscr|sect|semi|CHcy|Mopf|mopf|sext|circ|cire|mldr|mlcp|cirE|comp|shcy|SHcy|vArr|varr|cong|copf|Copf|copy|COPY|malt|male|macr|lvnE|cscr|ltri|sime|ltcc|simg|Cscr|siml|csub|Uuml|lsqb|lsim|uuml|csup|Lscr|lscr|utri|smid|lpar|cups|smte|lozf|darr|Lopf|Uscr|solb|lopf|sopf|Sopf|lneq|uscr|spar|dArr|lnap|Darr|dash|Sqrt|LJcy|ljcy|lHar|dHar|Upsi|upsi|diam|lesg|djcy|DJcy|leqq|dopf|Dopf|dscr|Dscr|dscy|ldsh|ldca|squf|DScy|sscr|Sscr|dsol|lcub|late|star|Star|Uopf|Larr|lArr|larr|uopf|dtri|dzcy|sube|subE|Lang|lang|Kscr|kscr|Kopf|kopf|KJcy|kjcy|KHcy|khcy|DZcy|ecir|edot|eDot|Jscr|jscr|succ|Jopf|jopf|Edot|uHar|emsp|ensp|Iuml|iuml|eopf|isin|Iscr|iscr|Eopf|epar|sung|epsi|escr|sup1|sup2|sup3|Iota|iota|supe|supE|Iopf|iopf|IOcy|iocy|Escr|esim|Esim|imof|Uarr|QUOT|uArr|uarr|euml|IEcy|iecy|Idot|Euml|euro|excl|Hscr|hscr|Hopf|hopf|TScy|tscy|Tscr|hbar|tscr|flat|tbrk|fnof|hArr|harr|half|fopf|Fopf|tdot|gvnE|fork|trie|gtcc|fscr|Fscr|gdot|gsim|Gscr|gscr|Gopf|gopf|gneq|Gdot|tosa|gnap|Topf|topf|geqq|toea|GJcy|gjcy|tint|gesl|mid|Sfr|ggg|top|ges|gla|glE|glj|geq|gne|gEl|gel|gnE|Gcy|gcy|gap|Tfr|tfr|Tcy|tcy|Hat|Tau|Ffr|tau|Tab|hfr|Hfr|ffr|Fcy|fcy|icy|Icy|iff|ETH|eth|ifr|Ifr|Eta|eta|int|Int|Sup|sup|ucy|Ucy|Sum|sum|jcy|ENG|ufr|Ufr|eng|Jcy|jfr|els|ell|egs|Efr|efr|Jfr|uml|kcy|Kcy|Ecy|ecy|kfr|Kfr|lap|Sub|sub|lat|lcy|Lcy|leg|Dot|dot|lEg|leq|les|squ|div|die|lfr|Lfr|lgE|Dfr|dfr|Del|deg|Dcy|dcy|lne|lnE|sol|loz|smt|Cup|lrm|cup|lsh|Lsh|sim|shy|map|Map|mcy|Mcy|mfr|Mfr|mho|gfr|Gfr|sfr|cir|Chi|chi|nap|Cfr|vcy|Vcy|cfr|Scy|scy|ncy|Ncy|vee|Vee|Cap|cap|nfr|scE|sce|Nfr|nge|ngE|nGg|vfr|Vfr|ngt|bot|nGt|nis|niv|Rsh|rsh|nle|nlE|bne|Bfr|bfr|nLl|nlt|nLt|Bcy|bcy|not|Not|rlm|wfr|Wfr|npr|nsc|num|ocy|ast|Ocy|ofr|xfr|Xfr|Ofr|ogt|ohm|apE|olt|Rho|ape|rho|Rfr|rfr|ord|REG|ang|reg|orv|And|and|AMP|Rcy|amp|Afr|ycy|Ycy|yen|yfr|Yfr|rcy|par|pcy|Pcy|pfr|Pfr|phi|Phi|afr|Acy|acy|zcy|Zcy|piv|acE|acd|zfr|Zfr|pre|prE|psi|Psi|qfr|Qfr|zwj|Or|ge|Gg|gt|gg|el|oS|lt|Lt|LT|Re|lg|gl|eg|ne|Im|it|le|DD|wp|wr|nu|Nu|dd|lE|Sc|sc|pi|Pi|ee|af|ll|Ll|rx|gE|xi|pm|Xi|ic|pr|Pr|in|ni|mp|mu|ac|Mu|or|ap|Gt|GT|ii);|&(Aacute|Agrave|Atilde|Ccedil|Eacute|Egrave|Iacute|Igrave|Ntilde|Oacute|Ograve|Oslash|Otilde|Uacute|Ugrave|Yacute|aacute|agrave|atilde|brvbar|ccedil|curren|divide|eacute|egrave|frac12|frac14|frac34|iacute|igrave|iquest|middot|ntilde|oacute|ograve|oslash|otilde|plusmn|uacute|ugrave|yacute|AElig|Acirc|Aring|Ecirc|Icirc|Ocirc|THORN|Ucirc|acirc|acute|aelig|aring|cedil|ecirc|icirc|iexcl|laquo|micro|ocirc|pound|raquo|szlig|thorn|times|ucirc|Auml|COPY|Euml|Iuml|Ouml|QUOT|Uuml|auml|cent|copy|euml|iuml|macr|nbsp|ordf|ordm|ouml|para|quot|sect|sup1|sup2|sup3|uuml|yuml|AMP|ETH|REG|amp|deg|eth|not|reg|shy|uml|yen|GT|LT|gt|lt)(?!;)([=a-zA-Z0-9]?)|&#([0-9]+)(;?)|&#[xX]([a-fA-F0-9]+)(;?)|&([0-9a-zA-Z]+)/g,b={aacute:"á",Aacute:"Á",abreve:"ă",Abreve:"Ă",ac:"∾",acd:"∿",acE:"∾̳",acirc:"â",Acirc:"Â",acute:"´",acy:"а",Acy:"А",aelig:"æ",AElig:"Æ",af:"",afr:"𝔞",Afr:"𝔄",agrave:"à",Agrave:"À",alefsym:"ℵ",aleph:"ℵ",alpha:"α",Alpha:"Α",amacr:"ā",Amacr:"Ā",amalg:"⨿",amp:"&",AMP:"&",and:"∧",And:"⩓",andand:"⩕",andd:"⩜",andslope:"⩘",andv:"⩚",ang:"∠",ange:"⦤",angle:"∠",angmsd:"∡",angmsdaa:"⦨",angmsdab:"⦩",angmsdac:"⦪",angmsdad:"⦫",angmsdae:"⦬",angmsdaf:"⦭",angmsdag:"⦮",angmsdah:"⦯",angrt:"∟",angrtvb:"⊾",angrtvbd:"⦝",angsph:"∢",angst:"Å",angzarr:"⍼",aogon:"ą",Aogon:"Ą",aopf:"𝕒",Aopf:"𝔸",ap:"≈",apacir:"⩯",ape:"≊",apE:"⩰",apid:"≋",apos:"'",ApplyFunction:"",approx:"≈",approxeq:"≊",aring:"å",Aring:"Å",ascr:"𝒶",Ascr:"𝒜",Assign:"≔",ast:"*",asymp:"≈",asympeq:"≍",atilde:"ã",Atilde:"Ã",auml:"ä",Auml:"Ä",awconint:"∳",awint:"⨑",backcong:"≌",backepsilon:"϶",backprime:"‵",backsim:"∽",backsimeq:"⋍",Backslash:"∖",Barv:"⫧",barvee:"⊽",barwed:"⌅",Barwed:"⌆",barwedge:"⌅",bbrk:"⎵",bbrktbrk:"⎶",bcong:"≌",bcy:"б",Bcy:"Б",bdquo:"„",becaus:"∵",because:"∵",Because:"∵",bemptyv:"⦰",bepsi:"϶",bernou:"ℬ",Bernoullis:"ℬ",beta:"β",Beta:"Β",beth:"ℶ",between:"≬",bfr:"𝔟",Bfr:"𝔅",bigcap:"⋂",bigcirc:"◯",bigcup:"⋃",bigodot:"⨀",bigoplus:"⨁",bigotimes:"⨂",bigsqcup:"⨆",bigstar:"★",bigtriangledown:"▽",bigtriangleup:"△",biguplus:"⨄",bigvee:"⋁",bigwedge:"⋀",bkarow:"⤍",blacklozenge:"⧫",blacksquare:"▪",blacktriangle:"▴",blacktriangledown:"▾",blacktriangleleft:"◂",blacktriangleright:"▸",blank:"␣",blk12:"▒",blk14:"░",blk34:"▓",block:"█",bne:"=⃥",bnequiv:"≡⃥",bnot:"⌐",bNot:"⫭",bopf:"𝕓",Bopf:"𝔹",bot:"⊥",bottom:"⊥",bowtie:"⋈",boxbox:"⧉",boxdl:"┐",boxdL:"╕",boxDl:"╖",boxDL:"╗",boxdr:"┌",boxdR:"╒",boxDr:"╓",boxDR:"╔",boxh:"─",boxH:"═",boxhd:"┬",boxhD:"╥",boxHd:"╤",boxHD:"╦",boxhu:"┴",boxhU:"╨",boxHu:"╧",boxHU:"╩",boxminus:"⊟",boxplus:"⊞",boxtimes:"⊠",boxul:"┘",boxuL:"╛",boxUl:"╜",boxUL:"╝",boxur:"└",boxuR:"╘",boxUr:"╙",boxUR:"╚",boxv:"│",boxV:"║",boxvh:"┼",boxvH:"╪",boxVh:"╫",boxVH:"╬",boxvl:"┤",boxvL:"╡",boxVl:"╢",boxVL:"╣",boxvr:"├",boxvR:"╞",boxVr:"╟",boxVR:"╠",bprime:"‵",breve:"˘",Breve:"˘",brvbar:"¦",bscr:"𝒷",Bscr:"ℬ",bsemi:"⁏",bsim:"∽",bsime:"⋍",bsol:"\\",bsolb:"⧅",bsolhsub:"⟈",bull:"•",bullet:"•",bump:"≎",bumpe:"≏",bumpE:"⪮",bumpeq:"≏",Bumpeq:"≎",cacute:"ć",Cacute:"Ć",cap:"∩",Cap:"⋒",capand:"⩄",capbrcup:"⩉",capcap:"⩋",capcup:"⩇",capdot:"⩀",CapitalDifferentialD:"ⅅ",caps:"∩︀",caret:"⁁",caron:"ˇ",Cayleys:"ℭ",ccaps:"⩍",ccaron:"č",Ccaron:"Č",ccedil:"ç",Ccedil:"Ç",ccirc:"ĉ",Ccirc:"Ĉ",Cconint:"∰",ccups:"⩌",ccupssm:"⩐",cdot:"ċ",Cdot:"Ċ",cedil:"¸",Cedilla:"¸",cemptyv:"⦲",cent:"¢",centerdot:"·",CenterDot:"·",cfr:"𝔠",Cfr:"ℭ",chcy:"ч",CHcy:"Ч",check:"✓",checkmark:"✓",chi:"χ",Chi:"Χ",cir:"○",circ:"ˆ",circeq:"≗",circlearrowleft:"↺",circlearrowright:"↻",circledast:"⊛",circledcirc:"⊚",circleddash:"⊝",CircleDot:"⊙",circledR:"®",circledS:"Ⓢ",CircleMinus:"⊖",CirclePlus:"⊕",CircleTimes:"⊗",cire:"≗",cirE:"⧃",cirfnint:"⨐",cirmid:"⫯",cirscir:"⧂",ClockwiseContourIntegral:"∲",CloseCurlyDoubleQuote:"”",CloseCurlyQuote:"’",clubs:"♣",clubsuit:"♣",colon:":",Colon:"∷",colone:"≔",Colone:"⩴",coloneq:"≔",comma:",",commat:"@",comp:"∁",compfn:"∘",complement:"∁",complexes:"ℂ",cong:"≅",congdot:"⩭",Congruent:"≡",conint:"∮",Conint:"∯",ContourIntegral:"∮",copf:"𝕔",Copf:"ℂ",coprod:"∐",Coproduct:"∐",copy:"©",COPY:"©",copysr:"℗",CounterClockwiseContourIntegral:"∳",crarr:"↵",cross:"✗",Cross:"⨯",cscr:"𝒸",Cscr:"𝒞",csub:"⫏",csube:"⫑",csup:"⫐",csupe:"⫒",ctdot:"⋯",cudarrl:"⤸",cudarrr:"⤵",cuepr:"⋞",cuesc:"⋟",cularr:"↶",cularrp:"⤽",cup:"∪",Cup:"⋓",cupbrcap:"⩈",cupcap:"⩆",CupCap:"≍",cupcup:"⩊",cupdot:"⊍",cupor:"⩅",cups:"∪︀",curarr:"↷",curarrm:"⤼",curlyeqprec:"⋞",curlyeqsucc:"⋟",curlyvee:"⋎",curlywedge:"⋏",curren:"¤",curvearrowleft:"↶",curvearrowright:"↷",cuvee:"⋎",cuwed:"⋏",cwconint:"∲",cwint:"∱",cylcty:"⌭",dagger:"†",Dagger:"‡",daleth:"ℸ",darr:"↓",dArr:"⇓",Darr:"↡",dash:"‐",dashv:"⊣",Dashv:"⫤",dbkarow:"⤏",dblac:"˝",dcaron:"ď",Dcaron:"Ď",dcy:"д",Dcy:"Д",dd:"ⅆ",DD:"ⅅ",ddagger:"‡",ddarr:"⇊",DDotrahd:"⤑",ddotseq:"⩷",deg:"°",Del:"∇",delta:"δ",Delta:"Δ",demptyv:"⦱",dfisht:"⥿",dfr:"𝔡",Dfr:"𝔇",dHar:"⥥",dharl:"⇃",dharr:"⇂",DiacriticalAcute:"´",DiacriticalDot:"˙",DiacriticalDoubleAcute:"˝",DiacriticalGrave:"`",DiacriticalTilde:"˜",diam:"⋄",diamond:"⋄",Diamond:"⋄",diamondsuit:"♦",diams:"♦",die:"¨",DifferentialD:"ⅆ",digamma:"ϝ",disin:"⋲",div:"÷",divide:"÷",divideontimes:"⋇",divonx:"⋇",djcy:"ђ",DJcy:"Ђ",dlcorn:"⌞",dlcrop:"⌍",dollar:"$",dopf:"𝕕",Dopf:"𝔻",dot:"˙",Dot:"¨",DotDot:"⃜",doteq:"≐",doteqdot:"≑",DotEqual:"≐",dotminus:"∸",dotplus:"∔",dotsquare:"⊡",doublebarwedge:"⌆",DoubleContourIntegral:"∯",DoubleDot:"¨",DoubleDownArrow:"⇓",DoubleLeftArrow:"⇐",DoubleLeftRightArrow:"⇔",DoubleLeftTee:"⫤",DoubleLongLeftArrow:"⟸",DoubleLongLeftRightArrow:"⟺",DoubleLongRightArrow:"⟹",DoubleRightArrow:"⇒",DoubleRightTee:"⊨",DoubleUpArrow:"⇑",DoubleUpDownArrow:"⇕",DoubleVerticalBar:"∥",downarrow:"↓",Downarrow:"⇓",DownArrow:"↓",DownArrowBar:"⤓",DownArrowUpArrow:"⇵",DownBreve:"̑",downdownarrows:"⇊",downharpoonleft:"⇃",downharpoonright:"⇂",DownLeftRightVector:"⥐",DownLeftTeeVector:"⥞",DownLeftVector:"↽",DownLeftVectorBar:"⥖",DownRightTeeVector:"⥟",DownRightVector:"⇁",DownRightVectorBar:"⥗",DownTee:"⊤",DownTeeArrow:"↧",drbkarow:"⤐",drcorn:"⌟",drcrop:"⌌",dscr:"𝒹",Dscr:"𝒟",dscy:"ѕ",DScy:"Ѕ",dsol:"⧶",dstrok:"đ",Dstrok:"Đ",dtdot:"⋱",dtri:"▿",dtrif:"▾",duarr:"⇵",duhar:"⥯",dwangle:"⦦",dzcy:"џ",DZcy:"Џ",dzigrarr:"⟿",eacute:"é",Eacute:"É",easter:"⩮",ecaron:"ě",Ecaron:"Ě",ecir:"≖",ecirc:"ê",Ecirc:"Ê",ecolon:"≕",ecy:"э",Ecy:"Э",eDDot:"⩷",edot:"ė",eDot:"≑",Edot:"Ė",ee:"ⅇ",efDot:"≒",efr:"𝔢",Efr:"𝔈",eg:"⪚",egrave:"è",Egrave:"È",egs:"⪖",egsdot:"⪘",el:"⪙",Element:"∈",elinters:"⏧",ell:"ℓ",els:"⪕",elsdot:"⪗",emacr:"ē",Emacr:"Ē",empty:"∅",emptyset:"∅",EmptySmallSquare:"◻",emptyv:"∅",EmptyVerySmallSquare:"▫",emsp:" ",emsp13:" ",emsp14:" ",eng:"ŋ",ENG:"Ŋ",ensp:" ",eogon:"ę",Eogon:"Ę",eopf:"𝕖",Eopf:"𝔼",epar:"⋕",eparsl:"⧣",eplus:"⩱",epsi:"ε",epsilon:"ε",Epsilon:"Ε",epsiv:"ϵ",eqcirc:"≖",eqcolon:"≕",eqsim:"≂",eqslantgtr:"⪖",eqslantless:"⪕",Equal:"⩵",equals:"=",EqualTilde:"≂",equest:"≟",Equilibrium:"⇌",equiv:"≡",equivDD:"⩸",eqvparsl:"⧥",erarr:"⥱",erDot:"≓",escr:"ℯ",Escr:"ℰ",esdot:"≐",esim:"≂",Esim:"⩳",eta:"η",Eta:"Η",eth:"ð",ETH:"Ð",euml:"ë",Euml:"Ë",euro:"€",excl:"!",exist:"∃",Exists:"∃",expectation:"ℰ",exponentiale:"ⅇ",ExponentialE:"ⅇ",fallingdotseq:"≒",fcy:"ф",Fcy:"Ф",female:"♀",ffilig:"ffi",fflig:"ff",ffllig:"ffl",ffr:"𝔣",Ffr:"𝔉",filig:"fi",FilledSmallSquare:"◼",FilledVerySmallSquare:"▪",fjlig:"fj",flat:"♭",fllig:"fl",fltns:"▱",fnof:"ƒ",fopf:"𝕗",Fopf:"𝔽",forall:"∀",ForAll:"∀",fork:"⋔",forkv:"⫙",Fouriertrf:"ℱ",fpartint:"⨍",frac12:"½",frac13:"⅓",frac14:"¼",frac15:"⅕",frac16:"⅙",frac18:"⅛",frac23:"⅔",frac25:"⅖",frac34:"¾",frac35:"⅗",frac38:"⅜",frac45:"⅘",frac56:"⅚",frac58:"⅝",frac78:"⅞",frasl:"⁄",frown:"⌢",fscr:"𝒻",Fscr:"ℱ",gacute:"ǵ",gamma:"γ",Gamma:"Γ",gammad:"ϝ",Gammad:"Ϝ",gap:"⪆",gbreve:"ğ",Gbreve:"Ğ",Gcedil:"Ģ",gcirc:"ĝ",Gcirc:"Ĝ",gcy:"г",Gcy:"Г",gdot:"ġ",Gdot:"Ġ",ge:"≥",gE:"≧",gel:"⋛",gEl:"⪌",geq:"≥",geqq:"≧",geqslant:"⩾",ges:"⩾",gescc:"⪩",gesdot:"⪀",gesdoto:"⪂",gesdotol:"⪄",gesl:"⋛︀",gesles:"⪔",gfr:"𝔤",Gfr:"𝔊",gg:"≫",Gg:"⋙",ggg:"⋙",gimel:"ℷ",gjcy:"ѓ",GJcy:"Ѓ",gl:"≷",gla:"⪥",glE:"⪒",glj:"⪤",gnap:"⪊",gnapprox:"⪊",gne:"⪈",gnE:"≩",gneq:"⪈",gneqq:"≩",gnsim:"⋧",gopf:"𝕘",Gopf:"𝔾",grave:"`",GreaterEqual:"≥",GreaterEqualLess:"⋛",GreaterFullEqual:"≧",GreaterGreater:"⪢",GreaterLess:"≷",GreaterSlantEqual:"⩾",GreaterTilde:"≳",gscr:"ℊ",Gscr:"𝒢",gsim:"≳",gsime:"⪎",gsiml:"⪐",gt:">",Gt:"≫",GT:">",gtcc:"⪧",gtcir:"⩺",gtdot:"⋗",gtlPar:"⦕",gtquest:"⩼",gtrapprox:"⪆",gtrarr:"⥸",gtrdot:"⋗",gtreqless:"⋛",gtreqqless:"⪌",gtrless:"≷",gtrsim:"≳",gvertneqq:"≩︀",gvnE:"≩︀",Hacek:"ˇ",hairsp:" ",half:"½",hamilt:"ℋ",hardcy:"ъ",HARDcy:"Ъ",harr:"↔",hArr:"⇔",harrcir:"⥈",harrw:"↭",Hat:"^",hbar:"ℏ",hcirc:"ĥ",Hcirc:"Ĥ",hearts:"♥",heartsuit:"♥",hellip:"…",hercon:"⊹",hfr:"𝔥",Hfr:"ℌ",HilbertSpace:"ℋ",hksearow:"⤥",hkswarow:"⤦",hoarr:"⇿",homtht:"∻",hookleftarrow:"↩",hookrightarrow:"↪",hopf:"𝕙",Hopf:"ℍ",horbar:"―",HorizontalLine:"─",hscr:"𝒽",Hscr:"ℋ",hslash:"ℏ",hstrok:"ħ",Hstrok:"Ħ",HumpDownHump:"≎",HumpEqual:"≏",hybull:"⁃",hyphen:"‐",iacute:"í",Iacute:"Í",ic:"",icirc:"î",Icirc:"Î",icy:"и",Icy:"И",Idot:"İ",iecy:"е",IEcy:"Е",iexcl:"¡",iff:"⇔",ifr:"𝔦",Ifr:"ℑ",igrave:"ì",Igrave:"Ì",ii:"ⅈ",iiiint:"⨌",iiint:"∭",iinfin:"⧜",iiota:"℩",ijlig:"ij",IJlig:"IJ",Im:"ℑ",imacr:"ī",Imacr:"Ī",image:"ℑ",ImaginaryI:"ⅈ",imagline:"ℐ",imagpart:"ℑ",imath:"ı",imof:"⊷",imped:"Ƶ",Implies:"⇒",in:"∈",incare:"℅",infin:"∞",infintie:"⧝",inodot:"ı",int:"∫",Int:"∬",intcal:"⊺",integers:"ℤ",Integral:"∫",intercal:"⊺",Intersection:"⋂",intlarhk:"⨗",intprod:"⨼",InvisibleComma:"",InvisibleTimes:"",iocy:"ё",IOcy:"Ё",iogon:"į",Iogon:"Į",iopf:"𝕚",Iopf:"𝕀",iota:"ι",Iota:"Ι",iprod:"⨼",iquest:"¿",iscr:"𝒾",Iscr:"ℐ",isin:"∈",isindot:"⋵",isinE:"⋹",isins:"⋴",isinsv:"⋳",isinv:"∈",it:"",itilde:"ĩ",Itilde:"Ĩ",iukcy:"і",Iukcy:"І",iuml:"ï",Iuml:"Ï",jcirc:"ĵ",Jcirc:"Ĵ",jcy:"й",Jcy:"Й",jfr:"𝔧",Jfr:"𝔍",jmath:"ȷ",jopf:"𝕛",Jopf:"𝕁",jscr:"𝒿",Jscr:"𝒥",jsercy:"ј",Jsercy:"Ј",jukcy:"є",Jukcy:"Є",kappa:"κ",Kappa:"Κ",kappav:"ϰ",kcedil:"ķ",Kcedil:"Ķ",kcy:"к",Kcy:"К",kfr:"𝔨",Kfr:"𝔎",kgreen:"ĸ",khcy:"х",KHcy:"Х",kjcy:"ќ",KJcy:"Ќ",kopf:"𝕜",Kopf:"𝕂",kscr:"𝓀",Kscr:"𝒦",lAarr:"⇚",lacute:"ĺ",Lacute:"Ĺ",laemptyv:"⦴",lagran:"ℒ",lambda:"λ",Lambda:"Λ",lang:"⟨",Lang:"⟪",langd:"⦑",langle:"⟨",lap:"⪅",Laplacetrf:"ℒ",laquo:"«",larr:"←",lArr:"⇐",Larr:"↞",larrb:"⇤",larrbfs:"⤟",larrfs:"⤝",larrhk:"↩",larrlp:"↫",larrpl:"⤹",larrsim:"⥳",larrtl:"↢",lat:"⪫",latail:"⤙",lAtail:"⤛",late:"⪭",lates:"⪭︀",lbarr:"⤌",lBarr:"⤎",lbbrk:"❲",lbrace:"{",lbrack:"[",lbrke:"⦋",lbrksld:"⦏",lbrkslu:"⦍",lcaron:"ľ",Lcaron:"Ľ",lcedil:"ļ",Lcedil:"Ļ",lceil:"⌈",lcub:"{",lcy:"л",Lcy:"Л",ldca:"⤶",ldquo:"“",ldquor:"„",ldrdhar:"⥧",ldrushar:"⥋",ldsh:"↲",le:"≤",lE:"≦",LeftAngleBracket:"⟨",leftarrow:"←",Leftarrow:"⇐",LeftArrow:"←",LeftArrowBar:"⇤",LeftArrowRightArrow:"⇆",leftarrowtail:"↢",LeftCeiling:"⌈",LeftDoubleBracket:"⟦",LeftDownTeeVector:"⥡",LeftDownVector:"⇃",LeftDownVectorBar:"⥙",LeftFloor:"⌊",leftharpoondown:"↽",leftharpoonup:"↼",leftleftarrows:"⇇",leftrightarrow:"↔",Leftrightarrow:"⇔",LeftRightArrow:"↔",leftrightarrows:"⇆",leftrightharpoons:"⇋",leftrightsquigarrow:"↭",LeftRightVector:"⥎",LeftTee:"⊣",LeftTeeArrow:"↤",LeftTeeVector:"⥚",leftthreetimes:"⋋",LeftTriangle:"⊲",LeftTriangleBar:"⧏",LeftTriangleEqual:"⊴",LeftUpDownVector:"⥑",LeftUpTeeVector:"⥠",LeftUpVector:"↿",LeftUpVectorBar:"⥘",LeftVector:"↼",LeftVectorBar:"⥒",leg:"⋚",lEg:"⪋",leq:"≤",leqq:"≦",leqslant:"⩽",les:"⩽",lescc:"⪨",lesdot:"⩿",lesdoto:"⪁",lesdotor:"⪃",lesg:"⋚︀",lesges:"⪓",lessapprox:"⪅",lessdot:"⋖",lesseqgtr:"⋚",lesseqqgtr:"⪋",LessEqualGreater:"⋚",LessFullEqual:"≦",LessGreater:"≶",lessgtr:"≶",LessLess:"⪡",lesssim:"≲",LessSlantEqual:"⩽",LessTilde:"≲",lfisht:"⥼",lfloor:"⌊",lfr:"𝔩",Lfr:"𝔏",lg:"≶",lgE:"⪑",lHar:"⥢",lhard:"↽",lharu:"↼",lharul:"⥪",lhblk:"▄",ljcy:"љ",LJcy:"Љ",ll:"≪",Ll:"⋘",llarr:"⇇",llcorner:"⌞",Lleftarrow:"⇚",llhard:"⥫",lltri:"◺",lmidot:"ŀ",Lmidot:"Ŀ",lmoust:"⎰",lmoustache:"⎰",lnap:"⪉",lnapprox:"⪉",lne:"⪇",lnE:"≨",lneq:"⪇",lneqq:"≨",lnsim:"⋦",loang:"⟬",loarr:"⇽",lobrk:"⟦",longleftarrow:"⟵",Longleftarrow:"⟸",LongLeftArrow:"⟵",longleftrightarrow:"⟷",Longleftrightarrow:"⟺",LongLeftRightArrow:"⟷",longmapsto:"⟼",longrightarrow:"⟶",Longrightarrow:"⟹",LongRightArrow:"⟶",looparrowleft:"↫",looparrowright:"↬",lopar:"⦅",lopf:"𝕝",Lopf:"𝕃",loplus:"⨭",lotimes:"⨴",lowast:"∗",lowbar:"_",LowerLeftArrow:"↙",LowerRightArrow:"↘",loz:"◊",lozenge:"◊",lozf:"⧫",lpar:"(",lparlt:"⦓",lrarr:"⇆",lrcorner:"⌟",lrhar:"⇋",lrhard:"⥭",lrm:"",lrtri:"⊿",lsaquo:"‹",lscr:"𝓁",Lscr:"ℒ",lsh:"↰",Lsh:"↰",lsim:"≲",lsime:"⪍",lsimg:"⪏",lsqb:"[",lsquo:"‘",lsquor:"‚",lstrok:"ł",Lstrok:"Ł",lt:"<",Lt:"≪",LT:"<",ltcc:"⪦",ltcir:"⩹",ltdot:"⋖",lthree:"⋋",ltimes:"⋉",ltlarr:"⥶",ltquest:"⩻",ltri:"◃",ltrie:"⊴",ltrif:"◂",ltrPar:"⦖",lurdshar:"⥊",luruhar:"⥦",lvertneqq:"≨︀",lvnE:"≨︀",macr:"¯",male:"♂",malt:"✠",maltese:"✠",map:"↦",Map:"⤅",mapsto:"↦",mapstodown:"↧",mapstoleft:"↤",mapstoup:"↥",marker:"▮",mcomma:"⨩",mcy:"м",Mcy:"М",mdash:"—",mDDot:"∺",measuredangle:"∡",MediumSpace:" ",Mellintrf:"ℳ",mfr:"𝔪",Mfr:"𝔐",mho:"℧",micro:"µ",mid:"∣",midast:"*",midcir:"⫰",middot:"·",minus:"−",minusb:"⊟",minusd:"∸",minusdu:"⨪",MinusPlus:"∓",mlcp:"⫛",mldr:"…",mnplus:"∓",models:"⊧",mopf:"𝕞",Mopf:"𝕄",mp:"∓",mscr:"𝓂",Mscr:"ℳ",mstpos:"∾",mu:"μ",Mu:"Μ",multimap:"⊸",mumap:"⊸",nabla:"∇",nacute:"ń",Nacute:"Ń",nang:"∠⃒",nap:"≉",napE:"⩰̸",napid:"≋̸",napos:"ʼn",napprox:"≉",natur:"♮",natural:"♮",naturals:"ℕ",nbsp:" ",nbump:"≎̸",nbumpe:"≏̸",ncap:"⩃",ncaron:"ň",Ncaron:"Ň",ncedil:"ņ",Ncedil:"Ņ",ncong:"≇",ncongdot:"⩭̸",ncup:"⩂",ncy:"н",Ncy:"Н",ndash:"–",ne:"≠",nearhk:"⤤",nearr:"↗",neArr:"⇗",nearrow:"↗",nedot:"≐̸",NegativeMediumSpace:"",NegativeThickSpace:"",NegativeThinSpace:"",NegativeVeryThinSpace:"",nequiv:"≢",nesear:"⤨",nesim:"≂̸",NestedGreaterGreater:"≫",NestedLessLess:"≪",NewLine:"\n",nexist:"∄",nexists:"∄",nfr:"𝔫",Nfr:"𝔑",nge:"≱",ngE:"≧̸",ngeq:"≱",ngeqq:"≧̸",ngeqslant:"⩾̸",nges:"⩾̸",nGg:"⋙̸",ngsim:"≵",ngt:"≯",nGt:"≫⃒",ngtr:"≯",nGtv:"≫̸",nharr:"↮",nhArr:"⇎",nhpar:"⫲",ni:"∋",nis:"⋼",nisd:"⋺",niv:"∋",njcy:"њ",NJcy:"Њ",nlarr:"↚",nlArr:"⇍",nldr:"‥",nle:"≰",nlE:"≦̸",nleftarrow:"↚",nLeftarrow:"⇍",nleftrightarrow:"↮",nLeftrightarrow:"⇎",nleq:"≰",nleqq:"≦̸",nleqslant:"⩽̸",nles:"⩽̸",nless:"≮",nLl:"⋘̸",nlsim:"≴",nlt:"≮",nLt:"≪⃒",nltri:"⋪",nltrie:"⋬",nLtv:"≪̸",nmid:"∤",NoBreak:"",NonBreakingSpace:" ",nopf:"𝕟",Nopf:"ℕ",not:"¬",Not:"⫬",NotCongruent:"≢",NotCupCap:"≭",NotDoubleVerticalBar:"∦",NotElement:"∉",NotEqual:"≠",NotEqualTilde:"≂̸",NotExists:"∄",NotGreater:"≯",NotGreaterEqual:"≱",NotGreaterFullEqual:"≧̸",NotGreaterGreater:"≫̸",NotGreaterLess:"≹",NotGreaterSlantEqual:"⩾̸",NotGreaterTilde:"≵",NotHumpDownHump:"≎̸",NotHumpEqual:"≏̸",notin:"∉",notindot:"⋵̸",notinE:"⋹̸",notinva:"∉",notinvb:"⋷",notinvc:"⋶",NotLeftTriangle:"⋪",NotLeftTriangleBar:"⧏̸",NotLeftTriangleEqual:"⋬",NotLess:"≮",NotLessEqual:"≰",NotLessGreater:"≸",NotLessLess:"≪̸",NotLessSlantEqual:"⩽̸",NotLessTilde:"≴",NotNestedGreaterGreater:"⪢̸",NotNestedLessLess:"⪡̸",notni:"∌",notniva:"∌",notnivb:"⋾",notnivc:"⋽",NotPrecedes:"⊀",NotPrecedesEqual:"⪯̸",NotPrecedesSlantEqual:"⋠",NotReverseElement:"∌",NotRightTriangle:"⋫",NotRightTriangleBar:"⧐̸",NotRightTriangleEqual:"⋭",NotSquareSubset:"⊏̸",NotSquareSubsetEqual:"⋢",NotSquareSuperset:"⊐̸",NotSquareSupersetEqual:"⋣",NotSubset:"⊂⃒",NotSubsetEqual:"⊈",NotSucceeds:"⊁",NotSucceedsEqual:"⪰̸",NotSucceedsSlantEqual:"⋡",NotSucceedsTilde:"≿̸",NotSuperset:"⊃⃒",NotSupersetEqual:"⊉",NotTilde:"≁",NotTildeEqual:"≄",NotTildeFullEqual:"≇",NotTildeTilde:"≉",NotVerticalBar:"∤",npar:"∦",nparallel:"∦",nparsl:"⫽⃥",npart:"∂̸",npolint:"⨔",npr:"⊀",nprcue:"⋠",npre:"⪯̸",nprec:"⊀",npreceq:"⪯̸",nrarr:"↛",nrArr:"⇏",nrarrc:"⤳̸",nrarrw:"↝̸",nrightarrow:"↛",nRightarrow:"⇏",nrtri:"⋫",nrtrie:"⋭",nsc:"⊁",nsccue:"⋡",nsce:"⪰̸",nscr:"𝓃",Nscr:"𝒩",nshortmid:"∤",nshortparallel:"∦",nsim:"≁",nsime:"≄",nsimeq:"≄",nsmid:"∤",nspar:"∦",nsqsube:"⋢",nsqsupe:"⋣",nsub:"⊄",nsube:"⊈",nsubE:"⫅̸",nsubset:"⊂⃒",nsubseteq:"⊈",nsubseteqq:"⫅̸",nsucc:"⊁",nsucceq:"⪰̸",nsup:"⊅",nsupe:"⊉",nsupE:"⫆̸",nsupset:"⊃⃒",nsupseteq:"⊉",nsupseteqq:"⫆̸",ntgl:"≹",ntilde:"ñ",Ntilde:"Ñ",ntlg:"≸",ntriangleleft:"⋪",ntrianglelefteq:"⋬",ntriangleright:"⋫",ntrianglerighteq:"⋭",nu:"ν",Nu:"Ν",num:"#",numero:"№",numsp:" ",nvap:"≍⃒",nvdash:"⊬",nvDash:"⊭",nVdash:"⊮",nVDash:"⊯",nvge:"≥⃒",nvgt:">⃒",nvHarr:"⤄",nvinfin:"⧞",nvlArr:"⤂",nvle:"≤⃒",nvlt:"<⃒",nvltrie:"⊴⃒",nvrArr:"⤃",nvrtrie:"⊵⃒",nvsim:"∼⃒",nwarhk:"⤣",nwarr:"↖",nwArr:"⇖",nwarrow:"↖",nwnear:"⤧",oacute:"ó",Oacute:"Ó",oast:"⊛",ocir:"⊚",ocirc:"ô",Ocirc:"Ô",ocy:"о",Ocy:"О",odash:"⊝",odblac:"ő",Odblac:"Ő",odiv:"⨸",odot:"⊙",odsold:"⦼",oelig:"œ",OElig:"Œ",ofcir:"⦿",ofr:"𝔬",Ofr:"𝔒",ogon:"˛",ograve:"ò",Ograve:"Ò",ogt:"⧁",ohbar:"⦵",ohm:"Ω",oint:"∮",olarr:"↺",olcir:"⦾",olcross:"⦻",oline:"‾",olt:"⧀",omacr:"ō",Omacr:"Ō",omega:"ω",Omega:"Ω",omicron:"ο",Omicron:"Ο",omid:"⦶",ominus:"⊖",oopf:"𝕠",Oopf:"𝕆",opar:"⦷",OpenCurlyDoubleQuote:"“",OpenCurlyQuote:"‘",operp:"⦹",oplus:"⊕",or:"∨",Or:"⩔",orarr:"↻",ord:"⩝",order:"ℴ",orderof:"ℴ",ordf:"ª",ordm:"º",origof:"⊶",oror:"⩖",orslope:"⩗",orv:"⩛",oS:"Ⓢ",oscr:"ℴ",Oscr:"𝒪",oslash:"ø",Oslash:"Ø",osol:"⊘",otilde:"õ",Otilde:"Õ",otimes:"⊗",Otimes:"⨷",otimesas:"⨶",ouml:"ö",Ouml:"Ö",ovbar:"⌽",OverBar:"‾",OverBrace:"⏞",OverBracket:"⎴",OverParenthesis:"⏜",par:"∥",para:"¶",parallel:"∥",parsim:"⫳",parsl:"⫽",part:"∂",PartialD:"∂",pcy:"п",Pcy:"П",percnt:"%",period:".",permil:"‰",perp:"⊥",pertenk:"‱",pfr:"𝔭",Pfr:"𝔓",phi:"φ",Phi:"Φ",phiv:"ϕ",phmmat:"ℳ",phone:"☎",pi:"π",Pi:"Π",pitchfork:"⋔",piv:"ϖ",planck:"ℏ",planckh:"ℎ",plankv:"ℏ",plus:"+",plusacir:"⨣",plusb:"⊞",pluscir:"⨢",plusdo:"∔",plusdu:"⨥",pluse:"⩲",PlusMinus:"±",plusmn:"±",plussim:"⨦",plustwo:"⨧",pm:"±",Poincareplane:"ℌ",pointint:"⨕",popf:"𝕡",Popf:"ℙ",pound:"£",pr:"≺",Pr:"⪻",prap:"⪷",prcue:"≼",pre:"⪯",prE:"⪳",prec:"≺",precapprox:"⪷",preccurlyeq:"≼",Precedes:"≺",PrecedesEqual:"⪯",PrecedesSlantEqual:"≼",PrecedesTilde:"≾",preceq:"⪯",precnapprox:"⪹",precneqq:"⪵",precnsim:"⋨",precsim:"≾",prime:"′",Prime:"″",primes:"ℙ",prnap:"⪹",prnE:"⪵",prnsim:"⋨",prod:"∏",Product:"∏",profalar:"⌮",profline:"⌒",profsurf:"⌓",prop:"∝",Proportion:"∷",Proportional:"∝",propto:"∝",prsim:"≾",prurel:"⊰",pscr:"𝓅",Pscr:"𝒫",psi:"ψ",Psi:"Ψ",puncsp:" ",qfr:"𝔮",Qfr:"𝔔",qint:"⨌",qopf:"𝕢",Qopf:"ℚ",qprime:"⁗",qscr:"𝓆",Qscr:"𝒬",quaternions:"ℍ",quatint:"⨖",quest:"?",questeq:"≟",quot:'"',QUOT:'"',rAarr:"⇛",race:"∽̱",racute:"ŕ",Racute:"Ŕ",radic:"√",raemptyv:"⦳",rang:"⟩",Rang:"⟫",rangd:"⦒",range:"⦥",rangle:"⟩",raquo:"»",rarr:"→",rArr:"⇒",Rarr:"↠",rarrap:"⥵",rarrb:"⇥",rarrbfs:"⤠",rarrc:"⤳",rarrfs:"⤞",rarrhk:"↪",rarrlp:"↬",rarrpl:"⥅",rarrsim:"⥴",rarrtl:"↣",Rarrtl:"⤖",rarrw:"↝",ratail:"⤚",rAtail:"⤜",ratio:"∶",rationals:"ℚ",rbarr:"⤍",rBarr:"⤏",RBarr:"⤐",rbbrk:"❳",rbrace:"}",rbrack:"]",rbrke:"⦌",rbrksld:"⦎",rbrkslu:"⦐",rcaron:"ř",Rcaron:"Ř",rcedil:"ŗ",Rcedil:"Ŗ",rceil:"⌉",rcub:"}",rcy:"р",Rcy:"Р",rdca:"⤷",rdldhar:"⥩",rdquo:"”",rdquor:"”",rdsh:"↳",Re:"ℜ",real:"ℜ",realine:"ℛ",realpart:"ℜ",reals:"ℝ",rect:"▭",reg:"®",REG:"®",ReverseElement:"∋",ReverseEquilibrium:"⇋",ReverseUpEquilibrium:"⥯",rfisht:"⥽",rfloor:"⌋",rfr:"𝔯",Rfr:"ℜ",rHar:"⥤",rhard:"⇁",rharu:"⇀",rharul:"⥬",rho:"ρ",Rho:"Ρ",rhov:"ϱ",RightAngleBracket:"⟩",rightarrow:"→",Rightarrow:"⇒",RightArrow:"→",RightArrowBar:"⇥",RightArrowLeftArrow:"⇄",rightarrowtail:"↣",RightCeiling:"⌉",RightDoubleBracket:"⟧",RightDownTeeVector:"⥝",RightDownVector:"⇂",RightDownVectorBar:"⥕",RightFloor:"⌋",rightharpoondown:"⇁",rightharpoonup:"⇀",rightleftarrows:"⇄",rightleftharpoons:"⇌",rightrightarrows:"⇉",rightsquigarrow:"↝",RightTee:"⊢",RightTeeArrow:"↦",RightTeeVector:"⥛",rightthreetimes:"⋌",RightTriangle:"⊳",RightTriangleBar:"⧐",RightTriangleEqual:"⊵",RightUpDownVector:"⥏",RightUpTeeVector:"⥜",RightUpVector:"↾",RightUpVectorBar:"⥔",RightVector:"⇀",RightVectorBar:"⥓",ring:"˚",risingdotseq:"≓",rlarr:"⇄",rlhar:"⇌",rlm:"",rmoust:"⎱",rmoustache:"⎱",rnmid:"⫮",roang:"⟭",roarr:"⇾",robrk:"⟧",ropar:"⦆",ropf:"𝕣",Ropf:"ℝ",roplus:"⨮",rotimes:"⨵",RoundImplies:"⥰",rpar:")",rpargt:"⦔",rppolint:"⨒",rrarr:"⇉",Rrightarrow:"⇛",rsaquo:"›",rscr:"𝓇",Rscr:"ℛ",rsh:"↱",Rsh:"↱",rsqb:"]",rsquo:"’",rsquor:"’",rthree:"⋌",rtimes:"⋊",rtri:"▹",rtrie:"⊵",rtrif:"▸",rtriltri:"⧎",RuleDelayed:"⧴",ruluhar:"⥨",rx:"℞",sacute:"ś",Sacute:"Ś",sbquo:"‚",sc:"≻",Sc:"⪼",scap:"⪸",scaron:"š",Scaron:"Š",sccue:"≽",sce:"⪰",scE:"⪴",scedil:"ş",Scedil:"Ş",scirc:"ŝ",Scirc:"Ŝ",scnap:"⪺",scnE:"⪶",scnsim:"⋩",scpolint:"⨓",scsim:"≿",scy:"с",Scy:"С",sdot:"⋅",sdotb:"⊡",sdote:"⩦",searhk:"⤥",searr:"↘",seArr:"⇘",searrow:"↘",sect:"§",semi:";",seswar:"⤩",setminus:"∖",setmn:"∖",sext:"✶",sfr:"𝔰",Sfr:"𝔖",sfrown:"⌢",sharp:"♯",shchcy:"щ",SHCHcy:"Щ",shcy:"ш",SHcy:"Ш",ShortDownArrow:"↓",ShortLeftArrow:"←",shortmid:"∣",shortparallel:"∥",ShortRightArrow:"→",ShortUpArrow:"↑",shy:"",sigma:"σ",Sigma:"Σ",sigmaf:"ς",sigmav:"ς",sim:"∼",simdot:"⩪",sime:"≃",simeq:"≃",simg:"⪞",simgE:"⪠",siml:"⪝",simlE:"⪟",simne:"≆",simplus:"⨤",simrarr:"⥲",slarr:"←",SmallCircle:"∘",smallsetminus:"∖",smashp:"⨳",smeparsl:"⧤",smid:"∣",smile:"⌣",smt:"⪪",smte:"⪬",smtes:"⪬︀",softcy:"ь",SOFTcy:"Ь",sol:"/",solb:"⧄",solbar:"⌿",sopf:"𝕤",Sopf:"𝕊",spades:"♠",spadesuit:"♠",spar:"∥",sqcap:"⊓",sqcaps:"⊓︀",sqcup:"⊔",sqcups:"⊔︀",Sqrt:"√",sqsub:"⊏",sqsube:"⊑",sqsubset:"⊏",sqsubseteq:"⊑",sqsup:"⊐",sqsupe:"⊒",sqsupset:"⊐",sqsupseteq:"⊒",squ:"□",square:"□",Square:"□",SquareIntersection:"⊓",SquareSubset:"⊏",SquareSubsetEqual:"⊑",SquareSuperset:"⊐",SquareSupersetEqual:"⊒",SquareUnion:"⊔",squarf:"▪",squf:"▪",srarr:"→",sscr:"𝓈",Sscr:"𝒮",ssetmn:"∖",ssmile:"⌣",sstarf:"⋆",star:"☆",Star:"⋆",starf:"★",straightepsilon:"ϵ",straightphi:"ϕ",strns:"¯",sub:"⊂",Sub:"⋐",subdot:"⪽",sube:"⊆",subE:"⫅",subedot:"⫃",submult:"⫁",subne:"⊊",subnE:"⫋",subplus:"⪿",subrarr:"⥹",subset:"⊂",Subset:"⋐",subseteq:"⊆",subseteqq:"⫅",SubsetEqual:"⊆",subsetneq:"⊊",subsetneqq:"⫋",subsim:"⫇",subsub:"⫕",subsup:"⫓",succ:"≻",succapprox:"⪸",succcurlyeq:"≽",Succeeds:"≻",SucceedsEqual:"⪰",SucceedsSlantEqual:"≽",SucceedsTilde:"≿",succeq:"⪰",succnapprox:"⪺",succneqq:"⪶",succnsim:"⋩",succsim:"≿",SuchThat:"∋",sum:"∑",Sum:"∑",sung:"♪",sup:"⊃",Sup:"⋑",sup1:"¹",sup2:"²",sup3:"³",supdot:"⪾",supdsub:"⫘",supe:"⊇",supE:"⫆",supedot:"⫄",Superset:"⊃",SupersetEqual:"⊇",suphsol:"⟉",suphsub:"⫗",suplarr:"⥻",supmult:"⫂",supne:"⊋",supnE:"⫌",supplus:"⫀",supset:"⊃",Supset:"⋑",supseteq:"⊇",supseteqq:"⫆",supsetneq:"⊋",supsetneqq:"⫌",supsim:"⫈",supsub:"⫔",supsup:"⫖",swarhk:"⤦",swarr:"↙",swArr:"⇙",swarrow:"↙",swnwar:"⤪",szlig:"ß",Tab:"\t",target:"⌖",tau:"τ",Tau:"Τ",tbrk:"⎴",tcaron:"ť",Tcaron:"Ť",tcedil:"ţ",Tcedil:"Ţ",tcy:"т",Tcy:"Т",tdot:"⃛",telrec:"⌕",tfr:"𝔱",Tfr:"𝔗",there4:"∴",therefore:"∴",Therefore:"∴",theta:"θ",Theta:"Θ",thetasym:"ϑ",thetav:"ϑ",thickapprox:"≈",thicksim:"∼",ThickSpace:" ",thinsp:" ",ThinSpace:" ",thkap:"≈",thksim:"∼",thorn:"þ",THORN:"Þ",tilde:"˜",Tilde:"∼",TildeEqual:"≃",TildeFullEqual:"≅",TildeTilde:"≈",times:"×",timesb:"⊠",timesbar:"⨱",timesd:"⨰",tint:"∭",toea:"⤨",top:"⊤",topbot:"⌶",topcir:"⫱",topf:"𝕥",Topf:"𝕋",topfork:"⫚",tosa:"⤩",tprime:"‴",trade:"™",TRADE:"™",triangle:"▵",triangledown:"▿",triangleleft:"◃",trianglelefteq:"⊴",triangleq:"≜",triangleright:"▹",trianglerighteq:"⊵",tridot:"◬",trie:"≜",triminus:"⨺",TripleDot:"⃛",triplus:"⨹",trisb:"⧍",tritime:"⨻",trpezium:"⏢",tscr:"𝓉",Tscr:"𝒯",tscy:"ц",TScy:"Ц",tshcy:"ћ",TSHcy:"Ћ",tstrok:"ŧ",Tstrok:"Ŧ",twixt:"≬",twoheadleftarrow:"↞",twoheadrightarrow:"↠",uacute:"ú",Uacute:"Ú",uarr:"↑",uArr:"⇑",Uarr:"↟",Uarrocir:"⥉",ubrcy:"ў",Ubrcy:"Ў",ubreve:"ŭ",Ubreve:"Ŭ",ucirc:"û",Ucirc:"Û",ucy:"у",Ucy:"У",udarr:"⇅",udblac:"ű",Udblac:"Ű",udhar:"⥮",ufisht:"⥾",ufr:"𝔲",Ufr:"𝔘",ugrave:"ù",Ugrave:"Ù",uHar:"⥣",uharl:"↿",uharr:"↾",uhblk:"▀",ulcorn:"⌜",ulcorner:"⌜",ulcrop:"⌏",ultri:"◸",umacr:"ū",Umacr:"Ū",uml:"¨",UnderBar:"_",UnderBrace:"⏟",UnderBracket:"⎵",UnderParenthesis:"⏝",Union:"⋃",UnionPlus:"⊎",uogon:"ų",Uogon:"Ų",uopf:"𝕦",Uopf:"𝕌",uparrow:"↑",Uparrow:"⇑",UpArrow:"↑",UpArrowBar:"⤒",UpArrowDownArrow:"⇅",updownarrow:"↕",Updownarrow:"⇕",UpDownArrow:"↕",UpEquilibrium:"⥮",upharpoonleft:"↿",upharpoonright:"↾",uplus:"⊎",UpperLeftArrow:"↖",UpperRightArrow:"↗",upsi:"υ",Upsi:"ϒ",upsih:"ϒ",upsilon:"υ",Upsilon:"Υ",UpTee:"⊥",UpTeeArrow:"↥",upuparrows:"⇈",urcorn:"⌝",urcorner:"⌝",urcrop:"⌎",uring:"ů",Uring:"Ů",urtri:"◹",uscr:"𝓊",Uscr:"𝒰",utdot:"⋰",utilde:"ũ",Utilde:"Ũ",utri:"▵",utrif:"▴",uuarr:"⇈",uuml:"ü",Uuml:"Ü",uwangle:"⦧",vangrt:"⦜",varepsilon:"ϵ",varkappa:"ϰ",varnothing:"∅",varphi:"ϕ",varpi:"ϖ",varpropto:"∝",varr:"↕",vArr:"⇕",varrho:"ϱ",varsigma:"ς",varsubsetneq:"⊊︀",varsubsetneqq:"⫋︀",varsupsetneq:"⊋︀",varsupsetneqq:"⫌︀",vartheta:"ϑ",vartriangleleft:"⊲",vartriangleright:"⊳",vBar:"⫨",Vbar:"⫫",vBarv:"⫩",vcy:"в",Vcy:"В",vdash:"⊢",vDash:"⊨",Vdash:"⊩",VDash:"⊫",Vdashl:"⫦",vee:"∨",Vee:"⋁",veebar:"⊻",veeeq:"≚",vellip:"⋮",verbar:"|",Verbar:"‖",vert:"|",Vert:"‖",VerticalBar:"∣",VerticalLine:"|",VerticalSeparator:"❘",VerticalTilde:"≀",VeryThinSpace:" ",vfr:"𝔳",Vfr:"𝔙",vltri:"⊲",vnsub:"⊂⃒",vnsup:"⊃⃒",vopf:"𝕧",Vopf:"𝕍",vprop:"∝",vrtri:"⊳",vscr:"𝓋",Vscr:"𝒱",vsubne:"⊊︀",vsubnE:"⫋︀",vsupne:"⊋︀",vsupnE:"⫌︀",Vvdash:"⊪",vzigzag:"⦚",wcirc:"ŵ",Wcirc:"Ŵ",wedbar:"⩟",wedge:"∧",Wedge:"⋀",wedgeq:"≙",weierp:"℘",wfr:"𝔴",Wfr:"𝔚",wopf:"𝕨",Wopf:"𝕎",wp:"℘",wr:"≀",wreath:"≀",wscr:"𝓌",Wscr:"𝒲",xcap:"⋂",xcirc:"◯",xcup:"⋃",xdtri:"▽",xfr:"𝔵",Xfr:"𝔛",xharr:"⟷",xhArr:"⟺",xi:"ξ",Xi:"Ξ",xlarr:"⟵",xlArr:"⟸",xmap:"⟼",xnis:"⋻",xodot:"⨀",xopf:"𝕩",Xopf:"𝕏",xoplus:"⨁",xotime:"⨂",xrarr:"⟶",xrArr:"⟹",xscr:"𝓍",Xscr:"𝒳",xsqcup:"⨆",xuplus:"⨄",xutri:"△",xvee:"⋁",xwedge:"⋀",yacute:"ý",Yacute:"Ý",yacy:"я",YAcy:"Я",ycirc:"ŷ",Ycirc:"Ŷ",ycy:"ы",Ycy:"Ы",yen:"¥",yfr:"𝔶",Yfr:"𝔜",yicy:"ї",YIcy:"Ї",yopf:"𝕪",Yopf:"𝕐",yscr:"𝓎",Yscr:"𝒴",yucy:"ю",YUcy:"Ю",yuml:"ÿ",Yuml:"Ÿ",zacute:"ź",Zacute:"Ź",zcaron:"ž",Zcaron:"Ž",zcy:"з",Zcy:"З",zdot:"ż",Zdot:"Ż",zeetrf:"ℨ",ZeroWidthSpace:"",zeta:"ζ",Zeta:"Ζ",zfr:"𝔷",Zfr:"ℨ",zhcy:"ж",ZHcy:"Ж",zigrarr:"⇝",zopf:"𝕫",Zopf:"ℤ",zscr:"𝓏",Zscr:"𝒵",zwj:"",zwnj:""},v={aacute:"á",Aacute:"Á",acirc:"â",Acirc:"Â",acute:"´",aelig:"æ",AElig:"Æ",agrave:"à",Agrave:"À",amp:"&",AMP:"&",aring:"å",Aring:"Å",atilde:"ã",Atilde:"Ã",auml:"ä",Auml:"Ä",brvbar:"¦",ccedil:"ç",Ccedil:"Ç",cedil:"¸",cent:"¢",copy:"©",COPY:"©",curren:"¤",deg:"°",divide:"÷",eacute:"é",Eacute:"É",ecirc:"ê",Ecirc:"Ê",egrave:"è",Egrave:"È",eth:"ð",ETH:"Ð",euml:"ë",Euml:"Ë",frac12:"½",frac14:"¼",frac34:"¾",gt:">",GT:">",iacute:"í",Iacute:"Í",icirc:"î",Icirc:"Î",iexcl:"¡",igrave:"ì",Igrave:"Ì",iquest:"¿",iuml:"ï",Iuml:"Ï",laquo:"«",lt:"<",LT:"<",macr:"¯",micro:"µ",middot:"·",nbsp:" ",not:"¬",ntilde:"ñ",Ntilde:"Ñ",oacute:"ó",Oacute:"Ó",ocirc:"ô",Ocirc:"Ô",ograve:"ò",Ograve:"Ò",ordf:"ª",ordm:"º",oslash:"ø",Oslash:"Ø",otilde:"õ",Otilde:"Õ",ouml:"ö",Ouml:"Ö",para:"¶",plusmn:"±",pound:"£",quot:'"',QUOT:'"',raquo:"»",reg:"®",REG:"®",sect:"§",shy:"",sup1:"¹",sup2:"²",sup3:"³",szlig:"ß",thorn:"þ",THORN:"Þ",times:"×",uacute:"ú",Uacute:"Ú",ucirc:"û",Ucirc:"Û",ugrave:"ù",Ugrave:"Ù",uml:"¨",uuml:"ü",Uuml:"Ü",yacute:"ý",Yacute:"Ý",yen:"¥",yuml:"ÿ"},m={0:"�",128:"€",130:"‚",131:"ƒ",132:"„",133:"…",134:"†",135:"‡",136:"ˆ",137:"‰",138:"Š",139:"‹",140:"Œ",142:"Ž",145:"‘",146:"’",147:"“",148:"”",149:"•",150:"–",151:"—",152:"˜",153:"™",154:"š",155:"›",156:"œ",158:"ž",159:"Ÿ"},_=[1,2,3,4,5,6,7,8,11,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,127,128,129,130,131,132,133,134,135,136,137,138,139,140,141,142,143,144,145,146,147,148,149,150,151,152,153,154,155,156,157,158,159,64976,64977,64978,64979,64980,64981,64982,64983,64984,64985,64986,64987,64988,64989,64990,64991,64992,64993,64994,64995,64996,64997,64998,64999,65e3,65001,65002,65003,65004,65005,65006,65007,65534,65535,131070,131071,196606,196607,262142,262143,327678,327679,393214,393215,458750,458751,524286,524287,589822,589823,655358,655359,720894,720895,786430,786431,851966,851967,917502,917503,983038,983039,1048574,1048575,1114110,1114111],w=String.fromCharCode,x={}.hasOwnProperty,k=function(t,e){return x.call(t,e)},E=function(t,e){if(!t)return e;var n,r={};for(n in e)r[n]=k(t,n)?t[n]:e[n];return r},A=function(t,e){var n="";return t>=55296&&t<=57343||t>1114111?(e&&T("character reference outside the permissible Unicode range"),"�"):k(m,t)?(e&&T("disallowed character reference"),m[t]):(e&&function(t,e){for(var n=-1,r=t.length;++n<r;)if(t[n]==e)return!0;return!1}(_,t)&&T("disallowed character reference"),t>65535&&(n+=w((t-=65536)>>>10&1023|55296),t=56320|1023&t),n+=w(t))},S=function(t){return"&#x"+t.toString(16).toUpperCase()+";"},M=function(t){return"&#"+t+";"},T=function(t){throw Error("Parse error: "+t)},D=function(t,e){(e=E(e,D.options)).strict&&g.test(t)&&T("forbidden code point");var n=e.encodeEverything,r=e.useNamedReferences,i=e.allowUnsafeSymbols,a=e.decimal?M:S,o=function(t){return a(t.charCodeAt(0))};return n?(t=t.replace(u,(function(t){return r&&k(l,t)?"&"+l[t]+";":o(t)})),r&&(t=t.replace(/>\u20D2/g,">⃒").replace(/<\u20D2/g,"<⃒").replace(/fj/g,"fj")),r&&(t=t.replace(f,(function(t){return"&"+l[t]+";"})))):r?(i||(t=t.replace(h,(function(t){return"&"+l[t]+";"}))),t=(t=t.replace(/>\u20D2/g,">⃒").replace(/<\u20D2/g,"<⃒")).replace(f,(function(t){return"&"+l[t]+";"}))):i||(t=t.replace(h,o)),t.replace(s,(function(t){var e=t.charCodeAt(0),n=t.charCodeAt(1);return a(1024*(e-55296)+n-56320+65536)})).replace(c,o)};D.options={allowUnsafeSymbols:!1,encodeEverything:!1,strict:!1,useNamedReferences:!1,decimal:!1};var C=function(t,e){var n=(e=E(e,C.options)).strict;return n&&p.test(t)&&T("malformed character reference"),t.replace(y,(function(t,r,i,a,o,s,u,c,f){var l,h,d,p,g,y;return r?b[g=r]:i?(g=i,(y=a)&&e.isAttributeValue?(n&&"="==y&&T("`&` did not start a character reference"),t):(n&&T("named character reference was not terminated by a semicolon"),v[g]+(y||""))):o?(d=o,h=s,n&&!h&&T("character reference was not terminated by a semicolon"),l=parseInt(d,10),A(l,n)):u?(p=u,h=c,n&&!h&&T("character reference was not terminated by a semicolon"),l=parseInt(p,16),A(l,n)):(n&&T("named character reference was not terminated by a semicolon"),t)}))};C.options={isAttributeValue:!1,strict:!1};var N={version:"1.2.0",encode:D,decode:C,escape:function(t){return t.replace(h,(function(t){return d[t]}))},unescape:C};if("function"==typeof define&&"object"==typeof define.amd&&define.amd)define((function(){return N}));else if(i&&!i.nodeType)if(a)a.exports=N;else for(var I in N)k(N,I)&&(i[I]=N[I]);else r.he=N}(this)}).call(this,n(9)(t),n(12))},function(t,e,n){"use strict";var r=n(231),i=n(232),a=n(233);function o(t,e,n){if(!t)return t;if(!e)return t;"string"==typeof n&&(n={keyframes:n}),n||(n={keyframes:!1}),t=s(t,e+" $1$2");var i=e.replace(/[-\/\\^$*+?.()|[\]{}]/g,"\\$&");t=(t=(t=(t=t.replace(new RegExp("("+i+")\\s*\\1(?=[\\s\\r\\n,{])","g"),"$1")).replace(new RegExp("("+i+")\\s*:host","g"),"$1")).replace(new RegExp("("+i+")\\s*@","g"),"@")).replace(new RegExp("("+i+")\\s*:root","g"),":root");for(var a,o=[],u=/@keyframes\s+([a-zA-Z0-9_-]+)\s*{/g;null!==(a=u.exec(t));)o.indexOf(a[1])<0&&o.push(a[1]);var c=r(e);return o.forEach((function(e){var r=(!0===n.keyframes?c+"-":"string"==typeof n.keyframes?n.keyframes:"")+e;t=(t=t.replace(new RegExp("(@keyframes\\s+)"+e+"(\\s*{)","g"),"$1"+r+"$2")).replace(new RegExp("(animation(?:-name)?\\s*:[^;]*\\s*)"+e+"([\\s;}])","g"),"$1"+r+"$2")})),t=t.replace(new RegExp("("+i+" )(\\s*(?:to|from|[+-]?(?:(?:\\.\\d+)|(?:\\d+(?:\\.\\d*)?))%))(?=[\\s\\r\\n,{])","g"),"$2")}function s(t,e){var n=[];return t=a(t),t=(t=i.replace(t,!0,n)).replace(/([^\r\n,{}]+)(,(?=[^}]*{)|\s*{)/g,e),t=i.paste(t,n)}t.exports=o,o.replace=s},function(t,e,n){"use strict";const r=n(420),i="abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ0123456789-._~".split(""),a="0123456789".split(""),o=(t,e)=>{const n=e.length,i=Math.floor(65536/n)*n-1,a=2*Math.ceil(1.1*t);let o="",s=0;for(;s<t;){const u=r.randomBytes(a);let c=0;for(;c<a&&s<t;){const t=u.readUInt16LE(c);c+=2,t>i||(o+=e[t%n],s++)}}return o},s=[void 0,"hex","base64","url-safe","numeric"];t.exports=({length:t,type:e,characters:n})=>{if(!(t>=0&&Number.isFinite(t)))throw new TypeError("Expected a `length` to be a non-negative finite number");if(void 0!==e&&void 0!==n)throw new TypeError("Expected either `type` or `characters`");if(void 0!==n&&"string"!=typeof n)throw new TypeError("Expected `characters` to be string");if(!s.includes(e))throw new TypeError(`Unknown type: ${e}`);if(void 0===e&&void 0===n&&(e="hex"),"hex"===e||void 0===e&&void 0===n)return r.randomBytes(Math.ceil(.5*t)).toString("hex").slice(0,t);if("base64"===e)return r.randomBytes(Math.ceil(.75*t)).toString("base64").slice(0,t);if("url-safe"===e)return o(t,i);if("numeric"===e)return o(t,a);if(0===n.length)throw new TypeError("Expected `characters` string length to be greater than or equal to 1");if(n.length>65536)throw new TypeError("Expected `characters` string length to be less or equal to 65536");return o(t,n.split(""))}},function(t,e,n){var r;r=function(){var t=JSON.parse('{"$":"dollar","%":"percent","&":"and","<":"less",">":"greater","|":"or","¢":"cent","£":"pound","¤":"currency","¥":"yen","©":"(c)","ª":"a","®":"(r)","º":"o","À":"A","Á":"A","Â":"A","Ã":"A","Ä":"A","Å":"A","Æ":"AE","Ç":"C","È":"E","É":"E","Ê":"E","Ë":"E","Ì":"I","Í":"I","Î":"I","Ï":"I","Ð":"D","Ñ":"N","Ò":"O","Ó":"O","Ô":"O","Õ":"O","Ö":"O","Ø":"O","Ù":"U","Ú":"U","Û":"U","Ü":"U","Ý":"Y","Þ":"TH","ß":"ss","à":"a","á":"a","â":"a","ã":"a","ä":"a","å":"a","æ":"ae","ç":"c","è":"e","é":"e","ê":"e","ë":"e","ì":"i","í":"i","î":"i","ï":"i","ð":"d","ñ":"n","ò":"o","ó":"o","ô":"o","õ":"o","ö":"o","ø":"o","ù":"u","ú":"u","û":"u","ü":"u","ý":"y","þ":"th","ÿ":"y","Ā":"A","ā":"a","Ă":"A","ă":"a","Ą":"A","ą":"a","Ć":"C","ć":"c","Č":"C","č":"c","Ď":"D","ď":"d","Đ":"DJ","đ":"dj","Ē":"E","ē":"e","Ė":"E","ė":"e","Ę":"e","ę":"e","Ě":"E","ě":"e","Ğ":"G","ğ":"g","Ģ":"G","ģ":"g","Ĩ":"I","ĩ":"i","Ī":"i","ī":"i","Į":"I","į":"i","İ":"I","ı":"i","Ķ":"k","ķ":"k","Ļ":"L","ļ":"l","Ľ":"L","ľ":"l","Ł":"L","ł":"l","Ń":"N","ń":"n","Ņ":"N","ņ":"n","Ň":"N","ň":"n","Ő":"O","ő":"o","Œ":"OE","œ":"oe","Ŕ":"R","ŕ":"r","Ř":"R","ř":"r","Ś":"S","ś":"s","Ş":"S","ş":"s","Š":"S","š":"s","Ţ":"T","ţ":"t","Ť":"T","ť":"t","Ũ":"U","ũ":"u","Ū":"u","ū":"u","Ů":"U","ů":"u","Ű":"U","ű":"u","Ų":"U","ų":"u","Ŵ":"W","ŵ":"w","Ŷ":"Y","ŷ":"y","Ÿ":"Y","Ź":"Z","ź":"z","Ż":"Z","ż":"z","Ž":"Z","ž":"z","ƒ":"f","Ơ":"O","ơ":"o","Ư":"U","ư":"u","Lj":"LJ","lj":"lj","Nj":"NJ","nj":"nj","Ș":"S","ș":"s","Ț":"T","ț":"t","˚":"o","Ά":"A","Έ":"E","Ή":"H","Ί":"I","Ό":"O","Ύ":"Y","Ώ":"W","ΐ":"i","Α":"A","Β":"B","Γ":"G","Δ":"D","Ε":"E","Ζ":"Z","Η":"H","Θ":"8","Ι":"I","Κ":"K","Λ":"L","Μ":"M","Ν":"N","Ξ":"3","Ο":"O","Π":"P","Ρ":"R","Σ":"S","Τ":"T","Υ":"Y","Φ":"F","Χ":"X","Ψ":"PS","Ω":"W","Ϊ":"I","Ϋ":"Y","ά":"a","έ":"e","ή":"h","ί":"i","ΰ":"y","α":"a","β":"b","γ":"g","δ":"d","ε":"e","ζ":"z","η":"h","θ":"8","ι":"i","κ":"k","λ":"l","μ":"m","ν":"n","ξ":"3","ο":"o","π":"p","ρ":"r","ς":"s","σ":"s","τ":"t","υ":"y","φ":"f","χ":"x","ψ":"ps","ω":"w","ϊ":"i","ϋ":"y","ό":"o","ύ":"y","ώ":"w","Ё":"Yo","Ђ":"DJ","Є":"Ye","І":"I","Ї":"Yi","Ј":"J","Љ":"LJ","Њ":"NJ","Ћ":"C","Џ":"DZ","А":"A","Б":"B","В":"V","Г":"G","Д":"D","Е":"E","Ж":"Zh","З":"Z","И":"I","Й":"J","К":"K","Л":"L","М":"M","Н":"N","О":"O","П":"P","Р":"R","С":"S","Т":"T","У":"U","Ф":"F","Х":"H","Ц":"C","Ч":"Ch","Ш":"Sh","Щ":"Sh","Ъ":"U","Ы":"Y","Ь":"","Э":"E","Ю":"Yu","Я":"Ya","а":"a","б":"b","в":"v","г":"g","д":"d","е":"e","ж":"zh","з":"z","и":"i","й":"j","к":"k","л":"l","м":"m","н":"n","о":"o","п":"p","р":"r","с":"s","т":"t","у":"u","ф":"f","х":"h","ц":"c","ч":"ch","ш":"sh","щ":"sh","ъ":"u","ы":"y","ь":"","э":"e","ю":"yu","я":"ya","ё":"yo","ђ":"dj","є":"ye","і":"i","ї":"yi","ј":"j","љ":"lj","њ":"nj","ћ":"c","ѝ":"u","џ":"dz","Ґ":"G","ґ":"g","Ғ":"GH","ғ":"gh","Қ":"KH","қ":"kh","Ң":"NG","ң":"ng","Ү":"UE","ү":"ue","Ұ":"U","ұ":"u","Һ":"H","һ":"h","Ә":"AE","ә":"ae","Ө":"OE","ө":"oe","฿":"baht","ა":"a","ბ":"b","გ":"g","დ":"d","ე":"e","ვ":"v","ზ":"z","თ":"t","ი":"i","კ":"k","ლ":"l","მ":"m","ნ":"n","ო":"o","პ":"p","ჟ":"zh","რ":"r","ს":"s","ტ":"t","უ":"u","ფ":"f","ქ":"k","ღ":"gh","ყ":"q","შ":"sh","ჩ":"ch","ც":"ts","ძ":"dz","წ":"ts","ჭ":"ch","ხ":"kh","ჯ":"j","ჰ":"h","Ẁ":"W","ẁ":"w","Ẃ":"W","ẃ":"w","Ẅ":"W","ẅ":"w","ẞ":"SS","Ạ":"A","ạ":"a","Ả":"A","ả":"a","Ấ":"A","ấ":"a","Ầ":"A","ầ":"a","Ẩ":"A","ẩ":"a","Ẫ":"A","ẫ":"a","Ậ":"A","ậ":"a","Ắ":"A","ắ":"a","Ằ":"A","ằ":"a","Ẳ":"A","ẳ":"a","Ẵ":"A","ẵ":"a","Ặ":"A","ặ":"a","Ẹ":"E","ẹ":"e","Ẻ":"E","ẻ":"e","Ẽ":"E","ẽ":"e","Ế":"E","ế":"e","Ề":"E","ề":"e","Ể":"E","ể":"e","Ễ":"E","ễ":"e","Ệ":"E","ệ":"e","Ỉ":"I","ỉ":"i","Ị":"I","ị":"i","Ọ":"O","ọ":"o","Ỏ":"O","ỏ":"o","Ố":"O","ố":"o","Ồ":"O","ồ":"o","Ổ":"O","ổ":"o","Ỗ":"O","ỗ":"o","Ộ":"O","ộ":"o","Ớ":"O","ớ":"o","Ờ":"O","ờ":"o","Ở":"O","ở":"o","Ỡ":"O","ỡ":"o","Ợ":"O","ợ":"o","Ụ":"U","ụ":"u","Ủ":"U","ủ":"u","Ứ":"U","ứ":"u","Ừ":"U","ừ":"u","Ử":"U","ử":"u","Ữ":"U","ữ":"u","Ự":"U","ự":"u","Ỳ":"Y","ỳ":"y","Ỵ":"Y","ỵ":"y","Ỷ":"Y","ỷ":"y","Ỹ":"Y","ỹ":"y","‘":"\'","’":"\'","“":"\\"","”":"\\"","†":"+","•":"*","…":"...","₠":"ecu","₢":"cruzeiro","₣":"french franc","₤":"lira","₥":"mill","₦":"naira","₧":"peseta","₨":"rupee","₩":"won","₪":"new shequel","₫":"dong","€":"euro","₭":"kip","₮":"tugrik","₯":"drachma","₰":"penny","₱":"peso","₲":"guarani","₳":"austral","₴":"hryvnia","₵":"cedi","₸":"kazakhstani tenge","₹":"indian rupee","₽":"russian ruble","₿":"bitcoin","℠":"sm","™":"tm","∂":"d","∆":"delta","∑":"sum","∞":"infinity","♥":"love","元":"yuan","円":"yen","﷼":"rial"}'),e=JSON.parse('{"vi":{"Đ":"D","đ":"d"}}');function n(n,r){if("string"!=typeof n)throw new Error("slugify: string argument expected");var i=e[(r="string"==typeof r?{replacement:r}:r||{}).locale]||{},a=n.split("").reduce((function(e,n){return e+(i[n]||t[n]||n).replace(r.remove||/[^\w\s$*_+~.()'"!\-:@]/g,"")}),"").trim().replace(/[-\s]+/g,r.replacement||"-");return r.lower?a.toLowerCase():a}return n.extend=function(e){for(var n in e)t[n]=e[n]},n},t.exports=r(),t.exports.default=r()},function(t,e,n){
-/*!
- * Escaper v2.5.3
- * https://github.com/kobezzza/Escaper
- *
- * Released under the MIT license
- * https://github.com/kobezzza/Escaper/blob/master/LICENSE
- *
- * Date: Tue, 23 Jan 2018 15:58:45 GMT
- */
-!function(t){"use strict";var e,n="function"==typeof Symbol&&"symbol"==typeof Symbol.iterator?function(t){return typeof t}:function(t){return t&&"function"==typeof Symbol&&t.constructor===Symbol&&t!==Symbol.prototype?"symbol":typeof t},r=e={VERSION:[2,5,3],content:[],cache:{},snakeskinRgxp:null,symbols:null,replace:T,paste:C},i={'"':!0,"'":!0,"`":!0},a={"/":!0};for(var o in i){if(!i.hasOwnProperty(o))break;a[o]=!0}var s={"//":!0,"//*":!0,"//!":!0,"//#":!0,"//@":!0,"//$":!0},u={"/*":!0,"/**":!0,"/*!":!0,"/*#":!0,"/*@":!0,"/*$":!0},c=[],f={};for(var l in a){if(!a.hasOwnProperty(l))break;c.push(l),f[l]=!0}for(var h in s){if(!s.hasOwnProperty(h))break;c.push(h),f[h]=!0}for(var d in u){if(!u.hasOwnProperty(d))break;c.push(d),f[d]=!0}var p=[],g={g:!0,m:!0,i:!0,y:!0,u:!0};for(var y in g){if(!g.hasOwnProperty(y))break;p.push(y)}var b={"-":!0,"+":!0,"*":!0,"%":!0,"~":!0,">":!0,"<":!0,"^":!0,",":!0,";":!0,"=":!0,"|":!0,"&":!0,"!":!0,"?":!0,":":!0,"(":!0,"{":!0,"[":!0},v={return:!0,yield:!0,await:!0,typeof:!0,void:!0,instanceof:!0,delete:!0,in:!0,new:!0,of:!0};function m(t,e,n){for(var r in t){if(!t.hasOwnProperty(r))break;r in e==0&&(e[r]=n)}}var _=void 0,w=void 0,x=/[^\s/]/,k=/[a-z]/,E=/\s/,A=/[\r\n]/,S=/\${pos}/g,M={object:!0,function:!0};function T(t,r,o,l){_=_||e.symbols||"a-z",w=w||e.snakeskinRgxp||new RegExp("[!$"+_+"_]","i");var h=e.cache,d=e.content,y=Boolean(r&&M[void 0===r?"undefined":n(r)]),T=y?Object(r):{};function D(t){return T["@label"]?T["@label"].replace(S,t):"__ESCAPER_QUOT__"+t+"_"}var C=!1;"boolean"==typeof r&&(C=Boolean(r)),"@comments"in T&&(m(u,T,T["@comments"]),m(s,T,T["@comments"]),delete T["@comments"]),"@strings"in T&&(m(i,T,T["@strings"]),delete T["@strings"]),"@literals"in T&&(m(a,T,T["@literals"]),delete T["@literals"]),"@all"in T&&(m(f,T,T["@all"]),delete T["@all"]);for(var N="",I=-1;++I<c.length;){var L=c[I];u[L]||s[L]?T[L]=C||T[L]:T[L]=T[L]||!y,N+=T[L]+","}var B=t,O=o||d;if(O===d&&h[N]&&h[N][B])return h[N][B];for(var R=!1,P=!0,F=!1,q=!1,j=0,U=!1,z=0,Y=!1,V=void 0,H=void 0,G="",$="",W=-1;++W<t.length;){var K=t.charAt(W),X=t.charAt(W+1),Z=t.substr(W,2),J=t.substr(W,3);if(q)(A.test(X)&&s[q]||u[K+t.charAt(W-1)]&&W-j>2&&u[q])&&(T[q]&&(V=t.substring(j,W+1),-1===T[q]?H="":(H=D(O.length),O.push(V)),t=t.substring(0,j)+H+t.substring(W+1),W+=H.length-V.length),q=!1);else{if(!R){if("/"===K&&((s[Z]||u[Z])&&(q=s[J]||u[J]?J:Z),q)){j=W;continue}b[K]||v[$]?(P=!0,$=""):x.test(K)&&(P=!1),k.test(K)?G+=K:($=G,G="");var Q=!1;l&&("|"===K&&w.test(X)?(Y=!0,P=!1,Q=!0):Y&&E.test(K)&&(Y=!1,P=!0,Q=!0)),Q||(b[K]?P=!0:x.test(K)&&(P=!1))}if("/"!==R||F||("["===K?U=!0:"]"===K&&(U=!1)),!R&&z&&("}"===K?z--:"{"===K&&z++,z||(K="`")),"`"!==R||F||"${"!==Z||(K="`",W++,z++),!f[K]||"/"===K&&!P||R){if(R&&("\\"===K||F))F=!F;else if(f[K]&&R===K&&!F&&("/"!==R||!U)){if("/"===K)for(var tt=-1;++tt<p.length;)g[t.charAt(W+1)]&&W++;R=!1,P=!1,T[K]&&(V=t.substring(j,W+1),-1===T[K]?H="":(H=D(O.length),O.push(V)),t=t.substring(0,j)+H+t.substring(W+1),W+=H.length-V.length)}}else R=K,j=W}}return O===d&&(h[N]=h[N]||{},h[N][B]=t),t}var D=/__ESCAPER_QUOT__(\d+)_/g;function C(t,n,r){return t.replace(r||D,(function(t,r){return(n||e.content)[r]}))}t.default=r,t.replace=T,t.paste=C,Object.defineProperty(t,"__esModule",{value:!0})}(e)},function(t,e,n){"use strict";var r=n(234);t.exports=function(t,e){var n;t=t.toString();var i="",a="",o=!1,s=!(!1===(e=e||{}).preserve||!0===e.all),u="";"function"==typeof e.preserve?(s=!1,n=e.preserve):r(e.preserve)&&(s=!1,n=function(t){return e.preserve.test(t)});for(var c=0;c<t.length;c++)if(a=t[c],"\\"!==t[c-1]&&('"'!==a&&"'"!==a||(o===a?o=!1:o||(o=a))),o||"/"!==a||"*"!==t[c+1]||s&&"!"===t[c+2])u+=a;else{for(var f=c+2;f<t.length;f++){if("*"===t[f]&&"/"===t[f+1]){n&&(u=n(i)?u+"/*"+i+"*/":u,i="");break}n&&(i+=t[f])}c=f+1}return u}},function(t,e,n){"use strict";t.exports=function(t){return"[object RegExp]"===Object.prototype.toString.call(t)}},function(t,e,n){var r={"./locale":129,"./locale.js":129};function i(t){var e=a(t);return n(e)}function a(t){if(!n.o(r,t)){var e=new Error("Cannot find module '"+t+"'");throw e.code="MODULE_NOT_FOUND",e}return r[t]}i.keys=function(){return Object.keys(r)},i.resolve=a,t.exports=i,i.id=235},function(t,e,n){t.exports={Graph:n(89),version:n(337)}},function(t,e,n){var r=n(130);t.exports=function(t){return r(t,4)}},function(t,e){t.exports=function(){this.__data__=[],this.size=0}},function(t,e,n){var r=n(63),i=Array.prototype.splice;t.exports=function(t){var e=this.__data__,n=r(e,t);return!(n<0)&&(n==e.length-1?e.pop():i.call(e,n,1),--this.size,!0)}},function(t,e,n){var r=n(63);t.exports=function(t){var e=this.__data__,n=r(e,t);return n<0?void 0:e[n][1]}},function(t,e,n){var r=n(63);t.exports=function(t){return r(this.__data__,t)>-1}},function(t,e,n){var r=n(63);t.exports=function(t,e){var n=this.__data__,i=r(n,t);return i<0?(++this.size,n.push([t,e])):n[i][1]=e,this}},function(t,e,n){var r=n(62);t.exports=function(){this.__data__=new r,this.size=0}},function(t,e){t.exports=function(t){var e=this.__data__,n=e.delete(t);return this.size=e.size,n}},function(t,e){t.exports=function(t){return this.__data__.get(t)}},function(t,e){t.exports=function(t){return this.__data__.has(t)}},function(t,e,n){var r=n(62),i=n(90),a=n(91);t.exports=function(t,e){var n=this.__data__;if(n instanceof r){var o=n.__data__;if(!i||o.length<199)return o.push([t,e]),this.size=++n.size,this;n=this.__data__=new a(o)}return n.set(t,e),this.size=n.size,this}},function(t,e,n){var r=n(37),i=n(251),a=n(14),o=n(132),s=/^\[object .+?Constructor\]$/,u=Function.prototype,c=Object.prototype,f=u.toString,l=c.hasOwnProperty,h=RegExp("^"+f.call(l).replace(/[\\^$.*+?()[\]{}|]/g,"\\$&").replace(/hasOwnProperty|(function).*?(?=\\\()| for .+?(?=\\\])/g,"$1.*?")+"$");t.exports=function(t){return!(!a(t)||i(t))&&(r(t)?h:s).test(o(t))}},function(t,e,n){var r=n(38),i=Object.prototype,a=i.hasOwnProperty,o=i.toString,s=r?r.toStringTag:void 0;t.exports=function(t){var e=a.call(t,s),n=t[s];try{t[s]=void 0;var r=!0}catch(t){}var i=o.call(t);return r&&(e?t[s]=n:delete t[s]),i}},function(t,e){var n=Object.prototype.toString;t.exports=function(t){return n.call(t)}},function(t,e,n){var r,i=n(252),a=(r=/[^.]+$/.exec(i&&i.keys&&i.keys.IE_PROTO||""))?"Symbol(src)_1."+r:"";t.exports=function(t){return!!a&&a in t}},function(t,e,n){var r=n(18)["__core-js_shared__"];t.exports=r},function(t,e){t.exports=function(t,e){return null==t?void 0:t[e]}},function(t,e,n){var r=n(255),i=n(62),a=n(90);t.exports=function(){this.size=0,this.__data__={hash:new r,map:new(a||i),string:new r}}},function(t,e,n){var r=n(256),i=n(257),a=n(258),o=n(259),s=n(260);function u(t){var e=-1,n=null==t?0:t.length;for(this.clear();++e<n;){var r=t[e];this.set(r[0],r[1])}}u.prototype.clear=r,u.prototype.delete=i,u.prototype.get=a,u.prototype.has=o,u.prototype.set=s,t.exports=u},function(t,e,n){var r=n(64);t.exports=function(){this.__data__=r?r(null):{},this.size=0}},function(t,e){t.exports=function(t){var e=this.has(t)&&delete this.__data__[t];return this.size-=e?1:0,e}},function(t,e,n){var r=n(64),i=Object.prototype.hasOwnProperty;t.exports=function(t){var e=this.__data__;if(r){var n=e[t];return"__lodash_hash_undefined__"===n?void 0:n}return i.call(e,t)?e[t]:void 0}},function(t,e,n){var r=n(64),i=Object.prototype.hasOwnProperty;t.exports=function(t){var e=this.__data__;return r?void 0!==e[t]:i.call(e,t)}},function(t,e,n){var r=n(64);t.exports=function(t,e){var n=this.__data__;return this.size+=this.has(t)?0:1,n[t]=r&&void 0===e?"__lodash_hash_undefined__":e,this}},function(t,e,n){var r=n(65);t.exports=function(t){var e=r(this,t).delete(t);return this.size-=e?1:0,e}},function(t,e){t.exports=function(t){var e=typeof t;return"string"==e||"number"==e||"symbol"==e||"boolean"==e?"__proto__"!==t:null===t}},function(t,e,n){var r=n(65);t.exports=function(t){return r(this,t).get(t)}},function(t,e,n){var r=n(65);t.exports=function(t){return r(this,t).has(t)}},function(t,e,n){var r=n(65);t.exports=function(t,e){var n=r(this,t),i=n.size;return n.set(t,e),this.size+=n.size==i?0:1,this}},function(t,e,n){var r=n(49),i=n(27);t.exports=function(t,e){return t&&r(e,i(e),t)}},function(t,e){t.exports=function(t,e){for(var n=-1,r=Array(t);++n<t;)r[n]=e(n);return r}},function(t,e,n){var r=n(33),i=n(20);t.exports=function(t){return i(t)&&"[object Arguments]"==r(t)}},function(t,e){t.exports=function(){return!1}},function(t,e,n){var r=n(33),i=n(93),a=n(20),o={};o["[object Float32Array]"]=o["[object Float64Array]"]=o["[object Int8Array]"]=o["[object Int16Array]"]=o["[object Int32Array]"]=o["[object Uint8Array]"]=o["[object Uint8ClampedArray]"]=o["[object Uint16Array]"]=o["[object Uint32Array]"]=!0,o["[object Arguments]"]=o["[object Array]"]=o["[object ArrayBuffer]"]=o["[object Boolean]"]=o["[object DataView]"]=o["[object Date]"]=o["[object Error]"]=o["[object Function]"]=o["[object Map]"]=o["[object Number]"]=o["[object Object]"]=o["[object RegExp]"]=o["[object Set]"]=o["[object String]"]=o["[object WeakMap]"]=!1,t.exports=function(t){return a(t)&&i(t.length)&&!!o[r(t)]}},function(t,e,n){var r=n(135)(Object.keys,Object);t.exports=r},function(t,e,n){var r=n(49),i=n(40);t.exports=function(t,e){return t&&r(e,i(e),t)}},function(t,e,n){var r=n(14),i=n(70),a=n(274),o=Object.prototype.hasOwnProperty;t.exports=function(t){if(!r(t))return a(t);var e=i(t),n=[];for(var s in t)("constructor"!=s||!e&&o.call(t,s))&&n.push(s);return n}},function(t,e){t.exports=function(t){var e=[];if(null!=t)for(var n in Object(t))e.push(n);return e}},function(t,e,n){var r=n(49),i=n(96);t.exports=function(t,e){return r(t,i(t),e)}},function(t,e,n){var r=n(49),i=n(140);t.exports=function(t,e){return r(t,i(t),e)}},function(t,e,n){var r=n(142),i=n(140),a=n(40);t.exports=function(t){return r(t,a,i)}},function(t,e,n){var r=n(32)(n(18),"DataView");t.exports=r},function(t,e,n){var r=n(32)(n(18),"Promise");t.exports=r},function(t,e,n){var r=n(32)(n(18),"WeakMap");t.exports=r},function(t,e){var n=Object.prototype.hasOwnProperty;t.exports=function(t){var e=t.length,r=new t.constructor(e);return e&&"string"==typeof t[0]&&n.call(t,"index")&&(r.index=t.index,r.input=t.input),r}},function(t,e,n){var r=n(98),i=n(283),a=n(284),o=n(285),s=n(145);t.exports=function(t,e,n){var u=t.constructor;switch(e){case"[object ArrayBuffer]":return r(t);case"[object Boolean]":case"[object Date]":return new u(+t);case"[object DataView]":return i(t,n);case"[object Float32Array]":case"[object Float64Array]":case"[object Int8Array]":case"[object Int16Array]":case"[object Int32Array]":case"[object Uint8Array]":case"[object Uint8ClampedArray]":case"[object Uint16Array]":case"[object Uint32Array]":return s(t,n);case"[object Map]":return new u;case"[object Number]":case"[object String]":return new u(t);case"[object RegExp]":return a(t);case"[object Set]":return new u;case"[object Symbol]":return o(t)}}},function(t,e,n){var r=n(98);t.exports=function(t,e){var n=e?r(t.buffer):t.buffer;return new t.constructor(n,t.byteOffset,t.byteLength)}},function(t,e){var n=/\w*$/;t.exports=function(t){var e=new t.constructor(t.source,n.exec(t));return e.lastIndex=t.lastIndex,e}},function(t,e,n){var r=n(38),i=r?r.prototype:void 0,a=i?i.valueOf:void 0;t.exports=function(t){return a?Object(a.call(t)):{}}},function(t,e,n){var r=n(287),i=n(69),a=n(94),o=a&&a.isMap,s=o?i(o):r;t.exports=s},function(t,e,n){var r=n(41),i=n(20);t.exports=function(t){return i(t)&&"[object Map]"==r(t)}},function(t,e,n){var r=n(289),i=n(69),a=n(94),o=a&&a.isSet,s=o?i(o):r;t.exports=s},function(t,e,n){var r=n(41),i=n(20);t.exports=function(t){return i(t)&&"[object Set]"==r(t)}},function(t,e){t.exports=function(t){return function(e,n,r){for(var i=-1,a=Object(e),o=r(e),s=o.length;s--;){var u=o[t?s:++i];if(!1===n(a[u],u,a))break}return e}}},function(t,e,n){var r=n(23);t.exports=function(t,e){return function(n,i){if(null==n)return n;if(!r(n))return t(n,i);for(var a=n.length,o=e?a:-1,s=Object(n);(e?o--:++o<a)&&!1!==i(s[o],o,s););return n}}},function(t,e,n){var r=n(72);t.exports=function(t,e){var n=[];return r(t,(function(t,r,i){e(t,r,i)&&n.push(t)})),n}},function(t,e,n){var r=n(294),i=n(302),a=n(156);t.exports=function(t){var e=i(t);return 1==e.length&&e[0][2]?a(e[0][0],e[0][1]):function(n){return n===t||r(n,t,e)}}},function(t,e,n){var r=n(61),i=n(151);t.exports=function(t,e,n,a){var o=n.length,s=o,u=!a;if(null==t)return!s;for(t=Object(t);o--;){var c=n[o];if(u&&c[2]?c[1]!==t[c[0]]:!(c[0]in t))return!1}for(;++o<s;){var f=(c=n[o])[0],l=t[f],h=c[1];if(u&&c[2]){if(void 0===l&&!(f in t))return!1}else{var d=new r;if(a)var p=a(l,h,f,t,e,d);if(!(void 0===p?i(h,l,3,a,d):p))return!1}}return!0}},function(t,e,n){var r=n(61),i=n(152),a=n(299),o=n(301),s=n(41),u=n(6),c=n(39),f=n(51),l="[object Object]",h=Object.prototype.hasOwnProperty;t.exports=function(t,e,n,d,p,g){var y=u(t),b=u(e),v=y?"[object Array]":s(t),m=b?"[object Array]":s(e),_=(v="[object Arguments]"==v?l:v)==l,w=(m="[object Arguments]"==m?l:m)==l,x=v==m;if(x&&c(t)){if(!c(e))return!1;y=!0,_=!1}if(x&&!_)return g||(g=new r),y||f(t)?i(t,e,n,d,p,g):a(t,e,v,n,d,p,g);if(!(1&n)){var k=_&&h.call(t,"__wrapped__"),E=w&&h.call(e,"__wrapped__");if(k||E){var A=k?t.value():t,S=E?e.value():e;return g||(g=new r),p(A,S,n,d,g)}}return!!x&&(g||(g=new r),o(t,e,n,d,p,g))}},function(t,e){t.exports=function(t){return this.__data__.set(t,"__lodash_hash_undefined__"),this}},function(t,e){t.exports=function(t){return this.__data__.has(t)}},function(t,e){t.exports=function(t,e){for(var n=-1,r=null==t?0:t.length;++n<r;)if(e(t[n],n,t))return!0;return!1}},function(t,e,n){var r=n(38),i=n(144),a=n(36),o=n(152),s=n(300),u=n(103),c=r?r.prototype:void 0,f=c?c.valueOf:void 0;t.exports=function(t,e,n,r,c,l,h){switch(n){case"[object DataView]":if(t.byteLength!=e.byteLength||t.byteOffset!=e.byteOffset)return!1;t=t.buffer,e=e.buffer;case"[object ArrayBuffer]":return!(t.byteLength!=e.byteLength||!l(new i(t),new i(e)));case"[object Boolean]":case"[object Date]":case"[object Number]":return a(+t,+e);case"[object Error]":return t.name==e.name&&t.message==e.message;case"[object RegExp]":case"[object String]":return t==e+"";case"[object Map]":var d=s;case"[object Set]":var p=1&r;if(d||(d=u),t.size!=e.size&&!p)return!1;var g=h.get(t);if(g)return g==e;r|=2,h.set(t,e);var y=o(d(t),d(e),r,c,l,h);return h.delete(t),y;case"[object Symbol]":if(f)return f.call(t)==f.call(e)}return!1}},function(t,e){t.exports=function(t){var e=-1,n=Array(t.size);return t.forEach((function(t,r){n[++e]=[r,t]})),n}},function(t,e,n){var r=n(141),i=Object.prototype.hasOwnProperty;t.exports=function(t,e,n,a,o,s){var u=1&n,c=r(t),f=c.length;if(f!=r(e).length&&!u)return!1;for(var l=f;l--;){var h=c[l];if(!(u?h in e:i.call(e,h)))return!1}var d=s.get(t);if(d&&s.get(e))return d==e;var p=!0;s.set(t,e),s.set(e,t);for(var g=u;++l<f;){var y=t[h=c[l]],b=e[h];if(a)var v=u?a(b,y,h,e,t,s):a(y,b,h,t,e,s);if(!(void 0===v?y===b||o(y,b,n,a,s):v)){p=!1;break}g||(g="constructor"==h)}if(p&&!g){var m=t.constructor,_=e.constructor;m!=_&&"constructor"in t&&"constructor"in e&&!("function"==typeof m&&m instanceof m&&"function"==typeof _&&_ instanceof _)&&(p=!1)}return s.delete(t),s.delete(e),p}},function(t,e,n){var r=n(155),i=n(27);t.exports=function(t){for(var e=i(t),n=e.length;n--;){var a=e[n],o=t[a];e[n]=[a,o,r(o)]}return e}},function(t,e,n){var r=n(151),i=n(304),a=n(158),o=n(105),s=n(155),u=n(156),c=n(52);t.exports=function(t,e){return o(t)&&s(e)?u(c(t),e):function(n){var o=i(n,t);return void 0===o&&o===e?a(n,t):r(e,o,3)}}},function(t,e,n){var r=n(104);t.exports=function(t,e,n){var i=null==t?void 0:r(t,e);return void 0===i?n:i}},function(t,e,n){var r=n(306),i=/[^.[\]]+|\[(?:(-?\d+(?:\.\d+)?)|(["'])((?:(?!\2)[^\\]|\\.)*?)\2)\]|(?=(?:\.|\[\])(?:\.|\[\]|$))/g,a=/\\(\\)?/g,o=r((function(t){var e=[];return 46===t.charCodeAt(0)&&e.push(""),t.replace(i,(function(t,n,r,i){e.push(r?i.replace(a,"$1"):n||t)})),e}));t.exports=o},function(t,e,n){var r=n(307);t.exports=function(t){var e=r(t,(function(t){return 500===n.size&&n.clear(),t})),n=e.cache;return e}},function(t,e,n){var r=n(91);function i(t,e){if("function"!=typeof t||null!=e&&"function"!=typeof e)throw new TypeError("Expected a function");var n=function(){var r=arguments,i=e?e.apply(this,r):r[0],a=n.cache;if(a.has(i))return a.get(i);var o=t.apply(this,r);return n.cache=a.set(i,o)||a,o};return n.cache=new(i.Cache||r),n}i.Cache=r,t.exports=i},function(t,e,n){var r=n(38),i=n(74),a=n(6),o=n(42),s=r?r.prototype:void 0,u=s?s.toString:void 0;t.exports=function t(e){if("string"==typeof e)return e;if(a(e))return i(e,t)+"";if(o(e))return u?u.call(e):"";var n=e+"";return"0"==n&&1/e==-1/0?"-0":n}},function(t,e){t.exports=function(t,e){return null!=t&&e in Object(t)}},function(t,e,n){var r=n(160),i=n(311),a=n(105),o=n(52);t.exports=function(t){return a(t)?r(o(t)):i(t)}},function(t,e,n){var r=n(104);t.exports=function(t){return function(e){return r(e,t)}}},function(t,e){var n=Object.prototype.hasOwnProperty;t.exports=function(t,e){return null!=t&&n.call(t,e)}},function(t,e,n){var r=n(95),i=n(41),a=n(50),o=n(6),s=n(23),u=n(39),c=n(70),f=n(51),l=Object.prototype.hasOwnProperty;t.exports=function(t){if(null==t)return!0;if(s(t)&&(o(t)||"string"==typeof t||"function"==typeof t.splice||u(t)||f(t)||a(t)))return!t.length;var e=i(t);if("[object Map]"==e||"[object Set]"==e)return!t.size;if(c(t))return!r(t).length;for(var n in t)if(l.call(t,n))return!1;return!0}},function(t,e){t.exports=function(t,e,n,r){var i=-1,a=null==t?0:t.length;for(r&&a&&(n=t[++i]);++i<a;)n=e(n,t[i],i,t);return n}},function(t,e){t.exports=function(t,e,n,r,i){return i(t,(function(t,i,a){n=r?(r=!1,t):e(n,t,i,a)})),n}},function(t,e,n){var r=n(95),i=n(41),a=n(23),o=n(317),s=n(318);t.exports=function(t){if(null==t)return 0;if(a(t))return o(t)?s(t):t.length;var e=i(t);return"[object Map]"==e||"[object Set]"==e?t.size:r(t).length}},function(t,e,n){var r=n(33),i=n(6),a=n(20);t.exports=function(t){return"string"==typeof t||!i(t)&&a(t)&&"[object String]"==r(t)}},function(t,e,n){var r=n(319),i=n(320),a=n(321);t.exports=function(t){return i(t)?a(t):r(t)}},function(t,e,n){var r=n(160)("length");t.exports=r},function(t,e){var n=RegExp("[\\u200d\\ud800-\\udfff\\u0300-\\u036f\\ufe20-\\ufe2f\\u20d0-\\u20ff\\ufe0e\\ufe0f]");t.exports=function(t){return n.test(t)}},function(t,e){var n="[\\ud800-\\udfff]",r="[\\u0300-\\u036f\\ufe20-\\ufe2f\\u20d0-\\u20ff]",i="\\ud83c[\\udffb-\\udfff]",a="[^\\ud800-\\udfff]",o="(?:\\ud83c[\\udde6-\\uddff]){2}",s="[\\ud800-\\udbff][\\udc00-\\udfff]",u="(?:"+r+"|"+i+")"+"?",c="[\\ufe0e\\ufe0f]?"+u+("(?:\\u200d(?:"+[a,o,s].join("|")+")[\\ufe0e\\ufe0f]?"+u+")*"),f="(?:"+[a+r+"?",r,o,s,n].join("|")+")",l=RegExp(i+"(?="+i+")|"+f+c,"g");t.exports=function(t){for(var e=l.lastIndex=0;l.test(t);)++e;return e}},function(t,e,n){var r=n(92),i=n(147),a=n(101),o=n(24),s=n(71),u=n(6),c=n(39),f=n(37),l=n(14),h=n(51);t.exports=function(t,e,n){var d=u(t),p=d||c(t)||h(t);if(e=o(e,4),null==n){var g=t&&t.constructor;n=p?d?new g:[]:l(t)&&f(g)?i(s(t)):{}}return(p?r:a)(t,(function(t,r,i){return e(n,t,r,i)})),n}},function(t,e,n){var r=n(107),i=n(75),a=n(328),o=n(168),s=i((function(t){return a(r(t,1,o,!0))}));t.exports=s},function(t,e,n){var r=n(38),i=n(50),a=n(6),o=r?r.isConcatSpreadable:void 0;t.exports=function(t){return a(t)||i(t)||!!(o&&t&&t[o])}},function(t,e){t.exports=function(t,e,n){switch(n.length){case 0:return t.call(e);case 1:return t.call(e,n[0]);case 2:return t.call(e,n[0],n[1]);case 3:return t.call(e,n[0],n[1],n[2])}return t.apply(e,n)}},function(t,e,n){var r=n(99),i=n(133),a=n(34),o=i?function(t,e){return i(t,"toString",{configurable:!0,enumerable:!1,value:r(e),writable:!0})}:a;t.exports=o},function(t,e){var n=Date.now;t.exports=function(t){var e=0,r=0;return function(){var i=n(),a=16-(i-r);if(r=i,a>0){if(++e>=800)return arguments[0]}else e=0;return t.apply(void 0,arguments)}}},function(t,e,n){var r=n(153),i=n(329),a=n(333),o=n(154),s=n(334),u=n(103);t.exports=function(t,e,n){var c=-1,f=i,l=t.length,h=!0,d=[],p=d;if(n)h=!1,f=a;else if(l>=200){var g=e?null:s(t);if(g)return u(g);h=!1,f=o,p=new r}else p=e?[]:d;t:for(;++c<l;){var y=t[c],b=e?e(y):y;if(y=n||0!==y?y:0,h&&b==b){for(var v=p.length;v--;)if(p[v]===b)continue t;e&&p.push(b),d.push(y)}else f(p,b,n)||(p!==d&&p.push(b),d.push(y))}return d}},function(t,e,n){var r=n(330);t.exports=function(t,e){return!!(null==t?0:t.length)&&r(t,e,0)>-1}},function(t,e,n){var r=n(167),i=n(331),a=n(332);t.exports=function(t,e,n){return e==e?a(t,e,n):r(t,i,n)}},function(t,e){t.exports=function(t){return t!=t}},function(t,e){t.exports=function(t,e,n){for(var r=n-1,i=t.length;++r<i;)if(t[r]===e)return r;return-1}},function(t,e){t.exports=function(t,e,n){for(var r=-1,i=null==t?0:t.length;++r<i;)if(n(e,t[r]))return!0;return!1}},function(t,e,n){var r=n(143),i=n(335),a=n(103),o=r&&1/a(new r([,-0]))[1]==1/0?function(t){return new r(t)}:i;t.exports=o},function(t,e){t.exports=function(){}},function(t,e,n){var r=n(74);t.exports=function(t,e){return r(e,(function(e){return t[e]}))}},function(t,e){t.exports="2.1.8"},function(t,e,n){var r=n(13),i=n(89);function a(t){return r.map(t.nodes(),(function(e){var n=t.node(e),i=t.parent(e),a={v:e};return r.isUndefined(n)||(a.value=n),r.isUndefined(i)||(a.parent=i),a}))}function o(t){return r.map(t.edges(),(function(e){var n=t.edge(e),i={v:e.v,w:e.w};return r.isUndefined(e.name)||(i.name=e.name),r.isUndefined(n)||(i.value=n),i}))}t.exports={write:function(t){var e={options:{directed:t.isDirected(),multigraph:t.isMultigraph(),compound:t.isCompound()},nodes:a(t),edges:o(t)};r.isUndefined(t.graph())||(e.value=r.clone(t.graph()));return e},read:function(t){var e=new i(t.options).setGraph(t.value);return r.each(t.nodes,(function(t){e.setNode(t.v,t.value),t.parent&&e.setParent(t.v,t.parent)})),r.each(t.edges,(function(t){e.setEdge({v:t.v,w:t.w,name:t.name},t.value)})),e}}},function(t,e,n){t.exports={components:n(340),dijkstra:n(170),dijkstraAll:n(341),findCycles:n(342),floydWarshall:n(343),isAcyclic:n(344),postorder:n(345),preorder:n(346),prim:n(347),tarjan:n(172),topsort:n(173)}},function(t,e,n){var r=n(13);t.exports=function(t){var e,n={},i=[];function a(i){r.has(n,i)||(n[i]=!0,e.push(i),r.each(t.successors(i),a),r.each(t.predecessors(i),a))}return r.each(t.nodes(),(function(t){e=[],a(t),e.length&&i.push(e)})),i}},function(t,e,n){var r=n(170),i=n(13);t.exports=function(t,e,n){return i.transform(t.nodes(),(function(i,a){i[a]=r(t,a,e,n)}),{})}},function(t,e,n){var r=n(13),i=n(172);t.exports=function(t){return r.filter(i(t),(function(e){return e.length>1||1===e.length&&t.hasEdge(e[0],e[0])}))}},function(t,e,n){var r=n(13);t.exports=function(t,e,n){return function(t,e,n){var r={},i=t.nodes();return i.forEach((function(t){r[t]={},r[t][t]={distance:0},i.forEach((function(e){t!==e&&(r[t][e]={distance:Number.POSITIVE_INFINITY})})),n(t).forEach((function(n){var i=n.v===t?n.w:n.v,a=e(n);r[t][i]={distance:a,predecessor:t}}))})),i.forEach((function(t){var e=r[t];i.forEach((function(n){var a=r[n];i.forEach((function(n){var r=a[t],i=e[n],o=a[n],s=r.distance+i.distance;s<o.distance&&(o.distance=s,o.predecessor=i.predecessor)}))}))})),r}(t,e||i,n||function(e){return t.outEdges(e)})};var i=r.constant(1)},function(t,e,n){var r=n(173);t.exports=function(t){try{r(t)}catch(t){if(t instanceof r.CycleException)return!1;throw t}return!0}},function(t,e,n){var r=n(174);t.exports=function(t,e){return r(t,e,"post")}},function(t,e,n){var r=n(174);t.exports=function(t,e){return r(t,e,"pre")}},function(t,e,n){var r=n(13),i=n(89),a=n(171);t.exports=function(t,e){var n,o=new i,s={},u=new a;function c(t){var r=t.v===n?t.w:t.v,i=u.priority(r);if(void 0!==i){var a=e(t);a<i&&(s[r]=n,u.decrease(r,a))}}if(0===t.nodeCount())return o;r.each(t.nodes(),(function(t){u.add(t,Number.POSITIVE_INFINITY),o.setNode(t)})),u.decrease(t.nodes()[0],0);var f=!1;for(;u.size()>0;){if(n=u.removeMin(),r.has(s,n))o.setEdge(n,s[n]);else{if(f)throw new Error("Input graph is not connected: "+t);f=!0}t.nodeEdges(n).forEach(c)}return o}},function(t,e,n){var r;try{r=n(25)}catch(t){}r||(r=window.graphlib),t.exports=r},function(t,e,n){"use strict";var r=n(4),i=n(382),a=n(385),o=n(386),s=n(10).normalizeRanks,u=n(388),c=n(10).removeEmptyRanks,f=n(389),l=n(390),h=n(391),d=n(392),p=n(401),g=n(10),y=n(19).Graph;t.exports=function(t,e){var n=e&&e.debugTiming?g.time:g.notime;n("layout",(function(){var e=n(" buildLayoutGraph",(function(){return function(t){var e=new y({multigraph:!0,compound:!0}),n=S(t.graph());return e.setGraph(r.merge({},v,A(n,b),r.pick(n,m))),r.forEach(t.nodes(),(function(n){var i=S(t.node(n));e.setNode(n,r.defaults(A(i,_),w)),e.setParent(n,t.parent(n))})),r.forEach(t.edges(),(function(n){var i=S(t.edge(n));e.setEdge(n,r.merge({},k,A(i,x),r.pick(i,E)))})),e}(t)}));n(" runLayout",(function(){!function(t,e){e(" makeSpaceForEdgeLabels",(function(){!function(t){var e=t.graph();e.ranksep/=2,r.forEach(t.edges(),(function(n){var r=t.edge(n);r.minlen*=2,"c"!==r.labelpos.toLowerCase()&&("TB"===e.rankdir||"BT"===e.rankdir?r.width+=r.labeloffset:r.height+=r.labeloffset)}))}(t)})),e(" removeSelfEdges",(function(){!function(t){r.forEach(t.edges(),(function(e){if(e.v===e.w){var n=t.node(e.v);n.selfEdges||(n.selfEdges=[]),n.selfEdges.push({e:e,label:t.edge(e)}),t.removeEdge(e)}}))}(t)})),e(" acyclic",(function(){i.run(t)})),e(" nestingGraph.run",(function(){f.run(t)})),e(" rank",(function(){o(g.asNonCompoundGraph(t))})),e(" injectEdgeLabelProxies",(function(){!function(t){r.forEach(t.edges(),(function(e){var n=t.edge(e);if(n.width&&n.height){var r=t.node(e.v),i={rank:(t.node(e.w).rank-r.rank)/2+r.rank,e:e};g.addDummyNode(t,"edge-proxy",i,"_ep")}}))}(t)})),e(" removeEmptyRanks",(function(){c(t)})),e(" nestingGraph.cleanup",(function(){f.cleanup(t)})),e(" normalizeRanks",(function(){s(t)})),e(" assignRankMinMax",(function(){!function(t){var e=0;r.forEach(t.nodes(),(function(n){var i=t.node(n);i.borderTop&&(i.minRank=t.node(i.borderTop).rank,i.maxRank=t.node(i.borderBottom).rank,e=r.max(e,i.maxRank))})),t.graph().maxRank=e}(t)})),e(" removeEdgeLabelProxies",(function(){!function(t){r.forEach(t.nodes(),(function(e){var n=t.node(e);"edge-proxy"===n.dummy&&(t.edge(n.e).labelRank=n.rank,t.removeNode(e))}))}(t)})),e(" normalize.run",(function(){a.run(t)})),e(" parentDummyChains",(function(){u(t)})),e(" addBorderSegments",(function(){l(t)})),e(" order",(function(){d(t)})),e(" insertSelfEdges",(function(){!function(t){var e=g.buildLayerMatrix(t);r.forEach(e,(function(e){var n=0;r.forEach(e,(function(e,i){var a=t.node(e);a.order=i+n,r.forEach(a.selfEdges,(function(e){g.addDummyNode(t,"selfedge",{width:e.label.width,height:e.label.height,rank:a.rank,order:i+ ++n,e:e.e,label:e.label},"_se")})),delete a.selfEdges}))}))}(t)})),e(" adjustCoordinateSystem",(function(){h.adjust(t)})),e(" position",(function(){p(t)})),e(" positionSelfEdges",(function(){!function(t){r.forEach(t.nodes(),(function(e){var n=t.node(e);if("selfedge"===n.dummy){var r=t.node(n.e.v),i=r.x+r.width/2,a=r.y,o=n.x-i,s=r.height/2;t.setEdge(n.e,n.label),t.removeNode(e),n.label.points=[{x:i+2*o/3,y:a-s},{x:i+5*o/6,y:a-s},{x:i+o,y:a},{x:i+5*o/6,y:a+s},{x:i+2*o/3,y:a+s}],n.label.x=n.x,n.label.y=n.y}}))}(t)})),e(" removeBorderNodes",(function(){!function(t){r.forEach(t.nodes(),(function(e){if(t.children(e).length){var n=t.node(e),i=t.node(n.borderTop),a=t.node(n.borderBottom),o=t.node(r.last(n.borderLeft)),s=t.node(r.last(n.borderRight));n.width=Math.abs(s.x-o.x),n.height=Math.abs(a.y-i.y),n.x=o.x+n.width/2,n.y=i.y+n.height/2}})),r.forEach(t.nodes(),(function(e){"border"===t.node(e).dummy&&t.removeNode(e)}))}(t)})),e(" normalize.undo",(function(){a.undo(t)})),e(" fixupEdgeLabelCoords",(function(){!function(t){r.forEach(t.edges(),(function(e){var n=t.edge(e);if(r.has(n,"x"))switch("l"!==n.labelpos&&"r"!==n.labelpos||(n.width-=n.labeloffset),n.labelpos){case"l":n.x-=n.width/2+n.labeloffset;break;case"r":n.x+=n.width/2+n.labeloffset}}))}(t)})),e(" undoCoordinateSystem",(function(){h.undo(t)})),e(" translateGraph",(function(){!function(t){var e=Number.POSITIVE_INFINITY,n=0,i=Number.POSITIVE_INFINITY,a=0,o=t.graph(),s=o.marginx||0,u=o.marginy||0;function c(t){var r=t.x,o=t.y,s=t.width,u=t.height;e=Math.min(e,r-s/2),n=Math.max(n,r+s/2),i=Math.min(i,o-u/2),a=Math.max(a,o+u/2)}r.forEach(t.nodes(),(function(e){c(t.node(e))})),r.forEach(t.edges(),(function(e){var n=t.edge(e);r.has(n,"x")&&c(n)})),e-=s,i-=u,r.forEach(t.nodes(),(function(n){var r=t.node(n);r.x-=e,r.y-=i})),r.forEach(t.edges(),(function(n){var a=t.edge(n);r.forEach(a.points,(function(t){t.x-=e,t.y-=i})),r.has(a,"x")&&(a.x-=e),r.has(a,"y")&&(a.y-=i)})),o.width=n-e+s,o.height=a-i+u}(t)})),e(" assignNodeIntersects",(function(){!function(t){r.forEach(t.edges(),(function(e){var n,r,i=t.edge(e),a=t.node(e.v),o=t.node(e.w);i.points?(n=i.points[0],r=i.points[i.points.length-1]):(i.points=[],n=o,r=a),i.points.unshift(g.intersectRect(a,n)),i.points.push(g.intersectRect(o,r))}))}(t)})),e(" reversePoints",(function(){!function(t){r.forEach(t.edges(),(function(e){var n=t.edge(e);n.reversed&&n.points.reverse()}))}(t)})),e(" acyclic.undo",(function(){i.undo(t)}))}(e,n)})),n(" updateInputGraph",(function(){!function(t,e){r.forEach(t.nodes(),(function(n){var r=t.node(n),i=e.node(n);r&&(r.x=i.x,r.y=i.y,e.children(n).length&&(r.width=i.width,r.height=i.height))})),r.forEach(t.edges(),(function(n){var i=t.edge(n),a=e.edge(n);i.points=a.points,r.has(a,"x")&&(i.x=a.x,i.y=a.y)})),t.graph().width=e.graph().width,t.graph().height=e.graph().height}(t,e)}))}))};var b=["nodesep","edgesep","ranksep","marginx","marginy"],v={ranksep:50,edgesep:20,nodesep:50,rankdir:"tb"},m=["acyclicer","ranker","rankdir","align"],_=["width","height"],w={width:0,height:0},x=["minlen","weight","width","height","labeloffset"],k={minlen:1,weight:1,width:0,height:0,labeloffset:10,labelpos:"r"},E=["labelpos"];function A(t,e){return r.mapValues(r.pick(t,e),Number)}function S(t){var e={};return r.forEach(t,(function(t,n){e[n.toLowerCase()]=t})),e}},function(t,e,n){var r=n(130);t.exports=function(t){return r(t,5)}},function(t,e,n){var r=n(352)(n(353));t.exports=r},function(t,e,n){var r=n(24),i=n(23),a=n(27);t.exports=function(t){return function(e,n,o){var s=Object(e);if(!i(e)){var u=r(n,3);e=a(e),n=function(t){return u(s[t],t,s)}}var c=t(e,n,o);return c>-1?s[u?e[c]:c]:void 0}}},function(t,e,n){var r=n(167),i=n(24),a=n(354),o=Math.max;t.exports=function(t,e,n){var s=null==t?0:t.length;if(!s)return-1;var u=null==n?0:a(n);return u<0&&(u=o(s+u,0)),r(t,i(e,3),u)}},function(t,e,n){var r=n(177);t.exports=function(t){var e=r(t),n=e%1;return e==e?n?e-n:e:0}},function(t,e,n){var r=n(14),i=n(42),a=/^\s+|\s+$/g,o=/^[-+]0x[0-9a-f]+$/i,s=/^0b[01]+$/i,u=/^0o[0-7]+$/i,c=parseInt;t.exports=function(t){if("number"==typeof t)return t;if(i(t))return NaN;if(r(t)){var e="function"==typeof t.valueOf?t.valueOf():t;t=r(e)?e+"":e}if("string"!=typeof t)return 0===t?t:+t;t=t.replace(a,"");var n=s.test(t);return n||u.test(t)?c(t.slice(2),n?2:8):o.test(t)?NaN:+t}},function(t,e,n){var r=n(102),i=n(149),a=n(40);t.exports=function(t,e){return null==t?t:r(t,i(e),a)}},function(t,e){t.exports=function(t){var e=null==t?0:t.length;return e?t[e-1]:void 0}},function(t,e,n){var r=n(67),i=n(101),a=n(24);t.exports=function(t,e){var n={};return e=a(e,3),i(t,(function(t,i,a){r(n,i,e(t,i,a))})),n}},function(t,e,n){var r=n(108),i=n(360),a=n(34);t.exports=function(t){return t&&t.length?r(t,a,i):void 0}},function(t,e){t.exports=function(t,e){return t>e}},function(t,e,n){var r=n(362),i=n(365)((function(t,e,n){r(t,e,n)}));t.exports=i},function(t,e,n){var r=n(61),i=n(179),a=n(102),o=n(363),s=n(14),u=n(40),c=n(181);t.exports=function t(e,n,f,l,h){e!==n&&a(n,(function(a,u){if(h||(h=new r),s(a))o(e,n,u,f,t,l,h);else{var d=l?l(c(e,u),a,u+"",e,n,h):void 0;void 0===d&&(d=a),i(e,u,d)}}),u)}},function(t,e,n){var r=n(179),i=n(136),a=n(145),o=n(137),s=n(146),u=n(50),c=n(6),f=n(168),l=n(39),h=n(37),d=n(14),p=n(180),g=n(51),y=n(181),b=n(364);t.exports=function(t,e,n,v,m,_,w){var x=y(t,n),k=y(e,n),E=w.get(k);if(E)r(t,n,E);else{var A=_?_(x,k,n+"",t,e,w):void 0,S=void 0===A;if(S){var M=c(k),T=!M&&l(k),D=!M&&!T&&g(k);A=k,M||T||D?c(x)?A=x:f(x)?A=o(x):T?(S=!1,A=i(k,!0)):D?(S=!1,A=a(k,!0)):A=[]:p(k)||u(k)?(A=x,u(x)?A=b(x):d(x)&&!h(x)||(A=s(k))):S=!1}S&&(w.set(k,A),m(A,k,v,_,w),w.delete(k)),r(t,n,A)}}},function(t,e,n){var r=n(49),i=n(40);t.exports=function(t){return r(t,i(t))}},function(t,e,n){var r=n(75),i=n(76);t.exports=function(t){return r((function(e,n){var r=-1,a=n.length,o=a>1?n[a-1]:void 0,s=a>2?n[2]:void 0;for(o=t.length>3&&"function"==typeof o?(a--,o):void 0,s&&i(n[0],n[1],s)&&(o=a<3?void 0:o,a=1),e=Object(e);++r<a;){var u=n[r];u&&t(e,u,r,o)}return e}))}},function(t,e,n){var r=n(108),i=n(182),a=n(34);t.exports=function(t){return t&&t.length?r(t,a,i):void 0}},function(t,e,n){var r=n(108),i=n(24),a=n(182);t.exports=function(t,e){return t&&t.length?r(t,i(e,2),a):void 0}},function(t,e,n){var r=n(18);t.exports=function(){return r.Date.now()}},function(t,e,n){var r=n(370),i=n(158);t.exports=function(t,e){return r(t,e,(function(e,n){return i(t,n)}))}},function(t,e,n){var r=n(104),i=n(371),a=n(73);t.exports=function(t,e,n){for(var o=-1,s=e.length,u={};++o<s;){var c=e[o],f=r(t,c);n(f,c)&&i(u,a(c,t),f)}return u}},function(t,e,n){var r=n(66),i=n(73),a=n(68),o=n(14),s=n(52);t.exports=function(t,e,n,u){if(!o(t))return t;for(var c=-1,f=(e=i(e,t)).length,l=f-1,h=t;null!=h&&++c<f;){var d=s(e[c]),p=n;if(c!=l){var g=h[d];void 0===(p=u?u(g,d,h):void 0)&&(p=o(g)?g:a(e[c+1])?[]:{})}r(h,d,p),h=h[d]}return t}},function(t,e,n){var r=n(178),i=n(165),a=n(166);t.exports=function(t){return a(i(t,void 0,r),t+"")}},function(t,e,n){var r=n(374),i=n(76),a=n(177);t.exports=function(t){return function(e,n,o){return o&&"number"!=typeof o&&i(e,n,o)&&(n=o=void 0),e=a(e),void 0===n?(n=e,e=0):n=a(n),o=void 0===o?e<n?1:-1:a(o),r(e,n,o,t)}}},function(t,e){var n=Math.ceil,r=Math.max;t.exports=function(t,e,i,a){for(var o=-1,s=r(n((e-t)/(i||1)),0),u=Array(s);s--;)u[a?s:++o]=t,t+=i;return u}},function(t,e,n){var r=n(107),i=n(376),a=n(75),o=n(76),s=a((function(t,e){if(null==t)return[];var n=e.length;return n>1&&o(t,e[0],e[1])?e=[]:n>2&&o(e[0],e[1],e[2])&&(e=[e[0]]),i(t,r(e,1),[])}));t.exports=s},function(t,e,n){var r=n(74),i=n(24),a=n(163),o=n(377),s=n(69),u=n(378),c=n(34);t.exports=function(t,e,n){var f=-1;e=r(e.length?e:[c],s(i));var l=a(t,(function(t,n,i){return{criteria:r(e,(function(e){return e(t)})),index:++f,value:t}}));return o(l,(function(t,e){return u(t,e,n)}))}},function(t,e){t.exports=function(t,e){var n=t.length;for(t.sort(e);n--;)t[n]=t[n].value;return t}},function(t,e,n){var r=n(379);t.exports=function(t,e,n){for(var i=-1,a=t.criteria,o=e.criteria,s=a.length,u=n.length;++i<s;){var c=r(a[i],o[i]);if(c)return i>=u?c:c*("desc"==n[i]?-1:1)}return t.index-e.index}},function(t,e,n){var r=n(42);t.exports=function(t,e){if(t!==e){var n=void 0!==t,i=null===t,a=t==t,o=r(t),s=void 0!==e,u=null===e,c=e==e,f=r(e);if(!u&&!f&&!o&&t>e||o&&s&&c&&!u&&!f||i&&s&&c||!n&&c||!a)return 1;if(!i&&!o&&!f&&t<e||f&&n&&a&&!i&&!o||u&&n&&a||!s&&a||!c)return-1}return 0}},function(t,e,n){var r=n(66),i=n(381);t.exports=function(t,e){return i(t||[],e||[],r)}},function(t,e){t.exports=function(t,e,n){for(var r=-1,i=t.length,a=e.length,o={};++r<i;){var s=r<a?e[r]:void 0;n(o,t[r],s)}return o}},function(t,e,n){"use strict";var r=n(4),i=n(383);t.exports={run:function(t){var e="greedy"===t.graph().acyclicer?i(t,function(t){return function(e){return t.edge(e).weight}}(t)):function(t){var e=[],n={},i={};function a(o){r.has(i,o)||(i[o]=!0,n[o]=!0,r.forEach(t.outEdges(o),(function(t){r.has(n,t.w)?e.push(t):a(t.w)})),delete n[o])}return r.forEach(t.nodes(),a),e}(t);r.forEach(e,(function(e){var n=t.edge(e);t.removeEdge(e),n.forwardName=e.name,n.reversed=!0,t.setEdge(e.w,e.v,n,r.uniqueId("rev"))}))},undo:function(t){r.forEach(t.edges(),(function(e){var n=t.edge(e);if(n.reversed){t.removeEdge(e);var r=n.forwardName;delete n.reversed,delete n.forwardName,t.setEdge(e.w,e.v,n,r)}}))}}},function(t,e,n){var r=n(4),i=n(19).Graph,a=n(384);t.exports=function(t,e){if(t.nodeCount()<=1)return[];var n=function(t,e){var n=new i,o=0,s=0;r.forEach(t.nodes(),(function(t){n.setNode(t,{v:t,in:0,out:0})})),r.forEach(t.edges(),(function(t){var r=n.edge(t.v,t.w)||0,i=e(t),a=r+i;n.setEdge(t.v,t.w,a),s=Math.max(s,n.node(t.v).out+=i),o=Math.max(o,n.node(t.w).in+=i)}));var c=r.range(s+o+3).map((function(){return new a})),f=o+1;return r.forEach(n.nodes(),(function(t){u(c,f,n.node(t))})),{graph:n,buckets:c,zeroIdx:f}}(t,e||o),c=function(t,e,n){var r,i=[],a=e[e.length-1],o=e[0];for(;t.nodeCount();){for(;r=o.dequeue();)s(t,e,n,r);for(;r=a.dequeue();)s(t,e,n,r);if(t.nodeCount())for(var u=e.length-2;u>0;--u)if(r=e[u].dequeue()){i=i.concat(s(t,e,n,r,!0));break}}return i}(n.graph,n.buckets,n.zeroIdx);return r.flatten(r.map(c,(function(e){return t.outEdges(e.v,e.w)})),!0)};var o=r.constant(1);function s(t,e,n,i,a){var o=a?[]:void 0;return r.forEach(t.inEdges(i.v),(function(r){var i=t.edge(r),s=t.node(r.v);a&&o.push({v:r.v,w:r.w}),s.out-=i,u(e,n,s)})),r.forEach(t.outEdges(i.v),(function(r){var i=t.edge(r),a=r.w,o=t.node(a);o.in-=i,u(e,n,o)})),t.removeNode(i.v),o}function u(t,e,n){n.out?n.in?t[n.out-n.in+e].enqueue(n):t[t.length-1].enqueue(n):t[0].enqueue(n)}},function(t,e){function n(){var t={};t._next=t._prev=t,this._sentinel=t}function r(t){t._prev._next=t._next,t._next._prev=t._prev,delete t._next,delete t._prev}function i(t,e){if("_next"!==t&&"_prev"!==t)return e}t.exports=n,n.prototype.dequeue=function(){var t=this._sentinel,e=t._prev;if(e!==t)return r(e),e},n.prototype.enqueue=function(t){var e=this._sentinel;t._prev&&t._next&&r(t),t._next=e._next,e._next._prev=t,e._next=t,t._prev=e},n.prototype.toString=function(){for(var t=[],e=this._sentinel,n=e._prev;n!==e;)t.push(JSON.stringify(n,i)),n=n._prev;return"["+t.join(", ")+"]"}},function(t,e,n){"use strict";var r=n(4),i=n(10);t.exports={run:function(t){t.graph().dummyChains=[],r.forEach(t.edges(),(function(e){!function(t,e){var n,r,a,o=e.v,s=t.node(o).rank,u=e.w,c=t.node(u).rank,f=e.name,l=t.edge(e),h=l.labelRank;if(c===s+1)return;for(t.removeEdge(e),a=0,++s;s<c;++a,++s)l.points=[],r={width:0,height:0,edgeLabel:l,edgeObj:e,rank:s},n=i.addDummyNode(t,"edge",r,"_d"),s===h&&(r.width=l.width,r.height=l.height,r.dummy="edge-label",r.labelpos=l.labelpos),t.setEdge(o,n,{weight:l.weight},f),0===a&&t.graph().dummyChains.push(n),o=n;t.setEdge(o,u,{weight:l.weight},f)}(t,e)}))},undo:function(t){r.forEach(t.graph().dummyChains,(function(e){var n,r=t.node(e),i=r.edgeLabel;for(t.setEdge(r.edgeObj,i);r.dummy;)n=t.successors(e)[0],t.removeNode(e),i.points.push({x:r.x,y:r.y}),"edge-label"===r.dummy&&(i.x=r.x,i.y=r.y,i.width=r.width,i.height=r.height),e=n,r=t.node(e)}))}}},function(t,e,n){"use strict";var r=n(77).longestPath,i=n(186),a=n(387);t.exports=function(t){switch(t.graph().ranker){case"network-simplex":s(t);break;case"tight-tree":!function(t){r(t),i(t)}(t);break;case"longest-path":o(t);break;default:s(t)}};var o=r;function s(t){a(t)}},function(t,e,n){"use strict";var r=n(4),i=n(186),a=n(77).slack,o=n(77).longestPath,s=n(19).alg.preorder,u=n(19).alg.postorder,c=n(10).simplify;function f(t){t=c(t),o(t);var e,n=i(t);for(d(n),l(n,t);e=g(n);)b(n,t,e,y(n,t,e))}function l(t,e){var n=u(t,t.nodes());n=n.slice(0,n.length-1),r.forEach(n,(function(n){!function(t,e,n){var r=t.node(n).parent;t.edge(n,r).cutvalue=h(t,e,n)}(t,e,n)}))}function h(t,e,n){var i=t.node(n).parent,a=!0,o=e.edge(n,i),s=0;return o||(a=!1,o=e.edge(i,n)),s=o.weight,r.forEach(e.nodeEdges(n),(function(r){var o,u,c=r.v===n,f=c?r.w:r.v;if(f!==i){var l=c===a,h=e.edge(r).weight;if(s+=l?h:-h,o=n,u=f,t.hasEdge(o,u)){var d=t.edge(n,f).cutvalue;s+=l?-d:d}}})),s}function d(t,e){arguments.length<2&&(e=t.nodes()[0]),p(t,{},1,e)}function p(t,e,n,i,a){var o=n,s=t.node(i);return e[i]=!0,r.forEach(t.neighbors(i),(function(a){r.has(e,a)||(n=p(t,e,n,a,i))})),s.low=o,s.lim=n++,a?s.parent=a:delete s.parent,n}function g(t){return r.find(t.edges(),(function(e){return t.edge(e).cutvalue<0}))}function y(t,e,n){var i=n.v,o=n.w;e.hasEdge(i,o)||(i=n.w,o=n.v);var s=t.node(i),u=t.node(o),c=s,f=!1;s.lim>u.lim&&(c=u,f=!0);var l=r.filter(e.edges(),(function(e){return f===v(t,t.node(e.v),c)&&f!==v(t,t.node(e.w),c)}));return r.minBy(l,(function(t){return a(e,t)}))}function b(t,e,n,i){var a=n.v,o=n.w;t.removeEdge(a,o),t.setEdge(i.v,i.w,{}),d(t),l(t,e),function(t,e){var n=r.find(t.nodes(),(function(t){return!e.node(t).parent})),i=s(t,n);i=i.slice(1),r.forEach(i,(function(n){var r=t.node(n).parent,i=e.edge(n,r),a=!1;i||(i=e.edge(r,n),a=!0),e.node(n).rank=e.node(r).rank+(a?i.minlen:-i.minlen)}))}(t,e)}function v(t,e,n){return n.low<=e.lim&&e.lim<=n.lim}t.exports=f,f.initLowLimValues=d,f.initCutValues=l,f.calcCutValue=h,f.leaveEdge=g,f.enterEdge=y,f.exchangeEdges=b},function(t,e,n){var r=n(4);t.exports=function(t){var e=function(t){var e={},n=0;function i(a){var o=n;r.forEach(t.children(a),i),e[a]={low:o,lim:n++}}return r.forEach(t.children(),i),e}(t);r.forEach(t.graph().dummyChains,(function(n){for(var r=t.node(n),i=r.edgeObj,a=function(t,e,n,r){var i,a,o=[],s=[],u=Math.min(e[n].low,e[r].low),c=Math.max(e[n].lim,e[r].lim);i=n;do{i=t.parent(i),o.push(i)}while(i&&(e[i].low>u||c>e[i].lim));a=i,i=r;for(;(i=t.parent(i))!==a;)s.push(i);return{path:o.concat(s.reverse()),lca:a}}(t,e,i.v,i.w),o=a.path,s=a.lca,u=0,c=o[u],f=!0;n!==i.w;){if(r=t.node(n),f){for(;(c=o[u])!==s&&t.node(c).maxRank<r.rank;)u++;c===s&&(f=!1)}if(!f){for(;u<o.length-1&&t.node(c=o[u+1]).minRank<=r.rank;)u++;c=o[u]}t.setParent(n,c),n=t.successors(n)[0]}}))}},function(t,e,n){var r=n(4),i=n(10);t.exports={run:function(t){var e=i.addDummyNode(t,"root",{},"_root"),n=function(t){var e={};return r.forEach(t.children(),(function(n){!function n(i,a){var o=t.children(i);o&&o.length&&r.forEach(o,(function(t){n(t,a+1)}));e[i]=a}(n,1)})),e}(t),a=r.max(r.values(n))-1,o=2*a+1;t.graph().nestingRoot=e,r.forEach(t.edges(),(function(e){t.edge(e).minlen*=o}));var s=function(t){return r.reduce(t.edges(),(function(e,n){return e+t.edge(n).weight}),0)}(t)+1;r.forEach(t.children(),(function(u){!function t(e,n,a,o,s,u,c){var f=e.children(c);if(!f.length)return void(c!==n&&e.setEdge(n,c,{weight:0,minlen:a}));var l=i.addBorderNode(e,"_bt"),h=i.addBorderNode(e,"_bb"),d=e.node(c);e.setParent(l,c),d.borderTop=l,e.setParent(h,c),d.borderBottom=h,r.forEach(f,(function(r){t(e,n,a,o,s,u,r);var i=e.node(r),f=i.borderTop?i.borderTop:r,d=i.borderBottom?i.borderBottom:r,p=i.borderTop?o:2*o,g=f!==d?1:s-u[c]+1;e.setEdge(l,f,{weight:p,minlen:g,nestingEdge:!0}),e.setEdge(d,h,{weight:p,minlen:g,nestingEdge:!0})})),e.parent(c)||e.setEdge(n,l,{weight:0,minlen:s+u[c]})}(t,e,o,s,a,n,u)})),t.graph().nodeRankFactor=o},cleanup:function(t){var e=t.graph();t.removeNode(e.nestingRoot),delete e.nestingRoot,r.forEach(t.edges(),(function(e){t.edge(e).nestingEdge&&t.removeEdge(e)}))}}},function(t,e,n){var r=n(4),i=n(10);function a(t,e,n,r,a,o){var s={width:0,height:0,rank:o,borderType:e},u=a[e][o-1],c=i.addDummyNode(t,"border",s,n);a[e][o]=c,t.setParent(c,r),u&&t.setEdge(u,c,{weight:1})}t.exports=function(t){r.forEach(t.children(),(function e(n){var i=t.children(n),o=t.node(n);if(i.length&&r.forEach(i,e),r.has(o,"minRank")){o.borderLeft=[],o.borderRight=[];for(var s=o.minRank,u=o.maxRank+1;s<u;++s)a(t,"borderLeft","_bl",n,o,s),a(t,"borderRight","_br",n,o,s)}}))}},function(t,e,n){"use strict";var r=n(4);function i(t){r.forEach(t.nodes(),(function(e){a(t.node(e))})),r.forEach(t.edges(),(function(e){a(t.edge(e))}))}function a(t){var e=t.width;t.width=t.height,t.height=e}function o(t){t.y=-t.y}function s(t){var e=t.x;t.x=t.y,t.y=e}t.exports={adjust:function(t){var e=t.graph().rankdir.toLowerCase();"lr"!==e&&"rl"!==e||i(t)},undo:function(t){var e=t.graph().rankdir.toLowerCase();"bt"!==e&&"rl"!==e||function(t){r.forEach(t.nodes(),(function(e){o(t.node(e))})),r.forEach(t.edges(),(function(e){var n=t.edge(e);r.forEach(n.points,o),r.has(n,"y")&&o(n)}))}(t);"lr"!==e&&"rl"!==e||(!function(t){r.forEach(t.nodes(),(function(e){s(t.node(e))})),r.forEach(t.edges(),(function(e){var n=t.edge(e);r.forEach(n.points,s),r.has(n,"x")&&s(n)}))}(t),i(t))}}},function(t,e,n){"use strict";var r=n(4),i=n(393),a=n(394),o=n(395),s=n(399),u=n(400),c=n(19).Graph,f=n(10);function l(t,e,n){return r.map(e,(function(e){return s(t,e,n)}))}function h(t,e){var n=new c;r.forEach(t,(function(t){var i=t.graph().root,a=o(t,i,n,e);r.forEach(a.vs,(function(e,n){t.node(e).order=n})),u(t,n,a.vs)}))}function d(t,e){r.forEach(e,(function(e){r.forEach(e,(function(e,n){t.node(e).order=n}))}))}t.exports=function(t){var e=f.maxRank(t),n=l(t,r.range(1,e+1),"inEdges"),o=l(t,r.range(e-1,-1,-1),"outEdges"),s=i(t);d(t,s);for(var u,c=Number.POSITIVE_INFINITY,p=0,g=0;g<4;++p,++g){h(p%2?n:o,p%4>=2),s=f.buildLayerMatrix(t);var y=a(t,s);y<c&&(g=0,u=r.cloneDeep(s),c=y)}d(t,u)}},function(t,e,n){"use strict";var r=n(4);t.exports=function(t){var e={},n=r.filter(t.nodes(),(function(e){return!t.children(e).length})),i=r.max(r.map(n,(function(e){return t.node(e).rank}))),a=r.map(r.range(i+1),(function(){return[]}));var o=r.sortBy(n,(function(e){return t.node(e).rank}));return r.forEach(o,(function n(i){if(r.has(e,i))return;e[i]=!0;var o=t.node(i);a[o.rank].push(i),r.forEach(t.successors(i),n)})),a}},function(t,e,n){"use strict";var r=n(4);function i(t,e,n){for(var i=r.zipObject(n,r.map(n,(function(t,e){return e}))),a=r.flatten(r.map(e,(function(e){return r.sortBy(r.map(t.outEdges(e),(function(e){return{pos:i[e.w],weight:t.edge(e).weight}})),"pos")})),!0),o=1;o<n.length;)o<<=1;var s=2*o-1;o-=1;var u=r.map(new Array(s),(function(){return 0})),c=0;return r.forEach(a.forEach((function(t){var e=t.pos+o;u[e]+=t.weight;for(var n=0;e>0;)e%2&&(n+=u[e+1]),u[e=e-1>>1]+=t.weight;c+=t.weight*n}))),c}t.exports=function(t,e){for(var n=0,r=1;r<e.length;++r)n+=i(t,e[r-1],e[r]);return n}},function(t,e,n){var r=n(4),i=n(396),a=n(397),o=n(398);t.exports=function t(e,n,s,u){var c=e.children(n),f=e.node(n),l=f?f.borderLeft:void 0,h=f?f.borderRight:void 0,d={};l&&(c=r.filter(c,(function(t){return t!==l&&t!==h})));var p=i(e,c);r.forEach(p,(function(n){if(e.children(n.v).length){var i=t(e,n.v,s,u);d[n.v]=i,r.has(i,"barycenter")&&(a=n,o=i,r.isUndefined(a.barycenter)?(a.barycenter=o.barycenter,a.weight=o.weight):(a.barycenter=(a.barycenter*a.weight+o.barycenter*o.weight)/(a.weight+o.weight),a.weight+=o.weight))}var a,o}));var g=a(p,s);!function(t,e){r.forEach(t,(function(t){t.vs=r.flatten(t.vs.map((function(t){return e[t]?e[t].vs:t})),!0)}))}(g,d);var y=o(g,u);if(l&&(y.vs=r.flatten([l,y.vs,h],!0),e.predecessors(l).length)){var b=e.node(e.predecessors(l)[0]),v=e.node(e.predecessors(h)[0]);r.has(y,"barycenter")||(y.barycenter=0,y.weight=0),y.barycenter=(y.barycenter*y.weight+b.order+v.order)/(y.weight+2),y.weight+=2}return y}},function(t,e,n){var r=n(4);t.exports=function(t,e){return r.map(e,(function(e){var n=t.inEdges(e);if(n.length){var i=r.reduce(n,(function(e,n){var r=t.edge(n),i=t.node(n.v);return{sum:e.sum+r.weight*i.order,weight:e.weight+r.weight}}),{sum:0,weight:0});return{v:e,barycenter:i.sum/i.weight,weight:i.weight}}return{v:e}}))}},function(t,e,n){"use strict";var r=n(4);t.exports=function(t,e){var n={};return r.forEach(t,(function(t,e){var i=n[t.v]={indegree:0,in:[],out:[],vs:[t.v],i:e};r.isUndefined(t.barycenter)||(i.barycenter=t.barycenter,i.weight=t.weight)})),r.forEach(e.edges(),(function(t){var e=n[t.v],i=n[t.w];r.isUndefined(e)||r.isUndefined(i)||(i.indegree++,e.out.push(n[t.w]))})),function(t){var e=[];function n(t){return function(e){e.merged||(r.isUndefined(e.barycenter)||r.isUndefined(t.barycenter)||e.barycenter>=t.barycenter)&&function(t,e){var n=0,r=0;t.weight&&(n+=t.barycenter*t.weight,r+=t.weight);e.weight&&(n+=e.barycenter*e.weight,r+=e.weight);t.vs=e.vs.concat(t.vs),t.barycenter=n/r,t.weight=r,t.i=Math.min(e.i,t.i),e.merged=!0}(t,e)}}function i(e){return function(n){n.in.push(e),0==--n.indegree&&t.push(n)}}for(;t.length;){var a=t.pop();e.push(a),r.forEach(a.in.reverse(),n(a)),r.forEach(a.out,i(a))}return r.map(r.filter(e,(function(t){return!t.merged})),(function(t){return r.pick(t,["vs","i","barycenter","weight"])}))}(r.filter(n,(function(t){return!t.indegree})))}},function(t,e,n){var r=n(4),i=n(10);function a(t,e,n){for(var i;e.length&&(i=r.last(e)).i<=n;)e.pop(),t.push(i.vs),n++;return n}t.exports=function(t,e){var n=i.partition(t,(function(t){return r.has(t,"barycenter")})),o=n.lhs,s=r.sortBy(n.rhs,(function(t){return-t.i})),u=[],c=0,f=0,l=0;o.sort((h=!!e,function(t,e){return t.barycenter<e.barycenter?-1:t.barycenter>e.barycenter?1:h?e.i-t.i:t.i-e.i})),l=a(u,s,l),r.forEach(o,(function(t){l+=t.vs.length,u.push(t.vs),c+=t.barycenter*t.weight,f+=t.weight,l=a(u,s,l)}));var h;var d={vs:r.flatten(u,!0)};f&&(d.barycenter=c/f,d.weight=f);return d}},function(t,e,n){var r=n(4),i=n(19).Graph;t.exports=function(t,e,n){var a=function(t){var e;for(;t.hasNode(e=r.uniqueId("_root")););return e}(t),o=new i({compound:!0}).setGraph({root:a}).setDefaultNodeLabel((function(e){return t.node(e)}));return r.forEach(t.nodes(),(function(i){var s=t.node(i),u=t.parent(i);(s.rank===e||s.minRank<=e&&e<=s.maxRank)&&(o.setNode(i),o.setParent(i,u||a),r.forEach(t[n](i),(function(e){var n=e.v===i?e.w:e.v,a=o.edge(n,i),s=r.isUndefined(a)?0:a.weight;o.setEdge(n,i,{weight:t.edge(e).weight+s})})),r.has(s,"minRank")&&o.setNode(i,{borderLeft:s.borderLeft[e],borderRight:s.borderRight[e]}))})),o}},function(t,e,n){var r=n(4);t.exports=function(t,e,n){var i,a={};r.forEach(n,(function(n){for(var r,o,s=t.parent(n);s;){if((r=t.parent(s))?(o=a[r],a[r]=s):(o=i,i=s),o&&o!==s)return void e.setEdge(o,s);s=r}}))}},function(t,e,n){"use strict";var r=n(4),i=n(10),a=n(402).positionX;t.exports=function(t){(function(t){var e=i.buildLayerMatrix(t),n=t.graph().ranksep,a=0;r.forEach(e,(function(e){var i=r.max(r.map(e,(function(e){return t.node(e).height})));r.forEach(e,(function(e){t.node(e).y=a+i/2})),a+=i+n}))})(t=i.asNonCompoundGraph(t)),r.forEach(a(t),(function(e,n){t.node(n).x=e}))}},function(t,e,n){"use strict";var r=n(4),i=n(19).Graph,a=n(10);function o(t,e){var n={};return r.reduce(e,(function(e,i){var a=0,o=0,s=e.length,c=r.last(i);return r.forEach(i,(function(e,f){var l=function(t,e){if(t.node(e).dummy)return r.find(t.predecessors(e),(function(e){return t.node(e).dummy}))}(t,e),h=l?t.node(l).order:s;(l||e===c)&&(r.forEach(i.slice(o,f+1),(function(e){r.forEach(t.predecessors(e),(function(r){var i=t.node(r),o=i.order;!(o<a||h<o)||i.dummy&&t.node(e).dummy||u(n,r,e)}))})),o=f+1,a=h)})),i})),n}function s(t,e){var n={};function i(e,i,a,o,s){var c;r.forEach(r.range(i,a),(function(i){c=e[i],t.node(c).dummy&&r.forEach(t.predecessors(c),(function(e){var r=t.node(e);r.dummy&&(r.order<o||r.order>s)&&u(n,e,c)}))}))}return r.reduce(e,(function(e,n){var a,o=-1,s=0;return r.forEach(n,(function(r,u){if("border"===t.node(r).dummy){var c=t.predecessors(r);c.length&&(a=t.node(c[0]).order,i(n,s,u,o,a),s=u,o=a)}i(n,s,n.length,a,e.length)})),n})),n}function u(t,e,n){if(e>n){var r=e;e=n,n=r}var i=t[e];i||(t[e]=i={}),i[n]=!0}function c(t,e,n){if(e>n){var i=e;e=n,n=i}return r.has(t[e],n)}function f(t,e,n,i){var a={},o={},s={};return r.forEach(e,(function(t){r.forEach(t,(function(t,e){a[t]=t,o[t]=t,s[t]=e}))})),r.forEach(e,(function(t){var e=-1;r.forEach(t,(function(t){var u=i(t);if(u.length)for(var f=((u=r.sortBy(u,(function(t){return s[t]}))).length-1)/2,l=Math.floor(f),h=Math.ceil(f);l<=h;++l){var d=u[l];o[t]===t&&e<s[d]&&!c(n,t,d)&&(o[d]=t,o[t]=a[t]=a[d],e=s[d])}}))})),{root:a,align:o}}function l(t,e,n,a,o){var s={},u=function(t,e,n,a){var o=new i,s=t.graph(),u=function(t,e,n){return function(i,a,o){var s,u=i.node(a),c=i.node(o),f=0;if(f+=u.width/2,r.has(u,"labelpos"))switch(u.labelpos.toLowerCase()){case"l":s=-u.width/2;break;case"r":s=u.width/2}if(s&&(f+=n?s:-s),s=0,f+=(u.dummy?e:t)/2,f+=(c.dummy?e:t)/2,f+=c.width/2,r.has(c,"labelpos"))switch(c.labelpos.toLowerCase()){case"l":s=c.width/2;break;case"r":s=-c.width/2}return s&&(f+=n?s:-s),s=0,f}}(s.nodesep,s.edgesep,a);return r.forEach(e,(function(e){var i;r.forEach(e,(function(e){var r=n[e];if(o.setNode(r),i){var a=n[i],s=o.edge(a,r);o.setEdge(a,r,Math.max(u(t,e,i),s||0))}i=e}))})),o}(t,e,n,o),c=o?"borderLeft":"borderRight";function f(t,e){for(var n=u.nodes(),r=n.pop(),i={};r;)i[r]?t(r):(i[r]=!0,n.push(r),n=n.concat(e(r))),r=n.pop()}return f((function(t){s[t]=u.inEdges(t).reduce((function(t,e){return Math.max(t,s[e.v]+u.edge(e))}),0)}),u.predecessors.bind(u)),f((function(e){var n=u.outEdges(e).reduce((function(t,e){return Math.min(t,s[e.w]-u.edge(e))}),Number.POSITIVE_INFINITY),r=t.node(e);n!==Number.POSITIVE_INFINITY&&r.borderType!==c&&(s[e]=Math.max(s[e],n))}),u.successors.bind(u)),r.forEach(a,(function(t){s[t]=s[n[t]]})),s}function h(t,e){return r.minBy(r.values(e),(function(e){var n=Number.NEGATIVE_INFINITY,i=Number.POSITIVE_INFINITY;return r.forIn(e,(function(e,r){var a=function(t,e){return t.node(e).width}(t,r)/2;n=Math.max(e+a,n),i=Math.min(e-a,i)})),n-i}))}function d(t,e){var n=r.values(e),i=r.min(n),a=r.max(n);r.forEach(["u","d"],(function(n){r.forEach(["l","r"],(function(o){var s,u=n+o,c=t[u];if(c!==e){var f=r.values(c);(s="l"===o?i-r.min(f):a-r.max(f))&&(t[u]=r.mapValues(c,(function(t){return t+s})))}}))}))}function p(t,e){return r.mapValues(t.ul,(function(n,i){if(e)return t[e.toLowerCase()][i];var a=r.sortBy(r.map(t,i));return(a[1]+a[2])/2}))}t.exports={positionX:function(t){var e,n=a.buildLayerMatrix(t),i=r.merge(o(t,n),s(t,n)),u={};r.forEach(["u","d"],(function(a){e="u"===a?n:r.values(n).reverse(),r.forEach(["l","r"],(function(n){"r"===n&&(e=r.map(e,(function(t){return r.values(t).reverse()})));var o=("u"===a?t.predecessors:t.successors).bind(t),s=f(t,e,i,o),c=l(t,e,s.root,s.align,"r"===n);"r"===n&&(c=r.mapValues(c,(function(t){return-t}))),u[a+n]=c}))}));var c=h(t,u);return d(u,c),p(u,t.graph().align)},findType1Conflicts:o,findType2Conflicts:s,addConflict:u,hasConflict:c,verticalAlignment:f,horizontalCompaction:l,alignCoordinates:d,findSmallestWidthAlignment:h,balance:p}},function(t,e,n){var r=n(4),i=n(10),a=n(19).Graph;t.exports={debugOrdering:function(t){var e=i.buildLayerMatrix(t),n=new a({compound:!0,multigraph:!0}).setGraph({});return r.forEach(t.nodes(),(function(e){n.setNode(e,{label:e}),n.setParent(e,"layer"+t.node(e).rank)})),r.forEach(t.edges(),(function(t){n.setEdge(t.v,t.w,{},t.name)})),r.forEach(e,(function(t,e){var i="layer"+e;n.setNode(i,{rank:"same"}),r.reduce(t,(function(t,e){return n.setEdge(t,e,{style:"invis"}),e}))})),n}}},function(t,e){t.exports="0.8.5"},function(t,e,n){t.exports={node:n(187),circle:n(188),ellipse:n(109),polygon:n(189),rect:n(190)}},function(t,e){function n(t,e){return t*e>0}t.exports=function(t,e,r,i){var a,o,s,u,c,f,l,h,d,p,g,y,b;if(a=e.y-t.y,s=t.x-e.x,c=e.x*t.y-t.x*e.y,d=a*r.x+s*r.y+c,p=a*i.x+s*i.y+c,0!==d&&0!==p&&n(d,p))return;if(o=i.y-r.y,u=r.x-i.x,f=i.x*r.y-r.x*i.y,l=o*t.x+u*t.y+f,h=o*e.x+u*e.y+f,0!==l&&0!==h&&n(l,h))return;if(0===(g=a*u-o*s))return;return y=Math.abs(g/2),{x:(b=s*f-u*c)<0?(b-y)/g:(b+y)/g,y:(b=o*c-a*f)<0?(b-y)/g:(b+y)/g}}},function(t,e,n){var r=n(43),i=n(30),a=n(175).layout;t.exports=function(){var t=n(408),e=n(411),i=n(412),c=n(413),f=n(414),l=n(415),h=n(416),d=n(417),p=n(418),g=function(n,g){!function(t){t.nodes().forEach((function(e){var n=t.node(e);r.has(n,"label")||t.children(e).length||(n.label=e),r.has(n,"paddingX")&&r.defaults(n,{paddingLeft:n.paddingX,paddingRight:n.paddingX}),r.has(n,"paddingY")&&r.defaults(n,{paddingTop:n.paddingY,paddingBottom:n.paddingY}),r.has(n,"padding")&&r.defaults(n,{paddingLeft:n.padding,paddingRight:n.padding,paddingTop:n.padding,paddingBottom:n.padding}),r.defaults(n,o),r.each(["paddingLeft","paddingRight","paddingTop","paddingBottom"],(function(t){n[t]=Number(n[t])})),r.has(n,"width")&&(n._prevWidth=n.width),r.has(n,"height")&&(n._prevHeight=n.height)})),t.edges().forEach((function(e){var n=t.edge(e);r.has(n,"label")||(n.label=""),r.defaults(n,s)}))}(g);var y=u(n,"output"),b=u(y,"clusters"),v=u(y,"edgePaths"),m=i(u(y,"edgeLabels"),g),_=t(u(y,"nodes"),g,d);a(g),f(_,g),l(m,g),c(v,g,p);var w=e(b,g);h(w,g),function(t){r.each(t.nodes(),(function(e){var n=t.node(e);r.has(n,"_prevWidth")?n.width=n._prevWidth:delete n.width,r.has(n,"_prevHeight")?n.height=n._prevHeight:delete n.height,delete n._prevWidth,delete n._prevHeight}))}(g)};return g.createNodes=function(e){return arguments.length?(t=e,g):t},g.createClusters=function(t){return arguments.length?(e=t,g):e},g.createEdgeLabels=function(t){return arguments.length?(i=t,g):i},g.createEdgePaths=function(t){return arguments.length?(c=t,g):c},g.shapes=function(t){return arguments.length?(d=t,g):d},g.arrows=function(t){return arguments.length?(p=t,g):p},g};var o={paddingLeft:10,paddingRight:10,paddingTop:10,paddingBottom:10,rx:0,ry:0,shape:"rect"},s={arrowhead:"normal",curve:i.curveLinear};function u(t,e){var n=t.select("g."+e);return n.empty()&&(n=t.append("g").attr("class",e)),n}},function(t,e,n){"use strict";var r=n(43),i=n(110),a=n(15),o=n(30);t.exports=function(t,e,n){var s,u=e.nodes().filter((function(t){return!a.isSubgraph(e,t)})),c=t.selectAll("g.node").data(u,(function(t){return t})).classed("update",!0);c.exit().remove(),c.enter().append("g").attr("class","node").style("opacity",0),(c=t.selectAll("g.node")).each((function(t){var s=e.node(t),u=o.select(this);a.applyClass(u,s.class,(u.classed("update")?"update ":"")+"node"),u.select("g.label").remove();var c=u.append("g").attr("class","label"),f=i(c,s),l=n[s.shape],h=r.pick(f.node().getBBox(),"width","height");s.elem=this,s.id&&u.attr("id",s.id),s.labelId&&c.attr("id",s.labelId),r.has(s,"width")&&(h.width=s.width),r.has(s,"height")&&(h.height=s.height),h.width+=s.paddingLeft+s.paddingRight,h.height+=s.paddingTop+s.paddingBottom,c.attr("transform","translate("+(s.paddingLeft-s.paddingRight)/2+","+(s.paddingTop-s.paddingBottom)/2+")");var d=o.select(this);d.select(".label-container").remove();var p=l(d,h,s).classed("label-container",!0);a.applyStyle(p,s.style);var g=p.node().getBBox();s.width=g.width,s.height=g.height})),s=c.exit?c.exit():c.selectAll(null);return a.applyTransition(s,e).style("opacity",0).remove(),c}},function(t,e,n){var r=n(15);t.exports=function(t,e){for(var n=t.append("text"),i=function(t){for(var e,n="",r=!1,i=0;i<t.length;++i)if(e=t[i],r){switch(e){case"n":n+="\n";break;default:n+=e}r=!1}else"\\"===e?r=!0:n+=e;return n}(e.label).split("\n"),a=0;a<i.length;a++)n.append("tspan").attr("xml:space","preserve").attr("dy","1em").attr("x","1").text(i[a]);return r.applyStyle(n,e.labelStyle),n}},function(t,e,n){var r=n(15);t.exports=function(t,e){var n=t;return n.node().appendChild(e.label),r.applyStyle(n,e.labelStyle),n}},function(t,e,n){var r=n(15),i=n(30),a=n(110);t.exports=function(t,e){var n,o=e.nodes().filter((function(t){return r.isSubgraph(e,t)})),s=t.selectAll("g.cluster").data(o,(function(t){return t}));s.selectAll("*").remove(),s.enter().append("g").attr("class","cluster").attr("id",(function(t){return e.node(t).id})).style("opacity",0),s=t.selectAll("g.cluster"),r.applyTransition(s,e).style("opacity",1),s.each((function(t){var n=e.node(t),r=i.select(this);i.select(this).append("rect");var o=r.append("g").attr("class","label");a(o,n,n.clusterLabelPos)})),s.selectAll("rect").each((function(t){var n=e.node(t),a=i.select(this);r.applyStyle(a,n.style)})),n=s.exit?s.exit():s.selectAll(null);return r.applyTransition(n,e).style("opacity",0).remove(),s}},function(t,e,n){"use strict";var r=n(43),i=n(110),a=n(15),o=n(30);t.exports=function(t,e){var n,s=t.selectAll("g.edgeLabel").data(e.edges(),(function(t){return a.edgeToId(t)})).classed("update",!0);s.exit().remove(),s.enter().append("g").classed("edgeLabel",!0).style("opacity",0),(s=t.selectAll("g.edgeLabel")).each((function(t){var n=o.select(this);n.select(".label").remove();var a=e.edge(t),s=i(n,e.edge(t),0,0).classed("label",!0),u=s.node().getBBox();a.labelId&&s.attr("id",a.labelId),r.has(a,"width")||(a.width=u.width),r.has(a,"height")||(a.height=u.height)})),n=s.exit?s.exit():s.selectAll(null);return a.applyTransition(n,e).style("opacity",0).remove(),s}},function(t,e,n){"use strict";var r=n(43),i=n(187),a=n(15),o=n(30);function s(t,e){var n=(o.line||o.svg.line)().x((function(t){return t.x})).y((function(t){return t.y}));return(n.curve||n.interpolate)(t.curve),n(e)}t.exports=function(t,e,n){var u=t.selectAll("g.edgePath").data(e.edges(),(function(t){return a.edgeToId(t)})).classed("update",!0),c=function(t,e){var n=t.enter().append("g").attr("class","edgePath").style("opacity",0);return n.append("path").attr("class","path").attr("d",(function(t){var n=e.edge(t),i=e.node(t.v).elem;return s(n,r.range(n.points.length).map((function(){return e=(t=i).getBBox(),{x:(n=t.ownerSVGElement.getScreenCTM().inverse().multiply(t.getScreenCTM()).translate(e.width/2,e.height/2)).e,y:n.f};var t,e,n})))})),n.append("defs"),n}(u,e);!function(t,e){var n=t.exit();a.applyTransition(n,e).style("opacity",0).remove()}(u,e);var f=void 0!==u.merge?u.merge(c):u;return a.applyTransition(f,e).style("opacity",1),f.each((function(t){var n=o.select(this),r=e.edge(t);r.elem=this,r.id&&n.attr("id",r.id),a.applyClass(n,r.class,(n.classed("update")?"update ":"")+"edgePath")})),f.selectAll("path.path").each((function(t){var n=e.edge(t);n.arrowheadId=r.uniqueId("arrowhead");var u=o.select(this).attr("marker-end",(function(){return"url("+(t=location.href,e=n.arrowheadId,t.split("#")[0]+"#"+e)+")";var t,e})).style("fill","none");a.applyTransition(u,e).attr("d",(function(t){return function(t,e){var n=t.edge(e),r=t.node(e.v),a=t.node(e.w),o=n.points.slice(1,n.points.length-1);return o.unshift(i(r,o[0])),o.push(i(a,o[o.length-1])),s(n,o)}(e,t)})),a.applyStyle(u,n.style)})),f.selectAll("defs *").remove(),f.selectAll("defs").each((function(t){var r=e.edge(t);(0,n[r.arrowhead])(o.select(this),r.arrowheadId,r,"arrowhead")})),f}},function(t,e,n){"use strict";var r=n(15),i=n(30);t.exports=function(t,e){function n(t){var n=e.node(t);return"translate("+n.x+","+n.y+")"}t.filter((function(){return!i.select(this).classed("update")})).attr("transform",n),r.applyTransition(t,e).style("opacity",1).attr("transform",n)}},function(t,e,n){"use strict";var r=n(15),i=n(30),a=n(43);t.exports=function(t,e){function n(t){var n=e.edge(t);return a.has(n,"x")?"translate("+n.x+","+n.y+")":""}t.filter((function(){return!i.select(this).classed("update")})).attr("transform",n),r.applyTransition(t,e).style("opacity",1).attr("transform",n)}},function(t,e,n){"use strict";var r=n(15),i=n(30);t.exports=function(t,e){var n=t.filter((function(){return!i.select(this).classed("update")}));function a(t){var n=e.node(t);return"translate("+n.x+","+n.y+")"}n.attr("transform",a),r.applyTransition(t,e).style("opacity",1).attr("transform",a),r.applyTransition(n.selectAll("rect"),e).attr("width",(function(t){return e.node(t).width})).attr("height",(function(t){return e.node(t).height})).attr("x",(function(t){return-e.node(t).width/2})).attr("y",(function(t){return-e.node(t).height/2}))}},function(t,e,n){"use strict";var r=n(190),i=n(109),a=n(188),o=n(189);t.exports={rect:function(t,e,n){var i=t.insert("rect",":first-child").attr("rx",n.rx).attr("ry",n.ry).attr("x",-e.width/2).attr("y",-e.height/2).attr("width",e.width).attr("height",e.height);return n.intersect=function(t){return r(n,t)},i},ellipse:function(t,e,n){var r=e.width/2,a=e.height/2,o=t.insert("ellipse",":first-child").attr("x",-e.width/2).attr("y",-e.height/2).attr("rx",r).attr("ry",a);return n.intersect=function(t){return i(n,r,a,t)},o},circle:function(t,e,n){var r=Math.max(e.width,e.height)/2,i=t.insert("circle",":first-child").attr("x",-e.width/2).attr("y",-e.height/2).attr("r",r);return n.intersect=function(t){return a(n,r,t)},i},diamond:function(t,e,n){var r=e.width*Math.SQRT2/2,i=e.height*Math.SQRT2/2,a=[{x:0,y:-i},{x:-r,y:0},{x:0,y:i},{x:r,y:0}],s=t.insert("polygon",":first-child").attr("points",a.map((function(t){return t.x+","+t.y})).join(" "));return n.intersect=function(t){return o(n,a,t)},s}}},function(t,e,n){var r=n(15);function i(t,e,n,i){var a=t.append("marker").attr("id",e).attr("viewBox","0 0 10 10").attr("refX",9).attr("refY",5).attr("markerUnits","strokeWidth").attr("markerWidth",8).attr("markerHeight",6).attr("orient","auto").append("path").attr("d","M 0 0 L 10 5 L 0 10 z").style("stroke-width",1).style("stroke-dasharray","1,0");r.applyStyle(a,n[i+"Style"]),n[i+"Class"]&&a.attr("class",n[i+"Class"])}t.exports={default:i,normal:i,vee:function(t,e,n,i){var a=t.append("marker").attr("id",e).attr("viewBox","0 0 10 10").attr("refX",9).attr("refY",5).attr("markerUnits","strokeWidth").attr("markerWidth",8).attr("markerHeight",6).attr("orient","auto").append("path").attr("d","M 0 0 L 10 5 L 0 10 L 4 5 z").style("stroke-width",1).style("stroke-dasharray","1,0");r.applyStyle(a,n[i+"Style"]),n[i+"Class"]&&a.attr("class",n[i+"Class"])},undirected:function(t,e,n,i){var a=t.append("marker").attr("id",e).attr("viewBox","0 0 10 10").attr("refX",9).attr("refY",5).attr("markerUnits","strokeWidth").attr("markerWidth",8).attr("markerHeight",6).attr("orient","auto").append("path").attr("d","M 0 5 L 10 5").style("stroke-width",1).style("stroke-dasharray","1,0");r.applyStyle(a,n[i+"Style"]),n[i+"Class"]&&a.attr("class",n[i+"Class"])}}},function(t,e){t.exports="0.6.4"},function(t,e,n){"use strict";e.randomBytes=e.rng=e.pseudoRandomBytes=e.prng=n(44),e.createHash=e.Hash=n(53),e.createHmac=e.Hmac=n(199);var r=n(439),i=Object.keys(r),a=["sha1","sha224","sha256","sha384","sha512","md5","rmd160"].concat(i);e.getHashes=function(){return a};var o=n(202);e.pbkdf2=o.pbkdf2,e.pbkdf2Sync=o.pbkdf2Sync;var s=n(441);e.Cipher=s.Cipher,e.createCipher=s.createCipher,e.Cipheriv=s.Cipheriv,e.createCipheriv=s.createCipheriv,e.Decipher=s.Decipher,e.createDecipher=s.createDecipher,e.Decipheriv=s.Decipheriv,e.createDecipheriv=s.createDecipheriv,e.getCiphers=s.getCiphers,e.listCiphers=s.listCiphers;var u=n(456);e.DiffieHellmanGroup=u.DiffieHellmanGroup,e.createDiffieHellmanGroup=u.createDiffieHellmanGroup,e.getDiffieHellman=u.getDiffieHellman,e.createDiffieHellman=u.createDiffieHellman,e.DiffieHellman=u.DiffieHellman;var c=n(461);e.createSign=c.createSign,e.Sign=c.Sign,e.createVerify=c.createVerify,e.Verify=c.Verify,e.createECDH=n(495);var f=n(496);e.publicEncrypt=f.publicEncrypt,e.privateEncrypt=f.privateEncrypt,e.publicDecrypt=f.publicDecrypt,e.privateDecrypt=f.privateDecrypt;var l=n(499);e.randomFill=l.randomFill,e.randomFillSync=l.randomFillSync,e.createCredentials=function(){throw new Error(["sorry, createCredentials is not implemented yet","we accept pull requests","https://github.com/crypto-browserify/crypto-browserify"].join("\n"))},e.constants={DH_CHECK_P_NOT_SAFE_PRIME:2,DH_CHECK_P_NOT_PRIME:1,DH_UNABLE_TO_CHECK_GENERATOR:4,DH_NOT_SUITABLE_GENERATOR:8,NPN_ENABLED:1,ALPN_ENABLED:1,RSA_PKCS1_PADDING:1,RSA_SSLV23_PADDING:2,RSA_NO_PADDING:3,RSA_PKCS1_OAEP_PADDING:4,RSA_X931_PADDING:5,RSA_PKCS1_PSS_PADDING:6,POINT_CONVERSION_COMPRESSED:2,POINT_CONVERSION_UNCOMPRESSED:4,POINT_CONVERSION_HYBRID:6}},function(t,e,n){"use strict";e.byteLength=function(t){var e=c(t),n=e[0],r=e[1];return 3*(n+r)/4-r},e.toByteArray=function(t){var e,n,r=c(t),o=r[0],s=r[1],u=new a(function(t,e,n){return 3*(e+n)/4-n}(0,o,s)),f=0,l=s>0?o-4:o;for(n=0;n<l;n+=4)e=i[t.charCodeAt(n)]<<18|i[t.charCodeAt(n+1)]<<12|i[t.charCodeAt(n+2)]<<6|i[t.charCodeAt(n+3)],u[f++]=e>>16&255,u[f++]=e>>8&255,u[f++]=255&e;2===s&&(e=i[t.charCodeAt(n)]<<2|i[t.charCodeAt(n+1)]>>4,u[f++]=255&e);1===s&&(e=i[t.charCodeAt(n)]<<10|i[t.charCodeAt(n+1)]<<4|i[t.charCodeAt(n+2)]>>2,u[f++]=e>>8&255,u[f++]=255&e);return u},e.fromByteArray=function(t){for(var e,n=t.length,i=n%3,a=[],o=0,s=n-i;o<s;o+=16383)a.push(f(t,o,o+16383>s?s:o+16383));1===i?(e=t[n-1],a.push(r[e>>2]+r[e<<4&63]+"==")):2===i&&(e=(t[n-2]<<8)+t[n-1],a.push(r[e>>10]+r[e>>4&63]+r[e<<2&63]+"="));return a.join("")};for(var r=[],i=[],a="undefined"!=typeof Uint8Array?Uint8Array:Array,o="ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/",s=0,u=o.length;s<u;++s)r[s]=o[s],i[o.charCodeAt(s)]=s;function c(t){var e=t.length;if(e%4>0)throw new Error("Invalid string. Length must be a multiple of 4");var n=t.indexOf("=");return-1===n&&(n=e),[n,n===e?0:4-n%4]}function f(t,e,n){for(var i,a,o=[],s=e;s<n;s+=3)i=(t[s]<<16&16711680)+(t[s+1]<<8&65280)+(255&t[s+2]),o.push(r[(a=i)>>18&63]+r[a>>12&63]+r[a>>6&63]+r[63&a]);return o.join("")}i["-".charCodeAt(0)]=62,i["_".charCodeAt(0)]=63},function(t,e){e.read=function(t,e,n,r,i){var a,o,s=8*i-r-1,u=(1<<s)-1,c=u>>1,f=-7,l=n?i-1:0,h=n?-1:1,d=t[e+l];for(l+=h,a=d&(1<<-f)-1,d>>=-f,f+=s;f>0;a=256*a+t[e+l],l+=h,f-=8);for(o=a&(1<<-f)-1,a>>=-f,f+=r;f>0;o=256*o+t[e+l],l+=h,f-=8);if(0===a)a=1-c;else{if(a===u)return o?NaN:1/0*(d?-1:1);o+=Math.pow(2,r),a-=c}return(d?-1:1)*o*Math.pow(2,a-r)},e.write=function(t,e,n,r,i,a){var o,s,u,c=8*a-i-1,f=(1<<c)-1,l=f>>1,h=23===i?Math.pow(2,-24)-Math.pow(2,-77):0,d=r?0:a-1,p=r?1:-1,g=e<0||0===e&&1/e<0?1:0;for(e=Math.abs(e),isNaN(e)||e===1/0?(s=isNaN(e)?1:0,o=f):(o=Math.floor(Math.log(e)/Math.LN2),e*(u=Math.pow(2,-o))<1&&(o--,u*=2),(e+=o+l>=1?h/u:h*Math.pow(2,1-l))*u>=2&&(o++,u/=2),o+l>=f?(s=0,o=f):o+l>=1?(s=(e*u-1)*Math.pow(2,i),o+=l):(s=e*Math.pow(2,l-1)*Math.pow(2,i),o=0));i>=8;t[n+d]=255&s,d+=p,s/=256,i-=8);for(o=o<<i|s,c+=i;c>0;t[n+d]=255&o,d+=p,o/=256,c-=8);t[n+d-p]|=128*g}},function(t,e){},function(t,e,n){"use strict";var r=n(115).Buffer,i=n(425);t.exports=function(){function t(){!function(t,e){if(!(t instanceof e))throw new TypeError("Cannot call a class as a function")}(this,t),this.head=null,this.tail=null,this.length=0}return t.prototype.push=function(t){var e={data:t,next:null};this.length>0?this.tail.next=e:this.head=e,this.tail=e,++this.length},t.prototype.unshift=function(t){var e={data:t,next:this.head};0===this.length&&(this.tail=e),this.head=e,++this.length},t.prototype.shift=function(){if(0!==this.length){var t=this.head.data;return 1===this.length?this.head=this.tail=null:this.head=this.head.next,--this.length,t}},t.prototype.clear=function(){this.head=this.tail=null,this.length=0},t.prototype.join=function(t){if(0===this.length)return"";for(var e=this.head,n=""+e.data;e=e.next;)n+=t+e.data;return n},t.prototype.concat=function(t){if(0===this.length)return r.alloc(0);if(1===this.length)return this.head.data;for(var e,n,i,a=r.allocUnsafe(t>>>0),o=this.head,s=0;o;)e=o.data,n=a,i=s,e.copy(n,i),s+=o.data.length,o=o.next;return a},t}(),i&&i.inspect&&i.inspect.custom&&(t.exports.prototype[i.inspect.custom]=function(){var t=i.inspect({length:this.length});return this.constructor.name+" "+t})},function(t,e){},function(t,e,n){(function(t){var r=void 0!==t&&t||"undefined"!=typeof self&&self||window,i=Function.prototype.apply;function a(t,e){this._id=t,this._clearFn=e}e.setTimeout=function(){return new a(i.call(setTimeout,r,arguments),clearTimeout)},e.setInterval=function(){return new a(i.call(setInterval,r,arguments),clearInterval)},e.clearTimeout=e.clearInterval=function(t){t&&t.close()},a.prototype.unref=a.prototype.ref=function(){},a.prototype.close=function(){this._clearFn.call(r,this._id)},e.enroll=function(t,e){clearTimeout(t._idleTimeoutId),t._idleTimeout=e},e.unenroll=function(t){clearTimeout(t._idleTimeoutId),t._idleTimeout=-1},e._unrefActive=e.active=function(t){clearTimeout(t._idleTimeoutId);var e=t._idleTimeout;e>=0&&(t._idleTimeoutId=setTimeout((function(){t._onTimeout&&t._onTimeout()}),e))},n(427),e.setImmediate="undefined"!=typeof self&&self.setImmediate||void 0!==t&&t.setImmediate||this&&this.setImmediate,e.clearImmediate="undefined"!=typeof self&&self.clearImmediate||void 0!==t&&t.clearImmediate||this&&this.clearImmediate}).call(this,n(12))},function(t,e,n){(function(t,e){!function(t,n){"use strict";if(!t.setImmediate){var r,i,a,o,s,u=1,c={},f=!1,l=t.document,h=Object.getPrototypeOf&&Object.getPrototypeOf(t);h=h&&h.setTimeout?h:t,"[object process]"==={}.toString.call(t.process)?r=function(t){e.nextTick((function(){p(t)}))}:!function(){if(t.postMessage&&!t.importScripts){var e=!0,n=t.onmessage;return t.onmessage=function(){e=!1},t.postMessage("","*"),t.onmessage=n,e}}()?t.MessageChannel?((a=new MessageChannel).port1.onmessage=function(t){p(t.data)},r=function(t){a.port2.postMessage(t)}):l&&"onreadystatechange"in l.createElement("script")?(i=l.documentElement,r=function(t){var e=l.createElement("script");e.onreadystatechange=function(){p(t),e.onreadystatechange=null,i.removeChild(e),e=null},i.appendChild(e)}):r=function(t){setTimeout(p,0,t)}:(o="setImmediate$"+Math.random()+"$",s=function(e){e.source===t&&"string"==typeof e.data&&0===e.data.indexOf(o)&&p(+e.data.slice(o.length))},t.addEventListener?t.addEventListener("message",s,!1):t.attachEvent("onmessage",s),r=function(e){t.postMessage(o+e,"*")}),h.setImmediate=function(t){"function"!=typeof t&&(t=new Function(""+t));for(var e=new Array(arguments.length-1),n=0;n<e.length;n++)e[n]=arguments[n+1];var i={callback:t,args:e};return c[u]=i,r(u),u++},h.clearImmediate=d}function d(t){delete c[t]}function p(t){if(f)setTimeout(p,0,t);else{var e=c[t];if(e){f=!0;try{!function(t){var e=t.callback,n=t.args;switch(n.length){case 0:e();break;case 1:e(n[0]);break;case 2:e(n[0],n[1]);break;case 3:e(n[0],n[1],n[2]);break;default:e.apply(void 0,n)}}(e)}finally{d(t),f=!1}}}}}("undefined"==typeof self?void 0===t?this:t:self)}).call(this,n(12),n(7))},function(t,e,n){(function(e){function n(t){try{if(!e.localStorage)return!1}catch(t){return!1}var n=e.localStorage[t];return null!=n&&"true"===String(n).toLowerCase()}t.exports=function(t,e){if(n("noDeprecation"))return t;var r=!1;return function(){if(!r){if(n("throwDeprecation"))throw new Error(e);n("traceDeprecation")?console.trace(e):console.warn(e),r=!0}return t.apply(this,arguments)}}}).call(this,n(12))},function(t,e,n){"use strict";t.exports=a;var r=n(196),i=Object.create(n(54));function a(t){if(!(this instanceof a))return new a(t);r.call(this,t)}i.inherits=n(2),i.inherits(a,r),a.prototype._transform=function(t,e,n){n(null,t)}},function(t,e,n){t.exports=n(116)},function(t,e,n){t.exports=n(35)},function(t,e,n){t.exports=n(114).Transform},function(t,e,n){t.exports=n(114).PassThrough},function(t,e,n){var r=n(2),i=n(45),a=n(3).Buffer,o=[1518500249,1859775393,-1894007588,-899497514],s=new Array(80);function u(){this.init(),this._w=s,i.call(this,64,56)}function c(t){return t<<30|t>>>2}function f(t,e,n,r){return 0===t?e&n|~e&r:2===t?e&n|e&r|n&r:e^n^r}r(u,i),u.prototype.init=function(){return this._a=1732584193,this._b=4023233417,this._c=2562383102,this._d=271733878,this._e=3285377520,this},u.prototype._update=function(t){for(var e,n=this._w,r=0|this._a,i=0|this._b,a=0|this._c,s=0|this._d,u=0|this._e,l=0;l<16;++l)n[l]=t.readInt32BE(4*l);for(;l<80;++l)n[l]=n[l-3]^n[l-8]^n[l-14]^n[l-16];for(var h=0;h<80;++h){var d=~~(h/20),p=0|((e=r)<<5|e>>>27)+f(d,i,a,s)+u+n[h]+o[d];u=s,s=a,a=c(i),i=r,r=p}this._a=r+this._a|0,this._b=i+this._b|0,this._c=a+this._c|0,this._d=s+this._d|0,this._e=u+this._e|0},u.prototype._hash=function(){var t=a.allocUnsafe(20);return t.writeInt32BE(0|this._a,0),t.writeInt32BE(0|this._b,4),t.writeInt32BE(0|this._c,8),t.writeInt32BE(0|this._d,12),t.writeInt32BE(0|this._e,16),t},t.exports=u},function(t,e,n){var r=n(2),i=n(45),a=n(3).Buffer,o=[1518500249,1859775393,-1894007588,-899497514],s=new Array(80);function u(){this.init(),this._w=s,i.call(this,64,56)}function c(t){return t<<5|t>>>27}function f(t){return t<<30|t>>>2}function l(t,e,n,r){return 0===t?e&n|~e&r:2===t?e&n|e&r|n&r:e^n^r}r(u,i),u.prototype.init=function(){return this._a=1732584193,this._b=4023233417,this._c=2562383102,this._d=271733878,this._e=3285377520,this},u.prototype._update=function(t){for(var e,n=this._w,r=0|this._a,i=0|this._b,a=0|this._c,s=0|this._d,u=0|this._e,h=0;h<16;++h)n[h]=t.readInt32BE(4*h);for(;h<80;++h)n[h]=(e=n[h-3]^n[h-8]^n[h-14]^n[h-16])<<1|e>>>31;for(var d=0;d<80;++d){var p=~~(d/20),g=c(r)+l(p,i,a,s)+u+n[d]+o[p]|0;u=s,s=a,a=f(i),i=r,r=g}this._a=r+this._a|0,this._b=i+this._b|0,this._c=a+this._c|0,this._d=s+this._d|0,this._e=u+this._e|0},u.prototype._hash=function(){var t=a.allocUnsafe(20);return t.writeInt32BE(0|this._a,0),t.writeInt32BE(0|this._b,4),t.writeInt32BE(0|this._c,8),t.writeInt32BE(0|this._d,12),t.writeInt32BE(0|this._e,16),t},t.exports=u},function(t,e,n){var r=n(2),i=n(197),a=n(45),o=n(3).Buffer,s=new Array(64);function u(){this.init(),this._w=s,a.call(this,64,56)}r(u,i),u.prototype.init=function(){return this._a=3238371032,this._b=914150663,this._c=812702999,this._d=4144912697,this._e=4290775857,this._f=1750603025,this._g=1694076839,this._h=3204075428,this},u.prototype._hash=function(){var t=o.allocUnsafe(28);return t.writeInt32BE(this._a,0),t.writeInt32BE(this._b,4),t.writeInt32BE(this._c,8),t.writeInt32BE(this._d,12),t.writeInt32BE(this._e,16),t.writeInt32BE(this._f,20),t.writeInt32BE(this._g,24),t},t.exports=u},function(t,e,n){var r=n(2),i=n(198),a=n(45),o=n(3).Buffer,s=new Array(160);function u(){this.init(),this._w=s,a.call(this,128,112)}r(u,i),u.prototype.init=function(){return this._ah=3418070365,this._bh=1654270250,this._ch=2438529370,this._dh=355462360,this._eh=1731405415,this._fh=2394180231,this._gh=3675008525,this._hh=1203062813,this._al=3238371032,this._bl=914150663,this._cl=812702999,this._dl=4144912697,this._el=4290775857,this._fl=1750603025,this._gl=1694076839,this._hl=3204075428,this},u.prototype._hash=function(){var t=o.allocUnsafe(48);function e(e,n,r){t.writeInt32BE(e,r),t.writeInt32BE(n,r+4)}return e(this._ah,this._al,0),e(this._bh,this._bl,8),e(this._ch,this._cl,16),e(this._dh,this._dl,24),e(this._eh,this._el,32),e(this._fh,this._fl,40),t},t.exports=u},function(t,e,n){"use strict";var r=n(2),i=n(3).Buffer,a=n(31),o=i.alloc(128);function s(t,e){a.call(this,"digest"),"string"==typeof e&&(e=i.from(e)),this._alg=t,this._key=e,e.length>64?e=t(e):e.length<64&&(e=i.concat([e,o],64));for(var n=this._ipad=i.allocUnsafe(64),r=this._opad=i.allocUnsafe(64),s=0;s<64;s++)n[s]=54^e[s],r[s]=92^e[s];this._hash=[n]}r(s,a),s.prototype._update=function(t){this._hash.push(t)},s.prototype._final=function(){var t=this._alg(i.concat(this._hash));return this._alg(i.concat([this._opad,t]))},t.exports=s},function(t,e,n){t.exports=n(201)},function(t,e,n){(function(e,r){var i,a=n(203),o=n(204),s=n(205),u=n(3).Buffer,c=e.crypto&&e.crypto.subtle,f={sha:"SHA-1","sha-1":"SHA-1",sha1:"SHA-1",sha256:"SHA-256","sha-256":"SHA-256",sha384:"SHA-384","sha-384":"SHA-384","sha-512":"SHA-512",sha512:"SHA-512"},l=[];function h(t,e,n,r,i){return c.importKey("raw",t,{name:"PBKDF2"},!1,["deriveBits"]).then((function(t){return c.deriveBits({name:"PBKDF2",salt:e,iterations:n,hash:{name:i}},t,r<<3)})).then((function(t){return u.from(t)}))}t.exports=function(t,n,d,p,g,y){"function"==typeof g&&(y=g,g=void 0);var b=f[(g=g||"sha1").toLowerCase()];if(!b||"function"!=typeof e.Promise)return r.nextTick((function(){var e;try{e=s(t,n,d,p,g)}catch(t){return y(t)}y(null,e)}));if(a(t,n,d,p),"function"!=typeof y)throw new Error("No callback provided to pbkdf2");u.isBuffer(t)||(t=u.from(t,o)),u.isBuffer(n)||(n=u.from(n,o)),function(t,e){t.then((function(t){r.nextTick((function(){e(null,t)}))}),(function(t){r.nextTick((function(){e(t)}))}))}(function(t){if(e.process&&!e.process.browser)return Promise.resolve(!1);if(!c||!c.importKey||!c.deriveBits)return Promise.resolve(!1);if(void 0!==l[t])return l[t];var n=h(i=i||u.alloc(8),i,10,128,t).then((function(){return!0})).catch((function(){return!1}));return l[t]=n,n}(b).then((function(e){return e?h(t,n,d,p,b):s(t,n,d,p,g)})),y)}}).call(this,n(12),n(7))},function(t,e,n){var r=n(442),i=n(121),a=n(122),o=n(455),s=n(80);function u(t,e,n){if(t=t.toLowerCase(),a[t])return i.createCipheriv(t,e,n);if(o[t])return new r({key:e,iv:n,mode:t});throw new TypeError("invalid suite type")}function c(t,e,n){if(t=t.toLowerCase(),a[t])return i.createDecipheriv(t,e,n);if(o[t])return new r({key:e,iv:n,mode:t,decrypt:!0});throw new TypeError("invalid suite type")}e.createCipher=e.Cipher=function(t,e){var n,r;if(t=t.toLowerCase(),a[t])n=a[t].key,r=a[t].iv;else{if(!o[t])throw new TypeError("invalid suite type");n=8*o[t].key,r=o[t].iv}var i=s(e,!1,n,r);return u(t,i.key,i.iv)},e.createCipheriv=e.Cipheriv=u,e.createDecipher=e.Decipher=function(t,e){var n,r;if(t=t.toLowerCase(),a[t])n=a[t].key,r=a[t].iv;else{if(!o[t])throw new TypeError("invalid suite type");n=8*o[t].key,r=o[t].iv}var i=s(e,!1,n,r);return c(t,i.key,i.iv)},e.createDecipheriv=e.Decipheriv=c,e.listCiphers=e.getCiphers=function(){return Object.keys(o).concat(i.getCiphers())}},function(t,e,n){var r=n(31),i=n(443),a=n(2),o=n(3).Buffer,s={"des-ede3-cbc":i.CBC.instantiate(i.EDE),"des-ede3":i.EDE,"des-ede-cbc":i.CBC.instantiate(i.EDE),"des-ede":i.EDE,"des-cbc":i.CBC.instantiate(i.DES),"des-ecb":i.DES};function u(t){r.call(this);var e,n=t.mode.toLowerCase(),i=s[n];e=t.decrypt?"decrypt":"encrypt";var a=t.key;o.isBuffer(a)||(a=o.from(a)),"des-ede"!==n&&"des-ede-cbc"!==n||(a=o.concat([a,a.slice(0,8)]));var u=t.iv;o.isBuffer(u)||(u=o.from(u)),this._des=i.create({key:a,iv:u,type:e})}s.des=s["des-cbc"],s.des3=s["des-ede3-cbc"],t.exports=u,a(u,r),u.prototype._update=function(t){return o.from(this._des.update(t))},u.prototype._final=function(){return o.from(this._des.final())}},function(t,e,n){"use strict";e.utils=n(206),e.Cipher=n(120),e.DES=n(207),e.CBC=n(444),e.EDE=n(445)},function(t,e,n){"use strict";var r=n(16),i=n(2),a={};function o(t){r.equal(t.length,8,"Invalid IV length"),this.iv=new Array(8);for(var e=0;e<this.iv.length;e++)this.iv[e]=t[e]}e.instantiate=function(t){function e(e){t.call(this,e),this._cbcInit()}i(e,t);for(var n=Object.keys(a),r=0;r<n.length;r++){var o=n[r];e.prototype[o]=a[o]}return e.create=function(t){return new e(t)},e},a._cbcInit=function(){var t=new o(this.options.iv);this._cbcState=t},a._update=function(t,e,n,r){var i=this._cbcState,a=this.constructor.super_.prototype,o=i.iv;if("encrypt"===this.type){for(var s=0;s<this.blockSize;s++)o[s]^=t[e+s];a._update.call(this,o,0,n,r);for(s=0;s<this.blockSize;s++)o[s]=n[r+s]}else{a._update.call(this,t,e,n,r);for(s=0;s<this.blockSize;s++)n[r+s]^=o[s];for(s=0;s<this.blockSize;s++)o[s]=t[e+s]}}},function(t,e,n){"use strict";var r=n(16),i=n(2),a=n(120),o=n(207);function s(t,e){r.equal(e.length,24,"Invalid key length");var n=e.slice(0,8),i=e.slice(8,16),a=e.slice(16,24);this.ciphers="encrypt"===t?[o.create({type:"encrypt",key:n}),o.create({type:"decrypt",key:i}),o.create({type:"encrypt",key:a})]:[o.create({type:"decrypt",key:a}),o.create({type:"encrypt",key:i}),o.create({type:"decrypt",key:n})]}function u(t){a.call(this,t);var e=new s(this.type,this.options.key);this._edeState=e}i(u,a),t.exports=u,u.create=function(t){return new u(t)},u.prototype._update=function(t,e,n,r){var i=this._edeState;i.ciphers[0]._update(t,e,n,r),i.ciphers[1]._update(n,r,n,r),i.ciphers[2]._update(n,r,n,r)},u.prototype._pad=o.prototype._pad,u.prototype._unpad=o.prototype._unpad},function(t,e,n){var r=n(122),i=n(211),a=n(3).Buffer,o=n(212),s=n(31),u=n(79),c=n(80);function f(t,e,n){s.call(this),this._cache=new h,this._cipher=new u.AES(e),this._prev=a.from(n),this._mode=t,this._autopadding=!0}n(2)(f,s),f.prototype._update=function(t){var e,n;this._cache.add(t);for(var r=[];e=this._cache.get();)n=this._mode.encrypt(this,e),r.push(n);return a.concat(r)};var l=a.alloc(16,16);function h(){this.cache=a.allocUnsafe(0)}function d(t,e,n){var s=r[t.toLowerCase()];if(!s)throw new TypeError("invalid suite type");if("string"==typeof e&&(e=a.from(e)),e.length!==s.key/8)throw new TypeError("invalid key length "+e.length);if("string"==typeof n&&(n=a.from(n)),"GCM"!==s.mode&&n.length!==s.iv)throw new TypeError("invalid iv length "+n.length);return"stream"===s.type?new o(s.module,e,n):"auth"===s.type?new i(s.module,e,n):new f(s.module,e,n)}f.prototype._final=function(){var t=this._cache.flush();if(this._autopadding)return t=this._mode.encrypt(this,t),this._cipher.scrub(),t;if(!t.equals(l))throw this._cipher.scrub(),new Error("data not multiple of block length")},f.prototype.setAutoPadding=function(t){return this._autopadding=!!t,this},h.prototype.add=function(t){this.cache=a.concat([this.cache,t])},h.prototype.get=function(){if(this.cache.length>15){var t=this.cache.slice(0,16);return this.cache=this.cache.slice(16),t}return null},h.prototype.flush=function(){for(var t=16-this.cache.length,e=a.allocUnsafe(t),n=-1;++n<t;)e.writeUInt8(t,n);return a.concat([this.cache,e])},e.createCipheriv=d,e.createCipher=function(t,e){var n=r[t.toLowerCase()];if(!n)throw new TypeError("invalid suite type");var i=c(e,!1,n.key,n.iv);return d(t,i.key,i.iv)}},function(t,e){e.encrypt=function(t,e){return t._cipher.encryptBlock(e)},e.decrypt=function(t,e){return t._cipher.decryptBlock(e)}},function(t,e,n){var r=n(55);e.encrypt=function(t,e){var n=r(e,t._prev);return t._prev=t._cipher.encryptBlock(n),t._prev},e.decrypt=function(t,e){var n=t._prev;t._prev=e;var i=t._cipher.decryptBlock(e);return r(i,n)}},function(t,e,n){var r=n(3).Buffer,i=n(55);function a(t,e,n){var a=e.length,o=i(e,t._cache);return t._cache=t._cache.slice(a),t._prev=r.concat([t._prev,n?e:o]),o}e.encrypt=function(t,e,n){for(var i,o=r.allocUnsafe(0);e.length;){if(0===t._cache.length&&(t._cache=t._cipher.encryptBlock(t._prev),t._prev=r.allocUnsafe(0)),!(t._cache.length<=e.length)){o=r.concat([o,a(t,e,n)]);break}i=t._cache.length,o=r.concat([o,a(t,e.slice(0,i),n)]),e=e.slice(i)}return o}},function(t,e,n){var r=n(3).Buffer;function i(t,e,n){var i=t._cipher.encryptBlock(t._prev)[0]^e;return t._prev=r.concat([t._prev.slice(1),r.from([n?e:i])]),i}e.encrypt=function(t,e,n){for(var a=e.length,o=r.allocUnsafe(a),s=-1;++s<a;)o[s]=i(t,e[s],n);return o}},function(t,e,n){var r=n(3).Buffer;function i(t,e,n){for(var r,i,o=-1,s=0;++o<8;)r=e&1<<7-o?128:0,s+=(128&(i=t._cipher.encryptBlock(t._prev)[0]^r))>>o%8,t._prev=a(t._prev,n?r:i);return s}function a(t,e){var n=t.length,i=-1,a=r.allocUnsafe(t.length);for(t=r.concat([t,r.from([e])]);++i<n;)a[i]=t[i]<<1|t[i+1]>>7;return a}e.encrypt=function(t,e,n){for(var a=e.length,o=r.allocUnsafe(a),s=-1;++s<a;)o[s]=i(t,e[s],n);return o}},function(t,e,n){(function(t){var r=n(55);function i(t){return t._prev=t._cipher.encryptBlock(t._prev),t._prev}e.encrypt=function(e,n){for(;e._cache.length<n.length;)e._cache=t.concat([e._cache,i(e)]);var a=e._cache.slice(0,n.length);return e._cache=e._cache.slice(n.length),r(n,a)}}).call(this,n(8).Buffer)},function(t,e,n){var r=n(3).Buffer,i=r.alloc(16,0);function a(t){var e=r.allocUnsafe(16);return e.writeUInt32BE(t[0]>>>0,0),e.writeUInt32BE(t[1]>>>0,4),e.writeUInt32BE(t[2]>>>0,8),e.writeUInt32BE(t[3]>>>0,12),e}function o(t){this.h=t,this.state=r.alloc(16,0),this.cache=r.allocUnsafe(0)}o.prototype.ghash=function(t){for(var e=-1;++e<t.length;)this.state[e]^=t[e];this._multiply()},o.prototype._multiply=function(){for(var t,e,n,r=[(t=this.h).readUInt32BE(0),t.readUInt32BE(4),t.readUInt32BE(8),t.readUInt32BE(12)],i=[0,0,0,0],o=-1;++o<128;){for(0!=(this.state[~~(o/8)]&1<<7-o%8)&&(i[0]^=r[0],i[1]^=r[1],i[2]^=r[2],i[3]^=r[3]),n=0!=(1&r[3]),e=3;e>0;e--)r[e]=r[e]>>>1|(1&r[e-1])<<31;r[0]=r[0]>>>1,n&&(r[0]=r[0]^225<<24)}this.state=a(i)},o.prototype.update=function(t){var e;for(this.cache=r.concat([this.cache,t]);this.cache.length>=16;)e=this.cache.slice(0,16),this.cache=this.cache.slice(16),this.ghash(e)},o.prototype.final=function(t,e){return this.cache.length&&this.ghash(r.concat([this.cache,i],16)),this.ghash(a([0,t,0,e])),this.state},t.exports=o},function(t,e,n){var r=n(211),i=n(3).Buffer,a=n(122),o=n(212),s=n(31),u=n(79),c=n(80);function f(t,e,n){s.call(this),this._cache=new l,this._last=void 0,this._cipher=new u.AES(e),this._prev=i.from(n),this._mode=t,this._autopadding=!0}function l(){this.cache=i.allocUnsafe(0)}function h(t,e,n){var s=a[t.toLowerCase()];if(!s)throw new TypeError("invalid suite type");if("string"==typeof n&&(n=i.from(n)),"GCM"!==s.mode&&n.length!==s.iv)throw new TypeError("invalid iv length "+n.length);if("string"==typeof e&&(e=i.from(e)),e.length!==s.key/8)throw new TypeError("invalid key length "+e.length);return"stream"===s.type?new o(s.module,e,n,!0):"auth"===s.type?new r(s.module,e,n,!0):new f(s.module,e,n)}n(2)(f,s),f.prototype._update=function(t){var e,n;this._cache.add(t);for(var r=[];e=this._cache.get(this._autopadding);)n=this._mode.decrypt(this,e),r.push(n);return i.concat(r)},f.prototype._final=function(){var t=this._cache.flush();if(this._autopadding)return function(t){var e=t[15];if(e<1||e>16)throw new Error("unable to decrypt data");var n=-1;for(;++n<e;)if(t[n+(16-e)]!==e)throw new Error("unable to decrypt data");if(16===e)return;return t.slice(0,16-e)}(this._mode.decrypt(this,t));if(t)throw new Error("data not multiple of block length")},f.prototype.setAutoPadding=function(t){return this._autopadding=!!t,this},l.prototype.add=function(t){this.cache=i.concat([this.cache,t])},l.prototype.get=function(t){var e;if(t){if(this.cache.length>16)return e=this.cache.slice(0,16),this.cache=this.cache.slice(16),e}else if(this.cache.length>=16)return e=this.cache.slice(0,16),this.cache=this.cache.slice(16),e;return null},l.prototype.flush=function(){if(this.cache.length)return this.cache},e.createDecipher=function(t,e){var n=a[t.toLowerCase()];if(!n)throw new TypeError("invalid suite type");var r=c(e,!1,n.key,n.iv);return h(t,r.key,r.iv)},e.createDecipheriv=h},function(t,e){e["des-ecb"]={key:8,iv:0},e["des-cbc"]=e.des={key:8,iv:8},e["des-ede3-cbc"]=e.des3={key:24,iv:8},e["des-ede3"]={key:24,iv:0},e["des-ede-cbc"]={key:16,iv:8},e["des-ede"]={key:16,iv:0}},function(t,e,n){(function(t){var r=n(213),i=n(459),a=n(460);var o={binary:!0,hex:!0,base64:!0};e.DiffieHellmanGroup=e.createDiffieHellmanGroup=e.getDiffieHellman=function(e){var n=new t(i[e].prime,"hex"),r=new t(i[e].gen,"hex");return new a(n,r)},e.createDiffieHellman=e.DiffieHellman=function e(n,i,s,u){return t.isBuffer(i)||void 0===o[i]?e(n,"binary",i,s):(i=i||"binary",u=u||"binary",s=s||new t([2]),t.isBuffer(s)||(s=new t(s,u)),"number"==typeof n?new a(r(n,s),s,!0):(t.isBuffer(n)||(n=new t(n,i)),new a(n,s,!0)))}}).call(this,n(8).Buffer)},function(t,e){},function(t,e){},function(t){t.exports=JSON.parse('{"modp1":{"gen":"02","prime":"ffffffffffffffffc90fdaa22168c234c4c6628b80dc1cd129024e088a67cc74020bbea63b139b22514a08798e3404ddef9519b3cd3a431b302b0a6df25f14374fe1356d6d51c245e485b576625e7ec6f44c42e9a63a3620ffffffffffffffff"},"modp2":{"gen":"02","prime":"ffffffffffffffffc90fdaa22168c234c4c6628b80dc1cd129024e088a67cc74020bbea63b139b22514a08798e3404ddef9519b3cd3a431b302b0a6df25f14374fe1356d6d51c245e485b576625e7ec6f44c42e9a637ed6b0bff5cb6f406b7edee386bfb5a899fa5ae9f24117c4b1fe649286651ece65381ffffffffffffffff"},"modp5":{"gen":"02","prime":"ffffffffffffffffc90fdaa22168c234c4c6628b80dc1cd129024e088a67cc74020bbea63b139b22514a08798e3404ddef9519b3cd3a431b302b0a6df25f14374fe1356d6d51c245e485b576625e7ec6f44c42e9a637ed6b0bff5cb6f406b7edee386bfb5a899fa5ae9f24117c4b1fe649286651ece45b3dc2007cb8a163bf0598da48361c55d39a69163fa8fd24cf5f83655d23dca3ad961c62f356208552bb9ed529077096966d670c354e4abc9804f1746c08ca237327ffffffffffffffff"},"modp14":{"gen":"02","prime":"ffffffffffffffffc90fdaa22168c234c4c6628b80dc1cd129024e088a67cc74020bbea63b139b22514a08798e3404ddef9519b3cd3a431b302b0a6df25f14374fe1356d6d51c245e485b576625e7ec6f44c42e9a637ed6b0bff5cb6f406b7edee386bfb5a899fa5ae9f24117c4b1fe649286651ece45b3dc2007cb8a163bf0598da48361c55d39a69163fa8fd24cf5f83655d23dca3ad961c62f356208552bb9ed529077096966d670c354e4abc9804f1746c08ca18217c32905e462e36ce3be39e772c180e86039b2783a2ec07a28fb5c55df06f4c52c9de2bcbf6955817183995497cea956ae515d2261898fa051015728e5a8aacaa68ffffffffffffffff"},"modp15":{"gen":"02","prime":"ffffffffffffffffc90fdaa22168c234c4c6628b80dc1cd129024e088a67cc74020bbea63b139b22514a08798e3404ddef9519b3cd3a431b302b0a6df25f14374fe1356d6d51c245e485b576625e7ec6f44c42e9a637ed6b0bff5cb6f406b7edee386bfb5a899fa5ae9f24117c4b1fe649286651ece45b3dc2007cb8a163bf0598da48361c55d39a69163fa8fd24cf5f83655d23dca3ad961c62f356208552bb9ed529077096966d670c354e4abc9804f1746c08ca18217c32905e462e36ce3be39e772c180e86039b2783a2ec07a28fb5c55df06f4c52c9de2bcbf6955817183995497cea956ae515d2261898fa051015728e5a8aaac42dad33170d04507a33a85521abdf1cba64ecfb850458dbef0a8aea71575d060c7db3970f85a6e1e4c7abf5ae8cdb0933d71e8c94e04a25619dcee3d2261ad2ee6bf12ffa06d98a0864d87602733ec86a64521f2b18177b200cbbe117577a615d6c770988c0bad946e208e24fa074e5ab3143db5bfce0fd108e4b82d120a93ad2caffffffffffffffff"},"modp16":{"gen":"02","prime":"ffffffffffffffffc90fdaa22168c234c4c6628b80dc1cd129024e088a67cc74020bbea63b139b22514a08798e3404ddef9519b3cd3a431b302b0a6df25f14374fe1356d6d51c245e485b576625e7ec6f44c42e9a637ed6b0bff5cb6f406b7edee386bfb5a899fa5ae9f24117c4b1fe649286651ece45b3dc2007cb8a163bf0598da48361c55d39a69163fa8fd24cf5f83655d23dca3ad961c62f356208552bb9ed529077096966d670c354e4abc9804f1746c08ca18217c32905e462e36ce3be39e772c180e86039b2783a2ec07a28fb5c55df06f4c52c9de2bcbf6955817183995497cea956ae515d2261898fa051015728e5a8aaac42dad33170d04507a33a85521abdf1cba64ecfb850458dbef0a8aea71575d060c7db3970f85a6e1e4c7abf5ae8cdb0933d71e8c94e04a25619dcee3d2261ad2ee6bf12ffa06d98a0864d87602733ec86a64521f2b18177b200cbbe117577a615d6c770988c0bad946e208e24fa074e5ab3143db5bfce0fd108e4b82d120a92108011a723c12a787e6d788719a10bdba5b2699c327186af4e23c1a946834b6150bda2583e9ca2ad44ce8dbbbc2db04de8ef92e8efc141fbecaa6287c59474e6bc05d99b2964fa090c3a2233ba186515be7ed1f612970cee2d7afb81bdd762170481cd0069127d5b05aa993b4ea988d8fddc186ffb7dc90a6c08f4df435c934063199ffffffffffffffff"},"modp17":{"gen":"02","prime":"ffffffffffffffffc90fdaa22168c234c4c6628b80dc1cd129024e088a67cc74020bbea63b139b22514a08798e3404ddef9519b3cd3a431b302b0a6df25f14374fe1356d6d51c245e485b576625e7ec6f44c42e9a637ed6b0bff5cb6f406b7edee386bfb5a899fa5ae9f24117c4b1fe649286651ece45b3dc2007cb8a163bf0598da48361c55d39a69163fa8fd24cf5f83655d23dca3ad961c62f356208552bb9ed529077096966d670c354e4abc9804f1746c08ca18217c32905e462e36ce3be39e772c180e86039b2783a2ec07a28fb5c55df06f4c52c9de2bcbf6955817183995497cea956ae515d2261898fa051015728e5a8aaac42dad33170d04507a33a85521abdf1cba64ecfb850458dbef0a8aea71575d060c7db3970f85a6e1e4c7abf5ae8cdb0933d71e8c94e04a25619dcee3d2261ad2ee6bf12ffa06d98a0864d87602733ec86a64521f2b18177b200cbbe117577a615d6c770988c0bad946e208e24fa074e5ab3143db5bfce0fd108e4b82d120a92108011a723c12a787e6d788719a10bdba5b2699c327186af4e23c1a946834b6150bda2583e9ca2ad44ce8dbbbc2db04de8ef92e8efc141fbecaa6287c59474e6bc05d99b2964fa090c3a2233ba186515be7ed1f612970cee2d7afb81bdd762170481cd0069127d5b05aa993b4ea988d8fddc186ffb7dc90a6c08f4df435c93402849236c3fab4d27c7026c1d4dcb2602646dec9751e763dba37bdf8ff9406ad9e530ee5db382f413001aeb06a53ed9027d831179727b0865a8918da3edbebcf9b14ed44ce6cbaced4bb1bdb7f1447e6cc254b332051512bd7af426fb8f401378cd2bf5983ca01c64b92ecf032ea15d1721d03f482d7ce6e74fef6d55e702f46980c82b5a84031900b1c9e59e7c97fbec7e8f323a97a7e36cc88be0f1d45b7ff585ac54bd407b22b4154aacc8f6d7ebf48e1d814cc5ed20f8037e0a79715eef29be32806a1d58bb7c5da76f550aa3d8a1fbff0eb19ccb1a313d55cda56c9ec2ef29632387fe8d76e3c0468043e8f663f4860ee12bf2d5b0b7474d6e694f91e6dcc4024ffffffffffffffff"},"modp18":{"gen":"02","prime":"ffffffffffffffffc90fdaa22168c234c4c6628b80dc1cd129024e088a67cc74020bbea63b139b22514a08798e3404ddef9519b3cd3a431b302b0a6df25f14374fe1356d6d51c245e485b576625e7ec6f44c42e9a637ed6b0bff5cb6f406b7edee386bfb5a899fa5ae9f24117c4b1fe649286651ece45b3dc2007cb8a163bf0598da48361c55d39a69163fa8fd24cf5f83655d23dca3ad961c62f356208552bb9ed529077096966d670c354e4abc9804f1746c08ca18217c32905e462e36ce3be39e772c180e86039b2783a2ec07a28fb5c55df06f4c52c9de2bcbf6955817183995497cea956ae515d2261898fa051015728e5a8aaac42dad33170d04507a33a85521abdf1cba64ecfb850458dbef0a8aea71575d060c7db3970f85a6e1e4c7abf5ae8cdb0933d71e8c94e04a25619dcee3d2261ad2ee6bf12ffa06d98a0864d87602733ec86a64521f2b18177b200cbbe117577a615d6c770988c0bad946e208e24fa074e5ab3143db5bfce0fd108e4b82d120a92108011a723c12a787e6d788719a10bdba5b2699c327186af4e23c1a946834b6150bda2583e9ca2ad44ce8dbbbc2db04de8ef92e8efc141fbecaa6287c59474e6bc05d99b2964fa090c3a2233ba186515be7ed1f612970cee2d7afb81bdd762170481cd0069127d5b05aa993b4ea988d8fddc186ffb7dc90a6c08f4df435c93402849236c3fab4d27c7026c1d4dcb2602646dec9751e763dba37bdf8ff9406ad9e530ee5db382f413001aeb06a53ed9027d831179727b0865a8918da3edbebcf9b14ed44ce6cbaced4bb1bdb7f1447e6cc254b332051512bd7af426fb8f401378cd2bf5983ca01c64b92ecf032ea15d1721d03f482d7ce6e74fef6d55e702f46980c82b5a84031900b1c9e59e7c97fbec7e8f323a97a7e36cc88be0f1d45b7ff585ac54bd407b22b4154aacc8f6d7ebf48e1d814cc5ed20f8037e0a79715eef29be32806a1d58bb7c5da76f550aa3d8a1fbff0eb19ccb1a313d55cda56c9ec2ef29632387fe8d76e3c0468043e8f663f4860ee12bf2d5b0b7474d6e694f91e6dbe115974a3926f12fee5e438777cb6a932df8cd8bec4d073b931ba3bc832b68d9dd300741fa7bf8afc47ed2576f6936ba424663aab639c5ae4f5683423b4742bf1c978238f16cbe39d652de3fdb8befc848ad922222e04a4037c0713eb57a81a23f0c73473fc646cea306b4bcbc8862f8385ddfa9d4b7fa2c087e879683303ed5bdd3a062b3cf5b3a278a66d2a13f83f44f82ddf310ee074ab6a364597e899a0255dc164f31cc50846851df9ab48195ded7ea1b1d510bd7ee74d73faf36bc31ecfa268359046f4eb879f924009438b481c6cd7889a002ed5ee382bc9190da6fc026e479558e4475677e9aa9e3050e2765694dfc81f56e880b96e7160c980dd98edd3dfffffffffffffffff"}}')},function(t,e,n){(function(e){var r=n(5),i=new(n(214)),a=new r(24),o=new r(11),s=new r(10),u=new r(3),c=new r(7),f=n(213),l=n(44);function h(t,n){return n=n||"utf8",e.isBuffer(t)||(t=new e(t,n)),this._pub=new r(t),this}function d(t,n){return n=n||"utf8",e.isBuffer(t)||(t=new e(t,n)),this._priv=new r(t),this}t.exports=g;var p={};function g(t,e,n){this.setGenerator(e),this.__prime=new r(t),this._prime=r.mont(this.__prime),this._primeLen=t.length,this._pub=void 0,this._priv=void 0,this._primeCode=void 0,n?(this.setPublicKey=h,this.setPrivateKey=d):this._primeCode=8}function y(t,n){var r=new e(t.toArray());return n?r.toString(n):r}Object.defineProperty(g.prototype,"verifyError",{enumerable:!0,get:function(){return"number"!=typeof this._primeCode&&(this._primeCode=function(t,e){var n=e.toString("hex"),r=[n,t.toString(16)].join("_");if(r in p)return p[r];var l,h=0;if(t.isEven()||!f.simpleSieve||!f.fermatTest(t)||!i.test(t))return h+=1,h+="02"===n||"05"===n?8:4,p[r]=h,h;switch(i.test(t.shrn(1))||(h+=2),n){case"02":t.mod(a).cmp(o)&&(h+=8);break;case"05":(l=t.mod(s)).cmp(u)&&l.cmp(c)&&(h+=8);break;default:h+=4}return p[r]=h,h}(this.__prime,this.__gen)),this._primeCode}}),g.prototype.generateKeys=function(){return this._priv||(this._priv=new r(l(this._primeLen))),this._pub=this._gen.toRed(this._prime).redPow(this._priv).fromRed(),this.getPublicKey()},g.prototype.computeSecret=function(t){var n=(t=(t=new r(t)).toRed(this._prime)).redPow(this._priv).fromRed(),i=new e(n.toArray()),a=this.getPrime();if(i.length<a.length){var o=new e(a.length-i.length);o.fill(0),i=e.concat([o,i])}return i},g.prototype.getPublicKey=function(t){return y(this._pub,t)},g.prototype.getPrivateKey=function(t){return y(this._priv,t)},g.prototype.getPrime=function(t){return y(this.__prime,t)},g.prototype.getGenerator=function(t){return y(this._gen,t)},g.prototype.setGenerator=function(t,n){return n=n||"utf8",e.isBuffer(t)||(t=new e(t,n)),this.__gen=t,this._gen=new r(t),this}}).call(this,n(8).Buffer)},function(t,e,n){(function(e){var r=n(53),i=n(112),a=n(2),o=n(462),s=n(494),u=n(201);function c(t){i.Writable.call(this);var e=u[t];if(!e)throw new Error("Unknown message digest");this._hashType=e.hash,this._hash=r(e.hash),this._tag=e.id,this._signType=e.sign}function f(t){i.Writable.call(this);var e=u[t];if(!e)throw new Error("Unknown message digest");this._hash=r(e.hash),this._tag=e.id,this._signType=e.sign}function l(t){return new c(t)}function h(t){return new f(t)}Object.keys(u).forEach((function(t){u[t].id=new e(u[t].id,"hex"),u[t.toLowerCase()]=u[t]})),a(c,i.Writable),c.prototype._write=function(t,e,n){this._hash.update(t),n()},c.prototype.update=function(t,n){return"string"==typeof t&&(t=new e(t,n)),this._hash.update(t),this},c.prototype.sign=function(t,e){this.end();var n=this._hash.digest(),r=o(n,t,this._hashType,this._signType,this._tag);return e?r.toString(e):r},a(f,i.Writable),f.prototype._write=function(t,e,n){this._hash.update(t),n()},f.prototype.update=function(t,n){return"string"==typeof t&&(t=new e(t,n)),this._hash.update(t),this},f.prototype.verify=function(t,n,r){"string"==typeof n&&(n=new e(n,r)),this.end();var i=this._hash.digest();return s(n,i,t,this._signType,this._tag)},t.exports={Sign:l,Verify:h,createSign:l,createVerify:h}}).call(this,n(8).Buffer)},function(t,e,n){(function(e){var r=n(199),i=n(124),a=n(125).ec,o=n(5),s=n(82),u=n(224);function c(t,n,i,a){if((t=new e(t.toArray())).length<n.byteLength()){var o=new e(n.byteLength()-t.length);o.fill(0),t=e.concat([o,t])}var s=i.length,u=function(t,n){t=(t=f(t,n)).mod(n);var r=new e(t.toArray());if(r.length<n.byteLength()){var i=new e(n.byteLength()-r.length);i.fill(0),r=e.concat([i,r])}return r}(i,n),c=new e(s);c.fill(1);var l=new e(s);return l.fill(0),l=r(a,l).update(c).update(new e([0])).update(t).update(u).digest(),c=r(a,l).update(c).digest(),{k:l=r(a,l).update(c).update(new e([1])).update(t).update(u).digest(),v:c=r(a,l).update(c).digest()}}function f(t,e){var n=new o(t),r=(t.length<<3)-e.bitLength();return r>0&&n.ishrn(r),n}function l(t,n,i){var a,o;do{for(a=new e(0);8*a.length<t.bitLength();)n.v=r(i,n.k).update(n.v).digest(),a=e.concat([a,n.v]);o=f(a,t),n.k=r(i,n.k).update(n.v).update(new e([0])).digest(),n.v=r(i,n.k).update(n.v).digest()}while(-1!==o.cmp(t));return o}function h(t,e,n,r){return t.toRed(o.mont(n)).redPow(e).fromRed().mod(r)}t.exports=function(t,n,r,d,p){var g=s(n);if(g.curve){if("ecdsa"!==d&&"ecdsa/rsa"!==d)throw new Error("wrong private key type");return function(t,n){var r=u[n.curve.join(".")];if(!r)throw new Error("unknown curve "+n.curve.join("."));var i=new a(r).keyFromPrivate(n.privateKey).sign(t);return new e(i.toDER())}(t,g)}if("dsa"===g.type){if("dsa"!==d)throw new Error("wrong private key type");return function(t,n,r){var i,a=n.params.priv_key,s=n.params.p,u=n.params.q,d=n.params.g,p=new o(0),g=f(t,u).mod(u),y=!1,b=c(a,u,t,r);for(;!1===y;)i=l(u,b,r),p=h(d,i,s,u),0===(y=i.invm(u).imul(g.add(a.mul(p))).mod(u)).cmpn(0)&&(y=!1,p=new o(0));return function(t,n){t=t.toArray(),n=n.toArray(),128&t[0]&&(t=[0].concat(t));128&n[0]&&(n=[0].concat(n));var r=[48,t.length+n.length+4,2,t.length];return r=r.concat(t,[2,n.length],n),new e(r)}(p,y)}(t,g,r)}if("rsa"!==d&&"ecdsa/rsa"!==d)throw new Error("wrong private key type");t=e.concat([p,t]);for(var y=g.modulus.byteLength(),b=[0,1];t.length+b.length+1<y;)b.push(255);b.push(0);for(var v=-1;++v<t.length;)b.push(t[v]);return i(b,g)},t.exports.getKey=c,t.exports.makeKey=l}).call(this,n(8).Buffer)},function(t){t.exports=JSON.parse('{"name":"elliptic","version":"6.5.2","description":"EC cryptography","main":"lib/elliptic.js","files":["lib"],"scripts":{"jscs":"jscs benchmarks/*.js lib/*.js lib/**/*.js lib/**/**/*.js test/index.js","jshint":"jscs benchmarks/*.js lib/*.js lib/**/*.js lib/**/**/*.js test/index.js","lint":"npm run jscs && npm run jshint","unit":"istanbul test _mocha --reporter=spec test/index.js","test":"npm run lint && npm run unit","version":"grunt dist && git add dist/"},"repository":{"type":"git","url":"git@github.com:indutny/elliptic"},"keywords":["EC","Elliptic","curve","Cryptography"],"author":"Fedor Indutny <fedor@indutny.com>","license":"MIT","bugs":{"url":"https://github.com/indutny/elliptic/issues"},"homepage":"https://github.com/indutny/elliptic","devDependencies":{"brfs":"^1.4.3","coveralls":"^3.0.8","grunt":"^1.0.4","grunt-browserify":"^5.0.0","grunt-cli":"^1.2.0","grunt-contrib-connect":"^1.0.0","grunt-contrib-copy":"^1.0.0","grunt-contrib-uglify":"^1.0.1","grunt-mocha-istanbul":"^3.0.1","grunt-saucelabs":"^9.0.1","istanbul":"^0.4.2","jscs":"^3.0.7","jshint":"^2.10.3","mocha":"^6.2.2"},"dependencies":{"bn.js":"^4.4.0","brorand":"^1.0.1","hash.js":"^1.0.0","hmac-drbg":"^1.0.0","inherits":"^2.0.1","minimalistic-assert":"^1.0.0","minimalistic-crypto-utils":"^1.0.0"}}')},function(t,e,n){"use strict";var r=n(17),i=n(5),a=n(2),o=n(81),s=r.assert;function u(t){o.call(this,"short",t),this.a=new i(t.a,16).toRed(this.red),this.b=new i(t.b,16).toRed(this.red),this.tinv=this.two.redInvm(),this.zeroA=0===this.a.fromRed().cmpn(0),this.threeA=0===this.a.fromRed().sub(this.p).cmpn(-3),this.endo=this._getEndomorphism(t),this._endoWnafT1=new Array(4),this._endoWnafT2=new Array(4)}function c(t,e,n,r){o.BasePoint.call(this,t,"affine"),null===e&&null===n?(this.x=null,this.y=null,this.inf=!0):(this.x=new i(e,16),this.y=new i(n,16),r&&(this.x.forceRed(this.curve.red),this.y.forceRed(this.curve.red)),this.x.red||(this.x=this.x.toRed(this.curve.red)),this.y.red||(this.y=this.y.toRed(this.curve.red)),this.inf=!1)}function f(t,e,n,r){o.BasePoint.call(this,t,"jacobian"),null===e&&null===n&&null===r?(this.x=this.curve.one,this.y=this.curve.one,this.z=new i(0)):(this.x=new i(e,16),this.y=new i(n,16),this.z=new i(r,16)),this.x.red||(this.x=this.x.toRed(this.curve.red)),this.y.red||(this.y=this.y.toRed(this.curve.red)),this.z.red||(this.z=this.z.toRed(this.curve.red)),this.zOne=this.z===this.curve.one}a(u,o),t.exports=u,u.prototype._getEndomorphism=function(t){if(this.zeroA&&this.g&&this.n&&1===this.p.modn(3)){var e,n;if(t.beta)e=new i(t.beta,16).toRed(this.red);else{var r=this._getEndoRoots(this.p);e=(e=r[0].cmp(r[1])<0?r[0]:r[1]).toRed(this.red)}if(t.lambda)n=new i(t.lambda,16);else{var a=this._getEndoRoots(this.n);0===this.g.mul(a[0]).x.cmp(this.g.x.redMul(e))?n=a[0]:(n=a[1],s(0===this.g.mul(n).x.cmp(this.g.x.redMul(e))))}return{beta:e,lambda:n,basis:t.basis?t.basis.map((function(t){return{a:new i(t.a,16),b:new i(t.b,16)}})):this._getEndoBasis(n)}}},u.prototype._getEndoRoots=function(t){var e=t===this.p?this.red:i.mont(t),n=new i(2).toRed(e).redInvm(),r=n.redNeg(),a=new i(3).toRed(e).redNeg().redSqrt().redMul(n);return[r.redAdd(a).fromRed(),r.redSub(a).fromRed()]},u.prototype._getEndoBasis=function(t){for(var e,n,r,a,o,s,u,c,f,l=this.n.ushrn(Math.floor(this.n.bitLength()/2)),h=t,d=this.n.clone(),p=new i(1),g=new i(0),y=new i(0),b=new i(1),v=0;0!==h.cmpn(0);){var m=d.div(h);c=d.sub(m.mul(h)),f=y.sub(m.mul(p));var _=b.sub(m.mul(g));if(!r&&c.cmp(l)<0)e=u.neg(),n=p,r=c.neg(),a=f;else if(r&&2==++v)break;u=c,d=h,h=c,y=p,p=f,b=g,g=_}o=c.neg(),s=f;var w=r.sqr().add(a.sqr());return o.sqr().add(s.sqr()).cmp(w)>=0&&(o=e,s=n),r.negative&&(r=r.neg(),a=a.neg()),o.negative&&(o=o.neg(),s=s.neg()),[{a:r,b:a},{a:o,b:s}]},u.prototype._endoSplit=function(t){var e=this.endo.basis,n=e[0],r=e[1],i=r.b.mul(t).divRound(this.n),a=n.b.neg().mul(t).divRound(this.n),o=i.mul(n.a),s=a.mul(r.a),u=i.mul(n.b),c=a.mul(r.b);return{k1:t.sub(o).sub(s),k2:u.add(c).neg()}},u.prototype.pointFromX=function(t,e){(t=new i(t,16)).red||(t=t.toRed(this.red));var n=t.redSqr().redMul(t).redIAdd(t.redMul(this.a)).redIAdd(this.b),r=n.redSqrt();if(0!==r.redSqr().redSub(n).cmp(this.zero))throw new Error("invalid point");var a=r.fromRed().isOdd();return(e&&!a||!e&&a)&&(r=r.redNeg()),this.point(t,r)},u.prototype.validate=function(t){if(t.inf)return!0;var e=t.x,n=t.y,r=this.a.redMul(e),i=e.redSqr().redMul(e).redIAdd(r).redIAdd(this.b);return 0===n.redSqr().redISub(i).cmpn(0)},u.prototype._endoWnafMulAdd=function(t,e,n){for(var r=this._endoWnafT1,i=this._endoWnafT2,a=0;a<t.length;a++){var o=this._endoSplit(e[a]),s=t[a],u=s._getBeta();o.k1.negative&&(o.k1.ineg(),s=s.neg(!0)),o.k2.negative&&(o.k2.ineg(),u=u.neg(!0)),r[2*a]=s,r[2*a+1]=u,i[2*a]=o.k1,i[2*a+1]=o.k2}for(var c=this._wnafMulAdd(1,r,i,2*a,n),f=0;f<2*a;f++)r[f]=null,i[f]=null;return c},a(c,o.BasePoint),u.prototype.point=function(t,e,n){return new c(this,t,e,n)},u.prototype.pointFromJSON=function(t,e){return c.fromJSON(this,t,e)},c.prototype._getBeta=function(){if(this.curve.endo){var t=this.precomputed;if(t&&t.beta)return t.beta;var e=this.curve.point(this.x.redMul(this.curve.endo.beta),this.y);if(t){var n=this.curve,r=function(t){return n.point(t.x.redMul(n.endo.beta),t.y)};t.beta=e,e.precomputed={beta:null,naf:t.naf&&{wnd:t.naf.wnd,points:t.naf.points.map(r)},doubles:t.doubles&&{step:t.doubles.step,points:t.doubles.points.map(r)}}}return e}},c.prototype.toJSON=function(){return this.precomputed?[this.x,this.y,this.precomputed&&{doubles:this.precomputed.doubles&&{step:this.precomputed.doubles.step,points:this.precomputed.doubles.points.slice(1)},naf:this.precomputed.naf&&{wnd:this.precomputed.naf.wnd,points:this.precomputed.naf.points.slice(1)}}]:[this.x,this.y]},c.fromJSON=function(t,e,n){"string"==typeof e&&(e=JSON.parse(e));var r=t.point(e[0],e[1],n);if(!e[2])return r;function i(e){return t.point(e[0],e[1],n)}var a=e[2];return r.precomputed={beta:null,doubles:a.doubles&&{step:a.doubles.step,points:[r].concat(a.doubles.points.map(i))},naf:a.naf&&{wnd:a.naf.wnd,points:[r].concat(a.naf.points.map(i))}},r},c.prototype.inspect=function(){return this.isInfinity()?"<EC Point Infinity>":"<EC Point x: "+this.x.fromRed().toString(16,2)+" y: "+this.y.fromRed().toString(16,2)+">"},c.prototype.isInfinity=function(){return this.inf},c.prototype.add=function(t){if(this.inf)return t;if(t.inf)return this;if(this.eq(t))return this.dbl();if(this.neg().eq(t))return this.curve.point(null,null);if(0===this.x.cmp(t.x))return this.curve.point(null,null);var e=this.y.redSub(t.y);0!==e.cmpn(0)&&(e=e.redMul(this.x.redSub(t.x).redInvm()));var n=e.redSqr().redISub(this.x).redISub(t.x),r=e.redMul(this.x.redSub(n)).redISub(this.y);return this.curve.point(n,r)},c.prototype.dbl=function(){if(this.inf)return this;var t=this.y.redAdd(this.y);if(0===t.cmpn(0))return this.curve.point(null,null);var e=this.curve.a,n=this.x.redSqr(),r=t.redInvm(),i=n.redAdd(n).redIAdd(n).redIAdd(e).redMul(r),a=i.redSqr().redISub(this.x.redAdd(this.x)),o=i.redMul(this.x.redSub(a)).redISub(this.y);return this.curve.point(a,o)},c.prototype.getX=function(){return this.x.fromRed()},c.prototype.getY=function(){return this.y.fromRed()},c.prototype.mul=function(t){return t=new i(t,16),this.isInfinity()?this:this._hasDoubles(t)?this.curve._fixedNafMul(this,t):this.curve.endo?this.curve._endoWnafMulAdd([this],[t]):this.curve._wnafMul(this,t)},c.prototype.mulAdd=function(t,e,n){var r=[this,e],i=[t,n];return this.curve.endo?this.curve._endoWnafMulAdd(r,i):this.curve._wnafMulAdd(1,r,i,2)},c.prototype.jmulAdd=function(t,e,n){var r=[this,e],i=[t,n];return this.curve.endo?this.curve._endoWnafMulAdd(r,i,!0):this.curve._wnafMulAdd(1,r,i,2,!0)},c.prototype.eq=function(t){return this===t||this.inf===t.inf&&(this.inf||0===this.x.cmp(t.x)&&0===this.y.cmp(t.y))},c.prototype.neg=function(t){if(this.inf)return this;var e=this.curve.point(this.x,this.y.redNeg());if(t&&this.precomputed){var n=this.precomputed,r=function(t){return t.neg()};e.precomputed={naf:n.naf&&{wnd:n.naf.wnd,points:n.naf.points.map(r)},doubles:n.doubles&&{step:n.doubles.step,points:n.doubles.points.map(r)}}}return e},c.prototype.toJ=function(){return this.inf?this.curve.jpoint(null,null,null):this.curve.jpoint(this.x,this.y,this.curve.one)},a(f,o.BasePoint),u.prototype.jpoint=function(t,e,n){return new f(this,t,e,n)},f.prototype.toP=function(){if(this.isInfinity())return this.curve.point(null,null);var t=this.z.redInvm(),e=t.redSqr(),n=this.x.redMul(e),r=this.y.redMul(e).redMul(t);return this.curve.point(n,r)},f.prototype.neg=function(){return this.curve.jpoint(this.x,this.y.redNeg(),this.z)},f.prototype.add=function(t){if(this.isInfinity())return t;if(t.isInfinity())return this;var e=t.z.redSqr(),n=this.z.redSqr(),r=this.x.redMul(e),i=t.x.redMul(n),a=this.y.redMul(e.redMul(t.z)),o=t.y.redMul(n.redMul(this.z)),s=r.redSub(i),u=a.redSub(o);if(0===s.cmpn(0))return 0!==u.cmpn(0)?this.curve.jpoint(null,null,null):this.dbl();var c=s.redSqr(),f=c.redMul(s),l=r.redMul(c),h=u.redSqr().redIAdd(f).redISub(l).redISub(l),d=u.redMul(l.redISub(h)).redISub(a.redMul(f)),p=this.z.redMul(t.z).redMul(s);return this.curve.jpoint(h,d,p)},f.prototype.mixedAdd=function(t){if(this.isInfinity())return t.toJ();if(t.isInfinity())return this;var e=this.z.redSqr(),n=this.x,r=t.x.redMul(e),i=this.y,a=t.y.redMul(e).redMul(this.z),o=n.redSub(r),s=i.redSub(a);if(0===o.cmpn(0))return 0!==s.cmpn(0)?this.curve.jpoint(null,null,null):this.dbl();var u=o.redSqr(),c=u.redMul(o),f=n.redMul(u),l=s.redSqr().redIAdd(c).redISub(f).redISub(f),h=s.redMul(f.redISub(l)).redISub(i.redMul(c)),d=this.z.redMul(o);return this.curve.jpoint(l,h,d)},f.prototype.dblp=function(t){if(0===t)return this;if(this.isInfinity())return this;if(!t)return this.dbl();if(this.curve.zeroA||this.curve.threeA){for(var e=this,n=0;n<t;n++)e=e.dbl();return e}var r=this.curve.a,i=this.curve.tinv,a=this.x,o=this.y,s=this.z,u=s.redSqr().redSqr(),c=o.redAdd(o);for(n=0;n<t;n++){var f=a.redSqr(),l=c.redSqr(),h=l.redSqr(),d=f.redAdd(f).redIAdd(f).redIAdd(r.redMul(u)),p=a.redMul(l),g=d.redSqr().redISub(p.redAdd(p)),y=p.redISub(g),b=d.redMul(y);b=b.redIAdd(b).redISub(h);var v=c.redMul(s);n+1<t&&(u=u.redMul(h)),a=g,s=v,c=b}return this.curve.jpoint(a,c.redMul(i),s)},f.prototype.dbl=function(){return this.isInfinity()?this:this.curve.zeroA?this._zeroDbl():this.curve.threeA?this._threeDbl():this._dbl()},f.prototype._zeroDbl=function(){var t,e,n;if(this.zOne){var r=this.x.redSqr(),i=this.y.redSqr(),a=i.redSqr(),o=this.x.redAdd(i).redSqr().redISub(r).redISub(a);o=o.redIAdd(o);var s=r.redAdd(r).redIAdd(r),u=s.redSqr().redISub(o).redISub(o),c=a.redIAdd(a);c=(c=c.redIAdd(c)).redIAdd(c),t=u,e=s.redMul(o.redISub(u)).redISub(c),n=this.y.redAdd(this.y)}else{var f=this.x.redSqr(),l=this.y.redSqr(),h=l.redSqr(),d=this.x.redAdd(l).redSqr().redISub(f).redISub(h);d=d.redIAdd(d);var p=f.redAdd(f).redIAdd(f),g=p.redSqr(),y=h.redIAdd(h);y=(y=y.redIAdd(y)).redIAdd(y),t=g.redISub(d).redISub(d),e=p.redMul(d.redISub(t)).redISub(y),n=(n=this.y.redMul(this.z)).redIAdd(n)}return this.curve.jpoint(t,e,n)},f.prototype._threeDbl=function(){var t,e,n;if(this.zOne){var r=this.x.redSqr(),i=this.y.redSqr(),a=i.redSqr(),o=this.x.redAdd(i).redSqr().redISub(r).redISub(a);o=o.redIAdd(o);var s=r.redAdd(r).redIAdd(r).redIAdd(this.curve.a),u=s.redSqr().redISub(o).redISub(o);t=u;var c=a.redIAdd(a);c=(c=c.redIAdd(c)).redIAdd(c),e=s.redMul(o.redISub(u)).redISub(c),n=this.y.redAdd(this.y)}else{var f=this.z.redSqr(),l=this.y.redSqr(),h=this.x.redMul(l),d=this.x.redSub(f).redMul(this.x.redAdd(f));d=d.redAdd(d).redIAdd(d);var p=h.redIAdd(h),g=(p=p.redIAdd(p)).redAdd(p);t=d.redSqr().redISub(g),n=this.y.redAdd(this.z).redSqr().redISub(l).redISub(f);var y=l.redSqr();y=(y=(y=y.redIAdd(y)).redIAdd(y)).redIAdd(y),e=d.redMul(p.redISub(t)).redISub(y)}return this.curve.jpoint(t,e,n)},f.prototype._dbl=function(){var t=this.curve.a,e=this.x,n=this.y,r=this.z,i=r.redSqr().redSqr(),a=e.redSqr(),o=n.redSqr(),s=a.redAdd(a).redIAdd(a).redIAdd(t.redMul(i)),u=e.redAdd(e),c=(u=u.redIAdd(u)).redMul(o),f=s.redSqr().redISub(c.redAdd(c)),l=c.redISub(f),h=o.redSqr();h=(h=(h=h.redIAdd(h)).redIAdd(h)).redIAdd(h);var d=s.redMul(l).redISub(h),p=n.redAdd(n).redMul(r);return this.curve.jpoint(f,d,p)},f.prototype.trpl=function(){if(!this.curve.zeroA)return this.dbl().add(this);var t=this.x.redSqr(),e=this.y.redSqr(),n=this.z.redSqr(),r=e.redSqr(),i=t.redAdd(t).redIAdd(t),a=i.redSqr(),o=this.x.redAdd(e).redSqr().redISub(t).redISub(r),s=(o=(o=(o=o.redIAdd(o)).redAdd(o).redIAdd(o)).redISub(a)).redSqr(),u=r.redIAdd(r);u=(u=(u=u.redIAdd(u)).redIAdd(u)).redIAdd(u);var c=i.redIAdd(o).redSqr().redISub(a).redISub(s).redISub(u),f=e.redMul(c);f=(f=f.redIAdd(f)).redIAdd(f);var l=this.x.redMul(s).redISub(f);l=(l=l.redIAdd(l)).redIAdd(l);var h=this.y.redMul(c.redMul(u.redISub(c)).redISub(o.redMul(s)));h=(h=(h=h.redIAdd(h)).redIAdd(h)).redIAdd(h);var d=this.z.redAdd(o).redSqr().redISub(n).redISub(s);return this.curve.jpoint(l,h,d)},f.prototype.mul=function(t,e){return t=new i(t,e),this.curve._wnafMul(this,t)},f.prototype.eq=function(t){if("affine"===t.type)return this.eq(t.toJ());if(this===t)return!0;var e=this.z.redSqr(),n=t.z.redSqr();if(0!==this.x.redMul(n).redISub(t.x.redMul(e)).cmpn(0))return!1;var r=e.redMul(this.z),i=n.redMul(t.z);return 0===this.y.redMul(i).redISub(t.y.redMul(r)).cmpn(0)},f.prototype.eqXToP=function(t){var e=this.z.redSqr(),n=t.toRed(this.curve.red).redMul(e);if(0===this.x.cmp(n))return!0;for(var r=t.clone(),i=this.curve.redN.redMul(e);;){if(r.iadd(this.curve.n),r.cmp(this.curve.p)>=0)return!1;if(n.redIAdd(i),0===this.x.cmp(n))return!0}},f.prototype.inspect=function(){return this.isInfinity()?"<EC JPoint Infinity>":"<EC JPoint x: "+this.x.toString(16,2)+" y: "+this.y.toString(16,2)+" z: "+this.z.toString(16,2)+">"},f.prototype.isInfinity=function(){return 0===this.z.cmpn(0)}},function(t,e,n){"use strict";var r=n(5),i=n(2),a=n(81),o=n(17);function s(t){a.call(this,"mont",t),this.a=new r(t.a,16).toRed(this.red),this.b=new r(t.b,16).toRed(this.red),this.i4=new r(4).toRed(this.red).redInvm(),this.two=new r(2).toRed(this.red),this.a24=this.i4.redMul(this.a.redAdd(this.two))}function u(t,e,n){a.BasePoint.call(this,t,"projective"),null===e&&null===n?(this.x=this.curve.one,this.z=this.curve.zero):(this.x=new r(e,16),this.z=new r(n,16),this.x.red||(this.x=this.x.toRed(this.curve.red)),this.z.red||(this.z=this.z.toRed(this.curve.red)))}i(s,a),t.exports=s,s.prototype.validate=function(t){var e=t.normalize().x,n=e.redSqr(),r=n.redMul(e).redAdd(n.redMul(this.a)).redAdd(e);return 0===r.redSqrt().redSqr().cmp(r)},i(u,a.BasePoint),s.prototype.decodePoint=function(t,e){return this.point(o.toArray(t,e),1)},s.prototype.point=function(t,e){return new u(this,t,e)},s.prototype.pointFromJSON=function(t){return u.fromJSON(this,t)},u.prototype.precompute=function(){},u.prototype._encode=function(){return this.getX().toArray("be",this.curve.p.byteLength())},u.fromJSON=function(t,e){return new u(t,e[0],e[1]||t.one)},u.prototype.inspect=function(){return this.isInfinity()?"<EC Point Infinity>":"<EC Point x: "+this.x.fromRed().toString(16,2)+" z: "+this.z.fromRed().toString(16,2)+">"},u.prototype.isInfinity=function(){return 0===this.z.cmpn(0)},u.prototype.dbl=function(){var t=this.x.redAdd(this.z).redSqr(),e=this.x.redSub(this.z).redSqr(),n=t.redSub(e),r=t.redMul(e),i=n.redMul(e.redAdd(this.curve.a24.redMul(n)));return this.curve.point(r,i)},u.prototype.add=function(){throw new Error("Not supported on Montgomery curve")},u.prototype.diffAdd=function(t,e){var n=this.x.redAdd(this.z),r=this.x.redSub(this.z),i=t.x.redAdd(t.z),a=t.x.redSub(t.z).redMul(n),o=i.redMul(r),s=e.z.redMul(a.redAdd(o).redSqr()),u=e.x.redMul(a.redISub(o).redSqr());return this.curve.point(s,u)},u.prototype.mul=function(t){for(var e=t.clone(),n=this,r=this.curve.point(null,null),i=[];0!==e.cmpn(0);e.iushrn(1))i.push(e.andln(1));for(var a=i.length-1;a>=0;a--)0===i[a]?(n=n.diffAdd(r,this),r=r.dbl()):(r=n.diffAdd(r,this),n=n.dbl());return r},u.prototype.mulAdd=function(){throw new Error("Not supported on Montgomery curve")},u.prototype.jumlAdd=function(){throw new Error("Not supported on Montgomery curve")},u.prototype.eq=function(t){return 0===this.getX().cmp(t.getX())},u.prototype.normalize=function(){return this.x=this.x.redMul(this.z.redInvm()),this.z=this.curve.one,this},u.prototype.getX=function(){return this.normalize(),this.x.fromRed()}},function(t,e,n){"use strict";var r=n(17),i=n(5),a=n(2),o=n(81),s=r.assert;function u(t){this.twisted=1!=(0|t.a),this.mOneA=this.twisted&&-1==(0|t.a),this.extended=this.mOneA,o.call(this,"edwards",t),this.a=new i(t.a,16).umod(this.red.m),this.a=this.a.toRed(this.red),this.c=new i(t.c,16).toRed(this.red),this.c2=this.c.redSqr(),this.d=new i(t.d,16).toRed(this.red),this.dd=this.d.redAdd(this.d),s(!this.twisted||0===this.c.fromRed().cmpn(1)),this.oneC=1==(0|t.c)}function c(t,e,n,r,a){o.BasePoint.call(this,t,"projective"),null===e&&null===n&&null===r?(this.x=this.curve.zero,this.y=this.curve.one,this.z=this.curve.one,this.t=this.curve.zero,this.zOne=!0):(this.x=new i(e,16),this.y=new i(n,16),this.z=r?new i(r,16):this.curve.one,this.t=a&&new i(a,16),this.x.red||(this.x=this.x.toRed(this.curve.red)),this.y.red||(this.y=this.y.toRed(this.curve.red)),this.z.red||(this.z=this.z.toRed(this.curve.red)),this.t&&!this.t.red&&(this.t=this.t.toRed(this.curve.red)),this.zOne=this.z===this.curve.one,this.curve.extended&&!this.t&&(this.t=this.x.redMul(this.y),this.zOne||(this.t=this.t.redMul(this.z.redInvm()))))}a(u,o),t.exports=u,u.prototype._mulA=function(t){return this.mOneA?t.redNeg():this.a.redMul(t)},u.prototype._mulC=function(t){return this.oneC?t:this.c.redMul(t)},u.prototype.jpoint=function(t,e,n,r){return this.point(t,e,n,r)},u.prototype.pointFromX=function(t,e){(t=new i(t,16)).red||(t=t.toRed(this.red));var n=t.redSqr(),r=this.c2.redSub(this.a.redMul(n)),a=this.one.redSub(this.c2.redMul(this.d).redMul(n)),o=r.redMul(a.redInvm()),s=o.redSqrt();if(0!==s.redSqr().redSub(o).cmp(this.zero))throw new Error("invalid point");var u=s.fromRed().isOdd();return(e&&!u||!e&&u)&&(s=s.redNeg()),this.point(t,s)},u.prototype.pointFromY=function(t,e){(t=new i(t,16)).red||(t=t.toRed(this.red));var n=t.redSqr(),r=n.redSub(this.c2),a=n.redMul(this.d).redMul(this.c2).redSub(this.a),o=r.redMul(a.redInvm());if(0===o.cmp(this.zero)){if(e)throw new Error("invalid point");return this.point(this.zero,t)}var s=o.redSqrt();if(0!==s.redSqr().redSub(o).cmp(this.zero))throw new Error("invalid point");return s.fromRed().isOdd()!==e&&(s=s.redNeg()),this.point(s,t)},u.prototype.validate=function(t){if(t.isInfinity())return!0;t.normalize();var e=t.x.redSqr(),n=t.y.redSqr(),r=e.redMul(this.a).redAdd(n),i=this.c2.redMul(this.one.redAdd(this.d.redMul(e).redMul(n)));return 0===r.cmp(i)},a(c,o.BasePoint),u.prototype.pointFromJSON=function(t){return c.fromJSON(this,t)},u.prototype.point=function(t,e,n,r){return new c(this,t,e,n,r)},c.fromJSON=function(t,e){return new c(t,e[0],e[1],e[2])},c.prototype.inspect=function(){return this.isInfinity()?"<EC Point Infinity>":"<EC Point x: "+this.x.fromRed().toString(16,2)+" y: "+this.y.fromRed().toString(16,2)+" z: "+this.z.fromRed().toString(16,2)+">"},c.prototype.isInfinity=function(){return 0===this.x.cmpn(0)&&(0===this.y.cmp(this.z)||this.zOne&&0===this.y.cmp(this.curve.c))},c.prototype._extDbl=function(){var t=this.x.redSqr(),e=this.y.redSqr(),n=this.z.redSqr();n=n.redIAdd(n);var r=this.curve._mulA(t),i=this.x.redAdd(this.y).redSqr().redISub(t).redISub(e),a=r.redAdd(e),o=a.redSub(n),s=r.redSub(e),u=i.redMul(o),c=a.redMul(s),f=i.redMul(s),l=o.redMul(a);return this.curve.point(u,c,l,f)},c.prototype._projDbl=function(){var t,e,n,r=this.x.redAdd(this.y).redSqr(),i=this.x.redSqr(),a=this.y.redSqr();if(this.curve.twisted){var o=(c=this.curve._mulA(i)).redAdd(a);if(this.zOne)t=r.redSub(i).redSub(a).redMul(o.redSub(this.curve.two)),e=o.redMul(c.redSub(a)),n=o.redSqr().redSub(o).redSub(o);else{var s=this.z.redSqr(),u=o.redSub(s).redISub(s);t=r.redSub(i).redISub(a).redMul(u),e=o.redMul(c.redSub(a)),n=o.redMul(u)}}else{var c=i.redAdd(a);s=this.curve._mulC(this.z).redSqr(),u=c.redSub(s).redSub(s);t=this.curve._mulC(r.redISub(c)).redMul(u),e=this.curve._mulC(c).redMul(i.redISub(a)),n=c.redMul(u)}return this.curve.point(t,e,n)},c.prototype.dbl=function(){return this.isInfinity()?this:this.curve.extended?this._extDbl():this._projDbl()},c.prototype._extAdd=function(t){var e=this.y.redSub(this.x).redMul(t.y.redSub(t.x)),n=this.y.redAdd(this.x).redMul(t.y.redAdd(t.x)),r=this.t.redMul(this.curve.dd).redMul(t.t),i=this.z.redMul(t.z.redAdd(t.z)),a=n.redSub(e),o=i.redSub(r),s=i.redAdd(r),u=n.redAdd(e),c=a.redMul(o),f=s.redMul(u),l=a.redMul(u),h=o.redMul(s);return this.curve.point(c,f,h,l)},c.prototype._projAdd=function(t){var e,n,r=this.z.redMul(t.z),i=r.redSqr(),a=this.x.redMul(t.x),o=this.y.redMul(t.y),s=this.curve.d.redMul(a).redMul(o),u=i.redSub(s),c=i.redAdd(s),f=this.x.redAdd(this.y).redMul(t.x.redAdd(t.y)).redISub(a).redISub(o),l=r.redMul(u).redMul(f);return this.curve.twisted?(e=r.redMul(c).redMul(o.redSub(this.curve._mulA(a))),n=u.redMul(c)):(e=r.redMul(c).redMul(o.redSub(a)),n=this.curve._mulC(u).redMul(c)),this.curve.point(l,e,n)},c.prototype.add=function(t){return this.isInfinity()?t:t.isInfinity()?this:this.curve.extended?this._extAdd(t):this._projAdd(t)},c.prototype.mul=function(t){return this._hasDoubles(t)?this.curve._fixedNafMul(this,t):this.curve._wnafMul(this,t)},c.prototype.mulAdd=function(t,e,n){return this.curve._wnafMulAdd(1,[this,e],[t,n],2,!1)},c.prototype.jmulAdd=function(t,e,n){return this.curve._wnafMulAdd(1,[this,e],[t,n],2,!0)},c.prototype.normalize=function(){if(this.zOne)return this;var t=this.z.redInvm();return this.x=this.x.redMul(t),this.y=this.y.redMul(t),this.t&&(this.t=this.t.redMul(t)),this.z=this.curve.one,this.zOne=!0,this},c.prototype.neg=function(){return this.curve.point(this.x.redNeg(),this.y,this.z,this.t&&this.t.redNeg())},c.prototype.getX=function(){return this.normalize(),this.x.fromRed()},c.prototype.getY=function(){return this.normalize(),this.y.fromRed()},c.prototype.eq=function(t){return this===t||0===this.getX().cmp(t.getX())&&0===this.getY().cmp(t.getY())},c.prototype.eqXToP=function(t){var e=t.toRed(this.curve.red).redMul(this.z);if(0===this.x.cmp(e))return!0;for(var n=t.clone(),r=this.curve.redN.redMul(this.z);;){if(n.iadd(this.curve.n),n.cmp(this.curve.p)>=0)return!1;if(e.redIAdd(r),0===this.x.cmp(e))return!0}},c.prototype.toP=c.prototype.normalize,c.prototype.mixedAdd=c.prototype.add},function(t,e,n){"use strict";e.sha1=n(468),e.sha224=n(469),e.sha256=n(218),e.sha384=n(470),e.sha512=n(219)},function(t,e,n){"use strict";var r=n(21),i=n(56),a=n(217),o=r.rotl32,s=r.sum32,u=r.sum32_5,c=a.ft_1,f=i.BlockHash,l=[1518500249,1859775393,2400959708,3395469782];function h(){if(!(this instanceof h))return new h;f.call(this),this.h=[1732584193,4023233417,2562383102,271733878,3285377520],this.W=new Array(80)}r.inherits(h,f),t.exports=h,h.blockSize=512,h.outSize=160,h.hmacStrength=80,h.padLength=64,h.prototype._update=function(t,e){for(var n=this.W,r=0;r<16;r++)n[r]=t[e+r];for(;r<n.length;r++)n[r]=o(n[r-3]^n[r-8]^n[r-14]^n[r-16],1);var i=this.h[0],a=this.h[1],f=this.h[2],h=this.h[3],d=this.h[4];for(r=0;r<n.length;r++){var p=~~(r/20),g=u(o(i,5),c(p,a,f,h),d,n[r],l[p]);d=h,h=f,f=o(a,30),a=i,i=g}this.h[0]=s(this.h[0],i),this.h[1]=s(this.h[1],a),this.h[2]=s(this.h[2],f),this.h[3]=s(this.h[3],h),this.h[4]=s(this.h[4],d)},h.prototype._digest=function(t){return"hex"===t?r.toHex32(this.h,"big"):r.split32(this.h,"big")}},function(t,e,n){"use strict";var r=n(21),i=n(218);function a(){if(!(this instanceof a))return new a;i.call(this),this.h=[3238371032,914150663,812702999,4144912697,4290775857,1750603025,1694076839,3204075428]}r.inherits(a,i),t.exports=a,a.blockSize=512,a.outSize=224,a.hmacStrength=192,a.padLength=64,a.prototype._digest=function(t){return"hex"===t?r.toHex32(this.h.slice(0,7),"big"):r.split32(this.h.slice(0,7),"big")}},function(t,e,n){"use strict";var r=n(21),i=n(219);function a(){if(!(this instanceof a))return new a;i.call(this),this.h=[3418070365,3238371032,1654270250,914150663,2438529370,812702999,355462360,4144912697,1731405415,4290775857,2394180231,1750603025,3675008525,1694076839,1203062813,3204075428]}r.inherits(a,i),t.exports=a,a.blockSize=1024,a.outSize=384,a.hmacStrength=192,a.padLength=128,a.prototype._digest=function(t){return"hex"===t?r.toHex32(this.h.slice(0,12),"big"):r.split32(this.h.slice(0,12),"big")}},function(t,e,n){"use strict";var r=n(21),i=n(56),a=r.rotl32,o=r.sum32,s=r.sum32_3,u=r.sum32_4,c=i.BlockHash;function f(){if(!(this instanceof f))return new f;c.call(this),this.h=[1732584193,4023233417,2562383102,271733878,3285377520],this.endian="little"}function l(t,e,n,r){return t<=15?e^n^r:t<=31?e&n|~e&r:t<=47?(e|~n)^r:t<=63?e&r|n&~r:e^(n|~r)}function h(t){return t<=15?0:t<=31?1518500249:t<=47?1859775393:t<=63?2400959708:2840853838}function d(t){return t<=15?1352829926:t<=31?1548603684:t<=47?1836072691:t<=63?2053994217:0}r.inherits(f,c),e.ripemd160=f,f.blockSize=512,f.outSize=160,f.hmacStrength=192,f.padLength=64,f.prototype._update=function(t,e){for(var n=this.h[0],r=this.h[1],i=this.h[2],c=this.h[3],f=this.h[4],v=n,m=r,_=i,w=c,x=f,k=0;k<80;k++){var E=o(a(u(n,l(k,r,i,c),t[p[k]+e],h(k)),y[k]),f);n=f,f=c,c=a(i,10),i=r,r=E,E=o(a(u(v,l(79-k,m,_,w),t[g[k]+e],d(k)),b[k]),x),v=x,x=w,w=a(_,10),_=m,m=E}E=s(this.h[1],i,w),this.h[1]=s(this.h[2],c,x),this.h[2]=s(this.h[3],f,v),this.h[3]=s(this.h[4],n,m),this.h[4]=s(this.h[0],r,_),this.h[0]=E},f.prototype._digest=function(t){return"hex"===t?r.toHex32(this.h,"little"):r.split32(this.h,"little")};var p=[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,7,4,13,1,10,6,15,3,12,0,9,5,2,14,11,8,3,10,14,4,9,15,8,1,2,7,0,6,13,11,5,12,1,9,11,10,0,8,12,4,13,3,7,15,14,5,6,2,4,0,5,9,7,12,2,10,14,1,3,8,11,6,15,13],g=[5,14,7,0,9,2,11,4,13,6,15,8,1,10,3,12,6,11,3,7,0,13,5,10,14,15,8,12,4,9,1,2,15,5,1,3,7,14,6,9,11,8,12,2,10,0,4,13,8,6,4,1,3,11,15,0,5,12,2,13,9,7,10,14,12,15,10,4,1,5,8,7,6,2,13,14,0,3,9,11],y=[11,14,15,12,5,8,7,9,11,13,14,15,6,7,9,8,7,6,8,13,11,9,7,15,7,12,15,9,11,7,13,12,11,13,6,7,14,9,13,15,14,8,13,6,5,12,7,5,11,12,14,15,14,15,9,8,9,14,5,6,8,6,5,12,9,15,5,11,6,8,13,12,5,12,13,14,11,8,5,6],b=[8,9,9,11,13,15,15,5,7,7,8,11,14,14,12,6,9,13,15,7,12,8,9,11,7,7,12,7,6,15,13,11,9,7,15,11,8,6,6,14,12,13,5,14,13,13,7,5,15,5,8,11,14,14,6,14,6,9,12,9,12,5,15,8,8,5,12,9,12,5,14,6,8,13,6,5,15,13,11,11]},function(t,e,n){"use strict";var r=n(21),i=n(16);function a(t,e,n){if(!(this instanceof a))return new a(t,e,n);this.Hash=t,this.blockSize=t.blockSize/8,this.outSize=t.outSize/8,this.inner=null,this.outer=null,this._init(r.toArray(e,n))}t.exports=a,a.prototype._init=function(t){t.length>this.blockSize&&(t=(new this.Hash).update(t).digest()),i(t.length<=this.blockSize);for(var e=t.length;e<this.blockSize;e++)t.push(0);for(e=0;e<t.length;e++)t[e]^=54;for(this.inner=(new this.Hash).update(t),e=0;e<t.length;e++)t[e]^=106;this.outer=(new this.Hash).update(t)},a.prototype.update=function(t,e){return this.inner.update(t,e),this},a.prototype.digest=function(t){return this.outer.update(this.inner.digest()),this.outer.digest(t)}},function(t,e){t.exports={doubles:{step:4,points:[["e60fce93b59e9ec53011aabc21c23e97b2a31369b87a5ae9c44ee89e2a6dec0a","f7e3507399e595929db99f34f57937101296891e44d23f0be1f32cce69616821"],["8282263212c609d9ea2a6e3e172de238d8c39cabd5ac1ca10646e23fd5f51508","11f8a8098557dfe45e8256e830b60ace62d613ac2f7b17bed31b6eaff6e26caf"],["175e159f728b865a72f99cc6c6fc846de0b93833fd2222ed73fce5b551e5b739","d3506e0d9e3c79eba4ef97a51ff71f5eacb5955add24345c6efa6ffee9fed695"],["363d90d447b00c9c99ceac05b6262ee053441c7e55552ffe526bad8f83ff4640","4e273adfc732221953b445397f3363145b9a89008199ecb62003c7f3bee9de9"],["8b4b5f165df3c2be8c6244b5b745638843e4a781a15bcd1b69f79a55dffdf80c","4aad0a6f68d308b4b3fbd7813ab0da04f9e336546162ee56b3eff0c65fd4fd36"],["723cbaa6e5db996d6bf771c00bd548c7b700dbffa6c0e77bcb6115925232fcda","96e867b5595cc498a921137488824d6e2660a0653779494801dc069d9eb39f5f"],["eebfa4d493bebf98ba5feec812c2d3b50947961237a919839a533eca0e7dd7fa","5d9a8ca3970ef0f269ee7edaf178089d9ae4cdc3a711f712ddfd4fdae1de8999"],["100f44da696e71672791d0a09b7bde459f1215a29b3c03bfefd7835b39a48db0","cdd9e13192a00b772ec8f3300c090666b7ff4a18ff5195ac0fbd5cd62bc65a09"],["e1031be262c7ed1b1dc9227a4a04c017a77f8d4464f3b3852c8acde6e534fd2d","9d7061928940405e6bb6a4176597535af292dd419e1ced79a44f18f29456a00d"],["feea6cae46d55b530ac2839f143bd7ec5cf8b266a41d6af52d5e688d9094696d","e57c6b6c97dce1bab06e4e12bf3ecd5c981c8957cc41442d3155debf18090088"],["da67a91d91049cdcb367be4be6ffca3cfeed657d808583de33fa978bc1ec6cb1","9bacaa35481642bc41f463f7ec9780e5dec7adc508f740a17e9ea8e27a68be1d"],["53904faa0b334cdda6e000935ef22151ec08d0f7bb11069f57545ccc1a37b7c0","5bc087d0bc80106d88c9eccac20d3c1c13999981e14434699dcb096b022771c8"],["8e7bcd0bd35983a7719cca7764ca906779b53a043a9b8bcaeff959f43ad86047","10b7770b2a3da4b3940310420ca9514579e88e2e47fd68b3ea10047e8460372a"],["385eed34c1cdff21e6d0818689b81bde71a7f4f18397e6690a841e1599c43862","283bebc3e8ea23f56701de19e9ebf4576b304eec2086dc8cc0458fe5542e5453"],["6f9d9b803ecf191637c73a4413dfa180fddf84a5947fbc9c606ed86c3fac3a7","7c80c68e603059ba69b8e2a30e45c4d47ea4dd2f5c281002d86890603a842160"],["3322d401243c4e2582a2147c104d6ecbf774d163db0f5e5313b7e0e742d0e6bd","56e70797e9664ef5bfb019bc4ddaf9b72805f63ea2873af624f3a2e96c28b2a0"],["85672c7d2de0b7da2bd1770d89665868741b3f9af7643397721d74d28134ab83","7c481b9b5b43b2eb6374049bfa62c2e5e77f17fcc5298f44c8e3094f790313a6"],["948bf809b1988a46b06c9f1919413b10f9226c60f668832ffd959af60c82a0a","53a562856dcb6646dc6b74c5d1c3418c6d4dff08c97cd2bed4cb7f88d8c8e589"],["6260ce7f461801c34f067ce0f02873a8f1b0e44dfc69752accecd819f38fd8e8","bc2da82b6fa5b571a7f09049776a1ef7ecd292238051c198c1a84e95b2b4ae17"],["e5037de0afc1d8d43d8348414bbf4103043ec8f575bfdc432953cc8d2037fa2d","4571534baa94d3b5f9f98d09fb990bddbd5f5b03ec481f10e0e5dc841d755bda"],["e06372b0f4a207adf5ea905e8f1771b4e7e8dbd1c6a6c5b725866a0ae4fce725","7a908974bce18cfe12a27bb2ad5a488cd7484a7787104870b27034f94eee31dd"],["213c7a715cd5d45358d0bbf9dc0ce02204b10bdde2a3f58540ad6908d0559754","4b6dad0b5ae462507013ad06245ba190bb4850f5f36a7eeddff2c27534b458f2"],["4e7c272a7af4b34e8dbb9352a5419a87e2838c70adc62cddf0cc3a3b08fbd53c","17749c766c9d0b18e16fd09f6def681b530b9614bff7dd33e0b3941817dcaae6"],["fea74e3dbe778b1b10f238ad61686aa5c76e3db2be43057632427e2840fb27b6","6e0568db9b0b13297cf674deccb6af93126b596b973f7b77701d3db7f23cb96f"],["76e64113f677cf0e10a2570d599968d31544e179b760432952c02a4417bdde39","c90ddf8dee4e95cf577066d70681f0d35e2a33d2b56d2032b4b1752d1901ac01"],["c738c56b03b2abe1e8281baa743f8f9a8f7cc643df26cbee3ab150242bcbb891","893fb578951ad2537f718f2eacbfbbbb82314eef7880cfe917e735d9699a84c3"],["d895626548b65b81e264c7637c972877d1d72e5f3a925014372e9f6588f6c14b","febfaa38f2bc7eae728ec60818c340eb03428d632bb067e179363ed75d7d991f"],["b8da94032a957518eb0f6433571e8761ceffc73693e84edd49150a564f676e03","2804dfa44805a1e4d7c99cc9762808b092cc584d95ff3b511488e4e74efdf6e7"],["e80fea14441fb33a7d8adab9475d7fab2019effb5156a792f1a11778e3c0df5d","eed1de7f638e00771e89768ca3ca94472d155e80af322ea9fcb4291b6ac9ec78"],["a301697bdfcd704313ba48e51d567543f2a182031efd6915ddc07bbcc4e16070","7370f91cfb67e4f5081809fa25d40f9b1735dbf7c0a11a130c0d1a041e177ea1"],["90ad85b389d6b936463f9d0512678de208cc330b11307fffab7ac63e3fb04ed4","e507a3620a38261affdcbd9427222b839aefabe1582894d991d4d48cb6ef150"],["8f68b9d2f63b5f339239c1ad981f162ee88c5678723ea3351b7b444c9ec4c0da","662a9f2dba063986de1d90c2b6be215dbbea2cfe95510bfdf23cbf79501fff82"],["e4f3fb0176af85d65ff99ff9198c36091f48e86503681e3e6686fd5053231e11","1e63633ad0ef4f1c1661a6d0ea02b7286cc7e74ec951d1c9822c38576feb73bc"],["8c00fa9b18ebf331eb961537a45a4266c7034f2f0d4e1d0716fb6eae20eae29e","efa47267fea521a1a9dc343a3736c974c2fadafa81e36c54e7d2a4c66702414b"],["e7a26ce69dd4829f3e10cec0a9e98ed3143d084f308b92c0997fddfc60cb3e41","2a758e300fa7984b471b006a1aafbb18d0a6b2c0420e83e20e8a9421cf2cfd51"],["b6459e0ee3662ec8d23540c223bcbdc571cbcb967d79424f3cf29eb3de6b80ef","67c876d06f3e06de1dadf16e5661db3c4b3ae6d48e35b2ff30bf0b61a71ba45"],["d68a80c8280bb840793234aa118f06231d6f1fc67e73c5a5deda0f5b496943e8","db8ba9fff4b586d00c4b1f9177b0e28b5b0e7b8f7845295a294c84266b133120"],["324aed7df65c804252dc0270907a30b09612aeb973449cea4095980fc28d3d5d","648a365774b61f2ff130c0c35aec1f4f19213b0c7e332843967224af96ab7c84"],["4df9c14919cde61f6d51dfdbe5fee5dceec4143ba8d1ca888e8bd373fd054c96","35ec51092d8728050974c23a1d85d4b5d506cdc288490192ebac06cad10d5d"],["9c3919a84a474870faed8a9c1cc66021523489054d7f0308cbfc99c8ac1f98cd","ddb84f0f4a4ddd57584f044bf260e641905326f76c64c8e6be7e5e03d4fc599d"],["6057170b1dd12fdf8de05f281d8e06bb91e1493a8b91d4cc5a21382120a959e5","9a1af0b26a6a4807add9a2daf71df262465152bc3ee24c65e899be932385a2a8"],["a576df8e23a08411421439a4518da31880cef0fba7d4df12b1a6973eecb94266","40a6bf20e76640b2c92b97afe58cd82c432e10a7f514d9f3ee8be11ae1b28ec8"],["7778a78c28dec3e30a05fe9629de8c38bb30d1f5cf9a3a208f763889be58ad71","34626d9ab5a5b22ff7098e12f2ff580087b38411ff24ac563b513fc1fd9f43ac"],["928955ee637a84463729fd30e7afd2ed5f96274e5ad7e5cb09eda9c06d903ac","c25621003d3f42a827b78a13093a95eeac3d26efa8a8d83fc5180e935bcd091f"],["85d0fef3ec6db109399064f3a0e3b2855645b4a907ad354527aae75163d82751","1f03648413a38c0be29d496e582cf5663e8751e96877331582c237a24eb1f962"],["ff2b0dce97eece97c1c9b6041798b85dfdfb6d8882da20308f5404824526087e","493d13fef524ba188af4c4dc54d07936c7b7ed6fb90e2ceb2c951e01f0c29907"],["827fbbe4b1e880ea9ed2b2e6301b212b57f1ee148cd6dd28780e5e2cf856e241","c60f9c923c727b0b71bef2c67d1d12687ff7a63186903166d605b68baec293ec"],["eaa649f21f51bdbae7be4ae34ce6e5217a58fdce7f47f9aa7f3b58fa2120e2b3","be3279ed5bbbb03ac69a80f89879aa5a01a6b965f13f7e59d47a5305ba5ad93d"],["e4a42d43c5cf169d9391df6decf42ee541b6d8f0c9a137401e23632dda34d24f","4d9f92e716d1c73526fc99ccfb8ad34ce886eedfa8d8e4f13a7f7131deba9414"],["1ec80fef360cbdd954160fadab352b6b92b53576a88fea4947173b9d4300bf19","aeefe93756b5340d2f3a4958a7abbf5e0146e77f6295a07b671cdc1cc107cefd"],["146a778c04670c2f91b00af4680dfa8bce3490717d58ba889ddb5928366642be","b318e0ec3354028add669827f9d4b2870aaa971d2f7e5ed1d0b297483d83efd0"],["fa50c0f61d22e5f07e3acebb1aa07b128d0012209a28b9776d76a8793180eef9","6b84c6922397eba9b72cd2872281a68a5e683293a57a213b38cd8d7d3f4f2811"],["da1d61d0ca721a11b1a5bf6b7d88e8421a288ab5d5bba5220e53d32b5f067ec2","8157f55a7c99306c79c0766161c91e2966a73899d279b48a655fba0f1ad836f1"],["a8e282ff0c9706907215ff98e8fd416615311de0446f1e062a73b0610d064e13","7f97355b8db81c09abfb7f3c5b2515888b679a3e50dd6bd6cef7c73111f4cc0c"],["174a53b9c9a285872d39e56e6913cab15d59b1fa512508c022f382de8319497c","ccc9dc37abfc9c1657b4155f2c47f9e6646b3a1d8cb9854383da13ac079afa73"],["959396981943785c3d3e57edf5018cdbe039e730e4918b3d884fdff09475b7ba","2e7e552888c331dd8ba0386a4b9cd6849c653f64c8709385e9b8abf87524f2fd"],["d2a63a50ae401e56d645a1153b109a8fcca0a43d561fba2dbb51340c9d82b151","e82d86fb6443fcb7565aee58b2948220a70f750af484ca52d4142174dcf89405"],["64587e2335471eb890ee7896d7cfdc866bacbdbd3839317b3436f9b45617e073","d99fcdd5bf6902e2ae96dd6447c299a185b90a39133aeab358299e5e9faf6589"],["8481bde0e4e4d885b3a546d3e549de042f0aa6cea250e7fd358d6c86dd45e458","38ee7b8cba5404dd84a25bf39cecb2ca900a79c42b262e556d64b1b59779057e"],["13464a57a78102aa62b6979ae817f4637ffcfed3c4b1ce30bcd6303f6caf666b","69be159004614580ef7e433453ccb0ca48f300a81d0942e13f495a907f6ecc27"],["bc4a9df5b713fe2e9aef430bcc1dc97a0cd9ccede2f28588cada3a0d2d83f366","d3a81ca6e785c06383937adf4b798caa6e8a9fbfa547b16d758d666581f33c1"],["8c28a97bf8298bc0d23d8c749452a32e694b65e30a9472a3954ab30fe5324caa","40a30463a3305193378fedf31f7cc0eb7ae784f0451cb9459e71dc73cbef9482"],["8ea9666139527a8c1dd94ce4f071fd23c8b350c5a4bb33748c4ba111faccae0","620efabbc8ee2782e24e7c0cfb95c5d735b783be9cf0f8e955af34a30e62b945"],["dd3625faef5ba06074669716bbd3788d89bdde815959968092f76cc4eb9a9787","7a188fa3520e30d461da2501045731ca941461982883395937f68d00c644a573"],["f710d79d9eb962297e4f6232b40e8f7feb2bc63814614d692c12de752408221e","ea98e67232d3b3295d3b535532115ccac8612c721851617526ae47a9c77bfc82"]]},naf:{wnd:7,points:[["f9308a019258c31049344f85f89d5229b531c845836f99b08601f113bce036f9","388f7b0f632de8140fe337e62a37f3566500a99934c2231b6cb9fd7584b8e672"],["2f8bde4d1a07209355b4a7250a5c5128e88b84bddc619ab7cba8d569b240efe4","d8ac222636e5e3d6d4dba9dda6c9c426f788271bab0d6840dca87d3aa6ac62d6"],["5cbdf0646e5db4eaa398f365f2ea7a0e3d419b7e0330e39ce92bddedcac4f9bc","6aebca40ba255960a3178d6d861a54dba813d0b813fde7b5a5082628087264da"],["acd484e2f0c7f65309ad178a9f559abde09796974c57e714c35f110dfc27ccbe","cc338921b0a7d9fd64380971763b61e9add888a4375f8e0f05cc262ac64f9c37"],["774ae7f858a9411e5ef4246b70c65aac5649980be5c17891bbec17895da008cb","d984a032eb6b5e190243dd56d7b7b365372db1e2dff9d6a8301d74c9c953c61b"],["f28773c2d975288bc7d1d205c3748651b075fbc6610e58cddeeddf8f19405aa8","ab0902e8d880a89758212eb65cdaf473a1a06da521fa91f29b5cb52db03ed81"],["d7924d4f7d43ea965a465ae3095ff41131e5946f3c85f79e44adbcf8e27e080e","581e2872a86c72a683842ec228cc6defea40af2bd896d3a5c504dc9ff6a26b58"],["defdea4cdb677750a420fee807eacf21eb9898ae79b9768766e4faa04a2d4a34","4211ab0694635168e997b0ead2a93daeced1f4a04a95c0f6cfb199f69e56eb77"],["2b4ea0a797a443d293ef5cff444f4979f06acfebd7e86d277475656138385b6c","85e89bc037945d93b343083b5a1c86131a01f60c50269763b570c854e5c09b7a"],["352bbf4a4cdd12564f93fa332ce333301d9ad40271f8107181340aef25be59d5","321eb4075348f534d59c18259dda3e1f4a1b3b2e71b1039c67bd3d8bcf81998c"],["2fa2104d6b38d11b0230010559879124e42ab8dfeff5ff29dc9cdadd4ecacc3f","2de1068295dd865b64569335bd5dd80181d70ecfc882648423ba76b532b7d67"],["9248279b09b4d68dab21a9b066edda83263c3d84e09572e269ca0cd7f5453714","73016f7bf234aade5d1aa71bdea2b1ff3fc0de2a887912ffe54a32ce97cb3402"],["daed4f2be3a8bf278e70132fb0beb7522f570e144bf615c07e996d443dee8729","a69dce4a7d6c98e8d4a1aca87ef8d7003f83c230f3afa726ab40e52290be1c55"],["c44d12c7065d812e8acf28d7cbb19f9011ecd9e9fdf281b0e6a3b5e87d22e7db","2119a460ce326cdc76c45926c982fdac0e106e861edf61c5a039063f0e0e6482"],["6a245bf6dc698504c89a20cfded60853152b695336c28063b61c65cbd269e6b4","e022cf42c2bd4a708b3f5126f16a24ad8b33ba48d0423b6efd5e6348100d8a82"],["1697ffa6fd9de627c077e3d2fe541084ce13300b0bec1146f95ae57f0d0bd6a5","b9c398f186806f5d27561506e4557433a2cf15009e498ae7adee9d63d01b2396"],["605bdb019981718b986d0f07e834cb0d9deb8360ffb7f61df982345ef27a7479","2972d2de4f8d20681a78d93ec96fe23c26bfae84fb14db43b01e1e9056b8c49"],["62d14dab4150bf497402fdc45a215e10dcb01c354959b10cfe31c7e9d87ff33d","80fc06bd8cc5b01098088a1950eed0db01aa132967ab472235f5642483b25eaf"],["80c60ad0040f27dade5b4b06c408e56b2c50e9f56b9b8b425e555c2f86308b6f","1c38303f1cc5c30f26e66bad7fe72f70a65eed4cbe7024eb1aa01f56430bd57a"],["7a9375ad6167ad54aa74c6348cc54d344cc5dc9487d847049d5eabb0fa03c8fb","d0e3fa9eca8726909559e0d79269046bdc59ea10c70ce2b02d499ec224dc7f7"],["d528ecd9b696b54c907a9ed045447a79bb408ec39b68df504bb51f459bc3ffc9","eecf41253136e5f99966f21881fd656ebc4345405c520dbc063465b521409933"],["49370a4b5f43412ea25f514e8ecdad05266115e4a7ecb1387231808f8b45963","758f3f41afd6ed428b3081b0512fd62a54c3f3afbb5b6764b653052a12949c9a"],["77f230936ee88cbbd73df930d64702ef881d811e0e1498e2f1c13eb1fc345d74","958ef42a7886b6400a08266e9ba1b37896c95330d97077cbbe8eb3c7671c60d6"],["f2dac991cc4ce4b9ea44887e5c7c0bce58c80074ab9d4dbaeb28531b7739f530","e0dedc9b3b2f8dad4da1f32dec2531df9eb5fbeb0598e4fd1a117dba703a3c37"],["463b3d9f662621fb1b4be8fbbe2520125a216cdfc9dae3debcba4850c690d45b","5ed430d78c296c3543114306dd8622d7c622e27c970a1de31cb377b01af7307e"],["f16f804244e46e2a09232d4aff3b59976b98fac14328a2d1a32496b49998f247","cedabd9b82203f7e13d206fcdf4e33d92a6c53c26e5cce26d6579962c4e31df6"],["caf754272dc84563b0352b7a14311af55d245315ace27c65369e15f7151d41d1","cb474660ef35f5f2a41b643fa5e460575f4fa9b7962232a5c32f908318a04476"],["2600ca4b282cb986f85d0f1709979d8b44a09c07cb86d7c124497bc86f082120","4119b88753c15bd6a693b03fcddbb45d5ac6be74ab5f0ef44b0be9475a7e4b40"],["7635ca72d7e8432c338ec53cd12220bc01c48685e24f7dc8c602a7746998e435","91b649609489d613d1d5e590f78e6d74ecfc061d57048bad9e76f302c5b9c61"],["754e3239f325570cdbbf4a87deee8a66b7f2b33479d468fbc1a50743bf56cc18","673fb86e5bda30fb3cd0ed304ea49a023ee33d0197a695d0c5d98093c536683"],["e3e6bd1071a1e96aff57859c82d570f0330800661d1c952f9fe2694691d9b9e8","59c9e0bba394e76f40c0aa58379a3cb6a5a2283993e90c4167002af4920e37f5"],["186b483d056a033826ae73d88f732985c4ccb1f32ba35f4b4cc47fdcf04aa6eb","3b952d32c67cf77e2e17446e204180ab21fb8090895138b4a4a797f86e80888b"],["df9d70a6b9876ce544c98561f4be4f725442e6d2b737d9c91a8321724ce0963f","55eb2dafd84d6ccd5f862b785dc39d4ab157222720ef9da217b8c45cf2ba2417"],["5edd5cc23c51e87a497ca815d5dce0f8ab52554f849ed8995de64c5f34ce7143","efae9c8dbc14130661e8cec030c89ad0c13c66c0d17a2905cdc706ab7399a868"],["290798c2b6476830da12fe02287e9e777aa3fba1c355b17a722d362f84614fba","e38da76dcd440621988d00bcf79af25d5b29c094db2a23146d003afd41943e7a"],["af3c423a95d9f5b3054754efa150ac39cd29552fe360257362dfdecef4053b45","f98a3fd831eb2b749a93b0e6f35cfb40c8cd5aa667a15581bc2feded498fd9c6"],["766dbb24d134e745cccaa28c99bf274906bb66b26dcf98df8d2fed50d884249a","744b1152eacbe5e38dcc887980da38b897584a65fa06cedd2c924f97cbac5996"],["59dbf46f8c94759ba21277c33784f41645f7b44f6c596a58ce92e666191abe3e","c534ad44175fbc300f4ea6ce648309a042ce739a7919798cd85e216c4a307f6e"],["f13ada95103c4537305e691e74e9a4a8dd647e711a95e73cb62dc6018cfd87b8","e13817b44ee14de663bf4bc808341f326949e21a6a75c2570778419bdaf5733d"],["7754b4fa0e8aced06d4167a2c59cca4cda1869c06ebadfb6488550015a88522c","30e93e864e669d82224b967c3020b8fa8d1e4e350b6cbcc537a48b57841163a2"],["948dcadf5990e048aa3874d46abef9d701858f95de8041d2a6828c99e2262519","e491a42537f6e597d5d28a3224b1bc25df9154efbd2ef1d2cbba2cae5347d57e"],["7962414450c76c1689c7b48f8202ec37fb224cf5ac0bfa1570328a8a3d7c77ab","100b610ec4ffb4760d5c1fc133ef6f6b12507a051f04ac5760afa5b29db83437"],["3514087834964b54b15b160644d915485a16977225b8847bb0dd085137ec47ca","ef0afbb2056205448e1652c48e8127fc6039e77c15c2378b7e7d15a0de293311"],["d3cc30ad6b483e4bc79ce2c9dd8bc54993e947eb8df787b442943d3f7b527eaf","8b378a22d827278d89c5e9be8f9508ae3c2ad46290358630afb34db04eede0a4"],["1624d84780732860ce1c78fcbfefe08b2b29823db913f6493975ba0ff4847610","68651cf9b6da903e0914448c6cd9d4ca896878f5282be4c8cc06e2a404078575"],["733ce80da955a8a26902c95633e62a985192474b5af207da6df7b4fd5fc61cd4","f5435a2bd2badf7d485a4d8b8db9fcce3e1ef8e0201e4578c54673bc1dc5ea1d"],["15d9441254945064cf1a1c33bbd3b49f8966c5092171e699ef258dfab81c045c","d56eb30b69463e7234f5137b73b84177434800bacebfc685fc37bbe9efe4070d"],["a1d0fcf2ec9de675b612136e5ce70d271c21417c9d2b8aaaac138599d0717940","edd77f50bcb5a3cab2e90737309667f2641462a54070f3d519212d39c197a629"],["e22fbe15c0af8ccc5780c0735f84dbe9a790badee8245c06c7ca37331cb36980","a855babad5cd60c88b430a69f53a1a7a38289154964799be43d06d77d31da06"],["311091dd9860e8e20ee13473c1155f5f69635e394704eaa74009452246cfa9b3","66db656f87d1f04fffd1f04788c06830871ec5a64feee685bd80f0b1286d8374"],["34c1fd04d301be89b31c0442d3e6ac24883928b45a9340781867d4232ec2dbdf","9414685e97b1b5954bd46f730174136d57f1ceeb487443dc5321857ba73abee"],["f219ea5d6b54701c1c14de5b557eb42a8d13f3abbcd08affcc2a5e6b049b8d63","4cb95957e83d40b0f73af4544cccf6b1f4b08d3c07b27fb8d8c2962a400766d1"],["d7b8740f74a8fbaab1f683db8f45de26543a5490bca627087236912469a0b448","fa77968128d9c92ee1010f337ad4717eff15db5ed3c049b3411e0315eaa4593b"],["32d31c222f8f6f0ef86f7c98d3a3335ead5bcd32abdd94289fe4d3091aa824bf","5f3032f5892156e39ccd3d7915b9e1da2e6dac9e6f26e961118d14b8462e1661"],["7461f371914ab32671045a155d9831ea8793d77cd59592c4340f86cbc18347b5","8ec0ba238b96bec0cbdddcae0aa442542eee1ff50c986ea6b39847b3cc092ff6"],["ee079adb1df1860074356a25aa38206a6d716b2c3e67453d287698bad7b2b2d6","8dc2412aafe3be5c4c5f37e0ecc5f9f6a446989af04c4e25ebaac479ec1c8c1e"],["16ec93e447ec83f0467b18302ee620f7e65de331874c9dc72bfd8616ba9da6b5","5e4631150e62fb40d0e8c2a7ca5804a39d58186a50e497139626778e25b0674d"],["eaa5f980c245f6f038978290afa70b6bd8855897f98b6aa485b96065d537bd99","f65f5d3e292c2e0819a528391c994624d784869d7e6ea67fb18041024edc07dc"],["78c9407544ac132692ee1910a02439958ae04877151342ea96c4b6b35a49f51","f3e0319169eb9b85d5404795539a5e68fa1fbd583c064d2462b675f194a3ddb4"],["494f4be219a1a77016dcd838431aea0001cdc8ae7a6fc688726578d9702857a5","42242a969283a5f339ba7f075e36ba2af925ce30d767ed6e55f4b031880d562c"],["a598a8030da6d86c6bc7f2f5144ea549d28211ea58faa70ebf4c1e665c1fe9b5","204b5d6f84822c307e4b4a7140737aec23fc63b65b35f86a10026dbd2d864e6b"],["c41916365abb2b5d09192f5f2dbeafec208f020f12570a184dbadc3e58595997","4f14351d0087efa49d245b328984989d5caf9450f34bfc0ed16e96b58fa9913"],["841d6063a586fa475a724604da03bc5b92a2e0d2e0a36acfe4c73a5514742881","73867f59c0659e81904f9a1c7543698e62562d6744c169ce7a36de01a8d6154"],["5e95bb399a6971d376026947f89bde2f282b33810928be4ded112ac4d70e20d5","39f23f366809085beebfc71181313775a99c9aed7d8ba38b161384c746012865"],["36e4641a53948fd476c39f8a99fd974e5ec07564b5315d8bf99471bca0ef2f66","d2424b1b1abe4eb8164227b085c9aa9456ea13493fd563e06fd51cf5694c78fc"],["336581ea7bfbbb290c191a2f507a41cf5643842170e914faeab27c2c579f726","ead12168595fe1be99252129b6e56b3391f7ab1410cd1e0ef3dcdcabd2fda224"],["8ab89816dadfd6b6a1f2634fcf00ec8403781025ed6890c4849742706bd43ede","6fdcef09f2f6d0a044e654aef624136f503d459c3e89845858a47a9129cdd24e"],["1e33f1a746c9c5778133344d9299fcaa20b0938e8acff2544bb40284b8c5fb94","60660257dd11b3aa9c8ed618d24edff2306d320f1d03010e33a7d2057f3b3b6"],["85b7c1dcb3cec1b7ee7f30ded79dd20a0ed1f4cc18cbcfcfa410361fd8f08f31","3d98a9cdd026dd43f39048f25a8847f4fcafad1895d7a633c6fed3c35e999511"],["29df9fbd8d9e46509275f4b125d6d45d7fbe9a3b878a7af872a2800661ac5f51","b4c4fe99c775a606e2d8862179139ffda61dc861c019e55cd2876eb2a27d84b"],["a0b1cae06b0a847a3fea6e671aaf8adfdfe58ca2f768105c8082b2e449fce252","ae434102edde0958ec4b19d917a6a28e6b72da1834aff0e650f049503a296cf2"],["4e8ceafb9b3e9a136dc7ff67e840295b499dfb3b2133e4ba113f2e4c0e121e5","cf2174118c8b6d7a4b48f6d534ce5c79422c086a63460502b827ce62a326683c"],["d24a44e047e19b6f5afb81c7ca2f69080a5076689a010919f42725c2b789a33b","6fb8d5591b466f8fc63db50f1c0f1c69013f996887b8244d2cdec417afea8fa3"],["ea01606a7a6c9cdd249fdfcfacb99584001edd28abbab77b5104e98e8e3b35d4","322af4908c7312b0cfbfe369f7a7b3cdb7d4494bc2823700cfd652188a3ea98d"],["af8addbf2b661c8a6c6328655eb96651252007d8c5ea31be4ad196de8ce2131f","6749e67c029b85f52a034eafd096836b2520818680e26ac8f3dfbcdb71749700"],["e3ae1974566ca06cc516d47e0fb165a674a3dabcfca15e722f0e3450f45889","2aeabe7e4531510116217f07bf4d07300de97e4874f81f533420a72eeb0bd6a4"],["591ee355313d99721cf6993ffed1e3e301993ff3ed258802075ea8ced397e246","b0ea558a113c30bea60fc4775460c7901ff0b053d25ca2bdeee98f1a4be5d196"],["11396d55fda54c49f19aa97318d8da61fa8584e47b084945077cf03255b52984","998c74a8cd45ac01289d5833a7beb4744ff536b01b257be4c5767bea93ea57a4"],["3c5d2a1ba39c5a1790000738c9e0c40b8dcdfd5468754b6405540157e017aa7a","b2284279995a34e2f9d4de7396fc18b80f9b8b9fdd270f6661f79ca4c81bd257"],["cc8704b8a60a0defa3a99a7299f2e9c3fbc395afb04ac078425ef8a1793cc030","bdd46039feed17881d1e0862db347f8cf395b74fc4bcdc4e940b74e3ac1f1b13"],["c533e4f7ea8555aacd9777ac5cad29b97dd4defccc53ee7ea204119b2889b197","6f0a256bc5efdf429a2fb6242f1a43a2d9b925bb4a4b3a26bb8e0f45eb596096"],["c14f8f2ccb27d6f109f6d08d03cc96a69ba8c34eec07bbcf566d48e33da6593","c359d6923bb398f7fd4473e16fe1c28475b740dd098075e6c0e8649113dc3a38"],["a6cbc3046bc6a450bac24789fa17115a4c9739ed75f8f21ce441f72e0b90e6ef","21ae7f4680e889bb130619e2c0f95a360ceb573c70603139862afd617fa9b9f"],["347d6d9a02c48927ebfb86c1359b1caf130a3c0267d11ce6344b39f99d43cc38","60ea7f61a353524d1c987f6ecec92f086d565ab687870cb12689ff1e31c74448"],["da6545d2181db8d983f7dcb375ef5866d47c67b1bf31c8cf855ef7437b72656a","49b96715ab6878a79e78f07ce5680c5d6673051b4935bd897fea824b77dc208a"],["c40747cc9d012cb1a13b8148309c6de7ec25d6945d657146b9d5994b8feb1111","5ca560753be2a12fc6de6caf2cb489565db936156b9514e1bb5e83037e0fa2d4"],["4e42c8ec82c99798ccf3a610be870e78338c7f713348bd34c8203ef4037f3502","7571d74ee5e0fb92a7a8b33a07783341a5492144cc54bcc40a94473693606437"],["3775ab7089bc6af823aba2e1af70b236d251cadb0c86743287522a1b3b0dedea","be52d107bcfa09d8bcb9736a828cfa7fac8db17bf7a76a2c42ad961409018cf7"],["cee31cbf7e34ec379d94fb814d3d775ad954595d1314ba8846959e3e82f74e26","8fd64a14c06b589c26b947ae2bcf6bfa0149ef0be14ed4d80f448a01c43b1c6d"],["b4f9eaea09b6917619f6ea6a4eb5464efddb58fd45b1ebefcdc1a01d08b47986","39e5c9925b5a54b07433a4f18c61726f8bb131c012ca542eb24a8ac07200682a"],["d4263dfc3d2df923a0179a48966d30ce84e2515afc3dccc1b77907792ebcc60e","62dfaf07a0f78feb30e30d6295853ce189e127760ad6cf7fae164e122a208d54"],["48457524820fa65a4f8d35eb6930857c0032acc0a4a2de422233eeda897612c4","25a748ab367979d98733c38a1fa1c2e7dc6cc07db2d60a9ae7a76aaa49bd0f77"],["dfeeef1881101f2cb11644f3a2afdfc2045e19919152923f367a1767c11cceda","ecfb7056cf1de042f9420bab396793c0c390bde74b4bbdff16a83ae09a9a7517"],["6d7ef6b17543f8373c573f44e1f389835d89bcbc6062ced36c82df83b8fae859","cd450ec335438986dfefa10c57fea9bcc521a0959b2d80bbf74b190dca712d10"],["e75605d59102a5a2684500d3b991f2e3f3c88b93225547035af25af66e04541f","f5c54754a8f71ee540b9b48728473e314f729ac5308b06938360990e2bfad125"],["eb98660f4c4dfaa06a2be453d5020bc99a0c2e60abe388457dd43fefb1ed620c","6cb9a8876d9cb8520609af3add26cd20a0a7cd8a9411131ce85f44100099223e"],["13e87b027d8514d35939f2e6892b19922154596941888336dc3563e3b8dba942","fef5a3c68059a6dec5d624114bf1e91aac2b9da568d6abeb2570d55646b8adf1"],["ee163026e9fd6fe017c38f06a5be6fc125424b371ce2708e7bf4491691e5764a","1acb250f255dd61c43d94ccc670d0f58f49ae3fa15b96623e5430da0ad6c62b2"],["b268f5ef9ad51e4d78de3a750c2dc89b1e626d43505867999932e5db33af3d80","5f310d4b3c99b9ebb19f77d41c1dee018cf0d34fd4191614003e945a1216e423"],["ff07f3118a9df035e9fad85eb6c7bfe42b02f01ca99ceea3bf7ffdba93c4750d","438136d603e858a3a5c440c38eccbaddc1d2942114e2eddd4740d098ced1f0d8"],["8d8b9855c7c052a34146fd20ffb658bea4b9f69e0d825ebec16e8c3ce2b526a1","cdb559eedc2d79f926baf44fb84ea4d44bcf50fee51d7ceb30e2e7f463036758"],["52db0b5384dfbf05bfa9d472d7ae26dfe4b851ceca91b1eba54263180da32b63","c3b997d050ee5d423ebaf66a6db9f57b3180c902875679de924b69d84a7b375"],["e62f9490d3d51da6395efd24e80919cc7d0f29c3f3fa48c6fff543becbd43352","6d89ad7ba4876b0b22c2ca280c682862f342c8591f1daf5170e07bfd9ccafa7d"],["7f30ea2476b399b4957509c88f77d0191afa2ff5cb7b14fd6d8e7d65aaab1193","ca5ef7d4b231c94c3b15389a5f6311e9daff7bb67b103e9880ef4bff637acaec"],["5098ff1e1d9f14fb46a210fada6c903fef0fb7b4a1dd1d9ac60a0361800b7a00","9731141d81fc8f8084d37c6e7542006b3ee1b40d60dfe5362a5b132fd17ddc0"],["32b78c7de9ee512a72895be6b9cbefa6e2f3c4ccce445c96b9f2c81e2778ad58","ee1849f513df71e32efc3896ee28260c73bb80547ae2275ba497237794c8753c"],["e2cb74fddc8e9fbcd076eef2a7c72b0ce37d50f08269dfc074b581550547a4f7","d3aa2ed71c9dd2247a62df062736eb0baddea9e36122d2be8641abcb005cc4a4"],["8438447566d4d7bedadc299496ab357426009a35f235cb141be0d99cd10ae3a8","c4e1020916980a4da5d01ac5e6ad330734ef0d7906631c4f2390426b2edd791f"],["4162d488b89402039b584c6fc6c308870587d9c46f660b878ab65c82c711d67e","67163e903236289f776f22c25fb8a3afc1732f2b84b4e95dbda47ae5a0852649"],["3fad3fa84caf0f34f0f89bfd2dcf54fc175d767aec3e50684f3ba4a4bf5f683d","cd1bc7cb6cc407bb2f0ca647c718a730cf71872e7d0d2a53fa20efcdfe61826"],["674f2600a3007a00568c1a7ce05d0816c1fb84bf1370798f1c69532faeb1a86b","299d21f9413f33b3edf43b257004580b70db57da0b182259e09eecc69e0d38a5"],["d32f4da54ade74abb81b815ad1fb3b263d82d6c692714bcff87d29bd5ee9f08f","f9429e738b8e53b968e99016c059707782e14f4535359d582fc416910b3eea87"],["30e4e670435385556e593657135845d36fbb6931f72b08cb1ed954f1e3ce3ff6","462f9bce619898638499350113bbc9b10a878d35da70740dc695a559eb88db7b"],["be2062003c51cc3004682904330e4dee7f3dcd10b01e580bf1971b04d4cad297","62188bc49d61e5428573d48a74e1c655b1c61090905682a0d5558ed72dccb9bc"],["93144423ace3451ed29e0fb9ac2af211cb6e84a601df5993c419859fff5df04a","7c10dfb164c3425f5c71a3f9d7992038f1065224f72bb9d1d902a6d13037b47c"],["b015f8044f5fcbdcf21ca26d6c34fb8197829205c7b7d2a7cb66418c157b112c","ab8c1e086d04e813744a655b2df8d5f83b3cdc6faa3088c1d3aea1454e3a1d5f"],["d5e9e1da649d97d89e4868117a465a3a4f8a18de57a140d36b3f2af341a21b52","4cb04437f391ed73111a13cc1d4dd0db1693465c2240480d8955e8592f27447a"],["d3ae41047dd7ca065dbf8ed77b992439983005cd72e16d6f996a5316d36966bb","bd1aeb21ad22ebb22a10f0303417c6d964f8cdd7df0aca614b10dc14d125ac46"],["463e2763d885f958fc66cdd22800f0a487197d0a82e377b49f80af87c897b065","bfefacdb0e5d0fd7df3a311a94de062b26b80c61fbc97508b79992671ef7ca7f"],["7985fdfd127c0567c6f53ec1bb63ec3158e597c40bfe747c83cddfc910641917","603c12daf3d9862ef2b25fe1de289aed24ed291e0ec6708703a5bd567f32ed03"],["74a1ad6b5f76e39db2dd249410eac7f99e74c59cb83d2d0ed5ff1543da7703e9","cc6157ef18c9c63cd6193d83631bbea0093e0968942e8c33d5737fd790e0db08"],["30682a50703375f602d416664ba19b7fc9bab42c72747463a71d0896b22f6da3","553e04f6b018b4fa6c8f39e7f311d3176290d0e0f19ca73f17714d9977a22ff8"],["9e2158f0d7c0d5f26c3791efefa79597654e7a2b2464f52b1ee6c1347769ef57","712fcdd1b9053f09003a3481fa7762e9ffd7c8ef35a38509e2fbf2629008373"],["176e26989a43c9cfeba4029c202538c28172e566e3c4fce7322857f3be327d66","ed8cc9d04b29eb877d270b4878dc43c19aefd31f4eee09ee7b47834c1fa4b1c3"],["75d46efea3771e6e68abb89a13ad747ecf1892393dfc4f1b7004788c50374da8","9852390a99507679fd0b86fd2b39a868d7efc22151346e1a3ca4726586a6bed8"],["809a20c67d64900ffb698c4c825f6d5f2310fb0451c869345b7319f645605721","9e994980d9917e22b76b061927fa04143d096ccc54963e6a5ebfa5f3f8e286c1"],["1b38903a43f7f114ed4500b4eac7083fdefece1cf29c63528d563446f972c180","4036edc931a60ae889353f77fd53de4a2708b26b6f5da72ad3394119daf408f9"]]}}},function(t,e,n){"use strict";var r=n(5),i=n(475),a=n(17),o=n(126),s=n(123),u=a.assert,c=n(476),f=n(477);function l(t){if(!(this instanceof l))return new l(t);"string"==typeof t&&(u(o.hasOwnProperty(t),"Unknown curve "+t),t=o[t]),t instanceof o.PresetCurve&&(t={curve:t}),this.curve=t.curve.curve,this.n=this.curve.n,this.nh=this.n.ushrn(1),this.g=this.curve.g,this.g=t.curve.g,this.g.precompute(t.curve.n.bitLength()+1),this.hash=t.hash||t.curve.hash}t.exports=l,l.prototype.keyPair=function(t){return new c(this,t)},l.prototype.keyFromPrivate=function(t,e){return c.fromPrivate(this,t,e)},l.prototype.keyFromPublic=function(t,e){return c.fromPublic(this,t,e)},l.prototype.genKeyPair=function(t){t||(t={});for(var e=new i({hash:this.hash,pers:t.pers,persEnc:t.persEnc||"utf8",entropy:t.entropy||s(this.hash.hmacStrength),entropyEnc:t.entropy&&t.entropyEnc||"utf8",nonce:this.n.toArray()}),n=this.n.byteLength(),a=this.n.sub(new r(2));;){var o=new r(e.generate(n));if(!(o.cmp(a)>0))return o.iaddn(1),this.keyFromPrivate(o)}},l.prototype._truncateToN=function(t,e){var n=8*t.byteLength()-this.n.bitLength();return n>0&&(t=t.ushrn(n)),!e&&t.cmp(this.n)>=0?t.sub(this.n):t},l.prototype.sign=function(t,e,n,a){"object"==typeof n&&(a=n,n=null),a||(a={}),e=this.keyFromPrivate(e,n),t=this._truncateToN(new r(t,16));for(var o=this.n.byteLength(),s=e.getPrivate().toArray("be",o),u=t.toArray("be",o),c=new i({hash:this.hash,entropy:s,nonce:u,pers:a.pers,persEnc:a.persEnc||"utf8"}),l=this.n.sub(new r(1)),h=0;;h++){var d=a.k?a.k(h):new r(c.generate(this.n.byteLength()));if(!((d=this._truncateToN(d,!0)).cmpn(1)<=0||d.cmp(l)>=0)){var p=this.g.mul(d);if(!p.isInfinity()){var g=p.getX(),y=g.umod(this.n);if(0!==y.cmpn(0)){var b=d.invm(this.n).mul(y.mul(e.getPrivate()).iadd(t));if(0!==(b=b.umod(this.n)).cmpn(0)){var v=(p.getY().isOdd()?1:0)|(0!==g.cmp(y)?2:0);return a.canonical&&b.cmp(this.nh)>0&&(b=this.n.sub(b),v^=1),new f({r:y,s:b,recoveryParam:v})}}}}}},l.prototype.verify=function(t,e,n,i){t=this._truncateToN(new r(t,16)),n=this.keyFromPublic(n,i);var a=(e=new f(e,"hex")).r,o=e.s;if(a.cmpn(1)<0||a.cmp(this.n)>=0)return!1;if(o.cmpn(1)<0||o.cmp(this.n)>=0)return!1;var s,u=o.invm(this.n),c=u.mul(t).umod(this.n),l=u.mul(a).umod(this.n);return this.curve._maxwellTrick?!(s=this.g.jmulAdd(c,n.getPublic(),l)).isInfinity()&&s.eqXToP(a):!(s=this.g.mulAdd(c,n.getPublic(),l)).isInfinity()&&0===s.getX().umod(this.n).cmp(a)},l.prototype.recoverPubKey=function(t,e,n,i){u((3&n)===n,"The recovery param is more than two bits"),e=new f(e,i);var a=this.n,o=new r(t),s=e.r,c=e.s,l=1&n,h=n>>1;if(s.cmp(this.curve.p.umod(this.curve.n))>=0&&h)throw new Error("Unable to find sencond key candinate");s=h?this.curve.pointFromX(s.add(this.curve.n),l):this.curve.pointFromX(s,l);var d=e.r.invm(a),p=a.sub(o).mul(d).umod(a),g=c.mul(d).umod(a);return this.g.mulAdd(p,s,g)},l.prototype.getKeyRecoveryParam=function(t,e,n,r){if(null!==(e=new f(e,r)).recoveryParam)return e.recoveryParam;for(var i=0;i<4;i++){var a;try{a=this.recoverPubKey(t,e,i)}catch(t){continue}if(a.eq(n))return i}throw new Error("Unable to find valid recovery factor")}},function(t,e,n){"use strict";var r=n(127),i=n(215),a=n(16);function o(t){if(!(this instanceof o))return new o(t);this.hash=t.hash,this.predResist=!!t.predResist,this.outLen=this.hash.outSize,this.minEntropy=t.minEntropy||this.hash.hmacStrength,this._reseed=null,this.reseedInterval=null,this.K=null,this.V=null;var e=i.toArray(t.entropy,t.entropyEnc||"hex"),n=i.toArray(t.nonce,t.nonceEnc||"hex"),r=i.toArray(t.pers,t.persEnc||"hex");a(e.length>=this.minEntropy/8,"Not enough entropy. Minimum is: "+this.minEntropy+" bits"),this._init(e,n,r)}t.exports=o,o.prototype._init=function(t,e,n){var r=t.concat(e).concat(n);this.K=new Array(this.outLen/8),this.V=new Array(this.outLen/8);for(var i=0;i<this.V.length;i++)this.K[i]=0,this.V[i]=1;this._update(r),this._reseed=1,this.reseedInterval=281474976710656},o.prototype._hmac=function(){return new r.hmac(this.hash,this.K)},o.prototype._update=function(t){var e=this._hmac().update(this.V).update([0]);t&&(e=e.update(t)),this.K=e.digest(),this.V=this._hmac().update(this.V).digest(),t&&(this.K=this._hmac().update(this.V).update([1]).update(t).digest(),this.V=this._hmac().update(this.V).digest())},o.prototype.reseed=function(t,e,n,r){"string"!=typeof e&&(r=n,n=e,e=null),t=i.toArray(t,e),n=i.toArray(n,r),a(t.length>=this.minEntropy/8,"Not enough entropy. Minimum is: "+this.minEntropy+" bits"),this._update(t.concat(n||[])),this._reseed=1},o.prototype.generate=function(t,e,n,r){if(this._reseed>this.reseedInterval)throw new Error("Reseed is required");"string"!=typeof e&&(r=n,n=e,e=null),n&&(n=i.toArray(n,r||"hex"),this._update(n));for(var a=[];a.length<t;)this.V=this._hmac().update(this.V).digest(),a=a.concat(this.V);var o=a.slice(0,t);return this._update(n),this._reseed++,i.encode(o,e)}},function(t,e,n){"use strict";var r=n(5),i=n(17).assert;function a(t,e){this.ec=t,this.priv=null,this.pub=null,e.priv&&this._importPrivate(e.priv,e.privEnc),e.pub&&this._importPublic(e.pub,e.pubEnc)}t.exports=a,a.fromPublic=function(t,e,n){return e instanceof a?e:new a(t,{pub:e,pubEnc:n})},a.fromPrivate=function(t,e,n){return e instanceof a?e:new a(t,{priv:e,privEnc:n})},a.prototype.validate=function(){var t=this.getPublic();return t.isInfinity()?{result:!1,reason:"Invalid public key"}:t.validate()?t.mul(this.ec.curve.n).isInfinity()?{result:!0,reason:null}:{result:!1,reason:"Public key * N != O"}:{result:!1,reason:"Public key is not a point"}},a.prototype.getPublic=function(t,e){return"string"==typeof t&&(e=t,t=null),this.pub||(this.pub=this.ec.g.mul(this.priv)),e?this.pub.encode(e,t):this.pub},a.prototype.getPrivate=function(t){return"hex"===t?this.priv.toString(16,2):this.priv},a.prototype._importPrivate=function(t,e){this.priv=new r(t,e||16),this.priv=this.priv.umod(this.ec.curve.n)},a.prototype._importPublic=function(t,e){if(t.x||t.y)return"mont"===this.ec.curve.type?i(t.x,"Need x coordinate"):"short"!==this.ec.curve.type&&"edwards"!==this.ec.curve.type||i(t.x&&t.y,"Need both x and y coordinate"),void(this.pub=this.ec.curve.point(t.x,t.y));this.pub=this.ec.curve.decodePoint(t,e)},a.prototype.derive=function(t){return t.mul(this.priv).getX()},a.prototype.sign=function(t,e,n){return this.ec.sign(t,this,e,n)},a.prototype.verify=function(t,e){return this.ec.verify(t,e,this)},a.prototype.inspect=function(){return"<Key priv: "+(this.priv&&this.priv.toString(16,2))+" pub: "+(this.pub&&this.pub.inspect())+" >"}},function(t,e,n){"use strict";var r=n(5),i=n(17),a=i.assert;function o(t,e){if(t instanceof o)return t;this._importDER(t,e)||(a(t.r&&t.s,"Signature without r or s"),this.r=new r(t.r,16),this.s=new r(t.s,16),void 0===t.recoveryParam?this.recoveryParam=null:this.recoveryParam=t.recoveryParam)}function s(){this.place=0}function u(t,e){var n=t[e.place++];if(!(128&n))return n;for(var r=15&n,i=0,a=0,o=e.place;a<r;a++,o++)i<<=8,i|=t[o];return e.place=o,i}function c(t){for(var e=0,n=t.length-1;!t[e]&&!(128&t[e+1])&&e<n;)e++;return 0===e?t:t.slice(e)}function f(t,e){if(e<128)t.push(e);else{var n=1+(Math.log(e)/Math.LN2>>>3);for(t.push(128|n);--n;)t.push(e>>>(n<<3)&255);t.push(e)}}t.exports=o,o.prototype._importDER=function(t,e){t=i.toArray(t,e);var n=new s;if(48!==t[n.place++])return!1;if(u(t,n)+n.place!==t.length)return!1;if(2!==t[n.place++])return!1;var a=u(t,n),o=t.slice(n.place,a+n.place);if(n.place+=a,2!==t[n.place++])return!1;var c=u(t,n);if(t.length!==c+n.place)return!1;var f=t.slice(n.place,c+n.place);return 0===o[0]&&128&o[1]&&(o=o.slice(1)),0===f[0]&&128&f[1]&&(f=f.slice(1)),this.r=new r(o),this.s=new r(f),this.recoveryParam=null,!0},o.prototype.toDER=function(t){var e=this.r.toArray(),n=this.s.toArray();for(128&e[0]&&(e=[0].concat(e)),128&n[0]&&(n=[0].concat(n)),e=c(e),n=c(n);!(n[0]||128&n[1]);)n=n.slice(1);var r=[2];f(r,e.length),(r=r.concat(e)).push(2),f(r,n.length);var a=r.concat(n),o=[48];return f(o,a.length),o=o.concat(a),i.encode(o,t)}},function(t,e,n){"use strict";var r=n(127),i=n(126),a=n(17),o=a.assert,s=a.parseBytes,u=n(479),c=n(480);function f(t){if(o("ed25519"===t,"only tested with ed25519 so far"),!(this instanceof f))return new f(t);t=i[t].curve;this.curve=t,this.g=t.g,this.g.precompute(t.n.bitLength()+1),this.pointClass=t.point().constructor,this.encodingLength=Math.ceil(t.n.bitLength()/8),this.hash=r.sha512}t.exports=f,f.prototype.sign=function(t,e){t=s(t);var n=this.keyFromSecret(e),r=this.hashInt(n.messagePrefix(),t),i=this.g.mul(r),a=this.encodePoint(i),o=this.hashInt(a,n.pubBytes(),t).mul(n.priv()),u=r.add(o).umod(this.curve.n);return this.makeSignature({R:i,S:u,Rencoded:a})},f.prototype.verify=function(t,e,n){t=s(t),e=this.makeSignature(e);var r=this.keyFromPublic(n),i=this.hashInt(e.Rencoded(),r.pubBytes(),t),a=this.g.mul(e.S());return e.R().add(r.pub().mul(i)).eq(a)},f.prototype.hashInt=function(){for(var t=this.hash(),e=0;e<arguments.length;e++)t.update(arguments[e]);return a.intFromLE(t.digest()).umod(this.curve.n)},f.prototype.keyFromPublic=function(t){return u.fromPublic(this,t)},f.prototype.keyFromSecret=function(t){return u.fromSecret(this,t)},f.prototype.makeSignature=function(t){return t instanceof c?t:new c(this,t)},f.prototype.encodePoint=function(t){var e=t.getY().toArray("le",this.encodingLength);return e[this.encodingLength-1]|=t.getX().isOdd()?128:0,e},f.prototype.decodePoint=function(t){var e=(t=a.parseBytes(t)).length-1,n=t.slice(0,e).concat(-129&t[e]),r=0!=(128&t[e]),i=a.intFromLE(n);return this.curve.pointFromY(i,r)},f.prototype.encodeInt=function(t){return t.toArray("le",this.encodingLength)},f.prototype.decodeInt=function(t){return a.intFromLE(t)},f.prototype.isPoint=function(t){return t instanceof this.pointClass}},function(t,e,n){"use strict";var r=n(17),i=r.assert,a=r.parseBytes,o=r.cachedProperty;function s(t,e){this.eddsa=t,this._secret=a(e.secret),t.isPoint(e.pub)?this._pub=e.pub:this._pubBytes=a(e.pub)}s.fromPublic=function(t,e){return e instanceof s?e:new s(t,{pub:e})},s.fromSecret=function(t,e){return e instanceof s?e:new s(t,{secret:e})},s.prototype.secret=function(){return this._secret},o(s,"pubBytes",(function(){return this.eddsa.encodePoint(this.pub())})),o(s,"pub",(function(){return this._pubBytes?this.eddsa.decodePoint(this._pubBytes):this.eddsa.g.mul(this.priv())})),o(s,"privBytes",(function(){var t=this.eddsa,e=this.hash(),n=t.encodingLength-1,r=e.slice(0,t.encodingLength);return r[0]&=248,r[n]&=127,r[n]|=64,r})),o(s,"priv",(function(){return this.eddsa.decodeInt(this.privBytes())})),o(s,"hash",(function(){return this.eddsa.hash().update(this.secret()).digest()})),o(s,"messagePrefix",(function(){return this.hash().slice(this.eddsa.encodingLength)})),s.prototype.sign=function(t){return i(this._secret,"KeyPair can only verify"),this.eddsa.sign(t,this)},s.prototype.verify=function(t,e){return this.eddsa.verify(t,e,this)},s.prototype.getSecret=function(t){return i(this._secret,"KeyPair is public only"),r.encode(this.secret(),t)},s.prototype.getPublic=function(t){return r.encode(this.pubBytes(),t)},t.exports=s},function(t,e,n){"use strict";var r=n(5),i=n(17),a=i.assert,o=i.cachedProperty,s=i.parseBytes;function u(t,e){this.eddsa=t,"object"!=typeof e&&(e=s(e)),Array.isArray(e)&&(e={R:e.slice(0,t.encodingLength),S:e.slice(t.encodingLength)}),a(e.R&&e.S,"Signature without R or S"),t.isPoint(e.R)&&(this._R=e.R),e.S instanceof r&&(this._S=e.S),this._Rencoded=Array.isArray(e.R)?e.R:e.Rencoded,this._Sencoded=Array.isArray(e.S)?e.S:e.Sencoded}o(u,"S",(function(){return this.eddsa.decodeInt(this.Sencoded())})),o(u,"R",(function(){return this.eddsa.decodePoint(this.Rencoded())})),o(u,"Rencoded",(function(){return this.eddsa.encodePoint(this.R())})),o(u,"Sencoded",(function(){return this.eddsa.encodeInt(this.S())})),u.prototype.toBytes=function(){return this.Rencoded().concat(this.Sencoded())},u.prototype.toHex=function(){return i.encode(this.toBytes(),"hex").toUpperCase()},t.exports=u},function(t,e,n){"use strict";var r=n(57);e.certificate=n(491);var i=r.define("RSAPrivateKey",(function(){this.seq().obj(this.key("version").int(),this.key("modulus").int(),this.key("publicExponent").int(),this.key("privateExponent").int(),this.key("prime1").int(),this.key("prime2").int(),this.key("exponent1").int(),this.key("exponent2").int(),this.key("coefficient").int())}));e.RSAPrivateKey=i;var a=r.define("RSAPublicKey",(function(){this.seq().obj(this.key("modulus").int(),this.key("publicExponent").int())}));e.RSAPublicKey=a;var o=r.define("SubjectPublicKeyInfo",(function(){this.seq().obj(this.key("algorithm").use(s),this.key("subjectPublicKey").bitstr())}));e.PublicKey=o;var s=r.define("AlgorithmIdentifier",(function(){this.seq().obj(this.key("algorithm").objid(),this.key("none").null_().optional(),this.key("curve").objid().optional(),this.key("params").seq().obj(this.key("p").int(),this.key("q").int(),this.key("g").int()).optional())})),u=r.define("PrivateKeyInfo",(function(){this.seq().obj(this.key("version").int(),this.key("algorithm").use(s),this.key("subjectPrivateKey").octstr())}));e.PrivateKey=u;var c=r.define("EncryptedPrivateKeyInfo",(function(){this.seq().obj(this.key("algorithm").seq().obj(this.key("id").objid(),this.key("decrypt").seq().obj(this.key("kde").seq().obj(this.key("id").objid(),this.key("kdeparams").seq().obj(this.key("salt").octstr(),this.key("iters").int())),this.key("cipher").seq().obj(this.key("algo").objid(),this.key("iv").octstr()))),this.key("subjectPrivateKey").octstr())}));e.EncryptedPrivateKey=c;var f=r.define("DSAPrivateKey",(function(){this.seq().obj(this.key("version").int(),this.key("p").int(),this.key("q").int(),this.key("g").int(),this.key("pub_key").int(),this.key("priv_key").int())}));e.DSAPrivateKey=f,e.DSAparam=r.define("DSAparam",(function(){this.int()}));var l=r.define("ECPrivateKey",(function(){this.seq().obj(this.key("version").int(),this.key("privateKey").octstr(),this.key("parameters").optional().explicit(0).use(h),this.key("publicKey").optional().explicit(1).bitstr())}));e.ECPrivateKey=l;var h=r.define("ECParameters",(function(){this.choice({namedCurve:this.objid()})}));e.signature=r.define("signature",(function(){this.seq().obj(this.key("r").int(),this.key("s").int())}))},function(t,e,n){var r=n(57),i=n(2);function a(t,e){this.name=t,this.body=e,this.decoders={},this.encoders={}}e.define=function(t,e){return new a(t,e)},a.prototype._createNamed=function(t){var e;try{e=n(483).runInThisContext("(function "+this.name+"(entity) {\n this._initNamed(entity);\n})")}catch(t){e=function(t){this._initNamed(t)}}return i(e,t),e.prototype._initNamed=function(e){t.call(this,e)},new e(this)},a.prototype._getDecoder=function(t){return t=t||"der",this.decoders.hasOwnProperty(t)||(this.decoders[t]=this._createNamed(r.decoders[t])),this.decoders[t]},a.prototype.decode=function(t,e,n){return this._getDecoder(e).decode(t,n)},a.prototype._getEncoder=function(t){return t=t||"der",this.encoders.hasOwnProperty(t)||(this.encoders[t]=this._createNamed(r.encoders[t])),this.encoders[t]},a.prototype.encode=function(t,e,n){return this._getEncoder(e).encode(t,n)}},function(module,exports){var indexOf=function(t,e){if(t.indexOf)return t.indexOf(e);for(var n=0;n<t.length;n++)if(t[n]===e)return n;return-1},Object_keys=function(t){if(Object.keys)return Object.keys(t);var e=[];for(var n in t)e.push(n);return e},forEach=function(t,e){if(t.forEach)return t.forEach(e);for(var n=0;n<t.length;n++)e(t[n],n,t)},defineProp=function(){try{return Object.defineProperty({},"_",{}),function(t,e,n){Object.defineProperty(t,e,{writable:!0,enumerable:!1,configurable:!0,value:n})}}catch(t){return function(t,e,n){t[e]=n}}}(),globals=["Array","Boolean","Date","Error","EvalError","Function","Infinity","JSON","Math","NaN","Number","Object","RangeError","ReferenceError","RegExp","String","SyntaxError","TypeError","URIError","decodeURI","decodeURIComponent","encodeURI","encodeURIComponent","escape","eval","isFinite","isNaN","parseFloat","parseInt","undefined","unescape"];function Context(){}Context.prototype={};var Script=exports.Script=function(t){if(!(this instanceof Script))return new Script(t);this.code=t};Script.prototype.runInContext=function(t){if(!(t instanceof Context))throw new TypeError("needs a 'context' argument.");var e=document.createElement("iframe");e.style||(e.style={}),e.style.display="none",document.body.appendChild(e);var n=e.contentWindow,r=n.eval,i=n.execScript;!r&&i&&(i.call(n,"null"),r=n.eval),forEach(Object_keys(t),(function(e){n[e]=t[e]})),forEach(globals,(function(e){t[e]&&(n[e]=t[e])}));var a=Object_keys(n),o=r.call(n,this.code);return forEach(Object_keys(n),(function(e){(e in t||-1===indexOf(a,e))&&(t[e]=n[e])})),forEach(globals,(function(e){e in t||defineProp(t,e,n[e])})),document.body.removeChild(e),o},Script.prototype.runInThisContext=function(){return eval(this.code)},Script.prototype.runInNewContext=function(t){var e=Script.createContext(t),n=this.runInContext(e);return t&&forEach(Object_keys(e),(function(n){t[n]=e[n]})),n},forEach(Object_keys(Script.prototype),(function(t){exports[t]=Script[t]=function(e){var n=Script(e);return n[t].apply(n,[].slice.call(arguments,1))}})),exports.isContext=function(t){return t instanceof Context},exports.createScript=function(t){return exports.Script(t)},exports.createContext=Script.createContext=function(t){var e=new Context;return"object"==typeof t&&forEach(Object_keys(t),(function(n){e[n]=t[n]})),e}},function(t,e,n){var r=n(2);function i(t){this._reporterState={obj:null,path:[],options:t||{},errors:[]}}function a(t,e){this.path=t,this.rethrow(e)}e.Reporter=i,i.prototype.isError=function(t){return t instanceof a},i.prototype.save=function(){var t=this._reporterState;return{obj:t.obj,pathLen:t.path.length}},i.prototype.restore=function(t){var e=this._reporterState;e.obj=t.obj,e.path=e.path.slice(0,t.pathLen)},i.prototype.enterKey=function(t){return this._reporterState.path.push(t)},i.prototype.exitKey=function(t){var e=this._reporterState;e.path=e.path.slice(0,t-1)},i.prototype.leaveKey=function(t,e,n){var r=this._reporterState;this.exitKey(t),null!==r.obj&&(r.obj[e]=n)},i.prototype.path=function(){return this._reporterState.path.join("/")},i.prototype.enterObject=function(){var t=this._reporterState,e=t.obj;return t.obj={},e},i.prototype.leaveObject=function(t){var e=this._reporterState,n=e.obj;return e.obj=t,n},i.prototype.error=function(t){var e,n=this._reporterState,r=t instanceof a;if(e=r?t:new a(n.path.map((function(t){return"["+JSON.stringify(t)+"]"})).join(""),t.message||t,t.stack),!n.options.partial)throw e;return r||n.errors.push(e),e},i.prototype.wrapResult=function(t){var e=this._reporterState;return e.options.partial?{result:this.isError(t)?null:t,errors:e.errors}:t},r(a,Error),a.prototype.rethrow=function(t){if(this.message=t+" at: "+(this.path||"(shallow)"),Error.captureStackTrace&&Error.captureStackTrace(this,a),!this.stack)try{throw new Error(this.message)}catch(t){this.stack=t.stack}return this}},function(t,e,n){var r=n(58).Reporter,i=n(58).EncoderBuffer,a=n(58).DecoderBuffer,o=n(16),s=["seq","seqof","set","setof","objid","bool","gentime","utctime","null_","enum","int","objDesc","bitstr","bmpstr","charstr","genstr","graphstr","ia5str","iso646str","numstr","octstr","printstr","t61str","unistr","utf8str","videostr"],u=["key","obj","use","optional","explicit","implicit","def","choice","any","contains"].concat(s);function c(t,e){var n={};this._baseState=n,n.enc=t,n.parent=e||null,n.children=null,n.tag=null,n.args=null,n.reverseArgs=null,n.choice=null,n.optional=!1,n.any=!1,n.obj=!1,n.use=null,n.useDecoder=null,n.key=null,n.default=null,n.explicit=null,n.implicit=null,n.contains=null,n.parent||(n.children=[],this._wrap())}t.exports=c;var f=["enc","parent","children","tag","args","reverseArgs","choice","optional","any","obj","use","alteredUse","key","default","explicit","implicit","contains"];c.prototype.clone=function(){var t=this._baseState,e={};f.forEach((function(n){e[n]=t[n]}));var n=new this.constructor(e.parent);return n._baseState=e,n},c.prototype._wrap=function(){var t=this._baseState;u.forEach((function(e){this[e]=function(){var n=new this.constructor(this);return t.children.push(n),n[e].apply(n,arguments)}}),this)},c.prototype._init=function(t){var e=this._baseState;o(null===e.parent),t.call(this),e.children=e.children.filter((function(t){return t._baseState.parent===this}),this),o.equal(e.children.length,1,"Root node can have only one child")},c.prototype._useArgs=function(t){var e=this._baseState,n=t.filter((function(t){return t instanceof this.constructor}),this);t=t.filter((function(t){return!(t instanceof this.constructor)}),this),0!==n.length&&(o(null===e.children),e.children=n,n.forEach((function(t){t._baseState.parent=this}),this)),0!==t.length&&(o(null===e.args),e.args=t,e.reverseArgs=t.map((function(t){if("object"!=typeof t||t.constructor!==Object)return t;var e={};return Object.keys(t).forEach((function(n){n==(0|n)&&(n|=0);var r=t[n];e[r]=n})),e})))},["_peekTag","_decodeTag","_use","_decodeStr","_decodeObjid","_decodeTime","_decodeNull","_decodeInt","_decodeBool","_decodeList","_encodeComposite","_encodeStr","_encodeObjid","_encodeTime","_encodeNull","_encodeInt","_encodeBool"].forEach((function(t){c.prototype[t]=function(){var e=this._baseState;throw new Error(t+" not implemented for encoding: "+e.enc)}})),s.forEach((function(t){c.prototype[t]=function(){var e=this._baseState,n=Array.prototype.slice.call(arguments);return o(null===e.tag),e.tag=t,this._useArgs(n),this}})),c.prototype.use=function(t){o(t);var e=this._baseState;return o(null===e.use),e.use=t,this},c.prototype.optional=function(){return this._baseState.optional=!0,this},c.prototype.def=function(t){var e=this._baseState;return o(null===e.default),e.default=t,e.optional=!0,this},c.prototype.explicit=function(t){var e=this._baseState;return o(null===e.explicit&&null===e.implicit),e.explicit=t,this},c.prototype.implicit=function(t){var e=this._baseState;return o(null===e.explicit&&null===e.implicit),e.implicit=t,this},c.prototype.obj=function(){var t=this._baseState,e=Array.prototype.slice.call(arguments);return t.obj=!0,0!==e.length&&this._useArgs(e),this},c.prototype.key=function(t){var e=this._baseState;return o(null===e.key),e.key=t,this},c.prototype.any=function(){return this._baseState.any=!0,this},c.prototype.choice=function(t){var e=this._baseState;return o(null===e.choice),e.choice=t,this._useArgs(Object.keys(t).map((function(e){return t[e]}))),this},c.prototype.contains=function(t){var e=this._baseState;return o(null===e.use),e.contains=t,this},c.prototype._decode=function(t,e){var n=this._baseState;if(null===n.parent)return t.wrapResult(n.children[0]._decode(t,e));var r,i=n.default,o=!0,s=null;if(null!==n.key&&(s=t.enterKey(n.key)),n.optional){var u=null;if(null!==n.explicit?u=n.explicit:null!==n.implicit?u=n.implicit:null!==n.tag&&(u=n.tag),null!==u||n.any){if(o=this._peekTag(t,u,n.any),t.isError(o))return o}else{var c=t.save();try{null===n.choice?this._decodeGeneric(n.tag,t,e):this._decodeChoice(t,e),o=!0}catch(t){o=!1}t.restore(c)}}if(n.obj&&o&&(r=t.enterObject()),o){if(null!==n.explicit){var f=this._decodeTag(t,n.explicit);if(t.isError(f))return f;t=f}var l=t.offset;if(null===n.use&&null===n.choice){if(n.any)c=t.save();var h=this._decodeTag(t,null!==n.implicit?n.implicit:n.tag,n.any);if(t.isError(h))return h;n.any?i=t.raw(c):t=h}if(e&&e.track&&null!==n.tag&&e.track(t.path(),l,t.length,"tagged"),e&&e.track&&null!==n.tag&&e.track(t.path(),t.offset,t.length,"content"),i=n.any?i:null===n.choice?this._decodeGeneric(n.tag,t,e):this._decodeChoice(t,e),t.isError(i))return i;if(n.any||null!==n.choice||null===n.children||n.children.forEach((function(n){n._decode(t,e)})),n.contains&&("octstr"===n.tag||"bitstr"===n.tag)){var d=new a(i);i=this._getUse(n.contains,t._reporterState.obj)._decode(d,e)}}return n.obj&&o&&(i=t.leaveObject(r)),null===n.key||null===i&&!0!==o?null!==s&&t.exitKey(s):t.leaveKey(s,n.key,i),i},c.prototype._decodeGeneric=function(t,e,n){var r=this._baseState;return"seq"===t||"set"===t?null:"seqof"===t||"setof"===t?this._decodeList(e,t,r.args[0],n):/str$/.test(t)?this._decodeStr(e,t,n):"objid"===t&&r.args?this._decodeObjid(e,r.args[0],r.args[1],n):"objid"===t?this._decodeObjid(e,null,null,n):"gentime"===t||"utctime"===t?this._decodeTime(e,t,n):"null_"===t?this._decodeNull(e,n):"bool"===t?this._decodeBool(e,n):"objDesc"===t?this._decodeStr(e,t,n):"int"===t||"enum"===t?this._decodeInt(e,r.args&&r.args[0],n):null!==r.use?this._getUse(r.use,e._reporterState.obj)._decode(e,n):e.error("unknown tag: "+t)},c.prototype._getUse=function(t,e){var n=this._baseState;return n.useDecoder=this._use(t,e),o(null===n.useDecoder._baseState.parent),n.useDecoder=n.useDecoder._baseState.children[0],n.implicit!==n.useDecoder._baseState.implicit&&(n.useDecoder=n.useDecoder.clone(),n.useDecoder._baseState.implicit=n.implicit),n.useDecoder},c.prototype._decodeChoice=function(t,e){var n=this._baseState,r=null,i=!1;return Object.keys(n.choice).some((function(a){var o=t.save(),s=n.choice[a];try{var u=s._decode(t,e);if(t.isError(u))return!1;r={type:a,value:u},i=!0}catch(e){return t.restore(o),!1}return!0}),this),i?r:t.error("Choice not matched")},c.prototype._createEncoderBuffer=function(t){return new i(t,this.reporter)},c.prototype._encode=function(t,e,n){var r=this._baseState;if(null===r.default||r.default!==t){var i=this._encodeValue(t,e,n);if(void 0!==i&&!this._skipDefault(i,e,n))return i}},c.prototype._encodeValue=function(t,e,n){var i=this._baseState;if(null===i.parent)return i.children[0]._encode(t,e||new r);var a=null;if(this.reporter=e,i.optional&&void 0===t){if(null===i.default)return;t=i.default}var o=null,s=!1;if(i.any)a=this._createEncoderBuffer(t);else if(i.choice)a=this._encodeChoice(t,e);else if(i.contains)o=this._getUse(i.contains,n)._encode(t,e),s=!0;else if(i.children)o=i.children.map((function(n){if("null_"===n._baseState.tag)return n._encode(null,e,t);if(null===n._baseState.key)return e.error("Child should have a key");var r=e.enterKey(n._baseState.key);if("object"!=typeof t)return e.error("Child expected, but input is not object");var i=n._encode(t[n._baseState.key],e,t);return e.leaveKey(r),i}),this).filter((function(t){return t})),o=this._createEncoderBuffer(o);else if("seqof"===i.tag||"setof"===i.tag){if(!i.args||1!==i.args.length)return e.error("Too many args for : "+i.tag);if(!Array.isArray(t))return e.error("seqof/setof, but data is not Array");var u=this.clone();u._baseState.implicit=null,o=this._createEncoderBuffer(t.map((function(n){var r=this._baseState;return this._getUse(r.args[0],t)._encode(n,e)}),u))}else null!==i.use?a=this._getUse(i.use,n)._encode(t,e):(o=this._encodePrimitive(i.tag,t),s=!0);if(!i.any&&null===i.choice){var c=null!==i.implicit?i.implicit:i.tag,f=null===i.implicit?"universal":"context";null===c?null===i.use&&e.error("Tag could be omitted only for .use()"):null===i.use&&(a=this._encodeComposite(c,s,f,o))}return null!==i.explicit&&(a=this._encodeComposite(i.explicit,!1,"context",a)),a},c.prototype._encodeChoice=function(t,e){var n=this._baseState,r=n.choice[t.type];return r||o(!1,t.type+" not found in "+JSON.stringify(Object.keys(n.choice))),r._encode(t.value,e)},c.prototype._encodePrimitive=function(t,e){var n=this._baseState;if(/str$/.test(t))return this._encodeStr(e,t);if("objid"===t&&n.args)return this._encodeObjid(e,n.reverseArgs[0],n.args[1]);if("objid"===t)return this._encodeObjid(e,null,null);if("gentime"===t||"utctime"===t)return this._encodeTime(e,t);if("null_"===t)return this._encodeNull();if("int"===t||"enum"===t)return this._encodeInt(e,n.args&&n.reverseArgs[0]);if("bool"===t)return this._encodeBool(e);if("objDesc"===t)return this._encodeStr(e,t);throw new Error("Unsupported tag: "+t)},c.prototype._isNumstr=function(t){return/^[0-9 ]*$/.test(t)},c.prototype._isPrintstr=function(t){return/^[A-Za-z0-9 '\(\)\+,\-\.\/:=\?]*$/.test(t)}},function(t,e,n){var r=n(221);e.tagClass={0:"universal",1:"application",2:"context",3:"private"},e.tagClassByName=r._reverse(e.tagClass),e.tag={0:"end",1:"bool",2:"int",3:"bitstr",4:"octstr",5:"null_",6:"objid",7:"objDesc",8:"external",9:"real",10:"enum",11:"embed",12:"utf8str",13:"relativeOid",16:"seq",17:"set",18:"numstr",19:"printstr",20:"t61str",21:"videostr",22:"ia5str",23:"utctime",24:"gentime",25:"graphstr",26:"iso646str",27:"genstr",28:"unistr",29:"charstr",30:"bmpstr"},e.tagByName=r._reverse(e.tag)},function(t,e,n){var r=e;r.der=n(222),r.pem=n(488)},function(t,e,n){var r=n(2),i=n(8).Buffer,a=n(222);function o(t){a.call(this,t),this.enc="pem"}r(o,a),t.exports=o,o.prototype.decode=function(t,e){for(var n=t.toString().split(/[\r\n]+/g),r=e.label.toUpperCase(),o=/^-----(BEGIN|END) ([^-]+)-----$/,s=-1,u=-1,c=0;c<n.length;c++){var f=n[c].match(o);if(null!==f&&f[2]===r){if(-1!==s){if("END"!==f[1])break;u=c;break}if("BEGIN"!==f[1])break;s=c}}if(-1===s||-1===u)throw new Error("PEM section not found for: "+r);var l=n.slice(s+1,u).join("");l.replace(/[^a-z0-9\+\/=]+/gi,"");var h=new i(l,"base64");return a.prototype.decode.call(this,h,e)}},function(t,e,n){var r=e;r.der=n(223),r.pem=n(490)},function(t,e,n){var r=n(2),i=n(223);function a(t){i.call(this,t),this.enc="pem"}r(a,i),t.exports=a,a.prototype.encode=function(t,e){for(var n=i.prototype.encode.call(this,t).toString("base64"),r=["-----BEGIN "+e.label+"-----"],a=0;a<n.length;a+=64)r.push(n.slice(a,a+64));return r.push("-----END "+e.label+"-----"),r.join("\n")}},function(t,e,n){"use strict";var r=n(57),i=r.define("Time",(function(){this.choice({utcTime:this.utctime(),generalTime:this.gentime()})})),a=r.define("AttributeTypeValue",(function(){this.seq().obj(this.key("type").objid(),this.key("value").any())})),o=r.define("AlgorithmIdentifier",(function(){this.seq().obj(this.key("algorithm").objid(),this.key("parameters").optional(),this.key("curve").objid().optional())})),s=r.define("SubjectPublicKeyInfo",(function(){this.seq().obj(this.key("algorithm").use(o),this.key("subjectPublicKey").bitstr())})),u=r.define("RelativeDistinguishedName",(function(){this.setof(a)})),c=r.define("RDNSequence",(function(){this.seqof(u)})),f=r.define("Name",(function(){this.choice({rdnSequence:this.use(c)})})),l=r.define("Validity",(function(){this.seq().obj(this.key("notBefore").use(i),this.key("notAfter").use(i))})),h=r.define("Extension",(function(){this.seq().obj(this.key("extnID").objid(),this.key("critical").bool().def(!1),this.key("extnValue").octstr())})),d=r.define("TBSCertificate",(function(){this.seq().obj(this.key("version").explicit(0).int().optional(),this.key("serialNumber").int(),this.key("signature").use(o),this.key("issuer").use(f),this.key("validity").use(l),this.key("subject").use(f),this.key("subjectPublicKeyInfo").use(s),this.key("issuerUniqueID").implicit(1).bitstr().optional(),this.key("subjectUniqueID").implicit(2).bitstr().optional(),this.key("extensions").explicit(3).seqof(h).optional())})),p=r.define("X509Certificate",(function(){this.seq().obj(this.key("tbsCertificate").use(d),this.key("signatureAlgorithm").use(o),this.key("signatureValue").bitstr())}));t.exports=p},function(t){t.exports=JSON.parse('{"2.16.840.1.101.3.4.1.1":"aes-128-ecb","2.16.840.1.101.3.4.1.2":"aes-128-cbc","2.16.840.1.101.3.4.1.3":"aes-128-ofb","2.16.840.1.101.3.4.1.4":"aes-128-cfb","2.16.840.1.101.3.4.1.21":"aes-192-ecb","2.16.840.1.101.3.4.1.22":"aes-192-cbc","2.16.840.1.101.3.4.1.23":"aes-192-ofb","2.16.840.1.101.3.4.1.24":"aes-192-cfb","2.16.840.1.101.3.4.1.41":"aes-256-ecb","2.16.840.1.101.3.4.1.42":"aes-256-cbc","2.16.840.1.101.3.4.1.43":"aes-256-ofb","2.16.840.1.101.3.4.1.44":"aes-256-cfb"}')},function(t,e,n){var r=/Proc-Type: 4,ENCRYPTED[\n\r]+DEK-Info: AES-((?:128)|(?:192)|(?:256))-CBC,([0-9A-H]+)[\n\r]+([0-9A-z\n\r\+\/\=]+)[\n\r]+/m,i=/^-----BEGIN ((?:.*? KEY)|CERTIFICATE)-----/m,a=/^-----BEGIN ((?:.*? KEY)|CERTIFICATE)-----([0-9A-z\n\r\+\/\=]+)-----END \1-----$/m,o=n(80),s=n(121),u=n(3).Buffer;t.exports=function(t,e){var n,c=t.toString(),f=c.match(r);if(f){var l="aes"+f[1],h=u.from(f[2],"hex"),d=u.from(f[3].replace(/[\r\n]/g,""),"base64"),p=o(e,h.slice(0,8),parseInt(f[1],10)).key,g=[],y=s.createDecipheriv(l,p,h);g.push(y.update(d)),g.push(y.final()),n=u.concat(g)}else{var b=c.match(a);n=new u(b[2].replace(/[\r\n]/g,""),"base64")}return{tag:c.match(i)[1],data:n}}},function(t,e,n){(function(e){var r=n(5),i=n(125).ec,a=n(82),o=n(224);function s(t,e){if(t.cmpn(0)<=0)throw new Error("invalid sig");if(t.cmp(e)>=e)throw new Error("invalid sig")}t.exports=function(t,n,u,c,f){var l=a(u);if("ec"===l.type){if("ecdsa"!==c&&"ecdsa/rsa"!==c)throw new Error("wrong public key type");return function(t,e,n){var r=o[n.data.algorithm.curve.join(".")];if(!r)throw new Error("unknown curve "+n.data.algorithm.curve.join("."));var a=new i(r),s=n.data.subjectPrivateKey.data;return a.verify(e,t,s)}(t,n,l)}if("dsa"===l.type){if("dsa"!==c)throw new Error("wrong public key type");return function(t,e,n){var i=n.data.p,o=n.data.q,u=n.data.g,c=n.data.pub_key,f=a.signature.decode(t,"der"),l=f.s,h=f.r;s(l,o),s(h,o);var d=r.mont(i),p=l.invm(o);return 0===u.toRed(d).redPow(new r(e).mul(p).mod(o)).fromRed().mul(c.toRed(d).redPow(h.mul(p).mod(o)).fromRed()).mod(i).mod(o).cmp(h)}(t,n,l)}if("rsa"!==c&&"ecdsa/rsa"!==c)throw new Error("wrong public key type");n=e.concat([f,n]);for(var h=l.modulus.byteLength(),d=[1],p=0;n.length+d.length+2<h;)d.push(255),p++;d.push(0);for(var g=-1;++g<n.length;)d.push(n[g]);d=new e(d);var y=r.mont(l.modulus);t=(t=new r(t).toRed(y)).redPow(new r(l.publicExponent)),t=new e(t.fromRed().toArray());var b=p<8?1:0;for(h=Math.min(t.length,d.length),t.length!==d.length&&(b=1),g=-1;++g<h;)b|=t[g]^d[g];return 0===b}}).call(this,n(8).Buffer)},function(t,e,n){(function(e){var r=n(125),i=n(5);t.exports=function(t){return new o(t)};var a={secp256k1:{name:"secp256k1",byteLength:32},secp224r1:{name:"p224",byteLength:28},prime256v1:{name:"p256",byteLength:32},prime192v1:{name:"p192",byteLength:24},ed25519:{name:"ed25519",byteLength:32},secp384r1:{name:"p384",byteLength:48},secp521r1:{name:"p521",byteLength:66}};function o(t){this.curveType=a[t],this.curveType||(this.curveType={name:t}),this.curve=new r.ec(this.curveType.name),this.keys=void 0}function s(t,n,r){Array.isArray(t)||(t=t.toArray());var i=new e(t);if(r&&i.length<r){var a=new e(r-i.length);a.fill(0),i=e.concat([a,i])}return n?i.toString(n):i}a.p224=a.secp224r1,a.p256=a.secp256r1=a.prime256v1,a.p192=a.secp192r1=a.prime192v1,a.p384=a.secp384r1,a.p521=a.secp521r1,o.prototype.generateKeys=function(t,e){return this.keys=this.curve.genKeyPair(),this.getPublicKey(t,e)},o.prototype.computeSecret=function(t,n,r){return n=n||"utf8",e.isBuffer(t)||(t=new e(t,n)),s(this.curve.keyFromPublic(t).getPublic().mul(this.keys.getPrivate()).getX(),r,this.curveType.byteLength)},o.prototype.getPublicKey=function(t,e){var n=this.keys.getPublic("compressed"===e,!0);return"hybrid"===e&&(n[n.length-1]%2?n[0]=7:n[0]=6),s(n,t)},o.prototype.getPrivateKey=function(t){return s(this.keys.getPrivate(),t)},o.prototype.setPublicKey=function(t,n){return n=n||"utf8",e.isBuffer(t)||(t=new e(t,n)),this.keys._importPublic(t),this},o.prototype.setPrivateKey=function(t,n){n=n||"utf8",e.isBuffer(t)||(t=new e(t,n));var r=new i(t);return r=r.toString(16),this.keys=this.curve.genKeyPair(),this.keys._importPrivate(r),this}}).call(this,n(8).Buffer)},function(t,e,n){e.publicEncrypt=n(497),e.privateDecrypt=n(498),e.privateEncrypt=function(t,n){return e.publicEncrypt(t,n,!0)},e.publicDecrypt=function(t,n){return e.privateDecrypt(t,n,!0)}},function(t,e,n){var r=n(82),i=n(44),a=n(53),o=n(225),s=n(226),u=n(5),c=n(227),f=n(124),l=n(3).Buffer;t.exports=function(t,e,n){var h;h=t.padding?t.padding:n?1:4;var d,p=r(t);if(4===h)d=function(t,e){var n=t.modulus.byteLength(),r=e.length,c=a("sha1").update(l.alloc(0)).digest(),f=c.length,h=2*f;if(r>n-h-2)throw new Error("message too long");var d=l.alloc(n-r-h-2),p=n-f-1,g=i(f),y=s(l.concat([c,d,l.alloc(1,1),e],p),o(g,p)),b=s(g,o(y,f));return new u(l.concat([l.alloc(1),b,y],n))}(p,e);else if(1===h)d=function(t,e,n){var r,a=e.length,o=t.modulus.byteLength();if(a>o-11)throw new Error("message too long");r=n?l.alloc(o-a-3,255):function(t){var e,n=l.allocUnsafe(t),r=0,a=i(2*t),o=0;for(;r<t;)o===a.length&&(a=i(2*t),o=0),(e=a[o++])&&(n[r++]=e);return n}(o-a-3);return new u(l.concat([l.from([0,n?1:2]),r,l.alloc(1),e],o))}(p,e,n);else{if(3!==h)throw new Error("unknown padding");if((d=new u(e)).cmp(p.modulus)>=0)throw new Error("data too long for modulus")}return n?f(d,p):c(d,p)}},function(t,e,n){var r=n(82),i=n(225),a=n(226),o=n(5),s=n(124),u=n(53),c=n(227),f=n(3).Buffer;t.exports=function(t,e,n){var l;l=t.padding?t.padding:n?1:4;var h,d=r(t),p=d.modulus.byteLength();if(e.length>p||new o(e).cmp(d.modulus)>=0)throw new Error("decryption error");h=n?c(new o(e),d):s(e,d);var g=f.alloc(p-h.length);if(h=f.concat([g,h],p),4===l)return function(t,e){var n=t.modulus.byteLength(),r=u("sha1").update(f.alloc(0)).digest(),o=r.length;if(0!==e[0])throw new Error("decryption error");var s=e.slice(1,o+1),c=e.slice(o+1),l=a(s,i(c,o)),h=a(c,i(l,n-o-1));if(function(t,e){t=f.from(t),e=f.from(e);var n=0,r=t.length;t.length!==e.length&&(n++,r=Math.min(t.length,e.length));var i=-1;for(;++i<r;)n+=t[i]^e[i];return n}(r,h.slice(0,o)))throw new Error("decryption error");var d=o;for(;0===h[d];)d++;if(1!==h[d++])throw new Error("decryption error");return h.slice(d)}(d,h);if(1===l)return function(t,e,n){var r=e.slice(0,2),i=2,a=0;for(;0!==e[i++];)if(i>=e.length){a++;break}var o=e.slice(2,i-1);("0002"!==r.toString("hex")&&!n||"0001"!==r.toString("hex")&&n)&&a++;o.length<8&&a++;if(a)throw new Error("decryption error");return e.slice(i)}(0,h,n);if(3===l)return h;throw new Error("unknown padding")}},function(t,e,n){"use strict";(function(t,r){function i(){throw new Error("secure random number generation not supported by this browser\nuse chrome, FireFox or Internet Explorer 11")}var a=n(3),o=n(44),s=a.Buffer,u=a.kMaxLength,c=t.crypto||t.msCrypto,f=Math.pow(2,32)-1;function l(t,e){if("number"!=typeof t||t!=t)throw new TypeError("offset must be a number");if(t>f||t<0)throw new TypeError("offset must be a uint32");if(t>u||t>e)throw new RangeError("offset out of range")}function h(t,e,n){if("number"!=typeof t||t!=t)throw new TypeError("size must be a number");if(t>f||t<0)throw new TypeError("size must be a uint32");if(t+e>n||t>u)throw new RangeError("buffer too small")}function d(t,e,n,i){if(r.browser){var a=t.buffer,s=new Uint8Array(a,e,n);return c.getRandomValues(s),i?void r.nextTick((function(){i(null,t)})):t}if(!i)return o(n).copy(t,e),t;o(n,(function(n,r){if(n)return i(n);r.copy(t,e),i(null,t)}))}c&&c.getRandomValues||!r.browser?(e.randomFill=function(e,n,r,i){if(!(s.isBuffer(e)||e instanceof t.Uint8Array))throw new TypeError('"buf" argument must be a Buffer or Uint8Array');if("function"==typeof n)i=n,n=0,r=e.length;else if("function"==typeof r)i=r,r=e.length-n;else if("function"!=typeof i)throw new TypeError('"cb" argument must be a function');return l(n,e.length),h(r,n,e.length),d(e,n,r,i)},e.randomFillSync=function(e,n,r){void 0===n&&(n=0);if(!(s.isBuffer(e)||e instanceof t.Uint8Array))throw new TypeError('"buf" argument must be a Buffer or Uint8Array');l(n,e.length),void 0===r&&(r=e.length-n);return h(r,n,e.length),d(e,n,r)}):(e.randomFill=i,e.randomFillSync=i)}).call(this,n(12),n(7))},function(t,e,n){var r={"./dark/index.scss":501,"./default/index.scss":503,"./forest/index.scss":505,"./neutral/index.scss":507};function i(t){var e=a(t);return n(e)}function a(t){if(!n.o(r,t)){var e=new Error("Cannot find module '"+t+"'");throw e.code="MODULE_NOT_FOUND",e}return r[t]}i.keys=function(){return Object.keys(r)},i.resolve=a,t.exports=i,i.id=500},function(t,e,n){var r=n(502);t.exports="string"==typeof r?r:r.toString()},function(t,e,n){(t.exports=n(83)(!1)).push([t.i,".label{font-family:'trebuchet ms', verdana, arial;font-family:var(--mermaid-font-family);color:#333}.label text{fill:#333}.node rect,.node circle,.node ellipse,.node polygon,.node path{fill:#BDD5EA;stroke:purple;stroke-width:1px}.node .label{text-align:center}.node.clickable{cursor:pointer}.arrowheadPath{fill:#d3d3d3}.edgePath .path{stroke:#d3d3d3;stroke-width:1.5px}.edgeLabel{background-color:#e8e8e8;text-align:center}.cluster rect{fill:#6D6D65;stroke:rgba(255,255,255,0.25);stroke-width:1px}.cluster text{fill:#F9FFFE}div.mermaidTooltip{position:absolute;text-align:center;max-width:200px;padding:2px;font-family:'trebuchet ms', verdana, arial;font-family:var(--mermaid-font-family);font-size:12px;background:#6D6D65;border:1px solid rgba(255,255,255,0.25);border-radius:2px;pointer-events:none;z-index:100}.actor{stroke:#81B1DB;fill:#BDD5EA}text.actor{fill:#000;stroke:none}.actor-line{stroke:#d3d3d3}.messageLine0{stroke-width:1.5;stroke-dasharray:'2 2';stroke:#d3d3d3}.messageLine1{stroke-width:1.5;stroke-dasharray:'2 2';stroke:#d3d3d3}#arrowhead{fill:#d3d3d3}.sequenceNumber{fill:#fff}#sequencenumber{fill:#d3d3d3}#crosshead path{fill:#d3d3d3 !important;stroke:#d3d3d3 !important}.messageText{fill:#d3d3d3;stroke:none}.labelBox{stroke:#81B1DB;fill:#BDD5EA}.labelText{fill:#323D47;stroke:none}.loopText{fill:#d3d3d3;stroke:none}.loopLine{stroke-width:2;stroke-dasharray:'2 2';stroke:#81B1DB}.note{stroke:rgba(255,255,255,0.25);fill:#fff5ad}.noteText{fill:black;stroke:none;font-family:'trebuchet ms', verdana, arial;font-family:var(--mermaid-font-family);font-size:14px}.activation0{fill:#f4f4f4;stroke:#666}.activation1{fill:#f4f4f4;stroke:#666}.activation2{fill:#f4f4f4;stroke:#666}.mermaid-main-font{font-family:\"trebuchet ms\", verdana, arial;font-family:var(--mermaid-font-family)}.section{stroke:none;opacity:0.2}.section0{fill:rgba(255,255,255,0.3)}.section2{fill:#EAE8B9}.section1,.section3{fill:#fff;opacity:0.2}.sectionTitle0{fill:#F9FFFE}.sectionTitle1{fill:#F9FFFE}.sectionTitle2{fill:#F9FFFE}.sectionTitle3{fill:#F9FFFE}.sectionTitle{text-anchor:start;font-size:11px;text-height:14px;font-family:'trebuchet ms', verdana, arial;font-family:var(--mermaid-font-family)}.grid .tick{stroke:#d3d3d3;opacity:0.8;shape-rendering:crispEdges}.grid .tick text{font-family:'trebuchet ms', verdana, arial;font-family:var(--mermaid-font-family)}.grid path{stroke-width:0}.today{fill:none;stroke:#DB5757;stroke-width:2px}.task{stroke-width:2}.taskText{text-anchor:middle;font-family:'trebuchet ms', verdana, arial;font-family:var(--mermaid-font-family)}.taskText:not([font-size]){font-size:11px}.taskTextOutsideRight{fill:#323D47;text-anchor:start;font-size:11px;font-family:'trebuchet ms', verdana, arial;font-family:var(--mermaid-font-family)}.taskTextOutsideLeft{fill:#323D47;text-anchor:end;font-size:11px}.task.clickable{cursor:pointer}.taskText.clickable{cursor:pointer;fill:#003163 !important;font-weight:bold}.taskTextOutsideLeft.clickable{cursor:pointer;fill:#003163 !important;font-weight:bold}.taskTextOutsideRight.clickable{cursor:pointer;fill:#003163 !important;font-weight:bold}.taskText0,.taskText1,.taskText2,.taskText3{fill:#323D47}.task0,.task1,.task2,.task3{fill:#BDD5EA;stroke:rgba(255,255,255,0.5)}.taskTextOutside0,.taskTextOutside2{fill:#d3d3d3}.taskTextOutside1,.taskTextOutside3{fill:#d3d3d3}.active0,.active1,.active2,.active3{fill:#81B1DB;stroke:rgba(255,255,255,0.5)}.activeText0,.activeText1,.activeText2,.activeText3{fill:#323D47 !important}.done0,.done1,.done2,.done3{stroke:grey;fill:#d3d3d3;stroke-width:2}.doneText0,.doneText1,.doneText2,.doneText3{fill:#323D47 !important}.crit0,.crit1,.crit2,.crit3{stroke:#E83737;fill:#E83737;stroke-width:2}.activeCrit0,.activeCrit1,.activeCrit2,.activeCrit3{stroke:#E83737;fill:#81B1DB;stroke-width:2}.doneCrit0,.doneCrit1,.doneCrit2,.doneCrit3{stroke:#E83737;fill:#d3d3d3;stroke-width:2;cursor:pointer;shape-rendering:crispEdges}.milestone{transform:rotate(45deg) scale(0.8, 0.8)}.milestoneText{font-style:italic}.doneCritText0,.doneCritText1,.doneCritText2,.doneCritText3{fill:#323D47 !important}.activeCritText0,.activeCritText1,.activeCritText2,.activeCritText3{fill:#323D47 !important}.titleText{text-anchor:middle;font-size:18px;fill:#323D47;font-family:'trebuchet ms', verdana, arial;font-family:var(--mermaid-font-family)}g.classGroup text{fill:purple;stroke:none;font-family:'trebuchet ms', verdana, arial;font-family:var(--mermaid-font-family);font-size:10px}g.classGroup text .title{font-weight:bolder}g.clickable{cursor:pointer}g.classGroup rect{fill:#BDD5EA;stroke:purple}g.classGroup line{stroke:purple;stroke-width:1}.classLabel .box{stroke:none;stroke-width:0;fill:#BDD5EA;opacity:0.5}.classLabel .label{fill:purple;font-size:10px}.relation{stroke:purple;stroke-width:1;fill:none}.dashed-line{stroke-dasharray:3}#compositionStart{fill:purple;stroke:purple;stroke-width:1}#compositionEnd{fill:purple;stroke:purple;stroke-width:1}#aggregationStart{fill:#BDD5EA;stroke:purple;stroke-width:1}#aggregationEnd{fill:#BDD5EA;stroke:purple;stroke-width:1}#dependencyStart{fill:purple;stroke:purple;stroke-width:1}#dependencyEnd{fill:purple;stroke:purple;stroke-width:1}#extensionStart{fill:purple;stroke:purple;stroke-width:1}#extensionEnd{fill:purple;stroke:purple;stroke-width:1}.commit-id,.commit-msg,.branch-label{fill:lightgrey;color:lightgrey;font-family:'trebuchet ms', verdana, arial;font-family:var(--mermaid-font-family)}.pieTitleText{text-anchor:middle;font-size:25px;fill:#323D47;font-family:'trebuchet ms', verdana, arial;font-family:var(--mermaid-font-family)}.slice{font-family:'trebuchet ms', verdana, arial;font-family:var(--mermaid-font-family)}g.stateGroup text{fill:purple;stroke:none;font-size:10px;font-family:'trebuchet ms', verdana, arial;font-family:var(--mermaid-font-family)}g.stateGroup text{fill:purple;stroke:none;font-size:10px}g.stateGroup .state-title{font-weight:bolder;fill:#000}g.stateGroup rect{fill:#BDD5EA;stroke:purple}g.stateGroup line{stroke:purple;stroke-width:1}.transition{stroke:purple;stroke-width:1;fill:none}.stateGroup .composit{fill:white;border-bottom:1px}.stateGroup .alt-composit{fill:#e0e0e0;border-bottom:1px}.state-note{stroke:rgba(255,255,255,0.25);fill:#fff5ad}.state-note text{fill:black;stroke:none;font-size:10px}.stateLabel .box{stroke:none;stroke-width:0;fill:#BDD5EA;opacity:0.5}.stateLabel text{fill:#000;font-size:10px;font-weight:bold;font-family:'trebuchet ms', verdana, arial;font-family:var(--mermaid-font-family)}:root{--mermaid-font-family: '\"trebuchet ms\", verdana, arial';--mermaid-font-family: \"Comic Sans MS\", \"Comic Sans\", cursive}\n",""])},function(t,e,n){var r=n(504);t.exports="string"==typeof r?r:r.toString()},function(t,e,n){(t.exports=n(83)(!1)).push([t.i,".label{font-family:'trebuchet ms', verdana, arial;font-family:var(--mermaid-font-family);color:#333}.label text{fill:#333}.node rect,.node circle,.node ellipse,.node polygon,.node path{fill:#ECECFF;stroke:#9370db;stroke-width:1px}.node .label{text-align:center}.node.clickable{cursor:pointer}.arrowheadPath{fill:#333}.edgePath .path{stroke:#333;stroke-width:1.5px}.edgeLabel{background-color:#e8e8e8;text-align:center}.cluster rect{fill:#ffffde;stroke:#aa3;stroke-width:1px}.cluster text{fill:#333}div.mermaidTooltip{position:absolute;text-align:center;max-width:200px;padding:2px;font-family:'trebuchet ms', verdana, arial;font-family:var(--mermaid-font-family);font-size:12px;background:#ffffde;border:1px solid #aa3;border-radius:2px;pointer-events:none;z-index:100}.actor{stroke:#ccf;fill:#ECECFF}text.actor{fill:#000;stroke:none}.actor-line{stroke:grey}.messageLine0{stroke-width:1.5;stroke-dasharray:'2 2';stroke:#333}.messageLine1{stroke-width:1.5;stroke-dasharray:'2 2';stroke:#333}#arrowhead{fill:#333}.sequenceNumber{fill:#fff}#sequencenumber{fill:#333}#crosshead path{fill:#333 !important;stroke:#333 !important}.messageText{fill:#333;stroke:none}.labelBox{stroke:#ccf;fill:#ECECFF}.labelText{fill:#000;stroke:none}.loopText{fill:#000;stroke:none}.loopLine{stroke-width:2;stroke-dasharray:'2 2';stroke:#ccf}.note{stroke:#aa3;fill:#fff5ad}.noteText{fill:black;stroke:none;font-family:'trebuchet ms', verdana, arial;font-family:var(--mermaid-font-family);font-size:14px}.activation0{fill:#f4f4f4;stroke:#666}.activation1{fill:#f4f4f4;stroke:#666}.activation2{fill:#f4f4f4;stroke:#666}.mermaid-main-font{font-family:\"trebuchet ms\", verdana, arial;font-family:var(--mermaid-font-family)}.section{stroke:none;opacity:0.2}.section0{fill:rgba(102,102,255,0.49)}.section2{fill:#fff400}.section1,.section3{fill:#fff;opacity:0.2}.sectionTitle0{fill:#333}.sectionTitle1{fill:#333}.sectionTitle2{fill:#333}.sectionTitle3{fill:#333}.sectionTitle{text-anchor:start;font-size:11px;text-height:14px;font-family:'trebuchet ms', verdana, arial;font-family:var(--mermaid-font-family)}.grid .tick{stroke:#d3d3d3;opacity:0.8;shape-rendering:crispEdges}.grid .tick text{font-family:'trebuchet ms', verdana, arial;font-family:var(--mermaid-font-family)}.grid path{stroke-width:0}.today{fill:none;stroke:red;stroke-width:2px}.task{stroke-width:2}.taskText{text-anchor:middle;font-family:'trebuchet ms', verdana, arial;font-family:var(--mermaid-font-family)}.taskText:not([font-size]){font-size:11px}.taskTextOutsideRight{fill:#000;text-anchor:start;font-size:11px;font-family:'trebuchet ms', verdana, arial;font-family:var(--mermaid-font-family)}.taskTextOutsideLeft{fill:#000;text-anchor:end;font-size:11px}.task.clickable{cursor:pointer}.taskText.clickable{cursor:pointer;fill:#003163 !important;font-weight:bold}.taskTextOutsideLeft.clickable{cursor:pointer;fill:#003163 !important;font-weight:bold}.taskTextOutsideRight.clickable{cursor:pointer;fill:#003163 !important;font-weight:bold}.taskText0,.taskText1,.taskText2,.taskText3{fill:#fff}.task0,.task1,.task2,.task3{fill:#8a90dd;stroke:#534fbc}.taskTextOutside0,.taskTextOutside2{fill:#000}.taskTextOutside1,.taskTextOutside3{fill:#000}.active0,.active1,.active2,.active3{fill:#bfc7ff;stroke:#534fbc}.activeText0,.activeText1,.activeText2,.activeText3{fill:#000 !important}.done0,.done1,.done2,.done3{stroke:grey;fill:#d3d3d3;stroke-width:2}.doneText0,.doneText1,.doneText2,.doneText3{fill:#000 !important}.crit0,.crit1,.crit2,.crit3{stroke:#f88;fill:red;stroke-width:2}.activeCrit0,.activeCrit1,.activeCrit2,.activeCrit3{stroke:#f88;fill:#bfc7ff;stroke-width:2}.doneCrit0,.doneCrit1,.doneCrit2,.doneCrit3{stroke:#f88;fill:#d3d3d3;stroke-width:2;cursor:pointer;shape-rendering:crispEdges}.milestone{transform:rotate(45deg) scale(0.8, 0.8)}.milestoneText{font-style:italic}.doneCritText0,.doneCritText1,.doneCritText2,.doneCritText3{fill:#000 !important}.activeCritText0,.activeCritText1,.activeCritText2,.activeCritText3{fill:#000 !important}.titleText{text-anchor:middle;font-size:18px;fill:#000;font-family:'trebuchet ms', verdana, arial;font-family:var(--mermaid-font-family)}g.classGroup text{fill:#9370db;stroke:none;font-family:'trebuchet ms', verdana, arial;font-family:var(--mermaid-font-family);font-size:10px}g.classGroup text .title{font-weight:bolder}g.clickable{cursor:pointer}g.classGroup rect{fill:#ECECFF;stroke:#9370db}g.classGroup line{stroke:#9370db;stroke-width:1}.classLabel .box{stroke:none;stroke-width:0;fill:#ECECFF;opacity:0.5}.classLabel .label{fill:#9370db;font-size:10px}.relation{stroke:#9370db;stroke-width:1;fill:none}.dashed-line{stroke-dasharray:3}#compositionStart{fill:#9370db;stroke:#9370db;stroke-width:1}#compositionEnd{fill:#9370db;stroke:#9370db;stroke-width:1}#aggregationStart{fill:#ECECFF;stroke:#9370db;stroke-width:1}#aggregationEnd{fill:#ECECFF;stroke:#9370db;stroke-width:1}#dependencyStart{fill:#9370db;stroke:#9370db;stroke-width:1}#dependencyEnd{fill:#9370db;stroke:#9370db;stroke-width:1}#extensionStart{fill:#9370db;stroke:#9370db;stroke-width:1}#extensionEnd{fill:#9370db;stroke:#9370db;stroke-width:1}.commit-id,.commit-msg,.branch-label{fill:lightgrey;color:lightgrey;font-family:'trebuchet ms', verdana, arial;font-family:var(--mermaid-font-family)}.pieTitleText{text-anchor:middle;font-size:25px;fill:#000;font-family:'trebuchet ms', verdana, arial;font-family:var(--mermaid-font-family)}.slice{font-family:'trebuchet ms', verdana, arial;font-family:var(--mermaid-font-family)}g.stateGroup text{fill:#9370db;stroke:none;font-size:10px;font-family:'trebuchet ms', verdana, arial;font-family:var(--mermaid-font-family)}g.stateGroup text{fill:#9370db;stroke:none;font-size:10px}g.stateGroup .state-title{font-weight:bolder;fill:#000}g.stateGroup rect{fill:#ECECFF;stroke:#9370db}g.stateGroup line{stroke:#9370db;stroke-width:1}.transition{stroke:#9370db;stroke-width:1;fill:none}.stateGroup .composit{fill:white;border-bottom:1px}.stateGroup .alt-composit{fill:#e0e0e0;border-bottom:1px}.state-note{stroke:#aa3;fill:#fff5ad}.state-note text{fill:black;stroke:none;font-size:10px}.stateLabel .box{stroke:none;stroke-width:0;fill:#ECECFF;opacity:0.5}.stateLabel text{fill:#000;font-size:10px;font-weight:bold;font-family:'trebuchet ms', verdana, arial;font-family:var(--mermaid-font-family)}:root{--mermaid-font-family: '\"trebuchet ms\", verdana, arial';--mermaid-font-family: \"Comic Sans MS\", \"Comic Sans\", cursive}\n",""])},function(t,e,n){var r=n(506);t.exports="string"==typeof r?r:r.toString()},function(t,e,n){(t.exports=n(83)(!1)).push([t.i,".label{font-family:'trebuchet ms', verdana, arial;font-family:var(--mermaid-font-family);color:#333}.label text{fill:#333}.node rect,.node circle,.node ellipse,.node polygon,.node path{fill:#cde498;stroke:#13540c;stroke-width:1px}.node .label{text-align:center}.node.clickable{cursor:pointer}.arrowheadPath{fill:green}.edgePath .path{stroke:green;stroke-width:1.5px}.edgeLabel{background-color:#e8e8e8;text-align:center}.cluster rect{fill:#cdffb2;stroke:#6eaa49;stroke-width:1px}.cluster text{fill:#333}div.mermaidTooltip{position:absolute;text-align:center;max-width:200px;padding:2px;font-family:'trebuchet ms', verdana, arial;font-family:var(--mermaid-font-family);font-size:12px;background:#cdffb2;border:1px solid #6eaa49;border-radius:2px;pointer-events:none;z-index:100}.actor{stroke:#13540c;fill:#cde498}text.actor{fill:#000;stroke:none}.actor-line{stroke:grey}.messageLine0{stroke-width:1.5;stroke-dasharray:'2 2';stroke:#333}.messageLine1{stroke-width:1.5;stroke-dasharray:'2 2';stroke:#333}#arrowhead{fill:#333}.sequenceNumber{fill:#fff}#sequencenumber{fill:#333}#crosshead path{fill:#333 !important;stroke:#333 !important}.messageText{fill:#333;stroke:none}.labelBox{stroke:#326932;fill:#cde498}.labelText{fill:#000;stroke:none}.loopText{fill:#000;stroke:none}.loopLine{stroke-width:2;stroke-dasharray:'2 2';stroke:#326932}.note{stroke:#6eaa49;fill:#fff5ad}.noteText{fill:black;stroke:none;font-family:'trebuchet ms', verdana, arial;font-family:var(--mermaid-font-family);font-size:14px}.activation0{fill:#f4f4f4;stroke:#666}.activation1{fill:#f4f4f4;stroke:#666}.activation2{fill:#f4f4f4;stroke:#666}.mermaid-main-font{font-family:\"trebuchet ms\", verdana, arial;font-family:var(--mermaid-font-family)}.section{stroke:none;opacity:0.2}.section0{fill:#6eaa49}.section2{fill:#6eaa49}.section1,.section3{fill:#fff;opacity:0.2}.sectionTitle0{fill:#333}.sectionTitle1{fill:#333}.sectionTitle2{fill:#333}.sectionTitle3{fill:#333}.sectionTitle{text-anchor:start;font-size:11px;text-height:14px;font-family:'trebuchet ms', verdana, arial;font-family:var(--mermaid-font-family)}.grid .tick{stroke:#d3d3d3;opacity:0.8;shape-rendering:crispEdges}.grid .tick text{font-family:'trebuchet ms', verdana, arial;font-family:var(--mermaid-font-family)}.grid path{stroke-width:0}.today{fill:none;stroke:red;stroke-width:2px}.task{stroke-width:2}.taskText{text-anchor:middle;font-family:'trebuchet ms', verdana, arial;font-family:var(--mermaid-font-family)}.taskText:not([font-size]){font-size:11px}.taskTextOutsideRight{fill:#000;text-anchor:start;font-size:11px;font-family:'trebuchet ms', verdana, arial;font-family:var(--mermaid-font-family)}.taskTextOutsideLeft{fill:#000;text-anchor:end;font-size:11px}.task.clickable{cursor:pointer}.taskText.clickable{cursor:pointer;fill:#003163 !important;font-weight:bold}.taskTextOutsideLeft.clickable{cursor:pointer;fill:#003163 !important;font-weight:bold}.taskTextOutsideRight.clickable{cursor:pointer;fill:#003163 !important;font-weight:bold}.taskText0,.taskText1,.taskText2,.taskText3{fill:#fff}.task0,.task1,.task2,.task3{fill:#487e3a;stroke:#13540c}.taskTextOutside0,.taskTextOutside2{fill:#000}.taskTextOutside1,.taskTextOutside3{fill:#000}.active0,.active1,.active2,.active3{fill:#cde498;stroke:#13540c}.activeText0,.activeText1,.activeText2,.activeText3{fill:#000 !important}.done0,.done1,.done2,.done3{stroke:grey;fill:#d3d3d3;stroke-width:2}.doneText0,.doneText1,.doneText2,.doneText3{fill:#000 !important}.crit0,.crit1,.crit2,.crit3{stroke:#f88;fill:red;stroke-width:2}.activeCrit0,.activeCrit1,.activeCrit2,.activeCrit3{stroke:#f88;fill:#cde498;stroke-width:2}.doneCrit0,.doneCrit1,.doneCrit2,.doneCrit3{stroke:#f88;fill:#d3d3d3;stroke-width:2;cursor:pointer;shape-rendering:crispEdges}.milestone{transform:rotate(45deg) scale(0.8, 0.8)}.milestoneText{font-style:italic}.doneCritText0,.doneCritText1,.doneCritText2,.doneCritText3{fill:#000 !important}.activeCritText0,.activeCritText1,.activeCritText2,.activeCritText3{fill:#000 !important}.titleText{text-anchor:middle;font-size:18px;fill:#000;font-family:'trebuchet ms', verdana, arial;font-family:var(--mermaid-font-family)}g.classGroup text{fill:#13540c;stroke:none;font-family:'trebuchet ms', verdana, arial;font-family:var(--mermaid-font-family);font-size:10px}g.classGroup text .title{font-weight:bolder}g.clickable{cursor:pointer}g.classGroup rect{fill:#cde498;stroke:#13540c}g.classGroup line{stroke:#13540c;stroke-width:1}.classLabel .box{stroke:none;stroke-width:0;fill:#cde498;opacity:0.5}.classLabel .label{fill:#13540c;font-size:10px}.relation{stroke:#13540c;stroke-width:1;fill:none}.dashed-line{stroke-dasharray:3}#compositionStart{fill:#13540c;stroke:#13540c;stroke-width:1}#compositionEnd{fill:#13540c;stroke:#13540c;stroke-width:1}#aggregationStart{fill:#cde498;stroke:#13540c;stroke-width:1}#aggregationEnd{fill:#cde498;stroke:#13540c;stroke-width:1}#dependencyStart{fill:#13540c;stroke:#13540c;stroke-width:1}#dependencyEnd{fill:#13540c;stroke:#13540c;stroke-width:1}#extensionStart{fill:#13540c;stroke:#13540c;stroke-width:1}#extensionEnd{fill:#13540c;stroke:#13540c;stroke-width:1}.commit-id,.commit-msg,.branch-label{fill:lightgrey;color:lightgrey;font-family:'trebuchet ms', verdana, arial;font-family:var(--mermaid-font-family)}.pieTitleText{text-anchor:middle;font-size:25px;fill:#000;font-family:'trebuchet ms', verdana, arial;font-family:var(--mermaid-font-family)}.slice{font-family:'trebuchet ms', verdana, arial;font-family:var(--mermaid-font-family)}g.stateGroup text{fill:#13540c;stroke:none;font-size:10px;font-family:'trebuchet ms', verdana, arial;font-family:var(--mermaid-font-family)}g.stateGroup text{fill:#13540c;stroke:none;font-size:10px}g.stateGroup .state-title{font-weight:bolder;fill:#000}g.stateGroup rect{fill:#cde498;stroke:#13540c}g.stateGroup line{stroke:#13540c;stroke-width:1}.transition{stroke:#13540c;stroke-width:1;fill:none}.stateGroup .composit{fill:white;border-bottom:1px}.stateGroup .alt-composit{fill:#e0e0e0;border-bottom:1px}.state-note{stroke:#6eaa49;fill:#fff5ad}.state-note text{fill:black;stroke:none;font-size:10px}.stateLabel .box{stroke:none;stroke-width:0;fill:#cde498;opacity:0.5}.stateLabel text{fill:#000;font-size:10px;font-weight:bold;font-family:'trebuchet ms', verdana, arial;font-family:var(--mermaid-font-family)}:root{--mermaid-font-family: '\"trebuchet ms\", verdana, arial';--mermaid-font-family: \"Comic Sans MS\", \"Comic Sans\", cursive}\n",""])},function(t,e,n){var r=n(508);t.exports="string"==typeof r?r:r.toString()},function(t,e,n){(t.exports=n(83)(!1)).push([t.i,".label{font-family:'trebuchet ms', verdana, arial;font-family:var(--mermaid-font-family);color:#333}.label text{fill:#333}.node rect,.node circle,.node ellipse,.node polygon,.node path{fill:#eee;stroke:#999;stroke-width:1px}.node .label{text-align:center}.node.clickable{cursor:pointer}.arrowheadPath{fill:#333}.edgePath .path{stroke:#666;stroke-width:1.5px}.edgeLabel{background-color:#fff;text-align:center}.cluster rect{fill:#eaf2fb;stroke:#26a;stroke-width:1px}.cluster text{fill:#333}div.mermaidTooltip{position:absolute;text-align:center;max-width:200px;padding:2px;font-family:'trebuchet ms', verdana, arial;font-family:var(--mermaid-font-family);font-size:12px;background:#eaf2fb;border:1px solid #26a;border-radius:2px;pointer-events:none;z-index:100}.actor{stroke:#999;fill:#eee}text.actor{fill:#333;stroke:none}.actor-line{stroke:#666}.messageLine0{stroke-width:1.5;stroke-dasharray:'2 2';stroke:#333}.messageLine1{stroke-width:1.5;stroke-dasharray:'2 2';stroke:#333}#arrowhead{fill:#333}.sequenceNumber{fill:#fff}#sequencenumber{fill:#333}#crosshead path{fill:#333 !important;stroke:#333 !important}.messageText{fill:#333;stroke:none}.labelBox{stroke:#999;fill:#eee}.labelText{fill:#333;stroke:none}.loopText{fill:#333;stroke:none}.loopLine{stroke-width:2;stroke-dasharray:'2 2';stroke:#999}.note{stroke:#770;fill:#ffa}.noteText{fill:black;stroke:none;font-family:'trebuchet ms', verdana, arial;font-family:var(--mermaid-font-family);font-size:14px}.activation0{fill:#f4f4f4;stroke:#666}.activation1{fill:#f4f4f4;stroke:#666}.activation2{fill:#f4f4f4;stroke:#666}.mermaid-main-font{font-family:\"trebuchet ms\", verdana, arial;font-family:var(--mermaid-font-family)}.section{stroke:none;opacity:0.2}.section0{fill:#80b3e6}.section2{fill:#80b3e6}.section1,.section3{fill:#fff;opacity:0.2}.sectionTitle0{fill:#333}.sectionTitle1{fill:#333}.sectionTitle2{fill:#333}.sectionTitle3{fill:#333}.sectionTitle{text-anchor:start;font-size:11px;text-height:14px;font-family:'trebuchet ms', verdana, arial;font-family:var(--mermaid-font-family)}.grid .tick{stroke:#e6e6e6;opacity:0.8;shape-rendering:crispEdges}.grid .tick text{font-family:'trebuchet ms', verdana, arial;font-family:var(--mermaid-font-family)}.grid path{stroke-width:0}.today{fill:none;stroke:#d42;stroke-width:2px}.task{stroke-width:2}.taskText{text-anchor:middle;font-family:'trebuchet ms', verdana, arial;font-family:var(--mermaid-font-family)}.taskText:not([font-size]){font-size:11px}.taskTextOutsideRight{fill:#333;text-anchor:start;font-size:11px;font-family:'trebuchet ms', verdana, arial;font-family:var(--mermaid-font-family)}.taskTextOutsideLeft{fill:#333;text-anchor:end;font-size:11px}.task.clickable{cursor:pointer}.taskText.clickable{cursor:pointer;fill:#003163 !important;font-weight:bold}.taskTextOutsideLeft.clickable{cursor:pointer;fill:#003163 !important;font-weight:bold}.taskTextOutsideRight.clickable{cursor:pointer;fill:#003163 !important;font-weight:bold}.taskText0,.taskText1,.taskText2,.taskText3{fill:#fff}.task0,.task1,.task2,.task3{fill:#26a;stroke:#1a4d80}.taskTextOutside0,.taskTextOutside2{fill:#333}.taskTextOutside1,.taskTextOutside3{fill:#333}.active0,.active1,.active2,.active3{fill:#eee;stroke:#1a4d80}.activeText0,.activeText1,.activeText2,.activeText3{fill:#333 !important}.done0,.done1,.done2,.done3{stroke:#666;fill:#bbb;stroke-width:2}.doneText0,.doneText1,.doneText2,.doneText3{fill:#333 !important}.crit0,.crit1,.crit2,.crit3{stroke:#b1361b;fill:#d42;stroke-width:2}.activeCrit0,.activeCrit1,.activeCrit2,.activeCrit3{stroke:#b1361b;fill:#eee;stroke-width:2}.doneCrit0,.doneCrit1,.doneCrit2,.doneCrit3{stroke:#b1361b;fill:#bbb;stroke-width:2;cursor:pointer;shape-rendering:crispEdges}.milestone{transform:rotate(45deg) scale(0.8, 0.8)}.milestoneText{font-style:italic}.doneCritText0,.doneCritText1,.doneCritText2,.doneCritText3{fill:#333 !important}.activeCritText0,.activeCritText1,.activeCritText2,.activeCritText3{fill:#333 !important}.titleText{text-anchor:middle;font-size:18px;fill:#333;font-family:'trebuchet ms', verdana, arial;font-family:var(--mermaid-font-family)}g.classGroup text{fill:#999;stroke:none;font-family:'trebuchet ms', verdana, arial;font-family:var(--mermaid-font-family);font-size:10px}g.classGroup text .title{font-weight:bolder}g.clickable{cursor:pointer}g.classGroup rect{fill:#eee;stroke:#999}g.classGroup line{stroke:#999;stroke-width:1}.classLabel .box{stroke:none;stroke-width:0;fill:#eee;opacity:0.5}.classLabel .label{fill:#999;font-size:10px}.relation{stroke:#999;stroke-width:1;fill:none}.dashed-line{stroke-dasharray:3}#compositionStart{fill:#999;stroke:#999;stroke-width:1}#compositionEnd{fill:#999;stroke:#999;stroke-width:1}#aggregationStart{fill:#eee;stroke:#999;stroke-width:1}#aggregationEnd{fill:#eee;stroke:#999;stroke-width:1}#dependencyStart{fill:#999;stroke:#999;stroke-width:1}#dependencyEnd{fill:#999;stroke:#999;stroke-width:1}#extensionStart{fill:#999;stroke:#999;stroke-width:1}#extensionEnd{fill:#999;stroke:#999;stroke-width:1}.commit-id,.commit-msg,.branch-label{fill:lightgrey;color:lightgrey;font-family:'trebuchet ms', verdana, arial;font-family:var(--mermaid-font-family)}.pieTitleText{text-anchor:middle;font-size:25px;fill:#333;font-family:'trebuchet ms', verdana, arial;font-family:var(--mermaid-font-family)}.slice{font-family:'trebuchet ms', verdana, arial;font-family:var(--mermaid-font-family)}g.stateGroup text{fill:#999;stroke:none;font-size:10px;font-family:'trebuchet ms', verdana, arial;font-family:var(--mermaid-font-family)}g.stateGroup text{fill:#999;stroke:none;font-size:10px}g.stateGroup .state-title{font-weight:bolder;fill:#000}g.stateGroup rect{fill:#eee;stroke:#999}g.stateGroup line{stroke:#999;stroke-width:1}.transition{stroke:#999;stroke-width:1;fill:none}.stateGroup .composit{fill:white;border-bottom:1px}.stateGroup .alt-composit{fill:#e0e0e0;border-bottom:1px}.state-note{stroke:#770;fill:#ffa}.state-note text{fill:black;stroke:none;font-size:10px}.stateLabel .box{stroke:none;stroke-width:0;fill:#eee;opacity:0.5}.stateLabel text{fill:#000;font-size:10px;font-weight:bold;font-family:'trebuchet ms', verdana, arial;font-family:var(--mermaid-font-family)}:root{--mermaid-font-family: '\"trebuchet ms\", verdana, arial';--mermaid-font-family: \"Comic Sans MS\", \"Comic Sans\", cursive}\n",""])},function(t,e,n){"use strict";n.r(e);var r=n(228),i=n.n(r),a=n(0),o=n(229),s=n.n(o),u=n(88);function c(t){return(c="function"==typeof Symbol&&"symbol"==typeof Symbol.iterator?function(t){return typeof t}:function(t){return t&&"function"==typeof Symbol&&t.constructor===Symbol&&t!==Symbol.prototype?"symbol":typeof t})(t)}var f={},l=function(t){!function(t){for(var e=Object.keys(t),n=0;n<e.length;n++)if("object"===c(t[e[n]])&&null!=t[e[n]])for(var r=Object.keys(t[e[n]]),i=0;i<r.length;i++)void 0===f[e[n]]&&(f[e[n]]={}),f[e[n]][r[i]]=t[e[n]][r[i]];else f[e[n]]=t[e[n]]}(t)},h=function(){return f},d=n(22),p=n.n(d),g=1,y=2,b=3,v=4,m=5,_={debug:function(){},info:function(){},warn:function(){},error:function(){},fatal:function(){}},w=function(t){_.debug=function(){},_.info=function(){},_.warn=function(){},_.error=function(){},_.fatal=function(){},t<=m&&(_.fatal=console.error?console.error.bind(console,x("FATAL"),"color: orange"):console.log.bind(console,"[35m",x("FATAL"))),t<=v&&(_.error=console.error?console.error.bind(console,x("ERROR"),"color: orange"):console.log.bind(console,"[31m",x("ERROR"))),t<=b&&(_.warn=console.warn?console.warn.bind(console,x("WARN"),"color: orange"):console.log.bind(console,"[33m",x("WARN"))),t<=y&&(_.info=console.info?console.info.bind(console,x("INFO"),"color: lightblue"):console.log.bind(console,"[34m",x("INFO"))),t<=g&&(_.debug=console.debug?console.debug.bind(console,x("DEBUG"),"color: lightgreen"):console.log.bind(console,"[32m",x("DEBUG")))},x=function(t){var e=p()().format("ss.SSS");return"%c".concat(e," : ").concat(t," : ")},k=n(84),E=function(t,e){if(!t)return e;var n="curve".concat(t.charAt(0).toUpperCase()+t.slice(1));return a[n]||e},A=function(t,e){return t&&e?Math.sqrt(Math.pow(e.x-t.x,2)+Math.pow(e.y-t.y,2)):0},S=function(t){for(var e="",n="",r=0;r<t.length;r++)void 0!==t[r]&&(t[r].startsWith("color:")||t[r].startsWith("text-align:")?n=n+t[r]+";":e=e+t[r]+";");return{style:e,labelStyle:n}},M=function(t){return t=t.replace(/^\s*%%.*\n/g,"\n"),_.debug("Detecting diagram type based on the text "+t),t.match(/^\s*sequenceDiagram/)?"sequence":t.match(/^\s*gantt/)?"gantt":t.match(/^\s*classDiagram/)?"class":t.match(/^\s*stateDiagram/)?"state":t.match(/^\s*gitGraph/)?"git":t.match(/^\s*info/)?"info":t.match(/^\s*pie/)?"pie":"flowchart"},T=function(t,e){for(var n=0;n<e.length;n++)if(e[n].match(t))return n;return-1},D=function(t){return function(t){var e,n=0;t.forEach((function(t){n+=A(t,e),e=t}));var r,i=n/2;return e=void 0,t.forEach((function(t){if(e&&!r){var n=A(t,e);if(n<i)i-=n;else{var a=i/n;a<=0&&(r=e),a>=1&&(r={x:t.x,y:t.y}),a>0&&a<1&&(r={x:(1-a)*e.x+a*t.x,y:(1-a)*e.y+a*t.y})}}e=t})),r}(t)},C=function(t,e,n){var r;e[0]!==n&&(e=e.reverse()),e.forEach((function(t){A(t,r),r=t}));var i,a=25;r=void 0,e.forEach((function(t){if(r&&!i){var e=A(t,r);if(e<a)a-=e;else{var n=a/e;n<=0&&(i=r),n>=1&&(i={x:t.x,y:t.y}),n>0&&n<1&&(i={x:(1-n)*r.x+n*t.x,y:(1-n)*r.y+n*t.y})}}r=t}));var o=t?10:5,s=Math.atan2(e[0].y-i.y,e[0].x-i.x),u={x:0,y:0};return u.x=Math.sin(s)*o+(e[0].x+i.x)/2,u.y=-Math.cos(s)*o+(e[0].y+i.y)/2,u},N=function(t,e){var n=t,r=!0;return!e.flowchart||!1!==e.flowchart.htmlLabels&&"false"!==e.flowchart.htmlLabels||(r=!1),"loose"!==e.securityLevel&&r&&(n=(n=(n=(n=n.replace(/<br\s*\/?>/gi,"#br#")).replace(/</g,"<").replace(/>/g,">")).replace(/=/g,"=")).replace(/#br#/g,"<br/>")),n},I=function(t,e){var n=t.trim();if(n)return"loose"!==e.securityLevel?Object(k.sanitizeUrl)(n):n},L=n(25),B=n.n(L);function O(t){return(O="function"==typeof Symbol&&"symbol"==typeof Symbol.iterator?function(t){return typeof t}:function(t){return t&&"function"==typeof Symbol&&t.constructor===Symbol&&t!==Symbol.prototype?"symbol":typeof t})(t)}var R,P=h(),F={},q=[],j=[],U=[],z={},Y={},V=0,H=!0,G=[],$=function(t,e,n,r){var i=t,a=e;i[0].match(/\d/)&&(i=""+i),a[0].match(/\d/)&&(a=""+a),_.info("Got edge...",i,a);var o={start:i,end:a,type:void 0,text:""};void 0!==(r=n.text)&&(o.text=N(r.trim(),P),'"'===o.text[0]&&'"'===o.text[o.text.length-1]&&(o.text=o.text.substring(1,o.text.length-1))),void 0!==n&&(o.type=n.type,o.stroke=n.stroke),q.push(o)},W=function(t,e){t.split(",").forEach((function(t){var n=t;t[0].match(/\d/)&&(n=""+n),void 0!==F[n]&&F[n].classes.push(e),void 0!==z[n]&&z[n].classes.push(e)}))},K=function(t,e){t.split(",").forEach((function(t){void 0!==e&&(Y[t]=N(e,P))}))},X=function(t){var e=a.select(".mermaidTooltip");null===(e._groups||e)[0][0]&&(e=a.select("body").append("div").attr("class","mermaidTooltip").style("opacity",0)),a.select(t).select("svg").selectAll("g.node").on("mouseover",(function(){var t=a.select(this);if(null!==t.attr("title")){var n=this.getBoundingClientRect();e.transition().duration(200).style("opacity",".9"),e.html(t.attr("title")).style("left",n.left+(n.right-n.left)/2+"px").style("top",n.top-14+document.body.scrollTop+"px"),t.classed("hover",!0)}})).on("mouseout",(function(){e.transition().duration(500).style("opacity",0),a.select(this).classed("hover",!1)}))};G.push(X);var Z=function(t){for(var e=0;e<U.length;e++)if(U[e].id===t)return e;return-1},J=-1,Q=[],tt={addVertex:function(t,e,n,r,i){var a,o=t;void 0!==o&&0!==o.trim().length&&(o[0].match(/\d/)&&(o=""+o),void 0===F[o]&&(F[o]={id:o,styles:[],classes:[]}),void 0!==e?('"'===(a=N(e.trim(),P))[0]&&'"'===a[a.length-1]&&(a=a.substring(1,a.length-1)),F[o].text=a):void 0===F[o].text&&(F[o].text=t),void 0!==n&&(F[o].type=n),null!=r&&r.forEach((function(t){F[o].styles.push(t)})),null!=i&&i.forEach((function(t){F[o].classes.push(t)})))},addLink:function(t,e,n,r){var i,a;for(i=0;i<t.length;i++)for(a=0;a<e.length;a++)$(t[i],e[a],n,r)},updateLinkInterpolate:function(t,e){t.forEach((function(t){"default"===t?q.defaultInterpolate=e:q[t].interpolate=e}))},updateLink:function(t,e){t.forEach((function(t){"default"===t?q.defaultStyle=e:(-1===T("fill",e)&&e.push("fill:none"),q[t].style=e)}))},addClass:function(t,e){void 0===j[t]&&(j[t]={id:t,styles:[],textStyles:[]}),null!=e&&e.forEach((function(e){if(e.match("color")){var n=e.replace("fill","bgFill").replace("color","fill");j[t].textStyles.push(n)}j[t].styles.push(e)}))},setDirection:function(t){(R=t).match(/.*</)&&(R="RL"),R.match(/.*\^/)&&(R="BT"),R.match(/.*>/)&&(R="LR"),R.match(/.*v/)&&(R="TB")},setClass:W,getTooltip:function(t){return Y[t]},setClickEvent:function(t,e,n){t.split(",").forEach((function(t){!function(t,e){var n=t;t[0].match(/\d/)&&(n=""+n),"loose"===P.securityLevel&&void 0!==e&&void 0!==F[n]&&G.push((function(){var t=document.querySelector('[id="'.concat(n,'"]'));null!==t&&t.addEventListener("click",(function(){window[e](n)}),!1)}))}(t,e)})),K(t,n),W(t,"clickable")},setLink:function(t,e,n){t.split(",").forEach((function(t){var n=t;t[0].match(/\d/)&&(n=""+n),void 0!==F[n]&&(F[n].link=I(e,P))})),K(t,n),W(t,"clickable")},bindFunctions:function(t){G.forEach((function(e){e(t)}))},getDirection:function(){return R.trim()},getVertices:function(){return F},getEdges:function(){return q},getClasses:function(){return j},clear:function(){F={},j={},q=[],(G=[]).push(X),U=[],z={},V=0,Y=[],H=!0},defaultStyle:function(){return"fill:#ffa;stroke: #f66; stroke-width: 3px; stroke-dasharray: 5, 5;fill:#ffa;stroke: #666;"},addSubGraph:function(t,e,n){var r=t.trim(),i=n;t===n&&n.match(/\s/)&&(r=void 0);var a,o,s,u=[];a=u.concat.apply(u,e),o={boolean:{},number:{},string:{}},s=[],u=a.filter((function(t){var e=O(t);return""!==t.trim()&&(e in o?!o[e].hasOwnProperty(t)&&(o[e][t]=!0):!(s.indexOf(t)>=0)&&s.push(t))}));for(var c=0;c<u.length;c++)u[c][0].match(/\d/)&&(u[c]=""+u[c]);(r=r||"subGraph"+V)[0].match(/\d/)&&(r=""+r),i=N(i=i||"",P),V+=1;var f={id:r,nodes:u,title:i.trim(),classes:[]};return U.push(f),z[r]=f,r},getDepthFirstPos:function(t){return Q[t]},indexNodes:function(){J=-1,U.length>0&&function t(e,n){var r=U[n].nodes;if(!((J+=1)>2e3)){if(Q[J]=n,U[n].id===e)return{result:!0,count:0};for(var i=0,a=1;i<r.length;){var o=Z(r[i]);if(o>=0){var s=t(e,o);if(s.result)return{result:!0,count:a+s.count};a+=s.count}i+=1}return{result:!1,count:a}}}("none",U.length-1)},getSubGraphs:function(){return U},destructLink:function(t,e){var n,r=function(t){switch(t.trim()){case"--x":return{type:"arrow_cross",stroke:"normal"};case"--\x3e":return{type:"arrow",stroke:"normal"};case"<--\x3e":return{type:"double_arrow_point",stroke:"normal"};case"x--x":return{type:"double_arrow_cross",stroke:"normal"};case"o--o":return{type:"double_arrow_circle",stroke:"normal"};case"o.-o":return{type:"double_arrow_circle",stroke:"dotted"};case"<==>":return{type:"double_arrow_point",stroke:"thick"};case"o==o":return{type:"double_arrow_circle",stroke:"thick"};case"x==x":return{type:"double_arrow_cross",stroke:"thick"};case"x.-x":case"x-.-x":return{type:"double_arrow_cross",stroke:"dotted"};case"<.->":case"<-.->":return{type:"double_arrow_point",stroke:"dotted"};case"o-.-o":return{type:"double_arrow_circle",stroke:"dotted"};case"--o":return{type:"arrow_circle",stroke:"normal"};case"---":return{type:"arrow_open",stroke:"normal"};case"-.-x":return{type:"arrow_cross",stroke:"dotted"};case"-.->":return{type:"arrow",stroke:"dotted"};case"-.-o":return{type:"arrow_circle",stroke:"dotted"};case"-.-":return{type:"arrow_open",stroke:"dotted"};case".-x":return{type:"arrow_cross",stroke:"dotted"};case".->":return{type:"arrow",stroke:"dotted"};case".-o":return{type:"arrow_circle",stroke:"dotted"};case".-":return{type:"arrow_open",stroke:"dotted"};case"==x":return{type:"arrow_cross",stroke:"thick"};case"==>":return{type:"arrow",stroke:"thick"};case"==o":return{type:"arrow_circle",stroke:"thick"};case"===":return{type:"arrow_open",stroke:"thick"}}}(t);if(e){if((n=function(t){switch(t.trim()){case"<--":return{type:"arrow",stroke:"normal"};case"x--":return{type:"arrow_cross",stroke:"normal"};case"o--":return{type:"arrow_circle",stroke:"normal"};case"<-.":return{type:"arrow",stroke:"dotted"};case"x-.":return{type:"arrow_cross",stroke:"dotted"};case"o-.":return{type:"arrow_circle",stroke:"dotted"};case"<==":return{type:"arrow",stroke:"thick"};case"x==":return{type:"arrow_cross",stroke:"thick"};case"o==":return{type:"arrow_circle",stroke:"thick"};case"--":return{type:"arrow_open",stroke:"normal"};case"==":return{type:"arrow_open",stroke:"thick"};case"-.":return{type:"arrow_open",stroke:"dotted"}}}(e)).stroke!==r.stroke)return{type:"INVALID",stroke:"INVALID"};if("arrow_open"===n.type)n.type=r.type;else{if(n.type!==r.type)return{type:"INVALID",stroke:"INVALID"};n.type="double_"+n.type}return"double_arrow"===n.type&&(n.type="double_arrow_point"),n}return r},lex:{firstGraph:function(){return!!H&&(H=!1,!0)}}},et=n(60),nt=n.n(et),rt=n(11),it=n.n(rt),at=n(128),ot=n.n(at);function st(t,e,n){var r=.9*(e.width+e.height),i=[{x:r/2,y:0},{x:r,y:-r/2},{x:r/2,y:-r},{x:0,y:-r/2}],a=bt(t,r,r,i);return n.intersect=function(t){return it.a.intersect.polygon(n,i,t)},a}function ut(t,e,n){var r=e.height,i=r/4,a=e.width+2*i,o=[{x:i,y:0},{x:a-i,y:0},{x:a,y:-r/2},{x:a-i,y:-r},{x:i,y:-r},{x:0,y:-r/2}],s=bt(t,a,r,o);return n.intersect=function(t){return it.a.intersect.polygon(n,o,t)},s}function ct(t,e,n){var r=e.width,i=e.height,a=[{x:-i/2,y:0},{x:r,y:0},{x:r,y:-i},{x:-i/2,y:-i},{x:0,y:-i/2}],o=bt(t,r,i,a);return n.intersect=function(t){return it.a.intersect.polygon(n,a,t)},o}function ft(t,e,n){var r=e.width,i=e.height,a=[{x:-2*i/6,y:0},{x:r-i/6,y:0},{x:r+2*i/6,y:-i},{x:i/6,y:-i}],o=bt(t,r,i,a);return n.intersect=function(t){return it.a.intersect.polygon(n,a,t)},o}function lt(t,e,n){var r=e.width,i=e.height,a=[{x:2*i/6,y:0},{x:r+i/6,y:0},{x:r-2*i/6,y:-i},{x:-i/6,y:-i}],o=bt(t,r,i,a);return n.intersect=function(t){return it.a.intersect.polygon(n,a,t)},o}function ht(t,e,n){var r=e.width,i=e.height,a=[{x:-2*i/6,y:0},{x:r+2*i/6,y:0},{x:r-i/6,y:-i},{x:i/6,y:-i}],o=bt(t,r,i,a);return n.intersect=function(t){return it.a.intersect.polygon(n,a,t)},o}function dt(t,e,n){var r=e.width,i=e.height,a=[{x:i/6,y:0},{x:r-i/6,y:0},{x:r+2*i/6,y:-i},{x:-2*i/6,y:-i}],o=bt(t,r,i,a);return n.intersect=function(t){return it.a.intersect.polygon(n,a,t)},o}function pt(t,e,n){var r=e.width,i=e.height,a=[{x:0,y:0},{x:r+i/2,y:0},{x:r,y:-i/2},{x:r+i/2,y:-i},{x:0,y:-i}],o=bt(t,r,i,a);return n.intersect=function(t){return it.a.intersect.polygon(n,a,t)},o}function gt(t,e,n){var r=e.height,i=e.width+r/4,a=t.insert("rect",":first-child").attr("rx",r/2).attr("ry",r/2).attr("x",-i/2).attr("y",-r/2).attr("width",i).attr("height",r);return n.intersect=function(t){return it.a.intersect.rect(n,t)},a}function yt(t,e,n){var r=e.width,i=r/2,a=i/(2.5+r/50),o=e.height+a,s="M 0,"+a+" a "+i+","+a+" 0,0,0 "+r+" 0 a "+i+","+a+" 0,0,0 "+-r+" 0 l 0,"+o+" a "+i+","+a+" 0,0,0 "+r+" 0 l 0,"+-o,u=t.attr("label-offset-y",a).insert("path",":first-child").attr("d",s).attr("transform","translate("+-r/2+","+-(o/2+a)+")");return n.intersect=function(t){var e=it.a.intersect.rect(n,t),r=e.x-n.x;if(0!=i&&(Math.abs(r)<n.width/2||Math.abs(r)==n.width/2&&Math.abs(e.y-n.y)>n.height/2-a)){var o=a*a*(1-r*r/(i*i));0!=o&&(o=Math.sqrt(o)),o=a-o,t.y-n.y>0&&(o=-o),e.y+=o}return e},u}function bt(t,e,n,r){return t.insert("polygon",":first-child").attr("points",r.map((function(t){return t.x+","+t.y})).join(" ")).attr("transform","translate("+-e/2+","+n/2+")")}var vt={addToRender:function(t){t.shapes().question=st,t.shapes().hexagon=ut,t.shapes().stadium=gt,t.shapes().cylinder=yt,t.shapes().rect_left_inv_arrow=ct,t.shapes().lean_right=ft,t.shapes().lean_left=lt,t.shapes().trapezoid=ht,t.shapes().inv_trapezoid=dt,t.shapes().rect_right_inv_arrow=pt}},mt={},_t=function(t,e,n){var r=a.select('[id="'.concat(n,'"]'));Object.keys(t).forEach((function(n){var i=t[n],a="";i.classes.length>0&&(a=i.classes.join(" "));var o,s=S(i.styles),u=void 0!==i.text?i.text:i.id;if(h().flowchart.htmlLabels){var c={label:u.replace(/fa[lrsb]?:fa-[\w-]+/g,(function(t){return"<i class='".concat(t.replace(":"," "),"'></i>")}))};(o=ot()(r,c).node()).parentNode.removeChild(o)}else{var f=document.createElementNS("http://www.w3.org/2000/svg","text");f.setAttribute("style",s.labelStyle.replace("color:","fill:"));for(var l=u.split(/<br\s*\/?>/gi),d=0;d<l.length;d++){var p=document.createElementNS("http://www.w3.org/2000/svg","tspan");p.setAttributeNS("http://www.w3.org/XML/1998/namespace","xml:space","preserve"),p.setAttribute("dy","1em"),p.setAttribute("x","1"),p.textContent=l[d],f.appendChild(p)}o=f}var g=0,y="";switch(i.type){case"round":g=5,y="rect";break;case"square":y="rect";break;case"diamond":y="question";break;case"hexagon":y="hexagon";break;case"odd":y="rect_left_inv_arrow";break;case"lean_right":y="lean_right";break;case"lean_left":y="lean_left";break;case"trapezoid":y="trapezoid";break;case"inv_trapezoid":y="inv_trapezoid";break;case"odd_right":y="rect_left_inv_arrow";break;case"circle":y="circle";break;case"ellipse":y="ellipse";break;case"stadium":y="stadium";break;case"cylinder":y="cylinder";break;case"group":y="rect";break;default:y="rect"}e.setNode(i.id,{labelType:"svg",labelStyle:s.labelStyle,shape:y,label:o,rx:g,ry:g,class:a,style:s.style,id:i.id})}))},wt=function(t,e){var n,r,i=0;if(void 0!==t.defaultStyle){var o=S(t.defaultStyle);n=o.style,r=o.labelStyle}t.forEach((function(o){i++;var s={};"arrow_open"===o.type?s.arrowhead="none":s.arrowhead="normal";var u="",c="";if(void 0!==o.style){var f=S(o.style);u=f.style,c=f.labelStyle}else switch(o.stroke){case"normal":u="fill:none",void 0!==n&&(u=n),void 0!==r&&(c=r);break;case"dotted":u="fill:none;stroke-width:2px;stroke-dasharray:3;";break;case"thick":u=" stroke-width: 3.5px;fill:none"}s.style=u,s.labelStyle=c,void 0!==o.interpolate?s.curve=E(o.interpolate,a.curveLinear):void 0!==t.defaultInterpolate?s.curve=E(t.defaultInterpolate,a.curveLinear):s.curve=E(mt.curve,a.curveLinear),void 0===o.text?void 0!==o.style&&(s.arrowheadStyle="fill: #333"):(s.arrowheadStyle="fill: #333",s.labelpos="c",h().flowchart.htmlLabels?(s.labelType="html",s.label='<span class="edgeLabel">'+o.text+"</span>"):(s.labelType="text",s.label=o.text.replace(/<br\s*\/?>/gi,"\n"),void 0===o.style&&(s.style=s.style||"stroke: #333; stroke-width: 1.5px;fill:none"),s.labelStyle=s.labelStyle.replace("color:","fill:"))),e.setEdge(o.start,o.end,s,i)}))},xt=function(t){for(var e=Object.keys(t),n=0;n<e.length;n++)mt[e[n]]=t[e[n]]},kt=function(t){_.info("Extracting classes"),tt.clear();var e=nt.a.parser;return e.yy=tt,e.parse(t),tt.getClasses()},Et=function(t,e){_.info("Drawing flowchart"),tt.clear();var n=nt.a.parser;n.yy=tt;try{n.parse(t)}catch(t){_.debug("Parsing failed")}var r=tt.getDirection();void 0===r&&(r="TD");for(var i,o=h().flowchart,s=o.nodeSpacing||50,u=o.rankSpacing||50,c=new B.a.Graph({multigraph:!0,compound:!0}).setGraph({rankdir:r,nodesep:s,ranksep:u,marginx:8,marginy:8}).setDefaultEdgeLabel((function(){return{}})),f=tt.getSubGraphs(),l=f.length-1;l>=0;l--)i=f[l],tt.addVertex(i.id,i.title,"group",void 0,i.classes);var d=tt.getVertices(),p=tt.getEdges(),g=0;for(g=f.length-1;g>=0;g--){i=f[g],a.selectAll("cluster").append("text");for(var y=0;y<i.nodes.length;y++)c.setParent(i.nodes[y],i.id)}_t(d,c,e),wt(p,c);var b=new(0,it.a.render);vt.addToRender(b),b.arrows().none=function(t,e,n,r){var i=t.append("marker").attr("id",e).attr("viewBox","0 0 10 10").attr("refX",9).attr("refY",5).attr("markerUnits","strokeWidth").attr("markerWidth",8).attr("markerHeight",6).attr("orient","auto").append("path").attr("d","M 0 0 L 0 0 L 0 0 z");it.a.util.applyStyle(i,n[r+"Style"])},b.arrows().normal=function(t,e){t.append("marker").attr("id",e).attr("viewBox","0 0 10 10").attr("refX",9).attr("refY",5).attr("markerUnits","strokeWidth").attr("markerWidth",8).attr("markerHeight",6).attr("orient","auto").append("path").attr("d","M 0 0 L 10 5 L 0 10 z").attr("class","arrowheadPath").style("stroke-width",1).style("stroke-dasharray","1,0")};var v=a.select('[id="'.concat(e,'"]')),m=a.select("#"+e+" g");b(m,c),m.selectAll("g.node").attr("title",(function(){return tt.getTooltip(this.id)}));var w=v.node().getBBox(),x=w.width+16,k=w.height+16;for(_.debug("new ViewBox 0 0 ".concat(x," ").concat(k),"translate(".concat(8-c._label.marginx,", ").concat(8-c._label.marginy,")")),o.useMaxWidth?(v.attr("width","100%"),v.attr("style","max-width: ".concat(x,"px;"))):(v.attr("height",k),v.attr("width",x)),v.attr("viewBox","0 0 ".concat(x," ").concat(k)),v.select("g").attr("transform","translate(".concat(8-c._label.marginx,", ").concat(8-w.y,")")),tt.indexNodes("subGraph"+g),g=0;g<f.length;g++)if("undefined"!==(i=f[g]).title){var E=document.querySelectorAll("#"+e+' [id="'+i.id+'"] rect'),A=document.querySelectorAll("#"+e+' [id="'+i.id+'"]'),S=E[0].x.baseVal.value,M=E[0].y.baseVal.value,T=E[0].width.baseVal.value,D=a.select(A[0]).select(".label");D.attr("transform","translate(".concat(S+T/2,", ").concat(M+14,")")),D.attr("id",e+"Text");for(var C=0;C<i.classes.length;C++)A[0].classList.add(i.classes[C])}if(!o.htmlLabels)for(var N=document.querySelectorAll('[id="'+e+'"] .edgeLabel .label'),I=0;I<N.length;I++){var L=N[I],O=L.getBBox(),R=document.createElementNS("http://www.w3.org/2000/svg","rect");R.setAttribute("rx",0),R.setAttribute("ry",0),R.setAttribute("width",O.width),R.setAttribute("height",O.height),R.setAttribute("style","fill:#e8e8e8;"),L.insertBefore(R,L.firstChild)}Object.keys(d).forEach((function(t){var n=d[t];if(n.link){var r=a.select("#"+e+' [id="'+t+'"]');if(r){var i=document.createElementNS("http://www.w3.org/2000/svg","a");i.setAttributeNS("http://www.w3.org/2000/svg","class",n.classes.join(" ")),i.setAttributeNS("http://www.w3.org/2000/svg","href",n.link),i.setAttributeNS("http://www.w3.org/2000/svg","rel","noopener");var o=r.insert((function(){return i}),":first-child"),s=r.select(".label-container");s&&o.append((function(){return s.node()}));var u=r.select(".label");u&&o.append((function(){return u.node()}))}}}))},At=function(t,e){var n=t.append("rect");return n.attr("x",e.x),n.attr("y",e.y),n.attr("fill",e.fill),n.attr("stroke",e.stroke),n.attr("width",e.width),n.attr("height",e.height),n.attr("rx",e.rx),n.attr("ry",e.ry),void 0!==e.class&&n.attr("class",e.class),n},St=function(t,e){var n=e.text.replace(/<br\s*\/?>/gi," "),r=t.append("text");r.attr("x",e.x),r.attr("y",e.y),r.style("text-anchor",e.anchor),r.attr("fill",e.fill),void 0!==e.class&&r.attr("class",e.class);var i=r.append("tspan");return i.attr("x",e.x+2*e.textMargin),i.attr("fill",e.fill),i.text(n),r},Mt=function(t,e){var n,r,i,a,o,s=t.append("polygon");s.attr("points",(n=e.x,r=e.y,n+","+r+" "+(n+(i=50))+","+r+" "+(n+i)+","+(r+(a=20)-(o=7))+" "+(n+i-1.2*o)+","+(r+a)+" "+n+","+(r+a))),s.attr("class","labelBox"),e.y=e.y+e.labelMargin,e.x=e.x+.5*e.labelMargin,St(t,e)},Tt=-1,Dt=function(){return{x:0,y:0,fill:void 0,"text-anchor":"start",style:"#666",width:100,height:100,textMargin:0,rx:0,ry:0}},Ct=function(){return{x:0,y:0,fill:"#EDF2AE",stroke:"#666",width:100,anchor:"start",height:100,rx:0,ry:0}},Nt=function(){function t(t,e,n,i,a,o,s){r(e.append("text").attr("x",n+a/2).attr("y",i+o/2+5).style("text-anchor","middle").text(t),s)}function e(t,e,n,i,a,o,s,u){for(var c=u.actorFontSize,f=u.actorFontFamily,l=t.split(/<br\s*\/?>/gi),h=0;h<l.length;h++){var d=h*c-c*(l.length-1)/2,p=e.append("text").attr("x",n+a/2).attr("y",i).style("text-anchor","middle").style("font-size",c).style("font-family",f);p.append("tspan").attr("x",n+a/2).attr("dy",d).text(l[h]),p.attr("y",i+o/2).attr("dominant-baseline","central").attr("alignment-baseline","central"),r(p,s)}}function n(t,n,i,a,o,s,u,c){var f=n.append("switch"),l=f.append("foreignObject").attr("x",i).attr("y",a).attr("width",o).attr("height",s).append("div").style("display","table").style("height","100%").style("width","100%");l.append("div").style("display","table-cell").style("text-align","center").style("vertical-align","middle").text(t),e(t,f,i,a,o,s,u,c),r(l,u)}function r(t,e){for(var n in e)e.hasOwnProperty(n)&&t.attr(n,e[n])}return function(r){return"fo"===r.textPlacement?n:"old"===r.textPlacement?t:e}}(),It={drawRect:At,drawText:St,drawLabel:Mt,drawActor:function(t,e,n,r,i){var a=e+i.width/2,o=t.append("g");0===n&&(Tt++,o.append("line").attr("id","actor"+Tt).attr("x1",a).attr("y1",5).attr("x2",a).attr("y2",2e3).attr("class","actor-line").attr("stroke-width","0.5px").attr("stroke","#999"));var s=Ct();s.x=e,s.y=n,s.fill="#eaeaea",s.width=i.width,s.height=i.height,s.class="actor",s.rx=3,s.ry=3,At(o,s),Nt(i)(r,o,s.x,s.y,s.width,s.height,{class:"actor"},i)},anchorElement:function(t){return t.append("g")},drawActivation:function(t,e,n,r,i){var a=Ct(),o=e.anchored;a.x=e.startx,a.y=e.starty,a.class="activation"+i%3,a.width=e.stopx-e.startx,a.height=n-e.starty,At(o,a)},drawLoop:function(t,e,n,r){var i=t.append("g"),a=function(t,e,n,r){return i.append("line").attr("x1",t).attr("y1",e).attr("x2",n).attr("y2",r).attr("class","loopLine")};a(e.startx,e.starty,e.stopx,e.starty),a(e.stopx,e.starty,e.stopx,e.stopy),a(e.startx,e.stopy,e.stopx,e.stopy),a(e.startx,e.starty,e.startx,e.stopy),void 0!==e.sections&&e.sections.forEach((function(t){a(e.startx,t,e.stopx,t).style("stroke-dasharray","3, 3")}));var o=Dt();o.text=n,o.x=e.startx,o.y=e.starty,o.labelMargin=15,o.class="labelText",Mt(i,o),(o=Dt()).text="[ "+e.title+" ]",o.x=e.startx+(e.stopx-e.startx)/2,o.y=e.starty+1.5*r.boxMargin,o.anchor="middle",o.class="loopText",St(i,o),void 0!==e.sectionTitles&&e.sectionTitles.forEach((function(t,n){""!==t&&(o.text="[ "+t+" ]",o.y=e.sections[n]+1.5*r.boxMargin,St(i,o))}))},drawBackgroundRect:function(t,e){At(t,{x:e.startx,y:e.starty,width:e.stopx-e.startx,height:e.stopy-e.starty,fill:e.fill,class:"rect"}).lower()},insertArrowHead:function(t){t.append("defs").append("marker").attr("id","arrowhead").attr("refX",5).attr("refY",2).attr("markerWidth",6).attr("markerHeight",4).attr("orient","auto").append("path").attr("d","M 0,0 V 4 L6,2 Z")},insertSequenceNumber:function(t){t.append("defs").append("marker").attr("id","sequencenumber").attr("refX",15).attr("refY",15).attr("markerWidth",60).attr("markerHeight",40).attr("orient","auto").append("circle").attr("cx",15).attr("cy",15).attr("r",6)},insertArrowCrossHead:function(t){var e=t.append("defs").append("marker").attr("id","crosshead").attr("markerWidth",15).attr("markerHeight",8).attr("orient","auto").attr("refX",16).attr("refY",4);e.append("path").attr("fill","black").attr("stroke","#000000").style("stroke-dasharray","0, 0").attr("stroke-width","1px").attr("d","M 9,2 V 6 L16,4 Z"),e.append("path").attr("fill","none").attr("stroke","#000000").style("stroke-dasharray","0, 0").attr("stroke-width","1px").attr("d","M 0,1 L 6,7 M 6,1 L 0,7")},getTextObj:Dt,getNoteRect:Ct},Lt=n(1),Bt=n.n(Lt),Ot={},Rt=[],Pt=[],Ft="",qt=!1,jt=function(t,e,n){var r=Ot[t];r&&e===r.name&&null==n||(null==n&&(n=e),Ot[t]={name:e,description:n})},Ut=function(t,e,n,r){if(_.debug("Adding message from="+t+" to="+e+" message="+n+" type="+r),r===zt.ACTIVE_END){var i=function(t){var e=0,n=0;for(e=0;e<Rt.length;e++)Rt[e].type===zt.ACTIVE_START&&Rt[e].from.actor===t&&n++,Rt[e].type===zt.ACTIVE_END&&Rt[e].from.actor===t&&n--;return n}(t.actor);if(_.debug("Adding message from=",Rt,i),i<1){var a=new Error("Trying to inactivate an inactive participant ("+t.actor+")");throw a.hash={text:"->>-",token:"->>-",line:"1",loc:{first_line:1,last_line:1,first_column:1,last_column:1},expected:["'ACTIVE_PARTICIPANT'"]},a}}return Rt.push({from:t,to:e,message:n,type:r}),!0},zt={SOLID:0,DOTTED:1,NOTE:2,SOLID_CROSS:3,DOTTED_CROSS:4,SOLID_OPEN:5,DOTTED_OPEN:6,LOOP_START:10,LOOP_END:11,ALT_START:12,ALT_ELSE:13,ALT_END:14,OPT_START:15,OPT_END:16,ACTIVE_START:17,ACTIVE_END:18,PAR_START:19,PAR_AND:20,PAR_END:21,RECT_START:22,RECT_END:23},Yt=function(t,e,n){var r={actor:t,placement:e,message:n},i=[].concat(t,t);Pt.push(r),Rt.push({from:i[0],to:i[1],message:n,type:zt.NOTE,placement:e})},Vt=function(t){Ft=t},Ht={addActor:jt,addMessage:function(t,e,n,r){Rt.push({from:t,to:e,message:n,answer:r})},addSignal:Ut,enableSequenceNumbers:function(){qt=!0},showSequenceNumbers:function(){return qt},getMessages:function(){return Rt},getActors:function(){return Ot},getActor:function(t){return Ot[t]},getActorKeys:function(){return Object.keys(Ot)},getTitle:function(){return Ft},clear:function(){Ot={},Rt=[]},LINETYPE:zt,ARROWTYPE:{FILLED:0,OPEN:1},PLACEMENT:{LEFTOF:0,RIGHTOF:1,OVER:2},addNote:Yt,setTitle:Vt,apply:function t(e){if(e instanceof Array)e.forEach((function(e){t(e)}));else switch(e.type){case"addActor":jt(e.actor,e.actor,e.description);break;case"activeStart":case"activeEnd":Ut(e.actor,void 0,void 0,e.signalType);break;case"addNote":Yt(e.actor,e.placement,e.text);break;case"addMessage":Ut(e.from,e.to,e.msg,e.signalType);break;case"loopStart":Ut(void 0,void 0,e.loopText,e.signalType);break;case"loopEnd":Ut(void 0,void 0,void 0,e.signalType);break;case"rectStart":Ut(void 0,void 0,e.color,e.signalType);break;case"rectEnd":Ut(void 0,void 0,void 0,e.signalType);break;case"optStart":Ut(void 0,void 0,e.optText,e.signalType);break;case"optEnd":Ut(void 0,void 0,void 0,e.signalType);break;case"altStart":case"else":Ut(void 0,void 0,e.altText,e.signalType);break;case"altEnd":Ut(void 0,void 0,void 0,e.signalType);break;case"setTitle":Vt(e.text);break;case"parStart":case"and":Ut(void 0,void 0,e.parText,e.signalType);break;case"parEnd":Ut(void 0,void 0,void 0,e.signalType)}}};Lt.parser.yy=Ht;var Gt={diagramMarginX:50,diagramMarginY:30,actorMargin:50,width:150,height:65,actorFontSize:14,actorFontFamily:'"Open-Sans", "sans-serif"',boxMargin:10,boxTextMargin:5,noteMargin:10,messageMargin:35,mirrorActors:!1,bottomMarginAdj:1,activationWidth:10,textPlacement:"tspan",showSequenceNumbers:!1},$t={data:{startx:void 0,stopx:void 0,starty:void 0,stopy:void 0},verticalPos:0,sequenceItems:[],activations:[],init:function(){this.sequenceItems=[],this.activations=[],this.data={startx:void 0,stopx:void 0,starty:void 0,stopy:void 0},this.verticalPos=0},updateVal:function(t,e,n,r){void 0===t[e]?t[e]=n:t[e]=r(n,t[e])},updateBounds:function(t,e,n,r){var i=this,a=0;function o(o){return function(s){a++;var u=i.sequenceItems.length-a+1;i.updateVal(s,"starty",e-u*Gt.boxMargin,Math.min),i.updateVal(s,"stopy",r+u*Gt.boxMargin,Math.max),i.updateVal($t.data,"startx",t-u*Gt.boxMargin,Math.min),i.updateVal($t.data,"stopx",n+u*Gt.boxMargin,Math.max),"activation"!==o&&(i.updateVal(s,"startx",t-u*Gt.boxMargin,Math.min),i.updateVal(s,"stopx",n+u*Gt.boxMargin,Math.max),i.updateVal($t.data,"starty",e-u*Gt.boxMargin,Math.min),i.updateVal($t.data,"stopy",r+u*Gt.boxMargin,Math.max))}}this.sequenceItems.forEach(o()),this.activations.forEach(o("activation"))},insert:function(t,e,n,r){var i=Math.min(t,n),a=Math.max(t,n),o=Math.min(e,r),s=Math.max(e,r);this.updateVal($t.data,"startx",i,Math.min),this.updateVal($t.data,"starty",o,Math.min),this.updateVal($t.data,"stopx",a,Math.max),this.updateVal($t.data,"stopy",s,Math.max),this.updateBounds(i,o,a,s)},newActivation:function(t,e){var n=Lt.parser.yy.getActors()[t.from.actor],r=Xt(t.from.actor).length,i=n.x+Gt.width/2+(r-1)*Gt.activationWidth/2;this.activations.push({startx:i,starty:this.verticalPos+2,stopx:i+Gt.activationWidth,stopy:void 0,actor:t.from.actor,anchored:It.anchorElement(e)})},endActivation:function(t){var e=this.activations.map((function(t){return t.actor})).lastIndexOf(t.from.actor);return this.activations.splice(e,1)[0]},newLoop:function(t,e){this.sequenceItems.push({startx:void 0,starty:this.verticalPos,stopx:void 0,stopy:void 0,title:t,fill:e})},endLoop:function(){return this.sequenceItems.pop()},addSectionToLoop:function(t){var e=this.sequenceItems.pop();e.sections=e.sections||[],e.sectionTitles=e.sectionTitles||[],e.sections.push($t.getVerticalPos()),e.sectionTitles.push(t),this.sequenceItems.push(e)},bumpVerticalPos:function(t){this.verticalPos=this.verticalPos+t,this.data.stopy=this.verticalPos},getVerticalPos:function(){return this.verticalPos},getBounds:function(){return this.data}},Wt=function(t,e,n,r,i){var a=It.getNoteRect();a.x=e,a.y=n,a.width=i||Gt.width,a.class="note";var o=t.append("g"),s=It.drawRect(o,a),u=function(t,e,n,r,i){var a=0,o=t.split(/<br\s*\/?>/gi),s=!0,u=!1,c=void 0;try{for(var f,l=o[Symbol.iterator]();!(s=(f=l.next()).done);s=!0){var h=f.value,d=It.getTextObj();d.x=e,d.y=n+a,d.textMargin=Gt.noteMargin,d.dy="1em",d.text=h,d.class="noteText";var p=It.drawText(r,d,i);a+=(p._groups||p)[0][0].getBBox().height}}catch(t){u=!0,c=t}finally{try{s||null==l.return||l.return()}finally{if(u)throw c}}return a}(r.message,e-4,n+24,o,a.width-Gt.noteMargin);$t.insert(e,n,e+a.width,n+2*Gt.noteMargin+u),s.attr("height",u+2*Gt.noteMargin),$t.bumpVerticalPos(u+2*Gt.noteMargin)},Kt=function(t,e,n,r){for(var i=0;i<n.length;i++){var a=n[i];e[a].x=i*Gt.actorMargin+i*Gt.width,e[a].y=r,e[a].width=Gt.diagramMarginX,e[a].height=Gt.diagramMarginY,It.drawActor(t,e[a].x,r,e[a].description,Gt),$t.insert(e[a].x,r,e[a].x+Gt.width,Gt.height)}$t.bumpVerticalPos(Gt.height)},Xt=function(t){return $t.activations.filter((function(e){return e.actor===t}))},Zt=function(t){var e=Lt.parser.yy.getActors(),n=Xt(t);return[n.reduce((function(t,e){return Math.min(t,e.startx)}),e[t].x+Gt.width/2),n.reduce((function(t,e){return Math.max(t,e.stopx)}),e[t].x+Gt.width/2)]},Jt=function(t){Object.keys(t).forEach((function(e){Gt[e]=t[e]})),Gt.actorFontFamily=t.fontFamily},Qt=function(t,e){Lt.parser.yy.clear(),Lt.parser.parse(t+"\n"),$t.init();var n,r,i,o=a.select('[id="'.concat(e,'"]')),s=Lt.parser.yy.getActors(),u=Lt.parser.yy.getActorKeys(),c=Lt.parser.yy.getMessages(),f=Lt.parser.yy.getTitle();Kt(o,s,u,0),It.insertArrowHead(o),It.insertArrowCrossHead(o),It.insertSequenceNumber(o);var l=1;c.forEach((function(t){var e;switch(t.type){case Lt.parser.yy.LINETYPE.NOTE:$t.bumpVerticalPos(Gt.boxMargin),n=s[t.from].x,r=s[t.to].x,t.placement===Lt.parser.yy.PLACEMENT.RIGHTOF?Wt(o,n+(Gt.width+Gt.actorMargin)/2,$t.getVerticalPos(),t):t.placement===Lt.parser.yy.PLACEMENT.LEFTOF?Wt(o,n-(Gt.width+Gt.actorMargin)/2,$t.getVerticalPos(),t):t.to===t.from?Wt(o,n,$t.getVerticalPos(),t):(i=Math.abs(n-r)+Gt.actorMargin,Wt(o,(n+r+Gt.width-i)/2,$t.getVerticalPos(),t,i));break;case Lt.parser.yy.LINETYPE.ACTIVE_START:$t.newActivation(t,o);break;case Lt.parser.yy.LINETYPE.ACTIVE_END:!function(t,e){var n=$t.endActivation(t);n.starty+18>e&&(n.starty=e-6,e+=12),It.drawActivation(o,n,e,Gt,Xt(t.from.actor).length),$t.insert(n.startx,e-10,n.stopx,e)}(t,$t.getVerticalPos());break;case Lt.parser.yy.LINETYPE.LOOP_START:$t.bumpVerticalPos(Gt.boxMargin),$t.newLoop(t.message),$t.bumpVerticalPos(Gt.boxMargin+Gt.boxTextMargin);break;case Lt.parser.yy.LINETYPE.LOOP_END:e=$t.endLoop(),It.drawLoop(o,e,"loop",Gt),$t.bumpVerticalPos(Gt.boxMargin);break;case Lt.parser.yy.LINETYPE.RECT_START:$t.bumpVerticalPos(Gt.boxMargin),$t.newLoop(void 0,t.message),$t.bumpVerticalPos(Gt.boxMargin);break;case Lt.parser.yy.LINETYPE.RECT_END:var a=$t.endLoop();It.drawBackgroundRect(o,a),$t.bumpVerticalPos(Gt.boxMargin);break;case Lt.parser.yy.LINETYPE.OPT_START:$t.bumpVerticalPos(Gt.boxMargin),$t.newLoop(t.message),$t.bumpVerticalPos(Gt.boxMargin+Gt.boxTextMargin);break;case Lt.parser.yy.LINETYPE.OPT_END:e=$t.endLoop(),It.drawLoop(o,e,"opt",Gt),$t.bumpVerticalPos(Gt.boxMargin);break;case Lt.parser.yy.LINETYPE.ALT_START:$t.bumpVerticalPos(Gt.boxMargin),$t.newLoop(t.message),$t.bumpVerticalPos(Gt.boxMargin+Gt.boxTextMargin);break;case Lt.parser.yy.LINETYPE.ALT_ELSE:$t.bumpVerticalPos(Gt.boxMargin),e=$t.addSectionToLoop(t.message),$t.bumpVerticalPos(Gt.boxMargin);break;case Lt.parser.yy.LINETYPE.ALT_END:e=$t.endLoop(),It.drawLoop(o,e,"alt",Gt),$t.bumpVerticalPos(Gt.boxMargin);break;case Lt.parser.yy.LINETYPE.PAR_START:$t.bumpVerticalPos(Gt.boxMargin),$t.newLoop(t.message),$t.bumpVerticalPos(Gt.boxMargin+Gt.boxTextMargin);break;case Lt.parser.yy.LINETYPE.PAR_AND:$t.bumpVerticalPos(Gt.boxMargin),e=$t.addSectionToLoop(t.message),$t.bumpVerticalPos(Gt.boxMargin);break;case Lt.parser.yy.LINETYPE.PAR_END:e=$t.endLoop(),It.drawLoop(o,e,"par",Gt),$t.bumpVerticalPos(Gt.boxMargin);break;default:try{$t.bumpVerticalPos(Gt.messageMargin);var u=Zt(t.from),c=Zt(t.to),f=u[0]<=c[0]?1:0,h=u[0]<c[0]?0:1;n=u[f],r=c[h];var d=$t.getVerticalPos();!function(t,e,n,r,i,a){var o,s=t.append("g"),u=e+(n-e)/2,c=0,f=i.message.split(/<br\s*\/?>/gi),l=!0,h=!1,d=void 0;try{for(var p,g=f[Symbol.iterator]();!(l=(p=g.next()).done);l=!0){var y=p.value;o=s.append("text").attr("x",u).attr("y",r-7+17*c).style("text-anchor","middle").attr("class","messageText").text(y.trim()),c++}}catch(t){h=!0,d=t}finally{try{l||null==g.return||g.return()}finally{if(h)throw d}}var b,v=17*(c-1),m=(o._groups||o)[0][0].getBBox().width;if(e===n){b=Gt.rightAngles?s.append("path").attr("d","M ".concat(e,",").concat(r+v," H ").concat(e+Gt.width/2," V ").concat(r+25+v," H ").concat(e)):s.append("path").attr("d","M "+e+","+(r+v)+" C "+(e+60)+","+(r-10+v)+" "+(e+60)+","+(r+30+v)+" "+e+","+(r+20+v)),$t.bumpVerticalPos(30+v);var _=Math.max(m/2,100);$t.insert(e-_,$t.getVerticalPos()-10+v,n+_,$t.getVerticalPos()+v)}else(b=s.append("line")).attr("x1",e),b.attr("y1",r),b.attr("x2",n),b.attr("y2",r),$t.insert(e,$t.getVerticalPos()-10+v,n,$t.getVerticalPos()+v);i.type===Lt.parser.yy.LINETYPE.DOTTED||i.type===Lt.parser.yy.LINETYPE.DOTTED_CROSS||i.type===Lt.parser.yy.LINETYPE.DOTTED_OPEN?(b.style("stroke-dasharray","3, 3"),b.attr("class","messageLine1")):b.attr("class","messageLine0");var w="";Gt.arrowMarkerAbsolute&&(w=(w=(w=window.location.protocol+"//"+window.location.host+window.location.pathname+window.location.search).replace(/\(/g,"\\(")).replace(/\)/g,"\\)")),b.attr("stroke-width",2),b.attr("stroke","black"),b.style("fill","none"),i.type!==Lt.parser.yy.LINETYPE.SOLID&&i.type!==Lt.parser.yy.LINETYPE.DOTTED||b.attr("marker-end","url("+w+"#arrowhead)"),i.type!==Lt.parser.yy.LINETYPE.SOLID_CROSS&&i.type!==Lt.parser.yy.LINETYPE.DOTTED_CROSS||b.attr("marker-end","url("+w+"#crosshead)"),(Ht.showSequenceNumbers()||Gt.showSequenceNumbers)&&(b.attr("marker-start","url("+w+"#sequencenumber)"),s.append("text").attr("x",e).attr("y",r+4).attr("font-family","sans-serif").attr("font-size","12px").attr("text-anchor","middle").attr("textLength","16px").attr("class","sequenceNumber").text(a))}(o,n,r,d,t,l);var p=u.concat(c);$t.insert(Math.min.apply(null,p),d,Math.max.apply(null,p),d)}catch(t){_.error("error while drawing message",t)}}[Lt.parser.yy.LINETYPE.SOLID_OPEN,Lt.parser.yy.LINETYPE.DOTTED_OPEN,Lt.parser.yy.LINETYPE.SOLID,Lt.parser.yy.LINETYPE.DOTTED,Lt.parser.yy.LINETYPE.SOLID_CROSS,Lt.parser.yy.LINETYPE.DOTTED_CROSS].includes(t.type)&&l++})),Gt.mirrorActors&&($t.bumpVerticalPos(2*Gt.boxMargin),Kt(o,s,u,$t.getVerticalPos()));var h=$t.getBounds();_.debug("For line height fix Querying: #"+e+" .actor-line"),a.selectAll("#"+e+" .actor-line").attr("y2",h.stopy);var d=h.stopy-h.starty+2*Gt.diagramMarginY;Gt.mirrorActors&&(d=d-Gt.boxMargin+Gt.bottomMarginAdj);var p=h.stopx-h.startx+2*Gt.diagramMarginX;f&&o.append("text").text(f).attr("x",(h.stopx-h.startx)/2-2*Gt.diagramMarginX).attr("y",-25),Gt.useMaxWidth?(o.attr("height","100%"),o.attr("width","100%"),o.attr("style","max-width:"+p+"px;")):(o.attr("height",d),o.attr("width",p));var g=f?40:0;o.attr("viewBox",h.startx-Gt.diagramMarginX+" -"+(Gt.diagramMarginY+g)+" "+p+" "+(d+g))},te=n(26),ee=n.n(te);function ne(t){return function(t){if(Array.isArray(t)){for(var e=0,n=new Array(t.length);e<t.length;e++)n[e]=t[e];return n}}(t)||function(t){if(Symbol.iterator in Object(t)||"[object Arguments]"===Object.prototype.toString.call(t))return Array.from(t)}(t)||function(){throw new TypeError("Invalid attempt to spread non-iterable instance")}()}var re,ie,ae=h(),oe="",se="",ue=[],ce="",fe=[],le=[],he="",de=["active","done","crit","milestone"],pe=[],ge=!1,ye=function(t,e,n){return t.isoWeekday()>=6&&n.indexOf("weekends")>=0||(n.indexOf(t.format("dddd").toLowerCase())>=0||n.indexOf(t.format(e.trim()))>=0)},be=function(t,e,n){if(n.length&&!t.manualEndTime){var r=p()(t.startTime,e,!0);r.add(1,"d");var i=p()(t.endTime,e,!0),a=ve(r,i,e,n);t.endTime=i.toDate(),t.renderEndTime=a}},ve=function(t,e,n,r){for(var i=!1,a=null;t<=e;)i||(a=e.toDate()),(i=ye(t,n,r))&&e.add(1,"d"),t.add(1,"d");return a},me=function(t,e,n){n=n.trim();var r=/^after\s+([\d\w- ]+)/.exec(n.trim());if(null!==r){var i=null;if(r[1].split(" ").forEach((function(t){var e=Se(t);void 0!==e&&(i?e.endTime>i.endTime&&(i=e):i=e)})),i)return i.endTime;var a=new Date;return a.setHours(0,0,0,0),a}var o=p()(n,e.trim(),!0);return o.isValid()?o.toDate():(_.debug("Invalid date:"+n),_.debug("With date format:"+e.trim()),new Date)},_e=function(t,e){if(null!==t)switch(t[2]){case"s":e.add(t[1],"seconds");break;case"m":e.add(t[1],"minutes");break;case"h":e.add(t[1],"hours");break;case"d":e.add(t[1],"days");break;case"w":e.add(t[1],"weeks")}return e.toDate()},we=function(t,e,n,r){r=r||!1,n=n.trim();var i=p()(n,e.trim(),!0);return i.isValid()?(r&&i.add(1,"d"),i.toDate()):_e(/^([\d]+)([wdhms])/.exec(n.trim()),p()(t))},xe=0,ke=function(t){return void 0===t?"task"+(xe+=1):t},Ee=[],Ae={},Se=function(t){var e=Ae[t];return Ee[e]},Me=function(){for(var t=function(t){var e=Ee[t],n="";switch(Ee[t].raw.startTime.type){case"prevTaskEnd":var r=Se(e.prevTaskId);e.startTime=r.endTime;break;case"getStartDate":(n=me(0,oe,Ee[t].raw.startTime.startData))&&(Ee[t].startTime=n)}return Ee[t].startTime&&(Ee[t].endTime=we(Ee[t].startTime,oe,Ee[t].raw.endTime.data,ge),Ee[t].endTime&&(Ee[t].processed=!0,Ee[t].manualEndTime=p()(Ee[t].raw.endTime.data,"YYYY-MM-DD",!0).isValid(),be(Ee[t],oe,ue))),Ee[t].processed},e=!0,n=0;n<Ee.length;n++)t(n),e=e&&Ee[n].processed;return e},Te=function(t,e){t.split(",").forEach((function(t){var n=Se(t);void 0!==n&&n.classes.push(e)}))},De=function(t,e){pe.push((function(){var n=document.querySelector('[id="'.concat(t,'"]'));null!==n&&n.addEventListener("click",(function(){e()}))})),pe.push((function(){var n=document.querySelector('[id="'.concat(t,'-text"]'));null!==n&&n.addEventListener("click",(function(){e()}))}))},Ce={clear:function(){fe=[],le=[],he="",pe=[],ce="",xe=0,re=void 0,ie=void 0,Ee=[],oe="",se="",ue=[],ge=!1},setDateFormat:function(t){oe=t},getDateFormat:function(){return oe},enableInclusiveEndDates:function(){ge=!0},endDatesAreInclusive:function(){return ge},setAxisFormat:function(t){se=t},getAxisFormat:function(){return se},setTitle:function(t){ce=t},getTitle:function(){return ce},addSection:function(t){he=t,fe.push(t)},getSections:function(){return fe},getTasks:function(){for(var t=Me(),e=0;!t&&e<10;)t=Me(),e++;return le=Ee},addTask:function(t,e){var n={section:he,type:he,processed:!1,manualEndTime:!1,renderEndTime:null,raw:{data:e},task:t,classes:[]},r=function(t,e){var n=(":"===e.substr(0,1)?e.substr(1,e.length):e).split(","),r={};Ne(n,r,de);for(var i=0;i<n.length;i++)n[i]=n[i].trim();switch(n.length){case 1:r.id=ke(),r.startTime={type:"prevTaskEnd",id:t},r.endTime={data:n[0]};break;case 2:r.id=ke(),r.startTime={type:"getStartDate",startData:n[0]},r.endTime={data:n[1]};break;case 3:r.id=ke(n[0]),r.startTime={type:"getStartDate",startData:n[1]},r.endTime={data:n[2]}}return r}(ie,e);n.raw.startTime=r.startTime,n.raw.endTime=r.endTime,n.id=r.id,n.prevTaskId=ie,n.active=r.active,n.done=r.done,n.crit=r.crit,n.milestone=r.milestone;var i=Ee.push(n);ie=n.id,Ae[n.id]=i-1},findTaskById:Se,addTaskOrg:function(t,e){var n={section:he,type:he,description:t,task:t,classes:[]},r=function(t,e){var n=(":"===e.substr(0,1)?e.substr(1,e.length):e).split(","),r={};Ne(n,r,de);for(var i=0;i<n.length;i++)n[i]=n[i].trim();var a="";switch(n.length){case 1:r.id=ke(),r.startTime=t.endTime,a=n[0];break;case 2:r.id=ke(),r.startTime=me(0,oe,n[0]),a=n[1];break;case 3:r.id=ke(n[0]),r.startTime=me(0,oe,n[1]),a=n[2]}return a&&(r.endTime=we(r.startTime,oe,a,ge),r.manualEndTime=p()(a,"YYYY-MM-DD",!0).isValid(),be(r,oe,ue)),r}(re,e);n.startTime=r.startTime,n.endTime=r.endTime,n.id=r.id,n.active=r.active,n.done=r.done,n.crit=r.crit,n.milestone=r.milestone,re=n,le.push(n)},setExcludes:function(t){ue=t.toLowerCase().split(/[\s,]+/)},getExcludes:function(){return ue},setClickEvent:function(t,e,n){t.split(",").forEach((function(t){!function(t,e,n){if("loose"===ae.securityLevel&&void 0!==e){var r=[];if("string"==typeof n){r=n.split(/,(?=(?:(?:[^"]*"){2})*[^"]*$)/);for(var i=0;i<r.length;i++){var a=r[i].trim();'"'===a.charAt(0)&&'"'===a.charAt(a.length-1)&&(a=a.substr(1,a.length-2)),r[i]=a}}0===r.length&&r.push(t),void 0!==Se(t)&&De(t,(function(){var t;(t=window)[e].apply(t,ne(r))}))}}(t,e,n)})),Te(t,"clickable")},setLink:function(t,e){var n=e;"loose"!==ae.securityLevel&&(n=Object(k.sanitizeUrl)(e)),t.split(",").forEach((function(t){void 0!==Se(t)&&De(t,(function(){window.open(n,"_self")}))})),Te(t,"clickable")},bindFunctions:function(t){pe.forEach((function(e){e(t)}))},durationToDate:_e};function Ne(t,e,n){for(var r=!0;r;)r=!1,n.forEach((function(n){var i=new RegExp("^\\s*"+n+"\\s*$");t[0].match(i)&&(e[n]=!0,t.shift(1),r=!0)}))}te.parser.yy=Ce;var Ie,Le={titleTopMargin:25,barHeight:20,barGap:4,topPadding:50,rightPadding:75,leftPadding:75,gridLineStartPadding:35,fontSize:11,fontFamily:'"Open-Sans", "sans-serif"'},Be=function(t){Object.keys(t).forEach((function(e){Le[e]=t[e]}))},Oe=function(t,e){te.parser.yy.clear(),te.parser.parse(t);var n=document.getElementById(e);void 0===(Ie=n.parentElement.offsetWidth)&&(Ie=1200),void 0!==Le.useWidth&&(Ie=Le.useWidth);var r=te.parser.yy.getTasks(),i=r.length*(Le.barHeight+Le.barGap)+2*Le.topPadding;n.setAttribute("height","100%"),n.setAttribute("viewBox","0 0 "+Ie+" "+i);for(var o=a.select('[id="'.concat(e,'"]')),s=a.scaleTime().domain([a.min(r,(function(t){return t.startTime})),a.max(r,(function(t){return t.endTime}))]).rangeRound([0,Ie-Le.leftPadding-Le.rightPadding]),u=[],c=0;c<r.length;c++)u.push(r[c].type);var f=u;function l(t){for(var e=t.length,n={};e;)n[t[--e]]=(n[t[e]]||0)+1;return n}u=function(t){for(var e={},n=[],r=0,i=t.length;r<i;++r)e.hasOwnProperty(t[r])||(e[t[r]]=!0,n.push(t[r]));return n}(u),function(t,e,n){var r=Le.barHeight,i=r+Le.barGap,c=Le.topPadding,h=Le.leftPadding;a.scaleLinear().domain([0,u.length]).range(["#00B9FA","#F95002"]).interpolate(a.interpolateHcl);(function(t,e,n,r){var i=a.axisBottom(s).tickSize(-r+e+Le.gridLineStartPadding).tickFormat(a.timeFormat(te.parser.yy.getAxisFormat()||Le.axisFormat||"%Y-%m-%d"));o.append("g").attr("class","grid").attr("transform","translate("+t+", "+(r-50)+")").call(i).selectAll("text").style("text-anchor","middle").attr("fill","#000").attr("stroke","none").attr("font-size",10).attr("dy","1em")})(h,c,0,n),function(t,e,n,r,i,a,c){o.append("g").selectAll("rect").data(t).enter().append("rect").attr("x",0).attr("y",(function(t,r){return r*e+n-2})).attr("width",(function(){return c-Le.rightPadding/2})).attr("height",e).attr("class",(function(t){for(var e=0;e<u.length;e++)if(t.type===u[e])return"section section"+e%Le.numberSectionStyles;return"section section0"}));var f=o.append("g").selectAll("rect").data(t).enter();f.append("rect").attr("id",(function(t){return t.id})).attr("rx",3).attr("ry",3).attr("x",(function(t){return t.milestone?s(t.startTime)+r+.5*(s(t.endTime)-s(t.startTime))-.5*i:s(t.startTime)+r})).attr("y",(function(t,r){return r*e+n})).attr("width",(function(t){return t.milestone?i:s(t.renderEndTime||t.endTime)-s(t.startTime)})).attr("height",i).attr("transform-origin",(function(t,a){return(s(t.startTime)+r+.5*(s(t.endTime)-s(t.startTime))).toString()+"px "+(a*e+n+.5*i).toString()+"px"})).attr("class",(function(t){var e="";t.classes.length>0&&(e=t.classes.join(" "));for(var n=0,r=0;r<u.length;r++)t.type===u[r]&&(n=r%Le.numberSectionStyles);var i="";return t.active?t.crit?i+=" activeCrit":i=" active":t.done?i=t.crit?" doneCrit":" done":t.crit&&(i+=" crit"),0===i.length&&(i=" task"),t.milestone&&(i=" milestone "+i),i+=n,"task"+(i+=" "+e)})),f.append("text").attr("id",(function(t){return t.id+"-text"})).text((function(t){return t.task})).attr("font-size",Le.fontSize).attr("x",(function(t){var e=s(t.startTime),n=s(t.renderEndTime||t.endTime);t.milestone&&(e+=.5*(s(t.endTime)-s(t.startTime))-.5*i),t.milestone&&(n=e+i);var a=this.getBBox().width;return a>n-e?n+a+1.5*Le.leftPadding>c?e+r-5:n+r+5:(n-e)/2+e+r})).attr("y",(function(t,r){return r*e+Le.barHeight/2+(Le.fontSize/2-2)+n})).attr("text-height",i).attr("class",(function(t){var e=s(t.startTime),n=s(t.endTime);t.milestone&&(n=e+i);var r=this.getBBox().width,a="";t.classes.length>0&&(a=t.classes.join(" "));for(var o=0,f=0;f<u.length;f++)t.type===u[f]&&(o=f%Le.numberSectionStyles);var l="";return t.active&&(l=t.crit?"activeCritText"+o:"activeText"+o),t.done?l=t.crit?l+" doneCritText"+o:l+" doneText"+o:t.crit&&(l=l+" critText"+o),t.milestone&&(l+=" milestoneText"),r>n-e?n+r+1.5*Le.leftPadding>c?a+" taskTextOutsideLeft taskTextOutside"+o+" "+l:a+" taskTextOutsideRight taskTextOutside"+o+" "+l+" width-"+r:a+" taskText taskText"+o+" "+l+" width-"+r}))}(t,i,c,h,r,0,e),function(t,e){for(var n=[],r=0,i=0;i<u.length;i++)n[i]=[u[i],(a=u[i],s=f,l(s)[a]||0)];var a,s;o.append("g").selectAll("text").data(n).enter().append((function(t){var e=t[0].split(/<br\s*\/?>/gi),n=-(e.length-1)/2,r=document.createElementNS("http://www.w3.org/2000/svg","text");r.setAttribute("dy",n+"em");for(var i=0;i<e.length;i++){var a=document.createElementNS("http://www.w3.org/2000/svg","tspan");a.setAttribute("alignment-baseline","central"),a.setAttribute("x","10"),i>0&&a.setAttribute("dy","1em"),a.textContent=e[i],r.appendChild(a)}return r})).attr("x",10).attr("y",(function(i,a){if(!(a>0))return i[1]*t/2+e;for(var o=0;o<a;o++)return r+=n[a-1][1],i[1]*t/2+r*t+e})).attr("class",(function(t){for(var e=0;e<u.length;e++)if(t[0]===u[e])return"sectionTitle sectionTitle"+e%Le.numberSectionStyles;return"sectionTitle"}))}(i,c),function(t,e,n,r){var i=o.append("g").attr("class","today"),a=new Date;i.append("line").attr("x1",s(a)+t).attr("x2",s(a)+t).attr("y1",Le.titleTopMargin).attr("y2",r-Le.titleTopMargin).attr("class","today")}(h,0,0,n)}(r,Ie,i),void 0!==Le.useWidth&&n.setAttribute("width",Ie),o.append("text").text(te.parser.yy.getTitle()).attr("x",Ie/2).attr("y",Le.titleTopMargin).attr("class","titleText")},Re=n(59),Pe=n.n(Re),Fe=h(),qe=[],je={},Ue=0,ze=[],Ye=function(t){var e="",n=t;if(t.indexOf("~")>0){var r=t.split("~");n=r[0],e=r[1]}return{className:n,type:e}},Ve=function(t){var e=Ye(t);void 0===je[e.className]&&(je[e.className]={id:e.className,type:e.type,cssClasses:[],methods:[],members:[],annotations:[],domId:"classid-"+e.className+"-"+Ue},Ue++)},He=function(t){for(var e=Object.keys(je),n=0;n<e.length;n++)if(je[e[n]].id===t)return je[e[n]].domId},Ge=function(t,e){var n=Ye(t).className,r=je[n];if("string"==typeof e){var i=e.trim();i.startsWith("<<")&&i.endsWith(">>")?r.annotations.push(i.substring(2,i.length-2)):i.indexOf(")")>0?r.methods.push(i):i&&r.members.push(i)}},$e=function(t,e){t.split(",").forEach((function(t){var n=t;t[0].match(/\d/)&&(n="classid-"+n),void 0!==je[n]&&je[n].cssClasses.push(e)}))},We=function(t,e,n){var r=t,i=He(r);"loose"===Fe.securityLevel&&void 0!==e&&void 0!==je[r]&&(n&&(je[r].tooltip=N(n,Fe)),ze.push((function(){var t=document.querySelector('[id="'.concat(i,'"]'));null!==t&&t.addEventListener("click",(function(){window[e](i)}),!1)})))},Ke=function(t){var e=a.select(".mermaidTooltip");null===(e._groups||e)[0][0]&&(e=a.select("body").append("div").attr("class","mermaidTooltip").style("opacity",0)),a.select(t).select("svg").selectAll("g.node").on("mouseover",(function(){var t=a.select(this);if(null!==t.attr("title")){var n=this.getBoundingClientRect();e.transition().duration(200).style("opacity",".9"),e.html(t.attr("title")).style("left",n.left+(n.right-n.left)/2+"px").style("top",n.top-14+document.body.scrollTop+"px"),t.classed("hover",!0)}})).on("mouseout",(function(){e.transition().duration(500).style("opacity",0),a.select(this).classed("hover",!1)}))};ze.push(Ke);var Xe={addClass:Ve,bindFunctions:function(t){ze.forEach((function(e){e(t)}))},clear:function(){qe=[],je={},(ze=[]).push(Ke)},getClass:function(t){return je[t]},getClasses:function(){return je},addAnnotation:function(t,e){var n=Ye(t).className;je[n].annotations.push(e)},getRelations:function(){return qe},addRelation:function(t){_.debug("Adding relation: "+JSON.stringify(t)),Ve(t.id1),Ve(t.id2),t.id1=Ye(t.id1).className,t.id2=Ye(t.id2).className,qe.push(t)},addMember:Ge,addMembers:function(t,e){Array.isArray(e)&&(e.reverse(),e.forEach((function(e){return Ge(t,e)})))},cleanupLabel:function(t){return":"===t.substring(0,1)?t.substr(1).trim():t.trim()},lineType:{LINE:0,DOTTED_LINE:1},relationType:{AGGREGATION:0,EXTENSION:1,COMPOSITION:2,DEPENDENCY:3},setClickEvent:function(t,e,n){t.split(",").forEach((function(t){We(t,e,n)})),$e(t,"clickable")},setCssClass:$e,setLink:function(t,e,n){t.split(",").forEach((function(t){var r=t;t[0].match(/\d/)&&(r="classid-"+r),void 0!==je[r]&&(je[r].link=I(e,Fe),n&&(je[r].tooltip=N(n,Fe)))})),$e(t,"clickable")},lookUpDomId:He},Ze=n(46),Je=n.n(Ze),Qe=0,tn=function(t){var e=t.match(/^(\+|-|~|#)?(\w+)(~\w+~|\[\])?\s+(\w+)$/),n=t.match(/^(\+|-|~|#)?(\w+)\s?\(\s*(\w+(~\w+~|\[\])?\s*(\w+)?)?\s*\)\s?([*|$])?\s?(\w+(~\w+~|\[\])?)?\s*$/);return e?en(e):n?nn(n):rn(t)},en=function(t){return{displayText:(t[1]?t[1].trim():"")+(t[2]?t[2].trim():"")+(t[3]?on(t[3]):"")+" "+(t[4]?t[4].trim():""),cssStyle:""}},nn=function(t){var e=t[1]?t[1].trim():"",n=t[2]?t[2].trim():"",r=t[3]?on(t[3]):"",i=t[6]?t[6].trim():"";return{displayText:e+n+"("+r+")"+(t[7]?" : "+on(t[7]).trim():""),cssStyle:sn(i)}},rn=function(t){var e="",n="",r="",i=t.indexOf("("),a=t.indexOf(")");if(i>1&&a>i&&a<=t.length){var o=t.match(/(\+|-|~|#)?(\w+)/),s=o[1]?o[1].trim():"",u=o[2],c=t.substring(i+1,a),f=t.substring(a,a+1);n=sn(f),a<(e=s+u+"("+on(c.trim())+")").length&&""!==(r=t.substring(a+2).trim())&&(r=" : "+on(r))}else e=on(t);return{displayText:e+r,cssStyle:n}},an=function(t,e,n,r){var i=tn(e),a=t.append("tspan").attr("x",r.padding).text(i.displayText);""!==i.cssStyle&&a.attr("style",i.cssStyle),n||a.attr("dy",r.textHeight)},on=function t(e){var n=e;return-1!=e.indexOf("~")?t(n=(n=n.replace("~","<")).replace("~",">")):n},sn=function(t){switch(t){case"*":return"font-style:italic;";case"$":return"text-decoration:underline;";default:return""}},un=function(t,e,n){_.info("Rendering class "+e);var r="classGroup ";e.cssClasses.length>0&&(r+=e.cssClasses.join(" "));var i,a=e.id,o={id:a,label:e.id,width:0,height:0},s=t.append("g").attr("id",He(a)).attr("class",r);i=e.link?s.append("svg:a").attr("xlink:href",e.link).attr("target","_blank").append("text").attr("y",n.textHeight+n.padding).attr("x",0):s.append("text").attr("y",n.textHeight+n.padding).attr("x",0);var u=!0;e.annotations.forEach((function(t){var e=i.append("tspan").text("«"+t+"»");u||e.attr("dy",n.textHeight),u=!1}));var c=e.id;void 0!==e.type&&""!==e.type&&(c+="<"+e.type+">");var f=i.append("tspan").text(c).attr("class","title");u||f.attr("dy",n.textHeight);var l=i.node().getBBox().height,h=s.append("line").attr("x1",0).attr("y1",n.padding+l+n.dividerMargin/2).attr("y2",n.padding+l+n.dividerMargin/2),d=s.append("text").attr("x",n.padding).attr("y",l+n.dividerMargin+n.textHeight).attr("fill","white").attr("class","classText");u=!0,e.members.forEach((function(t){an(d,t,u,n),u=!1}));var p=d.node().getBBox(),g=s.append("line").attr("x1",0).attr("y1",n.padding+l+n.dividerMargin+p.height).attr("y2",n.padding+l+n.dividerMargin+p.height),y=s.append("text").attr("x",n.padding).attr("y",l+2*n.dividerMargin+p.height+n.textHeight).attr("fill","white").attr("class","classText");u=!0,e.methods.forEach((function(t){an(y,t,u,n),u=!1}));var b=s.node().getBBox(),v=s.insert("rect",":first-child").attr("x",0).attr("y",0).attr("width",b.width+2*n.padding).attr("height",b.height+n.padding+.5*n.dividerMargin).node().getBBox().width;return i.node().childNodes.forEach((function(t){t.setAttribute("x",(v-t.getBBox().width)/2)})),e.tooltip&&i.insert("title").text(e.tooltip),h.attr("x2",v),g.attr("x2",v),o.width=v,o.height=b.height+n.padding+.5*n.dividerMargin,o},cn=function(t,e,n,r){var i=function(t){switch(t){case Xe.relationType.AGGREGATION:return"aggregation";case Xe.relationType.EXTENSION:return"extension";case Xe.relationType.COMPOSITION:return"composition";case Xe.relationType.DEPENDENCY:return"dependency"}};e.points=e.points.filter((function(t){return!Number.isNaN(t.y)}));var o,s,u=e.points,c=a.line().x((function(t){return t.x})).y((function(t){return t.y})).curve(a.curveBasis),f=t.append("path").attr("d",c(u)).attr("id","edge"+Qe).attr("class","relation"),l="";r.arrowMarkerAbsolute&&(l=(l=(l=window.location.protocol+"//"+window.location.host+window.location.pathname+window.location.search).replace(/\(/g,"\\(")).replace(/\)/g,"\\)")),1==n.relation.lineType&&f.attr("class","relation dashed-line"),"none"!==n.relation.type1&&f.attr("marker-start","url("+l+"#"+i(n.relation.type1)+"Start)"),"none"!==n.relation.type2&&f.attr("marker-end","url("+l+"#"+i(n.relation.type2)+"End)");var h,d,p,g,y=e.points.length,b=D(e.points);if(o=b.x,s=b.y,y%2!=0&&y>1){var v=C("none"!==n.relation.type1,e.points,e.points[0]),m=C("none"!==n.relation.type2,e.points,e.points[y-1]);_.debug("cardinality_1_point "+JSON.stringify(v)),_.debug("cardinality_2_point "+JSON.stringify(m)),h=v.x,d=v.y,p=m.x,g=m.y}if(void 0!==n.title){var w=t.append("g").attr("class","classLabel"),x=w.append("text").attr("class","label").attr("x",o).attr("y",s).attr("fill","red").attr("text-anchor","middle").text(n.title);window.label=x;var k=x.node().getBBox();w.insert("rect",":first-child").attr("class","box").attr("x",k.x-r.padding/2).attr("y",k.y-r.padding/2).attr("width",k.width+r.padding).attr("height",k.height+r.padding)}(_.info("Rendering relation "+JSON.stringify(n)),void 0!==n.relationTitle1&&"none"!==n.relationTitle1)&&t.append("g").attr("class","cardinality").append("text").attr("class","type1").attr("x",h).attr("y",d).attr("fill","black").attr("font-size","6").text(n.relationTitle1);void 0!==n.relationTitle2&&"none"!==n.relationTitle2&&t.append("g").attr("class","cardinality").append("text").attr("class","type2").attr("x",p).attr("y",g).attr("fill","black").attr("font-size","6").text(n.relationTitle2);Qe++};Ze.parser.yy=Xe;var fn={},ln={dividerMargin:10,padding:5,textHeight:10},hn=function(t){for(var e=Object.keys(fn),n=0;n<e.length;n++)if(fn[e[n]].label===t)return e[n]},dn=function(t){Object.keys(t).forEach((function(e){ln[e]=t[e]}))},pn=function(t,e){fn={},Ze.parser.yy.clear(),Ze.parser.parse(t),_.info("Rendering diagram "+t);var n,r=a.select("[id='".concat(e,"']"));(n=r).append("defs").append("marker").attr("id","extensionStart").attr("class","extension").attr("refX",0).attr("refY",7).attr("markerWidth",190).attr("markerHeight",240).attr("orient","auto").append("path").attr("d","M 1,7 L18,13 V 1 Z"),n.append("defs").append("marker").attr("id","extensionEnd").attr("refX",19).attr("refY",7).attr("markerWidth",20).attr("markerHeight",28).attr("orient","auto").append("path").attr("d","M 1,1 V 13 L18,7 Z"),n.append("defs").append("marker").attr("id","compositionStart").attr("class","extension").attr("refX",0).attr("refY",7).attr("markerWidth",190).attr("markerHeight",240).attr("orient","auto").append("path").attr("d","M 18,7 L9,13 L1,7 L9,1 Z"),n.append("defs").append("marker").attr("id","compositionEnd").attr("refX",19).attr("refY",7).attr("markerWidth",20).attr("markerHeight",28).attr("orient","auto").append("path").attr("d","M 18,7 L9,13 L1,7 L9,1 Z"),n.append("defs").append("marker").attr("id","aggregationStart").attr("class","extension").attr("refX",0).attr("refY",7).attr("markerWidth",190).attr("markerHeight",240).attr("orient","auto").append("path").attr("d","M 18,7 L9,13 L1,7 L9,1 Z"),n.append("defs").append("marker").attr("id","aggregationEnd").attr("refX",19).attr("refY",7).attr("markerWidth",20).attr("markerHeight",28).attr("orient","auto").append("path").attr("d","M 18,7 L9,13 L1,7 L9,1 Z"),n.append("defs").append("marker").attr("id","dependencyStart").attr("class","extension").attr("refX",0).attr("refY",7).attr("markerWidth",190).attr("markerHeight",240).attr("orient","auto").append("path").attr("d","M 5,7 L9,13 L1,7 L9,1 Z"),n.append("defs").append("marker").attr("id","dependencyEnd").attr("refX",19).attr("refY",7).attr("markerWidth",20).attr("markerHeight",28).attr("orient","auto").append("path").attr("d","M 18,7 L9,13 L14,7 L9,1 Z");var i=new B.a.Graph({multigraph:!0});i.setGraph({isMultiGraph:!0}),i.setDefaultEdgeLabel((function(){return{}}));for(var o=Xe.getClasses(),s=Object.keys(o),u=0;u<s.length;u++){var c=o[s[u]],f=un(r,c,ln);fn[f.id]=f,i.setNode(f.id,f),_.info("Org height: "+f.height)}Xe.getRelations().forEach((function(t){_.info("tjoho"+hn(t.id1)+hn(t.id2)+JSON.stringify(t)),i.setEdge(hn(t.id1),hn(t.id2),{relation:t},t.title||"DEFAULT")})),Pe.a.layout(i),i.nodes().forEach((function(t){void 0!==t&&void 0!==i.node(t)&&(_.debug("Node "+t+": "+JSON.stringify(i.node(t))),a.select("#"+He(t)).attr("transform","translate("+(i.node(t).x-i.node(t).width/2)+","+(i.node(t).y-i.node(t).height/2)+" )"))})),i.edges().forEach((function(t){void 0!==t&&void 0!==i.edge(t)&&(_.debug("Edge "+t.v+" -> "+t.w+": "+JSON.stringify(i.edge(t))),cn(r,i.edge(t),i.edge(t).relation,ln))})),r.attr("height",i.graph().height+40),r.attr("width",1.5*i.graph().width+20),r.attr("viewBox","-10 -10 "+(i.graph().width+20)+" "+(i.graph().height+20))};function gn(t){return(gn="function"==typeof Symbol&&"symbol"==typeof Symbol.iterator?function(t){return typeof t}:function(t){return t&&"function"==typeof Symbol&&t.constructor===Symbol&&t!==Symbol.prototype?"symbol":typeof t})(t)}var yn,bn=[],vn={root:{relations:[],states:{},documents:{}}},mn=vn.root,_n=0,wn=function(t,e,n,r,i){void 0===mn.states[t]?mn.states[t]={id:t,descriptions:[],type:e,doc:n,note:i}:(mn.states[t].doc||(mn.states[t].doc=n),mn.states[t].type||(mn.states[t].type=e)),r&&("string"==typeof r&&En(t,r.trim()),"object"===gn(r)&&r.forEach((function(e){return En(t,e.trim())}))),i&&(mn.states[t].note=i)},xn=function(){mn=(vn={root:{relations:[],states:{},documents:{}}}).root},kn=function(t,e,n){var r=t,i=e,a="default",o="default";"[*]"===t&&(r="start"+ ++_n,a="start"),"[*]"===e&&(i="end"+_n,o="end"),wn(r,a),wn(i,o),mn.relations.push({id1:r,id2:i,title:n})},En=function(t,e){var n=mn.states[t],r=e;":"===r[0]&&(r=r.substr(1).trim()),n.descriptions.push(r)},An=0,Sn={addState:wn,clear:xn,getState:function(t){return mn.states[t]},getStates:function(){return mn.states},getRelations:function(){return mn.relations},addRelation:kn,getDividerId:function(){return"divider-id-"+ ++An},cleanupLabel:function(t){return":"===t.substring(0,1)?t.substr(2).trim():t.trim()},lineType:{LINE:0,DOTTED_LINE:1},relationType:{AGGREGATION:0,EXTENSION:1,COMPOSITION:2,DEPENDENCY:3},logDocuments:function(){_.info("Documents = ",vn)},getRootDoc:function(){return bn},setRootDoc:function(t){_.info("Setting root doc",t),bn=t},extract:function(t){xn(),t.forEach((function(t){"state"===t.stmt&&wn(t.id,t.type,t.doc,t.description,t.note),"relation"===t.stmt&&kn(t.state1.id,t.state2.id,t.description)}))}},Mn=n(47),Tn=n.n(Mn),Dn={},Cn=function(t,e){Dn[t]=e},Nn=function(t,e){var n=t.append("text").attr("x",2*h().state.padding).attr("y",h().state.textHeight+1.3*h().state.padding).attr("font-size",h().state.fontSize).attr("class","state-title").text(e.descriptions[0]).node().getBBox(),r=n.height,i=t.append("text").attr("x",h().state.padding).attr("y",r+.4*h().state.padding+h().state.dividerMargin+h().state.textHeight).attr("class","state-description"),a=!0,o=!0;e.descriptions.forEach((function(t){a||(!function(t,e,n){var r=t.append("tspan").attr("x",2*h().state.padding).text(e);n||r.attr("dy",h().state.textHeight)}(i,t,o),o=!1),a=!1}));var s=t.append("line").attr("x1",h().state.padding).attr("y1",h().state.padding+r+h().state.dividerMargin/2).attr("y2",h().state.padding+r+h().state.dividerMargin/2).attr("class","descr-divider"),u=i.node().getBBox(),c=Math.max(u.width,n.width);return s.attr("x2",c+3*h().state.padding),t.insert("rect",":first-child").attr("x",h().state.padding).attr("y",h().state.padding).attr("width",c+2*h().state.padding).attr("height",u.height+r+2*h().state.padding).attr("rx",h().state.radius),t},In=function(t,e,n){var r,i=h().state.padding,a=2*h().state.padding,o=t.node().getBBox(),s=o.width,u=o.x,c=t.append("text").attr("x",0).attr("y",h().state.titleShift).attr("font-size",h().state.fontSize).attr("class","state-title").text(e.id),f=c.node().getBBox().width+a,l=Math.max(f,s);l===s&&(l+=a);var d=t.node().getBBox();e.doc,r=u-i,f>s&&(r=(s-l)/2+i),Math.abs(u-d.x)<i&&f>s&&(r=u-(f-s)/2);var p=1-h().state.textHeight;return t.insert("rect",":first-child").attr("x",r).attr("y",p).attr("class",n?"alt-composit":"composit").attr("width",l).attr("height",d.height+h().state.textHeight+h().state.titleShift+1).attr("rx","0"),c.attr("x",r+i),f<=s&&c.attr("x",u+(l-a)/2-f/2+i),t.insert("rect",":first-child").attr("x",r).attr("y",h().state.titleShift-h().state.textHeight-h().state.padding).attr("width",l).attr("height",3*h().state.textHeight).attr("rx",h().state.radius),t.insert("rect",":first-child").attr("x",r).attr("y",h().state.titleShift-h().state.textHeight-h().state.padding).attr("width",l).attr("height",d.height+3+2*h().state.textHeight).attr("rx",h().state.radius),t},Ln=function(t,e){e.attr("class","state-note");var n=e.append("rect").attr("x",0).attr("y",h().state.padding),r=function(t,e,n,r){var i=0,a=r.append("text");a.style("text-anchor","start"),a.attr("class","noteText");var o=t.replace(/\r\n/g,"<br/>"),s=(o=o.replace(/\n/g,"<br/>")).split(/<br\s*\/?>/gi),u=1.25*h().state.noteMargin,c=!0,f=!1,l=void 0;try{for(var d,p=s[Symbol.iterator]();!(c=(d=p.next()).done);c=!0){var g=d.value.trim();if(g.length>0){var y=a.append("tspan");if(y.text(g),0===u)u+=y.node().getBBox().height;i+=u,y.attr("x",e+h().state.noteMargin),y.attr("y",n+i+1.25*h().state.noteMargin)}}}catch(t){f=!0,l=t}finally{try{c||null==p.return||p.return()}finally{if(f)throw l}}return{textWidth:a.node().getBBox().width,textHeight:i}}(t,0,0,e.append("g")),i=r.textWidth,a=r.textHeight;return n.attr("height",a+2*h().state.noteMargin),n.attr("width",i+2*h().state.noteMargin),n},Bn=function(t,e){var n=e.id,r={id:n,label:e.id,width:0,height:0},i=t.append("g").attr("id",n).attr("class","stateGroup");"start"===e.type&&function(t){t.append("circle").style("stroke","black").style("fill","black").attr("r",h().state.sizeUnit).attr("cx",h().state.padding+h().state.sizeUnit).attr("cy",h().state.padding+h().state.sizeUnit)}(i),"end"===e.type&&function(t){t.append("circle").style("stroke","black").style("fill","white").attr("r",h().state.sizeUnit+h().state.miniPadding).attr("cx",h().state.padding+h().state.sizeUnit+h().state.miniPadding).attr("cy",h().state.padding+h().state.sizeUnit+h().state.miniPadding),t.append("circle").style("stroke","black").style("fill","black").attr("r",h().state.sizeUnit).attr("cx",h().state.padding+h().state.sizeUnit+2).attr("cy",h().state.padding+h().state.sizeUnit+2)}(i),"fork"!==e.type&&"join"!==e.type||function(t,e){var n=h().state.forkWidth,r=h().state.forkHeight;if(e.parentId){var i=n;n=r,r=i}t.append("rect").style("stroke","black").style("fill","black").attr("width",n).attr("height",r).attr("x",h().state.padding).attr("y",h().state.padding)}(i,e),"note"===e.type&&Ln(e.note.text,i),"divider"===e.type&&function(t){t.append("line").style("stroke","grey").style("stroke-dasharray","3").attr("x1",h().state.textHeight).attr("class","divider").attr("x2",2*h().state.textHeight).attr("y1",0).attr("y2",0)}(i),"default"===e.type&&0===e.descriptions.length&&function(t,e){var n=t.append("text").attr("x",2*h().state.padding).attr("y",h().state.textHeight+2*h().state.padding).attr("font-size",h().state.fontSize).attr("class","state-title").text(e.id),r=n.node().getBBox();t.insert("rect",":first-child").attr("x",h().state.padding).attr("y",h().state.padding).attr("width",r.width+2*h().state.padding).attr("height",r.height+2*h().state.padding).attr("rx",h().state.radius)}(i,e),"default"===e.type&&e.descriptions.length>0&&Nn(i,e);var a=i.node().getBBox();return r.width=a.width+2*h().state.padding,r.height=a.height+2*h().state.padding,Cn(n,r),r},On=0;Mn.parser.yy=Sn;var Rn={},Pn=function(t){if(!t)return 1;var e=t.replace(/<br\s*\/?>/gi,"#br#");return(e=e.replace(/\\n/g,"#br#")).split("#br#")},Fn=function t(e,n,r,i){var o,s=new B.a.Graph({compound:!0,multigraph:!0}),u=!0;for(o=0;o<e.length;o++)if("relation"===e[o].stmt){u=!1;break}r?s.setGraph({rankdir:"LR",multigraph:!0,compound:!0,ranker:"tight-tree",ranksep:u?1:yn.edgeLengthFactor,nodeSep:u?1:50,isMultiGraph:!0}):s.setGraph({rankdir:"TB",multigraph:!0,compound:!0,ranksep:u?1:yn.edgeLengthFactor,nodeSep:u?1:50,ranker:"tight-tree",isMultiGraph:!0}),s.setDefaultEdgeLabel((function(){return{}})),Sn.extract(e);for(var c=Sn.getStates(),f=Sn.getRelations(),l=Object.keys(c),d=0;d<l.length;d++){var p=c[l[d]];r&&(p.parentId=r);var g=void 0;if(p.doc){var y=n.append("g").attr("id",p.id).attr("class","stateGroup");g=t(p.doc,y,p.id,!i);var b=(y=In(y,p,i)).node().getBBox();g.width=b.width,g.height=b.height+yn.padding/2,Rn[p.id]={y:yn.compositTitleSize}}else g=Bn(n,p);if(p.note){var v={descriptions:[],id:p.id+"-note",note:p.note,type:"note"},m=Bn(n,v);"left of"===p.note.position?(s.setNode(g.id+"-note",m),s.setNode(g.id,g)):(s.setNode(g.id,g),s.setNode(g.id+"-note",m)),s.setParent(g.id,g.id+"-group"),s.setParent(g.id+"-note",g.id+"-group")}else s.setNode(g.id,g)}_.debug("Count=",s.nodeCount(),s);var w=0;f.forEach((function(t){var e;w++,_.debug("Setting edge",t),s.setEdge(t.id1,t.id2,{relation:t,width:(e=t.title,e?e.length*yn.fontSizeFactor:1),height:yn.labelHeight*Pn(t.title).length,labelpos:"c"},"id"+w)})),Pe.a.layout(s),_.debug("Graph after layout",s.nodes());var x=n.node();s.nodes().forEach((function(t){void 0!==t&&void 0!==s.node(t)?(_.warn("Node "+t+": "+JSON.stringify(s.node(t))),a.select("#"+x.id+" #"+t).attr("transform","translate("+(s.node(t).x-s.node(t).width/2)+","+(s.node(t).y+(Rn[t]?Rn[t].y:0)-s.node(t).height/2)+" )"),a.select("#"+x.id+" #"+t).attr("data-x-shift",s.node(t).x-s.node(t).width/2),document.querySelectorAll("#"+x.id+" #"+t+" .divider").forEach((function(t){var e=t.parentElement,n=0,r=0;e&&(e.parentElement&&(n=e.parentElement.getBBox().width),r=parseInt(e.getAttribute("data-x-shift"),10),Number.isNaN(r)&&(r=0)),t.setAttribute("x1",0-r+8),t.setAttribute("x2",n-r-8)}))):_.debug("No Node "+t+": "+JSON.stringify(s.node(t)))}));var k=x.getBBox();s.edges().forEach((function(t){void 0!==t&&void 0!==s.edge(t)&&(_.debug("Edge "+t.v+" -> "+t.w+": "+JSON.stringify(s.edge(t))),function(t,e,n){e.points=e.points.filter((function(t){return!Number.isNaN(t.y)}));var r,i=e.points,o=a.line().x((function(t){return t.x})).y((function(t){return t.y})).curve(a.curveBasis),s=t.append("path").attr("d",o(i)).attr("id","edge"+On).attr("class","transition"),u="";if(h().state.arrowMarkerAbsolute&&(u=(u=(u=window.location.protocol+"//"+window.location.host+window.location.pathname+window.location.search).replace(/\(/g,"\\(")).replace(/\)/g,"\\)")),s.attr("marker-end","url("+u+"#"+function(t){switch(t){case Sn.relationType.AGGREGATION:return"aggregation";case Sn.relationType.EXTENSION:return"extension";case Sn.relationType.COMPOSITION:return"composition";case Sn.relationType.DEPENDENCY:return"dependency"}}(Sn.relationType.DEPENDENCY)+"End)"),void 0!==n.title){for(var c=t.append("g").attr("class","stateLabel"),f=D(e.points),l=f.x,d=f.y,p=(r=n.title,r.replace(/<br\s*\/?>/gi,"#br#").replace(/\\n/g,"#br#").split("#br#")),g=0,y=[],b=0;b<=p.length;b++){var v=c.append("text").attr("text-anchor","middle").text(p[b]).attr("x",l).attr("y",d+g);if(0===g){var m=v.node().getBBox();g=m.height}y.push(v)}if(p.length>1){var _=p.length*g*.25;y.forEach((function(t,e){return t.attr("y",d+e*g-_)}))}var w=c.node().getBBox();c.insert("rect",":first-child").attr("class","box").attr("x",w.x-h().state.padding/2).attr("y",w.y-h().state.padding/2).attr("width",w.width+h().state.padding).attr("height",w.height+h().state.padding)}On++}(n,s.edge(t),s.edge(t).relation))})),k=x.getBBox();var E={id:r||"root",label:r||"root",width:0,height:0};return E.width=k.width+2*yn.padding,E.height=k.height+2*yn.padding,_.debug("Doc rendered",E,s),E},qn=function(){},jn=function(t,e){yn=h().state,Mn.parser.yy.clear(),Mn.parser.parse(t),_.debug("Rendering diagram "+t);var n=a.select("[id='".concat(e,"']"));n.append("defs").append("marker").attr("id","dependencyEnd").attr("refX",19).attr("refY",7).attr("markerWidth",20).attr("markerHeight",28).attr("orient","auto").append("path").attr("d","M 19,7 L9,13 L14,7 L9,1 Z"),new B.a.Graph({multigraph:!0,compound:!0,rankdir:"RL"}).setDefaultEdgeLabel((function(){return{}}));var r=Sn.getRootDoc();Fn(r,n,void 0,!1);var i=yn.padding,o=n.node().getBBox(),s=o.width+2*i,u=o.height+2*i;n.attr("width",1.75*s),n.attr("viewBox","".concat(o.x-yn.padding," ").concat(o.y-yn.padding," ")+s+" "+u)},Un=n(48),zn=n.n(Un),Yn=n(230),Vn=n.n(Yn),Hn={},Gn=null,$n={master:Gn},Wn="master",Kn="LR",Xn=0;function Zn(){return Vn()({length:7,characters:"0123456789abcdef"})}function Jn(t,e){for(_.debug("Entering isfastforwardable:",t.id,e.id);t.seq<=e.seq&&t!==e&&null!=e.parent;){if(Array.isArray(e.parent))return _.debug("In merge commit:",e.parent),Jn(t,Hn[e.parent[0]])||Jn(t,Hn[e.parent[1]]);e=Hn[e.parent]}return _.debug(t.id,e.id),t.id===e.id}var Qn={};function tr(t,e,n){var r=t.indexOf(e);-1===r?t.push(n):t.splice(r,1,n)}var er,nr=function(){var t=Object.keys(Hn).map((function(t){return Hn[t]}));return t.forEach((function(t){_.debug(t.id)})),zn.a.orderBy(t,["seq"],["desc"])},rr={setDirection:function(t){Kn=t},setOptions:function(t){_.debug("options str",t),t=(t=t&&t.trim())||"{}";try{Qn=JSON.parse(t)}catch(t){_.error("error while parsing gitGraph options",t.message)}},getOptions:function(){return Qn},commit:function(t){var e={id:Zn(),message:t,seq:Xn++,parent:null==Gn?null:Gn.id};Gn=e,Hn[e.id]=e,$n[Wn]=e.id,_.debug("in pushCommit "+e.id)},branch:function(t){$n[t]=null!=Gn?Gn.id:null,_.debug("in createBranch")},merge:function(t){var e=Hn[$n[Wn]],n=Hn[$n[t]];if(function(t,e){return t.seq>e.seq&&Jn(e,t)}(e,n))_.debug("Already merged");else{if(Jn(e,n))$n[Wn]=$n[t],Gn=Hn[$n[Wn]];else{var r={id:Zn(),message:"merged branch "+t+" into "+Wn,seq:Xn++,parent:[null==Gn?null:Gn.id,$n[t]]};Gn=r,Hn[r.id]=r,$n[Wn]=r.id}_.debug($n),_.debug("in mergeBranch")}},checkout:function(t){_.debug("in checkout");var e=$n[Wn=t];Gn=Hn[e]},reset:function(t){_.debug("in reset",t);var e=t.split(":")[0],n=parseInt(t.split(":")[1]),r="HEAD"===e?Gn:Hn[$n[e]];for(_.debug(r,n);n>0;)if(n--,!(r=Hn[r.parent])){var i="Critical error - unique parent commit not found during reset";throw _.error(i),i}Gn=r,$n[Wn]=r.id},prettyPrint:function(){_.debug(Hn),function t(e){var n=zn.a.maxBy(e,"seq"),r="";e.forEach((function(t){r+=t===n?"\t*":"\t|"}));var i=[r,n.id,n.seq];for(var a in $n)$n[a]===n.id&&i.push(a);if(_.debug(i.join(" ")),Array.isArray(n.parent)){var o=Hn[n.parent[0]];tr(e,n,o),e.push(Hn[n.parent[1]])}else{if(null==n.parent)return;var s=Hn[n.parent];tr(e,n,s)}t(e=zn.a.uniqBy(e,"id"))}([nr()[0]])},clear:function(){Hn={},$n={master:Gn=null},Wn="master",Xn=0},getBranchesAsObjArray:function(){var t=[];for(var e in $n)t.push({name:e,commit:Hn[$n[e]]});return t},getBranches:function(){return $n},getCommits:function(){return Hn},getCommitsArray:nr,getCurrentBranch:function(){return Wn},getDirection:function(){return Kn},getHead:function(){return Gn}},ir=n(85),ar=n.n(ir),or={},sr={nodeSpacing:150,nodeFillColor:"yellow",nodeStrokeWidth:2,nodeStrokeColor:"grey",lineStrokeWidth:4,branchOffset:50,lineColor:"grey",leftMargin:50,branchColors:["#442f74","#983351","#609732","#AA9A39"],nodeRadius:10,nodeLabel:{width:75,height:100,x:-25,y:0}},ur={};function cr(t,e,n,r){var i=E(r,a.curveBasis),o=sr.branchColors[n%sr.branchColors.length],s=a.line().x((function(t){return Math.round(t.x)})).y((function(t){return Math.round(t.y)})).curve(i);t.append("svg:path").attr("d",s(e)).style("stroke",o).style("stroke-width",sr.lineStrokeWidth).style("fill","none")}function fr(t,e){e=e||t.node().getBBox();var n=t.node().getCTM();return{left:n.e+e.x*n.a,top:n.f+e.y*n.d,width:e.width,height:e.height}}function lr(t,e,n,r,i){_.debug("svgDrawLineForCommits: ",e,n);var a=fr(t.select("#node-"+e+" circle")),o=fr(t.select("#node-"+n+" circle"));switch(r){case"LR":if(a.left-o.left>sr.nodeSpacing){var s={x:a.left-sr.nodeSpacing,y:o.top+o.height/2};cr(t,[s,{x:o.left+o.width,y:o.top+o.height/2}],i,"linear"),cr(t,[{x:a.left,y:a.top+a.height/2},{x:a.left-sr.nodeSpacing/2,y:a.top+a.height/2},{x:a.left-sr.nodeSpacing/2,y:s.y},s],i)}else cr(t,[{x:a.left,y:a.top+a.height/2},{x:a.left-sr.nodeSpacing/2,y:a.top+a.height/2},{x:a.left-sr.nodeSpacing/2,y:o.top+o.height/2},{x:o.left+o.width,y:o.top+o.height/2}],i);break;case"BT":if(o.top-a.top>sr.nodeSpacing){var u={x:o.left+o.width/2,y:a.top+a.height+sr.nodeSpacing};cr(t,[u,{x:o.left+o.width/2,y:o.top}],i,"linear"),cr(t,[{x:a.left+a.width/2,y:a.top+a.height},{x:a.left+a.width/2,y:a.top+a.height+sr.nodeSpacing/2},{x:o.left+o.width/2,y:u.y-sr.nodeSpacing/2},u],i)}else cr(t,[{x:a.left+a.width/2,y:a.top+a.height},{x:a.left+a.width/2,y:a.top+sr.nodeSpacing/2},{x:o.left+o.width/2,y:o.top-sr.nodeSpacing/2},{x:o.left+o.width/2,y:o.top}],i)}}function hr(t,e){return t.select(e).node().cloneNode(!0)}function dr(t,e,n,r){var i,a=Object.keys(or).length;if("string"==typeof e)do{if(i=or[e],_.debug("in renderCommitHistory",i.id,i.seq),t.select("#node-"+e).size()>0)return;t.append((function(){return hr(t,"#def-commit")})).attr("class","commit").attr("id",(function(){return"node-"+i.id})).attr("transform",(function(){switch(r){case"LR":return"translate("+(i.seq*sr.nodeSpacing+sr.leftMargin)+", "+er*sr.branchOffset+")";case"BT":return"translate("+(er*sr.branchOffset+sr.leftMargin)+", "+(a-i.seq)*sr.nodeSpacing+")"}})).attr("fill",sr.nodeFillColor).attr("stroke",sr.nodeStrokeColor).attr("stroke-width",sr.nodeStrokeWidth);var o=void 0;for(var s in n)if(n[s].commit===i){o=n[s];break}o&&(_.debug("found branch ",o.name),t.select("#node-"+i.id+" p").append("xhtml:span").attr("class","branch-label").text(o.name+", ")),t.select("#node-"+i.id+" p").append("xhtml:span").attr("class","commit-id").text(i.id),""!==i.message&&"BT"===r&&t.select("#node-"+i.id+" p").append("xhtml:span").attr("class","commit-msg").text(", "+i.message),e=i.parent}while(e&&or[e]);Array.isArray(e)&&(_.debug("found merge commmit",e),dr(t,e[0],n,r),er++,dr(t,e[1],n,r),er--)}function pr(t,e,n,r){for(r=r||0;e.seq>0&&!e.lineDrawn;)"string"==typeof e.parent?(lr(t,e.id,e.parent,n,r),e.lineDrawn=!0,e=or[e.parent]):Array.isArray(e.parent)&&(lr(t,e.id,e.parent[0],n,r),lr(t,e.id,e.parent[1],n,r+1),pr(t,or[e.parent[1]],n,r+1),e.lineDrawn=!0,e=or[e.parent[0]])}var gr,yr=function(t){ur=t},br=function(t,e,n){try{var r=ar.a.parser;r.yy=rr,r.yy.clear(),_.debug("in gitgraph renderer",t+"\n","id:",e,n),r.parse(t+"\n"),sr=zn.a.assign(sr,ur,rr.getOptions()),_.debug("effective options",sr);var i=rr.getDirection();or=rr.getCommits();var o=rr.getBranchesAsObjArray();"BT"===i&&(sr.nodeLabel.x=o.length*sr.branchOffset,sr.nodeLabel.width="100%",sr.nodeLabel.y=-2*sr.nodeRadius);var s=a.select('[id="'.concat(e,'"]'));for(var u in function(t){t.append("defs").append("g").attr("id","def-commit").append("circle").attr("r",sr.nodeRadius).attr("cx",0).attr("cy",0),t.select("#def-commit").append("foreignObject").attr("width",sr.nodeLabel.width).attr("height",sr.nodeLabel.height).attr("x",sr.nodeLabel.x).attr("y",sr.nodeLabel.y).attr("class","node-label").attr("requiredFeatures","http://www.w3.org/TR/SVG11/feature#Extensibility").append("p").html("")}(s),er=1,o){var c=o[u];dr(s,c.commit.id,o,i),pr(s,c.commit,i),er++}s.attr("height",(function(){return"BT"===i?Object.keys(or).length*sr.nodeSpacing:(o.length+1)*sr.branchOffset}))}catch(t){_.error("Error while rendering gitgraph"),_.error(t.message)}},vr="",mr=!1,_r={setMessage:function(t){_.debug("Setting message to: "+t),vr=t},getMessage:function(){return vr},setInfo:function(t){mr=t},getInfo:function(){return mr}},wr=n(86),xr=n.n(wr),kr={},Er=function(t){Object.keys(t).forEach((function(e){kr[e]=t[e]}))},Ar=function(t,e,n){try{var r=xr.a.parser;r.yy=_r,_.debug("Renering info diagram\n"+t),r.parse(t),_.debug("Parsed info diagram");var i=a.select("#"+e);i.append("g").append("text").attr("x",100).attr("y",40).attr("class","version").attr("font-size","32px").style("text-anchor","middle").text("v "+n),i.attr("height",100),i.attr("width",400)}catch(t){_.error("Error while rendering info diagram"),_.error(t.message)}},Sr={},Mr="",Tr={addSection:function(t,e){void 0===Sr[t]&&(Sr[t]=e,_.debug("Added new section :",t))},getSections:function(){return Sr},cleanupValue:function(t){return":"===t.substring(0,1)?(t=t.substring(1).trim(),Number(t.trim())):Number(t.trim())},clear:function(){Sr={},Mr=""},setTitle:function(t){Mr=t},getTitle:function(){return Mr}},Dr=n(87),Cr=n.n(Dr),Nr={},Ir=function(t){Object.keys(t).forEach((function(e){Nr[e]=t[e]}))},Lr=function(t,e){try{var n=Cr.a.parser;n.yy=Tr,_.debug("Rendering info diagram\n"+t),n.yy.clear(),n.parse(t),_.debug("Parsed info diagram");var r=document.getElementById(e);void 0===(gr=r.parentElement.offsetWidth)&&(gr=1200),void 0!==Nr.useWidth&&(gr=Nr.useWidth);r.setAttribute("height","100%"),r.setAttribute("viewBox","0 0 "+gr+" 450");var i=gr,o=Math.min(i,450)/2-40,s=a.select("#"+e).append("svg").attr("width",i).attr("height",450).append("g").attr("transform","translate("+i/2+",225)"),u=Tr.getSections(),c=0;Object.keys(u).forEach((function(t){c+=u[t]})),_.info(u);var f=a.scaleOrdinal().domain(u).range(a.schemeSet2),l=a.pie().value((function(t){return t.value}))(a.entries(u)),h=a.arc().innerRadius(0).outerRadius(o);s.selectAll("mySlices").data(l).enter().append("path").attr("d",h).attr("fill",(function(t){return f(t.data.key)})).attr("stroke","black").style("stroke-width","2px").style("opacity",.7),s.selectAll("mySlices").data(l).enter().append("text").text((function(t){return(t.data.value/c*100).toFixed(0)+"%"})).attr("transform",(function(t){return"translate("+h.centroid(t)+")"})).style("text-anchor","middle").attr("class","slice").style("font-size",17),s.append("text").text(n.yy.getTitle()).attr("x",0).attr("y",-200).attr("class","pieTitleText");var d=s.selectAll(".legend").data(f.domain()).enter().append("g").attr("class","legend").attr("transform",(function(t,e){return"translate(216,"+(22*e-22*f.domain().length/2)+")"}));d.append("rect").attr("width",18).attr("height",18).style("fill",f).style("stroke",f),d.append("text").attr("x",22).attr("y",14).text((function(t){return t}))}catch(t){_.error("Error while rendering info diagram"),_.error(t.message)}};function Br(t){return(Br="function"==typeof Symbol&&"symbol"==typeof Symbol.iterator?function(t){return typeof t}:function(t){return t&&"function"==typeof Symbol&&t.constructor===Symbol&&t!==Symbol.prototype?"symbol":typeof t})(t)}for(var Or={},Rr=0,Pr=["default","forest","dark","neutral"];Rr<Pr.length;Rr++){var Fr=Pr[Rr];Or[Fr]=n(500)("./".concat(Fr,"/index.scss"))}var qr={theme:"default",themeCSS:void 0,maxTextSize:5e4,fontFamily:'"trebuchet ms", verdana, arial;',logLevel:5,securityLevel:"strict",startOnLoad:!0,arrowMarkerAbsolute:!1,flowchart:{htmlLabels:!0,nodeSpacing:50,rankSpacing:50,curve:"linear"},sequence:{diagramMarginX:50,diagramMarginY:10,actorMargin:50,width:150,height:65,boxMargin:10,boxTextMargin:5,noteMargin:10,messageMargin:35,mirrorActors:!0,bottomMarginAdj:1,useMaxWidth:!0,rightAngles:!1,showSequenceNumbers:!1},gantt:{titleTopMargin:25,barHeight:20,barGap:4,topPadding:50,leftPadding:75,gridLineStartPadding:35,fontSize:11,fontFamily:'"Open-Sans", "sans-serif"',numberSectionStyles:4,axisFormat:"%Y-%m-%d"},class:{},git:{},state:{dividerMargin:10,sizeUnit:5,padding:8,textHeight:10,titleShift:-15,noteMargin:10,forkWidth:70,forkHeight:7,miniPadding:2,fontSizeFactor:5.02,fontSize:24,labelHeight:16,edgeLengthFactor:"20",compositTitleSize:35,radius:5}};w(qr.logLevel),l(qr);var jr={render:function(t,e,n,r){var i=e;if(e.length>qr.maxTextSize&&(i="graph TB;a[Maximum text size in diagram exceeded];style a fill:#faa"),void 0!==r)r.innerHTML="",a.select(r).append("div").attr("id","d"+t).attr("style","font-family: "+qr.fontFamily).append("svg").attr("id",t).attr("width","100%").attr("xmlns","http://www.w3.org/2000/svg").append("g");else{var o=document.getElementById(t);o&&o.remove();var c=document.querySelector("#d"+t);c&&(c.innerHTML=""),a.select("body").append("div").attr("id","d"+t).append("svg").attr("id",t).attr("width","100%").attr("xmlns","http://www.w3.org/2000/svg").append("g")}window.txt=i,i=function(t){var e=t;return e=(e=(e=e.replace(/style.*:\S*#.*;/g,(function(t){return t.substring(0,t.length-1)}))).replace(/classDef.*:\S*#.*;/g,(function(t){return t.substring(0,t.length-1)}))).replace(/#\w+;/g,(function(t){var e=t.substring(1,t.length-1);return/^\+?\d+$/.test(e)?"fl°°"+e+"¶ß":"fl°"+e+"¶ß"}))}(i);var f=a.select("#d"+t).node(),l=M(i),h=f.firstChild,d=h.firstChild,p=Or[qr.theme];if(void 0===p&&(p=""),void 0!==qr.themeCSS&&(p+="\n".concat(qr.themeCSS)),void 0!==qr.fontFamily&&(p+="\n:root { --mermaid-font-family: ".concat(qr.fontFamily,"}")),void 0!==qr.altFontFamily&&(p+="\n:root { --mermaid-alt-font-family: ".concat(qr.altFontFamily,"}")),"flowchart"===l){var g=kt(i);for(var y in g)p+="\n.".concat(y," > * { ").concat(g[y].styles.join(" !important; ")," !important; }"),g[y].textStyles&&(p+="\n.".concat(y," tspan { ").concat(g[y].textStyles.join(" !important; ")," !important; }"))}var b=document.createElement("style");b.innerHTML=s()(p,"#".concat(t)),h.insertBefore(b,d);var v=document.createElement("style"),m=window.getComputedStyle(h);switch(v.innerHTML="#".concat(t," {\n color: ").concat(m.color,";\n font: ").concat(m.font,";\n }"),h.insertBefore(v,d),l){case"git":qr.flowchart.arrowMarkerAbsolute=qr.arrowMarkerAbsolute,yr(qr.git),br(i,t,!1);break;case"flowchart":qr.flowchart.arrowMarkerAbsolute=qr.arrowMarkerAbsolute,xt(qr.flowchart),Et(i,t,!1);break;case"sequence":qr.sequence.arrowMarkerAbsolute=qr.arrowMarkerAbsolute,qr.sequenceDiagram?(Jt(Object.assign(qr.sequence,qr.sequenceDiagram)),console.error("`mermaid config.sequenceDiagram` has been renamed to `config.sequence`. Please update your mermaid config.")):Jt(qr.sequence),Qt(i,t);break;case"gantt":qr.gantt.arrowMarkerAbsolute=qr.arrowMarkerAbsolute,Be(qr.gantt),Oe(i,t);break;case"class":qr.class.arrowMarkerAbsolute=qr.arrowMarkerAbsolute,dn(qr.class),pn(i,t);break;case"state":qn(qr.state),jn(i,t);break;case"info":qr.class.arrowMarkerAbsolute=qr.arrowMarkerAbsolute,Er(qr.class),Ar(i,t,u.version);break;case"pie":qr.class.arrowMarkerAbsolute=qr.arrowMarkerAbsolute,Ir(qr.class),Lr(i,t,u.version)}a.select('[id="'.concat(t,'"]')).selectAll("foreignobject > *").attr("xmlns","http://www.w3.org/1999/xhtml");var w=a.select("#d"+t).node().innerHTML;if(qr.arrowMarkerAbsolute&&"false"!==qr.arrowMarkerAbsolute||(w=w.replace(/marker-end="url\(.*?#/g,'marker-end="url(#',"g")),w=function(t){var e=t;return e=(e=(e=e.replace(/fl°°/g,(function(){return"&#"}))).replace(/fl°/g,(function(){return"&"}))).replace(/¶ß/g,(function(){return";"}))}(w),void 0!==n)switch(l){case"flowchart":n(w,tt.bindFunctions);break;case"gantt":n(w,Ce.bindFunctions);break;case"class":n(w,Xe.bindFunctions);break;default:n(w)}else _.debug("CB = undefined!");var x=a.select("#d"+t).node();return null!==x&&"function"==typeof x.remove&&a.select("#d"+t).node().remove(),w},parse:function(t){var e,n=M(t);switch(_.debug("Type "+n),n){case"git":(e=ar.a).parser.yy=rr;break;case"flowchart":tt.clear(),(e=nt.a).parser.yy=tt;break;case"sequence":(e=Bt.a).parser.yy=Ht;break;case"gantt":(e=ee.a).parser.yy=Ce;break;case"class":(e=Je.a).parser.yy=Xe;break;case"state":(e=Tn.a).parser.yy=Sn;break;case"info":_.debug("info info info"),(e=xr.a).parser.yy=_r;break;case"pie":_.debug("pie"),(e=Cr.a).parser.yy=Tr}e.parser.yy.parseError=function(t,e){throw{str:t,hash:e}},e.parse(t)},initialize:function(t){_.debug("Initializing mermaidAPI ",u.version),"object"===Br(t)&&function(t){for(var e=Object.keys(t),n=0;n<e.length;n++)if("object"===Br(t[e[n]])&&null!=t[e[n]])for(var r=Object.keys(t[e[n]]),i=0;i<r.length;i++)_.debug("Setting conf ",e[n],"-",r[i]),void 0===qr[e[n]]&&(qr[e[n]]={}),_.debug("Setting config: "+e[n]+" "+r[i]+" to "+t[e[n]][r[i]]),qr[e[n]][r[i]]=t[e[n]][r[i]];else qr[e[n]]=t[e[n]]}(t),l(qr),w(qr.logLevel)},getConfig:h},Ur=function(){zr.startOnLoad?jr.getConfig().startOnLoad&&zr.init():void 0===zr.startOnLoad&&(_.debug("In start, no config"),jr.getConfig().startOnLoad&&zr.init())};"undefined"!=typeof document&&
+t.exports={graphlib:n(311),dagre:n(153),intersect:n(368),render:n(370),util:n(12),version:n(382)}},function(t,e){t.exports=function(t){return t.webpackPolyfill||(t.deprecate=function(){},t.paths=[],t.children||(t.children=[]),Object.defineProperty(t,"loaded",{enumerable:!0,get:function(){return t.l}}),Object.defineProperty(t,"id",{enumerable:!0,get:function(){return t.i}}),t.webpackPolyfill=1),t}},function(t,e,n){"use strict";var r=n(4),i=n(17).Graph;function a(t,e,n,i){var a;do{a=r.uniqueId(i)}while(t.hasNode(a));return n.dummy=e,t.setNode(a,n),a}function o(t){return r.max(r.map(t.nodes(),(function(e){var n=t.node(e).rank;if(!r.isUndefined(n))return n})))}t.exports={addDummyNode:a,simplify:function(t){var e=(new i).setGraph(t.graph());return r.forEach(t.nodes(),(function(n){e.setNode(n,t.node(n))})),r.forEach(t.edges(),(function(n){var r=e.edge(n.v,n.w)||{weight:0,minlen:1},i=t.edge(n);e.setEdge(n.v,n.w,{weight:r.weight+i.weight,minlen:Math.max(r.minlen,i.minlen)})})),e},asNonCompoundGraph:function(t){var e=new i({multigraph:t.isMultigraph()}).setGraph(t.graph());return r.forEach(t.nodes(),(function(n){t.children(n).length||e.setNode(n,t.node(n))})),r.forEach(t.edges(),(function(n){e.setEdge(n,t.edge(n))})),e},successorWeights:function(t){var e=r.map(t.nodes(),(function(e){var n={};return r.forEach(t.outEdges(e),(function(e){n[e.w]=(n[e.w]||0)+t.edge(e).weight})),n}));return r.zipObject(t.nodes(),e)},predecessorWeights:function(t){var e=r.map(t.nodes(),(function(e){var n={};return r.forEach(t.inEdges(e),(function(e){n[e.v]=(n[e.v]||0)+t.edge(e).weight})),n}));return r.zipObject(t.nodes(),e)},intersectRect:function(t,e){var n,r,i=t.x,a=t.y,o=e.x-i,s=e.y-a,c=t.width/2,u=t.height/2;if(!o&&!s)throw new Error("Not possible to find intersection inside of the rectangle");Math.abs(s)*c>Math.abs(o)*u?(s<0&&(u=-u),n=u*o/s,r=u):(o<0&&(c=-c),n=c,r=c*s/o);return{x:i+n,y:a+r}},buildLayerMatrix:function(t){var e=r.map(r.range(o(t)+1),(function(){return[]}));return r.forEach(t.nodes(),(function(n){var i=t.node(n),a=i.rank;r.isUndefined(a)||(e[a][i.order]=n)})),e},normalizeRanks:function(t){var e=r.min(r.map(t.nodes(),(function(e){return t.node(e).rank})));r.forEach(t.nodes(),(function(n){var i=t.node(n);r.has(i,"rank")&&(i.rank-=e)}))},removeEmptyRanks:function(t){var e=r.min(r.map(t.nodes(),(function(e){return t.node(e).rank}))),n=[];r.forEach(t.nodes(),(function(r){var i=t.node(r).rank-e;n[i]||(n[i]=[]),n[i].push(r)}));var i=0,a=t.graph().nodeRankFactor;r.forEach(n,(function(e,n){r.isUndefined(e)&&n%a!=0?--i:i&&r.forEach(e,(function(e){t.node(e).rank+=i}))}))},addBorderNode:function(t,e,n,r){var i={width:0,height:0};arguments.length>=4&&(i.rank=n,i.order=r);return a(t,"border",i,e)},maxRank:o,partition:function(t,e){var n={lhs:[],rhs:[]};return r.forEach(t,(function(t){e(t)?n.lhs.push(t):n.rhs.push(t)})),n},time:function(t,e){var n=r.now();try{return e()}finally{console.log(t+" time: "+(r.now()-n)+"ms")}},notime:function(t,e){return e()}}},function(t,e,n){"use strict";Object.defineProperty(e,"__esModule",{value:!0});var r=n(173),i=n(174),a=n(175),o={channel:r.default,lang:i.default,unit:a.default};e.default=o},function(t,e,n){var r;try{r={clone:n(199),constant:n(86),each:n(87),filter:n(128),has:n(93),isArray:n(5),isEmpty:n(276),isFunction:n(37),isUndefined:n(139),keys:n(30),map:n(140),reduce:n(142),size:n(279),transform:n(285),union:n(286),values:n(147)}}catch(t){}r||(r=window._),t.exports=r},function(t,e){t.exports=function(t){var e=typeof t;return null!=t&&("object"==e||"function"==e)}},function(t,e,n){var r=n(43);t.exports={isSubgraph:function(t,e){return!!t.children(e).length},edgeToId:function(t){return a(t.v)+":"+a(t.w)+":"+a(t.name)},applyStyle:function(t,e){e&&t.attr("style",e)},applyClass:function(t,e,n){e&&t.attr("class",e).attr("class",n+" "+t.attr("class"))},applyTransition:function(t,e){var n=e.graph();if(r.isPlainObject(n)){var i=n.transition;if(r.isFunction(i))return i(t)}return t}};var i=/:/g;function a(t){return t?String(t).replace(i,"\\:"):""}},function(t,e,n){(function(t,r){var i=function(){var t=function(t,e,n,r){for(n=n||{},r=t.length;r--;n[t[r]]=e);return n},e=[1,7],n=[1,6],r=[1,14],i=[1,25],a=[1,28],o=[1,26],s=[1,27],c=[1,29],u=[1,30],l=[1,31],h=[1,32],f=[1,34],d=[1,35],p=[1,36],g=[10,19],y=[1,48],v=[1,49],m=[1,50],b=[1,51],x=[1,52],_=[1,53],k=[10,19,25,32,33,41,44,45,46,47,48,49,54,56],w=[10,19,23,25,32,33,37,41,44,45,46,47,48,49,54,56,71,72,73],E=[10,13,17,19],T=[41,71,72,73],C=[41,48,49,71,72,73],A=[41,44,45,46,47,71,72,73],S=[10,19,25],M=[1,85],O={trace:function(){},yy:{},symbols_:{error:2,start:3,mermaidDoc:4,directive:5,graphConfig:6,openDirective:7,typeDirective:8,closeDirective:9,NEWLINE:10,":":11,argDirective:12,open_directive:13,type_directive:14,arg_directive:15,close_directive:16,CLASS_DIAGRAM:17,statements:18,EOF:19,statement:20,className:21,alphaNumToken:22,GENERICTYPE:23,relationStatement:24,LABEL:25,classStatement:26,methodStatement:27,annotationStatement:28,clickStatement:29,cssClassStatement:30,CLASS:31,STYLE_SEPARATOR:32,STRUCT_START:33,members:34,STRUCT_STOP:35,ANNOTATION_START:36,ANNOTATION_END:37,MEMBER:38,SEPARATOR:39,relation:40,STR:41,relationType:42,lineType:43,AGGREGATION:44,EXTENSION:45,COMPOSITION:46,DEPENDENCY:47,LINE:48,DOTTED_LINE:49,CALLBACK:50,LINK:51,LINK_TARGET:52,CLICK:53,CALLBACK_NAME:54,CALLBACK_ARGS:55,HREF:56,CSSCLASS:57,commentToken:58,textToken:59,graphCodeTokens:60,textNoTagsToken:61,TAGSTART:62,TAGEND:63,"==":64,"--":65,PCT:66,DEFAULT:67,SPACE:68,MINUS:69,keywords:70,UNICODE_TEXT:71,NUM:72,ALPHA:73,$accept:0,$end:1},terminals_:{2:"error",10:"NEWLINE",11:":",13:"open_directive",14:"type_directive",15:"arg_directive",16:"close_directive",17:"CLASS_DIAGRAM",19:"EOF",23:"GENERICTYPE",25:"LABEL",31:"CLASS",32:"STYLE_SEPARATOR",33:"STRUCT_START",35:"STRUCT_STOP",36:"ANNOTATION_START",37:"ANNOTATION_END",38:"MEMBER",39:"SEPARATOR",41:"STR",44:"AGGREGATION",45:"EXTENSION",46:"COMPOSITION",47:"DEPENDENCY",48:"LINE",49:"DOTTED_LINE",50:"CALLBACK",51:"LINK",52:"LINK_TARGET",53:"CLICK",54:"CALLBACK_NAME",55:"CALLBACK_ARGS",56:"HREF",57:"CSSCLASS",60:"graphCodeTokens",62:"TAGSTART",63:"TAGEND",64:"==",65:"--",66:"PCT",67:"DEFAULT",68:"SPACE",69:"MINUS",70:"keywords",71:"UNICODE_TEXT",72:"NUM",73:"ALPHA"},productions_:[0,[3,1],[3,2],[4,1],[5,4],[5,6],[7,1],[8,1],[12,1],[9,1],[6,4],[18,1],[18,2],[18,3],[21,1],[21,2],[21,3],[21,2],[20,1],[20,2],[20,1],[20,1],[20,1],[20,1],[20,1],[20,1],[26,2],[26,4],[26,5],[26,7],[28,4],[34,1],[34,2],[27,1],[27,2],[27,1],[27,1],[24,3],[24,4],[24,4],[24,5],[40,3],[40,2],[40,2],[40,1],[42,1],[42,1],[42,1],[42,1],[43,1],[43,1],[29,3],[29,4],[29,3],[29,4],[29,4],[29,5],[29,3],[29,4],[29,4],[29,5],[29,3],[29,4],[29,4],[29,5],[30,3],[58,1],[58,1],[59,1],[59,1],[59,1],[59,1],[59,1],[59,1],[59,1],[61,1],[61,1],[61,1],[61,1],[22,1],[22,1],[22,1]],performAction:function(t,e,n,r,i,a,o){var s=a.length-1;switch(i){case 6:r.parseDirective("%%{","open_directive");break;case 7:r.parseDirective(a[s],"type_directive");break;case 8:a[s]=a[s].trim().replace(/'/g,'"'),r.parseDirective(a[s],"arg_directive");break;case 9:r.parseDirective("}%%","close_directive","class");break;case 14:this.$=a[s];break;case 15:this.$=a[s-1]+a[s];break;case 16:this.$=a[s-2]+"~"+a[s-1]+a[s];break;case 17:this.$=a[s-1]+"~"+a[s];break;case 18:r.addRelation(a[s]);break;case 19:a[s-1].title=r.cleanupLabel(a[s]),r.addRelation(a[s-1]);break;case 26:r.addClass(a[s]);break;case 27:r.addClass(a[s-2]),r.setCssClass(a[s-2],a[s]);break;case 28:r.addClass(a[s-3]),r.addMembers(a[s-3],a[s-1]);break;case 29:r.addClass(a[s-5]),r.setCssClass(a[s-5],a[s-3]),r.addMembers(a[s-5],a[s-1]);break;case 30:r.addAnnotation(a[s],a[s-2]);break;case 31:this.$=[a[s]];break;case 32:a[s].push(a[s-1]),this.$=a[s];break;case 33:break;case 34:r.addMember(a[s-1],r.cleanupLabel(a[s]));break;case 35:case 36:break;case 37:this.$={id1:a[s-2],id2:a[s],relation:a[s-1],relationTitle1:"none",relationTitle2:"none"};break;case 38:this.$={id1:a[s-3],id2:a[s],relation:a[s-1],relationTitle1:a[s-2],relationTitle2:"none"};break;case 39:this.$={id1:a[s-3],id2:a[s],relation:a[s-2],relationTitle1:"none",relationTitle2:a[s-1]};break;case 40:this.$={id1:a[s-4],id2:a[s],relation:a[s-2],relationTitle1:a[s-3],relationTitle2:a[s-1]};break;case 41:this.$={type1:a[s-2],type2:a[s],lineType:a[s-1]};break;case 42:this.$={type1:"none",type2:a[s],lineType:a[s-1]};break;case 43:this.$={type1:a[s-1],type2:"none",lineType:a[s]};break;case 44:this.$={type1:"none",type2:"none",lineType:a[s]};break;case 45:this.$=r.relationType.AGGREGATION;break;case 46:this.$=r.relationType.EXTENSION;break;case 47:this.$=r.relationType.COMPOSITION;break;case 48:this.$=r.relationType.DEPENDENCY;break;case 49:this.$=r.lineType.LINE;break;case 50:this.$=r.lineType.DOTTED_LINE;break;case 51:case 57:this.$=a[s-2],r.setClickEvent(a[s-1],a[s]);break;case 52:case 58:this.$=a[s-3],r.setClickEvent(a[s-2],a[s-1]),r.setTooltip(a[s-2],a[s]);break;case 53:case 61:this.$=a[s-2],r.setLink(a[s-1],a[s]);break;case 54:this.$=a[s-3],r.setLink(a[s-2],a[s-1],a[s]);break;case 55:case 63:this.$=a[s-3],r.setLink(a[s-2],a[s-1]),r.setTooltip(a[s-2],a[s]);break;case 56:case 64:this.$=a[s-4],r.setLink(a[s-3],a[s-2],a[s]),r.setTooltip(a[s-3],a[s-1]);break;case 59:this.$=a[s-3],r.setClickEvent(a[s-2],a[s-1],a[s]);break;case 60:this.$=a[s-4],r.setClickEvent(a[s-3],a[s-2],a[s-1]),r.setTooltip(a[s-3],a[s]);break;case 62:this.$=a[s-3],r.setLink(a[s-2],a[s-1],a[s]);break;case 65:r.setCssClass(a[s-1],a[s])}},table:[{3:1,4:2,5:3,6:4,7:5,13:e,17:n},{1:[3]},{1:[2,1]},{3:8,4:2,5:3,6:4,7:5,13:e,17:n},{1:[2,3]},{8:9,14:[1,10]},{10:[1,11]},{14:[2,6]},{1:[2,2]},{9:12,11:[1,13],16:r},t([11,16],[2,7]),{5:23,7:5,13:e,18:15,20:16,21:24,22:33,24:17,26:18,27:19,28:20,29:21,30:22,31:i,36:a,38:o,39:s,50:c,51:u,53:l,57:h,71:f,72:d,73:p},{10:[1,37]},{12:38,15:[1,39]},{10:[2,9]},{19:[1,40]},{10:[1,41],19:[2,11]},t(g,[2,18],{25:[1,42]}),t(g,[2,20]),t(g,[2,21]),t(g,[2,22]),t(g,[2,23]),t(g,[2,24]),t(g,[2,25]),t(g,[2,33],{40:43,42:46,43:47,25:[1,45],41:[1,44],44:y,45:v,46:m,47:b,48:x,49:_}),{21:54,22:33,71:f,72:d,73:p},t(g,[2,35]),t(g,[2,36]),{22:55,71:f,72:d,73:p},{21:56,22:33,71:f,72:d,73:p},{21:57,22:33,71:f,72:d,73:p},{21:58,22:33,71:f,72:d,73:p},{41:[1,59]},t(k,[2,14],{22:33,21:60,23:[1,61],71:f,72:d,73:p}),t(w,[2,79]),t(w,[2,80]),t(w,[2,81]),t(E,[2,4]),{9:62,16:r},{16:[2,8]},{1:[2,10]},{5:23,7:5,13:e,18:63,19:[2,12],20:16,21:24,22:33,24:17,26:18,27:19,28:20,29:21,30:22,31:i,36:a,38:o,39:s,50:c,51:u,53:l,57:h,71:f,72:d,73:p},t(g,[2,19]),{21:64,22:33,41:[1,65],71:f,72:d,73:p},{40:66,42:46,43:47,44:y,45:v,46:m,47:b,48:x,49:_},t(g,[2,34]),{43:67,48:x,49:_},t(T,[2,44],{42:68,44:y,45:v,46:m,47:b}),t(C,[2,45]),t(C,[2,46]),t(C,[2,47]),t(C,[2,48]),t(A,[2,49]),t(A,[2,50]),t(g,[2,26],{32:[1,69],33:[1,70]}),{37:[1,71]},{41:[1,72]},{41:[1,73]},{54:[1,74],56:[1,75]},{22:76,71:f,72:d,73:p},t(k,[2,15]),t(k,[2,17],{22:33,21:77,71:f,72:d,73:p}),{10:[1,78]},{19:[2,13]},t(S,[2,37]),{21:79,22:33,71:f,72:d,73:p},{21:80,22:33,41:[1,81],71:f,72:d,73:p},t(T,[2,43],{42:82,44:y,45:v,46:m,47:b}),t(T,[2,42]),{22:83,71:f,72:d,73:p},{34:84,38:M},{21:86,22:33,71:f,72:d,73:p},t(g,[2,51],{41:[1,87]}),t(g,[2,53],{41:[1,89],52:[1,88]}),t(g,[2,57],{41:[1,90],55:[1,91]}),t(g,[2,61],{41:[1,93],52:[1,92]}),t(g,[2,65]),t(k,[2,16]),t(E,[2,5]),t(S,[2,39]),t(S,[2,38]),{21:94,22:33,71:f,72:d,73:p},t(T,[2,41]),t(g,[2,27],{33:[1,95]}),{35:[1,96]},{34:97,35:[2,31],38:M},t(g,[2,30]),t(g,[2,52]),t(g,[2,54]),t(g,[2,55],{52:[1,98]}),t(g,[2,58]),t(g,[2,59],{41:[1,99]}),t(g,[2,62]),t(g,[2,63],{52:[1,100]}),t(S,[2,40]),{34:101,38:M},t(g,[2,28]),{35:[2,32]},t(g,[2,56]),t(g,[2,60]),t(g,[2,64]),{35:[1,102]},t(g,[2,29])],defaultActions:{2:[2,1],4:[2,3],7:[2,6],8:[2,2],14:[2,9],39:[2,8],40:[2,10],63:[2,13],97:[2,32]},parseError:function(t,e){if(!e.recoverable){var n=new Error(t);throw n.hash=e,n}this.trace(t)},parse:function(t){var e=this,n=[0],r=[],i=[null],a=[],o=this.table,s="",c=0,u=0,l=0,h=2,f=1,d=a.slice.call(arguments,1),p=Object.create(this.lexer),g={yy:{}};for(var y in this.yy)Object.prototype.hasOwnProperty.call(this.yy,y)&&(g.yy[y]=this.yy[y]);p.setInput(t,g.yy),g.yy.lexer=p,g.yy.parser=this,void 0===p.yylloc&&(p.yylloc={});var v=p.yylloc;a.push(v);var m=p.options&&p.options.ranges;function b(){var t;return"number"!=typeof(t=r.pop()||p.lex()||f)&&(t instanceof Array&&(t=(r=t).pop()),t=e.symbols_[t]||t),t}"function"==typeof g.yy.parseError?this.parseError=g.yy.parseError:this.parseError=Object.getPrototypeOf(this).parseError;for(var x,_,k,w,E,T,C,A,S,M={};;){if(k=n[n.length-1],this.defaultActions[k]?w=this.defaultActions[k]:(null==x&&(x=b()),w=o[k]&&o[k][x]),void 0===w||!w.length||!w[0]){var O="";for(T in S=[],o[k])this.terminals_[T]&&T>h&&S.push("'"+this.terminals_[T]+"'");O=p.showPosition?"Parse error on line "+(c+1)+":\n"+p.showPosition()+"\nExpecting "+S.join(", ")+", got '"+(this.terminals_[x]||x)+"'":"Parse error on line "+(c+1)+": Unexpected "+(x==f?"end of input":"'"+(this.terminals_[x]||x)+"'"),this.parseError(O,{text:p.match,token:this.terminals_[x]||x,line:p.yylineno,loc:v,expected:S})}if(w[0]instanceof Array&&w.length>1)throw new Error("Parse Error: multiple actions possible at state: "+k+", token: "+x);switch(w[0]){case 1:n.push(x),i.push(p.yytext),a.push(p.yylloc),n.push(w[1]),x=null,_?(x=_,_=null):(u=p.yyleng,s=p.yytext,c=p.yylineno,v=p.yylloc,l>0&&l--);break;case 2:if(C=this.productions_[w[1]][1],M.$=i[i.length-C],M._$={first_line:a[a.length-(C||1)].first_line,last_line:a[a.length-1].last_line,first_column:a[a.length-(C||1)].first_column,last_column:a[a.length-1].last_column},m&&(M._$.range=[a[a.length-(C||1)].range[0],a[a.length-1].range[1]]),void 0!==(E=this.performAction.apply(M,[s,u,c,g.yy,w[1],i,a].concat(d))))return E;C&&(n=n.slice(0,-1*C*2),i=i.slice(0,-1*C),a=a.slice(0,-1*C)),n.push(this.productions_[w[1]][0]),i.push(M.$),a.push(M._$),A=o[n[n.length-2]][n[n.length-1]],n.push(A);break;case 3:return!0}}return!0}},D={EOF:1,parseError:function(t,e){if(!this.yy.parser)throw new Error(t);this.yy.parser.parseError(t,e)},setInput:function(t,e){return this.yy=e||this.yy||{},this._input=t,this._more=this._backtrack=this.done=!1,this.yylineno=this.yyleng=0,this.yytext=this.matched=this.match="",this.conditionStack=["INITIAL"],this.yylloc={first_line:1,first_column:0,last_line:1,last_column:0},this.options.ranges&&(this.yylloc.range=[0,0]),this.offset=0,this},input:function(){var t=this._input[0];return this.yytext+=t,this.yyleng++,this.offset++,this.match+=t,this.matched+=t,t.match(/(?:\r\n?|\n).*/g)?(this.yylineno++,this.yylloc.last_line++):this.yylloc.last_column++,this.options.ranges&&this.yylloc.range[1]++,this._input=this._input.slice(1),t},unput:function(t){var e=t.length,n=t.split(/(?:\r\n?|\n)/g);this._input=t+this._input,this.yytext=this.yytext.substr(0,this.yytext.length-e),this.offset-=e;var r=this.match.split(/(?:\r\n?|\n)/g);this.match=this.match.substr(0,this.match.length-1),this.matched=this.matched.substr(0,this.matched.length-1),n.length-1&&(this.yylineno-=n.length-1);var i=this.yylloc.range;return this.yylloc={first_line:this.yylloc.first_line,last_line:this.yylineno+1,first_column:this.yylloc.first_column,last_column:n?(n.length===r.length?this.yylloc.first_column:0)+r[r.length-n.length].length-n[0].length:this.yylloc.first_column-e},this.options.ranges&&(this.yylloc.range=[i[0],i[0]+this.yyleng-e]),this.yyleng=this.yytext.length,this},more:function(){return this._more=!0,this},reject:function(){return this.options.backtrack_lexer?(this._backtrack=!0,this):this.parseError("Lexical error on line "+(this.yylineno+1)+". You can only invoke reject() in the lexer when the lexer is of the backtracking persuasion (options.backtrack_lexer = true).\n"+this.showPosition(),{text:"",token:null,line:this.yylineno})},less:function(t){this.unput(this.match.slice(t))},pastInput:function(){var t=this.matched.substr(0,this.matched.length-this.match.length);return(t.length>20?"...":"")+t.substr(-20).replace(/\n/g,"")},upcomingInput:function(){var t=this.match;return t.length<20&&(t+=this._input.substr(0,20-t.length)),(t.substr(0,20)+(t.length>20?"...":"")).replace(/\n/g,"")},showPosition:function(){var t=this.pastInput(),e=new Array(t.length+1).join("-");return t+this.upcomingInput()+"\n"+e+"^"},test_match:function(t,e){var n,r,i;if(this.options.backtrack_lexer&&(i={yylineno:this.yylineno,yylloc:{first_line:this.yylloc.first_line,last_line:this.last_line,first_column:this.yylloc.first_column,last_column:this.yylloc.last_column},yytext:this.yytext,match:this.match,matches:this.matches,matched:this.matched,yyleng:this.yyleng,offset:this.offset,_more:this._more,_input:this._input,yy:this.yy,conditionStack:this.conditionStack.slice(0),done:this.done},this.options.ranges&&(i.yylloc.range=this.yylloc.range.slice(0))),(r=t[0].match(/(?:\r\n?|\n).*/g))&&(this.yylineno+=r.length),this.yylloc={first_line:this.yylloc.last_line,last_line:this.yylineno+1,first_column:this.yylloc.last_column,last_column:r?r[r.length-1].length-r[r.length-1].match(/\r?\n?/)[0].length:this.yylloc.last_column+t[0].length},this.yytext+=t[0],this.match+=t[0],this.matches=t,this.yyleng=this.yytext.length,this.options.ranges&&(this.yylloc.range=[this.offset,this.offset+=this.yyleng]),this._more=!1,this._backtrack=!1,this._input=this._input.slice(t[0].length),this.matched+=t[0],n=this.performAction.call(this,this.yy,this,e,this.conditionStack[this.conditionStack.length-1]),this.done&&this._input&&(this.done=!1),n)return n;if(this._backtrack){for(var a in i)this[a]=i[a];return!1}return!1},next:function(){if(this.done)return this.EOF;var t,e,n,r;this._input||(this.done=!0),this._more||(this.yytext="",this.match="");for(var i=this._currentRules(),a=0;a<i.length;a++)if((n=this._input.match(this.rules[i[a]]))&&(!e||n[0].length>e[0].length)){if(e=n,r=a,this.options.backtrack_lexer){if(!1!==(t=this.test_match(n,i[a])))return t;if(this._backtrack){e=!1;continue}return!1}if(!this.options.flex)break}return e?!1!==(t=this.test_match(e,i[r]))&&t:""===this._input?this.EOF:this.parseError("Lexical error on line "+(this.yylineno+1)+". Unrecognized text.\n"+this.showPosition(),{text:"",token:null,line:this.yylineno})},lex:function(){var t=this.next();return t||this.lex()},begin:function(t){this.conditionStack.push(t)},popState:function(){return this.conditionStack.length-1>0?this.conditionStack.pop():this.conditionStack[0]},_currentRules:function(){return this.conditionStack.length&&this.conditionStack[this.conditionStack.length-1]?this.conditions[this.conditionStack[this.conditionStack.length-1]].rules:this.conditions.INITIAL.rules},topState:function(t){return(t=this.conditionStack.length-1-Math.abs(t||0))>=0?this.conditionStack[t]:"INITIAL"},pushState:function(t){this.begin(t)},stateStackSize:function(){return this.conditionStack.length},options:{},performAction:function(t,e,n,r){switch(n){case 0:return this.begin("open_directive"),13;case 1:return this.begin("type_directive"),14;case 2:return this.popState(),this.begin("arg_directive"),11;case 3:return this.popState(),this.popState(),16;case 4:return 15;case 5:case 6:break;case 7:return 10;case 8:break;case 9:case 10:return 17;case 11:return this.begin("struct"),33;case 12:return"EOF_IN_STRUCT";case 13:return"OPEN_IN_STRUCT";case 14:return this.popState(),35;case 15:break;case 16:return"MEMBER";case 17:return 31;case 18:return 57;case 19:return 50;case 20:return 51;case 21:return 53;case 22:return 36;case 23:return 37;case 24:this.begin("generic");break;case 25:this.popState();break;case 26:return"GENERICTYPE";case 27:this.begin("string");break;case 28:this.popState();break;case 29:return"STR";case 30:this.begin("href");break;case 31:this.popState();break;case 32:return 56;case 33:this.begin("callback_name");break;case 34:this.popState();break;case 35:this.popState(),this.begin("callback_args");break;case 36:return 54;case 37:this.popState();break;case 38:return 55;case 39:case 40:case 41:case 42:return 52;case 43:case 44:return 45;case 45:case 46:return 47;case 47:return 46;case 48:return 44;case 49:return 48;case 50:return 49;case 51:return 25;case 52:return 32;case 53:return 69;case 54:return"DOT";case 55:return"PLUS";case 56:return 66;case 57:case 58:return"EQUALS";case 59:return 73;case 60:return"PUNCTUATION";case 61:return 72;case 62:return 71;case 63:return 68;case 64:return 19}},rules:[/^(?:%%\{)/,/^(?:((?:(?!\}%%)[^:.])*))/,/^(?::)/,/^(?:\}%%)/,/^(?:((?:(?!\}%%).|\n)*))/,/^(?:%%(?!\{)*[^\n]*(\r?\n?)+)/,/^(?:%%[^\n]*(\r?\n)*)/,/^(?:(\r?\n)+)/,/^(?:\s+)/,/^(?:classDiagram-v2\b)/,/^(?:classDiagram\b)/,/^(?:[{])/,/^(?:$)/,/^(?:[{])/,/^(?:[}])/,/^(?:[\n])/,/^(?:[^{}\n]*)/,/^(?:class\b)/,/^(?:cssClass\b)/,/^(?:callback\b)/,/^(?:link\b)/,/^(?:click\b)/,/^(?:<<)/,/^(?:>>)/,/^(?:[~])/,/^(?:[~])/,/^(?:[^~]*)/,/^(?:["])/,/^(?:["])/,/^(?:[^"]*)/,/^(?:href[\s]+["])/,/^(?:["])/,/^(?:[^"]*)/,/^(?:call[\s]+)/,/^(?:\([\s]*\))/,/^(?:\()/,/^(?:[^(]*)/,/^(?:\))/,/^(?:[^)]*)/,/^(?:_self\b)/,/^(?:_blank\b)/,/^(?:_parent\b)/,/^(?:_top\b)/,/^(?:\s*<\|)/,/^(?:\s*\|>)/,/^(?:\s*>)/,/^(?:\s*<)/,/^(?:\s*\*)/,/^(?:\s*o\b)/,/^(?:--)/,/^(?:\.\.)/,/^(?::{1}[^:\n;]+)/,/^(?::{3})/,/^(?:-)/,/^(?:\.)/,/^(?:\+)/,/^(?:%)/,/^(?:=)/,/^(?:=)/,/^(?:\w+)/,/^(?:[!"#$%&'*+,-.`?\\/])/,/^(?:[0-9]+)/,/^(?:[\u00AA\u00B5\u00BA\u00C0-\u00D6\u00D8-\u00F6]|[\u00F8-\u02C1\u02C6-\u02D1\u02E0-\u02E4\u02EC\u02EE\u0370-\u0374\u0376\u0377]|[\u037A-\u037D\u0386\u0388-\u038A\u038C\u038E-\u03A1\u03A3-\u03F5]|[\u03F7-\u0481\u048A-\u0527\u0531-\u0556\u0559\u0561-\u0587\u05D0-\u05EA]|[\u05F0-\u05F2\u0620-\u064A\u066E\u066F\u0671-\u06D3\u06D5\u06E5\u06E6\u06EE]|[\u06EF\u06FA-\u06FC\u06FF\u0710\u0712-\u072F\u074D-\u07A5\u07B1\u07CA-\u07EA]|[\u07F4\u07F5\u07FA\u0800-\u0815\u081A\u0824\u0828\u0840-\u0858\u08A0]|[\u08A2-\u08AC\u0904-\u0939\u093D\u0950\u0958-\u0961\u0971-\u0977]|[\u0979-\u097F\u0985-\u098C\u098F\u0990\u0993-\u09A8\u09AA-\u09B0\u09B2]|[\u09B6-\u09B9\u09BD\u09CE\u09DC\u09DD\u09DF-\u09E1\u09F0\u09F1\u0A05-\u0A0A]|[\u0A0F\u0A10\u0A13-\u0A28\u0A2A-\u0A30\u0A32\u0A33\u0A35\u0A36\u0A38\u0A39]|[\u0A59-\u0A5C\u0A5E\u0A72-\u0A74\u0A85-\u0A8D\u0A8F-\u0A91\u0A93-\u0AA8]|[\u0AAA-\u0AB0\u0AB2\u0AB3\u0AB5-\u0AB9\u0ABD\u0AD0\u0AE0\u0AE1\u0B05-\u0B0C]|[\u0B0F\u0B10\u0B13-\u0B28\u0B2A-\u0B30\u0B32\u0B33\u0B35-\u0B39\u0B3D\u0B5C]|[\u0B5D\u0B5F-\u0B61\u0B71\u0B83\u0B85-\u0B8A\u0B8E-\u0B90\u0B92-\u0B95\u0B99]|[\u0B9A\u0B9C\u0B9E\u0B9F\u0BA3\u0BA4\u0BA8-\u0BAA\u0BAE-\u0BB9\u0BD0]|[\u0C05-\u0C0C\u0C0E-\u0C10\u0C12-\u0C28\u0C2A-\u0C33\u0C35-\u0C39\u0C3D]|[\u0C58\u0C59\u0C60\u0C61\u0C85-\u0C8C\u0C8E-\u0C90\u0C92-\u0CA8\u0CAA-\u0CB3]|[\u0CB5-\u0CB9\u0CBD\u0CDE\u0CE0\u0CE1\u0CF1\u0CF2\u0D05-\u0D0C\u0D0E-\u0D10]|[\u0D12-\u0D3A\u0D3D\u0D4E\u0D60\u0D61\u0D7A-\u0D7F\u0D85-\u0D96\u0D9A-\u0DB1]|[\u0DB3-\u0DBB\u0DBD\u0DC0-\u0DC6\u0E01-\u0E30\u0E32\u0E33\u0E40-\u0E46\u0E81]|[\u0E82\u0E84\u0E87\u0E88\u0E8A\u0E8D\u0E94-\u0E97\u0E99-\u0E9F\u0EA1-\u0EA3]|[\u0EA5\u0EA7\u0EAA\u0EAB\u0EAD-\u0EB0\u0EB2\u0EB3\u0EBD\u0EC0-\u0EC4\u0EC6]|[\u0EDC-\u0EDF\u0F00\u0F40-\u0F47\u0F49-\u0F6C\u0F88-\u0F8C\u1000-\u102A]|[\u103F\u1050-\u1055\u105A-\u105D\u1061\u1065\u1066\u106E-\u1070\u1075-\u1081]|[\u108E\u10A0-\u10C5\u10C7\u10CD\u10D0-\u10FA\u10FC-\u1248\u124A-\u124D]|[\u1250-\u1256\u1258\u125A-\u125D\u1260-\u1288\u128A-\u128D\u1290-\u12B0]|[\u12B2-\u12B5\u12B8-\u12BE\u12C0\u12C2-\u12C5\u12C8-\u12D6\u12D8-\u1310]|[\u1312-\u1315\u1318-\u135A\u1380-\u138F\u13A0-\u13F4\u1401-\u166C]|[\u166F-\u167F\u1681-\u169A\u16A0-\u16EA\u1700-\u170C\u170E-\u1711]|[\u1720-\u1731\u1740-\u1751\u1760-\u176C\u176E-\u1770\u1780-\u17B3\u17D7]|[\u17DC\u1820-\u1877\u1880-\u18A8\u18AA\u18B0-\u18F5\u1900-\u191C]|[\u1950-\u196D\u1970-\u1974\u1980-\u19AB\u19C1-\u19C7\u1A00-\u1A16]|[\u1A20-\u1A54\u1AA7\u1B05-\u1B33\u1B45-\u1B4B\u1B83-\u1BA0\u1BAE\u1BAF]|[\u1BBA-\u1BE5\u1C00-\u1C23\u1C4D-\u1C4F\u1C5A-\u1C7D\u1CE9-\u1CEC]|[\u1CEE-\u1CF1\u1CF5\u1CF6\u1D00-\u1DBF\u1E00-\u1F15\u1F18-\u1F1D]|[\u1F20-\u1F45\u1F48-\u1F4D\u1F50-\u1F57\u1F59\u1F5B\u1F5D\u1F5F-\u1F7D]|[\u1F80-\u1FB4\u1FB6-\u1FBC\u1FBE\u1FC2-\u1FC4\u1FC6-\u1FCC\u1FD0-\u1FD3]|[\u1FD6-\u1FDB\u1FE0-\u1FEC\u1FF2-\u1FF4\u1FF6-\u1FFC\u2071\u207F]|[\u2090-\u209C\u2102\u2107\u210A-\u2113\u2115\u2119-\u211D\u2124\u2126\u2128]|[\u212A-\u212D\u212F-\u2139\u213C-\u213F\u2145-\u2149\u214E\u2183\u2184]|[\u2C00-\u2C2E\u2C30-\u2C5E\u2C60-\u2CE4\u2CEB-\u2CEE\u2CF2\u2CF3]|[\u2D00-\u2D25\u2D27\u2D2D\u2D30-\u2D67\u2D6F\u2D80-\u2D96\u2DA0-\u2DA6]|[\u2DA8-\u2DAE\u2DB0-\u2DB6\u2DB8-\u2DBE\u2DC0-\u2DC6\u2DC8-\u2DCE]|[\u2DD0-\u2DD6\u2DD8-\u2DDE\u2E2F\u3005\u3006\u3031-\u3035\u303B\u303C]|[\u3041-\u3096\u309D-\u309F\u30A1-\u30FA\u30FC-\u30FF\u3105-\u312D]|[\u3131-\u318E\u31A0-\u31BA\u31F0-\u31FF\u3400-\u4DB5\u4E00-\u9FCC]|[\uA000-\uA48C\uA4D0-\uA4FD\uA500-\uA60C\uA610-\uA61F\uA62A\uA62B]|[\uA640-\uA66E\uA67F-\uA697\uA6A0-\uA6E5\uA717-\uA71F\uA722-\uA788]|[\uA78B-\uA78E\uA790-\uA793\uA7A0-\uA7AA\uA7F8-\uA801\uA803-\uA805]|[\uA807-\uA80A\uA80C-\uA822\uA840-\uA873\uA882-\uA8B3\uA8F2-\uA8F7\uA8FB]|[\uA90A-\uA925\uA930-\uA946\uA960-\uA97C\uA984-\uA9B2\uA9CF\uAA00-\uAA28]|[\uAA40-\uAA42\uAA44-\uAA4B\uAA60-\uAA76\uAA7A\uAA80-\uAAAF\uAAB1\uAAB5]|[\uAAB6\uAAB9-\uAABD\uAAC0\uAAC2\uAADB-\uAADD\uAAE0-\uAAEA\uAAF2-\uAAF4]|[\uAB01-\uAB06\uAB09-\uAB0E\uAB11-\uAB16\uAB20-\uAB26\uAB28-\uAB2E]|[\uABC0-\uABE2\uAC00-\uD7A3\uD7B0-\uD7C6\uD7CB-\uD7FB\uF900-\uFA6D]|[\uFA70-\uFAD9\uFB00-\uFB06\uFB13-\uFB17\uFB1D\uFB1F-\uFB28\uFB2A-\uFB36]|[\uFB38-\uFB3C\uFB3E\uFB40\uFB41\uFB43\uFB44\uFB46-\uFBB1\uFBD3-\uFD3D]|[\uFD50-\uFD8F\uFD92-\uFDC7\uFDF0-\uFDFB\uFE70-\uFE74\uFE76-\uFEFC]|[\uFF21-\uFF3A\uFF41-\uFF5A\uFF66-\uFFBE\uFFC2-\uFFC7\uFFCA-\uFFCF]|[\uFFD2-\uFFD7\uFFDA-\uFFDC])/,/^(?:\s)/,/^(?:$)/],conditions:{arg_directive:{rules:[3,4],inclusive:!1},type_directive:{rules:[2,3],inclusive:!1},open_directive:{rules:[1],inclusive:!1},callback_args:{rules:[37,38],inclusive:!1},callback_name:{rules:[34,35,36],inclusive:!1},href:{rules:[31,32],inclusive:!1},struct:{rules:[12,13,14,15,16],inclusive:!1},generic:{rules:[25,26],inclusive:!1},string:{rules:[28,29],inclusive:!1},INITIAL:{rules:[0,5,6,7,8,9,10,11,17,18,19,20,21,22,23,24,27,30,33,39,40,41,42,43,44,45,46,47,48,49,50,51,52,53,54,55,56,57,58,59,60,61,62,63,64],inclusive:!0}}};function N(){this.yy={}}return O.lexer=D,N.prototype=O,O.Parser=N,new N}();e.parser=i,e.Parser=i.Parser,e.parse=function(){return i.parse.apply(i,arguments)},e.main=function(r){r[1]||(console.log("Usage: "+r[0]+" FILE"),t.exit(1));var i=n(19).readFileSync(n(20).normalize(r[1]),"utf8");return e.parser.parse(i)},n.c[n.s]===r&&e.main(t.argv.slice(1))}).call(this,n(14),n(7)(t))},function(t,e){var n,r,i=t.exports={};function a(){throw new Error("setTimeout has not been defined")}function o(){throw new Error("clearTimeout has not been defined")}function s(t){if(n===setTimeout)return setTimeout(t,0);if((n===a||!n)&&setTimeout)return n=setTimeout,setTimeout(t,0);try{return n(t,0)}catch(e){try{return n.call(null,t,0)}catch(e){return n.call(this,t,0)}}}!function(){try{n="function"==typeof setTimeout?setTimeout:a}catch(t){n=a}try{r="function"==typeof clearTimeout?clearTimeout:o}catch(t){r=o}}();var c,u=[],l=!1,h=-1;function f(){l&&c&&(l=!1,c.length?u=c.concat(u):h=-1,u.length&&d())}function d(){if(!l){var t=s(f);l=!0;for(var e=u.length;e;){for(c=u,u=[];++h<e;)c&&c[h].run();h=-1,e=u.length}c=null,l=!1,function(t){if(r===clearTimeout)return clearTimeout(t);if((r===o||!r)&&clearTimeout)return r=clearTimeout,clearTimeout(t);try{r(t)}catch(e){try{return r.call(null,t)}catch(e){return r.call(this,t)}}}(t)}}function p(t,e){this.fun=t,this.array=e}function g(){}i.nextTick=function(t){var e=new Array(arguments.length-1);if(arguments.length>1)for(var n=1;n<arguments.length;n++)e[n-1]=arguments[n];u.push(new p(t,e)),1!==u.length||l||s(d)},p.prototype.run=function(){this.fun.apply(null,this.array)},i.title="browser",i.browser=!0,i.env={},i.argv=[],i.version="",i.versions={},i.on=g,i.addListener=g,i.once=g,i.off=g,i.removeListener=g,i.removeAllListeners=g,i.emit=g,i.prependListener=g,i.prependOnceListener=g,i.listeners=function(t){return[]},i.binding=function(t){throw new Error("process.binding is not supported")},i.cwd=function(){return"/"},i.chdir=function(t){throw new Error("process.chdir is not supported")},i.umask=function(){return 0}},function(t,e,n){"use strict";Object.defineProperty(e,"__esModule",{value:!0});var r=n(75),i=n(99),a=n(179),o=n(180),s=n(181),c={format:{keyword:a.default,hex:i.default,rgb:o.default,rgba:o.default,hsl:s.default,hsla:s.default},parse:function(t){if("string"!=typeof t)return t;var e=i.default.parse(t)||o.default.parse(t)||s.default.parse(t)||a.default.parse(t);if(e)return e;throw new Error('Unsupported color format: "'+t+'"')},stringify:function(t){return!t.changed&&t.color?t.color:t.type.is(r.TYPE.HSL)||void 0===t.data.r?s.default.stringify(t):t.a<1||!Number.isInteger(t.r)||!Number.isInteger(t.g)||!Number.isInteger(t.b)?o.default.stringify(t):i.default.stringify(t)}};e.default=c},function(t,e,n){var r=n(109),i="object"==typeof self&&self&&self.Object===Object&&self,a=r||i||Function("return this")();t.exports=a},function(t,e,n){var r;try{r=n(3)}catch(t){}r||(r=window.graphlib),t.exports=r},function(t,e,n){t.exports={graphlib:n(17),layout:n(312),debug:n(366),util:{time:n(8).time,notime:n(8).notime},version:n(367)}},function(t,e){},function(t,e,n){(function(t){function n(t,e){for(var n=0,r=t.length-1;r>=0;r--){var i=t[r];"."===i?t.splice(r,1):".."===i?(t.splice(r,1),n++):n&&(t.splice(r,1),n--)}if(e)for(;n--;n)t.unshift("..");return t}function r(t,e){if(t.filter)return t.filter(e);for(var n=[],r=0;r<t.length;r++)e(t[r],r,t)&&n.push(t[r]);return n}e.resolve=function(){for(var e="",i=!1,a=arguments.length-1;a>=-1&&!i;a--){var o=a>=0?arguments[a]:t.cwd();if("string"!=typeof o)throw new TypeError("Arguments to path.resolve must be strings");o&&(e=o+"/"+e,i="/"===o.charAt(0))}return(i?"/":"")+(e=n(r(e.split("/"),(function(t){return!!t})),!i).join("/"))||"."},e.normalize=function(t){var a=e.isAbsolute(t),o="/"===i(t,-1);return(t=n(r(t.split("/"),(function(t){return!!t})),!a).join("/"))||a||(t="."),t&&o&&(t+="/"),(a?"/":"")+t},e.isAbsolute=function(t){return"/"===t.charAt(0)},e.join=function(){var t=Array.prototype.slice.call(arguments,0);return e.normalize(r(t,(function(t,e){if("string"!=typeof t)throw new TypeError("Arguments to path.join must be strings");return t})).join("/"))},e.relative=function(t,n){function r(t){for(var e=0;e<t.length&&""===t[e];e++);for(var n=t.length-1;n>=0&&""===t[n];n--);return e>n?[]:t.slice(e,n-e+1)}t=e.resolve(t).substr(1),n=e.resolve(n).substr(1);for(var i=r(t.split("/")),a=r(n.split("/")),o=Math.min(i.length,a.length),s=o,c=0;c<o;c++)if(i[c]!==a[c]){s=c;break}var u=[];for(c=s;c<i.length;c++)u.push("..");return(u=u.concat(a.slice(s))).join("/")},e.sep="/",e.delimiter=":",e.dirname=function(t){if("string"!=typeof t&&(t+=""),0===t.length)return".";for(var e=t.charCodeAt(0),n=47===e,r=-1,i=!0,a=t.length-1;a>=1;--a)if(47===(e=t.charCodeAt(a))){if(!i){r=a;break}}else i=!1;return-1===r?n?"/":".":n&&1===r?"/":t.slice(0,r)},e.basename=function(t,e){var n=function(t){"string"!=typeof t&&(t+="");var e,n=0,r=-1,i=!0;for(e=t.length-1;e>=0;--e)if(47===t.charCodeAt(e)){if(!i){n=e+1;break}}else-1===r&&(i=!1,r=e+1);return-1===r?"":t.slice(n,r)}(t);return e&&n.substr(-1*e.length)===e&&(n=n.substr(0,n.length-e.length)),n},e.extname=function(t){"string"!=typeof t&&(t+="");for(var e=-1,n=0,r=-1,i=!0,a=0,o=t.length-1;o>=0;--o){var s=t.charCodeAt(o);if(47!==s)-1===r&&(i=!1,r=o+1),46===s?-1===e?e=o:1!==a&&(a=1):-1!==e&&(a=-1);else if(!i){n=o+1;break}}return-1===e||-1===r||0===a||1===a&&e===r-1&&e===n+1?"":t.slice(e,r)};var i="b"==="ab".substr(-1)?function(t,e,n){return t.substr(e,n)}:function(t,e,n){return e<0&&(e=t.length+e),t.substr(e,n)}}).call(this,n(14))},function(t,e){t.exports=function(t){return null!=t&&"object"==typeof t}},function(t,e,n){(function(t,r){var i=function(){var t=function(t,e,n,r){for(n=n||{},r=t.length;r--;n[t[r]]=e);return n},e=[1,2],n=[1,3],r=[1,5],i=[1,7],a=[2,5],o=[1,15],s=[1,17],c=[1,19],u=[1,20],l=[1,21],h=[1,22],f=[1,28],d=[1,23],p=[1,24],g=[1,25],y=[1,26],v=[1,29],m=[1,32],b=[1,4,5,14,15,17,19,20,22,23,24,25,26,36,39],x=[1,4,5,12,13,14,15,17,19,20,22,23,24,25,26,36,39],_=[1,4,5,7,14,15,17,19,20,22,23,24,25,26,36,39],k=[4,5,14,15,17,19,20,22,23,24,25,26,36,39],w={trace:function(){},yy:{},symbols_:{error:2,start:3,SPACE:4,NL:5,directive:6,SD:7,document:8,line:9,statement:10,idStatement:11,DESCR:12,"--\x3e":13,HIDE_EMPTY:14,scale:15,WIDTH:16,COMPOSIT_STATE:17,STRUCT_START:18,STRUCT_STOP:19,STATE_DESCR:20,AS:21,ID:22,FORK:23,JOIN:24,CONCURRENT:25,note:26,notePosition:27,NOTE_TEXT:28,openDirective:29,typeDirective:30,closeDirective:31,":":32,argDirective:33,eol:34,";":35,EDGE_STATE:36,left_of:37,right_of:38,open_directive:39,type_directive:40,arg_directive:41,close_directive:42,$accept:0,$end:1},terminals_:{2:"error",4:"SPACE",5:"NL",7:"SD",12:"DESCR",13:"--\x3e",14:"HIDE_EMPTY",15:"scale",16:"WIDTH",17:"COMPOSIT_STATE",18:"STRUCT_START",19:"STRUCT_STOP",20:"STATE_DESCR",21:"AS",22:"ID",23:"FORK",24:"JOIN",25:"CONCURRENT",26:"note",28:"NOTE_TEXT",32:":",35:";",36:"EDGE_STATE",37:"left_of",38:"right_of",39:"open_directive",40:"type_directive",41:"arg_directive",42:"close_directive"},productions_:[0,[3,2],[3,2],[3,2],[3,2],[8,0],[8,2],[9,2],[9,1],[9,1],[10,1],[10,2],[10,3],[10,4],[10,1],[10,2],[10,1],[10,4],[10,3],[10,6],[10,1],[10,1],[10,1],[10,4],[10,4],[10,1],[6,3],[6,5],[34,1],[34,1],[11,1],[11,1],[27,1],[27,1],[29,1],[30,1],[33,1],[31,1]],performAction:function(t,e,n,r,i,a,o){var s=a.length-1;switch(i){case 4:return r.setRootDoc(a[s]),a[s];case 5:this.$=[];break;case 6:"nl"!=a[s]&&(a[s-1].push(a[s]),this.$=a[s-1]);break;case 7:case 8:this.$=a[s];break;case 9:this.$="nl";break;case 10:this.$={stmt:"state",id:a[s],type:"default",description:""};break;case 11:this.$={stmt:"state",id:a[s-1],type:"default",description:r.trimColon(a[s])};break;case 12:this.$={stmt:"relation",state1:{stmt:"state",id:a[s-2],type:"default",description:""},state2:{stmt:"state",id:a[s],type:"default",description:""}};break;case 13:this.$={stmt:"relation",state1:{stmt:"state",id:a[s-3],type:"default",description:""},state2:{stmt:"state",id:a[s-1],type:"default",description:""},description:a[s].substr(1).trim()};break;case 17:this.$={stmt:"state",id:a[s-3],type:"default",description:"",doc:a[s-1]};break;case 18:var c=a[s],u=a[s-2].trim();if(a[s].match(":")){var l=a[s].split(":");c=l[0],u=[u,l[1]]}this.$={stmt:"state",id:c,type:"default",description:u};break;case 19:this.$={stmt:"state",id:a[s-3],type:"default",description:a[s-5],doc:a[s-1]};break;case 20:this.$={stmt:"state",id:a[s],type:"fork"};break;case 21:this.$={stmt:"state",id:a[s],type:"join"};break;case 22:this.$={stmt:"state",id:r.getDividerId(),type:"divider"};break;case 23:this.$={stmt:"state",id:a[s-1].trim(),note:{position:a[s-2].trim(),text:a[s].trim()}};break;case 30:case 31:this.$=a[s];break;case 34:r.parseDirective("%%{","open_directive");break;case 35:r.parseDirective(a[s],"type_directive");break;case 36:a[s]=a[s].trim().replace(/'/g,'"'),r.parseDirective(a[s],"arg_directive");break;case 37:r.parseDirective("}%%","close_directive","state")}},table:[{3:1,4:e,5:n,6:4,7:r,29:6,39:i},{1:[3]},{3:8,4:e,5:n,6:4,7:r,29:6,39:i},{3:9,4:e,5:n,6:4,7:r,29:6,39:i},{3:10,4:e,5:n,6:4,7:r,29:6,39:i},t([1,4,5,14,15,17,20,22,23,24,25,26,36,39],a,{8:11}),{30:12,40:[1,13]},{40:[2,34]},{1:[2,1]},{1:[2,2]},{1:[2,3]},{1:[2,4],4:o,5:s,6:27,9:14,10:16,11:18,14:c,15:u,17:l,20:h,22:f,23:d,24:p,25:g,26:y,29:6,36:v,39:i},{31:30,32:[1,31],42:m},t([32,42],[2,35]),t(b,[2,6]),{6:27,10:33,11:18,14:c,15:u,17:l,20:h,22:f,23:d,24:p,25:g,26:y,29:6,36:v,39:i},t(b,[2,8]),t(b,[2,9]),t(b,[2,10],{12:[1,34],13:[1,35]}),t(b,[2,14]),{16:[1,36]},t(b,[2,16],{18:[1,37]}),{21:[1,38]},t(b,[2,20]),t(b,[2,21]),t(b,[2,22]),{27:39,28:[1,40],37:[1,41],38:[1,42]},t(b,[2,25]),t(x,[2,30]),t(x,[2,31]),t(_,[2,26]),{33:43,41:[1,44]},t(_,[2,37]),t(b,[2,7]),t(b,[2,11]),{11:45,22:f,36:v},t(b,[2,15]),t(k,a,{8:46}),{22:[1,47]},{22:[1,48]},{21:[1,49]},{22:[2,32]},{22:[2,33]},{31:50,42:m},{42:[2,36]},t(b,[2,12],{12:[1,51]}),{4:o,5:s,6:27,9:14,10:16,11:18,14:c,15:u,17:l,19:[1,52],20:h,22:f,23:d,24:p,25:g,26:y,29:6,36:v,39:i},t(b,[2,18],{18:[1,53]}),{28:[1,54]},{22:[1,55]},t(_,[2,27]),t(b,[2,13]),t(b,[2,17]),t(k,a,{8:56}),t(b,[2,23]),t(b,[2,24]),{4:o,5:s,6:27,9:14,10:16,11:18,14:c,15:u,17:l,19:[1,57],20:h,22:f,23:d,24:p,25:g,26:y,29:6,36:v,39:i},t(b,[2,19])],defaultActions:{7:[2,34],8:[2,1],9:[2,2],10:[2,3],41:[2,32],42:[2,33],44:[2,36]},parseError:function(t,e){if(!e.recoverable){var n=new Error(t);throw n.hash=e,n}this.trace(t)},parse:function(t){var e=this,n=[0],r=[],i=[null],a=[],o=this.table,s="",c=0,u=0,l=0,h=2,f=1,d=a.slice.call(arguments,1),p=Object.create(this.lexer),g={yy:{}};for(var y in this.yy)Object.prototype.hasOwnProperty.call(this.yy,y)&&(g.yy[y]=this.yy[y]);p.setInput(t,g.yy),g.yy.lexer=p,g.yy.parser=this,void 0===p.yylloc&&(p.yylloc={});var v=p.yylloc;a.push(v);var m=p.options&&p.options.ranges;function b(){var t;return"number"!=typeof(t=r.pop()||p.lex()||f)&&(t instanceof Array&&(t=(r=t).pop()),t=e.symbols_[t]||t),t}"function"==typeof g.yy.parseError?this.parseError=g.yy.parseError:this.parseError=Object.getPrototypeOf(this).parseError;for(var x,_,k,w,E,T,C,A,S,M={};;){if(k=n[n.length-1],this.defaultActions[k]?w=this.defaultActions[k]:(null==x&&(x=b()),w=o[k]&&o[k][x]),void 0===w||!w.length||!w[0]){var O="";for(T in S=[],o[k])this.terminals_[T]&&T>h&&S.push("'"+this.terminals_[T]+"'");O=p.showPosition?"Parse error on line "+(c+1)+":\n"+p.showPosition()+"\nExpecting "+S.join(", ")+", got '"+(this.terminals_[x]||x)+"'":"Parse error on line "+(c+1)+": Unexpected "+(x==f?"end of input":"'"+(this.terminals_[x]||x)+"'"),this.parseError(O,{text:p.match,token:this.terminals_[x]||x,line:p.yylineno,loc:v,expected:S})}if(w[0]instanceof Array&&w.length>1)throw new Error("Parse Error: multiple actions possible at state: "+k+", token: "+x);switch(w[0]){case 1:n.push(x),i.push(p.yytext),a.push(p.yylloc),n.push(w[1]),x=null,_?(x=_,_=null):(u=p.yyleng,s=p.yytext,c=p.yylineno,v=p.yylloc,l>0&&l--);break;case 2:if(C=this.productions_[w[1]][1],M.$=i[i.length-C],M._$={first_line:a[a.length-(C||1)].first_line,last_line:a[a.length-1].last_line,first_column:a[a.length-(C||1)].first_column,last_column:a[a.length-1].last_column},m&&(M._$.range=[a[a.length-(C||1)].range[0],a[a.length-1].range[1]]),void 0!==(E=this.performAction.apply(M,[s,u,c,g.yy,w[1],i,a].concat(d))))return E;C&&(n=n.slice(0,-1*C*2),i=i.slice(0,-1*C),a=a.slice(0,-1*C)),n.push(this.productions_[w[1]][0]),i.push(M.$),a.push(M._$),A=o[n[n.length-2]][n[n.length-1]],n.push(A);break;case 3:return!0}}return!0}},E={EOF:1,parseError:function(t,e){if(!this.yy.parser)throw new Error(t);this.yy.parser.parseError(t,e)},setInput:function(t,e){return this.yy=e||this.yy||{},this._input=t,this._more=this._backtrack=this.done=!1,this.yylineno=this.yyleng=0,this.yytext=this.matched=this.match="",this.conditionStack=["INITIAL"],this.yylloc={first_line:1,first_column:0,last_line:1,last_column:0},this.options.ranges&&(this.yylloc.range=[0,0]),this.offset=0,this},input:function(){var t=this._input[0];return this.yytext+=t,this.yyleng++,this.offset++,this.match+=t,this.matched+=t,t.match(/(?:\r\n?|\n).*/g)?(this.yylineno++,this.yylloc.last_line++):this.yylloc.last_column++,this.options.ranges&&this.yylloc.range[1]++,this._input=this._input.slice(1),t},unput:function(t){var e=t.length,n=t.split(/(?:\r\n?|\n)/g);this._input=t+this._input,this.yytext=this.yytext.substr(0,this.yytext.length-e),this.offset-=e;var r=this.match.split(/(?:\r\n?|\n)/g);this.match=this.match.substr(0,this.match.length-1),this.matched=this.matched.substr(0,this.matched.length-1),n.length-1&&(this.yylineno-=n.length-1);var i=this.yylloc.range;return this.yylloc={first_line:this.yylloc.first_line,last_line:this.yylineno+1,first_column:this.yylloc.first_column,last_column:n?(n.length===r.length?this.yylloc.first_column:0)+r[r.length-n.length].length-n[0].length:this.yylloc.first_column-e},this.options.ranges&&(this.yylloc.range=[i[0],i[0]+this.yyleng-e]),this.yyleng=this.yytext.length,this},more:function(){return this._more=!0,this},reject:function(){return this.options.backtrack_lexer?(this._backtrack=!0,this):this.parseError("Lexical error on line "+(this.yylineno+1)+". You can only invoke reject() in the lexer when the lexer is of the backtracking persuasion (options.backtrack_lexer = true).\n"+this.showPosition(),{text:"",token:null,line:this.yylineno})},less:function(t){this.unput(this.match.slice(t))},pastInput:function(){var t=this.matched.substr(0,this.matched.length-this.match.length);return(t.length>20?"...":"")+t.substr(-20).replace(/\n/g,"")},upcomingInput:function(){var t=this.match;return t.length<20&&(t+=this._input.substr(0,20-t.length)),(t.substr(0,20)+(t.length>20?"...":"")).replace(/\n/g,"")},showPosition:function(){var t=this.pastInput(),e=new Array(t.length+1).join("-");return t+this.upcomingInput()+"\n"+e+"^"},test_match:function(t,e){var n,r,i;if(this.options.backtrack_lexer&&(i={yylineno:this.yylineno,yylloc:{first_line:this.yylloc.first_line,last_line:this.last_line,first_column:this.yylloc.first_column,last_column:this.yylloc.last_column},yytext:this.yytext,match:this.match,matches:this.matches,matched:this.matched,yyleng:this.yyleng,offset:this.offset,_more:this._more,_input:this._input,yy:this.yy,conditionStack:this.conditionStack.slice(0),done:this.done},this.options.ranges&&(i.yylloc.range=this.yylloc.range.slice(0))),(r=t[0].match(/(?:\r\n?|\n).*/g))&&(this.yylineno+=r.length),this.yylloc={first_line:this.yylloc.last_line,last_line:this.yylineno+1,first_column:this.yylloc.last_column,last_column:r?r[r.length-1].length-r[r.length-1].match(/\r?\n?/)[0].length:this.yylloc.last_column+t[0].length},this.yytext+=t[0],this.match+=t[0],this.matches=t,this.yyleng=this.yytext.length,this.options.ranges&&(this.yylloc.range=[this.offset,this.offset+=this.yyleng]),this._more=!1,this._backtrack=!1,this._input=this._input.slice(t[0].length),this.matched+=t[0],n=this.performAction.call(this,this.yy,this,e,this.conditionStack[this.conditionStack.length-1]),this.done&&this._input&&(this.done=!1),n)return n;if(this._backtrack){for(var a in i)this[a]=i[a];return!1}return!1},next:function(){if(this.done)return this.EOF;var t,e,n,r;this._input||(this.done=!0),this._more||(this.yytext="",this.match="");for(var i=this._currentRules(),a=0;a<i.length;a++)if((n=this._input.match(this.rules[i[a]]))&&(!e||n[0].length>e[0].length)){if(e=n,r=a,this.options.backtrack_lexer){if(!1!==(t=this.test_match(n,i[a])))return t;if(this._backtrack){e=!1;continue}return!1}if(!this.options.flex)break}return e?!1!==(t=this.test_match(e,i[r]))&&t:""===this._input?this.EOF:this.parseError("Lexical error on line "+(this.yylineno+1)+". Unrecognized text.\n"+this.showPosition(),{text:"",token:null,line:this.yylineno})},lex:function(){var t=this.next();return t||this.lex()},begin:function(t){this.conditionStack.push(t)},popState:function(){return this.conditionStack.length-1>0?this.conditionStack.pop():this.conditionStack[0]},_currentRules:function(){return this.conditionStack.length&&this.conditionStack[this.conditionStack.length-1]?this.conditions[this.conditionStack[this.conditionStack.length-1]].rules:this.conditions.INITIAL.rules},topState:function(t){return(t=this.conditionStack.length-1-Math.abs(t||0))>=0?this.conditionStack[t]:"INITIAL"},pushState:function(t){this.begin(t)},stateStackSize:function(){return this.conditionStack.length},options:{"case-insensitive":!0},performAction:function(t,e,n,r){switch(n){case 0:return this.begin("open_directive"),39;case 1:return this.begin("type_directive"),40;case 2:return this.popState(),this.begin("arg_directive"),32;case 3:return this.popState(),this.popState(),42;case 4:return 41;case 5:break;case 6:console.log("Crap after close");break;case 7:return 5;case 8:case 9:case 10:case 11:break;case 12:return this.pushState("SCALE"),15;case 13:return 16;case 14:this.popState();break;case 15:this.pushState("STATE");break;case 16:return this.popState(),e.yytext=e.yytext.slice(0,-8).trim(),23;case 17:return this.popState(),e.yytext=e.yytext.slice(0,-8).trim(),24;case 18:return this.popState(),e.yytext=e.yytext.slice(0,-8).trim(),23;case 19:return this.popState(),e.yytext=e.yytext.slice(0,-8).trim(),24;case 20:this.begin("STATE_STRING");break;case 21:return this.popState(),this.pushState("STATE_ID"),"AS";case 22:return this.popState(),"ID";case 23:this.popState();break;case 24:return"STATE_DESCR";case 25:return 17;case 26:this.popState();break;case 27:return this.popState(),this.pushState("struct"),18;case 28:return this.popState(),19;case 29:break;case 30:return this.begin("NOTE"),26;case 31:return this.popState(),this.pushState("NOTE_ID"),37;case 32:return this.popState(),this.pushState("NOTE_ID"),38;case 33:this.popState(),this.pushState("FLOATING_NOTE");break;case 34:return this.popState(),this.pushState("FLOATING_NOTE_ID"),"AS";case 35:break;case 36:return"NOTE_TEXT";case 37:return this.popState(),"ID";case 38:return this.popState(),this.pushState("NOTE_TEXT"),22;case 39:return this.popState(),e.yytext=e.yytext.substr(2).trim(),28;case 40:return this.popState(),e.yytext=e.yytext.slice(0,-8).trim(),28;case 41:case 42:return 7;case 43:return 14;case 44:return 36;case 45:return 22;case 46:return e.yytext=e.yytext.trim(),12;case 47:return 13;case 48:return 25;case 49:return 5;case 50:return"INVALID"}},rules:[/^(?:%%\{)/i,/^(?:((?:(?!\}%%)[^:.])*))/i,/^(?::)/i,/^(?:\}%%)/i,/^(?:((?:(?!\}%%).|\n)*))/i,/^(?:%%(?!\{)[^\n]*)/i,/^(?:[^\}]%%[^\n]*)/i,/^(?:[\n]+)/i,/^(?:[\s]+)/i,/^(?:((?!\n)\s)+)/i,/^(?:#[^\n]*)/i,/^(?:%[^\n]*)/i,/^(?:scale\s+)/i,/^(?:\d+)/i,/^(?:\s+width\b)/i,/^(?:state\s+)/i,/^(?:.*<<fork>>)/i,/^(?:.*<<join>>)/i,/^(?:.*\[\[fork\]\])/i,/^(?:.*\[\[join\]\])/i,/^(?:["])/i,/^(?:\s*as\s+)/i,/^(?:[^\n\{]*)/i,/^(?:["])/i,/^(?:[^"]*)/i,/^(?:[^\n\s\{]+)/i,/^(?:\n)/i,/^(?:\{)/i,/^(?:\})/i,/^(?:[\n])/i,/^(?:note\s+)/i,/^(?:left of\b)/i,/^(?:right of\b)/i,/^(?:")/i,/^(?:\s*as\s*)/i,/^(?:["])/i,/^(?:[^"]*)/i,/^(?:[^\n]*)/i,/^(?:\s*[^:\n\s\-]+)/i,/^(?:\s*:[^:\n;]+)/i,/^(?:[\s\S]*?end note\b)/i,/^(?:stateDiagram\s+)/i,/^(?:stateDiagram-v2\s+)/i,/^(?:hide empty description\b)/i,/^(?:\[\*\])/i,/^(?:[^:\n\s\-\{]+)/i,/^(?:\s*:[^:\n;]+)/i,/^(?:-->)/i,/^(?:--)/i,/^(?:$)/i,/^(?:.)/i],conditions:{LINE:{rules:[9,10],inclusive:!1},close_directive:{rules:[9,10],inclusive:!1},arg_directive:{rules:[3,4,9,10],inclusive:!1},type_directive:{rules:[2,3,9,10],inclusive:!1},open_directive:{rules:[1,9,10],inclusive:!1},struct:{rules:[9,10,15,28,29,30,44,45,46,47,48],inclusive:!1},FLOATING_NOTE_ID:{rules:[37],inclusive:!1},FLOATING_NOTE:{rules:[34,35,36],inclusive:!1},NOTE_TEXT:{rules:[39,40],inclusive:!1},NOTE_ID:{rules:[38],inclusive:!1},NOTE:{rules:[31,32,33],inclusive:!1},SCALE:{rules:[13,14],inclusive:!1},ALIAS:{rules:[],inclusive:!1},STATE_ID:{rules:[22],inclusive:!1},STATE_STRING:{rules:[23,24],inclusive:!1},FORK_STATE:{rules:[],inclusive:!1},STATE:{rules:[9,10,16,17,18,19,20,21,25,26,27],inclusive:!1},ID:{rules:[9,10],inclusive:!1},INITIAL:{rules:[0,5,6,7,8,10,11,12,15,27,30,41,42,43,44,45,46,47,49,50],inclusive:!0}}};function T(){this.yy={}}return w.lexer=E,T.prototype=w,w.Parser=T,new T}();e.parser=i,e.Parser=i.Parser,e.parse=function(){return i.parse.apply(i,arguments)},e.main=function(r){r[1]||(console.log("Usage: "+r[0]+" FILE"),t.exit(1));var i=n(19).readFileSync(n(20).normalize(r[1]),"utf8");return e.parser.parse(i)},n.c[n.s]===r&&e.main(t.argv.slice(1))}).call(this,n(14),n(7)(t))},function(t,e,n){(function(t){t.exports=function(){"use strict";var e,r;function i(){return e.apply(null,arguments)}function a(t){return t instanceof Array||"[object Array]"===Object.prototype.toString.call(t)}function o(t){return null!=t&&"[object Object]"===Object.prototype.toString.call(t)}function s(t){return void 0===t}function c(t){return"number"==typeof t||"[object Number]"===Object.prototype.toString.call(t)}function u(t){return t instanceof Date||"[object Date]"===Object.prototype.toString.call(t)}function l(t,e){var n,r=[];for(n=0;n<t.length;++n)r.push(e(t[n],n));return r}function h(t,e){return Object.prototype.hasOwnProperty.call(t,e)}function f(t,e){for(var n in e)h(e,n)&&(t[n]=e[n]);return h(e,"toString")&&(t.toString=e.toString),h(e,"valueOf")&&(t.valueOf=e.valueOf),t}function d(t,e,n,r){return be(t,e,n,r,!0).utc()}function p(t){return null==t._pf&&(t._pf={empty:!1,unusedTokens:[],unusedInput:[],overflow:-2,charsLeftOver:0,nullInput:!1,invalidMonth:null,invalidFormat:!1,userInvalidated:!1,iso:!1,parsedDateParts:[],meridiem:null,rfc2822:!1,weekdayMismatch:!1}),t._pf}function g(t){if(null==t._isValid){var e=p(t),n=r.call(e.parsedDateParts,(function(t){return null!=t})),i=!isNaN(t._d.getTime())&&e.overflow<0&&!e.empty&&!e.invalidMonth&&!e.invalidWeekday&&!e.weekdayMismatch&&!e.nullInput&&!e.invalidFormat&&!e.userInvalidated&&(!e.meridiem||e.meridiem&&n);if(t._strict&&(i=i&&0===e.charsLeftOver&&0===e.unusedTokens.length&&void 0===e.bigHour),null!=Object.isFrozen&&Object.isFrozen(t))return i;t._isValid=i}return t._isValid}function y(t){var e=d(NaN);return null!=t?f(p(e),t):p(e).userInvalidated=!0,e}r=Array.prototype.some?Array.prototype.some:function(t){for(var e=Object(this),n=e.length>>>0,r=0;r<n;r++)if(r in e&&t.call(this,e[r],r,e))return!0;return!1};var v=i.momentProperties=[];function m(t,e){var n,r,i;if(s(e._isAMomentObject)||(t._isAMomentObject=e._isAMomentObject),s(e._i)||(t._i=e._i),s(e._f)||(t._f=e._f),s(e._l)||(t._l=e._l),s(e._strict)||(t._strict=e._strict),s(e._tzm)||(t._tzm=e._tzm),s(e._isUTC)||(t._isUTC=e._isUTC),s(e._offset)||(t._offset=e._offset),s(e._pf)||(t._pf=p(e)),s(e._locale)||(t._locale=e._locale),0<v.length)for(n=0;n<v.length;n++)s(i=e[r=v[n]])||(t[r]=i);return t}var b=!1;function x(t){m(this,t),this._d=new Date(null!=t._d?t._d.getTime():NaN),this.isValid()||(this._d=new Date(NaN)),!1===b&&(b=!0,i.updateOffset(this),b=!1)}function _(t){return t instanceof x||null!=t&&null!=t._isAMomentObject}function k(t){return t<0?Math.ceil(t)||0:Math.floor(t)}function w(t){var e=+t,n=0;return 0!==e&&isFinite(e)&&(n=k(e)),n}function E(t,e,n){var r,i=Math.min(t.length,e.length),a=Math.abs(t.length-e.length),o=0;for(r=0;r<i;r++)(n&&t[r]!==e[r]||!n&&w(t[r])!==w(e[r]))&&o++;return o+a}function T(t){!1===i.suppressDeprecationWarnings&&"undefined"!=typeof console&&console.warn&&console.warn("Deprecation warning: "+t)}function C(t,e){var n=!0;return f((function(){if(null!=i.deprecationHandler&&i.deprecationHandler(null,t),n){for(var r,a=[],o=0;o<arguments.length;o++){if(r="","object"==typeof arguments[o]){for(var s in r+="\n["+o+"] ",arguments[0])r+=s+": "+arguments[0][s]+", ";r=r.slice(0,-2)}else r=arguments[o];a.push(r)}T(t+"\nArguments: "+Array.prototype.slice.call(a).join("")+"\n"+(new Error).stack),n=!1}return e.apply(this,arguments)}),e)}var A,S={};function M(t,e){null!=i.deprecationHandler&&i.deprecationHandler(t,e),S[t]||(T(e),S[t]=!0)}function O(t){return t instanceof Function||"[object Function]"===Object.prototype.toString.call(t)}function D(t,e){var n,r=f({},t);for(n in e)h(e,n)&&(o(t[n])&&o(e[n])?(r[n]={},f(r[n],t[n]),f(r[n],e[n])):null!=e[n]?r[n]=e[n]:delete r[n]);for(n in t)h(t,n)&&!h(e,n)&&o(t[n])&&(r[n]=f({},r[n]));return r}function N(t){null!=t&&this.set(t)}i.suppressDeprecationWarnings=!1,i.deprecationHandler=null,A=Object.keys?Object.keys:function(t){var e,n=[];for(e in t)h(t,e)&&n.push(e);return n};var B={};function L(t,e){var n=t.toLowerCase();B[n]=B[n+"s"]=B[e]=t}function P(t){return"string"==typeof t?B[t]||B[t.toLowerCase()]:void 0}function I(t){var e,n,r={};for(n in t)h(t,n)&&(e=P(n))&&(r[e]=t[n]);return r}var F={};function j(t,e){F[t]=e}function R(t,e,n){var r=""+Math.abs(t),i=e-r.length;return(0<=t?n?"+":"":"-")+Math.pow(10,Math.max(0,i)).toString().substr(1)+r}var Y=/(\[[^\[]*\])|(\\)?([Hh]mm(ss)?|Mo|MM?M?M?|Do|DDDo|DD?D?D?|ddd?d?|do?|w[o|w]?|W[o|W]?|Qo?|YYYYYY|YYYYY|YYYY|YY|gg(ggg?)?|GG(GGG?)?|e|E|a|A|hh?|HH?|kk?|mm?|ss?|S{1,9}|x|X|zz?|ZZ?|.)/g,z=/(\[[^\[]*\])|(\\)?(LTS|LT|LL?L?L?|l{1,4})/g,U={},$={};function W(t,e,n,r){var i=r;"string"==typeof r&&(i=function(){return this[r]()}),t&&($[t]=i),e&&($[e[0]]=function(){return R(i.apply(this,arguments),e[1],e[2])}),n&&($[n]=function(){return this.localeData().ordinal(i.apply(this,arguments),t)})}function H(t,e){return t.isValid()?(e=V(e,t.localeData()),U[e]=U[e]||function(t){var e,n,r,i=t.match(Y);for(e=0,n=i.length;e<n;e++)$[i[e]]?i[e]=$[i[e]]:i[e]=(r=i[e]).match(/\[[\s\S]/)?r.replace(/^\[|\]$/g,""):r.replace(/\\/g,"");return function(e){var r,a="";for(r=0;r<n;r++)a+=O(i[r])?i[r].call(e,t):i[r];return a}}(e),U[e](t)):t.localeData().invalidDate()}function V(t,e){var n=5;function r(t){return e.longDateFormat(t)||t}for(z.lastIndex=0;0<=n&&z.test(t);)t=t.replace(z,r),z.lastIndex=0,n-=1;return t}var G=/\d/,q=/\d\d/,X=/\d{3}/,Z=/\d{4}/,J=/[+-]?\d{6}/,K=/\d\d?/,Q=/\d\d\d\d?/,tt=/\d\d\d\d\d\d?/,et=/\d{1,3}/,nt=/\d{1,4}/,rt=/[+-]?\d{1,6}/,it=/\d+/,at=/[+-]?\d+/,ot=/Z|[+-]\d\d:?\d\d/gi,st=/Z|[+-]\d\d(?::?\d\d)?/gi,ct=/[0-9]{0,256}['a-z\u00A0-\u05FF\u0700-\uD7FF\uF900-\uFDCF\uFDF0-\uFF07\uFF10-\uFFEF]{1,256}|[\u0600-\u06FF\/]{1,256}(\s*?[\u0600-\u06FF]{1,256}){1,2}/i,ut={};function lt(t,e,n){ut[t]=O(e)?e:function(t,r){return t&&n?n:e}}function ht(t,e){return h(ut,t)?ut[t](e._strict,e._locale):new RegExp(ft(t.replace("\\","").replace(/\\(\[)|\\(\])|\[([^\]\[]*)\]|\\(.)/g,(function(t,e,n,r,i){return e||n||r||i}))))}function ft(t){return t.replace(/[-\/\\^$*+?.()|[\]{}]/g,"\\$&")}var dt={};function pt(t,e){var n,r=e;for("string"==typeof t&&(t=[t]),c(e)&&(r=function(t,n){n[e]=w(t)}),n=0;n<t.length;n++)dt[t[n]]=r}function gt(t,e){pt(t,(function(t,n,r,i){r._w=r._w||{},e(t,r._w,r,i)}))}function yt(t){return vt(t)?366:365}function vt(t){return t%4==0&&t%100!=0||t%400==0}W("Y",0,0,(function(){var t=this.year();return t<=9999?""+t:"+"+t})),W(0,["YY",2],0,(function(){return this.year()%100})),W(0,["YYYY",4],0,"year"),W(0,["YYYYY",5],0,"year"),W(0,["YYYYYY",6,!0],0,"year"),L("year","y"),j("year",1),lt("Y",at),lt("YY",K,q),lt("YYYY",nt,Z),lt("YYYYY",rt,J),lt("YYYYYY",rt,J),pt(["YYYYY","YYYYYY"],0),pt("YYYY",(function(t,e){e[0]=2===t.length?i.parseTwoDigitYear(t):w(t)})),pt("YY",(function(t,e){e[0]=i.parseTwoDigitYear(t)})),pt("Y",(function(t,e){e[0]=parseInt(t,10)})),i.parseTwoDigitYear=function(t){return w(t)+(68<w(t)?1900:2e3)};var mt,bt=xt("FullYear",!0);function xt(t,e){return function(n){return null!=n?(kt(this,t,n),i.updateOffset(this,e),this):_t(this,t)}}function _t(t,e){return t.isValid()?t._d["get"+(t._isUTC?"UTC":"")+e]():NaN}function kt(t,e,n){t.isValid()&&!isNaN(n)&&("FullYear"===e&&vt(t.year())&&1===t.month()&&29===t.date()?t._d["set"+(t._isUTC?"UTC":"")+e](n,t.month(),wt(n,t.month())):t._d["set"+(t._isUTC?"UTC":"")+e](n))}function wt(t,e){if(isNaN(t)||isNaN(e))return NaN;var n=(e%12+12)%12;return t+=(e-n)/12,1===n?vt(t)?29:28:31-n%7%2}mt=Array.prototype.indexOf?Array.prototype.indexOf:function(t){var e;for(e=0;e<this.length;++e)if(this[e]===t)return e;return-1},W("M",["MM",2],"Mo",(function(){return this.month()+1})),W("MMM",0,0,(function(t){return this.localeData().monthsShort(this,t)})),W("MMMM",0,0,(function(t){return this.localeData().months(this,t)})),L("month","M"),j("month",8),lt("M",K),lt("MM",K,q),lt("MMM",(function(t,e){return e.monthsShortRegex(t)})),lt("MMMM",(function(t,e){return e.monthsRegex(t)})),pt(["M","MM"],(function(t,e){e[1]=w(t)-1})),pt(["MMM","MMMM"],(function(t,e,n,r){var i=n._locale.monthsParse(t,r,n._strict);null!=i?e[1]=i:p(n).invalidMonth=t}));var Et=/D[oD]?(\[[^\[\]]*\]|\s)+MMMM?/,Tt="January_February_March_April_May_June_July_August_September_October_November_December".split("_"),Ct="Jan_Feb_Mar_Apr_May_Jun_Jul_Aug_Sep_Oct_Nov_Dec".split("_");function At(t,e){var n;if(!t.isValid())return t;if("string"==typeof e)if(/^\d+$/.test(e))e=w(e);else if(!c(e=t.localeData().monthsParse(e)))return t;return n=Math.min(t.date(),wt(t.year(),e)),t._d["set"+(t._isUTC?"UTC":"")+"Month"](e,n),t}function St(t){return null!=t?(At(this,t),i.updateOffset(this,!0),this):_t(this,"Month")}var Mt=ct,Ot=ct;function Dt(){function t(t,e){return e.length-t.length}var e,n,r=[],i=[],a=[];for(e=0;e<12;e++)n=d([2e3,e]),r.push(this.monthsShort(n,"")),i.push(this.months(n,"")),a.push(this.months(n,"")),a.push(this.monthsShort(n,""));for(r.sort(t),i.sort(t),a.sort(t),e=0;e<12;e++)r[e]=ft(r[e]),i[e]=ft(i[e]);for(e=0;e<24;e++)a[e]=ft(a[e]);this._monthsRegex=new RegExp("^("+a.join("|")+")","i"),this._monthsShortRegex=this._monthsRegex,this._monthsStrictRegex=new RegExp("^("+i.join("|")+")","i"),this._monthsShortStrictRegex=new RegExp("^("+r.join("|")+")","i")}function Nt(t){var e;if(t<100&&0<=t){var n=Array.prototype.slice.call(arguments);n[0]=t+400,e=new Date(Date.UTC.apply(null,n)),isFinite(e.getUTCFullYear())&&e.setUTCFullYear(t)}else e=new Date(Date.UTC.apply(null,arguments));return e}function Bt(t,e,n){var r=7+e-n;return-(7+Nt(t,0,r).getUTCDay()-e)%7+r-1}function Lt(t,e,n,r,i){var a,o,s=1+7*(e-1)+(7+n-r)%7+Bt(t,r,i);return o=s<=0?yt(a=t-1)+s:s>yt(t)?(a=t+1,s-yt(t)):(a=t,s),{year:a,dayOfYear:o}}function Pt(t,e,n){var r,i,a=Bt(t.year(),e,n),o=Math.floor((t.dayOfYear()-a-1)/7)+1;return o<1?r=o+It(i=t.year()-1,e,n):o>It(t.year(),e,n)?(r=o-It(t.year(),e,n),i=t.year()+1):(i=t.year(),r=o),{week:r,year:i}}function It(t,e,n){var r=Bt(t,e,n),i=Bt(t+1,e,n);return(yt(t)-r+i)/7}function Ft(t,e){return t.slice(e,7).concat(t.slice(0,e))}W("w",["ww",2],"wo","week"),W("W",["WW",2],"Wo","isoWeek"),L("week","w"),L("isoWeek","W"),j("week",5),j("isoWeek",5),lt("w",K),lt("ww",K,q),lt("W",K),lt("WW",K,q),gt(["w","ww","W","WW"],(function(t,e,n,r){e[r.substr(0,1)]=w(t)})),W("d",0,"do","day"),W("dd",0,0,(function(t){return this.localeData().weekdaysMin(this,t)})),W("ddd",0,0,(function(t){return this.localeData().weekdaysShort(this,t)})),W("dddd",0,0,(function(t){return this.localeData().weekdays(this,t)})),W("e",0,0,"weekday"),W("E",0,0,"isoWeekday"),L("day","d"),L("weekday","e"),L("isoWeekday","E"),j("day",11),j("weekday",11),j("isoWeekday",11),lt("d",K),lt("e",K),lt("E",K),lt("dd",(function(t,e){return e.weekdaysMinRegex(t)})),lt("ddd",(function(t,e){return e.weekdaysShortRegex(t)})),lt("dddd",(function(t,e){return e.weekdaysRegex(t)})),gt(["dd","ddd","dddd"],(function(t,e,n,r){var i=n._locale.weekdaysParse(t,r,n._strict);null!=i?e.d=i:p(n).invalidWeekday=t})),gt(["d","e","E"],(function(t,e,n,r){e[r]=w(t)}));var jt="Sunday_Monday_Tuesday_Wednesday_Thursday_Friday_Saturday".split("_"),Rt="Sun_Mon_Tue_Wed_Thu_Fri_Sat".split("_"),Yt="Su_Mo_Tu_We_Th_Fr_Sa".split("_"),zt=ct,Ut=ct,$t=ct;function Wt(){function t(t,e){return e.length-t.length}var e,n,r,i,a,o=[],s=[],c=[],u=[];for(e=0;e<7;e++)n=d([2e3,1]).day(e),r=this.weekdaysMin(n,""),i=this.weekdaysShort(n,""),a=this.weekdays(n,""),o.push(r),s.push(i),c.push(a),u.push(r),u.push(i),u.push(a);for(o.sort(t),s.sort(t),c.sort(t),u.sort(t),e=0;e<7;e++)s[e]=ft(s[e]),c[e]=ft(c[e]),u[e]=ft(u[e]);this._weekdaysRegex=new RegExp("^("+u.join("|")+")","i"),this._weekdaysShortRegex=this._weekdaysRegex,this._weekdaysMinRegex=this._weekdaysRegex,this._weekdaysStrictRegex=new RegExp("^("+c.join("|")+")","i"),this._weekdaysShortStrictRegex=new RegExp("^("+s.join("|")+")","i"),this._weekdaysMinStrictRegex=new RegExp("^("+o.join("|")+")","i")}function Ht(){return this.hours()%12||12}function Vt(t,e){W(t,0,0,(function(){return this.localeData().meridiem(this.hours(),this.minutes(),e)}))}function Gt(t,e){return e._meridiemParse}W("H",["HH",2],0,"hour"),W("h",["hh",2],0,Ht),W("k",["kk",2],0,(function(){return this.hours()||24})),W("hmm",0,0,(function(){return""+Ht.apply(this)+R(this.minutes(),2)})),W("hmmss",0,0,(function(){return""+Ht.apply(this)+R(this.minutes(),2)+R(this.seconds(),2)})),W("Hmm",0,0,(function(){return""+this.hours()+R(this.minutes(),2)})),W("Hmmss",0,0,(function(){return""+this.hours()+R(this.minutes(),2)+R(this.seconds(),2)})),Vt("a",!0),Vt("A",!1),L("hour","h"),j("hour",13),lt("a",Gt),lt("A",Gt),lt("H",K),lt("h",K),lt("k",K),lt("HH",K,q),lt("hh",K,q),lt("kk",K,q),lt("hmm",Q),lt("hmmss",tt),lt("Hmm",Q),lt("Hmmss",tt),pt(["H","HH"],3),pt(["k","kk"],(function(t,e,n){var r=w(t);e[3]=24===r?0:r})),pt(["a","A"],(function(t,e,n){n._isPm=n._locale.isPM(t),n._meridiem=t})),pt(["h","hh"],(function(t,e,n){e[3]=w(t),p(n).bigHour=!0})),pt("hmm",(function(t,e,n){var r=t.length-2;e[3]=w(t.substr(0,r)),e[4]=w(t.substr(r)),p(n).bigHour=!0})),pt("hmmss",(function(t,e,n){var r=t.length-4,i=t.length-2;e[3]=w(t.substr(0,r)),e[4]=w(t.substr(r,2)),e[5]=w(t.substr(i)),p(n).bigHour=!0})),pt("Hmm",(function(t,e,n){var r=t.length-2;e[3]=w(t.substr(0,r)),e[4]=w(t.substr(r))})),pt("Hmmss",(function(t,e,n){var r=t.length-4,i=t.length-2;e[3]=w(t.substr(0,r)),e[4]=w(t.substr(r,2)),e[5]=w(t.substr(i))}));var qt,Xt=xt("Hours",!0),Zt={calendar:{sameDay:"[Today at] LT",nextDay:"[Tomorrow at] LT",nextWeek:"dddd [at] LT",lastDay:"[Yesterday at] LT",lastWeek:"[Last] dddd [at] LT",sameElse:"L"},longDateFormat:{LTS:"h:mm:ss A",LT:"h:mm A",L:"MM/DD/YYYY",LL:"MMMM D, YYYY",LLL:"MMMM D, YYYY h:mm A",LLLL:"dddd, MMMM D, YYYY h:mm A"},invalidDate:"Invalid date",ordinal:"%d",dayOfMonthOrdinalParse:/\d{1,2}/,relativeTime:{future:"in %s",past:"%s ago",s:"a few seconds",ss:"%d seconds",m:"a minute",mm:"%d minutes",h:"an hour",hh:"%d hours",d:"a day",dd:"%d days",M:"a month",MM:"%d months",y:"a year",yy:"%d years"},months:Tt,monthsShort:Ct,week:{dow:0,doy:6},weekdays:jt,weekdaysMin:Yt,weekdaysShort:Rt,meridiemParse:/[ap]\.?m?\.?/i},Jt={},Kt={};function Qt(t){return t?t.toLowerCase().replace("_","-"):t}function te(e){var r=null;if(!Jt[e]&&void 0!==t&&t&&t.exports)try{r=qt._abbr,n(171)("./"+e),ee(r)}catch(e){}return Jt[e]}function ee(t,e){var n;return t&&((n=s(e)?re(t):ne(t,e))?qt=n:"undefined"!=typeof console&&console.warn&&console.warn("Locale "+t+" not found. Did you forget to load it?")),qt._abbr}function ne(t,e){if(null===e)return delete Jt[t],null;var n,r=Zt;if(e.abbr=t,null!=Jt[t])M("defineLocaleOverride","use moment.updateLocale(localeName, config) to change an existing locale. moment.defineLocale(localeName, config) should only be used for creating a new locale See http://momentjs.com/guides/#/warnings/define-locale/ for more info."),r=Jt[t]._config;else if(null!=e.parentLocale)if(null!=Jt[e.parentLocale])r=Jt[e.parentLocale]._config;else{if(null==(n=te(e.parentLocale)))return Kt[e.parentLocale]||(Kt[e.parentLocale]=[]),Kt[e.parentLocale].push({name:t,config:e}),null;r=n._config}return Jt[t]=new N(D(r,e)),Kt[t]&&Kt[t].forEach((function(t){ne(t.name,t.config)})),ee(t),Jt[t]}function re(t){var e;if(t&&t._locale&&t._locale._abbr&&(t=t._locale._abbr),!t)return qt;if(!a(t)){if(e=te(t))return e;t=[t]}return function(t){for(var e,n,r,i,a=0;a<t.length;){for(e=(i=Qt(t[a]).split("-")).length,n=(n=Qt(t[a+1]))?n.split("-"):null;0<e;){if(r=te(i.slice(0,e).join("-")))return r;if(n&&n.length>=e&&E(i,n,!0)>=e-1)break;e--}a++}return qt}(t)}function ie(t){var e,n=t._a;return n&&-2===p(t).overflow&&(e=n[1]<0||11<n[1]?1:n[2]<1||n[2]>wt(n[0],n[1])?2:n[3]<0||24<n[3]||24===n[3]&&(0!==n[4]||0!==n[5]||0!==n[6])?3:n[4]<0||59<n[4]?4:n[5]<0||59<n[5]?5:n[6]<0||999<n[6]?6:-1,p(t)._overflowDayOfYear&&(e<0||2<e)&&(e=2),p(t)._overflowWeeks&&-1===e&&(e=7),p(t)._overflowWeekday&&-1===e&&(e=8),p(t).overflow=e),t}function ae(t,e,n){return null!=t?t:null!=e?e:n}function oe(t){var e,n,r,a,o,s=[];if(!t._d){var c,u;for(c=t,u=new Date(i.now()),r=c._useUTC?[u.getUTCFullYear(),u.getUTCMonth(),u.getUTCDate()]:[u.getFullYear(),u.getMonth(),u.getDate()],t._w&&null==t._a[2]&&null==t._a[1]&&function(t){var e,n,r,i,a,o,s,c;if(null!=(e=t._w).GG||null!=e.W||null!=e.E)a=1,o=4,n=ae(e.GG,t._a[0],Pt(xe(),1,4).year),r=ae(e.W,1),((i=ae(e.E,1))<1||7<i)&&(c=!0);else{a=t._locale._week.dow,o=t._locale._week.doy;var u=Pt(xe(),a,o);n=ae(e.gg,t._a[0],u.year),r=ae(e.w,u.week),null!=e.d?((i=e.d)<0||6<i)&&(c=!0):null!=e.e?(i=e.e+a,(e.e<0||6<e.e)&&(c=!0)):i=a}r<1||r>It(n,a,o)?p(t)._overflowWeeks=!0:null!=c?p(t)._overflowWeekday=!0:(s=Lt(n,r,i,a,o),t._a[0]=s.year,t._dayOfYear=s.dayOfYear)}(t),null!=t._dayOfYear&&(o=ae(t._a[0],r[0]),(t._dayOfYear>yt(o)||0===t._dayOfYear)&&(p(t)._overflowDayOfYear=!0),n=Nt(o,0,t._dayOfYear),t._a[1]=n.getUTCMonth(),t._a[2]=n.getUTCDate()),e=0;e<3&&null==t._a[e];++e)t._a[e]=s[e]=r[e];for(;e<7;e++)t._a[e]=s[e]=null==t._a[e]?2===e?1:0:t._a[e];24===t._a[3]&&0===t._a[4]&&0===t._a[5]&&0===t._a[6]&&(t._nextDay=!0,t._a[3]=0),t._d=(t._useUTC?Nt:function(t,e,n,r,i,a,o){var s;return t<100&&0<=t?(s=new Date(t+400,e,n,r,i,a,o),isFinite(s.getFullYear())&&s.setFullYear(t)):s=new Date(t,e,n,r,i,a,o),s}).apply(null,s),a=t._useUTC?t._d.getUTCDay():t._d.getDay(),null!=t._tzm&&t._d.setUTCMinutes(t._d.getUTCMinutes()-t._tzm),t._nextDay&&(t._a[3]=24),t._w&&void 0!==t._w.d&&t._w.d!==a&&(p(t).weekdayMismatch=!0)}}var se=/^\s*((?:[+-]\d{6}|\d{4})-(?:\d\d-\d\d|W\d\d-\d|W\d\d|\d\d\d|\d\d))(?:(T| )(\d\d(?::\d\d(?::\d\d(?:[.,]\d+)?)?)?)([\+\-]\d\d(?::?\d\d)?|\s*Z)?)?$/,ce=/^\s*((?:[+-]\d{6}|\d{4})(?:\d\d\d\d|W\d\d\d|W\d\d|\d\d\d|\d\d))(?:(T| )(\d\d(?:\d\d(?:\d\d(?:[.,]\d+)?)?)?)([\+\-]\d\d(?::?\d\d)?|\s*Z)?)?$/,ue=/Z|[+-]\d\d(?::?\d\d)?/,le=[["YYYYYY-MM-DD",/[+-]\d{6}-\d\d-\d\d/],["YYYY-MM-DD",/\d{4}-\d\d-\d\d/],["GGGG-[W]WW-E",/\d{4}-W\d\d-\d/],["GGGG-[W]WW",/\d{4}-W\d\d/,!1],["YYYY-DDD",/\d{4}-\d{3}/],["YYYY-MM",/\d{4}-\d\d/,!1],["YYYYYYMMDD",/[+-]\d{10}/],["YYYYMMDD",/\d{8}/],["GGGG[W]WWE",/\d{4}W\d{3}/],["GGGG[W]WW",/\d{4}W\d{2}/,!1],["YYYYDDD",/\d{7}/]],he=[["HH:mm:ss.SSSS",/\d\d:\d\d:\d\d\.\d+/],["HH:mm:ss,SSSS",/\d\d:\d\d:\d\d,\d+/],["HH:mm:ss",/\d\d:\d\d:\d\d/],["HH:mm",/\d\d:\d\d/],["HHmmss.SSSS",/\d\d\d\d\d\d\.\d+/],["HHmmss,SSSS",/\d\d\d\d\d\d,\d+/],["HHmmss",/\d\d\d\d\d\d/],["HHmm",/\d\d\d\d/],["HH",/\d\d/]],fe=/^\/?Date\((\-?\d+)/i;function de(t){var e,n,r,i,a,o,s=t._i,c=se.exec(s)||ce.exec(s);if(c){for(p(t).iso=!0,e=0,n=le.length;e<n;e++)if(le[e][1].exec(c[1])){i=le[e][0],r=!1!==le[e][2];break}if(null==i)return void(t._isValid=!1);if(c[3]){for(e=0,n=he.length;e<n;e++)if(he[e][1].exec(c[3])){a=(c[2]||" ")+he[e][0];break}if(null==a)return void(t._isValid=!1)}if(!r&&null!=a)return void(t._isValid=!1);if(c[4]){if(!ue.exec(c[4]))return void(t._isValid=!1);o="Z"}t._f=i+(a||"")+(o||""),ve(t)}else t._isValid=!1}var pe=/^(?:(Mon|Tue|Wed|Thu|Fri|Sat|Sun),?\s)?(\d{1,2})\s(Jan|Feb|Mar|Apr|May|Jun|Jul|Aug|Sep|Oct|Nov|Dec)\s(\d{2,4})\s(\d\d):(\d\d)(?::(\d\d))?\s(?:(UT|GMT|[ECMP][SD]T)|([Zz])|([+-]\d{4}))$/,ge={UT:0,GMT:0,EDT:-240,EST:-300,CDT:-300,CST:-360,MDT:-360,MST:-420,PDT:-420,PST:-480};function ye(t){var e,n,r,i=pe.exec(t._i.replace(/\([^)]*\)|[\n\t]/g," ").replace(/(\s\s+)/g," ").replace(/^\s\s*/,"").replace(/\s\s*$/,""));if(i){var a=function(t,e,n,r,i,a){var o=[function(t){var e=parseInt(t,10);return e<=49?2e3+e:e<=999?1900+e:e}(t),Ct.indexOf(e),parseInt(n,10),parseInt(r,10),parseInt(i,10)];return a&&o.push(parseInt(a,10)),o}(i[4],i[3],i[2],i[5],i[6],i[7]);if(n=a,r=t,(e=i[1])&&Rt.indexOf(e)!==new Date(n[0],n[1],n[2]).getDay()&&(p(r).weekdayMismatch=!0,!(r._isValid=!1)))return;t._a=a,t._tzm=function(t,e,n){if(t)return ge[t];if(e)return 0;var r=parseInt(n,10),i=r%100;return(r-i)/100*60+i}(i[8],i[9],i[10]),t._d=Nt.apply(null,t._a),t._d.setUTCMinutes(t._d.getUTCMinutes()-t._tzm),p(t).rfc2822=!0}else t._isValid=!1}function ve(t){if(t._f!==i.ISO_8601)if(t._f!==i.RFC_2822){t._a=[],p(t).empty=!0;var e,n,r,a,o,s,c,u,l=""+t._i,f=l.length,d=0;for(r=V(t._f,t._locale).match(Y)||[],e=0;e<r.length;e++)a=r[e],(n=(l.match(ht(a,t))||[])[0])&&(0<(o=l.substr(0,l.indexOf(n))).length&&p(t).unusedInput.push(o),l=l.slice(l.indexOf(n)+n.length),d+=n.length),$[a]?(n?p(t).empty=!1:p(t).unusedTokens.push(a),s=a,u=t,null!=(c=n)&&h(dt,s)&&dt[s](c,u._a,u,s)):t._strict&&!n&&p(t).unusedTokens.push(a);p(t).charsLeftOver=f-d,0<l.length&&p(t).unusedInput.push(l),t._a[3]<=12&&!0===p(t).bigHour&&0<t._a[3]&&(p(t).bigHour=void 0),p(t).parsedDateParts=t._a.slice(0),p(t).meridiem=t._meridiem,t._a[3]=function(t,e,n){var r;return null==n?e:null!=t.meridiemHour?t.meridiemHour(e,n):(null!=t.isPM&&((r=t.isPM(n))&&e<12&&(e+=12),r||12!==e||(e=0)),e)}(t._locale,t._a[3],t._meridiem),oe(t),ie(t)}else ye(t);else de(t)}function me(t){var e,n,r,h,d=t._i,v=t._f;return t._locale=t._locale||re(t._l),null===d||void 0===v&&""===d?y({nullInput:!0}):("string"==typeof d&&(t._i=d=t._locale.preparse(d)),_(d)?new x(ie(d)):(u(d)?t._d=d:a(v)?function(t){var e,n,r,i,a;if(0===t._f.length)return p(t).invalidFormat=!0,t._d=new Date(NaN);for(i=0;i<t._f.length;i++)a=0,e=m({},t),null!=t._useUTC&&(e._useUTC=t._useUTC),e._f=t._f[i],ve(e),g(e)&&(a+=p(e).charsLeftOver,a+=10*p(e).unusedTokens.length,p(e).score=a,(null==r||a<r)&&(r=a,n=e));f(t,n||e)}(t):v?ve(t):s(n=(e=t)._i)?e._d=new Date(i.now()):u(n)?e._d=new Date(n.valueOf()):"string"==typeof n?(r=e,null===(h=fe.exec(r._i))?(de(r),!1===r._isValid&&(delete r._isValid,ye(r),!1===r._isValid&&(delete r._isValid,i.createFromInputFallback(r)))):r._d=new Date(+h[1])):a(n)?(e._a=l(n.slice(0),(function(t){return parseInt(t,10)})),oe(e)):o(n)?function(t){if(!t._d){var e=I(t._i);t._a=l([e.year,e.month,e.day||e.date,e.hour,e.minute,e.second,e.millisecond],(function(t){return t&&parseInt(t,10)})),oe(t)}}(e):c(n)?e._d=new Date(n):i.createFromInputFallback(e),g(t)||(t._d=null),t))}function be(t,e,n,r,i){var s,c={};return!0!==n&&!1!==n||(r=n,n=void 0),(o(t)&&function(t){if(Object.getOwnPropertyNames)return 0===Object.getOwnPropertyNames(t).length;var e;for(e in t)if(t.hasOwnProperty(e))return!1;return!0}(t)||a(t)&&0===t.length)&&(t=void 0),c._isAMomentObject=!0,c._useUTC=c._isUTC=i,c._l=n,c._i=t,c._f=e,c._strict=r,(s=new x(ie(me(c))))._nextDay&&(s.add(1,"d"),s._nextDay=void 0),s}function xe(t,e,n,r){return be(t,e,n,r,!1)}i.createFromInputFallback=C("value provided is not in a recognized RFC2822 or ISO format. moment construction falls back to js Date(), which is not reliable across all browsers and versions. Non RFC2822/ISO date formats are discouraged and will be removed in an upcoming major release. Please refer to http://momentjs.com/guides/#/warnings/js-date/ for more info.",(function(t){t._d=new Date(t._i+(t._useUTC?" UTC":""))})),i.ISO_8601=function(){},i.RFC_2822=function(){};var _e=C("moment().min is deprecated, use moment.max instead. http://momentjs.com/guides/#/warnings/min-max/",(function(){var t=xe.apply(null,arguments);return this.isValid()&&t.isValid()?t<this?this:t:y()})),ke=C("moment().max is deprecated, use moment.min instead. http://momentjs.com/guides/#/warnings/min-max/",(function(){var t=xe.apply(null,arguments);return this.isValid()&&t.isValid()?this<t?this:t:y()}));function we(t,e){var n,r;if(1===e.length&&a(e[0])&&(e=e[0]),!e.length)return xe();for(n=e[0],r=1;r<e.length;++r)e[r].isValid()&&!e[r][t](n)||(n=e[r]);return n}var Ee=["year","quarter","month","week","day","hour","minute","second","millisecond"];function Te(t){var e=I(t),n=e.year||0,r=e.quarter||0,i=e.month||0,a=e.week||e.isoWeek||0,o=e.day||0,s=e.hour||0,c=e.minute||0,u=e.second||0,l=e.millisecond||0;this._isValid=function(t){for(var e in t)if(-1===mt.call(Ee,e)||null!=t[e]&&isNaN(t[e]))return!1;for(var n=!1,r=0;r<Ee.length;++r)if(t[Ee[r]]){if(n)return!1;parseFloat(t[Ee[r]])!==w(t[Ee[r]])&&(n=!0)}return!0}(e),this._milliseconds=+l+1e3*u+6e4*c+1e3*s*60*60,this._days=+o+7*a,this._months=+i+3*r+12*n,this._data={},this._locale=re(),this._bubble()}function Ce(t){return t instanceof Te}function Ae(t){return t<0?-1*Math.round(-1*t):Math.round(t)}function Se(t,e){W(t,0,0,(function(){var t=this.utcOffset(),n="+";return t<0&&(t=-t,n="-"),n+R(~~(t/60),2)+e+R(~~t%60,2)}))}Se("Z",":"),Se("ZZ",""),lt("Z",st),lt("ZZ",st),pt(["Z","ZZ"],(function(t,e,n){n._useUTC=!0,n._tzm=Oe(st,t)}));var Me=/([\+\-]|\d\d)/gi;function Oe(t,e){var n=(e||"").match(t);if(null===n)return null;var r=((n[n.length-1]||[])+"").match(Me)||["-",0,0],i=60*r[1]+w(r[2]);return 0===i?0:"+"===r[0]?i:-i}function De(t,e){var n,r;return e._isUTC?(n=e.clone(),r=(_(t)||u(t)?t.valueOf():xe(t).valueOf())-n.valueOf(),n._d.setTime(n._d.valueOf()+r),i.updateOffset(n,!1),n):xe(t).local()}function Ne(t){return 15*-Math.round(t._d.getTimezoneOffset()/15)}function Be(){return!!this.isValid()&&this._isUTC&&0===this._offset}i.updateOffset=function(){};var Le=/^(\-|\+)?(?:(\d*)[. ])?(\d+)\:(\d+)(?:\:(\d+)(\.\d*)?)?$/,Pe=/^(-|\+)?P(?:([-+]?[0-9,.]*)Y)?(?:([-+]?[0-9,.]*)M)?(?:([-+]?[0-9,.]*)W)?(?:([-+]?[0-9,.]*)D)?(?:T(?:([-+]?[0-9,.]*)H)?(?:([-+]?[0-9,.]*)M)?(?:([-+]?[0-9,.]*)S)?)?$/;function Ie(t,e){var n,r,i,a=t,o=null;return Ce(t)?a={ms:t._milliseconds,d:t._days,M:t._months}:c(t)?(a={},e?a[e]=t:a.milliseconds=t):(o=Le.exec(t))?(n="-"===o[1]?-1:1,a={y:0,d:w(o[2])*n,h:w(o[3])*n,m:w(o[4])*n,s:w(o[5])*n,ms:w(Ae(1e3*o[6]))*n}):(o=Pe.exec(t))?(n="-"===o[1]?-1:1,a={y:Fe(o[2],n),M:Fe(o[3],n),w:Fe(o[4],n),d:Fe(o[5],n),h:Fe(o[6],n),m:Fe(o[7],n),s:Fe(o[8],n)}):null==a?a={}:"object"==typeof a&&("from"in a||"to"in a)&&(i=function(t,e){var n;return t.isValid()&&e.isValid()?(e=De(e,t),t.isBefore(e)?n=je(t,e):((n=je(e,t)).milliseconds=-n.milliseconds,n.months=-n.months),n):{milliseconds:0,months:0}}(xe(a.from),xe(a.to)),(a={}).ms=i.milliseconds,a.M=i.months),r=new Te(a),Ce(t)&&h(t,"_locale")&&(r._locale=t._locale),r}function Fe(t,e){var n=t&&parseFloat(t.replace(",","."));return(isNaN(n)?0:n)*e}function je(t,e){var n={};return n.months=e.month()-t.month()+12*(e.year()-t.year()),t.clone().add(n.months,"M").isAfter(e)&&--n.months,n.milliseconds=+e-+t.clone().add(n.months,"M"),n}function Re(t,e){return function(n,r){var i;return null===r||isNaN(+r)||(M(e,"moment()."+e+"(period, number) is deprecated. Please use moment()."+e+"(number, period). See http://momentjs.com/guides/#/warnings/add-inverted-param/ for more info."),i=n,n=r,r=i),Ye(this,Ie(n="string"==typeof n?+n:n,r),t),this}}function Ye(t,e,n,r){var a=e._milliseconds,o=Ae(e._days),s=Ae(e._months);t.isValid()&&(r=null==r||r,s&&At(t,_t(t,"Month")+s*n),o&&kt(t,"Date",_t(t,"Date")+o*n),a&&t._d.setTime(t._d.valueOf()+a*n),r&&i.updateOffset(t,o||s))}Ie.fn=Te.prototype,Ie.invalid=function(){return Ie(NaN)};var ze=Re(1,"add"),Ue=Re(-1,"subtract");function $e(t,e){var n=12*(e.year()-t.year())+(e.month()-t.month()),r=t.clone().add(n,"months");return-(n+(e-r<0?(e-r)/(r-t.clone().add(n-1,"months")):(e-r)/(t.clone().add(n+1,"months")-r)))||0}function We(t){var e;return void 0===t?this._locale._abbr:(null!=(e=re(t))&&(this._locale=e),this)}i.defaultFormat="YYYY-MM-DDTHH:mm:ssZ",i.defaultFormatUtc="YYYY-MM-DDTHH:mm:ss[Z]";var He=C("moment().lang() is deprecated. Instead, use moment().localeData() to get the language configuration. Use moment().locale() to change languages.",(function(t){return void 0===t?this.localeData():this.locale(t)}));function Ve(){return this._locale}var Ge=126227808e5;function qe(t,e){return(t%e+e)%e}function Xe(t,e,n){return t<100&&0<=t?new Date(t+400,e,n)-Ge:new Date(t,e,n).valueOf()}function Ze(t,e,n){return t<100&&0<=t?Date.UTC(t+400,e,n)-Ge:Date.UTC(t,e,n)}function Je(t,e){W(0,[t,t.length],0,e)}function Ke(t,e,n,r,i){var a;return null==t?Pt(this,r,i).year:((a=It(t,r,i))<e&&(e=a),function(t,e,n,r,i){var a=Lt(t,e,n,r,i),o=Nt(a.year,0,a.dayOfYear);return this.year(o.getUTCFullYear()),this.month(o.getUTCMonth()),this.date(o.getUTCDate()),this}.call(this,t,e,n,r,i))}W(0,["gg",2],0,(function(){return this.weekYear()%100})),W(0,["GG",2],0,(function(){return this.isoWeekYear()%100})),Je("gggg","weekYear"),Je("ggggg","weekYear"),Je("GGGG","isoWeekYear"),Je("GGGGG","isoWeekYear"),L("weekYear","gg"),L("isoWeekYear","GG"),j("weekYear",1),j("isoWeekYear",1),lt("G",at),lt("g",at),lt("GG",K,q),lt("gg",K,q),lt("GGGG",nt,Z),lt("gggg",nt,Z),lt("GGGGG",rt,J),lt("ggggg",rt,J),gt(["gggg","ggggg","GGGG","GGGGG"],(function(t,e,n,r){e[r.substr(0,2)]=w(t)})),gt(["gg","GG"],(function(t,e,n,r){e[r]=i.parseTwoDigitYear(t)})),W("Q",0,"Qo","quarter"),L("quarter","Q"),j("quarter",7),lt("Q",G),pt("Q",(function(t,e){e[1]=3*(w(t)-1)})),W("D",["DD",2],"Do","date"),L("date","D"),j("date",9),lt("D",K),lt("DD",K,q),lt("Do",(function(t,e){return t?e._dayOfMonthOrdinalParse||e._ordinalParse:e._dayOfMonthOrdinalParseLenient})),pt(["D","DD"],2),pt("Do",(function(t,e){e[2]=w(t.match(K)[0])}));var Qe=xt("Date",!0);W("DDD",["DDDD",3],"DDDo","dayOfYear"),L("dayOfYear","DDD"),j("dayOfYear",4),lt("DDD",et),lt("DDDD",X),pt(["DDD","DDDD"],(function(t,e,n){n._dayOfYear=w(t)})),W("m",["mm",2],0,"minute"),L("minute","m"),j("minute",14),lt("m",K),lt("mm",K,q),pt(["m","mm"],4);var tn=xt("Minutes",!1);W("s",["ss",2],0,"second"),L("second","s"),j("second",15),lt("s",K),lt("ss",K,q),pt(["s","ss"],5);var en,nn=xt("Seconds",!1);for(W("S",0,0,(function(){return~~(this.millisecond()/100)})),W(0,["SS",2],0,(function(){return~~(this.millisecond()/10)})),W(0,["SSS",3],0,"millisecond"),W(0,["SSSS",4],0,(function(){return 10*this.millisecond()})),W(0,["SSSSS",5],0,(function(){return 100*this.millisecond()})),W(0,["SSSSSS",6],0,(function(){return 1e3*this.millisecond()})),W(0,["SSSSSSS",7],0,(function(){return 1e4*this.millisecond()})),W(0,["SSSSSSSS",8],0,(function(){return 1e5*this.millisecond()})),W(0,["SSSSSSSSS",9],0,(function(){return 1e6*this.millisecond()})),L("millisecond","ms"),j("millisecond",16),lt("S",et,G),lt("SS",et,q),lt("SSS",et,X),en="SSSS";en.length<=9;en+="S")lt(en,it);function rn(t,e){e[6]=w(1e3*("0."+t))}for(en="S";en.length<=9;en+="S")pt(en,rn);var an=xt("Milliseconds",!1);W("z",0,0,"zoneAbbr"),W("zz",0,0,"zoneName");var on=x.prototype;function sn(t){return t}on.add=ze,on.calendar=function(t,e){var n=t||xe(),r=De(n,this).startOf("day"),a=i.calendarFormat(this,r)||"sameElse",o=e&&(O(e[a])?e[a].call(this,n):e[a]);return this.format(o||this.localeData().calendar(a,this,xe(n)))},on.clone=function(){return new x(this)},on.diff=function(t,e,n){var r,i,a;if(!this.isValid())return NaN;if(!(r=De(t,this)).isValid())return NaN;switch(i=6e4*(r.utcOffset()-this.utcOffset()),e=P(e)){case"year":a=$e(this,r)/12;break;case"month":a=$e(this,r);break;case"quarter":a=$e(this,r)/3;break;case"second":a=(this-r)/1e3;break;case"minute":a=(this-r)/6e4;break;case"hour":a=(this-r)/36e5;break;case"day":a=(this-r-i)/864e5;break;case"week":a=(this-r-i)/6048e5;break;default:a=this-r}return n?a:k(a)},on.endOf=function(t){var e;if(void 0===(t=P(t))||"millisecond"===t||!this.isValid())return this;var n=this._isUTC?Ze:Xe;switch(t){case"year":e=n(this.year()+1,0,1)-1;break;case"quarter":e=n(this.year(),this.month()-this.month()%3+3,1)-1;break;case"month":e=n(this.year(),this.month()+1,1)-1;break;case"week":e=n(this.year(),this.month(),this.date()-this.weekday()+7)-1;break;case"isoWeek":e=n(this.year(),this.month(),this.date()-(this.isoWeekday()-1)+7)-1;break;case"day":case"date":e=n(this.year(),this.month(),this.date()+1)-1;break;case"hour":e=this._d.valueOf(),e+=36e5-qe(e+(this._isUTC?0:6e4*this.utcOffset()),36e5)-1;break;case"minute":e=this._d.valueOf(),e+=6e4-qe(e,6e4)-1;break;case"second":e=this._d.valueOf(),e+=1e3-qe(e,1e3)-1}return this._d.setTime(e),i.updateOffset(this,!0),this},on.format=function(t){t||(t=this.isUtc()?i.defaultFormatUtc:i.defaultFormat);var e=H(this,t);return this.localeData().postformat(e)},on.from=function(t,e){return this.isValid()&&(_(t)&&t.isValid()||xe(t).isValid())?Ie({to:this,from:t}).locale(this.locale()).humanize(!e):this.localeData().invalidDate()},on.fromNow=function(t){return this.from(xe(),t)},on.to=function(t,e){return this.isValid()&&(_(t)&&t.isValid()||xe(t).isValid())?Ie({from:this,to:t}).locale(this.locale()).humanize(!e):this.localeData().invalidDate()},on.toNow=function(t){return this.to(xe(),t)},on.get=function(t){return O(this[t=P(t)])?this[t]():this},on.invalidAt=function(){return p(this).overflow},on.isAfter=function(t,e){var n=_(t)?t:xe(t);return!(!this.isValid()||!n.isValid())&&("millisecond"===(e=P(e)||"millisecond")?this.valueOf()>n.valueOf():n.valueOf()<this.clone().startOf(e).valueOf())},on.isBefore=function(t,e){var n=_(t)?t:xe(t);return!(!this.isValid()||!n.isValid())&&("millisecond"===(e=P(e)||"millisecond")?this.valueOf()<n.valueOf():this.clone().endOf(e).valueOf()<n.valueOf())},on.isBetween=function(t,e,n,r){var i=_(t)?t:xe(t),a=_(e)?e:xe(e);return!!(this.isValid()&&i.isValid()&&a.isValid())&&("("===(r=r||"()")[0]?this.isAfter(i,n):!this.isBefore(i,n))&&(")"===r[1]?this.isBefore(a,n):!this.isAfter(a,n))},on.isSame=function(t,e){var n,r=_(t)?t:xe(t);return!(!this.isValid()||!r.isValid())&&("millisecond"===(e=P(e)||"millisecond")?this.valueOf()===r.valueOf():(n=r.valueOf(),this.clone().startOf(e).valueOf()<=n&&n<=this.clone().endOf(e).valueOf()))},on.isSameOrAfter=function(t,e){return this.isSame(t,e)||this.isAfter(t,e)},on.isSameOrBefore=function(t,e){return this.isSame(t,e)||this.isBefore(t,e)},on.isValid=function(){return g(this)},on.lang=He,on.locale=We,on.localeData=Ve,on.max=ke,on.min=_e,on.parsingFlags=function(){return f({},p(this))},on.set=function(t,e){if("object"==typeof t)for(var n=function(t){var e=[];for(var n in t)e.push({unit:n,priority:F[n]});return e.sort((function(t,e){return t.priority-e.priority})),e}(t=I(t)),r=0;r<n.length;r++)this[n[r].unit](t[n[r].unit]);else if(O(this[t=P(t)]))return this[t](e);return this},on.startOf=function(t){var e;if(void 0===(t=P(t))||"millisecond"===t||!this.isValid())return this;var n=this._isUTC?Ze:Xe;switch(t){case"year":e=n(this.year(),0,1);break;case"quarter":e=n(this.year(),this.month()-this.month()%3,1);break;case"month":e=n(this.year(),this.month(),1);break;case"week":e=n(this.year(),this.month(),this.date()-this.weekday());break;case"isoWeek":e=n(this.year(),this.month(),this.date()-(this.isoWeekday()-1));break;case"day":case"date":e=n(this.year(),this.month(),this.date());break;case"hour":e=this._d.valueOf(),e-=qe(e+(this._isUTC?0:6e4*this.utcOffset()),36e5);break;case"minute":e=this._d.valueOf(),e-=qe(e,6e4);break;case"second":e=this._d.valueOf(),e-=qe(e,1e3)}return this._d.setTime(e),i.updateOffset(this,!0),this},on.subtract=Ue,on.toArray=function(){var t=this;return[t.year(),t.month(),t.date(),t.hour(),t.minute(),t.second(),t.millisecond()]},on.toObject=function(){var t=this;return{years:t.year(),months:t.month(),date:t.date(),hours:t.hours(),minutes:t.minutes(),seconds:t.seconds(),milliseconds:t.milliseconds()}},on.toDate=function(){return new Date(this.valueOf())},on.toISOString=function(t){if(!this.isValid())return null;var e=!0!==t,n=e?this.clone().utc():this;return n.year()<0||9999<n.year()?H(n,e?"YYYYYY-MM-DD[T]HH:mm:ss.SSS[Z]":"YYYYYY-MM-DD[T]HH:mm:ss.SSSZ"):O(Date.prototype.toISOString)?e?this.toDate().toISOString():new Date(this.valueOf()+60*this.utcOffset()*1e3).toISOString().replace("Z",H(n,"Z")):H(n,e?"YYYY-MM-DD[T]HH:mm:ss.SSS[Z]":"YYYY-MM-DD[T]HH:mm:ss.SSSZ")},on.inspect=function(){if(!this.isValid())return"moment.invalid(/* "+this._i+" */)";var t="moment",e="";this.isLocal()||(t=0===this.utcOffset()?"moment.utc":"moment.parseZone",e="Z");var n="["+t+'("]',r=0<=this.year()&&this.year()<=9999?"YYYY":"YYYYYY",i=e+'[")]';return this.format(n+r+"-MM-DD[T]HH:mm:ss.SSS"+i)},on.toJSON=function(){return this.isValid()?this.toISOString():null},on.toString=function(){return this.clone().locale("en").format("ddd MMM DD YYYY HH:mm:ss [GMT]ZZ")},on.unix=function(){return Math.floor(this.valueOf()/1e3)},on.valueOf=function(){return this._d.valueOf()-6e4*(this._offset||0)},on.creationData=function(){return{input:this._i,format:this._f,locale:this._locale,isUTC:this._isUTC,strict:this._strict}},on.year=bt,on.isLeapYear=function(){return vt(this.year())},on.weekYear=function(t){return Ke.call(this,t,this.week(),this.weekday(),this.localeData()._week.dow,this.localeData()._week.doy)},on.isoWeekYear=function(t){return Ke.call(this,t,this.isoWeek(),this.isoWeekday(),1,4)},on.quarter=on.quarters=function(t){return null==t?Math.ceil((this.month()+1)/3):this.month(3*(t-1)+this.month()%3)},on.month=St,on.daysInMonth=function(){return wt(this.year(),this.month())},on.week=on.weeks=function(t){var e=this.localeData().week(this);return null==t?e:this.add(7*(t-e),"d")},on.isoWeek=on.isoWeeks=function(t){var e=Pt(this,1,4).week;return null==t?e:this.add(7*(t-e),"d")},on.weeksInYear=function(){var t=this.localeData()._week;return It(this.year(),t.dow,t.doy)},on.isoWeeksInYear=function(){return It(this.year(),1,4)},on.date=Qe,on.day=on.days=function(t){if(!this.isValid())return null!=t?this:NaN;var e,n,r=this._isUTC?this._d.getUTCDay():this._d.getDay();return null!=t?(e=t,n=this.localeData(),t="string"!=typeof e?e:isNaN(e)?"number"==typeof(e=n.weekdaysParse(e))?e:null:parseInt(e,10),this.add(t-r,"d")):r},on.weekday=function(t){if(!this.isValid())return null!=t?this:NaN;var e=(this.day()+7-this.localeData()._week.dow)%7;return null==t?e:this.add(t-e,"d")},on.isoWeekday=function(t){if(!this.isValid())return null!=t?this:NaN;if(null==t)return this.day()||7;var e,n,r=(e=t,n=this.localeData(),"string"==typeof e?n.weekdaysParse(e)%7||7:isNaN(e)?null:e);return this.day(this.day()%7?r:r-7)},on.dayOfYear=function(t){var e=Math.round((this.clone().startOf("day")-this.clone().startOf("year"))/864e5)+1;return null==t?e:this.add(t-e,"d")},on.hour=on.hours=Xt,on.minute=on.minutes=tn,on.second=on.seconds=nn,on.millisecond=on.milliseconds=an,on.utcOffset=function(t,e,n){var r,a=this._offset||0;if(!this.isValid())return null!=t?this:NaN;if(null==t)return this._isUTC?a:Ne(this);if("string"==typeof t){if(null===(t=Oe(st,t)))return this}else Math.abs(t)<16&&!n&&(t*=60);return!this._isUTC&&e&&(r=Ne(this)),this._offset=t,this._isUTC=!0,null!=r&&this.add(r,"m"),a!==t&&(!e||this._changeInProgress?Ye(this,Ie(t-a,"m"),1,!1):this._changeInProgress||(this._changeInProgress=!0,i.updateOffset(this,!0),this._changeInProgress=null)),this},on.utc=function(t){return this.utcOffset(0,t)},on.local=function(t){return this._isUTC&&(this.utcOffset(0,t),this._isUTC=!1,t&&this.subtract(Ne(this),"m")),this},on.parseZone=function(){if(null!=this._tzm)this.utcOffset(this._tzm,!1,!0);else if("string"==typeof this._i){var t=Oe(ot,this._i);null!=t?this.utcOffset(t):this.utcOffset(0,!0)}return this},on.hasAlignedHourOffset=function(t){return!!this.isValid()&&(t=t?xe(t).utcOffset():0,(this.utcOffset()-t)%60==0)},on.isDST=function(){return this.utcOffset()>this.clone().month(0).utcOffset()||this.utcOffset()>this.clone().month(5).utcOffset()},on.isLocal=function(){return!!this.isValid()&&!this._isUTC},on.isUtcOffset=function(){return!!this.isValid()&&this._isUTC},on.isUtc=Be,on.isUTC=Be,on.zoneAbbr=function(){return this._isUTC?"UTC":""},on.zoneName=function(){return this._isUTC?"Coordinated Universal Time":""},on.dates=C("dates accessor is deprecated. Use date instead.",Qe),on.months=C("months accessor is deprecated. Use month instead",St),on.years=C("years accessor is deprecated. Use year instead",bt),on.zone=C("moment().zone is deprecated, use moment().utcOffset instead. http://momentjs.com/guides/#/warnings/zone/",(function(t,e){return null!=t?("string"!=typeof t&&(t=-t),this.utcOffset(t,e),this):-this.utcOffset()})),on.isDSTShifted=C("isDSTShifted is deprecated. See http://momentjs.com/guides/#/warnings/dst-shifted/ for more information",(function(){if(!s(this._isDSTShifted))return this._isDSTShifted;var t={};if(m(t,this),(t=me(t))._a){var e=t._isUTC?d(t._a):xe(t._a);this._isDSTShifted=this.isValid()&&0<E(t._a,e.toArray())}else this._isDSTShifted=!1;return this._isDSTShifted}));var cn=N.prototype;function un(t,e,n,r){var i=re(),a=d().set(r,e);return i[n](a,t)}function ln(t,e,n){if(c(t)&&(e=t,t=void 0),t=t||"",null!=e)return un(t,e,n,"month");var r,i=[];for(r=0;r<12;r++)i[r]=un(t,r,n,"month");return i}function hn(t,e,n,r){"boolean"==typeof t?c(e)&&(n=e,e=void 0):(e=t,t=!1,c(n=e)&&(n=e,e=void 0)),e=e||"";var i,a=re(),o=t?a._week.dow:0;if(null!=n)return un(e,(n+o)%7,r,"day");var s=[];for(i=0;i<7;i++)s[i]=un(e,(i+o)%7,r,"day");return s}cn.calendar=function(t,e,n){var r=this._calendar[t]||this._calendar.sameElse;return O(r)?r.call(e,n):r},cn.longDateFormat=function(t){var e=this._longDateFormat[t],n=this._longDateFormat[t.toUpperCase()];return e||!n?e:(this._longDateFormat[t]=n.replace(/MMMM|MM|DD|dddd/g,(function(t){return t.slice(1)})),this._longDateFormat[t])},cn.invalidDate=function(){return this._invalidDate},cn.ordinal=function(t){return this._ordinal.replace("%d",t)},cn.preparse=sn,cn.postformat=sn,cn.relativeTime=function(t,e,n,r){var i=this._relativeTime[n];return O(i)?i(t,e,n,r):i.replace(/%d/i,t)},cn.pastFuture=function(t,e){var n=this._relativeTime[0<t?"future":"past"];return O(n)?n(e):n.replace(/%s/i,e)},cn.set=function(t){var e,n;for(n in t)O(e=t[n])?this[n]=e:this["_"+n]=e;this._config=t,this._dayOfMonthOrdinalParseLenient=new RegExp((this._dayOfMonthOrdinalParse.source||this._ordinalParse.source)+"|"+/\d{1,2}/.source)},cn.months=function(t,e){return t?a(this._months)?this._months[t.month()]:this._months[(this._months.isFormat||Et).test(e)?"format":"standalone"][t.month()]:a(this._months)?this._months:this._months.standalone},cn.monthsShort=function(t,e){return t?a(this._monthsShort)?this._monthsShort[t.month()]:this._monthsShort[Et.test(e)?"format":"standalone"][t.month()]:a(this._monthsShort)?this._monthsShort:this._monthsShort.standalone},cn.monthsParse=function(t,e,n){var r,i,a;if(this._monthsParseExact)return function(t,e,n){var r,i,a,o=t.toLocaleLowerCase();if(!this._monthsParse)for(this._monthsParse=[],this._longMonthsParse=[],this._shortMonthsParse=[],r=0;r<12;++r)a=d([2e3,r]),this._shortMonthsParse[r]=this.monthsShort(a,"").toLocaleLowerCase(),this._longMonthsParse[r]=this.months(a,"").toLocaleLowerCase();return n?"MMM"===e?-1!==(i=mt.call(this._shortMonthsParse,o))?i:null:-1!==(i=mt.call(this._longMonthsParse,o))?i:null:"MMM"===e?-1!==(i=mt.call(this._shortMonthsParse,o))?i:-1!==(i=mt.call(this._longMonthsParse,o))?i:null:-1!==(i=mt.call(this._longMonthsParse,o))?i:-1!==(i=mt.call(this._shortMonthsParse,o))?i:null}.call(this,t,e,n);for(this._monthsParse||(this._monthsParse=[],this._longMonthsParse=[],this._shortMonthsParse=[]),r=0;r<12;r++){if(i=d([2e3,r]),n&&!this._longMonthsParse[r]&&(this._longMonthsParse[r]=new RegExp("^"+this.months(i,"").replace(".","")+"$","i"),this._shortMonthsParse[r]=new RegExp("^"+this.monthsShort(i,"").replace(".","")+"$","i")),n||this._monthsParse[r]||(a="^"+this.months(i,"")+"|^"+this.monthsShort(i,""),this._monthsParse[r]=new RegExp(a.replace(".",""),"i")),n&&"MMMM"===e&&this._longMonthsParse[r].test(t))return r;if(n&&"MMM"===e&&this._shortMonthsParse[r].test(t))return r;if(!n&&this._monthsParse[r].test(t))return r}},cn.monthsRegex=function(t){return this._monthsParseExact?(h(this,"_monthsRegex")||Dt.call(this),t?this._monthsStrictRegex:this._monthsRegex):(h(this,"_monthsRegex")||(this._monthsRegex=Ot),this._monthsStrictRegex&&t?this._monthsStrictRegex:this._monthsRegex)},cn.monthsShortRegex=function(t){return this._monthsParseExact?(h(this,"_monthsRegex")||Dt.call(this),t?this._monthsShortStrictRegex:this._monthsShortRegex):(h(this,"_monthsShortRegex")||(this._monthsShortRegex=Mt),this._monthsShortStrictRegex&&t?this._monthsShortStrictRegex:this._monthsShortRegex)},cn.week=function(t){return Pt(t,this._week.dow,this._week.doy).week},cn.firstDayOfYear=function(){return this._week.doy},cn.firstDayOfWeek=function(){return this._week.dow},cn.weekdays=function(t,e){var n=a(this._weekdays)?this._weekdays:this._weekdays[t&&!0!==t&&this._weekdays.isFormat.test(e)?"format":"standalone"];return!0===t?Ft(n,this._week.dow):t?n[t.day()]:n},cn.weekdaysMin=function(t){return!0===t?Ft(this._weekdaysMin,this._week.dow):t?this._weekdaysMin[t.day()]:this._weekdaysMin},cn.weekdaysShort=function(t){return!0===t?Ft(this._weekdaysShort,this._week.dow):t?this._weekdaysShort[t.day()]:this._weekdaysShort},cn.weekdaysParse=function(t,e,n){var r,i,a;if(this._weekdaysParseExact)return function(t,e,n){var r,i,a,o=t.toLocaleLowerCase();if(!this._weekdaysParse)for(this._weekdaysParse=[],this._shortWeekdaysParse=[],this._minWeekdaysParse=[],r=0;r<7;++r)a=d([2e3,1]).day(r),this._minWeekdaysParse[r]=this.weekdaysMin(a,"").toLocaleLowerCase(),this._shortWeekdaysParse[r]=this.weekdaysShort(a,"").toLocaleLowerCase(),this._weekdaysParse[r]=this.weekdays(a,"").toLocaleLowerCase();return n?"dddd"===e?-1!==(i=mt.call(this._weekdaysParse,o))?i:null:"ddd"===e?-1!==(i=mt.call(this._shortWeekdaysParse,o))?i:null:-1!==(i=mt.call(this._minWeekdaysParse,o))?i:null:"dddd"===e?-1!==(i=mt.call(this._weekdaysParse,o))?i:-1!==(i=mt.call(this._shortWeekdaysParse,o))?i:-1!==(i=mt.call(this._minWeekdaysParse,o))?i:null:"ddd"===e?-1!==(i=mt.call(this._shortWeekdaysParse,o))?i:-1!==(i=mt.call(this._weekdaysParse,o))?i:-1!==(i=mt.call(this._minWeekdaysParse,o))?i:null:-1!==(i=mt.call(this._minWeekdaysParse,o))?i:-1!==(i=mt.call(this._weekdaysParse,o))?i:-1!==(i=mt.call(this._shortWeekdaysParse,o))?i:null}.call(this,t,e,n);for(this._weekdaysParse||(this._weekdaysParse=[],this._minWeekdaysParse=[],this._shortWeekdaysParse=[],this._fullWeekdaysParse=[]),r=0;r<7;r++){if(i=d([2e3,1]).day(r),n&&!this._fullWeekdaysParse[r]&&(this._fullWeekdaysParse[r]=new RegExp("^"+this.weekdays(i,"").replace(".","\\.?")+"$","i"),this._shortWeekdaysParse[r]=new RegExp("^"+this.weekdaysShort(i,"").replace(".","\\.?")+"$","i"),this._minWeekdaysParse[r]=new RegExp("^"+this.weekdaysMin(i,"").replace(".","\\.?")+"$","i")),this._weekdaysParse[r]||(a="^"+this.weekdays(i,"")+"|^"+this.weekdaysShort(i,"")+"|^"+this.weekdaysMin(i,""),this._weekdaysParse[r]=new RegExp(a.replace(".",""),"i")),n&&"dddd"===e&&this._fullWeekdaysParse[r].test(t))return r;if(n&&"ddd"===e&&this._shortWeekdaysParse[r].test(t))return r;if(n&&"dd"===e&&this._minWeekdaysParse[r].test(t))return r;if(!n&&this._weekdaysParse[r].test(t))return r}},cn.weekdaysRegex=function(t){return this._weekdaysParseExact?(h(this,"_weekdaysRegex")||Wt.call(this),t?this._weekdaysStrictRegex:this._weekdaysRegex):(h(this,"_weekdaysRegex")||(this._weekdaysRegex=zt),this._weekdaysStrictRegex&&t?this._weekdaysStrictRegex:this._weekdaysRegex)},cn.weekdaysShortRegex=function(t){return this._weekdaysParseExact?(h(this,"_weekdaysRegex")||Wt.call(this),t?this._weekdaysShortStrictRegex:this._weekdaysShortRegex):(h(this,"_weekdaysShortRegex")||(this._weekdaysShortRegex=Ut),this._weekdaysShortStrictRegex&&t?this._weekdaysShortStrictRegex:this._weekdaysShortRegex)},cn.weekdaysMinRegex=function(t){return this._weekdaysParseExact?(h(this,"_weekdaysRegex")||Wt.call(this),t?this._weekdaysMinStrictRegex:this._weekdaysMinRegex):(h(this,"_weekdaysMinRegex")||(this._weekdaysMinRegex=$t),this._weekdaysMinStrictRegex&&t?this._weekdaysMinStrictRegex:this._weekdaysMinRegex)},cn.isPM=function(t){return"p"===(t+"").toLowerCase().charAt(0)},cn.meridiem=function(t,e,n){return 11<t?n?"pm":"PM":n?"am":"AM"},ee("en",{dayOfMonthOrdinalParse:/\d{1,2}(th|st|nd|rd)/,ordinal:function(t){var e=t%10;return t+(1===w(t%100/10)?"th":1===e?"st":2===e?"nd":3===e?"rd":"th")}}),i.lang=C("moment.lang is deprecated. Use moment.locale instead.",ee),i.langData=C("moment.langData is deprecated. Use moment.localeData instead.",re);var fn=Math.abs;function dn(t,e,n,r){var i=Ie(e,n);return t._milliseconds+=r*i._milliseconds,t._days+=r*i._days,t._months+=r*i._months,t._bubble()}function pn(t){return t<0?Math.floor(t):Math.ceil(t)}function gn(t){return 4800*t/146097}function yn(t){return 146097*t/4800}function vn(t){return function(){return this.as(t)}}var mn=vn("ms"),bn=vn("s"),xn=vn("m"),_n=vn("h"),kn=vn("d"),wn=vn("w"),En=vn("M"),Tn=vn("Q"),Cn=vn("y");function An(t){return function(){return this.isValid()?this._data[t]:NaN}}var Sn=An("milliseconds"),Mn=An("seconds"),On=An("minutes"),Dn=An("hours"),Nn=An("days"),Bn=An("months"),Ln=An("years"),Pn=Math.round,In={ss:44,s:45,m:45,h:22,d:26,M:11},Fn=Math.abs;function jn(t){return(0<t)-(t<0)||+t}function Rn(){if(!this.isValid())return this.localeData().invalidDate();var t,e,n=Fn(this._milliseconds)/1e3,r=Fn(this._days),i=Fn(this._months);e=k((t=k(n/60))/60),n%=60,t%=60;var a=k(i/12),o=i%=12,s=r,c=e,u=t,l=n?n.toFixed(3).replace(/\.?0+$/,""):"",h=this.asSeconds();if(!h)return"P0D";var f=h<0?"-":"",d=jn(this._months)!==jn(h)?"-":"",p=jn(this._days)!==jn(h)?"-":"",g=jn(this._milliseconds)!==jn(h)?"-":"";return f+"P"+(a?d+a+"Y":"")+(o?d+o+"M":"")+(s?p+s+"D":"")+(c||u||l?"T":"")+(c?g+c+"H":"")+(u?g+u+"M":"")+(l?g+l+"S":"")}var Yn=Te.prototype;return Yn.isValid=function(){return this._isValid},Yn.abs=function(){var t=this._data;return this._milliseconds=fn(this._milliseconds),this._days=fn(this._days),this._months=fn(this._months),t.milliseconds=fn(t.milliseconds),t.seconds=fn(t.seconds),t.minutes=fn(t.minutes),t.hours=fn(t.hours),t.months=fn(t.months),t.years=fn(t.years),this},Yn.add=function(t,e){return dn(this,t,e,1)},Yn.subtract=function(t,e){return dn(this,t,e,-1)},Yn.as=function(t){if(!this.isValid())return NaN;var e,n,r=this._milliseconds;if("month"===(t=P(t))||"quarter"===t||"year"===t)switch(e=this._days+r/864e5,n=this._months+gn(e),t){case"month":return n;case"quarter":return n/3;case"year":return n/12}else switch(e=this._days+Math.round(yn(this._months)),t){case"week":return e/7+r/6048e5;case"day":return e+r/864e5;case"hour":return 24*e+r/36e5;case"minute":return 1440*e+r/6e4;case"second":return 86400*e+r/1e3;case"millisecond":return Math.floor(864e5*e)+r;default:throw new Error("Unknown unit "+t)}},Yn.asMilliseconds=mn,Yn.asSeconds=bn,Yn.asMinutes=xn,Yn.asHours=_n,Yn.asDays=kn,Yn.asWeeks=wn,Yn.asMonths=En,Yn.asQuarters=Tn,Yn.asYears=Cn,Yn.valueOf=function(){return this.isValid()?this._milliseconds+864e5*this._days+this._months%12*2592e6+31536e6*w(this._months/12):NaN},Yn._bubble=function(){var t,e,n,r,i,a=this._milliseconds,o=this._days,s=this._months,c=this._data;return 0<=a&&0<=o&&0<=s||a<=0&&o<=0&&s<=0||(a+=864e5*pn(yn(s)+o),s=o=0),c.milliseconds=a%1e3,t=k(a/1e3),c.seconds=t%60,e=k(t/60),c.minutes=e%60,n=k(e/60),c.hours=n%24,s+=i=k(gn(o+=k(n/24))),o-=pn(yn(i)),r=k(s/12),s%=12,c.days=o,c.months=s,c.years=r,this},Yn.clone=function(){return Ie(this)},Yn.get=function(t){return t=P(t),this.isValid()?this[t+"s"]():NaN},Yn.milliseconds=Sn,Yn.seconds=Mn,Yn.minutes=On,Yn.hours=Dn,Yn.days=Nn,Yn.weeks=function(){return k(this.days()/7)},Yn.months=Bn,Yn.years=Ln,Yn.humanize=function(t){if(!this.isValid())return this.localeData().invalidDate();var e,n,r,i,a,o,s,c,u,l,h=this.localeData(),f=(e=!t,n=h,r=Ie(this).abs(),i=Pn(r.as("s")),a=Pn(r.as("m")),o=Pn(r.as("h")),s=Pn(r.as("d")),c=Pn(r.as("M")),u=Pn(r.as("y")),(l=i<=In.ss&&["s",i]||i<In.s&&["ss",i]||a<=1&&["m"]||a<In.m&&["mm",a]||o<=1&&["h"]||o<In.h&&["hh",o]||s<=1&&["d"]||s<In.d&&["dd",s]||c<=1&&["M"]||c<In.M&&["MM",c]||u<=1&&["y"]||["yy",u])[2]=e,l[3]=0<+this,l[4]=n,function(t,e,n,r,i){return i.relativeTime(e||1,!!n,t,r)}.apply(null,l));return t&&(f=h.pastFuture(+this,f)),h.postformat(f)},Yn.toISOString=Rn,Yn.toString=Rn,Yn.toJSON=Rn,Yn.locale=We,Yn.localeData=Ve,Yn.toIsoString=C("toIsoString() is deprecated. Please use toISOString() instead (notice the capitals)",Rn),Yn.lang=He,W("X",0,0,"unix"),W("x",0,0,"valueOf"),lt("x",at),lt("X",/[+-]?\d+(\.\d{1,3})?/),pt("X",(function(t,e,n){n._d=new Date(1e3*parseFloat(t,10))})),pt("x",(function(t,e,n){n._d=new Date(w(t))})),i.version="2.24.0",e=xe,i.fn=on,i.min=function(){return we("isBefore",[].slice.call(arguments,0))},i.max=function(){return we("isAfter",[].slice.call(arguments,0))},i.now=function(){return Date.now?Date.now():+new Date},i.utc=d,i.unix=function(t){return xe(1e3*t)},i.months=function(t,e){return ln(t,e,"months")},i.isDate=u,i.locale=ee,i.invalid=y,i.duration=Ie,i.isMoment=_,i.weekdays=function(t,e,n){return hn(t,e,n,"weekdays")},i.parseZone=function(){return xe.apply(null,arguments).parseZone()},i.localeData=re,i.isDuration=Ce,i.monthsShort=function(t,e){return ln(t,e,"monthsShort")},i.weekdaysMin=function(t,e,n){return hn(t,e,n,"weekdaysMin")},i.defineLocale=ne,i.updateLocale=function(t,e){if(null!=e){var n,r,i=Zt;null!=(r=te(t))&&(i=r._config),(n=new N(e=D(i,e))).parentLocale=Jt[t],Jt[t]=n,ee(t)}else null!=Jt[t]&&(null!=Jt[t].parentLocale?Jt[t]=Jt[t].parentLocale:null!=Jt[t]&&delete Jt[t]);return Jt[t]},i.locales=function(){return A(Jt)},i.weekdaysShort=function(t,e,n){return hn(t,e,n,"weekdaysShort")},i.normalizeUnits=P,i.relativeTimeRounding=function(t){return void 0===t?Pn:"function"==typeof t&&(Pn=t,!0)},i.relativeTimeThreshold=function(t,e){return void 0!==In[t]&&(void 0===e?In[t]:(In[t]=e,"s"===t&&(In.ss=e-1),!0))},i.calendarFormat=function(t,e){var n=t.diff(e,"days",!0);return n<-6?"sameElse":n<-1?"lastWeek":n<0?"lastDay":n<1?"sameDay":n<2?"nextDay":n<7?"nextWeek":"sameElse"},i.prototype=on,i.HTML5_FMT={DATETIME_LOCAL:"YYYY-MM-DDTHH:mm",DATETIME_LOCAL_SECONDS:"YYYY-MM-DDTHH:mm:ss",DATETIME_LOCAL_MS:"YYYY-MM-DDTHH:mm:ss.SSS",DATE:"YYYY-MM-DD",TIME:"HH:mm",TIME_SECONDS:"HH:mm:ss",TIME_MS:"HH:mm:ss.SSS",WEEK:"GGGG-[W]WW",MONTH:"YYYY-MM"},i}()}).call(this,n(7)(t))},function(t,e,n){var r=n(37),i=n(80);t.exports=function(t){return null!=t&&i(t.length)&&!r(t)}},function(t,e,n){var r=n(256),i=n(266),a=n(35),o=n(5),s=n(273);t.exports=function(t){return"function"==typeof t?t:null==t?a:"object"==typeof t?o(t)?i(t[0],t[1]):r(t):s(t)}},function(t,e,n){(function(t,r){var i=function(){var t=function(t,e,n,r){for(n=n||{},r=t.length;r--;n[t[r]]=e);return n},e=[1,9],n=[1,7],r=[1,6],i=[1,8],a=[1,20,21,22,23,38,46,75,76,77,78,79,80,94,95,98,99,100,102,103,109,110,111,112,113,114],o=[2,10],s=[1,20],c=[1,21],u=[1,22],l=[1,23],h=[1,30],f=[1,54],d=[1,32],p=[1,33],g=[1,34],y=[1,35],v=[1,36],m=[1,48],b=[1,43],x=[1,45],_=[1,40],k=[1,44],w=[1,47],E=[1,51],T=[1,52],C=[1,53],A=[1,42],S=[1,46],M=[1,49],O=[1,50],D=[1,41],N=[1,57],B=[1,62],L=[1,20,21,22,23,38,42,46,75,76,77,78,79,80,94,95,98,99,100,102,103,109,110,111,112,113,114],P=[1,66],I=[1,65],F=[1,67],j=[20,21,23,69,70],R=[1,88],Y=[1,93],z=[1,90],U=[1,95],$=[1,98],W=[1,96],H=[1,97],V=[1,91],G=[1,103],q=[1,102],X=[1,92],Z=[1,94],J=[1,99],K=[1,100],Q=[1,101],tt=[1,104],et=[20,21,22,23,69,70],nt=[20,21,22,23,47,69,70],rt=[20,21,22,23,40,46,47,49,51,53,55,57,59,61,62,64,69,70,80,94,95,98,99,100,102,103,109,110,111,112,113,114],it=[20,21,23],at=[20,21,23,46,69,70,80,94,95,98,99,100,102,103,109,110,111,112,113,114],ot=[1,12,20,21,22,23,24,38,42,46,75,76,77,78,79,80,94,95,98,99,100,102,103,109,110,111,112,113,114],st=[46,80,94,95,98,99,100,102,103,109,110,111,112,113,114],ct=[1,136],ut=[1,144],lt=[1,145],ht=[1,146],ft=[1,147],dt=[1,131],pt=[1,132],gt=[1,128],yt=[1,139],vt=[1,140],mt=[1,141],bt=[1,142],xt=[1,143],_t=[1,148],kt=[1,149],wt=[1,134],Et=[1,137],Tt=[1,133],Ct=[1,130],At=[20,21,22,23,38,42,46,75,76,77,78,79,80,94,95,98,99,100,102,103,109,110,111,112,113,114],St=[1,152],Mt=[20,21,22,23,26,46,80,94,95,98,99,100,102,103,109,110,111,112,113,114],Ot=[20,21,22,23,24,26,38,40,41,42,46,50,52,54,56,58,60,61,63,65,69,70,71,75,76,77,78,79,80,81,84,94,95,98,99,100,102,103,104,105,109,110,111,112,113,114],Dt=[12,21,22,24],Nt=[22,95],Bt=[1,233],Lt=[1,237],Pt=[1,234],It=[1,231],Ft=[1,228],jt=[1,229],Rt=[1,230],Yt=[1,232],zt=[1,235],Ut=[1,236],$t=[1,238],Wt=[1,255],Ht=[20,21,23,95],Vt=[20,21,22,23,75,91,94,95,98,99,100,101,102,103,104],Gt={trace:function(){},yy:{},symbols_:{error:2,start:3,mermaidDoc:4,directive:5,openDirective:6,typeDirective:7,closeDirective:8,separator:9,":":10,argDirective:11,open_directive:12,type_directive:13,arg_directive:14,close_directive:15,graphConfig:16,document:17,line:18,statement:19,SEMI:20,NEWLINE:21,SPACE:22,EOF:23,GRAPH:24,NODIR:25,DIR:26,FirstStmtSeperator:27,ending:28,endToken:29,spaceList:30,spaceListNewline:31,verticeStatement:32,styleStatement:33,linkStyleStatement:34,classDefStatement:35,classStatement:36,clickStatement:37,subgraph:38,text:39,SQS:40,SQE:41,end:42,link:43,node:44,vertex:45,AMP:46,STYLE_SEPARATOR:47,idString:48,PS:49,PE:50,"(-":51,"-)":52,STADIUMSTART:53,STADIUMEND:54,SUBROUTINESTART:55,SUBROUTINEEND:56,CYLINDERSTART:57,CYLINDEREND:58,DIAMOND_START:59,DIAMOND_STOP:60,TAGEND:61,TRAPSTART:62,TRAPEND:63,INVTRAPSTART:64,INVTRAPEND:65,linkStatement:66,arrowText:67,TESTSTR:68,START_LINK:69,LINK:70,PIPE:71,textToken:72,STR:73,keywords:74,STYLE:75,LINKSTYLE:76,CLASSDEF:77,CLASS:78,CLICK:79,DOWN:80,UP:81,textNoTags:82,textNoTagsToken:83,DEFAULT:84,stylesOpt:85,alphaNum:86,CALLBACKNAME:87,CALLBACKARGS:88,HREF:89,LINK_TARGET:90,HEX:91,numList:92,INTERPOLATE:93,NUM:94,COMMA:95,style:96,styleComponent:97,ALPHA:98,COLON:99,MINUS:100,UNIT:101,BRKT:102,DOT:103,PCT:104,TAGSTART:105,alphaNumToken:106,idStringToken:107,alphaNumStatement:108,PUNCTUATION:109,UNICODE_TEXT:110,PLUS:111,EQUALS:112,MULT:113,UNDERSCORE:114,graphCodeTokens:115,ARROW_CROSS:116,ARROW_POINT:117,ARROW_CIRCLE:118,ARROW_OPEN:119,QUOTE:120,$accept:0,$end:1},terminals_:{2:"error",10:":",12:"open_directive",13:"type_directive",14:"arg_directive",15:"close_directive",20:"SEMI",21:"NEWLINE",22:"SPACE",23:"EOF",24:"GRAPH",25:"NODIR",26:"DIR",38:"subgraph",40:"SQS",41:"SQE",42:"end",46:"AMP",47:"STYLE_SEPARATOR",49:"PS",50:"PE",51:"(-",52:"-)",53:"STADIUMSTART",54:"STADIUMEND",55:"SUBROUTINESTART",56:"SUBROUTINEEND",57:"CYLINDERSTART",58:"CYLINDEREND",59:"DIAMOND_START",60:"DIAMOND_STOP",61:"TAGEND",62:"TRAPSTART",63:"TRAPEND",64:"INVTRAPSTART",65:"INVTRAPEND",68:"TESTSTR",69:"START_LINK",70:"LINK",71:"PIPE",73:"STR",75:"STYLE",76:"LINKSTYLE",77:"CLASSDEF",78:"CLASS",79:"CLICK",80:"DOWN",81:"UP",84:"DEFAULT",87:"CALLBACKNAME",88:"CALLBACKARGS",89:"HREF",90:"LINK_TARGET",91:"HEX",93:"INTERPOLATE",94:"NUM",95:"COMMA",98:"ALPHA",99:"COLON",100:"MINUS",101:"UNIT",102:"BRKT",103:"DOT",104:"PCT",105:"TAGSTART",109:"PUNCTUATION",110:"UNICODE_TEXT",111:"PLUS",112:"EQUALS",113:"MULT",114:"UNDERSCORE",116:"ARROW_CROSS",117:"ARROW_POINT",118:"ARROW_CIRCLE",119:"ARROW_OPEN",120:"QUOTE"},productions_:[0,[3,1],[3,2],[5,4],[5,6],[6,1],[7,1],[11,1],[8,1],[4,2],[17,0],[17,2],[18,1],[18,1],[18,1],[18,1],[18,1],[16,2],[16,2],[16,2],[16,3],[28,2],[28,1],[29,1],[29,1],[29,1],[27,1],[27,1],[27,2],[31,2],[31,2],[31,1],[31,1],[30,2],[30,1],[19,2],[19,2],[19,2],[19,2],[19,2],[19,2],[19,9],[19,6],[19,4],[9,1],[9,1],[9,1],[32,3],[32,4],[32,2],[32,1],[44,1],[44,5],[44,3],[45,4],[45,6],[45,4],[45,4],[45,4],[45,4],[45,4],[45,4],[45,6],[45,4],[45,4],[45,4],[45,4],[45,4],[45,1],[43,2],[43,3],[43,3],[43,1],[43,3],[66,1],[67,3],[39,1],[39,2],[39,1],[74,1],[74,1],[74,1],[74,1],[74,1],[74,1],[74,1],[74,1],[74,1],[74,1],[74,1],[82,1],[82,2],[35,5],[35,5],[36,5],[37,2],[37,4],[37,3],[37,5],[37,2],[37,4],[37,4],[37,6],[37,2],[37,4],[37,2],[37,4],[37,4],[37,6],[33,5],[33,5],[34,5],[34,5],[34,9],[34,9],[34,7],[34,7],[92,1],[92,3],[85,1],[85,3],[96,1],[96,2],[97,1],[97,1],[97,1],[97,1],[97,1],[97,1],[97,1],[97,1],[97,1],[97,1],[97,1],[72,1],[72,1],[72,1],[72,1],[72,1],[72,1],[83,1],[83,1],[83,1],[83,1],[48,1],[48,2],[86,1],[86,2],[108,1],[108,1],[108,1],[108,1],[106,1],[106,1],[106,1],[106,1],[106,1],[106,1],[106,1],[106,1],[106,1],[106,1],[106,1],[106,1],[106,1],[107,1],[107,1],[107,1],[107,1],[107,1],[107,1],[107,1],[107,1],[107,1],[107,1],[107,1],[107,1],[107,1],[107,1],[107,1],[115,1],[115,1],[115,1],[115,1],[115,1],[115,1],[115,1],[115,1],[115,1],[115,1],[115,1],[115,1],[115,1],[115,1],[115,1],[115,1],[115,1],[115,1],[115,1],[115,1],[115,1],[115,1],[115,1],[115,1],[115,1]],performAction:function(t,e,n,r,i,a,o){var s=a.length-1;switch(i){case 5:r.parseDirective("%%{","open_directive");break;case 6:r.parseDirective(a[s],"type_directive");break;case 7:a[s]=a[s].trim().replace(/'/g,'"'),r.parseDirective(a[s],"arg_directive");break;case 8:r.parseDirective("}%%","close_directive","flowchart");break;case 10:this.$=[];break;case 11:a[s]!==[]&&a[s-1].push(a[s]),this.$=a[s-1];break;case 12:case 76:case 78:case 90:case 146:case 148:case 149:this.$=a[s];break;case 19:r.setDirection("TB"),this.$="TB";break;case 20:r.setDirection(a[s-1]),this.$=a[s-1];break;case 35:this.$=a[s-1].nodes;break;case 36:case 37:case 38:case 39:case 40:this.$=[];break;case 41:this.$=r.addSubGraph(a[s-6],a[s-1],a[s-4]);break;case 42:this.$=r.addSubGraph(a[s-3],a[s-1],a[s-3]);break;case 43:this.$=r.addSubGraph(void 0,a[s-1],void 0);break;case 47:r.addLink(a[s-2].stmt,a[s],a[s-1]),this.$={stmt:a[s],nodes:a[s].concat(a[s-2].nodes)};break;case 48:r.addLink(a[s-3].stmt,a[s-1],a[s-2]),this.$={stmt:a[s-1],nodes:a[s-1].concat(a[s-3].nodes)};break;case 49:this.$={stmt:a[s-1],nodes:a[s-1]};break;case 50:this.$={stmt:a[s],nodes:a[s]};break;case 51:this.$=[a[s]];break;case 52:this.$=a[s-4].concat(a[s]);break;case 53:this.$=[a[s-2]],r.setClass(a[s-2],a[s]);break;case 54:this.$=a[s-3],r.addVertex(a[s-3],a[s-1],"square");break;case 55:this.$=a[s-5],r.addVertex(a[s-5],a[s-2],"circle");break;case 56:this.$=a[s-3],r.addVertex(a[s-3],a[s-1],"ellipse");break;case 57:this.$=a[s-3],r.addVertex(a[s-3],a[s-1],"stadium");break;case 58:this.$=a[s-3],r.addVertex(a[s-3],a[s-1],"subroutine");break;case 59:this.$=a[s-3],r.addVertex(a[s-3],a[s-1],"cylinder");break;case 60:this.$=a[s-3],r.addVertex(a[s-3],a[s-1],"round");break;case 61:this.$=a[s-3],r.addVertex(a[s-3],a[s-1],"diamond");break;case 62:this.$=a[s-5],r.addVertex(a[s-5],a[s-2],"hexagon");break;case 63:this.$=a[s-3],r.addVertex(a[s-3],a[s-1],"odd");break;case 64:this.$=a[s-3],r.addVertex(a[s-3],a[s-1],"trapezoid");break;case 65:this.$=a[s-3],r.addVertex(a[s-3],a[s-1],"inv_trapezoid");break;case 66:this.$=a[s-3],r.addVertex(a[s-3],a[s-1],"lean_right");break;case 67:this.$=a[s-3],r.addVertex(a[s-3],a[s-1],"lean_left");break;case 68:this.$=a[s],r.addVertex(a[s]);break;case 69:a[s-1].text=a[s],this.$=a[s-1];break;case 70:case 71:a[s-2].text=a[s-1],this.$=a[s-2];break;case 72:this.$=a[s];break;case 73:var c=r.destructLink(a[s],a[s-2]);this.$={type:c.type,stroke:c.stroke,length:c.length,text:a[s-1]};break;case 74:c=r.destructLink(a[s]);this.$={type:c.type,stroke:c.stroke,length:c.length};break;case 75:this.$=a[s-1];break;case 77:case 91:case 147:this.$=a[s-1]+""+a[s];break;case 92:case 93:this.$=a[s-4],r.addClass(a[s-2],a[s]);break;case 94:this.$=a[s-4],r.setClass(a[s-2],a[s]);break;case 95:case 103:this.$=a[s-1],r.setClickEvent(a[s-1],a[s]);break;case 96:case 104:this.$=a[s-3],r.setClickEvent(a[s-3],a[s-2]),r.setTooltip(a[s-3],a[s]);break;case 97:this.$=a[s-2],r.setClickEvent(a[s-2],a[s-1],a[s]);break;case 98:this.$=a[s-4],r.setClickEvent(a[s-4],a[s-3],a[s-2]),r.setTooltip(a[s-4],a[s]);break;case 99:case 105:this.$=a[s-1],r.setLink(a[s-1],a[s]);break;case 100:case 106:this.$=a[s-3],r.setLink(a[s-3],a[s-2]),r.setTooltip(a[s-3],a[s]);break;case 101:case 107:this.$=a[s-3],r.setLink(a[s-3],a[s-2],a[s]);break;case 102:case 108:this.$=a[s-5],r.setLink(a[s-5],a[s-4],a[s]),r.setTooltip(a[s-5],a[s-2]);break;case 109:this.$=a[s-4],r.addVertex(a[s-2],void 0,void 0,a[s]);break;case 110:case 112:this.$=a[s-4],r.updateLink(a[s-2],a[s]);break;case 111:this.$=a[s-4],r.updateLink([a[s-2]],a[s]);break;case 113:this.$=a[s-8],r.updateLinkInterpolate([a[s-6]],a[s-2]),r.updateLink([a[s-6]],a[s]);break;case 114:this.$=a[s-8],r.updateLinkInterpolate(a[s-6],a[s-2]),r.updateLink(a[s-6],a[s]);break;case 115:this.$=a[s-6],r.updateLinkInterpolate([a[s-4]],a[s]);break;case 116:this.$=a[s-6],r.updateLinkInterpolate(a[s-4],a[s]);break;case 117:case 119:this.$=[a[s]];break;case 118:case 120:a[s-2].push(a[s]),this.$=a[s-2];break;case 122:this.$=a[s-1]+a[s];break;case 144:this.$=a[s];break;case 145:this.$=a[s-1]+""+a[s];break;case 150:this.$="v";break;case 151:this.$="-"}},table:[{3:1,4:2,5:3,6:5,12:e,16:4,21:n,22:r,24:i},{1:[3]},{1:[2,1]},{3:10,4:2,5:3,6:5,12:e,16:4,21:n,22:r,24:i},t(a,o,{17:11}),{7:12,13:[1,13]},{16:14,21:n,22:r,24:i},{16:15,21:n,22:r,24:i},{25:[1,16],26:[1,17]},{13:[2,5]},{1:[2,2]},{1:[2,9],18:18,19:19,20:s,21:c,22:u,23:l,32:24,33:25,34:26,35:27,36:28,37:29,38:h,44:31,45:37,46:f,48:38,75:d,76:p,77:g,78:y,79:v,80:m,94:b,95:x,98:_,99:k,100:w,102:E,103:T,107:39,109:C,110:A,111:S,112:M,113:O,114:D},{8:55,10:[1,56],15:N},t([10,15],[2,6]),t(a,[2,17]),t(a,[2,18]),t(a,[2,19]),{20:[1,59],21:[1,60],22:B,27:58,30:61},t(L,[2,11]),t(L,[2,12]),t(L,[2,13]),t(L,[2,14]),t(L,[2,15]),t(L,[2,16]),{9:63,20:P,21:I,23:F,43:64,66:68,69:[1,69],70:[1,70]},{9:71,20:P,21:I,23:F},{9:72,20:P,21:I,23:F},{9:73,20:P,21:I,23:F},{9:74,20:P,21:I,23:F},{9:75,20:P,21:I,23:F},{9:77,20:P,21:I,22:[1,76],23:F},t(j,[2,50],{30:78,22:B}),{22:[1,79]},{22:[1,80]},{22:[1,81]},{22:[1,82]},{26:R,46:Y,73:[1,86],80:z,86:85,87:[1,83],89:[1,84],94:U,95:$,98:W,99:H,100:V,102:G,103:q,106:89,108:87,109:X,110:Z,111:J,112:K,113:Q,114:tt},t(et,[2,51],{47:[1,105]}),t(nt,[2,68],{107:116,40:[1,106],46:f,49:[1,107],51:[1,108],53:[1,109],55:[1,110],57:[1,111],59:[1,112],61:[1,113],62:[1,114],64:[1,115],80:m,94:b,95:x,98:_,99:k,100:w,102:E,103:T,109:C,110:A,111:S,112:M,113:O,114:D}),t(rt,[2,144]),t(rt,[2,165]),t(rt,[2,166]),t(rt,[2,167]),t(rt,[2,168]),t(rt,[2,169]),t(rt,[2,170]),t(rt,[2,171]),t(rt,[2,172]),t(rt,[2,173]),t(rt,[2,174]),t(rt,[2,175]),t(rt,[2,176]),t(rt,[2,177]),t(rt,[2,178]),t(rt,[2,179]),{9:117,20:P,21:I,23:F},{11:118,14:[1,119]},t(it,[2,8]),t(a,[2,20]),t(a,[2,26]),t(a,[2,27]),{21:[1,120]},t(at,[2,34],{30:121,22:B}),t(L,[2,35]),{44:122,45:37,46:f,48:38,80:m,94:b,95:x,98:_,99:k,100:w,102:E,103:T,107:39,109:C,110:A,111:S,112:M,113:O,114:D},t(ot,[2,44]),t(ot,[2,45]),t(ot,[2,46]),t(st,[2,72],{67:123,68:[1,124],71:[1,125]}),{22:ct,24:ut,26:lt,38:ht,39:126,42:ft,46:Y,61:dt,69:pt,72:127,73:gt,74:138,75:yt,76:vt,77:mt,78:bt,79:xt,80:_t,81:kt,83:129,84:wt,94:U,95:$,98:W,99:H,100:Et,102:G,103:q,104:Tt,105:Ct,106:135,109:X,110:Z,111:J,112:K,113:Q,114:tt},t([46,68,71,80,94,95,98,99,100,102,103,109,110,111,112,113,114],[2,74]),t(L,[2,36]),t(L,[2,37]),t(L,[2,38]),t(L,[2,39]),t(L,[2,40]),{22:ct,24:ut,26:lt,38:ht,39:150,42:ft,46:Y,61:dt,69:pt,72:127,73:gt,74:138,75:yt,76:vt,77:mt,78:bt,79:xt,80:_t,81:kt,83:129,84:wt,94:U,95:$,98:W,99:H,100:Et,102:G,103:q,104:Tt,105:Ct,106:135,109:X,110:Z,111:J,112:K,113:Q,114:tt},t(At,o,{17:151}),t(j,[2,49],{46:St}),{26:R,46:Y,80:z,86:153,91:[1,154],94:U,95:$,98:W,99:H,100:V,102:G,103:q,106:89,108:87,109:X,110:Z,111:J,112:K,113:Q,114:tt},{84:[1,155],92:156,94:[1,157]},{26:R,46:Y,80:z,84:[1,158],86:159,94:U,95:$,98:W,99:H,100:V,102:G,103:q,106:89,108:87,109:X,110:Z,111:J,112:K,113:Q,114:tt},{26:R,46:Y,80:z,86:160,94:U,95:$,98:W,99:H,100:V,102:G,103:q,106:89,108:87,109:X,110:Z,111:J,112:K,113:Q,114:tt},t(it,[2,95],{22:[1,161],88:[1,162]}),t(it,[2,99],{22:[1,163]}),t(it,[2,103],{106:89,108:165,22:[1,164],26:R,46:Y,80:z,94:U,95:$,98:W,99:H,100:V,102:G,103:q,109:X,110:Z,111:J,112:K,113:Q,114:tt}),t(it,[2,105],{22:[1,166]}),t(Mt,[2,146]),t(Mt,[2,148]),t(Mt,[2,149]),t(Mt,[2,150]),t(Mt,[2,151]),t(Ot,[2,152]),t(Ot,[2,153]),t(Ot,[2,154]),t(Ot,[2,155]),t(Ot,[2,156]),t(Ot,[2,157]),t(Ot,[2,158]),t(Ot,[2,159]),t(Ot,[2,160]),t(Ot,[2,161]),t(Ot,[2,162]),t(Ot,[2,163]),t(Ot,[2,164]),{46:f,48:167,80:m,94:b,95:x,98:_,99:k,100:w,102:E,103:T,107:39,109:C,110:A,111:S,112:M,113:O,114:D},{22:ct,24:ut,26:lt,38:ht,39:168,42:ft,46:Y,61:dt,69:pt,72:127,73:gt,74:138,75:yt,76:vt,77:mt,78:bt,79:xt,80:_t,81:kt,83:129,84:wt,94:U,95:$,98:W,99:H,100:Et,102:G,103:q,104:Tt,105:Ct,106:135,109:X,110:Z,111:J,112:K,113:Q,114:tt},{22:ct,24:ut,26:lt,38:ht,39:170,42:ft,46:Y,49:[1,169],61:dt,69:pt,72:127,73:gt,74:138,75:yt,76:vt,77:mt,78:bt,79:xt,80:_t,81:kt,83:129,84:wt,94:U,95:$,98:W,99:H,100:Et,102:G,103:q,104:Tt,105:Ct,106:135,109:X,110:Z,111:J,112:K,113:Q,114:tt},{22:ct,24:ut,26:lt,38:ht,39:171,42:ft,46:Y,61:dt,69:pt,72:127,73:gt,74:138,75:yt,76:vt,77:mt,78:bt,79:xt,80:_t,81:kt,83:129,84:wt,94:U,95:$,98:W,99:H,100:Et,102:G,103:q,104:Tt,105:Ct,106:135,109:X,110:Z,111:J,112:K,113:Q,114:tt},{22:ct,24:ut,26:lt,38:ht,39:172,42:ft,46:Y,61:dt,69:pt,72:127,73:gt,74:138,75:yt,76:vt,77:mt,78:bt,79:xt,80:_t,81:kt,83:129,84:wt,94:U,95:$,98:W,99:H,100:Et,102:G,103:q,104:Tt,105:Ct,106:135,109:X,110:Z,111:J,112:K,113:Q,114:tt},{22:ct,24:ut,26:lt,38:ht,39:173,42:ft,46:Y,61:dt,69:pt,72:127,73:gt,74:138,75:yt,76:vt,77:mt,78:bt,79:xt,80:_t,81:kt,83:129,84:wt,94:U,95:$,98:W,99:H,100:Et,102:G,103:q,104:Tt,105:Ct,106:135,109:X,110:Z,111:J,112:K,113:Q,114:tt},{22:ct,24:ut,26:lt,38:ht,39:174,42:ft,46:Y,61:dt,69:pt,72:127,73:gt,74:138,75:yt,76:vt,77:mt,78:bt,79:xt,80:_t,81:kt,83:129,84:wt,94:U,95:$,98:W,99:H,100:Et,102:G,103:q,104:Tt,105:Ct,106:135,109:X,110:Z,111:J,112:K,113:Q,114:tt},{22:ct,24:ut,26:lt,38:ht,39:175,42:ft,46:Y,59:[1,176],61:dt,69:pt,72:127,73:gt,74:138,75:yt,76:vt,77:mt,78:bt,79:xt,80:_t,81:kt,83:129,84:wt,94:U,95:$,98:W,99:H,100:Et,102:G,103:q,104:Tt,105:Ct,106:135,109:X,110:Z,111:J,112:K,113:Q,114:tt},{22:ct,24:ut,26:lt,38:ht,39:177,42:ft,46:Y,61:dt,69:pt,72:127,73:gt,74:138,75:yt,76:vt,77:mt,78:bt,79:xt,80:_t,81:kt,83:129,84:wt,94:U,95:$,98:W,99:H,100:Et,102:G,103:q,104:Tt,105:Ct,106:135,109:X,110:Z,111:J,112:K,113:Q,114:tt},{22:ct,24:ut,26:lt,38:ht,39:178,42:ft,46:Y,61:dt,69:pt,72:127,73:gt,74:138,75:yt,76:vt,77:mt,78:bt,79:xt,80:_t,81:kt,83:129,84:wt,94:U,95:$,98:W,99:H,100:Et,102:G,103:q,104:Tt,105:Ct,106:135,109:X,110:Z,111:J,112:K,113:Q,114:tt},{22:ct,24:ut,26:lt,38:ht,39:179,42:ft,46:Y,61:dt,69:pt,72:127,73:gt,74:138,75:yt,76:vt,77:mt,78:bt,79:xt,80:_t,81:kt,83:129,84:wt,94:U,95:$,98:W,99:H,100:Et,102:G,103:q,104:Tt,105:Ct,106:135,109:X,110:Z,111:J,112:K,113:Q,114:tt},t(rt,[2,145]),t(Dt,[2,3]),{8:180,15:N},{15:[2,7]},t(a,[2,28]),t(at,[2,33]),t(j,[2,47],{30:181,22:B}),t(st,[2,69],{22:[1,182]}),{22:[1,183]},{22:ct,24:ut,26:lt,38:ht,39:184,42:ft,46:Y,61:dt,69:pt,72:127,73:gt,74:138,75:yt,76:vt,77:mt,78:bt,79:xt,80:_t,81:kt,83:129,84:wt,94:U,95:$,98:W,99:H,100:Et,102:G,103:q,104:Tt,105:Ct,106:135,109:X,110:Z,111:J,112:K,113:Q,114:tt},{22:ct,24:ut,26:lt,38:ht,42:ft,46:Y,61:dt,69:pt,70:[1,185],72:186,74:138,75:yt,76:vt,77:mt,78:bt,79:xt,80:_t,81:kt,83:129,84:wt,94:U,95:$,98:W,99:H,100:Et,102:G,103:q,104:Tt,105:Ct,106:135,109:X,110:Z,111:J,112:K,113:Q,114:tt},t(Ot,[2,76]),t(Ot,[2,78]),t(Ot,[2,134]),t(Ot,[2,135]),t(Ot,[2,136]),t(Ot,[2,137]),t(Ot,[2,138]),t(Ot,[2,139]),t(Ot,[2,140]),t(Ot,[2,141]),t(Ot,[2,142]),t(Ot,[2,143]),t(Ot,[2,79]),t(Ot,[2,80]),t(Ot,[2,81]),t(Ot,[2,82]),t(Ot,[2,83]),t(Ot,[2,84]),t(Ot,[2,85]),t(Ot,[2,86]),t(Ot,[2,87]),t(Ot,[2,88]),t(Ot,[2,89]),{9:188,20:P,21:I,22:ct,23:F,24:ut,26:lt,38:ht,40:[1,187],42:ft,46:Y,61:dt,69:pt,72:186,74:138,75:yt,76:vt,77:mt,78:bt,79:xt,80:_t,81:kt,83:129,84:wt,94:U,95:$,98:W,99:H,100:Et,102:G,103:q,104:Tt,105:Ct,106:135,109:X,110:Z,111:J,112:K,113:Q,114:tt},{18:18,19:19,20:s,21:c,22:u,23:l,32:24,33:25,34:26,35:27,36:28,37:29,38:h,42:[1,189],44:31,45:37,46:f,48:38,75:d,76:p,77:g,78:y,79:v,80:m,94:b,95:x,98:_,99:k,100:w,102:E,103:T,107:39,109:C,110:A,111:S,112:M,113:O,114:D},{22:B,30:190},{22:[1,191],26:R,46:Y,80:z,94:U,95:$,98:W,99:H,100:V,102:G,103:q,106:89,108:165,109:X,110:Z,111:J,112:K,113:Q,114:tt},{22:[1,192]},{22:[1,193]},{22:[1,194],95:[1,195]},t(Nt,[2,117]),{22:[1,196]},{22:[1,197],26:R,46:Y,80:z,94:U,95:$,98:W,99:H,100:V,102:G,103:q,106:89,108:165,109:X,110:Z,111:J,112:K,113:Q,114:tt},{22:[1,198],26:R,46:Y,80:z,94:U,95:$,98:W,99:H,100:V,102:G,103:q,106:89,108:165,109:X,110:Z,111:J,112:K,113:Q,114:tt},{73:[1,199]},t(it,[2,97],{22:[1,200]}),{73:[1,201],90:[1,202]},{73:[1,203]},t(Mt,[2,147]),{73:[1,204],90:[1,205]},t(et,[2,53],{107:116,46:f,80:m,94:b,95:x,98:_,99:k,100:w,102:E,103:T,109:C,110:A,111:S,112:M,113:O,114:D}),{22:ct,24:ut,26:lt,38:ht,41:[1,206],42:ft,46:Y,61:dt,69:pt,72:186,74:138,75:yt,76:vt,77:mt,78:bt,79:xt,80:_t,81:kt,83:129,84:wt,94:U,95:$,98:W,99:H,100:Et,102:G,103:q,104:Tt,105:Ct,106:135,109:X,110:Z,111:J,112:K,113:Q,114:tt},{22:ct,24:ut,26:lt,38:ht,39:207,42:ft,46:Y,61:dt,69:pt,72:127,73:gt,74:138,75:yt,76:vt,77:mt,78:bt,79:xt,80:_t,81:kt,83:129,84:wt,94:U,95:$,98:W,99:H,100:Et,102:G,103:q,104:Tt,105:Ct,106:135,109:X,110:Z,111:J,112:K,113:Q,114:tt},{22:ct,24:ut,26:lt,38:ht,42:ft,46:Y,50:[1,208],61:dt,69:pt,72:186,74:138,75:yt,76:vt,77:mt,78:bt,79:xt,80:_t,81:kt,83:129,84:wt,94:U,95:$,98:W,99:H,100:Et,102:G,103:q,104:Tt,105:Ct,106:135,109:X,110:Z,111:J,112:K,113:Q,114:tt},{22:ct,24:ut,26:lt,38:ht,42:ft,46:Y,52:[1,209],61:dt,69:pt,72:186,74:138,75:yt,76:vt,77:mt,78:bt,79:xt,80:_t,81:kt,83:129,84:wt,94:U,95:$,98:W,99:H,100:Et,102:G,103:q,104:Tt,105:Ct,106:135,109:X,110:Z,111:J,112:K,113:Q,114:tt},{22:ct,24:ut,26:lt,38:ht,42:ft,46:Y,54:[1,210],61:dt,69:pt,72:186,74:138,75:yt,76:vt,77:mt,78:bt,79:xt,80:_t,81:kt,83:129,84:wt,94:U,95:$,98:W,99:H,100:Et,102:G,103:q,104:Tt,105:Ct,106:135,109:X,110:Z,111:J,112:K,113:Q,114:tt},{22:ct,24:ut,26:lt,38:ht,42:ft,46:Y,56:[1,211],61:dt,69:pt,72:186,74:138,75:yt,76:vt,77:mt,78:bt,79:xt,80:_t,81:kt,83:129,84:wt,94:U,95:$,98:W,99:H,100:Et,102:G,103:q,104:Tt,105:Ct,106:135,109:X,110:Z,111:J,112:K,113:Q,114:tt},{22:ct,24:ut,26:lt,38:ht,42:ft,46:Y,58:[1,212],61:dt,69:pt,72:186,74:138,75:yt,76:vt,77:mt,78:bt,79:xt,80:_t,81:kt,83:129,84:wt,94:U,95:$,98:W,99:H,100:Et,102:G,103:q,104:Tt,105:Ct,106:135,109:X,110:Z,111:J,112:K,113:Q,114:tt},{22:ct,24:ut,26:lt,38:ht,42:ft,46:Y,60:[1,213],61:dt,69:pt,72:186,74:138,75:yt,76:vt,77:mt,78:bt,79:xt,80:_t,81:kt,83:129,84:wt,94:U,95:$,98:W,99:H,100:Et,102:G,103:q,104:Tt,105:Ct,106:135,109:X,110:Z,111:J,112:K,113:Q,114:tt},{22:ct,24:ut,26:lt,38:ht,39:214,42:ft,46:Y,61:dt,69:pt,72:127,73:gt,74:138,75:yt,76:vt,77:mt,78:bt,79:xt,80:_t,81:kt,83:129,84:wt,94:U,95:$,98:W,99:H,100:Et,102:G,103:q,104:Tt,105:Ct,106:135,109:X,110:Z,111:J,112:K,113:Q,114:tt},{22:ct,24:ut,26:lt,38:ht,41:[1,215],42:ft,46:Y,61:dt,69:pt,72:186,74:138,75:yt,76:vt,77:mt,78:bt,79:xt,80:_t,81:kt,83:129,84:wt,94:U,95:$,98:W,99:H,100:Et,102:G,103:q,104:Tt,105:Ct,106:135,109:X,110:Z,111:J,112:K,113:Q,114:tt},{22:ct,24:ut,26:lt,38:ht,42:ft,46:Y,61:dt,63:[1,216],65:[1,217],69:pt,72:186,74:138,75:yt,76:vt,77:mt,78:bt,79:xt,80:_t,81:kt,83:129,84:wt,94:U,95:$,98:W,99:H,100:Et,102:G,103:q,104:Tt,105:Ct,106:135,109:X,110:Z,111:J,112:K,113:Q,114:tt},{22:ct,24:ut,26:lt,38:ht,42:ft,46:Y,61:dt,63:[1,219],65:[1,218],69:pt,72:186,74:138,75:yt,76:vt,77:mt,78:bt,79:xt,80:_t,81:kt,83:129,84:wt,94:U,95:$,98:W,99:H,100:Et,102:G,103:q,104:Tt,105:Ct,106:135,109:X,110:Z,111:J,112:K,113:Q,114:tt},{9:220,20:P,21:I,23:F},t(j,[2,48],{46:St}),t(st,[2,71]),t(st,[2,70]),{22:ct,24:ut,26:lt,38:ht,42:ft,46:Y,61:dt,69:pt,71:[1,221],72:186,74:138,75:yt,76:vt,77:mt,78:bt,79:xt,80:_t,81:kt,83:129,84:wt,94:U,95:$,98:W,99:H,100:Et,102:G,103:q,104:Tt,105:Ct,106:135,109:X,110:Z,111:J,112:K,113:Q,114:tt},t(st,[2,73]),t(Ot,[2,77]),{22:ct,24:ut,26:lt,38:ht,39:222,42:ft,46:Y,61:dt,69:pt,72:127,73:gt,74:138,75:yt,76:vt,77:mt,78:bt,79:xt,80:_t,81:kt,83:129,84:wt,94:U,95:$,98:W,99:H,100:Et,102:G,103:q,104:Tt,105:Ct,106:135,109:X,110:Z,111:J,112:K,113:Q,114:tt},t(At,o,{17:223}),t(L,[2,43]),{45:224,46:f,48:38,80:m,94:b,95:x,98:_,99:k,100:w,102:E,103:T,107:39,109:C,110:A,111:S,112:M,113:O,114:D},{22:Bt,75:Lt,85:225,91:Pt,94:It,96:226,97:227,98:Ft,99:jt,100:Rt,101:Yt,102:zt,103:Ut,104:$t},{22:Bt,75:Lt,85:239,91:Pt,94:It,96:226,97:227,98:Ft,99:jt,100:Rt,101:Yt,102:zt,103:Ut,104:$t},{22:Bt,75:Lt,85:240,91:Pt,93:[1,241],94:It,96:226,97:227,98:Ft,99:jt,100:Rt,101:Yt,102:zt,103:Ut,104:$t},{22:Bt,75:Lt,85:242,91:Pt,93:[1,243],94:It,96:226,97:227,98:Ft,99:jt,100:Rt,101:Yt,102:zt,103:Ut,104:$t},{94:[1,244]},{22:Bt,75:Lt,85:245,91:Pt,94:It,96:226,97:227,98:Ft,99:jt,100:Rt,101:Yt,102:zt,103:Ut,104:$t},{22:Bt,75:Lt,85:246,91:Pt,94:It,96:226,97:227,98:Ft,99:jt,100:Rt,101:Yt,102:zt,103:Ut,104:$t},{26:R,46:Y,80:z,86:247,94:U,95:$,98:W,99:H,100:V,102:G,103:q,106:89,108:87,109:X,110:Z,111:J,112:K,113:Q,114:tt},t(it,[2,96]),{73:[1,248]},t(it,[2,100],{22:[1,249]}),t(it,[2,101]),t(it,[2,104]),t(it,[2,106],{22:[1,250]}),t(it,[2,107]),t(nt,[2,54]),{22:ct,24:ut,26:lt,38:ht,42:ft,46:Y,50:[1,251],61:dt,69:pt,72:186,74:138,75:yt,76:vt,77:mt,78:bt,79:xt,80:_t,81:kt,83:129,84:wt,94:U,95:$,98:W,99:H,100:Et,102:G,103:q,104:Tt,105:Ct,106:135,109:X,110:Z,111:J,112:K,113:Q,114:tt},t(nt,[2,60]),t(nt,[2,56]),t(nt,[2,57]),t(nt,[2,58]),t(nt,[2,59]),t(nt,[2,61]),{22:ct,24:ut,26:lt,38:ht,42:ft,46:Y,60:[1,252],61:dt,69:pt,72:186,74:138,75:yt,76:vt,77:mt,78:bt,79:xt,80:_t,81:kt,83:129,84:wt,94:U,95:$,98:W,99:H,100:Et,102:G,103:q,104:Tt,105:Ct,106:135,109:X,110:Z,111:J,112:K,113:Q,114:tt},t(nt,[2,63]),t(nt,[2,64]),t(nt,[2,66]),t(nt,[2,65]),t(nt,[2,67]),t(Dt,[2,4]),t([22,46,80,94,95,98,99,100,102,103,109,110,111,112,113,114],[2,75]),{22:ct,24:ut,26:lt,38:ht,41:[1,253],42:ft,46:Y,61:dt,69:pt,72:186,74:138,75:yt,76:vt,77:mt,78:bt,79:xt,80:_t,81:kt,83:129,84:wt,94:U,95:$,98:W,99:H,100:Et,102:G,103:q,104:Tt,105:Ct,106:135,109:X,110:Z,111:J,112:K,113:Q,114:tt},{18:18,19:19,20:s,21:c,22:u,23:l,32:24,33:25,34:26,35:27,36:28,37:29,38:h,42:[1,254],44:31,45:37,46:f,48:38,75:d,76:p,77:g,78:y,79:v,80:m,94:b,95:x,98:_,99:k,100:w,102:E,103:T,107:39,109:C,110:A,111:S,112:M,113:O,114:D},t(et,[2,52]),t(it,[2,109],{95:Wt}),t(Ht,[2,119],{97:256,22:Bt,75:Lt,91:Pt,94:It,98:Ft,99:jt,100:Rt,101:Yt,102:zt,103:Ut,104:$t}),t(Vt,[2,121]),t(Vt,[2,123]),t(Vt,[2,124]),t(Vt,[2,125]),t(Vt,[2,126]),t(Vt,[2,127]),t(Vt,[2,128]),t(Vt,[2,129]),t(Vt,[2,130]),t(Vt,[2,131]),t(Vt,[2,132]),t(Vt,[2,133]),t(it,[2,110],{95:Wt}),t(it,[2,111],{95:Wt}),{22:[1,257]},t(it,[2,112],{95:Wt}),{22:[1,258]},t(Nt,[2,118]),t(it,[2,92],{95:Wt}),t(it,[2,93],{95:Wt}),t(it,[2,94],{106:89,108:165,26:R,46:Y,80:z,94:U,95:$,98:W,99:H,100:V,102:G,103:q,109:X,110:Z,111:J,112:K,113:Q,114:tt}),t(it,[2,98]),{90:[1,259]},{90:[1,260]},{50:[1,261]},{60:[1,262]},{9:263,20:P,21:I,23:F},t(L,[2,42]),{22:Bt,75:Lt,91:Pt,94:It,96:264,97:227,98:Ft,99:jt,100:Rt,101:Yt,102:zt,103:Ut,104:$t},t(Vt,[2,122]),{26:R,46:Y,80:z,86:265,94:U,95:$,98:W,99:H,100:V,102:G,103:q,106:89,108:87,109:X,110:Z,111:J,112:K,113:Q,114:tt},{26:R,46:Y,80:z,86:266,94:U,95:$,98:W,99:H,100:V,102:G,103:q,106:89,108:87,109:X,110:Z,111:J,112:K,113:Q,114:tt},t(it,[2,102]),t(it,[2,108]),t(nt,[2,55]),t(nt,[2,62]),t(At,o,{17:267}),t(Ht,[2,120],{97:256,22:Bt,75:Lt,91:Pt,94:It,98:Ft,99:jt,100:Rt,101:Yt,102:zt,103:Ut,104:$t}),t(it,[2,115],{106:89,108:165,22:[1,268],26:R,46:Y,80:z,94:U,95:$,98:W,99:H,100:V,102:G,103:q,109:X,110:Z,111:J,112:K,113:Q,114:tt}),t(it,[2,116],{106:89,108:165,22:[1,269],26:R,46:Y,80:z,94:U,95:$,98:W,99:H,100:V,102:G,103:q,109:X,110:Z,111:J,112:K,113:Q,114:tt}),{18:18,19:19,20:s,21:c,22:u,23:l,32:24,33:25,34:26,35:27,36:28,37:29,38:h,42:[1,270],44:31,45:37,46:f,48:38,75:d,76:p,77:g,78:y,79:v,80:m,94:b,95:x,98:_,99:k,100:w,102:E,103:T,107:39,109:C,110:A,111:S,112:M,113:O,114:D},{22:Bt,75:Lt,85:271,91:Pt,94:It,96:226,97:227,98:Ft,99:jt,100:Rt,101:Yt,102:zt,103:Ut,104:$t},{22:Bt,75:Lt,85:272,91:Pt,94:It,96:226,97:227,98:Ft,99:jt,100:Rt,101:Yt,102:zt,103:Ut,104:$t},t(L,[2,41]),t(it,[2,113],{95:Wt}),t(it,[2,114],{95:Wt})],defaultActions:{2:[2,1],9:[2,5],10:[2,2],119:[2,7]},parseError:function(t,e){if(!e.recoverable){var n=new Error(t);throw n.hash=e,n}this.trace(t)},parse:function(t){var e=this,n=[0],r=[],i=[null],a=[],o=this.table,s="",c=0,u=0,l=0,h=2,f=1,d=a.slice.call(arguments,1),p=Object.create(this.lexer),g={yy:{}};for(var y in this.yy)Object.prototype.hasOwnProperty.call(this.yy,y)&&(g.yy[y]=this.yy[y]);p.setInput(t,g.yy),g.yy.lexer=p,g.yy.parser=this,void 0===p.yylloc&&(p.yylloc={});var v=p.yylloc;a.push(v);var m=p.options&&p.options.ranges;function b(){var t;return"number"!=typeof(t=r.pop()||p.lex()||f)&&(t instanceof Array&&(t=(r=t).pop()),t=e.symbols_[t]||t),t}"function"==typeof g.yy.parseError?this.parseError=g.yy.parseError:this.parseError=Object.getPrototypeOf(this).parseError;for(var x,_,k,w,E,T,C,A,S,M={};;){if(k=n[n.length-1],this.defaultActions[k]?w=this.defaultActions[k]:(null==x&&(x=b()),w=o[k]&&o[k][x]),void 0===w||!w.length||!w[0]){var O="";for(T in S=[],o[k])this.terminals_[T]&&T>h&&S.push("'"+this.terminals_[T]+"'");O=p.showPosition?"Parse error on line "+(c+1)+":\n"+p.showPosition()+"\nExpecting "+S.join(", ")+", got '"+(this.terminals_[x]||x)+"'":"Parse error on line "+(c+1)+": Unexpected "+(x==f?"end of input":"'"+(this.terminals_[x]||x)+"'"),this.parseError(O,{text:p.match,token:this.terminals_[x]||x,line:p.yylineno,loc:v,expected:S})}if(w[0]instanceof Array&&w.length>1)throw new Error("Parse Error: multiple actions possible at state: "+k+", token: "+x);switch(w[0]){case 1:n.push(x),i.push(p.yytext),a.push(p.yylloc),n.push(w[1]),x=null,_?(x=_,_=null):(u=p.yyleng,s=p.yytext,c=p.yylineno,v=p.yylloc,l>0&&l--);break;case 2:if(C=this.productions_[w[1]][1],M.$=i[i.length-C],M._$={first_line:a[a.length-(C||1)].first_line,last_line:a[a.length-1].last_line,first_column:a[a.length-(C||1)].first_column,last_column:a[a.length-1].last_column},m&&(M._$.range=[a[a.length-(C||1)].range[0],a[a.length-1].range[1]]),void 0!==(E=this.performAction.apply(M,[s,u,c,g.yy,w[1],i,a].concat(d))))return E;C&&(n=n.slice(0,-1*C*2),i=i.slice(0,-1*C),a=a.slice(0,-1*C)),n.push(this.productions_[w[1]][0]),i.push(M.$),a.push(M._$),A=o[n[n.length-2]][n[n.length-1]],n.push(A);break;case 3:return!0}}return!0}},qt={EOF:1,parseError:function(t,e){if(!this.yy.parser)throw new Error(t);this.yy.parser.parseError(t,e)},setInput:function(t,e){return this.yy=e||this.yy||{},this._input=t,this._more=this._backtrack=this.done=!1,this.yylineno=this.yyleng=0,this.yytext=this.matched=this.match="",this.conditionStack=["INITIAL"],this.yylloc={first_line:1,first_column:0,last_line:1,last_column:0},this.options.ranges&&(this.yylloc.range=[0,0]),this.offset=0,this},input:function(){var t=this._input[0];return this.yytext+=t,this.yyleng++,this.offset++,this.match+=t,this.matched+=t,t.match(/(?:\r\n?|\n).*/g)?(this.yylineno++,this.yylloc.last_line++):this.yylloc.last_column++,this.options.ranges&&this.yylloc.range[1]++,this._input=this._input.slice(1),t},unput:function(t){var e=t.length,n=t.split(/(?:\r\n?|\n)/g);this._input=t+this._input,this.yytext=this.yytext.substr(0,this.yytext.length-e),this.offset-=e;var r=this.match.split(/(?:\r\n?|\n)/g);this.match=this.match.substr(0,this.match.length-1),this.matched=this.matched.substr(0,this.matched.length-1),n.length-1&&(this.yylineno-=n.length-1);var i=this.yylloc.range;return this.yylloc={first_line:this.yylloc.first_line,last_line:this.yylineno+1,first_column:this.yylloc.first_column,last_column:n?(n.length===r.length?this.yylloc.first_column:0)+r[r.length-n.length].length-n[0].length:this.yylloc.first_column-e},this.options.ranges&&(this.yylloc.range=[i[0],i[0]+this.yyleng-e]),this.yyleng=this.yytext.length,this},more:function(){return this._more=!0,this},reject:function(){return this.options.backtrack_lexer?(this._backtrack=!0,this):this.parseError("Lexical error on line "+(this.yylineno+1)+". You can only invoke reject() in the lexer when the lexer is of the backtracking persuasion (options.backtrack_lexer = true).\n"+this.showPosition(),{text:"",token:null,line:this.yylineno})},less:function(t){this.unput(this.match.slice(t))},pastInput:function(){var t=this.matched.substr(0,this.matched.length-this.match.length);return(t.length>20?"...":"")+t.substr(-20).replace(/\n/g,"")},upcomingInput:function(){var t=this.match;return t.length<20&&(t+=this._input.substr(0,20-t.length)),(t.substr(0,20)+(t.length>20?"...":"")).replace(/\n/g,"")},showPosition:function(){var t=this.pastInput(),e=new Array(t.length+1).join("-");return t+this.upcomingInput()+"\n"+e+"^"},test_match:function(t,e){var n,r,i;if(this.options.backtrack_lexer&&(i={yylineno:this.yylineno,yylloc:{first_line:this.yylloc.first_line,last_line:this.last_line,first_column:this.yylloc.first_column,last_column:this.yylloc.last_column},yytext:this.yytext,match:this.match,matches:this.matches,matched:this.matched,yyleng:this.yyleng,offset:this.offset,_more:this._more,_input:this._input,yy:this.yy,conditionStack:this.conditionStack.slice(0),done:this.done},this.options.ranges&&(i.yylloc.range=this.yylloc.range.slice(0))),(r=t[0].match(/(?:\r\n?|\n).*/g))&&(this.yylineno+=r.length),this.yylloc={first_line:this.yylloc.last_line,last_line:this.yylineno+1,first_column:this.yylloc.last_column,last_column:r?r[r.length-1].length-r[r.length-1].match(/\r?\n?/)[0].length:this.yylloc.last_column+t[0].length},this.yytext+=t[0],this.match+=t[0],this.matches=t,this.yyleng=this.yytext.length,this.options.ranges&&(this.yylloc.range=[this.offset,this.offset+=this.yyleng]),this._more=!1,this._backtrack=!1,this._input=this._input.slice(t[0].length),this.matched+=t[0],n=this.performAction.call(this,this.yy,this,e,this.conditionStack[this.conditionStack.length-1]),this.done&&this._input&&(this.done=!1),n)return n;if(this._backtrack){for(var a in i)this[a]=i[a];return!1}return!1},next:function(){if(this.done)return this.EOF;var t,e,n,r;this._input||(this.done=!0),this._more||(this.yytext="",this.match="");for(var i=this._currentRules(),a=0;a<i.length;a++)if((n=this._input.match(this.rules[i[a]]))&&(!e||n[0].length>e[0].length)){if(e=n,r=a,this.options.backtrack_lexer){if(!1!==(t=this.test_match(n,i[a])))return t;if(this._backtrack){e=!1;continue}return!1}if(!this.options.flex)break}return e?!1!==(t=this.test_match(e,i[r]))&&t:""===this._input?this.EOF:this.parseError("Lexical error on line "+(this.yylineno+1)+". Unrecognized text.\n"+this.showPosition(),{text:"",token:null,line:this.yylineno})},lex:function(){var t=this.next();return t||this.lex()},begin:function(t){this.conditionStack.push(t)},popState:function(){return this.conditionStack.length-1>0?this.conditionStack.pop():this.conditionStack[0]},_currentRules:function(){return this.conditionStack.length&&this.conditionStack[this.conditionStack.length-1]?this.conditions[this.conditionStack[this.conditionStack.length-1]].rules:this.conditions.INITIAL.rules},topState:function(t){return(t=this.conditionStack.length-1-Math.abs(t||0))>=0?this.conditionStack[t]:"INITIAL"},pushState:function(t){this.begin(t)},stateStackSize:function(){return this.conditionStack.length},options:{},performAction:function(t,e,n,r){switch(n){case 0:return this.begin("open_directive"),12;case 1:return this.begin("type_directive"),13;case 2:return this.popState(),this.begin("arg_directive"),10;case 3:return this.popState(),this.popState(),15;case 4:return 14;case 5:case 6:break;case 7:this.begin("string");break;case 8:this.popState();break;case 9:return"STR";case 10:return 75;case 11:return 84;case 12:return 76;case 13:return 93;case 14:return 77;case 15:return 78;case 16:this.begin("href");break;case 17:this.popState();break;case 18:return 89;case 19:this.begin("callbackname");break;case 20:this.popState();break;case 21:this.popState(),this.begin("callbackargs");break;case 22:return 87;case 23:this.popState();break;case 24:return 88;case 25:this.begin("click");break;case 26:this.popState();break;case 27:return 79;case 28:case 29:return t.lex.firstGraph()&&this.begin("dir"),24;case 30:return 38;case 31:return 42;case 32:case 33:case 34:case 35:return 90;case 36:return this.popState(),25;case 37:case 38:case 39:case 40:case 41:case 42:case 43:case 44:case 45:case 46:return this.popState(),26;case 47:return 94;case 48:return 102;case 49:return 47;case 50:return 99;case 51:return 46;case 52:return 20;case 53:return 95;case 54:return 113;case 55:case 56:case 57:return 70;case 58:case 59:case 60:return 69;case 61:return 51;case 62:return 52;case 63:return 53;case 64:return 54;case 65:return 55;case 66:return 56;case 67:return 57;case 68:return 58;case 69:return 100;case 70:return 103;case 71:return 114;case 72:return 111;case 73:return 104;case 74:case 75:return 112;case 76:return 105;case 77:return 61;case 78:return 81;case 79:return"SEP";case 80:return 80;case 81:return 98;case 82:return 63;case 83:return 62;case 84:return 65;case 85:return 64;case 86:return 109;case 87:return 110;case 88:return 71;case 89:return 49;case 90:return 50;case 91:return 40;case 92:return 41;case 93:return 59;case 94:return 60;case 95:return 120;case 96:return 21;case 97:return 22;case 98:return 23}},rules:[/^(?:%%\{)/,/^(?:((?:(?!\}%%)[^:.])*))/,/^(?::)/,/^(?:\}%%)/,/^(?:((?:(?!\}%%).|\n)*))/,/^(?:%%(?!\{)[^\n]*)/,/^(?:[^\}]%%[^\n]*)/,/^(?:["])/,/^(?:["])/,/^(?:[^"]*)/,/^(?:style\b)/,/^(?:default\b)/,/^(?:linkStyle\b)/,/^(?:interpolate\b)/,/^(?:classDef\b)/,/^(?:class\b)/,/^(?:href[\s]+["])/,/^(?:["])/,/^(?:[^"]*)/,/^(?:call[\s]+)/,/^(?:\([\s]*\))/,/^(?:\()/,/^(?:[^(]*)/,/^(?:\))/,/^(?:[^)]*)/,/^(?:click[\s]+)/,/^(?:[\s\n])/,/^(?:[^\s\n]*)/,/^(?:graph\b)/,/^(?:flowchart\b)/,/^(?:subgraph\b)/,/^(?:end\b\s*)/,/^(?:_self\b)/,/^(?:_blank\b)/,/^(?:_parent\b)/,/^(?:_top\b)/,/^(?:(\r?\n)*\s*\n)/,/^(?:\s*LR\b)/,/^(?:\s*RL\b)/,/^(?:\s*TB\b)/,/^(?:\s*BT\b)/,/^(?:\s*TD\b)/,/^(?:\s*BR\b)/,/^(?:\s*<)/,/^(?:\s*>)/,/^(?:\s*\^)/,/^(?:\s*v\b)/,/^(?:[0-9]+)/,/^(?:#)/,/^(?::::)/,/^(?::)/,/^(?:&)/,/^(?:;)/,/^(?:,)/,/^(?:\*)/,/^(?:\s*[xo<]?--+[-xo>]\s*)/,/^(?:\s*[xo<]?==+[=xo>]\s*)/,/^(?:\s*[xo<]?-?\.+-[xo>]?\s*)/,/^(?:\s*[xo<]?--\s*)/,/^(?:\s*[xo<]?==\s*)/,/^(?:\s*[xo<]?-\.\s*)/,/^(?:\(-)/,/^(?:-\))/,/^(?:\(\[)/,/^(?:\]\))/,/^(?:\[\[)/,/^(?:\]\])/,/^(?:\[\()/,/^(?:\)\])/,/^(?:-)/,/^(?:\.)/,/^(?:[\_])/,/^(?:\+)/,/^(?:%)/,/^(?:=)/,/^(?:=)/,/^(?:<)/,/^(?:>)/,/^(?:\^)/,/^(?:\\\|)/,/^(?:v\b)/,/^(?:[A-Za-z]+)/,/^(?:\\\])/,/^(?:\[\/)/,/^(?:\/\])/,/^(?:\[\\)/,/^(?:[!"#$%&'*+,-.`?\\_/])/,/^(?:[\u00AA\u00B5\u00BA\u00C0-\u00D6\u00D8-\u00F6]|[\u00F8-\u02C1\u02C6-\u02D1\u02E0-\u02E4\u02EC\u02EE\u0370-\u0374\u0376\u0377]|[\u037A-\u037D\u0386\u0388-\u038A\u038C\u038E-\u03A1\u03A3-\u03F5]|[\u03F7-\u0481\u048A-\u0527\u0531-\u0556\u0559\u0561-\u0587\u05D0-\u05EA]|[\u05F0-\u05F2\u0620-\u064A\u066E\u066F\u0671-\u06D3\u06D5\u06E5\u06E6\u06EE]|[\u06EF\u06FA-\u06FC\u06FF\u0710\u0712-\u072F\u074D-\u07A5\u07B1\u07CA-\u07EA]|[\u07F4\u07F5\u07FA\u0800-\u0815\u081A\u0824\u0828\u0840-\u0858\u08A0]|[\u08A2-\u08AC\u0904-\u0939\u093D\u0950\u0958-\u0961\u0971-\u0977]|[\u0979-\u097F\u0985-\u098C\u098F\u0990\u0993-\u09A8\u09AA-\u09B0\u09B2]|[\u09B6-\u09B9\u09BD\u09CE\u09DC\u09DD\u09DF-\u09E1\u09F0\u09F1\u0A05-\u0A0A]|[\u0A0F\u0A10\u0A13-\u0A28\u0A2A-\u0A30\u0A32\u0A33\u0A35\u0A36\u0A38\u0A39]|[\u0A59-\u0A5C\u0A5E\u0A72-\u0A74\u0A85-\u0A8D\u0A8F-\u0A91\u0A93-\u0AA8]|[\u0AAA-\u0AB0\u0AB2\u0AB3\u0AB5-\u0AB9\u0ABD\u0AD0\u0AE0\u0AE1\u0B05-\u0B0C]|[\u0B0F\u0B10\u0B13-\u0B28\u0B2A-\u0B30\u0B32\u0B33\u0B35-\u0B39\u0B3D\u0B5C]|[\u0B5D\u0B5F-\u0B61\u0B71\u0B83\u0B85-\u0B8A\u0B8E-\u0B90\u0B92-\u0B95\u0B99]|[\u0B9A\u0B9C\u0B9E\u0B9F\u0BA3\u0BA4\u0BA8-\u0BAA\u0BAE-\u0BB9\u0BD0]|[\u0C05-\u0C0C\u0C0E-\u0C10\u0C12-\u0C28\u0C2A-\u0C33\u0C35-\u0C39\u0C3D]|[\u0C58\u0C59\u0C60\u0C61\u0C85-\u0C8C\u0C8E-\u0C90\u0C92-\u0CA8\u0CAA-\u0CB3]|[\u0CB5-\u0CB9\u0CBD\u0CDE\u0CE0\u0CE1\u0CF1\u0CF2\u0D05-\u0D0C\u0D0E-\u0D10]|[\u0D12-\u0D3A\u0D3D\u0D4E\u0D60\u0D61\u0D7A-\u0D7F\u0D85-\u0D96\u0D9A-\u0DB1]|[\u0DB3-\u0DBB\u0DBD\u0DC0-\u0DC6\u0E01-\u0E30\u0E32\u0E33\u0E40-\u0E46\u0E81]|[\u0E82\u0E84\u0E87\u0E88\u0E8A\u0E8D\u0E94-\u0E97\u0E99-\u0E9F\u0EA1-\u0EA3]|[\u0EA5\u0EA7\u0EAA\u0EAB\u0EAD-\u0EB0\u0EB2\u0EB3\u0EBD\u0EC0-\u0EC4\u0EC6]|[\u0EDC-\u0EDF\u0F00\u0F40-\u0F47\u0F49-\u0F6C\u0F88-\u0F8C\u1000-\u102A]|[\u103F\u1050-\u1055\u105A-\u105D\u1061\u1065\u1066\u106E-\u1070\u1075-\u1081]|[\u108E\u10A0-\u10C5\u10C7\u10CD\u10D0-\u10FA\u10FC-\u1248\u124A-\u124D]|[\u1250-\u1256\u1258\u125A-\u125D\u1260-\u1288\u128A-\u128D\u1290-\u12B0]|[\u12B2-\u12B5\u12B8-\u12BE\u12C0\u12C2-\u12C5\u12C8-\u12D6\u12D8-\u1310]|[\u1312-\u1315\u1318-\u135A\u1380-\u138F\u13A0-\u13F4\u1401-\u166C]|[\u166F-\u167F\u1681-\u169A\u16A0-\u16EA\u1700-\u170C\u170E-\u1711]|[\u1720-\u1731\u1740-\u1751\u1760-\u176C\u176E-\u1770\u1780-\u17B3\u17D7]|[\u17DC\u1820-\u1877\u1880-\u18A8\u18AA\u18B0-\u18F5\u1900-\u191C]|[\u1950-\u196D\u1970-\u1974\u1980-\u19AB\u19C1-\u19C7\u1A00-\u1A16]|[\u1A20-\u1A54\u1AA7\u1B05-\u1B33\u1B45-\u1B4B\u1B83-\u1BA0\u1BAE\u1BAF]|[\u1BBA-\u1BE5\u1C00-\u1C23\u1C4D-\u1C4F\u1C5A-\u1C7D\u1CE9-\u1CEC]|[\u1CEE-\u1CF1\u1CF5\u1CF6\u1D00-\u1DBF\u1E00-\u1F15\u1F18-\u1F1D]|[\u1F20-\u1F45\u1F48-\u1F4D\u1F50-\u1F57\u1F59\u1F5B\u1F5D\u1F5F-\u1F7D]|[\u1F80-\u1FB4\u1FB6-\u1FBC\u1FBE\u1FC2-\u1FC4\u1FC6-\u1FCC\u1FD0-\u1FD3]|[\u1FD6-\u1FDB\u1FE0-\u1FEC\u1FF2-\u1FF4\u1FF6-\u1FFC\u2071\u207F]|[\u2090-\u209C\u2102\u2107\u210A-\u2113\u2115\u2119-\u211D\u2124\u2126\u2128]|[\u212A-\u212D\u212F-\u2139\u213C-\u213F\u2145-\u2149\u214E\u2183\u2184]|[\u2C00-\u2C2E\u2C30-\u2C5E\u2C60-\u2CE4\u2CEB-\u2CEE\u2CF2\u2CF3]|[\u2D00-\u2D25\u2D27\u2D2D\u2D30-\u2D67\u2D6F\u2D80-\u2D96\u2DA0-\u2DA6]|[\u2DA8-\u2DAE\u2DB0-\u2DB6\u2DB8-\u2DBE\u2DC0-\u2DC6\u2DC8-\u2DCE]|[\u2DD0-\u2DD6\u2DD8-\u2DDE\u2E2F\u3005\u3006\u3031-\u3035\u303B\u303C]|[\u3041-\u3096\u309D-\u309F\u30A1-\u30FA\u30FC-\u30FF\u3105-\u312D]|[\u3131-\u318E\u31A0-\u31BA\u31F0-\u31FF\u3400-\u4DB5\u4E00-\u9FCC]|[\uA000-\uA48C\uA4D0-\uA4FD\uA500-\uA60C\uA610-\uA61F\uA62A\uA62B]|[\uA640-\uA66E\uA67F-\uA697\uA6A0-\uA6E5\uA717-\uA71F\uA722-\uA788]|[\uA78B-\uA78E\uA790-\uA793\uA7A0-\uA7AA\uA7F8-\uA801\uA803-\uA805]|[\uA807-\uA80A\uA80C-\uA822\uA840-\uA873\uA882-\uA8B3\uA8F2-\uA8F7\uA8FB]|[\uA90A-\uA925\uA930-\uA946\uA960-\uA97C\uA984-\uA9B2\uA9CF\uAA00-\uAA28]|[\uAA40-\uAA42\uAA44-\uAA4B\uAA60-\uAA76\uAA7A\uAA80-\uAAAF\uAAB1\uAAB5]|[\uAAB6\uAAB9-\uAABD\uAAC0\uAAC2\uAADB-\uAADD\uAAE0-\uAAEA\uAAF2-\uAAF4]|[\uAB01-\uAB06\uAB09-\uAB0E\uAB11-\uAB16\uAB20-\uAB26\uAB28-\uAB2E]|[\uABC0-\uABE2\uAC00-\uD7A3\uD7B0-\uD7C6\uD7CB-\uD7FB\uF900-\uFA6D]|[\uFA70-\uFAD9\uFB00-\uFB06\uFB13-\uFB17\uFB1D\uFB1F-\uFB28\uFB2A-\uFB36]|[\uFB38-\uFB3C\uFB3E\uFB40\uFB41\uFB43\uFB44\uFB46-\uFBB1\uFBD3-\uFD3D]|[\uFD50-\uFD8F\uFD92-\uFDC7\uFDF0-\uFDFB\uFE70-\uFE74\uFE76-\uFEFC]|[\uFF21-\uFF3A\uFF41-\uFF5A\uFF66-\uFFBE\uFFC2-\uFFC7\uFFCA-\uFFCF]|[\uFFD2-\uFFD7\uFFDA-\uFFDC])/,/^(?:\|)/,/^(?:\()/,/^(?:\))/,/^(?:\[)/,/^(?:\])/,/^(?:\{)/,/^(?:\})/,/^(?:")/,/^(?:(\r?\n)+)/,/^(?:\s)/,/^(?:$)/],conditions:{close_directive:{rules:[],inclusive:!1},arg_directive:{rules:[3,4],inclusive:!1},type_directive:{rules:[2,3],inclusive:!1},open_directive:{rules:[1],inclusive:!1},callbackargs:{rules:[23,24],inclusive:!1},callbackname:{rules:[20,21,22],inclusive:!1},href:{rules:[17,18],inclusive:!1},click:{rules:[26,27],inclusive:!1},vertex:{rules:[],inclusive:!1},dir:{rules:[36,37,38,39,40,41,42,43,44,45,46],inclusive:!1},string:{rules:[8,9],inclusive:!1},INITIAL:{rules:[0,5,6,7,10,11,12,13,14,15,16,19,25,28,29,30,31,32,33,34,35,47,48,49,50,51,52,53,54,55,56,57,58,59,60,61,62,63,64,65,66,67,68,69,70,71,72,73,74,75,76,77,78,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,94,95,96,97,98],inclusive:!0}}};function Xt(){this.yy={}}return Gt.lexer=qt,Xt.prototype=Gt,Gt.Parser=Xt,new Xt}();e.parser=i,e.Parser=i.Parser,e.parse=function(){return i.parse.apply(i,arguments)},e.main=function(r){r[1]||(console.log("Usage: "+r[0]+" FILE"),t.exit(1));var i=n(19).readFileSync(n(20).normalize(r[1]),"utf8");return e.parser.parse(i)},n.c[n.s]===r&&e.main(t.argv.slice(1))}).call(this,n(14),n(7)(t))},function(t,e,n){(function(t,r){var i=function(){var t=function(t,e,n,r){for(n=n||{},r=t.length;r--;n[t[r]]=e);return n},e=[1,3],n=[1,5],r=[7,9,11,12,13,14,15,16,17,18,20,27,32],i=[1,15],a=[1,16],o=[1,17],s=[1,18],c=[1,19],u=[1,20],l=[1,21],h=[1,23],f=[1,25],d=[1,28],p=[5,7,9,11,12,13,14,15,16,17,18,20,27,32],g={trace:function(){},yy:{},symbols_:{error:2,start:3,directive:4,gantt:5,document:6,EOF:7,line:8,SPACE:9,statement:10,NL:11,dateFormat:12,inclusiveEndDates:13,axisFormat:14,excludes:15,todayMarker:16,title:17,section:18,clickStatement:19,taskTxt:20,taskData:21,openDirective:22,typeDirective:23,closeDirective:24,":":25,argDirective:26,click:27,callbackname:28,callbackargs:29,href:30,clickStatementDebug:31,open_directive:32,type_directive:33,arg_directive:34,close_directive:35,$accept:0,$end:1},terminals_:{2:"error",5:"gantt",7:"EOF",9:"SPACE",11:"NL",12:"dateFormat",13:"inclusiveEndDates",14:"axisFormat",15:"excludes",16:"todayMarker",17:"title",18:"section",20:"taskTxt",21:"taskData",25:":",27:"click",28:"callbackname",29:"callbackargs",30:"href",32:"open_directive",33:"type_directive",34:"arg_directive",35:"close_directive"},productions_:[0,[3,2],[3,3],[6,0],[6,2],[8,2],[8,1],[8,1],[8,1],[10,1],[10,1],[10,1],[10,1],[10,1],[10,1],[10,1],[10,1],[10,2],[10,1],[4,4],[4,6],[19,2],[19,3],[19,3],[19,4],[19,3],[19,4],[19,2],[31,2],[31,3],[31,3],[31,4],[31,3],[31,4],[31,2],[22,1],[23,1],[26,1],[24,1]],performAction:function(t,e,n,r,i,a,o){var s=a.length-1;switch(i){case 2:return a[s-1];case 3:this.$=[];break;case 4:a[s-1].push(a[s]),this.$=a[s-1];break;case 5:case 6:this.$=a[s];break;case 7:case 8:this.$=[];break;case 9:r.setDateFormat(a[s].substr(11)),this.$=a[s].substr(11);break;case 10:r.enableInclusiveEndDates(),this.$=a[s].substr(18);break;case 11:r.setAxisFormat(a[s].substr(11)),this.$=a[s].substr(11);break;case 12:r.setExcludes(a[s].substr(9)),this.$=a[s].substr(9);break;case 13:r.setTodayMarker(a[s].substr(12)),this.$=a[s].substr(12);break;case 14:r.setTitle(a[s].substr(6)),this.$=a[s].substr(6);break;case 15:r.addSection(a[s].substr(8)),this.$=a[s].substr(8);break;case 17:r.addTask(a[s-1],a[s]),this.$="task";break;case 21:this.$=a[s-1],r.setClickEvent(a[s-1],a[s],null);break;case 22:this.$=a[s-2],r.setClickEvent(a[s-2],a[s-1],a[s]);break;case 23:this.$=a[s-2],r.setClickEvent(a[s-2],a[s-1],null),r.setLink(a[s-2],a[s]);break;case 24:this.$=a[s-3],r.setClickEvent(a[s-3],a[s-2],a[s-1]),r.setLink(a[s-3],a[s]);break;case 25:this.$=a[s-2],r.setClickEvent(a[s-2],a[s],null),r.setLink(a[s-2],a[s-1]);break;case 26:this.$=a[s-3],r.setClickEvent(a[s-3],a[s-1],a[s]),r.setLink(a[s-3],a[s-2]);break;case 27:this.$=a[s-1],r.setLink(a[s-1],a[s]);break;case 28:case 34:this.$=a[s-1]+" "+a[s];break;case 29:case 30:case 32:this.$=a[s-2]+" "+a[s-1]+" "+a[s];break;case 31:case 33:this.$=a[s-3]+" "+a[s-2]+" "+a[s-1]+" "+a[s];break;case 35:r.parseDirective("%%{","open_directive");break;case 36:r.parseDirective(a[s],"type_directive");break;case 37:a[s]=a[s].trim().replace(/'/g,'"'),r.parseDirective(a[s],"arg_directive");break;case 38:r.parseDirective("}%%","close_directive","gantt")}},table:[{3:1,4:2,5:e,22:4,32:n},{1:[3]},{3:6,4:2,5:e,22:4,32:n},t(r,[2,3],{6:7}),{23:8,33:[1,9]},{33:[2,35]},{1:[2,1]},{4:24,7:[1,10],8:11,9:[1,12],10:13,11:[1,14],12:i,13:a,14:o,15:s,16:c,17:u,18:l,19:22,20:h,22:4,27:f,32:n},{24:26,25:[1,27],35:d},t([25,35],[2,36]),t(r,[2,8],{1:[2,2]}),t(r,[2,4]),{4:24,10:29,12:i,13:a,14:o,15:s,16:c,17:u,18:l,19:22,20:h,22:4,27:f,32:n},t(r,[2,6]),t(r,[2,7]),t(r,[2,9]),t(r,[2,10]),t(r,[2,11]),t(r,[2,12]),t(r,[2,13]),t(r,[2,14]),t(r,[2,15]),t(r,[2,16]),{21:[1,30]},t(r,[2,18]),{28:[1,31],30:[1,32]},{11:[1,33]},{26:34,34:[1,35]},{11:[2,38]},t(r,[2,5]),t(r,[2,17]),t(r,[2,21],{29:[1,36],30:[1,37]}),t(r,[2,27],{28:[1,38]}),t(p,[2,19]),{24:39,35:d},{35:[2,37]},t(r,[2,22],{30:[1,40]}),t(r,[2,23]),t(r,[2,25],{29:[1,41]}),{11:[1,42]},t(r,[2,24]),t(r,[2,26]),t(p,[2,20])],defaultActions:{5:[2,35],6:[2,1],28:[2,38],35:[2,37]},parseError:function(t,e){if(!e.recoverable){var n=new Error(t);throw n.hash=e,n}this.trace(t)},parse:function(t){var e=this,n=[0],r=[],i=[null],a=[],o=this.table,s="",c=0,u=0,l=0,h=2,f=1,d=a.slice.call(arguments,1),p=Object.create(this.lexer),g={yy:{}};for(var y in this.yy)Object.prototype.hasOwnProperty.call(this.yy,y)&&(g.yy[y]=this.yy[y]);p.setInput(t,g.yy),g.yy.lexer=p,g.yy.parser=this,void 0===p.yylloc&&(p.yylloc={});var v=p.yylloc;a.push(v);var m=p.options&&p.options.ranges;function b(){var t;return"number"!=typeof(t=r.pop()||p.lex()||f)&&(t instanceof Array&&(t=(r=t).pop()),t=e.symbols_[t]||t),t}"function"==typeof g.yy.parseError?this.parseError=g.yy.parseError:this.parseError=Object.getPrototypeOf(this).parseError;for(var x,_,k,w,E,T,C,A,S,M={};;){if(k=n[n.length-1],this.defaultActions[k]?w=this.defaultActions[k]:(null==x&&(x=b()),w=o[k]&&o[k][x]),void 0===w||!w.length||!w[0]){var O="";for(T in S=[],o[k])this.terminals_[T]&&T>h&&S.push("'"+this.terminals_[T]+"'");O=p.showPosition?"Parse error on line "+(c+1)+":\n"+p.showPosition()+"\nExpecting "+S.join(", ")+", got '"+(this.terminals_[x]||x)+"'":"Parse error on line "+(c+1)+": Unexpected "+(x==f?"end of input":"'"+(this.terminals_[x]||x)+"'"),this.parseError(O,{text:p.match,token:this.terminals_[x]||x,line:p.yylineno,loc:v,expected:S})}if(w[0]instanceof Array&&w.length>1)throw new Error("Parse Error: multiple actions possible at state: "+k+", token: "+x);switch(w[0]){case 1:n.push(x),i.push(p.yytext),a.push(p.yylloc),n.push(w[1]),x=null,_?(x=_,_=null):(u=p.yyleng,s=p.yytext,c=p.yylineno,v=p.yylloc,l>0&&l--);break;case 2:if(C=this.productions_[w[1]][1],M.$=i[i.length-C],M._$={first_line:a[a.length-(C||1)].first_line,last_line:a[a.length-1].last_line,first_column:a[a.length-(C||1)].first_column,last_column:a[a.length-1].last_column},m&&(M._$.range=[a[a.length-(C||1)].range[0],a[a.length-1].range[1]]),void 0!==(E=this.performAction.apply(M,[s,u,c,g.yy,w[1],i,a].concat(d))))return E;C&&(n=n.slice(0,-1*C*2),i=i.slice(0,-1*C),a=a.slice(0,-1*C)),n.push(this.productions_[w[1]][0]),i.push(M.$),a.push(M._$),A=o[n[n.length-2]][n[n.length-1]],n.push(A);break;case 3:return!0}}return!0}},y={EOF:1,parseError:function(t,e){if(!this.yy.parser)throw new Error(t);this.yy.parser.parseError(t,e)},setInput:function(t,e){return this.yy=e||this.yy||{},this._input=t,this._more=this._backtrack=this.done=!1,this.yylineno=this.yyleng=0,this.yytext=this.matched=this.match="",this.conditionStack=["INITIAL"],this.yylloc={first_line:1,first_column:0,last_line:1,last_column:0},this.options.ranges&&(this.yylloc.range=[0,0]),this.offset=0,this},input:function(){var t=this._input[0];return this.yytext+=t,this.yyleng++,this.offset++,this.match+=t,this.matched+=t,t.match(/(?:\r\n?|\n).*/g)?(this.yylineno++,this.yylloc.last_line++):this.yylloc.last_column++,this.options.ranges&&this.yylloc.range[1]++,this._input=this._input.slice(1),t},unput:function(t){var e=t.length,n=t.split(/(?:\r\n?|\n)/g);this._input=t+this._input,this.yytext=this.yytext.substr(0,this.yytext.length-e),this.offset-=e;var r=this.match.split(/(?:\r\n?|\n)/g);this.match=this.match.substr(0,this.match.length-1),this.matched=this.matched.substr(0,this.matched.length-1),n.length-1&&(this.yylineno-=n.length-1);var i=this.yylloc.range;return this.yylloc={first_line:this.yylloc.first_line,last_line:this.yylineno+1,first_column:this.yylloc.first_column,last_column:n?(n.length===r.length?this.yylloc.first_column:0)+r[r.length-n.length].length-n[0].length:this.yylloc.first_column-e},this.options.ranges&&(this.yylloc.range=[i[0],i[0]+this.yyleng-e]),this.yyleng=this.yytext.length,this},more:function(){return this._more=!0,this},reject:function(){return this.options.backtrack_lexer?(this._backtrack=!0,this):this.parseError("Lexical error on line "+(this.yylineno+1)+". You can only invoke reject() in the lexer when the lexer is of the backtracking persuasion (options.backtrack_lexer = true).\n"+this.showPosition(),{text:"",token:null,line:this.yylineno})},less:function(t){this.unput(this.match.slice(t))},pastInput:function(){var t=this.matched.substr(0,this.matched.length-this.match.length);return(t.length>20?"...":"")+t.substr(-20).replace(/\n/g,"")},upcomingInput:function(){var t=this.match;return t.length<20&&(t+=this._input.substr(0,20-t.length)),(t.substr(0,20)+(t.length>20?"...":"")).replace(/\n/g,"")},showPosition:function(){var t=this.pastInput(),e=new Array(t.length+1).join("-");return t+this.upcomingInput()+"\n"+e+"^"},test_match:function(t,e){var n,r,i;if(this.options.backtrack_lexer&&(i={yylineno:this.yylineno,yylloc:{first_line:this.yylloc.first_line,last_line:this.last_line,first_column:this.yylloc.first_column,last_column:this.yylloc.last_column},yytext:this.yytext,match:this.match,matches:this.matches,matched:this.matched,yyleng:this.yyleng,offset:this.offset,_more:this._more,_input:this._input,yy:this.yy,conditionStack:this.conditionStack.slice(0),done:this.done},this.options.ranges&&(i.yylloc.range=this.yylloc.range.slice(0))),(r=t[0].match(/(?:\r\n?|\n).*/g))&&(this.yylineno+=r.length),this.yylloc={first_line:this.yylloc.last_line,last_line:this.yylineno+1,first_column:this.yylloc.last_column,last_column:r?r[r.length-1].length-r[r.length-1].match(/\r?\n?/)[0].length:this.yylloc.last_column+t[0].length},this.yytext+=t[0],this.match+=t[0],this.matches=t,this.yyleng=this.yytext.length,this.options.ranges&&(this.yylloc.range=[this.offset,this.offset+=this.yyleng]),this._more=!1,this._backtrack=!1,this._input=this._input.slice(t[0].length),this.matched+=t[0],n=this.performAction.call(this,this.yy,this,e,this.conditionStack[this.conditionStack.length-1]),this.done&&this._input&&(this.done=!1),n)return n;if(this._backtrack){for(var a in i)this[a]=i[a];return!1}return!1},next:function(){if(this.done)return this.EOF;var t,e,n,r;this._input||(this.done=!0),this._more||(this.yytext="",this.match="");for(var i=this._currentRules(),a=0;a<i.length;a++)if((n=this._input.match(this.rules[i[a]]))&&(!e||n[0].length>e[0].length)){if(e=n,r=a,this.options.backtrack_lexer){if(!1!==(t=this.test_match(n,i[a])))return t;if(this._backtrack){e=!1;continue}return!1}if(!this.options.flex)break}return e?!1!==(t=this.test_match(e,i[r]))&&t:""===this._input?this.EOF:this.parseError("Lexical error on line "+(this.yylineno+1)+". Unrecognized text.\n"+this.showPosition(),{text:"",token:null,line:this.yylineno})},lex:function(){var t=this.next();return t||this.lex()},begin:function(t){this.conditionStack.push(t)},popState:function(){return this.conditionStack.length-1>0?this.conditionStack.pop():this.conditionStack[0]},_currentRules:function(){return this.conditionStack.length&&this.conditionStack[this.conditionStack.length-1]?this.conditions[this.conditionStack[this.conditionStack.length-1]].rules:this.conditions.INITIAL.rules},topState:function(t){return(t=this.conditionStack.length-1-Math.abs(t||0))>=0?this.conditionStack[t]:"INITIAL"},pushState:function(t){this.begin(t)},stateStackSize:function(){return this.conditionStack.length},options:{"case-insensitive":!0},performAction:function(t,e,n,r){switch(n){case 0:return this.begin("open_directive"),32;case 1:return this.begin("type_directive"),33;case 2:return this.popState(),this.begin("arg_directive"),25;case 3:return this.popState(),this.popState(),35;case 4:return 34;case 5:case 6:case 7:break;case 8:return 11;case 9:case 10:case 11:break;case 12:this.begin("href");break;case 13:this.popState();break;case 14:return 30;case 15:this.begin("callbackname");break;case 16:this.popState();break;case 17:this.popState(),this.begin("callbackargs");break;case 18:return 28;case 19:this.popState();break;case 20:return 29;case 21:this.begin("click");break;case 22:this.popState();break;case 23:return 27;case 24:return 5;case 25:return 12;case 26:return 13;case 27:return 14;case 28:return 15;case 29:return 16;case 30:return"date";case 31:return 17;case 32:return 18;case 33:return 20;case 34:return 21;case 35:return 25;case 36:return 7;case 37:return"INVALID"}},rules:[/^(?:%%\{)/i,/^(?:((?:(?!\}%%)[^:.])*))/i,/^(?::)/i,/^(?:\}%%)/i,/^(?:((?:(?!\}%%).|\n)*))/i,/^(?:%%(?!\{)*[^\n]*)/i,/^(?:[^\}]%%*[^\n]*)/i,/^(?:%%*[^\n]*[\n]*)/i,/^(?:[\n]+)/i,/^(?:\s+)/i,/^(?:#[^\n]*)/i,/^(?:%[^\n]*)/i,/^(?:href[\s]+["])/i,/^(?:["])/i,/^(?:[^"]*)/i,/^(?:call[\s]+)/i,/^(?:\([\s]*\))/i,/^(?:\()/i,/^(?:[^(]*)/i,/^(?:\))/i,/^(?:[^)]*)/i,/^(?:click[\s]+)/i,/^(?:[\s\n])/i,/^(?:[^\s\n]*)/i,/^(?:gantt\b)/i,/^(?:dateFormat\s[^#\n;]+)/i,/^(?:inclusiveEndDates\b)/i,/^(?:axisFormat\s[^#\n;]+)/i,/^(?:excludes\s[^#\n;]+)/i,/^(?:todayMarker\s[^\n;]+)/i,/^(?:\d\d\d\d-\d\d-\d\d\b)/i,/^(?:title\s[^#\n;]+)/i,/^(?:section\s[^#:\n;]+)/i,/^(?:[^#:\n;]+)/i,/^(?::[^#\n;]+)/i,/^(?::)/i,/^(?:$)/i,/^(?:.)/i],conditions:{close_directive:{rules:[],inclusive:!1},arg_directive:{rules:[3,4],inclusive:!1},type_directive:{rules:[2,3],inclusive:!1},open_directive:{rules:[1],inclusive:!1},callbackargs:{rules:[19,20],inclusive:!1},callbackname:{rules:[16,17,18],inclusive:!1},href:{rules:[13,14],inclusive:!1},click:{rules:[22,23],inclusive:!1},INITIAL:{rules:[0,5,6,7,8,9,10,11,12,15,21,24,25,26,27,28,29,30,31,32,33,34,35,36,37],inclusive:!0}}};function v(){this.yy={}}return g.lexer=y,v.prototype=g,g.Parser=v,new v}();e.parser=i,e.Parser=i.Parser,e.parse=function(){return i.parse.apply(i,arguments)},e.main=function(r){r[1]||(console.log("Usage: "+r[0]+" FILE"),t.exit(1));var i=n(19).readFileSync(n(20).normalize(r[1]),"utf8");return e.parser.parse(i)},n.c[n.s]===r&&e.main(t.argv.slice(1))}).call(this,n(14),n(7)(t))},function(t,e,n){(function(t,r){var i=function(){var t=function(t,e,n,r){for(n=n||{},r=t.length;r--;n[t[r]]=e);return n},e=[1,2],n=[1,5],r=[6,9,11,17,18,19,21],i=[1,15],a=[1,16],o=[1,17],s=[1,21],c=[4,6,9,11,17,18,19,21],u={trace:function(){},yy:{},symbols_:{error:2,start:3,journey:4,document:5,EOF:6,directive:7,line:8,SPACE:9,statement:10,NEWLINE:11,openDirective:12,typeDirective:13,closeDirective:14,":":15,argDirective:16,title:17,section:18,taskName:19,taskData:20,open_directive:21,type_directive:22,arg_directive:23,close_directive:24,$accept:0,$end:1},terminals_:{2:"error",4:"journey",6:"EOF",9:"SPACE",11:"NEWLINE",15:":",17:"title",18:"section",19:"taskName",20:"taskData",21:"open_directive",22:"type_directive",23:"arg_directive",24:"close_directive"},productions_:[0,[3,3],[3,2],[5,0],[5,2],[8,2],[8,1],[8,1],[8,1],[7,4],[7,6],[10,1],[10,1],[10,2],[10,1],[12,1],[13,1],[16,1],[14,1]],performAction:function(t,e,n,r,i,a,o){var s=a.length-1;switch(i){case 1:return a[s-1];case 3:this.$=[];break;case 4:a[s-1].push(a[s]),this.$=a[s-1];break;case 5:case 6:this.$=a[s];break;case 7:case 8:this.$=[];break;case 11:r.setTitle(a[s].substr(6)),this.$=a[s].substr(6);break;case 12:r.addSection(a[s].substr(8)),this.$=a[s].substr(8);break;case 13:r.addTask(a[s-1],a[s]),this.$="task";break;case 15:r.parseDirective("%%{","open_directive");break;case 16:r.parseDirective(a[s],"type_directive");break;case 17:a[s]=a[s].trim().replace(/'/g,'"'),r.parseDirective(a[s],"arg_directive");break;case 18:r.parseDirective("}%%","close_directive","journey")}},table:[{3:1,4:e,7:3,12:4,21:n},{1:[3]},t(r,[2,3],{5:6}),{3:7,4:e,7:3,12:4,21:n},{13:8,22:[1,9]},{22:[2,15]},{6:[1,10],7:18,8:11,9:[1,12],10:13,11:[1,14],12:4,17:i,18:a,19:o,21:n},{1:[2,2]},{14:19,15:[1,20],24:s},t([15,24],[2,16]),t(r,[2,8],{1:[2,1]}),t(r,[2,4]),{7:18,10:22,12:4,17:i,18:a,19:o,21:n},t(r,[2,6]),t(r,[2,7]),t(r,[2,11]),t(r,[2,12]),{20:[1,23]},t(r,[2,14]),{11:[1,24]},{16:25,23:[1,26]},{11:[2,18]},t(r,[2,5]),t(r,[2,13]),t(c,[2,9]),{14:27,24:s},{24:[2,17]},{11:[1,28]},t(c,[2,10])],defaultActions:{5:[2,15],7:[2,2],21:[2,18],26:[2,17]},parseError:function(t,e){if(!e.recoverable){var n=new Error(t);throw n.hash=e,n}this.trace(t)},parse:function(t){var e=this,n=[0],r=[],i=[null],a=[],o=this.table,s="",c=0,u=0,l=0,h=2,f=1,d=a.slice.call(arguments,1),p=Object.create(this.lexer),g={yy:{}};for(var y in this.yy)Object.prototype.hasOwnProperty.call(this.yy,y)&&(g.yy[y]=this.yy[y]);p.setInput(t,g.yy),g.yy.lexer=p,g.yy.parser=this,void 0===p.yylloc&&(p.yylloc={});var v=p.yylloc;a.push(v);var m=p.options&&p.options.ranges;function b(){var t;return"number"!=typeof(t=r.pop()||p.lex()||f)&&(t instanceof Array&&(t=(r=t).pop()),t=e.symbols_[t]||t),t}"function"==typeof g.yy.parseError?this.parseError=g.yy.parseError:this.parseError=Object.getPrototypeOf(this).parseError;for(var x,_,k,w,E,T,C,A,S,M={};;){if(k=n[n.length-1],this.defaultActions[k]?w=this.defaultActions[k]:(null==x&&(x=b()),w=o[k]&&o[k][x]),void 0===w||!w.length||!w[0]){var O="";for(T in S=[],o[k])this.terminals_[T]&&T>h&&S.push("'"+this.terminals_[T]+"'");O=p.showPosition?"Parse error on line "+(c+1)+":\n"+p.showPosition()+"\nExpecting "+S.join(", ")+", got '"+(this.terminals_[x]||x)+"'":"Parse error on line "+(c+1)+": Unexpected "+(x==f?"end of input":"'"+(this.terminals_[x]||x)+"'"),this.parseError(O,{text:p.match,token:this.terminals_[x]||x,line:p.yylineno,loc:v,expected:S})}if(w[0]instanceof Array&&w.length>1)throw new Error("Parse Error: multiple actions possible at state: "+k+", token: "+x);switch(w[0]){case 1:n.push(x),i.push(p.yytext),a.push(p.yylloc),n.push(w[1]),x=null,_?(x=_,_=null):(u=p.yyleng,s=p.yytext,c=p.yylineno,v=p.yylloc,l>0&&l--);break;case 2:if(C=this.productions_[w[1]][1],M.$=i[i.length-C],M._$={first_line:a[a.length-(C||1)].first_line,last_line:a[a.length-1].last_line,first_column:a[a.length-(C||1)].first_column,last_column:a[a.length-1].last_column},m&&(M._$.range=[a[a.length-(C||1)].range[0],a[a.length-1].range[1]]),void 0!==(E=this.performAction.apply(M,[s,u,c,g.yy,w[1],i,a].concat(d))))return E;C&&(n=n.slice(0,-1*C*2),i=i.slice(0,-1*C),a=a.slice(0,-1*C)),n.push(this.productions_[w[1]][0]),i.push(M.$),a.push(M._$),A=o[n[n.length-2]][n[n.length-1]],n.push(A);break;case 3:return!0}}return!0}},l={EOF:1,parseError:function(t,e){if(!this.yy.parser)throw new Error(t);this.yy.parser.parseError(t,e)},setInput:function(t,e){return this.yy=e||this.yy||{},this._input=t,this._more=this._backtrack=this.done=!1,this.yylineno=this.yyleng=0,this.yytext=this.matched=this.match="",this.conditionStack=["INITIAL"],this.yylloc={first_line:1,first_column:0,last_line:1,last_column:0},this.options.ranges&&(this.yylloc.range=[0,0]),this.offset=0,this},input:function(){var t=this._input[0];return this.yytext+=t,this.yyleng++,this.offset++,this.match+=t,this.matched+=t,t.match(/(?:\r\n?|\n).*/g)?(this.yylineno++,this.yylloc.last_line++):this.yylloc.last_column++,this.options.ranges&&this.yylloc.range[1]++,this._input=this._input.slice(1),t},unput:function(t){var e=t.length,n=t.split(/(?:\r\n?|\n)/g);this._input=t+this._input,this.yytext=this.yytext.substr(0,this.yytext.length-e),this.offset-=e;var r=this.match.split(/(?:\r\n?|\n)/g);this.match=this.match.substr(0,this.match.length-1),this.matched=this.matched.substr(0,this.matched.length-1),n.length-1&&(this.yylineno-=n.length-1);var i=this.yylloc.range;return this.yylloc={first_line:this.yylloc.first_line,last_line:this.yylineno+1,first_column:this.yylloc.first_column,last_column:n?(n.length===r.length?this.yylloc.first_column:0)+r[r.length-n.length].length-n[0].length:this.yylloc.first_column-e},this.options.ranges&&(this.yylloc.range=[i[0],i[0]+this.yyleng-e]),this.yyleng=this.yytext.length,this},more:function(){return this._more=!0,this},reject:function(){return this.options.backtrack_lexer?(this._backtrack=!0,this):this.parseError("Lexical error on line "+(this.yylineno+1)+". You can only invoke reject() in the lexer when the lexer is of the backtracking persuasion (options.backtrack_lexer = true).\n"+this.showPosition(),{text:"",token:null,line:this.yylineno})},less:function(t){this.unput(this.match.slice(t))},pastInput:function(){var t=this.matched.substr(0,this.matched.length-this.match.length);return(t.length>20?"...":"")+t.substr(-20).replace(/\n/g,"")},upcomingInput:function(){var t=this.match;return t.length<20&&(t+=this._input.substr(0,20-t.length)),(t.substr(0,20)+(t.length>20?"...":"")).replace(/\n/g,"")},showPosition:function(){var t=this.pastInput(),e=new Array(t.length+1).join("-");return t+this.upcomingInput()+"\n"+e+"^"},test_match:function(t,e){var n,r,i;if(this.options.backtrack_lexer&&(i={yylineno:this.yylineno,yylloc:{first_line:this.yylloc.first_line,last_line:this.last_line,first_column:this.yylloc.first_column,last_column:this.yylloc.last_column},yytext:this.yytext,match:this.match,matches:this.matches,matched:this.matched,yyleng:this.yyleng,offset:this.offset,_more:this._more,_input:this._input,yy:this.yy,conditionStack:this.conditionStack.slice(0),done:this.done},this.options.ranges&&(i.yylloc.range=this.yylloc.range.slice(0))),(r=t[0].match(/(?:\r\n?|\n).*/g))&&(this.yylineno+=r.length),this.yylloc={first_line:this.yylloc.last_line,last_line:this.yylineno+1,first_column:this.yylloc.last_column,last_column:r?r[r.length-1].length-r[r.length-1].match(/\r?\n?/)[0].length:this.yylloc.last_column+t[0].length},this.yytext+=t[0],this.match+=t[0],this.matches=t,this.yyleng=this.yytext.length,this.options.ranges&&(this.yylloc.range=[this.offset,this.offset+=this.yyleng]),this._more=!1,this._backtrack=!1,this._input=this._input.slice(t[0].length),this.matched+=t[0],n=this.performAction.call(this,this.yy,this,e,this.conditionStack[this.conditionStack.length-1]),this.done&&this._input&&(this.done=!1),n)return n;if(this._backtrack){for(var a in i)this[a]=i[a];return!1}return!1},next:function(){if(this.done)return this.EOF;var t,e,n,r;this._input||(this.done=!0),this._more||(this.yytext="",this.match="");for(var i=this._currentRules(),a=0;a<i.length;a++)if((n=this._input.match(this.rules[i[a]]))&&(!e||n[0].length>e[0].length)){if(e=n,r=a,this.options.backtrack_lexer){if(!1!==(t=this.test_match(n,i[a])))return t;if(this._backtrack){e=!1;continue}return!1}if(!this.options.flex)break}return e?!1!==(t=this.test_match(e,i[r]))&&t:""===this._input?this.EOF:this.parseError("Lexical error on line "+(this.yylineno+1)+". Unrecognized text.\n"+this.showPosition(),{text:"",token:null,line:this.yylineno})},lex:function(){var t=this.next();return t||this.lex()},begin:function(t){this.conditionStack.push(t)},popState:function(){return this.conditionStack.length-1>0?this.conditionStack.pop():this.conditionStack[0]},_currentRules:function(){return this.conditionStack.length&&this.conditionStack[this.conditionStack.length-1]?this.conditions[this.conditionStack[this.conditionStack.length-1]].rules:this.conditions.INITIAL.rules},topState:function(t){return(t=this.conditionStack.length-1-Math.abs(t||0))>=0?this.conditionStack[t]:"INITIAL"},pushState:function(t){this.begin(t)},stateStackSize:function(){return this.conditionStack.length},options:{"case-insensitive":!0},performAction:function(t,e,n,r){switch(n){case 0:return this.begin("open_directive"),21;case 1:return this.begin("type_directive"),22;case 2:return this.popState(),this.begin("arg_directive"),15;case 3:return this.popState(),this.popState(),24;case 4:return 23;case 5:case 6:break;case 7:return 11;case 8:case 9:break;case 10:return 4;case 11:return 17;case 12:return 18;case 13:return 19;case 14:return 20;case 15:return 15;case 16:return 6;case 17:return"INVALID"}},rules:[/^(?:%%\{)/i,/^(?:((?:(?!\}%%)[^:.])*))/i,/^(?::)/i,/^(?:\}%%)/i,/^(?:((?:(?!\}%%).|\n)*))/i,/^(?:%(?!\{)[^\n]*)/i,/^(?:[^\}]%%[^\n]*)/i,/^(?:[\n]+)/i,/^(?:\s+)/i,/^(?:#[^\n]*)/i,/^(?:journey\b)/i,/^(?:title\s[^#\n;]+)/i,/^(?:section\s[^#:\n;]+)/i,/^(?:[^#:\n;]+)/i,/^(?::[^#\n;]+)/i,/^(?::)/i,/^(?:$)/i,/^(?:.)/i],conditions:{open_directive:{rules:[1],inclusive:!1},type_directive:{rules:[2,3],inclusive:!1},arg_directive:{rules:[3,4],inclusive:!1},INITIAL:{rules:[0,5,6,7,8,9,10,11,12,13,14,15,16,17],inclusive:!0}}};function h(){this.yy={}}return u.lexer=l,h.prototype=u,u.Parser=h,new h}();e.parser=i,e.Parser=i.Parser,e.parse=function(){return i.parse.apply(i,arguments)},e.main=function(r){r[1]||(console.log("Usage: "+r[0]+" FILE"),t.exit(1));var i=n(19).readFileSync(n(20).normalize(r[1]),"utf8");return e.parser.parse(i)},n.c[n.s]===r&&e.main(t.argv.slice(1))}).call(this,n(14),n(7)(t))},function(t,e,n){"use strict";Object.defineProperty(e,"__esModule",{value:!0});var r=n(9),i=n(15);e.default=function(t,e){return r.default.lang.round(i.default.parse(t)[e])}},function(t,e,n){var r=n(112),i=n(82),a=n(24);t.exports=function(t){return a(t)?r(t):i(t)}},function(t,e,n){var r;if(!r)try{r=n(0)}catch(t){}r||(r=window.d3),t.exports=r},function(t,e,n){"use strict";Object.defineProperty(e,"__esModule",{value:!0});var r=n(9),i=n(15);e.default=function(t,e,n){var a=i.default.parse(t),o=a[e],s=r.default.channel.clamp[e](o+n);return o!==s&&(a[e]=s),i.default.stringify(a)}},function(t,e,n){var r=n(210),i=n(216);t.exports=function(t,e){var n=i(t,e);return r(n)?n:void 0}},function(t,e,n){var r=n(38),i=n(212),a=n(213),o=r?r.toStringTag:void 0;t.exports=function(t){return null==t?void 0===t?"[object Undefined]":"[object Null]":o&&o in Object(t)?i(t):a(t)}},function(t,e){t.exports=function(t){return t}},function(t,e){t.exports=function(t,e){return t===e||t!=t&&e!=e}},function(t,e,n){var r=n(34),i=n(11);t.exports=function(t){if(!i(t))return!1;var e=r(t);return"[object Function]"==e||"[object GeneratorFunction]"==e||"[object AsyncFunction]"==e||"[object Proxy]"==e}},function(t,e,n){var r=n(16).Symbol;t.exports=r},function(t,e,n){(function(t){var r=n(16),i=n(232),a=e&&!e.nodeType&&e,o=a&&"object"==typeof t&&t&&!t.nodeType&&t,s=o&&o.exports===a?r.Buffer:void 0,c=(s?s.isBuffer:void 0)||i;t.exports=c}).call(this,n(7)(t))},function(t,e,n){var r=n(112),i=n(236),a=n(24);t.exports=function(t){return a(t)?r(t,!0):i(t)}},function(t,e,n){var r=n(241),i=n(77),a=n(242),o=n(121),s=n(243),c=n(34),u=n(110),l=u(r),h=u(i),f=u(a),d=u(o),p=u(s),g=c;(r&&"[object DataView]"!=g(new r(new ArrayBuffer(1)))||i&&"[object Map]"!=g(new i)||a&&"[object Promise]"!=g(a.resolve())||o&&"[object Set]"!=g(new o)||s&&"[object WeakMap]"!=g(new s))&&(g=function(t){var e=c(t),n="[object Object]"==e?t.constructor:void 0,r=n?u(n):"";if(r)switch(r){case l:return"[object DataView]";case h:return"[object Map]";case f:return"[object Promise]";case d:return"[object Set]";case p:return"[object WeakMap]"}return e}),t.exports=g},function(t,e,n){var r=n(34),i=n(21);t.exports=function(t){return"symbol"==typeof t||i(t)&&"[object Symbol]"==r(t)}},function(t,e,n){var r;try{r={defaults:n(154),each:n(87),isFunction:n(37),isPlainObject:n(158),pick:n(161),has:n(93),range:n(162),uniqueId:n(163)}}catch(t){}r||(r=window._),t.exports=r},function(t){t.exports=JSON.parse('{"name":"mermaid","version":"8.9.0","description":"Markdownish syntax for generating flowcharts, sequence diagrams, class diagrams, gantt charts and git graphs.","main":"dist/mermaid.core.js","keywords":["diagram","markdown","flowchart","sequence diagram","gantt","class diagram","git graph"],"scripts":{"build:development":"webpack --progress --colors","build:production":"yarn build:development -p --config webpack.config.prod.babel.js","build":"yarn build:development && yarn build:production","postbuild":"documentation build src/mermaidAPI.js src/config.js --shallow -f md --markdown-toc false > docs/Setup.md","build:watch":"yarn build --watch","minify":"minify ./dist/mermaid.js > ./dist/mermaid.min.js","release":"yarn build","lint":"eslint src","e2e:depr":"yarn lint && jest e2e --config e2e/jest.config.js","cypress":"percy exec -- cypress run","e2e":"start-server-and-test dev http://localhost:9000/ cypress","e2e-upd":"yarn lint && jest e2e -u --config e2e/jest.config.js","dev":"webpack-dev-server --config webpack.config.e2e.js","test":"yarn lint && jest src/.*","test:watch":"jest --watch src","prepublishOnly":"yarn build && yarn test","prepare":"yarn build"},"repository":{"type":"git","url":"https://github.com/knsv/mermaid"},"author":"Knut Sveidqvist","license":"MIT","standard":{"ignore":["**/parser/*.js","dist/**/*.js","cypress/**/*.js"],"globals":["page"]},"dependencies":{"@braintree/sanitize-url":"^3.1.0","d3":"^5.7.0","dagre":"^0.8.4","dagre-d3":"^0.6.4","entity-decode":"^2.0.2","graphlib":"^2.1.7","he":"^1.2.0","khroma":"^1.1.0","minify":"^4.1.1","moment-mini":"^2.22.1","stylis":"^3.5.2"},"devDependencies":{"@babel/core":"^7.2.2","@babel/preset-env":"^7.8.4","@babel/register":"^7.0.0","@percy/cypress":"*","babel-core":"7.0.0-bridge.0","babel-eslint":"^10.1.0","babel-jest":"^24.9.0","babel-loader":"^8.0.4","coveralls":"^3.0.2","css-loader":"^2.0.1","css-to-string-loader":"^0.1.3","cypress":"4.0.1","documentation":"^12.0.1","eslint":"^6.3.0","eslint-config-prettier":"^6.3.0","eslint-plugin-prettier":"^3.1.0","husky":"^1.2.1","identity-obj-proxy":"^3.0.0","jest":"^24.9.0","jison":"^0.4.18","moment":"^2.23.0","node-sass":"^4.12.0","prettier":"^1.18.2","puppeteer":"^1.17.0","sass-loader":"^7.1.0","start-server-and-test":"^1.10.6","terser-webpack-plugin":"^2.2.2","webpack":"^4.41.2","webpack-bundle-analyzer":"^3.7.0","webpack-cli":"^3.1.2","webpack-dev-server":"^3.4.1","webpack-node-externals":"^1.7.2","yarn-upgrade-all":"^0.5.0"},"files":["dist"],"yarn-upgrade-all":{"ignore":["babel-core"]},"sideEffects":["**/*.css","**/*.scss"],"husky":{"hooks":{"pre-push":"yarn test"}}}')},function(t,e,n){"use strict";Object.defineProperty(e,"__esModule",{value:!0});var r=new(n(176).default)({r:0,g:0,b:0,a:0},"transparent");e.default=r},function(t,e,n){var r=n(58),i=n(59);t.exports=function(t,e,n,a){var o=!n;n||(n={});for(var s=-1,c=e.length;++s<c;){var u=e[s],l=a?a(n[u],t[u],u,n,t):void 0;void 0===l&&(l=t[u]),o?i(n,u,l):r(n,u,l)}return n}},function(t,e,n){var r=n(231),i=n(21),a=Object.prototype,o=a.hasOwnProperty,s=a.propertyIsEnumerable,c=r(function(){return arguments}())?r:function(t){return i(t)&&o.call(t,"callee")&&!s.call(t,"callee")};t.exports=c},function(t,e,n){var r=n(233),i=n(61),a=n(81),o=a&&a.isTypedArray,s=o?i(o):r;t.exports=s},function(t,e,n){var r=n(42);t.exports=function(t){if("string"==typeof t||r(t))return t;var e=t+"";return"0"==e&&1/t==-1/0?"-0":e}},function(t,e,n){var r=n(12);t.exports=function(t,e){var n=t.append("foreignObject").attr("width","100000"),i=n.append("xhtml:div");i.attr("xmlns","http://www.w3.org/1999/xhtml");var a=e.label;switch(typeof a){case"function":i.insert(a);break;case"object":i.insert((function(){return a}));break;default:i.html(a)}r.applyStyle(i,e.labelStyle),i.style("display","inline-block"),i.style("white-space","nowrap");var o=i.node().getBoundingClientRect();return n.attr("width",o.width).attr("height",o.height),n}},function(t,e,n){"use strict";Object.defineProperty(e,"__esModule",{value:!0});var r=n(9),i=n(45),a=n(15),o=n(52);e.default=function(t,e,n,s){if(void 0===n&&(n=0),void 0===s&&(s=1),"number"!=typeof t)return o.default(t,{a:e});var c=i.default.set({r:r.default.channel.clamp.r(t),g:r.default.channel.clamp.g(e),b:r.default.channel.clamp.b(n),a:r.default.channel.clamp.a(s)});return a.default.stringify(c)}},function(t,e,n){"use strict";Object.defineProperty(e,"__esModule",{value:!0});var r=n(9),i=n(15);e.default=function(t,e){var n=i.default.parse(t);for(var a in e)n[a]=r.default.channel.clamp[a](e[a]);return i.default.stringify(n)}},function(t,e,n){var r=n(54),i=n(205),a=n(206),o=n(207),s=n(208),c=n(209);function u(t){var e=this.__data__=new r(t);this.size=e.size}u.prototype.clear=i,u.prototype.delete=a,u.prototype.get=o,u.prototype.has=s,u.prototype.set=c,t.exports=u},function(t,e,n){var r=n(200),i=n(201),a=n(202),o=n(203),s=n(204);function c(t){var e=-1,n=null==t?0:t.length;for(this.clear();++e<n;){var r=t[e];this.set(r[0],r[1])}}c.prototype.clear=r,c.prototype.delete=i,c.prototype.get=a,c.prototype.has=o,c.prototype.set=s,t.exports=c},function(t,e,n){var r=n(36);t.exports=function(t,e){for(var n=t.length;n--;)if(r(t[n][0],e))return n;return-1}},function(t,e,n){var r=n(33)(Object,"create");t.exports=r},function(t,e,n){var r=n(225);t.exports=function(t,e){var n=t.__data__;return r(e)?n["string"==typeof e?"string":"hash"]:n.map}},function(t,e,n){var r=n(59),i=n(36),a=Object.prototype.hasOwnProperty;t.exports=function(t,e,n){var o=t[e];a.call(t,e)&&i(o,n)&&(void 0!==n||e in t)||r(t,e,n)}},function(t,e,n){var r=n(111);t.exports=function(t,e,n){"__proto__"==e&&r?r(t,e,{configurable:!0,enumerable:!0,value:n,writable:!0}):t[e]=n}},function(t,e){var n=/^(?:0|[1-9]\d*)$/;t.exports=function(t,e){var r=typeof t;return!!(e=null==e?9007199254740991:e)&&("number"==r||"symbol"!=r&&n.test(t))&&t>-1&&t%1==0&&t<e}},function(t,e){t.exports=function(t){return function(e){return t(e)}}},function(t,e){var n=Object.prototype;t.exports=function(t){var e=t&&t.constructor;return t===("function"==typeof e&&e.prototype||n)}},function(t,e,n){var r=n(113)(Object.getPrototypeOf,Object);t.exports=r},function(t,e,n){var r=n(88),i=n(254)(r);t.exports=i},function(t,e,n){var r=n(5),i=n(92),a=n(268),o=n(135);t.exports=function(t,e){return r(t)?t:i(t,e)?[t]:a(o(t))}},function(t,e){t.exports=function(t,e){for(var n=-1,r=null==t?0:t.length,i=Array(r);++n<r;)i[n]=e(t[n],n,t);return i}},function(t,e,n){var r=n(35),i=n(143),a=n(144);t.exports=function(t,e){return a(i(t,e,r),t+"")}},function(t,e,n){var r=n(36),i=n(24),a=n(60),o=n(11);t.exports=function(t,e,n){if(!o(n))return!1;var s=typeof e;return!!("number"==s?i(n)&&a(e,n.length):"string"==s&&e in n)&&r(n[e],t)}},function(t,e,n){"use strict";var r=n(4);t.exports={longestPath:function(t){var e={};r.forEach(t.sources(),(function n(i){var a=t.node(i);if(r.has(e,i))return a.rank;e[i]=!0;var o=r.min(r.map(t.outEdges(i),(function(e){return n(e.w)-t.edge(e).minlen})));return o!==Number.POSITIVE_INFINITY&&null!=o||(o=0),a.rank=o}))},slack:function(t,e){return t.node(e.w).rank-t.node(e.v).rank-t.edge(e).minlen}}},function(t,e,n){"use strict";var r=/^(%20|\s)*(javascript|data)/im,i=/[^\x20-\x7E]/gim,a=/^([^:]+):/gm,o=[".","/"];t.exports={sanitizeUrl:function(t){if(!t)return"about:blank";var e,n,s=t.replace(i,"").trim();return function(t){return o.indexOf(t[0])>-1}(s)?s:(n=s.match(a))?(e=n[0],r.test(e)?"about:blank":s):"about:blank"}}},function(t,e,n){(function(t,r){var i=function(){var t=function(t,e,n,r){for(n=n||{},r=t.length;r--;n[t[r]]=e);return n},e=[2,3],n=[1,7],r=[7,12,15,17,19,20,21],i=[7,11,12,15,17,19,20,21],a=[2,20],o=[1,32],s={trace:function(){},yy:{},symbols_:{error:2,start:3,GG:4,":":5,document:6,EOF:7,DIR:8,options:9,body:10,OPT:11,NL:12,line:13,statement:14,COMMIT:15,commit_arg:16,BRANCH:17,ID:18,CHECKOUT:19,MERGE:20,RESET:21,reset_arg:22,STR:23,HEAD:24,reset_parents:25,CARET:26,$accept:0,$end:1},terminals_:{2:"error",4:"GG",5:":",7:"EOF",8:"DIR",11:"OPT",12:"NL",15:"COMMIT",17:"BRANCH",18:"ID",19:"CHECKOUT",20:"MERGE",21:"RESET",23:"STR",24:"HEAD",26:"CARET"},productions_:[0,[3,4],[3,5],[6,0],[6,2],[9,2],[9,1],[10,0],[10,2],[13,2],[13,1],[14,2],[14,2],[14,2],[14,2],[14,2],[16,0],[16,1],[22,2],[22,2],[25,0],[25,2]],performAction:function(t,e,n,r,i,a,o){var s=a.length-1;switch(i){case 1:return a[s-1];case 2:return r.setDirection(a[s-3]),a[s-1];case 4:r.setOptions(a[s-1]),this.$=a[s];break;case 5:a[s-1]+=a[s],this.$=a[s-1];break;case 7:this.$=[];break;case 8:a[s-1].push(a[s]),this.$=a[s-1];break;case 9:this.$=a[s-1];break;case 11:r.commit(a[s]);break;case 12:r.branch(a[s]);break;case 13:r.checkout(a[s]);break;case 14:r.merge(a[s]);break;case 15:r.reset(a[s]);break;case 16:this.$="";break;case 17:this.$=a[s];break;case 18:this.$=a[s-1]+":"+a[s];break;case 19:this.$=a[s-1]+":"+r.count,r.count=0;break;case 20:r.count=0;break;case 21:r.count+=1}},table:[{3:1,4:[1,2]},{1:[3]},{5:[1,3],8:[1,4]},{6:5,7:e,9:6,12:n},{5:[1,8]},{7:[1,9]},t(r,[2,7],{10:10,11:[1,11]}),t(i,[2,6]),{6:12,7:e,9:6,12:n},{1:[2,1]},{7:[2,4],12:[1,15],13:13,14:14,15:[1,16],17:[1,17],19:[1,18],20:[1,19],21:[1,20]},t(i,[2,5]),{7:[1,21]},t(r,[2,8]),{12:[1,22]},t(r,[2,10]),{12:[2,16],16:23,23:[1,24]},{18:[1,25]},{18:[1,26]},{18:[1,27]},{18:[1,30],22:28,24:[1,29]},{1:[2,2]},t(r,[2,9]),{12:[2,11]},{12:[2,17]},{12:[2,12]},{12:[2,13]},{12:[2,14]},{12:[2,15]},{12:a,25:31,26:o},{12:a,25:33,26:o},{12:[2,18]},{12:a,25:34,26:o},{12:[2,19]},{12:[2,21]}],defaultActions:{9:[2,1],21:[2,2],23:[2,11],24:[2,17],25:[2,12],26:[2,13],27:[2,14],28:[2,15],31:[2,18],33:[2,19],34:[2,21]},parseError:function(t,e){if(!e.recoverable){var n=new Error(t);throw n.hash=e,n}this.trace(t)},parse:function(t){var e=this,n=[0],r=[],i=[null],a=[],o=this.table,s="",c=0,u=0,l=0,h=2,f=1,d=a.slice.call(arguments,1),p=Object.create(this.lexer),g={yy:{}};for(var y in this.yy)Object.prototype.hasOwnProperty.call(this.yy,y)&&(g.yy[y]=this.yy[y]);p.setInput(t,g.yy),g.yy.lexer=p,g.yy.parser=this,void 0===p.yylloc&&(p.yylloc={});var v=p.yylloc;a.push(v);var m=p.options&&p.options.ranges;function b(){var t;return"number"!=typeof(t=r.pop()||p.lex()||f)&&(t instanceof Array&&(t=(r=t).pop()),t=e.symbols_[t]||t),t}"function"==typeof g.yy.parseError?this.parseError=g.yy.parseError:this.parseError=Object.getPrototypeOf(this).parseError;for(var x,_,k,w,E,T,C,A,S,M={};;){if(k=n[n.length-1],this.defaultActions[k]?w=this.defaultActions[k]:(null==x&&(x=b()),w=o[k]&&o[k][x]),void 0===w||!w.length||!w[0]){var O="";for(T in S=[],o[k])this.terminals_[T]&&T>h&&S.push("'"+this.terminals_[T]+"'");O=p.showPosition?"Parse error on line "+(c+1)+":\n"+p.showPosition()+"\nExpecting "+S.join(", ")+", got '"+(this.terminals_[x]||x)+"'":"Parse error on line "+(c+1)+": Unexpected "+(x==f?"end of input":"'"+(this.terminals_[x]||x)+"'"),this.parseError(O,{text:p.match,token:this.terminals_[x]||x,line:p.yylineno,loc:v,expected:S})}if(w[0]instanceof Array&&w.length>1)throw new Error("Parse Error: multiple actions possible at state: "+k+", token: "+x);switch(w[0]){case 1:n.push(x),i.push(p.yytext),a.push(p.yylloc),n.push(w[1]),x=null,_?(x=_,_=null):(u=p.yyleng,s=p.yytext,c=p.yylineno,v=p.yylloc,l>0&&l--);break;case 2:if(C=this.productions_[w[1]][1],M.$=i[i.length-C],M._$={first_line:a[a.length-(C||1)].first_line,last_line:a[a.length-1].last_line,first_column:a[a.length-(C||1)].first_column,last_column:a[a.length-1].last_column},m&&(M._$.range=[a[a.length-(C||1)].range[0],a[a.length-1].range[1]]),void 0!==(E=this.performAction.apply(M,[s,u,c,g.yy,w[1],i,a].concat(d))))return E;C&&(n=n.slice(0,-1*C*2),i=i.slice(0,-1*C),a=a.slice(0,-1*C)),n.push(this.productions_[w[1]][0]),i.push(M.$),a.push(M._$),A=o[n[n.length-2]][n[n.length-1]],n.push(A);break;case 3:return!0}}return!0}},c={EOF:1,parseError:function(t,e){if(!this.yy.parser)throw new Error(t);this.yy.parser.parseError(t,e)},setInput:function(t,e){return this.yy=e||this.yy||{},this._input=t,this._more=this._backtrack=this.done=!1,this.yylineno=this.yyleng=0,this.yytext=this.matched=this.match="",this.conditionStack=["INITIAL"],this.yylloc={first_line:1,first_column:0,last_line:1,last_column:0},this.options.ranges&&(this.yylloc.range=[0,0]),this.offset=0,this},input:function(){var t=this._input[0];return this.yytext+=t,this.yyleng++,this.offset++,this.match+=t,this.matched+=t,t.match(/(?:\r\n?|\n).*/g)?(this.yylineno++,this.yylloc.last_line++):this.yylloc.last_column++,this.options.ranges&&this.yylloc.range[1]++,this._input=this._input.slice(1),t},unput:function(t){var e=t.length,n=t.split(/(?:\r\n?|\n)/g);this._input=t+this._input,this.yytext=this.yytext.substr(0,this.yytext.length-e),this.offset-=e;var r=this.match.split(/(?:\r\n?|\n)/g);this.match=this.match.substr(0,this.match.length-1),this.matched=this.matched.substr(0,this.matched.length-1),n.length-1&&(this.yylineno-=n.length-1);var i=this.yylloc.range;return this.yylloc={first_line:this.yylloc.first_line,last_line:this.yylineno+1,first_column:this.yylloc.first_column,last_column:n?(n.length===r.length?this.yylloc.first_column:0)+r[r.length-n.length].length-n[0].length:this.yylloc.first_column-e},this.options.ranges&&(this.yylloc.range=[i[0],i[0]+this.yyleng-e]),this.yyleng=this.yytext.length,this},more:function(){return this._more=!0,this},reject:function(){return this.options.backtrack_lexer?(this._backtrack=!0,this):this.parseError("Lexical error on line "+(this.yylineno+1)+". You can only invoke reject() in the lexer when the lexer is of the backtracking persuasion (options.backtrack_lexer = true).\n"+this.showPosition(),{text:"",token:null,line:this.yylineno})},less:function(t){this.unput(this.match.slice(t))},pastInput:function(){var t=this.matched.substr(0,this.matched.length-this.match.length);return(t.length>20?"...":"")+t.substr(-20).replace(/\n/g,"")},upcomingInput:function(){var t=this.match;return t.length<20&&(t+=this._input.substr(0,20-t.length)),(t.substr(0,20)+(t.length>20?"...":"")).replace(/\n/g,"")},showPosition:function(){var t=this.pastInput(),e=new Array(t.length+1).join("-");return t+this.upcomingInput()+"\n"+e+"^"},test_match:function(t,e){var n,r,i;if(this.options.backtrack_lexer&&(i={yylineno:this.yylineno,yylloc:{first_line:this.yylloc.first_line,last_line:this.last_line,first_column:this.yylloc.first_column,last_column:this.yylloc.last_column},yytext:this.yytext,match:this.match,matches:this.matches,matched:this.matched,yyleng:this.yyleng,offset:this.offset,_more:this._more,_input:this._input,yy:this.yy,conditionStack:this.conditionStack.slice(0),done:this.done},this.options.ranges&&(i.yylloc.range=this.yylloc.range.slice(0))),(r=t[0].match(/(?:\r\n?|\n).*/g))&&(this.yylineno+=r.length),this.yylloc={first_line:this.yylloc.last_line,last_line:this.yylineno+1,first_column:this.yylloc.last_column,last_column:r?r[r.length-1].length-r[r.length-1].match(/\r?\n?/)[0].length:this.yylloc.last_column+t[0].length},this.yytext+=t[0],this.match+=t[0],this.matches=t,this.yyleng=this.yytext.length,this.options.ranges&&(this.yylloc.range=[this.offset,this.offset+=this.yyleng]),this._more=!1,this._backtrack=!1,this._input=this._input.slice(t[0].length),this.matched+=t[0],n=this.performAction.call(this,this.yy,this,e,this.conditionStack[this.conditionStack.length-1]),this.done&&this._input&&(this.done=!1),n)return n;if(this._backtrack){for(var a in i)this[a]=i[a];return!1}return!1},next:function(){if(this.done)return this.EOF;var t,e,n,r;this._input||(this.done=!0),this._more||(this.yytext="",this.match="");for(var i=this._currentRules(),a=0;a<i.length;a++)if((n=this._input.match(this.rules[i[a]]))&&(!e||n[0].length>e[0].length)){if(e=n,r=a,this.options.backtrack_lexer){if(!1!==(t=this.test_match(n,i[a])))return t;if(this._backtrack){e=!1;continue}return!1}if(!this.options.flex)break}return e?!1!==(t=this.test_match(e,i[r]))&&t:""===this._input?this.EOF:this.parseError("Lexical error on line "+(this.yylineno+1)+". Unrecognized text.\n"+this.showPosition(),{text:"",token:null,line:this.yylineno})},lex:function(){var t=this.next();return t||this.lex()},begin:function(t){this.conditionStack.push(t)},popState:function(){return this.conditionStack.length-1>0?this.conditionStack.pop():this.conditionStack[0]},_currentRules:function(){return this.conditionStack.length&&this.conditionStack[this.conditionStack.length-1]?this.conditions[this.conditionStack[this.conditionStack.length-1]].rules:this.conditions.INITIAL.rules},topState:function(t){return(t=this.conditionStack.length-1-Math.abs(t||0))>=0?this.conditionStack[t]:"INITIAL"},pushState:function(t){this.begin(t)},stateStackSize:function(){return this.conditionStack.length},options:{"case-insensitive":!0},performAction:function(t,e,n,r){switch(n){case 0:return 12;case 1:case 2:case 3:break;case 4:return 4;case 5:return 15;case 6:return 17;case 7:return 20;case 8:return 21;case 9:return 19;case 10:case 11:return 8;case 12:return 5;case 13:return 26;case 14:this.begin("options");break;case 15:this.popState();break;case 16:return 11;case 17:this.begin("string");break;case 18:this.popState();break;case 19:return 23;case 20:return 18;case 21:return 7}},rules:[/^(?:(\r?\n)+)/i,/^(?:\s+)/i,/^(?:#[^\n]*)/i,/^(?:%[^\n]*)/i,/^(?:gitGraph\b)/i,/^(?:commit\b)/i,/^(?:branch\b)/i,/^(?:merge\b)/i,/^(?:reset\b)/i,/^(?:checkout\b)/i,/^(?:LR\b)/i,/^(?:BT\b)/i,/^(?::)/i,/^(?:\^)/i,/^(?:options\r?\n)/i,/^(?:end\r?\n)/i,/^(?:[^\n]+\r?\n)/i,/^(?:["])/i,/^(?:["])/i,/^(?:[^"]*)/i,/^(?:[a-zA-Z][-_\.a-zA-Z0-9]*[-_a-zA-Z0-9])/i,/^(?:$)/i],conditions:{options:{rules:[15,16],inclusive:!1},string:{rules:[18,19],inclusive:!1},INITIAL:{rules:[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,17,20,21],inclusive:!0}}};function u(){this.yy={}}return s.lexer=c,u.prototype=s,s.Parser=u,new u}();e.parser=i,e.Parser=i.Parser,e.parse=function(){return i.parse.apply(i,arguments)},e.main=function(r){r[1]||(console.log("Usage: "+r[0]+" FILE"),t.exit(1));var i=n(19).readFileSync(n(20).normalize(r[1]),"utf8");return e.parser.parse(i)},n.c[n.s]===r&&e.main(t.argv.slice(1))}).call(this,n(14),n(7)(t))},function(t,e,n){(function(t,r){var i=function(){var t=function(t,e,n,r){for(n=n||{},r=t.length;r--;n[t[r]]=e);return n},e=[6,9,10],n={trace:function(){},yy:{},symbols_:{error:2,start:3,info:4,document:5,EOF:6,line:7,statement:8,NL:9,showInfo:10,$accept:0,$end:1},terminals_:{2:"error",4:"info",6:"EOF",9:"NL",10:"showInfo"},productions_:[0,[3,3],[5,0],[5,2],[7,1],[7,1],[8,1]],performAction:function(t,e,n,r,i,a,o){a.length;switch(i){case 1:return r;case 4:break;case 6:r.setInfo(!0)}},table:[{3:1,4:[1,2]},{1:[3]},t(e,[2,2],{5:3}),{6:[1,4],7:5,8:6,9:[1,7],10:[1,8]},{1:[2,1]},t(e,[2,3]),t(e,[2,4]),t(e,[2,5]),t(e,[2,6])],defaultActions:{4:[2,1]},parseError:function(t,e){if(!e.recoverable){var n=new Error(t);throw n.hash=e,n}this.trace(t)},parse:function(t){var e=this,n=[0],r=[],i=[null],a=[],o=this.table,s="",c=0,u=0,l=0,h=2,f=1,d=a.slice.call(arguments,1),p=Object.create(this.lexer),g={yy:{}};for(var y in this.yy)Object.prototype.hasOwnProperty.call(this.yy,y)&&(g.yy[y]=this.yy[y]);p.setInput(t,g.yy),g.yy.lexer=p,g.yy.parser=this,void 0===p.yylloc&&(p.yylloc={});var v=p.yylloc;a.push(v);var m=p.options&&p.options.ranges;function b(){var t;return"number"!=typeof(t=r.pop()||p.lex()||f)&&(t instanceof Array&&(t=(r=t).pop()),t=e.symbols_[t]||t),t}"function"==typeof g.yy.parseError?this.parseError=g.yy.parseError:this.parseError=Object.getPrototypeOf(this).parseError;for(var x,_,k,w,E,T,C,A,S,M={};;){if(k=n[n.length-1],this.defaultActions[k]?w=this.defaultActions[k]:(null==x&&(x=b()),w=o[k]&&o[k][x]),void 0===w||!w.length||!w[0]){var O="";for(T in S=[],o[k])this.terminals_[T]&&T>h&&S.push("'"+this.terminals_[T]+"'");O=p.showPosition?"Parse error on line "+(c+1)+":\n"+p.showPosition()+"\nExpecting "+S.join(", ")+", got '"+(this.terminals_[x]||x)+"'":"Parse error on line "+(c+1)+": Unexpected "+(x==f?"end of input":"'"+(this.terminals_[x]||x)+"'"),this.parseError(O,{text:p.match,token:this.terminals_[x]||x,line:p.yylineno,loc:v,expected:S})}if(w[0]instanceof Array&&w.length>1)throw new Error("Parse Error: multiple actions possible at state: "+k+", token: "+x);switch(w[0]){case 1:n.push(x),i.push(p.yytext),a.push(p.yylloc),n.push(w[1]),x=null,_?(x=_,_=null):(u=p.yyleng,s=p.yytext,c=p.yylineno,v=p.yylloc,l>0&&l--);break;case 2:if(C=this.productions_[w[1]][1],M.$=i[i.length-C],M._$={first_line:a[a.length-(C||1)].first_line,last_line:a[a.length-1].last_line,first_column:a[a.length-(C||1)].first_column,last_column:a[a.length-1].last_column},m&&(M._$.range=[a[a.length-(C||1)].range[0],a[a.length-1].range[1]]),void 0!==(E=this.performAction.apply(M,[s,u,c,g.yy,w[1],i,a].concat(d))))return E;C&&(n=n.slice(0,-1*C*2),i=i.slice(0,-1*C),a=a.slice(0,-1*C)),n.push(this.productions_[w[1]][0]),i.push(M.$),a.push(M._$),A=o[n[n.length-2]][n[n.length-1]],n.push(A);break;case 3:return!0}}return!0}},r={EOF:1,parseError:function(t,e){if(!this.yy.parser)throw new Error(t);this.yy.parser.parseError(t,e)},setInput:function(t,e){return this.yy=e||this.yy||{},this._input=t,this._more=this._backtrack=this.done=!1,this.yylineno=this.yyleng=0,this.yytext=this.matched=this.match="",this.conditionStack=["INITIAL"],this.yylloc={first_line:1,first_column:0,last_line:1,last_column:0},this.options.ranges&&(this.yylloc.range=[0,0]),this.offset=0,this},input:function(){var t=this._input[0];return this.yytext+=t,this.yyleng++,this.offset++,this.match+=t,this.matched+=t,t.match(/(?:\r\n?|\n).*/g)?(this.yylineno++,this.yylloc.last_line++):this.yylloc.last_column++,this.options.ranges&&this.yylloc.range[1]++,this._input=this._input.slice(1),t},unput:function(t){var e=t.length,n=t.split(/(?:\r\n?|\n)/g);this._input=t+this._input,this.yytext=this.yytext.substr(0,this.yytext.length-e),this.offset-=e;var r=this.match.split(/(?:\r\n?|\n)/g);this.match=this.match.substr(0,this.match.length-1),this.matched=this.matched.substr(0,this.matched.length-1),n.length-1&&(this.yylineno-=n.length-1);var i=this.yylloc.range;return this.yylloc={first_line:this.yylloc.first_line,last_line:this.yylineno+1,first_column:this.yylloc.first_column,last_column:n?(n.length===r.length?this.yylloc.first_column:0)+r[r.length-n.length].length-n[0].length:this.yylloc.first_column-e},this.options.ranges&&(this.yylloc.range=[i[0],i[0]+this.yyleng-e]),this.yyleng=this.yytext.length,this},more:function(){return this._more=!0,this},reject:function(){return this.options.backtrack_lexer?(this._backtrack=!0,this):this.parseError("Lexical error on line "+(this.yylineno+1)+". You can only invoke reject() in the lexer when the lexer is of the backtracking persuasion (options.backtrack_lexer = true).\n"+this.showPosition(),{text:"",token:null,line:this.yylineno})},less:function(t){this.unput(this.match.slice(t))},pastInput:function(){var t=this.matched.substr(0,this.matched.length-this.match.length);return(t.length>20?"...":"")+t.substr(-20).replace(/\n/g,"")},upcomingInput:function(){var t=this.match;return t.length<20&&(t+=this._input.substr(0,20-t.length)),(t.substr(0,20)+(t.length>20?"...":"")).replace(/\n/g,"")},showPosition:function(){var t=this.pastInput(),e=new Array(t.length+1).join("-");return t+this.upcomingInput()+"\n"+e+"^"},test_match:function(t,e){var n,r,i;if(this.options.backtrack_lexer&&(i={yylineno:this.yylineno,yylloc:{first_line:this.yylloc.first_line,last_line:this.last_line,first_column:this.yylloc.first_column,last_column:this.yylloc.last_column},yytext:this.yytext,match:this.match,matches:this.matches,matched:this.matched,yyleng:this.yyleng,offset:this.offset,_more:this._more,_input:this._input,yy:this.yy,conditionStack:this.conditionStack.slice(0),done:this.done},this.options.ranges&&(i.yylloc.range=this.yylloc.range.slice(0))),(r=t[0].match(/(?:\r\n?|\n).*/g))&&(this.yylineno+=r.length),this.yylloc={first_line:this.yylloc.last_line,last_line:this.yylineno+1,first_column:this.yylloc.last_column,last_column:r?r[r.length-1].length-r[r.length-1].match(/\r?\n?/)[0].length:this.yylloc.last_column+t[0].length},this.yytext+=t[0],this.match+=t[0],this.matches=t,this.yyleng=this.yytext.length,this.options.ranges&&(this.yylloc.range=[this.offset,this.offset+=this.yyleng]),this._more=!1,this._backtrack=!1,this._input=this._input.slice(t[0].length),this.matched+=t[0],n=this.performAction.call(this,this.yy,this,e,this.conditionStack[this.conditionStack.length-1]),this.done&&this._input&&(this.done=!1),n)return n;if(this._backtrack){for(var a in i)this[a]=i[a];return!1}return!1},next:function(){if(this.done)return this.EOF;var t,e,n,r;this._input||(this.done=!0),this._more||(this.yytext="",this.match="");for(var i=this._currentRules(),a=0;a<i.length;a++)if((n=this._input.match(this.rules[i[a]]))&&(!e||n[0].length>e[0].length)){if(e=n,r=a,this.options.backtrack_lexer){if(!1!==(t=this.test_match(n,i[a])))return t;if(this._backtrack){e=!1;continue}return!1}if(!this.options.flex)break}return e?!1!==(t=this.test_match(e,i[r]))&&t:""===this._input?this.EOF:this.parseError("Lexical error on line "+(this.yylineno+1)+". Unrecognized text.\n"+this.showPosition(),{text:"",token:null,line:this.yylineno})},lex:function(){var t=this.next();return t||this.lex()},begin:function(t){this.conditionStack.push(t)},popState:function(){return this.conditionStack.length-1>0?this.conditionStack.pop():this.conditionStack[0]},_currentRules:function(){return this.conditionStack.length&&this.conditionStack[this.conditionStack.length-1]?this.conditions[this.conditionStack[this.conditionStack.length-1]].rules:this.conditions.INITIAL.rules},topState:function(t){return(t=this.conditionStack.length-1-Math.abs(t||0))>=0?this.conditionStack[t]:"INITIAL"},pushState:function(t){this.begin(t)},stateStackSize:function(){return this.conditionStack.length},options:{"case-insensitive":!0},performAction:function(t,e,n,r){switch(n){case 0:return 4;case 1:return 9;case 2:return"space";case 3:return 10;case 4:return 6;case 5:return"TXT"}},rules:[/^(?:info\b)/i,/^(?:[\s\n\r]+)/i,/^(?:[\s]+)/i,/^(?:showInfo\b)/i,/^(?:$)/i,/^(?:.)/i],conditions:{INITIAL:{rules:[0,1,2,3,4,5],inclusive:!0}}};function i(){this.yy={}}return n.lexer=r,i.prototype=n,n.Parser=i,new i}();e.parser=i,e.Parser=i.Parser,e.parse=function(){return i.parse.apply(i,arguments)},e.main=function(r){r[1]||(console.log("Usage: "+r[0]+" FILE"),t.exit(1));var i=n(19).readFileSync(n(20).normalize(r[1]),"utf8");return e.parser.parse(i)},n.c[n.s]===r&&e.main(t.argv.slice(1))}).call(this,n(14),n(7)(t))},function(t,e,n){(function(t,r){var i=function(){var t=function(t,e,n,r){for(n=n||{},r=t.length;r--;n[t[r]]=e);return n},e=[1,4],n=[1,5],r=[1,6],i=[1,7],a=[1,9],o=[1,10,12,19,20,21,22],s=[1,6,10,12,19,20,21,22],c=[19,20,21],u=[1,22],l=[6,19,20,21,22],h={trace:function(){},yy:{},symbols_:{error:2,start:3,eol:4,directive:5,PIE:6,document:7,line:8,statement:9,txt:10,value:11,title:12,title_value:13,openDirective:14,typeDirective:15,closeDirective:16,":":17,argDirective:18,NEWLINE:19,";":20,EOF:21,open_directive:22,type_directive:23,arg_directive:24,close_directive:25,$accept:0,$end:1},terminals_:{2:"error",6:"PIE",10:"txt",11:"value",12:"title",13:"title_value",17:":",19:"NEWLINE",20:";",21:"EOF",22:"open_directive",23:"type_directive",24:"arg_directive",25:"close_directive"},productions_:[0,[3,2],[3,2],[3,2],[7,0],[7,2],[8,2],[9,0],[9,2],[9,2],[9,1],[5,3],[5,5],[4,1],[4,1],[4,1],[14,1],[15,1],[18,1],[16,1]],performAction:function(t,e,n,r,i,a,o){var s=a.length-1;switch(i){case 6:this.$=a[s-1];break;case 8:r.addSection(a[s-1],r.cleanupValue(a[s]));break;case 9:this.$=a[s].trim(),r.setTitle(this.$);break;case 16:r.parseDirective("%%{","open_directive");break;case 17:r.parseDirective(a[s],"type_directive");break;case 18:a[s]=a[s].trim().replace(/'/g,'"'),r.parseDirective(a[s],"arg_directive");break;case 19:r.parseDirective("}%%","close_directive","pie")}},table:[{3:1,4:2,5:3,6:e,14:8,19:n,20:r,21:i,22:a},{1:[3]},{3:10,4:2,5:3,6:e,14:8,19:n,20:r,21:i,22:a},{3:11,4:2,5:3,6:e,14:8,19:n,20:r,21:i,22:a},t(o,[2,4],{7:12}),t(s,[2,13]),t(s,[2,14]),t(s,[2,15]),{15:13,23:[1,14]},{23:[2,16]},{1:[2,1]},{1:[2,2]},t(c,[2,7],{14:8,8:15,9:16,5:19,1:[2,3],10:[1,17],12:[1,18],22:a}),{16:20,17:[1,21],25:u},t([17,25],[2,17]),t(o,[2,5]),{4:23,19:n,20:r,21:i},{11:[1,24]},{13:[1,25]},t(c,[2,10]),t(l,[2,11]),{18:26,24:[1,27]},t(l,[2,19]),t(o,[2,6]),t(c,[2,8]),t(c,[2,9]),{16:28,25:u},{25:[2,18]},t(l,[2,12])],defaultActions:{9:[2,16],10:[2,1],11:[2,2],27:[2,18]},parseError:function(t,e){if(!e.recoverable){var n=new Error(t);throw n.hash=e,n}this.trace(t)},parse:function(t){var e=this,n=[0],r=[],i=[null],a=[],o=this.table,s="",c=0,u=0,l=0,h=2,f=1,d=a.slice.call(arguments,1),p=Object.create(this.lexer),g={yy:{}};for(var y in this.yy)Object.prototype.hasOwnProperty.call(this.yy,y)&&(g.yy[y]=this.yy[y]);p.setInput(t,g.yy),g.yy.lexer=p,g.yy.parser=this,void 0===p.yylloc&&(p.yylloc={});var v=p.yylloc;a.push(v);var m=p.options&&p.options.ranges;function b(){var t;return"number"!=typeof(t=r.pop()||p.lex()||f)&&(t instanceof Array&&(t=(r=t).pop()),t=e.symbols_[t]||t),t}"function"==typeof g.yy.parseError?this.parseError=g.yy.parseError:this.parseError=Object.getPrototypeOf(this).parseError;for(var x,_,k,w,E,T,C,A,S,M={};;){if(k=n[n.length-1],this.defaultActions[k]?w=this.defaultActions[k]:(null==x&&(x=b()),w=o[k]&&o[k][x]),void 0===w||!w.length||!w[0]){var O="";for(T in S=[],o[k])this.terminals_[T]&&T>h&&S.push("'"+this.terminals_[T]+"'");O=p.showPosition?"Parse error on line "+(c+1)+":\n"+p.showPosition()+"\nExpecting "+S.join(", ")+", got '"+(this.terminals_[x]||x)+"'":"Parse error on line "+(c+1)+": Unexpected "+(x==f?"end of input":"'"+(this.terminals_[x]||x)+"'"),this.parseError(O,{text:p.match,token:this.terminals_[x]||x,line:p.yylineno,loc:v,expected:S})}if(w[0]instanceof Array&&w.length>1)throw new Error("Parse Error: multiple actions possible at state: "+k+", token: "+x);switch(w[0]){case 1:n.push(x),i.push(p.yytext),a.push(p.yylloc),n.push(w[1]),x=null,_?(x=_,_=null):(u=p.yyleng,s=p.yytext,c=p.yylineno,v=p.yylloc,l>0&&l--);break;case 2:if(C=this.productions_[w[1]][1],M.$=i[i.length-C],M._$={first_line:a[a.length-(C||1)].first_line,last_line:a[a.length-1].last_line,first_column:a[a.length-(C||1)].first_column,last_column:a[a.length-1].last_column},m&&(M._$.range=[a[a.length-(C||1)].range[0],a[a.length-1].range[1]]),void 0!==(E=this.performAction.apply(M,[s,u,c,g.yy,w[1],i,a].concat(d))))return E;C&&(n=n.slice(0,-1*C*2),i=i.slice(0,-1*C),a=a.slice(0,-1*C)),n.push(this.productions_[w[1]][0]),i.push(M.$),a.push(M._$),A=o[n[n.length-2]][n[n.length-1]],n.push(A);break;case 3:return!0}}return!0}},f={EOF:1,parseError:function(t,e){if(!this.yy.parser)throw new Error(t);this.yy.parser.parseError(t,e)},setInput:function(t,e){return this.yy=e||this.yy||{},this._input=t,this._more=this._backtrack=this.done=!1,this.yylineno=this.yyleng=0,this.yytext=this.matched=this.match="",this.conditionStack=["INITIAL"],this.yylloc={first_line:1,first_column:0,last_line:1,last_column:0},this.options.ranges&&(this.yylloc.range=[0,0]),this.offset=0,this},input:function(){var t=this._input[0];return this.yytext+=t,this.yyleng++,this.offset++,this.match+=t,this.matched+=t,t.match(/(?:\r\n?|\n).*/g)?(this.yylineno++,this.yylloc.last_line++):this.yylloc.last_column++,this.options.ranges&&this.yylloc.range[1]++,this._input=this._input.slice(1),t},unput:function(t){var e=t.length,n=t.split(/(?:\r\n?|\n)/g);this._input=t+this._input,this.yytext=this.yytext.substr(0,this.yytext.length-e),this.offset-=e;var r=this.match.split(/(?:\r\n?|\n)/g);this.match=this.match.substr(0,this.match.length-1),this.matched=this.matched.substr(0,this.matched.length-1),n.length-1&&(this.yylineno-=n.length-1);var i=this.yylloc.range;return this.yylloc={first_line:this.yylloc.first_line,last_line:this.yylineno+1,first_column:this.yylloc.first_column,last_column:n?(n.length===r.length?this.yylloc.first_column:0)+r[r.length-n.length].length-n[0].length:this.yylloc.first_column-e},this.options.ranges&&(this.yylloc.range=[i[0],i[0]+this.yyleng-e]),this.yyleng=this.yytext.length,this},more:function(){return this._more=!0,this},reject:function(){return this.options.backtrack_lexer?(this._backtrack=!0,this):this.parseError("Lexical error on line "+(this.yylineno+1)+". You can only invoke reject() in the lexer when the lexer is of the backtracking persuasion (options.backtrack_lexer = true).\n"+this.showPosition(),{text:"",token:null,line:this.yylineno})},less:function(t){this.unput(this.match.slice(t))},pastInput:function(){var t=this.matched.substr(0,this.matched.length-this.match.length);return(t.length>20?"...":"")+t.substr(-20).replace(/\n/g,"")},upcomingInput:function(){var t=this.match;return t.length<20&&(t+=this._input.substr(0,20-t.length)),(t.substr(0,20)+(t.length>20?"...":"")).replace(/\n/g,"")},showPosition:function(){var t=this.pastInput(),e=new Array(t.length+1).join("-");return t+this.upcomingInput()+"\n"+e+"^"},test_match:function(t,e){var n,r,i;if(this.options.backtrack_lexer&&(i={yylineno:this.yylineno,yylloc:{first_line:this.yylloc.first_line,last_line:this.last_line,first_column:this.yylloc.first_column,last_column:this.yylloc.last_column},yytext:this.yytext,match:this.match,matches:this.matches,matched:this.matched,yyleng:this.yyleng,offset:this.offset,_more:this._more,_input:this._input,yy:this.yy,conditionStack:this.conditionStack.slice(0),done:this.done},this.options.ranges&&(i.yylloc.range=this.yylloc.range.slice(0))),(r=t[0].match(/(?:\r\n?|\n).*/g))&&(this.yylineno+=r.length),this.yylloc={first_line:this.yylloc.last_line,last_line:this.yylineno+1,first_column:this.yylloc.last_column,last_column:r?r[r.length-1].length-r[r.length-1].match(/\r?\n?/)[0].length:this.yylloc.last_column+t[0].length},this.yytext+=t[0],this.match+=t[0],this.matches=t,this.yyleng=this.yytext.length,this.options.ranges&&(this.yylloc.range=[this.offset,this.offset+=this.yyleng]),this._more=!1,this._backtrack=!1,this._input=this._input.slice(t[0].length),this.matched+=t[0],n=this.performAction.call(this,this.yy,this,e,this.conditionStack[this.conditionStack.length-1]),this.done&&this._input&&(this.done=!1),n)return n;if(this._backtrack){for(var a in i)this[a]=i[a];return!1}return!1},next:function(){if(this.done)return this.EOF;var t,e,n,r;this._input||(this.done=!0),this._more||(this.yytext="",this.match="");for(var i=this._currentRules(),a=0;a<i.length;a++)if((n=this._input.match(this.rules[i[a]]))&&(!e||n[0].length>e[0].length)){if(e=n,r=a,this.options.backtrack_lexer){if(!1!==(t=this.test_match(n,i[a])))return t;if(this._backtrack){e=!1;continue}return!1}if(!this.options.flex)break}return e?!1!==(t=this.test_match(e,i[r]))&&t:""===this._input?this.EOF:this.parseError("Lexical error on line "+(this.yylineno+1)+". Unrecognized text.\n"+this.showPosition(),{text:"",token:null,line:this.yylineno})},lex:function(){var t=this.next();return t||this.lex()},begin:function(t){this.conditionStack.push(t)},popState:function(){return this.conditionStack.length-1>0?this.conditionStack.pop():this.conditionStack[0]},_currentRules:function(){return this.conditionStack.length&&this.conditionStack[this.conditionStack.length-1]?this.conditions[this.conditionStack[this.conditionStack.length-1]].rules:this.conditions.INITIAL.rules},topState:function(t){return(t=this.conditionStack.length-1-Math.abs(t||0))>=0?this.conditionStack[t]:"INITIAL"},pushState:function(t){this.begin(t)},stateStackSize:function(){return this.conditionStack.length},options:{"case-insensitive":!0},performAction:function(t,e,n,r){switch(n){case 0:return this.begin("open_directive"),22;case 1:return this.begin("type_directive"),23;case 2:return this.popState(),this.begin("arg_directive"),17;case 3:return this.popState(),this.popState(),25;case 4:return 24;case 5:case 6:break;case 7:return 19;case 8:case 9:break;case 10:return this.begin("title"),12;case 11:return this.popState(),"title_value";case 12:this.begin("string");break;case 13:this.popState();break;case 14:return"txt";case 15:return 6;case 16:return"value";case 17:return 21}},rules:[/^(?:%%\{)/i,/^(?:((?:(?!\}%%)[^:.])*))/i,/^(?::)/i,/^(?:\}%%)/i,/^(?:((?:(?!\}%%).|\n)*))/i,/^(?:%%(?!\{)[^\n]*)/i,/^(?:[^\}]%%[^\n]*)/i,/^(?:[\n\r]+)/i,/^(?:%%[^\n]*)/i,/^(?:[\s]+)/i,/^(?:title\b)/i,/^(?:(?!\n||)*[^\n]*)/i,/^(?:["])/i,/^(?:["])/i,/^(?:[^"]*)/i,/^(?:pie\b)/i,/^(?::[\s]*[\d]+(?:\.[\d]+)?)/i,/^(?:$)/i],conditions:{close_directive:{rules:[],inclusive:!1},arg_directive:{rules:[3,4],inclusive:!1},type_directive:{rules:[2,3],inclusive:!1},open_directive:{rules:[1],inclusive:!1},title:{rules:[11],inclusive:!1},string:{rules:[13,14],inclusive:!1},INITIAL:{rules:[0,5,6,7,8,9,10,12,15,16,17],inclusive:!0}}};function d(){this.yy={}}return h.lexer=f,d.prototype=h,h.Parser=d,new d}();e.parser=i,e.Parser=i.Parser,e.parse=function(){return i.parse.apply(i,arguments)},e.main=function(r){r[1]||(console.log("Usage: "+r[0]+" FILE"),t.exit(1));var i=n(19).readFileSync(n(20).normalize(r[1]),"utf8");return e.parser.parse(i)},n.c[n.s]===r&&e.main(t.argv.slice(1))}).call(this,n(14),n(7)(t))},function(t,e,n){(function(t,r){var i=function(){var t=function(t,e,n,r){for(n=n||{},r=t.length;r--;n[t[r]]=e);return n},e=[1,2],n=[1,5],r=[6,9,11,23,37],i=[1,17],a=[1,20],o=[1,25],s=[1,26],c=[1,27],u=[1,28],l=[1,37],h=[23,34,35],f=[4,6,9,11,23,37],d=[30,31,32,33],p=[22,27],g={trace:function(){},yy:{},symbols_:{error:2,start:3,ER_DIAGRAM:4,document:5,EOF:6,directive:7,line:8,SPACE:9,statement:10,NEWLINE:11,openDirective:12,typeDirective:13,closeDirective:14,":":15,argDirective:16,entityName:17,relSpec:18,role:19,BLOCK_START:20,attributes:21,BLOCK_STOP:22,ALPHANUM:23,attribute:24,attributeType:25,attributeName:26,ATTRIBUTE_WORD:27,cardinality:28,relType:29,ZERO_OR_ONE:30,ZERO_OR_MORE:31,ONE_OR_MORE:32,ONLY_ONE:33,NON_IDENTIFYING:34,IDENTIFYING:35,WORD:36,open_directive:37,type_directive:38,arg_directive:39,close_directive:40,$accept:0,$end:1},terminals_:{2:"error",4:"ER_DIAGRAM",6:"EOF",9:"SPACE",11:"NEWLINE",15:":",20:"BLOCK_START",22:"BLOCK_STOP",23:"ALPHANUM",27:"ATTRIBUTE_WORD",30:"ZERO_OR_ONE",31:"ZERO_OR_MORE",32:"ONE_OR_MORE",33:"ONLY_ONE",34:"NON_IDENTIFYING",35:"IDENTIFYING",36:"WORD",37:"open_directive",38:"type_directive",39:"arg_directive",40:"close_directive"},productions_:[0,[3,3],[3,2],[5,0],[5,2],[8,2],[8,1],[8,1],[8,1],[7,4],[7,6],[10,1],[10,5],[10,4],[10,3],[10,1],[17,1],[21,1],[21,2],[24,2],[25,1],[26,1],[18,3],[28,1],[28,1],[28,1],[28,1],[29,1],[29,1],[19,1],[19,1],[12,1],[13,1],[16,1],[14,1]],performAction:function(t,e,n,r,i,a,o){var s=a.length-1;switch(i){case 1:break;case 3:this.$=[];break;case 4:a[s-1].push(a[s]),this.$=a[s-1];break;case 5:case 6:this.$=a[s];break;case 7:case 8:this.$=[];break;case 12:r.addEntity(a[s-4]),r.addEntity(a[s-2]),r.addRelationship(a[s-4],a[s],a[s-2],a[s-3]);break;case 13:r.addEntity(a[s-3]),r.addAttributes(a[s-3],a[s-1]);break;case 14:r.addEntity(a[s-2]);break;case 15:r.addEntity(a[s]);break;case 16:this.$=a[s];break;case 17:this.$=[a[s]];break;case 18:a[s].push(a[s-1]),this.$=a[s];break;case 19:this.$={attributeType:a[s-1],attributeName:a[s]};break;case 20:case 21:this.$=a[s];break;case 22:this.$={cardA:a[s],relType:a[s-1],cardB:a[s-2]};break;case 23:this.$=r.Cardinality.ZERO_OR_ONE;break;case 24:this.$=r.Cardinality.ZERO_OR_MORE;break;case 25:this.$=r.Cardinality.ONE_OR_MORE;break;case 26:this.$=r.Cardinality.ONLY_ONE;break;case 27:this.$=r.Identification.NON_IDENTIFYING;break;case 28:this.$=r.Identification.IDENTIFYING;break;case 29:this.$=a[s].replace(/"/g,"");break;case 30:this.$=a[s];break;case 31:r.parseDirective("%%{","open_directive");break;case 32:r.parseDirective(a[s],"type_directive");break;case 33:a[s]=a[s].trim().replace(/'/g,'"'),r.parseDirective(a[s],"arg_directive");break;case 34:r.parseDirective("}%%","close_directive","er")}},table:[{3:1,4:e,7:3,12:4,37:n},{1:[3]},t(r,[2,3],{5:6}),{3:7,4:e,7:3,12:4,37:n},{13:8,38:[1,9]},{38:[2,31]},{6:[1,10],7:15,8:11,9:[1,12],10:13,11:[1,14],12:4,17:16,23:i,37:n},{1:[2,2]},{14:18,15:[1,19],40:a},t([15,40],[2,32]),t(r,[2,8],{1:[2,1]}),t(r,[2,4]),{7:15,10:21,12:4,17:16,23:i,37:n},t(r,[2,6]),t(r,[2,7]),t(r,[2,11]),t(r,[2,15],{18:22,28:24,20:[1,23],30:o,31:s,32:c,33:u}),t([6,9,11,15,20,23,30,31,32,33,37],[2,16]),{11:[1,29]},{16:30,39:[1,31]},{11:[2,34]},t(r,[2,5]),{17:32,23:i},{21:33,22:[1,34],24:35,25:36,27:l},{29:38,34:[1,39],35:[1,40]},t(h,[2,23]),t(h,[2,24]),t(h,[2,25]),t(h,[2,26]),t(f,[2,9]),{14:41,40:a},{40:[2,33]},{15:[1,42]},{22:[1,43]},t(r,[2,14]),{21:44,22:[2,17],24:35,25:36,27:l},{26:45,27:[1,46]},{27:[2,20]},{28:47,30:o,31:s,32:c,33:u},t(d,[2,27]),t(d,[2,28]),{11:[1,48]},{19:49,23:[1,51],36:[1,50]},t(r,[2,13]),{22:[2,18]},t(p,[2,19]),t(p,[2,21]),{23:[2,22]},t(f,[2,10]),t(r,[2,12]),t(r,[2,29]),t(r,[2,30])],defaultActions:{5:[2,31],7:[2,2],20:[2,34],31:[2,33],37:[2,20],44:[2,18],47:[2,22]},parseError:function(t,e){if(!e.recoverable){var n=new Error(t);throw n.hash=e,n}this.trace(t)},parse:function(t){var e=this,n=[0],r=[],i=[null],a=[],o=this.table,s="",c=0,u=0,l=0,h=2,f=1,d=a.slice.call(arguments,1),p=Object.create(this.lexer),g={yy:{}};for(var y in this.yy)Object.prototype.hasOwnProperty.call(this.yy,y)&&(g.yy[y]=this.yy[y]);p.setInput(t,g.yy),g.yy.lexer=p,g.yy.parser=this,void 0===p.yylloc&&(p.yylloc={});var v=p.yylloc;a.push(v);var m=p.options&&p.options.ranges;function b(){var t;return"number"!=typeof(t=r.pop()||p.lex()||f)&&(t instanceof Array&&(t=(r=t).pop()),t=e.symbols_[t]||t),t}"function"==typeof g.yy.parseError?this.parseError=g.yy.parseError:this.parseError=Object.getPrototypeOf(this).parseError;for(var x,_,k,w,E,T,C,A,S,M={};;){if(k=n[n.length-1],this.defaultActions[k]?w=this.defaultActions[k]:(null==x&&(x=b()),w=o[k]&&o[k][x]),void 0===w||!w.length||!w[0]){var O="";for(T in S=[],o[k])this.terminals_[T]&&T>h&&S.push("'"+this.terminals_[T]+"'");O=p.showPosition?"Parse error on line "+(c+1)+":\n"+p.showPosition()+"\nExpecting "+S.join(", ")+", got '"+(this.terminals_[x]||x)+"'":"Parse error on line "+(c+1)+": Unexpected "+(x==f?"end of input":"'"+(this.terminals_[x]||x)+"'"),this.parseError(O,{text:p.match,token:this.terminals_[x]||x,line:p.yylineno,loc:v,expected:S})}if(w[0]instanceof Array&&w.length>1)throw new Error("Parse Error: multiple actions possible at state: "+k+", token: "+x);switch(w[0]){case 1:n.push(x),i.push(p.yytext),a.push(p.yylloc),n.push(w[1]),x=null,_?(x=_,_=null):(u=p.yyleng,s=p.yytext,c=p.yylineno,v=p.yylloc,l>0&&l--);break;case 2:if(C=this.productions_[w[1]][1],M.$=i[i.length-C],M._$={first_line:a[a.length-(C||1)].first_line,last_line:a[a.length-1].last_line,first_column:a[a.length-(C||1)].first_column,last_column:a[a.length-1].last_column},m&&(M._$.range=[a[a.length-(C||1)].range[0],a[a.length-1].range[1]]),void 0!==(E=this.performAction.apply(M,[s,u,c,g.yy,w[1],i,a].concat(d))))return E;C&&(n=n.slice(0,-1*C*2),i=i.slice(0,-1*C),a=a.slice(0,-1*C)),n.push(this.productions_[w[1]][0]),i.push(M.$),a.push(M._$),A=o[n[n.length-2]][n[n.length-1]],n.push(A);break;case 3:return!0}}return!0}},y={EOF:1,parseError:function(t,e){if(!this.yy.parser)throw new Error(t);this.yy.parser.parseError(t,e)},setInput:function(t,e){return this.yy=e||this.yy||{},this._input=t,this._more=this._backtrack=this.done=!1,this.yylineno=this.yyleng=0,this.yytext=this.matched=this.match="",this.conditionStack=["INITIAL"],this.yylloc={first_line:1,first_column:0,last_line:1,last_column:0},this.options.ranges&&(this.yylloc.range=[0,0]),this.offset=0,this},input:function(){var t=this._input[0];return this.yytext+=t,this.yyleng++,this.offset++,this.match+=t,this.matched+=t,t.match(/(?:\r\n?|\n).*/g)?(this.yylineno++,this.yylloc.last_line++):this.yylloc.last_column++,this.options.ranges&&this.yylloc.range[1]++,this._input=this._input.slice(1),t},unput:function(t){var e=t.length,n=t.split(/(?:\r\n?|\n)/g);this._input=t+this._input,this.yytext=this.yytext.substr(0,this.yytext.length-e),this.offset-=e;var r=this.match.split(/(?:\r\n?|\n)/g);this.match=this.match.substr(0,this.match.length-1),this.matched=this.matched.substr(0,this.matched.length-1),n.length-1&&(this.yylineno-=n.length-1);var i=this.yylloc.range;return this.yylloc={first_line:this.yylloc.first_line,last_line:this.yylineno+1,first_column:this.yylloc.first_column,last_column:n?(n.length===r.length?this.yylloc.first_column:0)+r[r.length-n.length].length-n[0].length:this.yylloc.first_column-e},this.options.ranges&&(this.yylloc.range=[i[0],i[0]+this.yyleng-e]),this.yyleng=this.yytext.length,this},more:function(){return this._more=!0,this},reject:function(){return this.options.backtrack_lexer?(this._backtrack=!0,this):this.parseError("Lexical error on line "+(this.yylineno+1)+". You can only invoke reject() in the lexer when the lexer is of the backtracking persuasion (options.backtrack_lexer = true).\n"+this.showPosition(),{text:"",token:null,line:this.yylineno})},less:function(t){this.unput(this.match.slice(t))},pastInput:function(){var t=this.matched.substr(0,this.matched.length-this.match.length);return(t.length>20?"...":"")+t.substr(-20).replace(/\n/g,"")},upcomingInput:function(){var t=this.match;return t.length<20&&(t+=this._input.substr(0,20-t.length)),(t.substr(0,20)+(t.length>20?"...":"")).replace(/\n/g,"")},showPosition:function(){var t=this.pastInput(),e=new Array(t.length+1).join("-");return t+this.upcomingInput()+"\n"+e+"^"},test_match:function(t,e){var n,r,i;if(this.options.backtrack_lexer&&(i={yylineno:this.yylineno,yylloc:{first_line:this.yylloc.first_line,last_line:this.last_line,first_column:this.yylloc.first_column,last_column:this.yylloc.last_column},yytext:this.yytext,match:this.match,matches:this.matches,matched:this.matched,yyleng:this.yyleng,offset:this.offset,_more:this._more,_input:this._input,yy:this.yy,conditionStack:this.conditionStack.slice(0),done:this.done},this.options.ranges&&(i.yylloc.range=this.yylloc.range.slice(0))),(r=t[0].match(/(?:\r\n?|\n).*/g))&&(this.yylineno+=r.length),this.yylloc={first_line:this.yylloc.last_line,last_line:this.yylineno+1,first_column:this.yylloc.last_column,last_column:r?r[r.length-1].length-r[r.length-1].match(/\r?\n?/)[0].length:this.yylloc.last_column+t[0].length},this.yytext+=t[0],this.match+=t[0],this.matches=t,this.yyleng=this.yytext.length,this.options.ranges&&(this.yylloc.range=[this.offset,this.offset+=this.yyleng]),this._more=!1,this._backtrack=!1,this._input=this._input.slice(t[0].length),this.matched+=t[0],n=this.performAction.call(this,this.yy,this,e,this.conditionStack[this.conditionStack.length-1]),this.done&&this._input&&(this.done=!1),n)return n;if(this._backtrack){for(var a in i)this[a]=i[a];return!1}return!1},next:function(){if(this.done)return this.EOF;var t,e,n,r;this._input||(this.done=!0),this._more||(this.yytext="",this.match="");for(var i=this._currentRules(),a=0;a<i.length;a++)if((n=this._input.match(this.rules[i[a]]))&&(!e||n[0].length>e[0].length)){if(e=n,r=a,this.options.backtrack_lexer){if(!1!==(t=this.test_match(n,i[a])))return t;if(this._backtrack){e=!1;continue}return!1}if(!this.options.flex)break}return e?!1!==(t=this.test_match(e,i[r]))&&t:""===this._input?this.EOF:this.parseError("Lexical error on line "+(this.yylineno+1)+". Unrecognized text.\n"+this.showPosition(),{text:"",token:null,line:this.yylineno})},lex:function(){var t=this.next();return t||this.lex()},begin:function(t){this.conditionStack.push(t)},popState:function(){return this.conditionStack.length-1>0?this.conditionStack.pop():this.conditionStack[0]},_currentRules:function(){return this.conditionStack.length&&this.conditionStack[this.conditionStack.length-1]?this.conditions[this.conditionStack[this.conditionStack.length-1]].rules:this.conditions.INITIAL.rules},topState:function(t){return(t=this.conditionStack.length-1-Math.abs(t||0))>=0?this.conditionStack[t]:"INITIAL"},pushState:function(t){this.begin(t)},stateStackSize:function(){return this.conditionStack.length},options:{"case-insensitive":!0},performAction:function(t,e,n,r){switch(n){case 0:return this.begin("open_directive"),37;case 1:return this.begin("type_directive"),38;case 2:return this.popState(),this.begin("arg_directive"),15;case 3:return this.popState(),this.popState(),40;case 4:return 39;case 5:case 6:break;case 7:return 11;case 8:break;case 9:return 9;case 10:return 36;case 11:return 4;case 12:return this.begin("block"),20;case 13:break;case 14:return 27;case 15:break;case 16:return this.popState(),22;case 17:return e.yytext[0];case 18:return 30;case 19:return 31;case 20:return 32;case 21:return 33;case 22:return 30;case 23:return 31;case 24:return 32;case 25:return 34;case 26:return 35;case 27:case 28:return 34;case 29:return 23;case 30:return e.yytext[0];case 31:return 6}},rules:[/^(?:%%\{)/i,/^(?:((?:(?!\}%%)[^:.])*))/i,/^(?::)/i,/^(?:\}%%)/i,/^(?:((?:(?!\}%%).|\n)*))/i,/^(?:%(?!\{)[^\n]*)/i,/^(?:[^\}]%%[^\n]*)/i,/^(?:[\n]+)/i,/^(?:\s+)/i,/^(?:[\s]+)/i,/^(?:"[^"]*")/i,/^(?:erDiagram\b)/i,/^(?:\{)/i,/^(?:\s+)/i,/^(?:[A-Za-z][A-Za-z0-9\-_]*)/i,/^(?:[\n]+)/i,/^(?:\})/i,/^(?:.)/i,/^(?:\|o\b)/i,/^(?:\}o\b)/i,/^(?:\}\|)/i,/^(?:\|\|)/i,/^(?:o\|)/i,/^(?:o\{)/i,/^(?:\|\{)/i,/^(?:\.\.)/i,/^(?:--)/i,/^(?:\.-)/i,/^(?:-\.)/i,/^(?:[A-Za-z][A-Za-z0-9\-_]*)/i,/^(?:.)/i,/^(?:$)/i],conditions:{open_directive:{rules:[1],inclusive:!1},type_directive:{rules:[2,3],inclusive:!1},arg_directive:{rules:[3,4],inclusive:!1},block:{rules:[13,14,15,16,17],inclusive:!1},INITIAL:{rules:[0,5,6,7,8,9,10,11,12,18,19,20,21,22,23,24,25,26,27,28,29,30,31],inclusive:!0}}};function v(){this.yy={}}return g.lexer=y,v.prototype=g,g.Parser=v,new v}();e.parser=i,e.Parser=i.Parser,e.parse=function(){return i.parse.apply(i,arguments)},e.main=function(r){r[1]||(console.log("Usage: "+r[0]+" FILE"),t.exit(1));var i=n(19).readFileSync(n(20).normalize(r[1]),"utf8");return e.parser.parse(i)},n.c[n.s]===r&&e.main(t.argv.slice(1))}).call(this,n(14),n(7)(t))},function(t,e,n){"use strict";var r;Object.defineProperty(e,"__esModule",{value:!0}),function(t){t[t.ALL=0]="ALL",t[t.RGB=1]="RGB",t[t.HSL=2]="HSL"}(r||(r={})),e.TYPE=r},function(t,e,n){"use strict";var r=n(10);t.exports=i;function i(t){this._isDirected=!r.has(t,"directed")||t.directed,this._isMultigraph=!!r.has(t,"multigraph")&&t.multigraph,this._isCompound=!!r.has(t,"compound")&&t.compound,this._label=void 0,this._defaultNodeLabelFn=r.constant(void 0),this._defaultEdgeLabelFn=r.constant(void 0),this._nodes={},this._isCompound&&(this._parent={},this._children={},this._children["\0"]={}),this._in={},this._preds={},this._out={},this._sucs={},this._edgeObjs={},this._edgeLabels={}}function a(t,e){t[e]?t[e]++:t[e]=1}function o(t,e){--t[e]||delete t[e]}function s(t,e,n,i){var a=""+e,o=""+n;if(!t&&a>o){var s=a;a=o,o=s}return a+""+o+""+(r.isUndefined(i)?"\0":i)}function c(t,e,n,r){var i=""+e,a=""+n;if(!t&&i>a){var o=i;i=a,a=o}var s={v:i,w:a};return r&&(s.name=r),s}function u(t,e){return s(t,e.v,e.w,e.name)}i.prototype._nodeCount=0,i.prototype._edgeCount=0,i.prototype.isDirected=function(){return this._isDirected},i.prototype.isMultigraph=function(){return this._isMultigraph},i.prototype.isCompound=function(){return this._isCompound},i.prototype.setGraph=function(t){return this._label=t,this},i.prototype.graph=function(){return this._label},i.prototype.setDefaultNodeLabel=function(t){return r.isFunction(t)||(t=r.constant(t)),this._defaultNodeLabelFn=t,this},i.prototype.nodeCount=function(){return this._nodeCount},i.prototype.nodes=function(){return r.keys(this._nodes)},i.prototype.sources=function(){var t=this;return r.filter(this.nodes(),(function(e){return r.isEmpty(t._in[e])}))},i.prototype.sinks=function(){var t=this;return r.filter(this.nodes(),(function(e){return r.isEmpty(t._out[e])}))},i.prototype.setNodes=function(t,e){var n=arguments,i=this;return r.each(t,(function(t){n.length>1?i.setNode(t,e):i.setNode(t)})),this},i.prototype.setNode=function(t,e){return r.has(this._nodes,t)?(arguments.length>1&&(this._nodes[t]=e),this):(this._nodes[t]=arguments.length>1?e:this._defaultNodeLabelFn(t),this._isCompound&&(this._parent[t]="\0",this._children[t]={},this._children["\0"][t]=!0),this._in[t]={},this._preds[t]={},this._out[t]={},this._sucs[t]={},++this._nodeCount,this)},i.prototype.node=function(t){return this._nodes[t]},i.prototype.hasNode=function(t){return r.has(this._nodes,t)},i.prototype.removeNode=function(t){var e=this;if(r.has(this._nodes,t)){var n=function(t){e.removeEdge(e._edgeObjs[t])};delete this._nodes[t],this._isCompound&&(this._removeFromParentsChildList(t),delete this._parent[t],r.each(this.children(t),(function(t){e.setParent(t)})),delete this._children[t]),r.each(r.keys(this._in[t]),n),delete this._in[t],delete this._preds[t],r.each(r.keys(this._out[t]),n),delete this._out[t],delete this._sucs[t],--this._nodeCount}return this},i.prototype.setParent=function(t,e){if(!this._isCompound)throw new Error("Cannot set parent in a non-compound graph");if(r.isUndefined(e))e="\0";else{for(var n=e+="";!r.isUndefined(n);n=this.parent(n))if(n===t)throw new Error("Setting "+e+" as parent of "+t+" would create a cycle");this.setNode(e)}return this.setNode(t),this._removeFromParentsChildList(t),this._parent[t]=e,this._children[e][t]=!0,this},i.prototype._removeFromParentsChildList=function(t){delete this._children[this._parent[t]][t]},i.prototype.parent=function(t){if(this._isCompound){var e=this._parent[t];if("\0"!==e)return e}},i.prototype.children=function(t){if(r.isUndefined(t)&&(t="\0"),this._isCompound){var e=this._children[t];if(e)return r.keys(e)}else{if("\0"===t)return this.nodes();if(this.hasNode(t))return[]}},i.prototype.predecessors=function(t){var e=this._preds[t];if(e)return r.keys(e)},i.prototype.successors=function(t){var e=this._sucs[t];if(e)return r.keys(e)},i.prototype.neighbors=function(t){var e=this.predecessors(t);if(e)return r.union(e,this.successors(t))},i.prototype.isLeaf=function(t){return 0===(this.isDirected()?this.successors(t):this.neighbors(t)).length},i.prototype.filterNodes=function(t){var e=new this.constructor({directed:this._isDirected,multigraph:this._isMultigraph,compound:this._isCompound});e.setGraph(this.graph());var n=this;r.each(this._nodes,(function(n,r){t(r)&&e.setNode(r,n)})),r.each(this._edgeObjs,(function(t){e.hasNode(t.v)&&e.hasNode(t.w)&&e.setEdge(t,n.edge(t))}));var i={};return this._isCompound&&r.each(e.nodes(),(function(t){e.setParent(t,function t(r){var a=n.parent(r);return void 0===a||e.hasNode(a)?(i[r]=a,a):a in i?i[a]:t(a)}(t))})),e},i.prototype.setDefaultEdgeLabel=function(t){return r.isFunction(t)||(t=r.constant(t)),this._defaultEdgeLabelFn=t,this},i.prototype.edgeCount=function(){return this._edgeCount},i.prototype.edges=function(){return r.values(this._edgeObjs)},i.prototype.setPath=function(t,e){var n=this,i=arguments;return r.reduce(t,(function(t,r){return i.length>1?n.setEdge(t,r,e):n.setEdge(t,r),r})),this},i.prototype.setEdge=function(){var t,e,n,i,o=!1,u=arguments[0];"object"==typeof u&&null!==u&&"v"in u?(t=u.v,e=u.w,n=u.name,2===arguments.length&&(i=arguments[1],o=!0)):(t=u,e=arguments[1],n=arguments[3],arguments.length>2&&(i=arguments[2],o=!0)),t=""+t,e=""+e,r.isUndefined(n)||(n=""+n);var l=s(this._isDirected,t,e,n);if(r.has(this._edgeLabels,l))return o&&(this._edgeLabels[l]=i),this;if(!r.isUndefined(n)&&!this._isMultigraph)throw new Error("Cannot set a named edge when isMultigraph = false");this.setNode(t),this.setNode(e),this._edgeLabels[l]=o?i:this._defaultEdgeLabelFn(t,e,n);var h=c(this._isDirected,t,e,n);return t=h.v,e=h.w,Object.freeze(h),this._edgeObjs[l]=h,a(this._preds[e],t),a(this._sucs[t],e),this._in[e][l]=h,this._out[t][l]=h,this._edgeCount++,this},i.prototype.edge=function(t,e,n){var r=1===arguments.length?u(this._isDirected,arguments[0]):s(this._isDirected,t,e,n);return this._edgeLabels[r]},i.prototype.hasEdge=function(t,e,n){var i=1===arguments.length?u(this._isDirected,arguments[0]):s(this._isDirected,t,e,n);return r.has(this._edgeLabels,i)},i.prototype.removeEdge=function(t,e,n){var r=1===arguments.length?u(this._isDirected,arguments[0]):s(this._isDirected,t,e,n),i=this._edgeObjs[r];return i&&(t=i.v,e=i.w,delete this._edgeLabels[r],delete this._edgeObjs[r],o(this._preds[e],t),o(this._sucs[t],e),delete this._in[e][r],delete this._out[t][r],this._edgeCount--),this},i.prototype.inEdges=function(t,e){var n=this._in[t];if(n){var i=r.values(n);return e?r.filter(i,(function(t){return t.v===e})):i}},i.prototype.outEdges=function(t,e){var n=this._out[t];if(n){var i=r.values(n);return e?r.filter(i,(function(t){return t.w===e})):i}},i.prototype.nodeEdges=function(t,e){var n=this.inEdges(t,e);if(n)return n.concat(this.outEdges(t,e))}},function(t,e,n){var r=n(33)(n(16),"Map");t.exports=r},function(t,e,n){var r=n(217),i=n(224),a=n(226),o=n(227),s=n(228);function c(t){var e=-1,n=null==t?0:t.length;for(this.clear();++e<n;){var r=t[e];this.set(r[0],r[1])}}c.prototype.clear=r,c.prototype.delete=i,c.prototype.get=a,c.prototype.has=o,c.prototype.set=s,t.exports=c},function(t,e){t.exports=function(t,e){for(var n=-1,r=null==t?0:t.length;++n<r&&!1!==e(t[n],n,t););return t}},function(t,e){t.exports=function(t){return"number"==typeof t&&t>-1&&t%1==0&&t<=9007199254740991}},function(t,e,n){(function(t){var r=n(109),i=e&&!e.nodeType&&e,a=i&&"object"==typeof t&&t&&!t.nodeType&&t,o=a&&a.exports===i&&r.process,s=function(){try{var t=a&&a.require&&a.require("util").types;return t||o&&o.binding&&o.binding("util")}catch(t){}}();t.exports=s}).call(this,n(7)(t))},function(t,e,n){var r=n(62),i=n(234),a=Object.prototype.hasOwnProperty;t.exports=function(t){if(!r(t))return i(t);var e=[];for(var n in Object(t))a.call(t,n)&&"constructor"!=n&&e.push(n);return e}},function(t,e,n){var r=n(116),i=n(117),a=Object.prototype.propertyIsEnumerable,o=Object.getOwnPropertySymbols,s=o?function(t){return null==t?[]:(t=Object(t),r(o(t),(function(e){return a.call(t,e)})))}:i;t.exports=s},function(t,e){t.exports=function(t,e){for(var n=-1,r=e.length,i=t.length;++n<r;)t[i+n]=e[n];return t}},function(t,e,n){var r=n(122);t.exports=function(t){var e=new t.constructor(t.byteLength);return new r(e).set(new r(t)),e}},function(t,e){t.exports=function(t){return function(){return t}}},function(t,e,n){t.exports=n(126)},function(t,e,n){var r=n(89),i=n(30);t.exports=function(t,e){return t&&r(t,e,i)}},function(t,e,n){var r=n(253)();t.exports=r},function(t,e){t.exports=function(t){var e=-1,n=Array(t.size);return t.forEach((function(t){n[++e]=t})),n}},function(t,e,n){var r=n(65),i=n(49);t.exports=function(t,e){for(var n=0,a=(e=r(e,t)).length;null!=t&&n<a;)t=t[i(e[n++])];return n&&n==a?t:void 0}},function(t,e,n){var r=n(5),i=n(42),a=/\.|\[(?:[^[\]]*|(["'])(?:(?!\1)[^\\]|\\.)*?\1)\]/,o=/^\w*$/;t.exports=function(t,e){if(r(t))return!1;var n=typeof t;return!("number"!=n&&"symbol"!=n&&"boolean"!=n&&null!=t&&!i(t))||(o.test(t)||!a.test(t)||null!=e&&t in Object(e))}},function(t,e,n){var r=n(275),i=n(137);t.exports=function(t,e){return null!=t&&i(t,e,r)}},function(t,e,n){var r=n(84),i=n(287);t.exports=function t(e,n,a,o,s){var c=-1,u=e.length;for(a||(a=i),s||(s=[]);++c<u;){var l=e[c];n>0&&a(l)?n>1?t(l,n-1,a,o,s):r(s,l):o||(s[s.length]=l)}return s}},function(t,e,n){var r=n(42);t.exports=function(t,e,n){for(var i=-1,a=t.length;++i<a;){var o=t[i],s=e(o);if(null!=s&&(void 0===c?s==s&&!r(s):n(s,c)))var c=s,u=o}return u}},function(t,e){t.exports=function(t,e,n,r){var i=t.x,a=t.y,o=i-r.x,s=a-r.y,c=Math.sqrt(e*e*s*s+n*n*o*o),u=Math.abs(e*n*o/c);r.x<i&&(u=-u);var l=Math.abs(e*n*s/c);r.y<a&&(l=-l);return{x:i+u,y:a+l}}},function(t,e,n){var r=n(372),i=n(50),a=n(373);t.exports=function(t,e,n){var o=e.label,s=t.append("g");"svg"===e.labelType?a(s,e):"string"!=typeof o||"html"===e.labelType?i(s,e):r(s,e);var c,u=s.node().getBBox();switch(n){case"top":c=-e.height/2;break;case"bottom":c=e.height/2-u.height;break;default:c=-u.height/2}return s.attr("transform","translate("+-u.width/2+","+c+")"),s}},function(t,e){},function(t,e,n){"use strict";Object.defineProperty(e,"__esModule",{value:!0});var r=n(9),i=n(45),a=n(178),o={re:/^#((?:[a-f0-9]{2}){2,4}|[a-f0-9]{3})$/i,parse:function(t){if(35===t.charCodeAt(0)){var e=t.match(o.re);if(e){var n=e[1],r=parseInt(n,16),a=n.length,s=a%4==0,c=a>4,u=c?1:17,l=c?8:4,h=s?0:-1,f=c?255:15;return i.default.set({r:(r>>l*(h+3)&f)*u,g:(r>>l*(h+2)&f)*u,b:(r>>l*(h+1)&f)*u,a:s?(r&f)*u/255:1},t)}}},stringify:function(t){return t.a<1?"#"+a.DEC2HEX[Math.round(t.r)]+a.DEC2HEX[Math.round(t.g)]+a.DEC2HEX[Math.round(t.b)]+r.default.unit.frac2hex(t.a):"#"+a.DEC2HEX[Math.round(t.r)]+a.DEC2HEX[Math.round(t.g)]+a.DEC2HEX[Math.round(t.b)]}};e.default=o},function(t,e,n){"use strict";Object.defineProperty(e,"__esModule",{value:!0});var r=n(9),i=n(45),a=n(15);e.default=function(t,e,n,o){void 0===o&&(o=1);var s=i.default.set({h:r.default.channel.clamp.h(t),s:r.default.channel.clamp.s(e),l:r.default.channel.clamp.l(n),a:r.default.channel.clamp.a(o)});return a.default.stringify(s)}},function(t,e,n){"use strict";Object.defineProperty(e,"__esModule",{value:!0});var r=n(29);e.default=function(t){return r.default(t,"a")}},function(t,e,n){"use strict";Object.defineProperty(e,"__esModule",{value:!0});var r=n(9),i=n(15);e.default=function(t){var e=i.default.parse(t),n=e.r,a=e.g,o=e.b,s=.2126*r.default.channel.toLinear(n)+.7152*r.default.channel.toLinear(a)+.0722*r.default.channel.toLinear(o);return r.default.lang.round(s)}},function(t,e,n){"use strict";Object.defineProperty(e,"__esModule",{value:!0});var r=n(102);e.default=function(t){return r.default(t)>=.5}},function(t,e,n){"use strict";Object.defineProperty(e,"__esModule",{value:!0});var r=n(32);e.default=function(t,e){return r.default(t,"a",e)}},function(t,e,n){"use strict";Object.defineProperty(e,"__esModule",{value:!0});var r=n(32);e.default=function(t,e){return r.default(t,"a",-e)}},function(t,e,n){"use strict";Object.defineProperty(e,"__esModule",{value:!0});var r=n(15),i=n(52);e.default=function(t,e){var n=r.default.parse(t),a={};for(var o in e)e[o]&&(a[o]=n[o]+e[o]);return i.default(t,a)}},function(t,e,n){"use strict";Object.defineProperty(e,"__esModule",{value:!0});var r=n(15),i=n(51);e.default=function(t,e,n){void 0===n&&(n=50);var a=r.default.parse(t),o=a.r,s=a.g,c=a.b,u=a.a,l=r.default.parse(e),h=l.r,f=l.g,d=l.b,p=l.a,g=n/100,y=2*g-1,v=u-p,m=((y*v==-1?y:(y+v)/(1+y*v))+1)/2,b=1-m,x=o*m+h*b,_=s*m+f*b,k=c*m+d*b,w=u*g+p*(1-g);return i.default(x,_,k,w)}},function(t,e,n){var r=n(53),i=n(79),a=n(58),o=n(229),s=n(235),c=n(114),u=n(115),l=n(238),h=n(239),f=n(119),d=n(240),p=n(41),g=n(244),y=n(245),v=n(124),m=n(5),b=n(39),x=n(249),_=n(11),k=n(251),w=n(30),E={};E["[object Arguments]"]=E["[object Array]"]=E["[object ArrayBuffer]"]=E["[object DataView]"]=E["[object Boolean]"]=E["[object Date]"]=E["[object Float32Array]"]=E["[object Float64Array]"]=E["[object Int8Array]"]=E["[object Int16Array]"]=E["[object Int32Array]"]=E["[object Map]"]=E["[object Number]"]=E["[object Object]"]=E["[object RegExp]"]=E["[object Set]"]=E["[object String]"]=E["[object Symbol]"]=E["[object Uint8Array]"]=E["[object Uint8ClampedArray]"]=E["[object Uint16Array]"]=E["[object Uint32Array]"]=!0,E["[object Error]"]=E["[object Function]"]=E["[object WeakMap]"]=!1,t.exports=function t(e,n,T,C,A,S){var M,O=1&n,D=2&n,N=4&n;if(T&&(M=A?T(e,C,A,S):T(e)),void 0!==M)return M;if(!_(e))return e;var B=m(e);if(B){if(M=g(e),!O)return u(e,M)}else{var L=p(e),P="[object Function]"==L||"[object GeneratorFunction]"==L;if(b(e))return c(e,O);if("[object Object]"==L||"[object Arguments]"==L||P&&!A){if(M=D||P?{}:v(e),!O)return D?h(e,s(M,e)):l(e,o(M,e))}else{if(!E[L])return A?e:{};M=y(e,L,O)}}S||(S=new r);var I=S.get(e);if(I)return I;S.set(e,M),k(e)?e.forEach((function(r){M.add(t(r,n,T,r,e,S))})):x(e)&&e.forEach((function(r,i){M.set(i,t(r,n,T,i,e,S))}));var F=N?D?d:f:D?keysIn:w,j=B?void 0:F(e);return i(j||e,(function(r,i){j&&(r=e[i=r]),a(M,i,t(r,n,T,i,e,S))})),M}},function(t,e,n){(function(e){var n="object"==typeof e&&e&&e.Object===Object&&e;t.exports=n}).call(this,n(211))},function(t,e){var n=Function.prototype.toString;t.exports=function(t){if(null!=t){try{return n.call(t)}catch(t){}try{return t+""}catch(t){}}return""}},function(t,e,n){var r=n(33),i=function(){try{var t=r(Object,"defineProperty");return t({},"",{}),t}catch(t){}}();t.exports=i},function(t,e,n){var r=n(230),i=n(47),a=n(5),o=n(39),s=n(60),c=n(48),u=Object.prototype.hasOwnProperty;t.exports=function(t,e){var n=a(t),l=!n&&i(t),h=!n&&!l&&o(t),f=!n&&!l&&!h&&c(t),d=n||l||h||f,p=d?r(t.length,String):[],g=p.length;for(var y in t)!e&&!u.call(t,y)||d&&("length"==y||h&&("offset"==y||"parent"==y)||f&&("buffer"==y||"byteLength"==y||"byteOffset"==y)||s(y,g))||p.push(y);return p}},function(t,e){t.exports=function(t,e){return function(n){return t(e(n))}}},function(t,e,n){(function(t){var r=n(16),i=e&&!e.nodeType&&e,a=i&&"object"==typeof t&&t&&!t.nodeType&&t,o=a&&a.exports===i?r.Buffer:void 0,s=o?o.allocUnsafe:void 0;t.exports=function(t,e){if(e)return t.slice();var n=t.length,r=s?s(n):new t.constructor(n);return t.copy(r),r}}).call(this,n(7)(t))},function(t,e){t.exports=function(t,e){var n=-1,r=t.length;for(e||(e=Array(r));++n<r;)e[n]=t[n];return e}},function(t,e){t.exports=function(t,e){for(var n=-1,r=null==t?0:t.length,i=0,a=[];++n<r;){var o=t[n];e(o,n,t)&&(a[i++]=o)}return a}},function(t,e){t.exports=function(){return[]}},function(t,e,n){var r=n(84),i=n(63),a=n(83),o=n(117),s=Object.getOwnPropertySymbols?function(t){for(var e=[];t;)r(e,a(t)),t=i(t);return e}:o;t.exports=s},function(t,e,n){var r=n(120),i=n(83),a=n(30);t.exports=function(t){return r(t,a,i)}},function(t,e,n){var r=n(84),i=n(5);t.exports=function(t,e,n){var a=e(t);return i(t)?a:r(a,n(t))}},function(t,e,n){var r=n(33)(n(16),"Set");t.exports=r},function(t,e,n){var r=n(16).Uint8Array;t.exports=r},function(t,e,n){var r=n(85);t.exports=function(t,e){var n=e?r(t.buffer):t.buffer;return new t.constructor(n,t.byteOffset,t.length)}},function(t,e,n){var r=n(125),i=n(63),a=n(62);t.exports=function(t){return"function"!=typeof t.constructor||a(t)?{}:r(i(t))}},function(t,e,n){var r=n(11),i=Object.create,a=function(){function t(){}return function(e){if(!r(e))return{};if(i)return i(e);t.prototype=e;var n=new t;return t.prototype=void 0,n}}();t.exports=a},function(t,e,n){var r=n(79),i=n(64),a=n(127),o=n(5);t.exports=function(t,e){return(o(t)?r:i)(t,a(e))}},function(t,e,n){var r=n(35);t.exports=function(t){return"function"==typeof t?t:r}},function(t,e,n){var r=n(116),i=n(255),a=n(25),o=n(5);t.exports=function(t,e){return(o(t)?r:i)(t,a(e,3))}},function(t,e,n){var r=n(258),i=n(21);t.exports=function t(e,n,a,o,s){return e===n||(null==e||null==n||!i(e)&&!i(n)?e!=e&&n!=n:r(e,n,a,o,t,s))}},function(t,e,n){var r=n(131),i=n(261),a=n(132);t.exports=function(t,e,n,o,s,c){var u=1&n,l=t.length,h=e.length;if(l!=h&&!(u&&h>l))return!1;var f=c.get(t);if(f&&c.get(e))return f==e;var d=-1,p=!0,g=2&n?new r:void 0;for(c.set(t,e),c.set(e,t);++d<l;){var y=t[d],v=e[d];if(o)var m=u?o(v,y,d,e,t,c):o(y,v,d,t,e,c);if(void 0!==m){if(m)continue;p=!1;break}if(g){if(!i(e,(function(t,e){if(!a(g,e)&&(y===t||s(y,t,n,o,c)))return g.push(e)}))){p=!1;break}}else if(y!==v&&!s(y,v,n,o,c)){p=!1;break}}return c.delete(t),c.delete(e),p}},function(t,e,n){var r=n(78),i=n(259),a=n(260);function o(t){var e=-1,n=null==t?0:t.length;for(this.__data__=new r;++e<n;)this.add(t[e])}o.prototype.add=o.prototype.push=i,o.prototype.has=a,t.exports=o},function(t,e){t.exports=function(t,e){return t.has(e)}},function(t,e,n){var r=n(11);t.exports=function(t){return t==t&&!r(t)}},function(t,e){t.exports=function(t,e){return function(n){return null!=n&&(n[t]===e&&(void 0!==e||t in Object(n)))}}},function(t,e,n){var r=n(271);t.exports=function(t){return null==t?"":r(t)}},function(t,e,n){var r=n(272),i=n(137);t.exports=function(t,e){return null!=t&&i(t,e,r)}},function(t,e,n){var r=n(65),i=n(47),a=n(5),o=n(60),s=n(80),c=n(49);t.exports=function(t,e,n){for(var u=-1,l=(e=r(e,t)).length,h=!1;++u<l;){var f=c(e[u]);if(!(h=null!=t&&n(t,f)))break;t=t[f]}return h||++u!=l?h:!!(l=null==t?0:t.length)&&s(l)&&o(f,l)&&(a(t)||i(t))}},function(t,e){t.exports=function(t){return function(e){return null==e?void 0:e[t]}}},function(t,e){t.exports=function(t){return void 0===t}},function(t,e,n){var r=n(66),i=n(25),a=n(141),o=n(5);t.exports=function(t,e){return(o(t)?r:a)(t,i(e,3))}},function(t,e,n){var r=n(64),i=n(24);t.exports=function(t,e){var n=-1,a=i(t)?Array(t.length):[];return r(t,(function(t,r,i){a[++n]=e(t,r,i)})),a}},function(t,e,n){var r=n(277),i=n(64),a=n(25),o=n(278),s=n(5);t.exports=function(t,e,n){var c=s(t)?r:o,u=arguments.length<3;return c(t,a(e,4),n,u,i)}},function(t,e,n){var r=n(288),i=Math.max;t.exports=function(t,e,n){return e=i(void 0===e?t.length-1:e,0),function(){for(var a=arguments,o=-1,s=i(a.length-e,0),c=Array(s);++o<s;)c[o]=a[e+o];o=-1;for(var u=Array(e+1);++o<e;)u[o]=a[o];return u[e]=n(c),r(t,this,u)}}},function(t,e,n){var r=n(289),i=n(290)(r);t.exports=i},function(t,e){t.exports=function(t,e,n,r){for(var i=t.length,a=n+(r?1:-1);r?a--:++a<i;)if(e(t[a],a,t))return a;return-1}},function(t,e,n){var r=n(24),i=n(21);t.exports=function(t){return i(t)&&r(t)}},function(t,e,n){var r=n(299),i=n(30);t.exports=function(t){return null==t?[]:r(t,i(t))}},function(t,e,n){var r=n(10),i=n(149);t.exports=function(t,e,n,r){return function(t,e,n,r){var a,o,s={},c=new i,u=function(t){var e=t.v!==a?t.v:t.w,r=s[e],i=n(t),u=o.distance+i;if(i<0)throw new Error("dijkstra does not allow negative edge weights. Bad edge: "+t+" Weight: "+i);u<r.distance&&(r.distance=u,r.predecessor=a,c.decrease(e,u))};t.nodes().forEach((function(t){var n=t===e?0:Number.POSITIVE_INFINITY;s[t]={distance:n},c.add(t,n)}));for(;c.size()>0&&(a=c.removeMin(),(o=s[a]).distance!==Number.POSITIVE_INFINITY);)r(a).forEach(u);return s}(t,String(e),n||a,r||function(e){return t.outEdges(e)})};var a=r.constant(1)},function(t,e,n){var r=n(10);function i(){this._arr=[],this._keyIndices={}}t.exports=i,i.prototype.size=function(){return this._arr.length},i.prototype.keys=function(){return this._arr.map((function(t){return t.key}))},i.prototype.has=function(t){return r.has(this._keyIndices,t)},i.prototype.priority=function(t){var e=this._keyIndices[t];if(void 0!==e)return this._arr[e].priority},i.prototype.min=function(){if(0===this.size())throw new Error("Queue underflow");return this._arr[0].key},i.prototype.add=function(t,e){var n=this._keyIndices;if(t=String(t),!r.has(n,t)){var i=this._arr,a=i.length;return n[t]=a,i.push({key:t,priority:e}),this._decrease(a),!0}return!1},i.prototype.removeMin=function(){this._swap(0,this._arr.length-1);var t=this._arr.pop();return delete this._keyIndices[t.key],this._heapify(0),t.key},i.prototype.decrease=function(t,e){var n=this._keyIndices[t];if(e>this._arr[n].priority)throw new Error("New priority is greater than current priority. Key: "+t+" Old: "+this._arr[n].priority+" New: "+e);this._arr[n].priority=e,this._decrease(n)},i.prototype._heapify=function(t){var e=this._arr,n=2*t,r=n+1,i=t;n<e.length&&(i=e[n].priority<e[i].priority?n:i,r<e.length&&(i=e[r].priority<e[i].priority?r:i),i!==t&&(this._swap(t,i),this._heapify(i)))},i.prototype._decrease=function(t){for(var e,n=this._arr,r=n[t].priority;0!==t&&!(n[e=t>>1].priority<r);)this._swap(t,e),t=e},i.prototype._swap=function(t,e){var n=this._arr,r=this._keyIndices,i=n[t],a=n[e];n[t]=a,n[e]=i,r[a.key]=t,r[i.key]=e}},function(t,e,n){var r=n(10);t.exports=function(t){var e=0,n=[],i={},a=[];return t.nodes().forEach((function(o){r.has(i,o)||function o(s){var c=i[s]={onStack:!0,lowlink:e,index:e++};if(n.push(s),t.successors(s).forEach((function(t){r.has(i,t)?i[t].onStack&&(c.lowlink=Math.min(c.lowlink,i[t].index)):(o(t),c.lowlink=Math.min(c.lowlink,i[t].lowlink))})),c.lowlink===c.index){var u,l=[];do{u=n.pop(),i[u].onStack=!1,l.push(u)}while(s!==u);a.push(l)}}(o)})),a}},function(t,e,n){var r=n(10);function i(t){var e={},n={},i=[];if(r.each(t.sinks(),(function o(s){if(r.has(n,s))throw new a;r.has(e,s)||(n[s]=!0,e[s]=!0,r.each(t.predecessors(s),o),delete n[s],i.push(s))})),r.size(e)!==t.nodeCount())throw new a;return i}function a(){}t.exports=i,i.CycleException=a,a.prototype=new Error},function(t,e,n){var r=n(10);t.exports=function(t,e,n){r.isArray(e)||(e=[e]);var i=(t.isDirected()?t.successors:t.neighbors).bind(t),a=[],o={};return r.each(e,(function(e){if(!t.hasNode(e))throw new Error("Graph does not have node: "+e);!function t(e,n,i,a,o,s){r.has(a,n)||(a[n]=!0,i||s.push(n),r.each(o(n),(function(n){t(e,n,i,a,o,s)})),i&&s.push(n))}(t,e,"post"===n,o,i,a)})),a}},function(t,e,n){var r;try{r=n(18)}catch(t){}r||(r=window.dagre),t.exports=r},function(t,e,n){var r=n(67),i=n(36),a=n(68),o=n(40),s=Object.prototype,c=s.hasOwnProperty,u=r((function(t,e){t=Object(t);var n=-1,r=e.length,u=r>2?e[2]:void 0;for(u&&a(e[0],e[1],u)&&(r=1);++n<r;)for(var l=e[n],h=o(l),f=-1,d=h.length;++f<d;){var p=h[f],g=t[p];(void 0===g||i(g,s[p])&&!c.call(t,p))&&(t[p]=l[p])}return t}));t.exports=u},function(t,e,n){var r=n(318);t.exports=function(t){return t?(t=r(t))===1/0||t===-1/0?17976931348623157e292*(t<0?-1:1):t==t?t:0:0===t?t:0}},function(t,e,n){var r=n(94);t.exports=function(t){return(null==t?0:t.length)?r(t,1):[]}},function(t,e,n){var r=n(59),i=n(36);t.exports=function(t,e,n){(void 0===n||i(t[e],n))&&(void 0!==n||e in t)||r(t,e,n)}},function(t,e,n){var r=n(34),i=n(63),a=n(21),o=Function.prototype,s=Object.prototype,c=o.toString,u=s.hasOwnProperty,l=c.call(Object);t.exports=function(t){if(!a(t)||"[object Object]"!=r(t))return!1;var e=i(t);if(null===e)return!0;var n=u.call(e,"constructor")&&e.constructor;return"function"==typeof n&&n instanceof n&&c.call(n)==l}},function(t,e){t.exports=function(t,e){if(("constructor"!==e||"function"!=typeof t[e])&&"__proto__"!=e)return t[e]}},function(t,e){t.exports=function(t,e){return t<e}},function(t,e,n){var r=n(332),i=n(335)((function(t,e){return null==t?{}:r(t,e)}));t.exports=i},function(t,e,n){var r=n(336)();t.exports=r},function(t,e,n){var r=n(135),i=0;t.exports=function(t){var e=++i;return r(t)+e}},function(t,e,n){"use strict";var r=n(4),i=n(17).Graph,a=n(69).slack;function o(t,e){return r.forEach(t.nodes(),(function n(i){r.forEach(e.nodeEdges(i),(function(r){var o=r.v,s=i===o?r.w:o;t.hasNode(s)||a(e,r)||(t.setNode(s,{}),t.setEdge(i,s,{}),n(s))}))})),t.nodeCount()}function s(t,e){return r.minBy(e.edges(),(function(n){if(t.hasNode(n.v)!==t.hasNode(n.w))return a(e,n)}))}function c(t,e,n){r.forEach(t.nodes(),(function(t){e.node(t).rank+=n}))}t.exports=function(t){var e,n,r=new i({directed:!1}),u=t.nodes()[0],l=t.nodeCount();r.setNode(u,{});for(;o(r,t)<l;)e=s(r,t),n=r.hasNode(e.v)?a(t,e):-a(t,e),c(r,t,n);return r}},function(t,e){t.exports=function(t,e){return t.intersect(e)}},function(t,e,n){var r=n(96);t.exports=function(t,e,n){return r(t,e,e,n)}},function(t,e,n){var r=n(369);t.exports=function(t,e,n){var i=t.x,a=t.y,o=[],s=Number.POSITIVE_INFINITY,c=Number.POSITIVE_INFINITY;e.forEach((function(t){s=Math.min(s,t.x),c=Math.min(c,t.y)}));for(var u=i-t.width/2-s,l=a-t.height/2-c,h=0;h<e.length;h++){var f=e[h],d=e[h<e.length-1?h+1:0],p=r(t,n,{x:u+f.x,y:l+f.y},{x:u+d.x,y:l+d.y});p&&o.push(p)}if(!o.length)return console.log("NO INTERSECTION FOUND, RETURN NODE CENTER",t),t;o.length>1&&o.sort((function(t,e){var r=t.x-n.x,i=t.y-n.y,a=Math.sqrt(r*r+i*i),o=e.x-n.x,s=e.y-n.y,c=Math.sqrt(o*o+s*s);return a<c?-1:a===c?0:1}));return o[0]}},function(t,e){t.exports=function(t,e){var n,r,i=t.x,a=t.y,o=e.x-i,s=e.y-a,c=t.width/2,u=t.height/2;Math.abs(s)*c>Math.abs(o)*u?(s<0&&(u=-u),n=0===s?0:u*o/s,r=u):(o<0&&(c=-c),n=c,r=0===o?0:c*s/o);return{x:i+n,y:a+r}}},function(t,e,n){t.exports=function t(e){"use strict";var n=/^\0+/g,r=/[\0\r\f]/g,i=/: */g,a=/zoo|gra/,o=/([,: ])(transform)/g,s=/,+\s*(?![^(]*[)])/g,c=/ +\s*(?![^(]*[)])/g,u=/ *[\0] */g,l=/,\r+?/g,h=/([\t\r\n ])*\f?&/g,f=/:global\(((?:[^\(\)\[\]]*|\[.*\]|\([^\(\)]*\))*)\)/g,d=/\W+/g,p=/@(k\w+)\s*(\S*)\s*/,g=/::(place)/g,y=/:(read-only)/g,v=/\s+(?=[{\];=:>])/g,m=/([[}=:>])\s+/g,b=/(\{[^{]+?);(?=\})/g,x=/\s{2,}/g,_=/([^\(])(:+) */g,k=/[svh]\w+-[tblr]{2}/,w=/\(\s*(.*)\s*\)/g,E=/([\s\S]*?);/g,T=/-self|flex-/g,C=/[^]*?(:[rp][el]a[\w-]+)[^]*/,A=/stretch|:\s*\w+\-(?:conte|avail)/,S=/([^-])(image-set\()/,M="-webkit-",O="-moz-",D="-ms-",N=1,B=1,L=0,P=1,I=1,F=1,j=0,R=0,Y=0,z=[],U=[],$=0,W=null,H=0,V=1,G="",q="",X="";function Z(t,e,i,a,o){for(var s,c,l=0,h=0,f=0,d=0,v=0,m=0,b=0,x=0,k=0,E=0,T=0,C=0,A=0,S=0,O=0,D=0,j=0,U=0,W=0,K=i.length,it=K-1,at="",ot="",st="",ct="",ut="",lt="";O<K;){if(b=i.charCodeAt(O),O===it&&h+d+f+l!==0&&(0!==h&&(b=47===h?10:47),d=f=l=0,K++,it++),h+d+f+l===0){if(O===it&&(D>0&&(ot=ot.replace(r,"")),ot.trim().length>0)){switch(b){case 32:case 9:case 59:case 13:case 10:break;default:ot+=i.charAt(O)}b=59}if(1===j)switch(b){case 123:case 125:case 59:case 34:case 39:case 40:case 41:case 44:j=0;case 9:case 13:case 10:case 32:break;default:for(j=0,W=O,v=b,O--,b=59;W<K;)switch(i.charCodeAt(W++)){case 10:case 13:case 59:++O,b=v,W=K;break;case 58:D>0&&(++O,b=v);case 123:W=K}}switch(b){case 123:for(v=(ot=ot.trim()).charCodeAt(0),T=1,W=++O;O<K;){switch(b=i.charCodeAt(O)){case 123:T++;break;case 125:T--;break;case 47:switch(m=i.charCodeAt(O+1)){case 42:case 47:O=rt(m,O,it,i)}break;case 91:b++;case 40:b++;case 34:case 39:for(;O++<it&&i.charCodeAt(O)!==b;);}if(0===T)break;O++}switch(st=i.substring(W,O),0===v&&(v=(ot=ot.replace(n,"").trim()).charCodeAt(0)),v){case 64:switch(D>0&&(ot=ot.replace(r,"")),m=ot.charCodeAt(1)){case 100:case 109:case 115:case 45:s=e;break;default:s=z}if(W=(st=Z(e,s,st,m,o+1)).length,Y>0&&0===W&&(W=ot.length),$>0&&(c=nt(3,st,s=J(z,ot,U),e,B,N,W,m,o,a),ot=s.join(""),void 0!==c&&0===(W=(st=c.trim()).length)&&(m=0,st="")),W>0)switch(m){case 115:ot=ot.replace(w,et);case 100:case 109:case 45:st=ot+"{"+st+"}";break;case 107:st=(ot=ot.replace(p,"$1 $2"+(V>0?G:"")))+"{"+st+"}",st=1===I||2===I&&tt("@"+st,3)?"@"+M+st+"@"+st:"@"+st;break;default:st=ot+st,112===a&&(ct+=st,st="")}else st="";break;default:st=Z(e,J(e,ot,U),st,a,o+1)}ut+=st,C=0,j=0,S=0,D=0,U=0,A=0,ot="",st="",b=i.charCodeAt(++O);break;case 125:case 59:if((W=(ot=(D>0?ot.replace(r,""):ot).trim()).length)>1)switch(0===S&&(45===(v=ot.charCodeAt(0))||v>96&&v<123)&&(W=(ot=ot.replace(" ",":")).length),$>0&&void 0!==(c=nt(1,ot,e,t,B,N,ct.length,a,o,a))&&0===(W=(ot=c.trim()).length)&&(ot="\0\0"),v=ot.charCodeAt(0),m=ot.charCodeAt(1),v){case 0:break;case 64:if(105===m||99===m){lt+=ot+i.charAt(O);break}default:if(58===ot.charCodeAt(W-1))break;ct+=Q(ot,v,m,ot.charCodeAt(2))}C=0,j=0,S=0,D=0,U=0,ot="",b=i.charCodeAt(++O)}}switch(b){case 13:case 10:if(h+d+f+l+R===0)switch(E){case 41:case 39:case 34:case 64:case 126:case 62:case 42:case 43:case 47:case 45:case 58:case 44:case 59:case 123:case 125:break;default:S>0&&(j=1)}47===h?h=0:P+C===0&&107!==a&&ot.length>0&&(D=1,ot+="\0"),$*H>0&&nt(0,ot,e,t,B,N,ct.length,a,o,a),N=1,B++;break;case 59:case 125:if(h+d+f+l===0){N++;break}default:switch(N++,at=i.charAt(O),b){case 9:case 32:if(d+l+h===0)switch(x){case 44:case 58:case 9:case 32:at="";break;default:32!==b&&(at=" ")}break;case 0:at="\\0";break;case 12:at="\\f";break;case 11:at="\\v";break;case 38:d+h+l===0&&P>0&&(U=1,D=1,at="\f"+at);break;case 108:if(d+h+l+L===0&&S>0)switch(O-S){case 2:112===x&&58===i.charCodeAt(O-3)&&(L=x);case 8:111===k&&(L=k)}break;case 58:d+h+l===0&&(S=O);break;case 44:h+f+d+l===0&&(D=1,at+="\r");break;case 34:case 39:0===h&&(d=d===b?0:0===d?b:d);break;case 91:d+h+f===0&&l++;break;case 93:d+h+f===0&&l--;break;case 41:d+h+l===0&&f--;break;case 40:if(d+h+l===0){if(0===C)switch(2*x+3*k){case 533:break;default:T=0,C=1}f++}break;case 64:h+f+d+l+S+A===0&&(A=1);break;case 42:case 47:if(d+l+f>0)break;switch(h){case 0:switch(2*b+3*i.charCodeAt(O+1)){case 235:h=47;break;case 220:W=O,h=42}break;case 42:47===b&&42===x&&W+2!==O&&(33===i.charCodeAt(W+2)&&(ct+=i.substring(W,O+1)),at="",h=0)}}if(0===h){if(P+d+l+A===0&&107!==a&&59!==b)switch(b){case 44:case 126:case 62:case 43:case 41:case 40:if(0===C){switch(x){case 9:case 32:case 10:case 13:at+="\0";break;default:at="\0"+at+(44===b?"":"\0")}D=1}else switch(b){case 40:S+7===O&&108===x&&(S=0),C=++T;break;case 41:0==(C=--T)&&(D=1,at+="\0")}break;case 9:case 32:switch(x){case 0:case 123:case 125:case 59:case 44:case 12:case 9:case 32:case 10:case 13:break;default:0===C&&(D=1,at+="\0")}}ot+=at,32!==b&&9!==b&&(E=b)}}k=x,x=b,O++}if(W=ct.length,Y>0&&0===W&&0===ut.length&&0===e[0].length==0&&(109!==a||1===e.length&&(P>0?q:X)===e[0])&&(W=e.join(",").length+2),W>0){if(s=0===P&&107!==a?function(t){for(var e,n,i=0,a=t.length,o=Array(a);i<a;++i){for(var s=t[i].split(u),c="",l=0,h=0,f=0,d=0,p=s.length;l<p;++l)if(!(0===(h=(n=s[l]).length)&&p>1)){if(f=c.charCodeAt(c.length-1),d=n.charCodeAt(0),e="",0!==l)switch(f){case 42:case 126:case 62:case 43:case 32:case 40:break;default:e=" "}switch(d){case 38:n=e+q;case 126:case 62:case 43:case 32:case 41:case 40:break;case 91:n=e+n+q;break;case 58:switch(2*n.charCodeAt(1)+3*n.charCodeAt(2)){case 530:if(F>0){n=e+n.substring(8,h-1);break}default:(l<1||s[l-1].length<1)&&(n=e+q+n)}break;case 44:e="";default:n=h>1&&n.indexOf(":")>0?e+n.replace(_,"$1"+q+"$2"):e+n+q}c+=n}o[i]=c.replace(r,"").trim()}return o}(e):e,$>0&&void 0!==(c=nt(2,ct,s,t,B,N,W,a,o,a))&&0===(ct=c).length)return lt+ct+ut;if(ct=s.join(",")+"{"+ct+"}",I*L!=0){switch(2!==I||tt(ct,2)||(L=0),L){case 111:ct=ct.replace(y,":-moz-$1")+ct;break;case 112:ct=ct.replace(g,"::-webkit-input-$1")+ct.replace(g,"::-moz-$1")+ct.replace(g,":-ms-input-$1")+ct}L=0}}return lt+ct+ut}function J(t,e,n){var r=e.trim().split(l),i=r,a=r.length,o=t.length;switch(o){case 0:case 1:for(var s=0,c=0===o?"":t[0]+" ";s<a;++s)i[s]=K(c,i[s],n,o).trim();break;default:s=0;var u=0;for(i=[];s<a;++s)for(var h=0;h<o;++h)i[u++]=K(t[h]+" ",r[s],n,o).trim()}return i}function K(t,e,n,r){var i=e,a=i.charCodeAt(0);switch(a<33&&(a=(i=i.trim()).charCodeAt(0)),a){case 38:switch(P+r){case 0:case 1:if(0===t.trim().length)break;default:return i.replace(h,"$1"+t.trim())}break;case 58:switch(i.charCodeAt(1)){case 103:if(F>0&&P>0)return i.replace(f,"$1").replace(h,"$1"+X);break;default:return t.trim()+i.replace(h,"$1"+t.trim())}default:if(n*P>0&&i.indexOf("\f")>0)return i.replace(h,(58===t.charCodeAt(0)?"":"$1")+t.trim())}return t+i}function Q(t,e,n,r){var u,l=0,h=t+";",f=2*e+3*n+4*r;if(944===f)return function(t){var e=t.length,n=t.indexOf(":",9)+1,r=t.substring(0,n).trim(),i=t.substring(n,e-1).trim();switch(t.charCodeAt(9)*V){case 0:break;case 45:if(110!==t.charCodeAt(10))break;default:var a=i.split((i="",s)),o=0;for(n=0,e=a.length;o<e;n=0,++o){for(var u=a[o],l=u.split(c);u=l[n];){var h=u.charCodeAt(0);if(1===V&&(h>64&&h<90||h>96&&h<123||95===h||45===h&&45!==u.charCodeAt(1)))switch(isNaN(parseFloat(u))+(-1!==u.indexOf("("))){case 1:switch(u){case"infinite":case"alternate":case"backwards":case"running":case"normal":case"forwards":case"both":case"none":case"linear":case"ease":case"ease-in":case"ease-out":case"ease-in-out":case"paused":case"reverse":case"alternate-reverse":case"inherit":case"initial":case"unset":case"step-start":case"step-end":break;default:u+=G}}l[n++]=u}i+=(0===o?"":",")+l.join(" ")}}return i=r+i+";",1===I||2===I&&tt(i,1)?M+i+i:i}(h);if(0===I||2===I&&!tt(h,1))return h;switch(f){case 1015:return 97===h.charCodeAt(10)?M+h+h:h;case 951:return 116===h.charCodeAt(3)?M+h+h:h;case 963:return 110===h.charCodeAt(5)?M+h+h:h;case 1009:if(100!==h.charCodeAt(4))break;case 969:case 942:return M+h+h;case 978:return M+h+O+h+h;case 1019:case 983:return M+h+O+h+D+h+h;case 883:return 45===h.charCodeAt(8)?M+h+h:h.indexOf("image-set(",11)>0?h.replace(S,"$1-webkit-$2")+h:h;case 932:if(45===h.charCodeAt(4))switch(h.charCodeAt(5)){case 103:return M+"box-"+h.replace("-grow","")+M+h+D+h.replace("grow","positive")+h;case 115:return M+h+D+h.replace("shrink","negative")+h;case 98:return M+h+D+h.replace("basis","preferred-size")+h}return M+h+D+h+h;case 964:return M+h+D+"flex-"+h+h;case 1023:if(99!==h.charCodeAt(8))break;return u=h.substring(h.indexOf(":",15)).replace("flex-","").replace("space-between","justify"),M+"box-pack"+u+M+h+D+"flex-pack"+u+h;case 1005:return a.test(h)?h.replace(i,":"+M)+h.replace(i,":"+O)+h:h;case 1e3:switch(l=(u=h.substring(13).trim()).indexOf("-")+1,u.charCodeAt(0)+u.charCodeAt(l)){case 226:u=h.replace(k,"tb");break;case 232:u=h.replace(k,"tb-rl");break;case 220:u=h.replace(k,"lr");break;default:return h}return M+h+D+u+h;case 1017:if(-1===h.indexOf("sticky",9))return h;case 975:switch(l=(h=t).length-10,f=(u=(33===h.charCodeAt(l)?h.substring(0,l):h).substring(t.indexOf(":",7)+1).trim()).charCodeAt(0)+(0|u.charCodeAt(7))){case 203:if(u.charCodeAt(8)<111)break;case 115:h=h.replace(u,M+u)+";"+h;break;case 207:case 102:h=h.replace(u,M+(f>102?"inline-":"")+"box")+";"+h.replace(u,M+u)+";"+h.replace(u,D+u+"box")+";"+h}return h+";";case 938:if(45===h.charCodeAt(5))switch(h.charCodeAt(6)){case 105:return u=h.replace("-items",""),M+h+M+"box-"+u+D+"flex-"+u+h;case 115:return M+h+D+"flex-item-"+h.replace(T,"")+h;default:return M+h+D+"flex-line-pack"+h.replace("align-content","").replace(T,"")+h}break;case 973:case 989:if(45!==h.charCodeAt(3)||122===h.charCodeAt(4))break;case 931:case 953:if(!0===A.test(t))return 115===(u=t.substring(t.indexOf(":")+1)).charCodeAt(0)?Q(t.replace("stretch","fill-available"),e,n,r).replace(":fill-available",":stretch"):h.replace(u,M+u)+h.replace(u,O+u.replace("fill-",""))+h;break;case 962:if(h=M+h+(102===h.charCodeAt(5)?D+h:"")+h,n+r===211&&105===h.charCodeAt(13)&&h.indexOf("transform",10)>0)return h.substring(0,h.indexOf(";",27)+1).replace(o,"$1-webkit-$2")+h}return h}function tt(t,e){var n=t.indexOf(1===e?":":"{"),r=t.substring(0,3!==e?n:10),i=t.substring(n+1,t.length-1);return W(2!==e?r:r.replace(C,"$1"),i,e)}function et(t,e){var n=Q(e,e.charCodeAt(0),e.charCodeAt(1),e.charCodeAt(2));return n!==e+";"?n.replace(E," or ($1)").substring(4):"("+e+")"}function nt(t,e,n,r,i,a,o,s,c,u){for(var l,h=0,f=e;h<$;++h)switch(l=U[h].call(at,t,f,n,r,i,a,o,s,c,u)){case void 0:case!1:case!0:case null:break;default:f=l}if(f!==e)return f}function rt(t,e,n,r){for(var i=e+1;i<n;++i)switch(r.charCodeAt(i)){case 47:if(42===t&&42===r.charCodeAt(i-1)&&e+2!==i)return i+1;break;case 10:if(47===t)return i+1}return i}function it(t){for(var e in t){var n=t[e];switch(e){case"keyframe":V=0|n;break;case"global":F=0|n;break;case"cascade":P=0|n;break;case"compress":j=0|n;break;case"semicolon":R=0|n;break;case"preserve":Y=0|n;break;case"prefix":W=null,n?"function"!=typeof n?I=1:(I=2,W=n):I=0}}return it}function at(e,n){if(void 0!==this&&this.constructor===at)return t(e);var i=e,a=i.charCodeAt(0);a<33&&(a=(i=i.trim()).charCodeAt(0)),V>0&&(G=i.replace(d,91===a?"":"-")),a=1,1===P?X=i:q=i;var o,s=[X];$>0&&void 0!==(o=nt(-1,n,s,s,B,N,0,0,0,0))&&"string"==typeof o&&(n=o);var c=Z(z,s,n,0,0);return $>0&&void 0!==(o=nt(-2,c,s,s,B,N,c.length,0,0,0))&&"string"!=typeof(c=o)&&(a=0),G="",X="",q="",L=0,B=1,N=1,j*a==0?c:function(t){return t.replace(r,"").replace(v,"").replace(m,"$1").replace(b,"$1").replace(x," ")}(c)}return at.use=function t(e){switch(e){case void 0:case null:$=U.length=0;break;default:if("function"==typeof e)U[$++]=e;else if("object"==typeof e)for(var n=0,r=e.length;n<r;++n)t(e[n]);else H=0|!!e}return t},at.set=it,void 0!==e&&it(e),at}(null)},function(t,e){t.exports=function(t,e){return t.intersect(e)}},function(t,e,n){var r={"./locale":98,"./locale.js":98};function i(t){var e=a(t);return n(e)}function a(t){if(!n.o(r,t)){var e=new Error("Cannot find module '"+t+"'");throw e.code="MODULE_NOT_FOUND",e}return r[t]}i.keys=function(){return Object.keys(r)},i.resolve=a,t.exports=i,i.id=171},function(t,e,n){"use strict";Object.defineProperty(e,"__esModule",{value:!0});var r=n(51);e.hex=r.default;var i=n(51);e.rgb=i.default;var a=n(51);e.rgba=a.default;var o=n(100);e.hsl=o.default;var s=n(100);e.hsla=s.default;var c=n(29);e.channel=c.default;var u=n(182);e.red=u.default;var l=n(183);e.green=l.default;var h=n(184);e.blue=h.default;var f=n(185);e.hue=f.default;var d=n(186);e.saturation=d.default;var p=n(187);e.lightness=p.default;var g=n(101);e.alpha=g.default;var y=n(101);e.opacity=y.default;var v=n(102);e.luminance=v.default;var m=n(188);e.isDark=m.default;var b=n(103);e.isLight=b.default;var x=n(189);e.isValid=x.default;var _=n(190);e.saturate=_.default;var k=n(191);e.desaturate=k.default;var w=n(192);e.lighten=w.default;var E=n(193);e.darken=E.default;var T=n(104);e.opacify=T.default;var C=n(104);e.fadeIn=C.default;var A=n(105);e.transparentize=A.default;var S=n(105);e.fadeOut=S.default;var M=n(194);e.complement=M.default;var O=n(195);e.grayscale=O.default;var D=n(106);e.adjust=D.default;var N=n(52);e.change=N.default;var B=n(196);e.invert=B.default;var L=n(107);e.mix=L.default;var P=n(197);e.scale=P.default},function(t,e,n){"use strict";Object.defineProperty(e,"__esModule",{value:!0});var r={min:{r:0,g:0,b:0,s:0,l:0,a:0},max:{r:255,g:255,b:255,h:360,s:100,l:100,a:1},clamp:{r:function(t){return t>=255?255:t<0?0:t},g:function(t){return t>=255?255:t<0?0:t},b:function(t){return t>=255?255:t<0?0:t},h:function(t){return t%360},s:function(t){return t>=100?100:t<0?0:t},l:function(t){return t>=100?100:t<0?0:t},a:function(t){return t>=1?1:t<0?0:t}},toLinear:function(t){var e=t/255;return t>.03928?Math.pow((e+.055)/1.055,2.4):e/12.92},hue2rgb:function(t,e,n){return n<0&&(n+=1),n>1&&(n-=1),n<1/6?t+6*(e-t)*n:n<.5?e:n<2/3?t+(e-t)*(2/3-n)*6:t},hsl2rgb:function(t,e){var n=t.h,i=t.s,a=t.l;if(100===i)return 2.55*a;n/=360,i/=100;var o=(a/=100)<.5?a*(1+i):a+i-a*i,s=2*a-o;switch(e){case"r":return 255*r.hue2rgb(s,o,n+1/3);case"g":return 255*r.hue2rgb(s,o,n);case"b":return 255*r.hue2rgb(s,o,n-1/3)}},rgb2hsl:function(t,e){var n=t.r,r=t.g,i=t.b;n/=255,r/=255,i/=255;var a=Math.max(n,r,i),o=Math.min(n,r,i),s=(a+o)/2;if("l"===e)return 100*s;if(a===o)return 0;var c=a-o;if("s"===e)return 100*(s>.5?c/(2-a-o):c/(a+o));switch(a){case n:return 60*((r-i)/c+(r<i?6:0));case r:return 60*((i-n)/c+2);case i:return 60*((n-r)/c+4);default:return-1}}};e.default=r},function(t,e,n){"use strict";Object.defineProperty(e,"__esModule",{value:!0});var r={round:function(t){return Math.round(1e10*t)/1e10}};e.default=r},function(t,e,n){"use strict";Object.defineProperty(e,"__esModule",{value:!0});var r={frac2hex:function(t){var e=Math.round(255*t).toString(16);return e.length>1?e:"0"+e},dec2hex:function(t){var e=Math.round(t).toString(16);return e.length>1?e:"0"+e}};e.default=r},function(t,e,n){"use strict";Object.defineProperty(e,"__esModule",{value:!0});var r=n(9),i=n(75),a=n(177),o=function(){function t(t,e){this.color=e,this.changed=!1,this.data=t,this.type=new a.default}return t.prototype.set=function(t,e){return this.color=e,this.changed=!1,this.data=t,this.type.type=i.TYPE.ALL,this},t.prototype._ensureHSL=function(){void 0===this.data.h&&(this.data.h=r.default.channel.rgb2hsl(this.data,"h")),void 0===this.data.s&&(this.data.s=r.default.channel.rgb2hsl(this.data,"s")),void 0===this.data.l&&(this.data.l=r.default.channel.rgb2hsl(this.data,"l"))},t.prototype._ensureRGB=function(){void 0===this.data.r&&(this.data.r=r.default.channel.hsl2rgb(this.data,"r")),void 0===this.data.g&&(this.data.g=r.default.channel.hsl2rgb(this.data,"g")),void 0===this.data.b&&(this.data.b=r.default.channel.hsl2rgb(this.data,"b"))},Object.defineProperty(t.prototype,"r",{get:function(){return this.type.is(i.TYPE.HSL)||void 0===this.data.r?(this._ensureHSL(),r.default.channel.hsl2rgb(this.data,"r")):this.data.r},set:function(t){this.type.set(i.TYPE.RGB),this.changed=!0,this.data.r=t},enumerable:!0,configurable:!0}),Object.defineProperty(t.prototype,"g",{get:function(){return this.type.is(i.TYPE.HSL)||void 0===this.data.g?(this._ensureHSL(),r.default.channel.hsl2rgb(this.data,"g")):this.data.g},set:function(t){this.type.set(i.TYPE.RGB),this.changed=!0,this.data.g=t},enumerable:!0,configurable:!0}),Object.defineProperty(t.prototype,"b",{get:function(){return this.type.is(i.TYPE.HSL)||void 0===this.data.b?(this._ensureHSL(),r.default.channel.hsl2rgb(this.data,"b")):this.data.b},set:function(t){this.type.set(i.TYPE.RGB),this.changed=!0,this.data.b=t},enumerable:!0,configurable:!0}),Object.defineProperty(t.prototype,"h",{get:function(){return this.type.is(i.TYPE.RGB)||void 0===this.data.h?(this._ensureRGB(),r.default.channel.rgb2hsl(this.data,"h")):this.data.h},set:function(t){this.type.set(i.TYPE.HSL),this.changed=!0,this.data.h=t},enumerable:!0,configurable:!0}),Object.defineProperty(t.prototype,"s",{get:function(){return this.type.is(i.TYPE.RGB)||void 0===this.data.s?(this._ensureRGB(),r.default.channel.rgb2hsl(this.data,"s")):this.data.s},set:function(t){this.type.set(i.TYPE.HSL),this.changed=!0,this.data.s=t},enumerable:!0,configurable:!0}),Object.defineProperty(t.prototype,"l",{get:function(){return this.type.is(i.TYPE.RGB)||void 0===this.data.l?(this._ensureRGB(),r.default.channel.rgb2hsl(this.data,"l")):this.data.l},set:function(t){this.type.set(i.TYPE.HSL),this.changed=!0,this.data.l=t},enumerable:!0,configurable:!0}),Object.defineProperty(t.prototype,"a",{get:function(){return this.data.a},set:function(t){this.changed=!0,this.data.a=t},enumerable:!0,configurable:!0}),t}();e.default=o},function(t,e,n){"use strict";Object.defineProperty(e,"__esModule",{value:!0});var r=n(75),i=function(){function t(){this.type=r.TYPE.ALL}return t.prototype.get=function(){return this.type},t.prototype.set=function(t){if(this.type&&this.type!==t)throw new Error("Cannot change both RGB and HSL channels at the same time");this.type=t},t.prototype.reset=function(){this.type=r.TYPE.ALL},t.prototype.is=function(t){return this.type===t},t}();e.default=i},function(t,e,n){"use strict";Object.defineProperty(e,"__esModule",{value:!0});var r=n(9),i={};e.DEC2HEX=i;for(var a=0;a<=255;a++)i[a]=r.default.unit.dec2hex(a)},function(t,e,n){"use strict";Object.defineProperty(e,"__esModule",{value:!0});var r=n(99),i={colors:{aliceblue:"#f0f8ff",antiquewhite:"#faebd7",aqua:"#00ffff",aquamarine:"#7fffd4",azure:"#f0ffff",beige:"#f5f5dc",bisque:"#ffe4c4",black:"#000000",blanchedalmond:"#ffebcd",blue:"#0000ff",blueviolet:"#8a2be2",brown:"#a52a2a",burlywood:"#deb887",cadetblue:"#5f9ea0",chartreuse:"#7fff00",chocolate:"#d2691e",coral:"#ff7f50",cornflowerblue:"#6495ed",cornsilk:"#fff8dc",crimson:"#dc143c",cyanaqua:"#00ffff",darkblue:"#00008b",darkcyan:"#008b8b",darkgoldenrod:"#b8860b",darkgray:"#a9a9a9",darkgreen:"#006400",darkgrey:"#a9a9a9",darkkhaki:"#bdb76b",darkmagenta:"#8b008b",darkolivegreen:"#556b2f",darkorange:"#ff8c00",darkorchid:"#9932cc",darkred:"#8b0000",darksalmon:"#e9967a",darkseagreen:"#8fbc8f",darkslateblue:"#483d8b",darkslategray:"#2f4f4f",darkslategrey:"#2f4f4f",darkturquoise:"#00ced1",darkviolet:"#9400d3",deeppink:"#ff1493",deepskyblue:"#00bfff",dimgray:"#696969",dimgrey:"#696969",dodgerblue:"#1e90ff",firebrick:"#b22222",floralwhite:"#fffaf0",forestgreen:"#228b22",fuchsia:"#ff00ff",gainsboro:"#dcdcdc",ghostwhite:"#f8f8ff",gold:"#ffd700",goldenrod:"#daa520",gray:"#808080",green:"#008000",greenyellow:"#adff2f",grey:"#808080",honeydew:"#f0fff0",hotpink:"#ff69b4",indianred:"#cd5c5c",indigo:"#4b0082",ivory:"#fffff0",khaki:"#f0e68c",lavender:"#e6e6fa",lavenderblush:"#fff0f5",lawngreen:"#7cfc00",lemonchiffon:"#fffacd",lightblue:"#add8e6",lightcoral:"#f08080",lightcyan:"#e0ffff",lightgoldenrodyellow:"#fafad2",lightgray:"#d3d3d3",lightgreen:"#90ee90",lightgrey:"#d3d3d3",lightpink:"#ffb6c1",lightsalmon:"#ffa07a",lightseagreen:"#20b2aa",lightskyblue:"#87cefa",lightslategray:"#778899",lightslategrey:"#778899",lightsteelblue:"#b0c4de",lightyellow:"#ffffe0",lime:"#00ff00",limegreen:"#32cd32",linen:"#faf0e6",magenta:"#ff00ff",maroon:"#800000",mediumaquamarine:"#66cdaa",mediumblue:"#0000cd",mediumorchid:"#ba55d3",mediumpurple:"#9370db",mediumseagreen:"#3cb371",mediumslateblue:"#7b68ee",mediumspringgreen:"#00fa9a",mediumturquoise:"#48d1cc",mediumvioletred:"#c71585",midnightblue:"#191970",mintcream:"#f5fffa",mistyrose:"#ffe4e1",moccasin:"#ffe4b5",navajowhite:"#ffdead",navy:"#000080",oldlace:"#fdf5e6",olive:"#808000",olivedrab:"#6b8e23",orange:"#ffa500",orangered:"#ff4500",orchid:"#da70d6",palegoldenrod:"#eee8aa",palegreen:"#98fb98",paleturquoise:"#afeeee",palevioletred:"#db7093",papayawhip:"#ffefd5",peachpuff:"#ffdab9",peru:"#cd853f",pink:"#ffc0cb",plum:"#dda0dd",powderblue:"#b0e0e6",purple:"#800080",rebeccapurple:"#663399",red:"#ff0000",rosybrown:"#bc8f8f",royalblue:"#4169e1",saddlebrown:"#8b4513",salmon:"#fa8072",sandybrown:"#f4a460",seagreen:"#2e8b57",seashell:"#fff5ee",sienna:"#a0522d",silver:"#c0c0c0",skyblue:"#87ceeb",slateblue:"#6a5acd",slategray:"#708090",slategrey:"#708090",snow:"#fffafa",springgreen:"#00ff7f",tan:"#d2b48c",teal:"#008080",thistle:"#d8bfd8",transparent:"#00000000",turquoise:"#40e0d0",violet:"#ee82ee",wheat:"#f5deb3",white:"#ffffff",whitesmoke:"#f5f5f5",yellow:"#ffff00",yellowgreen:"#9acd32"},parse:function(t){t=t.toLowerCase();var e=i.colors[t];if(e)return r.default.parse(e)},stringify:function(t){var e=r.default.stringify(t);for(var n in i.colors)if(i.colors[n]===e)return n}};e.default=i},function(t,e,n){"use strict";Object.defineProperty(e,"__esModule",{value:!0});var r=n(9),i=n(45),a={re:/^rgba?\(\s*?(-?(?:\d+(?:\.\d+)?|(?:\.\d+))(?:e\d+)?(%?))\s*?(?:,|\s)\s*?(-?(?:\d+(?:\.\d+)?|(?:\.\d+))(?:e\d+)?(%?))\s*?(?:,|\s)\s*?(-?(?:\d+(?:\.\d+)?|(?:\.\d+))(?:e\d+)?(%?))(?:\s*?(?:,|\/)\s*?\+?(-?(?:\d+(?:\.\d+)?|(?:\.\d+))(?:e\d+)?(%?)))?\s*?\)$/i,parse:function(t){var e=t.charCodeAt(0);if(114===e||82===e){var n=t.match(a.re);if(n){var o=n[1],s=n[2],c=n[3],u=n[4],l=n[5],h=n[6],f=n[7],d=n[8];return i.default.set({r:r.default.channel.clamp.r(s?2.55*parseFloat(o):parseFloat(o)),g:r.default.channel.clamp.g(u?2.55*parseFloat(c):parseFloat(c)),b:r.default.channel.clamp.b(h?2.55*parseFloat(l):parseFloat(l)),a:f?r.default.channel.clamp.a(d?parseFloat(f)/100:parseFloat(f)):1},t)}}},stringify:function(t){return t.a<1?"rgba("+r.default.lang.round(t.r)+", "+r.default.lang.round(t.g)+", "+r.default.lang.round(t.b)+", "+r.default.lang.round(t.a)+")":"rgb("+r.default.lang.round(t.r)+", "+r.default.lang.round(t.g)+", "+r.default.lang.round(t.b)+")"}};e.default=a},function(t,e,n){"use strict";Object.defineProperty(e,"__esModule",{value:!0});var r=n(9),i=n(45),a={re:/^hsla?\(\s*?(-?(?:\d+(?:\.\d+)?|(?:\.\d+))(?:e-?\d+)?(?:deg|grad|rad|turn)?)\s*?(?:,|\s)\s*?(-?(?:\d+(?:\.\d+)?|(?:\.\d+))(?:e-?\d+)?%)\s*?(?:,|\s)\s*?(-?(?:\d+(?:\.\d+)?|(?:\.\d+))(?:e-?\d+)?%)(?:\s*?(?:,|\/)\s*?\+?(-?(?:\d+(?:\.\d+)?|(?:\.\d+))(?:e-?\d+)?(%)?))?\s*?\)$/i,hueRe:/^(.+?)(deg|grad|rad|turn)$/i,_hue2deg:function(t){var e=t.match(a.hueRe);if(e){var n=e[1];switch(e[2]){case"grad":return r.default.channel.clamp.h(.9*parseFloat(n));case"rad":return r.default.channel.clamp.h(180*parseFloat(n)/Math.PI);case"turn":return r.default.channel.clamp.h(360*parseFloat(n))}}return r.default.channel.clamp.h(parseFloat(t))},parse:function(t){var e=t.charCodeAt(0);if(104===e||72===e){var n=t.match(a.re);if(n){var o=n[1],s=n[2],c=n[3],u=n[4],l=n[5];return i.default.set({h:a._hue2deg(o),s:r.default.channel.clamp.s(parseFloat(s)),l:r.default.channel.clamp.l(parseFloat(c)),a:u?r.default.channel.clamp.a(l?parseFloat(u)/100:parseFloat(u)):1},t)}}},stringify:function(t){return t.a<1?"hsla("+r.default.lang.round(t.h)+", "+r.default.lang.round(t.s)+"%, "+r.default.lang.round(t.l)+"%, "+t.a+")":"hsl("+r.default.lang.round(t.h)+", "+r.default.lang.round(t.s)+"%, "+r.default.lang.round(t.l)+"%)"}};e.default=a},function(t,e,n){"use strict";Object.defineProperty(e,"__esModule",{value:!0});var r=n(29);e.default=function(t){return r.default(t,"r")}},function(t,e,n){"use strict";Object.defineProperty(e,"__esModule",{value:!0});var r=n(29);e.default=function(t){return r.default(t,"g")}},function(t,e,n){"use strict";Object.defineProperty(e,"__esModule",{value:!0});var r=n(29);e.default=function(t){return r.default(t,"b")}},function(t,e,n){"use strict";Object.defineProperty(e,"__esModule",{value:!0});var r=n(29);e.default=function(t){return r.default(t,"h")}},function(t,e,n){"use strict";Object.defineProperty(e,"__esModule",{value:!0});var r=n(29);e.default=function(t){return r.default(t,"s")}},function(t,e,n){"use strict";Object.defineProperty(e,"__esModule",{value:!0});var r=n(29);e.default=function(t){return r.default(t,"l")}},function(t,e,n){"use strict";Object.defineProperty(e,"__esModule",{value:!0});var r=n(103);e.default=function(t){return!r.default(t)}},function(t,e,n){"use strict";Object.defineProperty(e,"__esModule",{value:!0});var r=n(15);e.default=function(t){try{return r.default.parse(t),!0}catch(t){return!1}}},function(t,e,n){"use strict";Object.defineProperty(e,"__esModule",{value:!0});var r=n(32);e.default=function(t,e){return r.default(t,"s",e)}},function(t,e,n){"use strict";Object.defineProperty(e,"__esModule",{value:!0});var r=n(32);e.default=function(t,e){return r.default(t,"s",-e)}},function(t,e,n){"use strict";Object.defineProperty(e,"__esModule",{value:!0});var r=n(32);e.default=function(t,e){return r.default(t,"l",e)}},function(t,e,n){"use strict";Object.defineProperty(e,"__esModule",{value:!0});var r=n(32);e.default=function(t,e){return r.default(t,"l",-e)}},function(t,e,n){"use strict";Object.defineProperty(e,"__esModule",{value:!0});var r=n(32);e.default=function(t){return r.default(t,"h",180)}},function(t,e,n){"use strict";Object.defineProperty(e,"__esModule",{value:!0});var r=n(52);e.default=function(t){return r.default(t,{s:0})}},function(t,e,n){"use strict";Object.defineProperty(e,"__esModule",{value:!0});var r=n(15),i=n(107);e.default=function(t,e){void 0===e&&(e=100);var n=r.default.parse(t);return n.r=255-n.r,n.g=255-n.g,n.b=255-n.b,i.default(n,t,e)}},function(t,e,n){"use strict";Object.defineProperty(e,"__esModule",{value:!0});var r=n(9),i=n(15),a=n(106);e.default=function(t,e){var n,o,s,c=i.default.parse(t),u={};for(var l in e)u[l]=(n=c[l],o=e[l],s=r.default.channel.max[l],o>0?(s-n)*o/100:n*o/100);return a.default(t,u)}},function(t,e,n){t.exports={Graph:n(76),version:n(300)}},function(t,e,n){var r=n(108);t.exports=function(t){return r(t,4)}},function(t,e){t.exports=function(){this.__data__=[],this.size=0}},function(t,e,n){var r=n(55),i=Array.prototype.splice;t.exports=function(t){var e=this.__data__,n=r(e,t);return!(n<0)&&(n==e.length-1?e.pop():i.call(e,n,1),--this.size,!0)}},function(t,e,n){var r=n(55);t.exports=function(t){var e=this.__data__,n=r(e,t);return n<0?void 0:e[n][1]}},function(t,e,n){var r=n(55);t.exports=function(t){return r(this.__data__,t)>-1}},function(t,e,n){var r=n(55);t.exports=function(t,e){var n=this.__data__,i=r(n,t);return i<0?(++this.size,n.push([t,e])):n[i][1]=e,this}},function(t,e,n){var r=n(54);t.exports=function(){this.__data__=new r,this.size=0}},function(t,e){t.exports=function(t){var e=this.__data__,n=e.delete(t);return this.size=e.size,n}},function(t,e){t.exports=function(t){return this.__data__.get(t)}},function(t,e){t.exports=function(t){return this.__data__.has(t)}},function(t,e,n){var r=n(54),i=n(77),a=n(78);t.exports=function(t,e){var n=this.__data__;if(n instanceof r){var o=n.__data__;if(!i||o.length<199)return o.push([t,e]),this.size=++n.size,this;n=this.__data__=new a(o)}return n.set(t,e),this.size=n.size,this}},function(t,e,n){var r=n(37),i=n(214),a=n(11),o=n(110),s=/^\[object .+?Constructor\]$/,c=Function.prototype,u=Object.prototype,l=c.toString,h=u.hasOwnProperty,f=RegExp("^"+l.call(h).replace(/[\\^$.*+?()[\]{}|]/g,"\\$&").replace(/hasOwnProperty|(function).*?(?=\\\()| for .+?(?=\\\])/g,"$1.*?")+"$");t.exports=function(t){return!(!a(t)||i(t))&&(r(t)?f:s).test(o(t))}},function(t,e){var n;n=function(){return this}();try{n=n||new Function("return this")()}catch(t){"object"==typeof window&&(n=window)}t.exports=n},function(t,e,n){var r=n(38),i=Object.prototype,a=i.hasOwnProperty,o=i.toString,s=r?r.toStringTag:void 0;t.exports=function(t){var e=a.call(t,s),n=t[s];try{t[s]=void 0;var r=!0}catch(t){}var i=o.call(t);return r&&(e?t[s]=n:delete t[s]),i}},function(t,e){var n=Object.prototype.toString;t.exports=function(t){return n.call(t)}},function(t,e,n){var r,i=n(215),a=(r=/[^.]+$/.exec(i&&i.keys&&i.keys.IE_PROTO||""))?"Symbol(src)_1."+r:"";t.exports=function(t){return!!a&&a in t}},function(t,e,n){var r=n(16)["__core-js_shared__"];t.exports=r},function(t,e){t.exports=function(t,e){return null==t?void 0:t[e]}},function(t,e,n){var r=n(218),i=n(54),a=n(77);t.exports=function(){this.size=0,this.__data__={hash:new r,map:new(a||i),string:new r}}},function(t,e,n){var r=n(219),i=n(220),a=n(221),o=n(222),s=n(223);function c(t){var e=-1,n=null==t?0:t.length;for(this.clear();++e<n;){var r=t[e];this.set(r[0],r[1])}}c.prototype.clear=r,c.prototype.delete=i,c.prototype.get=a,c.prototype.has=o,c.prototype.set=s,t.exports=c},function(t,e,n){var r=n(56);t.exports=function(){this.__data__=r?r(null):{},this.size=0}},function(t,e){t.exports=function(t){var e=this.has(t)&&delete this.__data__[t];return this.size-=e?1:0,e}},function(t,e,n){var r=n(56),i=Object.prototype.hasOwnProperty;t.exports=function(t){var e=this.__data__;if(r){var n=e[t];return"__lodash_hash_undefined__"===n?void 0:n}return i.call(e,t)?e[t]:void 0}},function(t,e,n){var r=n(56),i=Object.prototype.hasOwnProperty;t.exports=function(t){var e=this.__data__;return r?void 0!==e[t]:i.call(e,t)}},function(t,e,n){var r=n(56);t.exports=function(t,e){var n=this.__data__;return this.size+=this.has(t)?0:1,n[t]=r&&void 0===e?"__lodash_hash_undefined__":e,this}},function(t,e,n){var r=n(57);t.exports=function(t){var e=r(this,t).delete(t);return this.size-=e?1:0,e}},function(t,e){t.exports=function(t){var e=typeof t;return"string"==e||"number"==e||"symbol"==e||"boolean"==e?"__proto__"!==t:null===t}},function(t,e,n){var r=n(57);t.exports=function(t){return r(this,t).get(t)}},function(t,e,n){var r=n(57);t.exports=function(t){return r(this,t).has(t)}},function(t,e,n){var r=n(57);t.exports=function(t,e){var n=r(this,t),i=n.size;return n.set(t,e),this.size+=n.size==i?0:1,this}},function(t,e,n){var r=n(46),i=n(30);t.exports=function(t,e){return t&&r(e,i(e),t)}},function(t,e){t.exports=function(t,e){for(var n=-1,r=Array(t);++n<t;)r[n]=e(n);return r}},function(t,e,n){var r=n(34),i=n(21);t.exports=function(t){return i(t)&&"[object Arguments]"==r(t)}},function(t,e){t.exports=function(){return!1}},function(t,e,n){var r=n(34),i=n(80),a=n(21),o={};o["[object Float32Array]"]=o["[object Float64Array]"]=o["[object Int8Array]"]=o["[object Int16Array]"]=o["[object Int32Array]"]=o["[object Uint8Array]"]=o["[object Uint8ClampedArray]"]=o["[object Uint16Array]"]=o["[object Uint32Array]"]=!0,o["[object Arguments]"]=o["[object Array]"]=o["[object ArrayBuffer]"]=o["[object Boolean]"]=o["[object DataView]"]=o["[object Date]"]=o["[object Error]"]=o["[object Function]"]=o["[object Map]"]=o["[object Number]"]=o["[object Object]"]=o["[object RegExp]"]=o["[object Set]"]=o["[object String]"]=o["[object WeakMap]"]=!1,t.exports=function(t){return a(t)&&i(t.length)&&!!o[r(t)]}},function(t,e,n){var r=n(113)(Object.keys,Object);t.exports=r},function(t,e,n){var r=n(46),i=n(40);t.exports=function(t,e){return t&&r(e,i(e),t)}},function(t,e,n){var r=n(11),i=n(62),a=n(237),o=Object.prototype.hasOwnProperty;t.exports=function(t){if(!r(t))return a(t);var e=i(t),n=[];for(var s in t)("constructor"!=s||!e&&o.call(t,s))&&n.push(s);return n}},function(t,e){t.exports=function(t){var e=[];if(null!=t)for(var n in Object(t))e.push(n);return e}},function(t,e,n){var r=n(46),i=n(83);t.exports=function(t,e){return r(t,i(t),e)}},function(t,e,n){var r=n(46),i=n(118);t.exports=function(t,e){return r(t,i(t),e)}},function(t,e,n){var r=n(120),i=n(118),a=n(40);t.exports=function(t){return r(t,a,i)}},function(t,e,n){var r=n(33)(n(16),"DataView");t.exports=r},function(t,e,n){var r=n(33)(n(16),"Promise");t.exports=r},function(t,e,n){var r=n(33)(n(16),"WeakMap");t.exports=r},function(t,e){var n=Object.prototype.hasOwnProperty;t.exports=function(t){var e=t.length,r=new t.constructor(e);return e&&"string"==typeof t[0]&&n.call(t,"index")&&(r.index=t.index,r.input=t.input),r}},function(t,e,n){var r=n(85),i=n(246),a=n(247),o=n(248),s=n(123);t.exports=function(t,e,n){var c=t.constructor;switch(e){case"[object ArrayBuffer]":return r(t);case"[object Boolean]":case"[object Date]":return new c(+t);case"[object DataView]":return i(t,n);case"[object Float32Array]":case"[object Float64Array]":case"[object Int8Array]":case"[object Int16Array]":case"[object Int32Array]":case"[object Uint8Array]":case"[object Uint8ClampedArray]":case"[object Uint16Array]":case"[object Uint32Array]":return s(t,n);case"[object Map]":return new c;case"[object Number]":case"[object String]":return new c(t);case"[object RegExp]":return a(t);case"[object Set]":return new c;case"[object Symbol]":return o(t)}}},function(t,e,n){var r=n(85);t.exports=function(t,e){var n=e?r(t.buffer):t.buffer;return new t.constructor(n,t.byteOffset,t.byteLength)}},function(t,e){var n=/\w*$/;t.exports=function(t){var e=new t.constructor(t.source,n.exec(t));return e.lastIndex=t.lastIndex,e}},function(t,e,n){var r=n(38),i=r?r.prototype:void 0,a=i?i.valueOf:void 0;t.exports=function(t){return a?Object(a.call(t)):{}}},function(t,e,n){var r=n(250),i=n(61),a=n(81),o=a&&a.isMap,s=o?i(o):r;t.exports=s},function(t,e,n){var r=n(41),i=n(21);t.exports=function(t){return i(t)&&"[object Map]"==r(t)}},function(t,e,n){var r=n(252),i=n(61),a=n(81),o=a&&a.isSet,s=o?i(o):r;t.exports=s},function(t,e,n){var r=n(41),i=n(21);t.exports=function(t){return i(t)&&"[object Set]"==r(t)}},function(t,e){t.exports=function(t){return function(e,n,r){for(var i=-1,a=Object(e),o=r(e),s=o.length;s--;){var c=o[t?s:++i];if(!1===n(a[c],c,a))break}return e}}},function(t,e,n){var r=n(24);t.exports=function(t,e){return function(n,i){if(null==n)return n;if(!r(n))return t(n,i);for(var a=n.length,o=e?a:-1,s=Object(n);(e?o--:++o<a)&&!1!==i(s[o],o,s););return n}}},function(t,e,n){var r=n(64);t.exports=function(t,e){var n=[];return r(t,(function(t,r,i){e(t,r,i)&&n.push(t)})),n}},function(t,e,n){var r=n(257),i=n(265),a=n(134);t.exports=function(t){var e=i(t);return 1==e.length&&e[0][2]?a(e[0][0],e[0][1]):function(n){return n===t||r(n,t,e)}}},function(t,e,n){var r=n(53),i=n(129);t.exports=function(t,e,n,a){var o=n.length,s=o,c=!a;if(null==t)return!s;for(t=Object(t);o--;){var u=n[o];if(c&&u[2]?u[1]!==t[u[0]]:!(u[0]in t))return!1}for(;++o<s;){var l=(u=n[o])[0],h=t[l],f=u[1];if(c&&u[2]){if(void 0===h&&!(l in t))return!1}else{var d=new r;if(a)var p=a(h,f,l,t,e,d);if(!(void 0===p?i(f,h,3,a,d):p))return!1}}return!0}},function(t,e,n){var r=n(53),i=n(130),a=n(262),o=n(264),s=n(41),c=n(5),u=n(39),l=n(48),h="[object Object]",f=Object.prototype.hasOwnProperty;t.exports=function(t,e,n,d,p,g){var y=c(t),v=c(e),m=y?"[object Array]":s(t),b=v?"[object Array]":s(e),x=(m="[object Arguments]"==m?h:m)==h,_=(b="[object Arguments]"==b?h:b)==h,k=m==b;if(k&&u(t)){if(!u(e))return!1;y=!0,x=!1}if(k&&!x)return g||(g=new r),y||l(t)?i(t,e,n,d,p,g):a(t,e,m,n,d,p,g);if(!(1&n)){var w=x&&f.call(t,"__wrapped__"),E=_&&f.call(e,"__wrapped__");if(w||E){var T=w?t.value():t,C=E?e.value():e;return g||(g=new r),p(T,C,n,d,g)}}return!!k&&(g||(g=new r),o(t,e,n,d,p,g))}},function(t,e){t.exports=function(t){return this.__data__.set(t,"__lodash_hash_undefined__"),this}},function(t,e){t.exports=function(t){return this.__data__.has(t)}},function(t,e){t.exports=function(t,e){for(var n=-1,r=null==t?0:t.length;++n<r;)if(e(t[n],n,t))return!0;return!1}},function(t,e,n){var r=n(38),i=n(122),a=n(36),o=n(130),s=n(263),c=n(90),u=r?r.prototype:void 0,l=u?u.valueOf:void 0;t.exports=function(t,e,n,r,u,h,f){switch(n){case"[object DataView]":if(t.byteLength!=e.byteLength||t.byteOffset!=e.byteOffset)return!1;t=t.buffer,e=e.buffer;case"[object ArrayBuffer]":return!(t.byteLength!=e.byteLength||!h(new i(t),new i(e)));case"[object Boolean]":case"[object Date]":case"[object Number]":return a(+t,+e);case"[object Error]":return t.name==e.name&&t.message==e.message;case"[object RegExp]":case"[object String]":return t==e+"";case"[object Map]":var d=s;case"[object Set]":var p=1&r;if(d||(d=c),t.size!=e.size&&!p)return!1;var g=f.get(t);if(g)return g==e;r|=2,f.set(t,e);var y=o(d(t),d(e),r,u,h,f);return f.delete(t),y;case"[object Symbol]":if(l)return l.call(t)==l.call(e)}return!1}},function(t,e){t.exports=function(t){var e=-1,n=Array(t.size);return t.forEach((function(t,r){n[++e]=[r,t]})),n}},function(t,e,n){var r=n(119),i=Object.prototype.hasOwnProperty;t.exports=function(t,e,n,a,o,s){var c=1&n,u=r(t),l=u.length;if(l!=r(e).length&&!c)return!1;for(var h=l;h--;){var f=u[h];if(!(c?f in e:i.call(e,f)))return!1}var d=s.get(t);if(d&&s.get(e))return d==e;var p=!0;s.set(t,e),s.set(e,t);for(var g=c;++h<l;){var y=t[f=u[h]],v=e[f];if(a)var m=c?a(v,y,f,e,t,s):a(y,v,f,t,e,s);if(!(void 0===m?y===v||o(y,v,n,a,s):m)){p=!1;break}g||(g="constructor"==f)}if(p&&!g){var b=t.constructor,x=e.constructor;b!=x&&"constructor"in t&&"constructor"in e&&!("function"==typeof b&&b instanceof b&&"function"==typeof x&&x instanceof x)&&(p=!1)}return s.delete(t),s.delete(e),p}},function(t,e,n){var r=n(133),i=n(30);t.exports=function(t){for(var e=i(t),n=e.length;n--;){var a=e[n],o=t[a];e[n]=[a,o,r(o)]}return e}},function(t,e,n){var r=n(129),i=n(267),a=n(136),o=n(92),s=n(133),c=n(134),u=n(49);t.exports=function(t,e){return o(t)&&s(e)?c(u(t),e):function(n){var o=i(n,t);return void 0===o&&o===e?a(n,t):r(e,o,3)}}},function(t,e,n){var r=n(91);t.exports=function(t,e,n){var i=null==t?void 0:r(t,e);return void 0===i?n:i}},function(t,e,n){var r=n(269),i=/[^.[\]]+|\[(?:(-?\d+(?:\.\d+)?)|(["'])((?:(?!\2)[^\\]|\\.)*?)\2)\]|(?=(?:\.|\[\])(?:\.|\[\]|$))/g,a=/\\(\\)?/g,o=r((function(t){var e=[];return 46===t.charCodeAt(0)&&e.push(""),t.replace(i,(function(t,n,r,i){e.push(r?i.replace(a,"$1"):n||t)})),e}));t.exports=o},function(t,e,n){var r=n(270);t.exports=function(t){var e=r(t,(function(t){return 500===n.size&&n.clear(),t})),n=e.cache;return e}},function(t,e,n){var r=n(78);function i(t,e){if("function"!=typeof t||null!=e&&"function"!=typeof e)throw new TypeError("Expected a function");var n=function(){var r=arguments,i=e?e.apply(this,r):r[0],a=n.cache;if(a.has(i))return a.get(i);var o=t.apply(this,r);return n.cache=a.set(i,o)||a,o};return n.cache=new(i.Cache||r),n}i.Cache=r,t.exports=i},function(t,e,n){var r=n(38),i=n(66),a=n(5),o=n(42),s=r?r.prototype:void 0,c=s?s.toString:void 0;t.exports=function t(e){if("string"==typeof e)return e;if(a(e))return i(e,t)+"";if(o(e))return c?c.call(e):"";var n=e+"";return"0"==n&&1/e==-1/0?"-0":n}},function(t,e){t.exports=function(t,e){return null!=t&&e in Object(t)}},function(t,e,n){var r=n(138),i=n(274),a=n(92),o=n(49);t.exports=function(t){return a(t)?r(o(t)):i(t)}},function(t,e,n){var r=n(91);t.exports=function(t){return function(e){return r(e,t)}}},function(t,e){var n=Object.prototype.hasOwnProperty;t.exports=function(t,e){return null!=t&&n.call(t,e)}},function(t,e,n){var r=n(82),i=n(41),a=n(47),o=n(5),s=n(24),c=n(39),u=n(62),l=n(48),h=Object.prototype.hasOwnProperty;t.exports=function(t){if(null==t)return!0;if(s(t)&&(o(t)||"string"==typeof t||"function"==typeof t.splice||c(t)||l(t)||a(t)))return!t.length;var e=i(t);if("[object Map]"==e||"[object Set]"==e)return!t.size;if(u(t))return!r(t).length;for(var n in t)if(h.call(t,n))return!1;return!0}},function(t,e){t.exports=function(t,e,n,r){var i=-1,a=null==t?0:t.length;for(r&&a&&(n=t[++i]);++i<a;)n=e(n,t[i],i,t);return n}},function(t,e){t.exports=function(t,e,n,r,i){return i(t,(function(t,i,a){n=r?(r=!1,t):e(n,t,i,a)})),n}},function(t,e,n){var r=n(82),i=n(41),a=n(24),o=n(280),s=n(281);t.exports=function(t){if(null==t)return 0;if(a(t))return o(t)?s(t):t.length;var e=i(t);return"[object Map]"==e||"[object Set]"==e?t.size:r(t).length}},function(t,e,n){var r=n(34),i=n(5),a=n(21);t.exports=function(t){return"string"==typeof t||!i(t)&&a(t)&&"[object String]"==r(t)}},function(t,e,n){var r=n(282),i=n(283),a=n(284);t.exports=function(t){return i(t)?a(t):r(t)}},function(t,e,n){var r=n(138)("length");t.exports=r},function(t,e){var n=RegExp("[\\u200d\\ud800-\\udfff\\u0300-\\u036f\\ufe20-\\ufe2f\\u20d0-\\u20ff\\ufe0e\\ufe0f]");t.exports=function(t){return n.test(t)}},function(t,e){var n="[\\ud800-\\udfff]",r="[\\u0300-\\u036f\\ufe20-\\ufe2f\\u20d0-\\u20ff]",i="\\ud83c[\\udffb-\\udfff]",a="[^\\ud800-\\udfff]",o="(?:\\ud83c[\\udde6-\\uddff]){2}",s="[\\ud800-\\udbff][\\udc00-\\udfff]",c="(?:"+r+"|"+i+")"+"?",u="[\\ufe0e\\ufe0f]?"+c+("(?:\\u200d(?:"+[a,o,s].join("|")+")[\\ufe0e\\ufe0f]?"+c+")*"),l="(?:"+[a+r+"?",r,o,s,n].join("|")+")",h=RegExp(i+"(?="+i+")|"+l+u,"g");t.exports=function(t){for(var e=h.lastIndex=0;h.test(t);)++e;return e}},function(t,e,n){var r=n(79),i=n(125),a=n(88),o=n(25),s=n(63),c=n(5),u=n(39),l=n(37),h=n(11),f=n(48);t.exports=function(t,e,n){var d=c(t),p=d||u(t)||f(t);if(e=o(e,4),null==n){var g=t&&t.constructor;n=p?d?new g:[]:h(t)&&l(g)?i(s(t)):{}}return(p?r:a)(t,(function(t,r,i){return e(n,t,r,i)})),n}},function(t,e,n){var r=n(94),i=n(67),a=n(291),o=n(146),s=i((function(t){return a(r(t,1,o,!0))}));t.exports=s},function(t,e,n){var r=n(38),i=n(47),a=n(5),o=r?r.isConcatSpreadable:void 0;t.exports=function(t){return a(t)||i(t)||!!(o&&t&&t[o])}},function(t,e){t.exports=function(t,e,n){switch(n.length){case 0:return t.call(e);case 1:return t.call(e,n[0]);case 2:return t.call(e,n[0],n[1]);case 3:return t.call(e,n[0],n[1],n[2])}return t.apply(e,n)}},function(t,e,n){var r=n(86),i=n(111),a=n(35),o=i?function(t,e){return i(t,"toString",{configurable:!0,enumerable:!1,value:r(e),writable:!0})}:a;t.exports=o},function(t,e){var n=Date.now;t.exports=function(t){var e=0,r=0;return function(){var i=n(),a=16-(i-r);if(r=i,a>0){if(++e>=800)return arguments[0]}else e=0;return t.apply(void 0,arguments)}}},function(t,e,n){var r=n(131),i=n(292),a=n(296),o=n(132),s=n(297),c=n(90);t.exports=function(t,e,n){var u=-1,l=i,h=t.length,f=!0,d=[],p=d;if(n)f=!1,l=a;else if(h>=200){var g=e?null:s(t);if(g)return c(g);f=!1,l=o,p=new r}else p=e?[]:d;t:for(;++u<h;){var y=t[u],v=e?e(y):y;if(y=n||0!==y?y:0,f&&v==v){for(var m=p.length;m--;)if(p[m]===v)continue t;e&&p.push(v),d.push(y)}else l(p,v,n)||(p!==d&&p.push(v),d.push(y))}return d}},function(t,e,n){var r=n(293);t.exports=function(t,e){return!!(null==t?0:t.length)&&r(t,e,0)>-1}},function(t,e,n){var r=n(145),i=n(294),a=n(295);t.exports=function(t,e,n){return e==e?a(t,e,n):r(t,i,n)}},function(t,e){t.exports=function(t){return t!=t}},function(t,e){t.exports=function(t,e,n){for(var r=n-1,i=t.length;++r<i;)if(t[r]===e)return r;return-1}},function(t,e){t.exports=function(t,e,n){for(var r=-1,i=null==t?0:t.length;++r<i;)if(n(e,t[r]))return!0;return!1}},function(t,e,n){var r=n(121),i=n(298),a=n(90),o=r&&1/a(new r([,-0]))[1]==1/0?function(t){return new r(t)}:i;t.exports=o},function(t,e){t.exports=function(){}},function(t,e,n){var r=n(66);t.exports=function(t,e){return r(e,(function(e){return t[e]}))}},function(t,e){t.exports="2.1.8"},function(t,e,n){var r=n(10),i=n(76);function a(t){return r.map(t.nodes(),(function(e){var n=t.node(e),i=t.parent(e),a={v:e};return r.isUndefined(n)||(a.value=n),r.isUndefined(i)||(a.parent=i),a}))}function o(t){return r.map(t.edges(),(function(e){var n=t.edge(e),i={v:e.v,w:e.w};return r.isUndefined(e.name)||(i.name=e.name),r.isUndefined(n)||(i.value=n),i}))}t.exports={write:function(t){var e={options:{directed:t.isDirected(),multigraph:t.isMultigraph(),compound:t.isCompound()},nodes:a(t),edges:o(t)};r.isUndefined(t.graph())||(e.value=r.clone(t.graph()));return e},read:function(t){var e=new i(t.options).setGraph(t.value);return r.each(t.nodes,(function(t){e.setNode(t.v,t.value),t.parent&&e.setParent(t.v,t.parent)})),r.each(t.edges,(function(t){e.setEdge({v:t.v,w:t.w,name:t.name},t.value)})),e}}},function(t,e,n){t.exports={components:n(303),dijkstra:n(148),dijkstraAll:n(304),findCycles:n(305),floydWarshall:n(306),isAcyclic:n(307),postorder:n(308),preorder:n(309),prim:n(310),tarjan:n(150),topsort:n(151)}},function(t,e,n){var r=n(10);t.exports=function(t){var e,n={},i=[];function a(i){r.has(n,i)||(n[i]=!0,e.push(i),r.each(t.successors(i),a),r.each(t.predecessors(i),a))}return r.each(t.nodes(),(function(t){e=[],a(t),e.length&&i.push(e)})),i}},function(t,e,n){var r=n(148),i=n(10);t.exports=function(t,e,n){return i.transform(t.nodes(),(function(i,a){i[a]=r(t,a,e,n)}),{})}},function(t,e,n){var r=n(10),i=n(150);t.exports=function(t){return r.filter(i(t),(function(e){return e.length>1||1===e.length&&t.hasEdge(e[0],e[0])}))}},function(t,e,n){var r=n(10);t.exports=function(t,e,n){return function(t,e,n){var r={},i=t.nodes();return i.forEach((function(t){r[t]={},r[t][t]={distance:0},i.forEach((function(e){t!==e&&(r[t][e]={distance:Number.POSITIVE_INFINITY})})),n(t).forEach((function(n){var i=n.v===t?n.w:n.v,a=e(n);r[t][i]={distance:a,predecessor:t}}))})),i.forEach((function(t){var e=r[t];i.forEach((function(n){var a=r[n];i.forEach((function(n){var r=a[t],i=e[n],o=a[n],s=r.distance+i.distance;s<o.distance&&(o.distance=s,o.predecessor=i.predecessor)}))}))})),r}(t,e||i,n||function(e){return t.outEdges(e)})};var i=r.constant(1)},function(t,e,n){var r=n(151);t.exports=function(t){try{r(t)}catch(t){if(t instanceof r.CycleException)return!1;throw t}return!0}},function(t,e,n){var r=n(152);t.exports=function(t,e){return r(t,e,"post")}},function(t,e,n){var r=n(152);t.exports=function(t,e){return r(t,e,"pre")}},function(t,e,n){var r=n(10),i=n(76),a=n(149);t.exports=function(t,e){var n,o=new i,s={},c=new a;function u(t){var r=t.v===n?t.w:t.v,i=c.priority(r);if(void 0!==i){var a=e(t);a<i&&(s[r]=n,c.decrease(r,a))}}if(0===t.nodeCount())return o;r.each(t.nodes(),(function(t){c.add(t,Number.POSITIVE_INFINITY),o.setNode(t)})),c.decrease(t.nodes()[0],0);var l=!1;for(;c.size()>0;){if(n=c.removeMin(),r.has(s,n))o.setEdge(n,s[n]);else{if(l)throw new Error("Input graph is not connected: "+t);l=!0}t.nodeEdges(n).forEach(u)}return o}},function(t,e,n){var r;try{r=n(3)}catch(t){}r||(r=window.graphlib),t.exports=r},function(t,e,n){"use strict";var r=n(4),i=n(345),a=n(348),o=n(349),s=n(8).normalizeRanks,c=n(351),u=n(8).removeEmptyRanks,l=n(352),h=n(353),f=n(354),d=n(355),p=n(364),g=n(8),y=n(17).Graph;t.exports=function(t,e){var n=e&&e.debugTiming?g.time:g.notime;n("layout",(function(){var e=n(" buildLayoutGraph",(function(){return function(t){var e=new y({multigraph:!0,compound:!0}),n=C(t.graph());return e.setGraph(r.merge({},m,T(n,v),r.pick(n,b))),r.forEach(t.nodes(),(function(n){var i=C(t.node(n));e.setNode(n,r.defaults(T(i,x),_)),e.setParent(n,t.parent(n))})),r.forEach(t.edges(),(function(n){var i=C(t.edge(n));e.setEdge(n,r.merge({},w,T(i,k),r.pick(i,E)))})),e}(t)}));n(" runLayout",(function(){!function(t,e){e(" makeSpaceForEdgeLabels",(function(){!function(t){var e=t.graph();e.ranksep/=2,r.forEach(t.edges(),(function(n){var r=t.edge(n);r.minlen*=2,"c"!==r.labelpos.toLowerCase()&&("TB"===e.rankdir||"BT"===e.rankdir?r.width+=r.labeloffset:r.height+=r.labeloffset)}))}(t)})),e(" removeSelfEdges",(function(){!function(t){r.forEach(t.edges(),(function(e){if(e.v===e.w){var n=t.node(e.v);n.selfEdges||(n.selfEdges=[]),n.selfEdges.push({e:e,label:t.edge(e)}),t.removeEdge(e)}}))}(t)})),e(" acyclic",(function(){i.run(t)})),e(" nestingGraph.run",(function(){l.run(t)})),e(" rank",(function(){o(g.asNonCompoundGraph(t))})),e(" injectEdgeLabelProxies",(function(){!function(t){r.forEach(t.edges(),(function(e){var n=t.edge(e);if(n.width&&n.height){var r=t.node(e.v),i={rank:(t.node(e.w).rank-r.rank)/2+r.rank,e:e};g.addDummyNode(t,"edge-proxy",i,"_ep")}}))}(t)})),e(" removeEmptyRanks",(function(){u(t)})),e(" nestingGraph.cleanup",(function(){l.cleanup(t)})),e(" normalizeRanks",(function(){s(t)})),e(" assignRankMinMax",(function(){!function(t){var e=0;r.forEach(t.nodes(),(function(n){var i=t.node(n);i.borderTop&&(i.minRank=t.node(i.borderTop).rank,i.maxRank=t.node(i.borderBottom).rank,e=r.max(e,i.maxRank))})),t.graph().maxRank=e}(t)})),e(" removeEdgeLabelProxies",(function(){!function(t){r.forEach(t.nodes(),(function(e){var n=t.node(e);"edge-proxy"===n.dummy&&(t.edge(n.e).labelRank=n.rank,t.removeNode(e))}))}(t)})),e(" normalize.run",(function(){a.run(t)})),e(" parentDummyChains",(function(){c(t)})),e(" addBorderSegments",(function(){h(t)})),e(" order",(function(){d(t)})),e(" insertSelfEdges",(function(){!function(t){var e=g.buildLayerMatrix(t);r.forEach(e,(function(e){var n=0;r.forEach(e,(function(e,i){var a=t.node(e);a.order=i+n,r.forEach(a.selfEdges,(function(e){g.addDummyNode(t,"selfedge",{width:e.label.width,height:e.label.height,rank:a.rank,order:i+ ++n,e:e.e,label:e.label},"_se")})),delete a.selfEdges}))}))}(t)})),e(" adjustCoordinateSystem",(function(){f.adjust(t)})),e(" position",(function(){p(t)})),e(" positionSelfEdges",(function(){!function(t){r.forEach(t.nodes(),(function(e){var n=t.node(e);if("selfedge"===n.dummy){var r=t.node(n.e.v),i=r.x+r.width/2,a=r.y,o=n.x-i,s=r.height/2;t.setEdge(n.e,n.label),t.removeNode(e),n.label.points=[{x:i+2*o/3,y:a-s},{x:i+5*o/6,y:a-s},{x:i+o,y:a},{x:i+5*o/6,y:a+s},{x:i+2*o/3,y:a+s}],n.label.x=n.x,n.label.y=n.y}}))}(t)})),e(" removeBorderNodes",(function(){!function(t){r.forEach(t.nodes(),(function(e){if(t.children(e).length){var n=t.node(e),i=t.node(n.borderTop),a=t.node(n.borderBottom),o=t.node(r.last(n.borderLeft)),s=t.node(r.last(n.borderRight));n.width=Math.abs(s.x-o.x),n.height=Math.abs(a.y-i.y),n.x=o.x+n.width/2,n.y=i.y+n.height/2}})),r.forEach(t.nodes(),(function(e){"border"===t.node(e).dummy&&t.removeNode(e)}))}(t)})),e(" normalize.undo",(function(){a.undo(t)})),e(" fixupEdgeLabelCoords",(function(){!function(t){r.forEach(t.edges(),(function(e){var n=t.edge(e);if(r.has(n,"x"))switch("l"!==n.labelpos&&"r"!==n.labelpos||(n.width-=n.labeloffset),n.labelpos){case"l":n.x-=n.width/2+n.labeloffset;break;case"r":n.x+=n.width/2+n.labeloffset}}))}(t)})),e(" undoCoordinateSystem",(function(){f.undo(t)})),e(" translateGraph",(function(){!function(t){var e=Number.POSITIVE_INFINITY,n=0,i=Number.POSITIVE_INFINITY,a=0,o=t.graph(),s=o.marginx||0,c=o.marginy||0;function u(t){var r=t.x,o=t.y,s=t.width,c=t.height;e=Math.min(e,r-s/2),n=Math.max(n,r+s/2),i=Math.min(i,o-c/2),a=Math.max(a,o+c/2)}r.forEach(t.nodes(),(function(e){u(t.node(e))})),r.forEach(t.edges(),(function(e){var n=t.edge(e);r.has(n,"x")&&u(n)})),e-=s,i-=c,r.forEach(t.nodes(),(function(n){var r=t.node(n);r.x-=e,r.y-=i})),r.forEach(t.edges(),(function(n){var a=t.edge(n);r.forEach(a.points,(function(t){t.x-=e,t.y-=i})),r.has(a,"x")&&(a.x-=e),r.has(a,"y")&&(a.y-=i)})),o.width=n-e+s,o.height=a-i+c}(t)})),e(" assignNodeIntersects",(function(){!function(t){r.forEach(t.edges(),(function(e){var n,r,i=t.edge(e),a=t.node(e.v),o=t.node(e.w);i.points?(n=i.points[0],r=i.points[i.points.length-1]):(i.points=[],n=o,r=a),i.points.unshift(g.intersectRect(a,n)),i.points.push(g.intersectRect(o,r))}))}(t)})),e(" reversePoints",(function(){!function(t){r.forEach(t.edges(),(function(e){var n=t.edge(e);n.reversed&&n.points.reverse()}))}(t)})),e(" acyclic.undo",(function(){i.undo(t)}))}(e,n)})),n(" updateInputGraph",(function(){!function(t,e){r.forEach(t.nodes(),(function(n){var r=t.node(n),i=e.node(n);r&&(r.x=i.x,r.y=i.y,e.children(n).length&&(r.width=i.width,r.height=i.height))})),r.forEach(t.edges(),(function(n){var i=t.edge(n),a=e.edge(n);i.points=a.points,r.has(a,"x")&&(i.x=a.x,i.y=a.y)})),t.graph().width=e.graph().width,t.graph().height=e.graph().height}(t,e)}))}))};var v=["nodesep","edgesep","ranksep","marginx","marginy"],m={ranksep:50,edgesep:20,nodesep:50,rankdir:"tb"},b=["acyclicer","ranker","rankdir","align"],x=["width","height"],_={width:0,height:0},k=["minlen","weight","width","height","labeloffset"],w={minlen:1,weight:1,width:0,height:0,labeloffset:10,labelpos:"r"},E=["labelpos"];function T(t,e){return r.mapValues(r.pick(t,e),Number)}function C(t){var e={};return r.forEach(t,(function(t,n){e[n.toLowerCase()]=t})),e}},function(t,e,n){var r=n(108);t.exports=function(t){return r(t,5)}},function(t,e,n){var r=n(315)(n(316));t.exports=r},function(t,e,n){var r=n(25),i=n(24),a=n(30);t.exports=function(t){return function(e,n,o){var s=Object(e);if(!i(e)){var c=r(n,3);e=a(e),n=function(t){return c(s[t],t,s)}}var u=t(e,n,o);return u>-1?s[c?e[u]:u]:void 0}}},function(t,e,n){var r=n(145),i=n(25),a=n(317),o=Math.max;t.exports=function(t,e,n){var s=null==t?0:t.length;if(!s)return-1;var c=null==n?0:a(n);return c<0&&(c=o(s+c,0)),r(t,i(e,3),c)}},function(t,e,n){var r=n(155);t.exports=function(t){var e=r(t),n=e%1;return e==e?n?e-n:e:0}},function(t,e,n){var r=n(11),i=n(42),a=/^\s+|\s+$/g,o=/^[-+]0x[0-9a-f]+$/i,s=/^0b[01]+$/i,c=/^0o[0-7]+$/i,u=parseInt;t.exports=function(t){if("number"==typeof t)return t;if(i(t))return NaN;if(r(t)){var e="function"==typeof t.valueOf?t.valueOf():t;t=r(e)?e+"":e}if("string"!=typeof t)return 0===t?t:+t;t=t.replace(a,"");var n=s.test(t);return n||c.test(t)?u(t.slice(2),n?2:8):o.test(t)?NaN:+t}},function(t,e,n){var r=n(89),i=n(127),a=n(40);t.exports=function(t,e){return null==t?t:r(t,i(e),a)}},function(t,e){t.exports=function(t){var e=null==t?0:t.length;return e?t[e-1]:void 0}},function(t,e,n){var r=n(59),i=n(88),a=n(25);t.exports=function(t,e){var n={};return e=a(e,3),i(t,(function(t,i,a){r(n,i,e(t,i,a))})),n}},function(t,e,n){var r=n(95),i=n(323),a=n(35);t.exports=function(t){return t&&t.length?r(t,a,i):void 0}},function(t,e){t.exports=function(t,e){return t>e}},function(t,e,n){var r=n(325),i=n(328)((function(t,e,n){r(t,e,n)}));t.exports=i},function(t,e,n){var r=n(53),i=n(157),a=n(89),o=n(326),s=n(11),c=n(40),u=n(159);t.exports=function t(e,n,l,h,f){e!==n&&a(n,(function(a,c){if(f||(f=new r),s(a))o(e,n,c,l,t,h,f);else{var d=h?h(u(e,c),a,c+"",e,n,f):void 0;void 0===d&&(d=a),i(e,c,d)}}),c)}},function(t,e,n){var r=n(157),i=n(114),a=n(123),o=n(115),s=n(124),c=n(47),u=n(5),l=n(146),h=n(39),f=n(37),d=n(11),p=n(158),g=n(48),y=n(159),v=n(327);t.exports=function(t,e,n,m,b,x,_){var k=y(t,n),w=y(e,n),E=_.get(w);if(E)r(t,n,E);else{var T=x?x(k,w,n+"",t,e,_):void 0,C=void 0===T;if(C){var A=u(w),S=!A&&h(w),M=!A&&!S&&g(w);T=w,A||S||M?u(k)?T=k:l(k)?T=o(k):S?(C=!1,T=i(w,!0)):M?(C=!1,T=a(w,!0)):T=[]:p(w)||c(w)?(T=k,c(k)?T=v(k):d(k)&&!f(k)||(T=s(w))):C=!1}C&&(_.set(w,T),b(T,w,m,x,_),_.delete(w)),r(t,n,T)}}},function(t,e,n){var r=n(46),i=n(40);t.exports=function(t){return r(t,i(t))}},function(t,e,n){var r=n(67),i=n(68);t.exports=function(t){return r((function(e,n){var r=-1,a=n.length,o=a>1?n[a-1]:void 0,s=a>2?n[2]:void 0;for(o=t.length>3&&"function"==typeof o?(a--,o):void 0,s&&i(n[0],n[1],s)&&(o=a<3?void 0:o,a=1),e=Object(e);++r<a;){var c=n[r];c&&t(e,c,r,o)}return e}))}},function(t,e,n){var r=n(95),i=n(160),a=n(35);t.exports=function(t){return t&&t.length?r(t,a,i):void 0}},function(t,e,n){var r=n(95),i=n(25),a=n(160);t.exports=function(t,e){return t&&t.length?r(t,i(e,2),a):void 0}},function(t,e,n){var r=n(16);t.exports=function(){return r.Date.now()}},function(t,e,n){var r=n(333),i=n(136);t.exports=function(t,e){return r(t,e,(function(e,n){return i(t,n)}))}},function(t,e,n){var r=n(91),i=n(334),a=n(65);t.exports=function(t,e,n){for(var o=-1,s=e.length,c={};++o<s;){var u=e[o],l=r(t,u);n(l,u)&&i(c,a(u,t),l)}return c}},function(t,e,n){var r=n(58),i=n(65),a=n(60),o=n(11),s=n(49);t.exports=function(t,e,n,c){if(!o(t))return t;for(var u=-1,l=(e=i(e,t)).length,h=l-1,f=t;null!=f&&++u<l;){var d=s(e[u]),p=n;if(u!=h){var g=f[d];void 0===(p=c?c(g,d,f):void 0)&&(p=o(g)?g:a(e[u+1])?[]:{})}r(f,d,p),f=f[d]}return t}},function(t,e,n){var r=n(156),i=n(143),a=n(144);t.exports=function(t){return a(i(t,void 0,r),t+"")}},function(t,e,n){var r=n(337),i=n(68),a=n(155);t.exports=function(t){return function(e,n,o){return o&&"number"!=typeof o&&i(e,n,o)&&(n=o=void 0),e=a(e),void 0===n?(n=e,e=0):n=a(n),o=void 0===o?e<n?1:-1:a(o),r(e,n,o,t)}}},function(t,e){var n=Math.ceil,r=Math.max;t.exports=function(t,e,i,a){for(var o=-1,s=r(n((e-t)/(i||1)),0),c=Array(s);s--;)c[a?s:++o]=t,t+=i;return c}},function(t,e,n){var r=n(94),i=n(339),a=n(67),o=n(68),s=a((function(t,e){if(null==t)return[];var n=e.length;return n>1&&o(t,e[0],e[1])?e=[]:n>2&&o(e[0],e[1],e[2])&&(e=[e[0]]),i(t,r(e,1),[])}));t.exports=s},function(t,e,n){var r=n(66),i=n(25),a=n(141),o=n(340),s=n(61),c=n(341),u=n(35);t.exports=function(t,e,n){var l=-1;e=r(e.length?e:[u],s(i));var h=a(t,(function(t,n,i){return{criteria:r(e,(function(e){return e(t)})),index:++l,value:t}}));return o(h,(function(t,e){return c(t,e,n)}))}},function(t,e){t.exports=function(t,e){var n=t.length;for(t.sort(e);n--;)t[n]=t[n].value;return t}},function(t,e,n){var r=n(342);t.exports=function(t,e,n){for(var i=-1,a=t.criteria,o=e.criteria,s=a.length,c=n.length;++i<s;){var u=r(a[i],o[i]);if(u)return i>=c?u:u*("desc"==n[i]?-1:1)}return t.index-e.index}},function(t,e,n){var r=n(42);t.exports=function(t,e){if(t!==e){var n=void 0!==t,i=null===t,a=t==t,o=r(t),s=void 0!==e,c=null===e,u=e==e,l=r(e);if(!c&&!l&&!o&&t>e||o&&s&&u&&!c&&!l||i&&s&&u||!n&&u||!a)return 1;if(!i&&!o&&!l&&t<e||l&&n&&a&&!i&&!o||c&&n&&a||!s&&a||!u)return-1}return 0}},function(t,e,n){var r=n(58),i=n(344);t.exports=function(t,e){return i(t||[],e||[],r)}},function(t,e){t.exports=function(t,e,n){for(var r=-1,i=t.length,a=e.length,o={};++r<i;){var s=r<a?e[r]:void 0;n(o,t[r],s)}return o}},function(t,e,n){"use strict";var r=n(4),i=n(346);t.exports={run:function(t){var e="greedy"===t.graph().acyclicer?i(t,function(t){return function(e){return t.edge(e).weight}}(t)):function(t){var e=[],n={},i={};function a(o){r.has(i,o)||(i[o]=!0,n[o]=!0,r.forEach(t.outEdges(o),(function(t){r.has(n,t.w)?e.push(t):a(t.w)})),delete n[o])}return r.forEach(t.nodes(),a),e}(t);r.forEach(e,(function(e){var n=t.edge(e);t.removeEdge(e),n.forwardName=e.name,n.reversed=!0,t.setEdge(e.w,e.v,n,r.uniqueId("rev"))}))},undo:function(t){r.forEach(t.edges(),(function(e){var n=t.edge(e);if(n.reversed){t.removeEdge(e);var r=n.forwardName;delete n.reversed,delete n.forwardName,t.setEdge(e.w,e.v,n,r)}}))}}},function(t,e,n){var r=n(4),i=n(17).Graph,a=n(347);t.exports=function(t,e){if(t.nodeCount()<=1)return[];var n=function(t,e){var n=new i,o=0,s=0;r.forEach(t.nodes(),(function(t){n.setNode(t,{v:t,in:0,out:0})})),r.forEach(t.edges(),(function(t){var r=n.edge(t.v,t.w)||0,i=e(t),a=r+i;n.setEdge(t.v,t.w,a),s=Math.max(s,n.node(t.v).out+=i),o=Math.max(o,n.node(t.w).in+=i)}));var u=r.range(s+o+3).map((function(){return new a})),l=o+1;return r.forEach(n.nodes(),(function(t){c(u,l,n.node(t))})),{graph:n,buckets:u,zeroIdx:l}}(t,e||o),u=function(t,e,n){var r,i=[],a=e[e.length-1],o=e[0];for(;t.nodeCount();){for(;r=o.dequeue();)s(t,e,n,r);for(;r=a.dequeue();)s(t,e,n,r);if(t.nodeCount())for(var c=e.length-2;c>0;--c)if(r=e[c].dequeue()){i=i.concat(s(t,e,n,r,!0));break}}return i}(n.graph,n.buckets,n.zeroIdx);return r.flatten(r.map(u,(function(e){return t.outEdges(e.v,e.w)})),!0)};var o=r.constant(1);function s(t,e,n,i,a){var o=a?[]:void 0;return r.forEach(t.inEdges(i.v),(function(r){var i=t.edge(r),s=t.node(r.v);a&&o.push({v:r.v,w:r.w}),s.out-=i,c(e,n,s)})),r.forEach(t.outEdges(i.v),(function(r){var i=t.edge(r),a=r.w,o=t.node(a);o.in-=i,c(e,n,o)})),t.removeNode(i.v),o}function c(t,e,n){n.out?n.in?t[n.out-n.in+e].enqueue(n):t[t.length-1].enqueue(n):t[0].enqueue(n)}},function(t,e){function n(){var t={};t._next=t._prev=t,this._sentinel=t}function r(t){t._prev._next=t._next,t._next._prev=t._prev,delete t._next,delete t._prev}function i(t,e){if("_next"!==t&&"_prev"!==t)return e}t.exports=n,n.prototype.dequeue=function(){var t=this._sentinel,e=t._prev;if(e!==t)return r(e),e},n.prototype.enqueue=function(t){var e=this._sentinel;t._prev&&t._next&&r(t),t._next=e._next,e._next._prev=t,e._next=t,t._prev=e},n.prototype.toString=function(){for(var t=[],e=this._sentinel,n=e._prev;n!==e;)t.push(JSON.stringify(n,i)),n=n._prev;return"["+t.join(", ")+"]"}},function(t,e,n){"use strict";var r=n(4),i=n(8);t.exports={run:function(t){t.graph().dummyChains=[],r.forEach(t.edges(),(function(e){!function(t,e){var n,r,a,o=e.v,s=t.node(o).rank,c=e.w,u=t.node(c).rank,l=e.name,h=t.edge(e),f=h.labelRank;if(u===s+1)return;for(t.removeEdge(e),a=0,++s;s<u;++a,++s)h.points=[],r={width:0,height:0,edgeLabel:h,edgeObj:e,rank:s},n=i.addDummyNode(t,"edge",r,"_d"),s===f&&(r.width=h.width,r.height=h.height,r.dummy="edge-label",r.labelpos=h.labelpos),t.setEdge(o,n,{weight:h.weight},l),0===a&&t.graph().dummyChains.push(n),o=n;t.setEdge(o,c,{weight:h.weight},l)}(t,e)}))},undo:function(t){r.forEach(t.graph().dummyChains,(function(e){var n,r=t.node(e),i=r.edgeLabel;for(t.setEdge(r.edgeObj,i);r.dummy;)n=t.successors(e)[0],t.removeNode(e),i.points.push({x:r.x,y:r.y}),"edge-label"===r.dummy&&(i.x=r.x,i.y=r.y,i.width=r.width,i.height=r.height),e=n,r=t.node(e)}))}}},function(t,e,n){"use strict";var r=n(69).longestPath,i=n(164),a=n(350);t.exports=function(t){switch(t.graph().ranker){case"network-simplex":s(t);break;case"tight-tree":!function(t){r(t),i(t)}(t);break;case"longest-path":o(t);break;default:s(t)}};var o=r;function s(t){a(t)}},function(t,e,n){"use strict";var r=n(4),i=n(164),a=n(69).slack,o=n(69).longestPath,s=n(17).alg.preorder,c=n(17).alg.postorder,u=n(8).simplify;function l(t){t=u(t),o(t);var e,n=i(t);for(d(n),h(n,t);e=g(n);)v(n,t,e,y(n,t,e))}function h(t,e){var n=c(t,t.nodes());n=n.slice(0,n.length-1),r.forEach(n,(function(n){!function(t,e,n){var r=t.node(n).parent;t.edge(n,r).cutvalue=f(t,e,n)}(t,e,n)}))}function f(t,e,n){var i=t.node(n).parent,a=!0,o=e.edge(n,i),s=0;return o||(a=!1,o=e.edge(i,n)),s=o.weight,r.forEach(e.nodeEdges(n),(function(r){var o,c,u=r.v===n,l=u?r.w:r.v;if(l!==i){var h=u===a,f=e.edge(r).weight;if(s+=h?f:-f,o=n,c=l,t.hasEdge(o,c)){var d=t.edge(n,l).cutvalue;s+=h?-d:d}}})),s}function d(t,e){arguments.length<2&&(e=t.nodes()[0]),p(t,{},1,e)}function p(t,e,n,i,a){var o=n,s=t.node(i);return e[i]=!0,r.forEach(t.neighbors(i),(function(a){r.has(e,a)||(n=p(t,e,n,a,i))})),s.low=o,s.lim=n++,a?s.parent=a:delete s.parent,n}function g(t){return r.find(t.edges(),(function(e){return t.edge(e).cutvalue<0}))}function y(t,e,n){var i=n.v,o=n.w;e.hasEdge(i,o)||(i=n.w,o=n.v);var s=t.node(i),c=t.node(o),u=s,l=!1;s.lim>c.lim&&(u=c,l=!0);var h=r.filter(e.edges(),(function(e){return l===m(t,t.node(e.v),u)&&l!==m(t,t.node(e.w),u)}));return r.minBy(h,(function(t){return a(e,t)}))}function v(t,e,n,i){var a=n.v,o=n.w;t.removeEdge(a,o),t.setEdge(i.v,i.w,{}),d(t),h(t,e),function(t,e){var n=r.find(t.nodes(),(function(t){return!e.node(t).parent})),i=s(t,n);i=i.slice(1),r.forEach(i,(function(n){var r=t.node(n).parent,i=e.edge(n,r),a=!1;i||(i=e.edge(r,n),a=!0),e.node(n).rank=e.node(r).rank+(a?i.minlen:-i.minlen)}))}(t,e)}function m(t,e,n){return n.low<=e.lim&&e.lim<=n.lim}t.exports=l,l.initLowLimValues=d,l.initCutValues=h,l.calcCutValue=f,l.leaveEdge=g,l.enterEdge=y,l.exchangeEdges=v},function(t,e,n){var r=n(4);t.exports=function(t){var e=function(t){var e={},n=0;function i(a){var o=n;r.forEach(t.children(a),i),e[a]={low:o,lim:n++}}return r.forEach(t.children(),i),e}(t);r.forEach(t.graph().dummyChains,(function(n){for(var r=t.node(n),i=r.edgeObj,a=function(t,e,n,r){var i,a,o=[],s=[],c=Math.min(e[n].low,e[r].low),u=Math.max(e[n].lim,e[r].lim);i=n;do{i=t.parent(i),o.push(i)}while(i&&(e[i].low>c||u>e[i].lim));a=i,i=r;for(;(i=t.parent(i))!==a;)s.push(i);return{path:o.concat(s.reverse()),lca:a}}(t,e,i.v,i.w),o=a.path,s=a.lca,c=0,u=o[c],l=!0;n!==i.w;){if(r=t.node(n),l){for(;(u=o[c])!==s&&t.node(u).maxRank<r.rank;)c++;u===s&&(l=!1)}if(!l){for(;c<o.length-1&&t.node(u=o[c+1]).minRank<=r.rank;)c++;u=o[c]}t.setParent(n,u),n=t.successors(n)[0]}}))}},function(t,e,n){var r=n(4),i=n(8);t.exports={run:function(t){var e=i.addDummyNode(t,"root",{},"_root"),n=function(t){var e={};return r.forEach(t.children(),(function(n){!function n(i,a){var o=t.children(i);o&&o.length&&r.forEach(o,(function(t){n(t,a+1)}));e[i]=a}(n,1)})),e}(t),a=r.max(r.values(n))-1,o=2*a+1;t.graph().nestingRoot=e,r.forEach(t.edges(),(function(e){t.edge(e).minlen*=o}));var s=function(t){return r.reduce(t.edges(),(function(e,n){return e+t.edge(n).weight}),0)}(t)+1;r.forEach(t.children(),(function(c){!function t(e,n,a,o,s,c,u){var l=e.children(u);if(!l.length)return void(u!==n&&e.setEdge(n,u,{weight:0,minlen:a}));var h=i.addBorderNode(e,"_bt"),f=i.addBorderNode(e,"_bb"),d=e.node(u);e.setParent(h,u),d.borderTop=h,e.setParent(f,u),d.borderBottom=f,r.forEach(l,(function(r){t(e,n,a,o,s,c,r);var i=e.node(r),l=i.borderTop?i.borderTop:r,d=i.borderBottom?i.borderBottom:r,p=i.borderTop?o:2*o,g=l!==d?1:s-c[u]+1;e.setEdge(h,l,{weight:p,minlen:g,nestingEdge:!0}),e.setEdge(d,f,{weight:p,minlen:g,nestingEdge:!0})})),e.parent(u)||e.setEdge(n,h,{weight:0,minlen:s+c[u]})}(t,e,o,s,a,n,c)})),t.graph().nodeRankFactor=o},cleanup:function(t){var e=t.graph();t.removeNode(e.nestingRoot),delete e.nestingRoot,r.forEach(t.edges(),(function(e){t.edge(e).nestingEdge&&t.removeEdge(e)}))}}},function(t,e,n){var r=n(4),i=n(8);function a(t,e,n,r,a,o){var s={width:0,height:0,rank:o,borderType:e},c=a[e][o-1],u=i.addDummyNode(t,"border",s,n);a[e][o]=u,t.setParent(u,r),c&&t.setEdge(c,u,{weight:1})}t.exports=function(t){r.forEach(t.children(),(function e(n){var i=t.children(n),o=t.node(n);if(i.length&&r.forEach(i,e),r.has(o,"minRank")){o.borderLeft=[],o.borderRight=[];for(var s=o.minRank,c=o.maxRank+1;s<c;++s)a(t,"borderLeft","_bl",n,o,s),a(t,"borderRight","_br",n,o,s)}}))}},function(t,e,n){"use strict";var r=n(4);function i(t){r.forEach(t.nodes(),(function(e){a(t.node(e))})),r.forEach(t.edges(),(function(e){a(t.edge(e))}))}function a(t){var e=t.width;t.width=t.height,t.height=e}function o(t){t.y=-t.y}function s(t){var e=t.x;t.x=t.y,t.y=e}t.exports={adjust:function(t){var e=t.graph().rankdir.toLowerCase();"lr"!==e&&"rl"!==e||i(t)},undo:function(t){var e=t.graph().rankdir.toLowerCase();"bt"!==e&&"rl"!==e||function(t){r.forEach(t.nodes(),(function(e){o(t.node(e))})),r.forEach(t.edges(),(function(e){var n=t.edge(e);r.forEach(n.points,o),r.has(n,"y")&&o(n)}))}(t);"lr"!==e&&"rl"!==e||(!function(t){r.forEach(t.nodes(),(function(e){s(t.node(e))})),r.forEach(t.edges(),(function(e){var n=t.edge(e);r.forEach(n.points,s),r.has(n,"x")&&s(n)}))}(t),i(t))}}},function(t,e,n){"use strict";var r=n(4),i=n(356),a=n(357),o=n(358),s=n(362),c=n(363),u=n(17).Graph,l=n(8);function h(t,e,n){return r.map(e,(function(e){return s(t,e,n)}))}function f(t,e){var n=new u;r.forEach(t,(function(t){var i=t.graph().root,a=o(t,i,n,e);r.forEach(a.vs,(function(e,n){t.node(e).order=n})),c(t,n,a.vs)}))}function d(t,e){r.forEach(e,(function(e){r.forEach(e,(function(e,n){t.node(e).order=n}))}))}t.exports=function(t){var e=l.maxRank(t),n=h(t,r.range(1,e+1),"inEdges"),o=h(t,r.range(e-1,-1,-1),"outEdges"),s=i(t);d(t,s);for(var c,u=Number.POSITIVE_INFINITY,p=0,g=0;g<4;++p,++g){f(p%2?n:o,p%4>=2),s=l.buildLayerMatrix(t);var y=a(t,s);y<u&&(g=0,c=r.cloneDeep(s),u=y)}d(t,c)}},function(t,e,n){"use strict";var r=n(4);t.exports=function(t){var e={},n=r.filter(t.nodes(),(function(e){return!t.children(e).length})),i=r.max(r.map(n,(function(e){return t.node(e).rank}))),a=r.map(r.range(i+1),(function(){return[]}));var o=r.sortBy(n,(function(e){return t.node(e).rank}));return r.forEach(o,(function n(i){if(r.has(e,i))return;e[i]=!0;var o=t.node(i);a[o.rank].push(i),r.forEach(t.successors(i),n)})),a}},function(t,e,n){"use strict";var r=n(4);function i(t,e,n){for(var i=r.zipObject(n,r.map(n,(function(t,e){return e}))),a=r.flatten(r.map(e,(function(e){return r.sortBy(r.map(t.outEdges(e),(function(e){return{pos:i[e.w],weight:t.edge(e).weight}})),"pos")})),!0),o=1;o<n.length;)o<<=1;var s=2*o-1;o-=1;var c=r.map(new Array(s),(function(){return 0})),u=0;return r.forEach(a.forEach((function(t){var e=t.pos+o;c[e]+=t.weight;for(var n=0;e>0;)e%2&&(n+=c[e+1]),c[e=e-1>>1]+=t.weight;u+=t.weight*n}))),u}t.exports=function(t,e){for(var n=0,r=1;r<e.length;++r)n+=i(t,e[r-1],e[r]);return n}},function(t,e,n){var r=n(4),i=n(359),a=n(360),o=n(361);t.exports=function t(e,n,s,c){var u=e.children(n),l=e.node(n),h=l?l.borderLeft:void 0,f=l?l.borderRight:void 0,d={};h&&(u=r.filter(u,(function(t){return t!==h&&t!==f})));var p=i(e,u);r.forEach(p,(function(n){if(e.children(n.v).length){var i=t(e,n.v,s,c);d[n.v]=i,r.has(i,"barycenter")&&(a=n,o=i,r.isUndefined(a.barycenter)?(a.barycenter=o.barycenter,a.weight=o.weight):(a.barycenter=(a.barycenter*a.weight+o.barycenter*o.weight)/(a.weight+o.weight),a.weight+=o.weight))}var a,o}));var g=a(p,s);!function(t,e){r.forEach(t,(function(t){t.vs=r.flatten(t.vs.map((function(t){return e[t]?e[t].vs:t})),!0)}))}(g,d);var y=o(g,c);if(h&&(y.vs=r.flatten([h,y.vs,f],!0),e.predecessors(h).length)){var v=e.node(e.predecessors(h)[0]),m=e.node(e.predecessors(f)[0]);r.has(y,"barycenter")||(y.barycenter=0,y.weight=0),y.barycenter=(y.barycenter*y.weight+v.order+m.order)/(y.weight+2),y.weight+=2}return y}},function(t,e,n){var r=n(4);t.exports=function(t,e){return r.map(e,(function(e){var n=t.inEdges(e);if(n.length){var i=r.reduce(n,(function(e,n){var r=t.edge(n),i=t.node(n.v);return{sum:e.sum+r.weight*i.order,weight:e.weight+r.weight}}),{sum:0,weight:0});return{v:e,barycenter:i.sum/i.weight,weight:i.weight}}return{v:e}}))}},function(t,e,n){"use strict";var r=n(4);t.exports=function(t,e){var n={};return r.forEach(t,(function(t,e){var i=n[t.v]={indegree:0,in:[],out:[],vs:[t.v],i:e};r.isUndefined(t.barycenter)||(i.barycenter=t.barycenter,i.weight=t.weight)})),r.forEach(e.edges(),(function(t){var e=n[t.v],i=n[t.w];r.isUndefined(e)||r.isUndefined(i)||(i.indegree++,e.out.push(n[t.w]))})),function(t){var e=[];function n(t){return function(e){e.merged||(r.isUndefined(e.barycenter)||r.isUndefined(t.barycenter)||e.barycenter>=t.barycenter)&&function(t,e){var n=0,r=0;t.weight&&(n+=t.barycenter*t.weight,r+=t.weight);e.weight&&(n+=e.barycenter*e.weight,r+=e.weight);t.vs=e.vs.concat(t.vs),t.barycenter=n/r,t.weight=r,t.i=Math.min(e.i,t.i),e.merged=!0}(t,e)}}function i(e){return function(n){n.in.push(e),0==--n.indegree&&t.push(n)}}for(;t.length;){var a=t.pop();e.push(a),r.forEach(a.in.reverse(),n(a)),r.forEach(a.out,i(a))}return r.map(r.filter(e,(function(t){return!t.merged})),(function(t){return r.pick(t,["vs","i","barycenter","weight"])}))}(r.filter(n,(function(t){return!t.indegree})))}},function(t,e,n){var r=n(4),i=n(8);function a(t,e,n){for(var i;e.length&&(i=r.last(e)).i<=n;)e.pop(),t.push(i.vs),n++;return n}t.exports=function(t,e){var n=i.partition(t,(function(t){return r.has(t,"barycenter")})),o=n.lhs,s=r.sortBy(n.rhs,(function(t){return-t.i})),c=[],u=0,l=0,h=0;o.sort((f=!!e,function(t,e){return t.barycenter<e.barycenter?-1:t.barycenter>e.barycenter?1:f?e.i-t.i:t.i-e.i})),h=a(c,s,h),r.forEach(o,(function(t){h+=t.vs.length,c.push(t.vs),u+=t.barycenter*t.weight,l+=t.weight,h=a(c,s,h)}));var f;var d={vs:r.flatten(c,!0)};l&&(d.barycenter=u/l,d.weight=l);return d}},function(t,e,n){var r=n(4),i=n(17).Graph;t.exports=function(t,e,n){var a=function(t){var e;for(;t.hasNode(e=r.uniqueId("_root")););return e}(t),o=new i({compound:!0}).setGraph({root:a}).setDefaultNodeLabel((function(e){return t.node(e)}));return r.forEach(t.nodes(),(function(i){var s=t.node(i),c=t.parent(i);(s.rank===e||s.minRank<=e&&e<=s.maxRank)&&(o.setNode(i),o.setParent(i,c||a),r.forEach(t[n](i),(function(e){var n=e.v===i?e.w:e.v,a=o.edge(n,i),s=r.isUndefined(a)?0:a.weight;o.setEdge(n,i,{weight:t.edge(e).weight+s})})),r.has(s,"minRank")&&o.setNode(i,{borderLeft:s.borderLeft[e],borderRight:s.borderRight[e]}))})),o}},function(t,e,n){var r=n(4);t.exports=function(t,e,n){var i,a={};r.forEach(n,(function(n){for(var r,o,s=t.parent(n);s;){if((r=t.parent(s))?(o=a[r],a[r]=s):(o=i,i=s),o&&o!==s)return void e.setEdge(o,s);s=r}}))}},function(t,e,n){"use strict";var r=n(4),i=n(8),a=n(365).positionX;t.exports=function(t){(function(t){var e=i.buildLayerMatrix(t),n=t.graph().ranksep,a=0;r.forEach(e,(function(e){var i=r.max(r.map(e,(function(e){return t.node(e).height})));r.forEach(e,(function(e){t.node(e).y=a+i/2})),a+=i+n}))})(t=i.asNonCompoundGraph(t)),r.forEach(a(t),(function(e,n){t.node(n).x=e}))}},function(t,e,n){"use strict";var r=n(4),i=n(17).Graph,a=n(8);function o(t,e){var n={};return r.reduce(e,(function(e,i){var a=0,o=0,s=e.length,u=r.last(i);return r.forEach(i,(function(e,l){var h=function(t,e){if(t.node(e).dummy)return r.find(t.predecessors(e),(function(e){return t.node(e).dummy}))}(t,e),f=h?t.node(h).order:s;(h||e===u)&&(r.forEach(i.slice(o,l+1),(function(e){r.forEach(t.predecessors(e),(function(r){var i=t.node(r),o=i.order;!(o<a||f<o)||i.dummy&&t.node(e).dummy||c(n,r,e)}))})),o=l+1,a=f)})),i})),n}function s(t,e){var n={};function i(e,i,a,o,s){var u;r.forEach(r.range(i,a),(function(i){u=e[i],t.node(u).dummy&&r.forEach(t.predecessors(u),(function(e){var r=t.node(e);r.dummy&&(r.order<o||r.order>s)&&c(n,e,u)}))}))}return r.reduce(e,(function(e,n){var a,o=-1,s=0;return r.forEach(n,(function(r,c){if("border"===t.node(r).dummy){var u=t.predecessors(r);u.length&&(a=t.node(u[0]).order,i(n,s,c,o,a),s=c,o=a)}i(n,s,n.length,a,e.length)})),n})),n}function c(t,e,n){if(e>n){var r=e;e=n,n=r}var i=t[e];i||(t[e]=i={}),i[n]=!0}function u(t,e,n){if(e>n){var i=e;e=n,n=i}return r.has(t[e],n)}function l(t,e,n,i){var a={},o={},s={};return r.forEach(e,(function(t){r.forEach(t,(function(t,e){a[t]=t,o[t]=t,s[t]=e}))})),r.forEach(e,(function(t){var e=-1;r.forEach(t,(function(t){var c=i(t);if(c.length)for(var l=((c=r.sortBy(c,(function(t){return s[t]}))).length-1)/2,h=Math.floor(l),f=Math.ceil(l);h<=f;++h){var d=c[h];o[t]===t&&e<s[d]&&!u(n,t,d)&&(o[d]=t,o[t]=a[t]=a[d],e=s[d])}}))})),{root:a,align:o}}function h(t,e,n,a,o){var s={},c=function(t,e,n,a){var o=new i,s=t.graph(),c=function(t,e,n){return function(i,a,o){var s,c=i.node(a),u=i.node(o),l=0;if(l+=c.width/2,r.has(c,"labelpos"))switch(c.labelpos.toLowerCase()){case"l":s=-c.width/2;break;case"r":s=c.width/2}if(s&&(l+=n?s:-s),s=0,l+=(c.dummy?e:t)/2,l+=(u.dummy?e:t)/2,l+=u.width/2,r.has(u,"labelpos"))switch(u.labelpos.toLowerCase()){case"l":s=u.width/2;break;case"r":s=-u.width/2}return s&&(l+=n?s:-s),s=0,l}}(s.nodesep,s.edgesep,a);return r.forEach(e,(function(e){var i;r.forEach(e,(function(e){var r=n[e];if(o.setNode(r),i){var a=n[i],s=o.edge(a,r);o.setEdge(a,r,Math.max(c(t,e,i),s||0))}i=e}))})),o}(t,e,n,o),u=o?"borderLeft":"borderRight";function l(t,e){for(var n=c.nodes(),r=n.pop(),i={};r;)i[r]?t(r):(i[r]=!0,n.push(r),n=n.concat(e(r))),r=n.pop()}return l((function(t){s[t]=c.inEdges(t).reduce((function(t,e){return Math.max(t,s[e.v]+c.edge(e))}),0)}),c.predecessors.bind(c)),l((function(e){var n=c.outEdges(e).reduce((function(t,e){return Math.min(t,s[e.w]-c.edge(e))}),Number.POSITIVE_INFINITY),r=t.node(e);n!==Number.POSITIVE_INFINITY&&r.borderType!==u&&(s[e]=Math.max(s[e],n))}),c.successors.bind(c)),r.forEach(a,(function(t){s[t]=s[n[t]]})),s}function f(t,e){return r.minBy(r.values(e),(function(e){var n=Number.NEGATIVE_INFINITY,i=Number.POSITIVE_INFINITY;return r.forIn(e,(function(e,r){var a=function(t,e){return t.node(e).width}(t,r)/2;n=Math.max(e+a,n),i=Math.min(e-a,i)})),n-i}))}function d(t,e){var n=r.values(e),i=r.min(n),a=r.max(n);r.forEach(["u","d"],(function(n){r.forEach(["l","r"],(function(o){var s,c=n+o,u=t[c];if(u!==e){var l=r.values(u);(s="l"===o?i-r.min(l):a-r.max(l))&&(t[c]=r.mapValues(u,(function(t){return t+s})))}}))}))}function p(t,e){return r.mapValues(t.ul,(function(n,i){if(e)return t[e.toLowerCase()][i];var a=r.sortBy(r.map(t,i));return(a[1]+a[2])/2}))}t.exports={positionX:function(t){var e,n=a.buildLayerMatrix(t),i=r.merge(o(t,n),s(t,n)),c={};r.forEach(["u","d"],(function(a){e="u"===a?n:r.values(n).reverse(),r.forEach(["l","r"],(function(n){"r"===n&&(e=r.map(e,(function(t){return r.values(t).reverse()})));var o=("u"===a?t.predecessors:t.successors).bind(t),s=l(t,e,i,o),u=h(t,e,s.root,s.align,"r"===n);"r"===n&&(u=r.mapValues(u,(function(t){return-t}))),c[a+n]=u}))}));var u=f(t,c);return d(c,u),p(c,t.graph().align)},findType1Conflicts:o,findType2Conflicts:s,addConflict:c,hasConflict:u,verticalAlignment:l,horizontalCompaction:h,alignCoordinates:d,findSmallestWidthAlignment:f,balance:p}},function(t,e,n){var r=n(4),i=n(8),a=n(17).Graph;t.exports={debugOrdering:function(t){var e=i.buildLayerMatrix(t),n=new a({compound:!0,multigraph:!0}).setGraph({});return r.forEach(t.nodes(),(function(e){n.setNode(e,{label:e}),n.setParent(e,"layer"+t.node(e).rank)})),r.forEach(t.edges(),(function(t){n.setEdge(t.v,t.w,{},t.name)})),r.forEach(e,(function(t,e){var i="layer"+e;n.setNode(i,{rank:"same"}),r.reduce(t,(function(t,e){return n.setEdge(t,e,{style:"invis"}),e}))})),n}}},function(t,e){t.exports="0.8.5"},function(t,e,n){t.exports={node:n(165),circle:n(166),ellipse:n(96),polygon:n(167),rect:n(168)}},function(t,e){function n(t,e){return t*e>0}t.exports=function(t,e,r,i){var a,o,s,c,u,l,h,f,d,p,g,y,v;if(a=e.y-t.y,s=t.x-e.x,u=e.x*t.y-t.x*e.y,d=a*r.x+s*r.y+u,p=a*i.x+s*i.y+u,0!==d&&0!==p&&n(d,p))return;if(o=i.y-r.y,c=r.x-i.x,l=i.x*r.y-r.x*i.y,h=o*t.x+c*t.y+l,f=o*e.x+c*e.y+l,0!==h&&0!==f&&n(h,f))return;if(0===(g=a*c-o*s))return;return y=Math.abs(g/2),{x:(v=s*l-c*u)<0?(v-y)/g:(v+y)/g,y:(v=o*u-a*l)<0?(v-y)/g:(v+y)/g}}},function(t,e,n){var r=n(43),i=n(31),a=n(153).layout;t.exports=function(){var t=n(371),e=n(374),i=n(375),u=n(376),l=n(377),h=n(378),f=n(379),d=n(380),p=n(381),g=function(n,g){!function(t){t.nodes().forEach((function(e){var n=t.node(e);r.has(n,"label")||t.children(e).length||(n.label=e),r.has(n,"paddingX")&&r.defaults(n,{paddingLeft:n.paddingX,paddingRight:n.paddingX}),r.has(n,"paddingY")&&r.defaults(n,{paddingTop:n.paddingY,paddingBottom:n.paddingY}),r.has(n,"padding")&&r.defaults(n,{paddingLeft:n.padding,paddingRight:n.padding,paddingTop:n.padding,paddingBottom:n.padding}),r.defaults(n,o),r.each(["paddingLeft","paddingRight","paddingTop","paddingBottom"],(function(t){n[t]=Number(n[t])})),r.has(n,"width")&&(n._prevWidth=n.width),r.has(n,"height")&&(n._prevHeight=n.height)})),t.edges().forEach((function(e){var n=t.edge(e);r.has(n,"label")||(n.label=""),r.defaults(n,s)}))}(g);var y=c(n,"output"),v=c(y,"clusters"),m=c(y,"edgePaths"),b=i(c(y,"edgeLabels"),g),x=t(c(y,"nodes"),g,d);a(g),l(x,g),h(b,g),u(m,g,p);var _=e(v,g);f(_,g),function(t){r.each(t.nodes(),(function(e){var n=t.node(e);r.has(n,"_prevWidth")?n.width=n._prevWidth:delete n.width,r.has(n,"_prevHeight")?n.height=n._prevHeight:delete n.height,delete n._prevWidth,delete n._prevHeight}))}(g)};return g.createNodes=function(e){return arguments.length?(t=e,g):t},g.createClusters=function(t){return arguments.length?(e=t,g):e},g.createEdgeLabels=function(t){return arguments.length?(i=t,g):i},g.createEdgePaths=function(t){return arguments.length?(u=t,g):u},g.shapes=function(t){return arguments.length?(d=t,g):d},g.arrows=function(t){return arguments.length?(p=t,g):p},g};var o={paddingLeft:10,paddingRight:10,paddingTop:10,paddingBottom:10,rx:0,ry:0,shape:"rect"},s={arrowhead:"normal",curve:i.curveLinear};function c(t,e){var n=t.select("g."+e);return n.empty()&&(n=t.append("g").attr("class",e)),n}},function(t,e,n){"use strict";var r=n(43),i=n(97),a=n(12),o=n(31);t.exports=function(t,e,n){var s,c=e.nodes().filter((function(t){return!a.isSubgraph(e,t)})),u=t.selectAll("g.node").data(c,(function(t){return t})).classed("update",!0);u.exit().remove(),u.enter().append("g").attr("class","node").style("opacity",0),(u=t.selectAll("g.node")).each((function(t){var s=e.node(t),c=o.select(this);a.applyClass(c,s.class,(c.classed("update")?"update ":"")+"node"),c.select("g.label").remove();var u=c.append("g").attr("class","label"),l=i(u,s),h=n[s.shape],f=r.pick(l.node().getBBox(),"width","height");s.elem=this,s.id&&c.attr("id",s.id),s.labelId&&u.attr("id",s.labelId),r.has(s,"width")&&(f.width=s.width),r.has(s,"height")&&(f.height=s.height),f.width+=s.paddingLeft+s.paddingRight,f.height+=s.paddingTop+s.paddingBottom,u.attr("transform","translate("+(s.paddingLeft-s.paddingRight)/2+","+(s.paddingTop-s.paddingBottom)/2+")");var d=o.select(this);d.select(".label-container").remove();var p=h(d,f,s).classed("label-container",!0);a.applyStyle(p,s.style);var g=p.node().getBBox();s.width=g.width,s.height=g.height})),s=u.exit?u.exit():u.selectAll(null);return a.applyTransition(s,e).style("opacity",0).remove(),u}},function(t,e,n){var r=n(12);t.exports=function(t,e){for(var n=t.append("text"),i=function(t){for(var e,n="",r=!1,i=0;i<t.length;++i)if(e=t[i],r){switch(e){case"n":n+="\n";break;default:n+=e}r=!1}else"\\"===e?r=!0:n+=e;return n}(e.label).split("\n"),a=0;a<i.length;a++)n.append("tspan").attr("xml:space","preserve").attr("dy","1em").attr("x","1").text(i[a]);return r.applyStyle(n,e.labelStyle),n}},function(t,e,n){var r=n(12);t.exports=function(t,e){var n=t;return n.node().appendChild(e.label),r.applyStyle(n,e.labelStyle),n}},function(t,e,n){var r=n(12),i=n(31),a=n(97);t.exports=function(t,e){var n,o=e.nodes().filter((function(t){return r.isSubgraph(e,t)})),s=t.selectAll("g.cluster").data(o,(function(t){return t}));s.selectAll("*").remove(),s.enter().append("g").attr("class","cluster").attr("id",(function(t){return e.node(t).id})).style("opacity",0),s=t.selectAll("g.cluster"),r.applyTransition(s,e).style("opacity",1),s.each((function(t){var n=e.node(t),r=i.select(this);i.select(this).append("rect");var o=r.append("g").attr("class","label");a(o,n,n.clusterLabelPos)})),s.selectAll("rect").each((function(t){var n=e.node(t),a=i.select(this);r.applyStyle(a,n.style)})),n=s.exit?s.exit():s.selectAll(null);return r.applyTransition(n,e).style("opacity",0).remove(),s}},function(t,e,n){"use strict";var r=n(43),i=n(97),a=n(12),o=n(31);t.exports=function(t,e){var n,s=t.selectAll("g.edgeLabel").data(e.edges(),(function(t){return a.edgeToId(t)})).classed("update",!0);s.exit().remove(),s.enter().append("g").classed("edgeLabel",!0).style("opacity",0),(s=t.selectAll("g.edgeLabel")).each((function(t){var n=o.select(this);n.select(".label").remove();var a=e.edge(t),s=i(n,e.edge(t),0,0).classed("label",!0),c=s.node().getBBox();a.labelId&&s.attr("id",a.labelId),r.has(a,"width")||(a.width=c.width),r.has(a,"height")||(a.height=c.height)})),n=s.exit?s.exit():s.selectAll(null);return a.applyTransition(n,e).style("opacity",0).remove(),s}},function(t,e,n){"use strict";var r=n(43),i=n(165),a=n(12),o=n(31);function s(t,e){var n=(o.line||o.svg.line)().x((function(t){return t.x})).y((function(t){return t.y}));return(n.curve||n.interpolate)(t.curve),n(e)}t.exports=function(t,e,n){var c=t.selectAll("g.edgePath").data(e.edges(),(function(t){return a.edgeToId(t)})).classed("update",!0),u=function(t,e){var n=t.enter().append("g").attr("class","edgePath").style("opacity",0);return n.append("path").attr("class","path").attr("d",(function(t){var n=e.edge(t),i=e.node(t.v).elem;return s(n,r.range(n.points.length).map((function(){return e=(t=i).getBBox(),{x:(n=t.ownerSVGElement.getScreenCTM().inverse().multiply(t.getScreenCTM()).translate(e.width/2,e.height/2)).e,y:n.f};var t,e,n})))})),n.append("defs"),n}(c,e);!function(t,e){var n=t.exit();a.applyTransition(n,e).style("opacity",0).remove()}(c,e);var l=void 0!==c.merge?c.merge(u):c;return a.applyTransition(l,e).style("opacity",1),l.each((function(t){var n=o.select(this),r=e.edge(t);r.elem=this,r.id&&n.attr("id",r.id),a.applyClass(n,r.class,(n.classed("update")?"update ":"")+"edgePath")})),l.selectAll("path.path").each((function(t){var n=e.edge(t);n.arrowheadId=r.uniqueId("arrowhead");var c=o.select(this).attr("marker-end",(function(){return"url("+(t=location.href,e=n.arrowheadId,t.split("#")[0]+"#"+e)+")";var t,e})).style("fill","none");a.applyTransition(c,e).attr("d",(function(t){return function(t,e){var n=t.edge(e),r=t.node(e.v),a=t.node(e.w),o=n.points.slice(1,n.points.length-1);return o.unshift(i(r,o[0])),o.push(i(a,o[o.length-1])),s(n,o)}(e,t)})),a.applyStyle(c,n.style)})),l.selectAll("defs *").remove(),l.selectAll("defs").each((function(t){var r=e.edge(t);(0,n[r.arrowhead])(o.select(this),r.arrowheadId,r,"arrowhead")})),l}},function(t,e,n){"use strict";var r=n(12),i=n(31);t.exports=function(t,e){function n(t){var n=e.node(t);return"translate("+n.x+","+n.y+")"}t.filter((function(){return!i.select(this).classed("update")})).attr("transform",n),r.applyTransition(t,e).style("opacity",1).attr("transform",n)}},function(t,e,n){"use strict";var r=n(12),i=n(31),a=n(43);t.exports=function(t,e){function n(t){var n=e.edge(t);return a.has(n,"x")?"translate("+n.x+","+n.y+")":""}t.filter((function(){return!i.select(this).classed("update")})).attr("transform",n),r.applyTransition(t,e).style("opacity",1).attr("transform",n)}},function(t,e,n){"use strict";var r=n(12),i=n(31);t.exports=function(t,e){var n=t.filter((function(){return!i.select(this).classed("update")}));function a(t){var n=e.node(t);return"translate("+n.x+","+n.y+")"}n.attr("transform",a),r.applyTransition(t,e).style("opacity",1).attr("transform",a),r.applyTransition(n.selectAll("rect"),e).attr("width",(function(t){return e.node(t).width})).attr("height",(function(t){return e.node(t).height})).attr("x",(function(t){return-e.node(t).width/2})).attr("y",(function(t){return-e.node(t).height/2}))}},function(t,e,n){"use strict";var r=n(168),i=n(96),a=n(166),o=n(167);t.exports={rect:function(t,e,n){var i=t.insert("rect",":first-child").attr("rx",n.rx).attr("ry",n.ry).attr("x",-e.width/2).attr("y",-e.height/2).attr("width",e.width).attr("height",e.height);return n.intersect=function(t){return r(n,t)},i},ellipse:function(t,e,n){var r=e.width/2,a=e.height/2,o=t.insert("ellipse",":first-child").attr("x",-e.width/2).attr("y",-e.height/2).attr("rx",r).attr("ry",a);return n.intersect=function(t){return i(n,r,a,t)},o},circle:function(t,e,n){var r=Math.max(e.width,e.height)/2,i=t.insert("circle",":first-child").attr("x",-e.width/2).attr("y",-e.height/2).attr("r",r);return n.intersect=function(t){return a(n,r,t)},i},diamond:function(t,e,n){var r=e.width*Math.SQRT2/2,i=e.height*Math.SQRT2/2,a=[{x:0,y:-i},{x:-r,y:0},{x:0,y:i},{x:r,y:0}],s=t.insert("polygon",":first-child").attr("points",a.map((function(t){return t.x+","+t.y})).join(" "));return n.intersect=function(t){return o(n,a,t)},s}}},function(t,e,n){var r=n(12);function i(t,e,n,i){var a=t.append("marker").attr("id",e).attr("viewBox","0 0 10 10").attr("refX",9).attr("refY",5).attr("markerUnits","strokeWidth").attr("markerWidth",8).attr("markerHeight",6).attr("orient","auto").append("path").attr("d","M 0 0 L 10 5 L 0 10 z").style("stroke-width",1).style("stroke-dasharray","1,0");r.applyStyle(a,n[i+"Style"]),n[i+"Class"]&&a.attr("class",n[i+"Class"])}t.exports={default:i,normal:i,vee:function(t,e,n,i){var a=t.append("marker").attr("id",e).attr("viewBox","0 0 10 10").attr("refX",9).attr("refY",5).attr("markerUnits","strokeWidth").attr("markerWidth",8).attr("markerHeight",6).attr("orient","auto").append("path").attr("d","M 0 0 L 10 5 L 0 10 L 4 5 z").style("stroke-width",1).style("stroke-dasharray","1,0");r.applyStyle(a,n[i+"Style"]),n[i+"Class"]&&a.attr("class",n[i+"Class"])},undirected:function(t,e,n,i){var a=t.append("marker").attr("id",e).attr("viewBox","0 0 10 10").attr("refX",9).attr("refY",5).attr("markerUnits","strokeWidth").attr("markerWidth",8).attr("markerHeight",6).attr("orient","auto").append("path").attr("d","M 0 5 L 10 5").style("stroke-width",1).style("stroke-dasharray","1,0");r.applyStyle(a,n[i+"Style"]),n[i+"Class"]&&a.attr("class",n[i+"Class"])}}},function(t,e){t.exports="0.6.4"},function(t,e,n){"use strict";var r;function i(t){return r=r||document.createElement("div"),t=escape(t).replace(/%26/g,"&").replace(/%23/g,"#").replace(/%3B/g,";"),r.innerHTML=t,unescape(r.textContent)}n.r(e);var a=n(23),o=n.n(a),s={debug:1,info:2,warn:3,error:4,fatal:5},c={debug:function(){},info:function(){},warn:function(){},error:function(){},fatal:function(){}},u=function(){var t=arguments.length>0&&void 0!==arguments[0]?arguments[0]:"fatal";isNaN(t)&&(t=t.toLowerCase(),void 0!==s[t]&&(t=s[t])),c.trace=function(){},c.debug=function(){},c.info=function(){},c.warn=function(){},c.error=function(){},c.fatal=function(){},t<=s.fatal&&(c.fatal=console.error?console.error.bind(console,l("FATAL"),"color: orange"):console.log.bind(console,"[35m",l("FATAL"))),t<=s.error&&(c.error=console.error?console.error.bind(console,l("ERROR"),"color: orange"):console.log.bind(console,"[31m",l("ERROR"))),t<=s.warn&&(c.warn=console.warn?console.warn.bind(console,l("WARN"),"color: orange"):console.log.bind(console,"[33m",l("WARN"))),t<=s.info&&(c.info=console.info?console.info.bind(console,l("INFO"),"color: lightblue"):console.log.bind(console,"[34m",l("INFO"))),t<=s.debug&&(c.debug=console.debug?console.debug.bind(console,l("DEBUG"),"color: lightgreen"):console.log.bind(console,"[32m",l("DEBUG")))},l=function(t){var e=o()().format("ss.SSS");return"%c".concat(e," : ").concat(t," : ")},h=n(169),f=n.n(h),d=n(0),p=n(44),g=n(70),y=function(t){for(var e="",n=0;n>=0;){if(!((n=t.indexOf("<script"))>=0)){e+=t,n=-1;break}e+=t.substr(0,n),(n=(t=t.substr(n+1)).indexOf("<\/script>"))>=0&&(n+=9,t=t.substr(n))}return e},v=/<br\s*\/?>/gi,m=function(t){return t.replace(v,"#br#")},b=function(t){return t.replace(/#br#/g,"<br/>")},x={getRows:function(t){if(!t)return 1;var e=m(t);return(e=e.replace(/\\n/g,"#br#")).split("#br#")},sanitizeText:function(t,e){var n=t,r=!0;if(!e.flowchart||!1!==e.flowchart.htmlLabels&&"false"!==e.flowchart.htmlLabels||(r=!1),r){var i=e.securityLevel;"antiscript"===i?n=y(n):"loose"!==i&&(n=(n=(n=m(n)).replace(/</g,"<").replace(/>/g,">")).replace(/=/g,"="),n=b(n))}return n},hasBreaks:function(t){return/<br\s*[/]?>/gi.test(t)},splitBreaks:function(t){return t.split(/<br\s*[/]?>/gi)},lineBreakRegex:v,removeScript:y};function _(t,e){for(var n=0;n<e.length;n++){var r=e[n];r.enumerable=r.enumerable||!1,r.configurable=!0,"value"in r&&(r.writable=!0),Object.defineProperty(t,r.key,r)}}function k(t){return(k="function"==typeof Symbol&&"symbol"==typeof Symbol.iterator?function(t){return typeof t}:function(t){return t&&"function"==typeof Symbol&&t.constructor===Symbol&&t!==Symbol.prototype?"symbol":typeof t})(t)}function w(t){return function(t){if(Array.isArray(t)){for(var e=0,n=new Array(t.length);e<t.length;e++)n[e]=t[e];return n}}(t)||function(t){if(Symbol.iterator in Object(t)||"[object Arguments]"===Object.prototype.toString.call(t))return Array.from(t)}(t)||function(){throw new TypeError("Invalid attempt to spread non-iterable instance")}()}var E={curveBasis:d.curveBasis,curveBasisClosed:d.curveBasisClosed,curveBasisOpen:d.curveBasisOpen,curveLinear:d.curveLinear,curveLinearClosed:d.curveLinearClosed,curveMonotoneX:d.curveMonotoneX,curveMonotoneY:d.curveMonotoneY,curveNatural:d.curveNatural,curveStep:d.curveStep,curveStepAfter:d.curveStepAfter,curveStepBefore:d.curveStepBefore},T=/[%]{2}[{]\s*(?:(?:(\w+)\s*:|(\w+))\s*(?:(?:(\w+))|((?:(?![}][%]{2}).|\r?\n)*))?\s*)(?:[}][%]{2})?/gi,C=/\s*(?:(?:(\w+)(?=:):|(\w+))\s*(?:(?:(\w+))|((?:(?![}][%]{2}).|\r?\n)*))?\s*)(?:[}][%]{2})?/gi,A=/\s*%%.*\n/gm,S=function(t){var e=arguments.length>1&&void 0!==arguments[1]?arguments[1]:null;try{var n=new RegExp("[%]{2}(?![{]".concat(C.source,")(?=[}][%]{2}).*\n"),"ig");t=t.trim().replace(n,"").replace(/'/gm,'"'),c.debug("Detecting diagram directive".concat(null!==e?" type:"+e:""," based on the text:").concat(t));for(var r,i=[];null!==(r=T.exec(t));)if(r.index===T.lastIndex&&T.lastIndex++,r&&!e||e&&r[1]&&r[1].match(e)||e&&r[2]&&r[2].match(e)){var a=r[1]?r[1]:r[2],o=r[3]?r[3].trim():r[4]?JSON.parse(r[4].trim()):null;i.push({type:a,args:o})}return 0===i.length&&i.push({type:t,args:null}),1===i.length?i[0]:i}catch(n){return c.error("ERROR: ".concat(n.message," - Unable to parse directive").concat(null!==e?" type:"+e:""," based on the text:").concat(t)),{type:null,args:null}}},M=function(t){return t=t.replace(T,"").replace(A,"\n"),c.debug("Detecting diagram type based on the text "+t),t.match(/^\s*sequenceDiagram/)?"sequence":t.match(/^\s*gantt/)?"gantt":t.match(/^\s*classDiagram-v2/)?"classDiagram":t.match(/^\s*classDiagram/)?"class":t.match(/^\s*stateDiagram-v2/)?"stateDiagram":t.match(/^\s*stateDiagram/)?"state":t.match(/^\s*gitGraph/)?"git":t.match(/^\s*flowchart/)?"flowchart-v2":t.match(/^\s*info/)?"info":t.match(/^\s*pie/)?"pie":t.match(/^\s*erDiagram/)?"er":t.match(/^\s*journey/)?"journey":"flowchart"},O=function(t,e){var n={};return function(){for(var r=arguments.length,i=new Array(r),a=0;a<r;a++)i[a]=arguments[a];var o=e?e.apply(void 0,i):i[0];if(o in n)return n[o];var s=t.apply(void 0,i);return n[o]=s,s}},D=function(t,e){if(!t)return e;var n="curve".concat(t.charAt(0).toUpperCase()+t.slice(1));return E[n]||e},N=function(t,e){return t&&e?Math.sqrt(Math.pow(e.x-t.x,2)+Math.pow(e.y-t.y,2)):0},B=function(t){for(var e="",n="",r=0;r<t.length;r++)void 0!==t[r]&&(t[r].startsWith("color:")||t[r].startsWith("text-align:")?n=n+t[r]+";":e=e+t[r]+";");return{style:e,labelStyle:n}},L=0,P=function(){return L++,"id-"+Math.random().toString(36).substr(2,12)+"-"+L};var I=function(t){return function(t){for(var e="",n="0123456789abcdef".length,r=0;r<t;r++)e+="0123456789abcdef".charAt(Math.floor(Math.random()*n));return e}(t.length)},F=function t(e,n,r){var i=Object.assign({depth:2,clobber:!1},r),a=i.depth,o=i.clobber;return Array.isArray(n)&&!Array.isArray(e)?(n.forEach((function(n){return t(e,n,r)})),e):Array.isArray(n)&&Array.isArray(e)?(n.forEach((function(t){-1===e.indexOf(t)&&e.push(t)})),e):void 0===e||a<=0?null!=e&&"object"===k(e)&&"object"===k(n)?Object.assign(e,n):n:(void 0!==n&&"object"===k(e)&&"object"===k(n)&&Object.keys(n).forEach((function(r){"object"!==k(n[r])||void 0!==e[r]&&"object"!==k(e[r])?(o||"object"!==k(e[r])&&"object"!==k(n[r]))&&(e[r]=n[r]):(void 0===e[r]&&(e[r]=Array.isArray(n[r])?[]:{}),e[r]=t(e[r],n[r],{depth:a-1,clobber:o}))})),e)},j=function(t,e){var n=e.text.replace(x.lineBreakRegex," "),r=t.append("text");r.attr("x",e.x),r.attr("y",e.y),r.style("text-anchor",e.anchor),r.style("font-family",e.fontFamily),r.style("font-size",e.fontSize),r.style("font-weight",e.fontWeight),r.attr("fill",e.fill),void 0!==e.class&&r.attr("class",e.class);var i=r.append("tspan");return i.attr("x",e.x+2*e.textMargin),i.attr("fill",e.fill),i.text(n),r},R=O((function(t,e,n){if(!t)return t;if(n=Object.assign({fontSize:12,fontWeight:400,fontFamily:"Arial",joinWith:"<br/>"},n),x.lineBreakRegex.test(t))return t;var r=t.split(" "),i=[],a="";return r.forEach((function(t,o){var s=z("".concat(t," "),n),c=z(a,n);if(s>e){var u=Y(t,e,"-",n),l=u.hyphenatedStrings,h=u.remainingWord;i.push.apply(i,[a].concat(w(l))),a=h}else c+s>=e?(i.push(a),a=t):a=[a,t].filter(Boolean).join(" ");o+1===r.length&&i.push(a)})),i.filter((function(t){return""!==t})).join(n.joinWith)}),(function(t,e,n){return"".concat(t,"-").concat(e,"-").concat(n.fontSize,"-").concat(n.fontWeight,"-").concat(n.fontFamily,"-").concat(n.joinWith)})),Y=O((function(t,e){var n=arguments.length>2&&void 0!==arguments[2]?arguments[2]:"-",r=arguments.length>3?arguments[3]:void 0;r=Object.assign({fontSize:12,fontWeight:400,fontFamily:"Arial",margin:0},r);var i=t.split(""),a=[],o="";return i.forEach((function(t,s){var c="".concat(o).concat(t);if(z(c,r)>=e){var u=s+1,l=i.length===u,h="".concat(c).concat(n);a.push(l?c:h),o=""}else o=c})),{hyphenatedStrings:a,remainingWord:o}}),(function(t,e){var n=arguments.length>2&&void 0!==arguments[2]?arguments[2]:"-",r=arguments.length>3?arguments[3]:void 0;return"".concat(t,"-").concat(e,"-").concat(n,"-").concat(r.fontSize,"-").concat(r.fontWeight,"-").concat(r.fontFamily)})),z=function(t,e){return e=Object.assign({fontSize:12,fontWeight:400,fontFamily:"Arial"},e),U(t,e).width},U=O((function(t,e){var n=e=Object.assign({fontSize:12,fontWeight:400,fontFamily:"Arial"},e),r=n.fontSize,i=n.fontFamily,a=n.fontWeight;if(!t)return{width:0,height:0};var o=["sans-serif",i],s=t.split(x.lineBreakRegex),c=[],u=Object(d.select)("body");if(!u.remove)return{width:0,height:0,lineHeight:0};for(var l=u.append("svg"),h=0,f=o;h<f.length;h++){var p=f[h],g=0,y={width:0,height:0,lineHeight:0},v=!0,m=!1,b=void 0;try{for(var _,k=s[Symbol.iterator]();!(v=(_=k.next()).done);v=!0){var w=_.value,E={x:0,y:0,fill:void 0,anchor:"start",style:"#666",width:100,height:100,textMargin:0,rx:0,ry:0,valign:void 0};E.text=w;var T=j(l,E).style("font-size",r).style("font-weight",a).style("font-family",p),C=(T._groups||T)[0][0].getBBox();y.width=Math.round(Math.max(y.width,C.width)),g=Math.round(C.height),y.height+=g,y.lineHeight=Math.round(Math.max(y.lineHeight,g))}}catch(t){m=!0,b=t}finally{try{v||null==k.return||k.return()}finally{if(m)throw b}}c.push(y)}return l.remove(),c[isNaN(c[1].height)||isNaN(c[1].width)||isNaN(c[1].lineHeight)||c[0].height>c[1].height&&c[0].width>c[1].width&&c[0].lineHeight>c[1].lineHeight?0:1]}),(function(t,e){return"".concat(t,"-").concat(e.fontSize,"-").concat(e.fontWeight,"-").concat(e.fontFamily)})),$=function(t,e,n){var r=new Map;return r.set("height",t),n?(r.set("width","100%"),r.set("style","max-width: ".concat(e,"px;"))):r.set("width",e),r},W=function(t,e,n,r){!function(t,e){var n=!0,r=!1,i=void 0;try{for(var a,o=e[Symbol.iterator]();!(n=(a=o.next()).done);n=!0){var s=a.value;t.attr(s[0],s[1])}}catch(t){r=!0,i=t}finally{try{n||null==o.return||o.return()}finally{if(r)throw i}}}(t,$(e,n,r))},H={assignWithDepth:F,wrapLabel:R,calculateTextHeight:function(t,e){return e=Object.assign({fontSize:12,fontWeight:400,fontFamily:"Arial",margin:15},e),U(t,e).height},calculateTextWidth:z,calculateTextDimensions:U,calculateSvgSizeAttrs:$,configureSvgSize:W,detectInit:function(t){var e=S(t,/(?:init\b)|(?:initialize\b)/),n={};if(Array.isArray(e)){var r=e.map((function(t){return t.args}));n=F(n,w(r))}else n=e.args;if(n){var i=M(t);["config"].forEach((function(t){void 0!==n[t]&&("flowchart-v2"===i&&(i="flowchart"),n[i]=n[t],delete n[t])}))}return n},detectDirective:S,detectType:M,isSubstringInArray:function(t,e){for(var n=0;n<e.length;n++)if(e[n].match(t))return n;return-1},interpolateToCurve:D,calcLabelPosition:function(t){return function(t){var e,n=0;t.forEach((function(t){n+=N(t,e),e=t}));var r=n/2,i=void 0;return e=void 0,t.forEach((function(t){if(e&&!i){var n=N(t,e);if(n<r)r-=n;else{var a=r/n;a<=0&&(i=e),a>=1&&(i={x:t.x,y:t.y}),a>0&&a<1&&(i={x:(1-a)*e.x+a*t.x,y:(1-a)*e.y+a*t.y})}}e=t})),i}(t)},calcCardinalityPosition:function(t,e,n){var r;c.info("our points",e),e[0]!==n&&(e=e.reverse()),e.forEach((function(t){N(t,r),r=t}));var i,a=25;r=void 0,e.forEach((function(t){if(r&&!i){var e=N(t,r);if(e<a)a-=e;else{var n=a/e;n<=0&&(i=r),n>=1&&(i={x:t.x,y:t.y}),n>0&&n<1&&(i={x:(1-n)*r.x+n*t.x,y:(1-n)*r.y+n*t.y})}}r=t}));var o=t?10:5,s=Math.atan2(e[0].y-i.y,e[0].x-i.x),u={x:0,y:0};return u.x=Math.sin(s)*o+(e[0].x+i.x)/2,u.y=-Math.cos(s)*o+(e[0].y+i.y)/2,u},calcTerminalLabelPosition:function(t,e,n){var r,i=JSON.parse(JSON.stringify(n));c.info("our points",i),"start_left"!==e&&"start_right"!==e&&(i=i.reverse()),i.forEach((function(t){N(t,r),r=t}));var a,o=25;r=void 0,i.forEach((function(t){if(r&&!a){var e=N(t,r);if(e<o)o-=e;else{var n=o/e;n<=0&&(a=r),n>=1&&(a={x:t.x,y:t.y}),n>0&&n<1&&(a={x:(1-n)*r.x+n*t.x,y:(1-n)*r.y+n*t.y})}}r=t}));var s=10,u=Math.atan2(i[0].y-a.y,i[0].x-a.x),l={x:0,y:0};return l.x=Math.sin(u)*s+(i[0].x+a.x)/2,l.y=-Math.cos(u)*s+(i[0].y+a.y)/2,"start_left"===e&&(l.x=Math.sin(u+Math.PI)*s+(i[0].x+a.x)/2,l.y=-Math.cos(u+Math.PI)*s+(i[0].y+a.y)/2),"end_right"===e&&(l.x=Math.sin(u-Math.PI)*s+(i[0].x+a.x)/2-5,l.y=-Math.cos(u-Math.PI)*s+(i[0].y+a.y)/2-5),"end_left"===e&&(l.x=Math.sin(u)*s+(i[0].x+a.x)/2-5,l.y=-Math.cos(u)*s+(i[0].y+a.y)/2-5),l},formatUrl:function(t,e){var n=t.trim();if(n)return"loose"!==e.securityLevel?Object(g.sanitizeUrl)(n):n},getStylesFromArray:B,generateId:P,random:I,memoize:O,runFunc:function(t){for(var e,n=t.split("."),r=n.length-1,i=n[r],a=window,o=0;o<r;o++)if(!(a=a[n[o]]))return;for(var s=arguments.length,c=new Array(s>1?s-1:0),u=1;u<s;u++)c[u-1]=arguments[u];(e=a)[i].apply(e,c)},initIdGeneratior:function(t,e){return t?new(function(){function t(){return function(t,e){if(!(t instanceof e))throw new TypeError("Cannot call a class as a function")}(this,t),this.count=e?e.length:0}var n,r,i;return n=t,(r=[{key:"next",value:function(){return this.count++}}])&&_(n.prototype,r),i&&_(n,i),t}()):{next:function(){return Date.now()}}}},V=n(3),G=n.n(V),q=n(1),X=function(t,e){return e?Object(q.adjust)(t,{s:-40,l:10}):Object(q.adjust)(t,{s:-40,l:-10})};function Z(t){return(Z="function"==typeof Symbol&&"symbol"==typeof Symbol.iterator?function(t){return typeof t}:function(t){return t&&"function"==typeof Symbol&&t.constructor===Symbol&&t!==Symbol.prototype?"symbol":typeof t})(t)}function J(t,e){for(var n=0;n<e.length;n++){var r=e[n];r.enumerable=r.enumerable||!1,r.configurable=!0,"value"in r&&(r.writable=!0),Object.defineProperty(t,r.key,r)}}var K=function(){function t(){!function(t,e){if(!(t instanceof e))throw new TypeError("Cannot call a class as a function")}(this,t),this.background="#f4f4f4",this.darkMode=!1,this.primaryColor="#fff4dd",this.noteBkgColor="#fff5ad",this.noteTextColor="#333",this.fontFamily='"trebuchet ms", verdana, arial, sans-serif',this.fontSize="16px"}var e,n,r;return e=t,(n=[{key:"updateColors",value:function(){this.primaryTextColor=this.primaryTextColor||(this.darkMode?"#ddd":"#333"),this.secondaryColor=this.secondaryColor||Object(q.adjust)(this.primaryColor,{h:-120}),this.tertiaryColor=this.tertiaryColor||Object(q.adjust)(this.primaryColor,{h:180,l:5}),this.primaryBorderColor=this.primaryBorderColor||X(this.primaryColor,this.darkMode),this.secondaryBorderColor=this.secondaryBorderColor||X(this.secondaryColor,this.darkMode),this.tertiaryBorderColor=this.tertiaryBorderColor||X(this.tertiaryColor,this.darkMode),this.noteBorderColor=this.noteBorderColor||X(this.noteBkgColor,this.darkMode),this.secondaryTextColor=this.secondaryTextColor||Object(q.invert)(this.secondaryColor),this.tertiaryTextColor=this.tertiaryTextColor||Object(q.invert)(this.tertiaryColor),this.lineColor=this.lineColor||Object(q.invert)(this.background),this.textColor=this.textColor||this.primaryTextColor,this.nodeBkg=this.nodeBkg||this.primaryColor,this.mainBkg=this.mainBkg||this.primaryColor,this.nodeBorder=this.nodeBorder||this.primaryBorderColor,this.clusterBkg=this.clusterBkg||this.tertiaryColor,this.clusterBorder=this.clusterBorder||this.tertiaryBorderColor,this.defaultLinkColor=this.defaultLinkColor||this.lineColor,this.titleColor=this.titleColor||this.tertiaryTextColor,this.edgeLabelBackground=this.edgeLabelBackground||(this.darkMode?Object(q.darken)(this.secondaryColor,30):this.secondaryColor),this.nodeTextColor=this.nodeTextColor||this.primaryTextColor,this.actorBorder=this.actorBorder||this.primaryBorderColor,this.actorBkg=this.actorBkg||this.mainBkg,this.actorTextColor=this.actorTextColor||this.primaryTextColor,this.actorLineColor=this.actorLineColor||"grey",this.labelBoxBkgColor=this.labelBoxBkgColor||this.actorBkg,this.signalColor=this.signalColor||this.textColor,this.signalTextColor=this.signalTextColor||this.textColor,this.labelBoxBorderColor=this.labelBoxBorderColor||this.actorBorder,this.labelTextColor=this.labelTextColor||this.actorTextColor,this.loopTextColor=this.loopTextColor||this.actorTextColor,this.activationBorderColor=this.activationBorderColor||Object(q.darken)(this.secondaryColor,10),this.activationBkgColor=this.activationBkgColor||this.secondaryColor,this.sequenceNumberColor=this.sequenceNumberColor||Object(q.invert)(this.lineColor),this.sectionBkgColor=this.sectionBkgColor||this.tertiaryColor,this.altSectionBkgColor=this.altSectionBkgColor||"white",this.sectionBkgColor=this.sectionBkgColor||this.secondaryColor,this.sectionBkgColor2=this.sectionBkgColor2||this.primaryColor,this.taskBorderColor=this.taskBorderColor||this.primaryBorderColor,this.taskBkgColor=this.taskBkgColor||this.primaryColor,this.activeTaskBorderColor=this.activeTaskBorderColor||this.primaryColor,this.activeTaskBkgColor=this.activeTaskBkgColor||Object(q.lighten)(this.primaryColor,23),this.gridColor=this.gridColor||"lightgrey",this.doneTaskBkgColor=this.doneTaskBkgColor||"lightgrey",this.doneTaskBorderColor=this.doneTaskBorderColor||"grey",this.critBorderColor=this.critBorderColor||"#ff8888",this.critBkgColor=this.critBkgColor||"red",this.todayLineColor=this.todayLineColor||"red",this.taskTextColor=this.taskTextColor||this.textColor,this.taskTextOutsideColor=this.taskTextOutsideColor||this.textColor,this.taskTextLightColor=this.taskTextLightColor||this.textColor,this.taskTextColor=this.taskTextColor||this.primaryTextColor,this.taskTextDarkColor=this.taskTextDarkColor||this.textColor,this.taskTextClickableColor=this.taskTextClickableColor||"#003163",this.labelColor=this.labelColor||this.primaryTextColor,this.altBackground=this.altBackground||this.tertiaryColor,this.errorBkgColor=this.errorBkgColor||this.tertiaryColor,this.errorTextColor=this.errorTextColor||this.tertiaryTextColor,this.classText=this.classText||this.textColor,this.fillType0=this.fillType0||this.primaryColor,this.fillType1=this.fillType1||this.secondaryColor,this.fillType2=this.fillType2||Object(q.adjust)(this.primaryColor,{h:64}),this.fillType3=this.fillType3||Object(q.adjust)(this.secondaryColor,{h:64}),this.fillType4=this.fillType4||Object(q.adjust)(this.primaryColor,{h:-64}),this.fillType5=this.fillType5||Object(q.adjust)(this.secondaryColor,{h:-64}),this.fillType6=this.fillType6||Object(q.adjust)(this.primaryColor,{h:128}),this.fillType7=this.fillType7||Object(q.adjust)(this.secondaryColor,{h:128})}},{key:"calculate",value:function(t){var e=this;if("object"===Z(t)){var n=Object.keys(t);n.forEach((function(n){e[n]=t[n]})),this.updateColors(),n.forEach((function(n){e[n]=t[n]}))}else this.updateColors()}}])&&J(e.prototype,n),r&&J(e,r),t}();function Q(t){return(Q="function"==typeof Symbol&&"symbol"==typeof Symbol.iterator?function(t){return typeof t}:function(t){return t&&"function"==typeof Symbol&&t.constructor===Symbol&&t!==Symbol.prototype?"symbol":typeof t})(t)}function tt(t,e){for(var n=0;n<e.length;n++){var r=e[n];r.enumerable=r.enumerable||!1,r.configurable=!0,"value"in r&&(r.writable=!0),Object.defineProperty(t,r.key,r)}}var et=function(){function t(){!function(t,e){if(!(t instanceof e))throw new TypeError("Cannot call a class as a function")}(this,t),this.background="#333",this.primaryColor="#1f2020",this.secondaryColor=Object(q.lighten)(this.primaryColor,16),this.tertiaryColor=Object(q.adjust)(this.primaryColor,{h:-160}),this.primaryBorderColor=X(this.primaryColor,this.darkMode),this.secondaryBorderColor=X(this.secondaryColor,this.darkMode),this.tertiaryBorderColor=X(this.tertiaryColor,this.darkMode),this.primaryTextColor=Object(q.invert)(this.primaryColor),this.secondaryTextColor=Object(q.invert)(this.secondaryColor),this.tertiaryTextColor=Object(q.invert)(this.tertiaryColor),this.lineColor=Object(q.invert)(this.background),this.textColor=Object(q.invert)(this.background),this.mainBkg="#1f2020",this.secondBkg="calculated",this.mainContrastColor="lightgrey",this.darkTextColor=Object(q.lighten)(Object(q.invert)("#323D47"),10),this.lineColor="calculated",this.border1="#81B1DB",this.border2=Object(q.rgba)(255,255,255,.25),this.arrowheadColor="calculated",this.fontFamily='"trebuchet ms", verdana, arial, sans-serif',this.fontSize="16px",this.labelBackground="#181818",this.textColor="#ccc",this.nodeBkg="calculated",this.nodeBorder="calculated",this.clusterBkg="calculated",this.clusterBorder="calculated",this.defaultLinkColor="calculated",this.titleColor="#F9FFFE",this.edgeLabelBackground="calculated",this.actorBorder="calculated",this.actorBkg="calculated",this.actorTextColor="calculated",this.actorLineColor="calculated",this.signalColor="calculated",this.signalTextColor="calculated",this.labelBoxBkgColor="calculated",this.labelBoxBorderColor="calculated",this.labelTextColor="calculated",this.loopTextColor="calculated",this.noteBorderColor="calculated",this.noteBkgColor="#fff5ad",this.noteTextColor="calculated",this.activationBorderColor="calculated",this.activationBkgColor="calculated",this.sequenceNumberColor="black",this.sectionBkgColor=Object(q.darken)("#EAE8D9",30),this.altSectionBkgColor="calculated",this.sectionBkgColor2="#EAE8D9",this.taskBorderColor=Object(q.rgba)(255,255,255,70),this.taskBkgColor="calculated",this.taskTextColor="calculated",this.taskTextLightColor="calculated",this.taskTextOutsideColor="calculated",this.taskTextClickableColor="#003163",this.activeTaskBorderColor=Object(q.rgba)(255,255,255,50),this.activeTaskBkgColor="#81B1DB",this.gridColor="calculated",this.doneTaskBkgColor="calculated",this.doneTaskBorderColor="grey",this.critBorderColor="#E83737",this.critBkgColor="#E83737",this.taskTextDarkColor="calculated",this.todayLineColor="#DB5757",this.labelColor="calculated",this.errorBkgColor="#a44141",this.errorTextColor="#ddd"}var e,n,r;return e=t,(n=[{key:"updateColors",value:function(){this.secondBkg=Object(q.lighten)(this.mainBkg,16),this.lineColor=this.mainContrastColor,this.arrowheadColor=this.mainContrastColor,this.nodeBkg=this.mainBkg,this.nodeBorder=this.border1,this.clusterBkg=this.secondBkg,this.clusterBorder=this.border2,this.defaultLinkColor=this.lineColor,this.edgeLabelBackground=Object(q.lighten)(this.labelBackground,25),this.actorBorder=this.border1,this.actorBkg=this.mainBkg,this.actorTextColor=this.mainContrastColor,this.actorLineColor=this.mainContrastColor,this.signalColor=this.mainContrastColor,this.signalTextColor=this.mainContrastColor,this.labelBoxBkgColor=this.actorBkg,this.labelBoxBorderColor=this.actorBorder,this.labelTextColor=this.mainContrastColor,this.loopTextColor=this.mainContrastColor,this.noteBorderColor=this.border2,this.noteTextColor=this.mainBkg,this.activationBorderColor=this.border1,this.activationBkgColor=this.secondBkg,this.altSectionBkgColor=this.background,this.taskBkgColor=Object(q.lighten)(this.mainBkg,23),this.taskTextColor=this.darkTextColor,this.taskTextLightColor=this.mainContrastColor,this.taskTextOutsideColor=this.taskTextLightColor,this.gridColor=this.mainContrastColor,this.doneTaskBkgColor=this.mainContrastColor,this.taskTextDarkColor=this.darkTextColor,this.labelColor=this.textColor,this.altBackground=Object(q.lighten)(this.background,20),this.fillType0=this.primaryColor,this.fillType1=this.secondaryColor,this.fillType2=Object(q.adjust)(this.primaryColor,{h:64}),this.fillType3=Object(q.adjust)(this.secondaryColor,{h:64}),this.fillType4=Object(q.adjust)(this.primaryColor,{h:-64}),this.fillType5=Object(q.adjust)(this.secondaryColor,{h:-64}),this.fillType6=Object(q.adjust)(this.primaryColor,{h:128}),this.fillType7=Object(q.adjust)(this.secondaryColor,{h:128}),this.classText=this.primaryTextColor}},{key:"calculate",value:function(t){var e=this;if("object"===Q(t)){var n=Object.keys(t);n.forEach((function(n){e[n]=t[n]})),this.updateColors(),n.forEach((function(n){e[n]=t[n]}))}else this.updateColors()}}])&&tt(e.prototype,n),r&&tt(e,r),t}();function nt(t){return(nt="function"==typeof Symbol&&"symbol"==typeof Symbol.iterator?function(t){return typeof t}:function(t){return t&&"function"==typeof Symbol&&t.constructor===Symbol&&t!==Symbol.prototype?"symbol":typeof t})(t)}function rt(t,e){for(var n=0;n<e.length;n++){var r=e[n];r.enumerable=r.enumerable||!1,r.configurable=!0,"value"in r&&(r.writable=!0),Object.defineProperty(t,r.key,r)}}var it=function(){function t(){!function(t,e){if(!(t instanceof e))throw new TypeError("Cannot call a class as a function")}(this,t),this.background="#f4f4f4",this.primaryColor="#ECECFF",this.secondaryColor=Object(q.adjust)(this.primaryColor,{h:120}),this.secondaryColor="#ffffde",this.tertiaryColor=Object(q.adjust)(this.primaryColor,{h:-160}),this.primaryBorderColor=X(this.primaryColor,this.darkMode),this.secondaryBorderColor=X(this.secondaryColor,this.darkMode),this.tertiaryBorderColor=X(this.tertiaryColor,this.darkMode),this.primaryTextColor=Object(q.invert)(this.primaryColor),this.secondaryTextColor=Object(q.invert)(this.secondaryColor),this.tertiaryTextColor=Object(q.invert)(this.tertiaryColor),this.lineColor=Object(q.invert)(this.background),this.textColor=Object(q.invert)(this.background),this.background="white",this.mainBkg="#ECECFF",this.secondBkg="#ffffde",this.lineColor="#333333",this.border1="#9370DB",this.border2="#aaaa33",this.arrowheadColor="#333333",this.fontFamily='"trebuchet ms", verdana, arial, sans-serif',this.fontSize="16px",this.labelBackground="#e8e8e8",this.textColor="#333",this.nodeBkg="calculated",this.nodeBorder="calculated",this.clusterBkg="calculated",this.clusterBorder="calculated",this.defaultLinkColor="calculated",this.titleColor="calculated",this.edgeLabelBackground="calculated",this.actorBorder="calculated",this.actorBkg="calculated",this.actorTextColor="black",this.actorLineColor="grey",this.signalColor="calculated",this.signalTextColor="calculated",this.labelBoxBkgColor="calculated",this.labelBoxBorderColor="calculated",this.labelTextColor="calculated",this.loopTextColor="calculated",this.noteBorderColor="calculated",this.noteBkgColor="#fff5ad",this.noteTextColor="calculated",this.activationBorderColor="#666",this.activationBkgColor="#f4f4f4",this.sequenceNumberColor="white",this.sectionBkgColor="calculated",this.altSectionBkgColor="calculated",this.sectionBkgColor2="calculated",this.taskBorderColor="calculated",this.taskBkgColor="calculated",this.taskTextLightColor="calculated",this.taskTextColor=this.taskTextLightColor,this.taskTextDarkColor="calculated",this.taskTextOutsideColor=this.taskTextDarkColor,this.taskTextClickableColor="calculated",this.activeTaskBorderColor="calculated",this.activeTaskBkgColor="calculated",this.gridColor="calculated",this.doneTaskBkgColor="calculated",this.doneTaskBorderColor="calculated",this.critBorderColor="calculated",this.critBkgColor="calculated",this.todayLineColor="calculated",this.sectionBkgColor=Object(q.rgba)(102,102,255,.49),this.altSectionBkgColor="white",this.sectionBkgColor2="#fff400",this.taskBorderColor="#534fbc",this.taskBkgColor="#8a90dd",this.taskTextLightColor="white",this.taskTextColor="calculated",this.taskTextDarkColor="black",this.taskTextOutsideColor="calculated",this.taskTextClickableColor="#003163",this.activeTaskBorderColor="#534fbc",this.activeTaskBkgColor="#bfc7ff",this.gridColor="lightgrey",this.doneTaskBkgColor="lightgrey",this.doneTaskBorderColor="grey",this.critBorderColor="#ff8888",this.critBkgColor="red",this.todayLineColor="red",this.labelColor="black",this.errorBkgColor="#552222",this.errorTextColor="#552222",this.updateColors()}var e,n,r;return e=t,(n=[{key:"updateColors",value:function(){this.nodeBkg=this.mainBkg,this.nodeBorder=this.border1,this.clusterBkg=this.secondBkg,this.clusterBorder=this.border2,this.defaultLinkColor=this.lineColor,this.titleColor=this.textColor,this.edgeLabelBackground=this.labelBackground,this.actorBorder=Object(q.lighten)(this.border1,23),this.actorBkg=this.mainBkg,this.labelBoxBkgColor=this.actorBkg,this.signalColor=this.textColor,this.signalTextColor=this.textColor,this.labelBoxBorderColor=this.actorBorder,this.labelTextColor=this.actorTextColor,this.loopTextColor=this.actorTextColor,this.noteBorderColor=this.border2,this.noteTextColor=this.actorTextColor,this.taskTextColor=this.taskTextLightColor,this.taskTextOutsideColor=this.taskTextDarkColor,this.classText=this.primaryTextColor,this.fillType0=this.primaryColor,this.fillType1=this.secondaryColor,this.fillType2=Object(q.adjust)(this.primaryColor,{h:64}),this.fillType3=Object(q.adjust)(this.secondaryColor,{h:64}),this.fillType4=Object(q.adjust)(this.primaryColor,{h:-64}),this.fillType5=Object(q.adjust)(this.secondaryColor,{h:-64}),this.fillType6=Object(q.adjust)(this.primaryColor,{h:128}),this.fillType7=Object(q.adjust)(this.secondaryColor,{h:128})}},{key:"calculate",value:function(t){var e=this;if("object"===nt(t)){var n=Object.keys(t);n.forEach((function(n){e[n]=t[n]})),this.updateColors(),n.forEach((function(n){e[n]=t[n]}))}else this.updateColors()}}])&&rt(e.prototype,n),r&&rt(e,r),t}();function at(t){return(at="function"==typeof Symbol&&"symbol"==typeof Symbol.iterator?function(t){return typeof t}:function(t){return t&&"function"==typeof Symbol&&t.constructor===Symbol&&t!==Symbol.prototype?"symbol":typeof t})(t)}function ot(t,e){for(var n=0;n<e.length;n++){var r=e[n];r.enumerable=r.enumerable||!1,r.configurable=!0,"value"in r&&(r.writable=!0),Object.defineProperty(t,r.key,r)}}var st=function(){function t(){!function(t,e){if(!(t instanceof e))throw new TypeError("Cannot call a class as a function")}(this,t),this.background="#f4f4f4",this.primaryColor="#cde498",this.secondaryColor="#cdffb2",this.background="white",this.mainBkg="#cde498",this.secondBkg="#cdffb2",this.lineColor="green",this.border1="#13540c",this.border2="#6eaa49",this.arrowheadColor="green",this.fontFamily='"trebuchet ms", verdana, arial, sans-serif',this.fontSize="16px",this.tertiaryColor=Object(q.lighten)("#cde498",10),this.primaryBorderColor=X(this.primaryColor,this.darkMode),this.secondaryBorderColor=X(this.secondaryColor,this.darkMode),this.tertiaryBorderColor=X(this.tertiaryColor,this.darkMode),this.primaryTextColor=Object(q.invert)(this.primaryColor),this.secondaryTextColor=Object(q.invert)(this.secondaryColor),this.tertiaryTextColor=Object(q.invert)(this.primaryColor),this.lineColor=Object(q.invert)(this.background),this.textColor=Object(q.invert)(this.background),this.nodeBkg="calculated",this.nodeBorder="calculated",this.clusterBkg="calculated",this.clusterBorder="calculated",this.defaultLinkColor="calculated",this.titleColor="#333",this.edgeLabelBackground="#e8e8e8",this.actorBorder="calculated",this.actorBkg="calculated",this.actorTextColor="black",this.actorLineColor="grey",this.signalColor="#333",this.signalTextColor="#333",this.labelBoxBkgColor="calculated",this.labelBoxBorderColor="#326932",this.labelTextColor="calculated",this.loopTextColor="calculated",this.noteBorderColor="calculated",this.noteBkgColor="#fff5ad",this.noteTextColor="calculated",this.activationBorderColor="#666",this.activationBkgColor="#f4f4f4",this.sequenceNumberColor="white",this.sectionBkgColor="#6eaa49",this.altSectionBkgColor="white",this.sectionBkgColor2="#6eaa49",this.taskBorderColor="calculated",this.taskBkgColor="#487e3a",this.taskTextLightColor="white",this.taskTextColor="calculated",this.taskTextDarkColor="black",this.taskTextOutsideColor="calculated",this.taskTextClickableColor="#003163",this.activeTaskBorderColor="calculated",this.activeTaskBkgColor="calculated",this.gridColor="lightgrey",this.doneTaskBkgColor="lightgrey",this.doneTaskBorderColor="grey",this.critBorderColor="#ff8888",this.critBkgColor="red",this.todayLineColor="red",this.labelColor="black",this.errorBkgColor="#552222",this.errorTextColor="#552222"}var e,n,r;return e=t,(n=[{key:"updateColors",value:function(){this.nodeBkg=this.mainBkg,this.nodeBorder=this.border1,this.clusterBkg=this.secondBkg,this.clusterBorder=this.border2,this.defaultLinkColor=this.lineColor,this.actorBorder=Object(q.darken)(this.mainBkg,20),this.actorBkg=this.mainBkg,this.labelBoxBkgColor=this.actorBkg,this.labelTextColor=this.actorTextColor,this.loopTextColor=this.actorTextColor,this.noteBorderColor=this.border2,this.noteTextColor=this.actorTextColor,this.taskBorderColor=this.border1,this.taskTextColor=this.taskTextLightColor,this.taskTextOutsideColor=this.taskTextDarkColor,this.activeTaskBorderColor=this.taskBorderColor,this.activeTaskBkgColor=this.mainBkg,this.classText=this.primaryTextColor,this.fillType0=this.primaryColor,this.fillType1=this.secondaryColor,this.fillType2=Object(q.adjust)(this.primaryColor,{h:64}),this.fillType3=Object(q.adjust)(this.secondaryColor,{h:64}),this.fillType4=Object(q.adjust)(this.primaryColor,{h:-64}),this.fillType5=Object(q.adjust)(this.secondaryColor,{h:-64}),this.fillType6=Object(q.adjust)(this.primaryColor,{h:128}),this.fillType7=Object(q.adjust)(this.secondaryColor,{h:128})}},{key:"calculate",value:function(t){var e=this;if("object"===at(t)){var n=Object.keys(t);n.forEach((function(n){e[n]=t[n]})),this.updateColors(),n.forEach((function(n){e[n]=t[n]}))}else this.updateColors()}}])&&ot(e.prototype,n),r&&ot(e,r),t}();function ct(t){return(ct="function"==typeof Symbol&&"symbol"==typeof Symbol.iterator?function(t){return typeof t}:function(t){return t&&"function"==typeof Symbol&&t.constructor===Symbol&&t!==Symbol.prototype?"symbol":typeof t})(t)}function ut(t,e){for(var n=0;n<e.length;n++){var r=e[n];r.enumerable=r.enumerable||!1,r.configurable=!0,"value"in r&&(r.writable=!0),Object.defineProperty(t,r.key,r)}}var lt=function(){function t(){!function(t,e){if(!(t instanceof e))throw new TypeError("Cannot call a class as a function")}(this,t),this.primaryColor="#eee",this.contrast="#26a",this.secondaryColor=Object(q.lighten)(this.contrast,55),this.background="#ffffff",this.tertiaryColor=Object(q.adjust)(this.primaryColor,{h:-160}),this.primaryBorderColor=X(this.primaryColor,this.darkMode),this.secondaryBorderColor=X(this.secondaryColor,this.darkMode),this.tertiaryBorderColor=X(this.tertiaryColor,this.darkMode),this.primaryTextColor=Object(q.invert)(this.primaryColor),this.secondaryTextColor=Object(q.invert)(this.secondaryColor),this.tertiaryTextColor=Object(q.invert)(this.tertiaryColor),this.lineColor=Object(q.invert)(this.background),this.textColor=Object(q.invert)(this.background),this.altBackground=Object(q.lighten)(this.contrast,55),this.mainBkg="#eee",this.secondBkg="calculated",this.lineColor="#666",this.border1="#999",this.border2="calculated",this.note="#ffa",this.text="#333",this.critical="#d42",this.done="#bbb",this.arrowheadColor="#333333",this.fontFamily='"trebuchet ms", verdana, arial, sans-serif',this.fontSize="16px",this.nodeBkg="calculated",this.nodeBorder="calculated",this.clusterBkg="calculated",this.clusterBorder="calculated",this.defaultLinkColor="calculated",this.titleColor="calculated",this.edgeLabelBackground="white",this.actorBorder="calculated",this.actorBkg="calculated",this.actorTextColor="calculated",this.actorLineColor="calculated",this.signalColor="calculated",this.signalTextColor="calculated",this.labelBoxBkgColor="calculated",this.labelBoxBorderColor="calculated",this.labelTextColor="calculated",this.loopTextColor="calculated",this.noteBorderColor="calculated",this.noteBkgColor="calculated",this.noteTextColor="calculated",this.activationBorderColor="#666",this.activationBkgColor="#f4f4f4",this.sequenceNumberColor="white",this.sectionBkgColor="calculated",this.altSectionBkgColor="white",this.sectionBkgColor2="calculated",this.taskBorderColor="calculated",this.taskBkgColor="calculated",this.taskTextLightColor="white",this.taskTextColor="calculated",this.taskTextDarkColor="calculated",this.taskTextOutsideColor="calculated",this.taskTextClickableColor="#003163",this.activeTaskBorderColor="calculated",this.activeTaskBkgColor="calculated",this.gridColor="calculated",this.doneTaskBkgColor="calculated",this.doneTaskBorderColor="calculated",this.critBkgColor="calculated",this.critBorderColor="calculated",this.todayLineColor="calculated",this.labelColor="black",this.errorBkgColor="#552222",this.errorTextColor="#552222"}var e,n,r;return e=t,(n=[{key:"updateColors",value:function(){this.secondBkg=Object(q.lighten)(this.contrast,55),this.border2=this.contrast,this.nodeBkg=this.mainBkg,this.nodeBorder=this.border1,this.clusterBkg=this.secondBkg,this.clusterBorder=this.border2,this.defaultLinkColor=this.lineColor,this.titleColor=this.text,this.actorBorder=Object(q.lighten)(this.border1,23),this.actorBkg=this.mainBkg,this.actorTextColor=this.text,this.actorLineColor=this.lineColor,this.signalColor=this.text,this.signalTextColor=this.text,this.labelBoxBkgColor=this.actorBkg,this.labelBoxBorderColor=this.actorBorder,this.labelTextColor=this.text,this.loopTextColor=this.text,this.noteBorderColor=Object(q.darken)(this.note,60),this.noteBkgColor=this.note,this.noteTextColor=this.actorTextColor,this.sectionBkgColor=Object(q.lighten)(this.contrast,30),this.sectionBkgColor2=Object(q.lighten)(this.contrast,30),this.taskBorderColor=Object(q.darken)(this.contrast,10),this.taskBkgColor=this.contrast,this.taskTextColor=this.taskTextLightColor,this.taskTextDarkColor=this.text,this.taskTextOutsideColor=this.taskTextDarkColor,this.activeTaskBorderColor=this.taskBorderColor,this.activeTaskBkgColor=this.mainBkg,this.gridColor=Object(q.lighten)(this.border1,30),this.doneTaskBkgColor=this.done,this.doneTaskBorderColor=this.lineColor,this.critBkgColor=this.critical,this.critBorderColor=Object(q.darken)(this.critBkgColor,10),this.todayLineColor=this.critBkgColor,this.classText=this.primaryTextColor,this.fillType0=this.primaryColor,this.fillType1=this.secondaryColor,this.fillType2=Object(q.adjust)(this.primaryColor,{h:64}),this.fillType3=Object(q.adjust)(this.secondaryColor,{h:64}),this.fillType4=Object(q.adjust)(this.primaryColor,{h:-64}),this.fillType5=Object(q.adjust)(this.secondaryColor,{h:-64}),this.fillType6=Object(q.adjust)(this.primaryColor,{h:128}),this.fillType7=Object(q.adjust)(this.secondaryColor,{h:128})}},{key:"calculate",value:function(t){var e=this;if("object"===ct(t)){var n=Object.keys(t);n.forEach((function(n){e[n]=t[n]})),this.updateColors(),n.forEach((function(n){e[n]=t[n]}))}else this.updateColors()}}])&&ut(e.prototype,n),r&&ut(e,r),t}(),ht={base:{getThemeVariables:function(t){var e=new K;return e.calculate(t),e}},dark:{getThemeVariables:function(t){var e=new et;return e.calculate(t),e}},default:{getThemeVariables:function(t){var e=new it;return e.calculate(t),e}},forest:{getThemeVariables:function(t){var e=new st;return e.calculate(t),e}},neutral:{getThemeVariables:function(t){var e=new lt;return e.calculate(t),e}}},ft={theme:"default",themeVariables:ht.default.getThemeVariables(),themeCSS:void 0,maxTextSize:5e4,fontFamily:'"trebuchet ms", verdana, arial, sans-serif;',logLevel:5,securityLevel:"strict",startOnLoad:!0,arrowMarkerAbsolute:!1,secure:["secure","securityLevel","startOnLoad","maxTextSize"],deterministicIds:!1,deterministicIDSeed:void 0,flowchart:{diagramPadding:8,htmlLabels:!0,nodeSpacing:50,rankSpacing:50,curve:"linear",padding:15,useMaxWidth:!0},sequence:{activationWidth:10,diagramMarginX:50,diagramMarginY:10,actorMargin:50,width:150,height:65,boxMargin:10,boxTextMargin:5,noteMargin:10,messageMargin:35,messageAlign:"center",mirrorActors:!0,bottomMarginAdj:1,useMaxWidth:!0,rightAngles:!1,showSequenceNumbers:!1,actorFontSize:14,actorFontFamily:'"Open-Sans", "sans-serif"',actorFontWeight:400,noteFontSize:14,noteFontFamily:'"trebuchet ms", verdana, arial, sans-serif',noteFontWeight:400,noteAlign:"center",messageFontSize:16,messageFontFamily:'"trebuchet ms", verdana, arial, sans-serif',messageFontWeight:400,wrap:!1,wrapPadding:10,labelBoxWidth:50,labelBoxHeight:20,messageFont:function(){return{fontFamily:this.messageFontFamily,fontSize:this.messageFontSize,fontWeight:this.messageFontWeight}},noteFont:function(){return{fontFamily:this.noteFontFamily,fontSize:this.noteFontSize,fontWeight:this.noteFontWeight}},actorFont:function(){return{fontFamily:this.actorFontFamily,fontSize:this.actorFontSize,fontWeight:this.actorFontWeight}}},gantt:{titleTopMargin:25,barHeight:20,barGap:4,topPadding:50,leftPadding:75,gridLineStartPadding:35,fontSize:11,fontFamily:'"Open-Sans", "sans-serif"',numberSectionStyles:4,axisFormat:"%Y-%m-%d",useMaxWidth:!0,useWidth:void 0},journey:{diagramMarginX:50,diagramMarginY:10,actorMargin:50,width:150,height:65,boxMargin:10,boxTextMargin:5,noteMargin:10,messageMargin:35,messageAlign:"center",bottomMarginAdj:1,useMaxWidth:!0,rightAngles:!1},class:{arrowMarkerAbsolute:!1,useMaxWidth:!0},git:{arrowMarkerAbsolute:!1,useWidth:void 0,useMaxWidth:!0},state:{dividerMargin:10,sizeUnit:5,padding:8,textHeight:10,titleShift:-15,noteMargin:10,forkWidth:70,forkHeight:7,miniPadding:2,fontSizeFactor:5.02,fontSize:24,labelHeight:16,edgeLengthFactor:"20",compositTitleSize:35,radius:5,useMaxWidth:!0},er:{diagramPadding:20,layoutDirection:"TB",minEntityWidth:100,minEntityHeight:75,entityPadding:15,stroke:"gray",fill:"honeydew",fontSize:12,useMaxWidth:!0},pie:{useWidth:void 0,useMaxWidth:!0}};ft.class.arrowMarkerAbsolute=ft.arrowMarkerAbsolute,ft.git.arrowMarkerAbsolute=ft.arrowMarkerAbsolute;var dt,pt=ft,gt=Object.freeze(pt),yt=F({},gt),vt=[],mt=F({},gt),bt=function(t,e){for(var n=F({},t),r={},i=0;i<e.length;i++){var a=e[i];kt(a),r=F(r,a)}if(n=F(n,r),r.theme){var o=F(dt.themeVariables||{},r.themeVariables);n.themeVariables=ht[n.theme].getThemeVariables(o)}return mt=n,n},xt=function(){return F({},yt)},_t=function(){return F({},mt)},kt=function(t){Object.keys(yt.secure).forEach((function(e){void 0!==t[yt.secure[e]]&&(c.debug("Denied attempt to modify a secure key ".concat(yt.secure[e]),t[yt.secure[e]]),delete t[yt.secure[e]])}))},wt=function(t){t.fontFamily&&(t.themeVariables&&t.themeVariables.fontFamily||(t.themeVariables={fontFamily:t.fontFamily})),vt.push(t),bt(yt,vt)},Et=function(){bt(yt,vt=[])};function Tt(t){return(Tt="function"==typeof Symbol&&"symbol"==typeof Symbol.iterator?function(t){return typeof t}:function(t){return t&&"function"==typeof Symbol&&t.constructor===Symbol&&t!==Symbol.prototype?"symbol":typeof t})(t)}function Ct(t){return function(t){if(Array.isArray(t)){for(var e=0,n=new Array(t.length);e<t.length;e++)n[e]=t[e];return n}}(t)||function(t){if(Symbol.iterator in Object(t)||"[object Arguments]"===Object.prototype.toString.call(t))return Array.from(t)}(t)||function(){throw new TypeError("Invalid attempt to spread non-iterable instance")}()}var At,St,Mt=0,Ot=_t(),Dt={},Nt=[],Bt=[],Lt=[],Pt={},It={},Ft=0,jt=!0,Rt=[],Yt=function(t){for(var e=Object.keys(Dt),n=0;n<e.length;n++)if(Dt[e[n]].id===t)return Dt[e[n]].domId;return t},zt=function(t,e,n,r){var i={start:t,end:e,type:void 0,text:""};void 0!==(r=n.text)&&(i.text=x.sanitizeText(r.trim(),Ot),'"'===i.text[0]&&'"'===i.text[i.text.length-1]&&(i.text=i.text.substring(1,i.text.length-1))),void 0!==n&&(i.type=n.type,i.stroke=n.stroke,i.length=n.length),Nt.push(i)},Ut=function(t,e){t.split(",").forEach((function(t){var n=t;void 0!==Dt[n]&&Dt[n].classes.push(e),void 0!==Pt[n]&&Pt[n].classes.push(e)}))},$t=function(t){var e=Object(d.select)(".mermaidTooltip");null===(e._groups||e)[0][0]&&(e=Object(d.select)("body").append("div").attr("class","mermaidTooltip").style("opacity",0)),Object(d.select)(t).select("svg").selectAll("g.node").on("mouseover",(function(){var t=Object(d.select)(this);if(null!==t.attr("title")){var n=this.getBoundingClientRect();e.transition().duration(200).style("opacity",".9"),e.html(t.attr("title")).style("left",window.scrollX+n.left+(n.right-n.left)/2+"px").style("top",window.scrollY+n.top-14+document.body.scrollTop+"px"),t.classed("hover",!0)}})).on("mouseout",(function(){e.transition().duration(500).style("opacity",0),Object(d.select)(this).classed("hover",!1)}))};Rt.push($t);var Wt=function(t){for(var e=0;e<Lt.length;e++)if(Lt[e].id===t)return e;return-1},Ht=-1,Vt=[],Gt=function(t,e){var n=!1;return t.forEach((function(t){t.nodes.indexOf(e)>=0&&(n=!0)})),n},qt=function(t,e){var n=[];return t.nodes.forEach((function(r,i){Gt(e,r)||n.push(t.nodes[i])})),{nodes:n}},Xt={parseDirective:function(t,e,n){Go.parseDirective(this,t,e,n)},defaultConfig:function(){return gt.flowchart},addVertex:function(t,e,n,r,i){var a,o=t;void 0!==o&&0!==o.trim().length&&(void 0===Dt[o]&&(Dt[o]={id:o,domId:"flowchart-"+o+"-"+Mt,styles:[],classes:[]}),Mt++,void 0!==e?(Ot=_t(),'"'===(a=x.sanitizeText(e.trim(),Ot))[0]&&'"'===a[a.length-1]&&(a=a.substring(1,a.length-1)),Dt[o].text=a):void 0===Dt[o].text&&(Dt[o].text=t),void 0!==n&&(Dt[o].type=n),null!=r&&r.forEach((function(t){Dt[o].styles.push(t)})),null!=i&&i.forEach((function(t){Dt[o].classes.push(t)})))},lookUpDomId:Yt,addLink:function(t,e,n,r){var i,a;for(i=0;i<t.length;i++)for(a=0;a<e.length;a++)zt(t[i],e[a],n,r)},updateLinkInterpolate:function(t,e){t.forEach((function(t){"default"===t?Nt.defaultInterpolate=e:Nt[t].interpolate=e}))},updateLink:function(t,e){t.forEach((function(t){"default"===t?Nt.defaultStyle=e:(-1===H.isSubstringInArray("fill",e)&&e.push("fill:none"),Nt[t].style=e)}))},addClass:function(t,e){void 0===Bt[t]&&(Bt[t]={id:t,styles:[],textStyles:[]}),null!=e&&e.forEach((function(e){if(e.match("color")){var n=e.replace("fill","bgFill").replace("color","fill");Bt[t].textStyles.push(n)}Bt[t].styles.push(e)}))},setDirection:function(t){(At=t).match(/.*</)&&(At="RL"),At.match(/.*\^/)&&(At="BT"),At.match(/.*>/)&&(At="LR"),At.match(/.*v/)&&(At="TB")},setClass:Ut,setTooltip:function(t,e){t.split(",").forEach((function(t){void 0!==e&&(It["gen-1"===St?Yt(t):t]=x.sanitizeText(e,Ot))}))},getTooltip:function(t){return It[t]},setClickEvent:function(t,e,n){t.split(",").forEach((function(t){!function(t,e,n){var r=Yt(t);if("loose"===_t().securityLevel&&void 0!==e){var i=[];if("string"==typeof n){i=n.split(/,(?=(?:(?:[^"]*"){2})*[^"]*$)/);for(var a=0;a<i.length;a++){var o=i[a].trim();'"'===o.charAt(0)&&'"'===o.charAt(o.length-1)&&(o=o.substr(1,o.length-2)),i[a]=o}}0===i.length&&i.push(t),void 0!==Dt[t]&&(Dt[t].haveCallback=!0,Rt.push((function(){var t=document.querySelector('[id="'.concat(r,'"]'));null!==t&&t.addEventListener("click",(function(){H.runFunc.apply(H,[e].concat(Ct(i)))}),!1)})))}}(t,e,n)})),Ut(t,"clickable")},setLink:function(t,e,n){t.split(",").forEach((function(t){void 0!==Dt[t]&&(Dt[t].link=H.formatUrl(e,Ot),Dt[t].linkTarget=n)})),Ut(t,"clickable")},bindFunctions:function(t){Rt.forEach((function(e){e(t)}))},getDirection:function(){return At.trim()},getVertices:function(){return Dt},getEdges:function(){return Nt},getClasses:function(){return Bt},clear:function(t){Dt={},Bt={},Nt=[],(Rt=[]).push($t),Lt=[],Pt={},Ft=0,It=[],jt=!0,St=t||"gen-1"},setGen:function(t){St=t||"gen-1"},defaultStyle:function(){return"fill:#ffa;stroke: #f66; stroke-width: 3px; stroke-dasharray: 5, 5;fill:#ffa;stroke: #666;"},addSubGraph:function(t,e,n){var r=t.trim(),i=n;t===n&&n.match(/\s/)&&(r=void 0);var a,o,s,u=[];if(a=u.concat.apply(u,e),o={boolean:{},number:{},string:{}},s=[],u=a.filter((function(t){var e=Tt(t);return""!==t.trim()&&(e in o?!o[e].hasOwnProperty(t)&&(o[e][t]=!0):!(s.indexOf(t)>=0)&&s.push(t))})),"gen-1"===St){c.warn("LOOKING UP");for(var l=0;l<u.length;l++)u[l]=Yt(u[l])}r=r||"subGraph"+Ft,i=i||"",i=x.sanitizeText(i,Ot),Ft+=1;var h={id:r,nodes:u,title:i.trim(),classes:[]};return c.info("Adding",h.id,h.nodes),h.nodes=qt(h,Lt).nodes,Lt.push(h),Pt[r]=h,r},getDepthFirstPos:function(t){return Vt[t]},indexNodes:function(){Ht=-1,Lt.length>0&&function t(e,n){var r=Lt[n].nodes;if(!((Ht+=1)>2e3)){if(Vt[Ht]=n,Lt[n].id===e)return{result:!0,count:0};for(var i=0,a=1;i<r.length;){var o=Wt(r[i]);if(o>=0){var s=t(e,o);if(s.result)return{result:!0,count:a+s.count};a+=s.count}i+=1}return{result:!1,count:a}}}("none",Lt.length-1)},getSubGraphs:function(){return Lt},destructLink:function(t,e){var n,r=function(t){var e=t.trim(),n=e.slice(0,-1),r="arrow_open";switch(e.slice(-1)){case"x":r="arrow_cross","x"===e[0]&&(r="double_"+r,n=n.slice(1));break;case">":r="arrow_point","<"===e[0]&&(r="double_"+r,n=n.slice(1));break;case"o":r="arrow_circle","o"===e[0]&&(r="double_"+r,n=n.slice(1))}var i="normal",a=n.length-1;"="===n[0]&&(i="thick");var o=function(t,e){for(var n=e.length,r=0,i=0;i<n;++i)e[i]===t&&++r;return r}(".",n);return o&&(i="dotted",a=o),{type:r,stroke:i,length:a}}(t);if(e){if((n=function(t){var e=t.trim(),n="arrow_open";switch(e[0]){case"<":n="arrow_point",e=e.slice(1);break;case"x":n="arrow_cross",e=e.slice(1);break;case"o":n="arrow_circle",e=e.slice(1)}var r="normal";return-1!==e.indexOf("=")&&(r="thick"),-1!==e.indexOf(".")&&(r="dotted"),{type:n,stroke:r}}(e)).stroke!==r.stroke)return{type:"INVALID",stroke:"INVALID"};if("arrow_open"===n.type)n.type=r.type;else{if(n.type!==r.type)return{type:"INVALID",stroke:"INVALID"};n.type="double_"+n.type}return"double_arrow"===n.type&&(n.type="double_arrow_point"),n.length=r.length,n}return r},lex:{firstGraph:function(){return!!jt&&(jt=!1,!0)}},exists:Gt,makeUniq:qt},Zt=n(26),Jt=n.n(Zt),Kt=n(6),Qt=n.n(Kt),te=n(50),ee=n.n(te);function ne(t,e,n){var r=.9*(e.width+e.height),i=[{x:r/2,y:0},{x:r,y:-r/2},{x:r/2,y:-r},{x:0,y:-r/2}],a=de(t,r,r,i);return n.intersect=function(t){return Qt.a.intersect.polygon(n,i,t)},a}function re(t,e,n){var r=e.height,i=r/4,a=e.width+2*i,o=[{x:i,y:0},{x:a-i,y:0},{x:a,y:-r/2},{x:a-i,y:-r},{x:i,y:-r},{x:0,y:-r/2}],s=de(t,a,r,o);return n.intersect=function(t){return Qt.a.intersect.polygon(n,o,t)},s}function ie(t,e,n){var r=e.width,i=e.height,a=[{x:-i/2,y:0},{x:r,y:0},{x:r,y:-i},{x:-i/2,y:-i},{x:0,y:-i/2}],o=de(t,r,i,a);return n.intersect=function(t){return Qt.a.intersect.polygon(n,a,t)},o}function ae(t,e,n){var r=e.width,i=e.height,a=[{x:-2*i/6,y:0},{x:r-i/6,y:0},{x:r+2*i/6,y:-i},{x:i/6,y:-i}],o=de(t,r,i,a);return n.intersect=function(t){return Qt.a.intersect.polygon(n,a,t)},o}function oe(t,e,n){var r=e.width,i=e.height,a=[{x:2*i/6,y:0},{x:r+i/6,y:0},{x:r-2*i/6,y:-i},{x:-i/6,y:-i}],o=de(t,r,i,a);return n.intersect=function(t){return Qt.a.intersect.polygon(n,a,t)},o}function se(t,e,n){var r=e.width,i=e.height,a=[{x:-2*i/6,y:0},{x:r+2*i/6,y:0},{x:r-i/6,y:-i},{x:i/6,y:-i}],o=de(t,r,i,a);return n.intersect=function(t){return Qt.a.intersect.polygon(n,a,t)},o}function ce(t,e,n){var r=e.width,i=e.height,a=[{x:i/6,y:0},{x:r-i/6,y:0},{x:r+2*i/6,y:-i},{x:-2*i/6,y:-i}],o=de(t,r,i,a);return n.intersect=function(t){return Qt.a.intersect.polygon(n,a,t)},o}function ue(t,e,n){var r=e.width,i=e.height,a=[{x:0,y:0},{x:r+i/2,y:0},{x:r,y:-i/2},{x:r+i/2,y:-i},{x:0,y:-i}],o=de(t,r,i,a);return n.intersect=function(t){return Qt.a.intersect.polygon(n,a,t)},o}function le(t,e,n){var r=e.height,i=e.width+r/4,a=t.insert("rect",":first-child").attr("rx",r/2).attr("ry",r/2).attr("x",-i/2).attr("y",-r/2).attr("width",i).attr("height",r);return n.intersect=function(t){return Qt.a.intersect.rect(n,t)},a}function he(t,e,n){var r=e.width,i=e.height,a=[{x:0,y:0},{x:r,y:0},{x:r,y:-i},{x:0,y:-i},{x:0,y:0},{x:-8,y:0},{x:r+8,y:0},{x:r+8,y:-i},{x:-8,y:-i},{x:-8,y:0}],o=de(t,r,i,a);return n.intersect=function(t){return Qt.a.intersect.polygon(n,a,t)},o}function fe(t,e,n){var r=e.width,i=r/2,a=i/(2.5+r/50),o=e.height+a,s="M 0,"+a+" a "+i+","+a+" 0,0,0 "+r+" 0 a "+i+","+a+" 0,0,0 "+-r+" 0 l 0,"+o+" a "+i+","+a+" 0,0,0 "+r+" 0 l 0,"+-o,c=t.attr("label-offset-y",a).insert("path",":first-child").attr("d",s).attr("transform","translate("+-r/2+","+-(o/2+a)+")");return n.intersect=function(t){var e=Qt.a.intersect.rect(n,t),r=e.x-n.x;if(0!=i&&(Math.abs(r)<n.width/2||Math.abs(r)==n.width/2&&Math.abs(e.y-n.y)>n.height/2-a)){var o=a*a*(1-r*r/(i*i));0!=o&&(o=Math.sqrt(o)),o=a-o,t.y-n.y>0&&(o=-o),e.y+=o}return e},c}function de(t,e,n,r){return t.insert("polygon",":first-child").attr("points",r.map((function(t){return t.x+","+t.y})).join(" ")).attr("transform","translate("+-e/2+","+n/2+")")}var pe={addToRender:function(t){t.shapes().question=ne,t.shapes().hexagon=re,t.shapes().stadium=le,t.shapes().subroutine=he,t.shapes().cylinder=fe,t.shapes().rect_left_inv_arrow=ie,t.shapes().lean_right=ae,t.shapes().lean_left=oe,t.shapes().trapezoid=se,t.shapes().inv_trapezoid=ce,t.shapes().rect_right_inv_arrow=ue},addToRenderV2:function(t){t({question:ne}),t({hexagon:re}),t({stadium:le}),t({subroutine:he}),t({cylinder:fe}),t({rect_left_inv_arrow:ie}),t({lean_right:ae}),t({lean_left:oe}),t({trapezoid:se}),t({inv_trapezoid:ce}),t({rect_right_inv_arrow:ue})}},ge={},ye=function(t,e,n){var r=Object(d.select)('[id="'.concat(n,'"]'));Object.keys(t).forEach((function(n){var i=t[n],a="default";i.classes.length>0&&(a=i.classes.join(" "));var o,s=B(i.styles),u=void 0!==i.text?i.text:i.id;if(_t().flowchart.htmlLabels){var l={label:u.replace(/fa[lrsb]?:fa-[\w-]+/g,(function(t){return"<i class='".concat(t.replace(":"," "),"'></i>")}))};(o=ee()(r,l).node()).parentNode.removeChild(o)}else{var h=document.createElementNS("http://www.w3.org/2000/svg","text");h.setAttribute("style",s.labelStyle.replace("color:","fill:"));for(var f=u.split(x.lineBreakRegex),d=0;d<f.length;d++){var p=document.createElementNS("http://www.w3.org/2000/svg","tspan");p.setAttributeNS("http://www.w3.org/XML/1998/namespace","xml:space","preserve"),p.setAttribute("dy","1em"),p.setAttribute("x","1"),p.textContent=f[d],h.appendChild(p)}o=h}var g=0,y="";switch(i.type){case"round":g=5,y="rect";break;case"square":y="rect";break;case"diamond":y="question";break;case"hexagon":y="hexagon";break;case"odd":y="rect_left_inv_arrow";break;case"lean_right":y="lean_right";break;case"lean_left":y="lean_left";break;case"trapezoid":y="trapezoid";break;case"inv_trapezoid":y="inv_trapezoid";break;case"odd_right":y="rect_left_inv_arrow";break;case"circle":y="circle";break;case"ellipse":y="ellipse";break;case"stadium":y="stadium";break;case"subroutine":y="subroutine";break;case"cylinder":y="cylinder";break;case"group":y="rect";break;default:y="rect"}c.warn("Adding node",i.id,i.domId),e.setNode(Xt.lookUpDomId(i.id),{labelType:"svg",labelStyle:s.labelStyle,shape:y,label:o,rx:g,ry:g,class:a,style:s.style,id:Xt.lookUpDomId(i.id)})}))},ve=function(t,e){var n,r,i=0;if(void 0!==t.defaultStyle){var a=B(t.defaultStyle);n=a.style,r=a.labelStyle}t.forEach((function(a){i++;var o="L-"+a.start+"-"+a.end,s="LS-"+a.start,c="LE-"+a.end,u={};"arrow_open"===a.type?u.arrowhead="none":u.arrowhead="normal";var l="",h="";if(void 0!==a.style){var f=B(a.style);l=f.style,h=f.labelStyle}else switch(a.stroke){case"normal":l="fill:none",void 0!==n&&(l=n),void 0!==r&&(h=r);break;case"dotted":l="fill:none;stroke-width:2px;stroke-dasharray:3;";break;case"thick":l=" stroke-width: 3.5px;fill:none"}u.style=l,u.labelStyle=h,void 0!==a.interpolate?u.curve=D(a.interpolate,d.curveLinear):void 0!==t.defaultInterpolate?u.curve=D(t.defaultInterpolate,d.curveLinear):u.curve=D(ge.curve,d.curveLinear),void 0===a.text?void 0!==a.style&&(u.arrowheadStyle="fill: #333"):(u.arrowheadStyle="fill: #333",u.labelpos="c",_t().flowchart.htmlLabels?(u.labelType="html",u.label='<span id="L-'.concat(o,'" class="edgeLabel L-').concat(s,"' L-").concat(c,'">').concat(a.text.replace(/fa[lrsb]?:fa-[\w-]+/g,(function(t){return"<i class='".concat(t.replace(":"," "),"'></i>")})),"</span>")):(u.labelType="text",u.label=a.text.replace(x.lineBreakRegex,"\n"),void 0===a.style&&(u.style=u.style||"stroke: #333; stroke-width: 1.5px;fill:none"),u.labelStyle=u.labelStyle.replace("color:","fill:"))),u.id=o,u.class=s+" "+c,u.minlen=a.length||1,e.setEdge(Xt.lookUpDomId(a.start),Xt.lookUpDomId(a.end),u,i)}))},me=function(t){for(var e=Object.keys(t),n=0;n<e.length;n++)ge[e[n]]=t[e[n]]},be=function(t){c.info("Extracting classes"),Xt.clear();try{var e=Jt.a.parser;return e.yy=Xt,e.parse(t),Xt.getClasses()}catch(t){return}},xe=function(t,e){c.info("Drawing flowchart"),Xt.clear(),Xt.setGen("gen-1");var n=Jt.a.parser;n.yy=Xt,n.parse(t);var r=Xt.getDirection();void 0===r&&(r="TD");for(var i,a=_t().flowchart,o=a.nodeSpacing||50,s=a.rankSpacing||50,u=new G.a.Graph({multigraph:!0,compound:!0}).setGraph({rankdir:r,nodesep:o,ranksep:s,marginx:8,marginy:8}).setDefaultEdgeLabel((function(){return{}})),l=Xt.getSubGraphs(),h=l.length-1;h>=0;h--)i=l[h],Xt.addVertex(i.id,i.title,"group",void 0,i.classes);var f=Xt.getVertices();c.warn("Get vertices",f);var p=Xt.getEdges(),g=0;for(g=l.length-1;g>=0;g--){i=l[g],Object(d.selectAll)("cluster").append("text");for(var y=0;y<i.nodes.length;y++)c.warn("Setting subgraph",i.nodes[y],Xt.lookUpDomId(i.nodes[y]),Xt.lookUpDomId(i.id)),u.setParent(Xt.lookUpDomId(i.nodes[y]),Xt.lookUpDomId(i.id))}ye(f,u,e),ve(p,u);var v=new(0,Qt.a.render);pe.addToRender(v),v.arrows().none=function(t,e,n,r){var i=t.append("marker").attr("id",e).attr("viewBox","0 0 10 10").attr("refX",9).attr("refY",5).attr("markerUnits","strokeWidth").attr("markerWidth",8).attr("markerHeight",6).attr("orient","auto").append("path").attr("d","M 0 0 L 0 0 L 0 0 z");Qt.a.util.applyStyle(i,n[r+"Style"])},v.arrows().normal=function(t,e){t.append("marker").attr("id",e).attr("viewBox","0 0 10 10").attr("refX",9).attr("refY",5).attr("markerUnits","strokeWidth").attr("markerWidth",8).attr("markerHeight",6).attr("orient","auto").append("path").attr("d","M 0 0 L 10 5 L 0 10 z").attr("class","arrowheadPath").style("stroke-width",1).style("stroke-dasharray","1,0")};var m=Object(d.select)('[id="'.concat(e,'"]'));m.attr("xmlns:xlink","http://www.w3.org/1999/xlink"),c.warn(u);var b=Object(d.select)("#"+e+" g");v(b,u),b.selectAll("g.node").attr("title",(function(){return Xt.getTooltip(this.id)}));var x=a.diagramPadding,_=m.node().getBBox(),k=_.width+2*x,w=_.height+2*x;W(m,w,k,a.useMaxWidth);var E="".concat(_.x-x," ").concat(_.y-x," ").concat(k," ").concat(w);for(c.debug("viewBox ".concat(E)),m.attr("viewBox",E),Xt.indexNodes("subGraph"+g),g=0;g<l.length;g++)if("undefined"!==(i=l[g]).title){var T=document.querySelectorAll("#"+e+' [id="'+Xt.lookUpDomId(i.id)+'"] rect'),C=document.querySelectorAll("#"+e+' [id="'+Xt.lookUpDomId(i.id)+'"]'),A=T[0].x.baseVal.value,S=T[0].y.baseVal.value,M=T[0].width.baseVal.value,O=Object(d.select)(C[0]).select(".label");O.attr("transform","translate(".concat(A+M/2,", ").concat(S+14,")")),O.attr("id",e+"Text");for(var D=0;D<i.classes.length;D++)C[0].classList.add(i.classes[D])}a.htmlLabels;for(var N=document.querySelectorAll('[id="'+e+'"] .edgeLabel .label'),B=0;B<N.length;B++){var L=N[B],P=L.getBBox(),I=document.createElementNS("http://www.w3.org/2000/svg","rect");I.setAttribute("rx",0),I.setAttribute("ry",0),I.setAttribute("width",P.width),I.setAttribute("height",P.height),L.insertBefore(I,L.firstChild)}Object.keys(f).forEach((function(t){var n=f[t];if(n.link){var r=Object(d.select)("#"+e+' [id="'+Xt.lookUpDomId(t)+'"]');if(r){var i=document.createElementNS("http://www.w3.org/2000/svg","a");i.setAttributeNS("http://www.w3.org/2000/svg","class",n.classes.join(" ")),i.setAttributeNS("http://www.w3.org/2000/svg","href",n.link),i.setAttributeNS("http://www.w3.org/2000/svg","rel","noopener"),n.linkTarget&&i.setAttributeNS("http://www.w3.org/2000/svg","target",n.linkTarget);var a=r.insert((function(){return i}),":first-child"),o=r.select(".label-container");o&&a.append((function(){return o.node()}));var s=r.select(".label");s&&a.append((function(){return s.node()}))}}}))},_e=n(18),ke=n.n(_e),we={extension:function(t,e,n){c.trace("Making markers for ",n),t.append("defs").append("marker").attr("id",e+"-extensionStart").attr("class","marker extension "+e).attr("refX",0).attr("refY",7).attr("markerWidth",190).attr("markerHeight",240).attr("orient","auto").append("path").attr("d","M 1,7 L18,13 V 1 Z"),t.append("defs").append("marker").attr("id",e+"-extensionEnd").attr("class","marker extension "+e).attr("refX",19).attr("refY",7).attr("markerWidth",20).attr("markerHeight",28).attr("orient","auto").append("path").attr("d","M 1,1 V 13 L18,7 Z")},composition:function(t,e){t.append("defs").append("marker").attr("id",e+"-compositionStart").attr("class","marker composition "+e).attr("refX",0).attr("refY",7).attr("markerWidth",190).attr("markerHeight",240).attr("orient","auto").append("path").attr("d","M 18,7 L9,13 L1,7 L9,1 Z"),t.append("defs").append("marker").attr("id",e+"-compositionEnd").attr("class","marker composition "+e).attr("refX",19).attr("refY",7).attr("markerWidth",20).attr("markerHeight",28).attr("orient","auto").append("path").attr("d","M 18,7 L9,13 L1,7 L9,1 Z")},aggregation:function(t,e){t.append("defs").append("marker").attr("id",e+"-aggregationStart").attr("class","marker aggregation "+e).attr("refX",0).attr("refY",7).attr("markerWidth",190).attr("markerHeight",240).attr("orient","auto").append("path").attr("d","M 18,7 L9,13 L1,7 L9,1 Z"),t.append("defs").append("marker").attr("id",e+"-aggregationEnd").attr("class","marker aggregation "+e).attr("refX",19).attr("refY",7).attr("markerWidth",20).attr("markerHeight",28).attr("orient","auto").append("path").attr("d","M 18,7 L9,13 L1,7 L9,1 Z")},dependency:function(t,e){t.append("defs").append("marker").attr("id",e+"-dependencyStart").attr("class","marker dependency "+e).attr("refX",0).attr("refY",7).attr("markerWidth",190).attr("markerHeight",240).attr("orient","auto").append("path").attr("d","M 5,7 L9,13 L1,7 L9,1 Z"),t.append("defs").append("marker").attr("id",e+"-dependencyEnd").attr("class","marker dependency "+e).attr("refX",19).attr("refY",7).attr("markerWidth",20).attr("markerHeight",28).attr("orient","auto").append("path").attr("d","M 18,7 L9,13 L14,7 L9,1 Z")},point:function(t,e){t.append("marker").attr("id",e+"-pointEnd").attr("class","marker "+e).attr("viewBox","0 0 10 10").attr("refX",9).attr("refY",5).attr("markerUnits","userSpaceOnUse").attr("markerWidth",12).attr("markerHeight",12).attr("orient","auto").append("path").attr("d","M 0 0 L 10 5 L 0 10 z").attr("class","arrowMarkerPath").style("stroke-width",1).style("stroke-dasharray","1,0"),t.append("marker").attr("id",e+"-pointStart").attr("class","marker "+e).attr("viewBox","0 0 10 10").attr("refX",0).attr("refY",5).attr("markerUnits","userSpaceOnUse").attr("markerWidth",12).attr("markerHeight",12).attr("orient","auto").append("path").attr("d","M 0 5 L 10 10 L 10 0 z").attr("class","arrowMarkerPath").style("stroke-width",1).style("stroke-dasharray","1,0")},circle:function(t,e){t.append("marker").attr("id",e+"-circleEnd").attr("class","marker "+e).attr("viewBox","0 0 10 10").attr("refX",11).attr("refY",5).attr("markerUnits","userSpaceOnUse").attr("markerWidth",11).attr("markerHeight",11).attr("orient","auto").append("circle").attr("cx","5").attr("cy","5").attr("r","5").attr("class","arrowMarkerPath").style("stroke-width",1).style("stroke-dasharray","1,0"),t.append("marker").attr("id",e+"-circleStart").attr("class","marker "+e).attr("viewBox","0 0 10 10").attr("refX",-1).attr("refY",5).attr("markerUnits","userSpaceOnUse").attr("markerWidth",11).attr("markerHeight",11).attr("orient","auto").append("circle").attr("cx","5").attr("cy","5").attr("r","5").attr("class","arrowMarkerPath").style("stroke-width",1).style("stroke-dasharray","1,0")},cross:function(t,e){t.append("marker").attr("id",e+"-crossEnd").attr("class","marker cross "+e).attr("viewBox","0 0 11 11").attr("refX",12).attr("refY",5.2).attr("markerUnits","userSpaceOnUse").attr("markerWidth",11).attr("markerHeight",11).attr("orient","auto").append("path").attr("d","M 1,1 l 9,9 M 10,1 l -9,9").attr("class","arrowMarkerPath").style("stroke-width",2).style("stroke-dasharray","1,0"),t.append("marker").attr("id",e+"-crossStart").attr("class","marker cross "+e).attr("viewBox","0 0 11 11").attr("refX",-1).attr("refY",5.2).attr("markerUnits","userSpaceOnUse").attr("markerWidth",11).attr("markerHeight",11).attr("orient","auto").append("path").attr("d","M 1,1 l 9,9 M 10,1 l -9,9").attr("class","arrowMarkerPath").style("stroke-width",2).style("stroke-dasharray","1,0")},barb:function(t,e){t.append("defs").append("marker").attr("id",e+"-barbEnd").attr("refX",19).attr("refY",7).attr("markerWidth",20).attr("markerHeight",14).attr("markerUnits","strokeWidth").attr("orient","auto").append("path").attr("d","M 19,7 L9,13 L14,7 L9,1 Z")}},Ee=function(t,e,n,r){e.forEach((function(e){we[e](t,n,r)}))};var Te=function(t,e,n,r){var i=t||"";if(_t().flowchart.htmlLabels)return i=i.replace(/\\n|\n/g,"<br />"),c.info("vertexText"+i),function(t){var e,n,r=Object(d.select)(document.createElementNS("http://www.w3.org/2000/svg","foreignObject")),i=r.append("xhtml:div"),a=t.label,o=t.isNode?"nodeLabel":"edgeLabel";return i.html('<span class="'+o+'">'+a+"</span>"),e=i,(n=t.labelStyle)&&e.attr("style",n),i.style("display","inline-block"),i.style("white-space","nowrap"),i.attr("xmlns","http://www.w3.org/1999/xhtml"),r.node()}({isNode:r,label:i.replace(/fa[lrsb]?:fa-[\w-]+/g,(function(t){return"<i class='".concat(t.replace(":"," "),"'></i>")})),labelStyle:e.replace("fill:","color:")});var a=document.createElementNS("http://www.w3.org/2000/svg","text");a.setAttribute("style",e.replace("color:","fill:"));var o=[];o="string"==typeof i?i.split(/\\n|\n|<br\s*\/?>/gi):Array.isArray(i)?i:[];for(var s=0;s<o.length;s++){var u=document.createElementNS("http://www.w3.org/2000/svg","tspan");u.setAttributeNS("http://www.w3.org/XML/1998/namespace","xml:space","preserve"),u.setAttribute("dy","1em"),u.setAttribute("x","0"),n?u.setAttribute("class","title-row"):u.setAttribute("class","row"),u.textContent=o[s].trim(),a.appendChild(u)}return a},Ce=function(t,e,n,r){var i;i=n||"node default";var a=t.insert("g").attr("class",i).attr("id",e.domId||e.id),o=a.insert("g").attr("class","label").attr("style",e.labelStyle),s=o.node().appendChild(Te(e.labelText,e.labelStyle,!1,r)),c=s.getBBox();if(_t().flowchart.htmlLabels){var u=s.children[0],l=Object(d.select)(s);c=u.getBoundingClientRect(),l.attr("width",c.width),l.attr("height",c.height)}var h=e.padding/2;return o.attr("transform","translate("+-c.width/2+", "+-c.height/2+")"),{shapeSvg:a,bbox:c,halfPadding:h,label:o}},Ae=function(t,e){var n=e.node().getBBox();t.width=n.width,t.height=n.height};function Se(t,e,n,r){return t.insert("polygon",":first-child").attr("points",r.map((function(t){return t.x+","+t.y})).join(" ")).attr("class","label-container").attr("transform","translate("+-e/2+","+n/2+")")}var Me={},Oe={},De={},Ne=function(t,e){return c.debug("In isDecendant",e," ",t," = ",Oe[e].indexOf(t)>=0),Oe[e].indexOf(t)>=0},Be=function t(e,n,r,i){c.warn("Copying children of ",e,"root",i,"data",n.node(e),i);var a=n.children(e)||[];e!==i&&a.push(e),c.warn("Copying (nodes) clusterId",e,"nodes",a),a.forEach((function(a){if(n.children(a).length>0)t(a,n,r,i);else{var o=n.node(a);c.info("cp ",a," to ",i," with parent ",e),r.setNode(a,o),i!==n.parent(a)&&(c.warn("Setting parent",a,n.parent(a)),r.setParent(a,n.parent(a))),e!==i&&a!==e?(c.debug("Setting parent",a,e),r.setParent(a,e)):(c.info("In copy ",e,"root",i,"data",n.node(e),i),c.debug("Not Setting parent for node=",a,"cluster!==rootId",e!==i,"node!==clusterId",a!==e));var s=n.edges(a);c.debug("Copying Edges",s),s.forEach((function(t){c.info("Edge",t);var a=n.edge(t.v,t.w,t.name);c.info("Edge data",a,i);try{!function(t,e){return c.info("Decendants of ",e," is ",Oe[e]),c.info("Edge is ",t),t.v!==e&&(t.w!==e&&(Oe[e]?(c.info("Here "),Oe[e].indexOf(t.v)>=0||(!!Ne(t.v,e)||(!!Ne(t.w,e)||Oe[e].indexOf(t.w)>=0))):(c.debug("Tilt, ",e,",not in decendants"),!1)))}(t,i)?c.info("Skipping copy of edge ",t.v,"--\x3e",t.w," rootId: ",i," clusterId:",e):(c.info("Copying as ",t.v,t.w,a,t.name),r.setEdge(t.v,t.w,a,t.name),c.info("newGraph edges ",r.edges(),r.edge(r.edges()[0])))}catch(t){c.error(t)}}))}c.debug("Removing node",a),n.removeNode(a)}))},Le=function t(e,n){c.trace("Searching",e);var r=n.children(e);if(c.trace("Searching children of id ",e,r),r.length<1)return c.trace("This is a valid node",e),e;for(var i=0;i<r.length;i++){var a=t(r[i],n);if(a)return c.trace("Found replacement for",e," => ",a),a}},Pe=function(t){return Me[t]&&Me[t].externalConnections&&Me[t]?Me[t].id:t},Ie=function(t,e){!t||e>10?c.debug("Opting out, no graph "):(c.debug("Opting in, graph "),t.nodes().forEach((function(e){t.children(e).length>0&&(c.warn("Cluster identified",e," Replacement id in edges: ",Le(e,t)),Oe[e]=function t(e,n){for(var r=n.children(e),i=[].concat(r),a=0;a<r.length;a++)De[r[a]]=e,i=i.concat(t(r[a],n));return i}(e,t),Me[e]={id:Le(e,t),clusterData:t.node(e)})})),t.nodes().forEach((function(e){var n=t.children(e),r=t.edges();n.length>0?(c.debug("Cluster identified",e,Oe),r.forEach((function(t){t.v!==e&&t.w!==e&&(Ne(t.v,e)^Ne(t.w,e)&&(c.warn("Edge: ",t," leaves cluster ",e),c.warn("Decendants of XXX ",e,": ",Oe[e]),Me[e].externalConnections=!0))}))):c.debug("Not a cluster ",e,Oe)})),t.edges().forEach((function(e){var n=t.edge(e);c.warn("Edge "+e.v+" -> "+e.w+": "+JSON.stringify(e)),c.warn("Edge "+e.v+" -> "+e.w+": "+JSON.stringify(t.edge(e)));var r=e.v,i=e.w;c.warn("Fix XXX",Me,"ids:",e.v,e.w,"Translateing: ",Me[e.v]," --- ",Me[e.w]),(Me[e.v]||Me[e.w])&&(c.warn("Fixing and trixing - removing XXX",e.v,e.w,e.name),r=Pe(e.v),i=Pe(e.w),t.removeEdge(e.v,e.w,e.name),r!==e.v&&(n.fromCluster=e.v),i!==e.w&&(n.toCluster=e.w),c.warn("Fix Replacing with XXX",r,i,e.name),t.setEdge(r,i,n,e.name))})),c.warn("Adjusted Graph",G.a.json.write(t)),Fe(t,0),c.trace(Me))},Fe=function t(e,n){if(c.warn("extractor - ",n,G.a.json.write(e),e.children("D")),n>10)c.error("Bailing out");else{for(var r=e.nodes(),i=!1,a=0;a<r.length;a++){var o=r[a],s=e.children(o);i=i||s.length>0}if(i){c.debug("Nodes = ",r,n);for(var u=0;u<r.length;u++){var l=r[u];if(c.debug("Extracting node",l,Me,Me[l]&&!Me[l].externalConnections,!e.parent(l),e.node(l),e.children("D")," Depth ",n),Me[l])if(!Me[l].externalConnections&&e.children(l)&&e.children(l).length>0){c.warn("Cluster without external connections, without a parent and with children",l,n);var h=e.graph(),f=new G.a.Graph({multigraph:!0,compound:!0}).setGraph({rankdir:"TB"===h.rankdir?"LR":"TB",nodesep:50,ranksep:50,marginx:8,marginy:8}).setDefaultEdgeLabel((function(){return{}}));c.warn("Old graph before copy",G.a.json.write(e)),Be(l,e,f,l),e.setNode(l,{clusterNode:!0,id:l,clusterData:Me[l].clusterData,labelText:Me[l].labelText,graph:f}),c.warn("New graph after copy node: (",l,")",G.a.json.write(f)),c.debug("Old graph after copy",G.a.json.write(e))}else c.warn("Cluster ** ",l," **not meeting the criteria !externalConnections:",!Me[l].externalConnections," no parent: ",!e.parent(l)," children ",e.children(l)&&e.children(l).length>0,e.children("D"),n),c.debug(Me);else c.debug("Not a cluster",l,n)}r=e.nodes(),c.warn("New list of nodes",r);for(var d=0;d<r.length;d++){var p=r[d],g=e.node(p);c.warn(" Now next level",p,g),g.clusterNode&&t(g.graph,n+1)}}else c.debug("Done, no node has children",e.nodes())}},je=function(t){return function t(e,n){if(0===n.length)return[];var r=Object.assign(n);return n.forEach((function(n){var i=e.children(n),a=t(e,i);r=r.concat(a)})),r}(t,t.children())},Re=n(170);var Ye=function(t,e,n,r){var i=t.x,a=t.y,o=i-r.x,s=a-r.y,c=Math.sqrt(e*e*s*s+n*n*o*o),u=Math.abs(e*n*o/c);r.x<i&&(u=-u);var l=Math.abs(e*n*s/c);return r.y<a&&(l=-l),{x:i+u,y:a+l}};var ze=function(t,e,n){return Ye(t,e,e,n)};function Ue(t,e){return t*e>0}var $e=function(t,e,n,r){var i,a,o,s,c,u,l,h,f,d,p,g,y;if(i=e.y-t.y,o=t.x-e.x,c=e.x*t.y-t.x*e.y,f=i*n.x+o*n.y+c,d=i*r.x+o*r.y+c,!(0!==f&&0!==d&&Ue(f,d)||(a=r.y-n.y,s=n.x-r.x,u=r.x*n.y-n.x*r.y,l=a*t.x+s*t.y+u,h=a*e.x+s*e.y+u,0!==l&&0!==h&&Ue(l,h)||0==(p=i*s-a*o))))return g=Math.abs(p/2),{x:(y=o*u-s*c)<0?(y-g)/p:(y+g)/p,y:(y=a*c-i*u)<0?(y-g)/p:(y+g)/p}},We=function(t,e,n){var r=t.x,i=t.y,a=[],o=Number.POSITIVE_INFINITY,s=Number.POSITIVE_INFINITY;"function"==typeof e.forEach?e.forEach((function(t){o=Math.min(o,t.x),s=Math.min(s,t.y)})):(o=Math.min(o,e.x),s=Math.min(s,e.y));for(var c=r-t.width/2-o,u=i-t.height/2-s,l=0;l<e.length;l++){var h=e[l],f=e[l<e.length-1?l+1:0],d=$e(t,n,{x:c+h.x,y:u+h.y},{x:c+f.x,y:u+f.y});d&&a.push(d)}if(!a.length)return t;a.length>1&&a.sort((function(t,e){var r=t.x-n.x,i=t.y-n.y,a=Math.sqrt(r*r+i*i),o=e.x-n.x,s=e.y-n.y,c=Math.sqrt(o*o+s*s);return a<c?-1:a===c?0:1}));return a[0]};var He=function(t,e){var n,r,i=t.x,a=t.y,o=e.x-i,s=e.y-a,c=t.width/2,u=t.height/2;return Math.abs(s)*c>Math.abs(o)*u?(s<0&&(u=-u),n=0===s?0:u*o/s,r=u):(o<0&&(c=-c),n=c,r=0===o?0:c*s/o),{x:i+n,y:a+r}},Ve={node:n.n(Re).a,circle:ze,ellipse:Ye,polygon:We,rect:He},Ge=function(t,e){var n=Ce(t,e,"node "+e.classes,!0),r=n.shapeSvg,i=n.bbox,a=n.halfPadding;c.info("Classes = ",e.classes);var o=r.insert("rect",":first-child");return o.attr("rx",e.rx).attr("ry",e.ry).attr("x",-i.width/2-a).attr("y",-i.height/2-a).attr("width",i.width+e.padding).attr("height",i.height+e.padding),Ae(e,o),e.intersect=function(t){return Ve.rect(e,t)},r};function qe(t){return function(t){if(Array.isArray(t)){for(var e=0,n=new Array(t.length);e<t.length;e++)n[e]=t[e];return n}}(t)||function(t){if(Symbol.iterator in Object(t)||"[object Arguments]"===Object.prototype.toString.call(t))return Array.from(t)}(t)||function(){throw new TypeError("Invalid attempt to spread non-iterable instance")}()}var Xe=[],Ze={},Je=0,Ke=[],Qe=function(t){var e="",n=t;if(t.indexOf("~")>0){var r=t.split("~");n=r[0],e=r[1]}return{className:n,type:e}},tn=function(t){var e=Qe(t);void 0===Ze[e.className]&&(Ze[e.className]={id:e.className,type:e.type,cssClasses:[],methods:[],members:[],annotations:[],domId:"classid-"+e.className+"-"+Je},Je++)},en=function(t){for(var e=Object.keys(Ze),n=0;n<e.length;n++)if(Ze[e[n]].id===t)return Ze[e[n]].domId},nn=function(t,e){var n=Qe(t).className,r=Ze[n];if("string"==typeof e){var i=e.trim();i.startsWith("<<")&&i.endsWith(">>")?r.annotations.push(i.substring(2,i.length-2)):i.indexOf(")")>0?r.methods.push(i):i&&r.members.push(i)}},rn=function(t,e){t.split(",").forEach((function(t){var n=t;t[0].match(/\d/)&&(n="classid-"+n),void 0!==Ze[n]&&Ze[n].cssClasses.push(e)}))},an=function(t,e,n){var r=_t(),i=t,a=en(i);if("loose"===r.securityLevel&&void 0!==e&&void 0!==Ze[i]){var o=[];if("string"==typeof n){o=n.split(/,(?=(?:(?:[^"]*"){2})*[^"]*$)/);for(var s=0;s<o.length;s++){var c=o[s].trim();'"'===c.charAt(0)&&'"'===c.charAt(c.length-1)&&(c=c.substr(1,c.length-2)),o[s]=c}}0===o.length&&o.push(a),Ke.push((function(){var t=document.querySelector('[id="'.concat(a,'"]'));null!==t&&t.addEventListener("click",(function(){H.runFunc.apply(H,[e].concat(qe(o)))}),!1)}))}},on={AGGREGATION:0,EXTENSION:1,COMPOSITION:2,DEPENDENCY:3},sn=function(t){var e=Object(d.select)(".mermaidTooltip");null===(e._groups||e)[0][0]&&(e=Object(d.select)("body").append("div").attr("class","mermaidTooltip").style("opacity",0)),Object(d.select)(t).select("svg").selectAll("g.node").on("mouseover",(function(){var t=Object(d.select)(this);if(null!==t.attr("title")){var n=this.getBoundingClientRect();e.transition().duration(200).style("opacity",".9"),e.html(t.attr("title")).style("left",window.scrollX+n.left+(n.right-n.left)/2+"px").style("top",window.scrollY+n.top-14+document.body.scrollTop+"px"),t.classed("hover",!0)}})).on("mouseout",(function(){e.transition().duration(500).style("opacity",0),Object(d.select)(this).classed("hover",!1)}))};Ke.push(sn);var cn={parseDirective:function(t,e,n){Go.parseDirective(this,t,e,n)},getConfig:function(){return _t().class},addClass:tn,bindFunctions:function(t){Ke.forEach((function(e){e(t)}))},clear:function(){Xe=[],Ze={},(Ke=[]).push(sn)},getClass:function(t){return Ze[t]},getClasses:function(){return Ze},addAnnotation:function(t,e){var n=Qe(t).className;Ze[n].annotations.push(e)},getRelations:function(){return Xe},addRelation:function(t){c.debug("Adding relation: "+JSON.stringify(t)),tn(t.id1),tn(t.id2),t.id1=Qe(t.id1).className,t.id2=Qe(t.id2).className,Xe.push(t)},addMember:nn,addMembers:function(t,e){Array.isArray(e)&&(e.reverse(),e.forEach((function(e){return nn(t,e)})))},cleanupLabel:function(t){return":"===t.substring(0,1)?t.substr(1).trim():t.trim()},lineType:{LINE:0,DOTTED_LINE:1},relationType:on,setClickEvent:function(t,e,n){t.split(",").forEach((function(t){an(t,e,n),Ze[t].haveCallback=!0})),rn(t,"clickable")},setCssClass:rn,setLink:function(t,e,n){var r=_t();t.split(",").forEach((function(t){var i=t;t[0].match(/\d/)&&(i="classid-"+i),void 0!==Ze[i]&&(Ze[i].link=H.formatUrl(e,r),Ze[i].linkTarget="string"==typeof n?n:"_blank")})),rn(t,"clickable")},setTooltip:function(t,e){var n=_t();t.split(",").forEach((function(t){void 0!==e&&(Ze[t].tooltip=x.sanitizeText(e,n))}))},lookUpDomId:en},un=0,ln=function(t){var e=t.match(/(\+|-|~|#)?(\w+)(~\w+~|\[\])?\s+(\w+)/),n=t.match(/^([+|\-|~|#])?(\w+) *\( *(.*)\) *(\*|\$)? *(\w*[~|[\]]*\s*\w*~?)$/);return e&&!n?hn(e):n?fn(n):dn(t)},hn=function(t){var e="";try{e=(t[1]?t[1].trim():"")+(t[2]?t[2].trim():"")+(t[3]?gn(t[3].trim()):"")+" "+(t[4]?t[4].trim():"")}catch(n){e=t}return{displayText:e,cssStyle:""}},fn=function(t){var e="",n="";try{var r=t[1]?t[1].trim():"",i=t[2]?t[2].trim():"",a=t[3]?gn(t[3].trim()):"",o=t[4]?t[4].trim():"";n=r+i+"("+a+")"+(t[5]?" : "+gn(t[5]).trim():""),e=yn(o)}catch(e){n=t}return{displayText:n,cssStyle:e}},dn=function(t){var e="",n="",r="",i=t.indexOf("("),a=t.indexOf(")");if(i>1&&a>i&&a<=t.length){var o="",s="",c=t.substring(0,1);c.match(/\w/)?s=t.substring(0,i).trim():(c.match(/\+|-|~|#/)&&(o=c),s=t.substring(1,i).trim());var u=t.substring(i+1,a),l=t.substring(a+1,1);n=yn(l),e=o+s+"("+gn(u.trim())+")",a<"".length&&""!==(r=t.substring(a+2).trim())&&(r=" : "+gn(r))}else e=gn(t);return{displayText:e,cssStyle:n}},pn=function(t,e,n,r){var i=ln(e),a=t.append("tspan").attr("x",r.padding).text(i.displayText);""!==i.cssStyle&&a.attr("style",i.cssStyle),n||a.attr("dy",r.textHeight)},gn=function t(e){var n=e;return-1!=e.indexOf("~")?t(n=(n=n.replace("~","<")).replace("~",">")):n},yn=function(t){switch(t){case"*":return"font-style:italic;";case"$":return"text-decoration:underline;";default:return""}},vn=function(t,e,n){c.info("Rendering class "+e);var r,i=e.id,a={id:i,label:e.id,width:0,height:0},o=t.append("g").attr("id",en(i)).attr("class","classGroup");r=e.link?o.append("svg:a").attr("xlink:href",e.link).attr("target",e.linkTarget).append("text").attr("y",n.textHeight+n.padding).attr("x",0):o.append("text").attr("y",n.textHeight+n.padding).attr("x",0);var s=!0;e.annotations.forEach((function(t){var e=r.append("tspan").text("«"+t+"»");s||e.attr("dy",n.textHeight),s=!1}));var u=e.id;void 0!==e.type&&""!==e.type&&(u+="<"+e.type+">");var l=r.append("tspan").text(u).attr("class","title");s||l.attr("dy",n.textHeight);var h=r.node().getBBox().height,f=o.append("line").attr("x1",0).attr("y1",n.padding+h+n.dividerMargin/2).attr("y2",n.padding+h+n.dividerMargin/2),d=o.append("text").attr("x",n.padding).attr("y",h+n.dividerMargin+n.textHeight).attr("fill","white").attr("class","classText");s=!0,e.members.forEach((function(t){pn(d,t,s,n),s=!1}));var p=d.node().getBBox(),g=o.append("line").attr("x1",0).attr("y1",n.padding+h+n.dividerMargin+p.height).attr("y2",n.padding+h+n.dividerMargin+p.height),y=o.append("text").attr("x",n.padding).attr("y",h+2*n.dividerMargin+p.height+n.textHeight).attr("fill","white").attr("class","classText");s=!0,e.methods.forEach((function(t){pn(y,t,s,n),s=!1}));var v=o.node().getBBox(),m=" ";e.cssClasses.length>0&&(m+=e.cssClasses.join(" "));var b=o.insert("rect",":first-child").attr("x",0).attr("y",0).attr("width",v.width+2*n.padding).attr("height",v.height+n.padding+.5*n.dividerMargin).attr("class",m).node().getBBox().width;return r.node().childNodes.forEach((function(t){t.setAttribute("x",(b-t.getBBox().width)/2)})),e.tooltip&&r.insert("title").text(e.tooltip),f.attr("x2",b),g.attr("x2",b),a.width=b,a.height=v.height+n.padding+.5*n.dividerMargin,a},mn=function(t,e,n,r){var i=function(t){switch(t){case on.AGGREGATION:return"aggregation";case on.EXTENSION:return"extension";case on.COMPOSITION:return"composition";case on.DEPENDENCY:return"dependency"}};e.points=e.points.filter((function(t){return!Number.isNaN(t.y)}));var a,o,s=e.points,u=Object(d.line)().x((function(t){return t.x})).y((function(t){return t.y})).curve(d.curveBasis),l=t.append("path").attr("d",u(s)).attr("id","edge"+un).attr("class","relation"),h="";r.arrowMarkerAbsolute&&(h=(h=(h=window.location.protocol+"//"+window.location.host+window.location.pathname+window.location.search).replace(/\(/g,"\\(")).replace(/\)/g,"\\)")),1==n.relation.lineType&&l.attr("class","relation dashed-line"),"none"!==n.relation.type1&&l.attr("marker-start","url("+h+"#"+i(n.relation.type1)+"Start)"),"none"!==n.relation.type2&&l.attr("marker-end","url("+h+"#"+i(n.relation.type2)+"End)");var f,p,g,y,v=e.points.length,m=H.calcLabelPosition(e.points);if(a=m.x,o=m.y,v%2!=0&&v>1){var b=H.calcCardinalityPosition("none"!==n.relation.type1,e.points,e.points[0]),x=H.calcCardinalityPosition("none"!==n.relation.type2,e.points,e.points[v-1]);c.debug("cardinality_1_point "+JSON.stringify(b)),c.debug("cardinality_2_point "+JSON.stringify(x)),f=b.x,p=b.y,g=x.x,y=x.y}if(void 0!==n.title){var _=t.append("g").attr("class","classLabel"),k=_.append("text").attr("class","label").attr("x",a).attr("y",o).attr("fill","red").attr("text-anchor","middle").text(n.title);window.label=k;var w=k.node().getBBox();_.insert("rect",":first-child").attr("class","box").attr("x",w.x-r.padding/2).attr("y",w.y-r.padding/2).attr("width",w.width+r.padding).attr("height",w.height+r.padding)}(c.info("Rendering relation "+JSON.stringify(n)),void 0!==n.relationTitle1&&"none"!==n.relationTitle1)&&t.append("g").attr("class","cardinality").append("text").attr("class","type1").attr("x",f).attr("y",p).attr("fill","black").attr("font-size","6").text(n.relationTitle1);void 0!==n.relationTitle2&&"none"!==n.relationTitle2&&t.append("g").attr("class","cardinality").append("text").attr("class","type2").attr("x",g).attr("y",y).attr("fill","black").attr("font-size","6").text(n.relationTitle2);un++},bn=function(t,e,n){var r=t.insert("g").attr("class","node default").attr("id",e.domId||e.id),i=70,a=10;"LR"===n&&(i=10,a=70);var o=r.append("rect").style("stroke","black").style("fill","black").attr("x",-1*i/2).attr("y",-1*a/2).attr("width",i).attr("height",a).attr("class","fork-join");return Ae(e,o),e.height=e.height+e.padding/2,e.width=e.width+e.padding/2,e.intersect=function(t){return Ve.rect(e,t)},r},xn={question:function(t,e){var n=Ce(t,e,void 0,!0),r=n.shapeSvg,i=n.bbox,a=i.width+e.padding+(i.height+e.padding),o=[{x:a/2,y:0},{x:a,y:-a/2},{x:a/2,y:-a},{x:0,y:-a/2}];c.info("Question main (Circle)");var s=Se(r,a,a,o);return Ae(e,s),e.intersect=function(t){return c.warn("Intersect called"),Ve.polygon(e,o,t)},r},rect:function(t,e){var n=Ce(t,e,"node "+e.classes,!0),r=n.shapeSvg,i=n.bbox,a=n.halfPadding;c.trace("Classes = ",e.classes);var o=r.insert("rect",":first-child");return o.attr("class","basic label-container").attr("style",e.style).attr("rx",e.rx).attr("ry",e.ry).attr("x",-i.width/2-a).attr("y",-i.height/2-a).attr("width",i.width+e.padding).attr("height",i.height+e.padding),Ae(e,o),e.intersect=function(t){return Ve.rect(e,t)},r},rectWithTitle:function(t,e){var n;n=e.classes?"node "+e.classes:"node default";var r=t.insert("g").attr("class",n).attr("id",e.domId||e.id),i=r.insert("rect",":first-child"),a=r.insert("line"),o=r.insert("g").attr("class","label"),s=e.labelText.flat();c.info("Label text",s[0]);var u,l=o.node().appendChild(Te(s[0],e.labelStyle,!0,!0));if(_t().flowchart.htmlLabels){var h=l.children[0],f=Object(d.select)(l);u=h.getBoundingClientRect(),f.attr("width",u.width),f.attr("height",u.height)}c.info("Text 2",s);var p=s.slice(1,s.length),g=l.getBBox(),y=o.node().appendChild(Te(p.join("<br/>"),e.labelStyle,!0,!0));if(_t().flowchart.htmlLabels){var v=y.children[0],m=Object(d.select)(y);u=v.getBoundingClientRect(),m.attr("width",u.width),m.attr("height",u.height)}var b=e.padding/2;return Object(d.select)(y).attr("transform","translate( "+(u.width>g.width?0:(g.width-u.width)/2)+", "+(g.height+b+5)+")"),Object(d.select)(l).attr("transform","translate( "+(u.width<g.width?0:-(g.width-u.width)/2)+", 0)"),u=o.node().getBBox(),o.attr("transform","translate("+-u.width/2+", "+(-u.height/2-b+3)+")"),i.attr("class","outer title-state").attr("x",-u.width/2-b).attr("y",-u.height/2-b).attr("width",u.width+e.padding).attr("height",u.height+e.padding),a.attr("class","divider").attr("x1",-u.width/2-b).attr("x2",u.width/2+b).attr("y1",-u.height/2-b+g.height+b).attr("y2",-u.height/2-b+g.height+b),Ae(e,i),e.intersect=function(t){return Ve.rect(e,t)},r},circle:function(t,e){var n=Ce(t,e,void 0,!0),r=n.shapeSvg,i=n.bbox,a=n.halfPadding,o=r.insert("circle",":first-child");return o.attr("rx",e.rx).attr("ry",e.ry).attr("r",i.width/2+a).attr("width",i.width+e.padding).attr("height",i.height+e.padding),c.info("Circle main"),Ae(e,o),e.intersect=function(t){return c.info("Circle intersect",e,i.width/2+a,t),Ve.circle(e,i.width/2+a,t)},r},stadium:function(t,e){var n=Ce(t,e,void 0,!0),r=n.shapeSvg,i=n.bbox,a=i.height+e.padding,o=i.width+a/4+e.padding,s=r.insert("rect",":first-child").attr("rx",a/2).attr("ry",a/2).attr("x",-o/2).attr("y",-a/2).attr("width",o).attr("height",a);return Ae(e,s),e.intersect=function(t){return Ve.rect(e,t)},r},hexagon:function(t,e){var n=Ce(t,e,void 0,!0),r=n.shapeSvg,i=n.bbox,a=i.height+e.padding,o=a/4,s=i.width+2*o+e.padding,c=Se(r,s,a,[{x:o,y:0},{x:s-o,y:0},{x:s,y:-a/2},{x:s-o,y:-a},{x:o,y:-a},{x:0,y:-a/2}]);return Ae(e,c),e.intersect=function(t){return Ve.polygon(e,t)},r},rect_left_inv_arrow:function(t,e){var n=Ce(t,e,void 0,!0),r=n.shapeSvg,i=n.bbox,a=i.width+e.padding,o=i.height+e.padding,s=Se(r,a,o,[{x:-o/2,y:0},{x:a,y:0},{x:a,y:-o},{x:-o/2,y:-o},{x:0,y:-o/2}]);return Ae(e,s),e.intersect=function(t){return Ve.polygon(e,t)},r},lean_right:function(t,e){var n=Ce(t,e,void 0,!0),r=n.shapeSvg,i=n.bbox,a=i.width+e.padding,o=i.height+e.padding,s=Se(r,a,o,[{x:-2*o/6,y:0},{x:a-o/6,y:0},{x:a+2*o/6,y:-o},{x:o/6,y:-o}]);return Ae(e,s),e.intersect=function(t){return Ve.polygon(e,t)},r},lean_left:function(t,e){var n=Ce(t,e,void 0,!0),r=n.shapeSvg,i=n.bbox,a=i.width+e.padding,o=i.height+e.padding,s=Se(r,a,o,[{x:2*o/6,y:0},{x:a+o/6,y:0},{x:a-2*o/6,y:-o},{x:-o/6,y:-o}]);return Ae(e,s),e.intersect=function(t){return Ve.polygon(e,t)},r},trapezoid:function(t,e){var n=Ce(t,e,void 0,!0),r=n.shapeSvg,i=n.bbox,a=i.width+e.padding,o=i.height+e.padding,s=Se(r,a,o,[{x:-2*o/6,y:0},{x:a+2*o/6,y:0},{x:a-o/6,y:-o},{x:o/6,y:-o}]);return Ae(e,s),e.intersect=function(t){return Ve.polygon(e,t)},r},inv_trapezoid:function(t,e){var n=Ce(t,e,void 0,!0),r=n.shapeSvg,i=n.bbox,a=i.width+e.padding,o=i.height+e.padding,s=Se(r,a,o,[{x:o/6,y:0},{x:a-o/6,y:0},{x:a+2*o/6,y:-o},{x:-2*o/6,y:-o}]);return Ae(e,s),e.intersect=function(t){return Ve.polygon(e,t)},r},rect_right_inv_arrow:function(t,e){var n=Ce(t,e,void 0,!0),r=n.shapeSvg,i=n.bbox,a=i.width+e.padding,o=i.height+e.padding,s=Se(r,a,o,[{x:0,y:0},{x:a+o/2,y:0},{x:a,y:-o/2},{x:a+o/2,y:-o},{x:0,y:-o}]);return Ae(e,s),e.intersect=function(t){return Ve.polygon(e,t)},r},cylinder:function(t,e){var n=Ce(t,e,void 0,!0),r=n.shapeSvg,i=n.bbox,a=i.width+e.padding,o=a/2,s=o/(2.5+a/50),c=i.height+s+e.padding,u="M 0,"+s+" a "+o+","+s+" 0,0,0 "+a+" 0 a "+o+","+s+" 0,0,0 "+-a+" 0 l 0,"+c+" a "+o+","+s+" 0,0,0 "+a+" 0 l 0,"+-c,l=r.attr("label-offset-y",s).insert("path",":first-child").attr("d",u).attr("transform","translate("+-a/2+","+-(c/2+s)+")");return Ae(e,l),e.intersect=function(t){var n=Ve.rect(e,t),r=n.x-e.x;if(0!=o&&(Math.abs(r)<e.width/2||Math.abs(r)==e.width/2&&Math.abs(n.y-e.y)>e.height/2-s)){var i=s*s*(1-r*r/(o*o));0!=i&&(i=Math.sqrt(i)),i=s-i,t.y-e.y>0&&(i=-i),n.y+=i}return n},r},start:function(t,e){var n=t.insert("g").attr("class","node default").attr("id",e.domId||e.id),r=n.insert("circle",":first-child");return r.attr("class","state-start").attr("r",7).attr("width",14).attr("height",14),Ae(e,r),e.intersect=function(t){return Ve.circle(e,7,t)},n},end:function(t,e){var n=t.insert("g").attr("class","node default").attr("id",e.domId||e.id),r=n.insert("circle",":first-child"),i=n.insert("circle",":first-child");return i.attr("class","state-start").attr("r",7).attr("width",14).attr("height",14),r.attr("class","state-end").attr("r",5).attr("width",10).attr("height",10),Ae(e,i),e.intersect=function(t){return Ve.circle(e,7,t)},n},note:Ge,subroutine:function(t,e){var n=Ce(t,e,void 0,!0),r=n.shapeSvg,i=n.bbox,a=i.width+e.padding,o=i.height+e.padding,s=Se(r,a,o,[{x:0,y:0},{x:a,y:0},{x:a,y:-o},{x:0,y:-o},{x:0,y:0},{x:-8,y:0},{x:a+8,y:0},{x:a+8,y:-o},{x:-8,y:-o},{x:-8,y:0}]);return Ae(e,s),e.intersect=function(t){return Ve.polygon(e,t)},r},fork:bn,join:bn,class_box:function(t,e){var n,r=e.padding/2;n=e.classes?"node "+e.classes:"node default";var i=t.insert("g").attr("class",n).attr("id",e.domId||e.id),a=i.insert("rect",":first-child"),o=i.insert("line"),s=i.insert("line"),c=0,u=4,l=i.insert("g").attr("class","label"),h=0,f=e.classData.annotations&&e.classData.annotations[0],p=e.classData.annotations[0]?"«"+e.classData.annotations[0]+"»":"",g=l.node().appendChild(Te(p,e.labelStyle,!0,!0)),y=g.getBBox();if(_t().flowchart.htmlLabels){var v=g.children[0],m=Object(d.select)(g);y=v.getBoundingClientRect(),m.attr("width",y.width),m.attr("height",y.height)}e.classData.annotations[0]&&(u+=y.height+4,c+=y.width);var b=e.classData.id;void 0!==e.classData.type&&""!==e.classData.type&&(b+="<"+e.classData.type+">");var x=l.node().appendChild(Te(b,e.labelStyle,!0,!0));Object(d.select)(x).attr("class","classTitle");var _=x.getBBox();if(_t().flowchart.htmlLabels){var k=x.children[0],w=Object(d.select)(x);_=k.getBoundingClientRect(),w.attr("width",_.width),w.attr("height",_.height)}u+=_.height+4,_.width>c&&(c=_.width);var E=[];e.classData.members.forEach((function(t){var n=ln(t).displayText,r=l.node().appendChild(Te(n,e.labelStyle,!0,!0)),i=r.getBBox();if(_t().flowchart.htmlLabels){var a=r.children[0],o=Object(d.select)(r);i=a.getBoundingClientRect(),o.attr("width",i.width),o.attr("height",i.height)}i.width>c&&(c=i.width),u+=i.height+4,E.push(r)})),u+=8;var T=[];if(e.classData.methods.forEach((function(t){var n=ln(t).displayText,r=l.node().appendChild(Te(n,e.labelStyle,!0,!0)),i=r.getBBox();if(_t().flowchart.htmlLabels){var a=r.children[0],o=Object(d.select)(r);i=a.getBoundingClientRect(),o.attr("width",i.width),o.attr("height",i.height)}i.width>c&&(c=i.width),u+=i.height+4,T.push(r)})),u+=8,f){var C=(c-y.width)/2;Object(d.select)(g).attr("transform","translate( "+(-1*c/2+C)+", "+-1*u/2+")"),h=y.height+4}var A=(c-_.width)/2;return Object(d.select)(x).attr("transform","translate( "+(-1*c/2+A)+", "+(-1*u/2+h)+")"),h+=_.height+4,o.attr("class","divider").attr("x1",-c/2-r).attr("x2",c/2+r).attr("y1",-u/2-r+8+h).attr("y2",-u/2-r+8+h),h+=8,E.forEach((function(t){Object(d.select)(t).attr("transform","translate( "+-c/2+", "+(-1*u/2+h+4)+")"),h+=_.height+4})),h+=8,s.attr("class","divider").attr("x1",-c/2-r).attr("x2",c/2+r).attr("y1",-u/2-r+8+h).attr("y2",-u/2-r+8+h),h+=8,T.forEach((function(t){Object(d.select)(t).attr("transform","translate( "+-c/2+", "+(-1*u/2+h)+")"),h+=_.height+4})),a.attr("class","outer title-state").attr("x",-c/2-r).attr("y",-u/2-r).attr("width",c+e.padding).attr("height",u+e.padding),Ae(e,a),e.intersect=function(t){return Ve.rect(e,t)},i}},_n={},kn=function(t){var e=_n[t.id];c.trace("Transforming node",t,"translate("+(t.x-t.width/2-5)+", "+(t.y-t.height/2-5)+")");t.clusterNode?e.attr("transform","translate("+(t.x-t.width/2-8)+", "+(t.y-t.height/2-8)+")"):e.attr("transform","translate("+t.x+", "+t.y+")")},wn={rect:function(t,e){c.trace("Creating subgraph rect for ",e.id,e);var n=t.insert("g").attr("class","cluster"+(e.class?" "+e.class:"")).attr("id",e.id),r=n.insert("rect",":first-child"),i=n.insert("g").attr("class","cluster-label"),a=i.node().appendChild(Te(e.labelText,e.labelStyle,void 0,!0)),o=a.getBBox();if(_t().flowchart.htmlLabels){var s=a.children[0],u=Object(d.select)(a);o=s.getBoundingClientRect(),u.attr("width",o.width),u.attr("height",o.height)}var l=0*e.padding,h=l/2;c.trace("Data ",e,JSON.stringify(e)),r.attr("style",e.style).attr("rx",e.rx).attr("ry",e.ry).attr("x",e.x-e.width/2-h).attr("y",e.y-e.height/2-h).attr("width",e.width+l).attr("height",e.height+l),i.attr("transform","translate("+(e.x-o.width/2)+", "+(e.y-e.height/2+e.padding/3)+")");var f=r.node().getBBox();return e.width=f.width,e.height=f.height,e.intersect=function(t){return He(e,t)},n},roundedWithTitle:function(t,e){var n=t.insert("g").attr("class",e.classes).attr("id",e.id),r=n.insert("rect",":first-child"),i=n.insert("g").attr("class","cluster-label"),a=n.append("rect"),o=i.node().appendChild(Te(e.labelText,e.labelStyle,void 0,!0)),s=o.getBBox();if(_t().flowchart.htmlLabels){var c=o.children[0],u=Object(d.select)(o);s=c.getBoundingClientRect(),u.attr("width",s.width),u.attr("height",s.height)}s=o.getBBox();var l=0*e.padding,h=l/2;r.attr("class","outer").attr("x",e.x-e.width/2-h).attr("y",e.y-e.height/2-h).attr("width",e.width+l).attr("height",e.height+l),a.attr("class","inner").attr("x",e.x-e.width/2-h).attr("y",e.y-e.height/2-h+s.height-1).attr("width",e.width+l).attr("height",e.height+l-s.height-3),i.attr("transform","translate("+(e.x-s.width/2)+", "+(e.y-e.height/2-e.padding/3+(_t().flowchart.htmlLabels?5:3))+")");var f=r.node().getBBox();return e.width=f.width,e.height=f.height,e.intersect=function(t){return He(e,t)},n},noteGroup:function(t,e){var n=t.insert("g").attr("class","note-cluster").attr("id",e.id),r=n.insert("rect",":first-child"),i=0*e.padding,a=i/2;r.attr("rx",e.rx).attr("ry",e.ry).attr("x",e.x-e.width/2-a).attr("y",e.y-e.height/2-a).attr("width",e.width+i).attr("height",e.height+i).attr("fill","none");var o=r.node().getBBox();return e.width=o.width,e.height=o.height,e.intersect=function(t){return He(e,t)},n},divider:function(t,e){var n=t.insert("g").attr("class",e.classes).attr("id",e.id),r=n.insert("rect",":first-child"),i=0*e.padding,a=i/2;r.attr("class","divider").attr("x",e.x-e.width/2-a).attr("y",e.y-e.height/2).attr("width",e.width+i).attr("height",e.height+i);var o=r.node().getBBox();return e.width=o.width,e.height=o.height,e.intersect=function(t){return He(e,t)},n}},En={},Tn={},Cn={},An=function(t,e){var n=t.x,r=t.y,i=Math.abs(e.x-n),a=Math.abs(e.y-r),o=t.width/2,s=t.height/2;return i>=o||a>=s},Sn=function(t,e,n){c.warn("intersection calc o:",e," i:",n,t);var r=t.x,i=t.y,a=Math.abs(r-n.x),o=t.width/2,s=n.x<e.x?o-a:o+a,u=t.height/2,l=r-o,h=r+o,f=i-u,d=i+u;if(e.x===l||e.x===h||e.y===f||e.y===d)return c.warn("calc equals on edge"),e;var p=Math.abs(e.y-n.y),g=Math.abs(e.x-n.x);if(Math.abs(i-e.y)*o>Math.abs(r-e.x)*u){var y=n.y<e.y?e.y-u-i:i-u-e.y;s=g*y/p;var v={x:n.x<e.x?n.x+g-s:n.x-s,y:n.y<e.y?n.y+p-y:n.y-y};return c.warn("topp/bott calc, Q ".concat(p,", q ").concat(y,", R ").concat(g,", r ").concat(s),v),v}var m=m=p*(s=n.x<e.x?e.x-o-r:r-o-e.x)/g;return c.warn("sides calc, Q ".concat(p,", q ").concat(m,", R ").concat(g,", r ").concat(s),{x:n.x<e.x?n.x+g-s:n.x+a-o,y:n.y<e.y?n.y+m:n.y-m}),{x:n.x<e.x?n.x+g-s:n.x+a-o,y:n.y<e.y?n.y+m:n.y-m}},Mn=function t(e,n,r,i){c.info("Graph in recursive render: XXX",G.a.json.write(n),i);var a=n.graph().rankdir;c.warn("Dir in recursive render - dir:",a);var o=e.insert("g").attr("class","root");n.nodes()?c.info("Recursive render XXX",n.nodes()):c.info("No nodes found for",n),n.edges().length>0&&c.info("Recursive edges",n.edge(n.edges()[0]));var s=o.insert("g").attr("class","clusters"),u=o.insert("g").attr("class","edgePaths"),l=o.insert("g").attr("class","edgeLabels"),h=o.insert("g").attr("class","nodes");return n.nodes().forEach((function(e){var o=n.node(e);if(void 0!==i){var s=JSON.parse(JSON.stringify(i.clusterData));c.info("Setting data for cluster XXX (",e,") ",s,i),n.setNode(i.id,s),n.parent(e)||(c.warn("Setting parent",e,i.id),n.setParent(e,i.id,s))}if(c.info("(Insert) Node XXX"+e+": "+JSON.stringify(n.node(e))),o&&o.clusterNode){c.info("Cluster identified",e,o,n.node(e));var u=t(h,o.graph,r,n.node(e));Ae(o,u),function(t,e){_n[e.id]=t}(u,o),c.warn("Recursive render complete",u,o)}else n.children(e).length>0?(c.info("Cluster - the non recursive path XXX",e,o.id,o,n),c.info(Le(o.id,n)),Me[o.id]={id:Le(o.id,n),node:o}):(c.info("Node - the non recursive path",e,o.id,o),function(t,e,n){var r,i;e.link?(r=t.insert("svg:a").attr("xlink:href",e.link).attr("target",e.linkTarget||"_blank"),i=xn[e.shape](r,e,n)):r=i=xn[e.shape](t,e,n),e.tooltip&&i.attr("title",e.tooltip),e.class&&i.attr("class","node default "+e.class),_n[e.id]=r,e.haveCallback&&_n[e.id].attr("class",_n[e.id].attr("class")+" clickable")}(h,n.node(e),a))})),n.edges().forEach((function(t){var e=n.edge(t.v,t.w,t.name);c.info("Edge "+t.v+" -> "+t.w+": "+JSON.stringify(t)),c.info("Edge "+t.v+" -> "+t.w+": ",t," ",JSON.stringify(n.edge(t))),c.info("Fix",Me,"ids:",t.v,t.w,"Translateing: ",Me[t.v],Me[t.w]),function(t,e){var n=Te(e.label,e.labelStyle),r=t.insert("g").attr("class","edgeLabel"),i=r.insert("g").attr("class","label");i.node().appendChild(n);var a=n.getBBox();if(_t().flowchart.htmlLabels){var o=n.children[0],s=Object(d.select)(n);a=o.getBoundingClientRect(),s.attr("width",a.width),s.attr("height",a.height)}if(i.attr("transform","translate("+-a.width/2+", "+-a.height/2+")"),Tn[e.id]=r,e.width=a.width,e.height=a.height,e.startLabelLeft){var c=Te(e.startLabelLeft,e.labelStyle),u=t.insert("g").attr("class","edgeTerminals"),l=u.insert("g").attr("class","inner");l.node().appendChild(c);var h=c.getBBox();l.attr("transform","translate("+-h.width/2+", "+-h.height/2+")"),Cn[e.id]||(Cn[e.id]={}),Cn[e.id].startLeft=u}if(e.startLabelRight){var f=Te(e.startLabelRight,e.labelStyle),p=t.insert("g").attr("class","edgeTerminals"),g=p.insert("g").attr("class","inner");p.node().appendChild(f),g.node().appendChild(f);var y=f.getBBox();g.attr("transform","translate("+-y.width/2+", "+-y.height/2+")"),Cn[e.id]||(Cn[e.id]={}),Cn[e.id].startRight=p}if(e.endLabelLeft){var v=Te(e.endLabelLeft,e.labelStyle),m=t.insert("g").attr("class","edgeTerminals"),b=m.insert("g").attr("class","inner");b.node().appendChild(v);var x=v.getBBox();b.attr("transform","translate("+-x.width/2+", "+-x.height/2+")"),m.node().appendChild(v),Cn[e.id]||(Cn[e.id]={}),Cn[e.id].endLeft=m}if(e.endLabelRight){var _=Te(e.endLabelRight,e.labelStyle),k=t.insert("g").attr("class","edgeTerminals"),w=k.insert("g").attr("class","inner");w.node().appendChild(_);var E=_.getBBox();w.attr("transform","translate("+-E.width/2+", "+-E.height/2+")"),k.node().appendChild(_),Cn[e.id]||(Cn[e.id]={}),Cn[e.id].endRight=k}}(l,e)})),n.edges().forEach((function(t){c.info("Edge "+t.v+" -> "+t.w+": "+JSON.stringify(t))})),c.info("#############################################"),c.info("### Layout ###"),c.info("#############################################"),c.info(n),ke.a.layout(n),c.info("Graph after layout:",G.a.json.write(n)),je(n).forEach((function(t){var e=n.node(t);c.info("Position "+t+": "+JSON.stringify(n.node(t))),c.info("Position "+t+": ("+e.x,","+e.y,") width: ",e.width," height: ",e.height),e&&e.clusterNode?kn(e):n.children(t).length>0?(!function(t,e){c.trace("Inserting cluster");var n=e.shape||"rect";En[e.id]=wn[n](t,e)}(s,e),Me[e.id].node=e):kn(e)})),n.edges().forEach((function(t){var e=n.edge(t);c.info("Edge "+t.v+" -> "+t.w+": "+JSON.stringify(e),e);var i=function(t,e,n,r,i,a){var o=n.points,s=!1,u=a.node(e.v),l=a.node(e.w);if(l.intersect&&u.intersect&&((o=o.slice(1,n.points.length-1)).unshift(u.intersect(o[0])),c.info("Last point",o[o.length-1],l,l.intersect(o[o.length-1])),o.push(l.intersect(o[o.length-1]))),n.toCluster){var h;c.trace("edge",n),c.trace("to cluster",r[n.toCluster]),o=[];var f=!1;n.points.forEach((function(t){var e=r[n.toCluster].node;if(An(e,t)||f)f||o.push(t);else{c.trace("inside",n.toCluster,t,h);var i=Sn(e,h,t),a=!1;o.forEach((function(t){a=a||t.x===i.x&&t.y===i.y})),o.find((function(t){return t.x===i.x&&t.y===i.y}))?c.warn("no intersect",i,o):o.push(i),f=!0}h=t})),s=!0}if(n.fromCluster){c.trace("edge",n),c.warn("from cluster",r[n.fromCluster]);for(var p,g=[],y=!1,v=o.length-1;v>=0;v--){var m=o[v],b=r[n.fromCluster].node;if(An(b,m)||y)c.trace("Outside point",m),y||g.unshift(m);else{c.warn("inside",n.fromCluster,m,b);var x=Sn(b,p,m);g.unshift(x),y=!0}p=m}o=g,s=!0}var _,k=o.filter((function(t){return!Number.isNaN(t.y)})),w=Object(d.line)().x((function(t){return t.x})).y((function(t){return t.y})).curve(d.curveBasis);switch(n.thickness){case"normal":_="edge-thickness-normal";break;case"thick":_="edge-thickness-thick";break;default:_=""}switch(n.pattern){case"solid":_+=" edge-pattern-solid";break;case"dotted":_+=" edge-pattern-dotted";break;case"dashed":_+=" edge-pattern-dashed"}var E=t.append("path").attr("d",w(k)).attr("id",n.id).attr("class"," "+_+(n.classes?" "+n.classes:"")).attr("style",n.style),T="";switch(_t().state.arrowMarkerAbsolute&&(T=(T=(T=window.location.protocol+"//"+window.location.host+window.location.pathname+window.location.search).replace(/\(/g,"\\(")).replace(/\)/g,"\\)")),c.info("arrowTypeStart",n.arrowTypeStart),c.info("arrowTypeEnd",n.arrowTypeEnd),n.arrowTypeStart){case"arrow_cross":E.attr("marker-start","url("+T+"#"+i+"-crossStart)");break;case"arrow_point":E.attr("marker-start","url("+T+"#"+i+"-pointStart)");break;case"arrow_barb":E.attr("marker-start","url("+T+"#"+i+"-barbStart)");break;case"arrow_circle":E.attr("marker-start","url("+T+"#"+i+"-circleStart)");break;case"aggregation":E.attr("marker-start","url("+T+"#"+i+"-aggregationStart)");break;case"extension":E.attr("marker-start","url("+T+"#"+i+"-extensionStart)");break;case"composition":E.attr("marker-start","url("+T+"#"+i+"-compositionStart)");break;case"dependency":E.attr("marker-start","url("+T+"#"+i+"-dependencyStart)")}switch(n.arrowTypeEnd){case"arrow_cross":E.attr("marker-end","url("+T+"#"+i+"-crossEnd)");break;case"arrow_point":E.attr("marker-end","url("+T+"#"+i+"-pointEnd)");break;case"arrow_barb":E.attr("marker-end","url("+T+"#"+i+"-barbEnd)");break;case"arrow_circle":E.attr("marker-end","url("+T+"#"+i+"-circleEnd)");break;case"aggregation":E.attr("marker-end","url("+T+"#"+i+"-aggregationEnd)");break;case"extension":E.attr("marker-end","url("+T+"#"+i+"-extensionEnd)");break;case"composition":E.attr("marker-end","url("+T+"#"+i+"-compositionEnd)");break;case"dependency":E.attr("marker-end","url("+T+"#"+i+"-dependencyEnd)")}var C={};return s&&(C.updatedPath=o),C.originalPath=n.points,C}(u,t,e,Me,r,n);!function(t,e){c.info("Moving label",t.id,t.label,Tn[t.id]);var n=e.updatedPath?e.updatedPath:e.originalPath;if(t.label){var r=Tn[t.id],i=t.x,a=t.y;if(n){var o=H.calcLabelPosition(n);c.info("Moving label from (",i,",",a,") to (",o.x,",",o.y,")")}r.attr("transform","translate("+i+", "+a+")")}if(t.startLabelLeft){var s=Cn[t.id].startLeft,u=t.x,l=t.y;if(n){var h=H.calcTerminalLabelPosition(0,"start_left",n);u=h.x,l=h.y}s.attr("transform","translate("+u+", "+l+")")}if(t.startLabelRight){var f=Cn[t.id].startRight,d=t.x,p=t.y;if(n){var g=H.calcTerminalLabelPosition(0,"start_right",n);d=g.x,p=g.y}f.attr("transform","translate("+d+", "+p+")")}if(t.endLabelLeft){var y=Cn[t.id].endLeft,v=t.x,m=t.y;if(n){var b=H.calcTerminalLabelPosition(0,"end_left",n);v=b.x,m=b.y}y.attr("transform","translate("+v+", "+m+")")}if(t.endLabelRight){var x=Cn[t.id].endRight,_=t.x,k=t.y;if(n){var w=H.calcTerminalLabelPosition(0,"end_right",n);_=w.x,k=w.y}x.attr("transform","translate("+_+", "+k+")")}}(e,i)})),o},On=function(t,e,n,r,i){Ee(t,n,r,i),_n={},Tn={},Cn={},En={},Oe={},De={},Me={},c.warn("Graph at first:",G.a.json.write(e)),Ie(e),c.warn("Graph after:",G.a.json.write(e)),Mn(t,e,r)},Dn={},Nn=function(t,e,n){var r=Object(d.select)('[id="'.concat(n,'"]'));Object.keys(t).forEach((function(n){var i=t[n],a="default";i.classes.length>0&&(a=i.classes.join(" "));var o,s=B(i.styles),u=void 0!==i.text?i.text:i.id;if(_t().flowchart.htmlLabels){var l={label:u.replace(/fa[lrsb]?:fa-[\w-]+/g,(function(t){return"<i class='".concat(t.replace(":"," "),"'></i>")}))};(o=ee()(r,l).node()).parentNode.removeChild(o)}else{var h=document.createElementNS("http://www.w3.org/2000/svg","text");h.setAttribute("style",s.labelStyle.replace("color:","fill:"));for(var f=u.split(x.lineBreakRegex),d=0;d<f.length;d++){var p=document.createElementNS("http://www.w3.org/2000/svg","tspan");p.setAttributeNS("http://www.w3.org/XML/1998/namespace","xml:space","preserve"),p.setAttribute("dy","1em"),p.setAttribute("x","1"),p.textContent=f[d],h.appendChild(p)}o=h}var g=0,y="";switch(i.type){case"round":g=5,y="rect";break;case"square":y="rect";break;case"diamond":y="question";break;case"hexagon":y="hexagon";break;case"odd":y="rect_left_inv_arrow";break;case"lean_right":y="lean_right";break;case"lean_left":y="lean_left";break;case"trapezoid":y="trapezoid";break;case"inv_trapezoid":y="inv_trapezoid";break;case"odd_right":y="rect_left_inv_arrow";break;case"circle":y="circle";break;case"ellipse":y="ellipse";break;case"stadium":y="stadium";break;case"subroutine":y="subroutine";break;case"cylinder":y="cylinder";break;case"group":y="rect";break;default:y="rect"}e.setNode(i.id,{labelStyle:s.labelStyle,shape:y,labelText:u,rx:g,ry:g,class:a,style:s.style,id:i.id,link:i.link,linkTarget:i.linkTarget,tooltip:Xt.getTooltip(i.id)||"",domId:Xt.lookUpDomId(i.id),haveCallback:i.haveCallback,width:"group"===i.type?500:void 0,type:i.type,padding:_t().flowchart.padding}),c.info("setNode",{labelStyle:s.labelStyle,shape:y,labelText:u,rx:g,ry:g,class:a,style:s.style,id:i.id,domId:Xt.lookUpDomId(i.id),width:"group"===i.type?500:void 0,type:i.type,padding:_t().flowchart.padding})}))},Bn=function(t,e){var n,r,i=0;if(void 0!==t.defaultStyle){var a=B(t.defaultStyle);n=a.style,r=a.labelStyle}t.forEach((function(a){i++;var o="L-"+a.start+"-"+a.end,s="LS-"+a.start,c="LE-"+a.end,u={style:"",labelStyle:""};switch(u.minlen=a.length||1,"arrow_open"===a.type?u.arrowhead="none":u.arrowhead="normal",u.arrowTypeStart="arrow_open",u.arrowTypeEnd="arrow_open",a.type){case"double_arrow_cross":u.arrowTypeStart="arrow_cross";case"arrow_cross":u.arrowTypeEnd="arrow_cross";break;case"double_arrow_point":u.arrowTypeStart="arrow_point";case"arrow_point":u.arrowTypeEnd="arrow_point";break;case"double_arrow_circle":u.arrowTypeStart="arrow_circle";case"arrow_circle":u.arrowTypeEnd="arrow_circle"}var l="",h="";switch(a.stroke){case"normal":l="fill:none;",void 0!==n&&(l=n),void 0!==r&&(h=r),u.thickness="normal",u.pattern="solid";break;case"dotted":u.thickness="normal",u.pattern="dotted",u.style="fill:none;stroke-width:2px;stroke-dasharray:3;";break;case"thick":u.thickness="thick",u.pattern="solid",u.style="stroke-width: 3.5px;fill:none;"}if(void 0!==a.style){var f=B(a.style);l=f.style,h=f.labelStyle}u.style=u.style+=l,u.labelStyle=u.labelStyle+=h,void 0!==a.interpolate?u.curve=D(a.interpolate,d.curveLinear):void 0!==t.defaultInterpolate?u.curve=D(t.defaultInterpolate,d.curveLinear):u.curve=D(Dn.curve,d.curveLinear),void 0===a.text?void 0!==a.style&&(u.arrowheadStyle="fill: #333"):(u.arrowheadStyle="fill: #333",u.labelpos="c"),u.labelType="text",u.label=a.text.replace(x.lineBreakRegex,"\n"),void 0===a.style&&(u.style=u.style||"stroke: #333; stroke-width: 1.5px;fill:none;"),u.labelStyle=u.labelStyle.replace("color:","fill:"),u.id=o,u.classes="flowchart-link "+s+" "+c,e.setEdge(a.start,a.end,u,i)}))},Ln=function(t){for(var e=Object.keys(t),n=0;n<e.length;n++)Dn[e[n]]=t[e[n]]},Pn=function(t,e){c.info("Drawing flowchart"),Xt.clear(),Xt.setGen("gen-2");var n=Jt.a.parser;n.yy=Xt,n.parse(t);var r=Xt.getDirection();void 0===r&&(r="TD");var i,a=_t().flowchart,o=a.nodeSpacing||50,s=a.rankSpacing||50,u=new G.a.Graph({multigraph:!0,compound:!0}).setGraph({rankdir:r,nodesep:o,ranksep:s,marginx:8,marginy:8}).setDefaultEdgeLabel((function(){return{}})),l=Xt.getSubGraphs();c.info("Subgraphs - ",l);for(var h=l.length-1;h>=0;h--)i=l[h],c.info("Subgraph - ",i),Xt.addVertex(i.id,i.title,"group",void 0,i.classes);var f=Xt.getVertices(),p=Xt.getEdges();c.info(p);var g=0;for(g=l.length-1;g>=0;g--){i=l[g],Object(d.selectAll)("cluster").append("text");for(var y=0;y<i.nodes.length;y++)c.info("Setting up subgraphs",i.nodes[y],i.id),u.setParent(i.nodes[y],i.id)}Nn(f,u,e),Bn(p,u);var v=Object(d.select)('[id="'.concat(e,'"]'));v.attr("xmlns:xlink","http://www.w3.org/1999/xlink");var m=Object(d.select)("#"+e+" g");On(m,u,["point","circle","cross"],"flowchart",e);var b=a.diagramPadding,x=v.node().getBBox(),_=x.width+2*b,k=x.height+2*b;if(c.debug("new ViewBox 0 0 ".concat(_," ").concat(k),"translate(".concat(b-u._label.marginx,", ").concat(b-u._label.marginy,")")),W(v,k,_,a.useMaxWidth),v.attr("viewBox","0 0 ".concat(_," ").concat(k)),v.select("g").attr("transform","translate(".concat(b-u._label.marginx,", ").concat(b-x.y,")")),Xt.indexNodes("subGraph"+g),!a.htmlLabels)for(var w=document.querySelectorAll('[id="'+e+'"] .edgeLabel .label'),E=0;E<w.length;E++){var T=w[E],C=T.getBBox(),A=document.createElementNS("http://www.w3.org/2000/svg","rect");A.setAttribute("rx",0),A.setAttribute("ry",0),A.setAttribute("width",C.width),A.setAttribute("height",C.height),T.insertBefore(A,T.firstChild)}Object.keys(f).forEach((function(t){var n=f[t];if(n.link){var r=Object(d.select)("#"+e+' [id="'+t+'"]');if(r){var i=document.createElementNS("http://www.w3.org/2000/svg","a");i.setAttributeNS("http://www.w3.org/2000/svg","class",n.classes.join(" ")),i.setAttributeNS("http://www.w3.org/2000/svg","href",n.link),i.setAttributeNS("http://www.w3.org/2000/svg","rel","noopener"),n.linkTarget&&i.setAttributeNS("http://www.w3.org/2000/svg","target",n.linkTarget);var a=r.insert((function(){return i}),":first-child"),o=r.select(".label-container");o&&a.append((function(){return o.node()}));var s=r.select(".label");s&&a.append((function(){return s.node()}))}}}))},In=function(t,e){var n=t.append("rect");return n.attr("x",e.x),n.attr("y",e.y),n.attr("fill",e.fill),n.attr("stroke",e.stroke),n.attr("width",e.width),n.attr("height",e.height),n.attr("rx",e.rx),n.attr("ry",e.ry),void 0!==e.class&&n.attr("class",e.class),n},Fn=function(t,e){var n=0,r=0,i=e.text.split(x.lineBreakRegex),a=[],o=0,s=function(){return e.y};if(void 0!==e.valign&&void 0!==e.textMargin&&e.textMargin>0)switch(e.valign){case"top":case"start":s=function(){return Math.round(e.y+e.textMargin)};break;case"middle":case"center":s=function(){return Math.round(e.y+(n+r+e.textMargin)/2)};break;case"bottom":case"end":s=function(){return Math.round(e.y+(n+r+2*e.textMargin)-e.textMargin)}}if(void 0!==e.anchor&&void 0!==e.textMargin&&void 0!==e.width)switch(e.anchor){case"left":case"start":e.x=Math.round(e.x+e.textMargin),e.anchor="start",e.dominantBaseline="text-after-edge",e.alignmentBaseline="middle";break;case"middle":case"center":e.x=Math.round(e.x+e.width/2),e.anchor="middle",e.dominantBaseline="middle",e.alignmentBaseline="middle";break;case"right":case"end":e.x=Math.round(e.x+e.width-e.textMargin),e.anchor="end",e.dominantBaseline="text-before-edge",e.alignmentBaseline="middle"}for(var c=0;c<i.length;c++){var u=i[c];void 0!==e.textMargin&&0===e.textMargin&&void 0!==e.fontSize&&(o=c*e.fontSize);var l=t.append("text");if(l.attr("x",e.x),l.attr("y",s()),void 0!==e.anchor&&l.attr("text-anchor",e.anchor).attr("dominant-baseline",e.dominantBaseline).attr("alignment-baseline",e.alignmentBaseline),void 0!==e.fontFamily&&l.style("font-family",e.fontFamily),void 0!==e.fontSize&&l.style("font-size",e.fontSize),void 0!==e.fontWeight&&l.style("font-weight",e.fontWeight),void 0!==e.fill&&l.attr("fill",e.fill),void 0!==e.class&&l.attr("class",e.class),void 0!==e.dy?l.attr("dy",e.dy):0!==o&&l.attr("dy",o),e.tspan){var h=l.append("tspan");h.attr("x",e.x),void 0!==e.fill&&h.attr("fill",e.fill),h.text(u)}else l.text(u);void 0!==e.valign&&void 0!==e.textMargin&&e.textMargin>0&&(r+=(l._groups||l)[0][0].getBBox().height,n=r),a.push(l)}return a},jn=function(t,e){var n,r,i,a,o,s=t.append("polygon");return s.attr("points",(n=e.x,r=e.y,i=e.width,a=e.height,n+","+r+" "+(n+i)+","+r+" "+(n+i)+","+(r+a-(o=7))+" "+(n+i-1.2*o)+","+(r+a)+" "+n+","+(r+a))),s.attr("class","labelBox"),e.y=e.y+e.height/2,Fn(t,e),s},Rn=-1,Yn=function(){return{x:0,y:0,fill:void 0,anchor:void 0,style:"#666",width:void 0,height:void 0,textMargin:0,rx:0,ry:0,tspan:!0,valign:void 0}},zn=function(){return{x:0,y:0,fill:"#EDF2AE",stroke:"#666",width:100,anchor:"start",height:100,rx:0,ry:0}},Un=function(){function t(t,e,n,i,a,o,s){r(e.append("text").attr("x",n+a/2).attr("y",i+o/2+5).style("text-anchor","middle").text(t),s)}function e(t,e,n,i,a,o,s,c){for(var u=c.actorFontSize,l=c.actorFontFamily,h=c.actorFontWeight,f=t.split(x.lineBreakRegex),d=0;d<f.length;d++){var p=d*u-u*(f.length-1)/2,g=e.append("text").attr("x",n+a/2).attr("y",i).style("text-anchor","middle").style("font-size",u).style("font-weight",h).style("font-family",l);g.append("tspan").attr("x",n+a/2).attr("dy",p).text(f[d]),g.attr("y",i+o/2).attr("dominant-baseline","central").attr("alignment-baseline","central"),r(g,s)}}function n(t,n,i,a,o,s,c,u){var l=n.append("switch"),h=l.append("foreignObject").attr("x",i).attr("y",a).attr("width",o).attr("height",s).append("div").style("display","table").style("height","100%").style("width","100%");h.append("div").style("display","table-cell").style("text-align","center").style("vertical-align","middle").text(t),e(t,l,i,a,o,s,c,u),r(h,c)}function r(t,e){for(var n in e)e.hasOwnProperty(n)&&t.attr(n,e[n])}return function(r){return"fo"===r.textPlacement?n:"old"===r.textPlacement?t:e}}(),$n={drawRect:In,drawText:Fn,drawLabel:jn,drawActor:function(t,e,n){var r=e.x+e.width/2,i=t.append("g");0===e.y&&(Rn++,i.append("line").attr("id","actor"+Rn).attr("x1",r).attr("y1",5).attr("x2",r).attr("y2",2e3).attr("class","actor-line").attr("stroke-width","0.5px").attr("stroke","#999"));var a=zn();a.x=e.x,a.y=e.y,a.fill="#eaeaea",a.width=e.width,a.height=e.height,a.class="actor",a.rx=3,a.ry=3,In(i,a),Un(n)(e.description,i,a.x,a.y,a.width,a.height,{class:"actor"},n)},anchorElement:function(t){return t.append("g")},drawActivation:function(t,e,n,r,i){var a=zn(),o=e.anchored;a.x=e.startx,a.y=e.starty,a.class="activation"+i%3,a.width=e.stopx-e.startx,a.height=n-e.starty,In(o,a)},drawLoop:function(t,e,n,r){var i=r.boxMargin,a=r.boxTextMargin,o=r.labelBoxHeight,s=r.labelBoxWidth,c=r.messageFontFamily,u=r.messageFontSize,l=r.messageFontWeight,h=t.append("g"),f=function(t,e,n,r){return h.append("line").attr("x1",t).attr("y1",e).attr("x2",n).attr("y2",r).attr("class","loopLine")};f(e.startx,e.starty,e.stopx,e.starty),f(e.stopx,e.starty,e.stopx,e.stopy),f(e.startx,e.stopy,e.stopx,e.stopy),f(e.startx,e.starty,e.startx,e.stopy),void 0!==e.sections&&e.sections.forEach((function(t){f(e.startx,t.y,e.stopx,t.y).style("stroke-dasharray","3, 3")}));var d=Yn();d.text=n,d.x=e.startx,d.y=e.starty,d.fontFamily=c,d.fontSize=u,d.fontWeight=l,d.anchor="middle",d.valign="middle",d.tspan=!1,d.width=s||50,d.height=o||20,d.textMargin=a,d.class="labelText",jn(h,d),(d=Yn()).text=e.title,d.x=e.startx+s/2+(e.stopx-e.startx)/2,d.y=e.starty+i+a,d.anchor="middle",d.valign="middle",d.textMargin=a,d.class="loopText",d.fontFamily=c,d.fontSize=u,d.fontWeight=l,d.wrap=!0;var p=Fn(h,d);return void 0!==e.sectionTitles&&e.sectionTitles.forEach((function(t,n){if(t.message){d.text=t.message,d.x=e.startx+(e.stopx-e.startx)/2,d.y=e.sections[n].y+i+a,d.class="loopText",d.anchor="middle",d.valign="middle",d.tspan=!1,d.fontFamily=c,d.fontSize=u,d.fontWeight=l,d.wrap=e.wrap,p=Fn(h,d);var r=Math.round(p.map((function(t){return(t._groups||t)[0][0].getBBox().height})).reduce((function(t,e){return t+e})));e.sections[n].height+=r-(i+a)}})),e.height=Math.round(e.stopy-e.starty),h},drawBackgroundRect:function(t,e){In(t,{x:e.startx,y:e.starty,width:e.stopx-e.startx,height:e.stopy-e.starty,fill:e.fill,class:"rect"}).lower()},insertArrowHead:function(t){t.append("defs").append("marker").attr("id","arrowhead").attr("refX",9).attr("refY",5).attr("markerUnits","userSpaceOnUse").attr("markerWidth",12).attr("markerHeight",12).attr("orient","auto").append("path").attr("d","M 0 0 L 10 5 L 0 10 z")},insertArrowFilledHead:function(t){t.append("defs").append("marker").attr("id","filled-head").attr("refX",18).attr("refY",7).attr("markerWidth",20).attr("markerHeight",28).attr("orient","auto").append("path").attr("d","M 18,7 L9,13 L14,7 L9,1 Z")},insertSequenceNumber:function(t){t.append("defs").append("marker").attr("id","sequencenumber").attr("refX",15).attr("refY",15).attr("markerWidth",60).attr("markerHeight",40).attr("orient","auto").append("circle").attr("cx",15).attr("cy",15).attr("r",6)},insertArrowCrossHead:function(t){var e=t.append("defs").append("marker").attr("id","crosshead").attr("markerWidth",15).attr("markerHeight",8).attr("orient","auto").attr("refX",16).attr("refY",4);e.append("path").attr("fill","black").attr("stroke","#000000").style("stroke-dasharray","0, 0").attr("stroke-width","1px").attr("d","M 9,2 V 6 L16,4 Z"),e.append("path").attr("fill","none").attr("stroke","#000000").style("stroke-dasharray","0, 0").attr("stroke-width","1px").attr("d","M 0,1 L 6,7 M 6,1 L 0,7")},getTextObj:Yn,getNoteRect:zn},Wn=n(2),Hn=n.n(Wn),Vn=void 0,Gn={},qn=[],Xn=[],Zn="",Jn=!1,Kn=!1,Qn=!1,tr=function(t,e,n){var r=Gn[t];r&&e===r.name&&null==n||(null!=n&&null!=n.text||(n={text:e,wrap:null}),Gn[t]={name:e,description:n.text,wrap:void 0===n.wrap&&rr()||!!n.wrap,prevActor:Vn},Vn&&Gn[Vn]&&(Gn[Vn].nextActor=t),Vn=t)},er=function(t){var e,n=0;for(e=0;e<qn.length;e++)qn[e].type===ir.ACTIVE_START&&qn[e].from.actor===t&&n++,qn[e].type===ir.ACTIVE_END&&qn[e].from.actor===t&&n--;return n},nr=function(t,e){var n=arguments.length>2&&void 0!==arguments[2]?arguments[2]:{text:void 0,wrap:void 0},r=arguments.length>3?arguments[3]:void 0;if(r===ir.ACTIVE_END){var i=er(t.actor);if(i<1){var a=new Error("Trying to inactivate an inactive participant ("+t.actor+")");throw a.hash={text:"->>-",token:"->>-",line:"1",loc:{first_line:1,last_line:1,first_column:1,last_column:1},expected:["'ACTIVE_PARTICIPANT'"]},a}}return qn.push({from:t,to:e,message:n.text,wrap:void 0===n.wrap&&rr()||!!n.wrap,type:r}),!0},rr=function(){return Qn},ir={SOLID:0,DOTTED:1,NOTE:2,SOLID_CROSS:3,DOTTED_CROSS:4,SOLID_OPEN:5,DOTTED_OPEN:6,LOOP_START:10,LOOP_END:11,ALT_START:12,ALT_ELSE:13,ALT_END:14,OPT_START:15,OPT_END:16,ACTIVE_START:17,ACTIVE_END:18,PAR_START:19,PAR_AND:20,PAR_END:21,RECT_START:22,RECT_END:23,SOLID_POINT:24,DOTTED_POINT:25},ar=function(t,e,n){var r={actor:t,placement:e,message:n.text,wrap:void 0===n.wrap&&rr()||!!n.wrap},i=[].concat(t,t);Xn.push(r),qn.push({from:i[0],to:i[1],message:n.text,wrap:void 0===n.wrap&&rr()||!!n.wrap,type:ir.NOTE,placement:e})},or=function(t){Zn=t.text,Jn=void 0===t.wrap&&rr()||!!t.wrap},sr={addActor:tr,addMessage:function(t,e,n,r){qn.push({from:t,to:e,message:n.text,wrap:void 0===n.wrap&&rr()||!!n.wrap,answer:r})},addSignal:nr,autoWrap:rr,setWrap:function(t){Qn=t},enableSequenceNumbers:function(){Kn=!0},showSequenceNumbers:function(){return Kn},getMessages:function(){return qn},getActors:function(){return Gn},getActor:function(t){return Gn[t]},getActorKeys:function(){return Object.keys(Gn)},getTitle:function(){return Zn},parseDirective:function(t,e,n){Go.parseDirective(this,t,e,n)},getConfig:function(){return _t().sequence},getTitleWrapped:function(){return Jn},clear:function(){Gn={},qn=[]},parseMessage:function(t){var e=t.trim(),n={text:e.replace(/^[:]?(?:no)?wrap:/,"").trim(),wrap:null!==e.match(/^[:]?wrap:/)||null===e.match(/^[:]?nowrap:/)&&void 0};return c.debug("parseMessage:",n),n},LINETYPE:ir,ARROWTYPE:{FILLED:0,OPEN:1},PLACEMENT:{LEFTOF:0,RIGHTOF:1,OVER:2},addNote:ar,setTitle:or,apply:function t(e){if(e instanceof Array)e.forEach((function(e){t(e)}));else switch(e.type){case"addActor":tr(e.actor,e.actor,e.description);break;case"activeStart":case"activeEnd":nr(e.actor,void 0,void 0,e.signalType);break;case"addNote":ar(e.actor,e.placement,e.text);break;case"addMessage":nr(e.from,e.to,e.msg,e.signalType);break;case"loopStart":nr(void 0,void 0,e.loopText,e.signalType);break;case"loopEnd":nr(void 0,void 0,void 0,e.signalType);break;case"rectStart":nr(void 0,void 0,e.color,e.signalType);break;case"rectEnd":nr(void 0,void 0,void 0,e.signalType);break;case"optStart":nr(void 0,void 0,e.optText,e.signalType);break;case"optEnd":nr(void 0,void 0,void 0,e.signalType);break;case"altStart":case"else":nr(void 0,void 0,e.altText,e.signalType);break;case"altEnd":nr(void 0,void 0,void 0,e.signalType);break;case"setTitle":or(e.text);break;case"parStart":case"and":nr(void 0,void 0,e.parText,e.signalType);break;case"parEnd":nr(void 0,void 0,void 0,e.signalType)}}};Wn.parser.yy=sr;var cr={},ur={data:{startx:void 0,stopx:void 0,starty:void 0,stopy:void 0},verticalPos:0,sequenceItems:[],activations:[],models:{getHeight:function(){return Math.max.apply(null,0===this.actors.length?[0]:this.actors.map((function(t){return t.height||0})))+(0===this.loops.length?0:this.loops.map((function(t){return t.height||0})).reduce((function(t,e){return t+e})))+(0===this.messages.length?0:this.messages.map((function(t){return t.height||0})).reduce((function(t,e){return t+e})))+(0===this.notes.length?0:this.notes.map((function(t){return t.height||0})).reduce((function(t,e){return t+e})))},clear:function(){this.actors=[],this.loops=[],this.messages=[],this.notes=[]},addActor:function(t){this.actors.push(t)},addLoop:function(t){this.loops.push(t)},addMessage:function(t){this.messages.push(t)},addNote:function(t){this.notes.push(t)},lastActor:function(){return this.actors[this.actors.length-1]},lastLoop:function(){return this.loops[this.loops.length-1]},lastMessage:function(){return this.messages[this.messages.length-1]},lastNote:function(){return this.notes[this.notes.length-1]},actors:[],loops:[],messages:[],notes:[]},init:function(){this.sequenceItems=[],this.activations=[],this.models.clear(),this.data={startx:void 0,stopx:void 0,starty:void 0,stopy:void 0},this.verticalPos=0,pr(Wn.parser.yy.getConfig())},updateVal:function(t,e,n,r){void 0===t[e]?t[e]=n:t[e]=r(n,t[e])},updateBounds:function(t,e,n,r){var i=this,a=0;function o(o){return function(s){a++;var c=i.sequenceItems.length-a+1;i.updateVal(s,"starty",e-c*cr.boxMargin,Math.min),i.updateVal(s,"stopy",r+c*cr.boxMargin,Math.max),i.updateVal(ur.data,"startx",t-c*cr.boxMargin,Math.min),i.updateVal(ur.data,"stopx",n+c*cr.boxMargin,Math.max),"activation"!==o&&(i.updateVal(s,"startx",t-c*cr.boxMargin,Math.min),i.updateVal(s,"stopx",n+c*cr.boxMargin,Math.max),i.updateVal(ur.data,"starty",e-c*cr.boxMargin,Math.min),i.updateVal(ur.data,"stopy",r+c*cr.boxMargin,Math.max))}}this.sequenceItems.forEach(o()),this.activations.forEach(o("activation"))},insert:function(t,e,n,r){var i=Math.min(t,n),a=Math.max(t,n),o=Math.min(e,r),s=Math.max(e,r);this.updateVal(ur.data,"startx",i,Math.min),this.updateVal(ur.data,"starty",o,Math.min),this.updateVal(ur.data,"stopx",a,Math.max),this.updateVal(ur.data,"stopy",s,Math.max),this.updateBounds(i,o,a,s)},newActivation:function(t,e,n){var r=n[t.from.actor],i=gr(t.from.actor).length||0,a=r.x+r.width/2+(i-1)*cr.activationWidth/2;this.activations.push({startx:a,starty:this.verticalPos+2,stopx:a+cr.activationWidth,stopy:void 0,actor:t.from.actor,anchored:$n.anchorElement(e)})},endActivation:function(t){var e=this.activations.map((function(t){return t.actor})).lastIndexOf(t.from.actor);return this.activations.splice(e,1)[0]},createLoop:function(){var t=arguments.length>0&&void 0!==arguments[0]?arguments[0]:{message:void 0,wrap:!1,width:void 0},e=arguments.length>1?arguments[1]:void 0;return{startx:void 0,starty:this.verticalPos,stopx:void 0,stopy:void 0,title:t.message,wrap:t.wrap,width:t.width,height:0,fill:e}},newLoop:function(){var t=arguments.length>0&&void 0!==arguments[0]?arguments[0]:{message:void 0,wrap:!1,width:void 0},e=arguments.length>1?arguments[1]:void 0;this.sequenceItems.push(this.createLoop(t,e))},endLoop:function(){return this.sequenceItems.pop()},addSectionToLoop:function(t){var e=this.sequenceItems.pop();e.sections=e.sections||[],e.sectionTitles=e.sectionTitles||[],e.sections.push({y:ur.getVerticalPos(),height:0}),e.sectionTitles.push(t),this.sequenceItems.push(e)},bumpVerticalPos:function(t){this.verticalPos=this.verticalPos+t,this.data.stopy=this.verticalPos},getVerticalPos:function(){return this.verticalPos},getBounds:function(){return{bounds:this.data,models:this.models}}},lr=function(t){return{fontFamily:t.messageFontFamily,fontSize:t.messageFontSize,fontWeight:t.messageFontWeight}},hr=function(t){return{fontFamily:t.noteFontFamily,fontSize:t.noteFontSize,fontWeight:t.noteFontWeight}},fr=function(t){return{fontFamily:t.actorFontFamily,fontSize:t.actorFontSize,fontWeight:t.actorFontWeight}},dr=function(t,e,n,r){for(var i=0,a=0,o=0;o<n.length;o++){var s=e[n[o]];s.width=s.width||cr.width,s.height=Math.max(s.height||cr.height,cr.height),s.margin=s.margin||cr.actorMargin,s.x=i+a,s.y=r,$n.drawActor(t,s,cr),ur.insert(s.x,r,s.x+s.width,s.height),i+=s.width,a+=s.margin,ur.models.addActor(s)}ur.bumpVerticalPos(cr.height)},pr=function(t){F(cr,t),t.fontFamily&&(cr.actorFontFamily=cr.noteFontFamily=cr.messageFontFamily=t.fontFamily),t.fontSize&&(cr.actorFontSize=cr.noteFontSize=cr.messageFontSize=t.fontSize),t.fontWeight&&(cr.actorFontWeight=cr.noteFontWeight=cr.messageFontWeight=t.fontWeight)},gr=function(t){return ur.activations.filter((function(e){return e.actor===t}))},yr=function(t,e){var n=e[t],r=gr(t);return[r.reduce((function(t,e){return Math.min(t,e.startx)}),n.x+n.width/2),r.reduce((function(t,e){return Math.max(t,e.stopx)}),n.x+n.width/2)]};function vr(t,e,n,r,i){ur.bumpVerticalPos(n);var a=r;if(e.id&&e.message&&t[e.id]){var o=t[e.id].width,s=lr(cr);e.message=H.wrapLabel("[".concat(e.message,"]"),o-2*cr.wrapPadding,s),e.width=o,e.wrap=!0;var u=H.calculateTextDimensions(e.message,s),l=Math.max(u.height,cr.labelBoxHeight);a=r+l,c.debug("".concat(l," - ").concat(e.message))}i(e),ur.bumpVerticalPos(a)}var mr=function(t,e){var n={};return e.forEach((function(e){if(t[e.to]&&t[e.from]){var r=t[e.to];if(e.placement===Wn.parser.yy.PLACEMENT.LEFTOF&&!r.prevActor)return;if(e.placement===Wn.parser.yy.PLACEMENT.RIGHTOF&&!r.nextActor)return;var i=void 0!==e.placement,a=!i,o=i?hr(cr):lr(cr),s=e.wrap?H.wrapLabel(e.message,cr.width-2*cr.wrapPadding,o):e.message,c=H.calculateTextDimensions(s,o).width+2*cr.wrapPadding;a&&e.from===r.nextActor?n[e.to]=Math.max(n[e.to]||0,c):a&&e.from===r.prevActor?n[e.from]=Math.max(n[e.from]||0,c):a&&e.from===e.to?(n[e.from]=Math.max(n[e.from]||0,c/2),n[e.to]=Math.max(n[e.to]||0,c/2)):e.placement===Wn.parser.yy.PLACEMENT.RIGHTOF?n[e.from]=Math.max(n[e.from]||0,c):e.placement===Wn.parser.yy.PLACEMENT.LEFTOF?n[r.prevActor]=Math.max(n[r.prevActor]||0,c):e.placement===Wn.parser.yy.PLACEMENT.OVER&&(r.prevActor&&(n[r.prevActor]=Math.max(n[r.prevActor]||0,c/2)),r.nextActor&&(n[e.from]=Math.max(n[e.from]||0,c/2)))}})),c.debug("maxMessageWidthPerActor:",n),n},br=function(t,e){var n=0;for(var r in Object.keys(t).forEach((function(e){var r=t[e];r.wrap&&(r.description=H.wrapLabel(r.description,cr.width-2*cr.wrapPadding,fr(cr)));var i=H.calculateTextDimensions(r.description,fr(cr));r.width=r.wrap?cr.width:Math.max(cr.width,i.width+2*cr.wrapPadding),r.height=r.wrap?Math.max(i.height,cr.height):cr.height,n=Math.max(n,r.height)})),e){var i=t[r];if(i){var a=t[i.nextActor];if(a){var o=e[r]+cr.actorMargin-i.width/2-a.width/2;i.margin=Math.max(o,cr.actorMargin)}}}return Math.max(n,cr.height)},xr=function(t,e){var n,r,i,a={},o=[];return t.forEach((function(t){switch(t.id=H.random({length:10}),t.type){case Wn.parser.yy.LINETYPE.LOOP_START:case Wn.parser.yy.LINETYPE.ALT_START:case Wn.parser.yy.LINETYPE.OPT_START:case Wn.parser.yy.LINETYPE.PAR_START:o.push({id:t.id,msg:t.message,from:Number.MAX_SAFE_INTEGER,to:Number.MIN_SAFE_INTEGER,width:0});break;case Wn.parser.yy.LINETYPE.ALT_ELSE:case Wn.parser.yy.LINETYPE.PAR_AND:t.message&&(n=o.pop(),a[n.id]=n,a[t.id]=n,o.push(n));break;case Wn.parser.yy.LINETYPE.LOOP_END:case Wn.parser.yy.LINETYPE.ALT_END:case Wn.parser.yy.LINETYPE.OPT_END:case Wn.parser.yy.LINETYPE.PAR_END:n=o.pop(),a[n.id]=n;break;case Wn.parser.yy.LINETYPE.ACTIVE_START:var s=e[t.from?t.from.actor:t.to.actor],u=gr(t.from?t.from.actor:t.to.actor).length,l=s.x+s.width/2+(u-1)*cr.activationWidth/2,h={startx:l,stopx:l+cr.activationWidth,actor:t.from.actor,enabled:!0};ur.activations.push(h);break;case Wn.parser.yy.LINETYPE.ACTIVE_END:var f=ur.activations.map((function(t){return t.actor})).lastIndexOf(t.from.actor);delete ur.activations.splice(f,1)[0]}void 0!==t.placement?(r=function(t,e){var n=e[t.from].x,r=e[t.to].x,i=t.wrap&&t.message,a=H.calculateTextDimensions(i?H.wrapLabel(t.message,cr.width,hr(cr)):t.message,hr(cr)),o={width:i?cr.width:Math.max(cr.width,a.width+2*cr.noteMargin),height:0,startx:e[t.from].x,stopx:0,starty:0,stopy:0,message:t.message};return t.placement===Wn.parser.yy.PLACEMENT.RIGHTOF?(o.width=i?Math.max(cr.width,a.width):Math.max(e[t.from].width/2+e[t.to].width/2,a.width+2*cr.noteMargin),o.startx=n+(e[t.from].width+cr.actorMargin)/2):t.placement===Wn.parser.yy.PLACEMENT.LEFTOF?(o.width=i?Math.max(cr.width,a.width+2*cr.noteMargin):Math.max(e[t.from].width/2+e[t.to].width/2,a.width+2*cr.noteMargin),o.startx=n-o.width+(e[t.from].width-cr.actorMargin)/2):t.to===t.from?(a=H.calculateTextDimensions(i?H.wrapLabel(t.message,Math.max(cr.width,e[t.from].width),hr(cr)):t.message,hr(cr)),o.width=i?Math.max(cr.width,e[t.from].width):Math.max(e[t.from].width,cr.width,a.width+2*cr.noteMargin),o.startx=n+(e[t.from].width-o.width)/2):(o.width=Math.abs(n+e[t.from].width/2-(r+e[t.to].width/2))+cr.actorMargin,o.startx=n<r?n+e[t.from].width/2-cr.actorMargin/2:r+e[t.to].width/2-cr.actorMargin/2),i&&(o.message=H.wrapLabel(t.message,o.width-2*cr.wrapPadding,hr(cr))),c.debug("NM:[".concat(o.startx,",").concat(o.stopx,",").concat(o.starty,",").concat(o.stopy,":").concat(o.width,",").concat(o.height,"=").concat(t.message,"]")),o}(t,e),t.noteModel=r,o.forEach((function(t){(n=t).from=Math.min(n.from,r.startx),n.to=Math.max(n.to,r.startx+r.width),n.width=Math.max(n.width,Math.abs(n.from-n.to))-cr.labelBoxWidth}))):(i=function(t,e){var n=!1;if([Wn.parser.yy.LINETYPE.SOLID_OPEN,Wn.parser.yy.LINETYPE.DOTTED_OPEN,Wn.parser.yy.LINETYPE.SOLID,Wn.parser.yy.LINETYPE.DOTTED,Wn.parser.yy.LINETYPE.SOLID_CROSS,Wn.parser.yy.LINETYPE.DOTTED_CROSS,Wn.parser.yy.LINETYPE.SOLID_POINT,Wn.parser.yy.LINETYPE.DOTTED_POINT].includes(t.type)&&(n=!0),!n)return{};var r=yr(t.from,e),i=yr(t.to,e),a=r[0]<=i[0]?1:0,o=r[0]<i[0]?0:1,s=r.concat(i),c=Math.abs(i[o]-r[a]);t.wrap&&t.message&&(t.message=H.wrapLabel(t.message,Math.max(c+2*cr.wrapPadding,cr.width),lr(cr)));var u=H.calculateTextDimensions(t.message,lr(cr));return{width:Math.max(t.wrap?0:u.width+2*cr.wrapPadding,c+2*cr.wrapPadding,cr.width),height:0,startx:r[a],stopx:i[o],starty:0,stopy:0,message:t.message,type:t.type,wrap:t.wrap,fromBounds:Math.min.apply(null,s),toBounds:Math.max.apply(null,s)}}(t,e),t.msgModel=i,i.startx&&i.stopx&&o.length>0&&o.forEach((function(r){if(n=r,i.startx===i.stopx){var a=e[t.from],o=e[t.to];n.from=Math.min(a.x-i.width/2,a.x-a.width/2,n.from),n.to=Math.max(o.x+i.width/2,o.x+a.width/2,n.to),n.width=Math.max(n.width,Math.abs(n.to-n.from))-cr.labelBoxWidth}else n.from=Math.min(i.startx,n.from),n.to=Math.max(i.stopx,n.to),n.width=Math.max(n.width,i.width)-cr.labelBoxWidth})))})),ur.activations=[],c.debug("Loop type widths:",a),a},_r={bounds:ur,drawActors:dr,setConf:pr,draw:function(t,e){cr=_t().sequence,Wn.parser.yy.clear(),Wn.parser.yy.setWrap(cr.wrap),Wn.parser.parse(t+"\n"),ur.init(),c.debug("C:".concat(JSON.stringify(cr,null,2)));var n=Object(d.select)('[id="'.concat(e,'"]')),r=Wn.parser.yy.getActors(),i=Wn.parser.yy.getActorKeys(),a=Wn.parser.yy.getMessages(),o=Wn.parser.yy.getTitle(),s=mr(r,a);cr.height=br(r,s),dr(n,r,i,0);var u=xr(a,r,s);$n.insertArrowHead(n),$n.insertArrowCrossHead(n),$n.insertArrowFilledHead(n),$n.insertSequenceNumber(n);var l=1;a.forEach((function(t){var e,i,a;switch(t.type){case Wn.parser.yy.LINETYPE.NOTE:i=t.noteModel,function(t,e){ur.bumpVerticalPos(cr.boxMargin),e.height=cr.boxMargin,e.starty=ur.getVerticalPos();var n=$n.getNoteRect();n.x=e.startx,n.y=e.starty,n.width=e.width||cr.width,n.class="note";var r=t.append("g"),i=$n.drawRect(r,n),a=$n.getTextObj();a.x=e.startx,a.y=e.starty,a.width=n.width,a.dy="1em",a.text=e.message,a.class="noteText",a.fontFamily=cr.noteFontFamily,a.fontSize=cr.noteFontSize,a.fontWeight=cr.noteFontWeight,a.anchor=cr.noteAlign,a.textMargin=cr.noteMargin,a.valign=cr.noteAlign;var o=Fn(r,a),s=Math.round(o.map((function(t){return(t._groups||t)[0][0].getBBox().height})).reduce((function(t,e){return t+e})));i.attr("height",s+2*cr.noteMargin),e.height+=s+2*cr.noteMargin,ur.bumpVerticalPos(s+2*cr.noteMargin),e.stopy=e.starty+s+2*cr.noteMargin,e.stopx=e.startx+n.width,ur.insert(e.startx,e.starty,e.stopx,e.stopy),ur.models.addNote(e)}(n,i);break;case Wn.parser.yy.LINETYPE.ACTIVE_START:ur.newActivation(t,n,r);break;case Wn.parser.yy.LINETYPE.ACTIVE_END:!function(t,e){var r=ur.endActivation(t);r.starty+18>e&&(r.starty=e-6,e+=12),$n.drawActivation(n,r,e,cr,gr(t.from.actor).length),ur.insert(r.startx,e-10,r.stopx,e)}(t,ur.getVerticalPos());break;case Wn.parser.yy.LINETYPE.LOOP_START:vr(u,t,cr.boxMargin,cr.boxMargin+cr.boxTextMargin,(function(t){return ur.newLoop(t)}));break;case Wn.parser.yy.LINETYPE.LOOP_END:e=ur.endLoop(),$n.drawLoop(n,e,"loop",cr),ur.bumpVerticalPos(e.stopy-ur.getVerticalPos()),ur.models.addLoop(e);break;case Wn.parser.yy.LINETYPE.RECT_START:vr(u,t,cr.boxMargin,cr.boxMargin,(function(t){return ur.newLoop(void 0,t.message)}));break;case Wn.parser.yy.LINETYPE.RECT_END:e=ur.endLoop(),$n.drawBackgroundRect(n,e),ur.models.addLoop(e),ur.bumpVerticalPos(e.stopy-ur.getVerticalPos());break;case Wn.parser.yy.LINETYPE.OPT_START:vr(u,t,cr.boxMargin,cr.boxMargin+cr.boxTextMargin,(function(t){return ur.newLoop(t)}));break;case Wn.parser.yy.LINETYPE.OPT_END:e=ur.endLoop(),$n.drawLoop(n,e,"opt",cr),ur.bumpVerticalPos(e.stopy-ur.getVerticalPos()),ur.models.addLoop(e);break;case Wn.parser.yy.LINETYPE.ALT_START:vr(u,t,cr.boxMargin,cr.boxMargin+cr.boxTextMargin,(function(t){return ur.newLoop(t)}));break;case Wn.parser.yy.LINETYPE.ALT_ELSE:vr(u,t,cr.boxMargin+cr.boxTextMargin,cr.boxMargin,(function(t){return ur.addSectionToLoop(t)}));break;case Wn.parser.yy.LINETYPE.ALT_END:e=ur.endLoop(),$n.drawLoop(n,e,"alt",cr),ur.bumpVerticalPos(e.stopy-ur.getVerticalPos()),ur.models.addLoop(e);break;case Wn.parser.yy.LINETYPE.PAR_START:vr(u,t,cr.boxMargin,cr.boxMargin+cr.boxTextMargin,(function(t){return ur.newLoop(t)}));break;case Wn.parser.yy.LINETYPE.PAR_AND:vr(u,t,cr.boxMargin+cr.boxTextMargin,cr.boxMargin,(function(t){return ur.addSectionToLoop(t)}));break;case Wn.parser.yy.LINETYPE.PAR_END:e=ur.endLoop(),$n.drawLoop(n,e,"par",cr),ur.bumpVerticalPos(e.stopy-ur.getVerticalPos()),ur.models.addLoop(e);break;default:try{(a=t.msgModel).starty=ur.getVerticalPos(),a.sequenceIndex=l,function(t,e){ur.bumpVerticalPos(10);var n=e.startx,r=e.stopx,i=e.starty,a=e.message,o=e.type,s=e.sequenceIndex,c=x.splitBreaks(a).length,u=H.calculateTextDimensions(a,lr(cr)),l=u.height/c;e.height+=l,ur.bumpVerticalPos(l);var h=$n.getTextObj();h.x=n,h.y=i+10,h.width=r-n,h.class="messageText",h.dy="1em",h.text=a,h.fontFamily=cr.messageFontFamily,h.fontSize=cr.messageFontSize,h.fontWeight=cr.messageFontWeight,h.anchor=cr.messageAlign,h.valign=cr.messageAlign,h.textMargin=cr.wrapPadding,h.tspan=!1,Fn(t,h);var f,d,p=u.height-10,g=u.width;if(n===r){d=ur.getVerticalPos()+p,cr.rightAngles?f=t.append("path").attr("d","M ".concat(n,",").concat(d," H ").concat(n+Math.max(cr.width/2,g/2)," V ").concat(d+25," H ").concat(n)):(p+=cr.boxMargin,d=ur.getVerticalPos()+p,f=t.append("path").attr("d","M "+n+","+d+" C "+(n+60)+","+(d-10)+" "+(n+60)+","+(d+30)+" "+n+","+(d+20))),p+=30;var y=Math.max(g/2,cr.width/2);ur.insert(n-y,ur.getVerticalPos()-10+p,r+y,ur.getVerticalPos()+30+p)}else p+=cr.boxMargin,d=ur.getVerticalPos()+p,(f=t.append("line")).attr("x1",n),f.attr("y1",d),f.attr("x2",r),f.attr("y2",d),ur.insert(n,d-10,r,d);o===Wn.parser.yy.LINETYPE.DOTTED||o===Wn.parser.yy.LINETYPE.DOTTED_CROSS||o===Wn.parser.yy.LINETYPE.DOTTED_POINT||o===Wn.parser.yy.LINETYPE.DOTTED_OPEN?(f.style("stroke-dasharray","3, 3"),f.attr("class","messageLine1")):f.attr("class","messageLine0");var v="";cr.arrowMarkerAbsolute&&(v=(v=(v=window.location.protocol+"//"+window.location.host+window.location.pathname+window.location.search).replace(/\(/g,"\\(")).replace(/\)/g,"\\)")),f.attr("stroke-width",2),f.attr("stroke","none"),f.style("fill","none"),o!==Wn.parser.yy.LINETYPE.SOLID&&o!==Wn.parser.yy.LINETYPE.DOTTED||f.attr("marker-end","url("+v+"#arrowhead)"),o!==Wn.parser.yy.LINETYPE.SOLID_POINT&&o!==Wn.parser.yy.LINETYPE.DOTTED_POINT||f.attr("marker-end","url("+v+"#filled-head)"),o!==Wn.parser.yy.LINETYPE.SOLID_CROSS&&o!==Wn.parser.yy.LINETYPE.DOTTED_CROSS||f.attr("marker-end","url("+v+"#crosshead)"),(sr.showSequenceNumbers()||cr.showSequenceNumbers)&&(f.attr("marker-start","url("+v+"#sequencenumber)"),t.append("text").attr("x",n).attr("y",d+4).attr("font-family","sans-serif").attr("font-size","12px").attr("text-anchor","middle").attr("textLength","16px").attr("class","sequenceNumber").text(s)),ur.bumpVerticalPos(p),e.height+=p,e.stopy=e.starty+e.height,ur.insert(e.fromBounds,e.starty,e.toBounds,e.stopy)}(n,a),ur.models.addMessage(a)}catch(t){c.error("error while drawing message",t)}}[Wn.parser.yy.LINETYPE.SOLID_OPEN,Wn.parser.yy.LINETYPE.DOTTED_OPEN,Wn.parser.yy.LINETYPE.SOLID,Wn.parser.yy.LINETYPE.DOTTED,Wn.parser.yy.LINETYPE.SOLID_CROSS,Wn.parser.yy.LINETYPE.DOTTED_CROSS,Wn.parser.yy.LINETYPE.SOLID_POINT,Wn.parser.yy.LINETYPE.DOTTED_POINT].includes(t.type)&&l++})),cr.mirrorActors&&(ur.bumpVerticalPos(2*cr.boxMargin),dr(n,r,i,ur.getVerticalPos()));var h=ur.getBounds().bounds;c.debug("For line height fix Querying: #"+e+" .actor-line"),Object(d.selectAll)("#"+e+" .actor-line").attr("y2",h.stopy);var f=h.stopy-h.starty+2*cr.diagramMarginY;cr.mirrorActors&&(f=f-cr.boxMargin+cr.bottomMarginAdj);var p=h.stopx-h.startx+2*cr.diagramMarginX;o&&n.append("text").text(o).attr("x",(h.stopx-h.startx)/2-2*cr.diagramMarginX).attr("y",-25),W(n,f,p,cr.useMaxWidth);var g=o?40:0;n.attr("viewBox",h.startx-cr.diagramMarginX+" -"+(cr.diagramMarginY+g)+" "+p+" "+(f+g)),c.debug("models:",ur.models)}},kr=n(27),wr=n.n(kr);function Er(t){return function(t){if(Array.isArray(t)){for(var e=0,n=new Array(t.length);e<t.length;e++)n[e]=t[e];return n}}(t)||function(t){if(Symbol.iterator in Object(t)||"[object Arguments]"===Object.prototype.toString.call(t))return Array.from(t)}(t)||function(){throw new TypeError("Invalid attempt to spread non-iterable instance")}()}var Tr,Cr,Ar="",Sr="",Mr="",Or=[],Dr="",Nr=[],Br=[],Lr="",Pr=["active","done","crit","milestone"],Ir=[],Fr=!1,jr=0,Rr=function(t,e,n){return t.isoWeekday()>=6&&n.indexOf("weekends")>=0||(n.indexOf(t.format("dddd").toLowerCase())>=0||n.indexOf(t.format(e.trim()))>=0)},Yr=function(t,e,n){if(n.length&&!t.manualEndTime){var r=o()(t.startTime,e,!0);r.add(1,"d");var i=o()(t.endTime,e,!0),a=zr(r,i,e,n);t.endTime=i.toDate(),t.renderEndTime=a}},zr=function(t,e,n,r){for(var i=!1,a=null;t<=e;)i||(a=e.toDate()),(i=Rr(t,n,r))&&e.add(1,"d"),t.add(1,"d");return a},Ur=function(t,e,n){n=n.trim();var r=/^after\s+([\d\w- ]+)/.exec(n.trim());if(null!==r){var i=null;if(r[1].split(" ").forEach((function(t){var e=Xr(t);void 0!==e&&(i?e.endTime>i.endTime&&(i=e):i=e)})),i)return i.endTime;var a=new Date;return a.setHours(0,0,0,0),a}var s=o()(n,e.trim(),!0);return s.isValid()?s.toDate():(c.debug("Invalid date:"+n),c.debug("With date format:"+e.trim()),new Date)},$r=function(t,e){if(null!==t)switch(t[2]){case"s":e.add(t[1],"seconds");break;case"m":e.add(t[1],"minutes");break;case"h":e.add(t[1],"hours");break;case"d":e.add(t[1],"days");break;case"w":e.add(t[1],"weeks")}return e.toDate()},Wr=function(t,e,n,r){r=r||!1,n=n.trim();var i=o()(n,e.trim(),!0);return i.isValid()?(r&&i.add(1,"d"),i.toDate()):$r(/^([\d]+)([wdhms])/.exec(n.trim()),o()(t))},Hr=0,Vr=function(t){return void 0===t?"task"+(Hr+=1):t},Gr=[],qr={},Xr=function(t){var e=qr[t];return Gr[e]},Zr=function(){for(var t=function(t){var e=Gr[t],n="";switch(Gr[t].raw.startTime.type){case"prevTaskEnd":var r=Xr(e.prevTaskId);e.startTime=r.endTime;break;case"getStartDate":(n=Ur(0,Ar,Gr[t].raw.startTime.startData))&&(Gr[t].startTime=n)}return Gr[t].startTime&&(Gr[t].endTime=Wr(Gr[t].startTime,Ar,Gr[t].raw.endTime.data,Fr),Gr[t].endTime&&(Gr[t].processed=!0,Gr[t].manualEndTime=o()(Gr[t].raw.endTime.data,"YYYY-MM-DD",!0).isValid(),Yr(Gr[t],Ar,Or))),Gr[t].processed},e=!0,n=0;n<Gr.length;n++)t(n),e=e&&Gr[n].processed;return e},Jr=function(t,e){t.split(",").forEach((function(t){var n=Xr(t);void 0!==n&&n.classes.push(e)}))},Kr=function(t,e){Ir.push((function(){var n=document.querySelector('[id="'.concat(t,'"]'));null!==n&&n.addEventListener("click",(function(){e()}))})),Ir.push((function(){var n=document.querySelector('[id="'.concat(t,'-text"]'));null!==n&&n.addEventListener("click",(function(){e()}))}))},Qr={parseDirective:function(t,e,n){Go.parseDirective(this,t,e,n)},getConfig:function(){return _t().gantt},clear:function(){Nr=[],Br=[],Lr="",Ir=[],Dr="",Hr=0,Tr=void 0,Cr=void 0,Gr=[],Ar="",Sr="",Mr="",Or=[],Fr=!1,jr=0},setDateFormat:function(t){Ar=t},getDateFormat:function(){return Ar},enableInclusiveEndDates:function(){Fr=!0},endDatesAreInclusive:function(){return Fr},setAxisFormat:function(t){Sr=t},getAxisFormat:function(){return Sr},setTodayMarker:function(t){Mr=t},getTodayMarker:function(){return Mr},setTitle:function(t){Dr=t},getTitle:function(){return Dr},addSection:function(t){Lr=t,Nr.push(t)},getSections:function(){return Nr},getTasks:function(){for(var t=Zr(),e=0;!t&&e<10;)t=Zr(),e++;return Br=Gr},addTask:function(t,e){var n={section:Lr,type:Lr,processed:!1,manualEndTime:!1,renderEndTime:null,raw:{data:e},task:t,classes:[]},r=function(t,e){var n=(":"===e.substr(0,1)?e.substr(1,e.length):e).split(","),r={};ti(n,r,Pr);for(var i=0;i<n.length;i++)n[i]=n[i].trim();switch(n.length){case 1:r.id=Vr(),r.startTime={type:"prevTaskEnd",id:t},r.endTime={data:n[0]};break;case 2:r.id=Vr(),r.startTime={type:"getStartDate",startData:n[0]},r.endTime={data:n[1]};break;case 3:r.id=Vr(n[0]),r.startTime={type:"getStartDate",startData:n[1]},r.endTime={data:n[2]}}return r}(Cr,e);n.raw.startTime=r.startTime,n.raw.endTime=r.endTime,n.id=r.id,n.prevTaskId=Cr,n.active=r.active,n.done=r.done,n.crit=r.crit,n.milestone=r.milestone,n.order=jr,jr++;var i=Gr.push(n);Cr=n.id,qr[n.id]=i-1},findTaskById:Xr,addTaskOrg:function(t,e){var n={section:Lr,type:Lr,description:t,task:t,classes:[]},r=function(t,e){var n=(":"===e.substr(0,1)?e.substr(1,e.length):e).split(","),r={};ti(n,r,Pr);for(var i=0;i<n.length;i++)n[i]=n[i].trim();var a="";switch(n.length){case 1:r.id=Vr(),r.startTime=t.endTime,a=n[0];break;case 2:r.id=Vr(),r.startTime=Ur(0,Ar,n[0]),a=n[1];break;case 3:r.id=Vr(n[0]),r.startTime=Ur(0,Ar,n[1]),a=n[2]}return a&&(r.endTime=Wr(r.startTime,Ar,a,Fr),r.manualEndTime=o()(a,"YYYY-MM-DD",!0).isValid(),Yr(r,Ar,Or)),r}(Tr,e);n.startTime=r.startTime,n.endTime=r.endTime,n.id=r.id,n.active=r.active,n.done=r.done,n.crit=r.crit,n.milestone=r.milestone,Tr=n,Br.push(n)},setExcludes:function(t){Or=t.toLowerCase().split(/[\s,]+/)},getExcludes:function(){return Or},setClickEvent:function(t,e,n){t.split(",").forEach((function(t){!function(t,e,n){if("loose"===_t().securityLevel&&void 0!==e){var r=[];if("string"==typeof n){r=n.split(/,(?=(?:(?:[^"]*"){2})*[^"]*$)/);for(var i=0;i<r.length;i++){var a=r[i].trim();'"'===a.charAt(0)&&'"'===a.charAt(a.length-1)&&(a=a.substr(1,a.length-2)),r[i]=a}}0===r.length&&r.push(t),void 0!==Xr(t)&&Kr(t,(function(){H.runFunc.apply(H,[e].concat(Er(r)))}))}}(t,e,n)})),Jr(t,"clickable")},setLink:function(t,e){var n=e;"loose"!==_t().securityLevel&&(n=Object(g.sanitizeUrl)(e)),t.split(",").forEach((function(t){void 0!==Xr(t)&&Kr(t,(function(){window.open(n,"_self")}))})),Jr(t,"clickable")},bindFunctions:function(t){Ir.forEach((function(e){e(t)}))},durationToDate:$r};function ti(t,e,n){for(var r=!0;r;)r=!1,n.forEach((function(n){var i=new RegExp("^\\s*"+n+"\\s*$");t[0].match(i)&&(e[n]=!0,t.shift(1),r=!0)}))}kr.parser.yy=Qr;var ei,ni={titleTopMargin:25,barHeight:20,barGap:4,topPadding:50,rightPadding:75,leftPadding:75,gridLineStartPadding:35,fontSize:11,fontFamily:'"Open-Sans", "sans-serif"'},ri=function(t){Object.keys(t).forEach((function(e){ni[e]=t[e]}))},ii=function(t,e){kr.parser.yy.clear(),kr.parser.parse(t);var n=document.getElementById(e);void 0===(ei=n.parentElement.offsetWidth)&&(ei=1200),void 0!==ni.useWidth&&(ei=ni.useWidth);var r=kr.parser.yy.getTasks(),i=r.length*(ni.barHeight+ni.barGap)+2*ni.topPadding;n.setAttribute("viewBox","0 0 "+ei+" "+i);for(var a=Object(d.select)('[id="'.concat(e,'"]')),o=Object(d.scaleTime)().domain([Object(d.min)(r,(function(t){return t.startTime})),Object(d.max)(r,(function(t){return t.endTime}))]).rangeRound([0,ei-ni.leftPadding-ni.rightPadding]),s=[],c=0;c<r.length;c++)s.push(r[c].type);var u=s;function l(t){for(var e=t.length,n={};e;)n[t[--e]]=(n[t[e]]||0)+1;return n}s=function(t){for(var e={},n=[],r=0,i=t.length;r<i;++r)e.hasOwnProperty(t[r])||(e[t[r]]=!0,n.push(t[r]));return n}(s),r.sort((function(t,e){var n=t.startTime,r=e.startTime,i=0;return n>r?i=1:n<r&&(i=-1),i})),function(t,e,n){var r=ni.barHeight,i=r+ni.barGap,c=ni.topPadding,h=ni.leftPadding;Object(d.scaleLinear)().domain([0,s.length]).range(["#00B9FA","#F95002"]).interpolate(d.interpolateHcl);(function(t,e,n,r){var i=Object(d.axisBottom)(o).tickSize(-r+e+ni.gridLineStartPadding).tickFormat(Object(d.timeFormat)(kr.parser.yy.getAxisFormat()||ni.axisFormat||"%Y-%m-%d"));a.append("g").attr("class","grid").attr("transform","translate("+t+", "+(r-50)+")").call(i).selectAll("text").style("text-anchor","middle").attr("fill","#000").attr("stroke","none").attr("font-size",10).attr("dy","1em")})(h,c,0,n),function(t,e,n,r,i,c,u){a.append("g").selectAll("rect").data(t).enter().append("rect").attr("x",0).attr("y",(function(t,r){return t.order*e+n-2})).attr("width",(function(){return u-ni.rightPadding/2})).attr("height",e).attr("class",(function(t){for(var e=0;e<s.length;e++)if(t.type===s[e])return"section section"+e%ni.numberSectionStyles;return"section section0"}));var l=a.append("g").selectAll("rect").data(t).enter();l.append("rect").attr("id",(function(t){return t.id})).attr("rx",3).attr("ry",3).attr("x",(function(t){return t.milestone?o(t.startTime)+r+.5*(o(t.endTime)-o(t.startTime))-.5*i:o(t.startTime)+r})).attr("y",(function(t,r){return t.order*e+n})).attr("width",(function(t){return t.milestone?i:o(t.renderEndTime||t.endTime)-o(t.startTime)})).attr("height",i).attr("transform-origin",(function(t,a){return(o(t.startTime)+r+.5*(o(t.endTime)-o(t.startTime))).toString()+"px "+(a*e+n+.5*i).toString()+"px"})).attr("class",(function(t){var e="";t.classes.length>0&&(e=t.classes.join(" "));for(var n=0,r=0;r<s.length;r++)t.type===s[r]&&(n=r%ni.numberSectionStyles);var i="";return t.active?t.crit?i+=" activeCrit":i=" active":t.done?i=t.crit?" doneCrit":" done":t.crit&&(i+=" crit"),0===i.length&&(i=" task"),t.milestone&&(i=" milestone "+i),i+=n,"task"+(i+=" "+e)})),l.append("text").attr("id",(function(t){return t.id+"-text"})).text((function(t){return t.task})).attr("font-size",ni.fontSize).attr("x",(function(t){var e=o(t.startTime),n=o(t.renderEndTime||t.endTime);t.milestone&&(e+=.5*(o(t.endTime)-o(t.startTime))-.5*i),t.milestone&&(n=e+i);var a=this.getBBox().width;return a>n-e?n+a+1.5*ni.leftPadding>u?e+r-5:n+r+5:(n-e)/2+e+r})).attr("y",(function(t,r){return t.order*e+ni.barHeight/2+(ni.fontSize/2-2)+n})).attr("text-height",i).attr("class",(function(t){var e=o(t.startTime),n=o(t.endTime);t.milestone&&(n=e+i);var r=this.getBBox().width,a="";t.classes.length>0&&(a=t.classes.join(" "));for(var c=0,l=0;l<s.length;l++)t.type===s[l]&&(c=l%ni.numberSectionStyles);var h="";return t.active&&(h=t.crit?"activeCritText"+c:"activeText"+c),t.done?h=t.crit?h+" doneCritText"+c:h+" doneText"+c:t.crit&&(h=h+" critText"+c),t.milestone&&(h+=" milestoneText"),r>n-e?n+r+1.5*ni.leftPadding>u?a+" taskTextOutsideLeft taskTextOutside"+c+" "+h:a+" taskTextOutsideRight taskTextOutside"+c+" "+h+" width-"+r:a+" taskText taskText"+c+" "+h+" width-"+r}))}(t,i,c,h,r,0,e),function(t,e){for(var n=[],r=0,i=0;i<s.length;i++)n[i]=[s[i],(o=s[i],c=u,l(c)[o]||0)];var o,c;a.append("g").selectAll("text").data(n).enter().append((function(t){var e=t[0].split(x.lineBreakRegex),n=-(e.length-1)/2,r=document.createElementNS("http://www.w3.org/2000/svg","text");r.setAttribute("dy",n+"em");for(var i=0;i<e.length;i++){var a=document.createElementNS("http://www.w3.org/2000/svg","tspan");a.setAttribute("alignment-baseline","central"),a.setAttribute("x","10"),i>0&&a.setAttribute("dy","1em"),a.textContent=e[i],r.appendChild(a)}return r})).attr("x",10).attr("y",(function(i,a){if(!(a>0))return i[1]*t/2+e;for(var o=0;o<a;o++)return r+=n[a-1][1],i[1]*t/2+r*t+e})).attr("class",(function(t){for(var e=0;e<s.length;e++)if(t[0]===s[e])return"sectionTitle sectionTitle"+e%ni.numberSectionStyles;return"sectionTitle"}))}(i,c),function(t,e,n,r){var i=Qr.getTodayMarker();if("off"===i)return;var s=a.append("g").attr("class","today"),c=new Date,u=s.append("line");u.attr("x1",o(c)+t).attr("x2",o(c)+t).attr("y1",ni.titleTopMargin).attr("y2",r-ni.titleTopMargin).attr("class","today"),""!==i&&u.attr("style",i.replace(/,/g,";"))}(h,0,0,n)}(r,ei,i),W(a,i,ei,ni.useMaxWidth),a.append("text").text(kr.parser.yy.getTitle()).attr("x",ei/2).attr("y",ni.titleTopMargin).attr("class","titleText")},ai=n(13),oi=n.n(ai);ai.parser.yy=cn;var si={},ci={dividerMargin:10,padding:5,textHeight:10},ui=function(t){for(var e=Object.keys(si),n=0;n<e.length;n++)if(si[e[n]].label===t)return e[n]},li=function(t){Object.keys(t).forEach((function(e){ci[e]=t[e]}))},hi=function(t,e){si={},ai.parser.yy.clear(),ai.parser.parse(t),c.info("Rendering diagram "+t);var n,r=Object(d.select)("[id='".concat(e,"']"));r.attr("xmlns:xlink","http://www.w3.org/1999/xlink"),(n=r).append("defs").append("marker").attr("id","extensionStart").attr("class","extension").attr("refX",0).attr("refY",7).attr("markerWidth",190).attr("markerHeight",240).attr("orient","auto").append("path").attr("d","M 1,7 L18,13 V 1 Z"),n.append("defs").append("marker").attr("id","extensionEnd").attr("refX",19).attr("refY",7).attr("markerWidth",20).attr("markerHeight",28).attr("orient","auto").append("path").attr("d","M 1,1 V 13 L18,7 Z"),n.append("defs").append("marker").attr("id","compositionStart").attr("class","extension").attr("refX",0).attr("refY",7).attr("markerWidth",190).attr("markerHeight",240).attr("orient","auto").append("path").attr("d","M 18,7 L9,13 L1,7 L9,1 Z"),n.append("defs").append("marker").attr("id","compositionEnd").attr("refX",19).attr("refY",7).attr("markerWidth",20).attr("markerHeight",28).attr("orient","auto").append("path").attr("d","M 18,7 L9,13 L1,7 L9,1 Z"),n.append("defs").append("marker").attr("id","aggregationStart").attr("class","extension").attr("refX",0).attr("refY",7).attr("markerWidth",190).attr("markerHeight",240).attr("orient","auto").append("path").attr("d","M 18,7 L9,13 L1,7 L9,1 Z"),n.append("defs").append("marker").attr("id","aggregationEnd").attr("refX",19).attr("refY",7).attr("markerWidth",20).attr("markerHeight",28).attr("orient","auto").append("path").attr("d","M 18,7 L9,13 L1,7 L9,1 Z"),n.append("defs").append("marker").attr("id","dependencyStart").attr("class","extension").attr("refX",0).attr("refY",7).attr("markerWidth",190).attr("markerHeight",240).attr("orient","auto").append("path").attr("d","M 5,7 L9,13 L1,7 L9,1 Z"),n.append("defs").append("marker").attr("id","dependencyEnd").attr("refX",19).attr("refY",7).attr("markerWidth",20).attr("markerHeight",28).attr("orient","auto").append("path").attr("d","M 18,7 L9,13 L14,7 L9,1 Z");var i=new G.a.Graph({multigraph:!0});i.setGraph({isMultiGraph:!0}),i.setDefaultEdgeLabel((function(){return{}}));for(var a=cn.getClasses(),o=Object.keys(a),s=0;s<o.length;s++){var u=a[o[s]],l=vn(r,u,ci);si[l.id]=l,i.setNode(l.id,l),c.info("Org height: "+l.height)}cn.getRelations().forEach((function(t){c.info("tjoho"+ui(t.id1)+ui(t.id2)+JSON.stringify(t)),i.setEdge(ui(t.id1),ui(t.id2),{relation:t},t.title||"DEFAULT")})),ke.a.layout(i),i.nodes().forEach((function(t){void 0!==t&&void 0!==i.node(t)&&(c.debug("Node "+t+": "+JSON.stringify(i.node(t))),Object(d.select)("#"+en(t)).attr("transform","translate("+(i.node(t).x-i.node(t).width/2)+","+(i.node(t).y-i.node(t).height/2)+" )"))})),i.edges().forEach((function(t){void 0!==t&&void 0!==i.edge(t)&&(c.debug("Edge "+t.v+" -> "+t.w+": "+JSON.stringify(i.edge(t))),mn(r,i.edge(t),i.edge(t).relation,ci))}));var h=r.node().getBBox(),f=h.width+40,p=h.height+40;W(r,p,f,ci.useMaxWidth);var g="".concat(h.x-20," ").concat(h.y-20," ").concat(f," ").concat(p);c.debug("viewBox ".concat(g)),r.attr("viewBox",g)};ai.parser.yy=cn;var fi={dividerMargin:10,padding:5,textHeight:10},di=function(t){Object.keys(t).forEach((function(e){fi[e]=t[e]}))},pi=function(t,e){c.info("Drawing class"),cn.clear(),ai.parser.parse(t);var n=_t().flowchart;c.info("config:",n);var r=n.nodeSpacing||50,i=n.rankSpacing||50,a=new G.a.Graph({multigraph:!0,compound:!0}).setGraph({rankdir:"TD",nodesep:r,ranksep:i,marginx:8,marginy:8}).setDefaultEdgeLabel((function(){return{}})),o=cn.getClasses(),s=cn.getRelations();c.info(s),function(t,e){var n=Object.keys(t);c.info("keys:",n),c.info(t),n.forEach((function(n){var r=t[n],i="";r.cssClasses.length>0&&(i=i+" "+r.cssClasses.join(" "));var a={labelStyle:""},o=void 0!==r.text?r.text:r.id,s="";switch(r.type){case"class":s="class_box";break;default:s="class_box"}e.setNode(r.id,{labelStyle:a.labelStyle,shape:s,labelText:o,classData:r,rx:0,ry:0,class:i,style:a.style,id:r.id,domId:r.domId,haveCallback:r.haveCallback,link:r.link,width:"group"===r.type?500:void 0,type:r.type,padding:_t().flowchart.padding}),c.info("setNode",{labelStyle:a.labelStyle,shape:s,labelText:o,rx:0,ry:0,class:i,style:a.style,id:r.id,width:"group"===r.type?500:void 0,type:r.type,padding:_t().flowchart.padding})}))}(o,a),function(t,e){var n=0;t.forEach((function(r){n++;var i={classes:"relation"};i.pattern=1==r.relation.lineType?"dashed":"solid",i.id="id"+n,"arrow_open"===r.type?i.arrowhead="none":i.arrowhead="normal",c.info(i,r),i.startLabelRight="none"===r.relationTitle1?"":r.relationTitle1,i.endLabelLeft="none"===r.relationTitle2?"":r.relationTitle2,i.arrowTypeStart=gi(r.relation.type1),i.arrowTypeEnd=gi(r.relation.type2);var a="",o="";if(void 0!==r.style){var s=B(r.style);a=s.style,o=s.labelStyle}else a="fill:none";i.style=a,i.labelStyle=o,void 0!==r.interpolate?i.curve=D(r.interpolate,d.curveLinear):void 0!==t.defaultInterpolate?i.curve=D(t.defaultInterpolate,d.curveLinear):i.curve=D(fi.curve,d.curveLinear),r.text=r.title,void 0===r.text?void 0!==r.style&&(i.arrowheadStyle="fill: #333"):(i.arrowheadStyle="fill: #333",i.labelpos="c",_t().flowchart.htmlLabels,i.labelType="text",i.label=r.text.replace(x.lineBreakRegex,"\n"),void 0===r.style&&(i.style=i.style||"stroke: #333; stroke-width: 1.5px;fill:none"),i.labelStyle=i.labelStyle.replace("color:","fill:")),e.setEdge(r.id1,r.id2,i,n)}))}(s,a);var u=Object(d.select)('[id="'.concat(e,'"]'));u.attr("xmlns:xlink","http://www.w3.org/1999/xlink");var l=Object(d.select)("#"+e+" g");On(l,a,["aggregation","extension","composition","dependency"],"classDiagram",e);var h=u.node().getBBox(),f=h.width+16,p=h.height+16;if(c.debug("new ViewBox 0 0 ".concat(f," ").concat(p),"translate(".concat(8-a._label.marginx,", ").concat(8-a._label.marginy,")")),W(u,p,f,n.useMaxWidth),u.attr("viewBox","0 0 ".concat(f," ").concat(p)),u.select("g").attr("transform","translate(".concat(8-a._label.marginx,", ").concat(8-h.y,")")),!n.htmlLabels)for(var g=document.querySelectorAll('[id="'+e+'"] .edgeLabel .label'),y=0;y<g.length;y++){var v=g[y],m=v.getBBox(),b=document.createElementNS("http://www.w3.org/2000/svg","rect");b.setAttribute("rx",0),b.setAttribute("ry",0),b.setAttribute("width",m.width),b.setAttribute("height",m.height),b.setAttribute("style","fill:#e8e8e8;"),v.insertBefore(b,v.firstChild)}};function gi(t){var e;switch(t){case 0:e="aggregation";break;case 1:e="extension";break;case 2:e="composition";break;case 3:e="dependency";break;default:e="none"}return e}function yi(t){return(yi="function"==typeof Symbol&&"symbol"==typeof Symbol.iterator?function(t){return typeof t}:function(t){return t&&"function"==typeof Symbol&&t.constructor===Symbol&&t!==Symbol.prototype?"symbol":typeof t})(t)}var vi,mi=function(t){return JSON.parse(JSON.stringify(t))},bi=[],xi={root:{relations:[],states:{},documents:{}}},_i=xi.root,ki=0,wi=function(t,e,n,r,i){void 0===_i.states[t]?_i.states[t]={id:t,descriptions:[],type:e,doc:n,note:i}:(_i.states[t].doc||(_i.states[t].doc=n),_i.states[t].type||(_i.states[t].type=e)),r&&(c.info("Adding state ",t,r),"string"==typeof r&&Ci(t,r.trim()),"object"===yi(r)&&r.forEach((function(e){return Ci(t,e.trim())}))),i&&(_i.states[t].note=i)},Ei=function(){_i=(xi={root:{relations:[],states:{},documents:{}}}).root,_i=xi.root,ki=0,0,Si=[]},Ti=function(t,e,n){var r=t,i=e,a="default",o="default";"[*]"===t&&(r="start"+ ++ki,a="start"),"[*]"===e&&(i="end"+ki,o="end"),wi(r,a),wi(i,o),_i.relations.push({id1:r,id2:i,title:n})},Ci=function(t,e){var n=_i.states[t],r=e;":"===r[0]&&(r=r.substr(1).trim()),n.descriptions.push(r)},Ai=0,Si=[],Mi={parseDirective:function(t,e,n){Go.parseDirective(this,t,e,n)},getConfig:function(){return _t().state},addState:wi,clear:Ei,getState:function(t){return _i.states[t]},getStates:function(){return _i.states},getRelations:function(){return _i.relations},getClasses:function(){return Si},getDirection:function(){return"TB"},addRelation:Ti,getDividerId:function(){return"divider-id-"+ ++Ai},cleanupLabel:function(t){return":"===t.substring(0,1)?t.substr(2).trim():t.trim()},lineType:{LINE:0,DOTTED_LINE:1},relationType:{AGGREGATION:0,EXTENSION:1,COMPOSITION:2,DEPENDENCY:3},logDocuments:function(){c.info("Documents = ",xi)},getRootDoc:function(){return bi},setRootDoc:function(t){c.info("Setting root doc",t),bi=t},getRootDocV2:function(){return function t(e,n,r){if("relation"===n.stmt)t(e,n.state1,!0),t(e,n.state2,!1);else if("state"===n.stmt&&"[*]"===n.id&&(n.id=r?e.id+"_start":e.id+"_end",n.start=r),n.doc){var i=[],a=0,o=[];for(a=0;a<n.doc.length;a++)if("divider"===n.doc[a].type){var s=mi(n.doc[a]);s.doc=mi(o),i.push(s),o=[]}else o.push(n.doc[a]);if(i.length>0&&o.length>0){var c={stmt:"state",id:P(),type:"divider",doc:mi(o)};i.push(mi(c)),n.doc=i}n.doc.forEach((function(e){return t(n,e,!0)}))}}({id:"root"},{id:"root",doc:bi},!0),{id:"root",doc:bi}},extract:function(t){var e;e=t.doc?t.doc:t,c.info(e),Ei(),c.info("Extract",e),e.forEach((function(t){"state"===t.stmt&&wi(t.id,t.type,t.doc,t.description,t.note),"relation"===t.stmt&&Ti(t.state1.id,t.state2.id,t.description)}))},trimColon:function(t){return t&&":"===t[0]?t.substr(1).trim():t.trim()}},Oi=n(22),Di=n.n(Oi),Ni={},Bi=function(t,e){Ni[t]=e},Li=function(t,e){var n=t.append("text").attr("x",2*_t().state.padding).attr("y",_t().state.textHeight+1.3*_t().state.padding).attr("font-size",_t().state.fontSize).attr("class","state-title").text(e.descriptions[0]).node().getBBox(),r=n.height,i=t.append("text").attr("x",_t().state.padding).attr("y",r+.4*_t().state.padding+_t().state.dividerMargin+_t().state.textHeight).attr("class","state-description"),a=!0,o=!0;e.descriptions.forEach((function(t){a||(!function(t,e,n){var r=t.append("tspan").attr("x",2*_t().state.padding).text(e);n||r.attr("dy",_t().state.textHeight)}(i,t,o),o=!1),a=!1}));var s=t.append("line").attr("x1",_t().state.padding).attr("y1",_t().state.padding+r+_t().state.dividerMargin/2).attr("y2",_t().state.padding+r+_t().state.dividerMargin/2).attr("class","descr-divider"),c=i.node().getBBox(),u=Math.max(c.width,n.width);return s.attr("x2",u+3*_t().state.padding),t.insert("rect",":first-child").attr("x",_t().state.padding).attr("y",_t().state.padding).attr("width",u+2*_t().state.padding).attr("height",c.height+r+2*_t().state.padding).attr("rx",_t().state.radius),t},Pi=function(t,e,n){var r,i=_t().state.padding,a=2*_t().state.padding,o=t.node().getBBox(),s=o.width,c=o.x,u=t.append("text").attr("x",0).attr("y",_t().state.titleShift).attr("font-size",_t().state.fontSize).attr("class","state-title").text(e.id),l=u.node().getBBox().width+a,h=Math.max(l,s);h===s&&(h+=a);var f=t.node().getBBox();e.doc,r=c-i,l>s&&(r=(s-h)/2+i),Math.abs(c-f.x)<i&&l>s&&(r=c-(l-s)/2);var d=1-_t().state.textHeight;return t.insert("rect",":first-child").attr("x",r).attr("y",d).attr("class",n?"alt-composit":"composit").attr("width",h).attr("height",f.height+_t().state.textHeight+_t().state.titleShift+1).attr("rx","0"),u.attr("x",r+i),l<=s&&u.attr("x",c+(h-a)/2-l/2+i),t.insert("rect",":first-child").attr("x",r).attr("y",_t().state.titleShift-_t().state.textHeight-_t().state.padding).attr("width",h).attr("height",3*_t().state.textHeight).attr("rx",_t().state.radius),t.insert("rect",":first-child").attr("x",r).attr("y",_t().state.titleShift-_t().state.textHeight-_t().state.padding).attr("width",h).attr("height",f.height+3+2*_t().state.textHeight).attr("rx",_t().state.radius),t},Ii=function(t,e){e.attr("class","state-note");var n=e.append("rect").attr("x",0).attr("y",_t().state.padding),r=function(t,e,n,r){var i=0,a=r.append("text");a.style("text-anchor","start"),a.attr("class","noteText");var o=t.replace(/\r\n/g,"<br/>"),s=(o=o.replace(/\n/g,"<br/>")).split(x.lineBreakRegex),c=1.25*_t().state.noteMargin,u=!0,l=!1,h=void 0;try{for(var f,d=s[Symbol.iterator]();!(u=(f=d.next()).done);u=!0){var p=f.value.trim();if(p.length>0){var g=a.append("tspan");if(g.text(p),0===c)c+=g.node().getBBox().height;i+=c,g.attr("x",e+_t().state.noteMargin),g.attr("y",n+i+1.25*_t().state.noteMargin)}}}catch(t){l=!0,h=t}finally{try{u||null==d.return||d.return()}finally{if(l)throw h}}return{textWidth:a.node().getBBox().width,textHeight:i}}(t,0,0,e.append("g")),i=r.textWidth,a=r.textHeight;return n.attr("height",a+2*_t().state.noteMargin),n.attr("width",i+2*_t().state.noteMargin),n},Fi=function(t,e){var n=e.id,r={id:n,label:e.id,width:0,height:0},i=t.append("g").attr("id",n).attr("class","stateGroup");"start"===e.type&&function(t){t.append("circle").attr("class","start-state").attr("r",_t().state.sizeUnit).attr("cx",_t().state.padding+_t().state.sizeUnit).attr("cy",_t().state.padding+_t().state.sizeUnit)}(i),"end"===e.type&&function(t){t.append("circle").attr("class","end-state-outer").attr("r",_t().state.sizeUnit+_t().state.miniPadding).attr("cx",_t().state.padding+_t().state.sizeUnit+_t().state.miniPadding).attr("cy",_t().state.padding+_t().state.sizeUnit+_t().state.miniPadding),t.append("circle").attr("class","end-state-inner").attr("r",_t().state.sizeUnit).attr("cx",_t().state.padding+_t().state.sizeUnit+2).attr("cy",_t().state.padding+_t().state.sizeUnit+2)}(i),"fork"!==e.type&&"join"!==e.type||function(t,e){var n=_t().state.forkWidth,r=_t().state.forkHeight;if(e.parentId){var i=n;n=r,r=i}t.append("rect").style("stroke","black").style("fill","black").attr("width",n).attr("height",r).attr("x",_t().state.padding).attr("y",_t().state.padding)}(i,e),"note"===e.type&&Ii(e.note.text,i),"divider"===e.type&&function(t){t.append("line").style("stroke","grey").style("stroke-dasharray","3").attr("x1",_t().state.textHeight).attr("class","divider").attr("x2",2*_t().state.textHeight).attr("y1",0).attr("y2",0)}(i),"default"===e.type&&0===e.descriptions.length&&function(t,e){var n=t.append("text").attr("x",2*_t().state.padding).attr("y",_t().state.textHeight+2*_t().state.padding).attr("font-size",_t().state.fontSize).attr("class","state-title").text(e.id),r=n.node().getBBox();t.insert("rect",":first-child").attr("x",_t().state.padding).attr("y",_t().state.padding).attr("width",r.width+2*_t().state.padding).attr("height",r.height+2*_t().state.padding).attr("rx",_t().state.radius)}(i,e),"default"===e.type&&e.descriptions.length>0&&Li(i,e);var a=i.node().getBBox();return r.width=a.width+2*_t().state.padding,r.height=a.height+2*_t().state.padding,Bi(n,r),r},ji=0;Oi.parser.yy=Mi;var Ri={},Yi=function t(e,n,r,i){var a,o=new G.a.Graph({compound:!0,multigraph:!0}),s=!0;for(a=0;a<e.length;a++)if("relation"===e[a].stmt){s=!1;break}r?o.setGraph({rankdir:"LR",multigraph:!0,compound:!0,ranker:"tight-tree",ranksep:s?1:vi.edgeLengthFactor,nodeSep:s?1:50,isMultiGraph:!0}):o.setGraph({rankdir:"TB",multigraph:!0,compound:!0,ranksep:s?1:vi.edgeLengthFactor,nodeSep:s?1:50,ranker:"tight-tree",isMultiGraph:!0}),o.setDefaultEdgeLabel((function(){return{}})),Mi.extract(e);for(var u=Mi.getStates(),l=Mi.getRelations(),h=Object.keys(u),f=0;f<h.length;f++){var p=u[h[f]];r&&(p.parentId=r);var g=void 0;if(p.doc){var y=n.append("g").attr("id",p.id).attr("class","stateGroup");g=t(p.doc,y,p.id,!i);var v=(y=Pi(y,p,i)).node().getBBox();g.width=v.width,g.height=v.height+vi.padding/2,Ri[p.id]={y:vi.compositTitleSize}}else g=Fi(n,p);if(p.note){var m={descriptions:[],id:p.id+"-note",note:p.note,type:"note"},b=Fi(n,m);"left of"===p.note.position?(o.setNode(g.id+"-note",b),o.setNode(g.id,g)):(o.setNode(g.id,g),o.setNode(g.id+"-note",b)),o.setParent(g.id,g.id+"-group"),o.setParent(g.id+"-note",g.id+"-group")}else o.setNode(g.id,g)}c.debug("Count=",o.nodeCount(),o);var _=0;l.forEach((function(t){var e;_++,c.debug("Setting edge",t),o.setEdge(t.id1,t.id2,{relation:t,width:(e=t.title,e?e.length*vi.fontSizeFactor:1),height:vi.labelHeight*x.getRows(t.title).length,labelpos:"c"},"id"+_)})),ke.a.layout(o),c.debug("Graph after layout",o.nodes());var k=n.node();o.nodes().forEach((function(t){void 0!==t&&void 0!==o.node(t)?(c.warn("Node "+t+": "+JSON.stringify(o.node(t))),Object(d.select)("#"+k.id+" #"+t).attr("transform","translate("+(o.node(t).x-o.node(t).width/2)+","+(o.node(t).y+(Ri[t]?Ri[t].y:0)-o.node(t).height/2)+" )"),Object(d.select)("#"+k.id+" #"+t).attr("data-x-shift",o.node(t).x-o.node(t).width/2),document.querySelectorAll("#"+k.id+" #"+t+" .divider").forEach((function(t){var e=t.parentElement,n=0,r=0;e&&(e.parentElement&&(n=e.parentElement.getBBox().width),r=parseInt(e.getAttribute("data-x-shift"),10),Number.isNaN(r)&&(r=0)),t.setAttribute("x1",0-r+8),t.setAttribute("x2",n-r-8)}))):c.debug("No Node "+t+": "+JSON.stringify(o.node(t)))}));var w=k.getBBox();o.edges().forEach((function(t){void 0!==t&&void 0!==o.edge(t)&&(c.debug("Edge "+t.v+" -> "+t.w+": "+JSON.stringify(o.edge(t))),function(t,e,n){e.points=e.points.filter((function(t){return!Number.isNaN(t.y)}));var r=e.points,i=Object(d.line)().x((function(t){return t.x})).y((function(t){return t.y})).curve(d.curveBasis),a=t.append("path").attr("d",i(r)).attr("id","edge"+ji).attr("class","transition"),o="";if(_t().state.arrowMarkerAbsolute&&(o=(o=(o=window.location.protocol+"//"+window.location.host+window.location.pathname+window.location.search).replace(/\(/g,"\\(")).replace(/\)/g,"\\)")),a.attr("marker-end","url("+o+"#"+function(t){switch(t){case Mi.relationType.AGGREGATION:return"aggregation";case Mi.relationType.EXTENSION:return"extension";case Mi.relationType.COMPOSITION:return"composition";case Mi.relationType.DEPENDENCY:return"dependency"}}(Mi.relationType.DEPENDENCY)+"End)"),void 0!==n.title){for(var s=t.append("g").attr("class","stateLabel"),u=H.calcLabelPosition(e.points),l=u.x,h=u.y,f=x.getRows(n.title),p=0,g=[],y=0,v=0,m=0;m<=f.length;m++){var b=s.append("text").attr("text-anchor","middle").text(f[m]).attr("x",l).attr("y",h+p),_=b.node().getBBox();if(y=Math.max(y,_.width),v=Math.min(v,_.x),c.info(_.x,l,h+p),0===p){var k=b.node().getBBox();p=k.height,c.info("Title height",p,h)}g.push(b)}var w=p*f.length;if(f.length>1){var E=(f.length-1)*p*.5;g.forEach((function(t,e){return t.attr("y",h+e*p-E)})),w=p*f.length}var T=s.node().getBBox();s.insert("rect",":first-child").attr("class","box").attr("x",l-y/2-_t().state.padding/2).attr("y",h-w/2-_t().state.padding/2-3.5).attr("width",y+_t().state.padding).attr("height",w+_t().state.padding),c.info(T)}ji++}(n,o.edge(t),o.edge(t).relation))})),w=k.getBBox();var E={id:r||"root",label:r||"root",width:0,height:0};return E.width=w.width+2*vi.padding,E.height=w.height+2*vi.padding,c.debug("Doc rendered",E,o),E},zi=function(){},Ui=function(t,e){vi=_t().state,Oi.parser.yy.clear(),Oi.parser.parse(t),c.debug("Rendering diagram "+t);var n=Object(d.select)("[id='".concat(e,"']"));n.append("defs").append("marker").attr("id","dependencyEnd").attr("refX",19).attr("refY",7).attr("markerWidth",20).attr("markerHeight",28).attr("orient","auto").append("path").attr("d","M 19,7 L9,13 L14,7 L9,1 Z"),new G.a.Graph({multigraph:!0,compound:!0,rankdir:"RL"}).setDefaultEdgeLabel((function(){return{}}));var r=Mi.getRootDoc();Yi(r,n,void 0,!1);var i=vi.padding,a=n.node().getBBox(),o=a.width+2*i,s=a.height+2*i;W(n,s,1.75*o,vi.useMaxWidth),n.attr("viewBox","".concat(a.x-vi.padding," ").concat(a.y-vi.padding," ")+o+" "+s)},$i={},Wi={},Hi=function(t,e,n,r){if("root"!==n.id){var i="rect";!0===n.start&&(i="start"),!1===n.start&&(i="end"),"default"!==n.type&&(i=n.type),Wi[n.id]||(Wi[n.id]={id:n.id,shape:i,description:n.id,classes:"statediagram-state"}),n.description&&(Array.isArray(Wi[n.id].description)?(Wi[n.id].shape="rectWithTitle",Wi[n.id].description.push(n.description)):Wi[n.id].description.length>0?(Wi[n.id].shape="rectWithTitle",Wi[n.id].description===n.id?Wi[n.id].description=[n.description]:Wi[n.id].description=[Wi[n.id].description,n.description]):(Wi[n.id].shape="rect",Wi[n.id].description=n.description)),!Wi[n.id].type&&n.doc&&(c.info("Setting cluser for ",n.id),Wi[n.id].type="group",Wi[n.id].shape="divider"===n.type?"divider":"roundedWithTitle",Wi[n.id].classes=Wi[n.id].classes+" "+(r?"statediagram-cluster statediagram-cluster-alt":"statediagram-cluster"));var a={labelStyle:"",shape:Wi[n.id].shape,labelText:Wi[n.id].description,classes:Wi[n.id].classes,style:"",id:n.id,domId:"state-"+n.id+"-"+Vi,type:Wi[n.id].type,padding:15};if(n.note){var o={labelStyle:"",shape:"note",labelText:n.note.text,classes:"statediagram-note",style:"",id:n.id+"----note",domId:"state-"+n.id+"----note-"+Vi,type:Wi[n.id].type,padding:15},s={labelStyle:"",shape:"noteGroup",labelText:n.note.text,classes:Wi[n.id].classes,style:"",id:n.id+"----parent",domId:"state-"+n.id+"----parent-"+Vi,type:"group",padding:0};Vi++,t.setNode(n.id+"----parent",s),t.setNode(o.id,o),t.setNode(n.id,a),t.setParent(n.id,n.id+"----parent"),t.setParent(o.id,n.id+"----parent");var u=n.id,l=o.id;"left of"===n.note.position&&(u=o.id,l=n.id),t.setEdge(u,l,{arrowhead:"none",arrowType:"",style:"fill:none",labelStyle:"",classes:"transition note-edge",arrowheadStyle:"fill: #333",labelpos:"c",labelType:"text",thickness:"normal"})}else t.setNode(n.id,a)}e&&"root"!==e.id&&(c.info("Setting node ",n.id," to be child of its parent ",e.id),t.setParent(n.id,e.id)),n.doc&&(c.info("Adding nodes children "),Gi(t,n,n.doc,!r))},Vi=0,Gi=function(t,e,n,r){Vi=0,c.trace("items",n),n.forEach((function(n){if("state"===n.stmt||"default"===n.stmt)Hi(t,e,n,r);else if("relation"===n.stmt){Hi(t,e,n.state1,r),Hi(t,e,n.state2,r);var i={id:"edge"+Vi,arrowhead:"normal",arrowTypeEnd:"arrow_barb",style:"fill:none",labelStyle:"",label:n.description,arrowheadStyle:"fill: #333",labelpos:"c",labelType:"text",thickness:"normal",classes:"transition"},a=n.state1.id,o=n.state2.id;t.setEdge(a,o,i,Vi),Vi++}}))},qi=function(t){for(var e=Object.keys(t),n=0;n<e.length;n++)$i[e[n]]=t[e[n]]},Xi=function(t,e){c.info("Drawing state diagram (v2)",e),Mi.clear(),Wi={};var n=Di.a.parser;n.yy=Mi,n.parse(t);var r=Mi.getDirection();void 0===r&&(r="LR");var i=_t().state,a=i.nodeSpacing||50,o=i.rankSpacing||50,s=new G.a.Graph({multigraph:!0,compound:!0}).setGraph({rankdir:"TB",nodesep:a,ranksep:o,marginx:8,marginy:8}).setDefaultEdgeLabel((function(){return{}}));c.info(Mi.getRootDocV2()),Mi.extract(Mi.getRootDocV2()),c.info(Mi.getRootDocV2()),Hi(s,void 0,Mi.getRootDocV2(),!0);var u=Object(d.select)('[id="'.concat(e,'"]')),l=Object(d.select)("#"+e+" g");On(l,s,["barb"],"statediagram",e);var h=u.node().getBBox(),f=h.width+16,p=h.height+16;u.attr("class","statediagram");var g=u.node().getBBox();W(u,p,1.75*f,i.useMaxWidth);var y="".concat(g.x-8," ").concat(g.y-8," ").concat(f," ").concat(p);if(c.debug("viewBox ".concat(y)),u.attr("viewBox",y),!i.htmlLabels)for(var v=document.querySelectorAll('[id="'+e+'"] .edgeLabel .label'),m=0;m<v.length;m++){var b=v[m],x=b.getBBox(),_=document.createElementNS("http://www.w3.org/2000/svg","rect");_.setAttribute("rx",0),_.setAttribute("ry",0),_.setAttribute("width",x.width),_.setAttribute("height",x.height),b.insertBefore(_,b.firstChild)}},Zi={},Ji=null,Ki={master:Ji},Qi="master",ta="LR",ea=0;function na(){return I({length:7})}function ra(t,e){for(c.debug("Entering isfastforwardable:",t.id,e.id);t.seq<=e.seq&&t!==e&&null!=e.parent;){if(Array.isArray(e.parent))return c.debug("In merge commit:",e.parent),ra(t,Zi[e.parent[0]])||ra(t,Zi[e.parent[1]]);e=Zi[e.parent]}return c.debug(t.id,e.id),t.id===e.id}var ia={};function aa(t,e,n){var r=t.indexOf(e);-1===r?t.push(n):t.splice(r,1,n)}function oa(t){var e=t.reduce((function(t,e){return t.seq>e.seq?t:e}),t[0]),n="";t.forEach((function(t){n+=t===e?"\t*":"\t|"}));var r,i,a,o=[n,e.id,e.seq];for(var s in Ki)Ki[s]===e.id&&o.push(s);if(c.debug(o.join(" ")),Array.isArray(e.parent)){var u=Zi[e.parent[0]];aa(t,e,u),t.push(Zi[e.parent[1]])}else{if(null==e.parent)return;var l=Zi[e.parent];aa(t,e,l)}r=t,i=function(t){return t.id},a=Object.create(null),oa(t=r.reduce((function(t,e){var n=i(e);return a[n]||(a[n]=!0,t.push(e)),t}),[]))}var sa,ca=function(){var t=Object.keys(Zi).map((function(t){return Zi[t]}));return t.forEach((function(t){c.debug(t.id)})),t.sort((function(t,e){return e.seq-t.seq})),t},ua={setDirection:function(t){ta=t},setOptions:function(t){c.debug("options str",t),t=(t=t&&t.trim())||"{}";try{ia=JSON.parse(t)}catch(t){c.error("error while parsing gitGraph options",t.message)}},getOptions:function(){return ia},commit:function(t){var e={id:na(),message:t,seq:ea++,parent:null==Ji?null:Ji.id};Ji=e,Zi[e.id]=e,Ki[Qi]=e.id,c.debug("in pushCommit "+e.id)},branch:function(t){Ki[t]=null!=Ji?Ji.id:null,c.debug("in createBranch")},merge:function(t){var e=Zi[Ki[Qi]],n=Zi[Ki[t]];if(function(t,e){return t.seq>e.seq&&ra(e,t)}(e,n))c.debug("Already merged");else{if(ra(e,n))Ki[Qi]=Ki[t],Ji=Zi[Ki[Qi]];else{var r={id:na(),message:"merged branch "+t+" into "+Qi,seq:ea++,parent:[null==Ji?null:Ji.id,Ki[t]]};Ji=r,Zi[r.id]=r,Ki[Qi]=r.id}c.debug(Ki),c.debug("in mergeBranch")}},checkout:function(t){c.debug("in checkout");var e=Ki[Qi=t];Ji=Zi[e]},reset:function(t){c.debug("in reset",t);var e=t.split(":")[0],n=parseInt(t.split(":")[1]),r="HEAD"===e?Ji:Zi[Ki[e]];for(c.debug(r,n);n>0;)if(n--,!(r=Zi[r.parent])){var i="Critical error - unique parent commit not found during reset";throw c.error(i),i}Ji=r,Ki[Qi]=r.id},prettyPrint:function(){c.debug(Zi),oa([ca()[0]])},clear:function(){Zi={},Ki={master:Ji=null},Qi="master",ea=0},getBranchesAsObjArray:function(){var t=[];for(var e in Ki)t.push({name:e,commit:Zi[Ki[e]]});return t},getBranches:function(){return Ki},getCommits:function(){return Zi},getCommitsArray:ca,getCurrentBranch:function(){return Qi},getDirection:function(){return ta},getHead:function(){return Ji}},la=n(71),ha=n.n(la),fa={},da={nodeSpacing:150,nodeFillColor:"yellow",nodeStrokeWidth:2,nodeStrokeColor:"grey",lineStrokeWidth:4,branchOffset:50,lineColor:"grey",leftMargin:50,branchColors:["#442f74","#983351","#609732","#AA9A39"],nodeRadius:10,nodeLabel:{width:75,height:100,x:-25,y:0}},pa={};function ga(t,e,n,r){var i=D(r,d.curveBasis),a=da.branchColors[n%da.branchColors.length],o=Object(d.line)().x((function(t){return Math.round(t.x)})).y((function(t){return Math.round(t.y)})).curve(i);t.append("svg:path").attr("d",o(e)).style("stroke",a).style("stroke-width",da.lineStrokeWidth).style("fill","none")}function ya(t,e){e=e||t.node().getBBox();var n=t.node().getCTM();return{left:n.e+e.x*n.a,top:n.f+e.y*n.d,width:e.width,height:e.height}}function va(t,e,n,r,i){c.debug("svgDrawLineForCommits: ",e,n);var a=ya(t.select("#node-"+e+" circle")),o=ya(t.select("#node-"+n+" circle"));switch(r){case"LR":if(a.left-o.left>da.nodeSpacing){var s={x:a.left-da.nodeSpacing,y:o.top+o.height/2};ga(t,[s,{x:o.left+o.width,y:o.top+o.height/2}],i,"linear"),ga(t,[{x:a.left,y:a.top+a.height/2},{x:a.left-da.nodeSpacing/2,y:a.top+a.height/2},{x:a.left-da.nodeSpacing/2,y:s.y},s],i)}else ga(t,[{x:a.left,y:a.top+a.height/2},{x:a.left-da.nodeSpacing/2,y:a.top+a.height/2},{x:a.left-da.nodeSpacing/2,y:o.top+o.height/2},{x:o.left+o.width,y:o.top+o.height/2}],i);break;case"BT":if(o.top-a.top>da.nodeSpacing){var u={x:o.left+o.width/2,y:a.top+a.height+da.nodeSpacing};ga(t,[u,{x:o.left+o.width/2,y:o.top}],i,"linear"),ga(t,[{x:a.left+a.width/2,y:a.top+a.height},{x:a.left+a.width/2,y:a.top+a.height+da.nodeSpacing/2},{x:o.left+o.width/2,y:u.y-da.nodeSpacing/2},u],i)}else ga(t,[{x:a.left+a.width/2,y:a.top+a.height},{x:a.left+a.width/2,y:a.top+da.nodeSpacing/2},{x:o.left+o.width/2,y:o.top-da.nodeSpacing/2},{x:o.left+o.width/2,y:o.top}],i)}}function ma(t,e){return t.select(e).node().cloneNode(!0)}function ba(t,e,n,r){var i,a=Object.keys(fa).length;if("string"==typeof e)do{if(i=fa[e],c.debug("in renderCommitHistory",i.id,i.seq),t.select("#node-"+e).size()>0)return;t.append((function(){return ma(t,"#def-commit")})).attr("class","commit").attr("id",(function(){return"node-"+i.id})).attr("transform",(function(){switch(r){case"LR":return"translate("+(i.seq*da.nodeSpacing+da.leftMargin)+", "+sa*da.branchOffset+")";case"BT":return"translate("+(sa*da.branchOffset+da.leftMargin)+", "+(a-i.seq)*da.nodeSpacing+")"}})).attr("fill",da.nodeFillColor).attr("stroke",da.nodeStrokeColor).attr("stroke-width",da.nodeStrokeWidth);var o=void 0;for(var s in n)if(n[s].commit===i){o=n[s];break}o&&(c.debug("found branch ",o.name),t.select("#node-"+i.id+" p").append("xhtml:span").attr("class","branch-label").text(o.name+", ")),t.select("#node-"+i.id+" p").append("xhtml:span").attr("class","commit-id").text(i.id),""!==i.message&&"BT"===r&&t.select("#node-"+i.id+" p").append("xhtml:span").attr("class","commit-msg").text(", "+i.message),e=i.parent}while(e&&fa[e]);Array.isArray(e)&&(c.debug("found merge commmit",e),ba(t,e[0],n,r),sa++,ba(t,e[1],n,r),sa--)}function xa(t,e,n,r){for(r=r||0;e.seq>0&&!e.lineDrawn;)"string"==typeof e.parent?(va(t,e.id,e.parent,n,r),e.lineDrawn=!0,e=fa[e.parent]):Array.isArray(e.parent)&&(va(t,e.id,e.parent[0],n,r),va(t,e.id,e.parent[1],n,r+1),xa(t,fa[e.parent[1]],n,r+1),e.lineDrawn=!0,e=fa[e.parent[0]])}var _a,ka=function(t){pa=t},wa=function(t,e,n){try{var r=ha.a.parser;r.yy=ua,r.yy.clear(),c.debug("in gitgraph renderer",t+"\n","id:",e,n),r.parse(t+"\n"),da=Object.assign(da,pa,ua.getOptions()),c.debug("effective options",da);var i=ua.getDirection();fa=ua.getCommits();var a=ua.getBranchesAsObjArray();"BT"===i&&(da.nodeLabel.x=a.length*da.branchOffset,da.nodeLabel.width="100%",da.nodeLabel.y=-2*da.nodeRadius);var o=Object(d.select)('[id="'.concat(e,'"]'));for(var s in function(t){t.append("defs").append("g").attr("id","def-commit").append("circle").attr("r",da.nodeRadius).attr("cx",0).attr("cy",0),t.select("#def-commit").append("foreignObject").attr("width",da.nodeLabel.width).attr("height",da.nodeLabel.height).attr("x",da.nodeLabel.x).attr("y",da.nodeLabel.y).attr("class","node-label").attr("requiredFeatures","http://www.w3.org/TR/SVG11/feature#Extensibility").append("p").html("")}(o),sa=1,a){var u=a[s];ba(o,u.commit.id,a,i),xa(o,u.commit,i),sa++}o.attr("height",(function(){return"BT"===i?Object.keys(fa).length*da.nodeSpacing:(a.length+1)*da.branchOffset}))}catch(t){c.error("Error while rendering gitgraph"),c.error(t.message)}},Ea="",Ta=!1,Ca={setMessage:function(t){c.debug("Setting message to: "+t),Ea=t},getMessage:function(){return Ea},setInfo:function(t){Ta=t},getInfo:function(){return Ta}},Aa=n(72),Sa=n.n(Aa),Ma={},Oa=function(t){Object.keys(t).forEach((function(e){Ma[e]=t[e]}))},Da=function(t,e,n){try{var r=Sa.a.parser;r.yy=Ca,c.debug("Renering info diagram\n"+t),r.parse(t),c.debug("Parsed info diagram");var i=Object(d.select)("#"+e);i.append("g").append("text").attr("x",100).attr("y",40).attr("class","version").attr("font-size","32px").style("text-anchor","middle").text("v "+n),i.attr("height",100),i.attr("width",400)}catch(t){c.error("Error while rendering info diagram"),c.error(t.message)}},Na={},Ba=function(t){Object.keys(t).forEach((function(e){Na[e]=t[e]}))},La=function(t,e){try{c.debug("Renering svg for syntax error\n");var n=Object(d.select)("#"+t),r=n.append("g");r.append("path").attr("class","error-icon").attr("d","m411.313,123.313c6.25-6.25 6.25-16.375 0-22.625s-16.375-6.25-22.625,0l-32,32-9.375,9.375-20.688-20.688c-12.484-12.5-32.766-12.5-45.25,0l-16,16c-1.261,1.261-2.304,2.648-3.31,4.051-21.739-8.561-45.324-13.426-70.065-13.426-105.867,0-192,86.133-192,192s86.133,192 192,192 192-86.133 192-192c0-24.741-4.864-48.327-13.426-70.065 1.402-1.007 2.79-2.049 4.051-3.31l16-16c12.5-12.492 12.5-32.758 0-45.25l-20.688-20.688 9.375-9.375 32.001-31.999zm-219.313,100.687c-52.938,0-96,43.063-96,96 0,8.836-7.164,16-16,16s-16-7.164-16-16c0-70.578 57.422-128 128-128 8.836,0 16,7.164 16,16s-7.164,16-16,16z"),r.append("path").attr("class","error-icon").attr("d","m459.02,148.98c-6.25-6.25-16.375-6.25-22.625,0s-6.25,16.375 0,22.625l16,16c3.125,3.125 7.219,4.688 11.313,4.688 4.094,0 8.188-1.563 11.313-4.688 6.25-6.25 6.25-16.375 0-22.625l-16.001-16z"),r.append("path").attr("class","error-icon").attr("d","m340.395,75.605c3.125,3.125 7.219,4.688 11.313,4.688 4.094,0 8.188-1.563 11.313-4.688 6.25-6.25 6.25-16.375 0-22.625l-16-16c-6.25-6.25-16.375-6.25-22.625,0s-6.25,16.375 0,22.625l15.999,16z"),r.append("path").attr("class","error-icon").attr("d","m400,64c8.844,0 16-7.164 16-16v-32c0-8.836-7.156-16-16-16-8.844,0-16,7.164-16,16v32c0,8.836 7.156,16 16,16z"),r.append("path").attr("class","error-icon").attr("d","m496,96.586h-32c-8.844,0-16,7.164-16,16 0,8.836 7.156,16 16,16h32c8.844,0 16-7.164 16-16 0-8.836-7.156-16-16-16z"),r.append("path").attr("class","error-icon").attr("d","m436.98,75.605c3.125,3.125 7.219,4.688 11.313,4.688 4.094,0 8.188-1.563 11.313-4.688l32-32c6.25-6.25 6.25-16.375 0-22.625s-16.375-6.25-22.625,0l-32,32c-6.251,6.25-6.251,16.375-0.001,22.625z"),r.append("text").attr("class","error-text").attr("x",1240).attr("y",250).attr("font-size","150px").style("text-anchor","middle").text("Syntax error in graph"),r.append("text").attr("class","error-text").attr("x",1050).attr("y",400).attr("font-size","100px").style("text-anchor","middle").text("mermaid version "+e),n.attr("height",100),n.attr("width",400),n.attr("viewBox","768 0 512 512")}catch(t){c.error("Error while rendering info diagram"),c.error(t.message)}},Pa={},Ia="",Fa={parseDirective:function(t,e,n){Go.parseDirective(this,t,e,n)},getConfig:function(){return _t().pie},addSection:function(t,e){void 0===Pa[t]&&(Pa[t]=e,c.debug("Added new section :",t))},getSections:function(){return Pa},cleanupValue:function(t){return":"===t.substring(0,1)?(t=t.substring(1).trim(),Number(t.trim())):Number(t.trim())},clear:function(){Pa={},Ia=""},setTitle:function(t){Ia=t},getTitle:function(){return Ia}},ja=n(73),Ra=n.n(ja),Ya={},za=function(t){Object.keys(t).forEach((function(e){Ya[e]=t[e]}))},Ua=function(t,e){try{var n=Ra.a.parser;n.yy=Fa,c.debug("Rendering info diagram\n"+t),n.yy.clear(),n.parse(t),c.debug("Parsed info diagram");var r=document.getElementById(e);void 0===(_a=r.parentElement.offsetWidth)&&(_a=1200),void 0!==Ya.useWidth&&(_a=Ya.useWidth);var i=Object(d.select)("#"+e);W(i,450,_a,Ya.useMaxWidth),r.setAttribute("viewBox","0 0 "+_a+" 450");var a=Math.min(_a,450)/2-40,o=i.append("g").attr("transform","translate("+_a/2+",225)"),s=Fa.getSections(),u=0;Object.keys(s).forEach((function(t){u+=s[t]}));var l=Object(d.scaleOrdinal)().domain(s).range(d.schemeSet2),h=Object(d.pie)().value((function(t){return t.value}))(Object(d.entries)(s)),f=Object(d.arc)().innerRadius(0).outerRadius(a);o.selectAll("mySlices").data(h).enter().append("path").attr("d",f).attr("fill",(function(t){return l(t.data.key)})).attr("stroke","black").style("stroke-width","2px").style("opacity",.7),o.selectAll("mySlices").data(h.filter((function(t){return 0!==t.data.value}))).enter().append("text").text((function(t){return(t.data.value/u*100).toFixed(0)+"%"})).attr("transform",(function(t){return"translate("+f.centroid(t)+")"})).style("text-anchor","middle").attr("class","slice").style("font-size",17),o.append("text").text(n.yy.getTitle()).attr("x",0).attr("y",-200).attr("class","pieTitleText");var p=o.selectAll(".legend").data(l.domain()).enter().append("g").attr("class","legend").attr("transform",(function(t,e){return"translate(216,"+(22*e-22*l.domain().length/2)+")"}));p.append("rect").attr("width",18).attr("height",18).style("fill",l).style("stroke",l),p.append("text").attr("x",22).attr("y",14).text((function(t){return t}))}catch(t){c.error("Error while rendering info diagram"),c.error(t)}},$a={},Wa=[],Ha="",Va=function(t){return void 0===$a[t]&&($a[t]={attributes:[]},c.info("Added new entity :",t)),$a[t]},Ga={Cardinality:{ZERO_OR_ONE:"ZERO_OR_ONE",ZERO_OR_MORE:"ZERO_OR_MORE",ONE_OR_MORE:"ONE_OR_MORE",ONLY_ONE:"ONLY_ONE"},Identification:{NON_IDENTIFYING:"NON_IDENTIFYING",IDENTIFYING:"IDENTIFYING"},parseDirective:function(t,e,n){Go.parseDirective(this,t,e,n)},getConfig:function(){return _t().er},addEntity:Va,addAttributes:function(t,e){var n,r=Va(t);for(n=e.length-1;n>=0;n--)r.attributes.push(e[n]),c.debug("Added attribute ",e[n].attributeName)},getEntities:function(){return $a},addRelationship:function(t,e,n,r){var i={entityA:t,roleA:e,entityB:n,relSpec:r};Wa.push(i),c.debug("Added new relationship :",i)},getRelationships:function(){return Wa},clear:function(){$a={},Wa=[],Ha=""},setTitle:function(t){Ha=t},getTitle:function(){return Ha}},qa=n(74),Xa=n.n(qa),Za={ONLY_ONE_START:"ONLY_ONE_START",ONLY_ONE_END:"ONLY_ONE_END",ZERO_OR_ONE_START:"ZERO_OR_ONE_START",ZERO_OR_ONE_END:"ZERO_OR_ONE_END",ONE_OR_MORE_START:"ONE_OR_MORE_START",ONE_OR_MORE_END:"ONE_OR_MORE_END",ZERO_OR_MORE_START:"ZERO_OR_MORE_START",ZERO_OR_MORE_END:"ZERO_OR_MORE_END"},Ja=Za,Ka=function(t,e){var n;t.append("defs").append("marker").attr("id",Za.ONLY_ONE_START).attr("refX",0).attr("refY",9).attr("markerWidth",18).attr("markerHeight",18).attr("orient","auto").append("path").attr("stroke",e.stroke).attr("fill","none").attr("d","M9,0 L9,18 M15,0 L15,18"),t.append("defs").append("marker").attr("id",Za.ONLY_ONE_END).attr("refX",18).attr("refY",9).attr("markerWidth",18).attr("markerHeight",18).attr("orient","auto").append("path").attr("stroke",e.stroke).attr("fill","none").attr("d","M3,0 L3,18 M9,0 L9,18"),(n=t.append("defs").append("marker").attr("id",Za.ZERO_OR_ONE_START).attr("refX",0).attr("refY",9).attr("markerWidth",30).attr("markerHeight",18).attr("orient","auto")).append("circle").attr("stroke",e.stroke).attr("fill","white").attr("cx",21).attr("cy",9).attr("r",6),n.append("path").attr("stroke",e.stroke).attr("fill","none").attr("d","M9,0 L9,18"),(n=t.append("defs").append("marker").attr("id",Za.ZERO_OR_ONE_END).attr("refX",30).attr("refY",9).attr("markerWidth",30).attr("markerHeight",18).attr("orient","auto")).append("circle").attr("stroke",e.stroke).attr("fill","white").attr("cx",9).attr("cy",9).attr("r",6),n.append("path").attr("stroke",e.stroke).attr("fill","none").attr("d","M21,0 L21,18"),t.append("defs").append("marker").attr("id",Za.ONE_OR_MORE_START).attr("refX",18).attr("refY",18).attr("markerWidth",45).attr("markerHeight",36).attr("orient","auto").append("path").attr("stroke",e.stroke).attr("fill","none").attr("d","M0,18 Q 18,0 36,18 Q 18,36 0,18 M42,9 L42,27"),t.append("defs").append("marker").attr("id",Za.ONE_OR_MORE_END).attr("refX",27).attr("refY",18).attr("markerWidth",45).attr("markerHeight",36).attr("orient","auto").append("path").attr("stroke",e.stroke).attr("fill","none").attr("d","M3,9 L3,27 M9,18 Q27,0 45,18 Q27,36 9,18"),(n=t.append("defs").append("marker").attr("id",Za.ZERO_OR_MORE_START).attr("refX",18).attr("refY",18).attr("markerWidth",57).attr("markerHeight",36).attr("orient","auto")).append("circle").attr("stroke",e.stroke).attr("fill","white").attr("cx",48).attr("cy",18).attr("r",6),n.append("path").attr("stroke",e.stroke).attr("fill","none").attr("d","M0,18 Q18,0 36,18 Q18,36 0,18"),(n=t.append("defs").append("marker").attr("id",Za.ZERO_OR_MORE_END).attr("refX",39).attr("refY",18).attr("markerWidth",57).attr("markerHeight",36).attr("orient","auto")).append("circle").attr("stroke",e.stroke).attr("fill","white").attr("cx",9).attr("cy",18).attr("r",6),n.append("path").attr("stroke",e.stroke).attr("fill","none").attr("d","M21,18 Q39,0 57,18 Q39,36 21,18")},Qa={},to=function(t,e,n){var r;return Object.keys(e).forEach((function(i){var a=t.append("g").attr("id",i);r=void 0===r?i:r;var o="entity-"+i,s=a.append("text").attr("class","er entityLabel").attr("id",o).attr("x",0).attr("y",0).attr("dominant-baseline","middle").attr("text-anchor","middle").attr("style","font-family: "+_t().fontFamily+"; font-size: "+Qa.fontSize+"px").text(i),c=function(t,e,n){var r=Qa.entityPadding/3,i=Qa.entityPadding/3,a=.85*Qa.fontSize,o=e.node().getBBox(),s=[],c=0,u=0,l=o.height+2*r,h=1;n.forEach((function(n){var i="".concat(e.node().id,"-attr-").concat(h),o=t.append("text").attr("class","er entityLabel").attr("id","".concat(i,"-type")).attr("x",0).attr("y",0).attr("dominant-baseline","middle").attr("text-anchor","left").attr("style","font-family: "+_t().fontFamily+"; font-size: "+a+"px").text(n.attributeType),f=t.append("text").attr("class","er entityLabel").attr("id","".concat(i,"-name")).attr("x",0).attr("y",0).attr("dominant-baseline","middle").attr("text-anchor","left").attr("style","font-family: "+_t().fontFamily+"; font-size: "+a+"px").text(n.attributeName);s.push({tn:o,nn:f});var d=o.node().getBBox(),p=f.node().getBBox();c=Math.max(c,d.width),u=Math.max(u,p.width),l+=Math.max(d.height,p.height)+2*r,h+=1}));var f={width:Math.max(Qa.minEntityWidth,Math.max(o.width+2*Qa.entityPadding,c+u+4*i)),height:n.length>0?l:Math.max(Qa.minEntityHeight,o.height+2*Qa.entityPadding)},d=Math.max(0,f.width-(c+u)-4*i);if(n.length>0){e.attr("transform","translate("+f.width/2+","+(r+o.height/2)+")");var p=o.height+2*r,g="attributeBoxOdd";s.forEach((function(e){var n=p+r+Math.max(e.tn.node().getBBox().height,e.nn.node().getBBox().height)/2;e.tn.attr("transform","translate("+i+","+n+")");var a=t.insert("rect","#"+e.tn.node().id).attr("class","er ".concat(g)).attr("fill",Qa.fill).attr("fill-opacity","100%").attr("stroke",Qa.stroke).attr("x",0).attr("y",p).attr("width",c+2*i+d/2).attr("height",e.tn.node().getBBox().height+2*r);e.nn.attr("transform","translate("+(parseFloat(a.attr("width"))+i)+","+n+")"),t.insert("rect","#"+e.nn.node().id).attr("class","er ".concat(g)).attr("fill",Qa.fill).attr("fill-opacity","100%").attr("stroke",Qa.stroke).attr("x","".concat(a.attr("x")+a.attr("width"))).attr("y",p).attr("width",u+2*i+d/2).attr("height",e.nn.node().getBBox().height+2*r),p+=Math.max(e.tn.node().getBBox().height,e.nn.node().getBBox().height)+2*r,g="attributeBoxOdd"==g?"attributeBoxEven":"attributeBoxOdd"}))}else f.height=Math.max(Qa.minEntityHeight,l),e.attr("transform","translate("+f.width/2+","+f.height/2+")");return f}(a,s,e[i].attributes),u=c.width,l=c.height,h=a.insert("rect","#"+o).attr("class","er entityBox").attr("fill",Qa.fill).attr("fill-opacity","100%").attr("stroke",Qa.stroke).attr("x",0).attr("y",0).attr("width",u).attr("height",l).node().getBBox();n.setNode(i,{width:h.width,height:h.height,shape:"rect",id:i})})),r},eo=function(t){return(t.entityA+t.roleA+t.entityB).replace(/\s/g,"")},no=0,ro=function(t){for(var e=Object.keys(t),n=0;n<e.length;n++)Qa[e[n]]=t[e[n]]},io=function(t,e){c.info("Drawing ER diagram"),Ga.clear();var n=Xa.a.parser;n.yy=Ga;try{n.parse(t)}catch(t){c.debug("Parsing failed")}var r,i=Object(d.select)("[id='".concat(e,"']"));Ka(i,Qa),r=new G.a.Graph({multigraph:!0,directed:!0,compound:!1}).setGraph({rankdir:Qa.layoutDirection,marginx:20,marginy:20,nodesep:100,edgesep:100,ranksep:100}).setDefaultEdgeLabel((function(){return{}}));var a,o,s=to(i,Ga.getEntities(),r),u=function(t,e){return t.forEach((function(t){e.setEdge(t.entityA,t.entityB,{relationship:t},eo(t))})),t}(Ga.getRelationships(),r);ke.a.layout(r),a=i,(o=r).nodes().forEach((function(t){void 0!==t&&void 0!==o.node(t)&&a.select("#"+t).attr("transform","translate("+(o.node(t).x-o.node(t).width/2)+","+(o.node(t).y-o.node(t).height/2)+" )")})),u.forEach((function(t){!function(t,e,n,r){no++;var i=n.edge(e.entityA,e.entityB,eo(e)),a=Object(d.line)().x((function(t){return t.x})).y((function(t){return t.y})).curve(d.curveBasis),o=t.insert("path","#"+r).attr("class","er relationshipLine").attr("d",a(i.points)).attr("stroke",Qa.stroke).attr("fill","none");e.relSpec.relType===Ga.Identification.NON_IDENTIFYING&&o.attr("stroke-dasharray","8,8");var s="";switch(Qa.arrowMarkerAbsolute&&(s=(s=(s=window.location.protocol+"//"+window.location.host+window.location.pathname+window.location.search).replace(/\(/g,"\\(")).replace(/\)/g,"\\)")),e.relSpec.cardA){case Ga.Cardinality.ZERO_OR_ONE:o.attr("marker-end","url("+s+"#"+Ja.ZERO_OR_ONE_END+")");break;case Ga.Cardinality.ZERO_OR_MORE:o.attr("marker-end","url("+s+"#"+Ja.ZERO_OR_MORE_END+")");break;case Ga.Cardinality.ONE_OR_MORE:o.attr("marker-end","url("+s+"#"+Ja.ONE_OR_MORE_END+")");break;case Ga.Cardinality.ONLY_ONE:o.attr("marker-end","url("+s+"#"+Ja.ONLY_ONE_END+")")}switch(e.relSpec.cardB){case Ga.Cardinality.ZERO_OR_ONE:o.attr("marker-start","url("+s+"#"+Ja.ZERO_OR_ONE_START+")");break;case Ga.Cardinality.ZERO_OR_MORE:o.attr("marker-start","url("+s+"#"+Ja.ZERO_OR_MORE_START+")");break;case Ga.Cardinality.ONE_OR_MORE:o.attr("marker-start","url("+s+"#"+Ja.ONE_OR_MORE_START+")");break;case Ga.Cardinality.ONLY_ONE:o.attr("marker-start","url("+s+"#"+Ja.ONLY_ONE_START+")")}var c=o.node().getTotalLength(),u=o.node().getPointAtLength(.5*c),l="rel"+no,h=t.append("text").attr("class","er relationshipLabel").attr("id",l).attr("x",u.x).attr("y",u.y).attr("text-anchor","middle").attr("dominant-baseline","middle").attr("style","font-family: "+_t().fontFamily+"; font-size: "+Qa.fontSize+"px").text(e.roleA).node().getBBox();t.insert("rect","#"+l).attr("class","er relationshipLabelBox").attr("x",u.x-h.width/2).attr("y",u.y-h.height/2).attr("width",h.width).attr("height",h.height).attr("fill","white").attr("fill-opacity","85%")}(i,t,r,s)}));var l=Qa.diagramPadding,h=i.node().getBBox(),f=h.width+2*l,p=h.height+2*l;W(i,p,f,Qa.useMaxWidth),i.attr("viewBox","".concat(h.x-l," ").concat(h.y-l," ").concat(f," ").concat(p))},ao=n(28),oo=n.n(ao);function so(t){return function(t){if(Array.isArray(t)){for(var e=0,n=new Array(t.length);e<t.length;e++)n[e]=t[e];return n}}(t)||function(t){if(Symbol.iterator in Object(t)||"[object Arguments]"===Object.prototype.toString.call(t))return Array.from(t)}(t)||function(){throw new TypeError("Invalid attempt to spread non-iterable instance")}()}var co="",uo="",lo=[],ho=[],fo=[],po=function(){for(var t=!0,e=0;e<fo.length;e++)fo[e].processed,t=t&&fo[e].processed;return t},go={parseDirective:function(t,e,n){Go.parseDirective(this,t,e,n)},getConfig:function(){return _t().journey},clear:function(){lo.length=0,ho.length=0,uo="",co="",fo.length=0},setTitle:function(t){co=t},getTitle:function(){return co},addSection:function(t){uo=t,lo.push(t)},getSections:function(){return lo},getTasks:function(){for(var t=po(),e=0;!t&&e<100;)t=po(),e++;return ho.push.apply(ho,fo),ho},addTask:function(t,e){var n=e.substr(1).split(":"),r=0,i=[];1===n.length?(r=Number(n[0]),i=[]):(r=Number(n[0]),i=n[1].split(","));var a=i.map((function(t){return t.trim()})),o={section:uo,type:uo,people:a,task:t,score:r};fo.push(o)},addTaskOrg:function(t){var e={section:uo,type:uo,description:t,task:t,classes:[]};ho.push(e)},getActors:function(){return t=[],ho.forEach((function(e){e.people&&t.push.apply(t,so(e.people))})),so(new Set(t)).sort();var t}},yo=function(t,e){var n=t.append("rect");return n.attr("x",e.x),n.attr("y",e.y),n.attr("fill",e.fill),n.attr("stroke",e.stroke),n.attr("width",e.width),n.attr("height",e.height),n.attr("rx",e.rx),n.attr("ry",e.ry),void 0!==e.class&&n.attr("class",e.class),n},vo=function(t,e){var n=t.append("circle");return n.attr("cx",e.cx),n.attr("cy",e.cy),n.attr("fill",e.fill),n.attr("stroke",e.stroke),n.attr("r",e.r),void 0!==n.class&&n.attr("class",n.class),void 0!==e.title&&n.append("title").text(e.title),n},mo=function(t,e){var n=e.text.replace(/<br\s*\/?>/gi," "),r=t.append("text");r.attr("x",e.x),r.attr("y",e.y),r.attr("class","legend"),r.style("text-anchor",e.anchor),void 0!==e.class&&r.attr("class",e.class);var i=r.append("tspan");return i.attr("x",e.x+2*e.textMargin),i.text(n),r},bo=-1,xo=function(){return{x:0,y:0,width:100,anchor:"start",height:100,rx:0,ry:0}},_o=function(){function t(t,e,n,i,a,o,s,c){r(e.append("text").attr("x",n+a/2).attr("y",i+o/2+5).style("font-color",c).style("text-anchor","middle").text(t),s)}function e(t,e,n,i,a,o,s,c,u){for(var l=c.taskFontSize,h=c.taskFontFamily,f=t.split(/<br\s*\/?>/gi),d=0;d<f.length;d++){var p=d*l-l*(f.length-1)/2,g=e.append("text").attr("x",n+a/2).attr("y",i).attr("fill",u).style("text-anchor","middle").style("font-size",l).style("font-family",h);g.append("tspan").attr("x",n+a/2).attr("dy",p).text(f[d]),g.attr("y",i+o/2).attr("dominant-baseline","central").attr("alignment-baseline","central"),r(g,s)}}function n(t,n,i,a,o,s,c,u){var l=n.append("switch"),h=l.append("foreignObject").attr("x",i).attr("y",a).attr("width",o).attr("height",s).attr("position","fixed").append("div").style("display","table").style("height","100%").style("width","100%");h.append("div").attr("class","label").style("display","table-cell").style("text-align","center").style("vertical-align","middle").text(t),e(t,l,i,a,o,s,c,u),r(h,c)}function r(t,e){for(var n in e)n in e&&t.attr(n,e[n])}return function(r){return"fo"===r.textPlacement?n:"old"===r.textPlacement?t:e}}(),ko=vo,wo=function(t,e,n){var r=t.append("g"),i=xo();i.x=e.x,i.y=e.y,i.fill=e.fill,i.width=n.width,i.height=n.height,i.class="journey-section section-type-"+e.num,i.rx=3,i.ry=3,yo(r,i),_o(n)(e.text,r,i.x,i.y,i.width,i.height,{class:"journey-section section-type-"+e.num},n,e.colour)},Eo=mo,To=function(t,e,n){var r=e.x+n.width/2,i=t.append("g");bo++;var a,o,s;i.append("line").attr("id","task"+bo).attr("x1",r).attr("y1",e.y).attr("x2",r).attr("y2",450).attr("class","task-line").attr("stroke-width","1px").attr("stroke-dasharray","4 2").attr("stroke","#666"),a=i,o={cx:r,cy:300+30*(5-e.score),score:e.score},a.append("circle").attr("cx",o.cx).attr("cy",o.cy).attr("class","face").attr("r",15).attr("stroke-width",2).attr("overflow","visible"),(s=a.append("g")).append("circle").attr("cx",o.cx-5).attr("cy",o.cy-5).attr("r",1.5).attr("stroke-width",2).attr("fill","#666").attr("stroke","#666"),s.append("circle").attr("cx",o.cx+5).attr("cy",o.cy-5).attr("r",1.5).attr("stroke-width",2).attr("fill","#666").attr("stroke","#666"),o.score>3?function(t){var e=Object(d.arc)().startAngle(Math.PI/2).endAngle(Math.PI/2*3).innerRadius(7.5).outerRadius(15/2.2);t.append("path").attr("class","mouth").attr("d",e).attr("transform","translate("+o.cx+","+(o.cy+2)+")")}(s):o.score<3?function(t){var e=Object(d.arc)().startAngle(3*Math.PI/2).endAngle(Math.PI/2*5).innerRadius(7.5).outerRadius(15/2.2);t.append("path").attr("class","mouth").attr("d",e).attr("transform","translate("+o.cx+","+(o.cy+7)+")")}(s):function(t){t.append("line").attr("class","mouth").attr("stroke",2).attr("x1",o.cx-5).attr("y1",o.cy+7).attr("x2",o.cx+5).attr("y2",o.cy+7).attr("class","mouth").attr("stroke-width","1px").attr("stroke","#666")}(s);var c=xo();c.x=e.x,c.y=e.y,c.fill=e.fill,c.width=n.width,c.height=n.height,c.class="task task-type-"+e.num,c.rx=3,c.ry=3,yo(i,c);var u=e.x+14;e.people.forEach((function(t){var n=e.actors[t],r={cx:u,cy:e.y,r:7,fill:n,stroke:"#000",title:t};vo(i,r),u+=10})),_o(n)(e.task,i,c.x,c.y,c.width,c.height,{class:"task"},n,e.colour)},Co=function(t){t.append("defs").append("marker").attr("id","arrowhead").attr("refX",5).attr("refY",2).attr("markerWidth",6).attr("markerHeight",4).attr("orient","auto").append("path").attr("d","M 0,0 V 4 L6,2 Z")};ao.parser.yy=go;var Ao={leftMargin:150,diagramMarginX:50,diagramMarginY:20,taskMargin:50,width:150,height:50,taskFontSize:14,taskFontFamily:'"Open-Sans", "sans-serif"',boxMargin:10,boxTextMargin:5,noteMargin:10,messageMargin:35,messageAlign:"center",bottomMarginAdj:1,activationWidth:10,textPlacement:"fo",actorColours:["#8FBC8F","#7CFC00","#00FFFF","#20B2AA","#B0E0E6","#FFFFE0"],sectionFills:["#191970","#8B008B","#4B0082","#2F4F4F","#800000","#8B4513","#00008B"],sectionColours:["#fff"]},So={};var Mo=Ao.leftMargin,Oo={data:{startx:void 0,stopx:void 0,starty:void 0,stopy:void 0},verticalPos:0,sequenceItems:[],init:function(){this.sequenceItems=[],this.data={startx:void 0,stopx:void 0,starty:void 0,stopy:void 0},this.verticalPos=0},updateVal:function(t,e,n,r){void 0===t[e]?t[e]=n:t[e]=r(n,t[e])},updateBounds:function(t,e,n,r){var i,a=this,o=0;this.sequenceItems.forEach((function(s){o++;var c=a.sequenceItems.length-o+1;a.updateVal(s,"starty",e-c*Ao.boxMargin,Math.min),a.updateVal(s,"stopy",r+c*Ao.boxMargin,Math.max),a.updateVal(Oo.data,"startx",t-c*Ao.boxMargin,Math.min),a.updateVal(Oo.data,"stopx",n+c*Ao.boxMargin,Math.max),"activation"!==i&&(a.updateVal(s,"startx",t-c*Ao.boxMargin,Math.min),a.updateVal(s,"stopx",n+c*Ao.boxMargin,Math.max),a.updateVal(Oo.data,"starty",e-c*Ao.boxMargin,Math.min),a.updateVal(Oo.data,"stopy",r+c*Ao.boxMargin,Math.max))}))},insert:function(t,e,n,r){var i=Math.min(t,n),a=Math.max(t,n),o=Math.min(e,r),s=Math.max(e,r);this.updateVal(Oo.data,"startx",i,Math.min),this.updateVal(Oo.data,"starty",o,Math.min),this.updateVal(Oo.data,"stopx",a,Math.max),this.updateVal(Oo.data,"stopy",s,Math.max),this.updateBounds(i,o,a,s)},bumpVerticalPos:function(t){this.verticalPos=this.verticalPos+t,this.data.stopy=this.verticalPos},getVerticalPos:function(){return this.verticalPos},getBounds:function(){return this.data}},Do=Ao.sectionFills,No=Ao.sectionColours,Bo=function(t,e,n){for(var r="",i=n+(2*Ao.height+Ao.diagramMarginY),a=0,o="#CCC",s="black",c=0,u=0;u<e.length;u++){var l=e[u];if(r!==l.section){o=Do[a%Do.length],c=a%Do.length,s=No[a%No.length];var h={x:u*Ao.taskMargin+u*Ao.width+Mo,y:50,text:l.section,fill:o,num:c,colour:s};wo(t,h,Ao),r=l.section,a++}var f=l.people.reduce((function(t,e){return So[e]&&(t[e]=So[e]),t}),{});l.x=u*Ao.taskMargin+u*Ao.width+Mo,l.y=i,l.width=Ao.diagramMarginX,l.height=Ao.diagramMarginY,l.colour=s,l.fill=o,l.num=c,l.actors=f,To(t,l,Ao),Oo.insert(l.x,l.y,l.x+l.width+Ao.taskMargin,450)}},Lo=function(t){Object.keys(t).forEach((function(e){Ao[e]=t[e]}))},Po=function(t,e){ao.parser.yy.clear(),ao.parser.parse(t+"\n"),Oo.init();var n=Object(d.select)("#"+e);n.attr("xmlns:xlink","http://www.w3.org/1999/xlink"),Co(n);var r=ao.parser.yy.getTasks(),i=ao.parser.yy.getTitle(),a=ao.parser.yy.getActors();for(var o in So)delete So[o];var s=0;a.forEach((function(t){So[t]=Ao.actorColours[s%Ao.actorColours.length],s++})),function(t){var e=60;Object.keys(So).forEach((function(n){var r=So[n];ko(t,{cx:20,cy:e,r:7,fill:r,stroke:"#000"});var i={x:40,y:e+7,fill:"#666",text:n,textMargin:5|Ao.boxTextMargin};Eo(t,i),e+=20}))}(n),Oo.insert(0,0,Mo,50*Object.keys(So).length),Bo(n,r,0);var c=Oo.getBounds();i&&n.append("text").text(i).attr("x",Mo).attr("font-size","4ex").attr("font-weight","bold").attr("y",25);var u=c.stopy-c.starty+2*Ao.diagramMarginY,l=Mo+c.stopx+2*Ao.diagramMarginX;W(n,u,l,Ao.useMaxWidth),n.append("line").attr("x1",Mo).attr("y1",4*Ao.height).attr("x2",l-Mo-4).attr("y2",4*Ao.height).attr("stroke-width",4).attr("stroke","black").attr("marker-end","url(#arrowhead)");var h=i?70:0;n.attr("viewBox","".concat(c.startx," -25 ").concat(l," ").concat(u+h)),n.attr("preserveAspectRatio","xMinYMin meet")},Io=function(t){return"g.classGroup text {\n fill: ".concat(t.nodeBorder,";\n fill: ").concat(t.classText,";\n stroke: none;\n font-family: ").concat(t.fontFamily,";\n font-size: 10px;\n\n .title {\n font-weight: bolder;\n }\n\n}\n\n.classTitle {\n font-weight: bolder;\n}\n.node rect,\n .node circle,\n .node ellipse,\n .node polygon,\n .node path {\n fill: ").concat(t.mainBkg,";\n stroke: ").concat(t.nodeBorder,";\n stroke-width: 1px;\n }\n\n\n.divider {\n stroke: ").concat(t.nodeBorder,";\n stroke: 1;\n}\n\ng.clickable {\n cursor: pointer;\n}\n\ng.classGroup rect {\n fill: ").concat(t.mainBkg,";\n stroke: ").concat(t.nodeBorder,";\n}\n\ng.classGroup line {\n stroke: ").concat(t.nodeBorder,";\n stroke-width: 1;\n}\n\n.classLabel .box {\n stroke: none;\n stroke-width: 0;\n fill: ").concat(t.mainBkg,";\n opacity: 0.5;\n}\n\n.classLabel .label {\n fill: ").concat(t.nodeBorder,";\n font-size: 10px;\n}\n\n.relation {\n stroke: ").concat(t.lineColor,";\n stroke-width: 1;\n fill: none;\n}\n\n.dashed-line{\n stroke-dasharray: 3;\n}\n\n#compositionStart, .composition {\n fill: ").concat(t.lineColor," !important;\n stroke: ").concat(t.lineColor," !important;\n stroke-width: 1;\n}\n\n#compositionEnd, .composition {\n fill: ").concat(t.lineColor," !important;\n stroke: ").concat(t.lineColor," !important;\n stroke-width: 1;\n}\n\n#dependencyStart, .dependency {\n fill: ").concat(t.lineColor," !important;\n stroke: ").concat(t.lineColor," !important;\n stroke-width: 1;\n}\n\n#dependencyStart, .dependency {\n fill: ").concat(t.lineColor," !important;\n stroke: ").concat(t.lineColor," !important;\n stroke-width: 1;\n}\n\n#extensionStart, .extension {\n fill: ").concat(t.lineColor," !important;\n stroke: ").concat(t.lineColor," !important;\n stroke-width: 1;\n}\n\n#extensionEnd, .extension {\n fill: ").concat(t.lineColor," !important;\n stroke: ").concat(t.lineColor," !important;\n stroke-width: 1;\n}\n\n#aggregationStart, .aggregation {\n fill: ").concat(t.mainBkg," !important;\n stroke: ").concat(t.lineColor," !important;\n stroke-width: 1;\n}\n\n#aggregationEnd, .aggregation {\n fill: ").concat(t.mainBkg," !important;\n stroke: ").concat(t.lineColor," !important;\n stroke-width: 1;\n}\n\n.edgeTerminals {\n font-size: 11px;\n}\n\n")},Fo=function(t){return".label {\n font-family: ".concat(t.fontFamily,";\n color: ").concat(t.nodeTextColor||t.textColor,";\n }\n\n .label text {\n fill: ").concat(t.nodeTextColor||t.textColor,";\n }\n\n .node rect,\n .node circle,\n .node ellipse,\n .node polygon,\n .node path {\n fill: ").concat(t.mainBkg,";\n stroke: ").concat(t.nodeBorder,";\n stroke-width: 1px;\n }\n\n .node .label {\n text-align: center;\n }\n .node.clickable {\n cursor: pointer;\n }\n\n .arrowheadPath {\n fill: ").concat(t.arrowheadColor,";\n }\n\n .edgePath .path {\n stroke: ").concat(t.lineColor,";\n stroke-width: 1.5px;\n }\n\n .flowchart-link {\n stroke: ").concat(t.lineColor,";\n fill: none;\n }\n\n .edgeLabel {\n background-color: ").concat(t.edgeLabelBackground,";\n rect {\n opacity: 0.5;\n background-color: ").concat(t.edgeLabelBackground,";\n fill: ").concat(t.edgeLabelBackground,";\n }\n text-align: center;\n }\n\n .cluster rect {\n fill: ").concat(t.clusterBkg,";\n stroke: ").concat(t.clusterBorder,";\n stroke-width: 1px;\n }\n\n .cluster text {\n fill: ").concat(t.titleColor,";\n }\n\n div.mermaidTooltip {\n position: absolute;\n text-align: center;\n max-width: 200px;\n padding: 2px;\n font-family: ").concat(t.fontFamily,";\n font-size: 12px;\n background: ").concat(t.tertiaryColor,";\n border: 1px solid ").concat(t.border2,";\n border-radius: 2px;\n pointer-events: none;\n z-index: 100;\n }\n")},jo=function(t){return"g.stateGroup text {\n fill: ".concat(t.nodeBorder,";\n stroke: none;\n font-size: 10px;\n}\ng.stateGroup text {\n fill: ").concat(t.textColor,";\n stroke: none;\n font-size: 10px;\n\n}\ng.stateGroup .state-title {\n font-weight: bolder;\n fill: ").concat(t.labelColor,";\n}\n\ng.stateGroup rect {\n fill: ").concat(t.mainBkg,";\n stroke: ").concat(t.nodeBorder,";\n}\n\ng.stateGroup line {\n stroke: ").concat(t.lineColor,";\n stroke-width: 1;\n}\n\n.transition {\n stroke: ").concat(t.lineColor,";\n stroke-width: 1;\n fill: none;\n}\n\n.stateGroup .composit {\n fill: ").concat(t.background,";\n border-bottom: 1px\n}\n\n.stateGroup .alt-composit {\n fill: #e0e0e0;\n border-bottom: 1px\n}\n\n.state-note {\n stroke: ").concat(t.noteBorderColor,";\n fill: ").concat(t.noteBkgColor,";\n\n text {\n fill: black;\n stroke: none;\n font-size: 10px;\n }\n}\n\n.stateLabel .box {\n stroke: none;\n stroke-width: 0;\n fill: ").concat(t.mainBkg,";\n opacity: 0.5;\n}\n\n.edgeLabel .label rect {\n fill: ").concat(t.tertiaryColor,";\n opacity: 0.5;\n}\n.edgeLabel .label text {\n fill: ").concat(t.tertiaryTextColor,";\n}\n.label div .edgeLabel {\n color: ").concat(t.tertiaryTextColor,";\n}\n\n.stateLabel text {\n fill: ").concat(t.labelColor,";\n font-size: 10px;\n font-weight: bold;\n}\n\n.node circle.state-start {\n fill: ").concat(t.lineColor,";\n stroke: black;\n}\n.node circle.state-end {\n fill: ").concat(t.primaryBorderColor,";\n stroke: ").concat(t.background,";\n stroke-width: 1.5\n}\n.end-state-inner {\n fill: ").concat(t.background,";\n // stroke: ").concat(t.background,";\n stroke-width: 1.5\n}\n\n.node rect {\n fill: ").concat(t.mainBkg,";\n stroke: ").concat(t.nodeBorder,";\n stroke-width: 1px;\n}\n#statediagram-barbEnd {\n fill: ").concat(t.lineColor,";\n}\n\n.statediagram-cluster rect {\n fill: ").concat(t.mainBkg,";\n stroke: ").concat(t.nodeBorder,";\n stroke-width: 1px;\n}\n\n.cluster-label, .nodeLabel {\n color: ").concat(t.textColor,";\n}\n\n.statediagram-cluster rect.outer {\n rx: 5px;\n ry: 5px;\n}\n.statediagram-state .divider {\n stroke: ").concat(t.nodeBorder,";\n}\n\n.statediagram-state .title-state {\n rx: 5px;\n ry: 5px;\n}\n.statediagram-cluster.statediagram-cluster .inner {\n fill: ").concat(t.background,";\n}\n.statediagram-cluster.statediagram-cluster-alt .inner {\n fill: #e0e0e0;\n}\n\n.statediagram-cluster .inner {\n rx:0;\n ry:0;\n}\n\n.statediagram-state rect.basic {\n rx: 5px;\n ry: 5px;\n}\n.statediagram-state rect.divider {\n stroke-dasharray: 10,10;\n fill: ").concat(t.altBackground?t.altBackground:"#efefef",";\n}\n\n.note-edge {\n stroke-dasharray: 5;\n}\n\n.statediagram-note rect {\n fill: ").concat(t.noteBkgColor,";\n stroke: ").concat(t.noteBorderColor,";\n stroke-width: 1px;\n rx: 0;\n ry: 0;\n}\n.statediagram-note rect {\n fill: ").concat(t.noteBkgColor,";\n stroke: ").concat(t.noteBorderColor,";\n stroke-width: 1px;\n rx: 0;\n ry: 0;\n}\n\n.statediagram-note text {\n fill: ").concat(t.noteTextColor,";\n}\n\n.statediagram-note .nodeLabel {\n color: ").concat(t.noteTextColor,";\n}\n\n#dependencyStart, #dependencyEnd {\n fill: ").concat(t.lineColor,";\n stroke: ").concat(t.lineColor,";\n stroke-width: 1;\n}\n")},Ro={flowchart:Fo,"flowchart-v2":Fo,sequence:function(t){return".actor {\n stroke: ".concat(t.actorBorder,";\n fill: ").concat(t.actorBkg,";\n }\n\n text.actor > tspan {\n fill: ").concat(t.actorTextColor,";\n stroke: none;\n }\n\n .actor-line {\n stroke: ").concat(t.actorLineColor,";\n }\n\n .messageLine0 {\n stroke-width: 1.5;\n stroke-dasharray: none;\n stroke: ").concat(t.signalColor,";\n }\n\n .messageLine1 {\n stroke-width: 1.5;\n stroke-dasharray: 2, 2;\n stroke: ").concat(t.signalColor,";\n }\n\n #arrowhead path {\n fill: ").concat(t.signalColor,";\n stroke: ").concat(t.signalColor,";\n }\n\n .sequenceNumber {\n fill: ").concat(t.sequenceNumberColor,";\n }\n\n #sequencenumber {\n fill: ").concat(t.signalColor,";\n }\n\n #crosshead path {\n fill: ").concat(t.signalColor,";\n stroke: ").concat(t.signalColor,";\n }\n\n .messageText {\n fill: ").concat(t.signalTextColor,";\n stroke: ").concat(t.signalTextColor,";\n }\n\n .labelBox {\n stroke: ").concat(t.labelBoxBorderColor,";\n fill: ").concat(t.labelBoxBkgColor,";\n }\n\n .labelText, .labelText > tspan {\n fill: ").concat(t.labelTextColor,";\n stroke: none;\n }\n\n .loopText, .loopText > tspan {\n fill: ").concat(t.loopTextColor,";\n stroke: none;\n }\n\n .loopLine {\n stroke-width: 2px;\n stroke-dasharray: 2, 2;\n stroke: ").concat(t.labelBoxBorderColor,";\n fill: ").concat(t.labelBoxBorderColor,";\n }\n\n .note {\n //stroke: #decc93;\n stroke: ").concat(t.noteBorderColor,";\n fill: ").concat(t.noteBkgColor,";\n }\n\n .noteText, .noteText > tspan {\n fill: ").concat(t.noteTextColor,";\n stroke: none;\n }\n\n .activation0 {\n fill: ").concat(t.activationBkgColor,";\n stroke: ").concat(t.activationBorderColor,";\n }\n\n .activation1 {\n fill: ").concat(t.activationBkgColor,";\n stroke: ").concat(t.activationBorderColor,";\n }\n\n .activation2 {\n fill: ").concat(t.activationBkgColor,";\n stroke: ").concat(t.activationBorderColor,";\n }\n")},gantt:function(t){return'\n .mermaid-main-font {\n font-family: "trebuchet ms", verdana, arial, sans-serif;\n font-family: var(--mermaid-font-family);\n }\n\n .section {\n stroke: none;\n opacity: 0.2;\n }\n\n .section0 {\n fill: '.concat(t.sectionBkgColor,";\n }\n\n .section2 {\n fill: ").concat(t.sectionBkgColor2,";\n }\n\n .section1,\n .section3 {\n fill: ").concat(t.altSectionBkgColor,";\n opacity: 0.2;\n }\n\n .sectionTitle0 {\n fill: ").concat(t.titleColor,";\n }\n\n .sectionTitle1 {\n fill: ").concat(t.titleColor,";\n }\n\n .sectionTitle2 {\n fill: ").concat(t.titleColor,";\n }\n\n .sectionTitle3 {\n fill: ").concat(t.titleColor,";\n }\n\n .sectionTitle {\n text-anchor: start;\n font-size: 11px;\n text-height: 14px;\n font-family: 'trebuchet ms', verdana, arial, sans-serif;\n font-family: var(--mermaid-font-family);\n\n }\n\n\n /* Grid and axis */\n\n .grid .tick {\n stroke: ").concat(t.gridColor,";\n opacity: 0.8;\n shape-rendering: crispEdges;\n text {\n font-family: ").concat(t.fontFamily,";\n fill: ").concat(t.textColor,";\n }\n }\n\n .grid path {\n stroke-width: 0;\n }\n\n\n /* Today line */\n\n .today {\n fill: none;\n stroke: ").concat(t.todayLineColor,";\n stroke-width: 2px;\n }\n\n\n /* Task styling */\n\n /* Default task */\n\n .task {\n stroke-width: 2;\n }\n\n .taskText {\n text-anchor: middle;\n font-family: 'trebuchet ms', verdana, arial, sans-serif;\n font-family: var(--mermaid-font-family);\n }\n\n .taskText:not([font-size]) {\n font-size: 11px;\n }\n\n .taskTextOutsideRight {\n fill: ").concat(t.taskTextDarkColor,";\n text-anchor: start;\n font-size: 11px;\n font-family: 'trebuchet ms', verdana, arial, sans-serif;\n font-family: var(--mermaid-font-family);\n\n }\n\n .taskTextOutsideLeft {\n fill: ").concat(t.taskTextDarkColor,";\n text-anchor: end;\n font-size: 11px;\n }\n\n /* Special case clickable */\n .task.clickable {\n cursor: pointer;\n }\n .taskText.clickable {\n cursor: pointer;\n fill: ").concat(t.taskTextClickableColor," !important;\n font-weight: bold;\n }\n\n .taskTextOutsideLeft.clickable {\n cursor: pointer;\n fill: ").concat(t.taskTextClickableColor," !important;\n font-weight: bold;\n }\n\n .taskTextOutsideRight.clickable {\n cursor: pointer;\n fill: ").concat(t.taskTextClickableColor," !important;\n font-weight: bold;\n }\n\n /* Specific task settings for the sections*/\n\n .taskText0,\n .taskText1,\n .taskText2,\n .taskText3 {\n fill: ").concat(t.taskTextColor,";\n }\n\n .task0,\n .task1,\n .task2,\n .task3 {\n fill: ").concat(t.taskBkgColor,";\n stroke: ").concat(t.taskBorderColor,";\n }\n\n .taskTextOutside0,\n .taskTextOutside2\n {\n fill: ").concat(t.taskTextOutsideColor,";\n }\n\n .taskTextOutside1,\n .taskTextOutside3 {\n fill: ").concat(t.taskTextOutsideColor,";\n }\n\n\n /* Active task */\n\n .active0,\n .active1,\n .active2,\n .active3 {\n fill: ").concat(t.activeTaskBkgColor,";\n stroke: ").concat(t.activeTaskBorderColor,";\n }\n\n .activeText0,\n .activeText1,\n .activeText2,\n .activeText3 {\n fill: ").concat(t.taskTextDarkColor," !important;\n }\n\n\n /* Completed task */\n\n .done0,\n .done1,\n .done2,\n .done3 {\n stroke: ").concat(t.doneTaskBorderColor,";\n fill: ").concat(t.doneTaskBkgColor,";\n stroke-width: 2;\n }\n\n .doneText0,\n .doneText1,\n .doneText2,\n .doneText3 {\n fill: ").concat(t.taskTextDarkColor," !important;\n }\n\n\n /* Tasks on the critical line */\n\n .crit0,\n .crit1,\n .crit2,\n .crit3 {\n stroke: ").concat(t.critBorderColor,";\n fill: ").concat(t.critBkgColor,";\n stroke-width: 2;\n }\n\n .activeCrit0,\n .activeCrit1,\n .activeCrit2,\n .activeCrit3 {\n stroke: ").concat(t.critBorderColor,";\n fill: ").concat(t.activeTaskBkgColor,";\n stroke-width: 2;\n }\n\n .doneCrit0,\n .doneCrit1,\n .doneCrit2,\n .doneCrit3 {\n stroke: ").concat(t.critBorderColor,";\n fill: ").concat(t.doneTaskBkgColor,";\n stroke-width: 2;\n cursor: pointer;\n shape-rendering: crispEdges;\n }\n\n .milestone {\n transform: rotate(45deg) scale(0.8,0.8);\n }\n\n .milestoneText {\n font-style: italic;\n }\n .doneCritText0,\n .doneCritText1,\n .doneCritText2,\n .doneCritText3 {\n fill: ").concat(t.taskTextDarkColor," !important;\n }\n\n .activeCritText0,\n .activeCritText1,\n .activeCritText2,\n .activeCritText3 {\n fill: ").concat(t.taskTextDarkColor," !important;\n }\n\n .titleText {\n text-anchor: middle;\n font-size: 18px;\n fill: ").concat(t.textColor," ;\n font-family: 'trebuchet ms', verdana, arial, sans-serif;\n font-family: var(--mermaid-font-family);\n }\n")},classDiagram:Io,"classDiagram-v2":Io,class:Io,stateDiagram:jo,state:jo,git:function(){return"\n .commit-id,\n .commit-msg,\n .branch-label {\n fill: lightgrey;\n color: lightgrey;\n font-family: 'trebuchet ms', verdana, arial, sans-serif;\n font-family: var(--mermaid-font-family);\n }\n"},info:function(){return""},pie:function(t){return".pieTitleText {\n text-anchor: middle;\n font-size: 25px;\n fill: ".concat(t.taskTextDarkColor,";\n font-family: ").concat(t.fontFamily,";\n }\n .slice {\n font-family: ").concat(t.fontFamily,";\n fill: ").concat(t.textColor,";\n // fill: white;\n }\n .legend text {\n fill: ").concat(t.taskTextDarkColor,";\n font-family: ").concat(t.fontFamily,";\n font-size: 17px;\n }\n")},er:function(t){return"\n .entityBox {\n fill: ".concat(t.mainBkg,";\n stroke: ").concat(t.nodeBorder,";\n }\n\n .attributeBoxOdd {\n fill: #ffffff;\n stroke: ").concat(t.nodeBorder,";\n }\n\n .attributeBoxEven {\n fill: #f2f2f2;\n stroke: ").concat(t.nodeBorder,";\n }\n\n .relationshipLabelBox {\n fill: ").concat(t.tertiaryColor,";\n opacity: 0.7;\n background-color: ").concat(t.tertiaryColor,";\n rect {\n opacity: 0.5;\n }\n }\n\n .relationshipLine {\n stroke: ").concat(t.lineColor,";\n }\n")},journey:function(t){return".label {\n font-family: 'trebuchet ms', verdana, arial, sans-serif;\n font-family: var(--mermaid-font-family);\n color: ".concat(t.textColor,";\n }\n .mouth {\n stroke: #666;\n }\n\n line {\n stroke: ").concat(t.textColor,"\n }\n\n .legend {\n fill: ").concat(t.textColor,";\n }\n\n .label text {\n fill: #333;\n }\n .label {\n color: ").concat(t.textColor,"\n }\n\n .face {\n fill: #FFF8DC;\n stroke: #999;\n }\n\n .node rect,\n .node circle,\n .node ellipse,\n .node polygon,\n .node path {\n fill: ").concat(t.mainBkg,";\n stroke: ").concat(t.nodeBorder,";\n stroke-width: 1px;\n }\n\n .node .label {\n text-align: center;\n }\n .node.clickable {\n cursor: pointer;\n }\n\n .arrowheadPath {\n fill: ").concat(t.arrowheadColor,";\n }\n\n .edgePath .path {\n stroke: ").concat(t.lineColor,";\n stroke-width: 1.5px;\n }\n\n .flowchart-link {\n stroke: ").concat(t.lineColor,";\n fill: none;\n }\n\n .edgeLabel {\n background-color: ").concat(t.edgeLabelBackground,";\n rect {\n opacity: 0.5;\n }\n text-align: center;\n }\n\n .cluster rect {\n }\n\n .cluster text {\n fill: ").concat(t.titleColor,";\n }\n\n div.mermaidTooltip {\n position: absolute;\n text-align: center;\n max-width: 200px;\n padding: 2px;\n font-family: 'trebuchet ms', verdana, arial, sans-serif;\n font-family: var(--mermaid-font-family);\n font-size: 12px;\n background: ").concat(t.tertiaryColor,";\n border: 1px solid ").concat(t.border2,";\n border-radius: 2px;\n pointer-events: none;\n z-index: 100;\n }\n\n .task-type-0, .section-type-0 {\n ").concat(t.fillType0?"fill: ".concat(t.fillType0):"",";\n }\n .task-type-1, .section-type-1 {\n ").concat(t.fillType0?"fill: ".concat(t.fillType1):"",";\n }\n .task-type-2, .section-type-2 {\n ").concat(t.fillType0?"fill: ".concat(t.fillType2):"",";\n }\n .task-type-3, .section-type-3 {\n ").concat(t.fillType0?"fill: ".concat(t.fillType3):"",";\n }\n .task-type-4, .section-type-4 {\n ").concat(t.fillType0?"fill: ".concat(t.fillType4):"",";\n }\n .task-type-5, .section-type-5 {\n ").concat(t.fillType0?"fill: ".concat(t.fillType5):"",";\n }\n .task-type-6, .section-type-6 {\n ").concat(t.fillType0?"fill: ".concat(t.fillType6):"",";\n }\n .task-type-7, .section-type-7 {\n ").concat(t.fillType0?"fill: ".concat(t.fillType7):"",";\n }\n")}},Yo=function(t,e,n){return" {\n font-family: ".concat(n.fontFamily,";\n font-size: ").concat(n.fontSize,";\n fill: ").concat(n.textColor,"\n }\n\n /* Classes common for multiple diagrams */\n\n .error-icon {\n fill: ").concat(n.errorBkgColor,";\n }\n .error-text {\n fill: ").concat(n.errorTextColor,";\n stroke: ").concat(n.errorTextColor,";\n }\n\n .edge-thickness-normal {\n stroke-width: 2px;\n }\n .edge-thickness-thick {\n stroke-width: 3.5px\n }\n .edge-pattern-solid {\n stroke-dasharray: 0;\n }\n\n .edge-pattern-dashed{\n stroke-dasharray: 3;\n }\n .edge-pattern-dotted {\n stroke-dasharray: 2;\n }\n\n .marker {\n fill: ").concat(n.lineColor,";\n }\n .marker.cross {\n stroke: ").concat(n.lineColor,";\n }\n\n svg {\n font-family: ").concat(n.fontFamily,";\n font-size: ").concat(n.fontSize,";\n }\n\n ").concat(Ro[t](n),"\n\n ").concat(e,"\n\n ").concat(t," { fill: apa;}\n")};function zo(t){return(zo="function"==typeof Symbol&&"symbol"==typeof Symbol.iterator?function(t){return typeof t}:function(t){return t&&"function"==typeof Symbol&&t.constructor===Symbol&&t!==Symbol.prototype?"symbol":typeof t})(t)}var Uo={},$o=function(t,e,n){switch(c.debug("Directive type=".concat(e.type," with args:"),e.args),e.type){case"init":case"initialize":["config"].forEach((function(t){void 0!==e.args[t]&&("flowchart-v2"===n&&(n="flowchart"),e.args[n]=e.args[t],delete e.args[t])})),e.args,wt(e.args);break;case"wrap":case"nowrap":t&&t.setWrap&&t.setWrap("wrap"===e.type);break;default:c.warn("Unhandled directive: source: '%%{".concat(e.type,": ").concat(JSON.stringify(e.args?e.args:{}),"}%%"),e)}};function Wo(t){ka(t.git),me(t.flowchart),Ln(t.flowchart),void 0!==t.sequenceDiagram&&_r.setConf(F(t.sequence,t.sequenceDiagram)),_r.setConf(t.sequence),ri(t.gantt),li(t.class),zi(t.state),qi(t.state),Oa(t.class),za(t.class),ro(t.er),Lo(t.journey),Ba(t.class)}function Ho(){}var Vo=Object.freeze({render:function(t,e,n,r){Et();var i=e,a=H.detectInit(i);a&&wt(a);var o=_t();if(e.length>o.maxTextSize&&(i="graph TB;a[Maximum text size in diagram exceeded];style a fill:#faa"),void 0!==r)r.innerHTML="",Object(d.select)(r).append("div").attr("id","d"+t).attr("style","font-family: "+o.fontFamily).append("svg").attr("id",t).attr("width","100%").attr("xmlns","http://www.w3.org/2000/svg").append("g");else{var s=document.getElementById(t);s&&s.remove();var u=document.querySelector("#d"+t);u&&u.remove(),Object(d.select)("body").append("div").attr("id","d"+t).append("svg").attr("id",t).attr("width","100%").attr("xmlns","http://www.w3.org/2000/svg").append("g")}window.txt=i,i=function(t){var e=t;return e=(e=(e=e.replace(/style.*:\S*#.*;/g,(function(t){return t.substring(0,t.length-1)}))).replace(/classDef.*:\S*#.*;/g,(function(t){return t.substring(0,t.length-1)}))).replace(/#\w+;/g,(function(t){var e=t.substring(1,t.length-1);return/^\+?\d+$/.test(e)?"fl°°"+e+"¶ß":"fl°"+e+"¶ß"}))}(i);var l=Object(d.select)("#d"+t).node(),h=H.detectType(i),g=l.firstChild,y=g.firstChild,v="";if(void 0!==o.themeCSS&&(v+="\n".concat(o.themeCSS)),void 0!==o.fontFamily&&(v+="\n:root { --mermaid-font-family: ".concat(o.fontFamily,"}")),void 0!==o.altFontFamily&&(v+="\n:root { --mermaid-alt-font-family: ".concat(o.altFontFamily,"}")),"flowchart"===h||"flowchart-v2"===h||"graph"===h){var m=be(i);for(var b in m)v+="\n.".concat(b," > * { ").concat(m[b].styles.join(" !important; ")," !important; }"),m[b].textStyles&&(v+="\n.".concat(b," tspan { ").concat(m[b].textStyles.join(" !important; ")," !important; }"))}var x=(new f.a)("#".concat(t),Yo(h,v,o.themeVariables)),_=document.createElement("style");_.innerHTML=x,g.insertBefore(_,y);try{switch(h){case"git":o.flowchart.arrowMarkerAbsolute=o.arrowMarkerAbsolute,ka(o.git),wa(i,t,!1);break;case"flowchart":o.flowchart.arrowMarkerAbsolute=o.arrowMarkerAbsolute,me(o.flowchart),xe(i,t,!1);break;case"flowchart-v2":o.flowchart.arrowMarkerAbsolute=o.arrowMarkerAbsolute,Ln(o.flowchart),Pn(i,t,!1);break;case"sequence":o.sequence.arrowMarkerAbsolute=o.arrowMarkerAbsolute,o.sequenceDiagram?(_r.setConf(Object.assign(o.sequence,o.sequenceDiagram)),console.error("`mermaid config.sequenceDiagram` has been renamed to `config.sequence`. Please update your mermaid config.")):_r.setConf(o.sequence),_r.draw(i,t);break;case"gantt":o.gantt.arrowMarkerAbsolute=o.arrowMarkerAbsolute,ri(o.gantt),ii(i,t);break;case"class":o.class.arrowMarkerAbsolute=o.arrowMarkerAbsolute,li(o.class),hi(i,t);break;case"classDiagram":o.class.arrowMarkerAbsolute=o.arrowMarkerAbsolute,di(o.class),pi(i,t);break;case"state":o.class.arrowMarkerAbsolute=o.arrowMarkerAbsolute,zi(o.state),Ui(i,t);break;case"stateDiagram":o.class.arrowMarkerAbsolute=o.arrowMarkerAbsolute,qi(o.state),Xi(i,t);break;case"info":o.class.arrowMarkerAbsolute=o.arrowMarkerAbsolute,Oa(o.class),Da(i,t,p.version);break;case"pie":o.class.arrowMarkerAbsolute=o.arrowMarkerAbsolute,za(o.pie),Ua(i,t,p.version);break;case"er":ro(o.er),io(i,t,p.version);break;case"journey":Lo(o.journey),Po(i,t,p.version)}}catch(e){throw La(t,p.version),e}Object(d.select)('[id="'.concat(t,'"]')).selectAll("foreignobject > *").attr("xmlns","http://www.w3.org/1999/xhtml");var k=Object(d.select)("#d"+t).node().innerHTML;if(c.debug("cnf.arrowMarkerAbsolute",o.arrowMarkerAbsolute),o.arrowMarkerAbsolute&&"false"!==o.arrowMarkerAbsolute||(k=k.replace(/marker-end="url\(.*?#/g,'marker-end="url(#',"g")),k=(k=function(t){var e=t;return e=(e=(e=e.replace(/fl°°/g,(function(){return"&#"}))).replace(/fl°/g,(function(){return"&"}))).replace(/¶ß/g,(function(){return";"}))}(k)).replace(/<br>/g,"<br/>"),void 0!==n)switch(h){case"flowchart":case"flowchart-v2":n(k,Xt.bindFunctions);break;case"gantt":n(k,Qr.bindFunctions);break;case"class":case"classDiagram":n(k,cn.bindFunctions);break;default:n(k)}else c.debug("CB = undefined!");var w=Object(d.select)("#d"+t).node();return null!==w&&"function"==typeof w.remove&&Object(d.select)("#d"+t).node().remove(),k},parse:function(t){var e=H.detectInit(t);e&&c.debug("reinit ",e);var n,r=H.detectType(t);switch(c.debug("Type "+r),r){case"git":(n=ha.a).parser.yy=ua;break;case"flowchart":case"flowchart-v2":Xt.clear(),(n=Jt.a).parser.yy=Xt;break;case"sequence":(n=Hn.a).parser.yy=sr;break;case"gantt":(n=wr.a).parser.yy=Qr;break;case"class":case"classDiagram":(n=oi.a).parser.yy=cn;break;case"state":case"stateDiagram":(n=Di.a).parser.yy=Mi;break;case"info":c.debug("info info info"),(n=Sa.a).parser.yy=Ca;break;case"pie":c.debug("pie"),(n=Ra.a).parser.yy=Fa;break;case"er":c.debug("er"),(n=Xa.a).parser.yy=Ga;break;case"journey":c.debug("Journey"),(n=oo.a).parser.yy=go}return n.parser.yy.graphType=r,n.parser.yy.parseError=function(t,e){throw{str:t,hash:e}},n.parse(t),n},parseDirective:function(t,e,n,r){try{if(void 0!==e)switch(e=e.trim(),n){case"open_directive":Uo={};break;case"type_directive":Uo.type=e.toLowerCase();break;case"arg_directive":Uo.args=JSON.parse(e);break;case"close_directive":$o(t,Uo,r),Uo=null}}catch(t){c.error("Error while rendering sequenceDiagram directive: ".concat(e," jison context: ").concat(n)),c.error(t.message)}},initialize:function(t){t&&t.fontFamily&&(t.themeVariables&&t.themeVariables.fontFamily||(t.themeVariables={fontFamily:t.fontFamily})),dt=F({},t),t&&t.theme&&ht[t.theme]?t.themeVariables=ht[t.theme].getThemeVariables(t.themeVariables):t&&(t.themeVariables=ht.default.getThemeVariables(t.themeVariables));var e="object"===zo(t)?function(t){return yt=F({},gt),yt=F(yt,t),t.theme&&(yt.themeVariables=ht[t.theme].getThemeVariables(t.themeVariables)),mt=bt(yt,vt),yt}(t):xt();Wo(e),u(e.logLevel)},reinitialize:Ho,getConfig:_t,setConfig:function(t){return F(mt,t),_t()},getSiteConfig:xt,updateSiteConfig:function(t){return yt=F(yt,t),bt(yt,vt),yt},reset:function(){Et()},globalReset:function(){Et(),Wo(_t())},defaultConfig:gt});u(_t().logLevel),Et(_t());var Go=Vo,qo=function(){Xo.startOnLoad?Go.getConfig().startOnLoad&&Xo.init():void 0===Xo.startOnLoad&&(c.debug("In start, no config"),Go.getConfig().startOnLoad&&Xo.init())};"undefined"!=typeof document&&
/*!
* Wait for document loaded before starting the execution
*/
-window.addEventListener("load",(function(){Ur()}),!1);var zr={startOnLoad:!0,htmlLabels:!0,mermaidAPI:jr,parse:jr.parse,render:jr.render,init:function(){var t,e,n,r=jr.getConfig();_.debug("Starting rendering diagrams"),arguments.length>=2?(
+window.addEventListener("load",(function(){qo()}),!1);var Xo={startOnLoad:!0,htmlLabels:!0,mermaidAPI:Go,parse:Go.parse,render:Go.render,init:function(){var t,e,n=this,r=Go.getConfig();arguments.length>=2?(
/*! sequence config was passed as #1 */
-void 0!==arguments[0]&&(zr.sequenceConfig=arguments[0]),t=arguments[1]):t=arguments[0],"function"==typeof arguments[arguments.length-1]?(e=arguments[arguments.length-1],_.debug("Callback function found")):void 0!==r.mermaid&&("function"==typeof r.mermaid.callback?(e=r.mermaid.callback,_.debug("Callback function found")):_.debug("No Callback function found")),t=void 0===t?document.querySelectorAll(".mermaid"):"string"==typeof t?document.querySelectorAll(t):t instanceof window.Node?[t]:t,_.debug("Start On Load before: "+zr.startOnLoad),void 0!==zr.startOnLoad&&(_.debug("Start On Load inner: "+zr.startOnLoad),jr.initialize({startOnLoad:zr.startOnLoad})),void 0!==zr.ganttConfig&&jr.initialize({gantt:zr.ganttConfig});for(var a=function(r){var a=t[r];
-/*! Check if previously processed */if(a.getAttribute("data-processed"))return"continue";a.setAttribute("data-processed",!0);var o="mermaid-".concat(Date.now());n=a.innerHTML,n=i.a.decode(n).trim().replace(/<br\s*\/?>/gi,"<br/>"),jr.render(o,n,(function(t,n){a.innerHTML=t,void 0!==e&&e(o),n&&n(a)}),a)},o=0;o<t.length;o++)a(o)},initialize:function(t){void 0!==t.mermaid&&(void 0!==t.mermaid.startOnLoad&&(zr.startOnLoad=t.mermaid.startOnLoad),void 0!==t.mermaid.htmlLabels&&(zr.htmlLabels=t.mermaid.htmlLabels)),jr.initialize(t),_.debug("Initializing mermaid ")},contentLoaded:Ur};e.default=zr}]).default}));
+void 0!==arguments[0]&&(Xo.sequenceConfig=arguments[0]),t=arguments[1]):t=arguments[0],"function"==typeof arguments[arguments.length-1]?(e=arguments[arguments.length-1],c.debug("Callback function found")):void 0!==r.mermaid&&("function"==typeof r.mermaid.callback?(e=r.mermaid.callback,c.debug("Callback function found")):c.debug("No Callback function found")),t=void 0===t?document.querySelectorAll(".mermaid"):"string"==typeof t?document.querySelectorAll(t):t instanceof window.Node?[t]:t,c.debug("Start On Load before: "+Xo.startOnLoad),void 0!==Xo.startOnLoad&&(c.debug("Start On Load inner: "+Xo.startOnLoad),Go.updateSiteConfig({startOnLoad:Xo.startOnLoad})),void 0!==Xo.ganttConfig&&Go.updateSiteConfig({gantt:Xo.ganttConfig});for(var a,o=H.initIdGeneratior(r.deterministicIds,r.deterministicIDSeed).next,s=function(r){var s=t[r];
+/*! Check if previously processed */if(s.getAttribute("data-processed"))return"continue";s.setAttribute("data-processed",!0);var u="mermaid-".concat(o());a=i(a=s.innerHTML).trim().replace(/<br\s*\/?>/gi,"<br/>");var l=H.detectInit(a);l&&c.debug("Detected early reinit: ",l);try{Go.render(u,a,(function(t,n){s.innerHTML=t,void 0!==e&&e(u),n&&n(s)}),s)}catch(t){c.warn("Syntax Error rendering"),c.warn(t),n.parseError&&n.parseError(t)}},u=0;u<t.length;u++)s(u)},initialize:function(t){void 0!==t.mermaid&&(void 0!==t.mermaid.startOnLoad&&(Xo.startOnLoad=t.mermaid.startOnLoad),void 0!==t.mermaid.htmlLabels&&(Xo.htmlLabels=t.mermaid.htmlLabels)),Go.initialize(t)},contentLoaded:qo};e.default=Xo}]).default}));
//# sourceMappingURL=mermaid.min.js.map
\ No newline at end of file