20
submitted 9 months ago* (last edited 9 months ago) by Ategon@programming.dev to c/advent_of_code@programming.dev

Day 9: Mirage Maintenance

Megathread guidelines

  • Keep top level comments as only solutions, if you want to say something other than a solution put it in a new post. (replies to comments can be whatever)
  • Code block support is not fully rolled out yet but likely will be in the middle of the event. Try to share solutions as both code blocks and using something such as https://topaz.github.io/paste/ , pastebin, or github (code blocks to future proof it for when 0.19 comes out and since code blocks currently function in some apps and some instances as well if they are running a 0.19 beta)

FAQ


๐Ÿ”’ Thread is locked until there's at least 100 2 star entries on the global leaderboard

๐Ÿ”“ Unlocked after 5 mins

you are viewing a single comment's thread
view the rest of the comments
[-] SteveDinn@lemmy.ca 2 points 9 months ago

C#

Used recursion to determine the differences for part 1 and then extracted the variations in processing from predicting the end vs. the beginning of the history and passed them in as Func variables to the recursive method.

Day 9

[-] SteveDinn@lemmy.ca 2 points 9 months ago* (last edited 9 months ago)

Snippet:

        static void Part1(string data)
        {
            var result = ParseInput(data)
                .Select(history => ProcessHistory(history, g => g.Length - 1, (a, b) => a + b))
                .Sum();

            Console.WriteLine(result);
        }

        static void Part2(string data)
        {
            var result = ParseInput(data)
                .Select(history => ProcessHistory(history, g => 0, (a, b) => a - b))
                .Sum();

            Console.WriteLine(result);
        }

        static int ProcessHistory(
            int[] history,
            Func guessIndex,
            Func collateGuess)
        {
            bool allZeros = true;

            var diffs = new int[history.Length - 1];
            for (int i = 0; i < diffs.Length; i++)
            {
                var diff = history[i + 1] - history[i];
                diffs[i] = diff;
                allZeros = allZeros && (diff == 0);
            }

            var guess = history[guessIndex(history)];

            if (!allZeros)
            {
                guess = collateGuess(
                    guess,
                    ProcessHistory(diffs, guessIndex, collateGuess));
            }

            return guess;
        }
this post was submitted on 09 Dec 2023
20 points (95.5% liked)

Advent Of Code

736 readers
1 users here now

An unofficial home for the advent of code community on programming.dev!

Advent of Code is an annual Advent calendar of small programming puzzles for a variety of skill sets and skill levels that can be solved in any programming language you like.

AoC 2023

Solution Threads

M T W T F S S
1 2 3
4 5 6 7 8 9 10
11 12 13 14 15 16 17
18 19 20 21 22 23 24
25

Rules/Guidelines

Relevant Communities

Relevant Links

Credits

Icon base by Lorc under CC BY 3.0 with modifications to add a gradient

console.log('Hello World')

founded 1 year ago
MODERATORS