链表:1.尾插法 2.头插法 创建链表

1.头插法

#include <stdio.h>
#include <stdlib.h>

//头插法创建链表

struct Test
{
        int data;
        struct Test *next;
};

struct Test *insertFromHead(struct Test *head,struct Test *new)
{
	if(head == NULL){
		head = new;
		head->next = NULL;
	}else{
		new->next = head;
		head = new;
	}
        return head;
}

struct Test *createLink(struct Test *head)
{
	struct Test *new = NULL;
        printf("HINT:Enter 0 End!\n");
        while(1){
                new = (struct Test *)malloc(sizeof(struct Test));
                printf("imput your new to node data\n");
                scanf("%d",&(new->data));
                if(new->data == 0){
                        free(new);
                        return head;
                }
		head = insertFromHead(head,new);
	}
}

void printLink(struct Test *head)
{
	struct Test *p = head;
	while(p != NULL){
		printf("%d ",p->data);
		p = p->next;
	}
	putchar('\n');
}

int main()
{
	struct Test *head = NULL;
	head = createLink(head);
	printLink(head);
	struct Test t1 = {999,NULL};
	head = insertFromHead(head,&t1);
	printLink(head);
	return 0;
}

2.尾插法

#include <stdio.h>
#include <stdlib.h>

//尾插法创建链表

struct Test
{
        int data;
        struct Test *next;
};

struct Test *insertBehind(struct Test *head,struct Test *new)
{
	struct Test *p = head;
	if(p == NULL){
		head =new;
		return head; 
	}
	while(p->next != NULL){
		p = p->next;
	}
	p->next = new;
        return head;
}

struct Test *createLink(struct Test *head)
{
	struct Test *new;
        printf("HINT:Enter 0 End!\n");
        while(1){
                new = (struct Test *)malloc(sizeof(struct Test));
                printf("imput your new to node data\n");
                scanf("%d",&(new->data));
                if(new->data == 0){
                        free(new);
                        return head;
                }
		head = insertBehind(head,new);
	}
}

void printLink(struct Test *head)
{
	struct Test *p = head;
	while(p != NULL){
		printf("%d ",p->data);
		p = p->next;
	}
	putchar('\n');
}

int main()
{
	struct Test *head = NULL;
	head = createLink(head);
	printLink(head);
	return 0;
}

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值