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

相关推荐
知彼解己3 分钟前
字符串大数相加:从初稿到优化的思路演进
java·开发语言·算法
haing201933 分钟前
使用deboor法计算三次B样条曲线在参数为u处的位置的方法介绍
算法·b样条曲线·deboor
qq_3521095234 分钟前
旋转数字矩阵 od
算法
大阳12335 分钟前
51单片机4(温度传感器DS18B20)
开发语言·单片机·嵌入式硬件·算法·51单片机
iナナ38 分钟前
Java优选算法——二分查找
数据结构·算法·leetcode
l1t1 小时前
利用美团龙猫添加xlsx的sheet.xml读取sharedStrings.xml中共享字符串输出到csv功能
xml·c语言·数据结构·人工智能·算法·解析器
宇钶宇夕2 小时前
西门子 S7-200 SMART PLC 编程:转换 / 定时器 / 计数器指令详解 + 实战案例(指令讲解篇)
运维·算法·自动化
我叫汪枫2 小时前
Spring Boot图片验证码功能实现详解 - 从零开始到完美运行
java·前端·javascript·css·算法·html
lifallen2 小时前
揭秘KafkaStreams 线程缓存:NamedCache深度解析
数据结构·算法·缓存·kafka·apache
我的知识太少了3 小时前
P1122 最大子树和
算法