[Java] Straightforward Greedy O(1) Solution
\nclass Solution {\n    public int[] numMovesStones(int a, int b, int c) {\n        int[] p = {a, b, c};\n        int min = -1;\n        int max = -1;\n        
```\nclass Solution {\n    public int[] numMovesStones(int a, int b, int c) {\n        int[] p = {a, b, c};\n        int min = -1;\n        int max = -1;\n        Arrays.sort(p);\n        if (p[0] + 1 == p[1] && p[1] + 1 == p[2]) {\n            min = 0;\n        }\n        else if (p[0] + 1 == p[1] || p[1] + 1 == p[2]) {\n            min = 1;\n        }\n        else if (p[0] + 2 == p[1] || p[1] + 2 == p[2]) {\n            min = 1;\n        }\n        else {\n            min = 2;\n        }\n        max = p[2] - p[0] - 2;\n        return new int[]{min, max};\n    }\n}\n```
[]