Leetcod graph(new topic)

797. All Paths From Source to Target

cpp 复制代码
class Solution {
private:
    vector<vector<int>> res;
    void traversal(vector<vector<int>>& graph, vector<int>& path, int s){
        path.push_back(s);
        int n=graph.size();
        if(s == n-1){
            res.push_back(path);
        }
        for(auto v:graph[s]){
            traversal(graph, path, v);
        }
        path.pop_back();
    }
public:
    vector<vector<int>> allPathsSourceTarget(vector<vector<int>>& graph) {
        vector<int> path;
        traversal(graph, path, 0);
        return res;
   

类似于多叉树

这里的s是记录正在走的节点

如果不是acyclic(无环), 要用另外一个vector 记录走过的节点,防止进入死循环

277. Find the Celebrity

cpp 复制代码
class Solution {
public:
    int findCelebrity(int n) {
        int cand = 0;
        for(int other = 1; other < n; other++){
            if(knows(cand, other) || !knows(other, cand)){
                cand = other;
            }
        }

        for(int other = 0; other<n; other++){
            if(cand == other) continue;
            if(knows(cand, other) || !knows(other, cand)) return -1;
        }
        return cand;
    }
};

1.首先要排除,因为条件,所以至多有一个名人,那么两两对比,选出唯一的可能是名人的那个人

2.对比的结果有四种

3.最后剩下的那一个也不一定是名人,要在判断

207. Course Schedule

1.DFS

cpp 复制代码
class Solution {
private:
    bool hasCycle = false;
    vector<bool> onPath;
    vector<bool> visited;
    vector<vector<int>> buildGraph(int numCourses, vector<vector<int>>& prerequisites){
        vector<vector<int>> graph(numCourses);
        for(auto prerequisite:prerequisites){
            int from = prerequisite[1];
            int to = prerequisite[0];
            graph[from].push_back(to);
        }
        return graph;
    }
    void traversal(vector<vector<int>>& graph, int s){
        if(onPath[s]){
            hasCycle = true;
        }
        if(visited[s] || hasCycle){
            return;
        }
        visited[s] = true;
        onPath[s] = true;
        for(auto t:graph[s]){
            traversal(graph, t);
        }
        onPath[s] = false;
    }
public:
    bool canFinish(int numCourses, vector<vector<int>>& prerequisites) {
        vector<vector<int>> graph = buildGraph(numCourses, prerequisites);
        visited = vector<bool>(numCourses);
        onPath = vector<bool>(numCourses);
        for(int i=0; i<numCourses; i++){
            traversal(graph, i);
        }
        return !hasCycle;
    }
};

1.首先要建一个graph表

2.遍历判断是否有环

210. Course Schedule II

cpp 复制代码
class Solution {
private:
    vector<int> res;
    bool hasCycle;
    vector<bool> visited, onPath;

    void traversal(vector<vector<int>>& graph, int s){
        if(onPath[s]){
            hasCycle = true;
        }
        if(visited[s] || hasCycle) return;
        onPath[s] = true;
        visited[s] = true;

        for(int t:graph[s]){
            traversal(graph, t);
        }
        res.push_back(s);
        onPath[s] = false;
    }

    vector<vector<int>> buildGraph(int numCourses, vector<vector<int>>& prerequisites){
        vector<vector<int>> graph(numCourses);
        for(auto prerequisite:prerequisites){
            int from = prerequisite[1];
            int to = prerequisite[0];
            graph[from].push_back(to);
        }
        return graph;
    }
public:
    vector<int> findOrder(int numCourses, vector<vector<int>>& prerequisites) {
        vector<vector<int>> graph = buildGraph(numCourses, prerequisites);
        visited = vector<bool>(numCourses, false);
        onPath = vector<bool>(numCourses, false);
        for(int i=0; i<numCourses; i++){
            traversal(graph, i);
        }
        if(hasCycle) return {};
        reverse(res.begin(), res.end());
        return res;
    }
};

需要一个单独的vector记录

这里用的是后序,所以之后要reverse一下

相关推荐
呆呆的小鳄鱼10 分钟前
leetcode:冗余连接 II[并查集检查环][节点入度]
算法·leetcode·职场和发展
墨染点香11 分钟前
LeetCode Hot100【6. Z 字形变换】
java·算法·leetcode
沧澜sincerely12 分钟前
排序【各种题型+对应LeetCode习题练习】
算法·leetcode·排序算法
CQ_071212 分钟前
自学力扣:最长连续序列
数据结构·算法·leetcode
弥彦_28 分钟前
cf1925B&C
数据结构·算法
YuTaoShao1 小时前
【LeetCode 热题 100】994. 腐烂的橘子——BFS
java·linux·算法·leetcode·宽度优先
Wendy14418 小时前
【线性回归(最小二乘法MSE)】——机器学习
算法·机器学习·线性回归
拾光拾趣录8 小时前
括号生成算法
前端·算法
渣呵9 小时前
求不重叠区间总和最大值
算法
拾光拾趣录9 小时前
链表合并:双指针与递归
前端·javascript·算法