vlambda博客
学习文章列表

/** * struct TreeNode { * int val; * struct TreeNode *left; * struct TreeNode *right; * }; */
class Solution {public: /** *  * @param root TreeNode类  * @return int整型vector<vector<>> */ vector<vector<int> > levelOrder(TreeNode* root) { // write code here if(root == NULL) return {}; vector<vector<int> > re; queue<TreeNode*> q; q.push(root); while(!q.empty()){ int n = q.size(); vector<int> temp; for(int i=0;i<n;++i){ temp.push_back(q.front()->val); if(q.front()->left) q.push(q.front()->left); if(q.front()->right) q.push(q.front()->right); q.pop(); } re.push_back(temp); } return re; }};