We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
We don't want to use C-style array in C++. We use STL containers instead, which have a lot of advantages such as being compatible with STL algorithms, or providing useful member functions such as 'std::vector::size()' (to get the size of the array :D). In this case, we can use 'std::vector', which is a dynamic array. Here's the solution in true C++:
#include<vector>#include<iostream>#include<iterator>intmain(){std::size_tsize{};// Here we use 'std::size_t' instead of 'int'// because an array size cannot be negativestd::cin>>size;std::vector<int>vect(size);for(std::size_ti{};i<size;++i)std::cin>>vect[i];// One of the many advantages to use C++ STL containers:// we can use reverse iteratorsfor(autorit=vect.rbegin();rit!=vect.rend();++rit)std::cout<<*rit<<' ';std::cout<<std::endl;return0;}
If you don't want to use std::vector here, you can use std::array instead, not C-style arrays.
And no, std::vector is not 'much more heavier'. It depends on how you use it (i.e. if you do a lot of reallocations). In my code, there is only one allocation since I provide the size at the initialization.
After we test an essayist's exploration and logical aptitudes with an example task, we direct a telephone meet with every one of them actually. This isn't the end. BrilliantWriter screen authors, edit papers they make, and trade criticism with them. That way, they continue building up their aptitudes and skill.
Arrays Introduction
You are viewing a single comment's thread. Return to all comments →
We don't want to use C-style array in C++. We use STL containers instead, which have a lot of advantages such as being compatible with STL algorithms, or providing useful member functions such as 'std::vector::size()' (to get the size of the array :D). In this case, we can use 'std::vector', which is a dynamic array. Here's the solution in true C++:
Dunno why those but in fact vector is much more heavier than plain array. So there is a good point in using it instead vector. Imho.
If you don't want to use std::vector here, you can use std::array instead, not C-style arrays.
And no, std::vector is not 'much more heavier'. It depends on how you use it (i.e. if you do a lot of reallocations). In my code, there is only one allocation since I provide the size at the initialization.
Why did you use "auto"? What's it means?
I thought it was used to declare local variables, is it another use?
std::array can not be used here because the size of an std::array must be provided at compile time.
After we test an essayist's exploration and logical aptitudes with an example task, we direct a telephone meet with every one of them actually. This isn't the end. BrilliantWriter screen authors, edit papers they make, and trade criticism with them. That way, they continue building up their aptitudes and skill.
Does
size_t size{}==size_t size? what does the{}means here please?Using g++ I get compile errors on this one.
Update to a newer GCC