feat: add kotlin solution to lc problem: No.2132

Author: Zuoqiu-Yingyi

solution/2100-2199/2132.Stamping the Grid/README.md

@@ -51,8 +51,8 @@ tags:
 
 <p><img alt="" src="https://fastly.jsdelivr.net/gh/doocs/leetcode@main/solution/2100-2199/2132.Stamping%20the%20Grid/images/ex2.png" style="width: 170px; height: 179px;"></p>
 
-<pre><b>输入：</b>grid = [[1,0,0,0],[0,1,0,0],[0,0,1,0],[0,0,0,1]], stampHeight = 2, stampWidth = 2 
-<b>输出：</b>false 
+<pre><b>输入：</b>grid = [[1,0,0,0],[0,1,0,0],[0,0,1,0],[0,0,0,1]], stampHeight = 2, stampWidth = 2
+<b>输出：</b>false
 <b>解释：</b>没办法放入邮票覆盖所有的空格子，且邮票不超出网格图以外。
 </pre>
 
@@ -400,6 +400,80 @@ var possibleToStamp = function (grid, stampHeight, stampWidth) {
 };
 ```
 
+#### Kotlin
+
+```kotlin
+class Solution {
+    fun possibleToStamp(grid: Array<IntArray>, stampHeight: Int, stampWidth: Int): Boolean {
+        val m = grid.size
+        val n = grid[0].size
+
+        var prefix_sums_matrix = Array(m + 1) { IntArray(n + 1) }
+        var diff_matrix = Array(m + 1) { IntArray(n + 1) }
+        var sum_matrix = Array(m + 1) { IntArray(n + 1) }
+
+        for (i in 0..<m) {
+            for (j in 0..<n) {
+                prefix_sums_matrix[i + 1][j + 1] =
+                    prefix_sums_matrix[i + 1][j] +
+                    prefix_sums_matrix[i][j + 1] -
+                    prefix_sums_matrix[i][j] +
+                    grid[i][j]
+            }
+        }
+
+        for (i in 0..<m) {
+            for (j in 0..<n) {
+                if (grid[i][j] != 0) {
+                    continue
+                }
+
+                val bottom = i + stampHeight
+                val right = j + stampWidth
+
+                if (bottom > m || right > n) {
+                    continue
+                }
+
+                val sum = prefix_sums_matrix[bottom][right] -
+                    prefix_sums_matrix[bottom][j] -
+                    prefix_sums_matrix[i][right] +
+                    prefix_sums_matrix[i][j]
+
+                if (sum == 0) {
+                    diff_matrix[i][j] += 1
+                    diff_matrix[bottom][right] += 1
+
+                    diff_matrix[i][right] -= 1
+                    diff_matrix[bottom][j] -= 1
+                }
+            }
+        }
+
+        for (i in 0..<m) {
+            for (j in 0..<n) {
+                if (grid[i][j] != 0) {
+                    continue
+                }
+
+                val sum = sum_matrix[i][j + 1] +
+                    sum_matrix[i + 1][j] -
+                    sum_matrix[i][j] +
+                    diff_matrix[i][j]
+
+                if (sum == 0) {
+                    return false
+                }
+
+                sum_matrix[i + 1][j + 1] = sum
+            }
+        }
+
+        return true
+    }
+}
+```
+
 <!-- tabs:end -->
 
 <!-- solution:end -->

solution/2100-2199/2132.Stamping the Grid/README_EN.md

@@ -48,8 +48,8 @@ tags:
 <p><strong class="example">Example 2:</strong></p>
 <img alt="" src="https://fastly.jsdelivr.net/gh/doocs/leetcode@main/solution/2100-2199/2132.Stamping%20the%20Grid/images/ex2.png" style="width: 170px; height: 179px;" />
 <pre>
-<strong>Input:</strong> grid = [[1,0,0,0],[0,1,0,0],[0,0,1,0],[0,0,0,1]], stampHeight = 2, stampWidth = 2 
-<strong>Output:</strong> false 
+<strong>Input:</strong> grid = [[1,0,0,0],[0,1,0,0],[0,0,1,0],[0,0,0,1]], stampHeight = 2, stampWidth = 2
+<strong>Output:</strong> false
 <strong>Explanation:</strong> There is no way to fit the stamps onto all the empty cells without the stamps going outside the grid.
 </pre>
 
@@ -396,6 +396,80 @@ var possibleToStamp = function (grid, stampHeight, stampWidth) {
 };
 ```
 
+#### Kotlin
+
+```kotlin
+class Solution {
+    fun possibleToStamp(grid: Array<IntArray>, stampHeight: Int, stampWidth: Int): Boolean {
+        val m = grid.size
+        val n = grid[0].size
+
+        var prefix_sums_matrix = Array(m + 1) { IntArray(n + 1) }
+        var diff_matrix = Array(m + 1) { IntArray(n + 1) }
+        var sum_matrix = Array(m + 1) { IntArray(n + 1) }
+
+        for (i in 0..<m) {
+            for (j in 0..<n) {
+                prefix_sums_matrix[i + 1][j + 1] =
+                    prefix_sums_matrix[i + 1][j] +
+                    prefix_sums_matrix[i][j + 1] -
+                    prefix_sums_matrix[i][j] +
+                    grid[i][j]
+            }
+        }
+
+        for (i in 0..<m) {
+            for (j in 0..<n) {
+                if (grid[i][j] != 0) {
+                    continue
+                }
+
+                val bottom = i + stampHeight
+                val right = j + stampWidth
+
+                if (bottom > m || right > n) {
+                    continue
+                }
+
+                val sum = prefix_sums_matrix[bottom][right] -
+                    prefix_sums_matrix[bottom][j] -
+                    prefix_sums_matrix[i][right] +
+                    prefix_sums_matrix[i][j]
+
+                if (sum == 0) {
+                    diff_matrix[i][j] += 1
+                    diff_matrix[bottom][right] += 1
+
+                    diff_matrix[i][right] -= 1
+                    diff_matrix[bottom][j] -= 1
+                }
+            }
+        }
+
+        for (i in 0..<m) {
+            for (j in 0..<n) {
+                if (grid[i][j] != 0) {
+                    continue
+                }
+
+                val sum = sum_matrix[i][j + 1] +
+                    sum_matrix[i + 1][j] -
+                    sum_matrix[i][j] +
+                    diff_matrix[i][j]
+
+                if (sum == 0) {
+                    return false
+                }
+
+                sum_matrix[i + 1][j + 1] = sum
+            }
+        }
+
+        return true
+    }
+}
+```
+
 <!-- tabs:end -->
 
 <!-- solution:end -->

solution/2100-2199/2132.Stamping the Grid/Solution.kt

@@ -0,0 +1,69 @@
+class Solution {
+    fun possibleToStamp(grid: Array<IntArray>, stampHeight: Int, stampWidth: Int): Boolean {
+        val m = grid.size
+        val n = grid[0].size
+
+        var prefix_sums_matrix = Array(m + 1) { IntArray(n + 1) }
+        var diff_matrix = Array(m + 1) { IntArray(n + 1) }
+        var sum_matrix = Array(m + 1) { IntArray(n + 1) }
+
+        for (i in 0..<m) {
+            for (j in 0..<n) {
+                prefix_sums_matrix[i + 1][j + 1] =
+                    prefix_sums_matrix[i + 1][j] +
+                    prefix_sums_matrix[i][j + 1] -
+                    prefix_sums_matrix[i][j] +
+                    grid[i][j]
+            }
+        }
+
+        for (i in 0..<m) {
+            for (j in 0..<n) {
+                if (grid[i][j] != 0) {
+                    continue
+                }
+
+                val bottom = i + stampHeight
+                val right = j + stampWidth
+
+                if (bottom > m || right > n) {
+                    continue
+                }
+
+                val sum = prefix_sums_matrix[bottom][right] -
+                    prefix_sums_matrix[bottom][j] -
+                    prefix_sums_matrix[i][right] +
+                    prefix_sums_matrix[i][j]
+
+                if (sum == 0) {
+                    diff_matrix[i][j] += 1
+                    diff_matrix[bottom][right] += 1
+
+                    diff_matrix[i][right] -= 1
+                    diff_matrix[bottom][j] -= 1
+                }
+            }
+        }
+
+        for (i in 0..<m) {
+            for (j in 0..<n) {
+                if (grid[i][j] != 0) {
+                    continue
+                }
+
+                val sum = sum_matrix[i][j + 1] +
+                    sum_matrix[i + 1][j] -
+                    sum_matrix[i][j] +
+                    diff_matrix[i][j]
+
+                if (sum == 0) {
+                    return false
+                }
+
+                sum_matrix[i + 1][j + 1] = sum
+            }
+        }
+
+        return true
+    }
+}