leetcode 107 Binary Tree Level Order Traversal II C++
来源:互联网 发布:瑜伽教学软件 编辑:程序博客网 时间:2024/05/24 02:38
层次遍历,本来一个循环就可以,但是要输出一个二位数组,就变成嵌套循环了。
然后把结果逆序一下就可以了。
class Solution {public: vector<vector<int>> levelOrderBottom(TreeNode* root) { vector<vector<int>> res; if(!root) return res; queue<TreeNode*> que; que.push(root); while(que.size()!=0){ vector<int> tmpRes; queue<TreeNode*> tmpQue; while(que.size()!=0){ TreeNode *node = que.front(); que.pop(); if(node->left) tmpQue.push(node->left); if(node->right) tmpQue.push(node->right); tmpRes.push_back(node->val); } res.push_back(tmpRes); que = tmpQue; } reverse(res.begin(),res.end()); return res; }};
0 0
- 【leetcode c++】107 Binary Tree Level Order Traversal II
- 【LeetCode-107】Binary Tree Level Order Traversal II(C++)
- [C++]LeetCode: 32 Binary Tree Level Order Traversal II
- LeetCode: Binary Tree Level Order Traversal II
- [LeetCode]Binary Tree Level Order Traversal II
- LeetCode Binary Tree Level Order Traversal II
- [Leetcode] Binary Tree Level Order Traversal II
- LeetCode Binary Tree Level Order Traversal II
- [LeetCode] Binary Tree Level Order Traversal II
- 【leetcode】Binary Tree Level Order Traversal II
- [LeetCode]Binary Tree Level Order Traversal II
- [Leetcode]Binary Tree Level Order Traversal II
- [leetcode]Binary Tree Level Order Traversal II
- LeetCode-Binary Tree Level Order Traversal II
- LeetCode - Binary Tree Level Order Traversal II
- [LeetCode] Binary Tree Level Order Traversal II
- LeetCode | Binary Tree Level Order Traversal II
- LeetCode - Binary Tree Level Order Traversal II
- 二叉搜索树的性质
- poj 1172 Street Race
- Linux常用命令集锦
- 考研第5天-线性代数-向量组的线性相关性
- hdu2586 How far away ?&& poj1986 Distance Queries(LCA离线求最短距离)
- leetcode 107 Binary Tree Level Order Traversal II C++
- poj 2387 Til the Cows Come Home
- 学习Service
- java的泛型原理
- 文章标题
- 电脑管家杀毒显示组件破坏解决方法
- 一起talk C栗子吧(第一百五十六回:C语言实例--基于AF_UNIX域的流套接字通信)
- 委托和方法
- Trapping Rain Water