解题思路:
(1)因为矩阵每个位置都有可能是起点,因此最外围需要遍历矩阵中的每个元素,找到路径则返回
(2)首先匹配当前位置,判断两个字符是否相同,相同则继续判断它四周的元素
(3)只要四周的元素有一个匹配即可继续寻找下一个元素
(4)如果当前位置匹配而四周的元素都不能和下一元素匹配,那么这个当前位置的选择是错误的,将其设置为未访问
(5)同时长度减一,即为回溯法
class Solution {
public:
bool hasPath(char* matrix, int rows, int cols, char* str) {
if(matrix == NULL || rows < 1 || cols < 1 || str == NULL)
return false;
bool *visited = new bool[rows * cols];
memset(visited, 0, rows * cols);//一段内存为0
int pathLength = 0;
for(int row = 0; row < rows; ++row) {
for(int col = 0; col < cols; ++col) {
if(hasPathCore(matrix, rows, cols, row, col, str,
pathLength, visited)) {
return true;
}
}
}
delete[] visited;
return false;
}
bool hasPathCore(const char* matrix, int rows, int cols, int row,
int col, const char* str, int& pathLength, bool* visited) {
if(str[pathLength] == '\0')
return true;
bool hasPath = false;
if(row >= 0 && row < rows && col >= 0 && col < cols
&& matrix[row * cols + col] == str[pathLength]
&& !visited[row * cols + col]) {
++pathLength;
visited[row * cols + col] = true;
hasPath = hasPathCore(matrix, rows, cols, row, col - 1,
str, pathLength, visited)
|| hasPathCore(matrix, rows, cols, row - 1, col,
str, pathLength, visited)
|| hasPathCore(matrix, rows, cols, row, col + 1,
str, pathLength, visited)
|| hasPathCore(matrix, rows, cols, row + 1, col,
str, pathLength, visited);
if(!hasPath){
--pathLength;
visited[row * cols + col] = false;
}
}
return hasPath;
}
};