12:I[22016,["/_next/static/chunks/105m66vjisj_n.js","/_next/static/chunks/2gssqwqb4tebj.js","/_next/static/chunks/3nxdcf8e4npfg.js","/_next/static/chunks/44jzrszzan8w7.js","/_next/static/chunks/3tte7lhlvfih6.js","/_next/static/chunks/2htnawdik9jc3.js"],""] 13:I[3038,["/_next/static/chunks/105m66vjisj_n.js","/_next/static/chunks/2gssqwqb4tebj.js","/_next/static/chunks/3nxdcf8e4npfg.js","/_next/static/chunks/44jzrszzan8w7.js","/_next/static/chunks/3tte7lhlvfih6.js","/_next/static/chunks/2htnawdik9jc3.js"],"ProblemWorkspace"] 14:T43c,#include using namespace std; struct Node { Node* next[26] = {}; string word; }; vector findWords(vector>& board, vector& words) { Node* root = new Node(); for (string& w : words) { Node* cur = root; for (char c : w) { if (!cur->next[c - 'a']) cur->next[c - 'a'] = new Node(); cur = cur->next[c - 'a']; } cur->word = w; } int m = board.size(), n = board[0].size(); vector res; function dfs = [&](int r, int c, Node* node) { if (r < 0 || c < 0 || r >= m || c >= n || board[r][c] == '#') return; char ch = board[r][c]; Node* nxt = node->next[ch - 'a']; if (!nxt) return; if (!nxt->word.empty()) { res.push_back(nxt->word); nxt->word.clear(); } board[r][c] = '#'; dfs(r+1,c,nxt); dfs(r-1,c,nxt); dfs(r,c+1,nxt); dfs(r,c-1,nxt); board[r][c] = ch; }; for (int i = 0; i < m; i++) for (int j = 0; j < n; j++) dfs(i, j, root); return res; }15:T4c5,import java.util.*; class Solution { static class Node { Node[] next = new Node[26]; String word; } public List findWords(char[][] board, String[] words) { Node root = new Node(); for (String w : words) { Node cur = root; for (char c : w.toCharArray()) { if (cur.next[c - 'a'] == null) cur.next[c - 'a'] = new Node(); cur = cur.next[c - 'a']; } cur.word = w; } List res = new ArrayList<>(); for (int i = 0; i < board.length; i++) for (int j = 0; j < board[0].length; j++) dfs(board, i, j, root, res); return res; } private void dfs(char[][] b, int r, int c, Node node, List res) { if (r < 0 || c < 0 || r >= b.length || c >= b[0].length || b[r][c] == '#') return; char ch = b[r][c]; Node nxt = node.next[ch - 'a']; if (nxt == null) return; if (nxt.word != null) { res.add(nxt.word); nxt.word = null; } b[r][c] = '#'; dfs(b, r + 1, c, nxt, res); dfs(b, r - 1, c, nxt, res); dfs(b, r, c + 1, nxt, res); dfs(b, r, c - 1, nxt, res); b[r][c] = ch; } }