DaanMooij\AdventOfCode\Year2015\Day1

Complexity

Total Complexity

8

Size/Duplication

Total Lines	40
Duplicated Lines	0 %

Importance

Changes	1
Bugs	0	Features	1

5 Methods

Rating	Name	Duplication	Size	Complexity
A	setDirections()	0	3	1
A	calculateFloor()	0	11	4
A	loadInput()	0	5	1
A	solve()	0	3	1
A	getDirections()	0	3	1

<?php

namespace DaanMooij\AdventOfCode\Year2015;

use DaanMooij\AdventOfCode\Day;

class Day1 implements Day
{
    const FLOOR_UP = '(';
    const FLOOR_DOWN = ')';

    private array $directions = [];

    public function loadInput(): void
    {
        $filepath = __DIR__ . "/input/day-1.txt";

        $this->directions = str_split(file_get_contents($filepath));
    }

    public function solve()
    {
        printf("The resulting floor is: %s\n", $this->calculateFloor());
    }

    public function calculateFloor(int $floor = 0): int
    {
        foreach ($this->directions as $direction) {
            if ($direction === self::FLOOR_UP) {
                $floor++;
            } elseif ($direction === self::FLOOR_DOWN) {
                $floor--;
            }
        }

        return $floor;
    }

    public function setDirections(array $directions): void
    {
        $this->directions = $directions;
    }

    public function getDirections(): array
    {
        return $this->directions;
    }
}