64,676
社区成员
发帖
与我相关
我的任务
分享
#include "string.h"
typedef struct tagINTDATA
{
int val;
struct tagINTDATA *next;
}INTDATA;
INTDATA *GetIntersect(INTDATA *M1,INTDATA *M2);
INTDATA *CreateList(char *buf);
void DeleteList(INTDATA *List);
void ShowList(INTDATA *List);
void main()
{
char stra[1024]={0};
char strb[1024]={0};
printf("输入:\n");
gets(stra);
gets(strb);
INTDATA *LA=CreateList(stra);
INTDATA *LB=CreateList(strb);
INTDATA *LC=GetIntersect(LA,LB);
ShowList(LC);
DeleteList(LA);
DeleteList(LB);
DeleteList(LC);
}
INTDATA *GetIntersect(INTDATA *M1,INTDATA *M2) //求交集
{
if(M1==NULL||M2==NULL) return NULL;
INTDATA *Head=NULL;
INTDATA *Tail=NULL;
INTDATA *p1=M1;
INTDATA *p2=M2;
while(p1)
{
p2=M2;
while(p2)
{
if(p1->val==p2->val)
{
INTDATA *pp=new INTDATA;
pp->val=p1->val;
pp->next=NULL;
if(Head==NULL)
{
Head=pp;
Tail=pp;
}
else
{
Tail->next=pp;
Tail=Tail->next;
}
break;
}
p2=p2->next;
}
p1=p1->next;
}
return Head;
}
INTDATA *CreateList(char *buf) //从字串够建链表
{
if(NULL==buf) return NULL;
INTDATA *Head=NULL;
INTDATA *Tail=NULL;
char *p=buf;
while(*p)
{
if((*p>='0'&&*p<='9')||*p==' ') p++;
else return NULL;
}
char tmp[10]={0};
int i=0;
p=buf;
while(*p==' ') p++;
while(*p)
{
tmp[i]=*p;
i++;
if(*p==' '||*(p+1)=='\0')
{
INTDATA *pp=new INTDATA;
sscanf(tmp,"%d",&pp->val);
pp->next=NULL;
if(Head==NULL)
{
Head=pp;
Tail=pp;
}
else
{
Tail->next=pp;
Tail=Tail->next;
}
memset(tmp,0,10);
i=0;
}
p++;
}
return Head;
}
void DeleteList(INTDATA *List) //删除链表
{
INTDATA *pCur=List;
while(pCur)
{
INTDATA *p=pCur;
pCur=pCur->next;
delete p;
}
}
void ShowList(INTDATA *List) //显示链表
{
INTDATA *pCur=List;
if(pCur)
{
printf("\n输出:\n");
while(pCur)
{
printf("%d ",pCur->val);
pCur=pCur->next;
}
}
else
printf("\n没有结果,空集合\n");
printf("\n\n");
}
//假设带表头结点的单向链表头指针为head,试编写一个算法将值为5的结点插入到连接表的第k个结点前,删除第k个节点,并对该链表进行排序。
#include <stdio.h>
#include <stdlib.h>
#include <malloc.h>
#include <time.h>
struct NODE {
int data;
struct NODE *next;
} H,*head,*p,*q,*s1,*s2,*s3,*s4,*s;
int i,j,k,n,t,m;
int main() {
srand(time(NULL));
//填写头节点数据
H.data=-1;
H.next=NULL;
head=&H;
//创建10个节点的单链表
p=head;
for (i=0;i<10;i++) {
q=(struct NODE *)malloc(sizeof(struct NODE));
if (NULL==q) return 1;
q->data=rand()%100;//填写0..99的随机值
q->next=NULL;
p->next=q;
p=q;
}
//输出整个单链表
s=head->next;
while (1) {
if (NULL==s) {
printf("\n");
break;
}
printf("%02d->",s->data);
s=s->next;
}
//将值为5的结点插入到单链表的第k个结点前
k=3;
n=0;
p=head;
while (1) {
if (NULL==p) {
break;
}
n++;
if (k==n) {
q=(struct NODE *)malloc(sizeof(struct NODE));
if (NULL==q) return 1;
q->data=5;
q->next=p->next;
p->next=q;
break;
}
p=p->next;
}
//输出整个单链表
s=head->next;
while (1) {
if (NULL==s) {
printf("\n");
break;
}
printf("%02d->",s->data);
s=s->next;
}
//删除第k个节点
k=5;
n=0;
p=head;
while (1) {
if (NULL==p) {
break;
}
n++;
if (k==n) {
q=p->next;
if (q) {
p->next=q->next;
free(q);
}
break;
}
p=p->next;
}
//输出整个单链表
s=head->next;
while (1) {
if (NULL==s) {
printf("\n");
break;
}
printf("%02d->",s->data);
s=s->next;
}
//从小到大排序
for (p=head;p!=NULL && p->next!=NULL;p=p->next) {
for (q=p->next;q!=NULL && q->next!=NULL;q=q->next) {
if (p->next->data > q->next->data) {
//交换data
// printf("swap %02d %02d\n",p->next->data,q->next->data);
// t=p->next->data;p->next->data=q->next->data;q->next->data=t;
//或者
//交换next
// printf("swap %02d %02d\n",p->next->data,q->next->data);
s1=p->next;
s2=p->next->next;
s3=q->next;
s4=q->next->next;
if (s2!=s3) {
p->next=s3;
s3->next=s2;
q->next=s1;
s1->next=s4;
} else {
p->next=s3;
s3->next=s1;
q=s3;
s1->next=s4;
}
//输出整个单链表
// s=head->next;
// while (1) {
// if (NULL==s) {
// printf("\n");
// break;
// }
// printf("%02d->",s->data);
// s=s->next;
// }
// getchar();
}
}
}
//输出整个单链表
s=head->next;
while (1) {
if (NULL==s) {
printf("\n");
break;
}
printf("%02d->",s->data);
s=s->next;
}
//将单链表中前 m 个结点和后 n 个结点进行互换,m+n为链表总长10
m=4;
n=6;
k=0;
p=head;
while (1) {
if (NULL==p) {
break;
}
k++;
if (m+1==k) {
q=p;
}
s=p;
p=p->next;
}
s1=head->next;
head->next=q->next;
s->next=s1;
q->next=NULL;
//输出整个单链表
s=head->next;
while (1) {
if (NULL==s) {
printf("\n");
break;
}
printf("%02d->",s->data);
s=s->next;
}
//释放所有节点
p=head->next;
while (1) {
if (NULL==p) {
break;
}
q=p->next;
free(p);
p=q;
}
return 0;
}
//18->94->58->17->27->20->43->57->75->78->
//18->94->05->58->17->27->20->43->57->75->78->
//18->94->05->58->27->20->43->57->75->78->
//05->18->20->27->43->57->58->75->78->94->
//43->57->58->75->78->94->05->18->20->27->
//