TopKFrequentElements::topKFrequent() - Code Metrics - Inspection of "Add top-k-frequent-elements solution" - imajinyun/leetcode-php - Measure and Improve Code Quality continuously with Scrutinizer

Test Failed

Push — master ( 26fc0a...b35cc8 )

by Jinyun

created 2021-08-26 10:40 UTC

TopKFrequentElements::topKFrequent() A

↳ Parent: TopKFrequentElements

Complexity

Conditions	4
Paths	3

Size

Total Lines	14
Code Lines	8

Duplication

Lines	0
Ratio	0 %

Importance

Changes	1
Bugs	0	Features	0

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

<?php

declare(strict_types=1);

namespace leetcode;

class TopKFrequentElements
{
    public static function topKFrequent(array $nums, int $k): array
    {
        if (empty($nums) || $k <= 0) {
            return [];
        }
        $map = array_count_values($nums);
        arsort($map);

        $keys = array_keys($map);
        if ($k > count($map)) {
            return $keys;
        }

        return array_slice($keys, 0, $k);
    }

    public static function topKFrequent2(array $nums, int $k): array
    {
        if (empty($nums) || $k <= 0) {
            return [];
        }
        $ans = $map = [];
        foreach ($nums as $num) {
            $map[$num] = ($map[$num] ?? 0) + 1;
        }
        arsort($map);

        $keys = array_keys($map);
        if ($k > count($map)) {
            return $keys;
        }

        for ($i = 0; $i < $k; $i++) {
            array_push($ans, array_shift($keys));
        }

        return $ans;
    }

    public static function topKFrequent3(array $nums, int $k): array
    {
        if (empty($nums) || $k <= 0) {
            return [];
        }
        $ans = $map = [];

        $map = array_count_values($nums);
        $heap = new \SplPriorityQueue();
        foreach ($map as $key => $val) {
            $heap->insert($key, $val);
        }
        for ($i = 0; $i < $k; $i++) {
            array_push($ans, $heap->extract());
        }

        return $ans;
    }
}


1			<?php
2
3			declare(strict_types=1);
4
5			namespace leetcode;
6
7			class TopKFrequentElements
8			{
9			public static function topKFrequent(array $nums, int $k): array
10			{
11			if (empty($nums) \|\| $k <= 0) {
12			return [];
13			}
14			$map = array_count_values($nums);
15			arsort($map);
16
17			$keys = array_keys($map);
18			if ($k > count($map)) {
19			return $keys;
20			}
21
22			return array_slice($keys, 0, $k);
23			}
24
25			public static function topKFrequent2(array $nums, int $k): array
26			{
27			if (empty($nums) \|\| $k <= 0) {
28			return [];
29			}
30			$ans = $map = [];
31			foreach ($nums as $num) {
32			$map[$num] = ($map[$num] ?? 0) + 1;
33			}
34			arsort($map);
35
36			$keys = array_keys($map);
37			if ($k > count($map)) {
38			return $keys;
39			}
40
41			for ($i = 0; $i < $k; $i++) {
42			array_push($ans, array_shift($keys));
43			}
44
45			return $ans;
46			}
47
48			public static function topKFrequent3(array $nums, int $k): array
49			{
50			if (empty($nums) \|\| $k <= 0) {
51			return [];
52			}
53			$ans = $map = [];
			0 ignored issues – show Unused Code introduced 2021-08-26 10:42 UTC by Report Bug Copy Issue Report The assignment to `$map` is dead and can be removed. Loading history...
54			$map = array_count_values($nums);
55			$heap = new \SplPriorityQueue();
56			foreach ($map as $key => $val) {
57			$heap->insert($key, $val);
58			}
59			for ($i = 0; $i < $k; $i++) {
60			array_push($ans, $heap->extract());
61			}
62
63			return $ans;
64			}
65			}
66

imajinyun / leetcode-php

Push — master ( 26fc0a...b35cc8 )

TopKFrequentElements::topKFrequent() A

Complexity

Size

Duplication

Importance

Duplication Side-by-Side

Filter issues like