#include <iostream>
#include <vector>
#include <numeric>
#include <algorithm>
using namespace std;
// ;
void rshow (vector<int> & v)
{
vector<int>::reverse_iterator riter; // ;
for (riter = v.rbegin(); riter < v.rend(); riter++)
cout << *riter << " ";
cout << endl;
}
int main (void)
{
const int size = 9;
vector<int> vect1;
vector<int> vect2(size);
for (int i = 1; i <= size; i++)
vect1.push_back(i);
rshow(vect1);
// ;
cout << accumulate(vect1.begin(), vect1.end(), 0) << endl;
// ;
sort(vect1.begin(), vect1.end(), greater<int>());
rshow(vect1);
// ;
copy(vect1.begin(), vect1.end(), vect2.begin());
rshow(vect2);
// ;
cout << boolalpha << equal(vect1.begin(), vect1.end(), vect2.begin()) << endl;
const int elem = 5;
// elem;
remove(vect1.begin(), vect1.end(), elem);
rshow(vect1);
// elem;
if (find(vect1.begin(), vect1.end(), elem) == vect1.end())
cout << "there is no \'" << elem << "\' element" << endl;
return 0;
}
, . , .
5.6. .
#include <iostream>
#include <vector>
using namespace std;
int main(void)
{
const int size = 5;
// ;
vector<vector<int> > ivec(size);
// ;
for (int i = 0; i < size; i++)
ivec[i].resize(size);
ivec[2][2] = 1;
for (int i = 0; i < size; i++) {
for (int j = 0; j < size; j++) {
cout << ivec[i][j] << " ";
}
cout << endl;
}
return 0;
}
5.6.
, string vector.
5.6.1. string
, , .
1. .
2. , .
3. , .
4. , .
5. , .
6. , .
7. .
|
|
|
8. , .
9. .
10. .
11. , .
12. .
13. , .
14. , .
15. , .
16. , .
17. , .
18. , .
19. .
20. .
5.6.2. vector
1. 3.8.1. .
2. 3.8.2. .
6.
6.1.
fstream, ofstream ifstream. . >> << , .
