Java House Robber solution


  • 7
    V

    public class Solution {

    public int rob(int[] nums) {
    
       if(nums == null || nums.length == 0){
           return 0;
       }
    
       if(nums.length == 1){
           return nums[0];
       }
    
       if(nums.length == 2){
           return Math.max(nums[0], nums[1]);
       }
       
       
       int[] dp = new int[nums.length];
       dp[0] = nums[0];
       dp[1] = Math.max(nums[0], nums[1]);
       
       for(int i = 2; i < dp.length; i++){
           dp[i] = Math.max(dp[i-1], dp[i-2] + nums[i]);
       }
       
       return dp[dp.length - 1];
    }
    

    }


  • 0
    C
    This post is deleted!

Log in to reply
 

Looks like your connection to LeetCode Discuss was lost, please wait while we try to reconnect.