Python solution
\ndef recoverArray(self, nums: List[int]) -> List[int]:\n\tm, cnter = min(nums), Counter(sorted(nums))\n\tfor x in cnter.keys():\n\t\td = x-m\n\t\tif d>0 and d%
```\ndef recoverArray(self, nums: List[int]) -> List[int]:\n\tm, cnter = min(nums), Counter(sorted(nums))\n\tfor x in cnter.keys():\n\t\td = x-m\n\t\tif d>0 and d%2==0:\n\t\t\tcnt, arr = cnter.copy(), []\n\t\t\tfor n, v in cnt.items():\n\t\t\t\tif v:\n\t\t\t\t\tif v<=cnt[n+d]:\n\t\t\t\t\t\tarr.extend([n+d//2]*v)\n\t\t\t\t\t\tcnt[n+d] -= v\n\t\t\t\t\telse:\n\t\t\t\t\t\tbreak\n\t\t\tif len(arr)==len(nums)//2:\n\t\t\t\treturn arr\n```
[]