手写的Stack:
#include <iostream>
#include <cstdio>
#include <string>
#include <vector>
#include <queue>
#include <list>
#include <algorithm>
using namespace std;
typedef long long ll;
#define maxn 10005
#define mod 7654321
struct Stack
{
int data[10000];
int top=-1;
void push(int x)
{
if(top<10000)
data[++top]=x;
else
cout<<"Stack overflow!"<<endl;
}
void pop()
{
if(top>=0)
top--;
}
int topval()
{
if(top>=0)
return data[top];
else
return -1;
}
};
int main()
{
Stack S;
for(int i=1;i<=10;i++)
S.push(i);
for(int i=1;i<=10;i++)
{
cout<<S.topval()<<" ";
S.pop();
}
return 0;
}
STL库的Stack:
#include <iostream>
#include <cstdio>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <list>
#include <algorithm>
using namespace std;
typedef long long ll;
#define maxn 10005
#define mod 7654321
int main()
{
stack<int> s;
for(int i=0;i<10;i++)
s.push(i+1);
cout<<s.size()<<endl;
while(!s.empty())
{
cout<<s.top()<<" ";
s.pop();
}
cout<<endl;
cout<<s.size()<<endl;
return 0;
}