資料結構
網路
RDBMS
作業系統
Java
MS Excel
iOS
HTML
CSS
Android
Python
C 語言程式設計
C++
C#
MongoDB
MySQL
Javascript
PHP
物理學
化學
生物學
數學
英語
經濟學
心理學
社會學
時尚研究
法律研究C++ 程式在 STL 中實現向量
插入或刪除元素時，向量可以透過自動調整自身大小像動態陣列一樣，容器會自動處理它們的儲存。向量元素放置在連續儲存中，這樣可以使用迭代器訪問和遍歷。可以在向量的頭部、中間或末尾處插入或刪除資料。
函式和說明
List of functions used here: v.size() = Returns the size of vector. v.push_back() = It is used to insert elements to the vector from end. v.pop_back() = To pop out the value from the vector from back. v.capacity() = Returns the size of the storage space currently allocated to the vector as number of elements. v.clear() = Clears the vector.
示例程式碼
#include <iostream>
#include <vector>
using namespace std;
int main() {
vector<int> v;
vector<int>::iterator it;
int c, i;
while (1) {
cout<<"1.Size of the Vector"<<endl;
cout<<"2.Insert Element into the Vector"<<endl;
cout<<"3.Delete Last Element of the Vector"<<endl;
cout<<"4.Display the capacity of vector"<<endl;
cout<<"5.Display by Iterator"<<endl;
cout<<"6.Clear the Vector"<<endl;
cout<<"7.Exit"<<endl;
cout<<"Enter your Choice: ";
cin>>c;
switch(c) {
case 1:
cout<<"Size of Vector: ";
cout<<v.size()<<endl;
break;
case 2:
cout<<"Enter value to be inserted: ";
cin>>i;
v.push_back(i);
break;
case 3:
cout<<"Delete Last Element Inserted:"<<endl;
v.pop_back();
break;
case 4:
cout<<"Displaying capacity of vector: ";
cout<<v.capacity()<<endl;
break;
case 5:
cout<<"Displaying Vector by Iterator: ";
for (it = v.begin(); it != v.end(); it++) {
cout<<*it<<" ";
}
cout<<endl;
break;
case 6:
v.clear();
cout<<"Vector Cleared"<<endl;
break;
case 7:
exit(1);
break;
default:
cout<<"Wrong Choice"<<endl;
}
}
return 0;
}輸出
1.Size of the Vector 2.Insert Element into the Vector 3.Delete Last Element of the Vector 4.Display the capacity of vector 5.Display by Iterator 6.Clear the Vector 7.Exit Enter your Choice: 1 Size of Vector: 0 1.Size of the Vector 2.Insert Element into the Vector 3.Delete Last Element of the Vector 4.Display the capacity of vector 5.Display by Iterator 6.Clear the Vector 7.Exit Enter your Choice: 2 Enter value to be inserted: 7 1.Size of the Vector 2.Insert Element into the Vector 3.Delete Last Element of the Vector 4.Display the capacity of vector 5.Display by Iterator 6.Clear the Vector 7.Exit Enter your Choice: 2 Enter value to be inserted: 6 1.Size of the Vector 2.Insert Element into the Vector 3.Delete Last Element of the Vector 4.Display the capacity of vector 5.Display by Iterator 6.Clear the Vector 7.Exit Enter your Choice: 2 Enter value to be inserted: 4 1.Size of the Vector 2.Insert Element into the Vector 3.Delete Last Element of the Vector 4.Display the capacity of vector 5.Display by Iterator 6.Clear the Vector 7.Exit Enter your Choice: 2 Enter value to be inserted: 3 1.Size of the Vector 2.Insert Element into the Vector 3.Delete Last Element of the Vector 4.Display the capacity of vector 5.Display by Iterator 6.Clear the Vector 7.Exit Enter your Choice: 2 Enter value to be inserted: 5 1.Size of the Vector 2.Insert Element into the Vector 3.Delete Last Element of the Vector 4.Display the capacity of vector 5.Display by Iterator 6.Clear the Vector 7.Exit Enter your Choice: 4 Displaying capacity of vector: 8 1.Size of the Vector 2.Insert Element into the Vector 3.Delete Last Element of the Vector 4.Display the capacity of vector 5.Display by Iterator 6.Clear the Vector 7.Exit Enter your Choice: 5 Displaying Vector by Iterator: 7 6 4 3 5 1.Size of the Vector 2.Insert Element into the Vector 3.Delete Last Element of the Vector 4.Display the capacity of vector 5.Display by Iterator 6.Clear the Vector 7.Exit Enter your Choice: 3 Delete Last Element Inserted: 1.Size of the Vector 2.Insert Element into the Vector 3.Delete Last Element of the Vector 4.Display the capacity of vector 5.Display by Iterator 6.Clear the Vector 7.Exit Enter your Choice: 5 Displaying Vector by Iterator: 7 6 4 3 1.Size of the Vector 2.Insert Element into the Vector 3.Delete Last Element of the Vector 4.Display the capacity of vector 5.Display by Iterator 6.Clear the Vector 7.Exit Enter your Choice: 6 Vector Cleared 1.Size of the Vector 2.Insert Element into the Vector 3.Delete Last Element of the Vector 4.Display the capacity of vector 5.Display by Iterator 6.Clear the Vector 7.Exit Enter your Choice: 7 Exit.
更新時間：30-07-2019
421 人瀏覽
廣告