361. 轰炸敌人（暴力枚举 / dp ）-CSDN博客

本文链接：https://blog.csdn.net/qq_43765535/article/details/111084182

在这里插入图片描述

暴力枚举

        // [["W","W","W","W","E"],
        //  ["W","E","E","E","E"],
        //  ["W","E","0","E","0"],
        //  ["W","E","E","E","E"],
        //  ["W","W","W","W","W"]]

遍历，找到 0 的位置然后遍历同行 and 同列 E 的个数，直到墙 W 停下

AC Code

class Solution {
    public int maxKilledEnemies(char[][] g) {
        if(g == null || g.length == 0) return 0;
        int row = g.length, col = g[0].length;
        int ans = 0;
        for(int i = 0; i < row; i++){
            for(int j = 0; j < col; j++){
                // 暴力枚举
                if(g[i][j] == '0'){
                    int mx = 0;
                    // 四个方向枚举
                    int a = i + 1, b = i - 1, c = j + 1, d = j - 1;
                    while(a < row && g[a][j] != 'W') { if(g[a][j] == 'E') mx++; a++; }
                    while(b >= 0 && g[b][j] != 'W') { if(g[b][j] == 'E') mx++; b--; }
                    while(c < col && g[i][c] != 'W') { if(g[i][c] == 'E') mx++; c++; }
                    while(d >= 0 && g[i][d] != 'W') { if(g[i][d] == 'E') mx++; d--; } 

                    ans = Math.max(mx, ans);
                }
            }
        }

        return ans;
    }
}