摘要： 问题一: merge two sorted linkedlist.Key to solve this problemThe key to solve the problem is defining a fake head. Then compare the first elements from each list. Add the smaller one to the merged list. Finally, when one of them is empty, simply append it to the merged list, since it is already sorted. 阅读全文