leetcode每日一题第156天

/**
 * 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:
    vector<vector<int>> zigzagLevelOrder(TreeNode* root) {
        vector<vector<int>> v;
        queue<TreeNode*> q;
        if(!root) return v;
        q.push(root);
        while(!q.empty())
        {
            int size = q.size();
            vector<int> vtmp;
            for(int i = 0;i<size;i++)
            {
                TreeNode* tmp = q.front();
                q.pop();
                vtmp.push_back(tmp->val);
                if(tmp->left) q.push(tmp->left);
                if(tmp->right) q.push(tmp->right);
            }
            v.push_back(vtmp);
        }
        for(int i = 0;i<v.size();i++)
        {
            if(i%2==1)
            {
                reverse(v[i].begin(),v[i].end());
            }
        }
        return v;
    }
};