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.

题目原意：

给出一个二维的数组和字典中的多个单词，请在二维数组中找出所有字典中的单词。

要求每一个单词必须由连续相邻的字符组成，相邻指的是水平或者垂直两个方向，同一个字符不能在单词中使用多次。

需要注意的是：

可以假定所有的输入都由小写字母a-z组成。

解题思路：

这题需要利用到另一题的Trie的数据结构：208. Implement Trie(Prefix Tree)

链接如下：http://blog.csdn.net/gina0613/article/details/51815128

主要利用 DFS + Backtracking解题

效率分析：

时间复杂度：O(m*n*m*n)

空间复杂度：O(m*n)

代码如下：

/**
 * @param {character[][]} board
 * @param {string[]} words
 * @return {string[]}
 */
var findWords = function (board, words) {
    var ret = [];
    var trie = new Trie();

    // save words into trie
    for (var i in words) {
        trie.insert(words[i]);
    }

    var rowNum = board.length;
    var colNum = board[0].length;

    // create two dimentional array of visited
    var visited = new Array(rowNum);
    for (var j = 0; j < rowNum; j++) {
        visited[j] = new Array(colNum);
    }

    for (var m = 0; m < rowNum; m++) {
        for (var n = 0; n < colNum; n++) {
            findWordsBuilder(ret, trie, visited, m, n, board, "");
        }
    }

    return ret;
};

function findWordsBuilder(ret, trie, visited, i, j, board, item) {
    if (i < 0 || i >= board.length || j < 0 || j >= board[0].length || visited[i][j]) {
        return;
    }

    item += board[i][j];

    if (!trie.startsWith(item)) {
        return;
    }

    if (trie.search(item)) {
        if (!ret.includes(item)) {
            ret.push(item);
        }
    }

    visited[i][j] = true;

    findWordsBuilder(ret, trie, visited, i - 1, j, board, item);
    findWordsBuilder(ret, trie, visited, i + 1, j, board, item);
    findWordsBuilder(ret, trie, visited, i, j - 1, board, item);
    findWordsBuilder(ret, trie, visited, i, j + 1, board, item);

    visited[i][j] = false;
}