House Robber

public class Solution {
    public int rob(int[] num) {
 // https://leetcode.com/discuss/30020/java-o-n-solution-space-o-1 不是很理解
    int prevNo = 0;
    int prevYes = 0;
    for (int n : num) {
        int temp = prevNo;
        prevNo = Math.max(prevNo, prevYes); // here prevNo is the next loop's prevNo
        prevYes = n + temp;                 // next loop's prevYes
    }
    return Math.max(prevNo, prevYes);

    }
}