数据结构精品课程ppt2.pptVIP

Vector Class : STL vector container(容器) Construction 实验1 a.对比数组和向量的使用方法 使用函数实现冒泡排序算法，传递参数分别为数组和向量，要求数据不被破坏； b.设计函数，实现删除向量中重复元素的功能。要求：尽可能避免数据的大量移动。 lecture 2 – Dynamic array and Vector Container * Main Index Contents CLASS vector Constructors vector vector(T *first, T *last); Initialize the vector using the address range [first, last). The notation *first and *last is an example of pointer notation * Main Index Contents CLASS vector Operations vector T back(); Return the value of the item at the rear of the vector. Precondition: The vector must contain at least one element. ? const T back() const; Constant version of back(). ? bool empty() const; Return true if the vector is empty and false otherwise. * Main Index Contents CLASS vector Operations vector T operator[] (int i); Allow the vector element at index i to be retrieved or modified. Precondition: The index, i, must be in the range 0 ? i n, where n is the number of elements in the vector. Postcondition: If the operator appears on the left side of an assignment statement, the expression on the right side modifies the element referenced by the index. ? const T operator[] (int i) const; Constant version of the index operator. * Main Index Contents CLASS vector Operations vector void push_back(const T value); Add a value at the rear of the vector. Postcondition: The vector has a new element at the rear and its size increases by 1. ? void pop_back(); Remove the item at the rear of the vector. Precondition: The vector is not empty. Postcondition: The vector has a new element at the rear or is empty. * Main Index Contents CLASS vector Operations vector void resize((int n, const T fill = T()); Modify the size of the vector. If the size is increased, the value fill is added to the elements on the tail of the vector. If the size is dec