Time: 71 ms (93.43%), Space: 23.7 MB (78.08%) - LeetHub

Author: knockcat

1277-count-square-submatrices-with-all-ones/1277-count-square-submatrices-with-all-ones.cpp

@@ -0,0 +1,22 @@
+class Solution {
+public:
+    int countSquares(vector<vector<int>>& matrix) {
+        
+        int count = 0;
+        int n = matrix.size(), m = matrix[0].size();
+        
+        for(int i = 0; i<n; ++i)
+        {
+            for(int j = 0; j<m; ++j)
+            {
+                if(i > 0 and j > 0 and matrix[i][j] > 0)
+                {
+                    matrix[i][j] = min({matrix[i-1][j-1],matrix[i-1][j], matrix[i][j-1]}) + 1;   
+                }
+                count += matrix[i][j];
+            }
+        }
+        return count;
+    }
+};
+