题目链接：点击打开链接
题目大意：略
解题思路：略
相关企业
- 字节跳动
AC 代码
- Java
/*** Definition for a binary tree node.* public class TreeNode {* int val;* TreeNode left;* TreeNode right;* TreeNode(int x) { val = x; }* }*/classSolution { publicint[] levelOrder(TreeNoderoot) { if(root==null) returnnewint[0]; Queue<TreeNode>queue=newLinkedList<>(){{ add(root); }}; ArrayList<Integer>ans=newArrayList<>(); while(!queue.isEmpty()) { TreeNodenode=queue.poll(); ans.add(node.val); if(node.left!=null) queue.add(node.left); if(node.right!=null) queue.add(node.right); } int[] res=newint[ans.size()]; for(inti=0; i<ans.size(); i++) res[i] =ans.get(i); returnres; } }
- C++
/*** Definition for a binary tree node.* struct TreeNode {* int val;* TreeNode *left;* TreeNode *right;* TreeNode(int x) : val(x), left(NULL), right(NULL) {}* };*/classSolution { public: vector<int>levelOrder(TreeNode*root) { vector<int>res; if(!root) returnres; queue<TreeNode*>que; que.push(root); while(!que.empty()){ TreeNode*node=que.front(); que.pop(); res.push_back(node->val); if(node->left) que.push(node->left); if(node->right) que.push(node->right); } returnres; } };
