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

Commit 5a25fe8

Browse files
committed
合并了错误
2 parents 8811ed1 + 8ebd55b commit 5a25fe8

File tree

3 files changed

+34
-26
lines changed

3 files changed

+34
-26
lines changed

Favorite.md

+2-2
Original file line numberDiff line numberDiff line change
@@ -64,7 +64,7 @@
6464
|[0273](https://leetcode.com/problems/integer-to-english-words/)|[Integer to English Words](./Algorithms/0273.integer-to-english-words)|25%|Hard|[](https://leetcode.com/list/oussv5j)|
6565
|[0275](https://leetcode.com/problems/h-index-ii/)|[H-Index II](./Algorithms/0275.h-index-ii)|35%|Medium|[](https://leetcode.com/list/oussv5j)|
6666
|[0279](https://leetcode.com/problems/perfect-squares/)|[Perfect Squares](./Algorithms/0279.perfect-squares)|43%|Medium|[](https://leetcode.com/list/oussv5j)|
67-
|[0282](https://leetcode.com/problems/expression-add-operators/)|[Expression Add Operators](./Algorithms/0282.expression-add-operators)|33%|Hard|[](https://leetcode.com/list/oussv5j)|
67+
|[0282](https://leetcode.com/problems/expression-add-operators/)|[Expression Add Operators](./Algorithms/0282.expression-add-operators)|34%|Hard|[](https://leetcode.com/list/oussv5j)|
6868
|[0287](https://leetcode.com/problems/find-the-duplicate-number/)|[Find the Duplicate Number](./Algorithms/0287.find-the-duplicate-number)|51%|Medium|[](https://leetcode.com/list/oussv5j)|
6969
|[0289](https://leetcode.com/problems/game-of-life/)|[Game of Life](./Algorithms/0289.game-of-life)|48%|Medium|[](https://leetcode.com/list/oussv5j)|
7070
|[0292](https://leetcode.com/problems/nim-game/)|[Nim Game](./Algorithms/0292.nim-game)|55%|Easy|[](https://leetcode.com/list/oussv5j)|
@@ -225,7 +225,7 @@
225225
|[0815](https://leetcode.com/problems/bus-routes/)|[Bus Routes](./Algorithms/0815.bus-routes)|41%|Hard|[](https://leetcode.com/list/oussv5j)|
226226
|[0818](https://leetcode.com/problems/race-car/)|[Race Car](./Algorithms/0818.race-car)|37%|Hard|[](https://leetcode.com/list/oussv5j)|
227227
|[0820](https://leetcode.com/problems/short-encoding-of-words/)|[Short Encoding of Words](./Algorithms/0820.short-encoding-of-words)|48%|Medium|[](https://leetcode.com/list/oussv5j)|
228-
|[0826](https://leetcode.com/problems/most-profit-assigning-work/)|[Most Profit Assigning Work](./Algorithms/0826.most-profit-assigning-work)|36%|Medium|[](https://leetcode.com/list/oussv5j)|
228+
|[0826](https://leetcode.com/problems/most-profit-assigning-work/)|[Most Profit Assigning Work](./Algorithms/0826.most-profit-assigning-work)|37%|Medium|[](https://leetcode.com/list/oussv5j)|
229229
|[0827](https://leetcode.com/problems/making-a-large-island/)|[Making A Large Island](./Algorithms/0827.making-a-large-island)|44%|Hard|[](https://leetcode.com/list/oussv5j)|
230230
|[0828](https://leetcode.com/problems/unique-letter-string/)|[Unique Letter String](./Algorithms/0828.unique-letter-string)|41%|Hard|[](https://leetcode.com/list/oussv5j)|
231231
|[0829](https://leetcode.com/problems/consecutive-numbers-sum/)|[Consecutive Numbers Sum](./Algorithms/0829.consecutive-numbers-sum)|35%|Hard|[](https://leetcode.com/list/oussv5j)|

README.md

+11-11
Original file line numberDiff line numberDiff line change
@@ -59,12 +59,12 @@
5959

6060
|题号|题目|通过率|难度|收藏|
6161
|:-:|:-|:-: | :-: | :-: |
62-
|[1250](https://leetcode.com/problems/check-if-it-is-a-good-array/)| * Check If It Is a Good Array|44%|Hard||
63-
|[1249](https://leetcode.com/problems/minimum-remove-to-make-valid-parentheses/)| * Minimum Remove to Make Valid Parentheses|54%|Medium||
64-
|[1248](https://leetcode.com/problems/count-number-of-nice-subarrays/)| * Count Number of Nice Subarrays|48%|Medium||
65-
|[1247](https://leetcode.com/problems/minimum-swaps-to-make-strings-equal/)| * Minimum Swaps to Make Strings Equal|54%|Easy||
66-
|[1246](https://leetcode.com/problems/palindrome-removal/)| * Palindrome Removal|40%|Hard||
67-
|[1245](https://leetcode.com/problems/tree-diameter/)| * Tree Diameter|50%|Medium||
62+
|[1250](https://leetcode.com/problems/check-if-it-is-a-good-array/)| * Check If It Is a Good Array|45%|Hard||
63+
|[1249](https://leetcode.com/problems/minimum-remove-to-make-valid-parentheses/)| * Minimum Remove to Make Valid Parentheses|55%|Medium||
64+
|[1248](https://leetcode.com/problems/count-number-of-nice-subarrays/)| * Count Number of Nice Subarrays|49%|Medium||
65+
|[1247](https://leetcode.com/problems/minimum-swaps-to-make-strings-equal/)| * Minimum Swaps to Make Strings Equal|55%|Easy||
66+
|[1246](https://leetcode.com/problems/palindrome-removal/)| * Palindrome Removal|41%|Hard||
67+
|[1245](https://leetcode.com/problems/tree-diameter/)| * Tree Diameter|51%|Medium||
6868
|[1244](https://leetcode.com/problems/design-a-leaderboard/)| * Design A Leaderboard|50%|Medium||
6969
|[1243](https://leetcode.com/problems/array-transformation/)| * Array Transformation|51%|Easy||
7070
|[1240](https://leetcode.com/problems/tiling-a-rectangle-with-the-fewest-squares/)| * Tiling a Rectangle with the Fewest Squares|48%|Hard||
@@ -78,7 +78,7 @@
7878
|[1227](https://leetcode.com/problems/airplane-seat-assignment-probability/)| * Airplane Seat Assignment Probability|61%|Medium||
7979
|[1224](https://leetcode.com/problems/maximum-equal-frequency/)| * Maximum Equal Frequency|31%|Hard||
8080
|[1223](https://leetcode.com/problems/dice-roll-simulation/)| * Dice Roll Simulation|42%|Medium||
81-
|[1222](https://leetcode.com/problems/queens-that-can-attack-the-king/)| * Queens That Can Attack the King|69%|Medium||
81+
|[1222](https://leetcode.com/problems/queens-that-can-attack-the-king/)| * Queens That Can Attack the King|68%|Medium||
8282
|[1221](https://leetcode.com/problems/split-a-string-in-balanced-strings/)|[Split a String in Balanced Strings](./Algorithms/1221.split-a-string-in-balanced-strings)|78%|Easy||
8383
|[1220](https://leetcode.com/problems/count-vowels-permutation/)| * Count Vowels Permutation|51%|Hard||
8484
|[1219](https://leetcode.com/problems/path-with-maximum-gold/)| * Path with Maximum Gold|61%|Medium||
@@ -184,7 +184,7 @@
184184
|[1039](https://leetcode.com/problems/minimum-score-triangulation-of-polygon/)|[Minimum Score Triangulation of Polygon](./Algorithms/1039.minimum-score-triangulation-of-polygon)|44%|Medium|[](https://leetcode.com/list/oussv5j)|
185185
|[1038](https://leetcode.com/problems/binary-search-tree-to-greater-sum-tree/)|[Binary Search Tree to Greater Sum Tree](./Algorithms/1038.binary-search-tree-to-greater-sum-tree)|77%|Medium||
186186
|[1037](https://leetcode.com/problems/valid-boomerang/)|[Valid Boomerang](./Algorithms/1037.valid-boomerang)|37%|Easy||
187-
|[1036](https://leetcode.com/problems/escape-a-large-maze/)|[Escape a Large Maze](./Algorithms/1036.escape-a-large-maze)|34%|Hard||
187+
|[1036](https://leetcode.com/problems/escape-a-large-maze/)|[Escape a Large Maze](./Algorithms/1036.escape-a-large-maze)|35%|Hard||
188188
|[1035](https://leetcode.com/problems/uncrossed-lines/)|[Uncrossed Lines](./Algorithms/1035.uncrossed-lines)|52%|Medium|[](https://leetcode.com/list/oussv5j)|
189189
|[1034](https://leetcode.com/problems/coloring-a-border/)|[Coloring A Border](./Algorithms/1034.coloring-a-border)|43%|Medium||
190190
|[1033](https://leetcode.com/problems/moving-stones-until-consecutive/)|[Moving Stones Until Consecutive](./Algorithms/1033.moving-stones-until-consecutive)|38%|Easy||
@@ -278,7 +278,7 @@
278278
|[0945](https://leetcode.com/problems/minimum-increment-to-make-array-unique/)|[Minimum Increment to Make Array Unique](./Algorithms/0945.minimum-increment-to-make-array-unique)|44%|Medium|[](https://leetcode.com/list/oussv5j)|
279279
|[0944](https://leetcode.com/problems/delete-columns-to-make-sorted/)|[Delete Columns to Make Sorted](./Algorithms/0944.delete-columns-to-make-sorted)|69%|Easy||
280280
|[0943](https://leetcode.com/problems/find-the-shortest-superstring/)|[Find the Shortest Superstring](./Algorithms/0943.find-the-shortest-superstring)|40%|Hard|[](https://leetcode.com/list/oussv5j)|
281-
|[0942](https://leetcode.com/problems/di-string-match/)|[DI String Match](./Algorithms/0942.di-string-match)|69%|Easy||
281+
|[0942](https://leetcode.com/problems/di-string-match/)|[DI String Match](./Algorithms/0942.di-string-match)|70%|Easy||
282282
|[0941](https://leetcode.com/problems/valid-mountain-array/)|[Valid Mountain Array](./Algorithms/0941.valid-mountain-array)|35%|Easy||
283283
|[0940](https://leetcode.com/problems/distinct-subsequences-ii/)|[Distinct Subsequences II](./Algorithms/0940.distinct-subsequences-ii)|40%|Hard|[](https://leetcode.com/list/oussv5j)|
284284
|[0939](https://leetcode.com/problems/minimum-area-rectangle/)|[Minimum Area Rectangle](./Algorithms/0939.minimum-area-rectangle)|51%|Medium|[](https://leetcode.com/list/oussv5j)|
@@ -394,7 +394,7 @@
394394
|[0829](https://leetcode.com/problems/consecutive-numbers-sum/)|[Consecutive Numbers Sum](./Algorithms/0829.consecutive-numbers-sum)|35%|Hard|[](https://leetcode.com/list/oussv5j)|
395395
|[0828](https://leetcode.com/problems/unique-letter-string/)|[Unique Letter String](./Algorithms/0828.unique-letter-string)|41%|Hard|[](https://leetcode.com/list/oussv5j)|
396396
|[0827](https://leetcode.com/problems/making-a-large-island/)|[Making A Large Island](./Algorithms/0827.making-a-large-island)|44%|Hard|[](https://leetcode.com/list/oussv5j)|
397-
|[0826](https://leetcode.com/problems/most-profit-assigning-work/)|[Most Profit Assigning Work](./Algorithms/0826.most-profit-assigning-work)|36%|Medium|[](https://leetcode.com/list/oussv5j)|
397+
|[0826](https://leetcode.com/problems/most-profit-assigning-work/)|[Most Profit Assigning Work](./Algorithms/0826.most-profit-assigning-work)|37%|Medium|[](https://leetcode.com/list/oussv5j)|
398398
|[0825](https://leetcode.com/problems/friends-of-appropriate-ages/)|[Friends Of Appropriate Ages](./Algorithms/0825.friends-of-appropriate-ages)|39%|Medium||
399399
|[0824](https://leetcode.com/problems/goat-latin/)|[Goat Latin](./Algorithms/0824.goat-latin)|59%|Easy||
400400
|[0823](https://leetcode.com/problems/binary-trees-with-factors/)|[Binary Trees With Factors](./Algorithms/0823.binary-trees-with-factors)|33%|Medium||
@@ -786,7 +786,7 @@
786786
|[0289](https://leetcode.com/problems/game-of-life/)|[Game of Life](./Algorithms/0289.game-of-life)|48%|Medium|[](https://leetcode.com/list/oussv5j)|
787787
|[0287](https://leetcode.com/problems/find-the-duplicate-number/)|[Find the Duplicate Number](./Algorithms/0287.find-the-duplicate-number)|51%|Medium|[](https://leetcode.com/list/oussv5j)|
788788
|[0283](https://leetcode.com/problems/move-zeroes/)|[Move Zeroes](./Algorithms/0283.move-zeroes)|55%|Easy||
789-
|[0282](https://leetcode.com/problems/expression-add-operators/)|[Expression Add Operators](./Algorithms/0282.expression-add-operators)|33%|Hard|[](https://leetcode.com/list/oussv5j)|
789+
|[0282](https://leetcode.com/problems/expression-add-operators/)|[Expression Add Operators](./Algorithms/0282.expression-add-operators)|34%|Hard|[](https://leetcode.com/list/oussv5j)|
790790
|[0279](https://leetcode.com/problems/perfect-squares/)|[Perfect Squares](./Algorithms/0279.perfect-squares)|43%|Medium|[](https://leetcode.com/list/oussv5j)|
791791
|[0275](https://leetcode.com/problems/h-index-ii/)|[H-Index II](./Algorithms/0275.h-index-ii)|35%|Medium|[](https://leetcode.com/list/oussv5j)|
792792
|[0274](https://leetcode.com/problems/h-index/)|[H-Index](./Algorithms/0274.h-index)|34%|Medium||

leetcode.json

+21-13
Original file line numberDiff line numberDiff line change
@@ -2,6 +2,7 @@
22
"Username": "aQuaYi",
33
"Ranking": 646,
44
<<<<<<< HEAD
5+
<<<<<<< HEAD
56
<<<<<<< HEAD
67
"Updated": "2019-11-04T10:45:59.277308869+08:00",
78
"Record": {
@@ -17,6 +18,9 @@
1718
>>>>>>> 2c637bd0cefff19bf2e8a7ecb78a176daa6e7743
1819
=======
1920
"Updated": "2019-11-04T10:48:38.161189957+08:00",
21+
=======
22+
"Updated": "2019-11-04T14:00:44.592159995+08:00",
23+
>>>>>>> develop
2024
"Record": {
2125
"Easy": {
2226
"Solved": 265,
@@ -3433,7 +3437,7 @@
34333437
"ID": 282,
34343438
"Title": "Expression Add Operators",
34353439
"TitleSlug": "expression-add-operators",
3436-
"PassRate": "33%",
3440+
"PassRate": "34%",
34373441
"Difficulty": "Hard",
34383442
"IsAccepted": true,
34393443
"IsPaid": false,
@@ -9961,7 +9965,7 @@
99619965
"ID": 826,
99629966
"Title": "Most Profit Assigning Work",
99639967
"TitleSlug": "most-profit-assigning-work",
9964-
"PassRate": "36%",
9968+
"PassRate": "37%",
99659969
"Difficulty": "Medium",
99669970
"IsAccepted": true,
99679971
"IsPaid": false,
@@ -11353,7 +11357,7 @@
1135311357
"ID": 942,
1135411358
"Title": "DI String Match",
1135511359
"TitleSlug": "di-string-match",
11356-
"PassRate": "69%",
11360+
"PassRate": "70%",
1135711361
"Difficulty": "Easy",
1135811362
"IsAccepted": true,
1135911363
"IsPaid": false,
@@ -12481,7 +12485,7 @@
1248112485
"ID": 1036,
1248212486
"Title": "Escape a Large Maze",
1248312487
"TitleSlug": "escape-a-large-maze",
12484-
"PassRate": "34%",
12488+
"PassRate": "35%",
1248512489
"Difficulty": "Hard",
1248612490
"IsAccepted": true,
1248712491
"IsPaid": false,
@@ -12853,7 +12857,7 @@
1285312857
"ID": 1067,
1285412858
"Title": "Digit Count in Range",
1285512859
"TitleSlug": "digit-count-in-range",
12856-
"PassRate": "37%",
12860+
"PassRate": "38%",
1285712861
"Difficulty": "Hard",
1285812862
"IsAccepted": false,
1285912863
"IsPaid": true,
@@ -13849,7 +13853,7 @@
1384913853
"ID": 1150,
1385013854
"Title": "Check If a Number Is Majority Element in a Sorted Array",
1385113855
"TitleSlug": "check-if-a-number-is-majority-element-in-a-sorted-array",
13852-
"PassRate": "61%",
13856+
"PassRate": "60%",
1385313857
"Difficulty": "Easy",
1385413858
"IsAccepted": false,
1385513859
"IsPaid": true,
@@ -14425,7 +14429,7 @@
1442514429
"ID": 1198,
1442614430
"Title": "Find Smallest Common Element in All Rows",
1442714431
"TitleSlug": "find-smallest-common-element-in-all-rows",
14428-
"PassRate": "74%",
14432+
"PassRate": "73%",
1442914433
"Difficulty": "Medium",
1443014434
"IsAccepted": false,
1443114435
"IsPaid": true,
@@ -14713,7 +14717,7 @@
1471314717
"ID": 1222,
1471414718
"Title": "Queens That Can Attack the King",
1471514719
"TitleSlug": "queens-that-can-attack-the-king",
14716-
"PassRate": "69%",
14720+
"PassRate": "68%",
1471714721
"Difficulty": "Medium",
1471814722
"IsAccepted": false,
1471914723
"IsPaid": false,
@@ -15001,7 +15005,7 @@
1500115005
"ID": 1245,
1500215006
"Title": "Tree Diameter",
1500315007
"TitleSlug": "tree-diameter",
15004-
"PassRate": "50%",
15008+
"PassRate": "51%",
1500515009
"Difficulty": "Medium",
1500615010
"IsAccepted": false,
1500715011
"IsPaid": false,
@@ -15013,7 +15017,7 @@
1501315017
"ID": 1246,
1501415018
"Title": "Palindrome Removal",
1501515019
"TitleSlug": "palindrome-removal",
15016-
"PassRate": "40%",
15020+
"PassRate": "41%",
1501715021
"Difficulty": "Hard",
1501815022
"IsAccepted": false,
1501915023
"IsPaid": false,
@@ -15025,7 +15029,7 @@
1502515029
"ID": 1247,
1502615030
"Title": "Minimum Swaps to Make Strings Equal",
1502715031
"TitleSlug": "minimum-swaps-to-make-strings-equal",
15028-
"PassRate": "54%",
15032+
"PassRate": "55%",
1502915033
"Difficulty": "Easy",
1503015034
"IsAccepted": false,
1503115035
"IsPaid": false,
@@ -15037,7 +15041,7 @@
1503715041
"ID": 1248,
1503815042
"Title": "Count Number of Nice Subarrays",
1503915043
"TitleSlug": "count-number-of-nice-subarrays",
15040-
"PassRate": "48%",
15044+
"PassRate": "49%",
1504115045
"Difficulty": "Medium",
1504215046
"IsAccepted": false,
1504315047
"IsPaid": false,
@@ -15049,7 +15053,7 @@
1504915053
"ID": 1249,
1505015054
"Title": "Minimum Remove to Make Valid Parentheses",
1505115055
"TitleSlug": "minimum-remove-to-make-valid-parentheses",
15052-
"PassRate": "54%",
15056+
"PassRate": "55%",
1505315057
"Difficulty": "Medium",
1505415058
"IsAccepted": false,
1505515059
"IsPaid": false,
@@ -15061,12 +15065,16 @@
1506115065
"ID": 1250,
1506215066
"Title": "Check If It Is a Good Array",
1506315067
"TitleSlug": "check-if-it-is-a-good-array",
15068+
<<<<<<< HEAD
1506415069
"PassRate": "44%",
1506515070
<<<<<<< HEAD
1506615071
=======
1506715072
"PassRate": "47%",
1506815073
>>>>>>> 2c637bd0cefff19bf2e8a7ecb78a176daa6e7743
1506915074
=======
15075+
>>>>>>> develop
15076+
=======
15077+
"PassRate": "45%",
1507015078
>>>>>>> develop
1507115079
"Difficulty": "Hard",
1507215080
"IsAccepted": false,

0 commit comments

Comments
 (0)