ArrayTransformation::transformArray() - Code Metrics - Inspection of "Add array-transformation solution" - imajinyun/leetcode-php - Measure and Improve Code Quality continuously with Scrutinizer

Test Failed

Push — master ( d743fe...89aa84 )

by Jinyun

created 2021-06-08 07:48 UTC

ArrayTransformation::transformArray() B

↳ Parent: ArrayTransformation

Complexity

Conditions	8
Paths	6

Size

Total Lines	22
Code Lines	15

Duplication

Lines	0
Ratio	0 %

Importance

Changes	1
Bugs	0	Features	0

Metric	Value
eloc	15
c	1
b	0
f	0
dl	0
loc	22
rs	8.4444
cc	8
nc	6
nop	1

<?php

declare(strict_types=1);

namespace leetcode;

class ArrayTransformation
{
    public static function transformArray(array $arr): array
    {
        if (empty($arr)) {
            return [];
        }
        [$changed, $n] = [true, count($arr)];
        $tmp = $arr;
        while ($changed) {
            $changed = false;
            for ($i = 1; $i < $n - 1; $i++) {
                if ($arr[$i - 1] < $arr[$i] && $arr[$i] > $arr[$i + 1]) {
                    $tmp[$i] -= 1;
                    $changed = true;
                } elseif ($arr[$i - 1] > $arr[$i] && $arr[$i] < $arr[$i + 1]) {
                    $tmp[$i] += 1;
                    $changed = true;
                }
            }
            $arr = $tmp;
        }

        return $arr;
    }

    public static function transformArray2(array $arr): array
    {
        if (empty($arr)) {
            return [];
        }
        [$changed, $n] = [true, count($arr)];
        while ($changed) {
            [$prev, $changed] = [$arr[0], false];
            for ($i = 1; $i < $n - 1; $i++) {
                $curr = $arr[$i];
                if ($prev < $curr && $curr > $arr[$i + 1]) {
                    [$changed, $arr[$i]] = [true, $curr - 1];
                } elseif ($prev > $curr && $curr < $arr[$i + 1]) {
                    [$changed, $arr[$i]] = [true, $curr + 1];
                }
                $prev = $curr;
            }
        }

        return $arr;
    }
}


1			<?php
2
3			declare(strict_types=1);
4
5			namespace leetcode;
6
7			class ArrayTransformation
8			{
9			public static function transformArray(array $arr): array
10			{
11			if (empty($arr)) {
12			return [];
13			}
14			[$changed, $n] = [true, count($arr)];
15			$tmp = $arr;
16			while ($changed) {
17			$changed = false;
18			for ($i = 1; $i < $n - 1; $i++) {
19			if ($arr[$i - 1] < $arr[$i] && $arr[$i] > $arr[$i + 1]) {
20			$tmp[$i] -= 1;
21			$changed = true;
22			} elseif ($arr[$i - 1] > $arr[$i] && $arr[$i] < $arr[$i + 1]) {
23			$tmp[$i] += 1;
24			$changed = true;
25			}
26			}
27			$arr = $tmp;
28			}
29
30			return $arr;
31			}
32
33			public static function transformArray2(array $arr): array
34			{
35			if (empty($arr)) {
36			return [];
37			}
38			[$changed, $n] = [true, count($arr)];
39			while ($changed) {
40			[$prev, $changed] = [$arr[0], false];
41			for ($i = 1; $i < $n - 1; $i++) {
42			$curr = $arr[$i];
43			if ($prev < $curr && $curr > $arr[$i + 1]) {
44			[$changed, $arr[$i]] = [true, $curr - 1];
45			} elseif ($prev > $curr && $curr < $arr[$i + 1]) {
46			[$changed, $arr[$i]] = [true, $curr + 1];
47			}
48			$prev = $curr;
49			}
50			}
51
52			return $arr;
53			}
54			}
55

imajinyun / leetcode-php

Push — master ( d743fe...89aa84 )

ArrayTransformation::transformArray() B

Complexity

Size

Duplication

Importance

Duplication Side-by-Side

Filter issues like