RemoveLinkedListElements::removeElements2() - Code Metrics - Inspection of "Update README.md" - imajinyun/leetcode-php - Measure and Improve Code Quality continuously with Scrutinizer

Test Failed

Push — master ( e37232...aa116f )

by Jinyun

created 2021-09-20 07:29 UTC

RemoveLinkedListElements::removeElements2() A

↳ Parent: RemoveLinkedListElements

Complexity

Conditions	5
Paths	5

Size

Total Lines	21
Code Lines	14

Duplication

Lines	0
Ratio	0 %

Importance

Changes	1
Bugs	0	Features	0

Metric	Value
eloc	14
c	1
b	0
f	0
dl	0
loc	21
rs	9.4888
cc	5
nc	5
nop	2

<?php

declare(strict_types=1);

namespace leetcode;

use leetcode\util\ListNode;

class RemoveLinkedListElements
{
    public static function removeElements(?ListNode $head, int $val): ?ListNode
    {
        if (!$head) {
            return null;
        }
        $next = self::removeElements($head->next, $val);
        if ($head->val === $val) {
            return $next;
        }
        $head->next = $next;

        return $head;
    }

    public static function removeElements2(?ListNode $head, int $val): ?ListNode
    {
        if (!$head) {
            return null;
        }
        [$prev, $curr] = [null, $head];
        while ($curr) {
            if ($curr->val === $val) {
                if ($curr === $head) {
                    $curr = $head = $head->next;
                } else {
                    $prev->next = $curr->next;
                    $curr = $curr->next;
                }
            } else {
                $prev = $curr;
                $curr = $curr->next;
            }
        }

        return $head;
    }

    public static function removeElements3(?ListNode $head, int $val): ?ListNode
    {
        if (!$head) {
            return null;
        }
        $dummy = new ListNode();
        $dummy->next = $head;
        [$prev, $curr] = [$dummy, $head];
        while ($curr) {
            if ($curr->val === $val) {
                $prev->next = $curr->next;
            } else {
                $prev = $prev->next;
            }
            $curr = $curr->next;
        }

        return $dummy->next;
    }

    public static function removeElements4(?ListNode $head, int $val): ?ListNode
    {
        if (!$head) {
            return null;
        }
        $curr = $head;
        while ($curr->next) {
            if ($curr->next->val === $val) {
                $curr->next = $curr->next->next;
            } else {
                $curr = $curr->next;
            }
        }

        return $head->val === $val ? $head->next : $head;
    }
}


1			<?php
2
3			declare(strict_types=1);
4
5			namespace leetcode;
6
7			use leetcode\util\ListNode;
8
9			class RemoveLinkedListElements
10			{
11			public static function removeElements(?ListNode $head, int $val): ?ListNode
12			{
13			if (!$head) {
14			return null;
15			}
16			$next = self::removeElements($head->next, $val);
17			if ($head->val === $val) {
18			return $next;
19			}
20			$head->next = $next;
21
22			return $head;
23			}
24
25			public static function removeElements2(?ListNode $head, int $val): ?ListNode
26			{
27			if (!$head) {
28			return null;
29			}
30			[$prev, $curr] = [null, $head];
31			while ($curr) {
32			if ($curr->val === $val) {
33			if ($curr === $head) {
34			$curr = $head = $head->next;
35			} else {
36			$prev->next = $curr->next;
37			$curr = $curr->next;
38			}
39			} else {
40			$prev = $curr;
41			$curr = $curr->next;
42			}
43			}
44
45			return $head;
46			}
47
48			public static function removeElements3(?ListNode $head, int $val): ?ListNode
49			{
50			if (!$head) {
51			return null;
52			}
53			$dummy = new ListNode();
54			$dummy->next = $head;
55			[$prev, $curr] = [$dummy, $head];
56			while ($curr) {
57			if ($curr->val === $val) {
58			$prev->next = $curr->next;
59			} else {
60			$prev = $prev->next;
61			}
62			$curr = $curr->next;
63			}
64
65			return $dummy->next;
66			}
67
68			public static function removeElements4(?ListNode $head, int $val): ?ListNode
69			{
70			if (!$head) {
71			return null;
72			}
73			$curr = $head;
74			while ($curr->next) {
75			if ($curr->next->val === $val) {
76			$curr->next = $curr->next->next;
77			} else {
78			$curr = $curr->next;
79			}
80			}
81
82			return $head->val === $val ? $head->next : $head;
83			}
84			}
85

imajinyun / leetcode-php

Push — master ( e37232...aa116f )

RemoveLinkedListElements::removeElements2() A

Complexity

Size

Duplication

Importance

Duplication Side-by-Side

Filter issues like