Reverse the Linked List. Input: 1->2->3->4->5->NULL Output: 5->4->3->2->1->NULL

Reverse the Linked List. Input: 1->2->3->4->5->NULL Output: 5->4->3->2->1->NULL

题目类型: 技术面试题

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

难度: hard

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

参考答案摘要

Assume that we have linked list 1 → 2 → 3 → Ø, we would like to change it to Ø ← 1 ← 2 ← 3. While you travel the linked list, change the current node's next pointer to point to its previous element. r...

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