|
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 |
|
|
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|| |
|
173 | 173 | |168|[Excel Sheet Column Title](./Algorithms/0168.excel-sheet-column-title)|27%|Easy|[❤](https://leetcode.com/list/oussv5j)| |
174 | 174 | |169|[Majority Element](./Algorithms/0169.majority-element)|48%|Easy|[❤](https://leetcode.com/list/oussv5j)| |
175 | 175 | |171|[Excel Sheet Column Number](./Algorithms/0171.excel-sheet-column-number)|48%|Easy|| |
176 | | -|172|[Factorial Trailing Zeroes](./Algorithms/0172.factorial-trailing-zeroes)|37%|Easy|| |
| 176 | +|172|[Factorial Trailing Zeroes](./Algorithms/0172.factorial-trailing-zeroes)|36%|Easy|| |
177 | 177 | |174|[Dungeon Game](./Algorithms/0174.dungeon-game)|24%|Hard|[❤](https://leetcode.com/list/oussv5j)| |
178 | 178 | |179|[Largest Number](./Algorithms/0179.largest-number)|23%|Medium|[❤](https://leetcode.com/list/oussv5j)| |
179 | 179 | |187|[Repeated DNA Sequences](./Algorithms/0187.repeated-dna-sequences)|33%|Medium|| |
|
511 | 511 | |719|[Find K-th Smallest Pair Distance](./Algorithms/0719.find-k-th-smallest-pair-distance)|27%|Hard|[❤](https://leetcode.com/list/oussv5j)| |
512 | 512 | |720|[Longest Word in Dictionary](./Algorithms/0720.longest-word-in-dictionary)|41%|Easy|| |
513 | 513 | |721|[Accounts Merge](./Algorithms/0721.accounts-merge)|33%|Medium|[❤](https://leetcode.com/list/oussv5j)| |
514 | | -|722|[Remove Comments](./Algorithms/0722.remove-comments)|27%|Medium|[❤](https://leetcode.com/list/oussv5j)| |
| 514 | +|722|[Remove Comments](./Algorithms/0722.remove-comments)|28%|Medium|[❤](https://leetcode.com/list/oussv5j)| |
515 | 515 | |724|[Find Pivot Index](./Algorithms/0724.find-pivot-index)|39%|Easy|| |
516 | 516 | |725|[Split Linked List in Parts](./Algorithms/0725.split-linked-list-in-parts)|47%|Medium|| |
517 | 517 | |726|[Number of Atoms](./Algorithms/0726.number-of-atoms)|43%|Hard|[❤](https://leetcode.com/list/oussv5j)| |
|
548 | 548 | |767|[Reorganize String](./Algorithms/0767.reorganize-string)|35%|Medium|| |
549 | 549 | |768|[Max Chunks To Make Sorted II](./Algorithms/0768.max-chunks-to-make-sorted-ii)|43%|Hard|| |
550 | 550 | |769|[Max Chunks To Make Sorted](./Algorithms/0769.max-chunks-to-make-sorted)|48%|Medium|| |
551 | | -|770|[Basic Calculator IV](./Algorithms/0770.basic-calculator-iv)|40%|Hard|[❤](https://leetcode.com/list/oussv5j)| |
| 551 | +|770|[Basic Calculator IV](./Algorithms/0770.basic-calculator-iv)|41%|Hard|[❤](https://leetcode.com/list/oussv5j)| |
552 | 552 | |771|[Jewels and Stones](./Algorithms/0771.jewels-and-stones)|81%|Easy|| |
553 | 553 | |773|[Sliding Puzzle](./Algorithms/0773.sliding-puzzle)|47%|Hard|| |
554 | 554 | |775|[Global and Local Inversions](./Algorithms/0775.global-and-local-inversions)|32%|Medium|| |
|
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)|36%|Medium|| |
| 586 | +|809|[Expressive Words](./Algorithms/0809.expressive-words)|35%|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 | 589 | |812|[Largest Triangle Area](./Algorithms/0812.largest-triangle-area)|53%|Easy|| |
|
609 | 609 | |832| * Flipping an Image :new: |75%|Easy|| |
610 | 610 | |833| * Find And Replace in String :new: |36%|Medium|| |
611 | 611 | |834| * Sum of Distances in Tree :new: |29%|Hard|| |
612 | | -|835| * Image Overlap :new: |28%|Medium|| |
| 612 | +|835| * Image Overlap :new: |29%|Medium|| |
613 | 613 |
|
614 | 614 | 以下免费的算法题，暂时不能使用 Go 解答 |
615 | 615 |
|
|
0 commit comments