Thanks Homer.

  • Black616Angel@feddit.de
    link
    fedilink
    arrow-up
    5
    ·
    11 months ago

    Day one really got me with those pesky overlapping words like eightwo or twone.

    Today was actually really easy the way I did it.
    I searched through all the characters of the lines and when I got one that wasn’t a number or a period, I looked at all the 8 places around to find the numbers. The numbers I completed by looking in both directions until I got a non-number.
    Then I put all numbers and their starting positions in an array, deleted the duplicates and summed them.

    By doing this, question 2 only took me 4 minutes.

    • mykl@lemmy.worldOP
      link
      fedilink
      arrow-up
      2
      ·
      11 months ago

      Yeah it looks like the better solutions generally took that route. I convinced myself that the symbols were going to all have different rules in part 2, so ended up thinking about it way too hard for day 3 😀

      • Black616Angel@feddit.de
        link
        fedilink
        arrow-up
        2
        ·
        11 months ago

        Thought so too, but for me it was a simple match statement (rust), which then became a glorified if statement. 😂

    • UndercoverUlrikHD@programming.dev
      link
      fedilink
      arrow-up
      2
      ·
      11 months ago

      Hmm, I did it the opposite. Found every number and passed a list of every adjacent position of the number to check for non-digit/dot/non-whitespace.

      Took a bit longer to solve part 2 due to that approach though.