示例1
输入:
[1,2,4,5,3],[4,2,5,1,3]
返回值:
[1,3,5]
备注:
二叉树每个节点的值在区间[1,10000]内,且保证每个节点的值互不相同
class Solution {
public:
/**
* 代码中的类名、方法名、参数名已经指定,请勿修改,直接返回方法规定的值即可
* 求二叉树的右视图
* @param xianxu int整型vector 先序遍历
* @param zhongxu int整型vector 中序遍历
* @return int整型vector
*/
TreeNode* build(vector<int>&preOrder,vector<int>&inOrder,int preL,int preR,int inL,int inR){
if(preL>preR)return nullptr;
TreeNode* root=new TreeNode(preOrder[preL]);
int k;
for(int i=inL;i<=inR;i++){
if(inOrder[i]==preOrder[preL]){
k=i;
break;
}
}
int numLeft=k-inL;
root->left=build(preOrder,inOrder,preL+1,preL+numLeft,inL,k-1);
root->right=build(preOrder,inOrder,preL+numLeft+1,preR,k+1,inR);
return root;
}
vector<int> solve(vector<int>& xianxu, vector<int>& zhongxu) {
// write code here
int n=xianxu.size();
TreeNode* root=build(xianxu,zhongxu,0,n-1,0,n-1);
vector<int>ans;
queue<TreeNode*>q;
q.push(root);
int flag=0;
while(!q.empty()){
int n=q.size();
for(int i=0;i<n;i++){
TreeNode* temp=q.front();
q.pop();
if(i==0){
ans.push_back(temp->val);
}
if(temp->right){
q.push(temp->right);
}
if(temp->left){
q.push(temp->left);
}
}
}
return ans;
}
};