feat: add solutions to lc problem: No.0361

No.0361.Bomb Enemy

Author: yanglbme

solution/0300-0399/0361.Bomb Enemy/README.md

@@ -56,15 +56,220 @@
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```python
-
+class Solution:
+    def maxKilledEnemies(self, grid: List[List[str]]) -> int:
+        m, n = len(grid), len(grid[0])
+        g = [[0] * n for _ in range(m)]
+        for i in range(m):
+            t = 0
+            for j in range(n):
+                if grid[i][j] == 'W':
+                    t = 0
+                elif grid[i][j] == 'E':
+                    t += 1
+                g[i][j] += t
+            t = 0
+            for j in range(n - 1, -1, -1):
+                if grid[i][j] == 'W':
+                    t = 0
+                elif grid[i][j] == 'E':
+                    t += 1
+                g[i][j] += t
+        for j in range(n):
+            t = 0
+            for i in range(m):
+                if grid[i][j] == 'W':
+                    t = 0
+                elif grid[i][j] == 'E':
+                    t += 1
+                g[i][j] += t
+            t = 0
+            for i in range(m - 1, -1, -1):
+                if grid[i][j] == 'W':
+                    t = 0
+                elif grid[i][j] == 'E':
+                    t += 1
+                g[i][j] += t
+        return max([g[i][j] for i in range(m) for j in range(n) if grid[i][j] == '0'], default=0)
 ```
 
 ### **Java**
 
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```java
+class Solution {
+    public int maxKilledEnemies(char[][] grid) {
+        int m = grid.length;
+        int n = grid[0].length;
+        int[][] g = new int[m][n];
+        for (int i = 0; i < m; ++i) {
+            int t = 0;
+            for (int j = 0; j < n; ++j) {
+                if (grid[i][j] == 'W') {
+                    t = 0;
+                } else if (grid[i][j] == 'E') {
+                    ++t;
+                }
+                g[i][j] += t;
+            }
+            t = 0;
+            for (int j = n - 1; j >= 0; --j) {
+                if (grid[i][j] == 'W') {
+                    t = 0;
+                } else if (grid[i][j] == 'E') {
+                    ++t;
+                }
+                g[i][j] += t;
+            }
+        }
+        for (int j = 0; j < n; ++j) {
+            int t = 0;
+            for (int i = 0; i < m; ++i) {
+                if (grid[i][j] == 'W') {
+                    t = 0;
+                } else if (grid[i][j] == 'E') {
+                    ++t;
+                }
+                g[i][j] += t;
+            }
+            t = 0;
+            for (int i = m - 1; i >= 0; --i) {
+                if (grid[i][j] == 'W') {
+                    t = 0;
+                } else if (grid[i][j] == 'E') {
+                    ++t;
+                }
+                g[i][j] += t;
+            }
+        }
+        int ans = 0;
+        for (int i = 0; i < m; ++i) {
+            for (int j = 0; j < n; ++j) {
+                if (grid[i][j] == '0') {
+                    ans = Math.max(ans, g[i][j]);
+                }
+            }
+        }
+        return ans;
+    }
+}
+```
+
+### **C++**
+
+```cpp
+class Solution {
+public:
+    int maxKilledEnemies(vector<vector<char>>& grid) {
+        int m = grid.size(), n = grid[0].size();
+        vector<vector<int>> g(m, vector<int>(n));
+        for (int i = 0; i < m; ++i)
+        {
+            int t = 0;
+            for (int j = 0; j < n; ++j)
+            {
+                if (grid[i][j] == 'W') t = 0;
+                else if (grid[i][j] == 'E') ++t;
+                g[i][j] += t;
+            }
+            t = 0;
+            for (int j = n - 1; j >= 0; --j)
+            {
+                if (grid[i][j] == 'W') t = 0;
+                else if (grid[i][j] == 'E') ++t;
+                g[i][j] += t;
+            }
+        }
+        for (int j = 0; j < n; ++j)
+        {
+            int t = 0;
+            for (int i = 0; i < m; ++i)
+            {
+                if (grid[i][j] == 'W') t = 0;
+                else if (grid[i][j] == 'E') ++t;
+                g[i][j] += t;
+            }
+            t = 0;
+            for (int i = m - 1; i >= 0; --i)
+            {
+                if (grid[i][j] == 'W') t = 0;
+                else if (grid[i][j] == 'E') ++t;
+                g[i][j] += t;
+            }
+        }
+        int ans = 0;
+        for (int i = 0; i < m; ++i)
+        {
+            for (int j = 0; j < n; ++j)
+            {
+                if (grid[i][j] == '0') ans = max(ans, g[i][j]);
+            }
+        }
+        return ans;
+    }
+};
+```
+
+### **Go**
 
+```go
+func maxKilledEnemies(grid [][]byte) int {
+	m, n := len(grid), len(grid[0])
+	g := make([][]int, m)
+	for i := range g {
+		g[i] = make([]int, n)
+	}
+	for i := 0; i < m; i++ {
+		t := 0
+		for j := 0; j < n; j++ {
+			if grid[i][j] == 'W' {
+				t = 0
+			} else if grid[i][j] == 'E' {
+				t++
+			}
+			g[i][j] += t
+		}
+		t = 0
+		for j := n - 1; j >= 0; j-- {
+			if grid[i][j] == 'W' {
+				t = 0
+			} else if grid[i][j] == 'E' {
+				t++
+			}
+			g[i][j] += t
+		}
+	}
+	for j := 0; j < n; j++ {
+		t := 0
+		for i := 0; i < m; i++ {
+			if grid[i][j] == 'W' {
+				t = 0
+			} else if grid[i][j] == 'E' {
+				t++
+			}
+			g[i][j] += t
+		}
+		t = 0
+		for i := m - 1; i >= 0; i-- {
+			if grid[i][j] == 'W' {
+				t = 0
+			} else if grid[i][j] == 'E' {
+				t++
+			}
+			g[i][j] += t
+		}
+	}
+	ans := 0
+	for i, row := range grid {
+		for j, v := range row {
+			if v == '0' && ans < g[i][j] {
+				ans = g[i][j]
+			}
+		}
+	}
+	return ans
+}
 ```
 
 ### **...**