Eric 的小站

1
输入: [1,2,3,null,5,null,4]
2
输出: [1,3,4]

1
输入: [1,null,3]
2
输出: [1,3]

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),
10
 * right(right) {}
11
 * };
12
 */
13
class Solution {
14
public:
15
    vector<int> rightSideView(TreeNode* root) {
16
        if (root == nullptr) return {};
17
        vector<TreeNode*> q;
18
        vector<int> ans;
19
        q.push_back(root);
20
        while (!q.empty()) {
21
            vector<TreeNode*> vec;
22
            for (int i = 0; i <q.size(); i++) {
23
                TreeNode* node = q[i];
24
                if (node->left)
25
                    vec.push_back(node->left);
26
                if (node->right)
27
                    vec.push_back(node->right);
28
            }
29
            ans.push_back(q[q.size()-1]->val);
30
            q = move(vec);
31
        }
32
        return ans;
33
    }
34
};