Reverse Linked List
来源:互联网 发布:初级程序员培训班价格 编辑:程序博客网 时间:2024/06/03 21:54
Reverse a singly linked list.
翻转一个链表需要保存当前节点的前一个和后一个节点。
public class Solution { public ListNode reverseList(ListNode head) { if(head==null||head.next==null) return head; ListNode l1=head,l2=head.next; head.next=null; while(l1!=null&&l2!=null){ ListNode l3=l2.next; l2.next=l1; l1=l2; if(l3==null) break; l2=l3; } return l2; }}
0 0
- Single linked list reverse
- reverse a linked list
- Reverse a linked list.
- Reverse a linked list
- Reverse Linked List II
- Reverse Linked List II
- Reverse Linked List II
- Reverse Linked List II
- Reverse Linked List II
- Reverse Linked List II
- Reverse Linked List II
- Reverse Linked List II
- Reverse Linked List II
- Reverse Linked List II
- Reverse Linked List II
- Reverse Linked List II
- Reverse Linked List II
- Reverse Linked List II
- win7系统扩展双屏幕时,如何在两个屏幕下都显示任务栏
- FutureTask的使用
- 并查集的介绍及实现
- 【练习题】26.字符串压缩
- Java线程:概念与原理
- Reverse Linked List
- hdu 5339 Untitled(回溯)
- Merge k Sorted Lists
- Next Gen Real-time Streaming with Storm-Kafka Integration
- HTML中的ID和NAME的区别
- 转eclipse commit git
- 【Cocos2d入门教程十三】 浅析Cocos2d下3.x与2.x屏幕截图的区别
- 修改linux root密码
- 水--Beautiful Meadow