动态规划O - How to Type HDU - 2577

最新推荐文章于 2022-07-22 01:11:50 发布

森林海的棕熊

最新推荐文章于 2022-07-22 01:11:50 发布

阅读量231

点赞数

CC 4.0 BY-SA版权

分类专栏：随笔文章标签：动态规划

本文链接：https://blog.youkuaiyun.com/qq951127336/article/details/78408168

随笔专栏收录该内容

40 篇文章

订阅专栏

本文介绍了一种算法，用于计算在特定打字习惯下完成输入字符串所需的键盘敲击最小次数。通过分析大小写字母输入状态，该算法考虑了Caps Lock键的影响，提供了一个实用的解决方案。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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

import java.util.ArrayList;
import java.util.Scanner;

/**
 * Created by 95112 on 10/31/2017.
 */
public class HowToType {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int t = scanner.nextInt();
        ArrayList<String> answers = new ArrayList<>();
        scanner.nextLine();
        for (int i = 0; i < t; i++) {
            String input = scanner.nextLine();
            int start = 0;
            int end = 0;
            int dValue = 0;
            int sum = 0;
            int times = 0;
            boolean nowUp = false;
            boolean capsOn = false;
            boolean isUp = false;
            for (int j = 0; j < input.length(); j++) {

                char cache = input.charAt(j);

                if (cache - 'A' >= 0 && cache - 'A' <= 25) {
                    isUp = true;
                } else {
                        isUp = false;
                }
                if (isUp != nowUp){
                    times++;
                    dValue = end -start + 1;


                    if (j == 0){
                        sum++;
                        nowUp = isUp;
                        continue;
                    }
                    if ((dValue > 1 && capsOn != nowUp )|| (dValue >1&& start ==0 && nowUp  )){
                        capsOn = !capsOn;
                        sum++;
                    }
                    else if ((capsOn!=nowUp && dValue == 1) || (start == 0 && dValue == 1 && nowUp)){
                        sum++;
                    }
                    else if (capsOn == nowUp){

                    }
                    nowUp = isUp;
                    start = j;
                    end = j;
                }
                else{
                    end = j;
                }
                sum++;
            }
            dValue = end - start + 1;
            if (isUp){
                if (dValue > 1 && !capsOn)
                    sum += 2;
                else
                    sum += 1;
            }
            else{
                if (capsOn)
                    sum += 1;

            }

            answers.add(sum + "");
        }
        for (String answer : answers)
            System.out.println(answer);
    }
}