题目描述:
定义一个函数,输入一个链表的头节点,反转该链表并输出反转后链表的头节点。
示例:
输入: 1->2->3->4->5->NULL
输出: 5->4->3->2->1->NULL
限制:
0 <= 节点个数 <= 5000
方法一:双指针
/**
* 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 *Pre=head,*Cur=NULL;
while(Pre!=NULL){
ListNode *Tmp=Pre->next;
Pre->next=Cur;
Cur=Pre;
Pre=Tmp;
}
return Cur;
}
};
方法二:递归
方法三:利用栈
/**
* 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) {
stack<ListNode *>st;
while(head!=NULL){
st.push(head);
head=head->next;
}
ListNode *FirstNode=NULL;
if(!st.empty()){
FirstNode=st.top();
FirstNode->next=NULL;
st.pop();
}
else
return FirstNode;
ListNode *TmpNode=FirstNode;
while(!st.empty()){
TmpNode->next=st.top();
st.pop();
TmpNode=TmpNode->next;
}
TmpNode->next=NULL;
return FirstNode;
}
};