1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
|
#include "aoc.h"
#include <math.h>
namespace aoc2018 {
void deduct(char** pp1, char** pp2, char* b, char* e) {
char* p1 = *pp1;
char* p2 = *pp2;
while (p1 >= b && p2 < e) {
bool stop = true;
if (std::abs(*p1 - *p2) == 32) {
*p1 = ' ';
*p2 = ' ';
p1--;
p2++;
stop = false;
}
if (*p1 == ' ') {
p1--;
stop = false;
}
if (*p2 == ' ') {
p2++;
stop = false;
}
if (stop) {
break;
}
}
*pp1 = p1;
*pp2 = p2;
}
int count(line_view lv) {
int total{0};
auto is_az = [](char c) { return c >= 'a' && c <= 'z'; };
auto is_AZ = [](char c) { return c >= 'A' && c <= 'Z'; };
per_char(lv, [&total, &is_az, &is_AZ](char c) {
if (is_az(c) || is_AZ(c)) {
total += 1;
}
return true;
});
return total;
}
void deduct(char* p1, char* p2) {
char* p = p1;
while (p < p2) {
if (std::abs(*p - *(p + 1)) == 32) {
char* pa = p;
char* pb = p + 1;
deduct(&pa, &pb, p1, p2);
p = pb;
} else if (*p == ' ') {
char* pa = p - 1;
while (*p == ' ')
p++;
char* pb = p;
deduct(&pa, &pb, p1, p2);
p = pb;
} else {
p++;
}
}
}
void remove(char* p1, char* p2, char c) {
while (p1 < p2) {
if (*p1 == c || *p1 == c - 32) {
*p1 = ' ';
}
p1++;
}
}
int shortest(line_view file) {
int s{INT32_MAX};
for (char i = 'a'; i <= 'z'; i++) {
char* p1 = (char*)malloc(file.length);
memcpy(p1, file.line, file.length);
char* p2 = p1 + file.length;
remove(p1, p2, i);
deduct(p1, p2);
int c = count({p1, p2});
if (c < s) {
s = c;
}
free(p1);
}
return s;
}
void print(char* p1, char* p2) {
while (p1 < p2) {
if (*p1 != ' ') {
std::cout << *p1;
}
p1++;
}
printf("\n");
}
std::pair<int, int> day5(line_view file) {
char* p1 = (char*)malloc(file.length);
memcpy(p1, file.line, file.length);
char* p2 = p1 + file.length;
deduct(p1, p2);
// print(p1, p2);
return {count({p1, p2}), shortest(file)};
}
} // namespace aoc2018
|
