|
1 | 1 | packagecom.fishercoder.solutions; |
2 | 2 |
|
3 | | -/**198. House Robber |
4 | | -
|
5 | | - You are a professional robber planning to rob houses along a street. |
6 | | - Each house has a certain amount of money stashed, |
7 | | - the only constraint stopping you from robbing each of them is that adjacent houses have security |
8 | | - system connected and it will automatically contact the police if two adjacent houses were broken into on the same night. |
9 | | - Given a list of non-negative integers representing the amount of money of each house, |
10 | | - determine the maximum amount of money you can rob tonight without alerting the police. |
11 | | -
|
12 | | - Example 1: |
13 | | - Input: [1,2,3,1] |
14 | | - Output: 4 |
15 | | - Explanation: Rob house 1 (money = 1) and then rob house 3 (money = 3). |
16 | | - Total amount you can rob = 1 + 3 = 4. |
17 | | -
|
18 | | - Example 2: |
19 | | - Input: [2,7,9,3,1] |
20 | | - Output: 12 |
21 | | - Explanation: Rob house 1 (money = 2), rob house 3 (money = 9) and rob house 5 (money = 1). |
22 | | - Total amount you can rob = 2 + 9 + 1 = 12. |
23 | | - */ |
24 | 3 | publicclass_198 { |
25 | 4 |
|
26 | 5 | publicstaticclassSolution1 { |
|