序ifheadNULLhead
extNULLretur
headNodep1headNodep2p1
extNodep3p2
extp1
extNULLwhilep3NULLp2
extp1p1p2p2p3p3p3
extp2
extp1headp2retur
head2已知两个链表head1和head2各自有序，请把它们合并成一个链表依然有序。保留所有结点，即便大小相同）NodeMergeNodehead1Nodehead2ifhead1NULLretur
head2
fifhead2NULLretur
head1NodeheadNULLNodep1NULLNodep2NULLifhead1datahead2dataheadhead1p1head1
extp2head2elseheadhead2p2head2
extp1head1Nodepcurre
theadwhilep1NULLp2NULLifp1datap2datapcurre
t
extp1pcurre
tp1p1p1
extelsepcurre
t
extp2pcurre
tp2p2p2
extifp1NULLpcurre
t
extp1ifp2NULLpcurre
t
extp2retur
head3已知两个链表head1和head2各自有序，请把它们合并成一个链表依然有序，这次要求用递归方法进行。Autodesk答案：NodeMergeRecursiveNodehead1Nodehead2
fifhead1NULLretur
head2ifhead2NULLretur
head1NodeheadNULLifhead1datahead2dataheadhead1head
extMergeRecursivehead1
exthead2elseheadhead2head
extMergeRecursivehead1head2
extretur
head
fr