
public static int maxKilledEnemies(char[][] A){
if (A==null || A.length ==0 ||A[0].length ==0 ){
return 0;
}
int m = A.length;
int n = A[0].length;
int [][]up = new int[m][n];
int [][]down = new int[m][n];
int [][]left = new int[m][n];
int [][]right = new int[m][n];
//up
for (int i = 0; i < m; i++) {
for (int j = 0; j < n; j++) {
if (A[i][j]=='W'){
up[i][j] = 0;
continue;
}
up[i][j] = A[i][j]=='E'?1:0;
if (i>0){
up[i][j] += up[i-1][j];
}
}
}
//down
for (int i = m-1; i >=0; i--) {
for (int j = 0; j < n; j++) {
if (A[i][j]=='W'){
down[i][j] = 0;
continue;
}
down[i][j] = A[i][j]=='E'?1:0;//i==m-1的边界
if (i<m-1){
down[i][j] += down[i+1][j];
}
}
}
//left
for (int i = 0; i < m; i++) {
for (int j = 0; j < n; j++) {
if (A[i][j]=='W'){
left[i][j] = 0;
continue;
}
left[i][j] = A[i][j]=='E'?1:0;
if (j>0){
left[i][j] += left[i][j-1];
}
}
}
//right
for (int i = 0; i < m; i++) {
for (int j = n-1; j>=0; j--) {
if (A[i][j]=='W'){
up[i][j] = 0;
continue;
}
right[i][j] = A[i][j]=='E'?1:0;
if (j<n-1){
right[i][j] += right[i][j+1];
}
}
}
int res = 0;
for (int i = 0; i < m; i++) {
for (int j = 0; j < n; j++) {
if (A[i][j] == '0') {
int t = up[i][j] + left[i][j] + right[i][j] + down[i][j];
res = Math.max(t, res);
}
}
}
return res;
}
评论
登录后参与技术讨论,分享你的经验与见解。
登录 / 注册暂无评论