#include <cstdlib>#include <iostream>#include <stack>using namespace std;typedef stack<int> ints;typedef deque<char>  chars;int pn(int x,int n);//习题1   将递归函数（testk()）改写成非递归(test()) void testk (int &sum){     int x;     cin>>x;     if(x==0)  sum=0;     else{testk(sum);sum+=x;}     cout<<sum<<endl;}void test(int &sum){     ints L;     int x=1;     sum=0;     while(x!=0)     {         cin>>x;         L.push(x);     }     while(!L.empty())     {         sum+=L.top();         L.pop();         cout<<sum<<endl;      }   }

评论