王道数据结构p40——16
一、题目
连续子序列
二、代码
#include<stdio.h>
#include<stdlib.h>
typedef struct lnode{
int data;
lnode *next;
}lnode,*linklist;
bool pattern(linklist &l,linklist &l2);
void printlink(linklist &l);
void creat(linklist &l,int a[],int n);
int main(){
linklist l;
linklist l2;
linklist c;
l = (lnode*)malloc(sizeof(lnode));
l->next = NULL;
l2 = (lnode*)malloc(sizeof(lnode));
l2->next = NULL;
int a[10] = {1,2,3,4,5,6,7,9,9,10};
int b[10] = {5,6,7};
creat(l,a,10);
creat(l2,b,3);
printf("\n%d",pattern(l,l2));
return 0;
}
bool pattern(linklist &l,linklist &l2){
lnode *p = l->next,*q = l2->next;
lnode *pre = p;
while(q != NULL && p != NULL){
if(q->data == p->data){
printf("%d ",p->data);
p = p->next;
q = q->next;
}
else{
pre=pre->next;
p=pre;
q = l2->next;
}
}
if(q == NULL) return true;
if(p == NULL) return false;
}
void printlink(linklist &l){
lnode *s=l->next;
while(s!=NULL){
printf("%d\n",s->data);
s=s->next;
}
}
void creat(linklist &l,int a[],int n){
lnode *s,*p;
s=l;
for(int i=0;i<n;i++){
p = (lnode*)malloc(sizeof(lnode));
p->data = a[i];
s->next = p;
s=p;
}
s->next = NULL;
}