[leetcode] 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.

这道题目用的是DFS的思想

class Solution {    struct pos{int i;int j;pos(int _i , int _j):i(_i),j(_j){}};private:int m;int n;public:bool exist(vector<vector<char> > &board, string word) {// Start typing your C/C++ solution below// DO NOT write int main() functionm=board.size();n=board[0].size();vector<bool> flagt(n,false);bool (*flag)[100]=new bool[m][100];memset(flag,0,sizeof(bool)*m*100);int length=word.size();int wordp;for(int i=0 ; i<m ; i++){for(int j=0 ; j<n ; j++){wordp=0;if(board[i][j]==word[0] && DFS(board,pos(i,j),flag,word,wordp))return true;memset(flag,0,sizeof(bool)*m*100);}}return false;}bool DFS(vector<vector<char> > &board, pos cur, bool flag[][100], string &word,int p){if(p==word.size())return true;int i,j;i=cur.i,j=cur.j;if(i<0 || j<0 || i>=m || j>=n)return false;if(flag[i][j]==true)return false;flag[i][j]=true;if(board[i][j]!=word[p]){            flag[i][j]=false;return false;}if(DFS(board,pos(i+1,j),flag,word,p+1))return true;if(DFS(board,pos(i,j-1),flag,word,p+1))return true;if(DFS(board,pos(i-1,j),flag,word,p+1))return true;if(DFS(board,pos(i,j+1),flag,word,p+1))return true;return false;}};

	
				
	
					   
LeetCode: Word Search
	  	   
[Leetcode] Word Search
	  	   
LeetCode : Word Search
	  	   
Leetcode: Word Search
	  	   
[LeetCode] Word Search
	  	   
leetcode 56: Word Search
	  	   
Leetcode 79 Word Search
	  	   
[leetcode ]  word search
	  	   
[Leetcode] Word Search
	  	   
[LeetCode]Word Search
	  	   
Leetcode Word Search
	  	   
[leetcode]word search
	  	   
[leetcode] Word Search
	  	   
LeetCode-Word Search
	  	   
[LeetCode] Word Search
	  	   
LeetCode - Word Search
	  	   
leetcode word search
	  	   
LeetCode:Word Search
	     		  
	  	   
android之存储篇_SQLite存储方式
	  	   
大数 模板
	  	   
OpenGl 入门（windows）
	  	   
POJ 3253 Fence Repair
	  	   
Hibernate get和load区别
	  	   
[leetcode] Word Search
	  	   
cocos2dx  Android 多级日志系统应用
	  	   
POJ 2296 - Map Labeler 构图2-sat..注意细节...
	  	   
安装tomcat后，运行bin目录下的startup.bat后，启动浏览器在地址栏输入http://localhost:8080回车后显示不了tomcat页面的原因
	  	   
泰迪熊调试法
	  	   
hadoop, hbase, zookeeper集群搭建
	  	   
#ifndef __IPHONE_X_X
	  	   
mongo 学习一 mongodb 在ubuntu上安装
	  	   
读取input:file的路径并显示本地的图片