aboutsummaryrefslogtreecommitdiff
path: root/find_min_area_conver_ones2.c
diff options
context:
space:
mode:
authorJack Sangdahl <[email protected]>2025-08-27 12:45:33 -0600
committerJack Sangdahl <[email protected]>2025-08-27 12:45:33 -0600
commit4552bcf5a4a356415e248dee3b201f0cea7205bb (patch)
tree9868465918c6a6841b84cd14d66923b993dd9d62 /find_min_area_conver_ones2.c
parentf549305fb5ca531d29dce6c2c091560f44190443 (diff)
downloadleetcode-4552bcf5a4a356415e248dee3b201f0cea7205bb.tar.gz
leetcode-4552bcf5a4a356415e248dee3b201f0cea7205bb.zip
chore: Refactor two_d_arr_init function
Return a pointer to a new struct, rather than initialise objects in an existing struct
Diffstat (limited to 'find_min_area_conver_ones2.c')
-rw-r--r--find_min_area_conver_ones2.c15
1 files changed, 8 insertions, 7 deletions
diff --git a/find_min_area_conver_ones2.c b/find_min_area_conver_ones2.c
index 503820c..363210e 100644
--- a/find_min_area_conver_ones2.c
+++ b/find_min_area_conver_ones2.c
@@ -74,11 +74,12 @@ int minimumSum(int **grid, int gridSize, int *gridColSize) {
int main() {
int g1i[2][3] = {{1, 0, 1}, {1, 1, 1}},
g2i[2][4] = {{1, 0, 1, 0}, {0, 1, 0, 1}};
- struct two_d_arr g1, g2;
- two_d_arr_init(&g1, ARRAY_SIZE(g1i), ARRAY_SIZE(g1i[0]), g1i);
- two_d_arr_init(&g2, ARRAY_SIZE(g2i), ARRAY_SIZE(g2i[0]), g2i);
- printf("%d\n", minimumSum(g1.arr, g1.row_size, g1.col_size)); // expect: 5
- printf("%d\n", minimumSum(g2.arr, g2.row_size, g2.col_size)); // expect: 5
- two_d_arr_free(&g1);
- two_d_arr_free(&g2);
+ 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", minimumSum(g1->arr, g1->row_size, g1->col_size)); // expect: 5
+ printf("%d\n", minimumSum(g2->arr, g2->row_size, g2->col_size)); // expect: 5
+ two_d_arr_free(g1);
+ two_d_arr_free(g2);
}