运用reverse
/**
* 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>> ans;
if(root == NULL){
return ans;
}
queue<TreeNode*> q;
q.push(root);
bool isLeft = false;
while(!q.empty()){
int rowLen = q.size();
vector<int> temp;
for(int i = 0; i < rowLen; ++i){
TreeNode* curNode = q.front();
q.pop();
if(curNode != NULL){
temp.push_back(curNode->val);
if(curNode->left)q.push(curNode->left);
if(curNode->right)q.push(curNode->right);
}
}
isLeft = !isLeft;
if(!isLeft){
reverse(temp.begin(), temp.end());
ans.push_back(temp);
}else{
ans.push_back(temp);
}
}
return ans;
}
};
/**
* 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>> res;
if(root==NULL) return res;
queue<TreeNode*> q;
vector<int> layer;
int flag=1; //根节点为正序
q.push(root);
while(!q.empty()){
for(int i=q.size();i>0;i--){
TreeNode* cur=q.front();
layer.push_back(cur->val);
if(cur->left) q.push(cur->left);
if(cur->right) q.push(cur->right);
q.pop();
}
if(flag) flag=0; //如果当前正序,设置下一层倒序
else{
reverse(layer.begin(),layer.end()); //如果当前层要倒序输出,则翻转vector
flag=1; //设置下一层正序
}
res.push_back(layer);
layer.clear();
}
return res;
}
};
作者:ttsscc
链接:https://leetcode-cn.com/problems/cong-shang-dao-xia-da-yin-er-cha-shu-iii-lcof/solution/jian-zhi-32reversehuan-shi-hen-xiang-de-5jr1y/
来源:力扣(LeetCode)
著作权归作者所有。商业转载请联系作者获得授权,非商业转载请注明出处。