qq_31248551的博客

#include #include #include using namespace std;int main(){ vector ivec; for (int i = 4; i <= 8; ++i) ivec.push_back(i); for (int i = 3; i <= 7; ++i) ivec.push_back(i); for (int i = 1;

#include #include using namespace std;void PrintListContents(const list& listInput); int main(){ std::list a; // 创建一个list， a.push_front(4); a.push_front(3); list::iterator iElementValue

#include #include using namespace std;void PrintListContents(const list& listInput);int main(){ list a; list b; std::list::iterator iter; b.push_back(100); b.push_back(200); PrintList

#include #include #include #include using namespace std;int main(){ vector ivec; vector ivec2; vector ivec3; for (int i = 1; i <= 9; ++i) { ivec.push_back(i); ivec2.push_back(i); iv

#include #include #include #include using namespace std;int main(){ vector ivec; ivec.push_back(1); ivec.push_back(2); ivec.push_back(3); for (vector::iterator iter = ivec.begin(); iter !

#include #include #include #include using namespace std;int main(){ set iset; for (int i = 1; i <= 9; ++i) iset.insert(i); for (set::iterator iter = iset.begin(); iter != iset.end(); ++it

#include #include #include #include #include using namespace std;int main(){ vector ivec; for (int i = 0; i <= 9; ++i) ivec.push_back(i); for (vector::iterator iter = ivec.begin(); iter

#include #include #include // 算法的头文件，int main(){ using namespace std; deque a; a.push_back(2); a.push_back(3); a.push_front(4); for (size_t nCount = 0; nCount < a.size(); ++nCount) {

#include #include #include #include #include #include using namespace std;bool differenceOne(int elem1, int elem2){ return elem1 + 1 == elem2 || elem1 - 1 == elem2;}int main(){ int sou

#include #include #include #include #include #include using namespace std;int main(){ list ilist; for (int i = 1; i <= 6; ++i) ilist.push_back(i); for (int i = 1; i <= 9; ++i) ilist.p

#include #include #include #include #include using namespace std;int main(){ list ilist; for (int i = 1; i <= 6; ++i) { ilist.push_front(i); ilist.push_back(i); } for (list::iterator

#include #include #include #include #include using namespace std;int main(){ list ilist; for (int i = 2; i <= 7; ++i) ilist.push_back(i); for (int i = 4; i <= 9; ++i) ilist.push_back(i

#include #include #include #include #include using namespace std;int main(){ list slist; slist.push_back("xiao cui"); slist.push_back(" ai"); slist.push_back(" ni"); fill(slist.begin(),

#include #include #include #include using namespace std;int main(){ vector ivec1; vector ivec2; ivec1.push_back(1); ivec1.push_back(2); ivec1.push_back(3); ivec2.push_back(10); ivec2.p

#include #include //#include #include //#include using namespace std;void sequare(int& elem) // 这个函数必须进行引用传递，即&这里没有返回值，引用计算的速度非常的快，可以直接进行修改，{ elem = elem * elem;}int sequare2(int elem) //

#include #include using namespace std;void PrintListContents(const list& listInput);int main(){ std::list a; a.push_front(5); a.push_front(8); a.push_front(0); PrintListContents(a); a

#include #include #include #include using namespace std;int main(){ stack> a; //a是deque类的堆栈， stack> b; stack> c; stack d; // d是默认的deque类的堆栈，堆栈是后进先出， d.push(2); d.push(1

#include #include #include #include #include using namespace std;int main(){ deque ideq; for (int i = 4; i <= 8; ++i) ideq.push_back(i); for (int i = 3; i <= 7; ++i) ideq.push_back(i

#include #include #include #include #include #include using namespace std;//bool lessLength(const string& s1, const string& s2)//{// return s1.length() < s2.length();//}int main(){ deq

#include #include #include #include using namespace std;bool lessLength(const string& s1, const string& s2){ return s1.length() < s2.length();}int main(){ vector svec; vector svec2; s

#include #include #include #include using namespace std;int main(){ deque ideq; for (int i = 1; i <= 9; ++i) ideq.push_back(i); for (int i = 1; i <= 9; ++i) ideq.push_back(i); for (deq

#include #include #include #include using namespace std;int main(){ list ilist; ilist.push_back(100); ilist.push_back(200); ilist.push_back(300); cout << "容器数据的个数：" << ilist.size() << e

#include #include #include #include using namespace std;class Dog{ // 成员省略 // 必须有 >, >=,<,<=,==,!=};int main(){ vector ivec1; vector ivec2; vector dog1; vector dog2; ivec1.push_b

#include #include #include #include #include using namespace std;int main(){ vector svec; list slist; deque sdeq; svec.push_back("xiao"); svec.push_back("cui"); svec.push_back("ai");

#include #include #include #include using namespace std;int main(){ vector a; list b; deque c; a.push_back(1); a.push_back(2); a.push_back(3); for (vector::size_type i = 0; i < a.size

#include #include #include using namespace std;vector::iterator findInt(vector::iterator beg, vector::iterator end, int ival){ while (beg != end) if (*beg == ival) break; else ++beg;

#include #include #include #include using namespace std;bool findInt(vector::iterator beg, vector::iterator end, int ival);int main(){ vector a; a.push_back(5); a.push_back(10); a.push_b

#include #include #include #include using namespace std;int main(){ vector a; deque b; list c; a.push_back(1); a.push_back(2); a.push_back(3); vector::iterator iter1 = a.begin(); vec

#include #include #include #include #include "Dog.h"#include "Cat.h"#include using namespace std;int main(){ vector svec;// 默认的构造函数， svec.push_back("hello"); svec.push_back("C++"); svec

#include #include // 优先级队列也在这里边，#include using namespace std;int main(){ //priority_queue> pq3; priority_queue pq; // 最大值优先级队列，默认的是vector类， //priority_queue,greater> pq2;

#include #include #include #include using namespace std;int main(){ queue> a; queue> b; //队列没有迭代器，堆栈也没有迭代器，不能修改队列中的数据， queue q; //这个是默认的deque类， queue插入数据是在队尾插入，删除数据是在队首

#include #include #include #include #include #include using namespace std;int main(){ vector ivec; list ilist; for (int i = 1; i <= 9; ++i) ivec.push_back(i); for (vector::iterator it

#include #include #include #include #include #include using namespace std;int main(){ vector ivec; list ilist; for (int i = 1; i <= 9; ++i) ivec.push_back(i); for (vector::iterator it

#include #include #include #include #include using namespace std;// 一元谓词//bool isEven(int elem)//{// cout << elem % 2 == 0;//}int main(){ vector ivec; ivec.push_back(4); for (int i =

#include #include #include #include using namespace std;void print(int elem){ cout << elem << ' ';}// 函数对象，class PrintInt{public: void operator() (int elem) const { cout << elem << '

#include #include using namespace std;typedef multiset MSETINT; // MSETINT是别名，int main(){ MSETINT a; a.insert(67); a.insert(7); a.insert(-2); a.insert(20); a.insert(50); MSETINT::co

#include #include using namespace std;typedef set SETINT; // SETINT是别名，int main(){ SETINT a; a.insert(67); a.insert(7); a.insert(-2); SETINT::const_iterator i; for (i = a.begin(); i

#include #include using namespace std;template // 模板函数， 在这里的模板函数是为了声明，void PrintContents(const Container & c);int main(){ set a; multiset ma; a.insert(80); a.insert(-1); // set 不能保存相

#include #include #include using namespace std;int main(){ map a; // map是映射， multimap ma; // multimap是多映射， // key键 value值 a.insert(map::value_type(1, "one

#include #include using namespace std;int main(){ string s1("abcdxy"); string s2("abcexy"); if (s1.compare(s2) > 0) cout << "s1是大的。" << endl; if (s1.compare(s2) < 0) cout << "s2是大的。" << endl