静态单向链表学习日记01

最新推荐文章于 2023-12-22 18:13:57 发布

原创最新推荐文章于 2023-12-22 18:13:57 发布 · 935 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#静态单向链表

本文详细介绍了静态单向链表的概念，包括其结构特点、插入和删除操作的实现步骤，以及在内存管理和数据组织中的应用。通过实例解析，帮助读者深入理解静态单向链表的工作原理。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

// 3.cpp : Defines the entry point for the console application.
//
//------------------------静态单向链表示例--------------------------//
//------------------------Coded by Mr.Zeng--------------------------//
//------------------------2013/7/9----------------------------------//
#include "stdafx.h"
#include "malloc.h"
#define NULL 0
#define LEN sizeof(struct student)

struct student
{
long num;
float score;
struct student *next;
};

int n;
// 创建动态单向链表
struct student *creat(void)
{
	struct student *head;
	struct student *p1,*p2;
	n=0;
	p1=p1=(struct student*)malloc(LEN);
	scanf("%ld,%f",&p1->num,&p1->score);
	head=NULL;
	while(p1->num!=0)
	{
		n=n+1;
		if(n==1)head=p1;
		else p2->next=p1;
		p2=p1;
		p1=(struct student *)malloc(LEN);
		scanf("%ld,%f",&p1->num,&p1->score);
	}
	p2->next=NULL;
	return(head);
}
//输出链表函数
void print(struct student*head)
{
	struct student *p;
	p=head;
	printf("\nNow,these %d records are:\n",n);
	if(head!=NULL)
	do
	{
		printf("%ld%8.1f\n",p->num,p->score);
		p=p->next;
	}while(NULL!=p);
}
//删除链表结点函数
struct student*del(struct student*head,long num)
{
	struct student *p1,*p2;
	if(head==NULL) {printf("\nlist null!\n");goto end;};
	p1=head;
	while(num!=p1->num && p1->next!=NULL)
	{
		p2=p1;
		p1=p1->next;
	}
	if(num==p1->num)
	{
		if(p1==head)
			head=p1->next;
		else 
			p2->next=p1->next;
		printf("delete: %ld\n",num);
		n=n-1;
	}
	else  printf("%ld not been found! \n",num);
end:
	return (head);
}
//插入链表结点函数
struct student *insert(struct student*head,struct student *stud)
{
	struct student *p0,*p1,*p2;
	p1=head;
	p0=stud;
	if(head==NULL)
	{
		head=p0;p0->next=NULL;
	}
	else
	{
		while ((p0->num>p1->num)&& (p1->next!=NULL))
		{
			p2=p1;
			p1=p1->next;
		}
			if(p0->num<=p1->num)
			{
				if(head==p1)head=p0;
				else
					p2->next=p0;
				p0->next=p1;
			}
			else
			{
				p1->next=p0;p0->next=NULL;
			}
	}
	n=n+1;
	return (head);
}

void main ()
{
	/*struct student a,b,c,*head,*p;
	a.num=10101;a.score=89.5;
	b.num=10103;b.score=80;
	c.num=10107;c.score=75;
	head=&a;
	a.next=&b;
	b.next=&c;
	c.next=NULL;
	p=head;
	do
	{
		printf("%ld%8.1f\n",p->num,p->score);
		p=p->next;
	}while(NULL!=p);*/
	struct student *head,*stud;
	long del_num;
	head=creat();
	print(head);
	printf("\ninput the deleted number:");
    scanf("%ld",&del_num);
	while(del_num!=0)
	{
	head=del(head,del_num);
	print(head);
	printf("\ninput the deleted number:");
    scanf("%ld",&del_num);
	}
	printf("\ninput the inserted number:\n");
	stud=(struct student*)malloc(LEN);
	scanf("%ld,%f",&stud->num,&stud->score);
	while(stud->num!=0)
	{
	head=insert(head,stud);
	print(head);
	stud=(struct student*)malloc(LEN);
	printf("\ninput the inserted number:");
	scanf("%ld,%f",&stud->num,&stud->score);
	}
	print(head);
}