【leetcode】House Robber I & II

You are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed, the only constraint stopping you from robbing each of them is that adjacent houses have security system connected and it will automatically contact the police if two adjacent houses were broken into on the same night.

Given a list of non-negative integers representing the amount of money of each house, determine the maximum amount of money you can rob tonight without alerting the police.

 

class Solution {
public:
    int rob(vector<int>& nums) {
        int take=0;
        int maxProfit=0;
        int nonTake=0;

        for(int i=0;i<nums.size();++i)
        {
            take=nonTake+nums[i];
            nonTake=maxProfit;
            maxProfit=max(take,nonTake);
        }

        return maxProfit;
    }
};

 

II:

After robbing those houses on that street, the thief has found himself a new place for
his thievery so that he will not get too much attention. This time, all houses at this place are arranged in a circle.
That means the first house is the neighbor of the last one. Meanwhile,
the security system for these houses remain the same as for those in the previous street.
Given a list of non-negative integers representing the amount of money of each house, determine the maximum amount of money you can rob tonight without alerting the police.

 

class Solution {
public:
    int rob(vector<int>& nums) {
        if(nums.size()==1) return nums[0];
        return max(robbing(nums,0,nums.size()-1),robbing(nums,1,nums.size()));
    }

    int robbing(vector<int> &nums,int left,int right)
    {
        int take=0;
        int maxProfit=0;
        int nonTake=0;
        for(int i=left;i<right;i++)
        {
            take=nonTake+nums[i];
            nonTake=maxProfit;
            maxProfit=max(take,nonTake);
        }

        return maxProfit;
    }
};