513.找树左下角的值
遞迴
class Solution {
public:
int maxDepth = INT32_MIN;
int result;
void traverse(TreeNode* node, int depth){
if(!node->left && !node->right){
if(depth > maxDepth){
maxDepth = depth;
result = node->val;
}
}
if(node->left){
depth++;
traverse(node->left, depth);
depth--;
}
if(node->right){
depth++;
traverse(node->right, depth);
depth--;
}
}
int findBottomLeftValue(TreeNode* root) {
if(!root) return result;
traverse(root, 0);
return result;
}
};
迭戴
class Solution {
public:
int findBottomLeftValue(TreeNode* root) {
queue<TreeNode*> que;
if (root != NULL) que.push(root);
int result = 0;
while (!que.empty()) {
int size = que.size();
for (int i = 0; i < size; i++) {
TreeNode* node = que.front();
que.pop();
if (i == 0) result = node->val;
if (node->left) que.push(node->left);
if (node->right) que.push(node->right);
}
}
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) {
count -= cur->left->val;
if (traversal(cur->left, count)) return true;
count += cur->left->val;
}
if (cur->right) {
count -= cur->right->val;
if (traversal(cur->right, count)) return true;
count += cur->right->val;
}
return false;
}
bool hasPathSum(TreeNode* root, int targetSum) {
if (root == NULL) return false;
return traversal(root, targetSum - root->val);
}
};
106.从中序与后序遍历序列构造二叉树
class Solution {
private:
TreeNode* traverse(vector<int>& inorder, vector<int>& postorder){
if(inorder.size() == 0) return nullptr;
int val = postorder[postorder.size() - 1];
TreeNode* cur = new TreeNode(val);
if(postorder.size() == 1) return cur;
int index = 0;
for(; index < inorder.size(); index++){
if(inorder[index] == val) break;
}
vector<int> leftInorder(inorder.begin(), inorder.begin() + index);
vector<int> rightInorder(inorder.begin() + index + 1, inorder.end());
postorder.resize(postorder.size() - 1);
vector<int> leftPostorder(postorder.begin(), postorder.begin() + leftInorder.size());
vector<int> rightPostorder(postorder.begin() + leftInorder.size(), postorder.end());
cur->left = traverse(leftInorder, leftPostorder);
cur->right = traverse(rightInorder, rightPostorder);
return cur;
}
public:
TreeNode* buildTree(vector<int>& inorder, vector<int>& postorder) {
return traverse(inorder, postorder);
}
};