[Python] Simple position difference - Time O(1)
\n\nclass Solution:\n    def numMovesStones(self, a: int, b: int, c: int) -> List[int]:\n        [a,b,c] = sorted([a,b,c])\n        if b-a == c-b == 1:\n       
\n```\nclass Solution:\n    def numMovesStones(self, a: int, b: int, c: int) -> List[int]:\n        [a,b,c] = sorted([a,b,c])\n        if b-a == c-b == 1:\n            return [0, 0]\n            \n        mn = 1 if abs(a-b) in [1, 2] or abs(b-c) in [1,2] else 2\n        mx = abs(b-a)-1+abs(c-b)-1\n        return [mn, mx]\n```
[]