|
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 | [](https://golang.google.cn) |
|
11 | 11 |
|
12 | 12 | | |Easy|Medium|Hard|Total| |
13 | 13 | |:---:|:---:|:---:|:---:|:---:| |
14 | | -|**Accepted**|253|434|180|867| |
| 14 | +|**Accepted**|253|435|180|868| |
15 | 15 | |**Total**|255|441|182|878| |
16 | 16 |
|
17 | 17 | ## 题解 |
18 | 18 |
|
19 | 19 | |题号|题目|通过率|难度|收藏| |
20 | 20 | |:-:|:-|:-: | :-: | :-: | |
21 | | -|[1140](https://leetcode.com/problems/stone-game-ii/)| * Stone Game II :new: |60%|Medium|| |
| 21 | +|[1140](https://leetcode.com/problems/stone-game-ii/)| * Stone Game II :new: |61%|Medium|| |
22 | 22 | |[1139](https://leetcode.com/problems/largest-1-bordered-square/)| * Largest 1-Bordered Square :new: |41%|Medium|| |
23 | 23 | |[1138](https://leetcode.com/problems/alphabet-board-path/)| * Alphabet Board Path :new: |41%|Medium|| |
24 | 24 | |[1137](https://leetcode.com/problems/n-th-tribonacci-number/)| * N-th Tribonacci Number|63%|Easy|| |
|
27 | 27 | |[1129](https://leetcode.com/problems/shortest-path-with-alternating-colors/)| * Shortest Path with Alternating Colors|35%|Medium|| |
28 | 28 | |[1128](https://leetcode.com/problems/number-of-equivalent-domino-pairs/)| * Number of Equivalent Domino Pairs|43%|Easy|| |
29 | 29 | |[1125](https://leetcode.com/problems/smallest-sufficient-team/)| * Smallest Sufficient Team|45%|Hard|| |
30 | | -|[1124](https://leetcode.com/problems/longest-well-performing-interval/)| * Longest Well-Performing Interval|29%|Medium|| |
| 30 | +|[1124](https://leetcode.com/problems/longest-well-performing-interval/)|[Longest Well-Performing Interval](./Algorithms/1124.longest-well-performing-interval)|29%|Medium|| |
31 | 31 | |[1123](https://leetcode.com/problems/lowest-common-ancestor-of-deepest-leaves/)|[Lowest Common Ancestor of Deepest Leaves](./Algorithms/1123.lowest-common-ancestor-of-deepest-leaves)|63%|Medium|| |
32 | 32 | |[1122](https://leetcode.com/problems/relative-sort-array/)|[Relative Sort Array](./Algorithms/1122.relative-sort-array)|67%|Easy|| |
33 | 33 | |[1111](https://leetcode.com/problems/maximum-nesting-depth-of-two-valid-parentheses-strings/)|[Maximum Nesting Depth of Two Valid Parentheses Strings](./Algorithms/1111.maximum-nesting-depth-of-two-valid-parentheses-strings)|64%|Medium|| |
|
236 | 236 | |[0873](https://leetcode.com/problems/length-of-longest-fibonacci-subsequence/)|[Length of Longest Fibonacci Subsequence](./Algorithms/0873.length-of-longest-fibonacci-subsequence)|46%|Medium|| |
237 | 237 | |[0872](https://leetcode.com/problems/leaf-similar-trees/)|[Leaf-Similar Trees](./Algorithms/0872.leaf-similar-trees)|63%|Easy|| |
238 | 238 | |[0871](https://leetcode.com/problems/minimum-number-of-refueling-stops/)|[Minimum Number of Refueling Stops](./Algorithms/0871.minimum-number-of-refueling-stops)|29%|Hard|| |
239 | | -|[0870](https://leetcode.com/problems/advantage-shuffle/)|[Advantage Shuffle](./Algorithms/0870.advantage-shuffle)|42%|Medium|| |
| 239 | +|[0870](https://leetcode.com/problems/advantage-shuffle/)|[Advantage Shuffle](./Algorithms/0870.advantage-shuffle)|43%|Medium|| |
240 | 240 | |[0869](https://leetcode.com/problems/reordered-power-of-2/)|[Reordered Power of 2](./Algorithms/0869.reordered-power-of-2)|51%|Medium|| |
241 | 241 | |[0868](https://leetcode.com/problems/binary-gap/)|[Binary Gap](./Algorithms/0868.binary-gap)|59%|Easy|| |
242 | 242 | |[0867](https://leetcode.com/problems/transpose-matrix/)|[Transpose Matrix](./Algorithms/0867.transpose-matrix)|63%|Easy|| |
|
0 commit comments