大偵探福爾摩斯接到一張奇怪的字條:“我們約會吧! 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
java解法:
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
// TODO Auto-generated method stub
String[] weekarr = {"MON ", "TUE ","WED ","THU ", "FRI ", "SAT ", "SUN "};
Scanner scan = new Scanner(System.in);
String str1 = scan.next();
String str2 = scan.next();
String str3 = scan.next();
String str4 = scan.next();
char res1 = 'A', res2 = '0';
int res3 = 0;
int cou = 1;
int len1 = Math.min(str1.length(), str2.length());
int len2 = Math.min(str3.length(), str4.length());
for(int i = 0; i < len1; i++)
{
char chr1 = str1.charAt(i);
char chr2 = str2.charAt(i);
if(cou == 1)
{
if(chr1 == chr2 && chr1 <= 'Z' && chr2 >= 'A')
{ res1 = chr1; cou++; continue; }
}
else if(cou == 2)
{
if(chr1 == chr2 && ((chr1 <= '9' && chr1 >= '0')
|| (chr1 <= 'N' && chr1 >= 'A')))
{ res2 = chr2; break; }
}
}
for(int i = 0; i < len2; i++)
{
char chr1 = str3.charAt(i);
char chr2 = str4.charAt(i);
if(chr1 == chr2 && ((chr1 < 'z' && chr1 > 'a') ||
(chr1 < 'Z' && chr2 > 'A')))
{ res3 = i; break; }
}
String s1 = weekarr[res1 - 'A'];
String s2,s3;
if(res2 <= '9') { s2 = "0" + Integer.toString(res2 - '0'); }
else { s2 = Integer.toString(res2 - 'A' + 10); }
if(res3 <= 9) { s3 = "0" + Integer.toString(res3); }
else { s3 = Integer.toString(res3); }
String finalresult = s1 + s2 + ":" + s3;
System.out.print(finalresult);
}
}
結果超時。
C++解法:
#include<iostream>
#include<string>
using namespace std;
int main()
{
string weekarr[] = { "MON ", "TUE ", "WED ", "THU ", "FRI ", "SAT ", "SUN " };
string str1, str2, str3, str4;
getline(cin, str1);
getline(cin, str2);
getline(cin, str3);
getline(cin, str4);
char res1 = 'A', res2 = '0';
int res3 = 0, cou = 1;
int len1 = str1.length() < str2.length() ? str1.length() : str2.length();
int len2 = str3.length() < str4.length() ? str3.length() : str4.length();
for (int i = 0; i < len1; i++)
{
char chr1 = str1.at(i);
char chr2 = str2.at(i);
if (cou == 1)
{
if (chr1 == chr2 && chr1 <= 'G' && chr1 >= 'A')
{
res1 = chr1; cou++; continue;
}
}
else if (cou == 2)
{
if (chr1 == chr2 && ((chr1 <= '9' && chr1 >= '0') || (chr1 <= 'N' && chr2 >= 'A')))
{
res2 = chr2; break;
}
}
}
for (int i = 0; i < len2; i++)
{
char chr1 = str3.at(i);
char chr2 = str4.at(i);
if (chr1 == chr2 && ((chr1 <= 'z' && chr1 >= 'a') || (chr1 <= 'Z' && chr1 >= 'A')))
{
res3 = i; break;
}
}
string s1, s2, s3;
s1 = weekarr[res1 - 'A'];
cout << s1;
if (res2 <= '9')
{
printf("0%d:", res2 - '0');
}
else printf("%d:", res2 - 'A' + 10);
if (res3 <= 9)
{
printf("0%d", res3);
}
else printf("%d", res3);
return 0;
}
注意判斷邊界條件
if (chr1 == chr2 && chr1 <= 'G' && chr1 >= 'A')
表示星期的數要在'A' 到 'G'之間
if (chr1 == chr2 && ((chr1 <= '9' && chr1 >= '0') || (chr1 <= 'N' && chr2 >= 'A')))
表示小時的數要在 '0'到‘9’或'A'到'N'之間
表示分鐘的數由於每個字符串不超過60,因此不需要另外加判斷語句