Python special solution with explanation
\nclass Solution:\n    def numMovesStones(self, *args) -> List[int]:\n        a,b,c=sorted(args)\n        d=min(b-a,c-b)-1\n        M=c-a-2\n        m = (d>1)+(
```\nclass Solution:\n    def numMovesStones(self, *args) -> List[int]:\n        a,b,c=sorted(args)\n        d=min(b-a,c-b)-1\n        M=c-a-2\n        m = (d>1)+(M!=0)\n        return m,M\n```\n\nAt first, modify the parameter a,b,c to \\*args\nIt\'ll make the input trans into a list.\nThen we can make the parameter sorted simply (line 1)\nFind the minimum distance (line 2) for the stones,\nAnd the Maximum move times (line 3 , trans from (c-b-1)+(b-a-1) )\nLine 4 is born from the following judgement :\n0 if d==M==0\nelse 1 if d==1\nelse 2
['Python3']