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

/*
// Definition for a Node.
class Node {
public:
    int val;
    Node* left;
    Node* right;
    Node* next;

    Node() : val(0), left(NULL), right(NULL), next(NULL) {}

    Node(int _val) : val(_val), left(NULL), right(NULL), next(NULL) {}

    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*> q;
        if(root!=NULL){
            q.push(root);
        }
        while(!q.empty()){
            Node* perCur;
            Node* cur;
            int len=q.size();
            for(int i=0;i<len;i++){
                if(i==0){
                    perCur=q.front();
                    q.pop();
                    cur=perCur;

                }else{
                    cur=q.front();
                    q.pop();
                    perCur->next=cur;
                    perCur=perCur->next;
                }
                if(cur->left!=NULL){
                    q.push(cur->left);
                }
                if(cur->right!=NULL){
                    q.push(cur->right);
                }
            }
            perCur->next=NULL;
        }
    return root;
    }
};

将原来插入队列的部分改为修改下一个指针