Beats 100% | Very Easy Solution
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: O(1)\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity: O(1)\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```cpp []\nclass Solution {\npublic:\n    vector<int> numMovesStones(int a, int b, int c) {\n        int x=min(a,min(b,c));\n        int z=max(a,max(b,c));\n        int y=(a+b+c)-x-z;\n        vector<int>res(2,0);\n\n        if(x+1 == y && y+1 == z) return res;\n        int i=0,j=0;\n        if((z-y) <= 2 || (y-x) <= 2){\n            i=1;\n            j=(z-y)+(y-x)-2;\n            res[0]=i;\n            res[1]=j;\n        }\n        else{\n            i=2;\n            j=(z-y)+(y-x)-2;\n            res[0]=i;\n            res[1]=j;\n        }\n        return res;\n    }\n};\n```
['C++']