前缀树Java实现

---

前言

数据结构和算法笔记

---

一、前缀树

原题：添加链接描述

/**
 * 前缀树的实现
 *
 * 一共26个英文字母
 * 
 * 每个英文字符都是一个Trie结点，Trie的子节点为children 
 * 一共有26个子节点，用数组存储
 */
class Trie {

    private Trie[] children;
    private boolean isEnd;

    /** Initialize your data structure here. */
    public Trie() {
        children = new Trie[26];
        isEnd = false;
    }


    /** Inserts a word into the trie. */
    public void insert(String word) {
        Trie node = this;
        char[]  charArr = word.toCharArray();
        for (char aCharArr : charArr) {
            int index = aCharArr - 'a';
            if (node.children[index] == null) {
                node.children[index] = new Trie();
            }
            node = node.children[index];
        }
        node.isEnd = true;
    }

    /**
     * 从字典树的根开始，查找前缀。
     *
     * 对于当前字符对应的子节点，有两种情况：
         子节点存在。沿着指针移动到子节点，继续搜索下一个字符。
         子节点不存在。说明字典树中不包含该前缀，返回空指针。
         重复以上步骤，直到返回空指针或搜索完前缀的最后一个字符。
             存在则返回   true ;
             不存在则返回 false;
     * */
    public boolean search(String word) {
        Trie node = searchPrefix(word);
        return  node!=null && node.isEnd;
    }

    /**
     * 搜索前缀
     * @param prefix 前缀
     * @return 结点
     */
    private Trie searchPrefix(String prefix){
        Trie node = this;
        char[] charArr = prefix.toCharArray();
        for(char item:charArr){
            int index = item-'a';
            if(node.children[index]!=null){
                node = node.children[index];
            }else{
                return null;
            }
        }
        return node;
    }
    /** Returns if there is any word in the trie that starts with the given prefix. */
    public boolean startsWith(String prefix) {
        Trie node = searchPrefix(prefix);
        return  node!=null;
    }
}

二、前缀数2

原题：[添加链接描述](https://leetcode.cn/problems/word-search-ii/solution/dan-ci-sou-suo-ii-by-leetcode-solution-7494/)

class Solution {
    int[][] dirs = {{1, 0}, {-1, 0}, {0, 1}, {0, -1}};

    public List<String> findWords(char[][] board, String[] words) {
        Trie trie = new Trie();
        for (String word : words) {
            trie.insert(word);
        }

        Set<String> ans = new HashSet<String>();
        for (int i = 0; i < board.length; ++i) {
            for (int j = 0; j < board[0].length; ++j) {
                dfs(board, trie, i, j, ans);
            }
        }

        return new ArrayList<String>(ans);
    }

    public void dfs(char[][] board, Trie now, int i1, int j1, Set<String> ans) {
        if (!now.children.containsKey(board[i1][j1])) {
            return;
        }
        char ch = board[i1][j1];
        now = now.children.get(ch);
        if (!"".equals(now.word)) {
            ans.add(now.word);
        }

        board[i1][j1] = '#';
        for (int[] dir : dirs) {
            int i2 = i1 + dir[0], j2 = j1 + dir[1];
            if (i2 >= 0 && i2 < board.length && j2 >= 0 && j2 < board[0].length) {
                dfs(board, now, i2, j2, ans);
            }
        }
        board[i1][j1] = ch;
    }
}

class Trie {
    String word;
    Map<Character, Trie> children;
    boolean isWord;

    public Trie() {
        this.word = "";
        this.children = new HashMap<Character, Trie>();
    }

    public void insert(String word) {
        Trie cur = this;
        for (int i = 0; i < word.length(); ++i) {
            char c = word.charAt(i);
            if (!cur.children.containsKey(c)) {
                cur.children.put(c, new Trie());
            }
            cur = cur.children.get(c);
        }
        cur.word = word;
    }
}

---

总结