#define max 100
typedef struct node{
char name[max];
char tel[max];
}seq[10];
typedef struct nod{
seq s;
int length;
}seqlist,*pseqlist;
#include"stdio.h"
#include"string.h"
#include"stdlib.h"
#include"s.h"
pseqlist chushihua(void)
{
pseqlist p;
p=(pseqlist)malloc(sizeof(seqlist));
return p;
}
//顺序表检索
int jiansuo(pseqlist p)
{
int i;
char a[10];
printf("请输入姓名:\n");
scanf("%s",a);
printf("%s\n",a);
for(i=0;i<p->length;i++)
if(strcmp((p+i)->s->name,a)==0)
return i;
}
void tianjia(pseqlist p)
{
if(p->length==100)
printf("通讯录已满\n");
else
{
printf("输入姓名:");
scanf("%s",(p+p->length)->s->name);
printf("输入电话号码:");
scanf("%s",(p+p->length)->s->tel);
p->length++;
printf("%d\n",p->length);
}
}
int main(void)
{
int i,c;
seqlist r;
pseqlist p;
p=chushihua();
p=&r;
r.length=0;
s: printf("1.顺序表长度。\n");
printf("2.顺序表检索。\n");
printf("3.顺序表的增添。\n");
fflush(stdin);
scanf("%d",&i);
switch(i)
{
case 1:
{
printf("%d\n",r.length);
}break;
case 2:
{
c=jiansuo(p);
printf("name:%s\n",r.s[c].name);
printf("tel:%s\n",r.s[c].tel);
}break;
case 3:
{
tianjia(p);
}break;
}
goto s;
return 0;
}

前两步运行没问题 新增 检索啥的都能，但是在第3,4次新增时就会出问题，

哪位盆友帮忙看看 具体哪里出了问题？谢谢了！