Achiberx

#include <iostream> #include <cstdio> #include <cstring> #include <cmath> using namespace std; const int maxn = 10;char res[maxn];void intToString(int x) {//将数字转换为字符串。 int sum = x; int digital;

PAT1078

Suppose that all the keys in a binary tree are distinct positive integers. Given the postorder and inorder traversal sequences, you are supposed to output the level order traversal sequence of the corr

题目： Given two sets of integers, the similarity of the sets is defined to be Nc/Nt*100%, where Nc is the number of distinct common numbers shared by the two sets, and Nt is the total number of distinct