-
Notifications
You must be signed in to change notification settings - Fork 77
/
MaxSumArray.java
49 lines (36 loc) · 1.26 KB
/
MaxSumArray.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
import java.io.*;
import java.util.*;
public class Solution {
static int maxSubsetSum(int[] arr) {
if (arr.length == 0) {
return 0;
}
arr[0] = Math.max(0, arr[0]);
if (arr.length == 1) {
return arr[0];
}
arr[1] = Math.max(arr[0], arr[1]);
for (int i = 2; i < arr.length; i++) {
arr[i] = Math.max(arr[i - 1], arr[i] + arr[i - 2]);
}
return arr[arr.length - 1];
}
private static final Scanner scanner = new Scanner(System.in);
public static void main(String[] args) throws IOException {
BufferedWriter bufferedWriter = new BufferedWriter(new FileWriter(System.getenv("OUTPUT_PATH")));
int n = scanner.nextInt();
scanner.skip("(\r\n|[\n\r\u2028\u2029\u0085])?");
int[] arr = new int[n];
String[] arrItems = scanner.nextLine().split(" ");
scanner.skip("(\r\n|[\n\r\u2028\u2029\u0085])?");
for (int i = 0; i < n; i++) {
int arrItem = Integer.parseInt(arrItems[i]);
arr[i] = arrItem;
}
int res = maxSubsetSum(arr);
bufferedWriter.write(String.valueOf(res));
bufferedWriter.newLine();
bufferedWriter.close();
scanner.close();
}
}