aboutsummaryrefslogtreecommitdiff
path: root/find_max_num_fruit_collected.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_max_num_fruit_collected.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_max_num_fruit_collected.c')
-rw-r--r--find_max_num_fruit_collected.c17
1 files changed, 9 insertions, 8 deletions
diff --git a/find_max_num_fruit_collected.c b/find_max_num_fruit_collected.c
index c7226e2..282d9ea 100644
--- a/find_max_num_fruit_collected.c
+++ b/find_max_num_fruit_collected.c
@@ -47,13 +47,14 @@ int main() {
int f1i[4][4] = {
{1, 2, 3, 4}, {5, 6, 8, 7}, {9, 10, 11, 12}, {13, 14, 15, 16}};
int f2i[2][2] = {{1, 1}, {1, 1}};
- struct two_d_arr f1, f2;
- two_d_arr_init(&f1, ARRAY_SIZE(f1i), ARRAY_SIZE(f1i[0]), f1i);
- two_d_arr_init(&f2, ARRAY_SIZE(f2i), ARRAY_SIZE(f2i[0]), f2i);
+ struct two_d_arr *f1 =
+ two_d_arr_init(ARRAY_SIZE(f1i), ARRAY_SIZE(f1i[0]), f1i);
+ struct two_d_arr *f2 =
+ two_d_arr_init(ARRAY_SIZE(f2i), ARRAY_SIZE(f2i[0]), f2i);
+ printf("%d\n", maxCollectedFruits(f1->arr, f1->row_size,
+ f1->col_size)); // expect: 100
printf("%d\n",
- maxCollectedFruits(f1.arr, f1.row_size, f1.col_size)); // expect: 100
- printf("%d\n",
- maxCollectedFruits(f2.arr, f2.row_size, f2.col_size)); // expect: 4
- two_d_arr_free(&f1);
- two_d_arr_free(&f2);
+ maxCollectedFruits(f2->arr, f2->row_size, f2->col_size)); // expect: 4
+ two_d_arr_free(f1);
+ two_d_arr_free(f2);
}