Binary Tree Zigzag Level Order Traversa 二叉树Z形程序遍历
来源:互联网 发布:2013软件设计师 编辑:程序博客网 时间:2024/06/08 12:18
/**
* Definition for binary tree
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
public:
vector<vector<int> > zigzagLevelOrder(TreeNode *root) {
vector<vector<int>> ret;
ret.clear();
if(root==NULL) return ret;
vector<int> tmp;
queue<TreeNode*> q;
int flag=0;
q.push(root);
q.push(NULL);
while(!q.empty())
{
TreeNode *p=q.front();
q.pop();
if(p!=NULL)
{
tmp.push_back(p->val);
if(p->left)
q.push(p->left);
if(p->right)
q.push(p->right);
}
else
{ if(!tmp.empty())
{
q.push(NULL);//一定注意啊
if(flag==1)
reverse(tmp.begin(),tmp.end());//一定注意啊
ret.push_back(tmp);
flag=1-flag;
tmp.clear();
}
}
}
return ret;
}
};
* Definition for binary tree
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
public:
vector<vector<int> > zigzagLevelOrder(TreeNode *root) {
vector<vector<int>> ret;
ret.clear();
if(root==NULL) return ret;
vector<int> tmp;
queue<TreeNode*> q;
int flag=0;
q.push(root);
q.push(NULL);
while(!q.empty())
{
TreeNode *p=q.front();
q.pop();
if(p!=NULL)
{
tmp.push_back(p->val);
if(p->left)
q.push(p->left);
if(p->right)
q.push(p->right);
}
else
{ if(!tmp.empty())
{
q.push(NULL);//一定注意啊
if(flag==1)
reverse(tmp.begin(),tmp.end());//一定注意啊
ret.push_back(tmp);
flag=1-flag;
tmp.clear();
}
}
}
return ret;
}
};
0 0
- Binary Tree Zigzag Level Order Traversa 二叉树Z形程序遍历
- Leetcode 103 ,Binary Tree Zigzag Level Order Traversal(二叉树Z形分层遍历)
- leetcode-Binary Tree Zigzag Level Order Traversa
- 【LeetCode笔记】Binary Tree Zigzag Level Order Traversal 二叉树Z字形遍历
- (二叉树z字形层次遍历)LeetCode#103. Binary Tree Zigzag Level Order Traversal
- Binary Tree Zigzag Level Order Traversal 之字形遍历二叉树
- 【LeetCode-面试算法经典-Java实现】【103-Binary Tree Zigzag Level Order Traversal(二叉树分层Z字形遍历)】
- Leetcode 103. Binary Tree Zigzag Level Order Traversal 二叉树Zigzag遍历 解题报告
- Binary Tree Zigzag Level Order Traversal 二叉树ZigZag打印
- LeetCode—Binary Tree Zigzag Level Order Traversal 二叉树的Z扫描
- 【LeetCode】Binary Tree Zigzag Level Order Traversal--- 层序遍历二叉树
- Binary Tree Zigzag Level Order Traversal (二叉树锯齿形层次遍历)
- LeetCode(Binary Tree Level Order Traversal, 2,Zigzag)二叉树的层次遍历
- Binary Tree Zigzag Level Order Traversal 二叉树锯齿形层次遍历
- LeetCode OJ 之 Binary Tree Zigzag Level Order Traversal (二叉树的曲线层次遍历)
- LeetCode 103. Binary Tree Zigzag Level Order Traversal(二叉树之字形遍历)
- Binary Tree Zigzag Level Order Traversal 二叉树的层次遍历
- 103.leetcode Binary Tree Zigzag Level Order Traversal(medium)[二叉树层次遍历 栈]
- maven nexus 说明
- c++ office 对应的 版本号
- Android 学习笔记6:布局管理器
- AjaxPro使用方法
- phpcms phpsso通讯失败 提示无法链接到mysql服务器
- Binary Tree Zigzag Level Order Traversa 二叉树Z形程序遍历
- Android 改变窗口标题栏的布局
- C#遍历26个字母
- VS2012 Update 2: 0x80040154 corrupt install when starting the debugger
- windbg dump分析入门之符号相关
- iOS7新特性
- CCProxy代理服务器如何与游戏外挂结合
- Java Object Cache in EBS
- poco库编译问题,impl openssl/****