513.找树左下角的值
迭代法——层序遍历
存储每一层数值,最后弹出最后一层第一个数值即为所求
class Solution {
public:
int findBottomLeftValue(TreeNode* root) {
queue<TreeNode*> que;
vector<vector<int>> vec;
if (root != nullptr) que.push(root);
while (!que.empty()) {
int size = que.size();
vector<int> result;
while (size--) {
TreeNode* node = que.front();
que.pop();
result.push_back(node->val);
if (node->left) que.push(node->left);
if (node->right) que.push(node->right);
}
vec.push_back(result);
}
return vec.back().front();
}
};
递归法
class Solution {
public:
int maxDepth = INT_MIN; // 全局变量,记录最大深度
int result; // 全局变量,记录最大深度最左侧叶子数值
void traversal(TreeNode* node, int depth) {
if (node->left == nullptr && node->right == nullptr) {
if (depth > maxDepth) {
maxDepth = depth;
result = node->val;
}
return;
}
// 递归中有回溯,遍历左子树完需depth--,回到父节点深度,再去遍历右子树
// 在函数中用depth+1的方法包含了回溯,传入函数中的depth+1值,递归完成后
// depth数值并未改变
if (node->left) traversal(node->left, depth + 1);
if (node->right) traversal(node->right, depth + 1);
return;
}
int findBottomLeftValue(TreeNode* root) {
traversal(root, 0);
return result;
}
};
112. 路径总和
递归法
class Solution {
public:
bool traversal(TreeNode* cur, int count) {
if (!cur->left && !cur->right && count == 0) return true;
if (!cur->left && !cur->right) return false;
if (cur->left) {
if (traversal(cur->left, count - cur->left->val)) return true;
}
if (cur->right) {
if (traversal(cur->right, count - cur->right->val)) return true;
}
return false;
}
bool hasPathSum(TreeNode* root, int targetSum) {
if (root == nullptr) return false;
return traversal(root, targetSum - root->val);
}
};
113.路径之和Ⅱ
class Solution {
public:
vector<vector<int>> result; // 全局变量,记录全部路径
vector<int> path; // 全局变量,记录单条路径
void traversal(TreeNode* node, int count) {
if (!node->left && !node->right && count == 0) {
result.push_back(path);
return;
}
// 遇到叶子节点且没有找到合适的边,直接返回
if (!node->left && !node->right) return;
if (node->left) {
path.push_back(node->left->val);
traversal(node->left, count - node->left->val);
path.pop_back();
}
if (node->right) {
path.push_back(node->right->val);
traversal(node->right, count - node->right->val);
path.pop_back();
}
return;
}
vector<vector<int>> pathSum(TreeNode* root, int targetSum) {
if (root == nullptr) return result;
path.push_back(root->val);
traversal(root, targetSum - root->val);
return result;
}
};
106.从中序与后序遍历序列构造二叉树
class Solution {
private:
TreeNode* traversal (vector<int>& inorder, vector<int>& postorder) {
if (postorder.size() == 0) return NULL;
// 后序遍历数组最后一个元素,就是当前的中间节点
int rootValue = postorder[postorder.size() - 1];
TreeNode* root = new TreeNode(rootValue);
// 叶子节点
if (postorder.size() == 1) return root;
// 找到中序遍历的切割点
int delimiterIndex;
for (delimiterIndex = 0; delimiterIndex < inorder.size(); delimiterIndex++) {
if (inorder[delimiterIndex] == rootValue) break;
}
// 切割中序数组
// 左闭右开区间:[0, delimiterIndex)
vector<int> leftInorder(inorder.begin(), inorder.begin() + delimiterIndex);
// [delimiterIndex + 1, end)
vector<int> rightInorder(inorder.begin() + delimiterIndex + 1, inorder.end() );
// postorder 舍弃末尾元素
postorder.resize(postorder.size() - 1);
// 切割后序数组
// 依然左闭右开,注意这里使用了左中序数组大小作为切割点
// [0, leftInorder.size)
vector<int> leftPostorder(postorder.begin(), postorder.begin() + leftInorder.size());
// [leftInorder.size(), end)
vector<int> rightPostorder(postorder.begin() + leftInorder.size(), postorder.end());
root->left = traversal(leftInorder, leftPostorder);
root->right = traversal(rightInorder, rightPostorder);
return root;
}
public:
TreeNode* buildTree(vector<int>& inorder, vector<int>& postorder) {
if (inorder.size() == 0 || postorder.size() == 0) return NULL;
return traversal(inorder, postorder);
}
};
105.从前序与中序遍历序列构造二叉树
class Solution {
private:
TreeNode* traversal(vector<int>& preorder, int preorderBegin, int preorderEnd, vector<int>& inorder, int inorderBegin, int inorderEnd) {
// 第一步:数组长度为零,则说明是空节点
if (preorderBegin == preorderEnd) return nullptr;
// 第二步:如果数组不为空,前序数组的第一个元素作为当前节点
int rootValue = preorder[preorderBegin];
TreeNode* root = new TreeNode(rootValue);
// 叶子节点
if (preorderEnd - preorderBegin == 1) return root;
// 第三步:查找中序数组中的切割点
int delimiterIndex;
for (delimiterIndex = 0; delimiterIndex < inorder.size(); delimiterIndex++) {
if (inorder[delimiterIndex] == rootValue) break;
}
// 第四步:切割中序数组,得到中序左数组和中序右数组
// 左中序数组,[inorderBegin, delimiterIndex)
int leftInorderBegin = inorderBegin;
int leftInorderEnd = delimiterIndex;
// 右中序数组,[delimiterIndex + 1, inorderEnd)
int rightInorderBegin = delimiterIndex + 1;
int rightInorderEnd = inorderEnd;
// 第五步:切割前序数组,得到前序左数组和前序右数组
// 左前序数组,[preorderBegin + 1]
int leftPreorderBegin = preorderBegin + 1;
int leftPreorderEnd = preorderBegin + 1 + delimiterIndex - inorderBegin;
// 右前序数组,[rightPreorderBegin, rightPreorderEnd)
int rightPreorderBegin = preorderBegin + 1 + delimiterIndex - inorderBegin;
int rightPreorderEnd = preorderEnd;
// 第六步,递归
root->left = traversal(preorder, leftPreorderBegin, leftPreorderEnd, inorder, leftInorderBegin, leftInorderEnd);
root->right = traversal(preorder, rightPreorderBegin, rightPreorderEnd, inorder, rightInorderBegin, rightInorderEnd);
return root;
}
public:
TreeNode* buildTree(vector<int>& preorder, vector<int>& inorder) {
if (inorder.size() == 0 || preorder.size() == 0) return nullptr;
return traversal(preorder, 0, preorder.size(), inorder, 0, inorder.size());
}
};