add new solutions
This commit is contained in:
parent
d798d5e8c9
commit
886b5e0a8e
34 changed files with 1164 additions and 0 deletions
27
solutions/1/q128/solution.go
Normal file
27
solutions/1/q128/solution.go
Normal file
|
|
@ -0,0 +1,27 @@
|
|||
package q128
|
||||
|
||||
func longestConsecutive(nums []int) int {
|
||||
set := make(map[int]struct{}, len(nums))
|
||||
for _, n := range nums {
|
||||
set[n] = struct{}{}
|
||||
}
|
||||
|
||||
longest := 0
|
||||
for n := range set {
|
||||
if _, ok := set[n-1]; ok {
|
||||
continue
|
||||
}
|
||||
r := n
|
||||
for {
|
||||
if _, ok := set[r+1]; ok {
|
||||
r++
|
||||
} else {
|
||||
break
|
||||
}
|
||||
}
|
||||
longest = max(longest, r-n+1)
|
||||
}
|
||||
return longest
|
||||
}
|
||||
|
||||
var _ = longestConsecutive
|
||||
Loading…
Add table
Add a link
Reference in a new issue