zoukankan      html  css  js  c++  java
  • Java for LeetCode 198 House Robber

    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

    解题思路:

    dp问题 dp[i]=nums[i]+Math.max(dp[i-2], dp[i-3])

    JAVA实现如下:

        public int rob(int[] nums) {
            if(nums==null||nums.length==0)
                return 0;
            if(nums.length<=2)
            	return Math.max(nums[0], nums[nums.length-1]);
            int[] dp=new int[nums.length];
            dp[0]=nums[0];
            dp[1]=nums[1];
            dp[2]=nums[0]+nums[2];
            for(int i=3;i<nums.length;i++)
            	dp[i]=nums[i]+Math.max(dp[i-2], dp[i-3]);
            return Math.max(dp[nums.length-1], dp[nums.length-2]);
        }
    
  • 相关阅读:
    mysql分组排序取组内第一的数据行
    C#版Nebula客户端编译
    关于nginx
    http状态码
    gitlab
    TCP/IP 3次握手和四次断开
    nps 内网穿透
    用CentOS7做一个简单的路由器
    linux 简单特效
    LVS粗讲
  • 原文地址:https://www.cnblogs.com/tonyluis/p/4557726.html
Copyright © 2011-2022 走看看