688. Print N to 1 Using Recursion

Given a positive integer N, print all integers from N down to 1 (inclusive) in decreasing order using recursion. You must NOT use any loop. The function should use the recursive call stack to produce the output.

Input: A single integer N (1 ≤ N ≤ 10000).

Output: A list of integers from N down to 1 in decreasing order.

Examples

Input: 5
Output: [5, 4, 3, 2, 1]
Explanation: Print N first (5), then recursively print N-1 to 1: [4,3,2,1].

Input: 1
Output: [1]
Explanation: N=1, only 1 to print. Immediate base case after printing.

Input: 3
Output: [3, 2, 1]
Explanation: Print 3, recurse(2): print 2, recurse(1): print 1, recurse(0): stop.

Constraints

• 1 <= N <= 10000

Asked by