[Day 7] Mainly coding style

Author: goggle

README.md

@@ -16,7 +16,7 @@ This Julia package contains my solutions for [Advent of Code 2024](https://adven
 | 4 | [:white_check_mark:](https://adventofcode.com/2024/day/4) | 1.798 ms | 3.06 MiB | [:white_check_mark:](https://github.com/goggle/AdventOfCode2024.jl/blob/main/src/day04.jl) |
 | 5 | [:white_check_mark:](https://adventofcode.com/2024/day/5) | 2.104 ms | 1.26 MiB | [:white_check_mark:](https://github.com/goggle/AdventOfCode2024.jl/blob/main/src/day05.jl) |
 | 6 | [:white_check_mark:](https://adventofcode.com/2024/day/6) | 549.253 ms | 50.91 MiB | [:white_check_mark:](https://github.com/goggle/AdventOfCode2024.jl/blob/main/src/day06.jl) |
-| 7 | [:white_check_mark:](https://adventofcode.com/2024/day/7) | 33.994 ms | 1.53 MiB | [:white_check_mark:](https://github.com/goggle/AdventOfCode2024.jl/blob/main/src/day07.jl) |
+| 7 | [:white_check_mark:](https://adventofcode.com/2024/day/7) | 30.710 ms | 1.53 MiB | [:white_check_mark:](https://github.com/goggle/AdventOfCode2024.jl/blob/main/src/day07.jl) |
 | 8 | [:white_check_mark:](https://adventofcode.com/2024/day/8) | 316.122 μs | 671.41 KiB | [:white_check_mark:](https://github.com/goggle/AdventOfCode2024.jl/blob/main/src/day08.jl) |
 | 9 | [:white_check_mark:](https://adventofcode.com/2024/day/9) | 28.732 ms | 9.58 MiB | [:white_check_mark:](https://github.com/goggle/AdventOfCode2024.jl/blob/main/src/day09.jl) |
 | 10 | [:white_check_mark:](https://adventofcode.com/2024/day/10) | 578.868 μs | 633.67 KiB | [:white_check_mark:](https://github.com/goggle/AdventOfCode2024.jl/blob/main/src/day10.jl) |

src/day07.jl

@@ -13,7 +13,7 @@ function parse_input(input)
     numbers = Vector{Int}[]
     concat_factors = Vector{Int}[]
 
-    for line in lines
+    for line ∈ lines
         left, right = split(line, ':')
         nums = parse.(Int, split(right))
         factors = [10^ndigits(n) for n in nums]
@@ -27,17 +27,12 @@ end
 
 function solve(test_values::Vector{Int}, numbers::Vector{Vector{Int}}, concat_factors::Vector{Vector{Int}})
     p1 = p2 = 0
-    for i in eachindex(test_values)
+    for i ∈ eachindex(test_values)
         nums = numbers[i]
-        isempty(nums) && continue
-        tv = test_values[i]
-        cf = concat_factors[i]
-        
-        valid1 = _valid_p1(tv, nums[1], 2, nums)
-        valid2 = valid1 ? true : _valid_p2(tv, nums[1], 2, nums, cf)
-        
-        p1 += valid1 * tv
-        p2 += (valid1 || valid2) * tv
+        valid1 = _valid_p1(test_values[i], nums[1], 2, nums)
+        valid2 = valid1 ? true : _valid_p2(test_values[i], nums[1], 2, nums, concat_factors[i])
+        p1 += valid1 * test_values[i]
+        p2 += (valid1 || valid2) * test_values[i]
     end
     return [p1, p2]
 end