# missjing/leetcode

Switch branches/tags
Nothing to show
Fetching contributors…
Cannot retrieve contributors at this time
52 lines (45 sloc) 1.51 KB
 problem： 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. ------------------------------------------------------------------------------- solution: //常用的深搜题 bool exist_aux(vector > &board, int i, int j, string word, int idx) { if(idx == word.size()) return true; if(i >= 0 && i < board.size() && j >= 0 && j < board[i].size() && board[i][j] == word[idx]) { board[i][j] = '#'; //由于题目要求每个字符只能被使用一次，因此需要做这个记号防止被重复使用 ++idx; return exist_aux(board, i + 1, j, word, idx) | exist_aux(board, i - 1, j, word, idx) | exist_aux(board, i, j + 1, word, idx) | exist_aux(board, i, j - 1, word, idx); } return false; } bool exist(vector > &board, string word) { for(int i = 0; i < board.size(); ++i) for(int j = 0; j < board[i].size(); ++j) { if(board[i][j] == word[0]) { vector > tmp(board); //每次使用一个副本，方便用于防止被重复使用所以做记号 bool ret = exist_aux(tmp, i, j, word, 0); if(ret == true) return true; //找到word时直接return，否则一直继续搜索 } } }