当前位置:网站首页>LeetCode 515(C#)
LeetCode 515(C#)
2022-07-07 15:38:00 【有趣就行】
题目
给定一棵二叉树的根节点 root ,请找出该二叉树中每一层的最大值。
示例1:
输入: root = [1,3,2,5,3,null,9]
输出: [1,3,9]
示例2:
输入: root = [1,2,3]
输出: [1,3]
代码
- DFS
public class Solution
{
public IList<int> LargestValues(TreeNode root)
{
List<int> list = new List<int>();
Dfs(list, root, 0);
return list;
}
private void Dfs(IList<int> list, TreeNode node, int depth)
{
if (node == null) return;
if (depth >= list.Count) list.Add(node.val);
else list[depth] = Math.Max(list[depth], node.val);
Dfs(list, node.left, depth + 1);
Dfs(list, node.right, depth + 1);
}
}
- BFS
public class Solution
{
public IList<int> LargestValues(TreeNode root)
{
List<int> list = new List<int>();
Queue<TreeNode> queue = new Queue<TreeNode>();
if (root != null) queue.Enqueue(root);
while (queue.Count > 0)
{
(int sz, int ans) = (queue.Count, int.MinValue);
for (int i = 0; i < sz; i++)
{
var t = queue.Dequeue();
ans = Math.Max(ans, t.val);
if (t.left != null) queue.Enqueue(t.left);
if (t.right != null) queue.Enqueue(t.right);
}
list.Add(ans);
}
return list;
}
}
边栏推荐
- 浅谈 Apache Doris FE 处理查询 SQL 源码解析
- How to mount the original data disk without damage after the reinstallation of proxmox ve?
- Shallow understanding Net core routing
- 【Seaborn】组合图表、多子图的实现
- 【饭谈】那些看似为公司着想,实际却很自私的故事 (一:造轮子)
- LeetCode 300. 最长递增子序列 每日一题
- 防火墙系统崩溃、文件丢失的修复方法,材料成本0元
- LeetCode 1986. The minimum working time to complete the task is one question per day
- How to add aplayer music player in blog
- LeetCode 1043. Separate the array to get the maximum and daily questions
猜你喜欢
Is AI more fair than people in the distribution of wealth? Research on multiplayer game from deepmind
PLC:自动纠正数据集噪声,来洗洗数据集吧 | ICLR 2021 Spotlight
DevOps 的运营和商业利益指南
With the latest Alibaba P7 technology system, mom doesn't have to worry about me looking for a job anymore
Skimage learning (2) -- RGB to grayscale, RGB to HSV, histogram matching
麒麟信安加入宁夏商用密码协会
The top of slashdata developer tool is up to you!!!
Matplotlib绘图界面设置
Direct dry goods, 100% praise
Shallow understanding Net core routing
随机推荐
Number of exchanges in the 9th Blue Bridge Cup finals
Lowcode: four ways to help transportation companies enhance supply chain management
Biped robot controlled by Arduino
QT picture background color pixel processing method
LeetCode 120. 三角形最小路径和 每日一题
[Seaborn] implementation of combined charts and multi subgraphs
Solidity 开发环境搭建
Sator推出Web3游戏“Satorspace” ,并上线Huobi
LeetCode 1155. N ways to roll dice one question per day
LeetCode 1049. Weight of the last stone II daily question
mysql官网下载:Linux的mysql8.x版本(图文详解)
Read PG in data warehouse in one article_ stat
Smart logistics platform: make overseas warehouses smarter
SIGGRAPH 2022最佳技术论文奖重磅出炉!北大陈宝权团队获荣誉提名
NeRF:DeepFake的最终替代者?
浅浅理解.net core的路由
QT video transmission
[image sensor] correlated double sampling CDs
LeetCode 1654. 到家的最少跳跃次数 每日一题
skimage学习(3)——Gamma 和 log对比度调整、直方图均衡、为灰度图像着色