leetcode\MinimumSizeSubarraySum::minSubArrayLen()

Complexity

Conditions	6
Paths	7

Size

Total Lines	16
Code Lines	10

Duplication

Lines	0
Ratio	0 %

Importance

Changes	1
Bugs	0	Features	0

<?php
    public static function minSubArrayLen(int $target, array $nums): int
    {
        if (empty($nums) || $target < 0) {
            return 0;
        }
        $i = $j = $sum = 0;
        [$n, $min] = [count($nums), PHP_INT_MAX];
        while ($i < $n) {
            $sum += $nums[$i++];
            while ($sum >= $target) {
                $min = min($min, $i - $j);
                $sum -= $nums[$j++];
            }
        }

        return $min === PHP_INT_MAX ? 0 : $min;
    }