User avatar
Ben Cohen @airspeedswift@mastodon.social
2y
Advent of Code spoilers I'm sure there are better ways to do it but I found this solution pleasingly disgusting.
A screenshot of some Swift code solving Day 1 2023 of AOC. The code shows searching forward with a regex for words, then reverses the string and searches for the same words backwards. let forwards = #/\d|one|two|three|four|five|six|seven|eight|nine/# let backwards = #/\d|eno|owt|eerht|ruof|evif|xis|neves|thgie|enin/# func part2() -> Any { // Calculate the sum of the first set of input data entities.reduce(into: 0) { total, s in let fst = s.firstMatch(of: forwards)!.dgt let lst = String(s.reversed()).firstMatch(of: backwards)!.dgt total += fst*10 + lst } } } extension Substring { var dgt: Int { if let n = first?.wholeNumberValue { n } else { switch self { case "one","eno": 1 case "two","owt": 2 case "three","eerht": 3 case "four","ruof": 4 case "five","evif": 5 case "six","xis": 6 case "seven","neves": 7 case "eight","thgie": 8 case "nine","enin": 9 default: fatalError() } } } }
1
0
0
0
User avatar
Ben Cohen @airspeedswift@mastodon.social
2y
Advent of Code spoilers and for the code golf enthusiasts, part 1 in one line (no semicolons allowed)

print(sequence(state:0){_ in readLine()}.reduce(0){$0+{$0[0]*10+$0.last!}($1.compactMap(\.wholeNumberValue))})
2
0
0
0
User avatar
namori @namori@peculiar.florist
2y
re: Advent of Code spoilers @airspeedswift very short, but really disgusting, I hesitate between loving or burning it ​:blobcat_just_right:​
0
0
0
0