数据结构P31算法2.12 解释下pc=pa得意思题目是归并两个单链表的算法.void MergeList_L(LinkList &La,LinkList &Lb,LinkList &Lc) {pa=La->next; pb=Lb->next;Lc=pc=La;while(pa&&pb){if(pa->data data){pc->next=pa;pc=pa;pa=pa->next; }else
来源:学生作业帮助网 编辑:作业帮 时间:2024/07/03 15:15:19
![数据结构P31算法2.12 解释下pc=pa得意思题目是归并两个单链表的算法.void MergeList_L(LinkList &La,LinkList &Lb,LinkList &Lc) {pa=La->next; pb=Lb->next;Lc=pc=La;while(pa&&pb){if(pa->data data){pc->next=pa;pc=pa;pa=pa->next; }else](/uploads/image/z/13045843-19-3.jpg?t=%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84P31%E7%AE%97%E6%B3%952.12+%E8%A7%A3%E9%87%8A%E4%B8%8Bpc%3Dpa%E5%BE%97%E6%84%8F%E6%80%9D%E9%A2%98%E7%9B%AE%E6%98%AF%E5%BD%92%E5%B9%B6%E4%B8%A4%E4%B8%AA%E5%8D%95%E9%93%BE%E8%A1%A8%E7%9A%84%E7%AE%97%E6%B3%95.void+MergeList_L%28LinkList+%26La%2CLinkList+%26Lb%2CLinkList+%26Lc%29+%7Bpa%3DLa-%3Enext%3B+pb%3DLb-%3Enext%3BLc%3Dpc%3DLa%3Bwhile%28pa%26%26pb%29%7Bif%28pa-%3Edata+data%29%7Bpc-%3Enext%3Dpa%3Bpc%3Dpa%3Bpa%3Dpa-%3Enext%3B+%7Delse)
数据结构P31算法2.12 解释下pc=pa得意思题目是归并两个单链表的算法.void MergeList_L(LinkList &La,LinkList &Lb,LinkList &Lc) {pa=La->next; pb=Lb->next;Lc=pc=La;while(pa&&pb){if(pa->data data){pc->next=pa;pc=pa;pa=pa->next; }else
数据结构P31算法2.12 解释下pc=pa得意思
题目是归并两个单链表的算法.
void MergeList_L(LinkList &La,LinkList &Lb,LinkList &Lc) {
pa=La->next; pb=Lb->next;
Lc=pc=La;
while(pa&&pb){
if(pa->data data){
pc->next=pa;pc=pa;pa=pa->next; }
else {pc->next=pb;pc=pb;pb=pb->next;}
}
pc->next=pa?pa:pb;
free(Lb);
}//MergeList_
解释下pc->next=pa;pc=pa;pa=pa->next,主要是前两句
数据结构P31算法2.12 解释下pc=pa得意思题目是归并两个单链表的算法.void MergeList_L(LinkList &La,LinkList &Lb,LinkList &Lc) {pa=La->next; pb=Lb->next;Lc=pc=La;while(pa&&pb){if(pa->data data){pc->next=pa;pc=pa;pa=pa->next; }else
画图就明白了,主要是前面指针未建立时不能让后面指针断了.