Merge Two sorted Linked List

Merge Two sorted Linked List

题目类型: 技术面试题

这是一道技术面试题，常见于澳洲IT公司面试中。

难度: hard

标签: interviewbit, c, topic-specific, systems

参考答案摘要

Merge two sorted linked lists and return them as a sorted list. The list should be made by splicing together the nodes of the first two lists. Merging Two Sorted Linked List NodePtr merge_sorted(NodeP...

本题提供 STAR 原则详细解答和技术解析，登录匠人学院学习中心即可查看完整答案。