多阶段最短路径
leetcode198. 打家劫舍
class Solution {
public int rob(int[] nums) {
int fib1 = 0;
int fib2 = 0;
int fibN = 0;
for(int i=0; i<nums.length; i++){
fibN = Math.max(fib1,fib2+nums[i]);
fib2 = fib1;
fib1 = fibN;
}
return fibN;
}
}