leetcode

commit 7d4c4eb05eb2ff3fd292b8afff686516f301ca7f
parent 5c1d264f5468d0bb020c0280135b34c31339ec66
Author: Jack Sangdahl <jack@pngu.org>
Date:   Mon, 13 Apr 2026 20:28:00 -0600

2463. minimum total distance traveled

Diffstat:
M
min_total_distance_traveled.c
 | 
21
++++++++++++---------

1 file changed, 12 insertions(+), 9 deletions(-)
diff --git a/min_total_distance_traveled.c b/min_total_distance_traveled.c
@@ -232,15 +232,18 @@ long long minimumTotalDistance(int *robot, int robotSize, int **factory,
 int main() {
   int r1[] = {0, 4, 6}, f1i[2][2] = {{2, 2}, {6, 2}};
   int r2[] = {1, -1}, f2i[2][2] = {{-2, 1}, {2, 1}};
-  struct two_d_arr *f1 = two_d_arr_init(2, 2, f1i);
-  struct two_d_arr *f2 = two_d_arr_init(2, 2, f2i);
-  printf("%lld\n",
-         minimumTotalDistance(r1, ARRAY_SIZE(r1), f1->arr, f1->row_size,
-                              f1->col_size)); // expect: 4
-
-  printf("%lld\n",
-         minimumTotalDistance(r2, ARRAY_SIZE(r2), f2->arr, f2->row_size,
-                              f2->col_size)); // expect: 2
+  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);
+  long long mtd1 = minimumTotalDistance(r1, ARRAY_SIZE(r1), f1->arr,
+                                        f1->row_size, f1->col_size);
+  long long mtd2 = minimumTotalDistance(r2, ARRAY_SIZE(r2), f2->arr,
+                                        f2->row_size, f2->col_size);
+  printf("%lld\n", mtd1);
+  assert(mtd1 == 4);
+  printf("%lld\n", mtd2);
+  assert(mtd2 == 2);
   two_d_arr_free(f1);
   two_d_arr_free(f2);
 }