public class Solution {
public int rob(int[] nums) {
int last = 0, penultimate = 0, antepenultimate = 0;
for (int i = 0; i < nums.length; i++) {
last = Math.max(antepenultimate + nums[i], penultimate);
antepenultimate = penultimate;
penultimate = last;
}
return last;
}
}
House Robber
最新推荐文章于 2021-08-05 11:16:28 发布