leetcode::all_nodes_distance_k_in_binary_tree::Solution类 参考

#include <leetcode.h>

静态 Public 成员函数
static vector< int >	distanceK (TreeNode *root, TreeNode *target, int k)

详细描述

在文件 leetcode.h 第 2902 行定义.

成员函数说明

distanceK()

vector< int > leetcode::all_nodes_distance_k_in_binary_tree::Solution::distanceK ( TreeNode *  root, TreeNode *  target, int  k  )

static

在文件 leetcode.cpp 第 8010 行定义.

                                                                               {
            if(k == 0) {
                return {target->val};
            }
            unordered_map<TreeNode *, Node *> um;
            vector<int> ans;
            queue<TreeNode *> q1;
            q1.push(root);
            um[root] = new Node(root->val);
            while(!q1.empty()) {
                TreeNode *tn = q1.front();
                q1.pop();
                if(tn->left != nullptr) {
                    q1.push(tn->left);
                    um[tn->left] = new Node(tn->left->val);
                    um[tn->left]->siblings.insert(um[tn]);
                    um[tn]->siblings.insert(um[tn->left]);
                }
                if(tn->right != nullptr) {
                    q1.push(tn->right);
                    um[tn->right] = new Node(tn->right->val);
                    um[tn->right]->siblings.insert(um[tn]);
                    um[tn]->siblings.insert(um[tn->right]);
                }
            }
            Node *node = um[target];
            unordered_set<Node *> vis;
            queue<pair<int, Node *>> q2;
            q2.push({0, node});
            while(!q2.empty()) {
                auto [d, nd] = q2.front();
                q2.pop();
                vis.insert(nd);
                for(auto *sibling: nd->siblings) {
                    if(!vis.contains(sibling)) {
                        vis.insert(sibling);
                        if(d + 1 == k) {
                            ans.emplace_back(sibling->val);
                        } else {
                            q2.push({d + 1, sibling});
                        }
                    }
                }
            }
            return ans;
        }

引用了 leetcode::TreeNode::left, leetcode::TreeNode::right, acwing::acwing836_408::root , 以及 leetcode::TreeNode::val.

---

该类的文档由以下文件生成:

• leetcode.h
• leetcode.cpp