PAT甲
程序的尽头或许就是上岸
“没有什么使我停留/除了目的/纵然岸旁有玫瑰、有绿荫、有 宁静的港湾 /我是 不系之舟 。”
展开
-
PAT A 1051
#include #include typedef struct{int a[100100];int top;}*Stack,SeqStack;int arr[10010];Stack init(){Stack ps=(Stack)malloc(sizeof(SeqStack));if(ps==NULL)return NULL;else{原创 2017-04-30 12:01:33 · 285 阅读 · 0 评论 -
PAT A1020
#include #include typedef struct BiTNode{struct BiTNode*lchild,*rchild;int data;}*BiTree;#define maxn 100int n,post[maxn],in[maxn],pre[maxn];BiTree Create(int postL,int postR,int i原创 2017-05-02 21:43:53 · 304 阅读 · 0 评论 -
PAT A 1043
#include #include #define maxn 1010typedef struct TiNode{struct TiNode *lchild,*rchild;int data;}*BiTree;int origin[maxn],pre[maxn],prem[maxn],post[maxn],postm[maxn];int pre_n=0,原创 2017-05-05 11:07:50 · 301 阅读 · 0 评论 -
PAT A1127
#include #include #define maxn 31typedef struct Node{int data;int depth;struct Node*rchild,*lchild;}*node;struct array{int len;int d[10];}arr[maxn];int n,m,post[maxn],in[ma原创 2017-05-25 20:06:24 · 427 阅读 · 0 评论 -
PAT A1086
#include #include #include #define maxn 1010typedef struct BST{struct BST *lchild, *rchild;int data;}*Bst;int n,pre[maxn],in[maxn],post[maxn];Bst create(int preL,int preR,int inL,i原创 2017-05-06 21:16:53 · 349 阅读 · 0 评论 -
PAT A 1102
#include #define maxn 11struct node{int lchild,rchild;int data;}Node[maxn];int Hash[11]={0},n,m;int change(char c){if(c=='-')return -1;//没有孩子节点else{Hash[c-'0']=1;//同时标记出现了子原创 2017-05-06 22:23:02 · 349 阅读 · 0 评论 -
PAT A 1100
#include #include int main(){int i,j,n,sum=0,flag=0,lenB=0,lenC=0,K1=0,K2=0;char str[13][5]={"tret","jan","feb","mar","apr","may","jun","jly","aug","sep","oct","nov","dec"};char String[12]原创 2017-05-19 21:42:42 · 318 阅读 · 0 评论