标签:单链表 header string create erro count rtt return data
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
struct node
{
int data;
struct node *pNext;
};
void insertTail(struct node *pH,struct node *new)
{
struct node *p=pH;
int counter=0;
while(NULL != p->pNext)
{
p=p->pNext;
counter++;
}
p->pNext=new;
pH->data=counter+1;
}
struct node *createNode(int data)
{
struct node *p = (struct node *)malloc(sizeof(struct node));
if(NULL == p)
{
printf("malloc error ! \n");
return NULL;
}
memset(p,‘\0‘,sizeof(struct node));
p->data=data;
p->pNext=NULL;
return p;
}
int main()
{
struct node *pHeader;
struct node *p,*p1,*p2;
pHeader=createNode(0);
insertTail(pHeader,createNode(1));
insertTail(pHeader,createNode(2));
insertTail(pHeader,createNode(3));
insertTail(pHeader,createNode(4));
printf("counter %d \n",pHeader->data);
printf("data %d \n",pHeader->pNext->pNext->data);
printf("hello world ! \n");
return 0;
}
标签:单链表 header string create erro count rtt return data
原文地址:https://www.cnblogs.com/zhangjianrong/p/11624181.html