PTA 1061 Dating

题目描述

分析：找出字符串中相同的字符，利用map存储字符的对应关系

#include<unordered_map>
#include<cstdio>
#include<iostream>
#include<string>
#include<algorithm>
using namespace std;
typedef long long ll;

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    unordered_map<char,string> week={{'A', "MON"}, {'B', "TUE"}, {'C', "WED"}, {'D', "THU"},
                                        {'E', "FRI"}, {'F', "SAT"}, {'G', "SUN"}};
    unordered_map<char,int> hour;
    for(int i=0;i<24;i++){
        if(i<10){
            hour.insert({i+'0',i});
        }
        else{
            hour.insert({i-10+'A',i});
        }
    }
    string s1,s2;
    cin>>s1>>s2;
    int num=0;
    for(int i=0;i<min(s1.size(),s2.size());i++){
          if(s1[i]==s2[i]&&num==0&&week.count(s1[i])){
              cout<<week[s1[i]]<<" ";
              num++;
          }
          else if(s1[i]==s2[i]&&num==1&&hour.count(s1[i])){
              printf("%02d:",hour[s1[i]]);
              break;
          }
    }
    cin>>s1>>s2;
    for(int i=0;i<min(s1.size(),s2.size());i++){
        if(s1[i]==s2[i]&&isalpha(s1[i])){
            printf("%02d",i);
            break;
        }
    }
    return 0;
}