Advertisement
Guest User

Untitled

a guest
Jan 18th, 2019
65
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
C++ 0.40 KB | None | 0 0
  1. const int N = static_cast<const int>(1e5);
  2.  
  3. class Solution {
  4. public:
  5.     int dp[N + 7];
  6.  
  7.     int rob(vector<int>& nums) {
  8.         if (nums.size() == 0 ){
  9.             return 0;
  10.         }
  11.         dp[1] = nums[0];
  12.  
  13.         for(int i = 1; i < nums.size(); i++){
  14.             dp[i + 1] = max(dp[i], i - 1 >= 0 ? dp[i - 1] + nums[i] : nums[i]);
  15.         }
  16.         return dp[nums.size()];
  17.     }
  18. };
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement