not like us
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]:
        x=[]
        y=[]
        for i in range(min(a,b,c),max(a,b,c)+1):
            x.append(i)    
        count=0
        l=min(a,b,c)
        r=max(a,b,c)
        p=0
        for i in range(l+1,r):
            if(i==a or i==b or i==c):
                p=i
                break       
        if((len(x)-3)==0):
            y.append(0)
        elif((l+2)<p and (r-2)>p): 
            y.append(2)    
        else:
            y.append(1)    

        y.append(len(x)-3)
        return y

```
['Python3']