class Solution {
public:
ListNode* reverseList(ListNode* head) {
stack<ListNode*> s;
while (head != nullptr){
s.push(head);
head = head->next;
}
if (s.empty()){
return nullptr;
}
ListNode* node = s.top();
s.pop();
ListNode* dummy = node;
while(!s.empty()){
ListNode* temp = s.top();
s.pop();
node->next = temp;
node = node->next;
}
node->next = nullptr;
return dummy;
}
};
(使用栈)力扣:反转链表
最新推荐文章于 2022-08-11 22:55:05 发布