|
1 | 1 | # [LeetCode](https://leetcode.com) 的 Go 解答 |
2 | 2 |
|
3 | | -[](https://leetcode.com/aQuaYi/) |
| 3 | +[](https://leetcode.com/aQuaYi/) |
4 | 4 | [](https://codecov.io/gh/aQuaYi/LeetCode-in-Go) |
5 | 5 | [](https://www.travis-ci.org/aQuaYi/LeetCode-in-Go) |
6 | 6 |
|
|
10 | 10 |
|
11 | 11 | | |Easy|Medium|Hard|Total| |
12 | 12 | |:---:|:---:|:---:|:---:|:---:| |
13 | | -|**Accepted**|167|287|123|577| |
| 13 | +|**Accepted**|167|287|124|578| |
14 | 14 | |**Total**|171|295|127|593| |
15 | 15 |
|
16 | 16 | ## 题解 |
|
125 | 125 | |106|[Construct Binary Tree from Inorder and Postorder Traversal](./Algorithms/0106.construct-binary-tree-from-inorder-and-postorder-traversal)|34%|Medium|[❤](https://leetcode.com/list/oussv5j)| |
126 | 126 | |107|[Binary Tree Level Order Traversal II](./Algorithms/0107.binary-tree-level-order-traversal-ii)|42%|Easy|| |
127 | 127 | |108|[Convert Sorted Array to Binary Search Tree](./Algorithms/0108.convert-sorted-array-to-binary-search-tree)|44%|Easy|| |
128 | | -|109|[Convert Sorted List to Binary Search Tree](./Algorithms/0109.convert-sorted-list-to-binary-search-tree)|35%|Medium|| |
| 128 | +|109|[Convert Sorted List to Binary Search Tree](./Algorithms/0109.convert-sorted-list-to-binary-search-tree)|36%|Medium|| |
129 | 129 | |110|[Balanced Binary Tree](./Algorithms/0110.balanced-binary-tree)|38%|Easy|| |
130 | 130 | |111|[Minimum Depth of Binary Tree](./Algorithms/0111.minimum-depth-of-binary-tree)|33%|Easy|| |
131 | 131 | |112|[Path Sum](./Algorithms/0112.path-sum)|35%|Easy|| |
132 | | -|113|[Path Sum II](./Algorithms/0113.path-sum-ii)|35%|Medium|| |
| 132 | +|113|[Path Sum II](./Algorithms/0113.path-sum-ii)|36%|Medium|| |
133 | 133 | |114|[Flatten Binary Tree to Linked List](./Algorithms/0114.flatten-binary-tree-to-linked-list)|36%|Medium|[❤](https://leetcode.com/list/oussv5j)| |
134 | 134 | |115|[Distinct Subsequences](./Algorithms/0115.distinct-subsequences)|32%|Hard|[❤](https://leetcode.com/list/oussv5j)| |
135 | 135 | |118|[Pascal's Triangle](./Algorithms/0118.pascals-triangle)|40%|Easy|| |
|
532 | 532 | |745|[Prefix and Suffix Search](./Algorithms/0745.prefix-and-suffix-search)|25%|Hard|| |
533 | 533 | |746|[Min Cost Climbing Stairs](./Algorithms/0746.min-cost-climbing-stairs)|43%|Easy|| |
534 | 534 | |747|[Largest Number At Least Twice of Others](./Algorithms/0747.largest-number-at-least-twice-of-others)|41%|Easy|| |
535 | | -|748|[Shortest Completing Word](./Algorithms/0748.shortest-completing-word)|52%|Medium|| |
| 535 | +|748|[Shortest Completing Word](./Algorithms/0748.shortest-completing-word)|51%|Medium|| |
536 | 536 | |749|[Contain Virus](./Algorithms/0749.contain-virus)|40%|Hard|| |
537 | 537 | |752|[Open the Lock](./Algorithms/0752.open-the-lock)|39%|Medium|[❤](https://leetcode.com/list/oussv5j)| |
538 | 538 | |753|[Cracking the Safe](./Algorithms/0753.cracking-the-safe)|40%|Hard|[❤](https://leetcode.com/list/oussv5j)| |
|
583 | 583 | |806|[Number of Lines To Write String](./Algorithms/0806.number-of-lines-to-write-string)|63%|Easy|| |
584 | 584 | |807|[Max Increase to Keep City Skyline](./Algorithms/0807.max-increase-to-keep-city-skyline)|81%|Medium|| |
585 | 585 | |808|[Soup Servings](./Algorithms/0808.soup-servings)|32%|Medium|| |
586 | | -|809|[Expressive Words](./Algorithms/0809.expressive-words)|35%|Medium|| |
| 586 | +|809|[Expressive Words](./Algorithms/0809.expressive-words)|36%|Medium|| |
587 | 587 | |810|[Chalkboard XOR Game](./Algorithms/0810.chalkboard-xor-game)|37%|Hard|[❤](https://leetcode.com/list/oussv5j)| |
588 | 588 | |811|[Subdomain Visit Count](./Algorithms/0811.subdomain-visit-count)|63%|Easy|| |
589 | | -|812|[Largest Triangle Area](./Algorithms/0812.largest-triangle-area)|52%|Easy|| |
| 589 | +|812|[Largest Triangle Area](./Algorithms/0812.largest-triangle-area)|53%|Easy|| |
590 | 590 | |813|[Largest Sum of Averages](./Algorithms/0813.largest-sum-of-averages)|40%|Medium|[❤](https://leetcode.com/list/oussv5j)| |
591 | 591 | |814|[Binary Tree Pruning](./Algorithms/0814.binary-tree-pruning)|70%|Medium|| |
592 | 592 | |815|[Bus Routes](./Algorithms/0815.bus-routes)|32%|Hard|[❤](https://leetcode.com/list/oussv5j)| |
593 | 593 | |816|[Ambiguous Coordinates](./Algorithms/0816.ambiguous-coordinates)|41%|Medium|| |
594 | 594 | |817|[Linked List Components](./Algorithms/0817.linked-list-components)|50%|Medium|[❤](https://leetcode.com/list/oussv5j)| |
595 | | -|818| * Race Car|26%|Hard|| |
| 595 | +|818|[Race Car](./Algorithms/0818.race-car)|26%|Hard|[❤](https://leetcode.com/list/oussv5j)| |
596 | 596 | |819| * Most Common Word|49%|Easy|| |
597 | 597 | |820|[Short Encoding of Words](./Algorithms/0820.short-encoding-of-words)|40%|Medium|[❤](https://leetcode.com/list/oussv5j)| |
598 | | -|821|[Shortest Distance to a Character](./Algorithms/0821.shortest-distance-to-a-character)|62%|Easy|| |
| 598 | +|821|[Shortest Distance to a Character](./Algorithms/0821.shortest-distance-to-a-character)|63%|Easy|| |
599 | 599 | |822| * Card Flipping Game|34%|Medium|| |
600 | 600 | |823| * Binary Trees With Factors|28%|Medium|| |
601 | 601 | |824| * Goat Latin|56%|Easy|| |
602 | 602 | |825| * Friends Of Appropriate Ages|26%|Medium|| |
603 | 603 | |826| * Most Profit Assigning Work|31%|Medium|| |
604 | | -|827| * Making A Large Island|42%|Hard|| |
| 604 | +|827| * Making A Large Island|41%|Hard|| |
605 | 605 | |828| * Unique Letter String|31%|Hard|| |
606 | 606 | |829| * Consecutive Numbers Sum|25%|Medium|| |
607 | 607 | |830| * Positions of Large Groups|49%|Easy|| |
608 | 608 | |831| * Masking Personal Information|42%|Medium|| |
609 | | -|832| * Flipping an Image :new: |77%|Easy|| |
610 | | -|833| * Find And Replace in String :new: |35%|Medium|| |
611 | | -|834| * Sum of Distances in Tree :new: |29%|Hard|| |
612 | | -|835| * Image Overlap :new: |26%|Medium|| |
| 609 | +|832| * Flipping an Image :new: |75%|Easy|| |
| 610 | +|833| * Find And Replace in String :new: |36%|Medium|| |
| 611 | +|834| * Sum of Distances in Tree :new: |28%|Hard|| |
| 612 | +|835| * Image Overlap :new: |28%|Medium|| |
613 | 613 |
|
614 | 614 | 以下免费的算法题，暂时不能使用 Go 解答 |
615 | 615 |
|
|
0 commit comments