- struct node
- {
- int elem;
- node* next;
- };
- void difference(node** LA , node* LB)
- {
- node *pa , *pb , *pre , *q;
- pre = NULL;
- //1
- while(pa)
- {
- pb = LB;
- while( ) //2
- pb = pb->next;
- if( ) //3
- {
- if(!pre)
- *LA = ; //4
- else
- = pa->next; //5
- q = pa;
- pa = pa->next;
- free(q);
- }
- else
- {
- ; //6
- pa = pa->next;
- }
- }
- }
pa = *LA;
pb && pa->elem != pb->elem
pb
pa->next
pre->next
pre = pa;
来自 “ ITPUB博客 ” ,链接:http://blog.itpub.net/29012686/viewspace-1145121/,如需转载,请注明出处,否则将追究法律责任。
转载于:http://blog.itpub.net/29012686/viewspace-1145121/