/**
* 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 reverseHead = null;
ListNode cur = head;
while(null != cur) {
ListNode curNext = cur.next;
cur.next = reverseHead;
reverseHead = cur;
cur = curNext;
}
return reverseHead;
}
}
Reverse Linked List
最新推荐文章于 2021-11-19 09:03:47 发布