题目:
Pirates have finished developing the typing software. He called Cathy to test his typing software. She is good at thinking. After testing for several days, she finds that if she types a string by some ways, she will type the key at least. But she has a bad habit that if the caps lock is on, she must turn off it, after she finishes typing. Now she wants to know the smallest times of typing the key to finish typing a string.
Input
The first line is an integer t (t<=100), which is the number of test case in the input file. For each test case, there is only one string which consists of lowercase letter and upper case letter. The length of the string is at most 100.
Output
For each test case, you must output the smallest times of typing the key to finish typing this string.
Sample Input
3
Pirates
HDUacm
HDUACM
Sample Output
8
8
8
Hint
The string “Pirates”, can type this way, Shift, p, i, r, a, t, e, s, the answer is 8.
The string “HDUacm”, can type this way, Caps lock, h, d, u, Caps lock, a, c, m, the answer is 8
The string “HDUACM”, can type this way Caps lock h, d, u, a, c, m, Caps lock, the answer is 8
题意:
要求输入一个字符串,求出按键盘的最少次数。
使用Caps Lock和Shift两种转换大小写输入的方式 。
思路:
用两个数组分别记录大小写的开关状态。
感觉这个题真的很难理解,我参考了csdn上的思路。
AC代码
#include <stdio.h>
#include <string.h>
#include <algorithm>
using namespace std;
char str[111];
int dp1[111],dp2[111];
int main()
{
int t,i,len,flag;
scanf("%d",&t);
while(t--)
{
scanf("%s",str+1);
dp1[0] = 0;
dp2[0] = 1;
for(i = 1; str[i]; i++)
{
if(str[i]>='a' && str[i]<='z')
{
dp1[i] = min(dp1[i-1]+1,dp2[i-1]+2);//若大写锁定关闭,则直接输入,+1;若大写锁定打开,则需要先关闭,在输入,+2;
dp2[i] = min(dp1[i-1]+2,dp2[i-1]+2);//若大写锁定关闭,先输入,再打开,+2;若大写锁定打开,用shift输入,+2;
}
else if(str[i]>='A' && str[i]<='Z')
{
dp1[i] = min(dp1[i-1]+2,dp2[i-1]+2);//若大写锁定关闭,则用shift输入,+2,+2;若大写锁定打开,先输入,再关闭,+2;
dp2[i] = min(dp1[i-1]+2,dp2[i-1]+1);//若大写锁定关闭,先打开,再输入,+2;若大写锁定打开,则直接输入,+1;
}
}
printf("%d\n",min(dp2[i-1]+1,dp1[i-1]));//最后要关灯,dp2要+1
}
return 0;
}