Leetcode 6154. 感染二叉树需要的总时间

最新推荐文章于 2024-07-21 08:37:44 发布

qq_39240107

最新推荐文章于 2024-07-21 08:37:44 发布

阅读量1.2k

点赞数

文章标签： leetcode 算法职场和发展

本文链接：https://blog.csdn.net/qq_39240107/article/details/126453819

版权

https://leetcode.cn/problems/amount-of-time-for-binary-tree-to-be-infected/

将二叉树转换成无向图进行处理，从start节点进行BFS, 记录每个节点被感染的时刻

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode() : val(0), left(nullptr), right(nullptr) {}
 *     TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
 *     TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
 * };
 */
class Solution {
public:
    int amountOfTime(TreeNode* root, int start) {
        if(root==nullptr) return 0;
        vector<vector<int>> graph(100001);
        queue<TreeNode*> q;
        q.push(root);
        int res(0);
        while(!q.empty()){
            auto cur=q.front();
            q.pop();
            if(cur->left){
                graph[cur->val].push_back(cur->left->val);
                graph[cur->left->val].push_back(cur->val);
                q.push(cur->left);
            }
            if(cur->right){
                graph[cur->val].push_back(cur->right->val);
                graph[cur->right->val].push_back(cur->val);
                q.push(cur->right);
            }
        }
        vector<int> visit(100001,-1);
        queue<int> que;
        que.push(start);
        visit[start]=0;
        while(!que.empty()){
            auto cur=que.front();
            que.pop();
            for(auto i:graph[cur]){
                if(visit[i]==-1) {
                    visit[i]=visit[cur]+1;
                    res=max(res,visit[i]);
                    que.push(i);
                }
            }
        }
        return res;
    }
};