LeetCode-208 Implement Trie (Prefix Tree)

题目：

mplement a trie with insert, search, and startsWith methods.
Note:
You may assume that all inputs are consist of lowercase letters a-z.

分析：

该题就是让你编写一个类 实现一个能够将一个字符串变成char组成的树，并能够判断它是否等于某个字符串。

代码：

class TrieNode {
    // Initialize your data structure here.
    private char  c;
    public TrieNode[] children;
    public boolean isWordEnd;

    public TrieNode() {
        this.children=new TrieNode[26];
        isWordEnd=false;
    }
    public TrieNode(char c){
        this();
        this.c=c;
    }
}

public class Trie {
    private TrieNode root;

    public Trie() {
        root = new TrieNode();
    }

    // Inserts a word into the trie.
    public void insert(String word) {
      char c;
      TrieNode cur=root;
      int i=0;
      for(i=0;i<word.length();i++){
          c=word.charAt(i);
         if(cur.children[c-'a']==null){
             cur.children[c-'a']=new TrieNode(c);
         }
         cur=cur.children[c-'a'];
      }
      cur.isWordEnd=true;
    }

    // Returns if the word is in the trie.
    public boolean search(String word) {
        char c;
        TrieNode cur=root;
        int i=0;
        for(;i<word.length();i++){
            c=word.charAt(i);
            cur=cur.children[c-'a'];
            if(cur == null){
                break;
            }
        }
        if(i==word.length()&&cur.isWordEnd==true){
            return true;
        }
        return false;
        
    }

    // Returns if there is any word in the trie
    // that starts with the given prefix.
    public boolean startsWith(String prefix) {
        char c;
        TrieNode cur=root;
        int i=0;
        for(;i<prefix.length();i++){
            c=prefix.charAt(i);
            cur=cur.children[c-'a'];
            if(cur == null){
                break;
            }
        }
        if(i==prefix.length()){
            return true;
        }
        return false;
    }
}

// Your Trie object will be instantiated and called as such:
// Trie trie = new Trie();
// trie.insert("somestring");
// trie.search("key");