LeetCode 198. House Robber [Easy] 发表于 2019-05-10 | 更新于 2024-04-23 | 分类于 LeetCode , Easy | 阅读次数: LeetCode 198. House Robber. 题目来源:https://leetcode.com/problems/house-robber 题目难度:Easy 解答1[Java]:1234567891011121314class Solution { public int rob(int[] nums) { if (nums.length == 0) return 0; int prev1 = 0; int prev2 = 0; for (int num : nums) { int tmp = prev1; prev1 = Math.max(prev2 + num, prev1); prev2 = tmp; } return prev1; }}