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一下

相关推荐
CoovallyAIHub9 分钟前
英伟达ViPE重磅发布!解决3D感知难题,SLAM+深度学习完美融合(附带数据集下载地址)
深度学习·算法·计算机视觉
聚客AI17 小时前
🙋‍♀️Transformer训练与推理全流程:从输入处理到输出生成
人工智能·算法·llm
大怪v20 小时前
前端:人工智能?我也会啊!来个花活,😎😎😎“自动驾驶”整起!
前端·javascript·算法
惯导马工1 天前
【论文导读】ORB-SLAM3:An Accurate Open-Source Library for Visual, Visual-Inertial and
深度学习·算法
骑自行车的码农1 天前
【React用到的一些算法】游标和栈
算法·react.js
博笙困了1 天前
AcWing学习——双指针算法
c++·算法
moonlifesudo1 天前
322:零钱兑换(三种方法)
算法
NAGNIP2 天前
大模型框架性能优化策略:延迟、吞吐量与成本权衡
算法
美团技术团队2 天前
LongCat-Flash:如何使用 SGLang 部署美团 Agentic 模型
人工智能·算法
Fanxt_Ja2 天前
【LeetCode】算法详解#15 ---环形链表II
数据结构·算法·leetcode·链表