Simple Python solution with thinking process
Sort a, b, c.\nStrategy to get the maximum number of moves: move a to b and c to a step-by-step, so max_moves = b - a - 1 + c - b - 1.\nStrategy to get the mini
Sort a, b, c.\nStrategy to get the maximum number of moves: move a to b and c to a step-by-step, so max_moves = b - a - 1 + c - b - 1.\nStrategy to get the minimum number of moves: two greedy choices: (i) move a to b - 1 if allowed, and move c to b + 1 is allowed, (ii) if b == a + 2, move c to a + 1, or if c == b + 2, move a to b + 1.\n```\n    def numMovesStones(self, a: int, b: int, c: int) -> List[int]:\n        a, b, c = sorted([a, b, c])\n        min_moves = (1 if b - a - 1 > 0 else 0) + (1 if c - b - 1 > 0 else 0)\n        if b - a == 2 or c - b == 2:\n            min_moves = 1\n        max_moves = b - a - 1 + c - b - 1\n        return [min_moves, max_moves]\n```
[]