算法的重要性,我就不多说了吧,想去大厂,就必须要经过基础知识和业务逻辑面试+算法面试。所以,为了提高大家的算法能力,这个公众号后续每天带大家做一道算法题,题目就从LeetCode上面选 !
今天和大家聊的问题叫做 轰炸敌人,我们先来看题面:
https://leetcode-cn.com/problems/bomb-enemy/
Given a 2D grid, each cell is either a wall ‘W’, an enemy ‘E’ or empty ‘0’ (the number zero), return the maximum enemies you can kill using one bomb.
The bomb kills all the enemies in the same row and column from the planted point until it hits the wall since the wall is too strong to be destroyed.
Note: You can only put the bomb at an empty cell.
给你一个二维的网格图,网格图中的每一个格子里要么是一堵墙 'W' ,要么是一个敌人 'E' ,要么是一个空位 '0' (数字 0 ),返回你用一个炸弹最多能杀死敌人的数量。
由于墙体足够坚硬,炸弹的威慑力没有办法穿越墙体,所以炸弹只能把所在位置同一行和同一列所有没被墙挡住的敌人给炸死。
注意:你只能把炸弹放在一个空的格子里
示例
输入: [["0","E","0","0"],["E","0","W","E"],["0","E","0","0"]]
输出: 3
解释: 对于如下网格图,
0 E 0 0
E 0 W E
0 E 0 0
在位置 (1,1) 放置炸弹可以杀死 3 个敌人。
解题
https://www.acwing.com/solution/content/16060/
主要思路:
预处理出每个点四个方向上能炸到的人数,下面以预处理左边能炸到的人数举例
对于某一行,从左往右扫描,遇到墙则炸到的人数等于0,遇到敌人则等于左边相邻位置炸到的人数加1,若为空则等于左边相邻位置炸到的人数
注意只能在空的地方放置炸弹,所以我们遍历每一个空点将四个方向上能炸到的人数相加,取最大值就是答案 。
class Solution {
public:
/**
* @param grid: Given a 2D grid, each cell is either 'W', 'E' or '0'
* @return: an integer, the maximum enemies you can kill using one bomb
*/
int maxKilledEnemies(vector<vector<char>> &grid) {
if (grid.size() == 0) return 0;
int n = grid.size();
int m = grid[0].size();
int left[n + 1][m + 1], right[n + 1][m + 1], up[n + 1][m + 1], down[n + 1][m + 1];
memset(left, 0, sizeof(left));
memset(right, 0, sizeof(right));
memset(up, 0, sizeof(up));
memset(down, 0, sizeof(down));
// left
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
if (grid[i][j] == 'W') {
left[i][j] = 0;
continue;
}
left[i][j] = grid[i][j] == 'E' ? 1 : 0;
if (j > 0) left[i][j] += left[i][j - 1];
}
}
// right
for (int i = 0; i < n; i++) {
for (int j = m - 1; j >= 0; j--) {
if (grid[i][j] == 'W') {
right[i][j] = 0;
continue;
}
right[i][j] = grid[i][j] == 'E' ? 1 : 0;
if (j < m - 1) right[i][j] += right[i][j + 1];
}
}
// up
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
if (grid[i][j] == 'W') {
up[i][j] = 0;
continue;
}
up[i][j] = grid[i][j] == 'E' ? 1 : 0;
if (i > 0) up[i][j] += up[i - 1][j];
}
}
// down
for (int i = n - 1; i >= 0; i--) {
for (int j = 0; j < m; j++) {
if (grid[i][j] == 'W') {
down[i][j] = 0;
continue;
}
down[i][j] = grid[i][j] == 'E' ? 1 : 0;
if (i < n - 1) down[i][j] += down[i + 1][j];
}
}
int res = 0;
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
if(grid[i][j] == '0') {
res = max(res, left[i][j] + right[i][j] + up[i][j] + down[i][j]);
}
}
}
return res;
}
};
好了,今天的文章就到这里,如果觉得有所收获,请顺手点个在看或者转发吧,你们的支持是我最大的动力 。
上期推文: