PAT-甲级-1006 Sign In and Sign Out

1006 Sign In and Sign Out (25)（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

 

分析

先输入人数

再输入每个人的编号，来的时间和走的时间。每个人占一行

来的最早的人开门，最晚的关门

输出开门和关门的人的编号

 

思路

长度变长，考虑用链表（单链表，带头结点），包含三个数据元素（用string存）

先输入长度（即人数），根据人数循环，每次循环增加一个结点，使用头插法插入链表

然后遍历链表找出来的最早的和最晚的

 

问题

含有string数据元素的链表申请空间时不能用malloc，要用new

如果要malloc，由于题目给了编号的最大长度15，时间的格式是固定的， 可以使用char[ ]

 

代码

#include<stdio.h>
#include<iostream>
#include <stdlib.h>
#include<iomanip>
#include <string>
#include <malloc.h>
using namespace std;
typedef struct LNode{
    string id;
    string in_time,out_time;
    struct LNode *next;
}LNode;
void creat(LNode *&C){
    C = (LNode*)malloc(sizeof(LNode));
    C->next = NULL;
}
void Insert(LNode *&C,string str[3]){
    LNode *s;
    s = C;
    s = new LNode();
    s->id = str[0];
    s->in_time = str[1];
    s->out_time = str[2];
  //  cout<<s->id<<" "<<s->in_time<<" "<<s->out_time;
    s->next = C->next;
    C->next = s;
}
void findlist(LNode *C,string &open,string &lock){
    LNode *p = C->next;
    string max_str,min_str;
    open = p->id;
    lock = p->id;
    min_str = p->in_time;
    max_str = p->out_time;
    while(p->next!=NULL){
        p = p->next;
        if(p->in_time<min_str) {
            min_str = p->in_time;
            open = p->id;
        }
        if(p->out_time>max_str) {
            max_str = p->out_time;
            lock = p->id;
        }
    }
}
int main(){
    LNode *s;
    creat(*&s);
    int m;
    cin>>m;
    int i = m;
    while(i){
        string str[3];
        cin>>str[0]>>str[1]>>str[2];
 //       cout<<str[0]<<" "<<str[1]<<" "<<str[2];
        Insert(s,str);
        i--;
    }
    string open,lock;
    findlist(s,open,lock);
    cout<<open<<" "<<lock;
    return 0;
}