diff options
Diffstat (limited to 'k_closest_points_origin.c')
-rw-r--r-- | k_closest_points_origin.c | 15 |
1 files changed, 8 insertions, 7 deletions
diff --git a/k_closest_points_origin.c b/k_closest_points_origin.c index b0c2a51..c8b5693 100644 --- a/k_closest_points_origin.c +++ b/k_closest_points_origin.c @@ -88,12 +88,13 @@ int **kClosest(int **points, int pointsSize, int *pointsColSize, int k, int main() { int p1i[2][2] = {{1, 3}, {-2, 2}}, p2i[3][2] = {{3, 3}, {5, -1}, {-2, 4}}; - struct two_d_arr p1, p2; - two_d_arr_init(&p1, ARRAY_SIZE(p1i), ARRAY_SIZE(p1i[0]), p1i); - two_d_arr_init(&p2, ARRAY_SIZE(p2i), ARRAY_SIZE(p2i[0]), p2i); + struct two_d_arr *p1 = + two_d_arr_init(ARRAY_SIZE(p1i), ARRAY_SIZE(p1i[0]), p1i); + struct two_d_arr *p2 = + two_d_arr_init(ARRAY_SIZE(p2i), ARRAY_SIZE(p2i[0]), p2i); int rs1, rs2, *rcs1, *rcs2; - int **kc1 = kClosest(p1.arr, p1.row_size, p1.col_size, 1, &rs1, &rcs1); - int **kc2 = kClosest(p2.arr, p2.row_size, p2.col_size, 2, &rs2, &rcs2); + int **kc1 = kClosest(p1->arr, p1->row_size, p1->col_size, 1, &rs1, &rcs1); + int **kc2 = kClosest(p2->arr, p2->row_size, p2->col_size, 2, &rs2, &rcs2); for (int i = 0; i < rs1; i++) { for (int j = 0; j < rcs1[i]; j++) printf("%d ", kc1[i][j]); // expect: [[-2,2]] @@ -110,10 +111,10 @@ int main() { free(kc1); free(kc1); free(rcs1); - two_d_arr_free(&p1); + two_d_arr_free(p1); for (int i = 0; i < rs2; i++) free(kc2); free(kc2); free(rcs2); - two_d_arr_free(&p2); + two_d_arr_free(p2); } |