Easiest Intuitive sol: O(1) ,100% Time and Space /Easy to Understand
NO VECTOR / SORTING / COMPLICATED CODE.\n\n\n1.  i,j,k  correspondingly gets the highest, lowest and middle element.\n2. Now, use the old variables a and b for 
NO VECTOR / SORTING / COMPLICATED CODE.\n\n\n1.  i,j,k  correspondingly gets the highest, lowest and middle element.\n2. Now, use the old variables a and b for max and min moves correspondingly. \n3. Check if there is only 1 gap between the corrresponding elements then max move is to put the third element in between. So,a=1.\n4. Else check if they are corresponding elements, then min move is 0 .\n5. If neither then a=1.\n6. For,b check only if corresponding then 0 moves else difference -1 moves.\n\n\n```\nclass Solution {\npublic:\n    vector<int> numMovesStones(int a, int b, int c) {\n        int i=max(a,max(b,c));\n        int j=min(a,min(b,c));\n        int k=(a>j && a<i)?a:(b>j && b<i)?b:c;\n        if((k-j==2) || (i-k==2)) a=1;\n        else{\n            a=(j+1==k)?0:1;\n            a+=(k+1==i)?0:1;\n        }\n        b=(j+1==k)?0:(k-j-1);\n        b+=(k+1==i)?0:(i-k-1);\n        return {a,b};\n    }\n};\n```
['C']