Skip to content

Commit 9dd28d5

Browse files
aQuaaQua
authored andcommitted
更新 README.md
1 parent 1be1dd7 commit 9dd28d5

File tree

2 files changed

+12
-12
lines changed

2 files changed

+12
-12
lines changed

README.md

Lines changed: 8 additions & 8 deletions
Original file line numberDiff line numberDiff line change
@@ -23,7 +23,7 @@ $ go get github.com/aQuaYi/LeetCode-in-Go
2323
2424
| |Easy|Medium|Hard|Total|
2525
|:---:|:---:|:---:|:---:|:---:|
26-
|**Accepted**|169|289|124|582|
26+
|**Accepted**|169|290|124|583|
2727
|**Total**|172|297|128|597|
2828

2929
## 题解
@@ -444,7 +444,7 @@ $ go get github.com/aQuaYi/LeetCode-in-Go
444444
|581|[Shortest Unsorted Continuous Subarray](./Algorithms/0581.shortest-unsorted-continuous-subarray)|29%|Easy|[](https://leetcode.com/list/oussv5j)|
445445
|583|[Delete Operation for Two Strings](./Algorithms/0583.delete-operation-for-two-strings)|44%|Medium|[](https://leetcode.com/list/oussv5j)|
446446
|587|[Erect the Fence](./Algorithms/0587.erect-the-fence)|33%|Hard|[](https://leetcode.com/list/oussv5j)|
447-
|591|[Tag Validator](./Algorithms/0591.tag-validator)|31%|Hard|[](https://leetcode.com/list/oussv5j)|
447+
|591|[Tag Validator](./Algorithms/0591.tag-validator)|30%|Hard|[](https://leetcode.com/list/oussv5j)|
448448
|592|[Fraction Addition and Subtraction](./Algorithms/0592.fraction-addition-and-subtraction)|46%|Medium||
449449
|593|[Valid Square](./Algorithms/0593.valid-square)|39%|Medium||
450450
|594|[Longest Harmonious Subsequence](./Algorithms/0594.longest-harmonious-subsequence)|41%|Easy||
@@ -550,7 +550,7 @@ $ go get github.com/aQuaYi/LeetCode-in-Go
550550
|752|[Open the Lock](./Algorithms/0752.open-the-lock)|39%|Medium|[](https://leetcode.com/list/oussv5j)|
551551
|753|[Cracking the Safe](./Algorithms/0753.cracking-the-safe)|40%|Hard|[](https://leetcode.com/list/oussv5j)|
552552
|754|[Reach a Number](./Algorithms/0754.reach-a-number)|27%|Medium|[](https://leetcode.com/list/oussv5j)|
553-
|756|[Pyramid Transition Matrix](./Algorithms/0756.pyramid-transition-matrix)|46%|Medium|[](https://leetcode.com/list/oussv5j)|
553+
|756|[Pyramid Transition Matrix](./Algorithms/0756.pyramid-transition-matrix)|45%|Medium|[](https://leetcode.com/list/oussv5j)|
554554
|757|[Set Intersection Size At Least Two](./Algorithms/0757.set-intersection-size-at-least-two)|34%|Hard||
555555
|761|[Special Binary String](./Algorithms/0761.special-binary-string)|42%|Hard||
556556
|762|[Prime Number of Set Bits in Binary Representation](./Algorithms/0762.prime-number-of-set-bits-in-binary-representation)|55%|Easy||
@@ -574,7 +574,7 @@ $ go get github.com/aQuaYi/LeetCode-in-Go
574574
|783|[Minimum Distance Between BST Nodes](./Algorithms/0783.minimum-distance-between-bst-nodes)|47%|Easy||
575575
|784|[Letter Case Permutation](./Algorithms/0784.letter-case-permutation)|52%|Easy|[](https://leetcode.com/list/oussv5j)|
576576
|785|[Is Graph Bipartite?](./Algorithms/0785.is-graph-bipartite)|38%|Medium|[](https://leetcode.com/list/oussv5j)|
577-
|786|[K-th Smallest Prime Fraction](./Algorithms/0786.k-th-smallest-prime-fraction)|32%|Hard|[](https://leetcode.com/list/oussv5j)|
577+
|786|[K-th Smallest Prime Fraction](./Algorithms/0786.k-th-smallest-prime-fraction)|31%|Hard|[](https://leetcode.com/list/oussv5j)|
578578
|787|[Cheapest Flights Within K Stops](./Algorithms/0787.cheapest-flights-within-k-stops)|29%|Medium|[](https://leetcode.com/list/oussv5j)|
579579
|788|[Rotated Digits](./Algorithms/0788.rotated-digits)|50%|Easy||
580580
|789|[Escape The Ghosts](./Algorithms/0789.escape-the-ghosts)|49%|Medium||
@@ -608,11 +608,11 @@ $ go get github.com/aQuaYi/LeetCode-in-Go
608608
|818|[Race Car](./Algorithms/0818.race-car)|26%|Hard|[](https://leetcode.com/list/oussv5j)|
609609
|819|[Most Common Word](./Algorithms/0819.most-common-word)|49%|Easy||
610610
|820|[Short Encoding of Words](./Algorithms/0820.short-encoding-of-words)|40%|Medium|[](https://leetcode.com/list/oussv5j)|
611-
|821|[Shortest Distance to a Character](./Algorithms/0821.shortest-distance-to-a-character)|62%|Easy||
611+
|821|[Shortest Distance to a Character](./Algorithms/0821.shortest-distance-to-a-character)|63%|Easy||
612612
|822|[Card Flipping Game](./Algorithms/0822.card-flipping-game)|34%|Medium||
613613
|823|[Binary Trees With Factors](./Algorithms/0823.binary-trees-with-factors)|28%|Medium||
614614
|824|[Goat Latin](./Algorithms/0824.goat-latin)|56%|Easy||
615-
|825| * Friends Of Appropriate Ages|26%|Medium||
615+
|825|[Friends Of Appropriate Ages](./Algorithms/0825.friends-of-appropriate-ages)|26%|Medium||
616616
|826| * Most Profit Assigning Work|32%|Medium||
617617
|827| * Making A Large Island|41%|Hard||
618618
|828| * Unique Letter String|31%|Hard||
@@ -624,8 +624,8 @@ $ go get github.com/aQuaYi/LeetCode-in-Go
624624
|834| * Sum of Distances in Tree|29%|Hard||
625625
|835| * Image Overlap|31%|Medium||
626626
|836| * Rectangle Overlap :new: |37%|Easy||
627-
|837| * New 21 Game :new: |20%|Medium||
628-
|838| * Push Dominoes :new: |36%|Medium||
627+
|837| * New 21 Game :new: |21%|Medium||
628+
|838| * Push Dominoes :new: |37%|Medium||
629629
|839| * Similar String Groups :new: |34%|Hard||
630630

631631
以下免费的算法题,暂时不能使用 Go 解答

leetcode.json

Lines changed: 4 additions & 4 deletions
Original file line numberDiff line numberDiff line change
@@ -1,22 +1,22 @@
11
{
22
"Username": "aQuaYi",
33
"Ranking": 1089,
4-
"Updated": "2018-05-21T16:20:26.257356889+08:00",
4+
"Updated": "2018-05-21T17:00:46.344908158+08:00",
55
"Record": {
66
"Easy": {
77
"Solved": 169,
88
"Total": 172
99
},
1010
"Medium": {
11-
"Solved": 289,
11+
"Solved": 290,
1212
"Total": 297
1313
},
1414
"Hard": {
1515
"Solved": 124,
1616
"Total": 128
1717
},
1818
"Total": {
19-
"Solved": 582,
19+
"Solved": 583,
2020
"Total": 597
2121
}
2222
},
@@ -9927,7 +9927,7 @@
99279927
"TitleSlug": "friends-of-appropriate-ages",
99289928
"PassRate": "26%",
99299929
"Difficulty": "Medium",
9930-
"IsAccepted": false,
9930+
"IsAccepted": true,
99319931
"IsPaid": false,
99329932
"IsFavor": false,
99339933
"IsNew": false,

0 commit comments

Comments
 (0)