198. 打家劫舍
程序员文章站
2022-03-24 14:15:42
...
题目:
题解:
代码:
public class code198 {
public static int rob(int[] nums) {
if(nums == null || nums.length == 0)
{
return 0;
}
int len = nums.length;
if(len == 1)
{
return nums[0];
}
int dp[] = new int[len];
dp[0] = nums[0];
dp[1] = Math.max(nums[0], nums[1]);
for(int i = 2; i < len; i++)
{
dp[i] = Math.max(dp[i - 2] + nums[i], dp[i - 1]);
}
return dp[len - 1];
}
public static void main(String[] args) {
int nums[] = { 2, 7, 9, 3, 1 };
int res = rob(nums);
System.out.println(res);
}
}