Reverse a stack with recursive functions and stack operations only

【 subject 】

A stack is pushed in turn 1、2、3、4、5, So from the top to the bottom of the stack are 5、4、3、2、1. After transposing this stack , From the top to the bottom of the stack is 1、2、3、4、5, That is to realize the reverse order of the elements in the stack , But it can only be implemented with recursive functions , You can't use other data structures .

【 Ideas 】

Only recursive functions are required , You need to design two functions , Function returns the bottom of the stack element and removes ; Function 2 implements the reverse stack , Function one is required .

explain ： The picture comes from Zuoshen's program code interview guide , For learning purposes only .

Function one ：

// Return to the bottom of the stack and remove 
public static int getAndRemoveLastElement(Stack<Integer> stack)