# Hard-题目48：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.

public class Solution {
public List<String> findWords(char[][] board, String[] words) {
List<String> res = new ArrayList<>();
TrieNode root = buildTrie(words);
for(int i = 0; i < board.length; i++) {
for(int j = 0; j < board[0].length; j++) {
dfs(board, i, j, root, res);
}
}
return res;
}

public void dfs(char[][] board, int i, int j, TrieNode p, List<String> res) {
char c = board[i][j];
if(c == '#' || p.next[c - 'a'] == null) return;
p = p.next[c - 'a'];
if(p.word != null) {   // found one
p.word = null;     // de-duplicate
}

board[i][j] = '#';
if(i > 0) dfs(board, i - 1, j ,p, res);
if(j > 0) dfs(board, i, j - 1, p, res);
if(i < board.length - 1) dfs(board, i + 1, j, p, res);
if(j < board[0].length - 1) dfs(board, i, j + 1, p, res);
board[i][j] = c;
}

public TrieNode buildTrie(String[] words) {
TrieNode root = new TrieNode();
for(String w : words) {
TrieNode p = root;
for(char c : w.toCharArray()) {
int i = c - 'a';
if(p.next[i] == null) p.next[i] = new TrieNode();
p = p.next[i];
}
p.word = w;
}
return root;
}

class TrieNode {
TrieNode[] next = new TrieNode[26];
String word;
}
}

19ms,91.42%,21ms，4.36%

#### leetcode 212: Word Search II

2015-05-20 06:34:38

#### [leetcode] 212. Word Search II

2016-06-02 15:57:17

#### 【LeetCode】Word Search II 解题报告

2015-05-19 16:52:33

#### [leetcode] 212. Word Search II 解题报告

2016-03-29 08:53:39

#### LeetCode 212. Word Search II（单词搜索）

2016-05-05 03:14:10

#### leetcode 212. Word Search II(单词搜索 II)

2018-04-08 15:09:01

#### 212. Word Search II--python

2016-10-21 16:06:36

#### LeetCode OJ 之 Word Search II （单词搜索 - 二）

2015-08-03 14:28:48

#### 212. Word Search II

2016-06-25 21:55:38

#### Leetcode 212. Word Search II

2017-03-07 15:28:58