Java Solution 100% faster
\nclass Solution {\n    public int[] numMovesStones(int a, int b, int c) {\n        int[] range=new int[2];\n        int max=a<b?(b<c?c:b):(a<c?c:a);\n        i
```\nclass Solution {\n    public int[] numMovesStones(int a, int b, int c) {\n        int[] range=new int[2];\n        int max=a<b?(b<c?c:b):(a<c?c:a);\n        int min=a<b?(a<c?a:c):(b<c?b:c);\n        int mid=(a!=max && a!=min)?a:(b!=max && b!=min)?b:c;\n        \n        if(max-min>2){\n            range[0]=(Math.abs(mid-max)>2 && Math.abs(mid-min)>2)?2:1;\n            range[1]=max-min-2;\n        }\n        else{\n            range[0]=0;\n            range[1]=0;\n        }\n        \n        return range;\n        \n    }\n}\n```
[]