Answers for "vector cpp .com"

c++ vector

#include <vector>

int main() {
  std::vector<int> v;
  v.push_back(10); // v = [10];
  v.push_back(20); // v = [10, 20];
  
  v.pop_back(); // v = [10];
  v.push_back(30); // v = [10, 30];
  
  auto it = v.begin();
  int x = *it; // x = 10;
  ++it;
  int y = *it; // y = 30
  ++it;
  bool is_end = it == v.end(); // is_end = true
  
  return 0;
}

c++ vector

#include <vector>
#include <string>

int main() {
  std::vector<std::string> str_v;
  str_v.push_back("abc");
  str_v.push_back("hello world!!");
  str_v.push_back("i'm a coder.");
  for(auto it = str_v.beigin();it != str_v.end(); it++) {
  	printf("%sn",it->c_str());
  }
}

vector c++

Vectors are sequence container that can change size. Container is a objects 
that hold data of same type. Sequence containers store elements strictly in 
linear sequence.

Vector stores elements in contiguous memory locations and enables direct access
to any element using subscript operator []. Unlike array, vector can shrink or
expand as needed at run time. The storage of the vector is handled automatically.

To support shrink and expand functionality at runtime, vector container may 
allocate some extra storage to accommodate for possible growth thus container
have actual capacity greater than the size. Therefore, compared to array, vector
consumes more memory in exchange for the ability to manage storage and grow 
dynamically in an efficient way.

Zero sized vectors are also valid. In that case vector.begin() and vector.end()
points to same location. But behavior of calling front() or back() is undefined.