-
Notifications
You must be signed in to change notification settings - Fork 20
/
Copy pathbusiest-time-in-the-mall.java
50 lines (45 loc) · 1.52 KB
/
busiest-time-in-the-mall.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
import java.io.*;
import java.util.*;
class Solution {
static int findBusiestPeriod(int[][] data) {
int maxTimestamp = 0;
int currTime = data[0][0];
int maxVisitors = -1;
int currVisitors = data[0][2] == 1 ? data[0][1] : -data[0][1];
for (int i = 1; i < data.length; i++) {
if (data[i][0] == currTime) {
currVisitors += data[i][2] == 1 ? data[i][1] : -data[i][1];
} else {
if (currVisitors > maxVisitors) {
maxVisitors = currVisitors;
maxTimestamp = currTime;
}
currVisitors += data[i][2] == 1 ? data[i][1] : -data[i][1];
currTime = data[i][0];
}
}
if (currVisitors > maxVisitors) {
maxVisitors = currVisitors;
maxTimestamp = currTime;
}
return maxTimestamp;
}
public static void main(String[] args) {
int[][] data = new int[][]
{{1, 4, 1},
{2, 10, 1},
{2, 10, 0}};
/** int[][] data = new int[][]
{{1487799425, 14, 1},
{1487799425, 4, 0},
{1487799425, 2, 0},
{1487800378, 10, 1},
{1487801478, 18, 0},
{1487801478, 18, 1},
{1487901013, 1, 0},
{1487901211, 7, 1},
{1487901211, 7, 0} }; **/
int res = findBusiestPeriod(data);
System.out.println(res);
}
}