aboutsummaryrefslogtreecommitdiff
path: root/most_profitable_path_tree.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 /most_profitable_path_tree.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 'most_profitable_path_tree.c')
-rw-r--r--most_profitable_path_tree.c15
1 files changed, 8 insertions, 7 deletions
diff --git a/most_profitable_path_tree.c b/most_profitable_path_tree.c
index 458a21d..b433e18 100644
--- a/most_profitable_path_tree.c
+++ b/most_profitable_path_tree.c
@@ -101,13 +101,14 @@ int mostProfitablePath(int **edges, int edgesSize, int *edgesColSize, int bob,
int main() {
int e1i[4][2] = {{0, 1}, {1, 2}, {1, 3}, {3, 4}}, a1[] = {-2, 4, 2, -4, 6};
int e2i[1][2] = {{0, 1}}, a2[] = {-7280, 2350};
- struct two_d_arr e1, e2;
- two_d_arr_init(&e1, ARRAY_SIZE(e1i), ARRAY_SIZE(e1i[0]), e1i);
- two_d_arr_init(&e2, ARRAY_SIZE(e2i), ARRAY_SIZE(e2i[0]), e2i);
- printf("%d\n", mostProfitablePath(e1.arr, e1.row_size, e1.col_size, 3, a1,
+ struct two_d_arr *e1 =
+ two_d_arr_init(ARRAY_SIZE(e1i), ARRAY_SIZE(e1i[0]), e1i);
+ struct two_d_arr *e2 =
+ two_d_arr_init(ARRAY_SIZE(e2i), ARRAY_SIZE(e2i[0]), e2i);
+ printf("%d\n", mostProfitablePath(e1->arr, e1->row_size, e1->col_size, 3, a1,
ARRAY_SIZE(a1))); // expect: 6
- printf("%d\n", mostProfitablePath(e2.arr, e2.row_size, e2.col_size, 1, a2,
+ printf("%d\n", mostProfitablePath(e2->arr, e2->row_size, e2->col_size, 1, a2,
ARRAY_SIZE(a2))); // expect: -7280
- two_d_arr_free(&e1);
- two_d_arr_free(&e2);
+ two_d_arr_free(e1);
+ two_d_arr_free(e2);
}