链表逆序

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;}};