| | | 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.CountSquareSubmatricesWithAllOnes; |
| | | 13 | | |
| | | 14 | | /// <inheritdoc /> |
| | | 15 | | public class CountSquareSubmatricesWithAllOnesDynamicProgramming : ICountSquareSubmatricesWithAllOnes |
| | | 16 | | { |
| | | 17 | | /// <summary> |
| | | 18 | | /// Time complexity - O(m * n) |
| | | 19 | | /// Space complexity - O(1) |
| | | 20 | | /// </summary> |
| | | 21 | | /// <param name="matrix"></param> |
| | | 22 | | /// <returns></returns> |
| | | 23 | | public int CountSquares(int[][] matrix) |
| | 2 | 24 | | { |
| | 2 | 25 | | var m = matrix.Length; |
| | 2 | 26 | | var n = matrix[0].Length; |
| | | 27 | | |
| | 2 | 28 | | var count = 0; |
| | | 29 | | |
| | 16 | 30 | | for (var i = 0; i < m; i++) |
| | 6 | 31 | | { |
| | 6 | 32 | | count += matrix[i][0]; |
| | 6 | 33 | | } |
| | | 34 | | |
| | 14 | 35 | | for (var j = 1; j < n; j++) |
| | 5 | 36 | | { |
| | 5 | 37 | | count += matrix[0][j]; |
| | 5 | 38 | | } |
| | | 39 | | |
| | 12 | 40 | | for (var i = 1; i < m; i++) |
| | 4 | 41 | | { |
| | 28 | 42 | | for (var j = 1; j < n; j++) |
| | 10 | 43 | | { |
| | 10 | 44 | | if (matrix[i][j] != 1) |
| | 2 | 45 | | { |
| | 2 | 46 | | continue; |
| | | 47 | | } |
| | | 48 | | |
| | 8 | 49 | | matrix[i][j] = Math.Min(matrix[i - 1][j - 1], Math.Min(matrix[i - 1][j], matrix[i][j - 1])) + 1; |
| | | 50 | | |
| | 8 | 51 | | count += matrix[i][j]; |
| | 8 | 52 | | } |
| | 4 | 53 | | } |
| | | 54 | | |
| | 2 | 55 | | return count; |
| | 2 | 56 | | } |
| | | 57 | | } |