easy approach
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```\nclass Solution {\npublic:\n    vector<int> numMovesStones(int a, int b, int c) {\n        vector<int> ans;\n        int z=max(a,max(b,c));\n        int x=min(a,min(b,c));\n        int y=a+b+c-x-z;\n        int d1=abs(x-y)-1;\n        int d2= abs(z-y)-1;\n        if(d1==0&&d2==0){\n            ans.push_back(0);\n        }\n    else if (d1 <= 1 || d2 <= 1) {\n            ans.push_back(1);\n        } else {\n            ans.push_back(2);\n        }\n        ans.push_back(d1+d2);\n        return ans;\n    }\n};\n```
['C++']