就是先比较长度如果长度不一样让长的链表先遍历到相同的长度然后同时向后遍历如果有一个结点的值相同则退出循环
#include<stdio.h>
#include<stdlib.h>
typedef struct LNode//定义结构体
{
char data;
LNode *next;
}LNode,*LinkList;
void tailList(LinkList &L,char arr[],int n)
{
L = (LNode *)malloc(sizeof(LNode));
LNode *s, *r;
r = L;
int i=0;
for (; i <n; i++)
{
s = (LNode *)malloc(sizeof(LNode));
s->data = arr[i];
r->next = s;
r = s;
}
r->next = NULL;
}
void PrintList(LinkList L)
{
LNode* s = L->next;
while (s != NULL)
{
printf("%c\n", s->data);
s = s->next;
}
}
int length(LinkList L)
{
LNode *p = L->next;
int length=0;
while (p)
{
p = p->next;
length++;
}
return length;
}
char bijiao(LinkList L1, LinkList L2)
{
LNode *p;
LNode *q;
p = L1->next;//分别指向第一个结点
q = L2->next;
int len1 = length(L1);//计算长度
int len2 = length(L2);
int len = abs(len1 - len2);//先让其中一个长的链表到达一样的长度进行遍历
//printf("len 为%d\n", len);
if (len1 > len2)
{
while (len--)
{
p = p->next;
}
}
if (len2 > len1)
{
while (len--)
{
q = q->next;
}
}
while (p != NULL&&p->data!= q->data)
{
p = p->next;
q = q->next;
}
if (p != NULL)
return p->data;
}
int main()
{
char arr1[] = {'f','a','b','c', 'e'};
char arr2[] = { 'g', 'b', 'c','e' };
LinkList L;
LinkList L1;
int len = sizeof(arr1) / sizeof(char);
int len2 = sizeof(arr2) / sizeof(char);
tailList(L,arr1,len);
tailList(L1,arr2,len2);
int e=length(L);
int f = length(L1);
printf("L的长度为%d\n", e);
printf("L1的长度为%d\n", f);
PrintList(L);
PrintList(L1);
char a=bijiao(L, L1);
printf("尾部第一个字符为%c\n", a);
}