(M)DFS:515. Find Largest Value in Each Tree Row
来源:互联网 发布:iphone手机壳品牌知乎 编辑:程序博客网 时间:2024/06/05 10:53
这道题的意思是,存下一棵二叉树每一行最大的数。
我的做法是,遍历这棵树,用一个变量depth记录当前的深度,看当前遍历到的这个结点是不是比当前深度下的最大值大,大的话就替换掉当前深度下的最大值。
/** * 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<int> largestValues(TreeNode* root) { vector<int> res; dfs(root, res, 1); return res; } void dfs(TreeNode* root, vector<int>& res, int depth) { if(root == NULL) return; if(res.size() < depth) { res.push_back(root->val); } else { res[depth - 1] = max(res[depth - 1], root->val); } dfs(root->left, res, depth + 1); dfs(root->right, res, depth + 1); }};
阅读全文
0 0
- (M)DFS:515. Find Largest Value in Each Tree Row
- Find Largest Value in Each Tree Row
- Find Largest Value in Each Tree Row
- Find Largest Value in Each Tree Row
- Find Largest Value in Each Tree Row
- Find Largest Value in Each Tree Row
- Find Largest Value in Each Tree Row
- Find Largest Value in Each Tree Row
- Find Largest Value in Each Tree Row
- Find Largest Value in Each Tree Row
- LeetCode oj 515. Find Largest Value in Each Tree Row(DFS||BFS)
- LeetCode 515. Find Largest Value in Each Tree Row
- 515. Find Largest Value in Each Tree Row
- LeetCode OJ 515. Find Largest Value in Each Tree Row
- 515. Find Largest Value in Each Tree Row
- 515. Find Largest Value in Each Tree Row
- week3-NO.515. Find Largest Value in Each Tree Row
- LeetCode笔记:515. Find Largest Value in Each Tree Row
- 基本数据类型的隐式转换
- JAVA SE — Day 05
- operator.itermgetter() (Python)
- 我的文学博客(为爱而生,生生不息)
- 小练习:数组元素的交换
- (M)DFS:515. Find Largest Value in Each Tree Row
- Java实现验证码
- JS继承这点儿事
- Python 中的属性访问与描述符
- ssm框架不用Javabean 数据全部以map的形式存储这样好吗
- 记录我的Java学习经历(3)
- 多线程 c/s程序
- nginx的日志切割
- 从零开始系列之spark与mongodb连接的安装记录_java方向(1)