peterino
/
aoc-zig-2025
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

removing dead code

This commit is contained in:
peterino2 2026-06-14 11:24:05 -07:00
parent 45c2508900
commit 4b4eadd151
1 changed files with 0 additions and 20 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

20
day3.zig
View File

@ -4,10 +4,6 @@ const Io = std.Io;
const shared = @import("shared.zig"); const shared = @import("shared.zig");
const print = shared.print; const print = shared.print;
// for each value,
// build a list of all possible subvalues it can combine with,
// trim to largest for each value
// limited single loop for part 1 // limited single loop for part 1
pub fn findLargest(line: []const u8, charsLeft: usize) usize { pub fn findLargest(line: []const u8, charsLeft: usize) usize {
var largest: u8 = 0; var largest: u8 = 0;
@ -104,19 +100,3 @@ pub fn main(init: std.process.Init) !void {
print("part1 {d}", .{part1}); print("part1 {d}", .{part1});
print("part2 {d}", .{part2}); print("part2 {d}", .{part2});
} }
//while (lineIter.next()) |l| {
// const line = shared.trim(l);
// lineLargest = 0;
// for (line[0 .. line.len - 1], 0..) |c, i| {
// const offset = findLargest(line[i + 1 .. line.len]) + i + 1;
// digits.clearRetainingCapacity();
// try digits.append(allocator, c);
// try digits.append(allocator, line[offset]);
// const x = try std.fmt.parseInt(i64, digits.items, 10);
// if (x > lineLargest) {
// print("{d}", .{x});
// lineLargest = x;
// }
// }
// part1 += lineLargest;
//}