zoukankan      html  css  js  c++  java
  • [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 }
  • 相关阅读:
    delete 用法总结
    js数组去重的常用方法总结
    学习中 常用到的string内置对象方法的总结
    Array 对象常用的方法总结
    javascript中运算符有哪些? 他们的优先级 呢?
    那些年前端经典面试题
    HHVM 3.0 发布,执行 PHP 的虚拟机
    【问底】徐汉彬:PHP7和HHVM的性能之争 (真是学到了很多)
    mysql 简单sql语句
    【问底】王帅:深入PHP内核(一)——弱类型变量原理探究
  • 原文地址:https://www.cnblogs.com/PureJava/p/10498196.html
Copyright © 2011-2022 走看看