题目描述:
URL : https://oj.leetcode.com/problems/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.
这个题目的输入是一个二维的字符数组,假设为m*n,还给定一个字符序列(字符串),让你判断能否在这个二维数组中找出一个路径(只能横着走或者竖着走)和这个字符序列相同。并且保证每一个点最多只能经过一次。
拿到这道题我就觉得,我首先遍历一下这个二维数组,保存每一个字符和这个字符出现的所有