mirror of
https://github.com/unknwon/the-way-to-go_ZH_CN.git
synced 2025-08-12 02:16:48 +08:00
update book code
This commit is contained in:
39
eBook/exercises/chapter_7/min_max.go
Executable file
39
eBook/exercises/chapter_7/min_max.go
Executable file
@@ -0,0 +1,39 @@
|
||||
// Q13_1_max.go
|
||||
package main
|
||||
|
||||
import (
|
||||
"fmt"
|
||||
"math"
|
||||
)
|
||||
|
||||
func main() {
|
||||
sl1 := []int{78,34,643,12,90,492, 13, 2}
|
||||
max := maxSlice(sl1)
|
||||
fmt.Printf("The maximum is %d\n", max)
|
||||
min := minSlice(sl1)
|
||||
fmt.Printf("The minimum is %d\n", min)
|
||||
}
|
||||
|
||||
func maxSlice(sl []int) (max int) {
|
||||
for _, v := range sl {
|
||||
if v > max {
|
||||
max = v
|
||||
}
|
||||
}
|
||||
return
|
||||
}
|
||||
|
||||
func minSlice(sl [] int) (min int) {
|
||||
// min = int(^uint(0) >> 1)
|
||||
min = math.MaxInt32
|
||||
for _, v := range sl {
|
||||
if v < min {
|
||||
min = v
|
||||
}
|
||||
}
|
||||
return
|
||||
}
|
||||
/* Output:
|
||||
The maximum is 643
|
||||
The minimum is 2
|
||||
*/
|
Reference in New Issue
Block a user