1.请简述堆区和栈区的区别
答:1.栈区是借助于栈的思想实现,先进后出,先定义变量,后分配内存,地址申请从大地址到小地址;堆区是借助于队列的思想实现,先进先出,先定义变量申请内存,地址申请从小地址到大地址;
2.栈区是计算机自动申请自动释放;堆区是程序员手动申请手动释放;
3.栈的大小是几M;堆区的大小是几G;
4.堆栈溢出;
5.栈区内存连续;堆区容易出现片段化
#include <stdio.h>
#include <stdlib.h>
#define MAXSIZE 8
int delete(int arr[],int len, int x)
{
int j=0;
for(int i=0;i<len;i++)
{
if(arr[i]!=x)
arr[j++]=arr[i];
}
return j;
}
int main()
{
int arr[MAXSIZE];
int x,len;
len = MAXSIZE;
for(int i=0;i<len;i++)
{
printf("please enter arr[%d]:",i);
scanf(" %d",&arr[i]);
}
puts("");
printf("please enter x : ");
scanf("%d",&x);
printf("len =%d\n",len);
len=delete(arr,len,x);
printf("New len =%d\n",len);
printf("New arr[] is :\n");
for(int i=0;i<len;i++)
{
printf(" %d",arr[i]);
}
puts("");
return 0;
}
3.请用编程实现单链表的头插、头删、尾插、尾删
#include<stdlib.h>
#include<string.h>
#include<stdio.h>
typedef struct node //定义链表节点结构体:数据域、指针域
{
int data;
struct node *next;
}*linklist;
linklist create_node()//创建新节点并初始化,返回节点地址
{
linklist s=(linklist)malloc(sizeof(struct node));
if(NULL==s)
return NULL;
s->data=0;
s->next=NULL;
return s;
}
linklist insert_head(linklist head,int element)
{
linklist s=create_node();
if(NULL==s)
{
puts("fail");
return NULL;
}
s->data=element;
if(NULL==head)
{
head=s;
return head;
}
s->next=head;
head=s;
return head;
}
linklist insert_rear(linklist head,int element)
{
linklist s=create_node();
if(NULL==s)
{
puts("fail");
return NULL;
}
s->data=element;
if(NULL==head)
{
head=s;
return head;
}
linklist p=head;
while(p->next)
p=p->next;
p->next=s;
return head;
}
void output(linklist head)
{
linklist p=head;
while(p)
{
printf("%d ",p->data);
p=p->next;
}
puts("");
}
linklist delete_head(linklist head)
{
if(NULL==head)
{
puts("empty");
return head;
}
if(NULL==head->next)
{
free(head);
return NULL;
}
linklist del=head;
head=head->next;
free(del);del=NULL;
return head;
}
linklist delete_rear(linklist head)
{
if(NULL==head)
{
puts("empty");
return head;
}
if(NULL==head->next)
{
free(head);
return NULL;
}
linklist p=head;
while(p->next->next)
p=p->next;
linklist del=p->next;
p->next=NULL;
free(del);del=NULL;
return head;
}
int main(int argc, const char *argv[])
{
linklist head=NULL;//定义单链表头指针并初始化
int len;//根据终端输入的值确定单链表的长度
printf("please enter the length of the linklist:");
scanf("%d",&len);
int element;
for(int i=0;i<len;i++)//循环输入数值,头插或尾插创建链表
{
printf("%d element:",i+1);
scanf("%d",&element);
// head=insert_head(head,element);//头插
head=insert_rear(head,element);//尾插
}
output(head);//遍历
head=delete_head(head);//头删
head=delete_head(head);
output(head);
head=delete_rear(head);//尾删
output(head);
return 0;
}