Leetcode199
1.问题描述
2.解决方案
除了这两行之外,其他和102. 二叉树的层序遍历一样
也就是本题只需要将每一层的最后一个元素加入结果集即可
vector<int> ans;
ans.push_back(oneLayer[oneLayer.size()-1]);
class Solution {
public:
vector<int> rightSideView(TreeNode* root) {
vector<int> ans;
queue<TreeNode*> queue;
queue.push(root);
if(root==nullptr) return ans;
while(queue.empty()== false){
vector<int> oneLayer;
int len=queue.size();
for(int i=0;i<len;i++){
TreeNode* cur=queue.front();
queue.pop();
oneLayer.push_back(cur->val);
if(cur->left!= nullptr) queue.push(cur->left);
if(cur->right!= nullptr) queue.push(cur->right);
}
ans.push_back(oneLayer[oneLayer.size()-1]);
}
return ans;
}
};