摘要：
deque deq; for (int i = 0; i < 20; ++i) { deq.push_back(i); } for (int j = 0; j < 20; ++j) { int tem = deq.back(); cout << tem << " " ; deq.pop_back(); //cout << deq[j] << " "; } cout << endl; cout << "双端队列中元素总数:" << deq.s 阅读全文
摘要：
#include #include #include "TestFunction.h"#include #include using namespace std;//using ::testing::InitGoogleTest;using namespace testing;#pragma comment(lib, "gtestd.lib")void main(int argc, char **argv){ /*priority_queue pqe; pqe.push(10); pqe.push(15); pqe.push(18); pqe.push( 阅读全文
摘要：
#include #include #include "TestFunction.h"#include using namespace std;//using ::testing::InitGoogleTest;using namespace testing;#pragma comment(lib, "gtestd.lib")void main(int argc, char **argv){ /*cout > total; SeekScore(total); int wait; cin >> wait;*/ //GTEST_FLAG(o 阅读全文
摘要：
#include using namespace std;class TTest{public: void (TTest::*pfun)(void); void test(); void fun(void);};void TTest::fun(){ cout *pfun)(); }int main(){ TTest* t=new TTest(); t->fun(); t->test(); delete t; int wait; cin >> wait; return 0;} 阅读全文