2024.2.3 作业-编程知识

2024.2.3 作业

1、实现单向循环链表的头插头删尾插尾删

#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=s;return s;
}
Linklist head_insert(Linklist head,datatype element)
{Linklist s=create();s->data=element;if(NULL==head){head=s;}else{Linklist p=head;while(p->next!=head)p=p->next;s->next=head;head=s;p->next=head;}return head;
}
void output(Linklist head)
{if(head==NULL){puts("empty!");return;}Linklist p=head;do{printf("%-5d",p->data);p=p->next;}while(p!=head);puts("");
}
//头删
Linklist head_delete(Linklist head)
{if(head==NULL)return NULL;else{Linklist p=head;while(p->next!=head)p=p->next;Linklist del=head;head=head->next;free(del);p->next=head;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!=head){p=p->next;}p->next=s;s->next=head;}return head;}
Linklist rear_delete(Linklist head)
{Linklist p=head;if(head==NULL)return NULL;else{while(p->next==head){free(head);head=NULL;return head;}while(p->next->next!=head){p=p->next;}Linklist del=p->next;free(del);p->next=head;}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;
}

2、编程实现单向循环链表的约瑟夫环

#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=s;return s;
}
Linklist head_insert(Linklist head,datatype element)
{Linklist s=create();s->data=element;if(NULL==head){head=s;}else{Linklist p=head;while(p->next!=head)p=p->next;s->next=head;head=s;p->next=head;}return head;
}
void output(Linklist head)
{if(head==NULL){puts("empty!");return;}Linklist p=head;do{printf("%-5d",p->data);p=p->next;}while(p!=head);puts("");
}
//头删
Linklist head_delete(Linklist head)
{if(head==NULL)return NULL;else{Linklist p=head;while(p->next!=head)p=p->next;Linklist del=head;head=head->next;free(del);p->next=head;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!=head){p=p->next;}p->next=s;s->next=head;}return head;}
Linklist rear_delete(Linklist head)
{Linklist p=head;if(head==NULL)return NULL;else{while(p->next==head){free(head);head=NULL;return head;}while(p->next->next!=head){p=p->next;}Linklist del=p->next;free(del);p->next=head;}return head;
}
Linklist josefh(Linklist head,int n,int m)
{if(head==NULL)return head;Linklist p=head;for(int i=0;i<n;i++){for(int j=0;j<m-2;j++)p=p->next;Linklist del=p->next;printf("%-5d",del->data);p->next=del->next;free(del);del=NULL;p=p->next;}puts("");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);//约瑟夫环datatype m;printf("please enter the m:");scanf("%d",&m);head=josefh(head,n,m);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=s;return s;
}
void output(Linklist head)
{if(head==NULL){puts("empty!");return;}Linklist p=head;do{printf("%-5d",p->data);p=p->next;}while(p!=head);puts("");
}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!=head){p=p->next;}p->next=s;s->next=head;}return head;}
datatype length(Linklist head)
{int len=0;Linklist p=head;do{p=p->next;len++;}while(p!=head);return len;}
void Bubble(Linklist head)
{if(head==NULL)return;int len=length(head);for(int i=1;i<len;i++){Linklist p=head;for(int j=0;j<len-i;j++){if(p->data>p->next->data){datatype t=p->data;p->data=p->next->data;p->next->data=t;}p=p->next;}}
}
int main(int argc, const char *argv[])
{Linklist head=NULL;datatype element;int n;printf("please enter n:");scanf("%d",&n);for(int i=0;i<n;i++){	printf("please enter the %dth num:",i+1);scanf("%d",&element);//尾插head=rear_insert(head,element);}//冒泡排序Bubble(head);output(head);return 0;
}