1138. Postorder Traversal (25)(前序中序,求后序)
来源:互联网 发布:罗志祥潮牌 知乎 编辑:程序博客网 时间:2024/05/20 04:11
- Postorder Traversal (25)
Suppose that all the keys in a binary tree are distinct positive integers. Given the preorder and inorder traversal sequences, you are supposed to output the first number of the postorder traversal sequence of the corresponding binary tree.
Input Specification:
Each input file contains one test case. For each case, the first line gives a positive integer N (<=50000), the total number of nodes in the binary tree. The second line gives the preorder sequence and the third line gives the inorder sequence. All the numbers in a line are separated by a space.
Output Specification:
For each test case, print in one line the first number of the postorder traversal sequence of the corresponding binary tree.
Sample Input:
7
1 2 3 4 5 6 7
2 3 1 5 4 7 6
Sample Output:
3
#include<iostream>using namespace std;int per[50005],in[50005],post[50005];int index=0;int n;void fun(int x[],int y[],int len){ if (len<=0) { return ; } else { int k=0; for (int i=0;i<len;i++) { if (y[i]==x[0]) { k=i; break; } } if (index!=0) return ; fun(x+1,y,k); fun(x+k+1,y+k+1,len-k-1); post[index++]=x[0]; }}int main(){ cin>>n; for (int i=0;i<n;i++) cin>>per[i]; for(int i=0;i<n;i++) cin>>in[i]; fun(per,in,n); cout<<post[0]; return 0;}
阅读全文
0 0
- 1138. Postorder Traversal (25)(前序中序,求后序)
- 1138. Postorder Traversal (25)
- 1138. Postorder Traversal (25)
- 1138. Postorder Traversal (25) 二叉树前序中须转后序
- (leetcode )Binary Tree Postorder Traversal
- 145. Binary Tree Postorder Traversal(Tree)
- Binary Tree Postorder Traversal
- Binary Tree Postorder Traversal
- Binary Tree Postorder Traversal
- Binary Tree Postorder Traversal
- Binary Tree Postorder Traversal
- Binary Tree Postorder Traversal
- Binary Tree Postorder Traversal
- Binary Tree Postorder Traversal
- Binary Tree Postorder Traversal
- Binary Tree Postorder Traversal
- Binary Tree Postorder Traversal
- Binary Tree Postorder Traversal
- JavaScript数组使用大全
- 月份天数的输入
- Sqli-labs2-5单引号变形,双引号,双注入
- 最大似然估计和最大后验概率估计
- 下标序列与斜率优化
- 1138. Postorder Traversal (25)(前序中序,求后序)
- Ada的另一个身份--计算机语言
- 求两个正整数的最大公约数
- Nginx之——日志按日期分割的实现(基于CentOS操作系统)
- [POJ](3255)Roadblocks---- 最(次)短路径(邻接表+dijkstra优先队列优化)
- 简单的介绍一下python
- python基础学习(5)—数据结构
- 会话技术-session(十八)
- 家族