std::list<T,Allocator>::reverse
void reverse(); |
(C++11 前) | |
void reverse() noexcept; |
(C++11 起) | |
逆转容器中的元素顺序。不非法化任何引用或迭代器。
参数
(无)
返回值
(无)
复杂度
与容器大小成线性
示例
运行此代码
#include <iostream> #include <list> std::ostream& operator<<(std::ostream& ostr, const std::list<int>& list) { for (auto &i : list) { ostr << " " << i; } return ostr; } int main() { std::list<int> list = { 8,7,5,9,0,1,3,2,6,4 }; std::cout << "before: " << list << "\n"; list.sort(); std::cout << "ascending: " << list << "\n"; list.reverse(); std::cout << "descending: " << list << "\n"; }
输出:
before: 8 7 5 9 0 1 3 2 6 4 ascending: 0 1 2 3 4 5 6 7 8 9 descending: 9 8 7 6 5 4 3 2 1 0
参阅
对元素进行排序 (公开成员函数) |