如何反转一个单链表 How to reverse a singly linked list
2007-05-21 15:56
603 查看
用3个指针 分别指向前面 ,正在 ,下一个3个state,
class Node //节点类
...{
int data;
Node * link;
}
Node * Reverse(const Node * head)//反转 非递归算法
...{
Node * pre,*cru,* next;
pre=head;
cru=head->link;
while(cru!=null)
...{
next=cru->link;
cru->link=pre;
pre=cru;
cru=next;
}
head->link=null;
head=pre;
return headl
}
相关文章推荐
- 【LeetCode-面试算法经典-Java实现】【206-Reverse Linked List(反转一个单链表)】
- 两两反转单向链表 (reverse a singly linked list in pair ) [#22]
- 反转单向链表(reverse a singly linked list)
- 反转单向链表(reverse a singly linked list)(单个反转) [# 7]
- [Leetcode]Reverse Linked List-再写单链表反转
- How to determine whether there are circles in a singly linked list?
- Python: How to iterate list in reverse order
- LeetCode(Reverse Linked List II) 反转指定位置之间的节点
- [LeetCode] Reverse Linked List(递归与非递归反转链表)
- leetcode解题之206 # Reverse Linked List Java版 (使用头插法反转链表)
- Reverse Linked List(反转链表)
- 206. Reverse Linked List&反转链表
- LeetCode-Reverse Linked List II(反转链表)
- FW:Reverse a Singly Linked List Recursively in Java
- Ch2-2: return the nth to the last node data of a singly linked list
- [Leetcode] Reverse linked list ii 反转链表
- [LeetCode-92] Reverse Linked List II(反转指定区间链表)
- how to Register for Notification in ACPI | 如何注册一个ACPI 通知
- Reverse Singly LinkedList的方法探讨
- 2.2.2—单链表—Reverse Linked List II