题目
定义一个函数,输入一个链表的头节点,反转该链表并输出反转后链表的头节点。
示例:
输入: 1->2->3->4->5->NULL
输出: 5->4->3->2->1->NULL
限制:
0 <= 节点个数 <= 5000
代码
Python
# Definition for singly-linked list.
# class ListNode:
# def __init__(self, x):
# self.val = x
# self.next = None
# 思路:
# 快慢指针求解
# 复杂度:
# O(N)
class Solution:
def reverseList(self, head: ListNode) -> ListNode:
fast,slow=head,None
while fast:
tmp=fast.next
fast.next=slow
slow=fast
fast=tmp
return slow
C++
/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode(int x) : val(x), next(NULL) {}
* };
*/
class Solution {
public:
ListNode* reverseList(ListNode* head) {
ListNode *fast=head,*slow=NULL;
while (fast!=NULL) {
ListNode *tmp=fast->next;
fast->next=slow;
slow=fast;
fast=tmp;
}
return slow;
}
};