leetcode\Triangle

Complexity

Total Complexity

9

Size/Duplication

Total Lines	34
Duplicated Lines	0 %

Importance

Changes	2
Bugs	0	Features	0

2 Methods

Rating	Name	Duplication	Size	Complexity
A	minimumTotal2()	0	14	4
A	minimumTotal()	0	16	5

<?php

declare(strict_types=1);

namespace leetcode;

class Triangle
{
    public static function minimumTotal(array $triangle)
    {
        if (0 === $n = count($triangle)) {
            return $n;
        }
        $dp = [];
        for ($i = 0; $i < count($triangle[$n - 1]); $i++) {

It seems like you are calling the size function count() as part of the test condition. You might want to compute the size beforehand, and not on each iteration.

            $dp[$i] = $triangle[$n - 1][$i];
        }
        for ($i = $n - 2; $i >= 0; $i--) {
            for ($j = 0; $j <= $i; $j++) {
                $dp[$j] = min($dp[$j], $dp[$j + 1]) + $triangle[$i][$j];
            }
        }

        return $dp[0];
    }

    public static function minimumTotal2(array $triangle)
    {
        if (0 === $n = count($triangle)) {
            return $n;
        }

        $ans = $triangle[$n - 1];
        for ($i = $n - 2; $i >= 0; $i--) {
            for ($j = 0; $j <= $i; $j++) {
                $ans[$j] = $triangle[$i][$j] + min($ans[$j], $ans[$j + 1]);
            }
        }

        return $ans[0];
    }
}