cpp 10.10

最新推荐文章于 2024-10-10 21:18:11 发布

rocvfx

最新推荐文章于 2024-10-10 21:18:11 发布

阅读量235

点赞数

CC 4.0 BY-SA版权

分类专栏：牛逼c++

本文链接：https://blog.youkuaiyun.com/rocvfx/article/details/54019739

牛逼c++ 专栏收录该内容

114 篇文章

订阅专栏

本文介绍了一个简单的栈数据结构实现及应用案例。通过C++代码展示了如何创建、填充、读取和清空一个栈，以及如何使用该栈进行采购订单的添加和处理。此程序能够帮助理解栈的基本操作。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

stack.h

#pragma once
typedef unsigned long Item;

class Stack
{
private:
	enum { MAX = 10 };
	Item items[MAX];
	int top;
public:
	Stack();
	bool isempty() const;
	bool isfull() const;

	bool push(const Item & item);
	bool pop(Item & item);

};

stack.cpp

#include "stack.h"
Stack::Stack()
{
	top = 0;
}

bool Stack::isempty() const
{
	return top == 0;
}

bool Stack::isfull() const
{
	return top == MAX;

}

bool Stack::push(const Item & item)
{
	if (top < MAX)
	{
		items[top++] = item;
		return true;
	}
	else
		return false;
}

bool Stack::pop(Item & item)
{
	if (top > 0)
	{
		item = items[--top];
		return true;

	}
	else
		return false;
}

stacker.cpp

#include<iostream>
#include<cctype>
#include"stack.h"

int main()
{
	using namespace std;
	Stack st;
	char ch;
	unsigned long po;
	cout << "Please enter A to add purchase order,\n"
		<< "P to process a PO, or Q to quit.\n";
	while (cin >> ch && toupper(ch) != 'Q')
	{
		while (cin.get() != '\n')
			continue;
		if (!isalpha(ch))
		{
			cout << '\a';
			continue;
		}
		switch (ch)
		{
		    case 'A':
		    case 'a': cout << "Enter a PO number to add: ";
			          cin >> po;
			          if (st.isfull())
				          cout << "stack already full\n";
			          else
				          st.push(po);
			          break;
		case 'p':
		case 'P': if (st.isempty())
				      cout << "stack already empty\n";
				  else {
						  st.pop(po);
						  cout << "PO #" << po << " popped\n";
					  }
					  break;

		}
		cout << "Please enter A to add a purchase order,\n"
			<< "P to process a PO, or Q to quit.\n";

	}
	cout << "Bye\n";
	system("pause");
	return 0;
}