forked from JoshCrozier/leetcode-javascript
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy path0198-house-robber.js
More file actions
30 lines (27 loc) · 909 Bytes
/
0198-house-robber.js
File metadata and controls
30 lines (27 loc) · 909 Bytes
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
/**
* 198. House Robber
* https://leetcode.com/problems/house-robber/
* Difficulty: Medium
*
* 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 systems connected and it will automatically contact the police
* if two adjacent houses were broken into on the same night.
*
* Given an integer array nums representing the amount of money of each house, return the maximum
* amount of money you can rob tonight without alerting the police.
*/
/**
* @param {number[]} nums
* @return {number}
*/
var rob = function(nums) {
let previous = 0;
let current = 0;
for (const n of nums) {
const temp = previous;
previous = current;
current = Math.max(temp + n, previous);
}
return Math.max(current, previous);
};