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

AddToArrayFormOfInteger::addToArrayForm2() A
last analyzed 2022-03-29 06:17 UTC

↳ Parent: AddToArrayFormOfInteger

Complexity

Conditions	5
Paths	5

Size

Total Lines	16
Code Lines	10

Duplication

Lines	0
Ratio	0 %

Importance

Changes	2
Bugs	0	Features	0

Metric	Value
eloc	10
c	2
b	0
f	0
dl	0
loc	16
rs	9.6111
cc	5
nc	5
nop	2

<?php

declare(strict_types=1);

namespace leetcode;

class AddToArrayFormOfInteger
{
    public static function addToArrayForm(array $nums, int $k): array
    {
        if (empty($nums) || $k < 0) {
            return [];
        }
        [$ans, $n] = [[], count($nums)];
        for ($i = $n - 1; $i >= 0; $i--) {
            $sum = $nums[$i] + $k % 10;
            $k = (int) ($k / 10);
            if ($sum >= 10) {
                $k++;
                $sum -= 10;
            }
            $ans[] = (int) $sum;
        }
        for (; $k > 0; $k = (int) ($k /= 10)) {
            $ans[] = $k % 10;
        }

        return array_reverse($ans);
    }

    public static function addToArrayForm2(array $nums, int $k): array
    {
        if (empty($nums) || $k < 0) {
            return [];
        }
        $n = count($nums);
        for ($i = $n - 1; $i >= 0; $i--) {
            $ans[] = ($nums[$i] + $k) % 10;
            $k = (int) (($nums[$i] + $k) / 10);
        }
        while ($k > 0) {
            $ans[] = $k % 10;
            $k = (int) ($k / 10);
        }

        return array_reverse($ans);

    }

    public static function addToArrayForm3(array $nums, int $k): array
    {
        if (empty($nums) || $k < 0) {
            return [];
        }
        $n = count($nums);
        for ($i = $n - 1; $i >= 0 || $k > 0; $i--) {
            $ans[] = ($i >= 0 ? $nums[$i] + $k : $k) % 10;
            $k = (int) (($i >= 0 ? $nums[$i] + $k : $k) / 10);
        }

        return array_reverse($ans);

    }
}


1			<?php
2
3			declare(strict_types=1);
4
5			namespace leetcode;
6
7			class AddToArrayFormOfInteger
8			{
9			public static function addToArrayForm(array $nums, int $k): array
10			{
11			if (empty($nums) \|\| $k < 0) {
12			return [];
13			}
14			[$ans, $n] = [[], count($nums)];
15			for ($i = $n - 1; $i >= 0; $i--) {
16			$sum = $nums[$i] + $k % 10;
17			$k = (int) ($k / 10);
18			if ($sum >= 10) {
19			$k++;
20			$sum -= 10;
21			}
22			$ans[] = (int) $sum;
23			}
24			for (; $k > 0; $k = (int) ($k /= 10)) {
25			$ans[] = $k % 10;
26			}
27
28			return array_reverse($ans);
29			}
30
31			public static function addToArrayForm2(array $nums, int $k): array
32			{
33			if (empty($nums) \|\| $k < 0) {
34			return [];
35			}
36			$n = count($nums);
37			for ($i = $n - 1; $i >= 0; $i--) {
38			$ans[] = ($nums[$i] + $k) % 10;
39			$k = (int) (($nums[$i] + $k) / 10);
40			}
41			while ($k > 0) {
42			$ans[] = $k % 10;
43			$k = (int) ($k / 10);
44			}
45
46			return array_reverse($ans);
			0 ignored issues – show Comprehensibility Best Practice introduced 2021-05-03 03:21 UTC by Report Bug Copy Issue Report The variable `$ans` does not seem to be defined for all execution paths leading up to this point. Loading history...
47			}
48
49			public static function addToArrayForm3(array $nums, int $k): array
50			{
51			if (empty($nums) \|\| $k < 0) {
52			return [];
53			}
54			$n = count($nums);
55			for ($i = $n - 1; $i >= 0 \|\| $k > 0; $i--) {
56			$ans[] = ($i >= 0 ? $nums[$i] + $k : $k) % 10;
57			$k = (int) (($i >= 0 ? $nums[$i] + $k : $k) / 10);
58			}
59
60			return array_reverse($ans);
			0 ignored issues – show Comprehensibility Best Practice introduced 2021-05-03 03:21 UTC by Report Bug Copy Issue Report The variable `$ans` does not seem to be defined for all execution paths leading up to this point. Loading history...
61			}
62			}
63

imajinyun / leetcode-php

AddToArrayFormOfInteger::addToArrayForm2() A last analyzed 2022-03-29 06:17 UTC

Complexity

Size

Duplication

Importance

Duplication Side-by-Side

Filter issues like

AddToArrayFormOfInteger::addToArrayForm2() A
last analyzed 2022-03-29 06:17 UTC