| | | 1 | | // -------------------------------------------------------------------------------- |
| | | 2 | | // Copyright (C) 2025 Eugene Eremeev (also known as Yevhenii Yeriemeieiv). |
| | | 3 | | // All Rights Reserved. |
| | | 4 | | // -------------------------------------------------------------------------------- |
| | | 5 | | // This software is the confidential and proprietary information of Eugene Eremeev |
| | | 6 | | // (also known as Yevhenii Yeriemeieiv) ("Confidential Information"). You shall not |
| | | 7 | | // disclose such Confidential Information and shall use it only in accordance with |
| | | 8 | | // the terms of the license agreement you entered into with Eugene Eremeev (also |
| | | 9 | | // known as Yevhenii Yeriemeieiv). |
| | | 10 | | // -------------------------------------------------------------------------------- |
| | | 11 | | |
| | | 12 | | namespace LeetCode.Algorithms.FindAllGroupOfFarmland; |
| | | 13 | | |
| | | 14 | | /// <inheritdoc /> |
| | | 15 | | public class FindAllGroupOfFarmlandIterative : IFindAllGroupOfFarmland |
| | | 16 | | { |
| | | 17 | | /// <summary> |
| | | 18 | | /// Time complexity - O(m * n) |
| | | 19 | | /// Space complexity - O(k), where k is the number of distinct rectangles found |
| | | 20 | | /// </summary> |
| | | 21 | | /// <param name="land"></param> |
| | | 22 | | /// <returns></returns> |
| | | 23 | | public int[][] FindFarmland(int[][] land) |
| | 6 | 24 | | { |
| | 6 | 25 | | var result = new List<int[]>(); |
| | | 26 | | |
| | 42 | 27 | | for (var i = 0; i < land.Length; i++) |
| | 15 | 28 | | { |
| | 124 | 29 | | for (var j = 0; j < land[0].Length; j++) |
| | 47 | 30 | | { |
| | 47 | 31 | | if (land[i][j] == 1) |
| | 6 | 32 | | { |
| | 6 | 33 | | result.Add(FindFarmlandCorner(land, i, j)); |
| | 6 | 34 | | } |
| | 47 | 35 | | } |
| | 15 | 36 | | } |
| | | 37 | | |
| | 6 | 38 | | return [.. result]; |
| | 6 | 39 | | } |
| | | 40 | | |
| | | 41 | | private static int[] FindFarmlandCorner(IReadOnlyList<int[]> land, int x, int y) |
| | 6 | 42 | | { |
| | 6 | 43 | | var dx = x; |
| | 6 | 44 | | var dy = y; |
| | | 45 | | |
| | 11 | 46 | | while (dx < land.Count - 1 && land[dx + 1][dy] == 1) |
| | 5 | 47 | | { |
| | 5 | 48 | | dx++; |
| | 5 | 49 | | } |
| | | 50 | | |
| | 11 | 51 | | while (dy < land[0].Length - 1 && land[dx][dy + 1] == 1) |
| | 5 | 52 | | { |
| | 5 | 53 | | dy++; |
| | 5 | 54 | | } |
| | | 55 | | |
| | 34 | 56 | | for (var i = x; i <= dx; i++) |
| | 11 | 57 | | { |
| | 66 | 58 | | for (var j = y; j <= dy; j++) |
| | 22 | 59 | | { |
| | 22 | 60 | | land[i][j] = 0; |
| | 22 | 61 | | } |
| | 11 | 62 | | } |
| | | 63 | | |
| | 6 | 64 | | return [x, y, dx, dy]; |
| | 6 | 65 | | } |
| | | 66 | | } |