vector
是一个按照顺序排列,且会自动调整大小的数组,其内置接口与用法讲解
1.vector的定义
ps: 包含头文件:include <vector>
1.1.声明定义(只使用常用型)
(constructor)构造函数声明 | 接口说明 |
vector()(重点) | 无参构造 |
vector(size_type n, const value_type& val = value_type()) | 构造并初始化n个val |
vector (const vector& x); (重点) | 拷贝构造 |
vector (InputIterator first, InputIterator last); | 使用迭代器进行初始化构造 |
#include <iostream>
using namespace std;
#include <vector>
int main()
{
vector<int> v;
vector<int> ret(10,1);
vector<int> ren(ret);
}
1.2 vector iterator 的使用
也可以使用下标【】。
iterator的使用 | 接口说明 |
begin + end(重点) | 获取第一个数据位置的iterator/const_iterator, 获取最后一个数据的下一个位置 的iterator/const_iterator |
获取最后一个数据位置的reverse_iterator,获取第一个数据前一个位置的reverse_iterator | |
范围for | 迭代器调用 |
1.3 vector 空间增长问题
容量空间 | 接口说明 |
获取数据个数 | |
获取容量大小 | |
判断是否为空 | |
resize(重点) | 改变vector的size |
reserve (重点) | 改变vector的capacity |
// 测试vector的默认扩容机制
void TestVectorExpand(){
size_t sz;
vector<int> v;
sz = v.capacity();
cout << "making v grow:\n";
for (int i = 0; i < 100; ++i)
{
v.push_back(i);
if (sz != v.capacity())
{
sz = v.capacity();
cout << "capacity changed: " << sz << '\n';
}
}
}
making foo grow:
capacity changed: 1
capacity changed: 2
capacity changed: 3
capacity changed: 4
capacity changed: 6
capacity changed: 9
capacity changed: 13
capacity changed: 19
capacity changed: 28
capacity changed: 42
capacity changed: 63
capacity changed: 94
1.4. vector 增删查改
vector增删查改 | 接口说明 |
push_back(重点) | 尾插 |
pop_back (重点) | 尾删 |
查找。(注意这个是算法模块实现,不是vector的成员接口) | |
在position之前插入val | |
删除position位置的数据 | |
交换两个vector的数据空间 | |
operator[](重点) | 像数组一样访问 |
2.vector的使用 (浅代入)
class Solution {
public:
vector<vector<int>> generate(int numRows) {
vector<vector<int>> ret(numRows);
for (int i = 0; i < numRows; i++)
{
ret[i].resize(i+1);
ret[i][0]=ret[i][i] = 1;
for (int j = 1; j <i; j++)
{
ret[i][j]=ret[i - 1][j]+ret[i-1][j-1];
}
}
return ret;
}
};
3.模拟实现
namespace bit
{
template<class T>
class vector
{
public:
typedef T* iterator;
typedef const T* const_iterator;
//迭代器
iterator begin()
iterator end()
//构造
vector()
//迭代构造
template <class InputIterator>
vector(InputIterator first, InputIterator last)
//。。。。
vector<T>& operator=(vector<T> v)
//析构
~vector()
void swap(vector<T>& v)
size_t size() const
T& operator[](size_t pos)
size_t capacity() const
void reserve(size_t n)
void resize(size_t n, const T& val = T())
void insert(iterator pos, const T& val)
iterator erase(iterator pos)
private:
iterator _start = nullptr;
iterator _finish = nullptr;
iterator _endofstorage = nullptr;
};
}
迭代器:
迭代器返回的需求是地址。
typedef T* iterator;
typedef const T* const_iterator;
iterator begin()
{
return _start;
}
iterator end()
{
return _finish;
}
const_iterator begin() const
{
return _start;
}
const_iterator end() const
{
return _finish;
}
初始化构造:
vector()
{}
// v2(v1)
vector(const vector<T>& v)
{
reserve(v.capacity());
for (auto& e : v)
{
push_back(e);
}
}
//c++11
// vector<int> v1 = { 1,2,3,4,5,6,7,8,9,10 };
vector(initializer_list<T> il)
{
reserve(il.size());
for (auto& e : il)
{
push_back(e);
}
}
// 类模板的成员函数可以是函数模板
template <class InputIterator>
vector(InputIterator first, InputIterator last)
{
while (first != last)
{
push_back(*first);
++first;
}
}
vector(size_t n, const T& val = T())
{
reserve(n);
for (size_t i = 0; i < n; i++)
{
push_back(val);
}
}
//对上函数不足的bug修补
vector(int n, const T& val = T())
{
reserve(n);
for (int i = 0; i < n; i++)
{
push_back(val);
}
}
//赋值重载:将需拷贝变量的临时变量的空间值进行交互
vector<T>& operator=(vector<T> v)
{
swap(v);
return *this;
}
//析构函数:释放使用空间
~vector()
{
delete[] _start;
_start = _finish = _endofstorage = nullptr;
}
函数接口:
//size:数组大小(长度)
size_t size() const
{
return _finish - _start;
}
//下标访问
T& operator[](size_t pos)
{
assert(pos < size());
return _start[pos];
}
const T& operator[](size_t pos) const
{
assert(pos < size());
return _start[pos];
}
//数组空间大小(可容纳值)
size_t capacity() const
{
return _endofstorage - _start;
}
//修改空间大小
void reserve(size_t n)
{
if (n > capacity())
{
T* tmp = new T[n];
size_t old_size = size();
//memcpy(tmp, _start, size() * sizeof(T));
for (size_t i = 0; i < old_size; i++)
{
tmp[i] = _start[i];
}
delete[] _start;
_start = tmp;
_finish = tmp + old_size;
_endofstorage = tmp + n;
}
}
//修改数组长度
void resize(size_t n, const T& val = T())
{
if (n > size())
{
reserve(n);
// 插入
while (_finish < _start + n)
{
*_finish = val;
++_finish;
}
}
else
{
// 删除
_finish = _start + n;
}
}
//尾插数据
void push_back(const T& val)
{
insert(end(), val);
}
//尾删数据
void pop_back()
{
/*assert(!empty());
--_finish;*/
erase(end() - 1);
}
//为空判断
bool empty()
{
return _start == _finish;
}
//指定插入
void insert(iterator pos, const T& val)
{
assert(pos >= _start);
assert(pos <= _finish);
if (_finish == _endofstorage)
{
size_t len = pos - _start;
reserve(capacity() == 0 ? 4 : capacity() * 2);
// 如果扩容了要更新pos
pos = _start + len;
}
iterator it = _finish - 1;
while (it >= pos)
{
*(it + 1) = *it;
--it;
}
*pos = val;
++_finish;
}
指定删除
iterator erase(iterator pos)
{
assert(pos >= _start);
assert(pos < _finish);
iterator it = pos + 1;
while (it < _finish)
{
*(it - 1) = *it;
++it;
}
--_finish;
return pos;
}
全代码加模拟测试:
#define _CRT_SECURE_NO_WARNINGS
#include<iostream>
#include<assert.h>
using namespace std;
namespace bit
{
template<class T>
class vector
{
public:
typedef T* iterator;
typedef const T* const_iterator;
iterator begin()
{
return _start;
}
iterator end()
{
return _finish;
}
const_iterator begin() const
{
return _start;
}
const_iterator end() const
{
return _finish;
}
vector()
{}
// v2(v1)
vector(const vector<T>& v)
{
reserve(v.capacity());
for (auto& e : v)
{
push_back(e);
}
}
// vector<int> v1 = { 1,2,3,4,5,6,7,8,9,10 };
vector(initializer_list<T> il)
{
reserve(il.size());
for (auto& e : il)
{
push_back(e);
}
}
// 类模板的成员函数可以是函数模板
template <class InputIterator>
vector(InputIterator first, InputIterator last)
{
while (first != last)
{
push_back(*first);
++first;
}
}
vector(size_t n, const T& val = T())
{
reserve(n);
for (size_t i = 0; i < n; i++)
{
push_back(val);
}
}
vector(int n, const T& val = T())
{
reserve(n);
for (int i = 0; i < n; i++)
{
push_back(val);
}
}
void swap(vector<T>& v)
{
std::swap(_start, v._start);
std::swap(_finish, v._finish);
std::swap(_endofstorage, v._endofstorage);
}
// v1 = v3
vector<T>& operator=(vector<T> v)
{
swap(v);
return *this;
}
~vector()
{
delete[] _start;
_start = _finish = _endofstorage = nullptr;
}
size_t size() const
{
return _finish - _start;
}
T& operator[](size_t pos)
{
assert(pos < size());
return _start[pos];
}
const T& operator[](size_t pos) const
{
assert(pos < size());
return _start[pos];
}
size_t capacity() const
{
return _endofstorage - _start;
}
void reserve(size_t n)
{
if (n > capacity())
{
T* tmp = new T[n];
size_t old_size = size();
//memcpy(tmp, _start, size() * sizeof(T));
for (size_t i = 0; i < old_size; i++)
{
tmp[i] = _start[i];
}
delete[] _start;
_start = tmp;
_finish = tmp + old_size;
_endofstorage = tmp + n;
}
}
void resize(size_t n, const T& val = T())
{
if (n > size())
{
reserve(n);
// 插入
while (_finish < _start + n)
{
*_finish = val;
++_finish;
}
}
else
{
// 删除
_finish = _start + n;
}
}
void push_back(const T& val)
{
insert(end(), val);
}
void pop_back()
{
/*assert(!empty());
--_finish;*/
erase(end() - 1);
}
bool empty()
{
return _start == _finish;
}
void insert(iterator pos, const T& val)
{
assert(pos >= _start);
assert(pos <= _finish);
if (_finish == _endofstorage)
{
size_t len = pos - _start;
reserve(capacity() == 0 ? 4 : capacity() * 2);
// 如果扩容了要更新pos
pos = _start + len;
}
iterator it = _finish - 1;
while (it >= pos)
{
*(it + 1) = *it;
--it;
}
*pos = val;
++_finish;
}
iterator erase(iterator pos)
{
assert(pos >= _start);
assert(pos < _finish);
iterator it = pos + 1;
while (it < _finish)
{
*(it - 1) = *it;
++it;
}
--_finish;
return pos;
}
private:
iterator _start = nullptr;
iterator _finish = nullptr;
iterator _endofstorage = nullptr;
};
//template<typename T>
// 函数模板
template<class T>
void print_vector(const vector<T>& v)
{
for (size_t i = 0; i < v.size(); i++)
{
cout << v[i] << " ";
}
cout << endl;
//typename vector<T>::const_iterator it = v.begin();
/*auto it = v.begin();
while (it != v.end())
{
cout << *it << " ";
++it;
}
cout << endl;
for (auto e : v)
{
cout << e << " ";
}
cout << endl;*/
}
void test_vector1()
{
vector<int> v1;
v1.push_back(1);
v1.push_back(2);
v1.push_back(3);
v1.push_back(4);
v1.push_back(4);
v1.push_back(4);
print_vector(v1);
vector<double> v2;
v2.push_back(1.1);
v2.push_back(2.2);
v2.push_back(3.1);
print_vector(v2);
v2.insert(v2.begin(), 11.11);
print_vector(v2);
v2.insert(v2.begin(), 11.11);
print_vector(v2);
v2.insert(v2.begin(), 11.11);
print_vector(v2);
v2.insert(v2.begin(), 11.11);
print_vector(v2);
v2.insert(v2.begin(), 11.11);
print_vector(v2);
v2.erase(v2.begin());
print_vector(v2);
v2.erase(v2.begin() + 4);
print_vector(v2);
/*for (size_t i = 0; i < v.size(); i++)
{
cout << v[i] << " ";
}
cout << endl;
vector<int>::iterator it = v.begin();
while (it != v.end())
{
cout << *it << " ";
++it;
}
cout << endl;
for (auto e : v)
{
cout << e << " ";
}
cout << endl;*/
}
}