实现 Trie (前缀树)【php版】_php 前缀树-CSDN博客

本文链接：https://blog.csdn.net/nexttrial/article/details/119447873

这篇博客介绍了如何使用PHP实现Trie字典树数据结构，包括插入单词、搜索单词和判断前缀是否存在等功能。Trie数据结构在字符串搜索和字典构建中有着高效的应用。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

<?php
class Trie {
	private $_children;
	private $_isEnd;
	/**
	 * Initialize your data structure here.
	 */
	function __construct() {
		$this->_children = [];
		$this->_isEnd = false;
	}

	/**
	 * Inserts a word into the trie.
	 * @param String $word
	 * @return NULL
	 */
	function insert($word) {
		$curNode = $this;
		for ($i=0,$len=strlen($word); $i<$len; $i++) {
			$char = $word[$i];
			if (array_key_exists($char, $curNode->_children)) {
				$curNode = $curNode->_children[$char];
			} else {
				$node = new Trie();
				$curNode->_children[$char] = $node;
				$curNode = $node;
			}
		}
		$curNode->_isEnd = true;
	}

	/**
	 * Returns if the word is in the trie.
	 * @param String $word
	 * @return Boolean
	 */
	function search($word) {
		$lastNode = $this->getLastNode($word);
		return !is_null($lastNode) && $lastNode->_isEnd == true;
	}

	private function getLastNode($word) {
		$curNode = $this;
		for ($i=0,$len=strlen($word); $i<$len; $i++) {
			$char = $word[$i];
			if (!array_key_exists($char, $curNode->_children)) {
				return null;
			}
			$curNode = $curNode->_children[$char];
		}
		return $curNode;
	}

	/**
	 * Returns if there is any word in the trie that starts with the given prefix.
	 * @param String $prefix
	 * @return Boolean
	 */
	function startsWith($prefix) {
		$lastNode = $this->getLastNode($prefix);
		return !is_null($lastNode);
	}
}

/**
 * Your Trie object will be instantiated and called as such:
 * $obj = Trie();
 * $obj->insert($word);
 * $ret_2 = $obj->search($word);
 * $ret_3 = $obj->startsWith($prefix);
 */
$obj = new Trie();
$obj->insert("abc");