LeetCode 206. 反转链表 [Hot 100]
206. 反转链表简单给你单链表的头节点 head ,请你反转链表,并返回反转后的链表。迭代法class Solution { public ListNode reverseList(ListNode head) { ListNode head2 = new ListNode(); while (head != null) { ListNode t = head.next; head.next=head2.next; head2.next=head; h...
最近评论