前言
题目: 513. 找树左下角的值
文档: 代码随想录——找树左下角的值
编程语言: C++
解题状态: 被条件判断的 i = = 1 i == 1 i==1给卡住了…
思路
简单的层序遍历,返回最后一层的第一个元素就好。
代码
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode() : val(0), left(nullptr), right(nullptr) {}
* TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
* TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
* };
*/
class Solution {
public:
int findBottomLeftValue(TreeNode* root) {
queue<TreeNode*> q;
vector<int> vec;
q.push(root);
while (!q.empty()) {
int size = q.size();
for (int i = 0; i < size; i++) {
TreeNode* node = q.front();
q.pop();
if (i == 0) {
vec.push_back(node -> val);
}
if (node -> left) q.push(node -> left);
if (node -> right) q.push(node-> right);
}
}
return vec[vec.size() - 1];
}
};