[leetcode]79. Word Search(Java)

最新推荐文章于 2021-08-12 19:53:59 发布

JacobGo

最新推荐文章于 2021-08-12 19:53:59 发布

阅读量825

点赞数

分类专栏： leetcode 文章标签： Word Search leetcode Java

本文链接：https://blog.csdn.net/zjkC050818/article/details/73985724

版权

leetcode 专栏收录该内容

130 篇文章 0 订阅

订阅专栏

https://leetcode.com/problems/word-search/#/description

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 =

[
  ['A','B','C','E'],
  ['S','F','C','S'],
  ['A','D','E','E']
]

word = "ABCCED" , -> returns true ,
word = "SEE" , -> returns true ,
word = "ABCB" , -> returns false .

package go.jacob.day630;

public class Demo3 {
	/*
	 * Runtime: 11 ms.Your runtime beats 80.21 % of java submissions.
	 * 该解法不需要建立对应的isVisited数组，来记录是否访问过某元素
	 * 用异或来进行标记
	 */
	public boolean exist(char[][] board, String word) {
		if (board == null || board.length == 0 || board[0].length == 0 || board == null)
			return false;
		char[] words = word.toCharArray();
		for (int i = 0; i < board.length; i++) {
			for (int j = 0; j < board[0].length; j++) {
				if (solve(board, words, i, j, 0))
					return true;
			}
		}
		return false;
	}

	private boolean solve(char[][] board, char[] words, int i, int j, int index) {
		if (index >= words.length)
			return true;
		if (i < 0 || i >= board.length || j < 0 || j >= board[0].length || board[i][j] != words[index])
			return false;
		// 与512异或是防止递归中重复使用该元素。相当于一个标记(这里使用256,512,1024都可以)
		board[i][j] ^= 512;
		boolean flag = solve(board, words, i - 1, j, index + 1) 
				|| solve(board, words, i + 1, j, index + 1)
				|| solve(board, words, i, j - 1, index + 1) 
				|| solve(board, words, i, j + 1, index + 1);
		board[i][j] ^= 512;
		return flag;
	}
}