c语言链表的头插法

c语言链表的头插法

#define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#include <stdlib.h>
#include <string.h>

struct _NODE
{
int s_age;
char s_name[128];
struct _NODE * next;
};

struct _NODE * CreateList(void)
{
struct _NODE * phead = NULL;
return phead;
}

void PrintList(struct _NODE * phead)
{
struct _NODE * ptmp = phead;
while (ptmp)
{
printf(“age %d\n”, ptmp->s_age);
printf(“name %s\n”, ptmp->s_name);
ptmp = ptmp->next;
}
}

struct _NODE * AddNode(struct _NODE * phead, int age, char * name)
{
if (phead == NULL)
{
struct _NODE * new = (struct _NODE *) malloc(1 * sizeof(struct _NODE));
new->s_age = age;
strcpy(new->s_name, name);
new->next = NULL;

	phead = new;
	return phead;
}
else
{
	struct _NODE * new = (struct _NODE *) malloc(1 * sizeof(struct _NODE));
	
	new->s_age = age;
	strcpy(new->s_name, name);
	new->next = NULL;

	new->next = phead->next;
	phead->next = new;


	return phead;
}

}

int main(void)
{

int age;
char name[20];
int  i = 0;

struct _NODE * list = CreateList();

while (i < 3)
{
	printf("age:\n");
	scanf("%d", &age);
	getchar();

	printf("name :\n");
	gets(name);

	list = AddNode(list, age, name);
	i++;
}

PrintList(list);

system("pause");

}

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值