package main
import (
"fmt"
"sort"
)
func main() {
//nums := []int{100, 4, 200, 1, 3, 2}
nums := []int{0, 3, 7, 2, 5, 8, 4, 6, 0, 1}
consecutive := longestConsecutive(nums)
fmt.Println(consecutive)
}
// nums = [100,4,200,1,3,2]
func longestConsecutive(nums []int) int {
if len(nums) == 0 {
return 0
}
sort.Ints(nums)
longest := 1
current := 1
for i := 1; i < len(nums); i++ {
if nums[i] != nums[i-1] {
//判断两数之间差值是否为1
if nums[i] == nums[i-1]+1 {
//记录最大连续数值
current++
} else {
longest = max(longest, current)
current = 1
}
}
}
return max(longest, current)
}
func max(a, b int) int {
if a > b {
return a
}
return b
}
Go实现最长连续序列
最新推荐文章于 2025-03-06 18:33:39 发布