[Leetcode] 515. Find Largest Value in Each Tree Row 解题报告
来源:互联网 发布:ubuntu下mplayer 编辑:程序博客网 时间:2024/05/22 09:01
题目:
You need to find the largest value in each row of a binary tree.
Example:
Input: 1 / \ 3 2 / \ \ 5 3 9 Output: [1, 3, 9]
思路:
还是那句话:遇到树的问题,首先要想到DFS或者BFS。在遍历树的过程中,纪录当前结点所在的层次,然后检查该层的最大值,如果结点的值超过了该层的最大值,那么就更新。
代码:
/** * 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> ret; largestValues(root, ret, 0); return ret; }private: void largestValues(TreeNode *root, vector<int> &ret, int height) { if (root == NULL) { return; } if (ret.size() > height) { ret[height] = max(ret[height], root->val); } else { ret.push_back(root->val); } largestValues(root->left, ret, height + 1); largestValues(root->right, ret, height + 1); }};
阅读全文
0 0
- 【LeetCode】Find Largest Value in Each Tree Row 解题报告
- [Leetcode] 515. Find Largest Value in Each Tree Row 解题报告
- LeetCode 515. Find Largest Value in Each Tree Row
- LeetCode OJ 515. Find Largest Value in Each Tree Row
- LeetCode笔记:515. Find Largest Value in Each Tree Row
- [leetcode] 515. Find Largest Value in Each Tree Row
- 【LeetCode】515. Find Largest Value in Each Tree Row
- LeetCode;515. Find Largest Value in Each Tree Row
- leetcode 515. Find Largest Value in Each Tree Row
- leetcode 515. Find Largest Value in Each Tree Row
- leetcode-515. Find Largest Value in Each Tree Row
- leetcode 515. Find Largest Value in Each Tree Row
- leetcode 515. Find Largest Value in Each Tree Row
- leetcode 515. Find Largest Value in Each Tree Row
- LeetCode 515. Find Largest Value in Each Tree Row (C++)
- leetcode 515. Find Largest Value in Each Tree Row
- LeetCode#515. Find Largest Value in Each Tree Row
- leetcode 515. Find Largest Value in Each Tree Row
- 最小生成树 Prim算法
- Lucene使用(一)简单索引的创建和检索
- web前端第三天
- ajax提交响应后台加号(+)变成空格
- 金蝶K3与百望九赋税控开票软件对接实现半自动开票
- [Leetcode] 515. Find Largest Value in Each Tree Row 解题报告
- opengl程序学习
- leetcode 413. Arithmetic Slices 一个很简单的DP动态规划做法
- 我的无知病与医治
- [知了堂学习笔记]_JS中的控制语句
- 微信公众号开发(五)创建自定义菜单
- linux下PHP7环境搭建
- 批处理 管道符号
- vue自定义公共组件components