leetcode\ImplementTriePrefixTree

Complexity

Total Complexity

10

Size/Duplication

Total Lines	50
Duplicated Lines	0 %

Importance

Changes	2
Bugs	0	Features	0

4 Methods

Rating	Name	Duplication	Size	Complexity
A	startsWith()	0	12	3
A	search()	0	12	3
A	__construct()	0	3	1
A	insert()	0	12	3

<?php

declare(strict_types=1);

namespace leetcode;

use leetcode\util\TrieNode;

class ImplementTriePrefixTree
{
    /** @var \leetcode\util\TrieNode */
    private $root;

    public function __construct()
    {
        $this->root = new TrieNode();
    }

    public function insert(string $word): void
    {
        /** @var \leetcode\util\TrieNode $node */
        $node = $this->root;
        for ($i = 0, $n = strlen($word); $i < $n; $i++) {
            $value = $word[$i];
            if (!isset($node->children[$value])) {
                $node->children[$value] = new TrieNode($value);
            }
            $node = $node->children[$value];
        }
        $node->isWord = true;
    }

    public function search(string $prefix): bool
    {
        $node = $this->root;
        for ($i = 0, $n = strlen($prefix); $i < $n; $i++) {
            $value = $prefix[$i];
            if (!isset($node->children[$value])) {
                return false;
            }
            $node = $node->children[$value];
        }

        return $node->isWord;
    }

    public function startsWith(string $prefix): bool
    {
        $node = $this->root;
        for ($i = 0, $n = strlen($prefix); $i < $n; $i++) {
            $value = $prefix[$i];
            if (!isset($node->children[$value])) {
                return false;
            }
            $node = $node->children[$value];
        }

        return true;
    }
}