2022-03-27 18:35:17 +08:00
< p > Given an < code > m x n< / code > grid of characters < code > board< / code > and a string < code > word< / code > , return < code > true< / code > < em > if< / em > < code > word< / code > < em > exists in the grid< / em > .< / p >
< p > The word can be constructed from letters of sequentially adjacent cells, where adjacent cells are horizontally or vertically neighboring. The same letter cell may not be used more than once.< / p >
< p > < / p >
2023-12-09 18:42:21 +08:00
< p > < strong class = "example" > Example 1:< / strong > < / p >
2022-03-27 18:35:17 +08:00
< img alt = "" src = "https://assets.leetcode.com/uploads/2020/11/04/word2.jpg" style = "width: 322px; height: 242px;" / >
< pre >
< strong > Input:< / strong > board = [[" A" ," B" ," C" ," E" ],[" S" ," F" ," C" ," S" ],[" A" ," D" ," E" ," E" ]], word = " ABCCED"
< strong > Output:< / strong > true
< / pre >
2023-12-09 18:42:21 +08:00
< p > < strong class = "example" > Example 2:< / strong > < / p >
2022-03-27 18:35:17 +08:00
< img alt = "" src = "https://assets.leetcode.com/uploads/2020/11/04/word-1.jpg" style = "width: 322px; height: 242px;" / >
< pre >
< strong > Input:< / strong > board = [[" A" ," B" ," C" ," E" ],[" S" ," F" ," C" ," S" ],[" A" ," D" ," E" ," E" ]], word = " SEE"
< strong > Output:< / strong > true
< / pre >
2023-12-09 18:42:21 +08:00
< p > < strong class = "example" > Example 3:< / strong > < / p >
2022-03-27 18:35:17 +08:00
< img alt = "" src = "https://assets.leetcode.com/uploads/2020/10/15/word3.jpg" style = "width: 322px; height: 242px;" / >
< pre >
< strong > Input:< / strong > board = [[" A" ," B" ," C" ," E" ],[" S" ," F" ," C" ," S" ],[" A" ," D" ," E" ," E" ]], word = " ABCB"
< strong > Output:< / strong > false
< / pre >
< p > < / p >
< p > < strong > Constraints:< / strong > < / p >
< ul >
< li > < code > m == board.length< / code > < / li >
< li > < code > n = board[i].length< / code > < / li >
< li > < code > 1 < = m, n < = 6< / code > < / li >
< li > < code > 1 < = word.length < = 15< / code > < / li >
< li > < code > board< / code > and < code > word< / code > consists of only lowercase and uppercase English letters.< / li >
< / ul >
< p > < / p >
< p > < strong > Follow up:< / strong > Could you use search pruning to make your solution faster with a larger < code > board< / code > ?< / p >
