Skip to content

Commit 0646ca2

Browse files
yanglbmeyanglbme
authored
feat: use the built-in min max functions in Go 1.21.0+ (doocs#1908)
1 parent f8ed7c6 commit 0646ca2

File tree

1,937 files changed

+8
-16855
lines changed

Some content is hidden

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

1,937 files changed

+8
-16855
lines changed

‎lcci/01.05.One Away/README.md

-13
Original file line numberDiff line numberDiff line change
@@ -180,19 +180,6 @@ func oneEditAway(first string, second string) bool {
180180
}
181181
return dp[m][n] == 1
182182
}
183-
184-
func min(x, y, z int) int {
185-
if x < y {
186-
if x < z {
187-
return x
188-
}
189-
return z
190-
}
191-
if y < z {
192-
return y
193-
}
194-
return z
195-
}
196183
```
197184

198185
### **TypeScript**

‎lcci/01.05.One Away/README_EN.md

-13
Original file line numberDiff line numberDiff line change
@@ -164,19 +164,6 @@ func oneEditAway(first string, second string) bool {
164164
}
165165
return dp[m][n] == 1
166166
}
167-
168-
func min(x, y, z int) int {
169-
if x < y {
170-
if x < z {
171-
return x
172-
}
173-
return z
174-
}
175-
if y < z {
176-
return y
177-
}
178-
return z
179-
}
180167
```
181168

182169
### **TypeScript**

‎lcci/01.05.One Away/Solution.go

-13
Original file line numberDiff line numberDiff line change
@@ -26,17 +26,4 @@ func oneEditAway(first string, second string) bool {
2626
}
2727
}
2828
return dp[m][n] == 1
29-
}
30-
31-
func min(x, y, z int) int {
32-
if x < y {
33-
if x < z {
34-
return x
35-
}
36-
return z
37-
}
38-
if y < z {
39-
return y
40-
}
41-
return z
4229
}

‎lcci/03.02.Min Stack/README.md

-7
Original file line numberDiff line numberDiff line change
@@ -217,13 +217,6 @@ func (this *MinStack) GetMin() int {
217217
return this.stk2[len(this.stk2)-1]
218218
}
219219

220-
func min(a, b int) int {
221-
if a < b {
222-
return a
223-
}
224-
return b
225-
}
226-
227220
/**
228221
* Your MinStack object will be instantiated and called as such:
229222
* obj := Constructor();

‎lcci/03.02.Min Stack/README_EN.md

-7
Original file line numberDiff line numberDiff line change
@@ -176,13 +176,6 @@ func (this *MinStack) GetMin() int {
176176
return this.stk2[len(this.stk2)-1]
177177
}
178178

179-
func min(a, b int) int {
180-
if a < b {
181-
return a
182-
}
183-
return b
184-
}
185-
186179
/**
187180
* Your MinStack object will be instantiated and called as such:
188181
* obj := Constructor();

‎lcci/03.02.Min Stack/Solution.go

-7
Original file line numberDiff line numberDiff line change
@@ -26,13 +26,6 @@ func (this *MinStack) GetMin() int {
2626
return this.stk2[len(this.stk2)-1]
2727
}
2828

29-
func min(a, b int) int {
30-
if a < b {
31-
return a
32-
}
33-
return b
34-
}
35-
3629
/**
3730
* Your MinStack object will be instantiated and called as such:
3831
* obj := Constructor();

‎lcci/04.04.Check Balance/README.md

-7
Original file line numberDiff line numberDiff line change
@@ -163,13 +163,6 @@ func isBalanced(root *TreeNode) bool {
163163
return dfs(root) >= 0
164164
}
165165
166-
func max(a, b int) int {
167-
if a > b {
168-
return a
169-
}
170-
return b
171-
}
172-
173166
func abs(x int) int {
174167
if x < 0 {
175168
return -x

‎lcci/04.04.Check Balance/README_EN.md

-7
Original file line numberDiff line numberDiff line change
@@ -187,13 +187,6 @@ func isBalanced(root *TreeNode) bool {
187187
return dfs(root) >= 0
188188
}
189189
190-
func max(a, b int) int {
191-
if a > b {
192-
return a
193-
}
194-
return b
195-
}
196-
197190
func abs(x int) int {
198191
if x < 0 {
199192
return -x

‎lcci/04.04.Check Balance/Solution.go

-7
Original file line numberDiff line numberDiff line change
@@ -21,13 +21,6 @@ func isBalanced(root *TreeNode) bool {
2121
return dfs(root) >= 0
2222
}
2323

24-
func max(a, b int) int {
25-
if a > b {
26-
return a
27-
}
28-
return b
29-
}
30-
3124
func abs(x int) int {
3225
if x < 0 {
3326
return -x

‎lcci/05.03.Reverse Bits/README.md

-7
Original file line numberDiff line numberDiff line change
@@ -103,13 +103,6 @@ func reverseBits(num int) (ans int) {
103103
}
104104
return
105105
}
106-
107-
func max(a, b int) int {
108-
if a > b {
109-
return a
110-
}
111-
return b
112-
}
113106
```
114107

115108
### **...**

‎lcci/05.03.Reverse Bits/README_EN.md

-7
Original file line numberDiff line numberDiff line change
@@ -95,13 +95,6 @@ func reverseBits(num int) (ans int) {
9595
}
9696
return
9797
}
98-
99-
func max(a, b int) int {
100-
if a > b {
101-
return a
102-
}
103-
return b
104-
}
10598
```
10699

107100
### **...**

‎lcci/05.03.Reverse Bits/Solution.go

-7
Original file line numberDiff line numberDiff line change
@@ -9,11 +9,4 @@ func reverseBits(num int) (ans int) {
99
ans = max(ans, i-j+1)
1010
}
1111
return
12-
}
13-
14-
func max(a, b int) int {
15-
if a > b {
16-
return a
17-
}
18-
return b
1912
}

‎lcci/08.13.Pile Box/README.md

-7
Original file line numberDiff line numberDiff line change
@@ -126,13 +126,6 @@ func pileBox(box [][]int) (ans int) {
126126
}
127127
return
128128
}
129-
130-
func max(a, b int) int {
131-
if a > b {
132-
return a
133-
}
134-
return b
135-
}
136129
```
137130

138131
### **TypeScript**

‎lcci/08.13.Pile Box/README_EN.md

-7
Original file line numberDiff line numberDiff line change
@@ -116,13 +116,6 @@ func pileBox(box [][]int) (ans int) {
116116
}
117117
return
118118
}
119-
120-
func max(a, b int) int {
121-
if a > b {
122-
return a
123-
}
124-
return b
125-
}
126119
```
127120

128121
### **TypeScript**

‎lcci/08.13.Pile Box/Solution.go

-7
Original file line numberDiff line numberDiff line change
@@ -15,11 +15,4 @@ func pileBox(box [][]int) (ans int) {
1515
ans = max(ans, f[i])
1616
}
1717
return
18-
}
19-
20-
func max(a, b int) int {
21-
if a > b {
22-
return a
23-
}
24-
return b
2518
}

‎lcci/16.06.Smallest Difference/README.md

-14
Original file line numberDiff line numberDiff line change
@@ -187,13 +187,6 @@ func smallestDifference(a []int, b []int) int {
187187
}
188188
return ans
189189
}
190-
191-
func min(a, b int) int {
192-
if a < b {
193-
return a
194-
}
195-
return b
196-
}
197190
```
198191

199192
```go
@@ -219,13 +212,6 @@ func abs(a int) int {
219212
}
220213
return a
221214
}
222-
223-
func min(a, b int) int {
224-
if a < b {
225-
return a
226-
}
227-
return b
228-
}
229215
```
230216

231217
### **TypeScript**

‎lcci/16.06.Smallest Difference/README_EN.md

-14
Original file line numberDiff line numberDiff line change
@@ -187,13 +187,6 @@ func smallestDifference(a []int, b []int) int {
187187
}
188188
return ans
189189
}
190-
191-
func min(a, b int) int {
192-
if a < b {
193-
return a
194-
}
195-
return b
196-
}
197190
```
198191

199192
```go
@@ -219,13 +212,6 @@ func abs(a int) int {
219212
}
220213
return a
221214
}
222-
223-
func min(a, b int) int {
224-
if a < b {
225-
return a
226-
}
227-
return b
228-
}
229215
```
230216

231217
### **TypeScript**

‎lcci/16.06.Smallest Difference/Solution.go

-7
Original file line numberDiff line numberDiff line change
@@ -19,11 +19,4 @@ func abs(a int) int {
1919
return -a
2020
}
2121
return a
22-
}
23-
24-
func min(a, b int) int {
25-
if a < b {
26-
return a
27-
}
28-
return b
2922
}

‎lcci/16.15.Master Mind/README.md

-7
Original file line numberDiff line numberDiff line change
@@ -109,13 +109,6 @@ func masterMind(solution string, guess string) []int {
109109
}
110110
return []int{x, y - x}
111111
}
112-
113-
func min(a, b int) int {
114-
if a < b {
115-
return a
116-
}
117-
return b
118-
}
119112
```
120113

121114
### **JavaScript**

‎lcci/16.15.Master Mind/README_EN.md

-7
Original file line numberDiff line numberDiff line change
@@ -110,13 +110,6 @@ func masterMind(solution string, guess string) []int {
110110
}
111111
return []int{x, y - x}
112112
}
113-
114-
func min(a, b int) int {
115-
if a < b {
116-
return a
117-
}
118-
return b
119-
}
120113
```
121114

122115
### **JavaScript**

‎lcci/16.15.Master Mind/Solution.go

-7
Original file line numberDiff line numberDiff line change
@@ -14,11 +14,4 @@ func masterMind(solution string, guess string) []int {
1414
y += min(cnt1[c], cnt2[c])
1515
}
1616
return []int{x, y - x}
17-
}
18-
19-
func min(a, b int) int {
20-
if a < b {
21-
return a
22-
}
23-
return b
2417
}

‎lcci/16.17.Contiguous Sequence/README.md

-7
Original file line numberDiff line numberDiff line change
@@ -98,13 +98,6 @@ func maxSubArray(nums []int) int {
9898
}
9999
return ans
100100
}
101-
102-
func max(a, b int) int {
103-
if a > b {
104-
return a
105-
}
106-
return b
107-
}
108101
```
109102

110103
### **TypeScript**

‎lcci/16.17.Contiguous Sequence/README_EN.md

-7
Original file line numberDiff line numberDiff line change
@@ -104,13 +104,6 @@ func maxSubArray(nums []int) int {
104104
}
105105
return ans
106106
}
107-
108-
func max(a, b int) int {
109-
if a > b {
110-
return a
111-
}
112-
return b
113-
}
114107
```
115108

116109
### **TypeScript**

‎lcci/16.17.Contiguous Sequence/Solution.go

-7
Original file line numberDiff line numberDiff line change
@@ -5,11 +5,4 @@ func maxSubArray(nums []int) int {
55
ans = max(ans, f)
66
}
77
return ans
8-
}
9-
10-
func max(a, b int) int {
11-
if a > b {
12-
return a
13-
}
14-
return b
158
}

‎lcci/16.22.Langtons Ant/README.md

-15
Original file line numberDiff line numberDiff line change
@@ -218,21 +218,6 @@ func printKMoves(K int) []string {
218218
}
219219
return ans
220220
}
221-
222-
func min(a, b int) int {
223-
if a < b {
224-
return a
225-
}
226-
return b
227-
}
228-
229-
func max(a, b int) int {
230-
if a > b {
231-
return a
232-
}
233-
return b
234-
235-
}
236221
```
237222

238223
### **...**

0 commit comments

Comments
 (0)