LeetCode company workers use key-cards to unlock office doors. Each time a worker uses their key-card, the security system saves the worker's name and the time when it was used. The system emits an alert if any worker uses the key-card three or more times in a one-hour period.
You are given a list of strings keyName
and keyTime
where [keyName[i], keyTime[i]]
corresponds to a person's name and the time when their key-card was used in a single day.
Access times are given in the 24-hour time format "HH:MM", such as "23:51"
and "09:49"
.
Return a list of unique worker names who received an alert for frequent keycard use. Sort the names in ascending order alphabetically.
Notice that "10:00"
- "11:00"
is considered to be within a one-hour period, while "22:51"
- "23:52"
is not considered to be within a one-hour period.
Example 1:
Input: keyName = ["daniel","daniel","daniel","luis","luis","luis","luis"], keyTime = ["10:00","10:40","11:00","09:00","11:00","13:00","15:00"] Output: ["daniel"] Explanation: "daniel" used the keycard 3 times in a one-hour period ("10:00","10:40", "11:00").
思路:收集每个人的time,转换成时间后,算diff;因为只求name,所以找到0<= times[i] - times[i - 2] <= 60就行了;
class Solution {
public List<String> alertNames(String[] keyName, String[] keyTime) {
HashMap<String, List<Integer>> hashmap = new HashMap<>();
for(int i = 0; i < keyName.length; i++) {
String name = keyName[i];
String time = keyTime[i];
hashmap.putIfAbsent(name, new ArrayList<Integer>());
hashmap.get(name).add(convertTime(time));
}
List<String> res = new ArrayList<>();
for(String name: hashmap.keySet()) {
List<Integer> times = hashmap.get(name);
Collections.sort(times);
for(int i = 2; i < times.size(); i++) {
int diff = times.get(i) - times.get(i - 2);
if(0 <= diff && diff <= 60) {
res.add(name);
break;
}
}
}
Collections.sort(res);
return res;
}
private int convertTime(String time) {
String[] splits = time.split(":");
return Integer.parseInt(splits[0]) * 60 + Integer.parseInt(splits[1]);
}
}