69,374
社区成员
发帖
与我相关
我的任务
分享
#include<stdio.h>
#include<stdlib.h>
struct node{
int num;
struct node *next;
};
typedef struct node SNODE;
SNODE* del(SNODE* head,int number)
{
SNODE* p1,*p2;
if(head->next==NULL)
{
printf("\nList is NULL\n");
return(head);
}
p1=head->next;
while(number!=p1->num&&p1->next!=NULL)
{
p2=p1;
p1=p1->next;
}
if(number==p1->num)
{
if(p1==head)
head=p1->next;
else
p2->next=p1->next;
printf("delete:%d\n",number);
}
else
printf("%d not been found!\n",number);
return(head);
}
void print(SNODE* head)
{
SNODE* p;
p=head->next;
if(p=='\0')
printf("\nLinkList is NULL\n");
else{
printf("head");
do{
printf("->%d",p->num);
p=p->next;
}while(p!=NULL);
printf("->end\n");
}
}
SNODE *creat()
{
int data;
SNODE *h,*s,*r;
h=(SNODE*)malloc(sizeof(SNODE));
r=h;
scanf("%d",&data);
while(data!=-1)
{
s=(SNODE*)malloc(sizeof(SNODE));
s->num=data;
r->next=s;
r=s;
scanf("%d",&data);
}
r->next='\0';
return h;
}
int main()
{
SNODE *head,*head2;
int del_num;
printf("请输入若干整型数据建立链表,以-1结束:");
head=creat();
printf("原链表内容为:\n");
print(head);
printf("\n输入要删除的数据:");
scanf("%d",&del_num);
head2=del(head,del_num);
printf("\n执行删除操作后链表内容为:\n");
print(head2);
return 0;
}
这个就是我改的//不带表头结点的单向链表
#include <stdio.h>
#include <stdlib.h>
#include <malloc.h>
#include <time.h>
#include <locale.h>
struct NODE {
int data;
struct NODE *next;
} *head,*p,*q,*s,*p1,*p2,*q1,**ta;
int i,k,n,t,m,v,N=10;
int main() {
setlocale(LC_ALL,"chs");
srand(time(NULL));
head=NULL;
printf("创建%d个节点的单链表:",N);//创建N个节点的单链表
p=head;
for (i=0;i<N;i++) {
q=(struct NODE *)malloc(sizeof(struct NODE));
if (NULL==q) exit(1);
q->data=rand()%100;//填写0..99的随机值
q->next=NULL;
if (NULL==p) {
head=q;
p=head;
} else {
p->next=q;
p=q;
}
}
//输出整个单链表
s=head;
while (1) {
if (NULL==s) {
printf("\n");
break;
}
printf("%02d->",s->data);
s=s->next;
}
k=3;
v=5;
printf("将值为%d的结点插入到单链表的第%d个结点前:",v,k);//将值为v的结点插入到单链表的第k个结点前
n=0;
p=head;
while (1) {
if (NULL==p) {
break;
}
n++;
if (k==1) {
q=(struct NODE *)malloc(sizeof(struct NODE));
if (NULL==q) exit(1);
q->data=v;
q->next=head;
head=q;
break;
} else {
if (k-1==n) {
q=(struct NODE *)malloc(sizeof(struct NODE));
if (NULL==q) exit(1);
q->data=v;
q->next=p->next;
p->next=q;
break;
}
}
p=p->next;
}
//输出整个单链表
s=head;
while (1) {
if (NULL==s) {
printf("\n");
break;
}
printf("%02d->",s->data);
s=s->next;
}
k=5;
printf("删除第%d个节点:",k);//删除第k个节点
n=0;
p=head;
while (1) {
if (NULL==p) {
break;
}
n++;
if (k==1) {
q=head;
head=head->next;
free(q);
break;
} else {
if (k-1==n) {
q=p->next;
if (q) {
p->next=q->next;
free(q);
}
break;
}
}
p=p->next;
}
//输出整个单链表
s=head;
while (1) {
if (NULL==s) {
printf("\n");
break;
}
printf("%02d->",s->data);
s=s->next;
}
printf("从小到大排序:");//从小到大排序
for (p=head,p1=NULL;p!=NULL;p1=p,p=p->next) {
for (q=p->next,q1=p;q!=NULL;q1=q,q=q->next) {
if (p->data > q->data) {
//交换data
// printf("swap %02d %02d\n",p->data,q->data);
// t=p->data;p->data=q->data;q->data=t;
//或者
//交换next
// printf("swap %02d %02d\n",p->data,q->data);
if (p==head) {//p是头
if (p->next==q) {//pq挨着
head=q;
p->next=q->next;
q->next=p;
q=p;
p=head;
} else {//pq不挨着
head=q;
p2=p->next;
p->next=q->next;
q->next=p2;
q1->next=p;
q=p;
p=head;
}
} else {//p不是头
if (p->next==q) {//pq挨着
p1->next=q;
p->next=q->next;
q->next=p;
q=p;
p=p1->next;
} else {//pq不挨着
p1->next=q;
p2=p->next;
p->next=q->next;
q->next=p2;
q1->next=p;
q=p;
p=p1->next;
}
}
//输出整个单链表
// s=head;
// while (1) {
// if (NULL==s) {
// printf("\n");
// break;
// }
// printf("%02d->",s->data);
// s=s->next;
// }
// getchar();
}
}
}
//输出整个单链表并计算链表长度n
n=0;
s=head;
while (1) {
if (NULL==s) {
printf("\n");
break;
}
printf("%02d->",s->data);
n++;
s=s->next;
}
printf("将整个链表逆序:");//将整个链表逆序
if (n>=2) {
p=head;
q=p->next;
p->next=NULL;
while (1) {
q1=q->next;
q->next=p;
p=q;
q=q1;
if (NULL==q) break;
}
head=p;
}
//输出整个单链表
s=head;
while (1) {
if (NULL==s) {
printf("\n");
break;
}
printf("%02d->",s->data);
s=s->next;
}
m=4;
n=6;
printf("将单链表中前%d个结点和后%d个结点进行互换:",m,n);//将单链表中前m个结点和后n个结点进行互换,m+n为链表总长
k=0;
p=head;
while (1) {
if (NULL==p) {
break;
}
k++;
if (m==k) {
q=p;
}
s=p;
p=p->next;
}
q1=head;
head=q->next;
s->next=q1;
q->next=NULL;
//输出整个单链表
s=head;
while (1) {
if (NULL==s) {
printf("\n");
break;
}
printf("%02d->",s->data);
s=s->next;
}
//释放所有节点
p=head;
while (1) {
if (NULL==p) {
break;
}
q=p->next;
free(p);
p=q;
}
return 0;
}
//创建10个节点的单链表:08->74->07->23->03->99->31->56->88->16->
//将值为5的结点插入到单链表的第3个结点前:08->74->05->07->23->03->99->31->56->88->16->
//删除第5个节点:08->74->05->07->03->99->31->56->88->16->
//从小到大排序:03->05->07->08->16->31->56->74->88->99->
//将整个链表逆序:99->88->74->56->31->16->08->07->05->03->
//将单链表中前4个结点和后6个结点进行互换:31->16->08->07->05->03->99->88->74->56->
//
#include<stdio.h>
#include<stdlib.h>
struct node{
int num;
struct node *next;
};
typedef struct node SNODE;
SNODE* del(SNODE* head, int number)
{
SNODE* p1, *p2 = NULL;
if (head->next == NULL)
{
printf("\nList is NULL\n");
return(head);
}
p1 = head->next;
while (number != p1->num&&p1->next != NULL)
{
p2 = p1;
p1 = p1->next;
}
if (number == p1->num)
{
//说明删除的是第一个结点
if (p1 == head->next)
head->next = p1->next;
else
p2->next = p1->next;
free(p1);
printf("delete:%d\n", number);
}
else
printf("%d not been found!\n", number);
return(head);
}
void print(SNODE* head)
{
SNODE* p;
p = head->next;
if (p == '\0')
printf("\nLinkList is NULL\n");
else{
printf("head");
do{
printf("->%d", p->num);
p = p->next;
} while (p != NULL);
printf("->end\n");
}
}
SNODE *creat()
{
int data;
SNODE *h, *s, *r;
h = (SNODE*)malloc(sizeof(SNODE));
r = h;
scanf("%d", &data);
while (data != -1)
{
s = (SNODE*)malloc(sizeof(SNODE));
s->num = data;
r->next = s;
r = s;
scanf("%d", &data);
}
r->next = '\0';
return h;
}
int main()
{
SNODE *head, *head2;
int del_num;
printf("请输入若干整型数据建立链表,以-1结束:");
head = creat();
printf("原链表内容为:\n");
print(head);
printf("\n输入要删除的数据:");
scanf("%d", &del_num);
head2 = del(head, del_num);
printf("\n执行删除操作后链表内容为:\n");
print(head2);
return 0;
}