leetcode 116. 填充每个节点的下一个右侧节点指针

墨蓝 2023-08-17 16:14 100阅读 0赞

**用队列层次遍历，过程中指一下**

#include <iostream>
    #include <vector>
    #include <stack>
    #include <queue>
    
    using namespace std;
    
    #define debug(x) cout<<#x<<": "<<x<<endl;
    
    // Definition for a Node.
    class Node { 
    public:
        int val;
        Node* left;
        Node* right;
        Node* next;
    
        Node() { }
    
        Node(int _val, Node* _left, Node* _right, Node* _next) { 
            val = _val;
            left = _left;
            right = _right;
            next = _next;
        }
    };
    
    class Solution { 
    public:
        Node* connect(Node* root) { 
            queue< Node* > qu;
            if( root == nullptr ){ 
                return root;
            }
            qu.push( root );
            qu.push( nullptr );
            //root->right = nullptr;
            while( qu.size() > 1 ){ 
                Node *temp = qu.front();
                qu.pop();
    
                if( temp == nullptr ){ 
                    qu.push( nullptr );
                }else{ 
                    if( temp->left != nullptr){ 
                        qu.push( temp->left );
                    }
                    if( temp->right != nullptr){ 
                        qu.push( temp->right );
                    }
                    if( !qu.empty() ){ 
                        temp->next = qu.front();
                    }
                }
                //debug(1)
            }
            return root;
            //if( )
        }
    };
    
    int main()
    { 
        Solution Solution1;
        Node * rt = new Node();
        Solution1.connect( rt );
        return 0;
    }

![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L0wxNTU4MTk4NzI3_size_16_color_FFFFFF_t_70]

**等华科的结果，没事干**

[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L0wxNTU4MTk4NzI3_size_16_color_FFFFFF_t_70]: /images/20230810/dc899db0eac14cada33cf5f56b387535.png