题解 | #从尾到头打印链表#
从尾到头打印链表
https://www.nowcoder.com/practice/d0267f7f55b3412ba93bd35cfa8e8035
class Solution {
public:
vector<int> printListFromTailToHead(ListNode* head) {
ListNode* p=head;
int count=0;
while(p){
count++;
p=p->next;
}
vector<int> b(count);
for(int j=0;j<count;j++){
b[count-j-1]=head->val;
head=head->next;
}
return b;
}
};
