C++ 栈简例

1.简例1 

stack<int> mystack;

/*

 * @Description: 

 * @Version: 

 * @Autor: zolty

 * @Date: 2020-12-31 21:17:59

 * @LastEditors: zolty

 * @LastEditTime: 2021-01-03 20:02:03

 */

#include <stack>

#include <iostream>

using namespace std;

 

int main()

{

	stack<int> mystack;

	int sum = 0;

	for (int i = 0; i <= 10; i++){

		mystack.push(i);

	}

	cout << "now size : "<<mystack.size()<<endl;

	while (!mystack.empty()){

		cout << "now size : "<<mystack.size()<<" stackTop: "<< mystack.top()<<endl;

		mystack.pop();

	}

	cout << "now size : "<<mystack.size()<<endl;

	return 0;

}

// now size : 11

// now size : 11 stackTop: 10

// now size : 10 stackTop: 9

// now size : 9 stackTop: 8

// now size : 8 stackTop: 7

// now size : 7 stackTop: 6

// now size : 6 stackTop: 5

// now size : 5 stackTop: 4

// now size : 4 stackTop: 3

// now size : 3 stackTop: 2

// now size : 2 stackTop: 1

// now size : 1 stackTop: 0

// now size : 0

2.简例2 

stack<char *> mystack;

/*

 * @Description: 

 * @Version: 

 * @Autor: zolty

 * @Date: 2020-12-31 21:17:59

 * @LastEditors: zolty

 * @LastEditTime: 2021-01-03 21:02:53

 */

#include <stack>

#include <iostream>

#include <string.h>

using namespace std;



int main()

{

	stack<char *> mystack;

	cout << "now size : " << mystack.size() << endl;

	char *a = (char *)malloc(sizeof(char) * 160);

	const uint8_t chbuf[160] = {

		0x03, 0xb7, 0x80, 0x00, 0x00, 0x00, 0x02, 0x20, 0x00, 0x00,

		0x0c, 0x7f, 0x99, 0x09, 0x53, 0xe9, 0xd6, 0x70, 0xd2, 0xd9,

		0xe2, 0x15, 0xe0, 0x00, 0x00, 0x00, 0x10, 0x0e, 0x00, 0x00,

		0xb3, 0x9f, 0x8f, 0xa0, 0xfa, 0x0f, 0xef, 0xff, 0xff, 0xd0,

		0x00, 0x02, 0xe0, 0x7a, 0x40, 0x03, 0x37, 0xcf, 0xcf, 0x64,

		0x21, 0x00, 0x00, 0x00, 0x16, 0xb4, 0x9d, 0x20, 0x0d, 0x69,

		0x3a, 0x3f, 0xe2, 0x00, 0x00, 0x00, 0x38, 0x00, 0x00, 0x02,

		0x07, 0x88, 0x00, 0x80, 0x01, 0x00, 0x00, 0x00, 0x00, 0x00,

		0x00, 0x3f, 0xff, 0x80, 0x38, 0x00};

	printf("%02X \n", chbuf[1] & 0xff);

	memcpy(a, chbuf, 160);

	mystack.push(a);

	cout << "now size : " << mystack.size() << endl;

	while (!mystack.empty())

	{

		printf("%02X \n", mystack.top()[1] & 0xff);

		mystack.pop();

	}

	cout << "now size : " << mystack.size() << endl;

	return 0;

}

// now size : 0

// B7

// now size : 1

// B7

// now size : 0

 

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值