问题描述
大侦探福尔摩斯接到一张奇怪的字条:“我们约会吧! 3485djDkxh4hhGE 2984akDfkkkkggEdsb s&hgsfdk d&Hyscvnm”。大侦探很快就明白了,字条上奇怪的乱码实际上就是约会的时间"星期四 14:04",因为前面两字符串中第 1 对相同的大写英文字母(大小写有区分)是第 4 个字母 D,代表星期四;第 2 对相同的字符是 E ,那是第 5 个英文字母,代表一天里的第 14 个钟头(于是一天的 0 点到 23 点由数字 0 到 9、以及大写字母 A 到 N 表示);后面两字符串第 1 对相同的英文字母 s 出现在第 4 个位置(从 0 开始计数)上,代表第 4 分钟。现给定两对字符串,请帮助福尔摩斯解码得到约会的时间。
输入格式:
输入在 4 行中分别给出 4 个非空、不包含空格、且长度不超过 60 的字符串。
输出格式:
在一行中输出约会的时间,格式为 DAY HH:MM,其中 DAY 是某星期的 3 字符缩写,即 MON 表示星期一,TUE 表示星期二,WED 表示星期三,THU 表示星期四,FRI 表示星期五,SAT 表示星期六,SUN 表示星期日。题目输入保证每个测试存在唯一解。
输入样例:
3485djDkxh4hhGE
2984akDfkkkkggEdsb
s&hgsfdk
d&Hyscvnm
输出样例:
THU 14:04
实现代码
#include<iostream>
#include<string>
using namespace std;
int main() {
string arr[4];
char week;
char hour;
for (int i = 0; i < 4; i++) {
getline(cin, arr[i]);
}
int length1;
if (arr[0].size() > arr[1].size()) {
length1 = arr[1].size();
}
else {
length1 = arr[0].size();
}
bool flag = false;
for (int i = 0; i < length1; i++) {
char temp = arr[0].at(i);
if (flag == false) {
if (temp == arr[1].at(i) && temp >= 'A' && temp <= 'G') {
week = temp;
flag = true;
continue;
}
}
else {
if (temp == arr[1].at(i) && ((temp >= 'A' && temp <= 'N') || (temp >= '0' && temp <= '9'))) {
hour = temp;
break;
}
}
}
switch (week) {
case 'A':
cout << "MON ";
break;
case 'B':
cout << "TUE ";
break;
case 'C':
cout << "WED ";
break;
case 'D':
cout << "THU ";
break;
case 'E':
cout << "FRI ";
break;
case 'F':
cout << "SAT ";
break;
case 'G':
cout << "SUN ";
break;
}
switch (hour) {
case '0':
cout << "00:";
break;
case '1':
cout << "01:";
break;
case '2':
cout << "02:";
break;
case '3':
cout << "03:";
break;
case '4':
cout << "04:";
break;
case '5':
cout << "05:";
break;
case '6':
cout << "06:";
break;
case '7':
cout << "07:";
break;
case '8':
cout << "08:";
break;
case '9':
cout << "09:";
break;
case 'A':
cout << "10:";
break;
case 'B':
cout << "11:";
break;
case 'C':
cout << "12:";
break;
case 'D':
cout << "13:";
break;
case 'E':
cout << "14:";
break;
case 'F':
cout << "15:";
break;
case 'G':
cout << "16:";
break;
case 'H':
cout << "17:";
break;
case 'I':
cout << "18:";
break;
case 'J':
cout << "19:";
break;
case 'K':
cout << "20:";
break;
case 'L':
cout << "21:";
break;
case 'M':
cout << "22:";
break;
case 'N':
cout << "23:";
break;
}
int length2;
if (arr[2].size() > arr[3].size()) {
length2 = arr[3].size();
}
else {
length2 = arr[2].size();
}
int timeIndex;
for (int i = 0; i < length2; i++) {
char temp = arr[2].at(i);
if (temp == arr[3].at(i) && ((temp >= 'A' && temp <= 'Z') || (temp >= 'a' && temp <= 'z'))) {
timeIndex = i;
break;
}
}
if (timeIndex < 10) {
cout << "0" << timeIndex;
}
else {
cout << timeIndex;
}
return 0;
}
notes:
Q1:减少switch部分的代码量
A:用数组存储相应字符串后用下标索引输出。
string weekArr[7] = { "MON ","TUE ","WED ","THU ","FRI ","SAT ","SUN " };
string hourArr[24] = { "00:","01:","02:", "03:", "04:", "05:", "06:", "07:", "08:", "09:", "10:", "11:", "12:", "13:", "14:", "15:","16:","17:","18:","19:","20:", "21:","12:","23:" };
//以下替换实现代码中switch部分
cout << weekArr[week - 65];
if (hour >= '0' && hour <= '9') {
cout << hourArr[hour - 48];
}
else {
cout << hourArr[hour - 55]; //A对应下标为10 即减去ascii值后再加10
}