LeetCode 103. Binary Tree Zigzag Level Order Traversal

最新推荐文章于 2024-01-19 11:15:23 发布

stephen_wong

最新推荐文章于 2024-01-19 11:15:23 发布

阅读量892

点赞数

CC 4.0 BY-SA版权

分类专栏： LeetCode LeetCode Problems 文章标签： LeetCode traversal C++

本文链接：https://blog.youkuaiyun.com/stephen_wong/article/details/38394921

LeetCode 同时被 2 个专栏收录

186 篇文章

订阅专栏

LeetCode Problems

183 篇文章

订阅专栏

本文提供了一种解决LeetCode第102题“二叉树的锯齿形层序遍历”的方法。通过使用双端队列和布尔标志来实现节点值的交替反转，从而达到题目要求的锯齿形输出效果。

LeetCode 102. Binary Tree Level Order Traversal

需要加上bool need_reverse判断当前行(level)的数字是否需要reverse。

代码：

class Solution 
{
public:
    vector<vector<int> > zigzagLevelOrder(TreeNode *root) 
    {
    	vector<vector<int>> ret;
        vector<TreeNode*> same_level_node[2];
		same_level_node[0].push_back(root);
		bool need_reverse = false;

        while (same_level_node[0].empty() == false)
        {
        	vector<int> num;
        	same_level_node[1].clear();
        	
        	for (size_t i = 0; i < same_level_node[0].size(); ++ i)
        	{
        		if (same_level_node[0][i] != NULL)
        		{
        			num.push_back( same_level_node[0][i]->val );
        			same_level_node[1].push_back( same_level_node[0][i]->left );
        			same_level_node[1].push_back( same_level_node[0][i]->right );        			
        		}
        	}
        	if (need_reverse == true)
        	{
        		reverse(num.begin(), num.end());
        	}
        	need_reverse = !need_reverse;
            if (num.size() != 0)
            {
            	ret.push_back(num);
            }
        	same_level_node[0] = same_level_node[1];
        }

        return ret;
    }
};