Simple Java Solution -- 1ms
\nclass Solution {\n    public int[] numMovesStones(int a, int b, int c) {\n        int max = Math.max(a, Math.max(b, c));\n        int min = Math.min(a, Math.m
```\nclass Solution {\n    public int[] numMovesStones(int a, int b, int c) {\n        int max = Math.max(a, Math.max(b, c));\n        int min = Math.min(a, Math.min(b, c));\n        int mid = a + b + c - max - min;\n        int less = 0, more = 0;\n        if(max - mid == 2 || mid - min == 2) less = 1;\n        else {\n            less += max - mid > 1 ? 1 : 0;\n            less += mid - min > 1 ? 1 : 0;\n        }\n        more = max - min - 2;\n        return new int[]{less, more};\n    }\n}\n```
[]