该博客介绍了一个编程问题，涉及合并两个链表。如果一个链表的长度至少是另一个的两倍，需要将较短的链表反转并插入到较长的链表中。输入输出规格、样例输入和输出都已给出。博主分享了初次尝试的错误方法和后来采用的提高效率的解决方案，特别提到了在处理链表长度为两倍时的特殊情况。
Given two singly linked lists L1=a1→a2→⋯→an−1→an and L2=b1→b2→⋯→bm−1→bm. If n≥2m, you are supposed to reverse and merge the shorter one into the longer one to obtain a list like a1→a2→bm→a3→a4→bm−1⋯. For example, given one list being 6→7 and the other one 1→2→3→4→5, you must output 1→2→7→3→4→6→5.
Input Specification:
Each input file contains one test case. For each case, the first line contains the two addresses of the first nodes of L1 and L2, plus a positive N (≤105) which is the total number of nodes given. The address of a node is a 5-digit nonnegative integer, and NULL is represented by -1.
Then N lines follow, each describes a node in the format:
Address Data Nextwhere Address is the position of the node, Data is a positive integer no more than 105, and Next is the position of the next node. It is guaranteed that no
最低0.47元/天 解锁文章
1816
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
