SymmetricTree::isSymmetric() - Code Metrics - Inspection of "Add symmetric-tree solution" - imajinyun/leetcode-php - Measure and Improve Code Quality continuously with Scrutinizer

Test Failed

Push — master ( 21ac5d...b25d9d )

by Jinyun

created 2021-09-04 02:39 UTC

SymmetricTree::isSymmetric() B

↳ Parent: SymmetricTree

Complexity

Conditions	8
Paths	5

Size

Total Lines	23
Code Lines	16

Duplication

Lines	0
Ratio	0 %

Importance

Changes	1
Bugs	0	Features	0

Metric	Value
eloc	16
c	1
b	0
f	0
dl	0
loc	23
rs	8.4444
cc	8
nc	5
nop	1

<?php

declare(strict_types=1);

namespace leetcode;

use leetcode\util\TreeNode;

class SymmetricTree
{
    public static function isSymmetric(?TreeNode $root): bool
    {
        if (!$root) {
            return false;
        }
        $stack = [];
        array_push($stack, $root->left);
        array_push($stack, $root->right);
        while ($stack) {
            [$p, $q] = [array_shift($stack), array_shift($stack)];
            if (!$p && !$p) {
                continue;
            }
            if (!$p || !$q || $p->val !== $q->val) {
                return false;
            }
            array_push($stack, $p->left);
            array_push($stack, $q->right);
            array_push($stack, $p->right);
            array_push($stack, $q->left);
        }

        return true;
    }

    public static function isSymmetric2(?TreeNode $root): bool
    {
        if (!$root) {
            return false;
        }

        return self::helper($root->left, $root->right);
    }

    private static function helper(?TreeNode $p, ?TreeNode $q): bool
    {
        if (!$p && !$q) {
            return true;
        }
        if (!$p || !$q) {
            return false;
        }

        return $p->val === $q->val &&
            self::helper($p->left, $q->right) &&
            self::helper($p->right, $q->left);
    }
}


1			<?php
2
3			declare(strict_types=1);
4
5			namespace leetcode;
6
7			use leetcode\util\TreeNode;
8
9			class SymmetricTree
10			{
11			public static function isSymmetric(?TreeNode $root): bool
12			{
13			if (!$root) {
14			return false;
15			}
16			$stack = [];
17			array_push($stack, $root->left);
18			array_push($stack, $root->right);
19			while ($stack) {
20			[$p, $q] = [array_shift($stack), array_shift($stack)];
21			if (!$p && !$p) {
22			continue;
23			}
24			if (!$p \|\| !$q \|\| $p->val !== $q->val) {
25			return false;
26			}
27			array_push($stack, $p->left);
28			array_push($stack, $q->right);
29			array_push($stack, $p->right);
30			array_push($stack, $q->left);
31			}
32
33			return true;
34			}
35
36			public static function isSymmetric2(?TreeNode $root): bool
37			{
38			if (!$root) {
39			return false;
40			}
41
42			return self::helper($root->left, $root->right);
43			}
44
45			private static function helper(?TreeNode $p, ?TreeNode $q): bool
46			{
47			if (!$p && !$q) {
48			return true;
49			}
50			if (!$p \|\| !$q) {
51			return false;
52			}
53
54			return $p->val === $q->val &&
55			self::helper($p->left, $q->right) &&
56			self::helper($p->right, $q->left);
57			}
58			}
59

imajinyun / leetcode-php

Push — master ( 21ac5d...b25d9d )

SymmetricTree::isSymmetric() B

Complexity

Size

Duplication

Importance

Duplication Side-by-Side

Filter issues like