PTA 1014 福尔摩斯的约会(详解+代码)

解析：这道题先用字符串数组来存储输入的字符串，然后遍历数组中单个字符串里的字符比较下一个字符串的字符，根据题目进行处理。知识点比较陌生的就是格式化输出，
System.out.printf("%02d",ch-‘0’);代表占俩位
System.out.printf("%02d\n",y); 代表占俩位换行
System.out.printf("%.1f",y);保留一位小数点

public class Pta_1014 {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        String[] str=new String[4];
        List<Integer> list=new ArrayList<Integer>();
        String[] week = { "MON", "TUE", "WED", "THU", "FRI", "SAT", "SUN" };
       int  colok=0;
        int minite=0;
        for(int i=0;i<4;i++){
            str[i]=scanner.nextLine();
        }
        //周
        int j;
        char ch;
        int len =str[0].length();
        for(j=0;j<len;j++){
            ch=str[0].charAt(j);
            if(ch==str[1].charAt(j)){
                     if(ch >='A'&&ch<='G'){
                         System.out.print(week[ch-'A']+" ");
                         break;
                     }
            }
        }

        //小时
        for(int x=j+1;x<len;x++){
            ch=str[0].charAt(x);
            if(ch==str[1].charAt(x)){
                        if(ch>='0'&&ch<='9'){
                            System.out.printf("%02d",ch-'0');
                            System.out.print(":");
                            break;
                        }
                        if(ch>='A'&&ch<='N'){
                            System.out.printf("%02d",ch-'A'+10);
                            System.out.print(":");
                            break;
                        }
            }
        }
        //分钟

       for(int y=0;y<str[2].length();y++){
           char c = str[2].charAt(y);
           if(c==str[3].charAt(y)){
               if(c>='a'&&c<='z'||c>='A'&&c<='Z'){
                   System.out.printf("%02d\n",y);
                   break;
               }
           }
       }

    }
}