class Solution {
public ListNode reverseList(ListNode head) {
ListNode cur = null;
ListNode pre = head;
while(pre!=null){
ListNode temp = pre.next;
pre.next = cur;
cur = pre;
pre=temp;
}
return cur;
}
}
Java面试题:反转链表
于 2022-02-21 15:51:47 首次发布