1050 String Subtraction (20 分)_10行代码AC

来老铁干了这碗代码

于 2021-02-23 18:58:31 发布

阅读量517

点赞数

CC 4.0 BY-SA版权

分类专栏： # 浙大-PAT-甲级文章标签： PAT PAT甲级

本文链接：https://blog.csdn.net/weixin_43899069/article/details/114000718

浙大-PAT-甲级专栏收录该内容

59 篇文章

订阅专栏

本文介绍了一种使用C++快速计算并移除字符串中子串的方法，通过建立字符计数表实现。在给定的样例中，展示了如何从'Theyarestudents.'中移除所有'aeiou'，得到'Thrystdnts.'。这是一种简洁且高效的字符串操作技巧，适用于处理大量字符串数据。

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

立志用最少的代码做最高效的表达

PAT甲级最优题解——>传送门

Given two strings S1 and S2, S=S1−S2 is defined to be the remaining string after taking all the characters in S2 from S1. Your task is simply to calculate S1−S2 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 S1 and S2, respectively. The string lengths of both strings are no more than 104. 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 S1−S2 in one line.

Sample Input:
They are students.
aeiou

Sample Output:
Thy r stdnts.

查询表算法。

#include<bits/stdc++.h>
using namespace std;
int a[300];
int main() {
	string s1, s2; 
	getline(cin, s1);  getline(cin, s2);
	for(auto i : s2) a[i]++;
	for(auto i : s1) if(a[i] == 0) cout << i;
	return 0;
}