B1061 Dating (20分)

首先,先贴柳神的博客

https://www.liuchuo.net/ 这是地址

想要刷好PTA,强烈推荐柳神的博客,和算法笔记

题目原文

Sherlock Holmes received a note with some strange strings: Let's date! 3485djDkxh4hhGE 2984akDfkkkkggEdsb s&hgsfdk d&Hyscvnm. It took him only a minute to figure out that those strange strings are actually referring to the coded time Thursday 14:04 -- since the first common capital English letter (case sensitive) shared by the first two strings is the 4th capital letter D, representing the 4th day in a week; the second common character is the 5th capital letter E, representing the 14th hour (hence the hours from 0 to 23 in a day are represented by the numbers from 0 to 9 and the capital letters from A to N, respectively); and the English letter shared by the last two strings is s at the 4th position, representing the 4th minute. Now given two pairs of strings, you are supposed to help Sherlock decode the dating time.

Input Specification:

Each input file contains one test case. Each case gives 4 non-empty strings of no more than 60 characters without white space in 4 lines.

Output Specification:

For each test case, print the decoded time in one line, in the format DAY HH:MM, where DAY is a 3-character abbreviation for the days in a week -- that is, MON for Monday, TUE for Tuesday, WED for Wednesday, THU for Thursday, FRI for Friday, SAT for Saturday, and SUN for Sunday. It is guaranteed that the result is unique for each case.

Sample Input:

3485djDkxh4hhGE
2984akDfkkkkggEdsb
s&hgsfdk
d&Hyscvnm

Sample Output:

THU 14:04

生词如下

capital 大写的

sensitive 敏感的

case

题目大意

就是要你解密,给定4个字符串要你解出对应的时间

开始的前两个字符串找天数和小时

最后的两个字符串找分钟

注意点:

① 天数有要求的:只能找A-G

② 小时也要要求,只能A-N或者0-9

③ 分钟只要是大写字母就可以的,但是分钟的计数是记录当前的位置,和数组一样的记录方式,0-59

④ 小时和分钟都一定有输出两位,不足的要补零

我自己垃圾代码如下:

#include<iostream>
#include<cstring>
#include<iomanip>
using namespace std;
int main(void) {
int flag = 0, Position=1;
char Put[4][61];
char Day='0', Hour, Minute;
for (int i = 0; i < 4; i++) {
cin >> Put[i];
}
//Min选的是Put[0]和Put[1]里面最短的那个长度
int Min = strlen(Put[0]) > strlen(Put[1]) ? strlen(Put[1]) : strlen(Put[0]);
for (int i = 0; i < Min; i++) {
if ((Put[0][i] >= 'A' && Put[0][i] <= 'N') || (Put[0][i] >= '0' && Put[0][i] <= '9')) {
if (Put[0][i] == Put[1][i] && flag == 1) {
Hour = Put[0][i];
break;
}
}
if (Put[0][i] >= 'A' && Put[0][i] <= 'G') {
if (Put[0][i] == Put[1][i]&&flag==0) {
Day = Put[0][i];
flag = 1;
}
}
}
Min = strlen(Put[2]) > strlen(Put[3]) ? strlen(Put[3]) : strlen(Put[2]);
for (int i = 0; i < Min; i++) {
if ((Put[2][i] >= 'a' && Put[2][i] <= 'z') || (Put[2][i] >= 'A' && Put[2][i] <= 'Z')) {
if (Put[2][i] == Put[3][i]) {
Position = i;
break;
}
}
} if (Day == 'A') cout << "MON ";
else if (Day == 'B')cout << "TUE ";
else if (Day == 'C')cout << "WED ";
else if (Day == 'D')cout << "THU ";
else if (Day == 'E')cout << "FRI ";
else if (Day == 'F')cout << "SAT ";
else if (Day == 'G')cout << "SUN ";
else; if (Hour >= '0' && Hour <= '9') {
cout << '0' << Hour<<':';
}
else if(Hour >= 'A' && Hour <= 'N') {
cout << int(Hour - 55)<<':';
} if (Position < 10&&Position>=0) {
cout << '0' << Position;
}
else if(Position)
cout << Position; return 0;
}

柳神的代码

#include <iostream>
#include <cctype>
using namespace std;
int main() {
string a, b, c, d;
cin >> a >> b >> c >> d;
char t[2];
int pos, i = 0, j = 0;
while (i < a.length() && i < b.length()) {
if (a[i] == b[i] && (a[i] >= 'A' && a[i] <= 'G')) {
t[0] = a[i];
break;
}
i++;
}
i = i + 1;
while (i < a.length() && i < b.length()) {
if (a[i] == b[i] && ((a[i] >= 'A' && a[i] <= 'N') || isdigit(a[i]))) {
t[1] = a[i];
break;
}
i++;
}
while (j < c.length() && j < d.length()) {
if (c[j] == d[j] && isalpha(c[j])) {
pos = j;
break;
}
j++;
}
string week[7] = { "MON ", "TUE ", "WED ", "THU ", "FRI ", "SAT ", "SUN " };
int m = isdigit(t[1]) ? t[1] - '0' : t[1] - 'A' + 10;
cout << week[t[0] - 'A'];
printf("%02d:%02d", m, pos);
return 0;
}

总结和反思

柳神的代码比我的短一倍

主要是因为柳神用了

isdigit() 来判断是不是数字

isalpha() 来判断是不是字母

还有一个字符数组

我的就很蠢

PTA甲级B1061 Dating的更多相关文章

  1. PTA甲级1094 The Largest Generation (25分)

    PTA甲级1094 The Largest Generation (25分) A family hierarchy is usually presented by a pedigree tree wh ...

  2. PAT 甲级 1061 Dating (20 分)(位置也要相同,题目看不懂)

    1061 Dating (20 分)   Sherlock Holmes received a note with some strange strings: Let's date! 3485djDk ...

  3. PAT甲级——A1061 Dating

    Sherlock Holmes received a note with some strange strings: Let's date! 3485djDkxh4hhGE 2984akDfkkkkg ...

  4. PAT甲级——1061 Dating (20分)

    Sherlock Holmes received a note with some strange strings: Let's date! 3485djDkxh4hhGE 2984akDfkkkkg ...

  5. PAT甲级——1061 Dating

    1061 Dating Sherlock Holmes received a note with some strange strings: Let's date! 3485djDkxh4hhGE 2 ...

  6. PAT甲级1061 Dating

    题目:https://pintia.cn/problem-sets/994805342720868352/problems/994805411985604608 题意: 给定四个字符串. 前两个字符串 ...

  7. PTA 甲级 1139

    https://pintia.cn/problem-sets/994805342720868352/problems/994805344776077312 其实这道题目不难,但是有很多坑点! 首先数据 ...

  8. PTA甲级—链表

    1032 Sharing (25分) 回顾了下链表的基本使用,这题就是判断两个链表是否有交叉点. 我最开始的做法就是用cnt[]记录每个节点的入度,发现入度为2的节点即为答案.后来发现这里忽略了两个链 ...

  9. PTA甲级—STL使用

    1051 Pop Sequence (25分) [stack] 简答的栈模拟题,只要把过程想清楚就能做出来. 扫描到某个元素时候,假如比栈顶元素还大,说明包括其本身的在内的数字都应该入栈.将栈顶元素和 ...

随机推荐

  1. t-io Java构建p2p网络

    Java 构建p2p网络 这篇文章是一篇关于pbft算法实现的一篇补充文章,但是在这里不会涉及pbft的算法方面,所以可以当做一篇单独的文章食用.如果想查看关于区块链或者PBFT算法的文章,可以参考一 ...

  2. 《Android Studio实战 快速、高效地构建Android应用》--三、重构代码

    要成为高效的Android程序员,需要头脑灵活,能够在开发.调试和测试的过程中重构代码,重构代码最大的风险是可能会引入意外的错误,Android Studio通过分析某些具有危险性的重构操作来降低风险 ...

  3. NR / 5G - The Best CQI algorithm

  4. MySQL读写分离---Mycat

    一.什么是读写分离 在数据库集群架构中,让主库负责处理事务性查询,而从库只负责处理select查询,让两者分工明确达到提高数据库整体读写性能.当然,主数据库另外一个功能就是负责将事务性查询导致的数据变 ...

  5. Iptables netstat 防御简单dos攻击

    DoS攻击或者DDoS攻击是试图让机器或者网络资源不可用的攻击.这种攻击的攻击目标网站或者服务通常是托管在高防服务器比如银行,信用卡支付网管,甚至根域名服务器,DOS攻击的实施通常迫使目标重启计算机或 ...

  6. [Python]公司接口返回值规范

    返回值规范 json { "code":200, "message":"" "data":[ { "title ...

  7. 【阿里云IoT+YF3300】15.阿里云物联网小程序构建

    2013年8月,“轻应用”概念提出,但是仅仅活跃四年随后淡出 ,直到2017年1月9号借助微信小程序成功续命.一时间,以微信小程序和支付宝小程序为代表的轻应用解决方案迅速贯穿多个环节,成为“万物互联” ...

  8. 对象级别锁 vs 类级别锁(Java)

    前言 对于多线程(并发)和Spring Boot这两块在同步进行学习中,在看到使用synchronized关键字使操作同步时,看到和C#中不一样的东西,所以这里呢,就深入学习了下,若有错误之处,还望指 ...

  9. java的异常体系 及强制转换

    一,异常 1.常见的几种异常: StackOverFlow  栈溢出错误:写递归函数的时候,没有定义递归结束的条件. ArrayIndexOutofBounds   数组越界:如新new一个数组,in ...

  10. Linux运维-磁盘存储---3.LVM

    LVM的工作原理 LVM( Logical Volume Manager)逻辑卷管理,是在磁盘分区和文件系统之间添加的一个逻辑层,来为文件系统屏蔽下层磁盘分区布局,提供一个抽象的盘卷,在盘卷上建立文件 ...