题目概述
解题思路
思路就是:
首先,逐行遍历该数;
然后,对奇数层的数进行逆序。
方法性能
时间复杂度为O(N),若树有N个节点。
示例代码
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode() : val(0), left(nullptr), right(nullptr) {}
* TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
* TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
* };
*/
class Solution {
public:
vector<vector<int>> zigzagLevelOrder(TreeNode* root)
{
if(root == NULL)
return vector<vector<int>>{};
int cur_len = 1, nex_len = 0, layer_num = 0;
queue<TreeNode*> layer;
vector<vector<int>> res;
layer.push(root);
while(!layer.empty())
{
vector<int> lay_N;
while(cur_len--)
{
TreeNode* temp = layer.front();
layer.pop();
lay_N.push_back(temp->val);
if(temp->left)
layer.push(temp->left), nex_len++;
if(temp->right)
layer.push(temp->right), nex_len++;
}
if(layer_num % 2)
{
int mid_val, len_N = lay_N.size();
for(int si = 0; si < lay_N.size() / 2; ++si)
{
mid_val = lay_N[si];
lay_N[si] = lay_N[len_N - 1 - si];
lay_N[len_N - 1 - si] = mid_val;
}
}
layer_num++;
cur_len = nex_len;
nex_len = 0;
res.push_back(lay_N);
}
return res;
}
};