1138. Postorder Traversal (25) 二叉树前序中须转后序
来源:互联网 发布:填表软件 编辑:程序博客网 时间:2024/05/08 10:45
1138. 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:71 2 3 4 5 6 72 3 1 5 4 7 6Sample Output:
3
思路:万万没想到会考这么基础的题。。。给出二叉树的前序序列和中序序列求后序序列的第一的节点,都是基本操作
#include<cstdio>#include<vector>using namespace std;vector<int>pos;int n,pre[50000],ino[50000];void getpos(int ps,int pe,int is,int ie){if(ps>pe) return;if(ps==pe){pos.push_back(pre[pe]);}else{int i=is;while(i<ie&&ino[i]!=pre[ps]) i++;getpos(ps+1,ps+i-is,is,i-1);getpos(ps+i-is+1,pe,i+1,ie);pos.push_back(pre[ps]);}}int main(){scanf("%d",&n);for(int i=0;i<n;i++){scanf("%d",&pre[i]);}for(int i=0;i<n;i++){scanf("%d",&ino[i]);}getpos(0,n-1,0,n-1);printf("%d",pos[0]);return 0;}
- 1138. Postorder Traversal (25) 二叉树前序中须转后序
- 1138. Postorder Traversal (25)
- 1138. Postorder Traversal (25)
- 1138. Postorder Traversal (25)(前序中序,求后序)
- Binary Tree Postorder Traversal-二叉树的后序遍历
- Binary Tree Postorder Traversal 二叉树后续遍历@LeetCode
- Binary Tree Postorder Traversal 二叉树的后序遍历
- 【二叉树的后续遍历】Binary Tree Postorder Traversal
- 二叉树的后序遍历 Binary Tree Postorder Traversal
- [leetcode]Binary Tree Postorder Traversal 二叉树后序非递归遍历
- Binary Tree Postorder Traversal 二叉树的后序遍历
- Leetcode: Binary Tree Postorder Traversal(二叉树后序遍历)
- Leetcode Binary Tree Postorder Traversal 二叉树后序遍历
- 145.Binary Tree Postorder Traversal (二叉树后序遍历)
- 二叉树后序排列Binary Tree Postorder Traversal (Java)
- Binary Tree Postorder Traversal 非递归实现二叉树后序遍历
- LeetCode145——Binary Tree Postorder Traversal二叉树后序遍历
- LeetCode 145. Binary Tree Postorder Traversal(二叉树后序遍历)
- VScode炫酷敲代码插件power mode配置教程
- C#反射相关内容
- 【Scikit-Learn 中文文档】监督学习:从高维观察预测输出变量
- BZOJ 1191(二分图最大匹配)
- BZOJ2460 [BeiJing2011]元素 【线性基】
- 1138. Postorder Traversal (25) 二叉树前序中须转后序
- 众数
- 设置数据库用户权限失败
- accumulate(求和函数)
- 谨以此纪念进入程序猿的世界
- straight_insertion_sort
- python学习——通过virtualenv中安装不同版本的Python
- 巴什博奕,威佐夫博奕,尼姆博奕,斐波那契博弈模板
- 排序算法