PAT1084 Java

PAT笔记

1084 Broken Keyboard

On a broken keyboard, some of the keys are worn out. So when you type some sentences, the characters corresponding to those keys will not appear on screen.Now given a string that you are supposed to type, and the string that you actually type out, please list those keys which are for sure worn out.

Input Specification:

Each input file contains one test case. For each case, the 1st line contains the original string, and the 2nd line contains the typed-out string. Each string contains no more than 80 characters which are either English letters [A-Z] (case insensitive), digital numbers [0-9], or_ (representing the space). It is guaranteed that both strings are non-empty.

Output Specification:

For each test case, print in one line the keys that are worn out, in the order of being detected. The English letters must be capitalized. Each worn out key must be printed once only. It is guaranteed that there is at least one worn out key.

利用两个指针分别遍历s1,s2，这里我们往s2末尾追加一个没有出现过的字符，这样不会越界。
加一个标志位，如果之前字符没有出现过，就将字符加入到结果中。

import java.util.*;
public class Main{
    public static void main(String[]args){
           Scanner input=new Scanner(System.in);
           String s1=input.next();
           String s2=input.next();
        s2+="%";
        int freq[]=new int[128];
        StringBuilder sb=new StringBuilder();
         for(int i=0,j=0;i<s1.length();i++){
               char c1=up(s1.charAt(i)),c2=up(s2.charAt(j));
               if(c1==c2) j++;
             else{
                  if(freq[c1]==0){
                      sb.append(c1);
                      freq[c1]++;
                  }
             }
         }
        System.out.println(sb.toString());
          
    }
    private  static char up(char c){
         if(c>='a'&&c<='z') return (char)(c-32);
        return c;
    }
}