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

Note:

1. All inputs are consist of lowercase letters a-z.
2. The values of words are distinct.

方法1: trie + backtracking

思路：

struct TrieNode {
    bool isWord;
    vector<TrieNode*> children;

    TrieNode(): isWord(false), children(26, nullptr) {}
};

class Solution {
    vector<vector<int>> dirs = {{1, 0}, {-1, 0}, {0, 1}, {0, -1}};

    void dfs(vector<vector<char>>& board, int i, int j, TrieNode* root, string s,
             vector<string>& ret) {

        char t = board[i][j];
        board[i][j] = '.';
        root = root->children[t - 'a'];
        s.push_back(t);

        if (root->isWord) {
            ret.push_back(s);
            root->isWord = false;
        }
        for (auto& d : dirs) {
            int x = i + d[0];
            int y = j + d[1];
            if (x < 0 || y < 0 || x >= board.size() || y >= board[0].size() ||
                board[x][y] == '.') continue;
            if (root->children[board[x][y] - 'a']) {
                dfs(board, x, y, root, s, ret);
            }
        }
        board[i][j]  = t;
    }

public:
    vector<string> findWords(vector<vector<char>>& board, vector<string>& words) {
        TrieNode* root = new TrieNode();
        for (string& w : words) {
            TrieNode* curr = root;
            for (char c : w) {
                if (!curr->children[c - 'a']) {
                    curr->children[c - 'a'] = new TrieNode();
                }
                curr = curr->children[c - 'a'];
            }
            curr->isWord = true;
        }

        vector<string> ret;
        for (int i = 0; i < board.size(); ++i) {
            for (int j = 0; j < board[0].size(); ++j) {
                if (root->children[board[i][j] - 'a']) {
                    dfs(board, i, j, root, "", ret);
                }
            }
        }
        return ret;
    }
};