-
Notifications
You must be signed in to change notification settings - Fork 189
/
Program.java
47 lines (37 loc) · 1.04 KB
/
Program.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
package AlgoExSolutions.Medium.MaximumSubsetSumNoAdjacent;
// import java.util.*;
/**
* * Maximum Subset Sum With No Adjacent
*/
class Program {
/**
* * TC: O(N)
* * SC: O(N)
*/
// public static int maxSubsetSumNoAdjacent(int[] array) {
// // Write your code here.
// if (array.length <= 1) return array.length == 0 ? 0 : array[0];
// int len = array.length;
// int[] dp = new int[len];
// dp[0] = array[0];
// dp[1] = Math.max(array[0], array[1]);
// for (int i = 2; i < len; i++)
// dp[i] = Math.max(dp[i - 1], dp[i - 2] + array[i]);
// return dp[len - 1];
// }
/**
* * TC: O(N)
* * SC: O(1)
*/
public static int maxSubsetSumNoAdjacent(int[] array) {
// Write your code here.
if (array.length <= 1) return array.length == 0 ? 0 : array[0];
int first = array[0], second = Math.max(array[0], array[1]);
for (int i = 2; i < array.length; i++) {
int currentMax = Math.max(second, first + array[i]);
first = second;
second = currentMax;
}
return second;
}
}