103题
一、问题描述
二、问题分析
相比较102题,不难发现,zigzag遍历只需要在奇数层(根记为第0层)将得到向量转置即可。转置方法为algorithm里面的reverse。
三、问题求解
针对问题分析,以下是c++源代码:
/**
* 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>> zigzagLevelOrder(TreeNode* root) {
vector<vector<int>> result;
if (!root) return result;
queue<TreeNode* > Q;
Q.push(root);
for (int i = 0; !Q.empty(); i++) {
vector<int> level;
int size = Q.size();
for (int j = 0; j < size; j++) {
TreeNode* node = Q.front();
Q.pop();
level.push_back(node->val);
if (node->left) Q.push(node->left);
if (node->right) Q.push(node->right);
}
if (i % 2 == 1) reverse(level.begin(), level.end());
result.push_back(level);
}
return result;
}
};