我用java刷 leetcode 206. 反转链表

Posted 2021-06-02 深林无鹿

这里有leetcode题集分类整理！！！

题目难度：简单
题目描述：
单链表的头节点 head ，请你反转链表，并返回反转后的链表。

my AC：

/**
 * 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 curr = head;
        ListNode prev = null;
        while (curr != null) {
            ListNode next = curr.next;
            curr.next = prev;
            prev = curr;
            curr = next;
        }
        return prev;
    }
}