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

Commit 658ee14

Browse files
committed
更新 README.md
1 parent 5a25fe8 commit 658ee14

File tree

2 files changed

+1
-103
lines changed

2 files changed

+1
-103
lines changed

README.md

-52
Original file line numberDiff line numberDiff line change
@@ -9,47 +9,6 @@
99

1010
> 统计规则:1.免费题,2.算法题,3.能提交 Go 解答
1111
12-
<<<<<<< HEAD
13-
| | Easy | Medium | Hard | Total |
14-
| :----------: | :---: | :----: | :---: | :---: |
15-
| **Accepted** | 265 | 456 | 187 | 908 |
16-
| **Total** | 269 | 473 | 198 | 940 |
17-
18-
## 题解
19-
20-
| 题号 | 题目 | 通过率 | 难度 | 收藏 |
21-
| :---------------------------------------------------------------------------------------------------: | :--------------------------------------------------------------- | :----: | :----: | :---: |
22-
| [1250](https://leetcode.com/problems/check-if-it-is-a-good-array/) | * Check If It Is a Good Array | 44% | Hard | |
23-
| [1249](https://leetcode.com/problems/minimum-remove-to-make-valid-parentheses/) | * Minimum Remove to Make Valid Parentheses | 54% | Medium | |
24-
| [1248](https://leetcode.com/problems/count-number-of-nice-subarrays/) | * Count Number of Nice Subarrays | 48% | Medium | |
25-
| [1247](https://leetcode.com/problems/minimum-swaps-to-make-strings-equal/) | * Minimum Swaps to Make Strings Equal | 54% | Easy | |
26-
| [1246](https://leetcode.com/problems/palindrome-removal/) | * Palindrome Removal | 40% | Hard | |
27-
| [1245](https://leetcode.com/problems/tree-diameter/) | * Tree Diameter | 50% | Medium | |
28-
| [1244](https://leetcode.com/problems/design-a-leaderboard/) | * Design A Leaderboard | 50% | Medium | |
29-
| [1243](https://leetcode.com/problems/array-transformation/) | * Array Transformation | 51% | Easy | |
30-
| [1240](https://leetcode.com/problems/tiling-a-rectangle-with-the-fewest-squares/) | * Tiling a Rectangle with the Fewest Squares | 48% | Hard | |
31-
| [1239](https://leetcode.com/problems/maximum-length-of-a-concatenated-string-with-unique-characters/) | * Maximum Length of a Concatenated String with Unique Characters | 40% | Medium | |
32-
| [1238](https://leetcode.com/problems/circular-permutation-in-binary-representation/) | * Circular Permutation in Binary Representation | 57% | Medium | |
33-
| [1237](https://leetcode.com/problems/find-positive-integer-solution-for-a-given-equation/) | * Find Positive Integer Solution for a Given Equation | 65% | Easy | |
34-
| [1235](https://leetcode.com/problems/maximum-profit-in-job-scheduling/) | * Maximum Profit in Job Scheduling | 44% | Hard | |
35-
| [1234](https://leetcode.com/problems/replace-the-substring-for-balanced-string/) | * Replace the Substring for Balanced String | 29% | Medium | |
36-
| [1233](https://leetcode.com/problems/remove-sub-folders-from-the-filesystem/) | * Remove Sub-Folders from the Filesystem | 53% | Medium | |
37-
| [1232](https://leetcode.com/problems/check-if-it-is-a-straight-line/) | * Check If It Is a Straight Line | 47% | Easy | |
38-
| [1227](https://leetcode.com/problems/airplane-seat-assignment-probability/) | * Airplane Seat Assignment Probability | 60% | Medium | |
39-
| [1224](https://leetcode.com/problems/maximum-equal-frequency/) | * Maximum Equal Frequency | 31% | Hard | |
40-
| [1223](https://leetcode.com/problems/dice-roll-simulation/) | * Dice Roll Simulation | 42% | Medium | |
41-
<<<<<<< HEAD
42-
|[1222](https://leetcode.com/problems/queens-that-can-attack-the-king/)| * Queens That Can Attack the King|69%|Medium||
43-
|[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||
44-
|[1220](https://leetcode.com/problems/count-vowels-permutation/)| * Count Vowels Permutation|51%|Hard||
45-
|[1219](https://leetcode.com/problems/path-with-maximum-gold/)| * Path with Maximum Gold|61%|Medium||
46-
=======
47-
|[1222](https://leetcode.com/problems/queens-that-can-attack-the-king/)| * Queens That Can Attack the King|68%|Medium||
48-
|[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||
49-
|[1220](https://leetcode.com/problems/count-vowels-permutation/)| * Count Vowels Permutation|52%|Hard||
50-
|[1219](https://leetcode.com/problems/path-with-maximum-gold/)| * Path with Maximum Gold|60%|Medium||
51-
>>>>>>> 2c637bd0cefff19bf2e8a7ecb78a176daa6e7743
52-
=======
5312
| |Easy|Medium|Hard|Total|
5413
|:---:|:---:|:---:|:---:|:---:|
5514
|**Accepted**|265|456|187|908|
@@ -82,7 +41,6 @@
8241
|[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||
8342
|[1220](https://leetcode.com/problems/count-vowels-permutation/)| * Count Vowels Permutation|51%|Hard||
8443
|[1219](https://leetcode.com/problems/path-with-maximum-gold/)| * Path with Maximum Gold|61%|Medium||
85-
>>>>>>> develop
8644
|[1218](https://leetcode.com/problems/longest-arithmetic-subsequence-of-given-difference/)| * Longest Arithmetic Subsequence of Given Difference|38%|Medium||
8745
|[1217](https://leetcode.com/problems/play-with-chips/)|[Play with Chips](./Algorithms/1217.play-with-chips)|63%|Easy||
8846
|[1210](https://leetcode.com/problems/minimum-moves-to-reach-target-with-rotations/)| * Minimum Moves to Reach Target with Rotations|43%|Hard||
@@ -127,18 +85,8 @@
12785
|[1138](https://leetcode.com/problems/alphabet-board-path/)|[Alphabet Board Path](./Algorithms/1138.alphabet-board-path)|44%|Medium|[](https://leetcode.com/list/oussv5j)|
12886
|[1137](https://leetcode.com/problems/n-th-tribonacci-number/)|[N-th Tribonacci Number](./Algorithms/1137.n-th-tribonacci-number)|58%|Easy|[](https://leetcode.com/list/oussv5j)|
12987
|[1131](https://leetcode.com/problems/maximum-of-absolute-value-expression/)|[Maximum of Absolute Value Expression](./Algorithms/1131.maximum-of-absolute-value-expression)|52%|Medium|[](https://leetcode.com/list/oussv5j)|
130-
<<<<<<< HEAD
131-
<<<<<<< HEAD
132-
|[1130](https://leetcode.com/problems/minimum-cost-tree-from-leaf-values/)|[Minimum Cost Tree From Leaf Values](./Algorithms/1130.minimum-cost-tree-from-leaf-values)|62%|Medium|[](https://leetcode.com/list/oussv5j)|
133-
|[1129](https://leetcode.com/problems/shortest-path-with-alternating-colors/)|[Shortest Path with Alternating Colors](./Algorithms/1129.shortest-path-with-alternating-colors)|37%|Medium|[](https://leetcode.com/list/oussv5j)|
134-
=======
135-
|[1130](https://leetcode.com/problems/minimum-cost-tree-from-leaf-values/)|[Minimum Cost Tree From Leaf Values](./Algorithms/1130.minimum-cost-tree-from-leaf-values)|61%|Medium|[](https://leetcode.com/list/oussv5j)|
136-
|[1129](https://leetcode.com/problems/shortest-path-with-alternating-colors/)|[Shortest Path with Alternating Colors](./Algorithms/1129.shortest-path-with-alternating-colors)|36%|Medium|[](https://leetcode.com/list/oussv5j)|
137-
>>>>>>> 2c637bd0cefff19bf2e8a7ecb78a176daa6e7743
138-
=======
13988
|[1130](https://leetcode.com/problems/minimum-cost-tree-from-leaf-values/)|[Minimum Cost Tree From Leaf Values](./Algorithms/1130.minimum-cost-tree-from-leaf-values)|62%|Medium|[](https://leetcode.com/list/oussv5j)|
14089
|[1129](https://leetcode.com/problems/shortest-path-with-alternating-colors/)|[Shortest Path with Alternating Colors](./Algorithms/1129.shortest-path-with-alternating-colors)|37%|Medium|[](https://leetcode.com/list/oussv5j)|
141-
>>>>>>> develop
14290
|[1128](https://leetcode.com/problems/number-of-equivalent-domino-pairs/)|[Number of Equivalent Domino Pairs](./Algorithms/1128.number-of-equivalent-domino-pairs)|46%|Easy||
14391
|[1125](https://leetcode.com/problems/smallest-sufficient-team/)|[Smallest Sufficient Team](./Algorithms/1125.smallest-sufficient-team)|44%|Hard|[](https://leetcode.com/list/oussv5j)|
14492
|[1124](https://leetcode.com/problems/longest-well-performing-interval/)|[Longest Well-Performing Interval](./Algorithms/1124.longest-well-performing-interval)|31%|Medium||

leetcode.json

+1-51
Original file line numberDiff line numberDiff line change
@@ -1,31 +1,11 @@
11
{
22
"Username": "aQuaYi",
33
"Ranking": 646,
4-
<<<<<<< HEAD
5-
<<<<<<< HEAD
6-
<<<<<<< HEAD
7-
"Updated": "2019-11-04T10:45:59.277308869+08:00",
4+
"Updated": "2019-11-04T14:04:33.052643567+08:00",
85
"Record": {
96
"Easy": {
107
"Solved": 265,
118
"Total": 269
12-
=======
13-
"Updated": "2019-10-31T20:28:18.942556908+08:00",
14-
"Record": {
15-
"Easy": {
16-
"Solved": 265,
17-
"Total": 267
18-
>>>>>>> 2c637bd0cefff19bf2e8a7ecb78a176daa6e7743
19-
=======
20-
"Updated": "2019-11-04T10:48:38.161189957+08:00",
21-
=======
22-
"Updated": "2019-11-04T14:00:44.592159995+08:00",
23-
>>>>>>> develop
24-
"Record": {
25-
"Easy": {
26-
"Solved": 265,
27-
"Total": 269
28-
>>>>>>> develop
299
},
3010
"Medium": {
3111
"Solved": 456,
@@ -37,15 +17,7 @@
3717
},
3818
"Total": {
3919
"Solved": 908,
40-
<<<<<<< HEAD
41-
<<<<<<< HEAD
42-
"Total": 940
43-
=======
44-
"Total": 932
45-
>>>>>>> 2c637bd0cefff19bf2e8a7ecb78a176daa6e7743
46-
=======
4720
"Total": 940
48-
>>>>>>> develop
4921
}
5022
},
5123
"Problems": [
@@ -14909,15 +14881,7 @@
1490914881
"ID": 1238,
1491014882
"Title": "Circular Permutation in Binary Representation",
1491114883
"TitleSlug": "circular-permutation-in-binary-representation",
14912-
<<<<<<< HEAD
14913-
<<<<<<< HEAD
14914-
"PassRate": "57%",
14915-
=======
14916-
"PassRate": "56%",
14917-
>>>>>>> 2c637bd0cefff19bf2e8a7ecb78a176daa6e7743
14918-
=======
1491914884
"PassRate": "57%",
14920-
>>>>>>> develop
1492114885
"Difficulty": "Medium",
1492214886
"IsAccepted": false,
1492314887
"IsPaid": false,
@@ -14941,10 +14905,6 @@
1494114905
"ID": 1240,
1494214906
"Title": "Tiling a Rectangle with the Fewest Squares",
1494314907
"TitleSlug": "tiling-a-rectangle-with-the-fewest-squares",
14944-
<<<<<<< HEAD
14945-
<<<<<<< HEAD
14946-
=======
14947-
>>>>>>> develop
1494814908
"PassRate": "48%",
1494914909
"Difficulty": "Hard",
1495014910
"IsAccepted": false,
@@ -15065,17 +15025,7 @@
1506515025
"ID": 1250,
1506615026
"Title": "Check If It Is a Good Array",
1506715027
"TitleSlug": "check-if-it-is-a-good-array",
15068-
<<<<<<< HEAD
15069-
"PassRate": "44%",
15070-
<<<<<<< HEAD
15071-
=======
15072-
"PassRate": "47%",
15073-
>>>>>>> 2c637bd0cefff19bf2e8a7ecb78a176daa6e7743
15074-
=======
15075-
>>>>>>> develop
15076-
=======
1507715028
"PassRate": "45%",
15078-
>>>>>>> develop
1507915029
"Difficulty": "Hard",
1508015030
"IsAccepted": false,
1508115031
"IsPaid": false,

0 commit comments

Comments
 (0)