0 ms, faster than 100.00% of Java
\nclass Solution {\n    public int[] numMovesStones(int a, int b, int c) {\n        int left = -1;\n        int mid = -1;\n        int right = -1;\n        \n  
```\nclass Solution {\n    public int[] numMovesStones(int a, int b, int c) {\n        int left = -1;\n        int mid = -1;\n        int right = -1;\n        \n        if(a < b && a < c) {\n            left = a;\n            mid = b < c ? b : c;\n            right = b != mid ? b : c;\n        } else if(b < a && b < c) {\n            left = b;\n            mid = a < c ? a : c;\n            right = a != mid ? a : c;\n        } else {\n            left = c;\n            mid = a < b ? a : b;\n            right = a != mid ? a : b;\n        }\n                \n        int diff1 = (right - mid - 1);\n        int diff2 = (mid - left - 1);\n        \n        int min;\n        \n        if(diff1 == 0 && diff2 == 0) {\n            min = 0;\n        } else if(diff1 == 0 && diff2 != 0 ||\n                 diff1 != 0 && diff2 == 0 || diff1 == 1 || diff2 == 1) {\n            min = 1;\n        } else {\n            min = 2;\n        }\n        return new int[]{min, diff1 + diff2};\n    }\n}\n```
[]