class Solution {
public:
ListNode* printListFromTailToHead(struct ListNode* head) {
ListNode *root = new ListNode(0),*p;
while(head){
p = head->next;
head->next = root->next;
root->next = head;
head = p;
}
return root->next;
}
};
链表逆序
最新推荐文章于 2020-09-09 15:40:25 发布