20 lines
366 B
Go
20 lines
366 B
Go
// Package q3289 implements a solution for https://leetcode.com/problems/the-two-sneaky-numbers-of-digitville/
|
|
package q3289
|
|
|
|
func getSneakyNumbers(nums []int) []int {
|
|
ret := [2]int{}
|
|
p := 0
|
|
|
|
for _, num := range nums {
|
|
num %= 1000
|
|
if nums[num] >= 1000 {
|
|
ret[p] = num
|
|
p++
|
|
} else {
|
|
nums[num] += 1000
|
|
}
|
|
}
|
|
return ret[:]
|
|
}
|
|
|
|
var _ = getSneakyNumbers
|