Python, O(1)
Simulate and enumerate.\n3 cases for minimum move: 0,1,2\n1 case for maximum move: high - low - 2.\n\nclass Solution:\n    def numMovesStones(self, a: int, b: i
Simulate and enumerate.\n3 cases for minimum move: 0,1,2\n1 case for maximum move: high - low - 2.\n```\nclass Solution:\n    def numMovesStones(self, a: int, b: int, c: int) -> List[int]:\n        A = [a,b,c]\n        A.sort()\n        # x..x....x\n        a,b,c = A\n        if b-a == c-b == 1:\n            return [0,0]\n        hi = c - a - 2\n        if b-a > 2 and c-b > 2:\n            lo = 2\n        else:\n            lo = 1\n            \n        return [lo, hi]\n```
[]