C solution
```\nint numMovesStones(int a, int b, int c, int returnSize){\nint max,min,median;\n    \n   a>b?(max=a):(max=b);\nmax>c?(max=max):(max=c);\na>b?(min=b):(min=a)
```\nint* numMovesStones(int a, int b, int c, int* returnSize){\nint max,min,median;\n    \n   a>b?(max=a):(max=b);\nmax>c?(max=max):(max=c);\na>b?(min=b):(min=a);\nmin>c?(min=c):(min=min);\n    median=a+b+c-min-max;\nint *arr=malloc(2*sizeof(int));\n  *returnSize=2;\n     arr[1]=max-min-2;\n    \n                \n  if(median-min==1&&max-median==1) \n         arr[0]=0;\nelse if(median-min==1&&max-median>1) \n        arr[0]=1;\n  else  if(median-min>1&&max-median==1) \n        arr[0]=1;\n    \n  else if(median-min==2||max-median==2)\n          arr[0]=1;\n   else\n        arr[0]=2;\n                \n     return (arr);\n \n }\n \n \n    \n  \n
[]