@@ -0,0 +1,986 @@
+/**%0A * You are a professional robber planning to rob houses along a street. %0A * Each house has a certain amount of money stashed, the only constraint stopping you from robbing each of them %0A * is that adjacent houses have security system connected and it will automatically contact the police if two %0A * adjacent houses were broken into on the same night. %0A * Given a list of non-negative integers representing the amount of money of each house, determine the maximum %0A * amount of money you can rob tonight without alerting the police.%0A **/%0Apublic class Solution %7B%0A    public int rob(int%5B%5D nums) %7B%0A        if(nums == null) %0A            return 0;%0A        int len = nums.length;%0A        if(len == 0)    %0A            return 0;%0A        int%5B%5D sum = new int%5Blen%5D;%0A        sum%5B0%5D = nums%5B0%5D;%0A        if(len %3E 1) %0A            sum%5B1%5D = Math.max(nums%5B0%5D, nums%5B1%5D);%0A        for(int i = 2; i %3C len; i++)%0A            sum%5Bi%5D = Math.max(nums%5Bi%5D+sum%5Bi-2%5D, sum%5Bi-1%5D);%0A        return sum%5Blen-1%5D;%0A    %7D%0A%7D%0A

Create 198.java