Leetcode | Find All Groups of Farmland | Java

devstromo · devstromo · commit adf269f2de07 · 2025-04-18T23:00:15.000-03:00
diff --git a/leetcode/src/main/java/com/devstromo/medium/p1992/Solution.java b/leetcode/src/main/java/com/devstromo/medium/p1992/Solution.java
@@ -27,6 +27,33 @@ public int[][] findFarmland(int[][] land) {
         return result.toArray(new int[result.size()][]);
     }
 
+    public int[][] findFarmlandBest(int[][] land) {
+        if (land.length == 0 || land[0].length == 0) {
+            return new int[][]{
+                    {0}
+            };
+        }
+        int row = land.length;
+        int col = land[0].length;
+
+        List<int[]> rectangles = new ArrayList<>();
+        for (int currRow = 0; currRow < row; ++currRow) {
+            for (int currCol = 0; currCol < col; ++currCol) {
+                if (land[currRow][currCol] == 1) {
+                    int x = currRow;
+                    int y = currCol;
+                    for (x = currRow; x < row && land[x][currCol] == 1; ++x) {
+                        for (y = currCol; y < col && land[x][y] == 1; ++y) {
+                            land[x][y] = 0;
+                        }
+                    }
+                    rectangles.add(new int[]{currRow, currCol, x - 1, y - 1});
+                }
+            }
+        }
+        return rectangles.toArray(new int[rectangles.size()][]);
+    }
+
     private void dfs(int[][] land, int r, int c, int[] bounds) {
         int m = land.length, n = land[0].length;
         // Base case: out of bounds or not farmland
diff --git a/leetcode/src/test/java/com/devstromo/medium/p1992/SolutionUnitTest.java b/leetcode/src/test/java/com/devstromo/medium/p1992/SolutionUnitTest.java
@@ -39,4 +39,34 @@ void testFindAllGroupsOfFarmland() {
         );
     }
 
+    @Test
+    @DisplayName("Test  Find All Groups of Farmland Best")
+    void testFindAllGroupsOfFarmlandBest() {
+        assertArrayEquals(
+                new int[][]{
+                        {0, 0, 0, 0},
+                        {1, 1, 2, 2},
+                },
+                solution.findFarmlandBest(new int[][]{
+                        {1, 0, 0},
+                        {0, 1, 1},
+                        {0, 1, 1}
+                })
+        );
+        assertArrayEquals(
+                new int[][]{
+                        {0, 0, 1, 1}
+                },
+                solution.findFarmlandBest(new int[][]{
+                        {1, 1},
+                        {1, 1}
+                })
+        );
+        assertArrayEquals(
+                new int[][]{
+                        {0}
+                },
+                solution.findFarmlandBest(new int[][]{})
+        );
+    }
 }
