leetcode添加元素使和等于-Leetcode-Problems-Java-Python--with-Markdown-Ex...

leetcode添加元素使和等于 October 2nd Reviews 79 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. board = [ ['A','B','C','E'], ['S','F','C','S'], ['A','D','E','E'] ] class Solution(object): def dfs(self,board,word,x,y): if board[x][y] == word[0]: #如果词语已经全部找完了 if len (word[1::]) ==