Python O(1) time and space complexity
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \n\n# Complexity\n- Time 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```python3 []\nclass Solution:\n    def numMovesStones(self, a: int, b: int, c: int) -> List[int]:\n        arr =[0]*2\n        mi = min(a,b,c)\n        ma = max(a,b,c)\n        mid = 0\n        if ma == a:\n            mid = max(b,c)\n        elif ma == b:\n            mid = max(a,c)\n        elif ma == c:\n            mid = max(a,b)\n        if mid-mi<=2 or ma-mid <= 2:\n            arr[0]=1\n        else:\n            arr[0] = 2\n        miMa = ma-mid\n        miMd = mid-mi\n        arr[1] = miMa+miMd-2\n        if (miMa == 1 and miMd == 1):\n            arr[0] = 0\n        \n        return arr\n        \n```
['Python3']