-
Notifications
You must be signed in to change notification settings - Fork 4
/
MaxSubsetSumNoAdjacent.java
61 lines (54 loc) · 1.37 KB
/
MaxSubsetSumNoAdjacent.java
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
48
49
50
51
52
53
54
55
56
57
58
59
60
61
import java.util.*;
class A
{
public static void main(String[] args)
{
int[] arr = new int[]{7,10,12,7,9,14};
int result = getMaxSumNoAdjacent(arr);
System.out.println("Maximun Sum of No adjacent elements taken is "+ result);
int result2 = getMaxSumNoAdjacentSpaceOptimal(arr);
System.out.println("Maximun Sum of No adjacent elements taken is (Space Optimised)"+ result2);
}
//Time Complexity O(n) | Space Complexity O(n) == n -> input array length
public static int getMaxSumNoAdjacent(int[] arr)
{
if(arr.length == 0)
{
return 0;
}
if(arr.length == 1)
{
return arr[0];
}
int[] maxSums = new int[arr.length];
maxSums[0]=arr[0];
maxSums[1]= Math.max(arr[0],arr[1]);
for(int i = 2 ; i < maxSums.length ; i++)
{
maxSums[i] = Math.max(maxSums[i-1],maxSums[i-2]+arr[i]);
}
return maxSums[maxSums.length-1];
}
//Time Complexity O(n) |Space Complexity O(1)
public static int getMaxSumNoAdjacentSpaceOptimal(int[] arr)
{
if(arr.length == 0)
{
return 0;
}
if(arr.length == 1)
{
return arr[0];
}
int second = arr[0];
int first = Math.max(arr[0],arr[1]);
int current = 0;
for(int i = 2 ; i < arr.length ; i++)
{
current = Math.max(first,second+arr[i]);
second = first;
first = current;
}
return current;
}
}