标签：vector 最大 turn empty etc put back eve 最大值
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]
思路：
层次遍历，每一层选出当前层最大值。
vector<int> largestValues(TreeNode* root) { vector<int>result; if (root == NULL)return result; queue<TreeNode*>que; que.push(root); int tempmax = INT_MIN; while (!que.empty()) { int levelsize = que.size(); TreeNode* temp; for (int i = 0; i < levelsize;i++) { temp = que.front(); que.pop(); if (temp->left != NULL)que.push(temp->left); if (temp->right != NULL)que.push(temp->right); tempmax = max(tempmax, temp->val); } result.push_back(tempmax); tempmax = INT_MIN; } return result; }
[leetcode-515-Find Largest Value in Each Tree Row]
标签：vector 最大 turn empty etc put back eve 最大值
原文地址：http://www.cnblogs.com/hellowooorld/p/6900855.html
