【LeetCode】C# 79、Word Search

Given a 2D board and a word, find if the word exists in the grid.

The word can 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.

For example,
Given board =

[
[‘A’,’B’,’C’,’E’],
[‘S’,’F’,’C’,’S’],
[‘A’,’D’,’E’,’E’]
]
word = “ABCCED”, -> returns true,
word = “SEE”, -> returns true,
word = “ABCB”, -> returns false.

给定一块字母板，和一个单词。判断单词是否能由字母板中连续元素组成。
思路：遍历字母板，对所有能为首字母的位置进行寻找操作。用布尔组记录对应位置是否被用过。然后上下左右遍历找是否由符合条件的路径。记得循环最后要把Visit对应位置置否。

public class Solution {
    public static bool[,] visited;
        public bool Exist(char[,] board, string word)
        {
            int m = board.GetLength(0);
            int n = board.Length / board.GetLength(0);
            visited = new bool[m,n];
            for (int i = 0; i < m; i++)
            {
                for (int j = 0; j < n; j++)
                {
                    if ((word[0] == board[i, j]) && search(board, word, i, j, 0))
                    {
                        return true;
                    }
                }
            }
            return false;
        }
        private static bool search(char[,] board, string word, int i, int j, int index)
        {
            if (index == word.Length)
            {
                return true;
            }

            if (i >= board.GetLength(0) || i < 0 || j >= board.Length / board.GetLength(0) || j < 0 || board[i, j] != word[index] || visited[i,j])
            {
                return false;
            }

            visited[i,j] = true;
            if (search(board, word, i - 1, j, index + 1) ||
               search(board, word, i + 1, j, index + 1) ||
               search(board, word, i, j - 1, index + 1) ||
               search(board, word, i, j + 1, index + 1))
            {
                return true;
            }

            visited[i,j] = false;
            return false;
        }
}