面试题12：矩阵中的路径（回溯法）

回溯法：暴力法的升级版，它从解决问题每一步的所有可能选项里面系统地选择出一个可行的解决方案，回溯法非常适合由多个步骤组成的问题，并且每个步骤都有多个选项

#include<iostream>
using std::cin;
using std::cout;
using std::endl;

class has_Path
{
public:
	bool hasPath(const char* matrix, int rows, int cols, const char* str);
	bool hasPathCore(const char* matrix, int rows, int cols, int row, int col, const char* str, int& pathLength, bool* visited);
};
bool has_Path::hasPath(const char* matrix, int rows, int cols, const char* str)
{
	if (matrix == nullptr || rows < 1 || cols < 1 || str == nullptr)
		return false;
	bool* visited = new bool[rows * cols];//二维数组标记是否经过
	memset(visited, 0, rows * cols);//全部标记为false
	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 has_Path::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 - 1, col, 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, col + 1, str, pathLength, visited);
		if (!hasPath)
		{
			--pathLength;
			visited[row * cols + col] = false;
		}
	}
	return hasPath;
}
int main()
{
	const char* matrix = "abtgcfcsjdeh";
	const char* str = "csh";
	has_Path B;
	cout << B.hasPath(matrix, 3, 4, str);
	cin.get();
	cin.get();
	return 0;
}