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

NQueensII::helper() A
last analyzed 2022-03-29 06:17 UTC

↳ Parent: NQueensII

Complexity

Conditions	4
Paths	6

Size

Total Lines	15
Code Lines	8

Duplication

Lines	0
Ratio	0 %

Importance

Changes	2
Bugs	0	Features	0

Metric	Value
eloc	8
c	2
b	0
f	0
dl	0
loc	15
rs	10
cc	4
nc	6
nop	3

<?php

declare(strict_types=1);

namespace leetcode;

class NQueensII
{
    public static function totalNQueens(int $n): int
    {
        $num = 0;
        $chessboard = array_fill(0, $n, 0);

        return self::helper($chessboard, 0, $num);
    }

    private static function helper(array &$chessboard, int $row, int &$num): int
    {
        if ($row === $count = count($chessboard)) {
            $num++;
        }

        for ($col = 0; $col < $count; $col++) {
            if (self::isAttackedRange($chessboard, $row, $col)) {
                $chessboard[$row] = $col;
                self::helper($chessboard, $row + 1, $num);
                $chessboard[$row] = 0;
            }
        }

        return $num;
    }

    public static function isAttackedRange(array &$chessboard, int $row, int $col): bool
    {
        for ($i = 0; $i < $row; $i++) {
            if ($col === $chessboard[$i] || abs($row - $i) === abs($col - $chessboard[$i])) {
                return false;
            }
        }

        return true;
    }
}


1			<?php
2
3			declare(strict_types=1);
4
5			namespace leetcode;
6
7			class NQueensII
8			{
9			public static function totalNQueens(int $n): int
10			{
11			$num = 0;
12			$chessboard = array_fill(0, $n, 0);
13
14			return self::helper($chessboard, 0, $num);
15			}
16
17			private static function helper(array &$chessboard, int $row, int &$num): int
18			{
19			if ($row === $count = count($chessboard)) {
20			$num++;
21			}
22
23			for ($col = 0; $col < $count; $col++) {
24			if (self::isAttackedRange($chessboard, $row, $col)) {
25			$chessboard[$row] = $col;
26			self::helper($chessboard, $row + 1, $num);
27			$chessboard[$row] = 0;
28			}
29			}
30
31			return $num;
32			}
33
34			public static function isAttackedRange(array &$chessboard, int $row, int $col): bool
35			{
36			for ($i = 0; $i < $row; $i++) {
37			if ($col === $chessboard[$i] \|\| abs($row - $i) === abs($col - $chessboard[$i])) {
38			return false;
39			}
40			}
41
42			return true;
43			}
44			}
45

imajinyun / leetcode-php

NQueensII::helper() A last analyzed 2022-03-29 06:17 UTC

Complexity

Size

Duplication

Importance

Duplication Side-by-Side

Filter issues like

NQueensII::helper() A
last analyzed 2022-03-29 06:17 UTC