💁 二、题目解析 💁

创建动态数组
遍历链表，将链表插入动态数组
将动态数组翻转
将动态数组转为静态数组

🏃 三、代码 🏃

☁️ 1️⃣. python ☁️

# 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]:
        end=[]
        while head:
            end.append(head.val)
            head=head.next
        return end[::-1]

❄️ 2️⃣. C# ❄️

/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     public int val;
 *     public ListNode next;
 *     public ListNode(int x) { val = x; }
 * }
 */
public class Solution {
    public int[] ReversePrint(ListNode head) {
        List<int> ans = new List<int>();
        while(head!=null){
            ans.Add(head.val);
            head = head.next;
        }
        ans.Reverse();
        return ans.ToArray();
    }
}

🌔 结语 🌔

坚持最重要，每日一题必不可少！:smile_cat:

期待你的关注和督促！:stuck_out_tongue: