aboutsummaryrefslogtreecommitdiff
path: root/largest_divisible_subset.c
diff options
context:
space:
mode:
Diffstat (limited to 'largest_divisible_subset.c')
-rw-r--r--largest_divisible_subset.c28
1 files changed, 14 insertions, 14 deletions
diff --git a/largest_divisible_subset.c b/largest_divisible_subset.c
index f540528..6d36c45 100644
--- a/largest_divisible_subset.c
+++ b/largest_divisible_subset.c
@@ -10,14 +10,14 @@
int cmp(const void *a, const void *b) { return *(int *)a - *(int *)b; }
-int *largestDivisibleSubset(int *nums, int nums_size, int *return_size) {
- qsort(nums, nums_size, sizeof(int), cmp);
- int *idx = malloc(nums_size * sizeof(int));
- int *cnt = malloc(nums_size * sizeof(int));
+int *largestDivisibleSubset(int *nums, int numsSize, int *returnSize) {
+ qsort(nums, numsSize, sizeof(int), cmp);
+ int *idx = (int *)malloc(numsSize * sizeof(int));
+ int *cnt = (int *)malloc(numsSize * sizeof(int));
int max = 1, max_idx = 0, tmp;
idx[0] = -1;
cnt[0] = 1;
- for (int i = 1; i < nums_size; i++) {
+ for (int i = 1; i < numsSize; i++) {
idx[i] = -1;
cnt[i] = 1;
for (int j = i - 1; j >= 0; j--)
@@ -33,25 +33,25 @@ int *largestDivisibleSubset(int *nums, int nums_size, int *return_size) {
max_idx = i;
}
}
- *return_size = max;
- int *ans = malloc(max * sizeof(int));
+ *returnSize = max;
+ int *ans = (int *)malloc(max * sizeof(int));
for (int i = max - 1; i >= 0; i--) {
ans[i] = nums[max_idx];
max_idx = idx[max_idx];
}
- free(idx), free(cnt);
+ free(idx);
+ free(cnt);
return ans;
}
int main() {
- int n1[] = {1, 2, 3}, n2[] = {1, 2, 4, 8};
- int rs1[] = {}, rs2[] = {};
- int *lds1 = largestDivisibleSubset(n1, ARRAY_SIZE(n1), rs1);
- int *lds2 = largestDivisibleSubset(n2, ARRAY_SIZE(n2), rs2);
- for (int i = 0; i < 2; i++)
+ int n1[] = {1, 2, 3}, n2[] = {1, 2, 4, 8}, rs1, rs2;
+ int *lds1 = largestDivisibleSubset(n1, ARRAY_SIZE(n1), &rs1);
+ int *lds2 = largestDivisibleSubset(n2, ARRAY_SIZE(n2), &rs2);
+ for (int i = 0; i < rs1; i++)
printf("%d ", lds1[i]); // expect: 1 2
printf("\n");
- for (int i = 0; i < 4; i++)
+ for (int i = 0; i < rs2; i++)
printf("%d ", lds2[i]); // expect: 1 2 4 8
printf("\n");
free(lds1), free(lds2);