public ListNode reverseList(ListNode head) {
ListNode preNode = null;
ListNode curr = head;
while (curr !=null){
ListNode next = curr.next;
curr.next = preNode;
preNode = curr;
curr = next;
}
return preNode;
}
LeetCode_206(反转链表)
最新推荐文章于 2024-06-22 22:59:06 发布