leetcode 79. Word Search (medium)

深度搜索 + 回溯

class Solution
{
public:
	bool exist(vector<vector<char>> &board, string word)
	{
		int row = board.size();
		int col = row > 0 ? board[0].size() : 0;
		vector<vector<bool>> used(row, vector<bool>(col, false));

		for (int i = 0; i < row; i++)
		{
			for (int j = 0; j < col; j++)
			{
				if (board[i][j] == word[0])
				{
					if (dfs(board, used, word, i, j, 0))
						return true;
				}
			}
		}
        		return false;
	}
	bool dfs(vector<vector<char>> &board, vector<vector<bool>> &used, string &word, int row, int col, int index)
	{
		if (!used[row][col] && board[row][col] == word[index])
		{
			used[row][col] = true;
			if (index == word.size() - 1)
				return true;
			if (row > 0 && dfs(board, used, word, row - 1, col, index + 1))
				return true;
			if (col > 0 && dfs(board, used, word, row, col - 1, index + 1))
				return true;
			if (row < board.size() - 1 && dfs(board, used, word, row + 1, col, index + 1))
				return true;
			if (col < board[0].size() - 1 && dfs(board, used, word, row, col + 1, index + 1))
				return true;
			used[row][col] = false;
		}
		return false;
	}
};