Find Largest Value in Each Tree Row
2017-03-19 19:57
281 查看
本次的主題是希望圖形、樹以及鏈表深度搜索(DFS)的結合可以簡單搜索樹中每一行最大的數,並把它存儲在新創建的vector內,首先我們先給出樹的簡單結構:
//Definition for a binary tree node.
struct TreeNode
{
int val;
TreeNode *left;
TreeNode *right;
TreeNode(int x) : val(x), left(NULL), right(NULL) {}
};
在結構內設置指向左子樹與右子樹的指針變量TreeNode *left與TreeNode *right並在構造函數中初始化為NULL。
我想要達成的效果大概如下:
但實際上輸入1 3 2 5 3 9,題目希望構建一個尋找樹的每一層最大數,透過遞歸的性質比較相同層節點的左右子樹,先對左子樹進行遞歸運算,並比較遍歷過的每個節點,如遇到NULL則返回上一層並調用上一層對右子樹遞歸的函數。將每次調用後的最大數存入vector<int> result內。
void solution(TreeNode* root, vector<int> &result)
{
result.clear();
int n = 0;
if(root == NULL)
return;
if(result.size() < n + 1)
{
result.push_back(root->val);
}
else if(result
< root->val)
{
result
= root->val;
}
solution(root->left, result);
solution(root->right, result);
}
//Definition for a binary tree node.
struct TreeNode
{
int val;
TreeNode *left;
TreeNode *right;
TreeNode(int x) : val(x), left(NULL), right(NULL) {}
};
在結構內設置指向左子樹與右子樹的指針變量TreeNode *left與TreeNode *right並在構造函數中初始化為NULL。
我想要達成的效果大概如下:
Input: 1 / \ 3 2 / \ \ 5 3 9 Output: [1, 3, 9]
但實際上輸入1 3 2 5 3 9,題目希望構建一個尋找樹的每一層最大數,透過遞歸的性質比較相同層節點的左右子樹,先對左子樹進行遞歸運算,並比較遍歷過的每個節點,如遇到NULL則返回上一層並調用上一層對右子樹遞歸的函數。將每次調用後的最大數存入vector<int> result內。
void solution(TreeNode* root, vector<int> &result)
{
result.clear();
int n = 0;
if(root == NULL)
return;
if(result.size() < n + 1)
{
result.push_back(root->val);
}
else if(result
< root->val)
{
result
= root->val;
}
solution(root->left, result);
solution(root->right, result);
}
相关文章推荐
- Find Largest Value in Each Tree Row
- Find Largest Value in Each Tree Row(找出一棵树每一行的最大值)
- LeetCode Find Largest Value in Each Tree Row
- 515[Medium]:Find Largest Value in Each Tree Row
- [LeetCode] Find Largest Value in Each Tree Row 找树每行最大的结点值
- leetcode515 Find Largest Value In Each Tree Row Java
- LeetCode--Find Largest Value in Each Tree Row
- LeetCode之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
- 第十二周算法分析与设计: Find Largest Value in Each Tree Row
- Find Largest Value in Each Tree Row
- Find Largest Value in Each Tree Row问题及解法
- Week Training: 515 Find Largest Value in Each Tree Row
- Find Largest Value in Each Tree Row
- LeetCode: Find Largest Value in Each Tree Row
- LeetCode 515 Find Largest Value in Each Tree Row(二叉树层序遍历)
- LeetCode之Find Largest Value in Each Tree Row(Kotlin)
- LeetCode#515 Find Largest Value in Each Tree Row (week15)
- leetcode515: Find Largest Value in Each Tree Row