Go golang 0ms solutions
Runtime: 0 ms, faster than 100.00% of Go online submissions for Moving Stones Until Consecutive.\nMemory Usage: 2 MB, less than 66.67% of Go online submissions 
>Runtime: 0 ms, faster than 100.00% of Go online submissions for Moving Stones Until Consecutive.\nMemory Usage: 2 MB, less than 66.67% of Go online submissions for Moving Stones Until Consecutive.\n\n```go\nfunc numMovesStones(a int, b int, c int) []int {\n    tmp := []int{a, b, c}\n    sort.Ints(tmp)\n    if tmp[2] - tmp[0] == 2 { return []int{0, 0} }\n    if tmp[2] - tmp[1] <= 2 || tmp[1] - tmp[0] <= 2 { return []int{1, tmp[2] - tmp[0] - 2} }\n    return []int{2, tmp[2] - tmp[0] - 2}\n}\n```\n\n>Runtime: 0 ms, faster than 100.00% of Go online submissions for Moving Stones Until Consecutive.\nMemory Usage: 2 MB, less than 66.67% of Go online submissions for Moving Stones Until Consecutive.\n\n```go\nfunc numMovesStones(a int, b int, c int) []int {\n    res := make([]int, 2)\n    tmp := []int{a, b, c}\n    sort.Ints(tmp)\n    if tmp[0] + 1 == tmp[1] && tmp[1] + 1 == tmp[2] {\n        return []int{0, 0}\n    }\n    if tmp[0] + 1 == tmp[1] || tmp[1] + 1 == tmp[2] || tmp[2] - tmp[1] == 2 || tmp[1] - tmp[0] == 2 {\n        res[0] = 1\n    } else {\n        res[0] = 2\n    }\n    res[1] = tmp[2] - tmp[0] - 2\n    return res\n}\n```
[]