Golang simple brute force solution
go\nfunc recoverArray(nums []int) []int {\n\tsort.Ints(nums)\n\tfor pairIndex0 := 1; pairIndex0 < len(nums); pairIndex0++ {\n\t\tif (nums[pairIndex0]-nums[0])%2
```go\nfunc recoverArray(nums []int) []int {\n\tsort.Ints(nums)\n\tfor pairIndex0 := 1; pairIndex0 < len(nums); pairIndex0++ {\n\t\tif (nums[pairIndex0]-nums[0])%2 != 0 {\n\t\t\tcontinue\n\t\t}\n\t\tk := (nums[pairIndex0] - nums[0]) / 2\n\t\tif k == 0 {\n\t\t\tcontinue\n\t\t}\n\t\tpairs := make(map[int]int, len(nums))\n\t\toriginal := make([]int, 0, len(nums)/2)\n\t\tfor _, v := range nums {\n\t\t\tif pairs[v] > 0 {\n\t\t\t\tpairs[v]--\n\t\t\t} else {\n\t\t\t\tpairs[v+k+k]++\n\t\t\t\toriginal = append(original, v+k)\n\t\t\t}\n\t\t}\n\t\tok := true\n\t\tfor _, v := range pairs {\n\t\t\tif v != 0 {\n\t\t\t\tok = false\n\t\t\t\tbreak\n\t\t\t}\n\t\t}\n\t\tif ok {\n\t\t\treturn original\n\t\t}\n\t}\n\treturn nil\n}\n```
['Go']