[题目链接](剑指 Offer II 024. 反转链表 - 力扣(LeetCode) (leetcode-cn.com))
思路
- 记住当前节点、当前节点的上一个结点和下一个节点。然后将当前节点的next指针指向上一个节点。
代码
/**
* Definition for singly-linked list.
* public class ListNode {
* int val;
* ListNode next;
* ListNode() {}
* ListNode(int val) { this.val = val; }
* ListNode(int val, ListNode next) { this.val = val; this.next = next; }
* }
*/
class Solution {
public ListNode reverseList(ListNode head) {
ListNode last = null;
ListNode node = head;
while(node != null) {
ListNode next = node.next;
node.next =last;
last = node;
node = next;
}
//不返回node的原因时,此时的node为null
return last;
}
}