当前位置:首页 > 开发 > 编程语言 > 编程 > 正文

Word Search

发表于: 2015-07-03   作者:hcx2013   来源:转载   浏览:
摘要: 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 ve

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.

 

public class Solution {
    public boolean exist(char[][] board, String word) {
        int rows = board.length;
        int cols = board[0].length;
        boolean[][] visit = new boolean[rows][cols];
        for (int i = 0; i < rows; i++) {
        	for (int j = 0; j < cols; j++) {
        		if (dfs(board, word, 0, i, j, visit)) {
        			return true;
        		}
        	}
        }
        return false;
    }

	private boolean dfs(char[][] board, String word, int cnt, int rowindex, int colindex,
			boolean[][] visit) {
		if (cnt == word.length()) {
			return true;
		}
		if (rowindex < 0 || colindex < 0 || rowindex >= board.length || colindex >= board[0].length) {
			return false;
		}
		if (visit[rowindex][colindex])  {
			return false;
		}
		if (board[rowindex][colindex] != word.charAt(cnt)) {
			return false;
		}
		visit[rowindex][colindex] = true;
		boolean res = (dfs(board, word, cnt+1, rowindex+1, colindex, visit)
				|| dfs(board, word, cnt+1, rowindex, colindex+1, visit)
				|| dfs(board, word, cnt+1, rowindex-1, colindex, visit)
				|| dfs(board, word, cnt+1, rowindex, colindex-1, visit));
		visit[rowindex][colindex] = false;
		return res;
	}
}

 

Word Search

  • 0

    开心

    开心

  • 0

    板砖

    板砖

  • 0

    感动

    感动

  • 0

    有用

    有用

  • 0

    疑问

    疑问

  • 0

    难过

    难过

  • 0

    无聊

    无聊

  • 0

    震惊

    震惊

版权所有 IT知识库 CopyRight © 2009-2015 IT知识库 IT610.com , All Rights Reserved. 京ICP备09083238号