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 =

[
  ["ABCE"],
  ["SFCS"],
  ["ADEE"]
]

word  =  "ABCCED" , -> returns  true ,
word  =  "SEE" , -> returns  true ,

word = "ABCB", -> returns false.

class Solution {
	public:
		int backtrace(vector<vector<char> > &board, int m, int n, string &word,
				vector<vector<int> > &flag, int r, int c, int k, int len) {
			if (k == len-1) {
				return true;
			}
			k++;
			if(r > 0){
				if(!flag[r-1][c] && board[r-1][c] == word[k]) {
					flag[r-1][c] = 1;
					if(backtrace(board, m, n, word, flag, r-1, c, k, len)) {
						return true;
					}
					flag[r-1][c] = 0;
				}
			}
			if(r < m - 1){
				if(!flag[r+1][c] && board[r+1][c] == word[k]) {
					flag[r+1][c] = 1;
					if(backtrace(board, m, n, word, flag, r+1, c, k, len)) {
						return true;
					}
					flag[r+1][c] = 0;
				}
			}
			if(c > 0){
				if(!flag[r][c-1] &&board[r][c-1] == word[k]) {
					flag[r][c-1] = 1;
					if(backtrace(board, m, n, word, flag, r, c-1, k, len)) {
						return true;
					}
					flag[r][c-1] = 0;
				}
			}
			if(c < n - 1){
				if(!flag[r][c+1] &&board[r][c+1] == word[k]) {
					flag[r][c+1] = 1;
					if(backtrace(board, m, n, word, flag, r, c+1, k, len)) {
						return true;
					}
					flag[r][c+1] = 0;
				}
			}
			return false;
		}
		bool exist(vector<vector<char> > &board, string word) {
			// Start typing your C/C++ solution below
			// DO NOT write int main() function
			int m = board.size();
			if(m < 1){
				return false;
			}
			int n = board[0].size();
			if(m < 1){
				return false;
			}
			vector<vector<int> > flag;
			int i, j;
			for(i = 0; i < m; i++){
				vector<int> v(n, 0);
				flag.push_back(v);
			}
			int len = word.size();
			for(i = 0; i<m; i++){
				for(j = 0; j < n; j++){
					if(board[i][j] == word[0]){
						flag[i][j] = 1;
						if(backtrace(board, m, n, word, flag, i, j, 0, len)) {
							return true;
						}
						flag[i][j] = 0;
					}
				}
			}
			return false;
		}
};