Straightforward approach
\n\n# Code\npython3 []\nclass Solution:\n    def numMovesStones(self, a: int, b: int, c: int) -> List[int]:\n        # Sort the input stones\n        lst = sort
\n\n# Code\n```python3 []\nclass Solution:\n    def numMovesStones(self, a: int, b: int, c: int) -> List[int]:\n        # Sort the input stones\n        lst = sorted([a, b, c])\n\n        # Calculate the differences between consecutive stones\n        diff1 = lst[1] - lst[0]\n        diff2 = lst[2] - lst[1]\n\n        # Calculate the maximum moves required\n        max_moves = diff1 + diff2 - 2\n\n        # Determine the minimum moves required\n        if diff1 == 1 and diff2 == 1:\n            min_moves = 0\n        elif diff1 <= 2 or diff2 <= 2:\n            min_moves = 1\n        else:\n            min_moves = 2\n\n        return [min_moves, max_moves]\n```
['Python3']