//任务:判断B是否为A的子序列
//算法思想:比较A与B,若相等则用pre记录此时的A,同时后移,不相等则将B放到开头,A放到pre之后比较
int Pattern(LinkList& A, LinkList& B)
{
LNode* ra = A->next, * rb = B->next,*pre=ra;
while(ra&&rb)
if (ra->data == rb->data)
{
ra = ra->next; rb = rb->next;
}
else
{
ra = pre->next;
pre = ra;
rb = B->next;
}
if (rb == NULL)
return 1;
else
return 0;
}