leetcode\ProductOfArrayExceptSelf::productExceptSelf()

Complexity

Conditions	5
Paths	9

Size

Total Lines	20
Code Lines	12

Duplication

Lines	0
Ratio	0 %

Importance

Changes	1
Bugs	0	Features	0

<?php
    public static function productExceptSelf(array $nums): array
    {
        if (empty($nums)) {
            return [];
        }
        $n = count($nums);
        $ans = $left = $right = array_fill(0, $n, 0);
        $left[0] = $right[$n - 1] = 1;

        for ($i = 1; $i < $n; $i++) {
            $left[$i] = $left[$i - 1] * $nums[$i - 1];
        }
        for ($i = $n - 2; $i >= 0; $i--) {
            $right[$i] = $right[$i + 1] * $nums[$i + 1];
        }
        for ($i = 0; $i < $n; $i++) {
            $ans[$i] = $left[$i] * $right[$i];
        }

        return $ans;
    }