leetcode-59-旋转矩阵II-C语言

void set(int **arr, int m, int n, int x, int y, int index, int dere){
    int tmp;
    
    if(x<0 || x>=m || y<0 || y>=n || arr[x][y]){
        return;
    }
    
    arr[x][y] = index++;

    if(dere == 0){ /* 向右移动 */
        set(arr, m, n, x, y+1, index, 0);/* 向右移动，向右优先 */
        set(arr, m, n, x+1, y, index, 1);/* 向右移动，向下次之 */
        set(arr, m, n, x, y-1, index, 2);/* 向右移动，向左次之 */
        set(arr, m, n, x-1, y, index, 3);/* 向右移动，向上最后 */     
    }else if(dere == 1){/* 向下移动 */
        set(arr, m, n, x+1, y, index, 1);/* 向下移动，向下优先 */
        set(arr, m, n, x, y-1, index, 2);
        set(arr, m, n, x-1, y, index, 3);       
        set(arr, m, n, x, y+1, index, 0);
    }else if(dere == 2){/* 向左移动 */
        set(arr, m, n, x, y-1, index, 2);
        set(arr, m, n, x-1, y, index, 3);       
        set(arr, m, n, x, y+1, index, 0);    
        set(arr, m, n, x+1, y, index, 1);
    }else{/* 向右上移动 */
        set(arr, m, n, x-1, y,  index, 3);       
        set(arr, m, n, x, y+1, index, 0);    
        set(arr, m, n, x+1, y,  index, 1);
        set(arr, m, n, x, y-1, index, 2);
    }

    
}

int** generateMatrix(int n, int* returnSize, int** returnColumnSizes){
    int i, j;
    int **ret = (int **)malloc(sizeof(int *) * n);
    int *rcs = (int *)malloc(sizeof(int) * n);
    
    for(i=0; i=m || y<0 || y>=n || arr[x][y]){
        return;
    }
    
    arr[x][y] = index++;

    for(i=dere; i