代码随想录算法训练营第46期Day16

leetCode 513.找树下左下角的值

都找最底层了，那必然是层序遍历啊

class Solution {
public:
    int findBottomLeftValue(TreeNode* root) {
if(root==NULL) return NULL;
queue<TreeNode*> q;
int record=0;
q.push(root);
while(!q.empty()){
//dep++;
int size=q.size();
for(int i=0;i<size;i++){
TreeNode* node=q.front();
if(i==0){
record=node->val;
}
if(node->left)q.push(node->left);
if(node->right)q.push(node->right);
q.pop();
}



}
return record; 
    }
};

我们再练一下回溯法

当depth>max的时候才更新result，我们保证优先左边搜索，那么result存的就是最底层左下角的值

class Solution {
public:
int result;
int maxDepth=INT_MIN;
void traversal(TreeNode* root,int depth){
if(root->left==NULL&&root->right==NULL){
    if(depth>maxDepth){
        maxDepth=depth;
        result=root->val;
    }
    return;
}
if(root->left){
    traversal(root->left,depth+1);
}
if(root->right){
    traversal(root->right,depth+1);
}
return;
}
    int findBottomLeftValue(TreeNode* root) {
traversal(root,0);
return result;
    }
};

LeetCode 112.路径总和

和路径相关，那多半就要递归回溯了

class Solution {
public:
    bool hasPathSum(TreeNode* root, int count) {
        if(root==NULL) return false;
 if(!root->left&&!root->right&&count==root->val){
    return true;
}
if(!root->left&&!root->right){//这个if语句可以删除
    return false;
}

/*if(root->left)  if(hasPathSum(root->left,count-root->val))return true;
if(root->right)  if(hasPathSum(root->right,count-root->val))return true;
return false;*/
 return hasPathSum(root->left, count- root->val) || hasPathSum(root->right, count - root->val);
    }
};

这道题细节较麻烦，国庆看视频再过一遍

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);
    }
};