随笔分类 - C++
摘要：vector<int>::iterator iter1 = partial_sort_copy(deq1.begin(), deq1.end(), vec1.begin(), vec1.end());
阅读全文
摘要：#include <iostream>#include <deque>#include <algorithm>#include <vector>#include <functional> using namespace std; int main(){ deque<int> deq1; deque<
阅读全文
摘要：#include <iostream>#include <deque>#include <algorithm>#include <vector> using namespace std; int main(){ deque<int> deq1; deque<int>::iterator deq_it
阅读全文
摘要：#include <iostream>#include <deque>#include <algorithm>#include <vector> using namespace std; int main(){ deque<int> deq1; deque<int>::iterator deq_it
阅读全文
摘要：#include <iostream>#include <deque>#include <algorithm>#include <functional> using namespace std; int main(){ deque<int> deque1; for (int k=0;k<15;k++
阅读全文
摘要：#include <iostream>#include <algorithm>#include <vector> using namespace std; int main(){ vector<int> vec1; for (int k=0;k<5;k++) { vec1.push_back(ran
阅读全文
摘要：#include <iostream>#include <algorithm>#include <vector>#include <iterator> using namespace std; int main(){ vector<int> vec1; for (int k=0;k<10;k++)
阅读全文
摘要：#include <iostream>#include <algorithm>#include <list>#include <iterator>#include <functional> using namespace std; int main(){ int source[] = { 1,2,3
阅读全文
摘要：#include <iostream>#include <list>#include <algorithm>#include <iterator>#include <functional> using namespace std; int main(){ list<int> list1; list<
阅读全文
摘要：#include <iostream>#include <algorithm>#include <vector>#include <list>#include <string>#include <functional>#include<iterator> using namespace std; i
阅读全文
摘要：#include <iostream>#include <vector>#include <deque>#include <algorithm> using namespace std; int main(){ vector<int> vec1; deque<int> deq1; for (int
阅读全文
摘要：#include<iostream>#include<vector>#include <list>#include <algorithm>#include <functional> using namespace std; //不需拷贝，速度快void square(int &elementPara
阅读全文
摘要：list<char>::iterator pos; 一般使用前置式递增(preincrement)，因为它比后置式递增(postincrement)效率高，因为后置式递增内部需要一个临时对象，因为它必须存放迭代器原来的位置并返回之。
阅读全文
摘要：#include<iostream>#include<vector>#include <list>#include <algorithm>#include <functional> using namespace std; int main(){ vector<int> vec1; list<int
阅读全文
摘要：#include <iostream>#include <algorithm>#include <vector>#include <functional>#include <list> using namespace std; int main(){ list<int> list1; for (in
阅读全文
摘要：#include <iostream>#include <algorithm>#include <list>#include <functional>#include <vector> using namespace std; //已序区间查找int main(){ list<int> list1;
阅读全文
摘要：#include <iostream>#include <algorithm>#include <deque>#include <list>#include <vector>#include <functional> using namespace std; //二元谓词bool isEven(in
阅读全文
摘要：#include <iostream>#include <list>#include <algorithm> using namespace std; int main(){ list<int> list1; for (int k=0;k<10;k++) { list1.push_back(k);
阅读全文
摘要：#include <iostream>#include <algorithm>#include <deque> using namespace std; //二元谓词//比较两个数的大小bool absLess(int elementParam1,int elementParam2){ return
阅读全文
摘要：#include <iostream>#include <algorithm>#include <vector>#include <functional>#include<set> using namespace std; //一元谓词bool isEven(int elementParam){ i
阅读全文
浙公网安备 33010602011771号