Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- class Solution {
- public:
- int rob(vector<int>& nums) {
- int n=nums.size();
- if(n==1)
- return nums[0];
- else if(n==2)
- return max(nums[0],nums[1]);
- vector<int> dp(n,0);
- dp[0]=nums[0];
- dp[1]= max(nums[0],nums[1]);
- for(int i=2;i<n;i++)
- {
- dp[i]=max(dp[i-1],nums[i]+dp[i-2]);
- }
- return dp[n-1];
- }
- };
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement