leetcode-361-轰炸敌人-C语言

最新推荐文章于 2022-05-07 21:40:00 发布

weixin_36094222

最新推荐文章于 2022-05-07 21:40:00 发布

阅读量990

点赞数

分类专栏： LeetCode

本文链接：https://blog.csdn.net/weixin_36094222/article/details/90609917

版权

LeetCode 专栏收录该内容

251 篇文章 10 订阅

订阅专栏

int maxKilledEnemies(char** grid, int gridSize, int* gridColSize){
    int m = gridSize, n = gridColSize[0];
    int i, j, row, col;
    int tmp = 0;
    int max = 0;
    
    if(!grid || !gridSize || !gridColSize[0]) return 0;
    
    for(i=0; i<m; i++){
        for(j=0; j<n; j++){
            if(grid[i][j] != '0') continue;
            
            tmp = 0;        
            for(row = i;row>=0; row--){
                if(grid[row][j] == 'W'){
                    break;
                }else if(grid[row][j] =='E'){
                    tmp++;
                }
            }
            for(row = i+1;row<m; row++){
                if(grid[row][j] == 'W'){
                    break;
                }else if(grid[row][j] =='E'){
                    tmp++;
                }
            }
            for(col=j; col>=0; col--){
                if(grid[i][col] == 'W'){
                    break;
                }else if(grid[i][col] =='E'){
                    tmp++;
                }                
            }
            for(col=j+1; col<n; col++){
                if(grid[i][col] == 'W'){
                    break;
                }else if(grid[i][col] =='E'){
                    tmp++;
                }                
            }
            if(tmp > max)
                max = tmp;
        }
    }
    
    return max;   
}