向量具有在插入或删除元素时自动像动态数组一样自动调整大小的能力,容器可以自动处理其存储。矢量元素放置在连续的存储中,以便可以使用迭代器对其进行访问和遍历。可以在向量的开头,中间或结尾插入或删除数据。
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.
本文向大家介绍在STL中实现集的C ++程序,包括了在STL中实现集的C ++程序的使用技巧和注意事项,需要的朋友参考一下 Set是抽象数据类型,其中每个元素都必须是唯一的,因为元素的值可以标识它。一旦将元素的值添加到集合中,就无法对其进行修改,但是可以删除并添加该元素的修改后的值。 功能和说明: 范例程式码 输出结果
本文向大家介绍在STL中实现Priority_queue的C ++程序,包括了在STL中实现Priority_queue的C ++程序的使用技巧和注意事项,需要的朋友参考一下 优先级队列是一种容器适配器,其中队列的第一个元素是队列中所有元素中最大的。元素在优先级队列中的顺序也不减。在优先级队列中,高优先级的元素在低优先级的元素之前得到服务。 功能和说明: 范例程式码 输出结果
本文向大家介绍在STL中实现Forward_List的C ++程序,包括了在STL中实现Forward_List的C ++程序的使用技巧和注意事项,需要的朋友参考一下 STL中的转发列表实现单链列表。列表与forward_list不同,该列表跟踪下一个和上一个元素。 前向列表仅跟踪下一个元素的位置,因此增加了存储每个元素所需的存储空间。forward_list的缺点是单个元素无法直接访问,并且不能
本文向大家介绍C ++程序在STL中实现Prev_Permutataion,包括了C ++程序在STL中实现Prev_Permutataion的使用技巧和注意事项,需要的朋友参考一下 STL中的Prev_permutation用于将范围[first,last]中的元素重新排列到先前的字典上较小的排列。排列是N的每一个!元素可以采取的可能安排。这是一个在STL中实现Prev_permutation的
本文向大家介绍C ++程序在STL中实现Next_Permutation,包括了C ++程序在STL中实现Next_Permutation的使用技巧和注意事项,需要的朋友参考一下 STL中的next_permutation用于将[first,last]范围内的元素重新排列到下一个字典上更大的排列。排列是N的每一个!元素可以采取的可能安排。这是C ++程序,用于在STL中实现Next_permuta
本文向大家介绍C ++程序在STL中实现堆栈,包括了C ++程序在STL中实现堆栈的使用技巧和注意事项,需要的朋友参考一下 堆栈是遵循特定操作顺序的线性数据结构。订单可以是FILO(先进先出)或LIFO(先进先出) 算法 范例程式码 输出结果