|
#2
rjsp2023-09-06 09:21
你想说的是 缺省构造函数 吗？
 程序代码：#include <iostream> #include <cassert> class int100000_stack { public: static constexpr size_t max_size = 100000; constexpr bool empty() const noexcept { return size_ != 0; } constexpr void push( int value ) noexcept { assert( size_ != max_size ); buf_[size_++] = value; } constexpr int pop() noexcept { assert( size_ != 0 ); return buf_[--size_]; } friend std::ostream& operator<<( std::ostream& os, const int100000_stack& obj ) { if( obj.size_ == 0 ) return os << "{}"; if( obj.size_ == 1 ) return os << "{ " << obj.buf_[0] << " }"; os << "{ " << obj.buf_[0]; for( size_t i=1; i!=obj.size_; ++i ) os << ", " << obj.buf_[i]; return os << " }"; } private: int buf_[max_size]; size_t size_ = 0; }; using namespace std; int main( void ) { int100000_stack a; cout << a << endl; a.push( 8 ); cout << a << endl; a.pop(); a.push( 1 ); a.push( 2 ); a.pop(); a.push( 3 ); cout << a << endl; } |
代码:
#include<algorithm>
#include<iostream>
#include<iomanip>
#include<cstring>
#include<vector>
#include<cmath>
#include<stack>
#define LL long long
using namespace std;
class intstack{//本程序作用:模拟栈(未做完)
int a[100000]={-1};
int main(){//注意看这里
memset(a,-1,sizeof(a));
return 0;
}
public:
bool intskempty(){
if(a[0]==-1){
return 0;
}
return 1;
}//判断栈是否为空
void intskpush(int x){
int i=0;
while(a[i]!=-1){
i++;
}
a[i]=x;
return;
}//压入
void pt(){
for(int i=0;a[i]!=0;i++){
cout<<a[i];
}
}//输出栈中全部元素
};
int main(){
intstack a;
a.intskpush(8);
a.pt();
return 0;
}
使用编译器:MinGW GCC10.2.032-bit Debug （小熊猫DEV-C++6.5）
