leetcode

0 static const auto _ = []() {

1 std::ios_base::sync_with_stdio(false);

2 std::cout.tie(nullptr);

3 std::cin.tie(nullptr);

4 return true;

5 }();

6

7 class Solution {

8 public:

9 int minimumArea(const vector<vector<int>> &grid) const {

10 int minix = INT_MAX, maxix = INT_MIN;

11 int miniy = INT_MAX, maxiy = INT_MIN;

12

13 for (int i = 0; i < size(grid); i++) {

14 for (int j = 0; j < size(grid[0]); j++) {

15 if (!grid[i][j]) continue;

16 minix = min(minix, i);

17 maxix = max(maxix, i);

18 miniy = min(miniy, j);

19 maxiy = max(maxiy, j);

20 }

21 }

22

23 return (maxix - minix + 1) * (maxiy - miniy + 1);

24 }

25 };