算法训练营第18天|LeetCode 513.找树左下角的值 112.路径总和 113.路径总和2 106.从中序与后序遍历序列构造二叉树 105.从前序与中序遍历序列构造二叉树

LeetCode 513.找树左下角的值

题目链接：

LeetCode 513.找树左下角的值

代码：

迭代法：

class Solution {
public:
    int findBottomLeftValue(TreeNode* root) {
        queue<TreeNode*>que;
        if(root!=NULL) que.push(root);
        int result;
        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;
    }
};

递归法

 

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

LeetCode 112.路径总和

题目链接：

LeetCode 112.路径总和

代码：

迭代法：

class Solution {
public:
    bool hasPathSum(TreeNode* root, int targetSum) {
        queue<TreeNode*>que;
        queue<int>que_val;
        if(root!=NULL){
            que.push(root);
            que_val.push(root->val);
        }
        while(!que.empty()){
            int size = que.size();
            for(int i=0;i<size;i++){
                TreeNode*Node = que.front();
                int temp = que_val.front();
                que.pop();
                que_val.pop();
                if(Node->left==NULL&&Node->right==NULL&&temp==targetSum){
                    return true;
                }
                if(Node->left){
                    que.push(Node->left);
                    que_val.push(Node->left->val+temp);
                }
                if(Node->right){
                    que.push(Node->right);
                    que_val.push(Node->right->val+temp);
                }
            }
        }
        return false;
    }
};

递归法：

 

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==nullptr) return false;
        return traversal(root,targetSum);
    }
};

LeetCode 113.路径总和2

题目链接：

LeetCode 113.路径总和2

代码：

class Solution {
public:
    vector<vector<int>>result;
    vector<int>path;
    void traversal(TreeNode* cur, int count){
        if(!cur->left&&!cur->right&&count==0){
            result.push_back(path);
            return;
        }
        if(!cur->left&&!cur->right) return;
        if(cur->left){
            count-=cur->left->val;
            path.push_back(cur->left->val);
            traversal(cur->left, count);
            count+=cur->left->val;
            path.pop_back();
        }
        if(cur->right){
            count-=cur->right->val;
            path.push_back(cur->right->val);
            traversal( cur->right, count);
            count+=cur->right->val;
            path.pop_back();
        }
        return;
    }
    vector<vector<int>> pathSum(TreeNode* root, int targetSum) {
        result.clear();
        path.clear();
        if(root==NULL) return result;
        path.push_back(root->val);
        traversal(root,targetSum-root->val);
        return result;

    }
};

LeetCode 106.从中序与后序遍历序列构造二叉树

题目链接：

LeetCode 106.从中序与后序遍历序列构造二叉树

代码：

class Solution {
public:
    TreeNode*traversal(vector<int>& inorder, vector<int>& postorder){
        if(postorder.size()==0) return nullptr;
        int rootValue = postorder[postorder.size()-1];
        TreeNode*root = new TreeNode(rootValue);

        if(postorder.size()==1) return root;

        int delimiterIndex =0;
        for(delimiterIndex =0;delimiterIndex<inorder.size();delimiterIndex++){
            if(rootValue==inorder[delimiterIndex]) break;
        }
        vector<int>leftInorder(inorder.begin(),inorder.begin()+delimiterIndex);
        vector<int>rightInorder(inorder.begin()+delimiterIndex+1,inorder.end());
        postorder.resize(postorder.size()-1);
        vector<int>leftPostorder(postorder.begin(),postorder.begin()+delimiterIndex);
        vector<int>rightPostorder(postorder.begin()+delimiterIndex,postorder.end());

        root->left = traversal(leftInorder,leftPostorder);
        root->right = traversal(rightInorder,rightPostorder);
        return root;
    }
    TreeNode* buildTree(vector<int>& inorder, vector<int>& postorder) {
        if(inorder.size()==0||postorder.size()==0) return nullptr;
        return traversal(inorder,postorder);

    }
};

LeetCode 105.从前序与中序遍历序列构造二叉树

题目链接：

LeetCode 105.从前序与中序遍历序列构造二叉树

代码：

class Solution {
public:
    TreeNode* traversal (vector<int>& inorder, int inorderBegin, int inorderEnd, vector<int>& preorder, int preorderBegin, int preorderEnd){
        if (preorderBegin == preorderEnd) return NULL;

        int rootValue = preorder[preorderBegin];
        TreeNode* root = new TreeNode(rootValue);

        if (preorderEnd - preorderBegin == 1) return root;
        int delimiterIndex;
        for (delimiterIndex = inorderBegin; delimiterIndex < inorderEnd; delimiterIndex++) {
            if (inorder[delimiterIndex] == rootValue) break;
        }
        int leftInorderBegin = inorderBegin;
        int leftInorderEnd = delimiterIndex;
        int rightInorderBegin = delimiterIndex + 1;
        int rightInorderEnd = inorderEnd;

        int leftPreorderBegin =  preorderBegin + 1;
        int leftPreorderEnd = preorderBegin + 1 + delimiterIndex - inorderBegin;
        int rightPreorderBegin = preorderBegin + 1 + (delimiterIndex - inorderBegin);
        int rightPreorderEnd = preorderEnd;

        root->left = traversal(inorder, leftInorderBegin, leftInorderEnd,  preorder, leftPreorderBegin, leftPreorderEnd);
        root->right = traversal(inorder, rightInorderBegin, rightInorderEnd, preorder, rightPreorderBegin, rightPreorderEnd);

        return root;
    }
    TreeNode* buildTree(vector<int>& preorder, vector<int>& inorder) {
        if(preorder.size()==0||inorder.size()==0) return NULL;
        return traversal(inorder, 0, inorder.size(), preorder, 0, preorder.size());
    }
};