PAT 1050 String Subtraction python解法

这是一个关于PAT编程竞赛中1050题目的解题报告,主要涉及字符串操作。题目要求从字符串S1中减去S2中出现的字符,输出结果。提供的Python解决方案是对S1遍历,只保留未在S2中出现的字符。

摘要生成于 C知道 ,由 DeepSeek-R1 满血版支持, 前往体验 >

1050 String Subtraction (20 分)
Given two strings S​1​​​ and S​2​​​ , S=S​​1​​​−S​​2​​​ is defined to be the remaining string after taking all the characters in S​​2​​​ from S​​1​​​ . Your task is simply to calculate S​1​​−S​2​​ for any given strings. However, it might not be that simple to do it fast.

Input Specification:
Each input file contains one test case. Each case consists of two lines which gives S​1​​​ and S​​2​​​ , respectively. The string lengths of both strings are no more than 10​4​​ . It is guaranteed that all the characters are visible ASCII codes and white space, and a new line character signals the end of a string.

Output Specification:
For each test case, print S​1​​​ −S​​2​​​ in one line.

Sample Input:
They are students.
aeiou
Sample Output:
Thy r stdnts.

题意:对两个字符串 S​1​​​和S​​2做减法,结果是S​1有而S​2中没有的字符。

解题思路:对S​1中每个元素,如果该元素不在S​2中,则输出。

s1 = input()
s2 = input()
#s1 = 'They are students.'
#s2 = 'aeiou'
for i in s1:
    if i not in s2:
        print(i,end='')
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包

打赏作者

D_ry

你的鼓励将是我创作的最大动力

¥1 ¥2 ¥4 ¥6 ¥10 ¥20
扫码支付:¥1
获取中
扫码支付

您的余额不足,请更换扫码支付或充值

打赏作者

实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

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

余额充值