DietPlanPerformance::dietPlanPerformance2() - Code Metrics - imajinyun/leetcode-php - Measure and Improve Code Quality continuously with Scrutinizer

DietPlanPerformance::dietPlanPerformance2() B
last analyzed 2022-03-29 06:17 UTC

↳ Parent: DietPlanPerformance

Complexity

Conditions	8
Paths	12

Size

Total Lines	22
Code Lines	13

Duplication

Lines	0
Ratio	0 %

Importance

Changes	1
Bugs	0	Features	0

Metric	Value
eloc	13
c	1
b	0
f	0
dl	0
loc	22
rs	8.4444
cc	8
nc	12
nop	4

<?php

declare(strict_types=1);

namespace leetcode;

class DietPlanPerformance
{
    public static function dietPlanPerformance(array $calories, int $k, int $lower, int $upper): int
    {
        if (empty($calories) || $k <= 0) {
            return 0;
        }
        $res = $sum = 0;
        for ($i = 0; $i < $k - 1; $i++) {
            $sum += $calories[$i];
        }
        for ($i = $k - 1, $n = count($calories); $i < $n; $i++) {
            $sum += $calories[$i];
            if ($sum < $lower) {
                $res--;
            }
            if ($sum > $upper) {
                $res++;
            }
            $sum -= $calories[$i - $k + 1];
        }

        return $res;
    }

    public static function dietPlanPerformance2(array $calories, int $k, int $lower, int $upper): int
    {
        if (empty($calories) || $k <= 0) {
            return 0;
        }
        [$res, $sum, $n] = [0, 0, count($calories)];
        for ($i = 0; $i < $n; $i++) {
            $sum += $calories[$i];
            if ($i >= $k) {
                $sum -= $calories[$i - $k];
            }
            if ($i >= $k - 1) {
                if ($sum < $lower) {
                    $res--;
                }
                if ($sum > $upper) {
                    $res++;
                }
            }
        }

        return $res;
    }
}


1			<?php
2
3			declare(strict_types=1);
4
5			namespace leetcode;
6
7			class DietPlanPerformance
8			{
9			public static function dietPlanPerformance(array $calories, int $k, int $lower, int $upper): int
10			{
11			if (empty($calories) \|\| $k <= 0) {
12			return 0;
13			}
14			$res = $sum = 0;
15			for ($i = 0; $i < $k - 1; $i++) {
16			$sum += $calories[$i];
17			}
18			for ($i = $k - 1, $n = count($calories); $i < $n; $i++) {
19			$sum += $calories[$i];
20			if ($sum < $lower) {
21			$res--;
22			}
23			if ($sum > $upper) {
24			$res++;
25			}
26			$sum -= $calories[$i - $k + 1];
27			}
28
29			return $res;
30			}
31
32			public static function dietPlanPerformance2(array $calories, int $k, int $lower, int $upper): int
33			{
34			if (empty($calories) \|\| $k <= 0) {
35			return 0;
36			}
37			[$res, $sum, $n] = [0, 0, count($calories)];
38			for ($i = 0; $i < $n; $i++) {
39			$sum += $calories[$i];
40			if ($i >= $k) {
41			$sum -= $calories[$i - $k];
42			}
43			if ($i >= $k - 1) {
44			if ($sum < $lower) {
45			$res--;
46			}
47			if ($sum > $upper) {
48			$res++;
49			}
50			}
51			}
52
53			return $res;
54			}
55			}
56

imajinyun / leetcode-php

DietPlanPerformance::dietPlanPerformance2() B last analyzed 2022-03-29 06:17 UTC

Complexity

Size

Duplication

Importance

Duplication Side-by-Side

Filter issues like

DietPlanPerformance::dietPlanPerformance2() B
last analyzed 2022-03-29 06:17 UTC