【leetcode】移动石子直到连续

int* numMovesStones(int a, int b, int c, int* returnSize){
    int max=a,min=b,mid=c,temp;
    if(a < b)
        max=b,min=a;        
    if (max < c) 
        mid=max,max=c;
    else
    {
        if (min > mid)
        {
            temp = min;
            min = mid;
            mid = temp;
        }
    }
    int* arr=(int*)calloc(2,sizeof(int));
    arr[0] = (max-mid<=1 && mid-min<=1)? 0 : (max-mid<=2 || mid-min<=2)? 1: 2;
    arr[1] = (max-mid-1)+(mid-min-1);
    *returnSize=2;
    return arr;
}