-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathvector1.cpp
More file actions
115 lines (98 loc) · 2.35 KB
/
Copy pathvector1.cpp
File metadata and controls
115 lines (98 loc) · 2.35 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
//
// main.cpp
// vector1
//
// Created by Silly on 14-1-23.
// Copyright (c) 2014年 Silly. All rights reserved.
//
#include <iostream>
#include <vector>
#include <numeric>
#include <algorithm>
using namespace std;
bool comp(const int &a,const int &b){
if (a != b) {
return a > b;
} else return a > b;
}
int main(int argc, const char * argv[])
{
vector<int> v(10);
for (int i = 0; i < 10; i++) {
v[i] = i;
}
reverse(v.begin(), v.end());
for (vector<int>::iterator it = v.begin(); it < v.end(); it++) {
cout << *it << " ";
}
cout << endl;
sort(v.begin(), v.end());
for (vector<int>::iterator it = v.begin(); it < v.end(); it++) {
cout << *it << " ";
}
cout << endl;
sort(v.begin(), v.end(), comp);
for (vector<int>::iterator it = v.begin(); it < v.end(); it++) {
cout << *it << " ";
}
cout << endl;
cout << v.size() << endl;
cout << v.empty() << endl;
v.clear();
cout << v.size() << endl;
cout << v.empty() << endl;
return 0;
/*
v.push_back(2);
v.push_back(7);
v.push_back(9);
cout << v[0] << v[1] << v[2] << endl;
for (vector<int>::iterator it = v.begin(); it < v.end(); it++) {
cout << *it << endl;
}
cout << endl;
v.insert(v.begin(), 8);
v.insert(v.begin() + 2, 1);
v.insert(v.end(), 3);
vector<int>::iterator it;
for (it = v.begin(); it < v.end(); it++) {
cout << *it << endl;
}
*/
/*
vector<int>::iterator it;
cout << endl;
for (int i = 0; i < 10; i++) {
v[i] = i;
}
for (it = v.begin(); it < v.end(); it++) {
cout << *it << " ";
}
cout << endl;
v.erase(v.begin() + 2);
for (it = v.begin(); it < v.end(); it++) {
cout << *it << " ";
}
cout << endl;
v.erase(v.begin() + 1, v.begin() + 5);
for (it = v.begin(); it < v.end(); it++) {
cout << *it << " ";
}
cout << endl;
v.clear();
cout << v.size() << endl;
return 0;
*/
/*
vector<int> v;
for (int i = 0; i < 10; i++) {
v.push_back(i);
}
for (vector<int>::iterator it = v.begin(); it < v.end(); it++) {
cout << *it << " ";
}
cout << endl;
cout << accumulate(v.begin(), v.end(), 0) << endl;
return 0;
*/
}