摘要:
Reverse a singly linked list. Example: Input: 1->2->3->4->5->NULL Output: 5->4->3->2->1->NULL Follow up: A linked list can be reversed either iterativ 阅读全文
摘要:
找出两个链表的交点 题目: Write a program to find the node at which the intersection of two singly linked lists begins. For example, the following two linked list 阅读全文