问题:
难度:easy
说明:
给出二维数组 char[][],和需要查找的字符串,如果存在返回 true,查找的时候可以查找上下左右不重复的 串,其实这个已经做过更复杂的了。
问题链接:https://leetcode.com/problems/word-search/
相关问题:
Word Search II(二维数组找相同字符串):https://blog.csdn.net/qq_28033719/article/details/107055702
输入范围:
board
andword
consists only of lowercase and uppercase English letters.1 <= board.length <= 200
1 <= board[i].length <= 200
1 <= word.length <= 10^3
输入案例:
board =
[
['A','B','C','E'],
['S','F','C','S'],
['A','D&