JAVA算法练习题day53

60.单词搜索

虽然是没见过的题型，但是先思考记下难点，带着问题去看题解，然后边思考边看题解，能解答出自己当时的各种疑惑，并且代码书写过程也比较顺畅，也是一次过了。

class Solution(object):def exist(self, board, word):""":type board: List[List[str]]:type word: str:rtype: bool"""def backtracking(i,j,k):if i<0 or j<0 or i>len(board)-1 or j >len(board[0])-1 or board[i][j] == ''  or word[k]!=board[i][j]:return Falseif k == len(word)-1:return Trueboard[i][j]=''res = backtracking(i+1,j,k+1) or backtracking(i-1,j,k+1) or backtracking(i,j+1,k+1) or backtracking(i,j-1,k+1)board[i][j] = word[k]return resfor i in range(len(board)):for j  in range(len(board[0])):if backtracking(i,j,0) is True:return Truereturn False