Javascript solution O(n) time O(1) space


  • 0
    R
    var rob = function(nums) {
        if(nums.length === 0)
            return 0;
        if(nums.length === 1)
            return nums[0];
        
        nums[1] = Math.max(nums[0], nums[1]);
    
        for(var i = 2; i < nums.length; i++){
            nums[i] = Math.max(nums[i-2] + nums[i], nums[i - 1]);
        }
        
        return nums[nums.length - 1];
        
    };

Log in to reply
 

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