clear python beats 100%
\nclass Solution:\n    def numMovesStones(self, a: int, b: int, c: int) -> List[int]:\n        arr = [a,b,c]\n        arr.sort()\n        \n        min_tot, max
```\nclass Solution:\n    def numMovesStones(self, a: int, b: int, c: int) -> List[int]:\n        arr = [a,b,c]\n        arr.sort()\n        \n        min_tot, max_tot = 0, 0\n        if arr[1] - arr[0] == 2 or arr[2] - arr[1] == 2:\n            min_tot = 1\n        else:\n            min1 = 1 if (arr[1] - arr[0]) >2 else 0\n            min2 = 1 if (arr[2] - arr[1]) >2 else 0\n            min_tot = min1 + min2\n        \n        max1 = arr[1] - arr[0] - 1\n        max2 = arr[2] - arr[1] - 1\n        max_tot = max1 + max2\n        \n        return [min_tot, max_tot]\n        \n```
[]