zoukankan      html  css  js  c++  java
  • 【LeetCode】198

    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.

    Solution:动态规划,当前rob到第n幢房子获得的最大收益为maxV(n)=max(maxV(n-2)+nums[n],maxV(n-1))

     1 class Solution {
     2 public:
     3     int rob(vector<int>& nums) {
     4         int n=nums.size();
     5         if(n==0)return 0;
     6         if(n==1)return nums[0];
     7         
     8         vector<int> maxV(n,0);
     9         maxV[0]=nums[0];
    10         maxV[1]=max(nums[0],nums[1]);
    11         for(int i=2;i<n;i++)maxV[i]=max(maxV[i-2]+nums[i],maxV[i-1]);
    12         
    13         return maxV[n-1];
    14         
    15     }
    16 };
  • 相关阅读:
    TSQL语句 创建表
    数据库设计
    WampServer
    表单验证之相等验证
    表单验证之非空验证
    遗忘的知识点
    JavaScript函数
    JS之数组
    JS的分支与循环语句
    JavaScript基础语法要点总结
  • 原文地址:https://www.cnblogs.com/irun/p/4700769.html
Copyright © 2011-2022 走看看