转载自: http://blog.csdn.net/ljiabin/article/details/45846527
【题目】
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
.
【解析】
参考 【LeetCode】Word Search 解题报告 ,题目变成给定一组word,检查哪个word可以由board形成。
如果还按照DFS回溯的方法,逐个检查每个word是否在board里,显然效率是比较低的。我们可以利用Trie数据结构 ,也就是前缀树。然后dfs时,如果当前形成的单词不在Trie里,就没必要继续dfs下去了。如果当前字符串在trie里,就说明board可以形成这个word。
【Java 代码】
public class Solution { Set<String> res = new HashSet<String>(); public List<String> findWords( char [][] board, String[] words) { Trie trie = new Trie(); for (String word : words) { trie.insert(word); } int m = board.length; int n = board[ 0 ].length; boolean [][] visited = new boolean [m][n]; for ( int i = 0 ; i < m; i++) { for ( int j = 0 ; j < n; j++) { dfs(board, visited, "" , i, j, trie); } } return new ArrayList<String>(res); } public void dfs( char [][] board, boolean [][] visited, String str, int x, int y, Trie trie) { if (x < 0 || x >= board.length || y < 0 || y >= board[ 0 ].length) return ; if (visited[x][y]) return ; str += board[x][y]; if (!trie.startsWith(str)) return ; if (trie.search(str)) { res.add(str); } visited[x][y] = true ; dfs(board, visited, str, x - 1 , y, trie); dfs(board, visited, str, x + 1 , y, trie); dfs(board, visited, str, x, y - 1 , trie); dfs(board, visited, str, x, y + 1 , trie); visited[x][y] = false ; } }
Trie数据结构的实现在LeetCode上也有对应的题目 Implement Trie (Prefix Tree)
【Trie实现】
class TrieNode { public TrieNode[] children = new TrieNode[ 26 ]; public String item = "" ; public TrieNode() { } } class Trie { private TrieNode root; public Trie() { root = new TrieNode(); } public void insert(String word) { TrieNode node = root; for ( char c : word.toCharArray()) { if (node.children[c - 'a' ] == null ) { node.children[c - 'a' ] = new TrieNode(); } node = node.children[c - 'a' ]; } node.item = word; } public boolean search(String word) { TrieNode node = root; for ( char c : word.toCharArray()) { if (node.children[c - 'a' ] == null ) return false ; node = node.children[c - 'a' ]; } return node.item.equals(word); } public boolean startsWith(String prefix) { TrieNode node = root; for ( char c : prefix.toCharArray()) { if (node.children[c - 'a' ] == null ) return false ; node = node.children[c - 'a' ]; } return true ; } }