leetcode-102-Binary Tree Level Order Traversal
来源:互联网 发布:电脑绘画软件 编辑:程序博客网 时间:2024/06/07 17:06
#include <iostream>#include <vector>using namespace std;//Definition for a binary tree node.struct TreeNode { int val; TreeNode *left; TreeNode *right; TreeNode(int x) : val(x), left(NULL), right(NULL) {}};class Solution {public: vector<vector<int>> levelOrder(TreeNode* root) { vector<vector<int>> myVec; vector<TreeNode *> levVec; if (!root) { return myVec; } levVec.push_back(root); myVec.push_back(vector<int>(1, root->val)); while (true) { vector<TreeNode *> nextVec; vector<int> numVec; for (int i = 0; i < levVec.size(); i++) { if (levVec[i]->left) { nextVec.push_back(levVec[i]->left); numVec.push_back(levVec[i]->left->val); } if (levVec[i]->right) { nextVec.push_back(levVec[i]->right); numVec.push_back(levVec[i]->right->val); } } if (nextVec.size() == 0) { break; } levVec = nextVec; myVec.insert(myVec.begin(), numVec); } return myVec; }};int main(int argc, const char * argv[]) { TreeNode three = TreeNode(3); TreeNode nine = TreeNode(9); TreeNode twenty = TreeNode(20); TreeNode fifteen = TreeNode(15); TreeNode seven = TreeNode(7); three.left = &nine; three.right = &twenty; twenty.left = &fifteen; twenty.right = &seven; Solution s; vector<vector<int>> res = s.levelOrder(&three); for (int i = 0; i < res.size(); i++) { for (int j = 0; j < res[i].size(); j++) { cout << res[i][j] << " "; } cout << endl; } return 0;}
0 0
- Leetcode 102 Binary Tree Level Order Traversal
- LeetCode(102)Binary Tree Level Order Traversal
- LeetCode 102 Binary Tree Level Order Traversal
- LeetCode: Binary Tree Level Order Traversal [102]
- [leetcode 102]Binary Tree Level Order Traversal
- [LeetCode 102]Binary Tree Level Order Traversal
- leetCode #102 Binary Tree Level Order Traversal
- leetcode-102 Binary Tree Level Order Traversal
- leetcode || 102、Binary Tree Level Order Traversal
- leetcode #102Binary Tree Level Order Traversal
- Leetcode[102]-Binary Tree Level Order Traversal
- LeetCode 102 Binary Tree Level Order Traversal
- LeetCode---(102)Binary Tree Level Order Traversal
- leetcode 102 Binary Tree Level Order Traversal
- leetcode[102]:Binary Tree Level Order Traversal
- Leetcode # 102 Binary Tree Level Order Traversal
- leetcode 102: Binary Tree Level Order Traversal
- leetcode-102-Binary Tree Level Order Traversal
- mkString优化以及超过22字段在scala2.10中的一个小需求
- UVA 524(p194)----Prime Ring Problem
- React Native学习笔记-4:CSS优先级速记
- Linux添加头文件路径
- 用通俗易懂的大白话讲解Map/Reduce原理
- leetcode-102-Binary Tree Level Order Traversal
- iOS 设计模式 - 命令模式
- 文献笔记:《Can we still avoid automatic face detection?》读后感~
- 这一年,我们一起追过的梦想
- 【drp 1】使用易宝实现在线支付
- linux 后台开发类常见问题及知识点
- UVA 536(p177)----Tree Recovery
- 1053. Path of Equal Weight (30)
- leetcode-103-Binary Tree Zigzag Level Order Traversal