leetcode\ImplementStackUsingQueues

Complexity

Total Complexity

8

Size/Duplication

Total Lines	37
Duplicated Lines	0 %

Importance

Changes	2
Bugs	0	Features	0

4 Methods

Rating	Name	Duplication	Size	Complexity
A	push()	0	9	2
A	pop()	0	7	2
A	empty()	0	3	2
A	top()	0	7	2

<?php

declare(strict_types=1);

namespace leetcode;

class ImplementStackUsingQueues
{
    private array $cache = [];
    private array $queue = [];

    public function push(int $value): void
    {
        $this->cache[] = $value;
        while (count($this->queue)) {
            $this->cache[] = array_shift($this->queue);
        }
        $tmp = $this->cache;
        $this->cache = $this->queue;
        $this->queue = $tmp;
    }

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

        return array_shift($this->queue);
    }

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

        return current($this->queue);
    }

    public function empty(): bool
    {
        return empty($this->queue) && empty($this->cache);
    }
}