We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent 35b6e6a commit 5d071d1Copy full SHA for 5d071d1
dsa-solutions/lc-solutions/0300-0399/0302-smallest-rectangle-enclosing-black-pixels.md
@@ -33,13 +33,14 @@ Output: 1
33
### Constraints
34
- m == image.length
35
- n == image[i].length
36
-- 1 <= m, n <= 100
+- 1 <= m, n <= 100
37
- image[i][j] is either '0' or '1'.
38
-- 0 <= x < m
39
-- 0 <= y < n
+- 0 <= x < m
+- 0 <= y < n
40
- image[x][y] == '1'
41
- The black pixels in the image only form one component.
42
-- At most 104 calls will be made to `add` and `find`.
+- At most 10^4 calls will be made to `add` and `find`.
43
+
44
45
## Solution
46
0 commit comments