题目
思路
记忆化搜索+DFS
对于每个查询数组,我们可以利用dfs进行求解。对[first, second]而言,我们要确定其是否有关联,可以first开始递归,寻找到second结尾则可得到其关联关系。建立关联数组visted,初始化为0,表示为探索过;若为1,表示两者有关联;若为-1表示两者没有关联。
dfs设计:当数组值为1时,输出true;值为-1,输出false;若为0,遍历子节点,对子节点dfs,若结果为true,改变数组值为1,并输出true;若子节点结果均为false,则设置数组值为-1并输出false。(数组初始化0后,需要根据信息初始化直接关联节点间值为1)
BFS
设置点与点关系数组visited,对每个节点,进行BFS。将进行的点入队列,然后循环查询队列是否为空,若不为空,队列顶部弹出,遍历其子节点,若子节点与该节点的关系值为false时,设置其值为true并使其入队列,循环直到队空。依次对各个节点均操作一遍。
DP
设置点与点关系数组visited,根据提供的信息,初始化直接关联的节点之间的关系数组值。然后根据dp[i][j] = dp[i][j] || (dp[i][k] && dp[k][j])…进行DP操作,得到关系数组的值。
实现
记忆化搜索+DFS
class Solution {
public:
vector<bool> checkIfPrerequisite(int numCourses, vector<vector<int>>& prerequisites, vector<vector<int>>& queries) {
match = vector<vector<int>>(numCourses, vector<int>(numCourses, false));
edges.resize(numCourses);
vector<bool> ret;
for (vector<int> index : prerequisites) {
edges[index[0]].emplace_back(index[1]);
match[index[0]][index[1]] = 1;
}
for (vector<int> index : queries)
ret.emplace_back(dfs(index[0], index[1]));
return ret;
}
bool dfs(int first, int second) {
if (match[first][second] == 1)
return true;
if (match[first][second] == -1)
return false;
for (int node : edges[first])
if (dfs(node, second)) {
match[first][second] = 1;
return true;
}
match[first][second] = -1;
return false;
}
private:
vector<vector<int>> match;
vector<vector<int>> edges;
};
BFS
class Solution {
public:
vector<bool> checkIfPrerequisite(int numCourses, vector<vector<int>>& prerequisites, vector<vector<int>>& queries) {
vector<vector<int>> edges(numCourses);
vector<vector<bool>> match(numCourses, vector<bool>(numCourses));
vector<bool> ret;
queue<int> queue;
for (vector<int> index : prerequisites)
edges[index[0]].emplace_back(index[1]);
for (int i = 0; i < numCourses; ++i) {
queue.emplace(i);
while (!queue.empty()) {
int front = queue.front();
queue.pop();
for (int index : edges[front]) {
if (!match[i][index]) {
match[i][index] = true;
queue.emplace(index);
}
}
}
}
for (vector<int> index : queries)
ret.emplace_back(match[index[0]][index[1]]);
return ret;
}
};
DP
class Solution {
public:
vector<bool> checkIfPrerequisite(int numCourses, vector<vector<int>>& prerequisites, vector<vector<int>>& queries) {
vector<vector<bool>> match(numCourses, vector<bool>(numCourses));
vector<bool> ret;
for (vector<int> index : prerequisites)
match[index[0]][index[1]] = true;
for (int i = 0; i < numCourses; ++i)
for (int j = 0; j < numCourses; ++j)
for (int k = 0; k < numCourses; ++k)
match[j][k] = match[j][k] || (match[j][i] && match[i][k]);
for (vector<int> index : queries)
ret.emplace_back(match[index[0]][index[1]]);
return ret;
}
};