MinimumSizeSubarraySum::minSubArrayLen2() - Code Metrics - Inspection of "Add minimum-size-subarray-sum solution" - imajinyun/leetcode-php - Measure and Improve Code Quality continuously with Scrutinizer

Test Failed

Push — master ( 34be47...f81982 )

by Jinyun

created 2021-09-19 09:15 UTC

MinimumSizeSubarraySum::minSubArrayLen2() B

↳ Parent: MinimumSizeSubarraySum

Complexity

Conditions	7
Paths	7

Size

Total Lines	15
Code Lines	9

Duplication

Lines	0
Ratio	0 %

Importance

Changes	1
Bugs	0	Features	0

Metric	Value
eloc	9
c	1
b	0
f	0
dl	0
loc	15
rs	8.8333
cc	7
nc	7
nop	2

<?php

declare(strict_types=1);

namespace leetcode;

class MinimumSizeSubarraySum
{
    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;
    }

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

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


1			<?php
2
3			declare(strict_types=1);
4
5			namespace leetcode;
6
7			class MinimumSizeSubarraySum
8			{
9			public static function minSubArrayLen(int $target, array $nums): int
10			{
11			if (empty($nums) \|\| $target < 0) {
12			return 0;
13			}
14			$i = $j = $sum = 0;
15			[$n, $min] = [count($nums), PHP_INT_MAX];
16			while ($i < $n) {
17			$sum += $nums[$i++];
18			while ($sum >= $target) {
19			$min = min($min, $i - $j);
20			$sum -= $nums[$j++];
21			}
22			}
23
24			return $min === PHP_INT_MAX ? 0 : $min;
25			}
26
27			public static function minSubArrayLen2(int $target, array $nums): int
28			{
29			if (empty($nums) \|\| $target < 0) {
30			return 0;
31			}
32			[$n, $j, $sum, $min] = [count($nums), 0, 0, PHP_INT_MAX];
33			for ($i = 0; $i < $n; $i++) {
34			$sum += $nums[$i];
35			for (; $j < $n && $sum >= $target; $j++) {
36			$min = min($min, $i - $j + 1);
37			$sum -= $nums[$j];
38			}
39			}
40
41			return $min === PHP_INT_MAX ? 0 : $min;
42			}
43			}
44

imajinyun / leetcode-php

Push — master ( 34be47...f81982 )

MinimumSizeSubarraySum::minSubArrayLen2() B

Complexity

Size

Duplication

Importance

Duplication Side-by-Side

Filter issues like