代码拉取完成,页面将自动刷新
// ++++++++++++++++++++++++++++++++++++++++
// 《零基础Go语言算法实战》源码
// ++++++++++++++++++++++++++++++++++++++++
// Author:廖显东(ShirDon)
// Blog:https://www.shirdon.com/
// Gitee:https://gitee.com/shirdonl/goAlgorithms.git
// Buy link :https://item.jd.com/14101229.html
// ++++++++++++++++++++++++++++++++++++++++
package main
import "fmt"
func dominantIndex(array []int) int {
highest, secHighest := 0, 0
key := 0
for k, v := range array {
if v > highest {
secHighest = highest
highest = v
key = k
} else if v > secHighest {
secHighest = v
}
}
if 2*secHighest <= highest {
return key
} else {
return -1
}
}
func main() {
points := []int{2, 10, 5, 1}
res := dominantIndex(points)
fmt.Println(res)
}
//$ go run interview6-1.go
//1
此处可能存在不合适展示的内容,页面不予展示。您可通过相关编辑功能自查并修改。
如您确认内容无涉及 不当用语 / 纯广告导流 / 暴力 / 低俗色情 / 侵权 / 盗版 / 虚假 / 无价值内容或违法国家有关法律法规的内容,可点击提交进行申诉,我们将尽快为您处理。