33,027
社区成员




#include <iostream>
using namespace std;
const int maxn = 1000000;
int top; // 栈顶位置
int ary[maxn];
void push(int a[], int size)
{
for (int i = 0; i < size; i++)
ary[top++] = a[i];
}
void pop(int out[], int size)
{
for (int i = 0; i < size; i++)
out[i] = ary[--top];
}
int main()
{
int a[5] = {1, 2, 3, 4, 5}, b[5];
push(a, 5);
pop(b, 5);
for (int i = 0; i < 5; i++)
cout<<b[i]<<' ';
cout<<endl;
}