LeetCode 208 Trie

class Trie {
public:
	/** Initialize your data structure here. */
	struct NODE {
		char l;
		bool wordFinish;
		struct NODE* next[26];
	};

	struct NODE* root;

	Trie() {
		root = new struct NODE();
	}

	/** Inserts a word into the trie. */
	void insert(string word) {
		struct NODE* curr = root;
		for (int i = 0; i < word.size(); i++) {
			char c = word[i];
			if (curr->next[c - 'a'] == NULL) {
				curr->next[c - 'a'] = new struct NODE();
			}
			curr = curr->next[c - 'a'];
			curr->l = c;
			if (i == word.size() - 1) {
				curr->wordFinish = true;
			}
		}
	}

	/** Returns if the word is in the trie. */
	bool search(string word) {
		struct NODE* curr = root;
		for (int i = 0; i < word.size(); i++) {
			char c = word[i];
			curr = curr->next[c - 'a'];
			if (curr == NULL) return false;
			else {
				if (i == word.size() - 1 && curr->wordFinish == true) {
					return true;
				}
				else if(i == word.size() - 1){
					return false;
				}
			}
		}

		return false;
	}

	/** Returns if there is any word in the trie that starts with the given prefix. */
	bool startsWith(string prefix) {
		struct NODE* curr = root;
		for (int i = 0; i < prefix.size(); i++) {
			char c = prefix[i];
			curr = curr->next[c - 'a'];
			if (curr == NULL) return false;
			else {
				if (i == prefix.size() - 1 ) {
					return true;
				}
			}
		}

		return false;
	}
};

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值