-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathbestDayRobBank.java
More file actions
63 lines (51 loc) · 2.23 KB
/
bestDayRobBank.java
File metadata and controls
63 lines (51 loc) · 2.23 KB
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
62
63
/* https://leetcode.com/problems/find-good-days-to-rob-the-bank/
* Find minima; create two arrays where
* 1. Before: each element is less than previous, add 1 so cummulative num of descending
* 2. After: each element is ascending; add 1 so cummulative num of ascending
* 3. Result is where index of before and after are >= than time
*/
import java.util.*;
public class bestDayRobBank {
public static List<Integer> goodDaysToRobBank(int[] security, int time) {
List<Integer> output = new ArrayList<>();
int[] numDaysBefore = new int[security.length];
int[] numDaysAfter = new int[security.length];
if (security.length < 1 + (2*time)) {
return output;
}
// have to consider time is large
// iterate left to right for numDaysBefore
for (int i = 1; i < security.length; i++) {
if (security[i] <= security[i-1]) {
numDaysBefore[i] = 1 + numDaysBefore[i-1];
}
System.out.println("i: " + i);
System.out.println("numDaysBefore[i]: " + numDaysBefore[i]);
// System.out.println("numDaysBefore[i-1]: " + numDaysBefore[i-1]);
}
// iterate left to right for numDaysAfter
for (int i = security.length - 2; i >= 0; i--) {
if (security[i] <= security[i+1]) {
numDaysAfter[i] = 1 + numDaysAfter[i+1];
}
System.out.println("i: " + i);
System.out.println("numDaysAFter[i]: " + numDaysAfter[i]);
}
// iterate over time windows; where the before and after are >= time
for (int i = time; i < security.length - time; i++) {
// System.out.println("36: " + i);
System.out.println("time: " + time);
System.out.println("numDaysBefore[i]: " + numDaysBefore[i]);
System.out.println("numDaysAfter[i]: " + numDaysAfter[i]);
if (numDaysBefore[i] >= time && numDaysAfter[i] >= time) {
output.add(i);
}
}
return output;
}
public static void main(String[] args) {
int[] security1 = {5,3,3,3,5,6,2};
int time1 = 2;
System.out.println("Output1: " + goodDaysToRobBank(security1, time1));
}
}