LeetCode Top Interview Questions 212. Word Search II (Java版; Hard)
题目描述
Given a 2D board and a list of words from the dictionary, find all words in the board.
Each word must 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 in a word.
Example:
Input:
board = [
['o','a','a','n'],
['e','t','a','e'],
['i','h','k','r'],
['i','f','l','v']
]
words = ["oath","pea","eat","rain"]
Output: ["eat","oath"]
LeetCode Top Interview Questions 212. Word Search II (Java版; Hard)
welcome to my blogLeetCode Top Interview Questions 212. Word Search II (Java版; Hard)题目描述Given a 2D board and a list of words from the dictionary, find all words in the board.Each word must be con...