206. Reverse Linked List
Reverse a singly linked list.
Example:
Input: 1->2->3->4->5->NULL
Output: 5->4->3->2->1->NULL
Solution
Stack
Runtime: 8 ms, faster than 79.52% of C++ online submissions for Reverse Linked List.
Memory Usage: 8 MB, less than 100.00% of C++ online submissions for Reverse Linked List.
/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode() : val(0), next(nullptr) {}
* ListNode(int x) : val(x), next(nullptr) {}
* ListNode(int x, ListNode *next) : val(x), next(next) {}
* };
*/
class Solution {
public:
ListNode* reverseList(ListNode* head) {
stack<ListNode*> stk;
ListNode* p = head;
stk.push(NULL);
for(;p != NULL; p = p->next){
stk.push(p);
}
ListNode* new_head = NULL;
p = stk.top();
stk.pop();
new_head = p;
while(!stk.empty()){
p->next = stk.top();
stk.pop();
p = p->next;
}
return new_head;
}
};