左神面试算法整理--栈的逆序

算法思路：

建立两个栈，一个f，一个p。f实现找出栈中最底部的元素并返回。p利用递归和f函数，将从栈顶元素依次压入栈中实现逆序。

JAVA版

package problems_2017_07_26;


import java.util.Stack;


public class Problem_01_ReverseStackUsingRecursive {


public static void reverse(Stack<Integer> stack) {
if (stack.isEmpty()) {
return;
}
int i = getAndRemoveLastElement(stack);
reverse(stack);
stack.push(i);
}


public static int getAndRemoveLastElement(Stack<Integer> stack) {
int result = stack.pop();
if (stack.isEmpty()) {
return result;
} else {
int last = getAndRemoveLastElement(stack);
stack.push(result);
return last;
}
}


public static void main(String[] args) {
Stack<Integer> test = new Stack<Integer>();
test.push(1);
test.push(2);
test.push(3);
test.push(4);
test.push(5);
reverse(test);
while (!test.isEmpty()) {
System.out.println(test.pop());
}


}


}

C++版

int f(stack<int> a)
{
int result=a.top();
    a.pop();
if(a.empty())
return result;
else
{
int last=f(a);
a.push(result);
return last;
}
}


void p(stack<int> a)
{

if(a.empty())
return ;
else
{
int last=f(a);
   a.pop();
p(a);
a.push(last);
}
}



int main()
{

stack<int> result;


result.push(1);
result.push(2);
result.push(3);
result.push(4);
p(result);
for(int i=0;i<4;i++)
{
cout<<result.top();
result.pop();
}
cout<<endl;
system("pause");
return 0;
}