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

ImplementQueueUsingStacks::push() A
last analyzed 2022-03-29 06:17 UTC

↳ Parent: ImplementQueueUsingStacks

Complexity

Conditions	4
Paths	8

Size

Total Lines	11
Code Lines	7

Duplication

Lines	0
Ratio	0 %

Importance

Changes	2
Bugs	0	Features	0

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

<?php

declare(strict_types=1);

namespace leetcode;

class ImplementQueueUsingStacks
{
    private array $cache = [];
    private array $stack = [];
    private ?int $front;

    public function push(int $value): void
    {
        if (empty($this->stack)) {
            $this->front = $value;
        }
        while (!empty($this->stack)) {
            $this->cache[] = array_shift($this->stack);
        }
        $this->cache[] = $value;
        while (!empty($this->cache)) {
            $this->stack[] = array_shift($this->cache);
        }
    }

    public function pop(): ?int
    {
        $value = array_shift($this->stack);
        if (!empty($this->stack)) {
            $this->front = current($this->stack);
        }

        return $value;
    }

    public function peek(): ?int
    {
        if (empty($this->stack)) {
            return null;
        }

        return $this->front;
    }

    public function empty(): bool
    {
        return count($this->stack) === 0 && count($this->cache) === 0;
    }
}


1			<?php
2
3			declare(strict_types=1);
4
5			namespace leetcode;
6
7			class ImplementQueueUsingStacks
8			{
9			private array $cache = [];
10			private array $stack = [];
11			private ?int $front;
12
13			public function push(int $value): void
14			{
15			if (empty($this->stack)) {
16			$this->front = $value;
17			}
18			while (!empty($this->stack)) {
19			$this->cache[] = array_shift($this->stack);
20			}
21			$this->cache[] = $value;
22			while (!empty($this->cache)) {
23			$this->stack[] = array_shift($this->cache);
24			}
25			}
26
27			public function pop(): ?int
28			{
29			$value = array_shift($this->stack);
30			if (!empty($this->stack)) {
31			$this->front = current($this->stack);
32			}
33
34			return $value;
35			}
36
37			public function peek(): ?int
38			{
39			if (empty($this->stack)) {
40			return null;
41			}
42
43			return $this->front;
44			}
45
46			public function empty(): bool
47			{
48			return count($this->stack) === 0 && count($this->cache) === 0;
49			}
50			}
51

imajinyun / leetcode-php

ImplementQueueUsingStacks::push() A last analyzed 2022-03-29 06:17 UTC

Complexity

Size

Duplication

Importance

Duplication Side-by-Side

Filter issues like

ImplementQueueUsingStacks::push() A
last analyzed 2022-03-29 06:17 UTC