zoukankan      html  css  js  c++  java
  • [PAT]1006 Sign In and Sign Out (25 分)Java

    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


     1 import java.util.*;
     2 
     3 /**
     4  * @Auther: Xingzheng Wang
     5  * @Date: 2019/2/17 22:42
     6  * @Description: pattest
     7  * @Version: 1.0
     8  */
     9 public class PAT1006 {
    10     public static void main(String[] args) {
    11         Scanner sc = new Scanner(System.in);
    12         int n = sc.nextInt();
    13         Employee[] emp = new Employee[n];
    14         for (int i = 0; i < n; i++) {
    15             emp[i] = new Employee();
    16             emp[i].name = sc.next();
    17             emp[i].intime = sc.next();
    18             emp[i].outtime = sc.next();
    19         }
    20         Arrays.sort(emp, new EComparator(0));
    21         System.out.print(emp[0].name + " ");
    22         Arrays.sort(emp, new EComparator(1));
    23         System.out.print(emp[n - 1].name);
    24     }
    25 }
    26 
    27 class Employee {
    28     String name;
    29     String intime;
    30     String outtime;
    31 }
    32 
    33 class EComparator implements Comparator<Employee> {
    34     public int flag;
    35 
    36     public EComparator(int flag) {
    37         this.flag = flag;
    38     }
    39 
    40     @Override
    41     public int compare(Employee o1, Employee o2) {
    42         if (flag == 0) {
    43             return o1.intime.compareTo(o2.intime);
    44         } else {
    45             return o1.outtime.compareTo(o2.outtime);
    46         }
    47     }
    48 }
  • 相关阅读:
    工作实战之项目常用技术
    Thymeleaf的错误解决方式
    实用小demo
    idea常用的几个插件
    idea2019+Plugins中搜索不到任何插件解决办法
    git的初体验
    springboot2.+的整合log4j2错误解决浅谈
    MobaXterm百度网盘下载
    阿里云RDS云数据库连接步骤
    读源码学编程之——死循环妙用
  • 原文地址:https://www.cnblogs.com/PureJava/p/10497948.html
Copyright © 2011-2022 走看看