leetcode

Leetcode Solutions (0x6A73)
git clone https://git.pngu.org/leetcode
Log | Files | Refs | Submodules | README

find_min_area_conver_ones1.c (1305B)

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
// 3195. Find the Minimum Area to Cover All Ones I
#include "leetcode.h"

/*
 * you are given a 2d binary array 'grid'. find a rectangle with horizontal and
 * vertical lines with the smallest area, such that all the 1's in 'grid' lie
 * inside this rectangle. return the minimum possible area of the rectangle.
 */

int minimumArea(int **grid, int gridSize, int *gridColSize) {
  int m = gridSize, n = gridColSize[0];
  int min_row = m, max_row = -1;
  int min_col = n, max_col = -1;
  for (int i = 0; i < m; i++)
    for (int j = 0; j < n; j++)
      if (grid[i][j]) {
        if (i < min_row)
          min_row = i;
        if (i > max_row)
          max_row = i;
        if (j < min_col)
          min_col = j;
        if (j > max_col)
          max_col = j;
      }
  return (max_row - min_row + 1) * (max_col - min_col + 1);
}

int main() {
  int g1i[2][3] = {{0, 1, 0}, {1, 0, 1}}, g2i[2][2] = {{1, 0}, {0, 0}};
  struct two_d_arr *g1 =
      two_d_arr_init(ARRAY_SIZE(g1i), ARRAY_SIZE(g1i[0]), g1i);
  struct two_d_arr *g2 =
      two_d_arr_init(ARRAY_SIZE(g2i), ARRAY_SIZE(g2i[0]), g2i);
  printf("%d\n", minimumArea(g1->arr, g1->row_size, g1->col_size)); // expect: 6
  printf("%d\n", minimumArea(g2->arr, g2->row_size, g2->col_size)); // expect: 1
  two_d_arr_free(g1);
  two_d_arr_free(g2);
}