我在做這個leetcode問題,我不明白爲什麼這個解決方案不起作用。它似乎只是返回頭元素。由於反向鏈接列表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) {
ListNode curr = null;
ListNode lst = null;
while (head != null)
{
curr = head;
curr.next = lst;
lst = curr;
head = head.next;
}
return curr;
}
}