题目描述
输入一个链表,按链表值从尾到头的顺序返回一个ArrayList。
解题思路
从尾到头,很容易想到用栈来实现(先进后出)
C++版:
/*
* struct ListNode {
* int val;
* struct ListNode *next;
* ListNode(int x) :
* val(x), next(NULL) {
* }
* };
*/
class Solution {
public:
vector<int> printListFromTailToHead(ListNode* head) {
vector<int> result;
stack<int> stk;
ListNode* p = head;
while(p!=NULL){
stk.push(p->val);
p=p->next;
}
while(!stk.empty()){
result.push_back(stk.top());
stk.pop();
}
return result;
}
};
python版:
# -*- coding:utf-8 -*-
# class ListNode:
# def __init__(self, x):
# self.val = x
# self.next = None
class Solution:
# 返回从尾部到头部的列表值序列,例如[1,2,3]
def printListFromTailToHead(self, listNode):
# write code here
l = []
head = listNode
while head:
l.insert(0, head.val)
head = head.next
return l