leetcodeProblems/M_213_House_robber_2.java at master · SiddharthaHaldar/leetcodeProblems · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
class Solution {
    public int rob(int[] nums) {
        int l=nums.length;
        if(l==0)
            return 0;
        if(l==1)
            return nums[0];
        int max=-1;
        int arr1[]=new int[l-1];
        int arr2[]=new int[l-1];
        for(int x=nums.length-1;x>=1;x--)
        {
            if(x==nums.length-1 || x==nums.length-2)
                {arr1[x-1]=nums[x];}
            else if(x==nums.length-3)
                arr1[x-1]=nums[x]+arr1[x+1];
            else
            {
                if(nums[x]+arr1[x+1]>nums[x]+arr1[x+2])
                    arr1[x-1]=nums[x]+arr1[x+1];
                else
                    arr1[x-1]=nums[x]+arr1[x+2];
            }
            if(arr1[x-1]>max)
                max=arr1[x-1];

        }
        for(int x=nums.length-2;x>=0;x--)
        {
            if(x==nums.length-2 || x==nums.length-3)
                {arr2[x]=nums[x];}
            else if(x==nums.length-4)
                arr2[x]=nums[x]+arr2[x+2];
            else
            {
                if(nums[x]+arr2[x+2]>nums[x]+arr2[x+3])
                    arr2[x]=nums[x]+arr2[x+2];
                else
                    arr2[x]=nums[x]+arr2[x+3];
            }
            if(arr2[x]>max)
                max=arr2[x];
        }

        return max;
    }
}