1用模板类写一个顺序栈
class mstack{
int top;
T data[128];
public:
mstack():top(0){};
void push_stack(T key){
if(top<=127){
data[top++]=key;
}
}
T out_stack(){
T key=data[--top];
return key;
}
};
int main(){
mstack<int> a;
a.push_stack(123);
a.push_stack(456);
a.push_stack(789);
cout<<a.out_stack()<<" "<<a.out_stack()<<" "<<a.out_stack()<<endl;
return 0;
}
结果:
2定义一个字符数组,当数组越界时抛出一个异常并处理
int main(){
int b=129;
char str[128]="";
try{
if(b>128){
throw int(0);
}
str[b]='a';
}catch(int res){
if(res==0){
cout<<"数组访问越界"<<endl;
}
}
return 0;
}