郁闷啊，怎么才能学好链表

[you_meng]

怎样用字符串代替字符呢？就是把他改成字符串型
一直做不出来~郁闷ing
#include<stdio.h>
#include<stdlib.h>
#include "1.h"
void createstack(struct intncode **headp)
{
char n;
struct intncode *p;
printf("input numbers end of 0:\n");
scanf("%c",&n);
while(n!='0')
{
p=(struct intncode *)malloc(sizeof(struct intncode));
p->data=n;
p->next=*headp;
*headp=p;
scanf("%c",&n);
}
}
void sort(void)
{
int d=0;
struct intncode *head,*p;
head=NULL;
createstack(&head);
p=head;
while(p!=NULL)
{
printf("%c",p->data);
p=p->next;
d++;
}
printf("\n");
printf("%d\n",d-1);
}
void main(void)
{
sort();
}

[xuzheng318]

#include<stdio.h>
#include<stdlib.h>
#include <string.h>
//#include "1.h"
const int MAX=20;
const char end[]={"0"};
struct intncode
{
char * data;
intncode * next;
};
void createstack(struct intncode **headp)
{
char n[20];
struct intncode *p;
printf("input numbers end of 0:\n");
scanf("%s",n);
while(strcmp(n,end))
{
p=(struct intncode *)malloc(sizeof(struct intncode));
p->data=new char [MAX];
strcpy(p->data,n);
p->next=*headp;
*headp=p;
scanf("%s",n);
}
}

void del(struct intncode **head)
{
struct intncode *p;
p=*head;
while(p)
{
*head=(*head)->next;
delete [] p->data;
delete p;
p=*head;
}
}

void sort(void)
{
int d=0;
struct intncode *head,*p;
head=NULL;
createstack(&head);
p=head;
while(p!=NULL)
{
printf(" %s ",p->data);
p=p->next;
d++;
}
printf("\n");
printf("%d\n",d-1);
del(&head);
}

void main(void)
{
sort();
}

[you_meng]

谢谢阿！各位的都很好！我们自己老师的该死的要求，没办法，就非要让我用字符串

[astrophor]

#include<stdio.h>
#include<stdlib.h>
#include <string.h>
//#include "1.h"
const int MAX=20;
const char end[]={"0"};
struct intncode
{
char * data;
intncode * next;
};
void createstack(struct intncode **headp)
{
char n[20];
struct intncode *p;
printf("input numbers end of 0:\n");
scanf("%s",n);
while(strcmp(n,end))
{
p=(struct intncode *)malloc(sizeof(struct intncode));
p->data=new char [MAX];
strcpy(p->data,n);
p->next=*headp;
*headp=p;
scanf("%s",n);
}
}
void sort(void)
{
int d=0;
struct intncode *head,*p;
head=NULL;
createstack(&head);
p=head;
while(p!=NULL)
{
printf(" %s ",p->data);
p=p->next;
d++;
}
printf("\n");
printf("%d\n",d-1);
}

void main(void)
{
sort();
}
看合不合你意

[astrophor]

最好还释放内存：

#include<stdio.h>
#include<stdlib.h>
#include <string.h>
//#include "1.h"
const int MAX=20;
const char end[]={"0"};
struct intncode
{
char * data;
intncode * next;
};
void createstack(struct intncode **headp)
{
char n[20];
struct intncode *p;
printf("input numbers end of 0:\n");
scanf("%s",n);
while(strcmp(n,end))
{
p=(struct intncode *)malloc(sizeof(struct intncode));
p->data=new char [MAX];
strcpy(p->data,n);
p->next=*headp;
*headp=p;
scanf("%s",n);
}
}

void del(struct intncode **head)
{
struct intncode *p;
p=*head;
while(p)
{
*head=(*head)->next;
delete [] p->data;
delete p;
p=*head;
}
}

void sort(void)
{
int d=0;
struct intncode *head,*p;
head=NULL;
createstack(&head);
p=head;
while(p!=NULL)
{
printf(" %s ",p->data);
p=p->next;
d++;
}
printf("\n");
printf("%d\n",d-1);
del(&head);
}

void main(void)
{
sort();
}

[zhousqy]

你的没什么问题啊

#include<stdio.h>
#include<stdlib.h>
#include "1.h"
void createstack(struct intncode **headp)
{
char n;
struct intncode *p;
printf("input numbers end of 0:\n");
scanf("%c",&n);
while(n!='0')
{
p=(struct intncode *)malloc(sizeof(struct intncode));
p->data=n;
p->next=*headp;
*headp=p;
scanf("%c",&n);
}
}
void sort(void)
{
int d=0;
struct intncode *head,*p;
head=NULL;
createstack(&head);
p=head;
while(p!=NULL)
{
printf("%c",p->data);
p=p->next;
d++;
}
printf("\n");
printf("%d\n",d-1);
}
void main(void)
{
sort();
}

[zhousqy]

上面贴错了哈
--------------
#include<stdio.h>
#include<stdlib.h>

struct intncode {
int data;
struct intncode *next;
};
void createstack(struct intncode **headp)
{
char n;
struct intncode *p;
printf("input numbers end of 0:\n");
scanf("%c",&n);
while(n!='0')
{
p=(struct intncode *)malloc(sizeof(struct intncode));
p->data=n;
p->next=*headp;
*headp=p;
scanf("%c",&n);
}
}
void sort(void)
{
int d=0;
struct intncode *head,*p;
head=NULL;
createstack(&head);
p=head;
while(p!=NULL)
{
printf("%c",p->data);
p=p->next;
d++;
}
printf("\n");
printf("%d\n",d);
}
int main(void)
{
sort();

return 0;
}