-
Notifications
You must be signed in to change notification settings - Fork 0
/
198.house-robber.ts
69 lines (68 loc) · 1.66 KB
/
198.house-robber.ts
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
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
/*
* @lc app=leetcode id=198 lang=typescript
*
* [198] House Robber
*
* https://leetcode.com/problems/house-robber/description/
*
* algorithms
* Medium (47.72%)
* Likes: 13064
* Dislikes: 275
* Total Accepted: 1.2M
* Total Submissions: 2.5M
* Testcase Example: '[1,2,3,1]'
*
* 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.
*
*
* Example 1:
*
*
* Input: nums = [1,2,3,1]
* Output: 4
* Explanation: Rob house 1 (money = 1) and then rob house 3 (money = 3).
* Total amount you can rob = 1 + 3 = 4.
*
*
* Example 2:
*
*
* Input: nums = [2,7,9,3,1]
* Output: 12
* Explanation: Rob house 1 (money = 2), rob house 3 (money = 9) and rob house
* 5 (money = 1).
* Total amount you can rob = 2 + 9 + 1 = 12.
*
*
*
* Constraints:
*
*
* 1 <= nums.length <= 100
* 0 <= nums[i] <= 400
*
*
*/
// @lc code=start
function rob(nums: number[]): number {
let skipLast = 0,
robLast = nums[0],
temp;
for (let i = 1; i < nums.length; i++) {
temp = skipLast;
// If we don't choose to rob the current house, the max value could be the this.
skipLast = Math.max(robLast, skipLast);
robLast = temp + nums[i];
}
return Math.max(skipLast, robLast);
}
// @lc code=end