十、set

vico老師set_difference,set_intersection,symmetric_differenceset_union，用于綜合應(yīng)用實例 copyright(C),2015-2020,公司名稱EDU.Co., :Vico Version:2.0 Date2015年08月 :標(biāo)準(zhǔn)類庫中的set操作： :2.0FunctionList:.int_tmain(intargc,_TCHAR*控制臺應(yīng)用程序 2.0 build//StandardLibraryalgorithm#include"stdafx.h"#include<iostream>usingstd::cout;usingstd::cin;using#include<algorithm> //algorithmdefinitions#include<iterator>int_tmain(intargc,_TCHAR*{constintSIZE1=10,SIZE2=5,SIZE3=20;inta1[SIZE1]={1,2,3,4,5,6,7,8,9,10};inta2[SIZE2]={4,5,6,7,8};inta3[SIZE3]={4,5,6,11,15std::ostream_iterator<int>output(cout,"cout<<"a1contains:";std::copy(a1,a1+SIZE1,output);cout<<"\na2contains:";std::copy(a2,a2+SIZE2,output);cout<<"\na3contains:";std::copy(a3,a3+SIZE2,output);//determinewhetherseta2iscompleycontainsedina1if(std::includes(a1,a1+SIZE1,a2,a2+SIZE2))cout<<"\n\na1includesa2.";cout<<"\n\na1doesnotincludesa2.//determinewhetherseta3iscompleycontainedinif(std::includes(a1,a1+SIZE1,a3,a3+SIZE2))cout<<"\na1includesa3.";cout<<"\//deter,omeelementsofa1notinint*ptr=std::set_difference(a1,a1+SIZE1,a2,a2+SIZE2,difference);cout<<"\n\nset_differenceofa1anda2is:";std::copy(difference,ptr,output);int//determineelementsinbotha1andptr=std::set_intersection(a1,a1+SIZE1,a2,a2+SIZE2,cout<<"\n\nset_intersectionofa1anda2is:";std::copy(intersection,ptr,output);intsymmetric_difference[SIZE1+//determineelementsofa1thatarenotina2andelementsofa2thatarenotina1ptr=std::set_symmetric_difference(a1,a1+SIZE1,a3,a3+SIZE2,symmetric_difference);cout<<"\n\nset_symmetric_differenceofa1anda3is:";std::copy(symmetric_difference,ptr,output);int//determineelementsthatareineitherorbothsetsptr=std::set_union(a1,a1+SIZE1,a3,a3+SIZE2,cout<<"\n\nset_unionofa1anda3is:";std::copy(unionSet,ptr,output);cout<<return}運(yùn)行結(jié)十一、lower_bound,upper_bound和 算法中包括函數(shù)有： copyright(C),2015-2020,公司名稱 : :Vico Version:2.0 Date2015年08月 :STL算法： :2.0F_tmain(intargc,_TCHAR*argv[]) 2.0 build//StandardLibraryfunctionslower_bound,upper_boundand//forasortedsequenceofvalues.#include"stdafx.h"#include<iostream>usingstd::cout;usingstd::cin;usingstd::endl;#include<algorithm> //algorithmdefinitions#include<vector> //vectorclass-template#include //int_tmain(intargc,_TCHAR*{constintSIZE=inta1[SIZE]={2,2,4,4,4,6,6,6,6,8std::vector<int>v(a1,a1+SIZE);std::ostream_iterator<int>output(cout,"");cout<<"Vectorvcontains:\n";std::copy(v.begin(),v.end(),output);//determinelower-boundinsertionpointfor6invstd::vector<int>::iteratorlower;lower=std::lower_bound(v.begin(),v.end(),6);cout<<"\n\nLowerboundof6iselement"<<(lower-v.begin())<<"ofvectorv//determineupper-boundinsertionpointfor6invstd::vector<int>::iteratorupper;upper=std::upper_bound(v.begin(),v.end(),6);cout<<"\nUpperboundof6iselement"<<(upper-v.begin())<<"ofvectorv//useequal_rangetodetermineboththelower-andupper-boundinsertionpointsfor6std::vector<int>::iterator>eq;eq=std::equal_range(v.begin(),v.end(),cout<<"\nUsingequal_range:\nLowerboundof6iselement"<<(eq.-v.begin())<<"ofvectorv";cout<<"\nUpperboundof6iselement"<<(eq.second-v.begin())<<"ofvectorvcout<<"\n\nUserlower_boundtolocatethe<<"atwhich5canbeinsertedinorder//determinelower-boundinsertionpointfor5inlower=std::lower_bound(v.begin(),v.end(),5);cout<<"\nLower_boundof5iselement"<<(lower-v.begin())<<"ofvectorvcout<<"\n\nUseUpper_boundtoloatethelastpoint<<"atwhich7canbeinsertedinorder//determineupper-boundinsertionpointfor7invupper=std::upper_bound(v.begin(),v.end(),7);cout<<"\nUpper_boundof7iselement"<<(upper-v.begin())<<"ofvectorvcout<<"\n\nUseequal_rangetolocatetheand<<"lastpointatwhich5canbeinsertedinorder.eq=std::equal_range(v.begin(),v.end(),5);cout<<"\nLowerboundof5iselement<<(eq.-v.begin())<<"ofvectorv";cout<<"\nUpperboundof6iselement"<<(eq.second-v.begin())<<"ofvectorv"<<return}運(yùn)行結(jié)十二、堆排等于這個節(jié)點(diǎn)的值。按照這種方式排序的堆，通常被稱為最大堆（maxheap綜合應(yīng)用實例 copyright(C),2015-2020,公司名稱EDU.Co., :STLPushPopHeapMakeSortheap.cpp :Vico Version:2.0 Date2015年08月 :執(zhí)行堆排序的標(biāo)準(zhǔn)類庫函 :2.0FunctionList:.int_tmain(intargc,_TCHAR*argv[]) 2.0 build//StandardLibraryalgorithmpush_heap,pop_heap,make_heapandsort_heap.#include"stdafx.h"#includeusingstd::cout;usingstd::cin;usingstd::endl;#include<algorithm>#include<vector>#include<iterator>int_tmain(intargc,_TCHAR*{constintSIZE=inta[SIZE]={3,100,52,77,22,31,1,98,13,40 v(a,a+SIZE);std::vector<int>v2;std::ostream_iterator<int>output(cout,"");cout<<"Vectorvbeforemake_heap:";std::copy(v.begin(),v.end(),output);std::make_heap(v.begin(),v.end()); //createheapfromvectorvcout<<"\nVectorvaftermake_heap:std::copy(v.begin(),v.end(),std::sort_heap(v.begin(),v.end()); //sorementswithsort_heapcout<<"\nVectorvaftersort_heap:\n";std::copy(v.begin(),v.end(),output);//performtheheapsortwithpush_heapandpop_heapcout<<"\n\nArrayacontains :";std::copy(a,a+SIZE,output);cout<<endl;//placeelementsofarrayaintov2//maintionelementofv2inheapfor(inti=0;i<SIZE;i++){std::push_heap(v2.begin(),v2.end());cout<<"\nv2afterpush_heap(a["<<i<<"]):";std::copy(v2.begin(),v2.end(),output);}cout<<//removeelementsfromheapinsortedorderfor(unsignedintj=0;j<v2.size();j++){\n}

cout<<"\nv2after"<<v2[0]<<"popped