DaanMooij\AdventOfCode\Year2015\Day2\Day2

Complexity

Total Complexity

5

Size/Duplication

Total Lines	40
Duplicated Lines	0 %

Importance

Changes	1
Bugs	0	Features	1

3 Methods

Rating	Name	Duplication	Size	Complexity
A	loadInput()	0	10	2
A	getDimensions()	0	3	1
A	solve()	0	15	2

<?php

namespace DaanMooij\AdventOfCode\Year2015\Day2;

use Exception;
use DaanMooij\AdventOfCode\Day;
use DaanMooij\AdventOfCode\Year2015\Day2\Present;

class Day2 implements Day
{
    /** @var array<string> */
    private array $dimensions = [];

    /** @return void */
    public function loadInput(): void
    {
        $filepath = __DIR__ . "/input.txt";
        $file = file($filepath);

        if (!is_array($file)) {
            throw new Exception("Could not open input file: {$filepath}");
        }

        $this->dimensions = $file;
    }

    /** @return void */
    public function solve(): void
    {
        $amountWrappingPaper = 0;
        $lengthRibbon = 0;
        foreach ($this->dimensions as $dimension) {
            $present = Present::fromString($dimension);
            $amountWrappingPaper += $present->getSurfaceArea();
            $amountWrappingPaper += $present->getSmallestSideArea();
            $lengthRibbon += $present->getVolume();
            $lengthRibbon += $present->getSmallestSide() * 2;
            $lengthRibbon += $present->getSecondSmallestSide() * 2;
        }

        printf("The total amount of wrapping paper is: %s\n", $amountWrappingPaper);
        printf("The total length of ribbon is: %s\n", $lengthRibbon);
    }

    /** @return array<string> */
    public function getDimensions(): array
    {
        return $this->dimensions;
    }
}