figure1-4.cpp

这是清华出的这本经典的数据结构第三版上的随书例子。希望对大家有用。

#include <iostream>
#include <vector>
#include <algorithm>
#include <functional> // greater<>

using namespace std;

template<class T>
void printVector(char *s, const vector<T>& v) {
    cout << s << " = (";
    if (v.size() == 0) {
        cout << ")\n";
        return;
    }
    typename vector<T>::const_iterator i = v.begin();
    for ( ; i != v.end()-1; i++)
        cout << *i << ' ';
    cout << *i << ")\n";
}

bool f1(int n) {
    return n < 4;
}

int main() {
    int a[] = {1,2,3,4,5};
    vector<int> v1;      
    printVector("v1",v1);  // v1 is empty, size = 0, capacity = 0
    cout << "size = " << v1.size() << ", capacity = " << v1.capacity() << endl;
    for (int j = 1; j <= 5; j++)
        v1.push_back(j);   // v1 = (1 2 3 4 5), size = 5, capacity = 8
    printVector("v1",v1);
    cout << "size = " << v1.size() << ", capacity = " << v1.capacity() << endl;
    vector<int> v2(3,7); 
    printVector("v2",v2);  // v2 = (7 7 7)
    vector<int>::iterator i1 = v1.begin()+1;
    vector<int> v3(i1,i1+2); 
    printVector("v3",v3);  // v3 = (2 3), size = 2, capacity = 2
    cout << "size = " << v3.size() << ", capacity = " << v3.capacity() << endl;
    vector<int> v4(v1);  
    printVector("v4",v4);  // v4 = (1 2 3 4 5), size = 5, capacity = 5
    cout << "size = " << v4.size() << ", capacity = " << v4.capacity() << endl;
    vector<int> v5(5);   
    printVector("v5",v5);  // v5 = (0 0 0 0 0)
    v5[1] = v5[3] = 9;
    printVector("v5",v5);  // v5 = (0 9 0 9 0)
    v3.reserve(6);       
    printVector("v3",v3);  // v3 = (2 3), size = 2, capacity = 6
    cout << "size = " << v3.size() << ", capacity = " << v3.capacity() << endl;
    v4.resize(7);        
    printVector("v4",v4);  // v4 = (1 2 3 4 5 0 0), size = 7, capacity = 10
    cout << "size = " << v4.size() << ", capacity = " << v4.capacity() << endl;
    v4.resize(3);        
    printVector("v4",v4);  // v4 = (1 2 3), size = 3, capacity = 10
    cout << "size = " << v4.size() << ", capacity = " << v4.capacity() << endl;
    v4.clear();          
    printVector("v4",v4);  // v4 is empty, size = 0, capacity = 10 (!)
    cout << "size = " << v4.size() << ", capacity = " << v4.capacity() << endl;
    v4.insert(v4.end(),v3[1]);
    printVector("v4",v4);         // v4 = (3)
    v4.insert(v4.end(),v3[1]);
    printVector("v4",v4);         // v4 = (3 3)
    v4.insert(v4.end(),2,4);
    printVector("v4",v4);         // v4 = (3 3 4 4)
    v4.insert(v4.end(),v1.begin()+1,v1.end()-1); 
    printVector("v4",v4);         // v4 = (3 3 4 4 2 3 4)
    v4.erase(v4.end()-2);
    printVector("v4",v4);         // v4 = (3 3 4 4 2 4)
    v4.erase(v4.begin(), v4.begin()+4);
    printVector("v4",v4);         // v4 = (2 4)
    v4.assign(3,8);             
    printVector("v4",v4);         // v4 = (8 8 8)
    v4.assign(a,a+3);  
    printVector("v4",v4);         // v4 = (1 2 3)
    vector<int>::reverse_iterator i3 = v4.rbegin();
    for ( ; i3 != v4.rend(); i3++)
        cout << *i3 << ' ';       // print: 3 2 1
    cout << endl;

//  algorithms

    v5[0] = 3;           
    printVector("v5",v5);         // v5 = (3 9 0 9 0)
    replace_if(v5.begin(),v5.end(),f1,7);
    printVector("v5",v5);         // v5 = (7 9 7 9 7)
    v5[0] = 3; v5[2] = v5[4] = 0;
    printVector("v5",v5);         // v5 = (3 9 0 9 0)
    replace(v5.begin(),v5.end(),0,7);
    printVector("v5",v5);         // v5 = (3 9 7 9 7)
    sort(v5.begin(),v5.end()); 
    printVector("v5",v5);         // v5 = (3 7 7 9 9)
    sort(v5.begin(),v5.end(),greater<int>()); 
    printVector("v5",v5);         // v5 = (9 9 7 7 3)
    v5.front() = 2;         
    printVector("v5",v5);         // v5 = (2 9 7 7 3)
}