力扣------01 矩阵

在这里插入图片描述

/**
 * Return an array of arrays of size *returnSize.
 * The sizes of the arrays are returned as *returnColumnSizes array.
 * Note: Both returned array and *columnSizes array must be malloced, assume caller calls free().
 */
 int min(int a,int b,int c,int d){
     int e;
     e=a;
     if(e>b){
         e=b;
     }
     if(e>c){
         e=c;
     }
     if(e>d){
         e=d;
     }
     return e;
 }
int** updateMatrix(int** mat, int matSize, int* matColSize, int* returnSize, int** returnColumnSizes){
    *returnSize=matSize;
    *returnColumnSizes=matColSize;
    int **dis = (int**)malloc(sizeof(int*) * matSize);  //sizeof(int*),不能少*,一个指针的内存大小,每个元素是一个指针。
    for (int i = 0;i < matSize;i++)
    {
        dis[i] = (int*)malloc(sizeof(int) * matColSize[0]);
    }
    for(int a=0;a<matSize;a++){
        for(int b=0;b<matColSize[0];b++){
            dis[a][b]=10000;
        }
    }   
    for(int a=0;a<matSize;a++){
        for(int b=0;b<matColSize[0];b++){
            if(mat[a][b]==0){
                dis[a][b]=0;
            }
            else{
                if(a-1==-1&&a+1==matSize&&b-1==-1){
                    dis[a][b]=min(10000,10000,10000,dis[a][b+1])+1;
                }
                else if(a-1==-1&&a+1==matSize&&b+1==matColSize[0]){
                    dis[a][b]=min(10000,10000,dis[a][b-1],10000)+1;
                }           
                else if(a-1==-1&&a+1==matSize){
                    dis[a][b]=min(10000,10000,dis[a][b-1],dis[a][b+1])+1;
                }  
                else if(b-1==-1&&b+1==matColSize[0]&&a+1==matSize){
                    dis[a][b]=min(dis[a-1][b],10000,10000,10000)+1;
                }
                else if(b-1==-1&&b+1==matColSize[0]&&a-1==-1){
                    dis[a][b]=min(10000,dis[a+1][b],10000,10000)+1;
                }
                else if(b-1==-1&&b+1==matColSize[0]){
                    dis[a][b]=min(dis[a-1][b],dis[a+1][b],10000,10000)+1;
                }
                else if(a-1==-1&&b-1==-1){
                    dis[a][b]=min(10000,dis[a+1][b],10000,dis[a][b+1])+1;
                }
                else if(a-1==-1&&b+1==matColSize[0]){
                    dis[a][b]=min(10000,dis[a+1][b],dis[a][b-1],10000)+1;
                }
                else if(a+1==matSize&&b-1==-1){
                    dis[a][b]=min(dis[a-1][b],10000,10000,dis[a][b+1])+1;
                }
                else if(a+1==matSize&&b+1==matColSize[0]){
                    dis[a][b]=min(dis[a-1][b],10000,dis[a][b-1],10000)+1;
                }
                else if(a-1==-1){
                    dis[a][b]=min(10000,dis[a+1][b],dis[a][b-1],dis[a][b+1])+1;
                }
                else if(a+1==matSize){
                    dis[a][b]=min(dis[a-1][b],10000,dis[a][b-1],dis[a][b+1])+1;
                }
                else if(b-1==-1){
                    dis[a][b]=min(dis[a-1][b],dis[a+1][b],10000,dis[a][b+1])+1;
                }
                else if(b+1==matColSize[0]){
                    dis[a][b]=min(dis[a-1][b],dis[a+1][b],dis[a][b-1],10000)+1;
                }
                else{
                    dis[a][b]=min(dis[a-1][b],dis[a+1][b],dis[a][b-1],dis[a][b+1])+1;
                }
            }
        }
    }
    for(int a=matSize-1;a>=0;a--){
        for(int b=matColSize[0]-1;b>=0;b--){
            if(mat[a][b]==0){
                dis[a][b]=0;
            }
            else{
                if(a-1==-1&&a+1==matSize&&b-1==-1){
                    dis[a][b]=min(10000,10000,10000,dis[a][b+1])+1;
                }
                else if(a-1==-1&&a+1==matSize&&b+1==matColSize[0]){
                    dis[a][b]=min(10000,10000,dis[a][b-1],10000)+1;
                }           
                else if(a-1==-1&&a+1==matSize){
                    dis[a][b]=min(10000,10000,dis[a][b-1],dis[a][b+1])+1;
                }  
                else if(b-1==-1&&b+1==matColSize[0]&&a+1==matSize){
                    dis[a][b]=min(dis[a-1][b],10000,10000,10000)+1;
                }
                else if(b-1==-1&&b+1==matColSize[0]&&a-1==-1){
                    dis[a][b]=min(10000,dis[a+1][b],10000,10000)+1;
                }
                else if(b-1==-1&&b+1==matColSize[0]){
                    dis[a][b]=min(dis[a-1][b],dis[a+1][b],10000,10000)+1;
                }
                else if(a-1==-1&&b-1==-1){
                    dis[a][b]=min(10000,dis[a+1][b],10000,dis[a][b+1])+1;
                }
                else if(a-1==-1&&b+1==matColSize[0]){
                    dis[a][b]=min(10000,dis[a+1][b],dis[a][b-1],10000)+1;
                }
                else if(a+1==matSize&&b-1==-1){
                    dis[a][b]=min(dis[a-1][b],10000,10000,dis[a][b+1])+1;
                }
                else if(a+1==matSize&&b+1==matColSize[0]){
                    dis[a][b]=min(dis[a-1][b],10000,dis[a][b-1],10000)+1;
                }
                else if(a-1==-1){
                    dis[a][b]=min(10000,dis[a+1][b],dis[a][b-1],dis[a][b+1])+1;
                }
                else if(a+1==matSize){
                    dis[a][b]=min(dis[a-1][b],10000,dis[a][b-1],dis[a][b+1])+1;
                }
                else if(b-1==-1){
                    dis[a][b]=min(dis[a-1][b],dis[a+1][b],10000,dis[a][b+1])+1;
                }
                else if(b+1==matColSize[0]){
                    dis[a][b]=min(dis[a-1][b],dis[a+1][b],dis[a][b-1],10000)+1;
                }
                else{
                    dis[a][b]=min(dis[a-1][b],dis[a+1][b],dis[a][b-1],dis[a][b+1])+1;
                }
            }
        }
    }
    return dis;
}
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值