adventofcode2022

My solutions for Advent of Code 2022
Log | Files | Refs

commit f49f2838923e20a771a2fe18516b3d3efa77fc22
parent 20305305048082a2c4101a8938a1c630f34fe56b
Author: Lukas Henkel <lh@entf.net>
Date:   Sat,  3 Dec 2022 15:55:19 +0100

I don't actually need the for and modulo stuff anymore

Diffstat:
Msrc/day03.lisp | 18++++++++----------
1 file changed, 8 insertions(+), 10 deletions(-)

diff --git a/src/day03.lisp b/src/day03.lisp @@ -25,16 +25,14 @@ (defun task2 (inputs) (loop with head = inputs - for end from 3 - when (= 0 (mod end 3)) - sum (loop for item = #\A then (cond ((char= item #\Z) #\a) - ((char= item #\z) nil) - (t (code-char (1+ (char-code item))))) - while item - until (loop for i from 0 to 2 - always (find item (elt head i))) - finally (return (calculate-priority item))) - and do (setf head (cdddr head)) + sum (loop for item = #\A then (cond ((char= item #\Z) #\a) + ((char= item #\z) nil) + (t (code-char (1+ (char-code item))))) + while item + until (loop for i from 0 to 2 + always (find item (elt head i))) + finally (return (calculate-priority item))) + do (setf head (cdddr head)) while head)) (define-day 3