krixano/adventofcode - Change W7RKL7EQWB4HARQS4XASRQOA2KUK5XZWJU3ZYMMKDQKF4WUQLFVAC

Simplified and more performant F# solution for day1 problem - using query expressions (and find)

Created by krixano on December 2, 2020

W7RKL7EQWB4HARQS4XASRQOA2KUK5XZWJU3ZYMMKDQKF4WUQLFVAC

Dependencies

[2] OHEKH6Q3CVVLL5BMLZ4JAV3HCVRWRUYQQQ7CYSXXMKYHKNSSLK2AC

In channels

main

Change contents

File deletion: problem1
BF:BFD[2.23] → [2.24:34]
BF:BFD[2.34] → [2.35:35]
B:BD[2.35] → [2.36:228812]

Replacement in 2020/fsharp/day1/Program.fs at line 5 [2.230691]

B:BD[2.231916] → [2.231916:232038]

let part1 =
    [ for a in arr do
        for b in arr do
            if a + b = 2020 then
                (a * b) ]

[2.231916]

[2.232038]

let tupleToArray2 t =
    match t with
    | (a, b) -> [| a; b |]
let tupleToArray3 t =
    match t with
    | (a, b, c) -> [| a; b; c |]

Replacement in 2020/fsharp/day1/Program.fs at line 12 [2.230691]

B:BD[2.232042] → [2.232042:232078]

let part2 =
    [ for a in arr do

[2.232040]

[2.232078]

let part1 (arr: int list) = query {
    for a in arr do
        for b in arr do
            find (a + b = 2020)
}
let part2 (arr: int list) = query {
    for a in arr do

Replacement in 2020/fsharp/day1/Program.fs at line 21 [2.230691]

B:BD[2.232132] → [2.232132:232209]

                if a + b + c = 2020 then
                    (a * b * c) ]

[2.232132]

[2.232209]

                find (a + b + c = 2020)
}

Replacement in 2020/fsharp/day1/Program.fs at line 26 [2.230691]

B:BD[2.232244] → [2.232244:232338]

    printfn "%d" part1.[0]
    printfn "%d" part2.[0]
    0 // return an integer exit code

[2.232244]

[2.232338]

    let v = part1 arr |> tupleToArray2 |> Array.reduce (*)
    printfn "%d" v
    let v2 = part2 arr |> tupleToArray3 |> Array.reduce (*)
    printfn "%d" v2
    0