PAT - - 1130. Infix Expression (중 괄호)
5473 단어 PAT데이터 구조 - 이 진 트 리
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 7 a -1 -1 * 4 1 + 2 5 b -1 -1 d -1 -1 - -1 6 c -1 -1 Sample Output 1: (a+b)(c(-d)) Sample Input 2: 8 2.35 -1 -1 * 6 1 - -1 4 % 7 8 + 2 3 a -1 -1 str -1 -1 871 -1 -1 Sample Output 2: (a*2.35)+(-(str%871))
해제
중 괄호.
#include
#include
#include
#include
#include
using namespace std;
const int maxn = 200 + 5;
struct Node{
string val;
int left, right;
};
Node nodes[maxn];
int n, root_num;
int numbers[maxn];
void infix(int root){
if(root == -1) return;
if(root != root_num && (nodes[root].left != -1 || nodes[root].right != -1)) cout << "(";
infix(nodes[root].left);
cout << nodes[root].val;
infix(nodes[root].right);
if(root != root_num && (nodes[root].left != -1 || nodes[root].right != -1)) cout << ")";
}
string infix1(int root){
if(root == -1) return "";
if(nodes[root].right != -1){
nodes[root].val = infix1(nodes[root].left) + nodes[root].val + infix1(nodes[root].right);
if(root != root_num) nodes[root].val = "(" + nodes[root].val + ")";
}
return nodes[root].val;
}
int main(){
#ifndef ONLINE_JUDGE
freopen("data.in", "r", stdin);
#endif // ONLINE_JUDGE
cin >> n;
string val; int left, right;
for(int i = 1; i <= n; ++i){
cin >> val >> left >> right;
nodes[i] = Node{val, left, right};
if(left != -1) numbers[left] = 1;
if(right != -1) numbers[right] = 1;
}
// find the root of the tree
for(int i = 1; i <= n; ++i) if(!numbers[i]) root_num = i;
cout << infix1(root_num) << endl;
// infix(root_num);
return 0;
}
이 내용에 흥미가 있습니까?
현재 기사가 여러분의 문제를 해결하지 못하는 경우 AI 엔진은 머신러닝 분석(스마트 모델이 방금 만들어져 부정확한 경우가 있을 수 있음)을 통해 가장 유사한 기사를 추천합니다:
PAT A 1049. Counting Ones (30)제목 The task is simple: given any positive integer N, you are supposed to count the total number of 1's in the decimal fo...
텍스트를 자유롭게 공유하거나 복사할 수 있습니다.하지만 이 문서의 URL은 참조 URL로 남겨 두십시오.
CC BY-SA 2.5, CC BY-SA 3.0 및 CC BY-SA 4.0에 따라 라이센스가 부여됩니다.