LeetCode-in-Net/LeetCodeNet/G0101_0200/S0198_house_robber/Solution.cs at main · jscrdev/LeetCode-in-Net · GitHub

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
namespace LeetCodeNet.G0101_0200.S0198_house_robber {

// #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Dynamic_Programming
// #LeetCode_75_DP/1D #Algorithm_I_Day_12_Dynamic_Programming #Dynamic_Programming_I_Day_3
// #Level_2_Day_12_Dynamic_Programming #Udemy_Dynamic_Programming #Top_Interview_150_1D_DP
// #Big_O_Time_O(n)_Space_O(n) #2025_06_14_Time_0_ms_(100.00%)_Space_41.15_MB_(69.24%)

public class Solution {
    public int Rob(int[] nums) {
        if (nums.Length == 0) {
            return 0;
        }
        if (nums.Length == 1) {
            return nums[0];
        }
        if (nums.Length == 2) {
            return Math.Max(nums[0], nums[1]);
        }
        int[] profit = new int[nums.Length];
        profit[0] = nums[0];
        profit[1] = Math.Max(nums[1], nums[0]);
        for (int i = 2; i < nums.Length; i++) {
            profit[i] = Math.Max(profit[i - 1], nums[i] + profit[i - 2]);
        }
        return profit[nums.Length - 1];
    }
}
}