|
1 | 1 | # [LeetCode](https://leetcode.com) 的 Go 解答
|
2 | 2 |
|
3 | 3 | [](https://leetcode.com/aQuaYi/)
|
4 |
| -[](https://leetcode.com/aQuaYi/) |
5 |
| -[](https://leetcode.com/aQuaYi/) |
| 4 | +[](https://leetcode.com/aQuaYi/) |
| 5 | +[](https://leetcode.com/aQuaYi/) |
6 | 6 | [](https://www.travis-ci.org/aQuaYi/LeetCode-in-Go)
|
7 | 7 | [](https://codecov.io/gh/aQuaYi/LeetCode-in-Go)
|
8 | 8 |
|
|
12 | 12 |
|
13 | 13 | | |Easy|Medium|Hard|Total|
|
14 | 14 | |:---:|:---:|:---:|:---:|:---:|
|
15 |
| -|**Accepted**|82|145|61|288| |
| 15 | +|**Accepted**|82|146|61|289| |
16 | 16 | |**Total**|145|245|99|489|
|
17 | 17 |
|
18 | 18 | ## 题解
|
|
292 | 292 | |377|[Combination Sum IV](./Algorithms/0377.combination-sum-iv)|42%|Medium| |
|
293 | 293 | |378| * Kth Smallest Element in a Sorted Matrix|45%|Medium| |
|
294 | 294 | |380|[Insert Delete GetRandom O(1)](./Algorithms/0380.insert-delete-getrandom-o1)|39%|Medium|[❤](https://leetcode.com/list/oussv5j)|
|
295 |
| -|381|[Insert Delete GetRandom O(1) - Duplicates allowed](./Algorithms/0381.insert-delete-getrandom-o1-duplicates-allowed)|28%|Hard|[❤](https://leetcode.com/list/oussv5j)| |
| 295 | +|381|[Insert Delete GetRandom O(1) - Duplicates allowed](./Algorithms/0381.insert-delete-getrandom-o1-duplicates-allowed)|29%|Hard|[❤](https://leetcode.com/list/oussv5j)| |
296 | 296 | |382| * Linked List Random Node|47%|Medium| |
|
297 | 297 | |383|[Ransom Note](./Algorithms/0383.ransom-note)|47%|Easy| |
|
298 | 298 | |384| * Shuffle an Array|46%|Medium| |
|
|
324 | 324 | |413|[Arithmetic Slices](./Algorithms/0413.arithmetic-slices)|54%|Medium| |
|
325 | 325 | |414|[Third Maximum Number](./Algorithms/0414.third-maximum-number)|27%|Easy| |
|
326 | 326 | |415| * Add Strings|41%|Easy| |
|
327 |
| -|416| * Partition Equal Subset Sum|39%|Medium| | |
| 327 | +|416|[Partition Equal Subset Sum](./Algorithms/0416.partition-equal-subset-sum)|39%|Medium|[❤](https://leetcode.com/list/oussv5j)| |
328 | 328 | |417| * Pacific Atlantic Water Flow|33%|Medium| |
|
329 | 329 | |419| * Battleships in a Board|62%|Medium| |
|
330 | 330 | |420| * Strong Password Checker|20%|Hard| |
|
|
434 | 434 | |591| * Tag Validator|29%|Hard| |
|
435 | 435 | |592| * Fraction Addition and Subtraction|46%|Medium| |
|
436 | 436 | |593| * Valid Square|40%|Medium| |
|
437 |
| -|594| * Longest Harmonious Subsequence|41%|Easy| | |
| 437 | +|594| * Longest Harmonious Subsequence|40%|Easy| | |
438 | 438 | |598| * Range Addition II|48%|Easy| |
|
439 | 439 | |599| * Minimum Index Sum of Two Lists|46%|Easy| |
|
440 | 440 | |600| * Non-negative Integers without Consecutive Ones|30%|Hard| |
|
|
506 | 506 | |699| * Falling Squares|36%|Hard| |
|
507 | 507 | |712| * Minimum ASCII Delete Sum for Two Strings|48%|Medium| |
|
508 | 508 | |713| * Subarray Product Less Than K|34%|Medium| |
|
509 |
| -|714| * Best Time to Buy and Sell Stock with Transaction Fee|29%|Medium| | |
| 509 | +|714| * Best Time to Buy and Sell Stock with Transaction Fee|30%|Medium| | |
510 | 510 | |715| * Range Module|30%|Hard| |
|
511 | 511 |
|
512 | 512 | 以下免费的算法题,暂时不能使用 Go 解答
|
|
0 commit comments