leetcode\RangeSumQueryImmutable::sumRange2()

Complexity

Conditions	7
Paths	3

Size

Total Lines	17
Code Lines	9

Duplication

Lines	0
Ratio	0 %

Importance

Changes	2
Bugs	0	Features	0

<?php
    public static function sumRange2(array $nums, int $i, int $j)
    {
        $n = count($nums);
        if ($n <= 0 || $i > $j || $i > $n || $j > $n) {
            return 0;
        }

        $helper = static function (array $map) use ($n) {
            for ($i = 1; $i < $n; $i++) {
                $map[$i] += $map[$i - 1];
            }

            return $map;
        };
        $map = $helper($nums);

        return $i === 0 ? $map[$j] : $map[$j] - $map[$i - 1];
    }