leetcode 198 House Robber

jzman 發(fā)布于2019-08-16 11:06 / 856人閱讀

摘要：但是任何臨近的兩個房子被偷就會觸發(fā)警報。要求我們求出在不觸發(fā)警報的情況下偷到的最多的錢。每個房子里的錢通過輸入的數(shù)組表示。

題目詳情

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.

題目的意思是，我們是一個江洋大盜～現(xiàn)在我們要去偷整條街的房子，每個房子里有一定的錢。但是任何臨近的兩個房子被偷就會觸發(fā)警報。要求我們求出在不觸發(fā)警報的情況下偷到的最多的錢。每個房子里的錢通過輸入的int數(shù)組表示。

想法

動態(tài)規(guī)劃問題

對于每一個房子，我們有偷／不偷兩種選擇

因此我們聲明兩個變量prevNo和prevYes分別保存，我沒偷/偷了當前房子的情況下，目前為止偷的最多的錢數(shù)。

如果想偷當前房子，那么要求我們并沒有偷前一個房子，所以用前一個房子的prevNo值和當前房子的錢數(shù)相加。

如果不偷當前房子，那我們可以取前一個房子的prevNo值和prevYes值中較大的那個。

解法

    public int rob(int[] nums) {
                int prevNo = 0;
        int prevYes = 0;
        
        for(int n: nums){
            int temp = prevNo;
            prevNo = Math.max(prevNo, prevYes);
            prevYes = temp+n;
        }
        
        return Math.max(prevNo, prevYes);
    }

GPU云服務器云服務器 Robber House 198cdn Leetcod

文章版權歸作者所有，未經允許請勿轉載,若此文章存在違規(guī)行為，您可以聯(lián)系管理員刪除。

轉載請注明本文地址：http://m.hztianpu.com/yun/71012.html

leetcode198,213 house robber

摘要：你不能連著偷兩家因為這樣會觸發(fā)警報系統(tǒng)?，F(xiàn)在有一個數(shù)組存放著每一家中的可偷金額，問可以偷的最大金額為多少這里考驗了動態(tài)編程的思想。動態(tài)編程要求我們將問題一般化，然后再找到初始情況開始這個由一般到特殊的計算過程。 House Robber I You are a professional robber planning to rob houses along a street. Each...

whidy 2019-08-16 11:01 評論0 收藏0
[LeetCode] House Robber I II

摘要：注意對邊界條件的判斷，是否非空，是否長度為 House Robber I Problem 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 y...

qpal 2019-08-14 15:17 評論0 收藏0
[Leetcode] House Robber 打家劫舍

摘要：動態(tài)規(guī)劃復雜度時間空間思路一般來說，給定一個規(guī)則，讓我們求任意狀態(tài)下的解，都是用動態(tài)規(guī)劃。另外我們可以做一點優(yōu)化，本來我們是要用一個數(shù)組來保存之前的結果的。所以我們分別算出這兩個條件下的最大收益，然后取更大的就行了?？梢詮陀玫拇a。 House Robber I You are a professional robber planning to rob houses along a ...

golden_hamster 2019-08-14 12:38 評論0 收藏0
LeetCode[337] House Robber III

摘要：復雜度思路對于每一個位置來說，考慮兩種情況分別對和再進行計算。用對已經計算過的進行保留，避免重復計算。 LeetCode[337] House Robber III The thief has found himself a new place for his thievery again. There is only one entrance to this area, calle...

Dr_Noooo 2019-08-14 15:00 評論0 收藏0
[LintCode/LeetCode] House Robber II

摘要：因為取了隊首就不能取隊尾，所以對數(shù)組循環(huán)兩次，一個從取到，一個從取到，比較兩次循環(huán)后隊尾元素，取較大者。注意，要先討論當原數(shù)組位數(shù)小于時的情況。 Problem After robbing those houses on that street, the thief has found himself a new place for his thievery so that he wi...

OnlyLing 2019-08-14 15:34 評論0 收藏0