1061. Dating (20)

1.第一对string中，DAY的char需要限制在A到G之间，一个星期只有7天；HOUR的char需要限制在A到N，0到9之间，这样才是合理的0~23小时

2.之前卡在了没有限制HOUR的char需要限制在A到N，0到9之间。

//#include<string>
//#include<stack>
//#include<unordered_set>
//#include <sstream>
//#include "func.h"
//#include <list>
#include <iomanip>
#include<unordered_map>
#include<set>
#include<queue>
#include<map>
#include<vector>
#include <algorithm>
#include<stdio.h>
#include<iostream>
#include<string>
#include<memory.h>
#include<limits.h>
#include<stack>
using namespace std;



int main(void)
{
	string num2Day[] = { "", "MON", "TUE", "WED", "THU", "FRI", "SAT", "SUN" };
	string first1, first2, second1, second2;
	//getline(cin, first1);
	//getline(cin, first2);
	//getline(cin, second1);
	//getline(cin, second2);
	cin >> first1>> first2>> second1>> second2;
	char dayChar = -1;
	char hourChar = -1;
	for (int i = 0; i < min(first1.size(), first2.size()); i++)
	{
		if (first1[i] == first2[i] &&( (first1[i] >= 'A'&&first1[i] <= 'N') || (first1[i] >= '0'&&first1[i] <= '9')))
		{//需要限制在A到N，0到9之间，这样才是合适的0~23小时显示，否则会出现测试点不过
			if (dayChar == -1 && (first1[i] >= 'A'&&first1[i] <= 'N'))
				dayChar = first1[i];
			else if (dayChar != -1)
			{
				hourChar = first1[i];
				break;
			}
		}
	}
	int mm;
	for (int i = 0; i < min(second1.size(), second2.size()); i++)
	{
		if (second1[i] == second2[i] && ((second1[i] >= 'A'&&second1[i] <= 'Z') || (second1[i] >= 'a'&&second1[i] <= 'z')))
		{
			mm = i;
		}
	}
	string day = num2Day[dayChar - 'A' + 1];
	string hour = "";
	int hourInt;
	if (hourChar >= 'A'&&hourChar <= 'Z')
		hourInt = hourChar - 'A' + 10;
	else
		hourInt = hourChar - '0';
	char c = hourInt / 10 + '0';
	hour += c;
	c = hourInt % 10 + '0';
	hour += c;
	cout << day << " " << hour;
	printf(":%02d\n", mm);


	return 0;
}