Update Solution.cpp

Author: yanglbme

solution/0100-0199/0103.Binary Tree Zigzag Level Order Traversal/Solution.cpp

@@ -1,3 +1,12 @@
+/**
+ * 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) {
@@ -9,7 +18,8 @@ class Solution {
             int size = q.size();
             vector<int> oneLevel(size);
             for (int i = 0; i < size; ++i) {
-                TreeNode* t = q.front(); q.pop();
+                TreeNode* t = q.front();
+                q.pop();
                 int idx = leftToRight ? i : (size - 1 - i);
                 oneLevel[idx] = t->val;
                 if (t->left) q.push(t->left);
@@ -20,4 +30,4 @@ class Solution {
         }
         return res;
     }
-};
+};