Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly
Sign up
Appearance settings

Commit f0792d1

Browse files
halfrostdezhiy
authored andcommitted
Update solution 0520
1 parent 8f64507 commit f0792d1

File tree

12 files changed

+105
-26
lines changed

12 files changed

+105
-26
lines changed

‎README.md

Lines changed: 12 additions & 12 deletions
Original file line numberDiff line numberDiff line change
@@ -127,15 +127,15 @@
127127
| | Easy | Medium | Hard | Total |
128128
|:--------:|:--------:|:--------:|:--------:|:--------:|
129129
|Optimizing|33|45|30|108|
130-
|Accepted|**280**|**426**|**126**|**832**|
130+
|Accepted|**281**|**426**|**126**|**833**|
131131
|Total|527|1107|442|2076|
132-
|Perfection Rate|88.2%|89.4%|76.2%|87.0%|
133-
|Completion Rate|53.1%|38.5%|28.5%|40.1%|
132+
|Perfection Rate|88.3%|89.4%|76.2%|87.0%|
133+
|Completion Rate|53.3%|38.5%|28.5%|40.1%|
134134
|------------|----------------------------|----------------------------|----------------------------|----------------------------|
135135

136136
## 二. 目录
137137

138-
以下已经收录了 727 道题的题解,还有 11 道题在尝试优化到 beats 100%
138+
以下已经收录了 728 道题的题解,还有 11 道题在尝试优化到 beats 100%
139139

140140
| No. | Title | Solution | Acceptance | Difficulty | Frequency |
141141
|:--------:|:--------------------------------------------------------------|:--------:|:--------:|:--------:|:--------:|
@@ -479,7 +479,7 @@
479479
|0338|Counting Bits|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0338.Counting-Bits)|72.0%|Easy||
480480
|0339|Nested List Weight Sum||78.7%|Medium||
481481
|0340|Longest Substring with At Most K Distinct Characters||46.7%|Medium||
482-
|0341|Flatten Nested List Iterator|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0341.Flatten-Nested-List-Iterator)|57.5%|Medium||
482+
|0341|Flatten Nested List Iterator|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0341.Flatten-Nested-List-Iterator)|57.6%|Medium||
483483
|0342|Power of Four|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0342.Power-of-Four)|42.9%|Easy||
484484
|0343|Integer Break|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0343.Integer-Break)|52.7%|Medium||
485485
|0344|Reverse String|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0344.Reverse-String)|72.6%|Easy||
@@ -658,7 +658,7 @@
658658
|0517|Super Washing Machines||39.0%|Hard||
659659
|0518|Coin Change 2|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0518.Coin-Change-2)|55.2%|Medium||
660660
|0519|Random Flip Matrix||38.6%|Medium||
661-
|0520|Detect Capital||54.2%|Easy||
661+
|0520|Detect Capital|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0520.Detect-Capital)|54.2%|Easy||
662662
|0521|Longest Uncommon Subsequence I||59.8%|Easy||
663663
|0522|Longest Uncommon Subsequence II||39.9%|Medium||
664664
|0523|Continuous Subarray Sum|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0523.Continuous-Subarray-Sum)|26.2%|Medium||
@@ -992,7 +992,7 @@
992992
|0851|Loud and Rich|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0851.Loud-and-Rich)|55.0%|Medium||
993993
|0852|Peak Index in a Mountain Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0852.Peak-Index-in-a-Mountain-Array)|71.4%|Easy||
994994
|0853|Car Fleet|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0853.Car-Fleet)|47.0%|Medium||
995-
|0854|K-Similar Strings||38.8%|Hard||
995+
|0854|K-Similar Strings||38.9%|Hard||
996996
|0855|Exam Room||43.5%|Medium||
997997
|0856|Score of Parentheses|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0856.Score-of-Parentheses)|65.5%|Medium||
998998
|0857|Minimum Cost to Hire K Workers||51.3%|Hard||
@@ -1107,7 +1107,7 @@
11071107
|0966|Vowel Spellchecker|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0966.Vowel-Spellchecker)|51.7%|Medium||
11081108
|0967|Numbers With Same Consecutive Differences||46.5%|Medium||
11091109
|0968|Binary Tree Cameras|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0968.Binary-Tree-Cameras)|41.2%|Hard||
1110-
|0969|Pancake Sorting|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0969.Pancake-Sorting)|69.3%|Medium||
1110+
|0969|Pancake Sorting|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0969.Pancake-Sorting)|69.4%|Medium||
11111111
|0970|Powerful Integers|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0970.Powerful-Integers)|43.4%|Medium||
11121112
|0971|Flip Binary Tree To Match Preorder Traversal|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0971.Flip-Binary-Tree-To-Match-Preorder-Traversal)|49.8%|Medium||
11131113
|0972|Equal Rational Numbers||42.3%|Hard||
@@ -1283,7 +1283,7 @@
12831283
|1142|User Activity for the Past 30 Days II||35.8%|Easy||
12841284
|1143|Longest Common Subsequence|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1143.Longest-Common-Subsequence)|58.8%|Medium||
12851285
|1144|Decrease Elements To Make Array Zigzag||46.7%|Medium||
1286-
|1145|Binary Tree Coloring Game|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1145.Binary-Tree-Coloring-Game)|51.1%|Medium||
1286+
|1145|Binary Tree Coloring Game|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1145.Binary-Tree-Coloring-Game)|51.0%|Medium||
12871287
|1146|Snapshot Array||37.1%|Medium||
12881288
|1147|Longest Chunked Palindrome Decomposition||60.2%|Hard||
12891289
|1148|Article Views I||77.1%|Easy||
@@ -2127,7 +2127,7 @@
21272127
|1986|Minimum Number of Work Sessions to Finish the Tasks||30.8%|Medium||
21282128
|1987|Number of Unique Good Subsequences||50.7%|Hard||
21292129
|1988|Find Cutoff Score for Each School||71.5%|Medium||
2130-
|1989|Maximum Number of People That Can Be Caught in Tag||57.6%|Medium||
2130+
|1989|Maximum Number of People That Can Be Caught in Tag||57.7%|Medium||
21312131
|1990|Count the Number of Experiments||52.4%|Medium||
21322132
|1991|Find the Middle Index in Array||64.7%|Easy||
21332133
|1992|Find All Groups of Farmland||65.4%|Medium||
@@ -2211,10 +2211,10 @@
22112211
|2070|Most Beautiful Item for Each Query||42.7%|Medium||
22122212
|2071|Maximum Number of Tasks You Can Assign||29.4%|Hard||
22132213
|2072|The Winner University||92.2%|Easy||
2214-
|2073|Time Needed to Buy Tickets||56.2%|Easy||
2214+
|2073|Time Needed to Buy Tickets||56.3%|Easy||
22152215
|2074|Reverse Nodes in Even Length Groups||38.9%|Medium||
22162216
|2075|Decode the Slanted Ciphertext||46.9%|Medium||
2217-
|2076|Process Restricted Friend Requests||39.0%|Hard||
2217+
|2076|Process Restricted Friend Requests||39.1%|Hard||
22182218
|------------|-------------------------------------------------------|-------| ----------------| ---------------|-------------|
22192219

22202220
------------------------------------------------------------------

‎leetcode/0520.Detect-Capital/README.md

Lines changed: 6 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -1,4 +1,4 @@
1-
# [520. Detect Capital](https://leetcode-cn.com/problems/detect-capital/)
1+
# [520. Detect Capital](https://leetcode.com/problems/detect-capital/)
22

33

44
## 题目
@@ -44,11 +44,13 @@ Output: false
4444

4545
## 解题思路
4646

47-
- 把word分别转换为全部小写wLower,全部大写wUpper,首字母大写的字符串wCaptial
48-
- 判断word是否等于wLower,wUpper,wCaptial中的一个,如果是返回true,否则返回false
47+
- 把 word 分别转换为全部小写 wLower,全部大写 wUpper,首字母大写的字符串 wCaptial
48+
- 判断 word 是否等于 wLower, wUpper, wCaptial 中的一个,如果是返回 true,否则返回 false
4949

5050
## 代码
51+
5152
```go
53+
5254
package leetcode
5355

5456
import "strings"
@@ -62,4 +64,5 @@ func detectCapitalUse(word string) bool {
6264
}
6365
return false
6466
}
67+
6568
```

‎website/content/ChapterFour/0500~0599/0518.Coin-Change-2.md

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -76,5 +76,5 @@ func change(amount int, coins []int) int {
7676
----------------------------------------------
7777
<div style="display: flex;justify-content: space-between;align-items: center;">
7878
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0500~0599/0515.Find-Largest-Value-in-Each-Tree-Row/">⬅️上一页</a></p>
79-
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0500~0599/0523.Continuous-Subarray-Sum/">下一页➡️</a></p>
79+
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0500~0599/0520.Detect-Capital/">下一页➡️</a></p>
8080
</div>
Lines changed: 75 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,75 @@
1+
# [520. Detect Capital](https://leetcode.com/problems/detect-capital/)
2+
3+
4+
## 题目
5+
6+
We define the usage of capitals in a word to be right when one of the following cases holds:
7+
8+
All letters in this word are capitals, like "USA".
9+
10+
All letters in this word are not capitals, like "leetcode".
11+
12+
Only the first letter in this word is capital, like "Google".
13+
14+
Given a string word, return true if the usage of capitals in it is right.
15+
16+
**Example 1:**
17+
18+
```
19+
Input: word = "USA"
20+
Output: true
21+
```
22+
23+
**Example 2:**
24+
25+
```
26+
Input: word = "FlaG"
27+
Output: false
28+
```
29+
30+
**Constraints:**
31+
32+
- 1 <= word.length <= 100
33+
- word consists of lowercase and uppercase English letters.
34+
35+
## 题目大意
36+
37+
我们定义,在以下情况时,单词的大写用法是正确的:
38+
39+
全部字母都是大写,比如 "USA" 。
40+
单词中所有字母都不是大写,比如 "leetcode" 。
41+
如果单词不只含有一个字母,只有首字母大写,比如"Google" 。
42+
43+
给你一个字符串 word 。如果大写用法正确,返回 true ;否则,返回 false 。
44+
45+
## 解题思路
46+
47+
- 把 word 分别转换为全部小写 wLower,全部大写 wUpper,首字母大写的字符串 wCaptial
48+
- 判断 word 是否等于 wLower, wUpper, wCaptial 中的一个,如果是返回 true,否则返回 false
49+
50+
## 代码
51+
52+
```go
53+
54+
package leetcode
55+
56+
import "strings"
57+
58+
func detectCapitalUse(word string) bool {
59+
wLower := strings.ToLower(word)
60+
wUpper := strings.ToUpper(word)
61+
wCaptial := strings.ToUpper(string(word[0])) + strings.ToLower(string(word[1:]))
62+
if wCaptial == word || wLower == word || wUpper == word {
63+
return true
64+
}
65+
return false
66+
}
67+
68+
```
69+
70+
71+
----------------------------------------------
72+
<div style="display: flex;justify-content: space-between;align-items: center;">
73+
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0500~0599/0518.Coin-Change-2/">⬅️上一页</a></p>
74+
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0500~0599/0523.Continuous-Subarray-Sum/">下一页➡️</a></p>
75+
</div>

‎website/content/ChapterFour/0500~0599/0523.Continuous-Subarray-Sum.md

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -77,6 +77,6 @@ func checkSubarraySum(nums []int, k int) bool {
7777

7878
----------------------------------------------
7979
<div style="display: flex;justify-content: space-between;align-items: center;">
80-
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0500~0599/0518.Coin-Change-2/">⬅️上一页</a></p>
80+
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0500~0599/0520.Detect-Capital/">⬅️上一页</a></p>
8181
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0500~0599/0524.Longest-Word-in-Dictionary-through-Deleting/">下一页➡️</a></p>
8282
</div>

‎website/content/ChapterTwo/Backtracking.md

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -134,10 +134,10 @@ func updateMatrix_BFS(matrix [][]int) [][]int {
134134
|0816|Ambiguous Coordinates|[Go]({{< relref "/ChapterFour/0800~0899/0816.Ambiguous-Coordinates.md" >}})|Medium||||55.7%|
135135
|0842|Split Array into Fibonacci Sequence|[Go]({{< relref "/ChapterFour/0800~0899/0842.Split-Array-into-Fibonacci-Sequence.md" >}})|Medium| O(n^2)| O(1)|❤️|37.4%|
136136
|0980|Unique Paths III|[Go]({{< relref "/ChapterFour/0900~0999/0980.Unique-Paths-III.md" >}})|Hard| O(n log n)| O(n)||79.2%|
137-
|0996|Number of Squareful Arrays|[Go]({{< relref "/ChapterFour/0900~0999/0996.Number-of-Squareful-Arrays.md" >}})|Hard| O(n log n)| O(n) ||49.1%|
137+
|0996|Number of Squareful Arrays|[Go]({{< relref "/ChapterFour/0900~0999/0996.Number-of-Squareful-Arrays.md" >}})|Hard| O(n log n)| O(n) ||49.0%|
138138
|1079|Letter Tile Possibilities|[Go]({{< relref "/ChapterFour/1000~1099/1079.Letter-Tile-Possibilities.md" >}})|Medium| O(n^2)| O(1)|❤️|76.1%|
139139
|1239|Maximum Length of a Concatenated String with Unique Characters|[Go]({{< relref "/ChapterFour/1200~1299/1239.Maximum-Length-of-a-Concatenated-String-with-Unique-Characters.md" >}})|Medium||||50.6%|
140-
|1655|Distribute Repeating Integers|[Go]({{< relref "/ChapterFour/1600~1699/1655.Distribute-Repeating-Integers.md" >}})|Hard||||40.6%|
140+
|1655|Distribute Repeating Integers|[Go]({{< relref "/ChapterFour/1600~1699/1655.Distribute-Repeating-Integers.md" >}})|Hard||||40.7%|
141141
|------------|-------------------------------------------------------|-------| ----------------| ---------------|-------------|-------------|-------------|
142142

143143

‎website/content/ChapterTwo/Bit_Manipulation.md

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -86,14 +86,14 @@ X & ~X = 0
8686
|0898|Bitwise ORs of Subarrays|[Go]({{< relref "/ChapterFour/0800~0899/0898.Bitwise-ORs-of-Subarrays.md" >}})|Medium| O(n)| O(1)||36.2%|
8787
|0980|Unique Paths III|[Go]({{< relref "/ChapterFour/0900~0999/0980.Unique-Paths-III.md" >}})|Hard||||79.2%|
8888
|0995|Minimum Number of K Consecutive Bit Flips|[Go]({{< relref "/ChapterFour/0900~0999/0995.Minimum-Number-of-K-Consecutive-Bit-Flips.md" >}})|Hard||||50.3%|
89-
|0996|Number of Squareful Arrays|[Go]({{< relref "/ChapterFour/0900~0999/0996.Number-of-Squareful-Arrays.md" >}})|Hard||||49.1%|
89+
|0996|Number of Squareful Arrays|[Go]({{< relref "/ChapterFour/0900~0999/0996.Number-of-Squareful-Arrays.md" >}})|Hard||||49.0%|
9090
|1178|Number of Valid Words for Each Puzzle|[Go]({{< relref "/ChapterFour/1100~1199/1178.Number-of-Valid-Words-for-Each-Puzzle.md" >}})|Hard||||46.8%|
9191
|1239|Maximum Length of a Concatenated String with Unique Characters|[Go]({{< relref "/ChapterFour/1200~1299/1239.Maximum-Length-of-a-Concatenated-String-with-Unique-Characters.md" >}})|Medium||||50.6%|
9292
|1310|XOR Queries of a Subarray|[Go]({{< relref "/ChapterFour/1300~1399/1310.XOR-Queries-of-a-Subarray.md" >}})|Medium||||70.7%|
9393
|1442|Count Triplets That Can Form Two Arrays of Equal XOR|[Go]({{< relref "/ChapterFour/1400~1499/1442.Count-Triplets-That-Can-Form-Two-Arrays-of-Equal-XOR.md" >}})|Medium||||73.8%|
9494
|1461|Check If a String Contains All Binary Codes of Size K|[Go]({{< relref "/ChapterFour/1400~1499/1461.Check-If-a-String-Contains-All-Binary-Codes-of-Size-K.md" >}})|Medium||||54.5%|
9595
|1486|XOR Operation in an Array|[Go]({{< relref "/ChapterFour/1400~1499/1486.XOR-Operation-in-an-Array.md" >}})|Easy||||84.0%|
96-
|1655|Distribute Repeating Integers|[Go]({{< relref "/ChapterFour/1600~1699/1655.Distribute-Repeating-Integers.md" >}})|Hard||||40.6%|
96+
|1655|Distribute Repeating Integers|[Go]({{< relref "/ChapterFour/1600~1699/1655.Distribute-Repeating-Integers.md" >}})|Hard||||40.7%|
9797
|1659|Maximize Grid Happiness|[Go]({{< relref "/ChapterFour/1600~1699/1659.Maximize-Grid-Happiness.md" >}})|Hard||||36.8%|
9898
|1680|Concatenation of Consecutive Binary Numbers|[Go]({{< relref "/ChapterFour/1600~1699/1680.Concatenation-of-Consecutive-Binary-Numbers.md" >}})|Medium||||52.5%|
9999
|1681|Minimum Incompatibility|[Go]({{< relref "/ChapterFour/1600~1699/1681.Minimum-Incompatibility.md" >}})|Hard||||36.6%|

‎website/content/ChapterTwo/Depth_First_Search.md

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -40,7 +40,7 @@ weight: 9
4040
|0297|Serialize and Deserialize Binary Tree|[Go]({{< relref "/ChapterFour/0200~0299/0297.Serialize-and-Deserialize-Binary-Tree.md" >}})|Hard||||52.2%|
4141
|0329|Longest Increasing Path in a Matrix|[Go]({{< relref "/ChapterFour/0300~0399/0329.Longest-Increasing-Path-in-a-Matrix.md" >}})|Hard||||48.4%|
4242
|0337|House Robber III|[Go]({{< relref "/ChapterFour/0300~0399/0337.House-Robber-III.md" >}})|Medium||||52.5%|
43-
|0341|Flatten Nested List Iterator|[Go]({{< relref "/ChapterFour/0300~0399/0341.Flatten-Nested-List-Iterator.md" >}})|Medium||||57.6%|
43+
|0341|Flatten Nested List Iterator|[Go]({{< relref "/ChapterFour/0300~0399/0341.Flatten-Nested-List-Iterator.md" >}})|Medium||||57.5%|
4444
|0385|Mini Parser|[Go]({{< relref "/ChapterFour/0300~0399/0385.Mini-Parser.md" >}})|Medium||||35.3%|
4545
|0386|Lexicographical Numbers|[Go]({{< relref "/ChapterFour/0300~0399/0386.Lexicographical-Numbers.md" >}})|Medium||||57.0%|
4646
|0399|Evaluate Division|[Go]({{< relref "/ChapterFour/0300~0399/0399.Evaluate-Division.md" >}})|Medium||||56.0%|

‎website/content/ChapterTwo/Dynamic_Programming.md

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -84,7 +84,7 @@ weight: 7
8484
|0920|Number of Music Playlists|[Go]({{< relref "/ChapterFour/0900~0999/0920.Number-of-Music-Playlists.md" >}})|Hard||||48.8%|
8585
|0968|Binary Tree Cameras|[Go]({{< relref "/ChapterFour/0900~0999/0968.Binary-Tree-Cameras.md" >}})|Hard||||41.2%|
8686
|0978|Longest Turbulent Subarray|[Go]({{< relref "/ChapterFour/0900~0999/0978.Longest-Turbulent-Subarray.md" >}})|Medium||||47.5%|
87-
|0996|Number of Squareful Arrays|[Go]({{< relref "/ChapterFour/0900~0999/0996.Number-of-Squareful-Arrays.md" >}})|Hard||||49.1%|
87+
|0996|Number of Squareful Arrays|[Go]({{< relref "/ChapterFour/0900~0999/0996.Number-of-Squareful-Arrays.md" >}})|Hard||||49.0%|
8888
|1025|Divisor Game|[Go]({{< relref "/ChapterFour/1000~1099/1025.Divisor-Game.md" >}})|Easy| O(1)| O(1)||66.4%|
8989
|1048|Longest String Chain|[Go]({{< relref "/ChapterFour/1000~1099/1048.Longest-String-Chain.md" >}})|Medium||||57.1%|
9090
|1049|Last Stone Weight II|[Go]({{< relref "/ChapterFour/1000~1099/1049.Last-Stone-Weight-II.md" >}})|Medium||||49.5%|
@@ -97,7 +97,7 @@ weight: 7
9797
|1646|Get Maximum in Generated Array|[Go]({{< relref "/ChapterFour/1600~1699/1646.Get-Maximum-in-Generated-Array.md" >}})|Easy||||51.3%|
9898
|1653|Minimum Deletions to Make String Balanced|[Go]({{< relref "/ChapterFour/1600~1699/1653.Minimum-Deletions-to-Make-String-Balanced.md" >}})|Medium||||54.0%|
9999
|1654|Minimum Jumps to Reach Home|[Go]({{< relref "/ChapterFour/1600~1699/1654.Minimum-Jumps-to-Reach-Home.md" >}})|Medium||||25.7%|
100-
|1655|Distribute Repeating Integers|[Go]({{< relref "/ChapterFour/1600~1699/1655.Distribute-Repeating-Integers.md" >}})|Hard||||40.6%|
100+
|1655|Distribute Repeating Integers|[Go]({{< relref "/ChapterFour/1600~1699/1655.Distribute-Repeating-Integers.md" >}})|Hard||||40.7%|
101101
|1659|Maximize Grid Happiness|[Go]({{< relref "/ChapterFour/1600~1699/1659.Maximize-Grid-Happiness.md" >}})|Hard||||36.8%|
102102
|1664|Ways to Make a Fair Array|[Go]({{< relref "/ChapterFour/1600~1699/1664.Ways-to-Make-a-Fair-Array.md" >}})|Medium||||62.4%|
103103
|1681|Minimum Incompatibility|[Go]({{< relref "/ChapterFour/1600~1699/1681.Minimum-Incompatibility.md" >}})|Hard||||36.6%|

‎website/content/ChapterTwo/Math.md

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -98,7 +98,7 @@ weight: 12
9898
|0976|Largest Perimeter Triangle|[Go]({{< relref "/ChapterFour/0900~0999/0976.Largest-Perimeter-Triangle.md" >}})|Easy| O(n log n)| O(log n) ||59.9%|
9999
|0989|Add to Array-Form of Integer|[Go]({{< relref "/ChapterFour/0900~0999/0989.Add-to-Array-Form-of-Integer.md" >}})|Easy||||45.1%|
100100
|0991|Broken Calculator|[Go]({{< relref "/ChapterFour/0900~0999/0991.Broken-Calculator.md" >}})|Medium||||50.0%|
101-
|0996|Number of Squareful Arrays|[Go]({{< relref "/ChapterFour/0900~0999/0996.Number-of-Squareful-Arrays.md" >}})|Hard| O(n log n)| O(n) ||49.1%|
101+
|0996|Number of Squareful Arrays|[Go]({{< relref "/ChapterFour/0900~0999/0996.Number-of-Squareful-Arrays.md" >}})|Hard| O(n log n)| O(n) ||49.0%|
102102
|1006|Clumsy Factorial|[Go]({{< relref "/ChapterFour/1000~1099/1006.Clumsy-Factorial.md" >}})|Medium||||54.3%|
103103
|1017|Convert to Base -2|[Go]({{< relref "/ChapterFour/1000~1099/1017.Convert-to-Base-2.md" >}})|Medium||||59.6%|
104104
|1025|Divisor Game|[Go]({{< relref "/ChapterFour/1000~1099/1025.Divisor-Game.md" >}})|Easy| O(1)| O(1)||66.4%|

0 commit comments

Comments
(0)

AltStyle によって変換されたページ (->オリジナル) /