PAT (Advanced Level) Practise 1130 Infix Expression (25)
来源:互联网 发布:淘宝评价默认排序规则 编辑:程序博客网 时间:2024/05/19 05:04
1130. Infix Expression (25)
Given a syntax tree (binary), you are supposed to output the corresponding infix expression, with parentheses reflecting the precedences of the operators.
Input Specification:
Each input file contains one test case. For each case, the first line gives a positive integer N ( <= 20 ) which is the total number of nodes in the syntax tree. Then N lines follow, each gives the information of a node (the i-th line corresponds to the i-th node) in the format:
data left_child right_child
where data is a string of no more than 10 characters, left_child and right_child are the indices of this node's left and right children, respectively. The nodes are indexed from 1 to N. The NULL link is represented by -1. The figures 1 and 2 correspond to the samples 1 and 2, respectively.
Output Specification:
For each case, print in a line the infix expression, with parentheses reflecting the precedences of the operators. Note that there must be no extra parentheses for the final expression, as is shown by the samples. There must be no space between any symbols.
Sample Input 1:8* 8 7a -1 -1* 4 1+ 2 5b -1 -1d -1 -1- -1 6c -1 -1Sample Output 1:
(a+b)*(c*(-d))Sample Input 2:
82.35 -1 -1* 6 1- -1 4% 7 8+ 2 3a -1 -1str -1 -1871 -1 -1Sample Output 2:
(a*2.35)+(-(str%871))
题意:给一个二叉树,输出中缀表达式,且加上括号表示运算的优先级
解题思路:相当于输出中序遍历
#include <iostream>#include <cstdio>#include <cstring>#include <string>#include <algorithm>#include <cmath>#include <map>#include <set>#include <stack>#include <queue>#include <vector>#include <bitset>#include <functional>using namespace std;#define LL long longconst int INF = 0x3f3f3f3f;int n, x[30][2],visit[30],flag[30];char ch[30][20];void dfs(int k){if (x[k][0] != -1){if(!flag[x[k][0]]) printf("(");dfs(x[k][0]);if (!flag[x[k][0]]) printf(")");}printf("%s", ch[k]);if (x[k][1] != -1){if (!flag[x[k][1]]) printf("(");dfs(x[k][1]);if (!flag[x[k][1]]) printf(")");}}int main(){while (~scanf("%d", &n)){memset(visit, 0, sizeof visit);memset(flag, 0, sizeof flag);for (int i = 1; i <= n; i++){scanf("%s%d%d", &ch[i], &x[i][0], &x[i][1]);if (x[i][0] == -1 && x[i][1] == -1) flag[i] = 1;if (x[i][0] != -1) visit[x[i][0]] = 1;if (x[i][1] != -1) visit[x[i][1]] = 1;}int k;for(int i=1;i<=n;i++)if (!visit[i]) { k = i; break; }dfs(k);printf("\n");}return 0;}
- PAT (Advanced Level) Practise 1130 Infix Expression (25)
- PAT (Advanced Level) Practise 1130 Infix Expression (25)
- 【PAT】【Advanced Level】1130. Infix Expression (25)
- [PAT] (Advanced Level) Practise
- PAT (Advanced Level) Practise
- PAT (Advanced Level) Practise
- PAT (Advanced Level) Practise
- PAT (Advanced Level) Practise
- PAT (Advanced Level) Practise
- PAT (Advanced Level) Practise
- PAT (Advanced Level) Practise
- PAT (Advanced Level) Practise
- PAT (Advanced Level) Practise
- 1029. Median (25) @ PAT (Advanced Level) Practise
- PAT (Advanced Level) Practise 1032. Sharing (25)
- PAT (Advanced Level) Practise 1003. Emergency (25)
- PAT (Advanced Level) Practise 1010. Radix (25)
- PAT (Advanced Level) Practise 1003Emergency (25)
- WebStorm安装与使用
- 要跟孩子一起看的电影
- EOJ-大学生程序设计邀请赛(华东师范大学)-D-实验室传染病
- Android 与 js交互(二)
- [PAT-乙级]1031.查验身份证
- PAT (Advanced Level) Practise 1130 Infix Expression (25)
- Cookie/Session机制详解
- Unity技术面试题
- Qt中ui文件的使用
- 算法杂货铺:k均值聚类
- c++学习笔记01
- 数组中出现次数第k多的数字(求次数前k多的问题)
- TCP/IP初探
- 51Nod