79. Word Search

class Solution {
public:
    int m, n;
    bool exist(vector<vector<char>>& board, string word) {
        m = board.size(); if (m == 0)   return false;
        n = board[0].size();  if (n == 0)   return false;
        for (int i = 0; i < m; i++)
            for (int j = 0; j < n; j++)
                if (dfs(board, word, 0, i, j))
                    return true;
        return false;
    }
    bool dfs(vector<vector<char>>& board, string& word, int begin, int i, int j) {
        static int dirs[] = { -1, 0, 1, 0, -1};
        if (begin == word.length()) return true;
        if (i < 0 || i >= m || j < 0 || j >= n || board[i][j] != word[begin])
            return false;
        char saved = board[i][j];
        board[i][j] = ‘ ‘;
        for (int k = 0; k < 4; k++) {
            if (dfs(board, word, begin+1, i+dirs[k], j+dirs[k+1]))
                return true;
        }
        board[i][j] = saved;
        return false;
    }
};