Update 28. 单词搜索.md

Author: jasoncao11

28. 单词搜索.md

@@ -29,8 +29,6 @@ class Solution:
                     flag = dfs(word_ind+1, cur_i, cur_j, parsed+[[cur_i, cur_j]])
                     if flag:
                         return True
-                    else:
-                        continue
         #调用递归
         for i in range(m):
             for j in range(n):
@@ -39,4 +37,4 @@ class Solution:
                     if flag:
                         return True
         return False
-```
+```