-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathSolution.java
More file actions
100 lines (88 loc) · 3.76 KB
/
Solution.java
File metadata and controls
100 lines (88 loc) · 3.76 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
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
package rider;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.Comparator;
import java.util.HashMap;
import java.util.HashSet;
import java.util.List;
import java.util.Map;
import java.util.Set;
class Struct implements Comparable<Struct> {
String username;
int timestamp;
String website;
public Struct(String username, int timestamp, String website) {
this.username = username;
this.timestamp = timestamp;
this.website = website;
}
public int compareTo(Struct struct2) {
if (this.timestamp != struct2.timestamp)
return this.timestamp - struct2.timestamp;
else
return this.username.compareTo(struct2.username);
}
}
class Solution {
public List<String> mostVisitedPattern(String[] username, int[] timestamp, String[] website) {
int length = username.length;
Struct[] array = new Struct[length];
for (int i = 0; i < length; i++)
array[i] = new Struct(username[i], timestamp[i], website[i]);
Arrays.sort(array);
Map<String, List<String>> userVisitsMap = new HashMap<String, List<String>>();
for (int i = 0; i < length; i++) {
Struct struct = array[i];
String curUser = struct.username;
String curWebsite = struct.website;
List<String> list = userVisitsMap.getOrDefault(curUser, new ArrayList<String>());
list.add(curWebsite);
userVisitsMap.put(curUser, list);
}
int maxCount = 0;
Map<String, Integer> countMap = new HashMap<String, Integer>();
Map<String, List<String>> strListMap = new HashMap<String, List<String>>();
Set<String> set = userVisitsMap.keySet();
for (String user : set) {
Set<String> sequenceSet = new HashSet<String>();
List<String> list = userVisitsMap.getOrDefault(user, new ArrayList<String>());
int size = list.size();
if (size >= 3) {
for (int i = 0; i < size - 2; i++) {
String website1 = list.get(i);
for (int j = i + 1; j < size - 1; j++) {
String website2 = list.get(j);
for (int k = j + 1; k < size; k++) {
String website3 = list.get(k);
List<String> sequence = new ArrayList<String>();
sequence.add(website1);
sequence.add(website2);
sequence.add(website3);
String sequenceStr = sequence.toString();
if (sequenceSet.add(sequenceStr)) {
int count = countMap.getOrDefault(sequenceStr, 0) + 1;
maxCount = Math.max(maxCount, count);
countMap.put(sequenceStr, count);
strListMap.put(sequenceStr, sequence);
}
}
}
}
}
}
List<List<String>> candidates = new ArrayList<List<String>>();
Set<String> sequenceSet = countMap.keySet();
for (String sequenceStr : sequenceSet) {
int count = countMap.getOrDefault(sequenceStr, 0);
if (count == maxCount)
candidates.add(strListMap.get(sequenceStr));
}
Collections.sort(candidates, new Comparator<List<String>>() {
public int compare(List<String> sequence1, List<String> sequence2) {
return sequence1.toString().compareTo(sequence2.toString());
}
});
return candidates.get(0);
}
}