Skip to content

Commit b4ce372

Browse files
committed
更新 README.md
1 parent c414599 commit b4ce372

File tree

3 files changed

+22
-21
lines changed

3 files changed

+22
-21
lines changed

Favorite.md

Lines changed: 3 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -41,7 +41,7 @@
4141
|144|[Binary Tree Preorder Traversal](./Algorithms/0144.binary-tree-preorder-traversal)|48%|Medium|[](https://leetcode.com/list/oussv5j)|
4242
|146|[LRU Cache](./Algorithms/0146.lru-cache)|21%|Hard|[](https://leetcode.com/list/oussv5j)|
4343
|147|[Insertion Sort List](./Algorithms/0147.insertion-sort-list)|35%|Medium|[](https://leetcode.com/list/oussv5j)|
44-
|148|[Sort List](./Algorithms/0148.sort-list)|31%|Medium|[](https://leetcode.com/list/oussv5j)|
44+
|148|[Sort List](./Algorithms/0148.sort-list)|32%|Medium|[](https://leetcode.com/list/oussv5j)|
4545
|149|[Max Points on a Line](./Algorithms/0149.max-points-on-a-line)|15%|Hard|[](https://leetcode.com/list/oussv5j)|
4646
|152|[Maximum Product Subarray](./Algorithms/0152.maximum-product-subarray)|27%|Medium|[](https://leetcode.com/list/oussv5j)|
4747
|166|[Fraction to Recurring Decimal](./Algorithms/0166.fraction-to-recurring-decimal)|18%|Medium|[](https://leetcode.com/list/oussv5j)|
@@ -154,7 +154,7 @@
154154
|517|[Super Washing Machines](./Algorithms/0517.super-washing-machines)|36%|Hard|[](https://leetcode.com/list/oussv5j)|
155155
|518|[Coin Change 2](./Algorithms/0518.coin-change-2)|38%|Medium|[](https://leetcode.com/list/oussv5j)|
156156
|523|[Continuous Subarray Sum](./Algorithms/0523.continuous-subarray-sum)|23%|Medium|[](https://leetcode.com/list/oussv5j)|
157-
|525|[Contiguous Array](./Algorithms/0525.contiguous-array)|42%|Medium|[](https://leetcode.com/list/oussv5j)|
157+
|525|[Contiguous Array](./Algorithms/0525.contiguous-array)|41%|Medium|[](https://leetcode.com/list/oussv5j)|
158158
|526|[Beautiful Arrangement](./Algorithms/0526.beautiful-arrangement)|52%|Medium|[](https://leetcode.com/list/oussv5j)|
159159
|530|[Minimum Absolute Difference in BST](./Algorithms/0530.minimum-absolute-difference-in-bst)|48%|Easy|[](https://leetcode.com/list/oussv5j)|
160160
|542|[01 Matrix](./Algorithms/0542.01-matrix)|33%|Medium|[](https://leetcode.com/list/oussv5j)|
@@ -259,3 +259,4 @@
259259
|895|[Maximum Frequency Stack](./Algorithms/0895.maximum-frequency-stack)|47%|Hard|[](https://leetcode.com/list/oussv5j)|
260260
|896|[Monotonic Array](./Algorithms/0896.monotonic-array)|54%|Easy|[](https://leetcode.com/list/oussv5j)|
261261
|897|[Increasing Order Search Tree](./Algorithms/0897.increasing-order-search-tree)|57%|Easy|[](https://leetcode.com/list/oussv5j)|
262+
|898|[Bitwise ORs of Subarrays](./Algorithms/0898.bitwise-ors-of-subarrays)|29%|Medium|[](https://leetcode.com/list/oussv5j)|

README.md

Lines changed: 10 additions & 10 deletions
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,6 @@
11
# [LeetCode](https://leetcode.com) 的 Go 解答
22

3-
[![LeetCode 排名](https://img.shields.io/badge/aQuaYi-834-blue.svg)](https://leetcode.com/aQuaYi/)
3+
[![LeetCode 排名](https://img.shields.io/badge/aQuaYi-836-blue.svg)](https://leetcode.com/aQuaYi/)
44
[![codecov](https://codecov.io/gh/aQuaYi/LeetCode-in-Go/branch/master/graph/badge.svg)](https://codecov.io/gh/aQuaYi/LeetCode-in-Go)
55
[![Build Status](https://www.travis-ci.org/aQuaYi/LeetCode-in-Go.svg?branch=master)](https://www.travis-ci.org/aQuaYi/LeetCode-in-Go)
66

@@ -10,7 +10,7 @@
1010
1111
| |Easy|Medium|Hard|Total|
1212
|:---:|:---:|:---:|:---:|:---:|
13-
|**Accepted**|202|330|144|676|
13+
|**Accepted**|202|331|144|677|
1414
|**Total**|206|344|151|701|
1515

1616
## 题解
@@ -20,18 +20,18 @@
2020
|924| * [Minimize Malware Spread](https://leetcode.com/problems/minimize-malware-spread/) :new: |33%|Hard||
2121
|923| * [3Sum With Multiplicity](https://leetcode.com/problems/3sum-with-multiplicity/) :new: |25%|Medium||
2222
|922| * [Sort Array By Parity II](https://leetcode.com/problems/sort-array-by-parity-ii/) :new: |68%|Easy||
23-
|921| * [Minimum Add to Make Parentheses Valid](https://leetcode.com/problems/minimum-add-to-make-parentheses-valid/) :new: |75%|Medium||
23+
|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||
2525
|919| * [Complete Binary Tree Inserter](https://leetcode.com/problems/complete-binary-tree-inserter/)|54%|Medium||
2626
|918| * [Maximum Sum Circular Subarray](https://leetcode.com/problems/maximum-sum-circular-subarray/)|25%|Medium||
27-
|917| * [Reverse Only Letters](https://leetcode.com/problems/reverse-only-letters/)|58%|Easy||
27+
|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||
3030
|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||
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/)|25%|Medium||
34+
|909| * [Snakes and Ladders](https://leetcode.com/problems/snakes-and-ladders/)|24%|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||
@@ -42,7 +42,7 @@
4242
|901| * [Online Stock Span](https://leetcode.com/problems/online-stock-span/)|42%|Medium||
4343
|900| * [RLE Iterator](https://leetcode.com/problems/rle-iterator/)|42%|Medium||
4444
|899| * [Orderly Queue](https://leetcode.com/problems/orderly-queue/)|42%|Hard||
45-
|898| * [Bitwise ORs of Subarrays](https://leetcode.com/problems/bitwise-ors-of-subarrays/)|29%|Medium||
45+
|898|[Bitwise ORs of Subarrays](./Algorithms/0898.bitwise-ors-of-subarrays)|29%|Medium|[](https://leetcode.com/list/oussv5j)|
4646
|897|[Increasing Order Search Tree](./Algorithms/0897.increasing-order-search-tree)|57%|Easy|[](https://leetcode.com/list/oussv5j)|
4747
|896|[Monotonic Array](./Algorithms/0896.monotonic-array)|54%|Easy|[](https://leetcode.com/list/oussv5j)|
4848
|895|[Maximum Frequency Stack](./Algorithms/0895.maximum-frequency-stack)|47%|Hard|[](https://leetcode.com/list/oussv5j)|
@@ -145,7 +145,7 @@
145145
|797|[All Paths From Source to Target](./Algorithms/0797.all-paths-from-source-to-target)|67%|Medium||
146146
|796|[Rotate String](./Algorithms/0796.rotate-string)|48%|Easy||
147147
|795|[Number of Subarrays with Bounded Maximum](./Algorithms/0795.number-of-subarrays-with-bounded-maximum)|41%|Medium|[](https://leetcode.com/list/oussv5j)|
148-
|794|[Valid Tic-Tac-Toe State](./Algorithms/0794.valid-tic-tac-toe-state)|27%|Medium||
148+
|794|[Valid Tic-Tac-Toe State](./Algorithms/0794.valid-tic-tac-toe-state)|28%|Medium||
149149
|793|[Preimage Size of Factorial Zeroes Function](./Algorithms/0793.preimage-size-of-factorial-zeroes-function)|39%|Hard|[](https://leetcode.com/list/oussv5j)|
150150
|792|[Number of Matching Subsequences](./Algorithms/0792.number-of-matching-subsequences)|38%|Medium|[](https://leetcode.com/list/oussv5j)|
151151
|791|[Custom Sort String](./Algorithms/0791.custom-sort-string)|59%|Medium||
@@ -176,7 +176,7 @@
176176
|763|[Partition Labels](./Algorithms/0763.partition-labels)|65%|Medium||
177177
|762|[Prime Number of Set Bits in Binary Representation](./Algorithms/0762.prime-number-of-set-bits-in-binary-representation)|56%|Easy||
178178
|761|[Special Binary String](./Algorithms/0761.special-binary-string)|45%|Hard||
179-
|757|[Set Intersection Size At Least Two](./Algorithms/0757.set-intersection-size-at-least-two)|34%|Hard||
179+
|757|[Set Intersection Size At Least Two](./Algorithms/0757.set-intersection-size-at-least-two)|35%|Hard||
180180
|756|[Pyramid Transition Matrix](./Algorithms/0756.pyramid-transition-matrix)|47%|Medium|[](https://leetcode.com/list/oussv5j)|
181181
|754|[Reach a Number](./Algorithms/0754.reach-a-number)|29%|Easy|[](https://leetcode.com/list/oussv5j)|
182182
|753|[Cracking the Safe](./Algorithms/0753.cracking-the-safe)|42%|Hard|[](https://leetcode.com/list/oussv5j)|
@@ -328,7 +328,7 @@
328328
|529|[Minesweeper](./Algorithms/0529.minesweeper)|50%|Medium||
329329
|528|[Random Pick with Weight](./Algorithms/0528.random-pick-with-weight)|41%|Medium||
330330
|526|[Beautiful Arrangement](./Algorithms/0526.beautiful-arrangement)|52%|Medium|[](https://leetcode.com/list/oussv5j)|
331-
|525|[Contiguous Array](./Algorithms/0525.contiguous-array)|42%|Medium|[](https://leetcode.com/list/oussv5j)|
331+
|525|[Contiguous Array](./Algorithms/0525.contiguous-array)|41%|Medium|[](https://leetcode.com/list/oussv5j)|
332332
|524|[Longest Word in Dictionary through Deleting](./Algorithms/0524.longest-word-in-dictionary-through-deleting)|43%|Medium||
333333
|523|[Continuous Subarray Sum](./Algorithms/0523.continuous-subarray-sum)|23%|Medium|[](https://leetcode.com/list/oussv5j)|
334334
|522|[Longest Uncommon Subsequence II](./Algorithms/0522.longest-uncommon-subsequence-ii)|32%|Medium||
@@ -576,7 +576,7 @@
576576
|152|[Maximum Product Subarray](./Algorithms/0152.maximum-product-subarray)|27%|Medium|[](https://leetcode.com/list/oussv5j)|
577577
|150|[Evaluate Reverse Polish Notation](./Algorithms/0150.evaluate-reverse-polish-notation)|29%|Medium||
578578
|149|[Max Points on a Line](./Algorithms/0149.max-points-on-a-line)|15%|Hard|[](https://leetcode.com/list/oussv5j)|
579-
|148|[Sort List](./Algorithms/0148.sort-list)|31%|Medium|[](https://leetcode.com/list/oussv5j)|
579+
|148|[Sort List](./Algorithms/0148.sort-list)|32%|Medium|[](https://leetcode.com/list/oussv5j)|
580580
|147|[Insertion Sort List](./Algorithms/0147.insertion-sort-list)|35%|Medium|[](https://leetcode.com/list/oussv5j)|
581581
|146|[LRU Cache](./Algorithms/0146.lru-cache)|21%|Hard|[](https://leetcode.com/list/oussv5j)|
582582
|145|[Binary Tree Postorder Traversal](./Algorithms/0145.binary-tree-postorder-traversal)|44%|Hard||

leetcode.json

Lines changed: 9 additions & 9 deletions
Original file line numberDiff line numberDiff line change
@@ -1,22 +1,22 @@
11
{
22
"Username": "aQuaYi",
3-
"Ranking": 834,
4-
"Updated": "2018-10-15T16:53:40.500438971+08:00",
3+
"Ranking": 836,
4+
"Updated": "2018-10-15T19:42:10.554323279+08:00",
55
"Record": {
66
"Easy": {
77
"Solved": 202,
88
"Total": 206
99
},
1010
"Medium": {
11-
"Solved": 330,
11+
"Solved": 331,
1212
"Total": 344
1313
},
1414
"Hard": {
1515
"Solved": 144,
1616
"Total": 151
1717
},
1818
"Total": {
19-
"Solved": 676,
19+
"Solved": 677,
2020
"Total": 701
2121
}
2222
},
@@ -1801,7 +1801,7 @@
18011801
"ID": 148,
18021802
"Title": "Sort List",
18031803
"TitleSlug": "sort-list",
1804-
"PassRate": "31%",
1804+
"PassRate": "32%",
18051805
"Difficulty": "Medium",
18061806
"IsAccepted": true,
18071807
"IsPaid": false,
@@ -10803,9 +10803,9 @@
1080310803
"TitleSlug": "bitwise-ors-of-subarrays",
1080410804
"PassRate": "29%",
1080510805
"Difficulty": "Medium",
10806-
"IsAccepted": false,
10806+
"IsAccepted": true,
1080710807
"IsPaid": false,
10808-
"IsFavor": false,
10808+
"IsFavor": true,
1080910809
"IsNew": false,
1081010810
"HasNoGoOption": false
1081110811
},
@@ -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": "32%",
10996+
"PassRate": "33%",
1099710997
"Difficulty": "Easy",
1099810998
"IsAccepted": false,
1099910999
"IsPaid": false,
@@ -11029,7 +11029,7 @@
1102911029
"ID": 917,
1103011030
"Title": "Reverse Only Letters",
1103111031
"TitleSlug": "reverse-only-letters",
11032-
"PassRate": "58%",
11032+
"PassRate": "57%",
1103311033
"Difficulty": "Easy",
1103411034
"IsAccepted": false,
1103511035
"IsPaid": false,

0 commit comments

Comments
 (0)