zoukankan      html  css  js  c++  java
  • 1084. Broken Keyboard (20)

    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


    #include<iostream>
    #include<cstdio>
    #include<cstring>
    using namespace std;
    string s,d;
    void change(string ss){
    	int len=ss.size();
    	for(int i=0;i<len;i++){
    		if(ss[i]>='A'&&ss[i]<='Z'){
    			ss[i]=ss[i]-'A'+'a';
    		}
    	}
    }
    int main(){
    	char ch;
    	int digital[10];
    	int letters[26];
    	memset(digital,-1,sizeof(digital));
    	memset(letters,-1,sizeof(letters));
    	cin>>s;
    	cin>>d;
    	change(s);
    	change(d);
    	int len=s.size();
    	for(int i=0;i<len;i++){
    		if(s[i]<='z'&&s[i]>='a'){
    			letters[s[i]-'a']=1;
    		}else if(s[i]>='0'&&s[i]<='9'){
    			digital[s[i]-'0']=1;
    		}else {
    			ch=s[i];
    		}
    	}
    	len = d.size();
    	int t;
    	for(int i=0;i<len;i++){
    		if(d[i]<='z'&&d[i]>='a'){
    			t=d[i]-'a';
    			if(letters[t]!=1 && letters[t]!=0){
    				printf("%c",t+'A');
    				letters[t]=0;
    			}
    		}else if(d[i]<='9'&&d[i]>='0'){
    			t=d[i]-'0';
    			if(digital[t]!=1&&digital[t]!=0){
    				printf("%d",t);
    				digital[t]=0;
    			}
    		}else {
    			if(ch!='_'){
    				printf("%c",ch);
    				ch='_';
    			}
    		}
    	}
    	printf("
    ");
    	return 0;
    }
    

      



  • 相关阅读:
    多线程-死锁代码示例
    区块链技术:以太方学习文档
    svn 不能校验路径“XXX”的锁;没有匹配的可用锁令牌 故障解决方法
    Oracle ORA-27102的解决办法(out of memory)
    Linux常用命令语法+示例
    Java如何实现form表单提交的数据自动对应实体类(源码)
    Java分布式锁看这篇就够了
    quartz时间配置
    volatile 实现原理
    == 和 equals()的区别
  • 原文地址:https://www.cnblogs.com/grglym/p/7892218.html
Copyright © 2011-2022 走看看