MaximumDepthOfBinaryTree::maxDepth() - Code Metrics - Inspection of "Update maximum-depth-of-binary-tree solution" - imajinyun/leetcode-php - Measure and Improve Code Quality continuously with Scrutinizer

Test Failed

Push — master ( f04b39...21ac5d )

by Jinyun

created 2021-09-04 01:31 UTC

MaximumDepthOfBinaryTree::maxDepth() A

↳ Parent: MaximumDepthOfBinaryTree

Complexity

Conditions	4
Paths	4

Size

Total Lines	13
Code Lines	7

Duplication

Lines	0
Ratio	0 %

Importance

Changes	1
Bugs	0	Features	0

Metric	Value
eloc	7
c	1
b	0
f	0
dl	0
loc	13
rs	10
cc	4
nc	4
nop	1

<?php

declare(strict_types=1);

namespace leetcode;

use leetcode\util\TreeNode;

class MaximumDepthOfBinaryTree
{
    public static function maxDepth(TreeNode $root = null): int
    {
        if ($root === null) {
            return 0;
        }
        if ($root->left === null) {
            return self::maxDepth($root->right) + 1;
        }
        if ($root->right === null) {
            return self::maxDepth($root->left) + 1;
        }

        return max(self::maxDepth($root->left), self::maxDepth($root->right)) + 1;
    }

    public static function maxDepth2(?TreeNode $root): int
    {
        if (!$root) {
            return 0;
        }
        [$cnt, $queue] = [0, [$root]];
        while ($queue) {
            $size = count($queue);
            while ($size-- > 0) {
                $node = array_pop($queue);
                if ($node->left) {
                    array_push($queue, $node->left);
                }
                if ($node->right) {
                    array_push($queue, $node->right);
                }
            }
            $cnt++;
        }

        return $cnt;
    }
}


1			<?php
2
3			declare(strict_types=1);
4
5			namespace leetcode;
6
7			use leetcode\util\TreeNode;
8
9			class MaximumDepthOfBinaryTree
10			{
11			public static function maxDepth(TreeNode $root = null): int
12			{
13			if ($root === null) {
14			return 0;
15			}
16			if ($root->left === null) {
17			return self::maxDepth($root->right) + 1;
18			}
19			if ($root->right === null) {
20			return self::maxDepth($root->left) + 1;
21			}
22
23			return max(self::maxDepth($root->left), self::maxDepth($root->right)) + 1;
24			}
25
26			public static function maxDepth2(?TreeNode $root): int
27			{
28			if (!$root) {
29			return 0;
30			}
31			[$cnt, $queue] = [0, [$root]];
32			while ($queue) {
33			$size = count($queue);
34			while ($size-- > 0) {
35			$node = array_pop($queue);
36			if ($node->left) {
37			array_push($queue, $node->left);
38			}
39			if ($node->right) {
40			array_push($queue, $node->right);
41			}
42			}
43			$cnt++;
44			}
45
46			return $cnt;
47			}
48			}
49

imajinyun / leetcode-php

Push — master ( f04b39...21ac5d )

MaximumDepthOfBinaryTree::maxDepth() A

Complexity

Size

Duplication

Importance

Duplication Side-by-Side

Filter issues like