《剑指offer》从尾到头打印链表

一、题目描述

二、输入描述

三、输出描述

四、牛客网提供的类框架

/**
*  struct ListNode {
*        int val;
*        struct ListNode *next;
*        ListNode(int x) :
*              val(x), next(NULL) {
*        }
*  };
*/
class Solution {
public:
vector<int> printListFromTailToHead(struct ListNode* head) {

}
};

五、解题思路

六、代码

/**
*  struct ListNode {
*        int val;
*        struct ListNode *next;
*        ListNode(int x) :
*              val(x), next(NULL) {
*        }
*  };
*/
class Solution {
public:
vector<int> printListFromTailToHead(struct ListNode* head) {
ListNode *newHead, *temp;
vector<int> vt;

while(head)
{
temp = head;
head = head->next;
temp->next = newHead;
newHead = temp;
}
while(newHead){
vt.push_back(newHead->val);
newHead = newHead->next;
}
return vt;
}
};