从头到尾打印链表
vector<int> printListFromTailToHead(struct ListNode* head) {
vector<int> num;
if(head==NULL)
return num;
stack<int> stknum;
ListNode *p = head;
while(p!=NULL){ //与字符串反转中的while(*p!=NULL)不同
stknum.push(p->val);
p = p->next;
}
while(stknum.size()){
num.push_back(stknum.top());
stknum.pop();
}
return num;
}