Day 29 of LeetCode
Documenting LeetCode solving.
Q88
198. House Robber
Medium. 1D DP.
class Solution {
public int rob(int[] nums) {
int rob1 = 0, rob2 = 0;
// [rob1, rob2, n, n + 1, ...]
for (int n : nums) {
int temp = Math.max(...
evelynsjourney.hashnode.dev2 min read