Ideas
数据结构:链表
Code
时间复杂度:O(n)
空间复杂度:O(n),其中 n 指的是链表的元素个数
# Definition for singly-linked list.
# class ListNode:
# def __init__(self, x):
# self.val = x
# self.next = None
class Solution:
def reversePrint(self, head: ListNode) -> List[int]:
l = []
cur = head
while(cur):
l.append(cur.val)
cur = cur.next
return l[::-1]
C++
/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode(int x) : val(x), next(NULL) {}
* };
*/
class Solution {
public:
vector<int> reversePrint(ListNode* head) {
vector<int> l;
while (head) {
l.insert(l.begin(), head->val);
head = head->next;
}
return l;
}
};