212. Word Search II

Given a 2D board and a list of words from the dictionary, find all words in the board.

Each word must be constructed from letters of sequentially adjacent cell, where "adjacent" cells are those horizontally or vertically neighboring. The same letter cell may not be used more than once in a word.

For example,
Given words = ["oath","pea","eat","rain"] and board = 

[
  ['o','a','a','n'],
  ['e','t','a','e'],
  ['i','h','k','r'],
  ['i','f','l','v']
]

Return ["eat","oath"].

 

Note:
You may assume that all inputs are consist of lowercase letters a-z.

 

Similar: 79. Word Search

 

public class Solution {
    class Trie {
        Trie[] childs;
        String word; // can not be boolean
        public Trie() {
            childs = new Trie[26];
        }
    }
    private void buildTrie(String word, Trie node) {
        for (char c : word.toCharArray()) {
            int i = c - 'a';
            if (node.childs[i]  == null) node.childs[i] = new Trie();
            node = node.childs[i];
        }
        
        node.word = word;
    }
    
    public List<String> findWords(char[][] board, String[] words) {
        if (board.length == 0 || board[0].length == 0 || words.length == 0)
            return new LinkedList<String>();
            
        LinkedList<String> ret = new LinkedList<String>();
        
        Trie root = new Trie();
        for (String word : words) {
            buildTrie(word, root);
        }
        
        for (int i = 0; i < board.length; i++) {
            for (int j = 0; j < board[0].length; j++) {
                dfs(board, root, i, j, ret);
            }
        }
        return ret;
    }
    
    private void dfs(char[][] board, Trie root, int r, int c, LinkedList<String> ret) {
        char ch = board[r][c];
        
        if (ch == '#' || root.childs[ch - 'a'] == null) return;
        
        root = root.childs[ch - 'a'];
        if (root.word != null)  {
            ret.add(root.word);
            root.word = null; // de-duplicate
        }
        
        board[r][c] = '#';
        
        if (r > 0)  dfs(board, root, r - 1, c, ret);
            
        if (r < board.length - 1) dfs(board, root, r + 1, c, ret);
            
        if (c > 0) dfs(board, root, r, c - 1, ret);
            
        if (c < board[0].length - 1) dfs(board, root, r, c + 1, ret);
        
        board[r][c] = ch;
        
    }
}