摘要:
#include<iostream>using namespace std;int main(){ char s1[11]; char s2[11]; while (cin >> s1 >> s2) { int ans = 0; for (int i = 0; s1[i] != 0; i++) // 阅读全文
摘要:
进行中序排序,结果是递增序列, 前序排序,跟输入一样 #include<iostream>using namespace std; struct Node //二叉树结构体{ Node*lchild; Node*rchild; int c; //保存数字} Tree[110]; //静态数组 int 阅读全文
摘要:
参考:http://blog.csdn.net/u010607031/article/details/37578957 //#include<stdio.h>#include<string.h>#include<iostream>using namespace std;const int N = 2 阅读全文