ee
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \n\n# Complexity\n- Time 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\nimport java.util.*;\n\nclass Solution {\n\n    public int[] numMovesStones(int a, int b, int c) {\n        int sum = a + b + c;\n        int tempC = Math.max(c, Math.max(a, b));\n        int tempA = Math.min(c, Math.min(a, b));\n        a = tempA;\n        c = tempC;\n        b = sum - a - c;\n\n        int left = b - a - 1;\n        int right = c - b - 1;\n        int max = left + right;\n        int min = 2; // 0,1,2 //   left > 1 && right > 1\n        if (max == 0) {\n            min = 0; // already solved\n        } else if (left <= 1 || right <= 1) {\n            min = 1; // put in middle\n        }\n\n        return new int[]{min, max};\n    }\n\n}\n```
['Java']