Leetcode Reverse Linked List 反转单链表
2015-05-06 11:25
274 查看
题目:
Reverse a singly linked list.分析:
1. 反转后头结点的next为null。2. 需要同时记录三个节点,分别是当前节点,它的前节点和next节点。
Java代码实现:
/*** Definition for singly-linked list.
* public class ListNode {
* int val;
* ListNode next;
* ListNode(int x) { val = x; }
* }
*/
public class Solution {
public ListNode reverseList(ListNode head) {
if(head == null || head.next == null)
return head;
ListNode node = head;
ListNode pre = head.next;
node.next = null;
while(pre!=null)
{
ListNode temp = pre.next;
pre.next = node;
node = pre;
pre = temp;
}
return node;
}
}
相关文章推荐
- leetCode 92.Reverse Linked List II (反转链表II) 解题思路和方法
- [leetcode]Reverse Linked List II (反转链表值 C语言实现)
- LeetCode 25 Reverse Nodes in k-Group(在K组链表中反转结点)(Linked List)(*)
- C实现 LeetCode->Reverse Linked List (双指针大法)(单链表反转)
- (Leetcode)92. Reverse Linked List II ——反转单链表
- 【LeetCode-面试算法经典-Java实现】【092-Reverse Linked List II(反转单链表II)】
- leetcode206/92---Reverse Linked List I/II(反转链表)
- [Leetcode] Reverse linked list ii 反转链表
- LeetCode 206 Reverse Linked List(反转链表)(四步将递归改写成迭代)(*)
- Leetcode Reverse Linked List II 反转部分单向链表
- [LeetCode-206] Reverse Linked List(链表反转)
- scala反转链表 leetcode 206 Reverse Linked List
- LeetCode206——Reverse Linked List 反转链表
- leetcode解题之206 # Reverse Linked List Java版 (使用头插法反转链表)
- leetcode:Reverse Linked List II (反转链表中的一部分)【面试算法题】
- 剑指offer 面试题16:反转链表(Leetcode 206: Reverse Linked List) 题解
- LeetCode-Reverse Linked List II(反转链表)
- LeetCode--Reverse Linked List 反转链表(Python)
- [leetcode] Reverse Linked List II 链表反转
- Leetcode Reverse Linked List II 反转特定区间的链表