Sync LeetCode submission Runtime - 114 ms (90.97%), Memory - 45.5 MB (60.45%)

Author: jimit105

0361-bomb-enemy/README.md

@@ -0,0 +1,28 @@
+<p>Given an <code>m x n</code> matrix <code>grid</code> where each cell is either a wall <code>&#39;W&#39;</code>, an enemy <code>&#39;E&#39;</code> or empty <code>&#39;0&#39;</code>, return <em>the maximum enemies you can kill using one bomb</em>. You can only place the bomb in an empty cell.</p>
+
+<p>The bomb kills all the enemies in the same row and column from the planted point until it hits the wall since it is too strong to be destroyed.</p>
+
+<p>&nbsp;</p>
+<p><strong class="example">Example 1:</strong></p>
+<img alt="" src="https://assets.leetcode.com/uploads/2021/03/27/bomb1-grid.jpg" style="width: 600px; height: 187px;" />
+<pre>
+<strong>Input:</strong> grid = [[&quot;0&quot;,&quot;E&quot;,&quot;0&quot;,&quot;0&quot;],[&quot;E&quot;,&quot;0&quot;,&quot;W&quot;,&quot;E&quot;],[&quot;0&quot;,&quot;E&quot;,&quot;0&quot;,&quot;0&quot;]]
+<strong>Output:</strong> 3
+</pre>
+
+<p><strong class="example">Example 2:</strong></p>
+<img alt="" src="https://assets.leetcode.com/uploads/2021/03/27/bomb2-grid.jpg" style="width: 500px; height: 194px;" />
+<pre>
+<strong>Input:</strong> grid = [[&quot;W&quot;,&quot;W&quot;,&quot;W&quot;],[&quot;0&quot;,&quot;0&quot;,&quot;0&quot;],[&quot;E&quot;,&quot;E&quot;,&quot;E&quot;]]
+<strong>Output:</strong> 1
+</pre>
+
+<p>&nbsp;</p>
+<p><strong>Constraints:</strong></p>
+
+<ul>
+	<li><code>m == grid.length</code></li>
+	<li><code>n == grid[i].length</code></li>
+	<li><code>1 &lt;= m, n &lt;= 500</code></li>
+	<li><code>grid[i][j]</code> is either <code>&#39;W&#39;</code>, <code>&#39;E&#39;</code>, or <code>&#39;0&#39;</code>.</li>
+</ul>

0361-bomb-enemy/solution.py

@@ -0,0 +1,38 @@
+class Solution:
+    def maxKilledEnemies(self, grid: List[List[str]]) -> int:
+        if len(grid) == 0:
+            return 0
+
+        rows, cols = len(grid), len(grid[0])
+
+        max_count = 0
+        row_hits = 0
+        col_hits = [0] * cols
+
+        for row in range(0, rows):
+            for col in range(0, cols):
+                # reset the hits on the row, if necessary.
+                if col == 0 or grid[row][col - 1] == 'W':
+                    row_hits = 0
+                    for k in range(col, cols):
+                        if grid[row][k] == 'W':
+                            # stop the scan when we hit the wall.
+                            break
+                        elif grid[row][k] == 'E':
+                            row_hits += 1
+
+                # reset the hits on the col, if necessary.
+                if row == 0 or grid[row - 1][col] == 'W':
+                    col_hits[col] = 0
+                    for k in range(row, rows):
+                        if grid[k][col] == 'W':
+                            break
+                        elif grid[k][col] == 'E':
+                            col_hits[col] += 1
+
+                # count the hits for each empty cell.
+                if grid[row][col] == '0':
+                    total_hits = row_hits + col_hits[col]
+                    max_count = max(max_count, total_hits)
+
+        return max_count