leetcode\MinimumFallingPathSumII::minFallingPathSum()

Complexity

Conditions	5
Paths	5

Size

Total Lines	19
Code Lines	13

Duplication

Lines	0
Ratio	0 %

Importance

Changes	1
Bugs	0	Features	0

<?php
    public static function minFallingPathSum(array $grid): int
    {
        if (empty($grid)) {
            return 0;
        }
        [$m, $n] = [count($grid), count($grid[0])];
        $curr = $grid[0];
        for ($i = 1; $i < $m; $i++) {
            $next = $data = [];
            self::helper($curr, $data);
            $vals = array_slice($data, 0, 2);
            for ($j = 0; $j < $n; $j++) {
                $temp = $vals[0][1] === $j ? $vals[1][0] : $vals[0][0];
                array_push($next, $grid[$i][$j] + $temp);
            }
            $curr = $next;
        }

        return min($curr);
    }