Skip to content

Commit 7edb440

Browse files
LjyYanoactions-user
authored andcommitted
style: prettify code
1 parent 964bea7 commit 7edb440

File tree

244 files changed

+602
-1308
lines changed

Some content is hidden

Large Commits have some content hidden by default. Use the searchbox below for content that may be hidden.

244 files changed

+602
-1308
lines changed

solution/1600-1699/1600.Throne Inheritance/README.md

Lines changed: 2 additions & 4 deletions
Original file line numberDiff line numberDiff line change
@@ -74,13 +74,10 @@ t.getInheritanceOrder(); // 返回 ["king", "andy", "ma
7474
<li>最多调用&nbsp;<code>10</code>&nbsp;次&nbsp;<code>getInheritanceOrder</code>&nbsp;。</li>
7575
</ul>
7676

77-
78-
7977
## 解法
8078

8179
<!-- 这里可写通用的实现逻辑 -->
8280

83-
8481
<!-- tabs:start -->
8582

8683
### **Python3**
@@ -100,8 +97,9 @@ t.getInheritanceOrder(); // 返回 [&quot;king&quot;, &quot;andy&quot;, &quot;ma
10097
```
10198

10299
### **...**
100+
103101
```
104102
105103
```
106104

107-
<!-- tabs:end -->
105+
<!-- tabs:end -->

solution/1600-1699/1600.Throne Inheritance/README_EN.md

Lines changed: 2 additions & 6 deletions
Original file line numberDiff line numberDiff line change
@@ -73,30 +73,26 @@ t.getInheritanceOrder(); // return [&quot;king&quot;, &quot;andy&quot;, &quot;ma
7373
<li>At most <code>10</code> calls will be made to <code>getInheritanceOrder</code>.</li>
7474
</ul>
7575

76-
7776
## Solutions
7877

79-
80-
8178
<!-- tabs:start -->
8279

8380
### **Python3**
8481

85-
8682
```python
8783

8884
```
8985

9086
### **Java**
9187

92-
9388
```java
9489

9590
```
9691

9792
### **...**
93+
9894
```
9995
10096
```
10197

102-
<!-- tabs:end -->
98+
<!-- tabs:end -->

solution/1600-1699/1601.Maximum Number of Achievable Transfer Requests/README.md

Lines changed: 2 additions & 4 deletions
Original file line numberDiff line numberDiff line change
@@ -60,13 +60,10 @@
6060
<li><code>0 &lt;= from<sub>i</sub>, to<sub>i</sub> &lt; n</code></li>
6161
</ul>
6262

63-
64-
6563
## 解法
6664

6765
<!-- 这里可写通用的实现逻辑 -->
6866

69-
7067
<!-- tabs:start -->
7168

7269
### **Python3**
@@ -86,8 +83,9 @@
8683
```
8784

8885
### **...**
86+
8987
```
9088
9189
```
9290

93-
<!-- tabs:end -->
91+
<!-- tabs:end -->

solution/1600-1699/1601.Maximum Number of Achievable Transfer Requests/README_EN.md

Lines changed: 2 additions & 6 deletions
Original file line numberDiff line numberDiff line change
@@ -56,30 +56,26 @@ We can achieve all the requests. </pre>
5656
<li><code>0 &lt;= from<sub>i</sub>, to<sub>i</sub> &lt; n</code></li>
5757
</ul>
5858

59-
6059
## Solutions
6160

62-
63-
6461
<!-- tabs:start -->
6562

6663
### **Python3**
6764

68-
6965
```python
7066

7167
```
7268

7369
### **Java**
7470

75-
7671
```java
7772

7873
```
7974

8075
### **...**
76+
8177
```
8278
8379
```
8480

85-
<!-- tabs:end -->
81+
<!-- tabs:end -->

solution/1600-1699/1603.Design Parking System/README.md

Lines changed: 2 additions & 4 deletions
Original file line numberDiff line numberDiff line change
@@ -43,13 +43,10 @@ parkingSystem.addCar(1); // 返回 false ,因为没有空的大车位,唯一
4343
<li>最多会调用 <code>addCar</code> 函数 <code>1000</code> 次</li>
4444
</ul>
4545

46-
47-
4846
## 解法
4947

5048
<!-- 这里可写通用的实现逻辑 -->
5149

52-
5350
<!-- tabs:start -->
5451

5552
### **Python3**
@@ -69,8 +66,9 @@ parkingSystem.addCar(1); // 返回 false ,因为没有空的大车位,唯一
6966
```
7067

7168
### **...**
69+
7270
```
7371
7472
```
7573

76-
<!-- tabs:end -->
74+
<!-- tabs:end -->

solution/1600-1699/1603.Design Parking System/README_EN.md

Lines changed: 2 additions & 6 deletions
Original file line numberDiff line numberDiff line change
@@ -40,30 +40,26 @@ parkingSystem.addCar(1); // return false because there is no available slot for
4040
<li>At most <code>1000</code> calls will be made to <code>addCar</code></li>
4141
</ul>
4242

43-
4443
## Solutions
4544

46-
47-
4845
<!-- tabs:start -->
4946

5047
### **Python3**
5148

52-
5349
```python
5450

5551
```
5652

5753
### **Java**
5854

59-
6055
```java
6156

6257
```
6358

6459
### **...**
60+
6561
```
6662
6763
```
6864

69-
<!-- tabs:end -->
65+
<!-- tabs:end -->

solution/1600-1699/1604.Alert Using Same Key-Card Three or More Times in a One Hour Period/README.md

Lines changed: 2 additions & 4 deletions
Original file line numberDiff line numberDiff line change
@@ -60,13 +60,10 @@
6060
<li><code>keyName[i]</code> 只包含小写英文字母。</li>
6161
</ul>
6262

63-
64-
6563
## 解法
6664

6765
<!-- 这里可写通用的实现逻辑 -->
6866

69-
7067
<!-- tabs:start -->
7168

7269
### **Python3**
@@ -86,8 +83,9 @@
8683
```
8784

8885
### **...**
86+
8987
```
9088
9189
```
9290

93-
<!-- tabs:end -->
91+
<!-- tabs:end -->

solution/1600-1699/1604.Alert Using Same Key-Card Three or More Times in a One Hour Period/README_EN.md

Lines changed: 2 additions & 6 deletions
Original file line numberDiff line numberDiff line change
@@ -57,30 +57,26 @@
5757
<li><code>keyName[i] contains only lowercase English letters.</code></li>
5858
</ul>
5959

60-
6160
## Solutions
6261

63-
64-
6562
<!-- tabs:start -->
6663

6764
### **Python3**
6865

69-
7066
```python
7167

7268
```
7369

7470
### **Java**
7571

76-
7772
```java
7873

7974
```
8075

8176
### **...**
77+
8278
```
8379
8480
```
8581

86-
<!-- tabs:end -->
82+
<!-- tabs:end -->

solution/1600-1699/1605.Find Valid Matrix Given Row and Column Sums/README.md

Lines changed: 2 additions & 4 deletions
Original file line numberDiff line numberDiff line change
@@ -71,13 +71,10 @@
7171
<li><code>sum(rows) == sum(columns)</code></li>
7272
</ul>
7373

74-
75-
7674
## 解法
7775

7876
<!-- 这里可写通用的实现逻辑 -->
7977

80-
8178
<!-- tabs:start -->
8279

8380
### **Python3**
@@ -97,8 +94,9 @@
9794
```
9895

9996
### **...**
97+
10098
```
10199
102100
```
103101

104-
<!-- tabs:end -->
102+
<!-- tabs:end -->

solution/1600-1699/1605.Find Valid Matrix Given Row and Column Sums/README_EN.md

Lines changed: 2 additions & 6 deletions
Original file line numberDiff line numberDiff line change
@@ -68,30 +68,26 @@ Another possible matrix is: [[1,2],
6868
<li><code>sum(rows) == sum(columns)</code></li>
6969
</ul>
7070

71-
7271
## Solutions
7372

74-
75-
7673
<!-- tabs:start -->
7774

7875
### **Python3**
7976

80-
8177
```python
8278

8379
```
8480

8581
### **Java**
8682

87-
8883
```java
8984

9085
```
9186

9287
### **...**
88+
9389
```
9490
9591
```
9692

97-
<!-- tabs:end -->
93+
<!-- tabs:end -->

solution/1600-1699/1606.Find Servers That Handled Most Number of Requests/README.md

Lines changed: 2 additions & 4 deletions
Original file line numberDiff line numberDiff line change
@@ -80,13 +80,10 @@
8080
<li><code>arrival</code> 保证 <strong>严格递增</strong> 。</li>
8181
</ul>
8282

83-
84-
8583
## 解法
8684

8785
<!-- 这里可写通用的实现逻辑 -->
8886

89-
9087
<!-- tabs:start -->
9188

9289
### **Python3**
@@ -106,8 +103,9 @@
106103
```
107104

108105
### **...**
106+
109107
```
110108
111109
```
112110

113-
<!-- tabs:end -->
111+
<!-- tabs:end -->

solution/1600-1699/1606.Find Servers That Handled Most Number of Requests/README_EN.md

Lines changed: 2 additions & 6 deletions
Original file line numberDiff line numberDiff line change
@@ -75,30 +75,26 @@ Server 0 handled two requests, while servers 1 and 2 handled one request each. H
7575
<li><code>arrival</code> is <strong>strictly increasing</strong>.</li>
7676
</ul>
7777

78-
7978
## Solutions
8079

81-
82-
8380
<!-- tabs:start -->
8481

8582
### **Python3**
8683

87-
8884
```python
8985

9086
```
9187

9288
### **Java**
9389

94-
9590
```java
9691

9792
```
9893

9994
### **...**
95+
10096
```
10197
10298
```
10399

104-
<!-- tabs:end -->
100+
<!-- tabs:end -->

solution/1600-1699/1608.Special Array With X Elements Greater Than or Equal X/README.md

Lines changed: 2 additions & 4 deletions
Original file line numberDiff line numberDiff line change
@@ -52,13 +52,10 @@ x 不能取更大的值,因为 nums 中只有两个元素。</pre>
5252
<li><code>0 &lt;= nums[i] &lt;= 1000</code></li>
5353
</ul>
5454

55-
56-
5755
## 解法
5856

5957
<!-- 这里可写通用的实现逻辑 -->
6058

61-
6259
<!-- tabs:start -->
6360

6461
### **Python3**
@@ -78,8 +75,9 @@ x 不能取更大的值,因为 nums 中只有两个元素。</pre>
7875
```
7976

8077
### **...**
78+
8179
```
8280
8381
```
8482

85-
<!-- tabs:end -->
83+
<!-- tabs:end -->

0 commit comments

Comments
 (0)