学步园

题目：用递归颠倒一个栈。例如输入栈{1, 2, 3, 4, 5}，1在栈顶。颠倒之后的栈为{5, 4, 3, 2, 1}，5处在栈顶。

//============================================================================<br /> // Name : 100题之颠倒栈.cpp<br /> // Author :<br /> // Version :<br /> // Copyright : Your copyright notice<br /> // Description : Hello World in C++, Ansi-style<br /> //============================================================================<br /> #include <iostream><br /> #include<stack><br /> using namespace std;<br /> void AddToStackBottom(stack<int>&s, int top)<br /> {<br /> if(s.empty())<br /> {<br /> s.push(top);<br /> return;<br /> }<br /> int top1=s.top();<br /> s.pop();<br /> AddToStackBottom(s, top);<br /> s.push(top1);<br /> }<br /> void reverseStack(stack<int>&s)<br /> {<br /> if(s.empty())<br /> return;<br /> if(s.size()==1)<br /> return;<br /> int top=s.top();<br /> s.pop();<br /> reverseStack(s);<br /> AddToStackBottom(s, top);<br /> }</p> <p>int main() {<br /> stack<int>s;<br /> s.push(5);<br /> s.push(4);<br /> s.push(3);<br /> s.push(2);<br /> s.push(1);<br /> reverseStack(s);<br /> cout<<s.size()<<endl;<br /> while(!s.empty())<br /> {<br /> cout<<s.top()<<" ";<br /> s.pop();<br /> }<br /> return 0;<br /> }<br />