O(1) Faster than 100%
\nclass Solution {\n    public int[] numMovesStones(int a, int b, int c) {\n        int[] m = new int[] {a, b, c};\n        Arrays.sort(m);\n        int left = 
```\nclass Solution {\n    public int[] numMovesStones(int a, int b, int c) {\n        int[] m = new int[] {a, b, c};\n        Arrays.sort(m);\n        int left = m[1] - m[0] - 1;\n        int right = m[2] - m[1] - 1;\n        return new int[] {\n\t\t    //      cases:    XX___X                X___XX              X_X_X\n            Math.min((left > 0 ? 1 : 0) + (right > 0 ? 1 : 0), (left == 1 || right == 1 ? 1 : 2)), \n            left + right};   // X___________X___________X\n    }\n}\n```
[]