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.

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"] .

题目大意是给定单词表，根据给定的字符矩阵，返回所有在矩阵的单词。

思路是采用字典树方法，代码如下：

struct TrieNode{
	TrieNode() : isExist(false){
		for (int i = 0; i < 26; ++i)
			children[i] = NULL;
	}
	bool isExist;
	TrieNode * children[26];
};

class Trie{
public:
	Trie(){
		root = new TrieNode();
	}

	void insert(const string & word){
		const int size = word.size();
		TrieNode * cur = root;
		for (int i = 0; i < size; ++i){
			int index = word[i] - 'a';
			if (cur->children[index] == NULL)
				cur->children[index] = new TrieNode();
			cur = cur->children[index];
		}
		cur->isExist = true;
	}

	// 1、Trie有这个单词
	// 0、Trie有这个单词，但是后面还有字母
	// -1、没有这个单词
	int search(const string & word){
		const int size = word.size();
		TrieNode * cur = root;
		for (int i = 0; i < size; ++i){
			int index = word[i] - 'a';
			if (cur->children[index] == NULL)
				return -1;
			cur = cur->children[index];
		}
		return cur->isExist ? 1 : 0;
	}

private:
	TrieNode * root;
};


class Solution {
public:
	vector<string> findWords(vector<vector<char>>& board, vector<string>& words) {
		vector<string> res;
		int rows = board.size();
		if (rows == 0) return res;
		int cols = board[0].size();
		if (cols == 0) return res;

		for (auto & word : words){
			tree.insert(word);
		}
		
		for (int i = 0; i < rows; ++i){
			for (int j = 0; j < cols; ++j){
				dfs2(board, i, j, "");
			}
		}

		for (auto & word : uset){
			res.push_back(word);
		}
		return res;
	}

private:
	Trie tree;
	unordered_set<string> uset;

	void dfs2(vector<vector<char>>& board, int i, int j, string str){
		if (i < 0 || i >= board.size() || j < 0 || j >= board[0].size() || board[i][j] == '\0')
			return;
		str += board[i][j];

		int isOK = tree.search(str);

		if (isOK == 1)  // 树里有这个字符串
			uset.insert(str);
		if (isOK == -1)  // 树无法满足这个字符串
			return;
		// isOk可能为0或1，表示还有搜寻的必要
		char t = board[i][j];
		board[i][j] = '\0';
		dfs2(board, i - 1, j, str); // left
		dfs2(board, i + 1, j, str); // right
		dfs2(board, i, j - 1, str); // up
		dfs2(board, i, j + 1, str); // down
		board[i][j] = t;

	}
};