Eric 的小站

1
输入：root = [3,9,20,null,null,15,7]
2
输出：[[3],[20,9],[15,7]]

1
输入：root = [1]
2
输出：[[1]]

1
/**
2
 * Definition for a binary tree node.
3
 * struct TreeNode {
4
 *     int val;
5
 *     TreeNode *left;
6
 *     TreeNode *right;
7
 *     TreeNode() : val(0), left(nullptr), right(nullptr) {}
8
 *     TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
9
 *     TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
10
 * };
11
 */
12
class Solution {
13
public:
14
    vector<vector<int>> zigzagLevelOrder(TreeNode* root) {
15
        if (root == nullptr) return {};
16
        vector<TreeNode*> q;
17
        vector<vector<int>> ans;
18
        int flag = 0;
19
        q.push_back(root);
20
        while (!q.empty()) {
21
            vector<TreeNode*> vec;
22
            vector<int> temp;
23
            flag ++;
24
            for (int i = 0; i <q.size(); i++) {
25
                temp.push_back(q[i]->val);
26
                TreeNode* node = q[i];
27
                if (node->left)
28
                    vec.push_back(node->left);
29
                if (node->right)
30
                    vec.push_back(node->right);
31
            }
32
            if(flag%2==0) reverse(temp.begin(),temp.end());
33
            ans.push_back(temp);
34
            q = move(vec);
35
        }
36
        return ans;
37
    }
38
};