传送门:https://leetcode-cn.com/problems/cong-wei-dao-tou-da-yin-lian-biao-lcof/submissions/
只要当前链表不为空,不断压入进栈,最后反向输出
- 了解begin() 与end() rbegin() 与 rend()区别
- push_back()操作
#include<iostream>
#include<vector> //头文件别忘记加
using namespace std;
int main()
{
vector<int> res;
for (int i = 0; i < 10; i++)
{
res.push_back(i);
}
// 在vector res的末尾添加1个元素i 此时res 中存储的是0123456789
for (auto it = res.begin(); it != res.end(); it++)
{
cout << *it << " ";
}
// 使用迭代器的方式访问vector 输出 0 1 2 3 4 5 6 7 8 9
cout << endl;
for (auto it = res.rbegin(); it != res.rend(); it++)
{
cout <&