题目描述
将一个链表反转
题目解析
- 双指针迭代
ListNode *ReverseLink(ListNode*head)
{
if(head == nullptr || head->next == nullptr) return head;
ListNode *pre = nullptr;
ListNode *cur = head;
while (cur != nullptr)
{
ListNode * tmp = cur->next;
cur->next = pre;
pre = cur;
cur = tmp;
}
return pre;
}