PAT 1084 Broken Keyboard python解法

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

解题思路：结果就是将第一行中有而第二行中没有的字符按照输入的顺序输出，有多个相同值只输出一次，输出结果中字母为大写字母。因为最后输出的结果中全是大写字母，想到可以先将两个字符串全部转成大写（利用upper()函数），定义一个列表储存最后的结果，然后对第一个字符串循环判断，如果其中的元素不在第二个字符串中，并且不在定义的列表中，则将该元素加入列表中。

original = input().upper() 
out = input().upper() 
#original = '7_This_is_a_test'
#out = '_hs_s_a_es'
worn = []
for i in original:
    if i not in out and i not in worn:
        worn.extend(i)
print(''.join(worn))