[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);
    }
}

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);

}

❤ 点击这里 -> 订阅《PAT | 蓝桥 | LeetCode学习路径 & 刷题经验》by 柳婼

❤ 点击这里 -> 订阅《从放弃C语言到使用C++刷算法的简明教程》by 柳婼

❤ 点击这里 -> 订阅PAT甲级乙级、蓝桥杯、GPLT天梯赛、LeetCode题解离线版