严书数据结构P31算法2.12MergeList-L中 pc->next=pa?pa:pb怎么理解?严蔚敏版 31页算法2.12题目是归并两个单链表的算法.void MergeList_L(LinkList &La,LinkList &Lb,LinkList &Lc) {pa=La->next; pb=Lb->next;Lc=pc=La;while(pa&&pb){
来源:学生作业帮助网 编辑:作业帮 时间:2024/06/16 12:56:53
![严书数据结构P31算法2.12MergeList-L中 pc->next=pa?pa:pb怎么理解?严蔚敏版 31页算法2.12题目是归并两个单链表的算法.void MergeList_L(LinkList &La,LinkList &Lb,LinkList &Lc) {pa=La->next; pb=Lb->next;Lc=pc=La;while(pa&&pb){](/uploads/image/z/12173256-0-6.jpg?t=%E4%B8%A5%E4%B9%A6%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84P31%E7%AE%97%E6%B3%952.12MergeList-L%E4%B8%AD+pc-%3Enext%3Dpa%3Fpa%3Apb%E6%80%8E%E4%B9%88%E7%90%86%E8%A7%A3%3F%E4%B8%A5%E8%94%9A%E6%95%8F%E7%89%88+31%E9%A1%B5%E7%AE%97%E6%B3%952.12%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%7B)
xXnF
CK^K
4 EV )+Sn&
|Ad7b-HΥ?CRS!4CA4z 3ggY%~7{՝k§lW;>_JjS}8URo5!
fkWFo"gwwԻ;7i\Ϊ$'+_YA@yIx Y("]rUJB>BRQgƺ}a,`T c!Z<