Skip to content
TheChatArchiveThe Chat Archive
gpt-3.5-turbo-0613· OpenAIAi2 WildChat-4.8M (AI2)

整理并排版此代码#include using namespace std; #define MaxSize 50 typedef int T; //顺序栈 class…

  1. User

    整理并排版此代码#include using namespace std; #define MaxSize 50 typedef int T; //顺序栈 class SeqStack { private: T *data;//栈使用内存首地址 int top;//栈顶指针 int RSize;//栈分配元素个数 void overflow(); public: SeqStack(); ~SeqStack(); void push(T x); bool pop(T& e); bool getTop(T& e); bool isEmpty(); bool isFull(); int getSize(); void makeEmpty(); void print(); }; //构造 SeqStack::SeqStack() { data = new T[MaxSize]; top = -1; } //析构 SeqStack::~SeqStack() { delete[] data; } //栈溢出时扩大栈容量 void SeqStack::overflow() { if (data != NULL) { T newArray = new T[RSize + 20]; for(int i = 0; i <=top; i++) { newArray[i] = data[i]; } delete[] data; data = newArray; RSize += 20; } } //进栈 void SeqStack::push(T x) { if (top == MaxSize - 1) { overflow(); } top++; data[top] = x; } //出栈 bool SeqStack::pop(T& x) { if (isEmpty()) { return false; } x = data[top]; top–; return true; } //获取栈顶元素 bool SeqStack::getTop(T& x) { if (isEmpty()) { return false; } x = data[top]; return true; } //栈是否空 bool SeqStack::isEmpty() { return top == -1; } //栈是否满 bool SeqStack::isFull() { return top == MaxSize - 1; } //栈实际元素个数 int SeqStack::getSize() { return top + 1; } //置栈空 void SeqStack::makeEmpty() { top = -1; } //由栈顶到栈底依次输出栈元素 void SeqStack::print() { for (int i = top; i >= 0; i–) { cout << data[i] << " "; } cout << endl; } //菜单 void menu() { cout << “1.进栈” << endl; cout << “2.出栈” << endl; cout << “3.获取栈顶元素” << endl; cout << “4.栈置空” << endl; cout << “5.由栈顶到栈底依次输出栈元素” << endl; cout << “6.退出” << endl; } //执行菜单功能 void function(int num, SeqStack ss) { switch (num) { int x; case 1: cout << “请输入要进栈的元素:”; cin >> x; ss->push(x); cout << “进栈成功!” << endl; break; case 2: if (ss->pop(x)) { cout << “出栈成功,出栈的元素为:” << x << endl; } else { cout << “出栈失败,栈为空!” << endl; } break; case 3: if (ss->getTop(x)) { cout << “栈顶元素为:” << x << endl; } else { cout << “栈为空!” << endl; } break; case 4: ss->makeEmpty(); cout << “栈已置空!” << endl; break; case 5: ss->print(); break; default: exit(0); } }

    int main(int argc, char argv) { SeqStack *ss = new SeqStack; int num; while (true) { menu(); cin >> num; function(num, ss); } delete ss; return 0; }

  2. Assistant

    #include using namespace std;

    #define MaxSize 50 typedef int T;

    //顺序栈 class SeqStack { private: T *data; //栈使用内存首地址 int top; //栈顶指针 int RSize; //栈分配元素个数 void overflow();

    public: SeqStack(); ~SeqStack(); void push(T x); bool pop(T &e); bool getTop(T &e); bool isEmpty(); bool isFull(); int getSize(); void makeEmpty(); void print(); };

    //构造 SeqStack::SeqStack() { data = new T[MaxSize]; top = -1; }

    //析构 SeqStack::~SeqStack() { delete[] data; }

    //栈溢出时扩大栈容量 void SeqStack::overflow() { if (data != NULL) { T *newArray = new T[RSize + 20]; for (int i = 0; i <= top; i++) { newArray[i] = data[i]; } delete[] data; data = newArray; RSize += 20; } }

    //进栈 void SeqStack::push(T x) { if (top == MaxSize - 1) { overflow(); } top++; data[top] = x; }

    //出栈 bool SeqStack::pop(T &x) { if (isEmpty()) { return false; } x = data[top]; top--; return true; }

    //获取栈顶元素 bool SeqStack::getTop(T &x) { if (isEmpty()) { return false; } x = data[top]; return true; }

    //栈是否空 bool SeqStack::isEmpty() { return top == -1; }

    //栈是否满 bool SeqStack::isFull() { return top == MaxSize - 1; }

    //栈实际元素个数 int SeqStack::getSize() { return top + 1; }

    //置栈空 void SeqStack::makeEmpty() { top = -1; }

    //由栈顶到栈底依次输出栈元素 void SeqStack::print() { for (int i = top; i >= 0; i--) { cout << data[i] << " "; } cout << endl; }

    //菜单 void menu() { cout << "1.进栈" << endl; cout << "2.出栈" << endl; cout << "3.获取栈顶元素" << endl; cout << "4.栈置空" << endl; cout << "5.由栈顶到栈底依次输出栈元素" << endl; cout << "6.退出" << endl; }

    //执行菜单功能 void function(int num, SeqStack *ss) { switch (num) { int x; case 1: cout << "请输入要进栈的元素:"; cin >> x; ss->push(x); cout << "进栈成功!" << endl; break; case 2: if (ss->pop(x)) { cout << "出栈成功,出栈的元素为:" << x << endl; } else { cout << "出栈失败,栈为空!" << endl; } break; case 3: if (ss->getTop(x)) { cout << "栈顶元素为:" << x << endl; } else { cout << "栈为空!" << endl; } break; case 4: ss->makeEmpty(); cout << "栈已置空!" << endl; break; case 5: ss->print(); break; default: exit(0); } }

    int main(int argc, char argv[]) { SeqStack *ss = new SeqStack; int num; while (true) { menu(); cin >> num; function(num, ss); } delete ss; return 0; }

  3. User

    进行排版

  4. Assistant

    #include using namespace std;

    #define MaxSize 50 typedef int T;

    //顺序栈 class SeqStack { private: T *data; //栈使用内存首地址 int top; //栈顶指针 int RSize; //栈分配元素个数 void overflow();

    public: SeqStack(); ~SeqStack(); void push(T x); bool pop(T &e); bool getTop(T &e); bool isEmpty(); bool isFull(); int getSize(); void makeEmpty(); void print(); };

    SeqStack::SeqStack(){ data = new T[MaxSize]; top = -1; }

    SeqStack::~SeqStack(){ delete[] data; }

    void SeqStack::overflow(){ if (data != NULL){ T *newArray = new T[RSize + 20]; for (int i = 0; i <= top; i++){ newArray[i] = data[i]; } delete[] data; data = newArray; RSize += 20; } }

    void SeqStack::push(T x){ if (top == MaxSize - 1){ overflow(); } top++; data[top] = x; }

    bool SeqStack::pop(T &x){ if (isEmpty()){ return false; } x = data[top]; top--; return true; }

    bool SeqStack::getTop(T &x){ if (isEmpty()){ return false; } x = data[top]; return true; }

    bool SeqStack::isEmpty(){ return top == -1; }

    bool SeqStack::isFull(){ return top == MaxSize - 1; }

    int SeqStack::getSize(){ return top + 1; }

    void SeqStack::makeEmpty(){ top = -1; }

    void SeqStack::print(){ for (int i = top; i >= 0; i--){ cout << data[i] << " "; } cout << endl; }

    void menu(){ cout << "1.进栈" << endl; cout << "2.出栈" << endl; cout << "3.获取栈顶元素" << endl; cout << "4.栈置空" << endl; cout << "5.由栈顶到栈底依次输出栈元素" << endl; cout << "6.退出" << endl; }

    void function(int num, SeqStack *ss){ switch (num){ int x; case 1:{ cout << "请输入要进栈的元素:"; cin >> x; ss->push(x); cout << "进栈成功!" << endl; break; } case 2:{ if (ss->pop(x)){ cout << "出栈成功,出栈的元素为:" << x << endl; }else{ cout << "出栈失败,栈为空!" << endl; } break; } case 3:{ if (ss->getTop(x)){ cout << "栈顶元素为:" << x << endl; }else{ cout << "栈为空!" << endl; } break; } case 4:{ ss->makeEmpty(); cout << "栈已置空!" << endl; break; } case 5:{ ss->print(); break; } default:{ exit(0); } } }

    int main(int argc, char argv[]) { SeqStack *ss = new SeqStack; int num; while (true){ menu(); cin >> num; function(num, ss); } delete ss; return 0; }

  5. User

    进行排版

  6. Assistant

    #include using namespace std;

    #define MaxSize 50 typedef int T;

    //顺序栈 class SeqStack { private: T *data; //栈使用内存首地址 int top; //栈顶指针 int RSize; //栈分配元素个数

    void overflow();
    

    public: SeqStack(); ~SeqStack(); void push(T x); bool pop(T &e); bool getTop(T &e); bool isEmpty(); bool isFull(); int getSize(); void makeEmpty(); void print(); };

    SeqStack::SeqStack() { data = new T[MaxSize]; top = -1; }

    SeqStack::~SeqStack() { delete[] data; }

    void SeqStack::overflow() { if (data != NULL) { T *newArray = new T[RSize + 20]; for (int i = 0; i <= top; i++) { newArray[i] = data[i]; } delete[] data; data = newArray; RSize += 20; } }

    void SeqStack::push(T x) { if (top == MaxSize - 1) { overflow(); } top++; data[top] = x; }

    bool SeqStack::pop(T &x) { if (isEmpty()) { return false; } x = data[top]; top--; return true; }

    bool SeqStack::getTop(T &x) { if (isEmpty()) { return false; } x = data[top]; return true; }

    bool SeqStack::isEmpty() { return top == -1; }

    bool SeqStack::isFull() { return top == MaxSize - 1; }

    int SeqStack::getSize() { return top + 1; }

    void SeqStack::makeEmpty() { top = -1; }

    void SeqStack::print() { for (int i = top; i >= 0; i--) { cout << data[i] << " "; } cout << endl; }

    void menu() { cout << "1.进栈" << endl; cout << "2.出栈" << endl; cout << "3.获取栈顶元素" << endl; cout << "4.栈置空" << endl; cout << "5.由栈顶到栈底依次输出栈元素" << endl; cout << "6.退出" << endl; }

    void function(int num, SeqStack *ss) { switch (num) { int x; case 1: { cout << "请输入要进栈的元素:"; cin >> x; ss->push(x); cout << "进栈成功!" << endl; break; } case 2: { if (ss->pop(x)) { cout << "出栈成功,出栈的元素为:" << x << endl; } else { cout << "出栈失败,栈为空!" << endl; } break; } case 3: { if (ss->getTop(x)) { cout << "栈顶元素为:" << x << endl; } else { cout << "栈为空!" << endl; } break; } case 4: { ss->makeEmpty(); cout << "栈已置空!" << endl; break; } case 5: { ss->print(); break; } default: { exit(0); } } }

    int main(int argc, char argv[]) { SeqStack *ss = new SeqStack; int num; while (true) { menu(); cin >> num; function(num, ss); } delete ss; return 0; }

  7. User

    将以上代码进行整理排版

  8. Assistant

    #include using namespace std;

    #define MaxSize 50 typedef int T;

    // 顺序栈 class SeqStack { private: T *data; // 栈使用内存首地址 int top; // 栈顶指针 int RSize; // 栈分配元素个数

    void overflow();
    

    public: SeqStack(); ~SeqStack(); void push(T x); bool pop(T &e); bool getTop(T &e); bool isEmpty(); bool isFull(); int getSize(); void makeEmpty(); void print(); };

    SeqStack::SeqStack() { data = new T[MaxSize]; top = -1; }

    SeqStack::~SeqStack() { delete[] data; }

    void SeqStack::overflow() { if (data != nullptr) { T *newArray = new T[RSize + 20]; for (int i = 0; i <= top; i++) { newArray[i] = data[i]; } delete[] data; data = newArray; RSize += 20; } }

    void SeqStack::push(T x) { if (top == MaxSize - 1) { overflow(); } top++; data[top] = x; }

    bool SeqStack::pop(T &x) { if (isEmpty()) { return false; } x = data[top]; top--; return true; }

    bool SeqStack::getTop(T &x) { if (isEmpty()) { return false; } x = data[top]; return true; }

    bool SeqStack::isEmpty() { return top == -1; }

    bool SeqStack::isFull() { return top == MaxSize - 1; }

    int SeqStack::getSize() { return top + 1; }

    void SeqStack::makeEmpty() { top = -1; }

    void SeqStack::print() { for (int i = top; i >= 0; i--) { cout << data[i] << " "; } cout << endl; }

    void menu() { cout << "1.进栈" << endl; cout << "2.出栈" << endl; cout << "3.获取栈顶元素" << endl; cout << "4.栈置空" << endl; cout <<