2024.2.2 作业

1、堆区和栈区的区别

2、编程题目

#include<stdio.h>
#include<string.h>
#include<stdlib.h>
int delete(int *p,int element,int len)
{
	int j=0;
	for(int i=0;i<len;i++)
	{
		if(element!=*(p+i))
		{
			*(p+j)=*(p+i);
			j++;
		}
	}
	return j;
}
int main(int argc, const char *argv[])
{
	int n;
	printf("please enter n:");
	scanf("%d",&n);
	int arr[n];
	for(int i=0;i<n;i++)
	{
		printf("please enter the %dth num:",i+1);
		scanf("%d",&arr[i]);
	}
	int len=sizeof(arr)/sizeof(arr[0]);
	for(int i=0;i<len;i++)
	{
		printf("%-4d",arr[i]);
	}
	puts("");
	int element;
	printf("please enter the delete element:");
	scanf("%d",&element);
	len=delete(arr,element,len);
	printf("the length of arr[] is :%d\n",len);
	printf("the new arr is:");
	for(int i=0;i<len;i++)
	{
		printf("%-4d",arr[i]);
	}
	puts("");
	return 0;
}

3、单链表的头插头删、尾插尾删

#include<stdio.h>
#include<string.h>
#include<stdlib.h>
typedef int datatype;
typedef struct node
{
	//数据域
	int data;
	//指针域
	struct node *next;
}*Linklist;
Linklist create()
{
	Linklist s=(Linklist)malloc(sizeof(struct node));
	if(s==NULL)
		return NULL;
	s->data=0;
	s->next=NULL;
	return s;
}
Linklist head_insert(Linklist head,datatype element)
{
	Linklist s=create();
	s->data=element;
	if(NULL==head)
	{
		head=s;
	}
	else
	{
		s->next=head;
		head=s;
	}
	return head;
}
int length(Linklist head)
{
	datatype len=0;
	Linklist p=head;
	while(p)
	{
		len++;
		p=p->next;
	}
	return len;
}
void output(Linklist head)
{
	if(head==NULL)
	{
		puts("empty!");
		return;
	}
	Linklist p=head;
	while(p!=NULL)
	{
		printf("%-5d",p->data);
		p=p->next;
	}
	puts("");
}
//头删
Linklist head_delete(Linklist head)
{
	if(head==NULL)
		return NULL;
	else
	{
		Linklist del=head;
		head=head->next;
		free(del);
		del=NULL;
	}
	return head;
}
Linklist rear_insert(Linklist head,datatype element)
{
	Linklist p=head;
	Linklist s=create();
	s->data=element;
	if(head==NULL)
	{
		head=s;
	}
	else
	{
		while(p->next!=NULL)
		{
			p=p->next;
		}
		p->next=s;
	}
	return head;

}
Linklist rear_delete(Linklist head)
{
	Linklist p=head;
	if(head==NULL)
		return NULL;
	else
	{
		while(p->next==NULL)
		{
			free(head);
			head=NULL;
			return head;
		}
		while(p->next->next!=NULL)
		{
			p=p->next;
		}
		Linklist del=p->next;
		free(del);
		p->next=NULL;
	}
	return head;
}
int main(int argc, const char *argv[])
{
	Linklist head=NULL;
	datatype element;
	int n;
	printf("please enter the len of linklist:");
	scanf("%d",&n);
	for(int i=0;i<n;i++)
	{	
		printf("please enter the %dth num:",i+1);
		scanf("%d",&element);
		//头插
		//head=head_insert(head,element);
		//尾插
		head=rear_insert(head,element);
	}
	output(head);
	//头删
	/*head=head_delete(head);
	printf("the new linklist is:");
	output(head);*/
	//尾删
	head=rear_delete(head);
	printf("the new linklist is:");
	output(head);
	return 0;
}