Word Search
来源:互联网 发布:模糊控制算法matlab 编辑:程序博客网 时间:2024/05/26 05:53
题目:
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
参考代码:
http://www.programcreek.com/2014/06/leetcode-word-search-java/
public class Solution { public boolean exist(char[][] board, String word) { int m = board.length; int n = board[0].length; boolean result = false; for(int i=0; i<m; i++){ for(int j=0; j<n; j++){ if(dfs(board,word,i,j,0)){ result = true; } } } return result; } public boolean dfs(char[][] board, String word, int i, int j, int k){ int m = board.length; int n = board[0].length; if(i<0 || j<0 || i>=m || j>=n){ return false; } if(board[i][j] == word.charAt(k)){ char temp = board[i][j]; board[i][j]='#'; if(k==word.length()-1){ return true; }else if(dfs(board, word, i-1, j, k+1) ||dfs(board, word, i+1, j, k+1) ||dfs(board, word, i, j-1, k+1) ||dfs(board, word, i, j+1, k+1)){ return true; } board[i][j]=temp; } return false;}}
0 0
- Word Search
- Word Search
- word search
- Word Search
- Word Search
- Word Search
- Word Search
- Word Search
- Word Search
- Word Search
- Word Search
- Word Search
- Word Search
- Word Search
- Word Search
- Word Search
- Word Search
- Word Search
- Nginx Event模块
- 关于Maven的一些见解
- C# 获取操作系统相关信息
- linux文件处理命令——目录处理命令
- 二、制作第一个安卓应用
- Word Search
- CodeForces 416B Art Union
- Gson 源码分析
- In-network PCA and anomaly detection阅读笔记
- web应用配置的logback,为什么在tomcat下没日志文件出现
- 滑动窗口的最大值
- 【kmp字符串匹配】hdu 1686 Oulipo
- IOS视图切换
- ocp-31