class Solution {
public:
vector<int> rightSideView(TreeNode* root) {
vector<int>ans;
int size = 1,i = 0;
TreeNode* p;
queue<TreeNode*>que;
if (root)
que.push(root);
while (!que.empty()) {
p = que.front(); i++;
que.pop();
if (p->left)que.push(p->left);
if (p->right)que.push(p->right);
if (i == size)//每次只需添加每一层的最右边的位置即可
size = que.size(),ans.push_back(p->val),i = 0;
}
return ans;
}
};
LeetCode 199. 二叉树的右视图
最新推荐文章于 2024-07-13 19:27:27 发布