C++ queue和priority_queue用法
2013-07-06 12:41
337 查看
#include <iostream>
#include <string>
#include "TestFunction.h"
#include <queue>
#include <gtest/gtest.h>
using namespace std;
//using ::testing::InitGoogleTest;
using namespace testing;
#pragma comment(lib, "gtestd.lib")
void main(int argc, char **argv)
{
/*priority_queue<int> pqe;
pqe.push(10);
pqe.push(15);
pqe.push(18);
pqe.push(56);
pqe.push(8);
int size = pqe.size();
for (int i = 0; i < size; ++i)
{
int tem = pqe.top();
pqe.pop();
cout << tem << " " ;
}*/
queue<int> que;
que.push(10);
que.push(15);
que.push(18);
que.push(56);
que.push(8);
for (int i = 0; i < size; ++i)
{
int tem;
tem = que.front();
cout << tem << " ";
que.pop();
}
int wait;
cin >> wait;
}
#include <string>
#include "TestFunction.h"
#include <queue>
#include <gtest/gtest.h>
using namespace std;
//using ::testing::InitGoogleTest;
using namespace testing;
#pragma comment(lib, "gtestd.lib")
void main(int argc, char **argv)
{
/*priority_queue<int> pqe;
pqe.push(10);
pqe.push(15);
pqe.push(18);
pqe.push(56);
pqe.push(8);
int size = pqe.size();
for (int i = 0; i < size; ++i)
{
int tem = pqe.top();
pqe.pop();
cout << tem << " " ;
}*/
queue<int> que;
que.push(10);
que.push(15);
que.push(18);
que.push(56);
que.push(8);
for (int i = 0; i < size; ++i)
{
int tem;
tem = que.front();
cout << tem << " ";
que.pop();
}
int wait;
cin >> wait;
}
相关文章推荐
- 【c++】STL里的priority_queue用法总结
- C++ priority_queue用法(大顶堆,小顶堆)
- C++ priority_queue用法(大顶堆,小顶堆)
- 【用法详解】C++-STL 队列queue与优先队列priority_queue的用法详解与学习心得
- C++ priority_queue用法
- C++ priority_queue 常见用法全解(代码版)
- C++中priority_queue的简单用法
- C++priority_queue的用法
- c++中priority_queue的用法
- c++ 优先队列 priority_queue 用法简介
- 【c++】STL里的priority_queue用法总结
- priority_queue的用法
- 【C++ STL】细数C++ STL 的那些事 -- priority_queue(优先队列)
- 栈(stack)、队列(queue)和优先队列(priority_queue)用法
- priority_queue的用法!
- 优先队列priority_queue 用法详解
- C++STL优先级队列priority_queue
- C++ STL priority_queue
- 优先队列priority_queue 用法详解
- 解析Java中PriorityQueue优先级队列结构的源码及用法