leetcode\ImplementQueueUsingStacks

Complexity

Total Complexity

10

Size/Duplication

Total Lines	42
Duplicated Lines	0 %

Importance

Changes	2
Bugs	0	Features	0

4 Methods

Rating	Name	Duplication	Size	Complexity
A	pop()	0	8	2
A	peek()	0	7	2
A	empty()	0	3	2
A	push()	0	11	4

<?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;
    }
}