Skip to content
This repository was archived by the owner on Sep 20, 2023. It is now read-only.

Commit 919eea7

Browse files
aQuaYiaQuaYi
committed
更新 README.md
1 parent 266d80e commit 919eea7

File tree

3 files changed

+35
-35
lines changed

3 files changed

+35
-35
lines changed

‎Favorite.md

Lines changed: 3 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -193,7 +193,7 @@
193193
|685|[Redundant Connection II](./Algorithms/0685.redundant-connection-ii)|28%|Hard|[❤](https://leetcode.com/list/oussv5j)|
194194
|686|[Repeated String Match](./Algorithms/0686.repeated-string-match)|31%|Easy|[❤](https://leetcode.com/list/oussv5j)|
195195
|691|[Stickers to Spell Word](./Algorithms/0691.stickers-to-spell-word)|36%|Hard|[❤](https://leetcode.com/list/oussv5j)|
196-
|695|[Max Area of Island](./Algorithms/0695.max-area-of-island)|53%|Easy|[❤](https://leetcode.com/list/oussv5j)|
196+
|695|[Max Area of Island](./Algorithms/0695.max-area-of-island)|53%|Medium|[❤](https://leetcode.com/list/oussv5j)|
197197
|698|[Partition to K Equal Sum Subsets](./Algorithms/0698.partition-to-k-equal-sum-subsets)|38%|Medium|[❤](https://leetcode.com/list/oussv5j)|
198198
|707|[Design Linked List](./Algorithms/0707.design-linked-list)|18%|Easy|[❤](https://leetcode.com/list/oussv5j)|
199199
|710|[Random Pick with Blacklist](./Algorithms/0710.random-pick-with-blacklist)|29%|Hard|[❤](https://leetcode.com/list/oussv5j)|
@@ -216,7 +216,7 @@
216216
|756|[Pyramid Transition Matrix](./Algorithms/0756.pyramid-transition-matrix)|47%|Medium|[❤](https://leetcode.com/list/oussv5j)|
217217
|770|[Basic Calculator IV](./Algorithms/0770.basic-calculator-iv)|42%|Hard|[❤](https://leetcode.com/list/oussv5j)|
218218
|784|[Letter Case Permutation](./Algorithms/0784.letter-case-permutation)|53%|Easy|[❤](https://leetcode.com/list/oussv5j)|
219-
|785|[Is Graph Bipartite?](./Algorithms/0785.is-graph-bipartite)|39%|Medium|[❤](https://leetcode.com/list/oussv5j)|
219+
|785|[Is Graph Bipartite?](./Algorithms/0785.is-graph-bipartite)|40%|Medium|[❤](https://leetcode.com/list/oussv5j)|
220220
|786|[K-th Smallest Prime Fraction](./Algorithms/0786.k-th-smallest-prime-fraction)|35%|Hard|[❤](https://leetcode.com/list/oussv5j)|
221221
|787|[Cheapest Flights Within K Stops](./Algorithms/0787.cheapest-flights-within-k-stops)|30%|Medium|[❤](https://leetcode.com/list/oussv5j)|
222222
|790|[Domino and Tromino Tiling](./Algorithms/0790.domino-and-tromino-tiling)|33%|Medium|[❤](https://leetcode.com/list/oussv5j)|
@@ -250,7 +250,7 @@
250250
|851|[Loud and Rich](./Algorithms/0851.loud-and-rich)|44%|Medium|[❤](https://leetcode.com/list/oussv5j)|
251251
|852|[Peak Index in a Mountain Array](./Algorithms/0852.peak-index-in-a-mountain-array)|66%|Easy|[❤](https://leetcode.com/list/oussv5j)|
252252
|854|[K-Similar Strings](./Algorithms/0854.k-similar-strings)|31%|Hard|[❤](https://leetcode.com/list/oussv5j)|
253-
|857|[Minimum Cost to Hire K Workers](./Algorithms/0857.minimum-cost-to-hire-k-workers)|43%|Hard|[❤](https://leetcode.com/list/oussv5j)|
253+
|857|[Minimum Cost to Hire K Workers](./Algorithms/0857.minimum-cost-to-hire-k-workers)|42%|Hard|[❤](https://leetcode.com/list/oussv5j)|
254254
|862|[Shortest Subarray with Sum at Least K](./Algorithms/0862.shortest-subarray-with-sum-at-least-k)|19%|Hard|[❤](https://leetcode.com/list/oussv5j)|
255255
|863|[All Nodes Distance K in Binary Tree](./Algorithms/0863.all-nodes-distance-k-in-binary-tree)|42%|Medium|[❤](https://leetcode.com/list/oussv5j)|
256256
|864|[Shortest Path to Get All Keys](./Algorithms/0864.shortest-path-to-get-all-keys)|33%|Hard|[❤](https://leetcode.com/list/oussv5j)|

‎README.md

Lines changed: 13 additions & 13 deletions
Original file line numberDiff line numberDiff line change
@@ -10,15 +10,15 @@
1010
1111
| |Easy|Medium|Hard|Total|
1212
|:---:|:---:|:---:|:---:|:---:|
13-
|**Accepted**|202|331|144|677|
14-
|**Total**|206|344|151|701|
13+
|**Accepted**|201|332|144|677|
14+
|**Total**|205|345|151|701|
1515

1616
## 题解
1717

1818
|题号|题目|通过率|难度|收藏|
1919
|:-:|:-|:-: | :-: | :-: |
2020
|924| * [Minimize Malware Spread](https://leetcode.com/problems/minimize-malware-spread/) :new: |33%|Hard||
21-
|923| * [3Sum With Multiplicity](https://leetcode.com/problems/3sum-with-multiplicity/) :new: |25%|Medium||
21+
|923| * [3Sum With Multiplicity](https://leetcode.com/problems/3sum-with-multiplicity/) :new: |26%|Medium||
2222
|922| * [Sort Array By Parity II](https://leetcode.com/problems/sort-array-by-parity-ii/) :new: |68%|Easy||
2323
|921| * [Minimum Add to Make Parentheses Valid](https://leetcode.com/problems/minimum-add-to-make-parentheses-valid/) :new: |74%|Medium||
2424
|920| * [Number of Music Playlists](https://leetcode.com/problems/number-of-music-playlists/)|39%|Hard||
@@ -27,16 +27,16 @@
2727
|917| * [Reverse Only Letters](https://leetcode.com/problems/reverse-only-letters/)|57%|Easy||
2828
|916| * [Word Subsets](https://leetcode.com/problems/word-subsets/)|42%|Medium||
2929
|915| * [Partition Array into Disjoint Intervals](https://leetcode.com/problems/partition-array-into-disjoint-intervals/)|39%|Medium||
30-
|914| * [X of a Kind in a Deck of Cards](https://leetcode.com/problems/x-of-a-kind-in-a-deck-of-cards/)|33%|Easy||
30+
|914| * [X of a Kind in a Deck of Cards](https://leetcode.com/problems/x-of-a-kind-in-a-deck-of-cards/)|32%|Easy||
3131
|913| * [Cat and Mouse](https://leetcode.com/problems/cat-and-mouse/)|21%|Hard||
3232
|911| * [Online Election](https://leetcode.com/problems/online-election/)|42%|Medium||
3333
|910| * [Smallest Range II](https://leetcode.com/problems/smallest-range-ii/)|19%|Medium||
34-
|909| * [Snakes and Ladders](https://leetcode.com/problems/snakes-and-ladders/)|24%|Medium||
34+
|909| * [Snakes and Ladders](https://leetcode.com/problems/snakes-and-ladders/)|25%|Medium||
3535
|908| * [Smallest Range I](https://leetcode.com/problems/smallest-range-i/)|63%|Easy||
3636
|907| * [Sum of Subarray Minimums](https://leetcode.com/problems/sum-of-subarray-minimums/)|20%|Medium||
3737
|906| * [Super Palindromes](https://leetcode.com/problems/super-palindromes/)|28%|Hard||
3838
|905|[Sort Array By Parity](./Algorithms/0905.sort-array-by-parity)|70%|Easy||
39-
|904| * [Fruit Into Baskets](https://leetcode.com/problems/fruit-into-baskets/)|37%|Medium||
39+
|904| * [Fruit Into Baskets](https://leetcode.com/problems/fruit-into-baskets/)|38%|Medium||
4040
|903| * [Valid Permutations for DI Sequence](https://leetcode.com/problems/valid-permutations-for-di-sequence/)|39%|Hard||
4141
|902| * [Numbers At Most N Given Digit Set](https://leetcode.com/problems/numbers-at-most-n-given-digit-set/)|25%|Hard||
4242
|901| * [Online Stock Span](https://leetcode.com/problems/online-stock-span/)|42%|Medium||
@@ -54,7 +54,7 @@
5454
|889|[Construct Binary Tree from Preorder and Postorder Traversal](./Algorithms/0889.construct-binary-tree-from-preorder-and-postorder-traversal)|54%|Medium||
5555
|888|[Fair Candy Swap](./Algorithms/0888.fair-candy-swap)|53%|Easy||
5656
|887|[Super Egg Drop](./Algorithms/0887.super-egg-drop)|22%|Hard||
57-
|886|[Possible Bipartition](./Algorithms/0886.possible-bipartition)|38%|Medium||
57+
|886|[Possible Bipartition](./Algorithms/0886.possible-bipartition)|39%|Medium||
5858
|885|[Spiral Matrix III](./Algorithms/0885.spiral-matrix-iii)|62%|Medium||
5959
|884|[Uncommon Words from Two Sentences](./Algorithms/0884.uncommon-words-from-two-sentences)|60%|Easy||
6060
|883|[Projection Area of 3D Shapes](./Algorithms/0883.projection-area-of-3d-shapes)|64%|Easy||
@@ -83,7 +83,7 @@
8383
|860|[Lemonade Change](./Algorithms/0860.lemonade-change)|49%|Easy||
8484
|859|[Buddy Strings](./Algorithms/0859.buddy-strings)|26%|Easy||
8585
|858|[Mirror Reflection](./Algorithms/0858.mirror-reflection)|49%|Medium||
86-
|857|[Minimum Cost to Hire K Workers](./Algorithms/0857.minimum-cost-to-hire-k-workers)|43%|Hard|[❤](https://leetcode.com/list/oussv5j)|
86+
|857|[Minimum Cost to Hire K Workers](./Algorithms/0857.minimum-cost-to-hire-k-workers)|42%|Hard|[❤](https://leetcode.com/list/oussv5j)|
8787
|856|[Score of Parentheses](./Algorithms/0856.score-of-parentheses)|53%|Medium||
8888
|855|[Exam Room](./Algorithms/0855.exam-room)|32%|Medium||
8989
|854|[K-Similar Strings](./Algorithms/0854.k-similar-strings)|31%|Hard|[❤](https://leetcode.com/list/oussv5j)|
@@ -154,10 +154,10 @@
154154
|788|[Rotated Digits](./Algorithms/0788.rotated-digits)|50%|Easy||
155155
|787|[Cheapest Flights Within K Stops](./Algorithms/0787.cheapest-flights-within-k-stops)|30%|Medium|[❤](https://leetcode.com/list/oussv5j)|
156156
|786|[K-th Smallest Prime Fraction](./Algorithms/0786.k-th-smallest-prime-fraction)|35%|Hard|[❤](https://leetcode.com/list/oussv5j)|
157-
|785|[Is Graph Bipartite?](./Algorithms/0785.is-graph-bipartite)|39%|Medium|[❤](https://leetcode.com/list/oussv5j)|
157+
|785|[Is Graph Bipartite?](./Algorithms/0785.is-graph-bipartite)|40%|Medium|[❤](https://leetcode.com/list/oussv5j)|
158158
|784|[Letter Case Permutation](./Algorithms/0784.letter-case-permutation)|53%|Easy|[❤](https://leetcode.com/list/oussv5j)|
159159
|783|[Minimum Distance Between BST Nodes](./Algorithms/0783.minimum-distance-between-bst-nodes)|48%|Easy||
160-
|782|[Transform to Chessboard](./Algorithms/0782.transform-to-chessboard)|37%|Hard||
160+
|782|[Transform to Chessboard](./Algorithms/0782.transform-to-chessboard)|38%|Hard||
161161
|781|[Rabbits in Forest](./Algorithms/0781.rabbits-in-forest)|49%|Medium||
162162
|780|[Reaching Points](./Algorithms/0780.reaching-points)|24%|Hard||
163163
|779|[K-th Symbol in Grammar](./Algorithms/0779.k-th-symbol-in-grammar)|37%|Medium||
@@ -226,7 +226,7 @@
226226
|698|[Partition to K Equal Sum Subsets](./Algorithms/0698.partition-to-k-equal-sum-subsets)|38%|Medium|[❤](https://leetcode.com/list/oussv5j)|
227227
|697|[Degree of an Array](./Algorithms/0697.degree-of-an-array)|47%|Easy||
228228
|696|[Count Binary Substrings](./Algorithms/0696.count-binary-substrings)|51%|Easy||
229-
|695|[Max Area of Island](./Algorithms/0695.max-area-of-island)|53%|Easy|[❤](https://leetcode.com/list/oussv5j)|
229+
|695|[Max Area of Island](./Algorithms/0695.max-area-of-island)|53%|Medium|[❤](https://leetcode.com/list/oussv5j)|
230230
|693|[Binary Number with Alternating Bits](./Algorithms/0693.binary-number-with-alternating-bits)|56%|Easy||
231231
|692|[Top K Frequent Words](./Algorithms/0692.top-k-frequent-words)|42%|Medium||
232232
|691|[Stickers to Spell Word](./Algorithms/0691.stickers-to-spell-word)|36%|Hard|[❤](https://leetcode.com/list/oussv5j)|
@@ -500,7 +500,7 @@
500500
|299|[Bulls and Cows](./Algorithms/0299.bulls-and-cows)|37%|Medium||
501501
|295|[Find Median from Data Stream](./Algorithms/0295.find-median-from-data-stream)|32%|Hard|[❤](https://leetcode.com/list/oussv5j)|
502502
|292|[Nim Game](./Algorithms/0292.nim-game)|55%|Easy|[❤](https://leetcode.com/list/oussv5j)|
503-
|290|[Word Pattern](./Algorithms/0290.word-pattern)|33%|Easy||
503+
|290|[Word Pattern](./Algorithms/0290.word-pattern)|34%|Easy||
504504
|289|[Game of Life](./Algorithms/0289.game-of-life)|40%|Medium|[❤](https://leetcode.com/list/oussv5j)|
505505
|287|[Find the Duplicate Number](./Algorithms/0287.find-the-duplicate-number)|46%|Medium|[❤](https://leetcode.com/list/oussv5j)|
506506
|283|[Move Zeroes](./Algorithms/0283.move-zeroes)|52%|Easy||
@@ -616,7 +616,7 @@
616616
|105|[Construct Binary Tree from Preorder and Inorder Traversal](./Algorithms/0105.construct-binary-tree-from-preorder-and-inorder-traversal)|37%|Medium|[❤](https://leetcode.com/list/oussv5j)|
617617
|104|[Maximum Depth of Binary Tree](./Algorithms/0104.maximum-depth-of-binary-tree)|57%|Easy||
618618
|103|[Binary Tree Zigzag Level Order Traversal](./Algorithms/0103.binary-tree-zigzag-level-order-traversal)|38%|Medium||
619-
|102|[Binary Tree Level Order Traversal](./Algorithms/0102.binary-tree-level-order-traversal)|44%|Medium||
619+
|102|[Binary Tree Level Order Traversal](./Algorithms/0102.binary-tree-level-order-traversal)|45%|Medium||
620620
|101|[Symmetric Tree](./Algorithms/0101.symmetric-tree)|41%|Easy|[❤](https://leetcode.com/list/oussv5j)|
621621
|100|[Same Tree](./Algorithms/0100.same-tree)|48%|Easy||
622622
|99|[Recover Binary Search Tree](./Algorithms/0099.recover-binary-search-tree)|32%|Hard|[❤](https://leetcode.com/list/oussv5j)|

‎leetcode.json

Lines changed: 19 additions & 19 deletions
Original file line numberDiff line numberDiff line change
@@ -1,15 +1,15 @@
11
{
22
"Username": "aQuaYi",
33
"Ranking": 836,
4-
"Updated": "2018-10-15T19:42:10.554323279+08:00",
4+
"Updated": "2018-10-16T09:01:52.190428719+08:00",
55
"Record": {
66
"Easy": {
7-
"Solved": 202,
8-
"Total": 206
7+
"Solved": 201,
8+
"Total": 205
99
},
1010
"Medium": {
11-
"Solved": 331,
12-
"Total": 344
11+
"Solved": 332,
12+
"Total": 345
1313
},
1414
"Hard": {
1515
"Solved": 144,
@@ -1249,7 +1249,7 @@
12491249
"ID": 102,
12501250
"Title": "Binary Tree Level Order Traversal",
12511251
"TitleSlug": "binary-tree-level-order-traversal",
1252-
"PassRate": "44%",
1252+
"PassRate": "45%",
12531253
"Difficulty": "Medium",
12541254
"IsAccepted": true,
12551255
"IsPaid": false,
@@ -3505,7 +3505,7 @@
35053505
"ID": 290,
35063506
"Title": "Word Pattern",
35073507
"TitleSlug": "word-pattern",
3508-
"PassRate": "33%",
3508+
"PassRate": "34%",
35093509
"Difficulty": "Easy",
35103510
"IsAccepted": true,
35113511
"IsPaid": false,
@@ -4453,7 +4453,7 @@
44534453
"ID": 369,
44544454
"Title": "Plus One Linked List",
44554455
"TitleSlug": "plus-one-linked-list",
4456-
"PassRate": "55%",
4456+
"PassRate": "54%",
44574457
"Difficulty": "Medium",
44584458
"IsAccepted": false,
44594459
"IsPaid": true,
@@ -5893,7 +5893,7 @@
58935893
"ID": 489,
58945894
"Title": "Robot Room Cleaner",
58955895
"TitleSlug": "robot-room-cleaner",
5896-
"PassRate": "53%",
5896+
"PassRate": "54%",
58975897
"Difficulty": "Hard",
58985898
"IsAccepted": false,
58995899
"IsPaid": true,
@@ -6721,7 +6721,7 @@
67216721
"ID": 558,
67226722
"Title": "Quad Tree Intersection",
67236723
"TitleSlug": "quad-tree-intersection",
6724-
"PassRate": "34%",
6724+
"PassRate": "35%",
67256725
"Difficulty": "Easy",
67266726
"IsAccepted": false,
67276727
"IsPaid": false,
@@ -8366,7 +8366,7 @@
83668366
"Title": "Max Area of Island",
83678367
"TitleSlug": "max-area-of-island",
83688368
"PassRate": "53%",
8369-
"Difficulty": "Easy",
8369+
"Difficulty": "Medium",
83708370
"IsAccepted": true,
83718371
"IsPaid": false,
83728372
"IsFavor": true,
@@ -9409,7 +9409,7 @@
94099409
"ID": 782,
94109410
"Title": "Transform to Chessboard",
94119411
"TitleSlug": "transform-to-chessboard",
9412-
"PassRate": "37%",
9412+
"PassRate": "38%",
94139413
"Difficulty": "Hard",
94149414
"IsAccepted": true,
94159415
"IsPaid": false,
@@ -9445,7 +9445,7 @@
94459445
"ID": 785,
94469446
"Title": "Is Graph Bipartite?",
94479447
"TitleSlug": "is-graph-bipartite",
9448-
"PassRate": "39%",
9448+
"PassRate": "40%",
94499449
"Difficulty": "Medium",
94509450
"IsAccepted": true,
94519451
"IsPaid": false,
@@ -10309,7 +10309,7 @@
1030910309
"ID": 857,
1031010310
"Title": "Minimum Cost to Hire K Workers",
1031110311
"TitleSlug": "minimum-cost-to-hire-k-workers",
10312-
"PassRate": "43%",
10312+
"PassRate": "42%",
1031310313
"Difficulty": "Hard",
1031410314
"IsAccepted": true,
1031510315
"IsPaid": false,
@@ -10657,7 +10657,7 @@
1065710657
"ID": 886,
1065810658
"Title": "Possible Bipartition",
1065910659
"TitleSlug": "possible-bipartition",
10660-
"PassRate": "38%",
10660+
"PassRate": "39%",
1066110661
"Difficulty": "Medium",
1066210662
"IsAccepted": true,
1066310663
"IsPaid": false,
@@ -10873,7 +10873,7 @@
1087310873
"ID": 904,
1087410874
"Title": "Fruit Into Baskets",
1087510875
"TitleSlug": "fruit-into-baskets",
10876-
"PassRate": "37%",
10876+
"PassRate": "38%",
1087710877
"Difficulty": "Medium",
1087810878
"IsAccepted": false,
1087910879
"IsPaid": false,
@@ -10933,7 +10933,7 @@
1093310933
"ID": 909,
1093410934
"Title": "Snakes and Ladders",
1093510935
"TitleSlug": "snakes-and-ladders",
10936-
"PassRate": "24%",
10936+
"PassRate": "25%",
1093710937
"Difficulty": "Medium",
1093810938
"IsAccepted": false,
1093910939
"IsPaid": false,
@@ -10993,7 +10993,7 @@
1099310993
"ID": 914,
1099410994
"Title": "X of a Kind in a Deck of Cards",
1099510995
"TitleSlug": "x-of-a-kind-in-a-deck-of-cards",
10996-
"PassRate": "33%",
10996+
"PassRate": "32%",
1099710997
"Difficulty": "Easy",
1099810998
"IsAccepted": false,
1099910999
"IsPaid": false,
@@ -11101,7 +11101,7 @@
1110111101
"ID": 923,
1110211102
"Title": "3Sum With Multiplicity",
1110311103
"TitleSlug": "3sum-with-multiplicity",
11104-
"PassRate": "25%",
11104+
"PassRate": "26%",
1110511105
"Difficulty": "Medium",
1110611106
"IsAccepted": false,
1110711107
"IsPaid": false,

0 commit comments

Comments
 (0)