【面试题 & LeetCode 199】Binary Tree Right Side View

题目描述

Given a binary tree, imagine yourself standing on the right side of it, return the values of the nodes you can see ordered from top to bottom.

Example:

Input: [1,2,3,null,5,null,4]
Output: [1, 3, 4]
Explanation:

   1            <---
 /   \
2     3         <---
 \     \
  5     4       <---

思路

层序遍历过程，每次只保存当前层的最后一个数字。

代码

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */

class Solution {
public:
    vector<int> rightSideView(TreeNode* root) {
        if (root == NULL) return {};
        vector<int> res;
        queue<TreeNode*> que;
        que.push(root);
        int curcnt = 1;
        int nxtcnt = 0;
        vector<int> tmp;
        while(!que.empty()) {
            TreeNode* cur = que.front();
            que.pop();
            tmp.push_back(cur->val);
            curcnt--;
            if (cur->left != NULL) {
                que.push(cur->left);
                nxtcnt++;
            }
            if (cur->right != NULL) {
                que.push(cur->right);
                nxtcnt++;
            }
            if (curcnt == 0) {
                res.push_back(tmp[tmp.size()-1]);
                curcnt = nxtcnt;
                nxtcnt = 0;
                tmp.clear();
            }
        }
        
        return res;
    }
};

从担心找不到暑期实习，到紧锣密鼓的面试，到两手准备，到衡量offer，到焦虑学校不让返京没法暑期实习，还有现在研发和视觉两条路的不断挣扎，对终面、hr面、oc、offer的焦虑等待。
累了…