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 bcb9d14

Browse files
feat: use the slices.Min/Max functions in golang code snippets (doocs#1951)
1 parent 9015f7c commit bcb9d14

File tree

180 files changed

+279
-857
lines changed

Some content is hidden

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

180 files changed

+279
-857
lines changed

‎lcci/08.13.Pile Box/README.md‎

Lines changed: 2 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -108,7 +108,7 @@ public:
108108
### **Go**
109109
110110
```go
111-
func pileBox(box [][]int) (ans int) {
111+
func pileBox(box [][]int) int {
112112
sort.Slice(box, func(i, j int) bool {
113113
a, b := box[i], box[j]
114114
return a[0] < b[0] || (a[0] == b[0] && b[1] < a[1])
@@ -122,9 +122,8 @@ func pileBox(box [][]int) (ans int) {
122122
}
123123
}
124124
f[i] += box[i][2]
125-
ans = max(ans, f[i])
126125
}
127-
return
126+
return slices.Max(f)
128127
}
129128
```
130129

‎lcci/08.13.Pile Box/README_EN.md‎

Lines changed: 2 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -98,7 +98,7 @@ public:
9898
### **Go**
9999
100100
```go
101-
func pileBox(box [][]int) (ans int) {
101+
func pileBox(box [][]int) int {
102102
sort.Slice(box, func(i, j int) bool {
103103
a, b := box[i], box[j]
104104
return a[0] < b[0] || (a[0] == b[0] && b[1] < a[1])
@@ -112,9 +112,8 @@ func pileBox(box [][]int) (ans int) {
112112
}
113113
}
114114
f[i] += box[i][2]
115-
ans = max(ans, f[i])
116115
}
117-
return
116+
return slices.Max(f)
118117
}
119118
```
120119

‎lcci/08.13.Pile Box/Solution.go‎

Lines changed: 2 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -1,4 +1,4 @@
1-
func pileBox(box [][]int) (ansint) {
1+
func pileBox(box [][]int) int {
22
sort.Slice(box, func(i, j int) bool {
33
a, b := box[i], box[j]
44
return a[0] < b[0] || (a[0] == b[0] && b[1] < a[1])
@@ -12,7 +12,6 @@ func pileBox(box [][]int) (ans int) {
1212
}
1313
}
1414
f[i] += box[i][2]
15-
ans = max(ans, f[i])
1615
}
17-
return
16+
returnslices.Max(f)
1817
}

‎lcof2/剑指 Offer II 073. 狒狒吃香蕉/README.md‎

Lines changed: 1 addition & 5 deletions
Original file line numberDiff line numberDiff line change
@@ -132,11 +132,7 @@ public:
132132
133133
```go
134134
func minEatingSpeed(piles []int, h int) int {
135-
mx := 0
136-
for _, pile := range piles {
137-
mx = max(mx, pile)
138-
}
139-
left, right := 1, mx
135+
left, right := 1, slices.Max(piles)
140136
for left < right {
141137
mid := (left + right) >> 1
142138
s := 0

‎lcof2/剑指 Offer II 073. 狒狒吃香蕉/Solution.go‎

Lines changed: 1 addition & 5 deletions
Original file line numberDiff line numberDiff line change
@@ -1,9 +1,5 @@
11
func minEatingSpeed(piles []int, h int) int {
2-
mx := 0
3-
for _, pile := range piles {
4-
mx = max(mx, pile)
5-
}
6-
left, right := 1, mx
2+
left, right := 1, slices.Max(piles)
73
for left < right {
84
mid := (left + right) >> 1
95
s := 0

‎lcp/LCP 33. 蓄水/README.md‎

Lines changed: 1 addition & 4 deletions
Original file line numberDiff line numberDiff line change
@@ -125,10 +125,7 @@ public:
125125
126126
```go
127127
func storeWater(bucket []int, vat []int) int {
128-
mx := 0
129-
for _, x := range vat {
130-
mx = max(mx, x)
131-
}
128+
mx := slices.Max(vat)
132129
if mx == 0 {
133130
return 0
134131
}

‎lcp/LCP 33. 蓄水/Solution.go‎

Lines changed: 1 addition & 4 deletions
Original file line numberDiff line numberDiff line change
@@ -1,8 +1,5 @@
11
func storeWater(bucket []int, vat []int) int {
2-
mx := 0
3-
for _, x := range vat {
4-
mx = max(mx, x)
5-
}
2+
mx := slices.Max(vat)
63
if mx == 0 {
74
return 0
85
}

‎lcp/LCP 50. 宝石补给/README.md‎

Lines changed: 1 addition & 6 deletions
Original file line numberDiff line numberDiff line change
@@ -131,12 +131,7 @@ func giveGem(gem []int, operations [][]int) int {
131131
gem[y] += v
132132
gem[x] -= v
133133
}
134-
mx, mi := 0, 1<<30
135-
for _, x := range gem {
136-
mx = max(mx, x)
137-
mi = min(mi, x)
138-
}
139-
return mx - mi
134+
return slices.Max(gem) - slices.Min(gem)
140135
}
141136
```
142137

‎lcp/LCP 50. 宝石补给/Solution.go‎

Lines changed: 1 addition & 6 deletions
Original file line numberDiff line numberDiff line change
@@ -5,10 +5,5 @@ func giveGem(gem []int, operations [][]int) int {
55
gem[y] += v
66
gem[x] -= v
77
}
8-
mx, mi := 0, 1<<30
9-
for _, x := range gem {
10-
mx = max(mx, x)
11-
mi = min(mi, x)
12-
}
13-
return mx - mi
8+
return slices.Max(gem) - slices.Min(gem)
149
}

‎lcp/LCP 68. 美观的花束/README.md‎

Lines changed: 1 addition & 4 deletions
Original file line numberDiff line numberDiff line change
@@ -128,10 +128,7 @@ public:
128128
129129
```go
130130
func beautifulBouquet(flowers []int, cnt int) (ans int) {
131-
mx := 0
132-
for _, x := range flowers {
133-
mx = max(mx, x)
134-
}
131+
mx := slices.Max(flowers)
135132
d := make([]int, mx+1)
136133
j := 0
137134
const mod = 1e9 + 7

0 commit comments

Comments
(0)

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