[Java] 1006. Sign In and Sign Out (25)-PAT甲级

1006. Sign In and Sign Out (25)
At the beginning of every day, the first person who signs in the computer room will unlock the door, and the last one who signs out will lock the door. Given the records of signing in’s and out’s, you are supposed to find the ones who have unlocked and locked the door on that day.

Input Specification:

Each input file contains one test case. Each case contains the records for one day. The case starts with a positive integer M, which is the total number of records, followed by M lines, each in the format:

ID_number Sign_in_time Sign_out_time
where times are given in the format HH:MM:SS, and ID number is a string with no more than 15 characters.

Output Specification:

For each test case, output in one line the ID numbers of the persons who have unlocked and locked the door on that day. The two ID numbers must be separated by one space.

Note: It is guaranteed that the records are consistent. That is, the sign in time must be earlier than the sign out time for each person, and there are no two persons sign in or out at the same moment.

Sample Input:
3
CS301111 15:30:28 17:00:10
SC3021234 08:00:00 11:25:25
CS301133 21:45:00 21:58:40
Sample Output:
SC3021234 CS301133

题目大意：给出n个人的id、sign in时间、sign out时间，求最早进来的人和最早出去的人的ID～

PS：感谢github用户@fs19910227提供的pull request～

import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.text.DateFormat;
import java.text.ParseException;
import java.text.SimpleDateFormat;
import java.util.Date;public class Main {static class Record {static DateFormat format = new SimpleDateFormat("HH:mm:ss");String id;Date start;Date end;Record(String id, String start, String end) throws ParseException {this.id = id;this.start = format.parse(start);this.end = format.parse(end);}}public static void main(String[] args) throws Exception {BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));int record_counts = Integer.valueOf(reader.readLine());String[] split = reader.readLine().split(" ");Record record = new Record(split[0], split[1], split[2]);Record earliest = record, latest = record;for (int i = 1; i < record_counts; i++) {split = reader.readLine().split(" ");Record newRecord = new Record(split[0], split[1], split[2]);if (newRecord.start.compareTo(earliest.start) < 0) {earliest = newRecord;}if (newRecord.end.compareTo(latest.end) > 0) {latest = newRecord;}}System.out.println(earliest.id + " " + latest.id);}
}

[Java] 1006. Sign In and Sign Out (25)-PAT甲级相关推荐

1006. Sign In and Sign Out (25)-PAT甲级真题
At the beginning of every day, the first person who signs in the computer room will unlock the door, ...
[Java] 1010. Radix (25)-PAT甲级
1010. Radix (25) Given a pair of positive integers, for example, 6 and 110, can this equation 6 = 11 ...
1020. Tree Traversals (25) PAT甲级真题
之前我看了这道题,实在是看不懂网上的解题答案,他们的具体思路基本上就是通过后续遍历和中序遍历,直接推出层次遍历. 我苦思冥想了半天,是在没看懂这种思路,于是想了一个笨点的但是也比较好理解的思路,通过后 ...
1078. Hashing (25)-PAT甲级真题
1078. Hashing (25) The task of this problem is simple: insert a sequence of distinct positive intege ...
2020/7/25 pat甲级45分总结
额,第一次考甲级,慌慌的,第一题第三题都比较简单,就都写得很快,然后第二题就死磕了..题目中的difference一直当成"差异"来理解,然后一直想不出测试用例的答案是咋的出来的. ...
哈密顿回路 Java题解（图，模拟）【PAT甲级1122】
输入样例: 6 10 6 2 3 4 1 5 2 5 3 1 4 1 1 6 6 3 1 2 4 5 6 7 5 1 4 3 6 2 5 6 5 1 4 3 6 2 9 6 2 1 6 3 4 5 2 ...
1121. Damn Single (25)-PAT甲级真题
"Damn Single (单身狗)" is the Chinese nickname for someone who is being single. You are suppo ...
1090. Highest Price in Supply Chain (25)-PAT甲级真题
A supply chain is a network of retailers(零售商), distributors(经销商), and suppliers(供应商)-- everyone invo ...
1106. Lowest Price in Supply Chain (25)-PAT甲级真题(dfs,bfs,树的遍历)
A supply chain is a network of retailers(零售商), distributors(经销商), and suppliers(供应商)-- everyone invo ...

[Java] 1006. Sign In and Sign Out (25)-PAT甲级

[Java] 1006. Sign In and Sign Out (25)-PAT甲级相关推荐

最新文章

热门文章