simple python solution
IntuitionApproachComplexity
Time complexity:

Space complexity:
Code
# Intuition
<!-- Describe your first thoughts on how to solve this problem. -->

# Approach
<!-- Describe your approach to solving the problem. -->

# Complexity
- Time complexity:
<!-- Add your time complexity here, e.g. $$O(n)$$ -->

- Space complexity:
<!-- Add your space complexity here, e.g. $$O(n)$$ -->

# Code
```python3 []
class Solution:
    def numMovesStones(self, a: int, b: int, c: int) -> List[int]:
        arr = sorted([a, b, c])
        a,b,c = arr
        res = []
        if b - a == 1 and c - b == 1:
            res.append(0)
        elif b - a <= 2 or c - b <= 2:
            res.append(1)
        else:
            res.append(2)
        v1 = b - a + (c - b) - 2
        res.append(v1)

        return res
```
['Python3']