1014 福尔摩斯的约会 (20 分)

最新推荐文章于 2022-11-19 16:34:58 发布

SYaoJun

最新推荐文章于 2022-11-19 16:34:58 发布

阅读量142

点赞数

分类专栏： PAT乙级真题题解字符串

本文链接：https://blog.csdn.net/SYaoJun/article/details/100160478

版权

PAT乙级真题题解同时被 2 个专栏收录

115 篇文章 8 订阅

订阅专栏

字符串

114 篇文章 0 订阅

订阅专栏

注意
DAY：扫描第一对相同的大写字母A~G
HH: 在扫描到DAY之后，再扫描第一对是数字和大写字母A~N的字符
MM：扫描相同英文字符

#include <iostream>
#include <string>
#include <vector>
#include <cctype>
#include <cstdio>
#include <unordered_map>
#include <algorithm>
using namespace std;
int main(){
	string s1, s2, s3, s4;
	unordered_map<char, string> mp;
	mp['A'] ="MON";
	mp['B'] ="TUE";
	mp['C'] ="WED";
	mp['D'] ="THU";
	mp['E'] ="FRI";
	mp['F'] ="SAT";
	mp['G'] ="SUN";
	
	cin>>s1>>s2>>s3>>s4;
	char week, hour;
	int minute;
	int cnt = 0;
	bool tag = false;
	for(int i = 0; i < s1.size() && i < s2.size(); i++){
		if(s1[i] >= 'A' && s1[i] <= 'G' && s1[i] == s2[i] && !tag){
			week = s1[i];
			tag = true;
			continue;
		}
		if(tag && s1[i] == s2[i] && (isdigit(s1[i])|| s1[i] >= 'A' && s1[i] <= 'N')){
			hour = s1[i];
			break;
		}
	}
	
	for(int i = 0; i < s3.size() && i < s4.size(); i++){
		if(s3[i] == s4[i]&& isalpha(s3[i])) {
			minute = i;
			break;
		}
	}
	int h = isdigit(hour) ? hour - '0' : hour - 'A' + 10;
	cout<<mp[week]<<" ";
	printf("%02d:%02d\n", h, minute);
	return 0;
}