LeetCode 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.

Example:

board =
[
  ['A','B','C','E'],
  ['S','F','C','S'],
  ['A','D','E','E']
]

Given word = "ABCCED", return true.
Given word = "SEE", return true.
Given word = "ABCB", return false.

---

这道题也是一道典型的DFS的题，要求从一个二维的字符矩阵中查找一个单词是否存在。虽然知道是DFS但我还是菜到不会写代码，看了下上次写的num of island也还是不会写，于是就去看了答案，终于大概又懂了点套路。

首先还是按行和列遍历整个矩阵，对于每个元素采用DFS，如果能从这个元素找到一个合适的路径就返回true。重点就在于这个DFS函数，正常的DFS函数的参数至少要包括这个board和row、col in