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
|
const std = @import("std");
const dupl_values = @import("util/mem.zig").dupl_values;
pub fn puzzle_1(allocator: std.mem.Allocator, input: []u8) !u16 {
var iter = std.mem.split(u8, input, "\n");
var count: u16 = 0;
while (iter.next()) |line| {
const duplicates = try dupl_values(
u8,
allocator,
&[_][]const u8{
line[0 .. line.len / 2],
line[line.len / 2 ..],
},
);
defer allocator.free(duplicates);
for (duplicates) |char| {
count += char_to_priority(char);
}
}
return count;
}
pub fn puzzle_2(allocator: std.mem.Allocator, input: []u8) !u16 {
var iter = std.mem.split(u8, input, "\n");
var count: u16 = 0;
while (iter.next()) |line| {
const duplicates = try dupl_values(
u8,
allocator,
&[_][]const u8{
line,
iter.next().?,
iter.next().?,
},
);
defer allocator.free(duplicates);
for (duplicates) |char| {
count += char_to_priority(char);
}
}
return count;
}
fn char_to_priority(char: u8) u8 {
if (char >= 65 and char <= 90)
return char - 38;
return char - 96;
}
|