Leetcode 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.

Example:

Input:
board = [
[‘o’,‘a’,‘a’,‘n’],
[‘e’,‘t’,‘a’,‘e’],
[‘i’,‘h’,‘k’,‘r’],
[‘i’,‘f’,‘l’,‘v’]
]
words = [“oath”,“pea”,“eat”,“rain”]

Output: [“eat”,“oath”]

如果单纯使用回溯，那么针对每个word，都得遍历一遍二维数组，如果使用键树，那么只需要遍历一遍二维数组即可

struct TrieNode{
	bool isWord;
	TrieNode* next[26];
	TrieNode() :isWord(false){ memset(next, 0, sizeof(next)); }
};

void insert(TrieNode* root, string word) {
	TrieNode* cur = root;
	for (char ch : word){
		TrieNode* node = cur->next[ch - 'a'];
		if (node == NULL){
			cur->next[ch - 'a'] = new TrieNode();
		}
		cur = cur->next[ch - 'a'];
	}

	if (!cur->isWord) cur->isWord = true;
}

class Solution {
public:
    void helper(vector<vector<char>> board,  unordered_set<string>& ans, TrieNode* root, int i, int j, string tmp){
	char ch = board[i][j];
	if (!root->next[ch - 'a']) return;

	tmp += ch;
	if (root->next[ch - 'a']->isWord){
		ans.insert(tmp);
	}

	root = root->next[ch - 'a'];
	int dirc[] = { 0, 1, 0, -1, 0 };
	board[i][j] = ' ';
	for (int k = 0; k < 4; k++)
	{
		int x = i + dirc[k], y = j + dirc[k + 1];
		if (x >= 0 && y >= 0 && x < board.size() && y < board[i].size() && board[x][y] != ' '){
			helper(board,  ans, root, x, y, tmp);
		}
	}
	board[i][j] = ch;

}

vector<string> findWords(vector<vector<char>>& board, vector<string>& words) {
	unordered_set<string> ans;
	vector<string> vec;
	if (words.size() == 0) return vec;

	TrieNode* root = new TrieNode();
	for (string word : words)	insert(root, word);
	for (int i = 0; i < board.size(); i++)
	{
		for (int j = 0; j < board[i].size(); j++)
		{
			helper(board, ans, root, i, j, "");
		}
	}
	
	for (string str : ans) vec.push_back(str);
	return vec;
}

};

summary

1. 逐个字符查找字母或者数字的问题，使用键树，最长遍历复杂度仅为单词长度