代码随想录刷题第47天

最新推荐文章于 2024-08-12 19:18:27 发布

气氛组阿宇

最新推荐文章于 2024-08-12 19:18:27 发布

阅读量110

点赞数

文章标签：算法 leetcode 动态规划

本文链接：https://blog.csdn.net/Bi11y/article/details/129308750

版权

代码随想录刷题第47天

打家劫舍


#include <vector>

using namespace std;

 

class Solution {

public:

    int rob(vector<int>& nums) {

        int n = nums.size();

        if (n == 0)

        {

            return 0;

        }

        if (n == 1)

        {

            return nums[0];

        }

 

        vector<int> dp(n+1,0);

        dp[1] = nums[0];

        dp[2] = max(nums[0],nums[1]);

 

        for (int i = 3; i <= n; i++)

        {

            dp[i] = max(dp[i-1],dp[i-2] + nums[i-1]);

        }

        return dp[n];

 

    }

};

打家劫舍 II


#include <vector>

using namespace std;

 

 

class Solution {

public:

    int rob(vector<int>& nums) {

        int n = nums.size();

 

        if (n == 0)

        {

            return 0;

        }

        if (n == 1)

        {

            return nums[0];

        }

 

    int left = dajia(nums,0,n-2);

    int right = dajia(nums,1,n-1);

    return max(left,right);

 

 

    }

 

    int dajia(vector<int>& nums,int start, int end){

        if (start == end)

        {

            return nums[end];

        }

 

        int n = end - start + 1;

        vector<int> dp(n);

        dp[0] = nums[start];

        dp[1] = max(nums[start],nums[start+1]);

        for (int i = 2; i < n; i++)

        {

            dp[i] = max(dp[i-1],dp[i-2] + nums[start+i]);

        }

        return dp[n-1];

 

    }

};

打家劫舍 III


#include <vector>

using namespace std;

 

 

class Solution {

public:

    int rob(TreeNode* root) {

        vector<int> result = robTree(root);

        return max(result[0], result[1]);

    }

 

    vector<int> robTree(TreeNode* cur) {

        if (cur == nullptr)

        {

            return vector<int>{0,0};

        }

 

        vector<int> left = robTree(cur->left);

        vector<int> right = robTree(cur->right);

 

        //0不偷   1偷

 

        //偷cur  

        int val1 = cur->val + left[0] + right[0];  //

 

        //不偷cur

        int val2 = max(left[0],left[1]) + max(right[0],right[1]);

 

        return {val2,val1};

    }

};