Simple Maths Solutoins
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```cpp []\nclass Solution {\npublic:\n    vector<int> numMovesStones(int a, int b, int c) {\n        vector<int> temp = {a,b,c};\n        sort(temp.begin(),temp.end());\n        if(temp[2] - temp[0] == 2){\n            return {0,0};\n        }\n        if(temp[1] - temp[0] == 1){\n            int minmoves = 1;\n            int maxmoves = temp[2] - temp[1] - 1;\n            return {minmoves,maxmoves};\n        }\n        if(temp[2] - temp[1] == 1){\n            int minmoves = 1;\n            int maxmoves = temp[1] - temp[0] - 1;\n            return {minmoves,maxmoves};\n        }\n        int minmoves = 2;\n        if(temp[2] - temp[1] == 2 || temp[1] - temp[0] == 2){\n            minmoves = 1;\n        }\n        int maxmoves = temp[2] - temp[1] - 1;\n        maxmoves += (temp[1] - temp[0] - 1);\n        return {minmoves,maxmoves};\n    }\n};\n```
['C++']