mirror of
https://github.com/samber/lo.git
synced 2026-04-22 23:47:11 +08:00
Less instructions on min and max
This commit is contained in:
@@ -49,13 +49,14 @@ func Find[T any](collection []T, predicate func(T) bool) (T, bool) {
|
||||
func Min[T Ordered](collection []T) T {
|
||||
var min T
|
||||
|
||||
for i := 0; i < len(collection); i++ {
|
||||
item := collection[i]
|
||||
if len(collection) == 0 {
|
||||
return min
|
||||
}
|
||||
|
||||
if i == 0 {
|
||||
min = item
|
||||
continue
|
||||
}
|
||||
min = collection[0]
|
||||
|
||||
for i := 1; i < len(collection); i++ {
|
||||
item := collection[i]
|
||||
|
||||
// if item.Less(min) {
|
||||
if item < min {
|
||||
@@ -70,13 +71,14 @@ func Min[T Ordered](collection []T) T {
|
||||
func Max[T Ordered](collection []T) T {
|
||||
var max T
|
||||
|
||||
for i := 0; i < len(collection); i++ {
|
||||
item := collection[i]
|
||||
if len(collection) == 0 {
|
||||
return max
|
||||
}
|
||||
|
||||
if i == 0 {
|
||||
max = item
|
||||
continue
|
||||
}
|
||||
max = collection[0]
|
||||
|
||||
for i := 1; i < len(collection); i++ {
|
||||
item := collection[i]
|
||||
|
||||
if item > max {
|
||||
max = item
|
||||
|
||||
Reference in New Issue
Block a user