nalydmerc/AdventOfCode2023
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Complete Day 9 Part 2

Browse Source
This commit is contained in:
nalydmerc
2023-12-09 23:09:07 -05:00
parent 4b1c47105a
commit f9d24c208c
1 changed files with 28 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

28
09/09.c
View File

@@ -10,6 +10,9 @@
#define NUM_ARR_LEN 300 #define NUM_ARR_LEN 300
#define NUM_DIFFS 300 #define NUM_DIFFS 300
#define REVERSE_ARR 1
bool all_zeroes(int *num_arr, int len) bool all_zeroes(int *num_arr, int len)
{ {
int i = 0; int i = 0;
@@ -37,6 +40,18 @@ int parse_num(char *str)
return isnegative ? -num : num; return isnegative ? -num : num;
} }
void reverse_arr(int *num_arr, int len)
{
int i = 0;
int temp;
for (i = 0; i < (len / 2); i++)
{
temp = num_arr[i];
num_arr[i] = num_arr[len - i - 1];
num_arr[len - i - 1] = temp;
}
}
int parse_nums(char *str, int *num_arr) int parse_nums(char *str, int *num_arr)
{ {
int i = 0; int i = 0;
@@ -48,6 +63,19 @@ int parse_nums(char *str, int *num_arr)
i++; i++;
while (ISDIGIT(*str) || *str == '-') str++; while (ISDIGIT(*str) || *str == '-') str++;
} }
#if (REVERSE_ARR)
int k = 0;
int temp;
for (k = 0; k < (i / 2); k++)
{
temp = num_arr[k];
num_arr[k] = num_arr[i - k - 1];
num_arr[i - k - 1] = temp;
}
#endif
return i; return i;
} }