c_y_w_的博客

#include <stdio.h> #include <string.h> int main(int argc, char *argv[]) { char s[81]; int i,len,n = 0,sum= 0,t; scanf("%d",&t); while(t--) { sum = n =0; scanf("%s",s); len ...

函数接口定义： void Levelorder(BiTree T); T是二叉树树根指针，Levelorder函数输出给定二叉树的层次遍历序列，格式为一个空格跟着一个字符。其中BinTree结构定义如下：typedef char ElemType; typedef struct BiTNode { ElemType data; struct BiTNode *lchild, *rchi...

#include <stdio.h> int main() { int n,a[100000],b,e,t,sum,max; int i,j; scanf("%d",&n); for(i = 1;i<=n;i++) { int T; b = e = t = sum = 0;//每次循环记得清零，t的...