【leetcode刷题】T116-二叉树的锯齿形层次遍历

例如：
给定二叉树 [3,9,20,null,null,15,7],

    3
   / \
  9  20
    /  \
   15   7
返回锯齿形层次遍历如下：

[
  [3],
  [20,9],
  [15,7]
]

# Definition for a binary tree node.
# class TreeNode(object):
#     def __init__(self, x):
#         self.val = x
#         self.left = None
#         self.right = None

class Solution(object):
    def zigzagLevelOrder(self, root):
        """
        :type root: TreeNode
        :rtype: List[List[int]]
        """
        if not root:
            return []
        res = []
        num = []
        tmp1 = [root]
        tmp2 = []
        reverse = False
        while len(tmp1) != 0 or len(tmp2) != 0:
            if len(tmp1) == 0:
                tmp1 = copy.copy(tmp2)
                tmp2 = []
                if reverse:
                    reverse = False
                    num = num[::-1]
                else:
                    reverse = True
                res.append(num)
                num = []
            p = tmp1.pop(0)
            num.append(p.val)
            if p.left:
                tmp2.append(p.left)
            if p.right:
                tmp2.append(p.right)
        if reverse:
            num = num[::-1]
        res.append(num)
        return res

/**
 * 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>> res;
        if(!root)
            return res;
        vector<int> num;
        vector<TreeNode*> tmp1;
        vector<TreeNode*> tmp2;
        tmp1.push_back(root);
        TreeNode* p = NULL;
        bool should_reverse = false;
        while(tmp1.size() != 0 || tmp2.size() != 0){
            // tmp1为空，tmp2非空
            if(tmp1.size() == 0){
                for(int i=0; i<tmp2.size(); i++){
                    tmp1.push_back(tmp2[i]);
                }
                tmp2.erase(tmp2.begin(), tmp2.end());
                if(should_reverse){
                    reverse(num.begin(), num.end());
                    should_reverse = false;
                }else{
                    should_reverse = true;
                }
                res.push_back(num);
                num.erase(num.begin(), num.end());
            }
            p = tmp1[0];
            num.push_back(p->val);
            tmp1.erase(tmp1.begin());
            if(p->left)
                tmp2.push_back(p->left);
            if(p->right)
                tmp2.push_back(p->right);
        }
        if(should_reverse){
            reverse(num.begin(), num.end());
        }
        res.push_back(num);
        return res;
    }
};