theoludwig/programming-challenges
1
1
Fork 0
mirror of https://github.com/theoludwig/programming-challenges.git synced 2025-05-18 12:02:53 +02:00
Code Issues Releases Activity

fix(solutions): memory issues thanks to -fsanitize=address flag with gcc

Browse Source
This commit is contained in:
Théo LUDWIG
2023-08-10 11:13:06 +02:00
parent 3b6cc97bb5
commit 0245c7a12c
96 changed files with 712 additions and 453 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
challenges/prime-numbers-decomposition/solutions/c/function/solution.c
View File

@ -28,8 +28,10 @@ int* get_dividers_list(int number, int* dividers_length) {
bool is_prime_number(int number) {
int dividers_length;
get_dividers_list(number, &dividers_length);
return dividers_length == 2;
int* dividers_list = get_dividers_list(number, &dividers_length);
bool result = dividers_length == 2;
free(dividers_list);
return result;
}
int sum_multiply_numbers(int* numbers, int numbers_length) {