[PAT] 1084 Broken Keyboard (20 分)Java

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.

Sample Input:

7_This_is_a_test
_hs_s_a_es

Sample Output:

7TI

 1 package pattest;
 2 
 3 import java.io.BufferedReader;
 4 import java.io.IOException;
 5 import java.io.InputStreamReader;
 6 import java.util.LinkedHashSet;
 7 import java.util.Set;
 8 
 9 /**
10  * @Auther: Xingzheng Wang
11  * @Date: 2019/2/26 23:24
12  * @Description: pattest
13  * @Version: 1.0
14  */
15 public class PAT1084 {
16     public static void main(String[] args) throws IOException {
17         BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
18         String s1 = reader.readLine().toUpperCase();
19         String s2 = reader.readLine().toUpperCase();
20         char[] c1 = s1.toCharArray();
21         char[] c2 = s2.toCharArray();
22         Set<Character> set1 = new LinkedHashSet<>();
23         Set<Character> set2 = new LinkedHashSet<>();
24         for (int i = 0; i < c1.length; i++) {
25             set1.add(c1[i]);
26         }
27         for (int i = 0; i < c2.length; i++) {
28             set2.add(c2[i]);
29         }
30         for (Character c : set2)
31             set1.remove(c);
32         for (Character c : set1)
33             System.out.print(c);
34     }
35 }

 

转载于:https://www.cnblogs.com/PureJava/p/10498196.html

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值