LeetCode 1265. 逆序打印不可变链表（递归）

示例 1：
输入：head = [1,2,3,4]
输出：[4,3,2,1]

示例 2：
输入：head = [0,-4,-1,3,-5]
输出：[-5,3,-1,-4,0]

示例 3：
输入：head = [-2,0,6,4,4,-6]
输出：[-6,4,4,6,0,-2]
 
提示：
链表的长度在 [1, 1000] 之间。
每个节点的值在 [-1000, 1000] 之间。

/**
 * // This is the ImmutableListNode's API interface.
 * // You should not implement it, or speculate about its implementation.
 * class ImmutableListNode {
 * public:
 *    void printValue(); // print the value of the node.
 *    ImmutableListNode* getNext(); // return the next node.
 * };
 */

class Solution {//C++
public:
    void printLinkedListInReverse(ImmutableListNode* head) {
        if(!head)
        	return;
        printLinkedListInReverse(head->getNext());
        head->printValue();
    }
};

# """
# This is the ImmutableListNode's API interface.
# You should not implement it, or speculate about its implementation.
# """
# class ImmutableListNode:
#     def printValue(self) -> None: # print the value of this node.
#     def getNext(self) -> 'ImmutableListNode': # return the next node.

class Solution: # py3
    def printLinkedListInReverse(self, head: 'ImmutableListNode') -> None:
        if not head:
        	return
        self.printLinkedListInReverse(head.getNext())
        head.printValue()