@@ -0,0 +1,369 @@
+package leetcode.house_robber;%0A%0Apublic class Solution %7B%0A    public int rob(int%5B%5D num) %7B%0A        int rob = 0, notrob = 0;%0A        for(int i = 0; i %3C num.length; i++)%7B%0A            int n_notrob = Math.max(rob, notrob);%0A            int n_rob = notrob + num%5Bi%5D;%0A            rob = n_rob;%0A            notrob = n_notrob;%0A        %7D%0A        return Math.max(rob, notrob);%0A    %7D%0A%7D%0A

Add java solution for 198. House Robber