struct Node * inter_link(struct Node * chain1, int a, struct Node * chain2, int b) {
    int temp;
    struct Node *head, *p1, *p2, *pos;
   
    if (a >= b) {
        head = p1 = chain1;
        p2 = chain2;
    } else {
        head = p1 = chain2;
        p2 = chain1;
        temp = a, a = b, b = temp;
    }
   
    pos = head;
    while (p2 != NULL) {
        p1 = p1->next;
        pos->next = p2;
        pos = p2;
        p2 = p2->next;
        pos->next = p1;
        pos = p1;
    }
    return head;
}
我就是想不明白这函数是怎么个运行过程，求解释，能附图最好了

写了一个。看能不能帮到你 呵呵
 代码如下

#include<stdio.h>
#include<stdlib.h>
#define Length 10
typedef struct list{
   int data;
   struct list *next;
}link;
link *initLink();
int output(link *);
link *merge_link(link *,link *);
int main(){
   link *e1,*e2;
   e1=initLink();
   printf("e1: ");
   output(e1);
   e2=initLink();
   printf("e2: ");
   output(e2);
   e1=merge_link(e1,e2);
   printf("Merge : ");
   output(e1);
   return 0;
}
link *initLink(){
    int i;
    link *head,*move,*work;
    head=(link *)malloc(sizeof(link));
    move=head;
    head->data=Length;
    for(i=0;i<head->data;i++){
       work=(link *)malloc(sizeof(link));
       work->data=i+1;
       move->next=work;
       move=work;
    }
    move->next=NULL;
    return head;
}
int output(link *p){
   link *loop;
   loop=p->next;
   while(loop){
       printf("%-3d",loop->data);
       loop=loop->next;
   }
   printf("\n");
   return 0;
}
link *merge_link(link *e1,link *e2){
    link *loop_value,*move,*add_value;
    move=e1->next;
    e2=e2->next;
    loop_value=move->next;
    while(loop_value){
        add_value=(link *)malloc(sizeof(link));
        add_value->data=e2->data;
        move->next=add_value;
        add_value->next=loop_value;
        loop_value=loop_value->next;
        move=add_value->next;
        e2=e2->next;
    }
    return e1;
}

程序的实现过程我还是不懂呢。。这个链表的地址指针我总想不明白，还有就是链表里的“=”号和“->”啥区别，都是指向的意思么

楼主还不懂数据结构，还得好好看书，自己分析分析，我不是专业人士，越说会让你越糊涂