要反工,怪怪的
/**
* Definition for singly-linked list.
* public class ListNode {
* int val;
* ListNode next;
* ListNode(int x) { val = x; }
* }
*/
class Solution {
public ListNode reverseList(ListNode head) {
ListNode list = null;
ListNode curr = head;
while (curr != null) {
ListNode nextTemp = curr.next;
curr.next = list;
list = curr;
curr = nextTemp;
}
return list;
}
}```