Java Clean Solution
\nclass Solution {\n    public int[] numMovesStones(int a, int b, int c) {\n        int[] nums = {a, b, c};\n        Arrays.sort(nums);\n        int maxCount = 
```\nclass Solution {\n    public int[] numMovesStones(int a, int b, int c) {\n        int[] nums = {a, b, c};\n        Arrays.sort(nums);\n        int maxCount = nums[2] - nums[0] - 2;\n        int minCount = 2;\n        if (nums[2] - nums[1] < 3 || nums[1] - nums[0] < 3) minCount = 1;\n        if (nums[2] - nums[1] == 1 && nums[1] - nums[0] == 1) minCount = 0;\n        return new int[] { minCount, maxCount };\n    }\n}\n```
[]