Python simple clean
\nclass Solution:\n    def numMovesStones(self, a: int, b: int, c: int) -> List[int]:\n        \n        a,b,c = sorted((a,b,c))\n        \n        dif1 = b-a-1
```\nclass Solution:\n    def numMovesStones(self, a: int, b: int, c: int) -> List[int]:\n        \n        a,b,c = sorted((a,b,c))\n        \n        dif1 = b-a-1\n        dif2 = c-b-1\n        \n        if dif1 == 0 and dif2 == 0:\n            mini = 0\n        \n        elif dif1 == 0 or dif2 == 0 or dif1 == 1 or dif2 == 1:\n            mini = 1\n        \n        else:\n            mini = 2\n            \n        return [mini, dif1+dif2]\n```
['Python']