Java Solution - Simple Approach.
\nclass Solution {\n    public int[] numMovesStones(int a, int b, int c) {\n        int[] result = new int[2];\n        int[] arr = {a,b,c};\n        Arrays.sor
```\nclass Solution {\n    public int[] numMovesStones(int a, int b, int c) {\n        int[] result = new int[2];\n        int[] arr = {a,b,c};\n        Arrays.sort(arr);\n        if(arr[0]+1 == arr[1] && arr[1]+1 == arr[2])\n        {\n            result[0] = 0;\n            result[1] = 0;\n            return result;\n        }\n        else if(arr[0]+1 == arr[1] || arr[1]+1 == arr[2])\n        {\n            result[0] = 1;\n            result[1] = (arr[2]-arr[1]) + (arr[1]-arr[0]) -2;\n            return result;\n        }\n        else if(arr[0]+2 == arr[1] || arr[1]+2 == arr[2])\n        {\n            result[0] = 1;\n            result[1] = (arr[2]-arr[1]) + (arr[1]-arr[0]) -2;\n            return result;\n        }\n        else \n        {\n            result[0] = 2;\n            result[1] = (arr[2]-arr[1]) + (arr[1]-arr[0]) -2;\n            return result;\n        }\n    }\n}\n```
[]